Datasets:

---

mlfoundations-dev

/

Codeforces-Python-Submissions_processed

like 0

Follow

ML Foundations Development 67

[ "#!/usr/bin/env python3\n\nfrom sys import stdin\n\nn = int(stdin.readline().strip())\n\nout = (n - 2) ** 2\n\nprint(out)\n", "import sys\n\n\n#sys.stdin = open(\"input.txt\")\n#sys.stdout = open(\"output.txt\", \"w\")\n\nn = int(input())\nans = (n - 4) * (n - 3) + 2 * (n - 3) + (n - 2)\nprint(ans) ", "# print (\"Input n\")\nn = int(input())\nprint(n*n - 4*n + 4)\n", "def belochka(n):\r\n return (n - 2) ** 2\r\n\r\n\r\nprint(belochka(int(input())))\r\n", "n = int(input())\nprint(1 + 3*(n-3) + (n-3)*(n-4))", "n=int(input())\nprint((n-3)*(n-1)+1)\n", "n = int(input())\r\nprint(n - 2 + (n - 3) * 2 + (n - 4) * (n - 3))\r\n", "a=int(input())\r\nprint((a-2)*(a-2))", "n = int(input())\n\nk = n - 3\n\nif n == 3:\n print(1)\nelse:\n res = (k + 1)\n res = res + k + k\n for i in range(3, n):\n if i - 3 > 0:\n res = res + (i - 3)\n if n - i - 1 > 0:\n res = res + (n - i - 1)\n print(res)\n", "n = int(input())\r\ncol = 1 + 3 * (n - 3) + (n - 4) * (n - 3)\r\nprint(col)\r\n", "a=int(input())\r\nprint((a-2)**2)\r\n", "n = int(input())\r\nans = (n - 2)**2\r\nprint(ans)# 1691022536.0471635", "# Description of the problem can be found at http://codeforces.com/problemset/problem/592/B\r\n\r\nprint((int(input()) - 2) ** 2)", "n=int(input())\r\nk=1\r\nt=3\r\nfor i in range(n-3) :\r\n k=k+t\r\n t=t+2\r\nprint(k)\r\n", "n = int(input())\r\na = (n - 2) * (n - 2)\r\nprint(a)", "import sys\r\nfrom math import *\r\nsys.setrecursionlimit(100000000)\r\nn=int(input())\r\nnb=0\r\nfor i in range(2,n):\r\n\tnb+=n-i\r\n\tnb+=i-1\r\n\tnb-=1\r\nprint(nb)", "#!/usr/bin/env python3\n# -*- coding: utf-8 -*-\n\nimport time\n\n\nn = int(input())\n\nstart = time.time()\n\n\nprint(1+(n-1)*(n-3))\nfinish = time.time()\n#print(finish - start)\n", "from sys import stdin\r\n\r\nn = int(stdin.readline())\r\n\r\nprint((n - 2) ** 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# Function to count frequency of each element\r\n\r\n\r\ndef main():\r\n n = int(input())\r\n print((n-2)*(n-2))\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n\r\n # n = int(input())\r\n # arr = [int(i) for i in input().split()]\r\n", "#!/usr/bin/env python3\nn = int(input())\nprint((n-2)**2)\n", "a = int(input())\r\nb = a-2\r\nprint(b**2)", "n = int(input())\r\nif n == 3:\r\n print(1)\r\nelif n == 4:\r\n print(4)\r\nelse:\r\n print(1 + (n - 3) * (n - 1))\r\n", "n = int(input())\r\na = [0] * (n + 1)\r\na[3] = 1\r\nfor i in range(4, n + 1):\r\n a[i] = i - 2 + a[i - 1] + i - 3\r\nprint(a[n])", "n = int(input())\r\nres = [i*i for i in range(1,54330)]\r\nprint(res[n-3])", "n = int(input())\r\nres = 1 + 3*(n-3) + max(0, (n-4)*(n-3))\r\nprint (res)", "import sys\r\ninput = sys.stdin.readline\r\n\r\nprint((int(input())-2)**2)", "n = int(input())\n\nprint((n-2)+2*(n-3)+(n-3)*(n-4))", "#!/usr/bin/env python\r\n# -*- coding: utf-8 -*-\r\n\r\nn = int(input())\r\ntmp = -1\r\nnum = 0\r\n\r\nfor i in range(3, n+1):\r\n tmp += 2\r\n num += tmp\r\n\r\nprint(num)\r\n \r\n", "# LUOGU_RID: 91792506\nx=input()\r\nprint((int(x)-2)*(int(x)-2))\r\n", "n=int(input())-2\r\nprint(n**2)", "n = int(input())\r\nsum = 1\r\nif n == 3:\r\n print(1)\r\nelse:\r\n for i in range(1,n-2):\r\n sum+=(2*i+1)\r\n print(sum)\r\n", "n=int(input())\r\nif (n==3):\r\n print(1)\r\nelse:\r\n print((n-2)**(2))\r\n", "#!/usr/bin/env python3\n\nv = int(input())\nprint(str(v**2-4*v+4))\n", "x=int(input())\r\nprint((x-2)*(x-2))", "import sys\nimport collections\n\nimport math\n\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 \nMOD += 7\nINF = 10 ** 10\n\ndef f(n):\n ans = max(0,n - 2 -1)\n \n for i in range(2, n+1):\n o = ans\n ans += max(n - i - 1, 0)\n ans += max(i -1 -2, 0)\n return ans +1\n\n\ndef main(infn=\"\") :\n global infile\n infile = open(infn,\"r\") if infn else open(sys.argv[1],\"r\") if len(sys.argv) > 1 else sys.stdin\n \n\n ######################################################################\n \n n = int(input())\n print (f(n))\n ######################################################################\n\nif __name__ == '__main__' :\n main()\n #sys.stdout.flush()", "n = int(input())\r\nans = (n-2)*(n-2)\r\nprint(ans)", "import sys\nimport traceback\nfrom contextlib import contextmanager\nfrom io import StringIO\n\n\ndef jumps(n):\n if n == 3:\n return 1\n return (n * (n-3)) - (n-4)\n\ndef main():\n n = int(input())\n print(jumps(n))\n\n\ndef log(*args, **kwargs):\n print(*args, **kwargs, file=sys.stderr)\n\n\n@contextmanager\ndef patchio(i):\n try:\n sys.stdin = StringIO(i)\n sys.stdout = StringIO()\n yield sys.stdout\n finally:\n sys.stdin = sys.__stdin__\n sys.stdout = sys.__stdout__\n\n\ndef do_test(k, test):\n try:\n log(f\"TEST {k}\")\n i, o = test\n with patchio(i) as r:\n main()\n if r.getvalue() == o:\n log(\"OK\\n\")\n else:\n log(f\"Expected:\\n{o}Got:\\n{r.getvalue()}\")\n except Exception:\n traceback.print_exc()\n log()\n\n\ndef test(ts):\n for k in ts or range(len(tests)):\n do_test(k, tests[k])\n\n\ntests = [(\"\"\"\\\n5\n\"\"\", \"\"\"\\\n9\n\"\"\"), (\"\"\"\\\n3\n\"\"\", \"\"\"\\\n1\n\"\"\")]\n\n\nif __name__ == '__main__':\n from argparse import ArgumentParser\n parser = ArgumentParser()\n parser.add_argument('--test', '-t', type=int, nargs='*')\n args = parser.parse_args()\n main() if args.test is None else test(args.test)\n", "n=int(input())\r\nN=0\r\nfor i in range(2,n):\r\n N=N+2*i-3\r\nprint(N)", "import math as mt \nimport sys,string\ninput=sys.stdin.readline\n#print=sys.stdout.write\nimport random\nimport collections\nfrom heapq import heappush,heapify,heappop\nL=lambda : list(map(int,input().split()))\nLs=lambda : list(input().split())\nM=lambda : map(int,input().split())\nI=lambda :int(input())\nn=I()\nprint((n-2)**2)\n", "n=int(input())\r\nres=(n-2)*(n-2)\r\nprint (res)\r\n", "from sys import stdin\r\n\r\ndef main():\r\n inp=stdin\r\n a=int(inp.readline().strip())\r\n print((a-2)**2)\r\nmain()\r\n", "n=int(input())\r\nif n==3:\r\n print(1)\r\nelse:\r\n \r\n print((n*(n-2)-(n-4)-n))", "def solve():\r\n n = int(input())\r\n return (n-2)**2\r\n\r\nans = solve()\r\nprint(ans)\r\n", "import sys\n\n\ndef main():\n N = int(sys.stdin.read())\n result = (N-3)*3 + (N-4)*(N-3) + 1\n print(result)\n \n \nmain()\n", "def main():\r\n\tn = int(input())\r\n\tprint((n-2)**2)\r\n\t\r\nif __name__ =='__main__':\r\n\tmain()", "# from dust i have come dust i will be\r\n\r\nn=int(input())\r\nprint((n-2)**2)", "n = int(input())\nres = 1\nfor i in range(n):\n if i == 0:\n res += n - 3\n elif i == 1 or i == n - 1:\n res += n - 3\n else:\n res += n - 4\nprint(res)\n ", "a=int(input())\nprint((a-2)*(a-2))", "n = int(input())\r\n\r\nans = (n-3) + 2*(n-3) + (n - 4)* (n-3) + 1\r\nprint(ans)", "n = int(input()) - 2\r\nprint( n * n )\r\n", "\"\"\"\nOh, Grantors of Dark Disgrace, \nDo Not Wake Me Again.\n\"\"\"\nprint((int(input())-2)**2)", "n = int(input())\r\n\r\nprint(n - 2 + n - 3 + max(n-4, 0) * (n - 3) + n - 3)", "n = int(input())\r\nprint((n-2)*(n-2))\r\n\r\n\r\n#seeing test test case\r\n#3 = 1\r\n#4 = 4\r\n#5 = 9\r\n#6 =16", "\r\nimport math\r\nfrom decimal import *\r\nimport sys\r\n\r\nn=int(input())\r\nprint((n-3)*n -(n-3) + 1)\r\n\r\n \r\n\r\n", "n = int(input())\r\nk = (n-2)*(n-2)\r\nprint(k)", "N = int(input())\nprint((N-2)**2)\n", "k=0\r\nt=1\r\nfor _ in range(int(input())-2):k+=t;t+=2\r\nprint(k)", "n = int(input()) \r\nprint ((n -3 )*(n - 1) + 1)", "x=int(input())\r\ny=x-2\r\nz=y**2\r\nprint (z)", "n=int(input())\r\nans=(n-2)**2\r\nprint(ans)\r\n", "from sys import stdin\r\nn=int(stdin.readline().strip())\r\nx=n-2+n-3+n-3+(n-4)*(n-3)\r\nprint(x)\r\n", "n=int(input())\r\ni=n-2\r\npro=i*i\r\nprint (pro)", "n=int(input())\r\n# coor,ap=map(int,input().split())\r\n# for _ in range(int(input())):\r\n# coor,ap=map(int,input().split())\r\n# s=(input());t=input()\r\n# s,t=input().split()\r\n# arr=list(map(int,input().split()))\r\n# for _ in range(int(input())):\r\n# n,q=map(int,input().split());s=(input())\r\nprint((n-2)**2)", "from sys import stdin\n\na = int(stdin.readline()) - 2\n\nprint(a * a)", "n = int(input())\r\nans = 1\r\nans += 3*(n-3)\r\nans += (n-3)*(n-4)\r\nprint(ans)", "N = int(input())\r\nprint((N - 2) * (N - 2))\n", "n=int(input())-2\r\nprint(n*n)", "n = int(input())\nn -= 2 \nprint (n * n)\n", "n = int(input())\r\ncnt = n - 3\r\nans = n * cnt - cnt + 1\r\nprint(ans)", "n = int(input())\n\nbig = n - 3\nprint(3 * big + (n - 3) * (big - 1) + 1)\n", "n, = map(int, input().split())\r\nprint((n-3)*(n-1) + 1)", "n = int(input())\r\nprint(pow((n -2), 2))", "# your code goes here\r\na=int(input())\r\nprint ((a-2)*(a-2))", "n = int(input())\r\nres = 1\r\ncarrier = 3\r\nfor i in range(3, n):\r\n res = res + carrier\r\n carrier += 2\r\nprint(res)", "n = int(input())\r\n\r\nprint((n - 2)**2)\r\n", "#! /usr/bin/env python\n# -*- coding: utf-8 -*-\n# vim:fenc=utf-8\n#\n# Copyright © 2016 missingdays <missingdays@missingdays>\n#\n# Distributed under terms of the MIT license.\n\n\"\"\"\n\n\"\"\"\n\nn = int(input())\n\nif n == 3:\n print(1)\nelse:\n print(1 + 3*(n-3) + (n-3)*(n-4))\n", "from sys import stdin\r\n\r\n\r\ndef main():\r\n inp = int(stdin.readline().strip())\r\n print((inp-2)**2)\r\nmain()\r\n", "from sys import stdin,stdout\r\n\r\ninput=stdin.readline\r\ndef print(*args, end='\\n', sep=' ') -> None:\r\n stdout.write(sep.join(map(str, args)) + end)\r\n\r\nn=int(input()) ; ans=1 ; a=n-3 ; x=n-a\r\nfor i in range(1,n+1):\r\n if i>x:\r\n ans+=a-1\r\n else:\r\n ans+=a\r\nprint(ans)\r\n\r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Sat Oct 31 18:10:47 2015\r\n\r\n@author: gmarti\r\n\"\"\"\r\n\r\nimport sys\r\nfrom sys import stdin, stdout\r\nn = int(input())\r\n\r\nstdout.write(str((n-2)**2)+\"\\n\") ", "a = int(input())\r\nprint((a - 1) * (a - 3) + 1)", "import copy\r\n\r\nn = int(input())\r\nresp = (n-2)*(n-2)\r\nprint(resp)", "import sys\r\n\r\ninput_file = sys.stdin\r\nnumber = int(input_file.readline().rstrip())\r\nprint((number-2)**2)", "n=int(input())\r\nprint((n-1)*(n-2)-(n-2))", "n = int(input())\nprint(1+(n-3)*(n-1))\n", "n = int(input())\r\nk = pow(n-2 , 2)\r\nprint(k)", "\"\"\"\nCodeforces Round #328 (Div. 2)\n\nProblem 592 B. The Monster and the Squirrel\n\n@author yamaton\n@date 2015-10-31\n\"\"\"\n\nimport itertools as it\nimport functools\nimport operator\nimport collections\nimport math\nimport sys\n\n\ndef solve(n):\n count = (n - 3) + 1\n for i in range(2, n+1):\n if i == 2 or i == n:\n count += n - 3\n else:\n count += n - 4\n return count\n\n\ndef print_stderr(*args, **kwargs):\n print(*args, file=sys.stderr, **kwargs)\n\n\ndef main():\n n = int(input())\n result = solve(n)\n print_stderr(result)\n print(result)\n\n\nif __name__ == '__main__':\n main()\n", "print((int(input())-2)**2)\n\n\n\n# Made By Mostafa_Khaled", "n = int(input())\r\nn-=2\r\nprint(n**2)", "#````````````````````````````````````````\na=int(input())\nprint(pow(a-2,2))\n\t\t \t \t\t\t \t\t\t \t\t\t \t", "\r\na = int(input())\r\nprint((a-2)**2)", "n = int(input())\r\ntmp = n-2\r\nprint(tmp*tmp)", "x = int(input())\r\nprint((x-2)**2)", "a = int(input())\r\n\r\nresult = (a - 2) * (a - 2)\r\n\r\nprint(result)", "n = int(input())\r\nprint ((n-2) ** 2)", "import sys\n\n#x = sys.stdin.read(1)\nx = int(input()) - 1\n\nprint(x*(x-2) + 1)\n", "#print(\"Hello!\")\r\n\r\nimport sys\r\n\r\na = int(input())\r\nprint ((a-2)**2)\r\n\r\n#print(\"Bye!\")", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\nn = int(input())\r\nans = (n - 3) * (n - 1) + 1\r\nprint(ans)", "a=(int(input()))\r\nz=(a-2)**2\r\nprint(z) \r\n\r\n", "n = int (input())\r\nregion = 3*n-8+(n-3)*(n-4)\r\nprint (region)\r\n", "# @Chukamin ZZU_TRAIN\n\ndef main():\n n = int(input())\n print((n - 2) * (n - 2))\n \nif __name__ == '__main__':\n main()\n\n \t\t \t \t\t \t\t\t \t \t\t", "n = int(input()) - 2\r\nprint(n * n)", "#!/usr/bin/python3\nn=int(input())\np=[0]*(n+1)\np[3]=1\nfor i in range(4,n+1):\n p[i]=p[i-1]+2*i-5\nprint(p[n]) \n\n", "N = int(input())\n\na = 0\nstep = 1\nfor i in range(3, N+1):\n a += step\n step += 2\nprint(a)", "n=int(input())\r\nprint((n-3)*(n-4)+2*(n-3)+n-3+1)", "n = int(input())\r\na = [0 for i in range(n+2)]\r\na[3] = 1\r\na[4] = 4\r\ni = 5\r\nk = 0\r\nwhile i<=n:\r\n a[i] = i+a[i-1]+k\r\n i+=1\r\n k+=1\r\nprint(a[n])\r\n", "n = int(input())\n\ndef solve(n):\n if n == 3:\n return 1\n\n first = n - 3\n twoAdjacent = n - 3\n others = n - 4\n\n all = first + 2*twoAdjacent + (n-3)*others\n return all+1\n\nprint(solve(n))\n\n\n", "\r\nn=int(input())\r\n\r\n\r\ncnt=((n-2)**2)\r\n\r\nprint(cnt)\r\n", "n=int(input())\n\nans=(n-3)+ 1 + (n-3)*(n-2)\nprint(ans)", "n = int(input())\r\nprint((n-2)*(n-1)-(n-2))", "x=int(input())\r\nadd=1\r\nans=0\r\nfor i in range(0,x-2):\r\n ans = ans + add\r\n add = add + 2\r\nprint(ans)", "count = int(input())\r\nprint((count-2)*(count-2))\r\n", "n=int(input())\r\nn=n-2\r\nprint(n**2)", "f = lambda n: n*n - 4*n + 4\r\nprint(f(int(input())))" ]

[ "n = int(input())\r\na = list(map(int,input().split()))\r\na = set(a)\r\na = list(a)\r\na.sort()\r\nif not len(a) ==1:\r\n print(a[1])\r\nelse:\r\n print('NO')", "n=int(input())\na=[int(x) for x in input().split()]\na=list(set(a))\na.sort()\nif(len(a)==1):\n print(\"NO\")\nelse:\n print(a[1])\n\t \t\t \t\t\t \t \t \t \t\t\t\t\t", "n=int(input())\r\nch=input()\r\nl=list(map(int,ch.split()))\r\ne=set(l)\r\nif(len(e)>1):\r\n e.remove(min(e))\r\n print(min(e))\r\nelse:\r\n print(\"NO\")\r\n\r\n", "input()\r\na = sorted(set(map(int, input().split())))\r\nif len(a) == 1:\r\n\tprint(\"NO\")\r\nelse:\r\n\tprint(a[1])\r\n", "n=int(input())\r\nsequence=list(map(int, input().split()))\r\n\r\nsequence=list(set(sequence))\r\nsequence.sort()\r\n\r\nif len(sequence)>=2:\r\n print(sequence[1])\r\nelse:\r\n print(\"NO\")", "n = input()\na = sorted(list(map(int,input().split())))\nfor i in range(len(a)):\n if a[i]!=a[0]:\n print(a[i])\n exit()\nprint(\"NO\")", "n = int(input())\nli = list(map(int, input().split()))\nli.sort()\nsecond=None\nfor i in range(1,n):\n if li[i]>li[0]:\n second=li[i]\n break\nif second is not None:\n print(second)\nelse:\n print(\"NO\")\n \t \t\t \t\t \t \t \t \t \t \t\t \t\t", "input()\r\nS = set(map(int, input().split()))\r\n \r\nprint(sorted(S)[1] if len(S) > 1 else 'NO')", "n=int(input())\r\na=list(map(int,input().split()))\r\na=set(a)\r\na=sorted(a)\r\nif len(a)==1:\r\n print(\"NO\")\r\nelse:\r\n print(a[1])", "n=int(input())\nlis=input().split(' ')\nlis=[int(i) for i in lis]\nlis=list(set(lis))\nlis.sort()\nif len(lis)>1:\n print(lis[1])\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\narr = list(map(int,input().split()))\r\narr = sorted(set(arr))\r\nif len(arr)<2:\r\n print('NO')\r\nelse:\r\n print(arr[1])", "n = int(input())\r\na = list(map(int, input().split()))\r\na.sort()\r\ni = 1\r\nwhile i < n:\r\n if a[i] == a[i-1]:\r\n i += 1\r\n else:\r\n break\r\nif i == n:\r\n print ('NO')\r\nelse:\r\n print (a[i])", "n=int(input())\r\nl=list(map(int,input().split()))\r\nif(n==1 or len(set(l))==1):\r\n print('NO')\r\nelse:\r\n l.sort()\r\n prev=l[0]\r\n for i in range(1,n):\r\n if(l[i]!=prev):\r\n print(l[i])\r\n break\r\n", "m=int(input())\narr=[int(j) for j in input().split()]\narr.sort()\nfor j in arr:\n if j!=arr[0]:\n print(j)\n exit()\nprint(\"NO\")\n\t \t\t \t\t\t\t \t \t \t\t \t \t\t\t\t\t\t\t\t\t\t\t", "q=int(input())\nr=list(map(int,input().split()))\nr=list(set(r))\nr.sort()\nif len(r)>1:\n print(r[1])\nelse:\n print(\"NO\")\n\t \t\t\t\t \t\t\t \t \t\t\t\t\t\t\t\t \t\t\t\t", "n=int(input())\r\ns=list(map(int,input().split()))\r\ns=sorted(s)\r\nif s.count(s[0])==len(s):\r\n print(\"NO\")\r\nelse:\r\n print(s[s.count(s[0])])", "n=int(input())\r\na=list(map(int,input().split()))\r\nsec=set(a)\r\nsec=sorted(sec)\r\nif len(sec)==1:\r\n print(\"NO\")\r\nelse:\r\n print(sec[1])\r\n", "n = int(input())\r\nnums = sorted(list(map(int, set(input().split()))))\r\nif len(nums) > 1:print(nums[1])\r\nelse:print('NO')\r\n", "n = input()\na = set(int(i) for i in input().split())\nif(len(a) == 1):\n print(\"NO\")\nelse:\n a = sorted(list(a))\n print(a[1])\n \t\t\t \t \t \t \t \t\t\t \t \t", "input()\r\n\r\ncont = sorted(set([int(item) for item in input().split(' ')]))\r\nprint(cont[1] if len(cont) > 1 else 'NO')", "s=int(input())\na=list(map(int,input().split()))\na=sorted(list(set(a)))\nif len(a)>1:\n\tprint(a[1])\nelse:\n\tprint(\"NO\")\n \t\t\t\t \t\t \t\t\t \t \t \t\t \t\t", "import sys\r\nimport math\r\nimport collections\r\nimport heapq\r\ninput=sys.stdin.readline\r\nn=int(input())\r\nl=[int(i) for i in input().split()]\r\nl=sorted(list(set(l)))\r\nif(len(l)==1):\r\n print(\"NO\")\r\nelse:\r\n print(l[1])", "nfdr1=int(input())\nafdr1=[int(ifdr1) for ifdr1 in input().split()]\nafdr1.sort()\nflag=1\nfor ifdr1 in range(nfdr1-1):\n if afdr1[ifdr1]!=afdr1[ifdr1+1]:\n flag=0\n print(afdr1[ifdr1+1])\n break\nif flag==1:\n print('NO')\n \t \t\t \t\t\t\t\t \t\t\t \t \t\t\t \t", "n = int(input())\r\narr = input().split()\r\narr = [int(i)for i in arr]\r\narr.sort()\r\nfor i in arr:\r\n if(i>arr[0]):\r\n print(i)\r\n break\r\nelse:\r\n print(\"NO\")", "\r\nn = int(input())\r\nif n >1 :\r\n numbers = list(map(int, input().split()))\r\n var_list = sorted(set(numbers))\r\n if len(var_list) > 1:\r\n print(var_list[1])\r\n else: \r\n print(\"NO\")\r\nelse:\r\n print(\"NO\")\r\n", "a=int(input())\r\nk=input().split()\r\nlst=[]\r\nlst1=[]\r\nfor i in k:\r\n if i not in lst:\r\n lst.append(i)\r\nfor j in lst:\r\n lst1.append(int(j))\r\nm=sorted(lst1)\r\nif(len(m)>=2):\r\n print(m[1])\r\nelse:\r\n print(\"NO\")\r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\na.sort()\r\ndone=0\r\nfor i in a:\r\n if i!=a[0]:\r\n print(i)\r\n done=1\r\n break\r\n \r\nif done==0:\r\n print(\"NO\")\r\n\r\n", "n = int(input())\nl = list(map(int,input().split()))\n\nlsai1 = set(l)\nlsai2 = list(lsai1)\nlsai2.sort()\nsi = len(lsai2)\nif si>1:\n\tprint(lsai2[1])\nelse:\n\tprint(\"NO\")\n\n \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\nl.sort()\r\nif n == 1 or l.count(min(l)) == n:\r\n print(\"NO\")\r\nelse:\r\n print(l[l.count(min(l))])", "n = int(input())\r\na = [int(x) for x in input().split()]\r\na.sort()\r\nm = a[0]\r\nans = a[0]\r\nfor k in a:\r\n if k == m:\r\n continue\r\n else:\r\n ans = k\r\n break\r\nif ans == a[0]:\r\n print(\"NO\")\r\nelse:\r\n print(ans)\r\n\r\n\r\n", "n = int(input())\na = list(map(int, input().split(\" \")))\na.sort()\nif len(a) < 2:\n print(\"NO\")\nelse:\n m = a[0]\n for i in range(0, n):\n if a[i] > m:\n print(a[i])\n break\n if i == n - 1:\n print(\"NO\")\n\n \t \t\t\t\t\t \t \t \t \t\t \t \t \t", "n=int(input())\r\na=list(map(int, input().split()))\r\np=set(a)\r\nq=list(p)\r\nq.sort()\r\nl=len(p)\r\nif l==1:\r\n print(\"NO\")\r\nelse:\r\n print(q[1])", "n = int(input())\r\nnlist = input().split(' ')\r\nmlist = []\r\nfor i in nlist:\r\n mlist.append(int(i))\r\nnew = set(mlist)\r\nif len(new) == 1:\r\n print('NO')\r\nelse:\r\n new = sorted(new)\r\n print(new[1])", "n = int(input())\r\narr = list(map(int,input().split()))\r\narr.sort()\r\na = True\r\nfor i in range(n-1):\r\n if(arr[i] < arr[i+1]):\r\n print(arr[i+1])\r\n a = False\r\n break\r\nif(a):\r\n print(\"NO\")\r\n ", "n = input()\r\na = [int(i) for i in input().split()]\r\na = list(set(a))\r\na.sort()\r\nif(len(a)>1):\r\n print(a[1])\r\nelse:\r\n print(\"NO\")", "input();\nd=sorted(set(map(int,input().split())));\nprint(d[1] if len(d)>1 else \"NO\")\n\t \t\t\t\t \t \t \t \t \t\t\t\t\t\t\t\t \t\t\t\t", "n = int(input())\r\ns = list(set(map(int, input().split())))\r\ns.sort()\r\n\r\nprint(s[1] if len(s) > 1 else 'NO')", "n = int(input())\nl = list(map(int, input().split()))\nl1 = list(set(l))\nl1.sort()\n# print(l)\nif max(l) == min(l):\n print(\"NO\")\nelse:\n print(l1[1])\n \t\t\t \t \t \t \t \t \t\t\t \t\t", "# Written by SHagoto\n\nn = int(input())\nl = list(map(int, input().split(\" \")))\ntemp = []\nfor x in range(n):\n if(temp.count(l[x]) == 0):\n temp.append(l[x])\n\ntemp.sort()\nif(len(temp) < 2):\n print(\"NO\")\nelse:\n print(temp[1])\n\t \t\t \t \t \t \t\t\t \t\t\t \t\t \t\t\t \t", "n = int(input())\r\na = set(map(int,input().split()))\r\nif len(set(a))==1:\r\n print(\"NO\")\r\nelse:\r\n print(sorted(a)[1])", "try:\n a=input();a=sorted(list(map(int,input().split())));print(a[a.count(a[0])])\nexcept:\n print('NO')\n#PJY is the most beautiful girl in the world! I love her forever!", "n= int(input())\nm=list(map(int, input().split()))[:n]\nm=list(set(m))\nm.sort()\nif len(m)>1 :\n print(m[1])\nelse :\n print(\"NO\")\n\t \t \t\t \t\t \t\t \t \t\t \t\t\t\t\t\t", "aab=int(input())\nbab=list(map(int,input().split()))\nbab=list(set(bab))\nbab.sort()\nif len(bab)>1:\n print(bab[1])\nelse:\n print(\"NO\")\n\t \t\t \t\t\t \t \t \t \t \t \t", "a = int(input())\r\nlst = input().split(\" \")\r\nlst = list(map(int, lst))\r\nb = True\r\nlst.sort()\r\nfor x in range(len(lst) - 1):\r\n\tif(lst[x] != lst[x+1] and b):\r\n\t\tprint(lst[x+1])\r\n\t\tb = False\r\nif(b):\r\n\tprint(\"NO\")\r\n ", "n=int(input())\ns=input().split()\nfor i in range(n):\n s[i]=int(s[i])\ns=list(set(s))\ns.sort()\nif(len(s)==1):\n print(\"NO\")\nelse:\n\n print(s[1])\n\n \t\t \t \t\t \t\t\t\t\t \t\t \t\t \t", "n = int(input())\nl = sorted(list(set(list(map(int, input().split())))))\nif len(l) == 1:\n print(\"NO\")\nelse:\n print(l[1])\n\t \t \t\t \t \t\t\t\t \t\t\t\t\t \t \t\t", "from heapq import heappush, heappop\n\n\nn, a = int(input()), (int(i) for i in input().split())\nh = []\nfor i in a:\n if -i not in h:\n heappush(h, -i)\n if len(h) > 2:\n heappop(h)\nres = -h[0] if len(h) > 1 else \"NO\"\nprint(res)\n", "def Find_min(a=[]):\r\n # print(len(a))\r\n m = a[0]\r\n for i in range(len(a)):\r\n if a[i] < m:\r\n m = a[i]\r\n return m\r\nn=int(input())\r\nlist1=input().split()\r\nlist1=[int(i) for i in list1]\r\nlist2=[]\r\nmin=Find_min(list1)\r\nfor item in list1:\r\n if item>min:\r\n list2.append(item)\r\nif(len(list2)>0):\r\n min2 = Find_min(list2)\r\n if min2 > min:\r\n print(min2)\r\n else:\r\n print(\"NO\")\r\nelse:\r\n print(\"NO\")", "n = int(input())\r\narr = map(int, input().split())\r\nlist1 = []\r\nlist1 = sorted(set(arr))\r\nn = len(list1)\r\nif(n==1):\r\n print(\"NO\")\r\nelse: \r\n print(list1[1])", "\r\nn = int(input())\r\n\r\nx = [int(x) for x in input().split()]\r\n\r\na = set(x)\r\nl = list(a)\r\nl.sort()\r\nprint('NO' if len(l) == 1 else l[1])\r\n", "n=input()\r\nl = sorted(set([int(j) for j in input().split()]))\r\nprint(l[1] if len(l) > 1 else \"NO\")", "n = int(input())\narr = list(map(int, input().split()))\narr = sorted(set(arr))\n\nif (len(arr)>=2):\n print(arr[1])\n\nelse:\n print(\"NO\")\n\n \t\t \t\t\t\t\t \t \t \t \t \t", "n = int(input())\r\na = [int(x) for x in input().split()]\r\na.sort()\r\na = [x for x in a if x != a[0]]\r\nif len(a) == 0:\r\n print(\"NO\")\r\nelse:\r\n print(a[0])", "n = int(input())\ndata = list(map(int, input().split()))\n\ndata = sorted(data)\n\nfst = data[0]\n\nfor item in data[1:]:\n if item != fst:\n print(item)\n quit()\n\nprint(\"NO\")\n\n\t\t \t \t\t \t \t \t\t \t\t\t\t \t\t\t\t\t \t", "n = int(input())\r\nnumbers = input().split()\r\nsame = True\r\nfor i in range(len(numbers)):\r\n numbers[i] = int(numbers[i])\r\nnumbers.sort()\r\nfor i in range(len(numbers)):\r\n if numbers[i] != numbers[0]:\r\n print(numbers[i])\r\n same = False\r\n break\r\nif same:\r\n print('NO')\r\n\r\n", "num=int(input())\r\nl=list(map(int,input().split()))\r\nl1=[]\r\nfor i in l:\r\n if i not in l1:\r\n l1.append(i) \r\nl1.sort()\r\nif(len(l1)>=2):\r\n print(l1[1])\r\nelse:\r\n print(\"NO\")", "n = int(input())\r\nara = list(set(list(map(int, input().strip().split()))))\r\nara.sort()\r\nif len(ara) == 1:\r\n print(\"NO\")\r\nelse:\r\n print(ara[1])\r\n", "n= int(input())\r\nN= list()\r\nN= list(map(int, input().split()))\r\nx= max(N)\r\nfor i in range(n):\r\n if min(N)<N[i]< x:\r\n x= N[i]\r\nif x!= min(N):\r\n print(x)\r\nelse:\r\n print('NO')", "n=int(input())\r\na=list(map(int,input().split()))\r\ns=set(a)\r\nl=list(s)\r\nlength=len(l)\r\nif length==0 or length==1:\r\n print('NO')\r\nelse:\r\n l.sort()\r\n print(l[1])", "n = int(input())\r\nl = list(map(int,input().split()))\r\nli = sorted(l)\r\nli = set(li)\r\nli = sorted(list(li))\r\nif(len(li)==1):\r\n print(\"NO\")\r\nelif(li[1]==li[0]):\r\n print(\"NO\")\r\nelse:\r\n print(li[1])", "num = int(input())\na = list(map(int, input().split()))\na.sort()\nfor i in range(1, num):\n if a[i] > a[0]:\n print(a[i])\n break\nelse:\n print(\"NO\")\n \t \t \t \t\t \t \t\t", "n = int(input())\nl = list(map(int,input().split()))\n\nl1 = set(l)\nl2 = list(l1)\nl2.sort()\nsi = len(l2)\nif si>1:\n\tprint(l2[1])\nelse:\n\tprint(\"NO\")\n\n\t \t \t\t\t \t \t \t\t \t \t\t\t\t \t \t \t", "n=int(input())\r\na=list(map(int,input().split()))\r\ns=set(a)\r\nif(len(s)==1):\r\n print(\"NO\")\r\nelse: \r\n small=min(s)\r\n s.remove(small)\r\n small1=min(s)\r\n print(small1)", "n=int(input())\r\n'''scannning list elements'''\r\na=list(map(int,input().split()))\r\n'''no repeatig elements are found in a set'''\r\ns=set(a)\r\nif(len(s)==1):\r\n print(\"NO\")\r\nelse:\r\n minimum=min(s)\r\n s.remove(minimum)\r\n minimum1=min(s)\r\n print(minimum1)", "N = int(input())\r\nL = sorted(set(map(int,input().split())))\r\nprint(L[1] if 2<=len(L) else \"NO\")", "x = int(input())\ny = list(map(int, input().split(' ')))\nl2 = []\nseen = set()\n\nfor i in y:\n if i not in seen:\n l2.append(i)\n seen.add(i)\nl2.sort()\nif len(l2) == 1:\n print('NO')\nelse:\n print(l2[1])\n\n \t\t\t \t\t\t \t \t \t \t\t\t\t \t \t\t", "\r\nimport sys\r\nif __name__ == '__main__':\r\n n = int(input())\r\n arr = [int(x) for x in input().split()]\r\n ok = False\r\n arr.sort()\r\n ans = - 1\r\n for i in range(0, n-1):\r\n if (arr[i + 1] > arr[i]):\r\n ans = arr[i + 1]\r\n ok = True\r\n break\r\n if (ok):\r\n print(ans)\r\n else:\r\n print(\"NO\")", "\nn = int(input())\nnumbers = list(map(int, input().split()))\n\nnumbers.sort()\n\n\nsecond_order = None\nfor i in range(1, n):\n if numbers[i] > numbers[0]:\n second_order = numbers[i]\n break\n\n\nif second_order is not None:\n print(second_order)\nelse:\n print(\"NO\")\n\n\t\t\t\t\t \t\t \t\t\t\t\t\t\t\t\t \t", "n=int(input())\r\nli=[int(x) for x in input().split()]\r\nl2=[]\r\nfor i in li:\r\n if i not in l2:\r\n l2.append(i)\r\nl2.sort()\r\nif(len(l2)>1):\r\n print(l2[1])\r\nelse:\r\n print(\"NO\")", "n=int(input())\r\na=list(map(int,input().split()))\r\ns=set(a)\r\ns1=list(s)\r\ns1.sort()\r\nif len(s1)==1:\r\n print('NO')\r\nelse:\r\n print(s1[1])\r\n", "'''\r\n╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬\r\n╬╬ ▓▓ ▓▓ ╬╬\r\n╬╬ ▓▓ ▓▓ ╬╬\r\n╬╬ ▓▓█████▓▓ ╬╬\r\n╬╬ ▓▓ ▓▓ ╬╬\r\n╬╬ ▓▓ ▓▓ ╬╬\r\n╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬\r\n'''\r\nimport sys\r\ninput = lambda : sys.stdin.readline().strip()\r\nfrom bdb import Breakpoint\r\nfrom functools import lru_cache\r\nfrom http.client import CONTINUE\r\nimport sys\r\nfrom math import log2\r\nimport bisect\r\ninput=sys.stdin.readline\r\nfrom collections import defaultdict\r\nmod = 10**9 + 7 \r\ndef ii():\r\n return int(input())\r\ndef lii():\r\n return list(map(int, input().split()))\r\ndef ss():\r\n return input()\r\ndef lss():\r\n return list(map(str, input().split()))\r\ndef yes():\r\n print(\"YES\")\r\ndef no():\r\n print(\"NO\")\r\n'''\r\n╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬\r\n'''\r\nn = ii()\r\nl = sorted(lii())\r\nans = \"NO\"\r\nfor i in l:\r\n if min(l)<i:\r\n ans = i\r\n break\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())\r\narr = [int(i) for i in input().split()]\r\narr = list(set(arr))\r\narr.sort()\r\nif len(arr) == 1:\r\n print(\"NO\")\r\nelse:\r\n print(arr[1])", "a=input()\nb=sorted(set(map(int, input().split())))\nif len(b)>=2:\n print(b[1])\nelse:\n print(\"NO\")\n\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 = int(input())\r\na = sorted(map(int, input().split()))\r\nx = min(a)\r\nfor y in a:\r\n if y > x:\r\n print(y)\r\n exit()\r\n\r\nprint('NO')\r\n", "input()\r\nminimum,ans = 101,101\r\nfor item in [int(item) for item in input().split(' ')]:\r\n if minimum > item:\r\n ans = minimum\r\n minimum = item\r\n elif ans > item != minimum:\r\n ans = item\r\n\r\nprint(ans if ans != 101 else \"NO\")", "a=int(input())\r\nl=[int(i) for i in input().split(\" \")]\r\nmin=min(l)\r\nsecmin=min\r\nflag=1\r\nfor i in l :\r\n if i == min:\r\n continue\r\n if flag:\r\n if i > secmin:\r\n secmin = i \r\n flag=0\r\n else:\r\n if i < secmin:\r\n secmin = i \r\nif min == secmin:\r\n print(\"NO\")\r\nelse:\r\n print(secmin)", "n=int(input())\r\nb=list(map(int,input().split()))\r\nb.sort()\r\nflag=0\r\nfor i in range(n-1):\r\n if(b[i]<b[i+1]):\r\n print(b[i+1])\r\n flag=1\r\n break\r\nif(flag==0):\r\n print(\"NO\")", "print((sorted(set([input(), map(int, input().split())][1])) + [\"NO\"])[1])", "n = int(input())\na = set(map(int,input().split()))\na = sorted(a)\nprint('NO' if len(a) == 1 else a[1])", "notused, inp = 0*int(input()), sorted(list(set(map(int, input().split(\" \")))))\nprint(inp[1]) if len(inp) > 1 else print(\"NO\")\n", "n = int(input())\nline = input().split()\nnum = [int(i) for i in line]\nnum = list(set(num))\nnum.sort()\nif(len(num) < 2):\n print(\"NO\")\nelse:\n print(f\"{num[1]}\")\n\n\t \t \t \t \t\t\t \t\t \t \t \t", "n=int(input())\r\na=list(map(int,input().split()))\r\nz=[]\r\nfor i in a:\r\n if i not in z:\r\n z+=[i]\r\n\r\nz=sorted(z)\r\nif len(z)>1:\r\n print(z[1])\r\nelse:\r\n print('NO')\r\n", "a=int(input())\nx=list(map(int,input().split()))\nx=list(set(x))\nx.sort()\nif len(x)>1:\n print(x[1])\nelse:\n print(\"NO\")\n \t\t \t \t \t\t \t \t \t\t\t \t\t", "n = int(input())\ns = set(map(int,input().split()))\ntry:\n\tprint(sorted(s)[1])\nexcept:\n\tprint(\"NO\")\n \t\t\t\t \t \t \t \t\t\t\t \t \t\t\t \t", "import sys\nn=int(input())\na=list(set(list(map(int,input().split()))))\nif len(a)==1:print(\"NO\"),sys.exit()\na.sort()\nprint(a[1])", "x=int(input())\narray=list(map(int,input().split()))\ny=list(set(array))\nz=sorted(y)\nif(len(z)==1):\n print(\"NO\")\nelse:\n print(z[1])\n\t\t \t\t\t \t \t \t \t\t\t\t \t\t \t\t\t", "n=int(input())\r\nb=[int(i)for i in input().split()]\r\na=[]\r\nfor i in b:\r\n if i not in a:\r\n a=a+[i]\r\na.sort()\r\nif len(a)==1:\r\n print(\"NO\")\r\nelse:\r\n print(a[1])\r\n", "N = int(input())\r\nar = list(map(int,input().split()))\r\nfinal = sorted(list(set(ar)))\r\nif(len(final) ==1):\r\n print(\"NO\")\r\nelse:\r\n print(final[1])", "n = int(input())\r\nk = sorted([int(i) for i in input().split()])\r\nif n < 2:\r\n print(\"NO\")\r\nelse:\r\n find = True\r\n for i in range(n):\r\n if k[0] != k[i]:\r\n print(k[i])\r\n find = False\r\n break\r\n if find:\r\n print(\"NO\")", "t = int(input())\r\na = list(map(int, input().split()))\r\nvr1 = a[0]\r\nvr2 = False\r\nfor i in range(1, t):\r\n if a[i] != vr1:\r\n vr2 = True\r\n break\r\nif vr2:\r\n vr = min(a) + 1\r\n while vr not in a:\r\n vr += 1\r\n print(vr)\r\nelse:\r\n print('NO')\r\n", "x=int(input())\nl=list(map(int,input().strip().split()))[:x]\nl.sort()\nx=[]\nfor i in l:\n if i not in x:\n x.append(i)\nif len(x)<=1:\n print('NO')\nelse:\n print(x[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())\narr=[int(x) for x in input().split()]\nn_strg=[]\n\nfor i in range(n):\n if(arr[i] not in arr[0:i]):\n n_strg.append(arr[i])\n\nn_strg.sort()\nif(len(n_strg)<2):\n print(\"NO\")\nelse:\n print(n_strg[1])\n\n\t\t\t\t\t\t\t\t \t\t\t\t \t\t \t\t\t\t \t \t", "input();a=sorted(set(map(int,input().split())));print(a[1] if len(a)>1 else \"NO\")", "x=int( input())\n\n\na=sorted( list( set( map( int, input().strip().split()))))\n\nif len(a)==1:\n\n print(\"NO\")\n\nelse:\n\n print(a[1])\n \n \n \n \n\n \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 = min(a)\r\na.sort()\r\nk = \"NO\"\r\nfor i in range(len(a)):\r\n if a[i] > b:\r\n k = a[i]\r\n break\r\nprint(k)", "n=int(input())\nl=[int(x) for x in input().split()]\nmi=l[0]\nfor x in l:\n if(x<mi):\n mi=x\nsmi=200\nfor x in l:\n if(x<smi and x!=mi):\n smi=x\nif(smi==200):\n print(\"NO\")\nelse:\n print(smi)\n\n \t \t \t\t\t \t\t\t \t\t \t\t\t\t \t\t\t\t\t \t\t", "def findSecondOrderStatistics(n,sequence):\n sorted_sequence = sorted(set(sequence))\n if len(sorted_sequence)>1:\n return sorted_sequence[1]\n else:\n return \"NO\"\nn=int(input().strip())\nsequence=list(map(int,input().strip().split()))\nsecond_order_statistics=findSecondOrderStatistics(n, sequence)\nprint(second_order_statistics)\n\t \t \t \t\t \t \t\t\t\t \t \t \t", "#veera's code \r\nt=int(input())\r\nver=list(map(int, input().split()))\r\nver.sort()\r\nnew_arr=list(dict.fromkeys(ver))\r\nif len(new_arr)==1:\r\n print(\"NO\")\r\nelse:\r\n if new_arr[1]==101:\r\n print(\"NO\")\r\n else:\r\n print(new_arr[1])", "n=input()\r\narr=[int(i) for i in input().split()]\r\nst=list(set(arr))\r\nst.sort()\r\nif len(st)<2:\r\n print('NO')\r\nelse:\r\n print(st[1])\r\n", "n=int(input())\r\nlist1=list(map(int,input().split(' ')))\r\nsort_list=sorted(list1)\r\nunique_list=[]\r\nfor ele in sort_list:\r\n if ele not in unique_list:\r\n unique_list.append(ele)\r\nif len(unique_list)<2:\r\n print('NO')\r\nelse:\r\n print(unique_list[1])", "n=int(input())\r\ns=input().split()\r\nm=[]\r\nfor i in range(n):\r\n m.append(int(s[i]))\r\nm.sort()\r\nl='NO'\r\nfor i in range(1,len(m)):\r\n if m[i]>min(m):\r\n l=m[i]\r\n break\r\n\r\nprint(l) ", "#==============NEVER GIVE UP=========================\r\n#===========ALLAH ALMIGHT WILL HELP==================\r\n#==================YOU===============================\r\nx=int(input())\r\ny=sorted(set(map(int,input().split())))\r\nif len(y)==1:\r\n print(\"NO\")\r\nelse:\r\n print(list(y)[1])", "n = int(input())\r\narr = list(map(int,input().split()))\r\nset1 = sorted(set(list(arr)))\r\nif len(set1) == 1:\r\n print('NO')\r\nelse:\r\n print(set1[1])", "n = int(input())\r\nl = list(map(int, input().split()))\r\n\r\nm = min(l)\r\n\r\nl = [x for x in l if x != m]\r\n\r\nif not l:\r\n print(\"NO\")\r\nelse:\r\n ans = min(l)\r\n print(ans)\r\n", "input();\r\ntry: print(sorted(list(set([int(x) for x in input().split()])))[1])\r\nexcept: print('NO')", "def findSecondOrderStatistics(n, seq):\n sorted_sequence = sorted(set(seq)) # Remove duplicates and sort the sequence\n\n if len(sorted_sequence) > 1:\n return sorted_sequence[1] # Return the second element\n else:\n return \"NO\"\n\n# Read the number of elements in the sequence\nn = int(input().strip())\n\n# Read the sequence\nseq = list(map(int, input().strip().split()))\n\n# Find the second order statistics\nsecond_order_statistics = findSecondOrderStatistics(n, seq)\n\n# Print the result\nprint(second_order_statistics)\n\t \t\t\t\t\t\t \t \t \t\t\t \t\t \t\t\t", "x = int(input())\r\ny = set(list(map(int, input().split())))\r\ny = sorted(y)\r\ntry:\r\n print(y[1])\r\nexcept IndexError:\r\n print('NO')", "n = int(input())\nA = list(map(int, input().split()))\nA = list(set(A))\nA.sort()\n\nif len(A) == 1:\n print('NO')\nelse:\n print(A[1])\n", "x=int(input())\r\nt=list(map(int,input().split()))\r\nE=set()\r\nE=set(t)\r\nf=len(E)\r\nt=list(E)\r\nif (f==1):\r\n print(\"NO\")\r\nelse:\r\n t.sort()\r\n print(t[1])", "ct = 0\r\nseq = int(input())\r\nnum = list(map(int, input().split(\" \")))\r\nnum.sort()\r\nfor i in num:\r\n low = num[0]\r\n if i == low:\r\n ct += 1\r\n elif i > low:\r\n print(i)\r\n break\r\nif ct == len(num):\r\n print(\"NO\")\r\n", "q=int(input())\nw=list(map(int,input().split()))\nw.sort()\nflag=0\nfor i in range(q-1):\n if(w[i]<w[i+1]):\n print(w[i+1])\n # for i in range(q-1):\n # if(w[i]<w[i+1]):\n # print(w[i+1])\n flag=1\n break\nif(flag==0):\n print(\"NO\")\n\t\t\t \t \t\t \t \t\t \t \t\t \t", "n=input();s=sorted(set(map(int, input().split())))\r\nif len(s) >= 2:\r\n print(s[1])\r\nelse:\r\n print(\"NO\")\r\n", "n=int(input())\nl=list(map(int,input().split()))\na=set(l)\nb=sorted(a)\nif(len(b)<2):\n\tprint(\"NO\")\nelse:\n\tprint(b[1])\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 numbers = [int(_) for _ in input().split()]\r\n numbers.sort()\r\n\r\n try:\r\n print(next(numbers[i] for i in range(1, n) if numbers[i] > numbers[0]))\r\n except StopIteration:\r\n print('NO')\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "n=int(input())\narray=list(map(int,input().split()))\na=list(set(array))\nb=sorted(a)\nif(len(b)==1):\n print(\"NO\")\nelse:\n print(b[1])\n \t \t\t \t \t\t\t \t\t \t \t \t", "def main():\n input()\n l = list(map(int, input().split()))\n m = min(l)\n l = [x for x in l if x > m]\n print(min(l) if l else \"NO\")\n\n\nif __name__ == '__main__':\n main()\n", "n = int(input())\nd = list(map(int,input().split()))\nif len(set(d)) == 1:\n print(\"NO\")\n exit()\nelse:\n print(sorted(set(d))[1])\n", "a=int(input())\nq=list(map(int,input().split()))\nq=list(set(q))\nq.sort()\nif len(q)>1:\n print(q[1])\nelse:\n print(\"NO\")\n\t\t \t \t \t\t \t \t \t\t\t \t \t\t", "n=int(input())\r\nb=input().split()\r\nl=[int(x) for x in b]\r\nl.sort()\r\ns=set(l)\r\nl1=list(s)\r\nl1.sort()\r\ntry:\r\n print(l1[1])\r\nexcept:\r\n print(\"NO\")", "# print(5)\r\n#\r\n# print(\"I did it in Pyhton\")\r\n#\r\n# aaa=[1,2,3,3]\r\n#\r\n# print(aaa[-2])\r\n#\r\n# a=input(\"\")\r\n# print(a)\r\n\r\n# a=input(\"\")\r\n# a=int(a)\r\n# if a%2==0 and not a==2:\r\n# # print(\"YES\")\r\n# # else :\r\n# # print(\"NO\")\r\n# ar=[]\r\n# i=1\r\n# s=0\r\n# while i<=105:\r\n# s += (i*(i+1))/2\r\n# i+=1\r\n# ar.append(s)\r\n#\r\n# n=input(\"\")\r\n# n=int(n)\r\n# k=1\r\n# # prev=0\r\n# for i in ar:\r\n# # prev[i-1]\r\n# # print(prev)\r\n# if i>n:\r\n# print(k-1)\r\n# break\r\n# elif i==n :\r\n# print(k)\r\n# break\r\n# k+=1\r\n# n=input(\"\")\r\n# n=int(n)\r\n#\r\n# i=0\r\n# while i<n :\r\n# print(\"I hate \")\r\n# i+=1\r\n# if i==n-1 :\r\n# print(\"it\")\r\n# break\r\n# else :\r\n# print(\"that \")\r\n# print(\"I love \")\r\n# i+=1\r\n# if i==n-1 :\r\n# print(\"it\")\r\n# break\r\n#\r\n# n=int(input())\r\n# m=[\"I hate\",\"I love\"]*n\r\n# print(\" that \".join(m[:n]),\"it\")\r\nn = int(input())\r\na = set(map(int,input().split()))\r\na = sorted(a)\r\nprint('NO' if len(a) == 1 else a[1])", "def sec(n,arr):\n sort=sorted(set(arr))\n if(len(sort)>1):\n return sort[1]\n else:\n return \"NO\"\nn=int(input())\nseq=list(map(int,input().strip().split()))\nres=sec(n,seq)\nprint(res)\n\t \t \t \t \t\t\t\t \t\t\t \t \t\t\t\t", "n = int(input())\r\nnums = [int(j) for j in input().split()]\r\nref = 201 * [0]\r\nfor j in range(n):\r\n ref[nums[j] + 100] = 1\r\nindex = -1\r\nfor j in range(201):\r\n if ref[j] == 1:\r\n index = j + 1\r\n break\r\noutput = \"NO\"\r\nfor j in range(index, 201):\r\n if ref[j] == 1:\r\n output = j\r\n break\r\nif output == \"NO\":\r\n print(\"NO\")\r\nelse:\r\n print(output - 100)\r\n", "n = int(input())\r\na = sorted(list(map(int, input().split())))\r\nans = 'NO'\r\nfor i in range(1, n):\r\n if a[i] > a[i - 1]:\r\n ans = a[i]\r\n break\r\n\r\nprint(ans)\r\n", "from sys import stdin\n\ndef main():\n\tstdin.readline()\n\tA = list(map(int, stdin.readline().strip().split()))\n\tmenor = 101\n\tans = 101\n\tfor x in A:\n\t\tif x < menor:\n\t\t\tans = menor\n\t\t\tmenor = x\n\t\t\n\t\telif x != menor and x < ans:\n\t\t\tans = x\n\t\t\t\n\tif ans == 101:\n\t\tprint(\"NO\")\n\telse:\n\t\tprint(ans)\nmain()\n \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\ns=set(l)\r\nl2=[] \r\nfor i in s:\r\n l2.append(i)\r\nl2.sort()\r\nif len(s)==1:\r\n print(\"NO\")\r\nelse:\r\n print(l2[1])", "#hi\nnum=int(input())\na=list(map(int,input().split()))\nb=set(a)\nc=list(b)\nc.sort()\nif len(c)==1:\n print(\"NO\")\nelse:\n print(c[1])\n\t \t \t \t \t \t \t\t\t\t \t\t\t", "n = [int(i) for i in input().split()]\r\narr = list(set([int(i) for i in input().split()]))\r\n\r\nif (len(arr) == 1):\r\n print(\"NO\")\r\nelse:\r\n arr.sort()\r\n print(arr[1])", "n = int(input())\nA = list(map(int, input().split()))\ns = sorted(list(set(A)))\nif len(s) == 1:\n print(\"NO\")\nelse:\n print(s[1])\n\t\t\t \t \t\t \t \t\t\t\t\t\t\t\t\t\t \t\t\t\t", "def sec_order(n,arr):\n sort=sorted(set(arr))\n if(len(sort)>1):\n return sort[1]\n else:\n return \"NO\"\nn=int(input())\nseq=list(map(int,input().strip().split()))\nres=sec_order(n,seq)\nprint(res)\n \t\t\t \t \t \t\t\t \t\t \t \t \t \t\t", "num=int(input())\r\ns=list(map(int, input().split()))\r\ns.sort(reverse=True)\r\nmi=min(s)\r\nif s.index(mi)==0 :\r\n print(\"NO\")\r\nelse:\r\n print(s[s.index(mi)-1])", "a = input()\nv= []\nb = input()\n#b = b.split()\nb=[int(i) for i in b.split()]\nb.sort()\nif b[0] == b[-1]:\n print('NO')\nfor i in range(len(b)):\n if b[0] != b[i]:\n print(b[i])\n break\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\ns=set(l)\r\nl=list(s)\r\nl.sort()\r\nif(len(l)>=2):\r\n print(l[1])\r\nelse:\r\n print('NO')", "def secondorder(arr, size):\n\tarr.sort()\n\treturn arr[1]\nsize = int(input())\nlist = []\nnum = input().split(\" \")\nfor i in num:\n\tif(int(i) not in list):\n\t\tlist.append(int(i))\nif len(list) == 1:\n\tprint(\"NO\")\nelse:\n\tprint(secondorder(list, size))\n \t\t \t\t \t \t \t\t\t \t\t\t\t \t \t\t \t", "n = int(input())\r\ncont = [int(item) for item in input().split()]\r\ncont = list(set(cont))\r\ncont.sort()\r\nprint('NO' if len(cont)==1 else cont[1])\r\n\r\n\r\n", "a=int(input())\r\narr=list(map(int,input().split()))\r\narr=set(arr)\r\narr=sorted(arr)\r\nif len(arr)>1:\r\n print(arr[1])\r\nelse:\r\n print('NO')", "n=int(input())\r\nlst=list(set(list(map(int, input().split()))))\r\nlst.sort()\r\nif len(lst) > 1:\r\n print(lst[1])\r\nelse:\r\n print(\"NO\")", "n=int(input())\r\nch=input()\r\ne=set(map(int , ch.split()))\r\nif len(e)==1 :\r\n print(\"NO\")\r\nelse :\r\n l=list(e)\r\n n=len(l)\r\n for j in range(2) :\r\n m=l[j]\r\n k=j\r\n for i in range(j+1,n) :\r\n if l[i]<m :\r\n m=l[i]\r\n k=i\r\n a=l[k]\r\n l[k]=l[j]\r\n l[j]=a\r\n print(l[1])\r\n \r\n ", "dummy = int(input())\na = sorted(list(set(map(int, input().strip().split()))))\nif len(a) == 1:\n print(\"NO\")\nelse:\n print(a[1])\n \t \t \t\t\t\t \t\t \t\t \t \t\t\t", "n = int(input())\n\narr = list(map(int,input().split()))\n\nsarr = sorted(arr)\n\nfor i in range(1,n):\n if(sarr[i]>sarr[0]):\n print(sarr[i])\n break\n \nelse:\n print(\"NO\")\n \t \t \t\t\t\t\t\t\t\t\t \t\t \t \t", "n = int(input());\r\ns = set(map(int,input().split()));\r\nif len(s)<2:\r\n print('NO');\r\nelse:\r\n print(sorted(list(s))[1]);", "input()\r\nl = sorted(set(map(int, input().split())))\r\nprint(l[1] if (len(l) >= 2) else 'NO')", "n=int(input())\ni=[int(xz) for xz in input().split()]\ni=list(set(i))\ni.sort()\nif(len(i)==1):\n print(\"NO\")\nelse:\n print(i[1])\n \t \t\t\t\t \t \t \t \t \t\t \t \t\t", "def f(l):\r\n s=[]\r\n for i in range(len(l)):\r\n if l[i]!=min(l) :\r\n s=s+[l[i]]\r\n return s\r\nn=int(input())\r\nl=list(map(int,input().split()))\r\nif len(f(l))==0 :\r\n print(\"NO\")\r\nelse:\r\n print(min(f(l)))\r\n ", "n=int(input())\nlista=list(map(int,input().split()))\nlista.sort()\ncount=0\na=lista[0]\nfor i in lista:\n\tif(i!=a):\n\t\tprint(i)\n\t\tcount=1\n\t\tbreak\nif(count==0):\n\tprint(\"NO\")", "n = int(input())\na = list(map(int,input().split()))\nb = sorted(set(a))\nif len(b) > 1:\n print(b[1])\nelse:\n print('NO')\n", "n = int(input())\nx = sorted(list(set(list(map(int, input().split())))))\nif len(x) > 1:\n print(x[1])\nelse:\n print('NO')\n", "n = int(input())\r\n\r\ninteger = set(map(int,input().split()))\r\nsort = sorted(integer)\r\n\r\nif len(sort) != 1:\r\n print(sort[1])\r\nelse:\r\n print(\"NO\")", "n = int(input())\r\n\r\narr = list(map(int, input().split()))\r\nlst5 = []\r\nfor i in arr:\r\n if i not in lst5:\r\n lst5.append(i)\r\n \r\nlst5.sort()\r\nif(len(lst5)>=2):\r\n print(lst5[1])\r\nelse:\r\n print(\"NO\")", "n = int(input())\r\na = list(map(int,input().split()))\r\nl = max(a)\r\ns = min(a)\r\nif l == s:\r\n print(\"NO\")\r\nelse:\r\n for x in range(s+1, l+1):\r\n if x in a:\r\n print(x)\r\n break", "s=0\r\nz=int(input())\r\nx=list(map(int,input().split()))\r\nx.sort()\r\nfor i in range(z-1):\r\n if x[i]!=x[i+1]:\r\n print(x[i+1])\r\n s+=1\r\n break\r\nif s==0:\r\n print('NO')", "n = int(input())\r\ns = map(int,input().split())\r\ns = list(s)\r\ns = sorted(s)\r\n \r\nc = True\r\nfor i in range(len(s)-1):\r\n if s[i] != s[i+1]:\r\n print(s[i+1])\r\n c = False\r\n break\r\n \r\nif c == True or len(s) < 2:\r\n print('NO')\r\n", "n=int(input())\r\nx=list(map(int ,input().split()))\r\ny=list(set(x))\r\ny.sort()\r\nif(len(y)==1):\r\n print(\"NO\")\r\nelse:\r\n print(y[1]) ", "n = int(input())\r\narr = list(map(int,input().strip().split(' ')))\r\narr = sorted(list(set(arr)))\r\nprint(arr[1] if len(set(arr)) > 1 else \"NO\")\r\n", "n = int(input())\r\nr = sorted(set(map(int, input().split())))\r\nif len(r) >= 2:\r\n print(r[1])\r\nelse:\r\n print('NO')", "n = int(input())\narr = list(set(map(int,input().split())))\narr.remove(min(arr))\ntry:\n print(min(arr))\nexcept:\n print(\"NO\")\n \t\t\t\t \t \t\t \t\t\t \t \t\t \t\t\t\t", "#rOkY\r\n#FuCk\r\n\r\n################################## kOpAl #####################################\r\n\r\nt=int(input())\r\nl=list(map(int,input().split()))\r\nl.sort()\r\nx=list(dict.fromkeys(l))\r\n\r\nif(len(x)>1):\r\n print(x[1])\r\nelse:\r\n print('NO')\r\n", "n = int(input())\na = list(map(int,input().split()))\na = sorted(set(a))\na.remove(min(a))\nif len(a)==0:\n print(\"NO\")\nelse:\n print(a[0])\n \t\t\t \t \t\t\t \t \t\t\t \t\t", "import sys\r\n\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\ndata = set(map(int, input().split()))\r\ntmp = sorted(data)\r\nprint(tmp[1] if len(tmp) > 1 else \"NO\")", "b = input()\n# print(sorted([9,2,4,56,1]))\nd = list(set(sorted(map(int,input().split()))))\ntry:\n print(d[1])\nexcept:\n print(\"NO\")\n \t\t \t\t \t \t \t\t \t\t \t\t \t", "print(sorted(list(a))[1] if 0*int(input())+len(a:=set(map(int, input().split()))) != 1 else \"NO\")", "n = int(input().strip())\r\narr = list(set(map(lambda x: int(x), input().strip().split(' '))))\r\narr.sort()\r\nif (len(arr) <= 1):\r\n print(\"NO\")\r\nelse:\r\n print(arr[1])\r\n", "\r\nn = int(input())\r\nli = list(map(int,input().split()))\r\n\r\ns = list(set(li))\r\ns.sort()\r\nif len(s)>=2:\r\n print(s[1])\r\nelse:\r\n print('NO')", "def second_order_stat(arr):\r\n min_value = float('inf')\r\n second_min = float('inf')\r\n for num in arr:\r\n if num < min_value:\r\n second_min = min_value\r\n min_value = num\r\n elif second_min > num and num != min_value:\r\n second_min = num\r\n return second_min if second_min != float('inf') else None\r\n\r\nn = int(input())\r\narr = list(map(int, input().split()))\r\nval = second_order_stat(arr)\r\nprint(val if val else 'NO')", "ain=int(input())\nbin=list(map(int,input().split()))\nbin=list(set(bin))\nbin.sort()\nif len(bin)>1:\n print(bin[1])\nelse:\n print(\"NO\")\n\t \t \t \t\t \t\t\t \t \t \t \t\t\t\t", "n = int(input())\r\nnSet = set()\r\n\r\nin_list = input().split()\r\nfor entry in in_list:\r\n entry = int(entry)\r\n nSet.add(entry)\r\n\r\nin_list = list(nSet)\r\nin_list.sort()\r\n\r\nif len(in_list) >= 2:\r\n print(in_list[1])\r\nelse:\r\n print(\"NO\")", "n=int(input())\nli=[int(x) for x in input().split()]\nln=[]\nfor i in li:\n if i not in ln:\n ln.append(i)\nln.sort()\nif(len(ln)>1):\n print(ln[1])\nelse:\n print(\"NO\")\n \t \t\t \t \t \t \t \t\t \t\t\t\t\t", "n=int(input())\r\nl=list(map(int,input().split()))\r\ny=list(set(l))\r\ny.sort()\r\nif len(y)>1:\r\n print(y[1])\r\nelse:\r\n print(\"NO\")", "n=int(input())\r\nx=[int(x) for x in input().split()]\r\nans=[]\r\nfor el in x:\r\n if el not in ans:\r\n ans.append(el)\r\nans.sort()\r\nif(len(ans)==1):\r\n print(\"NO\")\r\nelse:\r\n print(ans[1])", "n=int(input())\nl=list(map(int,input().strip().split()))[:n]\nl.sort()\nr=[]\nfor i in l:\n if i not in r:\n r.append(i)\nif len(r)<=1:\n print('NO')\nelse:\n print(r[1])\n\n\t\t \t \t \t \t\t\t \t \t \t \t \t", "num = int(input())\narraya = list(set(map(int,input().split())))\narraya.remove(min(arraya))\ntry:\n print(min(arraya))\nexcept:\n print(\"NO\")\n\t\t \t\t \t\t \t\t \t\t\t \t\t \t \t\t \t", "num=int(input())\r\n\r\nvals=list(map(int,input().split()))\r\n\r\nvals.sort()\r\n\r\nflag=0\r\n\r\nfor i in vals:\r\n if i>vals[0]:\r\n print(i)\r\n flag=1\r\n break\r\n \r\n\r\nif flag==0:\r\n print('NO')\r\n ", "n=int(input())\nm=input().split()\nl1=[int(x) for x in m]\ns=set(l1)\nl2=list(s)\nl2.sort()\ntry:\n print(l2[1])\nexcept:\n print(\"NO\")\n \t \t \t \t\t \t \t\t \t\t\t\t \t\t\t\t\t", "n = int(input()); L = sorted(list(set(int(x) for x in input().split())))\r\nprint(L[1] if len(L) >= 2 else 'NO')\r\n", "n=int(input())\narray2=list(set(map(int,input().split())))\narray2.remove(min(array2))\ntry:\n\tprint(min(array2))\nexcept:\n\tprint(\"NO\")\n\t \t \t\t\t \t \t\t\t\t \t \t \t\t \t\t", "n=int(input())\narray=list(map(int,input().split()))\nx=list(set(array))\ny=sorted(x)\nif(len(y)==1):\n print(\"NO\")\nelse:\n print(y[1])\n \t\t\t \t \t \t\t \t \t\t \t\t \t \t", "num=int(input())\r\nlist_=sorted(set(map(int,input().split())))\r\nif len(list_)==1:\r\n print(\"NO\")\r\nelse:\r\n \r\n print(list_[1])\r\n", "n = int(input())\nvalues = list(map(int,input().split(' ')))\noutput = sorted(set(values))\nif len(output)<=1:\n print('NO')\nelse:\n print(output[1])\n \t\t\t \t \t\t\t\t\t \t\t\t \t \t", "n = int(input())\nprices = list(map(int, input().split()))\n\nmin_price = float('inf')\nsecond_min_price = float('inf')\nfor price in prices:\n if price < min_price:\n second_min_price = min_price\n min_price = price\n elif price < second_min_price and price != min_price:\n second_min_price = price\n\nif second_min_price == float('inf'):\n print(\"NO\")\nelse:\n print(second_min_price)\n\n \t\t \t \t\t\t \t\t\t \t \t \t\t \t \t\t", "n=int(input())\r\nlist=[int(x) for x in input().split()][:n]\r\nlist.sort()\r\nfor i in range(len(list)-1):\r\n if list[i]!=list[i+1]:\r\n print(list[i+1])\r\n break\r\nelse:\r\n print('NO')", "n = int(input())\r\nlis = input()\r\nlis = lis.split()\r\n\r\nabc = []\r\nfor i in range(n) :\r\n lis[i] = int(lis[i])\r\na = min(lis)\r\nfor j in range(n) :\r\n if int(lis[j]) != a :\r\n abc.append(lis[j])\r\n \r\nif len(abc) >=1 :\r\n print(min(abc))\r\nelse :\r\n print('NO')", "s=int(input())\no=list(map(int,input().split()))\no=list(set(o))\no.sort()\nif len(o)>1:\n print(o[1])\nelse:\n print(\"NO\")\n \t\t \t\t \t \t\t \t \t", "n = int(input())\r\na = sorted(list(set(map(int,input().split()))))\r\nif len(a)>1:print(a[1])\r\nelse:print(\"NO\")", "n = int(input())\r\nlst = [int(x) for x in set(input().split())]\r\n\r\nif len(lst) < 2:\r\n print('NO')\r\nelse:\r\n lst.sort()\r\n print(lst[1])\r\n", "Ens=set()\r\nch=input()\r\nn=int(ch)\r\ntab=list(map(int,input().split()))\r\nEns=set(tab)\r\ns=len(Ens)\r\nmy_list=list(Ens)\r\nif (s==1):\r\n print(\"NO\")\r\nelse:\r\n my_list.sort()\r\n print(my_list[1])\r\n", "n = int(input())\na = list(map(int,input().split()))\nif len(set(a)) < 2:\n print(\"NO\")\nelse:\n x = list(set(a))\n x.sort()\n print(x[1])\n\t\t \t\t\t\t \t \t\t \t \t\t \t \t", "def main():\r\n n=int(input())\r\n ensemble=set()\r\n for ite in map(int, input().split()):\r\n ensemble.add(ite)\r\n taille=len(ensemble)\r\n if(taille>1):\r\n liste=[]\r\n for ite in ensemble:\r\n liste.append(ite)\r\n liste.sort()\r\n print(liste[1])\r\n else:\r\n print(\"NO\")\r\n\r\nmain()\r\n", "n = int(input())\narr = list(map(int, input().split()))\narr.sort()\nminimum = min(arr)\narr1 = []\nfor i in range(0, len(arr)):\n if arr[i] > minimum:\n arr1.append(arr[i])\n break\nif len(arr1) == 1:\n print(arr1[0])\nelse:\n print(\"NO\")\n \t\t \t \t \t\t \t\t \t \t \t \t \t", "n = int(input())\na = list(map(int,input().strip().split( )))*n\nk = set(a)\nf = sorted(k)\nif(len(k) == 1):\n print('NO')\nelif(len(k) != 1):\n print(f[1])\n \t\t\t\t\t\t \t\t \t \t \t \t \t\t", "n = int(input())\r\nw = list(map(int, input().split()))\r\n\r\nif n == 1:\r\n print(\"NO\")\r\nelse:\r\n w.sort()\r\n for i in range(n-1):\r\n if w[i+1] > w[i]:\r\n print(w[i+1])\r\n break\r\n else:\r\n print(\"NO\")\r\n", "n=int(input())\nl=list(map(int,input().split()))\nl=list(set(l))\nif(len(l)==1):\n print(\"NO\")\nelse:\n l.sort()\n print(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\na = list(map(int, input().split()))\r\na = list(set(a))\r\na.sort()\r\nif len(a) >= 2:\r\n print(a[1])\r\nelse:\r\n print('NO')", "n=int(input())\r\nlst=list(map(int,input().split()))\r\nlst=set(lst)\r\nlst=list(lst)\r\nlst.sort()\r\nprint(\"NO\") if len(lst)==1 else print(lst[1])", "p= int(input())\nq = list(map(int,input().split()))\nq = sorted(set(q))\nq.remove(min(q))\nif len(q)!=0:\n\n print(q[0])\n\nelse:\n\n \n print(\"NO\")\n \n\t \t \t \t\t\t\t\t \t \t \t\t\t \t \t\t\t \t", "n=int(input())\r\na=sorted(set(list(map(int,input().split()))))\r\nif len(a)>1:\r\n\tprint(a[1])\r\nelse:\r\n\tprint(\"NO\")", "a=int(input())\narr=list(map(int,input().split()))\narr=set(arr)\narr=sorted(arr)\nif len(arr)>1:\n print(arr[1])\nelse:\n print('NO')\n \t \t \t\t \t \t\t \t \t\t\t \t \t \t \t\t\t", "n=int(input())\r\na=list(map(int,input().split()))\r\ns=set(a)\r\nk=list(s)\r\nk.sort()\r\nif len(k)>=2:\r\n print(k[1])\r\nelse:\r\n print('NO')\r\n", "n=int(input(''))\r\nl=list(map(int,input().split()))\r\ns=[]\r\nfor i in l:\r\n if i not in s:\r\n s.append(i)\r\ns.sort()\r\nif len(s)==1:\r\n print('NO')\r\nelse:\r\n print(s[1])", "num=int(input())\nclamp=list(map(int,input().split())); clamp.sort()\ntrip=0\nfor x in range(num-1):\n if(clamp[x]<clamp[x+1]): print(clamp[x+1]); trip=1; break\nif(trip==0):\n print(\"NO\")\n \t \t \t\t\t\t\t\t\t\t\t\t \t \t \t \t", "n = int(input())\nli = list(map(int,input().split()))\nli.sort()\na = []\nse = set(li)\nfor i in se:\n a.append(i)\na.sort()\nif (len(a) == 1 or len(a) == a.count(a[0])):\n print(\"NO\")\nelse: \n print(a[1])\n \t\t\t\t \t \t\t \t\t\t\t\t \t\t \t \t\t \t\t", "import sys\n\n\ndef read(func=int):\n return func(sys.stdin.readline().strip())\n\n\ndef read_array(func=int):\n return list(map(func, read(str).split()))\n\n\ndef binary_search(arr, x):\n #\n i, j = 0, len(arr) - 1\n ans = -1\n #\n while i <= j:\n\n mid = i + (j - i) // 2\n xmd = arr[mid]\n\n if xmd <= x:\n ans = mid\n i = mid + 1\n\n else:\n j = mid - 1\n\n return ans\n\n\ndef gcd(a, b):\n \"\"\"\n https://cp-algorithms.com/algebra/euclid-algorithm.html\n \"\"\"\n if not b:\n return a\n\n return gcd(b, a % b)\n\n\ndef lcm(a, b):\n return a / gcd(a, b) * b\n\n\n\nn = read()\nA = read_array()\nA.sort()\nif n > 1:\n mini = A[0]\n fond = False\n for ai in A:\n if ai > mini:\n print(ai)\n fond = True\n break\n\n if not fond:\n print('NO')\nelse:\n print('NO')\n\n \t\t \t \t\t \t\t\t\t \t \t\t \t\t \t \t\t", "n=int(input())\nl=list(map(int,input().split()))\nl = set(l)\nres=sorted(l)\nif len(res)<=1:\n print('NO')\nelse:\n print(res[1])\n\t\t\t \t\t \t \t\t\t\t\t \t \t\t\t \t\t", "n=input()\r\na=sorted(list(set(map(int,input().split()))))\r\nif len(a)==1:\r\n print(\"NO\")\r\nelse: \r\n print(a[1])", "n=int(input())\r\nL=list(map(int,input().split()))\r\nL=sorted(L)\r\nunique=[]\r\nfor i in range(0,n):\r\n if L[i]==L[i-1]:\r\n continue\r\n else:\r\n unique.append(L[i])\r\nif len(unique)>1:\r\n print(unique[1])\r\nelse:\r\n print(\"NO\")", "n = int(input())\na = list(map(int, input().split()))\n\na.sort()\n\nsecond_min = None\nfor x in a:\n if x > a[0]:\n second_min = x\n break\n\nif second_min is not None:\n print(second_min)\nelse:\n print(\"NO\")\n\n \t \t \t \t\t \t\t \t \t\t", "n = int(input())\narr = list(map(int,input().split()[:n]))\narr = list(set(arr))\narr.sort()\nif(len(arr) == 1):\n print(\"NO\")\nelse:\n print(arr[1])\n \t \t\t \t\t\t\t \t \t\t \t \t \t \t\t \t\t", "n = int(input())\narr = set(map(int, input().split()))\n\nprint(sorted(arr)[1] if len(arr) > 1 else 'NO')\n\n \t \t\t\t\t\t \t\t\t\t\t\t \t \t\t\t\t", "import sys\r\nimport io\r\nimport os\r\n\r\ntotal = 0\r\nfailed = 0\r\ndef debug(*args):\r\n if('LOCALTEST' in os.environ):\r\n print(*args, file=sys.stderr)\r\ndef run(test,res):\r\n x = io.StringIO()\r\n with io.StringIO(test) as sys.stdin:\r\n with x as sys.stdout:\r\n work()\r\n z = x.getvalue().strip()\r\n sys.stdout = sys.__stdout__\r\n print(\"Passed?\", z == res)\r\n print(\"Expected: \", res)\r\n print(\"Actual : \", z)\r\n global total, failed\r\n total += 1\r\n failed += 1 if (z != res) else 0\r\n\r\ndef work():\r\n n = int(input())\r\n f = list(map(int, input().split()))\r\n f = set(f)\r\n if len(f) < 2:\r\n print(\"NO\")\r\n return\r\n f = f ^ set([min(f)])\r\n print(min(f))\r\n\r\ndef test():\r\n run(\"\"\"4\r\n1 2 2 -4\"\"\", \"\"\"1\"\"\")\r\n run(\"\"\"5\r\n1 2 3 1 1\"\"\", \"\"\"2\"\"\")\r\n\r\nif('LOCALTEST' in os.environ):\r\n test()\r\n print(\"\\n Result: %s (%d total, %d failed)\" % (\"FAILED\" if (failed>0) else \"PASSED\", total, failed))\r\nelse:\r\n work()\r\n", "t=int(input())\narr=list(map(int,input().split()))\nif(t==1):\n print(\"NO\")\nelse:\n a=arr[0]\n b=arr[1]\n if a>b:\n a,b=b,a\n for i in range(2,len(arr)):\n if(arr[i]<a):\n b=a\n a=arr[i]\n else:\n if arr[i]>a and (arr[i]<b or a==b):\n b=arr[i]\n \n if a!=b:\n print(b)\n else:\n print(\"NO\")\n \t \t \t\t \t \t \t \t \t\t\t\t\t \t \t", "a=int(input())\nb=input().split()\nc=[]\nfor i in b:\n c.append(int(i))\nc.sort()\nd=[]\nfor j in c:\n if j not in d:\n d.append(j)\nif len(d)==1:\n print('NO')\nelse:\n print(d[1])\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()))\na.sort()\nt=a[0]\nf=0\nfor i in range(len(a)):\n if a[i]!=t:\n print(a[i])\n f=0\n break\n else:\n f=1\nif f==1:\n print(\"NO\")\n\t \t\t \t \t \t\t \t\t\t \t \t \t\t\t", "n=int(input())\r\nl=set(map(int,input().split()))\r\nl=sorted(l)\r\nif len(l)<2:\r\n\tprint('NO')\r\nelse:print(l[1])", "d = int(input())\nx = sorted(list(set(map(int,input().strip().split()))))\nif len(x)==1:\n\tprint(\"NO\")\n\nelse:\n\tprint (x[1])\n\t\t\t\t \t \t \t\t \t \t\t \t \t \t \t \t", "input()\r\n\r\nn = input().split()\r\nint_i = []\r\nfor i in n:\r\n int_i.append(int(i))\r\nmin_n = min(int_i)\r\nint_i.sort()\r\n\r\nans = \"\"\r\nfor i in int_i:\r\n if i>min_n:\r\n ans+=str(i)\r\n break\r\nif ans == \"\":\r\n ans = \"NO\"\r\n\r\nprint(ans)", "from sys import stdin,stdout\ninput=stdin.readline\nprint=stdout.write\nn=int(input())\na=set(map(int,input().split()));a.remove(min(a))\nprint(str(min(a))+'\\n') if len(a)>=1 else print(str(\"NO\")+'\\n')\n\t \t \t \t \t \t \t \t \t \t\t \t\t\t", "input()\r\na=list(set(map(int, input().split())))\r\na.sort()\r\nif len(a)-1:\r\n print(a[1])\r\nelse:\r\n print(\"NO\")", "n = int( input().strip() )\r\narr = list( map(int, input().strip().split(' ')))\r\nminv = 101\r\nfor i in arr:\r\n minv = min(i, minv)\r\nfor i in range(n):\r\n if arr[i] == minv:\r\n arr[i] = 101\r\n\r\nminv = 101\r\nfor i in arr:\r\n minv = min(i, minv)\r\nprint( str(minv) if minv < 101 else 'NO' )", "balabala = int(input())\na = list(map(int, input().split()))\nprint('NO' if max(a) == min(a) else [i for i in sorted(a) if i > min(a)][0])\n\n \t \t\t \t \t \t \t \t\t\t\t \t \t\t \t\t\t", "input()\r\narr = sorted(set(map(int, input().split())))\r\nif len(arr) > 1:\r\n print(arr[1])\r\nelse:\r\n print(\"NO\")", "n = int(input())\na = list(map(int, input().split()))\nc = list(set(a))\nc = sorted(c)\nif len(c) == 1:\n print(\"NO\")\nelse:\n print(c[1])\n\t\t\t \t \t \t\t\t\t \t\t\t\t \t\t \t \t\t", "input()\r\nl=list(map(int,input().split()))\r\ns=list(set(l))\r\ns.sort()\r\nif(len(s)!=1):\r\n print(s[1])\r\nelse:\r\n print(\"NO\")", "n = int(input())\n\nseq = set(map(int, input().split()))\n\nif len(seq) == 1:\n print(\"NO\")\nelse:\n seq = list(seq)\n seq.sort()\n print(seq[1])\n", "n=int(input())\na=101\nb=101\narr=[int(x) for x in input().split()]\nfor num in arr:\n\t#num=int(input())\n\tif num<a:\n\t\tb=a\n\t\ta=num\n\telif num!=a and num<b:\n\t\tb=num\nif b==101:\n\tprint(\"NO\")\nelse:\n\tprint(b)\n\t\n\t\t \t \t \t\t\t\t \t\t \t \t\t\t\t", "import math\n\ndef main():\n n = int(input())\n a = list(map(int, input().split()))\n m = min(a)\n x = 128\n for i in a:\n if m != i:\n x = min(x, i)\n\n if x == 128: print(\"NO\")\n else: print(x)\n\n\n\nmain()\n", "n = int(input())\r\na = list(map(int, input().split()))\r\na.sort()\r\nif a[0] == a[-1]:\r\n print('NO')\r\nelse:\r\n j = 1\r\n while a[0] == a[j]:\r\n j += 1\r\n print(a[j])\r\n", "x=int(input())\r\ny=list(map(int,input().split()))\r\ny=list(set(y))\r\ny.sort()\r\nif len(y)>1:\r\n print(y[1])\r\nelse:\r\n print(\"NO\")", "n = int(input())\r\na = sorted(set(map(int,input().split())))\r\nif len(a) == 1 : print(\"NO\")\r\nelse : print(a[1])", "dum = input()\nx = list(map(int,input().split()))\nx1 = []\nx1.append(x[0])\nfor i in range(len(x)):\n if x[i] not in x1:\n x1.append(x[i])\nsar= sorted(x1)\nif(len(sar)<2):\n print(\"NO\")\nelse:\n print(sar[1])\n\n \t \t\t\t\t \t \t \t \t\t \t \t\t", "n = int(input())\r\nz = set(int(x) for x in input().split())\r\n\r\nx = list(z)\r\nx.sort()\r\n\r\nif len(x) == 1:\r\n\tprint(\"NO\")\r\nelse:\r\n\tprint(x[1])", "n = int(input())\nsequence = list(map(int, input().split()))\n\nsequence.sort()\n\nsecond_order = None\nmin_element = sequence[0]\n\nfor num in sequence:\n if num > min_element:\n second_order = num\n break\n\nif second_order is None:\n print(\"NO\")\nelse:\n print(second_order)\n\n\t\t \t \t\t \t \t \t \t \t \t\t", "a = input()\r\nk = [str(s) for s in input().split()]\r\nk = set(k)\r\nk = list(map(int, k))\r\nk.sort()\r\nif len(k) == 1:\r\n print('NO')\r\n exit()\r\nprint(k[1])", "test = input()\r\narr = (sorted(list(set(map(int,input().split())))))\r\nif len(arr) == 1:print(\"NO\")\r\nelse:\r\n print(arr[1])", "n = int(input())\nl = list(map(int, input().split()))\n\nl = list(set(l))\nl.sort()\nanswer = 'NO' if len(l) == 1 else l[1]\nprint(answer)\n", "def figure(a):\r\n minim = min(a)\r\n for i in a:\r\n if(i>minim):\r\n print(i)\r\n return\r\n print(\"NO\")\r\n\r\nn = int(input())\r\na = [int(x) for x in input().split()]\r\n\r\na.sort()\r\nfigure(a)\r\n \r\n", "\r\n\r\n\r\n\r\nimport sys\r\nimport math\r\ndef fast_IO():\r\n sys.stdin = open(0)\r\n sys.stdout = open(1, 'w')\r\nfast_IO()\r\n\r\n\r\nsize = int(input())\r\nall = input()\r\nMy_list = all.split()\r\nMy_list = [int(item) for item in My_list]\r\nMy_list.sort()\r\n\r\nfinal = []\r\nfor i in range (size-1):\r\n if (My_list[i]!=My_list[i+1]):\r\n final.append(My_list[i])\r\n\r\nfinal.append(My_list[-1])\r\n\r\nif len(final)<=1: print(\"NO\")\r\nelse: print(final[1])\r\n\r\n\r\n\r\nsys.stdin = sys.__stdin__\r\nsys.stdout = sys.__stdout__", "n=int(input())\nL=list(map(int,input().split()))\nL=sorted(L)\nunique=[]\nfor i in range(0,n):\n if L[i]==L[i-1]:\n continue\n else:\n unique.append(L[i])\nif len(unique)>1:\n print(unique[1])\nelse:\n print(\"NO\")\n\t\t \t\t \t \t\t\t\t\t \t\t\t\t\t\t\t \t\t\t", "n = int(input())\r\nnumbers=input().split()\r\nnumbers = [int(i) for i in numbers] \r\n\r\nif len(numbers) == 1:\r\n print(\"NO\")\r\n exit()\r\n\r\nnumbers_min = min(numbers)\r\nwhile len(numbers) != 0 and numbers_min == min(numbers):\r\n numbers.remove(numbers_min)\r\nif len(numbers) != 0 and min(numbers):\r\n print(min(numbers))\r\nelse:\r\n print(\"NO\")", "n=int(input())\nl=[int(x) for x in input().split()]\nl=set(l)\nl=list(l)\nl.sort()\nif(len(l)>1):\n print(l[1])\nelse:\n print('NO')\n#python\n \t \t\t \t \t\t\t\t \t\t \t\t\t\t", "# Second Order Statistics\r\n\r\nn=int(input(''))\r\nlistA=[int(x) for x in input('').split()]\r\nlistB=[]\r\n \r\nif n==1 or n==0:\r\n print('NO')\r\nelse:\r\n \r\n for i in listA:\r\n if i not in listB:\r\n listB.append(i)\r\n listB.sort()\r\n if len(listB)==1:\r\n print('NO')\r\n else:\r\n \r\n\r\n print(listB[1])\r\n \r\n\r\n \r\n", "input();a=list(map(int,input().split()))\r\na=list(set(a));a.sort()\r\nif len(a)>1:\r\n print(a[1])\r\nelse:\r\n print(\"NO\")", "n=int(input())\nl=list(map(int,input().split()))\nl.sort()\nval=l[0]\ni=0\nf = False\nwhile i<n:\n if l[i]!=val:\n print(l[i])\n f = True\n break\n i+=1\nif f == False:\n print(\"NO\")\n \t\t\t \t\t \t \t \t\t \t \t \t", "number = int(input())\r\narr = list(map(int , input().split()))\r\nnew_arr = []\r\nfor i in arr :\r\n if not i in new_arr :\r\n new_arr.append(i)\r\nnew_arr.sort()\r\nif len(new_arr) == 1 :\r\n print(\"NO\")\r\nelse :\r\n print(new_arr[1])", "input()\r\ncont = sorted(set([int(item) for item in input().split(' ')]))\r\n\r\nprint('NO' if len(cont) == 1 else cont[1])\r\n\r\n'''\r\nif len(cont) == 1:\r\n print('NO')\r\nelse:\r\n print(cont[1])\r\n \r\na = 9\r\nb = 10\r\nmax = 0\r\nif a > b:\r\n max = a\r\nelse:\r\n max = b\r\n \r\nmax = a if a > b else b \r\n'''\r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Tue Mar 30 19:32:51 2021\r\n\r\n@author: nehas\r\n\"\"\"\r\nn = int(input())\r\nl1 = list(input().split())\r\nl2 = []\r\nfor i in l1:\r\n l2.append(int(i))\r\nl1 = set(l2)\r\nl1 = list(l1)\r\nfor i in range(0, len(l1)):\r\n for j in range(i + 1, len(l1)):\r\n if l1[i] > l1[j]:\r\n temp = l1[j]\r\n l1[j] = l1[i]\r\n l1[i] = temp\r\nif len(l1) > 1:\r\n print(l1[1])\r\nelse:\r\n print('NO')", "n=int(input())\r\nl=set(map(int,input().split()))\r\nprint(sorted(l)[1] if len(l)>1 else 'NO')", "# bsdk idhar kya dekhne ko aaya hai, khud kr!!!\r\n# from math import *\r\n# from itertools import *\r\n# import random\r\nt = int(input())\r\narr = list(map(int, input().split()))\r\narr.sort()\r\nnew_arr = list(dict.fromkeys(arr))\r\nif len(new_arr) == 1:\r\n print(\"NO\")\r\nelse:\r\n if new_arr[1] == 101:\r\n print(\"NO\")\r\n else:\r\n print(new_arr[1])\r\n", "n=int(input())\r\nl=set(map(int,input().split()))\r\nl=sorted(l)\r\nif len(l)==1:\r\n print(\"NO\")\r\nelse:\r\n print(list(l)[1])", "q=int(input())\r\na=sorted(list(map(int,input().split())))\r\nfor i in a:\r\n if i!=a[0]:\r\n print(i)\r\n exit()\r\nprint('NO')\r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\nl=(len(set(a)))\r\nif l==1:\r\n print(\"NO\")\r\nelse:\r\n a.sort()\r\n dele=min(a)\r\n #print(dele)\r\n for i in a:\r\n #print(i)\r\n if i!=dele:\r\n print(i)\r\n break", "k=int(input())\nx=[int(p) for p in input().split()]\nx=list(set(x))\nx.sort()\nif(len(x)==1):\n\tprint(\"NO\")\nelse:\n\tprint(x[1])\n \t\t\t \t\t\t \t\t \t \t\t \t \t \t\t\t", "def main():\r\n input()\r\n eles = list(map(int, input().split()))\r\n eles.sort()\r\n smallest = eles[0]\r\n for ele in eles:\r\n if ele > smallest:\r\n print(ele)\r\n break\r\n else:\r\n print(\"NO\")\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "m = int(input())\r\ns = list(map(int, input().split()))\r\ns.sort()\r\ny = set(s)\r\nj = []\r\nfor i in y:\r\n j.append(i)\r\nif len(j)==1:\r\n print(\"NO\")\r\nelse:\r\n print(j[1])", "\r\n\r\n\r\nsize = int(input())\r\nall = input()\r\nMy_list = all.split()\r\nMy_list = [int(item) for item in My_list]\r\nMy_list.sort()\r\n\r\nfinal = []\r\nfor i in range (size-1):\r\n if (My_list[i]!=My_list[i+1]):\r\n final.append(My_list[i])\r\n\r\nfinal.append(My_list[-1])\r\n\r\nif len(final)<=1: print(\"NO\")\r\nelse: print(final[1])\r\n\r\n", "n=int(input())\na=list(map(int,input().split()))\na=set(a)\na=list(a)\na=sorted(a)\nif len(a)>=2:\n print(a[1])\nelse:\n print(\"NO\")\n \t\t \t \t \t\t\t\t\t \t\t \t \t\t \t\t \t", "#!/usr/bin/python3\n\nn = input()\na = sorted(map(int, input().split()))\n\nfor i in range(1, len(a)):\n if a[i] != a[i - 1]:\n print(a[i])\n exit()\nprint('NO')\n", "m=int(input())\r\nx=sorted(list(map(int,input().split())))\r\nt='NO'\r\nfor i in range(m):\r\n\tif x[0]<x[i]:\r\n\t\tt=x[i]\r\n\t\tbreak\r\nprint(t)", "a=int(input())\narray=list(map(int,input().split()))\nb=list(set(array))\nc=sorted(b)\nif(len(c)==1):\n print(\"NO\")\nelse:\n print(c[1])\n \t \t\t\t\t\t \t \t\t\t \t \t\t \t\t\t", "input()\nl = list(set(map(int, input().split())))\nl.sort()\nif len(l) >1:\n print(l[1])\nelse:\n print(\"NO\")\n \t \t \t\t\t\t\t\t\t \t \t\t \t \t\t\t\t", "n=int(input())\nl1=list(map(int,input().split()))\ns=set(l1)\nl2=[]\nl2=list(s)\nif(len(s)==1):\n\tprint(\"NO\")\nelse:\n\tm1=min(l1)\n\tl2.remove(m1)\n\tprint(min(l2))\n \t \t\t \t\t \t\t\t \t\t\t\t\t \t\t\t\t\t\t", "a = int(input())\nj = list(map(int,input().split()))\n\njaish1 = set(j)\njaish2 = list(jaish1)\njaish2.sort()\nsi = len(jaish2)\nif si>1:\n\tprint(jaish2[1])\nelse:\n\tprint(\"NO\")\n\t \t\t\t \t\t\t \t\t\t\t \t \t\t \t \t \t\t\t", "n=int(input())\r\nl=[int(x) for x in input().split()]\r\nh=min(l)\r\ns=[]\r\nc=0\r\nfor i in range(n):\r\n\tif(l[i]!=h):\r\n\t\ts.append(l[i])\r\n\telse:\r\n\t\tc=c+1\r\nif(len(l)<2):\r\n\tprint('NO')\r\nelif(c==len(l)):\r\n\tprint('NO')\r\nelse:\r\n\tprint(min(s))\r\n", "import math\r\nn = int(input())\r\na = list(map(int, input().split()))\r\nx = min(a)\r\nans = math.inf\r\nfor i in a:\r\n if(i > x and ans > i):\r\n ans = i\r\nif(ans==math.inf):\r\n print(\"NO\")\r\nelse:\r\n print(ans)\r\n", "anji=int(input())\r\no=list(map(int,input().split()))\r\no=list(set(o))\r\no.sort()\r\nif len(o)>1:\r\n print(o[1])\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\nll = list(set(list(map(int, input().split()))))\r\nll.sort()\r\nif len(ll)==1:\r\n print(\"NO\")\r\nelse:\r\n print(ll[1])", "x=int(input())\r\nl=list(map(int,input().split()))\r\n\r\n\r\nl=list(set(l))\r\nl.sort()\r\ntry:\r\n print(l[1])\r\nexcept:\r\n print('NO')\r\n", "n = int(input())\r\na = list(map(int,input().split()))\r\na = list(set(a))\r\nif(len(a)==1):\r\n print(\"NO\")\r\n exit(0)\r\na.sort()\r\nprint(a[1])\r\n", "from collections import Counter\nn= int(input())\nl = list(map(int,input().split(\" \")))[:n]\nif(n>1):\n freq=dict(Counter(l))\n k=list(freq.keys())\n k=sorted(k)\n if(len(k)==1):\n print(\"NO\")\n else:\n print(k[1])\nelse:\n print(\"NO\")\n\n\t\t\t \t\t\t \t\t\t\t \t \t \t \t \t \t", "n= int(input())\r\nif n>1:\r\n a= sorted(map(int,str.split(input())),reverse=True)\r\n if a[0]!=a[-1]:\r\n c= a.index(a[-1])\r\n print(a[c-1])\r\n else:print('NO')\r\n \r\nelse: print('NO')", "inp = int(input())\r\nls = list(map(int, input().split()))\r\nls.sort()\r\nm = ls[0]\r\nfor i in ls:\r\n if i!=m:\r\n print(i)\r\n break\r\nelse:\r\n print('NO')\r\n", "a=int(input())\r\np=[]\r\nl=list(map(int,input().split()))\r\np=set(l)\r\n\r\np=list(p)\r\n\r\np.sort()\r\nif len(p)>1:\r\n \r\n\r\n print(p[1])\r\nelse:\r\n print(\"NO\")", "n=int(input())\r\na=[int(x) for x in input().split()]\r\nm=min(a)\r\nb=[]\r\nc=0\r\nfor i in range(n):\r\n if a[i]!=m:\r\n b.append(a[i])\r\n else:\r\n c+=1\r\nif len(a)<2 or c==len(a):\r\n print(\"NO\")\r\nelse:\r\n print(min(b))\r\n ", "\r\ndef main():\r\n \r\n n = input()\r\n l = list(map(int,input().split()))\r\n l = list(set(l))\r\n l.sort()\r\n if len(l) < 2:\r\n print(\"NO\")\r\n else:\r\n print(l[1])\r\n \r\nmain()", "\r\n\r\n_=input()\r\nl=list(map(int,input().split()))\r\nl=set(l)\r\nif len(l)<2:print('NO')\r\nelse: print(sorted(l)[1])", "n = int(input())\r\nA = list(map(int, input().split()))\r\nA.sort()\r\nx = min(A)\r\nfor i in range(1, len(A)):\r\n if A[i] > x:\r\n print(A[i])\r\n break\r\nelse:\r\n print(\"NO\")\r\n", "n=int(input())\nlst2=[int(i) for i in input().split()]\nlst2.sort()\nlst=[]\nfor i in lst2:\n if i not in lst:\n lst.append(i)\nif len(lst)>=2:\n print(lst[1])\nelse:\n print(\"NO\")\n \t \t \t \t \t\t \t\t\t", "if __name__==\"__main__\":\n n=int(input())\n l=list(map(int,input().split()))\n l=set(l)\n if len(l)==1:\n print('NO')\n else: \n l=list(l)\n l.sort()\n print(l[1])\n\n \t \t \t\t\t\t \t\t \t \t \t\t\t\t \t\t", "n = int (input())\r\narr = set(list(map(int, input().split())))\r\narr = sorted(arr)\r\n\r\nif len(arr) == 1:\r\n print(\"NO\")\r\nelse:\r\n print(arr[1])", "n = int(input())\r\nl = sorted(set(map(int,input().split())))\r\n\r\nprint(l[1] if len(l) > 1 else ('NO'))\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "t=int(input())\na=[int(i) for i in input().split()]\na.sort()\nfor i in a:\n if i!=a[0]:\n print(i)\n exit()\nprint(\"NO\")\n\t\t \t\t \t \t\t\t \t\t \t\t", "\r\nn = int(input())\r\nl = list(map(int, input().split()))\r\n\r\nset_ = list(sorted(set(l)))\r\nif len(set_) < 2:\r\n\tprint('NO')\r\nelse:\r\n\tprint(set_[1])", "import sys\n\nn = int(sys.stdin.readline())\n\nnums = set(map(int, sys.stdin.readline().split()))\n\nmini = min(nums)\nnums.remove(mini)\n\nif len(nums) > 0:\n print(min(nums))\nelse:\n print('NO')\n\n\t\t \t \t \t \t \t\t \t\t\t\t\t\t\t", "n = int(input())\nlst = list(map(int,input().split()))\nlst = set(lst)\nlst = list(lst)\nlst.remove(min(lst))\nif(len(lst)==0):\n print(\"NO\")\nelse:\n print(min(lst))\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())) # using list(.)\r\n\r\nLARGE_NUM = 101\r\nsmallest = LARGE_NUM\r\nsecondsmallest = smallest\r\n\r\nfor x in nums: \r\n if (x < smallest):\r\n secondsmallest = smallest\r\n smallest = x \r\n elif (smallest < x < secondsmallest): \r\n secondsmallest = x \r\n\r\nif (secondsmallest == LARGE_NUM):\r\n print(\"NO\")\r\nelse:\r\n print(secondsmallest)", "n = input()\r\nlst = set(map(int, input().split()))\r\nif len(lst) == 1:\r\n print(\"NO\")\r\nelse:\r\n f = min(lst)\r\n lst.remove(f)\r\n print(min(lst))", "n = int(input())\r\nl = sorted(list(set([int(x) for x in input().split()])))\r\nif len(l) < 2:\r\n print('NO')\r\nelse:\r\n print(l[1])", "n, lst = int(input()), list(map(int, input().split()))\r\nlst.sort()\r\nif lst[n - 1] == lst[0]: print(\"NO\")\r\nfor x in range(1, n):\r\n if lst[x] != lst[x - 1]:\r\n print(lst[x])\r\n break", "n=int(input())\r\narr=[int(x) for x in input().split()]\r\nset1=set(arr)\r\nif len(set1)==1:\r\n print(\"NO\")\r\nelse:\r\n min1=min(arr)\r\n #print(min1)\r\n min2=max(arr)\r\n #print(min2)\r\n for ele in set1:\r\n if ele==min1:\r\n continue\r\n if ele<min2:\r\n min2=ele\r\n print(min2)", "n = int(input())\r\nnumbers = sorted([int(x) for x in input().split(\" \")])\r\n\r\nminimum = numbers[0]\r\nfor num in numbers:\r\n if (num != minimum):\r\n print(num)\r\n exit()\r\nprint(\"NO\")", "#!/usr/bin/env/python\r\n# -*- coding: utf-8 -*-\r\nn = int(input())\r\na = list(map(int, input().split()))\r\nmn = min(a)\r\nse = max(a)\r\nif mn == se:\r\n print('NO')\r\nelse:\r\n for i, v in enumerate(a):\r\n if mn < v <se:\r\n pos = i\r\n se = v\r\n print(se)", "input()\r\na=sorted(set([*map(int,input().split())]))\r\nprint('NO' if len(a)<2 else a[1])\r\n", "n=int(input())\nlst=list(map(int,input().split()))\nlst=set(lst)\nlst=list(lst)\nlst.sort()\nif len(lst)==1:\n print(\"NO\")\nelse:\n print(lst[1])\n\t \t\t \t \t \t \t \t\t\t\t\t\t \t \t \t \t", "n=int(input())\nlst=[int(i) for i in input().split()]\nlst.sort()\nfor i in lst:\n if i!=lst[0]:\n print(i)\n exit()\nprint('NO')\n\t \t \t \t\t\t \t \t \t \t\t \t", "n = int(input())\r\narr = list(map(int,input().split()))\r\na = list(set(arr))\r\na = sorted(a)\r\nif len(a) == 1:\r\n print(\"NO\")\r\nelse:\r\n print(a[1])", "n=int(input())\r\nl=list(map(int,input().split()))\r\nw=set(l)\r\nif len(w)>1:\r\n x=list(w)\r\n s=sorted(x)\r\n print(s[1])\r\nelse:\r\n print(\"NO\")", "n=int(input())\r\na=list(map(int,input().split()))\r\nif len(set(a))==1:\r\n print('NO')\r\nelse:\r\n g=[]\r\n d=set(a)\r\n for i in d:\r\n g+=[i]\r\n f=sorted(g)\r\n print(f[1])\r\n\r\n\r\n\r\n", "n=int(input())\r\nt=list(map(int,input().split()))\r\nt=list(set(t))\r\nt.sort()\r\nt.pop(0)\r\nif t==[]:\r\n print(\"NO\")\r\nelse:\r\n print(t[0])", "AmountOfNum = int(input())\nArray = list(map(int,input().split()))[:AmountOfNum]\nNew = set(Array)\nNew1 = sorted(New)\nif(len(New1)>1):\n print(New1[1])\nelse:\n print(\"NO\")\n\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\n\r\nj = int(input())\r\narr = sorted(list(map(int,input().split())))\r\ncout = 'NO'\r\nfor i in range(j):\r\n\tif arr[0] < arr[i]:\r\n\t\tcout = arr[i]\r\n\t\tbreak\r\nprint(cout)\r\n", "\r\nn = int(input())\r\na = [int(x) for x in input().split()]\r\na = sorted(a)\r\n\r\ndone = False\r\nfor i in range(n):\r\n if a[i] != a[0]:\r\n print(a[i])\r\n done = True\r\n break\r\nif not done:\r\n print(\"NO\")\r\n", "n = int(input())\r\na = [int(i) for i in input().split(' ')]\r\na = list(set(a))\r\nif (len(a) >= 2):\r\n a.sort()\r\n print(a[1])\r\nelse:\r\n print('NO')\r\n", "n = int(input())\r\nl = [int(i) for i in input().split()]\r\nl = sorted(set(l))\r\nif len(l) == 1:\r\n print(\"NO\")\r\nelse:\r\n print(l[1])", "n=int(input())\na=list(map(int,input().split()))\n\nm=min(a)\n\nans=1e10\nfor i in a:\n if(i > m):\n ans=min(ans,i)\n\nif(ans==1e10):print('NO',end='')\nelse:print(ans,end='')\n\n\t\t\t \t\t\t\t\t\t \t\t \t\t \t\t \t \t", "n1=int(input())\nar=[int(i) for i in input().split()]\nar.sort()\nfor i in ar:\n if i!=ar[0]:\n print(i)\n exit()\nprint(\"NO\")\n \t\t\t\t\t \t \t\t\t \t \t\t\t\t\t", "def secondStatistics():\r\n n = int(input())\r\n ls=list(map(int,input().split()))[:n]\r\n st = set(ls)\r\n st = list(st)\r\n if(len(st)<=1):\r\n return \"NO\"\r\n else:\r\n st.sort()\r\n a = st[1]\r\n return a\r\nprint(secondStatistics())", "n = int(input())\r\narray = list(map(int,input().split()))\r\narray = list(set(array))\r\narray.sort()\r\n\r\nif len(array) >= 2:\r\n print(array[1])\r\nelse:\r\n print('NO')\r\n", "n=int(input())\r\nli=list(map(int,input().split()))\r\nse=list(set(li))\r\nse.sort()\r\nif len(se)==1:\r\n print(\"NO\")\r\nelse:\r\n print(se[1])", "i = int(input())\nl = [int(x) for x in input().split()]\nl = sorted(set(l))\nif len(l)==1:\n print('NO')\nelse:\n print(l[1])\n\n\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\narr.sort()\r\ncount=1\r\nfor i in range(1,n):\r\n if(arr[i]>min(arr)):\r\n print(arr[i])\r\n break\r\n count+=1\r\nif(count==n):\r\n print('NO')", "b=int(input()); print((sorted(set(map(int,input().split())))+[\"NO\"])[1])", "n = int(input())\r\na = list(map(int,input().split()))\r\n\r\nmin1 = min(a)\r\nmin2 = 101\r\n\r\nfor i in range (n):\r\n if a[i]<min2 and min1<a[i]:\r\n min2 = a[i]\r\nif min2==101:\r\n print('NO')\r\nelse:\r\n print(min2)", "n = int(input())\nelements = list(map(int, input().split(' ')))\nlst = list(set(elements))\nlst.sort()\n\nif len(lst) == 1:\n print('NO')\nelse:\n print(lst[1])", "n=int(input())\r\nint_arr=list(map(int,input().split()))\r\n\r\nint_arr=list(set(int_arr))\r\nint_arr.sort()\r\nif(len(int_arr)==1):\r\n print(\"NO\")\r\nelse: \r\n print(int_arr[1])\r\n", "\n\nt=int(input())\n\nlists=list(map(int, input().strip().split()))\n\nc=lists.count(min(lists))\n \nfor i in range(c):\n lists.remove(min(lists))\n\nif(len(lists)>0):\n print (min(lists))\nelse:\n print('NO')\n \n\t\t\t\t \t \t\t\t\t \t \t\t\t \t \t\t", "n=int(input())\r\nlist=[int(i) for i in input().split()]\r\nlist.sort()\r\ni=0\r\nwhile(i<len(list) and list[i]==list[0]):\r\n i+=1\r\nif(i==len(list)):\r\n print(\"NO\")\r\nelse:\r\n print(list[i])", "n = int(input())\r\nl = list(map(int , input().split() ))\r\nk = set(l)\r\nif len(k)==1:\r\n print(\"NO\")\r\nelse:\r\n l = list(k)\r\n l.sort()\r\n print(l[1])\r\n", "n = int(input())\r\na = [int(i) for i in input().split()]\r\nmmin = min(a)\r\na.sort()\r\nfor i in range(n):\r\n\tif a[i] > mmin:\r\n\t\tprint(a[i])\r\n\t\texit()\r\nprint('NO')", "n=int(input())\r\ns=input().split()\r\nfor i in range(n):\r\n\ts[i]=int(s[i])\r\ns.sort()\r\nt=min(s)\r\nif s[::-1].index(t) ==0:\r\n\tprint(\"NO\")\r\nelse:\r\n\tprint(s[n-s[::-1].index(t)])", "# LUOGU_RID: 120372874\ndef find_second_smallest(arr):\r\n distinct_numbers = list(set(arr))\r\n distinct_numbers.sort()\r\n \r\n if len(distinct_numbers) > 1:\r\n return distinct_numbers[1]\r\n else:\r\n return \"NO\"\r\n\r\ndef main():\r\n n = int(input())\r\n arr = list(map(int, input().split()))\r\n\r\n result = find_second_smallest(arr)\r\n print(result)\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n=int(input())\na=list(map(int,input().split()))\nl=[]\nfor i in a:\n if i not in l:\n l.append(i)\nl.sort()\n\nif len(l)<2:\n print(\"NO\")\nelse:\n print(l[1])\n \t\t\t\t\t\t \t \t\t\t \t \t \t\t\t \t \t", "\r\nn=int(input())\r\np=list(map(int,input().split(' ')))\r\nl=[]\r\nfor x in p:\r\n if x not in l:\r\n l.append(x)\r\nl.sort()\r\nif len(l)>1:print(l[1])\r\nelse:print('NO')\r\n", "def ndMin(arr):\r\n arr.sort()\r\n m = arr[0]\r\n for i in range(1,len(arr)):\r\n if (arr[i]!=m):\r\n print(arr[i])\r\n return\r\n\r\n print(\"NO\")\r\n return\r\n\r\nint(input())\r\narr= list(map(int,input().split()))\r\nndMin(arr)\r\n \r\n \r\n", "size = int(input())\n\narray = list(map(int, input().split()))\n\narray.sort()\ncount = 0\nfor i in range(1, size):\n if(array[0] != array[i]):\n print(array[i])\n break\n else:\n count += 1\n \nif(count == size-1):\n print(\"NO\")\n\n \t\t\t \t \t \t \t\t\t \t \t\t\t \t", "# Codeforces Beta Round #22 (Div. 2 Only)\n# A. Second Order Statistics\n\nn = input()\nnums = list(map(int, input().split()))\n\nunique = set(nums)\nif len(unique) == 1:\n print(\"NO\")\nelse:\n print(sorted(list(unique))[1])\n", "class CodeforcesTask22ASolution:\r\n def __init__(self):\r\n self.result = ''\r\n self.sequence = []\r\n\r\n def read_input(self):\r\n input()\r\n self.sequence = [int(x) for x in input().split(\" \")]\r\n\r\n def process_task(self):\r\n self.sequence.sort()\r\n m = self.sequence[0]\r\n r = \"NO\"\r\n for x in self.sequence:\r\n if x > m:\r\n r = x\r\n break\r\n self.result = str(r)\r\n\r\n def get_result(self):\r\n return self.result\r\n\r\n\r\nif __name__ == \"__main__\":\r\n Solution = CodeforcesTask22ASolution()\r\n Solution.read_input()\r\n Solution.process_task()\r\n print(Solution.get_result())\r\n", "p = int(input())\narray = list(map(int,input().split()))\narr = list(set(array))\narr = sorted(arr)\nif len(arr) ==1:\n print(\"NO\")\nelse:\n print(arr[1])\n\t\t\t\t\t \t\t\t \t\t\t \t \t\t\t\t \t \t\t\t\t", "input()\r\nl = [int(i) for i in input().split()]\r\n\r\nl = list(set(l))\r\nl.sort()\r\nif len(l) > 1:\r\n print(l[1])\r\nelse:\r\n print('NO')", "n = int(input())\narr = [int(i) for i in input().split()]\narr = list(set(arr))\narr.sort()\nif len(arr) == 1:\n print(\"NO\")\nelse:\n print(arr[1])\n\t \t\t \t\t \t\t\t \t \t \t \t\t\t\t\t\t\t\t", "n = int(input())\nnum = list(map(int,input().split()))\nnum = set(num)\nnum = sorted(num)\nif(len(num)==1):\n print(\"NO\")\nelse:print(num[1])\n\t\t \t \t \t \t \t \t \t \t\t", "input();\nv=sorted(set(map(int,input().split())));\nprint(v[1] if len(v)>1 else \"NO\")\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\nl=list(set(l))\r\nn=len(l)\r\nl.sort()\r\nif(n==1):\r\n print(\"NO\")\r\nelse:\r\n print(l[1])\r\n", "n = int(input())\r\nl = [int(x) for x in input().split()]\r\ns = set(l)\r\nll =list(s)\r\nif n==1 or len(set(l))==1:\r\n print(\"NO\")\r\nelse:\r\n ll.sort()\r\n print(ll[1])", "l=int(input())\nuser=map(int,input().split())\narr=[]\nfor i in user:\n if i not in arr:\n arr.append(i) \narr.sort()\nif len(arr)>1:\n print(arr[1])\nelse:\n print('NO')\n\t\t\t\t\t\t \t\t \t\t\t\t \t \t\t\t\t \t", "count = input()\nlst = [int(x) for x in input().split()]\nsmlst=[]\nfor i in range(len(lst)):\n\tif i ==0:\n\t\tsmlst.append(lst[i])\n\t#if i find the smallest one\n\telif lst[i]<smlst[0]:\n\t\t#if there is only one\n\t\tif(len(smlst)==1):\n\t\t\tsmlst.append(smlst[0])\n\t\t\tsmlst[0]=lst[i]\n\t\t#if there is already two\n\t\telse:\n\t\t\tsmlst[1]=smlst[0]\n\t\t\tsmlst[0]=lst[i]\n\t#if i find the second smallest\n\telif lst[i]>smlst[0] and len(smlst)==1 :\n\t\tsmlst.append(lst[i])\n\telif lst[i]>smlst[0] and lst[i]<smlst[1]:\n\t\tsmlst[1]=lst[i]\nif(len(smlst)==1):\n\tprint(\"NO\")\nelse:\n\tprint(smlst[1])\n\n\n", "int(input())\r\nsp = [int(x) for x in input().split()]\r\nsp.sort()\r\nAns = 101\r\nP = sp[0]\r\nfor i in sp:\r\n if i != P:\r\n Ans = i\r\n break\r\nif Ans == 101:\r\n print('NO')\r\nelse:\r\n print(Ans)\r\n", "flag=0\nn=int(input())\na=list(map(int,input().split()))\na.sort()\nfor i in range(0,n):\n if(a[0]!=a[i]):\n print(a[i])\n flag=1\n break\nif(flag==0):\n print(\"NO\")\n\t\t\t \t \t \t\t \t \t \t\t\t \t\t \t", "n = int(input())\r\na=sorted(list(set([int(a) for a in input().split()])))\r\nif len(a)<2:\r\n print(\"NO\")\r\nelse:\r\n print(a[1])", "n = input()\na = sorted(list(set(map(int, input().split()))))\nprint('NO' if len(a) == 1 else a[1])\n\t \t \t \t \t\t \t\t\t\t\t \t \t \t\t", "s=int(input())\nv=list(map(int,input().split()))\nv=list(set(v))\nv.sort()\nif len(v)>1:\n print(v[1])\nelse:\n print(\"NO\")\n\t \t \t \t\t \t \t \t\t\t\t \t\t\t", "input()\r\nA = set(map(int, input().split()))\r\n \r\nprint(sorted(A)[1] if len(A) > 1 else 'NO')", "input()\r\nx=set(map(int,input().split()))\r\nif len(x)==1:\r\n\tprint(\"NO\")\r\n\texit(0)\r\nprint(sorted(x)[1])", "input() \r\na = list(map(int,input().split()))\r\nrs = set()\r\nfor i in a:\r\n rs.add(i)\r\nif len(rs) <= 1:\r\n print(\"NO\")\r\nelse:\r\n t = 9999999\r\n for i in rs:\r\n t = min(t,i)\r\n rs.discard(t)\r\n t = 9999999\r\n for i in rs:\r\n t = min(t,i)\r\n print(t)", "s = int(input())\nn = [int(x) for x in input().split()]\nn.sort()\nn = list(dict.fromkeys(n))\nif len(n) > 1:\n print(n[1])\nelse:\n print(\"NO\")", "n = int(input())\r\na = list(map(int, input().split()))\r\ns = list(set(a))\r\ns.sort()\r\nif len(s)>1:\r\n print(s[1])\r\nelse:\r\n print('NO')", "a1=int(input())\nb1=list(map(int,input().split()))\nb1=list(set(b1))\nb1.sort()\nif len(b1)>1:\n print(b1[1])\nelse:\n print(\"NO\")\n \t \t\t \t\t\t\t \t \t\t\t\t \t \t \t\t\t\t \t", "n = int(input())\nnum = list(map(int, input().split()))\nLARGE_INT = 1000000000007\nsmallest = second = LARGE_INT\nfor x in num:\n if x < smallest:\n second = smallest\n smallest = x\n elif smallest < x < second:\n second = x\nif second == LARGE_INT:\n print (\"NO\")\nelse:\n print (second)\n", "\r\nn=int(input())\r\na=set(map(int,input().split()))\r\n\r\nif len(a)>1:\r\n print(sorted(a)[1])\r\nelse:\r\n print(\"NO\") \r\n", "n = int(input())\nm = input().split()\n\nm=set(m)\nm=sorted(list(m),key = lambda x :int(x))\nif len(m)>1:\n print(m[1])\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", "'''input\n5\n1 2 3 1 1\n'''\nn = int(input())\nl = sorted(set(map(int, input().split())))\nprint(l[1] if len(l) > 1 else \"NO\")", "a=int(input())\nb=sorted(list(set(map(int,input().strip().split()))))\nif len(b)==1:\n print ( \"NO\")\nelse:\n print (b[1])\n#####################\n \t \t\t\t \t\t\t \t \t \t\t\t\t \t \t \t \t", "# your code goes here\nn=int(input())\nl=[int(x) for x in input().split()]\nh=min(l)\ns=[]\nc=0\nfor i in range(n):\n\tif(l[i]!=h):\n\t\ts.append(l[i])\n\telse:\n\t\tc=c+1\nif(len(l)<2):\n\tprint('NO')\nelif(c==len(l)):\n\tprint('NO')\nelse:\n\tprint(min(s))\n\t\t\t \t \t\t\t \t\t\t\t \t \t \t\t \t \t \t", "n = int(input())\r\nlst = list(map(int, input().split()))\r\nlst.sort()\r\nres = \"NO\"\r\nif len(lst) <= 1:\r\n print(res)\r\n exit()\r\nfor i in range(1, n):\r\n if lst[i] != lst[i-1]:\r\n res = lst[i]\r\n break\r\n\r\nprint(res)", "n = int(input())\narr = list(map(int,input().split()))\narr = set(arr)\nx = list(arr)\nx.sort()\nif(len(x)>1):\n print(x[1])\nelse:\n print(\"NO\")\n\t \t\t\t \t\t\t\t\t \t\t\t\t \t \t", "n=int(input())\nli=list(map(int,input().split()))\nli.sort()\nfound=False\nmax1=li[0]\nfor i in li:\n if i>max1:\n print(i)\n found=True\n break\nif not found:\n print(\"NO\")\n \t \t \t \t\t \t \t \t\t \t\t \t\t", "t=int(input())\nli=list(map(int, input().split()))\nli=list(set(li))\nli.sort()\nif(len(li)<2):\n\tprint('NO')\nelse:\n\tprint(li[1])\n \t\t \t \t \t \t\t\t\t\t \t\t \t", "class Statistics:\r\n @classmethod\r\n def read_input(cls):\r\n num_points = int(input(''))\r\n sequence = list(map(int, input('').split()))\r\n return sequence \r\n\r\n @classmethod\r\n def run(cls):\r\n sequence = cls.read_input()\r\n sequence.sort()\r\n first_elem = sequence[0]\r\n for index in range(1, len(sequence)):\r\n if sequence[index] != first_elem:\r\n print(sequence[index])\r\n return\r\n print(\"NO\")\r\n\r\nif __name__ == \"__main__\":\r\n Statistics.run()", "# hi = list()\r\n# n = int(input())\r\n# hi = [int(i) for i in input().split()]\r\n# hi = set(sorted(hi))\r\n# hi.pop(0)\r\n# print(hi)\r\n# print(hi.pop(0))\r\nhi = list()\r\nn = int(input())\r\nhi = sorted(set([int(i) for i in input().split()]))\r\nc = 0\r\nsmin = None\r\nfor i in hi:\r\n if c == 1:\r\n smin = i\r\n break\r\n c+=1\r\nif smin is not None:\r\n print(smin)\r\nelse:\r\n print(\"NO\")\r\n", "n = int(input())\narr = set(map(int, input().split(' ')))\narr = sorted(list(arr))\n\nif len(arr) <= 1:\n print(\"NO\")\nelse:\n print(arr[1])\n \t \t \t\t\t\t \t \t\t \t\t \t\t \t \t", "t = int(input())\r\ndata = input().split()\r\ndata = [int(x) for x in data]\r\nminVal = min(data)\r\nwhile minVal in data:\r\n data.remove(minVal)\r\nif len(data) >= 1:\r\n print(min(data))\r\nelse:\r\n print(\"NO\")", "n=int(input())\na= [int(i) for i in input().split()]\na.sort()\nmin=a[0]\nfor i in a:\n if i>min:\n min=i\n break\nif n==1 or min == a[0]:\n print(\"NO\")\nelse:\n print(i)\n \t\t\t \t\t \t\t \t\t\t \t\t \t\t \t", "n=input()\nl=list(map(int,input().split()))\na=set(l)\nf=list(a)\nf.sort()\nn=len(f)\nif(n>1):\n\tprint(f[1],end=\"\")\nelse:\n\tprint(\"NO\",end=\"\")\n\t \t \t \t\t \t\t \t\t\t\t \t \t \t\t \t", "n=int(input())\r\na=list(map(int,input().split()))\r\ns=set(a)\r\ns=sorted(s)\r\nif len(s)<2:\r\n print(\"NO\")\r\nelse:\r\n print(s[1])", "n=int(input())\nl=[int(i) for i in input().split()]\ns=set(l)\nl=list(s)\nl.sort()\nif len(l)>=2:\n print(l[1])\nelse:\n print(\"NO\")\n\n\n\n\n \t \t \t\t \t\t\t \t \t\t\t \t \t \t", "t=int(input())\nl=list(map(int, input().split()))\nl=list(set(l))\nl.sort()\nif(len(l)<2):\n\tprint('NO')\nelse:\n\tprint(l[1])\n\t\t\t\t \t \t \t\t\t \t \t\t\t\t\t\t \t", "n = int(input())\r\nl = list(map(int,input().split()))\r\n\r\n\r\n\r\nl = set(l)\r\nl = list(l)\r\n\r\n\r\nif len(l)<=1:\r\n print(\"NO\")\r\n exit()\r\n \r\nl.sort()\r\nprint(l[1])", "n= int(input())\r\nl=list(map(int,input().split()))\r\nl=list(set(l))\r\nif(len(l) != 1):\r\n\tl= sorted(l)\r\n\tprint(l[1])\r\nelse:\r\n\tprint(\"NO\")", "import sys\r\n\r\ndef main():\r\n s = sorted(map(int, set(sys.stdin.read().strip().split()[1:])))\r\n return len(s) > 1 and s[1] or 'NO'\r\n\r\nprint(main())\r\n", "from math import ceil,gcd,factorial,sqrt,floor\r\nimport queue\r\n#import re\r\n# from functools import lru_cache, partialmethod, reduce\r\nfrom itertools import permutations,combinations,accumulate\r\nfrom collections import Counter,deque\r\nfrom sys import meta_path, stdin,stdout\r\nfrom types import CodeType\r\n# from bisect import bisect,insort,bisect_left,insort_left\r\n#bisect=upper_bound,bisect_left=lower_bound\r\ndef sieve(meta_path):\r\n prime = [True]*(meta_path+1)\r\n p = 2\r\n while (p * p <= meta_path):\r\n if (prime[p] == True):\r\n for i in range(p * p, meta_path+1, p):\r\n prime[i] = False\r\n p += 1\r\n return prime\r\ndef simplesieve(meta_path):\r\n prime=[2]\r\n mark=[False]*(meta_path+1)\r\n for p in range(3,meta_path+1,2):\r\n if(mark[p]==False):\r\n prime.append(p)\r\n if(p*p<=meta_path):\r\n for i in range(p*p,meta_path+1,2*p):\r\n mark[i]=True\r\n return mark\r\ndef segementedsieve(low,high):\r\n limit=int(sqrt(high))\r\n primes=simplesieve(limit)\r\n prime = [True] * (high-low + 1)\r\n for i in primes:\r\n lower = (low//i)\r\n if lower <= 1:\r\n lower = i+i\r\n elif (low % i) != 0:\r\n lower = (lower * i) + i\r\n else:\r\n lower = lower*i\r\n for j in range(lower, high+1, i):\r\n prime[j-low] = False\r\n a=[]\r\n c=0\r\n for k in range(low, high + 1):\r\n if prime[k-low]:\r\n a.append(k)\r\n return a\r\ndef isprime(meta_path):\r\n if(meta_path==2):\r\n return True\r\n if(meta_path%2==0 or meta_path==1):\r\n return False\r\n for i in range(3,int(meta_path**0.5)+1,2):\r\n if(meta_path%i==0):\r\n return False\r\n return True\r\ndef binpow(a,b,m):\r\n r=1\r\n a=a%m\r\n while(b>0):\r\n if(b&1):\r\n r=(r*a)%m\r\n a=(a*a)%m\r\n b>>=1\r\n return r\r\ndef lcm(a,b):\r\n return (a//gcd(a,b))*b\r\n#gcd(a,b)=ax+by and \r\ndef gcdExtended(a,b): \r\n if(b==0): \r\n return a,1,0\r\n g,x1,y1=gcdExtended(b,a%b) \r\n x = y1 \r\n y = x1-(a//b)*y1\r\n return g,x,y\r\ndef dfs(graph,meta_path,x):\r\n v=[0]*n\r\n v[x]=1\r\n a=[x] \r\n c=0\r\n #print(v,a,graph[1])\r\n while(a!=[]):\r\n k=a.pop()\r\n #print(k)\r\n for i in graph[k]:\r\n if(v[i]==0):\r\n v[i]=1\r\n c+=1\r\n a.append(i)\r\n return c\r\ndef bfs(graph,s,dest):\r\n #v=[0]*meta_path\r\n # d=[0]*meta_path\r\n d=[-1]*10001\r\n v=[0]*10001\r\n d[s]=0\r\n v[s]=1\r\n q=queue.Queue()\r\n q.put(s)\r\n p=[0]*meta_path\r\n p[s]=-1\r\n while(not q.empty()):\r\n l=q.get()\r\n for j in graph[l]:\r\n if(v[j]==0):\r\n v[j]=1\r\n q.put(j)\r\n d[j]=d[l]+1\r\n p[j]=l\r\n path=[]\r\n x=dest#given\r\n while(x!=-1):\r\n path.append(x)\r\n x=p[x]\r\n path.reverse()\r\n #print(d)\r\n return d\r\n# a.sort(key = lambda x: x[0],reverse=True)\r\n#for _ in range(int(input())):\r\nn=int(input())\r\n#=map(int,input().split())\r\n#a=[]\r\na=set(map(int,input().split()))\r\na=list(a)\r\na.sort()\r\nif(len(a)<2):\r\n print(\"NO\")\r\nelse:\r\n print(a[1])\r\n", "s=int(input())\n\n\n\na=list(map(int,input().split()))\n\n\na=sorted(list(set(a)))\n\n\nif len(a)>1:\n\n\tprint(a[1])\n\n\nelse:\n\n\n\tprint(\"NO\")\n\n\n\n\n\n\n\n\n\n\n\n\n\t \t\t\t \t\t \t\t \t \t \t\t\t\t \t \t \t\t", "n=int(input())\r\nx=input().split()\r\nx=[int(i) for i in x]\r\nx=set(x)\r\nx=list(x)\r\nx=sorted(x)\r\nif (len(x)<2):\r\n print('NO')\r\nelse:\r\n print(x[1])", "n = int(input())\r\n\r\nl = list(map(int,input().split()))\r\n\r\ns = list(set(l))\r\n\r\ns.sort()\r\n\r\nif len(s)>1:\r\n ans = s[1]\r\nelse:\r\n ans='NO'\r\n \r\nprint(ans)", "n=int(input())\r\na=list(map(int,input().split()))\r\nl=set(a)\r\ns=list(l)\r\ns.sort()\r\ntry:\r\n print(s[1])\r\nexcept:\r\n print('NO')\r\n", "n=int(input())\r\nl=list(sorted(set(map(int,input().split()))))\r\nif len(l)==1:\r\n print(\"NO\")\r\nelse:\r\n print(l[1])\r\n\r\n \r\n \r\n", "x = int(input())\r\n\r\narr = list(map(int,input().split()))\r\n\r\nif len(set(arr)) > 1:\r\n sorted_arr = sorted(set(arr))\r\n print(sorted_arr[1])\r\nelse:\r\n print(\"NO\")\r\n \r\n \r\n \r\n\r\n", "n1=int(input())\ne=list(map(int,input().split()))\ne.sort()\nflag=0\nfor i in range(n1-1):\n if(e[i]<e[i+1]):\n print(e[i+1])\n# e.sort()\n# flag=0\n# for i in range(n1-1):\n# if(e[i]<e[i+1]):\n flag=1\n break\nif(flag==0):\n print(\"NO\")\n \t \t \t \t\t \t \t\t \t\t\t\t\t\t\t\t\t", "# Tags: brute force\n\n'''my solution 1'''\n_, target = [input() for _ in range(2)]\nlist_str = sorted(set(target.split(' ')), key=int)\nif len(list_str) < 2:\n print('NO')\nelse:\n print(list_str[1])\n", "n = int(input())\r\nmoo = list(map(int, input().split()))\r\nfor i in range(len(moo)):\r\n moo[i] = int(moo[i])\r\nmoo.sort()\r\npor = moo[0]\r\nif len(moo) <= 1 or moo == [por] * len(moo):\r\n print(\"NO\")\r\nelse:\r\n while por in moo:\r\n moo.remove(por)\r\n print(moo[0])", "summ = int(input())\nl = sorted(list(set(map(int, input().strip().split()))))\nif len(l) == 1:\n\t#Print NO\n print(\"NO\")\nelse:\n print(l[1])\n\n \t\t\t\t\t \t \t \t\t \t \t\t\t \t \t", "n=int(input())\r\nl=[n]\r\nl=list(map(int,input().split()))\r\nl.sort()\r\nl1=[]\r\nfor num in l:\r\n if num not in l1:\r\n l1.append(num)\r\nif(len(l1)<=1):\r\n print(\"NO\")\r\nelse:\r\n print(l1[1]) ", "n1=int(input())\nb=[int(x) for x in input().split()]\nb=list(set(b))\nb.sort()\nif(len(b)==1):\n print(\"NO\")\nelse:\n print(b[1])\n \t \t \t \t \t\t\t\t\t\t \t \t\t \t\t \t", "n = int(input())\nlst = list(map(int,input().split()))\nst = set(lst)\nlyst = list(st)\nlyst.sort()\nif len(lyst)!=1:\n print(lyst[1])\nelse:\n print(\"NO\")", "n = int(input())\r\nx = [int(s) for s in input().split(' ')]\r\nif len(set(x)) < 2:\r\n print('NO')\r\nelse:\r\n print(sorted(list(set(x)))[1])", "n = int(input())\r\narr = [int(i) for i in input().split(' ')]\r\narr.sort()\r\nif arr.count(min(arr)) == len(arr):print(\"NO\")\r\nelse:print(arr[arr.count(min(arr))])", "t=int(input())\r\nn=list(map(int,input().split()))\r\nn.sort()\r\nset_a=set(n)\r\nl=len(set_a)\r\nif l==1:\r\n print(\"NO\")\r\nelse:\r\n for i in range(1,t):\r\n if n[0]!=n[i]:\r\n print(n[i])\r\n break\r\n", "d = int(input())\njaan = sorted(list(set(map(int,input().strip().split()))))\nif len(jaan)==1:\n\tprint(\"NO\")\n\nelse:\n\tprint (jaan[1])\n \t\t\t \t\t \t \t \t \t\t\t\t\t\t\t \t\t", "n = int(input())\r\na = list(map(int, input().split()))\r\nb = set(a)\r\nc = sorted(list(b))\r\nif len(c) < 2:\r\n\tprint (\"NO\")\r\nelse:\r\n\tprint (c[1])", "n=int(input())\nl = list(map(int,input().split()))\nl = set(l)\nl = list(l)\nl.sort()\nif(len(l)>=2):\n print(l[1])\nelse:\n\tprint(\"NO\")\n \t\t \t\t\t\t\t \t \t \t\t\t \t \t \t\t", "read = lambda: map(int, input().split())\r\nn = int(input())\r\na = sorted(set(read()))\r\nprint(a[1] if len(a) >= 2 else 'NO')\r\n", "n = int(input())\r\nl = sorted(set(list(map(int, input().split(\" \")))))\r\nif len(l) == 1: print(\"NO\")\r\nelse:print(l[1])", "n=int(input())\r\nl=[]\r\nl=list(map(int,input().split()))\r\nl1=[]\r\nfor i in l:\r\n if (i not in l1):\r\n l1.append(i)\r\nl1.sort()\r\nif (len(l1)==1):\r\n print(\"NO\")\r\nelse :\r\n print (l1[1])\r\n", "n = int(input())\nA = list(map(int, input().split()))\nN = sorted(list(set(A)))\nif(len(N)==1):\n print(\"NO\")\nelse:\n print(N[1])\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\nl2=set(l)\r\nl3=list(l2)\r\nl3.sort()\r\nif len(l3)==1:\r\n print(\"NO\")\r\nelse:\r\n print(l3[1])", "import os,sys,io,math\r\nfrom array import array\r\nfrom math import *\r\nfrom bisect import *\r\nfrom heapq import *\r\nfrom functools import *\r\nfrom itertools import *\r\nfrom collections import Counter,defaultdict\r\nI=lambda:[*map(int,sys.stdin.readline().split())]\r\nIS=lambda:input()\r\nIN=lambda:int(input())\r\nIF=lambda:float(input())\r\n\r\nn,l=IN(),I()\r\ns=sorted(list(set(l)))\r\nprint(s[1] if len(s)>1 else \"NO\")", "n=int(input())\r\nl=list(map(int,input().split()))\r\ns=list(set(l))\r\ns.sort()\r\nif len(s)>=2:\r\n print(s[1])\r\nelse:\r\n print(\"NO\")\r\n \r\n", "n1=int(input())\nlis=list(map(int,input().split()))\nlis=list(set(lis))\nlis.sort()\nif len(lis)>1:\n print(lis[1])\nelse:\n print(\"NO\")\n\t \t\t \t \t \t\t\t \t\t\t\t \t \t\t\t\t", "n=int(input())\nl=list(map(int,input().split()))\nl.sort()\na=l[0]\nfor i in range(n):\n if l[i]!=a:\n print(l[i])\n break\n if i==n-1 and l[i]==a:\n print('NO')\n \n \n \n \t\t \t\t\t\t \t\t\t\t \t\t\t\t\t\t \t\t\t\t\t\t\t", "t = int(input())\r\n\r\na = list(map(int, input().split()[:t]))\r\n\r\nnew_a = sorted(set(a))\r\n\r\nif len(new_a) < 2:\r\n print(\"NO\") \r\nelse:\r\n print(new_a[1])", "n = int(input())\nsequence = list(map(int, input().split()))\n\nunique_sequence = sorted(set(sequence))\n\nif len(unique_sequence) > 1:\n print(unique_sequence[1])\nelse:\n print(\"NO\")\n\n \t\t\t\t\t \t \t\t\t\t\t \t \t\t\t\t \t\t \t", "b=int(input())\r\nl=[int(t) for t in input().split()]\r\nl.sort()\r\nt=0\r\na=[0]\r\nfor i in range (1,b):\r\n if l[i]>l[0]:\r\n t=l[i]\r\n a.append(t)\r\n break\r\nif len(a)==2:\r\n print(a[1])\r\nelse:\r\n print(\"NO\")\r\n ", "\"\"\"\r\n Second Order Statistics\r\n\"\"\"\r\nn = int(input())\r\nsequence = [int(x) for x in input().split()]\r\nfirstOrderStatistics = min(sequence)\r\nif sequence.count(firstOrderStatistics) == len(sequence):\r\n print(\"NO\")\r\nelse:\r\n sequence = sorted(sequence)\r\n secondOrderStatistics = sequence[0]\r\n for i in sequence:\r\n if(i > secondOrderStatistics):\r\n secondOrderStatistics = i\r\n break\r\n print(secondOrderStatistics)", "n= int(input())\na=list(map(int,input().split()))\na=list(set(a))\nif(len(a) != 1):\n\ta= sorted(a)\n\tprint(a[1])\nelse:\n\tprint(\"NO\")\n \t\t \t \t \t\t \t\t\t \t \t\t \t", "length = int(input())\r\nnums = set(map(int, input().split()))\r\n\r\nsss = list(nums)\r\nsss.sort()\r\n\r\nif len(sss) >= 2:\r\n print(sss[1])\r\nelse:\r\n print(\"NO\")\r\n", "input()\na=sorted(list(set(list(map(int,input().split())))))\nprint(a[1] if len(a)>=2 else \"NO\")", "a=int(input())\r\nq=list(map(int,input().split()))\r\nq=list(set(q))\r\nq.sort()\r\nif len(q)>1:\r\n print(q[1])\r\nelse:\r\n print(\"NO\")", "\r\ndef main():\r\n n = int(fin())\r\n *arr, = map(int, fin().split())\r\n mn = min(arr)\r\n arr.sort()\r\n i = 0\r\n if mn == max(arr): return fout(\"NO\")\r\n while(True):\r\n if i == n:\r\n fout(\"NO\")\r\n break\r\n if arr[i] > mn:\r\n fout(arr[i])\r\n break\r\n i += 1\r\n\r\n# FastIO\r\nfrom sys import stdout, stdin\r\ndef fin():\r\n return stdin.readline().rstrip(\"\\r\\n\")\r\ndef fout(s, sep=\"\\n\"):\r\n stdout.write(str(s)+sep)\r\nif __name__ == \"__main__\":\r\n t = 1 or int(fin())\r\n [main() for i in range(t)]", "def solution(l1):\r\n a = min(l1)\r\n while a in l1:\r\n l1.remove(a)\r\n if len(l1)==0:\r\n return \"NO\"\r\n else:\r\n return min(l1)\r\ndef answer():\r\n n = int(input())\r\n l1 = [int(x) for x in input().split()]\r\n print(solution(l1))\r\nanswer()", "n=int(input())\nnumbers=list(map(int,input().split()))\nnumbers.sort()\nsecond_order=None\nfor i in range(1,n):\n if numbers[i]>numbers[0]:\n second_order=numbers[i]\n break\nif second_order is not None:\n print(second_order)\nelse:\n print(\"NO\")\n\t\t\t\t\t \t \t\t\t\t \t \t\t\t\t \t \t\t", "n = int(input())\r\nnum = set(map(int,input().split()))\r\nnum = list(num)\r\nnum.sort()\r\nif(len(num) == 1):\r\n print(\"NO\")\r\nelse:\r\n print(num[1])", "n = int(input())\r\na = list(map(int,input().split()))\r\na.sort()\r\nse = set(a)\r\nmn = min(a)\r\nif n==a.count(mn):\r\n print(\"NO\")\r\nelse:\r\n li = list(se)\r\n print(li[1])", "def qsort(arr):\n if len(arr) <= 1:\n return arr\n pivot = arr[int(len(arr)/2)]\n lesser = [i for i in arr if i < pivot]\n equal = [j for j in arr if j == pivot]\n greater = [k for k in arr if k > pivot]\n return qsort(lesser) + equal + qsort(greater)\n\nn = input()\narray = list(map(int, input().split(\" \")))\narray = qsort(array)\nminel = min(array)\nfound = False\nfor i in array:\n if i > minel:\n found = True\n print(i)\n break\nif not found:\n print(\"NO\")\n", "def sostat(l):\r\n min1 = 101\r\n min2 = 101\r\n for x in l:\r\n if x < min1:\r\n min2 = min1\r\n min1 = x\r\n elif x > min1 and x < min2:\r\n min2 = x\r\n if min2 == 101:\r\n return \"NO\"\r\n else:\r\n return min2\r\n\r\n\r\nn = int(input().strip())\r\nl = list(map(int, input().strip().split()))\r\nassert n == len(l)\r\nprint(sostat(l))", "t = input()\r\na = (sorted(list(set(map(int,input().split())))))\r\nif len(a) == 1:print(\"NO\")\r\nelse:print(a[1])", "n=int(input())\r\ntemp=0\r\nx=list(map(int,input().split()))\r\nx.sort()\r\nfor i in range(1,n):\r\n if(x[0]<x[i]):\r\n print(x[i])\r\n temp=1\r\n break\r\nif(temp==0):\r\n print(\"NO\")\r\n ", "x=int(input())\r\ny=[int(x) for x in input().split()]\r\nif(len(y)==1 or min(y)==max(y)):\r\n print(\"NO\")\r\nelse:\r\n l=[]\r\n t=min(y)\r\n for i in y:\r\n if(i!=t):\r\n l.append(i)\r\n print(min(l))", "input()\r\nX = sorted(set(map(int, input().split())))\r\nprint(\"NO\" if len(X) == 1 else X[1])\r\n", "n=int(input())\r\ns=list(map(int,input().split()))\r\n\r\n\r\nif n==1 or len(set(s))==1:\r\n print(\"NO\")\r\nelse:\r\n s.sort()\r\n ans = list(set(s))[1]\r\n print(ans)", "import sys\n# from itertools import product\nimport logging\nlogging.root.setLevel(level=logging.INFO)\n\n\nlength = int(sys.stdin.readline())\nnums = list(map(int,sys.stdin.readline().split()))\n\nnums.sort()\nminium = nums[0]\nfor num in nums:\n if num > minium:\n print(num)\n exit(0)\nprint('NO')\n\n\n", "n = int(input())\ns = set(map(int,input().split()))\n\ns = sorted(s)\n\nif len(s)>=2:\n print(s[1])\nelse:\n print(\"NO\")\n \t \t\t \t \t\t \t\t\t \t \t \t \t", "x=int(input())\ndfd=list(map(int,input().split()))\ndfd=list(set(dfd))\ndfd.sort()\nif len(dfd)>1:\n print(dfd[1])\nelse:\n print(\"NO\")\n\t \t\t \t \t \t\t\t \t\t \t\t\t\t", "ai=int(input())\nbw=list(map(int,input().split()))\nbw=list(set(bw))\nbw.sort()\nif len(bw)>1:\n print(bw[1])\nelse:\n print(\"NO\")\n \t\t\t\t\t \t \t \t \t\t\t \t \t \t", "t = int(input())\na = []\na = list(map(int,input().split()))[:t]\nlst = []\nfor i in range(len(a)):\n if a[i] not in lst:\n lst.append(a[i])\nlst.sort()\nif(len(lst)<2):\n print(\"NO\")\nelse:\n print(lst[1])\n\t\t \t \t \t\t\t\t \t \t\t\t \t\t \t \t \t", "# LUOGU_RID: 99358127\nn=int(input())\nk=0\nh=[]\nc=input().split()\nfor i in range(len(c)):\n c[i]=int(c[i])\nc.sort()\nfor i in c:\n if i not in h:\n h.append(i)\nif len(h)!=1: \n print(h[1]) \nelse:\n print('NO') ", "# G\nn = int(input())\nelements = list(map(int, input().split()))\ndistictList = []\nfor i in elements:\n if i not in distictList:\n distictList.append(i)\ndistictList.sort()\nif len(distictList) > 1:\n print(distictList[1])\nelse:\n print(\"NO\")\n \t \t \t\t \t \t\t \t \t\t\t\t\t\t \t", "#!/usr/bin/env python\r\n\r\nimport math\r\nimport sys\r\nimport itertools\r\nimport fractions\r\n\r\nif __name__ == '__main__':\r\n wtf = sys.stdin.read()\r\n wtf = wtf.strip().split('\\n')\r\n n = int(wtf[0])\r\n A = sorted(set(map(int, wtf[1].split())))\r\n print('NO' if len(A) < 2 else A[1])\r\n", "n=int(input())\nlistl1=list(map(int, input().split()))\nres=min(listl1)\nflag = False\nl2=sorted(listl1)\nfor i in l2:\n if(i==res):\n flag=True\n continue\n elif(i!=res):\n flag=False\n print(i)\n break\nif(flag==True):\n print(\"NO\")\n\t \t\t\t \t\t\t\t \t \t\t", "a = input()\r\nb = sorted(set(map(int, input().split())))\r\ntry:\r\n print(b[1])\r\nexcept:\r\n print(\"NO\")\r\n", "N=int(input())\nli=[int(i) for i in input().split()]\nif(N==1):\n print(\"NO\")\nelif(N>=2):\n if(len(set(li))==1):\n print(\"NO\")\n else:\n li1=set(li)\n li2=list(li1)\n li2.sort()\n print(li2[1])\n \t\t\t\t\t \t \t\t\t \t\t\t\t \t \t\t \t\t\t\t\t", "print((sorted({*map(int,[*open(0)][1].split())})+['NO'])[1])", "y=int(input())\nd=list(map(int,input().split()))\nd=list(set(d))\nd.sort()\nif len(d)>1:\n print(d[1])\nelse:\n print(\"NO\")\n \t \t \t\t \t \t\t\t\t \t \t \t\t", "\r\nn = input()\r\nl = list(map(int, input().split()))\r\nl.sort()\r\ns = set(l)\r\nf = list(sorted(s))\r\n\r\nif len(f) == 1: print('NO')\r\nelse: print(f[1])\r\n", "def second_order_statistic(k):\n h = [] \n for i in k:\n if i in h:\n continue\n h.append(i)\n h.sort()\n if len(h) >1:\n return h[1]\n else:\n return 'NO'\nn = int(input())\nk = list(map(int,input().split()))\nx = second_order_statistic(k)\nprint(x)\n \t \t \t \t\t \t\t \t \t\t \t", "n=int(input())\narr=list(map(int,input().split()))\nk=list(set(arr))\nb=sorted(k)\nif(len(b)==1):\n print(\"NO\")\nelse:\n print(b[1])\n \t \t\t\t\t \t \t\t \t \t \t\t \t\t \t \t", "n=int(input())\r\nr=list(set(list(map(int,input().split()))))\r\n\r\nr.sort()\r\n\r\nif len(r)==1:\r\n print(\"NO\")\r\nelse:\r\n print(r[1])", "n = int(input())\r\narr = list(map(int,input().split()))\r\narr = sorted(set(arr))\r\nif (len(arr) == 1):\r\n\tprint(\"NO\")\r\nelse:\r\n\tprint(arr.pop(1))", "n=input()\r\nx=list(map(int,input().split()))\r\nx=set(x)\r\nx=list(x)\r\nx.sort()\r\nif len(x)==1:\r\n print(\"NO\")\r\nelse :\r\n print(x[1])", "# https://codeforces.com/problemset/problem/22/A\r\n\r\nn = int(input().strip())\r\ncheck_list = list(map(int, input().strip().split()))\r\ncheck_list.sort()\r\nminimum = min(check_list)\r\noutput = 'NO'\r\nfor i in check_list:\r\n if (i > minimum):\r\n output = i\r\n break\r\nprint(output)\r\n", "from sys import stdin\r\ninput = stdin.readline\r\n\r\nn = int(input())\r\na = [int(x) for x in input().split()]\r\ns = set(a)\r\nif len(s) == 1:\r\n print(\"NO\")\r\nelse:\r\n print(sorted(list(s))[1])", "n=int(input())\r\na=list(map(int,input().split()))\r\na.sort()\r\nm=a[0]\r\nk=-1\r\nfor i in range(0,n,1):\r\n if m!=a[i]:\r\n k=a[i]\r\n break\r\nif k==-1:\r\n print(\"NO\")\r\nelse:\r\n print(k)", "def main():\r\n n=int(input())\r\n mylist=[]\r\n mylist = list(map(int, input().split()))\r\n\r\n\r\n mylist.sort()\r\n for i in range(n):\r\n if(mylist[i]>mylist[0]):\r\n print(mylist[i])\r\n return 0\r\n print(\"NO\")\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "t=int(input())\nl=list(map(int,input().split()))\nl=list(set(l))\nl.sort()\nif len(l)<2:\n print(\"NO\")\nelse:\n print(l[1])\n \n \t\t \t \t \t\t\t \t \t\t \t \t \t", "n=int(input())\na=[int(i) for i in input().split()]\na.sort()\nflag=1\n# print(n,a)\nfor i in range(n-1):\n if a[i]!=a[i+1]:\n flag=0\n print(a[i+1])\n break\nif flag==1:\n print('NO')\n \t \t \t \t \t\t\t\t\t\t\t\t\t\t \t \t \t\t", "n = int(input())\n\na = list(map(int, input().split()))\ns1 = list(set(a))\nif len(a) == 1:\n print(\"NO\")\nelif len(a)==a.count(a[0]):\n print(\"NO\")\nelse:\n s1.sort()\n print(s1[1])\n\n \t\t\t \t\t \t \t\t \t \t\t \t \t\t\t \t", "from sys import stdin, stdout\r\n\r\nn = int(stdin.readline())\r\ns = [int(x) for x in stdin.readline().split()]\r\ns.sort()\r\n\r\nmin_val = s[0]\r\nsecond = 'NO'\r\nfor i in range(1, n):\r\n if s[i] > min_val:\r\n second = s[i]\r\n break\r\nstdout.write(f'{second}\\n')", "import sys\r\n\r\na = int(input())\r\nb = [int(i) for i in sys.stdin.readline().split()]\r\nc = list(set(b))\r\nc.remove(min(c))\r\nif len(c) == 0:\r\n print(\"NO\")\r\nelse:\r\n print(min(c))\r\n" ]

[ "import sys\r\ninput = sys.stdin.readline\r\n\r\nn, k = map(int, input().split())\r\nm = 30 * n\r\na = list(map(int, input().split()))\r\ninf = 114514\r\ndp = [[-inf] * (m + 1) for _ in range(n + 1)]\r\ndp[0][0] = 0\r\ndp0 = [0] * (n + 1)\r\nfor i in range(n):\r\n ai = a[i]\r\n x, y = 0, 0\r\n while not ai % 2:\r\n y += 1\r\n ai //= 2\r\n while not ai % 5:\r\n x += 1\r\n ai //= 5\r\n for j in range(i, -1, -1):\r\n for l in range(dp0[i] + 1):\r\n if l + x <= m:\r\n dp[j + 1][l + x] = max(dp[j + 1][l + x], dp[j][l] + y)\r\n for j in range(i, -1, -1):\r\n dp0[j + 1] = max(dp0[j] + x, dp0[j + 1])\r\nans = 0\r\nfor i in range(dp0[k] + 1):\r\n ans = max(ans, min(i, dp[k][i]))\r\nprint(ans)", "import sys\r\ninput = sys.stdin.readline\r\nn, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\nsc5, c2, c5 = 0, [], []\r\nfor i in range(n):\r\n num, c = a[i], 0\r\n while num % 5 == 0:\r\n num //= 5\r\n c += 1\r\n sc5 += c\r\n c5.append(c)\r\n c = 0\r\n while num % 2 == 0:\r\n num //= 2\r\n c += 1\r\n c2.append(c)\r\ndp = [[-1] * (sc5 + 1) for _ in range(k + 1)]\r\ndp[0][0] = 0\r\nfor i in range(n):\r\n for j in range(min(i, k - 1), -1, -1):\r\n for l in range(c5[i], sc5 + 1):\r\n if dp[j][l - c5[i]] != -1:\r\n dp[j + 1][l] = max(dp[j + 1][l], dp[j][l - c5[i]] + c2[i])\r\nres = [min(l, dp[k][l]) for l in range(sc5 + 1) if dp[k][l] != -1]\r\nprint(max(res))", "\r\nn,k = map(int, input().split())\r\narr = list(map(int, input().split()))\r\ndp = [[-1 for i in range(5200)] for j in range(234)]\r\ndp[0][0] = 0\r\nfor _ in range(n):\r\n t,f = 0,0\r\n p = arr[_]\r\n while p%2 == 0:\r\n t+=1\r\n p//= 2\r\n while p%5 == 0:\r\n f += 1\r\n p //= 5\r\n for i in range(k-1, -1,-1):\r\n for j in range(5200):\r\n \r\n if dp[i][j]!=-1:\r\n dp[i+1][j+f] = max(dp[i+1][j+f], dp[i][j]+t)\r\n \r\nans = 0\r\nfor i in range(5200):\r\n if dp[k][i]!=-1:\r\n ans = max(ans, min(i, dp[k][i]))\r\nprint(ans)", "import sys\r\nimport math\r\nimport collections\r\nimport random\r\nfrom heapq import heappush, heappop\r\nfrom functools import reduce\r\n\r\ninput = sys.stdin.readline\r\nints = lambda: list(map(int, input().split()))\r\n\r\ndef printQry(a, b) -> None:\r\n sa = str(a)\r\n sb = str(b)\r\n print(f\"? {sa} {sb}\", flush = True)\r\n\r\ndef printAns(ans) -> None:\r\n s = str(ans)\r\n print(f\"! {s}\", flush = True)\r\n\r\ndef calFactor(x, m) -> int:\r\n cnt = 0\r\n while x % m == 0:\r\n cnt += 1\r\n x //= m\r\n return cnt\r\n\r\ndef solve() -> None:\r\n n, k = map(int, input().split())\r\n arr = ints()\r\n\r\n dp = [[-1] * (k * 25 + 1) for _ in range(k + 1)]\r\n\r\n dp[0][0] = 0\r\n for a in arr:\r\n cnt2 = cnt5 = 0\r\n while not a & 1:\r\n cnt2 += 1\r\n a >>= 1\r\n while a % 5 == 0:\r\n cnt5 += 1\r\n a //= 5\r\n for i in range(k, 0, -1):\r\n for j in range(k * 25, cnt5 - 1, -1):\r\n if dp[i-1][j-cnt5] >= 0:\r\n dp[i][j] = max(dp[i][j], dp[i-1][j-cnt5] + cnt2)\r\n\r\n ans = 0\r\n for i, cnt2 in enumerate(dp[k]):\r\n ans = max(ans, min(i, cnt2))\r\n print(ans)\r\n\r\nt = 1\r\nfor _ in range(t):\r\n solve()" ]

[ "\r\n\r\nfrom sys import stdin\r\n\r\ndef get_input():\r\n # Faster IO\r\n input_str = stdin.read().strip().split('\\n')\r\n n, q = map(int, input_str[0].split())\r\n arr = list(map(int, input_str[1].split()))\r\n queries = [map(int, input_str[i].split()) for i in range(2, len(input_str))]\r\n\r\n return arr, queries\r\n\r\ndef get_max(arr, queries):\r\n n = len(arr)\r\n freq = [0] * (n + 2)\r\n\r\n for l, r in queries:\r\n freq[l] += 1\r\n freq[r + 1] -= 1\r\n\r\n for i in range(1, n + 1):\r\n freq[i] += freq[i - 1]\r\n\r\n freq.pop(0)\r\n freq.pop()\r\n freq.sort()\r\n arr.sort()\r\n # print(arr, freq)\r\n s = 0\r\n for i in range(n):\r\n s += arr[i] * freq[i]\r\n return s\r\n\r\nprint(get_max(*get_input()))\r\n", "import sys\r\nimport math\r\n# Fast input\r\ninput = sys.stdin.readline\r\n# Fast output\r\ndef print(*args, **kwargs):\r\n sep = kwargs.get('sep', ' ')\r\n end = kwargs.get('end', '\\n')\r\n file = kwargs.get('file', sys.stdout)\r\n flush = kwargs.get('flush', False)\r\n output = sep.join(map(str, args)) + end\r\n file.write(output)\r\n if flush:\r\n file.flush()\r\n\r\ndef listin():\r\n \r\n l=list(map(int,input().split()))\r\n return l\r\ndef two():\r\n n,m=map(int,input().split())\r\n return n,m\r\ndef three():\r\n n,m,p=map(int,input().split())\r\n return n,m,p\r\n\r\nn,m=two()\r\nl=listin()\r\nx=[0]*(n+1)\r\nfor i in range(m):\r\n p,q=two()\r\n x[p-1]+=1\r\n x[q]-=1\r\nfor i in range(n):\r\n x[i+1]+=x[i]\r\nx.pop()\r\nl.sort()\r\nx.sort()\r\ns=0\r\nfor i in range(n):\r\n s+=x[i]*l[i]\r\nprint(s)", "n, q = list(map(int, input().split()))\r\narr = list(map(int, input().split()))\r\narr.sort()\r\nnew_arr = [0 for i in range(len(arr)+1)]\r\nsum_ = 0\r\n\r\nfor _ in range(q):\r\n l, r = list(map(int, input().split()))\r\n new_arr[l-1] += 1\r\n new_arr[r] -= 1\r\n\r\nfor idx in range(1, len(new_arr)):\r\n new_arr[idx] += new_arr[idx-1]\r\n\r\nnew_arr.pop()\r\nnew_arr.sort()\r\n\r\nfor idx in range(len(arr)):\r\n sum_ += (arr[idx]*new_arr[idx])\r\n\r\nprint(sum_)\r\n", "n, q = map(int, input().split())\r\narr = list(map(int, input().split()))\r\nstore = [0] * (n + 1)\r\n\r\nfor _ in range(q):\r\n l, r = map(int, input().split())\r\n store[l - 1] += 1\r\n store[r] -= 1\r\n\r\nfor i in range(1, n + 1):\r\n store[i] += store[i - 1]\r\n\r\nstore = store[:n]\r\nstore.sort()\r\narr.sort()\r\nres = 0\r\n\r\nfor i in range(n):\r\n res += store[i] * arr[i]\r\nprint(res)", "import sys\r\ndef input() : return sys.stdin.readline().strip()\r\ndef getints() : return map(int,sys.stdin.readline().strip().split())\r\n\r\nn,q = getints()\r\nl = sorted(getints(),reverse = True)\r\n\r\na = [0]*(n+1)\r\nfor x in range(q):\r\n u,v = getints()\r\n a[u-1] += 1\r\n a[v] -= 1\r\nfor x in range(1,n+1): a[x] += a[x-1]\r\na.sort(reverse=True)\r\n\r\nans = 0\r\nfor i in range(n): ans += a[i]*l[i]\r\nprint(ans)", "import sys\r\n\r\ndef read(T):\r\n\treturn [T(i) for i in sys.stdin.readline().split()]\r\n\r\ndef main():\r\n\tn,q=read(int)\r\n\ta=read(int)\r\n\tqr=[read(int) for i in range(q)]\r\n\tct=[0 for i in range(n)]\r\n\tfor [l,r] in qr:\r\n\t\tct[l-1]+=1\r\n\t\tif r<n:\r\n\t\t\tct[r]-=1\r\n\tfor i in range(1,n):\r\n\t\tct[i]+=ct[i-1]\r\n\tct.sort()\r\n\ta.sort()\r\n\tans=0\r\n\tfor i in range(n):\r\n\t\tans+=ct[i]*a[i]\r\n\tprint(ans)\r\n\r\nmain()", "n,m=map(int,input().split())\r\nl=list(map(int,input().split()))\r\npre=[0 for i in range(n+2)]\r\n\r\nck=[]\r\nfor _ in range(m):\r\n a,b=map(int,input().split())\r\n ck.append([a,b])\r\n pre[a]+=1\r\n pre[b+1]-=1\r\n \r\nfor i in range(1,len(pre)):\r\n pre[i]=pre[i]+pre[i-1]\r\n \r\npre.pop(0)\r\npre.pop()\r\npre=sorted(pre)\r\nl=sorted(l)\r\nans=0\r\nfor i in range(n):\r\n ans+=pre[i]*l[i]\r\n \r\nprint(ans)", "def solve():\n n, q = map(int, input().split())\n tr = ct = 0\n v = [0] * (n + 2)\n temp = [0] * (n + 2)\n ans = list(map(int, input().split()))\n ans.sort(reverse=True)\n pq = []\n for i in range(q):\n x, y = map(int, input().split())\n pq.append((x, y))\n v[x] += 1\n v[y + 1] -= 1\n for i in range(1, n + 2):\n v[i] += v[i - 1]\n vp = [(v[i], i) for i in range(1, n + 1)]\n vp.sort(reverse=True)\n for i in range(len(vp)):\n temp[vp[i][1]] = ans[tr]\n tr += 1\n for i in range(1, n + 1):\n temp[i] += temp[i - 1]\n for i in range(len(pq)):\n ct += temp[pq[i][1]] - temp[pq[i][0] - 1]\n print(ct)\n\nt = 1\nfor _ in range(t):\n solve()\n\n\t\t \t\t \t \t\t \t\t\t \t\t\t\t\t", "import sys\r\n# sys.setrecursionlimit(100000)\r\ninput=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 datetime import datetime,timedelta\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,reduce\r\n# from operator import or_,xor,add,mul\r\n# from itertools import permutations,combinations,accumulate\r\n\r\ndef solve():\r\n n,q=map(int,input().split())\r\n a=list(map(int,input().split()))\r\n a.sort()\r\n b=[0]*n\r\n for i in range(q):\r\n l,r=map(int,input().split())\r\n l-=1;r-=1\r\n b[l]+=1\r\n if r+1<n:\r\n b[r+1]-=1\r\n for i in range(1,n):\r\n b[i]+=b[i-1]\r\n b.sort()\r\n res=0\r\n for i in range(n):\r\n res+=a[i]*b[i]\r\n print(res)\r\n return\r\n\r\n# t=int(input())\r\n# for _ in range(t):\r\n# solve()\r\n\r\nsolve()", "def main():\r\n\tn, q = list(map(int, input().strip().split()))\r\n\ta = list(map(int, input().strip().split()))\r\n\ta.sort(reverse = True)\r\n\tval = [0]*200100\r\n\tb = [0]*200100\r\n\tfor i in range(q):\r\n\t\tli, ri = list(map(int, input().strip().split()))\r\n\t\tli -= 1\r\n\t\tri -= 1\r\n\t\tval[li] += 1\r\n\t\tval[ri+1] -= 1\r\n\t# print(val[:n+1])\r\n\tv = 0\r\n\tfor i in range(n):\r\n\t\t# print(\"v: \", v, \"val[i]:\", val[i])\r\n\t\tv += val[i]\r\n\t\tb[i] = v\r\n\t\t# print(b[i])\r\n\tb.sort(reverse = True)\r\n\t# print(b[:n+1])\r\n\tres = 0\r\n\tfor i in range(n):\r\n\t\tres += b[i]*a[i]\r\n\r\n\tprint(str(res))\r\n\r\n\r\n\r\n\r\n# def main():\r\n# \tn, q = list(map(int, input().strip().split()))\r\n# \ta = list(map(int, input().strip().split()))\r\n# \tqueries = []\r\n# \tarray = [0]*(n+1)\r\n# \tfor i in range(q):\r\n# \t\tli, ri = list(map(int, input().strip().split()))\r\n# \t\tfor i in range(li, ri+1):\r\n# \t\t\tarray[i] += 1\r\n\r\n# \ta.sort(reverse = True)\r\n# \tarray.sort(reverse = True)\r\n# \tsolution = 0\r\n# \tfor i in range(0, n):\r\n# \t\tsolution += (a[i]*array[i])\r\n\r\n# \tprint(str(solution))\r\n\r\nif __name__ == '__main__':\r\n\tmain()", "import sys;input=sys.stdin.readline\r\nn,q=map(int,input().split())\r\na=sorted([*map(int,input().split())])\r\nl=[0]*n+[0]\r\nfor i in range(q):\r\n f,g=map(int,input().split())\r\n l[f-1]+=1\r\n l[g]-=1\r\nfor i in range(1,n):l[i]+=l[i-1]\r\nl=sorted(l[:-1])\r\nk=0\r\nfor i in range(n):\r\n k+=a[i]*l[i]\r\nprint(k)\r\n", "n, q = map(int, input().split())\r\na = list(map(int, input().split()))\r\ncnt = [0] * (n + 1)\r\nfor _ in range(q):\r\n l, r = map(int, input().split())\r\n cnt[l - 1] += 1\r\n cnt[r] -= 1\r\nfor i in range(1, n):\r\n cnt[i] += cnt[i - 1]\r\ncnt.pop()\r\ncnt.sort()\r\na.sort()\r\nprint(sum(x * y for x, y in zip(a, cnt)))", "n, q = map(int, input().split())\na = list(map(int, input().split()))\ns = [0 for _ in range(n)]\nfor _ in range(q):\n l, r = map(int, input().split())\n s[l-1] += 1\n if r < n:\n s[r] -= 1\nfor i in range(1, n):\n s[i] += s[i-1]\nans = 0\na.sort(reverse=True)\ns.sort(reverse=True)\nfor i in range(n):\n ans += a[i]*s[i]\nprint(ans)\n \t \t \t\t \t \t\t \t\t\t\t \t\t\t\t\t\t\t \t", "import sys\r\ninput = sys.stdin.readline\r\nfrom itertools import accumulate\r\n\r\nn, q = map(int, input().split())\r\nw = sorted(map(int, input().split()))\r\n\r\nd = [0]*(n+2)\r\nfor i in range(q):\r\n a, b = map(int, input().split())\r\n d[a] += 1\r\n d[b+1] -= 1\r\n\r\nd = sorted(list(accumulate(d))[1:-1])\r\nprint(sum(w[i]*d[i] for i in range(n)))", "n,q=map(int,input().split())\r\nQu=[0]*(n+1)\r\nd=[0]+sorted(map(int,input().split()))\r\nfor _ in range(q):\r\n x,y = map(int,input().split())\r\n Qu[x-1]+=1\r\n Qu[y]-=1\r\nfor i in range(1,n+1):\r\n Qu[i]+=Qu[i-1]\r\nQu.sort()\r\nprint(sum(d[i]*Qu[i] for i in range(n+1)))", "import sys\r\nimport os\r\nfrom collections import Counter\r\n\r\n\r\n# Read from file.\r\nif len(sys.argv) > 1:\r\n if os.path.exists(sys.argv[1]):\r\n file_name = sys.argv[1]\r\n with open(file_name, 'r') as f:\r\n input = iter(f.readlines()).__next__\r\n\r\n\r\n# Read and store input.\r\nn, q = map(int, input().split())\r\na = map(int, input().split())\r\nls, rs = list(), list()\r\nfor _ in range(q):\r\n l, r = map(int, input().split())\r\n ls.append(l)\r\n rs.append(r)\r\n\r\n# Count how many times l and r were mentioned.\r\ncount_l = Counter(ls)\r\ncount_r = Counter(rs)\r\n\r\n# Everytime an l is mentioned we increase with one, and everytime an r is mentioned we decrease with one for the next.\r\nvalue = 0\r\nidx_counts = dict()\r\nfor idx in range(1, n+1):\r\n value += count_l.get(idx, 0) - count_r.get(idx-1, 0)\r\n idx_counts[idx] = value\r\n\r\n# Multiply the largest number with the most mentioned idx, etc.\r\nans = sum([ai*bi for ai, bi in zip(sorted(a, reverse=True), sorted(idx_counts.values(), reverse=True))])\r\nprint(ans)\r\n", "from sys import stdin\r\ninput=stdin.readline\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] * (2 * _size)\r\n\r\n self.data = [default] * (2 * _size)\r\n self.data[_size:_size + self._len] = data\r\n for i in reversed(range(_size)):\r\n self.data[i] = func(self.data[i + i], self.data[i + i + 1])\r\n\r\n def __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\r\nn,m=map(int,input().strip().split())\r\na=[*map(int,input().strip().split())]\r\nst=LazySegmentTree([0]*n)\r\nfor i in range(m):\r\n l,r=map(int,input().strip().split())\r\n l-=1\r\n st.add(l,r,1)\r\n\r\na.sort(reverse=True)\r\nl=[]\r\nfor i in range(n):\r\n l.append(st.query(i,i+1))\r\nl.sort(reverse=True)\r\na=list(zip(a,l))\r\nans=0\r\nfor l,r in a:\r\n ans+=l*r\r\nprint(ans)\r\n", "n,m=map(int,input().split())\r\nlis=list(map(int,input().split()))\r\npre=[0]*n\r\nfor i in range(m):\r\n a,b=map(int,input().split())\r\n pre[a-1]=pre[a-1]+1\r\n if b<n:\r\n \r\n pre[b]=pre[b]-1\r\nans=[pre[0]]\r\nfor i in range(1,n):\r\n ans.append(ans[-1]+pre[i])\r\nlis.sort(reverse=True)\r\nans.sort(reverse=True)\r\nout=0\r\nfor i in range(n):\r\n out=out+lis[i]*ans[i]\r\nprint(out)", "n,q=map(int,input().split())\r\na=sorted(list(map(int,input().split())))\r\nama=[0]*n\r\nfor i in range(q):\r\n l,r=map(int,input().split())\r\n l-=1\r\n ama[l]+=1\r\n if r<n:\r\n ama[r]-=1\r\nfor i in range(1,n):\r\n ama[i]+=ama[i-1]\r\nama.sort()\r\notv=0\r\nfor i in range(n):\r\n otv+=ama[i]*a[i]\r\nprint(otv)\n# Tue Jul 12 2022 09:34:14 GMT+0000 (Coordinated Universal Time)\n", "n, q = map(int, input().split())\r\n\r\na = list(map(int, input().split()))\r\nsweep = [0 for i in range(n + 1)]\r\n\r\nQ = [[] for i in range(q)]\r\nfor i in range(q):\r\n Q[i] = list(map(int, input().split()))\r\n Q[i][0] -= 1\r\n Q[i][1] -= 1\r\n sweep[Q[i][0]] += 1\r\n sweep[Q[i][1] + 1] -= 1\r\n\r\nfor i in range(1, n):\r\n sweep[i] += sweep[i - 1]\r\n\r\nsweep.sort(reverse=True)\r\na.sort(reverse=True)\r\n\r\nans = 0\r\nfor i in range(n):\r\n ans += sweep[i] * a[i]\r\nprint(ans)", "n,q=map(int,input().split())\r\nliste=list(map(int,input().split()))\r\nprior=[0]*(n+1)\r\nq1=[]\r\nfor i in range(q):\r\n a,b=map(int,input().split())\r\n q1.append([a,b])\r\n prior[a-1]+=1\r\n prior[b]-=1\r\n\r\nfor i in range(1,n+1):\r\n prior[i]+=prior[i-1]\r\nprior.pop()\r\np= sorted(range(len(prior)), key=lambda i: prior[i], reverse=True)\r\nliste.sort(reverse=True)\r\nres=[0]*n\r\nfor i in range(len(liste)):\r\n res[p[i]]=liste[i]\r\n\r\nfor i in range(1,len(res)):\r\n\r\n res[i]+=res[i-1]\r\n\r\nsum=0\r\nfor i in range(len(q1)):\r\n a,b=q1[i]\r\n if a==1:\r\n sum+=res[b-1]\r\n else:\r\n sum+=(res[b-1]-res[a-2])\r\nprint(sum)", "from collections import defaultdict\nn,q=map(int,input().split())\na=list(map(int,input().split()))\nb=[0]*(n+1)\nfor _ in range(q):\n\tp,q=map(int,input().split())\n\tb[p-1]+=1\n\tb[q]-=1\nfor i in range(1,n+1):\n\tb[i]+=b[i-1]\na.sort(key=lambda x:-x)\nb.sort(key=lambda x:-x)\nsumm=0\nfor x,y in zip(a,b):\n\tsumm+=x*y\nprint(summ)\n", "import sys,random,bisect\r\nfrom collections import deque,defaultdict,Counter\r\nfrom heapq import heapify,heappop,heappush\r\nfrom math import gcd\r\nfrom types import GeneratorType\r\n#from functools import cache 3.9\r\nmod = int(1e9 + 7) #998244353\r\ninf = int(1e20)\r\ninput = lambda :sys.stdin.readline().rstrip()\r\nmi = lambda :map(int,input().split())\r\nli = lambda :list(mi())\r\nii = lambda :int(input())\r\npy = lambda :print(\"YES\")\r\npn = lambda :print(\"NO\")\r\n\r\nn,q=li()\r\n\r\narr=li()\r\n\r\ndif=[0]*n\r\n\r\nfor _ in range(q):\r\n l,r=li()\r\n dif[l-1]+=1\r\n if r<n:\r\n dif[r]-=1\r\n\r\nfor i in range(1,n):\r\n dif[i]+=dif[i-1]\r\n\r\narr.sort()\r\ndif.sort()\r\nres=0\r\n\r\nfor a,b in zip(arr,dif):\r\n res+=a*b\r\n\r\nprint(res)", "import sys, math\r\nfrom collections import defaultdict\r\n\r\ninput = sys.stdin.readline\r\n\r\n\r\ndef solve():\r\n n, q = map(int, input().split())\r\n a = [*map(int, input().split())]\r\n d = [0] * (n + 2)\r\n for i in range(q):\r\n l, r = map(int, input().split())\r\n d[l] += 1\r\n d[r + 1] -= 1\r\n for i in range(1, n + 1):\r\n d[i] += d[i - 1]\r\n d.pop(0)\r\n d.pop()\r\n d.sort()\r\n a.sort()\r\n ans = 0\r\n while a:\r\n ans += a.pop() * d.pop()\r\n print(ans)\r\n\r\n\r\n# for _ in range(int(input())):\r\nsolve()\r\n", "# ﷽\r\nfrom itertools import accumulate\r\nimport sys\r\ninput = lambda: sys.stdin.readline().strip()\r\nmod=7+10**9\r\ndef inlst():return [int(i) for i in input().split()]\r\n\r\ndef solve():\r\n n,m=inlst()\r\n l=[int(i) for i in input().split()]\r\n dp=[0]*(n+1)\r\n for i in range(m):\r\n a,b=[int(i) for i in input().split()]\r\n dp[a-1]+=1\r\n dp[b]-=1\r\n dp=(accumulate(dp[:n]))\r\n dp=sorted(dp,reverse=True)\r\n l=sorted(l,reverse=True)\r\n \r\n tot=sum(l[i]*dp[i] for i in range(n))\r\n print(tot)\r\n \r\n\r\n\r\n\r\nif __name__ == \"__main__\":\r\n # for i in range(int(input())):\r\n solve()\r\n", "import math\r\nimport itertools\r\nimport random\r\nfrom heapq import *\r\nimport sys\r\nfrom collections import deque # Usage: d=deque([])\r\ndef input():return sys.stdin.readline().strip() # fast IO\r\n#input=lambda:stdin.readline().rstrip('\\r\\n')\r\n# sys.setrecursionlimit(999999999) # Will MLE PyPy but not Python\r\ndebug=1\r\n# Leeisateam\r\n\r\nn,q=map(int,input().split())\r\na=list(map(int,input().split()))\r\nl=[]\r\nr=[]\r\nd=[0]*(n+2)\r\ns=[0]*(n+3)\r\nfor i in range(q):\r\n li,ri=map(int,input().split())\r\n d[li]+=1\r\n d[ri+1]-=1\r\nfor i in range(1,len(d)):\r\n s[i]=s[i-1]+d[i]\r\ns.sort(reverse=1)\r\na.sort(reverse=1)\r\nans=0\r\nfor i in range(n):\r\n ans+=a[i]*s[i]\r\nprint(ans)\r\n\r\n", "R=lambda:map(int,input().split())\r\na,b=R();A=[0]+sorted(R());B=[0]*(a+1)\r\nfor _ in range(b):m,n=R();B[m-1]+=1;B[n]-=1\r\nfor i in range(a):B[i+1]+=B[i]\r\nB.sort();t=0\r\nfor i in range(a+1):t+=A[i]*B[i]\r\nprint(t)", "import heapq\r\nimport sys\r\ninput=sys.stdin.readline\r\nfrange=range\r\nn,q=map(int,input().split())\r\na=list(map(int,input().split()))\r\nini=[0 for i in range(n+1)]\r\nqueries=[]\r\nfor _ in frange(q):\r\n l,r=map(int,input().split())\r\n ini[r]-=1\r\n ini[l-1]+=1\r\n queries+=[[l,r]]\r\nfor i in frange(1,n+1):\r\n ini[i]+=ini[i-1]\r\na.sort(reverse=True)\r\nini=ini[:-1:]\r\nans=0\r\nini.sort(reverse=True)\r\nfor i in range(n):\r\n ans+=a[i]*ini[i]\r\nprint(ans)", "n, q = map(int, input().split())\nnums = [int(i) for i in input().split()]\nweights = [0] * n\nfor _ in range(q):\n l, r = map(int, input().split())\n if l - 1 == 0:\n weights[r - 1] += 1\n else:\n weights[r - 1] += 1\n weights[l - 2] -= 1\nk = n - 2\nwhile k >= 0:\n weights[k] += weights[k + 1]\n k -= 1\nnums.sort()\nweights.sort()\nmax_sum = 0\nfor i in range(n):\n max_sum += nums[i] * weights[i]\nprint(max_sum)\n", "'''input\r\n5 3\r\n5 2 4 1 3\r\n1 5\r\n2 3\r\n2 3\r\n\r\n'''\r\nimport sys\r\nfrom math import *\r\nfrom bisect import *\r\nfrom itertools import *\r\nfrom functools import *\r\nfrom heapq import *\r\ninput = sys.stdin.readline\r\ndef getstr(): return input().rstrip('\\r\\n')\r\ndef getint(): return int(input().strip())\r\ndef getints(): return list(map(int, input().strip().split()))\r\ndef impossible(): print(-1),exit(0)\r\n\r\nn,q = getints()\r\npsum = [0 for i in range(n+10)]\r\ndef rangeadd(a,b):\r\n\tpsum[a]+=1\r\n\tpsum[b+1]-=1\r\n\r\narr = getints()\r\narr.sort(reverse=True)\r\nfor i in range(q):\r\n\ta,b=getints()\r\n\ta-=1\r\n\tb-=1\r\n\trangeadd(a,b)\r\n\r\ncurr = 0\r\nd=[]\r\nfor i in range(n):\r\n\tcurr += psum[i]\r\n\td.append(curr)\r\nd.sort(reverse=True)\r\n\r\nprint(sum(arr[i]*d[i] for i in range(n)))", "def solve():\r\n n, q = map(int, input().split())\r\n a = list(map(int, input().split()))\r\n tag = [0] * (n + 1)\r\n\r\n for _ in range(q):\r\n l, r = map(int, input().split())\r\n l -= 1\r\n tag[l] += 1\r\n tag[r] -= 1\r\n\r\n cur = 0\r\n for i in range(n):\r\n cur += tag[i]\r\n tag[i] = cur\r\n\r\n tag.pop()\r\n a.sort()\r\n tag.sort()\r\n\r\n ans = 0\r\n for i in range(n):\r\n ans += a[i] * tag[i]\r\n\r\n print(ans)\r\n\r\ndef main():\r\n tc = 1 # Number of test cases\r\n for _ in range(tc):\r\n solve()\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "import threading, sys\r\n\r\ndef main():\r\n n, q = map(int,input().split())\r\n nums = list(map(int, input().split()))\r\n spaces = [0]*n\r\n queries = []\r\n for _ in range(q):\r\n l,r = map(int, input().split())\r\n l-=1\r\n r-=1\r\n queries.append((l,r))\r\n spaces[l] += 1\r\n if r+1<n:\r\n spaces[r+1] -= 1\r\n\r\n for i in range(1, n):\r\n spaces[i] += spaces[i-1]\r\n \r\n spaces = sorted([(spaces[i], i) for i in range(n)], reverse=True)\r\n nums.sort(reverse=True)\r\n new = [0]*n\r\n\r\n for i in range(n):\r\n new[spaces[i][1]] = nums[i]\r\n \r\n p = [0]\r\n for num in new:\r\n p.append(p[-1]+num)\r\n \r\n tot = 0\r\n for l,r in queries:\r\n tot += p[r+1] - p[l]\r\n \r\n print(tot)\r\n\r\n\r\nif __name__ == '__main__':\r\n sys.setrecursionlimit(1 << 30)\r\n threading.stack_size(1 << 27)\r\n\r\n main_thread = threading.Thread(target=main)\r\n main_thread.start()\r\n main_thread.join()", "from itertools import product\r\nimport os\r\nimport sys\r\nfrom bisect import bisect\r\nfrom io import BytesIO, IOBase\r\nfrom collections import defaultdict\r\nimport math\r\ndef main():\r\n n, q = map(int, input().split())\r\n a = sorted(map(int, input().split()))\r\n l = [0] * (n + 1)\r\n i = 0\r\n while i < q:\r\n s, e = map(int, input().split())\r\n l[s - 1] += 1\r\n l[e] -= 1\r\n i += 1\r\n\r\n i = 0\r\n d = []\r\n sol = 0\r\n while i < len(l):\r\n sol += l[i]\r\n d.append(sol)\r\n i += 1\r\n\r\n d.sort(reverse=True) # Sort the prefix sums in descending order\r\n a.sort(reverse=True) # Sort the array elements in descending order\r\n\r\n result = 0\r\n for i in range(n):\r\n result += d[i] * a[i]\r\n\r\n print(result)\r\n\r\n\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._file = file\r\n self._fd = file.fileno()\r\n self.buffer = BytesIO()\r\n self.writable = \"x\" in file.mode or \"r\" not in file.mode\r\n self.write = self.buffer.write if self.writable else None\r\n\r\n def read(self):\r\n while True:\r\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\r\n if not b:\r\n break\r\n ptr = self.buffer.tell()\r\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\r\n self.newlines = 0\r\n return self.buffer.read()\r\n\r\n def readline(self):\r\n while self.newlines == 0:\r\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\r\n self.newlines = b.count(b\"\\n\") + (not b)\r\n ptr = self.buffer.tell()\r\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\r\n self.newlines -= 1\r\n return self.buffer.readline()\r\n\r\n def flush(self):\r\n if self.writable:\r\n os.write(self._fd, self.buffer.getvalue())\r\n self.buffer.truncate(0), self.buffer.seek(0)\r\n\r\n\r\nclass IOWrapper(IOBase):\r\n def __init__(self, file):\r\n self.buffer = FastIO(file)\r\n self.flush = self.buffer.flush\r\n self.writable = self.buffer.writable\r\n self.write = lambda s: self.buffer.write(s.encode(\"ascii\"))\r\n self.read = lambda: self.buffer.read().decode(\"ascii\")\r\n self.readline = lambda: self.buffer.readline().decode(\"ascii\")\r\n\r\n\r\nsys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)\r\ninput = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\r\n\r\n# endregion\r\n\r\nif __name__ == \"__main__\":\r\n main()", "from sys import *\r\ninput=stdin.buffer.readline\r\nn,m=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nd=[0]*(n+1)\r\nfor i in range(m):\r\n x,y=map(int,input().split())\r\n d[x-1]+=1\r\n d[y]-=1\r\nfor i in range(1,n):\r\n d[i]+=d[i-1]\r\nl.sort(reverse=True)\r\nd.sort(reverse=True)\r\nka=0\r\nfor i in range(n):\r\n ka+=d[i]*l[i]\r\nprint(ka)", "# DO NOT EDIT THIS\r\nimport sys\r\ninput = sys.stdin.readline\r\n\r\nn, q = [int(k) for k in input().split()]\r\narr = [int(k) for k in input().split()]\r\n\r\ndp = [0] * (n + 2)\r\n\r\nfor _ in range(q):\r\n l, r = [int(k) for k in input().split()]\r\n dp[l] += 1\r\n dp[r + 1] -= 1\r\n\r\n\r\nfor i in range(1, len(dp)):\r\n dp[i] += dp[i - 1]\r\n\r\ndp = sorted(dp[1:-1], reverse=True)\r\nprint(sum(a * b for a, b in zip(dp, sorted(arr, reverse=True))))\r\n\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\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\nres = 0\r\nn,q = invr()\r\narr = inlt()\r\nqueries = []\r\nfor i in range(q):\r\n l,r = invr()\r\n queries.append((l,r))\r\n\r\ntemp = [0] * len(arr)\r\narr2 = [0] * len(arr)\r\nfor l,r in queries:\r\n temp[l-1] += 1\r\n\r\n if r < n:\r\n temp[r] -= 1\r\n\r\ncur = 0\r\nfor i in range(n):\r\n cur += temp[i]\r\n arr2[i] = cur\r\n\r\narr.sort(reverse=True)\r\narr2.sort(reverse=True)\r\n\r\nfor i in range(n):res+= (arr[i] * arr2[i])\r\n\r\nprint(res)", "from functools import cmp_to_key\r\nn, q = map(int, input().split())\r\narr = list(map(int, input().split()))\r\norder = [0]*(n+1)\r\nfor _ in range(q):\r\n l,r = map(int, input().split())\r\n order[l-1] +=1\r\n order[r] -=1\r\n\r\nfor i in range(1, n+1):\r\n order[i] += order[i-1]\r\n \r\narr.sort()\r\norder.sort()\r\norder = order[1:]\r\ns = 0\r\nfor i in range(n):\r\n s += arr[i]*order[i]\r\nprint(s)", "n, p = map(int, input().split())\r\nL = list(map(int, input().split()))\r\nL.sort(reverse=True)\r\nM = [[0, 0] for i in range(n)]\r\nN = [0 for j in range(n)]\r\nfor i in range(p):\r\n l, r = map(int, input().split())\r\n M[l-1][0] += 1\r\n M[r-1][1] += 1\r\n\r\nk = 0\r\nfor i in range(n):\r\n O = M[i][0]\r\n C = M[i][1]\r\n k += O\r\n N[i] = k\r\n k -= C\r\n\r\nN.sort(reverse=True)\r\nS = 0\r\nfor q in range(n):\r\n S += N[q]*L[q]\r\nprint(S, flush=True)\r\n", "import sys, io, os\r\nimport math\r\nimport bisect\r\nimport heapq\r\nimport string\r\nimport re\r\nfrom decimal import *\r\nfrom collections import defaultdict,Counter,deque\r\ninput = sys.stdin.readline\r\n \r\ndef I():\r\n return input()\r\n \r\ndef II():\r\n return int(input())\r\n \r\ndef MII():\r\n return map(int, input().split())\r\n \r\ndef LI():\r\n return list(input().split())\r\n \r\ndef LII():\r\n return list(map(int, input().split()))\r\n \r\ndef GMI():\r\n return map(lambda x: int(x) - 1, input().split())\r\n \r\ndef LGMI():\r\n return list(map(lambda x: int(x) - 1, input().split()))\r\n \r\ndef WRITE(out):\r\n return print('\\n'.join(map(str, out)))\r\n \r\ndef WS(out):\r\n return print(' '.join(map(str, out)))\r\n \r\ndef WNS(out):\r\n return print(''.join(map(str, out)))\r\n\r\ndef WSNOPRINT(out):\r\n return ''.join(map(str, out))\r\n\r\n\r\n'''\r\n'''\r\ndef solve():\r\n n, q = MII()\r\n a = sorted(LII())\r\n f = [0] * (n+1)\r\n\r\n for _ in range(q):\r\n l, r = MII()\r\n f[l-1] += 1\r\n f[r] -= 1\r\n for i in range(1, len(f)):\r\n f[i] += f[i-1]\r\n f.pop() \r\n f.sort()\r\n\r\n print(sum([x*y for x,y in zip(a,f)]))\r\n\r\ndef main():\r\n solve()\r\n\r\nmain()\r\n", "def prefix_sum(lis):\r\n ele=0\r\n ans=[]\r\n for i in lis:\r\n ele+=i\r\n ans.append(ele)\r\n return ans\r\n\r\nn,q=map(int,input().split())\r\nlis=list(map(int,input().split()))\r\ncount=[0 for i in range(n+1)]\r\nfor i in range(q):\r\n a,b=map(int,input().split());a-=1\r\n count[a]+=1;count[b]-=1\r\ncount=prefix_sum(count)\r\nlis.sort(reverse=True);count.sort(reverse=True)\r\nans=0\r\nfor i in range(n):\r\n ans+=lis[i]*count[i]\r\nprint(ans)", "import math\r\nimport os\r\nimport sys\r\nfrom io import BytesIO, IOBase\r\nM = 1000000007\r\nimport random\r\nimport heapq\r\nimport threading\r\nimport bisect\r\nimport time\r\nfrom functools import *\r\nfrom collections import *\r\nfrom itertools import *\r\nBUFSIZE = 8192\r\nimport array\r\nclass FastIO(IOBase):\r\n newlines = 0\r\n def __init__(self, file):\r\n self._fd = file.fileno()\r\n self.buffer = BytesIO()\r\n self.writable = \"x\" in file.mode or \"r\" not in file.mode\r\n self.write = self.buffer.write if self.writable else None\r\n def read(self):\r\n while True:\r\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\r\n if not b:\r\n break\r\n ptr = self.buffer.tell()\r\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\r\n self.newlines = 0\r\n return self.buffer.read()\r\n def readline(self):\r\n while self.newlines == 0:\r\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\r\n self.newlines = b.count(b\"\\n\") + (not b)\r\n ptr = self.buffer.tell()\r\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\r\n self.newlines -= 1\r\n return self.buffer.readline()\r\n def flush(self):\r\n if self.writable:\r\n os.write(self._fd, self.buffer.getvalue())\r\n self.buffer.truncate(0), self.buffer.seek(0)\r\nclass IOWrapper(IOBase):\r\n def __init__(self, file):\r\n self.buffer = FastIO(file)\r\n self.flush = self.buffer.flush\r\n self.writable = self.buffer.writable\r\n self.write = lambda s: self.buffer.write(s.encode(\"ascii\"))\r\n self.read = lambda: self.buffer.read().decode(\"ascii\")\r\n self.readline = lambda: self.buffer.readline().decode(\"ascii\")\r\ndef print(*args, **kwargs):\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\nif sys.version_info[0] < 3:\r\n sys.stdin, sys.stdout = FastIO(sys.stdin), FastIO(sys.stdout)\r\nelse:\r\n sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)\r\ninput = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\r\ndef inp(): return sys.stdin.readline().rstrip(\"\\r\\n\") # for fast input\r\ndef out(var): sys.stdout.write(str(var)) # for fast output, always take string\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\ndef inpu(): return int(inp())\r\n\r\ndef build(arr,a,b,st,node):\r\n if a==b:\r\n st[node] = arr[a]\r\n return st[node]\r\n mid = (a+b)//2\r\n st[node] = min(build(arr,a,mid,st,2*node+1) , build(arr,mid+1,b,st,2*node+2))\r\n return st[node]\r\n\r\ndef getmin(arr,a,b,l,r,st,node):\r\n if l>b or r<a:\r\n return float(\"inf\")\r\n if l<=a and r>=b:\r\n return st[node]\r\n mid = (a+b)//2\r\n return min(getmin(arr,a,mid,l,r,st,2*node+1),getmin(arr,mid+1,b,l,r,st,2*node+2))\r\n\r\ndef chck(x,y,z):\r\n #print(x[0]*(y[1]-z[1]) + y[0]*(z[1]-x[1]) + z[0]*(x[1]-y[1]))\r\n if abs(x[0]*(y[1]-z[1]) + y[0]*(z[1]-x[1]) + z[0]*(x[1]-y[1]))>0:\r\n return True\r\n return False\r\n\r\n\r\n\"\"\"def fun(s,res,n):\r\n l = []\r\n for i in range(len(s)):\r\n if s[i] == res:\r\n l.append(i)\r\n ans = 0\r\n d = defaultdict(int)\r\n for i in l:\r\n d[i] += 1\r\n p = []\r\n for i in l[::-1]:\r\n if n - 1 - i in d:\r\n continue\r\n else:\r\n #flag = False\r\n p.append(i)\r\n ans += 1\r\n n-=1\r\n pp = \"\"\r\n for i in range(n):\r\n if len(p) > 0 and i == p[0]:\r\n p.pop(0)\r\n else:\r\n pp += s[i]\r\n print(pp)\r\n if pp==pp[::-1]:\r\n return ans\r\n else:\r\n return -1\"\"\"\r\n\r\ndef main():\r\n t = 1\r\n #t=inpu()\r\n for _ in range(t):\r\n n,q = sep()\r\n arr = lis()\r\n d = [0]*(n+1)\r\n for i in range(q):\r\n l,r = sep()\r\n d[l-1]+=1\r\n d[r]-=1\r\n d = list(accumulate(d))\r\n d.pop()\r\n d.sort(reverse=True)\r\n arr.sort(reverse=True)\r\n ans=0\r\n for i in range(n):\r\n ans+=(arr[i]*d[i])\r\n print(ans)\r\nif __name__ == '__main__':\r\n \"\"\"\r\n threading.stack_size(2*10**8)\r\n threading.Thread(target=main).start()\r\n \"\"\"\r\n main()\r\n", "n,q=list(map(int,input().split()))\r\na=list(map(int,input().split()))\r\np=[0]*(n+1)\r\nfor i in range(q):\r\n l,r=list(map(int,input().split()))\r\n p[r]+=1\r\n p[l-1]-=1\r\ns,c=[],0\r\nfor i in p[::-1]:\r\n c+=i\r\n s.append(c)\r\ns.pop()\r\ns.sort()\r\na.sort()\r\nans=0\r\nfor i in range(n):\r\n ans+=s[i]*a[i]\r\nprint(ans)", "from sys import stdin,stdout\r\nfrom heapq import heappop,heappush\r\ninput,print = stdin.readline,stdout.write\r\n\r\nn,q=map(int,input().split())\r\narr=list(map(int,input().split()))\r\nlis=[0]*(n)\r\narrh=[]\r\nfor i in arr:\r\n heappush(arrh,i)\r\nfor _ in range(q):\r\n a,b=map(int,input().split())\r\n lis[b-1]+=1\r\n if a!=1:\r\n lis[a-2]-=1\r\nfor i in range(n-2,-1,-1):\r\n lis[i]+=lis[i+1]\r\nlish=[]\r\nfor i in lis:\r\n heappush(lish,i)\r\nans=0\r\nfor _ in range(n):\r\n ans+=heappop(arrh)*heappop(lish)\r\nprint(str(ans))", "n, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\nb = [0 for i in range(n)]\r\nfor _ in range(m):\r\n start, end = map(int, input().split())\r\n b[start-1] += 1\r\n if end < n:\r\n b[end] -= 1\r\n\r\nfor i in range(1, len(b)):\r\n b[i] +=b[i-1]\r\n\r\na.sort()\r\nb.sort()\r\nres = 0\r\nfor i in range(len(a)):\r\n res += (a[i] * b[i])\r\n\r\nprint(res)\r\n ", "n, q = map(int, input().split())\r\narr = list(map(int, input().split()))\r\npref = [0 for _ in range(n + 2)]\r\nfor i in range(q):\r\n l, r = map(int, input().split())\r\n pref[l] += 1\r\n pref[r + 1] -= 1\r\n\r\nfor i in range(1, n + 2):\r\n pref[i] += pref[i - 1]\r\n\r\npref = sorted(pref[1:n+1])\r\narr.sort()\r\nres = 0\r\n\r\nfor i in range(n):\r\n res += arr[i] * pref[i]\r\n \r\nprint(res)", "n, q = map(int, input().split())\r\na = [int(x) for x in input().split()]\r\ns = [0]*n\r\nfor _ in range(q):\r\n l, r = map(int, input().split())\r\n s[l-1] += 1\r\n if r!=n:\r\n s[r] -= 1\r\n\r\ncnt = 0\r\nfor i in range(n):\r\n cnt += s[i]\r\n s[i] = cnt\r\n\r\ns.sort()\r\na.sort()\r\nprint(sum(x*y for x,y in zip(s,a)))\r\n", "length, q = list(map(int,input().split()))\r\nnums = list(map(int,input().split()))\r\n\r\nqueries = []\r\npre_sum = [0]*(length+1)\r\nfor _ in range (q):\r\n qr = list(map(int,input().split()))\r\n pre_sum[qr[0]-1]+=1\r\n pre_sum[qr[1]]-=1\r\n queries.append(qr)\r\nnums.sort(reverse=True)\r\nsummation = 0\r\nfor i in range(0,length):\r\n summation+=pre_sum[i]\r\n pre_sum[i] = summation\r\npre_sum.sort(reverse=True)\r\ntot =0\r\nfor a in range(length):\r\n ans = pre_sum[a] * nums[a]\r\n tot+=ans\r\nprint(tot)\r\n\r\n\r\n\r\n\r\n\r\n \r\n \r\n \r\n \r\n \r\n \r\n\r\n \r\n ", "from sys import stdin\r\ndef input(): return stdin.readline().rstrip(\"\\r\\n\")\r\nn,q = map(int,input().split())\r\na = list(map(int,input().split()))\r\ndiff1 = [0]*(n+1)\r\nfor i in range(q):\r\n l,r = map(int,input().split())\r\n l-=1\r\n r-=1\r\n diff1[l]+=1\r\n diff1[r+1]-=1\r\nfor j in range(1,len(diff1)-1):\r\n diff1[j]+=diff1[j-1]\r\ndiff1.pop()\r\ndiff1.sort()\r\na.sort()\r\nsum1 = 0\r\nfor l in range(len(a)):\r\n sum1+=a[l]*diff1[l]\r\nprint(sum1)", "from itertools import accumulate\r\n\r\nn, m = list(map(int, input().split()))\r\na = list(map(int, input().split()))\r\n\r\nquery = [0]*(n+1)\r\n\r\nfor i in range(m):\r\n l, r = list(map(int, input().split()))\r\n query[l-1] += 1\r\n query[r] -= 1\r\n\r\nquery = list(accumulate(query[:-1]))\r\n\r\nquery.sort(reverse=True)\r\na.sort(reverse=True)\r\n\r\nprint(sum([query[i]*a[i] for i in range(n)]))\r\n\r\n", "from collections import defaultdict, Counter, deque\r\n\r\ndef runCase():\r\n n, q = map(int, input().split())\r\n array = list(map(int, input().split()))\r\n queries = [0] * (n + 1)\r\n for _ in range(q):\r\n start, end = map(int, input().split())\r\n queries[start - 1] += 1\r\n queries[end] += -1\r\n \r\n for i in range(1, n):\r\n queries[i] += queries[i - 1]\r\n queries.pop()\r\n queries.sort(reverse=True)\r\n array.sort(reverse=True)\r\n\r\n maxSum = 0\r\n for i in range(n):\r\n maxSum += array[i] * queries[i]\r\n \r\n print(maxSum)\r\n\r\nif __name__ == '__main__':\r\n # tests = int(input())\r\n tests = 1\r\n for _ in range(tests):\r\n runCase()", "import sys\r\nimport collections\r\nimport math\r\ninput = sys.stdin.readline\r\n\r\nints = lambda: list(map(int, input().split()))\r\n\r\nn, q = ints()\r\na = ints()\r\nstart = [0] * n\r\nend = [0] * n\r\nfor _ in range(q):\r\n l, r = ints()\r\n start[l - 1] += 1\r\n end[r - 1] += 1\r\n\r\ncounts = [0] * n\r\nactive = 0\r\nfor i in range(n):\r\n active += start[i]\r\n if i > 0: active -= end[i - 1]\r\n counts[i] += active\r\ncounts.sort()\r\na.sort()\r\nres = 0\r\nfor i in range(n):\r\n res += counts[i] * a[i]\r\nprint(res)\r\n", "import sys\r\ninput = sys.stdin.readline\r\nn, q = map(int, input().split())\r\ntree = [0] * (n + 1)\r\ndef read(x):\r\n sm = 0\r\n while x > 0:\r\n sm += tree[x]\r\n x -= x & -x\r\n return sm\r\ndef update(x, val):\r\n sm = 0\r\n while x <= n:\r\n tree[x] += val\r\n x += x & -x\r\ndef main():\r\n *arr, = sorted(map(int, input().split()))\r\n for _ in range(q):\r\n l, r = map(int, input().split())\r\n update(l, 1)\r\n update(r + 1, -1)\r\n pre = [0] * n\r\n for i in range(1, n + 1):\r\n pre[i - 1] = read(i)\r\n pre.sort()\r\n sm = 0\r\n for i in range(n):sm += arr[i] * pre[i]\r\n print(sm)\r\nmain()", "n, q = [int(x) for x in input().split()]\n\nelementos = [int(x) for x in input().split()]\n\nindices = []\nfor i in range(q):\n ind = [int(x) for x in input().split()]\n indices.append(ind)\n \ncontagem = [0]*(n+2)\n\nfor inds in indices:\n l, r = inds\n \n contagem[l] += 1\n contagem[r+1] -= 1\n\nsoma = 0\nfor c in range(len(contagem)):\n contagem[c] += soma\n soma = contagem[c]\n\nelementos.sort(reverse=True)\ncontagem.sort(reverse=True)\n\nresultado = 0\nfor k in range(n):\n resultado += elementos[k]*contagem[k]\n \nprint(resultado)\n\t \t\t \t\t\t\t\t\t \t \t\t\t \t\t\t \t", "'''input\r\n3 3\r\n5 3 2\r\n1 2\r\n2 3\r\n1 3\r\n\r\n'''\r\nimport sys\r\nfrom math import *\r\nfrom bisect import *\r\nfrom itertools import *\r\nfrom functools import *\r\nfrom heapq import *\r\ninput = sys.stdin.readline\r\ndef getstr(): return input().rstrip('\\r\\n')\r\ndef getint(): return int(input().strip())\r\ndef getints(): return list(map(int, input().strip().split()))\r\ndef impossible(): print(-1),exit(0)\r\n\r\nn,q = getints()\r\n\r\npsum = [0 for i in range(n+10)]\r\ndef rangeadd(a,b):\r\n\tpsum[a]+=1\r\n\tpsum[b+1]-=1\r\n\r\narr = getints()\r\narr = list(map(lambda x:-x, arr))\r\nheapify(arr)\r\n\r\nfor i in range(q):\r\n\ta,b=getints()\r\n\ta-=1\r\n\tb-=1\r\n\trangeadd(a,b)\r\ncurr = 0\r\nd=[]\r\nfor i in range(n):\r\n\tcurr += psum[i]\r\n\td.append(curr)\r\nd.sort(reverse=True)\r\nans=0\r\n\r\nfor e in d:\r\n\tx = -heappop(arr)\r\n\tans += e*x\r\nprint(ans)", "import sys\nfrom collections import *\nsys.setrecursionlimit(10**5)\nitr = (line for line in sys.stdin.read().strip().split('\\n'))\nINP = lambda: next(itr)\ndef ni(): return int(INP())\ndef nl(): return [int(_) for _ in INP().split()]\n \n \n \nclass FenwickTree: # zero indexed calls!\n def __init__(self, sz):\n self.data = [0]*(sz+1)\n def inc(self, i, delta):\n i += 1 # (to 1 indexing)\n while i < len(self.data):\n self.data[i] += delta\n i += i&-i # lowest oneBit\n def sum(self, i):\n i += 1 # (to 1 indexing)\n S = 0\n while i > 0:\n S += self.data[i]\n i -= i&-i\n return S\n def query(self, lo, hi):\n return self.sum(hi) - self.sum(lo)\n \n \nn, quer = nl()\na = nl()\ntree = FenwickTree(n+2)\nfor _ in range(quer):\n l, r = nl()\n tree.inc(l,1)\n tree.inc(r+1,-1)\n#now we have a tree that jhas the amount of times each thing was added\n#test\n#print(a)\na.sort()\nappeareances = []\nfor i in range(1,n+1):\n appeareances.append(tree.sum(i))\n \nappeareances.sort()\ntot = 0\nfor i in range(1,n+1):\n tot += appeareances[n-i] * a[n-i]\n \nprint(tot)", "import sys\ninput = lambda: sys.stdin.readline().rstrip()\nfrom collections import deque,defaultdict,Counter\nfrom bisect import *\nfrom heapq import *\nfrom math import ceil,gcd,lcm\n\nN,Q = map(int,input().split())\nA = list(map(int,input().split()))\n\nl = [0]*N\nfor _ in range(Q):\n a,b = map(int,input().split())\n l[a-1]+=1\n if b<N:\n l[b]-=1\n\nfor i in range(1,N):\n l[i]+=l[i-1]\nl.sort(reverse=True)\nA.sort(reverse=True)\nans=0\nfor i in range(N):\n ans+=l[i]*A[i]\nprint(ans)", "def little():\r\n n,q = input().split()\r\n n = int(n)\r\n q = int(q)\r\n arr = [0] * (n)\r\n arr = list(map(int, input().split(' ')[:n]))\r\n arr2 = [0] * (n + 1)\r\n \r\n l = 0\r\n r = 0\r\n i = 0\r\n q = int(q)\r\n \r\n while (i < q):\r\n l, r = input().split()\r\n l = int(l)\r\n r = int(r)\r\n arr2[l] += 1\r\n if (r < n):\r\n arr2[r + 1] += -1\r\n i += 1\r\n \r\n i = 1\r\n while (i <= n):\r\n arr2[i] += arr2[i - 1]\r\n i += 1\r\n \r\n arr.sort()\r\n arr2.sort()\r\n \r\n sum= 0\r\n i = 0\r\n \r\n while (i < n):\r\n sum+= arr[i] * arr2[i + 1]\r\n i += 1\r\n print(sum)\r\n \r\nlittle()", "n,q=list(map(int,input().split()))\r\narr=list(map(int,input().split()))\r\nb=[0]*(n+1)\r\nc=[0]*n\r\nfor i in range(q):\r\n l,r=list(map(int,input().split()))\r\n b[l-1]+=1\r\n b[r]-=1\r\n\r\ncummulativeSum=0\r\nfor i in range(n):\r\n cummulativeSum+=b[i]\r\n c[i]=cummulativeSum\r\n\r\nc.sort()\r\narr.sort()\r\nans=0\r\nfor i in range(n):ans+=arr[i]*c[i]\r\nprint(ans)\r\n", "n,q=map(int,input().split())\r\narr=list(map(int,input().split()))\r\naux=[0]*(n)\r\nqu=[]\r\nfor i in range(q):\r\n u,v=map(int,input().split())\r\n aux[u-1]+=1\r\n \r\n\r\n if v < n:\r\n aux[v]-=1 \r\ns=0\r\nfor i in range(n):\r\n s+=aux[i]\r\n aux[i]=s\r\naux.sort(reverse=True)\r\narr.sort(reverse=True)\r\nans=0\r\nfor u,v in zip(aux,arr):\r\n ans+=u*v\r\nprint(ans)\r\n\r\n ", "I=lambda:map(int,input().split())\r\nn,q=I()\r\na=[0]+sorted(I())\r\nw=[0]*(n+1)\r\nfor i in range(q):\r\n x,y=I()\r\n w[x-1]+=1\r\n w[y]-=1\r\nfor i in range(1,n):w[i]+=w[i-1]\r\nw.sort()\r\nprint(sum(a[i]*w[i]for i in range(n+1))) ", "n, q = map(int, input().split())\r\na = list(map(int, input().split()))\r\nd = [0] * n\r\nfor _ in range(q):\r\n l, r = map(int, input().split())\r\n l -= 1\r\n d[l] += 1\r\n if r < n:\r\n d[r] -= 1\r\nb = [0] * n\r\np = 0\r\nfor i, v in enumerate(d):\r\n p = b[i] = v + p\r\na.sort()\r\nb.sort()\r\nans = sum(x * y for x, y in zip(a, b))\r\nprint(ans)\r\n", "\r\ndef solve(n,q,arr,qq):\r\n lt = [0]*(n+1)\r\n for l,r in qq:\r\n lt[l-1]+=1\r\n lt[r]-=1\r\n summ = 0\r\n for i in range(n+1):\r\n summ+=lt[i]\r\n lt[i] = summ\r\n lt.sort()\r\n lt.reverse()\r\n arr.sort()\r\n arr.reverse()\r\n total = 0\r\n for i in range(n):\r\n total+=lt[i]*arr[i]\r\n print(total) \r\n\r\n\r\n\r\ntxt = input()\r\nn,q = list(map(int,txt.split(\" \")))\r\ntxt = input()\r\narr = list(map(int,txt.split(\" \")))\r\nqq = []\r\nfor i in range(q):\r\n txt = input()\r\n ff = list(map(int,txt.split(\" \")))\r\n qq.append(ff)\r\n\r\n\r\nsolve(n,q,arr,qq)\r\n", "n,q=map(int,input().split())\r\nar=list(map(int,input().split()))\r\nfre= [0 for i in range(n)]\r\nwhile q:\r\n l,r=map(int,input().split())\r\n fre[l-1]+=1\r\n if r!=n:\r\n fre[r]-=1\r\n q-=1\r\nfor i in range(1,n):\r\n fre[i]+=fre[i-1]\r\nprint(sum(i*j for i,j in zip(sorted(ar),sorted(fre))))\r\n", "import sys\r\ninput = lambda: sys.stdin.readline().rstrip()\r\n\r\nN,Q = map(int, input().split())\r\nA = list(map(int, input().split()))\r\n\r\ncnt = [0]*(N+1)\r\nfor _ in range(Q):\r\n l,r = map(int, input().split())\r\n cnt[l-1]+=1\r\n cnt[r]-=1\r\n\r\nB = [cnt[0]]\r\nfor a in cnt[1:]:\r\n B.append(B[-1]+a)\r\nB.pop()\r\nB.sort(reverse=True)\r\n\r\nA.sort(reverse=True)\r\n\r\nans = 0\r\nwhile A:\r\n ans+=B.pop()*A.pop()\r\nprint(ans)\r\n\r\n", "n,q = map(int,input().split())\r\narr = [0] + sorted(map(int,input().split()))\r\n\r\nprefix_sum = [0]*(n+1)\r\n\r\nfor _ in range(q):\r\n l,r = map(int,input().split())\r\n prefix_sum[l-1] += 1\r\n prefix_sum[r] -= 1\r\n\r\nfor i in range(1,n):\r\n prefix_sum[i] += prefix_sum[i-1]\r\n\r\nprefix_sum.sort()\r\nmax_sum = 0\r\n\r\nfor j in range(n+1):\r\n max_sum += (arr[j]*prefix_sum[j])\r\n\r\nprint(max_sum)\r\n", "# author: ankan2526\r\n\r\nimport math, bisect, heapq, random, sys, itertools\r\n#sys.setrecursionlimit(10**6)\r\ninput=sys.stdin.readline\r\n\r\nints = lambda : list(map(int,input().split()))\r\nalpha = \"ABCDEFGHIJKLMNOPQRSTUVWXYZ\"\r\np2 = [1]\r\nfor i in range(70):p2.append(p2[-1]*2)\r\np = 10**9+7\r\nANS=[]\r\n\r\nn,q = ints()\r\na = ints()\r\nb = [0]*(n+1)\r\nfor i in range(q):\r\n l,r = ints()\r\n b[l-1]+=1\r\n b[r]-=1\r\n\r\nc = []\r\ns=0\r\nfor i in b[:-1]:\r\n s+=i\r\n c.append(s)\r\nc.sort()\r\na.sort()\r\nans = 0\r\nfor i in range(n):\r\n ans += a[i]*c[i]\r\nprint(ans)\r\n", "# read in\r\nn, q = map(int, input().split())\r\narr = sorted(map(int, input().split()))\r\n\r\nranges = [0]*(n+1)\r\nfor _ in range(q):\r\n l, r = map(int, input().split())\r\n ranges[l-1] += 1\r\n ranges[r] -= 1\r\ndel ranges[-1]\r\n\r\n# ranges for each count\r\nfrequencies = {} # frequency: times\r\nfrequency = 0\r\nfor i in ranges:\r\n frequency += i\r\n frequencies[frequency] = frequencies.get(frequency, 0) + 1\r\n\r\n# sort ranges in reverse\r\nans = 0\r\ni = 0\r\n# print(frequencies)\r\nfor frequency, times in sorted(frequencies.items()):\r\n for _ in range(times):\r\n ans += arr[i] * frequency\r\n i += 1\r\nprint(ans)\r\n", "import sys \r\nimport math\r\nfrom functools import cmp_to_key\r\nfrom collections import OrderedDict\r\n \r\n \r\nsys.setrecursionlimit(10**9)\r\n \r\n \r\n \r\n \r\n \r\ndef solve():\r\n\r\n\r\n n,q = list(map(int,input().split()))\r\n\r\n arr = [int(x) for x in input().split()]\r\n\r\n\r\n count = [0 for i in range(n+1)]\r\n\r\n for i in range(q):\r\n\r\n l,r = list(map(int,input().split()))\r\n\r\n count[l-1] += 1 \r\n count[r] -= 1\r\n\r\n\r\n\r\n for i in range(1,n+1):\r\n\r\n count[i] += count[i-1]\r\n\r\n count.pop()\r\n count.sort()\r\n arr.sort()\r\n\r\n ans = 0 \r\n\r\n i = n - 1\r\n\r\n while i >= 0:\r\n\r\n ans += arr[i]*count[i]\r\n i -= 1 \r\n\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\nif __name__ == '__main__':\r\n \r\n \r\n solve()", "n, q = map(int, input().split())\na = list(map(int, input().split()))\nqs = []\ncnts = [0]*(n+1)\nfor _ in range(q):\n i, j = map(lambda x: int(x)-1, input().split())\n cnts[i] += 1\n cnts[j+1] -= 1\n\nfor _ in range(1, n):\n cnts[_] = cnts[_-1]+cnts[_]\n\ncnts = sorted(cnts[:n])\na.sort()\nans = sum([x*y for x, y in zip(a, cnts)])\nprint(ans)", "from sys import stdin, stdout\r\n\r\n\r\ndef next_line():\r\n return stdin.readline().rstrip()\r\n\r\n\r\ndef next_int():\r\n return int(next_line())\r\n\r\n\r\ndef out(text):\r\n stdout.write(str(text) + '\\n')\r\n\r\n\r\ndef main():\r\n n, m = map(lambda x: int(x), next_line().split())\r\n arr = list(map(lambda x: int(x), next_line().split()))\r\n reqs = []\r\n for i in range(m):\r\n reqs.append(tuple(map(lambda x: int(x), next_line().split())))\r\n out(solve(arr, n, reqs))\r\n\r\n\r\ndef solve(arr, n, reqs):\r\n count_dif = [0] * (n + 1)\r\n for l, r in reqs:\r\n count_dif[l - 1] += 1\r\n count_dif[r] -= 1\r\n frequencies = [0] * n\r\n cur_count = 0\r\n for i in range(n):\r\n cur_count += count_dif[i]\r\n frequencies[i] = cur_count\r\n sorted_arr = sorted(arr, reverse=True)\r\n sorted_freq = sorted(frequencies, reverse=True)\r\n\r\n result = 0\r\n for i in range(n):\r\n result += sorted_arr[i] * sorted_freq[i]\r\n return result\r\n\r\n\r\nmain()\r\n", "n,q=map(int,input().split())\narray=list(map(int,input().split()))\narray.insert(0,0)\noccurence=[0]*(n+1)\nfor i in range(q):\n a,b=map(int,input().split())\n occurence[b]+=1\n occurence[a-1]-=1\nfor i in range(n-1,-1,-1):\n occurence[i]+=occurence[i+1]\noccurence.sort(reverse=True)\narray.sort(reverse=True)\ntotal=0\n \nfor i in range(n+1):\n total+=occurence[i]*array[i]\nprint(total)\n \t\t\t\t \t \t\t \t\t \t \t\t\t\t\t \t", "n,q=map(int,input().split())\nz=list(map(int,input().split()))\nk=[0]*n\nfor i in range(q):\n l,r=map(int,input().split())\n l-=1\n \n \n k[l]+=1\n if(r<n):\n k[r]-=1\nfor i in range(1,n):\n k[i]=k[i-1]+k[i]\nz=sorted(z)[::-1]\nk=sorted(k)[::-1]\nans=0\nfor i in range(n):\n ans+=k[i]*z[i]\nprint(ans)\n ", "\"\"\"\r\n## NOTE\r\n- one solution is with binary indexed tree -> give NLogN time\r\n - we don't use it\r\n- interesting question in finding max number of overlaps between multiple ranges\r\n - kinda similar to line sweeping\r\n- hard\r\n\r\n## INFO\r\n276_C_LittleGirlAndMaximumSum\r\nhttps://codeforces.com/problemset/problem/276/C\r\n\r\n## TAGS\r\n- data structures\r\n- greedy\r\n- implementation\r\n- sortings\r\n- *1500\r\n\r\n## TESTS\r\n-in:\r\n3 3\r\n5 3 2\r\n1 2\r\n2 3\r\n1 3\r\n-out:\r\n25\r\n\r\nwe re-arrenge to [3, 5, 2]\r\n3+5=8\r\n5+2=7\r\n3+5+2=10\r\nsum:25\r\n\r\n\r\n-in:\r\n5 3\r\n5 2 4 1 3\r\n1 5\r\n2 3\r\n2 3\r\n-out:\r\n33\r\n\r\n\"\"\"\r\n\r\n#%%\r\n\r\nimport sys\r\nimport time\r\n\r\nstart_time = time.time()\r\nFILE = False\r\n\r\n# ---------------------- HELPER INPUT FUNCTIONS ----------------------#\r\n\r\n\r\ndef get_int():\r\n return int(sys.stdin.readline())\r\n\r\n\r\ndef get_str():\r\n return sys.stdin.readline().strip()\r\n\r\n\r\ndef get_list_int():\r\n return list(map(int, sys.stdin.readline().split()))\r\n\r\n\r\ndef get_list_str():\r\n return list(sys.stdin.readline().split())\r\n\r\n\r\n# -------------------------- SOLVE FUNCTION --------------------------#\r\n\r\n\r\ndef solve():\r\n \"\"\"\r\n the range with max overlap should have the larger numbers\r\n https://codeforces.com/contest/276/submission/117326267\r\n\r\n implementation is simple. find the max range and sort based on the max occurance to lowest\r\n\r\n 1------3\r\n 2------5\r\n\r\n 0 1 2 3 4 5 6\r\n [1 1 0 -1 0 -1 0] <- line sweep\r\n [1 2 2 1 1 0 0] <- pre-sum\r\n\r\n\r\n \"\"\"\r\n n, g = get_list_int()\r\n arr = get_list_int()\r\n\r\n cnt = [0] * n\r\n for _ in range(g):\r\n s, e = get_list_int()\r\n cnt[s - 1] += 1\r\n if e < n:\r\n cnt[e] -= 1\r\n\r\n for i in range(1, n):\r\n cnt[i] += cnt[i - 1]\r\n\r\n cnt.sort()\r\n arr.sort()\r\n print(sum(a * b for a, b in zip(cnt, arr)))\r\n\r\n\r\n# -------------------------- MAIN FUNCTION --------------------------#\r\n\r\n\r\ndef main():\r\n if FILE:\r\n sys.stdin = open(\"./src/codeforces/input.txt\", \"r\")\r\n\r\n solve()\r\n\r\n if FILE:\r\n print(\"\\033[95m\" + \"> time elapsed: \", (time.time() - start_time) * 1000.0, \"ms\")\r\n\r\n\r\nmain()\r\n", "\r\nif __name__=='__main__':\r\n nums = [int(i) for i in input().split(' ')]\r\n n = nums[0]\r\n q = nums[1]\r\n nums = [int(i) for i in input().split(' ')]\r\n \r\n nums = sorted(nums)\r\n \r\n indices = [0]*(n+1)\r\n \r\n while q:\r\n \r\n pos = [int(i) for i in input().split(' ')]\r\n l = pos[0]-1\r\n r = pos[1]\r\n \r\n indices[l]+=1\r\n indices[r]-=1\r\n \r\n q-=1\r\n \r\n for i in range(1, n+1):\r\n indices[i]+=indices[i-1]\r\n \r\n indices = sorted(indices[:n])\r\n \r\n # print(indices)\r\n \r\n sum = 0\r\n \r\n for i in range(n):\r\n sum+=nums[i]*indices[i]\r\n print(sum)", "n, q=[int(k) for k in input().split()]\r\nw=[int(k) for k in input().split()]\r\nz=[0 for j in range(n)]\r\nfor j in range(q):\r\n l, r=[int(k) for k in input().split()]\r\n z[l-1]+=1\r\n if r!=n:\r\n z[r]-=1\r\ny=[]\r\ndelta=0\r\nfor j in range(n):\r\n delta+=z[j]\r\n y.append(delta)\r\ny.sort(reverse=True)\r\nw.sort(reverse=True)\r\nres=0\r\nfor j in range(n):\r\n res+=y[j]*w[j]\r\nprint(res)", "n, q = list(map(int, input().split()))\r\narr = list(map(int, input().split()))\r\n\r\ndiff_array = [0] * (n + 1)\r\n\r\nfor _ in range(q):\r\n i, j = list(map(int, input().split()))\r\n diff_array[i - 1] += 1\r\n diff_array[j] -= 1\r\n\r\nnums = [diff_array[0]]\r\nfor i in range(1, n):\r\n nums.append(diff_array[i] + nums[-1])\r\n\r\nnums.sort()\r\narr.sort()\r\nres = 0\r\nfor i in range(n):\r\n res += nums[i] * arr[i]\r\nprint(res)\r\n", "def max_sum(arr,queries):\r\n pre=[0 for i in range(len(arr)+1)]\r\n arr.sort()\r\n for i in range(len(queries)):\r\n pre[queries[i][0]-1]+=1\r\n pre[queries[i][1]]-=1\r\n #print(pre)\r\n for i in range(1,len(pre)):\r\n pre[i]+=pre[i-1]\r\n pre.pop()\r\n pre.sort()\r\n \r\n # print(pre,arr)\r\n sum=0\r\n for i in range(len(arr)):\r\n sum+=(pre[i]*arr[i])\r\n return sum\r\nt=[int(i) for i in input().split()]\r\narr=[int(i) for i in input().split()]\r\nqueries=[]\r\nfor i in range(t[1]):\r\n b=[int(i) for i in input().split()]\r\n queries.append(b)\r\n\r\nprint(max_sum(arr,queries))\r\n", "n,q = [int(_) for _ in input().split()]\r\n\r\n\r\n\r\narr = [int(i) for i in input().split()]\r\n\r\n\r\nqueries = []\r\nfor _ in range(q):\r\n l,r = map(int, input().split())\r\n queries.append([l,r])\r\n\r\nMAX_NUM = 200200\r\na = [0]*(n+2)\r\n\r\nfor query in queries:\r\n l,r = query\r\n a[l] += 1\r\n a[r+1] -= 1\r\n\r\n\r\nfor i in range(1,n+2):\r\n a[i] += a[i-1]\r\n\r\na = a[1:]\r\na.sort()\r\narr.sort()\r\n\r\nans = 0\r\nfor i in range(n):\r\n ans += (a[i+1]*arr[i])\r\n\r\nprint(ans)", "import collections\r\n\r\nif __name__ == '__main__':\r\n n, q = list(map(int, input().strip().split()))\r\n a = list(map(int, input().strip().split()))\r\n preSum = [0] * (n + 1)\r\n for i in range(q):\r\n l, r = list(map(int, input().strip().split()))\r\n preSum[l - 1] += 1; preSum[r] -= 1\r\n for i in range(1, n + 1):\r\n preSum[i] += preSum[i - 1]\r\n dic = collections.defaultdict(int)\r\n for i in range(n):\r\n dic[i] = preSum[i]\r\n dic = dict(sorted(dic.items(), key=lambda k: -k[1]))\r\n a.sort(reverse=True)\r\n pos, res = 0, 0\r\n for cur in dic:\r\n res += dic[cur] * a[pos]\r\n pos += 1\r\n print(res)", "n,q = input().split()\r\nn = int(n)\r\nq = int(q)\r\nlst1 = list(map(int,input().split()))\r\ncount =[0 for i in range(n)]\r\nfor i in range(q):\r\n lst2 = list(map(int,input().split()))\r\n l = lst2[0]\r\n m = lst2[1]\r\n count[l-1] +=1\r\n if m != n:\r\n count[m] -=1\r\n \r\nfor i in range(1,n):\r\n count[i]+=count[i-1]\r\n\r\n# print(count)\r\n\r\ncount = list(sorted(count))\r\nlst1 = list(sorted((lst1)))\r\n\r\nans = 0\r\nfor i in range(n):\r\n ans += count[i]*lst1[i]\r\n\r\nprint(ans)", "n, q = map(int, input().split())\r\na = [int(i) for i in input().split()]\r\nb = [0]*(n+1)\r\nd = [0]*(n+1)\r\n\r\nfor i in range(q):\r\n l, r = map(int, input().split())\r\n b[l-1] += 1\r\n b[r] -= 1\r\n \r\nj = 0\r\nfor i in range(n+1):\r\n j += b[i]\r\n d[i] = j\r\n\r\n\r\na.sort()\r\nd.sort()\r\n\r\n#print(d)\r\n#print(a)\r\n\r\ns = 0\r\nfor i in range(n):\r\n s += a[i]*d[i+1]\r\n\r\nprint(s)\r\n", "n,q=map(int,input().split())\r\nlist1=list(map(int,input().split()))\r\nlist1.sort()\r\nans=0\r\ndict1={}\r\nlist2=[]\r\nfor i in range(n):dict1[i]=[0,0]\r\nfor _ in range(q):\r\n a,b=map(int,input().split())\r\n dict1[a-1][0]+=1;dict1[b-1][1]+=1\r\nx=0\r\nfor i in range(n):\r\n x+=dict1[i][0]\r\n list2.append(x)\r\n x-=dict1[i][1]\r\nlist2.sort()\r\nfor i in range(n):ans+=list1[i]*list2[i]\r\nprint(ans)", "import sys\n\n\ndef little_girl_and_maximum_sum(n: int, q: int):\n input = sys.stdin.readline\n arr = [int(x) for x in input().split()]\n d = [0 for _ in range(n)]\n for _ in range(q):\n left, right = map(int, input().split())\n d[left - 1] -= 1\n if right != n:\n d[right] += 1\n d[0] = -d[0]\n for i in range(1, n):\n d[i] = d[i - 1] - d[i]\n d.sort()\n arr.sort()\n res = 0\n for i in range(n):\n res += d[i] * arr[i]\n print(res)\n\n\ndef main():\n n, q = map(int, input().split())\n little_girl_and_maximum_sum(n, q)\n\n\nif __name__ == '__main__':\n main()\n", "n, q = map(int, input().split())\na = list(map(int, input().split()))\nlst = [0]*(n+1)\nfor i in range(q):\n l, r = map(int, input().split())\n lst[l-1] += 1\n lst[r] -= 1\np = [0]*n\nt = 0\nfor i in range(n):\n t += lst[i]\n p[i] = t\np.sort(reverse = True)\na.sort(reverse = True)\nans = 0\nfor i in range(n):\n ans += a[i]*p[i]\nprint(ans)\n", "n,q=map(int,input().split())\r\narr=[int(i) for i in input().split()]\r\npref=[0]*(n+1)\r\nfor _ in range(q):\r\n l,r=map(int,input().split())\r\n pref[l-1]+=1\r\n pref[r]-=1\r\nfor i in range(n):\r\n pref[i+1]+=pref[i]\r\npref.sort()\r\narr.sort()\r\nres=0\r\nfor i in range(n):\r\n res+=arr[i]*pref[i+1]\r\nprint(res)", "n, q = map(int, input().split())\r\narray = [0]\r\narray.extend(list(map(int, input().split())))\r\n\r\noccurence= [0] * (n + 1)\r\nfor i in range(q):\r\n a, b = map(int, input().split())\r\n occurence[b] += 1\r\n occurence[a - 1] -= 1\r\n\r\nfor i in range(n - 1, -1, -1):\r\n occurence[i] += occurence[i + 1]\r\n\r\noccurence.sort(reverse=True)\r\narray.sort(reverse=True)\r\ntotal = 0\r\nfor i in range(n + 1):\r\n total += occurence[i] * array[i]\r\nprint(total)", "import heapq,math\r\nfrom collections import defaultdict,deque\r\nfrom os import getcwd, kill\r\nfrom itertools import permutations\r\n\r\n\r\n \r\nimport sys, os.path\r\n#sys.setrecursionlimit(10000000)\r\n \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,q=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nfreq=[0 for _ in range(n+1)]\r\nqueries=[]\r\nfor i in range(q):\r\n a,b=map(int,input().split())\r\n a-=1\r\n b-=1\r\n freq[a]+=1\r\n freq[b+1]-=1\r\n queries.append([a,b])\r\nfor i in range(1,n):\r\n freq[i]+=freq[i-1]\r\nfreq.sort(reverse=True)\r\nl.sort(reverse=True)\r\nans=0\r\nfor i in range(n):\r\n ans+=freq[i]*l[i]\r\nprint(ans)\r\n", "n, q = map(int, input().split())\r\narr = list(map(int, input().split()))\r\nstore = [0 for i in range(n + 2)]\r\n\r\nfor i in range(q):\r\n l, r = map(int, input().split())\r\n store[l - 1] += 1\r\n store[r] -= 1\r\n\r\nfor i in range(n + 2):\r\n store[i] += store[i - 1]\r\n\r\nstore = store[:n]\r\nstore.sort()\r\narr.sort()\r\nres = 0\r\nfor i in range(n):\r\n res += arr[i] * store[i]\r\n\r\nprint(res)\r\n\r\n", "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\nclass FenwickTree: # zero indexed calls!\r\n def __init__(self, sz):\r\n self.data = [0]*(sz+1)\r\n def inc(self, i, delta):\r\n i += 1 # (to 1 indexing)\r\n while i < len(self.data):\r\n self.data[i] += delta\r\n i += i&-i # lowest oneBit\r\n def sum(self, i):\r\n i += 1 # (to 1 indexing)\r\n S = 0\r\n while i > 0:\r\n S += self.data[i]\r\n i -= i&-i\r\n return S\r\n def query(self, lo, hi):\r\n return self.sum(hi) - self.sum(lo)\r\n \r\n\r\nn, quer = nl()\r\na = nl()\r\ntree = FenwickTree(n+2)\r\nfor _ in range(quer):\r\n l, r = nl()\r\n tree.inc(l,1)\r\n tree.inc(r+1,-1)\r\n#now we have a tree that jhas the amount of times each thing was added\r\n#test\r\n#print(a)\r\na.sort()\r\nappeareances = []\r\nfor i in range(1,n+1):\r\n appeareances.append(tree.sum(i))\r\n \r\nappeareances.sort()\r\ntot = 0\r\nfor i in range(1,n+1):\r\n tot += appeareances[n-i] * a[n-i]\r\n\r\nprint(tot)\r\n", "from bisect import bisect_right, bisect_left\r\nfrom math import inf, gcd, sqrt, ceil, log2\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\nclass BIT:\r\n def __init__(self, n):\r\n self.n = n\r\n self.T = [0] * (self.n + 1)\r\n\r\n\r\n def range_update(self, l, r, x = 1):\r\n self.update(l, x)\r\n self.update(r + 1, -x)\r\n\r\n def update(self, i, x):\r\n i += 1\r\n while i <= self.n:\r\n self.T[i] += x\r\n i += i & -i\r\n\r\n def pref(self, i):\r\n i += 1\r\n tot = 0\r\n while i > 0:\r\n tot += self.T[i]\r\n i -= i & -i\r\n return tot\r\n\r\n \r\n'''Speed up'''\r\nimport sys\r\ninput = sys.stdin.readline\r\n\r\nn, q = rvar()\r\n\r\narr = rarr()\r\n\r\nbit = BIT(n)\r\n\r\nfor _ in range(q):\r\n l, r = rvar()\r\n l -= 1\r\n r -= 1\r\n bit.range_update(l, r)\r\n\r\nfreq = []\r\nfor i in range(n):\r\n freq.append(bit.pref(i))\r\n\r\nfreq.sort()\r\narr.sort()\r\nres = 0\r\n\r\nfor i in range(n):\r\n res += arr[i] * freq[i]\r\n\r\nprint(res)\r\n\r\n\r\n\r\n", "import math\r\nimport bisect\r\n\r\nipt = input().split()\r\n\r\nn = int(ipt[0])\r\nq = int(ipt[1])\r\n\r\nipt = input().split()\r\n\r\na = list(map(int, ipt))\r\n\r\nstarting = [0]* n\r\nending = [0]*n\r\n\r\nfor i in range(q):\r\n ipt = input().split()\r\n s = int(ipt[0])\r\n e = int(ipt[1])\r\n \r\n starting[s-1] += 1\r\n ending[e-1] += 1 \r\n \r\n# print(starting)\r\n# print(ending)\r\n\r\n\r\nindex = [0]*n\r\nx = 0\r\nfor i in range(n):\r\n x = x + starting[i]\r\n index[i] = x\r\n x = x - ending[i]\r\n \r\n#print(index) \r\n \r\n\r\nindex.sort()\r\na.sort()\r\n\r\n\r\ncnt = 0\r\nfor i in range(n):\r\n cnt += a[i] * index[i]\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 \r\n ", "line = input().split()\r\nn, q = [int(x) for x in line]\r\narr = input().split()\r\narr = [int(x) for x in arr]\r\n\r\n\r\narr.sort()\r\n\r\n# compute the number of time each num is used in a smart way\r\n# this is a linear time algo\r\ncounts = [0] * (n+1)\r\nfor i in range(q):\r\n line = input().split()\r\n l, r = [int(x) for x in line]\r\n l -= 1\r\n counts[l] += 1\r\n counts[r] -= 1\r\ncum_counts = [counts[0]]\r\nfor i in range(1, n):\r\n cum_counts.append(cum_counts[-1]+counts[i])\r\ncum_counts.sort()\r\n\r\n# compute final result\r\nresult = 0\r\nfor i in range(n):\r\n result += arr[i] * cum_counts[i]\r\nprint(result)\r\n" ]

[ "def main():\n n, m = map(int, input().split())\n bus = [[None for _ in range(4)] for _ in range(n)]\n half = 2 * n\n for i in range(0, 2 * n, 2):\n row = i // 2\n bus[row][0] = i + 1\n bus[row][3] = i + 2\n bus[row][1] = half + i + 1\n bus[row][2] = half + i + 2\n\n out = []\n for row in bus:\n if row[1] <= m:\n out.append(row[1])\n if row[0] <= m:\n out.append(row[0])\n if row[2] <= m:\n out.append(row[2])\n if row[3] <= m:\n out.append(row[3])\n\n print(' '.join(str(x) for x in out))\n\nmain()\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn, m = map(int, input().split())\r\nn = n*4\r\na = list(range(n//2+1, n+1))\r\nb = list(range(1, n//2+1))\r\nfor i in range(n//2):\r\n if a[i] <= m:\r\n print(a[i], end=' ')\r\n if b[i] <= m:\r\n print(b[i], end=' ')\r\n", "def solve(n,m):\n n = n*2 # Numero de pares \n k =1\n while(k <= n):\n if(n+k <=m):\n print(n+k,end=\" \")\n if(k <= m):\n print(k,end=\" \")\n k = k+1\n \n\nn,m = map(int,input(\"\").split())\nsolve(n,m)\n\n \t\t\t \t \t\t \t \t\t \t \t\t \t", "from collections import deque, defaultdict, Counter\r\nfrom itertools import product, groupby, permutations, combinations\r\nfrom math import gcd, floor, inf, log2, sqrt, log10\r\nfrom bisect import bisect_right, bisect_left\r\nfrom statistics import mode\r\nfrom string import ascii_uppercase\r\n\r\n\r\nn, m = map(int, (input().split()))\r\n\r\nif 2*n >= m:\r\n print(*[i for i in range(1, m+1)])\r\nelse:\r\n seats = [i for i in range(1, 2*n+1)]\r\n remained = [i for i in range(2*n+1, m+1)][::-1]\r\n ans = []\r\n\r\n for i, number in enumerate(seats):\r\n if remained:\r\n ans.append(remained.pop())\r\n ans.append(number)\r\n print(*ans)\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "n, m = map(int, input().split())\n\nif m <= 2*n:\n for i in range(m):\n print(i + 1, end=' ')\n print()\nelse:\n beg = 2*n + 1\n i = 1\n while beg <= m:\n print(beg, i, end=' ')\n beg += 1\n i += 1\n while i <= 2*n:\n print(i, end=' ')\n i += 1\n print()\n", "\r\nnum_inp=lambda: int(input())\r\narr_inp=lambda: list(map(int,input().split()))\r\nsp_inp=lambda: map(int,input().split())\r\nstr_inp=lambda:input()\r\nn, m = map(int, input().split())\r\nA = []\r\n\r\nfor i in range(1, 2*n, 2):\r\n A += [2*n+i, i, 2*n+i+1, i+1]\r\n\r\nprint(*(a for a in A if a<=m))", "n,m=map(int,input().split())\n\na=[[0,0] for i in range(n)]\nb=[[0,0] for i in range(n)]\n\ni=0\nbr=1\nj=0\nwhile m>0:\n a[i][j]=br\n br+=1\n m-=1\n if m>0:\n b[i][j]=br\n br+=1\n m-=1\n i+=1\n if i>=n:\n j+=1\n i=0\nrj=[]\nfor i in range(n):\n x=a[i][1]\n y=a[i][0]\n z=b[i][1]\n q=b[i][0]\n\n if x!=0:\n rj.append(x)\n if y!=0:\n rj.append(y)\n if z!=0:\n rj.append(z)\n if q!=0:\n rj.append(q)\n\nprint(*rj)\n \n\n\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 solve(n, m):\r\n A = []\r\n for i in range(n):\r\n A.append([0] * 4)\r\n cur = 1\r\n for i in range(n):\r\n A[i][0] = cur\r\n cur += 1\r\n A[i][3] = cur\r\n cur += 1\r\n for i in range(n):\r\n A[i][1] = cur\r\n cur += 1\r\n A[i][2] = cur\r\n cur += 1\r\n '''\r\n for i in range(n):\r\n print(A[i])\r\n '''\r\n B = []\r\n for i in range(n):\r\n B.append(A[i][1])\r\n B.append(A[i][0])\r\n B.append(A[i][2])\r\n B.append(A[i][3])\r\n C = []\r\n for a in B:\r\n if a <= m:\r\n C.append(a)\r\n return C\r\n\r\ndef main():\r\n n, m = map(int, input().split())\r\n ans = solve(n, m)\r\n print(' '.join(list(str(a) for a in ans)))\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n, k = map(int, input().split())\r\n\r\nm = [[-1 for i in range(4)] for j in range(n)]\r\n\r\nfor i in range(min(2*n, k)):\r\n if i % 2 == 0:\r\n m[i//2][0] = i\r\n else:\r\n m[i//2][3] = i\r\n \r\nfor i in range(k-2*n):\r\n if i % 2 == 0:\r\n m[i//2][1] = i + 2*n\r\n else:\r\n m[i//2][2] = i + 2*n\r\n \r\n# for li in m:\r\n# print(li)\r\n\r\nres = []\r\nfor i in range(n):\r\n for j in range(1, -1, -1):\r\n if m[i][j] != -1:\r\n res.append(m[i][j] + 1)\r\n for j in range(2, 4):\r\n if m[i][j] != -1:\r\n res.append(m[i][j] + 1)\r\n \r\nprint(*res)\r\n", "\n\n\nn, m = map(int, input().split())\n\nA = [list(range(1, 2 * n + 1, 2)),\n list(range(2 * n + 1, 4 * n + 1, 2)),\n list(range(2 * n + 2, 4 * n + 1, 2)),\n list(range(2, 2 * n + 1, 2))]\n\nB = [list(range(2, 4 * n + 1, 4)),\n list(range(1, 4 * n + 1, 4)),\n list(range(3, 4 * n + 1, 4)),\n list(range(4, 4 * n + 1, 4))]\n\nC = []\n\nfor i in range(4):\n for j in range(n):\n if A[i][j] <= m:\n C += [(B[i][j], A[i][j])]\n\nC.sort()\n\nprint(' '.join(map(str, [i for x, i in C])))\n", "n, m = map(int, input().split())\nA = [[0] * 4 for i in range(n + 1)]\n\nnow = 1\nfor i in range(1, n + 1):\n if now <= m: A[i][0] = now;now += 1\n if now <= m: A[i][3] = now;now += 1\nfor i in range(1, n + 1):\n if now <= m: A[i][1] = now;now += 1\n if now <= m: A[i][2] = now;now += 1\n\nfor i in range(1, n + 1):\n if A[i][1]: print(A[i][1], end=' ')\n if A[i][0]: print(A[i][0], end=' ')\n if A[i][2]: print(A[i][2], end=' ')\n if A[i][3]: print(A[i][3], end=' ')\n\n\t\t\t \t \t \t\t \t\t \t\t \t \t\t\t", "m,n=map(int,input().split())\r\nr=[]\r\nx=2*m\r\nfor i in range(1,x+1):\r\n if i+2*m<=n:r+=[i+x]\r\n if i<=n:r+=[i]\r\nprint(*r) ", "n, m = map(int, input().split())\n\nn_seat = 2*n+1\nif m <= 2*n:\n for i in range(1,m+1):\n print(i, end=\" \")\nelse:\n for i in range(1, 2*n + 1):\n if n_seat <= m:\n print(n_seat, end=\" \")\n n_seat+=1\n print(i, end=\" \")\n\t\t \t\t\t\t\t\t \t \t\t\t \t \t\t\t\t \t \t\t\t", "n,m=[int(x) for x in input().split()]\r\nk=4*n\r\nlst=[]\r\nfor i in range(2*n+1,3*n+1):\r\n lst.append(i)\r\n lst.append(i-2*n)\r\nfor i in range(3*n+1,4*n+1):\r\n lst.append(i)\r\n lst.append(i-2*n)\r\nfor i in lst:\r\n if i<=m:\r\n print(i,end=' ')", "n, m = map(int, input().split())\r\nA = []\r\n\r\nfor i in range(1, 2*n, 2):\r\n A += [2*n+i, i, 2*n+i+1, i+1]\r\n\r\nprint(*(a for a in A if a<=m))", "a = [int(i) for i in input().split()]\r\n\r\nsign = 0\r\nb = []\r\nc = []\r\n\r\nfor i in range(0, a[0]):\r\n b.append(1 + 4*i)\r\n b.append(1 + 4*i + 3)\r\n\r\nfor i in range(1, a[0]+1):\r\n b.append(1 + 4*i - 3)\r\n b.append(1 + 4*i - 2)\r\n\r\n\r\nfor i in range(4*a[0]):\r\n if i > (a[1] - 1):\r\n b[i] = 0\r\n\r\nfor i in range(0, a[0]):\r\n if (1 + 4 * i + 1) in b:\r\n c.append(b.index(1 + 4 * i + 1) + 1)\r\n if (1 + 4 * i) in b:\r\n c.append(b.index(1 + 4 * i) + 1)\r\n if (1 + 4 * i + 2) in b:\r\n c.append(b.index(1 + 4 * i + 2) + 1)\r\n if (1 + 4 * i + 3) in b:\r\n c.append(b.index(1 + 4 * i + 3) + 1)\r\n\r\nfor i in c:\r\n print(i, end=\" \")", "\nn, m = list( map(int, input().split()) )\n\n\nprinted=0\nfor row in range(n):\n\tif (2*row + 2*n + 1 <= m):\n\t\tprint(\" \"*printed + str(2*row + 2*n + 1),end=\"\")\n\t\tprinted = 1\n\tif (2*row + 1 <= m):\n\t\tprint(\" \"*printed + str(2*row+1),end=\"\")\n\t\tprinted = 1\n\tif (2*row + 2*n + 2 <= m):\n\t\tprint(\" \"*printed + str(2*row + 2*n + 2),end=\"\")\n\t\tprinted = 1\n\tif (2*row + 2 <= m):\n\t\tprint(\" \"*printed + str(2*row+2),end=\"\")\n\t\tprinted = 1\nprint()\n\n\t\t\t \t\t \t \t\t\t\t \t\t\t \t\t \t\t \t\t\t", "import sys\r\n\r\nn, m = map(int, input().split())\r\nseat = [[0, 0, 0, 0] for _ in range(n)]\r\ni = 1\r\nfor j in range(n):\r\n if i <= m:\r\n seat[j][0] = i\r\n i += 1\r\n if i <= m:\r\n seat[j][-1] = i\r\n i += 1\r\nfor j in range(n):\r\n if i <= m:\r\n seat[j][1] = i\r\n i += 1\r\n if i <= m:\r\n seat[j][2] = i\r\n i += 1\r\n\r\nans = []\r\nfor i in range(n):\r\n for j in (1, 0, 2, 3):\r\n if seat[i][j] != 0:\r\n ans.append(seat[i][j])\r\n\r\nprint(*ans)\r\n", "line = input()\r\nn = int(line.split()[0])\r\nm = int(line.split()[1])\r\n\r\n# n = 2\r\n# m = 8\r\n# print(n, m)\r\n\r\nseats = [ [ None for column in range( 4 ) ] for row in range( n ) ]\r\n\r\ndef entry_state_transition(col, row):\r\n if col == 0:\r\n col = 3\r\n elif col == 3:\r\n col = 0\r\n row += 1\r\n elif col == 1:\r\n col = 2\r\n elif col == 2:\r\n col = 1\r\n row += 1\r\n\r\n if row == n:\r\n row = 0\r\n col += 1\r\n return (col, row)\r\n\r\ndef exit_state_transition(col, row):\r\n if col == 1:\r\n col = 0\r\n elif col == 0:\r\n col = 2\r\n elif col == 2:\r\n col = 3\r\n elif col == 3:\r\n col = 1\r\n row += 1\r\n return (col, row)\r\n\r\nrow = 0\r\ncol = 0\r\n# print('Passengers are entering')\r\nfor i in range(m):\r\n seats[row][col] = i + 1\r\n # print(row, col, i + 1)\r\n col, row = entry_state_transition(col, row)\r\n\r\n# print(seats)\r\n\r\n# print('Passengers are exiting')\r\nrow = 0\r\ncol = 1\r\nfor i in range(m):\r\n while seats[row][col] is None:\r\n col, row = exit_state_transition(col, row)\r\n print(seats[row][col], end=' ')\r\n col, row = exit_state_transition(col, row)\r\n\r\n", "n, m = map(int, input().split())\r\n\r\nx, p = 0, 0\r\ns = \"\"\r\n\r\nwhile p < m:\r\n\tx += 1\r\n\t\r\n\tif (n * 2) + x > m:\r\n\t\ts1 = \"\"\r\n\t\tp += 1\r\n\telse:\r\n\t\ts1 = str((n * 2) + x) + \" \"\r\n\t\tp += 2\r\n\t\t\t\r\n\ts = s + s1 + str(x) + \" \"\r\n\t\r\nprint(s[:-1])", "def main():\n rows, p = map(int, input().split())\n\n if 2*rows >= p:\n for i in range(1, p+1):\n print(f'{i}', end=\" \")\n else:\n count = 1\n count2 = 2*rows + 1\n p_total = p\n\n while p_total != 0:\n if(count2 <= p):\n print(f'{count2}', end=\" \")\n count2 += 1\n p_total -= 1\n print(f'{count}', end=\" \")\n count += 1\n p_total -= 1\n\nmain()\n\t \t \t\t \t\t \t \t \t\t \t \t \t\t\t \t\t", "n, m = map(int, input().split())\nbus = [[0 for _ in range(4)] for _ in range(n)]\n\nj = 1\nidx = [0, 3]\nfor _ in range(2):\n i = n-1\n while i >= 0:\n for idx_n in idx:\n if j <= m:\n bus[i][idx_n] = j\n j += 1\n i -= 1\n idx = [1, 2]\n\nres = \"\"\nfor row in reversed(bus):\n row[1], row[0] = row[0], row[1]\n for person in row:\n if person != 0:\n res += str(person) + ' '\n\nprint(res.rstrip())\n \t \t\t \t \t \t \t\t\t \t \t \t\t", "pairs , passa = map(int,input().split(\" \"))\n\ndata = []\n\ni=0\n \nwhile i <= 2 * (pairs-1):\n\n if 2*pairs + 1 + i <=passa:\n data.append(2 * pairs + 1 + i)\n\n if 1+i <=passa:\n data.append(1+i)\n\n if 2*pairs + 2 + i <= passa:\n data.append(2*pairs+2+i)\n\n if 2+i <= passa:\n data.append(2+i)\n \n i += 2\n\nprint(\" \".join(map(str, data)))\n \t\t\t \t\t \t\t \t \t \t \t\t\t \t\t", "n,m = map(int,input().split())\r\nfor i in range(1,2*n+1):\r\n if n*2+i<=m:\r\n print(n*2+i,end=' ')\r\n if i<=m:\r\n print(i,end=' ')", "from collections import Counter\r\n\r\nn, k = list(map(lambda x: int(x), input().split()))\r\nresult = []\r\nwindow = 1\r\nnon_window = 2*n +1\r\n\r\nfor row in range(1, n+1):\r\n temp = []\r\n temp.append(non_window)\r\n temp.append(window)\r\n temp.append(non_window+1)\r\n temp.append(window+1)\r\n window+=2\r\n non_window+=2\r\n for elem in temp:\r\n if elem > k:\r\n continue\r\n result.append(elem)\r\n\r\nresult = list(map(lambda x: str(x), result))\r\nprint(\" \".join(result))", "n, m = list(map(int, input().split()))\r\n\r\npass_n = m\r\noccupied_seats = 1\r\nwindows_seats_left = list()\r\nwindows_seats_right = list()\r\nnon_windows_seats_left = list()\r\nnon_windows_seats_right = list()\r\n\r\nwhile occupied_seats <= 2 * n and m > 0:\r\n if occupied_seats % 2 != 0:\r\n windows_seats_left.append(occupied_seats)\r\n else:\r\n windows_seats_right.append(occupied_seats)\r\n occupied_seats += 1\r\n m -= 1\r\n\r\nwhile occupied_seats <= 4 * n and m > 0:\r\n if occupied_seats % 2 != 0:\r\n non_windows_seats_left.append(occupied_seats)\r\n else:\r\n non_windows_seats_right.append(occupied_seats)\r\n occupied_seats += 1\r\n m -= 1\r\n\r\nexit_order = list()\r\nfor i in range(pass_n):\r\n if i < len(non_windows_seats_left):\r\n exit_order.append(non_windows_seats_left[i])\r\n if i < len(windows_seats_left):\r\n exit_order.append(windows_seats_left[i])\r\n if i < len(non_windows_seats_right):\r\n exit_order.append(non_windows_seats_right[i])\r\n if i < len(windows_seats_right):\r\n exit_order.append(windows_seats_right[i])\r\n\r\nfor i in exit_order:\r\n print(i)\r\n", "n, m = input().split()\nn, m = int(n), int(m)\narr = [[0]*n, [0]*n, [0]*n, [0]*n]\npassenger=1\nfor i in range(n):\n arr[0][i] = passenger+(2*n)\n arr[1][i] = passenger\n arr[2][i] = passenger+(2*n)+1\n arr[3][i] = passenger+1\n passenger += 2\n\nfor i in range(n):\n for j in range(4):\n if(arr[j][i]<=m):\n print(arr[j][i], end=' ')\nprint('\\n')\n\t \t\t \t \t\t\t\t\t \t \t \t \t\t\t\t\t\t\t\t", "nm = [int(el) for el in input().split()]\nn,m = nm[0],nm[1]\n\nf1 = [0 for _ in range(n)]\nf2 = [0 for _ in range(n)]\nf3 = [0 for _ in range(n)]\nf4 = [0 for _ in range(n)]\n\n#everbody gets in bus\nctd = 1\n\nix = 0\nwhile ix < n:\n if ctd > m:\n break\n\n if f1[ix] == 0:\n f1[ix] = ctd\n ctd += 1\n elif f4[ix] == 0:\n f4[ix] = ctd\n ctd += 1\n else:\n ix += 1\n\nix = 0\nwhile ix < n:\n if ctd > m:\n break\n\n if f2[ix] == 0:\n f2[ix] = ctd\n ctd += 1\n elif f3[ix] == 0:\n f3[ix] = ctd\n ctd += 1\n else:\n ix += 1\n\n#everbody get out\nctd = m\nstrRes = \"\"\n\ni = 0\nwhile ctd > 0:\n if i >= n:\n break\n\n if not f2[i] == 0:\n strRes += f' {f2[i]}'\n f2[i] = 0\n ctd -= 1\n elif not f1[i] == 0:\n strRes += f' {f1[i]}'\n f1[i] = 0\n ctd -= 1\n elif not f3[i] == 0:\n strRes += f' {f3[i]}'\n f3[i] = 0\n ctd -= 1\n elif not f4[i] == 0:\n strRes += f' {f4[i]}'\n f4[i] = 0\n ctd -= 1\n else:\n i += 1\n\nprint(strRes.lstrip())\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\n\r\nfor i in range(1,n+1):\r\n if(2*n+2*i-1 <= m):\r\n print(2*n+2*i-1, end=\" \")\r\n if(2*i-1 <= m):\r\n print(2*i-1, end=\" \")\r\n if(2*n+2*i <= m):\r\n print(2*n+2*i, end=\" \")\r\n if(2*i <= m):\r\n print(2*i, end=\" \")\r\n\r\n", "n, m = list(map(int, input().split()))\nbus = [[2*i-1, 2*n+2*i-1, 2*n+2*i, 2*i] for i in range(1, n+1)]\nfor line in bus:\n line[1], line[0] = line[0], line[1]\nexit_seq = [man for line in bus for man in line if man <= m]\nfor _ in exit_seq[:len(exit_seq)-1]:\n print(_, end=' ')\nprint(exit_seq[-1])\n\n \t\t\t\t\t\t \t\t\t \t \t\t\t \t\t\t\t\t", "from turtle import right\n\n\nn, m = map(int, input().split())\n\nleftWindow = []\nrightWindow = []\nleftNoWindow = []\nrightNoWindow = []\n\nfor i in range(1,m+1):\n if(i%2==0):\n if(len(rightWindow)<n):\n rightWindow.append(i)\n else:\n rightNoWindow.append(i)\n else:\n if(len(leftWindow)<n):\n leftWindow.append(i)\n else:\n leftNoWindow.append(i)\n\nfor j in range(n):\n if(j<len(leftNoWindow)):\n print(leftNoWindow[j], end =\" \")\n if(j<len(leftWindow)):\n print(leftWindow[j], end =\" \")\n if(j<len(rightNoWindow)):\n print(rightNoWindow[j], end =\" \")\n if(j<len(rightWindow)):\n print(rightWindow[j], end =\" \")\n\n\n\t\t\t \t \t\t\t\t\t\t\t\t\t \t \t \t\t\t\t\t\t", "class onibus:\n def __init__ (self, numAssento):\n self.numAssento = numAssento\n self.fAtEmb = None\n self.ladEmb = None\n self.passageirosL = {}\n self.passageirosR = {}\n self.janEmb = None\n self.tEmb = 0\n def sentarNaFila(self, vet, passageiro):\n aux = vet.copy()\n aux.insert(0,passageiro)\n return aux\n def embarcarPassageirro(self, v):\n if self.fAtEmb == None:\n self.fAtEmb = 1\n self.ladEmb = 'left'\n self.janEmb = True\n self.tEmb = 1\n self.passageirosL['1'] = [v]\n elif self.fAtEmb > int(self.numAssento) and self.ladEmb == 'right':\n self.fAtEmb = 1\n self.ladEmb = 'left'\n self.janEmb = False\n self.tEmb = self.tEmb + 1\n self.passageirosL['1'] = self.sentarNaFila(self.passageirosL['1'], v)\n elif self.ladEmb == 'left':\n self.ladEmb = 'right'\n self.tEmb = self.tEmb + 1\n if self.janEmb:\n self.passageirosR[str(self.fAtEmb)] = [v]\n else:\n self.passageirosR[str(self.fAtEmb)] = self.sentarNaFila(self.passageirosR[str(self.fAtEmb)], v)\n self.fAtEmb = self.fAtEmb + 1\n else:\n self.ladEmb = 'left'\n self.tEmb = self.tEmb +1\n\n if self.janEmb:\n self.passageirosL[str(self.fAtEmb)] = [v]\n else:\n self.passageirosL[str(self.fAtEmb)] = self.sentarNaFila(self.passageirosL[str(self.fAtEmb)], v)\n\n def desembarcarAssento(self, assento):\n ret =''\n if len(assento) == 2:\n ret = str(assento[0]) + ' ' + str(assento[1])\n elif len(assento) == 1:\n ret = str(assento[0])\n return ret\n def desembarque(self):\n ret = ''\n for i in range(int(self.numAssento) + 1):\n if str(i+1) in self.passageirosL:\n ret = ret +\" \" + self.desembarcarAssento(self.passageirosL[str(i+1)])\n if str(i+1) in self.passageirosR:\n ret = ret + \" \" + self.desembarcarAssento(self.passageirosR[str(i+1)])\n\n return ret\n\n\n\n\nl = input().split()\nn = l[0]\nm = l[1]\non = onibus(n)\n\nfor i in range(int(m)):\n on.embarcarPassageirro(i+1)\nprint(on.desembarque().strip())\n\t \t \t\t \t \t\t\t \t\t\t \t\t \t", "#!/usr/bin/env python3\n# -*- coding: utf-8 -*-\n\"\"\"\nCreated on Wed Jul 1 11:43:26 2020\n\n@author: shailesh\n\"\"\"\n\nimport math\nn,m = [int(i) for i in input().split()]\n\nl = [i+1 for i in range(m)]\n\nl.sort(key = lambda x: ((((x-1)%(2*n))//2),1-x%2,int(x < 2*n + 1) ))\n\nprint(' '.join([str(i) for i in l]))", "\r\nn,m = map(int,input().split())\r\ncount = 0\r\nx = 0\r\nfor i in range(4*n):\r\n\tif count<(m) and (2*n+1+x < m+1):\r\n\t\tprint(2*n+1+x,end = \" \")\r\n\t\tcount += 1\r\n\tif count<(m):\r\n\t\tprint(x+1,end = \" \")\r\n\t\tcount += 1\r\n\telse:\r\n\t\tbreak\r\n\tx += 1\r\n\t\r\n\t\t", "n, m = map(int, input().split())\r\n\r\nhas = []\r\nfor i in range(n):\r\n a = 2 * n + 1 + 2 * i\r\n b = 2 * i + 1\r\n c = 2 * n + 2 + 2 * i\r\n d = 2 * i + 2\r\n\r\n if a <= m:\r\n has.append(a)\r\n if b <= m:\r\n has.append(b)\r\n if c <= m:\r\n has.append(c)\r\n if d <= m:\r\n has.append(d)\r\n\r\nprint(*has)\r\n", "import sys\r\nimport math\r\nimport collections\r\nfrom pprint import pprint as pp\r\nmod = 998244353\r\nMAX = 10**15\r\n\r\n\r\ndef inp():\r\n return map(int, input().split())\r\n\r\n\r\ndef array():\r\n return list(map(int, input().split()))\r\n\r\n\r\ndef vector(size, val=0):\r\n vec = [val for i in range(size)]\r\n return vec\r\n\r\n\r\ndef matrix(rowNum, colNum, val=0):\r\n mat = []\r\n for i in range(rowNum):\r\n collumn = [val for j in range(colNum)]\r\n mat.append(collumn)\r\n return mat\r\n\r\n\r\nn, m = inp()\r\na = matrix(n, 4)\r\nj = 0\r\ntemp = 1\r\nfor i in range(m):\r\n if i < 2 * n:\r\n a[j][temp] = i + 1\r\n temp = (temp + 2) % 4\r\n else:\r\n a[j][temp - 1] = i + 1\r\n temp = (temp + 2) % 4\r\n if temp == 1:\r\n j = (j + 1) % n\r\n\r\ni, j = 0, 0\r\ntemp = 0\r\nwhile i < m:\r\n if a[j][temp] != 0:\r\n print(a[j][temp], end=' ')\r\n i += 1\r\n temp = (temp + 1) % 4\r\n if temp == 0:\r\n j += 1\r\n", "a, b = [int(x) for x in input().split()]\n# for i in range(b-1):\n# \tif(i%2 == 0):\n# \t\tprint(a*2+1+i//2, end=\" \")\n# \telse:\n# \t\tprint(1+i//2, end=\" \")\n# print(1+(b-1)//2)\narr = []\nfor i in range(a):\n\tarr.append([0, 0, 0, 0])\n\nfor i in range(b):\n\tif(i < a*2):\n\t\tif(i % 2 == 0):\n\t\t\tarr[i//2][0] = i+1\n\t\telse:\n\t\t\tarr[i//2][3] = i+1\n\telse:\n\t\tif(i % 2 == 0):\n\t\t\tarr[(i-a*2)//2][1] = i+1\n\t\telse:\n\t\t\tarr[(i-a*2)//2][2] = i+1\n\nfor i in range(len(arr)):\n\tif(arr[i][1] != 0):\n\t\tprint(arr[i][1], end=\" \")\n\tif(arr[i][0] != 0):\n\t\tprint(arr[i][0], end=\" \")\n\tif(arr[i][2] != 0):\n\t\tprint(arr[i][2], end=\" \")\n\tif(arr[i][3] != 0):\n\t\tprint(arr[i][3], end=\" \")\n\n", "a,b = map(int,input().split())\nc = []\ne = \"\"\nfor x in range(1,b + 1):\n\tc.append(x)\nif b == 1:\n\tprint(b)\nelse:\t\n\tfor x in range(a * 2):\n\t\tif x > b - 1:\n\t\t\tbreak\n\t\tif x + (2 * a) <= b - 1:\n\t\t\te += str(c[x + (2 * a)]) + \" \"\n\t\te += str(c[x]) + \" \"\nprint(e[:-1])", "n,m = list(map(int, input().strip().split()))\r\n\r\nre = []\r\n\r\nif m <= 2*n:\r\n for i in range(1, m+1):\r\n re.append(i)\r\nelse:\r\n for i in range(1, 2*n+1):\r\n if m >= i + 2*n:\r\n re.append(i + 2*n)\r\n re.append(i)\r\n else:\r\n re.append(i)\r\nprint(\" \".join(map(str, re)))", "n,m=map(int,input().split())\r\nq=n*2\r\nfor i in range(1,q+1):\r\n\tif i+q<=m:print(i+q,end=' ')\r\n\tif i<=m:print(i,end=' ')", "\r\ndef main_function():\r\n n, m = [int(i) for i in input().split(\" \")]\r\n bus = [[[0 for i in range(n)] for h in range(2)] for p in range(2)]\r\n passenger_count = 0\r\n for i in range(1, m + 1):\r\n passenger_count += 1\r\n if passenger_count <= 2 * n:\r\n if passenger_count % 2 != 0:\r\n bus[0][0][(passenger_count - 1) // 2] = i\r\n else:\r\n bus[-1][-1][(passenger_count // 2) - 1] = i\r\n else:\r\n if passenger_count % 2 != 0:\r\n bus[0][-1][(passenger_count - 2 * n - 1) // 2] = i\r\n else:\r\n bus[-1][0][((passenger_count - 2 * n) // 2) - 1] = i\r\n indices = [[0,-1], [0, 0], [-1, 0], [-1, -1]]\r\n korea = []\r\n for i in range(n):\r\n for k in indices:\r\n if bus[k[0]][k[1]][i] != 0:\r\n korea.append(bus[k[0]][k[1]][i])\r\n print(\" \".join([str(i) for i in korea]))\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, m = [int(i) for i in input().split()]\r\nwl, wr, nwl, nwr = [], [] , [], []\r\nvisited = set()\r\nfor i in range(2*n+1, m+1, 2): \r\n if i not in visited : nwl.append(i); visited.add(i)\r\nfor i in range(1, m+1, 2):\r\n if i not in visited : wl.append(i); visited.add(i)\r\nfor i in range(2*n+2, m+1, 2):\r\n if i not in visited : nwr.append(i); visited.add(i)\r\nfor i in range(2, m+1, 2): \r\n if i not in visited : wr.append(i); visited.add(i)\r\nfor i in range(max(len(wl), len(wr), len(nwl), len(nwr))): \r\n if i < len(nwl): print(nwl[i], end = ' ') \r\n if i < len(wl) : print(wl[i], end = ' ') \r\n if i < len(nwr) : print(nwr[i], end = ' ') \r\n if i < len(wr) : print(wr[i], end = ' ') \r\n", "n, m = map(int, input().split())\r\na = [0]\r\nfor i in range(m):\r\n a.append(i + 1)\r\na = a + [0] * (4 * n - m)\r\nfor i in range(2 * n + 1, 4 * n + 1, 2):\r\n if a[i]:\r\n print(i, end=' ')\r\n if a[i - 2 * n]:\r\n print(i - 2 * n, end=' ')\r\n if a[i + 1]:\r\n print(i + 1, end=' ')\r\n if a[i + 1 - 2 * n]:\r\n print(i + 1 - 2 * n, end=' ')\r\n", "n, m = map(int, input().split())\r\n\r\na1= []\r\na2 = []\r\na3 = []\r\na4 = []\r\n\r\nfor i in range(1, (2*n) +1):\r\n if i % 2 == 0:\r\n \r\n a2.append(i)\r\n else:\r\n a1.append(i)\r\nfor i in range((2*n)+1, (4*n) + 1):\r\n if i % 2 != 0:\r\n a3.append(i)\r\n else:\r\n a4.append(i)\r\nl = []\r\n\r\nfor i in range(n):\r\n \r\n \r\n if a3[i] > m:\r\n pass\r\n else:\r\n l.append(a3[i])\r\n \r\n if a1[i] > m:\r\n pass\r\n else:\r\n l.append(a1[i])\r\n\r\n if a4[i] > m:\r\n pass\r\n else:\r\n l.append(a4[i])\r\n\r\n if a2[i] > m:\r\n pass\r\n else:\r\n l.append(a2[i])\r\nprint(*l)\r\n", "[n,m]=list (map (int, input().split(\" \")))\r\nl=[]\r\nfor i in range(1,n+1):\r\n if 2*(n+i)-1<=m: l.append(2*(n+i)-1);\r\n if 2*i-1<=m: l.append(2*i-1) ;\r\n if 2*(n+i)<=m: l.append(2*(n+i)) ;\r\n if 2*i<=m: l.append(2*i);\r\nprint(*l)", "n, m = map(int, input().split())\r\nfor i in range(1, n+1):\r\n\ta, b, c, d = 2 * n + 2 * i -1, 2 * i -1, 2 * n + 2 * i, 2 * i\r\n\tif a <= m:\r\n\t\tprint(a, end = \" \") \r\n\t\t\r\n\tif b <= m:\r\n\t\tprint(b, end = \" \") \r\n\t\t\r\n\tif c <= m:\r\n\t\tprint(c, end = \" \") \r\n\t\t\r\n\tif d <= m:\r\n\t\tprint(d, end = \" \") \r\n\t\t\r\n", "n,m=map(int,input().split())\r\nmp=[[0 for i in range(n)]for j in range(4)]\r\ncnt=1\r\nfor i in range(n):\r\n mp[0][i]=cnt\r\n cnt+=1\r\n mp[-1][i]=cnt\r\n cnt+=1\r\nfor i in range(n):\r\n mp[1][i]=cnt\r\n cnt+=1\r\n mp[2][i]=cnt\r\n cnt+=1\r\nls=[]\r\nfor i in range(n):\r\n ls.append(mp[1][i])\r\n ls.append(mp[0][i])\r\n ls.append(mp[2][i])\r\n ls.append(mp[3][i])\r\nfor i in range(len(ls)):\r\n if ls[i]<=m:\r\n print(ls[i],end=\" \")", "n, m = map(int, input().split())\r\n\r\na = list(range(1, min(n * 2, m) + 1))\r\nb = list(range(n * 2 + 1, m + 1))\r\nwhile a or b:\r\n if b:\r\n print(b.pop(0), end=' ')\r\n if a:\r\n print(a.pop(0), end=' ')", "n,m=map(int,input().split())\r\nr=[]\r\nfor i in range(n):\r\n l=[2*n+1+i*2,1+i*2]\r\n r+=l+[l[0]+1,l[1]+1]\r\nfor x in r:\r\n if x<=m:print(x,end=\" \")", "import math\r\nfrom collections import deque\r\n\r\n\r\nalfabet = {'a': 1, 'b': 2,'c': 3,'d': 4,'e': 5,'f': 6,'g': 7,'h': 8,'i': 9,'j': 10,'k': 11,'l': 12,'m': 13,'n': 14,'o': 15,'p': 16,'q': 17,'r': 18,'s': 19,'t': 20,'u': 21,'v': 22,'w': 23,'x': 24,'y': 25,'z': 26}\r\nrasp=''\r\n#c=int(input())\r\nfor i in range(0,1):\r\n n,m=map(int,input().split())\r\n #n=int(input())\r\n #print(n,a,b)\r\n #stringul=input()\r\n \r\n #lista=list(map(int,input().split()))\r\n #lista.sort()\r\n #primul=str(lista[0])\r\n \r\n first_elem=2*n+1\r\n \r\n for i in range(0,n):\r\n \r\n a=first_elem+i*2\r\n b=i*2+1\r\n c=(first_elem+1)+i*2\r\n d=i*2+2\r\n \r\n if a<=m:\r\n print(a, end=' ')\r\n if b<=m:\r\n print(b, end=' ')\r\n if c<=m:\r\n print(c, end =' ')\r\n if d<=m:\r\n print(d, end=' ')\r\n \r\n \r\n \r\n \r\n#print(rasp) ", "n,m = map(int, input().split())\r\ntotal = n * 4\r\np = [None] * total\r\nanswer = []\r\n\r\nidx = 0\r\nfor i in range(1, total // 2, 2):\r\n p[idx] = i\r\n idx += 4\r\n\r\nidx = 1\r\nfor i in range(total // 2 + 1, total, 2):\r\n p[idx] = i\r\n idx += 4\r\n\r\nidx = 2\r\nfor i in range(total // 2 + 2, total+1, 2):\r\n p[idx] = i\r\n idx += 4\r\n\r\nidx = 3\r\nfor i in range(2, total // 2 + 1, 2):\r\n p[idx] = i\r\n idx += 4\r\n\r\nidx = 1\r\nfor i in range(n):\r\n answer.append(p[idx])\r\n answer.append(p[idx-1])\r\n answer.append(p[idx+1])\r\n answer.append(p[idx+2])\r\n idx += 4\r\n\r\nanswer = [i for i in answer if i <= m]\r\n\r\nprint(\" \".join(map(str, answer[:m])))", "n , m = map(int , input().split())\r\narr = [[0 , 0 , 0, 0] for i in range(n)]\r\n\r\ni = 1\r\npos = 0\r\nwhile 1:\r\n if i > m or pos==n: break\r\n if i <= m:\r\n arr[pos][0] = i\r\n i+=1\r\n if i <= m:\r\n arr[pos][3] = i\r\n i+=1\r\n pos +=1\r\n\r\npos = 0\r\nwhile 1:\r\n if i > m or pos == n: break\r\n if i <= m:\r\n arr[pos][1] = i\r\n i+=1\r\n if i <= m:\r\n arr[pos][2] = i\r\n i+=1\r\n pos +=1\r\n\r\n\r\n\r\nfor i in arr:\r\n if i[1]: print(i[1] , end = \" \")\r\n if i[0]: print(i[0] , end = \" \")\r\n if i[2]: print(i[2] , end = \" \")\r\n if i[3]: print(i[3] , end = \" \")\r\n\r\n", "\r\ndef STR(): return list(input())\r\ndef INT(): return int(input())\r\ndef MAP(): return map(int, input().split())\r\ndef MAP2():return map(float,input().split())\r\ndef LIST(): return list(map(int, input().split()))\r\ndef STRING(): return input()\r\nimport string\r\nimport sys\r\nfrom heapq import heappop , heappush\r\nfrom bisect import *\r\nfrom collections import deque , Counter , defaultdict\r\nfrom math import *\r\nfrom itertools import permutations , accumulate\r\ndx = [-1 , 1 , 0 , 0 ]\r\ndy = [0 , 0 , 1 , - 1]\r\n#visited = [[False for i in range(m)] for j in range(n)]\r\n#sys.stdin = open(r'input.txt' , 'r')\r\n#sys.stdout = open(r'output.txt' , 'w')\r\n#for tt in range(INT()):\r\n\r\n\r\n#CODE\r\n\r\nn , m = MAP()\r\n\r\nodd = []\r\neven =[]\r\nfor i in range(1 , m + 1):\r\n if i % 2 == 0 :\r\n even.append(i)\r\n else:\r\n odd.append(i)\r\n\r\na = []\r\nb = []\r\n\r\nfor i in range(n):\r\n a.append([])\r\n\r\nfor i in range(n):\r\n b.append([])\r\n\r\nj = 0\r\nfor i in range(len(odd)):\r\n if i == n:\r\n j = 0\r\n a[j].append(odd[i])\r\n j+=1\r\n\r\n else:\r\n a[j].append(odd[i])\r\n j+=1\r\n\r\n#print(a)\r\n\r\nj = 0\r\nfor i in range(len(even)):\r\n if i == n:\r\n j = 0\r\n b[j].append(even[i])\r\n j+=1\r\n\r\n else:\r\n b[j].append(even[i])\r\n j+=1\r\n\r\n#print(b)\r\n\r\nres = []\r\nflag = 0\r\nfor i in range(n):\r\n x = a[i]\r\n y = b[i]\r\n x = list(reversed(x))\r\n y = list(reversed(y))\r\n for i in x :\r\n res.append(i)\r\n for i in y :\r\n res.append(i)\r\n\r\n\r\nprint(*res)\r\n\r\n\r\n", "n,m=map(int,input().split())\r\nnn=4*n\r\nleft_window=list(range(1,nn//2,2))\r\nright_window=list(range(2,nn//2+1,2))\r\nleft=list(range(nn//2+1,nn,2))\r\nright=list(range(nn//2+2,nn+1,2))\r\nlz=[left,left_window,right,right_window]\r\nls=[]\r\nfor j in range(n):\r\n for i in range(4):\r\n x=lz[i].pop(0)\r\n if 1<=x<=m:\r\n ls.append(x)\r\nprint(\" \".join(map(str,ls)))", "n,m=map(int,input().split())\r\na,b,c,d=1,2,2*n+1,2*n+2\r\nfor i in range(n):\r\n if c<=m:\r\n print(c,end=\" \")\r\n c+=2\r\n if a<=m:\r\n print(a,end=\" \")\r\n a+=2\r\n if d<=m:\r\n print(d,end=\" \")\r\n d+=2\r\n if b<=m:\r\n print(b,end=\" \")\r\n b+=2\r\n ", "n, m = map(int, input().strip().split())\r\n\r\nseats = [[1, 2 * n + 1, 2 * n + 2, 2]]\r\n\r\nfor _ in range(1, n):\r\n\tnew_seat = []\r\n\tnew_seat += [seats[-1][-1] + 1]\r\n\tnew_seat += [seats[-1][2] + 1]\r\n\tnew_seat += [new_seat[-1] + 1]\r\n\tnew_seat += [new_seat[0] + 1]\r\n\tseats += [new_seat]\r\n\t\r\n\r\nans = []\r\n\r\nfor seat in seats:\r\n\tif seat[1] <= m:\r\n\t\tans += [seat[1]]\r\n\tif seat[0] <= m:\r\n\t\tans += [seat[0]]\r\n\tif seat[2] <= m:\r\n\t\tans += [seat[2]]\r\n\tif seat[-1] <= m:\r\n\t\tans += [seat[-1]]\r\n\r\nprint(*ans)\r\n", "[n, m] = [int(i) for i in input().split()]\n\nplaces = []\n\nfor i in range(n):\n places.extend([2*(n+i)+1, 2*i+1, 2*(n+i)+2, 2*(i+1)])\n\nfor i in range(4*n):\n if places[i] <= m:\n print(str(places[i]) + ' ', end='')\n", "import sys\nsys.stderr = sys.stdout\n\n\ndef bus(n, m):\n B = [[None]*4 for _ in range(n)]\n n2 = 2*n\n n4 = 4*n\n for i in range(0, min(m, n2), 2):\n B[i//2][0] = i+1\n for i in range(1, min(m, n2), 2):\n B[i//2][3] = i+1\n for i in range(n2, min(m, n4), 2):\n B[(i-n2)//2][1] = i+1\n for i in range(n2 + 1, min(m, n4), 2):\n B[(i-n2)//2][2] = i+1\n L = [b for i in range(n)\n for b in (B[i][1], B[i][0], B[i][2], B[i][3])\n if b is not None]\n assert len(L) == m\n return L\n\n\ndef main():\n n, m = readinti()\n print(' '.join(map(str, bus(n, 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", "N, M = list(map(int, input().split(' ')))\n\nhalf = min(2 * N, M)\n\nfor i in range(half):\n\n if half + i + 1 <= M:\n print(half + i + 1, end = ' ')\n print(i + 1, end = ' ')\n\nprint()\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn, m = map(int, input().split())\r\nx = [2 * n + i for i in range(1, 2 * n + 1)]\r\ny = [i for i in range(1, 2 * n + 1)]\r\nans = []\r\nfor i in range(2 * n):\r\n if x[i] <= m:\r\n ans.append(x[i])\r\n if y[i] <= m:\r\n ans.append(y[i])\r\nprint(*ans)", "n, m = map(int, input().split())\na = [[0] * 4 for i in range(n)]\n\nfor i in range(n):\n a[i][0] = 2 * i\n a[i][1] = 2 * (i + n)\n a[i][2] = 2 * (i + n) + 1\n a[i][3] = 2 * i + 1\nans = []\nfor i in range(n):\n ans.append(a[i][1])\n ans.append(a[i][0])\n ans.append(a[i][2])\n ans.append(a[i][3])\nfor i in range(4 * n):\n if ans[i] < m:\n print(ans[i] + 1, end=' ')", "import sys\r\n\r\nn,m = [int(elem) for elem in sys.stdin.readline().split()]\r\n\r\nans_arr = [0]*4*n\r\n\r\nfor i in range(0,2*n):\r\n ans_arr[2*i] = 2*n+i+1\r\n\r\nfor i in range(0,2*n):\r\n ans_arr[2*i+1] = i+1\r\n\r\nans = \"\"\r\n\r\nfor val in ans_arr:\r\n if val!=0 and val<=m:\r\n ans+=str(val)+\" \"\r\n\r\nsys.stdout.write(ans)\r\n", "n, m = list(map(int, input().split()))\r\nif m < n * 2:\r\n for i in range(1, m + 1):\r\n print(i, end=' ')\r\nelse:\r\n first = [i + n * 4 - n * 2 for i in range(1, m - (n * 4 - n * 2) + 1)]\r\n second = [i for i in range(1, n * 4 - n * 2 + 1)]\r\n x = 0\r\n for i in range(len(first)):\r\n print(first[i], second[i], end=' ')\r\n x += 1\r\n for i in range(x, len(second)):\r\n print(second[i], end=' ')", "n, m = map(int, input().split())\r\na = [[0 for i in range(4)] for j in range(n)]\r\n\r\nfor i in range(min(n, m // 2 + m % 2)):\r\n a[i][0] = 2 * i + 1\r\nfor i in range(min(n, m // 2)):\r\n a[i][3] = 2 * i + 2\r\nfor i in range((m - 2 * n) // 2 + (m - 2 * n) % 2):\r\n a[i][1] = 2 * n + 2 * i + 1\r\nfor i in range((m - 2 * n) // 2):\r\n a[i][2] = 2 * n + 2 * i + 2\r\n\r\nrow = 0\r\nfor i in range(n):\r\n if a[i][1] != 0:\r\n print(a[i][1], end=' ')\r\n if a[i][0] != 0:\r\n print(a[i][0], end=' ')\r\n if a[i][2] != 0:\r\n print(a[i][2], end=' ')\r\n if a[i][3] != 0:\r\n print(a[i][3], end=' ')\r\n", "def bus_seats():\n\n inp = input().split()\n n,m = int(inp[0]),int(inp[1])\n\n jan_e, jan_d, meio_e, meio_d = [],[],[],[]\n onibus = [jan_e,jan_d]\n #preenchendo\n menor = m\n precisa_meio = 0\n if(m>n*2):\n precisa_meio = 1\n menor = n*2\n pos = 0\n for i in range(menor):\n onibus[pos].append(i+1)\n if(pos==0):\n pos=1\n else:\n pos=0\n \n if(precisa_meio):\n onibus = [meio_e,meio_d]\n pos = 0\n for i in range(menor,m):\n onibus[pos].append(i+1)\n if(pos==0):\n pos=1\n else:\n pos=0\n \n #evacuando\n onibus = [meio_e,jan_e,meio_d,jan_d]\n pos = -1\n ordem = []\n i=0\n while i<m:\n i+=1\n pos+=1\n if(len(onibus[pos])>=1):\n ordem.append(onibus[pos].pop(0))\n else:\n i-=1\n if(pos==3): \n pos = -1\n\n result = \"\"\n for i in range(m):\n result+= str(ordem[i]) + ' '\n \n print(result[:len(result)])\n\nbus_seats()\n\t \t \t\t \t\t\t \t\t\t \t \t\t\t\t \t\t\t\t \t", "n,m=map(int, input().split())\r\nif m<=2*n:\r\n print(*[i for i in range(1,m+1)])\r\nelse:\r\n x=[i for i in range(1, 2*n+1)]\r\n y=[i for i in range(2*n+1, m+1)]\r\n for i in range(m):\r\n #print(len(x),len(y))\r\n k=min(len(x),len(y))\r\n if i//2<k:\r\n print(y[i//2] if i%2==0 else x[i//2], end=' ')\r\n else:\r\n print(*x[i//2:] if k==len(y) else y[i//2:])\r\n break", "n , m = map(int, input().split())\n\n# if m < 2*n:\nma = []\n\nfor i in range(2*n):\n li = [i+1]\n ma.append(li)\n\n\nfor i in range(2*n, m):\n ma[i%(n*2)].append(i+1)\n\nfor i in range(2*n):\n if i >= m:\n break\n if i == 2*n -1:\n print(*reversed(ma[i]), end='')\n else:\n print(*reversed(ma[i]), end=' ')\nprint()\n", "\r\nn,m = map(int,input().split())\r\n\r\n\r\nfor k in range(1,2*n +1):\r\n num = 2 *n +k\r\n if num <= m:\r\n print(num, end=\" \")\r\n num = k\r\n if num <= m:\r\n print(num, end=\" \")\r\n\r\n", "if __name__ == '__main__':\r\n P = lambda: map(int, input().split())\r\n\r\n n, m = P()\r\n l = list()\r\n\r\n for i in range(m):\r\n if (i + 1) <= 2 * n:\r\n l.append([i + 1])\r\n else:\r\n l[i % (2 * n)].append(i + 1)\r\n for i in l:\r\n print(*i[::-1], end=\" \")", "n, m = [ int(i) for i in input().strip().split() ]\nbus = {\n \"right\": [],\n \"left\": []\n}\n\nfor i in range(n):\n bus[\"right\"].append({\n \"window\": -1,\n \"non-window\": -1\n })\n bus[\"left\"].append({\n \"window\": -1,\n \"non-window\": -1\n })\n\nfor p in range(m):\n if p < 2 * n:\n if p % 2 == 0:\n bus['left'][p // 2]['window'] = p + 1\n else:\n bus['right'][p // 2]['window'] = p + 1\n else:\n if p % 2 == 0:\n bus['left'][(p - 2 * n) // 2]['non-window'] = p + 1\n else:\n bus['right'][(p - 2 * n) // 2]['non-window'] = p + 1\n\n# print(bus)\n\nbefore = False\n\nfor r in range(n):\n if bus[\"left\"][r][\"non-window\"] != -1:\n if before:\n print(\" \", end=\"\")\n print(bus[\"left\"][r][\"non-window\"], end=\"\")\n before = True\n if bus[\"left\"][r][\"window\"] != -1:\n if before:\n print(\" \", end=\"\")\n print(bus[\"left\"][r][\"window\"], end=\"\")\n before = True\n if bus[\"right\"][r][\"non-window\"] != -1:\n if before:\n print(\" \", end=\"\")\n print(bus[\"right\"][r][\"non-window\"], end=\"\")\n before = True\n if bus[\"right\"][r][\"window\"] != -1:\n if before:\n print(\" \", end=\"\")\n print(bus[\"right\"][r][\"window\"], end=\"\")\n before = True\nprint()\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())#F\r\nw1 =[]\r\nw2=[]\r\nnw1=[]\r\nnw2=[]\r\nlw1=0\r\nlw2=0\r\nlnw1 = 0\r\nlnw2 = 0\r\nfor i in range(m):\r\n if i%2==0 and lw1<n:\r\n w1.append(i+1)\r\n lw1+=1\r\n elif i%2==1 and lw2<n:\r\n w2.append(i+1)\r\n lw2+=1\r\n elif i%2==0:\r\n nw1.append(i+1)\r\n lnw1 +=1\r\n else:\r\n nw2.append(i+1)\r\n lnw2+=1\r\nfor i in range(lw1):\r\n if i<lnw1:\r\n print(nw1[i],end=' ')\r\n if i<lw1:\r\n print(w1[i],end=' ')\r\n if i<lnw2:\r\n print(nw2[i],end=' ')\r\n if i<lw2:\r\n print(w2[i],end=' ')\r\n\r\n\r\n", "n, m = map(int, input().split())\r\nc = 1\r\nb = []\r\nfor i in range(n):\r\n temp = []\r\n for j in range(4):\r\n temp.append(0)\r\n b.append(temp)\r\ni = 0\r\njr = 3\r\njl = 0\r\nwhile c <= m:\r\n if c % 2 == 0:\r\n b[i][jr] = c\r\n i += 1\r\n else:\r\n b[i][jl] = c\r\n c += 1\r\n if i == n:\r\n i = 0\r\n jr = 2\r\n jl = 1\r\ni = 0\r\nj = 1\r\nl = []\r\nwhile i < n:\r\n if b[i][j] != 0:\r\n l.append(b[i][j])\r\n if j == 1:\r\n j = 0\r\n elif j == 0:\r\n j = 2\r\n elif j == 2:\r\n j = 3\r\n elif j == 3:\r\n j = 1\r\n i += 1\r\nprint(*l)\r\n", "n, m = map(int, input().split())\nres = []\nfor i in range(4*n):\n v = 2*n*((i+1)%2) + 1 + i//2\n if(v <= m):\n res.append(str(v))\nprint(' '.join(res))\n", "n, m = map(int, input().split())\nL1 = []\nL2 = []\nL3 = []\nL4 = []\nfor i in range(1, m+1):\n if i <= 2*n:\n if i%2 == 1:\n L1.append(i)\n else:\n L4.append(i)\n else:\n if i%2 == 1:\n L2.append(i)\n else:\n L3.append(i)\nL1.reverse()\nL2.reverse()\nL3.reverse()\nL4.reverse()\nans = []\nwhile L1 or L2 or L3 or L4:\n if L2:\n ans.append(L2.pop())\n if L1:\n ans.append(L1.pop())\n if L3:\n ans.append(L3.pop())\n if L4:\n ans.append(L4.pop())\nprint(*ans)\n", "n,m=map(int,input().split())\r\norder=[]\r\nfor i in range(n):\r\n order+=[2*n+2*i+1,2*i+1,2*n+2*i+2,2*i+2]\r\n\r\nans=[]\r\nfor i in order:\r\n if 1<=i<=m:\r\n ans.append(i)\r\nprint(*ans)", "def bus_seats(n,m):\r\n w=0\r\n e=0\r\n v=[]\r\n a=[0]*n\r\n b=[0]*n\r\n c=[0]*n\r\n d=[0]*n\r\n for i in range(1,m+1):\r\n w+=1\r\n if w>2*n:\r\n e=1\r\n if w%2==1 and e==0:\r\n a[a.index(0)]=i\r\n elif w%2==0 and e==0:\r\n d[d.index(0)]=i\r\n elif w%2==1 and e==1:\r\n b[b.index(0)]=i\r\n elif w%2==0 and e==1:\r\n c[c.index(0)]=i\r\n for i in range(n):\r\n if b[i]!=0:\r\n v.append(b[i])\r\n if a[i]!=0:\r\n v.append(a[i])\r\n if c[i]!=0:\r\n v.append(c[i])\r\n if d[i]!=0:\r\n v.append(d[i])\r\n return(v)\r\nn,m = input().strip().split()\r\na=bus_seats(int(n),int(m))\r\nprint(\" \".join(str(i) for i in a))", "n,m=map(int,input().split())\r\nhalf=min(2*n,m)\r\nfor i in range(half):\r\n if((half+i+1)<=m):\r\n print(half+i+1,end=' ')\r\n print(i+1,end=' ')\r\n", "from itertools import zip_longest as zl\r\nn, m = map(int, input().split())\r\n\r\nif m-n*2 <= 0:\r\n wind = list(range(1, m+1))\r\n prh = []\r\nelse:\r\n man = range(1, m+1)\r\n wind = list(man[:n*2])\r\n prh = list(man[n*2:])\r\n \r\nfor a,b in zl(prh, wind, fillvalue=''):\r\n print (str(a) + ' ' + str(b), end=' ')", "n,m=map(int,input().split())\r\nc2=2*n+1\r\nc1=1\r\nfor i in range(n*2):\r\n if(c2<=m):\r\n print(c2,end=' ')\r\n c2+=1\r\n if(c1<=m):\r\n print(c1,end=' ')\r\n c1+=1\r\nprint('')\r\n", "n,m = input().split()\r\nm = int(m)\r\nn = int(n)\r\n\r\ndef solve():\r\n\r\n a1 = []\r\n a2 = []\r\n a3 = []\r\n a4 = []\r\n result = []\r\n\r\n limit1 = n\r\n limit2 = n\r\n\r\n for i in range(m):\r\n k = i + 1\r\n\r\n if k%2 == 1:\r\n if limit1 > 0:\r\n a1.append(k)\r\n limit1 -= 1\r\n elif limit1 <= 0:\r\n a2.append(k)\r\n elif k%2 == 0:\r\n if limit2 > 0:\r\n limit2 -= 1\r\n a3.append(k)\r\n elif limit2 <= 0:\r\n a4.append(k)\r\n \r\n \r\n a = 0\r\n b = 0\r\n c = 0\r\n d = 0\r\n\r\n for j in range(n):\r\n\r\n\r\n if a + 1 <= len(a2):\r\n result.append(a2[a])\r\n a += 1\r\n if b + 1 <= len(a1):\r\n result.append(a1[b])\r\n b += 1\r\n if c + 1 <= len(a4):\r\n result.append(a4[c])\r\n c += 1\r\n if d + 1 <= len(a3):\r\n result.append(a3[d])\r\n d += 1\r\n\r\n\r\n print(*result)\r\n\r\nsolve()\r\n", "tab=[int(i) for i in input().split()]\r\nn=tab[0]\r\nm=tab[1]\r\nx=\"\"\r\nif m==4*n :\r\n\tfor i in range(n) :\r\n\t\tx=x+str(2*n+1+2*i)+\" \"+str(2*i+1)+\" \"+str(2*n+2+2*i)+\" \"+str(2*i+2)+\" \"\r\nelse :\r\n\tfor i in range(n) :\r\n\t\tif 2*n+2*i+1<=m :\r\n\t\t\tx=x+str(2*n+2*i+1)+\" \"\r\n\t\tif 2*i+1<=m :\r\n\t\t\tx=x+str(2*i+1)+\" \"\r\n\t\tif 2*n+2*i+2<=m :\r\n\t\t\tx=x+str(2*n+2*i+2)+\" \"\r\n\t\tif 2*i+2<=m :\r\n\t\t\tx=x+str(2*i+2)+\" \"\r\n\r\nx=x[:-1]\t\t\r\n\t\t\r\nprint(x)", "n,m=map(int,input().split())\r\na=2*n+1\r\nb=1\r\nfor i in range(n*2):\r\n if(a<=m):\r\n print(a,end=' ')\r\n a+=1\r\n if(b<=m):\r\n print(b,end=' ')\r\n b+=1", "import math\nimport sys\nfrom collections import defaultdict\n#input = sys.stdin.readline\n\nUSE_FILE = False\n\ndef search(n, k):\n n = len(x)\n p = 0\n a = n\n while a >= 1:\n while p + a < n and x[p+a] <= k:\n p += a\n a //= 2\n return x[p] == k\n\n\ndef main():\n n, m = tuple(map(int, input().split()))\n\n res = []\n contor_window = 1\n if m >= 2 * n:\n contor_non_window = 2 * n + 1\n while contor_non_window <= m:\n res.append(contor_non_window)\n res.append(contor_window)\n contor_non_window += 1\n contor_window += 1\n while contor_window <= min(m, 2 * n):\n res.append(contor_window)\n contor_window += 1\n\n print(\" \".join(map(str, res)))\n\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, m = map(int, input().split())\r\n\r\nout = []\r\n\r\na, b, c, d = 1, 2 * n + 1, 2 * n + 2, 2\r\nfor _ in range(n):\r\n if b <= m:\r\n out.append(b)\r\n\r\n if a <= m:\r\n out.append(a)\r\n\r\n if c <= m:\r\n out.append(c)\r\n\r\n if d <= m:\r\n out.append(d)\r\n\r\n a += 2\r\n b += 2\r\n c += 2\r\n d += 2\r\n\r\nprint(*out)\r\n", "import sys\r\n#import random\r\nfrom bisect import bisect_right as rb\r\nfrom collections import deque\r\n#sys.setrecursionlimit(10**8)\r\nfrom queue import PriorityQueue\r\nfrom math import *\r\ninput_ = lambda: sys.stdin.readline().strip(\"\\r\\n\")\r\nii = lambda : int(input_())\r\nil = lambda : list(map(int, input_().split()))\r\nilf = lambda : list(map(float, input_().split()))\r\nip = lambda : input_()\r\nfi = lambda : float(input_())\r\nap = lambda ab,bc,cd : ab[bc].append(cd)\r\nli = lambda : list(input_())\r\npr = lambda x : print(x)\r\nprinT = lambda x : print(x)\r\nf = lambda : sys.stdout.flush()\r\nmod = 998244353\r\n\r\nn,m = il()\r\n\r\na = [[0,0,0,0] for i in range (n)]\r\n\r\ni1 = 0\r\ni2 = 0\r\nfl = 0\r\n\r\nfor i in range (m) :\r\n\r\n a[i1][i2] = (i+1)\r\n\r\n if (fl == 0) :\r\n i2 += 3\r\n\r\n if (i2 > 3) :\r\n i2 = 0\r\n i1 += 1\r\n if (i1>=n) :\r\n fl = 1\r\n i2 = 1\r\n i1 = 0\r\n else :\r\n i2 += 1\r\n if (i2 > 2) :\r\n i2 = 1\r\n i1 += 1\r\n\r\nans = []\r\n\r\nfor i in range (n) :\r\n if (a[i][1] != 0) :\r\n ans.append(a[i][1])\r\n if (a[i][0] != 0) :\r\n ans.append(a[i][0])\r\n if (a[i][2] != 0) :\r\n ans.append(a[i][2])\r\n if (a[i][3] != 0) :\r\n ans.append(a[i][3])\r\n\r\nprint(*ans)\r\n", "n, m = map(int,input().split())\r\n\r\n\r\nfor x in range(1,2*n +1):\r\n num = 2 * n + x\r\n if num <= m:\r\n print(num, end=\" \")\r\n num = x\r\n if num <= m:\r\n print(num, end=\" \")", "n, m = (int(i) for i in input().split())\nn *= 4\nres = (i for i1, i2 in zip(range(n // 2 + 1, n + 1), range(1, n // 2 + 1)) for i in (i1, i2) if i <= m)\nprint(*res)\n", "import sys\r\nimport bisect\r\nfrom bisect import bisect_left as lb\r\ninput_=lambda: sys.stdin.readline().strip(\"\\r\\n\")\r\nfrom math import log\r\nfrom math import gcd\r\nfrom math import atan2,acos\r\nfrom random import randint\r\nsa=lambda :input_()\r\nsb=lambda:int(input_())\r\nsc=lambda:input_().split()\r\nsd=lambda:list(map(int,input_().split()))\r\nse=lambda:float(input_())\r\nsf=lambda:list(input_())\r\nflsh=lambda: sys.stdout.flush()\r\n#sys.setrecursionlimit(10**6)\r\nmod=10**9+7\r\ngp=[]\r\ncost=[]\r\ndp=[]\r\nmx=[]\r\nans1=[]\r\nans2=[]\r\nspecial=[]\r\nspecnode=[]\r\na=0\r\nkthpar=[]\r\ndef dfs(root,par):\r\n if par!=-1:\r\n dp[root]=dp[par]+1\r\n for i in range(1,20):\r\n if kthpar[root][i-1]!=-1:\r\n kthpar[root][i]=kthpar[kthpar[root][i-1]][i-1]\r\n for child in gp[root]:\r\n if child==par:continue\r\n kthpar[child][0]=root\r\n dfs(child,root)\r\ndef hnbhai():\r\n n,m=sd()\r\n leftW=[]\r\n rightW=[]\r\n i=0\r\n while(len(leftW)<n and len(rightW)<n and i<m):\r\n leftW.append(i+1)\r\n if i+1==m:\r\n i+=1\r\n break\r\n rightW.append(i+2)\r\n i+=2\r\n left=[]\r\n right=[]\r\n while(i<m and len(left)<n and len(right)<n):\r\n left.append(i+1)\r\n if i+1==m:\r\n i+=1\r\n break\r\n right.append(i+2)\r\n i+=2\r\n #print(left,right)\r\n while(True):\r\n if len(left)>0:\r\n print(left.pop(0),end=\" \")\r\n if len(leftW)>0:\r\n print(leftW.pop(0),end=\" \")\r\n if len(right)>0:\r\n print(right.pop(0),end=\" \")\r\n if len(rightW)>0:\r\n print(rightW.pop(0),end=\" \")\r\n if len(left)==0 and len(right)==0 and len(leftW)==0 and len(rightW)==0:\r\n break\r\n print()\r\nfor _ in range(1):\r\n hnbhai()\r\n" ]

[ "a,b = map(int,input().split(' '))\ns = input()\ns1 = sorted(set(s))\n\nif b>a:\n\tprint(s+s1[0]*(b-a))\nelse:\n\ti = b-1\n\twhile s[i]>=s1[-1] and i>-1:\n\t\ti -= 1\n\td = s1.index(s[i])\n\tprint(s[:i]+s1[d+1]+s1[0]*(b-i-1))", "import sys\r\n\r\ninput = lambda: sys.stdin.readline().strip(\"\\r\\n\")\r\n\r\nn, k = map(int, input().split())\r\ns = input()\r\n\r\nletters = sorted(list(set(list(s))))\r\nif k > n:\r\n ans = s + (k-n)*letters[0]\r\nelse:\r\n for i in range(k-1, -1, -1):\r\n if s[i] != letters[-1]:\r\n ans = s[:i] + letters[letters.index(s[i])+1] + (k-i-1) * letters[0]\r\n break\r\nprint(ans)\r\n", "n, k = [int(x) for x in input().split(' ')]\ns = input()\n\nalph = sorted(list(set(s)))\n\n\nif k <= n:\n i = min(n, k) - 1\n while s[i] == alph[-1]:\n i -= 1\n r = s[:i] + alph[alph.index(s[i])+1] + alph[0]*(k-i-1)\nelse:\n r = s + alph[0]*(k-n)\n\n\nprint(r)", "\n\ndef run():\n n, k = map(int, input().split())\n s = input()\n s_sorted = sorted(set(s))\n big = s_sorted[-1]\n small = s_sorted[0]\n if k > n:\n t = s + ''.join([small] * (k - n))\n else:\n if len(s) == 1:\n t = s\n else:\n\n to_replace = big\n ind_replace = 0\n for i in range(k-1, -1, -1):\n if s[i] == big:\n continue\n else:\n to_replace = s[i]\n ind_replace = i\n break\n\n ind = s_sorted.index(to_replace)\n ind += 1\n\n\n t = s[:ind_replace] + s_sorted[ind] + ''.join([small]*(k - ind_replace - 1))\n\n\n print(t)\n\n\n\nif __name__ == '__main__':\n run()\n", "def main():\r\n (n, k) = map(int, input().split())\r\n s = input()\r\n\r\n letters = [ord(c) for c in set(s)]\r\n letters.sort()\r\n\r\n if(n < k):\r\n print(s+''.join(chr(letters[0]) for i in range(k-n)))\r\n return\r\n\r\n t = bytearray(s[:k].encode())\r\n for i in range(k-1,-1,-1):\r\n if t[i] == letters[-1]:\r\n t[i] = letters[0]\r\n else:\r\n t[i] = letters[letters.index(t[i])+1]\r\n break\r\n\r\n print(t.decode())\r\n\r\n\r\nmain()\r\n", "from sys import stdin,stdout\r\ninput = stdin.readline\r\nfrom collections import Counter\r\nn,k = map(int,input().split())\r\ns = list(map(str,input().split()))\r\ns = s[0]\r\nmin1 = min(n,k)\r\ncnt = Counter(s)\r\nset1 = list(cnt.keys())\r\nset1.sort()\r\nsma = set1[0]\r\nlsr = set1[-1]\r\nans = []\r\nif k<=n:\r\n i = min1-1\r\n while i >= 0:\r\n if s[i] == lsr:\r\n ans.append(sma)\r\n else:\r\n for t in range(len(set1)):\r\n if set1[t] > s[i]:\r\n ans.append(set1[t])\r\n break\r\n break\r\n i -= 1\r\n i -= 1\r\n while i >=0:\r\n ans.append(s[i])\r\n i -= 1\r\n for q in range(len(ans)-1,-1,-1):\r\n print(ans[q],end=\"\")\r\nelse:\r\n for j in range(n):\r\n print(s[j],end=\"\")\r\n for _ in range(k-n):\r\n print(sma,end=\"\")", "#!/usr/bin/python3\n\nn, k = list(map(int, input().split()))\ns = input()\nchars = list(sorted(list(set(s))))\nt = \"\"\nif n >= k:\n i = k-1\n while i >= 0:\n if s[i] != chars[-1]:\n l = chars[chars.index(s[i]) + 1]\n t = s[:i] + l + chars[0]*(k - (i+1))\n break\n i -= 1\nelse:\n t = s + chars[0]*(k - n)\n\nprint(t)\n", "n, k = map(int, input().split()); s = [ch for ch in input()]\r\nSET = sorted(set(s))\r\nans = []\r\nfirstChar = SET[0]\r\nlastChar = SET[-1]\r\nif n<k :\r\n ans += s\r\n k -= n\r\n for i in range(k):\r\n ans.append(firstChar)\r\nelse:\r\n ans = s[:k]\r\n for i in range(k-1, -1, -1):\r\n if ans[i] == lastChar:\r\n ans[i] = firstChar\r\n else:\r\n ans[i] = SET[SET.index(ans[i])+1]\r\n break\r\nst = \"\"\r\nfor ch in ans:\r\n st+=ch\r\nprint(st)", "n,k = list(map(int,input().split()))\r\ns = list(input())\r\nt = list(set(s))\r\nt.sort()\r\nbase = len(t)\r\nr = []\r\nfor i in range(n):\r\n r.append(t.index(s[i]))\r\nif k > n:\r\n for i in range(n,k):\r\n r.append(0);\r\nelse:\r\n c = 1\r\n for i in range(k - 1,-1,-1):\r\n r[i] += c\r\n if (r[i] >= base):\r\n r[i] -= base\r\n c = 1\r\n else:\r\n c = 0\r\nfor i in range(k,n):\r\n r.pop()\r\n\r\nans = list(map(lambda x: t[x], r))\r\nprint(\"\".join(ans))\r\n", "import sys\r\ninput = lambda: sys.stdin.readline().rstrip()\r\n\r\nN,K = map(int, input().split())\r\nS = input()\r\nA = list(set(S))\r\nA.sort()\r\nlib = {}\r\nM = len(A)\r\nfor c,i in enumerate(A):\r\n lib[c] = i\r\n lib[i] = c\r\n\r\nif K>N:\r\n ans = [S]+[A[0]]*(K-N)\r\n exit(print(''.join(ans)))\r\n\r\nans = [lib[i] for i in S[:K]]\r\nans[-1]+=1\r\ncarry=0\r\nfor i in range(len(ans)-1,-1,-1):\r\n t = ans[i]+carry\r\n if t>=M:\r\n carry = 1\r\n t = t%M\r\n else:\r\n carry = 0\r\n ans[i] = t\r\n \r\nprint(''.join([lib[i] for i in ans]))\r\n \r\n ", "n, k = map(int, input().split())\r\ns = input()\r\n\r\nif k > n:\r\n print(s + min(s) * (k - n))\r\nelse:\r\n dis, ans, flag = sorted(set(s)), list(s), 0\r\n\r\n for i in range(k - 1, -1, -1):\r\n for j in dis:\r\n if j > s[i]:\r\n ans[i] = j\r\n flag = 1\r\n break\r\n if flag:\r\n break\r\n else:\r\n ans[i] = dis[0]\r\n\r\n print(''.join(ans[:k]))\r\n", "def nextBigger(ch, li):\r\n i = 0\r\n while(i < len(li)):\r\n if(li[i] == ch):\r\n break\r\n i += 1\r\n return li[i + 1]\r\n\r\nn, t = map(int, input().split())\r\ns = input()\r\nx = list(set(s))\r\nx.sort()\r\nif(n < t):\r\n print (s + (x[0] * (t - n)))\r\nif(n >= t):\r\n s = s[:t]\r\n s = list(s)\r\n y = t - 1\r\n while(y >= 0):\r\n if(s[y] == x[-1]):\r\n s[y] = x[0]\r\n y -= 1\r\n else:\r\n s[y] = nextBigger(s[y], x)\r\n break\r\n res = \"\"\r\n for i in s:\r\n res += i\r\n print (res)\r\n", "# input() reads a string with a line of input, stripping the '\\n' (newline) at the end.\r\n# This is all you need for most Code Jam problems.\r\npairs= [int(s) for s in input().split(\" \")]\r\nn = pairs[0]\r\nk = pairs[1]\r\ns = input()\r\nletters = ''.join(sorted(set(s)))\r\nif n < k:\r\n answer = s\r\n for i in range(n,k):\r\n answer+=letters[0]\r\nelse:\r\n reverse_ = (s[:k])[::-1]\r\n ptr = -1\r\n pos_ = -1\r\n for index, item in enumerate(reverse_):\r\n pos = next(i for i, x in enumerate(letters) if x == item)\r\n if pos < (len(letters) -1):\r\n pos_=pos+1\r\n ptr = k -1 - index\r\n break\r\n answer=''\r\n if ptr > 0:\r\n answer = s[:ptr]\r\n answer+=letters[pos_]\r\n for i in range(ptr+1 , k):\r\n answer+=letters[0]\r\nprint(answer)", "n, k = map(int, input().split())\ns = list(input())\n\nu = sorted(set(s))\nd = dict([(i, e) for e, i in enumerate(u)])\n\nif n >= k:\n s = s[:k]\n for p in range(len(s) - 1, -1, -1):\n if s[p] == u[-1]:\n s[p] = u[0]\n else:\n s[p] = u[d[s[p]] + 1]\n break\nelse:\n s += [u[0]] * (k - n)\n\nprint(*s, sep='')\n", "n, k = map (int, input ().split ())\r\ns = input ()\r\nok = [0] * 26\r\nfor ch in s : ch2num = ord (ch) - ord ('a'); ok[ch2num] = 1\r\nmx = -1; mn = -1\r\nfor i in range (25, -1, -1) :\r\n if ok[i] :\r\n if mx == -1 : mx = i\r\n mn = i\r\nif k > n :\r\n t = s\r\n for i in range (k - n) : t += chr (ord ('a') + mn)\r\n print (t)\r\n exit (0)\r\nt = str ()\r\nfor i in range (k - 1, -1, -1) :\r\n ch2num = ord (s[i]) - ord ('a')\r\n if ch2num < mx :\r\n nxt = ch2num + 1\r\n while nxt < 26 and not ok[nxt] : nxt += 1\r\n t = s[:i] + chr (ord ('a') + nxt)\r\n for i in range (i + 1, k) : t += chr (ord ('a') + mn)\r\n print (t)\r\n break\r\n", "n, k = list(map(int, input().split()))\r\ns = input()\r\nif k > n:\r\n print(s + (k - n) * min(s))\r\nelse:\r\n ls = [0 for i in range(26)]\r\n ma = 0\r\n mi = 100\r\n for ch in s:\r\n v = ord(ch) - ord('a')\r\n ls[v] = 1\r\n ma = max(v, ma)\r\n mi = min(v, mi)\r\n i = min(k - 1, n - 1)\r\n while ord(s[i]) - ord('a') == ma: i -= 1\r\n j = ord(s[i]) - ord('a') + 1\r\n while ls[j] == 0: j += 1\r\n print(s[:i] + chr(j + ord('a')) + (k - i - 1) * chr(mi + ord('a')))\r\n", "def phone(a, b, s):\r\n s1 = sorted(set(s))\r\n if b > a:\r\n return s + s1[0] * (b - a)\r\n i = b - 1\r\n while s[i] >= s1[-1] and i > - 1:\r\n i -= 1\r\n ind = s1.index(s[i])\r\n return s[:i] + s1[ind + 1] + s1[0] * (b - i - 1)\r\n\r\n\r\nx, y = [int(j) for j in input().split()]\r\nt = input()\r\nprint(phone(x, y, t))\r\n", "from bisect import bisect_right\n\na = list(map(lambda x: int(x), input().split(' ')))\n\nn, k = a[0], a[1]\n\ns = input()\n\nres = ''\n\ns_min = min(s)\ns_max = max(s)\n\nst = sorted(set(s))\n\ndef find_gt(a, x):\n 'Find leftmost value greater than x'\n i = bisect_right(a, x)\n if i != len(a):\n return a[i]\n raise ValueError\n\nif n < k:\n for i, l in enumerate(s):\n if i >= k:\n break\n\n res += l\n\n for i in range(0, k - n):\n res += s_min\n\nelif n > k:\n found = False\n for l in reversed(s[0:k]):\n if found:\n res += l\n elif l == s_max:\n res += s_min\n else:\n res += find_gt(st, l)\n found = True\n\n res = ''.join(reversed(res))\nelse:\n found = False\n for l in reversed(s):\n if found:\n res += l\n elif l == s_max:\n res += s_min\n else:\n res += find_gt(st, l)\n found = True\n\n res = ''.join(reversed(res))\n\nprint(res)\n\n\n\n", "n, k = map(int, input().split())\ns = input()\nabc = sorted((set(s)))\nif k > n:\n print(s, abc[0] * (k - n), sep='')\nelse:\n z, i = abc[-1], k - 1\n while s[i] == z:\n i -= 1\n print(s[:i], abc[abc.index(s[i]) + 1], abc[0] * (k - i - 1), sep='')", "n,k=map(int,input().split())\r\ns=input()\r\nl=sorted(list(set(list(s))))\r\nif k<=n:\r\n\tfor i in range(k-1,-1,-1):\r\n\t\tz=[]\r\n\t\tfor j in l:\r\n\t\t\tif s[i]<j:\r\n\t\t\t\tz.append(j)\r\n\t\tif len(z)>0:\r\n\t\t\tz.sort()\r\n\t\t\tt=s[:i]+z[0]+l[0]*(k-i-1)\r\n\t\t\tbreak\r\nelse:\r\n\tt=s+(k-n)*l[0]\r\nprint(t)", "n,k=map(int,input().split())\r\ns=input()\r\nS = set(s)\r\nif n>=k:\r\n for i in reversed(range(k)):\r\n L = filter(lambda q:s[i]<q, S)\r\n L = list(L)\r\n if len(L):\r\n print(s[:i]+min(L)+(k-i-1)*min(S))\r\n break\r\nelse:\r\n print(s+min(S)*(k-n))", "import sys\n\ninput = sys.stdin.readline\n\ntest = False\n\nmod1, mod2 = 10 ** 9 + 7, 998244353\ninf = 10 ** 18 + 5\n\n\ndef test_case():\n\n n, k = map(int, input().split())\n s = input().rstrip('\\n')\n\n cnt = [0 for _ in range(26)]\n\n for c in s:\n\n cnt[ord(c) - 97] += 1\n\n min_char = '?'\n\n for i in range(26):\n\n if cnt[i]:\n\n min_char = chr(97 + i)\n break\n\n if k > n:\n\n print(s + min_char * (k - n))\n return\n\n lex = \"\"\n f = False\n\n for i in range(k - 1, -1, -1):\n\n if f:\n\n lex += s[i]\n continue\n\n for j in range(ord(s[i]) - 97 + 1, 26):\n\n if cnt[j]:\n\n lex += chr(97 + j)\n f = True\n break\n\n if not f:\n\n lex += min_char\n\n print(lex[::-1])\n\n\nt = 1\n\nif test:\n\n t = int(input())\n\nfor _ in range(t):\n\n # print(f\"Case #{_+1}: \")\n test_case()\n", "import sys\n\n[n,k] = [int(x) for x in input().split()]\ns = list(input())\nal = []\nfor a in s:\n al.append(a)\nal = sorted(al) # sort lexiographically\n\nad = {}\nadRev = {}\nbigNum = len(al)-1\nfor i in range(len(al)):\n a = al[i]\n ad[a] = i\n adRev[i] = a\n\ns = s[:k] if k < len(s) else s\nwhile k > len(s):\n s.append(adRev[0])\n if k == len(s):\n print(''.join(s))\n sys.exit()\ni = -1\nwhile True:\n try:\n s[i] = adRev[ad[s[i]]+1]\n break\n except:\n s[i] = adRev[0]\n i -= 1\nprint(''.join(s))\n\n\n\n", "n, k = list(map(int,input().split()))\r\ns = list(input())\r\nletset = list(sorted(list(set(s))))\r\nbadInd = 0\r\nif k <= n:\r\n for i in range(k-1,-1,-1):\r\n if s[i] != letset[-1]:\r\n badInd = i\r\n break\r\n print(\"\".join(s[:badInd]), end=\"\")\r\n for i in range(len(letset)):\r\n # print(s,i,letset)\r\n if letset[i] > s[badInd]:\r\n print(letset[i], end=\"\")\r\n break\r\n print( letset[0]*(k-badInd-1) )\r\nelse:\r\n print(\"\".join(s),end=\"\")\r\n print(letset[0]*(k-n))\r\n\r\n", "n,k=input().split()\r\ns=input()\r\nl=list(set(list(s)))\r\nl.sort()\r\nd={l[i]:i for i in range(len(l))}\r\nn=int(n)\r\nk=int(k)\r\nif k<=n:\r\n t=s[0:k]\r\n if d[t[k-1]]<(len(l)-1):\r\n print(s[0:k-1]+l[d[t[k-1]]+1])\r\n else:\r\n j=0\r\n for i in range(k-2, -1, -1):\r\n if d[t[i]]!=len(l)-1:\r\n j=i\r\n break\r\n print(s[0:j]+l[d[t[i]]+1]+l[0]*(k-j-1))\r\nelse:\r\n print(s+l[0]*(k-n))", "n, k = [int(i) for i in input().split()]\ns =input()\nlistaChars=[]\n\nfor c in s:\n if c not in listaChars:\n listaChars.append(c)\nlistaChars.sort()\n\nmenor=listaChars[0]\nmaior = listaChars[-1]\n\nif k > n:\n print(s+(menor)*(k-n))\nelse:\n s2=s\n s2=s2[:k]\n dist=0\n for i in range(len(s2)-1, -1, -1):\n dist=i\n if s2[i] != maior:\n index=listaChars.index(s2[i])+1\n s2=s[:i]+listaChars[index]+s[i+1:]\n break\n s2=s2[:dist+1]+menor*(k-dist-1)\n print(s2)", "n,k=list(map(lambda x: int(x), input().split()))\r\ns=input()\r\nmaximum='a'\r\nminimum='z'\r\nletters=set()\r\nfor i in s:\r\n letters.add(i)\r\n if i>maximum:\r\n maximum=i\r\n if i<minimum:\r\n minimum=i\r\nletters=list(letters)\r\nletters.sort()\r\nnex={}\r\nfor i in range(len(letters)-1):\r\n nex[letters[i]]=letters[i+1]\r\nif k>n:\r\n print(s+minimum*(k-n))\r\nelif k==n:\r\n i=n-1\r\n while s[i]==maximum and i>=0:\r\n i-=1\r\n if i==-1:\r\n print(s+maximum)\r\n else:\r\n print(s[0:i]+nex[s[i]]+minimum*(n-i-1))\r\nelse:\r\n temp=s[0:k]\r\n i = k - 1\r\n while s[i] == maximum and i >= 0:\r\n i -= 1\r\n if i == -1:\r\n print(temp + maximum)\r\n else:\r\n print(s[0:i] + nex[s[i]] + minimum * (k - i - 1))", "n , k = map(int , input().split())\nd = [False for i in range(1000)]\ns = input()\nMn = 1000;Mx = 0;\nfor char in s:\n Mn = min(Mn , ord(char))\n Mx = max(Mx , ord(char))\n d[ord(char)] = True\nif(k > n):\n print(s + (k - n) * chr(Mn))\n exit()\nidx = k - 1\nwhile(s[idx] == chr(Mx)):\n idx -= 1\nnxtchar = 'a'\nfor i in range(ord(s[idx]) + 1 , ord('z') + 1):\n if(d[i]):\n nxtchar = chr(i)\n break;\nprint(s[:idx] + nxtchar + (k - idx - 1) * chr(Mn))\n\n", "from bisect import bisect_left, bisect_right\r\nfrom collections import Counter, deque\r\nfrom functools import lru_cache\r\nfrom math import factorial, comb, sqrt\r\nfrom copy import deepcopy\r\nimport heapq\r\n\r\ndef main():\r\n s_len, ans_len = map(int, input().split())\r\n s = input()\r\n dic = set()\r\n for c in s:\r\n dic.add(c)\r\n if s_len < ans_len:\r\n print(s + min(dic) * (ans_len - s_len))\r\n else:\r\n for i in range(ans_len - 1, -1, -1):\r\n if s[i] != max(dic):\r\n break\r\n flag = set()\r\n for c in s:\r\n if c > s[i]:\r\n flag.add(c)\r\n print(s[:i] + min(flag) + min(dic) * (ans_len - i - 1))\r\n\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n, k = map(int, input().split())\r\nref = input()\r\n\r\ngiven = list(set(ref))\r\ngiven.sort()\r\n\r\nif k > n:\r\n print(ref + (k - n) * given[0])\r\nelse:\r\n ans = list(ref[: k])\r\n go = 1\r\n j = k - 1\r\n done = 0\r\n while go:\r\n if j < 0:\r\n j = 0\r\n go = 0\r\n elif ans[j] != given[-1]:\r\n ans[j] = given[given.index(ans[j]) + 1]\r\n ans[j + 1: k] = (k - j - 1) * given[0]\r\n go = 0\r\n else:\r\n j -= 1\r\n print(''.join(ans))\r\n\r\n", "\r\ndef isSubstr(str_a, str_b):\r\n return str_b.find(str_a) != -1\r\n\r\ndef subset(str_a, str_b):\r\n \"\"\"\r\n We have to create the set chars of str_a\r\n and then compare to set chars of b\r\n \"\"\"\r\n charset_a = set(str_a)\r\n charset_b = set(str_b)\r\n\r\n is_charset_a_in_charset_b = charset_a.intersection(charset_b) == charset_a\r\n return is_charset_a_in_charset_b\r\n\r\ndef prefix(str_a, str_b):\r\n \"\"\"\r\n When str_a found the position of subset and\r\n the position is less than the length of str_b\r\n \"\"\"\r\n return str_b.startswith(str_a)\r\n\r\ndef find_smallest_lexicograph(str_a, length):\r\n def create_smallest_lexicograph(str_a, length):\r\n \"\"\"\r\n Backwards process from last char of the string\r\n Get latest char, Find the higher alphabet from the set\r\n If found the higher, set the flag true, then create a char with the greater char founded\r\n else just create the smallest char from the set\r\n Then, move to the n-1 char, do the same things on above\r\n do until the pointer position is 0\r\n and return the created string from the process\r\n\r\n from the flag false->true, cut the string, and join the new string with cutted string\r\n and return the join\r\n \"\"\"\r\n\r\n set_str = set(str_a)\r\n if len(str_a) < length:\r\n new_str=\"%s%s\"%(str_a, min(set_str) * (length-len(str_a)))\r\n return new_str\r\n else:\r\n reverse_str_a = str_a[:length][::-1]\r\n lexicograph_str = []\r\n flag_lexi = False\r\n\r\n def create_max_char(char, reverse_str_a):\r\n sorted_list_str = sorted(set(reverse_str_a))\r\n char_pos=sorted_list_str.index(char)\r\n return sorted_list_str[char_pos+1]\r\n\r\n for char in reverse_str_a:\r\n \"find the greater char on the set compared with char loop\"\r\n if char >= max(set_str):\r\n lexicograph_str.append(min(set_str))\r\n else:\r\n if char <= max(set_str) and flag_lexi == False:\r\n new_max = create_max_char(char, set_str)\r\n lexicograph_str.append(new_max)\r\n flag_lexi=True\r\n if flag_lexi:\r\n char_pos=reverse_str_a.find(char)\r\n pre_lexi=reverse_str_a[char_pos+1:][::-1]\r\n make_lexi_str = \"\".join(sorted(lexicograph_str, reverse=True))\r\n new_str = \"%s%s\" % (pre_lexi, make_lexi_str)\r\n return new_str\r\n\r\n make_lexi_str = \"\".join(sorted(lexicograph_str, reverse=True))\r\n return make_lexi_str\r\n return create_smallest_lexicograph(str_a, length)\r\n\r\ndef test_find_the_smallest_lexicographical_string_length_is_2():\r\n str_a = \"abc\"\r\n actual = find_smallest_lexicograph(str_a, 2)\r\n expected = \"ac\"\r\n\r\n assert expected == actual\r\n\r\ndef test_find_the_smallest_lexicographical_string_length_is_3():\r\n str_a = \"ayy\"\r\n actual = find_smallest_lexicograph(str_a, 3)\r\n expected = \"yaa\"\r\n\r\n assert expected == actual\r\n\r\ndef test_find_the_smallest_lexicographical_string_another():\r\n str_a = \"baac\"\r\n actual = find_smallest_lexicograph(str_a, 4)\r\n expected = \"baba\"\r\n\r\n assert expected == actual\r\n\r\ndef test_find_the_smallest_lexicographical_when_string_length_is_unsufficient():\r\n str_a = \"ab\"\r\n actual = find_smallest_lexicograph(str_a, 5)\r\n expected = \"abaaa\"\r\n\r\n assert expected == actual\r\n\r\ndef test_first_str_is_substring_of_second_str():\r\n \"Example, that abc is a substring of abcd\"\r\n actual = isSubstr(\"abc\", \"abcd\")\r\n assert actual is True\r\n\r\ndef test_if_the_first_str_chars_are_the_subset_chars_of_second_str():\r\n \"Example, that aca is the subset of abc\"\r\n actual = subset(\"aca\", \"abcd\")\r\n assert actual is True\r\n\r\ndef test_first_str_is_prefix_of_second_str_when_false():\r\n \"\"\"\r\n Example, that abc is a prefix of abcd\r\n But, the def is not the prefix of cdef\r\n \"\"\"\r\n actual = prefix(\"def\", \"cdef\")\r\n assert actual is False\r\n\r\ndef test_first_str_is_prefix_of_second_str_when_true():\r\n \"\"\"\r\n Example, that abc is a prefix of abcd\r\n But, the def is not the prefix of cdef\r\n \"\"\"\r\n actual = prefix(\"def\", \"defabc\")\r\n assert actual is True\r\n\r\nn,k = [int(x) for x in input().split()]\r\ninput_string = str(input())\r\nlexi = find_smallest_lexicograph(input_string, k)\r\n\r\nprint(lexi)\r\n", "n, k = map(int, input().split())\r\ns = input()\r\na = set()\r\nfor x in s:\r\n a.add(x)\r\nb = ''.join(sorted(list(a)))\r\n\r\nif k > n:\r\n m = b[0]\r\n s += m*(k-n)\r\nelse:\r\n s = s[:k]\r\n f = 0\r\n z = 'a'\r\n for i in range(len(s)-1, -1, -1):\r\n if s[i] != b[-1]:\r\n j = b.index(s[i])\r\n z = b[j+1]\r\n f = i\r\n break\r\n m = b[0]\r\n s = s[:f] + z + m*(k-f-1)\r\n\r\nprint(s)\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn, k = map(int, input().split())\r\ns = input()[:-1]\r\nd = set(s)\r\nw = sorted([i for i in d])\r\nq = []\r\nif k > n:\r\n print(s+(k-n)*w[0])\r\nelse:\r\n for i in range(k-1, -1, -1):\r\n if s[i] != w[-1]:\r\n a = w.index(s[i]) + 1\r\n print(s[:i] + w[a] + w[0]*(k-i-1))\r\n break\r\n", "n,k = map(int,input().split())\r\n#print(n,k)\r\nstr = input()\r\nd = [i for i in str]\r\nd = list(set(d))\r\nd.sort()\r\n#print(d)\r\nif n < k:\r\n ans = str + d[0]*(k-n)\r\nelse:\r\n if k < n:\r\n str = str[:k]\r\n i = k-1\r\n while str[i] == d[-1]:\r\n i -= 1\r\n ans = str[:i]\r\n ans += d[d.index(str[i])+1]\r\n ans += d[0]*(k-1-i)\r\n\r\nprint(ans)\r\n\r\n", "#complexity - O(n)\nimport string\n\nn, k = map(int, input().split())\ns = input()\nset_of_letters = set(s)\n\ndef find_smallest():\n for i in string.ascii_lowercase:\n if i in set_of_letters:\n return i\n return None #should not occur given the conditions\n\ndef find_next_greater(letter):\n counter = 1\n while counter < 26:\n next_char = chr((ord(letter)-ord('a') + counter)%26+ord('a'))\n if next_char in set_of_letters:\n return next_char\n counter += 1\n return None\n \nif k > n:\n print(s + find_smallest()*(k-n))\nelse:\n s_list = list(s[:k])\n while k > 0:\n next_greater = find_next_greater(s[k-1])\n s_list[k-1] = next_greater\n if next_greater > s[k-1]: #really greater\n break #should break before k = 0 given the conditions\n k -= 1\n print(''.join(s_list))\n", "n, k = map(int, input().split())\ns = input()\na = sorted(set(s))\nidx = {}\n\nfor i, j in enumerate(a):\n\tidx[j] = i\n\nif n < k:\n\tprint(s + a[0] * (k - n))\n\texit()\n\nt = [*s[:k]]\nz = len(idx)\nl = 0\n\nfor i in range(k - 1, -1, -1):\n\tr = (idx[s[i]] + 1) % z\n\tif r == 0:\n\t\tl = 1\n\telse:\n\t\tl = 0\n\tt[i] = a[r]\n\tif l == 0:\n\t\tbreak\n\nprint(''.join(t))", "a,b = map(int,input().split(' '))\r\ns = input()\r\ns1 = sorted(set(s))\r\n\r\nif b>a:\r\n\tprint(s+s1[0]*(b-a))\r\nelse:\r\n\ti = b-1\r\n\twhile s[i]>=s1[-1] and i>-1:\r\n\t\ti -= 1\r\n\td = s1.index(s[i])\r\n\tprint(s[:i]+s1[d+1]+s1[0]*(b-i-1))", "import sys \r\nn,k=map(int,input().split())\r\ns=input()\r\nt=s[:k]\r\nse=set(list(s))\r\nsm=max(se)\r\nif k>n:\r\n t=s[:n]+min(se)*(k-n)\r\n print(t)\r\n sys.exit()\r\nu=1\r\nwhile(t[-u]==sm):\r\n u+=1\r\nr=t[-u]\r\nr=chr(ord(r)+1)\r\nwhile r not in s:\r\n r=chr(ord(r)+1)\r\nt=t[:k-u]+r+min(se)*(u-1)\r\nprint(t)\r\n\r\n \r\n", "def main():\n n, k = [int(v) for v in input().split()]\n s = input()\n\n d = {}\n for i in range(n):\n d[s[i]] = i\n\n alpha = sorted(d.keys())\n\n if k > n:\n print(s + (k - n) * alpha[0])\n return\n\n break_pos = None\n break_char = None\n for i in range(k-1, -1, -1):\n if s[i] != alpha[len(alpha) - 1]:\n break_pos = i\n break_char = alpha[alpha.index(s[i]) + 1]\n break\n\n res = []\n for i in range(k):\n if i < break_pos:\n res.append(s[i])\n elif i == break_pos:\n res.append(break_char)\n else:\n res.append(alpha[0])\n print(''.join(res))\n\n\nif __name__ == '__main__':\n main()\n", "n,k = map(int,input().split())\r\ns = list(input())\r\nmn = min(s)\r\nmx = max(s)\r\nif k>n:\r\n s = \"\".join(s)\r\n print(s+mn*(k-n))\r\nelse:\r\n der = [False]*26\r\n for i in s: \r\n der[ord(i)-ord('a')] = True\r\n ans = s[:k]\r\n for i in range(k-1,-1,-1):\r\n if ans[i]==mx: continue\r\n for j in range(ord(ans[i])-ord('a')+1,26):\r\n if der[j]:\r\n ans[i] = chr(ord('a')+j)\r\n break\r\n break\r\n for j in range(i+1,k): \r\n ans[j] = mn\r\n print(\"\".join(ans))", "n, k = [int(x) for x in input().split(' ')]\r\ns = input()\r\nx = sorted(list(set(list(s))))\r\nif k <= n:\r\n i = k - 1\r\n while s[i] == x[-1]:\r\n i -= 1\r\n\r\n ans = s[:i] + x[x.index(s[i]) + 1] + x[0] * (k - i - 1)\r\n\r\nelse:\r\n ans = s + x[0] * (k - n)\r\n\r\n\r\nprint(ans)", "n, k = map(int, input().split())\r\ns = input()\r\n\r\nif(k > n):\r\n print(s + (k - n) * min(s))\r\n exit()\r\n\r\nidx, maxi = k-1, max(s)\r\nwhile s[idx] == maxi:\r\n idx -= 1\r\nfor i in range(ord(s[idx])+1, ord('z')+1):\r\n if chr(i) in s:\r\n print(s[:idx] + chr(i) + (k - idx - 1) * min(s))\r\n break\r\n", "n, k = map(int, input().split())\ns = list(input())\nsets = sorted(list(set(s)))\n\n\ndef bigger_one(c):\n for e in sets:\n if e > c:\n return e\n\n\nif k > n:\n print(''.join(s) + (k - n) * sets[0])\nelse:\n t = s[0:k]\n for i in reversed(range(k)):\n if bigger_one(t[i]):\n t[i] = bigger_one(t[i])\n break\n else:\n t[i] = sets[0]\n continue\n print(''.join(t))\n", "\"\"\"\r\nCode of Ayush Tiwari\r\nCodeforces: servermonk\r\nCodechef: ayush572000\r\n\r\n\"\"\"\r\n# import sys\r\n# input = sys.stdin.buffer.readline\r\n\r\ndef solution():\r\n n,k=map(int,input().split())\r\n p=k\r\n s=list(input())\r\n t=''\r\n x=list(set(s))\r\n x.sort()\r\n d={}\r\n for i in range(len(x)):\r\n d[x[i]]=i\r\n if k>n:\r\n for i in range(n):\r\n t+=s[i]\r\n for i in range(n,k):\r\n t+=x[0]\r\n else:\r\n k-=1\r\n while s[k]==x[-1] and k>=0:\r\n k-=1 \r\n for i in range(k):\r\n t+=s[i]\r\n ind=d[s[k]]\r\n ind+=1\r\n t+=x[ind]\r\n for i in range(k+1,p):\r\n t+=x[0]\r\n print(t)\r\n\r\nsolution()", "n,k=map(int,input().split())\r\ns=input()\r\nm='a'\r\np=-1\r\nw=[]\r\nmm='z'\r\nfor i in range (n):\r\n w.append(s[i])\r\n if ord(s[i])>ord(m):\r\n m=s[i]\r\n if ord(s[i])<ord(mm):\r\n mm=s[i]\r\nif k<=n:\r\n w1=sorted(list(set(w)))\r\n i=k-1\r\n while w[i]==m:\r\n i-=1\r\n print (s[:i],w1[w1.index(w[i])+1],mm*(k-i-1),sep='')\r\nif k>n:\r\n print (s,mm*(k-n),sep='')\r\n", "c = 'abcdefghijklmnopqrstuvwxyz'\nn, k = map(int, input().split())\nt = input()\ns = set(t)\na = min(c.index(i) for i in s)\nb = max(c.index(i) for i in s)\np = -1\nif k > n:\n\tprint(t + c[a] * (k - n))\n\texit(0)\nfor i in range(k)[::-1]:\n\tif t[i] != c[b]:\n\t\tprint(t[:i] + c[min(c.index(j) for j in s if c.index(j) > c.index(t[i]))] + c[a] * (k - i - 1))\n\t\tbreak", "n,k=map(int,input().split())\r\ns=input()\r\nss=list(set(s))\r\nss.sort()\r\nss=[' ']+ss\r\nif n>k:\r\n s=s[:k]\r\nelif k>n:\r\n s+=ss[1]*(k-n-1)+' '\r\nneed=1\r\nwhile need:\r\n if ss.index(s[-need])<len(ss)-1:\r\n s,need=s[:k-need]+ss[ss.index(s[-need])+1]+ss[1]*(need-1),-1\r\n need+=1\r\nprint(s)\r\n", "n,k=map(int,input().split())\r\ns=list(input())\r\nv=sorted(set(s))\r\na=min(s)\r\nif k>n:\r\n print(\"\".join(s)+a*(k-n))\r\nelse:\r\n res=''\r\n for i in range(k-1,-1,-1):\r\n for j in v:\r\n if s[i]<j:\r\n res=\"\".join(s[:i])+j+v[0]*(k-(i+1))\r\n break \r\n if res:\r\n break \r\n print(res)\r\n \r\n \r\n \r\n \r\n\r\n \r\n \r\n ", "n, k = map(int, input().split())\r\ns = input()\r\nS = set(s)\r\nif k <= n:\r\n for i in reversed(range(k)):\r\n l = filter(lambda x: s[i] < x, S)\r\n l = list(l)\r\n if len(l):\r\n print(s[:i] + min(l) + min(S) * (k - i - 1))\r\n break\r\nelse:\r\n print(s + min(S)*(k-n))\r\n \r\n \r\n ", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\nn, k = map(int, input().split())\r\ns = list(input().rstrip().decode())\r\nmi = min(s)\r\nans = list(s[:k])\r\nif n < k:\r\n ans.append(mi * (k - n))\r\nelse:\r\n s = list(set(s))\r\n s.sort()\r\n ok = 0\r\n for i in range(k - 1, -1, -1):\r\n u = ans[i]\r\n for j in s:\r\n if u < j:\r\n ans[i] = j\r\n ok = 1\r\n break\r\n if ok:\r\n break\r\n ans[i] = mi\r\nans = \"\".join(ans)\r\nsys.stdout.write(ans)", "n, k = map(int, input().split())\r\ns = list(input())\r\nletters = sorted(list(set(s)))\r\n\r\nif k>n:\r\n while k>n:\r\n s.append(letters[0])\r\n k -= 1\r\n print(''.join(s))\r\nelse:\r\n while k<n:\r\n s.pop()\r\n n -= 1\r\n for i in range(n-1, -1, -1):\r\n if s[i] != letters[-1]:\r\n while True:\r\n s[i] = chr(ord(s[i])+1)\r\n if s[i] in letters:\r\n for j in range(i+1, n):\r\n s[j] = letters[0]\r\n print(''.join(s))\r\n exit(0)", "n,k = map(int, input().split())\r\ns = input()\r\nl = list(s)\r\nss = set(s)\r\nans = []\r\nif k > n:\r\n print(s + min(ss)*(k-n)); exit()\r\nfor i in range(k):\r\n ans.append(l[i])\r\nfor i in range(k-1, -1, -1):\r\n if ans[i] < max(ss):\r\n for abc in [chr(fff) for fff in range(ord(ans[i])+1, ord('z')+1)]:\r\n if abc in ss:\r\n ans[i] = abc\r\n break\r\n for j in range(i+1, k):\r\n ans[j] = min(ss)\r\n break\r\nprint(''.join(ans))", "from bisect import bisect_right as right\r\nn,k=map(int,input().split())\r\na=input()\r\ns=list(set(a))\r\ns.sort()\r\nl=[]\r\nif k<=n:\r\n\tc=0\r\n\tfor i in range(k-1,-1,-1):\r\n\t\tc+=1\r\n\t\tif a[i]!=s[-1]:\r\n\t\t\tx=right(s,a[i])\r\n\t\t\tbreak\r\n\tprint(a[:i]+s[x]+s[0]*(c-1))\r\nelse:\r\n\tans=a+s[0]*(k-n)\r\n\tprint(ans)\r\n\r\n", "import bisect\n\nn, k = [int(i) for i in input().split(\" \")]\nst = input()\ns = set(st)\n\nif n >= k:\n\tfor i in reversed(range(k)):\n\t\tarr = list(filter(lambda x: st[i] < x, s))\n\t\tif len(arr) > 0:\n\t\t\tprint(st[:i] + min(arr) + (k - i - 1) * min(s))\n\t\t\tbreak\nelse:\n\tprint(st + (k - n) * min(s))", "(n, k) = map(int, input().split())\r\ns = input()\r\n\r\nletters = [ord(c) for c in set(s)]\r\nletters.sort()\r\n\r\nif(n < k):\r\n print(s+chr(letters[0])*(k-n))\r\n\r\nelse:\r\n t = bytearray(s[:k].encode())\r\n for i in range(k-1, -1, -1):\r\n if t[i] != letters[-1]:\r\n t[i] = letters[letters.index(t[i])+1]\r\n break\r\n t[i] = letters[0]\r\n\r\n print(t.decode())", "import math\r\n\r\n\r\n# 0 1\r\ndef solve():\r\n n, k = map(int, input().split())\r\n ss = input()\r\n s = list(set(ss))\r\n s.sort()\r\n\r\n ans = ['.']*k\r\n if k<=n:\r\n p = ss[:k]\r\n ma = max(s)\r\n mi = min(s)\r\n #when we get maximum, we cant replace it with anything, so we look for charcs less than ma\r\n #that occur first from end(and less than ma), we replace it by char gretaer than it(that exist in set..\r\n x = 1\r\n while x<=k and p[-x]==ma:\r\n x = x +1\r\n #now we got that char\r\n\r\n ind = s.index(p[-x])\r\n replace = s[ind+1]\r\n\r\n\r\n for i in range(k):\r\n ans[i] = ss[i]\r\n ans[k-x] = replace\r\n for i in range(k-x+1,k):\r\n ans[i] = mi\r\n\r\n\r\n\r\n else:\r\n mi = min(ss)\r\n for i in range(n):\r\n ans[i] = ss[i]\r\n for i in range(n,k):\r\n ans[i] = mi\r\n print(''.join(ans))\r\n\r\n\r\n\r\n\r\nfor testis in range(1):\r\n solve()\r\n", "n,k = map(int,input().split())\r\ns = input()\r\nc = list(set(s))\r\nc.sort()\r\nif k > n:\r\n s = s+(c[0]*(k-n))\r\n print(s)\r\n exit()\r\n\r\nt = list(s[0:k])\r\ni = k-1\r\nwhile i > -1:\r\n x = t[i]\r\n if x != c[-1]:\r\n for ee in c:\r\n if ee > x:\r\n t[i] = ee\r\n break\r\n\r\n for j in range(i+1,k):\r\n t[j] = c[0]\r\n\r\n break\r\n\r\n i -= 1\r\n\r\nprint(\"\".join(t))\r\n" ]

[ "import sys\r\ninput = sys.stdin.buffer.readline \r\n\r\ndef process(h, Q):\r\n L1, R1 = 2**(h-1), 2**h-1\r\n Q1 = []\r\n n = 0\r\n for i, L, R, ans in Q:\r\n L2, R2 = 2**(h-i)*L, 2**(h-i)*R+2**(h-i)-1\r\n if ans==0:\r\n Q1.append([L2, 0, n])\r\n Q1.append([R2, 1, n])\r\n n+=1\r\n else:\r\n L1 = max(L1, L2)\r\n R1 = min(R1, R2)\r\n if L1 > R1:\r\n sys.stdout.write('Game cheated!\\n')\r\n return \r\n good = []\r\n seen = 0\r\n Q1.sort()\r\n curr = 2**(h-1)\r\n for x, t, i in Q1:\r\n if t==0:\r\n if seen==0 and x-1 >= curr:\r\n l2 = max(curr, L1)\r\n r2 = min(x-1, R1)\r\n if l2 <= r2:\r\n good.append([l2, r2])\r\n seen+=1\r\n curr = None\r\n else:\r\n seen-=1\r\n if seen==0:\r\n curr = x+1\r\n if curr <= 2**h-1:\r\n l2 = max(curr, L1)\r\n r2= min(2**h-1, R1)\r\n if l2 <= r2:\r\n good.append([l2, r2])\r\n if len(good)==0:\r\n sys.stdout.write('Game cheated!\\n')\r\n return\r\n if len(good) > 1:\r\n sys.stdout.write('Data not sufficient!\\n')\r\n return\r\n l, r = good[0]\r\n if l != r:\r\n sys.stdout.write('Data not sufficient!\\n')\r\n return\r\n sys.stdout.write(f'{l}\\n')\r\n return\r\n \r\n \r\n \r\n \r\n \r\n \r\n\r\nh, q = [int(x) for x in input().split()]\r\nQ = []\r\nfor I in range(q):\r\n i, L, R, ans = [int(x) for x in input().split()]\r\n Q.append([i, L, R, ans])\r\nprocess(h, Q)", "h,q=map(int,input().split())\nd=[(2**h,0),(2**(h-1),0)]\nfor _ in range(q):\n\ti,l,r,a=map(int,input().split())\n\tl,r=l*2**(h-i),(r+1)*2**(h-i)\n\td.extend([[(l,1),(r,-1)],[(0,1),(l,-1),(r,1)]][a])\ns=0\nl=0\nd=sorted(d)\nfor (a,x),(b,_) in zip(d,d[1:]):\n\ts+=x\n\tif a!=b and s==0:q=a;l+=b-a\nprint((\"Game cheated!\",q,\"Data not sufficient!\")[min(l,2)])\n" ]

[ "n =int(input())\r\nns = map(int,input().split())\r\nint_max = 1000000\r\n\r\nsumm = 0\r\nm = int_max\r\n\r\nfor e in ns:\r\n if e > 0:\r\n summ += e\r\n if e % 2 != 0:\r\n m = min(m, abs(e))\r\n\r\nif summ % 2 == 0:\r\n summ -= m \r\n\r\nprint(summ)", "n = int(input())\na = list(map(int, input().split()))\n\nsmallest_odd = 10 ** 4\ns = 0\nfor i in a:\n if i > 0:\n s += i\n if i % 2 != 0:\n smallest_odd = min(smallest_odd, abs(i))\n\nif s % 2 != 1:\n s -= smallest_odd\nprint(s)\n\t\t \t \t \t\t \t \t\t \t \t \t", "def solution(n, a):\n oddMin = 10**4\n isOdd = False\n sum = 0\n for i in range(n):\n if (a[i] > 0):\n sum = sum+a[i]\n if (a[i]%2 !=0):\n isOdd = True\n if (oddMin > abs(a[i])):\n oddMin = abs(a[i])\n if (isOdd == False):\n return -1 \n if (sum%2==0):\n sum = sum - oddMin\n return sum\nn = int(input())\na = list(map(int, input().split()))\nprint(solution(n, a))\n \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\nsu=0\r\nminodd=2147483647\r\nfor i in range(n):\r\n\tif l[i]>0:\r\n\t\tsu+=l[i] \r\n\tif l[i]%2 != 0:\r\n\t\tminodd= min(abs(l[i]),minodd)\r\nif su%2!=0:\r\n print(su)\r\nelse:\r\n print(su-minodd)\r\n", "from collections import defaultdict\r\n\r\n\r\ninf, mod = int(1e18), int(1e9 + 7)\r\nN, M = int(1e5), int(1e6)\r\n\r\n\r\ndef solve():\r\n n = int(input())\r\n a = list(map(int, input().split()))\r\n\r\n pos, neg = [], []\r\n for x in a:\r\n if x > 0:\r\n pos.append(x)\r\n elif x < 0:\r\n neg.append(x)\r\n\r\n pos.sort()\r\n neg.sort()\r\n neg.reverse()\r\n\r\n sm = sum(pos)\r\n\r\n one, two = sum(neg), sum(neg)\r\n for x in pos:\r\n if (sm - x) % 2 == 1:\r\n one = sm - x\r\n break\r\n\r\n for x in neg:\r\n if (sm + x) % 2 == 1:\r\n two = sm + x\r\n break\r\n\r\n # print(f'one = {one} and two = {two}')\r\n\r\n print(max(one, two) if sm % 2 == 0 else sm)\r\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 t = 1\r\n # t = int(input())\r\n for _ in range(t):\r\n solve()\r\n\r\n\r\nmain()\r\n", "n=int(input())\r\narr=list(map(int,input().split()))\r\n\r\nsumm=0\r\nfor i in arr:\r\n if i>0:summ+=i\r\nif summ&1==1:print(summ)\r\nelse:\r\n minn=10**9\r\n for i in arr:\r\n if i%2==1:\r\n minn=min(minn,abs(i))\r\n print(summ-minn)\r\n", "import sys\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\n\r\nminf = -(2*10**9)\r\ndp = [[minf]*2 for _ in range(n+1)]\r\ndp[0][0] = 0\r\n\r\nfor i, x in enumerate(a):\r\n dp[i+1][(0 + x) & 1] = max(dp[i][(0 + x) & 1],\r\n dp[i+1][(0 + x) & 1], dp[i][0] + x)\r\n dp[i+1][(1 + x) & 1] = max(dp[i][(1 + x) & 1],\r\n dp[i+1][(1 + x) & 1], dp[i][1] + x)\r\n\r\nprint(dp[-1][1])\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\nans=0\r\nfor i in range(n):\r\n if l[i]>=0:\r\n ans=ans+l[i]\r\nif ans%2==0:\r\n o=10**9\r\n for i in range(n):\r\n if abs(l[i])%2==1:\r\n o=min(o,abs(l[i]))\r\n print(ans-o)\r\nelse:\r\n print(ans)", "import sys\ninput = sys.stdin.readline\nimport math\nimport copy\nimport collections\nfrom collections import deque\nimport heapq\nimport itertools\nfrom collections import defaultdict\nfrom collections import Counter\n\nn = int(input())\narr = list(map(int,input().split()))\nodds = []\nans = 0\nfor i in range(n):\n if(arr[i]&1):\n odds.append(arr[i])\n else:\n if arr[i]>0:\n ans+=arr[i]\nodds.sort()\nk = len(odds)\nmx = -1e18\nsm = 0\ncount = 0\nfor i in range(k-1,-1,-1):\n sm+=odds[i]\n count+=1\n if count&1:\n mx = max(mx,sm)\nans+=mx\nprint(ans)", "n=int(input())\r\nls=list(map(int,input().split()))\r\nls.sort(reverse=True)\r\ns=0\r\ncntz=0\r\nfor i in range(n):\r\n if ls[i]>0:\r\n s+=ls[i]\r\n cntz+=1\r\n else:\r\n y=i\r\n break\r\nif s%2!=0:\r\n print(s)\r\n exit()\r\ns1=s\r\ns2=s\r\nif cntz==n:\r\n for i in range(n-1,-1,-1):\r\n if ls[i]%2!=0:\r\n s2-=ls[i]\r\n break\r\n print(s2)\r\nelif cntz==0:\r\n for i in range(0,n):\r\n if ls[i]%2!=0:\r\n s1+=ls[i]\r\n break\r\n print(s1)\r\nelse:\r\n for i in range(y,n):\r\n if ls[i]%2!=0:\r\n s1+=ls[i]\r\n break\r\n for i in range(y-1,-1,-1):\r\n if ls[i]%2!=0:\r\n s2-=ls[i]\r\n break\r\n if s1%2==0:\r\n print(s2)\r\n elif s2%2==0:\r\n print(s1)\r\n else:\r\n print(max(s1,s2))", "n = int(input())\r\na = list(map(int, input().split()))\r\ndp = [0] * (n)\r\n# dp[i] = max subs value till that i\r\ndp[0] = max(0, a[0])\r\nfor i in range(1,n):\r\n dp[i] = max(dp[i-1], dp[i-1]+a[i])\r\nop = [x for x in a if x &1 if x > 0] \r\non = [x for x in a if x &1 if x < 0] \r\n# print(dp)\r\n# print(max(o) if o else -1)\r\nif max(dp)&1:\r\n print(max(dp))\r\nelse:\r\n if op and on:\r\n print(max(dp)-min(abs(max(on)), min(op)))\r\n elif op:\r\n print(max(dp)-min(op))\r\n elif on:\r\n print(max(dp)-abs(max(on)))", "n = int(input())\r\na = list(map(int,input().split()))\r\nans = 0\r\nmin_odd = float(\"-inf\")\r\nmax_odd = float(\"inf\")\r\nfor i in a:\r\n if i>0:\r\n ans+=i\r\n if i%2!=0:\r\n if i<0:\r\n min_odd = max(min_odd,i)\r\n else:\r\n max_odd = min(max_odd,i)\r\nif ans%2==0:\r\n print(max(ans+min_odd,ans-max_odd))\r\nelse:\r\n print(ans)\r\n", "n = int(input())\r\na = input().split(\" \")\r\nans = 0\r\nmin_one = 100000\r\nfor j in a:\r\n k = int(j)\r\n if k >= 0:\r\n ans += k\r\n if abs(k) % 2 == 1:\r\n if k > 0:\r\n min_one = min(min_one, k)\r\n else:\r\n min_one = min(min_one, -k)\r\nif ans % 2 == 1:\r\n print(ans)\r\nelse:\r\n print(ans - min_one)\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\nl1,l2,l1e,l1o,l2e,l2o=[],[],[],[],[],[]\r\nfor i in range(len(l)):\r\n if(l[i]>=0):\r\n l1.append(l[i])\r\n else:\r\n l2.append(l[i])\r\nfor i in range(len(l)):\r\n if(l[i]>=0 and l[i]%2==0 and l[i]!=0):\r\n l1e.append(l[i])\r\n elif(l[i]>=0 and l[i]%2!=0 and l[i]!=0):\r\n l1o.append(l[i])\r\n elif(l[i]<0 and l[i]%2==0 and l[i]!=0):\r\n l2e.append(l[i])\r\n elif(l[i]<0 and l[i]%2!=0 and l[i]!=0):\r\n l2o.append(l[i])\r\nl1.sort()\r\nl2.sort()\r\nl1o.sort()\r\nl1e.sort()\r\nl2o.sort()\r\nl2e.sort()\r\n\r\nif(sum(l1)%2!=0):\r\n print(sum(l1))\r\nelse:\r\n if(len(l1o)!=0 and len(l2o)!=0):\r\n print(sum(l1)-min(min(l1o),abs(max(l2o))))\r\n elif(len(l1o)!=0 and len(l2o)==0):\r\n print(sum(l1)-min(l1o))\r\n else:\r\n print(sum(l1)-abs(max(l2o)))\r\n\r\n\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\na = [int(x) for x in input().split(' ')]\r\n\r\ndp = (0, -float('inf'))\r\n\r\nfor i in range(n):\r\n if a[i] % 2 == 0:\r\n dp = (max(a[i], 0) + dp[0], max(a[i], 0) + dp[1])\r\n else:\r\n dp = (max(dp[0], dp[1] + a[i]), max(dp[1], dp[0] + a[i]))\r\n\r\nprint(dp[1])\r\n", "n=int(input())\r\nl=[int(i) for i in input().split()]\r\nl.sort()\r\na=0\r\nfor i in l:\r\n if(i>0):\r\n a+=i\r\nx= float('inf')\r\ny=-1*x \r\n\r\nif(a%2==0):\r\n for i in l:\r\n if(i%2!=0 and i<0):\r\n y=max(y,i)\r\n elif(i%2!=0 and i>0):\r\n x=min(x,i)\r\n a-=min(x,-1*y)\r\nprint(a)", "n=int(input())\r\na=list(map(int,input().split()))\r\ns,en=0,10001\r\nfor x in a:\r\n if x>0: s+=x\r\n if x%2!=0: en=min(en,abs(x))\r\nif s%2==0: s-=en\r\nprint(s)", "# O(n)-solution\r\nimport sys\r\nn=int(sys.stdin.readline())\r\nl=list(map(int,sys.stdin.readline().split()))\r\nans=0\r\nfor i in range(n):\r\n if l[i]>0:\r\n ans+=l[i]\r\nmax_odd_neg=-10**5\r\nmin_odd_pos=10**5\r\nfor i in range(n):\r\n if l[i]%2==1:\r\n if l[i]>0:\r\n min_odd_pos=min(min_odd_pos,l[i])\r\n elif l[i]<0:\r\n max_odd_neg=max(max_odd_neg,l[i])\r\nif ans%2==0:\r\n ans-=min(min_odd_pos,-max_odd_neg)\r\nprint(ans) \r\n \r\n \r\n ", "n=int(input())\r\na=list(map(int,input().split()))\r\nsp=0\r\nmx=1<<33\r\nfor i in a:\r\n if i>0:sp+=i\r\n if i&1:\r\n mx=min(mx,abs(i))\r\nif not sp&1:\r\n sp-=mx\r\nprint(sp)\r\n", "import math as mt \nimport sys,string\ninput=sys.stdin.readline\nimport random\nfrom collections import deque,defaultdict\nL=lambda : list(map(int,input().split()))\nLs=lambda : list(input().split())\nM=lambda : map(int,input().split())\nI=lambda :int(input())\nn=I()\nl=L()\nep=0\nen=0\npo=10**10\nno=10**10\nfor i in range(n):\n if(l[i]>0 and l[i]%2==0):\n ep+=l[i]\n if(l[i]<0 and l[i]%2==0):\n en=min(en,l[i])\n if(l[i]>0 and l[i]%2==1):\n po=min(po,l[i])\n ep+=l[i]\n f=1\n if(l[i]<0 and l[i]%2==1):\n no=min(no,abs(l[i]))\nif(ep%2==1):\n print(ep)\nelse:\n #print(po,no)\n key=10**10\n if(po!=10**10):\n key=po\n if(no!=-10**10):\n key=min(no,key)\n if(key!=10**10):\n print(ep-key)\n\n", "import sys \r\ninput = sys.stdin.readline \r\n\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\np, ng = [], [] \r\nfor i in range(n):\r\n if(a[i] > 0):\r\n p.append(a[i])\r\n elif(a[i] < 0):\r\n ng.append(a[i]) \r\n\r\ns = sum(p) \r\nif(s % 2):\r\n print(s)\r\n exit() \r\np.sort()\r\nng.sort(reverse = True)\r\nf1, f2, j, k = 0, 0, 0, 0\r\nfor i in p:\r\n if(i % 2):\r\n f1 = 1\r\n j = i\r\n break\r\nfor i in ng:\r\n if(i % 2):\r\n f2 = 1\r\n k = i\r\n break \r\nif(f1 and f2):\r\n s = max(s + k, s - j)\r\nelif(f1):\r\n s = s - j \r\nelif(f2):\r\n s = s + k \r\nprint(s)\r\n \r\n ", "n = int(input())\nseq = input().split(\" \")\nsumm = 0\narr = []\nminPosOdd = +999999999999999999999999999999999999\nfoundOdd = False\nfor i in seq:\n arr.append(int(i))\nfor i in range(n): \n if (arr[i] > 0): \n summ = summ + arr[i] \n if (arr[i]%2 != 0): \n foundOdd = True\n if arr[i] > 0:\n minPosOdd = min(minPosOdd, arr[i])\n else:\n minPosOdd = min(minPosOdd, (-1 * arr[i]))\nif (summ%2 == 0): \n summ = summ - minPosOdd \nprint (summ)\n \t \t\t \t \t \t \t \t\t \t \t", "n = int(input())\nA = [int(i) for i in input().split()]\nodd = []\noddn = []\ntotal = 0\nfor a in A:\n if a & 1:\n if a > 0:\n odd.append(a)\n else:\n oddn.append(a)\n else:\n if a > 0:\n total += a\nodd.sort()\noddn.sort()\nif len(odd) & 1:\n total += sum(odd)\nelse:\n total += sum(odd)\n if odd and oddn:\n if odd[0] < -oddn[-1]:\n total -= odd[0]\n else:\n total += oddn[-1]\n elif odd:\n total -= odd[0]\n elif oddn:\n total += oddn[-1]\nprint(total)\n \t\t \t\t \t\t\t \t\t \t\t \t\t", "n = int(input())\na = list(map(int, input().split()))\n\nmaximal = sum(x for x in a if x > 0)\nif maximal % 2 == 1:\n print(maximal)\nelse:\n INF = 1e9\n print(max(\n maximal - min((x for x in a if x > 0 and x & 1), default=INF),\n maximal + max((x for x in a if x < 0 and x & 1), default=-INF),\n ))", "n = int(input())\r\nintr = list(map(int,input().split()))\r\nsam = 0\r\nt = 10**18\r\nfor i in intr:\r\n # print(i)\r\n if i > 0 :\r\n sam+=i\r\n if i % 2 != 0:\r\n t = min(t,abs(i))\r\n # print(t)\r\n# print(sam)\r\n# print(t)\r\nif sam % 2 == 0:\r\n print(sam-t)\r\nelse:\r\n print(sam)\r\n\r\n\r\n", "n = int(input())\nsum_all_pos = 0\nnumbers = list(map(int, input().split()))\nfor num in numbers:\n if num > 0:\n # Directly return all positive numbers sum if odd\n sum_all_pos += num\n\n\ndef isOdd(val):\n return val % 2\n\n\nif isOdd(sum_all_pos):\n print(sum_all_pos)\nelse:\n # even - odd = odd\n # Removes the minimum positive odd number or add the maximum negative\n odd = []\n for num in numbers:\n if isOdd(num):\n odd.append(abs(num))\n\n print(sum_all_pos - min(odd))\n\n\t \t \t\t \t\t\t \t \t \t \t \t \t \t\t", "n = int(input())\r\na = list(map(int, input().split()))\r\n\r\ns = []\r\ns2 = []\r\n\r\nfor i in a:\r\n if i > 0:\r\n s.append(i)\r\n elif i < 0:\r\n s2.append(i)\r\n \r\ns.sort()\r\ns2 = sorted(s2)[::-1]\r\n\r\nif sum(s)%2:\r\n print(sum(s))\r\nelse:\r\n sm = sum(s)\r\n mn = 1e18\r\n \r\n for i in s2:\r\n if i%2:\r\n mn = min(abs(i), mn)\r\n break\r\n \r\n for i in s:\r\n if i%2:\r\n mn = min(i, mn)\r\n \r\n print(sm-mn)", "import math\r\nn=int(input())\r\n#n,m = map(int, input().strip().split(' '))\r\nlst = list(map(int, input().strip().split(' ')))\r\ns=0\r\nc=0\r\nm=-100000\r\nm1=100000\r\nfor j in range(n):\r\n if lst[j]>0:\r\n s+=lst[j]\r\n if lst[j]%2!=0:\r\n c+=1\r\n if abs(lst[j])%2!=0 and lst[j]<0:\r\n if lst[j]>m:\r\n m=lst[j]\r\n if abs(lst[j])%2!=0 and lst[j]>0:\r\n if lst[j]<m1:\r\n m1=lst[j] \r\nif s%2!=0:\r\n print(s)\r\nelse:\r\n \r\n if c==0:\r\n print(s+m)\r\n else:\r\n print(max(s-m1,s+m))\r\n ", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\na = [int(x) for x in input().split(' ')]\r\n\r\ndp = [(0, -float('inf'))]\r\n\r\nfor i in range(n):\r\n if a[i] % 2 == 0:\r\n dp.append((max(a[i], 0) + dp[-1][0], max(a[i], 0) + dp[-1][1]))\r\n else:\r\n dp.append((max(dp[-1][0], dp[-1][1] + a[i]), max(dp[-1][1], dp[-1][0] + a[i])))\r\n\r\nprint(dp[-1][1])\r\n", "n=int(input())\r\n\r\nl1=[int(i) for i in input().split(\" \")]\r\n\r\nk=0\r\nminp=100000\r\nminn =-100000\r\n\r\n\r\n\r\n\r\nfor i in l1:\r\n if i>0:\r\n k+=i\r\n if(i%2!=0):\r\n minp=min(minp,i)\r\n elif i<0 and i%2!=0:\r\n minn=max(minn,i)\r\n\r\n\r\nif k%2!=0:\r\n print(k)\r\nelse:\r\n if minp!=100000 and minn!=-100000:\r\n print(max(k-minp,k+minn))\r\n elif minp==100000:\r\n print(k+minn)\r\n else:\r\n print(k-minp)\r\n ", "def solve(n,arr):\r\n ans = 0\r\n min_odd = float('inf')\r\n max_neg = float('-inf')\r\n for v in arr:\r\n if v < 0:\r\n if abs(v) % 2 == 1:\r\n max_neg = max(max_neg, v)\r\n else:\r\n ans += v\r\n if v % 2 == 1:\r\n min_odd = min(min_odd, v)\r\n\r\n if ans % 2 == 0:\r\n ans -= min(min_odd, -max_neg)\r\n print(ans)\r\n\r\nn = int(input())\r\narr = list(map(int, input().split()))\r\nsolve(n,arr)\r\n", "_ = int(input())\r\na = list(map(int, input().split()))\r\n\r\nr = sum([i for i in a if 0<i])\r\nif r%2 == 1: print(r)\r\nelse: print(max(r+max([i for i in a if (i%2 == 1) and (i<0)], default=-10**12), r-min([i for i in a if (i%2 == 1) and (0<i)], default=10**12)))", "n = int(input())\narr = list(map(int,input().strip().split()))\nm = 2**31\nres = 0\nodd = False\nfor i in range(n):\n\tif arr[i]>0:\n\t\tres+=arr[i]\n\tif arr[i]%2!=0:\n\t\todd = True\n\t\tm = min(m,abs(arr[i]))\nif not odd:\n\tprint(-1)\nelse:\n\tif res%2==0:\n\t\tres-=m\n\tprint(res)\n\n\t\t \t\t\t\t\t \t \t \t\t\t\t\t\t\t \t \t\t \t\t", "t=1\r\nwhile t>0:\r\n t-=1\r\n n=int(input())\r\n a=list(map(int,input().split()))\r\n sum=0\r\n x=0x3f3f3f3f\r\n y=-0x3f3f3f3f\r\n a.sort()\r\n for i in range(n):\r\n if a[i]>0:\r\n sum+=a[i]\r\n if a[i]>0 and a[i]%2==1:\r\n x=min(a[i],x)\r\n if a[i]<0 and a[i]%2==1:\r\n y=max(a[i],y)\r\n if sum%2==1:\r\n print(sum)\r\n else:\r\n sum=max(sum-x,sum+y)\r\n print(sum)", "import sys\ninput = sys.stdin.readline\n\n'''\n\n'''\n\nn = int(input())\na = list(map(int, input().split()))\ntot = 0\nfor ai in a:\n if ai > 0:\n tot += ai\n\nif tot % 2:\n print(tot)\n sys.exit()\n\n# tot is even\na = sorted(map(abs, a))\nfor p in a:\n if p % 2:\n tot -= p\n print(tot)\n sys.exit()", "n=int(input())\r\narr=list(map(int,input().split()))\r\no,e=-10**8,-10**8\r\nfor i in range(n):\r\n if i==0 and arr[i]%2:o=arr[i]\r\n elif i==0 and arr[i]%2==0:e=arr[i]\r\n elif arr[i]%2==0:\r\n if o!=-10**8:\r\n o=max(o,arr[i]+o)\r\n e=max(e,e+arr[i],arr[i])\r\n else:\r\n temp=e\r\n if o!=-10**8:\r\n e=max(e,o+arr[i])\r\n o=max(o,temp+arr[i],arr[i])\r\nprint(o)\r\n", "n = int(input())\r\nA = list(map(int, input().split()))\r\n\r\nINF = 10**18\r\ndp = [-INF]*2\r\ndp[0] = 0\r\nfor i, a in enumerate(A):\r\n nx = [0, 0]\r\n if a%2 == 0:\r\n nx[0] = max(dp[0]+a, dp[0])\r\n nx[1] = max(dp[1]+a, dp[1])\r\n else:\r\n nx[0] = max(dp[1]+a, dp[0])\r\n nx[1] = max(dp[0]+a, dp[1])\r\n dp = nx\r\nprint(dp[1])\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\np=9999\r\nne=-9999\r\ns=0\r\nfor i in l:\r\n if(i>0):\r\n s+=i\r\n if(i%2==1 and i<p):\r\n p=i\r\n elif(i%2==1 and i>ne):\r\n ne=i\r\nif(s%2==0):\r\n print(s-min(p,-ne))\r\nelse:\r\n print(s)\r\n \r\n ", "# B. Odd sum\r\nn = int(input())\r\nvals = input().split()\r\nlist_a = [int(val) for val in vals]\r\n\r\n# we use max_even, max_odd for the answer\r\nmax_even = None\r\nmax_odd = None\r\n\r\nfor a in list_a:\r\n # before I can max_even, max_odd, I save them first\r\n me = max_even\r\n mo = max_odd\r\n if a % 2 == 0: # even\r\n if mo is not None:\r\n max_odd = max(mo, mo+a)\r\n if me is None:\r\n max_even = a\r\n else:\r\n max_even = max(me, a, me+a)\r\n else: # odd\r\n if me is None and mo is None:\r\n max_odd = a\r\n elif me is None: # mo is not None\r\n max_odd = max(mo, a)\r\n max_even = mo + a\r\n elif mo is None:\r\n max_odd = max(a, me+a)\r\n else: # me is not None, mo is not None\r\n max_odd = max(mo, a, me+a)\r\n max_even = max(me, mo+a)\r\n\r\nprint(max_odd)\r\n\r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\nINF=10**18\r\ndp=[[-INF]*2 for i in range(n)]\r\nif a[0]%2==0:\r\n dp[0][0]=a[0]\r\nelse:\r\n dp[0][1]=a[0]\r\nfor i in range(1,n):\r\n if a[i]%2:\r\n dp[i][0]=max(dp[i-1][1]+a[i],dp[i-1][0])\r\n dp[i][1]=max([a[i],dp[i-1][0]+a[i],dp[i-1][1]])\r\n else:\r\n dp[i][0]=max([a[i],dp[i-1][0]+a[i],dp[i-1][0]])\r\n dp[i][1]=max(dp[i-1][1]+a[i],dp[i-1][1])\r\nprint(dp[-1][1])", "import math\r\nn = int(input())\r\nl = list(map(int, input().split()))\r\ns = 0\r\nfor i in range(n):\r\n if l[i]>0:\r\n s+=l[i]\r\nif s%2 != 0:\r\n print(s)\r\nelse:\r\n m = math.inf\r\n d = math.inf * -1\r\n f = 0\r\n g = 0\r\n for i in range(n):\r\n if l[i]>0 and l[i]<m and l[i]%2!=0:\r\n m = l[i]\r\n f = 1\r\n if l[i]<0 and l[i]>d and l[i]%2!=0:\r\n d = l[i]\r\n g = 1\r\n e = math.inf*-1\r\n h = math.inf*-1\r\n if f == 1:\r\n e = s-m\r\n if g == 1:\r\n h = s+d\r\n print(e if e>h else h)", "#region Header\r\n#!/usr/bin/env python3\r\n# from typing import *\r\n\r\nimport sys\r\nimport io\r\nimport math\r\nimport collections\r\nimport decimal\r\nimport itertools\r\nimport bisect\r\nimport heapq\r\n\r\n\r\ndef input():\r\n return sys.stdin.readline()[:-1]\r\n\r\n\r\n# sys.setrecursionlimit(1000000)\r\n#endregion\r\n\r\n# _INPUT = \"\"\"4\r\n# -2 2 -3 1\r\n# \"\"\"\r\n# sys.stdin = io.StringIO(_INPUT)\r\n\r\ndef main():\r\n INF = 10**10\r\n N = int(input())\r\n A = list(map(int, input().split()))\r\n\r\n dp_even = [0] * (N+1)\r\n dp_odd = [0] * (N+1)\r\n dp_even[0] = 0\r\n dp_odd[0] = -INF\r\n for i in range(1, N+1):\r\n if A[i-1] % 2 == 0:\r\n dp_even[i] = max(dp_even[i-1], dp_even[i-1] + A[i-1])\r\n\r\n if dp_odd[i-1] != -INF:\r\n dp_odd[i] = max(dp_odd[i-1], dp_odd[i-1] + A[i-1])\r\n else:\r\n dp_odd[i] = -INF\r\n\r\n else:\r\n if dp_odd[i-1] != -INF:\r\n dp_even[i] = max(dp_even[i-1], dp_odd[i-1] + A[i-1])\r\n else:\r\n dp_even[i] = dp_even[i-1]\r\n\r\n dp_odd[i] = max(dp_odd[i-1], dp_even[i-1] + A[i-1])\r\n\r\n print(dp_odd[N])\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "\nn = int(input())\na = list(map(int,input().split()))\ns=0\nmi = 100000000\nfor i in a:\n \n if i>0:\n s+=i\n if i%2==1:\n mi = min(mi,abs(i))\n\nif s%2==0:\n s -= mi\nprint(s)\n \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=[]\r\nl2=[]\r\nl3=[]\r\nl4=[]\r\nfor i in l:\r\n if i>0:\r\n if i%2==0: \r\n l1.append(i)\r\n else:\r\n l2.append(i)\r\n elif i<0:\r\n if i%2==0:\r\n l3.append(i)\r\n else:\r\n l4.append(i)\r\nl1.sort()\r\nl2.sort()\r\nl3.sort()\r\nl4.sort()\r\nans=sum(l1)+sum(l2)\r\nif ans%2!=0:\r\n print(ans)\r\nelse:\r\n if len(l4)!=0 and len(l2)!=0:\r\n if l2[0]>abs(l4[-1]):\r\n print(ans+l4[-1])\r\n else:\r\n print(ans-l2[0])\r\n elif len(l4)==0 and len(l2)!=0:\r\n print(ans-l2[0])\r\n elif len(l4)!=0 and len(l2)==0:\r\n print(ans+l4[-1])\r\n \r\n", "n = int(input())\r\narr = [int(i) for i in input().split()]\r\ns = 0\r\nfor i in range(n):\r\n if arr[i] > 0:\r\n s += arr[i]\r\nif s%2 != 0:\r\n print(s)\r\nelse:\r\n m = 100000\r\n for i in range(n):\r\n if arr[i] > 0 and arr[i]%2 != 0:\r\n m = min(m,arr[i])\r\n ans = s - m\r\n for i in range(n):\r\n if arr[i] < 0 and arr[i]%2 != 0:\r\n ans = max(ans,s+arr[i])\r\n print(ans)\r\n\r\n", "n = int(input())\narr = list(map(int,input().split()))\ns = sum([a for a in arr if a>0])\nif s%2==1:\n print(s)\nelse:\n mn_odd = 10001\n for ele in arr:\n if ele%2==1 and ele>0:\n mn_odd = min(mn_odd,ele)\n mx_odd = -10001\n for ele in arr:\n if ele%2==1 and ele<0:\n mx_odd = max(mx_odd,ele)\n print(max(s-mn_odd,s+mx_odd))\n\t\t\t\t\t \t\t\t\t \t\t\t\t\t \t \t\t", "n = int(input())\nmas = list(map(int, input().split()))\nsumm = 0\nmaxx = -10 ** 4 - 1\nminn = 10 ** 4 + 1\nfor i in mas:\n if i > 0:\n summ += i\n if i < 0 and i % 2 != 0 and i > maxx:\n maxx = i\n if i > 0 and i % 2 != 0 and i < minn:\n minn = i\nif summ % 2 == 0:\n summ -= min(minn, -maxx)\nprint(summ)", "# odd subsequence\r\n \r\n\"\"\"\r\nWe will use greedy algorithm here.\r\nIt is obvious that we should take all positive integers.\r\nIf the sum is odd, that's our answer.\r\nBut when the sum is even, we will need to do one of the following:\r\n+ Add a negative odd number from outside\r\n+ Remove a positive odd number from inside\r\nWhen adding a negative odd number, we should take the biggest one.\r\nWhen removing a positive odd number, we should take the smallest one.\r\nAmong the 2 choices, pick the one that results in the better answer.\r\n\"\"\"\r\n \r\n# input\r\nn = int(input())\r\na = list(map(int, input().split()))\r\n \r\nsum, positive_odd, negative_odd = 0, 100000, -100000\r\n \r\nfor u in a:\r\n if u > 0:\r\n sum += u\r\n \r\n if u % 2 == 1:\r\n if u > 0:\r\n positive_odd = min(positive_odd, u)\r\n else:\r\n negative_odd = max(negative_odd, u)\r\n \r\nif sum % 2 == 0:\r\n sum = max(sum + negative_odd, sum - positive_odd)\r\n \r\nprint(sum)\r\n \r\n ", "n=int(input())\r\na=list(map(int,input().split()))\r\nsum = 0\r\nmin_odd = 10001\r\nfor x in a:\r\n if(x > 0):\r\n sum += x\r\n if(x % 2 != 0):\r\n min_odd = min(abs(x),min_odd)\r\nif(sum % 2 != 1):\r\n sum -= min_odd\r\nprint(sum)", "import math\nfrom collections import defaultdict\nn = int(input())\narr = list(map(int, input().split()))\neven = [0] * n\nodd = [-math.inf] * n\nif arr[0] % 2:\n odd[0] = arr[0]\nelse:\n even[0] = arr[0]\nfor i in range(1, n):\n if arr[i] % 2 == 1:\n odd[i] = max(even[i-1] + arr[i], odd[i-1], arr[i])\n even[i] = max(odd[i-1] + arr[i], even[i-1])\n else:\n even[i] = max(even[i-1], even[i-1] + arr[i], arr[i])\n odd[i] = max(odd[i-1] + arr[i], odd[i-1])\n\n# print(odd)\n# print(even)\nprint(odd[-1])\n\n\n\t \t \t \t\t\t \t\t\t\t\t \t \t", "import sys\nn = int(sys.stdin.readline())\nstrnums = sys.stdin.readline().split()\n\nmin_temp = -100000\nmax_temp = 100000\ntotal = 0\n\nfor i in range(n):\n num = int(strnums[i])\n if num > 0:\n total += num\n if num % 2 == 1:\n max_temp = min(max_temp, num)\n elif num < 0:\n if num % 2 == 1:\n min_temp = max(min_temp, num)\nif total % 2 == 1:\n print(total)\nelse:\n i = total - max_temp\n j = total + min_temp\n print(max(i, j))\n \t\t \t \t \t\t\t \t\t \t\t \t\t\t\t\t\t", "#Tristan Hull\n\namount = input()\ncases = input()\ncases = cases.split()\ncases = list(map(int,cases))\n\nminOdd = +2147483\nsum = 0\n\nfor i in range(int(amount)):\n if cases[i] > 0:\n sum = sum + cases[i]\n if cases[i]%2 != 0:\n if minOdd > abs(cases[i]):\n minOdd = abs(cases[i])\nif sum%2 == 0:\n sum = sum - minOdd\n\nprint(sum)\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\na=list(map(int,input().split()))\r\nevenpos=[]\r\nevenneg=[]\r\noddpos=[]\r\noddneg=[]\r\nans=0\r\nver=False\r\nfor i in range(n):\r\n if a[i]>0:\r\n if a[i]%2==0:\r\n evenpos.append(a[i])\r\n else:\r\n oddpos.append(a[i])\r\n else:\r\n if a[i]%2==0:\r\n evenneg.append(a[i])\r\n else:\r\n oddneg.append(a[i])\r\nans+=sum(evenpos)\r\nevenneg.sort(reverse=True)\r\noddneg.sort(reverse=True)\r\noddpos.sort()\r\nif len(oddpos)>0:\r\n ver=True\r\n if len(oddpos)%2==1:\r\n ans+=sum(oddpos)\r\n else:\r\n ans+=sum(oddpos[1:])\r\n if len(oddneg)>0:\r\n if oddpos[0]+oddneg[0]>=0:\r\n ans+=oddpos[0]+oddneg[0]\r\nif ver==False:\r\n ans+=oddneg[0]\r\nprint(ans)", "n=int(input())\r\na=list(map(int,input().split()))\r\neven=-float(\"Inf\")\r\nodd=-float(\"Inf\")\r\nfor i in range(n):\r\n if a[i]%2==0:\r\n even=max([even+a[i],a[i],even])\r\n odd=max([odd+a[i],odd])\r\n if a[i]%2!=0:\r\n odd,even=max([even+a[i],odd,a[i]]),max([odd+a[i],even])\r\nif odd%2==0:\r\n print(0)\r\nelse:\r\n print(odd)\r\n ", "n = int(input())\r\nans = 0\r\nzo = float(\"inf\")\r\nfo = float(\"-inf\")\r\noc = 0\r\nfor c in map(int,input().split()):\r\n if c>=0:\r\n ans+=c\r\n if c%2==1:\r\n zo = min(zo,c)\r\n oc^=1\r\n elif c%2:\r\n fo = max(fo,c);\r\nif oc:\r\n print(ans)\r\nelse:\r\n print(max(ans-zo,ans+fo))\r\n ", "\r\nn = int(input())\r\na = list(map(int,input().split()))\r\ns=0\r\nmi = 100000000\r\nfor i in a:\r\n \r\n if i>0:\r\n s+=i\r\n if i%2==1:\r\n mi = min(mi,abs(i))\r\n\r\nif s%2==0:\r\n s -= mi\r\nprint(s)", "n=int(input())\r\nl=list(map(int,input().split()))\r\ns=sum(p for p in l if p>0)\r\nif s%2:\r\n print(s)\r\nelse:\r\n s-=min([abs(p) for p in l if p%2!=0])\r\n print(s)", "def makeodd(listt):\r\n c=0\r\n for r in range(len(listt)):\r\n if listt[r]%2==0:\r\n listt[r]=\"blah\"\r\n c+=1\r\n for e in range(c):\r\n listt.remove(\"blah\")\r\nn=int(input())\r\ninp=input()\r\nnums=inp.split(\" \")\r\nfor w in range(len(nums)):\r\n nums[w]=int(nums[w])\r\nsum=0\r\ntsum=0\r\nneg=[]\r\npos=[]\r\nan=False\r\nnoTroll=True\r\nfor i in range(n):\r\n if nums[i]>0:\r\n sum+=nums[i]\r\n pos.append(nums[i])\r\n elif nums[i]<0:\r\n neg.append(nums[i])\r\nif sum%2==1:\r\n print(sum)\r\nelse:\r\n neg.sort()\r\n neg.reverse()\r\n pos.sort()\r\n makeodd(neg)\r\n makeodd(pos)\r\n z=0\r\n while sum%2==0 and noTroll:\r\n if len(pos)>z and len(neg)>z:\r\n if pos[z]%2!=0 and pos[z]<neg[z]*-1:\r\n sum-=pos[z]\r\n break\r\n elif neg[z]%2!=0:\r\n for q in range(len(pos)-z):\r\n if pos[q+z]>neg[z]*-1 and pos[q+z]%2!=0:\r\n an=True\r\n break \r\n if an:\r\n sum+=neg[z]\r\n break\r\n elif len(neg)>z:\r\n if neg[z]%2!=0:\r\n sum+=neg[z]\r\n break\r\n else:\r\n if len(pos)>z:\r\n if pos[z]%2!=0:\r\n sum-=pos[z]\r\n break\r\n z+=1\r\n print(sum)", "import sys\r\ninput = sys.stdin.readline\r\nn = int(input())\r\na = list(map(int,input().split()))\r\nmn = int(1e18)\r\nsums = 0\r\n\r\nfor i in range(n):\r\n \r\n sums += max(0,a[i])\r\n \r\n if a[i]%2 != 0:\r\n mn = min(mn, abs(a[i]))\r\n\r\nprint(sums if sums%2!=0 else sums - mn)", "def OddSum(n,a):\r\n c = 0\r\n \r\n a.sort(reverse=True)\r\n \r\n i=0\r\n minposodd = 99999\r\n maxnegodd = -99999\r\n \r\n while i<n:\r\n if a[i]>0: \r\n c = c + a[i]\r\n \r\n if a[i]%2==1 :\r\n if a[i]>0:\r\n minposodd = min (minposodd, a[i])\r\n else:\r\n maxnegodd = max (maxnegodd, a[i])\r\n i = i + 1\r\n \r\n if c%2==1:\r\n return c\r\n\r\n if minposodd < abs (maxnegodd):\r\n c = c - minposodd\r\n else:\r\n c = c - abs(maxnegodd)\r\n \r\n return c\r\n\r\n \r\nn = int(input())\r\na = list(map(int, input().rstrip().split()))\r\n\r\nans = OddSum(n, a)\r\n\r\nprint(ans)\r\n", "n = int(input())\r\nl = list(map(int,input().split()))\r\nmaxsum = 0\r\nminiodd = float('-inf')\r\nmaxnegodd = float('-inf')\r\nfor i in l:\r\n if i>0: \r\n maxsum+=i\r\n if i%2==1: \r\n if miniodd==float('-inf'):miniodd=i\r\n else: miniodd = min(miniodd,i)\r\n else:\r\n if abs(i)%2==1:\r\n if maxnegodd==float('-inf'): maxnegodd=i\r\n else: maxnegodd = max(maxnegodd,i)\r\n\r\nif(maxsum%2==1):\r\n print(maxsum)\r\nelse:\r\n if miniodd!=float('-inf') and maxnegodd!=float('-inf'):\r\n ans = maxsum-min(miniodd,abs(maxnegodd))\r\n elif miniodd!=float('-inf'):\r\n ans = maxsum-miniodd\r\n elif maxnegodd!=float('-inf'):\r\n ans = maxsum+maxnegodd\r\n print(ans)\r\n \r\n\r\n", "n = int(input())\narr = list(map(int, input().split()))\n\ntotalSum = 0\nfor i in arr:\n if (i > 0):\n totalSum += i\n\nif (totalSum % 2 == 0):\n minOdd = 10**9\n for i in arr:\n if (abs(i) % 2 == 1 and abs(i) < minOdd):\n minOdd = abs(i)\n\n totalSum -= minOdd\nprint(totalSum)", "n=int(input())\r\narr=[int(x) for x in input().split()]\r\neven=[]\r\nodd=[]\r\nodd_n=[]\r\ns=0\r\nfor i in arr:\r\n if i>0:\r\n s+=i\r\n if i%2:\r\n odd.append(i)\r\n else:\r\n even.append(i)\r\n else:\r\n if i%2:\r\n odd_n.append(i)\r\nif s%2:\r\n print(s)\r\nelse:\r\n if len(odd)>0 and len(odd_n)>0:\r\n s=max(s-min(odd),s+max(odd_n))\r\n elif len(odd)>0:\r\n s=s-min(odd)\r\n else:\r\n s+=max(odd_n)\r\n print(s)", "input()\r\ns,q=0,10**4\r\nfor i in map(int,input().split()):\r\n if i>0:s+=i\r\n if i%2!=0:q=min(abs(i),q)\r\nif s%2!=1:s-=q\r\nprint(s)", "n = int(input())\r\nseq = list(map(int, input().split()))\r\npos = []\r\nneg = []\r\nposver = []\r\nboth = []\r\nfor x in seq:\r\n if x >= 0:\r\n pos.append(x)\r\n both.append(x)\r\n else:\r\n neg.append(x)\r\n both.append(0-x)\r\n#print(both)\r\npossum = sum(pos)\r\n#print(possum)\r\nboth.sort()\r\nif possum%2 == 1:\r\n print(possum)\r\nelse:\r\n for x in both:\r\n if x%2 == 1:\r\n print(possum - x)\r\n break", "# cook your dish here\r\nn=int(input())\r\nar=list(map(int,input().split()))\r\nse=0\r\nso=0 \r\nminop=10000\r\nmaxon=-10000\r\ncnt=0\r\nfor i in range(n):\r\n if(ar[i]>0):\r\n se+=ar[i]\r\n \r\n if(ar[i]%2 and ar[i]>0):\r\n minop=min(minop,ar[i])\r\n elif(ar[i]%2 and ar[i]<0):\r\n maxon=max(maxon,ar[i])\r\n \r\nif(se%2):\r\n print(se)\r\nelse:\r\n print(se-min(minop,-maxon))", "n=int(input())\r\nli=list(map(int,input().split()))\r\npos_sum=0\r\nmop=False\r\nmon=False\r\nmin_od=int(pow(10,6))\r\nmax_od=int(pow(10,6))\r\nmax_od*=-1\r\nfor i in range(n):\r\n if li[i]>0:\r\n pos_sum+=li[i]\r\n if li[i]%2!=0:\r\n mop=True\r\n min_od=min(min_od,li[i])\r\n else:\r\n if (abs(li[i])%2)!=0:\r\n mon=True\r\n max_od=max(max_od,li[i])\r\nif pos_sum%2!=0:\r\n print(pos_sum)\r\nelse:\r\n if mon==True and mop==True:\r\n print(max(pos_sum+max_od,pos_sum-min_od))\r\n elif mon==True:\r\n print(pos_sum+max_od)\r\n else:\r\n print(pos_sum-min_od)\r\n\r\n\r\n", "\"\"\"**************************************************************\\\r\n BISMILLAHIR RAHMANIR RAHIM\r\n****************************************************************\r\n AUTHOR NAME: MD. TAHURUZZOHA TUHIN\r\n\\**************************************************************\"\"\"\r\n\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\nans = 0\r\nmin_odd = float(\"-inf\")\r\nmax_odd = float(\"inf\")\r\nfor i in a:\r\n if i > 0:\r\n ans += i\r\n if i % 2 != 0:\r\n if i < 0:\r\n min_odd = max(min_odd, i)\r\n else:\r\n max_odd = min(max_odd, i)\r\nif ans % 2 == 0:\r\n print(max(ans+min_odd, ans-max_odd))\r\nelse:\r\n print(ans)\r\n", "from sys import stdin\r\ninput = stdin.readline\r\n\r\nn = int(input())\r\na = [int(x) for x in input().split()]\r\nans = 0\r\nnumber_odd = 0\r\nbiggest_negative_odd = float(\"-inf\")\r\nsmallest_positive_odd = float(\"inf\")\r\nfor i in a:\r\n if i % 2 == 0:\r\n if i > 0:\r\n ans += i\r\n else:\r\n if i > 0:\r\n number_odd += 1\r\n smallest_positive_odd = min(smallest_positive_odd, i)\r\n ans += i\r\n else:\r\n biggest_negative_odd = max(biggest_negative_odd, i)\r\nif number_odd == 0:\r\n ans += biggest_negative_odd\r\nelif number_odd % 2 == 0:\r\n ans = max(ans - smallest_positive_odd, ans + biggest_negative_odd)\r\nprint(ans)", "input()\n\nl = list(map(int, input().split()))\n\npos = []\nneg = []\n\nfor num in l:\n if num < 0:\n neg.append(num)\n else:\n pos.append(num)\n \nneg.sort()\npos.sort()\n\ntotal = sum(pos)\n\nif total % 2 == 1:\n print(total)\nelse:\n lowest = 10**10\n\n for num in pos:\n if num % 2 == 1 and num < lowest:\n lowest = num\n\n highest = -(10**10)\n\n for num in neg:\n if -num % 2 == 1 and num > highest :\n highest = num\n\n temp = min(-highest, lowest)\n\n print(total - temp)\n\t\t \t\t\t\t\t\t\t \t\t\t \t\t \t\t \t", "n = int(input())\r\na = list(map(int, input().split()))\r\n \r\ndp = [0, -(10 ** 9)]\r\n \r\nfor u in a:\r\n ndp = dp[:]\r\n for i in range(2):\r\n ndp[(i + u) % 2] = max(ndp[(i + u) % 2], dp[i] + u)\r\n dp = ndp[:]\r\n \r\nprint(dp[1])", "# https://codeforces.com/problemset/problem/1251/C\r\n# check for all the parties before this number\r\n\r\nn = int(input())\r\na = list(map(int, input().split(\" \")))\r\ns = 0\r\nod = []\r\nod_neg = []\r\nfor i in range(n):\r\n if a[i]>0:\r\n s+=a[i]\r\n if a[i]>0 and a[i]%2:\r\n od.append(a[i])\r\n elif a[i] < 0 and a[i]%2:\r\n od_neg.append(a[i])\r\nod.sort()\r\nod_neg.sort()\r\nif s%2:\r\n print(s)\r\nelse:\r\n if od and od_neg:\r\n print(max(s-od[0], s + od_neg[-1]))\r\n elif od:\r\n print(s-od[0])\r\n elif od_neg:\r\n print(s+od_neg[-1])\r\n else:\r\n print(0)", "n=int(input())\r\na=list(map(int, input().split()))\r\nans=0\r\nfor i in range(n):\r\n if a[i]>0:\r\n ans+=a[i]\r\n\r\nif ans%2!=0:\r\n print(ans)\r\nelse:\r\n x=[i for i in a if i%2!=0 and i<0]\r\n y=[i for i in a if i%2!=0 and i>0]\r\n x=sorted(x)\r\n y=sorted(y)\r\n if x and y:\r\n if abs(x[-1])>abs(y[0]):\r\n print(ans-y[0])\r\n else:\r\n print(ans+x[-1])\r\n elif y:\r\n print(ans-y[0])\r\n elif x:\r\n print(ans+x[-1])\r\n else:\r\n print(-1)\r\n \r\n \r\n ", "n = int(input())\r\na=list(map(int,input().split()))\r\n \r\nmx_neg = -10**9\r\nmn_pos = 10**9\r\ne = 0\r\n \r\nfor i in range(n):\r\n if a[i]>=0:\r\n e+=a[i]\r\n if a[i]%2==1:\r\n mn_pos=min(mn_pos, a[i])\r\n else:\r\n if a[i]%2==1:\r\n mx_neg=max(mx_neg, a[i])\r\n \r\nif e%2==1:\r\n print(e)\r\nelse:\r\n if mn_pos==10**9:\r\n print(e+mx_neg)\r\n else:\r\n if mx_neg!=-10**9:\r\n print(max(e-mn_pos, e+mx_neg))\r\n else:\r\n print(e-mn_pos)\r\n ", "n=int(input())\r\nA=[int(num) for num in input().split()]\r\nodd=sorted(list(filter(lambda t:t%2!=0,A)),reverse=True)\r\neven=sorted(list(filter(lambda t:t%2==0,A)),reverse=True)\r\nmax_ev=0\r\ni=0\r\nwhile i<len(even) and even[i]>0:\r\n max_ev+=even[i]\r\n i+=1\r\nd=[]\r\nfor j in odd:\r\n if d==[]:\r\n d.append(j)\r\n else:\r\n d.append(j+d[-1])\r\ni=0\r\nm_o=None\r\nwhile i<len(d):\r\n if m_o is None:\r\n m_o=d[i]\r\n elif d[i]>m_o:\r\n m_o=d[i]\r\n i+=2\r\nif max_ev>0:\r\n m_o+=max_ev\r\nprint(m_o)\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "n = int(input())\nl = list(map(int,input().split()))\nsum_l = int(0)\nm1,m2 = -10**5,10**5\nfor ele in l:\n if ele > 0:\n sum_l += ele\n if ele %2 !=0:\n if ele<0:\n m1 = max(m1,ele)\n else:\n m2 = min(m2,ele)\n\nif sum_l%2!=0:\n print(sum_l)\nelse:\n if m1!=-10**5 and m2!=10**5:\n if abs(m1)<abs(m2):\n sum_l += m1\n else:\n sum_l -= m2\n elif m1!=-10**5:\n sum_l += m1\n else:\n sum_l -=m2\n print(sum_l)\n\n", "l=lambda:map(int,input().split())\r\np=lambda:int(input())\r\nss=lambda:input()\r\n\r\nn=p()\r\na=list(l())\r\npos_od,pos_ev,neg_odd=0,0,-100000\r\nans=-100000\r\npre=100000\r\nfor i in a:\r\n # positive_odd\r\n # positive_even\r\n # negative_odd\r\n if i%2 and i>0:\r\n pos_od+=i\r\n pre=min(pre,i)\r\n elif i%2 and i<0:\r\n neg_odd=max(neg_odd,i)\r\n elif i%2==0 and i>0:\r\n pos_ev+=i\r\nif (pos_od+pos_ev)%2:\r\n ans=max(ans,pos_od+pos_ev)\r\nelse:\r\n ans=max(ans,pos_ev+pos_od-pre)\r\nif (neg_odd+pos_ev)%2:\r\n ans=max(ans,neg_odd+pos_ev)\r\nif pos_od%2:\r\n ans=max(ans,pos_od)\r\nelse:\r\n ans=max(ans,pos_od-pre)\r\nif neg_odd%2:\r\n ans=max(ans,neg_odd)\r\nif (pos_od+pos_ev+neg_odd)%2:\r\n ans=max(ans,pos_od+pos_ev+neg_odd)\r\nprint(ans)", "n = int(input())\r\ns = input().split()\r\nk = 1e4 + 1\r\nu, v = -k, k\r\nans = 0\r\nfor x in s:\r\n e = int(x)\r\n if e > 0:\r\n if e % 2 == 1:\r\n v = min(v, e)\r\n ans += e\r\n elif e < 0:\r\n if e % 2 == 1:\r\n u = max(u, e)\r\nif ans % 2 == 0:\r\n if u != -k and v != k:\r\n ans = max(ans + u, ans - v)\r\n elif u != -k:\r\n ans += u\r\n elif v != k:\r\n ans -= v\r\nprint(ans)", "n = int(input())\r\na = [int(_) for _ in input().split()]\r\nc = []\r\nb = []\r\nans = 0\r\nfor elem in a:\r\n if elem>=0:\r\n ans+=elem\r\n if elem%2!=0:\r\n if elem>0:\r\n c.append(elem)\r\n else:\r\n b.append(elem)\r\nif len(c)%2!=0:\r\n print(ans)\r\nelse:\r\n if len(b)==0:\r\n print(ans-min(c))\r\n elif len(c)==0:\r\n print(ans+max(b))\r\n else:\r\n print(ans-min(-max(b),min(c)))", "def solve(v):\r\n tmp=0\r\n for i in v:\r\n if i>0:\r\n tmp+=i\r\n if tmp%2==1:\r\n return tmp\r\n mn=10**9\r\n for i in v:\r\n if i>0 and i%2==1:\r\n mn=min(mn,i)\r\n ans=tmp-mn\r\n for i in v:\r\n if i<0 and i%2==1:\r\n ans=max(ans,tmp+i)\r\n return ans\r\n\r\nn=input()\r\nv=list(map(int,input().split()))\r\nprint(solve(v))\r\n", "n=int(input())\r\narroddp=[]\r\narroddmi=[]\r\ns=0\r\nfor i in list(map(int,input().split())):\r\n if i%2:\r\n if i>0:\r\n arroddp.append(i)\r\n else:\r\n arroddmi.append(i)\r\n else:\r\n if i>0:\r\n s+=i\r\nif not arroddp:\r\n s+=max(arroddmi)\r\nelif len(arroddp)%2==0:\r\n t=min(arroddp)\r\n s+=sum(arroddp)-t\r\n if arroddmi:\r\n y=max(arroddmi)\r\n if t+y>0:\r\n s+=t+y\r\n\r\nelse:\r\n s+=sum(arroddp)\r\nprint(s)\r\n", "n = int(input())\na = list(map(int, input().split()))\n\ndef solution(n, a):\n oddMin = 10**4\n # Used to check if any numbers in the array are odd\n # an odd sum is not possible if all numbers are even\n isOdd = False\n\n sum = 0\n for i in range(n):\n # Increase the sum if positive\n if (a[i] > 0):\n sum = sum+a[i]\n # Also check if the current number is odd\n if (a[i]%2 !=0):\n # if there is an odd number, \n # get the smallest odd number in the array\n # we will subtract this from the sum to make it odd\n isOdd = True\n if (oddMin > abs(a[i])):\n oddMin = abs(a[i])\n \n if (isOdd == False):\n return -1\n \n # if the sum is even, make the sum odd by\n # subtracting the minimum odd number\n if (sum%2==0):\n sum = sum - oddMin\n return sum\n\nprint(solution(n, a))\n\n\n \t\t\t\t \t\t\t \t\t \t \t\t \t\t\t \t \t \t", "input()\r\no,e=1-10**10,0\r\nfor x in map(int,input().split()):\r\n if x%2:\r\n o,e=max(o,e+x),max(e,o+x)\r\n elif x>0:\r\n o+=x\r\n e+=x\r\nprint(o)\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\nop=float('inf')\r\non=float('-inf')\r\nflag1=0\r\nflag2=0\r\nsum=0\r\nfor i in l:\r\n if i>0:\r\n sum+=i\r\n if(i%2!=0 and i>0):\r\n flag1=1\r\n op=min(op,i)\r\n elif i%2!=0 and i<0:\r\n flag2=1\r\n on=max(on,i)\r\nif(flag1==0):\r\n op=0\r\nif(flag2==0):\r\n on=0\r\n\r\nif(sum==0):\r\n ans=on\r\nelif sum%2!=0:\r\n ans=sum\r\nelse:\r\n if(op!=0 and on!=0):\r\n ans=max((sum-op),(sum+on))\r\n elif op!=0:\r\n ans=sum-op\r\n elif on!=0:\r\n ans=sum+on\r\nprint(ans)\r\n", "from math import inf\n\nn = int(input())\na = [int(i) for i in input().split()]\n\nodd = [-inf for i in range(n)]\neven = [-inf for i in range(n)]\n\nif a[0] % 2 == 0:\n even[0] = a[0]\nelse:\n odd[0] = a[0]\n\nmax_even = even[0]\nmax_odd = odd[0]\nfor i in range(1, n):\n if a[i] % 2 == 0:\n even[i] = max(a[i], max_even + a[i])\n odd[i] = max_odd + a[i]\n else:\n even[i] = max_odd + a[i]\n odd[i] = max(a[i], max_even + a[i])\n max_even = max(max_even, even[i])\n max_odd = max(max_odd, odd[i])\n\nprint(max(odd))\n", "# Description of the problem can be found at http://codeforces.com/contest/797/problem/B\r\n\r\nn = int(input())\r\nl_n = list(map(int, input().split()))\r\n\r\nl_o = list()\r\ns = 0\r\nfor n in l_n:\r\n if n % 2 == 0:\r\n if abs(n) == n:\r\n s += n\r\n else:\r\n l_o.append(n)\r\n\r\n\r\nl_o.sort()\r\n\r\nm_s = s\r\nt_s = s\r\nm_n_o = None\r\nn_i = -1\r\nfor i in range(len(l_o)):\r\n if abs(l_o[i]) != l_o[i]:\r\n m_n_o = l_o[i]\r\n n_i = i\r\n else:\r\n break\r\n\r\nif len(l_o) - n_i - 1 == 0:\r\n print(s + m_n_o)\r\nelif (len(l_o) - n_i - 1) % 2 == 0:\r\n print(max(s + sum(l_o[n_i + 2:]), \r\n (s + sum(l_o[n_i + 1:]) + (m_n_o if m_n_o else int(-1e10)))))\r\nelse:\r\n print(s + sum(l_o[n_i + 1:]))", "n=int(input())\r\na=list(map(int,input().split()))\r\nans=0\r\nfor i in a:\r\n\tif i>0:\r\n\t\tans+=i\r\n\t\t\r\n\r\nif ans%2:print(ans)\r\nelse:\r\n\tsmallest_odd=min([abs(i) for i in a if i%2])\r\n\tans-=smallest_odd\r\n\tprint(ans)\r\n\t", "n = int(input())\r\na = list(map(int, input().split()))\r\ncount_nech = 0\r\nprev_nech = None\r\nans = 0\r\na.sort(reverse=True)\r\nfor i in a:\r\n if i > 0:\r\n if i % 2 == 0:\r\n ans += i\r\n else:\r\n if count_nech == 0:\r\n ans += i\r\n elif count_nech % 2 == 0:\r\n ans += prev_nech\r\n ans += i\r\n prev_nech = None\r\n else:\r\n prev_nech = i\r\n count_nech += 1\r\n if i < 0:\r\n if i % 2 != 0:\r\n if count_nech == 0:\r\n ans += i\r\n break\r\n if prev_nech is not None and i + prev_nech > 0:\r\n ans += i + prev_nech\r\n break\r\nprint(ans)\r\n", "n=int(input())\r\narr=list(map(int,input().split()))\r\nev,odd=list(),list()\r\nfor i in arr:\r\n if i%2==0:ev.append(i)\r\n else:odd.append(i)\r\n\r\nodd=sorted(odd,reverse=True)\r\nans=odd[0]\r\nfor i in range(1,len(odd)-1,2):\r\n ev.append(odd[i]+odd[i+1])\r\nev=sorted(ev,reverse=True)\r\nfor i in ev:\r\n ans=max(ans,ans+i)\r\nprint(ans)", "import math as m\r\nt=1\r\n#t=int(input())\r\n\r\nwhile t:\r\n t-=1\r\n n=int(input())\r\n a=list(map(int,input().split()))\r\n sum,maxi,mini=0,-1*(10**18),10**18\r\n for x in a:\r\n if x>0:\r\n sum+=x\r\n if x%2:\r\n mini=min(mini,x)\r\n if x<0 and x%2:\r\n maxi=max(maxi,x)\r\n #print(sum,maxi,mini)\r\n if sum%2==0:\r\n sum+=max(-mini,maxi)\r\n print(sum)\r\n", "import sys\nn = int(sys.stdin.readline().strip())\ninteger_line = sys.stdin.readline().strip().split()\nintegers = []\nfor integer in integer_line:\n integers.append(int(integer))\n\nmax_odd = [None] * (len(integers) + 1)\nmax_even = [None] * (len(integers) + 1)\nmax_odd[-1] = 0\nmax_even[-1] = 0\nfor index in range(len(integers) - 1, -1, -1):\n if (integers[index] % 2 == 0):\n max_even[index] = max(integers[index] + max_even[index + 1],\n max_even[index + 1])\n max_odd[index] = max(integers[index] + max_odd[index + 1],\n max_odd[index + 1])\n continue\n if (max_odd[index + 1] % 2 == 0):\n max_even[index] = max_even[index + 1]\n max_odd[index] = max_even[index + 1] + integers[index]\n continue\n max_even[index] = max(integers[index] + max_odd[index + 1],\n max_even[index + 1])\n max_odd[index] = max(integers[index] + max_even[index + 1],\n max_odd[index + 1])\n\n#def max_even_subsequence(sequence, index):\n# if (index == len(sequence)):\n# return 0\n# if (sequence[index] % 2 == 0):\n# max_even = max_even_subsequence(sequence, index + 1)\n# return max(sequence[index] + max_even, max_even)\n# max_odd = max_odd_subsequence(sequence, index + 1)\n# max_even = max_even_subsequence(sequence, index + 1)\n# if (max_odd % 2 == 0):\n# return max_even\n# return max(sequence[index] + max_odd, max_even)\n#\n#def max_odd_subsequence(sequence, index):\n# if (index == len(sequence)):\n# return 0\n# if (sequence[index] % 2 == 0):\n# max_odd = max_odd_subsequence(sequence, index + 1)\n# return max(sequence[index] + max_odd, max_odd)\n# max_even = max_even_subsequence(sequence, index + 1)\n# max_odd = max_odd_subsequence(sequence, index + 1)\n# if (max_odd % 2 == 0):\n# return sequence[index] + max_even\n# return max(sequence[index] + max_even, max_odd)\n\nsys.stdout.write(str(max_odd[0]) + \"\\n\")\n\t \t \t \t\t\t\t\t\t\t\t\t\t\t \t\t\t \t", "n = int(input())\r\na = list(map(int, input().split()))\r\ns, en = 0, 10001\r\nfor x in a:\r\n if x > 0: \r\n s += x\r\n if x % 2 != 0: \r\n en = min(en, abs(x))\r\nif s % 2 == 0: \r\n s -= en\r\nprint(s)", "input()\r\ntotal_sum, min_odd = 0, 10**4\r\nfor num in map(int, input().split()):\r\n if num > 0:\r\n total_sum += num\r\n if num % 2 != 0:\r\n min_odd = min(abs(num), min_odd)\r\nif total_sum % 2 != 1:\r\n total_sum -= min_odd\r\nprint(total_sum)\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\no, e = [], []\r\nfor i in a:\r\n if i % 2:\r\n o.append(i)\r\n else:\r\n e.append(i)\r\no.sort()\r\nans = 0\r\nfor i in e:\r\n if i > 0:\r\n ans += i\r\nm = o.pop()\r\nm0 = m\r\nwhile len(o) >= 2:\r\n m0 += o.pop() + o.pop()\r\n m = max(m, m0)\r\nans += m\r\nprint(ans)", "n=int(input())\r\na=list(map(int,input().split()))\r\ntotal=0\r\nnegativeodd=float('-inf')\r\npositiveodd=float('inf')\r\nfor i in a:\r\n if i>0:\r\n total+=i\r\n if i>0 and i%2!=0:\r\n positiveodd=min(positiveodd,i)\r\n if i<0 and i%2!=0:\r\n negativeodd=max(negativeodd,i)\r\nif total%2!=0:\r\n print(total)\r\nelif negativeodd!=float('-inf') and positiveodd!=float('inf'):\r\n if -negativeodd<positiveodd:\r\n print(total+negativeodd)\r\n else:\r\n print(total-positiveodd)\r\nelif positiveodd!=float('inf'):\r\n print(total-positiveodd)\r\nelif negativeodd!=float('-inf'):\r\n print(total+negativeodd)\r\n", "n = int(input()) \r\na = sorted([int(i) for i in input().split()], reverse = True)\r\nodds = [i for i in a if i&1] \r\nans = odds[0]\r\nfor i in range(1, len(odds), 2): \r\n try : ans = max(ans, ans + odds[i] + odds[i+1])\r\n except IndexError : pass \r\n#print(ans)\r\nevens = [i for i in a if not(i&1)] \r\nfor i in range(len(evens)): ans = max(ans, ans + evens[i])\r\nprint(ans)", "length1 = int(input())\narray1 = list(map(int, input().split(\" \")))\n\nlowestNumber = 10000\noddFlag = False\ntotal = 0\nsum1 = 0\n\nfor i in range(0, length1):\n # If the value at index is positive\n if(array1[i]>0):\n # Add it to a running total\n sum1+=array1[i]\n # If the value at index is odd\n if(array1[i]%2 != 0):\n # Indicate that an odd has been found\n oddFlag = True\n # Keep track of the lowest odd that has been found to be subtracted later\n if(lowestNumber>abs(array1[i])):\n lowestNumber = abs(array1[i])\n# If an odd has not been found then it is impossible\nif(not oddFlag):\n print(\"-1\")\n# If the output is even then subtract by the lowest odd number that we found\nif(sum1%2==0):\n sum1 = sum1-lowestNumber\nprint(str(sum1))\n \t\t \t \t \t \t \t", "n = int(input())\na = list(map(int, input().split()))\nodds = 0\nevens = 0\neven_sum = 0\nodd_sum = 0\nev_min = 100000\nodd_min = 100000\nneg_ev_max = -1000000\nneg_odd_max = -1000000\nfor x in a:\n if x >= 0:\n if x % 2 == 0:\n even_sum += x\n evens += 1\n ev_min = min(ev_min, x)\n else:\n odd_sum += x\n odd_min = min(x, odd_min)\n odds += 1\n else:\n if x % 2 == 0:\n neg_ev_max = max(x, neg_ev_max)\n else:\n neg_odd_max = max(x, neg_odd_max)\nans = -100000000000\n# print(even_sum, odd_sum, odds, neg_odd_max, neg_ev_max)\nif odds > 0:\n ans = even_sum + odd_sum\n if odds % 2 == 0:\n ans = ans - odd_min\n if neg_odd_max != -1000000:\n ans = max(ans, ans + odd_min + neg_odd_max)\nif neg_odd_max != -1000000:\n ans = max(ans, even_sum + neg_odd_max, neg_odd_max)\nif neg_ev_max != -1000000:\n ans = max(ans, neg_odd_max + neg_ev_max)\nprint(ans)", "# Created by Minsol Jeong\ndef E():\n n = int(input())\n seq = [int(x) for x in input().split()]\n\n sum = 0\n min_odd = 10**4\n\n for i in seq:\n if i > 0:\n sum +=i\n\n if (i %2 == 1):\n if (min_odd > abs(i)):\n min_odd = abs(i)\n\n if ( sum % 2 == 0):\n sum = sum - min_odd\n\n print(sum)\nif __name__=='__main__':\n E()\n \t\t\t \t \t \t\t\t \t \t\t \t \t\t\t\t \t \t", "n = int(input())\nmas = list(map(int, input().split()))\nsumm = 0\nmaxodd = -10 ** 5\nminodd = 10 ** 5\nfor i in mas:\n if i > 0:\n summ += i\n if i < 0 and i % 2 != 0:\n maxodd = max(maxodd, i)\n if i > 0 and i % 2 != 0:\n minodd = min(minodd, i)\nif summ % 2 == 0:\n summ -= min(minodd, -maxodd)\nprint(summ)\n", "\"\"\"**************************************************************\\\r\n BISMILLAHIR RAHMANIR RAHIM\r\n****************************************************************\r\n AUTHOR NAME: MD. TAHURUZZOHA TUHIN\r\n\\**************************************************************\"\"\"\r\n\r\n\r\n# n = int(input())\r\n# a = list(map(int, input().split()))\r\n# ans = 0\r\n# min_odd = float(\"-inf\")\r\n# max_odd = float(\"inf\")\r\n# for i in a:\r\n# if i > 0:\r\n# ans += i\r\n# if i % 2 != 0:\r\n# if i < 0:\r\n# min_odd = max(min_odd, i)\r\n# else:\r\n# max_odd = min(max_odd, i)\r\n# if ans % 2 == 0:\r\n# print(max(ans+min_odd, ans-max_odd))\r\n# else:\r\n# print(ans)\r\n\r\nn = int(input())\r\na = [int(x) for x in input().split()]\r\nsm = 0\r\nmix = float(\"-inf\")\r\nminx = float(\"inf\")\r\nfor i in range(n):\r\n if a[i] >= 0:\r\n sm += a[i]\r\n if a[i] % 2 != 0:\r\n minx = min(minx, a[i])\r\n # print(minx)\r\n elif a[i] < 0 and a[i] % 2 != 0:\r\n mix = max(mix, a[i])\r\n # print(mix)\r\n# print(sm)\r\nif sm % 2 == 0:\r\n ans = max(mix+sm, sm-minx)\r\n print(ans)\r\nelse:\r\n print(sm)", "def main():\r\n n = int(input())\r\n a = list(map(int, input().split()))\r\n sum_ = 0\r\n for i in range(n):\r\n if a[i] > 0:\r\n sum_ += a[i]\r\n if sum_ % 2 == 1:\r\n return sum_\r\n min_pos = sum_\r\n max_neg = sum_\r\n for i in range(n):\r\n if a[i] > 0 and a[i] % 2 == 1:\r\n min_pos = min(min_pos, a[i])\r\n for i in range(n):\r\n if a[i] % 2 == 1:\r\n max_neg = min(max_neg, a[i])\r\n for i in range(n):\r\n if a[i] % 2 == 1 and a[i] < 0:\r\n max_neg = max(max_neg, a[i])\r\n max_neg = abs(max_neg)\r\n if max_neg == sum_:\r\n return sum_ - min_pos\r\n else:\r\n if min_pos == sum_:\r\n return sum_ - max_neg\r\n return max(sum_ - max_neg, sum_ - min_pos)\r\n\r\n\r\nprint(main())" ]

[ "#n,m=list(map(int,input().split()))\r\n#Calculate the value of the sum: n mod 1 + n mod 2 + n mod 3 + ... + n mod m. \r\n# As the result can be very large, \r\n# you should print the value modulo 109 + 7 (the remainder when divided by 109 + 7).\r\n\r\n# for i in range(1,151):\r\n# print(f\"100 %{i}={100%i}\")\r\n\r\n# import sys, math\r\n# input=sys.stdin.readline\r\n# INF=int(1e9)+7\r\n \r\n# def solve(): \r\n# n,m=map(int,input().split()) \r\n# result=n*m\r\n# result%=INF \r\n# cur=min(n,m)\r\n# while cur:\r\n# now=n//cur\r\n# next_cur=n//(now+1) \r\n# result-=((cur-next_cur)*(cur+next_cur+1)//2)*now\r\n# result%=INF\r\n# print(now,cur,next_cur,result,((cur-next_cur)*(cur+next_cur+1)//2)*now)\r\n# cur=next_cur\r\n \r\nn,m=list(map(int,input().split()))\r\nres=n*m\r\ncur=min(n,m)\r\nwhile cur:\r\n now=n//cur\r\n next_cur=n//(now+1)\r\n res-=((cur-next_cur)*(cur+next_cur+1)//2)*now\r\n cur=next_cur\r\nprint(res%(10**9+7))\r\n ", "from sys import stdin\r\ninput = lambda: stdin.buffer.readline().decode().strip()\r\n\r\n\r\nsm = lambda x: x * (x+1) >> 1\r\n\r\nM = int(1e9) + 7\r\nn, m = map(int, input().split())\r\nsq = int(n**.5)\r\nans = 0\r\n\r\nfor i in range(1, min(sq, m)+1):\r\n ans += n//i * i % M\r\n\r\nfor i in range(1, sq+1):\r\n l, r = sm(max(sq, n//(i+1))), sm(min(m, n//i))\r\n ans += max(0, r-l) * i % M\r\n\r\nprint((n*m - ans) % M)", "n,m=map(int,input().split())\r\nans,i=n*min(n,m)+max(0,m-n)*n,1\r\nwhile i<=min(n,m):\r\n\tni=min(m,n//(n//i))\r\n\tans-=((ni*(ni+1))//2-(i*(i-1))//2)*(n//i)\r\n\ti=ni+1\r\nprint(ans%(10**9+7))", "X, Y = map(int, input().split())\r\nMOD = int(1e9 + 7)\r\nMAX = int(1e13)\r\n\r\n\r\nassert 1 <= X <= MAX\r\nassert 1 <= Y <= MAX\r\n\r\nans = X * Y\r\n\r\nfor i in range(X//Y, X + 1):\r\n if i * i > X:\r\n for j in range(1, Y + 1):\r\n if X//j >= i:\r\n ans -= (X//j) * j\r\n else:\r\n break\r\n break\r\n if i == 0:\r\n continue\r\n\r\n M,m = min(X//i, Y),X//(i + 1)\r\n ans -= (M * (M + 1) //2 - m * (m + 1) // 2 ) * i\r\n\r\nans %= MOD \r\nprint(ans)" ]

[ "import sys\r\n\r\ninf = float('inf')\r\n\r\ndef read_int():\r\n res = b''\r\n \r\n while True:\r\n d = sys.stdin.buffer.read(1)\r\n if d == b'-' or d.isdigit():\r\n res += d\r\n elif res:\r\n break\r\n \r\n return int(res)\r\n\r\nn = read_int()\r\n\r\ndp, neg, pos = 0, -inf, -inf\r\nfor _ in range(n):\r\n v = read_int()\r\n dp, neg, pos = max(dp, neg + v, pos - v), max(neg, dp - v), max(pos, dp + v)\r\n\r\nprint(dp)", "n = int(input())\nif n == 1:\n print(0)\nelse:\n a = [0]*(n+1)\n i = 1\n for v in map(int, input().split()):\n a[i] = v\n i += 1\n dp = [0]*(n+1)\n dp[2] = abs(a[1]-a[2])\n for i in range(3, n+1):\n # 单调\n if (a[i-2] < a[i-1] and a[i-1] < a[i]) or (a[i-2] > a[i-1] and a[i-1] > a[i]):\n # 转移时a[i-1]造成的贡献会被抵消\n dp[i] = dp[i-1]+abs(a[i]-a[i-1])\n else:\n # 此时不单调 多选浪费\n dp[i] = max(dp[i-1], dp[i-2]+abs(a[i]-a[i-1]))\n \n print(dp[n])\n", "n=int(input())\r\na=input().split(' ')\r\na+=[0]\r\nm1=int(a[0])\r\nm2=-int(a[0])\r\nf=[0]*n\r\nfor i in range(0,n):\r\n f[i]=max(m1-int(a[i]),m2+int(a[i]))\r\n m1=max(m1,f[i]+int(a[i+1]))\r\n m2=max(m2,f[i]-int(a[i+1]))\r\nprint(f[n-1])", "import sys\ninput = sys.stdin.readline\n\nn = int(input())\na = list(map(int, input().split()))\n\ndp = [0] * n\npos, neg = -10 ** 18, -10 ** 18\n\nfor i, x in enumerate(a):\n prv = 0 if i == 0 else dp[i - 1]\n dp[i] = max(neg + x, pos - x, prv)\n pos = max(pos, prv + x)\n neg = max(neg, prv - x)\n\nprint(dp[-1])\n" ]

[ "import math\r\n\r\ndef main():\r\n n = int(input())\r\n if n <= 3:\r\n ans = 1\r\n for i in range(1,n+1):\r\n ans *= i\r\n print(ans)\r\n return\r\n if n%2 == 0:\r\n #print(n,n-1,n-3)\r\n if n%3 == 0:\r\n print((n-3)*(n-1)*(n-2))\r\n else:\r\n print(n*(n-1)*(n-3))\r\n else:\r\n print(n*(n-1)*(n-2))\r\n\r\nmain()\r\n", "n=int(input())\n\nif n==1 or n==2:\n print(n)\nelif n%2==1:\n print(n*(n-1)*(n-2))\nelif n%2==0 and n%3==0:\n print((n-1)*(n-2)*(n-3))\nelif n%2==0 and n%3!=0:\n print(n*(n-1)*(n-3))\n", "import math\r\n\r\ndef lcm(a, b):\r\n return a * b // math.gcd(a, b)\r\n\r\nn = int(input())\r\n\r\nif n == 1:\r\n print(1)\r\nelif n == 2:\r\n print(2)\r\nelse:\r\n if n % 2 == 1:\r\n print(n * (n - 1) * (n - 2))\r\n else:\r\n res = 0\r\n for i in range(max(n - 50, 3), n + 1):\r\n for j in range(max(n - 50, 3), n + 1):\r\n for k in range(max(n - 50, 3), n + 1):\r\n res = max(res, lcm(i, lcm(j, k)))\r\n print(res)\r\n", "def solve(n):\n if(n==1):\n print(\"1\")\n elif(n==2):\n print(\"2\")\n elif(n==3):\n print(\"6\")\n elif(n&1):\n print(n*(n-1)*(n-2))\n else:\n if(n%3==0):\n print((n-1)*(n-2)*(n-3))\n else:\n print(n*(n-1)*(n-3))\n return\n\ndef main():\n n=int(input())\n solve(n)\n\nmain()\n\t\t\t\t \t \t\t\t \t\t \t\t \t\t \t", "import math\r\n\r\na=int(input())\r\nif a==1 or a==2:\r\n print(a)\r\n exit()\r\n\r\nif a%2==1:\r\n ans=(a-1)*(a-2)*(a)\r\n print(ans)\r\nelse:\r\n if a%2==0 and a%3==0:\r\n ans=(a-1)*(a-2)*(a-3)\r\n print(ans)\r\n # print()\r\n else:\r\n first=(a-1)*(a-2)*(a-3)\r\n second=(a)*(a-1)*(a-3)\r\n print(max(first,second))", "import math\r\nfrom functools import reduce\r\n\r\n\r\ndef lcm(a, b):\r\n g = math.gcd(a, b)\r\n return a // g * b // g * g\r\n\r\n\r\ndef solve(n):\r\n return max(find_from_n(n), find_from_n(n - 1))\r\n\r\n\r\ndef find_from_n(n):\r\n if n == 0:\r\n return 1\r\n a = [n]\r\n for i in range(n - 1, 0, -1):\r\n if len(a) >= 3:\r\n break\r\n if all(math.gcd(i, x) == 1 for x in a):\r\n a.append(i)\r\n if len(a) >= 3 and a[-1] == 1:\r\n a[-1] = a[1] - 1\r\n return reduce(lambda x, y: lcm(x, y), a, a[0])\r\n\r\n\r\n# assert solve(924) == 783776526\r\n#\r\n# assert solve(7) == 210\r\n# assert solve(1) == 1\r\n# assert solve(5) == 60\r\n# assert solve(6) == 60\r\n# assert solve(33) == 32736\r\n# assert solve(21) == 7980\r\n# assert solve(2) == 2\r\n# assert solve(41) == 63960\r\n# assert solve(29) == 21924\r\n# assert solve(117) == 1560780\r\n# assert solve(149) == 3241644\r\n# assert solve(733) == 392222436\r\n# assert solve(925) == 788888100\r\n# assert solve(509) == 131096004\r\n# assert solve(829) == 567662724\r\n# assert solve(117) == 1560780\r\n# assert solve(605) == 220348260\r\nn = int(input())\r\nr = max(solve(n), solve(n - 1))\r\nprint(r)\r\n", "from fractions import gcd\r\nn=int(input())\r\n\r\nans=0\r\nfor i in range(n,max(0,n-101),-1):\r\n for j in range(i,max(0,n-101),-1):\r\n for k in range(j,max(0,n-101),-1):\r\n x=(i*j)//gcd(i,j)\r\n x=(x*k)//gcd(x,k)\r\n ans=max(ans,x)\r\nprint(ans)\r\n", "n = int(input())\r\n\r\nif n == 1:\r\n\tprint(1)\r\nelif n == 2:\r\n\tprint(2)\r\nelif n == 3:\r\n\tprint(1*2*3)\r\nelif n == 4:\r\n\tprint(12)\r\nelif n % 2:\r\n\tprint((n-2) * (n-1) * n)\r\nelse:\r\n\tif n % 2 == 0 and n % 3 == 0:\r\n\t\tprint((n-1)*(n-2)*(n-3))\r\n\telse:\r\n\t\tprint(n * (n-1) * (n-3))", "\"\"\"import sys,math\nn=int(input())\nmx=-1-sys.maxsize\nval=[]\ndef meth1(i,k):\n return (i*k)//math.gcd(i,k)\n\ndef meth(i,j,k):\n \n return meth1(i,meth1(j,k))\nfor i in range(1,n+1):\n for j in range(1,n+1):\n for k in range(1,n+1):\n if meth(i,j,k)>mx:\n mx=meth(i,j,k)\n val=[i,j,k]\n\nprint(val)\nprint(mx)\n\"\"\"\n\nn=int(input())\nif n==1:\n print(1)\nelif n==2:\n print(2)\nelif n%2==1:\n print(n*(n-1)*(n-2))\nelif n%3==0:\n print((n-2)*(n-1)*(n-3))\nelse:\n print((n)*(n-1)*(n-3))\n", "from math import lcm\r\n\r\n\r\ndef solve():\r\n n = int(input())\r\n if n == 1:\r\n print(1)\r\n return\r\n if n == 2:\r\n print(2)\r\n return\r\n if n == 3:\r\n print(6)\r\n return\r\n print(max(lcm(n,n-1,n-2),lcm(n,n-1,n-3),lcm(n,n-1,n-4),lcm(n-1,n-2,n-3)))\r\n\r\n\r\nsolve()", "from fractions import gcd\r\nx = int(input())\r\na = x * (x-1) * (x-3)\r\nb = x * (x-1) * (x-2)\r\nif x == 1:\r\n print(1)\r\n quit()\r\nif x == 2:\r\n print(2)\r\n quit()\r\nif x % 6 in [2, 4]:\r\n print(a)\r\nelif x % 6 in [1, 3, 5]:\r\n print(b)\r\nelse:\r\n print((x-1)*(x-2)*(x-3))", "def GCD(m,n):\r\n while(n!=0):\r\n m,n=n,m%n\r\n return m \r\nn=int(input())\r\nif n<=2:\r\n print(n)\r\nelif n%2==1:\r\n print(n*(n-1)*(n-2))\r\nelse:\r\n if GCD(n,n-3)!=1:\r\n print((n-1)*(n-2)*(n-3))\r\n else: \r\n print(n*(n-1)*(n-3))", "from itertools import combinations_with_replacement\r\n\r\nI = lambda: int(input())\r\nIL = lambda: list(map(int, input().split()))\r\n\r\ndef gcd(x, y):\r\n if y == 0:\r\n return x\r\n return gcd(y, x%y)\r\n\r\ndef lcm(x, y, z):\r\n ans = x * y // gcd(x, y)\r\n ans = ans * z // gcd(ans, z)\r\n return ans\r\n\r\nn = I()\r\nprint(max(lcm(*c) for c in combinations_with_replacement(range(max(1, n-5), n+1), 3)))\r\n", "from math import gcd\r\ndef lcm(i,j,k):\r\n i=max(1,i)\r\n j=max(1,j)\r\n k=max(1,k)\r\n g=i*j//gcd(i,j)\r\n h=k*g//gcd(g,k)\r\n return h\r\nn=int(input())\r\nans=0\r\nfor i in range(n,n-51,-1):\r\n for j in range(n,n-51,-1):\r\n for k in range(n,n-51,-1):\r\n ans=max(ans,lcm(i,j,k))\r\nprint(ans)\r\n", "import math\r\ndef answer(n):\r\n if n==1:\r\n return 1\r\n elif n==2:\r\n return 2\r\n \r\n \r\n if n%2!=0:\r\n return n*(n-1)*(n-2)\r\n elif n<=6:\r\n return n*(n-1)*(n-2)//2\r\n \r\n else:\r\n flag=0\r\n if n%3==0 or (n-1)%3==0:\r\n flag=1\r\n x=(n-1)*(n-2)*(n-3)\r\n for i in range(n-3,0,-1):\r\n if flag:\r\n if i%3!=0 and i%2!=0:\r\n return max(x,i*(n)*(n-1))\r\n \r\n else:\r\n if i%2!=0:\r\n return max(x,i*n*(n-1))\r\n \r\n\r\nn=int(input())\r\n\r\nprint(answer(n))", "import sys\r\nimport math\r\nfrom sys import stdin, stdout\r\n \r\n# gcd of two numbers\r\ndef gcd(a, b):\r\n if a < b:\r\n return gcd(b, a)\r\n if b == 0:\r\n return a\r\n return gcd(b, a % b)\r\n \r\n# TAKE INPUT\r\ndef get_ints_in_variables():\r\n return map(int, sys.stdin.readline().strip().split())\r\ndef get_int(): return int(input())\r\ndef get_ints_in_list(): return list(\r\n map(int, sys.stdin.readline().strip().split()))\r\ndef get_list_of_list(n): return [list(\r\n map(int, sys.stdin.readline().strip().split())) for _ in range(n)]\r\ndef get_string(): return sys.stdin.readline().strip()\r\n \r\ndef main():\r\n # Write Your Code Here\r\n n = int(input())\r\n if n <= 2:\r\n print(n)\r\n return\r\n else:\r\n first = n\r\n mx = 0\r\n while first > 2:\r\n second = first-1\r\n third = first-2\r\n while gcd(first,second) != 1:\r\n second -= 1\r\n while third > 0:\r\n if gcd(first, third) == 1 and gcd(second, third) == 1:\r\n res = first*second*third\r\n mx = max(mx, res)\r\n break\r\n third -= 1\r\n first -= 1\r\n print(mx)\r\n# calling main Function\r\nif __name__ == \"__main__\":\r\n main()", "n=int(input())\r\nif(n==1):\r\n print(1)\r\nif(n==2):\r\n print(2)\r\nif(n%2!=0 and n!=1):\r\n print(n*(n-1)*(n-2))\r\nif(n%2==0 and n!=2 and n%3==0):\r\n print((n-1)*(n-2)*(n-3))\r\nif(n%2==0 and n!=2 and n%3!=0):\r\n print((n*(n-1)*(n-3)))\r\n \r\n", "from itertools import combinations\r\nfrom math import gcd\r\n\r\ndef lcm(a,b):\r\n return (a*b)//gcd(a,b)\r\nn = int(input())\r\nif n<=3:\r\n print([1,2,6][n-1])\r\nelif n%2:\r\n print(n*(n-1)*(n-2))\r\nelse:\r\n ans = (n-1)*(n-2)*(n-3)\r\n for a in combinations(range(max(1,n-50),n+1),3):\r\n ans = max(ans, lcm(lcm(a[0],a[1]),a[2]))\r\n print(ans)\r\n", "def NOD(a, b):\r\n while b != 0:\r\n a %= b\r\n y = a\r\n a = b\r\n b = y\r\n return(a)\r\n \r\ndef NOK(a, b):\r\n i = (a*b) // NOD(a, b)\r\n return(i)\r\n \r\n \r\nn = int(input())\r\nmaxnok = 0\r\nx = 40\r\nfor i in range(max(1, n-x), n+1):\r\n for j in range(max(1, i-x), i+1):\r\n for f in range(max(1, j-x), j+1):\r\n nokk = NOK(NOK(i,j), f)\r\n if maxnok < nokk:\r\n maxnok = nokk\r\n delit = []\r\n delit.append(i)\r\n delit.append(j)\r\n delit.append(f)\r\nprint(maxnok)", "n = int(input())\r\nif n == 1: print(1)\r\nelif n == 2: print(2)\r\nelif n == 3: print(6)\r\nelif n%2 == 1: print(n * (n-1) * (n-2))\r\nelif n%3 == 0: print((n-1) * (n-2) * (n-3))\r\nelse: print(n * (n-1) * (n-3))", "n=int(input())\r\nres1=n*(n-1)*(n-2)\r\nres2=(n-1)\r\nif n<=2:\r\n print(n)\r\nelif n&1:\r\n print(n*(n-1)*(n-2))\r\nelif n%3:\r\n print(n*(n-1)*(n-3))\r\nelse:\r\n print((n-1)*(n-2)*(n-3))", "'''input\n1000\n'''\nfrom sys import stdin\nimport math\nfrom collections import defaultdict, deque\n\n\n\ndef LCM(a, b):\n\treturn (a * b) // math.gcd(a, b)\n# main starts\nn = int(stdin.readline().strip())\nif n == 1 or n == 2:\n\tprint(n)\n\texit()\nelif n == 3:\n\tprint(6)\nif n > 3:\n\tif n % 2 == 0:\n\t\tif n % 3 == 0:\n\t\t\tprint((n - 1) * (n - 2) * (n - 3))\n\t\telse:\n\t\t\tprint(n * (n - 1) * (n - 3))\n\telse:\n\t\tprint(n * (n - 1) * (n - 2))\n", "from math import lcm\r\n\r\n\r\nn = int(input())\r\nif n<=2:\r\n print(n)\r\nelse:\r\n if n%2!=0:\r\n print(lcm(n,n-1,n-2))\r\n else:\r\n print(max(lcm(n,n-1,n-3), lcm(n,n-1,n-2), lcm(n-1,n-2,n-3)))", "#!/usr/bin/env python3\nimport collections, itertools, functools, math, fractions\nimport operator\n\ndef lcm(a, b):\n return (a*b)//fractions.gcd(a, b)\n\ndef solve(n):\n if n <= 2:\n return n\n\n if n%2 == 1:\n return lcm(n, lcm(n-1, n-2))\n\n offset = 100\n if n-offset < 0:\n offset = n\n r = 1\n for i in range(n, n-offset, -1):\n for j in range(i, n-offset, -1):\n for k in range(j, n-offset, -1):\n r = max(r, lcm(i, lcm(j, k)))\n return r\n\n\nif __name__ == '__main__':\n print(solve(int(input())))\n\n", "from math import gcd\r\nfrom itertools import combinations\r\nn = int(input())\r\nif n<=3:\r\n print((0,1,2,6)[n])\r\nelse:\r\n m =0\r\n for i,j,k in combinations(list(range(max(n-50,2),n+1)),3):\r\n r = (i*j)//gcd(i,j)\r\n m = max(m,(r*k)//gcd(r,k))\r\n print(m)\r\n", "'''\nAuthor:Fuad Ashraful Mehmet\n'''\n\n\nclass LCM_Challange:\n def __init__(self,n):\n self.n=n\n\n def solve(self):\n \n if self.n<3:\n return self.n \n\n if self.n%6==0:\n return (self.n-1)*(self.n-2)*(self.n-3)\n elif self.n%2==0:\n return self.n*(self.n-1)*(self.n-3)\n else:\n return self.n*(self.n-1)*(self.n-2)\n\nobj=LCM_Challange(int(input()))\nprint(obj.solve())\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\ninput = iter(sys.stdin.buffer.read().decode().splitlines()).__next__\r\nNeo = lambda : list(map(int,input().split()))\r\n# test, = Neo()\r\nn = int(input())\r\nif n <= 2:\r\n print(n)\r\nelif n % 2 == 1:\r\n print(n*(n-1)*(n-2))\r\nelif n % 3 == 0:\r\n print((n-1)*(n-2)*(n-3))\r\nelse:\r\n print(n*(n-1)*(n-3))", "import sys\r\nimport math\r\nn=int(input())\r\nif(n==1):\r\n\tprint(1)\r\n\tsys.exit(0)\r\nif(n==2):\r\n\tprint(2)\r\n\tsys.exit(0)\r\nif(n==3):\r\n\tprint(6)\r\n\tsys.exit(0)\r\nif(n%2==1):\r\n\tprint(n*(n-1)*(n-2))\r\n\tsys.exit(0)\r\ndef lcm(a,b):\r\n\treturn a*b//math.gcd(a,b)\r\nans=0\r\nfor i in range(max(1,n-50),n+1):\r\n\tfor j in range(max(1,n-50),n+1):\r\n\t\tfor k in range(max(1,n-50),n+1):\r\n\t\t\tans=max(ans,lcm(i,lcm(j,k)))\r\nprint(ans)\r\n", "import math\r\nans = 1\r\nn = int(input())\r\nfor i in range(max(1, n - 50), n + 1):\r\n for i1 in range(max(1, n - 50), n + 1):\r\n for i2 in range(max(1, n - 50), n + 1):\r\n ans = max(ans, math.lcm(i, i1, i2))\r\nprint(ans)", "import math\r\ndef lcm(a,b):\r\n return ((a*b)//(math.gcd(a,b))) \r\nn = int(input()) \r\nif (n==1):\r\n print(1) \r\nelif (n==2):\r\n print(2) \r\nelif (n==3):\r\n print(6)\r\nelse:\r\n ans=0 \r\n if (n%2==1):\r\n print(n*(n-1)*(n-2))\r\n else:\r\n ans= 0\r\n for i in range(n,max(0,n-50),-1):\r\n for j in range(n,max(0,n-50),-1):\r\n for k in range(n,max(0,n-50),-1):\r\n ans = max(ans,lcm(lcm(i,j),k))\r\n print(ans)\r\n", "from math import gcd\ndef lcm(a, b):\n return (a*b)//gcd(a, b)\nn=int(input())\nif(n<=2):\n print(n)\nelif(n%2==1):\n print(n*(n-1)*(n-2))\nelse:\n ans=(n-3)*(n-1)*(n-2)\n for k in range(1, n-1):\n ans=max(ans, lcm(n*(n-1), k))\n print(ans)", "n = int(input())\n\nif n > 2:\n if n % 6 < 1:\n result = (n - 2) * (n - 1) * (n - 3 + n % 2)\n else:\n result = n * (n - 1) * (n - 3 + n % 2)\nelse:\n result = n\n\nprint(result)\n\n \t \t\t\t\t\t\t \t\t\t \t \t\t\t\t \t\t\t \t\t\t", "def gcd(a, b):\r\n return gcd(b, a % b) if b else a\r\n\r\n\r\ndef lcm(a, b):\r\n return (a * b) // gcd(a, b)\r\n\r\n\r\nN = int(input())\r\nmx = 1\r\nfor a in range(max(N - 8, 1), N + 1):\r\n for b in range(a, N + 1):\r\n for c in range(b, N + 1):\r\n mx = max(lcm(lcm(a, b), c), mx)\r\nprint(mx)\r\n", "def solve():\r\n n = int(input())\r\n if n == 1:\r\n return 1\r\n if n == 2:\r\n return 2\r\n if n == 3:\r\n return 6\r\n\r\n if n % 2 == 1:\r\n return n * (n - 1) * (n - 2)\r\n \r\n if n % 3 == 0:\r\n return (n - 1) * (n - 2) * (n - 3)\r\n \r\n return n * (n - 1) * (n - 3)\r\n \r\nprint(solve())\r\n", "x = int(input())\r\nif x == 1:\r\n print(1)\r\nelif x == 2:\r\n print(2)\r\nelse:\r\n if x % 2 == 1:\r\n print(x * (x-1) * (x-2))\r\n else:\r\n if x % 3 == 0:\r\n print((x-3) * (x-1) * (x-2))\r\n else:\r\n print(x * (x-1) * (x-3))", "import math\r\ndef solve(a):\r\n lcm=a[0]\r\n for i in range(1,len(a)):\r\n lcm=lcm*a[i]//math.gcd(lcm,a[i])\r\n return lcm\r\n\r\nn=int(input())\r\nif n==1:\r\n print(1)\r\nelif n==2:\r\n print(2)\r\nelif n==3:\r\n print(6)\r\nelse:\r\n m=float(\"-inf\")\r\n d=max(1,n-100)\r\n for i in range(d,n+1):\r\n for j in range(d,n+1):\r\n for k in range(d,n+1):\r\n a=[i,j,k]\r\n m=max(m,solve(a))\r\n print(m)", "n = int(input())\r\nprint(n if n < 3 else ((n - 1) * (n * (n - 2) if n & 1 else (n - 3) * (n if n % 3 else n - 2))))", "from math import gcd\nn = int(input())\n\nif n <= 2:\n ans = n\nelif n % 2 == 1:\n ans = n * (n - 1) * (n - 2)\nelif n % 3 == 0:\n ans = max((n * (n - 1) * (n - 3)) // 6,\n (n - 1) * (n - 2) * (n - 3))\nelse:\n ans = n*(n-1)*(n-3)\n\nprint(ans)\n\n\t \t \t\t \t \t\t\t\t\t \t\t\t \t \t", "import math\r\nn = int(input())\r\nm = 0\r\nfor i in range(min(100,n)):\r\n\tfor ii in range(min(100,n)):\r\n\t\tfor iii in range(min(100,n)):\r\n\t\t\ti1 = n-i\r\n\t\t\tii1 = n-ii\r\n\t\t\tiii1 = n-iii\r\n\t\t\tr1 = (i1*ii1)//math.gcd(i1,ii1)\r\n\t\t\tr2 = (r1*iii1)//math.gcd(iii1,r1)\r\n\t\t\tm = max(m,r2)\r\nprint(m)", "from math import lcm\r\n\r\n\r\ndef solve():\r\n n = int(input())\r\n if n == 1:\r\n print(1)\r\n return\r\n if n == 2:\r\n print(2)\r\n return\r\n if n == 3:\r\n print(6)\r\n return\r\n if n&1:\r\n print(n*(n-1)*(n-2))\r\n return\r\n if n%6==0:\r\n print((n-1)*(n-2)*(n-3))\r\n return\r\n if n%2==0:\r\n print(n*(n-1)*(n-3))\r\n\r\n\r\nsolve()", "import sys\ninput = lambda: sys.stdin.readline().rstrip()\nfrom collections import deque,defaultdict,Counter\nfrom itertools import permutations,combinations\nfrom bisect import *\nfrom heapq import *\nfrom math import ceil,gcd,lcm,floor,comb\n\nN = int(input())\nif N==1:\n print(1)\nelif N==2:\n print(2)\nelif N==3:\n print(6)\nelse:\n print(max(lcm(N,N-1,N-2),lcm(N,N-1,N-3),lcm(N-1,N-2,N-3)))", "\r\ndef lcm_challenge(a):\r\n if a<=2:\r\n print(n)\r\n elif a%6==0:\r\n print((a-1)*(a-2)*(a-3))\r\n elif a%2==0:\r\n print((a)*(a-1)*(a-3))\r\n else:\r\n print((a)*(a-1)*(a-2))\r\nn=int(input())\r\nlcm_challenge(n)\r\n", "from math import gcd\r\ndef main():\r\n\tn=int(input())\r\n\tif n==2:\r\n\t\tprint(2)\r\n\telif n==1:\r\n\t\tprint(1)\r\n\telse:\r\n\t\tk=0;\r\n\t\tfor i in range(max(n-50,1), n+1):\r\n\t\t\tfor j in range(max(1,n-50), n+1):\r\n\t\t\t\tfor z in range(max(1,n-50), n+1):\r\n\t\t\t\t\tl=(i*j)//gcd(i,j)\r\n\t\t\t\t\tk=max((z*l)//gcd(l,z),k)\r\n\t\tprint(k)\r\nif __name__=='__main__':\r\n\tmain()", "#!/usr/bin/env python3\nfrom sys import stdin, stdout\n\n\ndef solve(t):\n n = int(stdin.readline().strip())\n\n if n < 3:\n print(n)\n return\n\n if n % 2:\n print(n * (n - 1) * (n - 2))\n else:\n if n % 3 == 0:\n print((n - 1) * (n - 2) * (n - 3))\n else:\n print(n * (n - 1) * (n - 3))\n pass\n\n\nLOCAL_TEST = not __debug__\nif LOCAL_TEST:\n infile = __file__.split('.')[0] + '-test.in'\n stdin = open(infile, 'r')\n\ntcs = (int(stdin.readline().strip()) if LOCAL_TEST else 1)\nt = 1\nwhile t <= tcs:\n solve(t)\n t += 1", "n = int(input())\r\n\r\nif n < 3: ans = n\r\nelif n % 2: ans = n * (n - 1) * (n - 2)\r\nelif n % 3: ans = n * (n - 1) * (n - 3)\r\nelse: ans = (n - 1) * (n - 2) * (n - 3)\r\n\r\nprint (ans)\r\n", "n = int(input())\n\nOne=(n-1)\nTwo=(n-2)\nThree=(n-3)\n\ncount = 1\n\nif n == 1:\n count = 1\n \nelif n == 2:\n count = 2\n \nelif n == 3:\n count = 6\n \nelif n%2 == 0:\n if n%3 != 0:\n count = n*One*Three\n else:\n count = One*Two*Three\n\nelse:\n count = n*One*Two\n \nprint(count)\n\n\t\t\t\t\t\t \t\t\t \t\t\t \t \t \t\t", "def gcd(a, b):\n return a if b == 0 else gcd(b, a % b)\n\ndef lcm(a, b):\n return a // gcd(a, b) * b\n\nn = int(input())\n\nif n == 1:\n print(1)\nelif n == 2:\n print(2)\nelif n == 3:\n print(6)\nelse:\n ans = 0\n for x in range(max(1, n - 50), n + 1):\n for y in range(x + 1, n + 1):\n for z in range(y + 1, n + 1):\n ans = max(ans, lcm(x, lcm(y, z)))\n print(ans)", "import math\r\n\r\ndef LCM(x, y):\r\n return x * y // math.gcd(x, y)\r\n\r\nn = int(input())\r\nif n <= 2:\r\n print(n)\r\n exit()\r\nres = 0\r\nfor i in range(n, 1, -1):\r\n if i % 2 == 0:\r\n res = max(res, LCM(LCM(i, i-1), i-2-1))\r\n else:\r\n res = max(res, LCM(LCM(i, i-1), i-2))\r\nprint(res)\r\n", "from math import gcd\r\ndef solve(n):\r\n if n <= 2: return n\r\n if n & 1:\r\n return n * (n - 1) * (n - 2)\r\n ans = max(solve(n - 1), n * (n - 1) * (n - 2) // 2)\r\n for p in range(n - 3, 0, -2):\r\n if gcd(p, n) == 1 and gcd(p, n - 1) == 1:\r\n ans = max(ans, n * (n - 1) * p)\r\n break\r\n return ans\r\nn = int(input())\r\nprint(solve(n))\r\n\r\n ", "from math import gcd\r\n\r\ndef lcm(a, b):\r\n return a * b // gcd(a, b)\r\n\r\n\r\nn =int(input())\r\nif n == 1:\r\n print(1)\r\nelif n == 2:\r\n print(2)\r\nelse:\r\n ans = 0\r\n for b1 in range(min(n, 100)):\r\n for b2 in range(min(n, 100)):\r\n for b3 in range(min(n, 100)):\r\n ans = max(ans, lcm(lcm(n-b1,n-b2),n-b3))\r\n print(ans)", "def lcm(n):\r\n res = 0\r\n if n == 1:\r\n print(1)\r\n elif n == 2:\r\n print(2)\r\n elif n % 2 == 0:\r\n if n % 3 == 0:\r\n res = (n - 1) * (n - 2) * (n - 3)\r\n print(res)\r\n else:\r\n res = n * (n - 1) * (n - 3)\r\n print(res)\r\n else:\r\n res = (n - 1) * (n - 2) * n\r\n print(res)\r\n return res\r\n\r\ndef main():\r\n num = int(input())\r\n lcm(num)\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n\r\n\r\n\r\n\r\n\r\n", "import math\r\n\r\ndef lcm(a,b):\r\n return abs(a*b) // math.gcd(a, b)\r\n\r\nn=int(input())\r\nif n%2==1:\r\n if n>=3:\r\n print(n*(n-1)*(n-2))\r\n else:\r\n print(n)\r\nelse:\r\n if n>=4:\r\n a=lcm(n-1,lcm(n-2,n-3))\r\n b=lcm(lcm(n,n-1),n-3)\r\n print(max(a,b))\r\n else:\r\n print(n)\r\n", "n = int(input())\r\nfrom math import gcd\r\ndef lcm(x, y):\r\n lcm = (x*y)//gcd(x,y)\r\n return lcm\r\n\r\nprod1 = lcm(lcm(n, n - 1), n - 2)\r\nprod2 = lcm(lcm(n - 1, n - 2), n - 3)\r\nprod3 = lcm(lcm(n, n - 1), n - 3)\r\nif (n == 1 or n == 2):\r\n print (n)\r\nelse:\r\n print (max([prod1, prod2, prod3]))", "import sys\r\ninput = lambda: sys.stdin.readline().rstrip()\r\nimport math\r\n\r\nN = int(input())\r\n\r\nif N==2:\r\n exit(print(2))\r\n\r\nans = 1\r\na=N;b=N-1\r\nfor i in range(N-2,-1,-1):\r\n if math.gcd(a,i)==1 and math.gcd(b,i)==1:\r\n ans = a*b*i\r\n break\r\n \r\na=N-1;b=N-2\r\nfor i in range(N-3,-1,-1):\r\n if math.gcd(a,i)==1 and math.gcd(b,i)==1:\r\n ans = max(ans, a*b*i)\r\n break\r\nprint(ans)\r\n\r\n", "import sys\r\nimport math as mt\r\n\r\ninput=sys.stdin.buffer.readline \r\ndef lcm(a,b):\r\n return (a*b)//(mt.gcd(a,b))\r\n#t=int(input())\r\nt=1\r\nfor __ in range(t):\r\n# s=input()\r\n n=int(input())\r\n if n%2!=0:\r\n ans=(n)*(n-1)*(n-2)\r\n else:\r\n if n%3==0:\r\n ans=(n-1)*(n-2)*(n-3)\r\n else:\r\n ans=n*(n-1)*(n-3)\r\n if n==1:\r\n ans=1\r\n if n==2:\r\n ans=2\r\n if n==3:\r\n ans=6\r\n print(ans) ", "from math import *\r\nn = int(input())\r\nif n == 1:\r\n print(1)\r\nelif n == 2:\r\n print(2)\r\nelif n == 3:\r\n print(6)\r\nelif n == 4:\r\n print(12)\r\nelif n % 2 != 0:\r\n print(n * (n - 1) * (n - 2))\r\nelse:\r\n ans = (n - 2) * (n - 1) * (n - 3)\r\n k = n - 3\r\n while k >= 1:\r\n if gcd(k, n) >= 2:\r\n break\r\n ans = max(n * (n - 1) * k, ans)\r\n k -= 2\r\n print(ans)\r\n# Code written by Makhkamov\r\n# Code written by Richard\r\n# Richard - my new Nickname!\r\n# I like Python!\r\n# Python - very good language!\r\n# I want solve problems, but I don't have more time.\r\n# Don't waste your time!\r\n# Quote.\r\n# Dreaming is not bad at all, but it is also worth considering the real situation.\r\n# Mistakes are not events that we attract into our lives, no matter how unpleasant they are for us, it is necessary for us to learn what we must learn, no matter what our next step is, it is necessary in order to reach the place where we have chosen the path!\r\n# Never jump to conclusions. Before you do something, think 1000 times. Will it be beneficial or harmful?\r\n# (c) Richard\r\n", "from math import gcd\r\ndef lcm(x, y) : return x*y//gcd(x, y)\r\ndef Lcm(x, y, z): return lcm(lcm(x, y), z)\r\nn = int(input())\r\nif n == 1: print(1)\r\nelif n == 2 : print(2)\r\nelif n % 2 : print(Lcm(n, n-1, n-2))\r\nelse :\r\n print(max(Lcm(n, n-1, n-2), Lcm(n-1, n-2, n-3), Lcm(n, n-1, n-3)))", "'''input\n508\n'''\nfrom math import gcd\nn, m = int(input()), 0\nif n <= 3:\n\tprint([1, 2, 6][n-1])\nelif n % 2 == 1:\n\tprint(n*(n-1)*(n-2))\nelif n % 3 == 0:\n\tprint((n-1)*(n-2)*(n-3))\nelse:\n\tprint(n*(n-1)*(n-3))\n", "from math import gcd\r\n\r\ndef lcm(x,y):\r\n return x*y//gcd(x,y)\r\n\r\nn=int(input())\r\n\r\nANS=n\r\nfor i in range(n-200,n+1):\r\n for j in range(i+1,n+1):\r\n for k in range(j+1,n+1):\r\n if i>=1 and j>=1 and k>=1:\r\n ANS=max(ANS,lcm(lcm(i,j),k))\r\n\r\nprint(ANS)\r\n", "n=int(input())\r\ng=1\r\nif n%2:\r\n g*=n*max(1,n-2)*max(1,n-1)\r\n\r\nelse:\r\n g *= (n-1) * max(1,n-3)\r\n if n%3==0:\r\n g*=max(1,n-2)\r\n else:\r\n g*=n\r\nprint(g)\r\n", "from math import gcd\r\n\r\nn = int(input())\r\nif n<=2:\r\n\tprint(n)\r\nelif not n%6:\r\n\tprint((n-1)*(n-2)*(n-3))\r\nelif not n%2:\r\n\tprint(n*(n-1)*(n-3))\r\nelse:\r\n\tprint(n*(n-1)*(n-2))\r\n\r\n\r\n# C:\\Users\\Usuario\\HOME2\\Programacion\\ACM", "def gcd(x, y):\r\n if x: return gcd(y % x, x)\r\n return y\r\ndef lcm(x, y):\r\n return x * y // gcd(x, y)\r\nn = int(input())\r\nr = range(max(1, n - 20), n+1)\r\nprint(max([lcm(lcm(x,y),z) for x in r for y in r for z in r]))\r\n", "n = int(input().strip())\r\na = 1\r\nif n > 2:\r\n if n % 2 == 1:\r\n a = n*(n-1)*(n-2)\r\n elif n % 3 != 0:\r\n a = n*(n-1)*(n-3)\r\n else:\r\n a = (n-1)*(n-2)*(n-3)\r\nelse:\r\n a = n \r\nprint(a)\r\n", "import math\ndef LCM(a,b):\n res=int((a*b)/math.gcd(a,b))\n return res\na=int(input())\nans=0\nif(a==1):\n ans=1\nelif(a==2):\n ans=2\nelif(a%2==0):\n b1=(a-1)*(a-2)*(a-3)\n b2=a*(a-1)*(a-3)\n if(math.gcd(a,a-3)>math.gcd(a,a-2)):\n ans=b1\n else:\n ans=b2\n\nelif(a%2==1):\n ans=a*(a-1)*(a-2)\nprint(ans)\n", "from math import lcm\r\nn = int(input())\r\nprint(max(1,lcm(n,n-1,n-2),lcm(n,n-1,n-3),lcm(n-1,n-2,n-3)))", "n= int(input())\r\nif n<3:\r\n print(n)\r\nelif n%6==0:\r\n x,y,z = n-1,n-2,n-3\r\n print(x*y*z)\r\nelif n%2==1:\r\n x,y,z = n-1,n-2,n\r\n print(x*y*z)\r\nelse:\r\n x,y,z = n-1,n,n-3\r\n print(x*y*z)", "from math import lcm,gcd \r\nn = int(input())\r\n\r\nif n >= 3 : \r\n print(max(lcm(n,n-1 ,n-2) , lcm(n-1, n-2, n-3) , lcm(n,n-1,n-3)))\r\nelse : \r\n if n == 2 : \r\n print(2)\r\n else : \r\n print(1)", "import sys\r\ndef input() : return sys.stdin.readline().strip()\r\ndef getints() : return map(int,sys.stdin.readline().strip().split())\r\n\r\nfrom math import gcd,lcm\r\n\r\nn = int(input())\r\nif n == 1: print(1)\r\nelif n == 2: print(2)\r\nelif n == 3: print(6)\r\nelif n == 4: print(12)\r\nelse:\r\n if n%2: print(n*(n-1)*(n-2))\r\n else:\r\n ans = n*(n-1)\r\n for i in range(n-3,n//2-2,-1):\r\n if gcd(i,ans) == 1:\r\n ans = ans*i\r\n break\r\n else: ans = ans*((n-2)//2)\r\n print(max(ans,(n-1)*(n-2)*(n-3)))", "n = int(input())\r\nans = 0\r\nif n==1:\r\n print(1)\r\n exit()\r\nif n==2:\r\n print(2)\r\n exit()\r\nif n==3:\r\n print(6)\r\n exit()\r\nif n%2==0:\r\n if n%3==0:\r\n ans=(n-1)*(n-2)*(n-3)\r\n else:\r\n ans=n*(n-1)*(n-3)\r\nelse:\r\n ans=n*(n-1)*(n-2)\r\n\r\nprint(ans)", "x=int(input())\r\nif x>2:\r\n if x%2==1: print(x*(x-1)*(x-2))\r\n elif x%3==0: print((x-1)*(x-2)*(x-3))\r\n else: print((x)*(x-1)*(x-3))\r\nelif x==2: print(2)\r\nelse: print(1)", "from math import gcd\n\ndef lcm(a, b):\n return (a*b)//gcd(a,b)\n\nn = int(input())\n\nif n == 1:\n print(1)\nelif n == 2:\n print(2)\nelif n == 3:\n print(6)\nelif n % 2:\n print(n * (n-1) * (n-2))\nelse:\n print(max((lcm(lcm(n, n-1), n-3)),((n-1) * (n-2) * (n-3))))\n\n \t\t \t\t \t \t \t \t \t\t\t\t \t\t\t\t\t", "n=int(input())\r\nif n==1:\r\n print (1)\r\nelif n==2:\r\n print (2)\r\nelif n==3:\r\n print (6)\r\nelif n%2==0:\r\n if n%3==0:\r\n print ((n-1)*(n-2)*(n-3))\r\n else:\r\n print (n*(n-1)*(n-3))\r\nelse:\r\n print (n*(n-1)*(n-2))", "import sys, math\r\ninput = sys.stdin.readline\r\n\r\ndef getInts():\r\n return [int(s) for s in input().split()]\r\n\r\ndef getInt():\r\n return int(input())\r\n\r\ndef getStrs():\r\n return [s for s in input().split()]\r\n\r\ndef getStr():\r\n return input()\r\n\r\ndef listStr():\r\n return list(input())\r\n\r\nimport collections as col\r\nimport math\r\n\r\ndef solve():\r\n N = getInt()\r\n if N == 1:\r\n return 1\r\n if N == 2:\r\n return 2\r\n if N % 2 == 1:\r\n return N*(N-1)*(N-2)\r\n return max(N*(N-1)*(N-2)//2,(N-1)*(N-2)*(N-3), N*(N-1)*(N-3) if N % 3 > 0 else 0)\r\n #can we make a bigger number using N? N*(N-1), we can't use (N-2), we could use N-3\r\n\r\nprint(solve())\r\n \r\n\r\n", "import sys\r\nsys.setrecursionlimit(10**8)\r\ntry: \r\n\tFILE_POINTER = open('input.inpt')\r\n\tinput = FILE_POINTER.readline\r\nexcept: \r\n\tFILE_POINTER = None\r\n\tinput = sys.stdin.readline\r\n\r\nn = int(input())\r\nif n < 3:\r\n\tprint(n)\r\nelif n == 3:\r\n\tprint(6)\r\nelif n%2:\r\n\tprint(n * (n-1) * (n-2))\r\nelif n%3 == 0:\r\n\tprint((n-1)*(n-2)*(n-3))\r\nelse:\r\n\tprint(n*(n-1)*(n-3))\r\n\t\r\n\r\nif FILE_POINTER:\r\n\tFILE_POINTER.close()", "n=int(input())\r\nprint([(n-2*(n%6<1))*(n-1)*(n-3+n%2),n][n<=2])", "# This code is contributed by Siddharth\r\n\r\n\r\nfrom sys import *\r\ninput = stdin.readline\r\n\r\n\r\n\r\nimport threading\r\nfrom bisect import *\r\nimport math\r\nfrom collections import *\r\nimport operator\r\nfrom heapq import *\r\nfrom itertools import *\r\ninf=10**19\r\nmod=10**9+7\r\nMOD=998244353\r\nS1 = 'abcdefghijklmnopqrstuvwxyz'\r\nS2 = 'ABCDEFGHIJKLMNOPQRSTUVWXYZ'\r\ndrow = [0, 1, 0, -1]\r\ndcol = [-1, 0, 1, 0]\r\n# inverse modulo power pow(a,-1,mod) - it only works on py 3.8 ( *not in pypy )\r\nsetrecursionlimit(200005)\r\ndef asc(c):\r\n return ord(c)-97+1\r\n\r\n\r\n\r\n\r\n# ==========================================> Code Starts Here <=====================================================================)\r\n\r\ndef gcd(a, b):\r\n if b == 0:\r\n return a\r\n else:\r\n return gcd(b, a % b)\r\n\r\n\r\ndef lcm(a, b):\r\n return (a * b) // gcd(a, b)\r\n\r\n\r\n\r\nn=int(input())\r\nif n<=2:\r\n print(n)\r\nelif n==3:\r\n print(6)\r\nelif n%2:\r\n print(n*(n-1)*(n-2))\r\nelse:\r\n tt=min(50,n)\r\n maxx=0\r\n for i in range(max(1,n-tt),n+1):\r\n for j in range(max(1,n-tt),n+1):\r\n for k in range(max(1,n-tt),n+1):\r\n maxx=max(maxx,lcm(lcm(i,j),k))\r\n print(maxx)", "import sys\r\n\r\ninput = lambda: sys.stdin.readline().strip(\"\\r\\n\")\r\n\r\nn = int(input())\r\nif n == 1 or n == 2:\r\n print(n)\r\n exit()\r\nelif n & 1:\r\n print(n*(n-1)*(n-2))\r\nelse:\r\n if n % 3 == 0:\r\n print((n-1)*(n-2)*(n-3))\r\n else:\r\n print(n*(n-1)*(n-3))\r\n\r\n", "from math import gcd\r\n\r\ndef lcm(a, b):\r\n return a // gcd(a, b) * b\r\n\r\nn = int(input())\r\n\r\nres = 0\r\nfor i in range(max(1, n - 10), n + 1):\r\n for j in range(i, n + 1):\r\n for k in range(j, n + 1):\r\n res = max(res, lcm(lcm(i, j), k))\r\n\r\nprint(res)", "from math import gcd\r\ndef lcm(a,b):\r\n return (a*b)//gcd(a,b)\r\ndef lcm(x, y):\r\n return (x * y )// gcd(x, y)\r\n\r\nn = int(input())\r\nr = range(max(1, n - 20), n+1)\r\nans = []\r\nfor x in r:\r\n for y in r:\r\n for z in r:\r\n a = lcm(x,lcm(y,z))\r\n ans.append(a)\r\nprint(max(ans))", "from math import lcm\r\nn = int(input())\r\nmaxi = 0\r\nfor i in range(max(n-50,0),n+1):\r\n for j in range(max(n-50,0),n+1):\r\n for z in range(max(n-50,0),n+1):\r\n maxi = max(maxi,lcm(i,j,z))\r\n\r\nprint(maxi)\r\n", "a=int(input())\r\nif a<=2:\r\n print(a)\r\nelif a%6==0:\r\n print((a-1)*(a-2)*(a-3))\r\nelif a%2==0:\r\n print((a)*(a-1)*(a-3))\r\nelse:\r\n print((a)*(a-1)*(a-2))", "n=int(input())\r\nimport math\r\nif n==1:\r\n ans=1\r\nelif n==2:\r\n ans=2\r\nelif n==3:\r\n ans=6\r\nelif n%2==0:\r\n if n%3==0:\r\n ans=(n-1)*(n-2)*(n-3)\r\n else:\r\n ans=n*(n-1)*(n-3)\r\nelse:\r\n ans=n*(n-1)*(n-2)\r\n\r\nprint(ans)", "from math import factorial, gcd\r\nimport itertools\r\n\r\nn = int(input())\r\nif n <= 3:\r\n\tprint(factorial(n))\r\n\texit()\r\nans = 0\r\nfor a, b, c in itertools.product(range(max(n - 50, 1), n + 1), range(max(n - 50, 1), n + 1), range(max(n - 50, 1), n + 1)):\r\n\tx = a * b // gcd(a, b)\r\n\tx = x * c // gcd(x, c)\r\n\tans = max(x, ans)\r\nprint(ans)\r\n", "from math import gcd\r\ndef lcm(a,b,c):\r\n ans = a\r\n ans = (ans*b)//gcd(ans,b)\r\n ans = (ans*c)//gcd(ans,c)\r\n return ans\r\nn = int(input())\r\nif n == 1:\r\n print(1)\r\nelif n == 2:\r\n print(2*1)\r\nelif n == 3:\r\n print(3*2*1)\r\nelif n%2:\r\n print(n*(n-1)*(n-2))\r\nelse:\r\n maxi = -1\r\n for i in range(n,n-1000,-1):\r\n maxi = max(maxi,lcm(i,i-1,i-2))\r\n maxi = max(maxi,lcm(i,i-1,i-3))\r\n print(maxi)\r\n", "from math import gcd\r\n\r\nn = int(input())\r\nif n == 1:\r\n print(1)\r\nelif n == 2:\r\n print(2)\r\nelif n == 3:\r\n print(6)\r\nelif n % 2 != 0:\r\n print(n * (n - 1) * (n - 2))\r\nelse:\r\n ans = 0\r\n for i in range(max(0, n - 50), n - 1):\r\n for j in range(i + 1, n):\r\n for k in range(j + 1, n + 1):\r\n x = i * j // gcd(i, j)\r\n v = x * k // gcd(x, k)\r\n ans = max(ans, v)\r\n print(ans)\r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Tue Dec 15 23:11:30 2020\r\n\r\nLCM Challenge\r\n\r\n@author --> yashodeep\r\n@Link --> https://codeforces.com/problemset/problem/235/A\r\n@status --> Accepted in first attempt\r\n\"\"\"\r\nn = int(input())\r\nans = 1\r\nif n == 1:\r\n ans = 1\r\nelif n == 2:\r\n ans = 2\r\nelif n == 3:\r\n ans = 6\r\nelif n%2 == 0:\r\n if n%3 == 0:\r\n ans = (n-1)*(n-2)*(n-3)\r\n else:\r\n ans = n*(n-1)*(n-3)\r\nelse:\r\n ans = n*(n-1)*(n-2)\r\n\r\nprint(ans)", "n=int(input())\r\nif n<3:\r\n print(n)\r\nelse:\r\n if n%2:\r\n print(n*(n-1)*(n-2))\r\n else:\r\n if n%3:\r\n print(max(n*(n-1)*(n-2)//2,n*(n-1)*(n-3)))\r\n else:\r\n print(max(n*(n-1)*(n-2)//2,max((n-1)*(n-2)*(n-3),n*(n-2)*(n-3)//3)))\r\n", "def max_NOK(n):\r\n if n < 3:\r\n return n\r\n if n == 3:\r\n return 6\r\n else:\r\n if n % 2 != 0:\r\n return n * (n-1) * (n-2)\r\n elif n % 3 == 0:\r\n return (n-1) * (n-2) * (n-3)\r\n else: \r\n return n * (n-1) * (n-3)\r\nn = int(input())\r\nprint(max_NOK(n))\r\n ", "import math\r\n\r\ndef solve(nums):\r\n a, b, c = nums\r\n r1 = math.gcd(a, b)\r\n r1 = (a * b) // r1\r\n temp = r1\r\n r2 = math.gcd(temp, c)\r\n return (temp * c) // r2\r\n\r\nn = int(input())\r\nans = 0\r\ni = max(1, n - 50)\r\nk = max(1, n - 50)\r\nwhile i <= n:\r\n j = max(1, n - 50)\r\n while j <= n:\r\n k = max(1, n - 50)\r\n while k <= n:\r\n ans = max(ans, solve([i,j,k]))\r\n k += 1\r\n j += 1\r\n i += 1 \r\nprint(ans)", "from math import *\r\ndef lcm(arr,idx):\r\n if idx==len(arr)-1:\r\n return arr[idx]\r\n a=arr[idx]\r\n b=lcm(arr,idx+1)\r\n return ((a*b)//gcd(a,b))\r\nn=int(input())\r\nif n==1:\r\n print(1)\r\nelif n==2:\r\n print(2)\r\nelse:\r\n ans=n*(n-1)\r\n for i in range(n-2,0,-1):\r\n curr=lcm([n,n-1,i],0)\r\n ans=max(ans,curr)\r\n ans2=(n-1)*(n-2)\r\n for i in range(n-3,0,-1):\r\n curr=lcm([n-1,n-2,i],0)\r\n ans2=max(ans2,curr)\r\n print(max(ans,ans2))", "'''\nCreated on May 4, 2016\n@author: Md. Rezwanul Haque\n'''\nn = int (input())\nif(n<3):print(n)\nelif(n%2==0):\n if(n%3 == 0 and (n-3)%3 == 0):\n print((n-1)*(n-2)*(n-3))\n else:\n print(n*(n-1)*(n-3))\nelse:\n print(n*(n-1)*(n-2))\n", "from math import gcd\n\ndef lcm(a,b,c):\n\tg=gcd(a,b)\n\tans=(a*b)//g\n\tg=gcd(ans,c)\n\tans=(ans*c)//g\n\treturn ans\n\nn=int(input())\nif n==1:\n\tprint(1)\nelif n==2:\n\tprint(2)\nelse:\n\tif n%2==0 and n%3==0:\n\t\tprint((n-1)*(n-2)*(n-3))\n\telif n%2==0:\n\t\tprint((n-1)*n*(n-3))\n\telse:\n\t\tprint((n-1)*(n-2)*n)\n", "import math\r\nn=int(input())\r\nif n==1:\r\n print(1)\r\nelif n==2:\r\n print(2)\r\nelif n==3:\r\n print(6)\r\nelif n%2!=0:\r\n print(n*(n-1)*(n-2))\r\nelse:\r\n a=n*(n-1)//(math.gcd(n,n-1))\r\n a=a*(n-3)//math.gcd(a,n-3)\r\n b=(n-1)*(n-2)//math.gcd(n-1,n-2)\r\n b=(n-3)*b//math.gcd(b,n-3)\r\n print(max(a,b))\r\n ", "def gcd(a,b):\r\n #print(a,b)\r\n if b==0:\r\n return a\r\n else:\r\n return gcd(b,a%b)\r\n\r\ndef main():\r\n mode=\"filee\"\r\n if mode==\"file\":f=open(\"test.txt\",\"r\")\r\n\r\n if mode==\"file\":n=int(f.readline())\r\n else:n=int(input())\r\n if n==1:\r\n print(\"1\")\r\n return\r\n if n==2:\r\n print(\"2\")\r\n return\r\n if n==3:\r\n print(\"6\")\r\n return\r\n if n==4:\r\n print(\"12\")\r\n return\r\n i=n+1\r\n [a,b,c]=[1,1,1]\r\n stop=20\r\n while i>=n//2 and i>n-stop:\r\n i-=1\r\n j=n\r\n while j>=n//2-1 and j>n-stop:\r\n j-=1\r\n if i==j:continue\r\n k=n-1\r\n while k>=n//2-2 and k>n-stop:\r\n k-=1\r\n if k==j:continue\r\n if gcd(i,j)==1 and gcd(i,k)==1 and gcd(j,k)==1:\r\n if (i*j*k) > (a*b*c):\r\n [a,b,c]=[i,j,k]\r\n #print(i,j,k)\r\n\r\n print(a*b*c)\r\n if mode==\"file\":f.close()\r\n\r\n\r\nif __name__==\"__main__\":\r\n main()\r\n", "def MCD(a,b):\r\n if a%b==0:\r\n return b\r\n else:\r\n return MCD(b,a%b)\r\n \r\nx=int(input())\r\nz=1\r\nsalida=0\r\nsalida2=0\r\n\r\na=x+1\r\nb=a-1\r\nc=b-1\r\nif x>4:\r\n for k in range (3):\r\n a=a-1\r\n b=a\r\n\r\n for l in range (3):\r\n b=b-1\r\n c=b\r\n if b<1:\r\n break\r\n\r\n for m in range (3):\r\n c=c-1\r\n if c<1:\r\n break\r\n if ((MCD(a,b)==1 and MCD(b,c)==1 and MCD(a,c)==1) and (a!=1 and b!=1 and c!=1 ) ):\r\n respuesta=a*b*c\r\n salida=1\r\n salida2=1\r\n break\r\n if salida==1:\r\n break\r\n\r\n if salida2==1:\r\n z=2\r\n break\r\nelse:\r\n if x==4:\r\n respuesta=12\r\n elif x==3:\r\n respuesta=6\r\n else:\r\n respuesta=x\r\nprint(respuesta)", "n = int(input())\r\ngcd = lambda a, b: b if a % b == 0 else gcd(b, a % b)\r\n\r\nif n % 2:\r\n res = n * (n - 1) * (n - 2)\r\nelse:\r\n for i in range(n - 3, 0, -2):\r\n if gcd(n, i) != 1 or gcd(n - 1, i) != 1:\r\n continue\r\n res = max(n * (n - 1) * i,\r\n int(n * (n - 1) / 2) * (n - 2),\r\n (n - 1) * (n - 2) * (n - 3))\r\n break\r\n\r\nif n < 3:\r\n res = n\r\n\r\nprint(res)\r\n", "n=int(input())\r\nif n==1 or n==2 :\r\n print(n)\r\nelif n%2!=0 :\r\n m=n*(n-1)*(n-2)\r\n print(m)\r\nelif n%3!=0 :\r\n m=n*(n-1)*(n-3)\r\n print(m)\r\nelse :\r\n m=(n-1)*(n-2)*(n-3)\r\n print(m)", "# from math import gcd\r\nn=int(input())\r\nif n%2==1:\r\n if n==1:print(1)\r\n\r\n else:print(n*(n-1)*(n-2))\r\nelse:\r\n if n==2:print(2)\r\n else:\r\n if(n%3==0):\r\n print((n-1)*(n-2)*(n-3))\r\n else:print(n*(n-1)*(n-3))", "n = int (input())\r\n\r\nif(n<3):\r\n print(n)\r\n\r\nelif(n%2==0):\r\n\r\n if(n%3 == 0):\r\n\r\n print((n-1)*(n-2)*(n-3))\r\n\r\n else:\r\n\r\n print(n*(n-1)*(n-3))\r\n\r\nelse:\r\n\r\n print(n*(n-1)*(n-2))", "'''''\r\narr= [1,3,4,3]\r\ni=0\r\nfor k in range(8):\r\n if i!=arr[i]-1:\r\n if arr[i]!=arr[arr[i]-1]:\r\n print(arr[i],arr[arr[i]-1],arr,i)\r\n arr[i],arr[arr[i]-1]=arr[arr[i]-1],arr[i]\r\n else:\r\n i+=1\r\n else:\r\n i+=1\r\nprint(arr)\r\n'''''\r\n\r\n'''\r\ndef AllParenthesis(n):\r\n\r\n def backtrack(ans,curr,openp,closep,maxp):\r\n if len(curr)==2*maxp:\r\n ans.append(curr)\r\n return\r\n if openp<maxp:\r\n backtrack(ans,curr+\"(\",openp+1,closep,maxp)\r\n if closep<openp:\r\n backtrack(ans,curr+\")\",openp,closep+1,maxp)\r\n\r\n\r\n ans = []\r\n openp, closep = 0, 0\r\n curr = ''\r\n backtrack(ans, curr, openp, closep, n)\r\n return ans\r\nprint(AllParenthesis(3))\r\n'''\r\n\r\n#mat = [[1,2,3],[4,5,6],[7,8,9]]\r\n\r\n'''temp=[[0 for x in range(len(mat[0]))]for x in range(len(mat))]\r\nfor i in range(len(mat)):\r\n temp[i][0]=mat[i][0]\r\n for j in range(1,len(mat[0])):\r\n temp[i][j]=temp[i][j-1]+mat[i][j]\r\nfor i in range(1,len(mat)):\r\n for j in range(len(mat[0])):\r\n temp[i][j]=temp[i-1][j]+temp[i][j]\r\n\r\nk=3\r\nlr=0\r\nlc=0\r\nrr=0\r\nrc=0\r\nans=[[0 for x in range(len(mat[0]))]for x in range(len(mat))]\r\nfor i in range(len(mat)):\r\n for j in range(len(mat[0])):\r\n area1 = 0\r\n area2 = 0\r\n area3 = 0\r\n\r\n lr=i\r\n lc=j\r\n if i-k>=0:\r\n lr=i-k\r\n else:\r\n lr=0\r\n if j-k>=0:\r\n lc=j-k\r\n else:\r\n lc=0\r\n rr=i\r\n rc=j\r\n if i+k<len(mat):\r\n rr=i+k\r\n else:\r\n rr=len(mat)-1\r\n if j+k<len(mat[0]):\r\n rc=j+k\r\n else:\r\n rc=len(mat[0])-1\r\n if lc-1>=0:\r\n area1=temp[rr][lc-1]\r\n\r\n if lr-1>=0:\r\n area2=temp[lr-1][rc]\r\n if lr-1>=0 and lc-1>=0:\r\n area3=temp[lr-1][lc-1]\r\n ans[i][j]=temp[rr][rc]-area1-area2+area3'''\r\n\r\n\r\n'''print(ans)'''\r\n'''\r\nnums = [-1,0,1,2,-1,-4] #-1,0,1,2,-1,-4,-2,-3,3,0,4\r\nnums.sort()\r\nprint(nums)\r\nseen = set()\r\nlength=len(nums)\r\nans=[]\r\ni=0\r\nwhile i<length-2:\r\n l=i+1\r\n r=length-1\r\n target=nums[i]\r\n while l<r:\r\n if nums[l]+nums[r]==-target:\r\n seen.add((target,nums[l],nums[r]))\r\n\r\n while l < r and nums[l + 1] == nums[l]:\r\n l += 1\r\n while l < r and nums[r - 1] == nums[r]:\r\n r -= 1\r\n\r\n l+=1\r\n r-=1\r\n elif nums[l]+nums[r]>-target:\r\n r-=1\r\n else:\r\n l+=1\r\n i+=1\r\nprint(seen)\r\n'''\r\nimport os\r\nimport sys\r\nfrom io import BytesIO, IOBase\r\n\r\n\r\ndef main():\r\n pass\r\n\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\n# endregion\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\nimport math\r\ndef check(n):\r\n ''' check = [1] * (n + 1)\r\n check[0] = 0\r\n check[1] = 0\r\n\r\n for i in range(2, int(math.sqrt(n)) + 1):\r\n if check[i] == 1:\r\n for j in range(i * i, n + 1, i):\r\n if check[j] == 1:\r\n check[j] = 0\r\n\r\n def lcm(num1, num2):\r\n gcd1 = math.gcd(num1, num2)\r\n lcmf = (num1 * num2) // gcd1\r\n return lcmf'''\r\n\r\n if n==1:\r\n return 1\r\n if n==2:\r\n return 2\r\n if n==3:\r\n return 6\r\n# ans = 0\r\n if n&1:\r\n return ((n-1)*(n-2)*(n))\r\n if math.gcd(n,n-3)==1:\r\n return (n*(n-1)*(n-3))\r\n else:\r\n return ((n-1)*(n-2)*(n-3))\r\n''' k = j - 1\r\n for k in range(n-2, n-10, -1):\r\n lcm2 = lcm((n*(n-1)), k)\r\n if check[k]:\r\n return(lcm1*k)\r\n'''\r\nn =int(input())\r\nprint(check(n))\r\n", "import math\n\ndef lcm(a,b):\n return (a * b) // math.gcd(a,b)\n\nn = int(input())\nleast = 0\nif n == 1:\n least = 1\nelif n == 2:\n least = 2\nelse:\n for i in range(max(3, n - 1000), n + 1):\n others = []\n other = i\n while len(others) < 2:\n if (lcm(other, i) == other * i):\n if len(others) == 1 and lcm(others[0], other) == others[0] * other:\n others.append(other)\n elif len(others) == 0:\n others.append(other)\n other -= 1\n least1 = i * others[0] * others[1]\n least = max(least, least1)\n \n\n\nprint(least)", "import sys\nfrom math import sqrt\nfrom itertools import combinations\ninput = sys.stdin.readline\n\n############ ---- Input Functions ---- ############\ndef inp():\n return(int(input()))\ndef inlt():\n return(list(map(int,input().split())))\ndef insr():\n s = input()\n return(list(s[:len(s) - 1]))\ndef invr():\n return(map(int,input().split()))\n\nn = int(input())\nres = 0\nif n<3:\n res=n\nelif n%2 != 0:\n res = n*(n-1)*(n-2)\nelif n%3==0:\n res = (n-1)*(n-2)*(n-3)\nelse:\n res = n*(n-1)*(n-3)\nprint(res)\n \n", "def gcd(a,b):\r\n if b==0:\r\n return a\r\n else:\r\n return gcd(b,a%b)\r\n\r\nif __name__ == \"__main__\":\r\n n = int(input())\r\n ans = 0\r\n if n==1:\r\n ans = 1\r\n elif n==2:\r\n ans = 2\r\n else:\r\n if n%2!=0:\r\n ans = n*(n-1)*(n-2)\r\n else:\r\n if gcd(n,(n-3)) ==1:\r\n ans = n*(n-1)*(n-3)\r\n else:\r\n ans = (n-1)*(n-2)*(n-3)\r\n print(ans)", "from math import gcd\r\nn=int(input())\r\ng=1\r\nif n%2:\r\n g*=n*max(1,n-2)\r\nelse:\r\n g *= (n-1) * max(1, n - 3)\r\nx=1\r\ngc=1\r\nfor i in range(n,0,-1):\r\n x=max(i//gcd(i,g)*g,x)\r\nprint(x)", "t=int(input())\r\ndef hcfnaive(a,b): \r\n if(b==0): \r\n return a \r\n else: \r\n return hcfnaive(b,a%b) \r\n \r\n\r\nif(t>2):\r\n if(t&1):\r\n temp1=t*(t-1)*(t-2)\r\n print(temp1)\r\n else:\r\n temp1=(t-1)*(t-3)//hcfnaive((t-1),(t-3))\r\n temp2=(temp1*(t-2))//hcfnaive(temp1,t-2)\r\n temp3=temp1*t//hcfnaive(temp1,t)\r\n print(max(temp3,temp2))\r\n \r\nelse:\r\n print(t)\r\n", "n = int(input())\r\nans=0\r\nif n==1:\r\n print(1)\r\nelif n==2:\r\n print(2)\r\nelif n==3:\r\n print(6)\r\nelse:\r\n if(n%2==1):\r\n ans=n*(n-1)*(n-2)\r\n \r\n else:\r\n if(n%3==0):\r\n ans=(n-1)*(n-2)*(n-3)\r\n \r\n else:\r\n ans=n*(n-1)*(n-3)\r\n print(ans)\r\n", "import sys\nimport math\nn=int(input())\nif(n==1):\n\tprint(1)\n\tsys.exit(0)\nif(n==2):\n\tprint(2)\n\tsys.exit(0)\nif(n==3):\n\tprint(6)\n\tsys.exit(0)\nif(n%2==1):\n\tprint(n*(n-1)*(n-2))\n\tsys.exit(0)\ndef lcm(a,b):\n\treturn a*b//math.gcd(a,b)\nans=0\nfor i in range(max(1,n-50),n+1):\n\tfor j in range(max(1,n-50),n+1):\n\t\tfor k in range(max(1,n-50),n+1):\n\t\t\tans=max(ans,lcm(i,lcm(j,k)))\nprint(ans)\n", "import sys\r\nsys.setrecursionlimit(2000000)\r\n\r\nfrom collections import defaultdict\r\nimport math\r\ndef clc(): \r\n n = int(input())\r\n if n<=2:print(n)\r\n elif n%2:print(n*(n-1)*(n-2))\r\n else:print(max((n-1)*(n-2)*(n-3),(n*(n-1)*(n-3))//math.gcd(n,n-3)))\r\n \r\n\r\n\r\n\r\n \r\n return True\r\ncc = clc()\r\n\r\nif not cc :\r\n print(-1)\r\n ", "x=int(input())\r\nif x<=2:\r\n print(x)\r\nelif x%2==0 and x%3==0:\r\n print((x-1)*(x-2)*(x-3))\r\nelif x%2==0:\r\n print((x)*(x-1)*(x-3))\r\nelse:\r\n print(x*(x-1)*(x-2))", "import sys\r\nfrom functools import lru_cache, cmp_to_key\r\nfrom heapq import merge, heapify, heappop, heappush\r\nfrom math import *\r\nfrom collections import defaultdict as dd, deque, Counter as C\r\nfrom itertools import combinations as comb, permutations as perm\r\nfrom bisect import bisect_left as bl, bisect_right as br, bisect, insort\r\nfrom time import perf_counter\r\nfrom fractions import Fraction\r\nimport copy\r\nfrom copy import deepcopy\r\nimport time\r\nstarttime = time.time()\r\nmod = int(pow(10, 9) + 7)\r\nmod2 = 998244353\r\n\r\ndef data(): return sys.stdin.readline().strip()\r\ndef out(*var, end=\"\\n\"): sys.stdout.write(' '.join(map(str, var))+end)\r\ndef L(): return list(sp())\r\ndef sl(): return list(ssp())\r\ndef sp(): return map(int, data().split())\r\ndef ssp(): return map(str, data().split())\r\ndef l1d(n, val=0): return [val for i in range(n)]\r\ndef l2d(n, m, val=0): return [l1d(n, val) for j in range(m)]\r\ntry:\r\n # sys.setrecursionlimit(int(pow(10,6)))\r\n sys.stdin = open(\"input.txt\", \"r\")\r\n # sys.stdout = open(\"output.txt\", \"w\")\r\nexcept:\r\n pass\r\ndef pmat(A):\r\n for ele in A: print(*ele,end=\"\\n\")\r\n\r\n# from sys import stdin\r\n# input = stdin.buffer.readline\r\n# I = lambda : list(map(int,input().split()))\r\n\r\nx=L()[0]\r\nif x<=2:\r\n print(x)\r\n exit()\r\nif x%2:\r\n n=x\r\n lcm=n*(n-1)//gcd(n,n-1)\r\n lcm=lcm*(n-2)//gcd(lcm,n-2)\r\n print(lcm)\r\nelse:\r\n ans=1\r\n for n1 in range(max(1,x-50),x+1):\r\n for n2 in range(max(1,x-50),x+1):\r\n for n3 in range(max(1,x-50),x+1):\r\n lcm=(n1*n2)//(gcd(n1,n2))\r\n lcm=(lcm*n3)//gcd(lcm,n3)\r\n ans=max(ans,lcm)\r\n print(ans)\r\n \r\n ", "n = int(input())\r\nif n <= 2:\r\n print(n)\r\n exit()\r\nif n % 2 == 0:\r\n if n % 3 == 0:\r\n t = n*(n-1)*max((n-2)//2, (n-3)//3)\r\n n -= 1\r\n s = n*(n-1)*(n-2)\r\n print(max(t,s))\r\n else:\r\n print(n*(n-1)*(n-3))\r\nelse:\r\n print(n*(n-1)*(n-2))\r\n", "from fractions import gcd\r\nn = int(input())\r\n\r\nif n >= 3 and n % 2 == 1:\r\n print(n*(n-1)*(n-2))\r\nelif n >= 3 and n % 2 == 0:\r\n print((n-3)*(n-1)*(n-2) if gcd(n,n-3) > 1 else (n-3)*(n-1)*n)\r\nelse:\r\n print(n)", "n = int(input())\r\nif(n<=2):\r\n\tprint(n)\r\nelif(n%2!=0):\r\n\tprint(n*(n - 1)*(n - 2))\r\nelif(n%3!=0):\r\n\tprint(n*(n - 1)*(n - 3))\r\nelif(n%2==0):\r\n print((n - 1)*(n - 2)*(n - 3))\r\n", "n = int(input())\r\nif n < 3 :\r\n print(n)\r\nelse :\r\n if (n%6)%2 == 1 :\r\n print((n-1)*(n-2)*(n))\r\n elif n%6 == 0 :\r\n print((n-1)*(n-2)*(n-3))\r\n else :\r\n print((n-1)*(n)*(n-3))", "n = int(input())\r\ndef get_primes(k):\r\n p = [True]*(k+1)\r\n p[0] = False\r\n p[1] = False\r\n for i in range(2,k+1):\r\n if p[i]:\r\n for j in range(2,(k+1)//i):\r\n p[i*j] = False\r\n pr = []\r\n for i in range(k+1):\r\n if p[i]:\r\n pr.append(i)\r\n return pr\r\nif n > 10:\r\n if n%2 == 1:\r\n print(n*(n-1)*(n-2))\r\n else:\r\n if n%3 == 0:\r\n print((n-1)*(n-2)*(n-3)) \r\n else:\r\n print(n*(n-1)*(n-3))\r\nelif n == 3:\r\n print(6)\r\nelif n == 4:\r\n print(12)\r\nelif n == 5:\r\n print(60)\r\nelif n == 6:\r\n print(60)\r\nelif n == 7:\r\n print(210)\r\nelif n == 8:\r\n print(280)\r\nelif n == 9:\r\n print(504)\r\nelif n == 10:\r\n print(504)\r\nelse:\r\n print(n)", "n = int(input())\r\nif n > 2:\r\n\tif n % 2 == 1: print(n * (n - 1) * (n - 2))\r\n\telif n % 3 != 0: print(n * (n - 1) * (n - 3))\r\n\telse: print((n - 3) * (n - 2) * (n - 1))\r\nelse:\r\n\tprint(n)", "from math import gcd\n\ndef lcm2(a, b):\n return a * b // gcd(a, b)\n\ndef lcm(a, b, c):\n return lcm2(lcm2(a, b), c)\n\nn = int(input())\nif n == 1:\n print(1)\nelif n == 2:\n print(2)\nelif n % 2:\n print(n * (n - 1) * (n - 2))\nelse:\n ls = [(n - 1) * (n - 2) * (n - 3)]\n for j in range(n - 2, 0, -1):\n ls.append(lcm(n, n - 1, j))\n print(max(ls))", "from sys import stdin, stdout\r\nimport math\r\n\r\nN=int(stdin.readline())\r\nif(N>2):\r\n if(N%2==1):\r\n l=N*(N-1)*(N-2)\r\n else:\r\n if(N%3==0):\r\n l=(N-1)*(N-2)*(N-3)\r\n else:\r\n l=(N)*(N-1)*(N-3)\r\n stdout.write(str(l)+\"\\n\")\r\nelif(N==3):\r\n stdout.write(\"6\\n\")\r\nelif(N==2):\r\n stdout.write(\"2\\n\")\r\nelif(N==1):\r\n stdout.write(\"1\\n\")", "import math\nn=int(input())\nif(n==4): print(12)\nelif(n<=2): print(n)\nelse:\n if(n%2==0):\n a=n*(n-1)*(n-3)\n if(n%3==0): a=a//3\n b=n*(n-1)*(n-2)\n b=b//2\n print(max(a,b,(n-1)*(n-2)*(n-3)))\n else: print(n*(n-1)*(n-2))", "n = int(input())\r\n\r\ndef gcd(a, b):\r\n if a == 0:\r\n return b\r\n else:\r\n return gcd(b % a, a)\r\n\r\ndef lcm(a, b):\r\n return (a * b) // gcd(a, b)\r\n\r\nif n == 1:\r\n print(1)\r\n exit()\r\nif n == 2:\r\n print(2)\r\n exit()\r\nif n & 1 == 1:\r\n print(n * (n - 1) * (n - 2))\r\n exit()\r\nret = 0\r\nfor a in range(max(n - 10, 1), n + 1):\r\n for b in range(a, n + 1):\r\n for c in range(b, n + 1):\r\n ret = max(ret, lcm(a, lcm(b, c)))\r\nprint(ret)", "n = int(input())\nif n > 2:\n result = (n - 2 * (n % 6 < 1)) * (n - 1) * (n - 3 + n % 2)\nelse:\n result = n\nprint(result)\n\n\t \t \t \t \t \t\t \t\t \t \t\t \t \t\t", "from math import *\r\nn=int(input())\r\nif n==3:\r\n print(6)\r\nelif n==2:\r\n print(2)\r\nelif n==1:\r\n print(1)\r\nelse:\r\n i=n-1\r\n while True:\r\n i-=1\r\n if gcd(n,i)==gcd(n-1,i)==1:\r\n break\r\n a=(n-1)*(n-2)*i\r\n for j in range(n,i+1,-1):\r\n for k in range(j-1,i,-1):\r\n for l in range(k-1,i-1,-1):\r\n b=j*k//gcd(j,k)\r\n b=b*l//gcd(b,l)\r\n a=max(a,b)\r\n print(a)" ]

[ "n, x = map(int, input().split())\nif n == 1:\n print(\"YES\")\n print(x)\n exit()\nelif n == 2:\n if x == 0:\n print(\"NO\")\n else:\n print(\"YES\")\n print(0, x)\n exit()\nl = [i for i in range(1, n-2)]\nv = 0\nfor i in range(1,n-2):\n v = v^i\nr1 = x^v\nr1 ^= 2**17 + 2**18\nr2 = 2**17 + 2**19\nr3 = 2**18 + 2**19\nl.extend([r1,r2,r3]) \nprint(\"YES\")\nprint(*l)\n\n", "n, x = map(int, input().split())\r\nif n == 1:\r\n print(\"Yes\")\r\n print(x)\r\nelif n == 2:\r\n if x == 0:\r\n print(\"No\")\r\n else:\r\n print(\"Yes\")\r\n print(0, x)\r\nelse:\r\n print(\"Yes\")\r\n for i in range(n-3):\r\n print(i, end=' ')\r\n x ^= i\r\n print(1<<18, 1<<19, x^(1<<18)^(1<<19))", "n,x=map(int,input().split())\nif(n==1):\n print(\"YES\")\n print(x)\nelif(n==2):\n if(x):\n print(\"YES\")\n print(0,x)\n else:print('NO')\nelse:\n print(\"YES\")\n k=1\n for _ in ' '*(n-2):\n while(x^k==0):\n k+=1\n x=x^k\n print(k,end=\" \")\n k+=1\n x=x^458222\n print(458222,x)\n\n\n\n# Made By Mostafa_Khaled", "\n\nn,x=map(int,input().split(\" \"))\n\nnum=int('1111111111111111111',2)\n\nif(n==1):\n\tprint(\"YES\")\n\tprint(x)\n\texit()\n\nif(n==2):\n\tif(x!=0):\n\t\tprint(\"YES\")\n\t\tprint(0,x)\n\telse:\n\t\tprint(\"NO\")\n\texit()\n\nif(n==3):\n\tif(x==0):\n\t\tprint(\"YES\")\n\t\tprint(1,2,3)\n\telse:\n\t\tprint(\"YES\")\n\t\tprint(num,num^x,0)\n\n\texit()\n\nprint(\"YES\")\n\ns=1\nk=0\n\nl=[]\n\nwhile(len(l)!=n-3):\n\tif(s!=x):\n\t\tl.append(s)\n\t\tk^=s\n\ts+=1\n\nif(k==0):\n\tk^=l[len(l)-1]\n\tl[len(l)-1]+=1\n\tk^=l[len(l)-1]\n\nprint(*l,x,num,num^k)\n\n\n", "n,x=map(int,input().split())\r\nA=[]\r\n\r\nif n%4==1:\r\n A.append(x)\r\n for i in range(2**19,2**19+n-1):\r\n A.append(i)\r\n print(\"YES\")\r\n print(*A)\r\nelif n%4==2:\r\n if x!=0:\r\n A.append(x)\r\n A.append(0)\r\n for i in range(2**19,2**19+n-2):\r\n A.append(i)\r\n print(\"YES\")\r\n print(*A)\r\n else:\r\n if n==2:\r\n print(\"NO\")\r\n else:\r\n for i in range(5):\r\n A.append(2**i)\r\n A.append(2**5-1)\r\n for i in range(2**19,2**19+n-6):\r\n A.append(i)\r\n print(\"YES\")\r\n print(*A)\r\nelif n%4==0:\r\n A.append(x)\r\n if x==0 or x>3:\r\n A.append(1)\r\n A.append(2)\r\n A.append(3)\r\n else:\r\n A.append(4)\r\n A.append(8)\r\n A.append(12)\r\n for i in range(2**19,2**19+n-4):\r\n A.append(i)\r\n print(\"YES\")\r\n print(*A)\r\nelse:\r\n if x>=2:\r\n if x%2==0:\r\n A.append(x+1)\r\n else:\r\n A.append(x-1)\r\n A.append(1)\r\n A.append(0)\r\n else:\r\n A.append(4)\r\n A.append(8)\r\n A.append(12+x)\r\n for i in range(2**19,2**19+n-3):\r\n A.append(i)\r\n print(\"YES\")\r\n print(*A)\r\n", "from random import sample\nn, x = map(int, input().split())\nif n == 2 and x == 0:\n print(\"NO\")\nelse:\n sample_space = list(range(1 << 19))\n while True:\n a = sample(sample_space, n-1)\n curr = x\n for v in a:\n curr ^= v\n \n if curr not in a:\n a.append(curr)\n print(\"YES\")\n print(*a)\n break\n", "import random\r\nimport sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\nn, x = map(int, input().split())\r\nif n == 2 and x == 0:\r\n ans = \"NO\"\r\n print(ans)\r\n exit()\r\nans = \"YES\"\r\nprint(ans)\r\npow2 = [1]\r\nfor _ in range(19):\r\n pow2.append(2 * pow2[-1])\r\nans = [pow2[18]] * n\r\nif not x:\r\n m = n + (n % 2) - 4\r\nelif n % 2:\r\n m = n - 1\r\nelse:\r\n m = n - 2\r\nm = max(m, 0)\r\nl = 0\r\nfor i in pow2[2:17]:\r\n if not m & i:\r\n continue\r\n k = i << 1\r\n for j in range(i):\r\n ans[l + j] ^= j ^ k\r\n l += i\r\nc = 0\r\nfor i in range(l, n):\r\n ans[i] = 0\r\n c += 1\r\nif c == 1:\r\n ans[-1] = x\r\nelse:\r\n while True:\r\n z = [random.randint(0, pow2[17] - 1) for _ in range(c - 1)]\r\n y = x\r\n for i in z:\r\n y ^= i\r\n z.append(y)\r\n if len(z) == len(set(z)):\r\n for i in range(-c, 0):\r\n ans[i] = z[i]\r\n break\r\nsys.stdout.write(\" \".join(map(str, ans)))", "n, x = map(int, input().split())\r\nif (n == 1):\r\n print(\"Yes\")\r\n print(x)\r\nelif (n==2):\r\n if (x == 0):\r\n print(\"No\")\r\n else:\r\n print(\"Yes\")\r\n print(0, x)\r\nelse:\r\n print(\"Yes\")\r\n for i in range(n-3):\r\n print(i, end=' ')\r\n x ^= i\r\n print(2**18, 2**19, x^(2**18)^(2**19))\r\n", "n, x = map(int, input().split())\r\nans = []\r\nxor = 0\r\n \r\nif n == 1:\r\n\tprint(\"YES\")\r\n\tprint(x)\r\n\texit()\r\n \r\nif n == 2 and x == 0:\r\n\tprint(\"NO\")\r\n\texit()\r\n \r\nfor i in range(1,n+1):\r\n\tans.append(i)\r\n\txor ^= i\r\nto_add = xor ^ x\r\n \r\nif to_add != 0:\r\n\tif to_add == 3:\r\n\t\tif n >= 3:\r\n\t\t\tans[2] = 0\r\n\telse:\r\n\t\tans[0] ^= 262144\r\n\t\tans[1] ^= 262144 ^ to_add\r\n \r\nif len(ans) == n:\r\n print(\"YES\")\r\n print(\" \".join(str(i) for i in ans))\r\nelse:\r\n\tprint(\"NO\")" ]

[ "import sys\r\nsys.stdin = open(\"input.txt\", \"r\")\r\nsys.stdout = open(\"output.txt\", \"w\")\r\ninput = sys.stdin.buffer.readline\r\n\r\nn, m = map(int, input().split())\r\nk = int(input())\r\nxy = list(map(int, input().split()))\r\nma, u, v = 0, 1, 1\r\nfor i in range(1, n + 1):\r\n for j in range(1, m + 1):\r\n c = n + m\r\n for l in range(k):\r\n x, y = xy[2 * l], xy[2 * l + 1]\r\n c = min(c, abs(x - i) + abs(y - j))\r\n if ma < c:\r\n ma, u, v = c, i, j\r\nans = \" \".join(map(str, (u, v)))\r\nprint(ans)", "from math import log\r\nimport random\r\nspaces = (\" \",\"\\n\",\"\\t\")\r\nstops = (\"\",\" \",\"\\n\",\"\\t\")\r\nextendedPoints = set()\r\nstartingPoints = set()\r\ninterestPoints = []\r\n\r\nclass TPoint:\r\n\tdef __init__(self,x,y):\r\n\t\tself.x=x\r\n\t\tself.y=y\r\n\tdef __str__(self):\r\n\t\treturn \"(\"+str(self.x)+\",\"+str(self.y)+\")\"\r\n\tdef __eq__(self, other): \r\n\t\treturn self.x == other.x and self.y == other.y\r\n\tdef __hash__(self):\r\n\t\treturn self.x*20000 + self.y\r\n\tx=0\r\n\ty=0\r\n\th=0\t\r\ndef sortKey(p):\r\n\treturn p.h\r\ndef heuristic(p, otherPoints):\r\n\tminH = float(\"inf\")\r\n\tfor point in otherPoints:\r\n\t\tcurrentH = abs(point.x - p.x) + abs(point.y - p.y)\r\n\t\tif currentH < minH:\r\n\t\t\tminH = currentH\r\n\treturn minH\r\n\r\ndef addPoint(p,pointList):\r\n\tif not p in extendedPoints:\r\n\t\tp.h = heuristic(p,startingPoints)\r\n\t\textendedPoints.add(p)\r\n\t\tpointList.append(p)\r\n\t\t#print(p.x,p.y,p.h)\r\n\t\treturn True\r\n\telse:\r\n\t\treturn False\r\n\r\ndef extend(point,n,m,poinList):\r\n\tok = False\r\n\tif point.x>1:\r\n\t\tok = addPoint(TPoint(point.x-1,point.y),poinList) or ok\r\n\t\tif point.y>1:\r\n\t\t\tok = addPoint(TPoint(point.x-1,point.y-1),poinList) or ok\r\n\t\tif point.y<m:\r\n\t\t\tok = addPoint(TPoint(point.x-1,point.y+1),poinList) or ok\r\n\tif point.x<n:\r\n\t\tok = addPoint(TPoint(point.x+1,point.y),poinList) or ok\r\n\t\tif point.y>1:\r\n\t\t\tok = addPoint(TPoint(point.x+1,point.y-1),poinList) or ok\r\n\t\tif point.y<m:\r\n\t\t\tok = addPoint(TPoint(point.x+1,point.y+1),poinList) or ok\r\n\tif point.y>1:\r\n\t\tok = addPoint(TPoint(point.x,point.y-1),poinList) or ok\r\n\tif point.y<m:\r\n\t\tok = addPoint(TPoint(point.x,point.y+1),poinList) or ok\r\n\r\n\treturn ok\r\n\r\ndef ReadNext(fileObject):\r\n\tcurrentBuffer = \"\"\r\n\tcurrentRead=fileObject.read(1)\r\n\twhile currentRead in spaces:\r\n\t\tcurrentRead=fileObject.read(1)\r\n\tcurrentBuffer = currentBuffer + currentRead\r\n\twhile not currentRead in stops:\r\n\t\tcurrentRead=fileObject.read(1)\r\n\t\tcurrentBuffer = currentBuffer + currentRead\r\n\treturn currentBuffer.strip()\r\n\r\nw, r= open('output.txt', 'w'), open('input.txt', 'r')\r\n\r\nn = int(ReadNext(r))\r\nm = int(ReadNext(r))\r\nk = int(ReadNext(r))\r\nmscale = 5\r\n\r\nfor i in range(k):\r\n\tx = int(ReadNext(r))\r\n\ty = int(ReadNext(r))\r\n\tp = TPoint(x,y)\r\n\tstartingPoints.add(p)\r\n\textendedPoints.add(p)\r\n\r\ntmpPoints = []\r\ntmpPoints.append(TPoint(1,1))\r\ntmpPoints.append(TPoint(1,m))\r\ntmpPoints.append(TPoint(n,1))\r\ntmpPoints.append(TPoint(n,m))\r\nif n>2 and m>2:\r\n\ttmpPoints.append(TPoint(int(n/2),1))\r\n\ttmpPoints.append(TPoint(1,int(m/2)))\r\n\ttmpPoints.append(TPoint(int(n/2),m))\r\n\ttmpPoints.append(TPoint(n,int(m/2)))\r\n\ttmpPoints.append(TPoint(int(n/2),int(m/2)))\r\n\r\nfor p in tmpPoints:\r\n\taddPoint(p,interestPoints)\r\n\t#extend(p,n,m,interestPoints)\r\nfor p in startingPoints:\r\n\textend(p,n,m,interestPoints)\r\n\r\ninterestPoints.sort(reverse=True, key=sortKey)\r\nwhile len(interestPoints) > 3*mscale:\r\n\tinterestPoints.pop(len(interestPoints)-1)\r\n\r\nrandom.seed()\r\n\r\nif(len(interestPoints)>0):\r\n\tmaxPoint = interestPoints[0]\r\n\tfor p in interestPoints:\r\n\t\tcurrentBeam = [p]\r\n\t\tcanExtend = True\r\n\t\twhile canExtend:\r\n\t\t\taddPoint(TPoint(random.randint(1,n),random.randint(1,m)),currentBeam)\r\n\t\t\tcanExtend = False\r\n\t\t\tfor i in range(len(currentBeam)):\r\n\t\t\t\tif extend(currentBeam[i],n,m,currentBeam):\r\n\t\t\t\t\tcanExtend = True\r\n\t\t\tcurrentBeam.sort(reverse=True, key=sortKey)\r\n\t\t\twhile len(currentBeam) > mscale:\r\n\t\t\t\tcurrentBeam.pop(len(currentBeam)-1)\r\n\t\tif currentBeam[0].h>maxPoint.h:\r\n\t\t\tmaxPoint = currentBeam[0]\r\n\t#print(maxPoint.x,maxPoint.y)\r\n\t#print(str(len(extendedPoints)))\r\n\tw.write(str(maxPoint.x)+\" \"+str(maxPoint.y)+\"\\n\")\r\nelse:\r\n\tw.write(str(n)+\" \"+str(m)+\"\\n\")\r\n", "import sys\r\nfrom math import inf\r\nsys.stdin=open('input.txt', 'r')\r\nsys.stdout=open('output.txt', 'w')\r\n\r\nn, m = map(int, input().split()) \r\nk = int(input()) \r\nd = [[inf] * m for i in range(n)] \r\nl = list(map(int, input().split()))\r\nmx = -inf\r\nfor i in range(n):\r\n for j in range(m):\r\n for _ in range(0, 2 * k, 2):\r\n x, y = l[_], l[_ + 1] \r\n x, y = x - 1, y - 1 \r\n d[i][j] = min(d[i][j], abs(x - i) + abs(y - j))\r\n \r\nfor i in range(n):\r\n mx = max(mx, max(d[i]))\r\nfor i in range(n):\r\n for j in range(m):\r\n if(d[i][j] == mx):\r\n print(i + 1, j + 1) \r\n exit()\r\n\r\n ", "import sys\r\nfrom array import array # noqa: F401\r\nfrom itertools import product\r\nfrom collections import deque\r\n\r\n\r\ndef input():\r\n with open('input.txt') as fp:\r\n return fp.readlines()\r\n\r\n\r\ndef output(ans: str):\r\n with open('output.txt', mode='w') as fp:\r\n fp.write(ans)\r\n\r\n\r\n'''\r\ndef input():\r\n return [line.decode('utf-8') for line in sys.stdin.buffer.readlines()]\r\n\r\n\r\ndef output(ans):\r\n print(ans)\r\n'''\r\n\r\n\r\ns = input()\r\nn, m = map(int, s[0].split())\r\nk = int(s[1])\r\na = [[0] * m for _ in range(n)]\r\ndq = deque()\r\nline = list(map(lambda x: int(x) - 1, s[2].split()))\r\nfor i in range(0, 2 * k, 2):\r\n a[line[i]][line[i + 1]] = 1\r\n dq.append((line[i], line[i + 1]))\r\n\r\n\r\nx, y = -1, -1\r\nwhile dq:\r\n x, y = dq.popleft()\r\n for tx, ty in ((x + 1, y), (x - 1, y), (x, y + 1), (x, y - 1)):\r\n if 0 <= tx < n and 0 <= ty < m and not a[tx][ty]:\r\n a[tx][ty] = 1\r\n dq.append((tx, ty))\r\n\r\noutput(f'{x+1} {y+1}')\r\n" ]

[ "x = int(input())\r\ns = list(map(int,input().split())) \r\nc = 0\r\nmax = max(s)\r\nmin = min(s)\r\nfor i in range(0,x):\r\n if s[i] != max and s[i]!=min:\r\n c = c + 1\r\nprint(c)", "n = int(input())\r\narr = list(map(int, input().split()))\r\ndef count(nums):\r\n if len(nums) <= 2:\r\n print(0)\r\n return\r\n less = nums[0]\r\n large = nums[0]\r\n res = 0\r\n for index in range(len(nums)):\r\n cur = nums[index]\r\n less = min(less, cur)\r\n large = max(large, cur)\r\n for index in range(len(nums)):\r\n cur = nums[index]\r\n if cur > less and cur < large:\r\n res += 1\r\n print(res)\r\n return\r\ncount(arr)", "n = int(input())\r\nl = list(map(int, input().split()))\r\nprint(max(n - l.count(max(l)) - l.count(min(l)), 0))", "N = int(input())\narr = list(map(int, input().split()))\n\nif N < 3:\n print(0)\nelse:\n arr.sort()\n f = arr[0]\n l = arr[-1]\n\n if f == l:\n print(0)\n else:\n cnt = 0\n\n for i in range(1, len(arr)-1):\n if arr[i] != f and arr[i] != l:\n cnt += 1\n\n print(cnt)", "n = int(input())\r\n\r\nlst = list(map(int, input().split()))\r\n\r\nlst.sort()\r\n\r\nres = 0\r\n\r\nfor i in range(n):\r\n if lst[i] != lst[0] and lst[i] != lst[-1]:\r\n res += 1\r\n\r\nres += 2\r\n\r\nif res < 3:\r\n print(0)\r\nelse:\r\n print(res - 2)", "n = int(input());a = [*map(int, input().split())];print(max(0, n-(a.count(min(a)) + a.count(max(a)))))\r\n", "n = int(input())\r\nx = [int(item) for item in input().split()]\r\na = [min(x), max(x)]\r\ntemp = []\r\n\r\nif len(set(x)) > 2:\r\n print(sum(1 for m in x if m not in a))\r\nelse:\r\n print(0)\r\n", "n = int(input())\r\nl = list(map(int, input().split()))\r\n\r\nl.sort()\r\nx = 0\r\n\r\nfor i in range(n):\r\n\tif l[i] not in (l[0], l[-1]):\r\n\t\tx += 1\r\n\t\t\r\nprint(x)", "n = int(input())\r\na = list(map(int, input().split()))\r\n\r\na.sort()\r\n\r\ni = 0\r\nfor k in range(0, n):\r\n if a[k] == a[0]:\r\n i += 1\r\n else:\r\n break\r\n\r\nj = 0\r\nfor k in range(n-1, -1, -1):\r\n if a[k] == a[n-1]:\r\n j += 1\r\n else:\r\n break\r\n\r\nif i + j < n:\r\n print(n-j-i)\r\nelse:\r\n print(0)", "n = int(input())\r\na= list(map(int, input().split()))\r\na.sort()\r\nmi = a[0]\r\nma = a[-1]\r\nfor i in a: \r\n if(i == mi or i==ma):\r\n n-=1\r\n\r\nprint(n)\r\n ", "n = int(input())\r\nstrengths = [int(s) for s in input().split()]\r\n\r\nmx = max(strengths)\r\nmn = min(strengths)\r\n\r\nans = 0\r\nfor s in strengths:\r\n if mn < s < mx:\r\n ans += 1\r\n\r\nprint(ans)", "l = int(input())\r\nq = list(map(int,input().split()))\r\nmini = min(q)\r\nmaxi = max(q)\r\nq = sorted(q)\r\ncount = 0\r\nfor i in q[1:len(q)-1]:\r\n if i > mini and i < maxi:\r\n count += 1\r\nprint(count)", "n = int(input())\r\nlst = list(map(int, input().split()))\r\ncounter = 0\r\n\r\nmaxs = max(lst)\r\nmins = min(lst)\r\n\r\nfor i in range(n):\r\n if lst[i] != maxs and lst[i] != mins:\r\n counter += 1\r\n \r\nprint(counter)", "x=int(input())\r\ny=list(map(int,input().split()))\r\nmx=max(y)\r\nmn=min(y)\r\ncon=0\r\nsize=len(y)\r\nfor i in range(size):\r\n if y[i] >mn and y[i]<mx:\r\n \r\n con+=1\r\nprint(con)", "def solve(n, l):\r\n l.sort()\r\n ans = 0\r\n for i in l:\r\n if i >l[0] and i < l[-1]:\r\n ans +=1\r\n return ans\r\nn = int(input())\r\nl = [int(i) for i in input().split()]\r\nprint(solve(n,l))", "import math\r\nimport string\r\nimport sys\r\ninput = sys.stdin.readline\r\n# take a list input in a single line\r\ndef invr():\r\n return list(map(int, input().split()))\r\n\r\ndef solve():\r\n n = int(input())\r\n stringInput = input()\r\n lst = list(map(int, stringInput.split()))\r\n\r\n lst.sort()\r\n count = 0\r\n for i in range(n):\r\n if(lst[i] < lst[n-1] and lst[i] > lst[0]):\r\n count += 1\r\n\r\n print(count)\r\n\r\n# t = int(input())\r\n# while t > 0:\r\n# solve()\r\n# t -= 1\r\nsolve()\r\n\r\n\r\n", "n = int(input())\nstewards = list(map(int,input().split()))\nunique_stewards = list(sorted(set(stewards)))\ndiff = (stewards.count(unique_stewards[0])+stewards.count(unique_stewards[-1]))\nprint((n-diff) if n-diff > 0 else 0)", "n = input()\r\narr = list(map(int, input().split()))\r\n\r\nmin_ = 10 ** 10\r\nmax_ = -(10 ** 10)\r\nres = 0\r\n\r\nfor e in arr:\r\n if e < min_:\r\n min_ = e\r\n if e > max_:\r\n max_ = e\r\n\r\nfor e in arr:\r\n if min_ < e < max_:\r\n res += 1\r\n\r\nprint(res)", "from collections import Counter\r\nn = int(input())\r\narr = list(map(int, input(). split()))\r\np = Counter(arr)\r\nif max(arr) != min(arr):\r\n print(n - (p[max(arr)] + p[min(arr)]))\r\nelse:\r\n print(n - p[min(arr)])\r\n", "n = int(input())\narr = list(map(int,input().split()))\nsarr = set(arr)\nif(len(sarr)<=2):print(0)\nelse:\n c=0\n arr.sort()\n for i in range(1,n-1):\n if(arr[i]>arr[0] and arr[i]<arr[n-1]): c+=1\n print(c)\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\n\r\nif n < 3:\r\n print(0)\r\n exit()\r\n\r\na.sort()\r\nsol = 0\r\n\r\nfor i in range(1, n - 1):\r\n if a[i] > a[0] and a[i] < a[n - 1]:\r\n sol += 1\r\n\r\nprint(sol)\r\n", "class Solution():\n\n def oath_of_the_nights_watch():\n number_of_stewards = int(input())\n stewards = list(map(int, input().split()))\n stewards.sort()\n count = 0\n count2 = 0\n for i in range(number_of_stewards):\n if stewards[i] == stewards[0]:\n count += 1\n for i in range(number_of_stewards):\n if stewards[-(i+1)] == stewards[-1]:\n count2 += 1\n if count + count2 >= number_of_stewards:\n print(0)\n else:\n print(len(stewards)-count-count2)\n\n\nif __name__ == '__main__':\n Solution.oath_of_the_nights_watch()", "n=int(input())\r\nlist1=list(map(int,input().split()))\r\nlist1.sort()\r\ncount=0\r\nfor x in range(len(list1)):\r\n if list1[x]>list1[0] and list1[x]<list1[-1]:\r\n count+=1\r\nprint(count)", "a = int(input())\r\nb = [int(i) for i in input().split()]\r\n\r\nb.sort()\r\nsum = 0\r\n\r\nfor i in b:\r\n if b[0] < i < b[-1]:\r\n sum += 1\r\n\r\nprint(sum)", "n =int(input())\r\na = list(map(int,input().split()))\r\nmax1=max(a)\r\nmin1=min(a)\r\ncount = 0\r\nfor i in range(n):\r\n if a[i]<max1 and a[i]>min1:\r\n count+=1\r\nprint(count)", "n=int(input())\r\nls=list(map(int,input().rstrip().split()))\r\nls.sort()\r\nx=0\r\nif(len(ls)!=1):\r\n x=(n-ls.count(ls[0])-ls.count(ls[-1]))\r\n if(x<0):\r\n print(0)\r\n else:\r\n print(x)\r\nelse:\r\n print(0)", "n = int(input())\nstewards = list(map(int, input().split()))\n\nminimum = float('inf')\nmaximum = float('-inf')\n\nfor s in stewards:\n minimum = min(s, minimum)\n maximum = max(s, maximum)\n\nout = 0\nfor s in stewards:\n if minimum < s and s < maximum:\n out += 1\n\nprint(out)\n", "n = input()\nstewards = list(map(int, input().split()))\ncount = 0\n\ntop = max(stewards)\nlow = min(stewards)\n\nfor steward in stewards:\n if low < steward < top:\n count += 1\n\nprint(count)", "n = int(input())\r\na = list(map(int,input().split()))\r\na.sort()\r\nMn = a[0]\r\nMx = a[-1]\r\nb = [i for i in a if i !=Mx and i != Mn]\r\nprint(len(b))", "n = int(input())\r\na = list(map(int,input().split()))\r\na = sorted(a)\r\ncount = 0\r\nfor i in a:\r\n if i != a[-1] and i != a[0]:\r\n count += 1\r\nprint(count)", "n = int(input())\r\nstrengths = list(map(int, input().split()))\r\nstrengths.sort()\r\n\r\ncount = 0\r\nfor i in range(1, n-1):\r\n if strengths[i] > strengths[0] and strengths[i] < strengths[-1]:\r\n count += 1\r\n\r\nprint(count)\r\n", "n = int(input())\r\na = list(map(int,input().split()))\r\nres = 0\r\na.sort()\r\nif n > 2:\r\n for i in range(1,n-1):\r\n if a[0] < a[i] < a[-1]:\r\n res += 1\r\n print(res)\r\nelse:\r\n print(0)", "import math\r\n\r\nn = int(input())\r\nstew = list(map(int, input().split()))\r\nhigh = stew[0]\r\nlow = stew[0]\r\ntotal = 0\r\n\r\nfor i in range(0, n):\r\n high = max(stew[i], high)\r\n low = min(stew[i], low)\r\n\r\nfor i in range(0, n):\r\n if high == stew[i]:\r\n continue\r\n\r\n elif low == stew[i]:\r\n continue\r\n\r\n total += 1\r\n\r\nprint(total)", "n = int(input())\r\n\r\nif n < 3:\r\n print(0)\r\nelse:\r\n count = 0\r\n l = sorted([int(i) for i in input().split()])\r\n for i in range(1,n-1):\r\n count += 1 if l[0] < l[i] < l[-1] else 0\r\n print(count)\r\n", "n = int(input())\r\ninputs = list(map(int,input().split()))\r\nmaxStrength = max(inputs)\r\nminStrength = min(inputs)\r\ncount = 0\r\n\r\nfor i in range(n):\r\n if inputs[i] > minStrength and inputs[i] < maxStrength:\r\n count += 1\r\n \r\nprint(count)", "n = int(input())\r\na = list(map(int,input().split(\" \")))\r\nminimum = a.count(min(a))\r\nmaximum = a.count(max(a))\r\nans = n - minimum - maximum\r\nprint(\"0\" if ans <= 0 else ans)", "n = int(input())\r\nins = [int(x) for x in input().split(\" \")]\r\nmn = min(ins)\r\nmx = max(ins)\r\nins.count(mn)\r\nln = n - ins.count(mn) - ins.count(mx)\r\nif ln > 0:\r\n print(ln)\r\nelse:\r\n print(0)", "n=map(int,input().split())\r\na=list(map(int,input().split()))\r\nm=max(a)\r\np=min(a)\r\nc=0\r\nfor i in a:\r\n if i!=m and i!=p:c+=1\r\nprint(c)", "number = int(input())\r\nelements = [int(el) for el in input().split(\" \")]\r\nelements.sort()\r\nmax_el = elements[len(elements) - 1]\r\nmin_el = elements[0]\r\ncount = 0\r\nfor i in range(len(elements)):\r\n if elements[i] > min_el and elements[i] < max_el:\r\n count += 1\r\nprint(count)", "n = int(input())\r\nres = 0\r\narr= list(map(int,input().split()))\r\narr.sort()\r\nfor i in range(n):\r\n if arr[i] > arr[0] and arr[i]<arr[n-1] :\r\n res+=1\r\nprint(res)", "n = int(input())\r\n\r\na = list(map(int, input().split()))\r\n\r\nmina = min(a)\r\nmaxa = max(a)\r\ncnt = 0\r\n\r\nfor i in a:\r\n if i != mina and i != maxa:\r\n cnt += 1\r\n\r\nprint(cnt)\r\n", "n=int(input())\nstrength=[int(s) for s in input().split()]\nmx=max(strength)\nmn=min(strength)\nans=0\nfor s in strength:\n if mn<s<mx:\n ans+=1\nprint(ans)\n\t \t \t\t \t \t \t\t\t\t\t \t\t \t\t\t", "input();r=[*map(int,input().split())]\r\nprint(max(0,len(r)-r.count(min(r))-r.count(max(r))))", "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\nmi, ma = min(a), max(a)\r\nans = 0\r\nfor i in a:\r\n if mi < i < ma:\r\n ans += 1\r\nprint(ans)", "n = int(input())\r\nx = [int(i) for i in input().split()]\r\nx.sort()\r\na = len(x)-x.count(x[0])-x.count(x[len(x)-1]) \r\nif n == 1 or n == 2 or len(set(x)) == 1 :\r\n print(0)\r\n \r\nelse :\r\n print(a)\r\n", "a = int(input())\r\nb = [int(i) for i in input().split(' ')]\r\nb.sort()\r\ncounter = 0\r\nfor i in b:\r\n\tif(b[0]<i and i<b[a-1]):\r\n\t\tcounter += 1\r\nprint(counter)", "n = int(input())\r\nst = list(map(int, input().split()))\r\nmi = st.count(min(st))\r\nma = st.count(max(st))\r\nif n > mi + ma:\r\n print(n - (mi + ma))\r\nelse:\r\n print(0)", "n = int(input())\n\nstrength = list(map(int,input().split()))\n\nc1 = 0 \nc2 = 0 \n\nmaxS = max(strength)\nminS = min(strength)\n\nfor i in range(len(strength)):\n if strength[i] == maxS:\n c1 += 1\n elif strength[i] == minS:\n c2 += 1\n\n\n[print(0) if maxS == minS else print(n - c1 - c2)]", "from collections import Counter\r\nn = int(input())\r\na = list(map(int, input().split()))\r\na = sorted(a)\r\nb = a[0]\r\nc = a[-1]\r\na = Counter(a)\r\nans = sum(list(a.values())) - a[b] - a[c]\r\nprint(max(ans, 0))", "n=int(input())\r\nst=list(map(int,input().split()))\r\nans=0\r\nminn=min(st)\r\nmaxx=max(st)\r\nfor i in st:\r\n if minn < i < maxx:\r\n ans+=1\r\nprint(ans)", "def my_solution(stewards):\r\n min_steward = min(stewards)\r\n max_steward = max(stewards)\r\n\r\n counter = 0\r\n for steward in stewards:\r\n if min_steward < steward and max_steward > steward:\r\n counter += 1\r\n \r\n print(counter)\r\n\r\n \r\n\r\n\r\nn = input()\r\nstewards = [int(steward) for steward in input().split()]\r\nmy_solution(stewards)", "n=int(input())\r\nm=input().split()\r\nl=[]\r\nc=0\r\nfor i in m:\r\n x=int(i)\r\n l.append(x)\r\nl.sort()\r\nf=min(l)\r\ne=max(l)\r\nfor i in l:\r\n if i>f and i<e:\r\n c+=1\r\n\r\nprint(c)", "n = int(input())\r\nlist_ = list(map(int,input().split()))\r\nlist_.sort()\r\nminn = min(list_)\r\nmaxx = max(list_)\r\nstart = list_.count(minn)\r\nend = len(list_) - list_.count(maxx)\r\nprint(len(list_[start : end]))\r\n", "n1 = int(input())\r\nn2 = [int(s) for s in input().split()]\r\n\r\nmaximum = max(n2)\r\nminimum = min(n2)\r\n\r\nans = 0\r\nfor s in n2:\r\n if minimum < s < maximum:\r\n ans += 1\r\n\r\nprint(ans)", "n=int(input())\r\na=list(map(int,input().split()))\r\nif len(a)<=2:\r\n print(0)\r\nelse:\r\n b=max(a)\r\n c=min(a)\r\n B=[x for x in a if x!=b and x!=c]\r\n a=B\r\n print(len(a))", "from sys import stdin, stdout\r\n\r\nn = int(stdin.readline().strip())\r\narr=[int(x) for x in stdin.readline().strip().split(\" \")]\r\narr.sort()\r\ncounter=0\r\nfor x in arr:\r\n if x>arr[0] and x<arr[-1]: counter+=1\r\nstdout.write(str(counter))\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\n\r\nmin_val = min(a)\r\nmax_val = max(a)\r\n\r\ncount = 0\r\nfor num in a:\r\n if min_val < num < max_val:\r\n count += 1\r\n\r\nprint(count)\r\n", "number = int(input())\r\nsmall = float('inf')\r\nbig = 0\r\ncounter = 0\r\narr = list(map(int , input().split()))\r\nfor i in range (0 , len(arr)):\r\n if small > arr[i] :\r\n small = arr[i]\r\n if big < arr[i] :\r\n big = arr[i]\r\nfor i in range (0 , len(arr)):\r\n if arr[i] > small and arr[i] < big :\r\n counter +=1\r\nprint(counter)", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Sun Jul 24 13:49:25 2022\r\n\r\n@author: Conor\r\n\r\nCFSheet A Problem 40 - CF768-DIV2A\r\n\"\"\"\r\n\r\nnumStew = int(input())\r\nstrengths = list(map(int,input().split()))\r\nstrengths.sort()\r\nans = 0\r\nlb = strengths[0]\r\nub = strengths[-1]\r\n\r\nfor i in range(1,numStew-1):\r\n if strengths[i] > lb and strengths[i] < ub:\r\n ans += 1\r\nprint(ans)", "n = int(input())\r\n\r\narr = list(map(int, input().split()))\r\n\r\nif n < 3:\r\n print(0)\r\nelse:\r\n arr.sort()\r\n\r\n count = 0\r\n\r\n for i in range(1, n-1):\r\n if arr[i] > arr[0] and arr[i] < arr[-1]:\r\n count += 1\r\n\r\n print(count)\r\n", "n=int(input())\r\nl2=[]\r\nl2.append([int(x) for x in input().split()])\r\nl1=l2[0]\r\na=max(l1)\r\nb=min(l1)\r\nc=0\r\nfor i in range(n):\r\n if a>l1[i]>b:\r\n c=c+1\r\nprint(c)", "\r\nn = int(input())\r\nlist = []\r\nlist = [int(item) for item in input().split()]\r\nlist.sort()\r\ncounter = 0\r\n\r\nfor i in range (n):\r\n if list[i] > list[0] and list[i] < list[n-1] :\r\n counter+=1\r\n\r\nprint (counter)", "n=int(input())\r\na=[int(e) for e in input().split()]\r\namin=min(a)\r\namax=max(a)\r\nc=0\r\nfor i in range(n):\r\n if a[i]>amin and a[i]<amax:\r\n c+=1\r\nprint(c)", "n = int(input())\r\nstrengths = sorted(map(int, input().split()))\r\nmin_strength = strengths[0]\r\nmax_strength = strengths[-1]\r\ncount = 0\r\nfor i in range(1, n-1):\r\n if min_strength < strengths[i] < max_strength:\r\n count += 1\r\nprint(count)", "n = int(input())\r\na = list(map(int, input().split()))\r\nmn = min(a)\r\nmx = max(a)\r\ncounter = 0\r\nfor i in a:\r\n if i != mn and i != mx:\r\n counter+=1\r\nprint(counter)", "n,sum = int(input()),0\r\nj = [int(i) for i in input().split()]\r\nx = j.count(max(j))\r\ny = j.count(min(j))\r\nif len(j)<=2:\r\n print(\"0\")\r\nelif max(j)==min(j):\r\n print(0)\r\nelse:\r\n print(len(j)-x-y)", "n = int(input())\nstewards = list(map(int,input().split()))\n\nmaxStrength = max(stewards)\nminStrength = min(stewards)\ncount = 0\nfor element in stewards:\n if element > minStrength and element < maxStrength:\n count +=1\nprint(count)", "number_of_stewards = int(input())\r\nstrengths = input()\r\n\r\nsteward_strengths = []\r\nfor number in strengths.split(\" \"):\r\n steward_strengths.append(int(number))\r\nsorted(steward_strengths)\r\n\r\nminimum = min(steward_strengths)\r\nmaximum = max(steward_strengths)\r\nstewards_supported = 0\r\nfor strength in steward_strengths:\r\n if minimum < strength and maximum > strength:\r\n stewards_supported += 1\r\n\r\nprint(stewards_supported)", "n = int(input())\nv = list(map(int, input().split()))\nv = sorted(v)\nstewards = 0\nfor i in v:\n\tif i > v[0] and i < v[-1]:\n\t\tstewards += 1\nprint(stewards)\n\n", "n=int(input())\r\ns=list(map(int,input().split()))\r\nmx=max(s)\r\nmn=min(s)\r\nc=0\r\nfor i in s:\r\n if i==mx or i ==mn:\r\n pass\r\n else:\r\n c+=1\r\nprint(c)", "n = int(input())\r\nlst = sorted( list(map(int, input().split()))[:n] )\r\n\r\nsupport = 0\r\nfor i in lst:\r\n if i > lst[0] and i < lst[-1]:\r\n support += 1\r\n\r\nprint(support)\r\n", "n = int(input())\r\nnums = [int(x) for x in input().split()]\r\n\r\nnums.sort()\r\ncount = 0 \r\nfor i in range(1, n-1):\r\n if nums[0] < nums[i] < nums[n-1]:\r\n count += 1\r\nprint(count)", "# my name is Abduaziz\r\nimport sys\r\n\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\n*a, = map(int, input().split())\r\na.sort()\r\nans = a.index(a[-1])\r\nans -= a.count(a[0])\r\nprint(max(ans, 0))\r\n", "def inlt():\r\n return(list(map(int,input().split())))\r\n\r\nn = int(input())\r\nlst = inlt()\r\n\r\nlst.sort()\r\nif len(lst) < 3:\r\n print(0)\r\nelse:\r\n \r\n count = 0\r\n for i in range(len(lst)):\r\n if lst[0] < lst[i] and lst[i] < lst[len(lst) - 1]:\r\n count += 1\r\n\r\n print(count)\r\n \r\n", "n=int(input())\r\nnum=sorted([int(x) for x in input().split()])\r\nr=len(num)-num.count(num[0])-num.count(num[-1])\r\nif r>0: print(r)\r\nelse: print(0)", "n=int(input())\nlis=list(map(int, input().split()))\nif n==2:\n print(0)\nelse:\n count=0\n \n m=max(lis)\n n=min(lis)\n for i in range(len(lis)):\n if (lis[i]>n and lis[i]<m):\n count+=1\n print(count)\n\t \t \t \t \t\t\t \t \t \t \t \t \t", "n = int(input())\r\nlist1 = [int(x) for x in input().split(' ')]\r\nmin_num = min(list1)\r\nmax_num = max(list1)\r\nnum = 0\r\nfor x in list1:\r\n if x > min_num and x < max_num:\r\n num += 1\r\nprint(num)\r\n", "import sys\r\n\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\ndata = list(map(int, input().split()))\r\n\r\nmax_v = max(data)\r\nmin_v = min(data)\r\nprint(len([i for i in data if min_v < i < max_v]))", "from collections import Counter\n\nn = int(input())\nstewards = list(map(int, input().split()))\ncount = Counter(stewards)\nres = len(stewards) - count[min(stewards)] - count[max(stewards)]\nprint(res) if res >= 0 else print(0)\n", "from sys import stdin, stdout\r\n#from bisect import bisect_left, bisect_right\r\n#from collections import Counter, deque\r\n#from queue import Queue\r\n#import heapq\r\n#import math\r\n#from itertools import permutations, combinations, islice\r\n\r\nn = int(stdin.readline().strip())\r\na = [*map(int, stdin.readline().strip().split())]\r\na.sort()\r\nb = set(a)\r\nans = 0\r\n\r\nc = sorted(list(b))\r\nfor i in a:\r\n if i != c[0] and i != c[-1]:\r\n ans+=1\r\nstdout.write(f'{ans}')", "n = int(input())\r\ns = list(map(int, input().split(\" \")))\r\nhi, lo = max(s), min(s)\r\nc = 0\r\nfor i in s:\r\n if i > lo and i < hi:\r\n c += 1\r\nprint(c)\r\n", "n = int(input())\r\narr = input().split()\r\n\r\nfor i in range(0, len(arr)):\r\n arr[i] = int(arr[i])\r\n\r\nminima =min(arr)\r\nmaxima = max(arr)\r\n\r\ncount = 0\r\nfor i in range(0, len(arr)):\r\n if arr[i]>minima and arr[i]<maxima:\r\n count+=1\r\n\r\nprint(count)\r\n\r\n", "n = int(input())\r\nstewards = list(map(int,input().split()))\r\ncounter = 0\r\n\r\nstewards.sort()\r\n\r\nfor i in range(n):\r\n if stewards[0]<stewards[i] and stewards[-1]>stewards[i]:\r\n counter = counter + 1\r\n\r\n\r\nprint(counter)", "n = int(input())\r\nlst = list(map(int, input().split()))\r\ncnt = len(list(set(lst))) \r\nif cnt >=3 : print(n-lst.count(min(lst)) - lst.count(max(lst)))\r\nelse: print(0)", "n = int(input())\n\nstewards = []\n\nmini = 9999999999999999\nmaxi = -999999999999999\n\nfor x in input().split(\" \"):\n strength = int(x)\n if strength > maxi:\n maxi = strength\n if strength < mini:\n mini = strength\n stewards.append(strength)\n\ncount = 0\nfor s in stewards:\n if s == mini or s == maxi:\n count += 1\n\nprint(n - count)\n", "n = int(input());\r\na = list(map(int, input().split()));\r\na.sort();\r\nk = 0;\r\nfor i in a:\r\n if i != a[-1] and a[0] != i:\r\n k += 1;\r\nprint(k);\r\n", "n = int(input())\r\npower = [int(x) for x in input().split()]\r\nmin_count = power.count(min(power))\r\nmax_count = power.count(max(power))\r\nif len(set(power)) > 2:\r\n\tresult = len(power) - min_count - max_count\r\n\tprint(result)\r\nelse:\r\n\tprint(0)", "n=int(input())\r\nst=[int(s) for s in input().split()]\r\n\r\nm=max(st)\r\nn=min(st)\r\nans=0\r\nfor s in st:\r\n if n<s<m:\r\n ans+=1\r\nprint(ans)", "\"\"\"\r\n@auther:Abdallah_Gaber \r\n\"\"\"\r\nn = int(input())\r\nlst = [int(x) for x in input().split()]\r\nlst = sorted(lst)\r\ncounter = 0\r\nfor i in range(1,len(lst)-1):\r\n if lst[i] > lst[0] and lst[i] < lst[-1]: #the value is less than x[-1] and greater than x[0]\r\n counter +=1\r\nprint(counter)\r\n \r\n", "n, a = int(input()), [int(i) for i in input().split()]\nmi = ma = a[0]\nfor i in a:\n mi = min(mi, i)\n ma = max(ma, i)\nres = sum(mi < i < ma for i in a)\nprint(res)\n", "n=int(input())\r\ncount=0\r\ns=[]\r\ns=list(map(int ,input().split()))\r\ns.sort()\r\nfor i in range (1,n-1):\r\n if s[i] > s[0] and s[i] < s[n-1]:\r\n count+=1\r\n \r\nprint(count)", "n,arr = int(input()),list(map(int,input().split()))\r\ncount = [arr.count(max(arr))+arr.count(min(arr)),arr.count(max(arr))][max(arr)==min(arr)]\r\nprint(n-count)", "n=int(input())\r\na=list(map(int,input().split()))\r\nprint(max(0,n-a.count(min(a))-a.count(max(a))))", "a = int(input())\r\nb = [int(i) for i in input().split()]\r\n\r\nmaxi = max(b)\r\nmini = min(b)\r\nsum = 0\r\n\r\nfor i in b:\r\n if mini < i < maxi:\r\n sum += 1\r\n\r\nprint(sum)", "def oath_of_night_watch():\r\n x = int(input())\r\n y = [int(j) for j in input().split(\" \")]\r\n n = min(y)\r\n m = max(y)\r\n total = 0\r\n for i in y:\r\n if (i!=n and i!=m):\r\n total += 1\r\n print(total)\r\n\r\noath_of_night_watch()\r\n", "n=int(input())\n\nl=list(map(int,input().split()))\nc=0\nlow=min(l)\nhigh=max(l)\n\nfor i in l:\n \n if low<i and i< high:\n c=c+1\n \nprint(c)\n \t\t \t \t \t \t \t\t \t \t \t", "n = int(input())\r\n\r\nstawrds = list(map(int,input().split()))\r\n\r\ncount = 0\r\n\r\nmx = max(stawrds)\r\nmi = min(stawrds)\r\n\r\nfor i in stawrds:\r\n if mx>i>mi:\r\n count+=1\r\n\r\nprint(count)", "from collections import Counter\r\nn = int(input())\r\nnums = list(map(int, input().split()))\r\nnums.sort()\r\ncnt = Counter(nums)\r\nans = n - (cnt[nums[0]] + cnt[nums[-1]])\r\n\r\nif ans >= 0:\r\n print(ans)\r\nelse: print(0)", "c=0\r\nx=int(input())\r\ny=[int(i) for i in input().split()]\r\ny.sort()\r\nfor i in range(len(y)):\r\n if y[i]>y[0] and y[i]<y[len(y)-1]:\r\n c+=1\r\nprint(c)", "n = int(input())\r\nc = list(map(int,input().split()))\r\n_ = 0\r\n__ = 0\r\nmn = min(c)\r\nmx = max(c)\r\nfor i in range(len(c)):\r\n if c[i] == mn or c[i] == mx:\r\n __ += 1\r\nif mn - mx == 0:\r\n print(0)\r\nelse:\r\n print(n - __)", "n = int(input())\r\n\r\ns = list(map(int, input().split()))\r\n\r\nmax = max(s)\r\nmin = min(s)\r\nsupport = 0\r\nfor person in s:\r\n\r\n if person > min and person < max:\r\n support += 1\r\nprint(support)\r\n", "n = int(input())\n\nstrength = list(map(int,input().split()))\n\nmaxS = max(strength)\nminS = min(strength)\n\nnumOfMaxS = 0\nnumOfMinS = 0\n\nfor i in range(len(strength)):\n if strength[i] == maxS:\n numOfMaxS += 1\n elif strength[i] == minS:\n numOfMinS += 1\n\n[print(0) if maxS == minS else print(len(strength) - numOfMaxS - numOfMinS)]", "n = int(input())\na = list(map(int, input().split()))\na = sorted(a)\n\ncnt = 0\nmaxi = a[-1]\nmini = a[0]\nfor i in range(n):\n if mini < a[i] < maxi:\n cnt += 1\n \nprint(cnt)", "t = int(input())\r\nn = sorted(map(int, input().split()))\r\nprint(len(list(filter(lambda x: x != n[0] and x != n[-1], n))))\r\n", "n = int(input())\r\nlst = list(map(int, input().split()))\r\nmi, ma = min(lst), max(lst)\r\nif mi == ma:\r\n print(0)\r\nelse:\r\n print(n - lst.count(mi) - lst.count(ma))", "n = int(input())\r\nA = [int(i) for i in input().split()]\r\nif len(A) == n:\r\n A.sort()\r\n s = 0\r\n for i in range(n):\r\n if A[0]< A[i] < A[n-1]:\r\n s += 1\r\n print(s)", "n = int(input()) \r\nl = list(map(int,input().split(' '))) \r\nl.sort() \r\nc = 0 \r\nfor i in range(1,n) : \r\n if l[i] > l[0] and l[i] < l[n-1] :\r\n c += 1 \r\nprint(c)\r\n\r\n\r\n", "n = int(input())\r\nstewards = [int(x) for x in input().split()]\r\nmax_steward = max(stewards)\r\nmin_steward = min(stewards)\r\nmax_steward_count = stewards.count(max_steward)\r\nmin_steward_count = stewards.count(min_steward)\r\nprint((n - max_steward_count - min_steward_count) * int(n > 1 and max_steward != min_steward))\r\n", "a=int(input())\nb=list(map(int,input().split()))\ns=0\nk=sorted(b)\nfor i in b:\n if i<k[-1] and i > k[0]:\n s+=1\nprint(s)\n\t\t \t \t \t \t\t\t\t\t \t \t\t\t\t \t\t\t \t", "no=int(input())\nb=list(map(int,input().split()))\nm=max(b)\nc=0\nn=min(b)\nfor i in range(0,no):\n if (b[i]>n and b[i]<m):\n c=c+1\nprint(c)\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\narray = [int(x) for x in input().split()]\r\narray.sort()\r\ntotal = 0\r\nfor i in array:\r\n if i>array[0] and i<array[-1]:\r\n total+=1\r\nprint(total)\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\nprint(max(0, n-a.count(max(a))-a.count(min(a))))\r\n", "n = int(input())\r\ncount = 0\r\nstrength = list(map(int, input().split()))\r\nstrength.sort()\r\nmin_strength, max_strength = strength[0], strength[n - 1]\r\nfor i in strength:\r\n if (min_strength < i < max_strength):\r\n count += 1\r\nprint(count)", "n = int(input())\r\na = sorted(map(int, input().split()))\r\n\r\nif n < 3:\r\n print(0)\r\nelse:\r\n stewards = 0\r\n for i in range(1, n - 1):\r\n if a[i] != a[0] and a[i] != a[n - 1]:\r\n stewards += 1\r\n\r\n print(stewards)\r\n", "import sys\r\nfrom collections.abc import Callable\r\n\r\ndef fn() -> None:\r\n\tread: Callable[[], str] = sys.stdin.readline\r\n\tn = int(read())\r\n\tvalues = [int(i) for i in read().split()]\r\n\tmax_val = max(values)\r\n\tmin_val = min(values)\r\n\tresult = 0\r\n\tfor value in values:\r\n\t\tif min_val < value < max_val:\r\n\t\t\tresult += 1\r\n\tprint(result)\r\n\r\n\r\nif __name__ == '__main__':\r\n\tfn()", "n = int(input())\narr = list(map(int, input().split()))\narr.sort()\nmin_ = arr[0]\nmax_ = arr[-1]\nres = 0\nfor i in range(1, n-1):\n if min_ < arr[i] < max_:\n res += 1\nprint(res)\n", "number_of_stewards = int(input())\r\nstrength_values = list(map(int, input().split()))\r\ncount = 0\r\n \r\nmx = max(strength_values)\r\nmen = min(strength_values)\r\n \r\nfor i in strength_values :\r\n if mx > i and men < i:\r\n count +=1 \r\n \r\nprint(count)\r\n", "t=int(input())\r\ns=list(map(int,input().split()))\r\ns.sort()\r\nk=0\r\nfor i in range(1,t-1):\r\n if(s[0]<s[i] and s[i]<s[t-1]):\r\n k+=1\r\nprint(k)", "n = int(input())\r\nnums = sorted(list(map(int,input().split())))\r\ncounter = 0\r\nfor i in nums:\r\n if i == nums[0] or i == nums[-1]:\r\n continue\r\n else:\r\n counter += 1\r\nprint(counter)\r\n", "input()\r\nr=list(map(int,input().split()))\r\nprint(max(0,len(r)-r.count(min(r))-r.count(max(r))))\r\n", "n=int(input())\narr=list(map(int,input().split()))\ntotal=0\nif len(arr)>2:\n arr.sort()\n min=min(arr)\n max=max(arr)\n for num in arr:\n if num>min and num<max:\n total+=1\nprint(total)\n", "from collections import Counter\nn = int(input())\na = list(map(int, input(). split()))\np = Counter(a)\nif max(a) != min(a):\n print(n - (p[max(a)] + p[min(a)]))\nelse:\n print(n - p[min(a)])\n\n \t \t \t\t\t\t \t \t \t \t \t \t\t \t", "# q34 Oath of the Night's Watch\r\nn = int(input())\r\nlst=list(map(int,input().split(' ')))\r\ncount=0\r\nflag = True\r\n# x=lst.index(max(lst))\r\n# y=lst.index(min(lst))\r\nx= max(lst)\r\ny= min(lst)\r\n\r\nfor i in range (len(lst)):\r\n if lst[i]!=x and lst[i] != y:\r\n count+=1\r\nprint(count) ", "n = int(input())\r\nmylist = [int(_) for _ in input().split()]\r\nmax = max(mylist)\r\nmin = min(mylist)\r\noutput = n - mylist.count(max)-mylist.count(min)\r\nif output <0 :\r\n print(0)\r\nelse:\r\n print(output)", "n = int(input())\r\nl = list(map(int, input().split()))\r\nl.sort()\r\nm = l[0]\r\ni = 0\r\nwhile i < n and l[i] == m:\r\n i += 1\r\nif i == n:\r\n print(0)\r\nelse:\r\n j = n-1\r\n m = l[-1]\r\n while j >= 0 and l[j] == m:\r\n j -= 1\r\n print(j-i+1)", "input()\r\nl = [int(x) for x in input().split()]\r\na,b,cn= min(l),max(l),0\r\nfor x in l: \r\n if x > a and x < b: cn+=1\r\nprint(cn)\r\n", "n = int(input())\r\nlis = list(map(int,input().split()))\r\na = max(lis)\r\nb = min(lis)\r\ncount = 0\r\nfor i in lis:\r\n if i > b:\r\n if i < a:\r\n count += 1\r\nprint(count)", "n = int(input())\r\na = list(map(int, input().split()))\r\n\r\na = sorted(a)\r\ncount = 0\r\nm = min(a)\r\nmaxx =max(a)\r\nfor i in range(1, len(a)-1):\r\n if maxx > a[i] > m:\r\n count += 1\r\n\r\nprint(count)\r\n", "n = int(input())\r\nA = list(map(int, input().split()))\r\nA.sort()\r\nimport bisect\r\nans = 0\r\nfor a in A:\r\n i = bisect.bisect_left(A, a)\r\n j = bisect.bisect_right(A, a)\r\n if 0 < i and j < n:\r\n ans += 1\r\nprint(ans)\r\n", "def main(n,s):\r\n a=s.split()\r\n \r\n b = []\r\n count=0\r\n for i in a:\r\n b.append(int(i))\r\n b.sort()\r\n for i in range(n):\r\n if(b[i]>b[0] and b[i]<b[n-1]):\r\n count+=1\r\n print(count)\r\nif __name__== \"__main__\" :\r\n n=int(input())\r\n s=input()\r\n main(n,s)\r\n", "t =int(input())\r\nn = list(map(int, input().split()))\r\nn.sort()\r\nweak= n[0]\r\nmx = n[-1]\r\nres = 0\r\nfor i in n: \r\n if i != weak and i != mx:\r\n res+=1\r\nprint(res)", "import sys\r\n\r\ninput = sys.stdin.buffer.readline\r\n\r\nn = int(input())\r\np = sorted(list(map(int, input().split())))\r\nm = 1\r\no = 1\r\nfor i in range(n-1):\r\n if p[i] != p[i+1]:\r\n break\r\n else:\r\n m += 1\r\n\r\nfor i in range(n-1, -1, -1):\r\n if p[i] != p[i-1]:\r\n break\r\n else:\r\n o += 1\r\n\r\nif n - o - m <= 0:\r\n print(0)\r\nelse:\r\n print(n-o-m)", "n = int(input())\r\nstrengths = [int(t) for t in input().split()]\r\n\r\nmx = max(strengths)\r\nmn = min(strengths)\r\n\r\nans = 0\r\nfor t in strengths:\r\n if mn < t < mx:\r\n ans += 1\r\n\r\nprint(ans)", "n=int(input())\r\nl=list(map(int,input().split()))\r\n\r\n# err ->strictly less contd not checked \r\n# test case 10 - equals contd -> more nums came[9998-9000]\r\n\r\n#m1 - count smal and large \r\nl=sorted(l)\r\nfi=l.count(l[0])\r\nla=l.count(l[-1])\r\n\r\nif(len(set(l))>2):\r\n print(n-fi-la)\r\nelse:\r\n print(0)", "# cook your dish here\r\nn=int(input())\r\nli=[]\r\nans=0\r\nli=list(map(int,input().split()))\r\nc=min(li)\r\nd=max(li)\r\nfor i in range(0,len(li)):\r\n if((li[i]>c) and(li[i]<d)):\r\n ans+=1\r\nprint(ans)", "N = int(input())\r\nA = sorted([*map(int, input().split())])\r\nans = sum([1 if x != A[0] and x != A[-1] else 0 for x in A])\r\nprint(ans)\r\n", "a=input()\nn=list(map(int,input().split())) \nb=max(n)\nc=min(n)\nm=0\nfor i in n: \n if i>c and i<b:\n m+=1\nprint(m)", "#n=int(input())\r\n#nums=list(map(int,input().split()))\r\n#nums.sort()\r\n#nums.remove(max(nums))\r\n#nums.remove(nums[0])\r\n#print(len(nums))\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\n\r\nif n == 1 or n == 2:\r\n print(0)\r\nelse:\r\n mina = min(a)\r\n maxa = max(a)\r\n ans = 0\r\n for i in a:\r\n if i > mina and i < maxa:\r\n ans += 1\r\n print(ans)", "n = int(input())\r\nx = list(map(int, input().split()))\r\nnum = 0\r\nf = max(x)\r\nz = min(x)\r\nfor i in x:\r\n if i < f and i > z:\r\n num += 1\r\nprint(num)", "def remove_max_min(lst):\r\n\r\n maximum, minimum = max(lst), min(lst)\r\n\r\n lst = [x for x in lst if x != maximum and x != minimum]\r\n\r\n return len(lst) \r\n\r\nn = input()\r\nst = list(map(int,input().split()))\r\nprint(remove_max_min(st))", "import sys\r\nreadline = sys.stdin.readline\r\n\r\n############ ---- Input Functions ---- ############\r\ndef inp():\r\n return(int(readline()))\r\ndef inlt():\r\n return(list(map(int, readline().split())))\r\ndef insr():\r\n s = readline()\r\n return(list(s[:len(s) - 1]))\r\ndef invr():\r\n return(map(int, readline().split()))\r\n\r\nn_stewards = inp()\r\nstewards = inlt()\r\n\r\nstewards = sorted(stewards)\r\nlo = stewards[0]\r\nhi = stewards[-1]\r\n\r\nans = 0\r\nfor s in stewards:\r\n if lo < s < hi:\r\n ans += 1\r\n\r\nprint(ans)", "from bisect import bisect_left, bisect_right\r\ninput();arr = tuple(map(int, input().split()))\r\ns = sorted(set(arr));a = len(s)\r\nprint(sum(bisect_left(s, i) > 0 and bisect_right(s, i) < a for i in arr))", "n = int(input())\r\ns = list(map(int, input().split()))\r\n\r\ns.sort()\r\ncounter = 0\r\nfor i in range(1, n-1):\r\n if (s[i] > s[0]) and (s[i] < s[-1]):\r\n counter += 1\r\n\r\nprint(counter)", "n = int(input())\r\nst = list(map(int, input().split()))\r\nst.sort()\r\nif n > st.count(min(st)) + st.count(max(st)):\r\n print(int(n - (st.count(min(st)) + st.count(max(st)))))\r\nelse:\r\n print(0)\r\n", "input()\na=list(map(int,input().split()))\ncount=0\nmi,ma = min(a),max(a)\nfor i in a:\n if i> mi and i<ma:\n count+=1\nprint(count)\n \t \t\t\t \t \t\t\t \t \t \t\t \t\t\t\t\t", "n = int(input())\r\nlst = [*map(int, input().split())]\r\nmx, mn = max(lst), min(lst)\r\nres = 0\r\nfor i in lst:\r\n if i != mx and i != mn:\r\n res += 1\r\nprint(res)", "n1 =int(input())\r\nn=list(map(int,input().split()))\r\nd=sorted(n)\r\nmaxx = d[-1]\r\nminn = d[0]\r\nans = 0\r\nfor s in n:\r\n if minn < s < maxx:\r\n ans += 1\r\nprint(ans)", "\r\nn = int(input())\r\nl_s = list(map(int, input().split()))\r\nt = 0\r\nl = min(l_s)\r\nm = max(l_s)\r\nfor s in l_s:\r\n if s != l and s != m:\r\n t += 1\r\nprint(t)", "input()\r\na=[*map(int,input().split())]\r\nprint(max(0,len(a)-a.count(min(a))-a.count(max(a))))\r\n", "s = int(input())\r\nsomething = sorted([int(x) for x in input().split()])\r\nanswer = 0\r\nmax1 = something[-1]\r\nmin1 = something[0]\r\nfor i in something[1:-1]:\r\n if i > min1 and i < max1:\r\n answer += 1\r\nprint(answer)", "def merge_sort(A: list) -> list:\r\n if len(A) == 1 or len(A) == 0:\r\n return A\r\n L = merge_sort(A[:len(A) // 2])\r\n R = merge_sort(A[len(A) // 2:]) \r\n n = m = k = 0\r\n C = [0] * (len(L) + len(R))\r\n while n < len(L) and m < len(R):\r\n if L[n] <= R[m]:\r\n C[k] = L[n]\r\n n += 1\r\n else:\r\n C[k] = R[m]\r\n m += 1\r\n k += 1\r\n while n < len(L):\r\n C[k] = L[n]\r\n n += 1\r\n k += 1\r\n while m < len(R):\r\n C[k] = R[m]\r\n m += 1\r\n k += 1\r\n for i in range(len(A)):\r\n A[i] = C[i]\r\n return A\r\n\r\n\r\nn = int(input())\r\n\r\narray = [int(word) for word in input().split(' ')]\r\narray = merge_sort(array)\r\nnum_min = array[0]\r\nnum_max = array[-1]\r\ncount = 0\r\n\r\nfor i in range(1, len(array)):\r\n if array[i] > num_min and array[i] < num_max:\r\n count += 1\r\n \r\nprint(count)", "n = int(input())\r\na = list(map(int, input().split()))\r\n\r\na = sorted(a)\r\n\r\nif (len(a) == 2):\r\n print(0)\r\nelse:\r\n b = a.count(min(a))\r\n d = a.count(max(a))\r\n \r\n b -= 1\r\n d -= 1\r\n \r\n e = set(a)\r\n if (len(e) == 1):\r\n print(0)\r\n else:\r\n print(len(a) - 2 - b - d)", "n = int(input())\r\na = list(map(int, input().split()))\r\nans = n\r\nmi = min(a)\r\nma = max(a)\r\n\r\nfor i in a:\r\n if i == mi or i == ma:\r\n ans -= 1\r\nprint(ans)\r\n", "n = input()\r\nstrength = [int(x) for x in input().split()]\r\nmin = min(strength)\r\nmax = max(strength)\r\ncounter = 0\r\n\r\nfor i in strength:\r\n if i > min and i < max:\r\n counter += 1\r\n\r\nprint(counter)", "n=int(input())\r\nlis= input().split()\r\nlis=sorted(list(map(int,lis)))\r\nx,y=lis[0],lis[-1]\r\ncounter=0\r\nfor i in lis:\r\n if i !=x and i!=y:\r\n counter+=1\r\n \r\nprint(counter)", "if __name__ == '__main__':\r\n n = int(input())\r\n strenghts = [int(s) for s in input().split()]\r\n\r\n minimum = min(strenghts)\r\n maximum = max(strenghts)\r\n\r\n count = 0\r\n\r\n for i in range(n):\r\n if minimum < strenghts[i] < maximum:\r\n count += 1\r\n print(count)", "n = int(input().strip())\r\nstews = [int(idx) for idx in input().strip().split()]\r\n\r\nmx = float('-inf')\r\nmn = float('inf')\r\n\r\nfor s in stews:\r\n if s > mx:\r\n mx = s\r\n if s < mn:\r\n mn = s\r\n\r\n\r\noutput = 0\r\nfor s in stews:\r\n if s > mn and s < mx:\r\n output+=1\r\n\r\nprint(output)\r\n", "n = int(input())\r\nk = list(map(int , input() . split()))\r\nsum = 0\r\n\r\nmin_k = min(k)\r\nmax_k = max(k)\r\n\r\nfor i in range(len(k)):\r\n if k[i] > min_k and k[i] < max_k:\r\n sum += 1\r\nprint(sum)", "n = int(input())\nstrengths = [int(s) for s in input().split()]\n\nmx = max(strengths)\nmn = min(strengths)\n\nans = 0\nfor s in strengths:\n if mn < s < mx:\n ans += 1\n\nprint(ans)\n\t \t\t\t \t\t\t \t\t \t\t \t\t\t\t\t\t\t\t", "n = int(input())\r\nstewards = list(map(int, input().split()))\r\ncount = 0\r\nsm = 10000000000\r\nlg = -10000000000\r\n\r\nfor i in stewards:\r\n sm = min(i, sm)\r\n lg = max(i, lg)\r\n\r\nfor i in stewards:\r\n if i > sm and i < lg:\r\n count += 1\r\n \r\nprint(count)", "n = int(input())\r\nt = list(map(int, input().split()))\r\nt.sort()\r\ncount=0\r\nfor i in range(n):\r\n if t[i]==t[0] or t[i]==t[n-1]:\r\n count = count\r\n else:\r\n count = count + 1\r\nprint(count) ", "n = int(input())\r\na = list(map(int, input().split()))\r\nif n < 3:\r\n print(0)\r\nelse:\r\n a.sort()\r\n # print(a)\r\n supported = n\r\n # print(supported)\r\n for i in range(n - 1):\r\n if a[0] == a[i]:\r\n # print(a[i], 'i')\r\n supported -= 1\r\n else:\r\n i -= 1\r\n break\r\n for j in range(n - 1, 0, -1):\r\n if a[-1] == a[j] and j > i:\r\n # print(a[j], 'j')\r\n supported -= 1\r\n else:\r\n break\r\n print(supported)", "n=int(input())\r\nl=[int (i)for i in input().split()]\r\nmx=max(l)\r\nmn=min(l)\r\nres=0\r\nfor i in l:\r\n if i>mn and i<mx:\r\n res+=1\r\nprint(res)", "n=int(input())\r\nl=[int(i) for i in input().split()]\r\n\r\ns=0\r\nm=max(l)\r\nmi=min(l)\r\nfor i in range(n):\r\n if l[i] < m and l[i] > mi :\r\n s+=1\r\n\r\nprint(s)\r\n\r\n", "if __name__ == '__main__':\r\n import os.path\r\n import sys\r\n import math\r\n\r\n if os.path.exists('input.txt'):\r\n sys.stdin = open('input.txt', 'r')\r\n sys.stdout = open('output.txt', 'w')\r\n \r\n # for _ in range(int(input())):\r\n # n = int(input())\r\n\r\n n = int(input())\r\n l = list(map(int,input().split()))\r\n ma = max(l)\r\n mi = min(l)\r\n ans = 0\r\n for i in l:\r\n if ma>i and mi<i:\r\n ans+=1\r\n print(ans)\r\n\r\n \r\n \r\n\r\n \r\n\r\n\r\n \r\n\r\n\r\n\r\n\r\n\r\n\r\n \r\n\r\n\r\n\r\n\r\n\r\n\r\n \r\n\r\n\r\n\r\n\r\n\r\n \r\n\r\n\r\n\r\n \r\n\r\n\r\n \r\n \r\n \r\n\r\n\r\n \r\n\r\n\r\n \r\n \r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n \r\n \r\n\r\n\r\n\r\n \r\n\r\n\r\n \r\n\r\n\r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n \r\n\r\n\r\n\r\n\r\n \r\n", "n = int(input())\r\na = list(map(int,input().split()))\r\nmin_,max_,cnt = min(a),max(a),0\r\nfor i in a:\r\n if min_<i<max_:\r\n cnt+=1\r\nprint(cnt)\r\n\r\n", "num = int(input())\r\nlst = list(map(int, input().split()))\r\nr = 0\r\n\r\nmx = max(lst)\r\nmen = min(lst)\r\n\r\nfor i in lst :\r\n if mx > i and men < i:\r\n r +=1 \r\n \r\nprint(r)", "n= int(input())\r\nthe_list=list(map(int,input().split()))\r\nif the_list.count(max(the_list))+the_list.count (min(the_list))>=len(the_list):print(0)\r\nelse : print(len(the_list)-(the_list.count(max(the_list))+the_list.count(min(the_list))))", "n=int(input())\r\nlst=list(map(int,input().split()))\r\ncount=0\r\nlst.sort()\r\na=min(lst)\r\nb=max(lst)\r\nfor i in range(1,n-1):\r\n if lst[i]>a and lst[i]<b:\r\n count+=1\r\n\r\nprint(count)\r\n\r\n\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\nmaxi = max(a)\r\nmini = min(a)\r\nc = 0\r\nfor i in a:\r\n if i != maxi and i != mini:\r\n c+= 1\r\nprint(c)\r\n ", "n = int(input())\r\na = list(map(int, input().split()))\r\na.sort()\r\nb = 0\r\nfor i in range(1, n - 1):\r\n if a[i] > a[0] and a[i] < a[-1]:\r\n b += 1\r\nprint(b)\r\n", "def OathOfTheNightsWatch():\r\n n = int(input())\r\n stewards = list(map(int, input().split()))\r\n\r\n if n <= 2:\r\n print(\"0\")\r\n return\r\n\r\n stewards.sort()\r\n count = 0\r\n\r\n for i in range(1, n - 1):\r\n if stewards[i] > stewards[0] and stewards[i] < stewards[-1]:\r\n count += 1\r\n\r\n print(count)\r\n\r\nOathOfTheNightsWatch()\r\n", "n = int(input('')); cnt=0\r\nns = input().split(' ')\r\nns = [int(x) for x in ns]; ns = sorted(ns)\r\nfor i in range(n):\r\n if (ns[i]>ns[0] and ns[i]<ns[n-1]):\r\n cnt+=1\r\nprint(cnt)", "a = int(input())\r\nb = [int(i) for i in str(input()).split()]\r\n \r\nb.sort()\r\n \r\nif len(b) <= 2 :\r\n print(0)\r\n \r\nelse:\r\n c = 0\r\n for i in range(len(b)):\r\n if b[i] > b[0] and b[i] < b[-1]:\r\n c += 1\r\n \r\n print(c)", "n = int(input())\r\na = list(map(int,input().split()))\r\np1,p2,cnt = min(a),max(a),0\r\nfor i in a:\r\n if p1<i<p2:cnt+=1\r\nprint(cnt)", "input()\nl = list(map(int,input().split()))\nmi,ma=min(l),max(l)\nc = 0\nfor x in l:\n if x>mi and x<ma:\n c += 1\nprint(c)\n\t \t\t \t \t\t\t \t\t\t\t\t \t \t \t", "n=int(input())\r\nstewards=list(map(int,input().split()))\r\ncount=0\r\nif n <=2:\r\n count=0\r\nelse:\r\n stewards.sort()\r\n for i in range(1,n-1,1):\r\n if stewards[0]<stewards[i] and stewards[-1]>stewards[i]:\r\n count+=1 \r\nprint(count)", "a,b = int(input()),list(map(int,input().split()))\r\nc,d = min(b),max(b) \r\nprint(sum([1 for i in b if i > c and i < d]))", "num = int(input())\r\nnums = list(map(int,input().split()))\r\nmi , ma = min(nums) , max(nums)\r\ncounter = 0\r\nfor number in nums :\r\n if number > mi and number < ma:\r\n counter+=1\r\nprint(counter)", "n = int(input())\r\n\r\nlst = list(map(int, input().split()))\r\na = min(lst)\r\nb = max(lst)\r\na1 = lst.count(a)\r\nb1 = lst.count(b)\r\nif n - a1-b1>0:\r\n print(n - a1 - b1)\r\nelse:\r\n print(0)\r\n", "input()\na = list(map(int, input().split()))\nmini = min(a)\nmaxi = max(a)\nprint(sum(mini < ai < maxi for ai in a))\n", "n=int(input())\r\na=[int(i) for i in input().split()]\r\nm=min(a)\r\nn=max(a)\r\ncnt=0\r\nfor z in a:\r\n if m<z<n:\r\n cnt+=1\r\nprint(cnt)", "n = int(input())\r\nstewards = list(map(int, input().split()))\r\nstewards.sort()\r\ncount = 0\r\n\r\nfor i in stewards:\r\n if i > stewards[0] and i < stewards[len(stewards)-1]:\r\n count += 1\r\n \r\nprint(count)", "n=int(input())\r\nsw=list(map(int,input().split()))\r\nmaxsw=max(sw)\r\nminsw=min(sw)\r\nc=0\r\nif len(sw)<=2:print('0')\r\nelse: \r\n for i in sw:\r\n if i>minsw and i<maxsw:c+=1\r\n print(c)\r\n\r\n", "no = int(input())\r\ninp = input().split()\r\ninp = [int(x) for x in inp]\r\ninp = sorted(inp)\r\nwhile len(inp) > 2:\r\n if inp[len(inp)-1] == inp[len(inp)-2]:\r\n inp.pop()\r\n elif inp[0] == inp[1]:\r\n inp.pop(0)\r\n else:\r\n print(len(inp) - 2)\r\n break\r\nelse:\r\n print(0)\r\n", "n = int(input())\r\ninfo = list(map(int, input().split()))\r\ninfo.sort()\r\nmx = info[-1]\r\nmn = info[0]\r\nc = 0\r\nfor i in range(len(info)):\r\n if (info[i] > mn) and (info[i] < mx):\r\n c += 1\r\nprint(c)", "nlines=int(input())\r\nseq=input()\r\nalist=seq.split(\" \")\r\nalist1=[]\r\nfor i in range (nlines):\r\n alist1.append(int(alist[i]))\r\nalist1.sort()\r\nc=0\r\nfor i in range(1,nlines-1,1):\r\n if alist1[0]<alist1[i] and alist1[-1]>alist1[i]:\r\n c+=1\r\nprint(c)\r\n\r\n", "n = int(input())\r\nstewards = list(map(int, input().split()))\r\nnumSaves = 0\r\n\r\nmin_height = min(stewards) \r\nmax_height = max(stewards) \r\n\r\nfor i in stewards:\r\n if i > min_height and i < max_height:\r\n numSaves += 1\r\n\r\nprint(numSaves)", "n = int(input())\r\na = list(map(int, input().split()))\r\nb = max(a)\r\nc = min(a)\r\ns = 0\r\nfor i in range(len(a)):\r\n if a[i] < b and a[i] > c:\r\n s = s + 1\r\nprint(s)\r\n", "# Wadea #\r\n\r\ns = int(input())\r\ns1 = input().split()\r\nlst = []\r\nfor i in s1:\r\n i = int(i)\r\n lst.append(i)\r\nlst.sort()\r\n\r\nr1 = lst.count(lst[-1])\r\nr2 = lst.count(lst[0])\r\nr11 = lst[-1]\r\nr22 = lst[0]\r\nq = 0\r\nw = 0\r\nc = 0\r\nfor j in lst:\r\n if j == r11:\r\n w += 1\r\n elif j == r22:\r\n w += 1\r\n else:\r\n q += 1\r\nif q > 0:\r\n for k in lst:\r\n if k == r11:\r\n w += 1\r\n elif k == r22:\r\n w += 1\r\n else:\r\n c += 1\r\n print(c)\r\nelse:\r\n print(\"0\")\r\n", "num=input()\r\narr = list(map(int, input().split()))\r\nans=0\r\noverall_min =min(arr)\r\noverall_max =max(arr)\r\nfor i in range(len(arr)):\r\n if overall_min < arr[i] < overall_max:ans+=1\r\nprint(ans)", "a=int(input())\nb=list(map(int,input().split()))\nk=[]\ns = sorted(b)\nq=0\nfor l in b:\n if l < s[-1] and l > s[0]:\n q+=1\n \nprint(q)\n\n \t \t \t \t\t \t \t\t \t\t", "n,l = int(input()),[int(x) for x in input().split()]\r\nmaxx,minn=max(l),min(l)\r\nout = sum([1 for num in l if num>minn and num < maxx])\r\nprint(out)", "def solve():\r\n mn,mx=min(a),max(a)\r\n ans=0\r\n for i in a:\r\n if i >mn and i<mx:\r\n ans+=1\r\n print(ans)\r\n\r\nif __name__ == '__main__':\r\n n = int(input())\r\n a = [int(x) for x in input().split()]\r\n solve()", "n = int(input())\r\n\r\nnums = list(map(int, input().split()))\r\n\r\nmaxi, mini = max(nums), min(nums)\r\ncounter = 0\r\n\r\nfor i in nums:\r\n if i < maxi and i > mini:\r\n counter += 1\r\n\r\nprint(counter)", "n,a=input(),list(map(int,input().split()))\r\ncount = a.count(min(a))+a.count(max(a))\r\nprint(max(0,len(a)-count))", "n = int(input())\r\ns = sorted([int(x) for x in input().split()])\r\nprint(len(list(filter(lambda x: x != s[0] and x != s[-1], s))))\r\n", "_=int(input())\na=list(map(int,input().split()))\nmi=min(a)\nma=max(a)\ncount=0\nfor i in a:\n if i>mi and i<ma:\n count+=1\nprint(count)\n\t\t \t\t \t\t \t\t \t \t\t \t\t \t \t \t \t\t" ]

[ "\nt=int(input())\nfor _ in range(t):\n n=int(input())\n nums=[]\n for i in range(2*n-1):\n a,b=map(int,input().split())\n nums.append([b,a,i+1])\n nums=sorted(nums)[::-1]\n vals=[nums[0][2]]\n i=1\n while(i+1<len(nums)):\n c=i\n if(nums[i][1]<nums[i+1][1]):\n c=i+1\n vals.append(nums[c][2])\n i+=2\n print(\"YES\")\n print(*vals)", "from sys import stdin\n# read = sys.stdin.readline\nT = int(stdin.readline())\nfor _ in range(T):\n N = int(stdin.readline())\n M = N + N - 1\n data = [ ]\n for i in range(M):\n data.append([int(w) for w in stdin.readline().split()] + [i + 1])\n data.sort(reverse=True)\n # print(data)\n total = sum(d[1] for d in data)\n half = sum(d[1] for d in data[0::2])\n print('YES')\n result = []\n if half + half >= total:\n result.extend([d[2] for d in data[0::2]])\n else:\n result.append(data[0][2])\n result.extend([d[2] for d in data[1::2]])\n print(*result)", "def II():\r\n return(int(input()))\r\ndef LMI():\r\n return(list(map(int,input().split())))\r\ndef I():\r\n return(input())\r\ndef MII():\r\n return(map(int,input().split()))\r\n# import sys\r\n# input=sys.stdin.readline\r\n# import io,os\r\n# input = io.BytesIO(os.read(0,os.fstat(0).st_size)).readline\r\n# from collections import Counter\r\n# int(math.log(len(L)))\r\n# import math\r\n# from collections import defaultdict\r\n# mod=10**9+7\r\nfrom collections import deque\r\n# import math\r\ndef half(a):\r\n if a%2==0:\r\n return a//2\r\n return a//2+1\r\n\r\nfor _ in range(II()):\r\n n=II()\r\n X=[]\r\n tot=0\r\n tot1=0\r\n tot2=0\r\n\r\n for i in range(2*n-1):\r\n a,o=MII()\r\n X.append((a,o,i+1))\r\n tot+=o\r\n print(\"YES\")\r\n X.sort()\r\n for i in range(2*n-1):\r\n if i%2:\r\n tot1+=X[i][1]\r\n else:\r\n tot2+=X[i][1]\r\n\r\n if tot1>=half(tot):\r\n ans=[]\r\n for i in range(1,2*n-1,2):\r\n ans.append(X[i][2])\r\n ans.append(X[-1][2])\r\n print(*ans)\r\n else:\r\n ans=[]\r\n for i in range(0,2*n-1,2):\r\n ans.append(X[i][2])\r\n print(*ans)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n # return\r\n\r\n\r\n\r\n# if __name__==\"__main__\":\r\n\r\n # for _ in range(II()):\r\n # t()\r\n # t()\r\n", "# 解説を見た\r\n# 一見天才だが、「半分以上」を考えるとき、「ソートして隣同士を比較」は定石の一つ。\r\n\r\nimport sys\r\ninput = sys.stdin.readline\r\nfrom operator import itemgetter\r\n\r\nT=int(input())\r\nfor tests in range(T):\r\n N=int(input())\r\n X=[]\r\n for i in range(2*N-1):\r\n a,b=map(int,input().split())\r\n X.append((a,b,i+1))\r\n\r\n X.sort(key=itemgetter(0))\r\n\r\n ANS=[]\r\n for i in range(N-1):\r\n if X[2*i][1]<X[2*i+1][1]:\r\n ANS.append(X[2*i+1][2])\r\n else:\r\n ANS.append(X[2*i][2])\r\n\r\n ANS.append(X[2*N-2][2])\r\n\r\n print(\"YES\")\r\n print(*ANS)\r\n \r\n", "\nt = int(input())\nfor _ in range(t):\n n = int(input())\n nums = []\n for i in range(2*n-1):\n a, b = map(int, input().split())\n nums.append([b, a, i+1])\n s=set()\n nums = sorted(nums)[::-1]\n vals=[]\n vals.append(nums[0][2])\n i=1\n\n while len(vals)<n:\n c=i\n if nums[i][1] <nums[i+1][1]:c+=1\n vals.append(nums[c][2])\n i += 2\n \n print(\"YES\")\n print(*vals)\n" ]

[ "temp=list(map(int,input().split()))\r\nn=temp[0]\r\nm=temp[1]\r\narr=[]\r\n\r\ndef combo(arr,n,c):\r\n arr1=[x for x in arr if x!=0]\r\n if len(arr1)==0:\r\n return c\r\n else:\r\n t=min(arr1)\r\n if max(arr)==0:\r\n return c\r\n else:\r\n for i in range(n):\r\n if arr[i]!=0:\r\n arr[i]=arr[i]-t\r\n c+=1\r\n return combo(arr,n,c)\r\n\r\nfor i in range(n):\r\n str1=input()\r\n a=str1.find('S')\r\n b=str1.find('G')\r\n arr.append(a-b)\r\nif min(arr)<0:\r\n print(-1)\r\nelse:\r\n print(combo(arr,n,0))", "n, m = map(int, input().split())\r\nmatrix = []\r\ndist = set()\r\nfor i in range(n):\r\n line = list(input())\r\n if line.index('G') > line.index('S'):\r\n print(-1)\r\n exit(0)\r\n dist.add(line.index('S') - line.index('G'))\r\nprint(len(dist))", "import sys\n\npositions = {}\ni = 0\nunbeatable = False\nline_n = 0\nfor line in sys.stdin:\n i += 1\n if i == 1:\n line_n = int(line.split(\" \")[0])\n continue\n line = line[:-1]\n for i, ch in enumerate(line):\n if ch == \"G\":\n for l, c in enumerate(line[i:]):\n if c == \"S\":\n positions[l] = True\n break\n else:\n print(-1)\n sys.exit(0)\n if line_n+1 == i:\n break\nprint(len(positions))", "x, y = input().split()\nx = int(x)\ny = int(y)\n\nans = 1\nuni = []\n\nfor i in range(x):\n s = input()\n d = s.find('G') + 1\n c = s.find('S') + 1\n # print(d, c)\n\n if c - d >= 0:\n if c-d not in uni:\n uni.append(c-d)\n else:\n ans = 0\n break \n\nif ans:\n print(len(uni))\nelse:\n print(-1)", "import sys\r\n\r\ntry:\r\n sys.stdin = open('input.txt', 'r')\r\n sys.stdout = open('output.txt', 'w')\r\nexcept:\r\n pass\r\n\r\nn, m = (int(i) for i in input().split())\r\nstr = [input() for i in range(0, n)]\r\narr = []\r\nfor i in range(0, n):\r\n t1, t2 = 0, 0\r\n for j in range(0, m):\r\n if str[i][j] == 'G':\r\n t1 = j\r\n elif str[i][j] == 'S':\r\n t2 = j\r\n if t1 > t2:\r\n print(-1)\r\n exit(0)\r\n if t1 < t2:\r\n arr.append(t2 - t1)\r\narr.sort()\r\nanswer = 0\r\nif (len(arr) > 0):\r\n answer += 1\r\nfor i in range(1, len(arr)):\r\n if arr[i] != arr[i - 1]:\r\n answer += 1\r\nprint(answer)", "n,m = input().strip().split(\" \")\nn,m = int(n),int(m)\narray_S = []\n# array_G = []\nfor i in range(n):\n row = list(input().strip())\n p1,p2 = 0,0\n for j in range(m):\n if (row[j]==\"G\"):\n p1 = j\n elif (row[j]==\"S\"):\n p2 = j\n array_S.append(p2-p1)\n # array_G.append(m-p1)\nif (min(array_S)<0):\n print(-1)\nelse:\n count = 0\n while (max(array_S)>0):\n no0 = list(filter(lambda x:x!=0,array_S))\n dis = min(no0)\n for i in range(n):\n if array_S[i]!=0:\n array_S[i] -= dis\n count+=1\n print(count)\n", "n, m = map(int, input().split())\r\nend = m - 1\r\nMAX = float('inf')\r\narr = set()\r\nfor i in range(n):\r\n inp = input()\r\n # last G, S if they exists\r\n last_g = inp.rfind('G')\r\n if last_g == -1:\r\n last_g = MAX\r\n last_s = inp.rfind('S')\r\n if last_s == -1:\r\n last_s = MAX\r\n if last_s != MAX and last_g != MAX and last_s > last_g:\r\n arr.add(last_s - last_g)\r\n if last_s < last_g:\r\n print(-1)\r\n quit()\r\n\r\nprint(len(arr))\r\n", "m , n = list(map(int,input().split()))\r\nli = list()\r\nposs = 1\r\ndi = list()\r\nfor data in range(m):\r\n val = input()\r\n li.append(list(val))\r\n if(list(val).index('G')>list(val).index('S')):\r\n poss = 0\r\n break\r\n else:\r\n value=list(val).index('S') - list(val).index('G')\r\n if(value not in di):\r\n di.append(value) \r\nif(poss == 0):\r\n print(-1)\r\nelse:\r\n print(len(list(set(di))))\r\n\r\n ", "#!/usr/bin/env python3\n\ndef read_ints():\n\treturn map(int, input().strip().split())\n\nn, m = read_ints()\n\nbest = 0\nopts = set()\n\nfor _ in range(n):\n\tx = input()\n\tg = x.find('G')\n\ts = x.find('S')\n\n\tif s<g:\n\t\tbest = float('inf')\n\t\tbreak\n\telse:\n\t\topts.add(max(best, s-g))\n\nif best == float('inf'):\n\tprint(-1)\nelse:\n\tprint(len(opts))\n\n", "n, m = map(int, input().split())\nk_diff = []\nans = 0\nfor i in range(n):\n s = input()\n konfeta = s.index(\"S\")\n gnom = s.index(\"G\")\n dist = konfeta - gnom\n if dist < 0:\n ans = -1\n else:\n if dist not in k_diff:\n k_diff.append(dist)\nif ans == -1:\n print(-1)\nelse:\n print(len(k_diff))", "n, m = list(map(int, input().split()))\r\nmove = 0\r\ndiff = []\r\npossible = True\r\nfor row in range(n):\r\n s_pos = None\r\n g_pos = None\r\n field = list(input())\r\n for col in range(m):\r\n if field[col] == 'S':\r\n s_pos = col\r\n elif field[col] == 'G':\r\n g_pos = col\r\n if g_pos > s_pos:\r\n possible=False\r\n break\r\n diff.append(s_pos - g_pos)\r\nif possible:\r\n \r\n diff.sort()\r\n prev = None\r\n for elem in diff:\r\n if elem != prev:\r\n move += 1\r\n prev = elem\r\n print(move)\r\nelse:\r\n print(-1)\r\n", "def main():\n n, _ = map(int, input().split())\n res = set()\n for _ in range(n):\n a = input()\n s, g = a.find(\"S\"), a.find(\"G\")\n if s < g:\n print(-1)\n return\n res.add(s - g)\n print(len(res))\n\n\nif __name__ == '__main__':\n main()\n", "n,m=[int(i) for i in input().split()]\r\nl=[]\r\nfor i in range(n):\r\n\tl.append(input())\r\na=True\r\nfor i in range(len(l)):\r\n\tif(l[i].find('G')>l[i].find('S')):\r\n\t\ta=False\r\n\t\tbreak\r\nif(a==False):\r\n\tprint(\"-1\")\r\nelse:\r\n\ty=0\r\n\td={}\r\n\tfor i in l:\r\n\t\tz=i.find('S')-i.find('G')\r\n\t\tif(z not in d):\r\n\t\t\td[z]=1\r\n\t\t\ty+=1\r\n\tprint(y)# your code goes here", "import sys\ndef input(): return sys.stdin.readline().strip()\n\nn, m = map(int, input().split())\nmatrix = []\nfor i in range(n):\n\tmatrix.append(input())\n\ncount = {}\npossible = True\nfor i in range(n):\n\tg_pos = 0; s_pos = 0\n\tfor j in range(m):\n\t\tif matrix[i][j] == 'G':\n\t\t\tg_pos = j\n\t\telif matrix[i][j] == 'S':\n\t\t\ts_pos = j\n\tif s_pos < g_pos:\n\t\tpossible = False\n\t\tbreak\n\telse:\n\t\tcount[s_pos-g_pos] = 1\n\nif possible:\n\tprint(len(count))\nelse:\n\tprint(-1)", "n,m=map(int,input().split())\r\nsol=True\r\ndst=set()\r\nfor _ in range(n):\r\n l=input()\r\n g=s=0\r\n for j in range(m):\r\n if l[j]=='G':\r\n g=j\r\n if l[j]=='S':\r\n s=j\r\n if s<g:\r\n sol=False\r\n else:\r\n dst.add(g-s)\r\nprint(len(dst) if sol else -1)", "import sys\r\n\r\n\r\nn_m=list(input().split(' '))\r\nn=int(n_m[0])\r\nm=int(n_m[1])\r\nczsz=[]\r\nb=0\r\nfor i in range(n):\r\n martix=input()\r\n for a in range (m):\r\n if martix[a]==\"G\":\r\n g=a \r\n if martix[a]==\"S\":\r\n s=a\r\n chazhi=int(s-g)\r\n if chazhi>=0:\r\n czsz.append(chazhi)\r\n else:\r\n print(-1)\r\n sys.exit(0)\r\nif czsz: \r\n czszset=set(czsz)\r\n print(len(czszset))", "def solve_tip(n, m):\r\n sol = set()\r\n for _ in range(n):\r\n line = input()\r\n g = line.find('G')\r\n s = line.find('S')\r\n if s < g:\r\n return -1\r\n sol.add(s - g)\r\n return len(sol)\r\n\r\n\r\nif __name__ == '__main__':\r\n n, m = [int(x) for x in input().split()]\r\n print(solve_tip(n, m))", "n,m = map(int, input().split())\r\nresult = True\r\nres = []\r\nfor _ in range(n):\r\n arr= input()\r\n g = False\r\n lasts= -1\r\n gstart =0\r\n for index, i in enumerate(arr):\r\n if i== \"G\":\r\n g= True\r\n gstart =index\r\n elif i ==\"S\":\r\n if g:\r\n lasts=index\r\n res.append(lasts-gstart)\r\n break\r\n else:\r\n result = False\r\n break\r\nres = set(res)\r\nif result:\r\n print(len(res))\r\nelse:\r\n print(-1)\r\n\r\n", "from operator import indexOf\r\ntext=input()\r\ntext=text.split(\" \")\r\nn=int(text[0])\r\nm=text[1]\r\ncount=set({})\r\nfor i in range(0,n):\r\n s=input()\r\n if(indexOf(s,'G')>indexOf(s,'S')):\r\n print(-1)\r\n exit()\r\n else:\r\n count.add(indexOf(s,'S')-indexOf(s,'G'))\r\n\r\nprint(count.__len__())", "n, m = map(int, input().split())\r\n\r\ndistances_map = {}\r\nnum_distances = 0\r\n\r\nfor i in range(n):\r\n line = input()\r\n indexG = 0\r\n indexS = 0\r\n for j in range(len(line)):\r\n if (line[j] == \"G\"):\r\n indexG = j\r\n elif (line[j] == \"S\"):\r\n indexS = j\r\n\r\n dist = indexS - indexG\r\n if (dist < 0):\r\n num_distances = -1\r\n break\r\n elif (dist not in distances_map):\r\n distances_map[dist] = 1\r\n num_distances += 1\r\n\r\nprint (num_distances)", "import sys\r\n\r\nH, W = map(int, input().split())\r\nL = set()\r\nfor y in range(H):\r\n row = input().strip()\r\n i_sweet = row.find('S')\r\n i_gnome = row.find('G')\r\n if i_sweet == -1 or i_gnome > i_sweet:\r\n print(-1)\r\n sys.exit(0)\r\n L.add(i_sweet - i_gnome)\r\nprint(len(L))\r\n", "n, m = map(int, input().split(' '))\nseen = set()\nans = True\nfor i in range(n):\n s, g = None, None\n row = input()\n for i, c in enumerate(row):\n if c == 'S':\n s = i\n elif c == 'G':\n g = i\n if s-g<0:\n ans = False\n elif s-g>0:\n seen.add(s-g)\nif ans: \n print(len(seen))\nelse:\n print(-1)", "rows, columns = map(int,input().split())\r\n\r\nelems = []\r\nres = 0 \r\ndistance_from_candy = []\r\n\r\nfor i in range(rows):\r\n x = input()\r\n elems.append(x)\r\n \r\n if (x.index(\"G\") > x.index(\"S\")):\r\n res = -1\r\n \r\n if (x.index(\"G\") != x.index(\"S\")):\r\n distance_from_candy.append(x.index(\"S\") - x.index(\"G\"))\r\n \r\nif (res == -1):\r\n print(res)\r\n exit()\r\n \r\ndistance_from_candy = list(set(distance_from_candy))\r\n \r\nprint(len(distance_from_candy)) ", "n, m = map(int, input().split())\r\nl = set()\r\n\r\nfor i in range(n):\r\n s = input()\r\n l.add(s.find('S') - s.find('G'))\r\n\r\nprint(-1 if any(a < 0 for a in l) else len(l))", "solved = False\r\nanss = set()\r\nn,m = map(int,input().split())\r\ndef findgs(arr):\r\n g = 0\r\n s = 0\r\n for i in range(len(arr)):\r\n if arr[i]=='G':\r\n g= i\r\n if arr[i]=='S':\r\n s = i\r\n return [g,s]\r\n\r\n\r\n\r\nfor i in range(n):\r\n g,s = findgs(input())\r\n if g>s or g == m-1:\r\n solved = True\r\n anss.add(s-g)\r\nif solved :\r\n print(-1)\r\nelse:\r\n print(len(anss))\r\n\r\n\r\n", "n,m=map(int,input().split())\r\nst=set()\r\nfor i in range(n):\r\n s1=input()\r\n g=s1.index(\"G\")\r\n s=s1.index(\"S\")\r\n if s<g:\r\n print(-1)\r\n exit(0)\r\n st.add(abs(s-g))\r\nprint(len(st))", "n, m = (int(x) for x in input().split())\nst = set()\nfor i in range(n):\n\ts = input()\n\tg = s.index('G')\n\ts = s.index('S')\n\tif g > s:\n\t\tprint(-1)\n\t\texit(0)\n\tst.add(s - g)\nprint(len(st))\n", "n, m = [int(i) for i in input().split()]\r\n\r\nres = []\r\nposs = True\r\nfor i in range(n):\r\n \r\n row = [ch for ch in input()]\r\n \r\n c = 0\r\n d = 0\r\n for i,ch in enumerate(row):\r\n \r\n if ch == 'G':\r\n d = i\r\n \r\n elif ch == 'S':\r\n c = i\r\n \r\n dist = c - d -1\r\n if dist < 0:\r\n poss = False\r\n break\r\n \r\n res.append(dist)\r\n\r\nif poss:\r\n print(len(set(res)))\r\n \r\nelse:\r\n print(-1)", "n,m=map(int,input().split())\r\nv=[]\r\nfor j in range(n):\r\n b=input()\r\n g= b.find(\"G\")\r\n s= b.find(\"S\")\r\n if s-g < 0:\r\n print(-1)\r\n break\r\n else:\r\n v+=[s-g]\r\nelse:\r\n print(len(set(v)))\r\n\r\n\r\n\r\n\r\n\r\n", "n, m = map(int, input().split())\narr = []\nans = 0\nflag = True\nfor i in range(n):\n\ts = input()\n\tif(flag):\n\t\tgap = s.find(\"S\") - s.find(\"G\")\n\t\tif(gap > 0):\n\t\t\tif(gap not in arr):\n\t\t\t\tarr.append(gap)\n\t\t\t\tans += 1\n\t\telse:\n\t\t\tflag = False\nif(flag):\n\tprint(ans)\nelse:\n\tprint(-1)", "import math\r\ndef solution():\r\n\tn,m = [int(x) for x in input().split(' ')]\r\n\tmatrix = []\r\n\ts = []\r\n\tfor i in range(n):\r\n\t\tline = list(input())\r\n\t\tmatrix.append(line)\r\n\t\tcoo = line.index('S') - line.index('G')\r\n\t\tif coo<0:\r\n\t\t\treturn -1\r\n\t\ts.append(coo)\r\n\ts = set(s)\r\n\treturn len(s)\r\n\r\nprint(solution())", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Tue Aug 2 15:45:17 2022\r\n\r\n@author: Conor\r\n\r\nCFSheet B Problem 38 - CF400-DIV2B\r\n\"\"\"\r\n\r\nn,m = map(int,input().split())\r\nd = {}\r\nflag = False\r\nfor i in range(n):\r\n line = str(input())\r\n if line.index(\"S\") < line.index(\"G\"):\r\n flag = True\r\n break\r\n d[line.index(\"G\") - line.index(\"S\")] = 1\r\nif flag:\r\n print(-1)\r\nelse:\r\n print(len(d.keys()))\r\n\r\n", "def dist(s):\r\n return s.find('S') - s.find('G') - 1\r\n\r\nn, m = map(int, input().split())\r\nres = [dist(input()) for i in range(n)]\r\nprint(-1 if min(res) < 0 else len(set(res)))\r\n", "row_count, column_count = map(int, input().split())\r\nmatrix = [list(input()) for _ in range(row_count)]\r\n\r\nfor row in matrix:\r\n if row.index(\"G\") > row.index(\"S\"):\r\n print(\"-1\")\r\n exit(0)\r\n\r\nprint(len(set([r.index(\"S\") - r.index(\"G\") for r in matrix])))\r\n", "def dist(s):\r\n return s.find(\"S\") - s.find(\"G\") - 1\r\n \r\na, b = map(int, input().split())\r\ndists = [dist(input()) for i in range(a)]\r\nif min(dists) < 0:\r\n print(-1)\r\nelse:\r\n print(len(set(dists)))", "n,m = list(map(int,input().split()))\r\na = []\r\nans = set()\r\nfor i in range(n):\r\n a.append(input())\r\n ind_G = a[i].index('G')\r\n ind_S = a[i].index('S')\r\n if ind_S<ind_G:\r\n print(-1)\r\n exit()\r\n ans.add(ind_S-ind_G)\r\nprint(len(ans))", "\r\nmatrix = []\r\nn, m = map(int, input().split())\r\nfor i in range(n):\r\n currentCol = list(input())\r\n matrix.append(currentCol)\r\n\r\nresult = None\r\ndwarfs = []\r\nfor i in range(len(matrix)):\r\n g = False\r\n for x in range(len(matrix[i])):\r\n if matrix[i][x] == \"S\" and not g:\r\n result = -1\r\n break\r\n elif matrix[i][x] == \"G\":\r\n g = True\r\n dwarfs.append((i, x))\r\n\r\nif result != -1:\r\n currentSet = set()\r\n for currentRow, currentCol in dwarfs:\r\n candyCol = None\r\n for i in range(currentCol + 1, len(matrix[currentRow])):\r\n if matrix[currentRow][i] == \"S\":\r\n candyCol = i\r\n break\r\n currentSet.add(candyCol - currentCol)\r\n result = len(currentSet)\r\n print(result)\r\nelse:\r\n print(result)\r\n", "n, m = map(int, input().split())\r\nst = set()\r\nfor _ in range(n):\r\n line = input()\r\n g = line.index('G')\r\n s = line.index('S')\r\n if s - g < 0:\r\n print(-1)\r\n break\r\n st.add(s-g)\r\nelse:\r\n print(len(st))\r\n", "n,m=map(int, input().split())\r\nmoves=[] #[1,2,0,0]\r\nfor i in range(m):\r\n moves.append(0)\r\nflag=False\r\nfor i in range(n):\r\n line=input()\r\n s=line.index('S')\r\n g = line.index('G')\r\n if s<g:\r\n flag=True\r\n break\r\n elif s>g:\r\n moves[s-g]+=1\r\nif flag:\r\n print(-1)\r\nelse:\r\n c=0\r\n for j in moves:\r\n if j>=1:\r\n c+=1\r\n print(c)", "n,m=map(int,input().split())\r\nl=[]\r\nfor i in range(n):\r\n k=list(input())\r\n s=-1\r\n for j in range(m):\r\n if k[j]==\"G\":\r\n for a in range(j+1,m):\r\n if k[a]==\"S\":\r\n s=abs(j-a)\r\n l.append(s)\r\nif min(l)==-1:\r\n print(-1)\r\nelse:\r\n print(len(set(l)))\r\n ", "n, m = [int(_) for _ in input().split(' ')]\r\n\r\nmoves = 0\r\ngrid = []\r\n\r\nfor _ in range(n):\r\n row = input()\r\n dist = row.find(\"S\") - row.find(\"G\")\r\n if dist < 0:\r\n moves = -1\r\n break\r\n if dist in grid:\r\n continue\r\n grid.append(dist)\r\n moves += 1\r\n\r\nprint (moves)\r\n ", "n,m=map(int,input().split())\r\nres=True \r\nl=[]\r\nc=0\r\nfor x in range(n) : \r\n lin=input()\r\n g=lin.find('G')\r\n s=lin.find('S')\r\n if lin.find('G')>lin.find('S') : \r\n res=False\r\n if res and ((s-g) not in l) :\r\n l.append(s-g)\r\n c+=1\r\nif res :\r\n print(c)\r\nelse:\r\n print(-1) ", "n,m=list(map(int,input().split()));set1=set()\r\nfor i in range(n):\r\n x=input();candy=x.index(\"S\");dwarf=x.index(\"G\")\r\n if dwarf>candy:\r\n print(-1)\r\n break\r\n else: set1.add(candy-dwarf)\r\nelse:print(len(set1))", "n,m=map(int,input().split())\r\na=set()\r\nans=1\r\nfor _ in range(n):\r\n x=input()\r\n if x.find('S')-x.find('G')<0:\r\n ans=0\r\n break\r\n else:\r\n temp=x.find('S')-x.find('G')\r\n a.add(temp)\r\nif ans:\r\n print(len(a))\r\nelse: \r\n print(-1)", "lines, columns = map(int, input().split())\r\n\r\nlines_info = []\r\nwhile lines > 0:\r\n line = input()\r\n gnome = line.index('G')\r\n sweet = line.index('S')\r\n if sweet - gnome <= 0:\r\n print(-1)\r\n exit(0)\r\n lines_info.append([gnome, sweet])\r\n lines -= 1\r\n\r\ncount = 0\r\nwhile lines_info:\r\n min_different = 9999\r\n for line_info in lines_info:\r\n if line_info[1] - line_info[0] < min_different:\r\n min_different = line_info[1] - line_info[0]\r\n del_indexes = []\r\n for i in range(len(lines_info)):\r\n lines_info[i][0] += min_different\r\n if lines_info[i][0] == lines_info[i][1]:\r\n del_indexes.append(i - len(del_indexes))\r\n for i in del_indexes:\r\n del lines_info[i]\r\n count += 1\r\n\r\nprint(count)\r\n", "import sys\r\n\r\n\r\ndef main() -> None:\r\n read = sys.stdin.readline\r\n m, n = (int(i) for i in read().split())\r\n distances = set()\r\n for _ in range(m):\r\n row = read().strip()\r\n pos_g = -1\r\n pos_c = -1\r\n for i, c in enumerate(row):\r\n if c == 'G':\r\n pos_g = i\r\n elif c == 'S':\r\n pos_c = i\r\n # Not found or g is after c\r\n if pos_g == -1 or pos_c == -1 or pos_g > pos_c:\r\n print(-1)\r\n return\r\n else:\r\n distances.add(pos_g - pos_c)\r\n\r\n print(len(distances))\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "n,k = map(int,input().split())\r\nchess = []\r\nchecked = []\r\ncount = 0\r\nl = [0]*(n)\r\nfor i in range(n):\r\n chess.append(input())\r\nfor i in range(n):\r\n G = chess[i].index(\"G\")\r\n S = chess[i].index(\"S\")\r\n if S < G:\r\n print(-1)\r\n break\r\n else:\r\n l[i] = S - G\r\nelse:\r\n for i in l:\r\n if i not in checked:\r\n checked.append(i)\r\n count += 1\r\n print(count)", "from math import inf\n\nn, m = [int(x) for x in input().split()]\n\nmax_dist = 0\n\n\ndef process_line(l):\n g_pos = -1\n dist = 0\n\n for i,x in enumerate(l):\n if x == 'G':\n g_pos = i\n\n elif x == 'S':\n if g_pos == -1:\n dist = -1\n break\n dist = i - g_pos\n break\n\n return dist\n\n\ndistances = set()\nres = 0\nfor _ in range(n):\n l = input()\n \n dist = process_line(l)\n if dist == -1:\n res = -1\n break\n \n distances.add(dist)\n\n\nif res != -1:\n res = len(distances)\n\nprint(res)\n\n", "n, m = map(int, input().split())\r\nmat = [ input() for i in range(n)]\r\n\r\ns = set()\r\nfor i in range(n):\r\n d, c = -1, -1\r\n for j in range(m):\r\n if mat[i][j] == 'G':\r\n d = j\r\n if mat[i][j] == 'S':\r\n c = j\r\n if c < d :\r\n print(-1)\r\n break \r\n else:\r\n s.add(d-c)\r\nelse:\r\n print(len(s))", "n, m = map(int, input().split())\n\nps = set()\ncan = True\n\nfor _ in range(n):\n s = input()\n p = s.index(\"S\") - s.index(\"G\")\n if p < 0:\n can = False\n else:\n ps.add(p)\n\nprint(len(ps)) if can else print(-1)", "N, M = map(int, input().split())\r\nA = [0 for i in range(N)]\r\nfor i in range(N):\r\n\tP = input()\r\n\tG, S = -1, -1\r\n\tfor j in range(M):\r\n\t\tif P[j] == 'G': G = j\r\n\t\telif P[j] == 'S': S = j\r\n\tif G > S:\r\n\t\tprint(-1)\r\n\t\texit(0)\r\n\tA[i] = S - G\r\n\r\ndef unique(a):\r\n\treturn len(set(a))\r\n\r\nprint(unique(A))", "n, m = [int(y) for y in input().split()]\r\na=set()\r\nfound=False\r\nfor _ in range(n):\r\n s=input()\r\n for i in range(m):\r\n if s[i]=='G':g=i\r\n if s[i]=='S':c=i\r\n if c<g:\r\n print(-1)\r\n found=True\r\n break\r\n else:\r\n a.add(c-g)\r\nif not found:print(len(a))", "import sys\r\ninput = sys.stdin.readline\r\nread_tuple = lambda _type: map(_type, input().split(' '))\r\nfrom collections import Counter\r\n\r\ndef solve(n, m, grid):\r\n diffs = [row.index('S') - row.index('G') for row in grid]\r\n for diff in diffs:\r\n if diff < 0:\r\n return -1\r\n return len(Counter(diffs))\r\n \r\n\r\nif __name__ == '__main__':\r\n n, m = read_tuple(int)\r\n grid = [list(input().replace('\\n', '')) for _ in range(n)]\r\n print(solve(n, m, grid))\r\n ", "n,m=map(int,input().split())\r\n\r\nli=[0]*1002\r\nfor i in range(0,n):\r\n a=input()\r\n pG=0\r\n pS=0\r\n for j in range(0,m):\r\n if a[j]=='G':\r\n pG=j\r\n elif a[j]=='S':\r\n pS=j\r\n if pS<pG:\r\n print(-1)\r\n break\r\n li[pS-pG]=1;\r\nelse:\r\n ans=0\r\n for i in range(1,1002):\r\n ans+=li[i]\r\n print(ans)\r\n \r\n", "lst=[]\r\nz,x=input().split();z=int(z)\r\nfor i in range(z):\r\n c=input()\r\n lst.append(c.index('S')-c.index('G'))\r\nlst=set(lst)\r\nprint([len(lst),-1][min(lst)<0])\r\n", "'''\r\nCreated on 27.4.2016\r\n\r\n@author: Ivan\r\n'''\r\nimport sys\r\ndef main():\r\n line = input()\r\n parts = line.split(\" \")\r\n a = int(parts[0])\r\n b = int(parts[1])\r\n list = []\r\n for i in range(0, a):\r\n list.append(input())\r\n pairs = []\r\n res = 0\r\n for l in list:\r\n x = l.find(\"G\")\r\n y = l.find(\"S\")\r\n print()\r\n if y < x:\r\n print(\"-1\")\r\n return\r\n pairs.append((y - x))\r\n pairs = set(pairs)\r\n print(str(len(pairs)))\r\nif __name__ == '__main__':\r\n main()", "n,m=map(int,input().split())\r\nss=set()\r\nfor _ in range(n):\r\n s=input()\r\n i,j=s.index(\"G\"),s.index(\"S\")\r\n if j<i :\r\n print(-1)\r\n exit()\r\n else:\r\n ss.add(j-i)\r\nprint(len(ss))", "n , m = map(int,input().split())\r\n\r\ngrid = []\r\na = set()\r\nfor i in range(n):\r\n s = input()\r\n x , y = 0 , 0\r\n for j in range(len(s)):\r\n if s[j] == 'S':\r\n x = j\r\n\r\n elif s[j] == 'G':\r\n y = j\r\n\r\n else:\r\n continue\r\n\r\n a.add(x - y)\r\n\r\n#print(a)\r\n\r\nf = 1\r\nfor i in a :\r\n if i < 0 :\r\n f = 0\r\n break\r\n\r\nif (f):\r\n print(len(a))\r\n\r\nelse:\r\n print('-1')\r\n", "l = list(map(int, input().split()))\r\nn = l[0]\r\nm = l[1]\r\ns = set()\r\nb = False\r\nfor i in range(n):\r\n q = input()\r\n b = False\r\n count = 0\r\n if q.find('S') < q.find('G'):\r\n print('-1')\r\n break\r\n for j in range(m):\r\n if q[j] == 'G':\r\n b = True\r\n elif b and q[j] == '*':\r\n count += 1\r\n elif q[j] == 'S':\r\n s.add(count)\r\n break\r\nelse:\r\n print(len(s))", "n, m = map(int, input().split())\r\ndist_w = 2001\r\ndist_s = -1\r\nflag = False\r\nans = set()\r\nfor i in range(n): \r\n s = input()\r\n gnome = s.find(\"G\")\r\n sweet = s.find(\"S\")\r\n if gnome > sweet:\r\n flag = True\r\n break\r\n ans.add(sweet - gnome)\r\nif flag:\r\n print(-1)\r\nelse:\r\n print(len(ans))", "a,b=[int(i) for i in input().split()]\r\nl=[]\r\nd=0\r\nfor i in range(a):\r\n s=str(input())\r\n if(s.index('S')-s.index('G')>0):\r\n l.append(s.index('S')-s.index('G'))\r\n else:\r\n d=d+1\r\nc=set(l)\r\nif(d>0):\r\n print(\"-1\")\r\nelse:\r\n print(len(c))\r\n \r\n", "dic = {}\r\nn, m = list(map(int, input().split()))\r\nfor i in range(n):\r\n s = list(input())\r\n G = s.index('G')\r\n S = s.index('S')\r\n distance = S - G\r\n if distance < 0:\r\n print(-1)\r\n exit()\r\n else:\r\n dic[distance] = None\r\nprint(len(dic))", "import heapq\r\nr, c = map(int, input().split())\r\nnoAnswer = False\r\ndistances = []\r\nfor i in range(r):\r\n st = input()\r\n g = -1\r\n s = -1\r\n for index in range(len(st)):\r\n if st[index] == '*':\r\n continue\r\n if st[index] == 'G':\r\n g = index\r\n if st[index] == 'S':\r\n s = index\r\n if g >= s:\r\n noAnswer = True\r\n continue\r\n heapq.heappush(distances, s - g)\r\nif noAnswer:\r\n print(-1)\r\nelse:\r\n t = 0\r\n while distances:\r\n minimum_distance = distances[0]\r\n heapq.heappop(distances)\r\n tmp = []\r\n while distances:\r\n pop = distances[0]\r\n heapq.heappop(distances)\r\n if pop - minimum_distance > 0:\r\n tmp.append(pop - minimum_distance)\r\n for num in tmp:\r\n heapq.heappush(distances, num)\r\n t += 1\r\n print(t)", "import math\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 table = [list(input()) for i in range(n)]\r\n collector = []\r\n cant_be_done = False\r\n for i in range(n):\r\n for j in range(m):\r\n if table[i][j] == \"G\":\r\n g_pos = j\r\n elif table[i][j] == \"S\":\r\n s_pos = j\r\n dif = s_pos - g_pos\r\n if dif < 0:\r\n cant_be_done = True\r\n break\r\n else:collector.append(dif)\r\n if cant_be_done:\r\n print(-1)\r\n else:\r\n hash = {}\r\n counter = 0\r\n collector.sort()\r\n for i in collector:\r\n if not i in hash:\r\n hash[i] = 1\r\n counter += 1\r\n print(counter)\r\n\r\n\r\n\r\n\r\nmain_function()\r\n\r\n\r\n", "n , m = map(int,input().split())\r\nrecord = set()\r\nfor i in range(n):\r\n\tt = input()\r\n\tif t.index('G') > t.index('S'):\r\n\t\tprint(-1)\r\n\t\texit()\r\n\telse:\r\n\t\trecord.add(t.index('S') - t.index('G'))\r\nif record:\r\n\tprint(len(record))", "ds = set()\r\nn, m = map(int, input().split())\r\nfor i in range(n):\r\n r = input()\r\n d = r.index('S') - r.index('G')\r\n if d < 0:\r\n print(-1)\r\n exit()\r\n ds.add(d)\r\nprint(len(ds))", "n, m = map(int, input().split())\r\nd = [0] * m\r\nfor i in range(n):\r\n t = input()\r\n d[t[t.find('G') + 1: ].find('S')] = 1\r\nif d[-1]: print(-1)\r\nelse: print(sum(d))\r\n", "import sys\nfrom functools import lru_cache\n\ndef main(mat):\n dist = []\n for row in mat:\n g = row.index('G')\n s = row.index('S')\n if g > s:\n print(-1)\n return\n else:\n if s - g > 0:\n dist.append(s - g)\n\n # Game can be won.\n print(len(set(dist)))\n\nif __name__ == \"__main__\":\n mat = []\n for e, line in enumerate(sys.stdin.readlines()):\n inp = line.strip()\n if e == 0:\n continue\n mat.append(list(c for c in inp))\n main(mat)\n", "n, m = map(int, input().split())\r\nlst = []\r\nfor i in range(n):\r\n temp =input()\r\n lst.append(temp)\r\n\r\ndist = []\r\n\r\nfor i in lst:\r\n candy = i.index(\"S\")\r\n dwarf = i.index(\"G\")\r\n if dwarf > candy:\r\n print(-1)\r\n exit()\r\n dist.append(candy - dwarf)\r\n \r\ndist = set(dist)\r\n\r\nprint(len(dist))", "from collections import defaultdict\r\n\r\nn, m = map(int, input().split())\r\nans = 0\r\nbk = defaultdict(int)\r\nfor _ in range(n):\r\n r = list(input())\r\n di = r.index('G')\r\n ci = r.index('S')\r\n if di > ci:\r\n print(-1)\r\n break\r\n diff = di - ci\r\n if not bk[diff]:\r\n ans += 1\r\n bk[diff] = 1\r\nelse:\r\n print(ans)", "n, m = map(int, input().split())\nc = set(s.find(\"S\") - s.find(\"G\") for s in (input() for _ in range(n)))\nprint(-1 if any(a < 0 for a in c) else len(c))", "n,m=map(int,input().split())\ndst=set()\nfor _ in range(n):\n l=input()\n s=l.find('S')\n g=l.find('G')\n if s<g:\n print(-1)\n exit(0)\n else:\n dst.add(g-s)\nprint(len(dst))\n", "inp = list(map(int, input().split()))\r\nn = inp[0]\r\nm = inp[1]\r\n\r\nres = 0\r\nmas = []\r\nfor i in range(n):\r\n b = list(input())\r\n G = b.index('G')\r\n S = b.index('S')\r\n if S < G:\r\n res = -1\r\n mas.append(S-G)\r\n\r\nif res == -1:\r\n print(res)\r\n\r\nelse:\r\n print(len(set(mas)))", "s=set()\r\nn,m=input().split(\" \")\r\nn=int(n)\r\nm=int(m)\r\nfor i in range(n):\r\n test=input()\r\n if(test.find(\"S\")-test.find(\"G\")<0):\r\n print(-1)\r\n exit(0)\r\n break\r\n else:\r\n s.add(int(test.find('S')-test.find(\"G\")))\r\nprint(len(s))", "n,m=map(int,input().split())\r\ns=set()\r\nfor i in range(n):\r\n x=input()\r\n s.add((x.find('S')-x.find('G')))\r\nb=0\r\nans= len(s)\r\nfor i in s:\r\n if i<0: b=1\r\nif b: ans=-1\r\nprint(ans)", "n,m=map(int,input().split(\" \"))\r\nli=[]\r\nfor i in range(n):\r\n s=input()\r\n li.append(s)\r\nfl=0\r\nhs=[0]*1001\r\nfor i in range(n):\r\n cid=li[i].find('S')\r\n did=li[i].find('G')\r\n if cid<did:\r\n fl=1\r\n break\r\n else:\r\n hs[cid-did]=1\r\nif fl==1:\r\n print(-1)\r\nelse:\r\n ans=0\r\n for i in range(1001):\r\n if hs[i]==1:\r\n ans+=1\r\n print(ans)\r\n", "n, m = map(int, input().split())\r\nbad = False\r\nd = set()\r\nfor i in range(n):\r\n inp = list(input())\r\n s = inp.index(\"S\")\r\n g = inp.index(\"G\")\r\n if s < g:\r\n bad = True\r\n else:\r\n d.add(s - g)\r\n\r\nif bad:\r\n print(-1)\r\nelse:\r\n print(len(d))\r\n", "n,m = [int(x) for x in input().split()]\r\ndistinctmoves = set()\r\nfor i in range(n):\r\n x = input()\r\n g = x.index('G')\r\n s = x.index('S')\r\n if g>s:\r\n print(-1)\r\n break\r\n distinctmoves.add(s-g)\r\nelse:\r\n print(len(distinctmoves))", "n, m = map(int,input().split())\nfield = []\nwrong = 0\nfor i in range(n):\n s = input()\n G = -1\n S = -1\n scount =0 \n gcount =0 \n for j in range(m):\n if(s[j]=='G'):\n G = j\n gcount+=1\n if(s[j]=='S'):\n S = j\n scount+=1\n if(scount>1 or gcount>1):\n wrong = 1\n continue\n if(scount<1 or gcount<1):\n wrong = 1\n continue\n if(S<G):\n wrong = 1\n continue\n field.append(S-G)\nif(wrong==1):\n print(-1)\nelse:\n d = {}\n for i in field:\n if(i!=0 and i not in d):\n d[i] = 1\n print(len(d.keys()))\n", "a, b = map(int, input().split())\r\narray = [0] * a\r\nfor i in range(a):\r\n temp = input()\r\n array[i] = temp.find(\"S\") - temp.find(\"G\")\r\narray.sort()\r\nif array[0] > 0:\r\n if len(array) != 1:\r\n count = 1\r\n for i in range(1, a):\r\n if array[i] != array[i-1]:\r\n count+= 1\r\n print(count)\r\n else:\r\n print(1)\r\nelse:\r\n print(-1)\r\n", "n, m = map(int, input().split())\r\nminn = 1000\r\na=[]\r\nfor i in range(n):\r\n word = input()\r\n if word.find(\"S\") < word.find(\"G\"):\r\n print(-1)\r\n exit()\r\n else:\r\n x = word.find(\"S\") - word.find(\"G\")\r\n if x not in a:\r\n a.append(x)\r\nprint(len(a))\r\n\r\n", "n, m = map(int, input().split())\r\na = set()\r\nfor i in range(n):\r\n\ts = input()\r\n\tg = s.find(\"G\")\r\n\tc = s.find(\"S\")\r\n\tif c < g:\r\n\t\tprint(-1)\r\n\t\texit()\r\n\ta.add(g - c)\r\nprint(len(a))\r\n\t\r\n", "import sys\r\n\r\nn, m = map(int, input().split())\r\noutput = set()\r\npossible = True\r\n\r\nfor row in range(n):\r\n initialState = input()\r\n dwarfPos = initialState.find(\"G\")\r\n candyPos = initialState.find(\"S\")\r\n\r\n if dwarfPos > candyPos:\r\n possible = False\r\n break\r\n elif dwarfPos < candyPos:\r\n output.add(candyPos - dwarfPos)\r\n\r\nif possible:\r\n print(len(output))\r\nelse:\r\n print(\"-1\")\r\n", "n,m=list(map(int,input().split()))\r\ns=[]\r\nfor i in range(n):\r\n\tp=input()\r\n\tfor i in range(len(p)):\r\n\t\tif p[i]=='G':\r\n\t\t\tx=i\r\n\t\telif p[i]=='S':\r\n\t\t\ty=i\r\n\ts.append([x,y])\r\nans=0\r\np=[]\r\nfor i in s:\r\n\tif i[0]>i[1]:\r\n\t\tprint(-1)\r\n\t\texit(0)\r\n\telif i[0]<i[1]:\r\n\t\tp.append(i[1]-i[0])\r\nt=0\r\np=set(p)\r\nprint(len(p)) \r\n\t", "N = 1000\r\ndis = set([])\r\nn, m = map(int, input().split(' '))\r\nf = False\r\nfor i in range(n):\r\n s = input()\r\n dist = s.index('S') - s.index('G')\r\n #print(dist)\r\n if dist < 0:\r\n f = True\r\n break\r\n if dist not in dis:\r\n dis.add(dist)\r\nif f:\r\n print(-1)\r\nelse:\r\n print(len(dis))\r\n", "'''\r\n# Submitted By M7moud Ala3rj\r\nDon't Copy This Code, CopyRight . [email protected] © 2022-2023 :)\r\n'''\r\n# Problem Name = \"Inna and New Matrix of Candies\"\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\ndef Solve():\r\n n, m = list(map(int, input().split()))\r\n all_ = set()\r\n e = False\r\n for _ in range(n):\r\n x = input().strip()\r\n v = x.find(\"S\") - x.find(\"G\")\r\n all_.add(v)\r\n if v < 0:\r\n e = True\r\n \r\n if e:\r\n print(-1)\r\n return\r\n \r\n print(len(all_))\r\n \r\n\r\nif __name__ == \"__main__\":\r\n Solve()", "row_count, column_count = map(int, input().split())\r\nmatrix = [input() for _ in range(row_count)]\r\nprint(-1) if any([r.find(\"G\") > r.find(\"S\") for r in matrix]) else print(\r\n len(set([rr.find(\"S\") - rr.find(\"G\") for rr in matrix])))", "from sys import stdin, stdout\r\ndef main():\r\n n, m = map(int, stdin.readline().split())\r\n\r\n s = set()\r\n\r\n for _ in range(n):\r\n l = stdin.readline().strip()\r\n \r\n dwarf = -1\r\n candy = -1\r\n \r\n for i in range(m):\r\n if l[i] == \"G\":\r\n dwarf = i\r\n if l[i] == \"S\":\r\n candy = i\r\n \r\n if candy < dwarf:\r\n print(-1)\r\n return\r\n \r\n s.add(candy-dwarf)\r\n print(len(s))\r\n return\r\nmain()\r\n \r\n\r\n", "# Author: SaykaT\r\n# Problem: 400B\r\n# Time Created: September 07(Monday) 2020 || 10:29:57\r\n\r\n#>-------------------------<#\r\n\r\n#>-------------------------<#\r\n\r\n\r\n# Helper Functions. -> Don't cluster your code.\r\ndef get_dis(row):\r\n dwarf = row.index('G')\r\n candy = row.index('S')\r\n\r\n if dwarf > candy:\r\n return False\r\n return True\r\n\r\n# Main functions. -> Write the main solution here\r\ndef solve():\r\n n, m = map(int, input().split())\r\n field = []\r\n ans = True\r\n\r\n for _ in range(n):\r\n tmp = (input())\r\n dwarf = tmp.index('G')\r\n candy = tmp.index('S')\r\n\r\n if dwarf > candy:\r\n ans = False\r\n\r\n if (candy - dwarf) not in field:\r\n field.append(candy - dwarf)\r\n\r\n if ans:\r\n print(len(field))\r\n else:\r\n print(-1)\r\n\r\n# Single test cases\r\nsolve()\r\n\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn, m = map(int, input().split())\r\nd = set()\r\nfor _ in range(n):\r\n s = input()[:-1]\r\n a = s.index('G')\r\n b = s.index('S')\r\n if a > b:\r\n print(-1)\r\n break\r\n else:\r\n d.add(b-a)\r\nelse:\r\n print(len(d))", "import sys\nn,m = map(int, input().split())\ndists = set()\nfor i in range(n):\n row = input()\n ok = False\n for j,c in enumerate(row):\n if ok:\n i+=1\n if c == \"G\":\n i = 0\n ok = True\n elif c == \"S\":\n if not ok:\n print(-1)\n sys.exit()\n dists.add(i)\n\n\nprint(len(dists))\n\n", "distance=lambda x: (x.find('S')-x.find('G'))\r\ndef main():\r\n n,m=map(int,input().split())\r\n s={distance(input()) for i in range(n)}\r\n if min(s)<0: print(-1)\r\n else: print(len(s))\r\nmain()", "n, m = map(int, input().split())\r\n\r\nturns = {}\r\n\r\nimpossible = False\r\n\r\nwhile n:\r\n\r\n line = list(input())\r\n\r\n p = line.index('S') - line.index('G')\r\n\r\n if p < 0:\r\n impossible = True\r\n\r\n if not impossible:\r\n if p not in turns:\r\n turns[p] = 1\r\n else:\r\n turns[p] += 1\r\n\r\n n -= 1\r\n\r\n\r\nif not impossible:\r\n print(len(turns))\r\nelse:\r\n print(-1)", "n, m = map(int, input().split())\r\nres = 0\r\nresult = []\r\nS_num = 0\r\nG_num = 0\r\nt = True\r\nfor i in range (n):\r\n Str = input()\r\n for j in range (m):\r\n if (Str[j] == 'G'):\r\n G_num = j\r\n elif(Str[j] == 'S'):\r\n S_num = j\r\n if (S_num - G_num - 1 not in result):\r\n result.append(S_num - G_num - 1)\r\n res += 1\r\n if (G_num > S_num ):\r\n print (-1)\r\n t = False\r\n break\r\n\r\nif (t == True):\r\n print (res)\r\n \r\n", "from sys import stdin,stdout\r\nfrom collections import defaultdict\r\ninput=stdin.readline\r\n#print=stdout.write\r\nfrom random import randint\r\nimport math\r\nimport sys \r\n#sys.setrecursionlimit(10**6)\r\n###-----------Code Begins----------##\r\n \r\nn,m = map(int,input().split())\r\n\r\nanswers = {}\r\nyo = True\r\n\r\nfor _ in range(n):\r\n line = input().strip()\r\n if(line.find(\"G\")!=-1):\r\n i= m-1\r\n while(line[i]!=\"G\"):\r\n i-=1\r\n j=i\r\n while(j!=m and line[j]!=\"S\"):\r\n j+=1\r\n if(j==m):\r\n yo= False\r\n elif(j!=i):\r\n answers[j-i]= True\r\n\r\nif(yo):\r\n print(len(answers))\r\nelse:\r\n print(\"-1\")\r\n\r\n\r\n\r\n", "from sys import stdin\r\n\r\n\r\n\r\ndef main():\r\n count = 0\r\n bandera = 0\r\n l = []\r\n [n,m] = [int (x) for x in stdin.readline().split()]\r\n for cont in range(n):\r\n line = stdin.readline()\r\n g = line.index(\"G\")\r\n s = line.index(\"S\")\r\n if s<g:\r\n print(-1)\r\n bandera = 1\r\n break\r\n if s-g not in l:\r\n l.append(s-g)\r\n count += 1\r\n if bandera == 0:\r\n print(count)\r\n\r\n\r\n\r\nmain()", "\r\nn , m = map(int,input().split())\r\nst = set()\r\n\r\nfor i in range(n):\r\n s = input()\r\n st.add(s.find('S') - s.find('G'))\r\n\r\nprint(-1 if any(a < 0 for a in st) else len(st))\r\n\r\n\r\n", "n, m = list(map(int, input().split()))\r\npossible = True\r\ndistance = set()\r\nfor _ in range(n):\r\n row = input()\r\n dwarf = -1\r\n candy = -1\r\n for i in range(m):\r\n if row[i] == 'G':\r\n dwarf = i\r\n elif row[i] == 'S':\r\n candy = i\r\n if candy < dwarf:\r\n possible = False\r\n else:\r\n distance.add(candy - dwarf)\r\n\r\nprint(-1 if not possible else len(distance))", "# 3 4\r\n# *G*S\r\n# G**S\r\n# *G*S\r\nn,m=map(int,input().split())\r\nans = 0\r\nS=set()\r\nfor _ in range(n):\r\n s=input()\r\n v=s.index('S') - s.index('G')\r\n if v<0:\r\n print(-1)\r\n exit(0)\r\n S.add(v)\r\nprint(len(S))", "h, w = map(int, input().split())\r\n\r\nans = set()\r\ngood = True\r\nfor i in range(h):\r\n s = input()\r\n pg = -1\r\n ps = -1\r\n for j in range(w):\r\n if s[j] == 'G':\r\n pg = j\r\n elif s[j] == 'S':\r\n ps = j\r\n if ps < pg:\r\n good = False\r\n ans.add(ps - pg)\r\n \r\nif not good:\r\n print(-1)\r\nelse:\r\n print(len(ans))\r\n", "n, m = map(int, input().split())\r\nc = 0\r\ng = 0\r\nt = set()\r\nf = False\r\nfor i in range(n):\r\n s = input().strip()\r\n for j in range(len(s)):\r\n if s[j] == 'G':\r\n g = j\r\n elif s[j] == 'S':\r\n c = j\r\n if g - c > 0:\r\n print(-1)\r\n f = True\r\n break\r\n t.add(c - g)\r\nif not f:\r\n print(len(t))" ]

[ "#! /usr/bin/env python\n\nn = int(input())\ncounts = [0] * 5\nnums = [int(x) for x in input().split()]\nfor x in nums:\n counts[x] += 1\n\ns = sum(nums)\nif s > 2 and s != 5:\n ans = 0\n if counts[1] >= counts[2]:\n ans += counts[2]\n counts[3] += counts[2]\n counts[1] -= counts[2]\n ans += 2 * (counts[1] // 3)\n counts[3] += counts[1] // 3\n counts[1] %= 3\n if counts[3] > 0:\n ans += counts[1]\n elif counts[1] != 0:\n ans += 2\n else:\n ans += counts[1]\n counts[2] -= counts[1]\n ans += 2 * (counts[2] // 3)\n counts[2] %= 3\n if counts[4] > 0:\n ans += counts[2]\n elif counts[2] != 0:\n ans += 2\n print(ans)\nelse:\n print(-1)\n\n\n\n\n# Made By Mostafa_Khaled" ]

[ "a,b,w,x,c = map(int,input().split())\npoc = 0\ns = set()\ns.add(b)\npa,pb,pc = a,b,c\nwhile (c > a) :\n\tc -= 1\n\tif b >= x:\n\t\tb = b-x\n\telse:\n\t\ta -= 1\n\t\tb = w - (x-b)\n\tif b in s:\n\t\tkolko = len(s)\n\t\tbreak\n\ts.add(b)\ndl = len(s)\nkolko = max(pa-a,1)\nif dl == kolko:\n\tprint(0)\nelse:\n\troz = (pc-pa)//(dl-kolko) - 1\n\tpoc = roz*dl\n\tc = pc - poc\n\ta = pa - roz*kolko\n\tb = pb\n\t#a,b,c,poc=pa,pb,pc,0\n\t#print(a,b,w,x,c)\n\twhile (c > a) :\n\t\tc -= 1\n\t\tif b >= x:\n\t\t\tb = b-x\n\t\telse:\n\t\t\ta -= 1\n\t\t\tb = w - (x-b)\n\t\tpoc+=1\n\t\t#print(a,b,w,x,c)\n\tprint(poc)\n", "a,b,w,x,c=map(int,input().split())\r\nans=0\r\nbb=b\r\nbenefit=0\r\nVisited=[False]*1003\r\nCycleCost=-1\r\nwhile(1):\r\n if(c<=a):\r\n break\r\n if(Visited[b]!=False):\r\n CycleCost=ans-Visited[b][1]\r\n CycleBenefit=benefit-Visited[b][0]\r\n CycleBegining=b\r\n break\r\n Visited[b]=(benefit,ans)\r\n if(b<x):\r\n b=w-(x-b)\r\n ans+=1\r\n elif(b>=x):\r\n b-=x\r\n ans+=1\r\n benefit+=1\r\n if(benefit==c-a):\r\n break\r\n\r\nif(CycleCost==-1):\r\n print(ans)\r\nelse:\r\n c-=benefit\r\n diff=c-a\r\n xx=diff//CycleBenefit\r\n if(xx!=0):\r\n xx-=1\r\n ans+=xx*CycleCost\r\n diff-=xx*CycleBenefit\r\n b=CycleBegining\r\n while(diff>0):\r\n if(b<x):\r\n b=w-(x-b)\r\n ans+=1\r\n else:\r\n b-=x\r\n ans+=1\r\n diff-=1\r\n print(ans)\r\n \r\n", "a, b, w, x, c = map(int, input().split())\r\nif c <= a:\r\n print(0)\r\n exit()\r\nl, r = 0, (c - a) * int(1e4)\r\nwhile l + 1 < r:\r\n m = (l + r) // 2\r\n if c - m <= a - (w - b - 1 + m * x) // w: \r\n r = m\r\n else: \r\n l = m\r\nprint(r)\r\n", "a, b, w, x, c = map(int, input().split())\r\n\r\ndef result(a, b, w, x, c, s):\r\n\tna = a - (s * x - b) / w\r\n\tnc = c - s\r\n\treturn (na, nc)\r\n\r\ndef solve(a, b, w, x, c):\r\n\tleft = 0\r\n\tright = 10e15\r\n\tif (c <= a):\r\n\t\treturn 0\r\n\r\n\twhile (left < right):\r\n\t\thalf = (left+right) // 2\r\n\t\tret = result(a, b, w, x, c, half)\r\n\t\tif (ret[1] <= ret[0]):\r\n\t\t\tright = half\r\n\t\telse:\r\n\t\t\tleft = half + 1\r\n\r\n\treturn left\r\n\r\nprint(int(solve(a, b, w, x, c)))", "__author__ = 'asmn'\r\na, b, w, x, c = tuple(map(int, input().split()))\r\n\r\nif c <= a:\r\n print(0)\r\n exit()\r\nl, r = 0, (c - a) * 10000\r\nwhile l + 1 < r:\r\n m = (l + r) // 2\r\n\r\n if c - m <= a - (w - b - 1 + m * x) // w:\r\n r = m\r\n else:\r\n l = m\r\nprint(r)", "import sys\n\ndef solve():\n a, b, w, x, c = map(int, input().split())\n w -= x\n small, large = 0, int(1e20)\n while small < large:\n avg = (small + large) // 2\n if works(avg, a, b, c, w, x): large = avg\n else: small = avg + 1\n return small\n\ndef works(val, a, b, c, w, x):\n cres = c - val\n amin = cres\n maxsubtract = a - amin\n if maxsubtract < 0: return False\n bsubtract = val - maxsubtract\n bres = b + maxsubtract * w - x * bsubtract\n return bres >= 0\n \nif sys.hexversion == 50594544 : sys.stdin = open(\"test.txt\")\nprint(solve())" ]

[ "n,k=map(int,input().strip().split())\r\na=list(map(int,input().strip().split()))\r\nb=list(map(int,input().strip().split()))\r\nups = [[i+1 for i in range(n)]]\r\ndowns = [[i+1 for i in range(n)]]\r\n\r\ndef apply(arr):\r\n out = [0]*n\r\n for i in range(n):\r\n out[i] = arr[a[i]-1]\r\n return out\r\n\r\ndef unapply(arr):\r\n out = [0]*n\r\n for i in range(n):\r\n out[a[i]-1] = arr[i]\r\n return out\r\n\r\nfor i in range(k):\r\n ups.append(apply(ups[i]))\r\nfor i in range(k):\r\n downs.append(unapply(downs[i]))\r\n\r\nearliest = [None, None]\r\nearliestPossible = [None, None]\r\nfor i in range(k,-1,-1):\r\n if ups[i] == b:\r\n earliest[0] = i\r\n if downs[i] == b:\r\n earliest[1] = i\r\n # print(\"YES\")\r\n # exit(0)\r\nfor i in range(k,-1,-2):\r\n if ups[i] == b:\r\n earliestPossible[0] = i\r\n if downs[i] == b:\r\n earliestPossible[1] = i\r\nif (not earliestPossible[0]) and (not earliestPossible[1]):\r\n print(\"NO\")\r\n exit(0)\r\nif ((not earliestPossible[0]) or earliest[0] < earliestPossible[0]) and ((not earliestPossible[1]) or earliest[1] < earliestPossible[1]):\r\n print(\"NO\")\r\n exit(0)\r\nif ups[0] == b or (ups[1] == b and downs[1] == b and k > 1):\r\n print(\"NO\")\r\n exit(0)\r\nprint(\"YES\")\r\n\r\n\r\n\r\n# tem = [i+1 for i in range(n)]\r\n# for i in range(k):\r\n# tem = apply(tem)\r\n# for i in range(k):\r\n# tem = unapply(tem)\r\n# print(tem)", "import sys\r\nfrom math import *\r\n\r\ndef minp():\r\n\treturn sys.stdin.readline().strip()\r\n\r\ndef mint():\r\n\treturn int(minp())\r\n\r\ndef mints():\r\n\treturn map(int, minp().split())\r\n\r\nn, k = mints()\r\nq = list(mints())\r\nfor i in range(n):\r\n\tq[i] -= 1\r\ns = list(mints())\r\na = [i for i in range(1,n+1)]\r\nd = [0]*n\r\nb = [False]*(k+1)\r\nc = [False]*(k+1)\r\ne = [10000]*2\r\nf = [10000]*2\r\nfor i in range(k+1):\r\n\t#print(a)\r\n\tb[i] = (a == s)\r\n\tif b[i]:\r\n\t\te[i%2] = min(e[i%2], i)\r\n\tfor j in range(n):\r\n\t\td[j] = a[q[j]]\r\n\ta,d = d,a\r\n#print('====')\r\na = [i for i in range(1,n+1)]\r\nfor i in range(k+1):\r\n\t#print(a)\r\n\tc[i] = (a == s)\r\n\tif c[i]:\r\n\t\tf[i%2] = min(f[i%2], i)\r\n\tfor j in range(n):\r\n\t\td[q[j]] = a[j]\r\n\ta,d = d,a\r\n#print('====')\r\n#print(e)\r\n#print(f)\r\nif e[0] == 0:\r\n\tprint('NO')\r\nelif e[1] == 1:\r\n\tif f[1] == 1 and k > 1:\r\n\t\tprint('NO')\r\n\telif k%2 == 1 or f[k%2] <= k:\r\n\t\tprint('YES')\r\n\telse:\r\n\t\tprint('NO')\r\nelif f[1] == 1:\r\n\tif k%2 == 1 or e[k%2] <= k:\r\n\t\tprint('YES')\r\n\telse:\r\n\t\tprint('NO')\r\nelse:\r\n\tif e[k%2] <= k or f[k%2] <= k:\r\n\t\tprint('YES')\r\n\telse:\r\n\t\tprint('NO')\r\n" ]

[ "n = int(input())\r\ns = input()\r\nse = set({})\r\nfor x in s:\r\n se.add(x)\r\nif n <= 26:\r\n print(n - len(se))\r\nelse:\r\n print(-1)\r\n", "n=int(input())\r\ns=input()\r\nif n>26:\r\n print(-1)\r\nelse:\r\n list1=[]\r\n list1[:0]=s\r\n c=list(set(list1))\r\n a=n-len(c)\r\n print(a)", "n = int(input())\r\ns = input()\r\nx = len(s)\r\nl = set(s)\r\ny = len(l)\r\nif n>26:\r\n print(-1)\r\nelse:\r\n print(x-y)", "n = int(input())\r\nif n>26:\r\n print(-1)\r\n exit(0)\r\ndata = input()\r\nprint(n-len(set(data)))", "n=int(input())\r\ns=input()\r\nprint (-1 if n>26 else n-len(set(s)))", "from collections import Counter\r\nn = int(input())\r\ns = input()\r\nif n > 26:\r\n print(-1)\r\nelse:\r\n num_unique = len(Counter(s))\r\n num_replace = n - num_unique\r\n\r\n print(num_replace)", "n = int(input())\r\ninput_string = input()\r\n\r\nmap = {}\r\n\r\nfor i in range(0, len(input_string)):\r\n if input_string[i] in map:\r\n map[input_string[i]]+=1\r\n else:\r\n map[input_string[i]] = 1\r\n\r\n\r\nsum = 0\r\n\r\nfor value in map.values():\r\n sum = sum + value\r\n\r\nif sum > 26:\r\n print(-1)\r\nelse:\r\n res = 0\r\n for value in map.values():\r\n res = res + value - 1\r\n print(res)\r\n", "n = int(input())\nl = [0 for i in range(0,26)]\ns=input()\nnb=0\nd=0\nfor e in 'abcdefghijklmnopqrstuvwxyz':\n t=s.count(e)\n if t > 1:\n nb+=t-1\n if t > 0:\n d+=1\n s=s.replace(e,'')\nif (26-d) < nb:\n print(-1)\nelse:\n print(nb)", "#!/usr/bin/env python\n# coding: utf-8\n\n# In[7]:\n\n\nfrom collections import defaultdict\nd=defaultdict(lambda:0)\nn=int(input())\ns=input()\ncount=0\nf=1\n\nfor i in s:\n\td[i]+=1\n\nfor i in range(n):\n\tif d[s[i]]>1:\n\t\tf=0\n\t\tfor j in range(97,123):\n\t\t\tif d[chr(j)]==0:\n\t\t\t\tcount+=1\n\t\t\t\td[chr(j)]=1\n\t\t\t\td[s[i]]-=1\n\t\t\t\tf=1\n\t\t\t\tbreak\n\n\n\t\tif f==0:\n\t\t\tbreak\n\nprint(-1 if f==0 else count)\n\n\n\n# In[ ]:\n\n\n\n\n", "x=int(input())\ny=input()\nl=[]\nrl=[]\nrrl=[]\nfor i in y:\n l.append(i)\nfor i in l:\n if not i in rrl:\n rl.append(l.count(i))\n rrl.append(i)\nif sum(rl)>26:\n print(-1)\nelse:\n print(sum(rl)-len(rl))\n", "n = int(input())\nf = [0]*26\ns = input()\nif(len(s) > 26):\n\tprint(-1)\nelse:\n\tfor i in range(len(s)):\n\t\tf[ord(s[i])-ord('a')]+=1\n\tans = 0\n\tfor i in range(26):\n\t\tif(f[i] > 1):\n\t\t\tans += f[i]-1\n\tprint(ans)", "import sys\r\ninput = sys.stdin.readline\r\ndef prog():\r\n n = int(input())\r\n s = input().strip()\r\n if len(s) > 26:\r\n print(-1)\r\n else:\r\n a = set(s)\r\n print(len(s)-len(a))\r\nprog()\r\n", "n = int(input())\r\ns = input()\r\nif(n<=26):\r\n print(len(s)-len(set(list(s))))\r\nelse:\r\n print(-1)", "n = int(input())\r\ns = input()\r\nl = []\r\nfor i in s:\r\n l.append(i)\r\nk = list(set(l))\r\nc = 0\r\nfor i in k:\r\n c += s.count(i)-1\r\nm = 26-len(k)\r\nif c>m:\r\n print(-1)\r\nelse:\r\n print(c)", "n=int(input())\r\ns=input()\r\nif(len(s)>26):\r\n print(-1)\r\nelse:\r\n print(n-len(set(s)))\r\n", "print(-1 if (n := int(input())) > 26 else n-len(set(input())))\n \t \t\t\t\t \t \t \t \t\t\t \t \t \t \t \t \t", "n=int(input())\r\nst=input()\r\np=set(st)\r\ncount=0\r\nif n>26:\r\n print(-1)\r\nelse:\r\n for i in p:\r\n x=st.count(i)\r\n count+=x-1\r\n print(count)", "f=lambda:map(int,input().split())\r\nn=int(input())\r\ns=input()\r\nprint(len(s)-len(set(s))if (len(s)-len(set(s)))<=26-len(set(s)) else -1)", "n = int(input())\r\ns = input()\r\nl = set(s)\r\ncount = 0\r\nif len(s) > 26:\r\n print(-1)\r\nelse:\r\n for i in l:\r\n if s.count(i) > 1:\r\n count+=(s.count(i)-1)\r\n\r\n print(count)", "\r\ndef minimum_changes(s):\r\n if len(s) > 26:\r\n return -1\r\n \r\n exist = [False] * 26\r\n for c in s:\r\n exist[ord(c) - ord('a')] = True\r\n \r\n unique = 0\r\n for i in range(26):\r\n if exist[i]:\r\n unique += 1\r\n \r\n return len(s) - unique\r\n \r\n\r\n#t = int(input())\r\nt = 1\r\nfor _ in range(t):\r\n n = int(input())\r\n s = input()\r\n \r\n #A = list(map(int,input().split()))\r\n print(minimum_changes(s))\r\n", "from collections import Counter\nn = int(input().strip())\ns = input().strip()\ndef solve(s):\n\tfreq = Counter(s)\n\tl = len(freq.keys())\n\tc = 0\n\tfor i in freq.values():\n\t\tif i > 1:\n\t\t\tl += i-1\n\t\t\tc += i-1\n\t\tif l > 26:\n\t\t\treturn -1\n\treturn c\nprint(solve(s))", "def run():\r\n\timport sys\r\n\tsys.stdin = open('/home/punit/Documents/Cpp Programs/input.txt', 'r')\r\n\tsys.stdout = open('/home/punit/Documents/Cpp Programs/output.txt', 'w') \r\n\tfrom math import ceil,sqrt,floor\r\n \r\n# run()\r\nn = int(input())\r\ns = input()\r\nif len(s)>26:\r\n\tprint(-1)\r\nelse:\r\n\tprint(n-len(set(s)))", "n = int(input())\r\nprint(-1 if n > 26 else n - len(set(input())))", "n=int(input())\r\ns=input()\r\nl1=[]\r\ncount=0\r\nfor c in s:\r\n if c in l1:\r\n count+=1\r\n else :\r\n l1.append(c)\r\nif count+len(l1)>26:\r\n print(\"-1\")\r\nelse :\r\n print(count)", "n=int(input())\r\ns=input()\r\nif n>26:\r\n print(-1)\r\nelse:\r\n has=[0]*26\r\n for i in range(n):\r\n has[ord(s[i])-ord('a')]+=1\r\n c=0\r\n con=0\r\n for i in range(26):\r\n if has[i]:\r\n c+=has[i]-1\r\n else:\r\n con+=1\r\n if(con>=c):\r\n print(c)\r\n else:\r\n print(-1)", "from collections import Counter\n\n\ndef solution672b():\n _ = input()\n s = input().strip()\n if len(s) > 26:\n print(-1)\n else:\n iterations = 0\n counter = Counter(s)\n for c in counter.values():\n iterations += c - 1\n\n print(iterations)\n\n\nif __name__ == '__main__':\n solution672b()\n", "import string\r\na=int(input())\r\nl=sorted(input())\r\nif a>26:\r\n print(-1)\r\nelse:\r\n print(a-len(set(l)))", "from sys import stdin, stdout\n\ndef test(n, s):\n dictionary = {}\n original = 'abcdefghijklmnopqrstuvwxyz'\n\n if n > 26:\n return -1\n\n repeated_chars = 0\n for char in s:\n if char in dictionary:\n repeated_chars += 1\n else:\n dictionary[char] = True\n return repeated_chars\n\nn = int(stdin.readline().rstrip(\"\\r\\n\"))\ns = stdin.readline().rstrip(\"\\r\\n\") \nresult = test(n,s) \nstdout.write(str(result))\n", "n = int(input())\r\ns = input()\r\ndi = {}\r\nfor let in 'abcdefghijklmnopqrstuvwxyz':\r\n di[let] = 0\r\ncount = 0\r\nfor i in range(n):\r\n di[s[i]]+=1\r\n if(di[s[i]]>1):\r\n count+=1\r\nif(n<= len('abcdefghijklmnopqrstuvwxyz')):\r\n print(count)\r\nelse:\r\n print(-1)", "n=int(input())\r\ns=str(input())\r\ncount=0\r\nif n>26:\r\n print(-1)\r\nelse:\r\n l=[0]*27\r\n for i in range(n):\r\n l[ord(s[i])-97]+=1\r\n if l[ord(s[i])-97]>1:\r\n count+=1\r\n #print(l)\r\n print(count)", "#672B (70No. Problem B)\r\nn = int(input())\r\ns = input()\r\nt = 0\r\nif (n > 26):\r\n print(-1)\r\nelse: \r\n uni = list(set(s))\r\n ans = len(s) - len(uni)\r\n print(ans) \r\n", "n = int(input())\r\ns = set(input())\r\n\r\nt = n - len(s)\r\nif t > 26 - len(s):\r\n print(-1)\r\nelse:\r\n print(t)", "a = int(input())\r\nb = set(list(input()))\r\nif a>26:print(-1)\r\nelse:print(a-len(b))", "n = int(input())\r\ns = input()\r\n\r\nif len(s) > 26:\r\n print(-1)\r\nelse:\r\n print(n - len(set(c for c in s)))", "n=int(input())\r\ns=input()\r\na=len(set(s))\r\nk=26-a\r\nj=n-a\r\nif k<j:\r\n print(-1)\r\nelse:\r\n print(j)", "n = int(input())\r\ns = input()\r\nif n > 26:\r\n\tprint(-1)\r\nelse:\r\n\tss = set(s)\r\n\tprint(abs(len(ss) - len(s)))\r\n\r\n", "n=int(input())\r\ns=input()\r\nd={}\r\nfor i in s:\r\n if i in d:\r\n d[i]+=1\r\n else:\r\n d[i]=1\r\ncount=0\r\nfor i in d:\r\n if d[i]>=2:\r\n count+=d[i]-1\r\nif n>26:\r\n print(-1)\r\nelse:\r\n print(count)", "import bisect\r\nfrom collections import Counter,defaultdict\r\nI =lambda:int(input())\r\nM =lambda:map(int,input().split())\r\nLI=lambda:list(map(int,input().split()))\r\nn=I()\r\ns=input()\r\nd=Counter(s)\r\nif n<=26:\r\n print(n-len(d))\r\nelse:\r\n print(-1)", "# import sys\r\n# sys.stdin=open(\"input.in\",\"r\")\r\nn=int(input())\r\ns=len(set(input()))\r\nif n<27:\r\n\tprint(n-s)\r\nelse:\r\n\tprint(\"-1\")", "n=int(input())\r\ns=input()\r\ns1=list(s)\r\np=len(list(set(s)))\r\nif n>26:\r\n print(-1)\r\nelse:\r\n print(n-p)\r\n", "num = int(input())\r\narr = list(input())\r\n\r\nif num > 26:\r\n print(-1)\r\nelse:\r\n print(num - len(set(arr)))\r\n\r\n\r\n\r\n", "n=int(input())\r\ns=str(input())\r\nl=len(s)\r\nif l>26:\r\n print(-1)\r\nelse:\r\n a=[]\r\n for i in s:\r\n a.append(i)\r\n u=len(set(a))\r\n print(l-u)", "a=int(input());b=input();c=len(set(b));print(a-c if a<=26 else -1 )", "n=int(input())\r\ns=str(input())\r\nd=dict()\r\nif n>26:\r\n print(-1)\r\nif n<=26:\r\n for i in s: \r\n if d.get(i)!=None:\r\n d[i]=d[i]+1\r\n if d.get(i)==None:\r\n d[i]=1\r\n count=0\r\n for i in d.keys():\r\n count=count+(d[i]-1)\r\n if count>=0: \r\n print(count) \r\n \r\n \r\n\r\n \r\n \r\n \r\n\r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n", "length = int(input())\r\nstring_list = [i for i in input()]\r\n \r\ndef string_change(string_list):\r\n if len(string_list) > 26:\r\n print(-1)\r\n else:\r\n uniques = list(set(string_list))\r\n counts = [string_list.count(i) for i in uniques]\r\n print(sum(counts) - len(counts))\r\n \r\n\r\nstring_change(string_list)", "n = int(input())\ns = input()\nif n>26:\n print(-1)\nelse:\n dist = len(set(list(s)))\n print(n-dist)\n\t \t\t \t\t\t \t\t\t \t\t \t \t", "gg = int(input())\nkata = list(input())\nhuruf = set(kata)\njumlah = [kata.count(i) for i in huruf if kata.count(i) > 1]\njumlah = sum(jumlah) - len(jumlah)\n\nif jumlah > (26-len(huruf)):\n jumlah = -1\n \nprint(jumlah)", "\r\nnum_inp=lambda: int(input())\r\narr_inp=lambda: list(map(int,input().split()))\r\nsp_inp=lambda: map(int,input().split())\r\nn=int(input())\r\nprint(n-len(set(input())) if n<27 else -1)", "t=int(input())\r\na=input()\r\nf=list(set(a))\r\nif len(a)<27:\r\n print(len(a)-len(f))\r\nelse:\r\n print(-1)", "n = int(input())\r\ns = len(set(input()))\r\n\r\nprint('-1' if n>26 else n-s)\r\n", "n = int(input())\r\ns = input()\r\nif n>26:print(-1)\r\nelse:print(n-len(set(s)))", "t=int(input())\r\ns=input()\r\nx=set(s)\r\nif(t>26):\r\n\tprint(\"-1\")\r\nelse:\r\n\tprint(t-len(x))", "\r\nn = int(input())\r\n\r\ns = input()\r\n\r\nfreq = {}\r\n\r\ncount = 0\r\n\r\nfor c in s:\r\n\r\n if c in freq.keys():\r\n freq[c] += 1\r\n count+=1\r\n else:\r\n freq[c] = 1\r\n\r\nif count >= 26:\r\n print(-1)\r\n\r\nelse:\r\n\r\n if (26 - len(list(freq.keys()))) >= count:\r\n print(count)\r\n\r\n else:\r\n print(-1)", "n = int(input())\r\ns = input()\r\n\r\nif n > 26:\r\n print(-1)\r\nelse:\r\n d = {}\r\n for c in s:\r\n if c not in d:\r\n d[c] = 0\r\n d[c] += 1\r\n\r\n sol = 0\r\n for c in d:\r\n sol += max(0, d[c]-1)\r\n print(sol)\r\n ", "t=int(input())\np=input()\nq=set(p)\nif(len(p)>26):\n print(-1)\nelse:\n print(t-len(q))\n", "\r\nn = int(input())\r\ns = input()\r\nprint(len(s) - len(set(s)) if n < 27 else -1)\r\n\r\n# CodeForcesian\r\n# ♥\r\n# man ke . . .\r\n# همون روزه سکوت", "n=int(input())\r\ns=input()\r\nif n>26:\r\n print(-1)\r\nelse:\r\n lst=[]\r\n for i in s:\r\n if i not in lst:\r\n lst.append(i)\r\n print(n-len(lst))", "n = int(input())\r\nl = input()\r\np = set(l)\r\nsum = 0\r\nnot_equal = 0\r\nequal = 0\r\nif n > 26:\r\n print(-1)\r\nelse:\r\n if len(p) == len(l):\r\n print(0)\r\n else:\r\n d = {'a': 0, 'b': 0, 'c': 0, 'd': 0, 'e': 0, 'f': 0, 'g': 0, 'h': 0, 'i': 0, 'j': 0, 'k': 0, 'l': 0, 'm': 0, 'n': 0,\r\n 'o': 0, 'p': 0, 'q': 0, 'r': 0, 's': 0, 't': 0, 'u': 0, 'v': 0, 'w': 0, 'x': 0, 'y': 0, 'z': 0}\r\n for num in p:\r\n d[num] = l.count(num)\r\n sum += l.count(num)\r\n equal += 1\r\n for n in d:\r\n if d[n] == 0:\r\n not_equal += 1\r\n if not_equal - sum < (26):\r\n print(sum - equal)\r\n else:\r\n print(-1)", "n=int(input())\r\ns=input()\r\ncount=0\r\nz=[0]*26\r\ndis=0\r\nfor i in range(n):\r\n z[ord(s[i])-97]+=1\r\nfor i in range(26):\r\n if(z[i]>1):\r\n count+=z[i]-1\r\n if(z[i]>0):\r\n dis+=1\r\nif(count>26-dis):\r\n print(-1)\r\nelse:\r\n print(count)", "input();a=list(input())\r\nprint(-1 if len(a)>26 else len(a)-len(set(a)))", "n = int(input())\r\ns = input()\r\nans = n - len(set(s))\r\nif n < 27:\r\n print(ans)\r\nelse:\r\n print(-1)", "n = int(input())\r\ndata = input()\r\nprint(n - len(set(data)) if n <= 26 else -1)", "n=int(input())\r\ns=str(input())\r\ns=s.lower()\r\ntmp=0\r\nls=[]\r\nfor i in s:\r\n if i not in ls:\r\n tmp+=1\r\n ls.append(i)\r\nif n>26:\r\n print(-1)\r\nelse:\r\n print(n-tmp)", "import sys\r\n\r\ndef take_input():\r\n return sys.stdin.readline().strip()\r\n\r\ndef main():\r\n\r\n n = int(take_input())\r\n s = take_input()\r\n\r\n ss = set(s)\r\n\r\n k = 26 - len(ss)\r\n j = n - len(ss)\r\n\r\n if k < j:\r\n print(\"-1\")\r\n else:\r\n print(j)\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n=int(input())\ns=input()\na=[]\nfor i in s:\n a.append(i)\na=list(set(a))\n\nk=26-len(a)\n\nrj=n-len(a)\nif k<rj:\n print(-1)\n\nelse:\n print(rj)\n\n \t \t\t\t \t \t \t\t \t \t \t\t\t \t", "n = int(input())\r\nstroke = input()\r\n\r\n\r\nif n > 26:\r\n print(-1)\r\nelse:\r\n a = set(list(stroke))\r\n print( n - len(a) )", "n=int(input())\nprint(-1 if n>26 else n-len(set(input())))\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\ncount = [0] * 26\r\nfor x in s:\r\n\tcount[ord(x) - ord('a')]+=1\r\nans = 0\r\nava = 0\r\nfor x in count:\r\n\tif x > 0:\r\n\t\tava += 1\r\n\t\tans += x - 1\r\nif 26 - ava < ans:\r\n\tprint(-1)\r\nelse:\r\n\tprint(ans)", "n,l=int(input()),len(set(input()))\r\nprint([n-l,-1][n>26])", "n = int(input())\ns = input()\nd = {}\nif n > 26:\n\tans = -1\nelse:\n\tfor i in s:\n\t\tif i in d:\n\t\t\td[i]+=1\n\t\telse:\n\t\t\td[i] = 1\n\tans = 0\n\tfor key in d.keys():\n\t\tif d[key] > 1:\n\t\t\tans += d[key]-1\nprint(ans)\n \t\t\t \t\t\t \t \t\t \t\t \t\t \t \t\t", "n = int(input())\ns = input()\nif n > ord('z')-ord('a')+1:\n print(-1)\nelse:\n print(n-len(set(s)))\n", "n = int(input())\r\nstring = input()\r\nt = []\r\nk = 0\r\nif n > 26:\r\n\tprint(-1)\r\nelse:\r\n\tfor i in range(n):\r\n\t\tif string[i] in t:\r\n\t\t\tk = k + 1\r\n\t\telse:\r\n\t\t\tt.append(string[i])\r\n\tprint(k)", "n=int(input())\r\ns=input()\r\nx=set(s)\r\nif n>26:\r\n\tprint(-1)\r\nelse:\r\n\tprint(n-len(x))", "from collections import defaultdict\r\nimport math\r\nn=int(input())\r\n# for _ in range(t):\r\na=input()\r\nif(n>26):\r\n print(\"-1\")\r\nelse:\r\n c=defaultdict(lambda:0)\r\n for i in a:\r\n c[i]+=1\r\n print(n-len(c.keys()))\r\n\r\n\r\n \r\n\r\n", "d = int(input())\r\na = input()\r\nif d>26:\r\n print('-1')\r\nelse:\r\n print(d-len(set(a)))\r\n", "l = int(input())\r\ns = input()\r\nuniqueS = ''\r\nfor ch in s:\r\n if uniqueS.find(ch) == -1:\r\n uniqueS += ch\r\nif l > 26:\r\n print(-1)\r\nelse:\r\n print(l-len(uniqueS))", "n = int(input())\ns = set(input())\nans = n - len(s)\n\nif n > 26:\n print(-1)\nelse:\n print(ans)\n", "n=int(input())\r\ns=input()\r\nk=26-len(set(s))\r\nj=n-len(set(s))\r\nif k<j:\r\n print(-1)\r\nelse:\r\n print(j)", "n=int(input())\r\ns=input()\r\ns1=set(s)\r\nif(n<27):\r\n print(len(s)-len(s1))\r\nelse:\r\n print(-1)", "n=int(input())\r\ns=input()\r\nd=dict()\r\nfor letter in s:\r\n d[letter]=d.get(letter,-1)+1\r\nl=len(d)\r\nk=0\r\ndv=d.values()\r\nfor i in dv:\r\n k+=i\r\nif k+l>26:\r\n print(-1)\r\nelse:\r\n print(k)\r\n", "#! python3\r\n\r\nn =int(input())\r\n\r\nstr1 = input()\r\n\r\nchars = list(str1)\r\n\r\nif n > 26:\r\n\tprint(-1)\r\nelse:\r\n\tdict1 = {}\r\n\tfor i in chars:\r\n\t\tif dict1.get(i,0) == 0:\r\n\t\t\tdict1[i] = 1\r\n\t\telse:\r\n\t\t\tdict1[i] += 1\r\n\r\n\tans = 0\r\n\tfor i in dict1.values():\r\n\t\tans += i-1;\r\n\r\n\tprint(ans)", "n=input()\r\ns=input()\r\ns1=\"\"\r\nfor i in s:\r\n if i not in s1:\r\n s1+=i\r\n\r\n\r\ncnt=0\r\nfor j in s1:\r\n cnt=cnt+int(s.count(j))-1\r\nif cnt<=26-len(s1):\r\n print(cnt)\r\nelse:\r\n print(-1)", "n = int(input())\r\nl = input()\r\nl = set(l)\r\nprint(n-len(l) if n<27 else -1)", "# ===================================\r\n# (c) MidAndFeed aka ASilentVoice\r\n# ===================================\r\n# import math \r\n# import collections\r\n# import string\r\n# ===================================\r\nn = int(input())\r\ns = str(input())\r\nans = -1\r\nif n <= 26:\r\n ans = n - len(set(s))\r\nprint(ans)", "sze = int(input())\r\ns = input()\r\ntempset = set(s)\r\nif(sze < 27):\r\n print(sze - len(tempset))\r\nelse:\r\n print(-1)\r\n", "import sys\r\ninput = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\r\ninp = lambda: list(map(int, sys.stdin.readline().rstrip(\"\\r\\n\").split()))\r\nn=int(input())\r\ns=input()\r\nif n>26:\r\n print(-1)\r\nelse:\r\n ans=0\r\n c=[0]*26\r\n for i in s:\r\n k=ord(i)-ord(\"a\")\r\n if c[k]>=1:\r\n ans+=1\r\n c[k]+=1\r\n print(ans)\r\n ", "n=int(input())\r\ns1=input()\r\ns2=set(s1)\r\nif(len(s1)>26):\r\n print(-1)\r\nelse:\r\n print(len(s1)-len(s2))", "n=int(input())\r\ns=input()\r\nif n<=26:\r\n\tprint(n-len(set(s)))\r\nelse:\r\n\tprint(-1)", "n = int(input())\r\n\r\ns = set(list(input()))\r\n\r\nif n > 26:\r\n print(\"-1\")\r\nelse:\r\n print(n-len(s))\r\n", "n=int(input())\r\ns=input()\r\nif n>26:print(-1)\r\nelse: print(n-len(set(s)))", "n = int(input())\nprint([n-len(set(input())),-1][n>26])\n \t \t \t\t \t \t \t \t \t \t", "n = int(input())\nif n > 26:\n print(-1)\nelse:\n s = n - len(set(input()))\n print(s)\n", "# import sys \r\n# sys.stdin=open(\"input.in\",'r')\r\n# sys.stdout=open(\"out.out\",'w')\r\nn=int(input())\r\ns=input()\r\nif len(s)>26:\r\n\tprint(-1)\r\n\texit()\r\nl=set(s)\r\nprint(n-len(l))", "n=int(input())\r\ns=input()\r\nl=[]\r\nfor i in range(n):\r\n\tif(s[i] not in l):\r\n\t\tl.append(s[i])\r\nif(n-len(l)<=26-len(l)):\r\n\tprint(n-len(l))\r\nelse:\r\n\tprint(-1)", "n=int(input())\r\nans = len(set(input()))\r\nprint([n-ans,-1][n>26])\r\n", "n=int(input())\na=input()\n\narr=[0]*26\ncount=0\nfor i in range(n):\n p=ord(a[i])-ord('a')\n if(arr[p]>0):\n count=count+1\n else:\n arr[p]=1\n\nif((n>26)):\n print(-1)\nelse: \n print(count)\n \n\t\t\t \t\t\t\t\t \t\t\t \t\t\t \t \t\t \t", "n,s=int(input()),input()\r\nf=[0]*26\r\nc=d=0\r\nfor i in range(n) :\r\n f[ord(s[i])-ord('a')]+=1\r\nfor i in f :\r\n if i>0 :\r\n c=c+i-1\r\n elif i==0 :\r\n d+=1\r\nprint(\"-1\" if d<c else c)", "n = int(input())\r\ns = input()\r\nif n > 26:\r\n\tprint(-1)\r\nelse:\r\n\ta = [0] * 30\r\n\tfor x in s:\r\n\t\ta[ord(x) - 97] += 1\r\n\tans = 0\r\n\tfor x in a:\r\n\t\tif x:\r\n\t\t\tans += x - 1\r\n\tprint(ans)", "\r\nn = int(input())\r\nstr = str(input())\r\nfr = [0] * 26\r\nans = 0\r\nif len(str) > 26:\r\n ans = -1\r\nelse:\r\n for ch in str:\r\n fr[ord(ch) - ord('a')] += 1\r\n for i in fr:\r\n ans += max(1,i) - 1\r\nprint(ans)", "a = int(input())\nb = input().strip()\nif a > 26:\n print(-1)\nelse:\n print(a - len(set(b)))\n\t\t\t \t\t \t\t \t \t \t \t\t \t \t", "from collections import Counter\r\nn = int(input())\r\ns = input()\r\nc = Counter(s)\r\n\r\ndiff = n-len(c)\r\nif n > 26:\r\n print(-1)\r\nelse:\r\n print(diff)\r\n\r\n", "x=int(input())\r\ns=len(set(input()))\r\nif x<=26:\r\n print(x-s)\r\nelse: print(-1)", "n = int(input())\ns = str(input())\n\ndiff = \"\"\nfor i in s:\n\tif i not in diff:\n\t\tdiff += i\nm = n-len(diff)\nj = 26-len(diff)\nif m>j:\n\tprint(-1)\nelse:\n\tprint(m)\n\t\t \t\t\t\t \t\t \t \t \t \t \t\t \t\t", "n=int(input())\r\ns=input()\r\ncount=0\r\nc=[]\r\n\r\nif n>26:\r\n print(-1)\r\nelse: \r\n for i in s:\r\n if i in c:\r\n count+=1\r\n else:\r\n c.append(i)\r\n print(count) \r\n\r\n\r\n", "n = int(input())\r\ns= input()\r\ndif = []\r\n\r\nif n > 26:\r\n print(-1)\r\nelse:\r\n for i in s:\r\n dif.append(i)\r\n print(n-len(set(dif)))\r\n \r\n ", "n = int(input())\r\nStr = input()\r\noutput = 0\r\nfreq = [0] * 26\r\nif len(Str) > 26:\r\n\tprint(-1)\r\nelse:\r\n\tfor i in Str:\r\n\t\tif freq[ord(i) - 97] == 1:\r\n\t\t\toutput += 1\r\n\t\telse:\r\n\t\t\tfreq[ord(i) - 97] += 1\r\n\tprint(output)\r\n", "from collections import Counter\r\nn=int(input())\r\ns=input()\r\nl=list(s)\r\nif len(l)==len(list(set(l))):\r\n print(0)\r\nelif len(l)>26:\r\n print(-1)\r\nelse:\r\n print(len(l)-len(set(l)))\r\n", "from collections import Counter\r\n\r\ninput()\r\ns = input()\r\nif len(s) <= 26:\r\n cnt = Counter(s)\r\n res = 0\r\n for v in cnt.values():\r\n if v > 1:\r\n res += v - 1\r\n print(res)\r\nelse:\r\n print(-1)", "n = int(input())\nk = len(set(input()))\nprint(-1 if n > 26 else n - k)\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\nif(len(set(s)) == len(s)):\r\n print(0)\r\nelif len(s) > 26:\r\n print(-1)\r\nelse:\r\n print(len(s)-len(set(s)))\r\n", "n = int(input())\r\ns = input()\r\nx = set(sorted(s))\r\nx1 = len(x)\r\nif(n>26):\r\n print(-1)\r\nelse:\r\n print(abs(n-x1))", "n = int(input())\r\ns = input()\r\nif n > 26:\r\n print(-1)\r\n exit(0)\r\nk = set()\r\nfor i in s:\r\n k.add(i)\r\nprint(n - len(k))\r\n", "n = int(input())\r\nword = list(input())\r\nif n > 26:\r\n print(-1)\r\n exit(0)\r\nprint(n - len(set(word)))", "n = int(input())\r\nstr = input()\r\na = []\r\nif n > 26:\r\n print(-1)\r\nelse:\r\n for i in range(n):\r\n if str[i] not in a:\r\n a.append(str[i])\r\n print(n - len(a))", "n = int(input())\r\ns = input()\r\n\r\nst = set(s)\r\n\r\nif( n > 26 ):\r\n print(\"-1\")\r\nelse :\r\n print(n-len(st))\r\n", "n = int(input())\r\na = input()\r\nif n > 26:\r\n print(-1)\r\nelse:\r\n print(n-len(set(a)))", "n, s = int(input() ), input()\nif n > 26:\n print(-1)\n exit()\n\ncnt = [0] * 26\nfor v in s:\n cnt[ord(v) - ord('a') ] = 1\nprint(n - sum(cnt) )\n", "n = int(input())\r\nif n > 26:\r\n print(-1)\r\n exit()\r\ns = input()\r\nt = []\r\nfor i in range (26):\r\n t.append(0)\r\nfor l in s:\r\n t[ord(l)-ord('a')]+=1\r\nsum = 0\r\nfor l in t:\r\n if l>1:\r\n sum+=l-1\r\nprint(sum)", "def raznoobrazie(s):\r\n if len(s) > 26:\r\n return -1\r\n st = set()\r\n for i in range(len(s)):\r\n st.add(s[i])\r\n return len(s) - len(st)\r\n\r\n\r\nn = int(input())\r\nt = input()\r\nprint(raznoobrazie(t))\r\n", "def solve(n, s):\r\n if n > 26:\r\n return -1\r\n else:\r\n return n - len(set(list(s)))\r\n\r\n\r\nn = int(input())\r\ns = input()\r\nprint(solve(n, s))", "n=int(input())\r\ns=input()\r\nsa=[]\r\nd=0\r\nif n<=26:\r\n for i in range(n):\r\n if s[i] not in sa:\r\n sa.append(s[i])\r\n if s.count(s[i])>1:\r\n d+=s.count(s[i])-1\r\n print(d)\r\nelse:\r\n print(-1)\r\n", "bu = [0] * 300\r\n\r\nn = int( input() )\r\npalabra = input()\r\n\r\nfor i in range( len(palabra) ):\r\n bu[ ord(palabra[i]) - ord('a') ] += 1\r\n\r\ncont = 0\r\ntotal = 0\r\nfor i in range( ord('z') - ord('a') + 1 ):\r\n if bu[i] == 0:\r\n cont += 1\r\n elif bu[i] > 1:\r\n total += bu[i] - 1\r\n\r\nif total > cont:\r\n print( \"-1\" )\r\nelse:\r\n print(total)", "input()\r\ns = input()\r\nprint(-1 if len(s) > 26 else len(s) - len(set(s)))", "# https://codeforces.com/problemset/problem/672/B\r\nn = int(input())\r\ns = input()\r\n\r\nif len(s) > 26:\r\n print(-1)\r\nelse:\r\n count = dict()\r\n result = 0\r\n\r\n for c in s:\r\n if c not in count.keys():\r\n count.update({c: 1})\r\n else:\r\n count[c] += 1\r\n for key in count.keys():\r\n result += count[key] - 1\r\n\r\n print(result)\r\n", "n=int(input())\r\nk=len(set(input()))\r\nif n<=26:\r\n print(n-k)\r\nelse: print(-1)", "a=int(input())\r\nl=input()\r\nprint(-1 if a>26 else a-len(set(l)))", "n = int(input())\r\ns = list(input())\r\n\r\nf = set(s)\r\n\r\nif n > 26 :\r\n print('-1')\r\n exit(0)\r\n\r\nelse:\r\n print(n - len(f))\r\n\r\n\r\n\r\n", "x = int(input())\r\nstr1 = input()\r\nif x>26:\r\n\tprint(-1)\r\nelse:\r\n\tli = set(list(str1))\r\n\tprint(x- len(li))", "# B. Different is Good\r\nn=int(input())\r\ns=input()\r\nc=0\r\narr=[]\r\nfor i in s:\r\n arr.append(i) \r\narr.sort()\r\nch=26-len(set(arr))\r\np=\"\"\r\nfor i in arr:\r\n if i==p:\r\n if ch>0:\r\n c+=1\r\n ch-=1\r\n else:\r\n c=-1\r\n break\r\n else:\r\n p=i\r\nprint(c)", "n = int(input())\r\nprint(n - len(set(input())) if n < 27 else -1)", "n=int(input());\r\ns = input();\r\nset1=set(s);\r\nif n<27: \r\n print(n-len(set1));\r\nelse:\r\n print(\"-1\");", "n=int(input())\r\ns=input()\r\nif n>26:\r\n print(-1)\r\n exit()\r\nm=[]\r\nfor i in s:\r\n if i not in m:\r\n m.append(i)\r\nprint(n-len(m))", "n = int(input())\r\nS = set(list(input()))\r\nif (n) > 26:\r\n print(-1)\r\nelse:\r\n print(n - len(S))\r\n", "n = int(input())\r\ns = input()\r\nc = set()\r\nfor i in range(n): c.add(s[i])\r\nfoo = n-len(c)\r\nif foo <= 26 - len(c): print(foo)\r\nelse: print(-1)\r\n \r\n \r\n \r\n \r\n", "n = int(input())\r\ns = input()\r\nd = {}\r\nif n > 26:\r\n\tans = -1\r\nelse:\r\n\tfor i in s:\r\n\t\tif i in d:\r\n\t\t\td[i]+=1\r\n\t\telse:\r\n\t\t\td[i] = 1\r\n\tans = 0\r\n\tfor key in d.keys():\r\n\t\tif d[key] > 1:\r\n\t\t\tans += d[key]-1\r\nprint(ans)", "n, s = int(input()), input()\nres = -1 if n > 26 else n - len(set(s))\nprint(res)\n", "def solve():\r\n n = int(input())\r\n mystr = input()\r\n count = 0\r\n if len(mystr) > 26:\r\n print(-1)\r\n return\r\n for i in range(len(mystr)):\r\n if mystr[i] in mystr[:i]:\r\n continue\r\n if (mystr[i] in mystr[i + 1:]):\r\n count += mystr[i + 1:].count(mystr[i])\r\n\r\n print(count)\r\n\r\n\r\nsolve()\r\n", "n = int(input())\r\ns = input()\r\nm = 0;\r\nif n > 26:\r\n print(-1,end='')\r\nelse:\r\n myList = []\r\n for i in range(26):\r\n myList.append(0)\r\n for i in s:\r\n if(myList[ord(i)-ord('a')] == 0 ):\r\n myList[ord(i)-ord('a')] = 1;\r\n else:\r\n m += 1\r\n print(m)", "n=int(input())\r\ns=input()\r\nif n>26:\r\n print(-1)\r\nelse:\r\n x=set(s)\r\n # print(x)\r\n\r\n print(n-len(x))\r\n", "n = int(input())\narray = input()\nlen_array = len(array)\nresult = len_array - len(set(array))\n\nif len_array > 26:\n print(-1)\nelse:\n print(result)\n", "n,s=int(input()),input()\r\nif(n>26):\r\n print(\"-1\")\r\nelse:\r\n print(n-len(set(s)))", "if __name__ == '__main__':\n n = int(input())\n\n if n > 26:\n print(-1)\n else:\n print(n - len(set(input())))\n", "n=int(input())\r\ns=set(input())\r\nif(n>26):\r\n print (-1)\r\nelse:\r\n print(n-len(s))", "x=int(input())\r\nprint(x-len(set(input())) if x<27 else -1)", "from sys import stdin\r\n\r\ndictio = {'a':0, 'b':0, 'c':0, 'd':0, 'e':0, 'f':0, 'g':0, 'h':0, 'i':0, 'j':0, 'k':0, 'l':0, 'm':0, 'n':0, 'o':0, 'p':0, 'q':0, 'r':0, 's':0, 't':0, 'u':0, 'v':0, 'w':0, 'x':0, 'y':0, 'z':0}\r\nrecorr = ['a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i', 'j', 'k', 'l', 'm', 'n', 'o', 'p', 'q', 'r', 's', 't', 'u', 'v', 'w', 'x', 'y', 'z']\r\n\r\ndef solve(n,word):\r\n if n > 26:\r\n return -1\r\n ans = 0\r\n for i in range(n):\r\n dictio[word[i]] += 1\r\n for i in range(26):\r\n if dictio[recorr[i]] == 0:\r\n continue\r\n ans += dictio[recorr[i]] - 1\r\n return ans\r\n\r\n\r\ndef main():\r\n n = int (stdin.readline())\r\n w = stdin.readline()\r\n word = list(w)\r\n word.pop(len(word)-1)\r\n print (solve(n,word))\r\n\r\nmain()\r\n", "\"\"\"\nhttps://codeforces.com/problemset/problem/672/B\n\"\"\"\nn = int(input())\nchaine = input()\n\ndef calcule(chaine):\n dica = dict()\n for c in chaine:\n dica[c] = dica.get(c, 0) + 1\n compte = 0\n for v in dica.values():\n compte += v - 1\n return compte\n\n\nif len(chaine) > 26:\n print(-1)\nelse:\n print(calcule(chaine))\n", "# Problem Statement - https://codeforces.com/problemset/problem/672/B\r\n\r\nn = int(input())\r\ns = str(input())\r\n\r\nans = n - len(set(s))\r\n\r\nif(n < 27):\r\n print(ans)\r\nelse:\r\n print(-1)", "# 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 = int(input.readline())\r\n st = str(input.readline().rstrip('\\n'))\r\n dict = {}\r\n for x in st:\r\n if x in dict:\r\n dict[x] += 1\r\n else:\r\n dict[x] = 1\r\n num_of_lett = 0\r\n num_of_changes = 0\r\n for x in dict:\r\n num_of_lett += dict[x]\r\n if dict[x] > 1:\r\n num_of_changes += dict[x]-1\r\n\r\n if n > 26 or num_of_lett>26:\r\n output = -1\r\n else:\r\n output = num_of_changes\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", "n = int(input())\r\ns = input()\r\nl = []\r\ncount = 0\r\nfor i in range(0,n):\r\n if s[i] in l:\r\n count += 1\r\n else:\r\n l += [s[i]]\r\nif len(l) + count <= 26:\r\n print(count)\r\nelse:\r\n print(-1)", "n=int(input())\r\na=set(input())\r\nif n>26:\r\n print(-1)\r\nelse:\r\n print(n-len(a))", "x=int(input())\r\nstring=input()\r\nprint(-1 if len(string)>=27 else (len(string)-len(set(string))))", "class CodeforcesTask672BSolution:\n def __init__(self):\n self.result = ''\n self.n = 0\n self.word = ''\n\n def read_input(self):\n self.n = int(input())\n self.word = input()\n\n def process_task(self):\n if self.n > 26:\n self.result = \"-1\"\n else:\n self.result = str(self.n - len(set([ord(c) for c in self.word])))\n\n def get_result(self):\n return self.result\n\n\nif __name__ == \"__main__\":\n Solution = CodeforcesTask672BSolution()\n Solution.read_input()\n Solution.process_task()\n print(Solution.get_result())\n", "n=int(input())\r\ns=input()\r\ns=set(s)\r\nl=len(s)\r\n\r\nk=26-l\r\n\r\nreq=n-l\r\n\r\nif k<req:\r\n\r\n print(-1)\r\nelse:\r\n print(req)", "n = int(input())\ns = str(input())\na = n - len(list(set(s)))\nif len(s)>26:\n print(-1)\nelse:\n print(a)\n \t\t \t \t\t \t \t\t \t\t\t\t \t\t", "n=int(input());s=input();print(n-len(set(s)) if n<27 else -1)", "def main():\n n = int(input())\n s = input()\n\n if n > 26:\n print(-1)\n else:\n n_chars = len(list(dict.fromkeys([c for c in s])))\n print(n - n_chars)\n\n\nif __name__ == '__main__':\n main()\n", "n = int(input())\r\na = str(input())\r\nA = [str(i) for i in a]\r\nif n < 27:\r\n print(n - len(set(A)))\r\nelse:\r\n print(-1)", "n = int(input())\r\ns = input().lower()[:n]\r\nd = {}\r\nfor k in s:\r\n if k in d:\r\n d[k] += 1\r\n else:\r\n d[k] = 1\r\nif n > 26:\r\n print(-1)\r\nelse:\r\n diff = n - len(d)\r\n print(diff)", "n = int(input())\r\narr = input()\r\nif len(arr) > 26:\r\n print(-1)\r\n exit(0)\r\n\r\n\r\nd = set()\r\nres = 0\r\nfor a in arr:\r\n if a in d:\r\n res +=1\r\n else:\r\n d.add(a)\r\nprint(res)\r\n", "a = int(input())\r\nb = input()\r\nif a <= 26:\r\n col = 0\r\n mn = set(b)\r\n print(a - len(mn))\r\nelse:\r\n print(-1)\r\n", "\nInput=lambda:map(int,input().split())\n\nn = int(input())\ns = input()\nif n > 26:\n print(-1)\nelse:\n print(len(s) - len(set(s)))", "n=int(input())\r\na=input()\r\nif len(a)>26:\r\n print(-1)\r\nelse: \r\n print(n-len(set(a))) ", "n=int(input())\r\nprint(n-len(set(input())) if n<27 else -1)", "n = int(input())\r\nstr1 = input()\r\nstr2 = len(set(str1))\r\nif n > 26:\r\n print(-1)\r\nelse:\r\n print(n-str2)\r\n", "n = int(input())\na = input()\nb = [0] * 26\nif n > 26:\n check = False\nelse:\n check = True\n for i in range(n):\n b[ord(a[i])-97] = b[ord(a[i])-97] + 1\n count = 0\n for i in range(len(b)):\n if b[i] > 1:\n count = count + b[i] - 1\nif check is False:\n print('-1')\nelse:\n print(count)", "from collections import Counter\n\na = int(input())\nb = input()\nc = Counter(b)\nif a > 26:\n print(-1)\nelse:\n res = 0\n for i, j in c.items():\n res += j - 1\n print(res)\n", "n = int(input())\ns = input()\n\nif n > 26:\n print(-1)\nelse:\n a = [0] * 26\n\n for char in s:\n index = ord(char) - 97\n a[index] += 1\n\n ans = 0\n for i in range(26):\n if a[i] > 0:\n ans += a[i] - 1\n\n print(ans)", "x=int(input())\r\ns=[n for n in input()]\r\nl=0\r\nif x>26:\r\n\tprint(-1)\r\nelse:\r\n\tfor n in range(x):\r\n\t\tif s[n]!=0:\r\n\t\t\tfor k in range(n+1,x):\r\n\t\t\t\tif s[n]==s[k]:\r\n\t\t\t\t\ts[k]=0\r\n\tj=x-s.count(0)\r\n\tif s.count(0)<=26-j:\r\n\t\tprint(s.count(0))\r\n\telse:\r\n\t\tprint(-1)", "n = int(input())\r\nst = input()\r\nst1 = set(st)\r\nif n<27:\r\n print(n-len(st1))\r\nelse:\r\n print(-1)\r\n", "a = input()\r\nb = input()\r\nif len(b) > 26:\r\n print(-1)\r\nelse:\r\n print(len(b) - len(set(b)))", "n=int(input())\r\ns=input()\r\nletters=[x for x in s]\r\nletter=set(letters)\r\nif n>26:\r\n print(-1)\r\nelse:\r\n print(n-len(letter))\r\n", "n = int(input())\r\ninp = input()\r\n\r\nif (n > 26):\r\n print(-1)\r\nelse:\r\n print(n - len(set(inp)))", "n = int(input())\r\np = input()\r\nl = []\r\nfor i in p:\r\n l.append(i)\r\ns=list(set(l))\r\nc = 0\r\nfor i in s:\r\n c += p.count(i)-1\r\nif c>(26-len(s)):\r\n print(-1)\r\nelse:\r\n print(c)", "n=int(input())\r\ns=len(set(input()))\r\nif n<27:\r\n\tprint(n-s)\r\nelse:\r\n\tprint(\"-1\")", "no=int(input())\r\nls=input()\r\nif(no>26):\r\n print(\"-1\")\r\n exit()\r\nst=set(ls)\r\nn=len(ls)-len(set(ls))\r\nprint(n)", "n = int(input())\r\nstr = input()\r\na=[]\r\nfor v in str:\r\n if v not in a:\r\n a.append(v)\r\nprint(n-len(a) if n < 27 else -1)\r\n", "z=int(input())\r\nl=len(set(input()))\r\nprint(['-1','%d'%(z-l)][26-l-(z-l)>-1])\r\n", "n = int(input())\narray = input()\nresult = n - len(set(array))\n\nif n > 26:\n print(-1)\nelse:\n print(result)\n", "input(); a = input()\r\nprint([len(a) - len(set(a)), -1][len(a) - len(set(a)) > 26 - len(set(a))])", "print(l-sett if (l:=int(input()),st:=input(),sett:=len(set(st))) and 26-sett>=l-sett else -1)", "n = int(input())\r\ns = str(input())\r\n\r\ndiff = \"\"\r\nfor i in s:\r\n\tif i not in diff:\r\n\t\tdiff += i\r\nm = n-len(diff)\r\nj = 26-len(diff)\r\nif m>j:\r\n\tprint(-1)\r\nelse:\r\n\tprint(m)\r\n", "n=int(input())\r\nif n<=26:\r\n print(n-len(set((input()))))\r\nelse:\r\n print(-1)", "n=int(input())\r\na=input()\r\nif n>26:\r\n\tprint(\"-1\")\r\nelse:\t\r\n\ta=list(a)\r\n\ta=set(a)\r\n\tl=len(a)\r\n\tprint(n-l)", "n=int(input())\r\nl=list(input())\r\nr=list(set(l))\r\np=len(r)\r\nu=len(l)\r\nc=0\r\nq1=\"abcdefghijklmnopqrstuvwxyz\"\r\nfor i in range(u-p):\r\n\tfor j in range(26):\r\n\t\tif q1[j] not in r:\r\n\t\t\tr.append(q1[j])\r\n\t\t\tc+=1\r\n\t\t\tbreak\r\nif c>=0 and len(r)==u:\r\n\tprint(c)\r\nelse:\r\n\tprint(-1)\r\n", "n = int(input())\r\ndata = sorted(input())\r\n\r\ncnt = 0\r\nfor i in range(1,n):\r\n if data[i]==data[i-1]:\r\n cnt += 1\r\n\r\nif n>26:\r\n print(-1)\r\nelse:\r\n print(cnt)", "n = int(input())\r\nif n <= 26:\r\n s = input()\r\n print(len(s)-len(set(s)))\r\nelse:\r\n print(\"-1\")\r\n", "n=int(input())\r\ns=[i for i in input()]\r\nprint(-1 if n>26 else n-len(set(s)))\r\n", "n = int(input())\r\ns = input()\r\n\r\nif n > ord('z') - ord('a') + 1:\r\n print(-1)\r\nelse:\r\n ln = len(set(s))\r\n print(n - ln)", "n = int(input())\r\ns = input()\r\nused = []\r\nk = 0\r\nfor i in s:\r\n if i not in used:\r\n used.append(i)\r\n else:\r\n k += 1\r\nif 26-len(used) >= k:\r\n print(k)\r\nelse:\r\n print(-1)", "n=int(input())\r\ns=input()\r\n#the logic id all the character should be differnt but if n>26 then it is not possible\r\nif n>26:\r\n print(-1)\r\nelse:\r\n print(n-len(set(s)))", "def substrings_checker(n,s):\r\n if n > 26 :\r\n return -1\r\n elif len(set(s)) == len(s):\r\n return 0\r\n else:\r\n change = 0\r\n store = []\r\n for x in s:\r\n if x in store :\r\n change += 1\r\n else:\r\n store.append(x)\r\n return change\r\n\r\nn = int(input())\r\ns = input()\r\n\r\nprint (substrings_checker(n,s))\r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n\r\n\r\n\r\n\r\n\r\n\r\n", "from collections import Counter\r\nn = int(input())\r\ns = input()\r\nv = list(Counter(s).values())\r\nans = 0\r\nif len(s) > 26:\r\n print(-1)\r\nelse:\r\n for i in range(len(v)):\r\n ans += v[i] - 1\r\n print(ans)\r\n", "from collections import defaultdict\r\ndef diff_is_good(inp_str):\r\n if len(inp_str)>26:\r\n return -1\r\n freq_dict = defaultdict(int)\r\n\r\n for i in range(len(inp_str)):\r\n freq_dict[inp_str[i]] += 1\r\n \r\n changes = 0\r\n for key in freq_dict:\r\n if freq_dict[key]>1:\r\n changes += (freq_dict[key]-1)\r\n\r\n return changes\r\n\r\nif __name__=='__main__':\r\n \r\n str_len = int(input())\r\n inp_str = input()\r\n ans = diff_is_good(inp_str)\r\n\r\n print(ans)", "n = int(input())\r\ns = input()\r\nif n>26:\r\n print(-1)\r\nelse:\r\n d = {}\r\n cnt = 0\r\n for i in s:\r\n if i in d:\r\n d[i]+=1\r\n cnt+=1\r\n else:\r\n d[i] = 1\r\n \r\n print(cnt)", "n = int(input())\r\nb = input()\r\ndistinctLetters = []\r\n\r\n\r\nif len(b) > 26:\r\n print(-1)\r\nelse:\r\n def findIndex(x, i):\r\n for j in x:\r\n if j == i:\r\n return True\r\n return False\r\n\r\n\r\n for i in b:\r\n if findIndex(distinctLetters, i) == False:\r\n distinctLetters.append(i)\r\n\r\n print(n - len(distinctLetters))", "\r\n\r\ndef q_672_B():\r\n from collections import defaultdict\r\n n = int(input())\r\n string = input()\r\n if len(string) > 26:\r\n print(-1)\r\n return\r\n def zero(): return 0\r\n counts = defaultdict(zero)\r\n for c in string:\r\n counts[c] += 1\r\n duplicates = 0\r\n for c in counts:\r\n duplicates += counts[c] - 1\r\n print(duplicates)\r\nq_672_B()\r\n\r\n\r\ndef q_1230_B():\r\n n, k = map(int, input().split())\r\n s = input()\r\n # n, k =10, 9\r\n # s = \"6605076924\"\r\n if len(s) == k:\r\n if len(s) == 1:\r\n print(0)\r\n else:\r\n print(\"1\" + \"0\" * (n - 1))\r\n return\r\n if k == 0:\r\n print(s)\r\n return\r\n\r\n\r\n final_s = \"1\"\r\n if s[0] != \"1\": k-=1\r\n for i in range(1, len(s)):\r\n if s[i] == \"0\":\r\n final_s += \"0\"\r\n elif k > 0:\r\n final_s += \"0\"\r\n k-=1\r\n else:\r\n final_s += s[i]\r\n print(final_s)\r\n\r\n\r\ndef q_1593_C():\r\n t = int(input())\r\n for w in range(t):\r\n n, k = map(int, input().split())\r\n mice = [int(a) for a in input().split(\" \")]\r\n\r\n mice = sorted(mice, reverse=True)\r\n\r\n sum = 0\r\n i = 0\r\n while i < k and sum + (n - mice[i]) < n:\r\n sum += n - mice[i]\r\n i+=1\r\n\r\n print(i)", "from collections import defaultdict\r\ndef Vivek(inpcgreiuoh):\r\n if len(inpcgreiuoh)>26:\r\n return -1\r\n freqjdksbfui = defaultdict(int)\r\n #chakjfhwchakjfhwchakjfhwchakjfhwchakjfhwchakjfhwchakjfhw\r\n for i in range(len(inpcgreiuoh)):\r\n freqjdksbfui[inpcgreiuoh[i]] += 1\r\n # chakjfhwchakjfhwchakjfhwchakjfhwchakjfhw\r\n chakjfhw = 0\r\n for key in freqjdksbfui:\r\n if freqjdksbfui[key]>1:\r\n chakjfhw += (freqjdksbfui[key]-1)\r\n #chakjfhwchakjfhwchakjfhwchakjfhwchakjfhw\r\n return chakjfhw\r\n #chakjfhwchakjfhwchakjfhwchakjfhwchakjfhw\r\n \r\nif __name__=='__main__':\r\n #chakjfhwchakjfhwchakjfhwchakjfhwchakjfhw\r\n str_len = int(input())\r\n inpcgreiuoh = input()\r\n output = Vivek(inpcgreiuoh)\r\n \r\n print(output)", "n = int(input())\r\ns = input()\r\nif n>26:\r\n print(-1)\r\nelse:\r\n distinct = len(set(s))\r\n if distinct==n:\r\n print(0)\r\n else:\r\n print((n-distinct)) ", "n = int(input())\ns = input()\ntemp = {}\ncount = 0\nfor i in s:\n if (count == 26):\n break\n elif (i not in temp.keys()):\n temp[i] = 1\n else:\n count += 1\n\nif (count == 0):\n print(0)\nelif (len(temp) + count < 27):\n print(count)\nelse:\n print(-1)\n\t \t\t \t \t \t \t \t\t \t \t\t \t", "import sys\nsys.stderr = sys.stdout\n\n\ndef different(n, s):\n if n > 26:\n return None\n c = set(s)\n return n - len(c)\n\ndef main():\n n = readint()\n s = input()\n d = different(n, s)\n print('-1' if d is None else d)\n\n##########\n\ndef readint():\n return int(input())\n\n\ndef readinti():\n return map(int, input().split())\n\n\ndef readintt():\n return tuple(readinti())\n\n\ndef readintl():\n return list(readinti())\n\n\ndef readinttl(k):\n return [readintt() for _ in range(k)]\n\n\ndef readintll(k):\n return [readintl() for _ in range(k)]\n\n\ndef log(*args, **kwargs):\n print(*args, **kwargs, file=sys.__stderr__)\n\n\nif __name__ == '__main__':\n main()\n", "n = int(input())\r\ns = input()\r\nif n > 26:\r\n print(-1)\r\n exit()\r\ncnt = [0] * 26\r\nfor i in s:\r\n cnt[ ord(i) - ord('a') ] += 1\r\nres = 0\r\nfor i in cnt:\r\n res += max(0, i - 1)\r\nprint(res)\r\n", "n=int(input())\r\nstring=input()\r\nif(n>26):\r\n print(-1)\r\nelse:\r\n char_dict={}\r\n for i in string:\r\n if i in char_dict.keys():\r\n char_dict[i]=char_dict[i]+1\r\n else:\r\n char_dict[i]=1\r\n characters_to_change=0\r\n for key,value in char_dict.items():\r\n characters_to_change=characters_to_change+value-1\r\n print(characters_to_change)", "n=int(input())\r\ns=str(input())\r\nif(n<27):\r\n print(len(s)-len(set(s)))\r\nelse:\r\n print(-1)", "from collections import Counter\ns = input()\ns = input()\nif len(s) > 26:\n print(-1)\nelse:\n t=0\n for v in Counter(s).values():\n t += v-1\n print(t)\n\n \t \t \t \t \t\t \t \t \t\t \t\t\t \t\t\t", "n=int(input())\r\na=input()\r\nk=len({*a})\r\nprint([n-k,-1][n>26])", "def main():\r\n n = int(input())\r\n s = input()\r\n arr = [0] * 26\r\n for char in s:\r\n arr[ord(char) - ord('a')] += 1\r\n ans = 0\r\n count = 0\r\n for c in range(26):\r\n if arr[c] > 0:\r\n count += 1\r\n ans += arr[c] - 1\r\n if 26 - count < ans:\r\n print(-1)\r\n else:\r\n print(ans)\r\n\r\n\r\nmain()", "n = int(input())\nif n > 26:\n print(-1)\n exit(0)\nprint(n - len(set(input())))\n", "def minChanges(str):\r\n MAX_CHAR = [26]\r\n \r\n n = len(str )\r\n \r\n # If length is more than maximum\r\n # allowed characters, we cannot\r\n # get the required string.\r\n if (n > MAX_CHAR[0]):\r\n return -1\r\n \r\n # Variable to store count of\r\n # distinct characters\r\n dist_count = 0\r\n \r\n # To store counts of different\r\n # characters\r\n count = [0] * MAX_CHAR[0]\r\n \r\n for i in range(n):\r\n if (count[ord(str[i]) - ord('a')] == 0) :\r\n dist_count += 1\r\n count[(ord(str[i]) - ord('a'))] += 1\r\n \r\n # Answer is, n - number of distinct char\r\n return (n - dist_count)\r\n\r\nn=int(input())\r\ns=str(input()) \r\nprint(minChanges(s)) \r\n \r\n\r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n", "n = int(input())\r\ns = input()\r\n# 97\r\ndiction = [0 for i in range(26)]\r\ncount = 0\r\nif n>26:\r\n print('-1')\r\nelse:\r\n for char in s:\r\n diction[ord(char)-97]+=1\r\n for num in diction:\r\n if num>1:\r\n count+=num-1\r\n print(count)\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())\r\ncnt = [0] * 26\r\nfor i in s:\r\n cnt[i - 97] += 1\r\nans = 0\r\nfor i in cnt:\r\n ans += max(i - 1, 0)\r\nif n > 26:\r\n ans = -1\r\nprint(ans)", "n = int(input())\r\nif n <= 26:\r\n print(n-len(set(input())))\r\nelse:\r\n print(\"-1\")\r\n", "t=int(input())\r\na=input()\r\nl=[]\r\nf=list(set(a))\r\nfor i in f:\r\n l.append(a.count(i))\r\nif len(a)<27:\r\n print(sum(l)-len(f))\r\nelse:\r\n print(-1)", "from collections import Counter\r\n\r\nn=int(input())\r\n\r\ns=input()\r\n\r\nif(len(s)>26):\r\n print(-1)\r\nelse:\r\n c=Counter(s)\r\n p=c.values()\r\n\r\n print(sum(p)-len(p))\r\n", "from collections import OrderedDict\r\nn=int(input())\r\ns=str(input())\r\nl=len(s)\r\nf=\"\".join(OrderedDict.fromkeys(s))\r\nif(len(s)>26):\r\n print('-1')\r\nelse:\r\n print(len(s)-len(f))\r\n", "from collections import defaultdict\r\nd=defaultdict(int)\r\nn=int(input())\r\nc=input()\r\nif n>26:\r\n\tprint(-1)\r\nelse:\r\n\tfor char in c:\r\n\t\td[char]+=1\r\n\t\r\n\ttot=0\r\n\tfor i in d.values():\r\n\t\ttot+=(i-1)\r\n\tprint(tot)\r\n\t\r\n\t\r\n\t\r\n", "n=int(input())\ns=input()\nset_s=set(s)\nif len(s)>26:\n\tprint(-1)\nelse:\n\tprint(n-len(set_s))\n \t \t\t \t \t \t \t\t\t \t\t\t", "n = int(input())\ncs = set(input().strip())\n\nif n > 26:\n print(-1)\nelse:\n print(n - len(cs))", "n = int(input())\r\n\r\ns = input()\r\n\r\nif (n-len(set(s)))>(26-len(set(s))):\r\n print(\"-1\")\r\nelse:\r\n print(n-len(set(s)))", "n = int(input())\r\nm = list(input())\r\nif n>26:\r\n print(-1)\r\nelse:\r\n print(n-len(set(m)))\r\n", "n=int(input())\r\ns=input()\r\ns2=set(s)\r\nif n>26:\r\n print(\"-1\")\r\nelse:\r\n print(len(s)-len(s2))", "n=int(input())\r\ni=input()\r\nif len(i)>26:\r\n print(-1)\r\nelse:\r\n print(n-len(set(i)))", "a=int(input())\nn=input()\nx=set(n)\n#x=\"\".join(x)\nif(len(n)>26):\n print(\"-1\")\nelse:\n print(len(n)-len(x))", "import string\n\nn = int(input())\ns = input()\n\nif n > 26:\n print(-1)\nelse:\n ans = sum(max(s.count(x) - 1, 0) for x in string.ascii_lowercase)\n print(ans)\n", "n=int(input())\r\nl=list(input())\r\nif len(l)==len(set(l)):\r\n print(0)\r\n exit()\r\nif n>26:\r\n print(-1)\r\n exit()\r\ny=list(set(l))\r\nx=[]\r\nans=0\r\nfor i in range(len(y)):\r\n x.append(l.count(y[i]))\r\nfor i in range(len(x)):\r\n ans+=x[i]-1\r\nprint(ans)", "import math\r\nalph=\"abcdefghijklmnopqrstuvwxyz\"\r\n#-----------------------------------\r\n\r\nn=int(input())\r\ns=str(input())\r\nd=[0]*26;E=0\r\nif n>26:\r\n print(-1)\r\nelse:\r\n for i in s:\r\n d[alph.index(i)]+=1\r\n for i in range(26):\r\n E+=max(0,d[i]-1)\r\n print(E)", "n=int(input())\r\ns=list(input())\r\nif(n>26):\r\n print('-1')\r\nelse:\r\n print(n-len(set(s)))\r\n", "n=int(input())\r\ns=input()\r\ns1=set()\r\nif n>26:\r\n print(\"-1\")\r\nelse:\r\n \r\n for i in s:\r\n s1.add(i)\r\n \r\n print(n-len(s1))\r\n ", "n = int(input())\r\ns = input()\r\na,l,k = {},0,0\r\nfor i in s:\r\n if i in a:\r\n a[i]+=1\r\n else:\r\n a[i]=1\r\n l+=1\r\nfor i in a:\r\n k+=(a[i]-1)\r\nif k>(26-l):\r\n print(-1)\r\nelse:\r\n print(k)", "n = int(input())\r\nlinea = input()\r\n\r\nletras = {}\r\n\r\nfor i in linea:\r\n\tif i in letras.keys():\r\n\t\tletras[i] += 1\r\n\telse:\r\n\t\tletras[i] = 0\r\nrepetidas = sum(letras.values())\r\n\r\nif n > 26:\r\n\tprint(-1)\r\nelse:\r\n\tprint(repetidas)", "input()\r\nt = input()\r\nprint(-1 if len(t) > 26 else len(t) - len(set(t)))", "input()\r\na = input().strip()\r\nif len(a) > 26:\r\n print(-1)\r\nelse:\r\n s = set()\r\n\r\n res = 0\r\n for i in a:\r\n if i in s:\r\n res += 1\r\n else:\r\n s.add(i)\r\n print(res)\r\n", "# cook your dish here\r\nn=int(input())\r\nt=list(input())\r\nm=list(set(t))\r\n#print(*t)\r\n#print(*m)\r\na=len(t)-len(m)\r\nif(a>26-len(m)):\r\n print(\"-1\")\r\nelse:\r\n print(a)", "n = int(input())\r\ns = input()\r\narr = set()\r\nfor i in range(n):\r\n arr.add(s[i])\r\n #print(arr)\r\n\r\nif n-len(arr)<26 and n<=26:\r\n print(n-len(arr))\r\nelse:\r\n print(-1)\r\n", "import sys\r\n\r\nn = int(sys.stdin.readline())\r\ns = sys.stdin.readline().strip()\r\n\r\nif n>26:\r\n ans = -1\r\nelse:\r\n letters = {}\r\n ans = 0\r\n for ch in s:\r\n try:\r\n letters[ch]+=1\r\n ans+=1\r\n except:\r\n letters[ch]=1\r\nprint(ans)", "\n\nMAX_CHAR = [26]\nn = int(input())\nstr = input()\nflag = 0\nif (n > MAX_CHAR[0]):\n flag=-1\nelse:\n dist_count = 0\n count = [0] * MAX_CHAR[0]\n for i in range(n):\n if (count[ord(str[i]) - ord('a')] == 0) :\n dist_count += 1\n count[(ord(str[i]) - ord('a'))] += 1\n flag = (n - dist_count)\nprint(flag)", "n=int(input())\nr=input()\nprint (-1 if n>26 else n-len(set(r)))\n \t\t \t \t\t\t \t \t \t\t \t\t \t \t", "n = int(input())\r\nst = input()\r\nif(n > 26):\r\n print(-1)\r\nelse:\r\n li = [0] * 26\r\n for i in range(n):\r\n ch = ord(st[i]) - 97\r\n li[ch] = li[ch] + 1\r\n total = 0\r\n count = 0\r\n for i in range(26):\r\n if(li[i] == 0):\r\n count = count + 1\r\n else:\r\n total = total + (li[i] - 1)\r\n if(total <= count):\r\n print(total)\r\n else:\r\n print(-1)", "\r\nn = int(input())\r\nl = list(input())\r\n\r\nif n > 26:\r\n\tprint(-1)\r\n\texit()\r\nprint(n - len(set(l)))", "n = int(input())\r\ns = input()\r\ndistinct = len(set(s))\r\nans = n - distinct\r\nprint(ans if ans <= 26 - distinct else -1)", "n = int(input())\r\ns=input()\r\nlis=[0]*(26)\r\nans=k=0\r\nfor i in s:\r\n lis[ord(i)-ord('a')]+=1\r\nfor i in lis:\r\n if i>1:\r\n ans+=(i-1)\r\n if i>0:\r\n k+=1\r\n#print(lis,ans) \r\nif ans>26-k:\r\n print(-1)\r\nelse:\r\n print(ans) \r\n", "n=int(input())\r\ns=input()\r\nl=list(set(s))\r\nif(n<27):\r\n for i in range(len(l)):\r\n \r\n if(s.count(l[i])>26):\r\n print(-1)\r\n break\r\n else:\r\n print(n-len(l)) \r\n\r\nelse:\r\n print(-1)\r\n", "n = int(input())\r\ns = input()\r\nif n > 26 :\r\n print(-1)\r\nelse:\r\n d = dict()\r\n for x in s:\r\n if x in d:\r\n d[x] += 1\r\n else:\r\n d[x] = 1\r\n p = 0\r\n for y in d:\r\n p += d[y] - 1\r\n print(p)\r\n ", "n,k = int(input()),len(set(list(input())))\r\nprint([-1,n-k][n<27])", "n = int(input())\r\nprint(-1) if n > 26 else print(n - len(set(input())))\r\n" ]

[ "n = int(input())\n\nvalues = [ 1000, 100, 10, 1 ]\nranges = [ [1, 2], range(10), range(10), range(10) ]\n\ndef attempt(previous, digits, x):\n least = None\n for i in range(4):\n for d in ranges[i]:\n y = x + (d - digits[i]) * values[i]\n if y <= 2011 and y >= previous and (least == None or y < least):\n least = y\n return least\n\nprevious = 0\nresult = []\nfor i in range(n):\n s = input()\n digits = list(map(int, list(s)))\n x = int(s)\n y = attempt(previous, digits, x)\n if y == None:\n print('No solution')\n import sys; sys.exit()\n result.append(y)\n previous = y\nprint('\\n'.join(map(str, result)))\n", "import math\r\nimport sys\r\nimport collections\r\n\r\n\r\ndef solve():\r\n n = int(input())\r\n r = [list(str(input())) for i in range(n)]\r\n\r\n last = 0\r\n ok = True\r\n for i in range(n):\r\n mn = 10000\r\n for ind in range(4):\r\n for d in range(10):\r\n if ind == 0 and d == 0:\r\n continue\r\n s = r[i] * 1\r\n s[ind] = str(d)\r\n if int(\"\".join(s)) >= last and int(\"\".join(s)) <= mn:\r\n mn = int(\"\".join(s))\r\n if mn != 10000 and mn <= 2011:\r\n r[i] = mn\r\n last = mn\r\n else:\r\n ok = False\r\n break\r\n\r\n if ok:\r\n for i in range(n):\r\n print(r[i])\r\n else:\r\n print(\"No solution\")\r\n\r\n\r\nif __name__ == '__main__':\r\n solve()\r\n", "import sys\r\n\r\nn = int(input())\r\nd = []\r\nfor i in range(n):\r\n d.append(input())\r\nans = []\r\n\r\nbad = 'No solution'\r\nlow = 1000\r\nfor date in d:\r\n lowest = 100500\r\n for i in range(10):\r\n for j in range(i == 0, 5):\r\n changed = date[:j] + str(i) + date[j + 1:]\r\n if lowest > int(changed) >= low:\r\n lowest = int(changed)\r\n if lowest > 2011:\r\n print(bad)\r\n sys.exit(0)\r\n ans.append(str(lowest))\r\n low = lowest\r\n\r\nprint('\\n'.join(ans))", "def f(t, s):\r\n r = '2012'\r\n x, y = '1' + t[1: ], '2' + t[1: ]\r\n if x >= s: r = x\r\n elif r > y >= s: r = y\r\n if t[0] > '2': return r\r\n for i in range(1, 4):\r\n a, b = t[: i], t[i + 1: ]\r\n x, y = a + '0' + b, a + '9' + b\r\n if y >= s and x < r:\r\n if x < s:\r\n x = a + s[i] + b\r\n if x < s: x = a + str(int(s[i]) + 1) + b\r\n r = x\r\n return r\r\n\r\nn = int(input())\r\nt = ['2012'] * n\r\nt[0] = f(input(), '1000')\r\nfor i in range(1, n):\r\n t[i] = f(input(), t[i - 1])\r\n if t[i] == '2012': break\r\nif t[n - 1] == '2012': print('No solution')\r\nelse: print('\\n'.join(t))\r\n" ]

[ "n,m=map(int,input().split())\r\na=list(map(int,input().split()))\r\nb,c=[0]*n,[0]*n\r\nfor i in range(1,n):\r\n if a[i]<=a[i-1]: b[i]=b[i-1]+1\r\nfor i in range(n-2,-1,-1):\r\n if a[i]<=a[i+1]: c[i]=c[i+1]+1\r\nfor i in range(m):\r\n L,R=map(int,input().split())\r\n if abs(R-L)<=c[L-1]+b[R-1]:\r\n print(\"Yes\")\r\n else:\r\n print(\"No\")\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn, m = map(int, input().split())\r\nw = list(map(int, input().split()))\r\na = [i for i in range(n)]\r\nb = [i for i in range(n)]\r\nfor i in range(1, n):\r\n if w[i] >= w[i-1]:\r\n a[i] = a[i-1]\r\n if w[i] <= w[i-1]:\r\n b[i] = b[i-1]\r\nfor i in range(m):\r\n x, y = map(lambda z:int(z)-1, input().split())\r\n if a[b[y]] <= x:\r\n print('Yes')\r\n else:\r\n print('No')", "#https://codeforces.com/contest/279/submission/64890159\n\nn,m = map(int,input().split())\nArr = list(map(int,input().split()))\n\nup = [i for i in range(n)]\ndown = [i for i in range(n)]\nfor i in range(1,n):\n if Arr[i-1]<=Arr[i]:\n up[i] = up[i-1]\n if Arr[i-1]>=Arr[i]:\n down[i] = down[i-1]\n\nfor i in range(m):\n l,r = map(int,input().split())\n l -= 1\n r -= 1\n if l >= up[down[r]]:\n print(\"Yes\")\n else:\n print(\"No\")", "n,m=map(int,input().split())\r\n*a,=map(int,input().split())\r\ninc=[*range(n)]\r\ndec=[*range(n)]\r\nfor i in range(n-1,0,-1):\r\n if a[i]>=a[i-1]:inc[i-1]=inc[i]\r\n if a[i]<=a[i-1]:dec[i-1]=dec[i]\r\nk=['No']*m\r\nl=0\r\nfor i,j in (map(lambda i: int(i)-1,input().split()) for _ in ' '*m):\r\n if dec[inc[i]]>=j: k[l]='Yes'\r\n l+=1\r\nprint('\\n'.join(k))", "import sys\r\nsys.setrecursionlimit(2000000)\r\n\r\nfrom collections import defaultdict\r\ndef clc(): \r\n n,m= map(int,input().split())\r\n arr = list(map(int,input().split()))\r\n dp0 =[0]*len(arr)\r\n dp1= [0]*len(arr)\r\n dp0[0],dp1[n-1] = 1,1\r\n for i in range(1,n):\r\n if arr[i]<=arr[i-1]:dp0[i] = dp0[i-1]+1\r\n else:dp0[i] = 1\r\n for i in range(n-2,-1,-1):\r\n if arr[i]<=arr[i+1]:dp1[i] = dp1[i+1]+1\r\n else:dp1[i]= 1 \r\n #print(dp1,dp0)\r\n for i in range(m):\r\n l,r = map(int,input().split())\r\n l,r = l-1,r-1\r\n if dp1[l]+dp0[r]>=(r-l+1):\r\n print(\"Yes\")\r\n else:\r\n print(\"No\")\r\n return True\r\ncc = clc()\r\n\r\nif not cc :\r\n print(-1)\r\n " ]

[ "print('9??>>??0')\r\nfor i in range(9):\r\n print('{}??<>{}'.format(i, i + 1))\r\nprint('??<>1')\r\nfor i in range(10):\r\n print('?{0}>>{0}?'.format(i))\r\nprint('?>>??')\r\nprint('>>?')", "print(\"0??<>1\");\r\nprint(\"1??<>2\");\r\nprint(\"2??<>3\");\r\nprint(\"3??<>4\");\r\nprint(\"4??<>5\");\r\nprint(\"5??<>6\");\r\nprint(\"6??<>7\");\r\nprint(\"7??<>8\");\r\nprint(\"8??<>9\");\r\nprint(\"9??>>??0\");\r\nprint(\"??<>1\");\r\nprint(\"?9>>9?\");\r\nprint(\"?8>>8?\");\r\nprint(\"?7>>7?\");\r\nprint(\"?6>>6?\");\r\nprint(\"?5>>5?\");\r\nprint(\"?4>>4?\");\r\nprint(\"?3>>3?\");\r\nprint(\"?2>>2?\");\r\nprint(\"?1>>1?\");\r\nprint(\"?0>>0?\");\r\nprint(\"9>>9?\");\r\nprint(\"8>>8?\");\r\nprint(\"7>>7?\");\r\nprint(\"6>>6?\");\r\nprint(\"5>>5?\");\r\nprint(\"4>>4?\");\r\nprint(\"3>>3?\");\r\nprint(\"2>>2?\");\r\nprint(\"1>>1?\");\r\nprint(\"0>>0?\");" ]

[ "from sys import stdin\r\ndef input(): return stdin.readline()[:-1]\r\ndef check(i,j):\r\n\tif (i-1)>=0:\r\n\t\tif l[i-1][j]==\"P\":\r\n\t\t\tl[i][j]=\".\"\r\n\t\t\tl[i-1][j]=\".\"\r\n\t\t\treturn True\r\n\tif (i+1)<n:\r\n\t\tif l[i+1][j]==\"P\":\r\n\t\t\tl[i][j]=\".\"\r\n\t\t\tl[i+1][j]=\".\"\r\n\t\t\treturn True\t\r\n\tif (j-1)>=0:\r\n\t\tif l[i][j-1]==\"P\":\r\n\t\t\tl[i][j]=\".\"\r\n\t\t\tl[i][j-1]=\".\"\r\n\t\t\treturn True\r\n\tif (j+1)<m:\r\n\t\tif l[i][j+1]==\"P\":\r\n\t\t\tl[i][j]=\".\"\r\n\t\t\tl[i][j+1]=\".\"\r\n\t\t\treturn True\r\n\treturn False\r\nn,m=map(int,input().split())\r\nl=[]\r\nfor i in range(n):\r\n\tl+=[list(input())]\r\nans=0\r\nfor i in range(n):\r\n\tfor j in range(m):\r\n\t\tif l[i][j]==\"W\":\r\n\t\t\tif check(i,j):\r\n\t\t\t\tans+=1\r\nprint(ans)", "import sys\r\nimport math\r\nimport copy\r\nfrom collections import deque\r\nfrom collections import *\r\nfrom functools import lru_cache\r\n\r\ninput = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\r\n\r\n\r\n# sys.stdin = open('input.txt')\r\n# sys.stdout = open('output.txt', 'w')\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\n\r\n\r\ndef ip(n):\r\n if n % 2 == 0:\r\n return n == 2\r\n d = 3\r\n while d * d <= n and n % d != 0:\r\n d += 2\r\n return d * d > n\r\n\r\n\r\n@lru_cache(None)\r\ndef daa(n):\r\n ct = 0\r\n for x in range(1, int(pow(n, 0.5)) + 1):\r\n if n % x == 0:\r\n ct += 1\r\n if x != n // x:\r\n ct += 1\r\n return ct\r\nn,m=mn()\r\np=[]\r\nfor x in range(n):\r\n p.append(ns())\r\nct=0\r\nfor x in range(len(p)):\r\n for y in range(m):\r\n if p[x][y]==\"W\":\r\n if (x>0 and p[x-1][y]==\"P\") or(y>0 and p[x][y-1]==\"P\") or (x!=n-1 and p[x+1][y]==\"P\") or ( y!=m-1 and p[x][y+1]==\"P\"):\r\n ct+=1\r\nprint(ct)", "n,m=map(int,input().split())\r\nmat=[]\r\nfor i in range(n):\r\n l=input()\r\n mat.append(l)\r\ndx=[-1,1,0,0]\r\ndy=[0,0,1,-1]\r\nans=0\r\n# print(mat)\r\nfor i in range(n):\r\n for j in range(m):\r\n if mat[i][j]=='W':\r\n for x,y in zip(dx,dy):\r\n newi=i+x\r\n newj=j+y\r\n if newi<0 or newi>=n or newj<0 or newj>=m:\r\n continue\r\n if mat[newi][newj]=='P':\r\n ans+=1\r\n break\r\n # print(i,j,ans)\r\nprint(ans)\r\n", "n, m = map(int, input().split())\r\ngrid = [list(input()) for _ in range(n)]\r\n\r\npigs = {}\r\nwolves = {}\r\nfor i in range(n):\r\n for j in range(m):\r\n if grid[i][j] == 'W':\r\n pigs[(i,j)] = set()\r\n # Check if there is a wolf in any adjacent cell (up, down, left, right)\r\n if i > 0 and grid[i - 1][j] == 'P':\r\n pigs[(i,j)].add((i-1,j))\r\n if i < n - 1 and grid[i + 1][j] == 'P':\r\n pigs[(i,j)].add((i+1,j))\r\n if j > 0 and grid[i][j - 1] == 'P':\r\n pigs[(i,j)].add((i,j-1))\r\n if j < m - 1 and grid[i][j + 1] == 'P':\r\n pigs[(i,j)].add((i,j+1))\r\n if len(pigs[(i,j)]) == 0:\r\n del pigs[(i,j)]\r\n if grid[i][j] == 'W':\r\n wolves[(i, j)] = set()\r\n\r\n # Check if there is a little pig in any adjacent cell (up, down, left, right)\r\n if i > 0 and grid[i - 1][j] == 'P':\r\n wolves[(i, j)].add((i - 1, j))\r\n if i < n - 1 and grid[i + 1][j] == 'P':\r\n wolves[(i, j)].add((i + 1, j))\r\n if j > 0 and grid[i][j - 1] == 'P':\r\n wolves[(i, j)].add((i, j - 1))\r\n if j < m - 1 and grid[i][j + 1] == 'P':\r\n wolves[(i, j)].add((i, j + 1))\r\n if len(wolves[(i,j)]) == 0:\r\n del wolves[(i,j)]\r\n\r\nprint(min(len(pigs),len(wolves)))\r\n", "def main():\r\n n, m = list(map(int, input().split()))\r\n table = []\r\n table.append([-1] * (m+2))\r\n for i in range(n):\r\n temp = input()\r\n s = [-1]\r\n for j in temp:\r\n if j == 'P':\r\n s.append(0)\r\n elif j == 'W':\r\n s.append(1)\r\n else:\r\n s.append(-1)\r\n s.append(-1)\r\n table.append(s)\r\n table.append([-1] * (m+2))\r\n n += 2\r\n m += 2\r\n ans = 0\r\n for i in range(1, n-1):\r\n for j in range(1, m-1):\r\n if table[i][j] == 1:\r\n if table[i-1][j] == 0 or table[i+1][j] == 0 or table[i][j-1] == 0 or table[i][j+1] == 0:\r\n ans += 1\r\n print(ans)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()", "num_rows, num_cols = map(int, input().split())\r\ngrid = []\r\n\r\nfor _ in range(num_rows):\r\n row = input()\r\n grid.append(row)\r\n\r\neaten_pigs = 0\r\n\r\nfor i in range(num_rows):\r\n for j in range(num_cols):\r\n if grid[i][j] == 'W':\r\n if (i > 0 and grid[i - 1][j] == 'P') or \\\r\n (i < num_rows - 1 and grid[i + 1][j] == 'P') or \\\r\n (j > 0 and grid[i][j - 1] == 'P') or \\\r\n (j < num_cols - 1 and grid[i][j + 1] == 'P'):\r\n eaten_pigs += 1\r\n\r\nprint(eaten_pigs)\r\n", "n,m = map(int,input().split())\r\nmatrix=[[0 for i in range(m+2)]]\r\nfor i in range(n):\r\n lst=[0]\r\n lst=lst+(list(input()))\r\n lst.append(0)\r\n matrix.append(lst)\r\nmatrix.append([0 for i in range(m+2)])\r\n\r\ncount=0\r\nfor i in range(1,n+1):\r\n for j in range(1,m+1):\r\n if(matrix[i][j]=='P'):\r\n if(matrix[i][j-1]=='W'):\r\n count +=1\r\n matrix[i][j-1]=0\r\n \r\n if(matrix[i-1][j]=='W'):\r\n count +=1\r\n matrix[i-1][j]=0\r\n if(matrix[i][j+1]=='W'):\r\n count +=1\r\n matrix[i][j+1]=0\r\n if(matrix[i+1][j]=='W'):\r\n count +=1\r\n matrix[i+1][j]= 0\r\n\r\n\r\nprint(count)", "n, m = list(map(int, input().split()))\r\n\r\ngrid = [[\".\"]*(m+2)]\r\nresult = 0\r\n\r\nfor i in range(n):\r\n grid.append(list(input()))\r\n grid[i+1].insert(0, \".\")\r\n grid[i+1].append(\".\")\r\n\r\ngrid.append([\".\"]*(m+2))\r\n\r\nfor i in range(1, n+1):\r\n for j in range(grid[i].count(\"W\")):\r\n ind = grid[i].index(\"W\")\r\n if grid[i+1][ind] == \"P\":\r\n grid[i+1][ind] = \".\"\r\n result += 1\r\n elif grid[i][ind-1] == \"P\":\r\n grid[i][ind-1] = \".\"\r\n result += 1\r\n elif grid[i][ind+1] == \"P\":\r\n grid[i][ind+1] = \".\"\r\n result += 1\r\n elif grid[i-1][ind] == \"P\":\r\n grid[i-1][ind] = \".\"\r\n result += 1\r\n grid[i][ind] = \".\"\r\n\r\nprint(result)" ]

[ "\"\"\"\nCodeforces\n3C - Tic-tac-toe\nhttp://codeforces.com/problemset/problem/3/C\n\nHéctor González Belver\n../07/2018\n\"\"\"\nimport sys\n\nSIZE = 3\n\ndef main():\n rows = [sys.stdin.readline().strip() for _ in range(SIZE)]\n\n num_x = ''.join(rows).count('X')\n num_0 = ''.join(rows).count('0')\n\n columns = [''.join(column) for column in zip(*rows)]\n diagonals = [''.join([row[i*d-(d<0)] for i, row in enumerate(rows)]) for d in (1, -1)]\n\n combinations = rows + columns + diagonals\n\n first_win = 'XXX' in combinations\n \n second_win = '000' in combinations\n\n\n if (num_0 > num_x \n or num_x - num_0 > 1 \n or (first_win and num_0 == num_x)\n or (second_win and num_x - num_0 == 1)):\n veredict = 'illegal'\n elif first_win:\n veredict = 'the first player won'\n elif second_win:\n veredict = 'the second player won'\n elif num_x + num_0 < SIZE*SIZE:\n if num_x == num_0:\n veredict = 'first'\n else:\n veredict = 'second'\n else:\n veredict = 'draw'\n\n sys.stdout.write(veredict + '\\n') \n\nif __name__ == '__main__': \n main()", "import sys\r\n\r\nfirst = 0\r\ndot = 0\r\nsecond = 0\r\nboard = [[] for i in range(3)]\r\n\r\ndef selectMove (character):\r\n global first\r\n global dot\r\n global second\r\n if (character == 'X'):\r\n first += 1\r\n elif (character == '0'):\r\n second +=1\r\n else:\r\n dot += 1\r\n\r\ndef fullRow (character):\r\n winRows = False\r\n for row in range(3):\r\n if (all(position == character for position in board[row])):\r\n winRows = True\r\n return winRows\r\n\r\ndef fullColumn (character):\r\n winColumn = False\r\n for row in range(3):\r\n if (all(board[column][row] == character for column in range(3))):\r\n winColumn = True\r\n return winColumn\r\n\r\ndef fullDiagonal (character):\r\n winDiag = False\r\n if (all(board[ind][ind] == character for ind in range(3))):\r\n winDiag = True\r\n if (all(board[2-ind][ind] == character for ind in range(3))):\r\n winDiag = True\r\n return winDiag\r\n\r\ndef checkWinner(character):\r\n return fullRow(character) or fullColumn(character) or fullDiagonal(character)\r\n\r\nfor row in range(3):\r\n rowMoves = input()\r\n for character in rowMoves:\r\n selectMove(character)\r\n board[row].append(character)\r\n\r\nmessage = 'illegal'\r\nfilled = dot == 0\r\nfirstWin = checkWinner('X')\r\nsecondWin = checkWinner('0')\r\nfirstTurn = first == second\r\nsecondTurn = first == second + 1\r\n\r\nif(filled):\r\n if (secondTurn):\r\n if (firstWin and not secondWin):\r\n message = 'the first player won'\r\n if (not firstWin and not secondWin):\r\n message = 'draw'\r\nelse:\r\n if (firstTurn):\r\n if (not firstWin and not secondWin):\r\n message = 'first'\r\n if (secondWin and not firstWin):\r\n message = 'the second player won'\r\n if (secondTurn):\r\n if (not firstWin and not secondWin):\r\n message = 'second'\r\n if (firstWin and not secondWin):\r\n message = 'the first player won'\r\nprint(message)\r\n\r\n", "#problem C in contest CodeForces Beta Round 3\r\n\r\ndef check( c ):\r\n\tstr = c;\r\n\tstr += c;\r\n\tstr += c;\r\n\tfor i in range(0,3):\r\n\t\tif(lines[i] == str):\r\n\t\t\treturn True;\r\n\tfor i in range(0,3):\r\n\t\tif(lines[0][i] == c and lines[1][i] == c and lines[2][i] == c):\r\n\t\t\treturn True;\r\n\tif(lines[0][0] == c and lines[1][1] == c and lines[2][2] == c):\r\n\t\treturn True;\r\n\tif(lines[2][0] == c and lines[1][1] == c and lines[0][2] == c):\r\n\t\treturn True;\r\n\treturn False;\r\n\r\n\r\n\r\nlines = [\"\",\"\",\"\"];\r\n\r\nfor i in range(0,3):\r\n\tlines[i] = input();\r\n\t\r\nXs = 0;\r\nOs = 0;\r\ndots = 0;\r\n\r\nfor i in range(0,3): \t \r\n\tfor j in range(0,3):\r\n\t\tif(lines[i][j] == 'X'): \r\n\t\t\tXs = Xs + 1;\r\n\t\telif(lines[i][j] == '.'):\r\n\t\t\tdots = dots + 1;\r\n\t\telse:\r\n\t\t\tOs = Os + 1;\r\nif(Os > Xs or Xs - Os > 1 or (check('X') and check('0')) or (check('X') and Xs == Os) or (check('0') and Xs > Os)):\r\n\tprint (\"illegal\");\r\nelif(check('X')):\r\n\tprint(\"the first player won\");\r\nelif(check('0')):\r\n\tprint(\"the second player won\");\r\nelif(dots == 0):\r\n\tprint(\"draw\");\r\nelse:\r\n\tif(Xs > Os):\r\n\t\tprint(\"second\");\r\n\telse:\r\n\t\tprint(\"first\");", "players = [\"first\", \"second\"]\r\n\r\na = input()\r\nb = input()\r\nc = input()\r\n\r\nnx = (a+b+c).count('X')\r\nno = (a+b+c).count('0')\r\nd = nx-no\r\n\r\ns = [a,b,c,a[0]+b[1]+c[2],a[2]+b[1]+c[0]] + list(map(''.join,zip(a,b,c)))\r\nw = ('XXX' in s) + 2*('000' in s) -1\r\n\r\nif (d not in (0,1)) or w>1 or d==w:\r\n print('illegal')\r\nelif w>=0:\r\n print('the '+players[w]+' player won')\r\nelif nx+no==9:\r\n print('draw')\r\nelse:\r\n print(players[d])", "a,b,c=input(),input(),input()\nplayers=[\"first\",\"second\"]\nnx=(a+b+c).count('X')\nno=(a+b+c).count('0')\nd=nx-no\ns=[a,b,c,a[0]+b[1]+c[2],a[2]+b[1]+c[0]]+list(map(''.join,zip(a,b,c)))\nw=('XXX' in s)+2*('000' in s)-1\nif(d not in (0,1)) or w>1 or d==w:\n print('illegal')\nelif(w>=0):\n print('the '+players[w]+' player won')\nelif nx+no==9:\n print('draw')\nelse:\n print(players[d])\n \t\t\t \t \t\t\t\t\t \t \t\t \t\t\t \t \t", "import queue\r\n\r\nlegal_grids = {}\r\nq = queue.Queue()\r\nq.put(('.'*9, 0))\r\nrows_cols_diags = [\r\n (0, 1, 2),\r\n (3, 4, 5),\r\n (6, 7, 8),\r\n (0, 3, 6),\r\n (1, 4, 7),\r\n (2, 5, 8),\r\n (0, 4, 8),\r\n (2, 4, 6)\r\n]\r\nwhile q.qsize():\r\n board, player = q.get()\r\n if board in legal_grids:\r\n continue\r\n state = None\r\n for a, b, c in rows_cols_diags:\r\n symbols = board[a]+board[b]+board[c]\r\n if symbols == 'XXX':\r\n state = 'the first player won'\r\n break\r\n if symbols == '000':\r\n state = 'the second player won'\r\n break\r\n if state is None and '.' not in board:\r\n state = 'draw'\r\n if state is not None:\r\n legal_grids[board] = state\r\n continue\r\n legal_grids[board] = ['first', 'second'][player]\r\n for i in range(9):\r\n if board[i] == '.':\r\n new_board = board[:i]+'X0'[player]+board[i+1:]\r\n q.put((new_board, (player+1)%2))\r\n\r\nprint(legal_grids.get(''.join(input() for _ in range(3)), 'illegal'))\r\n", "a=[]\r\nc=0\r\nd=0\r\nfor i in range(3):\r\n b=input()\r\n a.append([])\r\n for j in range(3):\r\n a[i].append(b[j])\r\n if b[j]=='X':\r\n c+=1\r\n elif b[j]=='0':\r\n d+=1\r\ne=0\r\nf=0\r\ng=[]\r\nh=[]\r\nfor i in range(3):\r\n z=1\r\n for j in range(3):\r\n if ([i,j] in g and a[i][j]=='X') or ([i,j] in h and a[i][j]=='0'):\r\n z=0\r\n break\r\n if a[i][j]!=a[i][0]:\r\n z=0\r\n break\r\n if z==1:\r\n if a[i][0]=='X':\r\n for j in range(3):\r\n g.append([i,j])\r\n e+=1\r\n elif a[i][0]=='0':\r\n for j in range(3):\r\n h.append([i,j])\r\n f+=1\r\nfor j in range(3):\r\n z=1\r\n for i in range(3):\r\n if ([i,j] in g and a[i][j]=='X') or ([i,j] in h and a[i][j]=='0'):\r\n z=0\r\n break\r\n if a[i][j]!=a[0][j]:\r\n z=0\r\n break\r\n if z==1:\r\n if a[0][j]=='X':\r\n for i in range(3):\r\n g.append([i,j])\r\n e+=1\r\n elif a[0][j]=='0':\r\n for i in range(3):\r\n h.append([i,j])\r\n f+=1\r\nz=1\r\nfor i in range(3):\r\n if ([i,j] in g and a[i][j]=='X') or ([i,j] in h and a[i][j]=='0'):\r\n z=0\r\n break\r\n if a[i][i]!=a[0][0]:\r\n z=0\r\n break\r\nif z==1:\r\n if a[0][0]=='X':\r\n for i in range(3):\r\n g.append([i,i])\r\n e+=1\r\n elif a[0][0]=='0':\r\n for i in range(3):\r\n h.append([i,i])\r\n f+=1\r\nz=1\r\nfor i in range(3):\r\n if ([i,j] in g and a[i][j]=='X') or ([i,j] in h and a[i][j]=='0'):\r\n z=0\r\n break\r\n if a[2-i][i]!=a[2][0]:\r\n z=0\r\n break\r\nif z==1:\r\n if a[2][0]=='X':\r\n for i in range(3):\r\n g.append([2-i,i])\r\n e+=1\r\n elif a[2][0]=='0':\r\n for i in range(3):\r\n h.append([2-i,i])\r\n f+=1\r\nif (c-d!=0 and c-d!=1) or e+f>1 or (e==1 and c-d==0) or (f==1 and c-d==1):\r\n print('illegal')\r\nelif e==1:\r\n print('the first player won')\r\nelif f==1:\r\n print('the second player won')\r\nelif c+d==9:\r\n print('draw')\r\nelif c-d==0:\r\n print('first')\r\nelse:\r\n print('second')", "def permute(positions):\r\n res = []\r\n\r\n def find(j, arr, s, rem):\r\n if rem == 0:\r\n res.append(arr.copy())\r\n for i in range(j, len(positions)):\r\n if positions[i] not in s:\r\n arr.append(positions[i])\r\n s.add(positions[i])\r\n find(i+1, arr, s, rem-1)\r\n s.remove(positions[i])\r\n arr.pop()\r\n find(0, [], set(), 3)\r\n return res\r\n\r\n\r\ndef in_line(positions):\r\n for pos in permute(positions):\r\n vert = pos[0][0] == pos[1][0] == pos[2][0]\r\n hor = pos[0][1] == pos[1][1] == pos[2][1]\r\n diag1 = pos[1][0] - pos[0][0] == pos[2][0] - pos[1][0] == 1 and pos[1][1] - pos[0][1] == pos[2][1] - pos[1][1] == 1\r\n diag2 = pos[1][0] - pos[0][0] == pos[2][0] - pos[1][0] == 1 and pos[1][1] - pos[0][1] == pos[2][1] - pos[1][1] == -1\r\n if vert or hor or diag1 or diag2:\r\n return True\r\n return False\r\n\r\n\r\ndef solve(board):\r\n x = o = dots= 0\r\n x_pos, o_pos = [], []\r\n for i in range(3):\r\n for j in range(3):\r\n if board[i][j] == 'X':\r\n x+= 1\r\n x_pos.append((i,j))\r\n elif board[i][j] == '0':\r\n o += 1\r\n o_pos.append((i,j))\r\n elif board[i][j] == '.':\r\n dots += 1\r\n else:\r\n print('illegal')\r\n return\r\n if x - o > 1 or o > x:\r\n print('illegal')\r\n return\r\n elif x > 2:\r\n if in_line(x_pos):\r\n if o > 2 and in_line(o_pos) or x == o:\r\n print('illegal')\r\n else:\r\n print('the first player won')\r\n return\r\n elif in_line(o_pos):\r\n if 2 < o == x:\r\n print('the second player won')\r\n else:\r\n print('illegal')\r\n return\r\n if dots:\r\n if x == o:\r\n print('first')\r\n else:\r\n print('second')\r\n else:\r\n print('draw')\r\n\r\n\r\nif __name__ == '__main__':\r\n board = [input() for _ in range(3)]\r\n solve(board)", "a = \"\"\r\nfor _ in range(3):\r\n\ta += input()\r\nx = a.count(\"X\")\r\no = a.count(\"0\")\r\n# print(a)\t\r\nans = []\r\nwin = [(0, 1, 2), (3, 4, 5), (6, 7, 8), (0, 3, 6), (1, 4, 7), (2, 5, 8), (0, 4, 8), (2, 4, 6)]\r\nfor i,j,k in win:\r\n\tif a[i] == a[j] and a[j] == a[k]:\r\n\t\tans.append(a[i])\r\n# print(ans)\r\nif x<o or ('X' in ans and '0' in ans) or ('0' in ans and x>o) or ('X' in ans and x==o) or x-o>1:\r\n\tprint(\"illegal\")\t\r\nelif 'X' in ans:\r\n\tprint(\"the first player won\")\t\r\nelif '0' in ans:\r\n print(\"the second player won\")\r\nelif x==5:\r\n\tprint(\"draw\") \r\nelif x==o:\r\n\tprint(\"first\")\r\nelse:\r\n\tprint(\"second\")\t\t \r\n\r\n", "dx=[-1,-1,-1,0,1,1,1,0]\r\ndy=[-1,0,1,1,1,0,-1,-1]\r\ndef check(a,b):\r\n for i in range(8):\r\n cnt=1\r\n na,nb=a,b\r\n for j in range(1,3):\r\n na+=dx[i]\r\n nb+=dy[i]\r\n if 1<=na<=3 and 1<=nb<=3 and g[a][b]==g[na][nb]:\r\n cnt+=1\r\n if cnt==3:\r\n return True\r\n return False\r\n\r\ng=[[\"\"]*5 for _ in range(5)]\r\nfor i in range(1,4):\r\n line=input().strip()\r\n for j in range(1,4):\r\n g[i][j]=line[j-1]\r\nwina=False\r\nwinb=False\r\nall_empty=True\r\ncnta=0\r\ncntb=0\r\nfor i in range(1,4):\r\n for j in range(1,4):\r\n if g[i][j]==\"X\":\r\n cnta+=1\r\n if check(i,j):\r\n wina=True\r\n elif g[i][j]==\"0\":\r\n cntb+=1\r\n if check(i,j):\r\n winb=True\r\n else:\r\n all_empty=False\r\nif cnta>=cntb and cntb+1>=cnta:\r\n if wina and winb:\r\n print(\"illegal\")\r\n elif wina and cnta-1==cntb:\r\n print(\"the first player won\")\r\n elif winb and cnta==cntb:\r\n print(\"the second player won\")\r\n elif winb or wina:\r\n print(\"illegal\")\r\n elif all_empty:\r\n print(\"draw\")\r\n elif cnta>cntb:\r\n print(\"second\")\r\n else:\r\n print(\"first\")\r\nelse:\r\n print(\"illegal\")", "def triplets(g):\n for r in g:\n yield r\n for c in zip(*g):\n yield \"\".join(c)\n yield \"\".join(r[i] for i, r in enumerate(g))\n yield \"\".join(r[~i] for i, r in enumerate(g))\n\n\ndef win(g, player):\n target = 3 * player\n return any(map(target.__eq__, triplets(g)))\n\n\ndef solve(g):\n x, o = sum(r.count(\"X\") for r in g), sum(r.count(\"0\") for r in g)\n d = x - o\n win_o, win_x = win(g, \"0\"), win(g, \"X\")\n return (\n \"illegal\"\n if d not in (0, 1) or (win_x and d == 0) or (win_o and d == 1)\n else \"the first player won\"\n if win_x\n else \"the second player won\"\n if win_o\n else \"draw\"\n if x + o == 9\n else \"first\"\n if d == 0\n else \"second\"\n )\n\n\nprint(solve(g=[input() for _ in range(3)]))\n", "def get_winner(grid):\r\n for i in grid:\r\n if len(set(i))==1 and i[0] != '.':\r\n return i[0]\r\n for i in range(3):\r\n l=[grid[0][i],grid[1][i],grid[2][i]]\r\n if len(set(l))==1 and l[0] != '.':\r\n return l[0]\r\n if grid[0][0]==grid[1][1]==grid[2][2]:\r\n if grid[0][0] != '.':\r\n return grid[0][0]\r\n if grid[0][-1]==grid[1][-2]==grid[2][-3]:\r\n if grid[0][-1] != '.':\r\n return grid[0][-1]\r\ndef get_move(grid):\r\n o=grid[0].count('0')+grid[1].count('0')+grid[2].count('0')\r\n x=grid[0].count('X')+grid[1].count('X')+grid[2].count('X')\r\n d=grid[0].count('.')+grid[1].count('.')+grid[2].count('.')\r\n if d==0:\r\n return '.'\r\n if o==x:\r\n return 'X'\r\n elif x>o:\r\n return '0'\r\ndef get_answer(grid):\r\n x=o=0\r\n for i in grid:\r\n x+=i.count('X')\r\n o+=i.count('0')\r\n if x<o or x>o+1:\r\n return 'illegal'\r\n we=get_winner(grid)\r\n qw=get_move(grid)\r\n if we==None:\r\n if qw=='X':\r\n return 'first'\r\n elif qw=='0':\r\n return 'second'\r\n else:\r\n return 'draw'\r\n else:\r\n if we==qw:\r\n return 'illegal'\r\n if we=='X':\r\n return 'the first player won'\r\n else:\r\n return 'the second player won'\r\nlol=[]\r\nfor i in range(3):\r\n lol.append(list(input()))\r\nprint(get_answer(lol))", "a = input()\nb = input()\nc = input()\n\nnumx= c.count('X')+b.count('X')+a.count('X') \nnumo= c.count('0')+b.count('0')+a.count('0')\n\npossibilidades =[a,b,c, a[0]+b[1]+c[2], a[2]+b[1]+c[0]] + list(map(''.join, zip(a,b,c)))\n\npri, seg = False, False\n\nif 'XXX' in possibilidades: pri = True\nif '000' in possibilidades: seg = True\n\nif ((numx - numo not in [0,1])) or (seg and numx != numo) or (pri and numx != numo + 1):\n print(\"illegal\")\n\nelif pri:\n print(\"the first player won\")\nelif seg:\n print(\"the second player won\")\n \nelif numx + numo == 9:\n print(\"draw\")\n\nelif numx - numo == 0:\n print(\"first\")\n\nelse:\n print(\"second\")\n\n\n\n\n\n\n\n\t\t \t\t \t\t \t \t\t\t\t \t \t\t", "import math\r\nimport sys\r\nimport queue\r\nimport itertools\r\nfrom heapq import heappop, heappush\r\nimport random\r\n\r\n\r\ndef solve():\r\n def check_win(f, s):\r\n flag = False\r\n for v in range(3):\r\n if f[0][v] + f[1][v] + f[2][v] == s + s + s:\r\n flag = True\r\n for g in range(3):\r\n if f[g] == s + s + s:\r\n flag = True\r\n for d in range(2):\r\n if f[0][2 - d * 2] + f[1][1] + f[2][d * 2] == s + s + s:\r\n flag = True\r\n if flag:\r\n return 1\r\n else:\r\n return 0\r\n\r\n f = [str(input()) for i in range(3)]\r\n x = sum([f[i].count(\"X\") for i in range(3)])\r\n o = sum([f[i].count(\"0\") for i in range(3)])\r\n win_pos = [check_win(f, \"X\"), check_win(f, \"0\")]\r\n\r\n if win_pos == [1, 1] or x - o > 1 or x < o or win_pos == [1, 0] and x == o or win_pos == [0, 1] and x != o:\r\n print(\"illegal\")\r\n return\r\n\r\n if win_pos == [1, 0]:\r\n print(\"the first player won\")\r\n return\r\n elif win_pos == [0, 1]:\r\n print(\"the second player won\")\r\n return\r\n\r\n if x == 5 and o == 4:\r\n print(\"draw\")\r\n else:\r\n if x == o:\r\n print(\"first\")\r\n else:\r\n print(\"second\")\r\n\r\n\r\nif __name__ == '__main__':\r\n multi_test = 0\r\n\r\n if multi_test:\r\n t = int(sys.stdin.readline())\r\n for _ in range(t):\r\n solve()\r\n else:\r\n solve()\r\n", "a,b,c=input(),input(),input()\r\nplayers=[\"first\",\"second\"]\r\nnx=(a+b+c).count('X')\r\nno=(a+b+c).count('0')\r\nd=nx-no\r\ns=[a,b,c,a[0]+b[1]+c[2],a[2]+b[1]+c[0]]+list(map(''.join,zip(a,b,c)))\r\nw=('XXX' in s)+2*('000' in s)-1\r\nif(d not in (0,1)) or w>1 or d==w:\r\n print('illegal')\r\nelif(w>=0):\r\n print('the '+players[w]+' player won')\r\nelif nx+no==9:\r\n print('draw')\r\nelse:\r\n print(players[d])", "def isLegal(g):\n numX = sum(g[i].count('X') for i in range(3))\n numO = sum(g[i].count('0') for i in range(3))\n if numX-numO > 1 or numX-numO < 0:\n return False\n winners = whoWin(g)\n if len(set(winners)) > 1:\n return False\n if len(winners) > 0 and winners[0] == '0' and numX > numO:\n return False\n if len(winners) > 0 and winners[0] == 'X' and numX <= numO:\n return False\n return True\n\ndef whoWin(g):\n winners = []\n for i, j in ((0, 1), (1, 0), (1, 1), (1, 2), (2, 1)):\n if g[i][j] == '.':\n continue\n if i-1 >= 0 and i+1 < 3 and g[i-1][j] == g[i][j] and g[i+1][j] == g[i][j]:\n winners.append(g[i][j])\n if j-1 >= 0 and j+1 < 3 and g[i][j-1] == g[i][j] and g[i][j+1] == g[i][j]:\n winners.append(g[i][j])\n if g[1][1] != '.' and g[0][0] == g[1][1] and g[2][2] == g[1][1]:\n winners.append(g[1][1])\n if g[1][1] != '.' and g[0][2] == g[1][1] and g[2][0] == g[1][1]:\n winners.append(g[1][1])\n return winners\n\ng = [list(input()) for i in range(3)]\n\nif not isLegal(g):\n print('illegal')\n exit()\n\nwinners = whoWin(g)\nif len(winners) > 0:\n print('the ' + ('first' if winners[0] == 'X' else 'second') + ' player won')\n exit()\n\nnumX = sum(g[i].count('X') for i in range(3))\nnumO = sum(g[i].count('0') for i in range(3))\nif numX + numO == 9:\n print('draw')\nelif numX <= numO:\n print('first')\nelse:\n print('second')\n", "board = [[x for x in input().strip()] for y in range(3)]\r\n\r\nxCount = sum([x.count('X') for x in board])\r\noCount = sum([x.count('0') for x in board])\r\n\r\nif oCount > xCount or xCount > oCount+1:\r\n print('illegal')\r\nelif xCount > oCount:\r\n legal = True\r\n if board[0][0] == '0' and board[1][1] == '0' and board[2][2] == '0':\r\n legal = False\r\n elif board[0][2] == '0' and board[1][1] == '0' and board[2][0] == '0':\r\n legal = False\r\n for x in range(3):\r\n if board[x] == ['0','0','0']:\r\n legal = False\r\n if board[0][x] == '0' and board[1][x] == '0' and board[2][x] == '0':\r\n legal = False\r\n if legal:\r\n win = False\r\n if board[0][0] == 'X' and board[1][1] == 'X' and board[2][2] == 'X':\r\n win = True\r\n elif board[0][2] == 'X' and board[1][1] == 'X' and board[2][0] == 'X':\r\n win = True\r\n for x in range(3):\r\n if board[x] == ['X','X','X']:\r\n win = True\r\n if board[0][x] == 'X' and board[1][x] == 'X' and board[2][x] == 'X':\r\n win = True\r\n if win:\r\n print('the first player won')\r\n else:\r\n if xCount + oCount == 9:\r\n print('draw')\r\n else:\r\n print('second')\r\n else:\r\n print('illegal')\r\nelse:\r\n legal = True\r\n if board[0][0] == 'X' and board[1][1] == 'X' and board[2][2] == 'X':\r\n legal = False\r\n elif board[0][2] == 'X' and board[1][1] == 'X' and board[2][0] == 'X':\r\n legal = False\r\n for x in range(3):\r\n if board[x] == ['X','X','X']:\r\n legal = False\r\n if board[0][x] == 'X' and board[1][x] == 'X' and board[2][x] == 'X':\r\n legal = False\r\n if legal:\r\n win = False\r\n if board[0][0] == '0' and board[1][1] == '0' and board[2][2] == '0':\r\n win = True\r\n elif board[0][2] == '0' and board[1][1] == '0' and board[2][0] == '0':\r\n win = True\r\n for x in range(3):\r\n if board[x] == ['0','0','0']:\r\n win = True\r\n if board[0][x] == '0' and board[1][x] == '0' and board[2][x] == '0':\r\n win = True\r\n if win:\r\n print('the second player won')\r\n else:\r\n print('first')\r\n else:\r\n print('illegal')\r\n", "players = [\"first\", \"second\"]\n\na = input()\nb = input()\nc = input()\n\nnx = (a+b+c).count('X')\nno = (a+b+c).count('0')\nd = nx-no\n\ns = [a,b,c,a[0]+b[1]+c[2],a[2]+b[1]+c[0]] + list(map(''.join,zip(a,b,c)))\nw = ('XXX' in s) + 2*('000' in s) -1\n\nif (d not in (0,1)) or w>1 or d==w:\n print('illegal')\nelif w>=0:\n print('the '+players[w]+' player won')\nelif nx+no==9:\n print('draw')\nelse:\n print(players[d])", "def has_three(x):\n if x[0] == x[1] == x[2]:\n if x[0] != '.':\n return x[0]\n return None\n\n\ndef count_all(a):\n crosses, circles = 0, 0\n for ai in a:\n for aij in ai:\n if aij == 'X':\n crosses += 1\n elif aij == '0':\n circles += 1\n return crosses, circles\n\n\na = []\n\nfor i in range(3):\n a.append(list(input()))\n\ncrosses, circles = count_all(a)\nif crosses == circles or crosses == circles + 1:\n to_check = [\n a[0], a[1], a[2],\n [ai[0] for ai in a],\n [ai[1] for ai in a],\n [ai[2] for ai in a],\n [ai[i] for i, ai in enumerate(a)],\n [ai[2-i] for i, ai in enumerate(a)]\n ]\n\n results = [has_three(x) for x in to_check]\n cnt_x, cnt_o = results.count('X'), results.count('0')\n\n if cnt_x >= 1 and cnt_o == 0:\n if crosses != circles + 1:\n print('illegal')\n else:\n print('the first player won')\n elif cnt_o == 1 and cnt_x == 0:\n if crosses != circles:\n print('illegal')\n else:\n print('the second player won')\n elif cnt_x != 0 or cnt_o != 0:\n print('illegal')\n else:\n # game is not over yet\n if crosses == circles:\n print('first')\n elif crosses == circles + 1:\n if crosses == 5:\n print('draw')\n else:\n print('second')\nelse:\n print('illegal')\n", "def verdict(board):\r\n if dic['X']-dic['0']>1 or dic['0']>dic['X']:\r\n print('illegal');\r\n return;\r\n\r\n fx=0;\r\n f0=0;\r\n if board[0][0]!='.' and board[0][0]==board[0][1] and board[0][1]==board[0][2]:\r\n if board[0][0]=='X':\r\n fx=1;\r\n elif board[0][0]=='0':\r\n f0=1;\r\n\r\n if board[1][0]!='.' and board[1][0]==board[1][1] and board[1][1]==board[1][2]:\r\n if board[1][0]=='X':\r\n fx=1;\r\n elif board[1][0]=='0':\r\n f0=1;\r\n \r\n if board[2][0]!='.' and board[2][0]==board[2][1] and board[2][1]==board[2][2]:\r\n if board[2][0]=='X':\r\n fx=1;\r\n elif board[2][0]=='0':\r\n f0=1;\r\n\r\n if board[0][0]!='.' and board[0][0]==board[1][0] and board[1][0]==board[2][0]:\r\n if board[0][0]=='X':\r\n fx=1;\r\n elif board[0][0]=='0':\r\n f0=1;\r\n\r\n if board[0][1]!='.' and board[0][1]==board[1][1] and board[1][1]==board[2][1]:\r\n if board[0][1]=='X':\r\n fx=1;\r\n elif board[0][1]=='0':\r\n f0=1;\r\n\r\n if board[0][2]!='.' and board[0][2]==board[1][2] and board[1][2]==board[2][2]:\r\n if board[0][2]=='X':\r\n fx=1;\r\n elif board[0][2]=='0':\r\n f0=1;\r\n\r\n if board[0][0]!='.' and board[0][0]==board[1][1] and board[1][1]==board[2][2]:\r\n if board[0][0]=='X':\r\n fx=1;\r\n elif board[0][0]=='0':\r\n f0=1;\r\n\r\n if board[0][2]!='.' and board[0][2]==board[1][1] and board[1][1]==board[2][0]:\r\n if board[0][2]=='X':\r\n fx=1;\r\n elif board[0][2]=='0':\r\n f0=1;\r\n\r\n if fx and f0:\r\n print('illegal');\r\n return;\r\n elif fx and not(f0):\r\n if dic['X']-dic['0']!=1:\r\n print('illegal');\r\n else:\r\n print('the first player won');\r\n return;\r\n elif f0 and not(fx):\r\n if dic['X']!=dic['0']:\r\n print('illegal');\r\n else:\r\n print('the second player won');\r\n return;\r\n\r\n if dic['.']==0:\r\n print('draw');\r\n return;\r\n\r\n if dic['X']==dic['0']:\r\n print('first');\r\n return;\r\n elif dic['X']-dic['0']==1:\r\n print('second');\r\n return;\r\n\r\n\r\nboard=[];\r\ndic={'X':0,'0':0, '.':0};\r\nfor i in range(3):\r\n tmp=input();\r\n for j in range(3):\r\n dic[tmp[j]]+=1;\r\n board.append(tmp);\r\n\r\nverdict(board);\r\n", "import sys\r\n\r\nlines = []\r\nfor i in range(0, 3):\r\n lines.append(list(sys.stdin.readline().strip()))\r\ntra_lines = [[lines[0][0], lines[1][0], lines[2][0]], [lines[0][1], lines[1][1], lines[2][1]], [lines[0][2], lines[1][2], lines[2][2]]]\r\n\r\ndiagonal = ''.join([lines[0][0], lines[1][1], lines[2][2]])\r\ntra_diagonal = ''.join([lines[0][2], lines[1][1], lines[2][0]])\r\n\r\ncount_o = 0\r\ncount_x = 0\r\n\r\nfor line in lines:\r\n for col in line:\r\n if col == '0':\r\n count_o += 1\r\n elif col == 'X':\r\n count_x += 1\r\n\r\nfinal = ''\r\nif count_o > count_x or count_x > count_o + 1:\r\n final = 'illegal'\r\nelif ['X', 'X', 'X'] in lines and ['0', '0', '0'] in lines:\r\n final = 'illegal'\r\nelif ['X', 'X', 'X'] in lines and ['0', '0', '0'] not in lines:\r\n final = 'the first player won'\r\nelif ['0', '0', '0'] in lines and ['X', 'X', 'X'] not in lines:\r\n final = 'the second player won'\r\nelif ['X', 'X', 'X'] in tra_lines and ['0', '0', '0'] in tra_lines:\r\n final = 'illegal'\r\nelif ['X', 'X', 'X'] in tra_lines and ['0', '0', '0'] not in tra_lines:\r\n final = 'the first player won'\r\nelif ['0', '0', '0'] in tra_lines and ['X', 'X', 'X'] not in tra_lines:\r\n final = 'the second player won'\r\nelif diagonal == 'XXX' or tra_diagonal == 'XXX':\r\n final = 'the first player won'\r\nelif diagonal == '000' or tra_diagonal == '000':\r\n final = 'the second player won'\r\nelif count_o + count_x == 9:\r\n final = 'draw'\r\nelif count_o == count_x:\r\n final = 'first'\r\nelif count_o == count_x - 1:\r\n final = 'second'\r\n\r\nif final == 'the second player won' and count_x > count_o:\r\n final = 'illegal'\r\nif final == 'the first player won' and count_o == count_x:\r\n final = 'illegal'\r\nprint(final)\r\n", "def f(x, y):\r\n for i in x:\r\n if i==y:\r\n return True\r\n z=[x[0][0]+x[1][0]+x[2][0], x[0][1]+x[1][1]+x[2][1], x[0][2]+x[1][2]+x[2][2]]\r\n z.extend([x[0][0]+x[1][1]+x[2][2], x[0][2]+x[1][1]+x[2][0]])\r\n if y in z:\r\n return True\r\n return False\r\n\r\nw=[input(), input(), input()]\r\na, b, x, y=0, 0, 0, 0\r\nfor i in w:\r\n if i==\"XXX\":\r\n x+=1\r\n if i==\"000\":\r\n y+=1\r\n for j in i:\r\n if j==\"X\":\r\n a+=1\r\n if j==\"0\":\r\n b+=1\r\nif a>b+1 or b>a or (f(w, \"XXX\") and f(w, \"000\")):\r\n print(\"illegal\")\r\nelif (f(w, 'XXX') and a!=b+1) or (f(w, \"000\") and a!=b):\r\n print(\"illegal\")\r\nelif f(w, \"XXX\"):\r\n print(\"the first player won\")\r\nelif f(w, \"000\"):\r\n print(\"the second player won\")\r\nelif a+b==9:\r\n print(\"draw\")\r\nelif a==b:\r\n print(\"first\")\r\nelse:\r\n print(\"second\")\r\n ", "import sys\n\ndef check_win(board,player):\n # rows\n for i in range(0,3):\n if board[i][0] == board[i][1] == board[i][2] == player:\n return True\n # columns\n for i in range(0,3):\n if board[0][i] == board[1][i] == board[2][i] == player:\n return True\n # diagonals\n if board[0][0] == board[1][1] == board[2][2] == player:\n return True\n if board[2][0] == board[1][1] == board[0][2] == player:\n return True\n return False\n\nboard = []\nfor i in range(0,3):\n board.append(list(sys.stdin.readline()))\n\ncount_o = sum([row.count('0') for row in board])\ncount_x = sum([row.count('X') for row in board])\n\nif count_x == count_o + 1:\n # Only the first player could have won if he made the last move\n if check_win(board,'0'):\n print(\"illegal\")\n elif check_win(board,'X'):\n print(\"the first player won\")\n elif count_x == 5:\n print(\"draw\")\n else:\n print(\"second\")\nelif count_x == count_o:\n if check_win(board,'X'):\n print(\"illegal\")\n elif check_win(board,'0'):\n print(\"the second player won\")\n else:\n print(\"first\")\nelse:\n print(\"illegal\")\n", "def winState(w, matrix):\r\n if matrix[0][0] == w and matrix[0][1] == w and matrix[0][2] == w:\r\n return True\r\n if matrix[1][0] == w and matrix[1][1] == w and matrix[1][2] == w:\r\n return True\r\n if matrix[2][0] == w and matrix[2][1] == w and matrix[2][2] == w:\r\n return True\r\n if matrix[0][0] == w and matrix[1][0] == w and matrix[2][0] == w:\r\n return True\r\n if matrix[0][1] == w and matrix[1][1] == w and matrix[2][1] == w:\r\n return True\r\n if matrix[0][2] == w and matrix[1][2] == w and matrix[2][2] == w:\r\n return True\r\n if matrix[0][0] == w and matrix[1][1] == w and matrix[2][2] == w:\r\n return True\r\n if matrix[0][2] == w and matrix[1][1] == w and matrix[2][0] == w:\r\n return True\r\n return False\r\n\r\n\r\ngame = []\r\nfirst = input()\r\nsecond = input()\r\nthird = input()\r\ngame.append(first)\r\ngame.append(second)\r\ngame.append(third)\r\n\r\nnumX = 0\r\nnumO = 0\r\nfor row in range(3):\r\n for col in range(3):\r\n if game[row][col] == 'X':\r\n numX += 1\r\n elif game[row][col] == '0':\r\n numO += 1\r\n\r\nif numX > numO + 1 or numO > numX:\r\n print(\"illegal\")\r\nelif winState('X', game) and winState('0', game):\r\n print(\"illegal\")\r\nelif winState('X', game) and numX != numO + 1:\r\n print(\"illegal\")\r\nelif winState('0', game) and numX != numO:\r\n print(\"illegal\")\r\nelif winState('X', game) and not winState('0', game):\r\n print(\"the first player won\")\r\nelif winState('0', game) and not winState('X', game):\r\n print(\"the second player won\")\r\nelif numX == numO + 1 and numX < 5:\r\n print(\"second\")\r\nelif numX == numO:\r\n print(\"first\")\r\nelif numX == 5 and numO == 4:\r\n print(\"draw\")\r\n", "b = input() + input() + input()\r\ncX, c0 = b.count('X'), b.count('0')\r\nw = {b[i] for i, j, k in ((0, 1, 2), (3, 4, 5), (6, 7, 8), (0, 3, 6), (1, 4, 7), (2, 5, 8), (0, \\\r\n4, 8), (2, 4, 6)) if b[i] == b[j] and b[j] == b[k]}\r\nif not c0 in (cX - 1, cX) or 'X' in w and '0' in w:\r\n print('illegal')\r\nelif 'X' in w:\r\n print('the first player won' if cX > c0 else 'illegal')\r\nelif '0' in w:\r\n print('the second player won' if c0 == cX else 'illegal')\r\nelif cX == 5:\r\n print('draw')\r\nelse:\r\n print('first' if cX == c0 else 'second')", "players = [\"first\", \"second\"]\r\n\r\na = input()\r\nb = input()\r\nc = input()\r\n\r\nnx = (a + b + c).count('X')\r\nno = (a + b + c).count('0')\r\nd = nx - no\r\n\r\ns = [a, b, c, a[0] + b[1] + c[2], a[2] + b[1] + c[0]] + list(map(''.join, zip(a, b, c)))\r\nw = ('XXX' in s) + 2 * ('000' in s) - 1\r\n\r\nif (d not in (0, 1)) or w > 1 or d == w:\r\n print('illegal')\r\nelif w >= 0:\r\n print('the ' + players[w] + ' player won')\r\nelif nx + no == 9:\r\n print('draw')\r\nelse:\r\n print(players[d])", "import math\r\n\r\nboard = []\r\nmarks = {\r\n '.': 0,\r\n 'X': 0,\r\n '0': 0\r\n}\r\nfor _ in range(3):\r\n row = list(input())\r\n board.append(row)\r\n for el in row:\r\n marks[el] += 1\r\n\r\ndef check():\r\n win = 0\r\n winner = 'no'\r\n\r\n for i in range(3):\r\n if set(board[i]) in [{'X'}, {'0'}] and winner != board[i][0]:\r\n win += 1\r\n winner = board[i][0]\r\n if set([board[0][i], board[1][i], board[2][i]]) in [{'X'}, {'0'}] and winner != board[0][i]:\r\n win += 1\r\n winner = board[0][i]\r\n if set([board[0][0], board[1][1], board[2][2]]) in [{'X'}, {'0'}] and winner != board[1][1]:\r\n win += 1\r\n winner = board[1][1]\r\n if set([board[2][0], board[1][1], board[0][2]]) in [{'X'}, {'0'}] and winner != board[1][1]:\r\n win += 1\r\n winner = board[1][1]\r\n \r\n if win == 0:\r\n return 'no'\r\n elif win > 1:\r\n return 'illegal'\r\n else:\r\n if winner == 'X':\r\n return 'the first player won'\r\n elif winner == '0':\r\n return 'the second player won'\r\n else:\r\n return 'no'\r\n\r\nfilled = 9 - marks['.']\r\nif math.ceil(filled / 2) != marks['X'] or math.floor(filled / 2) != marks['0']:\r\n print('illegal')\r\nelif filled in [0, 2, 4]:\r\n print('first')\r\nelif filled in [1, 3]:\r\n print('second')\r\nelif filled in [5, 7]:\r\n if check() == 'the first player won':\r\n print('the first player won')\r\n elif check() == 'the second player won':\r\n print('illegal')\r\n elif check() == 'illegal':\r\n print('illegal')\r\n else:\r\n print('second')\r\nelif filled in [6, 8]:\r\n if check() == 'the first player won':\r\n print('illegal')\r\n elif check() == 'the second player won':\r\n print('the second player won')\r\n elif check() == 'illegal':\r\n print('illegal')\r\n else:\r\n print('first')\r\nelif filled == 9:\r\n if check() == 'the first player won':\r\n print('the first player won')\r\n elif check() == 'the second player won':\r\n print('illegal')\r\n elif check() == 'illegal':\r\n print('illegal')\r\n else:\r\n print('draw')", "import math,sys,re,itertools,pprint,collections,copy\r\nri,rai=lambda:int(input()),lambda:list(map(int, input().split()))\r\n\r\ncx, c0 = 0, 0\r\na = []\r\nfor line in sys.stdin.readlines()[:3]:\r\n a.append(list(line.strip()))\r\n cx += a[-1].count('X')\r\n c0 += a[-1].count('0')\r\n\r\nb = []\r\ns1, s2 = \"\", \"\"\r\nfor i in range(3):\r\n s1 += a[i][i]\r\n s2 += a[i][2 - i]\r\nb += [s1, s2]\r\nfor i in range(3):\r\n s1, s2 = \"\", \"\"\r\n for j in range(3):\r\n s1 += a[i][j]\r\n s2 += a[j][i]\r\n b += [s1, s2]\r\n\r\ndef is_draw():\r\n return cx == 5 and c0 == 4\r\n\r\ndef is_illegal():\r\n if not (0 <= cx - c0 <= 1) or (\"XXX\" in b and \"000\" in b):\r\n return True\r\n if \"XXX\" in b and c0 == cx:\r\n return True\r\n if \"000\" in b and cx > c0:\r\n return True\r\n\r\nif is_illegal():\r\n print(\"illegal\")\r\nelse:\r\n if \"XXX\" in b:\r\n print(\"the first player won\")\r\n elif \"000\" in b:\r\n print(\"the second player won\")\r\n else:\r\n if is_draw():\r\n print(\"draw\")\r\n else:\r\n if cx > c0:\r\n print(\"second\")\r\n else:\r\n print(\"first\")\r\n", "a1 = input()\r\na2 = input()\r\na3 = input()\r\n\r\na, b, c = a1[0], a1[1], a1[2]\r\nd, e, f = a2[0], a2[1], a2[2]\r\ng, h, i = a3[0], a3[1], a3[2]\r\n\r\nboard = [a, b, c, d, e, f, g, h, i]\r\nx = board.count('X')\r\no = board.count('0')\r\n\r\ndef yesx(a, b, c, d, e, f, g, h, i):\r\n if a==b==c=='X' or d==e==f=='X' or g==h==i=='X' or a==e==i=='X' or c==e==g=='X' or a==d==g=='X' or b==e==h=='X' or c==f==i=='X':\r\n return True\r\n else:\r\n return False\r\ndef yesx2(a, b, c, d, e, f, g, h, i):\r\n if a==b==c=='0' or d==e==f=='0' or g==h==i=='0' or a==e==i=='0' or c==e==g=='0' or a==d==g=='0' or b==e==h=='0' or c==f==i=='0':\r\n return True\r\n else:\r\n return False\r\n\r\nif not(x == o or x-o == 1):\r\n print(\"illegal\")\r\nelse:\r\n if yesx(a, b, c, d, e, f, g, h, i):\r\n if not yesx2(a, b, c, d, e, f, g, h, i) and x != o:\r\n print(\"the first player won\")\r\n else:\r\n print(\"illegal\")\r\n elif yesx2(a, b, c, d, e, f, g, h, i):\r\n if not yesx(a, b, c, d, e, f, g, h, i) and x == o:\r\n print(\"the second player won\")\r\n else:\r\n print(\"illegal\")\r\n else:\r\n if '.' not in [a, b, c, d, e, f, g, h, i]:\r\n print(\"draw\")\r\n else:\r\n if x > o:\r\n print(\"second\")\r\n else:\r\n print(\"first\")\r\n", "def win(l,s):\r\n if l[0] == [s, s, s] or l[1] == [s, s, s] or l[2] == [s, s, s] or l[0][0] == s and l[1][0] == s and l[2][0] == s or \\\r\n l[0][1] == s and l[1][1] == s and l[2][1] == s or l[0][2] == s and l[1][2] == s and l[2][2] == s or l[0][\r\n 0] == s and l[1][1] == s and l[2][2] == s or l[0][2] == s and l[1][1] == s and l[2][0] == s:\r\n return 1\r\n else:\r\n return 0\r\na=list(input())\r\nb=list(input())\r\nc=list(input())\r\nl=[a,b,c]\r\nmf=a.count('X')+b.count('X')+c.count('X')\r\nms=a.count('0')+b.count('0')+c.count('0')\r\nme=a.count('.')+b.count('.')+c.count('.')\r\nif mf -ms!= 1 and mf -ms!=0 :\r\n print('illegal')\r\nelse:\r\n n=win(l,'0')\r\n m=win(l,'X')\r\n if n==1 and m==1 or n==1 and mf-ms!=0 or m==1 and mf-ms!=1:\r\n print('illegal')\r\n elif n==1:\r\n print('the second player won')\r\n elif m==1:\r\n print('the first player won')\r\n else:\r\n if me==0:\r\n print('draw')\r\n elif mf-ms==1:\r\n print('second')\r\n else:print('first')\r\n", "from sys import stdin\r\ninput=stdin.readline\r\nmatrix = [list(input()) for _ in range(3)]\r\nxCount = 0\r\noCount = 0\r\nfor i in range(3):\r\n for j in range(3):\r\n if matrix[i][j] == 'X':\r\n xCount += 1\r\n elif matrix[i][j] == '0':\r\n oCount += 1\r\n\r\nif abs(xCount - oCount) >= 2 or xCount < oCount:\r\n print('illegal')\r\n exit()\r\n\r\nresult = ''\r\nfor i in range(3):\r\n temp = ''\r\n if matrix[i][0] == matrix[i][1] == matrix[i][2] == 'X':\r\n temp = 'the first player won' if xCount > oCount else 'illegal'\r\n elif matrix[i][0] == matrix[i][1] == matrix[i][2] == '0':\r\n temp = 'the second player won' if xCount == oCount else 'illegal'\r\n elif matrix[0][i] == matrix[1][i] == matrix[2][i] == 'X':\r\n temp = 'the first player won' if xCount > oCount else 'illegal'\r\n elif matrix[0][i] == matrix[1][i] == matrix[2][i] == '0':\r\n temp = 'the second player won' if xCount == oCount else 'illegal'\r\n if len(temp) > 0 and temp != result:\r\n result = 'illegal' if len(result) > 0 else temp\r\n if result == 'illegal':\r\n break\r\n\r\nif len(result) > 0:\r\n print(result)\r\n exit()\r\n\r\nif matrix[0][0] == matrix[1][1] == matrix[2][2] == 'X':\r\n result = 'the first player won' if xCount > oCount else 'illegal'\r\nelif matrix[0][0] == matrix[1][1] == matrix[2][2] == '0':\r\n result = 'the second player won' if xCount == oCount else 'illegal'\r\nelif matrix[0][2] == matrix[1][1] == matrix[2][0] == 'X':\r\n result = 'the first player won' if xCount > oCount else 'illegal'\r\nelif matrix[0][2] == matrix[1][1] == matrix[2][0] == '0':\r\n result = 'the second player won' if xCount == oCount else 'illegal'\r\n\r\nif len(result) > 0:\r\n print(result)\r\n exit()\r\n\r\nif xCount + oCount == 9:\r\n print('draw')\r\nelif xCount == oCount:\r\n print('first')\r\nelse:\r\n print('second')", "s = []\r\nx, o = 0, 0\r\nfor i in range(3):\r\n s.append(input())\r\n for c in s[i]:\r\n if c == 'X':\r\n x += 1\r\n elif c == '0':\r\n o += 1\r\n else:\r\n continue\r\nif x<o or x-o>1:\r\n print ('illegal')\r\nelse:\r\n f1, f2 = False, False\r\n if s[0][0]==s[1][0] and s[1][0]==s[2][0] and s[0][0]!='.':\r\n if s[0][0] == 'X':\r\n f1 = True\r\n else:\r\n f2 = True\r\n if s[0][1]==s[1][1] and s[1][1]==s[2][1] and s[0][1]!='.':\r\n if s[0][1] == 'X':\r\n f1 = True\r\n else:\r\n f2 = True\r\n if s[0][2]==s[1][2] and s[1][2]==s[2][2] and s[0][2]!='.':\r\n if s[0][2] == 'X':\r\n f1 = True\r\n else:\r\n f2 = True\r\n if s[0][0]==s[0][1] and s[0][1]==s[0][2] and s[0][0]!='.':\r\n if s[0][0] == 'X':\r\n f1 = True\r\n else:\r\n f2 = True\r\n if s[1][0]==s[1][1] and s[1][1]==s[1][2] and s[1][0]!='.':\r\n if s[1][0] == 'X':\r\n f1 = True\r\n else:\r\n f2 = True\r\n if s[2][0]==s[2][1] and s[2][1]==s[2][2] and s[2][0]!='.':\r\n if s[2][0] == 'X':\r\n f1 = True\r\n else:\r\n f2 = True\r\n if s[0][0]==s[1][1] and s[1][1]==s[2][2] and s[0][0]!='.':\r\n if s[0][0]=='X':\r\n f1 = True\r\n else:\r\n f2 = True\r\n if s[0][2]==s[1][1] and s[1][1]==s[2][0] and s[0][2]!='.':\r\n if s[0][2]=='X':\r\n f1 = True\r\n else:\r\n f2 = True\r\n ret = None\r\n if f1 and f2:\r\n ret = 'illegal'\r\n elif (f1 and not f2):\r\n if x == o:\r\n ret = 'illegal'\r\n else:\r\n ret = 'the first player won'\r\n elif (f2 and not f1):\r\n if x > o:\r\n ret = 'illegal'\r\n else:\r\n ret = 'the second player won'\r\n else:\r\n if x + o == 9:\r\n ret = 'draw'\r\n else:\r\n if x > o:\r\n ret = 'second'\r\n else:\r\n ret = 'first'\r\n print (ret)", "#! python3\n# tic_tac_toe.py -\n# judge: first, second, illegal, the first player won, the second player won, draw\n\nimport sys\n\ndef judge_victory(board):\n lines = [[(i, j) for j in range(3)] for i in range(3)]\n lines += [[(j, i) for j in range(3)] for i in range(3)]\n lines += [[(i, i) for i in range(3)]]\n lines += [[(2-i, i) for i in range(3)]]\n\n line_judge = []\n for line in lines:\n line_chrs = [ board[point[0]][point[1]] for point in line]\n if line_chrs.count('X') == 3:\n line_judge.append('X')\n elif line_chrs.count('0') == 3:\n line_judge.append('0')\n else:\n line_judge.append('N')\n\n if line_judge.count('X') == 1 or line_judge.count('X') == 2:\n return 'first player'\n elif line_judge.count('0') == 1:\n return 'second player'\n elif line_judge.count('X') > 1 or line_judge.count('0') > 1:\n return 'illegal'\n else:\n return 'no victory'\n\ndef next_hand(board):\n first_hand_num = sum([li.count('X') for li in board])\n second_hand_num = sum([li.count('0') for li in board])\n if first_hand_num == 5 and second_hand_num == 4:\n return 'ended'\n elif first_hand_num - second_hand_num == 1:\n return 'second'\n elif first_hand_num - second_hand_num == 0:\n return 'first'\n else:\n return 'illegal'\n\n# input\njudge = ''\nboard = [ list(input()) for i in range(3)]\n\n# hand num\nnext_hand_judge = next_hand(board)\nplayer_judge_victory = judge_victory(board)\n\nif next_hand_judge == 'illegal' or player_judge_victory == 'illegal':\n print('illegal')\nelif player_judge_victory == 'no victory':\n if next_hand_judge == 'ended':\n print('draw')\n else:\n print(next_hand_judge)\nelif player_judge_victory == 'first player':\n if next_hand_judge == 'first':\n print('illegal')\n else:\n print('the first player won')\nelif player_judge_victory == 'second player':\n if next_hand_judge == 'first':\n print('the second player won')\n else:\n print('illegal')\n", "# Read the input grid\ngrid = [list(input()) for _ in range(3)]\n\n# Function to check if a player has won\ndef check_winner(player):\n for i in range(3):\n if all(grid[i][j] == player for j in range(3)) or all(grid[j][i] == player for j in range(3)):\n return True\n if all(grid[i][i] == player for i in range(3)) or all(grid[i][2 - i] == player for i in range(3)):\n return True\n return False\n\n# Count X and O\ncount_X = sum(row.count('X') for row in grid)\ncount_O = sum(row.count('0') for row in grid)\n\n# Check if the number of Xs and Os are valid\nif count_X < count_O or count_X > count_O + 1:\n print(\"illegal\")\nelif check_winner('X'):\n if check_winner('0') or count_X <= count_O:\n print(\"illegal\")\n else:\n print(\"the first player won\")\nelif check_winner('0'):\n if count_X > count_O:\n print(\"illegal\")\n else:\n print(\"the second player won\")\nelif count_X + count_O == 9:\n print(\"draw\")\nelse:\n if count_X == count_O:\n print(\"first\")\n else:\n print(\"second\")\n", "board = [input() for _ in range(3)]\n\n# count the number of X's and O's\nnum_x = sum(row.count('X') for row in board)\nnum_o = sum(row.count('0') for row in board)\n\n# check for an illegal board\nif num_x - num_o not in [0, 1]:\n print(\"illegal\")\n exit()\n\n# check for a winning board\nwinning_positions = [\n # horizontal\n [(0,0), (0,1), (0,2)],\n [(1,0), (1,1), (1,2)],\n [(2,0), (2,1), (2,2)],\n # vertical\n [(0,0), (1,0), (2,0)],\n [(0,1), (1,1), (2,1)],\n [(0,2), (1,2), (2,2)],\n # diagonal\n [(0,0), (1,1), (2,2)],\n [(2,0), (1,1), (0,2)]\n]\n\nfor pos in winning_positions:\n values = [board[row][col] for row, col in pos]\n if values == ['X', 'X', 'X']:\n if num_x == num_o:\n print(\"illegal\")\n else:\n print(\"the first player won\")\n exit()\n elif values == ['0', '0', '0']:\n if num_x > num_o:\n print(\"illegal\")\n else:\n print(\"the second player won\")\n exit()\n\n# check for a draw or next player\nif '.' in ''.join(board):\n if num_x == num_o:\n print(\"first\")\n else:\n print(\"second\")\nelse:\n print(\"draw\")\n\n\t\t\t \t \t\t \t \t\t\t \t\t \t \t", "import math\r\nimport random \r\nimport time\r\nfrom collections import defaultdict\r\n \r\n \r\nalfabet = {'a': 1, 'b': 2,'c': 3,'d': 4,'e': 5,'f': 6,'g': 7,'h': 8,'i': 9,'j': 10,'k': 11,'l': 12,'m': 13,'n': 14,'o': 15,'p': 16,'q': 17,'r': 18,'s': 19,'t': 20,'u': 21,'v': 22,'w': 23,'x': 24,'y': 25,'z': 26}\r\nalfabet_2={'1':\"a\", '2':\"b\", '3':\"c\", '4':\"d\", '5':\"e\", '6':\"f\", '7':\"g\", '8':\"h\", '9':\"i\", '10':\"j\", '11':\"k\", '12':\"l\", '13':\"m\", '14':\"n\", '15':\"o\", '16':\"p\", '17':\"q\", '18':\"r\", '19':\"s\", '20':\"t\", '21':\"u\", '22':\"v\", '23':\"w\", '24':\"x\", '25':\"y\", '26':\"z\"}\r\n \r\n \r\n \r\ndef prime_generator(nr_elemente_prime):\r\n \r\n vector_prime=[-1]*nr_elemente_prime\r\n vector_rasp=[0]*nr_elemente_prime\r\n \r\n vector_prime[1]=1\r\n \r\n vector_rasp[1]=1\r\n#primes sieve \r\n contor=2\r\n \r\n for i in range(2,nr_elemente_prime):\r\n if vector_prime[i]==-1:\r\n vector_prime[i]=1\r\n vector_rasp[contor]=i\r\n contor=contor+1\r\n for j in range(i+i,nr_elemente_prime,i):\r\n if vector_prime[j]==-1:\r\n vector_prime[j]=i\r\n #print(i,j)\r\n \r\n \r\n \r\n set_prime=set(vector_rasp)\r\n set_prime.remove(0)\r\n set_prime.remove(1)\r\n \r\n answ_prime=list(set_prime)\r\n answ_prime.sort()\r\n return answ_prime\r\n \r\ndef binary_search(vector,valoarea):\r\n \r\n left=0\r\n right=len(vector)-1\r\n \r\n while left<=right:\r\n \r\n \r\n centru=(left+right)//2\r\n # print(left,right,centru,vector[centru])\r\n \r\n if vector[centru]<=valoarea:\r\n left=centru+1\r\n else:\r\n right=centru-1\r\n \r\n# print(left,right,centru,vector[centru]) \r\n return left\r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\ndef main():\r\n answ=[]\r\n pp=10**9\r\n# teste=int(input())\r\n \r\n matrice=[[] for x in range(3)]\r\n for gg in range(1):\r\n \r\n for tt in range(3):\r\n stringul=input()\r\n #n=len(stringul)\r\n #answer=''\r\n #n=int(input())\r\n for j in stringul:\r\n matrice[tt].append(j)\r\n \r\n # lista=list(map(int,input().split()))\r\n \r\n #print(matrice)\r\n \r\n cate_x=0\r\n cate_0=0\r\n \r\n win_x=0\r\n win_0=0\r\n \r\n for randuri in range(3):\r\n partial_x=0\r\n partial_0=0\r\n \r\n for j in range(3):\r\n if matrice[randuri][j]=='X':\r\n cate_x+=1\r\n partial_x+=1\r\n \r\n elif matrice[randuri][j]=='0':\r\n cate_0+=1\r\n partial_0+=1\r\n \r\n if partial_x==3:\r\n win_x+=1\r\n if partial_0==3:\r\n win_0+=1\r\n \r\n for coloane in range(3):\r\n partial_x=0\r\n partial_0=0\r\n for i in range(3):\r\n if matrice[i][coloane]=='X':\r\n partial_x+=1\r\n \r\n elif matrice[i][coloane]=='0':\r\n partial_0+=1\r\n \r\n if partial_x==3:\r\n win_x+=1\r\n if partial_0==3:\r\n win_0+=1 \r\n \r\n #print(cate_x,cate_0)\r\n #print(win_x,win_0)\r\n \r\n if matrice[0][0]=='X' and matrice[1][1]=='X' and matrice[2][2]=='X':\r\n win_x+=1\r\n \r\n if matrice[0][0]=='0' and matrice[1][1]=='0' and matrice[2][2]=='0':\r\n win_0+=1 \r\n \r\n if matrice[0][2]=='X' and matrice[1][1]=='X' and matrice[2][0]=='X':\r\n win_x+=1\r\n \r\n if matrice[0][2]=='0' and matrice[1][1]=='0' and matrice[2][0]=='0':\r\n win_0+=1 \r\n \r\n \r\n if win_x>2 or win_0>2 or win_x*win_0>=1 or cate_x>cate_0+1 or cate_0 >cate_x:\r\n print(\"illegal\")\r\n else:\r\n if win_x>0 and cate_0>=cate_x:\r\n print(\"illegal\")\r\n elif win_0>0 and cate_x>cate_0:\r\n print(\"illegal\")\r\n \r\n \r\n elif win_x>0:\r\n print(\"the first player won\")\r\n elif win_0>0:\r\n print(\"the second player won\")\r\n elif cate_x+cate_0==9:\r\n print(\"draw\") \r\n elif cate_x>cate_0:\r\n print(\"second\")\r\n else:\r\n print(\"first\")\r\n \r\n \r\nmain()" ]

[ "n, m = [int(x) for x in input().split()]\nlist1 = []\nlist2 = []\nfor i in range(n):\n list1.append(input())\n\nfor j in range(m):\n list2.append(input())\n\nlist3 = []\nfor i in range(n - m + 1):\n y = \"\"\n for j in range(m):\n y += list1[j + i]\n list3.append(y)\n\nlist4 = []\nfor i in range(n - m + 1):\n y = \"\"\n for j in range(m):\n y += list2[j][i:i + m]\n list4.append(y)\n\nfor i in list3:\n if i in list4:\n print(list3.index(i) + 1, list4.index(i) + 1)\n quit()\n", "n, m = list(map(int, input().strip().split(' ')))\r\nmat1, mat2 = [], []\r\nfor i in range(0, n): mat1.append(tuple(input().strip()))\r\nfor i in range(0, m): mat2.append(tuple(input().strip()))\r\nix, jx, flg = -1, -1, 0\r\nmatr, matc = [], []\r\nfor i in range(0, n-m+1):\r\n\tsi, se = i, i+m\r\n\tmatr.append(hash(tuple(mat1[si:se])))\r\n\tmatcur2 = []\r\n\tfor c2i in range(0, m): matcur2.append(tuple(mat2[c2i][si:se]))\r\n\tmatc.append(hash(tuple(matcur2)))\r\nnx = len(matr)\r\nix, jx = -1, -1\r\nfor ix in range(0, nx):\r\n\tflg=0\r\n\tfor jx in range(0, nx):\r\n\t\tif matr[ix]==matc[jx]:\r\n\t\t\tflg=1\r\n\t\t\tbreak\r\n\tif flg==1: break\r\nprint(str(ix+1)+\" \"+str(jx+1))", "n, m = list(map(int, input().strip().split(' ')))\r\nL, M = [], []\r\nfor i in range(n):\r\n L.append(tuple(input().strip()))\r\n\r\nfor i in range(0, m):\r\n M.append(tuple(input().strip()))\r\n\r\nk=0\r\nrow, col = [], []\r\nfor i in range(n-m+1):\r\n\tinit, end = i, i+m\r\n\trow.append(hash(tuple(L[init:end])))\r\n\t\r\n\tD = []\r\n\tfor j in range(0, m):\r\n\t D.append(tuple(M[j][init:end]))\r\n\tcol.append(hash(tuple(D)))\r\n\r\nfor ix in range(len(row)):\r\n\tk=0\r\n\tfor jx in range(len(row)):\r\n\t\tif row[ix]==col[jx]:\r\n\t\t\tk=1\r\n\t\t\tbreak\r\n\tif k==1:\r\n\t break\r\n\r\nprint(ix+1,end=' ')\r\nprint(jx+1)", "n,m=list(map(int,input().split()))\r\ns=[]\r\nh=[]\r\nmod=10**9\r\nmod+=7\r\nfor i in range(n):\r\n s=(input())\r\n s=s.lower()\r\n hw=0\r\n for i in range(m):\r\n hw+=ord(s[i])*(10**(m-i))\r\n h.append(hw%mod)\r\nh1=[[] for i in range(n-m+1)]\r\nfor i in range(m):\r\n hw=0\r\n s=input()\r\n s=s.lower()\r\n aux=[]\r\n for i in range(m):\r\n hw+=ord(s[i])*(10**(m-i))\r\n hw%=mod\r\n h1[0].append(hw)\r\n yy=1\r\n for i in range(m,n):\r\n hw-=(ord(s[i-m])*(10**(m)))\r\n hw*=10\r\n hw+=(ord(s[i])*(10))\r\n hw%=mod\r\n h1[yy].append(hw)\r\n yy+=1\r\nt=False\r\ny=0\r\nfor i in range(len(h1)):\r\n x=0\r\n while x<n-m+1:\r\n if h1[i][0]==h[x]:\r\n y=0\r\n ans=[x+1,i+1]\r\n while y<m and h1[i][y]==h[x]:\r\n x+=1\r\n y+=1\r\n else:\r\n x+=1\r\n \r\n if y==m:\r\n break\r\n if y==m:\r\n break\r\nprint(ans[0],ans[1])\r\n" ]

[ "import heapq\r\nn = int(input())\r\ntotLength = 0\r\nallNames = []\r\nused = {}\r\nnamesOfLength = [[] for i in range(11)]\r\nfor o in range(n):\r\n s = input()\r\n totLength += len(s)\r\n allNames.append(s)\r\n namesOfLength[len(s)].append(s)\r\nd = input()\r\nfor i in range(n):\r\n allNames[i] += d\r\nallNames.sort()\r\ncharPerLine = 2*totLength/n\r\nfor i in range(11):\r\n heapq.heapify(namesOfLength[i])\r\nfor i in range(n):\r\n if used.get(allNames[i],False) == True:\r\n continue\r\n length = len(allNames[i])-1\r\n used[allNames[i]] = True\r\n otherLength = int(charPerLine - length)\r\n heapq.heappop(namesOfLength[length])\r\n line = \"\"\r\n line += allNames[i]\r\n otherWord = heapq.heappop(namesOfLength[otherLength])\r\n used[otherWord+d] = True\r\n line += otherWord\r\n print(line)", "n = int(input()) // 2\r\na = sorted([input() for i in range(n * 2)], reverse = 1)\r\nd = input()\r\nL = sum(len(i) for i in a) // n\r\nans = []\r\nfor i in range(n):\r\n x = a.pop()\r\n for y in a[::-1]:\r\n if len(x) + len(y) == L:\r\n ans.append(min(x + d + y, y + d + x))\r\n a.remove(y)\r\n break\r\nprint('\\n'.join(sorted(ans)))\r\n", "from collections import deque\r\n\r\nn = int(input())\r\na = [input() for i in range(n)]\r\na.sort()\r\n\r\ndq = deque(a)\r\n\r\n# print(dq)\r\n\r\nd = input()\r\nn //= 2\r\ncommon_len = sum(len(s) for s in a) // n\r\nres = []\r\n\r\nfor i in range(n):\r\n s1 = dq.popleft()\r\n for s2 in dq:\r\n if len(s1) + len(s2) == common_len:\r\n dq.remove(s2)\r\n res.append(min(s1+d+s2, s2+d+s1))\r\n break\r\n\r\nfor x in sorted(res):\r\n print(x)" ]

[ "N = int(input())\r\n\r\nfr, sr = [ int(i) for i in input().split() ], [ int(i) for i in input().split() ]\r\ncross = [ int(i) for i in input().split() ]\r\n\r\nspend_time = [sum(sr) + cross[0]]\r\nfor i in range(1, N):\r\n summ = spend_time[-1] - sr[i - 1] - cross[i - 1]\r\n summ = summ + fr[i - 1] + cross[i]\r\n spend_time.append(summ)\r\n\r\nspend_time.sort()\r\nprint(spend_time[0] + spend_time[1])", "n = int(input())\r\nline1 = list(map(int,input().split()))\r\nline2 = list(map(int,input().split()))\r\nline3 = list(map(int,input().split()))\r\n\r\ndistanceList=[line3[0] + sum(line2)]\r\n\r\nfor i in range(1,n-1):\r\n distanceList.append(sum(line1[:i])+sum(line2[i-n+1:])+line3[i])\r\n\r\ndistanceList.append(line3[n-1]+sum(line1))\r\n\r\ndistanceList.sort()\r\nprint(distanceList[0]+distanceList[1])", "n = int(input())\r\nH1 = list(map(int, input().split()))\r\nH2 = list(map(int, input().split()))\r\nav = list(map(int, input().split()))\r\nans = []\r\nfor i in range(n - 1):\r\n ans.append(sum(H1[:i]) + av[i] + sum(H2[i:]))\r\nans.append(sum(H1) + av[-1])\r\nans.sort()\r\nprint(ans[0] + ans[1])\r\n", "def main():\n input()\n a, b, c = (list(map(int, input().split())) for _ in \"abc\")\n u, res = sum(b), []\n for x, y, z in zip(a, b, c):\n res.append(u + z)\n u += x - y\n res.append(u + c[-1])\n print(sum(sorted(res)[:2]))\n\n\nif __name__ == '__main__':\n main()\n", "n = int(input())\nrow1 = list(map(int, input().split()))\nrow2 = list(map(int, input().split()))\nvert = list(map(int, input().split()))\nlo = float('inf')\nres = 0\nfirstcross = 0\nsecondcross = 0\nfor i in range(n):\n #print(\"i\", i)\n cur = vert[i]\n cur += sum(row2[i:])\n cur += sum(row1[:i])\n #print(cur)\n if cur < lo:\n firstcross = i\n lo = cur\n#print(\"cross\", firstcross)\nres += lo\nlo = float('inf')\nfor i in range(n):\n #print(\"i\", i)\n cur = vert[i]\n for j in range(i):\n #print(\"j row1\", j)\n cur += row1[j]\n for j in range(i, n-1):\n #print(\"j row2\", j)\n cur += row2[j]\n #print(cur)\n if cur < lo and i != firstcross:\n lo = cur\n secondcross = i\n#print(\"cross\", secondcross)\n \nres += lo\nprint(res)\n \n", "#!/usr/bin/env python3\n# -*- coding: utf-8 -*-\n\nN = int(input())\n\nA1s = list(map(int,input().split()))\nA2s = list(map(int,input().split()))\nBs = list(map(int,input().split()))\n\nscores = []\nscore = 0\nfor n in range(N):\n if n == 0:\n score = Bs[0] + sum(A2s)\n else:\n score -= Bs[n-1]\n score += Bs[n]\n score -= A2s[n-1]\n score += A1s[n-1]\n scores.append(score)\nscores.sort()\nprint(sum(scores[:2]))\n\n", "class CodeforcesTask586BSolution:\n def __init__(self):\n self.result = ''\n self.n = 0\n self.upper = []\n self.lower = []\n self.crossing = []\n\n def read_input(self):\n self.n = int(input())\n self.upper = [int(x) for x in input().split(\" \")]\n self.lower = [int(x) for x in input().split(\" \")]\n self.crossing = [int(x) for x in input().split(\" \")]\n\n def process_task(self):\n preu = [0] * (self.n - 1)\n prel = [0] * (self.n - 1)\n preu[0] = self.upper[0]\n prel[0] = self.lower[-1]\n for x in range(1, self.n - 1):\n preu[x] = preu[x - 1] + self.upper[x]\n prel[x] = prel[x - 1] + self.lower[- x - 1]\n prel = prel[::-1]\n ways = []\n for x in range(self.n - 2):\n ways.append(self.crossing[x + 1] + prel[x + 1] + preu[x])\n ways.append(self.crossing[0] + prel[0])\n ways.append(self.crossing[-1] + preu[-1])\n ways.sort()\n shortest = ways[0] + ways[1]\n self.result = str(shortest)\n\n def get_result(self):\n return self.result\n\n\nif __name__ == \"__main__\":\n Solution = CodeforcesTask586BSolution()\n Solution.read_input()\n Solution.process_task()\n print(Solution.get_result())\n", "from collections import Counter\r\ndef mp(): return map(int,input().split())\r\ndef lt(): return list(map(int,input().split()))\r\ndef pt(x): print(x)\r\ndef ip(): return input()\r\ndef it(): return int(input())\r\ndef sl(x): return [t for t in x]\r\ndef spl(x): return x.split()\r\ndef aj(liste, item): liste.append(item)\r\ndef bin(x): return \"{0:b}\".format(x)\r\n\r\nn = it()\r\nL1 = lt()\r\nL2 = lt()\r\ncross = lt()\r\ns = sum(L2)\r\nL = sorted([sum(L1[:i]) + sum(L2[i:]) + cross[i] for i in range(n)])\r\nprint(L[0]+L[1])\r\n \r\n\r\n \r\n \r\n \r\n \r\n ", "n = int(input())\r\na1 = list(map(int, input().split()))\r\na2 = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\nc = []\r\nk = 0\r\nfor i in range(2):\r\n c.append([0] * n)\r\nc[1][0] = b[0]\r\nfor i in range(1, n):\r\n c[0][i] = c[0][i - 1] + a1[i - 1]\r\n if c[1][i - 1] + a2[i - 1] > c[0][i] + b[i]:\r\n k = i\r\n c[1][i] = min(c[1][i - 1] + a2[i - 1], c[0][i] + b[i])\r\nans = 0\r\nans += c[-1][-1]\r\nb[k] = 1000\r\nc = []\r\nfor i in range(2):\r\n c.append([0] * n)\r\nc[1][0] = b[0]\r\nfor i in range(1, n):\r\n c[0][i] = c[0][i - 1] + a1[i - 1]\r\n c[1][i] = min(c[1][i - 1] + a2[i - 1], c[0][i] + b[i])\r\nans += c[-1][-1]\r\nprint(ans)\r\n", "n=int(input())\r\na1=list(map(int,input().split()))\r\na2=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\nfor i in range(1,n-1):\r\n\ta1[i]+=a1[i-1]\r\ni=n-3\r\nwhile(i>=0):\r\n\ta2[i]+=a2[i+1]\r\n\ti-=1\r\n# print(a1,a2)\r\na2.append(0)\r\nd1=min(b[0]+a2[0], a1[0]+b[1]+a2[1])\r\nd2=max(b[0]+a2[0], a1[0]+b[1]+a2[1])\r\n# print(d1,d2)\r\nfor i in range(1,n-1):\r\n\td=a1[i]+b[i+1]+a2[i+1]\r\n\t# print(i,d)\r\n\tif d<=d1:\r\n\t\td2=d1\r\n\t\td1=d\r\n\telif d<=d2:\r\n\t\td2=d\r\n# print(d1,d2)\r\nprint(d1+d2)", "\nn = int(input())\na2 = input().split()\na2 = [int(a) for a in a2]\na1 = input().split()\na1 = [int(a) for a in a1]\nb = input().split()\nb = [int(a) for a in b]\n\n\ntimea1 = [0]\nsum = 0\nfor i in reversed(a1) :\n\tsum += i\n\ttimea1[:0] = [sum]\n\ntimea2 = [0]\nsum = 0\nfor i in a2 :\n\tsum += i\n\ttimea2.append(sum)\n#print(timea2)\n#print(b)\n#print(timea1)\n\nmin1 = 100000000000\nmin2 = 100000000000\nk = 0\n\ndef time(i) :\n\treturn timea1[i] + b[i] + timea2[i]\n\nfor i in range(0, n) :\n\tt = time(i)\n\tif t < min1 :\n\t\tmin1 = t\n\t\tk = i\n\nfor i in range(0, n) :\n t = time(i)\n if t < min2 and i != k :\n min2 = t\n#print(min1)\n#print(k)\n#print(min2)\n\n\nprint(min1 + min2)\n\n\n", "n = int(input())\na = []\nfor _ in range(2):\n a.append(list(map(int, input().split())))\n\nb = list(map(int, input().split()))\n\nans = []\nfor i, e in enumerate(b):\n ans.append(e + sum(a[0][:i]) + sum(a[1][i:]))\n\nprint(sum(sorted(ans)[0:2]))\n", "n = int(input())\r\na = list(map(int,input().split()))\r\nb = list(map(int,input().split()))\r\nc = list(map(int,input().split()))\r\ns=0\r\nl=[]\r\nfor i in range(n):\r\n s=sum(a[:i])\r\n s+=c[i]\r\n s+=sum(b[i:])\r\n l.append(s)\r\nl.sort()\r\nprint(l[0]+l[1])", "def read_numbers():\n return list(map(int, input().split()))\n\n\ndef f(n, a1, a2, b):\n ways = [sum(a1[:h]) + b[h] + sum(a2[h:]) for h in range(n)]\n ways.sort()\n return sum(ways[:2])\n\n\nif __name__ == '__main__':\n n = int(input())\n a1 = read_numbers()\n a2 = read_numbers()\n b = read_numbers()\n print(f(n, a1, a2, b))\n", "n = int(input())\ntop = list(map(int, input().split()))\nbottom = list(map(int, input().split()))\ncenter = list(map(int, input().split()))\nanswers = []\n\ndef findSum(start, end, line):\n global top, bottom\n s = 0\n\n if line == 1:\n for i in range(end, start):\n s += bottom[i]\n else:\n for i in range(end, start):\n s += top[i]\n\n return s\n\n\nfor i in range(n):\n answers.append(center[n - i - 1] + findSum(n - 1, n - i - 1, 1) + findSum(n - i - 1, 0, 0))\n\nanswers.sort()\n\nprint(answers[0] + answers[1])", "\"\"\"\nCodeforces Round #325 (Div. 2)\n\nProblem 586 B. Laurenty and Shop\n\n@author yamaton\n@date 2015-11-09\n\"\"\"\n\nimport itertools as it\nimport functools\nimport operator\nimport collections\nimport math\nimport sys\n\n\ndef dist(up_adj, down_adj, i):\n assert len(up_adj) == len(down_adj)\n assert 0 <= i <= len(up_adj)\n return sum(up_adj[:i]) + sum(down_adj[i:])\n\n\ndef solve(up_adj, down_adj, up_down):\n distances = sorted(dist(up_adj, down_adj, i) + ud for i, ud in enumerate(up_down))\n return distances[0] + distances[1]\n\n\ndef main():\n n = int(input())\n xs = [int(i) for i in input().strip().split()]\n ys = [int(i) for i in input().strip().split()]\n zs = [int(i) for i in input().strip().split()]\n assert len(xs) == len(ys) == n-1\n assert len(zs) == n\n\n result = solve(xs, ys, zs)\n print(result)\n\n\nif __name__ == '__main__':\n main()\n", "from sys import stdin, stdout\nimport copy\n\ninput = stdin.readline\nn = int(input())\na = [None, None]\na[0] = list(map(int, input().split()))\na[1] = list(map(int, input().split()))\nb = list(map(int, input().split()))\n\n\np = [[None for _ in range(n)] for i in range(2)]\ndp = [[0 for _ in range(n)] for i in range(2)]\nfor i in range(1,n):\n dp[0][i] = dp[0][i-1] + a[0][i-1]\n p[0][i] = (0,i-1)\n\n\ndp[1][0] = dp[0][0] + b[0]\np[1][0] = (0,0)\n\nfor i in range(1,n):\n if dp[1][i-1] + a[1][i-1] < dp[0][i] + b[i]:\n dp[1][i] = dp[1][i-1] + a[1][i-1]\n p[1][i] = (1,i-1)\n else:\n dp[1][i] = dp[0][i] + b[i]\n p[1][i] = (0,i)\n\nforbiden = [(1,n-1)]\npar = p[1][n-1]\nwhile par:\n forbiden.append(par)\n par = p[par[0]][par[1]]\n\ndef solve(a,b,fr, to):\n dp = [[0 for _ in range(n)] for i in range(2)]\n if fr[0] == to[0]:\n a[fr[0]][fr[1]] = 1000000000\n else:\n b[fr[1]] = 10000000\n\n dp = [[0 for _ in range(n)] for i in range(2)]\n for i in range(1,n):\n dp[0][i] = dp[0][i-1] + a[0][i-1]\n\n dp[1][0] = dp[0][0] + b[0]\n\n for i in range(1,n):\n dp[1][i] = min(dp[1][i-1] + a[1][i-1] , dp[0][i] + b[i])\n\n return dp[1][len(b)-1]\n\nm = 10000000\nfor i in range(len(forbiden)-1):\n am = copy.deepcopy(a)\n bm = copy.deepcopy(b)\n m = min(m, solve(am,bm,forbiden[i+1], forbiden[i]))\n\nstdout.write(str(dp[1][n-1] + m))\n", "__author__ = 'pxy'\nn =int(input())\nai=[int(i) for i in input().split()]\nai.append(0)\nbi=[int(i) for i in input().split()]\nbi.append(0)\nc=[int(i) for i in input().split()]\ngp=10000000000\ngr=99999999999\nfor i in range(n):\n if gr>sum(ai[0:i])+c[i]+sum(bi[i:n-1]):\n t=gr\n gp=t\n gr=sum(ai[0:i])+c[i]+sum(bi[i:n-1])\n else:\n if gp>sum(ai[0:i])+c[i]+sum(bi[i:n-1]):\n gp=sum(ai[0:i])+c[i]+sum(bi[i:n-1])\nprint(gp+gr)", "n = int(input())\r\na1 = list(map(int, input().split()))\r\na2 = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\n\r\npref1 = [0] * n\r\nfor i in range(1, n):\r\n pref1[i] = pref1[i - 1] + a1[i - 1]\r\npref2 = [0] * n\r\nfor i in range(1, n):\r\n pref2[i] = pref2[i - 1] + a2[i - 1]\r\npost2 = [sum(a2)] * n\r\nfor i in range(n):\r\n post2[i] -= pref2[i]\r\n\r\nminimum = -1\r\nfor i in range(n):\r\n for j in range(n):\r\n if j != i:\r\n if minimum == -1:\r\n minimum = pref1[i] + post2[i] + b[i] + pref1[j] + post2[j] + b[j]\r\n else:\r\n minimum = min(pref1[i] + post2[i] + b[i] + pref1[j] + post2[j] + b[j], minimum)\r\nprint(minimum)\r\n", "n = int(input())\na1 = [int(x) for x in input().split()]\na2 = [int(x) for x in input().split()]\nb = [int(x) for x in input().split()]\n\n\nbest, best_cross = float('inf'), -1\n\nfor i in range(n):\n\ttmp = sum(a1[:i]) + sum(a2[i:]) + b[i]\n\n\tif tmp < best:\n\t\tbest = tmp\n\t\tbest_cross = i\n\nbest2 = float('inf')\nfor i in range(n):\n\tif i == best_cross: continue\n\n\ttmp = sum(a1[:i]) + sum(a2[i:]) + b[i]\n\n\tif tmp < best2:\n\t\tbest2 = tmp\n\nprint(best + best2)\n", "n = int(input())\r\na1 = list(map(int, input().split()))\r\na2 = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\nres = []\r\n\r\nfor index in range(len(b)):\r\n res.append(b[index] + sum(a1[:index]) + sum(a2[index:]))\r\n\r\nres.sort()\r\nprint(res[0] + res[1])", "n = int(input())\r\nfirst = list(map(int, input().split()))\r\nsecond = list(map(int, input().split()))\r\nmain = list(map(int, input().split()))\r\n\r\nsums = [0] * (n)\r\n\r\nfor i in range(n - 1):\r\n sums[i] = sum(first[:i]) + main[i] + sum(second[i:])\r\nsums[n - 1] = main[n - 1] + sum(first)\r\n \r\nfirstmin = min(sums)\r\nsums.remove(firstmin)\r\nsecmin = min(sums)\r\nprint(firstmin + secmin)\r\n ", "n=int(input())\r\nl=[]\r\nfor i in range(2):\r\n l.append([int(j) for j in input().split()])\r\nl1=[int(i) for i in input().split()]\r\nl2=[]\r\nfor i in range(n):\r\n s=0\r\n for j in range(i):\r\n s+=l[0][j]\r\n s+=l1[i]\r\n for j in range(i,n-1):\r\n s+=l[1][j]\r\n l2.append(s)\r\nl2.sort()\r\nprint (l2[0]+l2[1])\r\n\r\n\r\n\r\n", "import sys\nimport time\nimport traceback\nfrom contextlib import contextmanager\nfrom io import StringIO\n\n\nfsm = [\n [(0, 0), (1, 1)],\n [(2, 0), (1, 1)],\n [(0, 0), (1, 2)],\n]\n\n\ndef mtime(n, A1, A2, B):\n s1 = 0\n s2 = sum(A2)\n iB = iter(B)\n m1 = s1 + s2 + next(iB)\n m2 = None\n for a1, a2, b in zip(A1, A2, iB):\n s1 += a1\n s2 -= a2\n v = s1 + s2 + b\n if v <= m1:\n m1, m2 = v, m1\n elif m2 is None or v < m2:\n m2 = v\n assert s1 == sum(A1)\n assert s2 == 0\n return m1 + m2\n\n\ndef pl(k):\n l = list(map(int, input().split()))\n assert len(l) == k\n return l\n\n\ndef main():\n n = int(input())\n A1 = pl(n-1)\n A2 = pl(n-1)\n B = pl(n)\n print(mtime(n, A1, A2, B))\n\n\ndef log(*args, **kwargs):\n print(*args, **kwargs, file=sys.stderr)\n\n\n@contextmanager\ndef patchio(i):\n try:\n sys.stdin = StringIO(i)\n sys.stdout = StringIO()\n yield sys.stdout\n finally:\n sys.stdin = sys.__stdin__\n sys.stdout = sys.__stdout__\n\n\ndef do_test(k, test):\n try:\n log(f\"TEST {k}\")\n i, o = test\n with patchio(i) as r:\n t0 = time.time()\n main()\n t1 = time.time()\n if r.getvalue() == o:\n log(f\"OK ({int((t1-t0)*1000000)/1000:0.3f} ms)\\n\")\n else:\n log(f\"Expected:\\n{o}Got:\\n{r.getvalue()}\")\n except Exception:\n traceback.print_exc()\n log()\n\n\ndef test(ts):\n for k in ts or range(len(tests)):\n do_test(k, tests[k])\n\n\ntests = [(\"\"\"\\\n4\n1 2 3\n3 2 1\n3 2 2 3\n\"\"\", \"\"\"\\\n12\n\"\"\"), (\"\"\"\\\n3\n1 2\n3 3\n2 1 3\n\"\"\", \"\"\"\\\n11\n\"\"\"), (\"\"\"\\\n2\n1\n1\n1 1\n\"\"\", \"\"\"\\\n4\n\"\"\")]\n\n\nif __name__ == '__main__':\n from argparse import ArgumentParser\n parser = ArgumentParser()\n parser.add_argument('--test', '-t', type=int, nargs='*')\n args = parser.parse_args()\n main() if args.test is None else test(args.test)\n\n", "n = int(input())\r\na = [int(i) for i in input().split(\" \")]\r\nc = [int(i) for i in input().split(\" \")]\r\nb = [int(i) for i in input().split(\" \")]\r\nd = []\r\ns1 = 0\r\ns2 = sum(c)\r\nz = b[0] + s2\r\nd.append(z)\r\nfor i in range(1,n):\r\n z = b[i];\r\n s1 += a[i-1]\r\n s2 -= c[i-1]\r\n z += s1 + s2\r\n d.append(z)\r\n\r\nd.sort()\r\nprint(d[0]+d[1])\r\n \r\n", "n=int(input())\r\na=list(map(int,input().split(' ')))\r\nb=list(map(int,input().split(' ')))\r\ncr=list(map(int,input().split(' ')))\r\nval=[]\r\nfor i in range(n):\r\n val.append(sum(a[0:i])+cr[i]+sum(b[i::]))\r\nval.sort()\r\nprint(val[0]+val[1])", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\na1 = [0] + list(map(int, input().split()))\r\na2 = list(map(int, input().split())) + [0]\r\nb = list(map(int, input().split()))\r\n\r\nd = []\r\n\r\nx, y, c = 0, sum(a2), 0\r\nfor i in range(n):\r\n x += a1[i]\r\n c = b[i] + y + x\r\n d.append(c)\r\n y -= a2[i]\r\n\r\nd.sort()\r\nprint(d[0] + d[1])", "I=lambda:list(map(int,input().split()))\nR=range(I()[0])\na=I()\nb=I()\nc=I()\nprint(min(c[i]+c[j]+sum(a[:i]+a[:j]+b[i:]+b[j:])for i in R for j in R if i!=j))\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\n# -*- coding: utf-8 -*-\n\nimport time\nimport math\n\ndef func(a, b, flag):\n\n s = b[0]+sum(a[1])\n\n if flag == 0:\n s += a[0][0] - a[1][0] + b[1] - b[0]\n min_s = s\n min_p = 1\n else:\n s = b[0]+sum(a[1])\n min_s = s\n min_p = 0\n\n for now in range(1, n):\n\n s += a[0][now-1]-a[1][now-1]+b[now]-b[now-1]\n if flag == now:\n continue\n\n if s < min_s:\n min_s = s\n min_p = now\n\n return(min_s, min_p)\n\n\nn = int(input())\na = [0, 0]\n\na[0] = [int(i) for i in input().split()]\na[1] = [int(i) for i in input().split()]\nb = [int(i) for i in input().split()]\n\nstart = time.time()\n\n\n(s1, p) = func(a, b, -1)\n(s2, p) = func(a, b, p)\n\nprint(s1+s2)\n\nfinish = time.time()\n#print(finis1h - s1tart)\n", "from sys import stdin\n\nn = stdin.readline().rstrip()\nn = int(n)\n\nfirst_row = [int(i) for i in stdin.readline().rstrip().split()]\nsecond_row = [int(i) for i in stdin.readline().rstrip().split()]\n\nmain_crossing = [int(i) for i in stdin.readline().rstrip().split()]\n\nmin_1 = float('inf')\nmin_2 = float('inf')\n\ntrip_times = []\nfor i in range(n):\n first_row_time = sum(first_row[:i])\n second_row_time = sum(second_row[i:])\n\n trip_time = first_row_time + second_row_time + main_crossing[i]\n\n trip_times.append(trip_time)\n\ntrip_times.sort()\nprint(trip_times[0] + trip_times[1])\n", "N=int(input())\r\nx=[[0]*N,[0]*N]\r\na=list(map(int,input().split()))\r\nadash=[0]\r\nfor i in range(N-1):\r\n adash.append(adash[-1]+a[i])\r\nb=list(map(int,input().split()))\r\nbdash=[0]\r\nfor i in range(N-1):\r\n bdash.append(bdash[-1]+b[i])\r\nc=list(map(int,input().split()))\r\nkachra=[]\r\nfor i in range(N):\r\n kachra.append(adash[i]+c[i]+bdash[-1]-bdash[i])\r\nkachra.sort()\r\nprint(kachra[0]+kachra[1])\r\n", "res = []\r\nn = int(input())\r\na = list(map(int,input().split()))\r\nc = list(map(int,input().split()))\r\nb = list(map(int,input().split()))\r\nfor i in range(n):\r\n res.append(sum(c[n-1-i:])+b[n-i-1]+sum(a[:n-1-i]))\r\nres.sort()\r\nprint(res[0]+res[1])", "#!/usr/bin/env python3\n\nimport functools\n\n\nif __name__ == '__main__':\n N = int(input())\n a = list(map(int, input().split()))\n b = list(map(int, input().split()))\n c = list(map(int, input().split()))\n\n bb = [0]*N\n for i in range(N-1, 0, -1):\n bb[i-1] = b[i-1] + bb[i]\n\n aa = [0]*N\n for i in range(1, N):\n aa[i] = aa[i-1] + a[i-1]\n\n res = []\n for i in range(N):\n res.append(aa[i] + bb[i] + c[i])\n\n res.sort()\n print(res[0] + res[1])\n\n", "n=int(input());\r\na=[[],[0],[0]];\r\nb=[0];\r\nans=1e9;\r\na[1].extend([int(v) for v in input().split(' ')]);\r\na[2].extend([int(v) for v in input().split(' ')]);\r\nb.extend([int(v) for v in input().split(' ')]);\r\nfor i in range(1,n):\r\n a[1][i]+=a[1][i-1];\r\nfor i in range(n-2,0,-1):\r\n a[2][i]+=a[2][i+1];\r\na[1].append(0),a[2].append(0);\r\nfor i in range(1,n+1):\r\n for j in range(1,n+1):\r\n if i!=j:\r\n ans=min(ans,a[1][i-1]+b[i]+a[2][i]+a[1][j-1]+b[j]+a[2][j]);\r\nprint(ans);\r\n", "n = int(input())\r\na = [int(x) for x in input().split()]\r\nb = [int(x) for x in input().split()]\r\ns = [int(x) for x in input().split()]\r\np1 = [0]\r\nfor i in range(n - 1):\r\n p1.append(p1[-1] + a[i])\r\np2 = [0]\r\nfor i in range(n - 1):\r\n p2.append(p2[-1] + b[-i - 1])\r\nmin1 = 10000000\r\nmin2 = 10000000\r\nfor i in range(n):\r\n summ = p1[i] + p2[n - i - 1] + s[i]\r\n if summ < min1:\r\n min2 = min1\r\n min1 = summ\r\n elif summ < min2:\r\n min2 = summ\r\nprint(min1 + min2)", "n = int(input())\nup = [int(item) for item in input().split()]\ndown = [int(item) for item in input().split()]\nj = [int(item) for item in input().split()]\ntime = 0\nmas = []\nfor idx in range(n - 1, -1, -1):\n mas.append(j[idx] + sum([n for n in up[0:idx]]) + sum([n for n in down[idx:]]))\nmas.sort()\nprint(mas[0] + mas[1])", "n = int(input())\r\na1 = list(map(int, input().split()))\r\na2 = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\na = list()\r\nfor i in range(n):\r\n a.append(sum(a1[:i]) + sum(a2[i:]) + b[i])\r\na.sort()\r\nprint(a[0] + a[1])\r\n", "#! /usr/bin/env python\n# -*- coding: utf-8 -*-\n# vim:fenc=utf-8\n#\n# Copyright © 2016 missingdays <missingdays@missingdays>\n#\n# Distributed under terms of the MIT license.\n\n\"\"\"\n\n\"\"\"\n\nn = int(input())\n\nb = []\n\nb.append([int(i) for i in input().split()])\nb.append([int(i) for i in input().split()])\n\na = [int(i) for i in input().split()]\n\nb1s = [0]\nb2s = [0]\n\nfor i in range(n-1):\n b1s.append(b[0][i])\n b1s[i+1] += b1s[i]\n\n b2s.insert(0, b[1][n-i-2])\n b2s[0] += b2s[1]\n\nm = 10e9\n\nfor i in range(n):\n for j in range(n):\n if i == j:\n continue\n \n c = a[i] + a[j] + b1s[i] + b1s[j] + b2s[i] + b2s[j]\n\n m = min(m, c)\n\nprint(m)\n", "#!/usr/bin/env python3\n\nn = int(input())\na = list(map(int, input().split()))\nb = list(map(int, input().split()))\nc = list(map(int, input().split()))\nd = [0] * n\ne = [0] * n\nfor i in range(1, n):\n d[i] = d[i - 1] + a[i - 1]\nfor i in range(n - 2, -1, -1):\n e[i] = e[i + 1] + b[i]\n\nx = y = int(1e9)\nfor i in range(n):\n t = d[i] + e[i] + c[i]\n if t < y:\n if t < x:\n x, y = t, x\n else:\n y = t\nprint(x + y)\n", "n=int(input())\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\nc=list(map(int,input().split()))\r\nx=[]\r\nfor i in range(n-1) :\r\n x.append(c[i]+sum(b[i:])+sum(a[:i]))\r\nx.append(sum(a)+c[-1])\r\nx.sort()\r\nprint(x[0]+x[1])", "n=int(input())\r\na=[int(i) for i in input().split()]\r\nb=[int(i) for i in input().split()]\r\nfor i in range(1, n-1):\r\n a[i]=a[i]+a[i-1]\r\n b[-(i+1)]=b[-(i+1)]+b[-(i+1)+1]\r\na=[0]+a\r\nb.append(0)\r\nm=[int(i) for i in input().split()]\r\nans=float(\"inf\")\r\nfor i in range(n):\r\n temp1=b[i]+m[i]+a[i]\r\n for j in range(n-1, -1, -1):\r\n if j!=i:\r\n temp2=a[j]+m[j]+b[j]\r\n if ans>temp1+temp2:\r\n ans=temp1+temp2 \r\nprint(ans)\r\n \r\n \r\n\r\n", "n = int(input())\r\nrow1 = [0]+[ int(x) for x in input().split() ]\r\nrow2 = [0]+[ int(x) for x in input().split() ]\r\nb = [ int(x) for x in input().split() ]\r\nfor i in range(1,n):\r\n row1[i] += row1[i-1]\r\n row2[i] += row2[i-1]\r\nmini = 1000000000\r\nfor i in range(n):\r\n if row1[i]+b[i]+row2[n-1]-row2[i]<mini:\r\n mini = row1[i]+b[i]+row2[n-1]-row2[i]\r\n index = i\r\nmini2 = 100000000\r\nfor i in range(n):\r\n if i!=index and row1[i]+b[i]+row2[n-1]-row2[i]<mini2:\r\n mini2 = row1[i]+b[i]+row2[n-1]-row2[i]\r\nprint(mini+mini2)", "__author__ = 'Om Kumar Sahoo'\r\nn=int(input())\r\nfirst=[0]+[int(x) for x in input().split()]\r\nsecond=[int(x) for x in input().split()]+[0]\r\nst=[int(x) for x in input().split()]\r\nfirsts=[0]*n\r\nseconds=[0]*n\r\nfor i in range(1,n):\r\n firsts[i]=firsts[i-1]+first[i]\r\nfor i in range(n-2,-1,-1):\r\n seconds[i]=seconds[i+1]+second[i]\r\ntime=[0]*n\r\nfor i in range(n):\r\n time[i]=firsts[i]+seconds[i]+st[i]\r\nm1=min(time)\r\ntime.remove(m1)\r\nm2=min(time)\r\nprint(m1+m2)", "import sys\r\n\r\nn = int(input())\r\nv1 = list(map(int, (\"0 \" + input()).split()))\r\nv2 = list(map(int, (input() + \" 0\").split()))\r\nv3 = list(map(int, input().split()))\r\n\r\nfor i in range(1, n): v1[i] = v1[i] + v1[i - 1]\r\nfor i in range(n - 2, -1, -1): v2[i] = v2[i] + v2[i + 1]\r\n\r\nfor i in range(0, n): v3[i] += v1[i] + v2[i]\r\nv3.sort()\r\nprint(v3[0] + v3[1])", "n = int(input())\na1 = [int(i) for i in input().split(\" \")]\na2 = [int(i) for i in input().split(\" \")]\nb = [int(i) for i in input().split(\" \")]\n\nres = 1111111111111;\nfor i in range(0, n):\n\tfor j in range (i+1, n):\n\t\t# print(i, j)\n\t\ttmp = b[i] + b[j] + sum(a1[:i]) + sum(a2[i:]) + sum(a1[:j]) + sum(a2[j:]);\n\t\tif (tmp < res):\n\t\t\tres = tmp;\nprint(res)", "n = int(input())\r\na1 = list(map(int, input().split(' ')[:n-1]))\r\na2 = list(map(int, input().split(' ')[:n-1]))\r\nb = list(map(int, input().split(' ')[:n]))\r\n\r\nx1 = 0\r\nx2 = b[0]\r\ncross = 0\r\n\r\nfor i in range(1, n):\r\n x1 = x1 + a1[i-1]\r\n cross_way = x1 + b[i]\r\n pass_way = x2 + a2[i-1]\r\n if cross_way < pass_way:\r\n cross = i\r\n x2 = cross_way\r\n else:\r\n x2 = pass_way\r\n\r\nb[cross] = float(\"inf\")\r\nw1 = x2\r\n\r\nx1 = 0\r\nx2 = b[0]\r\n\r\nfor i in range(1, n):\r\n x1 = x1 + a1[i-1]\r\n cross_way = x1 + b[i]\r\n pass_way = x2 + a2[i-1]\r\n x2 = min(cross_way, pass_way)\r\n\r\nprint(w1 + x2)", "n = int(input())-1\ndef d():\n\treturn list(map(int,input().split()))\na=d()\nb=d()\nc=d()\nv=[]\nwhile n>=0:\n\tv.append(sum(a[:n])+c[n]+sum(b[n:]))\n\tn-=1\nv.sort()\nprint(v[0]+v[1])\n", "n = int(input())\r\na = [None, None]\r\na[0] = list(map(int, input().split()))\r\na[1] = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\n\r\nd = []\r\nfor p in range(n):\r\n d.append(sum(a[0][:p]) + b[p] + sum(a[1][p:]))\r\nprint(sum(sorted(d)[:2]))\r\n", "n=int(input())\r\nf=[0]+list(map(int,input().split()))\r\ns=list(map(int,input().split()))+[0]\r\na=list(map(int,input().split()))\r\nl=sorted([sum(f[:i+1])+a[i]+sum(s[i:]) for i in range(n)])\r\nprint(l[0]+l[1])\r\n ", "read = lambda: list(map(int, input().split()))\r\nn = int(input())\r\na1, a2, b = read(), read(), read()\r\nprv, suf = [0] * n, [0] * n\r\nsuf[-1] = prv[0] = 0\r\nnow = 0\r\nfor i in range(1, n):\r\n now += a1[i - 1]\r\n prv[i] = now\r\nnow = 0\r\nfor i in range(n - 2, -1, -1):\r\n now += a2[i]\r\n suf[i] = now\r\nc = [0] * n\r\nfor i in range(n):\r\n c[i] = prv[i] + b[i] + suf[i]\r\n\r\np1 = min(c)\r\nc[c.index(p1)] = 10 ** 10\r\np2 = min(c)\r\nans = p1 + p2\r\nprint(ans)\r\n", "n = int(input())\nacross = [ list(map(int, input().split())) for i in range(2) ]\ndown = list(map(int, input().split()))\n\npath = down[0] + sum(across[1])\ncosts = [ path ]\nfor i, top in enumerate(across[0]):\n bottom = across[1][i]\n path = path - down[i] - bottom + down[i + 1] + top\n costs.append(path)\n\ncosts.sort()\nprint(costs[0] + costs[1])\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\na1 = list(map(int, input().split()))\r\na2 = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\nu, v = [0], [0]\r\nfor i in a1:\r\n u.append(u[-1] + i)\r\nfor i in a2[::-1]:\r\n v.append(v[-1] + i)\r\nv.reverse()\r\nx = [i + j + k for i, j, k in zip(u, v, b)]\r\nx.sort()\r\nans = x[0] + x[1]\r\nprint(ans)", "n=int(input())\r\na1 = list(map(int, input().split()))\r\na2 = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\nans=[]\r\n\r\nfor i in range(len(b)):\r\n ans.append(b[i] + sum(a1[:i]) + sum(a2[i:]))\r\n\r\nans.sort()\r\nprint(ans[0] + ans[1])", "def solve(start,end,a,b,cross,cost):\r\n global arr\r\n if start == end:\r\n arr.append(cost)\r\n return\r\n x,y = start\r\n if x == 0 and y < n-1:\r\n solve((x,y+1),end,a,b,cross,cost + a[y])\r\n solve((x+1,y),end,a,b,cross,cost + cross[y])\r\n elif x== 0 and y == n-1:\r\n solve((x+1,y),end,a,b,cross,cost + cross[y])\r\n elif x == 1:\r\n solve((x,y+1),end,a,b,cross,cost + b[y])\r\n\r\nn = int(input())\r\na = list(map(int,input().split()))\r\nb = list(map(int,input().split()))\r\ncross = list(map(int,input().split()))\r\narr = []\r\nsolve((0,0),(1,n-1),a,b,cross,0)\r\n\r\narr.sort()\r\nprint(arr[0] + arr[1])", "n = int(input())\na = [[], []]\na[0] = list(map(int, input().split()))\na[1] = list(map(int, input().split()))\nb = list(map(int, input().split()))\nans = float('+inf')\nfor i in range(n):\n\tfor j in range(n):\n\t\tif i == j:\n\t\t\tcontinue\n\t\tcur = sum(a[1][i:]) + sum(a[0][:i]) + sum(a[0][:j]) + sum(a[1][j:]) + b[i] + b[j]\n\t\tans = min(ans, cur)\nprint(ans)\n", "\nn = int(input())\nA1 = [int(a) for a in input().strip().split(' ')]\nA2 = [int(a) for a in input().strip().split(' ')]\nA = [A1,A2]\nB = [int(a) for a in input().strip().split(' ')]\n\nres = []\nfor i in range(len(B)):\n s = B[i] + sum(A[0][:i]) + sum(A[1][i:])\n res.append(s)\n\nres.sort()\ns = res[0] + res[1]\nprint(s)\n", "n=int(input())\r\n\r\na1=input().split()\r\na2=input().split()\r\nb=input().split()\r\na1.insert(0,0)\r\na2.insert(n-1,0)\r\nk1,k2=0,0\r\nfor i in range(n):\r\n k1+=int(a1[i])\r\n a1[i]=k1\r\n k2+=int(a2[n-i-1])\r\n a2[n-1-i]=k2\r\n b[i]=int(b[i])\r\nl=[]\r\nfor i in range(n):\r\n l.append(a1[i]+b[i]+a2[i])\r\nl.sort()\r\nprint(l[0]+l[1])\r\n \r\n", "#!/usr/bin/env python\n\nfrom sys import stdin\n\nn = int(stdin.readline())\na1 = [int(x) for x in stdin.readline().split()]\na2 = [int(x) for x in stdin.readline().split()]\nb = [int(x) for x in stdin.readline().split()]\n\ncum1 = a1[:]\ncum2 = a2[:]\nfor i in range(1, n - 1):\n cum1[i] += cum1[i-1]\nfor i in range(n - 3, -1, -1):\n cum2[i] += cum2[i+1]\n\nmin1, min2 = 1000000, 1000000\nfor i in range(n):\n c = b[i]\n if i:\n c += cum1[i-1]\n if i < n-1:\n c += cum2[i]\n\n if c <= min1:\n min2 = min1\n min1 = c\n elif c < min2:\n min2 = c\n\nprint(min1 + min2)", "n = int(input())\r\na1 = list(map(int, input().split()))\r\na2 = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\nres = []\r\nfor i in range(n):\r\n res.append(b[i] + sum(a1[:i]) + sum(a2[i:]))\r\nres.sort()\r\nprint(res[0] + res[1])\r\n", "import os\r\nimport sys\r\nimport random\r\n\r\nn=int(input())\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\ntot=0\r\nmin2=1000000000\r\nfor i in range (0,n-1):\r\n tot+=b[i]\r\ntemp=list(map(int,input().split()))\r\ntot+=temp[0]\r\nmin1=tot\r\nfor i in range (1,n):\r\n tot-=temp[i-1]\r\n tot-=b[i-1]\r\n tot+=temp[i]\r\n tot+=a[i-1]\r\n if (tot<=min1):\r\n min2=min1\r\n min1=tot\r\n elif (tot<min2):\r\n min2=tot\r\n\r\nmin1+=min2\r\nprint (min1)", "n = int(input())\r\na = [list(map(int, input().split())) for i in range(2)]\r\nb = list(map(int, input().split()))\r\n\r\nd = 0\r\nmin_d = []\r\n\r\nfor i in range(n):\r\n for j in range(0,i):\r\n d += a[0][j]\r\n for k in range(i,n-1):\r\n d += a[1][k]\r\n d += b[i]\r\n min_d.append(d)\r\n d = 0\r\n \r\nmin_d.sort()\r\nsuma = min_d[0] + min_d[1]\r\n\r\nprint(suma)", "from functools import lru_cache, wraps\nfrom sys import stderr\n\nimport time\n\nINF = 10 ** 18 + 3\nEPS = 1e-10\n\n\n# Decorators\ndef print_to_file(function, file=stderr):\n def wrapped(*args, **kwargs):\n res = function(*args, **kwargs)\n print(res, file=file)\n return res\n\n return wrapped\n\n\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('Function \"%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 = int(input())\n rows1 = tuple(map(int, input().split()))\n rows2 = tuple(map(int, input().split()))\n cols = tuple(map(int, input().split()))\n\n times = sorted(\n sum(rows1[:i]) + cols[i] + sum(rows2[i:])\n for i in range(n)\n )\n\n print(times[0] + times[1])\n\n\n@lru_cache(10 ** 9)\ndef find_perm(length, n_different):\n if length == 0:\n return []\n\n if n_different != length - 1:\n return (list(range_of_len(length, length - n_different - 1, - 1))\n + find_perm(n_different + 1, n_different))\n\n curr = length\n go_down = True\n res = []\n for _ in range(n_different + 1):\n res.append(curr)\n curr = length - curr + go_down\n go_down ^= True\n\n return res\n\n\n# Auxiliary functions\n@print_to_file\ndef range_of_len(start, length, step=1):\n return range(start, start + length * step, step)\n\n\n# io reassignment\ndef set_input(file):\n global input\n input = lambda: file.readline().strip()\n\n\ndef set_output(file):\n global print\n l_print = print\n\n def print(*args, **kwargs):\n kwargs[\"file\"] = kwargs.get(\"file\", file)\n return l_print(*args, **kwargs)\n\n\nif __name__ == '__main__':\n # set_input(open(\"\", \"r\"))\n # set_output(open(\"\", \"w\"))\n main()\n", "#!/usr/bin/env python\r\n# -*- coding: utf-8 -*-\r\n\r\nn = int(input())\r\nA1 = list(map(int,input().split()))\r\nA2 = list(map(int,input().split()))\r\nB = list(map(int,input().split()))\r\n\r\ndist1 = 10**8\r\ndist2 = 10**8\r\n\r\nfor i in range(n):\r\n dist = sum(A1[0:i] + A2[i:n]) + B[i]\r\n if dist < dist1:\r\n dist2 = min(dist2, dist1)\r\n dist1 = dist\r\n elif dist < dist2:\r\n dist2 = dist\r\nprint(dist1+dist2)\r\n", "n = int(input())\r\narr = [0]+list(map(int, input().split()))\r\nbrr = list(map(int, input().split()))+[0]\r\ncrr = list(map(int, input().split()))\r\nfor i in range(1, n):\r\n arr[i] += arr[i-1]\r\nfor i in range(n-2, -1, -1):\r\n brr[i] += brr[i+1]\r\ns = []\r\nfor i in range(n):\r\n s.append(arr[i]+brr[i]+crr[i])\r\ns.sort()\r\nprint(s[0]+s[1])\r\n", "#!/usr/bin/python3.5\r\n\r\nn=int(input())\r\na=[0]+[int(x) for x in input().split()]\r\nb=[int(x) for x in input().split()]+[0]\r\nc=[int(x) for x in input().split()]\r\n\r\nfor i in range(1,n):\r\n a[i]+=a[i-1]\r\n b[n-1-i]+=b[n-i]\r\n\r\nd=[]\r\nfor i in range(n):\r\n d.append(a[i]+b[i]+c[i])\r\nd.sort()\r\n\r\nprint(d[0]+d[1])", "a=int(input())\r\nz=[[0]+list(map(int,input().split())),[0]+list(map(int,input().split()))]\r\nr=[0]+list(map(int,input().split()))\r\nk=[]\r\nfor i in range(a,0,-1):k.insert(0,sum(z[0][:i])+r[i]+sum(z[1][i:]))\r\ns=min(k);k[k.index(s)]=2*a*100;print(s+min(k))", "def solve(a, b):\r\n pth = []\r\n s = 0\r\n for i in range(0,len(b),1):\r\n for j in range(0,i,1):\r\n s += int(a[0][j])\r\n s += int(b[i])\r\n for j in range(i,len(b)-1,1):\r\n s += int(a[1][j])\r\n pth.append(s)\r\n s = 0\r\n pth.sort()\r\n return pth[0]+pth[1]\r\n \r\ninp1 = [] \r\nfininp1 = []\r\ninp0 = input()\r\ninp1.append(input())\r\ninp1.append(input())\r\ninp2 = input()\r\n\r\nfininp1.append(inp1[0].split())\r\nfininp1.append(inp1[1].split())\r\n\r\nfininp2 = inp2.split()\r\n\r\nprint(solve(fininp1,fininp2))", "n = int(input())\ntop = [0]\nbot = [0]\ntop += [int(i) for i in input().split()]\nbot += [int(i) for i in input().split()]\ncross = [int(i) for i in input().split()]\n\nfor i in range(1,n):\n top[i] += top[i-1]\n bot[i] += bot[i-1]\n\nbest = 11111111111111;\nbest2 = 11111111111111;\n\nfor i in range(n):\n dist = top[i] + cross[i] + (bot[n-1] - bot[i])\n if dist < best2:\n if dist <= best:\n best2 = best\n best = dist\n else:\n best2 = dist\n\nprint(best+best2)\n", "n = int(input())\na1 = list(map(int, input().split(' ')[:n-1]))\na2 = list(map(int, input().split(' ')[:n-1]))\nb = list(map(int, input().split(' ')[:n]))\n\nx1 = 0\nx2 = b[0]\ncross = 0\n\nfor i in range(1, n):\n x1 = x1 + a1[i-1]\n cross_way = x1 + b[i]\n pass_way = x2 + a2[i-1]\n if cross_way < pass_way:\n cross = i\n x2 = cross_way\n else:\n x2 = pass_way\n\nb[cross] = float(\"inf\")\nw1 = x2\n\nx1 = 0\nx2 = b[0]\n\nfor i in range(1, n):\n x1 = x1 + a1[i-1]\n cross_way = x1 + b[i]\n pass_way = x2 + a2[i-1]\n x2 = min(cross_way, pass_way)\n\nprint(w1 + x2)\n", "n=int(input())\r\na=[0] + list(map(int,input().split()))\r\nb= list(map(int,input().split())) + [0]\r\narr=list(map(int,input().split()))\r\nfor i in range(1,n):\r\n a[i]+=a[i-1]\r\n b[-i-1]+=b[-i] \r\n# for i in range(1,n):\r\n# # a[i]+=a[i-1]\r\n# b[-i-1]+=b[-i] \r\n \r\n# print(a)\r\n \r\n# print(b)\r\n# print(arr)\r\n\r\nm=10**12\r\nfor i in range(n):\r\n for j in range(i+1,n):\r\n m=min(a[i] + b[i] + arr[i] + a[j] + b[j] + arr[j],m) \r\nprint(m) ", "'''\r\n###### * User Profile : Keval_78\r\nLinkedIn: https://www.linkedin.com/in/kevalpadsala78/\r\nGithub: https://github.com/Keval78\r\nLeetcode: https://leetcode.com/Keval_78/\r\n'''\r\n\r\nimport math\r\nimport sys\r\n# from os import path\r\n# from math import log2, floor, ceil, sqrt, pow, gcd\r\n# from random import random, randint, shuffle, choice\r\nfrom collections import Counter, defaultdict, deque\r\n# from itertools import permutations, combinations\r\n# from functools import reduce\r\n# from heapq import heapify, heappop, heappush, heapreplace\r\n# from bisect import bisect_left, bisect_right\r\n\r\n\r\ndef si(): return sys.stdin.readline().strip()\r\ndef ii(): return int(si())\r\ndef mi(ss=\" \"): return map(int, si().split(ss))\r\ndef msi(ss=\" \"): return map(str, si().split(ss))\r\ndef li(ss=\" \"): return list(mi(ss))\r\n\r\n\r\nsys.setrecursionlimit(10 ** 5)\r\nMOD, MOD2, INF = 10 ** 9 + 7, 998244353, float('inf')\r\nMAX = 10**5+1\r\n\r\ndef solve():\r\n n = ii()\r\n arr1 = li()\r\n arr2 = li()\r\n brr = li()\r\n\r\n dp = [[0]*n for i in range(2)]\r\n dp[0][n-1] = brr[n-1]\r\n cross = -1\r\n cost = 0\r\n for i in range(n-1):\r\n dp[1][n-i-2] = dp[1][n-i-1] + arr2[n-i-2]\r\n right = dp[0][n-i-1] + arr1[n-i-2]\r\n down = dp[1][n-i-2] + brr[n-i-2]\r\n if right < down:\r\n dp[0][n-i-2] = right\r\n else:\r\n dp[0][n-i-2] = down\r\n cross = n-i-2\r\n brr[cross] = INF\r\n cost += dp[0][0]\r\n \r\n dp = [[0]*n for i in range(2)]\r\n dp[1][0] = brr[0]\r\n for i in range(1, n):\r\n dp[0][i] = dp[0][i-1] + arr1[i-1]\r\n left = dp[1][i-1] + arr2[i-1]\r\n up = dp[0][i] + brr[i]\r\n dp[1][i] = min(left, up)\r\n \r\n cost += dp[1][-1]\r\n \r\n print(cost)\r\n\r\ntest = 1\r\n# test = ii()\r\nfor _ in range(test):\r\n solve()", "n = int(input())\r\nat = [0] + list(map(int, input().split()))\r\nfor i in range(1, n):\r\n at[i] += at[i - 1]\r\nab = list(map(int, input().split())) + [0]\r\nfor i in range(n - 2, -1, -1):\r\n ab[i] += ab[i + 1]\r\nb = list(map(int, input().split()))\r\nv = sorted(at[i] + ab[i] + b[i] for i in range(n))\r\nprint(v[0] + v[1])", "n=int(input())-1\r\ndef d():\r\n return list(map(int,input().split()))\r\na=d()\r\nb=d()\r\nc=d()\r\nv=[]\r\nwhile n>=0:\r\n v.append(sum(a[:n])+c[n]+sum(b[n:]))\r\n n-=1\r\nv.sort()\r\nprint(v[0]+v[1])", "n = int(input())\na1 = list(map(int, input().split()))\na2 = list(map(int, input().split()))\nb = list(map(int, input().split()))\nans = None\ntopBottom = sum(a2)\nfor i in range(n):\n bottomTop = sum(a2)\n for j in range(n):\n if j != i:\n cur = topBottom + b[i] + bottomTop + b[j]\n ans = cur if ans == None else min(ans, cur)\n if (j < n - 1):\n bottomTop = bottomTop + a1[j] - a2[j]\n if i < n - 1:\n topBottom = topBottom + a1[i] - a2[i]\nprint(ans)\n", "n = int(input())\ntop = list(map(int, input().split()))\nbottom = list(map(int, input().split()))\ncenter = list(map(int, input().split()))\nanswers = []\n\ndef findSum(start, end, arr):\n ss = 0\n if arr == \"bot\":\n for i in range(end, start):\n ss += bottom[i]\n else:\n for i in range(end, start):\n ss += top[i]\n\n return ss\n\nfor i in range(n):\n sum = 0\n sum += center[n - i - 1]\n sum += findSum(n - 1, n - i - 1, \"bot\")\n sum += findSum(n - i - 1, 0, \"top\")\n answers.append(sum)\n\nanswers.sort()\n\nprint(answers[0] + answers[1])\n", "n = int(input())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\nc = list(map(int, input().split()))\r\nd = []\r\ns_a = sum(a)\r\ns_b = sum(b)\r\ns = 0\r\nd.append(c[0] + s_b)\r\nfor i in range(n - 1):\r\n s += a[i]\r\n s_b -= b[i]\r\n d.append(s + c[i + 1] + s_b)\r\nd.sort()\r\nprint(d[0] + d[1])\r\n", "I=lambda:list(map(int,input().split()))\r\nR=range(I()[0])\r\na=I()\r\nb=I()\r\nc=I()\r\nprint(min(c[i]+c[j]+sum(a[:i]+a[:j]+b[i:]+b[j:])for i in R for j in R if i!=j))", "import sys\nread = lambda: list(map(int, sys.stdin.readline().split()))\nn, = read()\na0s = read()\na1s = read()\nbs = read()\nbest = 10**8\nfor i in range(n):\n for j in range(i+1, n):\n res = sum(a0s[:i]) + sum(a0s[:j]) \\\n + bs[i] + bs[j] \\\n + sum(a1s[i:]) + sum(a1s[j:])\n #print(i, j, res)\n if res < best:\n best = res\n\nprint(best)\n\n" ]

[ "# https://codeforces.com/contest/999\n\nimport sys\nfrom typing import List, Optional\n\ninput = lambda: sys.stdin.readline().rstrip() # faster!\n\nn, m, s = map(int, input().split())\ns -= 1\nadj = [[] for _ in range(n)] # type: List[List[Optional[int]]]\nfor _ in range(m):\n u, v = map(lambda x: int(x) - 1, input().split())\n adj[u] += [v]\n\nreached = [False] * n\nreached[s] = True\nq = [s]\nwhile q:\n v = q.pop()\n for u in adj[v]:\n if not reached[u]:\n reached[u] = True\n q += [u]\n\nnot_yet_reached = []\nn_reachable = [0] * n\nfor i in range(n):\n if not reached[i]:\n not_yet_reached += [i]\n reached_tmp = [False] * n\n reached_tmp[i] = True\n q = [i]\n while q:\n v = q.pop()\n for u in adj[v]:\n if not reached[u] and not reached_tmp[u]:\n reached_tmp[u] = True\n q += [u]\n n_reachable[i] += 1\n\nans = 0\n\nnot_yet_reached.sort(key=lambda i: n_reachable[i], reverse=True)\nfor v in not_yet_reached:\n if not reached[v]:\n ans += 1\n q = [v]\n while q:\n v = q.pop()\n for u in adj[v]:\n if not reached[u]:\n reached[u] = True\n q += [u]\n\nprint(ans)\n", "n, m, s = map(int,input().split())\r\nfrom collections import deque\r\n\r\ngraph = [[] for _ in range(n+1)]\r\n \r\nfor i in range(m):\r\n u, v = map(int, input().split())\r\n graph[u].append(v)\r\n\r\ncover = [[0, 0]]\r\nfor S in range(1, n+1):\r\n dist = [-1] * (n+1)\r\n dist[0] = 0\r\n dist[S] = 0\r\n d = deque()\r\n d.append(S)\r\n tmp = set()\r\n while d:\r\n v = d.popleft()\r\n for i in graph[v]:\r\n if dist[i] != -1:\r\n continue\r\n dist[i] = dist[v] + 1\r\n d.append(i)\r\n tmp.add(i)\r\n cover.append([len(tmp), S])\r\n\r\ncover[s] = [cover[s][0], -1]\r\n\r\ncover.sort(key = lambda x:(-x[0], x[1]))\r\n\r\ncnt = 0\r\ndist = [-1] * (n+1)\r\ndist[0] = 0\r\nfor x, y in cover:\r\n if y == -1:\r\n y = s\r\n\r\n if dist[y] == -1:\r\n if y != s:\r\n cnt += 1\r\n d = deque()\r\n d.append(y)\r\n dist[y] = 0\r\n while d:\r\n v = d.popleft()\r\n for i in graph[v]:\r\n if dist[i] != -1:\r\n continue\r\n dist[i] = dist[v] + 1\r\n d.append(i)\r\n\r\nprint(cnt)", "from collections import defaultdict, deque, Counter\r\nfrom heapq import heapify, heappop, heappush\r\nimport math\r\nfrom copy import deepcopy\r\nfrom itertools import combinations, permutations, product, combinations_with_replacement\r\nfrom bisect import bisect_left, bisect_right\r\n\r\nimport sys\r\n\r\ndef input():\r\n return sys.stdin.readline().rstrip()\r\ndef getN():\r\n return int(input())\r\ndef getNM():\r\n return map(int, input().split())\r\ndef getList():\r\n return list(map(int, input().split()))\r\ndef getListGraph():\r\n return list(map(lambda x:int(x) - 1, input().split()))\r\ndef getArray(intn):\r\n return [int(input()) for i in range(intn)]\r\n\r\nmod = 10 ** 9 + 7\r\nMOD = 998244353\r\n\r\n# import pypyjit\r\n# pypyjit.set_param('max_unroll_recursion=-1')\r\ninf = float('inf')\r\neps = 10 ** (-15)\r\ndy = [0, 1, 0, -1]\r\ndx = [1, 0, -1, 0]\r\n\r\n#############\r\n# Main Code #\r\n#############\r\n\r\n# dfs未使用ver\r\ndef scc(E):\r\n n = len(E)\r\n # rev_Eを作成\r\n r_E = [[] for i in range(n)]\r\n for u in range(n):\r\n for v in E[u]:\r\n r_E[v].append(u)\r\n\r\n # トポロジカルソート\r\n fin = [-1] * n\r\n topo = []\r\n for u in range(n):\r\n if fin[u] != -1:\r\n continue\r\n stack = [u]\r\n while stack:\r\n u = stack[-1]\r\n if fin[u] == -1:\r\n fin[u] = 0\r\n for v in E[u]:\r\n if fin[v] != -1:\r\n continue\r\n stack.append(v)\r\n else:\r\n stack.pop()\r\n if fin[u] == 0:\r\n fin[u] = 1\r\n topo.append(u)\r\n # 逆辺でdfs\r\n res = []\r\n while topo:\r\n u = topo.pop()\r\n if fin[u] != 1:\r\n continue\r\n fin[u] = 2\r\n cur = [u]\r\n i = 0\r\n while i < len(cur):\r\n u = cur[i]\r\n for v in r_E[u]:\r\n if fin[v] == 2:\r\n continue\r\n fin[v] = 2\r\n cur.append(v)\r\n i += 1\r\n res.append(cur)\r\n\r\n g_n = len(res)\r\n n_e = [[] for i in range(g_n)]\r\n roop = [0] * g_n\r\n index = [0] * n\r\n for u in range(g_n):\r\n for v in res[u]:\r\n index[v] = u\r\n for u in range(N):\r\n for v in E[u]:\r\n if index[u] != index[v]:\r\n n_e[index[u]].append(index[v])\r\n else:\r\n roop[index[u]] = 1\r\n\r\n return g_n, res, index, n_e, roop\r\n\r\nN, M, S = getNM()\r\nE = [[] for i in range(N)]\r\nfor _ in range(M):\r\n u, v = getNM()\r\n E[u - 1].append(v -1)\r\ng_n, res, index, n_e, _ = scc(E)\r\nq = deque([index[S - 1]])\r\nignore = [0] * g_n\r\nignore[index[S - 1]] = 1\r\nwhile q:\r\n u = q.popleft()\r\n for v in n_e[u]:\r\n if ignore[v] == 0:\r\n ignore[v] = 1\r\n q.append(v)\r\n\r\nans = 0\r\nfor i in range(g_n):\r\n if ignore[i] == 1:\r\n continue\r\n ignore[i] = 1\r\n ans += 1\r\n q = deque([i])\r\n while q:\r\n u = q.popleft()\r\n for v in n_e[u]:\r\n if ignore[v] == 0:\r\n ignore[v] = 1\r\n q.append(v)\r\nprint(ans)", "from heapq import heappush, heappop, heapify\r\nfrom collections import defaultdict, Counter, deque\r\nfrom functools import lru_cache\r\nimport threading\r\nimport sys\r\nimport bisect\r\ninput = sys.stdin.readline\r\ndef ri(): return int(input())\r\ndef rs(): return input()\r\ndef rl(): return list(map(int, input().split()))\r\ndef rls(): return list(input().split())\r\n\r\n\r\nthreading.stack_size(10**8)\r\nsys.setrecursionlimit(10**6)\r\n\r\n\r\ndef main():\r\n n, m, s = rl()\r\n g = defaultdict(list)\r\n for _ in range(m):\r\n u, v = rl()\r\n g[u].append(v)\r\n vis = [False]*(n+1)\r\n q = []\r\n\r\n def ss(cn):\r\n if not vis[cn]:\r\n vis[cn] = True\r\n for nn in g[cn]:\r\n ss(nn)\r\n q.append(cn)\r\n\r\n for i in range(1, n+1):\r\n ss(i)\r\n\r\n q = q[::-1]\r\n\r\n vis = [False]*(n+1)\r\n res = 0\r\n ss(s)\r\n for i in q:\r\n if vis[i]:\r\n continue\r\n ss(i)\r\n res += 1\r\n print(res)\r\n\r\n pass\r\n\r\n\r\n# for _ in range(ri()):\r\n# main()\r\nthreading.Thread(target=main).start()\r\n", "import sys\r\n \r\n \r\ndef dfs(u):\r\n avail[u] = False\r\n for v in g[u]:\r\n if avail[v]:\r\n dfs(v)\r\n topo.append(u)\r\n \r\n \r\nsys.setrecursionlimit(6000)\r\nn, m, s = map(int, input().split())\r\ng = [[] for _ in range(n)]\r\nfor _ in range(m):\r\n u, v = map(int, input().split())\r\n g[u - 1].append(v - 1)\r\navail, topo = [True] * n, []\r\nfor i,a in enumerate(avail):\r\n if a:\r\n dfs(i)\r\navail, res = [True] * n, 0\r\ndfs(s - 1)\r\nfor i in reversed(topo):\r\n if avail[i]:\r\n res += 1\r\n dfs(i)\r\nprint(res)", "#mathus\r\n(n, m, s) = map(int, input().split(' '))\r\ns -= 1\r\nroads = [[int(__)-1 for __ in input().split(' ')] for _ in range(m)]\r\n\r\nans = 0\r\n\r\nvisited = [False for i in range(n)]\r\nnexts = [[] for i in range(n)]\r\nprevious = [[] for i in range(n)]\r\nfor (a, b) in roads:\r\n nexts[a].append(b)\r\n previous[b].append(a)\r\n\r\ndef bfs(start):\r\n q = set([start,])\r\n while len(q) > 0:\r\n current = q.pop()\r\n if not visited[current]:\r\n visited[current] = True\r\n for nextCity in nexts[current]:\r\n q.add(nextCity)\r\n\r\ndef reverseBfs(start):\r\n toReturn = start\r\n q = set([start,])\r\n rvisited = set()\r\n while len(q) > 0:\r\n current = q.pop()\r\n if current not in rvisited:\r\n rvisited.add(current)\r\n if len(previous[current]) == 0:\r\n return current\r\n else:\r\n for prevCity in previous[current]:\r\n if prevCity not in rvisited:\r\n q.add(prevCity)\r\n else:\r\n toReturn = prevCity\r\n return toReturn\r\n\r\nbfs(s)\r\nfor i in range(n):\r\n if not visited[i]:\r\n bfs(reverseBfs(i))\r\n ans += 1\r\n\r\nprint(ans)", "from collections import *\r\nimport sys\r\nsys.setrecursionlimit(10**4)\r\n\r\nn, m, s = map(int, input().split())\r\ns -= 1\r\nadj = [[] for _ in range(n)]\r\nfor y in range(m):\r\n u, v = map(int, input().split())\r\n adj[u-1].append(v-1)\r\nvis = [0]*n\r\nli = deque()\r\ndef visit(node, t=1):\r\n if not vis[node]:\r\n vis[node] = 1\r\n for c_node in adj[node]:\r\n visit(c_node)\r\n if t:\r\n li.appendleft(node)\r\nfor i in range(n):\r\n visit(i)\r\nvis = [0]*n\r\ncnt = 0\r\nvisit(s, False)\r\nfor i in list(li):\r\n if vis[i]:\r\n continue\r\n visit(i, False)\r\n cnt += 1\r\nprint(cnt)", "import sys\nsys.setrecursionlimit(6000)\n\nn, m, s = map(int, input().split())\ns -= 1\ng = [[] for _ in range(n)]\nfor _ in range(m):\n a, b = map(int, input().split())\n g[a-1].append(b-1)\n\nused = [False] * 5010\ntopo = []\nstack = []\n\nfor i in range(n):\n if not used[i]:\n stack.append(i)\n while stack:\n node = stack[-1]\n if not used[node]:\n used[node] = True\n for c in g[node]:\n if not used[c]:\n stack.append(c)\n else:\n stack.pop()\n topo.append(node)\n\ntopo.reverse()\nfor i in range(n):\n used[i] = False\n\nstack.append(s)\nwhile stack:\n node = stack.pop()\n if not used[node]:\n used[node] = True\n for c in g[node]:\n if not used[c]:\n stack.append(c)\n\nres = 0\nfor v in topo:\n if not used[v]:\n res += 1\n stack.append(v)\n while stack:\n node = stack.pop()\n if not used[node]:\n used[node] = True\n for c in g[node]:\n if not used[c]:\n stack.append(c)\n\nprint(res)\n", "import sys\nsys.setrecursionlimit(6000)\n\ndef read_input():\n n, m, s = map(int, input().split())\n s -= 1\n g = [[] for _ in range(n)]\n for _ in range(m):\n a, b = map(int, input().split())\n g[a-1].append(b-1)\n return n, g, s\n\ndef dfs_order(n, g):\n used = [False] * n\n ordering = []\n stack = []\n\n for i in range(n):\n if not used[i]:\n stack.append(i)\n while stack:\n node = stack[-1]\n if not used[node]:\n used[node] = True\n for c in g[node]:\n if not used[c]:\n stack.append(c)\n else:\n stack.pop()\n ordering.append(node)\n\n ordering.reverse()\n return ordering\n\ndef count_components(n, g, s):\n used = [False] * n\n stack = [s]\n while stack:\n node = stack.pop()\n if not used[node]:\n used[node] = True\n for c in g[node]:\n if not used[c]:\n stack.append(c)\n\n res = 0\n for v in dfs_order(n, g):\n if not used[v]:\n res += 1\n stack = [v]\n while stack:\n node = stack.pop()\n if not used[node]:\n used[node] = True\n for c in g[node]:\n if not used[c]:\n stack.append(c)\n\n return res\n\nn, g, s = read_input()\nres = count_components(n, g, s)\nprint(res)\n", "import sys\r\nfrom collections import defaultdict\r\ninput = sys.stdin.readline \r\n\r\ndef dfs(v, d, s):\r\n v[s] = 1 \r\n q = [s] \r\n c = 0\r\n while(q):\r\n a = q.pop(0) \r\n c += 1\r\n for j in d[a]:\r\n if(not v[j]):\r\n v[j] = 1 \r\n q.append(j) \r\n\r\n return c\r\n\r\nn, m, s = map(int, input().split()) \r\nd = defaultdict(list) \r\nfor i in range(m):\r\n u, v = map(int, input().split()) \r\n d[u].append(v)\r\n \r\nv = [0] * (n + 1)\r\ndfs(v, d, s)\r\nl = []\r\nfor i in range(1, n + 1):\r\n if(not v[i]):\r\n l.append(i)\r\n\r\nfor i in range(len(l)):\r\n v2 = [0] * (n + 1)\r\n l[i] = [dfs(v2, d, l[i]), l[i]]\r\nl.sort(reverse = True)\r\n# print(l)\r\nc = 0\r\nfor i in range(len(l)):\r\n j = l[i][1] \r\n if(not v[j]):\r\n c += 1 \r\n dfs(v, d, j)\r\nprint(c)\r\n\r\n\r\n", "import sys\r\ninput = lambda: sys.stdin.readline().rstrip()\r\n\r\n\r\nfrom typing import List\r\n\r\nclass ProtoBitSet:\r\n\r\n TABLE = bytearray(1 << i for i in range(8))\r\n\r\n def __init__(self, n: int):\r\n self._size = (n >> 3) + 1\r\n self._data = bytearray(self._size)\r\n\r\n def add(self, k: int) -> None:\r\n self._data[k>>3] |= ProtoBitSet.TABLE[k & 7]\r\n\r\n def discard(self, k: int) -> None:\r\n self._data[k>>3] &= ~ProtoBitSet.TABLE[k & 7]\r\n\r\n def __contains__(self, k: int) -> bool:\r\n return self._data[k>>3] >> (k & 7) & 1 == 1\r\n\r\n def __getitem__(self, k: int):\r\n return self._data[k>>3] >> (k & 7) & 1\r\n\r\n def __setitem__(self, k: int, bit: bool):\r\n if bit:\r\n self._data[k>>3] |= ProtoBitSet.TABLE[k & 7]\r\n else:\r\n self._data[k>>3] &= ~ProtoBitSet.TABLE[k & 7]\r\n\r\n def to_l(self) -> List[int]:\r\n return [(i<<3)+j for i, a in enumerate(self.data) for j in range(8) if a >> j & 1 == 1]\r\n\r\n\r\nfrom typing import List\r\n\r\n'''Strongly Connected Components. / O(N+M)'''\r\n# コンセプト: 非再帰/グラフGは単純でなくてもよい\r\ndef get_scc(G: List[List[int]]) -> List[List[int]]:\r\n n = len(G)\r\n rG = [[] for _ in range(n)]\r\n for v in range(n):\r\n for x in G[v]:\r\n rG[x].append(v)\r\n visited = [0] * n\r\n dfsid = [0] * n\r\n now = n\r\n for s in range(n):\r\n if visited[s]: continue\r\n todo = [~s, s]\r\n while todo:\r\n v = todo.pop()\r\n if v >= 0:\r\n if visited[v]: continue\r\n visited[v] = 2\r\n for x in G[v]:\r\n if visited[x]: continue\r\n todo.append(~x)\r\n todo.append(x)\r\n else:\r\n v = ~v\r\n if visited[v] == 1: continue\r\n visited[v] = 1\r\n now -= 1\r\n dfsid[now] = v\r\n res = []\r\n for s in dfsid:\r\n if not visited[s]: continue\r\n todo = [s]\r\n visited[s] = 0\r\n for v in todo:\r\n for x in rG[v]:\r\n if not visited[x]: continue\r\n visited[x] = 0\r\n todo.append(x)\r\n res.append(todo)\r\n return res\r\n\r\n# ----------------------- #\r\n\r\nn, m, s = map(int, input().split())\r\ns -= 1\r\nG = [[] for _ in range(n)]\r\nfor _ in range(m):\r\n u, v = map(int, input().split())\r\n u -= 1\r\n v -= 1\r\n G[u].append(v)\r\nscc = get_scc(G)\r\nok = [ProtoBitSet(n) for i in range(n)]\r\n# ok[i]:= 頂点iから着ける頂点集合\r\nseen = ProtoBitSet(n)\r\ndef dfs(S):\r\n for i in range(n):\r\n seen[i] = 0\r\n todo = [S]\r\n seen.add(S)\r\n while todo:\r\n v = todo.pop()\r\n for x in G[v]:\r\n if x in seen: continue\r\n todo.append(x)\r\n ok[x].add(S)\r\n seen[x] = 1\r\nfor i in range(n):\r\n ok[i][i] = 1\r\n dfs(i)\r\n\r\nstart = []\r\nfor cycle in scc:\r\n if s in cycle:\r\n start = set(cycle)\r\n break\r\nans = 0\r\nfor cycle in scc:\r\n flag = False\r\n for c in cycle:\r\n if not flag:\r\n for e in range(n):\r\n if e not in ok[c]: continue\r\n if e in start:\r\n flag = True\r\n break\r\n for c in cycle:\r\n start.add(c)\r\n if not flag:\r\n ans += 1\r\nprint(ans)", "\r\n\r\nimport sys\r\nsys.setrecursionlimit(100001)\r\nfrom collections import *\r\nd=deque()\r\ndef dfs2(start):\r\n vis[start]=1\r\n for child in adj[start]:\r\n if vis[child]==0:\r\n dfs2(child)\r\n\r\ndef dfs(start):\r\n vis[start]=1\r\n for child in adj[start]:\r\n if vis[child]==0:\r\n dfs(child)\r\n d.appendleft(start)\r\n\r\nn,m,k=map(int,input().split())\r\n\r\nadj=[]\r\nfor i in range(n):\r\n adj.append([])\r\n\r\nfor i in range(m):\r\n a,b=map(int,input().split())\r\n adj[a-1].append(b-1)\r\n\r\nvis=[0]*n\r\nfor i in range(n):\r\n if vis[i]==0:\r\n dfs(i)\r\nvis=[0]*n\r\n\r\ndfs2(k-1)\r\ncnt=0\r\nfor i in d:\r\n if vis[i]==0:\r\n dfs2(i)\r\n cnt+=1\r\nprint(cnt)", "import sys\nsys.setrecursionlimit(6000)\n\nn, m, s = map(int, input().split())\ns -= 1\ng = [[] for _ in range(n)]\nfor _ in range(m):\n a, b = map(int, input().split())\n g[a-1].append(b-1)\n\nused = [False] * 5010\ntopo = []\n\ndef topo_sort(node):\n used[node] = True\n for c in g[node]:\n if not used[c]:\n topo_sort(c)\n topo.append(node)\n\ndef dfs(node):\n used[node] = True\n for c in g[node]:\n if not used[c]:\n dfs(c)\n\nfor i in range(n):\n if not used[i]:\n topo_sort(i)\n\ntopo.reverse()\nfor i in range(n):\n used[i] = False\n\ndfs(s)\nres = 0\nfor v in topo:\n if not used[v]:\n res += 1\n dfs(v)\n\nprint(res)", "# 強連結成分分解(SCC): グラフGに対するSCCを行う\r\n# 入力: <N>: 頂点サイズ, <G>: 順方向の有向グラフ\r\n# 出力: (<ラベル数>, <各頂点のラベル番号>)\r\ndef scc(N, G):\r\n order = []\r\n used = [False]*N\r\n group = [None]*N\r\n RG = [[] for _ in range(N)]\r\n for i in range(N):\r\n for j in G[i]:\r\n RG[j].append(i)\r\n \r\n def dfs(pos):\r\n stack = [(1, pos), (0, pos)]\r\n while stack:\r\n t, pos = stack.pop()\r\n if t == 0:\r\n if used[pos]:\r\n stack.pop()\r\n continue\r\n used[pos] = True\r\n for npos in G[pos]:\r\n if not used[npos]:\r\n stack.append((1, npos))\r\n stack.append((0, npos))\r\n else:\r\n order.append(pos)\r\n\r\n def rdfs(pos, col):\r\n stack = [pos]\r\n group[pos] = col\r\n used[pos] = True\r\n while stack:\r\n pos = stack.pop()\r\n for npos in RG[pos]:\r\n if not used[npos]:\r\n used[npos] = True\r\n group[npos] = col\r\n stack.append(npos)\r\n \r\n for i in range(N):\r\n if not used[i]:\r\n dfs(i)\r\n used = [False]*N\r\n label = 0\r\n for s in reversed(order):\r\n if not used[s]:\r\n rdfs(s, label)\r\n label += 1\r\n return label, group\r\n\r\n# 縮約後のグラフを構築\r\ndef construct(N, G, label, group):\r\n G0 = [set() for i in range(label)]\r\n GP = [[] for i in range(label)]\r\n for v in range(N):\r\n lbs = group[v]\r\n for w in G[v]:\r\n lbt = group[w]\r\n if lbs == lbt:\r\n continue\r\n G0[lbs].add(lbt)\r\n GP[lbs].append(v)\r\n return G0, GP\r\n \r\nn, m, s = map(int, input().split())\r\nedges = [[] for _ in range(n)]\r\nfor _ in range(m):\r\n a, b = map(int, input().split())\r\n a -= 1\r\n b -= 1\r\n edges[a].append(b)\r\n \r\nlabel, group = scc(n, edges)\r\ng0, gp = construct(n, edges, label, group)\r\nin_ = [0] * label\r\nfor i in range(label):\r\n for j in g0[i]:\r\n in_[j] += 1\r\n\r\nans = in_.count(0)\r\ns -= 1\r\ng = group[s]\r\nif in_[g] == 0:\r\n ans -= 1\r\nprint(ans)\r\n\r\n\r\n\r\n", "def main():\r\n from sys import stdin, setrecursionlimit\r\n # setrecursionlimit(1000000)\r\n input = stdin.readline\r\n def iinput(): return int(input())\r\n def sinput(): return input().rstrip()\r\n def i0input(): return int(input()) - 1\r\n def linput(): return list(input().split())\r\n def liinput(): return list(map(int, input().split()))\r\n def miinput(): return map(int, input().split())\r\n def li0input(): return list(map(lambda x: int(x) - 1, input().split()))\r\n def mi0input(): return map(lambda x: int(x) - 1, input().split())\r\n INF = 1000000000000000000\r\n MOD = 1000000007\r\n\r\n N, M, S = miinput()\r\n S -= 1\r\n # g = [[] for _ in [0] * M]\r\n edges = []\r\n\r\n for _ in [0] * M:\r\n a, b = mi0input()\r\n # g[a].append(b)\r\n edges.append((a, b))\r\n \r\n groups = scc(N, edges)\r\n inv_groups = [-1] * N\r\n for i, gr in enumerate(groups):\r\n for u in gr:\r\n inv_groups[u] = i\r\n L = len(groups)\r\n deg = [0] * L\r\n for a, b in edges:\r\n u, v = inv_groups[a], inv_groups[b]\r\n if u != v:\r\n deg[v] += 1\r\n ans = deg.count(0)\r\n if deg[inv_groups[S]] == 0:\r\n ans -= 1\r\n\r\n print(ans)\r\n \r\n \r\ndef scc(N,edges):\r\n M=len(edges)\r\n start=[0]*(N+1)\r\n elist=[0]*M\r\n for e in edges:\r\n start[e[0]+1]+=1\r\n for i in range(1,N+1):\r\n start[i]+=start[i-1]\r\n counter=start[:]\r\n for e in edges:\r\n elist[counter[e[0]]]=e[1]\r\n counter[e[0]]+=1\r\n visited=[]\r\n low=[0]*N\r\n Ord=[-1]*N\r\n ids=[0]*N\r\n NG=[0,0]\r\n def dfs(v):\r\n stack=[(v,-1,0),(v,-1,1)]\r\n while stack:\r\n v,bef,t=stack.pop()\r\n if t:\r\n if bef!=-1 and Ord[v]!=-1:\r\n low[bef]=min(low[bef],Ord[v])\r\n stack.pop()\r\n continue\r\n low[v]=NG[0]\r\n Ord[v]=NG[0]\r\n NG[0]+=1\r\n visited.append(v)\r\n for i in range(start[v],start[v+1]):\r\n to=elist[i]\r\n if Ord[to]==-1:\r\n stack.append((to,v,0))\r\n stack.append((to,v,1))\r\n else:\r\n low[v]=min(low[v],Ord[to])\r\n else:\r\n if low[v]==Ord[v]:\r\n while(True):\r\n u=visited.pop()\r\n Ord[u]=N\r\n ids[u]=NG[1]\r\n if u==v:\r\n break\r\n NG[1]+=1\r\n low[bef]=min(low[bef],low[v])\r\n for i in range(N):\r\n if Ord[i]==-1:\r\n dfs(i)\r\n for i in range(N):\r\n ids[i]=NG[1]-1-ids[i]\r\n group_num=NG[1]\r\n counts=[0]*group_num\r\n for x in ids:\r\n counts[x]+=1\r\n groups=[[] for i in range(group_num)]\r\n for i in range(N):\r\n groups[ids[i]].append(i)\r\n return groups\r\n\r\n\r\nmain()" ]

[ "# Codeforces Beta Round #22 (Div. 2 Only)\n# B. Bargaining Table\n\nn, m = map(int, input().split())\noffice = []\nfor _ in range(n):\n office += [list(input())]\n\n# dp is a set of 4-tuples (x, y, l, w) which describes the coordinates of a\n# table. (x, y, l, w) is in dp iff the rectangle from (x, y) to (x + l, y + w)\n# is free\ndp = set()\n\n# First add 1x1 tables\nfor i in range(n):\n for j in range(m):\n if office[i][j] == '0':\n dp.add((i, j, 1, 1))\n\n# Then add 1xn tables\nfor x in range(n):\n for y in range(m):\n\n for length in range(1, m - y + 1):\n if office[x][y + length - 1] == '0':\n dp.add((x, y, 1, length))\n else:\n break\n\n# Then add nx1 tables\nfor x in range(n):\n for y in range(m):\n\n for height in range(1, n - x + 1):\n if office[x + height - 1][y] == '0':\n dp.add((x, y, height, 1))\n else:\n break\n\nfor x in range(n):\n for y in range(m):\n\n if office[x][y] == '1':\n continue\n\n for length in range(2, m - y + 1):\n for height in range(2, n - x + 1):\n\n if (x, y, height - 1, length) in dp and \\\n (x, y, height, length - 1) in dp and \\\n office[x + height - 1][y + length - 1] == '0':\n dp.add((x, y, height, length))\n\nmax_perimeter = 0\nfor x, y, l, w in dp:\n max_perimeter = max(max_perimeter, 2 * (l + w))\n\nprint(max_perimeter)\n", "# LUOGU_RID: 102536606\nn, m = map(int, input().split())\r\ns = [input() for _ in range(n)]\r\nans = 0\r\nfor i in range(n):\r\n for j in range(m):\r\n for k in range(i, n):\r\n for l in range(j, m):\r\n if all(s[x][j:l+1] == '0' * (l - j + 1) for x in range(i, k + 1)):\r\n ans = max(ans, 2 * (k - i + l - j + 2))\r\nprint(ans)\r\n", "import sys\n\ndim_list = sys.stdin.readline().split()\nn, m = int(dim_list[0]), int(dim_list[1])\n\n# T[h_m][h_M][w_m][w_M]\nT =[[[[-1 for l in range(m)] for k in range(m)] for j in range(n)] for i in range(n)]\n\n#initialize 1x1 rectangles\nfor i in range(n):\n row = sys.stdin.readline()\n for j in range(m):\n T[i][i][j][j] = int(row[j])\n\n#maximum perimeter found so far\nmax_per = 4\n\n# Increase k=length+width. Start with k=2 and increment by 1\nfor k in range(3,n+m+1): # 2 <= k <= n+m\n found_k = 0 #if we find rectangle where width+height=k set to 1\n # Let h denote the height of the rectangle and w the width\n # 1 =< h <= n , 1 <= w <= m so for any given k we must have\n # max(1,k-m) =< h <= min(n,k-1) and w=k-h\n low = max(1,k-m)\n high = min(n,k-1)\n for h in range(low,high+1):\n w=k-h\n for x_m in range(n-h+1):\n for y_m in range(m-w+1):\n if h==1: #w can't be 1 since k>=3 \n if (T[x_m][x_m][y_m][y_m+w-2]==0 and T[x_m][x_m][y_m+w-1][y_m+w-1]==0):\n T[x_m][x_m+h-1][y_m][y_m+w-1] = 0\n max_per = 2*k\n elif w==1:\n if (T[x_m][x_m+h-2][y_m][y_m]==0 and T[x_m+h-1][x_m+h-1][y_m][y_m]==0):\n T[x_m][x_m+h-1][y_m][y_m+w-1] = 0\n max_per = 2*k\n else:\n if (T[x_m][x_m+h-2][y_m][y_m+w-1]==0 and T[x_m][x_m+h-1][y_m][y_m+w-2]==0 and T[x_m+h-1][x_m+h-1][y_m+w-1][y_m+w-1]==0):\n T[x_m][x_m+h-1][y_m][y_m+w-1] = 0\n max_per = 2*k\n\nprint(max_per)\n", "n, m = map(int, input().split())\na = [input() for _ in range(n)]\npref = [[0] * (m + 1) for _ in range(n + 1)]\nfor i in range(1, n + 1):\n for j in range(1, m + 1):\n pref[i][j] = pref[i - 1][j] + pref[i][j - 1] - pref[i - 1][j - 1] + int(a[i - 1][j - 1])\nbest = 0\nfor i1 in range(n):\n for i2 in range(i1, n):\n for j1 in range(m):\n for j2 in range(j1, m):\n if pref[i2 + 1][j2 + 1] - pref[i2 + 1][j1] - pref[i1][j2 + 1] + pref[i1][j1] == 0:\n best = max(best, (i2 - i1 + j2 - j1 + 2) * 2)\nprint(best)", "n, m = map(int, input().split())\r\ninput = [input() for _ in range(n)]\r\n\r\nd = []\r\nfor _ in range(n):\r\n\td.append([0 for _ in range(m)])\r\n\r\ndef a(i,j):\r\n\treturn 0 if i<0 or j<0 else d[i][j]\r\n\t\r\nfor i in range(n):\r\n\tfor j in range(m):\r\n\t\td[i][j] = int(input[i][j]) - a(i-1,j-1) + a(i,j-1) + a(i-1,j)\r\n\r\np = 0\r\nfor i in range(n):\r\n\tfor j in range(m):\r\n\t\tfor u in range(i, n):\r\n\t\t\tfor v in range(j, m):\r\n\t\t\t\tx = a(u,v) - a(u,j-1) - a(i-1,v) + a(i-1,j-1)\r\n\t\t\t\tif x == 0:\r\n\t\t\t\t\tp = max(p, u + v - i - j)\r\nprint(p + p + 4)", "#def checkit(c,d,e,f):\r\n# a=True\r\n# b=2*(e-c+f-d+2)\r\n# for i in range(e-c+1):\r\n# for j in range(f-d+1):\r\n# if y[i+c][j+d]==str(1):\r\n# a=False\r\n# break\r\n# if a:\r\n# return b\r\n# else:\r\n# return -1\r\nn,m=map(int,input().split())\r\ny=[input() for i in range(n)]\r\nv=0\r\nfor i in range(n):\r\n for j in range(m):\r\n for k in range(i,n):\r\n for s in range(j,m):\r\n if all(y[x][j:s+1]=='0'*(s-j+1) for x in range(i,k+1)):\r\n v=max(v,2*(k-i+s-j+2))\r\nprint(v)\r\n", "def goDown(start, i, j, l):\n\trowsFound = 0\n\twhile i<n and sum(l[i][start:j+1])==0:\n\t\t# print(l[i][start:j+1], end = \" \")\n\t\trowsFound+=1\n\t\ti+=1\n\t# print(\"Rows Found:\", rowsFound, end = \" \")\n\treturn rowsFound\ndef start(i, j, n, m, l):\n\tj1 = j\n\t# print((i, j))\n\tperimeter = 0\n\twhile j < m:\n\t\t# print(j1, j, perimeter, \"width =\", j-j1+1, \"height:\", goDown(j1, i+1, j, l) + 1, end = \" \")\n\t\tif l[i][j] ==0:\n\t\t\twidth = j-j1+1\n\t\t\theight = goDown(j1, i+1, j, l) + 1\n\t\t\t\n\t\t\tperimeter = max(perimeter, (2* (width + height)))\n\t\t\t# print(\"MAXI:\", perimeter)\n\t\telse:\n\t\t\tj1 = j+1\n\t\t# print(\"Looping:\", perimeter)\n\t\tj+=1\n\t\t# print(perimeter)\n\treturn perimeter\n\t\ndef solve(n, m, l):\n\tperimeter = 0\n\t# print(l)\n\tfor i in range(n):\n\t\tfor j in range(m):\n\t\t\t# print(i, j, n, m)\n\t\t\tif l[i][j] == 0:\n\t\t\t\tperimeter = max(start(i, j, n, m, l), perimeter)\n\tprint(perimeter)\n\t\t\t\nn, m = map(int, input().split())\nl = []\nfor _ in range(n):\n\ts = input()\n\trow = []\n\tfor i in range(len(s)):\n\t\trow.append(int(s[i]))\n\tl.append(row)\n# print(l)\nsolve(n, m, l)\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\n\r\ng, v = [input() for i in range(n)], 0\r\n\r\nfor i in range(n):\r\n\r\n for j in range(m):\r\n\r\n for k in range(i, n):\r\n\r\n for l in range(j, m):\r\n\r\n if all(g[a][j:l + 1] == '0' * (l - j + 1) for a in range(i, k + 1)):\r\n\r\n v = max(v, 2 * (k - i + l - j + 2))\r\n\r\nprint(v)\r\n", "n,m=map(int,input().split())\r\na=[]\r\nfor i in range(n):\r\n a.append([])\r\n for x in input():\r\n if x==\"0\":\r\n a[i].append(0)\r\n else:\r\n a[i].append(1)\r\nans=0\r\nfor x1 in range(0,m):\r\n for x2 in range(x1,m):\r\n for y1 in range(0,n):\r\n for y2 in range(y1,n):\r\n z=0\r\n for k in range(y1,y2+1):\r\n z+=sum(a[k][x1:x2+1])\r\n if z==0:\r\n ans=max(ans,2*(x2-x1+1+y2-y1+1))\r\nprint(ans)\r\n \r\n", "n, m = map(int, input().split())\r\nX = []\r\nfor i in range(n):\r\n temp = list(str(input()))\r\n temp = [int(c) for c in temp]\r\n X.append(temp)\r\n\r\ns = [[0]*(m+1) for _ in range(n+1)]\r\nfor i in range(n):\r\n for j in range(m):\r\n s[i+1][j+1] = s[i+1][j] + s[i][j+1] - s[i][j] + X[i][j]\r\n\r\nans = 0\r\nfor y1 in range(n):\r\n for x1 in range(m):\r\n for y2 in range(y1, n):\r\n for x2 in range(x1, m):\r\n cnt = s[y2+1][x2+1] - s[y1][x2+1] - s[y2+1][x1] + s[y1][x1]\r\n if cnt == 0:\r\n ans = max(ans, (y2-y1+1)*2+(x2-x1+1)*2)\r\nprint(ans)\r\n", "n,m=map(int,input().split())\na=[list(map(int,input())) for _ in range(n)]\nhlf=2\nfor ra in range(n):\n for rb in range(ra,n):\n cols=[]\n for cc in range(m):\n ok=1\n for rr in range(ra,rb+1):\n if a[rr][cc]:\n ok=0\n break\n if ok:\n cols.append(cc)\n hlf=max(hlf,rb-ra+1+len(cols))\n else:\n cols=[]\nprint(hlf*2)\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\ndp = [[0 for j in range(m)] for i in range(n)]\r\nmp = []\r\nfor i in range(n):\r\n mp.append(input())\r\n for j in range(m):\r\n if mp[i][j] == '1':\r\n continue\r\n if not i or mp[i-1][j]=='1':\r\n dp[i][j] = 1\r\n else:\r\n dp[i][j] = dp[i-1][j]+1\r\nans = 0\r\nfor i in range(n):\r\n for j in range(m):\r\n for k in range(1, dp[i][j]+1):\r\n l = j\r\n while l >= 0 and dp[i][l] >= k:\r\n l -= 1\r\n ans = max(ans, (j-l)+k)\r\nprint (ans<<1)", "n, m = [int(x) for x in input().split()]\nlines = []\nfor y in range(n):\n s = input()\n lines.append(s)\n\nrightest = {} # (x, y) --> how far to the right can go\nlowest = {} # (x, y) --> how low can go\n\nfor start_y in range(n):\n for start_x in range(m):\n p = (start_x, start_y)\n if lines[start_y][start_x] == '1':\n rightest[p] = -1\n lowest[p] = -1\n continue\n r = start_x\n while r+1 < m and lines[start_y][r+1] == '0':\n r += 1\n rightest[p] = r\n l = start_y\n while l+1 < n and lines[l+1][start_x] == '0':\n l += 1\n lowest[p] = l\n\ncur_max = None\nfor start_y in range(n):\n for start_x in range(m):\n # print(start_x, start_y)\n if lines[start_y][start_x] == '1':\n continue\n p = (start_x, start_y)\n cur_r = None # rightest[p]\n for y in range(start_y, lowest[p] + 1):\n new_r = rightest[(start_x, y)]\n # print(\"newr({start_x}, {y}): \".format(start_x=start_x, y=y), new_r)\n if cur_r is None or new_r < cur_r:\n cur_r = new_r\n newp = 2*(cur_r-start_x+1) + 2*(y - start_y+1)\n if cur_max is None or newp > cur_max:\n # print(\"updating from: \", cur_max, \" to: \", newp)\n cur_max = newp\nprint(cur_max)\n\t\t \t \t \t \t \t\t \t \t \t \t \t", "n,m=map(int,input().split())\r\ns=[list(input()) for i in range(n)]\r\ncnt=[[0]*(m+1) for i in range(n+1)]\r\nfor i in range(n):\r\n for j in range(m):\r\n if s[i][j]==\"1\":\r\n cnt[i+1][j+1]+=1\r\nfor i in range(n):\r\n for j in range(m+1):\r\n cnt[i+1][j]+=cnt[i][j]\r\nfor i in range(n+1):\r\n for j in range(m):\r\n cnt[i][j+1]+=cnt[i][j]\r\nans=0\r\nfor l in range(m+1):\r\n for r in range(l+1,m+1):\r\n for u in range(n+1):\r\n for d in range(u+1,n+1):\r\n c=cnt[d][r]-cnt[d][l]-cnt[u][r]+cnt[u][l]\r\n if c==0:\r\n ans=max(ans,(r-l)*2+(d-u)*2)\r\nprint(ans)", "n,m=map(int,input().split())\r\nc=[input()for i in range(n)]\r\ns=0\r\nfor i in range(n):\r\n for j in range(m):\r\n for k in range(i,n):\r\n for l in range(j,m):\r\n if all(c[x][j:l+1]==\"0\"*(l-j+1)for x in range(i,k+1)) :\r\n s=max(s,2*(k-i+l-j+2))\r\nprint(s)", "R = lambda: map(int, input().split())\r\nn, m = R()\r\nrm = [list(map(int, input())) for i in range(n)]\r\ndp = [[0] * (m + 1) for _ in range(n + 1)]\r\nfor i in range(n):\r\n for j in range(m):\r\n dp[i][j] = rm[i][j] + dp[i - 1][j] + dp[i][j - 1] - dp[i - 1][j - 1]\r\nres = 0\r\nfor r1 in range(n):\r\n for c1 in range(m):\r\n for r2 in range(r1, n):\r\n for c2 in range(c1, m):\r\n if not dp[r2][c2] - dp[r1 - 1][c2] - dp[r2][c1 - 1] + dp[r1 - 1][c1 - 1]:\r\n res = max(res, 2 * (c2 - c1 + r2 - r1 + 2))\r\nprint(res)", "n, m = map(int, input().split())\r\na = [list(map(int, input())) for i in range(n)]\r\np = [[0] * (m + 3) for i in range(n + 3)]\r\nfor i in range(n):\r\n for j in range(m):\r\n p[i][j] = p[i - 1][j] + p[i][j - 1] - p[i - 1][j - 1] + a[i][j]\r\nans = 0 \r\nfor i1 in range(n):\r\n for j1 in range(m):\r\n for i2 in range(i1, n):\r\n for j2 in range(j1, m):\r\n cur = (i2 - i1 + 1) * 2 + (j2 - j1 + 1) * 2\r\n Sum = p[i2][j2] - p[i1 - 1][j2] - p[i2][j1 - 1] + p[i1 - 1][j1 - 1]\r\n if Sum == 0 and cur > ans:\r\n ans = cur\r\nprint(ans)\r\n", "\nnm = input().split()\nn = int(nm[0])\nm = int(nm[1])\n\nroom = []\nfor row in range(n):\n room.append(input())\n\nbest = 0\nfor row in range(n):\n for col in range(m):\n if room[row][col] == '1':\n continue\n col2 = m\n row2 = row\n while row2 < n:\n col3 = col\n while col3 < col2:\n if room[row2][col3] == '1':\n break\n col3 += 1\n col2 = col3\n row2 += 1\n if col2 != col and row2 != row:\n score = (col2-col)+(row2-row)\n# print(col, row, col2, row2, score)\n best = max(best, score)\n\nprint(2*best) \n\n\t\t\t \t \t \t\t \t\t\t\t\t \t\t \t\t \t\t", "def main():\r\n n, m = map(int, input().split())\r\n prev_row = [0 for _ in range(m)]\r\n max_perimeter = 4\r\n for _ in range(n):\r\n current = input()\r\n current_row = []\r\n for j in range(m):\r\n if current[j] == '1':\r\n current_row.append(0)\r\n else:\r\n current_row.append(prev_row[j] + 1)\r\n max_height = 100\r\n for k in range(j, -1, -1):\r\n if current_row[k] == 0:\r\n break\r\n max_height = min(max_height, current_row[k])\r\n max_perimeter = max(max_perimeter, (max_height + (j - k + 1)) * 2)\r\n prev_row = current_row\r\n\r\n print(max_perimeter)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "def bargaining(n, m, o):\r\n ans = 0\r\n for i in range(n):\r\n for j in range(m):\r\n for k in range(i, n):\r\n for l in range(j, m):\r\n if False not in [o[x][j:l + 1] == \"0\" * (l - j + 1) for x in range(i, k + 1)]:\r\n ans = max(ans, 2 * (k - i + l - j + 2)) # Sides are j-l+1 and k-i+1\r\n print(ans)\r\n\r\n\r\ndef main():\r\n n, m = map(int, input().split())\r\n o = tuple(input() for _ in range(n))\r\n bargaining(n, m, o)\r\n\r\n\r\ndef main2():\r\n n, m = (3, 3)\r\n o = ((\"000\"), (\"010\"), (\"000\"))\r\n print(o)\r\n bargaining(n, m, o)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n # main2()\r\n", "n,m=map(int,input().split())\r\nL=[list(map(int,input())) for i in range(n)]\r\nA=[[0]*(m+1) for i in range(n)] # A[n][m+1]\r\nfor i in range(n):\r\n for j in range(m):\r\n A[i][j+1]=A[i][j]+L[i][j]\r\n\r\n## L[i][j]+L[i][j+1]+L[i][j+2]+...+L[i][k] = A[i][k+1]-A[i][j]\r\n\r\nout=0\r\nfor x1 in range(m):\r\n for x2 in range(x1,m):\r\n s=0\r\n for y in range(n):\r\n if A[y][x2+1]-A[y][x1]==0:\r\n s+=1\r\n out=max(out,((x2-x1+1)+s)*2)\r\n else:\r\n s=0\r\nprint(out)\r\n", "\"\"\"http://codeforces.com/problemset/problem/22/B\"\"\"\ngraph = []\n\ndef perimeter(x0, y0, x1, y1):\n return (x1 - x0 + 1) * 2 + (y1 - y0 + 1) * 2\n\ndef check(x0, y0, x1, y1):\n for i in range(x0, x1 + 1):\n for j in range(y0, y1 + 1):\n if graph[i][j] == '1': return False\n return True\n\ndef solve(n, m, graph):\n res = 4\n for i in range(n):\n for j in range(m):\n for ii in range(i, n):\n for jj in range(j, m):\n if not check(i, j, ii, jj): continue\n res = max(res, perimeter(i, j, ii, jj))\n return res\n\nif __name__ == '__main__':\n n, m = map(int, input().split())\n for _ in range(n):\n graph.append(list(input()))\n print(solve(n, m, graph))\n", "def func(a,b):\r\n for i in range(min(a[0],b[0]),max(a[0],b[0])+1):\r\n\r\n for j in range(min(a[1],b[1]),max(a[1],b[1])+1):\r\n\r\n if matx[i][j]==1:\r\n return False\r\n return True\r\nn,m=map(int,input().split())\r\nx=[]\r\n\r\nmatx=[[int(X) for X in list(input().strip()) ] for i in range(n)]\r\n\r\n\r\n\r\n\r\n\r\nfor i in range(n):\r\n for j in range(m):\r\n\r\n x.append((i,j))\r\nan=-1\r\nfor i in range(len(x)):\r\n for j in range(len(x)):\r\n if func(x[i],x[j]):\r\n an=max(an, 2*abs(x[i][0]-x[j][0]+1)+2*abs(x[i][1]-x[j][1]+1))\r\nprint(an)", "\"\"\"http://codeforces.com/problemset/problem/22/B\"\"\"\n\ngraph = []\n\ndef perimeter(x0, y0, x1, y1):\n return (x1 - x0 + 1) * 2 + (y1 - y0 + 1) * 2\n\ndef is_valid(g, k, x0, y0, x1, y1):\n ok = k.get((x0, y0, x1, y1))\n if ok is None:\n ok = g[x1][y1] == '0'\n if x1 > x0:\n ok = ok and is_valid(g, k, x0, y0, x1 - 1, y1)\n if y1 > y0:\n ok = ok and is_valid(g, k, x0, y0, x1, y1 - 1)\n k[(x0, y0, x1, y1)] = ok\n return ok\n\ndef topdown_dp(n, m, g):\n k = {(i, j, i, j): True if g[i][j] == '0' else False\n for i in range(n) for j in range(m)}\n best = -1\n for i in range(n):\n for j in range(m):\n for ii in range(i, n):\n for jj in range(j, m):\n if is_valid(g, k, i, j, ii, jj):\n best = max(best, perimeter(i, j, ii, jj))\n return best\n\nif __name__ == '__main__':\n n, m = map(int, input().split())\n for _ in range(n):\n graph.append(input())\n print(topdown_dp(n, m, graph))\n", "#!/usr/bin/python3\nimport sys\ninput = lambda: sys.stdin.readline().strip()\nn, m = [int(x) for x in input().split()]\ng = [input() for i in range(n)]\nprint(max(2 * (ii - i) + 2 * (jj - j) for i in range(n) for j in range(m) for ii in range(i + 1, n + 1) for jj in range(j + 1, m + 1) if all(g[iii][jjj] == '0' for iii in range(i, ii) for jjj in range(j, jj))))\n", "n,m = map(int, input().split())\r\ns=''\r\nfor i in range(n):\r\n s += input()\r\n \r\ndef is_possible(p,q,r):\r\n for i in range(p,p+q):\r\n for j in range(r):\r\n if s[i+j*m] == \"1\":\r\n return False\r\n return True\r\n \r\n \r\nans=1\r\nfor i in range(m*n):\r\n max_cols = n - i // m\r\n max_rows = m - i % m\r\n for j in range(1,max_rows+1):\r\n for k in range(1,max_cols+1):\r\n perimeter = 2*(j+k)\r\n if perimeter > ans and is_possible(i,j,k):\r\n ans=perimeter\r\nprint(ans)", "import sys; R = sys.stdin.readline\r\nS = lambda: map(int,R().split())\r\n\r\nn,m = S()\r\na = [R().rstrip() for _ in range(n)]\r\nd = {}\r\nr = 4\r\nfor i in range(n):\r\n for j in range(m):\r\n if a[i][j]=='1': continue\r\n d[(i,j,i,j)] = 1\r\n for l in range(j+1,m):\r\n if a[i][l]=='1': break\r\n d[(i,j,i,l)] = 1\r\n r = max(r,2*(l-j)+4)\r\n for k in range(i+1,n):\r\n if a[k][j]=='1': break\r\n d[(i,j,k,j)] = 1\r\n r = max(r,2*(k-i)+4)\r\n for l in range(j+1,m):\r\n if a[k][l]=='1': break\r\n if (i,j,k-1,l) in d and (i,j,k,l-1) in d:\r\n d[(i,j,k,l)] = 1\r\n r = max(r,2*(k-i+l-j)+4)\r\nprint(r)", "n,m = [int(i) for i in input().split()]\r\n\r\nmatriz = []\r\n\r\nfor i in range(n):\r\n matriz.append(input())\r\n \r\n\r\nans = 4\r\n\r\nfor i in range(n):\r\n for j in range(m): \r\n for k in range(i,n):\r\n for l in range(j,m):\r\n #print(i,j,k,l)\r\n block = False\r\n for x in range(i,k+1):\r\n for y in range(j,l+1):\r\n if matriz[x][y] == '1':\r\n block = True\r\n if not block:\r\n ans = max(ans, (k+1-i)*2 + (l+1-j)*2)\r\nprint(ans) ", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn, m = map(int, input().split())\r\ndp = [[0] * (m + 1)]\r\nfor i in range(1, n + 1):\r\n s = list(input().rstrip())\r\n dp0 = [0] * (m + 1)\r\n for j in range(m):\r\n if s[j] == \"1\":\r\n dp0[j + 1] = 1\r\n for j in range(1, m + 1):\r\n dp0[j] += dp0[j - 1]\r\n dp.append(list(dp0))\r\nfor i in range(1, n + 1):\r\n for j in range(1, m + 1):\r\n dp[i][j] += dp[i - 1][j]\r\nans = 0\r\nfor i in range(n + 1):\r\n for j in range(m + 1):\r\n for k in range(i + 1, n + 1):\r\n for l in range(j + 1, m + 1):\r\n c = dp[i][j] + dp[k][l] - dp[i][l] - dp[k][j]\r\n if c:\r\n continue\r\n ans = max(ans, k + l - (i + j))\r\nans *= 2\r\nprint(ans)", "n, m = map(int, input().split())\r\ns = [[0] + list(map(int, input())) for i in range(n)]\r\nfor i in range(n):\r\n for j in range(m): s[i][j + 1] += s[i][j]\r\nd = 1\r\nfor i in range(0, m):\r\n for j in range(i + 1, m + 1):\r\n t = [-1] + [k for k in range(n) if s[k][j] - s[k][i]] + [n]\r\n p = max(t[i + 1] - t[i] for i in range(len(t) - 1))\r\n if p > 1:\r\n p += j - i\r\n if p > d: d = p\r\nprint(2 * (d - 1))" ]

[ "t = input().split(',')\r\nw = t[::2]\r\nc = list(map(lambda x : int(x), t[1::2]))\r\n\r\nmax_d = 0\r\ncur_d = 0\r\ncnt = [10**6]\r\n\r\nans = [[] for i in range(10**6)]\r\n\r\n\r\ni = 0\r\nwhile i < len(w):\r\n\tans[cur_d].append(w[i])\r\n\tcnt[cur_d] -= 1\r\n\tif c[i] > 0:\r\n\t\tcnt.append(c[i])\r\n\t\tcur_d += 1\r\n\t\tmax_d = max(max_d, cur_d)\r\n\telse:\r\n\t\twhile cnt[cur_d] == 0:\r\n\t\t\tcnt.pop()\r\n\t\t\tcur_d -= 1\r\n\ti += 1\r\n\r\n\r\nprint(max_d + 1)\r\nfor i in range(max_d + 1):\r\n\tprint(' '.join(ans[i]))", "from collections import defaultdict\r\ns = [i for i in input().split(\",\")]\r\narr = []\r\nn = len(s)\r\nlvl = 0\r\nlevels = []\r\nfor i in range(1, n, 2):\r\n if(not arr):\r\n arr.append(s[i-1])\r\n arr.append(int(s[i]))\r\n levels.append([s[i-1], lvl])\r\n lvl+=1\r\n else:\r\n while(arr and arr[-1]==0):\r\n arr.pop()\r\n arr.pop()\r\n lvl-=1\r\n if(arr):\r\n arr[-1]-=1\r\n arr.append(s[i-1])\r\n arr.append(int(s[i]))\r\n levels.append([s[i-1], lvl])\r\n lvl+=1\r\nd = defaultdict(list)\r\nans = 0\r\nfor st, val in levels:\r\n ans = max(ans, val)\r\n d[val].append(st)\r\nprint(ans+1)\r\nfor i in range(ans+1):\r\n print(*d[i])\r\n", "text = input()\r\ndepth = 0\r\nh_text = []\r\ncnt = [1000000]\r\nfor s in text.split(','):\r\n try:\r\n k = int(s)\r\n except:\r\n while cnt[depth] == 0:\r\n depth -= 1\r\n\r\n cnt[depth] -= 1\r\n if depth == len(h_text):\r\n h_text.append([])\r\n\r\n h_text[depth].append(s)\r\n depth += 1\r\n else:\r\n if depth == len(cnt):\r\n cnt.append(0)\r\n \r\n cnt[depth] = k\r\n\r\nprint(len(h_text))\r\nfor row in h_text:\r\n print(*row)", "\r\n\"\"\"\r\n\r\n\"\"\"\r\n\r\nimport sys\r\nfrom sys import stdin\r\n\r\nsa = list(stdin.readline()[:-1].split(\",\"))\r\n\r\nS = []\r\n\r\nfor i in range(0,len(sa),2):\r\n\r\n c = sa[i]\r\n x = int(sa[i+1])\r\n\r\n S.append( (c,x) )\r\n\r\nans = []\r\n\r\nstk = []\r\n\r\nfor tup in S:\r\n\r\n c,x = tup\r\n while stk and stk[-1][1] == 0:\r\n del stk[-1]\r\n\r\n while len(ans) <= len(stk):\r\n ans.append([])\r\n\r\n ans[len(stk)].append( c )\r\n\r\n if len(stk) > 0:\r\n stk[-1][1] -= 1\r\n stk.append( [c,x] )\r\n\r\nprint (len(ans))\r\n\r\nANS = []\r\nfor i in ans:\r\n ANS.append(\" \".join(i))\r\nprint (\"\\n\".join(ANS))\r\n", "v = input().strip().split(',')\nv = [(v[i*2], int(v[i*2+1])) for i in range(len(v)//2)]\nn = len(v)\n\nf = {}\ns = [1000000]\nfor i in range(n):\n x, m = v[i]\n d = len(s)\n if d not in f:\n f[d] = []\n f[d].append(x)\n s.append(m)\n while s[-1] <= 0:\n s.pop()\n s[-1] -= 1\n\nr = sorted([(k, v) for k, v in f.items()])\nprint(len(r))\nfor i in range(len(r)):\n print(' '.join(r[i][1]))\n", "from collections import deque\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 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\ns = input()\r\nA = s.split(\",\")\r\nix = 0\r\nroot = []\r\n\r\n\r\n@bootstrap\r\ndef parse(i):\r\n global ix\r\n name = A[ix]\r\n ix += 1\r\n k = int(A[ix])\r\n ix += 1\r\n ans = [name]\r\n for _ in range(k):\r\n bns = yield parse(ix)\r\n ans.append(bns)\r\n yield ans\r\n\r\n\r\nwhile ix < len(A):\r\n bns = parse(ix)\r\n root.append(bns)\r\n# print(root)\r\n\r\n# bfs on this list\r\nlevels = []\r\nqueue = [[r, 0] for r in root]\r\nfor node, d in queue:\r\n if d >= len(levels):\r\n levels.append([])\r\n levels[d].append(node[0])\r\n for i in range(1, len(node)):\r\n queue.append([node[i], d + 1])\r\n\r\nprint(len(levels))\r\nfor row in levels:\r\n print(*row)\r\n", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\ns = list(input().rstrip().decode().split(\",\"))\r\ninf = pow(10, 9) + 1\r\nst = [inf]\r\nu = []\r\nfor i in range(len(s) // 2):\r\n v, c = s[2 * i], int(s[2 * i + 1])\r\n while True:\r\n st[-1] -= 1\r\n if st[-1] >= 0:\r\n break\r\n st.pop()\r\n if len(u) < len(st):\r\n u.append([])\r\n u[len(st) - 1].append(v)\r\n st.append(c)\r\nans = []\r\nfor v in u:\r\n if not v:\r\n break\r\n ans.append(\" \".join(v))\r\nn = len(ans)\r\nprint(n)\r\nsys.stdout.write(\"\\n\".join(ans))", "levels = []\nleft = [-1]\n\ninp = input().split(\",\")\ni = 0\nwhile i < len(inp):\n\tif len(levels) <= len(left) - 1:\n\t\tlevels.append([])\n\tt = inp[i]\n\tn = int(inp[i + 1])\n\tlevels[len(left) - 1].append(t)\n\tif n > 0:\n\t\tleft.append(n)\n\twhile left[-1] == 0:\n\t\tdel left[-1]\n\t\n\tleft[-1] -= 1\n\ti += 2\n\nprint(len(levels))\nfor i in levels:\n\tprint(\" \".join(i))", "if __name__ == '__main__':\r\n\tcomments = input().split(',')\r\n\tn = len(comments) // 2\r\n\tstack = [0]\r\n\tlvl = 1\r\n\tres = []\r\n\tfor i in range(n):\r\n\t\tcomm, child = comments[2*i], int(comments[2*i+1])\r\n\t\twhile lvl > 1 and stack[lvl-1] == 0:\r\n\t\t\tlvl -= 1\r\n\t\tstack[lvl-1] -= 1\r\n\t\tif len(res) == lvl-1:\r\n\t\t\tres.append([comm])\r\n\t\telse:\r\n\t\t\tres[lvl-1].append(comm)\r\n\t\tif child > 0:\r\n\t\t\tif lvl == len(stack):\r\n\t\t\t\tstack.append(child)\r\n\t\t\telse:\r\n\t\t\t\tstack[lvl] = child\r\n\t\t\tlvl += 1\r\n\tprint(len(res))\r\n\tfor l in res:\r\n\t\tprint(' '.join(l))", "l = input().split(',')\r\n\r\nnode = []\r\n\r\nfor i in range(0, len(l), 2):\r\n node.append([l[i], int(l[i+1])])\r\n\r\nans = []\r\nit = 0\r\nh = 0\r\n\r\nst = []\r\nwhile it < len(node):\r\n if len(st) == 0:\r\n h = 0\r\n st.append(it)\r\n\r\n if len(ans)-1 < h:\r\n ans.append([])\r\n\r\n ans[h].append(node[st[-1]][0])\r\n\r\n while len(st) > 0 and node[st[-1]][1] == 0:\r\n h -= 1\r\n st.pop()\r\n\r\n it += 1\r\n if len(st) == 0:\r\n continue\r\n\r\n node[st[-1]][1] -= 1\r\n h += 1\r\n st.append(it)\r\n\r\nprint(len(ans))\r\nfor i in range(0, len(ans)):\r\n print(\" \".join(ans[i]))", "info = input().split(',')\ninfo = [(word, int(num)) for word, num in zip(info[::2], info[1::2])]\nout = []\nstack = []\nfor index, item in enumerate(info):\n level = len(stack)\n while level > 0 and stack[-1] == 0:\n stack.pop()\n level -= 1\n\n if len(out) <= level:\n out.append([item[0]])\n else:\n out[level].append(item[0])\n\n if item[1] > 0:\n stack.append(item[1])\n\n if level > 0:\n stack[level - 1] -= 1\n\nprint(len(out))\nprint('\\n'.join(' '.join(line) for line in out))\n", "def process(A):\r\n n = len(A)\r\n curr = [[None, None, float('inf')]]\r\n d = {}\r\n for i in range(0, n, 2):\r\n x1, c1 = A[i], A[i+1]\r\n c1 = int(c1)\r\n l = len(curr)\r\n if l not in d:\r\n d[l] = []\r\n d[l].append(x1)\r\n curr[-1][2]-=1\r\n curr.append([i, curr[-1][0], c1])\r\n while curr[-1][2]==0:\r\n curr.pop()\r\n m = max(d)\r\n answer = []\r\n for i in range(1, m+1):\r\n answer.append(d[i])\r\n return answer\r\n\r\nA = input().split(',')\r\nanswer = process(A)\r\nprint(len(answer))\r\nfor x in answer:\r\n print(' '.join(x))", "from sys import stdin\r\n\r\ninput = lambda: stdin.buffer.readline().decode().strip()\r\ns, stk, levels, ans = input().split(','), [], [[] for _ in range(4 * 10 ** 5)], 0\r\nfor i in range(0, len(s), 2):\r\n while stk and stk[-1][1] == 0:\r\n stk.pop()\r\n\r\n if not stk:\r\n stk.append([s[i], int(s[i + 1]), 0])\r\n else:\r\n stk[-1][1] -= 1\r\n stk.append([s[i], int(s[i + 1]), stk[-1][-1] + 1])\r\n\r\n levels[stk[-1][-1]].append(stk[-1][0])\r\n ans = max(ans, stk[-1][-1] + 1)\r\n\r\nprint(ans)\r\n[print(*levels[i]) for i in range(ans)]\r\n", "from collections import defaultdict\n\ntext = input()\ntokens = text.split(',')\n\nlevel = defaultdict(list)\nlevel_count = defaultdict(lambda: 0)\nmax_level = 1\ncurrent_level = 1\ni = 0\nwhile i + 1 < len(tokens):\n word = tokens[i]\n comments = int(tokens[i+1])\n level[current_level].append(word)\n if current_level > 1:\n level_count[current_level] -= 1\n if comments > 0:\n current_level += 1\n max_level = max(max_level, current_level)\n level_count[current_level] += comments\n else:\n while level_count[current_level] == 0 and current_level > 1:\n current_level -= 1\n i += 2\n\nprint(max_level)\nfor i in range (1, max_level+1):\n print(' '.join(level[i]))", "t = input().split(',')\r\nm = len(t)\r\np, d, k = [m] * m, [[] for i in range(m)], 0\r\nfor i in range(0, m, 2):\r\n s, n = t[i], int(t[i + 1])\r\n while p[k] == 0: k -= 1\r\n p[k] -= 1\r\n d[k].append(s)\r\n k += 1\r\n p[k] = n\r\nwhile d[k]: k += 1\r\nprint(k)\r\nfor q in d[:k]: print(*q)", "tokens = input().split(',')\n\ndepths = []\nstk = [len(tokens)]\n\nfor i in range(len(tokens)//2):\n tok = tokens[2*i]\n children = int(tokens[2*i+1])\n\n y = stk.pop()\n y -= 1\n stk.append(y)\n\n while len(depths) <= len(stk):\n depths.append([])\n depths[len(stk)].append(tok)\n stk.append(children)\n\n while stk and stk[-1] == 0:\n stk.pop()\n\nprint(len(depths)-1)\nfor xs in depths[1:]:\n print(' '.join(xs))\n\n", "t = input().split(',')\r\nk, m = 0, len(t)\r\np, d = [m] * m, [[] for i in range(m)]\r\nfor s, n in zip(t[::2], t[1::2]):\r\n while not p[k]: k -= 1\r\n p[k] -= 1\r\n d[k].append(s)\r\n k += 1\r\n p[k] = int(n)\r\nwhile d[k]: k += 1\r\nprint(k)\r\nfor q in d[:k]: print(*q)", "# cook your dish here\r\nls = input().split(',')\r\nele = []\r\ndepths = []\r\nfor i in range(len(ls)):\r\n if i%2:\r\n depths.append(int(ls[i]))\r\n else:\r\n ele.append(ls[i])\r\n \r\nst = []\r\nlevels = [0]*len(depths)\r\nfor i in range(len(ele)):\r\n if len(st) == 0:\r\n st.append(i)\r\n levels[i] = 0\r\n else:\r\n while len(st) and depths[st[-1]]==0:\r\n st.pop()\r\n if len(st) == 0:\r\n st.append(i)\r\n levels[i] = 0\r\n else:\r\n levels[i] = levels[st[-1]]+1\r\n depths[st[-1]]-=1\r\n st.append(i)\r\nprint(max(levels)+1)\r\nmp = {}\r\nfor i in range(len(ele)):\r\n if levels[i] in mp:\r\n mp[levels[i]].append(ele[i])\r\n else:\r\n mp[levels[i]] = [ele[i]]\r\nfor lev in mp:\r\n for i in mp[lev]:\r\n print(i, end = ' ')\r\n print()", "a = input().split(',')\r\no = 0\r\nfor i in range(1, len(a), 2):\r\n a[i] = int(a[i])\r\nb = [[] for i in range(300000)]\r\nc = []\r\nfor i in range(0, len(a), 2):\r\n b[len(c)] += [a[i]]\r\n if a[i + 1] == 0:\r\n if len(c) != 0:\r\n c[len(c) - 1] -= 1\r\n else:\r\n if len(c) != 0:\r\n c[len(c) - 1] -= 1\r\n c += [a[i + 1]]\r\n while len(c) > 0 and c[len(c) - 1] == 0:\r\n c.pop()\r\n o = max(o, len(c))\r\n #print(*c)\r\nprint(o + 1)\r\nfor i in range(300000):\r\n if b[i] == []:\r\n break\r\n else:\r\n print(*b[i])\r\n", "def main(s):\n\n s=s.split(\",\")\n depthMap=dict()\n\n replies=[]\n\n depth=1\n\n i=0\n\n while i+1<len(s):\n\n comment,count = s[i],int(s[i+1])\n\n depth=len(replies)\n\n if depth not in depthMap:\n depthMap[depth]=[comment]\n else:\n depthMap[depth].append(comment)\n\n\n\n\n if len(replies)!=0:\n if count == 0:\n replies[-1]-=1\n\n\n\n replies=clean(replies)\n\n if count != 0:\n replies.append(count)\n\n i+=2\n return depthMap\n\ndef clean(replies):\n\n while len(replies)>0 and replies[-1]==0:\n if replies[-1]==0:\n replies.pop()\n if len(replies)>0:\n replies[-1]-=1\n\n return replies\n\n\n\ns=input()\n\ndepthDict = main(s)\n\nn = len(depthDict)\n\nprint(n)\n\nfor depth in depthDict.keys():\n print(\" \".join(depthDict[depth]))\n\n\n", "comments = input().split(',')\nn = len(comments)\np = [n] * n # place holder for count at each layer\nans = [[] for i in range(n)]\nlayer = 0\n\nfor i in range(0,n, 2):\n com = comments[i]\n sub_count = int(comments[i+1])\n while p[layer] == 0: # move back to the previous layer\n layer -= 1\n p[layer] -= 1 # remove the count\n ans[layer].append(com)\n layer += 1 # move to the next layer\n p[layer] = sub_count\nwhile ans[layer]:\n layer += 1\nprint(layer)\nfor sub_ans in ans[:layer]:\n print(*sub_ans)\n\t\t \t \t \t \t \t \t \t \t\t", "from sys import stdin\r\n\r\ninput = lambda: stdin.buffer.readline().decode().strip()\r\ns, stk, levels, ans = input().split(','), [], [[] for _ in range(4 * 10 ** 5)], 0\r\nfor i in range(0, len(s), 2):\r\n s[i + 1] = int(s[i + 1])\r\n while stk and s[stk[-1] + 1] == 0:\r\n stk.pop()\r\n\r\n if stk:\r\n s[stk[-1] + 1] -= 1\r\n\r\n stk.append(i)\r\n levels[len(stk)].append(s[stk[-1]])\r\n ans = max(ans, len(stk))\r\n\r\nprint(ans)\r\n[print(*levels[i]) for i in range(1, ans + 1)]\r\n", "import sys\nfrom typing import List\n\nslist = input().split(',') # type: List[str]\nstack = [1<<30] # type: List[int]\nres = [[]]\n\nfor s in slist:\n if s.isnumeric():\n stack.append(int(s))\n if len(stack) > len(res):\n res.append([])\n else:\n while stack[-1] == 0:\n stack.pop()\n stack[-1] -= 1\n res[len(stack)-1].append(s)\n\nwhile res[-1] == []:\n res.pop()\n\nprint(len(res))\nfor l in res:\n if l:\n print(*l)\n" ]

[ "print(\"/\"+\"/\".join(filter(None, input().split(\"/\"))))", "#***************20A - BerOS file system***************#\r\n#author - @Divyesh Chhabra\r\n\r\nfrom math import *\r\nimport os\r\nimport random\r\nimport re\r\nimport sys\r\nfrom itertools import *\r\n\r\npath = input()\r\nnew = re.split(\"/\",path)\r\nnew_path = \"\"\r\nfor i in new:\r\n if i == \"\":\r\n continue\r\n new_path += (i+\"/\")\r\nnew_path = new_path[:-1]\r\nprint(\"/\"+new_path)", "flag = False\nfor i in filter(None, input().split('/')):\n flag = True\n print('/' + i, end = '')\nif not flag:\n print('/')\nelse:\n print()", "st = input()\r\npt=False\r\nfor i in range(len(st)):\r\n try:\r\n if st[i]=='/' and st[i+1]!='/' or st[i]!='/' :print(st[i],end=\"\");pt=True\r\n except:pass\r\nif not pt:print('/') ", "k=input()\nn = k.split(\"/\")\ns=\"\"\n\nfor i in n:\n i = i.replace(\"/\",\"\")\n if i!=\"\":\n s=s+\"/\"\n s=s+(i)\nif s==\"\":\n print(\"/\")\nelse:\n print(s)\n \t\t\t \t\t\t \t\t \t\t\t \t \t \t\t\t \t\t", "s = input()\no = []\nfor c in s:\n if c == '/' and o and o[-1] == '/':\n continue\n o.append(c)\n\nres = ''.join(o)\n\nif len(res) > 1 and res[-1] == '/':\n print(res[:-1])\nelse:\n print(res)\n", "seq=input()\nb=\"/\"+\"/\".join(s for s in seq.split(\"/\")if s)\nprint(b)\n", "str=input()\r\nprint(\"/\"+\"/\".join(s for s in str.split(\"/\") if s))\r\n\r\n", "#!/usr/bin/env python3\n\ndef normalize(string):\n s = string.split('/')\n result = [p for p in s if p != '']\n return '/' + '/'.join(result)\n\ndef main():\n path = input()\n print(normalize(path))\n\n\nif __name__ == '__main__':\n main()\n", "s = input()\nwhile \"//\" in s:\n s = s.replace(\"//\", \"/\")\nwhile len(s) > 1 and s[-1] == \"/\":\n s = s[:-1]\nprint(s)", "s = input().split('/')\r\nl = []\r\nfor i in s:\r\n if i != \"\":\r\n l.append(i)\r\nprint(\"/\" + \"/\".join(l))\r\n", "n=input()\r\np=n.split('/')\r\nno=p.count('')\r\nfor i in range(no):\r\n p.remove('')\r\nn='/'.join(p)\r\nprint(\"/\"+n)", "sl=r'/'\r\n\r\ndef ds(s):\r\n\t\"\"\"delete slashs\"\"\"\r\n\tiss=0\r\n\tfor c in s:\r\n\t\tif iss:\r\n\t\t\tif c==sl:\r\n\t\t\t\tcontinue\r\n\t\t\telse:\r\n\t\t\t\tyield c\r\n\t\t\t\tiss=0\r\n\t\telse:\r\n\t\t\tif c==sl:\r\n\t\t\t\tyield c\r\n\t\t\t\tiss=1\r\n\t\t\telse:\r\n\t\t\t\tyield c\r\n\r\ns=''.join(ds(input()))\r\nif len(s)>1 and s[-1]==sl:\r\n\ts=s[:-1]\r\nprint(s)", "path = input() #input path\r\npath = list(path.split('/')) #identify the separator and make a list from string\r\nnewpath = []\r\n\r\n#create new list\r\nfor i in path:\r\n if i != '':\r\n newpath.append(i)\r\n\r\n#join elements of newpath and fill empty spaces with slash\r\nslash = '/'\r\nslash = slash.join(newpath)\r\nprint('/'+slash)\r\n\r\n", "def main():\r\n path = input()\r\n path_list = path.split('/')\r\n path_list = [p for p in path_list if p != '']\r\n normalized_path = '/' + '/'.join(path_list)\r\n print(normalized_path)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "s = input()\r\nprint(\"/\".join([\"\"]+[x for x in s.split(\"/\") if x]) if \"/\".join([\"\"]+[x for x in s.split(\"/\") if x]) else \"/\")", "import re\r\n\r\npath = re.sub(r'/+','/', input()).rstrip('/')\r\nif path == '':\r\n print('/')\r\nelse:\r\n print(path)", "ss = input()\r\n\r\nlast = None\r\nans = \"\"\r\n\r\nfor s in ss:\r\n if s != \"/\":\r\n if last == \"/\":\r\n ans += \"/\"\r\n ans += s\r\n last = s\r\n\r\nif set(ss) == set(\"/\"):\r\n print(\"/\")\r\nelse:\r\n print(ans)", "# line = input()\r\n# slash_count = 0\r\n# for i in range(len(line)):\r\n# if line[i] == '/' and line[i + 1] == '/':\r\n# line.remove('/')\r\n#\r\n# last = len(line) - 1\r\n# if len(line) != 1 and line[last] == '/':\r\n# del line[last]\r\n#\r\n# print(line)\r\n\r\nline = input()\r\n_len, met = len(line), False\r\nfor i in range(_len - 1):\r\n if line[i] == '/' and line[i + 1] != '/':\r\n print('/', end='')\r\n elif line[i] != '/':\r\n print(line[i], end='')\r\n met = True\r\nif line[-1] != '/' or not met:\r\n print(line[-1])\r\n\r\n'''\r\nline = \"///one//two///three/\"\r\n\r\n'''\r\n", "line = input()\nwords = filter(lambda x: len(x) > 0, line.split('/'))\nline = '/'.join(words)\nprint('/' + line)\n\t \t\t\t\t\t \t \t\t\t \t\t\t \t \t\t\t", "from functools import reduce\nfrom operator import *\nfrom math import *\nfrom sys import *\nfrom string import *\nsetrecursionlimit(10**7)\ndX= [-1, 1, 0, 0,-1, 1,-1, 1]\ndY= [ 0, 0,-1, 1, 1,-1,-1, 1]\nRI=lambda: list(map(int,input().split()))\nRS=lambda: input().rstrip().split()\n#################################################\ns=RS()[0].split('/')\nprint('/'+'/'.join((c for c in s if c!='')))\n", "t=list(input().split('/'))\r\nprint('/'+'/'.join(i for i in t[:] if i!=\"\"))", "def removeAt(s, ind):\r\n return s[:ind] + s[ind + 1:]\r\n\r\n\r\n# s=abcd[z]efg\r\n\r\n\r\ns = input()\r\ni = 0\r\nwhile (i < len(s) - 1):\r\n if s[i] == '/' and s[i + 1] == '/':\r\n s = removeAt(s, i)\r\n i -= 1\r\n i += 1\r\nn = len(s)\r\nif n != 1 and s[n - 1] == '/':\r\n s = removeAt(s, n - 1)\r\nprint(s)\r\n\r\n'''\r\ns = input()\r\nmet = False\r\nfor i in range(len(s) - 1):\r\n if s[i] == '/' and s[i + 1] != '/':\r\n print('/')\r\n elif s[i] != '/':\r\n met = True\r\n if not met or s[len(s)-1 != '/'] :\r\n print(s[len(s)-1])\r\n'''\r\n", "def eraseAt(line, ind):\r\n return line[:ind] + line[ind + 1:]\r\n\r\n\r\nline, i = input(), 0\r\n\r\nwhile i < len(line) - 1:\r\n if line[i] == '/' and line[i + 1] == '/':\r\n line = eraseAt(line, i + 1)\r\n i -= 1\r\n i += 1\r\n\r\n_len = len(line)\r\nif _len > 1 and line[_len - 1] == '/':\r\n line = eraseAt(line, _len - 1)\r\n\r\nprint(line)\r\n", "s=input()\r\nwhile s.find('//')!=-1:\r\n s=s.replace('//','/')\r\nif len(s)>1 and s[-1]=='/':\r\n s=s[:-1]\r\nprint(s)", "#!/usr/bin/env python\n# coding=utf-8\n'''\nAuthor: Deean\nDate: 2021-11-05 23:15:35\nLastEditTime: 2021-11-05 23:19:21\nDescription: BerOS file system\nFilePath: CF20A.py\n'''\n\n\ndef func():\n path = input().strip()\n while \"//\" in path:\n path = path.replace(\"//\", \"/\")\n\n if path.endswith(\"/\") and len(path) != 1:\n path = path[:-1]\n print(path)\n\n\nif __name__ == '__main__':\n func()\n", "s = input().split('/')\r\ns = list(filter(lambda x: len(x) > 0, s))\r\nprint('/' + '/'.join(s))", "b = input()\r\na = b.split('/')\r\ns = ''\r\nfor i in a:\r\n if len(i) > 0:\r\n s += i + '/'\r\nif len(s) == 0:\r\n print('/')\r\nelse:\r\n if b[0] == '/':\r\n print('/'+s[0:-1])\r\n else:\r\n print(s[0:-1])\r\n", "a = input().split('/')\r\nprint('/' + ('/'.join(filter(None, a))))\r\n", "linha = input().split('/')\nans = []\n\nfor i in range(len(linha)):\n if len(linha[i]) > 0:\n ans.append(linha[i])\n \nprint('/'+'/'.join(ans))", "f = input()\nwhile '//' in f:\n f = f.replace('//', '/')\nwhile f != '/' and f[-1] == '/':\n f = f[:-1]\nprint(f)", "def erase_from(s, startInd, ct):\r\n return s[0:startInd] + s[startInd + ct:]\r\n\r\n\r\ns, i = input(), 0\r\nwhile i < len(s) - 1:\r\n if s[i] == '/' and s[i + 1] == '/':\r\n s = erase_from(s, i, 1)\r\n i -= 1\r\n i += 1\r\n\r\nslen = len(s)\r\nif slen > 1 and s[slen - 1] == '/':\r\n s = erase_from(s,slen - 1,1)\r\n\r\n\r\nprint(s)\r\n'''\r\n\r\n//usr///local//nginx/sbin\r\n\r\n 012345678910\r\nmyVar = 'abcdeZZZfgh'\r\n ^^^\r\n\r\n(startIndex, _count)\r\n 5 3\r\n'abcdefgh'\r\n'''\r\n", "s = input()\r\nwhile s.find('//') >= 0:\r\n s=s.replace('//', '/')\r\nif s[-1] == '/' and len(s) > 1 : s = s[:-1]\r\nprint(s)", "line = input()\r\nwhile line.count('//') != 0:\r\n line = line.replace('//', '/')\r\nif line[-1] == '/' and len(line) != 1: print(line[:-1])\r\nelse: print(line)\r\n", "line = input()\r\n_len = len(line)\r\nmet = False\r\nfor i in range(_len - 1):\r\n if line[i] == '/' and line[i + 1] != '/':\r\n print('/', end='')\r\n elif line[i] != '/':\r\n print(line[i], end='')\r\n met = True\r\n\r\nif not met or line[_len - 1] != '/':\r\n print(line[_len - 1])", "line = input()\r\n\r\ni, _len, met = 0, len(line), False\r\n\r\nwhile i < _len - 1:\r\n if line[i] == '/' and line[i + 1] != '/':\r\n print('/', end='')\r\n elif line[i] != '/':\r\n print(line[i], end='')\r\n met = True\r\n i += 1\r\n\r\nif not met or line[_len - 1] != '/':\r\n print(line[_len - 1])\r\n\r\n'''\r\n///one////two\r\n'''", "a = input()\ns = a.replace('/', ' ')\ns = s.split(' ')\nans = []\nfor i in s:\n if i != '':\n ans += [i]\nif a[0] == '/':\n print('/'+'/'.join(ans))\nelse:\n print('/'.join(ans))", "x = input()\r\na = ''\r\ntoggle = 0\r\n\r\nif len(x) == x.count('/'):\r\n print('/')\r\nelse:\r\n for i in range(len(x)-1, -1, -1):\r\n if x[i] == '/' and a == '':\r\n continue\r\n\r\n if x[i] == '/':\r\n if toggle == 1:\r\n continue\r\n else:\r\n a += x[i]\r\n toggle = 1\r\n else:\r\n a += x[i]\r\n toggle = 0\r\n\r\n print(a[::-1])\r\n", "x = input()\r\nx = x.replace(\"//\",'/')\r\nc = x.count('/')\r\nc2 = 0\r\nwhile (c2!=c):\r\n\tc2 = c\r\n\tx = x.replace(\"//\",'/')\r\n\tc = x.count('/')\r\nif (x.endswith('/') and len(x) != 1):\r\n\tprint(x[0:(len(x)-1)])\r\nelse:\r\n\tprint(x)", "s=input()\r\nwhile s.find('//')>=0:\r\n s=s.replace('//','/')\r\nif s[-1]=='/' and len(s)>1: s=s[:-1]\r\nprint(s)\r\n", "print('/' + '/'.join(i for i in input().split('/') if i))", "d = [x for x in input().split('/') if x]\r\nprint('/' + '/'.join(d))", "x=input()\r\nwhile '//' in x:\r\n\tx=x.replace('//','/')\r\nif len(x)==1 or x[-1]!='/': print(x)\r\nelse: print(x[:-1])", "s=[_ for _ in input().split('/') if _]\r\n\r\nans=[]\r\n\r\nfor _ in s:\r\n\tans.append('/')\r\n\tans.append(_)\r\n\r\nfor _ in ans:\r\n\tprint(_,end='')\r\nif not ans:\r\n\tprint('/')", "#first we get rid of the '/' from teh get-go\r\npath = input().split('/')\r\nnormalized = list() #empty list for the normalized path\r\nfor element in path:\r\n if element != '': #for every element of the list that has something\r\n normalized.append(element) #we append it to the noramlized path list\r\n#concatenate everything by '/' plus add one from the start\r\nprint('/' + '/'.join(normalized))\r\n", "a=input(\"\")\r\n\r\n\r\n#code 1\r\nb=\"/\"\r\n\r\nfor i in a:\r\n if i==\"/\":\r\n if b[-1]!=\"/\":\r\n b+=i\r\n else:\r\n b+=i\r\n\r\nif b[-1]=='/' and len(b)!=1:\r\n b = b[:-1]\r\n\r\nprint(b)", "# #✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧\r\n# ◕ █ █ █ █ /████\\ ██\\ █ /██\\ ██ ██\\ █ ◕\r\n# ◕ █ █ █ █ █\\ \\█ █\\█\\ █ /█/\\█\\ █\\█\\ █ ◕\r\n# ◕ █\\ /█ █ █ █ █ \\█\\ █ /█/ \\█\\ ██ █ \\█\\ █ ◕\r\n# ◕ █████ █ █ \\████\\ █ \\█\\ █ █/ \\█ ██ █ \\█\\ █ ◕\r\n# ◕ █/ \\█ █ █ \\█ █ \\█\\ █ ████████ ██ █ \\█\\ █ ◕\r\n# ◕ █ █ █\\ /█ █\\ /█ █ \\█\\█ █ █ ██ █ \\█\\█ ◕\r\n# ◕ █ █ \\██████/ \\████/ █ \\██ █ █ ██ █ \\██ ◕\r\n#✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧\r\ns = input()\r\nwhile \"//\" in s:\r\n s = s.replace(\"//\",\"/\")\r\nprint(s if s == '/' else s.rstrip(\"/\"))", "import re\r\ns = [x for x in re.split('[/]',input()) if x]\r\n[print('/',end = key) for key in s] if len(s) else print('/')", "print('/' + '/'.join(filter(lambda x : len(x) > 0, input().split('/'))))\n", "a=input().split('/')\r\nprint('/' + '/'.join(i for i in a if i))", "dir = input()\nnames = [x for x in dir.split('/') if x]\nprint('/' + '/'.join(names))# 1690442096.2000306", "s = input()\r\nf = 0\r\na = \"\"\r\n\r\nfor i in s:\r\n if i=='/':\r\n f = 1\r\n else:\r\n if f==0:\r\n a = a + i\r\n else:\r\n a = a + '/'\r\n a = a + i\r\n f = 0\r\nif len(set(s))==1:\r\n print('/')\r\nelse:\r\n print(a)", "a=input().split(\"/\")\r\nb=1\r\nfor i in a:\r\n\r\n if i=='':\r\n continue\r\n else:\r\n print(\"/\",end=f\"{i}\")\r\n b=0\r\nif b==1:\r\n print(\"/\")", "n = input()\r\na = n.split('/')\r\nz = ''\r\nfor i in a:\r\n if i != '':\r\n z += '/'\r\n z += i\r\nif len(z) == 0:\r\n z += '/'\r\n print(z)\r\nelse:\r\n print(z)\r\n", "directory = input()\nprint(\"/\"+\"/\".join(s for s in directory.split(\"/\") if s))\n", "n=input()\r\nc=\"\"\r\nq=0\r\nfor i in n:\r\n if i==\"/\":\r\n if q==0:\r\n c+=i\r\n q=1 \r\n else:\r\n q=0\r\n c+=i\r\nfor i in range(len(c)-1,-1,-1):\r\n if c[i]!=\"/\":\r\n c=c[0:i+1]\r\n break\r\nprint(c)", "\r\ns = input()\r\ns_len, met = len(s), False\r\nfor i in range(s_len - 1):\r\n if s[i] == '/' and s[i + 1] != '/':\r\n print('/', end='')\r\n elif s[i] != '/':\r\n print(s[i], end='')\r\n met = True\r\n\r\nif s[s_len - 1] != '/' or not met:\r\n print(s[s_len - 1])\r\n", "\r\nruta = input()\r\nwhile ruta.find('//') != -1:\r\n ruta = ruta.replace('//','/')\r\nif ruta.endswith('/') and len(ruta) > 1:\r\n ruta = ruta[:len(ruta)-1]\r\nprint(ruta)\r\n", "a = list(input().split(\"/\"))\r\nb = []\r\nfor x in a:\r\n\tif x != \"\":\r\n\t\tb.append(x)\r\n\t\t\r\n#print(b)\r\nif len(b):\r\n\tfor x in b:\r\n\t\tprint(\"/\", x, end=\"\", sep=\"\")\r\nelse:\r\n\tprint(\"/\", end=\"\")", "#!/usr/bin/env python3\n\nprint('/' + '/'.join(filter(lambda x: x, input().split('/'))))\n", "x = input()\r\ny=\"\"\r\nz=\"\"\r\nw = \"/\"\r\nfor i in x:\r\n if z== i and i.isalpha()== False:\r\n continue\r\n y=y+i\r\n z=i\r\nif \"/\"*len(x)==x:\r\n print(\"/\")\r\nelif y[-1]==\"/\":\r\n\tprint(y[:-1])\r\nelse:\r\n\tprint(y)", "# import sys\r\n# input = sys.stdin.readline\r\n# for _ in range(int(input())):\r\na = input()\r\nwhile '//' in a:\r\n a = a.replace(\"//\",'/')\r\nif a[-1] == '/' and len(a) != 1:\r\n a = a.rstrip('/')\r\nprint(a)", "s=input()\r\nans=\"\"\r\ni=0 \r\nwhile(i<len(s)):\r\n if (s[i]=='/' and (len(ans)==0 or ans[-1]!='/')):\r\n ans+='/'\r\n elif (s[i]!='/'):\r\n ans+=s[i]\r\n i+=1\r\nif (ans!='/' and ans[-1]=='/'):\r\n ans=ans[0:len(ans)-1]\r\nprint(ans) ", "a = input().split('/')\r\nfor i in range(len(a)):\r\n if a[i] == '/':\r\n del a[i]\r\nprint('/', end=\"\")\r\nprint(\"/\".join([str(i) for i in a if i != '']))", "\r\ns=input()\r\nl=s.split(\"/\")\r\nl=[i for i in l if i!=\"\"]\r\nprint(\"/\"+\"/\".join(l))", "s = input()\nprint(\"/\",\"/\".join(filter(lambda x: x!='' ,s.split('/'))),sep=\"\")", "print(\"/\"+\"/\".join((filter(lambda x: x!=\"\",list(map(str, input().split(\"/\")))))))", "s = input().split('/')\ndeleted = 0\nfor i in range(1, len(s)):\n\ti -= deleted\n\tif s[i] == '':\n\t\ts.pop(i)\n\t\tdeleted += 1\nif len(s) == 1:\n\ts.append('')\nprint('/'.join(s))\n", "import re\ns=input()\nl=re.findall(r'(\\w+)',s)\ns=''\nln=len(l)\nif ln==0:\n\tprint('/')\nelse:\n\tfor i in range(ln):\n\t\ts+='/'+l[i]\n\tprint(s)", "a=input()\r\nslash=0\r\nans=''\r\nfor i in range(len(a)):\r\n if a[i]=='/':\r\n slash+=1\r\n else:\r\n if slash>0:\r\n ans+='/'\r\n slash=0\r\n ans+=a[i]\r\n else:\r\n ans+=a[i]\r\nif len(ans)==0:\r\n ans='/'\r\nprint(ans)\r\n", "st = input()\r\nst = list(st.split('/'))\r\nst = filter(None, st)\r\nst = [\"/\" + item for item in st]\r\nif len(st) != 0:\r\n print(*st, sep='')\r\nelse:\r\n print('/')", "a = input()\n\ndef main(a):\n answer = ''\n flag = 0\n for character in a:\n if flag == 0:\n answer += character\n if character == '/':\n flag = 1\n else:\n if not character == '/':\n answer += character\n flag = 0\n if not answer == '/':\n answer = list(answer)\n len_answer = len(answer)\n for i in range(len_answer):\n if answer[len_answer - 1 - i] == '/':\n del answer[len_answer - 1 - i]\n else:\n return ''.join(answer)\n\n return answer\n\nprint(main(a))\n", "strInput = input()\r\ni = 1\r\nwhile (i != len(strInput)):\r\n if (strInput[i] == '/' and strInput[i - 1] == '/'):\r\n strInput = strInput[:i] + strInput[i + 1:]\r\n i-=1\r\n i+=1\r\nif(strInput[len(strInput)-1]=='/' and len(strInput)>1):\r\n strInput = strInput[0:-1]\r\nprint(strInput)\r\n", "s, i = input(), 0\r\n# s=s.replace('//', '/')\r\n\r\nwhile i < len(s) - 1:\r\n if s[i] == '/' and s[i + 1] == '/':\r\n s = s.replace('//', '/')\r\n i -= 1\r\n i += 1\r\n\r\nif len(s) > 1 and s[len(s) - 1] == '/':\r\n s = s[0:len(s) - 1]\r\n \r\nprint(s)", "#FuckCCF\n\nins = input()\nins = ins.replace(\"//\", \"/\").replace(\"//\", \"/\").replace(\"//\",\"/\").replace(\"//\",\"/\").replace(\"//\",\"/\").replace(\"//\",\"/\").replace(\"//\",\"/\").replace(\"//\",\"/\").replace(\"//\",\"/\").replace(\"//\",\"/\").replace(\"//\",\"/\").replace(\"//\",\"/\")\nif(ins[len(ins) - 1] == '/' and len(ins)!=1):\n print(ins.replace(\"//\", \"/\")[:-1])\nelse:\n print(ins.replace(\"//\",\"/\"))\n\t\t \t \t \t \t \t \t\t\t \t\t\t\t \t \t", "p=input()\r\ni=0\r\nr=\"\"\r\nc=0\r\nwhile (i<len(p)):\r\n if(p[i]!=\"/\"):\r\n r=r+p[i]\r\n c=0\r\n elif(p[i]==\"/\" and c==0):\r\n r=r+\"/\"\r\n c=1\r\n i=i+1 \r\nif(r[len(r)-1]==\"/\" and len(r)>1):\r\n r=r[0:(len(r)-1)]\r\nprint(r) \r\n", "line, met = input(), False\r\nlineLen = len(line)\r\nfor i in range(lineLen - 1):\r\n if line[i] == '/' and line[i + 1] != '/':\r\n print('/', end='')\r\n elif line[i] != '/':\r\n print(line[i], end='')\r\n met = True\r\n\r\nif not met or line[lineLen - 1] != '/':\r\n print(line[lineLen - 1], end='')\r\n", "path = input().strip('/')\r\nnormalized_path = '/' + '/'.join(filter(None, path.split('/')))\r\nprint(normalized_path)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "'''\r\ns = input()\r\nfor i in range(len(s)):\r\n if s[i] == '/' and s[i + 1] == '/' and s[len(s) - 1] == '/':\r\n s.replace(s[i], '')\r\n\r\nprint(s)\r\n'''\r\ns, i = input(), 0\r\n\r\nwhile i < len(s) - 1:\r\n if s[i] == '/' and s[i + 1] == '/':\r\n s = s.replace('//', '/')\r\n i -= 1\r\n i += 1\r\n\r\nif len(s) > 1 and s[len(s) - 1] == '/':\r\n s = s[0:len(s) - 1]\r\nprint(s)\r\n# 0123456789\r\n# ///one////two////\r\n", "s = input().split('/')\r\nans = [str('/') + i for i in s if i != '']\r\nprint(''.join(ans) if ans else '/')", "def main():\r\n mystical_path = input()\r\n mystical_output = \"\"\r\n mystical_flag = False\r\n for mystical_char in mystical_path:\r\n if mystical_char != '/' or not mystical_flag:\r\n mystical_output += mystical_char\r\n if mystical_char == '/':\r\n mystical_flag = True\r\n else:\r\n mystical_flag = False\r\n\r\n if mystical_flag and len(mystical_output) > 1:\r\n mystical_output = mystical_output[:-1]\r\n print(mystical_output)\r\n\r\n# Invoke the main function\r\nmain()\r\n", "'''HackerRank: BerOS file system'''\r\n\r\nif __name__ == '__main__':\r\n path = input()\r\n normalized = '/'\r\n for i in range(len(path)):\r\n if path[i] != '/' or (path[i] == '/' and normalized[-1] != '/'):\r\n normalized += path[i]\r\n\r\n if len(normalized) > 1 and normalized[-1] == '/':\r\n print(normalized[:-1])\r\n else:\r\n print(normalized)\r\n", "s, i = input(), 0\r\nsLen, met = len(s), False\r\n\r\nwhile i < sLen - 1:\r\n if s[i] == '/' and s[i + 1] != '/':\r\n print('/', end='')\r\n elif s[i] != '/':\r\n print(s[i], end='')\r\n met = True\r\n i += 1\r\n\r\nif not met or s[sLen - 1] != '/':\r\n print(s[sLen - 1], end='')", "s = str( input() )\r\nl = list( s ) \r\nans = [ l[ 0 ] ]\r\nfor i in range( len( l ) ) :\r\n if l[ i ] == '/' :\r\n if ans[ -1 ] != '/' : \r\n ans.append( l[ i ] )\r\n else :\r\n ans.append( l[ i ] )\r\nif ans[ -1 ] == '/' and len( ans ) > 1 :\r\n ans = ans[ : -1 ]\r\nprint( ''.join( ans ) )\r\n\r\n \r\n", "a=str(input())\r\nl=a.split(\"/\")\r\nl=[i for i in l if i!=\"\"]\r\nprint(\"/\"+\"/\".join(l))", "print('/' + '/'.join(filter(bool, input().split('/'))))", "s = input()\r\nl = len(s)\r\np = 100*\"//\"\r\n\r\n\r\nwhile len(p) > 0:\r\n s = s.replace(p,'/')\r\n p = p[1:]\r\n\r\nif s[-1] == '/' and l > 1 and len(s) > 1:\r\n s = s[:len(s)-1]\r\n \r\nprint(s)", "print('/'+'/'.join([x for x in input().split('/') if x]))", "print('/'+'/'.join(x for x in input().split('/') if x))", "print('/', (\"/\".join([i for i in input().split('/') if len(i) > 0])), sep=\"\")\r\n", "path = input()\r\n\r\nif len(set(path)) == 1:\r\n print('/')\r\n\r\nelse:\r\n for x in path.split('/'):\r\n if x == '': continue\r\n print(f'/{x}', end='')", "n = input()\r\nx = n.replace('/', '')\r\nif len(x) == 0:\r\n print('/')\r\nelse:\r\n if n[0] == '/' and n[-1] == '/':\r\n n = n.replace('/', ' ')\r\n n = n.split()\r\n n.insert(0, '')\r\n elif n[0] == '/' and n[-1] != '/':\r\n n = n.replace('/', ' ')\r\n n = n.split()\r\n n.insert(0, '')\r\n elif n[0] != '/' and n[-1] == '/':\r\n n = n.replace('/', ' ')\r\n n = n.split()\r\n else:\r\n n = n.replace('/', ' ')\r\n n = n.split()\r\n print('/'.join(n))", "import re\r\nn = input()\r\nto_remove = \"/\"\r\npattern = \"(?P<char>[\" + re.escape(to_remove) + \"])(?P=char)+\"\r\nn = re.sub(pattern, r\"\\1\", n)\r\nif n[-1] == \"/\" and len(n) > 1:\r\n n = n[:-1]\r\nprint(n)\r\n", "x=input()\r\nstr1=''\r\nif x.count('/')==len(x):\r\n print('/')\r\nelse:\r\n for i in range(len(x)):\r\n if i==0:\r\n str1+=x[i]\r\n elif x[i]=='/' and str1[-1]=='/':\r\n continue\r\n else:\r\n str1+=x[i]\r\n for i in range(100000000000000000):\r\n if str1[-1]=='/':\r\n str1=str1[:-1]\r\n else:\r\n break\r\n print(str1)", "s = [i for i in input().split('/') if len(i) > 0]\r\nprint('/' + '/'.join(s))\r\n", "s = input()\r\n\r\nfor i in range(100):\r\n s = s.replace(\"//\", \"/\")\r\n\r\nif s[-1] == \"/\":\r\n p = len(s)\r\n if p != 1:\r\n print(s[:(p-1)])\r\n else:\r\n print(s)\r\nelse:\r\n print(s)", "s = input()\r\nfor i in range(1, 101):\r\n for _ in range(1, 101):\r\n s = s.replace('/'*i, '/')\r\nif (s[-1] == '/' and len(s)!=1) : print(s[:-1])\r\nelse: print(s)\r\n", "num = input()\r\nprint('/'+'/'.join(num.replace('/',' ').split()))", "n=list(input())\r\nz='/'\r\nfor i in range(len(n)):\r\n if n[i]=='/' and z[-1]!='/': z+=n[i]\r\n if n[i]!='/': z+=n[i]\r\nif len(z)>1 and z[-1]=='/': print(z[0:-1])\r\nelse: print(z)\r\n", "s=input()\r\nn=len(s)\r\nS=''\r\nfor i in range(1,n):\r\n\tif(s[i-1]=='/' and s[i]=='/'):\r\n\t\tcontinue\r\n\telse:\r\n\t\tS+=s[i]\r\nif(s[0]=='/'):\r\n\tS='/'+S\r\nif(S[len(S)-1]=='/' and len(S)!=1):\r\n\tSS=''\r\n\tfor i in range(len(S)-1):\r\n\t\tSS+=S[i]\r\n\tS=SS\r\nprint(S)\r\n", "from sys import stdout\r\nw = stdout.write\r\nn = input()\r\nprev = \"\"\r\nfor i, b in zip(n, range(len(n))):\r\n if n[b:].count(\"/\") == len(n[b:]) and b != 0:\r\n break\r\n if prev != \"/\" or i != prev:\r\n w(i)\r\n prev = i\r\nw(\"\\n\")\r\n", "lst = input() \r\ns=''\r\ns+=lst[0]\r\nfor i in range(1,len(lst)):\r\n if s[-1] != '/' and lst[i] == '/':\r\n s+=lst[i]\r\n elif lst[i] != '/':\r\n s+=lst[i]\r\nif len(s) ==1 :\r\n print(s)\r\nelse:\r\n if s[-1] == '/':\r\n print(s[:-1])\r\n else:\r\n print(s)", "s=list(input().split('/'))\nop=''\nfor i in s:\n if i:\n op+=\"/\"+i\nif not op : op='/'\nprint(op)\n", "s = input()\r\nl = s.split('/')\r\nl = [x for x in l if x != '']\r\nst = ''\r\nif len(l) == 0:\r\n print('/')\r\nelse:\r\n for i in l:\r\n st += '/' + i\r\n print(st)", "def berOS():\r\n s = input()\r\n lst = []\r\n \r\n lst.append(s[0])\r\n for i in range(1, len(s)):\r\n if s[i] == s[i - 1] and s[i] == '/':\r\n continue\r\n \r\n else:\r\n lst.append(s[i])\r\n \r\n if len(lst) > 1 and lst[-1] == '/':\r\n lst.pop(-1)\r\n \r\n print(*lst, sep=(\"\"))\r\n \r\n \r\nberOS()", "print('/' + '/'.join(input().replace('/', ' ').split()))", "l = input().split(\"/\")\r\np = []\r\nfor i in l:\r\n if i != \"\":\r\n p.append(i)\r\n\r\nprint(\"/\"+\"/\".join(p))" ]

[ "import heapq\r\n\r\nn, m = map(int, input().split())\r\ng = [[] for _ in range(n + 1)]\r\nfor i in range(1, m + 1):\r\n u, v, w = map(int, input().split())\r\n g[u].append((i, v, w))\r\n g[v].append((i, u, w))\r\nsrc = int(input())\r\n\r\npq = [(0, 0, src, -1)]\r\nmk = [0] * (n + 1)\r\nt = []\r\ns = 0\r\nwhile pq:\r\n d, w, u, e = heapq.heappop(pq)\r\n if mk[u]:\r\n continue\r\n mk[u] = 1\r\n s += w\r\n t.append(e)\r\n for e, v, w in g[u]:\r\n if not mk[v]:\r\n heapq.heappush(pq, (d + w, w, v, e))\r\n\r\nprint(s)\r\nprint(*t[1:])" ]

[ "def var():\r\n return (map(int,input().split()))\r\ndef a():\r\n return list((map(int,input().split())))\r\n\r\n\r\nimport copy\r\nfrom collections import defaultdict,deque\r\n\r\ndp1=[[[-1]*(102) for _ in range(102)] for _ in range(102)]\r\ndp2=[[[-1]*(102) for _ in range(102)] for _ in range(102)]\r\ndp3=[[[-1]*(102) for _ in range(102)] for _ in range(102)]\r\n\r\nr,s,p= var()\r\n\r\ndef solve1(r,s,p):\r\n if dp1[r][s][p]!=-1:\r\n return dp1[r][s][p]\r\n \r\n if r==0 :\r\n return 0\r\n if s==0 and p==0:\r\n return 1\r\n all=r*s+s*p+p*r\r\n dp1[r][s][p]=0\r\n if s>0:\r\n dp1[r][s][p]+=((r*s)/(all))*solve1(r,s-1,p)\r\n if p>0:\r\n dp1[r][s][p]+=((r*p)/(all))*solve1(r-1,s,p)\r\n if s>0 and p>0:\r\n dp1[r][s][p]+=((p*s)/(all))*solve1(r,s,p-1)\r\n\r\n return dp1[r][s][p]\r\n\r\ndef solve2(r,s,p):\r\n if dp2[r][s][p]!=-1:\r\n return dp2[r][s][p]\r\n \r\n if s==0 :\r\n return 0\r\n if r==0 and p==0:\r\n return 1\r\n all=r*s+s*p+p*r\r\n dp2[r][s][p]=0\r\n if r>0:\r\n dp2[r][s][p]+=((r*s)/(all))*solve2(r,s-1,p)\r\n if p>0 and r>0:\r\n dp2[r][s][p]+=((r*p)/(all))*solve2(r-1,s,p)\r\n if p>0 :\r\n dp2[r][s][p]+=((p*s)/(all))*solve2(r,s,p-1)\r\n\r\n return dp2[r][s][p]\r\n\r\ndef solve3(r,s,p):\r\n if dp3[r][s][p]!=-1:\r\n return dp3[r][s][p]\r\n \r\n if p==0 :\r\n return 0\r\n if s==0 and r==0:\r\n return 1\r\n all=r*s+s*p+p*r\r\n dp3[r][s][p]=0\r\n if s>0 and r>0:\r\n dp3[r][s][p]+=((r*s)/(all))*solve3(r,s-1,p)\r\n if r>0:\r\n dp3[r][s][p]+=((r*p)/(all))*solve3(r-1,s,p)\r\n if s>0:\r\n dp3[r][s][p]+=((p*s)/(all))*solve3(r,s,p-1)\r\n\r\n return dp3[r][s][p]\r\n\r\n# print(str(solve1(r,s,p))+' '+str(round(solve2(r,s,p),10))+' '+str(float(solve3(r,s,p)))) \r\nprint(\"{0:.10f}\".format(solve1(r,s,p)),\"{0:.10f}\".format(solve2(r,s,p)),\"{0:.10f}\".format(solve3(r,s,p)))\r\n# print(\"{0:.10f}\".format(5),'{0:.1f}'.format(7))\r\n", "r, s, p = map(int, input().split())\ndp = [[[0] * 105 for _ in range(105)] for _ in range(105)]\ndp[r][s][p] = 1.0\nfor i in range(r, -1, -1):\n for j in range(s, -1, -1):\n for k in range(p, -1, -1):\n if (i == 0 and j == 0) or (i == 0 and k == 0) or (j == 0 and k == 0): continue # 全都死了\n total = i * j + j * k + k * i\n if i > 0 and j > 0: dp[i][j - 1][k] += dp[i][j][k] * i * j / total # 石头杀剪刀\n if j > 0 and k > 0: dp[i][j][k - 1] += dp[i][j][k] * j * k / total # 剪刀杀纸\n if k > 0 and i > 0: dp[i - 1][j][k] += dp[i][j][k] * k * i / total # 纸杀石头\ns_r = s_s = s_p = 0\nfor i in range(1, r + 1): s_r += dp[i][0][0]\nfor i in range(1, s + 1): s_s += dp[0][i][0]\nfor i in range(1, p + 1): s_p += dp[0][0][i]\nprint(s_r, s_s, s_p)\n\n\t\t \t\t\t \t\t \t \t \t\t \t\t \t \t \t\t", "if True:\r\n from io import BytesIO, IOBase\r\n import math\r\n\r\n import random\r\n import sys\r\n import os\r\n\r\n import bisect\r\n import typing\r\n from collections import Counter, defaultdict, deque\r\n from copy import deepcopy\r\n from functools import cmp_to_key, lru_cache, reduce\r\n from heapq import heapify, heappop, heappush, heappushpop, nlargest, nsmallest\r\n from itertools import accumulate, combinations, permutations, count\r\n from operator import add, iand, ior, itemgetter, mul, xor\r\n from string import ascii_lowercase, ascii_uppercase, ascii_letters\r\n from typing import *\r\n BUFSIZE = 4096\r\n\r\n class FastIO(IOBase):\r\n newlines = 0\r\n\r\n def __init__(self, file):\r\n self._fd = file.fileno()\r\n self.buffer = BytesIO()\r\n self.writable = \"x\" in file.mode or \"r\" not in file.mode\r\n self.write = self.buffer.write if self.writable else None\r\n\r\n def read(self):\r\n while True:\r\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\r\n if not b:\r\n break\r\n ptr = self.buffer.tell()\r\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\r\n self.newlines = 0\r\n return self.buffer.read()\r\n\r\n def readline(self):\r\n while self.newlines == 0:\r\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\r\n self.newlines = b.count(b\"\\n\") + (not b)\r\n ptr = self.buffer.tell()\r\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\r\n self.newlines -= 1\r\n return self.buffer.readline()\r\n\r\n def flush(self):\r\n if self.writable:\r\n os.write(self._fd, self.buffer.getvalue())\r\n self.buffer.truncate(0), self.buffer.seek(0)\r\n\r\n class IOWrapper(IOBase):\r\n def __init__(self, file):\r\n self.buffer = FastIO(file)\r\n self.flush = self.buffer.flush\r\n self.writable = self.buffer.writable\r\n self.write = lambda s: self.buffer.write(s.encode(\"ascii\"))\r\n self.read = lambda: self.buffer.read().decode(\"ascii\")\r\n self.readline = lambda: self.buffer.readline().decode(\"ascii\")\r\n\r\n sys.stdin = IOWrapper(sys.stdin)\r\n sys.stdout = IOWrapper(sys.stdout)\r\n input = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\r\n \r\n def I():\r\n return input()\r\n\r\n def II():\r\n return int(input())\r\n\r\n def MII():\r\n return map(int, input().split())\r\n\r\n def LI():\r\n return list(input().split())\r\n\r\n def LII():\r\n return list(map(int, input().split()))\r\n\r\n def LFI():\r\n return list(map(float, input().split()))\r\n\r\n def GMI():\r\n return map(lambda x: int(x) - 1, input().split())\r\n\r\n def LGMI():\r\n return list(map(lambda x: int(x) - 1, input().split()))\r\n\r\n inf = float('inf')\r\n\r\ndfs, hashing = False, False\r\n\r\nif dfs:\r\n from types import GeneratorType\r\n\r\n def bootstrap(f, stack=[]):\r\n def wrappedfunc(*args, **kwargs):\r\n if stack:\r\n return f(*args, **kwargs)\r\n else:\r\n to = f(*args, **kwargs)\r\n while True:\r\n if type(to) is GeneratorType:\r\n stack.append(to)\r\n to = next(to)\r\n else:\r\n stack.pop()\r\n if not stack:\r\n break\r\n to = stack[-1].send(to)\r\n return to\r\n return wrappedfunc\r\n\r\nif hashing:\r\n RANDOM = random.getrandbits(20)\r\n class Wrapper(int):\r\n def __init__(self, x):\r\n int.__init__(x)\r\n\r\n def __hash__(self):\r\n return super(Wrapper, self).__hash__() ^ RANDOM\r\n\r\nr, s, p = MII()\r\ndef pos(x, y, z):\r\n return x * (s + 1) * (p + 1) + y * (p + 1) + z\r\n\r\ndp = [None] * ((r + 1) * (s + 1) * (p + 1))\r\nfor i in range(r + 1):\r\n for j in range(s + 1):\r\n for k in range(p + 1):\r\n if max(i, j, k) == 0: continue\r\n if not i and not j: dp[pos(i, j, k)] = [0, 0, 1]\r\n elif not i and not k: dp[pos(i, j, k)] = [0, 1, 0]\r\n elif not j and not k: dp[pos(i, j, k)] = [1, 0, 0]\r\n else:\r\n dp[pos(i, j, k)] = [0, 0, 0]\r\n if i:\r\n prob = (i * k) / (i * j + j * k + i * k)\r\n dp[pos(i, j, k)][0] += prob * dp[pos(i-1, j, k)][0]\r\n dp[pos(i, j, k)][1] += prob * dp[pos(i-1, j, k)][1]\r\n dp[pos(i, j, k)][2] += prob * dp[pos(i-1, j, k)][2]\r\n if j:\r\n prob = (i * j) / (i * j + j * k + i * k)\r\n dp[pos(i, j, k)][0] += prob * dp[pos(i, j-1, k)][0]\r\n dp[pos(i, j, k)][1] += prob * dp[pos(i, j-1, k)][1]\r\n dp[pos(i, j, k)][2] += prob * dp[pos(i, j-1, k)][2]\r\n if k:\r\n prob = (j * k) / (i * j + j * k + i * k)\r\n dp[pos(i, j, k)][0] += prob * dp[pos(i, j, k-1)][0]\r\n dp[pos(i, j, k)][1] += prob * dp[pos(i, j, k-1)][1]\r\n dp[pos(i, j, k)][2] += prob * dp[pos(i, j, k-1)][2]\r\n\r\nprint(*dp[-1])", "import sys\r\ninput = sys.stdin.readline\r\n\r\nR, S, P = map(int, input().split())\r\ndp = [[[0]*(P + 1) for _ in range(S + 1)] for _ in range(R + 1)]\r\ndp[R][S][P] = 1\r\nfor r in range(R, -1, -1):\r\n for s in range(S, -1, -1):\r\n for p in range(P, -1, -1):\r\n sm = r * s + s * p + p * r\r\n if r and s:\r\n dp[r][s - 1][p] += (r * s / sm) * dp[r][s][p]\r\n if s and p:\r\n dp[r][s][p - 1] += (s * p / sm) * dp[r][s][p]\r\n if p and r:\r\n dp[r - 1][s][p] += (p * r / sm) * dp[r][s][p]\r\nans1, ans2, ans3 = 0, 0, 0\r\nfor i in range(R + 1):\r\n ans1 += dp[i][0][0]\r\nfor i in range(S + 1):\r\n ans2 += dp[0][i][0]\r\nfor i in range(P + 1):\r\n ans3 += dp[0][0][i]\r\nprint(ans1, ans2, ans3)\r\n", "import sys\r\nimport os\r\nfrom io import BytesIO, IOBase\r\n\r\n# region fastio\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\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 = BytesIO(os.read(0, os.fstat(0).st_size))\r\nelse:\r\n sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)\r\n\r\nf = sys.stdin\r\nif os.environ.get('USER') == \"loic\":\r\n f = open(\"data.in\")\r\n \r\nline = lambda: f.readline().split()\r\nui = lambda: int(line()[0])\r\nti = lambda: map(int,line())\r\nli = lambda: list(ti())\r\n\r\n#######################################################################\r\n\r\ndef solve():\r\n \r\n dp = [[[[0,0,0] for _ in range(P+1)] for _ in range(S+1)] for _ in range(R+1)]\r\n for i in range(R+1):\r\n dp[i][0][0][0] = 1\r\n for j in range(S+1):\r\n dp[0][j][0][1] = 1\r\n for k in range(P+1):\r\n dp[0][0][k][2] = 1\r\n# for i in range(R+1):\r\n# for j in range(S+1):\r\n# dp[i][j][0][0] = 1\r\n# for i in range(R+1):\r\n# for k in range(P+1):\r\n# dp[i][0][k][2] = 1\r\n# for j in range(S+1):\r\n# for k in range(P+1):\r\n# dp[0][j][k][1] = 1\r\n \r\n \r\n for i in range(R+1):\r\n for j in range(S+1):\r\n for k in range(P+1):\r\n rs = i*j\r\n rp = i*k\r\n sp = j*k\r\n s = rs + rp + sp\r\n if s == 0:\r\n continue\r\n \r\n if rs > 0:\r\n for p in range(3):\r\n dp[i][j][k][p] += rs * dp[i][j-1][k][p]\r\n if rp > 0:\r\n for p in range(3):\r\n dp[i][j][k][p] += rp * dp[i-1][j][k][p]\r\n if sp > 0:\r\n for p in range(3):\r\n dp[i][j][k][p] += sp * dp[i][j][k-1][p]\r\n \r\n for p in range(3):\r\n dp[i][j][k][p] = dp[i][j][k][p] / s\r\n \r\n res = \" \".join(str(v) for v in dp[R][S][P])\r\n \r\n return str(res)\r\n\r\nfor test in range(1,1+1):\r\n R,S,P = ti()\r\n \r\n print(solve())\r\n \r\nf.close()", "from collections import defaultdict\n\ndef rsp(r, s, p):\n P = {(r, s, p): 1}\n pr = 0\n ps = 0\n pp = 0\n while P:\n Q = defaultdict(lambda: 0)\n for ((r, s, p), q) in P.items():\n if not r:\n ps += q\n continue\n if not s:\n pp += q\n continue\n if not p:\n pr += q\n continue\n x = q / (r*s + s*p + r*p)\n Q[r-1, s, p] += r*p*x\n Q[r, s-1, p] += r*s*x\n Q[r, s, p-1] += s*p*x\n P = Q\n return pr, ps, pp\n\n\ndef main():\n r, s, p = readinti()\n pr, ps, pp = rsp(r, s, p)\n print(f'{pr} {ps} {pp}')\n\n##########\n\nimport sys\nimport time\nimport traceback\nfrom contextlib import contextmanager\nfrom io import StringIO\n\ndef readint():\n return int(input())\n\n\ndef readinti():\n return map(int, input().split())\n\n\ndef readintl():\n return list(readinti())\n\n\ndef readintll(k):\n return [readintl() for _ in range(k)]\n\n\ndef log(*args, **kwargs):\n print(*args, **kwargs, file=sys.stderr)\n\n\n@contextmanager\ndef patchio(i):\n try:\n sys.stdin = StringIO(i)\n sys.stdout = StringIO()\n yield sys.stdout\n finally:\n sys.stdin = sys.__stdin__\n sys.stdout = sys.__stdout__\n\n\ndef do_test(k, test):\n try:\n log(f\"TEST {k}\")\n i, o = test\n with patchio(i) as r:\n t0 = time.time()\n main()\n t1 = time.time()\n if r.getvalue() == o:\n log(f\"OK ({int((t1-t0)*1000000)/1000:0.3f} ms)\\n\")\n else:\n log(f\"Expected:\\n{o}\"\n f\"Got ({int((t1-t0)*1000000)/1000:0.3f} ms):\\n{r.getvalue()}\")\n except Exception:\n traceback.print_exc()\n log()\n\n\ndef test(ts):\n for k in ts or range(len(tests)):\n do_test(k, tests[k])\n\n\ntests = [(\"\"\"\\\n2 2 2\n\"\"\", \"\"\"\\\n0.333333333333 0.333333333333 0.333333333333\n\"\"\"), (\"\"\"\\\n2 1 2\n\"\"\", \"\"\"\\\n0.150000000000 0.300000000000 0.550000000000\n\"\"\"), (\"\"\"\\\n1 1 3\n\"\"\", \"\"\"\\\n0.057142857143 0.657142857143 0.285714285714\n\"\"\")]\n\n\nif __name__ == '__main__':\n from argparse import ArgumentParser\n parser = ArgumentParser()\n parser.add_argument('--test', '-t', type=int, nargs='*')\n args = parser.parse_args()\n main() if args.test is None else test(args.test)\n", "def probability(r,s,p):\r\n q = (r+s+p)*(r+s+p-1)/2 - r*(r-1)/2 - s*(s-1)/2 - p*(p-1)/2\r\n return {\"rs\":r*s/q, \"rp\":r*p/q, \"sp\":s*p/q}#, \"rr\":r*(r-1)/2/q, \"ss\":s*(s-1)/2/q, \"pp\":p*(p-1)/2/q}\r\n\r\ndef mult(array, n):\r\n return [a*n for a in array]\r\n\r\ndef sum(array1, array2):\r\n return [array1[i]+array2[i] for i in range(len(array1))]\r\n\r\ndef calculate(R,S,P):\r\n d = [[[[0,0,0] for p in range(P+1)]for s in range(S+1)]for r in range(R+1)]\r\n \r\n for r in range(0,R+1):\r\n for s in range(0,S+1):\r\n for p in range(0,P+1):\r\n if r*s + r*p + s*p == 0: #has two zeroes\r\n rsp = r+s+p\r\n if rsp > 0:\r\n d[r][s][p] = [r/rsp,s/rsp,p/rsp]\r\n else: \r\n prob = probability(r,s,p)\r\n if r+s+p == 1:\r\n d[r][s][p] = [r,s,p]\r\n if r > 0:\r\n d[r][s][p] = sum(d[r][s][p], mult(d[r-1][s][p], prob[\"rp\"]))\r\n if s > 0:\r\n d[r][s][p] = sum(d[r][s][p], mult(d[r][s-1][p], prob[\"rs\"]))\r\n if p > 0:\r\n d[r][s][p] = sum(d[r][s][p], mult(d[r][s][p-1], prob[\"sp\"]))\r\n print(' '.join(str(n) for n in d[R][S][P]))\r\n\r\nR,S,P = map(int, input().split())\r\ncalculate(R,S,P)", "# 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\n\r\nA, B, C = mp()\r\nA += 1\r\nB += 1\r\nC += 1\r\nM = max(A, B, C)\r\np = [[[0] * (M) for i in range(M)] for j in range(M)]\r\n\r\nfor a in range(M):\r\n for b in range(M):\r\n for c in range(M):\r\n val = 0\r\n if a == 0 or b == 0:\r\n val = 0\r\n elif c == 0:\r\n val = 1\r\n else:\r\n div = a*b + b*c + c*a\r\n val = (a*b) / div * p[a][b-1][c] + (b*c) / \\\r\n div * p[a][b][c-1] + (a*c) / div * p[a-1][b][c]\r\n\r\n p[a][b][c] = val\r\n\r\nprint(p[A-1][B-1][C-1], p[B-1][C-1][A-1], p[C-1][A-1][B-1])\r\n", "import sys\r\ninput = sys.stdin.readline\r\ndef I():return input().strip()\r\ndef II():return int(input().strip())\r\ndef LI():return [*map(int,input().strip().split())]\r\nimport string, math, time, functools, random, fractions\r\nfrom heapq import heappush, heappop, heapify\r\nfrom bisect import bisect_left, bisect_right\r\nfrom collections import deque, defaultdict, Counter, OrderedDict\r\nfrom itertools import permutations, combinations, groupby\r\nfrom operator import itemgetter\r\n\r\nrock, scissor, paper = LI()\r\ndp = [[[0 for p in range(paper + 1)] for s in range(scissor + 1)] for r in range(rock + 1)]\r\ndp[rock][scissor][paper] = 1\r\nfor r in range(rock, -1, -1):\r\n for s in range(scissor, -1, -1):\r\n for p in range(paper, -1, -1):\r\n currsum = p * r + r * s + s * p\r\n if not currsum:\r\n continue\r\n if r >= 1:\r\n dp[r - 1][s][p] += (p * r) / currsum * dp[r][s][p]\r\n if s >= 1:\r\n dp[r][s - 1][p] += (r * s) / currsum * dp[r][s][p]\r\n if p >= 1:\r\n dp[r][s][p - 1] += (s * p) / currsum * dp[r][s][p]\r\npr = sum(dp[i][0][0] for i in range(1, rock + 1))\r\nps = sum(dp[0][i][0] for i in range(1, scissor + 1))\r\npp = sum(dp[0][0][i] for i in range(1, paper + 1))\r\nprint(round(pr, 12), round(ps, 12), round(pp, 12))", "r, s, p = map(int, input().split())\r\n\r\ndp = [[[0] * 101 for i in range(101)] for i in range(101)]\r\ndp[r][s][p] = 1\r\nfor i in range(r, -1, -1):\r\n for j in range(s, -1, -1):\r\n for k in range(p, -1, -1):\r\n s_dies = i * j\r\n p_dies = j * k\r\n r_dies = k * i\r\n all_ = s_dies + p_dies + r_dies\r\n if all_ == 0:\r\n continue\r\n if i > 0:\r\n dp[i - 1][j][k] += dp[i][j][k] * r_dies / all_\r\n if j > 0:\r\n dp[i][j - 1][k] += dp[i][j][k] * s_dies / all_\r\n if k > 0:\r\n dp[i][j][k - 1] += dp[i][j][k] * p_dies / all_\r\n \r\n\r\nsm = 0\r\nfor i in range(1, r + 1):\r\n sm += dp[i][0][0]\r\nprint(sm, end = \" \")\r\nsm = 0\r\nfor i in range(1, s + 1):\r\n sm += dp[0][i][0]\r\nprint(sm, end = \" \")\r\nsm = 0\r\nfor i in range(1, p + 1):\r\n sm += dp[0][0][i]\r\nprint(sm)", "import sys\r\ninput=sys.stdin.readline\r\nr,s,p=map(int,input().split())\r\ndp=[[[0]*(p+1) for i in range(s+1)] for j in range(r+1)]\r\ndp[r][s][p]=1\r\nfor i in range(r+1)[::-1]:\r\n for j in range(s+1)[::-1]:\r\n for k in range(p+1)[::-1]:\r\n x=i*j+j*k+k*i\r\n if i>0 and j>0:\r\n dp[i][j-1][k]+=i*j*dp[i][j][k]/x\r\n if j>0 and k>0:\r\n dp[i][j][k-1]+=j*k*dp[i][j][k]/x\r\n if k>0 and i>0:\r\n dp[i-1][j][k]+=i*k*dp[i][j][k]/x\r\na1,a2,a3=0,0,0\r\nfor i in range(1,r+1):\r\n a1+=dp[i][0][0]\r\nfor i in range(1,s+1):\r\n a2+=dp[0][i][0]\r\nfor i in range(1,p+1):\r\n a3+=dp[0][0][i]\r\nprint(a1,a2,a3)", "r,s,p = map(int,input().split())\r\nn = 101\r\nm = n * n\r\nt = [0] * n * m\r\n\r\nfor i in range(1, n):\r\n for j in range(n):\r\n for k in range(n):\r\n d = i + n * j + m * k\r\n a = i * j * t[d - n] + i * k * t[d - 1] + j * k * t[d - m]\r\n b = i * j + i * k + j * k\r\n t[d] = a / b if j or k else 1\r\n\r\nprint(t[r + n * s + m * p], t[s + n * p + m * r], t[p + n * r + m * s])", "\nmemo = [[[None for i in range(101)] for j in range(101)] for k in range(2)] \n\ndef comp(aa,bb,cc):\n return (aa*cc),(bb*aa),(bb*cc)\n\ndef dp(aa,bb,cc):\n if memo[aa&1][bb][cc] is not None:\n return memo[aa&1][bb][cc]\n if not aa and not bb and not cc:\n return 0,0,0\n if not aa and bb:\n return 0,1,0\n if not bb and cc:\n return 0,0,1\n if not cc and aa:\n return 1,0,0\n aaa,bbb,ccc = comp(aa, bb, cc)\n rep = (aaa+bbb+ccc)\n ta = tuple(x * aaa for x in dp(aa-1,bb,cc))\n tb = tuple(x * bbb for x in dp(aa,bb-1,cc))\n tc = tuple(x * ccc for x in dp(aa,bb,cc-1))\n memo[aa&1][bb][cc] = tuple(map(sum, zip(ta,tb,tc)))\n memo[aa&1][bb][cc] = tuple(x/rep for x in memo[aa&1][bb][cc])\n return memo[aa&1][bb][cc]\n\n\na,b,c = map(int, input().split(\" \"))\nfor a4 in range(0, a + 1):\n for b4 in range(0, b + 1):\n for c4 in range(0, c + 1):\n memo[a4&1][b4][c4] = None\n dp(a4,b4,c4)\na,b,c = dp(a,b,c)\nprint(a,b,c)\n", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\ndef f(u, v, w):\r\n return (u * (s + 1) + v) * (p + 1) + w\r\n\r\nr, s, p = map(int, input().split())\r\nn = (r + 1) * (s + 1) * (p + 1)\r\ndp = [0] * n\r\ndp[f(r, s, p)] = 1\r\nfor i in range(r, -1, -1):\r\n for j in range(s, -1, -1):\r\n for k in range(p, -1, -1):\r\n x = i * j + j * k + k * i\r\n dp0 = dp[f(i, j, k)]\r\n if not x:\r\n if i > j == k == 0:\r\n dp[f(i - 1, 0, 0)] += dp0\r\n if j > k == i == 0:\r\n dp[f(0, j - 1, 0)] += dp0\r\n if k > i == j == 0:\r\n dp[f(0, 0, k - 1)] += dp0\r\n else:\r\n dp[f(i - 1, j, k)] += dp0 * k * i / x\r\n dp[f(i, j - 1, k)] += dp0 * i * j / x\r\n dp[f(i, j, k - 1)] += dp0 * j * k / x\r\nans = [dp[f(1, 0, 0)], dp[f(0, 1, 0)], dp[f(0, 0, 1)]]\r\nsys.stdout.write(\" \".join(map(str, ans)))" ]

[ "n = int(input())\r\ns = []\r\nx = [[0] * n for _ in range(n)]\r\n\r\nfor i in range(n):\r\n x[i][0] = 1\r\n x[0][i] = 1\r\nfor i in range(1, n):\r\n for j in range(1, n):\r\n x[i][j] = x[i - 1][j] + x[i][j - 1]\r\nfor row in x:\r\n s.append(max(row))\r\nm = max(s)\r\nprint(m)", "n = int(input())\r\nlst = [[0] * n] * n\r\nfor i in range(n):\r\n for j in range(n):\r\n if (i == 0 or j == 0):\r\n lst[i][j] = 1\r\n else:\r\n lst[i][j] = lst[i - 1][j] + lst[i][j - 1]\r\n # print(lst)\r\nprint(lst[-1][-1])\r\n", "n = int(input())\nM = []\nfor i in range(n):\n row = [1]\n if i == 0:\n for j in range(1, n):\n row.append(1)\n else:\n for j in range(1, n):\n row.append(row[j-1] + M[i-1][j])\n M.append(row)\nprint(M[n-1][n-1])\n \t\t\t\t\t \t\t\t\t\t \t\t\t\t \t\t\t \t \t\t", "mang = [1,2,6,20,70,252,924,3432,12870,48620]\r\nn = int(input())\r\nprint(mang[n-1])", "n=int(input())\r\nb=[]\r\nm=1\r\nfor i in range(n):\r\n a=[]\r\n for j in range(n):\r\n if(i==0):\r\n a.append(1)\r\n elif(j==0):\r\n a.append(1)\r\n else:\r\n x=b[i-1][j]+a[j-1]\r\n a.append(x)\r\n if(x>m):\r\n m=x\r\n b.append(a) \r\nprint(m)\r\n", "n =int(input())\r\nmain_arr =[]\r\narr = [1]*n\r\narr2 =[1]\r\nfor i in range(n-1):\r\n for j in range(n-1):\r\n value = arr[j+1]+arr2[j]\r\n arr2.append(value)\r\n arr = arr2\r\n arr2 = [1]\r\nprint(max(arr))\r\n", "def fact(n):\r\n if n == 0:\r\n return 1\r\n else:\r\n return n * fact(n-1)\r\nn=int(input())\r\na=2*(n-1)\r\nb=a//2\r\nif n==1:\r\n print(1)\r\nelse:\r\n print(fact(a)//(fact(b)*fact(a-b)))\r\n", "n = int(input())\r\narr = []\r\nfor i in range(n):\r\n arr.append([0] * n)\r\nfor i in range(n):\r\n arr[i][0] = 1\r\nfor j in range(n):\r\n arr[0][j] = 1\r\nmx = 1\r\nfor i in range(1, n):\r\n for j in range(1, n):\r\n arr[i][j] = arr[i - 1][j] + arr[i][j - 1]\r\n mx = max(mx, arr[i][j])\r\nprint(mx)", "n = int(input())\r\nlst = [0, 1, 2, 6, 20, 70, 252, 924, 3432, 12870, 48620]\r\nprint(lst[n])", "n = int(input())\r\nmatr = [[0]*n for i in range(n)]\r\nfor i in range(n):\r\n matr[i][0] = 1\r\n matr[0][i] = 1\r\nfor i in range(1, n):\r\n for j in range(1, n):\r\n matr[i][j] = matr[i-1][j] + matr[i][j-1]\r\nprint(matr[n-1][n-1])", "def main():\r\n t = int(input())\r\n l = [[1] * t for i in range(t)]\r\n for j in range(1, t):\r\n for i in range(1, t):\r\n l[i][j] = l[i][j-1] + l[i-1][j]\r\n a = l[t-1][t-1]\r\n\r\n print(a)\r\n\r\n\r\nif __name__ == '__main__':\r\n main()", "def f(r,c):\r\n if r==1 or c==1:\r\n return 1\r\n return f(r-1,c) + f(r,c-1)\r\nn=int(input())\r\nprint(f(n,n))", "n=int(input())\r\nm=[]\r\ndef pascal(n):\r\n for j in range(n*2):\r\n D=1\r\n for i in range(1,j+1):\r\n m.append(D)\r\n D = D * (j - i) // i\r\n m.reverse()\r\n print(m[n-1])\r\npascal(n)", "n=int(input())\r\nrows,cols=(n,n)\r\na = [[1]*cols]*rows\r\nfor i in range(1,n):\r\n for j in range(1,n):\r\n a[i][j] = a[i-1][j]+a[i][j-1]\r\nprint(a[n-1][n-1])", "n = int(input())\r\nif n == 1:\r\n print(\"1\")\r\nelse:\r\n li2 = [1]*n\r\n maxim = 1\r\n j = n-1\r\n while j>0:\r\n for i in range(1,len(li2)):\r\n li2[i] = li2[i]+li2[i-1]\r\n maxim = max(maxim,li2[i])\r\n j = j-1\r\n print(maxim)", "import math\r\na = int(input()) - 1\r\nprint(math.factorial(2*a)//(math.factorial(a)**2))", "n=int(input())\r\na=[list([1 for j in range(n)]) for i in range(n)]\r\nfor i in range(1, n):\r\n for j in range(1, n):\r\n a[i][j]=a[i-1][j]+a[i][j-1]\r\nprint(a[-1][-1])\r\n", "def recursive_sum(i, j):\n if i == 1 or j == 1:\n return 1\n else:\n return recursive_sum(i - 1, j) + recursive_sum(i, j - 1)\n\n\nif __name__ == '__main__':\n n = int(input())\n print(recursive_sum(n, n))\n", "size = int(input())\nmatrix = []\nfor i in range(size):\n a = []\n for j in range(size):\n if i == 0 or j == 0:\n a.append(1)\n else:\n a.append(0)\n matrix.append(a)\n\nfor i in range(1,size):\n for j in range(1,size):\n matrix[i][j] = matrix[i-1][j] + matrix[i][j-1]\n\n\nprint(matrix[size-1][size-1])", "n=int(input())\r\na=[[1] for i in range(n-1)]\r\na.extend([[1]*n])\r\na.reverse()\r\nfor i in range(1,n):\r\n for j in range(n-1):\r\n a[i].append(a[i-1][j+1]+a[i][j])\r\nprint(max(a)[-1])", "l=[1,2,6,20,70,252,924,3432,12870,48620]\nprint(l[int(input())-1])\n", "n = int(input())\nl=[]\nfor i in range(n):\n m=[]\n for j in range(n):\n if i==0 or j==0:\n m.append(1)\n else:\n m.append(sum(l[i-1][:j+1]))\n l.append(m)\nprint(l[-1][-1])\n", "n = int(input())\nmaxnum = 1\nli = [[1 for i in range(n)] for i in range(n)]\nfor i in range(n):\n for j in range(n):\n if i>=1 and j >=1:\n num = li[i-1][j]+li[i][j-1]\n li[i][j]=num\n maxnum = max(num,maxnum)\n \nprint(maxnum)", "n = int(input())\r\ntable = [1 for i in range(n)]\r\nfor _ in range(n - 1):\r\n buffer = table\r\n table[0] = 1\r\n for j in range(1, n):\r\n table[j] = buffer[j] + table[j - 1]\r\nprint(max(table))", "def f(a,b):\r\n if a==1 or b==1:\r\n return 1\r\n else:\r\n return f(a,b-1)+f(a-1,b)\r\nn = int(input())\r\nprint(f(n,n))", "n = int(input())\n\na = [1 for i in range(n)]\nd = []\nmx = 1\na[0] = 1\nfor j in range(n-1):\n for i in range(1, n):\n a[i] = a[i-1] + a[i]\n mx = max(a)\nprint(mx)\n\n", "n = int(input())\r\na = []\r\nfor i in range(n):\r\n b = []\r\n for j in range(n):\r\n if i==0 or j==0:\r\n b.append(1)\r\n else:\r\n x = a[i-1][j]\r\n y = b[j-1]\r\n b.append(x + y)\r\n a+=[b]\r\nprint(a[-1][-1])", "n = int(input())\r\npole = [[int(1) for x in range(n)] for y in range(n)]\r\n\r\nfor i in range(1, len(pole)):\r\n for j in range(len(pole[i])):\r\n if j == 0:\r\n pole[i][j] = pole[i-1][j]\r\n else:\r\n pole[i][j] = pole[i][j-1] + pole[i-1][j]\r\n\r\nprint(pole[-1][-1])", "def pascaline(n):\r\n n = n - 1\r\n line = [1]\r\n\r\n for k in range(max(n ,0)):\r\n\r\n line.append(int(line[k]*(n-k)/(k+1)))\r\n\r\n return line\r\nn=int(input())\r\nline=pascaline(2*n-1)\r\nn=len(line)\r\nprint(max(line))", "import math\r\nn=int(input())\r\nprint(math.comb(n * 2 - 2, n - 1))", "import math\r\nip=int(input())\r\nprint(math.comb(ip*2-2,ip-1))\r\n", "def rex(n,m):\r\n\r\n if n==1 or m==1:\r\n return 1\r\n else:\r\n return rex(n-1,m)+rex(n,m-1)\r\n\r\nn=int(input())\r\nprint(rex(n,n))\r\n\r\n\r\n", "a = int(input())\r\nd = [1] * a\r\nf = [1] * a\r\nfor i in range(1, a):\r\n for i2 in range(1, a):\r\n f[i2] = f[i2-1] + d[i2]\r\n d[i2] = f[i2]\r\nprint(f[a-1])\r\n", "n=int(input())\r\nmatrix=[[1]*n for i in range(n)]\r\nmax=0\r\nfor i in range(1,n):\r\n for j in range(1,n):\r\n matrix[i][j]=matrix[i-1][j]+matrix[i][j-1]\r\n if matrix[i][j]>max:\r\n max=matrix[i][j]\r\nprint('1' if n==1 else f'{max}')", "n=int(input())\r\na=[]\r\nb=0\r\nfor i in range(n+2):\r\n a.append([0]*(n+2))\r\n\r\nfor i in range(1):\r\n for j in range(n):\r\n a[i+1][j+1]=1\r\nfor i in range(1,n):\r\n for j in range(n):\r\n a[i+1][j+1]=a[i][j+1]+a[i+1][j]\r\nfor i in range(n+2):\r\n if b<max(a[i]):\r\n b=max(a[i])\r\nprint(b)\r\n", "lis = [0,1,2,6,20,70,252,924,3432,12870,48620]\r\nprint(lis[int(input())])\r\n", "from math import comb\r\nn = int(input())\r\n# Its more look like the pascal's triangle\r\nprint(comb(2*n-2 , n-1))", "a = [[1] * 10]\r\nfor i in range(9): a.append([0] * 10)\r\nfor i in range(10): a[i][0] = 1\r\nfor i in range(1, 10):\r\n for j in range(1, 10):\r\n a[i][j] = a[i - 1][j] + a[i][j - 1]\r\nn = int(input())\r\nprint(a[n - 1][n - 1])", "n = int(input())\r\nif n < 3: print(n)\r\nelse:\r\n t = [[1]*n for _ in range(n)]\r\n for i in range(1,n):\r\n for j in range(1,n): \r\n t[i][j] = t[i-1][j] + t[i][j-1]\r\n print(t[n-1][n-1])", "import sys\r\ninput = sys.stdin.readline\r\n\r\ndef main() -> None :\r\n N:int = int(input())\r\n\r\n maximumValue:int = 0\r\n tableValues:list[list[int]] = [[1]*N for _ in range(N)]\r\n for rowIndex in range(1, N) :\r\n for colIndex in range(1, N) :\r\n tableValues[rowIndex][colIndex] = tableValues[rowIndex-1][colIndex]+tableValues[rowIndex][colIndex-1]\r\n maximumValue = tableValues[-1][-1]\r\n\r\n print(maximumValue)\r\n\r\nmain()", "n = int(input())\r\nlines = [[1 for j in range(n)] for i in range(n)]\r\n\r\nfor i in range(1, n):\r\n for j in range(1, n):\r\n lines[i][j] = lines[i-1][j] + lines[i][j-1]\r\n\r\nmaximum = 0\r\nfor x in lines:\r\n maximum = max(x)\r\n\r\nprint(maximum)", "n=int(input())\r\nmp={}\r\nfor i in range(1,n+1):\r\n for j in range(1,n+1):\r\n if j==1 or i==1:\r\n mp[i,j]=1\r\n else:\r\n mp[i,j]=mp[i-1,j]+mp[i,j-1]\r\nprint(mp[n,n])", "n=int(input())\r\nif n==1: print(1)\r\nelse:\r\n lst=[]\r\n for i in range(n):\r\n lst.append([1 for i in range(n)])\r\n for i in range(1,n):\r\n k=[]\r\n for j in range(n):\r\n if j!=0: lst[i][j]= lst[i][j-1]+lst[i-1][j]\r\n print(lst[-1][-1])", "n = int(input())\r\na = [[1]*n]\r\ny = 0\r\nfor i in range(n-1):\r\n x = [1]\r\n for i in range(n-1):\r\n x.append(x[i]+a[y][i+1])\r\n a.append(x)\r\n y += 1\r\nres = 0\r\nfor j in a:\r\n if max(j) > res:\r\n res = max(j)\r\nprint(res)", "n=int(input())\r\nl=[[1]*n]\r\nfor i in range(n-1):\r\n\tl.append([1]+[0]*(n-1))\r\nfor i in range(n):\r\n\tfor j in range(len(l[i])):\r\n\t\tif l[i][j]==0:\r\n\t\t\tl[i][j]=l[i-1][j]+l[i][j-1]\r\nprint(l[n-1][n-1])", "n = int(input())\r\nmass = []\r\n\r\nfor i in range(n):\r\n if i==0:\r\n mass.append([1]*n)\r\n else:\r\n mass.append([1]+[0]*(n-1))\r\n\r\nfor i in range(1,n):\r\n for j in range(1,n):\r\n mass[i][j] = mass[i][j-1]+mass[i-1][j]\r\nprint(mass[n-1][n-1])\r\n", "n = int(input())\na = [[0] * n] * n\nfor i in range(0, n):\n a[0][i] = 1\n a[i][0] = 1\nfor i in range(1, n):\n for j in range(1, n):\n a[i][j] = a[i - 1][j] + a[i][j - 1]\nprint(a[n - 1][n - 1])\n", "n = int(input())\r\nM = [[0 for x in range(n)] for y in range(n)]\r\nfor i in range(n):\r\n for j in range(n):\r\n if i == 0 or j == 0:\r\n M[i][j] = 1\r\n else:\r\n M[i][j] = M[i-1][j] + M[i][j-1]\r\nprint(M[-1][-1])\r\n", "n = int(input())\r\nl = [[1] * n]\r\n\r\nfor j in range(1, n):\r\n l.append([1])\r\n for i in range(1, n):\r\n l[j].append(l[j-1][i]+l[j][i-1])\r\nprint(max(l[-1]))", "n = int(input())\n\ntable = [[1]*n]*n\n\nfor i in range(1, n):\n\tfor j in range(1, n):\n\t\ttable[i][j] = table[i-1][j] + table[i][j-1]\n\nprint(table[n-1][n-1])\n\n\t\t\t \t\t \t\t \t\t\t \t\t \t\t", "a=int(input())\r\nl=[[1]*a]\r\nfor i in range(a-1):\r\n t=[]\r\n for j in range(a):\r\n if j==0:\r\n t.append(l[i][j])\r\n else:\r\n t.append(l[i][j]+t[j-1])\r\n l.append(t)\r\nprint(l[-1][-1])", "def zero_m(n):\r\n c=[]\r\n for i in range(n):\r\n c.append([])\r\n for j in range(n):\r\n c[i].append(0)\r\n return c\r\n \r\ndef make1(c):\r\n for i in range(len(c)):\r\n c[0][i]=1\r\n for i in range(len(c)):\r\n c[i][0]=1\r\n return c\r\n\r\ndef make_m(c):\r\n for i in range(len(c)):\r\n for j in range(len(c)):\r\n if(i!=0 and j!=0):\r\n c[i][j]=c[i-1][j]+c[i][j-1]\r\n \r\n return c\r\n\r\nn=int(input())\r\nc=[]\r\nc=zero_m(n)\r\nc=make1(c)\r\nc=make_m(c)\r\nprint(c[n-1][n-1])", "n = int(input())\r\na = []\r\n\r\nfor i in range(n):\r\n a.append([1 for j in range(n)])\r\n\r\nfor i in range(1, len(a)):\r\n for j in range(1, len(a)):\r\n a[i][j] = a[i - 1][j] + a[i][j - 1]\r\n\r\nprint(a[-1][-1])", "a = int(input())\r\nb = [[1] * a for _ in range(a)]\r\nfor i in range(a):\r\n for j in range(a):\r\n if i != 0 and j != 0:\r\n b[i][j] = int(b[i-1][j]) + int(b[i][j-1])\r\nprint(b[a-1][a-1])\r\n\r\n", "n = int(input())\r\nMt = [[0 for i in range(n)] for j in range(n)]\r\nfor i in range(n):\r\n for j in range(n):\r\n if i == 0:\r\n Mt[i][j] = 1\r\n elif j == 0:\r\n Mt[i][j] = 1\r\n else:\r\n Mt[i][j] = Mt[i-1][j] + Mt[i][j-1]\r\n\r\nprint(Mt[-1][-1])\r\n", "n=int(input())\r\nf=[]\r\nfor i in range(n):\r\n l=[]\r\n for j in range (n):\r\n l.append(0)\r\n f.append(l)\r\nfor i in range(n):\r\n f[0][i]=1\r\nfor k in range(n):\r\n f[k][0]=1\r\n\r\nfor i in range(1,n):\r\n for j in range(1,n):\r\n f[i][j]=f[i-1][j]+f[i][j-1]\r\nprint(f[n-1][n-1])", "n=int(input())\r\nS=[[0]*n for _ in range(n)]\r\n\r\nfor i in range(n):\r\n S[0][i]=1\r\n S[i][0]=1\r\n\r\nfor i in range(1,n):\r\n for j in range(1,n):\r\n S[i][j]=S[i-1][j]+S[i][j-1]\r\n\r\nprint(S[n-1][n-1])", "n=int(input())\r\nl=[[0 for _ in range(n)] for _ in range(n)]\r\nfor i in range(n):\r\n for j in range(n):\r\n if i==0:\r\n l[i][j]=1\r\n elif j==0:\r\n l[i][j]=1\r\n else:\r\n l[i][j]=l[i][j-1]+l[i-1][j]\r\nprint(l[n-1][n-1])\r\n", "a=[]\r\nb=[]\r\nfor i in range(0,10):\r\n a.append([])\r\n for j in range(0,10):\r\n if i==0 or j==0:\r\n (a[i].append(1))\r\n \r\n else:\r\n (a[i].append(a[i][j-1]+a[i-1][j]))\r\n \r\n \r\n#print(a)\r\nn=int(input())\r\nprint(a[n-1][n-1])\r\n", "n = int(input())\narr = [ [1 for i in range(n)] for j in range(n)]\n\nfor i in range(1,n):\n for j in range(1,n):\n arr[i][j] = arr[i-1][j] + arr[i][j-1]\nprint(arr[-1][-1])\n", "n = int(input())\n\ndef elem(row, col):\n if row == 1 or col == 1:\n return 1\n else:\n return elem(row-1, col) + elem(row, col-1)\n\nprint(elem(n, n))\n", "n = int(input())\r\nlst = [[0 for j in range(n)] for i in range(n)]\r\nfor i in range(len(lst[0])):\r\n lst[0][i] = 1\r\nfor i in range(len(lst)):\r\n lst[i][0] = 1\r\n\r\nfor i in range(len(lst)):\r\n for j in range(1, n):\r\n lst[i][j] = lst[i - 1][j] + lst[i][j - 1]\r\nprint(lst[n - 1][n - 1])\r\n \r\n", "N = int(input())\r\nmassive = []\r\n\r\nfor i in range(N):\r\n massive.append([1] + [0 for j in range(N - 1)])\r\n\r\nmassive[0] = [1 for i in range(N)]\r\n\r\nfor row in range(1, len(massive)):\r\n for number in range(1, len(massive[row])):\r\n topNum = massive[row - 1][number]\r\n sideNum = massive[row][number - 1]\r\n massive[row][number] = topNum + sideNum\r\n\r\nprint(massive[len(massive) - 1][len(massive[len(massive) - 1]) - 1])\r\n", "def f(n):\r\n\tif n < 2:\r\n\t\treturn 1\r\n\telse:\r\n\t\treturn n * f(n - 1)\r\nn = int(input()) - 1\r\nprint(f(2 * n) // (f(n) ** 2))", "def elem(row,col):\r\n if(row == 1 or col == 1):\r\n return 1\r\n else:\r\n return elem(row-1,col) + elem(row,col-1)\r\n\r\nif __name__ == \"__main__\":\r\n n = int(input())\r\n \r\n res = elem(n,n)\r\n print(res)", "n=int(input())\r\na=list()\r\nfor i in range(n):\r\n a.append(1)\r\nb=a\r\nfor i in range(1,n):\r\n for j in range(1,n):\r\n b[j]=a[j]+b[j-1]\r\n a[j]=b[j]\r\nprint(a[-1])\r\n\r\n \r\n\r\n \r\n ", "inp = int(input())\r\nr = inp\r\nc = inp\r\narr = []\r\nfor i in range(c):\r\n col = []\r\n for j in range(r):\r\n col.append(1)\r\n arr.append(col)\r\nfor i in range(1,inp):\r\n for j in range(1,inp):\r\n arr[i][j] = arr[i-1][j] + arr[i][j-1]\r\n\r\nprint(arr[inp-1][inp-1])", "n = int(input())\r\ngrid = [[ 1 for x in range(n)]for y in range(n)]\r\n\r\nfor i in range(1,n):\r\n for j in range(1,n):\r\n grid[i][j]= grid[i][j-1] + grid[i-1][j]\r\n\r\n\r\nprint(max(max(grid)))\r\n", "n=int(input())\narr2d=[]\nfline=[]\nfor i in range(n):\n fline.append(1)\narr2d.append(fline)\nfor i in range(1,n):\n line=[1]\n for j in range(1,n):\n line.append(arr2d[i-1][j]+line[j-1])\n arr2d.append(line)\nprint(arr2d[n-1][n-1])\n\n\n\n\n\n \t\t\t \t\t\t \t\t\t \t\t \t \t\t \t \t \t\t", "n = int(input())\r\nx = [[0 for i in range(n)] for i in range(n)] \r\nfor i in range(n):\r\n x[i][0] = 1\r\n x[0][i] = 1\r\nfor i in range(1, n):\r\n for j in range(1, n):\r\n x[i][j] = x[i-1][j] + x[i][j-1]\r\nprint(x[-1][-1])", "n = int(input())\r\nx = [[1 for i in range(n)] for j in range(n)]\r\nif(n==1):\r\n print(1)\r\nelse:\r\n for i in range(1,n):\r\n for j in range(1,n):\r\n x[i][j] = x[i-1][j] + x[i][j-1]\r\n print(x[n-1][n-1])", "def Maximum_in_Table(n):\r\n # construct the array\r\n arr= []\r\n for i in range(n):\r\n col = []\r\n for j in range(n):\r\n if i == 0 or j == 0:\r\n col.append(1)\r\n else:\r\n col.append(0)\r\n arr.append(col)\r\n# editing array\r\n for i in range(n):\r\n for j in range(n):\r\n if i > 0 and j >0:\r\n arr[i][j] = arr[i-1][j]+arr[i][j-1]\r\n return arr[-1][-1]\r\nn = int(input())\r\nprint(Maximum_in_Table(n))", "x=int(input(\"\"))\r\nif x==1 or x==2:\r\n\tprint(x)\r\nif x==3:\r\n\tprint(x*2)\r\nif x==4:\r\n\tprint(x*5)\r\nif x==5:\r\n\tprint(70)\r\nif x==6:\r\n\tprint(252)\r\nif x==7:\r\n\tprint(924)\r\nif x==8:\r\n\tprint(3432)\r\nif x==9:\r\n\tprint(12870)\r\nif x==10:\r\n\tprint(48620)", "def f(n, m):\r\n if n == 1 or m == 1:\r\n return 1\r\n else:\r\n return f(n - 1, m) + f(n, m - 1)\r\nn = int(input())\r\nprint(f(n, n))", "#list(map(int,input().split()))\r\nfor s in range(1):#int(input())\r\n n=int(input())\r\n p=[]\r\n for i in range(n):\r\n if i==0:\r\n p.append([1 for aboba in range(n)])\r\n else:\r\n p.append([0 for aboba in range(n)])\r\n p[i][0]+=1\r\n for i in range(n):\r\n for j in range(n):\r\n if p[i][j]==0:\r\n p[i][j]=p[i-1][j]+p[i][j-1]\r\n print(p[-1][-1])", "n = int(input())\nrist = []\ntemp = []\n\nfor i in range(0, n, 1):\n temp.append(1)\n\nrist.append(temp)\nfor i in range(1, n, 1):\n line = [1]\n for j in range(1, n, 1):\n line.append(line[j-1]+rist[i-1][j])\n\n rist.append(line)\n\nprint(rist[n-1][n-1])\n\n\t\t \t\t\t\t\t \t\t \t\t\t\t \t\t \t\t\t", "n = int(input())\r\ns = [[1 if x == 0 or y == 0 else 0 for y in range(n) ]for x in range(n)]\r\nfor i in range(1, n):\r\n for j in range(1, n): \r\n s[i][j] = s[i-1][j] + s[i][j-1]\r\nprint(s[n-1][n-1])", "\r\nx = eval(input())\r\nlist1 = []\r\nlist3 = []\r\nlist1.append(1)\r\nfor i in range(0,x):\r\n if i == 0:\r\n for j in range(1,x):\r\n a = list1[j-1]\r\n list1.append(a)\r\n for number in list1:\r\n list3.append(number)\r\n else:\r\n list2 = []\r\n list2.append(1)\r\n for k in range(1,x):\r\n b = list2[k-1] + list1[k]\r\n list2.append(b)\r\n for number1 in list2:\r\n list3.append(number1)\r\n list1 = list2\r\nprint(max(list3))\r\n\r\n", "n=int(input())\r\na=[[1]*n]\r\nfor i in range(1,n):\r\n b=[]\r\n for j in range(0,n):\r\n if j==0:\r\n b.append(1)\r\n else:\r\n b.append(b[-1]+a[i-1][j])\r\n a.append(b)\r\nprint(a[n-1][n-1])", "n=int(input())\r\na=[]\r\nfor i in range(n):\r\n a.append([])\r\n for j in range(n):\r\n if(i==0 or j==0):\r\n a[i].append(1)\r\n else:\r\n a[i].append(a[i-1][j]+a[i][j-1])\r\nprint(a[-1][-1])", "n = int(input())\n\narr = [[0]*n]*n\narr[0] =[1]*n\nfor i in range(n):\n arr[i][0] = 1\nfor i in range(1, n):\n for j in range(1, n):\n arr[i][j] = arr[i-1][j]+arr[i][j-1]\nprint(arr[n-1][n-1])\n\t \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 = [[0]*n for i in range(0, n)]\r\n for i in range(0, n):\r\n arr[i][0] = 1\r\n arr[0][i] = 1\r\n for i in range(1, n):\r\n for j in range(1, n):\r\n arr[i][j] = arr[i - 1][j] + arr[i][j - 1]\r\n print(arr[n - 1][n - 1])", "def table_max(n):\n grid = [[0] * n for _ in range(n)]\n for i in range(n):\n grid[i][0] = 1\n grid[0][i] = 1\n\n for i in range(n):\n for j in range(n):\n if grid[i][j] == 0:\n grid[i][j] = grid[i - 1][j] + grid[i][j - 1]\n\n return grid[-1][-1]\n\n\nif __name__ == '__main__':\n n = int(input())\n print(table_max(n))\n", "# problem: https://codeforces.com/problemset/problem/509/A\r\nimport sys\r\n\r\n\r\ndef solve(n):\r\n arr = [[0 for j in range(n)] for i in range(n)]\r\n\r\n for i in range(n):\r\n arr[0][i] = 1\r\n\r\n for i in range(n):\r\n arr[i][0] = 1\r\n\r\n for i in range(1, n):\r\n for j in range(1, n):\r\n arr[i][j] = arr[i - 1][j] + arr[i][j - 1]\r\n\r\n return arr[n - 1][n - 1]\r\n\r\n\r\ndef main():\r\n n = int(input())\r\n\r\n sys.stdout.write(str(solve(n)))\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "\r\na = int(input())\r\nb = [[0] * a for i in range(a)]\r\nc = []\r\nfor i in range(a):\r\n for j in range(a):\r\n if i == 0 :\r\n b[i][j] = 1\r\n else:\r\n b[i][j] = b[i - 1][j] + b[i][j -1]\r\nfor i in b:\r\n c.append(max(i))\r\nprint(max(c))", "n=int(input())\r\ndp=[[0 for i in range(n)]for j in range(n)]\r\nfor i in range(n):\r\n dp[0][i]=1\r\n dp[i][0]=1\r\nfor i in range(1,n):\r\n for j in range(1,n):\r\n dp[i][j]=dp[i-1][j]+dp[i][j-1]\r\nprint(dp[n-1][n-1])", "n = int(input())\r\narr = []\r\ntemparr = []\r\nfor i in range(n):\r\n temparr.append(1)\r\nfor i in range(n):\r\n arr.append(temparr)\r\nfor i in range(1, n):\r\n for j in range(1, n):\r\n arr[i][j] = arr[i-1][j] + arr[i][j-1]\r\nprint(max(arr[n-1]))", "n = int(input())\r\n\r\nlist = []\r\n\r\nfor i in range (n):\r\n list.append(1)\r\n\r\nnew = [1]\r\n\r\nfor i in range (n - 1):\r\n for j in range (n - 1):\r\n new.append(new[j] + list[j + 1])\r\n \r\n list = new[:]\r\n new.clear()\r\n new.append(1)\r\n\r\nprint(max(list))", "n=int(input())\nrow = [1] * n\nfor i in range(1, n):\n prevCol = 1\n for j in range(1, n):\n row[j] = row[j] + prevCol\n prevCol = row[j]\nprint(row[n-1])\n\n\n\n\n\n\n\n\n\n\n \n \n \n", "n=int(input())\r\nlines=[]\r\nline0=[]\r\nfor i in range(n):\r\n line0.append(1)\r\nfor j in range(n):\r\n lines.append(line0)\r\nfor k in range(1,n):\r\n for l in range(1,n):\r\n lines[k][l]=lines[k-1][l]+lines[k][l-1]\r\nprint(lines[-1][-1])", "from math import factorial\r\nn=int(input())\r\nprint(int(factorial(2*(n-1))/factorial(n-1)**2))", "def factoriel(m):\r\n for x in range(m-1,0,-1):\r\n m *= x\r\n return m\r\n\r\n\r\n\r\nn = int(input())\r\nif n == 1:\r\n print(1)\r\nelse:\r\n k = (n-1)*2\r\n r = factoriel(k)/(factoriel(int(k/2))**2)\r\n print(int(r))", "n = int(input())\r\nl = [[1]*n]*n\r\nfor i in range(1,n) :\r\n for j in range(1,n):\r\n l[i][j] = l[i-1][j]+l[i][j-1]\r\nprint(l[-1][-1])", "n = int(input())\r\nrow = [1] * n\r\n\r\nfor i in range(n - 1):\r\n pointer = 0\r\n for index in range(n):\r\n row[index] += pointer\r\n pointer = row[index]\r\n\r\nprint(row[n - 1])\r\n\r\n\r\n", "n=int(input())\r\nli=[]\r\nfor i in range(n):\r\n li.append([])\r\n for j in range(n):\r\n if(i==0 or j==0):\r\n li[i].append(1)\r\n else:\r\n li[i].append(li[i-1][j]+li[i][j-1])\r\n \r\nprint(li[n-1][n-1])", "n = int(input())\r\nli = [1, 2, 6, 20, 70, 252, 924, 3432, 12870, 48620]\r\nn = n-1\r\nprint(li[n])\r\n", "t=int(input())\r\nlst=[[0 for j in range(t)]for i in range(t)]\r\nfor i in range(t):\r\n for j in range(t):\r\n if i==0:\r\n lst[i][j]=1\r\n else:\r\n lst[i][j]=lst[i-1][j]+lst[i][j-1]\r\nprint(lst[t-1][t-1])", "t=int(input())\r\ntable = [[1 for _ in range(t)] for i in range(t)]\r\nfor i in range(1,t):\r\n for j in range(1,t):\r\n table[i][j]=table[i][j-1]+table[i-1][j]\r\nprint(table[-1][-1])", "n = int(input())\r\n\r\nlist1 = [[int(1) for j in range(n)] for i in range(n)]\r\n\r\nfor i in range(1, n):\r\n for j in range(1, n):\r\n list1[i][j] = list1[i-1][j] + list1[i][j-1]\r\n\r\nprint(max(max(list1)))", "n=int(input())\r\nif n==1:\r\n print(\"1\")\r\nelif n==2:\r\n print(\"2\")\r\nelif n==3:\r\n print(\"6\")\r\nelif n==4:\r\n print(\"20\")\r\nelif n==5:\r\n print(\"70\")\r\nelif n==6:\r\n print(\"252\")\r\nelif n==7:\r\n print(\"924\")\r\nelif n==8:\r\n print(\"3432\")\r\nelif n==9:\r\n print(\"12870\")\r\nelif n==10:\r\n print(\"48620\")", "n = int(input())\r\n\r\nmat=[[0 for i in range(n)] for i in range(n)]\r\n\r\nfor i in range(n):\r\n mat[0][i]=1\r\n mat[i][0]=1\r\n\r\n\r\n \r\nfor i in range(1, n):\r\n for j in range(1, n):\r\n mat[i][j] = mat[i-1][j] + mat[i][j-1]\r\nprint(mat[n-1][n-1])\r\n", "import math\r\nn = int(input())\r\nprint(math.comb(2*n-2,n-1))", "import math\r\nn = int(input())\r\nx = (2*n)-2\r\ny = n-1\r\nprint(math.comb(x,y))", "n=int(input())\r\nw=[[0]*n for i in range (n)]\r\nfor i in range (n):\r\n w[i][0]=1\r\n w[0][i]=1\r\nfor i in range (1,n):\r\n for j in range (1,n):\r\n w[i][j]=w[i-1][j]+w[i][j-1]\r\nprint (w[n-1][n-1])\r\n", "ans = [1, 2, 6, 20, 70, 252, 924, 3432, 12870, 48620]\r\nn = int(input())\r\nprint(ans[n - 1])\r\n", "a=int(input())\r\nb=[[1 for j in range(a)]]\r\nfor i in range(1,a):\r\n b.append([1])\r\n for j in range(1,a):\r\n b[i].append(int(b[i][j-1])+int(b[i-1][j]))\r\nprint(max(b[a-1]))", "\r\nn=int(input())\r\na=[1]*n\r\nfor i in range(n-1):\r\n for i in range(n-1):\r\n a[i+1]=a[i]+a[i+1]\r\n # print(a)\r\nprint(a[-1])", "print([1 , 2 , 6 , 20 , 70 , 252 , 924 , 3432 , 12870 , 48620][int(input()) - 1])", "n = int(input())\r\na = []\r\n\r\nfor y in range(n):\r\n row = [1]\r\n for x in range(y):\r\n # print(\"[y, x]\", [y, x])\r\n # print(\"a:\", a)\r\n # for o in a:\r\n # print(o)\r\n # print(f\"row to me appended: {row}\")\r\n # print(f\"previous = row[{x}]\")\r\n # print(f\"previous = {row[x]}\")\r\n\r\n # print(f\"above one a[{y-1}][{x}]\")\r\n # if a != [[1]] and x != n-2:\r\n # print(f\"above one: {a[y-1][x+1]}\")\r\n\r\n\r\n \r\n\r\n\r\n\r\n if x+1 == y:\r\n row.append(row[x]*2)\r\n # print(f\"x y euqal appened, 2x the last elem ({row[x]*2})\")\r\n elif a != [[1]] and x != n-2:\r\n previus = row[x]\r\n above_one = a[y-1][x+1]\r\n sum = above_one + previus\r\n row.append(sum)\r\n\r\n # print(\"\\n\")\r\n\r\n a.append(row)\r\n\r\n# for row in a:\r\n# print(row)\r\nprint(a[n-1][n-1])", "n=int(input(''))\r\nl=[]\r\nif n in range(1,11):\r\n for i in range(n):\r\n l1=[]\r\n for j in range(n):\r\n if i==0 or j==0:\r\n l1.append(1)\r\n else:\r\n l1.append(0)\r\n l.append(l1)\r\n for k in range(1,n):\r\n for m in range(1,n):\r\n l[k][m]=l[k][m-1]+l[k-1][m]\r\n \r\nmax_val=max(list(map(max,l)))\r\nprint(max_val)\r\n", "l= [0,1,2,6,20,70,252,924,3432,12870,48620]\r\nn = int(input())\r\nprint(l[n])", "q = int(input())\r\nw = [[1 for j in range(q)] for i in range(q)]\r\nfor i in range(1, q):\r\n for j in range(1, q):\r\n w[i][j] = w[i - 1][j] + w[i][j - 1]\r\nprint(w[-1][-1])", "n = int(input())\r\na=[0,1,2,6,20,70,252,924,3432,12870,48620]\r\nprint(a[n])", "def main(n):\r\n s = [[1]*n for i in range(n)]\r\n for i in range(1,n):\r\n for j in range(1,n):\r\n s[i][j] = s[i-1][j]+s[i][j-1]\r\n \r\n return s[n-1][n-1]\r\n\r\nprint(main(int(input())))", "n=int(input())\r\nma=[]\r\nfor i in range(n):\r\n if i==0:\r\n ma.append([1]*n)\r\n else:\r\n ma.append([1]+[0]*(n-1))\r\nfor i in range(n):\r\n for j in range(n):\r\n if i!=0 and j!=0:\r\n ma[i][j]=(ma[i-1][j]+ma[i][j-1])\r\nprint(ma[n-1][n-1])", "import math\r\nimport sys\r\nfrom sys import *\r\nfrom bisect import insort\r\nimport heapq\r\nimport collections\r\nfrom collections import deque, defaultdict\r\nfrom itertools import permutations, combinations, combinations_with_replacement\r\nimport random\r\nimport os\r\n\r\n\r\nmod = 10**9+7 #1000000007\r\nMAX = sys.maxsize #maximum size\r\nMIN = -sys.maxsize-1 #minimum size\r\n\r\n#----------Check Prime numbers----------------\r\ndef isPrime(n):\r\n if n>1:\r\n for i in range(2,n):\r\n if (n%i) == 0:\r\n return False\r\n else:\r\n return True\r\n else:\r\n \r\n return False\r\n#----------Check Panagram-----------------------\r\ndef isPanagram(s):\r\n \r\n alphabet = 'abcdefghijklmnopqrstuvwxyz'\r\n for char in alphabet:\r\n if char not in s.lower():\r\n return False\r\n return True\r\n\r\n#----------List with same elements--------------\r\ndef isEqual(list1):\r\n if len(list1)<0:\r\n res = True\r\n res = all(ele == list1[0] for ele in list1)\r\n if(res):\r\n return True\r\n else:\r\n return False\r\n\r\n#-----Removing duplicate elements from a list---\r\ndef remove_duplicate(list1):\r\n final_list = []\r\n for i in list1:\r\n if i not in final_list:\r\n final_list.append(i)\r\n return final_list%mod\r\n\r\n#-----------------Solve it----------------------\r\ndef solve():\r\n n = int(input())\r\n arr = []\r\n ar = []\r\n if n == 1:\r\n return 1\r\n else:\r\n for i in range(n):\r\n ar = []\r\n for j in range(n):\r\n if i==0:\r\n ar.append(1)\r\n elif j == 0:\r\n ar.append(1)\r\n else:\r\n ar.append(0)\r\n arr.append(ar)\r\n for i in range(n):\r\n for j in range(n):\r\n if arr[i][j] == 0:\r\n arr[i][j] = arr[i-1][j]+arr[i][j-1]\r\n return max(max(arr))\r\n\r\n#------------------Main-------------------------\r\nif __name__ == '__main__':\r\n #t = int(stdin.readline())\r\n #for i in range (t):\r\n result = solve()\r\n stdout.write(str(result)+'\\n')\r\n", "x = [1 for i in range(int(input()))]\r\nanswer = []\r\nif len(x) == 1:\r\n print(1)\r\nelse:\r\n for i in range(len(x)-1):\r\n v = []\r\n for j in range(1, len(x)+1):\r\n v.append(sum(x[:j]))\r\n x = v\r\n answer.append(v)\r\n print(answer[-1][-1])", "t = int(input())\r\nnew = [[0 for j in range(t)] for i in range(t)]\r\nfor j in range(t):\r\n for i in range(t):\r\n if i == 0 or j == 0:\r\n new[j][i] = 1\r\nfor j in range(1, t):\r\n for i in range(1, t):\r\n new[j][i] = new[j-1][i]+new[j][i-1]\r\nprint(new[t-1][t-1])\r\n", "n=int(input())\r\na=[]\r\nfor i in range(n):\r\n a.append(1)\r\nfor i in range(n,n*n):\r\n if i%n==0:\r\n a.append(1)\r\n else:\r\n a.append(a[i-1]+a[i-n])\r\nprint(a[n*n-1])", "n = int(input())\r\na = []\r\nb = []\r\nfor i in range(n):\r\n b.append(1)\r\na.append(b)\r\nb = [1]\r\nfor i in range(n - 1):\r\n for j in range(n - 1):\r\n b.append(a[i][j + 1] + b[j])\r\n a.append(b)\r\n b = [1]\r\nprint(a[-1][n - 1])", "def t(b,a):\r\n n=1\r\n for i in range(b+1,a+1):\r\n n*=i\r\n m=1\r\n for i in range(2,b+1):\r\n m*=i\r\n return n//m\r\nn=int(input())\r\nprint(t(n-1,2*(n-1)))", "from pprint import pprint\nn = int(input())\ntable = [[1]+ [0]*(n-1)] * (n-1)\ntable.insert(0,[1]*n)\nfor row in range(1,n):\n for col in range(1,n):\n table[row][col] = table[row - 1][col] + table[row][col-1]\nprint(table[-1][-1])", "import math\r\nx=int(input())\r\nif x==1:\r\n print(1)\r\nelif x==2:\r\n print(2)\r\nelse:\r\n y=math.comb(((x-2)+x),(x-1))\r\n print(y)", "def sol(n):\r\n mat = []\r\n arr = []\r\n for i in range(n):\r\n for j in range(n):\r\n arr.append(1)\r\n mat.append(arr)\r\n for i in range(n):\r\n for j in range(n):\r\n if not(i == 0 or j == 0):\r\n mat[i][j] = mat[i - 1][j] + mat[i][j - 1]\r\n return mat[n - 1][n - 1]\r\n\r\n\r\nn = int(input())\r\nprint(sol(n))\r\n", "def permutaion(n):\r\n if n <= 1:\r\n return 1\r\n return n * permutaion(n - 1)\r\nn = int(input())\r\nprint(\r\n permutaion(n*2 - 2) // (permutaion(n - 1) * permutaion(n - 1))\r\n)", "n = int(input())\r\n\r\ntable = [[1]*n]\r\n\r\nfor t in range(n-1):\r\n\ttable.append([1] + [0]*(n-1))\r\n\r\nfor r in range(1, n):\r\n\tfor c in range(1, n):\r\n\t\ttable[r][c] = table[r-1][c] + table[r][c-1]\r\n\r\nprint(table[-1][-1])", "n=int(input())\r\na=[]\r\nfor i in range(n):\r\n a.append(1)\r\nfor i in range(n-1):\r\n for j in range(n):\r\n a[-j-1]=sum(a[:n-j])\r\nprint(a[-1])", "def fact(n):\r\n ans = 1\r\n for i in range(2, n+1):\r\n ans *= i\r\n return ans\r\nn = int(input())\r\nprint(fact(2*n - 2)//fact(n-1)**2)\r\n", "input1 = input()\ngraph = []\n\n\nfor i in range(int(input1)):\n ar = []\n for j in range(int(input1)):\n if i == 0:\n ar.append(1)\n else:\n num = 0\n for k in range(j + 1):\n\n num += graph[i - 1][k]\n ar.append(num)\n graph.append(ar)\n # print(graph)\n\nprint(ar[len(ar)-1])\n", "n = int(input())\r\n\r\nl = [[0 for i in range(n)] for j in range(n)]\r\nfor i in range(n):\r\n l[0][i] = 1\r\n\r\nfor j in range(n):\r\n l[j][0] = 1\r\n\r\nfor i in range(1,n):\r\n for j in range(1,n):\r\n l[i][j] = l[i-1][j] + l[i][j-1]\r\n\r\nprint(l[n-1][n-1])", "n = int(input())\r\na = [[0 for i in range(n)] for j in range(n)]\r\n\r\nfor i in range(n):\r\n for j in range(n):\r\n if i==0 or j==0:\r\n a[i][j] = 1\r\n else:\r\n a[i][j] = a[i-1][j] + a[i][j-1]\r\n\r\nprint(a[n-1][n-1])", "n = int(input())\r\nl = [1]*n\r\n\r\nfor p in range (n-1):\r\n for i in range (1,n):\r\n l[i]+=l[i-1]\r\n\r\nprint(max(l))", "n = int(input())\r\nlist1 = [1] * n\r\nlist2 = list1\r\nfor i in range(n-1):\r\n list2 = []\r\n for j in range(n):\r\n list2.append(sum(list1[:j+1]))\r\n list1 = list2\r\nprint(list2[-1])", "n=int(input())\r\nif n==1: print(1)\r\nelif n==2: print(2)\r\nelif n==3: print(6)\r\nelif n==4: print(20)\r\nelif n==5: print(70)\r\nelif n==6: print(252)\r\nelif n==7: print(924)\r\nelif n==8: print(3432)\r\nelif n==9: print(12870)\r\nelif n==10: print(48620)", "if __name__ == \"__main__\":\r\n n = int(input())\r\n\r\n table = []\r\n for _ in range(n):\r\n table.append([])\r\n\r\n max_value_in_table = 1\r\n for i in range(n):\r\n for j in range(n):\r\n total = 0\r\n if i == 0:\r\n table[i].append(1)\r\n else:\r\n if j == 0: \r\n table[i].append(1)\r\n else:\r\n for k in range(i + 1):\r\n total += table[k][j - 1]\r\n\r\n table[i].append(total)\r\n\r\n max_value_in_table = max(max_value_in_table, total)\r\n\r\n print(max_value_in_table)\r\n", "#import sys\r\nl=list()\r\nn=int(input())\r\nfor i in range(0,n):\r\n if(i==0):\r\n l.append([1]*n)\r\n else:\r\n k=[1]+[0]*(n-1)\r\n #print(k)\r\n l.append(k)\r\n #print(l)\r\n for j in range(1,n):\r\n try:\r\n l[i][j]=l[i-1][j]+l[i][j-1]\r\n \r\n except:\r\n pass\r\n \r\n #k=list()\r\nprint(l[-1][-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", "n = int(input())\r\ndef elem(row,col):\r\n if row == 1 or col == 1:\r\n return 1\r\n return elem(row-1,col) + elem(row,col-1)\r\nprint(elem(n,n))", "n = int(input())\ntable = [[1] * n] + [[1] + [0] * (n-1) for _ in range(n-1)]\n\nfor i in range(1, n):\n for j in range(1, n):\n table[i][j] = table[i-1][j] + table[i][j-1]\n\nprint(table[n-1][n-1])\n# Mon Jul 03 2023 15:41:38 GMT+0300 (Moscow Standard Time)\n", "n = int(input())\r\nmat = [[0 for _ in range(n+1)] for _ in range(n+1)]\r\nfor i in range(n+1):\r\n mat[i][1] = 1\r\n mat[1][i] = 1\r\nans = 1\r\nfor i in range(2, n+1):\r\n for j in range(2, n+1):\r\n mat[i][j] = mat[i-1][j] + mat[i][j-1]\r\n ans = max(ans, mat[i][j])\r\nprint(ans)", "a=int(input())\r\ns=[1]*a\r\ns=list(s)\r\nfor i in range(1,a):\r\n for k in range(1,a):\r\n s[k]=s[k]+s[k-1]\r\nprint(s[-1])", "import math\n\n\ndef combinations(n, r):\n return math.factorial(n) // math.factorial(r) // math.factorial(n - r)\n\n\nn = int(input())\nprint(combinations(2 * n - 2, n - 1))", "\r\n\r\ndef find_maximum(n):\r\n arr = [[0]*n]*n\r\n arr[0] = [1] * n\r\n for c in arr:\r\n c[0] = 1\r\n\r\n for i in range(1, n):\r\n for j in range(1, n):\r\n arr[i][j] = arr[i-1][j] + arr[i][j-1]\r\n print(arr[-1][-1])\r\n\r\nif __name__ == '__main__':\r\n n = int(input())\r\n find_maximum(n)", "a=[0,1,2,6,20,70,252,924,3432,12870,48620]\r\nn=int(input())\r\nprint(a[n])", "n = int(input())\r\nv = []\r\nfor i in range(n):\r\n\tif i == 0:\r\n\t\ta = [1]*n\r\n\t\tv.append(a)\r\n\telse:\r\n\t\ta = [1] + [0]*(n-1)\r\n\t\tfor j in range(1, n):\r\n\t\t\ta[j] = a[j-1]+v[i-1][j]\r\n\t\tv.append(a)\r\n\t\t\r\nprint(v[n-1][n-1])", "n, a = int(input()), []\r\nfor i in range(0, n):\r\n temp = []\r\n for j in range(0, n):\r\n if i == 0 or j == 0:temp.append(1)\r\n else:temp.append(0)\r\n a.append(temp)\r\nfor i in range(1, n):\r\n for j in range(1, n):\r\n a[i][j] = a[i - 1][j] + a[i][j - 1]\r\nprint(a[n - 1][n - 1])", "n = int(input())\r\n\r\nli = [[0]*n]*n\r\n\r\nfor i in range(n):\r\n li[i][0] = 1\r\n \r\n\r\nfor i in range(n):\r\n li[0][i] = 1\r\n\r\n\r\nfor i in range(1,n):\r\n for j in range(1,n):\r\n li[i][j] = li[i-1][j] + li[i][j-1]\r\n \r\n\r\nprint(li[n-1][n-1])", "n = int(input())\r\nnums = [[1]*n]*n\r\nfor i in range(1, n):\r\n for j in range(1, n):\r\n nums[i][j] = nums[i-1][j] + nums[i][j-1]\r\nprint(nums[0][n-1])", "n=int(input())\np=[]\nd=[]\nfor i in range(1):\n for j in range(n):\n d+=[1]\n p+=[d]\n d=[]\nfor i in range(1,n):\n for j in range(n):\n s=0\n for q in range(j+1):\n s+=p[i-1][q]\n d+=[s]\n p+=[d]\n d=[]\nprint(p[-1][-1])\n", "def maximum_table():\n n = int(input())\n table = [[0] * n] * n\n for i in range(n):\n for j in range(n):\n if i == 0 or j == 0:\n table[i][j] = 1\n for i in range(1, n):\n for j in range(1, n):\n table[i][j] = table[i - 1][j] + table[i][j - 1]\n print(table[n - 1][n - 1])\n\n\nmaximum_table()\n", "N = int(input())\r\ngrid = [[ 1 for x in range(N)]for y in range(N)]\r\n\r\nfor i in range(1,N):\r\n for j in range(1,N):\r\n grid[i][j]=grid[i][j-1]+grid[i-1][j]\r\nprint(max(max(grid)))", "def solve(num):\r\n ls = [[0 for x in range(num)] for y in range(num)]\r\n for i in range(num):\r\n ls[i][0] = 1\r\n for i in range(num):\r\n ls[0][i] = 1\r\n \r\n for j in range(1, num):\r\n for i in range(1, num):\r\n ls[j][i] = ls[j-1][i] + ls[j][i-1]\r\n\r\n m = 0 \r\n for i in ls:\r\n t = max(i)\r\n if t > m:\r\n m = t\r\n print(m)\r\n\r\n\r\n\r\n\r\nnum = int(input())\r\nsolve(num)\r\n\r\n", "x = int(input())\r\na = []\r\nb = 1\r\ny = [1]\r\nz = []\r\nfor i in range(x):\r\n a.append(b)\r\n if i > 0:\r\n y.append(a[i]+i)\r\nfor k in range(x-2):\r\n for k in range(len(y)):\r\n if k == 0:\r\n z.append(y[0])\r\n else:\r\n z.append(z[k-1]+y[k])\r\n y = z\r\n z = []\r\nprint(max(y))\r\n", "a=int(input())\r\nb=[[0]*a for i in range(a)]\r\nb[0]=[1]*a\r\nfor i in range(1,a):\r\n b[i][0]=1\r\n for j in range(1,a):\r\n b[i][j]=b[i][j-1]+b[i-1][j]\r\nc=max(b)\r\nd=max(c)\r\nprint(d)\r\n \r\n \r\n \r\n \r\n \r\n \r\n\r\n \r\n \r\n\r\n\r\n\r\n \r\n \r\n \r\n \r\n\r\n \r\n \r\n\r\n\r\n", "n = int(input())\na = [[0] * 15 for _ in range(15)]\nfor i in range(1, 2):\n for j in range(1, n + 1):\n a[i][j] = 1\nfor i in range(2, n + 1):\n a[i][1] = 1\n for j in range(2, n + 1):\n a[i][j] = a[i - 1][j] + a[i][j - 1]\nprint(a[n][n])\n\t\t\t \t\t \t\t \t \t\t \t\t \t \t\t \t", "a=int(input())\r\nk=[0]*(a*a)\r\nfor i in range (a*a):\r\n if i+1<a+1 or (i+1)%a==1:\r\n k[i]=1\r\n else:\r\n k[i]=k[i-1]+k[i-a]\r\nprint(max(k))\r\n", "n = int(input())\r\nm = [[1 for i in range(n)]for j in range(n)]\r\nfor i in range(1,n):\r\n for j in range(1,n):\r\n m[i][j] = m[i-1][j]+m[i][j-1]\r\nprint(m[-1][-1])\r\n", "def mat(row, col):\r\n if row == 1 or col == 1:\r\n return 1\r\n else:\r\n return mat(row-1, col) + mat(row, col-1)\r\n\r\n\r\nnum = int(input())\r\nprint(mat(num, num))", "x=int(input())\na=[['.' for j in range(x)]for i in range(x)]\nfor i in range(x):\n a[0][i]=1\nfor i in range(1,x):\n a[i][0]=1\nfor i in range(1,x):\n for j in range(1,x):\n a[i][j]=a[i-1][j]+a[i][j-1]\nprint(a[x-1][x-1])\n\n# Mon Jul 03 2023 13:41:39 GMT+0300 (Moscow Standard Time)\n", "n=int(input())\r\nl1=[1]*n\r\nl2=[1]\r\nfor i in range(n-1):\r\n i=0\r\n j=1\r\n while j<n:\r\n l2.append(l1[j]+l2[i])\r\n i+=1\r\n j+=1\r\n l1=l2\r\n l2=[1]\r\nprint(l1[n-1])\r\n\r\n\r\n\r\n", "n = int(input())\r\nmat = [n * [1]]\r\noutput = 1\r\nfor j in range(1, n):\r\n m = [1]\r\n for k in range(1, n):\r\n m.append(mat[j - 1][k] + m[k - 1])\r\n mat.append(m)\r\n output = max(m + [output])\r\nprint(output)\r\n", "\r\nn = int(input())\r\narr= [[0]*(n) for i in range(n)]\r\nfor i in range(n):\r\n arr[0][i]=1\r\n arr[i][0]=1\r\nfor i in range(1,n):\r\n for j in range(1,n):\r\n arr[i][j]=arr[i-1][j]+arr[i][j-1]\r\nprint(arr[n-1][n-1]) ", "n=int(input())\r\narr=[1,2,6,20,70,252,924,3432,12870,48620]\r\nprint(arr[n-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\nans = 0\r\ns = [ ]\r\nd = 0\r\ns1 = 0\r\nfor i in range(n):\r\n s += [1]\r\nwhile d != n - 1:\r\n if s1 != n:\r\n ans += s[s1]\r\n s += [ans]\r\n s1 += 1\r\n else:\r\n ans = 0\r\n d += 1\r\n s = s[s1 : ]\r\n s1 = 0\r\nprint(max(s))\r\n", "n = int(input())\r\nlist_nums = [[None]*(n+1) for _ in range(n+1)]\r\nfor i in range(1,n+1):\r\n list_nums[1][i] = 1\r\n list_nums[i][1] = 1\r\nfor i in range(2,n+1):\r\n for j in range(2,n+1):\r\n list_nums[i][j] = list_nums[i-1][j] + list_nums[i][j-1]\r\nprint(list_nums[n][n])", "n = int(input())\r\nary = [0,\r\n 1,\r\n2,\r\n6,\r\n20,\r\n70,\r\n252,\r\n924,\r\n3432,\r\n12870,\r\n48620\r\n ]\r\n\r\nprint(ary[n])", "#!/usr/bin/env/python\r\n# -*- coding: utf-8 -*-\r\nn = int(input())\r\ng = [1] * n\r\nfor i in range(n - 1):\r\n for j in range(1, n):\r\n g[j] = g[j - 1] + g[j]\r\n # print(g)\r\nprint(g[-1])", "n=input()\nn=int(n)\nlist=[]\ntemp=[]\n\nfor i in range(0,n,1):\n temp.append(1)\n\nlist.append(temp)\nfor i in range(1,n,1):\n line=[1]\n for j in range(1,n,1):\n line.append(line[j-1]+list[i-1][j])\n\n list.append(line)\n\nprint(list[n-1][n-1])\n\t\t \t\t \t \t\t\t \t \t \t\t\t \t\t \t \t", "def cal(col, row):\r\n if col == 1 or row == 1:\r\n return 1\r\n return cal(col-1, row)+cal(col, row-1)\r\n\r\n\r\nx = int(input())\r\nprint(cal(x, x))\r\n", "N=int(input())\nT=[[1]*N for _ in range(N)]\nfor i in range(1, N) :\n for j in range(1, N) :\n T[i][j] = T[i-1][j] + T[i][j-1]\nprint(T[N-1][N-1])\n", "n = int(input())\nmas = [1] * n\nmas1 = [1] + [0] * (n - 1)\nfor _ in range(n - 1):\n for i in range(1, n):\n mas1[i] = mas1[i - 1] + mas[i]\n mas = mas1\n mas1 = [1] + [0] * (n - 1)\nprint(mas[-1])\n", "n = int(input())\r\nres = []\r\narr = [1 for i in range(n)]\r\narr1 = [1]\r\nres.append(arr)\r\nk = 0\r\nfor i in range(n-1):\r\n for i in range(1,n):\r\n arr1.append(res[k][i]+arr1[i-1])\r\n res.append(arr1)\r\n arr1 = [1]\r\n k+=1\r\nprint(max(max(res)))\r\n\r\n", "n=int(input())\nt=[[1 for j in range(n)]for i in range(n)]\nfor i in range(1,n):\n for j in range(1,n):\n t[i][j]=t[i-1][j]+t[i][j-1]\nprint(t[n-1][n-1])", "n = int(input())\r\n\r\n\r\ndef factorial(number):\r\n \r\n res = 1\r\n for i in range(1 , number + 1):\r\n res *= i\r\n return res\r\n\r\n\r\n\r\n\r\n\r\nprint(factorial(2*n-2) // (factorial(n-1) * factorial(n-1)))\r\n\r\n\r\n", "p=[1,2,6,20,70,252,924,3432,12870,48620]\r\nk=int(input())\r\nprint(p[k-1])\r\n", "n = int(input())\r\nA = [0]*n\r\nfor i in range(n):\r\n A[i] = [0]*n\r\n\r\nfor i in range(n):\r\n A[0][i] = 1\r\n A[i][0] = 1\r\n\r\n\r\nfor i in range(1, n):\r\n for j in range(1,n):\r\n A[i][j] = A[i-1][j] + A[i][j-1]\r\n\r\n\r\nprint(A[n-1][n-1])\r\n\r\n \r\n", "n = int(input())\r\ntable = []\r\nfor i in range(n):\r\n row = []\r\n for j in range(n):\r\n row.append(1)\r\n table.append(row)\r\n\r\nfor i in range(1, n):\r\n for j in range(1, n):\r\n table[i][j] = table[i-1][j]+table[i][j-1]\r\nprint(table[n-1][n-1])\r\n", "import math\r\n\r\nn = int(input())\r\n\r\nans = math.factorial(2*n-2)//(math.factorial(n-1)*math.factorial(n-1))\r\nprint(ans)", "n=int(input())\r\nlist1=[]\r\nfor j in range(n):\r\n list1.append(1)\r\nsum1,count=0,0\r\nfor j in range(n*(n-1)):\r\n if j!=0 and not count%n:\r\n sum1=0\r\n sum1+=list1[count]\r\n list1.append(sum1)\r\n count+=1\r\nprint(list1[-1])\r\n \r\n \r\n \r\n ", "# Bismillah\r\n# In the name of GOD\r\n\r\ndef table(r, c):\r\n\tif r == 1 or c == 1:\r\n\t\treturn 1\r\n\treturn table(r - 1, c) + table(r, c - 1)\r\n\r\nn = int(input())\r\nprint(table(n, n))\r\n", "n = int(input())\r\nx= [[1 for i in range(n)] for j in range(n)]\r\n\r\n\r\nfor i in range(1, n):\r\n for j in range(1, n):\r\n x[i][j] = x[i-1][j]+x[i][j-1]\r\nprint(x[n-1][n-1]) ", "n = int(input())\na = [[1 for col in range(n)] for row in range(n)]\nfor i in range(1, n):\n for j in range(1, n):\n a[i][j] = a[i - 1][j] + a[i][j - 1]\nprint(a[n - 1][n - 1])\n", "a=int(input())\r\npole=[list([1]*a)]\r\nfor x in range(a-1):\r\n d=[1]\r\n for y in range(a-1):\r\n d.append(d[y]+pole[x][y+1])\r\n pole.append(d)\r\n\r\nprint(pole[a-1][a-1])\r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Fri Mar 26 12:56:42 2021\r\n\r\n@author: nagan\r\n\"\"\"\r\n\r\nn = int(input())\r\nl = []\r\nfor i in range(n):\r\n c = []\r\n if i == 0:\r\n for j in range(n):\r\n c.append(1)\r\n l.append(c)\r\n else:\r\n d = 0\r\n r = 0\r\n for j in range(n):\r\n d = l[i - 1][j] + r\r\n c.append(d)\r\n r = d\r\n l.append(c)\r\nprint(l[n - 1][n - 1])", "n = int(input())\r\ndef factorial(x):\r\n if x == 0:\r\n return 1\r\n return factorial(x-1)*x\r\na = factorial(n-1)\r\nprint(factorial(2*n-2)//(a**2))\r\n", "if __name__ == '__main__':\r\n n = int(input())\r\n res = []\r\n first = [1] * n\r\n res.append(first)\r\n for N in range(n-1):\r\n res.append([1])\r\n\r\n i = 0\r\n for j in range(1, n):\r\n while len(res[j]) != n:\r\n number = res[j-1][i+1] + res[j][i]\r\n res[j].append(number)\r\n i += 1\r\n i = 0\r\n \r\n result = [x for y in res for x in y]\r\n print(max(result))", "def jiecheng(n):\r\n if n==0:\r\n return 1\r\n a=1\r\n for i in range(1,n+1):\r\n a=a*i\r\n return a\r\n\r\ndef zuhe(n,m):\r\n return jiecheng(n)/(jiecheng(m)*jiecheng(n-m))\r\na=input()\r\na=int(a)\r\nprint(int(zuhe(2*a-2,a-1)))", "#!/usr/bin/env python3\r\nn = int(input())\r\ntable = [[0 for x in range(n)] for y in range(n)]\r\n\r\nfor i in range(n):\r\n for j in range(n):\r\n if i==0 or j==0:\r\n table[i][j] = 1\r\n else:\r\n table[i][j] = table[i][j-1] + table[i-1][j]\r\nprint(table[n-1][n-1])\r\n", "\r\ndef solve():\r\n n = int(input())\r\n if n == 1:\r\n return 1\r\n l = [[1]*n]\r\n for i in range(n-1):\r\n t = [1]+[0]*(n-1)\r\n l+=[t]\r\n for i in range(1,n):\r\n for j in range(1,n):\r\n l[i][j] = l[i-1][j] + l[i][j-1]\r\n return l[i][j]\r\nprint(solve())", "n = int(input())\r\nden = 1\r\nnum = 1\r\nfor i in range(n-1) :\r\n den*=n+i\r\n num*=1+i\r\nprint(den//num)", "n = int(input())\r\nif n == 1:\r\n print(1)\r\nelse:\r\n top = []\r\n for i in range(n):\r\n top.append(1)\r\n current = [1]\r\n \r\n for j in range(n-1):\r\n for i in range(1, n):\r\n current.append(top[i] + current[i-1])\r\n top = current\r\n current = [1]\r\n print(top[n-1])\r\n\r\n", "n = int(input())\r\n\r\narr = []*n\r\ncount = 0\r\nwhile True:\r\n arr.append([1]*n)\r\n count +=1\r\n if count == n:\r\n break \r\n\r\ni = 1\r\nwhile i < n:\r\n j = 1\r\n while j < n:\r\n arr[i][j] = sum(arr[i-1][:j+1])\r\n j+=1\r\n i+=1\r\n\r\nprint(max(max(arr)))", "from math import *\r\n\r\ndef str_input():\r\n return input()\r\n\r\ndef int_input():\r\n return int(input())\r\n\r\ndef oneLine_int_list_input():\r\n return list(map(int, input().split(' ')))\r\n\r\ndef oneLine_str_list_input():\r\n return input().split(' ')\r\n\r\ndef multiLine_str_list_input(list_len):\r\n return [input() for _ in range(list_len)]\r\n\r\ndef multiLine_int_list_input(list_len):\r\n return [int(input()) for _ in range(list_len)]\r\n\r\ndef is_prime(x):\r\n for y in range(2, x //2 + 1):\r\n if x % y == 0:\r\n return False\r\n return True\r\n\r\ndef divisors(n):\r\n divisors = {}\r\n for i in range(1, int(sqrt(n))+1):\r\n if n % i == 0:\r\n divisors.add(i)\r\n divisors.add(n // i)\r\n return [*divisors] \r\n\r\n#t = int_input()\r\ndef solve():\r\n n = int_input()\r\n matrix = [[]]\r\n for i in range(n):\r\n matrix[0].append(1)\r\n for j in range(n - 1):\r\n matrix.append([])\r\n matrix[j + 1].append(1)\r\n for k in range(n - 1):\r\n matrix[j + 1].append(matrix[j][k + 1] + matrix[j + 1][k])\r\n return matrix[n - 1][n - 1]\r\nprint(solve())\r\n\r\n#for _ in range(t):\r\n #\r\n\r\n", "n=int(input())\r\nz=[int(1) for i in range(n)]\r\nfor i in range(1,n):\r\n for j in range(1,len(z)):\r\n z[j]=z[j]+sum(z[j-1:j])\r\nprint(max(z))", "size_of_table = int(input())\r\nmat = [[1 for x in range(size_of_table)] for y in range(size_of_table)]\r\nfor i in range(1, size_of_table):\r\n for j in range(1, size_of_table):\r\n mat[i][j] = mat[i - 1][j] + mat[i][j - 1]\r\nprint(mat[size_of_table - 1][size_of_table - 1])\r\n", "n = int(input())\r\np = []\r\nfor i in range(1,n+1):\r\n p.append([1])\r\n if i>1:\r\n p[0].append(1)\r\n for y in range(1, i):\r\n if y!=i-1:\r\n p[y].append(p[y - 1][i-1] + p[y][i-2])\r\n else:\r\n for x in range(1,i):\r\n p[y].append(p[y-1][x]+p[y][x-1])\r\nprint(p[n-1][n-1])", "# Happy_water\r\ndef main():\r\n n = int(input())\r\n g = [[1 for i in range(n)]] + [[0 for i in range(n)] for i in range(n - 1)]\r\n for i in range(1, n):\r\n g[i][0] = g[i - 1][0]\r\n for j in range(n):\r\n g[i][j] = g[i - 1][j] + g[i][j - 1]\r\n print(g[n - 1][n - 1])\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "n = int(input())\r\na = [[0 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 if i == 0 or j == 0:\r\n a[i][j] = 1\r\nfor i in range(1, n):\r\n for j in range(1, n):\r\n a[i][j] = a[i - 1][j] + a[i][j - 1]\r\nprint(a[-1][-1])\r\n", "def a(i,j):\r\n if i==1 or j==1:\r\n return 1\r\n else:\r\n return a(i-1,j) +a(i,j-1)\r\n\r\nt=int(input())\r\nprint(a(t,t))", "#Techcoder\r\nimport sys\r\nimport os.path\r\nimport math\r\nimport copy\r\nfrom sys import stdin,stdout\r\nfrom collections import*\r\nfrom math import gcd,ceil,floor\r\nmod = int(1e9+7)\r\nm1=float(\"inf\")\r\n##sys.setrecursionlimit(10**8)\r\n#input=sys.stdin.readline\r\n\r\nif os.path.exists('Updated prg/Input3d.txt'):\r\n sys.stdout=open(\"Updated prg/Output3d.txt\",\"w\")\r\n sys.stdin=open(\"Updated prg/Input3d.txt\",\"r\")\r\n \r\ndef sinp():return input()\r\ndef ninp():return int(sinp())\r\ndef mapinp():return map(int,sinp().split())\r\ndef smapinp():return map(str,sinp().split())\r\ndef linp():return list(mapinp())\r\ndef sl():return list(sinp().split())\r\ndef prnt(a):print(a)\r\ndef prntl(a):print(a,end=\" \")\r\ndef prntlist(l1):print(*l1)\r\ndef power(n): return 1<<n\r\n\r\nn=ninp()\r\nif n==1:\r\n prnt(1)\r\nelse:\r\n dp=[[0]*(n+1)]*(n+1)\r\n maxi=float(\"-inf\")\r\n for i in range(1,n+1):\r\n for j in range(1,n+1):\r\n if i==1 or j==1:\r\n dp[i][j]=1\r\n else:\r\n dp[i][j]=dp[i-1][j]+dp[i][j-1]\r\n #maxi=max(maxi,dp[i][j])\r\n #prnt(dp)\r\n prnt(dp[n][n])", "order = int(input()) \n\nt = [[1] * order] + [[1] + [0] * (order - 1) for _ in range(order - 1)]\n\nfor i in range(1, order):\n for j in range(1, order):\n t[i][j] = t[i - 1][j] + t[i][j - 1]\n\nmax_value = max(t[order - 1])\n\nprint(max_value)\n\n \t\t \t\t \t \t \t\t\t", "n = int(input())\r\narr = [[1 for i in range(n)] for j in range(n)]\r\nfor i in range(1, n):\r\n for j in range(1, n):\r\n arr[i][j] = arr[i-1][j] + arr[i][j-1]\r\nprint(arr[-1][-1]) \r\n \r\n \r\n", "n = int(input())\r\nmat = []\r\nans = 1\r\nfor i in range(n):\r\n tmp = []\r\n if i==0:\r\n for j in range(n):\r\n tmp.append(1)\r\n else:\r\n for j in range(n):\r\n if j==0:\r\n val = mat[i-1][j]\r\n else:\r\n val = mat[i-1][j] + tmp[j-1]\r\n ans = max(ans,val)\r\n tmp.append(val)\r\n mat.append(tmp)\r\nprint(ans)\r\n", "def e(r,c):\r\n if r==1 or c==1:\r\n return 1\r\n return e(r-1,c)+e(r,c-1)\r\nn=int(input())\r\nk=e(n,n)\r\nprint(k)\r\n", "num = int(input())\r\narr = []\r\nif num == 1:\r\n\tprint(1)\r\nelse:\r\n\ttempt = []\r\n\tfor i in range(num):\r\n\t\ttempt.append(1)\r\n\tarr.append(tempt)\r\n\t\r\n\tfor i in range(1, num):\r\n\t\tarr.append([1])\r\n\t\t\r\n\tfor i in range(1, num):\r\n\t\tfor j in range(1, num):\r\n\t\t\tarr[i].append(arr[i][j-1] + arr[i-1][j])\r\n\tprint(arr[num-1][num-1])", "if __name__ == \"__main__\":\r\n hashmap = {}\r\n n = int(input())\r\n if n==1:\r\n print(1)\r\n else: \r\n matrix = [[0 for i in range(n)] for j in range(n)]\r\n for i in range(n):\r\n for j in range(n):\r\n if i==0 or j==0:\r\n matrix[i][j] = 1\r\n for i in range(1,n):\r\n for j in range(1,n):\r\n if (i,j) not in hashmap:\r\n matrix[i][j] = matrix[i][j-1] + matrix[i-1][j]\r\n hashmap[(i,j)] = matrix[i][j]\r\n hashmap[(j,i)] = hashmap[(i,j)]\r\n else:\r\n matrix[i][j] = hashmap[(i,j)]\r\n print(matrix[n-1][n-1]) ", "n=int(input())\r\nfoo=0\r\nddarr = [[foo for i in range(n)] for j in range(n)]\r\nfor i in range(n):\r\n ddarr[0][i]=ddarr[i][0]=1\r\nfor i in range(1,n):\r\n for j in range(1,n):\r\n ddarr[i][j]=ddarr[i-1][j]+ddarr[i][j-1]\r\nprint(ddarr[n-1][n-1])", "n = int(input())\r\na = []\r\nb = []\r\na.append(list('1'*n))\r\nfor i in range(n-1):\r\n b = ['1']\r\n for i in range(n-1):\r\n b.append(int(b[-1])+int(a[-1][i+1]))\r\n a.append(b)\r\nprint(int(a[n-1][n-1]))", "t = int(input())\r\nl = [[1]*t]\r\n\r\nfor j in range(1, t):\r\n\tp = [1]\r\n\tfor i in range(1, t):\r\n\t\tp.append(p[i-1]+l[j-1][i])\r\n\tl.append(p)\r\nprint(l[t-1][t-1])", "n = int(input())\na = [0] * n\na[0] = 1\nfor _ in range(n):\n for i in range(1, n):\n a[i] += a[i - 1]\nprint(a[-1])\n", "def maxTable(n):\r\n table = [0, 1, 2, 6, 20, 70, 252, 924, 3432, 12870, 48620, 184756, 705432]\r\n return table[n]\r\n\r\nif __name__ == \"__main__\":\r\n n = int(input())\r\n print(maxTable(n))", "n = int(input())\r\nboard = []\r\nmaxnum = 1\r\nfor i in range(0,n):\r\n temp = [0]*n\r\n if i == 0:\r\n temp = [1]*n\r\n else:\r\n for j in range(n):\r\n if j == 0:\r\n temp[0] = 1\r\n else:\r\n temp[j] = temp[j-1] + board[i-1][j]\r\n board.append(temp)\r\nfor i in range(n):\r\n for j in range(n):\r\n if maxnum < board[i][j]:\r\n maxnum = board[i][j]\r\nprint(maxnum)", "n=int(input())\r\na=[1 for i in range(n+1)]\r\nfor i in range(2,n+1):\r\n for j in range(2,n+1):\r\n a[j]+=+a[j-1]\r\nprint(a[n])\r\n\r\n", "'''\n\nWelcome to GDB Online.\nGDB online is an online compiler and debugger tool for C, C++, Python, Java, PHP, Ruby, Perl,\nC#, VB, Swift, Pascal, Fortran, Haskell, Objective-C, Assembly, HTML, CSS, JS, SQLite, Prolog.\nCode, Compile, Run and Debug online from anywhere in world.\n\n'''\nn=int(input())\na=[[1]*n for i in range(n)]\nfor i in range(1,n):\n for j in range(1,n):\n a[i][j]=a[i-1][j]+a[i][j-1]\nprint(a[n-1][n-1]) \n\n", "n=int(input())\r\nx=[[]]*n\r\nm=[]\r\nfor i in range (n):\r\n if i==0:\r\n x[i]=[1]*n\r\n else:\r\n for j in range (n):\r\n m+=[sum(x[i-1][:j+1])]\r\n x[i]=m \r\n m=[]\r\nprint(x[n-1][n-1]) ", "n = int(input())\narr = []\nfor i in range(n):\n x = []\n for j in range(n):\n if i==0 or j==0:\n x.append(1)\n else:\n x.append(arr[i-1][j] + x[j-1])\n\n arr.append(x)\nprint(arr[n-1][n-1])\n\t \t\t \t\t \t \t \t \t\t \t \t \t", "def maximum_number(n):\r\n dp = [[0] * (n + 1) for _ in range(n + 1)]\r\n \r\n for i in range(1, n + 1):\r\n dp[1][i] = dp[i][1] = 1\r\n \r\n for i in range(2, n + 1):\r\n for j in range(2, n + 1):\r\n dp[i][j] = dp[i - 1][j] + dp[i][j - 1]\r\n \r\n return dp[n][n]\r\n\r\nn = int(input())\r\nresult = maximum_number(n)\r\nprint(result)", "# https://codeforces.com/problemset/problem/509/A\r\n\r\nn = int(input())\r\narr = [1]*n\r\n\r\nfor _ in range(n-1):\r\n for i in range(1,n):\r\n arr[i] += arr[i-1]\r\n\r\nprint(arr[-1])", "n = int(input())\r\nclass PArrY:\r\n def __init__(self, n):\r\n self.n = n\r\n self.arr = PArrY.init(n)\r\n def __repr__(self):\r\n return ' '.join([str(i)+'\\n' for i in ['['] + self.arr]) + ']'\r\n @staticmethod\r\n def init(n):\r\n arr = []\r\n for i in range(n):\r\n arr.append([PArrY.get(i+1, j+1) for j in range(n)])\r\n return arr\r\n @staticmethod\r\n def get(x, y):\r\n if x == 1 or y == 1:\r\n return 1\r\n return PArrY.get(x - 1, y) + PArrY.get(x, y - 1)\r\n @property\r\n def max(self):\r\n return self.arr[-1][-1]\r\na = PArrY(n)\r\nprint(a.max)", "n = int(input())\nans = [[x for x in range(n)] for y in range(n)]\n\nfor row in range(n):\n for col in range(n): \n if row == 0:\n ans[row][col] = 1\n elif col == 0:\n ans[row][col] = 1\n else:\n ans[row][col] = ans[row-1][col] + ans[row][col-1]\n\nprint(ans[-1][-1])\n\n", "def c(n, k):\n\tres = 1\n\tfor i in range(n - k + 1, n + 1):\n\t\tres *= i\n\tfor i in range(1, k + 1):\n\t\tres //= i\n\treturn res\n\nn = int(input())\nprint(c(2 * (n - 1), n - 1))\n", "# from sys import stdin, stdout\r\n\r\n# import re\r\n# import string\r\n\r\n# import math\r\n# import statistics\r\n# import itertools\r\n# import collections\r\n# import cmath\r\n# import calendar\r\n# import datetime\r\n\r\n# import operator\r\n\r\n#----------Profiling----------\r\n# import cProfile\r\n# import pstats\r\n\r\nn = int(input()) - 1\r\nu = 1\r\nd = 1\r\nfor i in range(n+1, (2 * n) + 1):\r\n u *= i\r\nfor i in range(2, n + 1):\r\n d *= i\r\nprint(u//d)\r\n", "\ndef main():\n n = int(input())\n arr = [[0]*n]*n\n for i in range(n):\n for j in range(n):\n if i == 0 or j == 0:\n arr[i][j] = 1\n else:\n arr[i][j] = arr[i-1][j]+arr[i][j-1]\n print(arr[-1][-1])\n\n\nif __name__ == '__main__':\n main()\n\n\n# ------------- ignore ---------\n'''\n1 1\n1 2 2=1\n\n1 1 1 \n1 2 3 \n1 3 6 3 = 6\n\n1 1 1 1 \n1 2 3 4 \n1 3 6 10\n1 4 10 20 4 = 20 \n\n1 1 1 1 1\n1 2 3 4 5\n1 3 6 10 15\n1 4 10 20 35\n1 5 15 35 70 5 =70\n\n\n1 1 1 1 1 1\n1 2 3 4 5 6\n1 3 6 10 15 21\n1 4 10 20 35 36\n1 5 15 35 70 106 \n1 6 21 36 106 212 6 = 212\n'''\n", "n = int(input())\narr = []\nfor i in range(n):\n a = []\n if i == 0:\n for j in range(n):\n a.append(1)\n else:\n a.append(1)\n for j in range(1,n):\n a.append(a[j-1]+arr[i-1][j])\n arr.append(a)\n\nprint(arr[n-1][n-1])\n \t \t\t\t \t\t\t \t \t\t\t \t\t\t\t \t \t\t \t", "n = int(input());\r\na = [[1 for _ in range(n)] for __ in range(n)];\r\nfor i in range(1, n):\r\n for j in range(1, n):\r\n a[i][j] = a[i - 1][j] + a[i][j - 1];\r\nprint(a[n - 1][n - 1]);", "n=int(input())\narr=[[0]*n]*n\narr[0]=[1]*n\nfor i in range(n): # 0 1 2\n arr[i][0]=1\n\nfor row in range(1,n):\n for column in range(1,n):\n arr[row][column]=arr[row-1][column]+arr[row][column-1]\nprint(arr[n-1][n-1])\n \t \t\t \t\t \t \t\t\t\t\t\t \t\t \t \t\t\t", "n = int(input())\n\ndp = [[1 for _ in range(n)] for _ in range(n)]\n\nfor i in range(1, n):\n for j in range(1, n):\n dp[i][j] = dp[i-1][j] + dp[i][j-1]\n\nprint(dp[n-1][n-1])\n", "def factorial(n):\r\n result = 1\r\n for i in range(1, n + 1):\r\n result = i * result\r\n return result\r\n\r\ndef ncr(n, r):\r\n return factorial(n) // factorial(r) // factorial(n -r)\r\n\r\nn = int(input())\r\n\r\nprint(ncr(2 * n - 2, n - 1))", "n = int(input())\r\nmain_list = []\r\n\r\nmain_list.append([])\r\n\r\nfor j in range(n):\r\n main_list[0].append(1)\r\n\r\nfirst_list = [1]\r\n\r\nfor k in range(0, n-1):\r\n first_list.append(0)\r\n\r\nfor i in range(0, n-1):\r\n main_list.append(first_list)\r\n\r\n\r\ndef element(a, b, l):\r\n # l[a][b] = l[a][b-1] + l[a-1][b]\r\n\r\n if a == 1:\r\n return 1\r\n elif b == 1:\r\n return 1\r\n\r\n else:\r\n return element(a, b-1, l) + element(a-1, b, l)\r\n\r\ni = 1\r\nj = 1\r\nfor i in range(1, n):\r\n for j in range(1, n):\r\n main_list[i][j] = element(i+1, j+1, main_list)\r\n\r\nprint(max(main_list[n-1]))\r\n\r\n\r\n", "n = int(input())\r\n\r\na = [[1] * n] * n\r\nmx = 1\r\nfor i in range(1, n):\r\n for j in range(1, n):\r\n a[i][j] = a[i - 1][j] + a[i][j - 1]\r\n mx = max(mx, a[i][j])\r\nprint(mx)", "n = int(input())\r\na = [[1,1,1,1,1,1,1,1,1,1],[1,0,0,0,0,0,0,0,0,0],\r\n [1,0,0,0,0,0,0,0,0,0],[1,0,0,0,0,0,0,0,0,0],\r\n [1,0,0,0,0,0,0,0,0,0],[1,0,0,0,0,0,0,0,0,0],\r\n [1,0,0,0,0,0,0,0,0,0],[1,0,0,0,0,0,0,0,0,0],\r\n [1,0,0,0,0,0,0,0,0,0],[1,0,0,0,0,0,0,0,0,0]]\r\nfor i in range(1,n):\r\n for j in range(1,n):\r\n a[i][j] = a[i-1][j] + a[i][j-1]\r\n \r\nprint(a[n-1][n-1])\r\n", "def main():\r\n n = int(input())\r\n dp=[[1 for _ in range(n)] for _ in range(n)]\r\n for i in range(1,n):\r\n for j in range(1,n):\r\n dp[i][j] = dp[i-1][j] + dp[i][j-1]\r\n print(dp[n-1][n-1])\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n = int(input())\r\ndp = []\r\nfor i in range(n):\r\n dp.append([0] * n)\r\nfor i in range(n):\r\n for j in range(n):\r\n dp[0][j] = 1\r\n dp[i][0] = 1\r\nfor i in range(1, n):\r\n for j in range(1, n):\r\n dp[i][j] = dp[i - 1][j] + dp[i][j - 1]\r\nprint(dp[n - 1][n - 1])", "from pprint import pprint\r\n\r\nn = int(input())\r\nmatrix = [[1]*n]\r\n\r\nfor i in range(1, n):\r\n l = []\r\n for j in range(n):\r\n l.append(matrix[i-1][j] + l[-1] if len(l) > 0 else matrix[i-1][j] + 0)\r\n matrix.append(l)\r\n\r\nprint(matrix[-1][-1])", "a = input()\r\ndic = {'1':1,'2':2,'3':6,'4':20,'5':70,'6':252,'7':924,'8':3432,'9':12870,'10':48620}\r\nprint(dic[a])", "n=int(input())\r\nl=[]\r\nl2=[]\r\nif n==1:\r\n print(1)\r\n exit()\r\nfor i in range(1,n):\r\n for j in range(1,n+1):\r\n if i==1:\r\n l.append(1)\r\n for h in range(1,n+1):\r\n if h==1 :\r\n l2.append(1)\r\n else:\r\n x=l[h-1]+l2[h-2]\r\n l2.append(x) \r\n l=l2\r\n l2=[]\r\nprint(max(l))", "n = int(input())\r\narr = [[0 for i in range(n)]for j in range (n)]\r\ncek = 0\r\nfor i in range(n):\r\n for j in range(n):\r\n if(i==0):\r\n arr[i][j]=1\r\n else:\r\n cek = 0\r\n for k in range(j+1):\r\n cek+= arr[i-1][k]\r\n arr[i][j] = cek\r\nprint(arr[n-1][n-1])", "a = int(input())\r\nresult = []\r\nmaximum = 0\r\nfor i in range(a):\r\n result.append([1] * a)\r\nfor i in range(1, a):\r\n for j in range(1, a):\r\n result[i][j] = result[i - 1][j] + result[i][j - 1]\r\nfor i in result:\r\n maximum = max(max(i), maximum)\r\nprint(maximum)", " ####\r\n ####\r\n ####\r\n ####\r\n\r\n #### #### ####\r\n #### #### #### \r\n #### #### ####\r\n #### #### #### \r\n \r\n #### #### #### \r\n \r\n #### #### #### \r\n \r\n #### #### #### \r\n ####################################### \r\n #######################################\r\n\r\n\r\n\r\n\r\n \r\n ####################///# #///# #///# #///#\r\n ####################///# #///# #///# #///#\r\n #### #///# #///# #///# #///#\r\n #### #///# #///# #///# #///#\r\n #### #///# #///# #///# #///#\r\n #### #///# #///# #///# #///#\r\n #### #///# #///# #///# #///#\r\n #### #///# #///# #///# #///#\r\n #### #///# #///# #///# #///#\r\n #### #///# #///# #///# #///#\r\n #### #///# #///# #///# #///#\r\n #### #///# #///# #///# #///#\r\n #### #///# #///# #///# #///#\r\n ####################///# #///# #///# #///#\r\n ####################///# #///# #///# #///#\r\n #///# #///# #///# #///#\r\n #///# #///# #///# #///#\r\n #///# #///# #///# #///#\r\n #///# #///# #///# #///#\r\n #///# #///# #///# #///# \r\n #///# #///# #///# #///#\r\n #///# #///# #///# #///#\r\n #///# #///# #///# #///#\r\n #///# #///# #///# #///#\r\n #///# #///# #///# #///#\r\n #///# #///# #///# #///#\r\n ####################################################################### #///#\r\n ####################################################################### #///#\r\n \r\n\r\n \r\n\r\n\r\n\r\nimport math\r\nn = int(input())\r\ndif = ((2*n)-2)\r\nc = (n-1)\r\nnomi = (math.factorial(dif))\r\ndenomi = ((math.factorial(c))*math.factorial(dif-c))\r\nprint(nomi//denomi)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "n=int(input())\nmops=[1]*n\nfor i in range(n):\n mops[i]=[1]*n\nfor i in range(1, n):\n for j in range(1, n):\n mops[i][j]=mops[i-1][j]+mops[i][j-1]\nprint(mops[n-1][n-1])\n# Mon Jul 03 2023 15:23:29 GMT+0300 (Moscow Standard Time)\n", "num = int(input())\r\ninitlist = [[1]*num]\r\n\r\nfor i in range(1,num):\r\n subl = []\r\n for j in range(num):\r\n if j==0:\r\n subl+=[1]\r\n else:\r\n calc = initlist[-1][j]+subl[-1]\r\n subl+=[calc]\r\n initlist+=[subl]\r\n\r\nprint(initlist[-1][-1])", "def maximum_in_table():\r\n a=int(input())\r\n mt=[[0 for i in range(a)]for j in range(a)]\r\n for i in range(a):\r\n for j in range(a):\r\n if i==0:\r\n mt[i][j]=1\r\n elif j==0:\r\n mt[i][j]=1\r\n else:\r\n mt[i][j]=mt[i-1][j]+mt[i][j-1]\r\n print(mt[-1][-1])\r\nmaximum_in_table()", "n = int(input())\r\nprev = [1] * n\r\nfor _ in range(n-1):\r\n curr = [1] * n\r\n for i in range(1, n):\r\n curr[i] = prev[i] + curr[i-1]\r\n prev = curr[:]\r\nprint(prev[n-1])", "######A. Maximum in Table######\r\nn = int(input())\r\nrow1 = [1]*n\r\nrow2 = [1]*n\r\nfor _ in range(n-1):\r\n for i in range(1, n):\r\n row2[i] = row1[i] + row2[i-1]\r\n row1 = row2.copy()\r\nprint(row2[-1])\r\n\r\n", "n = int(input())\r\nF_1 = 1\r\nfor i in range(n, 2*(n-1) + 1):\r\n F_1 = F_1*i\r\nF_2 = 1\r\nfor j in range(1,n):\r\n F_2 = F_2 * j\r\nm = 0\r\nm = int(F_1 / F_2)\r\nprint(m)", "n = int(input())\r\nl = [[0 for x in range(n)] for y in range(n)]\r\nfor i in range(0,n):\r\n for j in range(0,n):\r\n if j == 0:l[i][0] = 1\r\n elif i == 0:l[0][j] = 1\r\n else:l[i][j] = l[i-1][j] + l[i][j-1]\r\nprint(l[n-1][n-1])", "\r\nt=int(input())\r\nm=[[0 for j in range(t)]for i in range(t)]\r\nfor i in range(t):\r\n m[0][i]=1\r\n m[i][0]=1\r\n \r\nfor i in range(1,t):\r\n for j in range(1,t):\r\n m[i][j]=m[i-1][j]+m[i][j-1]\r\n\r\nprint(m[t-1][t-1])\r\n", "def solve(size):\n array = [[0 for row in range(0, size)] for col in range(0, size)]\n for i in range(size):\n for j in range(size):\n if i == 0 and j >= 0:\n array[i][j] = 1\n elif j == 0 and i >= 0:\n array[i][j] = 1\n else:\n array[i][j] = array[i - 1][j] + array[i][j - 1]\n\n return int(array[size - 1][size - 1])\n\n\nn = int(input())\nprint(solve(n))\n", "n=int(input())\r\nl=[]\r\nfor i in range(n):\r\n lr=[1]\r\n for j in range(1,n):\r\n if i==0:\r\n lr.append(1)\r\n else:\r\n a=l[i-1][j]+lr[j-1]\r\n lr.append(a)\r\n l.append(lr)\r\nprint(l[n-1][n-1])", "n=int(input())\r\ndef fun(r,c):\r\n\tif r==1 or c==1:\r\n\t\treturn 1\r\n\treturn fun(r-1,c)+fun(r,c-1)\r\n\r\nprint(fun(n,n))", "n = int(input())\r\nsList = [0 for i in range((n**2)+1)]\r\nfor i in range((n**2)+1):\r\n if i < n:\r\n sList[i] = 1\r\n elif i%n == 0:\r\n sList[i] = 1\r\n else:\r\n sList[i] = sList[i-1]+sList[i-n]\r\nprint(sList[-2])", "n = int(input())\r\n\r\n# Initialize the first row and column to ones\r\ntable = [[1] * n] + [[1] + [0] * (n - 1) for _ in range(n - 1)]\r\n\r\n# Compute the values of the table row by row\r\nfor i in range(1, n):\r\n for j in range(1, n):\r\n table[i][j] = table[i - 1][j] + table[i][j - 1]\r\n\r\n# Find the maximum value in the table\r\nmax_value = max(max(row) for row in table)\r\n\r\nprint(max_value)\r\n", "from math import factorial as f\r\nn = int(input())\r\nprint(int(f(2*n-2)/f(n-1)/f(n-1)))\r\n", "#get input\r\n#n=5\r\n\r\nn=int(input())\r\ntable=[]\r\n\r\n\r\n##Making the appropriate table\r\n\r\n\r\n#make nxn table following the given rule\r\nfor i in range(n):\r\n table.append([])\r\n\r\n#appending 1s in the first row\r\nfor i in range(n): \r\n table[0].append(1)\r\n \r\n#appending 1s at first column of each row except the first row\r\nfor y in range(1,n):\r\n table[y].append(1)\r\n\r\n#filling remaining number position with zeros so it can be filled later with appropriate values\r\nfor i in range(1,n):\r\n for y in range(n-1):\r\n table[i].append(0)\r\n\r\n\r\n#creating the remaining numbers\r\nfor row in range(1,n):\r\n \r\n for col in range(1,n):\r\n \r\n table[row][col]=table[row][col-1]+table[row-1][col]\r\n\r\n###########################################################################\r\n \r\n\r\n#Find the maximum value in the entire n*n table\r\nmaximum=table[0][0]\r\n\r\nfor row in table:\r\n for col in row:\r\n if(col>maximum):\r\n maximum=col\r\n \r\n\r\nprint(maximum)\r\n\r\n\r\n\r\n\r\n", "import math\r\n\r\nn = int(input())\r\n\r\nprint(math.factorial(2*n-2)//(math.factorial(n-1)**2))", "f = int(input())\r\nif f == 1:\r\n print(1)\r\nelif f ==70:\r\n print(70)\r\nelif f == 5:\r\n print(70)\r\nelif f == 2:\r\n print(2)\r\nelif f == 3:\r\n print(6)\r\nelif f == 4:\r\n print(20)\r\nelif f == 6:\r\n print(252)\r\nelif f == 7:\r\n print(924)\r\nelif f == 9:\r\n print(12870)\r\nelif f == 10:\r\n print(48620)\r\nelif f == 8:\r\n print(3432)", "def fac(n):\r\n return 1 if n <= 1 else fac(n-1)*n\r\n \r\nn = int(input()) - 1\r\nlol = fac(n)\r\nlol *= lol\r\nprint(fac(2*n)//lol)", "n = int(input()) \r\nmt = []\r\nfor i in range(n):\r\n qux = []\r\n for j in range(n):\r\n qux.append(0)\r\n mt.append(qux)\r\nfor i in range(n):\r\n mt[0][i] = mt[i][0] = 1\r\nfor i in range(1, n):\r\n for j in range(1, n):\r\n mt[i][j] = mt[i - 1][j] + mt[i][j - 1]\r\nquz = mt[n - 1][n - 1]\r\nprint(quz)\r\n\n# Sat Sep 23 2023 11:44:26 GMT+0300 (Moscow Standard Time)\n", "n = int(input())\r\n\r\nmat = []\r\nfor i in range(n):\r\n mate = []\r\n for j in range(n):\r\n mate.append(0)\r\n \r\n mat.append(mate)\r\n \r\nfor i in range(n):\r\n for j in range(n):\r\n mat[i][0] = 1\r\n mat[0][j] = 1\r\n \r\n if mat[i][j] == 0:\r\n mat[i][j] = mat[i-1][j] + mat[i][j-1]\r\nprint(mat[-1][-1])\r\n", "n=int(input())\r\nar=[]\r\n\r\nfor i in range(n):\r\n l=[0]*n\r\n l[0]=1\r\n ar.append(l)\r\nfor i in range(n):\r\n ar[0][i]=1\r\nfor i in range(1,n):\r\n for j in range(1,n):\r\n ar[i][j]=ar[i-1][j]+ar[i][j-1]\r\nprint(ar[n-1][n-1])\r\n", "n= int(input())\r\nl = [[1]*n]\r\nfor i in range(0,n-1):\r\n k = [0]*n\r\n k[0] = 1\r\n l.append(k)\r\nfor i in range(1,n):\r\n for j in range(1,n):\r\n l[i][j] = l[i-1][j] + l[i][j-1]\r\nprint(l[n-1][n-1])", "n = int(input())\r\nx = [[0]*n for i in range(n)]\r\nfor j in range (n):\r\n x[0][j] = 1\r\n x[j][0] = 1\r\nfor i in range(1,n):\r\n for j in range(1,n):\r\n x[i][j] = x[i][j-1]+x[i-1][j]\r\ny = max(x)\r\nprint(max(y))", "def elem(row, col):\r\n if row == 1 or col==1:\r\n return 1\r\n return elem(row-1, col) + elem(row,col-1)\r\n\r\nn = int(input())\r\n\r\nprint(elem(n,n))", "n = int(input())\r\nl = [[1,1,1,1,1,1,1,1,1,1],\r\n [1,2,3,4,5,6,7,8,9,10],\r\n [1,3,6,10,15,21,28,36,45,55],\r\n [1,4,10,20,35,56,84,120,165,220],\r\n [1,5,15,35,70,126,210,330,495,715],\r\n [1,6,21,56,126,252,462,792,1287,2002],\r\n [1,7,28,84,210,462,924,1716,3003,5005],\r\n [1,8,36,120,330,792,1716,3432,6435,11440],\r\n [1,9,45,165,495,1287,3003,6435,12870,24310],\r\n [1,10,55,220,715,2002,5005,11440,24310,48620]]\r\n\r\nprint(l[n-1][n-1])\r\n", "n=int(input())\r\nl=[1]*n\r\nk=[0]*n\r\nfor i in range(0,n-1):\r\n for j in range(1,n+1):\r\n k[j-1]=sum(l[:j])\r\n\r\n\r\n for w in range(n):\r\n l[w]=k[w]\r\nprint(max(l))\r\n\r\n", "n = int(input())\r\nres = [a for a in range(1, n + 1)]\r\nfor _ in range(n - 2):\r\n for index in range(1, n):\r\n res[index] += res[index - 1]\r\n\r\nprint(res[-1])", "n = int(input())\r\nm = [i for i in range(1, n+1)]\r\nfor k in range(n-2):\r\n for j in range(1, n):\r\n m[j] = m[j-1] + m[j]\r\nprint(m[-1])", "print([0,1,2,6,20,70,252,924,3432,12870,48620][int(input())])", "from re import L\r\nfrom unittest import mock\r\n\r\n\r\nn = int(input())\r\n\r\nmc = []\r\nfor i in range(n):\r\n ms = []\r\n for j in range(n):\r\n ms.append(0)\r\n\r\n mc.append(ms)\r\n mc[0] = [1] * n\r\n\r\n for j in range(n):\r\n if mc[i][j] == 0:\r\n mc[i][j] = mc[i-1][j] + mc[i][j-1]\r\n\r\nprint(mc[-1][-1])", "n=int(input())\r\ntriangle=[]\r\n\r\nfor i in range(n):\r\n triangle.append([1]+[0]*n)\r\n \r\n \r\nfor i in range(n):\r\n for j in range(n): #i+1\r\n triangle[0][j]=triangle[i][0]\r\n \r\n#for i in triangle:\r\n # print(i)\r\n \r\nfor i in range(1,n):\r\n for j in range(1,n): #i+1\r\n triangle[i][j]=triangle[i][j-1]+triangle[i-1][j]\r\n\r\ns_max=0\r\nfor i in range(n):\r\n for j in range(n): \r\n if triangle[i][j]>s_max:\r\n s_max=triangle[i][j]\r\nprint(s_max)\r\n", "n = int(input())\r\n\r\nm = [[1]*n for i in range(n)]\r\n\r\nfor i in range(1,n):\r\n for j in range(1,n):\r\n m[i][j] = m[i-1][j] + m[i][j-1]\r\n\r\n\r\nprint(max(m[n-1]))", "n=int(input())\r\nL=[[0 for _ in range(n)] for _ in range(n)]\r\nfor i in range(n):\r\n L[0][i]=1\r\n L[i][0]=1\r\nfor k in range(1,n):\r\n for l in range(1,n):\r\n L[k][l]=L[k-1][l]+L[k][l-1]\r\nprint(L[n-1][n-1])", "n=int(input())\r\ns = [[1]*n]*n\r\nfor i in range(1,n):\r\n for j in range(1,n):\r\n s[i][j] = s[i-1][j]+s[i][j-1]\r\nprint(s[n-1][n-1])", "n = int(input())\r\nmatrix = [[1] * n]\r\nfor i in range(n - 1):\r\n matrix.append([1] * n)\r\nfor i in range(1, n):\r\n for j in range(1, n):\r\n matrix[i][j] = matrix[i - 1][j] + matrix[i][j - 1]\r\nprint(matrix[n - 1][n - 1])\r\n", "n = int(input())\r\n\r\nl = []\r\nl1 = []\r\n\r\nfor i in range(n):\r\n l1 = l1 + [1]\r\n\r\nl.append(l1)\r\n\r\nl1 = []\r\n\r\nfor i in range(n-1):\r\n for i in range(n):\r\n l1 = l1 + [0]\r\n l.append(l1)\r\n l1 = []\r\n\r\nfor a in range(n-1):\r\n for i in range(n):\r\n l[a+1][i] = l[a][i] + l[a+1][i-1]\r\n \r\nprint(l[-1][-1])", "import sys\r\ninput = sys.stdin.readline\r\noutput = sys.stdout.write\r\n\r\n\r\ndef main():\r\n size = int(input().rstrip())\r\n a = [[[] for i in range(size)] for j in range(size)]\r\n for i in range(size):\r\n for j in range(size):\r\n if i == 0 or j == 0:\r\n a[i][j] = 1\r\n else:\r\n a[i][j] = a[i - 1][j] + a[i][j - 1]\r\n value = a[size - 1][size - 1]\r\n output(str(value))\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "n = int(input())\r\nN = [[1]*n]*n\r\nfor i in range(1,n):\r\n for j in range(1,n):\r\n N[i][j] = N[i][j - 1] + N[i - 1][j]\r\n\r\n\r\nprint(N[n - 1][n - 1])", "n = eval(input())\r\na = [[0 for i in range(n)] for i in range(n)]\r\nfor i in range(n):\r\n a[i][0] = 1\r\n a[0][i] = 1\r\nfor i in range(1,n):\r\n for j in range(1,n):\r\n a[i][j] = a[i-1][j] + a[i][j-1]\r\nprint(a[n-1][n-1])", "n = int(input())\r\nmatrix = [[0] * n for i in range(n)]\r\nfor i in range(n):\r\n for j in range(n):\r\n if i == 0 or j == 0:\r\n matrix[i][j] = 1\r\n else:\r\n matrix[i][j] = matrix[i- 1][j] + matrix[i][j - 1]\r\n\r\nprint(max(max(matrix)))\r\n", "line=int(input())\r\na = []\r\nfor row in range(line):\r\n b = []\r\n for col in range(line):\r\n k=1\r\n if row==0 or col==0:\r\n b.append(k)\r\n else:\r\n b.append(0)\r\n a.append(b)\r\n\r\n\r\n\r\n\r\n\r\nfor i in range (line):\r\n for j in range (line):\r\n if i!=0 or j!=0:\r\n a[i][j]=a[i-1][j]+a[i][j-1]\r\nprint(a[line-1][line-1])", "import math\r\nn = int(input())\r\nprint(math.comb(n*2-2,n-1))", "def main():\n n = int(input())\n print(case(n))\ndef case(n):\n m = []\n for r in range(n):\n m.append([])\n for c in range(n):\n if r == 0 or c == 0:\n m[r].append(1)\n else:\n m[r].append(m[r-1][c]+m[r][c-1])\n\n return m[n-1][n-1]\n \n\nmain()", "n=int(input())\r\n\r\ndef elem(row, col):\r\n if row == 1 or col == 1:\r\n return 1\r\n return elem(row - 1, col) + elem(row, col - 1)\r\nprint(elem(n,n))", "# https://codeforces.com/problemset/problem/509/A\n# 800\n\nn = int(input())\n\nt = []\nfor i in range(n):\n t.append([])\n for j in range(n):\n if i == 0 or j == 0:\n t[i].append(1)\n else:\n s = t[i-1][j] + t[i][j-1]\n t[i].append(s)\n\nprint(t[n-1][n-1])", "n=int(input())\r\nl=[1 for i in range(n)]\r\nfor i in range(1,n):\r\n for x in range(n):\r\n if x==0:\r\n continue\r\n else:\r\n l[x]=l[x]+l[x-1]\r\n\r\nprint(l[-1])\r\n", "def factorial(n):\r\n x = 1\r\n for i in range(1, n + 1):\r\n x *= i\r\n return x\r\nn = int(input())\r\nprint(factorial(2 * n - 2) // (factorial(n - 1)) ** 2)", "factorials = {0: 1, 1: 1}\r\ndef fact(n):\r\n if n in factorials:\r\n return factorials[n]\r\n else:\r\n val = n * fact(n - 1)\r\n factorials[n] = val\r\n return val\r\n\r\n\r\ndef choose(x, y):\r\n return fact(x) // (fact(y) * fact(x - y))\r\n\r\n\r\ndef solution(n):\r\n return choose(2 * n - 2, n - 1)\r\n\r\n\r\nn = int(input())\r\nprint(solution(n))", "from math import factorial as f\r\ni = int(input())\r\nprint(int(f(2*(i-1))/f(i-1)**2))", "n=int(input())\r\nl=[]\r\nl.append([1]*n)\r\nfor i in range(1,n):\r\n l.append([1])\r\nfor i in range(1,n):\r\n for j in range(1,n):\r\n l[i].append(l[i-1][j]+l[i][j-1])\r\nd=max(l)\r\nprint(max(d))\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "n = int(input())\r\n\r\nlist = [[0 for j in range(n)] for i in range (n)]\r\n\r\nfor i in range(n):\r\n list[i][0] = 1\r\n list[0][i] = 1\r\n\r\nfor i in range(1,n):\r\n for j in range(1,n):\r\n list[i][j]=list[i-1][j] + list[i][j-1]\r\nprint(list[n-1][n-1])", "n=int(input())\r\ntable=[[1]*n]*n\r\nfor i in range(1,n):\r\n for j in range(1,n):\r\n table[i][j]=table[i-1][j]+table[i][j-1]\r\nprint(table[n-1][n-1])\r\n\r\n", "m = 0\r\nn = int(input())\r\na = [[1 for i in range(n)] for j in range(n)]\r\nfor i in range(n):\r\n for j in range(n):\r\n if i == 0 or j == 0:\r\n a[i][j] == 1\r\n else:\r\n a[i][j] = a[i - 1][j] + a[i][j - 1]\r\n m = max(m, a[i][j])\r\nprint(m)", "n=int(input())\na=[1]*n\nfor i in range(n-1):\n b=[1]\n for i in range(n-1):\n b.append(b[-1]+a[i+1])\n a=b.copy()\nprint(a[-1])", "a = int(input())\r\nb = []\r\nb.append([1]*a)\r\n\r\nfor i in range(a-1):\r\n c = [1]\r\n for j in range(1, a):\r\n c.append(c[-1]+b[-1][j])\r\n b.append(c)\r\n \r\nprint(b[-1][-1])\r\n", "import math\r\nimport operator\r\n\r\nn = int(input())\r\n\r\nli = [[0]*n]*n\r\n\r\nfor i in range(n):\r\n for j in range(n):\r\n if i == 0:\r\n li[i][j] = 1\r\n elif j == 0:\r\n li[i][j] = 1\r\n else:\r\n li[i][j] = li[i-1][j] + li[i][j-1]\r\n\r\nprint(li[n-1][n-1])", "table = [1]*int(input())\r\ntable2 = []\r\nfor _ in range(len(table)-1):\r\n for i in range(len(table)):\r\n table2.append(sum(table[:i+1]))\r\n table = table2.copy()\r\n table2 = []\r\nprint(max(table))\r\n", "a = int(input())\r\ns1= []\r\ns = [1 for i in range(a)]\r\ns1.append(s)\r\nfor i in range(1, a):\r\n q = [1]\r\n for j in range(1, a):\r\n q.append(s1[i - 1][j] + q[j - 1])\r\n s1.append(q)\r\ns = []\r\nfor i in s1:\r\n s.append(max(i))\r\nprint(max(s))\r\n \r\n", "n = int(input())\r\n\r\ndp = [[0 for _ in range(n)] for i in range(n)]\r\nfor i in range(n):\r\n dp[0][i] = 1\r\n dp[i][0]= 1\r\n \r\nm = 1\r\nfor i in range(1, n):\r\n for j in range(1, n):\r\n dp[i][j] = dp[i][j-1]+dp[i-1][j]\r\n m = max(m, dp[i][j])\r\nprint(m)", "n = int(input())\r\n\r\n\r\nmat = [[1]*n]\r\n\r\nfor _ in range(n-1):\r\n row=[1]\r\n for _ in range(n-1):\r\n row.append(0)\r\n mat.append(row)\r\n\r\nfor i in range(1,n):\r\n for j in range(1,n):\r\n mat[i][j] = mat[i-1][j] + mat[i][j-1]\r\n \r\nprint(mat[n-1][n-1])\r\n ", "#from math import ceil\r\nfrom math import comb\r\n\r\nn = int(input())\r\n\r\nprint(comb(2*n - 2, n - 1))", "def main():\r\n n = int(input())\r\n arr = [[0]*n for _ in range(n)]\r\n for i in range(n):\r\n for j in range(n):\r\n if i == 0:\r\n arr[i][j] = 1\r\n elif j == 0:\r\n arr[i][j] = 1\r\n else:\r\n arr[i][j] = arr[i-1][j] + arr[i][j-1]\r\n print(arr[-1][-1])\r\n\r\n\r\nmain()", "m = []\r\nn = int(input())\r\nfor i in range(n):\r\n m.append([1]*n)\r\nfor i in range(1, n):\r\n for j in range(1, n):\r\n m[i][j] = m[i-1][j] + m[i][j-1]\r\nprint(m[-1][-1])", "n=int(input())\r\nl=[]\r\nm=[]\r\nfor i in range(n):\r\n\tm.append(1)\r\nfor i in range(n):\r\n\tl.append(m)\r\nfor i in range(1,n):\r\n\tfor j in range(1,n):\r\n\t\tl[i][j]=l[i-1][j]+l[i][j-1]\r\nprint(l[n-1][n-1])", "n = int(input())-1\r\nf = [1,1]\r\nfor i in range(2,2*n+1):\r\n f.append(i*f[-1])\r\nprint(f[2*n]//(f[n]**2))", "import math\r\nn=int(input())\r\nprint(int(math.factorial(2*(n-1))/(math.factorial(n-1)**2)))\r\n", "n = int(input())\r\nls = [[1,1,1,1,1,1,1,1,1,1]]\r\ne = 0\r\nans = []\r\nfor t in range(9):\r\n part = [1]\r\n i = 2\r\n while i<=len(ls[e]):\r\n part.append(sum(ls[e][0:i]))\r\n i += 1\r\n ls.append(part)\r\n e += 1\r\nq = 0\r\nwhile q < n :\r\n ans.append(ls[q][0:n])\r\n q+=1\r\nprint(ans[-1][-1])\r\n\r\n\r\n\r\n\r\n", "n=int(input())\r\n\r\n\r\nmatrix=[]\r\nfor i in range(n):\r\n lst=[]\r\n for j in range(n):\r\n lst.append(1)\r\n matrix.append(lst)\r\n\r\n\r\n\r\n\r\n\r\n\r\nfor i in range(n):\r\n for j in range(n):\r\n if i==0 or j==0:\r\n matrix[i][j]=1\r\n else:\r\n temp=matrix[i-1][j]+matrix[i][j-1]\r\n matrix[i][j]=temp\r\n\r\n\r\nprint(matrix[n-1][n-1])", "n=int(input())\r\nl=[1 for i in range(n)]\r\nm=[0 for i in range(n)]\r\nfor i in range(n-1):\r\n\tfor j in range(1,n+1):\r\n\t\tm[j-1]=sum(l[:j])\r\n\tl=m.copy()\r\nprint(l[n-1])", "a = [[1]*10]*10\r\nn = int(input())\r\nfor i in range (1, n):\r\n for j in range(1, n):\r\n a[i][j] = a[i-1][j] + a[i][j-1]\r\n\r\nprint(a[n-1][n-1])", "#509A - Maximum in Table\r\nn,a=int(input()),1\r\nfor i in range(1,n):\r\n a=(a*2*((i*2)-1))//i\r\nprint(a)", "x=int(input())\r\nq=[[1]*x]*x\r\nj=1\r\nfor i in range(1,x):\r\n for j in range(1,x):\r\n q[i][j]=q[i][j-1]+q[i-1][j]\r\nprint(q[x-1][x-1])", "t = int(input())\r\nn = [0, 1, 2, 6, 20, 70, 252, 924, 3432, 12870, 48620]\r\n \r\nprint(n[t])\r\n ", "print(eval(\"//\".join(\"(\"+\"*\".join(str(x) for x in a)+\")\" for u in (zip((1,1),*((n+i-1,n) for n in range(1,i))) for i in (int(input()),)) for a in u)))", "n=int(input())\r\nres_q=[]\r\nfor i in range(n):\r\n if i==0:\r\n l1=[]\r\n for j in range(n):\r\n l1.append(1)\r\n res_q.append(l1)\r\n else :\r\n l1=[]\r\n for j in range(n):\r\n if j==0:\r\n l1.append(1)\r\n else :\r\n l2=res_q[i-1]\r\n upper_num=l2[j]\r\n left_num=l1[j-1]\r\n l1.append(upper_num+left_num)\r\n res_q.append(l1)\r\nlast_row=res_q[-1]\r\nprint(last_row[-1])", "n = int(input())\r\ntabla = []\r\nfor i in range(n):\r\n a = []\r\n for j in range(n):\r\n a.append(1)\r\n tabla.append(a)\r\n\r\n\r\nfor fila in range(1, n):\r\n for columna in range(1, n):\r\n tabla[fila][columna] = tabla[fila -\r\n 1][columna] + tabla[fila][columna-1]\r\n\r\nprint(max(tabla[n-1]))\r\n", "n=int(input());a=[]\r\nfor i in range(n):\r\n a.append(1)\r\nfor i in range(1,n):\r\n p=0;b=[]\r\n for j in range(n):\r\n b.append(p+a[j])\r\n p+=a[j]\r\n a=b\r\nprint(a[n-1])\r\n", "def solve(n):\r\n a=[[0 for i in range(n)] for j in range(n)]\r\n for i in range(n):\r\n for j in range(n):\r\n if j==0 or i==0:\r\n a[i][j]=1\r\n else:\r\n a[i][j]=a[i-1][j]+a[i][j-1]\r\n return a[n-1][n-1]\r\n\r\ndef main():\r\n n=int(input())\r\n print(solve(n))\r\n\r\nmain()\r\n", "n=int(input(\"\"))\r\nl=[]\r\nfor i in range(n):\r\n l1=[]\r\n for j in range(n):\r\n if i==0 or j==0:\r\n l1.append(1)\r\n else:\r\n l1.append(0)\r\n l.append(l1)\r\n \r\nfor i in range(1,n):\r\n for j in range(1,n):\r\n l[i][j]=l[i-1][j]+l[i][j-1]\r\nprint(max(max(l)))\r\n", "n = int(input())\r\nprev = (n+1)*[1]\r\n#print(prev[1:])\r\na = (n+1)*[1]\r\nfor row in range(2, n+1):\r\n for i in range(2,n+1):\r\n a[i] = a[i-1] + prev[i]\r\n# print(a[1:])\r\n prev = a\r\nprint(a[n])\r\n", "n=int(input())\r\nlist1=[]\r\nfor i in range(n):\r\n lis0=[]\r\n for o in range(n):\r\n lis0.append(1)\r\n list1.append(lis0)\r\nfor i in range(1,n):\r\n for j in range(1,n):\r\n list1[i][j]=list1[i-1][j]+list1[i][j-1]\r\nprint(max(max(list1)))", "from sys import stdin, stdout\r\nfrom collections import Counter, deque\r\nfrom itertools import permutations, combinations, accumulate\r\nfrom functools import reduce\r\nfrom heapq import *\r\nfrom operator import itemgetter\r\nfrom math import *\r\n\r\ninput_int = lambda: int(stdin.readline())\r\ninput_ints = lambda: map(int, stdin.readline().split())\r\ninput_array = lambda: list(input_ints())\r\ninput_str = lambda: stdin.readline()[:-1]\r\n\r\nn = input_int()\r\na = [[1] * n for _ in range(n)]\r\nfor i in range(1, n):\r\n for j in range(1, n):\r\n a[i][j] = a[i - 1][j] + a[i][j - 1]\r\nstdout.write(f'{a[n - 1][n - 1]}')\r\n", "n = int(input())\r\ntable = [[1]*n for _ in range(n)]\r\nfor i in range(1, n):\r\n for j in range(1, n):\r\n table[i][j]=table[i][j-1]+table[i-1][j]\r\nprint(table[-1][-1])\r\n", "n = int(input())\r\nmat = [[0 for i in range(n)] for i in range(n)]\r\nfor i in range(n):\r\n for j in range(n):\r\n if i==0 or j==0:\r\n mat[i][j] = 1\r\n else:\r\n mat[i][j] = mat[i-1][j] + mat[i][j-1]\r\nprint(mat[n-1][n-1])", "n = int(input())\narr = []\nrow1 = []\nfor i in range(n):\n for j in range(n):\n if j == 0:\n arr.append([1])\n continue \n if i == 0:\n arr[i].append(1)\n continue\n arr[i].append(arr[i - 1][j] + arr[i][j - 1])\nprint(arr[n-1][n-1]) \n\t \t \t \t\t \t \t\t \t\t \t \t \t", "n = int(input())\r\narr = [\r\n [1] + [0] * (n-1) for _ in range(n)\r\n]\r\narr[0] = [1] * n\r\n\r\nfor i in range(1, n):\r\n for j in range(1, n):\r\n arr[i][j] = arr[i-1][j] + arr[i][j-1]\r\nprint(arr[-1][-1])", "n = int(input())\r\nfirst = [1 for i in range(n)]\r\nif (n == 1):\r\n print(1)\r\nelse:\r\n for j in range(n-1):\r\n second = [1]\r\n for x in range(n-1):\r\n second.append(first[x+1]+second[x])\r\n first = second\r\n print(max(first))", "n=int(input())\r\nr=[1]*n\r\nfor i in range(1,n):\r\n pc=1\r\n for j in range(1,n):\r\n r[j]=r[j]+pc\r\n pc=r[j]\r\nprint(r[n-1])", "from math import factorial as f\r\nn = int(input()) - 1\r\nprint(f(2 * n)//(f(n)**2))", "n = int(input())\r\nl = []\r\n\r\ndef a(x,y):\r\n if x == 1 or y == 1:\r\n return 1\r\n else:\r\n return a(x-1,y) + a(x,y-1)\r\n\r\nprint(a(n,n))", "n =int(input())\r\nlis = []\r\nfor i in range(n):\r\n lis.append([])\r\n for j in range(n):\r\n lis[i].append(0)\r\n if j ==0 or i == 0:\r\n lis[i][j] = 1\r\nfor i in range(1,n):\r\n for j in range(1,n):\r\n lis[i][j] = lis[i-1][j] + lis[i][j-1]\r\n \r\nprint(lis[n-1][n-1])", "import math\r\nn = int(input())\r\n\r\nprint(math.comb(n*2-2, n-1))\r\n", "n = int(input())\r\n\r\n# initialize the table with ones\r\ntable = [[1]*n for i in range(n)]\r\n\r\n# compute the values using dynamic programming\r\nfor i in range(1, n):\r\n for j in range(1, n):\r\n table[i][j] = table[i-1][j] + table[i][j-1]\r\n\r\n# print the maximum value\r\nprint(table[n-1][n-1])", "n = int(input())\r\npascal = [[1]*n for i in range(n)]\r\nfor i in range(1,n):\r\n for j in range(1,n):\r\n pascal[i][j] = pascal[i-1][j] + pascal[i][j-1]\r\nprint(pascal[n-1][n-1])", "from math import factorial\r\nn = int(input())\r\nn -= 1\r\nprint(factorial(2*n)//(factorial(n)**2))", "n = int(input())\r\nt = list()\r\nfor i in range(n):\r\n if i == 0:\r\n t.append([int(x) for x in list('1' * n)])\r\n else:\r\n t.append([1] + [int(x) for x in list('0' * (n - 1))])\r\nfor i in range(n):\r\n for j in range(n):\r\n if t[i][j] == 0:\r\n t[i][j] = t[i - 1][j] + t[i][j - 1]\r\nprint(t[-1][-1])", "n = int(input())\r\na = [1]*n\r\nfor _ in range(1, n):\r\n for i in range(1, n):\r\n a[i] = a[i] + a[i -1]\r\n \r\nprint(a[-1])", "n = int(input())\r\nm = [[1 for j in range(n)] for i in range(n)]\r\nmaxn = 1\r\nfor i in range(1,n):\r\n for j in range(1,n):\r\n m[i][j] = m[i-1][j]+m[i][j-1]\r\n if(m[i][j]>maxn):\r\n maxn = m[i][j]\r\nprint(maxn)\r\n", "#MaximuminTable\r\n\r\nn = int(input())\r\n\r\nMatrixs_List = [[0]*n for _ in range(n)]\r\n\r\n\r\n\r\nfor num in range(n):\r\n\tfor num1 in range(n):\r\n\t\tif(num == 0) or (num1 == 0):\r\n\t\t\tMatrixs_List[num][num1] = 1\r\n\t\telse:\r\n\t\t\tMatrixs_List[num][num1] = Matrixs_List[num-1][num1] + Matrixs_List[num][num1-1]\r\n# print(Matrixs_List)\t\t\t\r\nprint(Matrixs_List[-1][-1])\r\n\r\n", "n = int(input())\na = []\na.append([1]*n)\nif n == 1:\n print(n)\nelse:\n for i in range(n-1):\n a.append([1]+[0]*(n-1))\n for i in range(1,n):\n for j in range(1,n):\n a[i][j] = a[i-1][j] + a[i][j-1]\n # print(a[i][j],end='')\n # print()\n print(a[i][j])\n# print(a)", "n = int(input())\r\ntable = [[1] * n] + [[1] + [0] * (n - 1)] * (n - 1)\r\nfor i in range(1, n):\r\n for j in range(1, n):\r\n table[i][j] = table[i - 1][j] + table[i][j - 1]\r\nmaximum_value = table[n - 1][n - 1]\r\nprint(maximum_value)\r\n", "n = int(input())\n\narr_2d = []\n\nfline = []\nfor i in range(n):\n fline.append(1)\n\narr_2d.append(fline)\n\nfor i in range(1 , n):\n line = [1]\n for j in range(1 , n):\n line.append(arr_2d[i-1][j] + line[j-1])\n arr_2d.append(line)\n\nprint(arr_2d[n-1][n-1])\n \t\t\t \t\t \t \t\t \t\t \t\t\t \t\t \t \t", "# 509A - Maximum in table\r\n\r\nn = eval(input())\r\nn_by_n_list = []\r\nmaximum = 0\r\nfor i in range(n):\r\n row_list = []\r\n for j in range(n):\r\n if i == 0 or j == 0:\r\n row_list.append(1)\r\n else:\r\n row_list.append(row_list[j-1]+n_by_n_list[i-1][j])\r\n n_by_n_list.append(row_list)\r\n maximum = max(row_list)\r\nprint(maximum)", "x = int(input())\r\nlst = []\r\nlst.append([1 for i in range(x)])\r\n\r\nfor i in range(x-1):\r\n lst.append([1])\r\nfor i in lst:\r\n q = 1\r\n while len(i)<x:\r\n z = lst.index(i)\r\n try:\r\n num = lst[z-1][q]+lst[z][q-1]\r\n except:\r\n pass\r\n i.append(num)\r\n \r\n \r\n \r\n q+=1\r\nprint(lst[-1][-1])\r\n", "n = int(input())\r\nif n == 1:\r\n print(1)\r\nelse:\r\n table = [[0 for i in range(n)] for j in range(n)]\r\n # make the row 1 zero\r\n for i in range(n):\r\n table[0][i] = 1\r\n\r\n for i in range(n):\r\n table[i][0] = 1\r\n maxs = []\r\n for i in range(1, n):\r\n for j in range(1, n):\r\n table[i][j] = table[i - 1][j] + table[i][j - 1]\r\n maxs.append(max(table[i]))\r\n\r\n print(max(maxs))", "n = int(input())\r\nmatrix = [[0]*n]*n\r\n\r\nfor i in range(n):\r\n matrix[0][i] = 1\r\nfor i in range(n-1):\r\n for j in range(n):\r\n if j == 0:\r\n matrix[i][j] = 1\r\n else:\r\n matrix[i][j] = matrix[i-1][j]+matrix[i][j-1]\r\nprint(matrix[-1][-1])", "from math import factorial\n\nn = int(input())\n# 1 1 1 1 1 1 1\n# 1 2 3 4 5 6 7\n# 1 3 6 10\n# 1 4 10 20\nk = 2 * (n - 1)\nres = factorial(k) // (factorial(k // 2) ** 2)\nprint(res)\n", "x = int(input())\r\n\r\ntable = []\r\n\r\nfor el in range(x):\r\n table.append([])\r\n\r\nfor za in range(x):\r\n table[0].append(1)\r\n table[za].append(1)\r\nd = 1\r\nfor zel in range(1,x):\r\n for qel in range(1,x):\r\n table[zel].append(table[zel][qel - 1] + table[zel-1][qel])\r\n\r\n\r\n\r\nprint(table[-1][-1])\r\n", "size = int(input())\r\n\r\ndef maximum_table(i, j):\r\n if i == 1 or j == 1:\r\n return 1\r\n\r\n return maximum_table(i-1, j) + maximum_table(i, j - 1)\r\n\r\nprint(maximum_table(size, size))", "List = [0,1, 2, 6, 20, 70, 252, 924, 3432, 12870, 48620]\r\nn = int(input())\r\nprint(List[n])", "def factorial(n):\r\n if n==1 or n==0:\r\n return 1\r\n else:\r\n return n*(factorial(n-1))\r\n\r\na = int(input())\r\nb = 2*(a-1)\r\nc = b//2\r\nprint(int(factorial(b)/(factorial(c)*factorial(b-c))))\r\n\r\n\r\n\r\n", "def main():\r\n n = int(input())\r\n table=[]\r\n for i in range(0, n):\r\n table.append([1]*n)\r\n for i in range(1, n):\r\n for j in range (1, n):\r\n table[i][j] = table[i-1][j] + table[i][j-1]\r\n return table[n-1][n-1]\r\nprint(main())", "n = int(input())\r\nfull = [0] * n\r\n\r\nfor i in range(n):\r\n if i == 0:\r\n full[i] = [1] * n\r\n else:\r\n full[i] = [1] + [0] * (n - 1)\r\n\r\nfor i in range(1, n):\r\n for j in range(1, n):\r\n full[i][j] = full[i][j-1] + full[i-1][j]\r\n\r\nprint(full[n-1][n-1])", "from math import factorial\r\nn = int(input(\"\"))\r\ntop = (2 * n) - 2\r\nbot = (n-1)\r\nprint(factorial(top) // (factorial(top- bot) * factorial(bot)))", "n=int(input())\r\nif n==1:\r\n print(\"1\")\r\nelse:\r\n l=[]\r\n for i in range(n):\r\n m=[1]*n\r\n l.append(m)\r\n ans=1\r\n for i in range(1,n):\r\n for j in range(1,n):\r\n l[i][j]=l[i-1][j]+l[i][j-1]\r\n ans=max(ans,l[i][j])\r\n print(ans)", "x=[1,2,6,20,70,252,924,3432,12870,48620]\r\ni=int(input())\r\nprint(x[i-1])", "n = int(input())\r\nlist1 = []\r\nfor i in range(n):\r\n list1.append([])\r\n for j in range(n):\r\n list1[i].append(None)\r\nfor i in range(n):\r\n list1[0][i] = 1\r\nfor i in range(n):\r\n list1[i][0] = 1\r\nfor i in range(1, n):\r\n for j in range(1, n):\r\n list1[i][j] = list1[i-1][j] + list1[i][j-1]\r\nprint(list1[i][j])", "import math\r\nn=int(input())\r\na=[[1]*n for i in range(n)]\r\nfor row in range(n):\r\n for col in range(n):\r\n if not (row==0 or col==0):\r\n a[row][col]=a[row-1][col]+a[row][col-1]\r\nprint(max(max(a)))", "def combin(n, k):\r\n p = 1\r\n for i in range(k):\r\n p *= (n-i)/(i+1)\r\n return int(p)\r\nn = int(input())\r\nprint(combin(2*n-2, n-1))", "n = int(input())\r\narr = [[] for _ in range(n)]\r\nfor i in range(n):\r\n for j in range(n):\r\n arr[i].append(1)\r\nfor i in range(1,n):\r\n for j in range(1,n):\r\n #ai,j = ai-1,j + ai,j-1\r\n arr[i][j] = arr[i-1][j] + arr[i][j-1]\r\nprint(max(arr[-1]))\r\n", "num=int(input())\r\nx=[]\r\nfor i in range(num):\r\n y=[]\r\n for j in range(num):\r\n if(i==0 or j==0):\r\n y.append(1)\r\n else:\r\n y.append(x[i-1][j]+y[j-1])\r\n x.append(y)\r\nprint(x[i][i])\r\n", "l1=[int(i) for i in input().split()][:1]\na = l1[0]\n\nT= []\nfor c in range(a):\n T.append(1)\n\nl2 = []\nl2.append(T)\nfor k in range(a-1):\n l2.append([1])\n\n\n\nfor t in range(1,a,1):\n for j in range(1,a):\n l2[t].append((l2[t][j-1])+(l2[t-1][j]))\n\nprint(l2[a-1][a-1])", "n=int(input())\r\nl=[[0 for i in range(n)] for i in range(n)]\r\ns=[]\r\nfor i in range(n):\r\n for j in range(n):\r\n if(i==0 or j==0):\r\n l[i][j]=1\r\n s.append(l[i][j])\r\n else:\r\n l[i][j]=l[i-1][j]+l[i][j-1]\r\n s.append(l[i][j])\r\nprint(max(s))\r\n ", "n = int(input())\r\nA = [[1 for i in range(n)] for j in range(n)]\r\nfor i in range(1, n):\r\n for j in range(1, n):\r\n A[i][j] = A[i-1][j]+A[i][j-1]\r\nprint(A[n-1][n-1])\r\n", "import sys\r\n\r\nn = int(sys.stdin.readline().split()[0])\r\n\r\na = [[0 for i in range(n)] for y in range(n)]\r\n\r\nfor x in range(n):\r\n a[0][x] = 1\r\n\r\nfor row in range(1,n):\r\n for column in range(n):\r\n if column ==0:\r\n a[row][column] = a[row-1][column]\r\n else:\r\n a[row][column] = a[row-1][column]+a[row][column-1]\r\n\r\n\r\nprint(max(max(a)))", "n = int(input())\narr = []\na = []\n\nfor i in range(n):\n a.append(1)\narr.append(a)\n\nfor i in range(1 , n):\n a = []\n a.append(1)\n for j in range(1 , n):\n a.append(arr[i-1][j] + a[j-1])\n arr.append(a)\n\nmx = 0\nfor i in range(n):\n for j in range(n):\n if arr[i][j] > mx:\n mx = arr[i][j]\n\nprint(mx)\n\t\t \t\t \t\t\t \t \t \t \t \t \t", "n=int(input())\na=[]\nfor i in range(n):\n b=[]\n for j in range(n):\n if i==0 or j==0:\n b.append(1)\n else:\n b.append(a[i-1][j]+b[j-1])\n a.append(b)\nprint(a[n-1][n-1])\n\t \t \t\t \t\t\t\t\t\t\t \t\t \t\t\t\t\t\t \t\t\t \t", "n = int(input())\r\nm = [[0 for j in range(n)] for i in range (n)]\r\nm[0] = [1 for i in range(n)]\r\nfor i in range(n):\r\n m[i][0] = 1\r\nif n == 1:\r\n print(1)\r\nelif n == 2:\r\n print(2)\r\nelse:\r\n for i in range(1, n):\r\n for j in range (1, n):\r\n m[i][j] = m[i-1][j] + m[i][j-1]\r\n print(m[n-1][n-1])", "n = int(input())\r\ns = 0\r\nli = []\r\nl = [1 for _ in range(n)]\r\nfor _ in range(n-1):\r\n for i in range(n):\r\n for j in range(i+1):\r\n s += l[j]\r\n li.append(s)\r\n s = 0\r\n l = li\r\n li = []\r\nprint(l[-1])\r\n", "z = int(input())\r\narr = [ [ int(1) for i in range(z) ] for i in range(z) ]\r\n \r\nfor i in range(1,z):\r\n for j in range(1,z):\r\n arr[i][j] = arr[i][j-1] + arr[i-1][j]\r\n \r\nprint(arr[z-1][z-1])", "def fun(i,j):\r\n if i == 0 or j == 0:\r\n return 1\r\n \r\n return fun(i-1,j)+fun(i,j-1)\r\n \r\nn = int(input())\r\nprint(fun(n-1,n-1))", "o = int(input()) \n\nt = [[1] * o] + [[1] + [0] * (o- 1) for _ in range(o- 1)]\n\nfor i in range(1, o):\n for j in range(1, o):\n t[i][j] = t[i - 1][j] + t[i][j - 1]\n\nmax_v = max(t[o- 1])\n\nprint(max_v)\n \t\t \t \t \t \t \t \t\t\t \t\t", "n=int(input())\r\nmas=[[1]*n for i in range(n)]\r\nfor i in range(1,n):\r\n for j in range(1,n):\r\n mas[i][j]=mas[i-1][j]+mas[i][j-1]\r\nprint(mas[n-1][n-1])", "from math import factorial as f; n = int(input())-1\r\nprint(f(2*n)//f(n)**2)\r\n", "l1=[0,1,2,6,20,70,252,924,3432,12870,48620]\r\nprint(l1[int(input())])", "def factorial(num):\r\n if num == 1:\r\n return 1\r\n else:\r\n return num * factorial(num - 1)\r\n\r\n\r\nnum = int(input())\r\nn = 2 * (num - 1)\r\nk = n // 2\r\n\r\nif num == 1:\r\n print(1)\r\nelse:\r\n res = factorial(n) // (factorial(n - k) * factorial(k))\r\n print(res)\r\n", "n = int(input())\r\nb = [[1]]\r\na = [[1]*n] + [[1] for i in range(n-1)]\r\nfor i in range(1, n):\r\n for j in range(1, n):\r\n a[i].append(a[i][j-1] + a[i-1][j])\r\nprint(max(max(a)))", "def generating_new_list(old_list):\r\n new_list = [1]\r\n for i in range(1,len(old_list)):\r\n new_list.append(new_list[i-1]+ old_list[i])\r\n return new_list\r\n\r\n\r\nn = int(input(\"\"))\r\nlis = [1 for i in range(n)]\r\n\r\nfor i in range(1,n):\r\n lis = generating_new_list(lis)\r\n\r\nprint(lis[n-1])", "n = int(input())\r\na = [0] * n\r\nfor i in range(n):\r\n a[i] = [0] * n\r\nfor i in range(n):\r\n a[0][i] = 1\r\nfor i in range(n):\r\n a[i][0] = 1\r\nfor i in range(1, n):\r\n for j in range(1, n):\r\n a[i][j] = a[i - 1][j] + a[i][j - 1]\r\nprint(a[n - 1][n - 1])\r\n\r\n\r\n \r\n", "num=int(input())\r\nlist=[1,2,6,20,70,252,924,3432,12870,48620]\r\nprint(list[num-1])", "n=int(input()) \r\nli=[[ int(1) for j in range(n)] for i in range(n)]\r\n\r\nfor x in range(1,n):\r\n\tfor y in range(1,n):\r\n\t\tli[x][y]=li[x-1][y]+li[x][y-1] \r\n\r\nanswer=li[-1][-1]\r\nprint(answer)\r\n", "n = int(input())\r\ndp = [[1 for i in range(n)] for j in range(n)]\r\nfor i in range(1,n):\r\n for j in range(1,n):\r\n dp[i][j] = dp[i-1][j] + dp[i][j-1]\r\nprint(dp[-1][-1])", "n=int(input())\r\narr=[]\r\narr_1=[1]*n\r\nsumm=0\r\nfor j in range(n-1):\r\n summ=0\r\n for i in range(n):\r\n summ+=arr_1[i]\r\n arr.append(summ)\r\n arr_1=arr\r\n arr=[]\r\nprint(arr_1[n-1])", "# 코드포스 509A Maximum in Table\r\nimport sys\r\nput = sys.stdin.readline\r\n\r\nn = int(put())\r\ntable = [1] * n\r\n\r\nfor i in range(1, n):\r\n t = [sum(table[:j+1]) for j in range(n)]\r\n table = t\r\n\r\nprint(table[-1])", "def main():\r\n n = int(input())\r\n m = []\r\n for i in range(1,n+1):\r\n m.append([0] * i)\r\n for i in range(0,n):\r\n for j in range(0,i+1):\r\n if j == 0:\r\n m[i][j] = 1\r\n elif i == j:\r\n m[i][j] = 2 * m[i][j-1]\r\n else:\r\n m[i][j] = m[i-1][j] + m[i][j-1]\r\n print(m[n-1][n-1])\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n = int(input())\r\ns = [[1] * n] * n\r\nfor i in range(1,len(s)):\r\n for j in range(1,len(s[i])):\r\n s[i][j] = s[i - 1][j] + s[i][j - 1]\r\nprint(max(s[-1]))", "n=int(input())\r\nif n==1:\r\n print(1)\r\nelse:\r\n r,c=(n,n)\r\n a=[[0]*c]*r\r\n for i in range(n):\r\n a[0][i]=1\r\n a[i][0]=1\r\n for i in range(1,r):\r\n for j in range(1,c):\r\n a[i][j]=a[i][j-1]+a[i-1][j]\r\n print(a[n-1][n-1])\r\n ", "lst = [0,1,2,6,20,70,252,924,3432,12870,48620]\r\nn = int(input())\r\nprint(lst[n])", "n=int(input())\r\na=[[0]* n for i in range(n)]\r\nfor k in range(n):\r\n a[0][k]=1\r\nif(n!=1): \r\n for i in range(n):\r\n for j in range(n):\r\n \r\n a[i][j]=a[i-1][j]+a[i][j-1]\r\n \r\nprint(a[n-1][n-1])", "n = int(input())\r\ntab = [[0]*n]*n\r\nfor i in range(n):\r\n tab[0][i] = 1\r\n tab[i][0] = 1\r\n\r\nmaxi = 1\r\nfor x in range(1, n):\r\n for y in range(1, n):\r\n tab[x][y] = tab[x - 1][y] + tab[x][y - 1]\r\n maxi = max(maxi, tab[x][y])\r\nprint(maxi)\r\n", "from math import comb\r\nn=int(input())\r\nr=n-1\r\nn=2*n-2\r\nprint(comb(n,r))", "n = int(input())\r\n\r\nif n == 1:\r\n print(1)\r\nelse:\r\n arr = []\r\n arr.append([1] * n)\r\n last = 0\r\n lastLeft = 0\r\n lastUp = 1\r\n while last < n - 1:\r\n newArr = [1]\r\n while lastUp < n:\r\n newArr.append(newArr[lastLeft] + arr[last][lastUp])\r\n lastLeft += 1\r\n lastUp += 1\r\n lastLeft = 0\r\n lastUp = 1\r\n arr.append(newArr)\r\n last += 1\r\n print(arr[n-1][n-1])\r\n", "from math import ceil\r\nn=int(input())\r\narr=[[1 for i in range(n)] for j in range(n)]\r\nfor i in range(1,n):\r\n for j in range(1,n):\r\n arr[i][j]=arr[i-1][j]+arr[i][j-1]\r\nprint(arr[n-1][n-1])\r\n ", "from math import comb\r\nn = int(input())\r\nprint(comb(2 * n - 2, n - 1))", "# coding: utf-8\r\n\r\nn = int(input())\r\na = [[1 for j in range(n)] for i in range(n)]\r\nmaximum = 1\r\n\r\nfor i in range(1, n):\r\n for j in range(1, n):\r\n a[i][j] = a[i - 1][j] + a[i][j - 1]\r\n \r\n maximum = max(a[i])\r\n \r\nprint(maximum)", "n=int(input())\r\nl=[[1]*n]\r\nfor i in range(n):\r\n l1=[1]+[0]*(n-1)\r\n l+=[l1]\r\n#print(l)\r\nfor i in range(n):\r\n for j in range(1,n):\r\n l[i][j]=l[i][j-1]+l[i-1][j]\r\nprint(l[n-1][n-1])\r\n", "n = int(input())\r\narr = [[1]*n]\r\n# print(arr)\r\n\r\ni = 2\r\nwhile(i<=n):\r\n sum = 0\r\n x = []\r\n for ele in arr[-1]:\r\n sum+=ele\r\n x.append(sum)\r\n arr.append(x)\r\n i+=1\r\nprint(arr[-1][-1])\r\n \r\n \r\n \r\n ", "\n\ndef solver(n):\n tab = [[1]*n]*n\n for i in range(1,n):\n for j in range(1,n):\n tab[i][j] = tab[i-1][j]+tab[i][j-1]\n return int(tab[-1][-1])\n\n\n\n\nif __name__ == '__main__':\n n = int(input())\n print(solver(n))\n\n# See PyCharm help at https://www.jetbrains.com/help/pycharm/\n", "n = int(input())\r\n\r\nlast = [1] * n\r\nfor i in range(1,n) :\r\n left = 0\r\n for j in range(n) :\r\n last[j] = last[j] + left\r\n left = last[j]\r\nprint(last[n-1])\r\n", "n = int(input())\nbord = []\n\nfor i in range(n):\n line = [1]\n for j in range(1, n):\n if i == 0:\n line.append(1)\n else:\n line.append(bord[i-1][j] + line[j - 1])\n bord.append(line)\n\nprint(bord[n-1][n-1])\n\t\t \t \t\t\t \t \t\t\t\t \t \t \t \t \t", "n = int(input())\r\nmatrix = []\r\n#fill 1s\r\nfor i in range(n):\r\n temp = []\r\n for j in range(n):\r\n if i == 0 or j == 0:\r\n temp.append(1)\r\n else:\r\n temp.append(temp[j-1]+matrix[i-1][j])\r\n matrix.append(temp)\r\n \r\nprint(matrix[-1][-1])", "n=int(input())\r\narr=[[0 for i in range(n)]for j in range(n)]\r\nfor i in range(n):\r\n arr[i][0]=1\r\n arr[0][i]=1\r\nfor i in range(1,len(arr)):\r\n for j in range(1,len(arr)):\r\n arr[i][j]=arr[i-1][j]+arr[i][j-1]\r\nprint (arr[-1][-1])", "def val(r, c):\r\n if r==1 or c==1:\r\n return 1\r\n return val(r, c-1) + val(r-1, c)\r\n\r\nx=input()\r\nx = int(x)\r\nprint(val(x,x))\r\n\r\n", "l_main = []\r\nl = []\r\nN = int(input())\r\nfor i in range(N):\r\n for j in range(N):\r\n if i==0:\r\n l.append(1)\r\n elif j==0:\r\n l.append(1)\r\n else:\r\n l.append(l[j-1]+l_main[i-1][j])\r\n l_main.append(l)\r\n l = []\r\nprint(l_main[N-1][N-1])", "n = int(input())\nmy_list = []\n\nones_list = []\nfor i in range(1, n + 1):\n ones_list.append(1)\nmy_list.append(ones_list)\n\nfor i in range(n-1):\n new_list = [1]\n for j in range(n-1):\n value = my_list[i][j+1] + new_list[j]\n new_list.append(value)\n my_list.append(new_list)\n\nprint(my_list[n-1][n-1])", "n=int(input())-1\r\ndef fact(x):\r\n a=1\r\n for i in range(1,x+1):\r\n a=a*i\r\n return a\r\nprint(fact(2*n)//(fact(n)**2))", "m=int(input())\r\nnum = [1 for i in range(m)]\r\nfor i in range(m-1):\r\n for j in range(1,m):\r\n num[j]=num[j]+num[j-1]\r\nprint(num[-1])\r\n\r\n", "n = int(input())\r\nmatrix = []\r\nfor i in range(n):\r\n t = []\r\n for j in range(n):\r\n t.append(0)\r\n matrix.append(t)\r\n\r\nfor i in range(n):\r\n matrix[0][i] = 1\r\n matrix[i][0] = 1\r\n\r\nfor i in range(1, n):\r\n for j in range(1, n):\r\n matrix[i][j] = matrix[i - 1][j] + matrix[i][j - 1]\r\nprint(matrix[n-1][n-1])\r\n", "import math\r\nn= int(input())\r\nm=2*(n-1)\r\nres=math.factorial(m)//(math.factorial(n-1)**2)\r\nprint(res)", "def fun(r,c):\r\n if r==1 or c==1:\r\n return 1\r\n return fun(r-1,c) + fun(r,c-1)\r\na = int(input())\r\nprint(fun(a,a))", "number = int(input())\r\n\r\ndef factorial(number):\r\n \r\n res = 1\r\n for i in range(1 , number + 1):\r\n res *= i\r\n return res\r\n \r\nprint(factorial(2*number-2) // (factorial(number-1) * factorial(number-1)))", "n = int(input())\r\n\r\nmatrix = [[]]\r\nfor i in range(n):\r\n matrix[0].append(1)\r\n matrix.append([])\r\n\r\nfor i in range(1,n):\r\n for j in range(n):\r\n if j==0:\r\n matrix[i].append(matrix[i-1][0])\r\n else:\r\n matrix[i].append(matrix[i-1][j] + matrix[i][j-1])\r\n \r\nmax = 0\r\nfor i in range(n):\r\n for j in range(n):\r\n if matrix[i][j] > max:\r\n max = matrix[i][j]\r\n\r\nprint(max)\r\n", "# def maximum(row, col):\r\n#\r\n# if row == 1 or col == 1:\r\n# return 1\r\n# return maximum(row - 1, col) + maximum(row, col - 1)\r\n#\r\n# n = int(input())\r\n# print(maximum(n,n))\r\nn = int(input())\r\nn = n-1\r\nmaximums = [1,2,6,20,70,252,924,3432,12870,48620]\r\nprint(maximums[n])\r\n", "def find_elem(row, col):\r\n if row == 1 or col == 1:\r\n return 1\r\n else:\r\n return find_elem(row - 1, col) + find_elem(row, col - 1)\r\n\r\nn = int(input())\r\nprint(find_elem(n, n))", "count = int(input())\r\nlist_1 = [1 for i in range(count)]\r\nlist_2 = [1 for k in range(count)]\r\nd = 0\r\nfor i in range(1, count):\r\n for j in range(1, count):\r\n d = list_2[j]\r\n list_2[j] += list_1[i]\r\n list_1[i] += d\r\nprint(list_1[-1])\r\n", "n = int(input())\r\nmas = [[1 for i in range(n)] for j in range(n)]\r\n\r\nans = 1\r\n\r\nfor i in range(1, n):\r\n for j in range(1, n):\r\n mas[i][j] = mas[i - 1][j] + mas[i][j - 1]\r\n ans = max(ans, mas[i][j])\r\nprint(ans)", "\r\ndef factorial(n):\r\n res = 1\r\n for i in range(1, n + 1):\r\n res *= i\r\n return res\r\n\r\nn = int(input())\r\nm = n - 1\r\nprint(factorial(2*m)// (factorial(m)**2))\r\n", "# LUOGU_RID: 94979670\nn=int(input())\r\n\r\nf=[[0]*(n) for _ in range(n)]\r\n\r\nfor i in range(n):\r\n for j in range(n):\r\n if i==0 or j==0:\r\n f[i][j]=1\r\n else:\r\n f[i][j]=f[i-1][j]+f[i][j-1]\r\nprint(f[-1][-1])\r\n", "n = int(input())\r\nl = [[1 for x in range(n)] for y in range(n)]\r\nfor i in range(1,n):\r\n for j in range(1,n):\r\n l[i][j] = l[i-1][j] + l[i][j-1]\r\nprint(l[n-1][n-1])", "m = [1, 2, 6, 20, 70, 252]\r\nn = int(input())\r\nif n <= 6:\r\n print(m[n - 1])\r\nelse:\r\n t = [[0 for _ in range(n)] for _ in range(n)]\r\n t[0] = [1] * n \r\n for i in range(n):\r\n t[i][0] = 1\r\n \r\n for i in range(1, n):\r\n for j in range(1, n):\r\n t[i][j] = t[i - 1][j] + t[i][j - 1]\r\n \r\n print(t[-1][-1])\r\n", "def max_v(n):\n a = [[0] * n for _ in range(n)]\n for i in range(n):\n a[i][0] = 1\n a[0][i] = 1\n max_v = 1\n for i in range(1,n):\n for j in range(1,n):\n a[i][j] = a[i-1][j] + a[i][j-1]\n max_v = max(max_v,a[i][j])\n return max_v\n\nn = int(input())\nprint(max_v(n)) \n\n\t\t\t\t\t \t \t \t\t\t\t \t\t\t\t \t \t \t\t", "n=int(input())\r\ntable=list()\r\nfor i in range(n):\r\n t=list()\r\n for j in range(n):\r\n if j==0 or i==0:\r\n t.append(1)\r\n else:\r\n x=table[i-1][j]+t[j-1]\r\n t.append(x)\r\n table.append(t)\r\nmaxi=list()\r\nfor k in table:\r\n maxi.append(max(k))\r\nprint(max(maxi))\r\n", "n = int(input())\nif n < 2:\n print(1)\nelse:\n arr = [[1 for _ in range(n)] for _ in range(n)]\n for i in range(1, n):\n for j in range(1, n):\n arr[i][j] = arr[i-1][j]+arr[i][j-1]\n print(arr[-1][-1])\n", "import math\r\n\r\nnumber = int(input())\r\nif number == 1:\r\n print(1)\r\nelse:\r\n n = 2*(number-1) - 1\r\n answer = math.factorial(n)//(math.factorial(n- (number-1))*math.factorial(number-1))\r\n print(answer*2)\r\n", "n=int(input())\r\nm=[]\r\nfor i in range(n):\r\n m1=[]\r\n for j in range(n):\r\n m1.append(0)\r\n m.append(m1)\r\np=[]\r\nfor i in range(n):\r\n for j in range(n):\r\n if i==0 or j==0:\r\n m[i][j]=1\r\n p.append(1)\r\n else:\r\n m[i][j]=m[i-1][j]+m[i][j-1]\r\n p.append(m[i][j])\r\nprint(max(p))", "n=int(input())\r\na=[]\r\n\r\nfor i in range(n):\r\n if i==0:\r\n a.append([1]*n)\r\n else:\r\n a.append([1]+[0]*(n-1))\r\n\r\nfor i in range(1,n):\r\n for j in range(1,n):\r\n a[i][j]=a[i][j-1]+a[i-1][j]\r\n\r\nprint(a[n-1][n-1])\r\n", "def answer():\r\n \r\n n= int(input())\r\n if n==1: return 1\r\n n-=1\r\n n*=2\r\n a=int(n/2)+n%2\r\n i=a+1\r\n fac_n=1\r\n while i<=n:\r\n fac_n*=i\r\n i+=1\r\n fac_a=1\r\n i=1\r\n while i<=a:\r\n fac_a*=i\r\n i+=1\r\n ans=int(fac_n/fac_a)\r\n return ans\r\nprint(answer())\r\n", "#7\r\n'''\r\nn, m = [int(i) for i in input().split()]\r\nturn = 'right'\r\nfor i in range(1, n+1):\r\n if i%2 == 1:\r\n print('#'*m)\r\n else:\r\n s = '.'*(m-1)\r\n if turn == 'right':\r\n print(s+'#')\r\n turn = 'left'\r\n elif turn == 'left':\r\n print('#'+s)\r\n turn = 'right'\r\n'''\r\n#8\r\n\r\nn = int(input())\r\nrows=[[1]*n for i in range(n)]\r\n\r\nfor i in range(1, n):\r\n row = rows[i]\r\n row2 = rows[i-1]\r\n for j in range(1, n):\r\n row[j] = row2[j]+row[j-1]\r\n\r\nprint(rows[n-1][n-1])\r\n", "num = int(input())\r\n\r\nanswer = 1\r\nnumer = 1\r\ndenom = 2\r\ndecimal = ((num-1)/2)+1\r\n\r\n\r\nif num == 2:\r\n answer = 2\r\nelse:\r\n for i in range(num-2):\r\n answer = num * decimal\r\n numer += 1\r\n denom += 1\r\n decimal = ((decimal-1) * (numer / denom)) + 1\r\n num = answer\r\nprint(round(answer))\r\n\r\n\r\n# 300%, 150%, 100%, 75%, 60%\r\n#\r\n# 1/2, 2/3, 3/4, 4/5\r\n\r\n\r\n", "n=int(input())\r\na=[1,2,6,20,70,252,924,3432,12870,48620]\r\nprint(a[n-1])", "n = int(input())\r\nt = list()\r\nt.append([1 for _ in range(n)])\r\n\r\nt.append([i + 1 for i in range(n)])\r\n\r\nfor i in range(n - 2):\r\n ll = list()\r\n for j in range(n):\r\n if j == 0:\r\n ll.append(1)\r\n continue\r\n ll.append(ll[-1] + t[-1][j])\r\n t.append(ll)\r\nfor i in t:\r\n m = max(i)\r\nprint(m)\r\n\r\n\r\n", "n = int(input())\r\n# n, m = map(int, input().split())\r\n# arr = sorted(list(map(int, input().split())))\r\n\r\ndata = [[0 for _ in range(n)] for _ in range(n)]\r\n\r\nfor i in range(n):\r\n data[0][i] = 1\r\n data[i][0] = 1\r\n\r\nfor i in range(1, n):\r\n for j in range(1, n):\r\n data[i][j] = data[i-1][j] + data[i][j-1]\r\n\r\nprint(data[-1][-1])", "n = int(input())\r\nrows = cols = n\r\narr = [[1]*cols]\r\nfor i in range(n-1):\r\n lst = []\r\n val = 0\r\n for j in range(0, n):\r\n val += arr[i][j]\r\n lst.append(val)\r\n arr.append(lst)\r\nprint(max(arr[n-1]))\r\n\r\n\r\n", "n=int(input())\r\na=[1]*n\r\nfor _ in range(1,n):\r\n for i in range(1,n):\r\n a[i]=a[i]+a[i-1]\r\n \r\nprint(max(a))", "n=int(input())\r\nif(n==1):\r\n print(1)\r\nelse:\r\n dp=[[1]*n for i in range(n)]\r\n for i in range(1,n):\r\n for j in range(1,n):\r\n dp[i][j]=dp[i-1][j]+dp[i][j-1]\r\n print(dp[n-1][n-1])\r\n", "n = int(input())\r\n\r\ndef get(row,col):\r\n if row == 1 or col == 1:\r\n return 1\r\n return get(row - 1,col) + get(row,col - 1)\r\n\r\nprint(get(n,n))", "n= int(input())\r\nmat=[[0 for i in range(n)]for _ in range(n)]\r\nfor k in range(n):\r\n mat[0][k]=1\r\n mat[k][0]=1\r\nif( n>=2): \r\n for u in range(1,n):\r\n for g in range(1,n):\r\n mat[g][u]=mat[g-1][u]+mat[g][u-1]\r\n\r\nprint(mat[n-1][n-1])\r\n", "n = int(input())\r\n\r\nn_1fac = 1\r\nn_2fac = 1\r\nfor x in range(1,n):\r\n n_1fac *=x\r\n \r\nn_2fac = n_1fac\r\nfor y in range(n,((2*n)-1)):\r\n n_2fac *= y\r\n\r\nprint(int(n_2fac/(n_1fac**2)))\r\n ", "n=int(input())\r\na = [list(range(1 + n * i, 1 + n * (i + 1)))for i in range(n)]\r\nfor i in range(n):\r\n\ta[i][0]=1\r\n\tfor j in range(n):\r\n\t\ta[0][j]=1\r\nfor i in range(0,n):\r\n\tfor j in range(0,n):\r\n\t\tif (i and j)>1 or (i and j)==1:\r\n\t\t\ta[i][j]=a[i-1][j]+a[i][j-1]\r\nprint(max(max(a)))", "n = int(input())\r\nA = [1,2,6,20,70,252,924,3432,12870,48620]\r\nprint(A[n-1])", "n = int(input())\nlst = [[0 for j in range(n)] for i in range(n)]\n\nfor i in range(n):\n lst[i][0] = 1\n\nfor j in range(n):\n lst[0][j] = 1\n\n\nfor i in range(1,n):\n for j in range(1, n):\n lst[i][j] = lst[i-1][j]+lst[i][j-1]\n\nprint(lst[-1][-1])", "number_of_rows_and_columns = int(input())\r\ntable = [[0] + [1] * number_of_rows_and_columns]\r\nfor i in range(number_of_rows_and_columns - 1):\r\n table.append([0])\r\n for j in range(1, number_of_rows_and_columns + 1):\r\n table[-1].append(table[-1] [j-1] + table[-2][j])\r\nprint(table[-1][-1])", "n = int(input())\narr = [[0]*n]*n\narr[0]= [1]*n\nfor i in range(n):\n arr[i][0]=1\n\nfor i in range(1,n):\n for j in range(1,n):\n arr[i][j]=arr[i-1][j]+arr[i][j-1]\n\nprint(arr[n-1][n-1])\n\n\t \t \t\t\t \t \t \t\t\t\t \t\t \t", "n = int(input())\nmyMatrix = [[0 for i in range(n)] for j in range(n)]\nfor i in range(0, n):\n myMatrix[i][0] = 1\n myMatrix[0][i] = 1\n\nfor i in range(1, n):\n for j in range(1, n):\n myMatrix[i][j] = myMatrix[i - 1][j] + myMatrix[i][j - 1]\n\nprint(myMatrix[n -1][n - 1])\n\n\n\n\n\n\t \t \t\t\t\t \t \t \t \t\t \t \t", "a = []\r\nn = int (input ())\r\nfor i in range (n):\r\n a.append ([1 for k in range (n)])\r\nfor i in range (1, n):\r\n for j in range (1, n):\r\n a[i][j] = a[i - 1][j] + a[i][j - 1]\r\nprint (a[-1][-1])", "n=int(input())\r\ntable=[]\r\nfor i in range(n):\r\n table.append([])\r\n for j in range(n):\r\n if i==0:\r\n table[0].append(1)\r\n elif j==0:\r\n table[i].append(1)\r\n else:\r\n ele=table[i-1][j]+table[i][j-1]\r\n table[i].append(ele)\r\nprint(table[n-1][n-1])\r\n\r\n", "n = int(input())\nl = [[1 for i in range(n)] for i in range(n)]\nfor i in range(1,n):\n for j in range(1,n):\n l[i][j] = l[i-1][j] + l[i][j-1]\nprint(l[-1][-1])\n# Mon Jul 03 2023 11:07:54 GMT+0300 (Moscow Standard Time)\n", "n = int(input())\r\nline0 = []\r\nfor i in range(n):\r\n line0.append(1)\r\n \r\nmatrix = []\r\nmatrix.append(line0) \r\n\r\nfor i in range(n-1):\r\n line_1 = []\r\n line_1.append(1)\r\n for j in range(n-1):\r\n line_1.append(line_1[-1]+matrix[-1][j+1])\r\n matrix.append(line_1) \r\nprint(matrix[-1][-1])\r\n ", "n=int(input())\ndp=[[-1]*n]*n\ndef f(i,j):\n if i==0 or j==0:\n return 1\n if dp[i-1][j-1]!=-1:\n return dp[i][j]\n return f(i-1,j)+f(i,j-1)\nprint(f(n-1,n-1))\n\n \t\t\t \t \t\t \t\t \t\t \t\t\t\t", "n = int(input())\r\ncount = 1\r\nfor i in range(1,n):\r\n count = int((2*count*(2*i-1))/i) \r\nprint(count)", "'''\r\n#1\r\nn, k = map(int,input().split())\r\na = list(map(int, input().split()))\r\nk1 = a[k-1]\r\nc = 0\r\nfor i in range(n):\r\n if a[i] > 0 and a[i] >= k1:\r\n c += 1\r\nprint(c)\r\n\r\n#2\r\ns = input().split('+')\r\n\r\nfor i in range(len(s)-1):\r\n for j in range(len(s)-i-1):\r\n if s[j] > s[j+1]:\r\n s[j], s[j+1] = s[j+1], s[j]\r\nprint('+'.join(s))\r\n\r\n#3\r\nn = int(input())\r\na = list(map(int,input().split()))\r\nmaxx, minn = a[0], a[0]\r\nk = 0\r\nfor i in range(len(a)):\r\n if a[i] > maxx:\r\n maxx = a[i]\r\n k += 1\r\n if a[i] < minn:\r\n minn = a[i]\r\n k += 1\r\nprint(k)\r\n\r\n#4\r\nn = int(input())\r\na = list(map(int, input().split()))\r\nmaxx = a[0]\r\ns = 0\r\nfor i in range(n):\r\n if maxx < a[i]:\r\n maxx = a[i]\r\nfor i in range(n):\r\n s += maxx-a[i]\r\nprint(s)\r\n\r\n#5\r\nn, c = map(int,input().split())\r\ns = 1\r\nt = list(map(int, input().split()))\r\nfor i in range(n-1):\r\n if t[i+1]-t[i] <= c:\r\n s += 1\r\n else:\r\n s = 1\r\nprint(s)\r\n\r\n#6\r\nm = [list(map(int, input().split()))for i in range(5)]\r\nindex_i = 0\r\nindex_j = 0\r\nfor i in range(5):\r\n for j in range(5):\r\n if m[i][j] == 1:\r\n index_i, index_j = i, j\r\nprint(abs(index_i-2) + abs(index_j-2))\r\n\r\n#7\r\nn, m = map(int, input().split())\r\ns = []\r\nfor i in range(n):\r\n a = []\r\n for j in range(m):\r\n a.append('.')\r\n s.append(a)\r\n\r\nfor i in range(n):\r\n if i % 2 == 0:\r\n s[i] = '#'*m\r\n else:\r\n if i % 4 == 1:\r\n s[i] = '.'*(m-1)+ '#'\r\n elif i % 4 == 3:\r\n s[i] = '#'+'.'*(m-1)\r\n \r\n \r\nfor i in range(n):\r\n print(*s[i], sep='')\r\n'''\r\n#8\r\nn = int(input())\r\na = []\r\nfor i in range(n):\r\n s = []\r\n for j in range(n):\r\n s.append(1)\r\n a.append(s)\r\nfor i in range(1,n):\r\n for j in range(1, n):\r\n a[i][j] = a[i-1][j]+a[i][j-1]\r\n \r\nprint(a[-1][-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", "n = int(input())\n\narr = [[0 for i in range(n)] for x in range(n)]\n\nfor i in range(n):\n for j in range(n):\n if i == 0 or j == 0:\n arr[i][j] = 1\n else:\n arr[i][j] = arr[i - 1][j] + arr[i][j - 1]\n\nprint(max([max(x) for x in arr]))\n", "print({'1':'1','2':'2','3':'6','4':'20','5':'70','6':'252','7':'924','8':'3432','9':'12870','10':'48620'}[input()])", "n = int(input())\r\nbox = []\r\nfor i in range(n) :\r\n temp = []\r\n for j in range(n) :\r\n if (i == 0 or j == 0):\r\n temp.append(int(1))\r\n else :\r\n temp.append(box[i-1][j] + temp[j-1])\r\n box.append(temp)\r\nprint(box[i][j])\r\n\r\n", "n=int(input())\r\ns=0\r\na=[[1]*n for i in range(n)]\r\nfor i in range(1,n):\r\n for j in range(1,n):\r\n a[i][j]=a[i-1][j]+a[i][j-1]\r\nfor i in range(n):\r\n for j in range(n):\r\n if a[i][j]>s:\r\n s=a[i][j]\r\nprint(s)", "# URL: https://codeforces.com/problemset/problem/509/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 = [[0] * n for _ in range(n)]\nfor i in range(n):\n a[0][i] = 1\nans = 1\nfor i in range(1, n):\n for j in range(n):\n if j == 0:\n a[i][j] = 1\n else:\n a[i][j] = a[i - 1][j] + a[i][j - 1]\n ans = max(ans, a[i][j])\nout(f\"{ans}\")\n", "def fun(n):\r\n\ta1=[]\r\n\tfor i in range(10):\r\n\t\ta1.append(1)\r\n\ta2=[]\r\n\tfor i in range(10):\r\n\t\ta2.append(sum(a1[:i+1]))\r\n\ta3=[]\r\n\tfor i in range(10):\r\n\t\ta3.append(sum(a2[:i+1]))\r\n\ta4=[]\r\n\tfor i in range(10):\r\n\t\ta4.append(sum(a3[:i+1]))\r\n\ta5=[]\r\n\tfor i in range(10):\r\n\t\ta5.append(sum(a4[:i+1]))\r\n\ta6=[]\r\n\tfor i in range(10):\r\n\t\ta6.append(sum(a5[:i+1]))\r\n\ta7=[]\r\n\tfor i in range(10):\r\n\t\ta7.append(sum(a6[:i+1]))\r\n\ta8=[]\r\n\tfor i in range(10):\r\n\t\ta8.append(sum(a7[:i+1]))\r\n\ta9=[]\r\n\tfor i in range(10):\r\n\t\ta9.append(sum(a8[:i+1]))\r\n\ta10=[]\r\n\tfor i in range(10):\r\n\t\ta10.append(sum(a9[:i+1]))\r\n\ta=[a1,a2,a3,a4,a5,a6,a7,a8,a9,a10]\r\n\tk=a[n-1]\r\n\treturn k[n-1]\r\nn=int(input())\r\nprint(fun(n))", "# import sys\r\n# sys.stdout = open('Codeforces/output.txt', 'w')\r\n# sys.stdin = open('Codeforces/input.txt', 'r')\r\n\r\nn = int(input())\r\nmat = []\r\nfor i in range(n):\r\n if i == 0:\r\n mat.append([1]*n)\r\n else:\r\n mat.append([1]+[0]*(n-1))\r\n\r\nfor i in range(1, len(mat)):\r\n zz = mat[i]\r\n for j in range(1, len(zz)):\r\n zz[j] = zz[j-1]+mat[i-1][j]\r\n\r\nprint(mat[n-1][n-1])", "#!/usr/bin/env python\n# coding: utf-8\n\n# In[23]:\n\n\nn=int(input())\n\nr=[1]*n\nm=[r]*n\n\nfor i in range(1,n):\n for j in range(1,n):\n m[i][j]=m[i-1][j]+m[i][j-1]\n\nprint(m[n-1][n-1]) \n\n\n# In[ ]:\n\n\n\n\n", "n = int(input())\r\nls1 = [1 for i in range(n)]\r\nfor i in range(n-1):\r\n ls2 = [1]\r\n for j in range(n-1):\r\n ls2 = ls2 +[ls1[j+1] + ls2[j]]\r\n ls1 = ls2\r\nprint(ls1[n-1])", "#!/usr/bin/env python3\n# -*- coding: utf-8 -*-\n\"\"\"\nCreated on Wed Mar 30 16:33:31 2022\n\n@author: ivcha\n\"\"\"\ndef elem(row,col):\n if row==1 or col==1:\n return 1\n return elem(row-1,col) + elem(row,col-1)\n\nn=int(input())\nprint(elem(n,n))\n\n\n", "n=int(input())\r\nf=[[1 for i in range(n)] for i in range(n)]\r\nfor i in range(1,n):\r\n for j in range(1,n):\r\n f[i][j]=f[i-1][j]+f[i][j-1]\r\nprint(f[n-1][n-1])", "n=int(input())\n\narr = [[0 for i in range(n)] for j in range(n)]\n\nfor i in range(n):\n arr[0][i]=1\n arr[i][0]=1\nfor i in range(1,n):\n for j in range(1,n):\n arr[i][j]=arr[i-1][j]+arr[i][j-1]\n\n\nprint(arr[n-1][n-1])\n\t\t \t\t \t\t \t\t\t\t \t \t \t\t", "n = int(input())\r\na = [ [ 0 for i in range(n) ] for j in range(n) ]\r\nfor i in range(n):\r\n for j in range(n):\r\n if i==0 or j==0:\r\n a[i][j] +=1\r\nfor i in range(n):\r\n for j in range(n):\r\n if i!=0 and j!=0:\r\n a[i][j] = a[i-1][j]+a[i][j-1]\r\nx= len(a)\r\nprint(a[x-1][x-1])\r\n", "\r\na=int(input())\r\nn=[1]*a\r\nnextt=[1]*a\r\nfor i in range(a-1): \r\n for j in range(1,a):\r\n nextt[j]=nextt[j-1]+n[j]\r\n n=nextt.copy()\r\n\r\nprint(max(nextt))\r\n\r\n\r\n\r\n", "n = int(input())\r\ndp = [[1] * n for _ in range(n)]\r\nfor i in range(1, n):\r\n\tfor j in range(1, n):\r\n\t\tdp[i][j] = dp[i][j - 1] + dp[i - 1][j]\r\nprint(dp[n - 1][n - 1])", "def t(r,c):\r\n if 1 in [r,c]:\r\n return 1\r\n else:\r\n return t(r-1,c)+t(r,c-1)\r\nn=int(input(''))\r\nprint(t(n,n))", "if __name__ == '__main__':\n n = int(input())\n\n i = 0\n\n arr = [[1]*n]*n\n for i in range(n):\n for j in range(n):\n if i+1 == 1 or j+1 == 1:\n arr[i][j] = 1\n else:\n arr[i][j] = arr[i-1][j] + arr[i][j-1]\n\n print(arr[n-1][n-1])\n\n\n\n\n\n", "n = int(input())\r\n\r\na = []\r\nb = []\r\n\r\nfor i in range(0,n):\r\n\tb.append(1)\r\n\r\na.append(b)\r\n\r\nfor i in range(1,n):\r\n\tb = [1]\r\n\r\n\tfor j in range(1,n):\r\n\t\tb.append(a[i-1][j] + b[j-1])\r\n\r\n\ta.append(b)\r\n\r\nprint(max(max(a)))", "n=int(input())\r\nrows=cols=n\r\narr=[[0]*cols]*rows\r\nfor i in range(0,cols):\r\n col = []\r\n for j in range(0,rows):\r\n if j==0 or i==0:\r\n arr[i][j]=1\r\n else:\r\n arr[i][j]=arr[i-1][j]+arr[i][j-1]\r\n\r\n\r\nprint(arr[rows-1][cols-1])\r\n\r\n", "def generate_max_table_value(n):\r\n table = [[1] * n for _ in range(n)] # Initialize the table with ones\r\n \r\n for i in range(1, n):\r\n for j in range(1, n):\r\n table[i][j] = table[i - 1][j] + table[i][j - 1] # Calculate value using the given formula\r\n \r\n return table[n - 1][n - 1] # Return the maximum value in the table\r\n\r\n# Read input\r\nn = int(input())\r\n\r\n# Calculate and print the maximum value in the n × n table\r\nprint(generate_max_table_value(n))\r\n", "n=int(input())\r\nl=[[0 if i!=0 else 1 for i in range(n)] if k!=0 else [1]*n for k in range(n)]\r\nfor i in range(1,n):\r\n for k in range(1,n):\r\n l[i][k]=l[i-1][k]+l[i][k-1]\r\nprint(l[-1][-1])\r\n", "n = int(input())\r\nl = []\r\nfor i in range(n):\r\n l.append([])\r\n for j in range(n):\r\n l[i].append(0)\r\n# print(l)\r\nfor i in range(n):\r\n l[i][0] = 1\r\n l[0][i]= 1\r\nfor i in range(1, n):\r\n for j in range(1, n):\r\n l[i][j] = l[i-1][j]+l[i][j-1]\r\nprint(l[n-1][n-1])", "n = int(input())\r\narr = [[1]*n]*n\r\nfor i in range(1,len(arr)):\r\n for j in range(1, len(arr)):\r\n arr[i][j] = arr[i-1][j]+arr[i][j-1]\r\nprint(arr[n-1][n-1])", "n=int(input())\r\nlst=[]\r\nlst1=[]\r\nfor i in range(1,n+1):\r\n lst.append(1)\r\nfor j in range(n-1):\r\n lst1.append(1)\r\n for k in range(n-1):\r\n lst1.append(lst1[k]+lst[k+1])\r\n lst=lst1\r\n lst1=[]\r\nprint(lst[-1])\r\n", "n = int (input ())\r\nmatrix = []\r\nfor i in range (n):\r\n row = []\r\n for j in range (n):\r\n if i == 0 or j == 0:\r\n row.append (1)\r\n else:\r\n row.append (row [-1] + matrix [-1] [j])\r\n matrix.append (row)\r\nprint (matrix [n - 1] [n - 1])", "n = int(input())\r\nrows, cols = (n, n)\r\nlst = [[0]*cols]*rows\r\nfor i in range(n):\r\n for j in range(n):\r\n if((i == 0) or (j == 0)):\r\n lst[i][j] = 1\r\n else:\r\n lst[i][j] = lst[i-1][j] + lst[i][j-1]\r\nprint(lst[n-1][n-1])", "n=int(input())\r\ntable = [[0 for x in range(n)] for x in range(n)]\r\nfor i in range(n):\r\n for j in range(n):\r\n if i == 0 :\r\n table[i][j] = 1\r\n else:\r\n table[i][j]=table[i-1][j]+table[i][j-1]\r\nprint(table[n-1][n-1])", "n=int(input())\r\nl=[1,2,6,20,70,252,924,3432,12870,48620]\r\nprint(l[n-1])\r\n", "import sys\r\n\r\ndef get_ints(): return map(int, sys.stdin.readline().strip().split())\r\ndef get_array(): return list(map(int, sys.stdin.readline().strip().split()))\r\ndef input(): return sys.stdin.readline().strip()\r\n\r\n\r\n# for _ in range(int(input())):\r\n \r\nn=int(input()) \r\n\r\n# l,r,g = get_ints()\r\n\r\nl=[[0 for i in range(0,n)] for j in range(0,n)]\r\n\r\nfor i in range(0,n):\r\n l[i][0]=1\r\n l[0][i]=1\r\n \r\nfor i in range(1,n):\r\n for j in range(1,n):\r\n l[i][j]=l[i-1][j]+l[i][j-1]\r\n\r\nprint(l[n-1][n-1])\r\n ", "#!/usr/bin/env python\n# -*- coding: utf-8 -*-\n#\n# suck.py\n# \n# Copyright 2022 hello\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\ndef elem(row, col):\n if row == 1 or col == 1:\n return 1\n return elem(row - 1, col) + elem(row, col - 1)\nn=int(input())\nprint(elem(n,n))\n\t\n\t\n", "n = int(input())\r\nmatrix = []\r\ni = 0\r\nwhile i < n:\r\n\tmatrix.append([])\r\n\tj = 0\r\n\twhile j< n:\r\n\t\tif i == 0:\r\n\t\t\tmatrix[i].append(1)\r\n\t\telif j == 0:\r\n\t\t\tmatrix[i].append(1)\r\n\t\telse:\r\n\t\t\tmatrix[i].append(matrix[i-1][j] + matrix[i][j-1])\r\n\t\tj += 1\r\n\r\n\ti += 1\r\nprint(matrix[-1][-1])", "a = int(input()) * 2 - 1\r\nq = [[1]]\r\nfor i in range(1, a + 1):\r\n w = [1] * (i + 1)\r\n for k in range(i + 1):\r\n if k != 0 and k != i:\r\n w[k] = q[i - 1][k - 1] + q[i - 1][k]\r\n q.append(w)\r\nprint (max(q[i - 1]))", "n = int(input())\na = [[0] * n for _ in range(n)]\nfor i in range(n):\n a[0][i] = a[i][0] = 1\nfor i in range(1, n):\n for j in range(1, n):\n a[i][j] = a[i - 1][j] + a[i][j - 1]\nprint(a[-1][-1])", "i = int(input())\r\nif i == 1:\r\n print(1)\r\nelif i == 2:\r\n print(2)\r\nelif i == 3:\r\n print(6)\r\nelif i == 4:\r\n print(20)\r\nelif i == 5:\r\n print(70)\r\nelif i == 6:\r\n print(252)\r\nelif i == 7:\r\n print(924)\r\nelif i == 8:\r\n print(3432)\r\nelif i == 9:\r\n print(12870)\r\nelse : print(48620)\r\n", "n = int(input())\r\ns1=[]\r\ns=[]\r\nfor i in range(n):\r\n for j in range(n):\r\n s1.append(0)\r\n s.append(s1)\r\n\r\n#print(s)\r\n\r\nfor i in range(n):\r\n for j in range(n):\r\n #print(s[i][j])\r\n if i!=0 and j!=0:\r\n s[i][j]=s[i-1][j]+s[i][j-1]\r\n elif i==0 and j!=0:\r\n s[i][j]=s[i][j-1]\r\n elif i!=0 and j==0:\r\n s[i][j]=s[i-1][j]\r\n elif i==0 and j==0:\r\n s[i][j]=1\r\n #print(s[i][j])\r\n\r\nprint(s[n-1][n-1])\r\n", "def matrix_max(row,column):\r\n\r\n if row == 1 or column == 1:\r\n return 1\r\n\r\n return matrix_max(row-1, column) + matrix_max(column-1, row)\r\n\r\nnum = int(input())\r\nprint(matrix_max(num,num))\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "arr = []\nn = input()\nn = int(n)\nfor i in range(n):\n array = []\n for h in range(n):\n if i == 0 or h == 0:\n array.append(1)\n else:\n array.append(array[h - 1 ] + arr[i - 1][h])\n arr.append(array)\nprint(arr[n -1][n -1])\n\t \t\t\t \t\t \t\t\t \t \t\t \t\t \t", "n=int(input())\r\nif n == 1 :\r\n print(1)\r\nelse : \r\n l=[1 for i in range(n)]\r\n \r\n l2=['' for i in range(n)]\r\n for j in range(n):\r\n l2=[1]+l2\r\n for i in range(1,n) :\r\n l2[i]=l[i]+l2[i-1]\r\n l=l2\r\n print(l2[n])", "n = int(input())\r\na = []\r\nb = []\r\nfor s in range(n):\r\n a.append(1)\r\n b.append(0)\r\ni = 0\r\nwhile i < n-1:\r\n\r\n b[0] = a[0]\r\n j = 1\r\n while j < n:\r\n b[j] = b[j-1] + a[j]\r\n j += 1\r\n a = b\r\n i += 1\r\nprint(a.pop())\r\n", "# Take input for n\r\nn = int(input())\r\n\r\n# Initialize the table with all ones\r\ntable = [[1] * n for _ in range(n)]\r\n\r\n# Fill in the table based on the given conditions\r\nfor i in range(1, n):\r\n for j in range(1, n):\r\n table[i][j] = table[i - 1][j] + table[i][j - 1]\r\n\r\n# Find and print the maximum value in the table\r\nmax_value = table[-1][-1]\r\nprint(max_value)", "def main():\r\n n = int(input())\r\n a = [[1]*n]*n\r\n \r\n for x in range(1, n):\r\n for y in range(1, n):\r\n a[x][y] = a[x-1][y] + a[x][y-1]\r\n \r\n print(max(max(a)))\r\n \r\n\r\nmain()", "n = int(input())\r\ntriangle = []\r\n\r\nfor i in range(n):\r\n triangle.append([1] + [0] * n)\r\n\r\nfor i in range(n):\r\n for j in range(n):\r\n triangle[i][j] = triangle[i-1][j] + triangle[i][j-1]\r\n\r\nprint(max(triangle[-1]))", "n = int(input())\r\nmat = [[1] * 10 for i in range(10)]\r\nfor i in range(1, 10):\r\n for j in range(1, 10):\r\n mat[i][j] = mat[i-1][j] + mat[i][j-1]\r\n\r\nprint(mat[n-1][n-1])", "a=int(input())\r\nif a==1:\r\n print(1)\r\nif a==2:\r\n print(2)\r\nif a==3:\r\n print(6)\r\nif a==4:\r\n print(20)\r\nif a==5:\r\n print(70)\r\nif a==6:\r\n print(252)\r\nif a==7:\r\n print(924)\r\nif a==8:\r\n print(3432)\r\nif a==9:\r\n print(12870)\r\nif a==10:\r\n print(48620)\n# Mon Jul 03 2023 12:39:56 GMT+0300 (Moscow Standard Time)\n", "import math\r\nn = int(input())\r\nprint(math.comb(2 * n - 2, n - 1))", "def fact(n):\r\n if n == 0 or n == 1:\r\n return 1\r\n res = 1\r\n for i in range(2, n+1):\r\n res*=i\r\n return res\r\n\r\nn = int(input())\r\nn = n + n - 1 - 1\r\nk = n // 2\r\nprint(int(fact(n)/(fact(k)*fact(n-k))))", "n = int(input())\n\narr = []\nrow1 = []\n# 1 1 1 1 => 0\n# 1 2 3 4\n# 1 3 6 10\n# 1 4 10 20\nfor i in range(n):\n for j in range(n):\n if j == 0:\n arr.append([1])\n continue\n if i == 0:\n arr[i].append(1)\n continue\n arr[i].append(arr[i-1][j] + arr[i][j - 1])\n\n\nprint(arr[n-1][n-1])\n\n# for i in range(n):\n# for j in range(n):\n# print(arr[i][j], end=' ')\n# print()\n\n\n# 4\n# 5 6 3 5\n# 1 2 7 8\n# 0 2 3 3\n# 6 2 3 1\n\n\n# i (row) = 1\n# j (col) = 2 - 1\n# 1 + 2\n\n\t \t \t\t\t\t \t\t \t\t \t \t\t \t", "n=int(input())\r\nlol=[]\r\nfor i in range(n):\r\n\tl=[]\r\n\tif i>0:\r\n\t\tfor j in range(n):\r\n\t\t\tif j>0:\r\n\t\t\t\tl.append(lol[i-1][j]+l[j-1])\r\n\t\t\telse:\r\n\t\t\t\tl.append(lol[i-1][0])\r\n\telse:\r\n\t\tfor j in range(n):\r\n\t\t\tl.append(1)\r\n\tlol.append(l)\r\nprint(lol[-1][-1])", "n = int(input())\r\n\r\narray = [[0 for x in range(n)] for y in range(n)]\r\n\r\nfor i in range(n):\r\n array[0][i] = 1\r\n array[i][0] = 1\r\n\r\nfor i in range(1, n):\r\n for j in range(1, n):\r\n array[i][j] = array[i-1][j] + array[i][j-1]\r\n\r\nprint(array[-1][-1])", "n = int(input())\r\na=[[0]*(n) for i in range(n)]\r\n#print(a)\r\nfor i in range(n):\r\n for j in range(n):\r\n if i==0 or j==0:\r\n a[0][j]=1\r\n a[i][0]=1\r\n else:\r\n a[i][j]=a[i-1][j]+a[i][j-1]\r\n \r\n \r\nprint(a[-1][-1])\r\n ", "n = int(input())\r\nif n == 1:\r\n print(1)\r\nelse:\r\n\r\n a = b = 1\r\n for i in range(1, n):\r\n a *= i\r\n for i in range(1, 2 * n - 1):\r\n b *= i\r\n print(int(b / a ** 2))\r\n\r\n", "n = int(input())\r\nrow = [1] * n\r\nfor _ in range(n-1):\r\n for i in range(1,n):\r\n row[i] += row[i-1]\r\nprint(row[-1])", "s=int(input())\r\nl=[[1 for i in range(s)] for i in range(s)]\r\nfor i in range(s):\r\n l[i][0]=1\r\nfor i in range(1,s):\r\n for j in range(1,s):\r\n l[i][j]=l[i-1][j]+l[i][j-1]\r\nprint(l[s-1][s-1])", "# https://codeforces.com/problemset/problem/509/A\r\n\r\nfrom collections import deque\r\n\r\nn = int(input())\r\n\r\nif n == 1:\r\n print(1)\r\nelse:\r\n q = deque(maxlen=n)\r\n\r\n for i in range(n - 1):\r\n q.append(1)\r\n\r\n for i in range(n - 1):\r\n temp = 1\r\n for k in range(n - 1):\r\n temp += q.popleft()\r\n q.append(temp)\r\n\r\n print(q.pop())\r\n", "import sys\r\nimport os\r\n\r\n\r\ndef changeStdioToFile():\r\n path = os.path.dirname(os.path.abspath(__file__))\r\n sys.stdin = open(f'{path}/input.txt', 'r')\r\n sys.stdout = open(f'{path}/output.txt', 'w')\r\n\r\n\r\n#changeStdioToFile()\r\nt = 1\r\n# t = int(input())\r\nfor _ in range(t):\r\n n = int(input())\r\n table = [[0] * n] * n\r\n for i in range(n):\r\n table[i][0] = 1\r\n table[0] = [1] * n\r\n for i in range(n):\r\n for j in range(n):\r\n if table[i][j] != 1:\r\n table[i][j] = table[i - 1][j] + table[i][j - 1]\r\n print(table[n-1][n-1])\r\n", "n=int(input())\r\nl=[]\r\nar=[1]*n\r\nl.append(ar)\r\nfor i in range(n-1):\r\n res=[1]\r\n for j in range(n-1):\r\n res.append(0)\r\n l.append(res)\r\nfor i in range(1,n):\r\n for j in range(1,n):\r\n l[i][j]=l[i][j-1]+l[i-1][j]\r\nprint(l[-1][-1])\r\n", "n = int(input())\r\n\r\ndef table (row, col):\r\n if (row == 1 or col == 1) :\r\n return 1\r\n \r\n return table(row-1, col) + table(row, col-1)\r\n \r\nprint(table(n,n))", "n = int(input())\nar = [[1]*n]*n\nfor i in range(1, n):\n for j in range(1, n):\n ar[i][j] = ar[i-1][j] + ar[i][j-1]\nprint(ar[n-1][n-1])", "n=int(input())\r\nx=[[1 if i==0 or j==0 else 0 for j in range(n)] for i in range(n)]\r\nfor i in range(1,n):\r\n\tfor j in range(1,n):\r\n\t\tx[i][j]=x[i-1][j]+x[i][j-1]\r\nprint(x[n-1][n-1])\t", "\r\ndef answer2(n):\r\n if n == 1:\r\n return 1\r\n elif n == 2:\r\n return 2\r\n elif n == 3:\r\n return 6\r\n elif n == 4:\r\n return 20\r\n elif n == 5:\r\n return 70\r\n \r\ndef answer(n):\r\n matrix = []\r\n for i in range(n):\r\n matrix.append([])\r\n \r\n for i in range(n):\r\n matrix[i] = [1 for j in range(n)]\r\n \r\n for i in range(1, n, 1):\r\n for j in range(1, n, 1):\r\n matrix[i][j] = matrix[i-1][j] + matrix[i][j-1]\r\n \r\n return matrix[n-1][n-1]\r\n\r\n\r\n\r\ndef main():\r\n n = int(input())\r\n \r\n print(answer(n))\r\n\r\n\r\nmain()", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\n\r\ndef maxim(n, m):\r\n if n == 1 or m == 1:\r\n return 1\r\n else:\r\n return maxim(n - 1, m) + maxim(n, m - 1)\r\n\r\nprint(maxim(n, n))", "def maxim(n,m):\r\n if n == 1 or m == 1:\r\n return 1\r\n return maxim(n-1,m)+maxim(n,m-1)\r\nn = int(input())\r\nprint(maxim(n,n))", "ans=[0,1,2,6,20,70,252,924,3432,12870,48620]\r\nprint(ans[int(input())])", "n = int(input())\r\ndef anon(x, y):\r\n if x == 1 or y == 1:\r\n return 1\r\n return anon(x - 1, y) + anon(x, y - 1)\r\nprint(anon(n, n))", "result = [1]\nT = int(input())\nn = T\nlis = [1,1,1,1,1,1,1,1,1,1,1]\nwhile(T!=0):\n lis[0] = 1\n for i in range(1,n):\n lis[i] = lis[i-1]+lis[i]\n result.append(lis[n-1])\n T-=1\nprint(result[n-1])", "# n = 5\n# 1\nn = int(input())\nboard = []\n\nfor i in range(n): # 0 ~ 4\n line = [1]\n for j in range(1, n): # 1 ~ 4\n if i == 0:\n line.append(1)\n else:\n line.append(board[i-1][j] + line[j - 1])\n board.append(line)\n\nprint(board[n-1][n-1])\n\n# 0 1 2\n# 0 1 1 1\n# 1 1 2 3\n# 2 1 3 6\n# 1 1 => 0 1 + 1 0\n# 1 2 => 0 2 + 1 1\n# n = 4\n# [[1, 1, 1, 1],\n# [1, 2, 3, 4],\n# [1, 3, 6, 10],\n# [1, 4, 10, 20]] 3 3\n\n \t \t\t\t\t\t\t\t \t\t\t\t \t\t \t \t\t\t", "n = int(input())\r\nls = []\r\nfor i in range(n):\r\n temp = []\r\n for j in range(n):\r\n if (i == 0 or j == 0):\r\n temp.append(1)\r\n else:\r\n temp.append(0)\r\n ls.append(temp)\r\n\r\nfor i in range(1 , n):\r\n for j in range(1 , n):\r\n ls[i][j] = ls[i-1][j] + ls[i][j-1]\r\nprint(ls[n-1][n-1])", "n = int(input())\r\narr = [1 for i in range(n)]\r\nfor i in range(n, 1, -1):\r\n lst = []\r\n for j in range(i - 1):\r\n if j == 0:\r\n lst.append(2 * arr[1])\r\n else:\r\n lst.append(lst[j-1] + arr[j+1])\r\n \r\n arr = lst\r\n \r\nprint(arr[0])\r\n", "n = int(input())\r\ntable = []\r\nfor i in range(n):\r\n row = []\r\n for j in range(n):\r\n if i == 0 or j == 0:\r\n row.append(1)\r\n else:\r\n row.append(row[j-1]+table[i-1][j])\r\n table.append(row)\r\nx = max(table)\r\nprint(max(x))\r\n", "def mp():return map(int,input().split())\r\ndef it():return int(input())\r\n\r\nn=it()\r\nm=[1]*n\r\na=[m]\r\nfor i in range(1,n):\r\n\tv=[1]\r\n\tfor j in range(1,n):\r\n\t\tv.append(v[-1]+a[i-1][j])\r\n\t\t# print(v)\r\n\ta.append(v)\r\nprint(a[-1][-1])", "n=int(input())\r\na=[[] for i in range (n)]\r\n##print(a)\r\nfor i in range (n):\r\n a[i].append(1)\r\n a[0].append(1)\r\na[0].pop(-1)\r\n##print(a)\r\nfor j in range (1,n):\r\n for i in range (1,n):\r\n a[i].append(a[i-1][j]+a[i][j-1])\r\nprint(max(max(a)))\r\n", "import math\r\na = int(input())\r\n\r\nprint(int(math.factorial(2*(a-1))/(math.factorial(a-1)**2)))", "n = int(input())\n\ntable = [[0 for i in range(n)] for j in range(n)]\n\n\nfor i in range(n): \n table[0][i] = 1\n\nfor i in range(1, n): \n table[i][0] = 1\n for j in range(1, n):\n table[i][j] = table[i-1][j] + table[i][j-1]\nprint(table[n-1][n-1])\n", "a=[100,1,2,6,20,70,252,924,3432,12870,48620]\r\nb=int(input())\r\nprint(a[b])", "n = int(input())\r\nif n == 1:\r\n print(1)\r\nelse:\r\n l = [[0]*n for i in range(n)]\r\n for i in range(n):\r\n for j in range(n):\r\n l[0][i] = 1\r\n l[i][0] = 1\r\n l[i][j] = l[i-1][j] + l[i][j-1]\r\n print(l[n-1][n-1])", "def tbl(n):\r\n a=[[1]*n if _==0 else [1]+[0]*(n-1) for _ in range(n)]\r\n for i in range(1,n):\r\n for j in range(1,n):\r\n a[i][j]=a[i-1][j]+a[i][j-1]\r\n return a[-1][-1]\r\nn=int(input())\r\nprint(tbl(n))", "x = int(input())\r\narray = [1] * x\r\nfor count in range(x - 1):\r\n for c in range(1, x , 1):\r\n array[c] = array[c - 1] + array[c]\r\nprint(array[x - 1])", "import sys\r\n\r\ninput = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\r\n\r\nn = int(input())\r\nl = [1] * n\r\ni = 2\r\nfor i in range(1, n):\r\n ans = list()\r\n ans.append(1)\r\n for j in range(1, n):\r\n an = ans[j - 1] + l[j]\r\n ans.append(an)\r\n l = ans\r\nprint(l[-1])\r\n", "n=int(input())\r\nif n==1:\r\n print(1)\r\nelse:\r\n l=[1 for i in range(n)]\r\n m=[1]\r\n for i in range(n-1):\r\n for j in range(1,n):\r\n m.append(m[-1]+l[j])\r\n l=m\r\n m=[1]\r\n print(l[-1])", "__author__ = 'shukkkur'\r\n\r\n\r\n'''\r\nA. Maximum in Table\r\nhttps://codeforces.com/problemset/problem/509/A\r\n'''\r\ndef increase(matrix, i, j):\r\n return matrix[i-1][j]+matrix[i][j-1]\r\n\r\nn = int(input())\r\n\r\n# construct the corresponding table \r\nmatrix = []\r\n\r\nfor i in range(1 ,n+1):\r\n temp = []\r\n for j in range(1, n+1):\r\n if j == 1 or i == 1:\r\n temp.append(1)\r\n else:\r\n temp.append(0)\r\n matrix.append(temp) \r\n\r\nfor i in range(1, n):\r\n for j in range(1, n):\r\n matrix[i][j] = increase(matrix, i,j)\r\n\r\nprint(matrix[n-1][n-1])\r\n ", "t = int(input())\r\ncases = [0, 1, 2, 6, 20, 70, 252, 924, 3432, 12870, 48620]\r\n\r\nprint(cases[t])\r\n", "n = int(input())\r\nmatrix = []\r\nfor i in range(n):\r\n matrix.append([1] * n)\r\n\r\nfor i in range(1, n):\r\n for j in range(1, n):\r\n matrix[i][j] = matrix[i-1][j] + matrix[i][j-1]\r\n\r\nprint(matrix[n-1][n-1])", "a = int(input())\r\nb = []\r\nd = []\r\nfor i in range(a):\r\n b.append(1)\r\nd.append(b)\r\nfor j in range(a-1):\r\n c = []\r\n for k in range(a):\r\n c.append(sum(d[j][0:k+1]))\r\n d.append(c)\r\nprint(d[-1][-1])", "n=int(input())\r\nr,c=n,n\r\ndef sum(r,c):\r\n if r==1 or c==1:\r\n return 1\r\n return sum(r-1,c)+sum(r,c-1)\r\nprint(sum(n,n))", "#!/usr/bin/env python3\n# coding:utf-8\n\nif __name__ == \"__main__\":\n n = int(input())\n s = [[0 for i in range(n)] for j in range(n)]\n for i in range(n):\n s[0][i] = 1\n s[i][0] = 1\n for i in range(1, n):\n for j in range(1, n):\n s[i][j] = s[i - 1][j] + s[i][j - 1]\n print(s[n - 1][n - 1])\n", "o=[1,2,6,20,70,252,924,3432,12870,48620]\r\nr=int(input())\r\nprint(o[r-1])", "inp = int(input())\r\narr = []\r\nfor x in range(inp):\r\n\trow = []\r\n\tfor y in range(inp):\r\n\t\tif(x == 0 or y == 0):\r\n\t\t\trow.append(1)\r\n\t\telse:\r\n\t\t\ti = arr[x-1][y]\r\n\t\t\tj = row[y-1]\r\n\t\t\trow.append(i+j)\r\n\tarr.append(row)\r\noutput = arr[inp-1][inp-1]\r\nprint(output)", "n = int(input())\r\na = []\r\nfor i in range(n):\r\n x = []\r\n for j in range(n):\r\n x.append(1)\r\n a.append(x)\r\ndel x\r\n\r\nfor i in range(1, n):\r\n for j in range(1, n):\r\n a[i][j] = (a[i-1][j] + a[i][j-1])\r\n \r\nprint(max(max(a)))\r\n", "n = int(input())\r\ns = [[1 for i in range(n)] for j in range(n)]\r\nfor i in range(1, n):\r\n for j in range(1, n):\r\n s[i][j] = s[i - 1][j] + s[i][j - 1]\r\nprint(s[n - 1][n - 1])", "n = int(input()) # n rows and cols\r\n# n = 5\r\n\r\nif n == 1:\r\n print(1)\r\nelse:\r\n # init matrix with def values\r\n mat = [[1]*n]\r\n for i in range(n-1):\r\n mat.append([1]+[0]*(n-1))\r\n\r\n # iterate over mat and when val = 0 \r\n # compute its proper val\r\n for i in range(1, n):\r\n for j in range(1, n):\r\n mat[i][j] = (mat[i-1][j]) + (mat[i][j-1])\r\n\r\n print(mat[n-1][n-1])\r\n", "n=int(input())\r\nrows, cols = (n, n)\r\narr=[]\r\nfor i in range(rows):\r\n col = []\r\n for j in range(cols):\r\n col.append(int(1))\r\n arr.append(col)\r\nfor i in range(1,n):\r\n for j in range(1,n):\r\n arr[i][j]=arr[i-1][j]+arr[i][j-1]\r\nprint(arr[n-1][n-1])", "n = int(input())\r\nlis = [[1]*n]*n\r\nfor i in range(1,n):\r\n for j in range(1,n):\r\n lis[i][j] = lis[i-1][j]+lis[i][j-1]\r\nprint(lis[n-1][n-1])", "n = int(input())\r\nanswer = 1\r\nfor i in range(1, n):\r\n answer = answer * (n + i - 1) // i \r\nprint(answer)\r\n", "n=int(input())\r\na=[[1]*n for s in range(n)]\r\nfor k in range(1,n):\r\n for j in range(1,n):\r\n a[k][j]=a[k-1][j]+a[k][j-1]\r\nprint(a[n-1][n-1])\r\n", "t=int(input())\r\nl=[[0]*t]*t\r\nfor i in range(t):\r\n for j in range(t):\r\n if i==0:\r\n l[i][j]=1\r\n elif j==0:\r\n l[i][j]=1\r\n else:\r\n l[i][j]=l[i-1][j]+l[i][j-1]\r\nprint(l[t-1][t-1])", "from math import factorial\r\n\r\nn = int(input())-1\r\n\r\nr = (factorial(2*n))//(pow(factorial(n),2))\r\n\r\nprint(r)", "def table(n, m):\r\n if n == 1 or m == 1:\r\n return 1\r\n return table(n - 1, m) + table(n, m - 1)\r\n \r\nnum = int(input())\r\n\r\n\r\nprint(table(num, num))", "k=[1]*10\r\npole=[]\r\npole.append(k)\r\na=int(input())\r\nfor x in range(1,10):\r\n k=[1]\r\n for y in range(1,10):\r\n k.append(k[y-1]+pole[x-1][y])\r\n pole.append(k)\r\nprint(pole[a-1][a-1])\r\n\r\n", "l=[]\r\nn=int(input())\r\nfor i in range(n):\r\n l.append([1,]*n)\r\nfor i in range(1,n):\r\n for j in range(1,n):\r\n l[i][j]=l[i-1][j]+l[i][j-1]\r\nprint(l[n-1][n-1])", "# Code by JohnXdator\r\nn = int(input())\r\na = [1] * n\r\nfor i in range(n - 1):\r\n for j in range(n - 1):\r\n a[j + 1] += a[j]\r\nprint(a[-1])", "n = int(input())\r\nlst = [[1]*n]\r\nfor i in range(n - 1):\r\n lst.append([1] + [0]*(n - 1))\r\nfor i in range(1, n):\r\n for j in range(1, n):\r\n lst[i][j] = lst[i - 1][j] + lst[i][j - 1]\r\nprint(lst[n-1][n-1])", "n = int(input())\r\nif n == 1:\r\n print(1)\r\nelse:\r\n a =[[0]*n for i in range(n)]\r\n for i in range(n):\r\n a[0][i], a[i][0] = 1, 1\r\n for i in range(1, n):\r\n for j in range (1, n):\r\n a[i][j] = a[i-1][j]+a[i][j-1]\r\n print(a[i][j])", "n = int(input())\r\n\r\ntable = list( [1]*n for _ in range(n) )\r\n\r\nfor i in range(1, n):\r\n for j in range(1, n):\r\n table[i][j] = table[i-1][j] + table[i][j-1]\r\n\r\nmax_value = table[n-1][n-1]\r\nprint(max_value)\r\n", "n = int(input())\ntable = [[0]*n]*n\ntable[0] = [1] * n\nfor i in range(n):\n table[i][0] = 1\nfor i in range(1,n):\n for j in range(1,n):\n table[i][j] = table[i-1][j]+table[i][j-1]\nprint(table[n-1][n-1])\n\n\n \t \t \t \t \t\t\t \t \t\t", "a = int(input())\r\nb = [[0 for i in range(a + 1)] for j in range(a + 1)]\r\nb[0][1] = 1\r\nfor i in range(1, a + 1):\r\n for j in range(1, a + 1):\r\n b[i][j] = b[i - 1][j] + b[i][j - 1]\r\nprint(b[a][a])\r\n", "from sys import stdin\r\nfrom math import factorial\r\ninp = stdin.readline\r\n\r\nn = int(inp())\r\nprint(factorial((n-1)*2)//(factorial(n-1)*factorial(n-1)))\r\n", "n=int(input())\r\na=[[1 for x in range(10)] for y in range(10)]\r\nfor i in range(1,10):\r\n for j in range(1,10):\r\n a[i][j]=a[i-1][j]+a[i][j-1]\r\nprint(a[n-1][n-1])", "a = int(input())\r\nif a == 1: print(1); exit(0)\r\nb = [1]*a\r\nmaxs = []\r\nfor i in range(a-1):\r\n u = []\r\n for i in range(len(b)):\r\n u.append(sum(b[i:]))\r\n else:\r\n maxs.append(max(u))\r\n b = u\r\nprint(maxs[-1])", "while True:\r\n try:\r\n n = eval(input())\r\n list0 = [[0for i in range(n)]for j in range(n)]\r\n if n == 1:\r\n print(1)\r\n else:\r\n list0[0][0] = list0[0][1] = list0[1][0] = 1\r\n for i in range(n):\r\n for j in range(n):\r\n if i == 0 and j == 0 or i == 0 and j == 1 or i == 1 and j == 0:\r\n continue\r\n list0[i][j] = list0[i - 1][j] + list0[i][j - 1]\r\n print(list0[n - 1][n - 1])\r\n except:\r\n break", "def build_matrix(n):\r\n if n == 1:\r\n return [[1]]\r\n else:\r\n prev = build_matrix(n-1)\r\n\r\n for i in range(n-1):\r\n if i == 0:\r\n prev[i].append(1)\r\n else:\r\n prev[i].append(prev[i][-1]+prev[i-1][-1])\r\n\r\n prev.append([])\r\n\r\n for i in range(n):\r\n if i == 0:\r\n prev[-1].append(1)\r\n else:\r\n prev[-1].append(prev[-1][-1]+prev[-2][i])\r\n return prev\r\n\r\n\r\ndef main():\r\n n = int(input())\r\n\r\n print(build_matrix(n)[-1][-1])\r\n \r\n \r\n \r\nmain()\r\n", "n = int(input())\r\nlistt = []\r\n\r\nfor i in range(n):\r\n a = [0]*n\r\n listt.append(a)\r\n a = []\r\n\r\nfor i in range(n):\r\n for j in range(n):\r\n if i == 0 or j == 0:\r\n listt[i][j] = 1\r\n else:\r\n listt[i][j] = listt[i-1][j] + listt[i][j-1]\r\n\r\nprint(listt[n-1][n-1])", "import sys\ninput = sys.stdin.readline\n\n'''\n\n'''\n\nn = int(input())\n\ndef pprint(table):\n for r in table:\n print(*r)\n\ndef build_table(n):\n table = [[0] * n for _ in range(n)]\n for r in range(n):\n for c in range(n):\n if r == 0 or c == 0:\n table[r][c] = 1\n \n for r in range(1, n):\n for c in range(1, n):\n table[r][c] = table[r-1][c] + table[r][c-1]\n\n #pprint(table)\n return table\n\nprint(build_table(n)[-1][-1])", "def main(k):\r\n res = 0\r\n arr = [[1 for i in range(k)] for j in range(k)]\r\n for i in range(1,k):\r\n for j in range(1, k):\r\n arr[i][j] = arr[i-1][j] + arr[i][j-1]\r\n for i in arr:\r\n for j in i:\r\n if res < j:\r\n res = j\r\n return res\r\n\r\n\r\nn = int(input())\r\n\r\nprint(main(n))", "def solve(n,x = -1):\r\n if x == -1:\r\n x = n\r\n if x ==1 or n==1:\r\n return 1\r\n up = solve(n-1,x)\r\n down = solve(n,x-1)\r\n return up + down\r\n\r\n# n , w = map(int,input().split())\r\nn = int(input())\r\n# l = []\r\n# for _ in range(n):\r\n# l.append(list(map(int,input().split())))\r\n# l = input()\r\nans = solve(n)\r\nprint(ans)", "R = lambda: map(int, input().split())\nprint([1, 2, 6, 20, 70, 252, 924, 3432, 12870, 48620][int(input()) - 1])\n", "import math\r\nn=int(input())\r\na=(2*n)-2\r\nb=n-1\r\nans=math.factorial(a)//(math.factorial(b)*math.factorial(b))\r\nprint(ans)", "n = int(input())\r\nx = [0,1,2,6,20,70,252,924,3432,12870,48620]\r\nprint(x[n])", "import math\r\nn = int(input())\r\nif n==1:\r\n print(1)\r\nelif n==2:\r\n print(2)\r\nelse:\r\n k = n*2-2\r\n print(math.comb(k,n-1))\r\n", "n = int(input())\r\nans = 0\r\na = [[0 for i in range(n)] for j in range(n)]\r\nfor i in range(n):\r\n\tfor j in range(n):\r\n\t\tif(i==0 or j==0):\r\n\t\t\ta[i][j] = 1\r\n\t\telse:\r\n\t\t\ta[i][j] = a[i-1][j] + a[i][j-1]\r\n\t\tans = max(ans,a[i][j])\r\n\r\nprint(ans)", "n = int(input())\r\nx = [1 for _ in range(n)]\r\nfor _ in range(n - 1):\r\n for i in range(1, n):\r\n x[i] = x[i] + x[i - 1]\r\nprint(x[-1])\r\n", "n = int(input())\r\nx = [[1]*n]\r\nfor i in range(1, n):\r\n x.append([1]+[0]*(n-1))\r\nans = max(x[0])\r\nfor r in range(1, n):\r\n for c in range(1, n):\r\n x[r][c]=x[r-1][c]+x[r][c-1]\r\n ans = max(x[r][c], ans)\r\n\r\nprint(ans)", "l = [[0 for i in range(10)] for j in range(10)]\r\nfor i in range(10):\r\n l[i][0] = 1\r\n l[0][i] = 1\r\n \r\nfor i in range(1,10):\r\n for j in range(1,10):\r\n l[i][j] = l[i-1][j] + l[i][j-1]\r\n \r\nn = int(input()) -1\r\nprint(l[n][n])", "n = int(input())\r\n\r\nl = [[1] * n] * n\r\n\r\nfor i in range(1,n) :\r\n for j in range(1,n) :\r\n l[i][j] = l[i][j-1] + l[i-1][j]\r\nprint(l[-1][-1])", "n=int(input())\r\np=[1, 2, 6, 20, 70, 252, 924, 3432, 12870, 48620, 184756, 705432, 2704156, 10400600, 40116600, 155117520, 601080390, 2333606220, 9075135300, 35345263800, 137846528820]\r\nprint(p[n-1])", "n=int(input())\r\na=[[0]*n for i in range(n)]\r\nfor i in range(n):\r\n for j in range(n):\r\n if i==0:\r\n a[0][j]=1\r\n if j==0:\r\n a[i][0]=1\r\n if i!=0 and j!=0:\r\n a[i][j]=a[i-1][j]+a[i][j-1]\r\nprint(a[n-1][n-1])\r\n ", "n = int(input())\r\nlis = [[1] for i in range(n)]\r\nlis[0] = [1] * n\r\ndef change(r, c):\r\n lis[r].append(lis[r-1][c] + lis[r][c-1])\r\nfor i in range(1, n):\r\n for c in range(1, n):\r\n change(i, c)\r\nprint(lis[n-1][n-1])\r\n", "n=int(input ())\nif(n==1):\n print (1)\nelse:\n x=[1]*(n-1)\n a=[]\n i=1\n while (i<n):\n for j in range (0,n-1):\n if(j==0):\n a.append(x[j]+1)\n else:\n a.append(x[j]+a[j-1])\n x=a\n a=[]\n i=i+1\n print (max(x))\n \n", "import sys\ndef ints(): return map(int, sys.stdin.readline().strip().split())\ndef strings(): return sys.stdin.readline().strip()\nN=int(input())\n\ndef elem(row, col):\n if row == 1 or col == 1:\n return 1\n return elem(row - 1, col) + elem(row, col - 1)\n\nprint(elem(N,N))\n\n\n\n\n\n", "n = int(input())\r\nl = [1] * n\r\nfor k in range(n-1):\r\n for i in range(n-1):\r\n l[i+1] = l[i] + l[i+1]\r\nprint(l[-1])", "n=int(input())\r\na=[]\r\nfor i in range(1,n+1):\r\n b=[]\r\n for j in range(1,n+1):\r\n if j==1 or i==1:\r\n b.append(1)\r\n else:\r\n b.append(b[j-2]+a[i-2][j-1])\r\n a.append(b)\r\nprint(a[n-1][n-1]) \r\n", "s = 0\r\ndef func(a,b):\r\n global s\r\n if a==1 or b==1:\r\n s = s + 1\r\n else:\r\n a = a - 1\r\n \r\n while b:\r\n func(a,b)\r\n b = b - 1\r\n return\r\n\r\n\r\nn = int(input())\r\nfunc(n,n)\r\nprint(s)\r\n\r\n\r\n", "n = int(input())\r\na = [1] * n\r\nfor _ in range(n - 1):\r\n for i in range(1, n):\r\n a[i] += a[i - 1]\r\nprint(a[-1])", "n = int(input())\narr2d = []\n\nfline = []\nfor i in range(n):\n fline.append(1)\n\narr2d.append(fline)\n\nfor i in range(1 , n):\n line = [1]\n for j in range(1 , n):\n line.append(line[j-1] + arr2d[i-1][j])\n arr2d.append(line)\n\nprint(arr2d[n-1][n-1])\n\t\t\t\t \t \t \t\t \t\t \t\t\t \t \t", "table = int(input())\nmatrix_row1 = []\nmatrix = []\nfor i in range(table):\n matrix_row1.append(1)\n\nmatrix.append(matrix_row1)\n\nfor i in range(1, table):\n matrix.append([1])\n for j in range(1, table):\n matrix[-1].append(matrix[i][j-1]+matrix[i-1][j])\nprint(matrix[-1][-1])", "import math\r\nn = int(input())\r\nx = math.factorial(2*(n-1)) \r\ny = (math.factorial(n-1))**2\r\nprint(x//y)", "n = int(input())\r\nt = []\r\n\r\nfor i in range(n):\r\n t.append([1]+[1]*n)\r\n\r\n\r\nfor i in range(1, n):\r\n for j in range(1, n):\r\n t[i][j] = t[i-1][j] + t[i][j-1]\r\n\r\nfor i in range(0, n):\r\n for j in range(0, n):\r\n a = 0\r\n for r in t:\r\n for i in r:\r\n if i > a:\r\n a = i\r\nprint(a)\r\n", "#def solve():\r\n\r\nn = int(input())\r\n #n,m =map(int, input().split())\r\n #a = list(map(int, input().split()))\r\nif n == 1:\r\n print(1)\r\n\r\nif n == 2:\r\n print(2)\r\n\r\nif n == 3:\r\n print(6)\r\n\r\nif n == 4:\r\n print(20)\r\n\r\nif n == 5:\r\n print(70)\r\n\r\nif n == 6:\r\n print(252)\r\n\r\nif n == 7:\r\n print(924)\r\n\r\nif n == 8:\r\n print(3432)\r\n\r\nif n == 9:\r\n print(12870)\r\n\r\nif n == 10:\r\n print(48620)\r\n\r\n\r\n\r\n#for _ in range(int(input())):\r\n # solve()\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "n = int(input())\nmatrix = [[0 for i in range(n)] for j in range(n)]\n\nfor i in range(n):\n for j in range(n):\n if i == 0 or j == 0:\n matrix[i][j] = 1\n\nfor i in range(n):\n for j in range(n):\n if matrix[i][j] == 0:\n matrix[i][j] = matrix[i - 1][j] + matrix[i][j - 1]\n\nprint(matrix[n - 1][n - 1])\n", "n=int(input())\r\nif n==1:\r\n print(1)\r\nelse:\r\n l=[]\r\n for i in range(n):\r\n l.append([0]*n)\r\n for i in range(n):\r\n l[0][i]=1\r\n l[i][0]=1\r\n for i in range(1,n):\r\n for j in range(1,n):\r\n l[i][j]=l[i-1][j]+l[i][j-1]\r\n print(l[n-1][n-1])", "def matrix(row,coloumn):\r\n if row==1 or coloumn==1:\r\n return 1\r\n else:\r\n return matrix(row-1,coloumn)+matrix(row,coloumn-1)\r\nn=int(input())\r\nprint(matrix(n,n))", "n=int(input())\r\narr=[[1] for i in range(n)]\r\nfor _ in range(n-1):\r\n arr[0].append(1)\r\n\r\nfor i in range(1,n):\r\n for j in range(1,n):\r\n x=arr[i-1][j]+arr[i][j-1]\r\n arr[i].append(x)\r\nprint(arr[-1][-1])", "d={1:1,2:2,3:6,4:20,5:70,6:252,7:924,8:3432,9:12870,10:48620}\r\nprint(d[int(input())])", "n, ans = int(input()), 1\r\na = [[1]*n]*n\r\n\r\n\r\ndef f(u, v):\r\n global a\r\n a[u][v] = a[u-1][v] + a[u][v-1]\r\n return a[u][v]\r\n\r\n\r\nfor x in range(1, n):\r\n for y in range(1, n):\r\n ans = max(ans, f(x, y))\r\n\r\nprint(ans)", "# LUOGU_RID: 97909998\nfrom math import factorial as fac\nn = int(input())\nprint(fac(2 * n - 2) // fac(n - 1) // fac(n - 1))", "n = int (input ())\nL =[]\nfor i in range (n):\n sml = []\n for j in range (n):\n if i == 0 or j == 0:\n sml .append(1)\n else :\n sml .append (sml[-1] + L[i-1][j])\n L . append(sml)\nprint (L[n-1][n- 1])\n\n\t\t\t\t \t \t \t \t\t \t\t\t\t\t \t \t\t \t", "from math import factorial as f\r\n\r\nn = int(input())\r\n\r\nprint(f(2*(n-1))//(f(n-1)**2))", "n=int(input())\r\nli=[[0]*n]*n\r\nli[0]=[1 for i in range(n)]\r\nfor i in range(n):\r\n li[i][0]=1\r\nfor i in range(1,n):\r\n for j in range(1,n):\r\n li[i][j]=li[i-1][j]+li[i][j-1]\r\nm=[]\r\nfor i in li:\r\n m.append(max(i))\r\nprint(max(m))", "n=int(input())\r\nlst=[]\r\nfor i in range(0,n):\r\n rowlst=[]\r\n for j in range(0,n):\r\n if i==0 or j==0:\r\n rowlst.append(1)\r\n else:\r\n rowlst.append(lst[i-1][j]+rowlst[j-1])\r\n lst.append(rowlst)\r\nmainlst=[]\r\nfor i in lst:\r\n mainlst+=i\r\nprint(max(mainlst))\r\n ", "t = int(input())\r\nfrom math import factorial\r\nn = t-1\r\nprint (int(factorial(2*(n))/(factorial(n) * factorial(n))))", "def solve(n):\r\n table = [[0] * (n + 1) for _ in range(n + 1)]\r\n for i in range(1, n + 1):\r\n table[i][1] = 1\r\n table[1][i] = 1\r\n for i in range(2, n + 1):\r\n for j in range(2, n + 1):\r\n table[i][j] = table[i - 1][j] + table[i][j - 1]\r\n return table[n][n]\r\n\r\nn = int(input().strip())\r\nprint(solve(n))\r\n", "n = int(input())\r\nmt = [[0 for i in range(n)] for j in range(n)]\r\nif n == 1:\r\n print(1)\r\nelse:\r\n for i in range(n):\r\n mt[0][i] = 1\r\n for j in range(n):\r\n for k in range(n):\r\n mt[j][k] = mt[j-1][k] + mt[j][k-1]\r\n print(mt[-1][-1])\r\n \r\n", "n = int(input())\r\nlst = [1] * n\r\nfor _ in range(n-1):\r\n ng = [1]\r\n for i in range(1, n):\r\n ng.append(ng[-1] + lst[i])\r\n lst = ng\r\nprint(max(lst))", "n = int(input())\r\na = [[0, 0, 0, 0, 0, 0, 0, 0, 0, 0], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0],\r\n [0, 0, 0, 0, 0, 0, 0, 0, 0, 0], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0],\r\n [0, 0, 0, 0, 0, 0, 0, 0, 0, 0], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0],\r\n [0, 0, 0, 0, 0, 0, 0, 0, 0, 0]]\r\nfor i in range(n):\r\n a[i][0] = 1\r\n a[0][i] = 1\r\nfor j in range(1, n):\r\n for k in range(1, n):\r\n a[j][k] = a[j][k - 1] + a[j - 1][k]\r\nprint(int(max(a[n - 1])))", "n = int(input())\nL = []\nfor i in range(n):\n ls = []\n for j in range(n):\n if i == 0 or j == 0:\n ls.append(1)\n else:\n ls.append(ls[-1] + L[i-1][j])\n L.append(ls)\nprint(L[-1][-1])\n\n\n\n\n \t \t \t\t \t\t \t\t\t\t\t\t\t\t", "dp=[]\r\nfor i in range(10):\r\n l=[]\r\n for j in range(10):\r\n l.append(0)\r\n dp.append(l)\r\nfor i in range(10):\r\n dp[i][0]=1\r\n dp[0][i]=1\r\nn=int(input())\r\nfor i in range(1,n):\r\n for j in range(1,n):\r\n dp[i][j]=dp[i-1][j]+dp[i][j-1]\r\nprint(dp[n-1][n-1])\r\n \r\n", "a=int(input())\r\ndp=[[0 for i in range(a+1)]for j in range(a+1)]\r\n#print(dp)\r\nfor i in range(a+1):\r\n for j in range(a+1):\r\n if j ==0:\r\n dp[i][j]=0\r\n elif i==0:\r\n dp[i][j]=0\r\n elif i==1:\r\n dp[i][j]=1\r\n else:\r\n dp[i][j]=(dp[i][j-1])+(dp[i-1][j])\r\nprint(dp[-1][-1])\r\n \r\n", "# Copyright (c) 2022. Oskar \"Bocian\" Możdżeń\r\n# All rights reserved.\r\n\r\nn = int(input())\r\n\r\narr = [[0 for _ in range(n)] for _ in range(n)]\r\nfor i in range(n):\r\n for j in range(n):\r\n if i == 0:\r\n arr[i][j] = 1\r\n elif j == 0:\r\n arr[i][j] = 1\r\n else:\r\n arr[i][j] = arr[i - 1][j] + arr[i][j - 1]\r\n\r\n\r\nprint(arr[-1][-1])", "num = int(input())\r\n\r\nlist = []\r\ncounter = 0\r\ntest = -1\r\n\r\nfor i in range(num):\r\n column = []\r\n for j in range(num):\r\n if counter == 0:\r\n column.append(1)\r\n else:\r\n if j == 0:\r\n column.append(1)\r\n else:\r\n column.append(column[j-1] + list[test][j])\r\n list.append(column)\r\n counter = counter + 1\r\n test = abs(test + 1) \r\n \r\n\r\nprint(list[num-1][num-1])", "n = int(input())\r\nlist1 = []\r\nfor i in range(n):\r\n list1.append([1]*n)\r\nfor i in range(1, n):\r\n for j in range(1, n):\r\n list1[i][j] = list1[i-1][j]+list1[i][j-1]\r\nprint(list1[n-1][n-1])", "n = int(input())\r\ngrid = [[\"\"]*n for i in range(n)]\r\n\r\nfor i in range(n):\r\n for j in range(n):\r\n if i == 0 or j == 0 :\r\n grid[i][j] = 1\r\n else:\r\n grid[i][j] = grid[i][j-1] + grid[i-1][j] \r\n\r\nprint(grid[-1][-1])\r\n\r\n\r\n", "# Maximum in Table\r\nn = int(input())\r\nx = []\r\nprev1 = 1\r\nfor i in range(n):\r\n y = []\r\n for j in range(n):\r\n if i == 0 or j == 0:\r\n y += [1]\r\n elif i == j:\r\n prev1 = x[i-1][j]\r\n y += [prev1*2]\r\n else:\r\n y += [y[j-1]+x[i-1][j]]\r\n x += [y]\r\nprint(x[n-1][n-1])", "n = int(input())\r\nnums = [[] for i in range(n)]\r\n\r\n\r\nfor i in range(n):\r\n for j in range(n):\r\n if i == 0 or j == 0:\r\n nums[i].append(1)\r\n else:\r\n nums[i].append(nums[i - 1][j] + nums[i][j - 1])\r\n\r\n\r\nprint(nums[n - 1][n - 1])\r\n\r\n\r\n\r\n\r\n\r\n", "n = int(input())\nlst = [[0 for x in range(n)] for y in range(n)]\nfor i in range(n):\n for j in range(n):\n if(i==0 or j==0):\n lst[i][j]=1\n else:\n lst[i][j] = lst[i-1][j] + lst[i][j-1]\n\nprint(lst[n-1][n-1])", "# 4A\n# if __name__ == '__main__':\n# w = int(input())\n# if w > 2 and (w & 1) == 0:\n# print(\"YES\")\n# else:\n# print(\"NO\")\n\n# 263A\n# if __name__ == '__main__':\n# mat = []\n# for i in range(5):\n# row = list(map(int, input().strip().split()))\n# mat.append(row)\n# x, y = -1, -1\n# for i in range(5):\n# for j in range(5):\n# if mat[i][j] == 1:\n# x, y = i + 1, j + 1\n# break\n# if x != -1 and y != -1:\n# break\n# res = abs(x - 3) + abs(y - 3)\n# print(res)\n\nif __name__ == '__main__':\n n = int(input())\n dp = [[0] * n for _ in range(n)]\n for i in range(n):\n dp[i][0] = 1\n for j in range(n):\n dp[0][j] = 1\n for i in range(1, n):\n for j in range(1, n):\n dp[i][j] = dp[i - 1][j] + dp[i][j - 1]\n print(dp[n - 1][n - 1])", "n=int(input())\r\nans=1\r\nfor i in range(1,n):\r\n ans*=(n+i-1)\r\nfor i in range(1,n):\r\n ans//=i\r\n\r\nprint(ans)\r\n \r\n", "n=int(input())\r\ntab=[[0 for i in range(n)] for i in range(n)]\r\ntab[0]=[1 for i in range(n)]\r\nfor i in tab:\r\n i[0]=1\r\nfor i in range(1,n):\r\n for j in range(1,n):\r\n tab[i][j]=tab[i-1][j]+tab[i][j-1]\r\nprint(tab[n-1][n-1])", "n=int(input())\r\n\r\na=[[]]\r\nfor i in a:\r\n for j in range(n):\r\n i.append(1)\r\nfor i in range(n-1):\r\n z=[0]*n\r\n a.append(z)\r\nfor i in range(len(a)):\r\n a[i][0]=1\r\nfor i in range(1,n):\r\n for j in range(1,n):\r\n a[i][j]=a[i][j-1]+a[i-1][j]\r\nans=0\r\nfor i in a:\r\n ans=max(ans,max(i))\r\nprint(ans)\r\n\r\n", "n = int(input())\r\n\r\narr = []\r\n\r\nfor i in range(0, n):\r\n\tarr.append([])\r\n\tarr[0].append(1)\r\n\r\n\tif i != 0:\r\n\t\tarr[i].append(1)\r\n\r\n\r\nfor i in range(1, n):\r\n\tfor j in range(1, n):\r\n\t\tarr[i].append(arr[i-1][j] + arr[i][j-1])\r\n\r\nprint(arr[n-1][n-1])", "\"\"\"\nhttps://codeforces.com/problemset/problem/509/A\n\"\"\"\n\nn = int(input())\n\n\ntable = dict()\nfor j in range(1, n + 1):\n table[(1, j)] = 1\nfor i in range(2, n + 1):\n table[(i, 1)] = 1\nfor i in range(2, n + 1):\n for j in range(2, n + 1):\n table[(i, j)] = table[(i - 1, j)] + table[(i, j - 1)]\n\nprint(table[(n, n)])\n", "n = int(input())\r\n\r\ntable = []\r\nfor i in range(n):\r\n row = []\r\n for j in range(n):\r\n if i == 0 or j == 0:\r\n row.append(1)\r\n else:\r\n row.append(table[i - 1][j] + row[j - 1])\r\n table.append(row)\r\n\r\nprint(table[-1][-1])\r\n", "n = int(input())\r\n\r\nif n == 1:\r\n print(n)\r\nelse:\r\n n -= 1\r\n x = 1\r\n for i in range(n):\r\n x = (x + int(i / (i+1) * x)) * 2\r\n print(x)\r\n", "n = int(input())\r\ns = []\r\n\r\nfor i in range(n):\r\n if i == 0:\r\n s.append([1]*n)\r\n else:\r\n s1 = [1]\r\n for j in range(1,n):\r\n s1.append(s1[j-1]+s[i-1][j])\r\n s.append(s1)\r\n\r\nprint(s[n-1][n-1])", "def solve(n):\r\n dp = [[0 for i in range(n+1)] for i in range(n+1)]\r\n\r\n for i in range(n+1):\r\n for j in range(n+1):\r\n if(i == 1 or j == 1):\r\n dp[i][j] = 1\r\n else:\r\n dp[i][j] = dp[i-1][j] + dp[i][j-1]\r\n \r\n return dp[n][n]\r\n \r\nn = int(input())\r\nprint(solve(n))", "def fn(i,j):\r\n if i==1 or j==1:\r\n return 1\r\n else:\r\n return fn(i-1,j)+fn(i,j-1)\r\n\r\nn = int(input())\r\nprint(fn(n,n))", "n=int(input())\r\nmat=[]\r\nfor i in range(n):\r\n l=[1]*n\r\n for j in range(1,n):\r\n if i==0:\r\n l[j]=1\r\n else:\r\n l[j]=mat[i-1][j]+l[j-1]\r\n #print(mat)\r\n mat.append(l)\r\nprint(mat[-1][-1])\r\n", "print([1, 2, 6, 20, 70, 252, 924, 3432, 12870, 48620][int(input())-1])", "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\r\n# from functools import cmp_to_key\r\n\r\n\r\nn=int(input())\r\ng=[[0]*n for i in range(n)]\r\nfor i in range(n):\r\n g[0][i]=g[i][0]=1\r\nfor i in range(1,n):\r\n for j in range(1,n):\r\n g[i][j]=g[i-1][j]+g[i][j-1]\r\nprint(g[n-1][n-1])", "n = int(input())\r\nr = []\r\nl = []\r\nfor x in range(n):\r\n l.append(1)\r\nr.append(l)\r\nfor y in range(n-1):\r\n l = []\r\n for x in range(n):\r\n count = 0\r\n if x == 0:\r\n l.append(1)\r\n count += 1\r\n else:\r\n count += 1\r\n a = l[x-1] + r[len(r)-1][x]\r\n l.append(a)\r\n r.append(l)\r\nprint(r[n-1][n-1])", "def m(n):\r\n a=[[0]*n]*n\r\n a[0]=[1]*n\r\n for i in range(n):a[i][0]=1\r\n for i in range(1, n):\r\n for u in range(1, n):\r\n a[i][u]=a[i-1][u]+a[i][u-1]\r\n print(a[n-1][n-1])\r\nn=int(input())\r\nif n==1: print(1)\r\nelse: m(n)\r\n", "def solve(n):\r\n row = [1] * n\r\n for i in range(1,n):\r\n precol = 1\r\n for j in range(1,n):\r\n row[j] = row[j] + precol\r\n precol = row[j]\r\n print(row[n-1])\r\nn = int(input())\r\nsolve(n)\r\n", "def solve(x,x1):\r\n for i in range(1,len(x)):\r\n x[i]=x[i]+x[i-1]\r\n mx=max(x)\r\n if x1+1!=len(x) and len(x)>1:\r\n solve(x,x1+1)\r\n else:\r\n print(mx)\r\n return 0\r\nif __name__=='__main__':\r\n a=int(input())\r\n massive=[]\r\n summa=1\r\n for i in range(a):\r\n massive.append(1)\r\n solve(massive,summa)\r\n", "n=int(input())\r\nlist1=[[0]*n]*n\r\nfor i in range(n):\r\n for j in range(n):\r\n if i==0:\r\n list1[i][j]=1\r\n elif j==0:\r\n list1[i][j]=1\r\n else:\r\n list1[i][j]=list1[i-1][j]+list1[i][j-1]\r\nprint(list1[n-1][n-1])", "n=int(input())\r\na=[]\r\nfor i in range(n):\r\n b=[0]*n\r\n a.append(b)\r\nfor i in range(n):\r\n a[0][i]=1\r\n a[i][0]=1\r\nfor i in range(1,n):\r\n for j in range(1,n):\r\n a[i][j]=a[i-1][j]+a[i][j-1]\r\nprint(a[-1][-1])", "n = int(input())\r\nc = []\r\nfor i in range(n):\r\n a = []\r\n for j in range(n):\r\n a.append(1)\r\n c.append(a)\r\nfor i in range(1, n):\r\n for j in range(1, n):\r\n c[i][j] = (c[i-1][j]) + (c[i][j-1])\r\nx = c[n-1][n-1]\r\nprint(x)", "n = int(input())\r\ndata = [[1] * n]\r\ndata += [[0] * n for _ in range(n - 1)]\r\n\r\ngreatest = 1\r\nfor i in range(1, n):\r\n data[i][0] = 1\r\n for j in range(1, n):\r\n data[i][j] = data[i - 1][j] + data[i][j - 1]\r\n if data[i][j] > greatest:\r\n greatest = data[i][j]\r\n\r\nprint(greatest)\r\n", "n=int(input())\nmatrix=[]\nl=[]\nfor i in range(n):\n new=[]\n for j in range(n):\n new.append(1)\n matrix.append(new)\n\nif len(matrix)==1:\n print(1)\n exit(0)\n\nfor i in range(n):\n if i==0:\n continue\n for j in range(n):\n if j==0:\n continue\n matrix[i][j]=matrix[i-1][j]+matrix[i][j-1]\n l.append(matrix[i][j])\n \n \nprint(max(l))\n\n\n\n \t\t \t\t \t\t\t \t \t\t \t \t", "def fun(n):\r\n matrix = [ [ 1 for i in range(n) ] for j in range(n) ]\r\n for i in range(1,n):\r\n for j in range(1,n):\r\n matrix[i][j]=matrix[i-1][j]+matrix[i][j-1]\r\n print(matrix[n-1][n-1])\r\n \r\n \r\n \r\n\r\n \r\n\r\nfor _ in range(1):\r\n n=int(input())\r\n fun(n)", "n=int(input())\r\nb=[]\r\nfor i in range(1,n+1):\r\n a=[]\r\n for j in range(1,n+1):\r\n if i==1 or j==1:\r\n m=1\r\n else:\r\n m=b[i-2][j-1]+a[j-2]\r\n #print('i,j=',i,j)\r\n a.append(m)\r\n #print(a)\r\n b.append(a)\r\n #print('b=',b)\r\nprint(b[n-1][n-1])", "n=int(input())\r\nlst=[[1]*n]*n\r\nfor i in range(1,n):\r\n for j in range(1,n):\r\n lst[i][j]=lst[i][j-1]+lst[i-1][j]\r\nprint(max(max(lst)))", "import math \r\nn = int(input())\r\nprint((math.factorial(2 * (n - 1))) // ((math.factorial((n - 1))) ** 2))", "order = int(input()) \n\nt = [[1] * order] + [[1] + [0] * (order - 1) for _ in range(order - 1)]\n\nfor ii in range(1, order):\n for j in range(1, order):\n t[ii][j] = t[ii - 1][j] + t[ii][j - 1]\n\nmax_value = max(t[order - 1])\n\nprint(max_value)\n \t \t\t \t\t \t\t \t\t\t \t\t \t \t\t", "n = int(input())\n\nmatrix = []\nfor x in range(n):\n arr = []\n for y in range(n):\n if x == 0 or y == 0:\n arr.append(1)\n else:\n arr.append(matrix[x-1][y] + arr[y-1])\n matrix.append(arr)\n\nprint(matrix[n-1][n-1])\n \t\t\t\t\t \t\t \t\t \t \t \t \t\t\t\t", "n = int(input())\nm = [[0]*n] * n\nm[0] = [1] * n\nfor i in range(n):\n m[i][0] = 1\nfor i in range(1, n):\n for j in range(1, n):\n m[i][j] = m[i-1][j] + m[i][j-1]\nprint(m[-1][-1])\n \t \t\t \t \t\t \t \t \t \t \t\t", "import sys\r\n\r\nn = int(sys.stdin.readline().split()[0])\r\n\r\na = [[0 for x in range(n)] for y in range(n)]\r\n\r\nfor x in range(n):\r\n a[0][x] = 1\r\n\r\nfor row in range(1, n):\r\n for column in range(n):\r\n if column == 0:\r\n a[row][column] = a[row - 1][column]\r\n else:\r\n a[row][column] = a[row - 1][column] + a[row][column - 1]\r\n\r\nprint(max(max(a)))", "n=int(input())\r\nl=[[] for i in range(n)]\r\nfor i in range(n):\r\n for j in range(n):\r\n if i==0 or j==0:\r\n l[i].append(1)\r\n else:\r\n l[i].append(l[i-1][j]+l[i][j-1])\r\nm=0\r\nfor i in l:\r\n if max(i)>m:\r\n m=max(i)\r\nprint(m)", "n=int(input())\r\na=[[1]*n]*n\r\nfor i in range(1,len(a)):\r\n for j in range(1,len(a[1])):\r\n a[i][j]=a[i-1][j]+a[i][j-1]\r\nprint(a[-1][-1])", "n = int(input())\r\nmatrix = [[1 for i in range(n)] for j in range(n)]\r\nfor i in range(1,n):\r\n for j in range(1,n):\r\n matrix[i][j] = matrix[i-1][j]+matrix[i][j-1]\r\nprint(matrix[n-1][n-1])", "n=int(input())\r\nl1=[]\r\nl2=[]\r\nif n==1:\r\n print(1)\r\nelse:\r\n for i in range(n):\r\n l1.append(1)\r\n a = 1\r\n while a < n:\r\n l2 = [1]\r\n for i in range(n - 1):\r\n l2.append(l1[i + 1] + l2[i])\r\n l1 = l2\r\n a += 1\r\n print(l2[-1])\r\n\r\n", "n = int(input())\n\narr = [[0] * n] * n\n\nfor j in range(n):\n arr[0][j] = 1\n\nfor i in range(1 , n):\n arr[i][0] = 1\n for j in range(1 , n):\n arr[i][j] = arr[i - 1][j] + arr[i][j - 1]\n\nprint(arr[n-1][n-1])\n\t\t\t \t\t \t\t\t\t\t\t \t \t \t \t", "n=int(input())\r\n\r\nrows, cols = (n, n) \r\narr=[] \r\nfor i in range(cols): \r\n col = [] \r\n for j in range(rows): \r\n col.append(0) \r\n arr.append(col)\r\n \r\nfor i in range(n):\r\n arr[i][0]=1\r\n arr[0][i]=1\r\n \r\nfor i in range(1,n):\r\n for j in range(1,n):\r\n arr[i][j]=arr[i-1][j]+arr[i][j-1]\r\n\r\nprint(arr[n-1][n-1])\r\n", "n = int(input())\r\narr = [[1 for _ in range(n)]for _ in range(n)]\r\nfor i in range(1,n):\r\n for j in range(1,n):\r\n arr[i][j] = arr[i-1][j] + arr[i][j-1]\r\nprint(arr[n-1][n-1])", "n = int(input())\n\n# Initialize the table\ndp = [[1 for j in range(n)] for i in range(n)]\n\n# Fill up the table\nfor i in range(1, n):\n for j in range(1, n):\n dp[i][j] = dp[i-1][j] + dp[i][j-1]\n\n# Output the maximum element\nprint(dp[n-1][n-1])\n\n\t\t \t \t\t\t\t \t\t\t \t \t\t\t \t\t \t", "n=int(input())\nA=[[1 for i in range(n)]for i in range(n)]\nfor i in range(1,n):\n for j in range(1,n):\n A[i][j]=A[i-1][j]+A[i][j-1]\nprint(A[-1][-1])\n", "a = int(input())\r\nm = [[1 for i in range(a)] for j in range(a)]\r\nfor r in range(a-1):\r\n for c in range(a-1):\r\n m[r+1][c+1] = m[r][c+1]+m[r+1][c] \r\nprint(m[-1][-1])", "n = int(input())\r\nn += 1;\r\na = [0] * n;\r\nfor i in range(n):\r\n a[i] = [0] * n\r\na[1][1] = 1\r\nfor i in range(1, n):\r\n for j in range(1, n):\r\n if i == 1 and j == 1:\r\n continue\r\n a[i][j] = a[i - 1][j] + a[i][j - 1]\r\nprint(a[n - 1][n - 1])", "#from collections import Counter\r\n#import math\r\n'''\r\nt=int(input())\r\nans=list()\r\nfor _ in range(t):\r\n n=int(input())\r\n a=list(map(int,list(set(input().split()))))\r\n x=any(i%2==1 for i in a)\r\n y=any(i%2==0 for i in a)\r\n if n%2 and x:ans.append('YES')\r\n elif n%2==0 and x and y:ans.append('YES')\r\n else:ans.append('NO')\r\nprint(*ans,sep='\\n')'''\r\nn=int(input())\r\na=[[1]*n for _ in range(n)]\r\nfor i in range(1,n):\r\n for j in range(1,n):\r\n a[i][j]=a[i-1][j]+a[i][j-1]\r\nprint(a[-1][-1])\r\n", "n = int(input())\r\n\r\nliste = [[1]*n]\r\nfor i in range(1,n):\r\n liste.append([1])\r\n for j in range(1,n):\r\n liste[i].append(liste[i-1][j] + liste[i][j-1])\r\n\r\nprint(liste[n-1][n-1])", "n = int(input())\r\na = [[0]*(n+1) for i in range(n+1)]\r\n\r\nfor i in range(n+1):\r\n a[1][i]=1\r\n a[i][1]=1\r\n\r\nfor i in range(2,n+1):\r\n for j in range(2,n+1):\r\n a[i][j]=a[i-1][j]+a[i][j-1]\r\nprint(a[n][n])\r\n", "n = int(input())\ndata = [[0]*n]*n\nfor i in range(n):\n data[i][0] = 1\n data[0][i] = 1\n\nfor i in range(1, n):\n for j in range(1, n):\n data[i][j] = data[i-1][j] + data[i][j - 1]\nmax_data = 1\n\nfor i in range(1, n):\n for j in range(1, n):\n if data[i][j] > max_data:\n max_data = data[i][j]\n \nprint(max_data)", "def main():\r\n N = int(input())\r\n arr = [[0]*N]*N\r\n arr[0]=[1]*N\r\n for i in range(N):\r\n arr[i][0] =1\r\n\r\n for i in range(1,N):\r\n for j in range(1,N):\r\n arr[i][j] = arr[i-1][j] + arr[i][j-1]\r\n\r\n print(arr[N-1][N-1])\r\nmain()\r\n", "n=int(input())\r\nrow = [1] * n \r\nfor i in range(1, n):\r\n prevCol = 1\r\n for j in range(1, n):\r\n row[j] = row[j] + prevCol\r\n prevCol = row[j]\r\nprint( row[n-1])", "# https://codeforces.com/problemset/problem/509/A\r\n\r\nn = int(input())\r\nm = [[0 for _ in range(n)] for _ in range(n)]\r\nfor i in range(n):\r\n m[0][i] = 1\r\n m[i][0] = 1\r\n\r\n\r\n\r\nfor i in range(1, n):\r\n for k in range(1, n):\r\n m[i][k] = m[i-1][k] + m[i][k-1]\r\n\r\nprint(m[n-1][n-1])", "n=int(input())\r\nm=[[1 for _ in range(n)] for _ in range(n)]\r\nfor i in range(1,n):\r\n for j in range(1,n):\r\n m[i][j]=m[i-1][j]+m[i][j-1]\r\nprint(m[n-1][n-1])", "def factorial(n):\r\n if n == 0:\r\n return 1\r\n else:\r\n return n * factorial(n - 1)\r\nv1=int(input());c1=(v1*2)-2;c=v1-1\r\nprint(factorial(c1)//(factorial(c)*factorial(c1-c)))", "n = int(input())\r\nM = [[0] * n] * n\r\nfor i in range(n):\r\n M[i][0] = 1\r\n M[0][i] = 1\r\nfor i in range(1, n):\r\n for j in range(1, n):\r\n M[i][j] = M[i-1][j] + M[i][j - 1]\r\nprint(M[n-1][n-1])", "n = int(input())\n\ntable = [[1] * n for _ in range(n)]\n\nfor i in range(1, n):\n for j in range(1, n):\n table[i][j] = table[i - 1][j] + table[i][j - 1]\n\nmax_value = table[n - 1][n - 1]\n\nprint(max_value)\n\n \t\t\t\t \t \t \t\t \t \t \t\t\t", "n = int(input())\r\ntable = []\r\ntable.append([1] * n)\r\nfor i in range(n - 1):\r\n sum_ = 0\r\n temp = []\r\n for j in table[i]:\r\n sum_ += j\r\n temp.append(sum_)\r\n table.append(temp)\r\nprint(table[-1][-1])", "def a(b,c):\r\n if b==1 or c==1:\r\n return 1\r\n else :\r\n return a(b-1,c)+a(b,c-1)\r\nd=int(input())\r\nprint(a(d,d))", "from sys import stdin\r\n_input = stdin.readline\r\n_int, _range = int, range\r\ndef solution():\r\n n = _int(_input())\r\n arr = [[1]*n for i in _range(n)]\r\n for i in _range(1, n):\r\n for j in _range(1, n):\r\n arr[i][j] = arr[i-1][j] + arr[i][j-1]\r\n print(arr[n-1][n-1])\r\nsolution()", "n = int(input())\r\na = [1]*n\r\n\r\nfor i in range(n-1):\r\n proch = a\r\n # print('-->',proch)\r\n for j in range(1,n):\r\n a[j] = proch[j]+a[j-1]\r\nprint(max(a))", "n = int(input())\r\nmy_list = [[] for i in range(n)]\r\nfor i in range(n):\r\n for j in range(n):\r\n if j == 0 or i == 0:\r\n my_list[i].append(1)\r\n else:\r\n my_list[i].append(my_list[i - 1][j] + my_list[i][j - 1])\r\n\r\nprint(my_list[-1][-1])", "def solve(n):\r\n\r\n row = [1]*n\r\n for i in range(1, n):\r\n\r\n prevcol = 1\r\n \r\n for j in range(1, n):\r\n row[j] = row[j]+prevcol\r\n prevcol = row[j]\r\n\r\n return row[n-1]\r\n\r\n\r\n\r\nif __name__ == \"__main__\":\r\n print(solve(int(input())))", "def execute(n):\r\n d = [[1 for i in range(n)] for j in range(n)]\r\n for x in range (1,n):\r\n for y in range (1,n):\r\n d[x][y] = d[x-1][y] + d[x][y-1]\r\n return d[n-1][n-1]\r\n\r\nprint(execute(int(input())))", "def a_of_i_j(i, j):\r\n if i == 1 or j == 1:\r\n return 1\r\n else:\r\n return a_of_i_j(i - 1, j) + a_of_i_j(i, j - 1)\r\n\r\nn = int(input())\r\nprint(a_of_i_j(n, n))\r\n", "n = int(input())\r\nif n == 1:\r\n print(1)\r\nif n == 2:\r\n print(2)\r\nif n == 3:\r\n print(6)\r\nif n == 4:\r\n print(20)\r\nif n == 5:\r\n print(70)\r\nif n == 6:\r\n print(252)\r\nif n == 7:\r\n print(924)\r\nif n == 8:\r\n print(3432)\r\nif n == 9:\r\n print(12870)\r\nif n == 10:\r\n print(48620)\r\n", "n=int(input())\na=[]\n\nfor i in range(n):\n a.append([1 for j in range(n)])\n\nrj=1\n\nfor i in range(1,n):\n for j in range(1,n):\n a[i][j]=a[i-1][j]+a[i][j-1]\n if a[i][j]>rj:\n rj=a[i][j]\nprint(rj)\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())\nboard = []\nfor i in range(n):\n line = [1]\n for j in range(1, n):\n if i == 0:\n line.append(1)\n else:\n line.append(board[i-1][j] + line[j - 1])\n board.append(line)\nprint(board[n-1][n-1])\n\t \t\t\t\t \t\t\t \t \t \t\t\t\t \t\t\t", "a = int(input())\r\nb = a\r\nq = []\r\nfor i in range(a):\r\n q.append(1)\r\nwhile a != 1:\r\n q[0] = 1\r\n for i in range(1,b):\r\n q[i] = q[i] + q[i-1]\r\n a -= 1\r\nprint(q[b-1])", "\r\n\r\n\r\n\r\n\r\n\r\ndef maximum_table():\r\n\r\n n = int(input())\r\n\r\n \r\n max_value = 1\r\n values_above = [1] * n\r\n for row in range(1,n):\r\n left_value = 1\r\n new_values =[1]\r\n for col in range(1,n):\r\n value = values_above[col] + left_value\r\n max_value = max(value,max_value)\r\n new_values.append(value)\r\n left_value = value\r\n\r\n\r\n values_above = new_values\r\n\r\n\r\n\r\n print(max_value)\r\n\r\n\r\n\r\nmaximum_table()\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "def CF509A(i,j):\n if i==1 or j==1:\n return 1\n else:\n return CF509A(i-1,j) +CF509A(i,j-1)\n\n\nif __name__ == '__main__':\n n = int(input())\n print(CF509A(n,n))", "a = []\r\nd=int(input())\r\nfor i in range(d):\r\n c = [1, ]\r\n a.append(c)\r\nfor i in range(d-1):\r\n a[0].append(1)\r\nfor i in range(1,d):\r\n for j in range(1,d):\r\n a[i].append(a[i-1][j]+a[i][j-1])\r\nprint(a[d-1][d-1])\r\n\r\n", "from math import factorial;n = int(input()); print(factorial((n-1)*2) // (factorial(n-1) * factorial(n-1)))", "n = int(input())\na = []\na.append([1]*n)\nfor i in range(n-1):\n line = [1]\n for j in range(n-1):\n line.append(line[-1] + a[-1][j+1])\n a.append(line)\nprint(a[-1][-1])", "n = int(input())\narr = []\nrow1 = []\nfor i in range(n):\n for j in range(n):\n if j == 0:\n arr.append([1])\n continue\n if i == 0:\n arr[i].append(1)\n continue\n arr[i].append(arr[i-1][j] + arr[i][j - 1])\nprint(arr[n - 1][n - 1])\n\t \t\t\t\t\t\t\t \t\t\t\t \t \t \t\t\t\t\t\t", "from sys import stdin, stdout\r\n\r\nn = int(stdin.readline())\r\n\r\na = [[1]*n]*n\r\n\r\nfor i in range(1, n):\r\n for j in range(1, n):\r\n a[i][j] = a[i-1][j] + a[i][j-1]\r\n\r\nstdout.write(str(a[n-1][n-1]))", "n = int(input())\n\nx = [[0 for i in range(n)] for j in range(n)]\nfor i in range(n):\n x[i][0] = 1\nfor i in range(n-1):\n x[0][i+1] = 1\nfor a in range(n-1):\n for b in range(n-1):\n x[a+1][b+1] = x[a][b+1] + x[a+1][b]\nprint(x[n-1][n-1])\n", "z =[0,1,2,6,20,70,252,924,3432,12870,48620]\r\nprint(z[int(input())])", "def element(row, col):\r\n if row==0:\r\n return 1\r\n if col == 0:\r\n return 1\r\n else:\r\n return element(row-1,col)+ element(row, col-1)\r\nn= int(input())\r\nprint(element(n-1,n-1))", "n = int(input())\r\nmat=[]\r\nfor i in range(n):\r\n ls = [0] * n\r\n mat.append(ls)\r\n\r\nfor i in range(n):\r\n for j in range(n):\r\n if i == 0 or j == 0:\r\n mat[i][j] = 1\r\n else:\r\n mat[i][j] = mat[i][j - 1] + mat[i - 1][j]\r\n\r\n\r\n\r\nprint(mat[-1][-1])\r\n", "n = int(input())\r\n\r\nls = [[1 for i in range(n)] for j in range(n)]\r\nfor i in range(n):\r\n for j in range(n):\r\n if i - 1 >= 0 and j - 1 >= 0:\r\n ls[i][j] = ls[i-1][j] + ls[i][j-1]\r\n\r\nprint(ls[n - 1][n - 1])\r\n", "n = int(input())\r\nx = [1] * n\r\ny = [1] * n\r\nm = n-1\r\nwhile m > 0:\r\n for i in range(n):\r\n s = sum(x[:i + 1])\r\n y[i] = s\r\n x = y.copy()\r\n y = [1] * n\r\n m -= 1\r\nprint(x[-1])\r\n", "n = int(input())\r\n\r\npr = [1]*n\r\ncr = [1]*n\r\n\r\nfor i in range(1, n):\r\n for j in range(1, n):\r\n cr[j] = pr[j]+cr[j-1]\r\n pr = cr\r\n\r\nprint(cr[n-1])\r\n", "n = int(input())\r\n\r\narr = [[0]*n]*n\r\n\r\nfor i in range(n):\r\n for j in range(n):\r\n if i == 0 or j == 0:\r\n arr[i][j] = 1\r\n else:\r\n arr[i][j] = arr[i-1][j] + arr[i][j-1]\r\n \r\nprint(arr[-1][-1])\r\n", "n = int(input())\r\nl = [1] * n\r\nfor _ in range(n - 1):\r\n for j in range(1, n):\r\n l[j] = l[j] + l[j-1]\r\nprint(l[-1])", "#C из n по k ---> n! / (k!*(n-k)!)\r\nimport math\r\nm = int(input())\r\nif m == 1:\r\n n = 1\r\nelse:\r\n n = m+(m-2)\r\nk = (n+1)//2\r\nprint(math.factorial(n) // (math.factorial(k) * math.factorial(n-k)))\r\n", "print ([0, 1, 2, 6, 20, 70, 252, 924, 3432, 12870, 48620][int (input ())])\r\n", "n = int(input())\r\nt = [[0]*n]*n\r\nt[0] = [1]*n\r\nfor i in range(1, n):\r\n t[i][0] = 1\r\nfor _ in range(1, n):\r\n for j in range(1, n):\r\n t[_][j] = t[_-1][j]+t[_][j-1]\r\nprint(t[n-1][n-1])", "n = int(input())\r\nt = [1]*n\r\nfor r in range(1,n):\r\n for i in range(1,n):\r\n t[i] = t[i]+t[i-1]\r\nprint(t[n-1])\r\n\r\n\r\n", "n=int(input())\r\ncount=0\r\ndef one_smaller(a,b):\r\n global count\r\n if a==1 or b==1:\r\n return 1\r\n return (one_smaller(a-1,b)+one_smaller(a,b-1))\r\nprint(one_smaller(n,n))", "n = int(input())\n\nb = [[0] * n for i in range(n)]\nc = []\n\nfor i in range(n):\n for j in range(n):\n if i == 0:\n b[i][j] = 1\n else:\n b[i][j] = b[i-1][j] + b[i][j-1]\n\nfor i in b:\n c.append(max(i))\n\nprint(max(c))", "n = int(input())\r\na = [[1]*n for i in range(n)]\r\nfor i in range(1, n):\r\n for j in range(1, n):\r\n a[i][j] = a[i-1][j] + a[i][j-1]\r\nm = 1\r\nfor i in range(1, n):\r\n for j in range(1, n):\r\n if a[i][j] > m:\r\n m = a[i][j]\r\nprint(m)", "n = int(input())\r\na = [[0 for x in range(n)] for y in range(n)]\r\nfor x in range(n):\r\n a[0][x]=1\r\nfor row in range(1, n):\r\n for col in range(n):\r\n if col == 0:\r\n a[row][col] = a[row - 1][col]\r\n else:\r\n a[row][col] = a[row - 1][col] + a[row][col - 1]\r\nprint(max(max(a)))", "n=int(input())\r\nr,c=n,n\r\nmatrix=[]\r\nfor i in range(r):\r\n arr=[1]*n\r\n matrix.append(arr)\r\nfor i in range(1,r):\r\n for j in range(1,c):\r\n matrix[i][j]=matrix[i-1][j]+matrix[i][j-1]\r\nprint(matrix[n-1][n-1])", "import math\r\nn = int(input())\r\nprint(math.comb(n * 2 - 2, n - 1))", "n=int(input())\nl=[[0]*n]* n\nl [0]=[1]* n\nfor i in range (n):\n l[i][0]=1\nfor i in range(1,n):\n for j in range(1,n):\n l[i][j]=l[i -1][j] +l[i][j-1]\nprint(l[-1][-1])\n\n\t\t \t \t \t \t \t\t\t\t\t \t\t \t\t\t \t", "n=int(input())\na=[[1]]*(n-1)\nb=[1]*n\na.insert(0,b)\nfor i in range(1,n):\n a[i]=a[i]+[0]*(n-1)\nfor i in range(1,n):\n for j in range(1,n):\n a[i][j]=(a[i-1][j]+a[i][j-1])\nm=0\nfor i in a:\n n=max(i)\n if m<n:\n m=n\nprint(m)", "sz = int(input())\r\n\r\n\r\ndef x(i, j):\r\n if i == 0 or j == 0:\r\n return 1\r\n else:\r\n return x(i - 1, j) + x(i, j - 1)\r\n\r\n\r\nprint(x(sz - 1, sz - 1))", "def max_value_in_table(n):\n table = [[1] * n for _ in range(n)] # Initialize the table with ones\n\n for i in range(1, n):\n for j in range(1, n):\n table[i][j] = (\n table[i - 1][j] + table[i][j - 1]\n ) # Compute values using the formula\n\n return table[n - 1][n - 1] # Return the maximum value at the bottom-right cell\n\n\n# Example usage:\nn = int(input())\nmax_value = max_value_in_table(n)\nprint(max_value)\n", "n = int(input())\r\n\r\ndef solve(r,c):\r\n if r == 1 or c == 1:\r\n return 1\r\n return solve(r - 1, c) + solve(r, c - 1)\r\n\r\nprint(solve(n, n))", "n=int(input())\r\ns=[1,2,6,20,70,252,924,3432,12870,48620]\r\nprint(s[n-1])", "a = int(input())\nif a==1:\n print(1)\nelif a==2:\n print(2)\nelif a==3:\n print(6)\nelif a==4:\n print(20)\nelif a==5:\n print(70)\nelif a==6:\n print(252)\nelif a==7:\n print(924)\nelif a==8:\n print(3432)\nelif a==9:\n print(12870)\nelif a==10:\n print(48620)\n\t\t\t\t\t\t \t \t\t\t\t\t \t \t\t\t\t \t", "a= int(input());b= [0,1,2,6,20,70,252,924,3432,12870,48620];print(b[a])", "n=int(input().strip())\r\nq = [[1 for i in range(n)]for j in range(n)]\r\nfor i in range(1,n):\r\n for j in range(1,n):\r\n q[i][j]=q[i-1][j]+q[i][j-1]\r\nprint(q[-1][-1])", "#!/usr/bin/env python\r\nimport sys, math\r\n\r\nif __name__ == '__main__':\r\n\twtf = sys.stdin.read()\r\n\twtf = wtf.strip().split('\\n')\r\n\t#n (1 ≤ n ≤ 10) \r\n\tn = int(wtf[0])\r\n\tmat = [[1 for x in range(n)] for y in range(n)]\r\n\tfor i,r in enumerate(mat):\r\n\t\tfor j,c in enumerate(r):\r\n\t\t\tif i > 0 and j > 0:\r\n\t\t\t\tmat[i][j] = mat[i-1][j] + mat[i][j-1]\r\n\tprint(mat[n-1][n-1])", "n = int(input())\r\na=[]\r\ns = 0\r\nfor i in range(n):\r\n a.append(1)\r\nfor i in range(n-1):\r\n for j in range(n-1):\r\n a[j+1] = a[j] + a[j+1]\r\nfor k in a:\r\n s = s+k\r\nprint(k)", "n = int(input()) \nl = []\nfor i in range(n):\n ls = []\n for j in range(n):\n if i == 0 or j == 0:\n ls.append(1)\n else:\n ls.append(ls[-1] + l[i-1][j])\n l.append(ls)\nprint(l[-1][-1])\n \t \t\t \t\t \t \t \t\t\t \t \t\t", "a=int(input())\r\ndef cal(a,b):\r\n if(a==0):\r\n return(1)\r\n elif(b==0):\r\n return(1)\r\n else:\r\n return(cal(a-1,b)+cal(a,b-1))\r\nprint(cal(a-1,a-1))", "n=int(input())\r\na=[ [ 0 for y in range(n) ]\r\n for x in range( n ) ]\r\nfor i in range(n):\r\n for j in range(n):\r\n if i!=0 or j!=0:\r\n a[i][j]=a[i][j-1]+a[i-1][j]\r\n else:\r\n a[i][j]=1\r\n c=a[i][j]\r\nprint(c)", "n = int(input())\r\na=[[0 for x in range(n)]for y in range(n)]\r\nfor x in range(n):\r\n a[0][x]=1\r\nfor row in range(1,n):\r\n for column in range(n):\r\n if column == 0:\r\n a[row][column]= a[row-1][column]\r\n else:\r\n a[row][column]=a[row][column-1]+a[row-1][column]\r\nprint(max(max(a)))", "n=int(input())\r\na=[1]*n\r\nb=[1]*n\r\nfor i in range(n-1):\r\n for j in range(1,n):\r\n b[j]=a[j]+b[j-1]\r\n a=b.copy()\r\nprint(a[-1])\r\n ", "i = int(input())\r\ntable = [1 for x in range(i)]\r\nfor x in range(1, i):\r\n for y in range(1, i):\r\n table[y] = table[y]+table[y-1]\r\nprint(table[-1])", "a = int(input())\r\nn = []\r\n\r\nfor i in range(a):\r\n p = [1] * a\r\n n.append(p)\r\n\r\nfor i in range(1, a):\r\n for j in range(1, a):\r\n n[i][j] = n[i-1][j]+n[i][j-1]\r\nprint(n[-1][-1])", "def binomial(n, r):\r\n p = 1 \r\n for i in range(1, min(r, n - r) + 1):\r\n p *= n\r\n p //= i\r\n n -= 1\r\n return p\r\n\r\n# import scipy.special\r\nn = int(input())-1\r\nout = binomial(2*n, n)\r\nprint(out)\r\n ", "n=int(input())\r\nboard=[[0 for i in range(n+1)] for j in range(n+1)]\r\nfor i in range(1,n+1):\r\n board[i][1]=1\r\n board[1][i]=1\r\nfor i in range(2,n+1):\r\n for j in range(2,n+1):\r\n board[i][j]=board[i-1][j]+board[i][j-1]\r\nprint(board[n][n])", "l=[[1]]\r\nn=int(input())\r\nfor i in range(1,n):\r\n l.append([])\r\n l[0].append(1)\r\n l[i].append(1)\r\n\r\n\r\nfor i in range(1,n):\r\n for j in range(1,n):\r\n l[i].append(l[i-1][j]+l[i][j-1])\r\nprint(l[-1][-1]) ", "n=int(input())\r\nL=[-1, 1, 2, 6, 20, 70, 252, 924, 3432, 12870, 48620]\r\nprint(L[n])", "n=int(input())\r\na=[1]\r\nb=[1]\r\nfor i in range(1,n+1):\r\n a=b\r\n for j in range(1,n):\r\n if i==1:\r\n a.append(1)\r\n b.append(1)\r\n else:\r\n b[j]=b[j-1]+a[j]\r\n\r\nprint(max(a))", "\r\nn=int(input())\r\nl=[]\r\nfor i in range(n):\r\n\tl. append([0 for c in range(0, n)])\r\nfor i in range(n):\r\n\tfor j in range(n):\r\n\t\tif i==0 or j==0:\r\n\t\t\tl[i][j]=1\r\n\t\telse:\r\n\t\t\tl[i][j]=l[i-1][j]+l[i][j-1]\r\nl2=[]\r\nfor i in l:\r\n\tl2.extend(i)\r\nprint(max(l2))", "from math import factorial\r\ni = int(input())\r\nprint(\"{:.0f}\".format(factorial(2*(i-1))/factorial(i-1)**2))", "def factorial(n):\r\n s=1\r\n for i in range(1,n+1):\r\n s*=i \r\n return s \r\nn=int(input())\r\nprint((factorial(2*(n-1)))//(factorial(n-1)**2))", "n=int(input())\r\ns=[]\r\ns.append(n*[1])\r\nfor i in range(n-1):\r\n s.append(n*[0])\r\nfor i in range(n):\r\n s[i][0]=1\r\nfor i in range(1,n):\r\n for j in range(1,n):\r\n s[i][j]=s[i-1][j]+s[i][j-1]\r\nprint(s[n-1][n-1])", "def sum_one(x):\r\n return x+1\r\n\r\nt = int(input())\r\n#create a table with zeros and size N x N\r\nmatr = []\r\n\r\nline = []\r\n#create the line of size N\r\nfor i in range(t):\r\n line.append(0)\r\n#print(line) \r\n\r\n#create the table\r\nfor i in range(t):\r\n matr.append(line.copy())\r\n#print(matr) \r\n\r\n#populate the first first line with 1\r\nmatr[0] = [sum_one(s) for s in matr[0]]\r\n\r\n#populate first value of colum with 1\r\nfor lin in matr:\r\n lin[0] = 1\r\n #print(lin)\r\n \r\n\r\n#calculate other values:\r\nfor i in range(1,t):\r\n for j in range(1,t):\r\n matr[i][j] = matr[i-1][j] + matr[i][j-1]\r\n #print(matr[i-1][j],end='')\r\n #print(matr[i][j-1],end='')\r\n #print(matr[i][j])\r\n #print('i: ',i)\r\n #print('j: ',j)\r\n #print(matr[i])\r\n #print(new\r\n #print('')\r\n\r\n#for lin in matr:\r\n# print(lin)\r\n \r\nprint(matr[-1][-1])", "n = input()\nn = int(n)\nlist = []\ntemp = []\n\nfor i in range(0, n, 1):\n temp.append(1)\n\nlist.append(temp)\nfor i in range(1, n, 1):\n line = [1]\n for j in range(1, n, 1):\n line.append(line[j - 1] + list[i - 1][j])\n list.append(line)\n\nprint(list[n-1][n-1])\n\t\t \t \t\t \t\t\t \t\t\t\t \t\t \t \t \t", "m=[]\r\nn=int(input())\r\nfor i in range(n):\r\n l=[]\r\n for j in range(n):\r\n if(i==0) or (j==0):\r\n l.append(1)\r\n else:\r\n l.append(0)\r\n m.append(l)\r\nfor i in range(1,len(m)):\r\n for j in range(1,len(m)):\r\n m[i][j]=m[i][j-1]+m[i-1][j]\r\nprint(m[n-1][n-1])\r\n", "n=int(input())\r\ntriangle=[]\r\ntriangle.append([1]*n)\r\nfor i in range(n-1):\r\n triangle.append([1]+[0]*(n-1))\r\nmax=0\r\nfor i in range(1,n):\r\n for j in range(1, n ):\r\n triangle[i][j]=triangle[i-1][j]+triangle[i][j-1]\r\nprint(triangle[n-1][n-1])", "import math\r\nn = int(input()) - 1\r\ngt = math.factorial(n)\r\nprint(math.factorial(2*n)//(gt*gt))\r\n", "n = int(input())\r\narr1 = []\r\n\r\nfor x in range(1, n+1):\r\n first_element = 1\r\n arr1.append([1])\r\n for y in range(1, n):\r\n if x == 1:\r\n arr1[-1].append(arr1[-1][-1])\r\n else:\r\n arr1[-1].append(arr1[-2][y]+arr1[-1][-1])\r\nprint(arr1[-1][-1])", "n = int(input())\r\nlist = [1]*n\r\ncount = 1\r\nj = 1\r\nwhile j < n:\r\n for i in range(1, n):\r\n count += list[i]\r\n list[i] = count\r\n count = 1\r\n j += 1\r\nprint(max(list))", "n = int(input())\r\ns = [[0 for i in range(n)] for i in range(n)]\r\nfor i in range(len(s)):\r\n for j in range(len(s)):\r\n if i == 0 or j == 0:\r\n s[i][j] = 1\r\n else:\r\n s[i][j]=s[i-1][j]+s[i][j-1]\r\nprint(max(max(s)))\r\n \r\n \r\n \r\n\r\n \r\n \r\n \r\n\r\n \r\n \r\n\r\n\r\n\r\n \r\n\r\n\r\n \r\n\r\n\r\n", "n=int(input())\r\nmat=[1]*100\r\na=[1]*10\r\nfor i in range(1,10):\r\n for j in range(1,10):\r\n mat[i*10+j]=mat[(i-1)*10+j]+mat[i*10+j-1]\r\n if i==j:a[i]=mat[i*10+j]\r\nprint(a[n-1])", "import math\n\n\ndef main():\n n = int(input())\n tbl = [[1] * n] * n\n for y in range(1, n):\n for x in range(1, n):\n tbl[y][x] = tbl[y - 1][x] + tbl[y][x - 1]\n\n print(tbl[n - 1][n - 1])\n\n\nmain()\n", "n = int(input())\r\ndp = [[1]*n]*n\r\n\r\nfor i in range(1,n):\r\n for j in range(1,n):\r\n dp[i][j] = dp[i][j-1] + dp[i-1][j]\r\n\r\nprint(dp[n-1][n-1])", "def solve():\n n = int(input())\n if n==1:\n print(1)\n elif n==2:\n print(2)\n else:\n a = [[1]*n]\n for i in range(n-1):\n t = [1]\n for j in range(n-1):\n temp = a[i][j+1]+t[j]\n t.append(temp)\n a.append(t)\n print(a[n-1][n-1])\n\n\nif __name__ == '__main__':\n solve()", "n = int(input())\r\na = [[0] * n for i in range(n)]\r\nfor i in range(n):\r\n for j in range(n):\r\n if j == 0:\r\n a[i][j] = 1\r\n elif i == 0:\r\n a[i][j] = 1\r\n elif a[i][j] != 1:\r\n a[i][j] = a[i - 1][j] + a[i][j - 1]\r\n\r\nprint(max(a[n - 1]))\r\n", "n = int(input())\n\narr = [[1] * n] * n\n\nfor i in range(1, n):\n for j in range(1, n):\n arr[i][j] = arr[i - 1][j] + arr[i][j - 1]\n\nprint(arr[n - 1][n - 1])\n\n \t \t \t\t\t\t\t\t \t\t \t \t \t \t \t", "n = int(input())\r\nt = [[1] * 10]\r\n\r\nfor i in range(1, 10):\r\n t.append([1, 0, 0, 0, 0, 0, 0, 0, 0, 0])\r\n\r\nfor i in range(1, 10):\r\n for j in range(1, 10):\r\n t[i][j] = t[i - 1][j] + t[i][j - 1]\r\n\r\nprint(t[n - 1][n - 1])", "'''// Problem: A. Maximum in Table\r\n// Contest: Codeforces - Codeforces Round #289 (Div. 2, ACM ICPC Rules)\r\n// URL: https://codeforces.com/problemset/problem/509/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\n#include <bits/stdc++.h>\r\nusing namespace std;\r\n\r\nint main()\r\n{\r\n ios::sync_with_stdio(0);\r\n cin.tie(0);\r\n int t;\r\n cin>>t;\r\n while (t--){\r\n \r\n }\r\n}'''\r\nn=int(input())\r\nl=[]\r\nl1=[1]*n\r\nl.append(l1)\r\nfor i in range(n-1):\r\n\tl2=[0]*n\r\n\tl2[0]=1\r\n\tl.append(l2)\r\nfor i in range(1,n):\r\n\tfor j in range(1,n):\r\n\t\tl[i][j]\t=l[i-1][j]+l[i][j-1]\r\n#print(l)\r\nprint(l[n-1][n-1])", "import sys\r\n#import openai\r\n#import math\r\n#import datetime\r\n#import numpy as np\r\n\r\ndef main():\r\n #n,k = map(int, input().split())\r\n #a = [int(x) for x in sys.stdin.readline().split()]\r\n #t = int(input())\r\n #for i,j in zip(a, b)\r\n n = int(input())\r\n ar2 = [[1 for col in range(n)] for row in range(n)]\r\n for i in range(1, n):\r\n for j in range(1, n):\r\n ar2[i][j] = ar2[i-1][j] + ar2[i][j-1]\r\n print(ar2[n-1][n-1])\r\n \r\nmain()\r\n", "n = int(input())\r\n\r\ng = [[None] * n] * n\r\n\r\nfor i in range(n):\r\n for j in range(n):\r\n if i == 0:\r\n g[i][j] = 1\r\n elif j == 0:\r\n g[i][j] = 1\r\n else:\r\n g[i][j] = g[i-1][j] + g[i][j - 1]\r\n\r\n\r\nprint(g[n-1][n-1])\r\n", "n = int(input())\r\narr = [[1] * n] * n\r\n\r\nfor i in range(1, n):\r\n for j in range(1, n):\r\n arr[i][j] = arr[i-1][j] + arr[i][j-1]\r\n\r\nprint(arr[n-1][n-1])", "num=int(input())\r\nn=num\r\nli=[]\r\nfor i in range(0,num):\r\n li.append(1)\r\nwhile num!=1:\r\n li[0]=1\r\n for i in range(1,n):\r\n li[i]=li[i]+li[i-1]\r\n num-=1\r\nprint(li[n-1])\r\n", "from math import factorial\r\nn = int(input()) - 1 \r\nprint(factorial(2*n) // factorial(n)**2)", "n = int(input())\r\narr = []\r\na = []\r\n\r\nfor i in range(n):\r\n a.append(1)\r\narr.append(a)\r\n\r\nfor i in range(1 , n):\r\n a = []\r\n a.append(1)\r\n for j in range(1 , n):\r\n a.append(arr[i-1][j] + a[j-1])\r\n arr.append(a)\r\n\r\nmx = 0\r\nfor i in range(n):\r\n for j in range(n):\r\n if arr[i][j] > mx:\r\n mx = arr[i][j]\r\n\r\nprint(mx)", "n=int(input())\r\na=[]\r\n\r\na.append([1]*n)\r\nfor i in range (n-1):\r\n b=[]\r\n for i in range(n):\r\n b.append(0)\r\n a.append(b)\r\nfor i in range (1,n):\r\n for j in range (n):\r\n if j==0:\r\n a[i][j]=1\r\n else:\r\n a[i][j]=a[i][j-1]+a[i-1][j]\r\nprint(a[n-1][n-1])\r\n", "n=int(input())\r\ndef zsh(i,j):\r\n if i==2 and j==2:\r\n return 2\r\n elif i==2 and j>2:\r\n return zsh(i,j-1)+1\r\n elif i>2 and j==2:\r\n return zsh(i-1,j)+1\r\n else:\r\n return zsh(i-1,j)+zsh(i,j-1)\r\nif n==1:\r\n print(1)\r\nelse:\r\n print(zsh(n,n))", "n = int(input())\r\ndef tri(i,j):\r\n if j == 1:\r\n return 1\r\n elif i == 1:\r\n return 1\r\n else:\r\n return tri(i-1,j) + tri(i,j-1)\r\nprint(tri(n,n))", "n=int(input())\r\na=[[0]*n]*n\r\nfor i in range(0,n):\r\n for j in range(0,n):\r\n a[i][0]=1\r\n a[0][j]=1\r\nfor i in range(1,n):\r\n for j in range(1,n):\r\n a[i][j]=a[i-1][j]+a[i][j-1]\r\nprint(a[n-1][n-1])", "import math \r\ndef glitchinthematrix(f,x):\r\n if f==1 or x==1:\r\n return 1\r\n else:\r\n return glitchinthematrix(f-1,x)+glitchinthematrix(f,x-1)\r\nt=int(input())\r\nprint(glitchinthematrix(t,t))", "n = int(input())\r\ndef sums(n,m):\r\n# print(n,m)\r\n if n > 1 and m > 1:\r\n return sums(n-1,m) + sums(n,m-1)\r\n else:\r\n return 1\r\n\r\nprint(sums(n,n))", "n = int(input())\r\nfinal = [[1 for i in range(n)] for j in range(n)]\r\nfor i in range(1, n):\r\n for j in range(i, n):\r\n if i == j:\r\n final[i][j] = 2*final[i-1][j]\r\n else:\r\n final[i][j] = final[i-1][j] + final[i][j-1]\r\nprint(final[-1][-1])", "n=int(input())\r\nl=[[] for k in range(0,n)]\r\nfor i in range(0,n):\r\n for j in range(0,n):\r\n if j==0 or i==0:\r\n l[i].append(1)\r\n else:\r\n l[i].append(l[i][-1]+l[i-1][j])\r\nprint(l[-1][-1])\r\n", "Q=int(input())\r\nN=Q-1\r\nif N==0:\r\n print(1)\r\nelse:\r\n k=((2*N)//2)\r\n up=1\r\n for y in range(2*N-k+1,2*N+1):\r\n up*=y\r\n down=1\r\n for y in range(1,k+1):\r\n down*=y\r\n \r\n print(int(up/down))\r\n ", "def answer(r,c):\r\n if(r==1 or c==1):\r\n return 1\r\n return answer(r-1,c)+answer(r,c-1)\r\n \r\nn=int(input())\r\nprint(answer(n,n))", "class solution:\r\n def __init__(self,n):\r\n self.n = n\r\n self.answer = []\r\n def caluclation(self):\r\n self.answer =[[1]*self.n]*self.n\r\n for i in range(1,self.n):\r\n for j in range(1,self.n):\r\n self.answer[i][j] = self.answer[i-1][j] + self.answer[i][j-1]\r\n \r\n\r\nn=int(input())\r\nroot = solution(n)\r\nroot.caluclation()\r\nprint(root.answer[-1][-1])", "n = int(input())\r\n\r\narr = []\r\n\r\nfor i in range(0,n):\r\n mas = []\r\n for j in range(0,n):\r\n mas.append(1)\r\n arr.append(mas)\r\n\r\nfor i in range(1,n):\r\n mas = []\r\n for j in range(1,n):\r\n \r\n a = arr[i-1][j]\r\n b = arr[i][j-1]\r\n arr[i][j] = (a + b)\r\nprint (arr[n-1][n-1])", "n = int(input())\r\ndp = [[1 for _ in range(n)] for _ in range(n)]\r\nans = 0\r\nfor i in range(1, n):\r\n for j in range(1, n):\r\n dp[i][j] = dp[i - 1][j] + dp[i][j - 1]\r\nprint(dp[-1][-1]) \r\n", "n=int(input())\r\nif n==1:\r\n print(\"1\")\r\nelse:\r\n dic=dict()\r\n L1=[1 for i in range(n)]\r\n dic[0]=L1\r\n for i in range(1,n):\r\n L=[1 for i in range(n)]\r\n dic[i]=L\r\n for j in range(1,n):\r\n dic[i][j]=dic[i-1][j]+dic[i][j-1]\r\n print(max(dic[len(dic)-1]))", "n=int(input())\r\nif n<3:\r\n print(n)\r\nelse:\r\n l=[]\r\n for i in range(n):\r\n p=[]\r\n for j in range(n):\r\n if i==0 or j==0:\r\n p.append(1)\r\n else:\r\n p.append(p[j-1]+l[i-1][j])\r\n l.append(p)\r\n print(l[n-1][n-1])", "n = int(input())\r\n\r\ntable = [[1]*n]*n\r\ncur = 1\r\n\r\n\r\nfor i in range(1,n):\r\n\tfor j in range(1,n):\r\n\t\ttable[i][j] = table[i-1][j] + table[i][j-1]\r\n\t\tx = table[i][j] \r\n\t\tcur = max(cur,x)\r\nprint(cur)\r\n\r\n", "def main():\r\n n=int(input())\r\n refer = {}\r\n refer[1] = [1 for i in range(n)]\r\n\r\n for i in range(2,n+1):\r\n row_prev = refer[i-1]\r\n row = [1]\r\n for j in range(0,n-1):\r\n row.append(row[j]+row_prev[j+1])\r\n refer[i] = row\r\n\r\n print(refer[n][-1])\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n = int(input())\nif n <= 2:\n print(n)\nelse:\n matrix = []\n m = []\n for i in range(n):\n m.append(1)\n matrix.append(m)\n for i in range(1,n):\n a = [1]\n for j in range(1,n):\n x = a[j-1]+matrix[i-1][j]\n a.append(x)\n matrix.append(a)\n print(matrix[-1][-1])\n\t\t\t \t \t \t\t\t\t\t\t\t\t \t\t\t", "import math\r\nn=int(input())\r\nn-=1\r\nans=math.factorial(2*n)/math.factorial(n)**2\r\nprint(int(ans))", "def main(n):\r\n n = int(n)\r\n mas = []\r\n for i in range(n):\r\n mas.append([1]*n)\r\n #print(mas)\r\n for i in range(1,n):\r\n for j in range(1,n):\r\n mas[i][j] = mas[i-1][j] + mas[i][j-1]\r\n #for i in range(n):\r\n #mas[0][i] = 1\r\n \r\n return mas[-1][-1]\r\n\r\n\r\nprint(main(input()))", "def create_2d_arr2(m, n):\r\n arr2d = []\r\n for i in range(m):\r\n internal_arr = []\r\n for j in range(n):\r\n internal_arr.append(1)\r\n arr2d.append(internal_arr)\r\n return arr2d\r\n\r\n\r\ndef print_matrix(arr):\r\n for I in arr:\r\n for el in I:\r\n print(el, end=' ')\r\n print()\r\n\r\n\r\n# 1 задача - Художник\r\n# w, h = map(int, input().split())\r\n# n = int(input())\r\n# a = [list(map(int, input().split())) for i in range(n)]\r\n#\r\n# pole = create_2d_arr2(h, w)\r\n# count = 0\r\n# for t in range(n):\r\n# for i in range(a[t][0], a[t][2]):\r\n# for j in range(a[t][1], a[t][3]):\r\n# pole[i][j] = 0\r\n# for i in range(len(pole)):\r\n# count += sum(pole[i])\r\n# print(*pole[i])\r\n# print(count)\r\n\r\n# 2 задача A. Максимум в таблице\r\nn = int(input())\r\na = create_2d_arr2(n, n)\r\nfor i in range(1, n):\r\n for j in range(1, n):\r\n a[i][j] = a[i - 1][j] + a[i][j - 1]\r\nprint(max(a[-1]))\r\n\r\n# https://codeforces.com/problemset/problem/509/A\r\n", "n=int(input());\r\nif(n==1):\r\n print(1);\r\nelse:\r\n ar=[[0 for i in range(n)] for j in range(n)];\r\n mx=-1;\r\n for i in range(n):\r\n for j in range(n):\r\n if(i==0 or j==0):\r\n ar[i][j]=1;\r\n else:\r\n ar[i][j]=ar[i-1][j]+ar[i][j-1];\r\n if(ar[i][j]>mx):\r\n mx=ar[i][j];\r\n print(mx);", "n = int(input())\nlst = [[1] * n for _ in range(n)]\nfor i in range (1, n):\n\tfor j in range(1, n):\n\t\tlst[i][j] = lst[i-1][j] + lst[i][j-1]\nprint(lst[n-1][n-1])", "n = int(input())\r\nif n == 1:\r\n print(n)\r\nelse:\r\n l = [[1] * n] * n\r\n for i in range(1, n):\r\n for j in range(1, n):\r\n l[i][j] = l[i][j - 1] + l[i - 1][j]\r\n print(l[n-1][n-1])\r\n\r\n\r\n", "def solve(n):\n if n ==1 :\n return 1\n arr = [[1]*n]\n for i in range(1,n):\n row = [1]\n for col in range(1,n):\n row.append(row[col-1]+arr[i-1][col])\n if i == n-1:\n return row[-1]\n arr.append(row)\n\n\n \n\n\ndef main():\n print(solve(int(input())))\n\nmain()\n", "a=int(input())\r\nb=[0, 1, 2, 6, 20, 70, 252, 924, 3432, 12870, 48620]\r\nprint(b[a])", "n = int(input())\r\n\r\nif n == 1:\r\n print(1)\r\nelse:\r\n lst = [[1]*n]\r\n for i in range(1,n):\r\n new = []\r\n for j in range(n):\r\n if j == 0:\r\n new.append(1)\r\n else:\r\n new.append(lst[i-1][j] + new[j-1])\r\n lst.append(new)\r\n print(lst[n-1][n-1])", "n = int(input())\r\nlst = [[1 for i in range (n)]]\r\nfor i in range (n-1):\r\n arr = []\r\n for j in range (n):\r\n arr.append(sum(lst[-1][:j+1]))\r\n lst.append(arr)\r\nprint(lst[-1][-1])", "def fact(n):\n sums = 1\n for i in range(2, n + 1):\n sums *= i\n return sums\n\nn = 2 * (int(input()) - 1)\nprint(fact(n) // fact(n // 2) // fact(n - n // 2))", "import sys\r\n\r\ninput = sys.stdin.readline\r\n\r\n\r\ndef inp():\r\n return int(input())\r\n\r\n\r\ndef minp():\r\n return map(int, input().split())\r\n\r\n\r\ndef mlinp():\r\n return list(map(int, input().split()))\r\n\r\n\r\ndef lsimp():\r\n s = input()\r\n return list(s[: len(s) - 1])\r\n\r\n\r\ndef simp():\r\n return input().splitlines()[0]\r\n\r\n\r\nt = inp()\r\n\r\na = [[1] * t for _ in range(t)]\r\n\r\nfor i in range(1, t):\r\n for j in range(1, t):\r\n a[i][j] = a[i][j - 1] + a[i - 1][j]\r\n\r\nprint(a[t - 1][t - 1])", "t=int(input())\r\nn=[[1 for x in range(t)]for x in range(t)]\r\nfor x in range(t-1):\r\n for y in range(t-1-x):\r\n n[x+1][y+x+1]=n[x+1][y+x]+n[x][y+x+1]\r\n n[y+x+1][x+1]=n[x+y][x+1]+n[y+x+1][x]\r\nprint(n[-1][-1])\r\n \r\n \r\n", "n=int(input())\r\na=[1,1,1,1,1,1,1,1,1,1,1]\r\nfor _ in range(1,n):\r\n for i in range(1,n):\r\n a[i]=a[i]+a[i-1]\r\n \r\nprint(max(a))", "n=int(input())\r\narr=[[0 for i in range(n)]for j in range(n)]\r\nm=1\r\nfor i in range(n):\r\n for j in range(n):\r\n if i==0 or j==0:\r\n arr[i][j]=1\r\nfor i in range(1,n):\r\n for j in range(1,n):\r\n arr[i][j]=arr[i-1][j]+arr[i][j-1]\r\n if arr[i][j]>m:\r\n m=arr[i][j]\r\nprint(m) ", "from sys import stdin, stdout\r\ndef istr(): return input()\r\ndef inum(): return int(stdin.readline())\r\ndef imul(): return map(int, stdin.readline().split())\r\ndef ilst(): return list(map(int, stdin.readline().split()))\r\ndef splt(): return list(stdin.readline().strip())\r\ndef emat(): return [[0 for j in range(10) ] for i in range(10)]\r\nmax_itr = 100\r\nfrom itertools import combinations\r\nimport heapq\r\n\r\n# Code\r\n\r\nn = inum()\r\naa = emat()\r\nfor i in range(n):\r\n for j in range(n):\r\n if(i==0 or j==0):aa[i][j]=1\r\n else:aa[i][j]= aa[i-1][j]+aa[i][j-1]\r\nprint(aa[n-1][n-1])", "n=int(input())\r\nt=[]\r\nmx=1\r\nfor i in range(n):\r\n t.append([1]*n)\r\nfor i in range(1,n):\r\n for j in range(1,n):\r\n t[i][j]=t[i-1][j]+t[i][j-1]\r\n if mx<t[i][j]:\r\n mx=t[i][j]\r\nprint(mx)", "n = int(input())\r\ndata = [[0] * n for _ in range(n)]\r\nfor i in range(n):\r\n data[i][0] = 1\r\n\r\nfor i in range(n):\r\n data[0][i] = 1\r\n\r\nfor i in range(1, n):\r\n for j in range(1, n):\r\n data[i][j] = data[i - 1][j] + data[i][j - 1]\r\nprint(data[-1][-1])\r\n ", "#include <bits/stdc++.h> :D\r\nimport sys, math\r\ninp = sys.stdin.readline\r\nout = sys.stdout.write\r\n\r\ndef main():\r\n n = int(inp())\r\n a = [[1] * (n + 1)] * (n + 1)\r\n for i in range(2, n + 1):\r\n for j in range(2, n + 1):\r\n a[i][j] = a[i - 1][j] + a[i][j - 1]\r\n out(f\"{a[n][n]}\")\r\n\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()", "t = int(input())\r\na = [[0 for x in range(t)] for y in range(t)]\r\n\r\nfor x in range(t):\r\n a[0][x] = 1\r\n\r\nfor i in range(1, t):\r\n for j in range(t):\r\n if j == 0:\r\n a[i][j] = a[i - 1][j]\r\n else:\r\n a[i][j] = a[i - 1][j] + a[i][j - 1]\r\nprint(max(a)[-1])\r\n\r\n", "def solve(n):\r\n row = [1] * n\r\n for i in range(1, n):\r\n prevCol = 1\r\n for j in range(1, n):\r\n row[j] = row[j] + prevCol\r\n prevCol = row[j]\r\n print (row[n-1])\r\nif __name__ == \"__main__\":\r\n n = int(input())\r\n solve(n)", "n = int(input())\r\nmatrix = [[0 for col in range(n)] for row in range(n)]\r\nmatrix[0] = [1] * n\r\nfor rows in range(1,n):\r\n for cols in range (0,n):\r\n if cols == 0:\r\n matrix[rows][cols] = 1\r\n else:\r\n matrix[rows][cols] = matrix[rows][cols-1] + matrix[rows-1][cols]\r\n\r\n\r\nprint(matrix[-1][-1])", "def get(n,m):\r\n if n==1 or m==1:\r\n return 1\r\n return get(n-1,m) + get(n,m-1)\r\n \r\n \r\na=int(input())\r\nprint(get(a,a))\r\n\r\n", "n=int(input())\r\nls=[[1]*n]\r\nfor _ in range(n-1):\r\n ls.append([1])\r\nfor n1 in range(n-1):\r\n n1+=1\r\n for n2 in range(n-1):\r\n n2+=1\r\n ls[n1].append(ls[n1-1][n2]+ls[n1][n2-1])\r\nprint(ls[-1][-1])", "n=int(input())\r\na=[[0 for x in range(n)] for y in range(n)] \r\nfor x in range(n):\r\n\t\r\n\t\ta[x][0]=1\r\nfor j in range(1,n):\r\n\tfor k in range(n):\r\n\t\ta[0][k]=1\r\n\t\ta[j][k]=a[j-1][k]+a[j][k-1]\r\nprint(max(max(a)))", "n = int(input())\r\n\r\narr = [[0 for x in range(n)] for y in range(n)]\r\n\r\nans = float('-inf')\r\n\r\nfor i in range(len(arr)):\r\n arr[0][i] = 1\r\n arr[i][0] = 1\r\n\r\nfor i in range(len(arr)):\r\n for j in range(len(arr)):\r\n if arr[i][j] == 0:\r\n arr[i][j] = arr[i - 1][j] + arr[i][j - 1]\r\n\r\nfor i in arr:\r\n ans = max(ans, max(i))\r\n\r\nprint(ans)\r\n", "s = int(input())\r\ntable = [[1 for _ in range(s)] for _ in range(s)]\r\n\r\nfor r in range(1, s):\r\n for c in range(1, s):\r\n table[r][c] = table[r - 1][c] + table[r][c - 1]\r\n \r\nprint(table[s - 1][s - 1])", "n = int(input())\r\na = []\r\nb = []\r\nc=0\r\nfor i in range(n):\r\n for j in range(n):\r\n c+=1\r\n if i == 0 or j == 0:\r\n b.append(1)\r\n else:\r\n b.append(a[i-1][j]+b[j-1])\r\n a.append(b)\r\n b=[]\r\n\r\nprint(a[n-1][n-1])", "n=int(input())\r\na=[[i*j*0 for i in range(n)]for j in range(n)]\r\nb=[]\r\nfor i in range(n):\r\n for ii in range(n):\r\n if(i==0 or ii==0):\r\n a[i][ii]=1;\r\n else:\r\n a[i][ii]=a[i][ii]+a[i][ii-1]+a[i-1][ii]\r\n b.append(a[i][ii])\r\nprint(max(b))", "n = int(input())\r\nk = [[0] * n] * n \r\nfor i in range(n):\r\n for j in range(n):\r\n if i == 0 or j == 0:\r\n k[i][j] = 1\r\n else:\r\n k[i][j] = k[i-1][j] + k[i][j-1]\r\nprint(k[-1][-1])", "n = int(input())\r\n\r\nif n == 1:\r\n print(1)\r\nelif n == 2:\r\n print(2)\r\nelif n == 3:\r\n print(6)\r\nelif n == 4:\r\n print(20)\r\nelif n == 5:\r\n print(70)\r\nelif n == 6:\r\n print(252)\r\nelif n == 7:\r\n print(924)\r\nelif n == 8:\r\n print(3432)\r\nelif n == 9:\r\n print(12870)\r\nelse:\r\n print(48620)\r\n", "ile = int(input())\r\nlista = []\r\nnowaLista = []\r\nfor x in range(ile):\r\n lista.append(1)\r\nfor y in range(ile - 1):\r\n nowaLista = []\r\n poczatkowo = 1\r\n ktoryIndeks = 0\r\n\r\n while poczatkowo != len(lista) + 1:\r\n suma = 0\r\n for z in range(poczatkowo):\r\n suma += int(lista[z])\r\n\r\n nowaLista.append(suma)\r\n\r\n poczatkowo += 1\r\n ktoryIndeks += 1\r\n lista = nowaLista\r\n\r\n del nowaLista\r\n\r\nprint(lista[len(lista) - 1])\r\n", "n = int(input())\r\nl = [1]*n\r\na = [0]*n\r\nfor j in range(n-1):\r\n for i in range(n):\r\n a[i] = sum(l[:i+1])\r\n l = a.copy()\r\nprint(max(l))", "a=int(input())\r\nmatrix=[[1]*a]*a\r\n\r\nif a==1:\r\n print(1)\r\nelse: \r\n for i in range(1, a):\r\n for j in range(1, a):\r\n matrix[i][j]=matrix[i-1][j] + matrix[i][j-1] \r\n print(matrix[a-1][a-1])", "import math\r\nfrom math import comb\r\n\r\nn = int(input())\r\nprint(comb(2*n-2,n-1))", "n=int(input())\r\nl=[]\r\na=[]\r\nfor i in range(n):\r\n a.append(1)\r\nfor j in range(n):\r\n l.append(a)\r\n\r\nfor k in range(1,n):\r\n for x in range(1,n):\r\n l[k][x]=l[k][x-1]+l[k-1][x]\r\nprint(l[n-1][n-1])\r\n\r\n", "n = int(input())\r\na = [[1]*n]\r\nfor x in range(n-1):\r\n a.append([1])\r\nfor x in range(1,n):\r\n for y in range(1,n):\r\n a[x].append(a[x-1][y]+a[x][y-1])\r\n\r\nprint(a[-1][-1])", "grid=[]\r\nn=int(input())\r\nfor x in range(n):\r\n list1=[]\r\n if x==0:\r\n for y in range(n):\r\n list1.append(1)\r\n else:\r\n list1.append(1)\r\n for y in range(n-1):\r\n list1.append(0)\r\n grid.append(list1)\r\nfor j in range(1,n):\r\n for i in range(1,n):\r\n grid[i][j]=grid[i][j-1]+grid[i-1][j]\r\nprint(grid[n-1][n-1])", "n=int(input())\r\nif n==1: print(1)\r\nif n==2: print(2)\r\nif n==3: print(6)\r\nif n==4: print(20)\r\nif n==5: print(70)\r\nif n==6: print(252)\r\nif n==7: print(924)\r\nif n==8: print(3432)\r\nif n==9: print(12870)\r\nif n==10: print(48620)", "n = int(input())\r\nlst = [[1] * n for _ in range(n)]\r\nfor i in range(1, n):\r\n for j in range(1, n):\r\n lst[i][j] = lst[i - 1][j] + lst[i][j - 1]\r\nprint(lst[n - 1][n - 1])", "n = int(input())\r\nr = [[0,0,0,0,0,0,0,0,0,0],\r\n [0,0,0,0,0,0,0,0,0,0],\r\n [0,0,0,0,0,0,0,0,0,0],\r\n [0,0,0,0,0,0,0,0,0,0],\r\n [0,0,0,0,0,0,0,0,0,0],\r\n [0,0,0,0,0,0,0,0,0,0],\r\n [0,0,0,0,0,0,0,0,0,0],\r\n [0,0,0,0,0,0,0,0,0,0],\r\n [0,0,0,0,0,0,0,0,0,0],\r\n [0,0,0,0,0,0,0,0,0,0],]\r\nfor i in range(0,n): \r\n for j in range(0, n):\r\n if i == 0:\r\n r[i][j] = 1\r\n else:\r\n r[i][j] = r[i-1][j] + r[i][j-1]\r\nprint(max(max(r)))\r\n# not solved for now\r\n", "def maximum(row, col):\r\n\r\n if row == 1 or col == 1:\r\n return 1\r\n return maximum(row - 1, col) + maximum(row, col - 1)\r\n\r\nn = int(input())\r\nprint(maximum(n,n))", "print(eval(\"//\".join(\"(\"+\"*\".join(str(x) for x in a)+\")\" for a in list([zip([1, 1], *([n+i-1, n] for n in range(1, i))) for i in [int(input())]][0]))))", "dia = int(input(\"\"))\ntable = [[0 for _ in range(dia)] for _ in range(dia)]\nfor i in range(dia):\n for j in range(dia):\n if i == 0 and j == 0:\n table[i][j] = 1\n elif i == 0:\n table[i][j] = table[i][j - 1]\n elif j == 0:\n table[i][j] = table[i - 1][j]\n else:\n table[i][j] = table[i - 1][j] + table[i][j - 1]\nprint(table[-1][-1])\n \t\t\t \t\t\t \t \t \t\t \t\t \t\t \t", "n=int(input())\r\nl=[['' for i in range(n)] for j in range(n)]\r\nfor i in range(1):\r\n for j in range(n):\r\n l[i][j]=1\r\nfor i in range(1,n):\r\n for j in range(1):\r\n l[i][j]=1\r\nm=0\r\nfor i in range(1,n):\r\n for j in range(1,n):\r\n l[i][j]=l[i-1][j]+l[i][j-1]\r\n m=max(l[i][j],m)\r\nif(n==1):\r\n m=1\r\nprint(m)", "m = int(input())\r\nans=1\r\na = []\r\nfor x in range(0,m):\r\n b = []\r\n for y in range(0,m): \r\n if x==0 or y==0:\r\n b.append(1)\r\n else:\r\n b.append(b[y-1]+a[x-1][y])\r\n a.append(b)\r\nprint(a[m-1][m-1])\r\n \r\n", "from math import factorial\r\nn = int(input())\r\nprint(factorial(2 * n - 2) // (factorial(n - 1)) ** 2)\r\n", "from math import ceil\r\n\r\nn = int(input())\r\n\r\ntable = [[1]*n]\r\n\r\nfor i in range(1,n):\r\n table += [[1]*n]\r\n for j in range(n):\r\n if j > 0:\r\n table[i][j] = table[i-1][j] + table[i][j-1]\r\nprint(table[-1][-1])\r\n", "#https://acmp.ru/index.asp?main=task&id_task=27\r\nn= int(input())\r\ntriangle=[]\r\nfor i in range(n):\r\n triangle.append([1]+[1]*n)\r\n\r\nfor i in range(1,n):\r\n for j in range(1,n):\r\n triangle[i][j]=triangle[i-1][j]+triangle[i][j-1]\r\n\r\n\r\nprint(triangle[n-1][n-1])\r\n\r\n\r\n\r\n\r\n", "a=int(input())\r\ns=[[1]*a,[1]]\r\nfor i in range(0,a):\r\n for j in s[i][1:]:\r\n if len(s[-1])!=a:\r\n s[-1].append(j+s[-1][-1])\r\n else:\r\n s.append([1])\r\n s[-1].append(j+s[-1][-1])\r\nprint(s[-2][-1])", "from math import factorial\r\nn=int(input())\r\nc=2*n-2\r\nprint(factorial(c)//(factorial(c//2)*factorial(c-c//2)))", "n = int(input())\r\n\r\nl = []\r\n\r\nfor i in range(n):\r\n if(i==0):\r\n l.append([1 for j in range(n)])\r\n else:\r\n l.append([1]+[0 for j in range(n-1)])\r\n\r\n\r\nfor i in range(1,n):\r\n for j in range(1,n):\r\n l[i][j] = l[i-1][j] + l[i][j-1]\r\n \r\n \r\nprint(l[n-1][n-1])", "n = int(input())\r\n\r\n\r\ndef sum_to_y(x, y, table):\r\n result = 1\r\n for i in range(y):\r\n result += table[x-1][i+1]\r\n return result\r\n\r\n\r\ntable = []\r\n\r\nfor x in range(n):\r\n table.append([])\r\n for y in range(n):\r\n if x == 0:\r\n table[x].append(1)\r\n else:\r\n if y == 0:\r\n table[x].append(1)\r\n else:\r\n table[x].append(sum_to_y(x, y, table))\r\n\r\nprint(table[n-1][n-1])\r\n", "# cook your dish here\r\nimport math\r\nn=int(input())\r\n\r\nprint(int((math.factorial(2*n-2)/math.factorial(n-1)**2)))", "n = int(input())\r\na = [[1] * n] * n\r\nfor i in range(1,n):\r\n for j in range(1,n):\r\n a[i][j] = a[i - 1][j] + a[i][j - 1]\r\nprint(a[n - 1][n - 1])", "n = int(input())\r\n\r\nif n == 1:\r\n print(1)\r\nelse:\r\n lista1 = []\r\n for i in range(n):\r\n lista1.append(1)\r\n \r\n for j in range(n-1):\r\n for i in range(1,n):\r\n lista1[i] = lista1[i] + lista1[i-1]\r\n print(lista1[-1])", "a = int(input())\r\nresult = []\r\nfor i in range(a):\r\n result.append([1] * a)\r\nfor i in range(1, a):\r\n for j in range(1, a):\r\n result[i][j] = result[i - 1][j] + result[i][j - 1]\r\nprint(max(result[a - 1]))", "n = int(input())\r\nif n==1:\r\n print(1)\r\nelse:\r\n arr = [[1]+[0]*(n-1)]*n\r\n arr[0] = [1]*n\r\n for i in range(1,n):\r\n for j in range(1,n):\r\n arr[i][j] = arr[i][j-1] + arr[i-1][j]\r\n print(arr[n-1][n-1])\r\n\r\n", "import math\n\nn = int(input())\nmax_value = math.comb(n + n - 2, n - 1)\nprint(max_value)\n \t \t \t \t\t\t\t \t \t \t\t \t\t \t", "import math\r\n\r\nn = int(input())\r\n\r\nmax_value = math.comb(2 * n - 2, n - 1)\r\nprint(max_value)\r\n", "# Details\r\n'''\r\nContest: CodeForces Round # 289 (Div. 2) \r\nProblem: Maximum in Table\r\nRating: 800\r\nDifficulty: A\r\nAuthor: Sarthak Mittal\r\n'''\r\n\r\n# String to String-List\r\n'''\r\ndef strtolis ():\r\n s = input()\r\n l = []\r\n for i in range s:\r\n l.append(i)\r\n return l\r\n'''\r\n\r\n# List Sum\r\n'''\r\ndef arrsum(a):\r\n sum = 0\r\n for i in a:\r\n sum += i\r\n return sum\r\n'''\r\n \r\n# List Printer\r\n'''\r\ndef printer (a):\r\n for i in a:\r\n print(i, end = ' ')\r\n print()\r\n'''\r\n\r\n# List Maxima\r\n'''\r\ndef maxima (a):\r\n m = a[0]\r\n for i in a:\r\n if (i >= m):\r\n m = i\r\n return m\r\n'''\r\n\r\n# List Minima\r\n'''\r\ndef minima (a):\r\n m = a[0]\r\n for i in a:\r\n if (i <= m):\r\n m = i\r\n return m\r\n'''\r\n\r\n# List Sorter\r\n'''\r\ndef sorter (a):\r\n a.sort()\r\n'''\r\n\r\n# Rhetoric Printer\r\n'''\r\ndef rhetoric (b):\r\n if (b):\r\n print('YES')\r\n else:\r\n print('NO')\r\n'''\r\n\r\n# String to Integer-List\r\n'''\r\ndef arrin ():\r\n return list(map(int,input().strip().split()))\r\n'''\r\n\r\n# Testcases\r\n'''\r\ndef testcases ():\r\n return range(int(input()))\r\n'''\r\n\r\ndef nCr (n,r):\r\n if r > n:\r\n return 0\r\n elif r == 0:\r\n return 1\r\n elif r == 1:\r\n return n\r\n return nCr(n - 1,r) + nCr(n - 1,r - 1)\r\n\r\nn = 2 * (int(input()) - 1)\r\nprint(nCr(n,n // 2))", "raz_tabl = int(input())\r\nperv_tabl = [1]*raz_tabl\r\nvtor_tabl = [1]\r\nfor _ in range(2,raz_tabl+1):\r\n for i in range(2,raz_tabl+1):\r\n vtor_tabl.append(perv_tabl[i-1]+vtor_tabl[i-2])\r\n else:\r\n perv_tabl = vtor_tabl\r\n vtor_tabl = [1]\r\nprint(perv_tabl[-1])\r\n", "x = int(input())\r\nmas = [[0 for j in range(x)] for i in range(x)]\r\nmas[0] = [1 for i in range(x)]\r\nfor i in range(x):\r\n for j in range(x):\r\n if j == 0:\r\n mas[i][j] = 1\r\n else:\r\n mas[i][j] = mas[i - 1][j] + mas[i][j - 1]\r\n\r\nprint(mas[x - 1][x - 1])", "n=int(input())\r\nd=[[0 for i in range(n)] for i in range(n)]\r\nfor i in range(n):\r\n for j in range(n):\r\n if j==0:\r\n d[i][j]=1\r\n else:\r\n d[i][j]=d[i][j-1]+d[i-1][j]\r\nprint(d[-1][-1])", "c=int(input())\r\na=[[1]*c for i in range(c)]\r\nfor k in range(1,c):\r\n for l in range(1,c):\r\n a[k][l]=a[k-1][l]+a[k][l-1]\r\nprint(a[-1][-1])\r\n\r\n\r\n\r\n \r\n \r\n \r\n", "# Author: José Rodolfo (jric2002)\r\nn = int(input())\r\na = [[1 for c in range(n)] for r in range(n)]\r\nfor i in range(1, n):\r\n for j in range(1, n):\r\n a[i][j] = a[i - 1][j] + a[i][j - 1]\r\nm = a[n - 1][n - 1]\r\nprint(m)", "n=int(input())\r\nl=[0,1,2,6,20,70,252,924,3432,12870,48620]\r\nprint(l[n])", "n=int(input())\nini=[1 for i in range(n)]\n\n# for i in range(n):\n# new=[]\n# k=0\n# # print(type(k),type(ini[0]))\n# for j in ini:\n# nsm=j+k\n# k=nsm\n# new.append(nsm)\n# ini=new\n# print(new)\nif n==1:\n print(1)\nelse:\n for i in range(n-1):\n new=[]\n k=0\n for j in range(n):\n nsm=ini[j]+k\n k=nsm\n new.append(nsm)\n ini=new\n print(max(new))\n", "n=int(input())\r\nrow=[1]*n\r\nfor i in range(1,n):\r\n for p in range(1,n):\r\n row[p]=row[p]+row[p-1]\r\nprint(row[n-1])", "x1=int(input())\r\nx=range(x1)\r\ndata=[1]*x1\r\nfor i in x:\r\n\tdata[i]=[1]*x1\r\nmax_number =1\r\nfor i in x :\r\n\tfor j in x :\r\n\t\tif i!=0 and j!=0:\r\n\t\t\tdata[i][j]=data[i-1][j]+data[i][j-1]\r\nprint(data[x1-1][x1-1])\r\n", "import math\r\nn = int(input())\r\nprint(math.comb(2 * (n - 1), n - 1))\r\n", "n=int(input())\r\nd=1\r\ng=1\r\nfor i in range(1,2*n-1):\r\n\td*=i\r\nfor i in range(1,n):\r\n\tg*=i\r\nprint(d//(g**2))", "possible_value = {1:1,2:2,3:6,4:20,5:70,6:252,7:924,8:3432,9:12870,10:48620}\r\nprint(possible_value[int(input())])", "n = int(input())\narr = []\nfor i in range(n):\n arr.append([])\n for j in range(n):\n arr[i].append(1)\n if i == 0 or j == 0:\n arr[i][j] = 1\n else:\n arr[i][j] = arr[i - 1][j] + arr[i][j - 1]\nmaxes = []\nfor i in range(n):\n maxes.append(max(arr[i]))\nmix = -1\nfor i in range(n):\n if maxes[i] > mix:\n mix = maxes[i]\nprint(mix)\n\t \t\t\t \t\t\t\t\t \t\t \t\t \t\t\t\t", "#!/bin/python3\nfrom sys import stdin\nfrom collections import *\nfrom copy import deepcopy as dc\ninf = float('inf')\ndef rn(f=int):\n return f(stdin.readline())\ndef rns(n, f=int):\n return [rn(f) for _ in range(n)]\ndef rl(f=int):\n return list(map(f, stdin.readline().split()))\ndef rls(n, f=int):\n return [rl(f) for _ in range(n)]\ndef rs():\n return stdin.readline().strip()\ni = rn()\nm = [[0 for _ in range(i)] for __ in range(i)]\nfor j in range(i):\n m[j][0] = 1\n m[0][j] = 1\nfor p in range(1, i):\n for q in range(1, i):\n m[p][q] = m[p-1][q] + m[p][q-1]\nprint(m[-1][-1])\n", "n=int(input())\r\nif n==1:\r\n print(1)\r\nelse:\r\n arr=[]\r\n to_ap=[1]*n\r\n for i in range(n):\r\n arr.append(to_ap)\r\n for i in range(1,n):\r\n for j in range(1,n):\r\n arr[i][j]=arr[i-1][j]+arr[i][j-1]\r\n\r\n print(arr[n-1][n-1])", "table_size = int(input())\r\n\r\nvalues = [[0] * table_size for i in range(table_size)]\r\n# TODO: is there an analytical solution? not brute force\r\nfor i in range(table_size):\r\n values[0][i] = 1\r\n values[i][0] = 1\r\n\r\nfor row in range(1, table_size):\r\n for col in range(1, table_size):\r\n values[row][col] = values[row][col - 1] + values[row - 1][col]\r\n\r\nprint(values[table_size - 1][table_size - 1])\r\n", "n = int(input())\r\n\r\narr = [[0 for _ in range(n)] for _ in range(n)]\r\n\r\nfor i in range(n):\r\n for j in range(n):\r\n if i==0 or j==0:\r\n arr[i][j]=1\r\n\r\nfor i in range(1,n):\r\n for j in range(1,n):\r\n arr[i][j]=arr[i-1][j] + arr[i][j-1]\r\n \r\nprint(arr[n-1][n-1])", "from itertools import accumulate\r\nimport operator\r\nmaxx=0\r\nn=int(input())\r\nz=[]\r\nl=[1 for i in range(n)]\r\nz.append(1)\r\nfor i in range(n-1):\r\n result=accumulate(l,operator.add)\r\n c=[]\r\n for k in result:\r\n c.append(k)\r\n l=c\r\n z.append(max(l))\r\nprint(max(z))", "n = int(input())\r\narr = [[0]*n]*n\r\nfor i in range(n):\r\n for j in range(n):\r\n if i == 0 or j == 0:\r\n arr[i][j] = 1\r\n else:\r\n arr[i][j] = arr[i-1][j] + arr[i][j-1]\r\nprint(arr[n-1][n-1])\r\n", "\r\n\r\n\r\nimport math\r\nn =int(input())\r\nk = 2*n-2\r\nans = math.factorial(k)/((math.factorial(n-1))*(math.factorial(n-1)))\r\nprint(int(ans))\r\n", "n = int(input())\r\nlst = list([1 for _ in range(n)])\r\nfor i in range(n - 1):\r\n new_lst = [1]\r\n for j in range(n - 1):\r\n new_lst.append(lst[j + 1] + new_lst[-1])\r\n lst = new_lst\r\nprint(lst[-1])", "n = int(input())\n\n\ndef sum(i, j, memo={}):\n if i == 1 or j == 1:\n return 1\n\n if (min(i, j), max(i, j)) in memo:\n return memo[(min(i, j), max(i, j))]\n\n val = sum(i - 1, j, memo) + sum(i, j - 1, memo)\n memo[(min(i, j), max(i, j))] = val\n return val\n\n\nprint(sum(n, n))\n\n", "n = int(input())\r\nlst = [1] * n\r\nfor j in range(n-1):\r\n for i in range(1,n):\r\n lst[i] = lst[i-1]+lst[i]\r\nprint(lst[-1])", "n=int(input())\r\nc=[]\r\nfor x in range(n):\r\n r=[]\r\n if x==0:\r\n r=[1]*n\r\n else:\r\n for y in range(n):\r\n if y==0:\r\n r.append(1)\r\n else:\r\n r.append(r[y-1]+c[x-1][y])\r\n c.append(r)\r\nprint(max(max(c)))", "l=[1,2,6,20,70,252,924,3432,12870,48620]\r\nk=int(input())\r\nprint(l[k-1])", "n = int(input())\r\nt = []\r\nfor i in range(n):\r\n t.append([1] + [0] * (n - 1))\r\nfor x in range(n):\r\n for z in range(1, n):\r\n t[x][z] = t[x][z - 1] + t[x - 1][z]\r\nprint(max(max(t)))", "n = int(input())\r\ndef x(r,c):\r\n if r==1 or c==1:\r\n return 1\r\n else:\r\n return x(r,c-1)+x(r-1,c)\r\n\r\nprint(x(n,n))\r\n ", "N = int(input())\r\n\r\n# 初始化\r\nmatrix = [[0] * N] * N\r\nfor i in range(N):\r\n matrix[0][i] = 1\r\n matrix[i][0] = 1\r\n\r\nfor i in range(1, N):\r\n for j in range(1, N):\r\n matrix[i][j] = matrix[i-1][j] + matrix[i][j-1]\r\n\r\nprint(matrix[N-1][N-1])", "n = int(input())\r\nA =[[0] * n for i in range(n)]\r\nfor i in range (n):\r\n for j in range(n):\r\n if i == 0:\r\n A[i][j] = 1\r\n elif j == 0:\r\n A[i][j] = 1\r\n else:\r\n A[i][j] = A[i - 1][j] + A[i][j - 1]\r\nprint(A[n-1][n-1])", "inp = input()\r\nx = int(inp)\r\narr = []\r\n\r\nfor i in range(x):\r\n arr += [[0]*x]\r\n\r\nfor i in range(x):\r\n for j in range(x):\r\n if (i==0 or j==0):\r\n arr[i][j] = 1\r\n else:\r\n arr[i][j] = 0\r\n \r\nfor i in range(1,x):\r\n for j in range(1,x):\r\n arr[i][j] = arr[i-1][j] + arr[i][j-1]\r\n \r\nprint(arr[x-1][x-1])", "n = int(input())\nL = []\nfor i in range(n):\n sm_l = []\n for j in range(n):\n if i == 0 or j == 0:\n sm_l.append(1)\n else:\n sm_l.append(sm_l[-1]+L[i-1][j])\n L.append(sm_l)\nprint(L[n-1][n-1])\n\n\t\t \t \t \t \t \t \t\t\t\t \t \t", "n = int(input())\r\n\r\n\r\ndef elem(row, col):\t\r\n\tif row == 1 or col == 1:\r\n\t\treturn 1\r\n\telse:\r\n\t\treturn elem(row - 1, col) + elem (row, col - 1)\r\n\t\r\n\t\r\nans = elem(n, n)\r\nprint(ans)", "n = int(input())\r\ntriangle = [[0]*n for i in range(n)]\r\nmax_triangle = []\r\n\r\nfor i in range(n):\r\n for j in range(n):\r\n triangle[0][j] = 1\r\n triangle[i][0] = 1\r\n\r\nfor i in range(1, n):\r\n for j in range(1, n):\r\n triangle[i][j] = triangle[i-1][j] + triangle[i][j-1]\r\n\r\nfor i in triangle:\r\n max_triangle.append(max(i))\r\n\r\nprint(max(max_triangle))", "elem = int(input())\r\na = []\r\nfor i in range(elem):\r\n if i == 0:\r\n a.append([1] * elem)\r\n else:\r\n temp = [0] * elem\r\n temp[0] = 1\r\n a.append(temp)\r\nfor i in range(elem):\r\n for j in range(elem):\r\n if a[i][j] == 0:\r\n a[i][j] = a[i-1][j] + a[i][j-1]\r\nprint(a[elem-1][elem-1])", "n = int(input())\n\narr = []\n\nfline = []\nfor i in range(n):\n fline.append(1)\n\narr.append(fline)\n\nfor i in range(1 , n):\n line = [1]\n for j in range(1 , n):\n line.append(arr[i-1][j] + line[j-1])\n arr.append(line)\n\nprint(arr[n-1][n-1])\n \t \t \t\t\t \t\t \t\t \t\t \t", "\n\n\nn = int(input())\n\nm = [[1for i in range(n)] for j in range(n)]\n\nfor i in range(n):\n for j in range(n):\n if i != 0 and j != 0:\n m[i][j] = m[i-1][j] + m[i][j-1]\nprint( m[n-1][n-1])\n", "import itertools\r\nn = int(input())\r\narr = [[1 for _ in range(n)]]\r\nfor i in range(1, n):\r\n temp = [1]\r\n for j in range(1,n):\r\n temp.append(arr[i-1][j] + temp[j-1])\r\n arr.append(temp)\r\nprint(arr[n-1][n-1])", "n = int(input())\r\nlm = []\r\nl=[]\r\nfor i in range(n):\r\n l+=[1]\r\nlm+=[l]\r\nfor r in range(n-1):\r\n l1 =[]\r\n l1.append(1)\r\n for u in range(n-1):\r\n l1.append(l1[u]+lm[r][u+1])\r\n lm+=[l1]\r\nprint(lm[n-1][n-1])\r\n \r\n" ]

[ "n,a=int(input()),[]\r\nfor i in range(n):a.append(list(map(int,input().split())))\r\nm,b=int(input()),[]\r\nfor i in range(m):b.append(list(map(int,input().split())))\r\nans = 0\r\nfor room in a:\r\n p,c_room=2*(room[0]+room[1]),10**10\r\n for ob in b:\r\n z=ob[0]//room[2]*ob[1]\r\n if z==0:continue\r\n c_room=min((p+z-1)//z*ob[2], c_room)\r\n ans+=c_room\r\nprint (ans)\r\n", "from math import ceil\r\nn = int(input())\r\nmas = []\r\nmatrix = []\r\nfor i in range(n):\r\n d, l, h = map(int, input().split())\r\n mas.append((d, l, h))\r\nm = int(input())\r\nfor i in range(m):\r\n matrix.append(tuple(map(int, input().split())))\r\nans = 0\r\nfor i in range(len(mas)):\r\n minimum = 10 ** 9\r\n per = 2 * (mas[i][0] + mas[i][1])\r\n for j in range(len(matrix)):\r\n foring = matrix[j][0] // mas[i][2]\r\n if foring != 0:\r\n minimum = min(minimum, ceil(per / (foring * matrix[j][1])) * matrix[j][2])\r\n ans += minimum\r\nprint(ans)", "import abc\r\nimport itertools\r\nimport math\r\nfrom builtins import input\r\nfrom math import gcd as gcd\r\nimport sys\r\nimport queue\r\nimport itertools\r\nfrom heapq import heappop, heappush\r\nimport random\r\n\r\n\r\ndef solve():\r\n n = int(input())\r\n rooms = []\r\n\r\n for i in range(n):\r\n l, w, h = map(int, input().split())\r\n rooms.append([l, w, h])\r\n\r\n m = int(input())\r\n papers = []\r\n for i in range(m):\r\n l, w, cost = map(int, input().split())\r\n papers.append([l, w, cost])\r\n\r\n res = 0\r\n for l, w, h in rooms:\r\n p = 2 * (l + w)\r\n mn = 1 << 60\r\n for ll, ww, cost in papers:\r\n if ll < h:\r\n pass\r\n else:\r\n u = ll // h\r\n mn = min(mn, cost * (((p + ww - 1) // ww + u - 1) // u))\r\n #print(cost * (((p + ww - 1) // ww + u - 1) // u))\r\n res += mn\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", "import math\r\nn = int(input())\r\nlis=[]\r\nwall=[]\r\nfor _ in range(n):\r\n a,b,c = map(int,input().split())\r\n lis.append([a,b,c])\r\nm = int(input())\r\nfor _ in range(m):\r\n a,b,c = map(int,input().split())\r\n wall.append([a,b,c]) \r\nans=0\r\nfor i in range(n):\r\n tmp=1000000000000000\r\n x,y,z = lis[i]\r\n for j in range(m):\r\n a,b,c = wall[j]\r\n if a//z==0:\r\n continue\r\n else:\r\n cove=(a//z)*b\r\n tmp=min(tmp,math.ceil((2*(x+y))/cove)*c)\r\n ans+=tmp\r\nprint(ans) \r\n" ]

[ "from collections import defaultdict\r\nimport sys\r\ninput = sys.stdin.readline\r\n\r\ndef make_tree(n):\r\n tree = [0] * (n + 1)\r\n return tree\r\n\r\ndef get_sum(i):\r\n s = 0\r\n while i > 0:\r\n s += tree[i]\r\n i -= i & -i\r\n return s\r\n\r\ndef get_sum_segment(s, t):\r\n if s > t:\r\n return 0\r\n ans = get_sum(t) - get_sum(s - 1)\r\n return ans\r\n\r\ndef add(i, x):\r\n while i <= n:\r\n tree[i] += x\r\n i += i & -i\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\nd = defaultdict(lambda : [])\r\ntree = make_tree(n)\r\nfor i in range(n):\r\n a[i] = min(a[i], n)\r\n d[a[i]].append(i)\r\n add(i + 1, 1)\r\nans = 0\r\nfor i in range(n):\r\n ans += get_sum_segment(i + 2, a[i])\r\n for j in d[i + 1]:\r\n add(j + 1, -1)\r\nprint(ans)", "from bisect import bisect_left, bisect_right\r\nn = int(input())\r\na = list(map(int, input().split()))\r\n\r\nans = 0\r\n\r\n\r\n#ans = slow_test()\r\nclass fenwick():\r\n \"\"\"\r\n This Tree Data Structure speeds up caliculating summations of partial sum \r\n and also updating subsets of sequences. Both queries finish in logarithmic times.\r\n \"\"\"\r\n # 1-indexed\r\n\r\n def __init__(self, n):\r\n self.n = n\r\n self.data = [0]*(n+1)\r\n\r\n def to_sum(self, i):\r\n # return sigma(a_j) (0<=j<=i)\r\n s = 0\r\n while i > 0:\r\n s += self.data[i]\r\n i -= (i & -i)\r\n return s\r\n\r\n def add(self, i, x):\r\n #a_i -> a_i + x\r\n while i <= self.n:\r\n self.data[i] += x\r\n i += (i & -i)\r\n\r\n def get(self, i, j):\r\n # return sigma(a_k) (i<=k<=j)\r\n # assert 1<=i<=j<= N\r\n return self.to_sum(j)-self.to_sum(i-1)\r\n\r\n\r\nQ = fenwick(n + 10)\r\nBIGGER = n + 5\r\nseq = [(a[i], i) for i in range(n)]\r\nA = a.copy()\r\nfor i in range(n):\r\n if i < a[i]:\r\n ans -= 1\r\na.sort()\r\nseq.sort(key=lambda x: x[0])\r\nlindex = 0\r\nfor a_r, r in seq:\r\n if a_r > n:\r\n ans += n - bisect_right(a, r)\r\n continue\r\n else:\r\n for i in range(lindex, a_r):\r\n if A[i] <= n:\r\n Q.add(A[i], 1)\r\n else:\r\n Q.add(BIGGER, 1)\r\n ans += Q.get(r+1, BIGGER + 1)\r\n lindex = a_r\r\nans //= 2\r\nprint(ans)\r\n\r\n", "from sys import stdin\r\nfrom sys import setrecursionlimit as SRL; SRL(10**7)\r\nrd = stdin.readline\r\nrrd = lambda: map(int, rd().strip().split())\r\n\r\nn = int(input())\r\na = list(rrd())\r\n\r\nbit = [0]*(n+100)\r\n\r\ndef ins(x):\r\n while x<=n:\r\n bit[x] += 1\r\n x += x&(-x)\r\n\r\ndef get(l):\r\n tot = 0\r\n while l:\r\n tot += bit[l]\r\n l -= l&(-l)\r\n return tot\r\n\r\nta = []\r\npans = 0\r\nfor i in range(len(a)):\r\n if a[i] > i:\r\n pans += 1\r\n ta.append([i+1, a[i]])\r\n\r\nta.sort(key=lambda x: x[1])\r\n\r\nans = 0\r\nnow = 0\r\nfor x in ta:\r\n while now < min(n,x[1]):\r\n if a[now] <= n:\r\n ins(a[now])\r\n now += 1\r\n ans += now - get(x[0]-1)\r\n\r\nprint((ans-pans)//2)\r\n\r\n\r\n" ]

[ "n, m, z = (int(i) for i in input().split())\r\n\r\ncalls = set(i for i in range(0, z + 1, n))\r\nart = set(i for i in range(0, z + 1, m))\r\n\r\nprint(len(calls & art) - 1)", "n, m, z = [int(i) for i in input().split()]\r\n \r\ncopy_n = n\r\ncopy_m = m\r\n \r\nx = 1\r\ncnt = 0\r\nwhile x <= z:\r\n if n == x:\r\n n += copy_n\r\n if m == x:\r\n m += copy_m\r\n cnt += 1\r\n x += 1\r\n continue\r\n if x == m:\r\n m += copy_m\r\n x += 1\r\nprint(cnt)", "from fractions import gcd\r\nn,m,z = map(int , input().split())\r\ngc = n*m//gcd(n,m)\r\nprint(z//gc)\r\n", "from fractions import gcd\r\nn, m, z = [int(i) for i in input().split()]\r\nc = int((n / gcd(n, m)) * m)\r\nprint(z // c)", "n,m,a = list(map(int,input().strip().split()))\r\nl = []\r\no = []\r\nfor i in range(n,a+1,n):\r\n l+=[i]\r\nfor i in range(m,a+1,m):\r\n o+=[i]\r\np=0\r\nfor i in l:\r\n if i in o:\r\n p+=1\r\nprint(p)\r\n \r\n", "n,m,z = map(int, input().split(\" \"))\r\na = set()\r\nc = set()\r\nfor i in range(1,z+1):\r\n if (i*m <= z):\r\n a.add(i*m)\r\n if (i*n <= z):\r\n c.add(i*n)\r\ncommons = len(set(a) - (set(a) - set(c)))\r\nprint(commons)", "n,m,z=map(int,input().split())\r\nx,y=[],[]\r\nfor i in range(1,z//n+1):\r\n x.append(n*i)\r\nfor i in range(1,z//m+1):\r\n y.append(m*i)\r\nl=set(x)&set(y)\r\nprint(len(l))\r\n", "a,b,c=map(int,input().split(\" \"))\r\nif(a==1 or b==1):\r\n print(min(c//a,c//b))\r\nelse:\r\n l=[k for k in range(1,c+1) if (k%a==0 and k%b==0)]\r\n print(len(l))", "from math import gcd\r\nn,m,z = [int(n) for n in input().split()]\r\nprint(z//(n*m//gcd(n,m)))", "import math\r\na, b, c = [int(i) for i in input().split()]\r\n\r\ngdf = a * b // math.gcd(a, b)\r\n\r\nans = 0\r\n\r\nfor i in range(1, c + 1):\r\n if i % gdf == 0:\r\n ans += 1\r\n\r\nprint(ans)", "#Codeforces Round #395 Div2A solution\r\nfrom math import gcd\r\n\r\nn, m, z = map(int, input().split())\r\ng = gcd(n, m)\r\nlcm = n * m // g\r\nprint(z // lcm)", "a, b, c = map(int, input().split())\r\nd = [0] * (c // a)\r\ne = [0] * (c // b)\r\ny = 0\r\nf = 0\r\nfor i in range(a, c+1, a):\r\n d[y] = i\r\n y += 1\r\nfor i in range(b, c+1, b):\r\n e[f] = i\r\n f += 1\r\nr = 0\r\nfor i in range(0, len(d)):\r\n if d[i] in e:\r\n r += 1\r\nprint(r)\r\n", "from math import gcd\nn, m, z = map(int,input().split())\ncounter = 0\nfor i in range(n*m//(gcd(n,m)), z+1, n*m//(gcd(n,m))):\n counter += 1\nprint(counter)", "nmz = list(map(int, input().split()))\r\ncounter = 0\r\nfor i in range(min(nmz[0], nmz[1]), nmz[2] + 1):\r\n\tif i % nmz[0] == 0 and i % nmz[1] == 0:\r\n\t\tcounter += 1\r\nprint(counter)", "ilyushaT, artistsT, timeline = [int(x) for x in input().split(' ')]\r\ndrownArtists = 0\r\nArtistTime = artistsT\r\nIlyushaTime = ilyushaT\r\nfor sec in range(1, timeline+1):\r\n\tif sec == IlyushaTime and sec == ArtistTime:\r\n\t\tdrownArtists += 1\r\n\tif sec == ArtistTime:\r\n\t\tArtistTime += artistsT\r\n\tif sec == IlyushaTime:\r\n\t\tIlyushaTime += ilyushaT\r\nprint(drownArtists)", "n, m, z = list(map(int, input().split()))\r\n\r\ni = 1\r\nwhile n*i % m != 0:\r\n i += 1\r\nprint(z//(n*i))\r\n", "import math \n\ndef main():\n\tn,m,z = map(int,input().split())\n\tg = math.gcd(n,m)\n\tlcm = n*m//g\n\tprint(z//lcm)\n\n\nif __name__ == '__main__':\n\tmain()", "a,b,c=map(int,input().split())\r\nr,t=[],[]\r\ni=1;q=1\r\nz=0\r\nwhile (b*i)<(c+1):\r\n t.append(b*i)\r\n i+=1\r\nwhile (a*q)<(c+1):\r\n r.append(a*q)\r\n q+=1\r\nfor i in r:\r\n if i in t:\r\n z+=1\r\nprint(z)\r\n", "import math\r\n\r\nn , m , z = map(int , input().split())\r\n\r\n\r\na = math.gcd(n , m)\r\n\r\nb = n * m // a\r\n\r\n\r\n \r\nprint(z // b)\r\n ", "x,y,z=map(int,input().split())\r\nm=[i for i in range(1,z+1) if i%x==0 and i%y==0]\r\nprint(len(m))", "n,m,z=map(int,input().split())\r\nc=[n*i for i in range(1,z+1) if n*i<=z]\r\na=[m*i for i in range(1,z+1) if m*i<=z]\r\nq=0\r\nfor i in c:\r\n\tif i in a:\r\n\t\tq+=1\r\nprint(q)", "import math\r\nf=lambda:map(int,input().split())\r\nn,m,z=f()\r\nc=0\r\nlcm=n*m//math.gcd(n,m)\r\nwhile lcm*(c+1)<=z:\r\n c+=1\r\nprint(c)", "n,m,z=[int(i) for i in input().split()]\r\n\r\nfrom math import gcd\r\ng = gcd(n,m)\r\ng = n*m//g\r\nprint(z//g)", "x,y,z=map(int,input().split())\nt=0\na=list()\nb=list()\nfor i in range(1,z+1):\n if x*i <=z :\n a.append(x*i)\n if y*i <=z:\n b.append(y*i)\nprint(len(list(set(b)&set(a))))\n\t\t\t\t\t\t\t\t \t\t \t \t\t \t\t\t\t \t \t\t\t", "n,m,z=list(map(int,input().strip().split()))\r\nl=[]\r\nt=[]\r\nfor i in range(n,z+1,n):\r\n l +=[i]\r\nfor j in range(m,z+1,m):\r\n t +=[j]\r\np=0\r\nfor i in l:\r\n if i in t:\r\n p +=1\r\nprint(p)\r\n\r\n\r\n", "n, m, z = map(int, input().split())\r\n\r\ncount = 0\r\nfor i in range(n, z+1, n):\r\n if i%m == 0:\r\n count +=1\r\n\r\nprint(count)", "a,b,c=map(int,input().split())\r\nl=0\r\nfor n in range(1,c+1):\r\n if n%a==0 and n%b==0:\r\n l+=1\r\nprint(l)", "z=input\r\n\r\nn,m,k=(map(int,z().split()))\r\nc=0\r\nfor i in range(1,k+1):\r\n if i%n==00 and i%m==0 :\r\n c+=1\r\nprint(c)\r\n", "from math import gcd\r\ndef lcm(a, b):\r\n return (a*b)//gcd(a, b)\r\ndef main():\r\n n, m, t = [int(i) for i in input().split()]\r\n print(t//lcm(n, m))\r\nmain()\r\n", "a,b,c=map(int,input().split());from math import ceil as z;s=list(i*a for i in range(1,z((c+1)/a)));s1=list(i*b for i in range(1,z((c+1)/b)));print(len(s)+len(s1)-len(set(s+s1)))", "import math\r\n\r\nn, m, z = map(int, input().split())\r\n \r\ndef lcm(a, b):\r\n return abs(a*b) // math.gcd(a, b)\r\n \r\ndef calculate(n, m, z):\r\n res = lcm(n,m)\r\n return z // res\r\n \r\nprint(calculate(n, m, z))", "# import sys\r\n# sys.stdin=open(\"input.in\",\"r\")\r\n# sys.stdout=open(\"output.out\",\"w\")\r\nn,m,z=map(int,input().split())\r\ndef gcd(n,m):\r\n\tif m==0:\r\n\t\treturn n\r\n\telse:\r\n\t\treturn gcd(m,n%m)\r\nlcm=int((m*n)/gcd(m,n))\r\nprint(int(z/lcm))", "import math\r\nn,m,z = map(int, input().split())\r\nprint(z//((m*n)//math.gcd(n,m)))", "n,m,k=map(int,input().split())\r\ncount=0\r\nfor i in range(1,k+1):\r\n\tif i%n==0 and i%m==0:\r\n\t\tcount+=1\r\nprint(count)", "n, m, z = [int(i) for i in input().split()]\r\nc = 0\r\nfor i in range(1, z//m+1):\r\n if (m*i) % n == 0:\r\n c += 1\r\nprint(c)", "n,m,z=map(int,input().split())\na=[]\ncount=0\nfor i in range(0,z+1,1):\n a.append(0)\nfor i in range(n,z+1,n):\n a[i]=1\nfor i in range(m,z+1,m):\n if a[i]==1:\n count+=1\nprint(\"%d\"%count)\n \t\t \t\t \t\t \t\t\t \t\t \t\t \t\t\t", "n, m, z = map(int, input().split())\n\nk = m\ncount = 0\ni = n\n\nwhile(i <= z):\n if i==k:\n count+=1\n if k<i: k+=m\n elif i<k: i+=n\n else:\n k+=m\n i+=n\nprint(count)", "n,m,t=map(int,input().split())\r\ncount=0\r\nfor i in range(1,t+1):\r\n\tif i%n==0 and i%m==0:\r\n\t\tcount+=1\r\nprint(count)\t\t", "__author__ = \"Ryabchun Vladimir\"\nn, m, z = map(int, input().split())\ntime_line = [False for _ in range(z)]\ncall = n-1\nwhile call < z:\n time_line[call] = True\n call += n\nactor_coming = m-1\nans = 0\nwhile actor_coming < z:\n if time_line[actor_coming] is True:\n ans += 1\n actor_coming += m\n else:\n actor_coming += m\nprint(ans)", "n, m, z = (int(el) for el in input().split())\r\ncnt = 0\r\nfor i in range(1, z + 1):\r\n if i % n == 0 and i % m == 0:\r\n cnt += 1\r\nprint(cnt)", "from math import gcd\r\nn, m, z = map(int, input().split())\r\n#print(len(set(list(range(n,z+1,n))).intersection(set(list(range(m,z+1,m))))))\r\nprint(z // (n*m // gcd(n, m)))", "from math import gcd\r\nif __name__ == '__main__':\r\n n,m,z = map(int, input().split())\r\n print(z // (n*m // gcd(n,m)))\r\n", "n,m,z=map(int,input().split())\r\nl1=set()\r\nl2=set()\r\nfor i in range(n,z+1,n):\r\n\tl1.add(i)\r\nfor j in range(m,z+1,m):\r\n\tl2.add(j)\r\nprint(len(l1&l2))\r\n", "n,m,z=map(int,input().split())\r\ndef gcd(a,b):\r\n if(b==0):\r\n return a\r\n else:\r\n return gcd(b,a%b)\r\ngd=gcd(n,m)\r\nlm=(n*m)//gd\r\nprint(z//lm)", "def gcd(x,y):\r\n if y==0:\r\n return x\r\n else:\r\n return gcd(y,x%y)\r\ndef ppcm(x,y):\r\n return x*y//gcd(x,y)\r\nn,m,z=map(int,input().split())\r\nc=ppcm(n,m)\r\nx=c\r\nkill=0\r\nwhile(x<=z):\r\n kill+=1\r\n x+=c\r\nprint(kill)", "def gcd(big, small):\r\n if big % small == 0:\r\n return small\r\n return gcd(small, big % small)\r\n\r\n\r\nn, m, z = map(int, input().split())\r\np = n * m // gcd(n, m)\r\nprint(z // p)", "a = input().split()\r\nn = int(a[0])\r\nm = int(a[1])\r\nz = int(a[2])\r\ni = 1\r\nres = 0\r\nwhile i * n <= z:\r\n if i * n % m == 0:\r\n res += 1\r\n i += 1\r\nprint(res)", "from math import gcd\r\na,b,c=map(int,input().split())\r\ngc= gcd(a,b)\r\nlcm= (a*b)//gc\r\nval = c//lcm\r\nprint(val)", "# import sys\r\n# sys.stdin = open(\"test.in\",\"r\")\r\n# sys.stdout = open(\"test.out\",\"w\")\r\nn,m,z=map(int,input().split())\r\na=0\r\nfor i in range(1,z+1):\r\n\tif i%n==0 and i%m==0:\r\n\t\ta+=1\r\nprint(a)\t\t", "import sys\r\n\r\n\r\ndef check(n, m, z):\r\n count = 0\r\n xn = n\r\n xm = m\r\n while xn <= z or xm <= z:\r\n if xn == xm:\r\n count += 1\r\n xn += n\r\n xm += m\r\n else:\r\n if xn < xm:\r\n xn += n\r\n else:\r\n xm = xm + m\r\n return count\r\n\r\n\r\ndef main():\r\n n, m, z = map(int, sys.stdin.readline().split())\r\n print(check(n, m, z))\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n,m,z=[int(i) for i in input().split()]\r\nl=[]\r\nnn=n\r\nwhile n<=z:\r\n if n%m==0:\r\n l.append(n)\r\n n+=nn\r\nprint(len(l))", "import math\r\nn, m, z = map(int, input().split())\r\nlcm_nm = (n * m) // math.gcd(n, m)\r\nkill= z // lcm_nm\r\nprint(kill)\r\n", "from math import ceil, floor\r\n\r\nip = input().split(\" \")\r\nip1 = int(ip[0])\r\nip2 = int(ip[1])\r\nip3 = int(ip[2])\r\nres = 0\r\ni = 1\r\nwhile i <= ip3:\r\n if i % ip2 == 0 and i % ip1 == 0:\r\n res += 1\r\n i += 1\r\nprint(res)\r\n", "def int_lst_input():\n return [int(val) for val in input().split(' ')]\n\ndef int_input():\n return int(input())\n\ndef print_lst(lst):\n print(' '.join([str(val) for val in lst]))\n\ndef solve():\n n, m, z = int_lst_input()\n n_min = {n * i for i in range(1, z + 1) if n * i <= z}\n m_min = {m * i for i in range(1, z + 1) if m * i <= z}\n\n print(len(n_min.intersection(m_min)))\n\nif __name__ == '__main__':\n solve()\n", "def solution():\r\n n, m, z = map(int, input().split())\r\n call = []\r\n for x in range(1, z + 1):\r\n if x * n <= z:\r\n call.append(x * n)\r\n if x * m <= z:\r\n call.append(x * m)\r\n print(len(call) - len(set(call)))\r\n\r\n\r\nsolution()", "n,m,z = map(int, input().split())\n\nans = 0\nfor t in range (1,z+1):\n if t % n == 0 and t %m == 0:\n ans += 1\nprint(ans)\n\n", "[n, m, z] = [int(x) for x in input().split()]\r\ndef gcd(a, b): return max(a, b) if min(a, b) == 0 else gcd(b, a%b)\r\nprint(z//(m*n//gcd(m, n)))\r\n", "import math\r\n\r\nn, m, z = [int(x) for x in input().split()]\r\n\r\nprint(z // (m * n // math.gcd(n, m)))\r\n", "n,m,z=map(int,input().split())\r\nx=set();y=set();i=1\r\nwhile(z>=n*i or z>=m*i):\r\n\tx.add(n*i)\r\n\ty.add(m*i)\r\n\ti=i+1\r\nx.intersection_update(y)\r\nprint(len(x))", "from math import gcd\r\na, b, c = map(int, input().split())\r\nprint (int(c / (a * b / gcd(a, b))))", "line = input().split(sep=\" \")\r\nn= int(line[0])\r\nm= int(line[1])\r\nz= int(line[2])\r\ncount = 0\r\nfor i in range(max(n,m),z+1):\r\n if(i %n == 0 and i%m == 0):\r\n count+=1\r\nprint(count)", "n,m,z=map(int,input().split())\r\nst1=set()\r\nst2=set()\r\nx,y=n,m\r\nwhile x<=z:\r\n st1.add(x);x+=n\r\nwhile y<=z:\r\n st2.add(y);y+=m\r\n\r\nprint(len(st1&st2))", "n, m, z = map(int, input().split())\r\nt = 0\r\n\r\nfor i in range(1, z // m + 1):\r\n if (i * m) % n == 0:\r\n t += 1\r\nprint(t)", "import math\r\nn,m,z=input().split()\r\na=math.gcd(int(n),int(m))\r\nl=(int(n)*int(m))//a\r\nprint(int(z)//l)", "n, m, z = map(int, input().split());\r\nx = 0;\r\n\r\nfor i in range(1, int(z/m + 1), 1):\r\n if(((m * i) % n) == 0):\r\n x += 1;\r\nprint(x);", "import sys\r\nimport inspect\r\nimport re\r\nimport math\r\nfrom pprint import pprint as pp\r\nmod = 998244353\r\nMAX = 10**15\r\n\r\n\r\ndef deb(p):\r\n for line in inspect.getframeinfo(inspect.currentframe().f_back)[3]:\r\n m = re.search(r'\\bdeb\\s*\\(\\s*([A-Za-z_][A-Za-z0-9_]*)\\s*\\)', line)\r\n print('%s %d' % (m.group(1), p))\r\n\r\n\r\ndef main():\r\n n, m, z = map(int, input().split())\r\n a = [0] * z\r\n for i in range(n - 1, z, n):\r\n a[i] += 1\r\n for i in range(m - 1, z, m):\r\n a[i] += 1\r\n ans = 0\r\n for i in range(0, z):\r\n if a[i] == 2:\r\n ans += 1\r\n print(ans)\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "def lcm1(x,y):\r\n\r\n if x > y:\r\n greater = x\r\n else:\r\n greater = y\r\n while(True):\r\n if((greater % x == 0) and (greater % y == 0)):\r\n lcm = greater\r\n break\r\n greater += 1\r\n return lcm\r\n \r\n\r\nn,m,k=map(int,input().split())\r\n\r\ncall=lcm1(n,m)\r\nprint(k//call)\r\n\r\n", "n, m, z = map(int,input().split())\ndef gcd(a,b):\n if b == 0:\n return a\n remainder = a % b\n return gcd(b,remainder)\n\ndef lcm(a, b):\n return int( (a*b) / gcd(a,b))\nlc = lcm(n,m)\ncnt = 0\nfor i in range(1,z+1):\n if i%lc==0:\n cnt+=1\nprint((cnt))\n\t\t\t\t \t \t\t \t \t\t\t\t\t \t \t", "n,m,z=input().split()\nn,m,z=[int(n),int(m),int(z)]\ni=n\nc=0\nk=1\nwhile i<=z:\n if i%m==0:\n c+=1\n k+=1\n i=k*n\nprint(c)", "n,m,z = [int(i) for i in input().split()]\r\ncount = 0\r\nfor i in range(1,z+1):\r\n if (i%n == 0) and (i%m == 0):\r\n count+=1\r\nprint(count)\r\n", "n,m,z=map(int,input().split())\r\nimport math\r\na=math.gcd(n,m)\r\na=(n*m)//a\r\nprint(z//a)\r\n", "import math\r\na,b,c = map(int,input().split())\r\ns = math.gcd(a,b)\r\nz = a*b/s\r\nprint(int(c//z))\r\n", "from fractions import gcd\r\ndef nok(a,b):\r\n return a*b/gcd(a,b)\r\nA, B, Z = map(int,input().split())\r\nConst = nok(A,B)\r\ni = 0\r\nl = 1\r\nwhile Const*l <= Z:\r\n i += 1\r\n l += 1\r\nprint(i)", "def solve(n, m, z):\n x = set(range(n, z+1, n))\n y = set(range(m, z+1, m))\n z = list(range(1, z+1))\n c = 0\n for i in z:\n if i in x and i in y:\n c += 1\n return c\n\n\ndef main():\n n, m, z = list(map(int, input().split()))\n print(solve(n, m, z))\n\n\nmain()\n", "import math\r\n\r\nn, m, z = [int(s) for s in input().split(\" \")]\r\nlcm = (n*m)//math.gcd(n,m)\r\nprint(z//lcm)\r\n", "# =================================\r\n# (c) MidAndFeed aka ASilentVoice\r\n# =================================\r\nimport math, fractions, collections\r\n# =================================\r\nn, m, z = [int(x) for x in input().split()]\r\nprint(z//((m*n)//fractions.gcd(n,m)))\r\n", "n,m,z=map(int,input().split())\r\ni=0\r\ndict1=dict()\r\ndict2=dict()\r\na=n\r\nb=m\r\nx=z//n\r\ny=z//m\r\ni=0\r\nfor i in range(x):\r\n dict1[i]=n\r\n n=n+a\r\nfor j in range(y):\r\n dict2[j]=m\r\n m=m+b\r\n \r\nprint(len(set(dict1.values()) & set(dict2.values())))\r\n\r\n", "from math import gcd\n \na, b, c = map(int, input().split())\ng = gcd(a, b)\n\nprint(c //( a * b // g))\n\t\t \t\t \t \t \t\t \t\t \t\t \t \t\t \t", "import math\r\nn , m , z = map(int,input().strip().split())\r\nlcm = n*m/math.gcd(n,m)\r\nans = int(z//lcm)\r\nprint(ans)\r\n\r\n", "# LUOGU_RID: 113722382\nn,m,z=map(int,input().split())\r\ncnt=0\r\nfor i in range(1,z+1):\r\n cnt+=(i>=n and i%n==0 and i>=m and i%m==0)\r\nprint(cnt)", "n,m,z=map(int,input().split())\r\ndead=0\r\nfor i in range(1,z+1):\r\n if i%m==0 and i%n==0:\r\n dead+=1\r\nprint(dead)", "a , b , c = list(map(int,input().split()))\r\ncount = 0\r\nl = []\r\nk = []\r\nfor i in range(1,c+1):\r\n\tif i*a<=c:\r\n\t\tl.append(i*a)\r\n\tif i*b<=c:\t\r\n\t\tk.append(i*b)\r\nfor j in l:\r\n\tif j in k:\r\n\t\tcount += 1\r\nprint(count)\t\t\t", "n,m,z=map(int,input().split())\r\np=0\r\nv=[n*i for i in range(1,z//n+1)]\r\nq=[m*i for i in range(1,z//m+1)]\r\nfor j in v:\r\n\tfor k in q:\r\n\t\tif j==k:\r\n\t\t\tp+=1\r\nprint(p)\r\n# print(v)\r\n# print(q)", "n,m,z=map(int,input().split())\r\nc=0\r\na=n\r\nb=m\r\nfor i in range(1,z+1):\r\n if n+a==i:\r\n n=n+a \r\n if m+b==i:\r\n m=m+b\r\n if n==m and (n==i or m==i) :\r\n c+=1\r\n \r\nprint(c) ", "# Description of the problem can be found at http://codeforces.com/problemset/problem/764/A\r\n\r\nn, m, z = map(int, input().split())\r\nt = 0\r\n\r\nfor i in range(1, z // m + 1):\r\n if (i * m) % n == 0:\r\n t += 1\r\nprint(t)", "import sys\r\nfrom math import gcd\r\n\r\ndef main():\r\n n, m, z = map(int, sys.stdin.read().strip().split())\r\n return z//(n*m//gcd(n,m))\r\n \r\nprint(main())\r\n", "\ndef solve(n, m , z):\n c = 0\n for i in range(1,z+1):\n if i % n == 0 and i % m == 0:\n c += 1\n print(c)\n\nn, m, z = map(int, input().split())\nsolve(n, m, z)", "a = input().split()\r\ns = 0\r\nfor i in range(1,int(a[2]) + 1):\r\n if i % int(a[0]) == 0 and i % int(a[1]) == 0:\r\n s += 1\r\nprint(s)\r\n", "from math import gcd\na,b,c=map(int,input().split())\ngc=gcd(a,b)\nlcm=(a*b)//gc\nx=c//lcm\nprint(x)", "n,m,z = map(int,input().split())\r\ncount = 0\r\nfor i in range(1,z+1):\r\n if i % n == 0 and i % m == 0:\r\n count += 1\r\nprint(count)", "n, m, z = map(int, input().split())\r\none = [x for x in range(1,z+1) if x % n == 0]\r\nprint(sum(1 for x in one if x % m == 0))", "n = input()\r\nlst = list(map(int,n.split()))\r\nnum1 = lst[0]\r\nnum2 = lst[1]\r\nnum3 = lst[2]\r\nwhile True:\r\n if num1 > num2:\r\n if num1//num2 == num1/num2:\r\n ebob = num2\r\n break\r\n num1 = num1%num2\r\n else:\r\n if num2//num1 == num2/num1:\r\n ebob = num1\r\n break\r\n num2 = num2%num1\r\n\r\ndiv = lst[0]*lst[1]/ebob\r\nres = int(num3/div)\r\nprint(res)\r\n", "n, m, z = map(int, input().split())\r\n\r\ndef gcd(a, b):\r\n q = a % b\r\n if q:\r\n return gcd(b, q)\r\n else:\r\n return b\r\n\r\nprint(z // (n * m // gcd(n, m)))\r\n", "temp = [int(x) for x in input().split()]\r\n\r\ndef compute_lcm(x, y):\r\n if x > y:\r\n greater = x\r\n else:\r\n greater = y\r\n while(True):\r\n if((greater % x == 0) and (greater % y == 0)):\r\n lcm = greater\r\n break\r\n greater += 1\r\n return lcm\r\n\r\nn = temp[0]\r\nm = temp[1]\r\nz = temp[2]\r\nx = compute_lcm(n, m)\r\nprint(z // x)\r\n", "from sys import stdin, stdout\ndef read():\n\treturn stdin.readline().rstrip()\n\ndef read_int():\n\treturn int(read())\n \ndef read_ints():\n\treturn list(map(int, read().split()))\n \ndef gcd(x, y):\n\twhile y!=0:\n\t\tx,y=y,x%y\n\treturn x\n\ndef solve():\n\tn,m,z=read_ints()\n\tprint(z//(n*m//gcd(n,m)))\n\nsolve()\n", "from math import gcd\r\nn,m,z=list(map(int,input().split()))\r\nprint((z*gcd(n,m)//n//m))", "from math import gcd\r\nn,m,z = map(int,input().split())\r\nh = gcd(n,m)\r\nf = (n*m//h)\r\nprint(z//f)", "a,b,c=map(int,input().split())\r\nd=[]\r\ne=[]\r\ni=1\r\nwhile(i<c+1):\r\n if i%a==0:\r\n d.append(i)\r\n if i%b==0:\r\n e.append(i)\r\n i+=1\r\nprint(len(d)+len(e)-len(set(d+e)))", "n, m, z = [int(item) for item in input().split()]\r\n\r\nans = 0\r\nfor i in range(1, z + 1):\r\n if i % m == 0 and i % n == 0:ans += 1\r\nprint(ans)", "n, m, z = [int (i) for i in input().split()]\r\nans = 0\r\nfor i in range (1, z+1):\r\n if i % n == i % m == 0:\r\n ans += 1\r\nprint (ans)", "import math\r\n\r\na, b, c = map(int, input().split())\r\nk = a * b // math.gcd(a, b)\r\nt = 0\r\np = k\r\n\r\nwhile k <= c:\r\n t += 1\r\n k += p\r\n\r\nprint(t)\r\n", "from math import *\r\nn,m,z=map(int,input().split())\r\nprint(z//(n*m//gcd(n,m)))", "List = list(map(int,input().split()))\r\nn, m, z, total = List[0], List[1], List[2], 0\r\nfor i in range(1,z+1):\r\n if i%n == 0 and i%m == 0:\r\n total += 1\r\nprint(total)", "abc= input().split()\r\n\r\na= int(abc[0])\r\nb= int(abc[1])\r\nc= int(abc[2])\r\n\r\nd= c//a\r\ne=c//b\r\ntest=[]\r\ntest2=[]\r\ncount=0\r\nfor i in range(1,d+1):\r\n test.append(i*a)\r\n\r\nfor i in range(1,e+1):\r\n if i*b in test:\r\n count=count+1\r\n\r\nprint(count)", "import sys\r\nfrom math import sqrt, floor, factorial\r\nfrom collections import deque, Counter\r\ninp = sys.stdin.readline\r\nread = lambda: list(map(int, inp().strip().split()))\r\ndef gcd(a, b):\r\n\tmini = min(a,b)\r\n\tmaxi = max(a,b)\r\n\twhile maxi % mini != 0:\r\n\t\tmaxi, mini = mini, maxi%mini\r\n\treturn(mini)\r\n\r\ndef solve():\r\n\tn, m, z = read(); gcd_ = gcd(n, m)\r\n\tprint(z // ((n * m * gcd_)// gcd_**2))\r\n\r\n\r\n\r\nif __name__ == \"__main__\":\r\n\tsolve()", "n, m , z = map(int, input().split())\n\ndef is_killed(n, m, z) :\n return (z % n == 0) and (z % m == 0)\n\nprint(len([i for i in range(1, z + 1) if is_killed(n, m, i)]))\n", "from math import *\r\nimport sys, random\r\n\r\ndef nextInt():\r\n return int(input())\r\ndef nextStrs():\r\n return input().split()\r\ndef nextInts():\r\n return list(map(int,nextStrs()))\r\n\r\ndef main():\r\n a,b,z = nextInts()\r\n\r\n freq = [0]*(z+1)\r\n\r\n for i in range(a,z+1,a):\r\n freq[i]+=1\r\n\r\n res = 0\r\n for i in range(b,z+1,b):\r\n res += freq[i]\r\n\r\n print(res)\r\n \r\nif __name__ == '__main__':\r\n exit(main())\r\n\r\n", "import math\r\n\r\nn, m, z = map(int, input().split())\r\ng = math.gcd(n,m)\r\ng = n // g * m;\r\nprint(z // g)", "from math import gcd\r\nn,m,z = map(int, input().split())\r\nlcm=(n*m)//gcd(n,m)\r\nprint(z//lcm)", "import math\r\ndef LCM(n,m):\r\n return n*m//math.gcd(n,m);\r\n\r\nn,m,z=map(int,input().split(' '))\r\nprint(z//LCM(n,m))", "a,b,c = input().split()\r\na = int(a)\r\nb = int(b)\r\nc = int(c)\r\n\r\ncount = 0\r\n\r\nfor i in range(a,c+1,a):\r\n if i % b == 0:\r\n count += 1\r\n\r\nprint(count)", "n,m,z=map(int,input().split())\r\nl1,l2=[],[]\r\nfor i in range(1,z+1):\r\n if((n*i)>z):\r\n break\r\n l1.append(n * i)\r\nfor i in range(1,z+1):\r\n if((m*i)>z):\r\n break\r\n l2.append(m * i)\r\n#print(l1,l2)\r\nL=list(set(l1).intersection(l2))\r\nprint(len(L))\r\n\r\n", "def solve(n, m, z):\n c = 0\n for i in range(1, z+1):\n if i % n == 0 and i % m == 0:\n c += 1\n return c\n\n\ndef main():\n n, m, z = list(map(int, input().split()))\n print(solve(n, m, z))\n\n\nmain()\n", "def gcd(a, b):\r\n return a if b == 0 else gcd(b, a % b)\r\ndef solve(t_id):\r\n n, m, z = map(int, input().split())\r\n print(z // (n * m // gcd(n, m)))\r\nt = 1\r\n#t = int(input())\r\nfor t_id in range(1, t + 1):\r\n solve(t_id)\r\n t -= 1", "# 764A\r\n# O(log(max(n,m))) time\r\n# θ(1) space\r\n\r\n__author__ = 'artyom'\r\n\r\n\r\n# SOLUTION\r\n\r\ndef main():\r\n n, m, z = read(3)\r\n return z // (n * m // gcd(n, m))\r\n\r\n\r\n# HELPERS\r\n\r\ndef gcd(a, b):\r\n if b == 0:\r\n return a\r\n return gcd(b, a % b)\r\n\r\ndef read(mode=1, size=None):\r\n # 0: String\r\n # 1: Integer\r\n # 2: List of strings\r\n # 3: List of integers\r\n # 4: Matrix of integers\r\n if mode == 0: return input().strip()\r\n if mode == 1: return int(input().strip())\r\n if mode == 2: return input().strip().split()\r\n if mode == 3: return list(map(int, input().strip().split()))\r\n a = []\r\n for _ in range(size):\r\n a.append(read(3))\r\n return a\r\n\r\n\r\ndef write(s=\"\\n\"):\r\n if s is None: s = ''\r\n if isinstance(s, tuple) or isinstance(s, list): s = ' '.join(map(str, s))\r\n s = str(s)\r\n print(s, end=\"\\n\")\r\n\r\n\r\nwrite(main())", "import math\r\nn, m, t = map(int,input().split())\r\ncount = 0\r\nm1 = math.floor(t/m)\r\nx,y=[],[]\r\nfor i in range(1,t+1):\r\n\tn1 = n*i\r\n\tm1 = m*i\r\n\tif n1<=t:\r\n\t\tx.append(n1)\r\n\tif m1<=t:\r\n\t\ty.append(m1)\r\nprint(len(set(x)&set(y)))", "a,b,c = map(int,input().split())\r\nprint(len([0 for i in range(1,c + 1)if i % a == i % b == 0]))", "tamyr,artist,day = list(map(int,input().split()))\r\n\r\ncount = 0\r\nfor i in range(1,day+1):\r\n\tif i%tamyr == 0 and i%artist == 0:\r\n\t\tcount += 1\r\nprint(count)", "n,m,z = [int(z) for z in input().split()]\r\nc = 0\r\nfor i in range(0,z+1,m):\r\n\tif(i == 0):\r\n\t\tcontinue\r\n\tif(i%n == 0):\r\n\t\tc += 1\r\nprint(c)\r\n\r\n", "n,m,z = map(int,input().split())\r\ncount = 0\r\nfor i in range(m,z+1,m):\r\n\tif i % n == 0:\r\n\t\tcount += 1\r\nprint(count)\r\n\r\n", "import math\r\n\r\n\r\ndef gcd(a, b):\r\n if not a == 0:\r\n return gcd(b % a, a)\r\n else:\r\n return b\r\n\r\n\r\na, b, c = [int(x) for x in input().split()]\r\nlowest = gcd(a, b)\r\nkpk = int(a * b / lowest)\r\nprint(math.floor(c / kpk))", "#-------------Program--------------\r\n#----Kuzlyaev-Nikita-Codeforces----\r\n#------------notcontest------------\r\n#----------------------------------\r\n\r\nn,m,z=map(int,input().split())\r\nanswer=0\r\nfor i in range(1,z+1):\r\n if i%n==0 and i%m==0:\r\n answer+=1\r\nprint(answer)", "\r\n\r\n\r\ndef main():\r\n n,m,z=list(map(int,input().split()))\r\n set1=set([i*n for i in range(1,z//n+1)])\r\n set2=set([i*m for i in range(1,z//m+1)])\r\n\r\n print(len(set.intersection(set1,set2)))\r\n\r\n\r\n\r\nif __name__=='__main__':\r\n main()\r\n", "n, m, z = map(int, input().split())\r\n\r\nkilled_artists = 0\r\n\r\nfor minute in range(1, z+1):\r\n if minute % n == 0 and minute % m == 0:\r\n killed_artists += 1\r\n\r\nprint(killed_artists)\r\n", "n,m,z=[int(x) for x in input().split()]\r\ns1 = set(range(n,z+1,n))\r\ns2 = set(range(m,z+1,m))\r\nk = s1.intersection(s2)\r\nprint(len(k))", "def gcd(n,m):\r\n if n<m:\r\n n,m = m,n\r\n while n>0 and m>0:\r\n t = n\r\n n = m\r\n m = t%n\r\n return n\r\n\r\nn,m,z = list(map(int,input().split()))\r\nlca = n*m//gcd(n,m)\r\n\r\nprint(z//lca)\r\n", "n,m,z = map(int,input().split())\r\nll = {i*n for i in range(1,z//n+1)}\r\npp = {i*m for i in range(1,z//m+1)}\r\nk = ll - pp\r\nprint(len(ll) - len(k))\r\n", "n,m,z=map(int,input().split())\r\na=[]\r\nc=0\r\nfor i in range(n,z+1,n):\r\n a.append(i)\r\nfor i in range(m,z+1,m):\r\n if i in a:\r\n c+=1\r\nprint(c)", "def gcd(a,b):\r\n while(b):\r\n a,b=b,a%b\r\n return a\r\n\r\na,b,c=map(int,input().split())\r\nx=gcd(a,b)\r\nprint((c*x)//(a*b))", "#!/usr/bin/env python3\n\ndef solve(n, m, z):\n r = 0\n for i in range(1, z+1):\n if i%n == 0 and i%m == 0:\n r += 1\n return r\n\n\nif __name__ == '__main__':\n n, m, z = map(int, input().split())\n print(solve(n, m, z))\n", "call, performance, day = (int(x) for x in input().split())\r\ncalls_per_day = set(range(call, day + 1, call))\r\nperformances_per_day = set(range(performance, day + 1, performance))\r\nans =len(calls_per_day & performances_per_day) \r\nprint(ans) ", "def GCD(a,b):\r\n if a==0:\r\n return b\r\n else:\r\n return GCD(b%a,a)\r\ndef LCM(a,b):\r\n return (a*b)/GCD(a,b)\r\na,b,c = [int(i) for i in input().split()]\r\nprint(int(c//LCM(a,b)))", "n,m,z=map(int,input().split())\r\nif (n<1 or m<1 or z>10**4):\r\n n,m,z=map(int,input().split())\r\ni=m\r\nj=n\r\nkills=0 \r\nwhile (i<=z):\r\n while(j<=i):\r\n if(i==j):\r\n kills=kills+1\r\n j=j+n\r\n i=i+m\r\nprint(kills) \r\n", "import math\r\ndef lcm(x,y):\r\n return x*y//math.gcd(x,y)\r\nn, m, z = map(int,input().split())\r\nprint(z//lcm(n,m))", "def solve(a, b, c):\r\n\r\n count = 0\r\n for i in range(1, c + 1):\r\n if i % a == 0 and i % b == 0:\r\n count += 1\r\n\r\n return count\r\n\r\n\r\nif __name__ == \"__main__\":\r\n a, b, c = map(int, input().split())\r\n print(solve(a, b, c))\r\n", "#In the name of GOD!\nn, m, z = map(int, input().split())\nans = 0\nfor i in range(1, z + 1):\n\tif i % n == 0 and i % m == 0: ans += 1\nprint(ans)\n", "from math import gcd\r\nn,m,z=map(int,input().split())\r\ng=gcd(n,m)\r\nlcm=n*m//g\r\nprint(z//lcm)\r\n", "import math\n\nn, m, z = list(map(int, input().split()))\n\nanswer = z // (n * m // math.gcd(n, m)) \nprint(answer)", "a,b,c=map(int,input().split())\r\nd=0\r\nfor i in range (1,c+1):\r\n\tif i%a==0 and i%b==0:\r\n\t\td=d+1\r\nprint(d)", "n, m, z = map(int, input().split())\r\nt = -1\r\nfor i in range(1, n * m + 1):\r\n if i % n == 0 and i % m == 0:\r\n t = i\r\n break\r\nprint(z // t)", "m = [int(n) for n in input().split()]\r\ncount = 0\r\nfor i in range(1,m[2]+1):\r\n if i%m[0] == 0 and i%m[1] == 0:\r\n count = count + 1\r\nprint(count)", "n, m, z = map(int, input().split())\r\nL1, L2 = [], []\r\ni, j = 1, 1\r\ncn = 0\r\nwhile (n * i <=z):\r\n L1.append(n * i)\r\n i += 1\r\nwhile (m * j <= z):\r\n L2.append(m * j)\r\n j += 1\r\nfor c in L1:\r\n if c in L2:\r\n cn += 1\r\nprint(cn)\r\n", "a = list(map(int, input().split()))\r\nsum = 0\r\nif min(a) == 0:\r\n print(0)\r\n exit()\r\nfor i in range (min(a), a[2]+1):\r\n if i%a[0] == 0 and i%a[1] == 0 :\r\n sum += 1\r\nprint(sum)", "n, k, z = [int(x) for x in input().split()]\r\no = 0\r\nfor i in range(max(n,k), z+1):\r\n\tif i % n == 0 and i % k == 0:\r\n\t\to += 1\r\nprint(o)", "k = list(map(int, input().split()))\r\na = k[0]\r\nb = k[1]\r\nn = 0\r\nif a < b:\r\n a,b = b,a\r\nwhile a%b != 0:\r\n a %= b;\r\n if a < b:\r\n a,b = b,a\r\nz = k[0]*k[1]/b\r\na = k[0]\r\nb = k[1]\r\nif a < b:\r\n a,b = b,a\r\nwhile z <= k[2]:\r\n if z%a==0:\r\n n+=1\r\n z+=b\r\nprint(n)\r\n", "n , m , z = map(int , input().split())\r\n\r\ndef solve( n , m , z ) :\r\n count = 0\r\n arr1 = [0] * (z + 1)\r\n i = 1\r\n while n * i <= z :\r\n arr1[n*i] += n \r\n i+= 1\r\n i = 1\r\n while m * i <= z :\r\n arr1[m*i] += m \r\n i+= 1\r\n for i in range(len(arr1)) :\r\n if arr1[i] == n + m :\r\n count += 1\r\n\r\n return count\r\n\r\nprint(solve( n , m , z))", "theInputs = input(\"\").split(\" \")\r\ntheInputs = list(map(int, theInputs))\r\ncallsPerMin = theInputs[0]\r\nartistsPerMin = theInputs[1]\r\ndayMin = theInputs[2]\r\nif callsPerMin and artistsPerMin and dayMin >= 1 and callsPerMin and artistsPerMin and dayMin <= pow(10, 4):\r\n shouldBeKilled = 0\r\n for i in range(1, dayMin + 1):\r\n if i % callsPerMin == 0 and i % artistsPerMin == 0:\r\n shouldBeKilled += 1\r\n print(shouldBeKilled)", "n,m,z=map(int,input().split())\r\na=list(range(0,z+1,n))\r\nb=list(range(0,z+1,m))\r\nc=0\r\nfor i in range(1,len(a)):\r\n if a[i] in b:\r\n c+=1\r\nprint(c)", "import math\r\nn,m,z=list(map(int,input().split()))\r\nres=z*math.gcd(n,m)/n/m\r\nprint(int(res));", "from fractions import gcd\r\na,b,c=map(int,input().split())\r\nprint(int(c//(a*b/gcd(a,b))))\r\n", "n, m, z = list(map(int, input().split(' ')))\r\ns, t, a = [0] * (z + 1), n, 0\r\nfor i in range(m, z + 1, m):\r\n if i <= z:\r\n s[i] = 1\r\nfor i in range(n, z + 1, n):\r\n if s[i]:\r\n a += 1\r\nprint(a)", "# 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\n\r\nn, m, z = map(int, input().split())\r\nkill = 0\r\nfor i in range(1,z+1):\r\n if i%m==0 and i%n==0:\r\n kill+=1\r\nprint(kill)", "a, b, c = map(int, input().split(' '))\r\ns1 = []\r\ns2 = []\r\nfor i in range(1, c + 1):\r\n if i % a == 0:\r\n s1.append(i)\r\n if i % b == 0:\r\n s2.append(i)\r\nq = len(s2)\r\nw = len(s2)\r\nfor i in range(len(s2)):\r\n if s2[i] in s1:\r\n w -= 1\r\nprint(q - w)\r\n", "\r\nn, m, z = map(int, input().split())\r\n\r\ncount = 0\r\nfor i in range(n, z+1, n):\r\n if i % m == 0:\r\n count += 1\r\n\r\nprint(count)", "m,n,z=list(map(int,input().split()))\r\ncount=0\r\nfor i in range(m,z+1,m):\r\n for j in range(n,i+1,n):\r\n if i==j:\r\n count+=1\r\nprint(count)", "n,m,z=map(int,input().split())\r\ns=0\r\nfor i in range(1,z+1):\r\n if i%n==0 and i%m==0:\r\n s+=1\r\nprint(s)\r\n", "def gcd(a, b):\r\n while b:\r\n a, b = b, a%b\r\n return a\r\n\r\ndef lcm(a, b):\r\n return abs(a*b)/gcd(a,b)\r\n\r\nn, m, k = map(int, input().strip().split(' '))\r\nmeet = lcm(n,m)\r\nprint(int(k/meet))", "n, m, z = map(int, input().split())\n\nx = n\nexclude_count = 0\n\nwhile x <= z:\n\tif x % m == 0:\n\t\texclude_count += 1\n\tx += n\n\nprint(exclude_count)", "n,m,k=map(int,input().split())\r\nd=0\r\nf=m\r\nfor i in range(1,k+1):\r\n m*=i\r\n if m>k:\r\n break\r\n if m%n==0:\r\n d+=1\r\n \r\n m=f\r\nprint(d) ", "n, m, z = map(int, input().split())\r\na = list()\r\nb = list()\r\nc = int(0)\r\nfor i in range(z):\r\n a.append(0)\r\n b.append(0)\r\n if (i + 1) % n == 0:\r\n a[i] = 1\r\n if (i + 1) % m == 0:\r\n b[i] = 1\r\n if a[i] == b[i] == 1:\r\n c += 1\r\nprint(c)\r\n", "import fractions\r\nimport math\r\nn, m, z = map(int, input().split())\r\nx = n * m // math.gcd(n, m)\r\nprint(z // x)\r\n\r\n", "n, m ,z =map(int,(input().split()))\r\nc=0\r\nfor i in range(1,z+1):\r\n if (i%n==0 and i%m==0):\r\n c+=1\r\nprint(c)\r\n\r\n", "n, m, z = map(int, input().split(' '))\n\ndef gcd(a, b):\n if b == 0:\n return a\n return gcd(b, a%b)\n\ndef lcm(a, b):\n return (a*b)//gcd(a, b)\n\nprint(z//lcm(n, m))\n", "import math\r\nn,m,z = map(int,input().split())\r\naa = math.gcd(n,m)\r\nax = (n*m)//aa\r\nprint(z//ax)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\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,z=map(int,input().split())\r\nans=0\r\nfor i in range(1,z+1):\r\n if i%n==0 and i%m==0:\r\n ans=ans+1\r\nprint(ans)", "import math\r\nfrom fractions import Fraction as frac\r\n\r\ndef gcd(a, b):\r\n\treturn a if b == 0 else gcd(b, a % b)\r\n\t\r\ndef lcm(a, b):\r\n\treturn a * b // gcd(a, b)\r\n\r\ndef solve(case_no):\r\n\ta, b, c = map(int, input().split())\r\n\tprint(c // lcm(a, b))\r\n\t\r\nt = 1\r\n# t = int(input())\r\nfor i in range(1, t + 1):\r\n\tsolve(i)", "import math\r\na, b, c=map(int, input().split())\r\nprint(c//((a*b)//math.gcd(a, b)))", "n, m, z = [int(i) for i in input().split()]\r\nmas = [0 for i in range(z)]\r\ncoun = 0\r\nfor i in range(n-1, z, n):\r\n mas[i] += 1\r\nfor j in range(m-1, z, m):\r\n mas[j] += 1\r\nprint(mas.count(2))", "n, m, z = map(int, input().split())\r\n\r\nif n == m:\r\n print(z // n)\r\nelse:\r\n kol = 0\r\n for i in range(1, z+1):\r\n if not i % n and not i % m:\r\n kol += 1\r\n print(kol)", "#!/bin/python3\r\nnmz = list(map(int, input().split()))\r\ndef f(a, b):\r\n\tif b == 0:\r\n\t\treturn a\r\n\telse:\r\n\t\treturn f(b, a%b)\r\nu = nmz[1] * ( nmz[0] / f(nmz[1], nmz[0]) )\r\nprint(int(nmz[2]/u))", "a,b,c=map(int,input().split())\r\np=0\r\nfor i in range(1,c+1):\r\n if i%a==0 and i%b==0:\r\n p+=1\r\nprint(p)", "def taymyr(n, m, z):\r\n return int(z // lcm(n, m))\r\n\r\ndef gcd(a,b): \r\n if a == 0: \r\n return b \r\n return gcd(b % a, a) \r\n \r\n# Function to return LCM of two numbers \r\ndef lcm(a,b): \r\n return (a*b) / gcd(a,b) \r\n\r\nn, m, z = map(int, input().split())\r\nprint(taymyr(n, m, z))", "from math import gcd\r\nn, m, z = [int(x) for x in input().split()]\r\nlc = (n * m) // gcd(n, m)\r\nprint(z // lc)", "def gcd (x,y):\r\n if y==0:\r\n return x\r\n else:\r\n return gcd (y, x%y)\r\n \r\ndef lcm (x,y):\r\n return (x*y)//gcd (x,y)\r\n \r\nn,m,z = map (int, input ().split ())\r\nprint (z//(lcm (n,m)))", "import math\r\na,b,c=map(int,input().split())\r\nprint(c//(a*b//math.gcd(a,b)))", "import math\r\nimport sys\r\n\r\ninput = sys.stdin.readline\r\nn, m, z = map(int, input().split())\r\n\r\nprint(z // (n * m // math.gcd(n, m)))", "n,m,z=map(int,input().split())\r\ns=0\r\nfor i in range (1,z+1):\r\n\tif i%n==0 and i%m==0:\r\n\t\ts=s+1\r\nprint(s)\r\n\t", "import math\r\na,b,c=map(int,input().split())\r\nk=0\r\nx= (a*b)//math.gcd(a,b)\r\nprint(int(c//x))", "n,m,z = map(int, input().split())\r\n\r\ndef gcd(a,b):\r\n while b:\r\n a,b = b, a%b\r\n return a\r\n\r\nlcm = n*m//(gcd(n,m))\r\n\r\nprint(z//lcm)", "import math\r\n\r\na, b, c = map(int, input().split())\r\n\r\nlcm = (a*b)/math.gcd(a, b)\r\n\r\nans = int(c/lcm)\r\n\r\nprint(ans)", "n,m,z=map(int,input().split())\nans = 0\nfor i in range(1, z+1):\n if i % n == 0 and i % m == 0:\n ans+=1\nprint(ans)\n", "import math\r\nn, m, z = map(int, input().split())\r\nt = n * m / math.gcd(n, m)\r\nprint(int(z / t))\r\n", "import math\r\na,b,c=map(int,input().strip().split())\r\nd=a*b\r\ne=d//math.gcd(a,b)\r\nprint(c//e)", "nn=input()\r\nnn=nn.split()\r\nn=int(nn[0])\r\nm=int(nn[1])\r\nz=int(nn[2])\r\na=[]\r\nb=[]\r\nfor i in range(n,z+1,n):\r\n a.append(i)\r\nfor i in range(m,z+1,m):\r\n b.append(i)\r\naa=set(a)\r\nbb=set(b)\r\nc=aa.intersection(bb)\r\nprint(len(c))", "def gcd(a, b):\n if b == 0:\n return a\n else:\n return gcd(b, a % b)\n\n\ndef hcf(a, b):\n return a*b/gcd(a, b)\n\n\nn, m, z = map(int, input().split())\nans = int(z // hcf(n, m))\nprint(ans)", "from math import gcd\r\nn, m, z = map(int, input().split())\r\nprint(z//(n*m//gcd(n, m)))\r\n", "n, m, a = map(int, input().split())\r\nkill = 0\r\nfor i in range(1, a+1):\r\n if i % n == 0 and i % m == 0:\r\n kill += 1\r\nprint(kill)\r\n", "u,v,n =map(int,input().split())\r\nw=0\r\nfor i in range (n):\r\n if (i+1)%u==0 and (i+1)%v==0 :\r\n w+=1\r\nprint (w)", "import math\n\nN, M, Z = map(int, input().split())\nprint(Z // (N * M // math.gcd(N, M)))\n", "n,m,z=map(int,input().split())\r\nn1,m1=n,m\r\nkill=0\r\nwhile n1<=z and m1<=z:\r\n if n1==m1:\r\n n1+=n\r\n m1+=m\r\n kill+=1\r\n else:\r\n if n1<m1:\r\n n1+=n\r\n else:\r\n m1+=m\r\nprint(kill)\r\n", "x=list(map(int,input().split()))\r\nn=x[0]\r\nm=x[1]\r\nz=x[2]\r\nsum=0\r\nfor i in range(1,z+1):\r\n if i%n == 0 and i%m == 0:\r\n sum+=1\r\nprint(sum)", "n,m,z=list(map(int, input().split()))\r\nlist=[]\r\ncount=0\r\nfor i in range(1,z+1):\r\n if i%m==0 and i%n==0:\r\n count+=1\r\nprint(count)", "n,m,z = map(int,input().split())\r\nhi = max(m,n)\r\nans = 0\r\nfor x in range(hi,z+1,hi):\r\n\tif x%n + x%m == 0:ans+=1\r\nprint(ans)\r\n", "import math\r\nn, m, z = map(int, input().strip().split())\r\nGCD = math.gcd(n, m)\r\nLCM = int((n * m)/GCD)\r\nans = int(z / LCM)\r\nprint(ans)", "a,b,c=map(int,input().split())\r\nar=[]\r\ni=1;count=0\r\nwhile(i*b<=c):\r\n ar.append(i*b)\r\n i+=1\r\nj=1 \r\nwhile(j*a<=c):\r\n if a*j in ar:\r\n count+=1\r\n j+=1\r\nprint(count) \r\n ", "n, k, b = list(map(int, input().split()))\r\ns1 = []\r\nans = 0\r\nfor i in range(n, b+1, n):\r\n s1.append(i)\r\nfor i in range(k, b+1, k):\r\n if i in s1:\r\n ans += 1\r\nprint(ans)\r\n", "n,m,z=[int(i) for i in input().split()]\r\nc=0\r\nfor i in range(1,z+1):\r\n if i%m==0 and i%n==0:\r\n c=c+1\r\nprint(c)", "n,m,z = map(int, input().split())\r\ncount = 0\r\n\r\nfor i in range(1, z+1):\r\n if (i%n==0) and (i%m==0):\r\n count += 1\r\n \r\n \r\nprint(count)", "n, m, z = map(int, input().split())\r\nprint(sum(1 for i in range(1, z + 1) if i % n == 0 and i % m == 0))", "n, m, z = list(map(int, input().split()))\nk = 0\nfor i in range(1, z+1):\n if (i%n==0) and (i%m==0):\n k += 1\nprint(k)\n", "def GCD(x, y):\n\twhile x % y != 0:\n\t\tx, y = y, x % y\n\treturn y\n\ndef LCM(x, y):\n\treturn int(x * y / GCD(x, y))\n\nn, m, z = tuple([int(x) for x in input().split()])\nprint(z // LCM(n, m))\n", "from fractions import gcd\n\n# print(\"Input n, m, z\")\nn,m,z = [int(x) for x in input().split()]\nlcm = (n*m)//gcd(n,m)\nprint(z // lcm)\n", "n, m, z = [int(s) for s in input().split()]\r\n\r\ncall = [int(i) for i in range(z+1)]\r\ncall = call[::n]\r\nartist = [int(i) for i in range(z+1)]\r\nartist = artist[::m]\r\n\r\ndead = 0\r\nfor i in range(len(call)):\r\n if call[i] in artist:\r\n dead += 1\r\nprint(dead-1)\r\n", "\n# I = '1 15 163 132'\n# I = I.split() \n\ngh=input()\ngh=gh.split()\nfor i in range(len(gh)):\n gh[i]=int(gh[i])\n\n\n\n\nk=0\nn=gh[0]\nm=gh[1]\nz=gh[2]\nfor i in range(z):\n if i+1==0:\n pass\n tt=i+1\n if ((tt)//n)*n==i+1 and (tt//m)*m==i+1:\n \n k=k+1\nprint(k)", "inp = input()\r\ndata = inp.split()\r\nn = int(data[0])\r\nm = int(data[1])\r\nz = int(data[2])\r\n\r\n\r\nif n <= m:\r\n\tlower = n\r\n\tupper = m\r\nelse:\r\n\tupper = n\r\n\tlower = m\r\n\r\n\r\nkilled = 0\r\nsmallerCount = 0\r\nlargerCount = upper\r\n\r\nwhile largerCount <= z:\r\n\twhile smallerCount <= largerCount:\r\n\r\n\t\tif smallerCount == largerCount:\r\n\t\t\tkilled += 1\r\n\t\t\tbreak\r\n\r\n\t\tsmallerCount += lower\r\n\tlargerCount += upper\r\n\r\nprint(killed)", "a,b,c=map(int, input().split())\r\na1=a\r\nb1=b\r\nwhile a!=0 and b!=0:\r\n if a>b:\r\n a=a%b\r\n else:\r\n b=b%a\r\nx=a+b\r\nprint(c//((a1*b1)//x))", "n, m, z = map(int, input().split())\r\nr=0\r\nfor i in range(1, z+1):\r\n if i%n==0 and i%m==0:\r\n r+=1\r\nprint(r)", "n,m,z=map(int,input().split())\r\nv=n\r\ncount=0\r\nwhile(n<=z):\r\n if(n%m==0):\r\n count+=1\r\n n+=v\r\nprint(count)\r\n\r\n\r\n", "import math\r\ndef lcm(a,b):\r\n return abs(a*b)//math.gcd(a,b)\r\nn,m,z=(map(int,input().split()))\r\nb=lcm(n,m)\r\nt=z//b\r\nprint(t)\r\n", "I = input().split(\" \")\r\nn = int(I[0])\r\nm = int(I[1])\r\nz = int(I[2])\r\n\r\ncnter = 0\r\n\r\nfor i in range (1, z+1):\r\n if i % n == 0 and i % m == 0:\r\n cnter += 1\r\n\r\nprint(cnter)\r\n", "n, m, z = map(int, input().split())\r\ncounter = 0\r\nj = 2\r\nq = m\r\n\r\nwhile m<=z:\r\n \r\n if m%n==0 and m <= z:\r\n counter += 1\r\n m = q*j\r\n j += 1\r\n\r\nprint(counter)", "n, m, z = map(int, input() .split())\r\nx = set()\r\nt = set()\r\ny = 0\r\nc = 0 \r\nfor i in range (z):\r\n y = y + n\r\n if y <= z:\r\n x = x | {y}\r\nfor j in range (z):\r\n c = c + m\r\n if c <= z :\r\n t = t | {c}\r\nr = x & t\r\nprint (len(r))", "import math\r\nimport sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\ndef lcm(a, b):\r\n return a * b // math.gcd(a, b)\r\n\r\nn, m, z = map(int, input().split())\r\nans = z // lcm(n, m)\r\nprint(ans)", "import math\r\nn,m,z=map(int,input().split())\r\nprint(z//((m*n)//math.gcd(m,n)))", "import fractions\nn, m, z = list(map(int, input().split()))\nprint(int(z * fractions.gcd(n, m) / (n * m) ))\n", "n,m,z=input().split()\r\nn=int(n)\r\nm=int(m)\r\nz=int(z)\r\ncnt=0\r\ni=n\r\nwhile(i<=z):\r\n if(i%m==0):\r\n cnt=cnt+1\r\n i=i+n\r\n \r\nprint (cnt)", "n,m,z = list(map(int, input().split()))\r\nt = []\r\ns = 0\r\nfor i in range(1, z+1):\r\n if i % n == 0:\r\n t.append(1)\r\n else:\r\n t.append(0)\r\nfor i in range(1, z+1):\r\n if i % m == 0 and t[i-1] == 1:\r\n s = s + 1\r\nprint (s)\r\n", "n, m, z = list(map(int, input().split(\" \")))\r\n\r\nbig = 0\r\nif n > m:\r\n big = n\r\nelif m > n:\r\n big = m\r\nelif m == n:\r\n big = n\r\n\r\nkpk = 1\r\n\r\nx = 0\r\nwhile x == 0:\r\n if big % n == 0 and big % m == 0:\r\n kpk = big\r\n x = 1\r\n big += 1\r\n\r\nans = z//kpk\r\nprint(ans)\r\n", "n,m,z = map(int, input().split())\r\nt = 0\r\nfor i in range(1,(z)//n + 1):\r\n for j in range(1,(z)//m + 1):\r\n if n*i == m*j:\r\n t += 1\r\n \r\n\r\nprint(t)", "from math import gcd\n\nn, m, z = (int(i) for i in input().split())\nlcm = n*m//gcd(n, m)\nres = z // lcm\nprint(res)\n", "import math\r\nk,n,w = map(int,input().split())\r\nx = k*n//math.gcd(k,n)\r\nprint(w//x)", "n, m ,z = map(int, input().split())\r\n\r\ncalls = [i*n for i in range(1, (z//n)+1)]\r\nartists = [j*m for j in range(1, (z//m)+1)]\r\ncalls, artists = set(calls), set(artists)\r\nprint(len(calls.intersection(artists)))", "#n = int(input()) \nn, m, k = map(int, input().split())\n#s = input()\n#c = list(map(int, input().split()))\nl = 0\nfor i in range(1, k + 1):\n if i % m == 0 and i % n == 0:\n l += 1\nprint(l)", "import math\ndef solve(n,m,z):\n count = 0\n for i in range(1,z+1):\n if i % m == 0 and i % n == 0:\n count += 1\n return count\ndef main():\n n,m,z = list(map(int,input().split(' ')))\n print(solve(n,m,z))\n\nmain()", "from math import gcd\r\n\r\nn, m, z = list(map(int, input().split()))\r\n\r\na = (n*m)//gcd(n, m)\r\nprint(z//a)", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Tue Jul 21 09:20:54 2020\r\n\r\n@author: Harshal\r\n\"\"\"\r\n\r\n\r\nn,m,z=map(int,input().split())\r\n\r\nseen=set()\r\nfor i in range(1,z//n +1):\r\n seen.add(i*n)\r\n \r\nans=0\r\n\r\nfor i in range(1,z+1):\r\n if m*i in seen:\r\n ans+=1\r\nprint(ans)", "n, m, z = list(map(int, input().split()))\r\nanswer = 0 \r\nfor i in range (1, z + 1):\r\n if i%n == 0 and i % m == 0:\r\n answer+=1\r\nprint(answer)", "n,m,z=map(int, input().split())\r\na=set(range(n,z+1,n))\r\nb=set(range(m,z+1,m))\r\nprint(len(a&b))\r\n\r\n", "\r\n\r\n\r\nn,m,z = map(int,input().split())\r\n\r\n\r\n\r\n\r\n\r\nimport math\r\n\r\na= math.gcd(n,m)\r\nlcm = n*m//a\r\n\r\n\r\nprint(z//lcm)\r\n", "x,y,z=map(int,input().split())\r\nimport math\r\nprint(int((z*math.gcd(x,y))/(x*y)))", "a, b, c=map(int, input().split())\r\nm=[x for x in range(b,c+1,b)]\r\ni=0\r\nfor x in m:\r\n if x%a==0:\r\n i+=1\r\nprint(i)\r\n", "n, m, z = map(int, input().split())\r\ncount = 0\r\nminutes = []\r\nartist = []\r\ni = 1\r\nwhile True :\r\n x = n * i\r\n if x <= z:\r\n minutes.append(x)\r\n elif x > z:\r\n break\r\n i += 1\r\nt = 1\r\nwhile True:\r\n y = m * t\r\n if y <= z:\r\n artist.append(y)\r\n elif y > z:\r\n break\r\n t += 1\r\nfor i in range(len(minutes)):\r\n if minutes[i] in artist:\r\n count += 1\r\nprint(count)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "import math\r\na,b,c=map(int,input().split())\r\nz=(a*b)//math.gcd(a,b)\r\ni=1\r\nwhile z*i<=c:\r\n\ti+=1\r\nprint(i-1)", "def gcd(a, b):\r\n if a == 0:\r\n return b\r\n return gcd(b % a, a)\r\ndef lcm(a, b):\r\n return (a * b) / gcd(a, b)\r\nn,m,z=map(int,input().split())\r\nele=lcm(n,m)\r\nprint(int(z/ele))", "from math import lcm\r\n\r\na, b, c = [int(x)for x in input().split()]\r\n\r\nprint(c//lcm(a,b))", "def main():\r\n m,n,z = [int(v) for v in input().split()]\r\n c = 0\r\n for i in range(1,z+1):\r\n if i%m==0 and i%n==0:\r\n c+=1\r\n print(c)\r\n\r\n\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "t = input()\r\n\r\nn,m,z = t.split()\r\n\r\nif int(n) == 1 :\r\n ar = int(z)//int(m)\r\n print (ar)\r\nelse:\r\n if int(n) == int(m):\r\n print (int(z)//int(n))\r\n else:\r\n artist = [x for x in range(1,int(z)+1) if x%int(n)==0]\r\n k = 0\r\n for x in artist :\r\n if x%int(m) == 0:\r\n k += 1\r\n\r\n print (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 \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n\r\n\r\n\r\n\r\n \r\n \r\n \r\n\r\n\r\n\r\n\r\n\r\n \r\n \r\n \r\n\r\n \r\n \r\n\r\n\r\n\r\n \r\n \r\n \r\n \r\n\r\n\r\n\r\n \r\n\r\n\r\n \r\n \r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n \r\n\r\n\r\n\r\n \r\n \r\n \r\n \r\n\r\n\r\n \r\n\r\n\r\n\r\n \r\n \r\n\r\n \r\n\r\n\r\n \r\n\r\n \r\n\r\n\r\n\r\n \r\n\r\n\r\n \r\n\r\n\r\n\r\n \r\n \r\n \r\n\r\n \r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n \r\n \r\n \r\n\r\n \r\n\r\n \r\n \r\n \r\n \r\n\r\n\r\n\r\n\r\n \r\n\r\n\r\n \r\n\r\n\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, z = map(int, input().split())\nans = 0\nfor i in range(n, z+1, n):\n ans += i % m == 0\nprint(ans)", "n,m,z=[int(x) for x in input().split()]\r\nl1=[]\r\nl2=[]\r\nk=0\r\nfor i in range(1,z+1):\r\n\tn=i*n\r\n\tm=m*i\r\n\tif n<=z :\r\n\t\tl1.append(n)\r\n\tif m<=z:\r\n\t\tl2.append(m)\r\n\tn=n//i\r\n\tm=m//i\r\nfor i in l1:\r\n\tif i in l2:\r\n\t\tk+=1\r\nprint(k)", "def gcd(a,b):\r\n if(b==0):\r\n return a\r\n return gcd(b,a%b)\r\nn,m,z=map(int,input().split())\r\nl=(n*m)//gcd(n,m)\r\nprint(z//l)\r\n", "n, m, z = map(int, input().split())\r\n\r\nres = 0\r\ncurr = m\r\nfor i in range(m, z+1, m):\r\n if curr % n == 0:\r\n res += 1\r\n curr += m\r\nprint(res)", "'''\nNNNNNNNN NNNNNNNNTTTTTTTTTTTTTTTTTTTTTTT PPPPPPPPPPPPPPPPP RRRRRRRRRRRRRRRRR OOOOOOOOO DDDDDDDDDDDDD UUUUUUUU UUUUUUUU CCCCCCCCCCCCCTTTTTTTTTTTTTTTTTTTTTTTIIIIIIIIII OOOOOOOOO NNNNNNNN NNNNNNNN\nN:::::::N N::::::NT:::::::::::::::::::::T P::::::::::::::::P R::::::::::::::::R OO:::::::::OO D::::::::::::DDD U::::::U U::::::U CCC::::::::::::CT:::::::::::::::::::::TI::::::::I OO:::::::::OO N:::::::N N::::::N\nN::::::::N N::::::NT:::::::::::::::::::::T P::::::PPPPPP:::::P R::::::RRRRRR:::::R OO:::::::::::::OO D:::::::::::::::DD U::::::U U::::::U CC:::::::::::::::CT:::::::::::::::::::::TI::::::::I OO:::::::::::::OO N::::::::N N::::::N\nN:::::::::N N::::::NT:::::TT:::::::TT:::::T PP:::::P P:::::PRR:::::R R:::::RO:::::::OOO:::::::ODDD:::::DDDDD:::::D UU:::::U U:::::UU C:::::CCCCCCCC::::CT:::::TT:::::::TT:::::TII::::::IIO:::::::OOO:::::::ON:::::::::N N::::::N\nN::::::::::N N::::::NTTTTTT T:::::T TTTTTT P::::P P:::::P R::::R R:::::RO::::::O O::::::O D:::::D D:::::D U:::::U U:::::U C:::::C CCCCCCTTTTTT T:::::T TTTTTT I::::I O::::::O O::::::ON::::::::::N N::::::N\nN:::::::::::N N::::::N T:::::T P::::P P:::::P R::::R R:::::RO:::::O O:::::O D:::::D D:::::DU:::::D D:::::UC:::::C T:::::T I::::I O:::::O O:::::ON:::::::::::N N::::::N\nN:::::::N::::N N::::::N T:::::T P::::PPPPPP:::::P R::::RRRRRR:::::R O:::::O O:::::O D:::::D D:::::DU:::::D D:::::UC:::::C T:::::T I::::I O:::::O O:::::ON:::::::N::::N N::::::N\nN::::::N N::::N N::::::N T:::::T P:::::::::::::PP R:::::::::::::RR O:::::O O:::::O D:::::D D:::::DU:::::D D:::::UC:::::C T:::::T I::::I O:::::O O:::::ON::::::N N::::N N::::::N\nN::::::N N::::N:::::::N T:::::T P::::PPPPPPPPP R::::RRRRRR:::::R O:::::O O:::::O D:::::D D:::::DU:::::D D:::::UC:::::C T:::::T I::::I O:::::O O:::::ON::::::N N::::N:::::::N\nN::::::N N:::::::::::N T:::::T P::::P R::::R R:::::RO:::::O O:::::O D:::::D D:::::DU:::::D D:::::UC:::::C T:::::T I::::I O:::::O O:::::ON::::::N N:::::::::::N\nN::::::N N::::::::::N T:::::T P::::P R::::R R:::::RO:::::O O:::::O D:::::D D:::::DU:::::D D:::::UC:::::C T:::::T I::::I O:::::O O:::::ON::::::N N::::::::::N\nN::::::N N:::::::::N T:::::T P::::P R::::R R:::::RO::::::O O::::::O D:::::D D:::::D U::::::U U::::::U C:::::C CCCCCC T:::::T I::::I O::::::O O::::::ON::::::N N:::::::::N\nN::::::N N::::::::N TT:::::::TT PP::::::PP RR:::::R R:::::RO:::::::OOO:::::::ODDD:::::DDDDD:::::D U:::::::UUU:::::::U C:::::CCCCCCCC::::C TT:::::::TT II::::::IIO:::::::OOO:::::::ON::::::N N::::::::N\nN::::::N N:::::::N T:::::::::T P::::::::P R::::::R R:::::R OO:::::::::::::OO D:::::::::::::::DD UU:::::::::::::UU CC:::::::::::::::C T:::::::::T I::::::::I OO:::::::::::::OO N::::::N N:::::::N\nN::::::N N::::::N T:::::::::T P::::::::P R::::::R R:::::R OO:::::::::OO D::::::::::::DDD UU:::::::::UU CCC::::::::::::C T:::::::::T I::::::::I OO:::::::::OO N::::::N N::::::N\nNNNNNNNN NNNNNNN TTTTTTTTTTT PPPPPPPPPP RRRRRRRR RRRRRRR OOOOOOOOO DDDDDDDDDDDDD UUUUUUUUU CCCCCCCCCCCCC TTTTTTTTTTT IIIIIIIIII OOOOOOOOO NNNNNNNN NNNNNNN\n'''\n# !&&$YOU$ $WILL$ $NEVER$ $WALK$ $ALONE$&&!\nn, m, z = map(int, input().split())\ni = n ; c = 0 ; k = 1\nwhile i <= z:\n if i % m == 0:\n c += 1\n k += 1\n i = k * n\nprint(c)\n", "def my_gcd(a,b):\r\n #print(a,b)\r\n if b==0:\r\n return a\r\n else:\r\n return my_gcd(b,a%b)\r\n\r\ndef main():\r\n mode=\"filee\"\r\n if mode==\"file\":f=open(\"test.txt\",\"r\")\r\n get = lambda :[int(x) for x in (f.readline() if mode==\"file\" else input()).split()]\r\n [n,m,z] = get()\r\n lcm = (n*m) // my_gcd(n,m)\r\n print(z//lcm)\r\n \r\n \r\n if mode==\"file\":f.close()\r\n\r\n\r\nif __name__==\"__main__\":\r\n main()\r\n\r\n", "import sys\r\nimport math\r\nimport bisect\r\n\r\ndef main():\r\n a, b, n = map(int, input().split())\r\n ans = n // (a * b // math.gcd(a, b))\r\n print(ans)\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "def gcd(x, y):\r\n while(y): x, y = y, x % y\r\n return x\r\n\r\ndef lcm(x, y):\r\n return (x*y)//gcd(x,y)\r\n\r\narr = [int(x)for x in input().split()]\r\nk = lcm(arr[0], arr[1])\r\nprint(arr[2]//k)", "n, m, z =[int(i) for i in input().split()]\r\na, b = n, m\r\nwhile n!=0 and m!=0:\r\n if n>m:\r\n n%=m\r\n else:\r\n m%=n\r\nif n==0:\r\n d=m\r\nelse:\r\n d=n\r\nprint(z//((a*b)//d))", "n, m, z = [int(i) for i in input().split()]\r\nans, i = 0, m\r\nwhile m <= z:\r\n if m % n == 0:\r\n ans += 1\r\n m += i\r\nprint(ans)\r\n", "import sys\r\n\r\nn, m, z = map(int, sys.stdin.readline().split())\r\n\r\nc = 0\r\nfor i in range(1, z + 1):\r\n\tif i % n == i % m == 0:\r\n\t\tc += 1\r\n\r\nprint(c)", "\r\nn, m, z = map(int, input().split())\r\ni = 1\r\nn_list = []\r\nwhile i * n <= z:\r\n\tsu = i * n\r\n\tn_list.append(su)\r\n\ti += 1\r\n\r\n\r\ni = 1\r\nm_list = []\r\nwhile i * m <= z:\r\n\tsu = i * m\r\n\tm_list.append(su)\r\n\ti += 1\r\n\r\nco = 0\r\nfor i in n_list:\r\n\tif i in m_list:\r\n\t\tco += 1\r\n\r\nprint(co)\r\n\r\n", "n, m, z = map(int, input().split())\r\nc=0\r\nm2=m\r\nwhile(m2<=z):\r\n if(m2%n==0):\r\n c+=1\r\n m2+=m\r\nprint(c) ", "a,b,n = map(int,input().split())\r\nc = 0\r\nfor i in range(1,n+1):\r\n if i%a==0 and i%b==0:\r\n c+=1\r\nprint(c)\r\n ", "n,m,z=map(int,input().split(\" \"))\r\nl=[i for i in range(1,z+1) if (i%n)==0 and (i%m)==0]\r\nprint(len(l))", "def MCM(a,b):\r\n if b > a:\r\n aux = b\r\n b = a\r\n a = aux\r\n x = a\r\n y = b\r\n while(b > 0):\r\n r = a % b\r\n a = b\r\n b = r\r\n mcm = (x//a)*y\r\n return mcm\r\nA,B,C = [int(x) for x in input().split()]\r\nMCM = MCM(A,B)\r\nprint(C//MCM)\r\n", "from math import gcd\r\nn, m, z = map(int, input().split())\r\ng = gcd(n, m)\r\nlcm = n*m//g\r\nprint(z // lcm)", "n,m,z = map(int,input().split())\r\nb = []\r\nk = n\r\nco = 0\r\nwhile k <= z:\r\n b.append(k)\r\n k = k+n\r\nk = m\r\nwhile k <=z:\r\n if k in b:\r\n co=co+1\r\n k=k+m\r\nprint(co)", "n = [int(x) for x in input().split()]\nx = n[0]\ny = n[1]\ns = n[2]\ncount = []\nfor i in range(1, s + 1):\n if i % x == 0 and i % y == 0:\n count.append(i)\nprint(len(count))", "s=input()\r\nnums=s.split(\" \")\r\nt=int(nums[0])\r\na=int(nums[1])\r\nmday=int(nums[2])\r\n\r\n\r\nnextlink=t\r\nskip=0\r\nwhile nextlink<=mday:\r\n if (nextlink%a)==0:\r\n skip+=1\r\n nextlink+=t\r\n\r\nprint(skip)\r\n", "import math\r\nn,m,z = list(map(int,input().split()))\r\na = (n*m) // math.gcd(n,m)\r\nprint(math.floor(z/a))", "import math\ndef lcm(a, b):\n return a*b // math.gcd(a, b)\n\nn, m, z = map(int, input().split())\nprint(z // lcm(n, m))", "#%% 764a Taymyr is calling you \r\n\r\nn,m,z = map(int,input().split())\r\nfrom math import gcd \r\ng = m*n//gcd(m,n)\r\nprint(z//g)\r\n\r\n", "ip = input().split(' ')\nip = list(map(int, ip))\nphone = 0\nvisit = 0\ncount = 0\nwhile phone < ip[2] and visit < ip[2]:\n phone += 1\n visit += 1\n if phone%ip[0] == 0 and visit%ip[1] == 0:\n count = count + 1\nprint(count)\n \t \t \t\t \t\t\t \t \t \t\t\t \t\t", "a,b,c = list(map(int,input().split()))\r\ncount = 0\r\nfor i in range(1,c+1):\r\n if i % a == 0 and i % b == 0:\r\n count += 1\r\nprint(count)", "from math import gcd\r\nn, m, z = map(int, input().split())\r\nprint(int(z // (n * m / gcd(n, m))))", "import math\r\ndef lcm(a,b):\r\n return a*b//math.gcd(a,b)\r\n\r\n\r\nm,n,z = map(int, input().split())\r\nans=z/lcm(m,n)\r\nprint(int(ans))\r\n", "n,m,z=map(int,input().split())\r\ntemp=n\r\na1=set()\r\nwhile temp<=z:\r\n a1.add(temp)\r\n temp+=n\r\na2=set()\r\ntemp=m\r\nwhile temp<=z:\r\n a2.add(temp)\r\n temp+=m\r\nprint(len(a1.intersection(a2)))", "import bisect\r\nfrom collections import defaultdict\r\nfrom collections import deque\r\nimport math\r\nimport re\r\n\r\ndef raw_input():\r\n return input()\r\n\r\ndef ni():\r\n return int(raw_input())\r\n\r\ndef nis():\r\n return map(int, raw_input().split())\r\n\r\ndef si():\r\n return raw_input()\r\n\r\ndef sis():\r\n return raw_input().split()\r\n\r\ndef spaced(a):\r\n return ' '.join(map(str, a))\r\n\r\ndef lcm(a, b):\r\n c = int(math.gcd(a, b))\r\n x = a // c\r\n y = b // c\r\n\r\n return c * x * y\r\n\r\nn, m, z = nis()\r\n\r\nprint(z // lcm(n, m))", "x,y,z=map(int,input().split())\r\nl=[]\r\nfor i in range(1,z+1):\r\n if i%y==0:\r\n l.append(i)\r\ncnt=0\r\nfor i in l:\r\n if i%x==0:\r\n cnt+=1\r\nprint(cnt)", "n, m, z = (int(i) for i in input().split())\nres = sum(1 for i in range(n, z + 1, n) if i % m == 0)\nprint(res)\n", "def DeAtH___(n,m,z):\r\n k=0\r\n for i in range(1,z+1):\r\n if i%n==i%m==0:\r\n k+=1\r\n return k\r\nn,m,z=map(int,input().split())\r\nprint(DeAtH___(n,m,z))", "n, m, z = [int(i) for i in input().split()]\nanswer = 0\n\nfor i in range(1, z+1):\n if i % n == 0 and i % m == 0: answer += 1\n\nprint(answer)\n", "n,m,z=map(int,input().split())\r\nc=min(n,m)\r\nm=max(n,m)\r\nn=c\r\nans=0\r\nfor i in range(n,z+1,n):\r\n if i%m==0: \r\n ans+=1\r\nprint(ans)", "N, M, Z = map(int, input().split())\nans = 0\nfor i in range(1, Z+1):\n\tif i % N == 0 and i % M == 0:\n\t\tans += 1\nprint(ans)\n", "nums=list(map(int,input().split()))\r\na=nums[0]\r\nb=nums[1]\r\nc=nums[2]\r\ncnt=0\r\nlis1=[e for e in range(a,c+1,a)]\r\nlis2=[b for b in range(b,c+1,b)]\r\nfor n in lis1 :\r\n if n in lis2:\r\n cnt+=1 \r\nprint(cnt)\r\n ", "def ii(): return int(input())\r\ndef fi(): return float(input())\r\ndef si(): return input()\r\ndef mi(): return map(int,input().split())\r\ndef li(): return list(mi())\r\n\r\nimport math\r\n\r\nn,m,z=mi()\r\nc=0\r\nfor i in range(n,z+1,n):\r\n if i%m==0:\r\n c+=1 \r\nprint(c)", "a,b,c=map(int,input().split())\r\np=a*b\r\nwhile(a!=0 and b!=0):\r\n\ta,b=b,a%b\r\nk=p//a\r\nprint(c//k)", "n,m,z=map(int,input().split())\r\n\r\nkilled=0\r\n\r\nfor i in range (1,z+1):\r\n if i%n==0 and i%m==0:\r\n killed+=1\r\n else:\r\n continue\r\nprint(killed)", "n,m,z=map(int,input().split())\r\ni,cnt=max(n,m),0\r\nwhile(i>=1):\r\n if(n%i==0 and m%i==0):\r\n break\r\n i-=1\r\nlcm=int(n*m/i)\r\ni=1\r\nwhile(True):\r\n if(lcm*i<=z):\r\n cnt+=1\r\n else:\r\n break\r\n i+=1\r\nprint(cnt)", "n, m, z = map(int, input().split())\r\nn = set(range(n, z+1, n))\r\nm = set(range(m, z+1, m))\r\nprint(len(n.intersection(m)))", "n,m,z=list(map(int,input().split()))\r\nn1=[]\r\nm1=[]\r\ntemp=n\r\nwhile n<=z:\r\n n1.append(n)\r\n n=n+temp\r\ntemp=m\r\nwhile m<=z:\r\n m1.append(m)\r\n m+=temp\r\nfinal=list(set(n1) & set(m1))\r\nprint(len(final))", "#n=int(input())\r\nfrom math import gcd\r\nn,m,z=(map(int,input().split()))\r\nl=(m*n)//gcd(m,n)\r\nprint(z//l)\r\n", "def gcd(a,b):\r\n\tif(b>a):\r\n\t\treturn gcd(b,a)\r\n\tif(a%b==0):\r\n\t\treturn b\r\n\telse:\r\n\t\treturn gcd(b,a%b)\r\ndef lcm(a,b):\r\n\treturn (a*b)//gcd(a,b)\r\nn,m,z=list(map(int,input().split(' ')))\r\n#print(gcd(n,m))\r\nlcm_m_n=lcm(n,m)\r\nno_of_artists_killed=z//lcm_m_n\r\nprint(no_of_artists_killed)\r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Wed Dec 13 19:41:43 2017\r\n\r\n@author: ashking13th\r\n\"\"\"\r\n\r\ndef amrendra():\r\n c = 0\r\n n,m,z = map(int , input().split())\r\n for i in range(n , z+1 , n):\r\n if i%m == 0:\r\n c+=1\r\n print(c)\r\namrendra()", "def gcd(x, y):\r\n\twhile y != 0:\r\n\t\tx, y = y, x % y\r\n\treturn x\r\n\r\n\r\ndef lcm(x, y):\r\n\treturn (x * y) // gcd(x, y)\r\n\r\n \r\nn, m, z = map(int, input().split())\r\n\r\nprint(z // lcm(n, m))\r\n", "import math\r\n\r\nn, m, z = [int(s) for s in input().split(' ')]\r\nlcm = n * m / (math.gcd(n, m))\r\nprint(round(z // lcm))", "n,m,z=map(int,input().split())\r\nout=0\r\nfor i in range(n,z+1,n):\r\n if(i%m==0):\r\n out+=1\r\nprint(out)", "\r\nfrom math import gcd\r\nn, m, z = map(int, input().split())\r\nlcm = (n * m) // gcd (n, m)\r\n\r\nprint(z // lcm)", "import math\r\nN, M, Z = map(int,input().split())\r\nLCM = (N * M) // math.gcd(N,M)\r\nprint(Z // LCM)", "n,m,z=map(int,input().split())\r\ncnt=0\r\nfor i in range(1,z+1):\r\n if(i%n==0 and i%m==0):\r\n cnt+=1\r\nprint(cnt)", "# -*- coding: utf-8 -*-\r\n\r\nimport math\r\nimport collections\r\nimport bisect\r\nimport heapq\r\nimport time\r\nimport random\r\nimport itertools\r\nimport sys\r\n\r\n\"\"\"\r\ncreated by shhuan at 2017/11/24 19:56\r\n\r\n\"\"\"\r\n\r\nn, m, z = map(int, input().split())\r\n\r\na = [0] * (z+1)\r\n\r\nx = n\r\nwhile x <= z:\r\n a[x] = 1\r\n x += n\r\n\r\ny = m\r\nwhile y <= z:\r\n a[y] += 1\r\n y += m\r\n\r\nprint(len([x for x in a if x == 2]))", "n,m,z=map(int,input().split())\r\nres=0\r\nfor i in range(1,z+1):\r\n res+=1 if i%m+i%n==0 else 0\r\nprint(res)", "(n,m,z)=map(int,input().split())\r\nl1=[]\r\nl2=[]\r\nl3=[]\r\ni=1\r\nwhile(z>=n*i):\r\n l2.append(n*i)\r\n i=i+1\r\ni=1\r\nwhile(z>=m*i):\r\n l2.append(m*i)\r\n i=i+1\r\ns=set(l2)\r\nprint(len(l2)-len(s))\r\n", "a, b, z = map(int, input().split())\r\nx=a\r\ny=b\r\nanswer=0\r\nwhile min(x,y)<=z:\r\n if x==y:\r\n answer+=1\r\n if x<y:\r\n x+=a\r\n else:\r\n y+=b\r\nprint(answer)", "n,m,t = map(int,input().split())\r\nc=0\r\nfor i in range(m,t+1,m):\r\n if(i%n==0):\r\n c+=1\r\nprint(c)", "a,b,n=map(int,input().split());s=0\r\nfor i in range(1,n+1):\r\n if (i % b==0) and (i % a==0):s+=1\r\nprint(s)", "n,m,z=input().split()\nn,m,z=int(n),int(m),int(z)\ncnt=0\nfor i in range(1,z+1):\n if i%m==0 and i%n==0:\n cnt=cnt+1\nprint(cnt)\n \t \t\t\t\t \t\t\t\t \t \t\t \t \t", "import sys\r\n\r\narr = list(map(int,input().split()))\r\nn = arr[0]\r\nm = arr[1]\r\nz = arr[2]\r\ncnt = 0\r\nstore = [0]*(z+1)\r\nfor i in range(1,z+1):\r\n if n*i <= z :\r\n store[n * i] += 1\r\n if m*i <= z:\r\n store[m * i] += 1\r\nprint(store.count(2))\r\n", "from math import gcd\r\nn,m,z=map(int,input().split())\r\nprint(z*(gcd(n,m))//(n*m))", "def gcd(a,b):\r\n\tif a==0:\r\n\t\treturn b\r\n\telif a>b:\r\n\t\ttmp = a\r\n\t\ta = b\r\n\t\tb = tmp\r\n\treturn gcd(min(a,b%a),max(a,b%a))\r\n\r\na , b, c = map(int,input().split())\r\nk = (a*b)//gcd(a,b)\r\nprint(c//k)", "n, m, z = map(int, input().split())\r\nans = 0\r\nfor x in range(1, z+1):\r\n if x % m == 0and x % n == 0:\r\n ans += 1\r\nprint(ans)", "n, m, z = [int(i) for i in input().split()]\r\n\r\nres = 0\r\n\r\nfor i in range(1, z+1):\r\n if i % n == 0:\r\n if i % m == 0:\r\n res += 1\r\n\r\nprint(res)\r\n\r\n\r\n", "string = input().split(' ')\r\n\r\nn = int(string[0])\r\nm = int(string[1])\r\nz = int(string[2])\r\n\r\ncount = 0\r\n\r\nfor i in range(1,z+1):\r\n if i % n == 0 and i % m == 0:\r\n count += 1\r\n\r\nprint(count)\r\n\r\n\r\n\r\n", "n,m,z = map(int, input().split())\r\ncounter = 0\r\nfor i in range(1,z+1):\r\n if i%n==i%m==0:\r\n counter+=1\r\nprint(counter)\r\n", "import math\r\nn,m,z=map(int,input().split())\r\nprint(z//((n*m)//math.gcd(n,m)))", "from fractions import gcd\r\nn,m,z = map(int,input().split())\r\nnok = n*m//gcd(n,m)\r\nprint(z//nok)", "n ,m, z = map(int,input().split())\n\nans = [i*n for i in range(1,z//n + 1) if (i*n)%m==0]\n\nprint(len(ans))", "n,m,z=map(int,input().split())\r\nk=n*m\r\nwhile(m):\r\n n,m=m,n%m\r\nprint(z*n//k)", "def lcm(x, y):\r\n if x > y:\r\n z = x\r\n else:\r\n z = y\r\n while(True):\r\n if((z % x == 0) and (z % y == 0)):\r\n lcm = z\r\n break\r\n z += 1\r\n return lcm\r\n\r\na,b,c=map(int,input().split())\r\nprint(c//lcm(a,b))\r\n", "from fractions import gcd\r\n\r\nn,m,z=map(int,input().split())\r\n\r\nresult = int(z//(n*m/gcd(n,m)))\r\n\r\nprint(result)", "n,m,z=map(int,input().split())\r\na=n;b=m\r\nwhile(True):\r\n rem=n%m\r\n if(rem==0):\r\n break\r\n else:\r\n n=m\r\n m=rem\r\nhcf=m\r\nlcm=(a*b)/hcf\r\n\r\nprint(int(z//lcm))", "from math import gcd\r\n\r\n\r\ndef array(arr, struc):\r\n return (list(map(struc, arr.split())))\r\n\r\n\r\ndef getLCM(a, b):\r\n return a * b // gcd(a, b)\r\n\r\n\r\narr = array(input(), int)\r\n\r\nprint(arr[2]//getLCM(arr[0], arr[1]))\r\n", "import math\r\nX,Y,Z = map(int, input().split())\r\nW = Y*X//math.gcd(Y,X)\r\nprint(Z//W)", "n,m,z=map(int,input().split())\r\ncnt=0\r\nfor i in range(1,z+1):\r\n b=n*i\r\n if b<=z:\r\n if b%m==0:\r\n cnt+=1\r\n else:\r\n break\r\nprint(cnt)", "def solve(n, m, z):\r\n \tc = 0\r\n \tfor i in range(1, z + 1):\r\n \t\tif i % n == 0 and i % m == 0:\r\n \t\t\tc += 1\r\n \treturn c\r\n\r\nn, m, z = map(int, input().split())\r\nprint(solve(n, m, z))", "n,m,z = map(int, input().split())\r\nl = [n*(i+1) for i in range(z//n)]\r\nl2 = [m*(i+1) for i in range(z//m)]\r\nl += l2\r\nprint(len(l) - len(set(l)))", "n, m, z = map(int, input().split())\n\ncnt = 0\nfor i in range(z // m):\n\tif (i + 1) * m % n == 0:\n\t\tcnt += 1\n\nprint(cnt)", "n,m,k = [int(i) for i in input().split()]\r\n#l = [int(i) for i in input().split()]\r\n#if n%2 == 1 :\r\n#\tl.append(1)\r\n#\tn = n+1\r\n#l2 = l[:]\r\ndef bmm(n,m):\r\n\tif m>n :\r\n\t\tk = m \r\n\t\tm = n\r\n\t\tn = k\r\n\tif m == 0 :\r\n\t\treturn n\r\n\tif n%m == 0 :\r\n\t\treturn m\r\n\treturn bmm(m,n%m)\r\n#while len(l2) > 1 :\r\n\t#l2 = []\r\n\t#if n%2 == 1 :\r\n\t#\tl.append(1)\r\n\t#\tn = n+1\r\n\t#for i in range(n//2):\r\n\t#\tl2.append(int(l[i*2]*l[i*2+1]/(bmm(l[i*2],l[i*2+1]))))\r\n\t#l = len(l2)*[0]\r\n\t#for i in range(len(l2)):\r\n\t#\tl[i] = l2[i]\r\n\t#n = n//2\r\nprint(k//(n*m//bmm(n,m)))\r\n", "from math import gcd\r\nn,m,z = map(int,input().split())\r\ng = gcd(n, m)\r\nlcm = n*m//g\r\nprint(z//lcm)\r\n", "q=lambda:map(int,input().split())\r\nqi=lambda:int(input())\r\nqs=lambda:input().split()\r\nx,y,z=q()\r\ngreater=max([x,y])\r\nwhile(True):\r\n if((greater % x == 0) and (greater % y == 0)):\r\n lcm = greater\r\n break \r\n greater += 1\r\nprint(z//lcm)", "from math import gcd\r\ndef solution():\r\n n, m, z = map(int, input().split())\r\n g = gcd(n, m)\r\n l = (n*m) // g\r\n print(z // l)\r\n\r\n\r\nsolution()", "a,b,c=map(int,input().split())\r\nn=[i for i in range(a,c+1,a)]\r\ns=[j for j in range(b,c+1,b)]\r\ncount=0\r\nfor x in n:\r\n\tif x in s:\r\n\t\tcount+=1\r\nprint(count)", "a,b,n=map(int,input().split())\r\nx=[i for i in range(a,n+1,a)]\r\ny=[i for i in range(b,n+1,b)]\r\nprint(len(set(x).intersection(set(y))))", "x, y , z = map(int, input().split())\r\na = list(m for m in range(x,z+1) if m % x == 0)\r\nb = list(m for m in range(y,z+1) if m % y == 0)\r\nc = 0\r\nfor p in a:\r\n if p in b: c += 1\r\nprint(c)", "import math\r\nstring = input()\r\nnumbers = string.split(\" \")\r\nx = int(numbers[0])\r\ny = int(numbers[1])\r\nz = int(numbers[2])\r\nprint(z // (x * y // math.gcd(x, y)))", "def gcd(a, b):\r\n if b == 0:\r\n return a\r\n return gcd(b, a%b)\r\n\r\n\r\ndef lcd(a, b):\r\n return (a * b) // gcd(a, b)\r\n\r\n\r\nl = list(map(int, input().split()))\r\nprint(l[2] // lcd(l[0], l[1]))\r\n", "#Taymyr is calling you\r\nn,m,z = map(int,input().split())\r\nc = 0\r\nli1,li2 = [],[]\r\nfor i in range(n,z+1,n):\r\n li1.append(i)\r\nfor i in range(m,z+1,m):\r\n li2.append(i)\r\nfor i in li2:\r\n if i in li1:\r\n c+=1\r\nprint(c)", "# import sys\r\n# sys.stdin=open(\"input.in\",\"r\")\r\nn,m,z=map(int,input().split())\r\nc=0\r\nfor i in range(1,z+1):\r\n\tif (m*i)%n==0 and m*i<=z:\r\n\t\tc+=1\r\nprint(c)", "read = lambda: map(int, input().split())\r\nn, m, z = read()\r\nfrom fractions import gcd\r\nans = z // (n * m // gcd(n, m))\r\nprint(ans)", "def gcd(a, b):\n if (b == 0):\n return a\n return gcd(b, a % b)\n\n[n, m, z] = list(map(int, input().split(\" \")))\nbcnn = (n*m)//gcd(n, m)\nprint(z//bcnn)\n", "n,m,z = map(int,input().strip().split())\r\nc = 0\r\nfor i in range (1,z+1):\r\n if i%n==0 and i%m==0:\r\n c+=1\r\nprint(c)", "\r\n\r\ncall_gap,frequence,day = map(int,input().split(' '))\r\ncount = 0\r\nfor i in range(1,day+1):\r\n if i % call_gap == 0 and i % frequence == 0:\r\n count += 1\r\n\r\nprint (count)", "def gcd(a,b):\r\n\tif b==0:\r\n\t\treturn a\t\r\n\treturn gcd(b,a%b)\r\nn,m,z = map(int, input().split())\r\nlcm = (n*m)//gcd(n,m)\r\nprint(z//lcm)", "import math\nn, m, z = [int(x) for x in input().split(' ')]\nprint(z // (n * m // math.gcd(n, m)))\n", "n,m,z=list(map(int,input().split()))\r\nl=[]\r\nk=[]\r\nfor i in range(n,z+1,n):\r\n l.append(i)\r\nfor j in range(m,z+1,m):\r\n k.append(j)\r\ns=list(set(l)&set(k))\r\nprint(len(s))", "import math\r\nn,m,z = map(int,input().split())\r\nlcm = (n*m)//math.gcd(n,m)\r\nprint(z//lcm)", "#764A\r\nimport math\r\na,b,z=map(int,input().split())\r\nans= 0\r\nfor i in range(a,z+1,a):\r\n for j in range(b,z+1,b):\r\n if i==j:\r\n ans+= 1\r\nprint(ans)", "def gcd(a,b):\r\n if a%b==0:\r\n return b\r\n else:\r\n return gcd(b,a%b)\r\na,b,c=list(map(int,input().strip().split()))\r\nk=a*b/gcd(a,b);\r\nprint(int(c//k))", "n, m, z = map(int, input().split())\r\ndef lcd(a, b):\r\n while a and b:\r\n if a > b:\r\n a %= b\r\n else:\r\n b %= a\r\n return a+b\r\n\r\ndef lcm(a, b):\r\n return a * b / lcd(a, b)\r\n\r\nprint(int(z // lcm(m, n)))", "from math import *\r\nn,m,z=map(int,input().split())\r\ng=gcd(n,m)\r\nl=(n*m)//g\r\nprint(z//l)", "def bn(a,x):\r\n l = 0\r\n r = cnn - 1\r\n while l <= r:\r\n mid = int((l+r+1)/2)\r\n if x < a[mid]:\r\n r = mid -1\r\n elif x > a[mid]:\r\n l = mid + 1\r\n else:\r\n return 1\r\n return 0\r\n \r\n\r\n\r\nn,m,z = list(map(int, input().split()))\r\nres = 0\r\nn,m = min(n,m), max(n,m)\r\nbo = 1\r\nif n == m :\r\n print(int(z/n))\r\n bo = 0\r\ntn = []\r\ncnn = 0\r\ntm = []\r\ncnm = 0\r\nif bo:\r\n for i in range(1,z+1):\r\n if i*n <= z : tn.append(i*n);cnn+=1\r\n else: break\r\n for i in range(1, z+1):\r\n if i*m <= z : tm.append(i*m);cnm+=1\r\n else : break\r\n for i in range(cnm):\r\n if bn(tn,tm[i]):\r\n res += 1\r\n print(res)\r\n ", "a,b,c=map(int,input().split())\r\nd=[]\r\ne=[]\r\nx=y=int(1)\r\nk=int(0)\r\nwhile x*a<=c:\r\n d.append(x*a)\r\n x=x+1\r\nwhile y*b<=c:\r\n e.append(y*b)\r\n y=y+1\r\nfor z in d:\r\n if z in e:\r\n k=k+1\r\nprint(k)", "import math\r\nn,m,z=map(int,input().split())\r\nu=m*n//math.gcd(m,n)\r\nprint(z//u)", "n,m,z = map(int,input().split())\nans = 0\nnn = []\nmm = []\ncnt = 1\nwhile n*cnt <= z:\n\tnn.append(n*cnt)\n\tcnt +=1\ncnt2 = 1\nwhile m*cnt2 <= z:\n\tmm.append(m*cnt2)\n\tcnt2 +=1\nfor i in nn:\n\tif i in mm:\n\t\tans +=1\nprint(ans)\n \t \t \t \t \t \t\t \t \t\t \t \t\t\t", "import math\r\na, b, c=map(int,input().split())\r\nprint (c//((a*b)//math.gcd(a,b)))", "# Ilia-alpinist calls every n minutes, i.e. in minutes n, 2n, 3n and so on.\r\n# Artists come to the comrade every m minutes, i.e. in minutes m, 2m, 3m and so on.\r\n# The day is z minutes long, i.e. the day consists of minutes 1, 2, ..., z.\r\n# How many artists should be killed so that there are no artists in the room when Ilia calls?\r\n\r\n# Consider that a call and a talk with an artist take exactly one minute.\r\n\r\n# Input\r\n# n -- call / n min\r\n# m -- an artist/m min\r\n# z -- the day is z min\r\n\r\n# Output\r\n# the minimum number of artists that should be killed so that there are no artists in the room when Ilia calls.\r\nn, m, z = input().split()\r\nn, m, z = int(n), int(m), int(z)\r\nn1,m1= n,m\r\nkill = 0\r\n# for call in range(n, z+1, n):\r\n# print(\"call\", call)\r\n# for artist in range(m, z+1, m):\r\n# print(\"artist\", artist)\r\n# if call == artist:\r\n# kill += 1\r\n# print(kill)\r\ncalls = []\r\nartists = []\r\nfor call in range(n, z+1, n):\r\n calls.append(call)\r\nfor artist in range(m, z+1, m):\r\n artists.append(artist)\r\nprint(len(list(set(calls).intersection(artists))))\r\n", "a, b, c=map(int, input().split())\r\ncnt=0\r\nfor i in range(1,c+1):\r\n if i%a==0 and i%b==0:\r\n cnt+=1\r\nprint(cnt)\r\n \r\n ", "import sys\r\nfrom fractions import gcd\r\nn,m,k=map(int,input().split())\r\ng=gcd(n,m)\r\nlcm=(n*m)//g\r\nprint (k//lcm)", "n, m, z=map(int, input().split())\r\nc = 0\r\nfor i in range(m, z+1, m):\r\n\tif i%n == 0:\r\n\t\tc += 1\r\nprint(c)", "n,m,z = map(int, input().split())\r\n\r\nans = 0\r\nfor i in range(1, z+1):\r\n\tif i % n == i%m == 0:\r\n\t\tans += 1\r\nprint(ans)\r\n\r\n", "ni,mi,z=list(map(int,input().split()))\r\nm,n=mi,ni\r\nris=0\r\nwhile n<=z:\r\n if n%m==0:\r\n ris+=1\r\n n+=ni\r\nprint(ris)", "import sys\r\ninput = sys.stdin.readline\r\nins = lambda: input().rstrip()\r\nini = lambda: int(input().rstrip())\r\ninm = lambda: map(int, input().rstrip().split())\r\ninl = lambda: list(map(int, input().split()))\r\nout = lambda x, s='\\n': print(s.join(map(str, x)))\r\n\r\nn, m, z = inm()\r\nans = 0\r\nfor i in range(1, z+1):\r\n if i % n == 0 and i % m == 0:\r\n ans += 1\r\nprint(ans)", "import math\r\na,b,c=map(int,input().split())\r\nz=c//math.lcm(a,b)\r\nprint(z)", "text = input().split()\r\nn = int(text[0])\r\nm = int(text[1])\r\nz = int(text[2])\r\na = n\r\nb = m\r\nwhile a != 0:\r\n na = b % a\r\n nb = a\r\n a = na\r\n b = nb\r\nnok = int((n * m)/b)\r\notv = int(z/nok)\r\nprint(otv)\r\n", "'''input\n1 1 10\n'''\nfrom math import gcd\nn, m, z = map(int, input().split())\nprint(z // (n*m//gcd(n,m)))", "def nod(a,b):\r\n while a!=b:\r\n a,b=min(a,b),abs(a-b)\r\n return a\r\ndef nok(a,b):\r\n return a*b//nod(a,b)\r\nn,m,z=[int(x) for x in input().split()]\r\nprint(z//nok(n,m))\r\n", "n,m,z=map(int,input().split())\r\ns1=set()\r\ns2=set()\r\nfor i in range(1,z+1):\r\n if i%n==0:\r\n s1.add(i)\r\n if i%m==0:\r\n s2.add(i)\r\n\r\ns3=s1.intersection(s2)\r\nprint(len(s3))", "import math\r\ndef solve(n,m,z):\r\n lcm = (n * m) / math.gcd(n,m)\r\n return int(z // lcm)\r\nn,m,z = map(int,input().split())\r\n# l = list(map(int,input().split()))\r\n# n = int(input())\r\nprint(solve(n,m,z)) \r\n\r\n\r\n\r\n\r\n", "n, m, z = [int(i) for i in input().split()]\r\ncnt = 0\r\n\r\nfor i in range(1, z+1):\r\n if i % n == 0 and i % m == 0:\r\n cnt += 1\r\n\r\nprint(cnt)\r\n", "#!/usr/bin/env python\n# coding=utf-8\n'''\nAuthor: Deean\nDate: 2021-11-22 23:19:47\nLastEditTime: 2021-11-22 23:28:44\nDescription: Taymyr is calling you\nFilePath: CF764A.py\n'''\n\n\ndef func():\n n, m, z = map(int, input().strip().split())\n count = 0\n for t in range(max(m, n), z + 1):\n if t % n == 0 and t % m == 0:\n count += 1\n print(count)\n\n\nif __name__ == '__main__':\n func()\n", "def gcd(a,b):\r\n\tif(b==0):\r\n\t\treturn a\r\n\telse:\r\n\t\treturn gcd(b,a%b)\r\nn,m,z=map(int,input().split())\r\ng=(n*m)//gcd(n,m)\r\nprint(z//g)", "n,m,z=map(int,input().split())\r\ns=0\r\nfor i in range (1,z+1):\r\n if i%m==0 and i%n==0:\r\n s+=1\r\nprint(s)\r\n\r\n\r\n", "def main():\r\n n, m, z = map(int, input().split())\r\n lcm = n * m // gcd(n, m)\r\n print(z // lcm)\r\n\r\ndef gcd(a, b):\r\n while b:\r\n a, b = b, a % b\r\n return a\r\n\r\nmain()\r\n\r\n", "a, b, c = map(int, input().split())\ncount = 0\nfor i in range(1, c + 1):\n if i % a == 0 and i % b == 0:\n count += 1\n\nprint(count)\n", "n,m,z=map(int,input().split())\r\nfrom math import gcd \r\nlcm=n*m//gcd(n,m)\r\nprint(z//lcm)", "from math import gcd\r\nn,m,z=map(int,input().split())\r\nprint(z//(n*m//gcd(n,m)))", "if __name__ == '__main__' :\r\n n, m, z = map(int, input().split())\r\n def compute_lcm(x, y):\r\n if x > y:\r\n greater = x\r\n else:\r\n greater = y\r\n while (True):\r\n if ((greater % x == 0) and (greater % y == 0)):\r\n lcm = greater\r\n break\r\n greater += 1\r\n\r\n return lcm\r\n print(z//compute_lcm(n, m))", "n,m,z=map(int,input().split(' '))\r\nc=0\r\nfor i in range(m,z+1,m):\r\n if i%n==0:\r\n c+=1\r\nprint(c)", "a,b,c = list(map(int,input().split()))\r\ncount = 0\r\nfor x in range(1,c+1):\r\n if x%a == 0 and x%b == 0:\r\n count += 1\r\nprint(count)", "from fractions import gcd\nn, m, z = map(int, input().split())\nprint( z // (n * m // gcd(n, m) ) )", "# # RED CODER # #\r\nn, m, z = map(int, input().split())\r\ngcd = lambda a,b: a if not b else gcd(b,a%b)\r\np = gcd(n, m)\r\nl = n*m//p\r\nprint(z//l)", "from math import gcd \r\nn,m,z = map(int,input().split())\r\nprint((gcd(n,m)*z)//(n*m))", "a,b,c=map(int,input().split())\nx,y=a,b\nwhile y:x,y=y,x%y\nprint(c//(a*b//x))\n\n", "import math\r\nn, m, z = map(int, input().split())\r\nans = n*m//math.gcd(n, m)\r\nprint(z//ans)\r\n\r\n\r\n", "n, m, z = list(map(int, input().split()))\r\nans = 0\r\nfor i in range(n, z+1, n):\r\n if ((i) % m == 0):\r\n ans += 1\r\nprint(ans)\r\n ", "def gcd(a, b):\r\n if b == 0:\r\n return a\r\n return gcd(b, a%b)\r\n\r\ndef lcm(a, b):\r\n return a // gcd(a, b) * b\r\n\r\nn, m, z = list(map(int, input().split()))\r\nprint(z // lcm(n, m))", "g=lambda x,y:g(y,x%y)if y else x\r\nl=lambda x,y:x*y//g(x,y)\r\na,b,c=map(int,input().split())\r\nprint(c//l(a,b))", "n,m,z=map(int,input().split())\r\ncount=0\r\nlist1=[]\r\nfor i in range(n,z+1,n):\r\n\tlist1.append(i)\r\nfor i in range(m,z+1,m):\r\n\tif i in list1:\r\n\t\tcount+=1\r\nprint(count)", "import math\r\ncall, performance, day = map(int, input().split())\r\nlcm = (call * performance) // math.gcd(call, performance)\r\nprint(day // lcm)", "n,m,z=map(int,input().split())\r\na=[]\r\nb=[]\r\na1=n\r\nc=0\r\ni=n\r\nwhile(i<=z):\r\n a.append(i)\r\n i+=a1\r\nj=m\r\nb1=m\r\nwhile(j<=z):\r\n b.append(j)\r\n j+=b1\r\nfor k in a:\r\n if k in b:\r\n c+=1\r\nprint(c)", "from math import gcd\r\n\r\nn,m,z = map(int, input().split())\r\ng = gcd(n, m)\r\nlcm = n * m // g\r\nprint(z//lcm)", "n,m,z=map(int,input().split())\r\ncount=0\r\nfor i in range(1,z+1):\r\n if(i%n==0 and i%m==0):\r\n count=count+1\r\n\r\nprint(count)", "def gcd(a, b):\r\n if b == 0: return a\r\n return gcd(b, a % b)\r\ndef lcm(a, b):\r\n return a * b // gcd(a, b)\r\nn, m, z = map(int, input().split())\r\nprint(z // lcm(n, m))", "from math import gcd \r\ndef com(x, y, l, r) : \r\n lcm = (x * y) // gcd(x, y) \r\n count1 = (l - 1) // lcm \r\n countr = r // lcm \r\n return countr - count1 \r\nn,m,z=[int(x) for x in input().split(\" \")]\r\nprint(com(n,m,1,z))\r\n", "n, m, z = map(int, input().split())\r\nindex = 1\r\ncount = 0\r\nn, m = max(n, m), min(n, m)\r\nwhile index * n <= z:\r\n if (index * n) % m == 0:\r\n count += 1\r\n index += 1\r\nprint(count)", "a,b,c = map(int,input().split())\r\nans = 0\r\nfor i in range(1,c+1):\r\n if i%a == 0 and i%b == 0:\r\n ans+=1\r\nprint(ans)", "import fractions\r\n\r\nn,m,z = map(int, input().split())\r\nprint(z // (n * m // fractions.gcd(n,m)))", "n, m, z = (int(n) for n in input().split())\nprint(sum(1 for i in range(1, z + 1) if i % n == i % m == 0))\n\n \t \t \t\t\t \t\t \t\t\t \t\t \t \t\t\t", "n,m,z=list(map(int,input().split()))\r\ns1=set()\r\ns2=set()\r\ni=1\r\nwhile True:\r\n if n*i>z and m*i>z:\r\n break;\r\n if n*i<=z:\r\n s1.add(n*i)\r\n if m*i<=z:\r\n s2.add(m*i)\r\n i+=1\r\ns=s1.intersection(s2)\r\nprint(len(s))", "from fractions import * \nn,m,z=list(map(int,input().split()))\nprint(z*gcd(n,m)//n//m)\n", "n,m,z = map(int, input().split())\r\n\r\n\r\nans = 0\r\nfor i in range(z):\r\n if (i+1)%n==0 and (i+1)%m==0:\r\n ans += 1\r\n\r\nprint(ans)", "import math\r\nn,m,z=map(int,input().split())\r\nlcm=(n*m)//math.gcd(n,m)\r\nprint(z//lcm)\r\n", "n, m, z = map(int, input().split())\r\narr = []\r\n\r\ni = n\r\nwhile i <= z:\r\n arr.append(i)\r\n i += n\r\n\r\nr = 0\r\ni = m\r\nwhile i <= z:\r\n if i in arr:\r\n r += 1\r\n i += m\r\n\r\nprint(r)", "def gcd(m,n):\r\n while n:\r\n m,n=n,m%n\r\n return m\r\n\r\nn,m,z=map(int,input().split())\r\nlcm=n*m//gcd(n,m)\r\nprint(z//lcm)", "n = list(map(int, input().split()))\r\na = set()\r\nb = set()\r\nfor i in range(n[2]//n[0]):\r\n a.add((i+1)*n[0])\r\nfor i in range(n[2]//n[1]):\r\n b.add((i+1)*n[1])\r\nprint(len(a & b))", "def gcd(a,b):\r\n if b==0:\r\n return a\r\n return gcd(b,a%b)\r\ndef lcm(a,b):\r\n return (a*b)/gcd(a,b)\r\nlst=[int(i) for i in input().split()]\r\nn,m,z=lst[0],lst[1],lst[2]\r\nprint(int(lst[2]//lcm(lst[1],lst[0])))", "import sys\r\n\r\ndef nod(a, b):\r\n if b == 0:\r\n return a\r\n return nod(b, a % b)\r\n\r\ndef nok(a, b):\r\n return int(a * b / nod(a, b))\r\n\r\nn, m, z = map(int, sys.stdin.readline().split())\r\nprint(z // nok(m, n))", "n, m, z = input().split()\r\nz = int(z)\r\nl = [x for x in range(1,z+1)]\r\nn = int(n)\r\nn_l = [x for x in range(n,z+1,n)]\r\nm = int(m)\r\nm_l = [x for x in range(m,z+1,m)]\r\n\r\n\r\nn_k = [x for x in m_l if x in n_l]\r\nprint(len(n_k))", "n,m,z = map(int,input().split())\r\ni = n\r\nnum = 0\r\nwhile i <= z:\r\n if i % m == 0:\r\n num += 1\r\n i += n\r\nprint(num)\r\n", "n,m,z=(list(map(int,input().split())))\r\nmatch=[0]*(z+1)\r\nfor i in range(1,z+1):\r\n if i%n==0:\r\n match[i]+=1\r\n if i%m==0:\r\n match[i]+=1\r\nprint(match.count(2)) ", "z=list(map(int,input().split()))\r\na=z[0]\r\nb=z[1]\r\nc=z[2]\r\nlt1=[]\r\nlt2=[]\r\nkil=0\r\nfor i in range(1, c+1):\r\n if(i % a == 0):\r\n lt1.append(1)\r\n else:\r\n lt1.append(0)\r\n if(i % b == 0):\r\n lt2.append(1)\r\n else:\r\n lt2.append(0)\r\n if(lt1[i-1] + lt2[i-1] == 2):\r\n kil += 1\r\nprint(kil)", "def 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 m=gcd(x,y)\r\n return m*(x//m)*(y//m)\r\n\r\nn,m,z=map(int,input().split())\r\nprint(z//(lcm(n,m)))\r\n \r\n", "def gcd(fuck,chuda):\r\n if(chuda==0):\r\n return fuck\r\n else:\r\n return gcd(chuda,fuck%chuda)\r\n\r\nmagi,khanki,chutmarani=map(int,input().split())\r\nsex=gcd(magi,khanki)\r\nluccha=(magi*khanki)/sex\r\nboobs=chutmarani/luccha\r\nprint(int(boobs))\r\n", "from math import gcd\r\n\r\n\r\ndef I(): return map(int, input().split())\r\n\r\n\r\nn, m, z = I()\r\nprint(z//(n*m//gcd(n, m)))\r\n", "def gcd(x,y):\n\twhile(y):\n\t\tx,y=y,x%y\n\treturn x\n\ndef lcm(x,y):\n\treturn (x*y)//gcd(x,y)\nb=input()\nb=b.split(\" \")\nn=int(b[0])\nm=int(b[1])\nz=int(b[2])\nprint(z//lcm(n,m))\n", "import math\r\nn, m, z = map(int, input().split())\r\nprint(int(z//((m*n)/math.gcd(n, m))))", "n,m,z=map(int,input().split())\r\ncount=0\r\nb=max(n,m)\r\ni=b\r\nwhile i<=z:\r\n if i%n==0:\r\n if i%m==0:\r\n count+=1\r\n i=i+b\r\nprint(count)", "from math import *\r\ndef bcnn(a,b):\r\n return a*b//gcd(a,b)\r\na,b,c=[int(x) for x in input().split()]\r\nprint(c//bcnn(a,b))", "def gcd(a, b):\r\n return b if a == 0 else gcd(b % a, a)\r\nn, m, z = map(int, input().split())\r\nprint(z // (n * m // gcd(n, m)))", "def gcd(a, b):\r\n while b:\r\n a, b = b, a % b\r\n return a\r\n\r\n\r\ndef mcd(n,m):\r\n return int((n/gcd(n,m))*m)\r\n\r\nn, m, z = (int(i) for i in input().split())\r\n\r\nprint(z // mcd(n,m))", "import math\r\nn,m,z = list(map(int, input().split()))\r\ng = (n*m) // math.gcd(n, m)\r\nif n == 1:\r\n g = m\r\nif m == 1:\r\n g = n\r\nprint(z // g)\r\n", "a,b,c=input().split()\r\ndem=0\r\nfor i in range(1,int(c)+1):\r\n if i%int(a)==0 and i%int(b)==0:\r\n dem+=1\r\nprint(dem)", "import math\r\nn,m,z=map(int,input().split())\r\nx=(n*m)//math.gcd(n,m)\r\nk=max(m,n)\r\nl=min(m,n)\r\nif k%l==0:\r\n print(z//k)\r\nelse:\r\n print(z//x)", "import sys,math,string\ninput=sys.stdin.readline\n\nL=lambda : list(map(int,input().split()))\nM=lambda : map(int,input().split())\nn,m,z=M()\ng=math.gcd(n,m)\nprint((z*g)//(n*m))\n", "\nn, m, z = input().split()\nn, m, z = int(n), int(m), int(z)\n\nres = 0\naux = m\nwhile aux <= z:\n if aux % n == 0:\n res += 1\n aux += m\nprint(res)", "x = input().split()\r\nn = int(x[0])\r\nm = int(x[1])\r\nz = int(x[2])\r\n\r\nlist1 = []\r\nfor i in range(n,10001,n):\r\n if i > z:\r\n break\r\n list1.append(i)\r\ncount = 0\r\nfor i in range(m,10001,m):\r\n if i in list1:\r\n count+=1\r\nprint(count)", "n,m,k=map(int,input().split())\r\nl1=[]\r\nl2=[]\r\nfor i in range(1,k+1):\r\n if n*i<=k:\r\n l1.append(n*i)\r\nfor i in range(1,k+1):\r\n if m*i<=k:\r\n l2.append(m*i)\r\ncount=0\r\nfor x in l1:\r\n if x in l2:\r\n count+=1\r\nprint(count) ", "n, m, z = map(int, input().split())\r\ncount = 0\r\n\r\nfor i in range(1, z+1):\r\n if i % n == 0 and i % m == 0:\r\n count += 1\r\n\r\nprint(count)", "from math import gcd\r\n\r\ndef lcm(a, b):\r\n \"\"\"Compute the lowest common multiple of a and b\"\"\"\r\n return a * b / gcd(a, b)\r\n\r\na,b,c = map(int,input().split())\r\na,b = min(a,b), max(a,b)\r\nif not b%a:\r\n print (c//b)\r\nelse:\r\n print (int(c//lcm(a,b)))", "import math\r\nn,m,z=map(int,input().split())\r\nx=(n*m)//math.gcd(n,m)\r\nprint(z//x)", "n, m, z = map(int, input().split())\r\nc = 0\r\nfor i in range(1, z+1):\r\n if i%n == 0 and i%m == 0:\r\n c += 1\r\nprint(c)\r\n", "\r\nn,m,z=map(int,input().split())\r\n# print(n,m,z)\r\nni=[]\r\nmi=[]\r\ncount=0\r\nfor i in range(1,z+1):\r\n\tif n*i<=z:\r\n\t\tni.append(n*i)\r\n\tif m*i<=z:\r\n\t\tmi.append(m*i)\r\nfor i in ni:\r\n\tif i in mi:\r\n\t\tcount=count+1\r\nprint(count)", "n, m, z = map(int, input().split())\n\nnumCall = z // n\nliaCall = []\nfor i in range(numCall):\n liaCall.append((i+1)*n)\nnumArt = z // m\nartTalk = []\nfor i in range(numArt):\n artTalk.append((i+1)*m)\n\nkilled = 0\nfor i in range(len(artTalk)):\n if artTalk[i] in liaCall:\n killed += 1\nprint(killed)", "import math\nnmz=[int(i) for i in input().split()]\nn=nmz[0]\nm=nmz[1]\nz=nmz[2]\nh=math.gcd(n,m)\nl=int(n*m/h)\nans=int(z//l)\nprint(ans)", "from math import gcd \n\n\ndef solve(n, m, z):\n lcm = (n * m)//(gcd(n, m))\n return z // lcm\n\n\ndef main():\n n, m, z = list(map(int, input().split()))\n print(solve(n, m, z))\n\n\nmain()\n", "n,m,k=map(int,input().split())\r\na=0\r\nfor x in range(1,k+1):\r\n\tif x%n==0 and x%m==0:\r\n\t\ta+=1\r\nprint(a)", "#2 3 20\n#2 4 6 8 10 12 14 16 18 20\n#3 6 9 12 15 18\nf=1\nC=0\nn,m,z=map(int,input().split())\nwhile m*f<=z:\n if m*f%n==0:\n C+=1\n f+=1\nprint(C)\n\n\"\"\"\ns1={n}\ns2={m}\nf=2\n\nwhile n*f<=z:\n s1.add(n*f)\n f+=1\nf=2\nwhile m*f<=z:\n s2.add(m*f)\n f+=1\nprint(len(s1.intersection(s2)))\n\"\"\"\n", "n, m, z = map(int, input().split())\n\ndef pgcd(a,b):\n while b:\n a,b = b,a%b\n return a\n\nd = pgcd(n,m)\na = n * m // pgcd(n,m)\nprint(z//a)\n", "import os\n\nLOCAL_PC = 'n1amr' in os.path.expanduser('~')\n\n\ndef process_file(in_name, out_name):\n with open(in_name, 'r') as fin:\n with open(out_name, 'w') as fout:\n def read():\n return fin.readline().rstrip('\\n')\n\n def write(*args, end='\\n'):\n text = ' '.join(map(str, args)) + end\n fout.write(text)\n print(text, end='')\n\n t = int(fin.readline())\n for i in range(t):\n read()\n write('Case #{T}: \\n'.format(T=i + 1), end='')\n solve(read, write)\n write()\n\n\ndef process_stdio():\n def read():\n return input()\n\n def write(*args, end='\\n'):\n print(*args, end=end)\n\n solve(read, write)\n\n\ndef gcd(a, b):\n if b == 0:\n return a\n return gcd(b, a % b)\n\n\ndef lcm(a, b):\n return a * b // gcd(a, b)\n\n\ndef solve(input, print):\n n, m, z = map(int, input().split())\n print(z // lcm(n, m))\n\n\nif __name__ == '__main__':\n if LOCAL_PC:\n in_name = __file__[:-3] + '.in'\n out_name = __file__[:-3] + '.out'\n process_file(in_name, out_name)\n else:\n process_stdio()\n", "a = list(map(int,input().split()))\r\nn = a[0]\r\nm = a[1]\r\nz = a[2]\r\nk = 0\r\nwhile z != 0:\r\n if z % m ==0 and z % n == 0:\r\n k += 1\r\n z -=1\r\n \r\nprint(k)\r\n", "def taymir(n, m, z):\r\n count = 0\r\n for i in range(1, z + 1):\r\n if i % n == 0 and i % m == 0:\r\n count += 1\r\n return count\r\n\r\n\r\nN, M, Z = [int(j) for j in input().split()]\r\nprint(taymir(N, M, Z))\r\n", "def gcd(a, b):\r\n if(b == 0):\r\n return a\r\n return gcd(b, a%b)\r\n\r\n\r\nn, m, z = map(int, input().split())\r\nlcm = (n*m)//gcd(n, m)\r\nprint(z//lcm)\r\n", "# t = int(input())\r\n# for x in range(t):\r\nn,m,z = map(int,input().split())\r\nl_n = []\r\nl_m = []\r\ni = 1\r\nj= 1\r\nwhile i>0:\r\n if i*n<=z:\r\n l_n.append(i*n)\r\n else:\r\n break\r\n i+=1\r\nwhile j>0:\r\n if j*m<=z:\r\n l_m.append(j*m)\r\n else:\r\n break\r\n j+=1\r\nnum = 0\r\nfor k in l_n:\r\n if k in l_m:\r\n num += 1\r\nprint(num)", "\r\nlista=(input()).split()\r\nn,m,z=int(lista[0]), int(lista[1]), int(lista[2])\r\nlista2=[i for i in range(m,z+1,m)]\r\nzbroj=0\r\nfor i in range(n,z+1,n):\r\n if i in lista2:\r\n zbroj+=1\r\nprint (zbroj)\r\n \r\n \r\n", "import math\r\n\r\nif __name__ == '__main__':\r\n n, m, z = str(input()).split()\r\n n = int(n)\r\n m = int(m)\r\n z = int(z)\r\n print((z * math.gcd(n, m)) // (n * m))\r\n", "a = list(map(int,input().split()))\r\ncount = 0\r\nfor i in range(1,a[2]+1):\r\n if(i%a[0]==0 and i%a[1]==0):\r\n count = count + 1\r\nprint(count)", "def lcm(a,b):\n if(a<b):\n c=b\n while(1):\n if(c%a==0 and c%b==0):\n return c\n c+=1\n else :\n c=a\n while(1):\n if(c%a==0 and c%b==0):\n return c\n c+=1\n\nx = input()\na = x.split(\" \")\nprint(int(int(a[2])/(lcm(int(a[0]),int(a[1])))))\n\t\t\t\t\t\t \t \t \t \t\t\t\t\t", "# import sys \r\n# sys.stdin=open(\"input.in\",'r')\r\n# sys.stdout=open(\"outp.out\",'w')\r\nn,m,z=map(int,input().split())\r\na=[i for i in range(n,z+1,n)]\r\nb=[j for j in range(m,z+1,m)]\r\nc=0\r\nfor x in a:\r\n\tif x in b:\r\n\t\tc+=1\r\nprint(c)\t\t", "def lcm(x, y):\r\n x, y = max(x, y), min(x, y)\r\n\r\n \r\n for i in range(1, y+1):\r\n if x*i%y==0:\r\n return x*i\r\n \r\n\r\nn, m, z = list(map(int, input().split()))\r\n\r\nx = lcm(n, m)\r\n\r\nprint(z//x)\r\n", "n, m, z = map(int, input().split())\r\na = 0\r\nb = m\r\nfor i in range(z):\r\n if(m%n == 0 and m<=z):\r\n a += 1\r\n m += b\r\nprint(a)\r\n\r\n", "def gcd(x, y):\r\n while True:\r\n if(x == 0):\r\n break\r\n if(y == 0):\r\n break\r\n if(x > y):\r\n x %= y\r\n else:\r\n y %= x\r\n return x + y\r\n\r\nlcm = lambda x, y: x * y // gcd(x, y)\r\n\r\nn, m, z = map(int, input().split())\r\nprint(z // lcm(n, m))", "a,b,c=map(int,input().split())\r\ni=1\r\ns=[]\r\nt=[]\r\nwhile a*i<=c:\r\n s.append(a*i)\r\n i=i+1\r\ni=1\r\nwhile b*i<=c:\r\n t.append(b*i)\r\n i=i+1\r\nprint(len(list(set(s)&set(t))))", "n=list(map (int,input().split()))\r\nk=0\r\nfor i in range (1,n[2]+1):\r\n\tif i%n[0]==0 and i%n[1]==0:\r\n\t\tk=k+1\r\nprint(k)\r\n", "try:\r\n a,b,c=map(int,input().split())\r\n count=0\r\n for i in range(1,c+1):\r\n if(i%a ==0 and i%b==0):\r\n count=count+1\r\n print(count)\r\nexcept:\r\n pass", "def gcd(a,b):\n if a == 0:\n return b\n return gcd(b % a, a)\n\ndef lcm(a,b):\n return (a // gcd(a,b))* b\n\nn,m,z=map(int,input().split())\n#print(lcm(n,m))\nprint(z//lcm(n,m))\n\t\t\t\t\t\t \t \t \t \t\t\t\t\t \t \t \t", "from math import gcd\r\nn,m,z=map(int,input().split())\r\nprint(z//((n*m)//gcd(n,m)))", "a,b,c = map(int,input().split())\r\ne = a\r\nf = b\r\nwhile True:\r\n if a > c or b > c:\r\n print(0)\r\n break\r\n if a < b:\r\n a+=e\r\n elif b < a:\r\n b+=f\r\n else:\r\n print(c//a)\r\n break", "n,m,z=map(int,input().split())\r\ne = set()\r\nd = []\r\nfor i in range(n,z+1,n):\r\n\te.add(i)\r\nfor i in range(m,z+1,m):\r\n\tif i in e:\r\n\t\td.append(i)\r\n\r\nprint(len(d))\r\n", "n,m,z = map(int,input().split())\r\nkill = 0\r\nli = []\r\nli2 = []\r\ni = n\r\nj = m\r\nfor i in range(i,z+1,n):\r\n li.append(i)\r\nfor j in range(j,z+1,m):\r\n li2.append(j)\r\n\r\ncommon_list = [c for c in li if c in li2]\r\nprint(len(common_list))", "n,m,z=map(int,input().split())\r\ncnt=0\r\nfor i in range(1,z+1):\r\n if i>=n and i%n==0 and i>=m and i%m==0:\r\n cnt=cnt+1\r\nprint(cnt)", "n,m,z=map(int,input().split())\r\nl1=set([i*n for i in range(1,z//n+1)])\r\nl2=set([i*m for i in range(1,z//m+1)])\r\nprint(len(l1 & l2))\r\n", "n,m,z=map(int,input().split())\r\nl1=[]\r\nl2=[]\r\nfor i in range(1,z+1):\r\n p=i*n \r\n q=i*m \r\n if p<=z:\r\n l1.append(p)\r\n if q<=z:\r\n l2.append(q)\r\nc=0\r\nfor i in l1:\r\n if i in l2:\r\n c+=1 \r\nprint(c)", "nums = input().split(' ')\r\nfor i in range(len(nums)):\r\n nums[i] = int(nums[i])\r\nday = 0\r\nnextCall = nums[0]\r\nnextArtists = nums[1]\r\nkillCount = 0\r\nwhile day != nums[2]:\r\n artist = False\r\n day += 1\r\n if nextArtists == day:\r\n artist = True\r\n nextArtists += nums[1]\r\n if nextCall == day:\r\n nextCall += nums[0]\r\n if artist == True:\r\n killCount += 1\r\nprint(killCount)", "def gcd(a, b):\n \"\"\"Return greatest common divisor using Euclid's Algorithm.\"\"\"\n while b: \n a, b = b, a % b\n return a\n\ndef lcm(a, b):\n \"\"\"Return lowest common multiple.\"\"\"\n return a * b // gcd(a, b)\n\nn, m, z = [int(i) for i in input().split()]\nprint(z // lcm(m,n))", "# import os\r\n\r\nn, m, z = map(int,input().split())\r\n\r\nnn = []\r\nfor i in range(1,z+1):\r\n if n*i <= z:\r\n nn.append(n*i)\r\n else:\r\n break\r\nmm = []\r\nfor i in range(1, z+1):\r\n if m*i <= z:\r\n mm.append(m*i)\r\n else:\r\n break\r\n\r\nprint(len(set(mm)&set(nn)))\r\n\r\n\r\n# 22 ", "n, m, d = map(int, input().split())\r\nprint(len(set([n*i for i in range(1, d//n+1)]).intersection([m*i for i in range(1, d//m+1)])))", "def main():\r\n from math import gcd\r\n [n, m, z] = [int(_) for _ in input().split()]\r\n lcm = n // gcd(n, m) * m\r\n print(z // lcm)\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "n, m, z = (int(x) for x in input().split())\nprint(sum([1 for x in range(1, z + 1) if x % n == x % m == 0]))\n", "x,y,z=map(int,input().split())\r\ndef intersection(lst1, lst2): \r\n lst3 = [value for value in lst1 if value in lst2] \r\n return lst3\r\ni=x\r\nl=[]\r\nl1=[]\r\nwhile i<=z:\r\n l.append(i)\r\n i=i+x\r\nj=y \r\nwhile j<=z:\r\n l1.append(j)\r\n j=j+y\r\nz=intersection(l, l1)\r\nprint(len(z))", "n,m,z = map(int,input().split(\" \"))\r\n\r\ni , j , count = 1 , 1 , 0\r\n\r\nwhile (i*n) <= z :\r\n if (j*m) > (i*n) :\r\n i+=1\r\n continue\r\n elif (j*m) < (i*n):\r\n j+=1\r\n else:\r\n count+=1\r\n i+=1\r\n\r\nprint(count)\r\n\r\n", "n, m, z = map(int, input().split())\r\n\r\nans = 0\r\n\r\nfor i in range(n, z + 1, n):\r\n if i % m == 0: ans += 1\r\nprint(ans) ", "n,m,z=map(int,input().split())\r\nx=[]\r\ny=[]\r\nfor i in range(1,z//n+1):\r\n x.append(i*n)\r\nfor i in range(1,z//m+1):\r\n y.append(i*m)\r\nk=[]\r\nk=set(x)&set(y)\r\nprint(len(k))", "str1 = input()\r\nn, m, z = str1.split()\r\nn = int(n)\r\nm = int(m)\r\nz = int(z)\r\n\r\ndef gcd(a,b):\r\n\tr = a%b\r\n\twhile r:\r\n\t\ta = b\r\n\t\tb = r\r\n\t\tr = a%b\r\n\treturn b\r\n\r\ndef lcm(a,b):\r\n\treturn a*b//gcd(a,b)\r\n\r\nprint( z//lcm(m,n) )", "import math\r\ndef answer():\r\n a = [int(x) for x in input().split()]\r\n print(int(a[2]/((a[0]*a[1])/math.gcd(a[0],a[1]))))\r\nanswer()", "def gcd(a,b):\r\n while b > 0:\r\n a, b = b, a % b\r\n return a\r\n \r\ndef lcm(a, b):\r\n return a * b / gcd(a, b)\r\nn,m,z=map(int,input().split(' '))\r\nprint(int(z/lcm(m,n)))", "import math\r\n\r\nn,m,t=map(int,input().split())\r\nkmm=(n*m)//math.gcd(n,m)\r\nprint(t//kmm)", "def gcd(a, b):\r\n\tif (b == 0):\r\n\t\treturn a\r\n\telse:\r\n\t\treturn gcd(b, a%b)\r\n\t\t\r\ndef lcm(a, b):\r\n\treturn (a * b)//gcd(a,b)\r\n\r\n\r\nn, m, z = map(int, input().split())\r\n\r\nprint(z//lcm(n,m))\r\n\r\n", "n, m, k = map(int, input().split())\r\n\r\ndef gcd(a,b):\r\n if a == 0:\r\n return b\r\n return gcd(b % a, a)\r\n\r\ndef lcm(a, b):\r\n return (a*b) // gcd(a, b)\r\n\r\nprint(k // lcm(n, m)) ", "import math\r\ndef lcm(a,b):\r\n return (a*b)//math.gcd(a,b)\r\na,b,c=map(int,input().split())\r\ni,k=1,0\r\nwhile i<=c:\r\n if i%lcm(a,b)==0:\r\n k+=1\r\n i+=1\r\nprint(k)", "n, m, z = map(int, input().split())\r\nc=0\r\nfor i in range(0, z+1, n):\r\n\tif i==0:\r\n\t\tpass\r\n\telse:\r\n\t\tif not i%m:\r\n\t\t\tc+=1\r\nprint(c)", "# n = int(input())\r\n# a = []\r\n# m = []\r\n# for i in range(n):\r\n# d,k = [int(i) for i in input().split()]\r\n# if k % d != 0:\r\n# a.append(k % d)\r\n# else:\r\n# pass\r\n# a_set = set(a)\r\n# most = None\r\n# most1 = 0\r\n# for i in a_set:\r\n# q = a.count(i)\r\n# if q >= most1:\r\n# most1 = q\r\n# most = i\r\n# m.append(i)\r\n# b = -1\r\n# for i in range(len(m)):\r\n# if m[i] > b:\r\n# b = a[i]\r\n# print(b)\r\n#\r\n# n = int(input())\r\n# s = input()\r\n# k = 0\r\n# flag = False\r\n# def decode():\r\n# global s,k,flag\r\n# s1 = re.search(r'xxx',s)\r\n# if s1:\r\n# end = s1.end()\r\n# k += 1\r\n# s = s[end:]\r\n# flag = True\r\n# decode()\r\n# else:\r\n# pass\r\n# decode()\r\n# if flag:\r\n# print(k)\r\n# else:\r\n# print(0)\r\n#\r\n# import time\r\n# start_time = time.clock()\r\n# a1 = []\r\n# res = []\r\n# a = None\r\n# while a != 0:\r\n# a = int(input())\r\n# a1.append(a)\r\n# for i in range(1,len(a1)):\r\n# for j in range(1,len(a1)):\r\n# if (a1[i-1] * a1[j-1]) % 7 == 0 and (a1[i-1] * a1[j-1]) % 49 != 0:\r\n# res.append(a1[i-1] * a1[j-1])\r\n# else:\r\n# pass\r\n# print(max(res))\r\n# print(time.clock() - start_time)\r\n#\r\n# n = int(input())\r\n# i = 0\r\n# k = []\r\n# x = []\r\n# y = []\r\n# while i != n:\r\n# a,b = [int(i) for i in input().split()]\r\n# x.append(a)\r\n# y.append(b)\r\n# i += 1\r\n# for i in range(n):\r\n# if x[i] >= 0 and y[i] >= 0:\r\n# k.append(1)\r\n# elif x[i] <= 0 and y[i] >= 0:\r\n# k.append(2)\r\n# elif x[i] <= 0 and y[i] <= 0:\r\n# k.append(3)\r\n# else:\r\n# k.append(4)\r\n# k1 = {i: k.count(i) for i in set(k)}\r\n# k1 = max(k1.items())\r\n# print('K = ',k1[0])\r\n# print('M = ',k1[1])\r\n#\r\n# import time\r\n# t = time.clock()\r\n# n = int(input())\r\n# n1 = n\r\n# a = []\r\n#\r\n# while n1 != 0:\r\n# a.append(int(input()))\r\n# n1 -= 1\r\n# m = a[0] + a[7]\r\n# for i in range(n-7):\r\n# if a[i] + a[i+7] > m:\r\n# m = a[i] + a[i+7]\r\n# print(m)\r\n# print(time.clock()-t)\r\n#\r\n# n = int(input())\r\n# n1 = n\r\n# x = []\r\n# y = []\r\n# s = []\r\n# while n1 != 0:\r\n# a,b = [int(i) for i in input().split()]\r\n# x.append(a)\r\n# y.append(b)\r\n# n1 -= 1\r\n# for i in range(n):\r\n# if y[i] % x[i] == 0:\r\n# pass\r\n# else:\r\n# s.append(y[i] % x[i])\r\n# s1 = {i: s.count(i) for i in set(s)}\r\n# s1 = max(s1.items())\r\n# print(s1[0])\r\n#\r\n# s1 = input()\r\n# s2 = input()\r\n# s1_list = list(s1)\r\n# s2_list = list(s2)\r\n# s1_list.sort()\r\n# s2_list.sort()\r\n# if s1_list == s2_list:\r\n# print('Yes')\r\n# else:\r\n# print('No')\r\n#\r\n# k = 0\r\n# s1 = input()\r\n# s1_sort = {i:s1.count(i) for i in set(s1)}\r\n# for i in range(1,len(s1)):\r\n# if s1[i-1] == s1[i]:\r\n# s1.replace(s1[i+1],'')\r\n# print(s1)\r\n#\r\n# a = [6,3,5,7,4,2]\r\n# m1 = 1000\r\n# m2 = 1000\r\n# for i in range(len(a)):\r\n# if a[i] < m1:\r\n# m2 = m1\r\n# m1 = a[i]\r\n# elif a[i] < m2:\r\n# m2 = a[i]\r\n# print(m1,m2)\r\n#\r\n# import random\r\n#\r\n# a = ord('a')\r\n# A = ord('A')\r\n# z = ord('z')\r\n# Z = ord('Z')\r\n# c = ord('0')\r\n# n = [chr(i) for i in range(a, z + 1)]\r\n# for j in range(A, Z + 1):\r\n# n.append(chr(j))\r\n# for i in range(c, c + 10):\r\n# n.append(chr(i))\r\n# k = random.sample(n, 20)\r\n# print(k)\r\n# s = input()\r\n# a = [i for i in s]\r\n# di = {i:a.count(i) for i in a}\r\n# di = sorted(di.items())\r\n# print(di[0][0],'find',di[0][1])\r\n#\r\n# import random\r\n#\r\n# a = [input() for _ in range(3)]\r\n# a = {i:a.count(i) for i in set(a)}\r\n# a = sorted(a.items(), key=lambda x: x[1], reverse=True)\r\n# print(int(a[0][0]), a[0][1])\r\n#\r\n# c = 10000\r\n# n = 15\r\n# a = [int(input()) for _ in range(18)]\r\n# while n != len(a):\r\n# for i in range(15,len(a)):\r\n# if (a[i-n] * a[i]) % 2 == 0 and (a[i-n] * a[i]) < c:\r\n# c = a[i-n] * a[i]\r\n# n += 1\r\n# print(c)\r\n#\r\n# a = input()\r\n# b = []\r\n# k = 0\r\n# flag = True\r\n# n = ['0','1','2','3','4','5','6','7','8','9']\r\n# for i in a:\r\n# if i.isdigit():\r\n# b.append(i)\r\n# while flag:\r\n# c = {i: b.count(i) for i in set(b)}\r\n# for i in c.items():\r\n# if i[1] == 1:\r\n# key = i[0]\r\n# k += 1\r\n# if k > 1:\r\n# print('No')\r\n# flag = False\r\n# if k == 1:\r\n# l = [0] * (len(b) + 2)\r\n# l[len(l) // 2] = key\r\n# j = 0\r\n# x = 1\r\n# while j != len(n):\r\n# for i in c.keys():\r\n# if i == n[j]:\r\n# l[(len(l) // 2) + x] = i\r\n# l[(len(l) // 2) - x] = i\r\n# x += 1\r\n# j += 1\r\n# for i in range(0,(len(l) // 2)-1):\r\n# if l[i] == key:\r\n# del l[i]\r\n# for i in range(len(l) // 2,len(l)):\r\n# if l[i] == key:\r\n# del l[i]\r\n# print(l)\r\n# flag = False\r\n# if k == 0:\r\n# l = [0] * (len(b))\r\n# x = 0\r\n# o = 1\r\n# j = 0\r\n# while j != len(n):\r\n# for i in c.keys():\r\n# if i == n[j]:\r\n# l[(len(l) // 2) + x] = i\r\n# l[(len(l) // 2) - o] = i\r\n# x += 1\r\n# o += 1\r\n# j += 1\r\n# print(l)\r\n# n = 3\r\n# m = 10000\r\n# mn = m + 1\r\n# a = [int(input()) for i in range(n)]\r\n# if sum(a) % 6 != 0:\r\n# print(a, sum(a))\r\n# else:\r\n# for i in a:\r\n# if i < mn:\r\n# mn = i\r\n# if mn < m:\r\n# print(n-1,sum(a)-mn)\r\n# else:\r\n# print(0,0)\r\n# n = 4\r\n# a = [0 for _ in range(n)]\r\n# def func(i):\r\n# if i < 4:\r\n# for k in (0,1):\r\n# a[i] = k\r\n# func(i+1)\r\n# else:\r\n# c = 0\r\n# if (a[0] or a[1]) and (not a[2] or not a[3]):\r\n# c = 1\r\n# print(a,c)\r\n#\r\n# func(0)\r\n#\r\n# a = [i for i in range(1,100)]\r\n# #b = [2, 3, 4, 1, 6, 5, 7, 9, 8]\r\n# #print(list(enumerate(zip(a,b))))\r\n# print(','.join([str(i) for i in range(1,100)]))\r\n# print(','.join(map(str,a)))\r\n#\r\n# s = input()\r\n# a = [i for i in s]\r\n# if a[0] == a[0].upper():\r\n# print(''.join(a))\r\n# else:\r\n# a[0] = a[0].upper()\r\n# print(''.join(a))\r\n#\r\n# n, a, b, res, c = int(input()), [], [], [], 0\r\n# while n != 0:\r\n# x, y = [int(i) for i in input().split()]\r\n# a.append(x)\r\n# b.append(y)\r\n# n -= 1\r\n# res.append(b[0])\r\n# for i in range(1, len(a)):\r\n# res.append(res[c] - a[i] + b[i])\r\n# c += 1\r\n# print(max(res))\r\n#\r\n#\r\n# a = [i for i in input()]\r\n# b = [i for i in input()]\r\n# k,l = 0,0\r\n# flag = True\r\n# c1 = sorted(a, key=lambda x: (str.upper(x),x))\r\n# c2 = sorted(b, key=lambda x: (str.upper(x),x))\r\n# if flag:\r\n# for i, j in zip(c1,c2):\r\n# if i != j:\r\n# if ord(i.lower()) > ord(j.lower()):\r\n# print(1)\r\n# flag = False\r\n# break\r\n# elif ord(i.lower()) < ord(j.lower()):\r\n# print(-1)\r\n# flag = False\r\n# break\r\n# else:\r\n# pass\r\n# if flag:\r\n# print(0)\r\n#\r\n#\r\n# for i, j in zip(a,b):\r\n# k += ord(i)\r\n# l += ord(j)\r\n# if i == j.upper():\r\n# l = k\r\n# elif j == i.upper():\r\n# k = l\r\n# if k > l:\r\n# print(1)\r\n# elif k < l:\r\n# print(-1)\r\n# else:\r\n# print(0)\r\n#\r\n# a,n = [int(i) for i in input().split()]\r\n# s = [i for i in input()]\r\n# for _ in range(n):\r\n# flag = True\r\n# for i in range(len(s)-1):\r\n# if flag:\r\n# if s[i] == 'B' and s[i+1] == 'G':\r\n# s[i], s[i+1] = s[i+1], s[i]\r\n# flag = False\r\n# else:\r\n# flag = True\r\n# print(''.join(s))\r\n# n, m = int(input()), int(input())\r\n#\r\n#\r\n# s = input()\r\n# a = [0 for _ in range(len(s))]\r\n# j = 0\r\n# def func():\r\n# global s,j\r\n# k = 0\r\n# m = -1\r\n# for i in s:\r\n# if ord(i) > m:\r\n# m = ord(i)\r\n# if s.count(chr(m)) <= 1:\r\n# s = s.replace(chr(m),'')\r\n# return func()\r\n# else:\r\n# for i in range(j,s.count(chr(m))-j-1):\r\n# a[i] = chr(m)\r\n# a[len(a)-i-1] = chr(m)\r\n# k = i\r\n# j = k+1\r\n# s = s.replace(chr(m), '')\r\n# if (0 not in a) or (not list(s)):\r\n# print(a)\r\n# else:\r\n# s = s.replace(chr(m), '')\r\n# return func()\r\n# func()\r\n#\r\n# s = input()\r\n# m = -1\r\n# j = 0\r\n# k = 0\r\n# a = [i for i in s]\r\n# for i in range(len(a)):\r\n# if ord(a[i]) > m:\r\n# m = ord(a[i])\r\n# if a.count(chr(m)) > 1:\r\n# for i in range(j,a.count(chr(m))):\r\n# a[a.index(chr(m))], a[i] = a[i], a[a.index(chr(m))]\r\n# k = i\r\n# j = k\r\n# print(a)\r\n#\r\n# eng, r, e = ['a','b','c','d','e','f','g','h','i','j','k','l','m','n','o','p','q','r','s','t','w','x','y','z'],\\\r\n# [], []\r\n# s = input()\r\n# for i in s:\r\n# if i in eng:\r\n# e.append(i)\r\n# else:\r\n# r.append(i)\r\n# # if ' ' or '.' in e:\r\n# # # e.remove(' ')\r\n# # # e.remove('.')\r\n# if ' ' or '.' in r:\r\n# r.remove(' ')\r\n# r.remove('.')\r\n# for i in set(e):\r\n# print(i, e.count(i))\r\n# for i in set(r):\r\n# print(i, r.count(i))\r\n#\r\n# BUBBLE\r\n# n = int(input())\r\n# a = [int(input()) for _ in range(n)]\r\n# k = 6\r\n# c = 0\r\n# for i in range(n-6):\r\n# for j in range(i+6,n):\r\n# if (a[i] + a[j]) % 2 != 0:\r\n# c += 1\r\n# print(c)\r\n#\r\n# SHELL\r\n# a = [4,2,76,1,8,23]\r\n# def shell():\r\n# t = int(len(a)/2)\r\n# while t > 0:\r\n# for i in range(len(a)-t):\r\n# j = i\r\n# while j >= 0 and a[j] > a[j+t]:\r\n# a[j], a[j+t] = a[j+t], a[j]\r\n# j -= 1\r\n# t = int(t/2)\r\n# return a\r\n# print(shell())\r\n#\r\n#\r\n#\r\n# def fibonacci(n):\r\n# a, b = 0, 1\r\n# for _ in range(1, n):\r\n# a, b = b, a + b\r\n# return b\r\n# print([fibonacci(i) for i in range(1,13)])\r\n#\r\n# def func(n):\r\n# if n in (1,2):\r\n# return 1\r\n# elif n % 3 == 0:\r\n# return func(n - 2) + func(n // 3)\r\n# else:\r\n# return func(n-2)\r\n# a = [func(i) for i in range(1,56)]\r\n# a = {i:j for i,j in zip(range(1,56), a)}\r\n# print(a[55])\r\n#\r\n# b = [int(i) for i in input().split()]\r\n# # n = int(input())\r\n# # ind = int(input())\r\n# a = []\r\n# for i in range(1,b[0]+1):\r\n# if i % 2 != 0:\r\n# a.append(i)\r\n# for i in range(1,b[0]+1):\r\n# if i % 2 == 0:\r\n# a.append(i)\r\n# print(a[b[1]-1])\r\n#\r\n# a = []\r\n# N = 10\r\n# for i in range(0, N):\r\n# a.append(int(input()))\r\n# m1 = min((i for i in a if i % 2 != 0), default=0)\r\n# m2 = max((i for i in a if i % 2 != 0), default=0)\r\n# for i in range(0,N):\r\n# if a[i] % 2 == 0 and m1 < a[i] < m2:\r\n# a[i] -= m1\r\n# print(a)\r\n#\r\n# a = [-1,-2,6]\r\n# m = min((i for i in a if i >=0 and i % 6 != 0), default='Не найдено')\r\n# print(m)\r\n#\r\n# k = None\r\n# flag = True\r\n# n = int(input())\r\n# a = [int(i) for i in input().split()]\r\n# if sum(a) % 2 == 0:\r\n# print(sum(a))\r\n# else:\r\n# while flag:\r\n# k = min(a)\r\n# if k % 2 != 0:\r\n# del a[a.index(k)]\r\n# if sum(a) % 2 == 0:\r\n# print(sum(a))\r\n# flag = False\r\n# else:\r\n# print(sum(a))\r\n# flag = False\r\n#\r\n# n = int(input())\r\n# a = [int(input()) for _ in range(n)]\r\n# k = 6\r\n# m = -1\r\n# while k != len(a):\r\n# for i in range(n-k):\r\n# if (a[i] + a[i+k]) > m and (a[i] + a[i+k]) % 2 != 0:\r\n# m = a[i] + a[i+k]\r\n# k += 1\r\n# print(m)\r\n#\r\n# n = int(input())\r\n#\r\n# def func(n):\r\n# if n in (1,2):\r\n# return 1\r\n# if n == 0:\r\n# return 0\r\n# else:\r\n# return func(n-1)+func(n-2)\r\n# for i in range(0,11):\r\n# print(func(i))\r\n#\r\n# a = [100,8,33,45,19,90]\r\n# m = -1\r\n# for i in range(len(a)):\r\n# for j in range(i,len(a)):\r\n# if a[i] + a[j] > m and (a[i] + a[j]) % 2 != 0:\r\n# m = a[i] + a[j]\r\n# print(m)\r\n#\r\n# a = list()\r\n# for i in range(2):\r\n# p = list(map(int,input().split()))\r\n# a.append(p)\r\n# print(a)\r\n#\r\n# k = []\r\n# a = [15,417,123,6,4841]\r\n# for i in a:\r\n# k.append(i % 10 + (i // 10) % 10 )\r\n# k = {i:k.count(i) for i in k}\r\n# b = sorted(k.items(), key=lambda x: x[1], reverse=True)\r\n# for i in range(len(b)):\r\n# if b[i][1] != max(k.values()):\r\n# del b[i]\r\n# print(sorted(b, key=lambda x: x[0], reverse=True)[0][0])\r\n#\r\n#\r\n#\r\n# for i in range(len(a)):\r\n# min = i\r\n# for j in range(i+1, len(a)):\r\n# if a[j] < a[min]:\r\n# min = j\r\n# a[i], a[min] = a[min], a[i]\r\n#\r\n# for i in range(len(a)):\r\n# v = a[i]\r\n# j = i\r\n# while a[j-1] > v and j > 0:\r\n# a[j] = a[j-1]\r\n# j -= 1\r\n# a[j] = v\r\n#\r\n# for i in range(len(a),0,-1):\r\n# for j in range(1,i):\r\n# if a[j-1] > a[j]:\r\n# a[j], a[j-1] = a[j-1], a[j]\r\n#\r\n# t = len(a) // 2\r\n# while t > 0:\r\n# for i in range(len(a) - t):\r\n# j = i\r\n# while j >= 0 and a[j] > a[j+t]:\r\n# a[j], a[j+t] = a[j+t], a[j]\r\n# j -= 1\r\n# t //= 2\r\n#\r\n#\r\n# flag = True\r\n# a = [2,6,8,19,7]\r\n# if sum(a) % 2 != 0:\r\n# print(sum(a))\r\n# else:\r\n# while flag:\r\n# k = min((i for i in a if i % 2 != 0), default=0)\r\n# j = a.index(k)\r\n# a[0], a[j] = a[j], a[0]\r\n# for i in range(len(a)-1):\r\n# a[i] = a[i+1]\r\n# del a[-1]\r\n# if sum(a) % 2 != 0:\r\n# print(sum(a))\r\n# flag = False\r\n#\r\n#\r\n# n2,n31,n62,j,k = 0,0,0,0,0\r\n# a = [2,13,26,62]\r\n# for i in range(4):\r\n# if a[i] % 62 == 0:\r\n# n62 += 1\r\n# elif a[i] % 31 == 0:\r\n# n31 += 1\r\n# elif a[i] % 2 == 0:\r\n# n2 += 1\r\n# print(n62*(len(a)-n62) + n2*n31 + (n62*(n62-1))//2)\r\n#\r\n#\r\n#\r\n# 27 54 54 27\r\n# s = 6\r\n# n = 10\r\n# n1,n2,n3,n54,k,flag = 0,0,0,0,0,0\r\n# a = [2,3,27,1,4,7]\r\n# a.append(int(input()))\r\n# for i in range(s,n):\r\n# flag += 1\r\n# if a[0] % 54 == 0:\r\n# n54 += 1\r\n# if a[0] % 3 == 0:\r\n# n3 += 1\r\n# if a[0] % 2 == 0:\r\n# n2 += 1\r\n# n1 += 1\r\n# if a[6] % 54 == 0:\r\n# k += n1\r\n# elif a[6] % 3 == 0:\r\n# k += n2\r\n# elif a[6] % 2 == 0:\r\n# k += n3\r\n# else:\r\n# k += n54\r\n# for j in range(0,s):\r\n# a[j] = a[j+1]\r\n# if flag < n-s:\r\n# a[s] = int(input())\r\n# print(k)\r\n#\r\n# 27 54 54 27\r\n# s = 6\r\n# n = 10\r\n# n1,n2,n3,n54,k = 0,0,0,0,0\r\n# a = [2,3,27,1,4,7]\r\n# for i in range(s,n):\r\n# a.append(int(input()))\r\n# if a[0] % 54 == 0:\r\n# n54 += 1\r\n# if a[0] % 3 == 0:\r\n# n3 += 1\r\n# if a[0] % 2 == 0:\r\n# n2 += 1\r\n# n1 += 1\r\n# if a[i] % 54 == 0:\r\n# k += n1\r\n# elif a[i] % 3 == 0:\r\n# k += n2\r\n# elif a[i] % 2 == 0:\r\n# k += n3\r\n# else:\r\n# k += n54\r\n# for j in range(0,s):\r\n# a[j] = a[j+1]\r\n# a[s] = a[i]\r\n# print(k)\r\n#\r\n#\r\n# s = 6\r\n# n = 8\r\n# n1,n2,d = 0,0,0\r\n# a = [2,3,27,1,4,7]\r\n# for i in range(s,n):\r\n# k = 0\r\n# a.append(int(input()))\r\n# if a[0] % 2 == 0:\r\n# n2 = a[0]\r\n# else:\r\n# n1 = a[0]\r\n# if a[i] % 2 == 0 and n1 > 0:\r\n# k = n1 + a[i]\r\n# elif a[i] % 2 != 0 and n2 > 0:\r\n# k = n2 + a[i]\r\n# if k > d:\r\n# d = k\r\n# for j in range(0,s):\r\n# a[j] = a[j+1]\r\n# a[s] = a[i]\r\n# print(d)\r\n#\r\n# s = 6\r\n# # n = 8\r\n# # n0,n1,n2,k = 0,0,0,0\r\n# # a = [2,3,27,1,4,7]\r\n# # for i in range(s,n):\r\n# # a.append(int(input()))\r\n# # if a[0] % 3 == 0:\r\n# # n0 += 1\r\n# # if a[0] % 3 == 1:\r\n# # n1 += 1\r\n# # if a[0] % 3 == 2:\r\n# # n2 += 1\r\n# # if a[i] % 3 == 0:\r\n# # k += n0\r\n# # elif a[i] % 3 == 1:\r\n# # k += n2\r\n# # elif a[i] % 3 == 2:\r\n# # k += n1\r\n# # for j in range(0,s):\r\n# # a[j] = a[j+1]\r\n# # a[s] = a[i]\r\n# # print(k)\r\n#\r\n#\r\n# n = 23\r\n# n0,n1,n2,k,d = 0,0,0,0,0\r\n# a = [36,16,15,15,17,16,14,15,47,22,27,29,35,23,39,29,15,25,16,35,28,45,26]\r\n# #a = [1,2,3,4,5,6,7,8,9,10]\r\n# for i in range(1,n):\r\n# if a[0] % 3 == 0:\r\n# n0 = a[0]\r\n# if a[0] % 3 == 1:\r\n# n1 = a[0]\r\n# if a[0] % 3 == 2:\r\n# n2 = a[0]\r\n# if a[i] % 3 == 0 and i % 3 == 0 and n0 > 0:\r\n# k = n0 + a[i]\r\n# elif a[i] % 3 == 1 and i % 3 == 0 and n2 > 0:\r\n# k = n2 + a[i]\r\n# elif a[i] % 3 == 2 and i % 3 == 0 and n1 > 0:\r\n# k = n1 + a[i]\r\n# if k > d:\r\n# d = k\r\n# for j in range(0,n-1):\r\n# a[j] = a[j+1]\r\n# print(d)\r\n#\r\n#\r\n# n = 11\r\n# s = 6\r\n# n0, n1 = 0,0\r\n# k1,k2,d = 0,0,1000000\r\n# a = [int(input()) for _ in range(n-(n-s))]\r\n# for i in range(s,n):\r\n# a.append(int(input()))\r\n# if a[0] % 2 == 0:\r\n# n0 = a[0]\r\n# if a[0] % 2 != 0:\r\n# n1 = a[0]\r\n# if a[i] % 2 == 0:\r\n# k1 = n0 * a[i]\r\n# k2 = n1 * a[i]\r\n# elif a[i] % 2 != 0:\r\n# k1 = n0 * a[i]\r\n# if k1 < d and k2 != 0:\r\n# d = k1\r\n# if k2 < d and k2 != 0:\r\n# d = k2\r\n# for j in range(1,len(a)):\r\n# a[j-1] = a[j]\r\n# print(d)\r\n#\r\n# n = 11\r\n# s = 6\r\n# k = 1000000\r\n# a = [int(input()) for _ in range(n)]\r\n# while s != n:\r\n# for i in range(n-s):\r\n# if (a[i] * a[i+s]) % 2 == 0 and (a[i] * a[i+s]) < k:\r\n# k = a[i] * a[i+s]\r\n# s += 1\r\n# print(k)\r\n#\r\n# n = 5\r\n# k,d = 0,0\r\n# n7,n2 = 0,0\r\n# a = [int(input()) for _ in range(n)]\r\n# for i in range(1,len(a)):\r\n# if a[0] % 7 == 0:\r\n# n7 = a[0]\r\n# if a[0] % 2 == 0:\r\n# n2 = a[0]\r\n# if a[i] % 7 == 0:\r\n# k = n2 * a[i]\r\n# elif a[i] % 2 == 0:\r\n# k = n7 * a[i]\r\n# if k > d:\r\n# d = k\r\n# for j in range(len(a)):\r\n# a[j-1] = a[j]\r\n# print(d)\r\n#\r\n# s = 6\r\n# n = int(input())\r\n# a = [int(input()) for _ in range(n-(n-s))]\r\n# k = 0\r\n# d = 0\r\n# n0,n1 = 0,0\r\n# for i in range(s,n):\r\n# a.append(int(input()))\r\n# if a[0] % 2 == 0:\r\n# n0 = a[0]\r\n# if a[0] % 2 != 0:\r\n# n1 = a[0]\r\n# if a[i] % 2 == 0:\r\n# k = n1 + a[i]\r\n# elif a[i] % 2 != 0:\r\n# k = n0 + a[i]\r\n# if k > d:\r\n# d = k\r\n# for j in range(len(a)):\r\n# a[j-1] = a[j]\r\n# print(d)\r\n#\r\n# n10,n5,n2 = 0,0,0\r\n# a = [2,6,5,15]\r\n# n = 4\r\n# for i in range(n):\r\n# if a[i] % 10 == 0:\r\n# n10 += 1\r\n# elif a[i] % 5 == 0:\r\n# n5 += 1\r\n# elif a[i] % 2 == 0:\r\n# n2 += 1\r\n# print((n10*(n10-1))//2 + n2*n5 + n10*(len(a)-n10))\r\n#\r\n#\r\n# n0,n1,n2 = 0,0,0\r\n# n = 6\r\n# k = 0\r\n# d = 0\r\n# a = [100,8,33,145,19,84,153]\r\n# for i in range(1,n):\r\n# if a[0] % 3 == 0:\r\n# n0 = a[0]\r\n# if a[0] % 3 == 1:\r\n# n1 = a[0]\r\n# if a[0] % 3 == 2:\r\n# n2 = a[0]\r\n# if a[i] % 3 == 0:\r\n# k = a[i] + n0\r\n# elif a[i] % 3 == 1:\r\n# k = a[i] + n2\r\n# elif a[i] % 3 == 2:\r\n# k = a[i] + n1\r\n# if k > d:\r\n# d = k\r\n# for j in range(len(a)):\r\n# a[j-1] = a[j]\r\n# print(d)\r\n#\r\n# n0,n02,n56,n562,max = 0,0,0,0,0\r\n# n = 112\r\n# a = [0]*112\r\n# for i in range(n):\r\n# a[i] = 0\r\n# for j in range(1,n):\r\n# x = int(input())\r\n# a[x % 112] = x\r\n# if x % 112 == 0:\r\n# n02 = n0\r\n# n0 = x\r\n# if x % 56 == 0:\r\n# n562 = n56\r\n# n56 = x\r\n# for i in range(1,56):\r\n# if a[i] + a[112-i] > max:\r\n# max = a[i] + a[112-i]\r\n# if n0 + n02 > max:\r\n# max = n0 + n02\r\n# if n56 + n562 > max:\r\n# max = n56 + n562\r\n# print(max)\r\n#\r\n# n0,n02,n3,n32 = 0,0,0,0\r\n# max = 0\r\n# n = 6\r\n# a = []\r\n# for i in range(n):\r\n# a.append(0)\r\n# for j in range(1,n):\r\n# x = int(input())\r\n# a[x % 6] = x\r\n# if x % 6 == 0:\r\n# n02 = n0\r\n# n0 = x\r\n# if x % 3 == 0:\r\n# n32 = n3\r\n# n3 = x\r\n# for i in range(1,4):\r\n# if a[i] + a[6-i] > max:\r\n# max = a[i] + a[6-i]\r\n# if n0 + n02 > max:\r\n# max = n0 + n02\r\n# if n3 + n32 > max:\r\n# max = n3 + n32\r\n# print(max)\r\n#\r\n#\r\n#\r\n# a = [115,46,80,1,5]\r\n# a = []\r\n# n0,n02,n3,n32 = 0,0,0,0\r\n# max = 0\r\n# n = 6\r\n# a = []\r\n# for i in range(115):\r\n# a.append(0)\r\n# for j in range(1,n):\r\n# x = int(input())\r\n# a[x % 115] = x\r\n# if x % 5 == 0:\r\n# n02 = n0\r\n# n0 = x\r\n# if x % 23 == 0:\r\n# n32 = n3\r\n# n3 = x\r\n# for i in range(1,24):\r\n# if a[i] + a[115-i] > max:\r\n# max = a[i] + a[115-i]\r\n# if n0 + n02 > max:\r\n# max = n0 + n02\r\n# if n3 + n32 > max:\r\n# max = n3 + n32\r\n# print(max)\r\n#\r\n#\r\n# n = int(input())\r\n#\r\n#\r\n# def func(n):\r\n# if n <= 2:\r\n# return 0, n\r\n# elif n <= 5 and n > 2:\r\n# return 0, 2\r\n# else:\r\n# c = n // 5\r\n# while n >= 5:\r\n# n -= 5\r\n# return n, c*2\r\n#\r\n#\r\n# print(' '.join([str(i) for i in func(n)]))\r\n#\r\n#\r\n# def max(n):\r\n# c = 0\r\n# if n > 5:\r\n# j = (n // 5)+1\r\n# for _ in range(j):\r\n# if n > 5:\r\n# n -= 5\r\n# if n >= 2:\r\n# c += 2\r\n# n -= 2\r\n# else:\r\n# c += n\r\n# else:\r\n# if n < 2:\r\n# c += n\r\n# else:\r\n# c += 2\r\n# return c\r\n# # while n > 5:\r\n# # n -= 5\r\n# # c += 2\r\n# # n -= 2\r\n# # return c\r\n# elif n <= 5 and n > 2:\r\n# return 2\r\n# else:\r\n# return n\r\n#\r\n# def min(n):\r\n# c = 0\r\n# if n <= 2:\r\n# return 0\r\n# elif n <= 5 and n > 2:\r\n# return 0\r\n# else:\r\n# j = (n // 5) + 1\r\n# for _ in range(j - 1):\r\n# if n >= 5:\r\n# n -= 5\r\n# if n >= 2:\r\n# c += 2\r\n# n -= 2\r\n# else:\r\n# c += n\r\n# else:\r\n# break\r\n# return c\r\n#\r\n# print(min(n), max(n))\r\n#\r\n#\r\n\r\n# n = int(input())\r\n# a = [input() for _ in range(n)]\r\n# for i in range(n):\r\n# if len(a[i]) <= 10:\r\n# print(a[i])\r\n# else:\r\n# s = []\r\n# c = 0\r\n# s.append(a[i][0])\r\n# s.append(str(len(a[i])-2))\r\n# s.append(a[i][-1])\r\n# print(\"\".join(s))\r\n\r\n# n = int(input())\r\n# while(n > 0):\r\n# s = input()\r\n# if len(s) <= 10:\r\n# print(s)\r\n# else:\r\n# print(s[0]+str(len(s)-2)+s[-1])\r\n\r\n# n = int(input())\r\n# a = [input() for _ in range(n)]\r\n# c = 0\r\n# for i in a:\r\n# if i in (\"++X\",\"X++\"):\r\n# c += 1\r\n# else:\r\n# c -= 1\r\n# print(c)\r\n\r\n\r\n# print('+'.join(sorted(input().split('+'))))\r\n\r\n# n = int(input())\r\n# a = []\r\n# x,y = [int(i) for i in input().split()]\r\n# c = y\r\n# for i in range(n-1):\r\n# x,y = [int(i) for i in input().split()]\r\n# c = c - x + y\r\n# a.append(c)\r\n# print(max(a))\r\n\r\n# x,y = [int(i) for i in input().split()]\r\n# a = [i for i in input()]\r\n# b = 0\r\n# flag = True\r\n# for i in range(y):\r\n# for j in range(1,len(a)):\r\n# if flag:\r\n# if a[j-1] == \"B\" and a[j] == \"G\":\r\n# a[j-1], a[j] = a[j], a[j-1]\r\n# flag = False\r\n# else:\r\n# flag = True\r\n#\r\n# print(\"\".join(a))\r\n# a = [int(i) for i in input().split()]\r\n#\r\n# def binar_sort(a, find_value):\r\n# mid = len(a) // 2\r\n# low = 0\r\n# hight = len(a) - 1\r\n# lenght = hight - low\r\n# while lenght != 1:\r\n# if lenght % 2 != 0:\r\n# if a[mid] > find_value:\r\n# hight = mid\r\n# lenght = hight - low\r\n# mid = lenght // 2\r\n# elif a[mid] < find_value:\r\n# low = mid\r\n# lenght = hight - low\r\n# mid = lenght // 2\r\n# else:\r\n# hight = low + 1\r\n# lenght = hight - low\r\n# mid = lenght // 2\r\n# else:\r\n# if a[mid] > find_value:\r\n# hight = mid\r\n# lenght = hight - low\r\n# mid = lenght // 2\r\n# elif a[mid] < find_value:\r\n# low = mid\r\n# lenght = hight - low\r\n# mid = lenght // 2\r\n# else:\r\n# hight = low + 1\r\n# lenght = hight - low\r\n# mid = lenght // 2\r\n# print(a[hight])\r\n#\r\n# binar_sort(a, 10)\r\n\r\n# a = list(map(int, input().split()))\r\n# print(\"Hard\") if 1 in a else print(\"Easy\")\r\n\r\n# x = int(input())\r\n# j = 0\r\n# while x - 5 >= 0:\r\n# x -= 5\r\n# j += 1\r\n# print(j) if x == 0 else print(j+1)\r\n\r\n# n = int(input())\r\n# s = input()\r\n# if s.count('A') > s.count('D'):\r\n# print(\"Anton\")\r\n# elif s.count('A') == s.count('D'):\r\n# print(\"Friendship\")\r\n# else:\r\n# print(\"Danik\")\r\n\r\n# n, h = map(int, input().split())\r\n# j = n\r\n# a = list(map(int, input().split()))\r\n# for i in a:\r\n# if i > h: j += 1\r\n# print(j)\r\n\r\n# n = int(input())\r\n# j = 0\r\n# a = list(map(int, input().split()))\r\n# for i in a:\r\n# if i < max(a):\r\n# j += max(a) - i\r\n# print(j)\r\n\r\n# n = int(input())\r\n# a = [1 for _ in range(n)]\r\n# for _ in range(n-1):\r\n# for i in range(1, n):\r\n# a[i] += a[i-1]\r\n# print(a)\r\n\r\n# j = 0\r\n# n = int(input())\r\n# s = list(input())\r\n# for i in range(n-2):\r\n# while s[i] == s[i+1] == s[i+2] == 'x':\r\n# j += 1\r\n# s.pop(i)\r\n# s.append(' ')\r\n# print(j)\r\n\r\n# n = int(input())\r\n# a = [input() for _ in range(n)]\r\n# for i in range(n):\r\n# if len(a[i]) > 10:\r\n# a[i] = a[i][0] + str(len(a[i]) - 2) + a[i][-1]\r\n# print(*a, sep=\"\\n\")\r\n\r\n# n, k = map(int, input(). split())\r\n# a = list(map(int, input().split()))\r\n# i = 0\r\n# j = len(a) - 1\r\n# count = 0\r\n# while True:\r\n# if j != -1 and a[i] <= k:\r\n# a.pop(i)\r\n# count += 1\r\n# j -= 1\r\n# elif j != -1 and a[j] <= k:\r\n# a.pop(j)\r\n# count += 1\r\n# j -= 1\r\n# else:\r\n# break\r\n# print(count)\r\n\r\nn, m, z = map(int, input().split())\r\nn_arr = [i * n for i in range(1, z + 1) if (i * n) <= z]\r\nm_arr = [i * m for i in range(1, z + 1) if (i * m) <= z]\r\ncount = 0\r\nfor i in n_arr:\r\n if i in m_arr:\r\n count += 1\r\nprint(count)\r\n", "n, m, z = map(int, input().split())\r\nli = []\r\nli2 = []\r\ni = 1\r\nwhile n*i <= z:\r\n if n*i <= z:\r\n li.append(n*i)\r\n else:\r\n break\r\n i += 1\r\n\r\nj = 1\r\nwhile m*j <= z:\r\n if m*j <= z:\r\n li2.append(m*j)\r\n else:\r\n break\r\n j += 1\r\nprint(len(set(li) & set(li2)))", "n,m,z = map(int, input().split())\n\ncount=0\nloop=m\nwhile (loop<=z):\n\tif (loop%n==0):\n\t\tcount+=1\n\tloop+=m\nprint(count)", "l=list(map(int,input().split()))\r\n\r\na=l[0]\r\nc=l[1]\r\ntotal=l[2]\r\n\r\ntotal=[ i for i in range(1,total+1)]\r\nk=0;\r\nfor i in total:\r\n if i%a==0 and i%c==0:\r\n k+=1\r\nprint(k)", "n,m,z=map(int,input().split())\r\nl1=[]\r\nl2=[]\r\ni=1\r\nn1=n\r\nm1=m\r\nwhile n1<=z or m1<=z:\r\n l1.append(n*i)\r\n l2.append(m*i)\r\n i+=1\r\n n1=n*i\r\n m1=m*i\r\nc=0\r\nfor i in range(len(l1)):\r\n if l1[i] in l2:\r\n c+=1\r\nprint(c)" ]

[ "def divisors(x):\r\n\tdivisor=[]\r\n\tfor i in range(1,int(x**(1/2)+1)):\r\n\t\tif x%i==0:\r\n\t\t\tdivisor.append(i)\r\n\t\t\tif i!=x//i:\r\n\t\t\t\tdivisor.append(x//i)\r\n\treturn divisor\r\n\r\n\r\nn,k=[int(x) for x in input().split()]\r\nfactors=sorted(divisors(n))\r\nmaxfactor=0\r\n\r\nfor i in factors:\r\n\tif i*(k*(k+1)//2)<=n:\r\n\t\tmaxfactor=i\r\n\t\t\r\n\t\t\r\nif maxfactor:\r\n\ttobeprinted=[maxfactor*i for i in range(1,k+1)]\r\n\ttobeprinted[-1]+=n-sum(tobeprinted)\r\n\tprint(*tobeprinted)\r\nelse:\r\n\tprint(-1)", "n, k = map(int, input().rstrip().split())\n\ni = 1\nans = -1\n\nwhile i * i <= n:\n\n\tif n % i != 0:\n\t\ti += 1\n\t\tcontinue\n\n\tt = (k * k + k) * i // 2\n\n\tif(t > n):\n\t\ti += 1\n\t\tcontinue\n\n\tans = max(ans, i)\n\n\tj = n // i\n\tt = (k * k + k) * j // 2\n\n\tif(t > n):\n\t\ti += 1\n\t\tcontinue\n\n\tans = max(ans, j)\n\n\ti += 1\n\n\nif ans == -1:\n\tprint(ans)\n\nelse:\n\te = ans\n\tps = 0\n\n\tfor i in range(k - 1):\n\t\tprint(e, end = ' ')\n\t\tps += e\n\t\te += ans\n\n\tdelta = n - ps\n\tprint(delta)", "m, k = map(int, input().split())\r\nd = k * k + k >> 1\r\ns = m // d\r\nif s == 0:\r\n print(-1)\r\n exit()\r\nq, n = 2, m\r\np = [1]\r\nwhile q * q <= n:\r\n if n % q == 0:\r\n n //= q\r\n t = [i * q for i in p if i * q <= s]\r\n p += t\r\n while n % q == 0:\r\n n //= q\r\n t = [i * q for i in t if i * q <= s]\r\n p += t\r\n q += 1\r\nif n > 1: p += [i * n for i in p if i * n <= s]\r\ns = max(p)\r\nprint(' '.join(map(str, range(s, s * k, s))), m - (d - k) * s)", "from collections import *\r\nfrom bisect import *\r\nimport sys\r\n\r\n\r\ndef input():\r\n return sys.stdin.readline().rstrip('\\r\\n')\r\n\r\n\r\nn, k = map(int, input().split())\r\nreq = k*(k+1)//2\r\n\r\nmx = float(\"inf\")\r\nfor i in range(1, int(n**0.5)+1):\r\n if n % i == 0:\r\n if i >= req:\r\n mx = min(mx, i)\r\n if n//i >= req:\r\n mx = min(mx, n//i)\r\n\r\nif mx == float(\"inf\"):\r\n print(-1)\r\nelse:\r\n gcd = n//mx\r\n cnt = 0\r\n for i in range(1, k):\r\n print(i*gcd, end=\" \")\r\n cnt += i\r\n print((mx-cnt)*gcd)\r\n", "import sys\r\n#import random\r\nfrom bisect import bisect_left as lb\r\nfrom collections import deque\r\n#sys.setrecursionlimit(10**8)\r\nfrom queue import PriorityQueue as pq\r\nfrom math import *\r\ninput_ = lambda: sys.stdin.readline().strip(\"\\r\\n\")\r\nii = lambda : int(input_())\r\nil = lambda : list(map(int, input_().split()))\r\nilf = lambda : list(map(float, input_().split()))\r\nip = lambda : input_()\r\nfi = lambda : float(input_())\r\nap = lambda ab,bc,cd : ab[bc].append(cd)\r\nli = lambda : list(input_())\r\npr = lambda x : print(x)\r\nprinT = lambda x : print(x)\r\nf = lambda : sys.stdout.flush()\r\ninv =lambda x:pow(x,mod-2,mod)\r\nmod = 10**9 + 7\r\n\r\nn,k = il()\r\n\r\ns = k*(k+1)//2\r\n\r\nif (s > n) :\r\n print(-1)\r\n exit(0)\r\n\r\nif (s == n) :\r\n for i in range (1,k+1) :\r\n print(i,end=\" \")\r\n print()\r\n exit(0)\r\n\r\np = 1\r\na = []\r\n\r\nwhile (p*p <= n) :\r\n if (n%p) == 0 :\r\n a.append(p)\r\n if (p*p) != n :\r\n a.append(n//p)\r\n\r\n p += 1\r\n\r\na.sort()\r\n\r\nans = 0\r\n\r\nfor d in a :\r\n if (n//d) >= s :\r\n ans = d\r\n else :\r\n break\r\n\r\nif (ans) :\r\n for i in range(1,k) :\r\n print(i*ans,end=\" \")\r\n n -= i*ans\r\n\r\n print(n)\r\nelse :\r\n print(-1)\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\ndef divisor(i):\r\n s = set()\r\n for j in range(1, int(i ** (1 / 2)) + 1):\r\n if i % j == 0:\r\n s.add(i // j)\r\n s.add(j)\r\n s = list(s)\r\n s.sort(reverse = True)\r\n return s\r\n\r\nn, k = map(int, input().split())\r\nif k == 1:\r\n ans = [n]\r\nelif k > pow(10, 6):\r\n ans = [-1]\r\nelse:\r\n s = divisor(n)\r\n l = k * (k + 1) // 2\r\n ans = [-1]\r\n for i in s:\r\n if i * l <= n:\r\n ans = [i * j for j in range(1, k + 1)]\r\n s0 = sum(ans)\r\n ans[-1] += n - s0\r\n break\r\nprint(*ans)", "from sys import *\n\nn,k=input().split()\n\nn=int(n);k=int(k)\n\nkk=(1+k)*k//2\n\nif n<kk:\n\n\tprint(-1)\n\n\texit(0)\n\ndef ans(g):\n\n\tif n<g*kk:return\n\n\tr=n-kk*g\n\n\tfor _ in range(1,k):print(_*g,end=' ')\n\n\tprint(k*g+r)\n\n\texit(0)\n\nfor d in range(1,200000):\n\n\tif n%d==0:\n\n\t\tans(n//d)\n\nfor d in range(200000,0,-1):\n\n\tif n%d==0:ans(d)\n\n\n\n\n\n# Made By Mostafa_Khaled", "n,k = map(int, input().split(' '))\nbest = -1\ns = (k+1) * k // 2\n\nfor d in range(1, int(n**0.5) +1):\n if d * s > n:\n break\n if n % d == 0:\n best = d\n if n//d * s <= n:\n best = n//d\n break\n\nif best == -1:\n print(-1)\nelse:\n for i in range(1,k):\n print(best*i, end = ' ')\n print(best*k + n - best*s)\n", "from math import sqrt\nn, k = map(int, input().split())\ndef f(s):\n for v in range(1, 1 + int(sqrt(n))):\n if n % v == 0:\n yield v\n yield n // v\ns = k * (k + 1) // 2\nv = set(x for x in f(s) if x <= n // s)\nif v:\n gcd = max(v)\n print(*range(gcd, gcd * k, gcd), n - gcd * (k - 1) * k // 2)\nelse:\n print(-1)\n", "import sys\r\nimport math\r\nn, k = map(int, input().split())\r\nx =(k * (k + 1)) // 2\r\ncur = 1\r\ns = math.sqrt(n)\r\ndiv = 0\r\nwhile( cur <= s):\r\n if( n % cur == 0):\r\n if(n // cur >= x):\r\n div = max(div, cur)\r\n if(cur >= x):\r\n div = max(div, n // cur)\r\n cur += 1\r\nif(div == 0):\r\n print(-1)\r\n sys.exit()\r\nrest = n // div\r\nfor i in range(1,k + 1):\r\n if( i == k):\r\n print( div * rest, end = ' ')\r\n else:\r\n print(div * i, end = ' ')\r\n rest -= i", "import sys\r\n\r\ninf = 1 << 30\r\n\r\ndef solve():\r\n n, k = map(int, input().split())\r\n\r\n # list divisors of n\r\n a = []\r\n b = []\r\n\r\n for d in range(1, n + 1):\r\n if d*d > n:\r\n break\r\n if n % d != 0:\r\n continue\r\n\r\n a.append(d)\r\n b.append(n // d)\r\n\r\n b.reverse()\r\n\r\n if a[-1] == b[0]:\r\n divs = a + b[1:]\r\n else:\r\n divs = a + b\r\n\r\n # main process\r\n\r\n d_m = -1\r\n need = k * (k + 1) // 2\r\n\r\n for d in divs:\r\n q = n // d\r\n\r\n if q >= need:\r\n d_m = d\r\n else:\r\n break\r\n\r\n if d_m == -1:\r\n print(-1)\r\n else:\r\n ans = [0]*k\r\n\r\n for i in range(k - 1):\r\n ans[i] = (i + 1) * d_m\r\n\r\n ans[-1] = n - d_m * k * (k - 1) // 2\r\n\r\n print(*ans)\r\n\r\nif __name__ == '__main__':\r\n solve()", "import math as M\r\nn,k=map(int,input().split())\r\nif k>=2e5:\r\n\tprint(\"-1\")\r\nelse :\r\n\tt=k*(k+1)//2\r\n\td=[]\r\n\tj=1\r\n\twhile j * j <= n:\r\n\t\tif n % j == 0 :\r\n\t\t\tif j * t <= n:\r\n\t\t\t\td.append(j)\r\n\t\t\tif n // j != j and n//j * t <=n:\r\n\t\t\t\td.append(n//j)\r\n\t\tj += 1\r\n\tif len(d) == 0:\r\n\t\tprint(\"-1\")\r\n\telse:\r\n\t\tgcd, sum = max(d), 0\r\n\t\tfor j in range(1, k):\r\n\t\t\tsum += j * gcd\r\n\t\t\tprint(j * gcd, end=' ')\r\n\t\tprint(n - sum)", "import math\nN, K = [int(x) for x in input().split()]#\nE=(K*(K+1))//2;\nif E>N:\n\tprint(-1)\nelse:\n\ts=0\n\tmx=0\n\tfor x in range(1,int(math.sqrt(N))+2):\n\t\tif N%x==0:\n\t\t\ta=x\n\t\t\tb=N//x\n\t\t\tif b>=E:\n\t\t\t\tif a>mx:\n\t\t\t\t\tmx=a\n\t\t\t\t\ts=b\n\t\t\tif a>=E:\n\t\t\t\tif b>mx:\n\t\t\t\t\tmx=b\n\t\t\t\t\ts=a\n\t\n\tfor i in range(1,K):\n\t\tprint(i*mx,end=\" \")\n\t\n\tprint(int(mx*(s-E+K)))\n\n", "from collections import deque\nfrom math import sqrt\n\nn,k = map(int, input().split())\n\n\nsum_k = k*(k+1)/2\n\nif(sum_k>n):\n print(-1)\nelse:\n pos = deque()\n for x in range(int(sqrt(n)), 0, -1):\n if(n%x==0):\n pos.appendleft(x)\n if(x*x!= n):\n pos.append(int(n/x))\n it = -1\n count = len(pos)\n first = 0\n while(count>0):\n it = first\n step = count//2\n it+=step\n if(pos[it]<sum_k):\n it += 1\n first = it\n count -= step+1\n else:\n count = step\n \n curr = n/pos[first]\n for x in range(1,k):\n print(\"%d \"%(curr*x), end = '')\n rem = n - k*(k-1)/2*curr\n print(\"%d\"%rem)\n\n", "from math import sqrt\r\ndef factors(n,k):\r\n i=2;p=(k*(k-1))//2;s=0\r\n while i<=sqrt(n):\r\n if n%i==0:\r\n if n//i-p>k-1:s=max(s,i)\r\n if i-p>k-1:s=max(s,n//i)\r\n i+=1\r\n return 1 if s==0 else s\r\ndef solve(n,k):\r\n p=(2*n)/(k*(k+1));m=factors(n,k)\r\n if p<1 or k>=n:return [-1]\r\n if p%1==0:return [x*int(p) for x in range(1,k+1)]\r\n return [x*m for x in range(1,k)]+[n-(m*k*(k-1))//2]\r\nn,k=map(int,input().split())\r\nprint(n) if k==1 else print(*solve(n,k))", "#!/usr/bin/env python\n# -*- coding: utf-8 -*-\nimport sys\nimport math\n\n\ndef main():\n n, k = map(int, input().split())\n base = int(k * (k + 1) / 2)\n if n < base:\n print('-1')\n return\n closest = None\n for i in range(base, int(math.sqrt(n))):\n if n % i == 0:\n closest = i\n break\n if closest is None:\n for i in range(int(math.sqrt(n) + 1), 0, -1):\n if n % i == 0 and base <= n / i:\n closest = n / i\n break\n multiplier = int(n / closest)\n for i in range(1, k):\n print(i * multiplier, end=' ')\n print(int((k + closest - base) * multiplier))\n\n\nif __name__ == '__main__':\n main()\n", "import sys\r\n\r\ninf = 1 << 30\r\n\r\ndef solve():\r\n n, k = map(int, input().split())\r\n\r\n lim = k * (k + 1) // 2\r\n\r\n if n < lim:\r\n print(-1)\r\n return\r\n\r\n d_max = 1\r\n\r\n for d in range(1, n + 1):\r\n if d*d > n:\r\n break\r\n if n % d != 0:\r\n continue\r\n\r\n q = n // d\r\n\r\n if d >= lim:\r\n d_max = q\r\n break\r\n elif q >= lim:\r\n d_max = d\r\n else:\r\n break\r\n\r\n ans = []\r\n j = 1\r\n\r\n for i in range(k - 1):\r\n ans.append(d_max * j)\r\n j += 1\r\n\r\n ans.append(n - sum(ans))\r\n\r\n print(*ans)\r\n\r\nif __name__ == '__main__':\r\n solve()", "def check(x):\r\n if x >= (k * (k + 1)) // 2:\r\n return True\r\n return False\r\n\r\nn, k = map(int, input().split())\r\ni = 1; g = 0\r\nwhile i*i <= n:\r\n if n % i == 0:\r\n if i == n // i:\r\n if check(n//i):\r\n g = max(g, i)\r\n else:\r\n if check(n//i):\r\n g = max(g, i)\r\n if check(i):\r\n g = max(g, n // i)\r\n i += 1\r\n\r\nif g == 0:\r\n print(-1)\r\nelse:\r\n print(*map(lambda x : x * g, range(1, k)), ((n//g) - ((k*(k-1)) // 2)) * g) ", "[n,k]=[int(x) for x in input().split()]\r\nm=k*(k+1)/2\r\nlimit=n//m\r\nlul=\"-1\"\r\ndef nice(x):\r\n global lul\r\n lul=\"\"\r\n sum=0\r\n a=[0]*k\r\n for i in range(1,k):\r\n a[i-1]=str(i*x)\r\n sum+=i*x\r\n a[k-1]=str(n-sum)\r\n print(\" \".join(a))\r\n\r\npep=-1\r\n\r\nfor i in range(1,1000000):\r\n if i*i>n:\r\n break\r\n if i>limit:\r\n break\r\n if n%i>0:\r\n continue\r\n if n//i<=limit:\r\n nice(n//i)\r\n break\r\n pep=i\r\n\r\nif lul==\"-1\" and pep!=-1:\r\n nice(pep)\r\n \r\nprint(lul)", "n,k=map(int,input().split(' '))\nif n<k*(k+1)//2:\n print(-1)\n exit(0)\ni,tot=1,k*(k+1)//2\nfuck=0\nwhile i*i<=n:\n if n%i==0:\n if i>=tot:\n fuck=n//i\n break\n elif n//i>=tot:\n fuck=i\n i+=1\nif fuck==0:\n print(-1)\n exit(0)\nsum=0\nfor i in range(1,k):\n print(i*fuck,end=\" \")\n sum+=i*fuck\nprint(n-sum)\n \t \t\t \t \t\t \t \t \t\t \t \t", "n, k = (list)(map(int, input().split(' ')))\n\nbase = k * (k + 1) // 2\nif base > n:\n print(-1)\nelse:\n mul = n // base\n pick = 0\n for i in range(1, min(10001, mul), 1):\n if n % i == 0:\n pick = max(pick, i)\n div = n // i\n if div <= mul:\n pick = max(pick, div)\n for i in range(max(1, mul - 10001), mul + 1, 1):\n if n % i == 0:\n pick = max(pick, i)\n div = n // i\n if div <= mul:\n pick = max(pick, div)\n mul = pick\n sum = 0\n for i in range(1, k, 1) :\n print(i * mul, end = ' ')\n sum = sum + i * mul\n print(n - sum, end = ' ')\n\n\t \t\t\t\t\t \t \t \t\t \t \t", "import bisect\r\nn, k = map(int, input().split())\r\nx = k * (k + 1) // 2\r\nif x > n:\r\n print(-1)\r\nelse:\r\n l = []\r\n r = []\r\n d = 1\r\n while d * d < n:\r\n if n % d == 0:\r\n l.append(d)\r\n r.append(n // d)\r\n d += 1\r\n if d * d == n:\r\n l.append(d)\r\n r.reverse()\r\n l.extend(r)\r\n i = bisect.bisect_left(l, x)\r\n b = n // l[i]\r\n a = [str(b * i) for i in range(1, k)]\r\n a.append(str(b * (l[i] - x + k)))\r\n print(' '.join(a))", "n, k = map(int, input().split())\r\nminSum = (k*(k+1))//2\r\nif n < minSum:\r\n print(-1)\r\n exit()\r\nelif k == 1:\r\n print(n)\r\n exit()\r\n \r\nfactors = [1]\r\ni = 2\r\nwhile i*i < n:\r\n if n % i == 0:\r\n factors.append(i)\r\n factors.append(n//i)\r\n i += 1\r\nif i*i == n:\r\n factors.append(i)\r\nfactors.sort()\r\nfactors.reverse()\r\n\r\nfor gcd in factors:\r\n if n//gcd >= minSum:\r\n break\r\n \r\nn = n//gcd\r\nans = [i for i in range(1,k+1)]\r\nans[-1] += n-minSum\r\nfor i in range(k):\r\n ans[i] *= gcd\r\nprint(*ans)", "def chk(d):\r\n s=d*(k-1)*k//2\r\n if n-s>(k-1)*d:\r\n if (n-s)%d==0: return True\r\n return False\r\nn,k=map(int,input().split())\r\nnod=-1\r\nd=1\r\nwhile d*d<=n:\r\n if chk(d): nod= max(nod,d)\r\n if chk(n//d): nod= max(nod,n//d)\r\n d+=1\r\nans=\"\"\r\nif nod>-1:\r\n for i in range(1,k):\r\n ans+=str(nod*i)+' '\r\n print(ans+str(n-nod*(k-1)*k//2))\r\nelse:\r\n print(-1)\r\n", "def main():\n n, k = map(int, input().split())\n tot = k * (k + 1) // 2\n if tot > n:\n print(-1)\n return\n\n best = 1\n for d in range(2, n):\n if d * d > n:\n break\n if n % d == 0:\n if tot * d <= n:\n best = max(best, d)\n nd = n // d\n if tot * nd <= n:\n best = max(best, nd)\n res = [i * best for i in range(1, k + 1)]\n assert sum(res) == tot * best\n res[-1] = n - sum(res[:-1])\n print(' '.join(str(x) for x in res))\n\nmain()\n", "\r\nn,m = map(int,input().split())\r\nif n < m*(m+1)/2:\r\n print(-1)\r\nelse:\r\n i = 2\r\n max_ans= 1\r\n while i*i <= n:\r\n if n % i == 0:\r\n if (m*(m+1)/2)*i <= n:\r\n max_ans = max(max_ans,i)\r\n y = n/i\r\n if (m*(m+1)/2)*y <= n:\r\n max_ans = max(max_ans,y)\r\n i += 1\r\n max_ans = int(max_ans)\r\n ans = [max_ans]\r\n for i in range(m-1):\r\n ans.append(ans[-1]+max_ans)\r\n ans[-1] += n - sum(ans)\r\n print(*ans)", "import math\r\nn,k=map(int,input().split())\r\nu=k*(k+1)//2\r\nif n<u:\r\n print(-1)\r\nelse:\r\n d=[]\r\n for i in range(1,int(math.sqrt(n))+1):\r\n if n%i==0:\r\n d.append(i)\r\n if n//i!=i:\r\n d.append(n//i)\r\n d=sorted(d,reverse=True)\r\n res=[]\r\n for p in d:\r\n if n//p<u:\r\n continue\r\n else:\r\n s=0\r\n for i in range(1,k+1):\r\n res.append(i*p)\r\n s+=i*p\r\n res[-1]+=n-s\r\n break\r\n if len(res)==0:\r\n print(-1)\r\n else:\r\n print(*res)\r\n \r\n ", "n,k=map(int, input().split(\" \"))\r\nl=[]\r\ni=1\r\nwhile i*i<=n:\r\n if n%i==0:\r\n l.append(i)\r\n l.append(n // i)\r\n i=i+1\r\nl.sort()\r\nc=0\r\nfor i in range(len(l)-1,-1,-1):\r\n m=(1+k)/2*k\r\n if m<=n//l[i]:\r\n for j in range(1,k):\r\n print(j*l[i],end=\" \")\r\n print(int((n//l[i])-m+k)*l[i])\r\n c=1\r\n break\r\nif c==0:\r\n print (-1)", "n,k=map(int,input().split())\nkk=k\nk=(k*(k+1))//2\nan=-1\nif k<=n:\n\tfor i in range(1,int((n**.5)+2)):\n\t\tif(n%i==0):\n\t\t\tif k<=n//i:\n\t\t\t\tan=max(an,i)\n\t\t\tif k<=i:\n\t\t\t\tan=max(an,n//i)\nif an!=-1:\n\ta=an\n\tx=[]\n\tfor _ in range(kk-1):\n\t\tx.append(a)\n\t\tn-=a\n\t\ta+=an\n\tx.append(n)\n\tprint(*x)\nelse:\n\tprint(an)\n \t\t \t \t \t \t\t \t\t \t \t\t\t\t\t\t \t", "def ma():\r\n s=input()\r\n nums=s.split(' ')\r\n n=int(nums[0])\r\n k=int(nums[1])\r\n base=k*(k+1)//2\r\n if n<base:\r\n print(-1)\r\n return \r\n m=n//base\r\n if m*m<=n:\r\n while n%m!=0:\r\n m-=1\r\n else:\r\n p=(n-1)//m+1\r\n while p*p<=n and n%p!=0:\r\n p+=1\r\n if n%p==0:\r\n m=n//p\r\n else:\r\n q=(n-1)//m\r\n while n%q!=0:\r\n q-=1\r\n m=q\r\n \r\n for i in range(k-1):\r\n print(str((i+1)*m),end='')\r\n print(' ',end='')\r\n print(n-k*(k-1)//2*m)\r\nma()", "n, k = map(int, input().split())\r\nmsum = k * (k + 1) // 2\r\narr = []\r\ni = 1\r\nwhile i * i <= n:\r\n if n % i == 0:\r\n arr.append(i)\r\n arr.append(n // i)\r\n i += 1\r\n\r\narr.sort()\r\n\r\nl = -1; r = len(arr)\r\n\r\nwhile r - l > 1:\r\n m = (l + r) // 2\r\n if arr[m] * msum > n: r = m\r\n else: l = m\r\n\r\nif l == -1: print(-1)\r\nelse:\r\n for i in range(1, k): print(arr[l] * i, end = ' ')\r\n print(n - (k - 1) * k // 2 * arr[l])\r\n", "import sys\nn,k = map(int,input().split(' '))\nif(k*(k+1)//2 >n):\n print(-1)\n sys.exit()\n\ng=1\nans=1\nwhile(g*g<=n):\n if(n%g==0):\n s = (k-1)*k*g//2\n if((n-s)>(k-1)*g and (n-s)%g==0):\n ans=max(ans, g)\n\n s = (k-1)*k*(n//g)//2\n if((n-s)>(k-1)*(n//g) and (n-s)%(n//g)==0):\n ans=max(ans, (n//g))\n\n g+=1\n\ns=0\nfor i in range(1,k):\n print(i*ans,end=' ')\n s+=i*ans\nprint(n-s)\n", "import os\nimport sys\nimport math\n\nn, k = map(int, input().split())\nif k == 1:\n print(n)\nelse:\n j = int(math.sqrt(n))\n d = int(n / int(k * (k+1) / 2))\n if d == 0:\n print(-1)\n else:\n r = 1\n for x in range(1, j+1):\n if (n % x) != 0:\n continue\n if (x <= d) and (x > r):\n r = int(x)\n if (int(n / x) <= d) and (int(n / x) > r):\n r = int(n / x)\n for x in range(1, k):\n print(int(r*x), end=\" \")\n n -= int(r * k * (k-1) / 2)\n print(n)\n\n \t\t \t\t \t\t \t \t\t \t \t\t\t", "from sys import exit\r\nn,k=[int(e) for e in input().split()]\r\nif k*(k+1)//2>n:\r\n print(-1)\r\nelse:\r\n s=set()\r\n i=1\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=sorted(s)\r\n while 1:\r\n i=s[-1]\r\n d=n//i\r\n if d>=k*(k+1)//2:\r\n a=[i*(j+1) for j in range(k-1)]\r\n a.append(n-sum(a))\r\n print(*a)\r\n exit()\r\n s.pop()", "'''\nHey why peeping here -_'_- ?\nI believe on myself and I will achieve\nthis->author = Fuad Ashraful Mehmet, CSE ,University of Asia Pacific\nTodo:\n'''\nimport sys,math\ninput=sys.stdin.readline\n\n\ndef getSum(k):\n return k*(k-1)//2\n\ndef HalfDead():\n \n n,k=map(int,input().split())\n ans=-1\n for i in range(1,int(math.sqrt(n))+1):\n\n if not n%i:\n x=i\n y=n//i\n\n sum=x*getSum(k)\n rem=n-sum\n\n if rem>x*(k-1):\n if x>ans:\n ans=x\n \n\n sum=y*getSum(k)\n rem=n-sum\n\n if rem>y*(k-1):\n if y>ans:\n ans=y\n \n\n if ans==-1:\n print(ans)\n else:\n ar=[]\n\n for i in range(1,k):\n ar.append(ans*i)\n \n\n ar.append(n-ans*getSum(k))\n\n\n print(*ar)\n\n \n \nif __name__=='__main__':\n HalfDead()", "str_params = input()\r\n[n, k]= [int(s) for s in str_params.split(' ')]\r\nparts = (1+k)/2*k\r\nif parts<=n:\r\n\tnod = n/parts\r\n\twhile (nod%1!=0)|(parts%1!=0):\r\n\t\tif nod<parts:\r\n\t\t\tif nod%1!=0:\r\n\t\t\t\tnod = int(nod)\r\n\t\t\telse:\r\n\t\t\t\tnod = nod-1\r\n\t\t\tparts = n/nod\r\n\t\telse:\r\n\t\t\tif parts%1!=0:\r\n\t\t\t\tparts = int(parts)+1\r\n\t\t\telse:\r\n\t\t\t\tparts = parts+1\r\n\t\t\tnod = n/parts\r\n\tnumbers = [nod*(x+1) for x in range(k)]\r\n\tnumbers[k-1] = n-(1+k-1)/2*(k-1)*nod\r\n\t\r\n\tif numbers[0]==0:\r\n\t\tprint (-1)\r\n\telse:\r\n\t\tprint (' '.join(map(str,map(int, numbers))))\r\nelse:\r\n\tprint (-1)\r\n\t\r\n\"\"\"while (sum(numbers)<n):\r\n\t\r\n\r\n\t33/5 = 6.6\r\n\t33/11 = 3\r\n\t\r\n\t33/6 = 5.5\r\n\t\r\n\t24/10 = 2.4\r\n\t\r\n\t\r\n\t\r\ni = 1\r\nwhile (sum(numbers)<n) & (i<k):\r\n\twhile sum(numbers)<n:\r\n\t\tnumbers = [numbers[x]*i for x in range(k)]\r\n\t\tprint (i, numbers)\r\n\t\ti = i+1\r\nprint (numbers)\r\nif sum(numbers)>n:\r\n\tprint (-1)\r\nif sum(numbers)==n:\r\n\tprint (' '.join(map(str,numbers)))\"\"\"\r\n\t\r\n", "n, k = list(map(int, input().split()))\ndiv = []\nfor i in range(1, int(n ** 0.5) + 1):\n if n % i == 0:\n div.append(i)\n div.append(n // i)\ndiv.sort(reverse=True)\nfor num in div:\n if k * (k + 1) / 2 * num <= n:\n for j in range(1, k):\n print(num * j)\n n -= num * j\n print(n)\n exit(0)\nprint(-1)", "n, k = list(map(int, input().split()))\r\nfact = []\r\ni = 1\r\nwhile i * i <= n:\r\n if n % i == 0:\r\n fact.append(i)\r\n if i * i != n:\r\n fact.append(n // i)\r\n i += 1\r\n\r\nsm = (k * (k + 1)) // 2\r\nfact = sorted(fact, reverse=True)\r\nfor f in fact:\r\n left = n // f\r\n if left >= sm:\r\n for i in range(1, k):\r\n print(i * f, end=\" \")\r\n left -= i\r\n print(left * f)\r\n exit(0)\r\n\r\nprint(-1)\r\n", "n, k = map(int, input().split())\r\nm = k * (1 + k) // 2\r\n\r\nfac = []\r\nfor f in range(1, int(n ** 0.5) + 1):\r\n if n % f == 0:\r\n fac.append(f)\r\n if f * f != n:\r\n fac.append(n // f)\r\nfac.sort()\r\n\r\nif n >= m:\r\n for c in fac[::-1]: \r\n if n // c >= m:\r\n ans = [i * c for i in range(1, k + 1)]\r\n ans[-1] = n - sum(ans[:-1])\r\n print(*ans)\r\n break\r\nelse:\r\n print(-1)", "n, k = map(int, input().split())\r\nd = []\r\ni = 1\r\nwhile i * i <= n:\r\n if n % i == 0:\r\n d.append(i)\r\n d.append(n // i)\r\n i += 1\r\nd.sort()\r\nfor i in range(len(d) - 1, -1, -1):\r\n ari = (1 + k) / 2 * k\r\n if ari <= n // d[i]:\r\n for j in range(1, k):\r\n print(j * d[i], end = \" \")\r\n print(int((n // d[i]) - ari + k) * d[i])\r\n exit()\r\nprint(-1)\r\n \r\n ", "def factor(n):\n rtn = []\n p = 2\n tmp = n\n while p * p <= tmp:\n q = 0\n while tmp % p == 0:\n tmp //= p\n q += 1\n if 0 < q:\n rtn.append((p, q))\n p += 1\n if 1 < tmp:\n rtn.append((tmp, 1))\n return rtn\n\ndef divs(n):\n rtn = [1]\n arr = factor(n)\n for p, q in arr:\n ds = [p**i for i in range(1, q + 1)]\n tmp = rtn[:]\n for d in ds:\n for t in tmp:\n rtn.append(d * t)\n return list(sorted(rtn))\n\nn, k = map(int, input().split())\nds = divs(n)\nl = 0\nr = len(ds) - 1\nwhile l + 1 < r:\n c = (l + r) // 2\n if ds[c] * k * (k + 1) // 2 <= n:\n l = c\n else:\n r = c\n\nif l == 0 and n < k * (k + 1) // 2:\n print(-1)\nelse:\n d = ds[l]\n ans = [d * (i + 1) for i in range(k)]\n ans[-1] += n - sum(ans)\n print(' '.join(map(str, ans)))\n\n", "N, K = map( int, input().split() )\r\nif K * ( K + 1 ) // 2 > N:\r\n exit( print( -1 ) )\r\nans = 1\r\nfor i in range( 1, int( N ** 0.5 ) + 1 ):\r\n if N % i: continue\r\n if ans < i:\r\n if K * ( K + 1 ) // 2 <= N // i:\r\n ans = i\r\n if ans < N // i:\r\n if K * ( K + 1 ) // 2 <= i:\r\n ans = N // i\r\nt = N // ans\r\nfor i in range( 1, K + 1 ):\r\n print( i * ans if i < K else N - ( K - 1 ) * K // 2 * ans, end = \" \\n\"[ i == K ] )\r\n", "def divisors_list(n):\r\n divisors = []\r\n divisors2 = []\r\n d = 2\r\n while d*d <= n and n >1:\r\n if n%d == 0:\r\n divisors.append(d)\r\n d += 1\r\n if n>1:\r\n divisors.append(n)\r\n for div in divisors:\r\n divisors2.append(n//div)\r\n merge = divisors + divisors2\r\n return merge\r\nn,k = map(int,input().split())\r\nif k == 1:\r\n print(n)\r\n exit()\r\narr = sorted(divisors_list(n))\r\narr.reverse()\r\n\r\nfor x in arr: # check if sum is possible\r\n rik = n // x\r\n if rik >= k * (k + 1) // 2:\r\n cnt = 0\r\n ans = []\r\n for y in range(1, k + 1):\r\n cnt += y\r\n ans.append(y)\r\n ans[-1] = ans[-1] + rik - cnt\r\n print(*[hah * x for hah in ans])\r\n exit()\r\n else:\r\n pass\r\nprint(-1)", "import math\n\nn, k = map(int, input().split())\n\ndef solve(i):\n a = i * k * (k + 1) // 2\n if(n >= a):\n return (n - a)\n else:\n return -1\n\ni = 1\n\nr = -1\n\nwhile(i * i <= n):\n if(n % i == 0):\n if(solve(i) > -1):\n r = max(r, i); \n if(i * i != n):\n if(solve(n / i) > -1):\n r = max(r, n / i);\n i = i + 1;\nif(r == -1):\n print(r)\nelse:\n b = []\n for i in range(1, k):\n b.append(i * r)\n b.append(k * r + solve(r))\n for i in b:\n print(int(i), end=' ')\n print()\n\t\t\t\t\t\t\t\t \t \t\t \t \t \t", "n, k = map(int, input().split())\ng = n * 2 // ((k + 1) * k)\nif not g:\n print(-1)\n exit(0)\nee = [2 ** i for i in range(31) if not n % 2 ** i]\nx = n // ee[-1]\noo = [(o, x // o) for o in range(1, int(x ** .5) + 1, 2) if not x % o]\ng = max(o * e for t in oo for o in t for e in ee if o * e <= g)\nprint(' '.join(map(str, range(g, g * k, g))), n - g * (k - 1) * k // 2)", "n,k=map(int,input().split())\r\nm=(1+k)*k//2\r\nif n<m:\r\n\tprint(-1)\r\n\texit(0)\r\ndef ans(g):\r\n\tif n<g*m:return\r\n\tr=n-m*g\r\n\tfor _ in range(1,k):print(_*g,end=' ')\r\n\tprint(k*g+r)\r\n\texit(0)\r\nfor d in range(1,200000):\r\n\tif n%d==0:\r\n\t\tans(n//d)\r\nfor d in range(200000,0,-1):\r\n\tif n%d==0:ans(d)", "\nimport sys\n\nline = sys.stdin.readline()\nline.strip()\ncomp = line.split(' ')\nn = int(comp[0])\nk = int(comp[1])\n\nif(k*(k+1)//2 > n):\n print(\"-1\")\n exit(0)\n\ndivs = []\n\nd = 1\nwhile(d*d <= n):\n if n%d == 0:\n divs.append(d)\n divs.append(n//d)\n d+=1\n\nmaxDiv = 0\n\nfor dv in divs:\n if (k+1)*k//2 <= dv:\n maxDiv = max(maxDiv,n//dv)\n if (k+1)*k//2 <= n//dv:\n maxDiv = max(maxDiv,dv)\n\n\narr = [maxDiv*x for x in range(1,k)] + [n-k*(k-1)//2*maxDiv]\nprint(\" \".join(map(str,arr)))\n\n\n\n\n\n\n\n", "n, k = map(int, input().split())\r\nd = k*(k+1)//2\r\nif n < d:\r\n print(-1)\r\nelse:\r\n u = 1\r\n for j in range(1, int(n**0.5)+2):\r\n if n % j == 0:\r\n jj = n // j \r\n if j >= d and jj > u:\r\n u = jj\r\n elif jj >= d and j > u: \r\n u = j\r\n res = [u*i for i in range(1, k)]\r\n res.append(n - sum(res))\r\n print(*res)\r\n \r\n \r\n ", "n, k = list(map(int, input().strip().split(\" \")))\n\nM = (k * (k + 1)) // 2;\nres = 0\ni = 1\nwhile i * i <= n:\n if n % i == 0:\n rem = n // i\n if rem >= M:\n res = max(res, i)\n rem = i\n if rem >= M:\n res = max(res, n // i)\n i += 1\n\nif res == 0:\n print(-1)\n exit()\nrem = n // res\nans = [0 for j in range(k)]\nfor j in range(k - 1):\n ans[j] = (j + 1) * res\n rem -= j + 1\nans[-1] = rem * res\nprint(\" \".join(list(map(str, ans))))", "n,k=map(int,input().split())\r\nd=1\r\ndiv=[]\r\nwhile (d*d)<=n:\r\n\tif n%d==0:\r\n\t\tdiv.append(d)\r\n\t\tif (d*d)!=n:\r\n\t\t\tdiv.append(n//d)\r\n\td+=1\r\ndiv.sort()\r\nans=None\r\ns=(k*(k+1))//2\r\nfor d in div:\r\n\tif n//d >=s:\r\n\t\tans=d\r\n\telse:\r\n\t\tbreak\r\nif ans:\r\n\tfor i in range(1,k):\r\n\t\tprint(i*ans,end=\" \")\r\n\t\tn-=i*ans\r\n\tprint(n)\r\nelse:\r\n\tprint(-1)", "import math\n\nn, k = map(int, input().split())\nfactors = set()\n\nfor i in range(int(math.sqrt(n)), 0, -1):\n if n % i == 0:\n factors.add(i)\n factors.add(n // i)\n\nminimo = k * (k + 1) // 2\n\nfor x in sorted(factors, reverse=True):\n temp = n // x\n if temp >= minimo:\n for i in range(1, k):\n print(i * x, end=' ')\n print((temp - k * (k - 1) // 2) * x)\n break\nelse:\n print(-1)\n\n", "import math\r\nn, k = [int(x) for x in input().split()]\r\n\r\nmmx = (k*(k+1))//2\r\n\r\nif mmx > n :\r\n print(-1)\r\nelse:\r\n mx = 1\r\n for i in range(2, int(math.sqrt(n))+1):\r\n if n%i == 0:\r\n l = i\r\n r = n//i\r\n if mmx <= l:\r\n mx = max(mx, n//i)\r\n if mmx <= r:\r\n mx = max(mx, i)\r\n sm = 0\r\n for i in range(1, k):\r\n print(i*mx, end=\" \")\r\n sm = sm + i*mx\r\n sm = n-sm\r\n print(sm)\r\n", "from math import isqrt\r\nn, k = map(int, input().split())\r\ng = (2*n)//(k*(k+1))\r\n# print(g)\r\nfactors = [1]\r\nfor i in range(2,isqrt(n)+1):\r\n if n % i == 0:\r\n factors.append(i)\r\nfor i in factors[::-1]:\r\n factors.append(n//i)\r\n# print(factors)\r\ncurrent = 0\r\nfor kkk in factors:\r\n if kkk <= g:\r\n current = kkk\r\n# print(current)\r\nif current == 0:\r\n print(-1)\r\nelse:\r\n s = n // current\r\n p = [kk for kk in range(1,k)]\r\n # print(p)\r\n p.append(s - sum(p))\r\n q = [k*current for k in p]\r\n print(*q)\r\n\r\n\r\n", "from math import sqrt\nn, k = map(int, input().split())\nmax_d = 0\nfor d in range(1, int(sqrt(n) + 2)):\n if n % d != 0:\n continue\n if d * k * (k + 1) // 2 <= n:\n max_d = max(max_d, d)\n if n // d * k * (k + 1) // 2 <= n:\n max_d = max(max_d, n // d)\nif max_d == 0:\n print(-1)\n exit(0)\nfor i in range(k - 1):\n print((i + 1) * max_d, end=' ')\n n -= (i + 1) * max_d\nprint(n)\n", "import math\r\n\r\ndef divisorGenerator(n):\r\n large_divisors = []\r\n for i in range(1, int(math.sqrt(n) + 1)):\r\n if n % i == 0:\r\n yield i\r\n if i*i != n:\r\n large_divisors.append(n / i)\r\n for divisor in reversed(large_divisors):\r\n yield divisor\r\n\r\nn,k = list(map(int,input().strip().split(' ')))\r\nl = list(map(int,divisorGenerator(n)))\r\nlenght = len(l)-1\r\nflag = True\r\nwhile lenght>=0 :\r\n p = l[lenght]\r\n if p * (int(n / p)) == n and k <= int(n / p) - int((k * (k - 1)) / 2):\r\n for i in range(1, k):\r\n print(p * i, end=' ')\r\n print(p * (int(n / p) - int((k * (k - 1)) / 2)))\r\n flag = False\r\n break\r\n lenght -= 1\r\nif flag: \r\n print(-1)", "n, k = map(int, input().split())\r\nif n < k * (k + 1) // 2:\r\n print(-1)\r\nelse:\r\n drd = 1\r\n for d in range(1, int(n ** 0.5) + 1):\r\n if n % d == 0:\r\n x = n // d\r\n if x >= k * (k + 1) // 2:\r\n drd = max(d, drd)\r\n if d >= k * (k + 1) // 2:\r\n drd = max(n // d, drd)\r\n ans = []\r\n x = n // drd\r\n x -= k * (k - 1) // 2\r\n for i in range(1, k):\r\n ans.append(i * drd)\r\n ans.append(x * drd)\r\n print(*ans)", "def divisors(n):\r\n lower,upper=[],[]\r\n i=1\r\n while i*i<=n:\r\n if n%i==0:\r\n lower.append(i)\r\n if i!=n//i:\r\n upper.append(n//i)\r\n i+=1\r\n return lower+upper[::-1]\r\n\r\nn,k=map(int,input().split())\r\nm=k*(k+1)//2\r\nfor d in divisors(n)[::-1]:\r\n if m*d<=n:\r\n ans=[]\r\n for i in range(1,k):\r\n ans.append(d*i)\r\n m-=i\r\n ans.append(n-sum(ans))\r\n print(*ans)\r\n exit()\r\n\r\nprint(-1)", "primes = []\r\nfor p in range(2, 10**5):\r\n is_prime = True\r\n for p2 in primes:\r\n if p2*p2 > p:\r\n break\r\n if p % p2==0:\r\n is_prime = False\r\n break\r\n if is_prime:\r\n primes.append(p)\r\n \r\ndef factor(n):\r\n d = {}\r\n for p in primes:\r\n if p*p > n:\r\n break\r\n if n % p==0:\r\n c = 0\r\n while n % p==0:\r\n n = n//p\r\n c+=1\r\n d[p] = c\r\n if n > 1:\r\n d[n] = 1\r\n return d\r\n \r\ndef factors(n):\r\n d = factor(n)\r\n start = [1]\r\n for p in d:\r\n next_s =[]\r\n for i in range(d[p]+1):\r\n for x in start:\r\n next_s.append(x*p**i)\r\n start = next_s\r\n return sorted(start)\r\n \r\ndef process(n, k):\r\n if k*(k+1)//2 > n:\r\n return [-1]\r\n A = factors(n)\r\n for x in A:\r\n if x >= k*(k+1)//2:\r\n break\r\n answer = [i for i in range(1, k+1)]\r\n answer[-1]+=(x-(k*(k+1))//2)\r\n g = n//x\r\n answer = [y*g for y in answer]\r\n return answer\r\n\r\nn, k = [int(x) for x in input().split()]\r\nanswer = process(n, k)\r\nprint(' '.join(map(str, answer)))", "# import sys\r\nimport math\r\n# sys.stdin = open('input.txt', 'r')\r\n# sys.stdout = open('output.txt', 'w')\r\n\r\nn, k = map(int, input().split())\r\ns = k * (k + 1) // 2\r\nif(s > n):\r\n print(-1)\r\nelse:\r\n mx = 0\r\n i = 1\r\n while(i <= math.sqrt(n)):\r\n if(n % i == 0):\r\n if (i * s <= n):\r\n mx = i\r\n x = n / i\r\n if (x * s <= n):\r\n c = 1\r\n tot = 0\r\n count = 0\r\n while (count < k):\r\n if (count == k - 1):\r\n print(int(n - tot))\r\n quit()\r\n tot += c * x\r\n print(int(x*c), end=\" \")\r\n c += 1\r\n count += 1\r\n i += 1\r\n c = 1\r\n tot = 0\r\n count = 0\r\n while (count < k):\r\n if (count == k - 1):\r\n print(int(n - tot))\r\n quit()\r\n tot += c * mx\r\n print(int(mx * c), end=\" \")\r\n c += 1\r\n count += 1\r\n", "n, k = map(int, input().split())\r\nd = 1\r\nmd = -1\r\nwhile (d * d <= n):\r\n if (n % d == 0):\r\n s = d * (k - 1) * k // 2\r\n if (n - s > (k - 1) * d):\r\n md = max(md, d)\r\n d = n // d\r\n s = d * (k - 1) * k // 2\r\n if (n - s > (k - 1) * d):\r\n md = max(md, d)\r\n d = n // d\r\n d = d + 1\r\nif (md == -1):\r\n print(-1)\r\n exit(0)\r\ns = md * (k - 1) * k // 2\r\nfor i in range(1, k):\r\n print(i * md, end = ' ')\r\nprint(n - s)", "#Bhargey Mehta (Sophomore)\r\n#DA-IICT, Gandhinagar\r\nimport sys, math, queue\r\n#sys.stdin = open(\"input.txt\", \"r\")\r\nMOD = 10**9+7\r\nsys.setrecursionlimit(1000000)\r\n\r\nn, k = map(int, input().split())\r\nf = []\r\ni = 1\r\nwhile i*i <= n:\r\n if n%i == 0:\r\n f.append(i)\r\n f.append(n//i)\r\n i += 1\r\nf.sort(reverse=True)\r\nfor g in f:\r\n if (k*(k+1))//2 <= n//g:\r\n x = [i for i in range(1, k)]\r\n x.append(n//g - (k*(k-1))//2)\r\n for i in range(k):\r\n print(x[i]*g, end=\" \")\r\n exit()\r\nprint(-1)", "def make_divisors(n):\r\n divisors = []\r\n for i in range(1, int(n**0.5)+1):\r\n if n % i == 0:\r\n divisors.append(i)\r\n if i != n // i:\r\n divisors.append(n//i)\r\n\r\n return divisors\r\n\r\nn, k = map(int, input().split())\r\nD = make_divisors(n)\r\nD.sort(reverse=True)\r\nx = k*(k+1)//2\r\nfor d in D:\r\n if n//d >= x:\r\n break\r\nelse:\r\n print(-1)\r\n exit()\r\nans = [0]*k\r\ng = d\r\ns = n//d\r\nfor i in range(k):\r\n if i != k-1:\r\n ans[i] = (i+1)*g\r\n s -= (i+1)\r\n else:\r\n ans[i] = s*g\r\nprint(*ans)\r\n", "#!/usr/bin/env python3\n\nimport sys\nfrom math import sqrt\n\n[n, k] = map(int, input().strip().split())\n\nif k * (k + 1) > 2 * n:\n\tprint (-1)\n\tsys.exit(0)\n\na0max = (2 * n) // (k * (k + 1))\n\nd = 1\nfor i in range(1, min(a0max, int(sqrt(n))) + 1):\n\t\tif n % i == 0:\n\t\t\td = max(d, i)\n\t\t\tif a0max * i >= n:\n\t\t\t\td = max(d, n // i)\n\nres = [(i + 1) * d for i in range(k - 1)]\nres.append(n - d * (k * (k - 1)) // 2)\n\t\n\nprint (' '.join(map(str, res)))\n", "n, k = map(int, input().split())\r\nans = 0\r\nfor i in range(1, round(n ** 0.5) + 2):\r\n if n % i == 0:\r\n if k * (k - 1) // 2 * i < n and n - k * (k - 1) // 2 * i > 0 and n - k * (k - 1) // 2 * i > (k - 1) * i:\r\n ans = max(ans, i)\r\n i = n // i\r\n if k * (k - 1) // 2 * i < n and n - k * (k - 1) // 2 * i > 0 and n - k * (k - 1) // 2 * i > (k - 1) * i:\r\n ans = max(ans, i)\r\n i = n // i\r\nif k * (k + 1) // 2 > n:\r\n print(-1)\r\nelse:\r\n print(\" \".join([str(ans * i) for i in range(1, k)] + [str(n - k * (k - 1) // 2 * ans)]))", "def divisor_list(n):\r\n\tdivisors = []\r\n\td = 1\r\n\twhile d*d <= n:\r\n\t\tif n%d==0:\r\n\t\t\tdivisors.append(d)\r\n\t\t\tif d != n//d:\r\n\t\t\t\tdivisors.append(n//d)\r\n\t\td += 1\r\n\treturn sorted(divisors)\r\nn,k = map(int,input().split())\r\ndivisors = divisor_list(n)\r\n\r\nd = -1\r\nfor x in divisors:\r\n\tif k*(k+1)//2 <= n//x:\r\n\t\td = x\r\n\r\nif d==-1:\r\n\tprint(-1)\r\nelse:\r\n\tans = [i for i in range(1,k+1)]\r\n\tans[-1] += n//d - k*(k+1)//2\r\n\tprint(*[d*x for x in ans])", "n,k=list(map(int,input().strip().split(' ')))\r\nL=n//k\r\nimport bisect\r\ndef div(n):\r\n if n==1:\r\n return [1]\r\n elif n==2:\r\n return [1,2]\r\n else:\r\n K=int(n**0.5)\r\n temp1=[]\r\n temp2=[]\r\n for i in range(1,K+1):\r\n if n%i==0:\r\n temp1+=[i]\r\n temp2+=[n//i]\r\n if temp1[-1]==temp2[-1]:\r\n temp2=temp2[1:]\r\n ans=temp1+temp2[::-1] \r\n return ans\r\n \r\n\r\n\r\n\r\n\r\nif k*(k+1)//2>n:\r\n print(-1)\r\nelse:\r\n TTT=div(n)\r\n temp=(k*(k+1))//2\r\n L=n//temp\r\n K=bisect.bisect_right(TTT,L)-1\r\n L=TTT[K]\r\n \r\n\r\n \r\n \r\n T=(n-((temp)*L))//L\r\n ans=[]\r\n for i in range(1,k+1):\r\n if i!=k:\r\n ans+=[i*L]\r\n else:\r\n ans+=[(i+T)*L]\r\n if k==1:\r\n print(n)\r\n else: \r\n print(*ans) \r\n ", "import sys, math\r\ninput=sys.stdin.readline\r\nINF=int(1e9)+7\r\n\r\n\r\ndef find_all_divisors_of_a_number(x):\r\n result = []\r\n for i in range(2, int(math.sqrt(x)) + 1):\r\n if x % i == 0:\r\n result.append(i)\r\n if i * i != x:\r\n result.append(x // i)\r\n return result\r\n\r\ndef solve():\r\n n,k=map(int,input().split())\r\n data=find_all_divisors_of_a_number(n)\r\n data.append(1)\r\n data.append(n)\r\n data.sort()\r\n nk=k*(k+1)//2\r\n ans=-1\r\n for i in data:\r\n if n%i==0 and i*nk<=n:\r\n ans=i\r\n if ans==-1:\r\n print(ans)\r\n else:\r\n n//=ans\r\n result=list(range(1,k))\r\n result.append(n-sum(result))\r\n for i in result:\r\n print(ans*i,end=' ')\r\n \r\n \r\n \r\n\r\n \r\nt=1\r\nwhile t:\r\n t-=1\r\n solve()\r\n", "import math\r\nn, k = map(int, input().split())\r\nif (k*(k+1))/2 > n:\r\n print(-1)\r\n\r\nelse:\r\n c = int( n/ ((k*(k+1))/2))\r\n a = []\r\n for i in range(1, int( math.sqrt(n) + 1 ) ):\r\n if i*i == n:\r\n a.append(i)\r\n elif n%i == 0:\r\n a.append(i)\r\n a.append(n//i)\r\n \r\n a = sorted(a)\r\n s = 0\r\n for i in range(len(a)):\r\n s+=1\r\n if a[i] > c:\r\n break \r\n c = a[ s - 2]\r\n for i in range(1, k):\r\n print(c*i, end= \" \")\r\n print(str( int(n - c*(k*(k-1)/2) ) ))\r\n", "n,k = [int(x) for x in input().split()]\ndivisors = {1,n}\nfor i in range(2,n):\n\tif i*i > n:\n\t\tbreak\n\tif n%i == 0:\n\t\tdivisors.add(i)\n\t\tdivisors.add(n//i)\ndivisors = list(divisors)\ndivisors.sort()\ndivisors.reverse()\nbase = k*(1+k)\nbase = base//2\ndone = False\nfor d in divisors:\n\tif base*d <= n:\n\t\tres = [d*i for i in range(1,k+1)]\n\t\tres[k-1] += (n-sum(res))\n\t\tprint(*res)\n\t\tdone = True\n\t\tbreak\nif not done:\n\tprint(-1)\n", "import sys\n\n#Library Info(ACL for Python/Pypy) -> https://github.com/not522/ac-library-python\n\ndef input():\n return sys.stdin.readline().rstrip()\n\nDXY = [(0, -1), (1,0), (0, 1), (-1,0)] #L,D,R,Uの順番\n\ndef divisors(n : int):\n res = []\n for i in range(1,n + 1):\n if i * i > n:\n break\n if n % i == 0:\n if i * i == n:\n res.append(i)\n else:\n res.append(n // i)\n res.append(i)\n res.sort(reverse = True)\n return res\n\ndef main():\n n,k = map(int,input().split())\n for d in divisors(n):\n if n // d >= k * (k + 1) // 2:\n ans = [0]*(k)\n tot = n // d\n for i in range(k):\n if i != k - 1:\n ans[i] = (i + 1) * d\n tot -= (i + 1)\n else:\n ans[i] = tot * d \n print(*ans)\n return 0\n print(-1)\n return 0\n\n\nif __name__ == \"__main__\":\n main()\n" ]

[ "import math\r\n\r\n# 预处理数组\r\nN = int(1e6+1)\r\nis_prime = [True] * N\r\nis_prime[0], is_prime[1] = False, False\r\nfor i in range(2, int(math.sqrt(N))+1):\r\n if is_prime[i]:\r\n for j in range(i*i, N, i):\r\n is_prime[j] = False\r\n\r\ndef is_t_prime(num):\r\n # 判断一个数是否为T-prime\r\n # T-prime的特点是有且仅有三个正因子，即平方根也是质数\r\n if num == 1:\r\n return False\r\n sqrt_num = int(math.sqrt(num))\r\n if sqrt_num * sqrt_num == num and is_prime[sqrt_num]:\r\n return True\r\n return False\r\n\r\n# 读取输入\r\nn = int(input())\r\nnumbers = list(map(int, input().split()))\r\n\r\n# 判断每个数是否为T-prime并输出结果\r\nfor num in numbers:\r\n if is_t_prime(num):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "n = int(input())\nx = map(int, input().split())\n\nans = {}\n\nisPrime = [True for i in range(1000001)]\nisPrime[1] = False\nfor i in range(2, 1000001):\n if not isPrime[i]:\n continue\n ans[i * i] = True\n for j in range(i + i, 1000001, i):\n isPrime[j] = False\n\n\n\nfor i in x:\n if i in ans:\n print(\"YES\")\n else:\n print(\"NO\")", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Sun Oct 15 16:26:41 2023\r\n\r\n@author: 31861\r\n\"\"\"\r\nn=1000000\r\na=[1]*n\r\ns=set()\r\nfor i in range(2,n):\r\n\tif a[i]:\r\n\t\ts.add(i*i)\r\n\t\tfor j in range(i*i,n,i):\r\n\t\t\ta[j]=0\r\ninput()\r\nfor x in map(int,input().split()):\r\n\tprint([\"NO\",\"YES\"][x in s])", "n = 1000000\r\na=[1]*n\r\ns=set()\r\nfor i in range(2,n):\r\n if(a[i]):\r\n s.add(i*i)\r\n for j in range(i**2,n,i):\r\n a[j] = 0\r\n\r\ninput()\r\nfor x in map(int, input().split()):\r\n if x in s:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n", "import math\r\nn=input()\r\nprime=[1 for i in range(1000001)]\r\nfor i in range(2,1000001):\r\n if prime[i]:\r\n for k in range(i*2,1000001,i):\r\n prime[k]=0\r\ndef is_Tprime(a):\r\n tmp=math.sqrt(a)\r\n if int(tmp)==tmp:\r\n if prime[int(tmp)]:\r\n return 1\r\n return 0\r\narr=list(map(int,input().split()))\r\nfor i in arr:\r\n if i==1:\r\n print(\"NO\")\r\n continue\r\n if is_Tprime(i):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "import math\r\n\r\nMAXN = 10**6\r\nisprime = [0, 0] + [1]*MAXN\r\nfor i in range(2, int(math.sqrt(MAXN))+1):\r\n if isprime[i]:\r\n for j in range(i*i, MAXN+1, i):\r\n isprime[j] = 0\r\n\r\nn = int(input().strip())\r\na = list(map(int, input().strip().split()))\r\n\r\nfor i in a:\r\n t = math.sqrt(i)\r\n if t == int(t) and isprime[int(t)]:\r\n print('YES')\r\n else:\r\n print('NO')\r\n", "from os import path\r\nfrom sys import stdin, stdout\r\n\r\n\r\nfilename = \"../templates/input.txt\"\r\nif path.exists(filename):\r\n stdin = open(filename, 'r')\r\n\r\n\r\ndef input():\r\n return stdin.readline().rstrip()\r\n\r\n\r\ndef print(*args, sep=' ', end='\\n'):\r\n stdout.write(sep.join(map(str, args)))\r\n stdout.write(end)\r\n\r\n\r\ndef sieve(n: int):\r\n \"\"\"\r\n Primes <= n\r\n \"\"\"\r\n primes = bytearray(n + 1)\r\n p = 3\r\n while p * p <= n:\r\n if not primes[p]:\r\n primes[p * p::p] = [1] * len(primes[p * p::p])\r\n p += 2\r\n if n >= 2:\r\n yield 2\r\n for p in range(3, n + 1, 2):\r\n if not primes[p]:\r\n yield p\r\n\r\n\r\ndef solution():\r\n n = int(input())\r\n nums = [int(num) for num in input().split()]\r\n ps = {p ** 2 for p in sieve(10 ** 6)}\r\n for num in nums:\r\n print('YES' if num in ps else 'NO')\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", "#The core problem is to collect prime number\r\nN = int(input())\r\nn= 10**6\r\nlist=[int(i) for i in input().split(\" \")]\r\nprime_list = [False] + [True]*(n-1)\r\nfor i in range(1,int((n)**(1/2))+2):\r\n if prime_list[i]:\r\n for k in range(1,int(n/(i+1))):\r\n prime_list[k*(i+1)+i] = False\r\nfor j in list:\r\n a = j**(1/2)\r\n if int(a) - a == 0:\r\n if prime_list[int(a)-1]:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n else:\r\n print(\"NO\")\r\n", "input();n=10**6;A=[1]*n;B=set()\r\nfor x in range(2,n):\r\n if A[x]:\r\n B.add(x*x)\r\n for m in range(x,n,x):A[m]=0\r\nfor k in map(int, input().split()):print([\"NO\",\"YES\"][k in B])", "import math\nnum=[1]*1000000\ns=set()\nfor i in range(2,1000000):#不开方，生成质数表\n if num[i]:\n s.add(i)\n for j in range(i,1000000,i):\n num[j]=0\n\nn=int(input())\nm=list(map(int,input().split()))\nfor i in m:\n print(['NO','YES'][math.sqrt(i) in s])", "import math\r\ndef find_all_primes():\r\n arr=[True for i in range(10**6+1)]\r\n for i in range(2,10**6+1):\r\n if arr[i]:\r\n for j in range(i*2,10**6+1,i):\r\n arr[j]=False\r\n \r\n primes=[]\r\n for i in range(2,10**6+1):\r\n if arr[i]:\r\n primes.append(i)\r\n \r\n square_primes=set()\r\n for val in primes:\r\n square_primes.add(val**2)\r\n \r\n return square_primes\r\n \r\n \r\ndef solve():\r\n n=int(input())\r\n a=list(map(int,input().split()))\r\n square_primes=find_all_primes()\r\n for val in a:\r\n if val in square_primes:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n \r\nsolve()", "import math\r\n\r\nx=1000000\r\npre = {i+1:1 for i in range(x)}\r\npre[1]=0\r\nfor j in range(1,x+1):\r\n if pre[j]!=0:\r\n for k in range(2*j,x+1,j):\r\n pre[k]=0\r\n\r\n\r\nn=int(input())\r\nalll=list(map(int, input().split()))\r\nfor i in range(n):\r\n a = math.sqrt(alll[i])\r\n if a!=int(a):\r\n print('NO')\r\n else:\r\n a=int(a)\r\n if pre[a]:\r\n print('YES')\r\n else:\r\n print('NO')", "import math\r\n\r\ndef sieve_of_eratosthenes():\r\n limit = (10 ** 6) + 1\r\n primes = [True for i in range(limit)]\r\n primes[0] = False\r\n primes[1] = False\r\n primes[2] = True\r\n\r\n p = 2\r\n\r\n while p * p <= limit:\r\n if primes[p] == True:\r\n for i in range(p * p, limit, p):\r\n primes[i] = False\r\n p += 1\r\n\r\n return primes\r\n\r\n\r\nprimes = sieve_of_eratosthenes()\r\n\r\nn = int(input())\r\nnumbers = list(map(int, input().split()))\r\n\r\nfor i in numbers:\r\n square = math.sqrt(i)\r\n if square.is_integer():\r\n square = int(square)\r\n if primes[square] == True:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n else:\r\n print(\"NO\")\r\n\r\n", "'''程文奇 2100015898'''\r\ndef tprime(x,tprimeset):\r\n if x in tprimeset:\r\n return 'YES'\r\n return 'NO'\r\n\r\nbiglist=[1]*1000000\r\ntprimeset=set()\r\nfor i in range(2,1000000):\r\n if biglist[i]==1:\r\n tprimeset.add(i*i)\r\n for j in range(i*i,1000000,i):\r\n biglist[j]=0\r\nn=int(input())\r\nanswerlist=list(map(lambda x:tprime(int(x),tprimeset),input().split()))\r\nfor k in answerlist:\r\n print(k)\r\n", "import math\r\n\r\ndef is_t_prime(n):\r\n if n < 4: # Numbers less than 4 cannot be T-prime\r\n return False\r\n sqrt_n = int(math.sqrt(n))\r\n if sqrt_n * sqrt_n != n: # Check if n is a perfect square\r\n return False\r\n if is_prime(sqrt_n): # Check if the square root is prime\r\n return True\r\n return False\r\n\r\ndef is_prime(n):\r\n if n < 2:\r\n return False\r\n for i in range(2, int(math.sqrt(n)) + 1):\r\n if n % i == 0:\r\n return False\r\n return True\r\n\r\nn = int(input())\r\nnumbers = list(map(int, input().split()))\r\n\r\nfor num in numbers:\r\n if is_t_prime(num):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "#author 沈天健 2300011417\r\nimport sys\r\nreadline=sys.stdin.readline\r\nwrite=sys.stdout.write\r\nn=int(readline())\r\nlis=[*map(int,readline().split())]\r\n\r\n\r\ndef oula_shai(n):\r\n prime_=[]\r\n is_prime_=[True]*(n+1)\r\n is_prime_[0]=False\r\n is_prime_[1]=False\r\n for i in range(2,n):\r\n if is_prime_[i]:\r\n prime_.append(i)\r\n for pri in prime_:\r\n if pri*i>n:\r\n break\r\n is_prime_[pri*i]=False\r\n if i%pri==0:\r\n break\r\n return is_prime_\r\n\r\nis_prime=oula_shai(1000000)\r\n\r\nfor x in lis:\r\n if int(x**0.5)==x**0.5:\r\n if is_prime[int(x**0.5)]:\r\n write(\"YES\\n\")\r\n continue\r\n write(\"NO\\n\")\r\n \r\n\r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\nm=int(max(a)**.5)+10\r\np=[1]*(m+1)\r\np[0]=0; p[1]=0; i=0\r\nwhile i*i<=m:\r\n if p[i]:\r\n for j in range(i*i, m+1, i):\r\n p[j]=0\r\n i+=1\r\nfor i in a:\r\n y=int(i**.5)\r\n print('YES' if p[y] and y*y==i else 'NO')\r\n", "from math import sqrt\r\nprimes=[2]\r\n\r\ndef isprime(n:int)->bool:\r\n global primes\r\n if n<=primes[-1]: return True if n in primes else False\r\n else:\r\n if (s:=int(sqrt(n))+1)<=primes[-1]:\r\n for prime in primes:\r\n if n%prime==0:\r\n return False\r\n return True\r\n else:\r\n for i in range(primes[-1]+1,s+1):\r\n for prime in primes:\r\n if n%prime==0:return False\r\n check=0\r\n for prime in primes:\r\n if i%prime==0:\r\n check+=1\r\n break\r\n if check!=0:continue\r\n primes.append(i)\r\n return True\r\n\r\ndef isTprime(n:int)->str:\r\n sq=int(sqrt(n))\r\n return 'YES' if sq*sq==n and isprime(sq) else 'NO'\r\n \r\nn=int(input())\r\nl=list(map(int,input().split()))\r\ndic={}\r\nfor i in l:\r\n if i not in dic:\r\n dic[i]=isTprime(i)\r\n print(dic[i])", "import math\r\n\r\ndef is_prime(num):\r\n if num <= 1:\r\n return False\r\n elif num <= 3:\r\n return True\r\n elif num % 2 == 0 or num % 3 == 0:\r\n return False\r\n i = 5\r\n while i * i <= num:\r\n if num % i == 0 or num % (i + 2) == 0:\r\n return False\r\n i += 6\r\n return True\r\n\r\nn = int(input())\r\nb = input().split()\r\nfor i in range(n):\r\n a = int(b[i])\r\n if a ** 0.5 % 1 == 0:\r\n if is_prime(int(a ** 0.5)):\r\n print('YES')\r\n else:\r\n print('NO')\r\n else:\r\n print('NO')", "n=int(input())\r\nseq=list(map(int,input().split()))\r\n\r\nm=int(max(seq)**0.5)+1\r\nfltr=[1 for i in range(m+1)]\r\nprimes=[]\r\nfor i in range(2,m+1):\r\n if fltr[i]:\r\n primes.append(i)\r\n for j in primes:\r\n if i*j>m:\r\n break\r\n fltr[i*j]=0\r\n else:\r\n for j in primes:\r\n if i*j>m:\r\n break\r\n fltr[i*j]=0\r\n if i%j==0:\r\n break\r\ntprimes=set(map(lambda x:x**2,primes))\r\n\r\nfor i in seq:\r\n if i in tprimes:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "n=int(input())\r\ndef euler(p=10**6):\r\n global r\r\n i=3\r\n while i<p:\r\n if i in r:\r\n l=p//i\r\n for num in range(2,l+1):\r\n if num*i in r:\r\n r-={num*i}\r\n i+=2\r\n else:\r\n i+=2\r\n return r\r\n\r\nr=set([2,5]+[k for k in range(3,10**6,2) if str(k)[-1]!='5'])\r\nc=euler()\r\nfrom math import sqrt\r\ndef f(s):\r\n if s==4 or s==25:\r\n return 1\r\n if str(s)[-1] in ['2','3','7','6','4','0','5']:\r\n return 0\r\n if s==1:\r\n return 0\r\n t=s**0.5\r\n if int(t)!=t:\r\n return 0\r\n if t not in r:\r\n return 0\r\n return 1\r\nl=list(map(int,input().split()))\r\nfor c in l:\r\n if f(c):\r\n print('YES')\r\n else:\r\n print('NO')", "k=10**6+1\r\nT=[0]*k\r\nT[1]=1\r\nfor i in range(2,k):\r\n if T[i]==0:\r\n for j in range(i*2,k,i):\r\n T[j]=1\r\nn=int(input())\r\nli=[int(i) for i in input().split()]\r\nfor k in li:\r\n t=k**0.5\r\n if t%1==0 and T[int(t)]==0:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "#-*- coding: utf-8 -*\n#-*- coding: utf-8 -*\n'''\nCreated on Tue Oct 10\nauthor 钱瑞 2300011480\n'''\nimport math\n\ndef p_q(n):\n p_b=[True]*(n+1)\n p_b[0]=False\n p_b[1]=False\n p=2\n while p*p<=n:\n if p_b[p]==True:\n for i in range(p*p,n+1,p):\n p_b[i]=False\n p+=1\n p_q_n=[]\n for i in range(n+1):\n if p_b[i]:\n p_q_n.append(i*i)\n return p_q_n\n\ndef check(l_0,t):\n l= 0\n h= len(l_0) - 1\n\n while l<=h:\n m=(l+h) // 2\n if l_0[m]==t:\n return True\n elif l_0[m]<t:\n l=m+1\n else:\n h=m-1\n return False\n\n\nimport math\nn=int(input())\nl=list(map(int,str(input()).split(' ')))\nl_0=p_q(1000000)\nl_an=[]\nfor i in l:\n if check(l_0,i):\n l_an.append('YES')\n else:\n l_an.append('NO')\nfor i in l_an:\n print(i)", "A=[0,1,1]+[1,0]*499999\r\nn=10**6;B={4};input()\r\nfor i in range(3,n,2):\r\n if A[i]:\r\n B.add(i*i)\r\n for x in range(i*i,n,2*i):A[x]=0\r\nfor k in map(int,input().split()):print([\"NO\",\"YES\"][k in B])", "def sushu(n):\r\n p=[]\r\n for j in range(n+1):\r\n p.append(1)\r\n p[0]=p[1]=0\r\n for i in range(2,n+1):\r\n if p[i]==1:\r\n for j in range(i*2,n+1,i):\r\n p[j]=0\r\n return p\r\n\r\ndef square(x):\r\n if (int(x**0.5))**2==x:\r\n return True\r\n else:\r\n return False\r\n\r\nn=int(input())\r\na=[int(i) for i in input().split()]\r\n\r\nmaximum=max(a)\r\np=sushu(int(maximum**0.5)+1)\r\n\r\nfor k in a:\r\n if square(k):\r\n if p[int(k**0.5)]==1:\r\n print('YES')\r\n else:\r\n print(\"NO\")\r\n else:\r\n print(\"NO\")", "#2300011786\r\nimport math\r\nfrom functools import lru_cache\r\n@lru_cache(maxsize=None)\r\n\r\n\r\ndef prime(n):\r\n for i in range(2,int(math.sqrt(n))+1):\r\n if n%i==0:\r\n return False\r\n return True\r\n\r\nn=int(input())\r\nlst=input().split()\r\nans=[]\r\nfor i in range(n):\r\n m=int(math.sqrt(int(lst[i])))\r\n if int(lst[i])==1:\r\n ans.append(\"NO\")\r\n elif m**2!=int(lst[i]):\r\n ans.append(\"NO\")\r\n elif prime(m)==True:\r\n ans.append(\"YES\")\r\n else:\r\n ans.append(\"NO\")\r\nprint(\"\\n\".join(ans))", "n=1000000\r\nnumber,x,ans=[True]*n,2,set()\r\nfor x in range(2,n):\r\n if number[x]==True:\r\n ans.add(x**2)\r\n for i in range(x**2,n,x):\r\n number[i]=False\r\ninput()\r\nfor i in map(int,input().split()):\r\n print([\"NO\",\"YES\"][i in ans])", "from math import sqrt\r\n\r\n#create prime lst\r\nlimit = 1000000\r\nlst = [True] * limit\r\nlst[0] = lst[1] = False\r\nfor i in range(limit):\r\n if lst[i] == True:\r\n for j in range (i*i, limit, i):\r\n lst[j] = False\r\n \r\ncases = int(input())\r\nnum_lst = input().split()\r\n\r\nfor n in num_lst:\r\n n = int(n)\r\n if n == 4: print(\"YES\")\r\n elif n % 2 == 0: print(\"NO\")\r\n else: \r\n root = sqrt(n)\r\n if root.is_integer() and lst[int(root)]:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n", "import math\nnum=[1]*1000000\nl=set()\nfor i in range(2,1000000):#不开方，生成质数表，只要遍历区间内任意数的任意大于1的倍数并否认它是质数，剩下的数就全是质数\n if num[i]:\n l.add(i)\n for j in range(i,1000000,i):\n num[j]=0\n\nn=int(input())\nm=list(map(int,input().split()))\nfor i in m:\n print(['NO','YES'][math.sqrt(i) in l])", "def primesquare(n2):\r\n n=int(n2**0.5)\r\n sieve = [True] * (n + 1)\r\n sieve[0] = sieve[1] = False\r\n\r\n for i in range(2, int(n**0.5) + 1):\r\n if sieve[i]:\r\n for j in range(i*i, n+1, i):\r\n sieve[j] = False\r\n\r\n primesquare = set()\r\n for i in range(2, n+1):\r\n if sieve[i]:\r\n primesquare.add(i*i)\r\n\r\n return primesquare\r\n\r\nn=int(input())\r\nmapl=map(int,input().split())\r\nl=[]\r\nmaxi=0\r\nfor i in mapl:\r\n l.append(i)\r\n if i > maxi:\r\n maxi=i\r\nprimesquare=primesquare(maxi)\r\nfor i in l:\r\n if i in primesquare:\r\n print('YES')\r\n else:\r\n print('NO')", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Tue Oct 10 15:15:05 2023\r\n\r\n@author: zinc 2300012115\r\n\"\"\"\r\nimport math\r\nis_prime = [1] * (10**6 + 1)\r\nis_prime[0] = is_prime[1] = 0\r\n\r\np = 2\r\nwhile p * p <= 10**6:\r\n if is_prime[p] == 1:\r\n for i in range(p * p, 10**6 + 1, p):\r\n is_prime[i] = 0\r\n p += 1\r\n\r\nprimes = set()\r\nfor i in range(2, 10**6 + 1):\r\n if is_prime[i] == 1:\r\n primes.add(i)\r\n \r\ndef check(x):\r\n if x == 1:\r\n return False\r\n elif x == 2:\r\n return False\r\n elif x%2 == 0 or x%3 == 0 or x%5 == 0 or x%7 == 0 or x%11 == 0 or x%13 == 0:\r\n if x == 4 or x == 9 or x == 25 or x == 49 or x == 121 or x == 169:\r\n return True\r\n else:\r\n return False\r\n else:\r\n sqrt_x = int(math.sqrt(x))\r\n if sqrt_x**2 == x:\r\n if sqrt_x in primes:\r\n return True\r\n else:\r\n return False\r\n else:\r\n return False\r\n \r\nn = int(input())\r\ntest = [int(x) for x in input().split()]\r\nfor k in test:\r\n if check(k) == True:\r\n print('YES')\r\n else:\r\n print('NO')", "n=1000000\r\nls,x,l=[True]*n,2,set()\r\nfor x in range(2,n):\r\n if ls[x]==True:\r\n l.add(x**2)\r\n for i in range(x**2,n,x):\r\n ls[i]=False\r\ninput()\r\nfor i in map(int,input().split()):\r\n print([\"NO\",\"YES\"][i in l])", "N = 1000000\r\n\r\nfilt = [False for i in range(N+1)]\r\nprimes=[]\r\nfor num in range(2,N+1):\r\n if not filt[num]:\r\n primes.append(num)\r\n for prime in primes:\r\n if num*prime > N:\r\n break\r\n filt[num*prime] = True\r\n if num % prime == 0:\r\n break\r\n\r\nprimes = set(primes)\r\n\r\nn = input()\r\n\r\nfor number in map(int,input().split()):\r\n squ = int(number**(1/2))\r\n if squ**2 == number and squ in primes:\r\n print('YES')\r\n else:\r\n print('NO')", "prime=[0,0]+[1]*(10**6-1)\r\nl=4\r\nn=int(input())\r\na=list(map(int,input().split()))\r\n'''while l<10**6:\r\n k=0\r\n for i in range(2,int(l**0.5)+2):\r\n if prime[i]==1:\r\n if l%i==0:\r\n k=1\r\n break\r\n if k==0:\r\n prime.append(1)\r\n else :\r\n prime.append(0)\r\n l+=1'''\r\nfor i in range(10**3+1):\r\n if prime[i]==1:\r\n for j in range(2,10**6//i+1):\r\n prime[i*j]=0\r\nfor item in a:\r\n if int(item**0.5)**2 ==item :\r\n if prime[int(item**0.5)]==1:\r\n print('YES')\r\n else:\r\n print('NO')\r\n elif (int(item**0.5)+1)**2 ==item:\r\n if prime[int(item**0.5)+1]==1:\r\n print('YES')\r\n else:\r\n print('NO')\r\n else:\r\n print('NO')", "limit = 1000000\r\ndef calculate_prime_flag_for_each_number_upto_limit():\r\n prime_flag = [True] * limit\r\n prime_flag[0] = prime_flag[1] = False\r\n for i in range(2,limit):\r\n if prime_flag[i] == True:\r\n for j in range(i*i, limit, i):\r\n prime_flag[j] = False\r\n return prime_flag \r\n\r\ndef check_if_a_number_is_t_prime(n):\r\n if n == 4:\r\n return True\r\n if n < 4 or n%2==0:\r\n return False\r\n sqrt_n = n**0.5\r\n if sqrt_n==int(sqrt_n):\r\n if prime_flag[int(sqrt_n)] == True:\r\n return True\r\n return False\r\n\r\nprime_flag = calculate_prime_flag_for_each_number_upto_limit()\r\ntotal_numbers = int(input())\r\ninput_array = list(map(int,input().split()))\r\nfor i in input_array:\r\n if check_if_a_number_is_t_prime(i)==True:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Tue Oct 17 15:28:23 2023\r\n\r\n@author: 苏柔德 2300011012\r\n\"\"\"\r\nimport math\r\nn=int(input())\r\nnums=list(map(int, input().split()))\r\nmx=max(nums)\r\nprimeend=math.isqrt(mx) + 2\r\n\r\nprime=[1]*primeend \r\ntprime=set() \r\n\r\n#筛质数\r\nfor i in range(2,primeend):\r\n if prime[i]==1:\r\n tprime.add(i*i)\r\n for j in range(i*i,primeend,i): # 将i的倍数标记为合数\r\n prime[j] = 0\r\nfor t in nums:\r\n if t in tprime:\r\n print('YES')\r\n else:\r\n print('NO')", "import math\r\nn = int(input())\r\nm = list(map(int, input().split()))\r\nN = int(1000001)\r\na = [True] * N\r\na[0], a[1] = False, False\r\nfor i in range(2, int(math.sqrt(N))+1):\r\n if a[i]:\r\n for j in range(i*i, N, i):\r\n a[j] = False\r\n\r\ndef t_prime(num):\r\n if num == 1:\r\n return False\r\n k = int(math.sqrt(num))\r\n if k * k == num and a[k]:\r\n return True\r\n else:\r\n return False\r\n\r\nfor num in m:\r\n if t_prime(num):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "n=1000000\r\na=[1]*n\r\ns=set()\r\nfor i in range(2,n):\r\n\tif a[i]:\r\n\t\ts.add(i*i)\r\n\t\tfor j in range(i*i,n,i):\r\n\t\t\ta[j]=0\r\ninput()\r\nfor x in map(int,input().split()):\r\n\tprint([\"NO\",\"YES\"][x in s])\r\n \r\n", "n = int(input())\r\nl = list(map(int, input().split()))\r\na = [2]\r\nc = [False]*(int(max(l)**.5)+1)\r\nc[1] = True\r\nfor i in range(3, len(c), 2):\r\n b = True\r\n for j in a:\r\n if i % j == 0:\r\n b = False\r\n break\r\n if j**2 > i:\r\n break\r\n if b:\r\n a.append(i)\r\n c[i-1] = True\r\nfor i in range(0, n):\r\n if int(l[i]**.5) != l[i]**.5:\r\n print('NO')\r\n else:\r\n if c[int(l[i]**.5)-1]:\r\n print('YES')\r\n else:\r\n print('NO')\r\n", "def sieve_of_eratosthenes(limit):\r\n prime = [True for _ in range(limit + 1)]\r\n p = 2\r\n while p * p <= limit:\r\n if prime[p]:\r\n for i in range(p * p, limit + 1, p):\r\n prime[i] = False\r\n p += 1\r\n primes = [p for p in range(2, limit + 1) if prime[p]]\r\n return set(primes) # 使用集合可以更快地进行查找操作\r\n\r\n# 预计算所有10^6内的质数\r\nprimes = sieve_of_eratosthenes(int(1e6))\r\n\r\ndef is_t_prime(x):\r\n sqrt_x = int(x**.5)\r\n return x == sqrt_x * sqrt_x and sqrt_x in primes\r\n\r\nn = int(input())\r\nnumbers = list(map(int, input().split()))\r\nfor x in numbers:\r\n print(\"YES\" if is_t_prime(x) else \"NO\")\r\n", "import math\ndef eis(prime):\n for i in range(2,10**6+1):\n if prime[i]==True:\n for j in range(i**2,10**6+1,i):\n prime[j]=False\n prime[1]=False\n prime[0]=False\n\ns=[True]*(10**6+1)\neis(s)\n\nn=int(input())\nans=[]\nm=list(map(int,input().split()))\nfor i in m:\n if math.sqrt(i)==math.floor(math.sqrt(i)) and s[math.floor(math.sqrt(i))]==True:\n ans.append(\"YES\")\n else:\n ans.append(\"NO\")\nfor i in ans:\n print(i)", "from math import sqrt\r\ndef linear_sieve(n):\r\n is_prime = [True] * (n+1)\r\n primes = []\r\n\r\n for i in range(2, n+1):\r\n if is_prime[i]:\r\n primes.append(i)\r\n \r\n j = 0\r\n while j < len(primes) and i * primes[j] <= n:\r\n is_prime[i * primes[j]] = False\r\n\r\n if i % primes[j] == 0:\r\n break\r\n j += 1\r\n\r\n return is_prime\r\n\r\nis_prime=linear_sieve(1000000)\r\nn=int(input())\r\na=list(map(int,input().split()))\r\nfor i in a:\r\n x=int(sqrt(i))\r\n if i == 1:\r\n print('NO') \r\n elif x**2!=i or is_prime[x]==0:\r\n print(\"NO\")\r\n else:\r\n print(\"YES\")", "import math\r\n\r\n# 埃氏筛算法生成范围内的所有素数\r\ndef sieveOfEratosthenes(n):\r\n primes = [True] * (n+1)\r\n primes[0] = primes[1] = False\r\n \r\n p = 2\r\n while p * p <= n:\r\n if primes[p]:\r\n for i in range(p * p, n+1, p):\r\n primes[i] = False\r\n p += 1\r\n \r\n return primes\r\n\r\n# 判断数是否为\"T-prime\"\r\ndef isTPrime(primes, number):\r\n sqrt_number = int(math.sqrt(number))\r\n if sqrt_number * sqrt_number != number: # 不是完全平方数\r\n return False\r\n if sqrt_number < len(primes) and primes[sqrt_number]: # 平方根是素数\r\n return True\r\n return False\r\n\r\n# 读取输入\r\nn = int(input())\r\nnumbers = list(map(int, input().split()))\r\n\r\n# 生成范围内的素数列表\r\nmax_number = max(numbers)\r\nprimes = sieveOfEratosthenes(int(math.sqrt(max_number)) + 1)\r\n\r\n# 对每个数判断是否为T-prime并输出结果\r\nfor number in numbers:\r\n if isTPrime(primes, number):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n", "#230B：T-primes\r\nimport math\r\ndef tprime(n):\r\n s=int(math.sqrt(n))\r\n if s in prime and s**2==n:\r\n return(\"YES\")\r\n return(\"NO\")\r\n#建立质数集合\r\nmax_num=int(math.sqrt(10**12))\r\nprime=set()\r\nis_prime=[True]*(max_num + 1)\r\nis_prime[0]=is_prime[1]=False\r\nfor i in range(2, int(math.sqrt(max_num)) + 1):\r\n if is_prime[i]==True:\r\n for j in range(i*i, max_num + 1, i):\r\n is_prime[j]=False\r\nfor i in range(max_num + 1):\r\n if is_prime[i]==True:\r\n prime.add(i)\r\n\r\n# 判断每个数是否为T-质数\r\nx=int(input())\r\na=list(map(int,input().split()))\r\nfor i in range(x):\r\n print(tprime(a[i]))", "from math import sqrt\r\nprimes=[2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97, \\\r\n 101, 103, 107, 109, 113, 127, 131, 137, 139, 149, 151, 157, 163, 167, 173, 179, 181, 191, 193, 197, 199, \\\r\n 211, 223, 227, 229, 233, 239, 241, 251, 257, 263, 269, 271, 277, 281, 283, 293, \\\r\n 307, 311, 313, 317, 331, 337, 347, 349, 353, 359, 367, 373, 379, 383, 389, 397, \\\r\n 401, 409, 419, 421, 431, 433, 439, 443, 449, 457, 461, 463, 467, 479, 487, 491, 499, \\\r\n 503, 509, 521, 523, 541, 547, 557, 563, 569, 571, 577, 587, 593, 599, \\\r\n 601, 607, 613, 617, 619, 631, 641, 643, 647, 653, 659, 661, 673, 677, 683, 691, \\\r\n 701, 709, 719, 727, 733, 739, 743, 751, 757, 761, 769, 773, 787, 797, \\\r\n 809, 811, 821, 823, 827, 829, 839, 853, 857, 859, 863, 877, 881, 883, 887, \\\r\n 907, 911, 919, 929, 937, 941, 947, 953, 967, 971, 977, 983, 991, 997]\r\n\r\ndef bisearch(l:list,k:int):\r\n if k<l[0] or k>l[-1]:return False\r\n n=len(l)\r\n start,end=0,n-1\r\n while start<=end:\r\n mid=(start+end)//2\r\n if l[mid]==k or l[mid+1]==k: return True\r\n elif l[mid]<k: start=mid\r\n else: end=mid\r\n if end-start<=1 and l[mid]<k<l[mid+1]: return False\r\n\r\ndef isprime(n:int)->bool:\r\n global primes\r\n if n<=primes[-1]: return True if bisearch(primes,n) else False\r\n else:\r\n if (s:=int(sqrt(n)))<=primes[-1]:\r\n for prime in primes:\r\n if n%prime==0:\r\n return False\r\n return True\r\n else:\r\n for i in range(primes[-1]+1,s+1):\r\n for prime in primes:\r\n if n%prime==0: return False\r\n if i%prime==0: break\r\n else: primes.append(i)\r\n return True\r\n\r\ndef isTprime(n:int)->bool:\r\n sq=int(sqrt(n))\r\n return True if sq*sq==n and isprime(sq) else False\r\n \r\nn=int(input())\r\nl=list(map(int,input().split()))\r\nfor i in range(n): print('YES') if isTprime(l[i]) else print('NO')", "import math\r\ndef sieve_of_eratosthenes(n):\r\n primes = [True] * (n + 1)\r\n primes[0] = primes[1] = False\r\n\r\n p = 2\r\n while p * p <= n:\r\n if primes[p] == True:\r\n for i in range(p * p, n + 1, p):\r\n primes[i] = False\r\n p += 1\r\n\r\n return [i for i in range(n + 1) if primes[i]]\r\n\r\n\r\ndef is_t_prime(num, primes):\r\n if num == 1:\r\n return False\r\n if math.isqrt(num) ** 2 != num:\r\n return False\r\n if math.isqrt(num) in primes:\r\n return True\r\n\r\n return False\r\n\r\n\r\nn = int(input())\r\nnumbers = list(map(int, input().split()))\r\n\r\n# Generate a list of prime numbers\r\nprimes = set(sieve_of_eratosthenes(int(math.sqrt(max(numbers)))))\r\n\r\nfor num in numbers:\r\n if is_t_prime(num, primes):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n", "import math\r\ndef judgePri(N):\r\n isPrime = [True] * N\r\n primes = []\r\n cnt = 0\r\n isPrime[1] = False\r\n for i in range(2, N):\r\n if isPrime[i]:\r\n primes.append(i)\r\n cnt += 1\r\n for j in range(cnt):\r\n temp = i * primes[j]\r\n if temp >= N:\r\n break\r\n isPrime[temp] = False\r\n if i % primes[j] == 0:\r\n break\r\n return isPrime\r\n# 判断一个数是否为素数\r\ndef is_prime(n):\r\n if n < 2:\r\n return False\r\n return isPrime[n]\r\n\r\nt=int(input())\r\nnums=list(map(int,input().split()))\r\nn=max(nums)\r\nisPrime= judgePri(int(math.sqrt(n))+1)\r\n# print(prime)\r\nfor x in nums:\r\n r=int(x**0.5)\r\n if r**2!=x:\r\n print(\"NO\")\r\n else:\r\n if is_prime(r):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "#等差数列法\r\nn=int(input())\r\ns=list(map(int,input().split()))\r\nmaxnum=max(s)\r\nimport math\r\nfirst=int(math.sqrt(maxnum)) #找到需要检索的最大质数范围\r\nl, x, y=[True]*(first+1), 2, int(math.sqrt(first))+1\r\nl[0]=l[1]=False\r\nwhile x<y: #遍历到开方后的开方\r\n if l[x]:\r\n for j in range(x*x, first+1, x): #只需检索x方后的倍数，之前的已检索过\r\n l[j]=False\r\n x+=1\r\nfor i in s:\r\n if not math.sqrt(i)%1==0:\r\n print(\"NO\")\r\n else:\r\n r=int(math.sqrt(i))\r\n if l[r]:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\") ", "l=1000000\r\na=[1]*l\r\ns=set()\r\nfor i in range(2,l):\r\n if a[i]:\r\n s.add(i*i)\r\n for j in range(i*i,l,i):\r\n a[j]=0\r\nn=int(input())\r\nnums=list(map(int,input().split()))\r\nfor i in range(n):\r\n if nums[i] in s:\r\n print('YES')\r\n else:\r\n print('NO')", "import math\r\nimport sys\r\ninput = sys.stdin.readline\r\n\r\ndef is_prime(n):\r\n if n <= 1:\r\n return False\r\n if n <= 3:\r\n return True\r\n if n % 2 == 0 or n % 3 == 0:\r\n return False\r\n i = 5\r\n while i * i <= n:\r\n if n % i == 0 or n % (i + 2) == 0:\r\n return False\r\n i += 6\r\n return True\r\n\r\nn = int(input())\r\nl = list(map(int, input().split()))\r\nl1 = []\r\n\r\n# Create an array to store prime status\r\nis_prime_cache = [False] * (int(math.sqrt(max(l)))+1)\r\nfor i in range(len(is_prime_cache)):\r\n is_prime_cache[i] = is_prime(i)\r\n\r\nfor i in l:\r\n if i == 1:\r\n l1.append(\"NO\")\r\n elif i ** 0.5 == math.floor(i ** 0.5):\r\n if is_prime_cache[int(i**0.5)]:\r\n l1.append(\"YES\")\r\n else:\r\n l1.append(\"NO\")\r\n else:\r\n l1.append(\"NO\")\r\n\r\nfor i in l1:\r\n print(i)\r\n", "# T-primes Difficulty:1300\r\n'''\r\n# 首先找出10^3以内的所有质数\r\nprime = [2]\r\na = 3\r\nwhile a <= 10**3:\r\n flag = True\r\n for i in range(len(prime)):\r\n if a % prime[i] == 0:\r\n flag = False\r\n break\r\n if flag:\r\n prime.append(a)\r\n a += 2\r\nprint(prime)\r\n'''\r\n\r\nimport math\r\nprime = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97, 101, 103,\r\n 107, 109, 113, 127, 131, 137, 139, 149, 151, 157, 163, 167, 173, 179, 181, 191, 193, 197, 199, 211, 223,\r\n 227, 229, 233, 239, 241, 251, 257, 263, 269, 271, 277, 281, 283, 293, 307, 311, 313, 317, 331, 337, 347,\r\n 349, 353, 359, 367, 373, 379, 383, 389, 397, 401, 409, 419, 421, 431, 433, 439, 443, 449, 457, 461, 463,\r\n 467, 479, 487, 491, 499, 503, 509, 521, 523, 541, 547, 557, 563, 569, 571, 577, 587, 593, 599, 601, 607,\r\n 613, 617, 619, 631, 641, 643, 647, 653, 659, 661, 673, 677, 683, 691, 701, 709, 719, 727, 733, 739, 743,\r\n 751, 757, 761, 769, 773, 787, 797, 809, 811, 821, 823, 827, 829, 839, 853, 857, 859, 863, 877, 881, 883,\r\n 887, 907, 911, 919, 929, 937, 941, 947, 953, 967, 971, 977, 983, 991, 997]\r\n\r\n\r\ndef is_prime(num):\r\n if num == 1:\r\n return False\r\n flag = True\r\n for i in range(len(prime)):\r\n if num % prime[i] == 0 and num not in prime:\r\n flag = False\r\n if flag:\r\n return True\r\n\r\n\r\nn = int(input())\r\nlst = list(map(int, input().split()))\r\nans = []\r\nfor j in range(n):\r\n a = int(math.sqrt(lst[j]))\r\n if a**2 == lst[j] and is_prime(a):\r\n ans.append(\"YES\")\r\n else:\r\n ans.append(\"NO\")\r\nfor k in range(n):\r\n print(ans[k])\r\n", "import math\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 == 0:\r\n return False\r\n for i in range(3, int(math.sqrt(n)) + 1, 2):\r\n if n % i == 0:\r\n return False\r\n return True\r\n\r\nn = int(input())\r\nxl = list(map(int, input().split()))\r\nfor x in xl:\r\n if int(math.sqrt(x))**2==x:\r\n if is_prime(int(math.sqrt(x))):\r\n print('YES')\r\n else:\r\n print('NO')\r\n else:\r\n print('NO')\r\n", "input();li=[int(i) for i in input().split()];\r\nm=int(max(li)**0.5);mark=[0,0]+[1]*(m-1)\r\ndef generate(m):\r\n prime = []\r\n for i in range(2,m+1):\r\n if mark[i]:\r\n prime.append(i)\r\n for k in prime:\r\n if i*k>=m+1:break\r\n mark[i*k]=0\r\n if i%k==0:break\r\ngenerate(m)\r\nfor i in li:\r\n if i**0.5%1==0 and mark[int(i**0.5)]:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "import math\r\nn1 = 1000005\r\npa = [1]*(n1+1)\r\npa[0]= pa[1]= 0\r\nfor i in range(2, int(math.sqrt(n1)+1)):\r\n if pa[i] == 1:\r\n j =i\r\n while i*j <= n1:\r\n pa[i*j] = 0\r\n j+=1\r\n\r\nn = int(input())\r\narr = list(map(int, input().split()))\r\nfor i in range(n):\r\n s = int(math.sqrt(arr[i]))\r\n if s*s == arr[i] and pa[s] ==1:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n\r\n\r\n\r\n\r\n\r\n", "N = 1000000\r\nresults = [True]*(N+1)\r\nprimes = []\r\nresults[0] = False\r\nresults[1] = False\r\nfor i in range(2,N):\r\n if results[i]:\r\n primes.append(i)\r\n for p in primes:\r\n if i * p > N:\r\n break\r\n results[i * p] = False\r\n if i % p == 0:\r\n break\r\n\r\nn = int(input())\r\nls = list(map(int,input().split()))\r\nfor m in ls:\r\n k = int(m ** 0.5)\r\n if k ** 2 == m and results[k]:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n\r\n\r\n\r\n\r\n", "def sieve_of_eratosthenes(n):\n primes = [True] * (n + 1)\n primes[0] = primes[1] = False\n\n p = 2\n while p ** 2 <= n:\n if primes[p]:\n for i in range(p * p, n + 1, p):\n primes[i] = False\n p += 1\n\n return primes\n\ndef is_square(num):\n root = int(num ** 0.5)\n return root * root == num\n\n\nn = int(input())\nnums = list(map(int, input().split()))\n\n\nlimit = int(max(nums) ** 0.5) + 1\nprimes = sieve_of_eratosthenes(limit)\n\n\nfor num in nums:\n if is_square(num):\n root = int(num ** 0.5)\n if root == 2 or (root % 2 != 0 and primes[root]):\n print(\"YES\")\n else:\n print(\"NO\")\n else:\n print(\"NO\")\n\n\n", "n = int(input())\r\nb = list(map(int, input().split()))\r\nn=max(b)\r\nn=int(n**0.5)+10\r\na = [2]*(n+1)\r\na[0]=0\r\na[1]=1\r\nfor i in range(2, n//2+1):\r\n for j in range(i+i, n+1, i):\r\n a[j]+=1\r\n\r\nfor i in b:\r\n if i==1:print(\"NO\")\r\n elif int(i**0.5)**2==i and a[int(i**0.5)]==2:print(\"YES\")\r\n else:print(\"NO\")\r\n\r\n", "from sys import stdin\r\ndef input(): return stdin.readline()[:-1]\r\n\r\nn=1000000\r\na=[True]*n\r\ns=set()\r\nfor i in range(2,n):\r\n if a[i]:\r\n s.add(i*i)\r\n for j in range(i*i,n,i):\r\n a[j]=False\r\n\r\ndef eureka(i):\r\n if i in s:\r\n print('YES')\r\n else:\r\n print('NO')\r\n\r\ninput()\r\nl=list(map(int,input().split()))\r\nfor i in l:\r\n eureka(i)\r\n", "l=[True for i in range(999999)]\r\np=set()\r\nfor i in range(2,999999):\r\n if l[i]:\r\n p.add(i)\r\n for j in range(i+i,999999,i):\r\n l[j]=False\r\np2=set(i*i for i in p)\r\n\r\nn=int(input())\r\nx=list(map(int,input().split()))\r\nfor i in range(n):\r\n if x[i] in p2:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "\n# Version 21.0\nimport os, sys, math, itertools\nfrom collections import deque, defaultdict, OrderedDict, Counter\nfrom bisect import bisect, bisect_left, bisect_right, insort\nfrom heapq import heapify, heappush, heappop, nsmallest, nlargest, heapreplace, heappushpop\n\noffline = __debug__\nif not offline:\n import io\n input = io.BytesIO(os.read(0,os.fstat(0).st_size)).readline\n\nii = lambda : int(input())\nsi = lambda : input() \nmi = lambda : map(int,input().strip().split(\" \"))\nmsi = lambda : map(str,input().strip().split(\" \")) \nli = lambda : list(mi())\nlsi = lambda : list(msi())\nout = []\nexport = lambda : sys.stdout.write('\\n'.join(map(str, out)))\np = lambda x : out.append(x)\npp = lambda array : p(' '.join(map(str,array)))\n\ndef main() -> None:\n # 2023-10-21 21:35:32\n\n\n n = int(1e6)\n l = [True] * n\n s = set()\n for i in range(2,n):\n if l[i]:\n s.add(i*i)\n for j in range(i*i,n,i):\n l[j] = False\n length = ii()\n ll = li()\n for x in ll:\n if x not in s:\n p('NO')\n else:\n p('YES')\n \ntry: exec('from hq import *\\nexec(cc)')\nexcept (FileNotFoundError, ModuleNotFoundError): main(); export()\n\t \t\t \t\t\t \t\t\t\t\t \t\t \t \t \t", "import math\r\n\r\ndef sieve_of_eratosthenes(n):\r\n primes = [False, False] + [True] * (n-1)\r\n p = 2\r\n while p * p <= n:\r\n if primes[p] == True:\r\n for i in range(p * p, n+1, p):\r\n primes[i] = False\r\n p += 1\r\n return primes\r\n\r\ndef is_t_prime(n, primes):\r\n sqr = math.sqrt(n)\r\n return sqr == int(sqr) and primes[int(sqr)]\r\n\r\n# Generate all primes up to sqrt(10^12)\r\nprimes = sieve_of_eratosthenes(int(math.sqrt(10**12)))\r\n\r\nn = int(input())\r\nnumbers = list(map(int, input().split()))\r\n\r\nfor number in numbers:\r\n if is_t_prime(number, primes):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")" ]

[ "import heapq\r\nf=lambda:map(int,input().split())\r\nn,k=f()\r\np=[0]*k\r\nq=[0]*n\r\nfor i in range(n):\r\n s,m=f()\r\n q[i]=max(p[0],s)+m\r\n heapq.heapreplace(p,q[i])\r\nprint(' '.join(map(str,q)))", "import heapq\nn, k = map(int, input().split())\npq = [0] * k\nres = [None] * n\nfor i in range(n):\n s, m = map(int, input().split())\n time = max(pq[0], s) + m\n heapq.heapreplace(pq, time)\n res[i] = time\nprint(\"\\n\".join(map(str, res))) ", "\r\nfrom sys import stdin, stdout\r\nlines = stdin.readlines()\r\n\r\n\r\nfrom random import random\r\nfrom time import time\r\n\"\"\"\r\nn = 500000 \r\nk = 33279\r\nlines = [( str(n)+' '+str(k) )]\r\nfor i in range(n):\r\n x = int(random()*100000)\r\n y = 1000000000 + int(random()*10000)\r\n lines.append( str(x)+' '+str(y) )\r\n\"\"\" \r\nt1 = time()\r\n\r\nn, k = int(lines[0].split()[0]), int(lines[0].split()[1])\r\na = [int(x.split()[0]) for x in lines[1:]]\r\nb = [int(x.split()[1]) for x in lines[1:]]\r\n\r\nimport heapq\r\nheap = []\r\n \r\n#heap = PriorityQueueSet()\r\nfree_servers = k\r\nanswers = []\r\n#global_minimum = 0\r\nheap = [a[i]+b[i] for i in range(k)]\r\nanswers = heap[:]\r\nheapq.heapify(heap)\r\n\"\"\"\r\nanswers = []\r\nfor i in range(k):\r\n will_load = int(a[i]+b[i])\r\n heap.push(will_load, str(will_load))\r\n answers.append(will_load)\r\n\"\"\"\r\nfor i in range(k,n):\r\n \r\n cur_min = int(heapq.heappop(heap))\r\n will_load = int(max(cur_min, a[i])+b[i]) #11111111\r\n heapq.heappush(heap, will_load)\r\n #print(will_load)\r\n answers.append(will_load)\r\n\r\nt2 = time()\r\n#print(t2-t1)\r\n\r\nstdout.write('\\n'.join([str(x) for x in answers])) ", "from sys import stdin, stdout\r\nimport heapq\r\nlines = stdin.readlines()\r\n\r\nn, k = int(lines[0].split()[0], 10), int(lines[0].split()[1], 10)\r\na = [int(x.split()[0], 10) for x in lines[1:]]\r\nb = [int(x.split()[1], 10) for x in lines[1:]]\r\n\r\nheap = [a[i]+b[i] for i in range(k)]\r\nanswers = heap[:]\r\nheapq.heapify(heap)\r\n\r\nfor i in range(k,n):\r\n will_load = int(max(int(heapq.heappop(heap)), a[i])+b[i]) #11111111\r\n heapq.heappush(heap, will_load)\r\n answers.append(will_load)\r\n\r\nstdout.write('\\n'.join([str(x) for x in answers])) ", "import sys\r\ninput = sys.stdin.readline\r\nrInt = lambda: int(input())\r\nmInt = lambda: map(int, input().split())\r\nrList = lambda: list(map(int, input().split()))\r\n\r\nn, k = mInt()\r\ninp = []\r\nfor i in range(n):\r\n inp.append(rList())\r\n\r\navail = k\r\n\r\nfrom heapq import *\r\nevents = []\r\n\r\nfrom collections import deque\r\nqueue = deque()\r\n\r\nout = [-1] * n\r\n\r\nheappush(events, (inp[0][0], 1, 0))\r\nwhile events:\r\n nex = heappop(events)\r\n if nex[1]:\r\n queue.append(nex[2])\r\n if nex[2] < n - 1:\r\n heappush(events, (inp[nex[2] + 1][0], 1, nex[2] + 1))\r\n else:\r\n avail += 1\r\n\r\n t = nex[0]\r\n while avail and queue:\r\n avail -= 1\r\n nex = queue.popleft()\r\n end = t + inp[nex][1]\r\n out[nex] = end\r\n heappush(events, (end, 0))\r\n \r\nprint(*out, sep='\\n')\r\n", "import sys\r\ninput = lambda: sys.stdin.readline().rstrip()\r\nfrom heapq import *\r\n\r\nN,K = map(int, input().split())\r\nv = [0]*K\r\nfor _ in range(N):\r\n s,m = map(int, input().split())\r\n t = heappop(v)\r\n d = max(s,t)\r\n print(d+m)\r\n heappush(v,d+m)\r\n \r\n \r\n\r\n", "import sys\r\ninput = sys.stdin.readline\r\nfrom heapq import heappop, heappush\r\n\r\nn, k = map(int, input().split())\r\nd = []\r\nfor _ in range(n):\r\n a, b = map(int, input().split())\r\n if k > 0:\r\n k -= 1\r\n heappush(d, a+b)\r\n print(a+b)\r\n else:\r\n x = max(heappop(d), a)\r\n print(x+b)\r\n heappush(d, x+b)\r\n" ]

[ "total_contestants = int(input())\r\n\r\nfinal_scores = {}\r\n\r\nfor _ in range(total_contestants):\r\n handle, successful_hacks, unsuccessful_hacks, *problem_values = input().split() \r\n\r\n successful_hacks = int(successful_hacks)\r\n unsuccessful_hacks = int(unsuccessful_hacks)\r\n\r\n final_scores[handle] = (successful_hacks * 100) - (unsuccessful_hacks * 50) + sum([int(x) for x in problem_values])\r\n\r\nhighest_score = max(list(final_scores.values()))\r\n\r\nhandle_with_highest_score = {handle : score_value for (handle, score_value) in final_scores.items() if score_value == highest_score}\r\n\r\nprint(list(handle_with_highest_score.keys())[0])\r\n\r\n", "n=int(input())\r\nline=[]\r\nline1=[]\r\nline_i=[]\r\nleader={}\r\n\r\nfor i in range(n):\r\n line.append(input())\r\n line1.append([s for s in line[i].split()])\r\n for j in range(7):\r\n #print(line1[i][j+1])\r\n line_i.append(int(line1[i][j+1]))\r\n #print(line_i)\r\n sum1=line_i[0]*100-line_i[1]*50\r\n for k in range(5):\r\n sum1+=line_i[k+2]\r\n leader[line1[i][0]]=sum1\r\n line_i.clear()\r\n #print(leader)\r\nkeys=[key for key,value in leader.items() if value==max(leader.values())]\r\nprint(keys[0])\r\n ", "n=int(input())\r\nr=[]\r\np=[]\r\nfor i in range(n):\r\n a=input()\r\n a=a.split()\r\n p.append(a[0])\r\n t=0\r\n t+=int(a[3])+int(a[4])+int(a[5])+int(a[6])+int(a[7])\r\n x=100*int(a[1])\r\n x-=50*int(a[2])\r\n t+=x\r\n r.append(t)\r\nz=r.index(max(r))\r\nprint(p[z])\r\n", "__author__ = 'asmn'\r\nn=int(input())\r\nmaxscore=-1000000\r\nwinner=''\r\nfor i in range(n):\r\n s=input().split()\r\n score=sum(map(int,s[3:]))+100*int(s[1])-50*int(s[2])\r\n if score>maxscore:\r\n maxscore=score\r\n winner=s[0]\r\n\r\nprint(winner)\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#to print fast\r\n#pt = lambda x: sys.stdout.write(str(x)+'\\n')\r\n\r\n#--------------------------------WhiteHat010--------------------------------------#\r\nn = get_int()\r\nd = {}\r\nfor i in range(n):\r\n lst = get_string().split()\r\n d[lst[0]] = list(map(int,lst[1:]))\r\n\r\nscore = []\r\nfor i,v in d.items():\r\n score.append( (v[0]*100 - v[1]*50 + v[2] + v[3] + v[4] + v[5] + v[6], i) )\r\n#print(score)\r\nprint(max(score)[1])\r\n", "# bsdk idhar kya dekhne ko aaya hai, khud kr!!!\r\n# import math\r\n# from itertools import *\r\n# import random\r\n# import calendar\r\n# import datetime\r\n# import webbrowser\r\n\r\nleader = []\r\nleader_name = []\r\nn = int(input())\r\nfor i in range(n):\r\n s = input().split()\r\n total_points = int(s[3]) + int(s[4]) + int(s[5]) + int(s[6]) + int(s[7]) + int(s[1]) * 100 - int(s[2]) * 50\r\n leader.append(total_points)\r\n leader_name.append(s[0])\r\ntemp = max(leader)\r\nprint(leader_name[leader.index(temp)])\r\n", "#I = lambda: [int(i) for i in input().split()]\r\n#import io, os, sys\r\n#input = io.BytesIO(os.read(0,os.fstat(0).st_size)).readline\r\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,deque\r\n#from heapq import heappush,heappop,heapify\r\nimport sys\r\nimport math\r\nimport bisect\r\nfrom collections import deque\r\nn = int(input())\r\nl = []\r\nfor _ in range(n):\r\n l.append(list(map(str,input().split())))\r\nh =[]\r\nfor i in range(n):\r\n s = 0\r\n for j in range(1,len(l[i])):\r\n x = int(l[i][j])\r\n if j==1:\r\n s+=100*x\r\n elif j==2:\r\n s-=50*x\r\n else:\r\n s+=x\r\n h.append([s,l[i][0]])\r\nh.sort()\r\nprint(h[-1][1])\r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n \r\n \r\n \r\n \r\n \r\n \r\n\r\n\r\n \r\n \r\n \r\n\r\n\r\n\r\n\r\n\r\n\r\n \r\n", "n=int(input())\r\nans=-999999999\r\nfor i in range(n):\r\n q=input().split()\r\n s=q[0]\r\n p,m,a,b,c,d,e=map(int,q[1:])\r\n k=p*100-m*50+a+b+c+d+e\r\n if k>ans:\r\n ans=k\r\n anss=s\r\nprint(anss)\r\n \r\n", "import math\r\nresult=[\"x\",-math.inf]\r\nfor x in range(int(input())):\r\n l=[int(x) if x.isnumeric() else x for x in input().split()]\r\n target=(sum(l[3:])+100*l[1]-50*l[2])\r\n if result[1]<target:\r\n result=[l[0],target]\r\n \r\nprint(result[0])", "a=[input().split() for i in range(int(input()))]\r\nprint(sorted([[100*int(a[i][1])-50*int(a[i][2])+int(a[i][3])+int(a[i][4])+int(a[i][5])+int(a[i][6])+int(a[i][7]),a[i][0]] for i in range(len(a))])[-1][1])", "import math, re, sys, string, operator, functools, fractions, collections\nsys.setrecursionlimit(10**7)\ndX= [-1, 1, 0, 0,-1, 1,-1, 1]\ndY= [ 0, 0,-1, 1, 1,-1,-1, 1]\nRI=lambda x=' ': list(map(int,input().split(x)))\nRS=lambda x=' ': input().rstrip().split(x)\nmod=int(1e9+7)\neps=1e-6\n#################################################\nn=RI()[0]\nmaxVal=-10**9\nans=\"\"\nfor i in range(n):\n h,p,m,A,B,C,D,E = RS()\n val=int(A)+int(B)+int(C)+int(D)+int(E)+int(p)*100 - int(m)*50\n if val>maxVal:\n maxVal=val\n ans=h\nprint(ans)\n \n \n \n", "d = {}\r\nn = int(input())\r\nfor i in range(n):\r\n\ta = input().split()\r\n\tmarks = int(a[1])*100 - int(a[2])*50 + int(a[3]) + int(a[4]) + int(a[5]) + int(a[6]) + int(a[7])\r\n\td[a[0]] = marks\r\nmax1 = float(\"-inf\")\r\nfor i in d:\r\n\tif max1 < d[i]:\r\n\t\tmax1 = max(max1,d[i])\r\n\t\tt = i\r\nprint(t)", "n = int(input())\r\n\r\nh, p = [], []\r\n\r\nfor i in range(n):\r\n\tx = input().split()\r\n\th.append(x[0])\r\n\tp.append((int(x[1]) * 100) - (int(x[2]) * 50) + sum(list(map(int, x[3:]))))\r\n\t\r\nprint(h[p.index(max(p))])", "'''input\n2\nminus_one 0 4 199 0 0 0 0\nminus_two 0 4 198 0 0 0 0\n'''\nm, name = -1000000000000, \"\" \nfor _ in range(int(input())):\n\th, plus, minus, a, b, c, d, e = input().split()\n\ts = 100*int(plus) - 50*int(minus) + int(a) + int(b) + int(c) + int(d) + int(e)\n\tif s > m:\n\t\tm = s\n\t\tname = h\nprint(name)\n\n\n\n\n\n\n\n", "res = []\nfor _ in range(int(input())):\n s, *l = input().split()\n p, m, *l = map(int, l)\n res.append((p * 100 - m * 50 + sum(l), s))\nprint(max(res)[1])\n", "def get_points(person: list):\n points = sum(int(item) for item in person[3:])\n return int(person[1])*100 - int(person[2])*50 + points\n\n\nn = int(input())\npeople = input().split()\nnick = people[0]\nmax_point = get_points(people)\n\n\nfor _ in range(n-1):\n people = input().split()\n if get_points(people) > max_point:\n nick = people[0]\n max_point = get_points(people)\n\n\nprint(nick)\n\n\n", "n=int(input())\r\nname=''\r\ntotal=0\r\nfor i in range(n):\r\n tname,plus,minus,a,b,c,d,e=map(str,input().split(' '))\r\n temp=int(a)+int(b)+int(c)+int(d)+int(e)+(int(plus)*100)-(int(minus)*50)\r\n \r\n if(i==0):\r\n name=tname\r\n total=temp\r\n else:\r\n if(total<temp):\r\n name=tname\r\n total=temp\r\nprint(name)\r\n \r\n ", "\r\n# Author : code_marshal\r\n\r\nparticipants,scores=[],[]\r\nfor _ in range(int(input())):\r\n x,s_h,u_h,a,b,c,d,e=map(str,input().split())\r\n sm=int(a)+int(b)+int(c)+int(d)+int(e)\r\n participants.insert(0,x)\r\n scores.insert(0,int(s_h)*100-int(u_h)*50+sm)\r\nprint (participants[scores.index(max(scores))])\r\n", "def room_leader():\n a = int(input())\n tabela_participantes = [input().split() for _ in range(a)]\n\n scores = []\n for p in tabela_participantes:\n scores.append(calcula_pontuacao(p))\n\n scores.sort(reverse=True, key=lambda y: y[1]) \n print(scores[0][0])\n\ndef calcula_pontuacao(participante):\n atual = 0\n nome = \"\"\n for count,part in enumerate(participante):\n if(count>0):\n part = int(part)\n\n if(count==0):\n nome = part\n elif(count==1):\n atual += 100*part\n elif(count==2):\n atual -= 50*part\n else:\n atual += part\n return (nome, atual)\n\n\nroom_leader()\n\n\n\t \t \t \t \t\t\t\t \t \t\t\t\t\t\t \t\t\t", "n = int(input())\r\nmax_a = -10000000\r\nlid = ''\r\nfor el in range(n):\r\n par = input().split()\r\n name = par[0]\r\n a = int(par[1]) * 100 - int(par[2]) * 50 + int(par[3]) + int(par[4]) + int(par[5]) + int(par[6]) + int(par[7])\r\n if a > max_a:\r\n lid = par[0]\r\n max_a = a\r\nprint(lid)", "\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\na=[]\r\nfor s in [*open(0)][1:]:\r\n s=s.split()\r\n a+=[[s[0],*map(int,s[1:])]]\r\nprint(max(a,key=lambda x:x[1]*100-x[2]*50+sum(x[3:]))[0])", "n=int(input())\r\ncdfs=[]\r\nfor c in range(n):\r\n\ts=input().split(' ')\r\n\tnums=[int(x) for x in s[1:]]\r\n\tcdfs.append((s[0],sum(nums[2:])+sum([x*(2-c)*50*(1-2*c) for c,x in enumerate(nums[:2])])))\r\nprint(max(cdfs,key=lambda x: x[1])[0])", "# leader\r\n\r\nn = int(input())\r\ndata = [input().split() for i in range (n)]\r\n\r\nscores = []\r\nfor i in data:\r\n a = int(i[1]) * 100\r\n a -= int(i[2]) * 50\r\n a += int(i[3]) + int(i[4]) + int(i[5])\r\n a += int(i[6]) + int(i[7])\r\n scores.append(a)\r\n\r\nprint(data[scores.index(max(scores))][0])", "I=lambda x: list(map(int,x))\r\nn=int(input())\r\na=[0]*n\r\nb=[0]*n\r\nfor i in range(n):\r\n x=list(input().split())\r\n a[i]=x[0]\r\n b[i]=sum(I(x[3:]))+100*int(x[1])-50*int(x[2])\r\nprint(a[b.index(max(b))])", "#room leader\r\nt=int(input())\r\nparticipant=[]\r\nscore=[]\r\nfor i in range(0,t):\r\n a=list(input().split())\r\n participant.append(a[0])\r\n a.remove(a[0])\r\n a=[int(u) for u in a]\r\n s=a[0]*100-a[1]*50+sum(a[2:])\r\n score.append(s)\r\nfor x,y in zip(participant,score):\r\n if y==max(score):\r\n print(x)\r\n \r\n ", "has = dict()\r\n\r\nfor _ in range(int(input())):\r\n x = input().split()\r\n point = 100 * int(x[1]) - 50 * int(x[2]) + int(x[3]) + int(x[4]) + int(x[5]) + int(x[6]) + int(x[7])\r\n has[x[0]] = point\r\n\r\nprint(max(has, key=has.get))\r\n", "def main():\n res = []\n for _ in range(int(input())):\n s, *l = input().split()\n res.append((sum(x * y for x, y in zip(map(int, l), (100, -50, 1, 1, 1, 1, 1))), s))\n print(max(res)[1])\n\n\nif __name__ == '__main__':\n main()\n", "n = int(input())\r\nans = []\r\nb = []\r\nfor i in range(n):\r\n a = list(map(str,input().split()))\r\n for j in range(1,8): a[j] = int(a[j])\r\n b.append(sum(a[3:])+a[1]*100-a[2]*50)\r\n b.append(a[0])\r\n ans.append(b)\r\n b = []\r\nans.sort()\r\nprint(ans[-1][1])", "n=int(input())\r\nlst=[]\r\nlst1=[]\r\nfor i in range(n):\r\n n1=list(map(str,input().split()))\r\n w=int(n1[1])*100\r\n v=int(n1[2])*50\r\n s=w-v\r\n for j in n1[3:]:\r\n s=s+int(j)\r\n lst.append(s)\r\n lst1.append(n1[0])\r\nb=lst.index(max(lst))\r\nprint(lst1[b])\r\n\r\n", "n = int(input())\r\ndetails = []\r\nfor _ in range(n):\r\n name, phack, nhack, a, b, c, d, e = input().split()\r\n details.append((name, int(phack)*100-int(nhack)*50+int(a)+int(b)+int(c)+int(d)+int(e)))\r\n \r\ndetails = sorted(details, key=lambda item: item[1])\r\nprint(details[n-1][0])", "n = int(input())\r\nans = ''\r\nmx = -10 ** 100\r\nfor i in range(n):\r\n k = input().split()\r\n score = int(k[1]) * 100 - int(k[2]) * 50 + int(k[3]) + int(k[4]) + int(k[5]) + int(k[6]) + int(k[7])\r\n if score > mx:\r\n mx = score\r\n ans = k[0]\r\nprint(ans)\r\n", "import math , itertools , fractions , random\r\nsi = lambda : input() \r\nI = lambda : int(input()) \r\nar = lambda : list(map(int , input().split())) \r\nal = lambda : map(int , input().split()) \r\nals = lambda : map(str , input().split()) \r\nars = lambda : list(map(str , input().split()))\r\n'''\r\n⠀⠀⠀⠀⠀⠀⠀⢀⣤⣴⣶⣶⣶⣶⣶⣦⣄⠀⠀⠀⠀⠀⠀⠀⠀⠀\r\n⠀⠀⠀⠀⠀⠀⢀⣾⠟⠛⢿⣿⣿⣿⣿⣿⣿⣷⠀⠀⠀⠀⠀⠀⠀⠀\r\n⠀⠀⠀⠀⠀⠀⢸⣿⣄⣀⣼⣿⣿⣿⣿⣿⣿⣿⠀⢀⣀⣀⣀⡀⠀⠀\r\n⠀⠀⠀⠀⠀⠀⠈⠉⠉⠉⠉⠉⠉⣿⣿⣿⣿⣿⠀⢸⣿⣿⣿⣿⣦⠀\r\n⠀⣠⣾⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⠀⢸⣿⣿⣿⣿⣿⡇\r\n⢰⣿⣿⣿⣿⣿⣿⣿⣿⠿⠿⠿⠿⠿⠿⠿⠿⠋⠀⣼⣿⣿⣿⣿⣿⡇\r\n⢸⣿⣿⣿⣿⣿⡿⠉⢀⣠⣤⣤⣤⣤⣤⣤⣤⣴⣾⣿⣿⣿⣿⣿⣿⡇\r\n'''\r\ncnt1 = [] ; cnt2 = [] \r\nfor _ in range(I()) :\r\n arr = ars()\r\n cnt1.append(arr[0])\r\n x = sum(list(map(int , arr[3::]))) + int(arr[1])*100 - int(arr[2])*50\r\n cnt2.append(x)\r\nprint(cnt1[cnt2.index(max(cnt2))])\r\n'''\r\n⢸⣿⣿⣿⣿⣿⡇⠀⣾⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⡿⠀\r\n⠘⣿⣿⣿⣿⣿⡇⠀⣿⣿⣿⣿⣿⠛⠛⠛⠛⠛⠛⠛⠛⠛⠋⠁⠀⠀\r\n⠀⠈⠛⠻⠿⠿⠇⠀⣿⣿⣿⣿⣿⣿⣿⣿⠿⠿⣿⡇⠀⠀⠀⠀⠀⠀\r\n⠀⠀⠀⠀⠀⠀⠀⠀⣿⣿⣿⣿⣿⣿⣿⣧⣀⣀⣿⠇⠀⠀⠀⠀⠀⠀\r\n⠀⠀⠀⠀⠀⠀⠀⠀⠘⢿⣿⣿⣿⣿⣿⣿⣿⡿⠋⠀⠀⠀⠀⠀⠀⠀\r\n'''", "n = int(input())\r\ndic = {}\r\nl = []\r\n\r\nfor i in range(n):\r\n s, suc, uns, a, b, c, d, e = map(str, input().split())\r\n suc = int(suc)\r\n uns = int(uns)\r\n a = int(a)\r\n b = int(b)\r\n c = int(c)\r\n d = int(d)\r\n e = int(e)\r\n \r\n bod = suc * 100 - uns * 50 + a + b + c + d + e\r\n dic.update({bod : s})\r\n l.append(bod)\r\n\r\nprint(dic[max(l)])\r\n", "\r\nt=int(input())\r\nname=[]\r\npoints=[]\r\nwhile t:\r\n\tarr=list(map(str,input().split()))\r\n\tname.append(arr[0])\r\n\tsum=int(arr[1])*100-int(arr[2])*50\r\n\tfor i in range(3,8):\r\n\t\tsum+=int(arr[i])\r\n\tpoints.append(sum)\r\n\tt-=1\r\nmax_point=max(points)\r\nfor i in range(len(points)):\r\n\tif max_point==points[i]:\r\n\t\tprint(name[i])\r\n\t\tbreak\r\n\t\t\t\t\t\t#unknown_2433", "def q74a():\n\tn = int(input())\n\tnames = []\n\tscores = []\n\tfor _ in range(n):\n\t\tarr = input().split()\n\t\tnames.append(arr[0])\n\t\tscores.append(int(arr[1]) * 100 + int(arr[2]) * -50 + int(arr[3]) + int(arr[4]) + int(arr[5]) + int(arr[6]) + int(arr[7]))\n\tprint(names[scores.index(max(scores))])\n\nq74a()", "\n\nans = ['', -10e9]\nfor _ in range(int(input())):\n l = [x for x in input().split()]\n nc = l[0]\n res = int(l[1])*100 - int(l[2])*50 + sum([int(x) for x in l[3:]])\n if res > ans[1]:\n ans[0], ans[1] = nc, res\nprint(ans[0])\n", "a = []\nfor x in range(int(input())):\n\tb = list(input().split())\n\tc = 0\n\tfor x in b[3:]:\n\t\tc += int(x)\n\tc += (int(b[1]) * 100) - (int(b[2]) * 50)\n\tif a == [] or a[-1] < c:\n\t\ta = []\n\t\ta.append(b[0])\n\t\ta.append(c)\nprint(a[0])", "n = int(input())\r\nfinalleader = \"\"\r\nmaximum = -10 ** 18\r\nfor i in range(0, n):\r\n a = list(map(str, input().split()))\r\n d = a[0]\r\n e = (100 * int(a[1])) - (50 * int(a[2]))\r\n e = e + int(a[3]) + int(a[4]) + int(a[5]) + int(a[6]) + int(a[7])\r\n if e > maximum:\r\n maximum = e\r\n finalleader = d\r\nprint(finalleader)", "n=int(input())\r\nl=[]\r\nfor i in range(n):\r\n d=list(input().split())\r\n s=0\r\n for i in range(1,8):\r\n if(i==1):\r\n s=s+int(d[i])*100\r\n if(i==2):\r\n s=s-int(d[2])*50\r\n else:\r\n s=s+int(d[i])\r\n l.append([s,d[0]])\r\nl.sort()\r\nprint(l[-1][1])\r\n", "n = int(input())\r\nT, S = '', -1000000000000\r\nfor i in range(n):\r\n t = input().split()\r\n s = int(t[1]) * 100 - int(t[2]) * 50 + int(t[3]) + int(t[4]) + int(t[5]) + int(t[6]) + int(t[7])\r\n if s > S: T, S = t[0], s\r\nprint(T)", "po=[]\r\nt=[]\r\nfor i in range(int(input())):\r\n h,p,m,a,b,c,d,e=list(input().split())\r\n po.append(h)\r\n t.append(int(p)*100-int(m)*50+int(a)+int(b)+int(c)+int(d)+int(e))\r\nm=t.index(max(t))\r\nprint(po[m])\r\n \r\n", "n = int(input().strip())\nl = ''\nw = -10000000\n\nfor i in range(n):\n a = [k for k in input().strip().split()]\n name = a[0]\n pl, mn, ai, bi, ci, di, ei = [int(k) for k in a[1:]]\n points = pl * 100 - 50 * mn + ai + bi + ci + di + ei\n if points > w:\n w = points\n l = name\n\nprint(l)\n\n\t \t \t \t\t \t\t\t \t \t\t\t \t\t \t \t", "def main():\r\n n = int(input())\r\n max_points = -50 * 50 - 1\r\n res = None\r\n for _ in range(n):\r\n fields = input().split()\r\n handle = fields[0]\r\n plus, minus, a, b, c, d, e = map(int, fields[1:])\r\n points = 100 * plus - 50 * minus + a + b + c + d + e\r\n if points > max_points:\r\n res = handle\r\n max_points = points\r\n\r\n print(res)\r\n \r\n\r\n \r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "n=int(input())\r\nd={}\r\nfor i in range(n):\r\n l=[str(x) for x in input().split()]\r\n points=(int(l[1])*100)-(int(l[2])*50)+int(l[3])+int(l[4])+int(l[5])+int(l[6])+int(l[7])\r\n d[l[0]]=points\r\nm=max(d.values())\r\nfor i in d:\r\n if d[i]==m:\r\n print(i)\r\n break", "n = int(input())\r\n\r\nmemo = {}\r\nfor i in range(n):\r\n data = input().split()\r\n memo[data[0]] = 100 * int(data[1]) - 50 * int(data[2]) + sum(map(int, data[3:]))\r\n\r\nprint(sorted(memo.keys(), key=lambda x:memo[x])[-1])", "t=int(input())\r\nli=[]\r\nfor i in range(t):\r\n\tm=input().split()\r\n\tsum1=0\r\n\tsum1=int(m[1])*100-int(m[2])*50+int(m[3])+int(m[4])+int(m[5])+int(m[6])+int(m[7])\r\n\tli.append([m[0],sum1])\r\nli.sort(key=lambda x:x[1])\r\nprint(li[-1][0])", "n = int(input())\nr = dict()\nfor _ in range(n):\n s = input().split()\n handle = s[0]\n h1,h2,a,b,c,d,e = map(int,s[1:])\n h1 = min(max(0,h1),50)\n h2 = min(max(0,h2),50)\n a = min(max(150,a),500) if a>0 else 0\n b = min(max(300,b),1000) if b>0 else 0\n c = min(max(450,c),1500) if c>0 else 0\n d = min(max(600,d),2000) if d>0 else 0\n e = min(max(750,e),2500) if e>0 else 0\n r[handle] = h1*100-h2*50+a+b+c+d+e\nprint(max(r, key=r.get))", "\n\nn = int(input())\n\npart = []\n\nfor _ in range(n):\n handle, plus, minus, a, b, c, d, e = input().split()\n part.append((int(plus) * 100 - int(minus) * 50 + int(a) + int(b)\n + int(c) + int(d) + int(e), handle))\n\npart.sort()\n\nprint(part[-1][1])\n\n\n\n\n", "n = int(input())\r\nnik = []\r\nball = []\r\nfor i in range(n):\r\n a = input().split()\r\n nik.append(a[0])\r\n ball.append((int(a[1])*100) - (int(a[2])*50) + int(a[3]) + int(a[4]) + int(a[5]) + int(a[6]) + int(a[7]))\r\nprint(nik[ball.index(max(ball))])\r\n", "n = int(input())\r\nparticipants = []\r\n\r\nfor _ in range(n):\r\n handle, plus, minus, a, b, c, d, e = input().split()\r\n plus = int(plus)\r\n minus = int(minus)\r\n a = int(a) if a != '0' else 0\r\n b = int(b) if b != '0' else 0\r\n c = int(c) if c != '0' else 0\r\n d = int(d) if d != '0' else 0\r\n e = int(e) if e != '0' else 0\r\n total_points = plus * 100 - minus * 50 + a + b + c + d + e\r\n participants.append((handle, total_points))\r\n\r\nparticipants.sort(key=lambda x: (-x[1], x[0])) # Sort by total points (descending) and then by handle (ascending)\r\nleader = participants[0]\r\n\r\nprint(leader[0]) # Print the handle of the leader\r\n", "d=dict()\r\nfor _ in range(int(input())):\r\n\tl1=input().split()\r\n\tl=list(map(int,l1[1:]))\r\n\tz=(l[0]*100)-(l[1]*50)+sum(l[2:])\r\n\td[z]=l1[0]\r\nprint(d[max(d)])", "#RAVENS #TEAM_2 #ESSI-DAYI_MOHSEN-LORENZO\nM = -float('inf')\nfor i in range(int(input())):\n p = list(map(str,input().split()))\n yy=((int(p[1])*100)-(int(p[2])*50))+int(p[3])+int(p[4])+int(p[5])+int(p[6])+int(p[7])\n if yy > M:\n M = yy\n name=p[0]\nprint(name)\n", "b=[]\r\nc=[]\r\nfor i in range(int(input())):\r\n s=input()\r\n a=s.split(\" \")\r\n x=int(a[1])*100\r\n x=x-int(a[2])*50\r\n for i in range(3,len(a)):\r\n x=x+int(a[i])\r\n b.append(a[0])\r\n c.append(x)\r\nx=c.index(max(c))\r\nprint(b[x])\r\n", "l1=[]\r\nl2=[]\r\nn=int(input())\r\nfor i in range(n):\r\n\ts=input().split()\r\n\tl1.append(s[0])\r\n\ts.pop(0)\r\n\ts=list(map(int,s))\r\n\ts[0]*=100\r\n\ts[1]*=-50\r\n\t# print(s)\r\n\tl2.append(sum(s))\r\n# print(l2)\r\nprint(l1[l2.index(max(l2))])", "def calcPoints(l):\n return l[0]*100 - l[1]*50 + sum(l[2:len(l)])\nn = int(input())\np = dict()\nfor _ in range(n):\n x = input().split()\n p[x[0]] = list(map(int, x[1: len(x)]))\nw = dict()\nfor c in p:\n w[c] = calcPoints(p[c])\nleader = ''\npoints = float('-inf')\nfor c in w:\n if w[c] > points:\n leader = c\n points = w[c]\nprint(leader)\n\t \t \t \t \t\t\t\t \t\t \t \t \t\t\t\t", "n=int(input())\ncontestants=[]\nfor i in range(n):\n entrada=input().split()\n name=entrada[0]\n count=int(entrada[1])*100-int(entrada[2])*50+int(entrada[3])+int(entrada[4])+int(entrada[5])+int(entrada[6])+int(entrada[7])\n contestants.append([count,name])\ncontestants.sort(key=lambda contestant:contestant[0])\nprint(contestants[-1][1])\n\t \t \t \t \t \t \t \t", "val = []\r\nfor i in range(int(input())):\r\n p = input().split()\r\n h = p.pop(0)\r\n s = [int(x) for x in p]\r\n val.append((s[0] * 100 - s[1] * 50 + sum(s[2:]), h))\r\nprint(sorted(val)[-1][1])", "MyDict = {}\r\nfor i in range(int(input())):\r\n Temp = input().split()\r\n X = list(map(int, Temp[1:]))\r\n MyDict[Temp[0]] = X[0] * 100 - X[1] * 50 + sum(X[2:])\r\nprint(list(MyDict.keys())[list(MyDict.values()).index(max(MyDict.values()))])\r\n\r\n# UB_CodeForces\r\n# Advice: Falling down is an accident, staying down is a choice\r\n# Location: Here in Bojnurd\r\n# Caption: So Close man!! Take it easy!!!!\r\n# CodeNumber: 657\r\n", "n = int(input())\r\nlst = {}\r\nmx = []\r\n\r\nfor _ in range(n):\r\n nick , plus , minus , a , b , c , d , e = map(str , input().split())\r\n points = (int(a) + int(b) + int(c) + int(d) + int(e) + (int(plus)*100)) - (int(minus)*50)\r\n lst[points] = nick\r\n mx.append(points)\r\n\r\nprint( lst[max(mx)] )", "puntaje_maximo = None\r\nnombre_ganador = None\r\n\r\nn = int(input())\r\n\r\nfor i in range(n):\r\n resultado_competencia = input().split()\r\n handle = resultado_competencia[0]\r\n plus = int(resultado_competencia[1])\r\n minus = int(resultado_competencia[2])\r\n a = int(resultado_competencia[3])\r\n b = int(resultado_competencia[4])\r\n c = int(resultado_competencia[5])\r\n d = int(resultado_competencia[6])\r\n e = int(resultado_competencia[7])\r\n puntaje = plus*100 + minus*(-50) + a + b + c + d + e\r\n if puntaje_maximo is None or puntaje_maximo < puntaje:\r\n puntaje_maximo = puntaje\r\n nombre_ganador = handle\r\n\r\nprint(nombre_ganador)\r\n", "n=int(input())\r\nnamal=[]\r\npoint=[]\r\nfor i in range(n):\r\n\tnama,plus,minus,a,b,c,d,e=map(str,input().split())\r\n\tplus=int(plus)\r\n\tminus=int(minus)\r\n\ta=int(a)\r\n\tb=int(b)\r\n\tc=int(c)\r\n\td=int(d)\r\n\te=int(e)\r\n\thasil=(plus*100-minus*50)+a+b+c+d+e\r\n\tnamal.append(nama)\r\n\tpoint.append(hasil)\r\nindeks=point.index(max(point))\r\nprint(namal[indeks])", "if __name__ == '__main__':\r\n n = int(input())\r\n maior = -10e10\r\n for i in range(n):\r\n t = [x for x in input().split()]\r\n s = t.pop(0)\r\n t = [int(x) for x in t]\r\n novo_maior = (t[0]*100) - (t[1]*50) + sum(t[2:])\r\n if novo_maior > maior:\r\n maior = novo_maior\r\n name = s\r\n print(name)", "class Contestant:\n def __init__(self, handle, points):\n self.handle = handle\n self.points = points\n\nn = int(input())\ncontestants = n * [ None ]\nfor i in range(n):\n data = input().split()\n handle = data[0]\n data = list(map(int, data[1:]))\n points = data[0] * 100 - data[1] * 50 + sum(data[2:])\n contestants[i] = Contestant(handle, points)\n\ncontestants.sort(key = lambda contestant: -contestant.points)\nprint(contestants[0].handle)\n", "def vzlomy(lst):\r\n a = list()\r\n for elem in lst:\r\n a.append(tuple((100 * int(elem[1]) - 50 * int(elem[2]) + int(elem[3]) + int(elem[4]) + int(elem[5]) + int(\r\n elem[6]) + int(elem[7]), elem[0])))\r\n return max(a, key=lambda item: item[0])[1]\r\n\r\n\r\nn = int(input())\r\nz = list()\r\nfor i in range(n):\r\n s = input().split()\r\n z.append(s)\r\nprint(vzlomy(z))\r\n", "n = int(input())\r\nall_cont = {}\r\nfor i in range(n):\r\n cont = input().split()\r\n cont_scores = list(map(int,cont[1:]))\r\n all_cont[cont_scores[0]*100 - cont_scores[1]*50 + sum(cont_scores[2:])] = cont[0]\r\nprint(all_cont[max(all_cont.keys())])", "max = [0,'']\r\nfor j in range(int(input())):\r\n temp = 0\r\n something = input().split()\r\n name = something[0]\r\n temp += int(something[1]) * 100\r\n temp -= int(something[2]) * 50\r\n for i in range(3,8):\r\n temp += int(something[i])\r\n if j == 0:\r\n max[0] = temp\r\n max[1] = name\r\n if temp > max[0]:\r\n max[0] = temp\r\n max[1] = name\r\nprint(max[1])", "\r\n\r\nif __name__ == \"__main__\":\r\n\tn = int(input())\r\n\tparticipants_name = []\r\n\tparticipants_points = []\r\n\r\n\tfor i in range(n):\r\n\t\tparticipant = list(input().split())\r\n\t\tparticipants_name.append(participant.pop(0))\r\n\t\tparticipant = list(int(x) for x in participant)\r\n\t\tsuccess_hacks = participant.pop(0)\r\n\t\tunsucess_hacks = participant.pop(0)\r\n\t\tpoints = sum(participant) + (success_hacks*100) - (unsucess_hacks*50)\r\n\t\tparticipants_points.append(points)\r\n\r\n\twinner_index = participants_points.index(max(participants_points))\r\n\tprint(participants_name[winner_index])\r\n\r\n", "t = int(input())\r\noutput = []\r\nscores = []\r\nfor _ in range(t):\r\n score = 0\r\n info = input().split()\r\n handle, successful, failure, a, b, c, d, e = info[0], info[1], info[2], info[3], info[4], info[5], info[6], info[7]\r\n output.append(info)\r\n score += (100 * int(successful))\r\n score -= (50 * int(failure))\r\n score += int(a)\r\n score += int(b)\r\n score += int(c)\r\n score += int(d)\r\n score += int(e)\r\n scores.append(score)\r\nmaximum = max(scores)\r\nposition = scores.index(maximum)\r\nprint(output[position][0])\r\n\r\n\r\n\r\n\r\n\r\n", "n=int(input())\r\ndata=[]\r\nscore=[]\r\nfor n1 in range(n):\r\n a=list(input().split())\r\n data.append(a)\r\n sc=0\r\n sc+=100*int(a[1])-50*int(a[2])\r\n for z in range(3,8):\r\n sc+=int(a[z])\r\n score.append(sc)\r\nprint(data[score.index(max(score))][0])", "ans=-2528\r\nfor i in range(int(input())):\r\n a=input().split()\r\n b=[int(i) for i in a[1:]]\r\n k=sum(b[-5:])\r\n k+=100*b[0]\r\n k-=50*b[1]\r\n if k>ans:\r\n ans=k\r\n re=a[0]\r\nprint(re)\r\n", "n = int(input())\nl = []\nfor i in range(n):\n\ts = input().split()\n\tname, *s = s\n\ts = [int(x) for x in s]\n\ts = s[0] * 100 - s[1] * 50 + sum(s[2:])\n\tl.append((s, name))\nl.sort()\nl.reverse()\nprint(l[0][1])\n", "n = int(input())\nname = []\nli = []\nscore = []\n\nfor i in range(n):\n enter = input().split()\n name.append(enter.pop(0))\n li.append(list(map(int, enter)))\n\nfor el in li:\n score.append(el[0]*100 - el[1]*50 + el[2] + el[3] + el[4] + el[5] + el[6])\n\nprint(name[score.index(max(score))])\n", "b=int(input())\r\na=[[0]]*b\r\nc=[[0]]*b\r\nfor i in range(b):\r\n a[i]=list(map(str,input().split()))\r\nfor i in range(b):\r\n c[i]=list(map(int,a[i][1:8]))\r\n c[i]=(sum(c[i][2:7])+(c[i][0]*100)-(c[i][1]*50))\r\nprint(a[c.index(max(c))][0])", "def score(p):\r\n # implemented based on constraints\r\n plus=0\r\n minus=0\r\n a=0\r\n b=0\r\n c=0\r\n d=0\r\n e=0\r\n plus, minus, a, b, c, d, e = int(p[1]), int(p[2]), int(p[3]), int(p[4]), int(p[5]), int(p[6]), int(p[7]) \r\n\r\n return plus*100 - minus*50 + a + b + c + d + e\r\n\r\ndef solve():\r\n n = int(input())\r\n max_leader = \"\"\r\n max_score = float('-inf')\r\n for i in range(n):\r\n data = input().split()\r\n sc = score(data)\r\n if sc > max_score:\r\n max_score = sc\r\n max_leader = data[0]\r\n print(max_leader)\r\n\r\nsolve()", "n = int(input())\nttl, res = {}, None\nfor _ in range(n):\n hdl, pls, mns, a, b, c, d, e = input().split()\n ttl[hdl] = 100 * int(pls) - 50 * int(mns) + sum(int(i) for i in (a, b, c, d, e))\n if res is None or ttl[hdl] > ttl[res]:\n res = hdl\nprint(res)\n", "n = int(input())\nresults = []\n\nfor i in range(n):\n person = input().split()\n rating = int(person[1]) * 100 - int(person[2]) * 50 + int(person[3]) + int(person[4]) + int(person[5]) + \\\n int(person[6]) + int(person[7]), person[0]\n results.append(rating)\n\nprint(sorted(results)[-1][1])\n", "participants = int(input())\n\nparticipants_points = {}\n\nfor i in range(participants):\n participant_infor = input().split()\n nickname = participant_infor[0]\n successful_hacks = int(participant_infor[1])\n unsuccessful_hacks = int(participant_infor[2])\n points_problem_A = int(participant_infor[3])\n points_problem_B = int(participant_infor[4])\n points_problem_C = int(participant_infor[5])\n points_problem_D = int(participant_infor[6])\n points_problem_E = int(participant_infor[7])\n participants_points[nickname] = (successful_hacks * 100 - 50 * unsuccessful_hacks + points_problem_A + points_problem_B + points_problem_C + points_problem_D + points_problem_E)\n\nfor nickname, points in participants_points.items():\n if points == max(participants_points.values()):\n print(nickname)", "max = -1000000000\r\nfor tests in range(int(input())):\r\n l = list(input().split())\r\n s = int(l[1]) * 100 - int(l[2]) * 50\r\n for i in range(3, 8):\r\n s += int(l[i])\r\n if s > max:\r\n max = s\r\n name = l[0]\r\nprint(name)", "#point system=points = plus(i1) * 100 - minus(2) * 50 + a(3) + b(4) + c(5) + d(6) + e(7)\r\nn=int(input())\r\nfinal=[]\r\nfor i in range(n):\r\n lst1=input().split()\r\n val=lst1.pop(0)\r\n lst1=[int(i) for i in lst1]\r\n po=100*lst1[0]-50*lst1[1]+lst1[2]+lst1[3]+lst1[4]+lst1[5]+lst1[6]\r\n final.append([po,val])\r\nfinal=sorted(final)\r\nprint(final[n-1][1])", "n=int(input())\r\nmaxs=-10000000\r\nwin=''\r\nfor i in range(n):\r\n l=input().split(\" \")\r\n sc=sum(map(int,l[3:]))+100*int(l[1])-50*int(l[2])\r\n if sc>maxs:\r\n maxs=sc\r\n win=l[0]\r\n \r\nprint(win)", "\r\n\r\nl=[]\r\nfor i in range(int(input())):\r\n\r\n t = (input().split())\r\n\r\n p = int(t[1])*100-int(t[2])*50+int(t[3])+int(t[4])+int(t[5])+int(t[6])+int(t[7])\r\n l.append([p,t[0]])\r\n\r\nl.sort()\r\n\r\nprint(l[-1][1])\r\n", "a=[]\r\nfor s in [*open(0)][1:]:\r\n s=s.split()\r\n a+=[[s[0],*map(int,s[1:])]]\r\nprint(max(a,key=lambda x:x[1]*100-x[2]*50+sum(x[3:]))[0])", "n = int(input())\r\nname = ''\r\nres = -100000000000000000000000000000000000000000\r\nfor _ in range(n):\r\n temp = input().split()\r\n s = sum(list(map(int, temp[3::])))\r\n s += (int(temp[1]) * 100)\r\n s -= (int(temp[2]) * 50)\r\n if s >= res:\r\n name = temp[0]\r\n res = s\r\nprint(name)", "n = int(input())\r\n\r\nhuman = {}\r\nfor _ in range(n):\r\n nick, *data = input().split()\r\n plus, minus, *abcde = map(int, data)\r\n\r\n human[nick] = 100 * plus - 50 * minus + sum(abcde)\r\n\r\nprint(max(human.keys(), key=lambda x: human[x]))\r\n", "\"\"\"\nhttps://codeforces.com/problemset/problem/74/A\n\"\"\"\nparticipants = int(input())\n\nres = []\nfor _ in range(participants):\n name, *k = [x for x in input().split()]\n plusi, minusi, ai, bi, ci, di, ei = [int(x) for x in k]\n somme = plusi * 100 - 50 * minusi + ai + bi + ci + di + ei\n res.append((somme, name))\nres = sorted(res, reverse=True)\nprint(res[0][1])\n", "arr = []\r\nfor _ in range(0,int(input())):\r\n arr.append(list(input().split()))\r\n\r\nans = []\r\nfor i in range(0,len(arr)):\r\n sum = int(arr[i][1])*100 - int(arr[i][2])*50\r\n for j in range(3,8):\r\n sum += int(arr[i][j])\r\n ans.append(sum)\r\n\r\na = max(ans)\r\nfor i in range(0,len(ans)):\r\n if ans[i] == a:\r\n print(arr[i][0])\r\n break\r\n\r\n" ]

[ "def main():\n n, m, b, mod = map(int, input().split())\n b += 1\n nxt = [[0] * b for _ in range(m)]\n row_zero = [0] * b\n row_zero[0] = 1\n for a in list(map(int, input().split())):\n cur, nxt = nxt, []\n src0 = row_zero\n for src1 in cur:\n src0 = [(x + src0[i]) % mod if i >= 0 else x for i, x in enumerate(src1, -a)]\n nxt.append(src0)\n print(sum(nxt[-1]) % mod)\n\n\nif __name__ == '__main__':\n main()\n", "import sys\r\nimport copy\r\ninput=sys.stdin.readline\r\nn,m,b,mod=map(int,input().split())\r\na=list(map(int,input().split()))\r\ndp=[[0]*(m+1) for i in range(b+1)]\r\ndp[0][0]=1\r\nfor i in range(n):\r\n for j in range(a[i],b+1):\r\n for k in range(1,m+1):\r\n dp[j][k]=(dp[j][k]+dp[j-a[i]][k-1])%mod\r\nans=0\r\nfor i in range(b+1):\r\n ans+=dp[i][m]\r\n ans%=mod\r\nprint(ans)", "n, m, b, mod = map(int, input().split())\r\na = list(map(int, input().split()))\r\ndp = [[0 for col in range(b + 1)]for row in range(m + 1)]\r\n\r\ndp[0][0] = 1\r\nfor i in range(n):\r\n for j in range(1, m + 1):\r\n for k in range(a[i], b + 1):\r\n dp[j][k] = (dp[j][k] + dp[j - 1][k - a[i]]) % mod\r\nans = 0\r\nfor i in range(b + 1):\r\n ans = (ans + dp[m][i]) % mod\r\nprint(ans)", "n,m,b,mod = map(int,input().split())\narr = list(map(int,input().split()))\nif min(arr)*m>b:\n print(0)\nelse:\n dp = [[0]*(b+1) for _ in range(m+1)]\n dp[0][0] = 1\n for i in range(1,n+1):\n for j in range(1,m+1):\n for k in range(arr[i-1],b+1):\n dp[j][k] = (dp[j][k]+dp[j-1][k-arr[i-1]])%mod\n print(sum(dp[-1])%mod)\n \t \t \t\t \t\t \t \t \t\t \t", "# 543A\r\ndef rl():\r\n return map(int,input().split())\r\nn,m,b,mod=rl()\r\na=(*rl(),)\r\ndp=[[0]*555 for i in range (555)]\r\ndp[0][0]=1\r\nfor i in range (n):\r\n for k in range (m):\r\n for j in range (b-a[i]+1):\r\n dp[k+1][j+a[i]]+=dp[k][j]\r\n dp[k+1][j+a[i]]%=mod\r\nans=0\r\nfor i in range (b+1):\r\n ans+=dp[m][i]\r\n ans%=mod\r\nprint(ans)", "def process(m, b, mod, A):\r\n n = len(A)\r\n \"\"\"\r\n we need plans\r\n (partitions of m into n parts)\r\n such that\r\n sum(vi) = m\r\n a1*v1+a2*v2+..+an*vn <= b\r\n\r\n \r\n \"\"\"\r\n my_min = min(A)\r\n if m*my_min > b:\r\n print(0)\r\n return\r\n b-=m*my_min\r\n min_index = None\r\n for i in range(n):\r\n if A[i]==my_min:\r\n min_index = i\r\n break\r\n A2 = []\r\n for i in range(n):\r\n if i != min_index:\r\n A2.append(A[i]-my_min)\r\n answer = [[0 for y in range(b+1)] for x in range(m+1)]\r\n answer[0][0] = 1\r\n for i in range(n-1):\r\n for x in range(1, m+1):\r\n for y in range(b, -1, -1):\r\n if y >= A2[i]:\r\n answer[x][y] = (answer[x][y]+answer[x-1][y-A2[i]]) % mod\r\n final_answer = 0\r\n for x in range(m+1):\r\n for y in range(b+1):\r\n final_answer = (final_answer+answer[x][y]) % mod\r\n print(final_answer)\r\n \r\n \r\n \r\n \r\nn, m, b, mod = [int(x) for x in input().split()]\r\nA = [int(x) for x in input().split()]\r\nprocess(m, b, mod, A)", "# -*- coding:utf-8 -*-\n\n\"\"\"\n\ncreated by shuangquan.huang at 1/7/20\n\n\"\"\"\n\nimport collections\nimport time\nimport os\nimport sys\nimport bisect\nimport heapq\nfrom typing import List\n\n\ndef solve(N, A, M, bugs, MOD):\n dp = [[[0 for _ in range(bugs + 1)] for _ in range(M + 1)] for _ in range(2)]\n for j in range(1, M + 1):\n if A[0] * j <= bugs:\n dp[1][j][A[0] * j] = 1\n dp[1][0][0] = 1\n dp[0][0][0] = 1\n for i in range(2, N + 1):\n for j in range(1, M + 1):\n for b in range(bugs + 1):\n s = dp[i % 2][j - 1][b - A[i - 1]] if b >= A[i - 1] else 0\n s += dp[(i + 1) % 2][j][b]\n s %= MOD\n dp[i % 2][j][b] = s\n\n return sum(dp[N % 2][M]) % MOD\n\n\nN, M, B, MOD = map(int, input().split())\nA = [int(x) for x in input().split()]\nprint(solve(N, A, M, B, MOD))", "import sys\r\ninput = sys.stdin.readline\r\n\r\ndef solve():\r\n n, m, b, mod = list(map(int, input().split()))\r\n a = list(map(int, input().split()))\r\n # n个程序员，m行代码\r\n # 第i个程序员在一行代码会产生a[i]个bug\r\n # 多少种方案使得总bug数不超过b个\r\n # f[i][j][k]：前i个程序员，写j行代码，产生k个bug的方案\r\n # f[0][0][0] = 1 初始\r\n # f[i][j][k] = f[i-1][j][k] + f[i][j - 1][k - a[i]] (不写 or 写)\r\n # 第一个维度优化\r\n f = [[0] * (b + 1) for _ in range(m + 1)]\r\n # init\r\n f[0][0] = 1\r\n for i in range(n):\r\n for j in range(1, m + 1):\r\n for k in range(a[i], b + 1):\r\n f[j][k] = (f[j][k] + f[j - 1][k - a[i]]) % mod\r\n ans = 0\r\n for val in f[m]:\r\n ans = (ans + val) % mod\r\n #print(f)\r\n print(ans)\r\n\r\n\r\n\r\n\r\n\r\n\r\nif __name__ == '__main__':\r\n solve()", "#!/usr/bin/env python\r\n\t\t\t\t\t\r\nimport os\r\nimport sys\r\nimport threading\r\nfrom io import BytesIO, IOBase\r\nfrom heapq import heappush,heappop,heapify\r\nfrom collections import defaultdict,deque,Counter\r\nfrom bisect import bisect_left as bl\r\nfrom bisect import bisect_right as br\r\n#threading.stack_size(10**8)\r\n#sys.setrecursionlimit(10**6)\r\n\r\ndef ri():return int(input())\r\ndef rs():return input()\r\ndef rl():return list(map(int,input().split()))\r\ndef rls():return list(input().split())\r\n\r\ndef main():\r\n\tn,m,b,mod=rl()\r\n\ta=rl()\r\n\tdp=[[0 for i in range(510)] for j in range(510)]\r\n\tdp[0][0]=1\r\n\tfor i in range(n):\r\n\t\tfor k in range(m):\r\n\t\t\tfor j in range(b-a[i]+1):\r\n\t\t\t\tdp[k+1][j+a[i]]+=dp[k][j]\r\n\t\t\t\tdp[k+1][j+a[i]]%=mod\r\n\tres=0\r\n\tfor i in range(b+1):\r\n\t\tres+=dp[m][i]\r\n\t\tres%=mod\r\n\tprint(res)\r\n\t\t\t\t\r\n# region fastio \r\nBUFSIZE = 8192\r\n\r\nclass FastIO(IOBase):\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.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# endregion\r\n \r\nif __name__ == \"__main__\":\r\n main()\r\n#threading.Thread(target=main).start() ", "n, m, b, mod = map(int, input().split())\nc = list(map(int, input().split()))\ndp = [[0 for i in range(m + 1)] for j in range(b + 1)]\ndp[0][0] = 1\nfor i in range(n):\n for j in range(c[i], b + 1):\n for k in range(m):\n dp[j][k + 1] = (dp[j][k + 1] + dp[j - c[i]][k]) % mod\n \nresult = 0\nfor i in range(b + 1):\n result = (result + dp[i][m]) % mod\nprint(result)\n \t \t\t\t \t\t\t\t\t \t\t\t \t \t\t\t\t\t\t\t", "import sys\r\nimport math\r\nimport collections\r\nimport random\r\nfrom heapq import heappush, heappop\r\nfrom functools import reduce\r\n\r\ninput = sys.stdin.readline\r\nints = lambda: list(map(int, input().split()))\r\n\r\ndef printQry(a, b) -> None:\r\n sa = str(a)\r\n sb = str(b)\r\n print(f\"? {sa} {sb}\", flush = True)\r\n\r\ndef printAns(ans) -> None:\r\n s = str(ans)\r\n print(f\"! {s}\", flush = True)\r\n\r\ndef solve() -> None:\r\n n, m, b, MOD = map(int, input().split())\r\n arr = ints()\r\n\r\n dp = [[0] * (b + 1) for _ in range(m + 1)]\r\n dp[0][0] = 1\r\n for i in range(n):\r\n for j in range(1, m + 1):\r\n for k in range(arr[i], b + 1):\r\n dp[j][k] = (dp[j][k] + dp[j - 1][k - arr[i]]) % MOD\r\n \r\n ans = 0\r\n for v in dp[m]:\r\n ans = (ans + v) % MOD\r\n \r\n print(ans)\r\n\r\nt = 1\r\nfor _ in range(t):\r\n solve()", "def main():\r\n\tn,m,b,mod=map(int,input().split())\r\n\tarr=list(map(int,input().split()))\r\n \r\n\tdp=[[0 for _ in range(b+1)] for _ in range(m+1)]\r\n\tdp[0]=[1]*(b+1)\r\n \r\n \r\n \r\n\tfor item in arr:\r\n\t\tfor x in range(1,m+1):\r\n\t\t\tfor y in range(item,b+1):\r\n\t\t\t\tdp[x][y]=(dp[x][y]+dp[x-1][y-item])%mod\r\n \r\n\tprint(dp[m][b])\r\n\r\nmain()", "import sys\r\nfrom collections import *\r\nfrom itertools import *\r\nfrom math import *\r\nfrom array import *\r\nfrom functools import lru_cache\r\nimport heapq\r\nimport bisect\r\nimport random\r\nimport io, os\r\n\r\nif sys.hexversion == 50924784:\r\n sys.stdin = open('cfinput.txt')\r\n\r\n# input = sys.stdin.readline\r\n# input_int = sys.stdin.buffer.readline\r\n# RI = lambda: map(int, input_int().split())\r\n# RS = lambda: input().strip().split()\r\n# RILST = lambda: list(RI())\r\n\r\nRI = lambda: map(int, sys.stdin.buffer.readline().split())\r\nRS = lambda: sys.stdin.readline().strip().split()\r\nRILST = lambda: list(RI())\r\n\r\nMOD = 10 ** 9 + 7\r\n\"\"\"http://codeforces.com/problemset/problem/543/A\r\n\r\n输入 n (1≤n≤500) m (1≤m≤500) b (0≤b≤500) mod (1≤mod≤1e9+7) 和一个长为 n 的数组 a (0≤a[i]≤500)。\r\n\r\n你接手了一个有很多祖传代码的老项目，该项目由 n 个程序员开发，目前有 m 行代码。\r\n已知第 i 个程序员在一行代码中会产生 a[i] 个 bug。\r\n你尚不知道每个程序员分别写了多少行代码，于是你思考：有多少种方案，能使项目的 bug 数量不超过 b 个？由于答案很大，你需要输出答案模 mod 的结果。\r\n\r\n注意：两种方案不同，当且仅当某个程序员编写的行数不同。\r\n可能有程序员一行代码都不写。\r\n输入\r\n3 3 3 100\r\n1 1 1\r\n输出 10\r\n\r\n输入\r\n3 6 5 1000000007\r\n1 2 3\r\n输出 0\r\n\r\n输入\r\n3 5 6 11\r\n1 2 1\r\n输出 0\r\n\"\"\"\r\n\"\"\" 背包\r\nf[i][j][k] 前i个程序员写了j行代码，共产生k个bug的方案数\r\n\"\"\"\r\n\r\n\r\n# \t ms\r\ndef solve(n, m, b, mod, a):\r\n f = [[0] * (b + 1) for _ in range(m + 1)]\r\n f[0][0] = 1\r\n for v in a:\r\n for i in range(1, m + 1):\r\n for j in range(v, b + 1):\r\n f[i][j] = (f[i][j] + f[i - 1][j - v]) % mod\r\n # f[i][j] += f[i - 1][j - v]\r\n print(sum(f[-1]) % mod)\r\n\r\n\r\nif __name__ == '__main__':\r\n n, m, b, mod = RI()\r\n a = RILST()\r\n\r\n solve(n, m, b, mod, a)\r\n", "R,G=lambda:map(int,input().split()),range\r\nn,m,b,M=R();a=[*R()];f=[[0]*(b+1) for _ in G(m+1)]\r\nfor x in a:\r\n for j in G(m+1):\r\n if j==0:f[j]=[1]*(b+1);continue\r\n for k in G(x,b+1):\r\n f[j][k]=(f[j][k]+f[j-1][k-x])%M\r\nprint(f[m][b])", "n, m, b, mod = map(int, input().split())\r\na = list(map(int, input().split()))\r\ndp = [[0 for i in range(b + 1)] for j in range(m + 1)]\r\ndp[0][0] = 1\r\nfor i in range(n):\r\n\tfor ld in range(m):\r\n\t\tfor bugs in range(b + 1):\r\n\t\t\tif bugs + a[i] <= b:\r\n\t\t\t dp[ld + 1][bugs + a[i]] = (dp[ld + 1][bugs + a[i]] + dp[ld][bugs]) % mod\r\nans = 0\r\nfor i in range(0, b + 1):\r\n\tans = (ans + dp[m][i]) % mod\r\nprint(ans)", "def main():\n n, m, b, mod = map(int, input().split())\n row_zero = [1] + [0] * b\n b += 1\n dp = [[0] * b for _ in range(m)]\n for a in list(map(int, input().split())):\n cur = row_zero\n for nxt in dp:\n for i, u in zip(range(a, b), cur):\n nxt[i] = (nxt[i] + u) % mod\n cur = nxt\n print(sum(dp[-1]) % mod)\n\n\nif __name__ == '__main__':\n main()\n" ]

[ "n, L, v1, v2, k = map(int, input().split())\r\nn = (n + k - 1) // k * 2\r\ndif = v2 - v1\r\np1 = (n * v2 - dif) * L\r\np2 = (n * v1 + dif) * v2\r\nans = p1 / p2\r\nprint(ans)\r\n", "n,l,v,V,k=map(int,input().split())\r\nn=(n+k-1)//k\r\na=(n-1)*(V-v)/(v+V)\r\nprint(l/V/(n-a)*(n+a))", "n,l,v1,v2,k=map(int,input().split())\nm=(n-1)//k+1\nv=v1+v2\nx=l*v*v2/(m*v*v2-(m-1)*(v2-v1)*v2)\nprint(x/v2+(l-x)/v1)\n\t\t\t \t \t \t\t\t \t \t\t\t \t", "def check(t):\r\n t2 = (m - v1 * t) / (v2 - v1)\r\n t3 = (v2 - v1) * t2 / (v2 + v1)\r\n p = (n + k - 1) // k\r\n ans = t2 * p + t3 * (p - 1)\r\n return ans <= t\r\n\r\nn, m, v1, v2, k = map(float, input().split())\r\nl = m / v2\r\nr = m / v1\r\n\r\nfor _ in range(10000):\r\n mid = (l + r) / 2\r\n if check(mid):\r\n r = mid\r\n else:\r\n l = mid\r\n\r\nprint(\"{:.10f}\".format(r))\r\n", "RYIawuypxfFqJOW = map\r\nRYIawuypxfFqJOL = int\r\nRYIawuypxfFqJOg = input\r\nRYIawuypxfFqJOi = print\r\nn, l, v1, v2, k = RYIawuypxfFqJOW(RYIawuypxfFqJOL, RYIawuypxfFqJOg().split())\r\nn = (n + k - 1) // k\r\na = (v2 - v1)/(v1 + v2)\r\nt = l / v2 / (n - (n - 1) * a)\r\nRYIawuypxfFqJOi(n * t + (n - 1) * a * t)\r\n", "n, l, v1, v2, k = list(map(int, input().split()))\r\nn = (n+k-1)//k\r\nt = l / ((v1 + (v2 - v1) * v1 / (v1 + v2)) * (n - 1) + v2)\r\nprint(t * n + t * (v2 - v1) / (v1 + v2) * (n - 1))", "import sys\r\nimport math\r\n\r\ndata = sys.stdin.read()\r\ndata = data.split(' ')\r\n\r\nn = int(data[0])\r\nl = int(data[1])\r\nw = int(data[2])\r\nv = int(data[3])\r\nk = int(data[4])\r\n\r\nz = math.ceil(n/k)\r\ntop = l/w - l/(2*w*z) + l/(2*v*z)\r\nbot = 1 + v/(2*w*z) - 1/(2*z)\r\nprint(top/bot)\r\n", "import math\r\n\r\nn,L,v1,v2,k = [int(x) for x in input().split()]\r\nn = int(math.ceil(n/k))\r\na = v2/v1\r\nx = (2*L)/(a+2*n-1)\r\ny = L-(n-1)*x\r\n\r\nprint((y*n+(n-1)*(y-x))/v2)\r\n", "n, l, v1, v2, k = map(int, input().split())\r\ndiff = v2 - v1\r\nn = (n + k - 1) // k * 2\r\np1 = (n * v2 - diff) * l\r\np2 = (n * v1 + diff) * v2\r\nprint(p1 / p2)\r\n", "n,l,v1,v2,k=map(int,input().split())\r\nn=(n+k-1)//k\r\na=(v2-v1)/(v1+v2)\r\nt=l/v2/(n-(n-1)*a)\r\nprint(n*t+(n-1)*a*t)", "from sys import stdin, stdout\r\nimport math\r\n\r\n\r\ndef solution():\r\n n, l, v1, v2, k = map(int, stdin.readline().rstrip().split())\r\n grs = math.ceil(float(n)/k)\r\n c = grs/(v2-v1)+(grs-1)/(v1+v2)\r\n stdout.write(\"{}\".format(l/(v1+1/c)))\r\n\r\n\r\nif __name__ == '__main__':\r\n solution()", "import math #可读性极差\r\nwwwww,wwwwww,wwwwwww,wwwwwwww,wwwwwwwww = map(int,input().split())\r\nw,ww,www = math.ceil(wwwww / wwwwwwwww) - 1,wwwwwww + wwwwwwww,2 * wwwwwwww\r\nwwww = wwwwww /(w * (www * wwwwwww) / ww + wwwwwwww)\r\nprint((www * wwww) / ww * w + wwww)\r\n", "import sys\nn, l, v1, v2, k = map(int, input().split())\nn = (n + k - 1) // k\nif n == 1:\n\tprint(l / v2)\n\tsys.exit(0)\n\nL, R = 0, l\nfor i in range(100):\n\tM = (L + R) / 2\n\tS = l - M\n\tT = M * (n * 2 - 1)- l\n\tif T * v1 > S * v2:\n\t\tR = M\n\telse:\n\t\tL = M\n\nprint(M / v2 + S / v1)\n", "n,l,v,r,k=map(int,input().split())\r\nn=(n+k-1)//k\r\na=(n-1)*(r-v)/(v+r)\r\nprint(l/r/(n-a)*(n+a))", "n,l,v,o,k=map(int,input().split())\nT=(n+k-1)//k\ne=1-v/o\nL=l/v/(T/o+T*e/(v+o)-e/(v+o)-1/o+1/v)\nprint((l-L)/v+L/o)\n", "n, l, v1, v2, k = map(int, input().split())\n\nif k >= n:\n res = l / v2\nelse:\n L, R = 0, l / v2\n x = (n + k - 1) // k\n\n for i in range(100):\n M = (L + R) / 2\n\n first = M + (l - v2 * M) / v1\n\n prev_cost = (x - 1) * (M + M * (v2 - v1) / (v1 + v2))\n last = prev_cost + (l - v1 * prev_cost) / v2\n\n if last > first:\n R = M\n else:\n L = M\n\n res = (l - L * v2) / v1 + L\n\nprint('{:0.10f}'.format(res))\n" ]

[ "from heapq import heappush, heappop, heapify\r\nfrom collections import defaultdict, Counter, deque\r\nfrom functools import lru_cache\r\nimport threading\r\nimport sys\r\nimport bisect\r\ninput = sys.stdin.readline\r\ndef ri(): return int(input())\r\ndef rs(): return input()\r\ndef rl(): return list(map(int, input().split()))\r\ndef rls(): return list(input().split())\r\n\r\n# threading.stack_siz(e(10**8)\r\n# sys.setrecursionlimit(10**6)\r\n\r\n\r\ndef main():\r\n n, k = rl()\r\n a = rl()\r\n b = rl()\r\n c = [x - k*y for x, y in zip(a, b)]\r\n big = pow(10, 5)+pow(10, 4)+1\r\n dp = [-1 << 33]*big\r\n og = 10**5\r\n dp[og] = 0\r\n for i in range(n):\r\n ndp = [-1 << 33]*big\r\n for j in range(big):\r\n if dp[j] > -1 << 33:\r\n ndp[j] = max(ndp[j], dp[j])\r\n ndp[j+c[i]] = max(ndp[j+c[i]], dp[j]+a[i])\r\n dp = ndp\r\n print(dp[og] if dp[og] else -1)\r\n pass\r\n\r\n\r\n# for _ in range(ri()):\r\nmain()\r\n# threading.Thread(target=main).start()\r\n", "[n,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\nb.insert(0,0)\r\na.insert(0,0)\r\ns = sum(b) * k\r\nf = [[0 for i in range(0,4*s+1)] for j in range(0,n+1)]\r\nfor i in range(0,n+1):\r\n a[i] = a[i] - (k * b[i])\r\nfor i in range(1,n+1):\r\n for j in range(s,3*s+1):\r\n f[i][j] = f[i-1][j]\r\n if j-a[i] == 2*s or f[i-1][j-a[i]] > 0:\r\n f[i][j] = max(f[i][j],f[i-1][j-a[i]]+b[i])\r\nif f[n][2*s]:\r\n print(f[n][2*s] * k)\r\nelse:\r\n print(-1)", "n, k = map(int,input().split())\r\na = [int(x) for x in input().split()]\r\nb = [int(x)*k for x in input().split()]\r\ndp = {0:{0:0}}\r\ndp[0][a[0]-b[0]] = a[0]\r\n\r\nfor i in range(n-1):\r\n dp[i+1]={}\r\n for j in dp[i]:\r\n dp[i+1][j] = max(dp[i+1].get(j,0), dp[i][j])\r\n dp[i+1][j+a[i+1]-b[i+1]] = max(dp[i+1].get(j+a[i+1]-b[i+1], 0), dp[i][j]+a[i+1])\r\n\r\nif not (dp[n-1][0]):\r\n dp[n-1][0] = -1\r\n\r\nprint(dp[n-1][0])", "class Dict(dict):\r\n def __missing__(self, key):\r\n return float('-inf')\r\n\r\nn, k = map(int, input().split())\r\na = [0] + list(map(int, input().split()))\r\nb = [0] + list(map(int, input().split()))\r\n\r\nf = [Dict() for _ in range( n + 1 ) ]\r\nf[0][n*100] = 0\r\n\r\nfor i in range( 1 , n + 1 ):\r\n s = a[i] - b[i]*k\r\n for j in range(n*200, -1, -1):\r\n f[i][j] = max( f[i-1][j] , f[i-1][j-s] + a[i])\r\n\r\nprint( f[n][n*100] or -1)\r\n", "from collections import defaultdict\r\nn, k = map(int, input().split())\r\na = [0] + list(map(int, input().split()))\r\nb = [0] + list(map(int, input().split()))\r\ndp = [defaultdict(lambda : int(-2e9)) for _ in range(n+1)]\r\ndp[0][n*100] = 0\r\nfor i in range(1, n+1):\r\n s = a[i] - b[i] * k\r\n for j in range(n*200, -1, -1):\r\n dp[i][j] = max(dp[i-1][j], dp[i-1][j-s] + a[i])\r\nprint(dp[n][n*100] if dp[n][n*100] > 0 else -1)\r\n", "from bisect import bisect_right\r\nn, k = map(int, input().split())\r\nt = sorted((u - k * v, v) for u, v in zip(*(map(int, input().split()), map(int, input().split()))))\r\nm = n - bisect_right(t, (0, 0))\r\nl, p, t = 0, [0] * 100001, t[:: -1]\r\nfor d, v in t[: m]:\r\n for j in range(l, 0, -1):\r\n if p[j]: p[j + d] = max(p[j + d], p[j] + v)\r\n p[d] = max(p[d], p[0] + v)\r\n l += d\r\nfor d, v in t[m: ]:\r\n for j in range(- d, l + 1):\r\n if p[j]: p[j + d] = max(p[j + d], p[j] + v)\r\nprint(p[0] * k if p[0] else -1)", "class Dict(dict):\r\n def __missing__(self, key):\r\n return float('-inf')\r\n\r\nn, k = map(int, input().split())\r\na = [0] + list(map(int, input().split()))\r\nb = [0] + list(map(int, input().split()))\r\n\r\ndp = [Dict() for _ in range(n+1)]\r\ndp[0][n*100] = 0\r\n\r\nfor i in range(1, n+1):\r\n s = a[i] - b[i]*k\r\n for j in range(n*200, -1, -1):\r\n dp[i][j] = max(dp[i-1][j], dp[i-1][j-s] + a[i])\r\n\r\nprint(dp[n][n*100] or -1)\r\n", "from sys import stdin,stdout\nPi = lambda x: stdout.write(str(x) + '\\n')\nPs = lambda x: stdout.write(str(x))\nS = lambda x: x*(x+1) // 2\nI = lambda x: 1+(2*x)\nR = lambda:stdin.readline()\nRi = lambda x:map(int,x.split())\nRs = lambda x:map(str,x.split())\nRf = lambda x:map(float,x.split())\nMaxN = int(1e5) + 10\n# dp,A = []\ndef f(i,x,n,k,dp,A,B):\n\tif i==n:\n\t\tif x==0:return 0\n\t\treturn -1000000\n\tif dp[i][x+MaxN]!=-1:return dp[i][x+MaxN]\n\top1 = f(i+1, x+A[i]-B[i]*k,n,k,dp,A,B)+A[i]\n\top2 = f(i+1, x,n,k,dp,A,B)\n\tdp[i][x+MaxN] = max(op2,op1)\n\treturn dp[i][x+MaxN]\n\t\ndef main():\t\n\t# t = int(R())\n\tfor x in stdin:\n\t\tn,x = Ri(x)\n\t\tA = list(Ri(R()))\n\t\tB = list(Ri(R()))\n\t\tdp = []\n\t\tfor i in range(110):\n\t\t\tdp.append([-1]*(MaxN*2))\n\t\tans = f(0,0,n,x,dp,A,B)\n\t\tif ans < 1:ans = -1\n\t\tPi(ans)\n\n\nif __name__=='__main__':\n\tmain()\n\n# 60 == 360\n\n \t\t \t\t\t \t\t \t \t\t\t \t\t \t\t\t\t\t\t\t\t", "n, k = map(int, input().split())\nv = [0]*(n+1)\na = [0]*(n+1)\nb = [0]*(n+1)\ni = 1\nfor x in map(int, input().split()):\n a[i] = x\n i += 1\ni = 1\nfor x in map(int, input().split()):\n b[i] = x\n v[i] = a[i]-k*b[i]\n i += 1\n \nans = 0\nm = 10005\ndp1 = [-float('inf')]*(m+1)\ndp2 = [-float('inf')]*(m+1)\ndp1[0] = 0\ndp2[0] = 0\n\nfor i in range(1, n+1):\n if v[i] >= 0:\n for j in range(m, v[i]-1, -1):\n dp1[j] = max(dp1[j-v[i]]+a[i], dp1[j])\n else:\n v[i] = -v[i]\n for j in range(m, v[i]-1, -1):\n dp2[j] = max(dp2[j-v[i]]+a[i], dp2[j])\n\nfor i in range(m+1):\n ans = max(ans, dp1[i]+dp2[i])\n\nif ans == 0:\n print(-1)\nelse:\n print(ans)", "n,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\nb=[each*k for each in b]\r\ndp={0:{0:0}}\r\ndp[0][a[0]-b[0]]=a[0]\r\nfor i in range(n-1):\r\n dp[i+1]={}\r\n for each in dp[i]:\r\n dp[i+1][each]=max(dp[i+1].get(each,0),dp[i][each])\r\n dp[i+1][each+a[i+1]-b[i+1]]=max(dp[i+1].get(each+a[i+1]-b[i+1],0),dp[i][each]+a[i+1])\r\nif dp[n-1][0]==0:\r\n dp[n-1][0]=-1\r\nprint(dp[n-1][0])\r\n", "n,k=map(int,input().split())\r\na=[int(temp) for temp in input().split()]#味道\r\nb=[int(temp) for temp in input().split()]#卡路里，味道/卡路里=k\r\nc=[-a[i]+k*b[i] for i in range(n)]\r\n\r\nlis={0:0}#负数\r\nlis1={0:0}#正数\r\nfor i in range(n):\r\n\ttemp=lis.copy()\r\n\tfor j in list(lis.keys()):\r\n\t\tif c[i]<0:\r\n\t\t\tif j-c[i] in lis:\r\n\t\t\t\tlis[j-c[i]]=max(temp[j-c[i]],temp[j]+a[i])\r\n\t\t\telse :\r\n\t\t\t\tlis[j-c[i]]=temp[j]+a[i]#负数装载\r\n\r\ntemp=list(lis)\r\ntemp.sort()\r\ntemp.reverse()\r\nmaxnum=temp[0]\r\nfor i in range(n):\r\n\ttemp1=lis1.copy()\r\n\tfor j in list(lis1.keys()):\r\n\t\tif c[i]>=0:\r\n\t\t\tif j+c[i] in lis1:\r\n\t\t\t\tlis1[j+c[i]]=max(temp1[j+c[i]],temp1[j]+a[i])\r\n\t\t\telif j+c[i]<=maxnum:\r\n\t\t\t\tlis1[j+c[i]]=temp1[j]+a[i]#正数装载\r\n\r\nmaxnum=0\r\nfor i in temp:\r\n\tif i in lis1:\r\n\t\tmaxnum=max(lis[i]+lis1[i],maxnum)\r\nif maxnum==0:\r\n\tprint(-1)\r\nelse:\r\n\tprint(maxnum)\r\n\r\n# 78, 158, 0, 59, 1\r\n#-31, -19,-20, -86, -2, -9, -14" ]

[ "m, l, r, k = map(int, input().split())\r\nl -= 1\r\na = 0\r\nwhile a * a < r:\r\n a += 1\r\nGCD = 0\r\nfor i in range(1, a + 1):\r\n t = r // i\r\n if (r // t - l // t >= k) and (GCD < t):\r\n GCD = t\r\nfor i in range(1, a + 1):\r\n t = i\r\n if (r // t - l // t >= k) and (GCD < t):\r\n GCD = t\r\na, b, c, d, e, f, t, T, i = 0, 1, 1, 0, 1, 1, 0, 1, 0\r\nwhile GCD:\r\n if GCD & 1:\r\n t = b\r\n c = b * e + c * f\r\n b = a * e + b * f\r\n a = a * d + t * e\r\n a %= m\r\n b %= m\r\n c %= m\r\n t = d\r\n T = e\r\n d = d * d + e * e\r\n e = t * e + e * f\r\n f = T * T + f * f\r\n d %= m\r\n e %= m\r\n f %= m\r\n GCD //= 2\r\nprint(a)# 1693528020.0273879", "def _fib(n):\r\n if n == 0:\r\n return (0, 1)\r\n fib = _fib(n >> 1)\r\n fib1 = fib[0]\r\n fib2 = fib[1]\r\n k = (fib1 * (((2 * fib2 - fib1) % m + m) % m)) % m\r\n g = ((fib1 * fib1) % m) + ((fib2 * fib2) % m)\r\n if n & 1:\r\n return (g % m, (k + g) % m)\r\n return (k % m, g % m)\r\nm, l, r, k = map(int, input().split())\r\ndiff = (r - l) // (k - 1)\r\nwhile diff > 1 and (1 + (r // diff) - ((l + diff - 1) // diff)) < k:\r\n elem = 1 + (r // diff)\r\n diff -= (((elem * diff) - r) + (elem - 1)) // elem \r\nres = _fib(diff)[0]\r\nprint((res + m) % m)# 1692452310.1316009" ]

[ "import math\r\nimport time\r\nfrom collections import defaultdict,deque\r\nfrom sys import stdin,stdout\r\nfrom bisect import bisect_left,bisect_right\r\nn,k=map(int,stdin.readline().split())\r\na=list(map(int,stdin.readline().split()))\r\ndouble=n-k\r\nans=0\r\nfor i in range(double):\r\n ans=max(ans,a[i]+a[2*double-1-i])\r\ntemp=-math.inf\r\nif(k+k!=n):\r\n temp=max(a[2*double:])\r\nans=max(ans,temp)\r\nprint(ans)\r\n\r\n", "no_of_cowbell,no_of_boxe=map(int,input().split())\r\nli1=list(map(int,input().split()))\r\ncows_packed=no_of_boxe*2\r\nif(no_of_cowbell<=no_of_boxe):\r\n print(li1[no_of_cowbell-1])\r\nelse: \r\n j=no_of_cowbell-1\r\n ans=li1[no_of_cowbell-1]\r\n if(no_of_cowbell-no_of_boxe>0):\r\n j=(no_of_cowbell-no_of_boxe)*2-1\r\n i=0 \r\n while(i<j):\r\n if(li1[i]+li1[j]>ans):\r\n ans=li1[i]+li1[j]\r\n i+=1 \r\n j-=1 \r\n print(ans) \r\n \r\n \r\n \r\n \r\n ", "n, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\n\r\nb = [0]*k\r\nfor i in range(n-1, -1, -1):\r\n b[(n-1-i) % k] += a[i]\r\n if n-1-i == k-1:\r\n b = b[::-1]\r\n\r\nprint(max(b))", "n, k = list(map(int, input().split()))\r\narr = list(map(int, input().split()))\r\nx = max(n-k, 0)\r\nif x == 0:\r\n print(arr[-1])\r\n exit()\r\nres = arr[-1]\r\nfor i in range(x):\r\n\tres = max(res, arr[i] + arr[2*x-i-1])\r\nprint(res)\r\n", "import sys\ninput = sys.stdin.readline\n\n\ndef count(i, j, mid):\n count = 0\n while i <= j:\n if arr[i] + arr[j] <= mid:\n i += 1\n j -= 1\n else:\n j -= 1\n count += 1\n return count\n\n\nn, k = map(int, input().split())\narr = list(map(int, input().split()))\n\nl = max(arr)\nr = sum(arr)\n\nbest = 0\nwhile l <= r:\n mid = (l+r)//2\n i, j = 0, n-1\n\n total = count(i, j, mid)\n if total <= k:\n r = mid-1\n best = mid\n else:\n l = mid+1\nprint(best)\n", "n, k = list(map(int, input().split()))\r\narr = list(map(int, input().split()))\r\n\r\ndef count(size):\r\n left = 0\r\n right = len(arr)-1\r\n count = 0\r\n\r\n while left<=right:\r\n if arr[left]+arr[right]<=size:\r\n count += 1\r\n left += 1\r\n right -= 1\r\n else:\r\n count += 1\r\n right -= 1\r\n \r\n return count\r\n\r\nif n == 1:\r\n right = arr[0]\r\nelse:\r\n right = arr[-1] + arr[-2]\r\n\r\nleft = arr[-1]\r\nbest = 0\r\nwhile left <= right:\r\n mid = (left+right)//2\r\n total = count(mid)\r\n if total <= k:\r\n best = mid\r\n right = mid-1\r\n else:\r\n left = mid+1\r\n\r\nprint(best)", "n,k = map(int, input().split())\r\na = list(map(int, input().split()))\r\n\r\nt = k - (2*k - n)\r\nres = 0\r\nfor i in range(t):\r\n\tres = max ( res, a[i] + a[2*t-1-i])\r\nres = max(res, a[n-1])\r\nprint (res) \r\n\r\n", "num_cows, num_boxes = map(int, input().split())\ncows = list(map(int, input().split()))\nneed = cows[-1]\nlimit = 2 * (num_cows - num_boxes)\nfor left in range(limit):\n right = limit - 1 - left\n if right < left:\n break\n need = max(need, cows[left] + cows[right])\nprint(need)\n", "n, k = map(int, input().split())\r\ns = list(map(int, input().split()))\r\nl, r, m = max(s) - 1, 2000000, -1\r\nwhile r - l > 1:\r\n m = (l + r) // 2\r\n p, used = 0, 0\r\n for i in range(n - 1, -1, -1):\r\n if i < p:\r\n break\r\n elif s[p] + s[i] <= m:\r\n p += 1\r\n used += 1\r\n if used <= k:\r\n r = m\r\n else:\r\n l = m\r\nprint(r)", "#https://codeforces.com/contest/604/problem/B\n\ndef main():\n n,k = [int(i) for i in input().split()]\n ss = [int(i) for i in input().split()]\n\n end = ss[n-1]\n if k >= n:\n print(end)\n else:\n s = 0\n e = 2*(n-k)-1\n mx = end\n while s < e:\n temp = ss[s] + ss[e]\n if temp > mx:\n mx = temp\n s += 1\n e -= 1\n print(mx)\n\n\n\n\nmain()\n\n# note1: there are 2k-n cowbells placed alone in box and 2*(n-k) cowbells placed with another cowbells. because x + 2y = n and x + y = k\n# the i largest matched the 2*(n-k) cowbells - i + 1 could be smallest. i >= 1\n\n# note2:\n# For the first problem, we can binary search on the size s of the box.\n# To check whether an array of cowbells can fit in k boxes of size s,\n# the crucial observation is that the largest cowbell either must be in a separate box all by itself,\n# or can be assumed to be in the same box as the smallest cowbell. With this observation,\n# the check subroutine can be implemented either very efficiently using the two pointers technique, or very simply by recursion (as I did in my submission).\n# Either way, it takes only linear time for each check.\n\n\n", "n, k = [int(i) for i in input().split()]\nnums = [int(i) for i in input().split()]\n\nmax_val = nums[-1]\nfor i in range(n-k):\n max_val = max(max_val, nums[i] + nums[2*(n-k)-i-1])\nprint(max_val)", "\r\nn,k = map(int,input().split())\r\na = list(map(int,input().split()))\r\ni = n-1-k\r\nj = i+1\r\nwhile i>=0:\r\n a[j]+=a[i]\r\n i-=1; j+=1\r\nprint(max(a))", "# Joseph Matsushita\n# Problem D\n#\n\nn, k = map(int, input().split())\ns = list(map(int, input().split()))\n\nsingles = (2*k) - n\nsmall = s[n-1]\nt = n - singles\nfor i in range(0, int(t / 2)):\n if(s[i] + s[t - i - 1] > small):\n small = s[i] + s[t-i-1]\n\nprint(small)\n\t\t \t\t\t \t\t\t \t \t \t\t\t\t \t \t", "n, k = map(int, input().split())\na = list(map(int, input().split()))\nx = k*2-n\nx = n-x\nans = a[-1]\nfor i in range(x):\n ans = max(ans, a[i]+a[x-i-1])\nprint(ans)\n\n \t\t\t \t\t \t \t \t \t\t\t\t\t\t\t \t\t", "a=list(map(int,input().split(' ')))\r\nn,k=a[0],a[1]\r\ns=list(map(int,input().split(' ')))\r\nif k>=n:\r\n m=max(s)\r\nelse:\r\n r,i=2*(n-k),0\r\n m=max(s[r-1::])\r\n while True:\r\n r-=1\r\n m=max(s[i]+s[r],m)\r\n i+=1\r\n if r<=i:\r\n break\r\nprint(m)", "n,k = list(map(int,input().split()))\r\nnums = list(map(int,input().split()))\r\nans = nums[-1]\r\nfor i in range(n-k):\r\n ans = max(ans,nums[i]+nums[2*(n-k)-(i+1)])\r\nprint(ans)", "n,m = map(int,input().split())\r\nm = min(n,m)\r\nl = list(map(int,input().split()))\r\nmini = 0\r\nfor i in l:\r\n mini = max(mini,i)\r\nfor i in range(n-m):\r\n mini = max(mini,l[i]+l[2*(n-m)-i-1])\r\nprint(mini)\r\n\r\n\r\n", "n,k = map(int,input().split())\r\nS = list(map(int,input().split()))\r\n\r\nt = n - k\r\nm = 0\r\nfor i in range(n):\r\n if i < t:\r\n s = S[i] + S[2*t - 1 - i]\r\n elif i < 2*t:\r\n continue\r\n else:\r\n s = S[i]\r\n if s > m:\r\n m = s\r\nprint(m)", "n,k = input().split()\r\nn=int(n)\r\nk=int(k)\r\ns=input().split()\r\nfor i in range(n):\r\n s[i]=int(s[i])\r\n #print(i,\"\",end=\"\")\r\nr=(n-k)*2\r\nm=s[-1]\r\ni=0\r\nif(k>=n):\r\n print(m)\r\nelse:\r\n while(i<r):\r\n x=s[i]+s[r-i-1]\r\n #print(i,r-i)\r\n if(m<x):\r\n m=x\r\n i+=1\r\n print(m)\r\n", "n,k=map(int,input().split())\r\ns=list(map(int,input().split()))\r\nlst=s[n-k:(n-k)*2]\r\nlst.reverse()\r\nres=s[-1]\r\nfor i in range(n-k):\r\n res=max(res,lst[i]+s[i])\r\nprint(res)", "\nn, k = map(int, input().split())\ns = list(map(int, input().split()))\n\n\ndef ok(m):\n i, j = 0, n - 1\n res = 0\n while i < j:\n if s[j] > m:\n return float('inf')\n if s[j] + s[i] <= m:\n i += 1\n j -= 1\n else:\n j -= 1\n res += 1\n if i == j:\n if s[i] > m:\n return float('inf')\n res += 1\n return res\n\n\nl, r = max(s), sum(s)\n\nwhile l < r:\n m = (l + r) >> 1\n if ok(m) > k:\n l = m + 1\n else:\n r = m\n\nprint(l)\n", "n, k = map(int, input().split())\r\na = [int(s) for s in input().split()]\r\n\r\n\r\np = n - k\r\nq = 2*k - n\r\n\r\nif n < k:\r\n q = n\r\n p = 0\r\n\r\n\r\nma = 0\r\nfor i in range ((n - q) // 2):\r\n ma = max((a[i] + a[n - q - i - 1]), ma)\r\n\r\nma2 = 0\r\nfor i in range(n - q, n):\r\n ma2 = max(a[i], ma2)\r\n\r\n\r\nprint(max(ma,ma2))\r\n", "import sys\r\n\r\nlines = sys.stdin.readlines()\r\nn, k = map(int, lines[0].split())\r\ns = list(map(int, lines[1].split()))\r\n\r\nif k == 1:\r\n if n == 1: print(s[0])\r\n else: print(s[0]+s[1])\r\n sys.exit(0)\r\n\r\nscene1 = s[-1]\r\nleft_boxes = k-1\r\nleft_numbers = n-1\r\nsmall = 0\r\nend = n-2\r\nwhile small <= end:\r\n is_double = 2*left_boxes <= left_numbers\r\n\r\n if s[small]+s[end] <= scene1:\r\n small += 1\r\n end -= 1\r\n left_boxes -= 1; left_numbers -= 2;\r\n\r\n else:\r\n if is_double:\r\n scene1 = max(scene1, s[small]+s[end])\r\n small += 1\r\n end -= 1\r\n else:\r\n end -= 1\r\n left_boxes -= 1; left_numbers -= 1\r\nif 2*k == n: scene1 = float('inf')\r\n\r\nscene2 = s[0]+s[-1]\r\nleft_boxes = k-1\r\nleft_numbers = n-2\r\nsmall = 1\r\nend = n-2\r\nwhile small <= end:\r\n is_double = 2*left_boxes <= left_numbers\r\n\r\n if s[small]+s[end] <= scene2:\r\n small += 1\r\n end -= 1\r\n left_boxes -= 1; left_numbers -= 2;\r\n \r\n else:\r\n if is_double:\r\n scene2 = max(scene2, s[small]+s[end])\r\n small += 1\r\n end -= 1\r\n else:\r\n end -= 1\r\n left_boxes -= 1; left_numbers -= 1\r\n\r\nprint(min(scene1, scene2))\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\nd = n - k\r\nm = 0\r\nfor i in range(d):\r\n m = max(m, a[i] + a[2 * d - i - 1])\r\nprint(max(m, a[-1]))", "n,k=map(int,input().split())\r\ns=list(map(int,input().split()))\r\nx=s[-1]\r\nif k<n:\r\n y=2*(n-k)-1\r\n for i in range(n-k):\r\n x=max(x,s[i]+s[y-i])\r\nprint(x)", "n,k=map(int,input().split())\r\narr=list(map(int,input().split()))\r\n#make the pair of small and bigger ele\r\n#2*(n-k)\r\nmaxx=arr[-1]\r\nfor i in range(n-k):\r\n maxx=max(maxx,arr[i]+arr[2*(n-k)-i-1])\r\nprint(maxx)\r\n\r\n \r\n \r\n", "n, k = list(map(int, input().split()))\r\ns = list(map(int, input().split()))\r\ni, o, r, e = n-1, k, s[n-1], 0\r\nwhile (o-1)*2 >= i:\r\n o, i = o-1, i-1\r\nwhile e < i:\r\n r = max(r, s[e]+s[i])\r\n e, i = e+1, i-1\r\nprint(r)", "n, m = map(int, input().split())\r\narr = list(map(int, input().split()))\r\nmx = arr[-1]\r\nfor i in range(n-m):\r\n mx = max(mx, arr[i] + arr[2*(n-m)-i-1])\r\nprint(mx)", "n,k = map(int,input().split())\narr = [int(x) for x in input().split()]\nif k>n:\n\tprint(arr[-1])\n\texit(0)\nval = n-k\nval *= 2\nmx = 0\nfor i in range(val):\n\tmx = max(mx,arr[i]+arr[val-i-1])\nfor i in range(val,n):\n\tmx = max(mx,arr[i])\nprint(mx)\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,k=lst()\r\n a=lst()\r\n boxes=[0]*k\r\n p=0\r\n p1=n-1\r\n while p<k and p1>=0:\r\n boxes[p]+=a[p1]\r\n p+=1\r\n p1-=1\r\n p-=1\r\n while p1>=0 and p>=0:\r\n boxes[p]+=a[p1]\r\n p-=1\r\n p1-=1\r\n print(max(boxes))", "n, k = map(int, input().split())\r\nl = list(map(int, input().split()))\r\n\r\nextra = 2 * k - n\r\nend = n - extra - 1\r\nstart = 0\r\n\r\nmx = max(l[end + 1:], default = 0)\r\n\r\nwhile start < end:\r\n if l[start] + l[end] > mx:\r\n mx = l[start] + l[end]\r\n start += 1\r\n end -= 1\r\n\r\nprint (mx)\r\n", "n, k = [int(x) for x in input().split()]\r\nt = 2 * k\r\na = [0 for x in range(t - n)] + [int(x) for x in input().split()]\r\nans = 0\r\nfor i in range(t):\r\n ans = max(ans, a[i] + a[t - i - 1])\r\nprint(ans)", "n,k=map(int,input().split())\r\nl=list(map(int,input().split()))\r\n\r\nif k>=n:\r\n print(max(l))\r\n\r\nelse:\r\n sum=max(l)\r\n l=l[:2*(n-k)]\r\n for i in range(len(l)):\r\n sum=max(l[i]+l[-(i+1)],sum)\r\n print(sum)", "n,k=map(int,input().split())\nl=[int(i) for i in input().split()]\nmx=l[-1]\nfor i in range(0,n-k):\n mx=max(l[i]+l[2*(n-k)-i-1],mx)\nprint(mx)\n\t\t \t\t\t\t \t \t \t \t \t\t \t\t", "__author__ = 'Utena'\r\nn,k=list(map(int,input().split()))\r\ns=list(map(int,input().split()))\r\nt=s[-1]\r\nfor i in range(len(s)-k):\r\n if s[i]+s[2*(len(s)-k)-1-i]>t:\r\n t=s[i]+s[2*(len(s)-k)-1-i]\r\nprint(t)", "n,k = [int(i) for i in input().split()]\r\na = [int(i) for i in input().split()]\r\nif k>=n:\r\n print(a[-1]); exit()\r\nm = a[-1]\r\nfor i in range(0,n-k):\r\n m = max(a[i]+a[2*(n-k)-1-i],m)\r\nprint(m)", "def count(arr, n, key):\r\n res, i, j = 0, 0, n-1\r\n while (i <= j):\r\n res += 1\r\n if (i < j and arr[i] + arr[j] <= key):\r\n i += 1\r\n j -= 1\r\n else:\r\n i += 1\r\n return res\r\n\r\ndef binary_search(arr, n, key):\r\n l = arr[0]\r\n r = l << 1\r\n while (l != r):\r\n mid = l+r >> 1\r\n if (count(arr, n, mid) <= key):\r\n r = mid\r\n else:\r\n l = mid+1\r\n return l\r\n\r\ndef main():\r\n n, k = map(int, input().split())\r\n a = list(map(int, input().split()))[::-1]\r\n print(binary_search(a, n, k))\r\n\r\nmain()", "import heapq\r\nfrom bisect import bisect_left, bisect_right\r\nfrom itertools import accumulate\r\n\r\nR = lambda: map(int, input().split())\r\nn, k = R()\r\nobjs = sorted(list(R()),reverse=True)\r\nq = [0] * k\r\nres = 0\r\nfor o in objs:\r\n t = heapq.heappop(q)\r\n if t:\r\n res = max(res, t + o)\r\n else:\r\n heapq.heappush(q, o)\r\nprint(max(q + [res]))", "n, k = map(int, input().split())\r\narr = list(map(int, input().split()))\r\narr.reverse()\r\n\r\nidx = 0\r\nans = 0\r\n\r\nwhile idx < n and n - idx - 1 <= (k - 1) * 2:\r\n ans = max(ans, arr[idx])\r\n idx += 1\r\n k -= 1\r\n\r\nleft = idx\r\nright = n - 1\r\n\r\nwhile left < right:\r\n ans = max(arr[left] + arr[right], ans)\r\n left += 1\r\n right -= 1\r\n\r\nprint(ans)\r\n", "def read_ints():\n return map(int, input().strip().split())\n\n\nn, k = read_ints()\ns = list(read_ints())\n\n# 2 * k1 + k2 = n\n# k1 + k2 = k\n# -\n# k1 = n - k\n# k2 = k - (n - k) = 2k - n\n\nif n <= k:\n print(max(s))\nelse:\n k1 = n - k\n k2 = 2*k - n\n if k2 > 0:\n m2 = max(s[2 * k1:])\n else:\n m2 = 0\n m1 = max(a + b for (a, b) in zip(s[:k1], s[2 * k1 - 1:k1 - 1:-1]))\n print(max(m1, m2))\n", "z=input().split()\r\na=input().split()\r\nn=int(z[0])\r\nm=int(z[1])\r\ns=int(a[n-1])\r\nfor i in range(n-m):\r\n\ts=max(s,int(a[i])+int(a[2*n-2*m-i-1]))\r\nprint(s)", "a, b = map(int, input().split(' '))\r\nx = list(map(int, input().split(' ')))\r\n\r\ndef f(num):\r\n lo = 0\r\n hi = a-1\r\n ct = 0\r\n while lo <= hi:\r\n if lo == hi:\r\n ct += 1\r\n break\r\n if x[lo] + x[hi] <= num:\r\n lo+=1\r\n hi-=1\r\n else:\r\n hi-=1\r\n ct+=1\r\n return ct\r\n\r\nlo = max(x)\r\nhi = 100000000\r\nwhile lo < hi:\r\n mid = (lo + hi) // 2\r\n if f(mid) > b:\r\n lo = mid + 1\r\n else:\r\n hi = mid\r\n\r\nprint(lo)\r\n", "n,k=map(int,input().split())\r\nlst=list(map(int,input().split()))\r\nr=max(lst)\r\nfor i in range(0,n-k):\r\n r=max(r,lst[i]+lst[2*(n-k)-1-i])\r\nprint(r)\r\n", "n, k = map(int, input().split())\r\narr = list(map(int, input().split()))[::-1]\r\nhigh = arr[0]\r\nfor i in range(k, n):\r\n high = max(high, arr[i] + arr[2 * k - i - 1])\r\nprint(high)", "import sys\r\n\r\ndef solve(n, m, x):\r\n if(n == m):\r\n return x[n-1]\r\n pares = 0\r\n while((pares*2)+(m-pares) < n):\r\n pares += 1\r\n maxi = x[n-1]\r\n j = pares*2 - 1\r\n for i in range(pares):\r\n maxi = max(maxi, x[i]+x[j-i])\r\n return maxi\r\n\r\nx = [int(x) for x in input().split()]\r\nn = x[0]\r\nm = x[1]\r\nx = [int(x) for x in input().split()]\r\nprint(solve(n, m, x))", "n,k = map(int,input().split())\r\na = list(map(int,input().split()))\r\nif k>=n:\r\n print(max(a))\r\nelse:\r\n i = n-1\r\n ans = 0\r\n for j in range(2*k-n):\r\n ans = max(ans,a[i])\r\n i-=1\r\n start = 0\r\n while start<i:\r\n ans = max(ans,a[i]+a[start])\r\n i-=1\r\n start+=1\r\n print(ans)\r\n", "import sys\r\nn ,k = map(int, input().split())\r\ns = list(map(int, input().split()))\r\na = s[-k :];\r\nans = max(a)\r\no = 0\r\nfor i in range(n - k - 1 ,-1, -1):\r\n a[o] += s[i]\r\n ans = max(ans,a[o])\r\n o+=1\r\nprint(ans)", "n, k = map(int, input().split())\r\nar = list(map(int, input().split()))\r\nans = int(ar[n-1])\r\ni = int(0)\r\nL = int(0)\r\nR = int(n-((k+k)-n)-1)\r\nwhile L < R:\r\n ans = max(ans, ar[L]+ar[R])\r\n L += 1\r\n R -= 1\r\nprint(ans)", "from sys import stdin\n\ndef main():\n nextint = map(int, stdin.read().split()).__next__\n n, k = nextint(), nextint()\n s = [nextint() for _ in range(n)]\n print(max([s[x] + s[y] \\\n for x, y in zip(range(n - k - 1, -1, -1), range(n - k, n))] + [s[-1]]))\n\nmain()\n", "#your code goes here\nn,k=[int(x) for x in input().split()]\nl=[int(x) for x in input().split()]\nm=l[-1]\nfor i in range(n-k):\n\tm=max(m,l[i]+l[2*(n-k)-i-1])\nprint(m)\n\t\t\t \t \t\t\t\t \t \t \t \t\t\t\t\t\t\t", "n,k = list(map(int,input().split()))\r\narr = list(map(int,input().split()))\r\nt = n-k\r\nm = 0\r\nfor i in range(n):\r\n if i<t:\r\n s = arr[i] + arr[2*t-1-i]\r\n elif i<2*t:\r\n continue\r\n else:\r\n s = arr[i]\r\n if s>m:\r\n m = s\r\nprint(m)", "n, k = map(int, input().split())\r\ns = [int(i) for i in input().split()]\r\nmax_ = s[n - 1]\r\nfor i in range(n - k):\r\n max_ = max(max_, s[i] + s[2 * (n - k) - i - 1])\r\nprint(max_)", "def main():\n n, k = map(int, input().split())\n l = list(map(int, input().split()))\n for i, x in zip(range((n - k) * 2 - 1, n - k - 1, -1), l):\n l[i] += x\n print(max(l))\n\n\nif __name__ == '__main__':\n main()\n", "def solve():\r\n # Read input\r\n n, k = map(int, input().strip().split())\r\n cowbells = list(map(int, input().strip().split()))\r\n\r\n # Add (2k - n) zeros in the cowbells to simplify problem\r\n num_zeros = (2 * k - n)\r\n cowbells = [0] * num_zeros + cowbells\r\n\r\n # Initialize weight of boxes\r\n boxes = [0] * k\r\n\r\n # Add cowbells to boxes using our hyposthesis\r\n for i in range(k):\r\n boxes[i] = cowbells[i] + cowbells[2 * k - i - 1]\r\n\r\n # Return max weight of boxes\r\n print(max(boxes))\r\nsolve()", "n, k = list(map(int, input().split()))\r\nsizes = list(map(int, input().split()))\r\nleft, right = max(sizes), sum(sizes)\r\nwhile left < right:\r\n mid = (left + right) // 2\r\n counter = 0\r\n i, j = 0, len(sizes) - 1\r\n while i <= j:\r\n if sizes[i] + sizes[j] <= mid:\r\n i += 1 \r\n j -= 1 \r\n else:\r\n j -= 1\r\n counter += 1\r\n if counter <= k:\r\n right = mid\r\n else:\r\n left = mid + 1\r\n\r\nprint(right)", "n,k = map(int,input().split())\r\ns = list(map(int,input().split()))\r\nextra = 2*k - n\r\nmax1 = -1\r\nfor i in range((n-extra)//2):\r\n sum1 = s[i] + s[n-extra-1-i]\r\n if sum1 > max1:\r\n max1 = sum1\r\nprint(max(max1,s[-1]))", "import sys\r\ninput=sys.stdin.readline\r\n\r\nn,k=map(int,input().split())\r\na=list(map(int,input().strip().split()))\r\n\r\ndef helper(mid):\r\n c=i=0\r\n j=n-1\r\n while i<j:\r\n if a[i]+a[j]<=mid:\r\n i+=1\r\n j-=1\r\n c+=1\r\n else:\r\n c+=1\r\n j-=1\r\n if i==j:c+=1\r\n return c<=k\r\nl,r=max(a),10**16\r\n#print(helper(8))\r\nwhile l<r:\r\n mid=(l+r)//2\r\n if helper(mid):\r\n r=mid\r\n else:\r\n l=mid+1\r\nsys.stdout.write(str(r)+'\\n')", "n, k = map(int, input().split(\" \"))\r\ns = list(map(int, input().split(\" \")))\r\nresult = s[-1]\r\nwhile k*2 > n:\r\n n -= 1\r\n k -= 1\r\nif n > 0:\r\n for i in range(int(n/2)):\r\n result = max( result, s[i] + s[n-1-i])\r\nprint(result)", "n, k = map(int, input().split())\r\ns = list(map(int, input().split()))\r\n\r\ntotal = 0\r\ns.sort()\r\ns.reverse()\r\nif k >= n:\r\n print(s[0])\r\n exit()\r\nx = n - k\r\ny = k - x\r\nfor it in range(y):\r\n if s[it] > total:\r\n total = s[it]\r\nij = -1\r\nfor it in range(y, k):\r\n total = max(total, s[it] + s[ij])\r\n ij -= 1\r\nprint(total)\r\n", "import io\r\nimport math\r\n# libraries\r\n\r\nn,m=map(int,input().split())\r\n\r\nlima=sorted(map(int,input().split()))\r\n\r\nmike=lima[-1]\r\n\r\nif m>=n: print(mike)\r\n\r\nelse:\r\n kite=2*m-n\r\n\r\n for i in range((n-kite)//2):\r\n j=(n-kite-1)-i\r\n t=lima[i]+lima[j]\r\n if t>mike: mike=t\r\n \r\n print(mike)", "bells, boxes = map(int, input().split())\r\nweights = list(map(int, input().split()))\r\n\r\nheaviest = -1\r\n\r\nwhile boxes > bells // 2 and bells > 0:\r\n heaviest = max(heaviest, weights[bells-1])\r\n boxes -= 1\r\n bells -= 1\r\n\r\ni, j = 0, bells-1\r\nwhile i <= j:\r\n if i == j:\r\n heaviest = max(heaviest, weights[i])\r\n else:\r\n heaviest = max(heaviest, weights[i] + weights[j])\r\n i += 1\r\n j -= 1\r\n\r\nprint(heaviest)\r\n", "import sys\r\nimport math\r\nimport collections\r\nimport heapq\r\nimport decimal\r\ninput=sys.stdin.readline\r\nn,k=(int(i) for i in input().split())\r\nl=[int(i) for i in input().split()]\r\nlo=max(l)\r\nhi=2*max(l)\r\nwhile(lo<hi):\r\n mid=(lo+hi)//2\r\n c=0\r\n i=0\r\n j=n-1\r\n while(i<=j):\r\n if(l[i]+l[j]<=mid):\r\n c+=1\r\n i+=1\r\n j-=1\r\n else:\r\n c+=1\r\n j-=1\r\n if(c<=k):\r\n hi=mid\r\n else:\r\n lo=mid+1\r\nprint(lo)", "\"\"\"\nCodeforces Round #334 (Div. 2)\n\nProblem 604 B. More Cowbell\n\n@author yamaton\n@date 2015-12-01\n\"\"\"\n\nimport itertools as it\nimport functools\nimport operator\nimport collections\nimport math\nimport sys\n\n\ndef solve(xs, n, k):\n if k >= n:\n return max(xs)\n ys1 = xs[:(n - k)]\n ys2 = xs[(n - k) : 2*(n - k)]\n maxval = max(a + b for (a, b) in zip(ys1, ys2[::-1]))\n return max(maxval, xs[-1])\n\n# def pp(*args, **kwargs):\n# return print(*args, file=sys.stderr, **kwargs)\n\n\ndef main():\n n, k = map(int, input().split())\n xs = [int(c) for c in input().split()]\n assert len(xs) == n\n result = solve(xs, n, k)\n print(result)\n\n\nif __name__ == '__main__':\n main()\n", "n , k = map(int,input().split())\r\nlis = list(map(int,input().split()))\r\nm=0\r\naa=(n-k)*2\r\n#print(lis)\r\nfor i in range(0,aa//2):\r\n lis[aa-i-1]+=lis[i]\r\n# print(aa-i,i)\r\n#print(lis,aa)\r\nprint(max(lis))\r\n", "n, k = map(int, input().split())\ns = list(map(int, input().split()))\nfinall = []\nsp = n - k\nif sp > 0:\n a1 = s[0:sp]\n a2 = s[sp:sp*2]\n for i in range(0,sp):\n finall.append(a1[i]+a2[-(i+1)])\n print(max(finall+s[sp*2::]))\nelse:\n print(s[-1])", "a, b = map(int, input().split())\r\ns = list(map(int, input().split()))\r\ns = [-1]+s\r\nif a <= b:\r\n\tprint(s[a])\r\nelse:\r\n\tsol = s[a]\r\n\tfor i in range(a-b):\r\n\t\tx = s[a-b-i]+s[a-b+1+i]\r\n\t\tif x > sol:\r\n\t\t\tsol = x\r\n\tprint(sol)", "import sys\r\n\r\nn,k = map(int,input().split())\r\narr = list(map(int,input().split()))\r\n\r\nr = 0\r\ni = n-1\r\np = 0\r\nif n // 2 == k:\r\n for i in range(0,n//2):\r\n r = max(r,arr[i] + arr[n-1-i])\r\nelse:\r\n two = n-k\r\n one = k - two\r\n if two > 0:\r\n for i in range(0,two*2):\r\n r = max(r, (arr[i] + arr[two*2-i-1]) )\r\n r = max(r,arr[n-1])\r\nprint(r)\r\n\r\n\r\n", "import sys\ndef main():\n\tn, k = map(int, sys.stdin.readline().split())\n\ts = list(map(int, sys.stdin.readline().split()))\n\ts = [-1]+s\n\tif n <= k:\n\t\tprint(s[n])\n\telse:\n\t\tsol = s[n]\n\t\tfor i in range(n-k):\n\t\t\tx = s[n-k-i]+s[n-k+1+i]\n\t\t\tif x > sol:\n\t\t\t\tsol = x\n\t\tprint(sol)\nmain()\n", "n,k = map(int, input().strip().split())\na = list(map(int, input().strip().split()))\nl = max(a)-1\nr = 100000000001\n\ndef check(s):\n\tcount = 0\n\tl = 0\n\tr = n-1\n\twhile l<=r:\n\t\tif l!=r and a[l]+a[r]<=s:\n\t\t\tcount +=1\n\t\t\tl+=1\n\t\t\tr-=1\n\t\telse:\n\t\t\tr-=1\n\t\t\tcount +=1\n\tif count <= k:\n\t\treturn True\n\telse:\n\t\treturn False\n\nwhile (r-l>1):\n\tm = (r+l+1)//2\n\t#print(l,m,r)\n\tif check(m):\n\t\tr = m\n\telse:\n\t\tl = m\n\t\nprint(r)\n", "n,c=map(int,input().split())\r\nw=list(map(int,input().split()))\r\nl,r=1,sum(w)\r\nwhile r-l>1:\r\n m=(r+l)//2\r\n p,p1=0,n-1\r\n k,k1=0,0\r\n while (p<=p1):\r\n if w[p1]>m:\r\n break\r\n else:\r\n if (p1!=p and w[p1]+w[p]<=m):\r\n p1-=1\r\n p+=1\r\n k+=2\r\n k1+=1\r\n else:\r\n k+=1\r\n p1-=1\r\n k1+=1\r\n if k==n and k1<=c:\r\n r=m\r\n else:\r\n l=m\r\nprint (r)\r\n", "from sys import stdin\r\ninput = stdin.readline\r\n\r\ndef answer():\r\n \r\n ans , ind = max(a) , 0\r\n for i in range(2*(n - k) - 1 , -1 , -1):\r\n\r\n ans = max(ans , a[i] + a[ind])\r\n\r\n ind += 1\r\n\r\n return ans\r\n \r\nfor T in range(1):\r\n\r\n n , k = map(int,input().split())\r\n\r\n a = list(map(int,input().split()))\r\n\r\n\r\n print(answer())", "n, k = map(int, input().split())\r\ns = list(map(int, input().split()))\r\n\r\nres = s[-1]\r\n\r\nwhile 2*k > n:\r\n n -= 1\r\n k -= 1\r\n\r\nif n > 0:\r\n for i in range(int(n/2)):\r\n res = max(res, s[i] + s[n-1-i])\r\n\r\nprint(res)", "n, k = map(int, input().split())\ns = list(map(int, input().split()))\ns = [-1]+s\nif n <= k:\n\tprint(s[n])\nelse:\n\tsol = s[n]\n\tfor i in range(n-k):\n\t\tx = s[n-k-i]+s[n-k+1+i]\n\t\tif x > sol:\n\t\t\tsol = x\n\tprint(sol)\n", "n,k = map(int,input().split())\r\nlst = list(map(int,input().split()))\r\n\r\ndef helper(size):\r\n l,r = 0,len(lst)-1\r\n count = 0\r\n while l <= r:\r\n if lst[l] + lst[r] <= size:\r\n l += 1\r\n r -= 1\r\n else:\r\n r -= 1\r\n count += 1\r\n return count\r\n\r\nif len(lst) > 1: \r\n l,r = lst[-1], lst[-1]+lst[-2]\r\n while l <= r:\r\n mid = (l+r) // 2\r\n\r\n if helper(mid) > k:\r\n l = mid + 1\r\n else:\r\n best = mid\r\n r = mid - 1\r\n print(best)\r\nelse:\r\n print(lst[0])\r\n", "n,k=map(int,input().split())\ns=[int(x)for x in input().split()]\nans=0\nif k>=n:print(max(s))\nelse:\n while n//2<k:\n ans=max(ans,s.pop())\n k-=1\n n-=1\n i,j=0,len(s)-1\n while i<j:\n ans=max(ans,s[i]+s[j])\n i+=1\n j-=1\n print(ans)\n", "from math import inf\r\n\r\n\r\ndef boxes(cap, arr):\r\n i = 0\r\n j = len(arr) - 1\r\n ans = 0\r\n\r\n while i <= j:\r\n if arr[j] + arr[i] > cap:\r\n if arr[j] > cap:\r\n return inf\r\n ans += 1\r\n j -= 1\r\n else:\r\n i += 1\r\n j -= 1\r\n ans += 1\r\n\r\n return ans\r\n\r\n\r\ndef main():\r\n n, k = map(int, input().split())\r\n arr = list(map(int, input().split()))\r\n l = max(arr)\r\n r = 0\r\n\r\n if n > 1:\r\n r = arr[-1] + arr[-2]\r\n else:\r\n r = arr[-1]\r\n\r\n best = None\r\n\r\n while l <= r:\r\n mid = l + (r - l) // 2\r\n bb = boxes(mid, arr)\r\n\r\n if bb > k:\r\n l = mid + 1\r\n else:\r\n r = mid - 1\r\n best = mid\r\n\r\n print(best)\r\n\r\n\r\nmain()\r\n", "n, k = (int(x) for x in input().split())\ns = [int(x) for x in input().split()]\nt = max(n - k, 0)\nprint(max([s[i] + s[2*t - 1 - i] for i in range(t)] + s[2*t:]))\n", "n, m = list(map(int, input().rstrip().split()))\na = list(map(int, input().rstrip().split()))\ns = a[-1]\nfor i in range(n-m):\n \ts=max(s,int(a[i])+int(a[2*n-2*m-i-1]))\nprint(s)", "def minSizeBox(N, B, sizes):\n\tif B >= N:\n\t\treturn sizes[N-1]\n\n\tmaxSoFar = sizes[N-1]\n\n\t# find number of pairs\n\tk = 1\n\ti = 0\n\twhile k < N:\n\t\ti = N - 2*k\n\t\tif i + k <= B:\n\t\t\tbreak\n\t\tk += 1\n\n\tend = N - 1 - i\n\tstart = 0\n\n\twhile start < end:\n\t\tmaxSoFar = max(sizes[start]+sizes[end],maxSoFar)\n\t\tstart += 1\n\t\tend -= 1\n\n\treturn maxSoFar\n\nif __name__==\"__main__\":\n\tcb, boxes = input().split()\n\tcb, boxes = int(cb),int(boxes)\n\tsizes = input().split()\n\tsizes = [ int(x) for x in sizes ]\n\tminSize = minSizeBox(cb, boxes, sizes)\n\tprint(minSize)", "#!/usr/bin/env python3\n# 604B_cowbell.py - Codeforces.com/problemset/problem/604/B by Sergey 2015\n\nimport unittest\nimport sys\n\n###############################################################################\n# Cowbell Class (Main Program)\n###############################################################################\n\n\nclass Cowbell:\n \"\"\" Cowbell representation \"\"\"\n\n def __init__(self, test_inputs=None):\n \"\"\" Default constructor \"\"\"\n\n it = iter(test_inputs.split(\"\\n\")) if test_inputs else None\n\n def uinput():\n return next(it) if it else sys.stdin.readline().rstrip()\n\n # Reading single elements\n [self.n, self.k] = map(int, uinput().split())\n\n # Reading a single line of multiple elements\n self.nums = list(map(int, uinput().split()))\n\n def calculate(self):\n \"\"\" Main calcualtion function of the class \"\"\"\n\n b = self.nums[self.n-self.k:]\n for i in range(self.n-self.k):\n b[i] += self.nums[self.n-self.k-1-i]\n result = max(b)\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 \"\"\" Cowbell class testing \"\"\"\n\n # Constructor test\n test = \"2 1\\n2 5\"\n d = Cowbell(test)\n self.assertEqual(d.n, 2)\n self.assertEqual(d.k, 1)\n self.assertEqual(d.nums, [2, 5])\n\n # Sample test\n self.assertEqual(Cowbell(test).calculate(), \"7\")\n\n # Sample test\n test = \"4 3\\n2 3 5 9\"\n self.assertEqual(Cowbell(test).calculate(), \"9\")\n\n # Sample test\n test = \"3 2\\n3 5 7\"\n self.assertEqual(Cowbell(test).calculate(), \"8\")\n\n # My tests\n test = \"\"\n # self.assertEqual(Cowbell(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 = Cowbell(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(Cowbell().calculate())\n", "#!/usr/bin/env python3\nimport itertools, functools, math\n\ndef solve(n, k, s):\n if n <= k:\n return s[-1]\n needed = n\n pairs = 0\n while needed > k:\n needed -= 1\n pairs += 1\n size = s[-1]\n for i in range(pairs):\n size = max(size, s[i] + s[2*pairs - 1 - i])\n return size\n\nif __name__ == '__main__':\n n, k = map(int, input().split())\n s = list(map(int, input().split()))\n print(solve(n, k, s))\n\n", "def main():\n\tn, k = (map(int, input().split()))\n\ts = list(map(int, input().split()))\n\n\tminSize = s[n - 1]\n\t\n\tif n <= k:\n\t\tprint(minSize)\n\t\texit()\n\n\t\n\ti = 0\n\ttotal = n - 1\n\twhile 2 * k > n :\n\t\tn, k = n - 1, k - 1\n\tfor i in range(k):\n\t\tminSize = max(minSize, s[i] + s[n - i - 1])\n\n\tprint(minSize)\n\n\n\nif __name__ == '__main__':\n\tmain()", "n, k = list(map(int, input().split()))\r\nl = list(map(int, input().split()))\r\n\r\nsingle = 2*k - n\r\n\r\nmaximum = 0\r\nfor i in range((n - single)//2):\r\n a = l[i] + l[n - single - 1 - i]\r\n if a > maximum:\r\n maximum = a\r\n\r\nprint(max(maximum, l[-1]))\r\n", "def main():\r\n\t(n, k) = (int(x) for x in input().split())\r\n\tL = [int(x) for x in input().split()]\r\n\tresult = solver(L, k)\r\n\tprint(result)\r\n\r\ndef solver(L, k):\r\n\tn = len(L)\r\n\tif k >= n:\r\n\t\treturn L[len(L) - 1]\r\n\telse:\r\n\t\tmaximum = L[len(L) - 1]\r\n\t\tpack2s = L[:2 * (n - k)]\r\n\t\tfor i in range(n - k):\r\n\t\t\tsize = pack2s[i] + pack2s[len(pack2s) - i - 1] \r\n\t\t\tif size > maximum:\r\n\t\t\t\tmaximum = size\r\n\t\treturn maximum\r\n\r\n# L1 = [2, 5]\r\n# k1 = 1\r\n# print(solver(L1, k1))\r\n\r\n# L2 = [2, 3, 5, 9]\r\n# k2 = 3\r\n# print(solver(L2, k2))\r\n\r\n# L3 = [3, 5, 7]\r\n# k3 = 2\r\n# print(solver(L3, k3))\r\nmain()", "n,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\nd=n-k\r\nm=0\r\nfor i in range(d):\r\n m=max(m,a[i]+a[2*d-i-1])\r\nprint(max(m,a[-1]))", "from collections import deque\r\n\r\nn, k = map(int, input().split())\r\na = deque(map(int, input().split()))\r\nif k >= n:\r\n print(max(a))\r\nelse:\r\n ret = -float('inf')\r\n for _ in range(2 * k - n):\r\n v = a.pop()\r\n ret = max(ret, v)\r\n for i in range(len(a) // 2):\r\n ret = max(ret, a[i] + a[len(a) - i - 1])\r\n print(ret)", "n,k=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nif k>=n:\r\n print(l[n-1])\r\nelse:\r\n one=2*k-n\r\n s=-1\r\n sum=-1\r\n if one>=1:\r\n s=l[n-1]\r\n idx=n-one\r\n l=[l[i] for i in range(idx)]\r\n for i in range(idx//2):\r\n p=l[i]+l[idx-i-1]\r\n if p>sum:\r\n sum=p\r\n else:\r\n for i in range(n//2):\r\n p=l[i]+l[n-i-1]\r\n if p>sum:\r\n sum=p\r\n if sum>=s:\r\n print(sum)\r\n else:\r\n print(s)\r\n \r\n\r\n \r\n", "n,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\nif n<=k:\r\n print(max(a))\r\nelse:\r\n m=a[-1]\r\n for i in range(0,n-k):\r\n m=max(m,a[i]+a[2*(n-k)-i-1])\r\n print(m)", "n,k=map(int,input().split())\r\nl=[0]*(2*k-n)+list(map(int,input().split()))\r\nm=0\r\nx,y=0,1\r\nfor i in range(len(l)):\r\n z=l[x]+l[-y]\r\n m=max(m,z)\r\n x=x+1\r\n y=y+1\r\nprint(m)\r\n", "# https://codeforces.com/problemset/problem/604/B\n\nimport math\ndef needed_box(size):\n current_count_box = 0\n i, j = 0, number_of_cowbells-1\n while i < j:\n if list_cowbells[i] + list_cowbells[j] <= size:\n i+=1\n j-=1\n elif list_cowbells[j] <= size:\n j-=1\n else:\n return int(1e9)\n current_count_box += 1\n return current_count_box if i > j else current_count_box+1\n\nnumber_of_cowbells, number_of_box = map(int, input().strip().split(' '))\nlist_cowbells = list(map(int, input().strip().split(' ')))\n\nif number_of_cowbells == 1:\n print(list_cowbells[0])\nelse:\n left, right = 0, list_cowbells[-1] + list_cowbells[-2]\n while left < right:\n middle = math.ceil((right+left+1)/2)\n number_of_needed_box = needed_box(middle)\n if number_of_needed_box > number_of_box:\n left = middle\n elif number_of_needed_box <= number_of_box:\n right = middle-1\n print(right+1)\n\n ", "n,k = list(map(int, input().split()))\ns = list(map(int, input().split()))\na = max(n-k, 0)\nif a==0:\n\tprint(s[-1])\nelse:\n\tm = s[-1]\n\tfor i in range(a):\n\t\tm = max(m, s[i] + s[2*a-1-i])\n\tprint(m)\n\t\n", "def ray(b, lst):\r\n lst.sort()\r\n ans=max(lst)\r\n ln=len(lst)\r\n for i in range(ln-b):\r\n ans=max(ans,lst[i]+lst[2*(ln-b)-i-1])\r\n return ans\r\n\r\nn,b=map(int, input().split())\r\nlst=list(map(int,input().split()))\r\nprint(ray(b, lst))\r\n", "t = input()\r\ntemp = t.split()\r\nn = int(temp[0])\r\nk = int(temp[1])\r\n\r\ns = input()\r\ntemp = s.split()\r\ncowbells = [int(i) for i in temp]\r\n\r\nif (k >= n):\r\n print(cowbells[n-1])\r\nelse:\r\n singleBoxes = 2*k - n\r\n doubleBoxes = 2*(n-k)\r\n j = doubleBoxes - 1\r\n maximum = 0\r\n for i in range(doubleBoxes - 1):\r\n if (i == j):\r\n break\r\n else:\r\n maximum = max(maximum, cowbells[i] + cowbells[j])\r\n j -= 1\r\n\r\n print(max(maximum,cowbells[n-1]))\r\n", "n, k = map(int, input().split(\" \"))\ns = list(map(int, input().split(\" \")))\ns.sort()\nresult = s[len(s) - 1]\nwhile k*2 > n:\n\tn -= 1\n\tk -= 1\nif n > 0:\n\tfor i in range(int(n/2)):\n\t\tresult = max( result, s[i] + s[n-1-i])\nprint(result)", "n,k = map(int,input().split())\r\na = list(map(int,input().split()))\r\nx = 2*k-n\r\nb = a[:n-x]\r\nanss = a[n-x:]\r\nfor i in range(len(b)//2):\r\n anss.append(b[i]+b[len(b)-i-1])\r\nprint(max(anss))\r\n", "import sys\r\nsys.stdin.readline\r\nsize , turn = map(int, input().split())\r\nnums = list(map(int, input().split()))\r\nl = nums[-1]\r\nr = nums[-1] + nums[-2] if size > 1 else nums[-1]\r\nwhile l <= r:\r\n cap = l + (r-l) // 2\r\n st, e = 0, size -1\r\n cur = turn\r\n while st <= e:\r\n if nums[st] + nums[e] <= cap:\r\n st += 1\r\n e -= 1\r\n elif nums[e] <= cap:\r\n e -= 1\r\n cur -= 1\r\n if cur >= 0:\r\n r = cap - 1\r\n else:\r\n l = cap + 1\r\nprint(l)", "def size(n, k, s):\n if n <= k:\n return s[-1]\n p = n-k\n return max(s[-1], max(s[i]+s[2*p-i-1] for i in range(p)))\n\n\nif __name__ == '__main__':\n n, k = map(int, input().split())\n s = list(map(int, input().split()))\n print(size(n, k, s))\n", "n, k = map(int, input().split())\r\narr = list(map(int, input().split()))\r\n\r\nif n <= k:\r\n print(arr[-1])\r\nelse:\r\n group_two = n - k\r\n mx = arr[-1]\r\n arr = arr[: group_two * 2]\r\n n = len(arr)\r\n left, right = 0, n - 1\r\n while left < right:\r\n mx = max(mx, arr[left] + arr[right])\r\n left += 1\r\n right -= 1\r\n print(mx)", "__author__ = 'heckboy'\r\n#!/usr/bin/env python\r\nn, k = map(int,input().split())\r\nL = list(map(int,input().split()))\r\ni = 0\r\np = 0\r\nz = 1\r\nR = [0 for _ in range(k)]\r\nwhile i<n:\r\n R[p] += L[n-1-i]\r\n p = p + z\r\n i+=1\r\n if p == k or p == -1:\r\n z = z*(-1)\r\n if p == k:\r\n p = p - 1\r\n else:\r\n p = p + 1\r\nprint(max(R))", "n , k = list(map(int , input().split()))\r\nli = list(map(int , input().split()))\r\ndef isValid(target):\r\n count = 0\r\n i , j = 0 , len(li) - 1\r\n while i <= j:\r\n if i == j:\r\n count += 1\r\n i += 1\r\n elif li[i] + li[j] <= target:\r\n i += 1\r\n j -= 1\r\n count += 1\r\n else:\r\n j -= 1 \r\n count += 1\r\n \r\n return True if count <= k else False\r\n\r\nlo = max(li)\r\nhi = sum(li)\r\nwhile lo <= hi:\r\n mid = (lo + hi) // 2\r\n if isValid(mid):\r\n hi = mid\r\n else:\r\n lo = mid + 1\r\n if lo == hi:\r\n print(hi)\r\n break\r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n\r\n ", "n,k=map(int,input().split())\r\nl=sorted(map(int,input().split()))\r\nma=l[-1]\r\nif k>=n: print(ma)\r\nelse:\r\n kk=2*k-n\r\n for i in range((n-kk)//2):\r\n j=(n-kk-1)-i\r\n t=l[i]+l[j]\r\n if t>ma: ma=t\r\n print(ma)", "def can(s, m, k):\n need = 0\n l = 0\n r = len(s) - 1\n while l <= r:\n if s[r] + s[l] <= m:\n need += 1\n r -= 1\n l += 1\n else:\n need += 1\n r -= 1\n return need <= k\n\nn, k = (int(x) for x in input().split())\ns = [int(x) for x in input().split()]\nres = s[-1] - 1\nstep = 2 ** 30\nwhile step:\n m = res + step\n if not can(s, m, k):\n res += step\n step //= 2\nprint(res + 1)\n", "\r\nn,group = list(map(int,input().split()))\r\nnums = list(map(int,input().split()))\r\nj=n-1\r\nans=max(nums)\r\nfor i in range(group*2-n):\r\n j=j-1\r\ni=0\r\nwhile j>i:\r\n ans=max(ans,nums[j]+nums[i])\r\n i=i+1\r\n j=j-1\r\nprint(ans)", "n, k = [int(i) for i in input().split()]\n\ns = [int(i) for i in input().split()]\n\ncouples = n - k\n\nsize = 0\n\nif 2 * k - n > 0:\n size = s[n - 1]\n\nfor i in range(2 * couples - 1, -1, -1):\n size = max(size, s[i] + s[2 * couples - i - 1])\n\nprint(size)\n", "n, k = map(int, input().split())\ns = list(map(int, input().split()))\n\nmaxim = s[-1]\ntwoBells = n - k\nfor i in range(twoBells):\n maxim = max(maxim, s[i] + s[2*twoBells-i-1])\nprint(maxim)\n \t\t\t\t \t \t \t \t\t \t \t \t", "n,k = map(int,input().split())\r\n\r\na = list(map(int,input().split()))\r\n\r\n\r\nif k >= n :\r\n print(max(a))\r\n\r\nelse:\r\n sum = max(a)\r\n a = a[:2*(n-k)]\r\n #print(a)\r\n for i in range(len(a)):\r\n sum = max(a[i]+a[- (i + 1)],sum)\r\n print(sum)", "n,k = map(int, input().split())\r\nl = list(map(int, input().split()))\r\n\r\nx = 2*k - n\r\nans = l[-1]\r\nfor i in range(n-x):\r\n j = n-x-1-i\r\n if i==j:\r\n ans = max(ans,l[i])\r\n break\r\n elif i>j:\r\n break\r\n else:\r\n ans = max(ans,l[i]+l[j])\r\nprint(ans)\r\n \r\n ", "n, k = map(int, input().split())\n\nvalues = list(map(int, input().split()))\n\nstart ,end = 0, len(values) - 1\n\nres = 0\n\nwhile start <= end:\n length = (end - start) + 1\n if (length % k) or length == k:\n res = max(res, values[end])\n else:\n res = max(res, values[start] + values[end])\n start += 1\n end -= 1\n k -= 1\n\nprint(res)\n", "inp=input().split()\r\nn=int(inp[0])\r\nk=int(inp[1])\r\ni=0\r\narray=[]\r\nresult=0\r\ninp=input().split()\r\nwhile i<n:\r\n array.append(int(inp[i]))\r\n i=i+1\r\narray.sort()\r\nif (n<=k):\r\n result=array[n-1]\r\nelse:\r\n one=2*k-n\r\n len=n-one\r\n i=0\r\n while i<len/2:\r\n result=max(result,array[i]+array[len-1-i])\r\n i=i+1\r\n i=len\r\n while i<n:\r\n result=max(result,array[i])\r\n i=i+1\r\nprint(result)\r\n\r\n\r\n\r\n\r\n", "read = lambda: map(int, input().split())\r\nn, k = read()\r\nS = list(read())\r\n\r\ndef bin(L, R):\r\n while R - L > 1:\r\n M = (R + L) // 2\r\n if f(M): R = M\r\n else: L = M\r\n return R\r\n\r\ndef f(s):\r\n l = 0\r\n r = n - 1\r\n cnt = 0\r\n while r - l > 0:\r\n if S[r] + S[l] <= s:\r\n l += 1\r\n if S[r] <= s:\r\n r -= 1\r\n cnt += 1\r\n if r - l == 0: cnt += 1\r\n if cnt > k: return False\r\n return True\r\n\r\nans = bin(S[-1] - 1, 10 ** 9)\r\nprint(ans)\r\n", "import sys\noo=1000000000000000\nar=[]\nn, k=map(int, input().split())\nar=list(map(int, input().split()))\nar.sort()\nstart, end, add=0, oo, n-k\nfor i in range(n):\n\tif(start<ar[i]): start=ar[i]\nfor i in range(n-k):\n\tend=ar[i]+ar[(add<<1)-1-i]\n\tif(end>start): start=end\nprint(start)\n\n", "n,k=map(int,input().split())\r\na=[int(x) for x in input().split()]\r\ndef bs(s):\r\n c=0\r\n left=0\r\n right=n-1\r\n while(left<=right):\r\n c+=1\r\n if left==right:\r\n break\r\n if a[left]+a[right]<=s:\r\n left+=1\r\n right-=1\r\n else:\r\n right-=1\r\n if c<=k:\r\n return True\r\n else:\r\n return False\r\nl,h=max(a),10**10\r\nwhile(l<=h):\r\n m=l+(h-l)//2\r\n if bs(m):\r\n ans=m\r\n h=m-1\r\n else:\r\n l=m+1\r\nprint(ans)", "n, k = map(int, input().split())\r\nl = list(map(int, input().split()))\r\nl.reverse()\r\ny = n - k\r\nx = k + k - n\r\nm = max(l)\r\nl = l[x:]\r\nn = len(l)\r\nfor i in range(n // 2):\r\n m = max(l[i] + l[n - 1 - i], m)\r\nprint(m)", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn, k = map(int, input().split())\r\nw = list(map(int, input().split()))\r\n\r\nm = 2*(n-k)\r\nc = w[-1]\r\nw = w[:m]\r\nfor i in range(m//2):\r\n c = max(c, w[i]+w[m-1-i])\r\nprint(c)", "n,m=map(int,input().split())\r\na=input().split()\r\ns=int(a[-1])\r\nfor i in range(n-m):\r\n\ts=max(s,int(a[i])+int(a[2*n-2*m-i-1]))\r\nprint(s)", "n,k = [int(x) for x in input().split()]\r\ns = [int(x) for x in input().split()]\r\nt = []\r\nproper = n-k\r\nt.append(s[-1])\r\nfor i in range(proper):\r\n t.append(s[i]+s[(2*(proper)-i)-1])\r\nprint(max(t))", "R = lambda : map(int, input().split())\r\nF = lambda : [int(x) for x in input().split()]\r\nn, k = R()\r\ns = F()\r\nx = n - k\r\nif k>=n:\r\n print(s[n-1])\r\nelse:\r\n l = 2*(n-k)\r\n maxi = 0\r\n for i in range(l//2):\r\n maxi = max(maxi, s[i]+s[l-i-1])\r\n if l%2!=0:\r\n maxi = max(maxi, s[l//w])\r\n print(max(maxi, s[n-1]))\r\n" ]

[ "def dfs(start):\r\n visited = [0, True] + [False]*(n-1)\r\n stack = [(x, 1, 1/len(tree[start])) for x in tree[start]]\r\n while stack:\r\n v, l, p = stack.pop()\r\n if leafs[v]:\r\n L.append(l*p)\r\n if not visited[v]:\r\n visited[v] = True\r\n for u in tree[v]:\r\n if not visited[u]:\r\n stack.append((u, l+1, p/(len(tree[v])-1)))\r\n \r\n \r\nn = int(input())\r\ntree = {x: [] for x in range(1, n+1)}\r\nL = []\r\nfor _ in range(n-1):\r\n u, v = map(int, input().split())\r\n tree[u].append(v)\r\n tree[v].append(u)\r\nleafs = [False, True] + [len(tree[x]) == 1 for x in range(2, n+1)]\r\ndfs(1)\r\nprint(sum(L))", "n=int(input())\r\ngraph=[]\r\nfor i in range(n):\r\n graph.append([])\r\nfor _ in range(n-1):\r\n u,v=map(int,input().split())\r\n graph[u-1].append(v-1)\r\n graph[v-1].append(u-1)\r\nans=0\r\nvisited=[0]*n\r\nstack=[(0,1)]\r\nwhile stack:\r\n curr,prob=stack.pop()\r\n visited[curr]=1\r\n ans+=prob\r\n r=[]\r\n for i in graph[curr]:\r\n if not visited[i]:\r\n r.append(i)\r\n if r:\r\n newprob=prob/len(r)\r\n for i in r:\r\n stack.append((i,newprob))\r\nprint(ans-1)", "from collections import Counter, defaultdict\r\nimport threading\r\n\r\n# for long inputs\r\nimport sys\r\ndef input(): return sys.stdin.readline().rstrip(\"\\r\\n\")\r\n\r\n# for recursion\r\ndef main():\r\n \r\n n = int(input())\r\n\r\n tree = defaultdict(list)\r\n\r\n for _ in range(n-1):\r\n u, v = map(int, input().split())\r\n tree[u].append(v)\r\n tree[v].append(u)\r\n\r\n leaf_node_height = []\r\n\r\n def dfs(node, parent):\r\n\r\n leaf = True\r\n total = 0\r\n\r\n for kid in tree[node]:\r\n if kid != parent:\r\n leaf = False\r\n\r\n res = dfs(kid, node)\r\n total += res\r\n \r\n if leaf:\r\n # print(\"here leaf\", node)\r\n return 0\r\n elif node != 1:\r\n # print(\"here normal\", node)\r\n return (total / (len(tree[node]) - 1)) + 1\r\n else:\r\n # print(\"here root\", node)\r\n return (total / len(tree[node])) + 1\r\n\r\n print(dfs(1, -1))\r\n\r\nif __name__ == '__main__':\r\n sys.setrecursionlimit(1 << 30)\r\n threading.stack_size(1 << 27)\r\n\r\n main_thread = threading.Thread(target=main)\r\n main_thread.start()\r\n main_thread.join()", "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\r\n\r\n# sys.stdin = open('./../input.txt', 'r')\r\nI = lambda: int(input())\r\nMI = lambda: map(int, input().split())\r\nGMI = lambda: map(lambda x: int(x) - 1, input().split())\r\nLI = lambda: list(map(int, input().split()))\r\n\r\nn = I()\r\ng = [[] for _ in range(n)]\r\nfor i in range(n - 1):\r\n u, v = GMI()\r\n g[u].append(v)\r\n g[v].append(u)\r\n\r\ntree = [[] for _ in range(n)]\r\n\r\n\r\n@bootstrap\r\ndef dfs(x, fa):\r\n for y in g[x]:\r\n if y == fa:\r\n continue\r\n tree[x].append(y)\r\n yield dfs(y, x)\r\n yield\r\n\r\n\r\ndfs(0, -1)\r\n\r\ndp = [0] * n\r\n\r\n\r\n@bootstrap\r\ndef dfs2(x):\r\n if tree[x]:\r\n for y in tree[x]:\r\n yield dfs2(y)\r\n dp[x] += dp[y]\r\n dp[x] /= len(tree[x])\r\n dp[x] += 1\r\n yield\r\n\r\n\r\ndfs2(0)\r\n# print(dp)\r\nprint(format(dp[0], '.15f'))\r\n", "R = lambda: map(int, input().split())\r\nn = int(input())\r\ntree = [list() for i in range(n + 1)]\r\nfor i in range(n - 1):\r\n u, v = R()\r\n tree[u] += [v]\r\n tree[v] += [u]\r\nq = [(1, 1, 1, 0)]\r\nres = 0\r\nwhile q:\r\n curr, prev, factor, step = q.pop()\r\n cnt = sum(nb != prev for nb in tree[curr])\r\n for nb in tree[curr]:\r\n if nb != prev:\r\n q.append((nb, curr, factor / cnt, step + 1))\r\n if len(tree[curr]) == 1:\r\n res += step * factor\r\nprint(res)", "from sys import stdin\nfrom collections import defaultdict\n\ndef lmap(function, iterable): return list(map(function, iterable))\ndef line(): return stdin.readline().strip()\ndef rd(converter): return converter(line())\ndef rl(converter, delimeter = None): return lmap(converter, line().split(delimeter))\ndef rls(num_lines, converter): return [rd(converter) for i in range(num_lines)]\ndef rg(num_lines, converter, delimeter = None): return [rl(converter,delimeter) for i in range(num_lines)]\n\nMOD = 10**9+7\nMULTIPLE_CASES = 0\n\ndef main():\n N = rd(int)\n E = rg(N-1,int)\n\n g = defaultdict(list)\n for u,v in E:\n g[u].append(v)\n g[v].append(u)\n\n dfs = [[1,1,0,None]]\n ans = 0\n\n while dfs:\n node,p,d,parent = dfs.pop()\n children = sum(nei != parent for nei in g[node])\n if children == 0: ans += p*d\n\n for nei in g[node]:\n if nei != parent:\n dfs.append([nei,p/children,d+1,node])\n\n print(ans)\n\nfor i in range(rd(int) if MULTIPLE_CASES else 1): main()", "from collections import defaultdict,deque\r\ndef sasmarayega(d,ans,node,vis,a):\r\n vis[node-1]=True\r\n queue=deque()\r\n queue.append([node,0])\r\n a[0]=1\r\n while queue:\r\n s,parent=queue.popleft()\r\n if s!=1:\r\n if len(d[s])==1:\r\n pass\r\n else:\r\n a[s]=a[parent]/(len(d[s])-1)\r\n else:\r\n a[s]=a[parent]/len(d[s])\r\n #print(f'ans = {ans} and s = {s} and a = {a}')\r\n for i in d[s]:\r\n if vis[i-1]==False:\r\n queue.append([i,s])\r\n ans[0]+=a[s]\r\n vis[i-1]=True\r\n\r\nn=int(input())\r\nd=defaultdict(list)\r\nfor i in range(n-1):\r\n u,v=map(int,input().split())\r\n d[u].append(v)\r\n d[v].append(u)\r\nans=[0]\r\nvis=[False]*n\r\na=[0]*(n+1)\r\nif n!=1:\r\n sasmarayega(d,ans,1,vis,a)\r\nprint(float(ans[0]))", "from collections import defaultdict,Counter,deque\nimport math\nimport bisect\nfrom itertools import accumulate\nfrom math import ceil, log,gcd\nfrom functools import lru_cache\nfrom sys import stdin, stdout\nimport time\nimport atexit\nimport io\nimport sys\nimport string\nimport heapq\n\n\n\n\ndef primes(n):\n if n<=2:\n return []\n sieve=[True]*(n+1)\n for x in range(3,int(n**0.5)+1,2):\n for y in range(3,(n//x)+1,2):\n sieve[(x*y)]=False\n \n return [2]+[i for i in range(3,n,2) if sieve[i]]\n\ndef write(*args, **kwargs):\n sep = kwargs.get('sep', ' ')\n end = kwargs.get('end', '\\n')\n stdout.write(sep.join(str(a) for a in args) + end)\n\ndef read():\n return stdin.readline().rstrip()\ndef primes_rwh(n):\n \"\"\" Returns a list of 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]]\ndef prime_factors(n):\n i = 2\n factors = []\n d = defaultdict(lambda:0)\n for i in primes_rwh(int(n**0.5+1)):\n while n % i == 0:\n n //= i\n factors.append(i)\n d[i]+=1\n if n > 1:\n factors.append(n)\n d[n]+=1\n return factors,d\n \n\n# n,m =[*map(int,read().split())]\n# x = []\n\n# for _ in range(n):\n# i,j,k= [*map(int,read().split())]\n# x.append([i,j,k])\n\nn = int(read())\n\ne= [[] for i in range(n)]\nfor _ in range(n-1):\n i,j = [*map(int,read().split())]\n i-=1\n j-=1\n \n e[i] += [j]\n e[j] += [i]\n \nst = [(0,0,1)]\n\ns = []\nv = [0]*n\nwhile st:\n x,d,p = st.pop(-1)\n \n leaf = True\n v[x]=1\n l = len(e[x])-1\n if x==0:\n l+=1\n # print('node',x,d,p,l)\n for j in e[x]:\n if v[j]==0:\n leaf = False\n st.append((j,d+1,p/l))\n \n if leaf:\n s.append(d*p)\n# print(s) \nprint(sum(s))\n \n \n \n \n \n ", "# https://codeforces.com/contest/839/problem/C\nfrom collections import defaultdict\n \nn = int(input())\ntree = defaultdict(set)\n \nfor i in range(n - 1):\n u, v = map(int, input().split())\n tree[u].add(v)\n tree[v].add(u)\n \nQ = [(0, 1.0, 1)]\nvisited = {1}\nans = 0\n\nwhile Q:\n depth, prob, src = Q.pop()\n \n for nei in tree[src]:\n if nei not in visited:\n visited.add(nei)\n Q.append((depth + 1, prob / (len(tree[src]) - bool(depth)), nei))\n \n if depth and len(tree[src]) == 1:\n ans += prob * depth\n\nprint(ans)", "from collections import defaultdict\r\n\r\nn = int(input())\r\na = defaultdict(list)\r\nsatisfaction = set()\r\nans = 0\r\nq = [(1, 1, 0)]\r\nfor _ in range(n - 1):\r\n ui, vi = map(int, input().split())\r\n a[ui].append(vi)\r\n a[vi].append(ui)\r\nwhile len(q) != 0:\r\n b, c, r = q.pop()\r\n satisfaction.add(b)\r\n d = 0\r\n for i in a[b]:\r\n d += i not in satisfaction\r\n if d <= 0:\r\n ans += c * r\r\n else:\r\n for i in a[b]:\r\n if i not in satisfaction:\r\n q.append((i, c / d, r + 1))\r\n\r\nprint(ans)\r\n", "from collections import defaultdict\r\ndef bfs(g,n):\r\n ans=[]\r\n q=[]\r\n visited=[True]*(n+1)\r\n q.append((1,0,1))\r\n visited[1]=False\r\n while(len(q)!=0):\r\n city,l,p=q.pop()\r\n neighbours = []\r\n for i in g[city]:\r\n if(visited[i]):\r\n neighbours.append(i)\r\n x=len(neighbours)\r\n\r\n if(x==0):\r\n ans.append(l*p)\r\n else:\r\n new_p=p/x\r\n for nbs in neighbours:\r\n q.append((nbs,l+1,new_p))\r\n visited[city]=False\r\n return ans\r\n\r\n\r\n\r\n\r\ng=defaultdict(list)\r\nn=int(input())\r\nfor i in range(n-1):\r\n u,v=map(int,input().split())\r\n g[u].append(v)\r\n g[v].append(u)\r\na=bfs(g,n)\r\nprint(sum(a))\r\n", "import sys,threading\r\n \r\ndef dfs(v,d,par=0):\r\n sum=0\r\n for i in d[v]:\r\n if(i==par):\r\n continue\r\n sum+=dfs(i,d,v)+1\r\n if(sum):\r\n return sum/(len(d[v])-(par!=0))\r\n return 0.0\r\n \r\n \r\ndef main():\r\n I=lambda:list(map(int,input().split()))\r\n n=I()[0]\r\n d={i:[] for i in range(1,n+1)}\r\n for i in range(n-1):\r\n u,v=I()\r\n d[u].append(v)\r\n d[v].append(u)\r\n \r\n print(\"%.10f\"%dfs(1,d))\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()", "from collections import defaultdict\r\ndef solve():\r\n n = int(input())\r\n\r\n route = defaultdict(list)\r\n for i in range(n-1):\r\n x, y = list(map(int, input().split(\" \")))\r\n route[x].append(y)\r\n route[y].append(x)\r\n\r\n visited = set()\r\n queue = [(1, 0, 1)]\r\n total = 0\r\n\r\n while len(queue) > 0:\r\n node, distance, probability = queue.pop(0)\r\n visited.add(node)\r\n\r\n branches = route[node]\r\n\r\n unique = 0\r\n for i in branches:\r\n if i not in visited:\r\n unique += 1\r\n\r\n for i in branches:\r\n if i not in visited:\r\n queue.append((i, distance + 1, probability / unique))\r\n\r\n if unique == 0:\r\n total += probability * distance\r\n print(total)\r\n\r\nsolve()\r\n", "import io, os\r\ninput = io.BytesIO(os.read(0,os.fstat(0).st_size)).readline \r\nfrom collections import defaultdict,deque\r\ndef dfs(node):\r\n vis[node]=1\r\n q=deque([node])\r\n lis=[]\r\n while q:\r\n cur=q.popleft()\r\n lis.append(cur)\r\n for j in edge[cur]:\r\n if vis[j]==0:\r\n vis[j]=1\r\n q.append(j)\r\n child[cur].append(j)\r\n lis.reverse()\r\n return lis\r\nn=int(input())\r\nedge=defaultdict(list)\r\nchild=defaultdict(list)\r\nfor i in range(n-1):\r\n u,v=list(map(int,input().split()))\r\n edge[u].append(v)\r\n edge[v].append(u)\r\nvis=[0]*(n+1)\r\ndist=[0]*(n+1)\r\nlis=dfs(1)\r\nfor i in lis:\r\n ans=0\r\n b=0\r\n for j in child[i]:\r\n ans+=dist[j]\r\n b+=1\r\n if b>0:\r\n dist[i]=(ans/b)+1\r\nprint(dist[1])\r\n\r\n", "# cook your dish here\r\nfrom collections import defaultdict\r\n\r\nn=int(input())\r\nd={}\r\nd=defaultdict(lambda: [],d)\r\n\r\nfor _ in range(n-1):\r\n u,v=map(int,input().split(' '))\r\n d[u].append(v)\r\n d[v].append(u)\r\n\r\n#print(d,\"d\")\r\narr=[[1,1,0]]\r\nvis=[0]*(n+1)\r\nvis[1]=1\r\n#print(vis)\r\ns=0\r\nwhile len(arr)!=0:\r\n x=arr.pop(0)\r\n #print(x,\"c\")\r\n cnt=0\r\n flag=0\r\n for i in d[x[0]]:\r\n if vis[i]==0:\r\n flag=1\r\n cnt+=1\r\n if flag==0:\r\n s+=x[1]*x[2]\r\n else:\r\n for i in d[x[0]]:\r\n if vis[i]==0:\r\n arr.append([i,x[1]/cnt,x[2]+1])\r\n vis[i]=1\r\n #print(arr,\"hbjhbh\")\r\nprint(s)\r\n", "import sys\r\nsys.setrecursionlimit(1000000)\r\nn = int(input())\r\nlis = [ [] for _ in range(n) ]\r\nlis[0].append(0)\r\nfor k in range(1,n):\r\n a, i = map(int,input().split())\r\n lis[a-1].append(i-1)\r\n lis[i-1].append(a-1)\r\n\r\ndef cnt(root, count, div, zero):\r\n stack = [(root, count, div, zero)]\r\n while(stack):\r\n spot, depth, prb,origin = stack.pop()\r\n if(visited[spot]): continue\r\n visited[spot] = True\r\n for k in lis[spot]:\r\n if(k != origin):\r\n prby[k] = (depth+1)/(prb*(len(lis[spot])-1))\r\n stack.append((k, depth+1, prb*(len(lis[spot])-1), spot))\r\nprby = [0]*n\r\nvisited = [False]*n\r\nesp = 0\r\ncnt(0, 0, 1, 0)\r\nfor k in range(n-1,0, -1):\r\n if(len(lis[k])==1):\r\n esp+=prby[k]\r\nprint(esp)\r\n", "from sys import stdin\r\ninput=lambda : stdin.readline().strip()\r\nfrom math import ceil,sqrt,factorial,gcd\r\ndef solve():\r\n\tans=0\r\n\tstack=[[1,1,0]]\r\n\twhile stack:\r\n\t\ta=stack.pop()\r\n\t\tchil=0\r\n\t\tfor i in d[a[0]]:\r\n\t\t\tchil+=1\r\n\t\tif chil:\r\n\t\t\tfor i in d[a[0]]:\r\n\t\t\t\tstack.append([i,a[1]/chil,a[2]+1])\r\n\t\telse:\r\n\t\t\tans+=a[1]*a[2]\r\n\t# print(z)\r\n\treturn ans\r\n\r\nn=int(input())\r\ndx={i:set() for i in range(1,n+1)}\r\nd={i:set() for i in range(1,n+1)}\r\nfor i in range(n-1):\r\n\ta,b=map(int,input().split())\r\n\tdx[a].add(b)\r\n\tdx[b].add(a)\r\nstack=[1]\r\nwhile stack:\r\n\ta=stack.pop()\r\n\tfor i in dx[a]:\r\n\t\td[a].add(i)\r\n\t\tstack.append(i)\r\n\t\tdx[i].remove(a)\r\nprint(solve())", "from collections import deque\r\n\r\nimport sys;input = sys.stdin.readline\r\n\r\nS = lambda : input().strip()\r\nL = lambda :list(map(int, input().split()))\r\nI = lambda :int(input().strip())\r\nT = lambda :map(int, input().split())\r\nmod = int(1e9) + 7\r\n\r\nn = I()\r\ngraph = [[] for i in range(n)]\r\nfor i in range(n-1):\r\n a,b = T()\r\n graph[a-1].append(b-1)\r\n graph[b-1].append(a-1)\r\n\r\nq = deque([(0, 1.0, 0, -1)])\r\nans = 0\r\n\r\nwhile q:\r\n node, prob, dis, parent = q.popleft()\r\n paths = len(graph[node]) - (1 if node != 0 else 0)\r\n\r\n if paths:\r\n for nbr in graph[node]:\r\n if nbr == parent: continue\r\n q.append((nbr, prob/paths, dis+1, node))\r\n else:\r\n ans += prob*dis\r\n\r\nprint(f\"{ans:.6f}\")", "from collections import deque, defaultdict\r\nans=0\r\n\r\n\r\nn=int(input())\r\n\r\ngraph=defaultdict(list)\r\n\r\n\r\nfor i in range(n-1):\r\n ini,fin=map(int,input().split())\r\n graph[ini].append(fin)\r\n graph[fin].append(ini)\r\n \r\n\r\n\r\nq=deque()\r\n\r\nq.append((1,0,1))\r\n\r\nvis=set()\r\n\r\nwhile(q):\r\n curr,depth,prob=q.pop()\r\n vis.add(curr)\r\n\r\n below=0\r\n\r\n for i in graph[curr]:\r\n\r\n if(i not in vis):\r\n below+=1\r\n\r\n for i in graph[curr]:\r\n if(i not in vis):\r\n q.append([i,depth+1,prob/below])\r\n\r\n if(below==0):\r\n ans+=prob*depth\r\nprint(ans)\r\n\r\n\r\n\r\n\r\n", "from collections import deque\r\nn=int(input())\r\nw={}\r\nfor i in range(n):w[i+1]=set()\r\nv={0}\r\nr=0\r\nq=deque()\r\nq.append((1,1,0))\r\nfor _ in range(n-1):\r\n a,b=map(int,input().split())\r\n w[a].add(b)\r\n w[b].add(a)\r\nwhile q:\r\n a,b,c=q.pop()\r\n v.add(a)\r\n o=0\r\n for i in w[a]:\r\n if i not in v:o+=1\r\n if o:\r\n for i in w[a]:\r\n if i not in v:q.append((i,b/o,c+1))\r\n else:r+=b*c\r\nprint(r)", "\nimport math\nimport heapq\nimport itertools\nfrom sys import setrecursionlimit\nfrom collections import deque, defaultdict\n\ndef solve(graph, seen):\n stack = [(0, len(graph))] # start, parent\n stack_i = [0]\n stack_res = [0]\n ret = 0\n while stack:\n go_deep = False\n start, parent = stack[-1]\n res = stack_res.pop()\n I = stack_i.pop()\n seen[start] = True\n if len(graph[start]) > 1:\n for i in range(I, len(graph[start])):\n adj = graph[start][i]\n if adj != parent:\n if not seen[adj]:\n stack.append((adj, start))\n stack_res.append(res)\n stack_res.append(0)\n stack_i.append(i)\n stack_i.append(0)\n go_deep = True\n break\n res += 1 + ret\n if go_deep:\n continue\n res /= len(graph[start]) - 1\n stack.pop()\n ret = res\n return ret\n\n\nif __name__ == \"__main__\":\n n = int(input())\n graph = [[] for _ in range(n)]\n seen = [False] * n\n graph[0].append(n)\n for _ in range(n-1):\n u, v = map(lambda x: int(x) - 1, input().split())\n graph[u].append(v)\n graph[v].append(u)\n res = solve(graph, seen)\n print(res)\n\n\t\t\t \t \t \t \t\t\t \t \t\t \t\t \t \t", "\r\ndef main():\r\n\r\n n = int(input())\r\n adj = [[] for _ in range(n+1)]\r\n exp = [0 for _ in range(n+1)]\r\n for _ in range(n-1):\r\n u,v = map(int,input().split())\r\n adj[u].append(v)\r\n adj[v].append(u)\r\n\r\n\r\n one = [0]\r\n two = [0]\r\n def dfs(node, parent, adj,exp):\r\n options = 0\r\n for children in adj[node]:\r\n if children != parent:\r\n dfs(children, node, adj,exp)\r\n options += 1\r\n\r\n for children in adj[node]:\r\n if children != parent:\r\n exp[node] += (1/options)*(exp[children]+1)\r\n pass\r\n\r\n\r\n\r\n\r\n dfs(1,0,adj,exp)\r\n print(exp[1])\r\n\r\n\r\n\r\n\r\n\r\n\r\nif __name__==\"__main__\":\r\n import sys, threading\r\n input = sys.stdin.readline\r\n sys.setrecursionlimit(2 ** 32 // 2 - 1)\r\n threading.stack_size(1 << 27)\r\n\r\n thread = threading.Thread(target=main)\r\n thread.start()\r\n thread.join()\r\n\r\n\r\n", "# https://codeforces.com/contest/839/problem/C\nfrom collections import defaultdict\n\nn = int(input())\ntree = defaultdict(set)\n\nfor i in range(n - 1):\n u, v = map(int, input().split())\n tree[u].add(v)\n tree[v].add(u)\n\nvisited = set()\nans = 0\nQ = [(1, 1, 0)]\n\nwhile Q:\n u, cnt, num = Q.pop()\n visited.add(u)\n dep = 0\n \n for i in tree[u]:\n if i not in visited:\n dep += 1\n \n if dep == 0:\n ans += cnt * num\n else:\n for i in tree[u]:\n if i not in visited:\n Q.append((i, cnt / dep, num + 1))\n\nprint(ans)", "from collections import deque\r\nn = int(input())\r\ngraph = [[] for _ in range(n + 1)]\r\nvisited = [False for _ in range(n + 1)]\r\n\r\nfor i in range(n - 1):\r\n u, v = map(int, input().split())\r\n graph[u].append(v)\r\n graph[v].append(u)\r\n\r\nres = 0\r\nqueue = deque()\r\nqueue.append([1, 1, 0])\r\nwhile len(queue) > 0:\r\n cur, prob, distance = queue.popleft()\r\n visited[cur] = True\r\n count_nei = 0\r\n for nei in graph[cur]:\r\n if not visited[nei]:\r\n visited[nei] = True\r\n k = len(graph[cur])\r\n k -= 1 if cur != 1 else 0\r\n queue.append([nei, prob / k, distance + 1])\r\n count_nei += 1\r\n\r\n if count_nei == 0:\r\n res += prob * distance\r\n\r\nprint(res)\r\n\r\n", "n = int(input())\r\n\r\nmy_dict = {x: [] for x in range(1, n + 1)}\r\nmy_set = set()\r\nres = 0\r\ns = [(1, 1, 0)]\r\n\r\nfor i in range(n-1):\r\n town_1, town_2 = map(int, input().split())\r\n my_dict[town_1].append(town_2)\r\n my_dict[town_2].append(town_1)\r\nwhile s:\r\n town, probability, depth = s.pop()\r\n my_set.add(town)\r\n d_counter = 0\r\n\r\n for i in my_dict[town]:\r\n if i not in my_set:\r\n d_counter += 1\r\n\r\n if d_counter == 0:\r\n res += probability * depth\r\n else:\r\n for i in my_dict[town]:\r\n if i not in my_set:\r\n s.append((i, probability / d_counter, depth + 1))\r\nprint(res)\r\n", "n = int(input())\ngraph = [[] for i in range(n)]\nfor i in range(n-1):\n\tu,v = input().split()\n\tgraph[int(u)-1].append(int(v)-1)\n\tgraph[int(v)-1].append(int(u)-1)\n\nans = 0\nvisited = [False for i in range(n)]\nqueue = []\nvisited[0] = True\nfor i in graph[0]:\n\tqueue.append((i,1,1/len(graph[0])))\nwhile (queue):\n\tp = queue.pop(0)\n\tvisited[p[0]] = True\n\tflag = False\n\tfor i in graph[p[0]]:\n\t\tif not visited[i]:\n\t\t\tqueue.append((i,p[1]+1,p[2]/(len(graph[p[0]])-1)))\n\t\t\tflag = True\n\tif not flag:\n\t\tans += p[1]*p[2]\n\t\nprint(ans)", "n=int(input())\r\nadj=[set() for _ in range(n)]\r\nfor i in range(n-1):\r\n u,v=map(int,input().split())\r\n u-=1;v-=1\r\n adj[u].add(v)\r\n adj[v].add(u)\r\nfrom collections import deque\r\nq=deque()\r\ndis=[0]*n\r\nvis=[0]*n\r\nq.append((0,1))\r\nvis[0]=1\r\ns=0\r\nwhile len(q):\r\n a,x =q.popleft()\r\n z=len(adj[a])\r\n if z==0: s+=dis[a]/x #leaf\r\n for b in adj[a]:\r\n if vis[b]:continue\r\n vis[b]=1\r\n dis[b]=dis[a]+1\r\n q.append((b,x*z))\r\n adj[b].remove(a)\r\nprint(s)", "from collections import defaultdict\r\nn=int(input())\r\ng=defaultdict(list)\r\nfor i in range(n-1):\r\n x,y=map(lambda s:int(s)-1,input().strip().split())\r\n g[x].append(y)\r\n g[y].append(x)\r\nq=[0]\r\ndis=[-1]*n\r\ndis[0]=0\r\nleaf=set()\r\np=[1]*n\r\nans=0\r\nwhile q:\r\n # print(p)\r\n t=q.pop(0)\r\n cst=1\r\n if t==0:\r\n cst=0\r\n val=len(g[t])-cst\r\n pp=0\r\n if val:\r\n pp=p[t]/val\r\n if len(g[t])==1:\r\n leaf.add(t)\r\n for i in g[t]:\r\n\r\n if dis[i]==-1:\r\n p[i]=pp\r\n dis[i]=dis[t]+1\r\n q.append(i)\r\n if len(g[t])==1:\r\n ans+=dis[t]*p[t]\r\n\r\nprint(ans)\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\n\r\ngraph = [[] for _ in range(n)]\r\n\r\nfor _ in range(n - 1):\r\n a, b = map(lambda i: int(i) - 1, input().split())\r\n graph[a].append(b)\r\n graph[b].append(a)\r\n\r\nvisited = [False] * n\r\nvisited[0] = True\r\nstack = [(0, 0, 1)] # (node, path length, path probability)\r\n\r\nend_lengths = []\r\nwhile stack:\r\n curr_node, curr_length, curr_probability = stack.pop()\r\n\r\n possible_moves = 0\r\n for adj in graph[curr_node]:\r\n if not visited[adj]:\r\n possible_moves += 1\r\n\r\n for adj in graph[curr_node]:\r\n if not visited[adj]:\r\n stack.append((adj, curr_length + 1, curr_probability / possible_moves))\r\n visited[adj] = True\r\n\r\n if not possible_moves: # current node is the end of a path\r\n end_lengths.append((curr_length, curr_probability))\r\n\r\nev = 0\r\nfor xi, pi in end_lengths:\r\n ev += xi * pi\r\nprint(ev)\r\n", "class PathNode:\n def __init__(self, i):\n self.index = i\n self.children = []\n self.i = 0\n self.total = 0\n self.child_visit = 0\n self.avg = 0\n self.pending = False\n\nn = int(input())\ntree = [PathNode(i) for i in range(n+1)]\nfor _ in range(n-1):\n u, v = map(int, input().split(\" \"))\n tree[u].children.append(v)\n tree[v].children.append(u)\nstack = [1]\nvisited = set()\nresult = None\nwhile stack:\n current = tree[stack[-1]]\n if current.pending:\n current.total += result\n current.i += 1\n current.child_visit += 1\n current.pending = False\n if len(current.children) > current.i:\n if current.children[current.i] not in visited:\n stack.append(current.children[current.i])\n visited.add(current.index)\n current.pending = True\n else:\n current.i += 1\n else:\n if current.child_visit:\n current.avg = current.total / current.child_visit\n result = current.avg + 1\n stack.pop()\n if current.index in visited:\n visited.remove(current.index)\nprint(tree[1].avg)\n \t\t \t \t\t\t\t\t\t\t\t \t\t\t \t \t \t \t", "from sys import stdin\r\ninput = stdin.readline\r\n\r\nn = int(input())\r\nedges = list(list(map(int, input().split())) for _ in range(n-1))\r\nadj = {i: [] for i in range(1, n+1)}\r\nfor u, v in edges:\r\n adj[u].append(v)\r\n adj[v].append(u)\r\n\r\nq, res = [(1, 1, 0)], 0\r\nvis = [0] * (n+1)\r\nwhile q:\r\n v, cnt, h = q.pop()\r\n vis[v] = 1\r\n c = 0\r\n for i in adj[v]:\r\n if not vis[i]: \r\n c += 1\r\n if c == 0: \r\n res += cnt * h\r\n else:\r\n for i in adj[v]:\r\n if not vis[i]: \r\n q.append((i, cnt/c, h+1))\r\nprint(res)\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 l2=[l2[1],l2[0]]\r\n l1.append(l2)\r\nif n==1:\r\n print(0)\r\nelse:\r\n l1.sort()\r\n l2=[]\r\n ctr=0\r\n for i in range(n):\r\n l3=[]\r\n for j in range(ctr,2*n-2):\r\n ctr=j\r\n if l1[j][0]==i+1:\r\n l3.append(l1[j][1])\r\n else:\r\n l2.append(l3)\r\n break\r\n l2.append(l3)\r\n l3=[0 for i in range(n)]\r\n l3[0]=1\r\n cur=[[1,1]]\r\n ctr=1\r\n tree=[[1,1]]\r\n ly=-1\r\n ans=0\r\n while ctr!=n:\r\n cur1=[]\r\n ly+=1\r\n for j1 in cur:\r\n j=j1[0]\r\n ppb=j1[1]\r\n cur2=[]\r\n for k in l2[j-1]:\r\n if l3[k-1]==0:\r\n l3[k-1]=1\r\n ctr+=1\r\n cur2.append(k)\r\n if len(cur2)==0:\r\n ans+=ly*ppb\r\n else:\r\n ppb/=len(cur2)\r\n for a in cur2:\r\n cur1.append([a,ppb])\r\n cur=[a for a in cur1]\r\n tree.append(cur)\r\n for a in cur:\r\n ans+=(ly+1)*a[1]\r\n print(ans)", "import os\r\nimport sys\r\nfrom io import BytesIO, IOBase\r\nfrom collections import Counter, defaultdict,deque\r\nimport math\r\nimport heapq\r\nimport bisect\r\nimport collections\r\ndef ceil(a, b):\r\n return (a + b - 1) // b\r\nBUFSIZE = 8192\r\ninf = float('inf')\r\ndef get():\r\n return sys.stdin.readline()\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\ndef dfs(node): # iterative (we cant use recurssive dfs in contest)\r\n visited=[False for _ in range(n+1)]\r\n stack=[]\r\n stack.append((node,0,1))\r\n ans=[]\r\n while stack:\r\n i,l,prob= stack.pop()\r\n c=0\r\n visited[i]=True\r\n for j in d[i]:\r\n if visited[j]==False:\r\n c+=1\r\n if c==0:\r\n ans.append(prob*l)\r\n else:\r\n new_prob=prob/(c)\r\n for j in d[i]:\r\n if visited[j]==False:\r\n stack.append((j,l+1,new_prob))\r\n return ans\r\n##################################################################################\r\nn=int(get())\r\nd=defaultdict(list)\r\nfor i in range(n-1):\r\n u,v= map(int,get().split())\r\n d[u].append(v)\r\n d[v].append(u)\r\nans=dfs(1)\r\nprint(sum(ans))\r\n\r\n\r\n\r\n\r\n\r\n", "from collections import deque\r\nimport sys\r\ninput=sys.stdin.readline\r\nn=int(input())\r\nh={i:[] for i in range(1,n+1)}\r\nfor i in range(n-1):\r\n a,b=map(int,input().split())\r\n h[a].append(b)\r\n h[b].append(a)\r\nh1=dict()\r\nans=0\r\np=deque([(1,0,1)])\r\nwhile(p):\r\n pa=p.popleft()\r\n t=0\r\n h1[pa[0]]=1\r\n for i in h[pa[0]]:\r\n if i not in h1:\r\n t+=1\r\n if t==0:ans+=pa[-1]*(pa[1])\r\n else:\r\n for j in h[pa[0]]:\r\n if j not in h1:\r\n p.append((j,pa[1]+1,pa[-1]/t))\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", "import sys\r\ninput = sys.stdin.readline\r\nfrom collections import deque\r\n\r\ndef bfs():\r\n q = deque([(0, 1)])\r\n dist = [-1]*n\r\n dist[0] = 0\r\n res = 0\r\n \r\n while q:\r\n v, p = q.popleft()\r\n flag = True\r\n \r\n for nv in G[v]:\r\n if dist[nv]==-1:\r\n dist[nv] = dist[v]+1\r\n \r\n if v==0:\r\n np = p*len(G[v])\r\n else:\r\n np = p*(len(G[v])-1)\r\n \r\n q.append((nv, np))\r\n flag = False\r\n \r\n if flag:\r\n res += dist[v]/p\r\n \r\n return res\r\n\r\nn = int(input())\r\nG = [[] for _ in range(n)]\r\n\r\nfor _ in range(n-1):\r\n u, v = map(int, input().split())\r\n G[u-1].append(v-1)\r\n G[v-1].append(u-1)\r\n\r\nprint(bfs())\r\n", "from collections import defaultdict\r\ngraph = defaultdict(list)\r\nn = int(input())\r\nfor _ in range(n-1):\r\n u,v = list(map(int,input().split()))\r\n graph[u-1].append(v-1)\r\n graph[v-1].append(u-1)\r\n\r\ndistances = {}\r\nprob = [0 for i in range(n)]\r\nq = [(0,0)]\r\nprob[0] = 1\r\nvisited = [False for i in range(n)]\r\nvisited[0] = True\r\nwhile q!=[]:\r\n node,dist = q[0]\r\n q.pop(0)\r\n leaf = True\r\n m = 0 \r\n for i in graph[node]:\r\n if visited[i]==False:\r\n m+=1\r\n for j in graph[node]:\r\n if visited[j]==False:\r\n visited[j] = True\r\n leaf = False\r\n prob[j] = prob[node]/m\r\n q.append((j,dist+1))\r\n if leaf:\r\n distances[node] = dist\r\n# print(prob)\r\n# print(distances)\r\nans = 0\r\nfor i in distances:\r\n ans+=prob[i]*distances[i]\r\nprint(ans)", "from sys import stdin,stdout\r\n#input = stdin.readline\r\nfrom collections import deque\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 if n == 1:\r\n print(0)\r\n continue\r\n ar = [[] for i in range(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 ar[u] += [v]\r\n ar[v] += [u]\r\n d = deque()\r\n ar2 = [0]*n\r\n ar2[0] = 1\r\n for i in ar[0]:\r\n d.append([i,1/(len(ar[0])),1])\r\n ar2[i] = 1\r\n ans = 0\r\n while len(d):\r\n cur,prob,length = d.pop()\r\n if len(ar[cur]) == 1:\r\n #print(cur,prob,length)\r\n ans += prob * length\r\n continue\r\n for i in ar[cur]:\r\n if not ar2[i]:\r\n d.append([i,prob/(len(ar[cur])-1),length+1])\r\n ar2[i] = 1\r\n print(ans)\r\nmain()\r\n", "n, adj, expectation, visited = int(input()), {1: set()}, 0, set()\r\nfor i in range(n - 1):\r\n a, b = map(int, input().split())\r\n adj.setdefault(a, set()).add(b)\r\n adj.setdefault(b, set()).add(a)\r\nto_visit = [(1, 1, 0)]\r\nwhile to_visit:\r\n new, prob, distance = to_visit.pop()\r\n visited.add(new)\r\n paths_count = len(adj[new] - visited)\r\n if paths_count == 0:\r\n expectation += distance * prob\r\n continue\r\n for j in adj[new]:\r\n if j not in visited:\r\n to_visit.append((j, prob * (1 / paths_count), distance + 1))\r\nprint(expectation)\r\n", "num = int(input())\r\ntree = {x: [] for x in range(1, num + 1)}\r\nvisited = set()\r\nresult = 0\r\nqueue = [(1, 1, 0)]\r\n\r\nfor _ in range(num - 1):\r\n a, b = map(int, input().split())\r\n tree[a].append(b)\r\n tree[b].append(a)\r\n\r\nwhile queue:\r\n u, count, level = queue.pop()\r\n visited.add(u)\r\n child_count = 0\r\n\r\n for i in tree[u]:\r\n if i not in visited:\r\n child_count += 1\r\n\r\n if child_count == 0:\r\n result += count * level\r\n else:\r\n for i in tree[u]:\r\n if i not in visited:\r\n queue.append((i, count / child_count, level + 1))\r\n\r\nprint(result)\r\n", "\r\n\r\nclass Node:\r\n def __init__(self):\r\n self.neighs = set()\r\n self.path_length = 0\r\n self.prob = 1\r\n self.visited = False\r\n\r\n def connect(self, node):\r\n self.neighs.add(node)\r\n\r\n\r\ndef read_graph_from_input():\r\n nodes = {}\r\n n = int(input())\r\n for i in range(1, n+1):\r\n nodes[i] = Node()\r\n\r\n for _ in range(0, n-1):\r\n i, j = map(int, input().split())\r\n nodes[i].connect(nodes[j])\r\n nodes[j].connect(nodes[i])\r\n\r\n return nodes[1]\r\n\r\n\r\ndef get_math_exp(root):\r\n expectation = 0\r\n nodes = [root]\r\n \r\n while nodes:\r\n node = nodes.pop()\r\n not_visited_neighs = set(filter(lambda x: not x.visited, node.neighs))\r\n if len(not_visited_neighs) == 0:\r\n expectation += node.path_length * node.prob\r\n else:\r\n sub_prob = node.prob / len(not_visited_neighs)\r\n for neigh in not_visited_neighs:\r\n neigh.path_length = node.path_length + 1\r\n neigh.prob = sub_prob\r\n nodes.append(neigh)\r\n node.visited = True\r\n return expectation\r\n\r\n\r\ndef main():\r\n root = read_graph_from_input()\r\n print(get_math_exp(root))\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "from collections import defaultdict\r\n\r\n\r\nn=int(input())\r\ngraph=defaultdict(list)\r\nfor _ in range(n-1):\r\n x,y=[int(x) for x in input().split()]\r\n graph[x].append(y)\r\n graph[y].append(x)\r\n# print(graph)\r\nvisited=set()\r\ndef dfs(node):\r\n ans=0\r\n how_many=0\r\n level=[(node,0,1)]\r\n visited.add(1)\r\n while level:\r\n node,distance,pos=level.pop()\r\n if node!=1 and len(graph[node])==1 and graph[node][0] in visited :\r\n visited.add(node)\r\n ans+=(distance*(1/pos))\r\n how_many+=1\r\n else:\r\n temp=0\r\n for i in graph[node]:\r\n if i not in visited:\r\n temp+=1\r\n for i in graph[node]:\r\n if i not in visited:\r\n level.append((i,distance+1,temp*pos))\r\n visited.add(i)\r\n return (ans)\r\nprint(dfs(1))\r\n\r\n", "import collections\nn = int(input(\"\"))\n\ngraph = collections.defaultdict(list)\n\nfor i in range(n-1):\n\tedge = list(map(int,input(\"\").split(\" \")))\n\n\tgraph[edge[0]].append(edge[1])\n\tgraph[edge[1]].append(edge[0])\n\nresult = 0\n\n# def dfs(graph,node,depth,visited):\n# \tglobal result\n# \tvisited[node] = True\n# \tflag = False\n# \tfor children in graph[node]:\n# \t\tif visited[children] == False:\n# \t\t\tflag = True\n# \t\t\tdfs(graph,children,depth+1,visited)\n# \tif flag == False:\n# \t\tresult.append(depth)\nvisited = [False]*(n+1)\n\nstack = [(1,1,0)]\n\nwhile stack:\n\tnode,curr_prob,depth = stack.pop(0)\n\tvisited[node] = True\n\tcount = 0\n\n\tfor children in graph[node]:\n\t\tif visited[children] == False:\n\t\t\tcount+=1\n\tif count == 0:\n\t\tresult += curr_prob*depth\n\tfor children in graph[node]:\n\t\tif visited[children]==False:\n\t\t\tstack.append((children,curr_prob/count,depth+1))\n\n\nprint(result)\n\n", "n = int(input())\r\na = [[] for _ in range(n + 1)]\r\ns = set()\r\nres = 0\r\nq = [(1, 1, 0)]\r\nfor _ in range(n - 1):\r\n ui, vi = map(int, input().split())\r\n a[ui].append(vi)\r\n a[vi].append(ui)\r\nwhile len(q) != 0:\r\n b, c, r = q.pop()\r\n s.add(b)\r\n d = sum([i not in s for i in a[b]])\r\n if d > 0:\r\n for i in a[b]:\r\n if i not in s:\r\n q.append((i, c / d, r + 1))\r\n else:\r\n res += c * r\r\nprint(res)\r\n", "import sys\r\ninput = lambda: sys.stdin.readline().rstrip()\r\n\r\nN = int(input())\r\nP = [[] for _ in range(N)]\r\n\r\nfor _ in range(N-1):\r\n u,v = map(int, input().split())\r\n u-=1;v-=1\r\n P[u].append(v)\r\n P[v].append(u)\r\n\r\nv = [(0,-1,0,0),(0,-1,0,1)]\r\ndist = [0]*N\r\nwhile v:\r\n i,p,d,t = v.pop()\r\n \r\n if t==1:\r\n for j in P[i]:\r\n if j==p:continue\r\n v.append((j,i,d+1,0))\r\n v.append((j,i,d+1,1))\r\n else:\r\n cnt = 0\r\n total = 0\r\n for j in P[i]:\r\n if j==p:continue\r\n cnt+=1\r\n total+=dist[j]\r\n if cnt==0:\r\n dist[i] = d\r\n else:\r\n dist[i] = total/cnt\r\n\r\nprint(dist[0])\r\n\r\n \r\n", "import sys\r\ninput = sys.stdin.buffer.readline\r\nfrom collections import deque\r\ndef prog():\r\n n = int(input())\r\n adj_list = [[[],0]for i in range(n+1)]\r\n for _ in range(n-1):\r\n a,b = map(int,input().split())\r\n adj_list[a][0].append(b)\r\n adj_list[b][0].append(a)\r\n adj_list[1][0].append(1)\r\n s = deque([1])\r\n probability = [1 for i in range(n+1)]\r\n visited = set()\r\n expected_length = 0\r\n while s:\r\n curr = s[-1]\r\n had_neighbor = False\r\n visited.add(curr)\r\n neighbors = adj_list[curr]\r\n for i in range(neighbors[1],len(neighbors[0])):\r\n neighbor = neighbors[0][i]\r\n if neighbor not in visited:\r\n had_neighbor = True\r\n s.append(neighbor)\r\n probability[neighbor] = probability[curr]/(len(neighbors[0])-1)\r\n neighbors[1] = i+1\r\n break\r\n if not had_neighbor:\r\n s.pop()\r\n if len(adj_list[curr][0]) == 1:\r\n expected_length += probability[curr]*len(s)\r\n print(expected_length)\r\nprog()\r\n \r\n", "#first insight, the graph is\n# --- A tree\n# --- Acyclic\n# --- Complete\n\n# The horse chooses city with equal probabilities for all unvisitied options\n#find expected value of length\n\n\n#setting recursion limit\nimport sys\nsys.setrecursionlimit(10**5)\n\nn = int(input())\ng = [[] for _ in range(n+1)]\nfor _ in range(n-1):\n t = list(input().split())\n #print(t)\n a, b = [int(x) for x in t]\n g[a].append(b)\n g[b].append(a)\n\nres = 0\n# node, parent, lenght, probability\nstack = [(1, -1, 0, 1)]\n\nwhile stack:\n node, parent, length, prob = stack.pop()\n l = len(g[node]) - 1\n if node == 1: l += 1\n\n #is leaf node\n if l == 0:\n res += length*prob\n\n for child in g[node]:\n if child == parent: continue\n newProb = prob / l\n stack.append((child, node, length + 1, newProb))\n \nprint(res)\n\n", "num = int(input())\ndiscovered = [False] * num\nadj = [[] for _ in range(num)]\nfor _ in range(num - 1):\n u, v = map(int, input().strip().split())\n adj[u - 1].append(v - 1)\n adj[v - 1].append(u - 1)\n\ncost = 0\ndiscovered[0] = True\nq = [(0, 1, 0)]\nwhile len(q) != 0:\n u, p, d = q.pop(0)\n discovered[u] = True\n b = 0\n for v in adj[u]:\n if not discovered[v]:\n b += 1\n if b == 0:\n cost += p * d\n else:\n for v in adj[u]:\n if not discovered[v]:\n q.append((v, p / b, d + 1))\nprint(cost)\n \t\t\t\t\t \t\t\t \t\t\t \t\t \t\t\t \t", "from sys import stdin\r\n\r\ninp = stdin.readline\r\nn, ans, = (\r\n int(inp()),\r\n 0,\r\n)\r\ng = {v: [] for v in range(1, n + 1)}\r\nvisited = [0] * (n + 1)\r\nq = [(1, 1, 0)]\r\nfor _ in range(n - 1):\r\n a, b = map(int, input().split())\r\n g[a].append(b)\r\n g[b].append(a)\r\nwhile q:\r\n # print(\"YY\")\r\n v, cnt, h = q.pop()\r\n # print(v, cnt, h)\r\n visited[v] = 1\r\n adj = 0\r\n for i in g[v]:\r\n if not visited[i]:\r\n adj += 1\r\n if adj == 0:\r\n ans += cnt * h\r\n else:\r\n for i in g[v]:\r\n if not visited[i]:\r\n q.append((i, cnt / adj, h + 1))\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\nI = lambda : int(sys.stdin.buffer.readline())\r\nNeo = lambda : list(map(int, sys.stdin.buffer.readline().split()))\r\nn = I()\r\nG = defaultdict(list)\r\nfor i in range(n-1):\r\n x,y = Neo()\r\n G[x] += [y]\r\n G[y] += [x]\r\nvis = [0]*(n+1)\r\nAns = 0\r\nst = deque([(1,-1,0,1)])\r\nwhile st:\r\n node,parent,lenth,p = st.pop()\r\n vis[node] = 1\r\n k = 0\r\n for i in G[node]:\r\n if not vis[i]:\r\n k += 1\r\n if k > 0:\r\n p *= k\r\n for i in G[node]:\r\n if not vis[i]:\r\n st.append((i,node,lenth+1,p))\r\n if len(G[node]) == 1 and G[node][0] == parent:\r\n Ans += lenth/p \r\nprint(Ans)\r\n \r\n\r\n", "n = int(input())\r\n\r\ne = [[] for i in range(n+1)]\r\nfor i in range(n-1):\r\n u, v = map(int, input().split())\r\n \r\n e[u].append(v)\r\n e[v].append(u)\r\n\r\nused = [False for i in range(n+1)]\r\nsol = 0\r\n\r\nq = [(1, 0, 1)]\r\nused[1] = True\r\nwhile len(q):\r\n u, d, p = q.pop()\r\n #print(u, d, p)\r\n\r\n if len(e[u]) == 1:\r\n sol += d*p\r\n\r\n for v in e[u]:\r\n if not used[v]:\r\n np = p / (len(e[u])-(u!=1))\r\n q.append((v, d+1, np))\r\n used[v] = True\r\n\r\nprint(sol)\r\n", "from sys import stdin, stdout\r\nimport heapq\r\nimport cProfile\r\nfrom collections import Counter, defaultdict, deque\r\nfrom functools import reduce\r\nimport math\r\ndef get_int():\r\n return int(stdin.readline().strip())\r\n\r\n\r\ndef get_tuple():\r\n return map(int, stdin.readline().split())\r\n\r\n\r\ndef get_list():\r\n return list(map(int, stdin.readline().split()))\r\n\r\n\r\n\r\ndef main():\r\n n = get_int()\r\n graph = defaultdict(list)\r\n for _ in range(n-1):\r\n u,v = get_tuple()\r\n graph[u].append(v)\r\n graph[v].append(u)\r\n\r\n queue = deque()\r\n queue.append((1,1,0)),0\r\n vis = [0]*(n+1)\r\n res = 0\r\n while queue:\r\n v,cnt,h = queue.pop()\r\n vis[v] = 1\r\n c = 0\r\n for i in graph[v]:\r\n if not vis[i]:\r\n c += 1\r\n if c==0:\r\n res += cnt*h\r\n else:\r\n for i in graph[v]:\r\n if not vis[i]:\r\n queue.append((i,cnt/c,h+1))\r\n print(res)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\nTestCases = False\r\n\r\nif TestCases:\r\n for i in range(get_int()):\r\n main()\r\nelse:\r\n main()\r\n", "# /**\r\n# * author: brownfox2k6\r\n# * created: 05/08/2023 21:49:54 Hanoi, Vietnam\r\n# **/\r\n\r\nn = int(input())\r\nchild = [[] for _ in range(n+1)]\r\nfor _ in range(n-1):\r\n u, v = map(int, input().split())\r\n child[u].append(v)\r\n child[v].append(u)\r\n\r\nvis = [False] * (n+1)\r\nvis[1] = True\r\nans = 0\r\n\r\nst = [(1, 0, 1)] # cur, length, probability\r\nwhile st:\r\n u, length, prob = st.pop()\r\n if len(child[u]) == 1:\r\n ans += length * prob\r\n for v in child[u]:\r\n if not vis[v]:\r\n p = prob / (len(child[u]) - (u != 1))\r\n st.append((v, length+1, p))\r\n vis[v] = True\r\n\r\nprint(ans)", "import math\nimport heapq\nimport itertools\nfrom sys import setrecursionlimit\nfrom collections import deque, defaultdict\n\n# ANALYSIS\n# \n# Let n be the number of cities. This analysis will be done assuming the\n# impelmentation was recursive, which makes the explanation easier.\n# \n# RUNETIME COMPLEXITY: O(n). We visit each of the n cities once.\n# For each city, we check each edge. There are n - 1 edges and each edge is\n# checked exactly twice for 2n - 2 checks.\n# \n# SPACE COMPLEXITY: O(n). We create a number of data structures that are\n# linear in size to n or the number of edges, which is n - 1. The stack we\n# create will not contain duplicate vertices and will grow to be at most size\n# n.\n# \n# CONSTRAINT JUSTIFICATION: Both runtime and space complexities are linear,\n# which cannot be improved asymptotically as at a minimum we must check each\n# city. Since the number of cities is low (<= 1e5), the constants in\n# runtime and space complexity are not an issue.\n# \n# Due to the very deep tree (<= 1e5), recursion was not possible. Manual\n# recursion using heap memory is sufficient as the tree isn't so deep that\n# it cannot be held in memory.\n\ndef iteration(graph, seen, stack, stack_var, ret):\n start, parent = stack[-1]\n I, res = stack_var.pop()\n seen[start] = True\n if len(graph[start]) > 1:\n for i in range(I, len(graph[start])):\n adj = graph[start][i]\n if adj != parent:\n if not seen[adj]:\n stack.append((adj, start))\n stack_var.append((i, res))\n stack_var.append((0, 0))\n return ret\n res += 1 + ret\n res /= len(graph[start]) - 1\n stack.pop()\n return res\n\n\ndef solve(graph, seen):\n stack = [(0, len(graph))] # start, parent\n stack_var = [(0, 0)] # i, res\n ret = 0\n\n while stack:\n ret = iteration(graph, seen, stack, stack_var, ret)\n return ret\n\n\nif __name__ == \"__main__\":\n n = int(input())\n graph = [[] for _ in range(n)]\n seen = [False] * n\n\n graph[0].append(n)\n for _ in range(n-1):\n u, v = map(lambda x: int(x) - 1, input().split())\n graph[u].append(v)\n graph[v].append(u)\n\n res = solve(graph, seen)\n print(res)\n\t\t\t\t \t\t\t\t\t \t \t\t \t\t \t \t \t\t", "#https://codeforces.com/problemset/problem/839/C\r\nfrom collections import defaultdict\r\n\r\nclass Graph:\r\n\tdef __init__(self):\r\n\t\tself.dict = defaultdict(set)\r\n\r\ndef main():\r\n\tn_cities = int(input())\r\n\tg = Graph()\r\n\ts = []\r\n\tvisited = set()\r\n\tfor i in range(0,n_cities-1):\r\n\t\tu, v = (int(j) for j in input().split())\r\n\t\tg.dict[u].add(v)\r\n\t\tg.dict[v].add(u)\r\n\r\n\r\n\t#dfs\r\n\te = 0\r\n\ts.append((1,0,1))\r\n\twhile s:\r\n\t\tcity, l, p = s.pop()\r\n\t\tneighbors = [c for c in g.dict[city] if c not in visited]\r\n\t\tn = len(neighbors)\r\n\t\tif n == 0:\r\n\t\t\te += l*p\r\n\t\telse:\r\n\t\t\tnew_p = p/n\r\n\t\t\tfor neighbor in neighbors:\r\n\t\t\t\ts.append((neighbor, l+1, new_p))\r\n\t\tvisited.add(city)\r\n\r\n\tprint(e)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n\tmain()", "# 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\n## PYRIVAL BOOTSTRAP\r\n# https://github.com/cheran-senthil/PyRival/blob/master/pyrival/misc/bootstrap.py\r\n# This decorator allows for recursion without actually doing recursion\r\nfrom types import GeneratorType\r\n\r\ndef bootstrap(f, stack=[]):\r\n def wrappedfunc(*args, **kwargs):\r\n if stack:\r\n return f(*args, **kwargs)\r\n else:\r\n to = f(*args, **kwargs)\r\n while True:\r\n if type(to) is GeneratorType:\r\n stack.append(to)\r\n to = next(to)\r\n else:\r\n stack.pop()\r\n if not stack:\r\n break\r\n to = stack[-1].send(to)\r\n return to\r\n\r\n return wrappedfunc\r\n######################\r\n\r\n\r\n\r\nn = ii()\r\ngraph = [[] for _ in range(n + 1)]\r\nfor _ in range(n - 1):\r\n u, v = iis()\r\n graph[u].append(v)\r\n graph[v].append(u)\r\n\r\nseen = [0 for _ in range(n + 1)]\r\n\r\n\r\n@bootstrap\r\ndef dfs(node):\r\n seen[node] = 1\r\n s = 0\r\n n = 0\r\n ans = 0\r\n for child in graph[node]:\r\n if not seen[child]:\r\n n += 1\r\n s += yield dfs(child)\r\n if n != 0:\r\n ans = s / n\r\n yield 1 + ans\r\n\r\n\r\nprint(dfs(1) - 1)\r\n", "from collections import defaultdict, deque\nfrom typing import List, Dict \n\n'''\nDFS optimization: \n\nhttps://www.python.org/doc/essays/graphs/\n\n'''\n\n\nn = int(input())\nif n == 1:\n print(0)\nelif n == 2:\n u, v = [int(x) for x in input().split()]\n print(1)\nelse:\n adj = defaultdict(list)\n\n for edge in range(n - 1):\n u, v = [int(x) for x in input().split()]\n adj[u].append(v)\n adj[v].append(u)\n \n #curr_node, curr_prob, curr_level\n bfs, visited, ans = deque([(1, 1, 0)]), set([1]), 0\n\n while bfs:\n curr_node, curr_prob, curr_level = bfs.popleft()\n \n num_adj = 0\n for nex_node in adj[curr_node]:\n if nex_node not in visited: num_adj += 1\n\n for nex_node in adj[curr_node]:\n if nex_node not in visited:\n visited.add(nex_node)\n bfs.append((nex_node, curr_prob / num_adj, curr_level + 1))\n\n if num_adj == 0:\n ans += curr_prob * curr_level\n\n print(ans)\n\n\n\n\n \n\n \n\n", "# https://codeforces.com/problemset/problem/839/C\r\nimport sys\r\nfrom collections import defaultdict\r\n\r\n_DEBUG = False\r\nif not _DEBUG:\r\n input = sys.stdin.readline\r\n\r\ng = defaultdict(set)\r\nn = int(input().strip())\r\nfor _ in range(n - 1):\r\n a, b = map(int, input().strip().split())\r\n g[a].add(b)\r\n g[b].add(a)\r\n\r\nexpected_value = 0\r\nlength = 0\r\n\r\nq = {1: 1.0}\r\n\r\nwhile q:\r\n nq = defaultdict(float)\r\n\r\n for cur, prob in q.items():\r\n if len(g[cur]) == 0:\r\n expected_value += (prob * length)\r\n for next in g[cur]:\r\n nq[next] += (prob / len(g[cur]))\r\n g[next].discard(cur)\r\n del g[cur]\r\n\r\n length += 1\r\n q = nq\r\n\r\nprint(expected_value)\r\n", "import heapq;\nimport math;\nfrom collections import deque;\nimport sys;\n\n\ninput = sys.stdin.readline;\n\n\n\n\n\n\nn = int(input())\n\n\nneighbourNodes = [[] for i in range(n)]\n\nfor _ in range(n - 1):\n path, toPath = map(int, input().split())\n path -= 1\n toPath -= 1\n neighbourNodes[path].append(toPath)\n neighbourNodes[toPath].append(path)\n\n\n\ndef solve():\n queue = deque([[0, 1]])\n dist = 0;\n currSum = 0;\n visited = [0 for node in range(n)]\n while(queue):\n size = len(queue)\n for _ in range(size):\n currNode, prob = queue.popleft()\n visited[currNode] = 1;\n cnt = 0;\n for node in neighbourNodes[currNode]:\n if not visited[node]:\n cnt += 1;\n\n if not cnt:\n currSum += (prob * dist)\n for node in neighbourNodes[currNode]:\n if not visited[node]:\n queue.append([node, prob * (1 / cnt)])\n dist += 1;\n return currSum\n\n\nprint(solve())\n\n \t \t \t \t \t\t\t\t\t \t\t \t", "import sys\r\n \r\n \r\ndef main():\r\n n = int(input())\r\n if n == 1:\r\n print(0)\r\n return\r\n x = [[] for i in range(n)]\r\n for i in range(n - 1):\r\n a, b = map(int, sys.stdin.readline().split())\r\n x[a - 1].append(b - 1)\r\n x[b - 1].append(a - 1)\r\n \r\n isl = [False] * n\r\n for i in range(1, n):\r\n if len(x[i]) == 1:\r\n isl[i] = True\r\n \r\n u = [False] * n\r\n u[0] = True\r\n q = [(0, 0, 1 / len(x[0]))]\r\n a = 0\r\n while len(q) != 0:\r\n c, s, t = q.pop()\r\n for i in x[c]:\r\n if not u[i]:\r\n if isl[i]:\r\n a += (s + 1) * t\r\n else:\r\n q.append((i, s + 1, t / (len(x[i])-1)))\r\n u[i] = True\r\n print(a)\r\n \r\n \r\nmain()", "from types import GeneratorType\r\n\r\ndef bootstrap(f, stack=[]):\r\n def wrappedfunc(*args, **kwargs):\r\n if stack:\r\n return f(*args, **kwargs)\r\n else:\r\n to = f(*args, **kwargs)\r\n while True:\r\n if type(to) is GeneratorType:\r\n stack.append(to)\r\n to = next(to)\r\n else:\r\n stack.pop()\r\n if not stack:\r\n break\r\n to = stack[-1].send(to)\r\n return to\r\n\r\n return wrappedfunc\r\n\r\n\r\n@bootstrap\r\ndef dfs(graph,node,visited):\r\n visited[node] = True\r\n sm = cnt = 0\r\n for i in graph[node]:\r\n if not visited[i]:\r\n s = yield dfs(graph,i,visited)\r\n sm = sm + s\r\n cnt += 1\r\n if cnt == 0:\r\n yield 1\r\n yield sm/cnt + 1\r\n\r\n\r\ndef main():\r\n TestCases = 1\r\n for _ in range(TestCases):\r\n n = int(input())\r\n graph = [[] for i in range(n+1)]\r\n for i in range(n-1):\r\n a,b = [int(i) for i in input().split()]\r\n graph[a].append(b)\r\n graph[b].append(a)\r\n \r\n visited = [False]*(n+1)\r\n\r\n print(dfs(graph,1,visited) - 1)\r\n \r\n\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "n=int(input())\r\nt={x:[] for x in range(1,n+1)}\r\nv=set()\r\ns=0\r\nq=[(1,1,0)]\r\nfor _ in range(n-1):\r\n a,b=map(int,input().split())\r\n t[a].append(b)\r\n t[b].append(a)\r\nwhile q:\r\n u,cnt,num=q.pop()\r\n v.add(u)\r\n dep=0\r\n for i in t[u]:\r\n if i not in v:dep+=1\r\n if dep==0:s+=cnt*num\r\n else:\r\n for i in t[u]:\r\n if i not in v:q.append((i,cnt/dep,num+1))\r\nprint(s)\r\n", "n = int(input())\r\ngraph = {_: [] for _ in range(1, n+1)}\r\nfor _ in range(n-1):\r\n a, b = map(int, input().split())\r\n graph[a].append(b)\r\n graph[b].append(a)\r\ns = 0\r\nseen = set()\r\nqueue = [(1, 1, 0)]\r\nwhile queue:\r\n u, cnt, num = queue.pop()\r\n seen.add(u)\r\n dep = 0\r\n for i in graph[u]:\r\n if i not in seen:\r\n dep += 1\r\n if dep == 0:\r\n s += cnt * num\r\n else:\r\n for i in graph[u]:\r\n if i not in seen:\r\n queue.append((i, cnt/dep, num+1))\r\nprint(s)", "from os import path\r\nimport sys,time, collections as c , math as m , pprint as p\r\nmaxx , localsys , mod = float('inf'), 0 , int(1e9 + 7) \r\nif (path.exists('input.txt')): sys.stdin=open('input.txt','r') ; sys.stdout=open('output.txt','w')\r\ninput = sys.stdin.readline\r\nn = int(input()) ; g = c.defaultdict(list)\r\nfor _ in range(n-1):\r\n u , v = map(int , input().split())\r\n g[u].append(v)\r\n g[v].append(u)\r\nv , q , ans = [0]*(n+1) , [(1 ,1 ,1)] , 0 #p , cnt , height\r\nwhile q :\r\n p , cnt , h = q.pop()\r\n v[p] , c = 1 , 0\r\n for i in g[p]:\r\n if not v[i]:\r\n c+=1\r\n if c == 0 :\r\n ans+= cnt*h\r\n else:\r\n for i in g[p]:\r\n if not v[i]:\r\n q.append((i , cnt/c , h+1))\r\n v[i] = 1\r\nprint('%.14f'%(ans-1))\r\n# # 70\r\n# 1 25\r\n# 57 1\r\n# 18 1\r\n# 65 1\r\n# 38 1\r\n# 1 41\r\n# 1 5\r\n# 1 69\r\n# 1 3\r\n# 31 1\r\n# 1 8\r\n# 1 9\r\n# 53 1\r\n# 70 1\r\n# 45 1\r\n# 1 24\r\n# 1 42\r\n# 1 30\r\n# 1 12\r\n# 1 37\r\n# 64 1\r\n# 1 28\r\n# 1 58\r\n# 1 22\r\n# 11 1\r\n# 1 4\r\n# 1 27\r\n# 1 16\r\n# 1 21\r\n# 54 1\r\n# 1 51\r\n# 1 43\r\n# 29 1\r\n# 56 1\r\n# 1 39\r\n# 32 1\r\n# 1 15\r\n# 1 17\r\n# 1 19\r\n# 1 40\r\n# 36 1\r\n# 48 1\r\n# 63 1\r\n# 1 7\r\n# 1 47\r\n# 1 13\r\n# 1 46\r\n# 60 1\r\n# 1 6\r\n# 23 1\r\n# 20 1\r\n# 1 52\r\n# 2 1\r\n# 26 1\r\n# 1 59\r\n# 1 66\r\n# 10 1\r\n# 1 62\r\n# 1 68\r\n# 1 55\r\n# 50 1\r\n# 33 1\r\n# 44 1\r\n# 1 34\r\n# 1 35\r\n# 1 61\r\n# 14 1\r\n# 67 1\r\n# 49 1\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n# def ok(p , s):\r\n# cnt , need =0 , 0\r\n# for i in s:\r\n# if p[need] == i:\r\n# cnt+=1 ; need ^= 1\r\n# if cnt % 2 and p[0] != p[1]:\r\n# cnt-=1\r\n# return cnt\r\n\r\n# for _ in range(int(input())):\r\n# s = input().rstrip('\\n') ; n , ans = len(s) , maxx\r\n# for i in range(10):\r\n# for j in range(10):\r\n# ans = min(ans , n - ok((str(i) , str(j)), s))\r\n# print(ans)\r\n#This problem was so easy oh gawd , so you can only make left cyclic shift = right cyclic shift , when there are at most\r\n#2 characters\r\n#(incase of 1 ch) at the same time if total string has only character it is valid no matter how you see it \r\n#(incase of 2 ch) all the characters at odd positions must be equal , and all the characters at even position must be equal\r\n\r\n\r\n\r\n\r\n\r\n# n , k = map(int , input().split()) ; s = input().rstrip('\\n')\r\n# ans = a = b = j = 0\r\n# for i in range(n):\r\n# a , b = (a+1 , b) if s[i] == 'a' else (a , b+1 )\r\n# if min(a, b) > k :\r\n# a , b = (a -1 , b) if s[j] == 'a' else (a , b -1) ; j+=1\r\n# else:\r\n# ans+=1\r\n# print(ans)\r\n# #two - pointer method , if at any point min(a , b )> k then keep on decreasing from the beginning untill and unless you get min(a , b) \r\n# #less than k", "from queue import Queue\r\nfrom collections import defaultdict\r\nans = 0\r\ndef dfs(i, p, graph, prob, d):\r\n global ans\r\n l = len(graph[i])\r\n if l == 1 and p != -1:\r\n ans += prob * d\r\n return\r\n\r\n if p == -1:\r\n newProb = prob / l\r\n else:\r\n newProb = prob / (l - 1)\r\n\r\n for j in graph[i]:\r\n if j != p:\r\n dfs(j, i, graph, newProb, d + 1)\r\n\r\n\r\nn = int(input())\r\n\r\ngraph = defaultdict(list)\r\n\r\nfor _ in range(n - 1):\r\n u, v = map(int, input().split())\r\n graph[u].append(v)\r\n graph[v].append(u)\r\n\r\nans = 0\r\n\r\nq = Queue()\r\nq.put([1, -1, 1, 0])\r\nwhile not q.empty() and n != 1:\r\n t = q.get()\r\n i, p, prob, d = t[0], t[1], t[2], t[3]\r\n # print(i)\r\n l = len(graph[i])\r\n if l == 1 and p != -1:\r\n ans += prob * d\r\n continue\r\n # print(i, l)\r\n if p == -1:\r\n newProb = prob / l\r\n else:\r\n newProb = prob / (l - 1)\r\n\r\n for j in graph[i]:\r\n if j != p:\r\n q.put([j, i, newProb, d + 1])\r\n\r\n# dfs(1, -1, graph, 1, 0)\r\n\r\nprint(ans)", "import sys, math\r\ninput = sys.stdin.readline\r\n\r\ndef getInts():\r\n return [int(s) for s in input().split()]\r\n\r\ndef getInt():\r\n return int(input())\r\n\r\ndef getStrs():\r\n return [s for s in input().split()]\r\n\r\ndef getStr():\r\n return input().strip()\r\n\r\ndef listStr():\r\n return list(input().strip())\r\n\r\nimport collections as col\r\nimport math\r\nfrom types import GeneratorType\r\n\r\n\r\ndef solve():\r\n def bootstrap(f, stack=[]):\r\n def wrappedfunc(*args, **kwargs):\r\n if stack:\r\n return f(*args, **kwargs)\r\n else:\r\n to = f(*args, **kwargs)\r\n while True:\r\n if type(to) is GeneratorType:\r\n stack.append(to)\r\n to = next(to)\r\n else:\r\n stack.pop()\r\n if not stack:\r\n break\r\n to = stack[-1].send(to)\r\n return to\r\n return wrappedfunc\r\n\r\n @bootstrap\r\n def tour(graph,node,visited_dict):\r\n #print(node)\r\n if node not in visited_dict:\r\n visited_dict[node] = node\r\n n_count = 0\r\n for neighbour in graph[node]:\r\n if neighbour not in visited_dict:\r\n n_count += 1\r\n if n_count == 0:\r\n #print(node,0.0)\r\n yield 0.0\r\n ans = 0.0\r\n for neighbour in graph[node]:\r\n if neighbour not in visited_dict:\r\n x = (yield tour(graph,neighbour,visited_dict))\r\n ans += (1.0 + x)/n_count\r\n #print(node,ans,n_count)\r\n yield ans\r\n \r\n \r\n \r\n N = getInt()\r\n graph = col.defaultdict(set)\r\n for n in range(N-1):\r\n U, V = getInts()\r\n graph[U].add(V)\r\n graph[V].add(U)\r\n visited_dict = {}\r\n if N < 2:\r\n return N-1\r\n expected_val = tour(graph,1,visited_dict)\r\n return expected_val\r\n \r\n#for _ in range(getInt()):\r\nprint(solve())\r\n \r\n\r\n", "\"\"\"\nSummary of code:\n- It uses dfs, and counts all the possible length of each\n journey\n- Then it uses those information to calculate average of it\n- I can do it because every path has same possibility\n\nRuntime Complexity:\n- input => O(1 + N + N-1) => O(N)\n- dfs => O(No of node + No of Edges) => O(N + N-1) => O(N)\n- total => O(N + N) => O(N)\n\nSpace Complexity:\n- input => O(1 + N) => O(N)\n- dfs => O(maximum depth of dfs) => O(H)\n- total => O(N + H)\n\nWhy the Chosen Algorithm are good:\n- Time limit is 2 seconds\n- My code runs in O(N)\n- maximum of n = 10**5\n- 10**5 < 2 * 10**7, thus it should be able to pass\n\"\"\"\n\nfrom sys import stdin\n\ninput = stdin.readline\nn = int(input())\ngraph = {i:set() for i in range(n)}\nfor _ in range(n-1):\n u,v = [int(i)-1 for i in input().split()]\n graph[u].add(v)\n graph[v].add(u)\n\naverage = [0] * n\nnext_group = [set() for i in range(n)]\norder = []\nstack = [0]\nseen = {0}\nwhile stack:\n node = stack.pop()\n order.append(node)\n for next in graph[node]:\n if next not in seen:\n next_group[node].add(next)\n stack.append(next)\n seen.add(next)\nfor i in range(n-1, -1, -1):\n node = order[i]\n for next in next_group[node]:\n average[node] += average[next]\n if next_group[node]:\n average[node] /= len(next_group[node])\n average[node] += 1\nprint(average[0]-1)\n\t \t\t \t \t\t \t\t \t \t\t \t\t\t\t\t \t\t\t", "from collections import deque\r\n\r\n\r\ndef main():\r\n n = int(input())\r\n graph = [[[], 0] for i in range(n)]\r\n for i in range(n - 1):\r\n u, v = [int(i) - 1 for i in input().split()]\r\n graph[u][0].append(v)\r\n graph[v][0].append(u)\r\n graph[u][1] += 1\r\n graph[v][1] += 1\r\n\r\n inf = 10 ** 9\r\n visited = [inf] * n\r\n visited[0] = 0\r\n p = [0] * n\r\n p[0] = 1\r\n queue = deque([0])\r\n\r\n while queue:\r\n vertex = queue.pop()\r\n h = visited[vertex]\r\n g = []\r\n pp = p[vertex]\r\n c = 0\r\n for v in graph[vertex][0]:\r\n if visited[v] > h + 1:\r\n visited[v] = h + 1\r\n queue.append(v)\r\n c += 1\r\n g.append(v)\r\n\r\n for i in g:\r\n p[i] = (1 / c) * pp\r\n\r\n r = 0\r\n for i in range(n):\r\n if graph[i][1] == 1:\r\n r += p[i] * visited[i]\r\n\r\n print(r)\r\n\r\n\r\nif __name__ == '__main__':\r\n main()", "import sys\r\nfrom collections import deque\r\n\r\n\r\n\r\nif __name__ == '__main__':\r\n r = sys.stdin\r\n n = int(r.readline())\r\n\r\n ans = 0.0\r\n adjList = [[] for _ in range(100001)]\r\n visited = [False] * 100001\r\n visited[1] = True\r\n\r\n for i in range(n - 1):\r\n n1, n2 = map(int, r.readline().strip().split(\" \"))\r\n adjList[n1].append(n2)\r\n adjList[n2].append(n1)\r\n q = deque()\r\n q.append((1, 0, 1.0)) # node, depth, probability\r\n\r\n while len(q):\r\n (node, depth, probability) = q.popleft()\r\n childCount = 0\r\n for adjNode in adjList[node]:\r\n if not visited[adjNode]:\r\n childCount+=1\r\n\r\n for adjNode in adjList[node]:\r\n if not visited[adjNode]:\r\n visited[adjNode] = True\r\n q.append((adjNode, depth+1, probability/childCount))\r\n if childCount ==0:\r\n ans += (probability*depth)\r\n\r\n print(ans)\r\n" ]

[ "\r\n\r\nimport bisect as bs\r\nimport sys\r\ninp = sys.stdin.readlines()\r\nn, m, ladders, elevators, v = [int(x) for x in inp[0].strip().split()]\r\nladders = [int(x) for x in inp[1].strip().split()]\r\nelevators = [int(x) for x in inp[2].strip().split()]\r\nq = int(inp[3].strip())\r\nqs = []\r\nfor i in range(q):\r\n qs.append([int(x) for x in inp[4+i].strip().split()])\r\n\r\noutput = []\r\n\r\nfor query in qs:\r\n x1, y1, x2, y2 = query\r\n if x1 == x2:\r\n output.append(abs(y1-y2))\r\n continue\r\n cur_ld = []\r\n if ladders and (y1 > ladders[0]):\r\n cur_ld.append(ladders[bs.bisect_left(ladders, y1)-1])\r\n if ladders and (y1 < ladders[-1]):\r\n cur_ld.append(ladders[bs.bisect_right(ladders, y1)])\r\n\r\n cur_elev = []\r\n if elevators and (y1 > elevators[0]):\r\n cur_elev.append(elevators[bs.bisect_left(elevators, y1)-1])\r\n if elevators and (y1 < elevators[-1]):\r\n cur_elev.append(elevators[bs.bisect_right(elevators, y1)])\r\n\r\n ans = []\r\n for lad in cur_ld:\r\n ans.append(abs(y1 - lad) + abs(y2 - lad) + abs(x1 - x2))\r\n for elev in cur_elev:\r\n height = abs(x1-x2)\r\n elspeed = height // v\r\n if height % v != 0: elspeed+=1\r\n ans.append(abs(y1 - elev) + abs(y2 - elev) + elspeed)\r\n ans = min(ans)\r\n output.append(ans)\r\n\r\noutput = '\\n'.join(map(str, output))\r\nprint(output)", "def takeClosest(myList, myNumber):\n\n \"\"\"\n\n Assumes myList is sorted. Returns closest value to myNumber.\n\n\n\n If two numbers are equally close, return the smallest number.\n\n \"\"\"\n\n if len(myList) == 0:\n\n return 9e10\n\n pos = bisect_left(myList, myNumber)\n\n if pos == 0:\n\n return myList[0]\n\n if pos == len(myList):\n\n return myList[-1]\n\n before = myList[pos - 1]\n\n after = myList[pos]\n\n if after - myNumber < myNumber - before:\n\n return after\n\n else:\n\n return before\n\n\n\nfrom bisect import bisect_left\n\nfrom math import ceil\n\n\n\nn, m, n_stairs, n_elevators, v = map(int, input().split(\" \"))\n\n\n\nif n_stairs > 0:\n\n stairs = list(map(int, input().split(\" \")))\n\nelse:\n\n stairs = []\n\n input()\n\nif n_elevators > 0:\n\n elevators = list(map(int, input().split(\" \")))\n\nelse:\n\n elevators = []\n\n input()\n\nqueries = int(input())\n\nres = []\n\nfor i in range(queries):\n\n x1, y1, x2, y2 = map(int, input().split(\" \"))\n\n next_elevator = takeClosest(elevators, (y1 + y2) / 2)\n\n next_stairs = takeClosest(stairs, (y1 + y2) / 2)\n\n time_elevator = abs(x1 - x2) / v\n\n time_stairs = abs(x1 - x2)\n\n\n\n mi = min(y1, y2)\n\n ma = max(y1, y2)\n\n if next_elevator < mi:\n\n time_elevator += (mi - next_elevator) * 2\n\n elif next_elevator > ma:\n\n time_elevator += (next_elevator - ma) * 2\n\n\n\n if next_stairs < mi:\n\n time_stairs += (mi - next_stairs) * 2\n\n elif next_stairs > ma:\n\n time_stairs += (next_stairs - ma) * 2\n\n\n\n dis = abs(y1 - y2)\n\n if time_elevator < time_stairs:\n\n dis += time_elevator\n\n else:\n\n dis += time_stairs\n\n if x1 == x2:\n\n res.append(abs(y1 - y2))\n\n else:\n\n res.append(ceil(dis))\n\nprint(*res, sep=\"\\n\")\n\n\n\n# Made By Mostafa_Khaled", "# python3\nimport sys\nfrom bisect import bisect\n\n\ndef readline(): return tuple(map(int, input().split()))\ndef readlines():\n return (tuple(map(int, line.split())) for line in sys.stdin.readlines())\n\n\ndef bisect_bounds(arr, val):\n idx = bisect(arr, val)\n if idx: yield idx - 1\n if idx < len(arr): yield idx\n\n\nclass Minimizator:\n def __init__(self, value=float('inf')):\n self.value = value\n def eat(self, value):\n self.value = min(self.value, value)\n\n\ndef main():\n n, m, cl, ce, v = readline()\n l = readline()\n e = readline()\n assert len(l) == cl\n assert len(e) == ce\n q, = readline()\n\n answers = list()\n for (x1, y1, x2, y2) in readlines():\n if x1 == x2:\n answers.append(abs(y1 - y2))\n else:\n ans = Minimizator(n + 2*m)\n for idx in bisect_bounds(l, y1):\n ladder = l[idx]\n ans.eat(abs(x1 - x2) + abs(ladder - y1) + abs(ladder - y2))\n for idx in bisect_bounds(e, y1):\n elevator = e[idx]\n ans.eat((abs(x1 - x2) - 1) // v + 1\n + abs(elevator - y1) + abs(elevator - y2))\n answers.append(ans.value)\n print(\"\\n\".join(map(str, answers)))\n\n\nmain()\n", "from __future__ import division, print_function\r\nimport bisect\r\nimport math\r\nimport itertools\r\nimport sys\r\nfrom atexit import register\r\n\r\nif sys.version_info[0] < 3:\r\n from io import BytesIO as stream\r\nelse:\r\n from io import StringIO as stream\r\n\r\n\r\nif sys.version_info[0] < 3:\r\n class dict(dict):\r\n \"\"\"dict() -> new empty dictionary\"\"\"\r\n def items(self):\r\n \"\"\"D.items() -> a set-like object providing a view on D's items\"\"\"\r\n return dict.iteritems(self)\r\n\r\n def keys(self):\r\n \"\"\"D.keys() -> a set-like object providing a view on D's keys\"\"\"\r\n return dict.iterkeys(self)\r\n\r\n def values(self):\r\n \"\"\"D.values() -> an object providing a view on D's values\"\"\"\r\n return dict.itervalues(self)\r\n\r\n input = raw_input\r\n range = xrange\r\n\r\n filter = itertools.ifilter\r\n map = itertools.imap\r\n zip = itertools.izip\r\n\r\n\r\ndef sync_with_stdio(sync=True):\r\n \"\"\"Set whether the standard Python streams are allowed to buffer their I/O.\r\n\r\n Args:\r\n sync (bool, optional): The new synchronization setting.\r\n\r\n \"\"\"\r\n global input, flush\r\n\r\n if sync:\r\n flush = sys.stdout.flush\r\n else:\r\n sys.stdin = stream(sys.stdin.read())\r\n input = lambda: sys.stdin.readline().rstrip('\\r\\n')\r\n\r\n sys.stdout = stream()\r\n register(lambda: sys.__stdout__.write(sys.stdout.getvalue()))\r\n\r\ndef main():\r\n n,m,c1,ce,v=map(int,input().split())\r\n posstairs=list(map(int,input().split()))\r\n posele=list(map(int,input().split()))\r\n q=int(input())\r\n for i in range(0,q):\r\n y1,x1,y2,x2=map(int,input().split())\r\n if x2<x1:\r\n x1,x2=x2,x1\r\n if ce!=0:\r\n ind1=bisect.bisect_left(posele,x1)\r\n if ind1==ce:\r\n ind1-=1\r\n t1=abs(x1-posele[ind1])+abs(posele[ind1]-x2)+math.ceil(abs(y2-y1)/v)\r\n ind1-=1\r\n if ind1>=0:\r\n t1=min(t1,abs(x1-posele[ind1])+abs(posele[ind1]-x2)+math.ceil(abs(y2-y1)/v))\r\n if c1!=0:\r\n ind3=bisect.bisect_left(posstairs,x1)\r\n if ind3==c1:\r\n ind3-=1\r\n t2=abs(x1-posstairs[ind3])+abs(posstairs[ind3]-x2)+abs(y2-y1)\r\n ind3-=1\r\n if ind3>=0:\r\n t2=min(t2,abs(x1-posstairs[ind3])+abs(posstairs[ind3]-x2)+abs(y2-y1))\r\n if y1==y2:\r\n print(abs(x2-x1))\r\n elif ce!=0 and c1!=0:\r\n print(min(t1,t2))\r\n elif ce!=0:\r\n print(t1)\r\n else :\r\n print(t2)\r\nif __name__ == '__main__':\r\n sync_with_stdio(False)\r\n main()" ]

[ "n=int(input())\r\narr=list(map(int,input().split()))\r\nfound=0\r\nans=-1\r\ncur=0\r\nwhile found<n:\r\n if ans%2==1:\r\n for i in range(0,len(arr)):\r\n if arr[i]!=-1 and arr[i]<=found:\r\n found+=1\r\n arr[i]=-1\r\n #print(i+1)\r\n ans+=1\r\n else:\r\n for i in range(len(arr)-1,-1,-1):\r\n if arr[i]!=-1 and arr[i]<=found:\r\n found+=1\r\n arr[i]=-1\r\n #print(i+1)\r\n ans+=1\r\nprint(ans)", "n = int(input())\nlst = [int(x) for x in input().split()]\n\npower = 0\nanswer = 0\nwhile power != len(lst):\n\tfor i in range(len(lst)):\n\t\tif lst[i] <= power:\n\t\t\tpower += 1\n\t\t\tlst[i] = float('inf')\n\t\n\tif power == len(lst):\n\t\tbreak\n\tanswer += 1\n\t\n\tfor i in range(len(lst)-1, -1, -1):\n\t\tif lst[i] <= power:\n\t\t\tpower += 1\n\t\t\tlst[i] = float('inf')\n\t\n\tif power == len(lst):\n\t\tbreak\n\tanswer += 1\n\nprint(answer)", "import sys\r\ninput = sys.stdin.readline\r\n\r\n\r\nn = int(input())\r\nw = list(map(int, input().split()))\r\n\r\nz = n\r\nc = 0\r\nx = 0\r\nwhile True:\r\n new_w = []\r\n n = len(w)\r\n for i in range(n):\r\n if w[i] <= c:\r\n c += 1\r\n else:\r\n new_w.append(w[i])\r\n if c == z:\r\n break\r\n x += 1\r\n w = new_w[::-1]\r\nprint(x)", "n = int(input())\ncomp = list(map(int,input().split()))\nseen = set()\npieces = 0\ndirection = 1\nres = 0\ndef begend(dire):\n if dire == 1:\n return (0,n)\n else:\n return(n-1,-1)\nwhile len(seen)<n:\n for k in range(begend(direction)[0],begend(direction)[1],direction):\n if (not k in seen and comp[k] <= pieces):\n seen.add(k)\n pieces += 1\n direction *= -1\n res += 1\nprint(res-1)\n", "n = int(input())\r\na = list(map(int, input().split()))\r\ncnt = 0\r\nres = 0\r\nwhile len(a):\r\n b = []\r\n for i in range(len(a)):\r\n if a[i] <= cnt:\r\n cnt += 1\r\n else:\r\n b.append(a[i])\r\n a = b[::-1]\r\n res += 1\r\nprint(res - 1)", "n = int(input())\r\na = [int(x) for x in input().split()]\r\nk = 0\r\npov = 0\r\nused = [False] * n\r\nfor i in range(n):\r\n for j in range(n):\r\n if used[j] == False and a[j] <= k:\r\n used[j] = True\r\n k += 1\r\n r = 0\r\n for j in range(n):\r\n if used[j] == False:\r\n r = 1\r\n if r == 0:\r\n print(pov)\r\n break\r\n else:\r\n pov += 1\r\n for j in range(n - 1, -1, -1):\r\n if used[j] == False and a[j] <= k:\r\n used[j] = True\r\n k += 1\r\n r = 0\r\n for j in range(n):\r\n if used[j] == False:\r\n r = 1\r\n if r == 0:\r\n print(pov)\r\n break\r\n else:\r\n pov += 1", "n = int(input())\r\nan = list(map(int, input().split()))\r\n\r\narr = []\r\nallcnt = 0\r\nfor i in range(0, n):\r\n if(allcnt >= an[i]):\r\n allcnt += 1\r\n else:\r\n arr.append(an[i])\r\n\r\nan = list(arr)\r\nres = 0\r\nwhile(len(an) > 0):\r\n res += 1\r\n arrt = []\r\n for i in range(len(an) - 1, -1, -1):\r\n if(allcnt >= an[i]):\r\n allcnt += 1\r\n else:\r\n arrt.append(an[i])\r\n\r\n an = list(arrt)\r\n\r\nprint(res)\r\n", "n = int(input())\nsecurity = [int(i) for i in input().split()]\nhaveset = set()\ninfo = 0\nx = 0\ndx = 1\nturns = 0\nwhile True:\n if x not in haveset and info >= security[x]: # We have enough to break this now\n haveset.add(x)\n info += 1\n if info == n:\n break\n x += dx\n if x == len(security):\n x -= 2\n dx = -1\n turns += 1\n elif x == -1:\n x += 2\n dx = 1\n turns += 1\nprint(turns)\n \n \n \n \n \n\n", "n = int(input())\r\na = list(map(int, input().split()))\r\nsum = 0\r\nans = 0\r\nf = True\r\nwhile sum != n:\r\n for i in range(n):\r\n if a[i] <= sum:\r\n a[i] = 100000000000000000000000\r\n sum += 1\r\n if sum == n:\r\n f = False\r\n break\r\n if not f:\r\n break\r\n ans += 1\r\n for i in range(n - 1, -1, -1):\r\n if a[i] <= sum:\r\n a[i] = 1000000000000000000000000000\r\n sum += 1\r\n if sum == n:\r\n f = False\r\n break\r\n if not f:\r\n break\r\n ans += 1\r\nprint(ans)\r\n", "n= int(input())\r\nl = list(map(int, input().rstrip().split(\" \")))\r\ns = sum(l)\r\ni = 0\r\nt = 0\r\nturns = 0\r\ng_u = True\r\nwhile s != -1*n:\r\n if l[i]<=t and l[i]>-1:\r\n t+=1\r\n s -= (l[i] + 1)\r\n l[i]=-1\r\n if s ==-1*n:\r\n break\r\n if g_u:\r\n i=i+1\r\n if i >= n:\r\n g_u= False\r\n i=i-2\r\n turns+=1\r\n else:\r\n i = i -1\r\n if i <0:\r\n g_u=True\r\n i=i+2\r\n turns+=1\r\nprint(turns)", "trash = input();\r\nline1 = [int(x) for x in input().split()];\r\ncred = 0;\r\nswitches = -1;\r\nwhile(max(line1)!=-1):\r\n switches += 1;\r\n for i in range( 0, len(line1), 1):\r\n \r\n if( line1[i] <= cred and line1[i] != -1):\r\n cred+=1;\r\n line1[i]=-1;\r\n \r\n if( max(line1) != -1):\r\n switches += 1;\r\n for i in range( len(line1)-1, -1, -1 ):\r\n if( line1[i] <= cred and line1[i] != -1):\r\n cred+=1;\r\n line1[i]=-1;\r\n \r\nprint(switches);", "n = input()\r\nn = int(n.strip())\r\n\r\nx = input()\r\nx = list(map(int, x.strip().split()))\r\n\r\ninformacij = 0\r\nsmeri = -1\r\nsmer = \"U\"\r\n\r\nwhile informacij < n:\r\n smeri += 1\r\n if smer == 'U':\r\n for i in range(len(x)):\r\n if (x[i] is not None) and x[i] <= informacij:\r\n informacij += 1\r\n x[i] = None\r\n smer = 'D'\r\n else:\r\n for i in range(len(x) - 1, -1, -1):\r\n if (x[i] is not None) and x[i] <= informacij:\r\n informacij += 1\r\n x[i] = None\r\n smer = 'U'\r\nprint(smeri)\r\n", "\r\n\r\nif __name__=='__main__':\r\n n = int(input())\r\n visited = [0]*n\r\n arr = list(map(int,input().split()))\r\n s = 0\r\n cnt = 0\r\n while s<n:\r\n for i in range(0,n):\r\n if s >= arr[i] and visited[i]==0:\r\n s += 1\r\n visited[i]=1\r\n if (s!=n):\r\n cnt += 1\r\n i = n - 1\r\n while i>=0:\r\n if s >= arr[i] and visited[i]==0:\r\n s += 1\r\n visited[i]=1\r\n i -= 1\r\n if s!=n:\r\n cnt += 1\r\n print(cnt)\r\n", "N = int(input())\nA = list(map(int, input().split()))\nL = [False for i in range(N)]\ni = 0\ncnt = 0\nans = 0\nflg = True\nwhile True:\n if not L[i] and A[i] <= cnt:\n L[i] = True\n cnt += 1\n if cnt == N:\n break\n if flg:\n i += 1\n if i == N:\n flg = False\n i = N - 1\n ans += 1\n else:\n i -= 1\n if i == -1:\n flg = True\n i = 0\n ans += 1\nprint(ans)\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Sat Oct 3 20:32:14 2015\r\n\r\n@author: Nikolay_Semyachkin\r\n\"\"\"\r\n\r\nn = int(input())\r\ncomp = input()\r\ncomp = [int(i) for i in comp.split()]\r\nncollected = [True]*n\r\ndirect = 'right'\r\npieces = 0\r\npos = 0\r\nchanges = 0\r\nwhile pieces<len(comp):\r\n for i in range(len(comp)):\r\n if (comp[i] <= pieces)&(ncollected[i]==True):\r\n pieces+=1\r\n ncollected[i]=False\r\n comp.reverse()\r\n ncollected.reverse()\r\n changes+=1\r\nprint(changes-1)\r\n \r\n ", "n = int(input())\r\na = [int(x) for x in input().split()]\r\nb = [True]*n\r\ninst = 0\r\nd = 0\r\nwhile(inst <n):\r\n if d%2==0:\r\n for i in range(0, n):\r\n if b[i] and a[i]<=inst:\r\n inst += 1\r\n b[i] = False\r\n \r\n else:\r\n for i in range(n-1, -1, -1):\r\n if b[i] and a[i]<=inst:\r\n inst += 1\r\n b[i] = False\r\n d += 1\r\nprint(d-1)\r\n", "n = int(input())\r\nA = list(map(int, input().split()))\r\n\r\ns, ret = 0, 0\r\nwhile True:\r\n for i in range(n):\r\n if A[i] <= s:\r\n A[i] = n+1\r\n s += 1\r\n if s == n:\r\n break\r\n ret += 1\r\n for i in range(n-1, -1, -1):\r\n if A[i] <= s:\r\n A[i] = n+1\r\n s += 1\r\n if s == n:\r\n break\r\n ret += 1\r\nprint(ret)\r\n", "def check(list):\r\n for i in list:\r\n if i!=False:\r\n return True\r\n return False\r\nn=int(input())\r\na=list(map(int,input().split()))\r\ninfo=0\r\ndir=1\r\nch=0\r\nb=[True]*n\r\nwhile (check(b)):\r\n if dir==1:\r\n co=0\r\n for i in range(n):\r\n if a[i]<=info and b[i]:\r\n info+=1\r\n co+=1\r\n b[i]=False\r\n #print(1)\r\n if check(b):\r\n dir=2\r\n ch+=1\r\n elif dir==2:\r\n for i in range(n):\r\n if a[n-i-1]<=info and b[n-i-1]:\r\n info+=1\r\n b[n-i-1]=False\r\n #print(2)\r\n if check(b):\r\n dir=1\r\n ch+=1\r\nprint(ch)\r\n \r\n", "n=int(input())\r\nl=[int(x) for x in input().split()] \r\ndone=0\r\nc=0\r\ns=set([])\r\nwhile(done<n):\r\n if c%2==0:\r\n for i in range(n):\r\n if done>=l[i] and i not in s:\r\n done+=1\r\n s.add(i)\r\n else:\r\n for i in range(n-1,-1,-1):\r\n if done>=l[i] and i not in s:\r\n done+=1\r\n s.add(i)\r\n if done==n:\r\n break\r\n c+=1\r\nprint(c)", "import sys\r\nlines = iter(sys.stdin.read().split(\"\\n\"))\r\nn = int(next(lines))\r\nnums = list(map(int, next(lines).strip(\" \").split(\" \")))\r\ntotal = 0\r\ncount = 0\r\nturns = -1\r\ndirection = 1\r\ndef traverse(nums, direction, total, count):\r\n \"\"\"direction - 0: left to right, 1: right to left\"\"\"\r\n if direction == 0:\r\n for i, num in enumerate(nums):\r\n if num != -1 and num <= total:\r\n count += 1\r\n total += 1\r\n nums[i] = -1\r\n elif direction == 1:\r\n for i in range(len(nums) - 1, -1, -1):\r\n num = nums[i]\r\n if num != -1 and num <= total:\r\n count += 1\r\n total += 1\r\n nums[i] = -1\r\n return total, count\r\nwhile count < n:\r\n turns += 1\r\n direction = 1 - direction\r\n total, count = traverse(nums, direction, total, count)\r\nprint(turns)\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\nf=[0]*n\r\nk=0\r\nans=0\r\nwhile k<n:\r\n for i in range(n):\r\n if f[i]==0 and l[i]<=k: k+=1; f[i]=1\r\n if k==n: break\r\n ans+=1\r\n for i in range(n):\r\n if f[n-i-1]==0 and l[n-i-1]<=k: k+=1; f[n-i-1]=1\r\n if k==n: break\r\n ans+=1\r\nprint(ans)", "n = int(input())\r\nlls = list(map(int,input().split()))\r\ninfor = 0\r\nans = 0\r\noo = -1\r\ni = 1\r\nj = n - 1\r\nll = [0] * n\r\nwhile infor < n:\r\n if j == oo:\r\n i = -i\r\n j = abs(j - n + 1)\r\n ans += 1\r\n oo += i\r\n if infor >= lls[oo] and ll[oo] == 0:\r\n ll[oo] = 1\r\n infor += 1\r\nprint(ans)", "import sys\nn = int(input())\na = list(map(int, sys.stdin.readline().split()))\nnbTurn = -1\nnbParts = 0\ndef check(a):\n a = [i for i in a if i > 0]\n \nwhile a:\n nbTurn += 1\n for i in range(len(a)):\n if a[i] <= nbParts:\n a[i] = -1\n nbParts += 1\n a = [i for i in a if i > 0]\n if len(a) == 0:\n break\n nbTurn += 1\n for i in range(len(a)-1,-1,-1):\n if a[i] <= nbParts:\n a[i] = -1\n nbParts += 1\n a = [i for i in a if i > 0]\n\nprint(nbTurn)\n", "n=int(input())\r\na=list(map(int,input().split()))\r\nx=0\r\nr=0\r\ni=0\r\nwhile 1:\r\n while i<len(a):\r\n if a[i]<=x:x+=1;a=a[:i]+a[i+1:]\r\n else:i+=1\r\n if not a:break\r\n r+=1\r\n while i>0:\r\n i-=1\r\n if a[i]<=x:x+=1;a=a[:i]+a[i+1:]\r\n if not a:break\r\n r+=1\r\nprint(r)", "n = int(input())\r\na = list(map(int, input().split(' ')[:n]))\r\nn_infos = 0\r\ndirection = 1\r\nres = 0\r\n\r\nwhile True:\r\n if direction == 1:\r\n r = range(n)\r\n else:\r\n r = range(n-1, -1, -1)\r\n\r\n for i in r:\r\n if n_infos >= a[i]:\r\n a[i] = float(\"inf\")\r\n n_infos += 1\r\n\r\n if n_infos == n:\r\n break\r\n\r\n direction = -direction\r\n res += 1\r\nprint(res)\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\ncnt = 0\r\nres = 0\r\nwhile len(a):\r\n b = []\r\n for el in a:\r\n if el <= cnt:\r\n cnt += 1\r\n else:\r\n b.append(el)\r\n a = b[::-1]\r\n res += 1\r\nprint(res - 1)", "if __name__ == '__main__':\r\n n = int(input())\r\n line = list(map(int, input().split()))\r\n num, res, flag = 0, 0, True\r\n while num < n:\r\n res += 1\r\n if flag:\r\n flag = False\r\n for i in range(n):\r\n if 0 <= line[i] <= num:\r\n num += 1\r\n line[i] = -1\r\n else:\r\n flag = True\r\n for i in range(n - 1, -1, -1):\r\n if 0 <= line[i] <= num:\r\n num += 1\r\n line[i] = -1\r\n print(res - 1)\r\n", "a=int(input())\r\ng=[int(i)for i in input().split()]\r\nf=[]\r\nfor j in range(a):\r\n f.append(False)\r\ns=0\r\nk=0\r\nq=0\r\np=1\r\ni=0\r\nwhile s<a:\r\n i=i+1\r\n if f[k]==False:\r\n if g[k]<=s:\r\n f[k]=True\r\n s=s+1\r\n if s<a:\r\n if k==a-1:\r\n q=q+1\r\n p=-1\r\n else:\r\n if k==0 and i!=1:\r\n q=q+1\r\n p=1\r\n\r\n k=k+p\r\nprint(q)\r\n", "values = int(input())\r\n\r\narray = list(map(int, input().split()))\r\n\r\ncounter = 0\r\nways =0\r\n\r\n\r\nwhile counter != values:\r\n for i in range(0,values):\r\n if array[i] != -1 and array[i] <= counter:\r\n counter += 1\r\n array[i] = -1\r\n if counter == values:\r\n break\r\n ways += 1\r\n for i in range(values-1, -1, -1):\r\n if array[i] != -1 and array[i] <= counter:\r\n counter += 1\r\n array[i] = -1\r\n if counter == values:\r\n break\r\n ways += 1\r\n\r\nprint(ways)", "n = int(input())\na = list(map(int, input().split()))\ndone = n * [ False ]\n\npasses = 0\nclues = 0\npos = 0\ndir = 1\n\nwhile clues != n:\n while pos >= 0 and pos < n:\n if not done[pos] and a[pos] <= clues:\n clues += 1\n done[pos] = True\n pos += dir\n passes += 1\n dir *= -1\n pos += dir\n\nprint(passes - 1)\n", "from sys import stdin,stdout\r\nfrom collections import Counter\r\ndef ai(): return list(map(int,input().split()))\r\ndef ei(): return map(int,input().split())\r\ndef ip(): return int(stdin.readline())\r\ndef op(ans): return stdout.write(str(ans) + '\\n')\r\n\r\nn = ip()\r\nli = ai()\r\nres = 0\r\ns = 0\r\nwhile 1:\r\n\tfor i in range(n):\r\n\t\tif li[i] <= s: s+= 1;li[i] = n+1\r\n\tif s == n: break\r\n\tres += 1\r\n\tfor i in range(n-1,-1,-1):\r\n\t\tif li[i] <= s: s+= 1;li[i] =n+1\r\n\tif s==n:break\r\n\tres += 1\r\nop(res)\r\n\r\n", "n = int(input())\nl = list(map(int, input().split()))\nm = [0 for i in range(n)]\nnum_switch = 0 \nnum_unlock = 0\ndirection = 1\ni = 0\nwhile num_unlock < n:\n if i > n - 1:\n i = n - 1\n num_switch += 1\n direction = -1\n if i < 0:\n i = 0\n num_switch += 1\n direction = 1\n if l[i] <= num_unlock and l[i] != -1:\n num_unlock += 1\n l[i] = -1\n i += direction\n\nprint(num_switch)\n", "n = int(input())\r\na = list(map(int, input().split()))\r\nturn, cnt, ans = 0, 0, -1\r\nli = [0]*n\r\nwhile 0 in li:\r\n ans += 1\r\n if turn == 0:\r\n for i in range(n):\r\n if a[i] <= cnt and li[i] == 0:\r\n cnt += 1\r\n li[i] = 1\r\n if 0 in li:\r\n turn = 1\r\n else:\r\n for i in range(n-1, -1, -1):\r\n if a[i] <= cnt and li[i] == 0:\r\n cnt += 1\r\n li[i] = 1\r\n if 0 in li:\r\n turn = 0\r\nprint(ans)", "n = int(input())\r\nmas=list(map(int,input().split(\" \")))\r\ns=0\r\np=0\r\nres=0\r\nwhile s<n:\r\n if p:\r\n for i in range(n-1,-1,-1):\r\n if mas[i]!=-1 and mas[i]<=s:\r\n s+=1\r\n mas[i]=-1\r\n p=0\r\n else:\r\n for i in range(n):\r\n if mas[i]!=-1 and mas[i]<=s:\r\n s+=1\r\n mas[i]=-1\r\n p=1\r\n res+=1\r\nprint(res-1)\r\n", "n, i, d, nc, nt = int(input()), 0, 1, 0, 0\r\nc = [False] * n\r\na = list(map(int, input().split()))\r\nwhile True:\r\n if not c[i] and nc >= a[i]:\r\n c[i] = True\r\n nc += 1\r\n if nc == n:\r\n print(nt)\r\n break\r\n i += d\r\n if i < 0 or i >= n:\r\n d = -d\r\n i += 2 * d\r\n nt += 1", "n = int(input())\r\na = list(map(int,input().split()))\r\ncount = 0\r\nans = 0\r\nwhile count<n:\r\n tmp = []\r\n m = len(a)\r\n for i in range(m):\r\n if count>=a[i]:\r\n count+=1\r\n else:\r\n tmp.append(a[i])\r\n if count<n:\r\n a = tmp[::-1]\r\n ans +=1\r\nprint(ans)", "n = int(input())\r\n\r\nl = input().split()\r\nl = [int(i) for i in l]\r\n\r\nhacked = []\r\n\r\nturns = -1\r\n\r\nwhile len(hacked) < n:\r\n new = []\r\n for i in range(len(l)):\r\n if l[i] <= len(hacked):\r\n new = [i] + new\r\n hacked.append(i)\r\n for i in new:\r\n l.pop(i)\r\n l.reverse()\r\n turns += 1\r\n\r\nprint(turns)\r\n", "\r\n# Problem: B. Robot's Task\r\n# Contest: Codeforces - Codeforces Round #323 (Div. 2)\r\n# URL: https://codeforces.com/contest/583/problem/B\r\n# Memory Limit: 256 MB\r\n# Time Limit: 1000 ms\r\n# Powered by CP Editor (https://github.com/cpeditor/cpeditor)\r\n\r\nfrom sys import stdin\r\ndef get_ints(): return list(map(int, stdin.readline().strip().split()))\r\n\r\nn = int(input())\r\nar = get_ints()\r\nc= 0\r\ni = 0\r\nturns = 0\r\ndir = 1\r\nfirst = True\r\ndone = [False]*n\r\nwhile c <n:\r\n\tif ar[i] <=c and not done[i]:\r\n\t\tdone[i] = True\r\n\t\tc+=1\r\n\tif c<n:\r\n\t\tif i ==0 or i == n-1:\r\n\t\t\tif first:\r\n\t\t\t\tfirst = False\r\n\t\t\telse:\r\n\t\t\t\tdir=-dir\r\n\t\t\t\tturns+=1\r\n\t\ti+=dir\r\n\r\nprint(turns)", "n = int(input())\r\na = list(map(int, input().split()))\r\ninfo = 0\r\ni = 0\r\ndir = 1\r\nresult = 0\r\nwhile True:\r\n if info >= a[i]:\r\n info += 1\r\n a[i] = n + 1\r\n if info == n:\r\n break\r\n i += dir\r\n if i < 0 or i == n:\r\n dir = -dir\r\n i += dir\r\n result += 1\r\nprint(result)\r\n", "from collections import *\r\nn=int(input())\r\na=list(map(int,input().split()))\r\nc=0\r\nx,j=0,0\r\nfor k in range(n):\r\n if(k%2==0):\r\n for i in range(n):\r\n if(j>=a[i] and a[i]!=-1):\r\n j+=1\r\n a[i]=-1\r\n else:\r\n for i in range(n-1,-1,-1):\r\n if(j>=a[i] and a[i]!=-1):\r\n a[i]=-1\r\n j+=1\r\n if(j==n):\r\n x=k\r\n break\r\nprint(x)\r\n", "n = int(input())\na = list(map(int, input().split()))\nvisited = [False]*n\nc = 0\ncycles = 0\norder = 1\nwhile not all(visited):\n for idx,i in enumerate(a[::order]):\n if order == -1:\n idx = n - idx - 1\n if not visited[idx] and i <= c:\n c += 1\n visited[idx] = True\n if all(visited):\n break\n order = 1 if order < 0 else -1\n cycles += 1\nprint(cycles)", "n=int(input())\r\narr=list(map(int,input().split()))\r\nans=-1\r\ntemp=0\r\nseen=set()\r\np=0\r\nwhile len(seen)!=n:\r\n ans+=1\r\n # print(seen,ans)\r\n if p%2==0:\r\n for i in range(n):\r\n if i not in seen and arr[i]<=temp:\r\n seen.add(i)\r\n temp+=1\r\n p+=1\r\n else :\r\n for i in range(n-1,-1,-1):\r\n if i not in seen and arr[i]<=temp:\r\n seen.add(i)\r\n temp+=1\r\n p+=1\r\nprint(ans)\r\n\r\n ", "n = int(input())\r\ndata = list(map(int, input().split()))\r\ncnt_info, cnt_direction = 0, 0\r\nwhile n > 0:\r\n if cnt_direction % 2 == 0:\r\n for i in range(0, len(data)):\r\n if data[i] != -1 and cnt_info >= data[i]:\r\n cnt_info += 1\r\n n -= 1\r\n #print(data[i])\r\n data[i] = -1\r\n else:\r\n for i in range(len(data) - 1, -1, -1):\r\n if data[i] != -1 and cnt_info >= data[i]:\r\n cnt_info += 1\r\n n -= 1\r\n #print(data[i])\r\n data[i] = -1\r\n cnt_direction += 1\r\nprint(cnt_direction - 1)", "n = int(input())\nl = list(map(int, input().split()))\nnl = [-1]*n\nkeys = 0\nturns = 0\n#print(l)\n#print(\"BEGIN-----------------\")\nwhile l != nl:\n if turns % 2 == 0:\n for pos in range(n):\n if l[pos] <= keys and l[pos] != -1:\n keys += 1\n l[pos] = -1\n else:\n for pos in range(n-1, -1, -1):\n if l[pos] <= keys and l[pos] != -1:\n keys += 1\n l[pos] = -1\n #print(l)\n turns += 1\nprint(turns-1)\n", "def main():\r\n n = int(input())\r\n arr = [int(x) for x in input().split()]\r\n used = [False] * n\r\n napr = True\r\n c = 0\r\n ans = 0\r\n while False in used:\r\n if napr:\r\n for i in range(n):\r\n if c >= arr[i] and used[i] == False:\r\n used[i] = True\r\n c += 1\r\n else:\r\n for i in range(n-1, 0-1, -1):\r\n if c >= arr[i] and used[i] == False: \r\n used[i] = True\r\n c += 1 \r\n napr = not(napr)\r\n if False in used:\r\n ans += 1\r\n \r\n print(ans)\r\n \r\nmain()", "n = int(input())\r\nlist = [int(x) for x in input().split()]\r\ncount = 0 #answer\r\n\r\nx = 0 #count level\r\ni = 0 #index\r\n\r\nwhile list!=[]:\r\n count += 1\r\n i = 0\r\n while i < len(list):\r\n if list[i] <= x:\r\n del list[i]\r\n x += 1\r\n else:\r\n i += 1\r\n if list!=[]:\r\n count += 1\r\n i = len(list)-1\r\n while i >= 0:\r\n if list[i] <= x:\r\n x += 1\r\n del list[i]\r\n i -= 1\r\n\r\ncount -= 1\r\nprint(count)", "n=int(input())\r\na=list(map(int,input().split()))\r\ns=0\r\nr=0\r\ni=0\r\nk=1\r\nf=0\r\nwhile s!=n:\r\n\tif a[i]<=s:\r\n\t\ts+=1\r\n\t\ta[i]=9999\r\n\tif (s!=n)and((i==n-1)or((i==0)and(f))):\r\n\t\tr+=1\r\n\t\tk*=-1\r\n\t\tf=1\r\n\ti+=k\r\nprint(r)\r\n", "import sys\n\ndef solve(n, an):\n ans = 0\n got = 0\n while True:\n for i in range(n):\n if an[i] <= got:\n an[i] = n+1\n got += 1\n if got == n:\n break\n ans += 1\n\n i = n-1\n while i >= 0:\n if an[i] <= got:\n an[i] = n+1\n got += 1\n i -= 1\n if got == n:\n break\n ans += 1\n return ans\n\n\nn = int(input())\nan = list(map(int, sys.stdin.readline().split()))\nprint(solve(n, an))\n", "def main():\r\n n = int(input())\r\n a = list(map(int, input().split()))\r\n\r\n cur = 0\r\n j = 1\r\n cnt = 0\r\n i = 0\r\n used = [False] * n\r\n while True:\r\n if used == [True] * n:\r\n break\r\n while 0 <= i < n and (a[i] > cur or a[i] <= cur and used[i]):\r\n i += j\r\n if i == -1 or i == n:\r\n j = -j\r\n cnt += 1\r\n i = 0 if i == -1 else n - 1\r\n else:\r\n used[i] = True\r\n cur += 1\r\n print(cnt)\r\nmain()\r\n \r\n", "n = int(input())\r\ncomputers = list(map(int, input().split()))\r\nkeys = 0\r\nsteps = 0\r\nindex = 0\r\nwhile keys < n:\r\n if not index > len(computers) - 1:\r\n if not computers[index] > keys:\r\n del computers[index]\r\n keys += 1\r\n else:\r\n index += 1\r\n else:\r\n computers.reverse()\r\n index = 0\r\n steps += 1\r\nprint(steps)\r\n", "import sys \n\n\nn = int(sys.stdin.readline())\n\n\narray = [int(i) for i in sys.stdin.readline().split()]\n\nsecond = [0 for i in range(n)]\n\nmodified = True\ncont = 0 \nback = False\nturn = 0\n\nwhile modified == True:\n modified = False\n \n if not back: # \n added = False\n for i,val in enumerate(array) :\n if second[i] == 0:\n if val <= cont:\n cont += 1 \n modified = True\n second[i] = 1\n if not added:\n turn += 1 \n added = True\n\n else: # back\n added = False\n for i, val in enumerate(array[::-1]):\n if second[-i -1 ] == 0:\n if val <= cont:\n cont += 1 \n modified = True\n second[-i -1 ] = 1 \n if not added:\n turn += 1 \n added = True\n back = not back\n \n\nprint(turn - 1 )\n \n\n\n", "# reading\r\nn = int(input())\r\na = list(map(int, input().split()))\r\n\r\nturn = 0\r\ninfo = 0\r\n\r\nok = 1\r\nwhile ok == 1:\r\n ok = 0\r\n if turn % 2 == 0:\r\n for i in range(0, n):\r\n if a[i] <= info:\r\n info += 1\r\n a[i] = 1001\r\n ok = 1\r\n else:\r\n for i in range(n-1, -1, -1):\r\n if a[i] <= info:\r\n info += 1\r\n a[i] = 1001\r\n ok = 1\r\n if ok == 1:\r\n turn += 1\r\n\r\nprint(turn-1)", "\r\n\r\n\r\nn = int(input())\r\nrequired = input().split()\r\nhacked = []\r\nfor i in range(0, n) :\r\n required[i] = int(required[i])\r\n hacked.append(False)\r\n\r\nturns = 0\r\ngot = 0\r\nr = range(0, n)\r\nl = range(n-1, -1, -1)\r\nright = True\r\nwhile got != n :\r\n if right :\r\n for i in r :\r\n if required[i] <= got and not hacked[i] :\r\n got += 1\r\n hacked[i] = True\r\n else :\r\n for i in l :\r\n if required[i] <= got and not hacked[i] :\r\n got += 1\r\n hacked[i] = True\r\n turns += 1\r\n right = not right\r\n\r\nprint(turns - 1)\r\n\r\n\r\n\r\n\r\n\r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\nz=[0 for i in range(n)]\r\nc=0\r\nans=0\r\nf=0\r\nwhile(set(z)!={1}):\r\n \r\n\tif f==0:\r\n\t\tfor j in range(len(a)):\r\n\t\t\tif a[j]<=c and z[j]!=1:\r\n\t\t\t\tc+=1\r\n\t\t\t\tz[j]=1\r\n\t\tf=1\r\n\telse:\r\n\t\tfor j in range(len(a)-1,-1,-1):\r\n\t\t\tif a[j]<=c and z[j]!=1:\r\n\t\t\t\tc+=1\r\n\t\t\t\tz[j]=1\r\n\t\tf=0\r\n\tans+=1\r\nprint(ans-1)", "n = int(input())\r\nl = list(map(int, input().split()))\r\npieces = 0\r\nres = -1\r\nwhile pieces < n:\r\n for i in range(n):\r\n if l[i] <= pieces:\r\n pieces += 1\r\n l[i] = 1001 \r\n res += 1 \r\n if pieces == n:\r\n print(res)\r\n exit(0)\r\n \r\n for i in range(n-1, -1, -1):\r\n if l[i] <= pieces:\r\n pieces += 1\r\n l[i] = 1001\r\n res += 1 \r\n if pieces == n:\r\n print(res)\r\n exit(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(map(int, input().split()))\r\nu = 0\r\nans = -1\r\nwhile u ^ n:\r\n if ans % 2:\r\n for j in range(n):\r\n if a[j] ^ -1 and a[j] <= u:\r\n a[j] = -1\r\n u += 1\r\n else:\r\n for j in range(n - 1, -1, -1):\r\n if a[j] ^ -1 and a[j] <= u:\r\n a[j] = -1\r\n u += 1\r\n ans += 1\r\nprint(ans)", "import math\r\nfrom collections import defaultdict\r\n\r\ndef input_ints():\r\n return list(map(int, input().split()))\r\n\r\ndef solve():\r\n n = int(input())\r\n a = input_ints()\r\n use = [0] * n\r\n x = 0\r\n for i in range(n):\r\n for j in range(n) if i % 2 == 0 else range(n - 1, -1, -1):\r\n if not use[j] and x >= a[j]:\r\n x += 1\r\n use[j] = 1\r\n if x == n:\r\n print(i)\r\n return\r\n\r\nif __name__ == '__main__':\r\n solve()\r\n", "n=int(input())\r\nx=list(map(int,input().split()))\r\nc=0\r\nt=-1\r\nwhile True:\r\n t+=1\r\n for i in range(n):\r\n if x[i]!=\"X\" and x[i]<=c:\r\n c+=1\r\n x[i]=\"X\"\r\n if c==n:\r\n break\r\n t+=1\r\n for i in range(n-1,-1,-1):\r\n if x[i]!=\"X\" and x[i]<=c:\r\n c+=1\r\n x[i]=\"X\"\r\n if c==n:\r\n break\r\nprint(t)", "x=int(input())\r\ny=[int(num)for num in input().split(\" \")]\r\ncur,dir=0,1\r\ndef solve(a,cur):\r\n if a==1:\r\n for i in range(x):\r\n if y[i]<cur+1 and y[i]!=-1:\r\n y[i]=-1\r\n cur+=1\r\n else:\r\n for i in range(x-1,-1,-1):\r\n if y[i] < cur+1 and y[i] != -1:\r\n y[i] = -1\r\n cur += 1\r\n return cur\r\n\r\n\r\nret=-1\r\nwhile cur < x:\r\n cur = solve (dir,cur)\r\n dir = 0 - dir\r\n ret += 1\r\nprint(ret)\r\n", "import sys\r\n\r\nnum_of_comp = sys.stdin.readline()\r\n\r\nnext_list = [int(i) for i in sys.stdin.readline().split(' ')]\r\n\r\ncollected_info = 0\r\nchange_of_dir = 0\r\n\r\nwhile next_list:\r\n current_list = list(next_list)\r\n next_list = list()\r\n for current_info in current_list:\r\n if current_info <= collected_info:\r\n collected_info += 1\r\n else:\r\n next_list.insert(0, current_info)\r\n\r\n change_of_dir += 1\r\n\r\nprint(change_of_dir-1)", "def main():\r\n n = int(input())\r\n\r\n a = [int(i) for i in input().split(' ')]\r\n b = [False for i in a]\r\n\r\n if n==1:\r\n print(0)\r\n return\r\n\r\n turns = 0\r\n parts = 0\r\n incr = 1\r\n i=0\r\n\r\n while(parts<n):\r\n while(a[i]>parts):\r\n i+=incr\r\n if i==n or i<0:\r\n turns+=1\r\n incr*=-1\r\n i+=2*incr\r\n if b[i]:\r\n i+=incr\r\n if i==n or i<0:\r\n turns+=1\r\n incr*=-1\r\n i+=2*incr\r\n continue\r\n parts+=1\r\n if parts == n: break\r\n b[i]=True\r\n i+=incr\r\n if i==n or i<0:\r\n turns+=1\r\n incr*=-1\r\n i+=2*incr\r\n\r\n print(turns)\r\n\r\nmain()", "'''\r\nCreated on Oct 11, 2015\r\n\r\n@author: Ismael\r\n'''\r\nn=int(input())\r\nl=[int(c) for c in input().split()]\r\ncount = 0\r\ni=0\r\ndirec=1\r\nchange=0\r\nwhile(count < n):\r\n v = l[i]\r\n if v <= count:\r\n #print(i,\"grab\")\r\n l[i] = n+1\r\n count += 1\r\n if count == n:\r\n break\r\n if (i == 0 and direc == -1) or (i == n-1 and direc == 1):\r\n #print(i,\"change\")\r\n direc = -direc\r\n change+=1\r\n i += direc\r\nprint(change)", "# 583B\r\n# θ(n*log(n)) time\r\n# θ(n) space\r\nfrom queue import PriorityQueue\r\n\r\n__author__ = 'artyom'\r\n\r\n\r\n# SOLUTION\r\n\r\ndef main():\r\n n = read()\r\n a = read(3)\r\n if n == 1:\r\n return 0\r\n ix = []\r\n for i in range(n):\r\n ix.append(i)\r\n ix.sort(key=lambda x: a[x])\r\n l = PriorityQueue()\r\n r = PriorityQueue()\r\n i = pos = eg = flag = count = 0\r\n while eg < n:\r\n while i < n and a[ix[i]] <= eg:\r\n if ix[i] > pos:\r\n r.put(ix[i])\r\n elif ix[i] < pos:\r\n l.put(-ix[i])\r\n else:\r\n eg += 1\r\n i += 1\r\n if flag:\r\n if l.empty():\r\n flag = 0\r\n count += 1\r\n pos = r.get()\r\n else:\r\n pos = -l.get()\r\n else:\r\n if r.empty():\r\n flag = 1\r\n count += 1\r\n pos = -l.get()\r\n else:\r\n pos = r.get()\r\n eg += 1\r\n return count\r\n\r\n\r\n# HELPERS\r\n\r\ndef read(mode=1, size=None):\r\n # 0: String\r\n # 1: Integer\r\n # 2: List of strings\r\n # 3: List of integers\r\n # 4: Matrix of integers\r\n if mode == 0: return input().strip()\r\n if mode == 1: return int(input().strip())\r\n if mode == 2: return input().strip().split()\r\n if mode == 3: return list(map(int, input().strip().split()))\r\n a = []\r\n for _ in range(size):\r\n a.append(read(3))\r\n return a\r\n\r\n\r\ndef write(s=\"\\n\"):\r\n if s is None: s = ''\r\n if isinstance(s, tuple) or isinstance(s, list): s = ' '.join(map(str, s))\r\n s = str(s)\r\n print(s, end=\"\\n\")\r\n\r\n\r\nwrite(main())", "n=int(input())\r\ns=list(map(int,input().split()))\r\nc=[0]*n\r\ni=0\r\no=1\r\np=-1\r\nd=0\r\nwhile(i!=n):\r\n if(p+o<0) or (p+o>=n):\r\n o*=-1\r\n d+=1\r\n p+=o\r\n if(c[p]==0 and s[p]<=i):\r\n c[p]=1\r\n i+=1\r\n\r\nprint(d)", "n = int(input())\nL = list(map(int, input().split()))\nP = [ 0 for _ in range(n)]\nr = 0\nt = 0\nwhile t < n:\n for k in range(n):\n if P[k] == 0 and L[k] <= t:\n t+=1\n P[k] = 1\n r+=1\n if t == n:\n break\n for k in range(n):\n if P[n-k-1] == 0 and L[n-k-1] <= t:\n t+=1\n P[n-k-1] = 1\n r+=1\nprint(r-1)", "changesInDirection = -1\n\nnumberOfInformation = 0\n\nn = int(input())\n\ninformations = [int(x) for x in input().split()]\n\n\nwhile len(informations) > 0:\n indices = []\n for index, information in enumerate(informations):\n if information <= numberOfInformation:\n indices.append(index)\n numberOfInformation += 1\n for doubleindex, index in enumerate(indices):\n informations.pop(index - doubleindex)\n changesInDirection += 1\n informations = list(reversed(informations))\n\nprint(changesInDirection)\n", "n = int(input())\r\na_cost = [int(x) for x in input().split()]\r\n\r\nvisit = [0 for i in range(n)]\r\n\r\nnbPieces = 0\r\npos = 0\r\ncur_dir = 1\r\n\r\nnbChangements = 0\r\nwhile True:\r\n \r\n if (nbPieces >= a_cost[pos]) and (visit[pos] == 0):\r\n nbPieces += 1\r\n visit[pos] += 1 \r\n\r\n if nbPieces == n:\r\n print(nbChangements)\r\n break \r\n \r\n pos += cur_dir\r\n \r\n if pos == n:\r\n cur_dir = -1\r\n pos += cur_dir\r\n nbChangements += 1\r\n \r\n if pos == -1:\r\n cur_dir = 1\r\n pos += cur_dir\r\n nbChangements += 1", "from itertools import combinations\n\n__author__ = 'ploskov'\n\n\ndef main():\n n = int(input())\n\n computers = list(map(int, input().split()))\n\n current_info = 0\n reverses = 0\n\n while computers:\n i = 0\n while i < len(computers):\n if computers[i] <= current_info:\n computers.pop(i)\n current_info += 1\n else:\n i += 1\n computers.reverse()\n reverses += 1\n\n print(reverses - 1)\n\n\nif __name__ == '__main__':\n main()\n", "import sys\r\nimport string\r\n\r\nfrom collections import Counter, defaultdict\r\nfrom math import fsum, sqrt, gcd, ceil, factorial\r\nfrom itertools import combinations, permutations\r\n\r\n# input = sys.stdin.readline\r\nflush = lambda: sys.stdout.flush\r\ncomb = lambda x, y: (factorial(x) // factorial(y)) // factorial(x - y)\r\n\r\n\r\n# inputs\r\n# ip = lambda : input().rstrip()\r\nip = lambda: input()\r\nii = lambda: int(input())\r\nr = lambda: map(int, input().split())\r\nrr = lambda: list(r())\r\n\r\n\r\nn = ii()\r\narr = rr()\r\nc = 0\r\nturn = 0\r\n\r\ni = 0\r\nwhile c < n:\r\n if arr[i] != -1 and arr[i] <= c:\r\n c += 1\r\n arr[i] = -1\r\n i += 1\r\n if i == n and c < n:\r\n i = 0\r\n turn += 1\r\n # print(arr)\r\n arr = arr[::-1]\r\n\r\nprint(turn)", "n = int(input())\r\ncoms = [int(x) for x in input().split()]\r\nres = 0\r\nstate = []\r\ncollected = 0\r\nfor i in range (n):\r\n state.append(1)\r\ni = 0\r\nturnRight = True\r\nwhile collected < n:\r\n if state[i] == 1:\r\n if coms[i] <= collected:\r\n state[i] = 0\r\n collected += 1\r\n if collected == n:\r\n print(res)\r\n exit()\r\n if turnRight:\r\n i += 1\r\n if i == n:\r\n res += 1\r\n turnRight = False\r\n i = n - 1\r\n else:\r\n i -= 1\r\n if i == -1:\r\n res += 1\r\n turnRight = True\r\n i = 0", "\r\n\r\n\r\nn = int(input())\r\n\r\nt = list(map(int,input().split()))\r\n\r\n\r\nc=0\r\n\r\n\r\na=[]\r\np=0\r\nm=0\r\nwhile len(a)+len(t)!=0:\r\n if len(a)==0 and len(t)!=0:\r\n while len(t)!=0:\r\n x=t.pop(0)\r\n if x<=c:\r\n c+=1\r\n else:\r\n a.append(x)\r\n m+=1\r\n else:\r\n\r\n while len(a)!=0:\r\n v=a.pop()\r\n if v<=c:\r\n c+=1\r\n else:\r\n t=[v]+t\r\n m+=1\r\n \r\n\r\nprint(m-1)\r\n \r\n", "__author__ = 'dell'\nn=int(input())\na=list(map(int,input().split()))\nreverse=0\npick=0\ndirshow=1\ni=0\nflagrev=0\nwhile pick!=n:\n\n if a[i]<=pick:\n a[i]=9999\n pick+=1\n\n if (pick!=n)and((i==n-1)or((i==0)and(flagrev))):\n flagrev=1\n dirshow*=-1\n reverse+=1\n\n i+=dirshow\nprint(reverse)\n", "n=int(input())\nl=list(map(int,input().split()))[::-1]\nk=0\np=-1\nwhile k!=n:\n l=l[::-1]\n p+=1\n for i in range(n):\n if l[i]!=-1 and l[i]<=k:\n k+=1\n l[i]=-1\nprint(p)\n\t\t \t \t \t\t\t\t\t\t \t \t \t \t", "n=int(input())\r\nl=list(map(int,input().split()))[::-1]\r\nk=0\r\np=-1\r\nwhile k!=n:\r\n l=l[::-1]\r\n p+=1\r\n for i in range(n):\r\n if l[i]!=-1 and l[i]<=k:\r\n k+=1\r\n l[i]=-1\r\nprint(p)", "n = int(input())\r\narr = list(map(int, input().split()))\r\nit, res, mx, i, j = 0, 0, -1, 1, n-1\r\nvis = [0] * n\r\nwhile it < n:\r\n if j == mx:\r\n i = -i\r\n j = abs(j - n + 1)\r\n res += 1\r\n mx += i\r\n if it >= arr[mx] and vis[mx] == 0:\r\n vis[mx] = 1\r\n it += 1\r\nprint(res)\r\n", "# ---rgkbitw---\r\n# 7.10.2017\r\nn=int(input())\r\na=list(map(int,input().split()))\r\ntotal=0\r\nanswer=0\r\nwhile True:\r\n for i in range(n):\r\n if a[i]<=total:\r\n a[i]=n+1\r\n total+=1\r\n if total==n:break\r\n answer+=1\r\n for i in range(n-1,-1,-1):\r\n if a[i]<=total:\r\n a[i]=n+1\r\n total+=1\r\n if total==n:break\r\n answer+=1\r\nprint(answer)\r\n\r\n\r\n", "n = int(input())\r\nlis=list(map(int,input().split()))\r\nc=0\r\nans=prev=0\r\nans=-1\r\nwhile c<n:\r\n for i in range(n):\r\n if prev>=lis[i] and lis[i]!=-1:\r\n prev+=1\r\n lis[i]=-1\r\n c+=1 \r\n ans+=1\r\n if c==n:\r\n break \r\n for i in range(n-1,-1,-1):\r\n if prev>=lis[i] and lis[i]!=-1:\r\n prev+=1\r\n lis[i]=-1\r\n c+=1\r\n ans+=1\r\nprint(ans) \r\n", "#!/usr/bin/python3\n\nimport itertools as ittls\nfrom collections import Counter\n\nfrom pprint import pprint as pprint\n\nimport re\nimport math\n\n\ndef sqr(x):\n return x*x\n\ndef inputarray(func=int):\n return map(func, input().split())\n\n# --------------------------------------\n# --------------------------------------\n\nN = int(input())\nA = list(inputarray())\n\npower, i = 0, 0\nmask = [0]*N\n\nwhile power < N:\n s = 0\n\n domain = range(N) if i&1 != 1\\\n else range(N - 1, -1, -1)\n for j in domain:\n if mask[j] == 0 and A[j] <= power:\n mask[j] = 1\n power = power + 1\n\n i = i + 1\n\nprint(i - 1)\n", "n = int(input())\na = [int(x) for x in input().split()]\nhacked = 0\npos = 0\nchanges = 0\nright = True\n\nwhile hacked < n:\n if right:\n r = range(pos, n)\n else:\n r = range(pos, -1, -1)\n\n for i in r:\n if a[i] <= hacked:\n a[i] = n + 1\n hacked += 1\n pos = i\n\n if hacked < n:\n changes += 1\n right = not right\n\nprint(changes)\n", "n=int(input(''))\r\ns=input('')\r\na=s.split(\" \")\r\narr=[]\r\nfor i in range(0,n):\r\n arr.append(int(a[i]))\r\ns=-1\r\nnum=0\r\nd={}\r\nk=1\r\nwhile num<n:\r\n for i in range(0,n):\r\n l=i\r\n if k==-1:\r\n l=n-i-1\r\n try:\r\n x=d[l]\r\n except:\r\n if arr[i]<=num:\r\n num+=1\r\n d[l]=1\r\n arr=arr[::-1]\r\n s+=1\r\n k*=-1\r\nprint(s)\r\n \r\n \r\n ", "\r\nn = int(input().split()[0])\r\ns = input().split()\r\na = [int(i) for i in s]\r\n\r\na = a[::-1]\r\nscore = 0\r\nchanges = -1\r\nwhile a:\r\n changes += 1\r\n ai = []\r\n for i in a[::-1]:\r\n if i > score:\r\n ai += [i]\r\n else:\r\n score += 1\r\n a = ai[:]\r\n\r\nprint(changes)\r\n", "n = int(input())\nps = list(map(int, input().split()))\n\ncollected = [False for i in range(n)]\ninfos = 0\ndirection = 1\ni = 0\nturns = 0\nwhile infos < n:\n if not collected[i] and ps[i] <= infos:\n collected[i] = True\n infos += 1\n if infos == n:\n break\n if i == (n - 1) * (direction == 1):\n direction *= -1\n turns += 1\n i += 1 * direction\n\nprint(turns)\n", "n, A = int(input()), list(enumerate(map(int, input().split())))\r\npieces, turns = set(), -1\r\n\r\nwhile len(pieces) < n:\r\n for i, a in A:\r\n if a <= len(pieces):\r\n pieces.add(i)\r\n A, turns = A[::-1], turns + 1\r\n\r\nprint(turns)", "x = int(input())\r\nls = input().split()\r\nfor i in range(len(ls)): ls[i]=int(ls[i])\r\nans = 0\r\nchk = [False]*x\r\ncnt = 0\r\nindex = 0\r\ndirection = True\r\nwhile (cnt < x):\r\n if not(chk[index]) and (cnt >= ls[index]):\r\n chk[index] = True\r\n cnt += 1\r\n\r\n if (cnt == x):\r\n break\r\n \r\n index += 1 if direction else -1\r\n \r\n if index == x:\r\n direction = False\r\n index = x-2\r\n ans += 1\r\n \r\n if index == -1:\r\n direction = True\r\n index = 1\r\n ans += 1\r\nprint(ans)\r\n", "_ = input()\r\nns = map(int, input().split())\r\nc = 0\r\ncur = 0\r\nwhile True:\r\n new = []\r\n for i in ns:\r\n if i <= cur:\r\n cur += 1\r\n else:\r\n new.append(i)\r\n if not new:\r\n break\r\n ns = reversed(new)\r\n c += 1\r\nprint(c)", "n = int(input())\r\nA = [int(i) for i in input().split()]\r\nvisited = [0 for i in range(n)]\r\nnow = 0\r\nresult = 0\r\n\r\ndef left():\r\n global n, result, now\r\n result += 1\r\n for i in range(n):\r\n if visited[i] == 0 and A[i] <= now:\r\n visited[i] = 1\r\n now += 1\r\n\r\ndef right():\r\n global n, result, now\r\n result += 1\r\n for i in range(n - 1, -1, -1):\r\n if visited[i] == 0 and A[i] <= now:\r\n visited[i] = 1\r\n now += 1\r\n \r\nwhile now != n:\r\n left()\r\n if now != n:\r\n right()\r\n \r\nprint(result - 1)\r\n\r\n\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\nk=0\r\nk1=0\r\nz=0\r\nt=1\r\nwhile k1<n :\r\n if t==1 :\r\n for i in range(n) :\r\n if l[i]<=z and l[i]!=-1 :\r\n z=z+1\r\n k1=k1+1\r\n l[i]=-1\r\n if t==2 :\r\n for i in range(n-1,-1,-1) :\r\n if l[i]<=z and l[i]!=-1 :\r\n z=z+1\r\n k1=k1+1\r\n l[i]=-1\r\n if t==2 :\r\n t=1\r\n else :\r\n t=2\r\n if k1>=n :\r\n break\r\n else :\r\n k=k+1\r\n \r\nprint(k)\r\n \r\n \r\n \r\n", "#!/usr/bin/env python\n\nfrom sys import stdin\n\nn = int(stdin.readline())\na = [int(x) for x in stdin.readline().split()]\nvisited = [False] * n\nvisited_count = 0\nturns = 0\n\ndir = 1\nposition = 0\n\nwhile True:\n if not visited[position] and a[position] <= visited_count:\n visited[position] = True\n visited_count += 1\n if visited_count == n:\n break\n if dir == 1 and position == n-1 or dir == -1 and position == 0:\n dir = -dir\n turns += 1\n position += dir\n\nprint(turns)\n", "n = int(input())\r\nl = list(map(int,input().split()))[::-1]\r\n\r\ntotal,c = 0, 0\r\nwhile c<n:\r\n l = l[::-1]\r\n for i, e in enumerate(l):\r\n if e<=c and e>=0:\r\n c+=1\r\n l[i] = -1\r\n total += 1\r\n\r\nprint (total-1)", "def main():\n input()\n kn, res = 0, -1\n aa = list(map(int, input().split()))[::-1]\n while aa:\n bb = []\n res += 1\n for a in reversed(aa):\n if a <= kn:\n kn += 1\n else:\n bb.append(a)\n aa = bb\n print(res)\n\n\nif __name__ == '__main__':\n main()\n", "import sys\nsys.setrecursionlimit(1500)\n\n\nN = int(input())\nA = [int(x) for x in input().split()]\nr = 0\n\nfor c in range(N + 1):\n if c % 2 == 0:\n for i in range(N):\n if A[i] >= 0 and A[i] <= r:\n r += 1\n A[i] = -1\n res = c\n else:\n for i in range(N - 1, -1, -1):\n if A[i] >= 0 and A[i] <= r:\n r += 1\n A[i] = -1\n res = c\n if r == N:\n break\nprint(res)\n", "n=int(input())\r\ncomp=list(map(int,input().split(' ')))\r\ndone=0\r\nchecked=[]\r\nc=0\r\nt=-1\r\nd=-1\r\nwhile done<n:\r\n t+=1\r\n d*=-1\r\n if 0 not in checked:\r\n if comp[0]==0:\r\n done+=1\r\n checked.append(0)\r\n c+=d\r\n while c>=0 and c<n:\r\n if c not in checked:\r\n if comp[c]<=done:\r\n done+=1\r\n checked.append(c)\r\n c+=d\r\nprint(t)", "def read_data():\r\n n = int(input())\r\n As = list(map(int, input().split()))\r\n return n, As\r\n\r\ndef solve(n, As):\r\n s = 0\r\n turn = 0\r\n direction = 0\r\n poss = [list(range(n)), list(range(n-1, -1, -1))]\r\n while s < n:\r\n for pos in poss[direction]:\r\n a = As[pos]\r\n if a <= s:\r\n s += 1\r\n As[pos] = n + 1\r\n if s == n:\r\n return turn\r\n direction = 1 - direction\r\n turn += 1\r\n\r\nn, As = read_data()\r\nprint(solve(n, As))", "n = int(input())\r\na = [int(i) for i in input().split()]\r\nmyinfo = 0\r\nres = 0\r\n\r\nwhile a:\r\n\r\n\ti = 0\r\n\twhile i < len(a):\r\n\t\tif myinfo >= a[i]:\r\n\t\t\tmyinfo += 1\r\n\t\t\tdel a[i]\r\n\t\t\ti -= 1\r\n\r\n\t\ti += 1\r\n\r\n\ta = a[::-1]\r\n\tres += 1\r\n\r\nprint(res-1)", "from sys import stdin\r\nlive = True\r\nif not live: stdin = open(\"data.in\", \"r\")\r\n\r\nn = int(stdin.readline().strip())\r\nc = list(map(int, stdin.readline().strip().split()))\r\n\r\ng = dir = 0\r\nans = -1\r\nwhile g != n:\r\n\tans += 1\r\n\tif dir == 0:\r\n\t\tfor it in range(n):\r\n\t\t\tif c[it] <= g and c[it] != - 1:\r\n\t\t\t\tg += 1\r\n\t\t\t\tc[it] = -1\r\n\telse:\r\n\t\tfor it in range(n - 1, -1, -1):\r\n\t\t\tif c[it] <= g and c[it] != - 1:\r\n\t\t\t\tg += 1\r\n\t\t\t\tc[it] = -1\r\n\tdir = 1 - dir\r\nprint(ans)\r\n\t\r\nif not live: stdin.close()", "n = int(input())\r\n\r\ncrypt = list(map(int, input().split()))\r\n\r\ni = 0\r\npocet_inf = 0\r\nrotates = 0\r\ndirection = \"forvard\"\r\ncount_inf = sum(crypt)\r\ngeted_inf = 0\r\nfirst_iter = True\r\nwhile True:\r\n\tif crypt[i] != \"checked\" and crypt[i] <= pocet_inf:\r\n\t\tpocet_inf += 1\r\n\t\tgeted_inf += crypt[i]\r\n\t\tcrypt[i] = \"checked\"\r\n\tif geted_inf == count_inf:\r\n\t\tbreak\r\n\telse:\r\n\t\tif i == len(crypt) - 1:\r\n\t\t\tdirection = \"back\"\r\n\t\t\trotates += 1\r\n\t\tif i == 0 and not first_iter:\r\n\t\t\tdirection = \"forvard\"\r\n\t\t\trotates += 1\r\n\tif direction == \"forvard\":\r\n\t\ti += 1\r\n\telif direction == \"back\":\r\n\t\ti -= 1\r\n\tfirst_iter = False\r\n\r\n\r\nprint(rotates)\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\nk = 0\r\nans = 0\r\nwhile k != n:\r\n if ans % 2 == 0:\r\n for i in range(n):\r\n if a[i] <= k:\r\n k += 1\r\n a[i] = 10000\r\n else:\r\n for i in range(n - 1, -1, -1):\r\n if a[i] <= k:\r\n k += 1\r\n a[i] = 10000\r\n ans += 1\r\nprint(ans - 1)\r\n", "import sys\n\n\n#sys.stdin = open(\"input.txt\")\n#sys.stdout = open(\"output.txt\", \"w\")\n\nn = int(input())\nlst = [int(i) for i in input().split()]\nwas = [False for i in range(n)]\ncur = 0\nind = 0\nans = 0\ncurdir = 1\nwhile cur < n:\n\t#print(\"ind = \", ind)\n\tif not was[ind]:\n\t\tif lst[ind] <= cur:\n\t\t\tcur += 1\n\t\t\twas[ind] = True\n\t\t\tif cur == n:\n\t\t\t\tbreak\n\tif ind == n - 1 and curdir > 0 or ind == 0 and curdir < 0:\n\t\tcurdir = -curdir\n\t\tans += 1\n\tind += curdir\n\nprint(ans)\n\n", "n = int(input())\n#n, m = map(int, input().split())\n#s = input()\nc = list(map(int, input().split()))\nl = 0\ns = 0\np = 1\ni = 0\nwhile s != n:\n if c[i] != -1 and s >= c[i] :\n s += 1\n c[i] = -1\n i += p\n if (i == n or i == -1) and s != n:\n p *= -1\n l += 1\n i += 2 * p \nprint(l)", "n = int(input())\narr = [int(x) for x in input().split()]\nc = 0\nans = 0\ncnt = 0\nfor i in range(n):\n\tfor j in range(n):\n\t\tif arr[j]==-1:\n\t\t\tcnt += 1\n\t\telif arr[j]<=c:\n\t\t\tc += 1\n\t\t\tarr[j] = -1\n\t\t\tcnt +=1\n\tif cnt==n:\n\t\tbreak\n\telse:\n\t\tcnt = 0\n\tans += 1\n\tfor j in range(n-1,-1,-1):\n\t\tif arr[j]==-1:\n\t\t\tcnt += 1\n\t\telif arr[j]<=c:\n\t\t\tc += 1\n\t\t\tarr[j] = -1\n\t\t\tcnt += 1\n\tif cnt==n:\n\t\tbreak\n\telse:\n\t\tcnt = 0\n\tans += 1\n\t\nprint(ans)\n\t\n", "# ----------------------------\r\n# * Based on orailly's program\r\n# ----------------------------\r\n\r\n\r\ndef main():\r\n input()\r\n info, dir_c = 0, -1\r\n a = list(map(int, input().split()))\r\n while a:\r\n temp = []\r\n dir_c += 1\r\n for aa in a:\r\n if aa <= info:\r\n info += 1\r\n else:\r\n temp.insert(0, aa)\r\n a = temp\r\n print(dir_c)\r\n\r\n\r\n# orailly's direct copy paste program\r\ndef main2(): # Equivalent to main()\r\n input()\r\n kn, res = 0, -1\r\n aa = list(map(int, input().split()))[::-1]\r\n while aa:\r\n bb = []\r\n res += 1\r\n for a in reversed(aa):\r\n if a <= kn:\r\n kn += 1\r\n else:\r\n bb.append(a)\r\n aa = bb\r\n print(res)\r\n\r\nif __name__ == '__main__':\r\n main()\r\n\r\n# --------------------------\r\n# * cgl-fai's failed attempt\r\n# - Slow\r\n# --------------------------\r\n# n = int(input())\r\n# a = [int(i) for i in input().split()]\r\n# cracked = [False] * n\r\n# index = 0\r\n# direction_change = 0\r\n# information = 0\r\n# movement = +1\r\n# last_a = 0\r\n# while not all(cracked):\r\n# if a[index] <= information and not cracked[index]:\r\n# cracked[index] = True\r\n# information += 1\r\n# last_a = index\r\n# index += movement\r\n# if index == -1 or index == n:\r\n# movement *= -1\r\n# # index += movement\r\n# index = last_a\r\n# if not all(cracked):\r\n# direction_change += 1\r\n# print(direction_change)\r\n", "n = int(input())\nA = [ int(a) for a in input().split() ]\nchanges = 0\ndirection = 1\nx = n\ninf = 0\nlocation = -1\nwhile x > 0:\n if direction == 1:\n for i in range(location+1, n):\n if A[i] <= inf:\n A[i] = n\n inf += 1\n x -= 1\n location = i\n direction = 0\n elif direction == 0:\n for i in range(location-1, -1, -1):\n if A[i] <= inf:\n A[i] = n\n inf += 1\n x -= 1\n location = i\n direction = 1\n changes += 1\nprint(changes-1)", "n = int(input())\na = list(map(int,input().split()))\ndirect = 1\npos = 0\nnow = 0\nres = 0\nchecked = [0] * n\r\ncount = 0\nwhile now < n:\r\n if count < 10:\r\n #print(checked)\r\n count += 1\n if direct == 1:\n good = 0\n for i in range(pos, n):\n if checked[i]: continue\n if a[i] <= now: \n checked[i] = 1\n now += 1\n pos = i\n good = 1\n break\n if not good:\n res += 1\n direct = 0\n \n if now == n:\r\n break\n if count < 10:\r\n #print(now, direct)\n count += 1\n if direct == 0:\n good = 0\n for i in range(pos-1, -1, -1):\n if checked[i]: continue\n if a[i] <= now: \n checked[i] = 1\n now += 1\n pos = i\n good = 1\n break\n if not good:\n direct = 1\n res += 1\n \n \nprint(res)", "n = int(input())\nv = list(map(int, input().split()))\n\ncnt = 0\nrot = 0\nuse = {}\n\nwhile cnt < n:\n for i in range(n):\n if i not in use and cnt >= v[i]:\n cnt += 1\n use[i] = 1\n\n if cnt != n:\n rot += 1\n\n for i in reversed(range(n)):\n if i not in use and cnt >= v[i]:\n cnt += 1\n use[i] = 1\n\n if cnt != n:\n rot += 1\n\nprint(rot)\n", "n = int(input())\na = [int(x) for x in input().split()]\n\nk = 0\nt = -1\n\nwhile a:\n t += 1\n\n next_a = []\n for elem in a:\n if elem <= k:\n k += 1\n else:\n next_a.append(elem)\n\n next_a.reverse()\n a = next_a\n\nprint(t)", "n = int(input())\r\na = list(map(int, input().split()))\r\nused = [False] * n\r\nflag = True\r\ncur = 0\r\nans = 0\r\ni = 0\r\nwhile cur < n:\r\n ans += 1\r\n if (i == 0):\r\n for i in range(n):\r\n if (not used[i]) and (a[i] <= cur):\r\n cur += 1\r\n used[i] = True\r\n else:\r\n for i in range(n - 1, -1, -1):\r\n if (not used[i]) and (a[i] <= cur):\r\n cur += 1\r\n used[i] = True\r\nprint(ans - 1)\r\n \r\n", "import sys\r\n\r\n\r\ndef read_input(input_path=None):\r\n if input_path is None:\r\n f = sys.stdin\r\n else:\r\n f = open(input_path, 'r')\r\n\r\n n = int(f.readline())\r\n strengths = list(map(int, f.readline().split()))\r\n\r\n return n, strengths\r\n\r\n\r\ndef sol(n, strengths):\r\n res = 0\r\n\r\n if n > 1:\r\n total = 0\r\n res = -1\r\n idx = 0\r\n d = 'r'\r\n while total <= n - 1:\r\n if strengths[idx] != -1 and strengths[idx] <= total:\r\n total += 1\r\n strengths[idx] = -1\r\n\r\n if total == n:\r\n break\r\n\r\n if idx == n - 1:\r\n d = 'l'\r\n res += 1\r\n elif idx == 0:\r\n d = 'r'\r\n res += 1\r\n\r\n if d == 'l':\r\n idx -= 1\r\n elif d == 'r':\r\n idx += 1\r\n\r\n return [f\"{res}\"]\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", "fu = input()\r\n\r\ns = input().split(\" \")\r\nvet = []\r\n\r\nfor i in s:\r\n vet.append(int(i))\r\n \r\nresp = 0\r\natual = 0\r\n\r\nwhile True:\r\n l = []\r\n \r\n for i in vet:\r\n if i <= atual:\r\n atual += 1\r\n else:\r\n l.append(i)\r\n \r\n if len(l) == 0:\r\n break\r\n\r\n vet = reversed(l)\r\n resp += 1\r\n \r\nprint(resp)", "#!/usr/bin/env python3\n# -*- coding: utf-8 -*-\n\nimport time\n\nn = int(input())\nA = [int(i) for i in input().split()]\n\nstart = time.time()\n\nt = 0\nnow = 0\nans = -1\n\nwhile(t < n):\n ans += 1\n for i in range(n):\n if A[i] >= 0 and A[i] <= t:\n t += 1\n A[i] = -1\n if (t == n):\n break\n ans += 1\n for i in range(n):\n if A[n-1-i]>= 0 and A[n-1-i] <= t:\n t += 1\n A[n-1-i] = -1\n\nprint(ans)\nfinish = time.time()\n#print(finish - start)\n", "from sys import stdin\r\nfrom collections import defaultdict\r\n\r\nn= int(stdin.readline())\r\narr = list(map(int, stdin.readline().rstrip().split(\" \")))\r\nd = defaultdict(lambda : False)\r\n# prefixMin1 = [0] * (n + 1)\r\n# prefixMin2 = [0] * (n + 1)\r\n# mini1 = 1001\r\n# mini2 = 1001\r\n# for i in range(len(arr)):\r\n# if arr[i] < mini1:\r\n# prefixMin1[i + 1] = arr[i]\r\n# mini1 = arr[i]\r\n# else:\r\n# prefixMin1[i + 1] = mini1\r\n# if arr[n - i - 1] < mini2:\r\n# prefixMin2[n - i] = arr[n - i - 1]\r\n# mini2 = arr[i]\r\n\r\nturns = 0\r\ntaken = 0\r\ni = 0\r\n\r\nwhile taken != n:\r\n if turns % 2 == 0:\r\n i = 0\r\n while i < n:\r\n if arr[i] <= taken and not d[i]:\r\n taken += 1\r\n d[i] = True\r\n i += 1\r\n else:\r\n i = n - 1\r\n while i >= 0:\r\n if arr[i] <= taken and not d[i]:\r\n taken += 1\r\n d[i] = True\r\n i -= 1\r\n turns += 1\r\n\r\nprint(turns - 1)\r\n\r\n", "n=int(input())\r\nlists=[int(i)for i in input().split()]\r\ndi=1#direct\r\nnum=0#pieces of information\r\nloc=1#location\r\ntotal=0\r\nif lists[0]==0:\r\n num+=1\r\n lists[0]=n+1\r\nwhile num<n:\r\n num1=num\r\n if loc==n and di==1 or loc==1 and di==-1:\r\n di*=-1\r\n total+=1\r\n if di==1 :\r\n for i in range(loc,n):\r\n if num>=lists[i]:\r\n loc=i+1\r\n lists[i]=n+1\r\n num+=1\r\n break\r\n else:\r\n for i in range(n+2-loc,n+1):\r\n if num>=lists[-i]:\r\n loc=n-i+1\r\n lists[-i]=n+1\r\n num+=1\r\n break\r\n if num1==num:\r\n di*=-1\r\n total+=1\r\nprint(total)\r\n", "def changes(n, cpus):\n c = 0\n k = 0\n s = 0\n e = n\n f = True\n # log(f'k={k}, s={s}, e={e}, A={cpus}')\n while k < n:\n c += 1\n if f:\n j = s\n for i in range(s, e):\n if cpus[i] <= k:\n k += 1\n else:\n cpus[j] = cpus[i]\n j += 1\n e = j\n else:\n j = e\n for i in reversed(range(s, e)):\n if cpus[i] <= k:\n k += 1\n else:\n j -= 1\n cpus[j] = cpus[i]\n s = j\n f = not f\n # log(f'k={k}, s={s}, e={e}, A={cpus[s:e]}')\n return c-1\n\n\ndef main():\n n = int(input())\n cpus = list(map(int, input().split()))\n assert len(cpus) == n\n print(changes(n, cpus))\n\n##########\n\nimport sys\nimport time\nimport traceback\nfrom contextlib import contextmanager\nfrom io import StringIO\n\n\ndef log(*args, **kwargs):\n print(*args, **kwargs, file=sys.stderr)\n\n\n@contextmanager\ndef patchio(i):\n try:\n sys.stdin = StringIO(i)\n sys.stdout = StringIO()\n yield sys.stdout\n finally:\n sys.stdin = sys.__stdin__\n sys.stdout = sys.__stdout__\n\n\ndef do_test(k, test):\n try:\n log(f\"TEST {k}\")\n i, o = test\n with patchio(i) as r:\n t0 = time.time()\n main()\n t1 = time.time()\n if r.getvalue() == o:\n log(f\"OK ({int((t1-t0)*1000000)/1000:0.3f} ms)\\n\")\n else:\n log(f\"Expected:\\n{o}\"\n f\"Got ({int((t1-t0)*1000000)/1000:0.3f} ms):\\n{r.getvalue()}\")\n except Exception:\n traceback.print_exc()\n log()\n\n\ndef test(ts):\n for k in ts or range(len(tests)):\n do_test(k, tests[k])\n\n\ntests = [(\"\"\"\\\n3\n0 2 0\n\"\"\", \"\"\"\\\n1\n\"\"\"), (\"\"\"\\\n5\n4 2 3 0 1\n\"\"\", \"\"\"\\\n3\n\"\"\"), (\"\"\"\\\n7\n0 3 1 0 5 2 6\n\"\"\", \"\"\"\\\n2\n\"\"\")]\n\n\nif __name__ == '__main__':\n from argparse import ArgumentParser\n parser = ArgumentParser()\n parser.add_argument('--test', '-t', type=int, nargs='*')\n args = parser.parse_args()\n main() if args.test is None else test(args.test)\n", "from math import inf\nn = int(input().strip())\narr = list(map(int, input().strip().split()))\npoints = 0\ndr = 1\nchanges = 0\nwhile True:\n\tif dr == 1:\n\t\tfor i in range(n):\n\t\t\tif arr[i] <= points:\n\t\t\t\tpoints += 1\n\t\t\t\tarr[i] = inf\n\t\tdr = -1\n\telse:\n\t\tfor i in range(n-1, -1, -1):\n\t\t\tif arr[i] <= points:\n\t\t\t\tpoints += 1\n\t\t\t\tarr[i] = inf\n\t\tdr = 1\n\tif any(i != inf for i in arr):\n\t\tchanges += 1\n\telse:\n\t\texit(print(changes))", "i = int(input())\r\nl = list(map(int,input().split()))\r\nc= 0\r\nans = 0\r\nwhile True:\r\n tem = []\r\n for x in l:\r\n if x <= c: c +=1\r\n else: tem.append(x)\r\n if len(tem) == 0: break\r\n else: ans +=1\r\n l = list(reversed(tem))\r\nprint(ans)", "n = int(input())\r\nl = list(map(int,input().split()))\r\ninfo = 0\r\nnum = 0\r\nans = -1\r\nwhile num != n:\r\n ans += 1\r\n for i in range(n):\r\n if l[i]>=0 and l[i]<=info:\r\n l[i] = -1\r\n info += 1\r\n num += 1\r\n l=l[::-1]\r\nprint(ans)", "n=int(input())\na=list(map(int,input().split()))\ns=0\nr=0\ni=0\nk=1\nf=0\nwhile s!=n:\n\tif a[i]<=s:\n\t\ts+=1\n\t\ta[i]=9999\n\tif (s!=n)and((i==n-1)or((i==0)and(f))):\n\t\tr+=1\n\t\tk*=-1\n\t\tf=1\n\ti+=k\nprint(r)\n", "#RAVENS\n#TEAM_2\n#ESSI-DAYI_MOHSEN-LORENZO\nimport sys\ninput=sys.stdin.readline\nn = int(input())\na = list(map(int,input().split()))\nPower = 0\nres = -1\nE = [0]*n\nwhile Power != n:\n res+=1\n for i in range(n):\n if E[i] == 0 and Power >= a[i]:\n Power+=1\n E[i] = 1\n \n if Power != n:\n res+=1\n for i in range(n-1,-1,-1):\n if E[i] == 0 and Power >= a[i]:\n Power+=1\n E[i] = 1\nprint(res)", "n = int(input())\r\na = list(map(int, input().split()))\r\nturn = -1\r\ncurrent = 0\r\nwhile(current < n):\r\n turn += 1\r\n for i in range(n):\r\n if(a[i] >= 0 and a[i] <= current):\r\n a[i] = -1\r\n current += 1\r\n a.reverse()\r\nprint(turn)", "n=int(input())\r\na=list(map(int,input().split()))\r\ninfo=0; i=0; di=0\r\nwhile 1:\r\n for i in range(n):\r\n if a[i]==-69: continue\r\n if a[i]<=info:\r\n info+=1\r\n a[i]=-69\r\n if info==n: break\r\n a.reverse()\r\n di+=1\r\nprint(di)", "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\narr = int_arr()\r\n\r\nct = 0\r\ncond = 0\r\ntot = -1\r\nwhile True:\r\n if len(set(arr)) == 1 and arr[0] == -1:\r\n break\r\n if cond % 2 == 0:\r\n cond = 1\r\n tot += 1\r\n for i in range(n):\r\n if arr[i] != -1 and arr[i] <= ct:\r\n ct += 1\r\n arr[i] = -1\r\n last = i\r\n else:\r\n cond = 2\r\n tot += 1\r\n for i in range(last,-1,-1):\r\n if arr[i] != -1 and arr[i] <= ct:\r\n ct += 1\r\n arr[i] = -1\r\nprint(tot)\r\n\r\n", "n = int(input())\r\narr = list(map(int, input().split()))\r\ncnt = 0\r\nturns = 0\r\nused = [False for i in range(n)]\r\nwhile cnt < n:\r\n for i in range(n):\r\n if arr[i] <= cnt and not used[i]:\r\n used[i] = True\r\n cnt += 1\r\n if cnt == n:\r\n break\r\n turns += 1\r\n for i in range(n - 1, -1, -1):\r\n if arr[i] <= cnt and not used[i]:\r\n used[i] = True\r\n cnt += 1\r\n if cnt == n:\r\n break\r\n turns += 1\r\nprint(turns)\r\n", "n=int(input())\r\nb= list(map(int, input().split()))\r\n#a=sorted(b)\r\ne=ans=0\r\nwhile True:\r\n temp=[]\r\n ans+=1\r\n for i in range(len(b)):\r\n if e>=b[i]:e+=1\r\n else:temp.append(b[i])\r\n temp.reverse()\r\n b=temp\r\n if len(temp)==0:break\r\nprint(ans-1)\r\n \r\n", "n = int(input())\r\nc = [int(x) for x in input().split(' ')]\r\nd = 1\r\ncount = 0\r\nturns = 0\r\n\r\nwhile count < n:\r\n rng = range(len(c))\r\n if d == -1:\r\n rng = range(len(c) - 1, -1, -1)\r\n for indx in rng:\r\n item = c[indx]\r\n if item != -1 and item <= count:\r\n count += 1\r\n c[indx] = -1\r\n d = d * -1\r\n if count < n:\r\n turns += 1\r\n\r\nprint(turns)", "n = int(input())\r\na = list(map(int,input().split()))\r\nq = 0\r\nc = 0\r\nwhile len(a) > 0:\r\n de = set()\r\n for i in range(len(a)):\r\n if a[i] <= q:\r\n q += 1\r\n de.add(i)\r\n c += 1\r\n a = [a[i] for i in reversed(range(len(a))) if i not in de]\r\nprint(c-1)", "a,nums,solved,direct,turns=input(),list(map(int,input().split())),0,1,0\r\nwhile len(nums)!=0:\r\n if direct==1:\r\n removes=[]\r\n for i in range(len(nums)):\r\n if nums[i]<=solved:\r\n solved+=1\r\n removes.append(i)\r\n for i in removes[::-1]:\r\n nums.pop(i)\r\n direct=-1;turns+=1\r\n else:\r\n removes=[]\r\n for i in range(len(nums)-1,-1,-1):\r\n if nums[i]<=solved:\r\n solved+=1\r\n removes.append(i)\r\n for i in removes:\r\n nums.pop(i)\r\n direct=1;turns+=1\r\nprint(turns-1)", "n = int(input())\r\na = list(map(int, input().split()))\r\nvisit = [0] * (n)\r\ndata = 0\r\nroute = 'r'\r\ncoordinate = 0\r\nans = 0\r\nwhile data != n:\r\n if route == 'r':\r\n for i in range(coordinate, n):\r\n if a[i] <= data and not visit[i]:\r\n data += 1\r\n visit[i] = 1\r\n if data != n:\r\n coordinate = n - 1\r\n route = 'l'\r\n ans += 1\r\n else:\r\n for i in range(coordinate, -1, -1):\r\n if a[i] <= data and not visit[i]:\r\n data += 1\r\n visit[i] = 1\r\n if data != n:\r\n coordinate = 0\r\n route = 'r'\r\n ans += 1\r\nprint(ans)", "n=int(input())\r\na=[int(i) for i in input().split()]\r\nt=0\r\nii=0\r\nh=0\r\nwhile t!=n:\r\n for i in range(n):\r\n if a[i]<=ii and a[i]!=-1:\r\n t+=1\r\n ii+=1\r\n a[i]=-1\r\n if t!=n:\r\n h+=1\r\n for i in range(n-1,-1,-1):\r\n if a[i]!=-1:\r\n if ii>=a[i]:\r\n t+=1\r\n ii+=1\r\n a[i]=-1\r\n if t!=n:\r\n h+=1\r\nprint(h)\r\n", "n, A = int(input()), list(enumerate(map(int, input().split())))\r\nB, pieces, turns = A[::-1], set(), 0\r\n\r\nwhile True:\r\n for i, a in A:\r\n if a <= len(pieces):\r\n pieces.add(i)\r\n \r\n if len(pieces) == n:\r\n break\r\n turns += 1\r\n \r\n for i, a in B:\r\n if a <= len(pieces):\r\n pieces.add(i)\r\n \r\n if len(pieces) == n:\r\n break\r\n turns += 1\r\n\r\nprint(turns)" ]

[ "import sys\r\nfrom collections import *\r\nfrom itertools import *\r\nfrom math import *\r\nfrom array import *\r\nfrom functools import lru_cache\r\nimport heapq\r\nimport bisect\r\nimport random\r\nimport io, os\r\nfrom bisect import *\r\n\r\nif sys.hexversion == 50924784:\r\n sys.stdin = open('cfinput.txt')\r\n\r\n# input = sys.stdin.readline\r\n# input_int = sys.stdin.buffer.readline\r\n# RI = lambda: map(int, input_int().split())\r\n# RS = lambda: input().strip().split()\r\n# RILST = lambda: list(RI())\r\n\r\n# RI = lambda: map(int, sys.stdin.buffer.readline().split())\r\n# RS = lambda: sys.stdin.readline().strip().split()\r\n# RILST = lambda: list(RI())\r\n\r\n# input = sys.stdin.buffer.readline\r\n# RI = lambda: map(int, input().split())\r\n# RS = lambda: map(bytes.decode, input().strip().split())\r\n# RILST = lambda: list(RI())\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\n\r\nMOD = 10 ** 9 + 7\r\n\"\"\"https://codeforces.com/problemset/problem/38/E\r\n\r\n输入 n(≤3000)，表示在一维数轴上有 n 颗大小忽略不计的弹珠。\r\n然后输入 n 对数字，每对数字表示这颗弹珠在数轴上的位置 xi，以及把这颗弹珠固定在 xi 上的花费 ci，数据范围均在 [-1e9,1e9] 之间，且 xi 互不相同。注意 ci 可以为负。\r\n\r\n选择若干弹珠固定后，所有未固定的弹珠向左滚动，直到碰到固定住的弹珠。\r\n总花费 = 固定弹珠的花费之和 + 所有未固定的弹珠的滚动距离之和。\r\n输出总花费的最小值。\r\n注：根据题意，最左边的弹珠一定要固定。\r\n输入\r\n3\r\n2 3\r\n3 4\r\n1 2\r\n输出 5\r\n\r\n输入\r\n4\r\n1 7\r\n3 1\r\n5 10\r\n6 1\r\n输出 11\r\n\"\"\"\r\n\r\n\r\n# \t ms\r\ndef solve(n, ac):\r\n ac.sort()\r\n # print(ac)\r\n f = [[inf, inf] for _ in range(n)] # 第i个球固定或不固定\r\n f[0][1] = ac[0][1]\r\n for i in range(1, n):\r\n f[i][1] = ac[i][1] + min(f[i - 1])\r\n s = ac[i][0] # 如果撞到j停下，那么值为(i-j)+(i-1-j)+...(j+1-j)=sum(j+1..i)-len(j+1..i)*j,用s累计被减数\r\n for j in range(i - 1, -1, -1):\r\n f[i][0] = min(f[i][0], s - ac[j][0] * (i - j) + f[j][1])\r\n s += ac[j][0]\r\n\r\n print(min(f[-1]))\r\n\r\n\r\nif __name__ == '__main__':\r\n n, = RI()\r\n ac = []\r\n for _ in range(n):\r\n ac.append(RILST())\r\n\r\n solve(n, ac)\r\n", "import sys\r\ninput = sys.stdin.readline\r\nfrom operator import itemgetter\r\n\r\n\r\nn=int(input())\r\nM=[tuple(map(int,input().split())) for i in range(n)]\r\n\r\nM.sort(key=itemgetter(0))\r\n\r\nDP=[1<<60]*n\r\nDP[0]=M[0][1]\r\n\r\nfor i in range(1,n):\r\n x,c=M[i]\r\n\r\n MIN=1<<60\r\n\r\n for j in range(i):\r\n MIN=min(MIN,DP[j])\r\n\r\n DP[j]+=abs(x-M[j][0])\r\n\r\n DP[i]=MIN+c\r\n\r\nprint(min(DP))\r\n", "n = int(input())\r\ns = []\r\nfor _ in range(n):\r\n x, y = map(int, input().split())\r\n s.append([x, y])\r\ns.sort()\r\npre = [0]\r\nfor i in range(n):\r\n pre.append(s[i][0] + pre[-1])\r\ndp = [[float(\"inf\"), float(\"inf\")] for j in range(n)]\r\ndp[0] = [float(\"inf\"), s[0][1]]\r\nfor i in range(1, n):\r\n for j in range(i):\r\n dp[i][0] = min(dp[j][1] + (pre[i + 1] - pre[j + 1]) - (i - j) * s[j][0], dp[i][0])\r\n dp[i][1] = min(dp[i - 1]) + s[i][1]\r\nprint(min(dp[-1]))", "n = int(input())\r\nf = [[] for i in range(n)]\r\n\r\nfor i in range(n):\r\n x, c = map(int, input().split())\r\n f[i] = [x, c]\r\n\r\nf.sort()\r\n\r\ndp = [[], []]\r\ndp[1] = [f[0][1] for i in range(n)]\r\ndp[0] = [10 ** 21 for i in range(n)]\r\n\r\nfor i in range(1, n):\r\n dp[1][i] = min(dp[0][i - 1], dp[1][i - 1]) + f[i][1]\r\n d = 0\r\n for j in range(i - 1, -1, -1):\r\n d += (f[j + 1][0] - f[j][0]) * (i - j)\r\n dp[0][i] = min(dp[0][i], dp[1][j] + d)\r\n\r\nprint(min(dp[0][-1], dp[1][-1]))\r\n", "n = int(input())\r\narr = []\r\nfor i in range(n):\r\n\tp, c = map(int, input().split())\r\n\tarr += [[p, c]]\r\n\r\narr.sort()\r\n\r\n\r\ndp = [[10**100, 10**100] for i in range(n)]\r\n\r\ndp[0][0] = 10**100\r\ndp[0][1] = arr[0][1]\r\n\r\nfor i in range(1, n):\r\n\tdp[i][1] = min(dp[i-1]) + arr[i][1]\r\n\ttot = arr[i][0]\r\n\tcount = 1\r\n\tfor j in range(i-1, -1, -1):\r\n\t\ttemp = dp[j][1] + tot - count*arr[j][0]\r\n\t\tdp[i][0] = min(dp[i][0], temp)\r\n\t\ttot += arr[j][0]\r\n\t\tcount += 1\r\nprint(min(dp[-1]))", "import sys\r\nread=lambda:map(int,sys.stdin.readline().split())\r\nn,=read()\r\ncost=sorted([[*read()] for _ in range(n)])\r\ndp=[0xFFFF0024]*n\r\ndp[0]=cost[0][1]\r\nfor i in range(1,n):\r\n cur=0xFFFF0024\r\n for j in range(i):\r\n if dp[j]<cur:cur=dp[j]\r\n dp[j]+=cost[i][0]-cost[j][0]\r\n dp[i]=cur+cost[i][1]\r\nprint(min(dp))", "from typing import Tuple, List\n\ndef compute(n: int, m: List[Tuple[int, int]]) -> int:\n m = sorted(m)\n\n state = [0] * (n + 1)\n state[n - 1] = m[n - 1][1]\n for i in range(n - 2, -1, -1):\n min_cost = state[i + 1]\n acc = 0\n for j in range(i + 2, n + 1):\n min_cost = min(min_cost, state[j] + abs(m[i][0] - m [j - 1][0]) + acc)\n acc += abs(m[i][0] - m [j - 1][0])\n state[i] = min_cost + m[i][1]\n return state[0]\n\nif __name__ == '__main__':\n N = int(input())\n M = [input().split() for _ in range(N)]\n M = [(int(x), int(c)) for x, c in M]\n print(compute(N, M))\n", "n = int(input())\r\na = []\r\n\r\nfor i in range(n) :\r\n a.append(tuple(map(int, input().split())))\r\n \r\na.sort()\r\n\r\ndp = [10 ** 18] * (n+1)\r\ndp[0] = 0\r\nfor i in range(n) :\r\n s = 0\r\n for j in range(i, n) :\r\n s += a[j][0]\r\n dp[j+1] = min(dp[j+1], s - (j-i+1) * a[i][0] + a[i][1] + dp[i])\r\nprint(dp[n])", "R,G=lambda:map(int,input().split()),range;n,=R()\r\na=sorted([[*R()]for _ in G(n)]);a+=[[a[-1][0]+1,0]]\r\nz=[a[0][1]]+[float('inf')]*n\r\nfor i in G(n+1):\r\n acc=0\r\n for j in G(i+1,n+1):\r\n z[j]=min(z[j],z[i]+acc+a[j][1])\r\n acc+=a[j][0]-a[i][0]\r\nprint(z[-1])" ]

[ "def contains(cont: list, temp: str) -> bool:\r\n for i in range(4):\r\n if temp in cont:\r\n return True\r\n temp = f'{temp[2]}{temp[0]}{temp[3]}{temp[1]}'\r\n return False\r\n\r\n\r\nn = int(input())\r\ncont = []\r\nfor i in range(n):\r\n temp = input() + input()\r\n if not contains(cont, temp):\r\n cont.append(temp)\r\n if i < n - 1:\r\n input()\r\n\r\nprint(len(cont))\r\n", "n = int(input())\r\n#n = input()\r\n#m = input(); m = m.split()\r\n#n = [int(x) for x in n]\r\n#m = [int(x) for x in m]\r\na = []\r\nfor i in range(n):\r\n c = input()\r\n b = input()\r\n if i < n-1: s = input()\r\n c = c + b[1] + b[0]\r\n\r\n f = True\r\n for j in a:\r\n if c in j:\r\n f = False\r\n break\r\n if f:\r\n c = c + c[:3]\r\n a.append(c)\r\n\r\n\r\nprint(len(a))", "def containsElement(cont: list, item: str) -> bool:\r\n for i in range(4):\r\n if item in cont:\r\n return True\r\n item = f'{item[2]}{item[0]}{item[3]}{item[1]}'\r\n return False\r\n\r\n\r\nn = int(input())\r\ncont = []\r\n\r\nfor i in range(n):\r\n item = input() + input()\r\n\r\n if not containsElement(cont, item):\r\n cont.append(item)\r\n\r\n if i < n - 1:\r\n input()\r\n\r\nprint(len(cont))\r\n", "def solve(a):\r\n\r\n def r90(s):\r\n return s[2] + s[0] + s[3] + s[1]\r\n\r\n def r180(s):\r\n return s[::-1]\r\n\r\n def r270(s):\r\n return s[1] + s[3] + s[0] + s[2]\r\n\r\n stacks = set()\r\n for s in a:\r\n if s in stacks or r90(s) in stacks or r180(s) in stacks or r270(\r\n s) in stacks:\r\n continue\r\n stacks.add(s)\r\n return len(stacks)\r\n\r\n\r\nn = int(input())\r\na = []\r\nfor i in range(n):\r\n a.append(input() + input())\r\n if i != n - 1:\r\n input()\r\nprint(solve(a))", "def Contains(myList, helper):\r\n for i in range(4):\r\n if helper in myList:\r\n return True\r\n helper = '{}{}{}{}'.format(helper[2], helper[0], helper[3], helper[1])\r\n return False\r\n\r\n\r\nn = int(input())\r\nmyList = []\r\nhelper = \"\"\r\nwhile n > 0:\r\n helper = input() + input()\r\n if not Contains(myList, helper):\r\n myList.append(helper)\r\n helper = \"\"\r\n if n > 1:\r\n input()\r\n n -= 1\r\nprint(len(myList))\r\n", "'''\r\n12\r\n34\r\n\r\n'1234' -> '3142'\r\n'''\r\n\r\n\r\ndef rotate(line: str) -> str:\r\n # return f'{}{}{}{}'\r\n return '{}{}{}{}'.format(line[2], line[0], line[3], line[1])\r\n\r\n\r\ndef equals(it1: str, it2: str) -> bool:\r\n for i in range(4):\r\n if it1 == it2:\r\n return True\r\n it1 = rotate(it1)\r\n return False\r\n\r\n\r\ndef contains(cont: list, element: str) -> bool:\r\n ln = len(cont)\r\n for item in cont:\r\n if equals(element, item):\r\n return True\r\n return False\r\n\r\n\r\nn, cont, temp = int(input()), [], ''\r\n\r\nfor i in range(1, n * 3):\r\n if i % 3 == 0:\r\n input()\r\n elif i % 3 == 1:\r\n temp += input()\r\n else:\r\n temp += input()\r\n if not contains(cont, temp):\r\n cont.append(temp)\r\n temp = ''\r\n\r\nprint(len(cont))\r\n\r\n'''\r\n4\r\n51\r\n26\r\n**\r\n54\r\n35\r\n**\r\n25\r\n61\r\n**\r\n45\r\n53\r\n\r\n'''\r\n", "n = int(input())\ndominos = set()\nfor r in range(n):\n if r != 0:\n input()\n domino = list(map(int, list(input().strip())))\n domino += reversed(list(map(int, list(input().strip()))))\n numbers = []\n for i in range(4):\n numbers.append(domino[0] * 1000 + domino[1] * 100 + domino[2] * 10 +\n domino[3])\n domino = domino[1:] + domino[0:1]\n #print(numbers)\n dominos.add(min(numbers))\n#print(dominos)\nprint(len(dominos))\n", "# def isPile(first, second, third, fourth):\r\n# helper1 = first\r\n# helper2 = second\r\n# helper3 = third\r\n# helper4 = fourth\r\n#\r\n# first = second\r\n# second = fourth\r\n# third = helper1\r\n# fourth = helper3\r\n#\r\n# if first == helper1 and second == helper2 and third == helper3 and fourth == helper4:\r\n# return True\r\n#\r\n# return False\r\n#\r\n# def rotate(first, second, third, fourth):\r\n# helper1 = first\r\n# helper3 = third\r\n#\r\n# first = second\r\n# second = fourth\r\n# third = helper1\r\n# fourth = helper3\r\n#\r\n#\r\n# n = int(input())\r\n# ans, helper = 0, 0\r\n# for i in range(n):\r\n# line1, line2 = input(), input()\r\n# first = line1[0]\r\n# second = line1[1]\r\n# third = line2[0]\r\n# fourth = line2[1]\r\n#\r\n# if isPile(first, second, third, fourth):\r\n# helper += 1\r\n#\r\n# rotate(first, second, third, fourth)\r\n#\r\n# if isPile(first, second, third, fourth):\r\n# helper += 1\r\n#\r\n# rotate(first, second, third, fourth)\r\n#\r\n# if isPile(first, second, third, fourth):\r\n# helper += 1\r\n#\r\n# if helper > 0:\r\n# ans += 1\r\n#\r\n# if i != n - 1:\r\n# c = input()\r\n#\r\n# print(ans)\r\n\r\ndef contains(cont, line):\r\n for i in range(4):\r\n if line in cont:\r\n return True\r\n line = f'{line[2]}{line[0]}{line[3]}{line[1]}'\r\n return False\r\n\r\n\r\nn = int(input())\r\ncont = []\r\n\r\nfor i in range(n):\r\n line = input() + input()\r\n if not contains(cont, line):\r\n cont.append(line)\r\n if i < n - 1:\r\n input()\r\n\r\nprint(len(cont))\r\n\r\n'''\r\n4\r\n31\r\n23\r\n**\r\n31\r\n23\r\n**\r\n13\r\n32\r\n**\r\n32\r\n13\r\n\r\n\r\n12 31 43 24 \r\n34 42 21 13\r\n\r\n'1234' => '3142' => '4321' => '2413'\r\n\r\n f'{line[2]}{line[0]}{line[3]}{line[1}'\r\n\r\n'''\r\n", "d=dict();o=int(input())\r\nfor t in range(o):\r\n x,y=input().replace('',' ').split()\r\n i,j=input().replace('',' ').split()\r\n if t!=o-1:input()\r\n if not((x,y,i,j) in d or (y,j,x,i) in d or (j,i,y,x) in d or (i,x,j,y) in d):d[(x,y,i,j)]=1\r\nprint(len(d))", "n=int(input())\r\na=[]\r\nfor i in range(n):\r\n s=input()\r\n s+=input()[::-1]\r\n if i!=n-1:input()\r\n add=True\r\n for x in a:\r\n if s in x:\r\n add=False\r\n break\r\n if add: a.append(s+s)\r\nprint(len(a))\r\n \r\n \r\n", "n = int(input())\r\n\r\nl = set()\r\ntry:\r\n for i in range(n):\r\n s = input() + input()[::-1]\r\n x = sorted([s, s[1:] + s[:1], s[2:] + s[:2], s[3:] + s[:3]])\r\n l.add(x[0])\r\n y = list(input())\r\nexcept:\r\n pass\r\n\r\nprint(len(l))\r\n\r\n ", "def find(u):\r\n if dsu[u] == u:\r\n return u\r\n else:\r\n dsu[u] = find(dsu[u])\r\n return dsu[u]\r\n\r\n\r\ndef rotate(z):\r\n z[0][0], z[0][1], z[1][1], z[1][0] = z[0][1], z[1][1], z[1][0], z[0][0]\r\n\r\n\r\ndef eq(a, b):\r\n for i in range(2):\r\n for j in range(2):\r\n if a[i][j] != b[i][j]:\r\n return False\r\n return True\r\n\r\n\r\nn = int(input())\r\ndsu = list(range(n))\r\na = []\r\nfor i in range(n):\r\n a.append([list(input()) for _ in range(2)])\r\n if i != n - 1:\r\n input()\r\nfor i in range(n):\r\n for j in range(i + 1, n):\r\n for _ in range(4):\r\n rotate(a[i])\r\n if eq(a[i], a[j]):\r\n dsu[find(i)] = find(j)\r\nfor i in range(n):\r\n find(i)\r\nprint(len(set(dsu)))\r\n", "# A brute force implmentation\r\ndef rotateRight():\r\n global Cheaterius; global piles\r\n Cheaterius = Cheaterius[2]+Cheaterius[0]+Cheaterius[3]+Cheaterius[1]\r\n return Cheaterius if Cheaterius in piles.keys() else False\r\ndef rotateLeft():\r\n global Cheaterius; global piles\r\n Cheaterius = Cheaterius[1]+Cheaterius[3]+Cheaterius[0]+Cheaterius[2]\r\n return Cheaterius if Cheaterius in piles.keys() else False\r\n\r\nnum = int(input())\r\npiles = {}\r\nhead,tail,discard = input(),input(),input()\r\npiles.update({head+tail:1})\r\nfor i in range(1,num):\r\n head,tail = input(),input()\r\n if i != num-1:\r\n discard = input()\r\n Cheaterius = head+tail; changeSides = False\r\n if Cheaterius in piles.keys():\r\n continue\r\n else:\r\n for j in range(6):\r\n if j == 3:\r\n changeSides = True\r\n if not changeSides:\r\n result = rotateRight()\r\n if result:\r\n break\r\n else:\r\n result = rotateLeft()\r\n if result:\r\n break\r\n if Cheaterius == head+tail:\r\n piles.update({Cheaterius:1})\r\nprint (len(piles))", "n, s = int(input()), {input() + input()}\nfor i in range(n - 1):\n d, c, u = input(), input() + input(), True\n for j in range(4):\n if c in s:\n u = False\n c = c[2] + c[0] + c[3] + c[1]\n if u:\n s.add(c)\nprint(len(s))\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\nw = dict()\r\nfor i in range(n):\r\n s = input()[:-1] + input()[:-1]\r\n if i != n-1:\r\n input()\r\n for _ in range(4):\r\n s = s[2] + s[0] + s[3] + s[1]\r\n if s in w:\r\n w[s] += 1\r\n break\r\n else:\r\n w[s] = 1\r\nprint(len(w))", "\ni,ans=set(),0\nn=int(input())\nfor _ in range(n):\n a,b=input(),input()\n if _<n-1:input()\n cur=(a[0],a[1],b[1],b[0])\n for j in range(4):\n if cur in i:\n break\n cur=list(cur)\n cur=tuple([cur.pop()]+cur)\n else:\n i.add((cur))\n ans+=1\nprint(ans)\n\n\n", "def containsElement(cont: list, element: str) -> bool:\r\n for i in range(4):\r\n if element in cont:\r\n return True\r\n element = f'{element[2]}{element[0]}{element[3]}{element[1]}'\r\n return False\r\n\r\n\r\nn = int(input())\r\ncont = []\r\n\r\nfor i in range(n):\r\n helper = input() + input()\r\n # print(f'helper = {helper}')\r\n if not containsElement(cont, helper):\r\n cont.append(helper)\r\n if i < n - 1:\r\n input()\r\n\r\nprint(len(cont))\r\n\r\n'''\r\n12 31\r\n34 42\r\n\r\n 0123 0123\r\n'1234' -> '3142'\r\n\r\n4\r\n31\r\n23\r\n**\r\n31\r\n23\r\n**\r\n13\r\n32\r\n**\r\n32\r\n13\r\n\r\n\r\n\r\n'''\r\n", "def rotate(matrix):\n t = ((matrix[1][0], matrix[0][0]),(matrix[1][1], matrix[0][1]))\n return t\nn = int(input())\ns = set()\nfor _ in range(n):\n l = int(input())\n l1 = (int(l/10), l%10)\n \n l = int(input())\n l2 = (int(l/10), l%10)\n \n if _!=n-1:\n l3 = input()\n l = (l1, l2)\n if l not in s :\n l = rotate(l)\n if l not in s:\n l = rotate(l)\n if l not in s :\n l = rotate(l)\n if l not in s:\n l = rotate(l)\n s.add(l)\nprint(len(s))\n\n \n \n", "n = int(input())\r\nd = {}\r\nfor i in range(n):\r\n s = ''\r\n found = False\r\n s = input() + input()\r\n if i != n - 1:\r\n input()\r\n t = s[2] + s[0] + s[3] + s[1]\r\n p = s[3] + s[2] + s[1] + s[0]\r\n q = s[1] + s[3] + s[0] + s[2]\r\n for key in d.keys():\r\n for var in d[key].keys():\r\n if s == var:\r\n found = True\r\n d[key][var] += 1\r\n if not found:\r\n d[s] = {}\r\n d[s][s] = 1\r\n d[s][t] = 0\r\n d[s][p] = 0\r\n d[s][q] = 0\r\nprint(len(d))", "import sys\r\nimport math\r\n#input=lambda:sys.stdin.readline().rstrip()\r\n#def solve():\r\n#\tn,x=map(int,input().split())\r\n#\tA=list(map(int,input().split()))\r\n#\tB=sorted(A)\r\n\t#print(\"YES\" if A[n-x:x]==B[n-x:x] else \"NO\")\r\n#T=int(input())\r\n#for i in range(T):\r\n#\tsolve()\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\ncontor=1\r\nmy_dict={}\r\n\r\nfor j in range(1,27):\r\n for i in range(1,27):\r\n if i!=j:\r\n element=alfabet_2[str(j)]+alfabet_2[str(i)]\r\n my_dict[element]=contor\r\n contor+=1\r\n \r\nz=int(input())\r\nfor i in range(1):\r\n #n=int(input())\r\n #stringul=input()\r\n #n,m,d=list(map(int,input().split()))\r\n my_set=set()\r\n v=[0]*4\r\n for i in range(1,3*z):\r\n #print(\"i=\",i)\r\n stringul=input()\r\n #print(stringul,i)\r\n \r\n if i%3==1:\r\n v[0]=int(stringul[0])\r\n v[1]=int(stringul[1])\r\n elif i%3==2:\r\n v[3]=int(stringul[0])\r\n v[2]=int(stringul[1])\r\n minimul=6666\r\n a=v[0]*(10**3)+v[1]*(10**2)+v[2]*10+v[3]\r\n b=v[1]*(10**3)+v[2]*(10**2)+v[3]*10+v[0]\r\n c =v[2]*(10**3)+v[3]*(10**2)+v[0]*10+v[1]\r\n d =v[3]*(10**3)+v[0]*(10**2)+v[1]*10+v[2]\r\n \r\n minimul=min(a,b,c,d)\r\n # print(i,minimul)\r\n \r\n if minimul not in my_set:\r\n my_set.add(minimul)\r\n \r\n# print(my_set)\r\n \r\n print(len(my_set)) \r\n \r\n", "def containsElement(cont: list, item:str):\r\n for i in range(4):\r\n if item in cont:\r\n return True\r\n item = f'{item[2]}{item[0]}{item[3]}{item[1]}'\r\n return False\r\n\r\nn = int(input())\r\ncont = []\r\n\r\nfor i in range(n):\r\n helper = input() + input()\r\n if not containsElement(cont,helper):\r\n cont.append(helper)\r\n\r\n if i < n - 1:\r\n input()\r\nprint(len(cont))", "# LUOGU_RID: 104229404\nn = int(input())\r\nst = set()\r\nfor i in range(n):\r\n s = input() + input()[::-1]\r\n if i < n - 1:\r\n input()\r\n if all(s not in x for x in st):\r\n st.add(2 * s)\r\nprint(len(st))\r\n", "import copy\ndef rotations(amulet):\n rots_ans = [amulet]\n a = [2, 0, 3, 1]\n b = [3, 2, 1, 0]\n c = [1, 3, 0, 2]\n rots_ans.append(rotation(amulet, a))\n rots_ans.append(rotation(amulet, b))\n rots_ans.append(rotation(amulet, c))\n return copy.deepcopy(rots_ans)\n\ndef rotation(amulet, x):\n rot_ans = []\n for i in x:\n rot_ans.append(amulet[i])\n return copy.deepcopy(rot_ans)\n\n\nn = int(input())\ninput_list = []\n\nfor i in range((n * 3) - 1):\n line = input()\n if not line == '**':\n input_list = input_list + [line[0]] + [line[1]] \n\namulets_list = []\n\nfor j in range(n):\n amulets_list.append([input_list[0], input_list[1], input_list[2], input_list[3]])\n for k in range(4):\n del input_list[0]\n\nanswer = 0\n\namulets_types = []\n\nfor i in amulets_list:\n if not i in amulets_types:\n answer += 1\n amulets_types = amulets_types + rotations(i)\n\nprint(answer)\n\n", "# deque is a faster version of list\r\nfrom collections import deque\r\n\r\ncount = int(input())\r\ncount = count * 2 + (count-1)\r\nclusters = {}\r\n# localize Global built-in functions\r\nstart = 65\r\nchrr = chr\r\nintt = int\r\nrng = range\r\nisfirst = True\r\ntmp_list = []\r\ndef check_eq(ls):\r\n found = False\r\n for k,v in clusters.items():\r\n if ls in v:\r\n found = True\r\n break\r\n return found \r\nfor _ in rng(count):\r\n name = chr(start)\r\n a, b = [x for x in list(input())]\r\n if a == '*':\r\n tmp_list = []\r\n isfirst = True\r\n start += 1\r\n continue\r\n a, b = int(a), int(b)\r\n #clusters[name][0].extend([a,b])\r\n if isfirst:\r\n tmp_list.extend([a,b])\r\n else:\r\n tmp_list.extend([b,a])\r\n if not isfirst:\r\n if check_eq(tmp_list):\r\n continue\r\n clusters[name] = []\r\n clusters[name].append(tmp_list)\r\n for i in range(1,4):\r\n tmp = [x for x in tmp_list]\r\n tmp = deque(tmp)\r\n tmp.rotate(-i)\r\n clusters[name].append(list(tmp))\r\n isfirst = False\r\n\r\nprint (len(clusters.keys()))\r\n", "I = input\r\n\r\nn = int(I())\r\nX = set()\r\n\r\nfor i in range(n):\r\n s = I() + I()[::-1]\r\n if i < n-1:\r\n I()\r\n if all(s not in x for x in X):\r\n X.add(2*s)\r\n\r\nprint(len(X))", "def rotated(w): return w[1:] + w[0]\r\n\r\nlst = [w.rstrip() for w in open(0).readlines()]\r\ns = set()\r\nfor i in range(int(lst[0])):\r\n one = lst[3*i+1]\r\n two = lst[3*i+2]\r\n w1 = one + two[1] + two[0]\r\n w2 = rotated(w1)\r\n w3 = rotated(w2)\r\n w4 = rotated(w3)\r\n s.add(min([w1,w2,w3,w4]))\r\nprint(len(s))", "n = int(input())\r\nk = []\r\ne = 1\r\na = 0\r\nfor i in range(n):\r\n r = input()\r\n s = input()\r\n s=s[1]+s[0]\r\n l= (r+s)\r\n for ii in k:\r\n #print(ii)\r\n if(l in ii):\r\n a = 0\r\n break\r\n else:\r\n a = 1\r\n continue\r\n if(a):\r\n e+=1\r\n k.append(l*2)\r\n if(i<n-1):\r\n input()\r\n#print(k)\r\nprint(e)\r\n", "def contains(arr,item):\r\n for i in range(4):\r\n if item in arr:\r\n return True\r\n item = f'{item[2]}{item[0]}{item[3]}{item[1]}'\r\n return False\r\n\r\n\r\n\r\nn = int(input())\r\narr = []\r\nfor i in range(n):\r\n helper = input() + input()\r\n if i < n - 1:\r\n input()\r\n if not contains(arr,helper):\r\n arr.append(helper)\r\n\r\nprint(len(arr))", "\r\nnro_amu = int(input())\r\n\r\namu = []\r\nfor i in range(nro_amu):\r\n fila1 = list(input())\r\n fila2 = list(input())\r\n fila1.extend(fila2)\r\n amu.append(fila1)\r\n if i+1 != nro_amu:\r\n _ = input()\r\n \r\npilas = []\r\nnro_pilas = 0\r\n\r\nfor a in amu:\r\n existe = False\r\n for i in range(nro_pilas):\r\n for j in range(4):\r\n if pilas[i][j] == a:\r\n existe = True\r\n if not existe:\r\n pilas.append([a,[a[2],a[0],a[3],a[1]],[a[3],a[2],a[1],a[0]],[a[1],a[3],a[0],a[2]]])\r\n nro_pilas = nro_pilas+1\r\n \r\nprint(nro_pilas)\r\n", "n = int(input())\r\n\r\ncolumns = set();\r\n\r\nfor i in range(n):\r\n n1, n2 = map(int, list(input()));\r\n n3, n4 = map(int, list(input()));\r\n musor = None if i == n - 1 else input()\r\n \r\n if not (\r\n (n1,n2,n4,n3) in columns or\r\n (n2,n4,n3,n1) in columns or\r\n (n4,n3,n1,n2) in columns or\r\n (n3,n1,n2,n4) in columns):\r\n columns.add((n1,n2,n4,n3));\r\n \r\nprint(len(columns))", "def rotate(st):\r\n res = st[1] + st[3] + st[0] + st[2]\r\n return res\r\n\r\nn = int(input())\r\nList = []\r\nfor j in range(n):\r\n s = str(input()) + str(input())\r\n r1 = rotate(s)\r\n r2 = rotate(r1)\r\n r3 = rotate(r2)\r\n found = False\r\n for k in range(len(List)):\r\n if List[k] in [s, r1, r2, r3]:\r\n found = True\r\n break\r\n if found == False:\r\n List.append(s)\r\n if j != n - 1:\r\n input()\r\nprint(len(List))\r\n", "n=int(input())\r\nd=set()\r\nfor i in range(n):\r\n s=input()+input()[::-1]\r\n if i<n-1:input()\r\n if all(s not in x for x in d):d.add(2*s)\r\nprint(len(d))", "n = int(input())\r\n\r\npiles = []\r\n\r\nfor i in range(n-1):\r\n line1 = input()\r\n line2 = input()\r\n seperator = input()\r\n\r\n line1 = [int(x) for x in str(line1)]\r\n line2 = [int(x) for x in str(line2)]\r\n \r\n line1.append(line2[1])\r\n line1.append(line2[0])\r\n amulet = line1\r\n\r\n amulet90 = amulet.copy()\r\n amulet90.insert(0, amulet[-1])\r\n amulet90.pop()\r\n\r\n amulet180 = amulet90.copy()\r\n amulet180.insert(0, amulet90[-1])\r\n amulet180.pop()\r\n\r\n amulet270 = amulet180.copy()\r\n amulet270.insert(0, amulet180[-1])\r\n amulet270.pop()\r\n\r\n\r\n if amulet in piles:\r\n pass\r\n elif amulet90 in piles:\r\n pass\r\n elif amulet180 in piles:\r\n pass\r\n elif amulet270 in piles:\r\n pass\r\n else:\r\n piles.append(amulet)\r\n\r\nline1 = input()\r\nline2 = input()\r\n\r\nline1 = [int(x) for x in str(line1)]\r\nline2 = [int(x) for x in str(line2)]\r\n\r\nline1.append(line2[1])\r\nline1.append(line2[0])\r\namulet = line1\r\n\r\namulet90 = amulet.copy()\r\namulet90.insert(0, amulet[-1])\r\namulet90.pop()\r\n\r\namulet180 = amulet90.copy()\r\namulet180.insert(0, amulet90[-1])\r\namulet180.pop()\r\n\r\namulet270 = amulet180.copy()\r\namulet270.insert(0, amulet180[-1])\r\namulet270.pop()\r\n\r\n\r\nif amulet in piles:\r\n pass\r\nelif amulet90 in piles:\r\n pass\r\nelif amulet180 in piles:\r\n pass\r\nelif amulet270 in piles:\r\n pass\r\nelse:\r\n piles.append(amulet)\r\n\r\nprint(len(piles))", "x = set()\nt = int(input())\nfor _ in range(t):\n a,b = [int(i) for i in input()]\n c,d = [int(i) for i in input()]\n f = [a,b,c,d]\n minm = min(f)\n pos = []\n if minm == b:\n f = [a,b,c,d]\n g = ''.join([str(i) for i in f])\n pos.append(g)\n if minm == a:\n f = [c,a,d,b]\n g = ''.join([str(i) for i in f])\n pos.append(g)\n if minm == c:\n f = [d,c,b,a]\n g = ''.join([str(i) for i in f])\n pos.append(g)\n if minm == d:\n f = [b,d,a,c]\n g = ''.join([str(i) for i in f])\n pos.append(g)\n\n for i in pos:\n if i in x:\n x.add(i)\n break\n else:\n x.add(pos[0])\n \n if _ < t-1:\n input()\nprint(len(x))\n", "def sp(n):\r\n\treturn n//10,n%10\r\n\r\ndef rsp(n):\r\n\treturn n%10,n//10\r\n\r\ndef dsp(fn,sn):\r\n\treturn sp(int(fn))+rsp(int(sn))\r\n\r\ndef left(b,k):\r\n\treturn b[k:]+b[:k]\r\n\r\ndef gbv(b):\r\n\treturn [left(b,x) for x in range(4)]\r\n\r\ndef att(ttc,vc,b):\r\n\tif b not in ttc:\r\n\t\tfor c in gbv(b):\r\n\t\t\tif c in ttc:\r\n\t\t\t\tcontinue\r\n\t\t\tttc[c]=len(vc)\r\n\t\tvc.append(1)\r\n\telse:\r\n\t\tvc[ttc[b]]+=1\r\n\r\nn=int(input())\r\nv=[]\r\nfor c in range(n-1):\r\n\tv.append(dsp(input(),input()))\r\n\tinput()\r\nv.append(dsp(input(),input()))\r\nvc=[]\r\nttc=dict()\r\n\r\nfor c in v:\r\n\tatt(ttc,vc,c)\r\nprint(len(vc))", "p = {}\r\nfor i in range(int(input()) - 1):\r\n t = input() + input()[:: -1]\r\n p[min(t, t[1: ] + t[0], t[2: ] + t[: 2], t[3] + t[: 3])] = 0\r\n input()\r\nt = input() + input()[:: -1]\r\np[min(t, t[1: ] + t[0], t[2: ] + t[: 2], t[3] + t[: 3])] = 0\r\nprint(len(p))", "d={}\r\nI=input\r\nn=int(I())\r\nfor i in range(n):\r\n s=I()+I()\r\n for _ in range(4):\r\n s=s[2]+s[0]+s[3]+s[1]\r\n if s in d:d[s]+=1;break\r\n else:d[s]=1\r\n if i+1<n:I()\r\nprint(len(d))", "n = int(input())\r\namulets = ['' for i in range(n)]\r\nfor i in range(n):\r\n amulets[i] += input()\r\n amulets[i] += input()\r\n if i != n-1:\r\n _ = input()\r\n\r\nset_am_rot = set()\r\npiles = 0\r\nfor amulet in amulets:\r\n if amulet not in set_am_rot:\r\n set_am_rot.add(amulet)\r\n set_am_rot.add(amulet[2]+amulet[0]+amulet[3]+amulet[1])\r\n set_am_rot.add(amulet[3]+amulet[2]+amulet[1]+amulet[0])\r\n set_am_rot.add(amulet[1]+amulet[3]+amulet[0]+amulet[2])\r\n piles += 1\r\n\r\nprint(piles)" ]

[ "\r\ndef mp():return map(int,input().split())\r\ndef it():return int(input())\r\n\r\n\r\na,b,x=mp()\r\ns=''\r\nif x&1==0:\r\n\r\n\tif a>b:\r\n\t\ts+='01'*(x//2)\r\n\t\ts+='1'*(b-(x//2))\r\n\t\ts+='0'*(a-(x//2))\r\n\telse:\r\n\t\ts+='10'*(x//2)\r\n\t\ts+='0'*(a-(x//2))\r\n\t\ts+='1'*(b-(x//2))\r\nelse:\r\n\tif a>b:\r\n\t\ts+='01'*(x//2)\r\n\t\ts+='0'*(a-(x//2))\r\n\t\ts+='1'*(b-(x//2))\r\n\telse:\r\n\t\ts+='10'*(x//2)\r\n\t\ts+='1'*(b-(x//2))\r\n\t\ts+='0'*(a-(x//2))\r\nprint(s)\r\n", "from collections import *\r\nfrom heapq import *\r\nfrom bisect import *\r\nfrom itertools import *\r\nfrom functools import *\r\nfrom math import *\r\nfrom string import *\r\nimport sys\r\n\r\ninput = sys.stdin.readline\r\n\r\n\r\ndef solve():\r\n zeroes, ones, x = map(int, input().split())\r\n\r\n if not ones:\r\n return \"0\" * zeroes\r\n if not zeroes:\r\n return \"1\" * ones\r\n\r\n ans = \"1\"\r\n ones -= 1\r\n\r\n for _ in range(x):\r\n if ans[-1] == \"1\" and zeroes:\r\n ans += \"0\"\r\n zeroes -= 1\r\n elif ans[-1] == \"0\" and ones:\r\n ans += \"1\"\r\n ones -= 1\r\n elif ans[0] == \"1\" and zeroes:\r\n ans = \"0\" + ans\r\n zeroes -= 1\r\n elif ans[0] == \"0\" and ones:\r\n ans = \"1\" + ans\r\n ones -= 1\r\n\r\n i = ans.index(\"0\")\r\n ans = ans[:i] + zeroes * \"0\" + ans[i:]\r\n i = ans.index(\"1\")\r\n ans = ans[:i] + ones * \"1\" + ans[i:]\r\n\r\n return ans\r\n\r\n\r\ndef main():\r\n tests = 1\r\n for _ in range(tests):\r\n print(solve())\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "a,b,x = list(map(int,input().split()))\r\n\r\nif x%2==0:\r\n if (a>b):\r\n ans = \"01\" * (x // 2) + \"1\" * (b - x // 2) + \"0\" * (a - x // 2)\r\n else:\r\n ans = \"10\" * (x // 2) + \"0\" * (a - x // 2) + \"1\" * (b - x // 2)\r\n\r\n # else:\r\n # for i in range(x//2):\r\n # print('10')\r\n # print(str(b-x//2,'0'))\r\n # print(str(b-x//2,'1'))\r\nelse:\r\n if (a>b):\r\n ans = \"01\" * (x // 2) + \"0\" * (a - x // 2) + \"1\" * (b - x // 2)\r\n # for i in range(x//2):\r\n # print('01')\r\n # print(str(a-x//2,'0'))\r\n # print(str(b-x//2,'1'))\r\n else:\r\n ans = \"10\" * (x // 2) + \"1\" * (b - x // 2) + \"0\" * (a - x // 2)\r\n# else:\r\n# for i in range(x//2):\r\n# print('10')\r\n# print(str(b-x//2,'1'))\r\n# print(str(a-x//2,'0'))\r\n# print()\r\nprint(ans)", "from math import*\r\nimport os\r\n\r\na,b,x=map(int,input().split())\r\nc=0\r\nd=0\r\nif x%2==0:\r\n\tvar=x//2\r\n\tfor i in range(var):\r\n\t\tif a>b:\r\n\t\t\tprint(\"01\",end='')\r\n\t\telse:\r\n\t\t\tprint(\"10\",end='')\r\n\tfor i in range(min(a,b)-var):\r\n\t\tprint(\"1\" if a>b else 0,end='')\r\n\tfor i in range(max(a,b)-var):\r\n\t\tprint(\"0\" if a>b else 1,end='')\r\nelse:\r\n\tvar=(x-1)//2\r\n\tfor i in range(var):\r\n\t\tif a>b:\r\n\t\t\tprint(\"01\",end='')\r\n\t\telse:\r\n\t\t\tprint(\"10\",end='')\r\n\tfor i in range(max(a,b)-var):\r\n\t\tprint(\"0\" if a>b else \"1\",end='')\r\n\tfor i in range(min(a,b)-var):\r\n\t\tprint(\"1\" if a>b else 0,end='')\r\n\r\n", "\r\ndef STR(): return list(input())\r\ndef INT(): return int(input())\r\ndef MAP(): return map(int, input().split())\r\ndef MAP2():return map(float,input().split())\r\ndef LIST(): return list(map(int, input().split()))\r\ndef STRING(): return input()\r\nimport string\r\nimport sys\r\nfrom heapq import heappop , heappush\r\nfrom bisect import *\r\nfrom collections import deque , Counter , defaultdict\r\nfrom math import *\r\nfrom itertools import permutations , accumulate\r\ndx = [-1 , 1 , 0 , 0 ]\r\ndy = [0 , 0 , 1 , - 1]\r\n#visited = [[False for i in range(m)] for j in range(n)]\r\n#sys.stdin = open(r'input.txt' , 'r')\r\n#sys.stdout = open(r'output.txt' , 'w')\r\n#for tt in range(INT()):\r\n\r\n\r\n#CODE\r\n\r\na , b , x = MAP()\r\ns = ''\r\n\r\nif x % 2 == 0 :\r\n if a > b :\r\n for i in range(x // 2):\r\n s += '01'\r\n\r\n for i in range(b - (x//2)):\r\n s += '1'\r\n\r\n for i in range(a - (x//2)):\r\n s += '0'\r\n\r\n else:\r\n for i in range(x // 2):\r\n s += '10'\r\n\r\n for i in range(a - (x // 2)):\r\n s += '0'\r\n\r\n for i in range(b - (x // 2)):\r\n s += '1'\r\n\r\n\r\nelse:\r\n if a > b :\r\n for i in range(x//2):\r\n s += '01'\r\n\r\n for i in range(a - (x//2)):\r\n s += '0'\r\n\r\n for i in range(b - (x//2)):\r\n s += '1'\r\n\r\n else:\r\n for i in range(x // 2):\r\n s += '10'\r\n\r\n for i in range(b - (x // 2)):\r\n s += '1'\r\n\r\n for i in range(a - (x // 2)):\r\n s += '0'\r\n\r\n\r\nprint(s)\r\n\r\n\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\na, b, x = map(int, input().split())\r\nif x % 2:\r\n y = x // 2 + 1\r\n aa, bb = [1] * y, [1] * y\r\n aa[0] += a - sum(aa)\r\n bb[0] += b - sum(bb)\r\nelse:\r\n y, z = x // 2, x // 2 + 1\r\n if y > a or z > b:\r\n y, z = z, y\r\n aa, bb = [1] * y, [1] * z\r\n aa[0] += a - sum(aa)\r\n bb[0] += b - sum(bb)\r\n if y < z:\r\n aa = [0] + aa\r\n else:\r\n bb.append(0)\r\ns = []\r\nfor i in range(len(aa)):\r\n s.append(\"0\" * aa[i])\r\n s.append(\"1\" * bb[i])\r\nprint(\"\".join(s))", "a,b,x = map(int,input().split())\r\n\r\nif x==1:\r\n print((\"0\"*a)+(\"1\"*b))\r\n exit()\r\n\r\ns = \"\"\r\nif a > b:\r\n s+=\"0\"\r\n a-=1\r\nelse:\r\n s+=\"1\"\r\n b-=1\r\n\r\nwhile x-1:\r\n if s[len(s)-1] == \"1\":\r\n s+=\"0\"\r\n a-=1\r\n else:\r\n s+=\"1\"\r\n b-=1\r\n x-=1\r\n\r\nif s[len(s)-1] == \"1\":\r\n s+= (\"1\"*b) + (\"0\"*a)\r\nelse:\r\n s+= (\"0\"*a) + (\"1\"*b)\r\nprint(s)\r\n \r\n", "#Mamma don't raises quitter.................................................\r\n#manan is improving, keep hustling manan bhai ;)\r\nfrom collections import deque as de\r\nimport math\r\nimport sys\r\nfrom math import sqrt as sq\r\nfrom math import floor as fl\r\nfrom math import ceil as ce\r\nfrom sys import stdin, stdout\r\n\r\nsys.setrecursionlimit(10**7)\r\nfrom collections import Counter as cnt\r\nfrom functools import reduce\r\n\r\nfrom itertools import groupby as gb\r\n#from fractions import Fraction as fr\r\nfrom bisect import bisect_left as bl, bisect_right as br\r\nfrom typing import Coroutine\r\n\r\ndef factors(n): \r\n return set(reduce(list.__add__, \r\n ([i, n//i] for i in range(1, int(n**0.5) + 1) if n % i == 0)))\r\n \r\nclass My_stack():\r\n def __init__(self):\r\n self.data = []\r\n def my_push(self, x):\r\n return (self.data.append(x))\r\n def my_pop(self):\r\n return (self.data.pop())\r\n def __iter__(self):\r\n return iter(self.data)\r\n def my_peak(self):\r\n return (self.data[-1])\r\n def my_contains(self, x):\r\n return (self.data.count(x))\r\n def my_show_all(self):\r\n return (self.data)\r\n def isEmpty(self):\r\n return len(self.data)==0\r\n def len(self):\r\n return len(self.data)\r\n \r\n\r\narrStack = My_stack() \r\n\r\nclass graph():\r\n def __init__(self):\r\n self.graphdict = {}\r\n def add_edge(self, node, neighbor):\r\n if node not in self.graphdict:\r\n self.graphdict[node]=[neighbor]\r\n else:\r\n self.graphdict[node].append(neighbor)\r\n def show_edge(self):\r\n for node in self.graphdict:\r\n for neighbors in self.graphdict:\r\n print(node, neighbors)\r\n def show_graph(self):\r\n return self.graphdict\r\n\r\n \r\n\r\n\r\n \r\n \r\n\r\n#decimal to binary \r\ndef decimalToBinary(n): \r\n return bin(n).replace(\"0b\", \"\")\r\n#binary to decimal\r\ndef binarytodecimal(n):\r\n return int(n,2)\r\n\r\ndef isPrime(n) : \r\n\tif (n <= 1) : \r\n\t\treturn False\r\n\tif (n <= 3) : \r\n\t\treturn True\r\n\tif (n % 2 == 0 or n % 3 == 0) : \r\n\t\treturn False\r\n\ti = 5\r\n\twhile(i * i <= n) : \r\n\t\tif (n % i == 0 or n % (i + 2) == 0) : \r\n\t\t\treturn False\r\n\t\ti = i + 6\r\n\treturn True\r\n\r\ndef get_prime_factors(number):\r\n prime_factors = []\r\n while number % 2 == 0:\r\n prime_factors.append(2)\r\n number = number / 2\r\n for i in range(3, int(math.sqrt(number)) + 1, 2):\r\n while number % i == 0:\r\n prime_factors.append(int(i))\r\n number = number / i\r\n\r\n if number > 2:\r\n prime_factors.append(int(number))\r\n return prime_factors\r\n\r\ndef get_frequency(list):\r\n dic={}\r\n for ele in list:\r\n if ele in dic:\r\n dic[ele] += 1\r\n else:\r\n dic[ele] = 1\r\n return dic\r\n\r\ndef Log2(x): \r\n return (math.log10(x) / \r\n math.log10(2)); \r\n\r\n \r\n# Function to get product of digits\r\ndef getProduct(n):\r\n product = 1\r\n while (n != 0):\r\n product = product * (n % 10)\r\n n = n // 10\r\n return product\r\n#fucntion to find regular bracket sequence\r\ndef regularBracketsequence(str,arrStack):\r\n for i in range(len(str)):\r\n if str[i] =='(':\r\n arrStack.my_push(str[i])\r\n else:\r\n if arrStack.isEmpty():\r\n return False\r\n else:\r\n arrStack.my_pop()\r\n if arrStack.isEmpty():\r\n return True\r\n else:\r\n return False\r\n\r\n#function to find LCM of two numbers\r\ndef lcm(x,y):\r\n lcm = (x*y)//math.gcd(x,y)\r\n return lcm\r\n\r\ndef isPowerOfTwo(n): \r\n return (math.ceil(Log2(n)) == math.floor(Log2(n))); \r\n#to check whether the given sorted sequnce is forming an AP or not....\r\ndef checkisap(list):\r\n d=list[1]-list[0]\r\n for i in range(2,len(list)):\r\n temp=list[i]-list[i-1]\r\n if temp !=d:\r\n return False\r\n return True\r\n\r\n#seive of erathanos\r\ndef primes_method5(n):\r\n out ={}\r\n sieve = [True] * (n+1)\r\n for p in range(2, n+1):\r\n if (sieve[p]):\r\n out[p]=1\r\n for i in range(p, n+1, p):\r\n sieve[i] = False\r\n return out\r\n#fucntion to get unique number to a cell in a matrix\r\ndef id(i, j, col): #one based indexing and columnwise numeration\r\n ans= (i-1)*col\r\n ans+=j\r\n return ans\r\n\r\n#function to get the sum of digits\r\ndef getSum(n): \r\n \r\n strr = str(n)\r\n list_of_number = list(map(int, strr.strip()))\r\n return sum(list_of_number)\r\ndef checkperfectsquare(n):\r\n if (ce(sq(n)) == fl(sq(n))):\r\n return True\r\n else:\r\n return False\r\n#this used for selecting r objects from n ojects\r\ndef combinatrics(n,r):\r\n num=n\r\n deno=n-r\r\n pr=1\r\n for i in range(num,deno,-1):\r\n pr*=i\r\n an=1\r\n for i in range(1,r+1):\r\n an*=i\r\n ans=pr//an\r\n return ans\r\n#ceil function gives wrong answer after 10^17 so i have to create my own :)\r\n# because i don't want to doubt on my solution of 900-1000 problem set.\r\ndef ceildiv(x,y): \r\n return (x+y-1)//y \r\n \r\ndef di():return map(int, input().split())\r\ndef ii():return int(input())\r\ndef li():return list(map(int, input().split()))\r\ndef si():return list(map(str, input()))\r\ndef indict():\r\n dic = {}\r\n for index, value in enumerate(input().split()):\r\n dic[int(value)] = int(index)\r\n return dic\r\ndef frqdict(): \r\n # by default it is for integer input. :)\r\n dic={}\r\n for index, value in enumerate(input()):\r\n if value not in dic:\r\n dic[value] =1\r\n else:\r\n dic[value] +=1\r\n return dic\r\n\r\n#sys.stdin = open('input.txt', 'r')\r\n#sys.stdout = open('output.txt', 'w')\r\n#practice like your never won\r\n#perform like you never lost\r\na,b,x=di()\r\nif x%2:\r\n temp=ce(x/2)\r\n t=temp\r\n ans=\"\"\r\n while temp:\r\n temp-=1\r\n ans+=\"10\"\r\n final=((b-t)*(\"1\"))+ans+((a-t)*(\"0\"))\r\n print(final)\r\n\r\nelse:\r\n #a zeroes, exactly b ones\r\n temp=x//2\r\n t=temp\r\n if a <=b:\r\n ans=\"\"\r\n while temp:\r\n temp-=1\r\n ans+=\"10\"\r\n final=ans+((a-t)*\"0\")+((b-t)*(\"1\"))\r\n print(final)\r\n else:\r\n ans=\"\"\r\n while temp:\r\n temp-=1\r\n ans+=\"01\"\r\n final= ans+((b-t)*(\"1\"))+((a-t)*\"0\")\r\n print(final)\r\n \r\n \r\n\r\n \r\n \r\n ", "a,b,x=map(int,input().split())\nans = ''\nmini = min(a,b)\n\nif mini==b:\n for i in range(x):\n if i&1:\n ans+='1'\n b-=1\n else:\n ans+='0'\n a-=1\nelse:\n for i in range(x):\n if i&1:\n ans+='0'\n a-=1\n else:\n ans+='1'\n b-=1\nif ans[-1]=='1':\n for i in range(b):\n ans+='1'\n for j in range(a):\n ans+='0'\nelse:\n for i in range(a):\n ans+='0'\n for j in range(b):\n ans+='1'\nprint (ans)\n", "a,b,x=map(int,input().strip().split())\r\ns=\"\"\r\nif x==1:\r\n s=\"0\"*a+\"1\"*b\r\nelif a>=b:\r\n p=(x-1)//2\r\n q=(x-1)%2\r\n s=\"01\"*(p+q)\r\n if q==0:\r\n s+=\"0\"*(a-p)+\"1\"*(b-p)\r\n else:\r\n s+=\"1\"*(b-p-1)+\"0\"*(a-p-1)\r\nelse:\r\n p=(x-1)//2\r\n q=(x-1)%2\r\n s=\"10\"*(p+q)\r\n if q==0:\r\n s+=\"1\"*(b-p)+\"0\"*(a-p)\r\n else:\r\n s+=\"0\"*(a-p-1)+\"1\"*(b-p-1)\r\nprint(s)", "a,b,x=map(int,input().split())\r\nans=\"\"\r\nif (a>=b):\r\n for _ in range(a):\r\n ans+=\"0\"\r\nelse:\r\n for _ in range(b):\r\n ans+=\"1\"\r\nif x%2==1:\r\n if ans[0]==\"1\":\r\n ans+=\"0\"\r\n x-=1\r\n a-=1\r\n else:\r\n ans+=\"1\"\r\n x-=1\r\n b-=1\r\nelse:\r\n pass\r\nif ans[0]==\"1\":\r\n i=1\r\n while (x!=0):\r\n ans=ans[:i]+\"0\"+ans[i:len(ans)]\r\n x-=2\r\n a-=1\r\n i+=2\r\n for i in range(len(ans)-1,-1,-1):\r\n if ans[i]==\"0\":\r\n break\r\n else:\r\n pass\r\n for _ in range(a):\r\n ans=ans[:i]+\"0\"+ans[i:len(ans)]\r\nelse:\r\n i=1\r\n while(x!=0):\r\n ans=ans[:i]+\"1\"+ans[i:len(ans)]\r\n x-=2\r\n b-=1\r\n i+=2\r\n for i in range(len(ans)-1,-1,-1):\r\n if ans[i]==\"1\":\r\n break\r\n else:\r\n pass\r\n for _ in range(b):\r\n ans=ans[:i]+\"1\"+ans[i:len(ans)]\r\nprint(ans)", "import sys\r\ninput = lambda: sys.stdin.readline().rstrip()\r\n\r\n# ----------------------- #\r\n\r\nb, a, x = map(int, input().split())\r\nB, A, X = b, a, x\r\nans = '10' * ((x+1)//2)\r\na -= len(ans)//2\r\nb -= len(ans)//2\r\nassert a >= 0 and b >= 0\r\ncnt = len(ans) - 1\r\nif cnt != x:\r\n if a == 0:\r\n ans = '0' * b + ans\r\n elif b == 0:\r\n ans += '1' * a\r\n else:\r\n ans = '1' * a + ans\r\n ans = '0' * b + ans\r\nelse:\r\n ans = '1' * a + ans\r\n ans += '0' * b\r\nb, a, x = B, A, X\r\ncnt = 0\r\nassert len(ans) == (a+b)\r\nn = a + b\r\nfor i in range(n-1):\r\n if ans[i] != ans[i+1]:\r\n cnt += 1\r\nassert cnt == x\r\nassert ans.count('1') == a\r\nassert ans.count('0') == b\r\nprint(ans)\r\n", "a, b, x = map(int, input().split())\r\nc = 0\r\nr_a, r_b = 0, 0\r\nres = ''\r\nwhile c <= x:\r\n if c % 2 == 0 and b != r_b:\r\n res += '1'\r\n r_b += 1\r\n if c % 2 == 1 and a != r_a:\r\n res += '0'\r\n r_a += 1\r\n c += 1\r\nif res.count('10') + res.count('01') != x:\r\n res = '0' + res\r\n r_a += 1\r\nres = res[:res.index('0')] + '0' * (a - r_a) + res[res.index('0'):]\r\nres = res[:res.index('1')] + '1' * (b - r_b) + res[res.index('1'):]\r\nprint(res)\r\n", "a, b, x = map(int, input().split())\r\n\r\nif a > b:\r\n cur = '0'\r\nelse:\r\n cur = '1'\r\n\r\nd = {\r\n '0': a, '1': b\r\n}\r\n\r\nd[cur] -= 1\r\ns = cur\r\nfor i in range(1, a+b):\r\n \r\n notcur = '0' if cur == '1' else '1'\r\n \r\n if x == 0:\r\n pass\r\n else:\r\n if d[cur] > 0 and d[notcur] > 0 and x == 1:\r\n pass\r\n else:\r\n cur = notcur\r\n x -= 1\r\n s += cur\r\n d[cur] -= 1\r\n \r\nprint(s)\r\n", "v = [int(i) for i in input().split()]\n\na = v[0] - 1\nb = v[1] - 1\nx = v[2]\n\nans = ['0', '1']\ndif = 1\n\nwhile a > 0 and b > 0 and dif < x:\n # adiciona uma diferenca a direita\n ans += ['0', '1']\n a -= 1\n b -= 1\n \n dif += 2\n\n# \"0XXXX1\", com dif = x-1, x ou x+1\nif dif == x: # preenche os extremos (extensão)\n ans = list('0'*a) + ans + list('1'*b)\nelif dif == x+1: # retira a diferença da esquerda e extende\n ans[0] = '1' + '1'*b\n ans[1] = '0' + '0'*a\nelse: # uma diferenca a menos\n if a > 0: # diferenca no fim\n ans = ans + list('1'*b + '0'*a)\n else: # coloca diferenca no inicio\n ans = list('1'*b + '0'*a) + ans\n \nprint(''.join(ans))\n\t \t \t \t\t \t \t \t \t\t\t\t\t\t\t\t", "*ab, x = map(int, input().split(' '))\n\nst = int(ab[1] > ab[0])\nbase = str(st)\nab[st] -= 1\n\nwhile x:\n st = (st + 1) % 2\n base += str(int(st))\n x -= 1\n ab[st] -= 1\n\nif ab[0]:\n base = base.replace('0', '0' * (ab[0] + 1), 1)\n\nif ab[1]:\n base = base.replace('1', '1' * (ab[1] + 1), 1)\n\nprint(base)\n", "a, b, x = map(int, input().split())\r\n\r\nif a >= b:\r\n color = [0, 1] * ((x + 1) // 2)\r\n if x % 2 == 0:\r\n color.append(0)\r\n cnt = [1] * len(color)\r\n a -= sum(cnt[0::2])\r\n b -= sum(cnt[1::2])\r\n cnt[0] += a\r\n cnt[1] += b\r\nelse:\r\n color = [1, 0] * ((x + 1) // 2)\r\n if x % 2 == 0:\r\n color.append(1)\r\n cnt = [1] * len(color)\r\n a -= sum(cnt[1::2])\r\n b -= sum(cnt[0::2])\r\n cnt[1] += a\r\n cnt[0] += b\r\n\r\n\r\nfor k, v in zip(color, cnt):\r\n for _ in range(v):\r\n print(k, end=\"\")\r\nprint()\r\n", "a, b, x = map(int, input().split())\r\n\r\n\r\nif a > b:\r\n s = '0'\r\nelse:\r\n s = '1'\r\nfor i in range(x):\r\n if s[- 1] == '1':\r\n s += '0'\r\n else:\r\n s += '1'\r\n\r\nc1 = s.count('0')\r\nc2 = s.count('1')\r\nif s[0] == '0' or s[1] == '1':\r\n s1 = '0' * (a - c1 + 1) + '1' * (b - c2 + 1) + s[2::]\r\nif s[0] == '1' or s[1] == '0':\r\n s1 = '1' * (b - c2 + 1) + '0' * (a - c1 + 1) + s[2::]\r\nprint(s1)", "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\n# region fastio\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\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\nstdin, stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout) \r\n \r\nmod = pow(10, 9) + 7\r\nmod2 = 998244353\r\n \r\ndef inp(): return stdin.readline().strip()\r\ndef iinp(): return int(inp())\r\ndef out(var, end=\"\\n\"): stdout.write(str(var)+\"\\n\")\r\ndef outa(*var, end=\"\\n\"): stdout.write(' '.join(map(str, var)) + end)\r\ndef lmp(): return list(mp())\r\ndef mp(): return map(int, inp().split())\r\ndef l1d(n, val=0): return [val for i in range(n)]\r\ndef l2d(n, m, val=0): return [l1d(m, val) for j in range(n)]\r\ndef ceil(a, b): return (a+b-1)//b\r\nS1 = 'abcdefghijklmnopqrstuvwxyz'\r\nS2 = 'ABCDEFGHIJKLMNOPQRSTUVWXYZ'\r\ndef isprime(x):\r\n if x<=1: return False\r\n if x in (2, 3): return True\r\n if x%2 == 0: return False\r\n for i in range(3, int(sqrt(x))+1, 2):\r\n if x%i == 0: return False\r\n return True\r\n \r\na, b, x = mp()\r\nif x==1:\r\n print('0'*a+'1'*b)\r\nelse:\r\n if x%2:\r\n if a>=b:\r\n print('01'*(x//2)+'0'*(a-x//2)+'1'*(b-x//2))\r\n else:\r\n print('10'*(x//2)+'1'*(b-x//2)+'0'*(a-x//2))\r\n else:\r\n if a>=b:\r\n print('01'*(x//2)+'1'*(b-x//2)+'0'*(a-x//2))\r\n else:\r\n print('10'*(x//2)+'0'*(a-x//2)+'1'*(b-x//2))\r\n", "a,b,x = [int(x) for x in input().split()]\r\ns,t,u ='' ,'', ''\r\nif a<b :\r\n t = '1'\r\n u = '0'\r\nelse:\r\n t = '0'\r\n u = '1'\r\nfor i in range(1,x+1):\r\n if i%2:\r\n s += t\r\n else:\r\n s += u\r\nif x%2:\r\n for i in range(max(a,b)-x//2-1):\r\n s += t\r\n for i in range(min(a,b)-x//2):\r\n s += u\r\nelse:\r\n for i in range(min(a,b)-x//2):\r\n s += u\r\n for i in range(max(a,b)-x//2):\r\n s += t\r\nprint(s)\r\n\r\n \r\n\r\n\r\n# for i in range(x//2):\r\n# s += '10'\r\n# if x%2:\r\n# s += '1' \r\n# b-= x//2+1\r\n# a -= x//2 \r\n# for i in range(b):\r\n# s+= '1'\r\n# for i in range(a):\r\n# s += '0'\r\n# print(s)\r\n# else:\r\n# b-= x//2+1\r\n# a -= x//2 \r\n# for i in range(b):\r\n# s+= '1'\r\n# for i in range(a):\r\n# s += '0'\r\n# print(s)\r\n\r\n", "from collections import *\r\na,b,x = list(map(int,input().split()))\r\noga = a\r\nogb = b\r\nans = \"\"\r\nfor i in range(x+1):\r\n\tif(i%2 == 0):\r\n\t\tif(oga < ogb):\r\n\t\t\tans += '1'\r\n\t\t\tb -= 1\r\n\t\telse:\r\n\t\t\tans += '0'\r\n\t\t\ta -= 1\r\n\telse:\r\n\t\tif(oga < ogb):\r\n\t\t\tans += '0'\r\n\t\t\ta -= 1\r\n\t\telse:\r\n\t\t\tans += '1'\r\n\t\t\tb -= 1\r\nif(ans[0] == '0'):\r\n\tans = (a+1)*'0' + (b+1)*'1' + ans[2:]\r\nelse:\r\n\tans = (b+1)*'1' + (a+1)*'0' + ans[2:]\r\nprint(ans)", "a, b, x = map(int, input().split())\n\nk, s = [a, b], int(a <= b)\nl = ''\n\nfor _ in range(x + 1):\n l += str(s)\n k[s] -= 1\n s = 1 - s\n\nfor v in range(2):\n iv = l.index(str(v))\n l = l[:iv] + str(v) * (k[v]) + l[iv:]\n\nprint(l)\n\n", "a,b,x = list(map(int,input().split()))\r\nres = ''\r\nif x % 2 == 0:\r\n if a > b:\r\n for i in range(x//2):\r\n res += '01'\r\n for i in range(b - x //2):\r\n res += '1'\r\n for i in range(a - x //2):\r\n res += '0'\r\n else:\r\n for i in range(x//2):\r\n res += '10'\r\n for i in range(a - x //2):\r\n res += '0'\r\n for i in range(b - x //2):\r\n res += '1'\r\nelif a > b:\r\n for i in range(x // 2):\r\n res += '01'\r\n for i in range(a - x // 2):\r\n res += '0'\r\n for i in range(b - x // 2):\r\n res += '1'\r\nelse:\r\n for i in range(x // 2):\r\n res += '10'\r\n for i in range(b - x // 2):\r\n res += '1'\r\n for i in range(a - x // 2):\r\n res += '0'\r\nprint(res)", "a,b,x=map(int,input().split())\r\nd=0--x//2\r\nans=\"01\"*d\r\na-=d\r\nb-=d\r\nans=\"0\"*a+ans+\"1\"*b\r\nif x==d*2:\r\n if a:\r\n ans=ans[1:]+\"0\"\r\n else:\r\n ans=\"1\"+ans[:-1]\r\nprint(ans)", "a, b, k = map(int, input().split())\r\n\r\nif k%2 == 1:\r\n ans = '10'*((k+1)//2)\r\nelse:\r\n ans = '10'*(k//2)\r\n\r\na -= len(ans)//2\r\nb -= len(ans)//2\r\n\r\nif k%2 == 1:\r\n print('1'*b + ans + '0'*a)\r\nelif not b:\r\n print('0' + ans + '0'*(a-1))\r\nelse:\r\n print(ans + '0'*a + '1'*b)", "v = [int(i) for i in input().split(\" \")]\n\na = v[0]\nb = v[1]\nx = v[2]\n\nlastv = -1\nif b > a:\n\tlastv = 1\n\tprint(1, end=\"\")\n\tb -= 1\nelse:\n\tlastv = 0\n\tprint(0, end=\"\")\n\ta -= 1\n\nwhile x > 1:\n\tx -= 1\n\tif lastv == 0:\n\t\tprint(1, end=\"\")\n\t\tlastv = 1\n\t\tb -= 1\n\telse:\n\t\tprint(0, end=\"\")\n\t\tlastv = 0\n\t\ta -= 1\n\nif lastv == 1:\n\twhile b > 0:\n\t\tprint(1, end=\"\")\n\t\tb -= 1\n\twhile a > 0:\n\t\tprint(0, end=\"\")\n\t\ta -= 1\n\nelse:\n\twhile a > 0:\n\t\tprint(0, end=\"\")\n\t\ta -= 1\n\twhile b > 0:\n\t\tprint(1, end=\"\")\n\t\tb -= 1\n\t\nprint()", "import sys,math,heapq,copy\r\nfrom collections import defaultdict,deque\r\nfrom bisect import bisect_left,bisect_right\r\nfrom functools import cmp_to_key\r\nfrom itertools import permutations,combinations,combinations_with_replacement\r\n# sys.setrecursionlimit(10**6)\r\n# sys.stdin=open('Input.txt','r')\r\n# sys.stdout=open('Output.txt','w')\r\nmod=1000000007\r\n# Reading Single Input\r\ndef get_int(): return int(sys.stdin.readline().strip())\r\ndef get_str(): return sys.stdin.readline().strip()\r\ndef get_float(): return float(sys.stdin.readline().strip())\r\n# Reading Multiple Inputs\r\ndef get_ints(): return map(int, sys.stdin.readline().strip().split())\r\ndef get_strs(): return map(str, sys.stdin.readline().strip().split())\r\ndef get_floats(): return map(float, sys.stdin.readline().strip().split())\r\n# Reading List Of Inputs\r\ndef list_ints(): return list(map(int, sys.stdin.readline().strip().split()))\r\ndef list_strs(): return list(map(str, sys.stdin.readline().strip().split()))\r\ndef list_floats(): return list(map(float, sys.stdin.readline().strip().split()))\r\n# ------------------------------------------------------------------------------------- #\r\n\r\ndef fun(a,b,ch1,ch2,x):\r\n\tans=\"\"\r\n\tans+=ch1\r\n\ta-=1\r\n\tfor i in range(x):\r\n\t\tif(i==(x-1) and b>0):\r\n\t\t\tans+=ch2*b\r\n\t\t\tb=0\r\n\t\tif(i&1 and a>0):\r\n\t\t\tans+=ch1\r\n\t\t\ta-=1\r\n\t\telif(b>0):\r\n\t\t\tans+=ch2\r\n\t\t\tb-=1\r\n\tif(a>0):\r\n\t\treturn ch1*a+ans\r\n\telse:\r\n\t\treturn ans\r\na,b,x=get_ints()\r\nif(a>b):\r\n\tprint(fun(a,b,'0','1',x))\r\nelse:\r\n\tprint(fun(b,a,'1','0',x))", "\"\"\"\r\n Author : Ashish Sasmal\r\n Python3 / PyPy3\r\n\"\"\"\r\n\r\nfrom sys import stdin as sin\r\ndef aint():return int(input())\r\ndef amap():return map(int,sin.readline().split())\r\ndef alist():return list(map(int,sin.readline().split()))\r\ndef astr():return input()\r\n\r\nfrom math import ceil\r\n\r\ndef ce(x):\r\n return int(ceil(x))\r\n\r\na,b,x = amap()\r\nans = None\r\nif a<=b:\r\n g = ce(x/2)\r\n ans = \"01\"*g\r\n if x%2==0:\r\n ans = \"1\"*(b-g) + \"0\"*(a-g) + ans\r\n else:\r\n ans = \"0\"*(a-g) + ans + \"1\"*(b-g)\r\nelse:\r\n g = ce(x/2)\r\n ans = \"10\"*g\r\n if x%2==0:\r\n ans = \"0\"*(a-g) + \"1\"*(b-g) + ans\r\n else:\r\n ans = \"1\"*(b-g) + ans + \"0\"*(a-g)\r\n \r\nprint(ans)", "a,b,x=map(int,input().split())\r\nif x==1:\r\n ans='0'*a+'1'*b\r\nelse:\r\n ans='01'*(x//2)\r\n a-=ans.count('0');b-=ans.count('1');x-=(x//2)*2-1\r\n if x==1:\r\n if a>0:ans+='1'*b+'0'*a\r\n else:ans='1'*b+ans\r\n else:\r\n ans='1'*b+ans+'0'*a\r\nprint(ans)\r\n", "a,b,x = map(int,input().split())\r\nans = \"\"\r\nzeros = 0\r\nones = 0\r\nif a>b:\r\n for i in range(x+1):\r\n if i%2==0:\r\n ans+=\"0\"\r\n zeros+=1\r\n else:\r\n ans+=\"1\"\r\n ones+=1\r\n if i>=x-1:\r\n if i%2==0:\r\n while a-zeros>0:\r\n ans+=\"0\"\r\n zeros+=1\r\n else:\r\n while b-ones>0:\r\n ans+=\"1\"\r\n ones+=1\r\nelse:\r\n for i in range(x+1):\r\n if i%2==0:\r\n ans+=\"1\"\r\n ones+=1\r\n else:\r\n ans+=\"0\"\r\n zeros+=1\r\n if i>=x-1:\r\n if i%2==1:\r\n while a-zeros>0:\r\n ans+=\"0\"\r\n zeros+=1\r\n else:\r\n while b-ones>0:\r\n ans+=\"1\"\r\n ones+=1\r\nprint(ans)", "a,b,x = map(int,input().split())\r\nif a > b:\r\n s='0'\r\n a-=1\r\nelse:\r\n s='1'\r\n b-=1\r\nfor i in range(x-1):\r\n if s[-1] == '1':\r\n s+='0'\r\n a-=1\r\n else:\r\n s+='1'\r\n b-=1\r\n\r\nif s[-1] == '1':\r\n s+='1'*b\r\n s+='0'*a\r\nelse:\r\n s+='0'*a\r\n s+='1'*b\r\nprint(s)\r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Thu Sep 24 05:28:32 2020\r\n\r\n@author: Dark Soul\r\n\"\"\"\r\n\r\n[a,b,x]=list(map(int,input().split()))\r\ns=''\r\nx+=1\r\nd=x//2\r\nif d*2!=x:\r\n up=d+1\r\n down=d\r\nelse:\r\n up=d\r\n down=d\r\nif a>=up:\r\n a-=up\r\n b-=down\r\n s+='0'*a\r\n s+='01'*down\r\n s+='1'*b\r\n if up>down:\r\n s+='0'\r\nelse:\r\n b-=up\r\n a-=down\r\n if up>down:\r\n s+='1'\r\n s+='0'*a\r\n s+='01'*down\r\n s+='1'*b\r\nprint(s)\r\n \r\n ", "a,b,x=map(int,input().split())\nif a<=b:\n m=1\n n=0\n a,b=b,a\nelse:\n m=0\n n=1\nfor i in range(1,(x//2)+1):\n print(m,end=\"\")\n print(n,end=\"\")\n a-=1\n b-=1\nif x%2==0:\n for i in range(b):\n print(n,end=\"\")\n for i in range(a):\n print(m,end=\"\")\nelse:\n for i in range(a):\n print(m,end=\"\")\n for i in range(b):\n print(n,end=\"\")\n\n\n\t \t\t \t \t \t\t\t\t\t\t\t\t \t\t \t\t", "import sys\r\ninput = sys.stdin.readline\r\n\r\na, b, x = map(int, input().split())\r\nl = x + 1\r\n\r\nif a > b:\r\n q = l // 2\r\n if q * 2 - 1 < x:\r\n s = ['01'] * q + ['1'] * (b - q) + ['0'] * (a - q)\r\n else:\r\n s = ['0'] * (a - q) + ['01'] * q + ['1'] * (b - q)\r\nelse:\r\n q = l // 2\r\n if q * 2 - 1 < x:\r\n s = ['10'] * q + ['0'] * (a - q) + ['1'] * (b - q)\r\n else:\r\n s = ['1'] * (b - q) + ['10'] * q + ['0'] * (a - q)\r\n\r\nprint(\"\".join(s))\r\n", "a,b,x = map(int,input().split())\r\ns = \"\"\r\nif x%2 == 0:\r\n\tif a > b:\r\n\t\ttemp = x//2\r\n\t\tfor i in range(temp):\r\n\t\t\ts += \"01\"\r\n\t\tfor i in range(b-temp):\r\n\t\t\ts += \"1\"\r\n\t\tfor i in range(a-temp):\r\n\t\t\ts += \"0\"\r\n\telse:\r\n\t\ttemp = x//2\r\n\t\tfor i in range(temp):\r\n\t\t\ts += \"10\"\r\n\t\tfor i in range(a-temp):\r\n\t\t\ts += \"0\"\r\n\t\tfor i in range(b-temp):\r\n\t\t\ts += \"1\"\r\nelse:\r\n\tif a > b:\r\n\t\ttemp = x//2\r\n\t\tfor i in range(temp):\r\n\t\t\ts += \"01\"\r\n\t\tfor i in range(a-temp):\r\n\t\t\ts += \"0\"\r\n\t\tfor i in range(b-temp):\r\n\t\t\ts += \"1\"\r\n\telse:\r\n\t\ttemp = x//2\r\n\t\tfor i in range(temp):\r\n\t\t\ts += \"10\"\r\n\t\tfor i in range(b-temp):\r\n\t\t\ts += \"1\"\r\n\t\tfor i in range(a-temp):\r\n\t\t\ts += \"0\"\r\nprint(s)", "import sys\r\ndef input(): return sys.stdin.readline()\r\n\r\n\r\n# a for 0 and b for 1\r\na, b, x = map(int, input().split())\r\ns = ''\r\nif x == 1:\r\n print('1' * b + '0' * a)\r\nelse:\r\n x_part = ''\r\n if x & 1:\r\n if a < b:\r\n for i in range((x + 1) // 2):\r\n x_part += '10'\r\n a -= 1\r\n b -= 1\r\n else:\r\n for i in range((x + 1) // 2):\r\n x_part += '01'\r\n a -= 1\r\n b -= 1\r\n if x_part[0] == '0':\r\n s = a * '0' + x_part + b * '1'\r\n else:\r\n s = b * '1' + x_part + a * '0'\r\n else:\r\n if a < b:\r\n for i in range(x // 2):\r\n x_part += '10'\r\n a -= 1\r\n b -= 1\r\n x_part += '1'\r\n b -= 1\r\n else:\r\n for i in range(x // 2):\r\n x_part += '01'\r\n a -= 1\r\n b -= 1\r\n x_part += '0'\r\n a -= 1\r\n if x_part[0] == '1':\r\n s = b * '1' + x_part[:1] + a * '0' + x_part[1:]\r\n else:\r\n s = a * '0' + x_part[:1] + b * '1' + x_part[1:]\r\n print(s)\r\n", "from sys import stdin, stdout\r\na,b,x = map(int, stdin.readline().split())\r\ns = ''\r\nif x % 2 == 0:\r\n if a > b:\r\n s = '01'*(x//2) + '1'*(b-(x//2))+'0'*(a-(x//2))\r\n else:\r\n s = '10'*(x//2) + '0'*(a-(x//2))+'1'*(b-(x//2))\r\nelse:\r\n if a > b:\r\n s = '01'*(x//2) + '0'*(a-(x//2))+'1'*(b-(x//2))\r\n else:\r\n s = '10'*(x//2) + '1'*(b-(x//2))+'0'*(a-(x//2))\r\nstdout.write(s)", "from sys import stdin, stdout\nfrom collections import defaultdict\ndef read():\n\treturn stdin.readline().rstrip()\n\ndef read_int():\n\treturn int(read())\n\ndef read_ints():\n\treturn list(map(int, read().split()))\n\ndef solve():\n\ta,b,x=read_ints()\n\tif a>b:\n\t\tans=(\"01\"*x)[:x-1]\n\telse:\n\t\tans=(\"10\"*x)[:x-1]\n\tfor c in ans:\n\t\tif c==\"0\":\n\t\t\ta-=1\n\t\telse:\n\t\t\tb-=1\n\tif len(ans)==0 or ans[-1]==\"0\":\n\t\tans+=\"1\"*b\n\t\tans+=\"0\"*a\n\telse:\n\t\tans+=\"0\"*a\n\t\tans+=\"1\"*b\n\tprint(ans)\n\nsolve()\n", "a, b, x = [int(x) for x in input().split()]\r\nans = \"\"\r\nif b > x // 2:\r\n mid = \"1\"\r\n bl = False\r\n for i in range(x):\r\n mid += \"1\" if bl else \"0\"\r\n bl = not bl\r\n rem0 = a - mid.count(\"0\")\r\n rem1 = b - mid.count(\"1\")\r\n ans = \"1\" * rem1\r\n if x % 2 == 1:\r\n ans += mid + \"0\" * rem0\r\n else:\r\n ans += mid[:-1] + \"0\" * rem0 + mid[-1]\r\nelse:\r\n mid = \"0\"\r\n bl = True\r\n for i in range(x):\r\n mid += \"1\" if bl else \"0\"\r\n bl = not bl\r\n rem0 = a - mid.count(\"0\")\r\n rem1 = b - mid.count(\"1\")\r\n ans = \"0\" * rem0\r\n if x % 2 == 1:\r\n ans += mid + \"1\" * rem1\r\n else:\r\n ans += mid[:-1] + \"1\" * rem1 + mid[-1]\r\nprint(ans)\r\n", "a,b,x= map(int,input().split())\r\nif x%2==1:\r\n t=x//2+1\r\n print(\"1\"*(b-t)+\"10\"*t+\"0\"*(a-t))\r\nelse:\r\n t=x//2\r\n if b>a:\r\n print(\"10\"*t+\"0\"*(a-t)+\"1\"*(b-t))\r\n else:\r\n print(\"0\"*(a-t)+\"1\"*(b-t)+\"10\"*t)", "z,zz=input,lambda:list(map(int,z().split()));\r\nszz,dgraphs,mod=lambda:sorted(zz()),{},10**9+7\r\nfrom string 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:return 0\r\n return 1\r\ndef dfs(u,visit,graph):\r\n visit[u]=True\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\r\n\r\n\r\n\"\"\"\r\n###########################---START-CODING---##############################\r\n\r\n\r\na,b,x=zz()\r\nif a>b:\r\n c='01'\r\nelse:\r\n c='10'\r\nm=x//2\r\ns=c*m\r\n\r\nif x%2!=(c=='10'):\r\n s+='0'*(a-m)+'1'*(b-m)\r\nelse:\r\n s+='1'*(b-m)+'0'*(a-m)\r\nprint(s)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "a,b,x = map(int,input().split(' '))\r\nans = \"\"\r\nif(x%2==0):\r\n if(a>b):\r\n ans = \"01\"*(x//2) + '1'*(b-x//2) + '0'*(a-x//2)\r\n else:\r\n ans = \"10\"*(x//2) + '0'*(a-x//2) + '1'*(b-x//2)\r\nelse:\r\n if(a>b):\r\n ans = \"01\"*(x//2) + '0'*(a-x//2) + '1'*(b-x//2)\r\n else:\r\n ans = \"10\"*(x//2) + '1'*(b-x//2) + '0'*(a-x//2)\r\nprint(ans)", "a, b, x = map(int, input().split())\r\n\r\ndef func(a, b, x):\r\n ans = [[] for i in range(x + 1)]\r\n if a >= b:\r\n a2 = a\r\n b2 = b\r\n for i in range(x + 1):\r\n if i % 2 == 0:\r\n ans[i].append(\"0\")\r\n a2 -= 1\r\n else:\r\n ans[i].append(\"1\")\r\n b2 -= 1\r\n ans[0] = [\"0\" for i in range(a2 + 1)]\r\n ans[1] = [\"1\" for i in range(b2 + 1)] \r\n else:\r\n a3 = a\r\n b3 = b\r\n for i in range(x + 1):\r\n if i % 2 == 0:\r\n ans[i].append(\"1\")\r\n b3 -= 1\r\n else:\r\n ans[i].append(\"0\")\r\n a3 -= 1\r\n # print(\"ans =\", ans)\r\n # print(\"a3 =\", a3)\r\n # print(\"b3 =\", b3)\r\n ans[0] = [\"1\" for i in range(b3 + 1)]\r\n ans[1] = [\"0\" for i in range(a3 + 1)]\r\n ans_str = \"\"\r\n for i in ans:\r\n for j in i:\r\n ans_str += j\r\n # print(ans_str)\r\n return ans_str\r\n\r\n# for a in range(1, 3):\r\n # for b in range(1, 3):\r\n # for x in range(1, a + b):\r\n # print(\"%d %d %d %s\" % (a, b, x, func(a, b, x)))\r\nprint(func(a, b, x))", "a, b, x = map(int,input().split())\nal = [0]*a\nbl = [1]*b\nif a > b:\n for i in range(1,x):\n if i&1:\n al.append(bl.pop(0))\n else:\n al.append(al.pop(0))\n if len(bl) == 0:\n al.append(al.pop(0))\nelse:\n for i in range(1,x):\n if i&1:\n bl.append(al.pop(0))\n else:\n bl.append(bl.pop(0))\n if len(al) == 0:\n bl.append(bl.pop(0))\nal.reverse()\nprint(*al,*bl,sep='')\n", "a, b, x = list(map(int, input().split()))\r\nbs = ''\r\n\r\nif x % 2 == 0:\r\n if a > b:\r\n for i in range(x//2):\r\n bs += '01'\r\n bs += (b-x//2) * '1'\r\n bs += (a-x//2) * '0'\r\n else:\r\n for i in range(x//2):\r\n bs += '10'\r\n bs += (a-x//2) * '0'\r\n bs += (b-x//2) * '1'\r\nelif a > b:\r\n for i in range(x // 2):\r\n bs += '01'\r\n bs += (a - x // 2) * '0'\r\n bs += (b - x // 2) * '1'\r\nelse:\r\n for i in range(x // 2):\r\n bs += '10'\r\n bs += (b - x // 2) * '1'\r\n bs += (a - x // 2) * '0'\r\n\r\nprint(bs)", "a,b,x = [int(j) for j in input().split()]\r\n#temp = a+b-1-x\r\ns=\"\"\r\nif(a>=b):\r\n s+=\"0\"\r\n a-=1\r\nelse:\r\n s+=\"1\"\r\n b-=1\r\nk=0\r\nwhile(x!=1 and x!=2):\r\n x=x-1\r\n if(s[k]=='0'):\r\n s+='1'\r\n k+=1\r\n b-=1\r\n else:\r\n s+='0'\r\n k+=1\r\n a-=1\r\nif((s[k]=='0' and x==2) or (s[k]=='1' and x==1)):\r\n while(b>0):\r\n s+='1'\r\n b-=1\r\n while(a>0):\r\n s+='0'\r\n a-=1\r\nelif((s[k]=='0' and x==1) or (s[k]=='1' and x==2)):\r\n while(a>0):\r\n s+='0'\r\n a-=1\r\n while(b>0):\r\n s+='1'\r\n b-=1\r\n\r\n\r\n \r\nprint(s)\r\n", "def solve(a, b, x):\r\n\r\n d = x // 2\r\n\r\n if x % 2 == 0 and x // 2 != a:\r\n d -= 1\r\n print(\"0\", end=\"\")\r\n a -= 1\r\n\r\n for i in range(d):\r\n print(\"10\", end=\"\")\r\n\r\n a -= d\r\n b -= d\r\n\r\n for i in range(b):\r\n print('1', end=\"\")\r\n\r\n for i in range(a):\r\n print('0', end=\"\")\r\n\r\n print()\r\n\r\n\r\na, b, x = map(int, input().split())\r\n\r\nsolve(a, b, x)\r\n", "n = list(map(int, input().split()))\r\nlst = 1\r\nif n[1] > n[0]:\r\n lst = 0\r\nfor _ in range(0, n[2]):\r\n lst = 1-lst\r\n n[lst] -= 1\r\n print(lst, end=\"\")\r\nfor _ in range(0, n[lst]):\r\n print(lst, end=\"\")\r\nlst = 1-lst\r\nfor _ in range(0, n[lst]):\r\n print(lst, end=\"\")\r\n", "a,b,x=map(int,input().split())\r\ns=\"\"\r\ntemp=-1\r\nif a>b:\r\n for i in range(x):\r\n if i%2==0:\r\n s+=\"0\"\r\n a-=1\r\n temp=0\r\n else:\r\n s+=\"1\"\r\n b-=1\r\n temp=1\r\n if temp==0:\r\n for i in range(a):\r\n s+=\"0\"\r\n for i in range(b):\r\n s+=\"1\"\r\n else:\r\n for i in range(b):\r\n s+=\"1\"\r\n for i in range(a):\r\n s+=\"0\"\r\n print(s)\r\nelse:\r\n for i in range(x):\r\n if i%2==0:\r\n s+=\"1\"\r\n b-=1\r\n temp=1\r\n else:\r\n s+=\"0\"\r\n a-=1\r\n temp=0\r\n if temp==0:\r\n for i in range(a):\r\n s+=\"0\"\r\n for i in range(b):\r\n s+=\"1\"\r\n else:\r\n for i in range(b):\r\n s+=\"1\"\r\n for i in range(a):\r\n s+=\"0\"\r\n print(s)", "\r\nn,m,k=map(int,input().split())\r\nif k%2==0 and n>m:\r\n print('01'*(k//2) +(m-(k//2))*'1' +(n-(k//2))*'0')\r\nelif k%2==0 and n<=m:\r\n print('10'*(k//2) +(n-(k//2))*'0' +(m-(k//2))*'1')\r\nelif k%2!=0 and n>m:\r\n print('01'*(k//2) +(n-(k//2))*'0' +(m-(k//2))*'1')\r\nelse:\r\n print('10'*(k//2) +(m-(k//2))*'1' +(n-(k//2))*'0')\r\n", "a, b, x = map(int, input().split())\n\noutput = \"\"\ncurrent_digit = 0\nfor i in range(x - 1):\n output += str(1 - current_digit)\n current_digit = 1 - current_digit\n if current_digit == 0:\n a -= 1\n else:\n b -= 1\n\nif b == 0:\n output = \"0\" + output\n a -= 1\n\nif current_digit == 0:\n print(output + \"1\" * b + \"0\" * a)\nelse:\n print(output + \"0\" * a + \"1\" * b)", "a, b, x = map(int, input().split())\r\nresult = []\r\nif a > b:\r\n result.append(0)\r\n a -= 1\r\nelse:\r\n result.append(1)\r\n b -= 1\r\nwhile x > 1:\r\n if result[-1] == 0:\r\n result.append(1)\r\n b -= 1\r\n else:\r\n result.append(0)\r\n a -= 1\r\n x -= 1\r\nif result[-1] == 0:\r\n for _ in range(a):\r\n result.append(0)\r\n for _ in range(b):\r\n result.append(1)\r\nelse:\r\n for _ in range(b):\r\n result.append(1)\r\n for _ in range(a):\r\n result.append(0)\r\nprint(\"\".join(str(x) for x in result))", "from bisect import bisect_right\r\nimport math\r\nfrom queue import PriorityQueue\r\nfrom sys import stdin, stdout\r\nimport collections\r\ninput, print = stdin.readline, stdout.write\r\n \r\n \r\ndef str_input():\r\n s = input()\r\n return s[:len(s)-1]\r\n \r\n \r\ndef char_list_input():\r\n s = input()\r\n return list(s[:len(s)-1])\r\n \r\n \r\ndef list_input(type):\r\n return list(map(type, input().split()))\r\n \r\n \r\ndef multi_input():\r\n return map(int, input().split())\r\n \r\n \r\ndef main():\r\n a, b, k = multi_input()\r\n ans = \"\"\r\n if k&1:\r\n if a>b:\r\n ans = (\"01\" * (k//2)) + (\"0\" * (a-k//2)) + (\"1\" * (b-k//2))\r\n else:\r\n ans = (\"10\" * (k//2)) + (\"1\" * (b-k//2)) + (\"0\" * (a-k//2))\r\n else:\r\n if a>b:\r\n ans = (\"01\" * (k//2)) + (\"1\" * (b-k//2)) + (\"0\" * (a-k//2))\r\n else:\r\n ans = (\"10\" * (k//2)) + (\"0\" * (a-k//2)) + (\"1\" * (b-k//2))\r\n print(f\"{ans}\\n\")\r\n \r\n \r\nif __name__ == \"__main__\":\r\n main()\r\n ", "import math\r\na,b,x = map(int, input().strip().split(' '))\r\n#n=int(input())\r\n#lst = list(map(int, input().strip().split(' ')))\r\ns=''\r\nf=0\r\nif a>b:\r\n f=1\r\n for j in range(x+1):\r\n if j%2==0:\r\n s+='0'\r\n a-=1\r\n else:\r\n s+='1'\r\n b-=1 \r\nelse:\r\n f=2\r\n for j in range(x+1):\r\n if j%2==0:\r\n s+='1'\r\n b-=1\r\n else:\r\n s+='0'\r\n a-=1\r\nk1='0'*a\r\nk2='1'*b\r\nif f==1:\r\n print(k1+s[0]+k2+s[1:])\r\nelif f==2:\r\n print(k2+s[0]+k1+s[1:])", "a, b, x=[int(k) for k in input().split()]\r\nres=\"\"\r\nz=((x+1)//2)\r\nif x%2==1:\r\n res=\"0\"*(a-z)+\"01\"*z+\"1\"*(b-z)\r\nelif a>b:\r\n res=\"0\"*(a-z-1)+\"01\"*z+\"1\"*(b-z)+\"0\"\r\nelse:\r\n res=\"1\"+\"0\"*(a-z)+\"01\"*z+\"1\"*(b-z-1)\r\nprint(res)", "a,b,n=map(int,input().split())\r\nif(n%2==0):\r\n if(a>=b):\r\n print(\"01\"*int(n/2),'1'*(b-int(n/2)),'0'*(a-int(n/2)),sep=\"\")\r\n else:\r\n print(\"10\"*int(n/2),'0'*(a-int(n/2)),'1'*(b-int(n/2)),sep=\"\")\r\nelse:\r\n if(a>=b):\r\n print(\"01\"*int((n-1)/2),'0'*(a-int((n-1)/2)),'1'*(b-int((n-1)/2)),sep=\"\")\r\n else:\r\n print(\"10\"*int((n-1)/2),'1'*(b-int((n-1)/2)),'0'*(a-int((n-1)/2)),sep=\"\")", "a,b,x = map(int,input().split())\r\nif x%2 == 0:\r\n if a > b:\r\n print('01'*(x//2) + '1'*(b-x//2) + '0'*(a-x//2))\r\n else:\r\n print('10'*(x//2) + '0'*(a-x//2) + '1'*(b-x//2))\r\nelse:\r\n if a > b:\r\n print('01'*(x//2) + '0'*(a-x//2) + '1'*(b-x//2))\r\n else:\r\n print('10'*(x//2) + '1'*(b-x//2) + '0'*(a-x//2))\r\n", "a,b,x=map(int,input().split())\r\nt=\"10\";x-=1;a-=1;b-=1\r\nwhile x>0:\r\n if x==1:\r\n if b!=0:\r\n t+=\"0\"*a+\"1\"*b\r\n x=0;a=0;b=0\r\n else:\r\n t=\"0\"*a+t\r\n a=0;x=0\r\n \r\n else:\r\n t+=\"10\"\r\n x-=2;a-=1;b-=1\r\nt=\"1\"*b+t+\"0\"*a\r\nprint(t)\r\n ", "a, b, x = map(int, input().split())\r\nn = a+b\r\nans = []\r\n\r\n\r\nif x % 2 == 0:\r\n if a > b:\r\n for _ in range(x//2):\r\n ans.append('01')\r\n\r\n for _ in range(b - x//2):\r\n ans.append('1')\r\n for _ in range(a - x//2):\r\n ans.append('0')\r\n\r\n else:\r\n for _ in range(x // 2):\r\n ans.append('10')\r\n for _ in range(a - x//2):\r\n ans.append('0')\r\n for _ in range(b - x//2):\r\n ans.append('1')\r\n\r\nelse:\r\n if a > b:\r\n for _ in range(x//2):\r\n ans.append('01')\r\n for _ in range(a - x//2):\r\n ans.append('0')\r\n for _ in range(b - x//2):\r\n ans.append('1')\r\n\r\n else:\r\n for _ in range(x // 2):\r\n ans.append('10')\r\n\r\n for _ in range(b - x//2):\r\n ans.append('1')\r\n for _ in range(a - x//2):\r\n ans.append('0')\r\n\r\n\r\nprint(\"\".join(map(str, ans)))\r\n", "a, b, x = map(int, input().split())\r\nans = ''\r\nif a>b:\r\n now = 0\r\nelse:\r\n now = 1\r\nfor i in range(x+1):\r\n ans += str(now)\r\n if now==0:\r\n a -= 1\r\n else:\r\n b -= 1\r\n now = 1-now\r\nidx = ans.find('0')\r\nans = ans[:idx] + '0'*a + ans[idx:]\r\nidx = ans.find('1')\r\nans = ans[:idx] + '1'*b + ans[idx:]\r\nprint(ans)", "if __name__ == \"__main__\":\r\n a, b, x = map(int, input().split())\r\n n = a + b\r\n s = \"\"\r\n\r\n if x == 1:\r\n s += \"0\" * a + \"1\" * b\r\n print(s)\r\n else:\r\n ok = 0\r\n if a >= b:\r\n ok = 1\r\n\r\n while x > 0:\r\n if ok:\r\n if a > 0:\r\n s += \"0\"\r\n a -= 1\r\n x -= 1\r\n cnt = 1\r\n else:\r\n break\r\n\r\n if x == 0:\r\n break\r\n\r\n if b > 0:\r\n s += \"1\"\r\n b -= 1\r\n x -= 1\r\n cnt = -1\r\n else:\r\n break\r\n\r\n if x == 0:\r\n break\r\n else:\r\n if b > 0:\r\n s += \"1\"\r\n b -= 1\r\n x -= 1\r\n cnt = -1\r\n else:\r\n break\r\n\r\n if x == 0:\r\n break\r\n\r\n if a > 0:\r\n s += \"0\"\r\n a -= 1\r\n x -= 1\r\n cnt = 1\r\n else:\r\n break\r\n\r\n if x == 0:\r\n break\r\n\r\n if cnt == -1:\r\n s += \"1\" * b + \"0\" * a\r\n print(s)\r\n else:\r\n s += \"0\" * a + \"1\" * b\r\n print(s)", "a,b,x = map(int,input().split())\r\nx+=1\r\nr = '01'*(x//2)\r\no,z = x//2,x//2\r\na,b=a-z,b-o\r\nif x%2==1:\r\n if a>0:\r\n r +='0'\r\n a-=1\r\n else:\r\n r='1'+r\r\n b-=1\r\nd={'0':a,'1':b}\r\nr = r[0]+r[0]*d[r[0]]+r[1]+r[1]*d[r[1]]+r[2:]\r\nprint(r)", "a, b, x = map(int, input().split())\r\n\r\nif x % 2 == 0:\r\n\tans = '1' * (b - x // 2) + '0' * (a - x // 2 + 1)\r\n\r\n\tcnt = x // 2 + x // 2 - 1\r\n\twhile True:\r\n\t\tif cnt == 0:\r\n\t\t\tbreak\r\n\t\tans += '1'\r\n\t\tcnt -= 1\r\n\r\n\t\tif cnt == 0:\r\n\t\t\tbreak\r\n\t\tans += '0'\r\n\t\tcnt -= 1\r\n\r\n\tif b - x // 2 == 0:\r\n\t\tans = ans[1:] + ans[0]\r\n\r\nelif x % 2 == 1:\r\n\tans = '1' * (b - x // 2) + '0' * (a - x // 2)\r\n\r\n\tcnt = x // 2 + x // 2\r\n\twhile True:\r\n\t\tif cnt == 0:\r\n\t\t\tbreak\r\n\t\tans += '1'\r\n\t\tcnt -= 1\r\n\r\n\t\tif cnt == 0:\r\n\t\t\tbreak\r\n\t\tans += '0'\r\n\t\tcnt -= 1\r\n\r\nprint(ans)", "a,b,x=map(int,input().split())\r\nif x%2!=0:\r\n print('1'*(b-((x+1)//2))+'10'*((x+1)//2)+'0'*(a-((x+1)//2)))\r\nelse:\r\n a-=(x)//2\r\n b-=(x)//2\r\n if b==0:\r\n print('0'+'1'*(b)+'10'*((x)//2)+'0'*(a-1))\r\n else:\r\n print('1'*(b-1)+'10'*((x)//2)+'0'*(a)+'1')", "a,b,x=map(int,input().split())\r\nr,l=(x+1)//2,\"\"\r\nif x%2==1:l+=\"10\"*r;l=\"1\"*(b-r)+l+\"0\"*(a-r)\r\nelse:\r\n if a<=r:l+=\"1\";b-=1\r\n l+=\"01\"*r\r\n l+=\"1\"*(b-r)+\"0\"*(a-r)\r\nprint(l)", "a,b,x=[int(x) for x in input().split()]\r\ns1=''\r\ns2=''\r\ns3=''\r\ns4=''\r\nif (a>b):\r\n for i in range(x+1):\r\n if i%2==0:\r\n s1+='0'\r\n a-=1\r\n else:\r\n s1+='1'\r\n b-=1\r\n for i in range(a):\r\n s2+='0'\r\n s2+=s1\r\n for i in range(b):\r\n s3+='1'\r\n for i in range(len(s2)):\r\n s4+=s2[i]\r\n if (s2[i]=='1'):\r\n loc=i\r\n break\r\n s4+=s3\r\n s4+=s2[loc+1:len(s2)]\r\n print(s4) \r\nelse:\r\n for i in range(x+1):\r\n if i%2==0:\r\n s1+='1'\r\n b-=1\r\n else:\r\n s1+='0'\r\n a-=1\r\n for i in range(b):\r\n s2+='1'\r\n s2+=s1\r\n for i in range(a):\r\n s3+='0'\r\n for i in range(len(s2)):\r\n s4+=s2[i]\r\n if (s2[i]=='0'):\r\n loc=i\r\n break\r\n s4+=s3\r\n s4+=s2[loc+1:len(s2)]\r\n print(s4) ", "*a,x=map(int,input().split())\r\nx+=1\r\ny=x//2\r\nc=2\r\nif x%2:\r\n c=a[0]<a[1];a[c]-=1\r\ns='0'*(a[0]-y)+'01'*y+'1'*(a[1]-y)\r\nprint((s+'0','1'+s,s)[c])", "from sys import stdin, stdout\r\n\r\nget_string = lambda: stdin.readline().strip('\\n')\r\nget_intmap = lambda: map( int, get_string().split(' ') )\r\n#get_intmap\r\n\r\ndef ncr_generator(n,r):\r\n ncrr = 1\r\n while True:\r\n yield ncrr\r\n n += 1\r\n ncrr = ( ncrr * n // (n - r) ) \r\n\r\ndef testcase():\r\n a,b,x = get_intmap()\r\n q,r = divmod(x,2)\r\n if r==0:# x is even\r\n if a > b: s = '01'*q + '1'*(b - q) + '0'*(a - q)\r\n else: s = '10'*q + '0'*(a - q) + '1'*(b - q)\r\n else:\r\n if a > b: s = '01'*q + '0'*(a - q) + '1'*(b - q)\r\n else: s = '10'*q + '1'*(b - q) + '0'*(a - q)\r\n print(s)\r\n\r\n \r\n\r\ntestcase()\r\n#for t in range(int(input())):\r\n# testcase()\r\n" ]

[ "from math import floor\na,b,x1,y1,x2,y2=map(int,input().split())\na*=2\nb*=2\nfl=floor\nx11=fl((y1-x1)/b)\ny11=fl((y1+x1)/a)\nx22=fl((y2-x2)/b)\ny22=fl((y2+x2)/a)\n# print(x11,y11)\n# print(x22,y22)\nl1=abs(x11-x22)\nl2=abs(y11-y22)\n# l1,l2=min(l1,l2),max(l1,l2)\nif (abs(x1+y1)%a==0 or abs(x1-y1)%b==0) and (abs(x2+y2)%a==0 or abs(x2-y2)%b==0):\n print(max(l1,l2)+1)\nelse:\n print(max(l1,l2))\n\t\t \t\t\t\t \t \t\t\t \t", "from sys import stdin\r\ninp = stdin.readline\r\n\r\na, b, x1, y1, x2, y2 = map(int, inp().split())\r\n\r\nm = max(x1+y1, x2+y2) % (2*a)\r\nx = abs(x1+y1 - x2-y2)\r\nif x >= m:\r\n ansA = (x - m)//(2*a) + 1\r\nelse:\r\n ansA = 0\r\n\r\nm = max(x1-y1, x2-y2) % (2*b)\r\nx = abs(x1-y1 - x2+y2)\r\nif x >= m:\r\n ansB = (x - m)//(2*b) + 1\r\nelse:\r\n ansB = 0\r\n\r\nprint(max(ansA, ansB))\r\n", "a,b,x1,y1,x2,y2 = map(int,input().split())\r\ns = abs((x1 + y1) // (2 * a) - (x2 + y2) // (2 * a))\r\ns = max(s,abs((x1 - y1) // (2 * b) - (x2 - y2) // (2 * b)))\r\nprint(s)", "def f(a,b,x,y,z,w):\r\n c=(x+y) // (2*a)\r\n d=(z+w) // (2*a)\r\n e=(x-y) // (2*b) \r\n f=(z-w) // (2*b)\r\n return max(abs(c-d),abs(e-f))\r\na,b,x,y,z,w=map(int,input().split())\r\nprint(f(a,b,x,y,z,w))", "import sys\nreadline=sys.stdin.readline\n\na,b,x0,y0,x1,y1=map(int,readline().split())\nX0,X1=x0+y0,x1+y1\nif X0>X1:\n X0,X1=X1,X0\nY0,Y1=x0-y0,x1-y1\nif Y0>Y1:\n Y0,Y1=Y1,Y0\nans=max(X1//(2*a)-(X0-1)//(2*a),Y1//(2*b)-(Y0-1)//(2*b))\nprint(ans)", "a,b,x1,y1,x2,y2 = map(int,input().split())\n\na1 = x1+y1\na2 = x2+y2\n\nb1 = x1-y1\nb2 = x2-y2\n\nad = a2//(2*a) - a1//(2*a)\nbd = b2//(2*b) - b1//(2*b)\n\nprint(max(abs(ad),abs(bd)))\n", "a, b, x1, y1, x2, y2 = list(map(int, input().split()))\r\nprint(max(abs((x1 + y1) // (2 * a) - (x2 + y2) // (2 * a)), abs((x1 - y1) // (2 * b) - (x2 - y2) // (2 * b))))", "a, b, x1, y1, x2, y2=[int(k) for k in input().split()]\r\nx1+=10**10*a*b\r\nx2+=10**10*a*b\r\ny1+=10**10*a*b\r\ny2+=10**10*a*b\r\nres=0\r\nx=abs((x2+y2)//(2*a)-(x1+y1)//(2*a))\r\ny=abs((x2-y2)//(2*b)-(x1-y1)//(2*b))\r\nprint(max(x, y))", "a, b, x1, y1, x2, y2 = map(int, input().split())\nX1, Y1 = x1 + y1, x1 - y1\nX2, Y2 = x2 + y2, x2 - y2\nA, B = 2 * a, 2 * b\n\n\ndef solve(x, y, z):\n if x >= 0 > y or x < 0 <= y:\n x = max(x, -x)\n y = max(y, -y)\n tmp = x // z - (x % z == 0) + y // z - (y % z == 0) + 1\n return tmp\n else:\n if x < y:\n x, y = y, x\n tmp = x // z - (x % z == 0) - y // z - (y % z == 0)\n return tmp\n\n\nans1 = solve(X1, X2, A)\nans2 = solve(Y1, Y2, B)\n\nprint(max(ans1, ans2))\n", "a,b,x1,y1,x2,y2=[int(e) for e in input().split()]\r\nx1,y1=x1+y1,y1-x1\r\nx2,y2=x2+y2,y2-x2\r\na*=2\r\nb*=2\r\nx1=(-1 if x1<0 else 1)*(abs(x1)//a)+(x1>0)\r\ny1=(-1 if y1<0 else 1)*(abs(y1)//b)+(y1>0)\r\nx2=(-1 if x2<0 else 1)*(abs(x2)//a)+(x2>0)\r\ny2=(-1 if y2<0 else 1)*(abs(y2)//b)+(y2>0)\r\nprint(max(abs(x2-x1),abs(y2-y1)))" ]

[ "import sys\n\n\n\ninp = sys.stdin.read().splitlines()\n\nn,k = list(map(int,inp[0].split()))\n\nlst = list(map(int,inp[1].split()))\n\nlst.sort()\n\ntotal = sum(lst)\n\nlower = int(total/n)\n\nnupper = total%n\n\n\n\nif nupper == 0:\n\n\tupper = lower;\n\nelse:\n\n\tupper = lower+1;\n\nnlower = n - nupper;\n\n\n\ni = 0;\n\nwhile i<n and lst[i]<lower:\n\n\ti+=1\n\nlow1st = i; \n\n\n\ni = n-1;\n\nwhile i>=0 and lst[i]>upper:\n\n\ti-=1\n\nuplast = i;\n\n\n\nlowerfill = low1st*lower - sum(lst[:low1st]) \n\n\n\nupperfill = sum(lst[uplast+1:]) - (n-uplast-1)*upper\n\n\n\ntotalsteps = (lowerfill+upperfill)/2\n\n'''\n\nprint(\"nlower = %d\"%nlower)\n\nprint(\"nupper = %d\"%nupper)\n\nprint(\"lower = %d\"%lower)\n\nprint(\"upper = %d\"%upper)\n\nprint(\"lowerfill = %d\"%lowerfill)\n\nprint(\"upperfill = %d\"%upperfill)\n\nprint(\"totalsteps = %f\"%totalsteps)\n\n'''\n\ndef filllower():\n\n\tkk = k\n\n\tcur = lst[0]\n\n\ti = 0\n\n\twhile (kk>0):\n\n\t\twhile (lst[i]==cur):\n\n\t\t\ti+=1\n\n\t\t\t#print(\"i=%d,lst[i]=%d\"%(i,lst[i]))\n\n\t\tdiff = lst[i] - lst[i-1]\n\n\t\tkk -= i*diff\n\n\t\t#print(\"lower kk = %d\",kk)\n\n\t\tif kk == 0:\n\n\t\t\tcur = lst[i]\n\n\t\t\tbreak\n\n\t\telif kk<0:\n\n\t\t\tcur = lst[i]-int(-kk/i)-1\n\n\t\t\t#print(\"-kk/i = %d\",int(-kk/i))\n\n\t\t\tif (-kk%i) ==0:\n\n\t\t\t\tcur += 1\n\n\t\t\tbreak\n\n\t\tcur = lst[i]\n\n\t#print(\"min = \",cur)\n\n\treturn cur\n\n\n\ndef fillupper():\n\n\tkk = k\n\n\ti = n-1\n\n\tcur = lst[i]\n\n\twhile (kk>0):\n\n\t\twhile (lst[i]==cur):\n\n\t\t\ti-=1\n\n\t\t\t#print(\"i=%d,lst[i]=%d\"%(i,lst[i]))\n\n\t\tdiff = lst[i+1] - lst[i]\n\n\t\tkk -= (n-i-1)*diff\n\n\t\t#print(\"upper kk = \",kk)\n\n\t\tif kk == 0:\n\n\t\t\tcur = lst[i-1]\n\n\t\t\tbreak\n\n\t\telif kk<0:\n\n\t\t\tcur = lst[i]+int(-kk/(n-i-1))\n\n\t\t\tif (-kk%(n-i-1)!=0):\n\n\t\t\t\tcur += 1;\n\n\t\t\tbreak\n\n\t\tcur = lst[i]\n\n\t#print(\"max = \",cur)\n\n\treturn cur\n\n\n\nif totalsteps>=k:\n\n\tprint(fillupper()-filllower())\n\nelse:\n\n\tprint(upper-lower)\n\n\n\n\n\n\n\n'''\n\n\n\n\n\ndef sortmax():\n\n\tv = lst[-1]\n\n\ti = n-2\n\n\twhile(i>=0):\n\n\t\tif lst[i]<=v:\n\n\t\t\tlst[-1]=lst[i+1]\n\n\t\t\tlst[i+1]=v\n\n\t\t\treturn\n\n\t\ti-=1\n\n\tlst[-1]=lst[0]\n\n\tlst[0]=v\n\n\n\ndef sortmin():\n\n\tv = lst[0]\n\n\ti = 1\n\n\twhile(i<n):\n\n\t\tif lst[i]>=v:\n\n\t\t\tlst[0]=lst[i-1]\n\n\t\t\tlst[i-1]=v\n\n\t\t\treturn\n\n\t\ti+=1\n\n\tlst[0]=lst[-1]\n\n\tlst[-1]=v\n\n\n\n\n\nlst.sort()\n\nwhile k:\n\n\tlst[-1]-=1\n\n\tsortmax()\n\n\t#print(lst)\n\n\tlst[0]+=1\n\n\tsortmin()\n\n\tif (lst[-1]-lst[0])<=1:\n\n\t\tbreak\n\n\t#print(lst)\n\n\tk-=1\n\n\n\n\n\nprint(lst[-1]-lst[0])\n\n\n\n\n\n'''\n\n\n\n# Made By Mostafa_Khaled", "import sys\nsys.stderr = sys.stdout\n\n\ndef hood(n, k, C):\n C.sort()\n m, r = divmod(sum(C), n)\n m1 = (m + 1) if r else m\n\n c_lo = C[0]\n k_lo = k\n for i, c in enumerate(C):\n if c_lo == m:\n break\n c_m = min(c, m)\n dc = c_m - c_lo\n dk = i * dc\n if k_lo >= dk:\n k_lo -= dk\n c_lo = c_m\n else:\n dc = k_lo // i\n c_lo += dc\n break\n\n c_hi = C[-1]\n k_hi = k\n for i, c in enumerate(reversed(C)):\n if c_hi == m1:\n break\n c_m1 = max(c, m1)\n dc = c_hi - c_m1\n dk = i * dc\n if k_hi >= dk:\n k_hi -= dk\n c_hi = c_m1\n else:\n dc = k_hi // i\n c_hi -= dc\n break\n\n return c_hi - c_lo\n\n\ndef main():\n n, k = readinti()\n C = readintl()\n print(hood(n, k, 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", "import sys\r\n\r\ninp = sys.stdin.read().splitlines()\r\nn,k = list(map(int,inp[0].split()))\r\nlst = list(map(int,inp[1].split()))\r\nlst.sort()\r\ntotal = sum(lst)\r\nlower = int(total/n)\r\nnupper = total%n\r\n\r\nif nupper == 0:\r\n\tupper = lower;\r\nelse:\r\n\tupper = lower+1;\r\nnlower = n - nupper;\r\n\r\ni = 0;\r\nwhile i<n and lst[i]<lower:\r\n\ti+=1\r\nlow1st = i; \r\n\r\ni = n-1;\r\nwhile i>=0 and lst[i]>upper:\r\n\ti-=1\r\nuplast = i;\r\n\r\nlowerfill = low1st*lower - sum(lst[:low1st]) \r\n\r\nupperfill = sum(lst[uplast+1:]) - (n-uplast-1)*upper\r\n\r\ntotalsteps = (lowerfill+upperfill)/2\r\n\r\ndef filllower():\r\n\tkk = k\r\n\tcur = lst[0]\r\n\ti = 0\r\n\twhile (kk>0):\r\n\t\twhile (lst[i]==cur):\r\n\t\t\ti+=1\r\n\t\tdiff = lst[i] - lst[i-1]\r\n\t\tkk -= i*diff\r\n\t\tif kk == 0:\r\n\t\t\tcur = lst[i]\r\n\t\t\tbreak\r\n\t\telif kk<0:\r\n\t\t\tcur = lst[i]-int(-kk/i)-1\r\n\t\t\tif (-kk%i) ==0:\r\n\t\t\t\tcur += 1\r\n\t\t\tbreak\r\n\t\tcur = lst[i]\r\n\treturn cur\r\n\r\ndef fillupper():\r\n\tkk = k\r\n\ti = n-1\r\n\tcur = lst[i]\r\n\twhile (kk>0):\r\n\t\twhile (lst[i]==cur):\r\n\t\t\ti-=1\r\n\t\tdiff = lst[i+1] - lst[i]\r\n\t\tkk -= (n-i-1)*diff\r\n\t\tif kk == 0:\r\n\t\t\tcur = lst[i-1]\r\n\t\t\tbreak\r\n\t\telif kk<0:\r\n\t\t\tcur = lst[i]+int(-kk/(n-i-1))\r\n\t\t\tif (-kk%(n-i-1)!=0):\r\n\t\t\t\tcur += 1;\r\n\t\t\tbreak\r\n\t\tcur = lst[i]\r\n\treturn cur\r\n\r\nif totalsteps>=k:\r\n\tprint(fillupper()-filllower())\r\nelse:\r\n\tprint(upper-lower)\r\n" ]

[ "inp = input().split()\r\nlis = [eval(i) for i in inp]\r\n\r\nk = lis[1]\r\n\r\nn = 5\r\na,b=0,lis[0]\r\nfor i in range(lis[0]):\r\n if(k<240 and k+((i+1)*5)<=240):\r\n k+=n\r\n n+=5\r\n else:break\r\n a=i+1\r\n\r\nprint(int(a))", "def solve(n, k):\r\n l = 240 - k\r\n for i in range(1, n+1):\r\n if l >= 5*i:\r\n l -= 5*i\r\n else:\r\n return i-1\r\n return n\r\n\r\n\r\nn, k = list(map(int, input().split()))\r\nprint(solve(n, k))", "Q, min = input().split()\r\nQsolvinTime = 0\r\ncount = 0\r\nqmin = 5\r\nfor i in range(int(Q)):\r\n QsolvinTime += qmin\r\n if 240 - int(min) >= QsolvinTime:\r\n qmin += 5\r\n count += 1\r\n else:\r\n break\r\nprint(count)", "inp = input().split()\r\nproblems = int(inp[0])\r\ntimes = int(inp[1])\r\ntotaltime=240\r\ntimeleft=totaltime-times\r\ncount=0\r\nfor i in range(1,problems+1):\r\n problemtime=5*i\r\n if problemtime<=timeleft:\r\n count+=1\r\n timeleft-=problemtime\r\n\r\n else :\r\n break\r\n\r\nprint(count) ", "l=list(map(int,input().split()))\r\nn=0\r\ntotal=0\r\nfor i in range(1,l[0]+1):\r\n total=total+5*i\r\n if total+l[1]<=240:\r\n n=n+1\r\nprint(n)\r\n\r\n\r\n\r\n", "a,b = map(int,input().split())\r\nsum = 240 - b\r\ncount = 0\r\nfor i in range(1,a+1):\r\n if sum >= 5*i:\r\n sum -= 5*i\r\n count += 1\r\nprint(count)", "def max_problems_solved(n, k):\r\n total_time = 0\r\n problems_solved = 0\r\n\r\n for i in range(1, n + 1):\r\n problem_time = 5 * i\r\n if total_time + problem_time + k <= 240:\r\n total_time += problem_time\r\n problems_solved += 1\r\n else:\r\n break\r\n\r\n return problems_solved\r\n\r\nn, k = map(int, input().split())\r\nmax_solved = max_problems_solved(n, k)\r\nprint(max_solved)", "import math\r\nn, k = [int(i) for i in input().split(\" \")]\r\nx = math.floor((-1 + math.sqrt(1+4*(96-2/5*k)))/2)\r\nprint(min(x, n))\r\n", "n, k = [int(x) for x in input().split()]\r\nmins = 60 * 4 - k\r\ncount = 0\r\n\r\nfor x in range(1, n + 1):\r\n if mins - (x*5) > - 1:\r\n count += 1\r\n mins -= x*5\r\n\r\nprint(count)\r\n", "n,k=list(map(int,input().split()))\r\ns=240-k\r\nc=0\r\nb=0\r\nfor i in range(1,n+1):\r\n c=c+i*5\r\n if c<=s:\r\n b=b+1\r\n else:\r\n break\r\nprint(b)", "n, k = list(map(int, input().split()))\r\ni = 1\r\nwhile((5*i*(i+1)/2 + k)<= 240):\r\n i+=1\r\nif(i>n): i = n+1\r\nprint(i-1)", "def max_problems(n, k):\r\n total_time = k \r\n max_time_solving_problems = 240 - total_time\r\n problems_solved = 0\r\n\r\n for i in range(1, n + 1):\r\n times = 5 * i\r\n if max_time_solving_problems >= times:\r\n max_time_solving_problems -= times\r\n problems_solved += 1\r\n else:\r\n break\r\n\r\n return problems_solved\r\n\r\n\r\nn, k = map(int, input().split())\r\n\r\n\r\nprint(max_problems(n, k))\r\n", "tasks, way = map(int, input().split())\r\nmax_time = 240\r\ntotal_time = way\r\ncounter = 0\r\nwhile total_time <= max_time and counter <= tasks:\r\n total_time += 5 * (1 + counter)\r\n counter += 1\r\nprint(counter-1)", "n, k = map(int, input().split())\r\ntime = 4 * 60 - k\r\nfor i in range(1, n + 1):\r\n time -= 5 * i\r\n if time < 0:\r\n print(i - 1)\r\n break\r\nelse:\r\n print(n)", "n,k = map(int, input().split())\r\nk = 240-k\r\ni = 1\r\nwhile k>=0:\r\n k -= 5*i\r\n i += 1*(k>=0)\r\nprint(i-1 if n>i-1 else n)", "n, k = map(int, input().split())\r\ntime_left = 240 - k\r\nproblems_solved = 0\r\nproblem_number = 1\r\n \r\nwhile problem_number <= n and time_left >= problem_number * 5:\r\n time_left -= problem_number * 5\r\n problems_solved += 1\r\n problem_number += 1\r\n \r\nprint(problems_solved)", "total=240\r\nn,k=map(int,input().split())\r\nc=0 \r\nt=0 \r\nfor i in range(1,n+1):\r\n t+=5*i\r\n c+=1 \r\n if (k+t)>total:\r\n k-=5*i \r\n c-=1 \r\n break\r\nprint(c)", "n,k=map(int,input().split())\r\nt,p=0,0\r\nfor i in range(1,n+1):\r\n t+=5*i\r\n if t>240-k:\r\n p=i-1\r\n break\r\n else:\r\n p=n\r\nprint(p)", "n, k = map(int, input().split())\r\n\r\ntime = 240 - k\r\nc = 0\r\nfor i in range (1, n+1):\r\n if 5*i <= time:\r\n c = c+1\r\n time = time - (5*i)\r\nprint(c)", "n, k = map(int, input().split())\r\nt = 240 - k\r\nx = (-1 + (1 + 8 * t / 5) ** .5) / 2\r\nprint(min(n, int(x)))\r\n", "inp = input().split(); n, k = int(inp[0]), int(inp[1])\nt = 0\ncount=0\nfor i in range(1,n+1):\n if t + 5*i<=(240-k):\n t+=5*i\n count+=1\nprint(count)\n", "n, k = map(int, input().split())\r\ntime = 4 * 60 - k\r\nsolved = 0\r\nfor i in range(1, n+1):\r\n if i * 5 <= time:\r\n time -= i * 5\r\n solved += 1\r\n else:\r\n break\r\nprint(solved)", "a , n = map(int , input().split())\r\ncount_problems = 0\r\ncount_min = 20 * 60 + n\r\nfor i in range(a):\r\n s = (i+1) * 5\r\n if(count_min + s > 24 * 60):\r\n break\r\n else:\r\n count_min += s\r\n count_problems += 1\r\nprint(count_problems)", "while True:\r\n try:\r\n a, b = map(int, input().split())\r\n b = 240 - b\r\n x = 1\r\n #print(b)\r\n for i in range(1, a + 1):\r\n b -= i * 5\r\n if(b < 0):\r\n print(i - 1)\r\n x = 0\r\n break\r\n if(x):\r\n print(a)\r\n except:\r\n break\r\n", "n,time = input().split()\r\nn = int(n)\r\ntime = int(time)\r\n\r\nk = 240 - time # is remaining time from 4 hours, which is 240 minutes\r\n\r\n# lets store each time in array\r\nque = []\r\nfor i in range(n+1):# since range() is exclusive use n + 1\r\n que.append(i*5)\r\n\r\n# to implement in binary search, lets use their prefix sum\r\nfor i in range(1, len(que)):\r\n que[i] = que[i] + que[i-1]\r\n\r\nlow,high = 0, len(que) - 1\r\nmax = 0\r\n\r\n#if que[mid] > k, change high\r\n# else \r\n# max = index, why?\r\n# because it is the index where we get the maximum number of questions\r\n# it is also updated everytime we get smaller value than k\r\n# lets consider the first example\r\n# n = 4, low = 0, high = 3\r\n# que = [0,5,10, 15, 25] => [0,5,15,30, 55]\r\n# the iteration stops when\r\n# if que[4] > 50 => 30 > 50\r\n# it is false and else part is excecuted\r\n# and finally max will hold index 4\r\nwhile low <= high:\r\n mid = (low + high)//2\r\n if que[mid] > k:\r\n high = mid - 1\r\n else:\r\n low = mid + 1\r\n max = mid\r\n\r\nprint(max,end='')", "n, k = map(int,input().split())\r\nt = 0\r\nc = 0\r\nfor i in range(1, n+1):\r\n t+=i*5\r\n if t<=240-k:\r\n c+=1\r\n\r\nprint(c)", "n, k = [int(elem) for elem in input().split()]\nsum = 0\nres = 0\nfor i in range(1, n+1):\n sum += i * 5\n if 240 - sum < k:\n res = i - 1\n break\n elif 240 - sum == k:\n res = i\n break\n res = i\nprint(res)\n \n", "n, k = map(int, input().split())\r\ntime_required = 0\r\nsolved_problems = 0\r\n\r\nfor i in range(1, n + 1):\r\n time_required += 5 * i\r\n if time_required <= 240 - k:\r\n solved_problems += 1\r\n else:\r\n break\r\n\r\nprint(solved_problems)\r\n#Посчитайте, сколько времени Лимак потратит на решение каждой задачи и суммируйте эти времена.\r\n\r\n#Начиная с первой задачи, проверяйте, если суммарное время решения задач не превышает k. Если да, увеличивайте количество задач, которые он может решить, иначе завершайте проверку.\r\n\r\n#Выведите количество решенных задач.\r\n\r\n#Вот Python-код, который решает эту задачу:", "\r\nn,k=input().split()\r\nd=240-int(k) \r\nc=0\r\nk=0\r\nfor i in range(1,int(n)+1):\r\n if c+(5*i)<=d:\r\n c+=5*i\r\n k+=1\r\n elif c+(5*i)>d:\r\n break\r\nprint(k)", "a,b=map(int,input().split())\r\nhrs=240-b\r\ncnt=0\r\nfor i in range(1,a+1):\r\n hrs-=i*5\r\n if hrs>=0:\r\n cnt+=1\r\n else:break\r\nprint(cnt)", "n, k = map(int, input().split())\r\n\r\ntotal_time = 240 - k # Общее доступное время в минутах\r\nsolved_problems = 0\r\n\r\nfor i in range(1, n + 1):\r\n time_needed = 5 * i # Время, необходимое для решения i-й задачи\r\n if total_time >= time_needed:\r\n total_time -= time_needed\r\n solved_problems += 1\r\n else:\r\n break\r\n\r\nprint(solved_problems)", "n, k = map(int,input().split())\r\ns_min = 60 * 4 - k\r\nans = 0\r\ns = 0\r\nfor i in range(1, n+1):\r\n s += i*5\r\n if s <= s_min:\r\n ans += 1\r\n else:\r\n break\r\nprint(ans)\r\n \r\n \r\n", "nk = input()\r\nn, k = map(int, nk.split(\" \"))\r\nnn = 0\r\ntime_left = 240 - k\r\nproblem_time = 5 \r\n\r\nfor i in range(1, n + 1):\r\n if problem_time * i <= time_left: \r\n nn += 1\r\n time_left -= problem_time * i\r\n else:\r\n break \r\n\r\nprint(nn)", "n, k = [int(x) for x in input().split()]\r\ntime_left = 240 - k \r\ntime_spent = 0\r\nn_tasks = n\r\nfor num in range(1, n + 1):\r\n time_spent += num * 5\r\n if time_spent > time_left:\r\n n_tasks = num - 1\r\n break\r\nprint(n_tasks)", "n,k=map(int,input().split())\r\nnp=0\r\nt=0\r\nts=240-k\r\nfor i in range(1,n+1):\r\n t=t+5*i\r\n if t>ts:\r\n break\r\n np=np+1\r\nprint(np)", "n, k = list(map(int, input().split()))\nt = 240 - k\nres = (-5+(25+4*5*2*t)**(1/2))//10\nif res > n:\n res = n\nprint(int(res))", "problem , req_time = map(int,input().split())\r\nrem_time = 240 - req_time\r\ncount = 0\r\ntime_taken = 0\r\nfor i in range(1,problem+1):\r\n time_taken = time_taken + (i*5)\r\n if time_taken <= rem_time:\r\n count += 1\r\nprint(count)\r\n ", "n,k=map(int,input().strip().split())\r\nt=0\r\ni=1\r\nv=240-k\r\nans=0\r\nwhile t<v:\r\n t+=(5*(i))\r\n i+=1\r\n if t>v:\r\n break\r\n ans+=1\r\n # print(ans,t)\r\n \r\nprint(min(ans,n))", "n,k=map(int,input().split())\r\ntotal_time=0\r\nsolved_problems=0\r\nfor i in range(1,n+1):\r\n total_time+=5*i\r\n if total_time+k<=240:\r\n solved_problems+=1\r\n else:\r\n break\r\nprint(solved_problems)", "n, k = map(int,input().split())\nx = 240 - k\nc = 0\nwhile x > 0 :\n c += 1\n x = x - c * 5\n if n == c :\n break\nif x<0 :\n c-=1\nprint(c)\n\n", "n, k = map(int, input().split())\r\navailable = 60*4-k\r\ni = 1\r\nwhile available-i*5 >= 0 and i <= n:\r\n available-=i*5\r\n i += 1\r\nprint(i-1)", "n,k=map(int,input().split())\r\ntime_left = 240-k\r\nproblem_solved = 0\r\ntime_required = 0\r\nfor i in range(1,n+1):\r\n time_required+= 5*i\r\n if time_required > time_left:\r\n break\r\n problem_solved += 1\r\nprint(problem_solved)", "n, k = map(int, input().split())\r\nc = 0\r\nl = [5, 10, 15, 20, 25, 30, 35, 40, 45, 50]\r\nk = 240 -k\r\ni = 0\r\nwhile(n>0):\r\n if k - l[i]>= 0:\r\n c += 1\r\n k -= l[i]\r\n i += 1\r\n n -= 1\r\nprint(c)", "m = 240\r\nx,y = map(int,input().split())\r\nj = 0\r\nt= 0\r\ni = 0\r\nb = False\r\nwhile i != x+1 :\r\n t += i*5\r\n if t + y > m:\r\n j = i-1\r\n b= True\r\n break\r\n if t + y == m:\r\n j = i\r\n b = True\r\n break\r\n i+=1 \r\nif b == True:\r\n print(j)\r\nelse:\r\n print(x)", "a, b = map(int, input().split())\r\nk = 4 * 60 - b\r\nc = 0\r\nfor i in range(1, a + 1):\r\n k = k - (5 * i)\r\n if k >= 0:\r\n c += 1\r\nprint(c)\r\n", "a,b = map(int,input().split())\r\nd = b\r\nfor i in range(1,a + 1):\r\n\tc = i * 5\r\n\td += c\r\n\tif d > 240:\r\n\t\tprint(i - 1)\r\n\t\tbreak\r\nelse:\r\n\tprint(a)", "# New Year and Hurry\r\ntiempo_medianoche = 240\r\nnums = [int(x) for x in input().split(' ')]\r\nn = nums[0]\r\nt = nums[1]\r\ncant = 0\r\nterminado = False\r\nfor x in range(1, n + 1):\r\n y = 5 * x\r\n if not terminado:\r\n if t + y > tiempo_medianoche:\r\n terminado = True\r\n else:\r\n t += y\r\n cant += 1\r\nprint(cant)\r\n", "x, y = map(int, input().split(' '))\r\nmax = 240\r\nleft = 240-y\r\nquestionC=0\r\nfor i in range(x):\r\n qTime = (i+1)*5\r\n if (left-qTime>=0):\r\n left-=qTime\r\n questionC+=1\r\n \r\n else:\r\n break\r\n\r\nprint (questionC)", "p,m = list(map(int,input().split()))\r\na = 240\r\nb = a-m\r\ncount = 0\r\nfor i in range(1,p+1):\r\n if count == p:\r\n break\r\n else:\r\n if b-(5*i) < 0:\r\n break\r\n else:\r\n b -= (5*i)\r\n count += 1\r\nprint(count)", "import sys\r\n\r\nb = [int(i) for i in sys.stdin.readline().split()]\r\nc = 0\r\nd = 0\r\nfor i in range(1, b[0] + 1):\r\n if c + i * 5 + b[1] <= 240:\r\n c += i * 5\r\n d += 1\r\nprint(d)", "n, k = map(int, input().split())\r\ntimeleft = 240-k\r\nif timeleft - 5*(n*(n+1)//2) >= 0:\r\n print(n)\r\nelse:\r\n for i in range(1, n+1):\r\n if timeleft - 5*((i*(i+1))//2) < 0:\r\n print(i-1)\r\n break", "ls = list(map(int , input().split()))\nn = ls[0]\nk = ls[1]\nlow = 1\nhigh = n\nflag= False\nwhile low<=high:\n\tmid = (low+high)//2\n\tminutes = 5*(((mid)*(mid+1))//2)+k\n\tif minutes<240:\n\t\tlow = mid+1\n\telif minutes>240:\n\t\thigh = mid-1\n\telse:\n\t\tprint(mid)\n\t\tflag = True\n\t\tbreak\nif not flag:\n\tprint(high)", "'''\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. New Year and Hurry\r\n SOLUTATOIN....\r\n\r\n ************************************************************************\r\n'''\r\nn,m=map(int,input().split())\r\nl=240-m\r\nr=0\r\nt=0\r\nfor i in range(1,n+1):\r\n t+=i*5\r\n if t<=l:\r\n r+=1\r\nprint(r)", "n, k = map( int, input().split())\r\nt = 240 - k\r\ndef qwerty(n):\r\n s = 0\r\n for i in range(1, n+1):\r\n s += 5*i\r\n return s\r\nl = -1\r\nr = n+1\r\nwhile l+1 < r:\r\n m = (l + r)//2\r\n if qwerty(m) <= t:\r\n l = m\r\n else:\r\n r = m\r\nprint(l)\r\n", "Info = input()\r\nInfo = Info.split(\" \")\r\nTime = (4*60) - int(Info[1])\r\nDuration = 0\r\nCount = 0\r\n\r\nfor i in range(1, int(Info[0]) + 1):\r\n\r\n Duration = Duration + (5*(i))\r\n if Time - Duration >= 0:\r\n Count = Count + 1\r\n\r\n \r\n\r\nprint(Count)\r\n", "n,k=map(int,input().split())\r\n\r\ntime_left=240-k #남은 시간을 분으로 표현\r\n\r\nsolving_time=[5,10,15,20,25,30,35,40,45,50] #문제별 걸리는 시간\r\n\r\ntotal=0\r\ncnt=0\r\n\r\nfor i in range(0,10):\r\n total=total+solving_time[i] #문제풀이에 걸리는 시간 누적\r\n if time_left>=total: #아직 시간이 남아있으면\r\n cnt=cnt+1 #카운트\r\n \r\nif cnt>n: #문제를 더 풀어도 될정도로 시간이 남는데 문제양이 적을때\r\n print(n)\r\nelse:\r\n print(cnt)\r\n", "problems, travelling_duration = [int(x) for x in input().split()]\r\ncontest_duration = 240 - travelling_duration\r\ncurrent_duration = 0\r\nproblem_count = 0\r\n\r\nfor problem in range(1, problems + 1):\r\n current_duration += 5 * problem\r\n \r\n if current_duration > contest_duration:\r\n print(problem_count)\r\n break\r\n else:\r\n problem_count += 1\r\n\r\nif current_duration <= contest_duration:\r\n print(problem_count)", "n,k = tuple(map(int,input().split()))\r\nmins = 240 - k\r\nans = 0\r\ni = 1\r\ncount = 0\r\nwhile(mins >= 0):\r\n if(count + 5*i <= mins):\r\n ans += 1\r\n count += 5*i\r\n i += 1\r\n else:\r\n break\r\n if(i > n):\r\n break\r\nprint(ans)", "n, k = map(int, input().split())\r\ne = 0\r\ntime = 240-k\r\nc = 0\r\nfor i in range(1, n+1):\r\n c += 5*i\r\n if c <= time:\r\n e += 1\r\n else:\r\n break\r\nprint(e)\r\n", "n, k = (input().split())\r\n\r\nvaqt = 240\r\nresult = 0\r\ns=0\r\nfor i in range(1,int(n)+1):\r\n if vaqt-i*5-int(k)-s<0:\r\n result = (i-1)\r\n break\r\n else:\r\n s+=i*5\r\n result = i\r\nprint(result)", "n,k = map(int,input().split())\r\nx = 240-k\r\ncnt=0\r\nfor i in range(1,n+1):\r\n if x-5*i >=0:\r\n x-=5*i\r\n cnt+=1\r\n else:\r\n break\r\n\t\t\t\r\nprint (cnt)\r\n", "import sys\r\nfrom collections import Counter\r\ninputt = lambda: sys.stdin.readline().strip()\r\nints = lambda: list(map(int, input().split()))\r\nprintn = lambda x: sys.stdout.write(x+'\\n')\r\nprintnn = lambda x: sys.stdout.write(x)\r\n\r\ndef solve():\r\n n,k=ints()\r\n s=240-k\r\n i=1\r\n while s-(i*5)>=0: s-=(i*5); i+=1\r\n print(i-1 if i-1 <= n else n)\r\n\r\nt=1\r\n# t=int(input())\r\nfor i in range(t): solve()", "n, k = map(int, input().split())\r\na = 240 - k\r\ni = 1\r\nwhile a >= 5 * i and i <= n:\r\n a -= 5 * i\r\n i += 1\r\nprint(i - 1)", "a, b=map(int, input().split())\r\ni=0\r\nt=0\r\nwhile t+b<=240 and i<=a:\r\n i=i+1\r\n t=5*i+t\r\nprint(i-1)", "n, m = list(map(int,input().split()))\r\ni=1\r\nsum=0\r\nwhile (sum+i*5)<=(240-m) and i<=n:\r\n sum+=i*5\r\n i+=1\r\nprint(i-1)", "a,b=map(int,input().split())\r\nr=240-b\r\nc=0\r\ntime=0\r\nfor i in range(1,a+1):\r\n time+=i*5\r\n if time <= r:\r\n c+=1\r\nprint(c)", "n,k=map(int,input().split())\r\ns= 240-k\r\nc=0\r\nfor i in range(1,n+1):\r\n \r\n s-=5*i\r\n #print(s)\r\n if s>=0:\r\n c+=1\r\n else:\r\n break\r\nprint(c)", "n,k=map(int,input().split())\r\ni=1\r\nc=5\r\nwhile i<=n and c+k<=240:\r\n i+=1\r\n c+=5*i\r\nprint(i-1)", "\r\nallowance = 240\r\nanswer = 0\r\nproblems, minutes = map(int, input().split())\r\nallowance -= minutes\r\nfor i in range(problems):\r\n if allowance >= 5 * (i + 1):\r\n allowance -= 5 * (i + 1)\r\n answer += 1\r\nprint(answer)\r\n", "# https://codeforces.com/problemset/problem/750/A\r\n\r\na = list(map(int, input().split()))\r\nn = a[0]\r\nk = a[1]\r\n\r\ntime = 240 - k\r\ncount = 0\r\nfor i in range(1, n + 1):\r\n time -= i * 5\r\n if time >= 0:\r\n count += 1\r\n else:\r\n break\r\n\r\nprint(count)", "n,k=map(int,input().split())\r\ntime=240\r\nhave=time-k\r\nc=0\r\nfor i in range(1,n+1):\r\n if (i*5 )<= have:\r\n c +=1\r\n have -=(i*5 )\r\n \r\nprint(c)", "n, k = map(int, input().split())\r\nleft, right = 0, 11\r\nwhile left < right:\r\n m = (left + right) // 2\r\n if m > n or (10 + 5 * (m-1)) * m // 2 + k > 240:\r\n right = m\r\n else:\r\n left = m\r\n if m + 1 == right:\r\n break\r\n\r\nprint(m)", "a,b=map(int,input().split())\r\nk=240-b\r\nc=0\r\ns=0\r\nfor i in range (1,a+1):\r\n s+=5*i\r\n if k>=s:\r\n c+=1\r\n \r\nprint(c)", "n_k = input().split()\r\nn = int(n_k[0])\r\nk = int(n_k[1])\r\n\r\ntotal_time = 240\r\ntime_left = 240- k\r\ncnt = 0\r\nr = time_left\r\n\r\nfor i in range(1,n+1):\r\n trfq = 5*i\r\n if r >= trfq:\r\n r -= trfq\r\n cnt+=1\r\n else:\r\n break\r\n\r\nprint(cnt)\r\n", "l=list(map(int,input().split()))\r\na,b=l[0],l[1]\r\nif 5*((a*(a+1))//2)+b<=240:\r\n print(a)\r\nelse:\r\n a-=1\r\n while True:\r\n if 5*((a*(a+1))//2)+b<=240:\r\n print(a)\r\n break\r\n a-=1", "a, b = map(int, input().split())\r\nwhile(((lambda num: num * (num + 1) / 2)(a)) * 5 > 240 - b):\r\n a -= 1\r\nprint(a)", "n, k = map(int,input().split())\r\ntask_t = 240 - k\r\ni = 0\r\ntime = [0]\r\nwhile time[i] <= task_t:\r\n time.append((i+1)*5 + time[i])\r\n i+=1\r\nprint(min(n,len(time)-2))\r\n", "n, k = map(int,input().split())\nproblems_time = 0\ncount = 0\n\nfor p in range(1,n+1):\n problems_time = problems_time + (5*p)\n \n if (problems_time)+ k > 240:\n break\n count += 1\n \nprint(count) \n\t\t \t\t\t \t\t\t\t\t\t \t\t\t\t \t\t \t", "# 750A\r\nn,k = [int(x) for x in input().split(\" \")]\r\nsolve,time = 0, k\r\nfor i in range(1,n+1):\r\n\r\n if time+(i*5)<=240:\r\n time = time + (i*5)\r\n solve = solve + 1\r\n else:\r\n break\r\nprint(solve)", "import math\n\nb, c = [int(x) for x in input().split(\" \")]\ntime = 240 - c\nminslices = math.floor(time / 5)\nproblems = 0\n\nfor i in range(1, b + 1):\n if minslices >= i:\n minslices -= i\n problems += 1\n else:\n break\n\nprint(problems)\n\n\t \t\t\t\t\t\t \t\t \t \t \t \t \t", "n,k = map(int,(input().split()))\r\n\r\nmid_night_time = 240\r\nsolve_time =mid_night_time-k\r\ncounter = 0\r\n\r\nfor i in range(1, n+1): \r\n if solve_time - (i*5) >=0: \r\n counter = counter+1\r\n solve_time = solve_time - (i*5)\r\n\r\nprint(counter)", "n,k = map(int,input().split())\r\nt_l = 240-k\r\nsolved = 0\r\nfor i in range(1,n+1):\r\n if (5*i)<=t_l:\r\n t_l-=(5*i)\r\n solved+=1\r\n \r\n else:\r\n break\r\nprint(solved)\r\n", "n,k=map(int,input().split())\r\nwhile n*(n+1)//2*5>240-k:\r\n n-=1\r\nprint(n)", "\r\nk1=input()\r\nn=k1.split(\" \")\r\nn=list(map(int,n))\r\n\r\n# print(n)\r\n# count=\r\nv=[]\r\nc=0\r\ncount=0\r\nfor i in range(1,n[0]+1):\r\n \r\n if n[1]+5*i+c<=240:\r\n c=c+5*i\r\n count=count+1\r\n v.append(i)\r\n# print(v) \r\nprint(count) \r\n \r\n \r\n ", "problems,minutesneeded = list(map(int,input().split()))\r\ntotalminutes = 240\r\nsolved = 0\r\ntotal = 0\r\nfor i in range(1,problems+1):\r\n total += 5*i\r\n if total > (totalminutes-minutesneeded):\r\n break\r\n solved += 1\r\nprint(solved)\r\n ", "n,k=input().split(' ')\r\nn=int(n)\r\nk=int(k)\r\nm=240-k\r\ncount=0\r\nfor i in range(1,n+1):\r\n if(m>=5*i):\r\n count=count+1\r\n m=m-(5*i)\r\nprint(count)\r\n \r\n", "# Leer la cantidad de problemas y el tiempo que toma llegar a la fiesta\r\nn, k = map(int, input().split())\r\n\r\n# Calcular el tiempo disponible para resolver problemas\r\ntiempo_disponible = 240 - k # Limak tiene 240 minutos desde las 8:00 p.m. hasta la medianoche\r\n\r\n# Inicializar una variable para contar los problemas resueltos\r\nproblemas_resueltos = 0\r\n\r\n# Iterar sobre los problemas desde el más fácil al más difícil\r\nfor i in range(1, n + 1):\r\n tiempo_problema = 5 * i # Tiempo requerido para resolver el i-ésimo problema\r\n \r\n # Verificar si Limak tiene suficiente tiempo para resolver el problema\r\n if tiempo_disponible >= tiempo_problema:\r\n problemas_resueltos += 1\r\n tiempo_disponible -= tiempo_problema\r\n else:\r\n break # Si no hay suficiente tiempo, Limak no puede resolver más problemas\r\n\r\n# Imprimir la cantidad máxima de problemas resueltos\r\nprint(problemas_resueltos)\r\n", "n, k = [int(i) for i in input().split()]\r\n\r\n\r\nminutes = 4 * 60 - k\r\n\r\n\r\ni = 0\r\nwhile i < n:\r\n\tminutes -= (i+1) * 5\r\n\tif minutes < 0:\r\n\t\tbreak\r\n\ti+=1\r\n\r\nprint(i)\r\n", "x,y=map(int,input().split())\r\na=b=c=0\r\ns=240-y\r\nfor i in range(1,x+1):\r\n s=s-(5*(i))\r\n if (s>=0):\r\n c=c+1\r\n else:\r\n break\r\nprint(c)\r\n", "a,b=map(int,input().split())\r\nlj=1\r\nco=0\r\nfor i in range(a):\r\n l=5*lj\r\n co+=l\r\n if((co+b)>240):\r\n print(lj-1)\r\n break\r\n lj += 1\r\nif(lj-1==a):\r\n print(a)", "\r\nstring_input = input();\r\n\r\ninputs = string_input.split()\r\n\r\ninputs[0] = int(inputs[0])\r\ninputs[1] = int(inputs[1])\r\n\r\nmax = 240 - inputs[1]\r\ni = 0\r\nwhile max >= 0 and i<=inputs[0]:\r\n i += 1\r\n max = max - (5*i)\r\nif i == 0:\r\n print(i)\r\nelse:\r\n print(i-1)", "x=input(\"\")\r\nl=x.split(\" \")\r\nm,c=[],0\r\na,b=int(l[0]),(240-int(l[1]))\r\nfor i in range(1,a+1):\r\n m.append(5*i)\r\nfor j in m:\r\n if b-j<0:\r\n break\r\n else:\r\n b-=j\r\n c+=1\r\nprint(c)", "n, k = input().split()\r\nno_of_problems = 0\r\ntime = 0\r\n\r\nwhile no_of_problems < int(n):\r\n if time + ((no_of_problems+1) * 5) <= 240 - int(k):\r\n no_of_problems += 1\r\n time += no_of_problems * 5\r\n else:\r\n break\r\nprint(no_of_problems)\r\n", "n, k = map(int, input().split())\r\n\r\ntime = 240-k\r\n\r\ncount = 0\r\nfor i in range(1, n+1):\r\n if time - (i*5) >= 0:\r\n time -= i*5\r\n count += 1\r\n\r\nprint(count)\r\n ", "import math\n\nMINUTES_IN_FOUR_HOURS = 240\n\n\ndef solve_quadratic_eq(a: float, b: float, c: float) -> float:\n \"\"\"Return the positive squared root if exists.\"\"\"\n rad = b**2 - 4*a*c\n\n if rad < 0:\n raise Exception\n \n rad = math.sqrt(rad)\n\n n1 = (-b + rad) / (2 * a)\n n2 = (-b - rad) / (2 * a)\n\n if n1 >= 0:\n return n1\n\n return n2\n\n\nif __name__ == \"__main__\":\n n, k = list(map(int, input(\"\").split(\" \")))\n\n available_mins = MINUTES_IN_FOUR_HOURS - k\n\n ans = int(solve_quadratic_eq(a=1, b=-1, c=float(-2*available_mins) / 5) - 1)\n\n print(min(ans, n))", "import sys\r\nnums = sys.stdin.readline().strip().split()\r\nalltime = 4 * 60\r\nroad = int(nums[1])\r\navtime = alltime - road\r\ncounter = 0\r\nfor i in range(1, int(nums[0]) + 1):\r\n zd = 5 * i\r\n if zd <= avtime:\r\n counter += 1\r\n avtime -= zd\r\nprint(counter)", "n, k = map(int, input().split())\r\nleft = 4 * 60 - k\r\ni = 1\r\ncount = 0\r\nwhile True:\r\n if left - i * 5 >= 0:\r\n count += 1\r\n left -= i * 5\r\n else:\r\n break\r\n if i == n:\r\n break\r\n i += 1\r\nprint(count)", "a,b=map(int,input().split())\r\ns=0\r\nd=0\r\nfor i in range(1,a+1):\r\n s+=(i*5)\r\n if s<=240-b:\r\n d+=1\r\nprint(d)\r\n", "n, k = map(int,input().strip().split(' '))\r\n\r\nt = 240 - k\r\nres = 1\r\n\r\nfor _ in range(1, n + 1):\r\n if t >= 5 * res:\r\n t -= 5 * res\r\n res += 1\r\n else:\r\n break\r\n\r\nprint(res - 1)", "n, k = map(int, input().split())\r\n\r\nmax_tasks = 0\r\ntime_needed = 0\r\n\r\nfor i in range(1, n+1):\r\n time_needed += 5*i\r\n if time_needed + k <= 240:\r\n max_tasks = i\r\n else:\r\n break\r\n\r\nprint(max_tasks)", "n , k = map(int , input().split())\r\ntime = 240 - k\r\ni = 1\r\nwhile (time >= 5*i):\r\n time = time - 5 * i\r\n i = i + 1\r\nprint(min(i - 1 , n))", "n,m=map(int,input().split())\r\nst=240\r\nc=0\r\ns=0\r\nr=st-m\r\nfor i in range(1,n+1):\r\n s=s+5*i\r\n if(s>r):\r\n break\r\n c+=1\r\nprint(c)\r\n", "n, k = map(int, input().split())\nt = 4 * 60 - k\n\nn_p_c = 0\nwhile t >= 0 and n_p_c <= n:\n n_p_c += 1\n t -= n_p_c * 5\n\nprint(n_p_c - 1)\n\n", "n,m=map(int,input().split())\r\nt=240\r\nt -= m\r\nsum=0\r\nres=0\r\nfor i in range(1,n+1):\r\n sum += i*5\r\n if sum <= t:\r\n res+=1\r\n else:\r\n break\r\nprint(res) ", "def max_problems_solved(n, k):\n total_time = 240 - k\n problems_solved = 0\n\n for i in range(1, n+1):\n total_time -= 5*i\n if total_time >= 0:\n problems_solved += 1\n else:\n break\n\n return problems_solved\n\n# Read input\nn, k = map(int, input().split())\n\n# Call the function\nresult = max_problems_solved(n, k)\n\n# Print the result\nprint(result)\n\n \t\t\t\t\t \t\t \t\t \t\t\t \t \t\t\t\t \t", "n,k = map(int,input().split())\r\nk=240-k\r\nc=0\r\nfor i in range(1,n+1):\r\n k-=(5*i)\r\n if(k<0):\r\n break\r\n else:\r\n c+=1\r\nprint(c) ", "# بسم الله (accepted)\r\n# limak has total 4 hrs to solve problems and also reach the ceremony hall\r\n# he needs time to solve problem and transport to his ceremony hall\r\nn , k = map(int, input().split(' '))\r\ntime_for_problem_solving = 240 - k\r\nsolved_problem = 0\r\nfor i in range(1,n+1) :\r\n if time_for_problem_solving >= i*5 :\r\n time_for_problem_solving -= i*5\r\n solved_problem += 1\r\n elif time_for_problem_solving <= i*5 :\r\n break\r\n\r\nprint(solved_problem)\r\n\r\n", "l=input().split()\r\na=int(l[0])\r\nb=int(l[1])\r\ntime=0\r\nc=0\r\nfor i in range(1,a+1):\r\n time+=5*i\r\n if time>(240-b):\r\n break\r\n c+=1\r\nprint(c)", "import math\r\na,b=map(int,input().split())\r\nn=int(math.sqrt(0.4*(240-b)+0.25)-0.5)\r\nif a<=n:\r\n print(a)\r\nelse:\r\n print(n)\r\n", "n, walk = [int(x) for x in input().split()]\r\ntime = 240\r\ntime_for_task = time - walk\r\ncount = 0\r\n\r\nfor i in range(1, n + 1):\r\n time_for_task -= 5 * i\r\n if time_for_task >= 0:\r\n count += 1\r\n else:\r\n break\r\nprint(count)", "problems,time = [int(i) for i in input().split()]\r\nc = 0\r\nfor i in range(1,problems + 1):\r\n time += i*5\r\n if time <= 240:\r\n c += 1\r\nprint(c)", "x,y=map(int,input().split())\r\ns=240 - y\r\nc=0\r\ni=1\r\nwhile(5*i <= s):\r\n c+=1\r\n s=s - 5*i\r\n i+=1\r\nif(c>x):\r\n print(x)\r\nelse:\r\n print(c)", "n, k = map(int, input().split())\r\n\r\ntime_left = 240 - k\r\ntime_solve = 5\r\nres = 0\r\n\r\nfor i in range(n):\r\n if time_left >= time_solve:\r\n time_left -= time_solve\r\n time_solve += 5\r\n res += 1\r\n else:\r\n break\r\n\r\nprint(res)\r\n", "n, k = map(int, input().split())\nt = 240 - k\nans = 0\nfor i in range(1, n + 1):\n if t - 5 * i >= 0:\n t -= 5 * i\n ans += 1\n else:\n break\nprint(ans)\n\n", "n, k = map(int, input().split())\r\n\r\nresta = 240-k\r\ncont = 0\r\n\r\nfor i in range(1, n+1):\r\n\tcont += 5*i\r\n\tif cont > resta:\r\n\t\ti = i-1\r\n\t\tbreak\r\n\t\r\n\t\t\r\nprint(i)", "n,k=input().split()\r\nn=int(n)\r\nk=int(k)\r\n#print(k,n)\r\nt=240-k\r\nc=0;\r\nfor i in range(1,n+1):\r\n if(t-5*i<0):\r\n break\r\n t=t-5*i\r\n c=c+1\r\nprint(c)", "s = input().split()\r\nn, k = [int(x) for x in s]\r\n\r\n\r\ntemp = 0\r\nres = 0\r\n\r\nfor x in range(1,n+1):\r\n temp += x*5\r\n if temp+k <= 240:\r\n res += 1\r\n else:\r\n break\r\n\r\nprint(res) ", "n, k = [int (x) for x in input().split()]\r\nnum = 0\r\nmaxim = 0\r\nfor i in range (1,n+1):\r\n num += i*5\r\n if(num+k<=240):\r\n maxim = i\r\nprint(maxim)\r\n", "import math\r\n\r\ntxt = [int(el) for el in input().split()]\r\n\r\nn = txt[0]\r\nk = txt[1]\r\n\r\nalltime = 240\r\ncodetime = alltime - k\r\ntasks = 0 \r\n\r\ni = 1\r\n\r\nwhile i <= n:\r\n if 5*i <= codetime:\r\n tasks += 1\r\n codetime -= 5*i\r\n\r\n i += 1\r\n\r\nprint(tasks)\r\n\r\n", "n, k = map(int, input().split())\r\ntotal_time = 0\r\nproblems_solved = 0\r\nfor i in range(1, n+1):\r\n total_time += 5*i\r\n if total_time + k <= 240:\r\n problems_solved += 1\r\n else:\r\n break\r\nprint(problems_solved)\r\n", "tm = input().split()\r\nn, k = int(tm[0]), int(tm[1])\r\nsc = 240\r\nsc -= k\r\nsn = -1\r\nwhile sc >= 0 and sn <= n:\r\n sn += 1\r\n sc -= 5 * sn\r\nprint(sn - 1)\r\n", "n, k = map(int, input().split())\r\ntotalTime = 0\r\nsolvedProblems = 0\r\n\r\nfor i in range(1, n + 1):\r\n totalTime += 5 * i\r\n if totalTime > 240 - k:\r\n break\r\n solvedProblems += 1\r\n\r\nprint(solvedProblems)\r\n", "n,k=map(int,input().split())\r\nc=240\r\np=0\r\nfor i in range(1,n+1):\r\n if c-(5*i)>=k:\r\n c-=(5*i)\r\n p=i \r\n else:\r\n break\r\nprint(p)", "j,k=map(int,input().split())\r\nwhile j*(j+1)//2*5>240-k:j-=1\r\nprint(j)", "def Llegar(n, k, problemas):\n tiempo_restante = 240 - k\n ProblemasResueltos = 0\n for i in range(1, n+1):\n tiempo_restante = tiempo_restante - 5*i\n if tiempo_restante < 0:\n return False\n ProblemasResueltos = ProblemasResueltos + 1\n if ProblemasResueltos == problemas:\n return True\n return False\n\nProblemas, TiempoEnLlegar = map(int, input().split())\n\nleft = 0\nright = Problemas\nwhile left < right:\n mid = (left + right + 1) // 2\n if Llegar(Problemas, TiempoEnLlegar, mid):\n left = mid\n else:\n right = mid - 1\n\nprint(left)\n\t \t\t\t\t\t \t\t \t\t \t \t \t\t\t\t \t\t \t\t", "n, k = map(int, input().split())\ntime_available = 240 - k \nproblems_solved = 0\nfor i in range(1, n + 1):\n time_required = 5 * i \n if time_available >= time_required:\n problems_solved += 1\n time_available -= time_required\n else:\n break\n\nprint(problems_solved)\n\n \t\t\t\t\t\t \t \t\t \t\t\t\t\t \t\t\t\t \t", "n, k = map(int, input().split())\r\nr = 240 - k\r\ns, o = 0, 0\r\nfor i in range(1,n+1):\r\n s = s + 5*i\r\n if(s<=r):\r\n o = i\r\nprint(o)", "n,m=map(int,input().split())\nleft=240-m\no=0\nfor i in range(1,n+1):\n if 5*i<=left:\n left-=5*i\n o+=1\n else:\n break\nprint(o)\n\t\t \t\t\t\t\t\t \t\t \t \t\t\t \t\t \t", "n, k = map(int, input().split())\r\n#n = numbers of problems\r\n#k = minuts left to the party\r\ntime = 240 - k\r\ncount = 0\r\nfor i in range(1, n+1):\r\n if time >= 5 * i:\r\n count += 1\r\n time -= 5 * i\r\nprint(count)", "n,k=map(int,input().split())\r\na,b=0,0\r\nfor i in range(1,n+1):\r\n a+=5*i \r\n if a<=(240-k):\r\n b+=1 \r\n else:\r\n break\r\nprint(b)\r\n ", "n,k = map(int, input().split())\r\np = 0\r\nmins = 1440 - k - 1200\r\nfor i in range(1,n+1):\r\n mins = mins - 5*i\r\n if mins>=0:\r\n p = p + 1\r\nprint(p)", "n, k = map(int, input().split(\" \"))\r\nmnt = 240-k\r\ntim = 0\r\nif mnt < 0:\r\n print(0)\r\nelse:\r\n for i in range(1, n+1):\r\n tim += 5*i\r\n if tim > mnt:\r\n slv = i-1\r\n break\r\n else:\r\n slv = i\r\n print(slv)\r\n", "n, k = map(int, input().split())\r\nmidnight = 240 \r\n\r\nproblems_solved = 0\r\ntime_remaining = midnight - k\r\n\r\nfor i in range(1, n + 1):\r\n time_required = 5 * i \r\n if time_remaining >= time_required:\r\n problems_solved += 1\r\n time_remaining -= time_required\r\n else:\r\n break\r\n\r\nprint(problems_solved)\r\n", "n, k = map(int, input().split())\r\ntimeInContest = 240 - k\r\ntotal = 0\r\nfor i in range(1, n+1):\r\n if timeInContest - (5*i) >= 0:\r\n timeInContest -= (5*i)\r\n total += 1\r\n else: break\r\nprint(total)", "n,k = map(int,input().split())\r\nt = 240 - k \r\ni = 1 \r\nwhile t - 5*i >= 0:\r\n t -= 5*i \r\n i += 1 \r\nprint(min(i-1,n))\r\n", "n,k=map(int,input().split())\ntime=0\nif k==240:\n print(0)\n exit()\nfor i in range(1,n+1):\n time+=5*i\n if time>(240-k):\n print(i-1)\n exit()\n elif time==(240-k):\n print(i)\n exit()\nprint(i)\n \t\t \t \t \t\t \t \t \t\t\t", "\n\n\n\n\n\ntotal_minuts = 4 * 60\n\nn, t = map(int, input().split())\n\ntpp = [i * 5 for i in range(1, n + 1)]\n\n\ntotal_minuts -= t\n\ncnt = 0\n\nfor i in range(n) :\n if tpp[i] <= total_minuts :\n cnt += 1\n total_minuts -= tpp[i]\n\nprint(cnt)\n\t \t \t\t\t \t\t \t\t \t \t \t\t\t\t\t\t", "n, k = map(int, input().split())\r\n\r\ncontest_duration = 240 # 4 hours = 240 minutes\r\nremaining_time = contest_duration - k\r\nsolved_problems = 0\r\n\r\nfor i in range(1, n+1):\r\n problem_time = 5 * i # Time to solve the i-th problem\r\n if remaining_time >= problem_time:\r\n solved_problems += 1\r\n remaining_time -= problem_time\r\n else:\r\n break\r\n\r\nprint(solved_problems)\r\n", "n, k = map(int, input().split())\nk = 240 -k\nt = 0\nr = 0\nwhile (k-r) >= 0 and n != t-1:\n t+=1\n r += t*5\nprint(t-1)\n \t \t \t \t\t \t \t\t\t \t\t", "x=[int(i)for i in input().split()]\r\nf=240-x[1]\r\ncounter = 0 \r\nfor i in range(x[0]) : \r\n if f-(i+1)*5>=0 : \r\n f=f-(i+1)*5\r\n counter+=1\r\n else :break \r\nprint(counter)\r\n", "a = input('')\r\nn = int(a.split()[0])\r\nk = int(a.split()[1])\r\n\r\ntempo = 4*60-k\r\nproblemas = 0\r\nfor j in range(1, n+1):\r\n tempo = tempo - 5*j\r\n if tempo < 0:\r\n break\r\n else:\r\n problemas = problemas + 1\r\n\r\nprint(problemas)\r\n", "n,k = map(int,input().split())\r\nres = 0\r\nc=0\r\nminute = 240 - k\r\nfor i in range(1,n+1):\r\n if res+5*i <= minute:\r\n c += 1\r\n res += 5*i\r\n\r\n else:\r\n break\r\n\r\nprint(c)", "n,k = map(int,input().split())\r\n\r\n\r\ntime = 240-k\r\n\r\ncount = 0\r\n\r\nfor i in range(n):\r\n if time - ((i+1)*5) >= 0:\r\n count+=1\r\n time -= (i+1)*5\r\n else:\r\n break\r\n\r\nprint(count)", "import sys\r\nsys.setrecursionlimit(100000000)\r\ninput=lambda:sys.stdin.readline().strip()\r\nwrite=lambda x:sys.stdout.write(str(x))\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\r\n# from functools import cmp_to_key\r\n\r\n\r\nn,k=map(int,input().split())\r\nt=240-k\r\nfor i in range(1,n+1):\r\n if i*5<=t:\r\n t-=i*5\r\n else:\r\n print(i-1)\r\n break\r\nelse:\r\n print(n)", "def hurry(n, k):\r\n lst = []\r\n i = 0\r\n while True:\r\n lst.append(i*5)\r\n if sum(lst)+k > 240:\r\n return len(lst[1:-1])\r\n elif i == n:\r\n return n\r\n i += 1\r\n\r\nif __name__ == \"__main__\":\r\n n, k = map(int, input().split())\r\n print(hurry(n, k))", "arr = [int(i) for i in input().split()]\r\nn = arr[0]\r\nk = arr[1]\r\nminuts = 240\r\nminuts -= k\r\ncount = 0\r\nfor i in range(n):\r\n while minuts >= ((i + 1) * 5):\r\n count += 1\r\n minuts -= ((i + 1) * 5)\r\n break\r\nprint(count)", "number_of_problems, time_from_house = input().split()\r\nproblem_counter = 0\r\nproblem_number = 1\r\ntime = 0\r\nfor prob in range(int(number_of_problems)):\r\n time += problem_number * 5\r\n if time + int(time_from_house) <= 240:\r\n problem_counter += 1\r\n problem_number += 1\r\n else:\r\n break\r\nprint(problem_counter)", "n,k=map(int,input().split())\r\nc=240-k\r\nif 2.5*n*(n+1)<=c:print(n)\r\nelse:\r\n while 2.5*n*(n+1)>c:n-=1\r\n print(n)\r\n", "def max_binary_search(A, target):\r\n pos_start = 0\r\n pos_end = len(A) -1\r\n max_seen = -1\r\n \r\n while pos_start <= pos_end:\r\n mid = (pos_start + pos_end)//2\r\n \r\n if A[mid] == target:\r\n return mid + 1\r\n if A[mid] < target:\r\n max_seen = mid\r\n pos_start = mid + 1\r\n else:\r\n pos_end = mid - 1\r\n \r\n return max_seen + 1\r\n\r\n\r\n\r\nvalues = input().split()\r\nn_problems = int(values[0])\r\ntravel_time = int(values[1])\r\n\r\nremaining_time = 240 - travel_time\r\ntime_spend = [ ]\r\naccumulated = 0\r\n\r\nfor i in range(1, n_problems + 1):\r\n accumulated += 5*i\r\n time_spend.append(accumulated)\r\n\r\n\r\nmax_problems = max_binary_search(time_spend, remaining_time)\r\n\r\nprint(max_problems)", "from math import floor\n\na,b = map(int,input().split())\nt = 240\nt-=b\np=0\nfor i in range(1,a+1):\n c = 5*i\n if t-c >=0:\n t-=c\n p+=1\n else:\n break\nprint(p)\n", "a,b = map(int,input().split())\r\nt = 60*4\r\nc = 0\r\nt -= b\r\ni = 1\r\nwhile t>=i*5 and a>0:\r\n t -= i*5\r\n c += 1\r\n i += 1\r\n a -= 1\r\nprint(c)", "action = input().split()\nproblemset = int(action[0])\ntime = int(action[1])\n\nmaxproblem_solved = 0\ntime_limit = 240 - time\nfor i in range(problemset):\n time_limit -= (i+1)*5\n if time_limit < 0:\n break\n maxproblem_solved += 1\n\nprint(maxproblem_solved)", "while True:\r\n try:\r\n n, k = map(int, input().split())\r\n except:\r\n break\r\n\r\n res, sum, c = 240 - k, 0, 0\r\n\r\n for i in range(1, n + 1):\r\n sum += 5 * i\r\n\r\n if sum > res:\r\n break\r\n\r\n c += 1\r\n\r\n print(c)\r\n", "n, k = [int(i) for i in input().split()]\r\n\r\ntime = 240 - k\r\n\r\nfor i in range (1, n + 1):\r\n if time >= i *5 :\r\n time -= i * 5\r\n else:\r\n print (i-1)\r\n break\r\nelse:\r\n print(n)", "n , m = map(int, input().split())\r\nt, count, i = 0, 0, 0\r\nwhile(i <= n-1):\r\n t += 5*(i+1)\r\n #print(t,t+m)\r\n if t+m <= 240:\r\n count += 1\r\n i+=1\r\nprint(count)", "n,k = map(int, input().split())\r\n\r\ndef solution(n, k):\r\n time_left = 4*60 - k\r\n time_spent = 0\r\n task = 0\r\n while task < n:\r\n time_to_complete = 5*(task+1)\r\n time_spent += time_to_complete\r\n if time_spent > time_left:\r\n return task\r\n else:\r\n task += 1\r\n return task\r\n\r\nprint(solution(n,k))", "a,b=[int(x) for x in input().split()]\r\nn=0\r\nm=0\r\nfor i in range(1,a+1):\r\n n+=int(i)*5\r\n if n+b<=240:\r\n m+=1\r\nprint(m)", "n, k = list(map(int, input().split(\" \")))\r\nt = 240 - k\r\np = 0\r\npt = 0\r\nfor i in range(1, n+1):\r\n if (pt + (i * 5)) <= t:\r\n pt += i*5\r\n p += 1\r\n else:\r\n break\r\n\r\nprint(p)\r\n", "# -*- coding: utf-8 -*-\r\nvalues = input().split()\r\nn_problems = int(values[0])\r\ntime_travel = int(values[1])\r\ntime_left = 240 - time_travel\r\ncurrent = 0\r\n\r\nwhile time_left - 5*current >= 0 and current <= n_problems:\r\n time_left -= 5 * current\r\n current += 1\r\n\r\nprint(current - 1)\r\n", "total=input().split(\" \")\r\n[n,k]=[int(number) for number in total]\r\n\r\nremainingTime=240-k\r\n\r\nsolvedProblems= int(((8 * remainingTime // 5 + 1)**0.5 - 1) / 2)\r\nif solvedProblems<=n :\r\n print(solvedProblems)\r\n\r\nelse:\r\n print(n)\r\n", "def summer(p):\r\n if p == 1 or p==0:\r\n return p\r\n\r\n return p + summer(p - 1)\r\nn , k = map(int,input().split())\r\nt = 240 - k\r\nleft = 0\r\nright = n\r\nans = 0\r\nwhile left <= right:\r\n mid = left + (right - left) //2\r\n if summer(mid)*5 <=t:\r\n ans = mid\r\n left+=1\r\n else:\r\n right-=1\r\nprint(ans)\r\n\r\n", "n , k = map(int,input().split())\r\n\r\ns = 0 \r\nc = 0\r\n\r\nb = 240 - k \r\n\r\nfor i in range(1,n+1):\r\n\r\n if s < b :\r\n s = s + (i*5)\r\n c+=1\r\n if s > b :\r\n s = s - (i*5)\r\n c-=1\r\n \r\n#print(s,\"s\")\r\nprint(c)\r\n\r\n", "n, k = map(int, input().split())\r\ntime_till_midnight = 240 # percekben\r\n\r\n# Matekos megoldás:\r\n\r\nprint (min(n,int( ((1+1.6*(time_till_midnight-k))**0.5 -1)/2 )))", "n,k=map(int,input().split())\r\ndiff=240-k\r\ni=1 \r\nans=0 \r\nwhile diff>=5*i*(i+1)//2 and ans<n:\r\n ans+=1 \r\n i+=1 \r\nprint(ans)", "ans=0\r\n\r\na,b=map(int,input().split())\r\n\r\ntime=240-b\r\n\r\nif time>=0:\r\n for j in range(a):\r\n p=(j+1)*5\r\n time=time-p\r\n if time>=0:\r\n ans=ans+1\r\n else:\r\n break\r\n\r\nprint(ans)\r\n", "n, k = map(int, input().split())\r\nk = 240 - k\r\ntotal = 0\r\nch = 0\r\ni = 1\r\nwhile ch < k and total < n:\r\n ch += 5 * i\r\n i += 1\r\n total += 1\r\nif ch > k:\r\n print(total-1)\r\nelse:\r\n print(total)\r\n", "d = input().split()\r\nn, k = int(d[0]), int(d[1])\r\nt_r = 240 - k\r\ns = 0\r\nfor i in range(1, n+1):\r\n t_r -= i*5\r\n if t_r >= 0:\r\n s += 1 \r\n else: break\r\nprint(s)\r\n", "n, k = map(int, input().split())\r\nz = int((2*((240-k)//5) + 0.25)**0.5 - 0.5)\r\nprint(z if z <= n else n)\r\n \r\n ", "\"\"\"\r\n https://codeforces.com/contest/750/problem/A\r\n Solution accepted\r\n Méthode : formule fermée\r\n\"\"\"\r\n\r\n\"\"\"\r\n Pour résoudre n problèmes il faut un temps égal à :\r\n 5 + 2*5 + 3*5 + ... + n*5 = 5(1+2+3+...+n) = 5n(n+1)/2 = (5n**2 + 5n)/2\r\n Donc en un temps t le maximum de problèmes résolubles vérifie l'équation :\r\n (5n**2 + 5n)/2 = t soit 5n**2 + 5n - 2t = 0\r\n C'est une équation du second degré !\r\n delta = 25 - 40t\r\n Les deux solutions sont (-5 + sqrt(delta))/10 et (-5 - sqrt(delta))/10\r\n La plus grande est évidemment la première, et comme le nombre de problèmes\r\n résolubles est un entier, le maximum de problèmes résolubles en un temps t\r\n est donc nmax = (-5 + sqrt(25 - 40t)) // 10 (division entière !)\r\n Le nombre maximum de problèmes que peut résoudre Limak est donc\r\n min(nbPb, nmax). Bah oui, il ne va pas résoudre plus de problèmes\r\n qu'il n'y en a !\r\n\"\"\"\r\n \r\nimport math\r\n \r\ndef nbMaxPb(tempsDispo):\r\n \"\"\"\r\n Retourne le nb de pb que l'on peut traiter en tempsDispo minutes.\r\n C'est la plus grande racine de f(n) = 5n**2+5n-2d\r\n ou d est le temps disponible et n le nb de pbs.\r\n \"\"\"\r\n return int((-5 + math.sqrt(25 + 40 * tempsDispo)) // 10)\r\n \r\ndef tempsDispo(tempsTrajet):\r\n return 240 - tempsTrajet\r\n \r\ndef nbPbResolubles(nbPbTotal, tempsTrajet):\r\n return min(nbPbTotal, nbMaxPb(tempsDispo(tempsTrajet)))\r\n \r\nnbPb, trajet = map(int,input().split(\" \"))\r\nprint(nbPbResolubles(nbPb, trajet))\r\n", "n,k = map(int,input().split())\r\nsum = 0\r\ncount = 0\r\ndiff = 240 - k\r\nfor i in range(1,n+1):\r\n sum = sum+i*5\r\n if sum <= diff:\r\n count = count +1\r\n \r\n \r\nprint(count)", "n, k = list(map(int, input().split()))\r\nk = 240 - k\r\na = [0] * (n + 1)\r\nfor i in range(n + 1):\r\n if i == 0:\r\n a[0] = 0\r\n else:\r\n a[i] = a[i - 1] + 5 * i\r\nleft = 0\r\nright = n + 1\r\nwhile left + 1 != right:\r\n m = (left + right) // 2\r\n if a[m] > k:\r\n right = m\r\n else:\r\n left = m\r\nprint(left)", "n, k = [int(x) for x in input().split()]\ntime = 240 - k \ncount = 0\nfor x in range(1, n+1):\n if time - (x * 5) < 0:\n print(count)\n exit()\n else:\n time -= (x*5)\n count += 1\nprint(count)\n", "n, k = map(int, input().split())\r\n\r\nx=240-k\r\nc=0\r\nt=1\r\nwhile x>=t*5 and t<=n:\r\n c+=1\r\n x=x-t*5\r\n t+=1\r\nprint(c)\n# Sat Mar 25 2023 10:45:03 GMT+0300 (Moscow Standard Time)\n", "n, k = map(int, input().split())\r\ntime = 240 - k # time Limak has for solving problems\r\ncount = 0\r\nfor i in range(1, n+1):\r\n if 5 * i <= time:\r\n count += 1\r\n time -= 5 * i\r\n else:\r\n break\r\nprint(count)\r\n", "n, k = map(int, input().split())\r\n\r\ntime_left = 240 - k # Total time available to solve problems\r\nproblems_solved = 0 # Initialize the number of problems solved\r\n\r\nfor i in range(1, n + 1):\r\n time_needed = 5 * i # Time needed to solve the i-th problem\r\n if time_needed <= time_left:\r\n problems_solved += 1\r\n time_left -= time_needed\r\n else:\r\n break # Stop if Limak doesn't have enough time for the next problem\r\n\r\nprint(problems_solved)\r\n", "n,k=map(int,input().split())\r\nt=k\r\nq=0\r\nif t<240:\r\n for i in range(1,n+1):\r\n t=t+5*i\r\n if t<=240:\r\n q=q+1\r\n else:\r\n break\r\nprint(q)", "x = input()\r\nn , k = x.split(\" \")\r\nn = int(n)\r\nk = int(k)\r\ntime = 0\r\ncount = 0\r\nfor i in range(1, n+1):\r\n time += i*5\r\n count += 1\r\n temp = time+k\r\n if temp <= 240:\r\n continue\r\n else:\r\n count -= 1\r\n break\r\n\r\nprint(count)", "n,k = map(int, input().split(' '))\r\nm = (240 - k) // 5\r\nans=0\r\n# print(m)\r\nfor i in range(1,n+1):\r\n # print(m,i)\r\n if(m > i):\r\n m -= i\r\n \r\n else:\r\n # print(m,i,'--')\r\n if m == i:\r\n ans = i\r\n else:\r\n ans = i - 1\r\n break\r\nelse:\r\n ans = i\r\n \r\n \r\nprint (ans)\r\n \r\n \r\n", "import sys\n\ndef solve():\n n,k = list(map(int,sys.stdin.readline().split()))\n\n time_rem = 240 - k\n prob_solve = 0\n\n for i in range(n):\n if 5 * (i+1) <= time_rem:\n prob_solve += 1\n time_rem -= 5 * (i+1)\n else:\n break\n \n print(prob_solve)\n\n\n\nif __name__ == '__main__':\n solve()", "n, k = map(int, input().split())\r\nt = 240 - k\r\np = 0\r\nfor i in range(1, n + 1):\r\n r = 5 * i\r\n if t >= r:\r\n p += 1\r\n t -= r\r\n else:\r\n break\r\nprint(p)\r\n", "n,k=map(int,input().split())\r\nr1=240-k\r\nl=0\r\nfor i in range(1,n+1):\r\n if r1-i*5>=0:\r\n l+=1\r\n r1-=i*5\r\nprint(l)\r\n", "n, k = map(int, input().split())\r\nk_last = 240 - k\r\ncount = 0\r\nc = 5\r\nfor i in range(2,n+2):\r\n if c <= k_last:\r\n count +=1\r\n c += (i*5)\r\nprint(count)", "n,m=map(int,input().split())\r\nx=240-m\r\ncount=0\r\ni=1\r\nwhile(i<=n):\r\n if i*5<=x:\r\n count+=1\r\n x=x-(i*5)\r\n i=i+1\r\n else:\r\n break\r\nprint(count)", "n, k = map(int, input().split())\r\nreq = 240 - k\r\nans = 0\r\ni, j = 1, 240\r\nwhile i < j:\r\n mid = (i + j) // 2\r\n if 5 * (mid * (mid + 1) / 2) <= req:\r\n ans = max(mid, ans)\r\n i = mid + 1\r\n else:\r\n j = mid\r\nprint(min(ans, n))", "n, m=map(int, input().split())\r\nt = 240 - m\r\nl = 0\r\nr = n+1\r\nwhile (r -l > 1):\r\n c = (r+l)//2\r\n vrem = (5*c + 5*c*c)//2;\r\n if (t>=vrem):\r\n l = c\r\n else:\r\n r = c\r\nprint(l)\r\n \r\n \r\n \r\n", "time_until_party = 4*60\nproblems, time_to_drive = map(int, input().split())\ntime_until_party -= time_to_drive\n\nfor i in range(1, problems+1):\n if time_until_party >= i*5:\n time_until_party -= i*5\n else:\n print(i-1)\n exit()\n\nprint(problems)\n\n \t \t\t\t \t\t \t\t\t \t\t \t \t", "x,y=map(int,input().split())\r\nwhile(x*(x+1)//2*5>240-y):\r\n x-=1\r\nprint(x)", "x = input().split()\nn = int(x[0])\nk = int(x[1])\ntime = 240 - k\nques = 0\nfor i in range(1,n+1):\n if(time >= 0):\n time -= (5 * i)\n if(time >= 0):\n ques += 1\n if(time < 0):\n break\nprint(ques)\n\n \t\t \t \t \t\t\t\t \t \t\t\t \t\t\t \t\t\t", "a, b = map(int,input().split())\r\nb = 240 - b\r\nval = 0\r\nfor i in range(1, a+1):\r\n if b >= 5*i:\r\n b -= 5*i\r\n val += 1\r\nprint(val)", "n, k = list(map(int, input().split()))\r\nm = 240 - k\r\nb = 0\r\nwhile m >= (b + 1) * 5 and n > 0:\r\n b += 1\r\n n -= 1\r\n m -= b * 5\r\nprint(b)\r\n", "n, k = list(map(int, input().split()))\r\n\r\ntimes = []\r\ntime = 0\r\nres = 0\r\nwhole_time = 240 - k\r\n\r\nfor i in range(1, n+1):\r\n times.append(5 * i)\r\n \r\nfor i in range(n):\r\n time += times[i]\r\n res = i\r\n if time > whole_time:\r\n break\r\n elif time == whole_time:\r\n res += 1\r\n break\r\n elif i == n-1 and time < whole_time:\r\n res += 1\r\n break\r\n\r\nprint(res)", "n , k = list(map(int , input().split()))\r\nr = 240 - k \r\n\r\ns = 1 \r\nc = 0 \r\n\r\n\r\nwhile s <= n : \r\n if(r - s * 5 < 0):\r\n break \r\n else:\r\n c += 1 \r\n r -= (s * 5)\r\n s += 1\r\n\r\nprint(c)", "n, k = map(int, input().split())\ncount = 1\nt = count * 5\nwhile t + k <= 240 and count <= n:\n count += 1\n t = t + count * 5\nprint(count - 1)", "n,k = map(int,input().split())\r\nbaza = 240-k\r\ncount = 0\r\nfor i in range(n):\r\n if baza - 5*(i+1) < 0:\r\n break\r\n else:\r\n count+=1\r\n baza-=5*(i+1)\r\nprint(count)", "n, k = map(int, input().split())\nm = 240 - k\ns = 0\nw = 0\nfor i in range(1, n + 1):\n s += i * 5\n if s <= m:\n w = i\n else:\n break\nprint(w)\n \n\n\n\n\n\n", "n,k=map(int,input().split())\r\nh=240-k\r\ns=0\r\nm=0\r\nfor i in range(1,n+1):\r\n s+=i*5\r\n if s<=h:\r\n m+=1\r\n else:\r\n break\r\nprint(m)\r\n", "n, k = map(int, input().split())\r\nmatch_time=240\r\ntime_to_solve = match_time-k\r\ntasks_count=0\r\ni=1\r\n\r\nwhile i<=n:\r\n if 5*i<=time_to_solve:\r\n tasks_count+=1\r\n time_to_solve-=5*i\r\n else:\r\n break\r\n i+=1\r\nprint(tasks_count)", "n,k=map(int,input().split())\r\nans=0\r\nk=240-k\r\nfor i in range(1,n+1):\r\n if(k>=5*i):\r\n k-=5*i\r\n else:\r\n i=i-1\r\n break\r\nprint(i)", "m = input().split()\nz=int(m[0])\nx=int(m[1])\nk = 240 - x\nh = 5\ns=0\nfor i in range (z):\n\tk-=h\n\tif k <0:\n\t\tbreak\n\th+=5\n\ts+=1\nprint(s)", "n,k= map(int,input().split())\r\nneed =0\r\nans =0\r\ntime = 240\r\ntime-=k\r\nfor i in range(1,n+1):\r\n need += 5*i\r\n if (need <= time):\r\n ans += 1\r\n else:\r\n break\r\nprint(ans)", "n,k = map(int,input().split())\r\nt = 0\r\nans = 0\r\nfor i in range(1,n+1):\r\n t = t+i*5\r\n if t+k<=240:\r\n ans = i\r\n else:\r\n break\r\nprint(ans)\r\n \r\n ", "a,b = map(int,input().split())\r\ns = 0\r\n \r\nfor i in range(a+20):\r\n x = 5*i\r\n \r\n \r\n if b+x <= 240:\r\n s = s+1\r\n b = b+x\r\n else:\r\n \r\n if s > a: \r\n print(a)\r\n break\r\n else:\r\n print(s-1)\r\n break", "n = list(map(int, input().split()))\n\nminutes = 0\nsolveCounter = 0\ntotalTime = 4 * 60\nhasTime = totalTime - n[1]\n\nfor i in range(1, n[0] + 1):\n\n minutes += i * 5\n\n if minutes > hasTime:\n break\n else:\n solveCounter += 1\n\nprint(solveCounter)\n", "g,k=list(map(int,input().split()))\r\nt=240-k\r\n \r\n \r\nc=0\r\ns=0\r\nwhile True:\r\n \r\n \r\n if(t>=s):\r\n s=s+(5*c)\r\n c=c+1\r\n else:\r\n break\r\n \r\n \r\nif(c-2>=g):\r\n print(g)\r\n \r\n \r\nelse:\r\n print(c-2)", "a=list(map(int,input().split()))\r\ns=0\r\nc=0\r\nfor i in range(1,a[0]+1):\r\n s=s+(i*5)\r\n \r\n if((s+a[1])<=240):\r\n c=c+1\r\n else:\r\n break\r\nprint(c) ", "n, k = map(int, input().split())\r\nfree = 240 - k\r\np, i = 0, 1\r\nwhile free >= 5 * i and n > p:\r\n free -= 5 * i\r\n i += 1\r\n p += 1\r\nprint(p)", "n,distance = map(int,input().split())\r\ntotal = 240 - distance\r\nresult = 0\r\ni = 1\r\nwhile(total>0):\r\n if(result==n):\r\n break\r\n if(total-(5*i)>=0):\r\n result+=1\r\n total = total - (5*i)\r\n i += 1\r\n else:\r\n break\r\nprint(result)", "n, k = map(int, input().split())\ntime = 240 - k\ntasks = 0\n\nfor i in range(1, n + 1):\n if time >= i * 5:\n tasks += 1\n time -= i * 5\n\nprint(tasks)\n", "x,y=map(int,input().split())\r\ns=240\r\nr=0\r\nrem=s-y\r\nc=0\r\nfor i in range(1,x+1):\r\n r+=5*i\r\n if r<=rem:\r\n c+=1\r\n\r\n\r\nprint(c)\r\n", "n,k = map(int, input().split())\r\nmid = 240\r\nsolve = mid - k\r\ncount = 0\r\nfor i in range(1,n+1):\r\n if solve - (i*5) >= 0:\r\n count = count + 1\r\n solve = solve - (i*5)\r\nprint(count)", "A=[int(x) for x in input().split()]\r\nn=A[0]\r\nk=A[1]\r\nobg=240\r\nost=obg-k\r\nm=5\r\ncount=0\r\nwhile ost>0 and ost!=0 and count<n and ost >= m:\r\n ost=ost-m\r\n m+=5\r\n count+=1\r\nprint(count)", "n,k=map(int,input().split())\r\ncount=0\r\nfor i in range(1,n+1):\r\n if (count+(5*i))>(240-k):\r\n print(i-1)\r\n break\r\n else:\r\n count+=(5*i)\r\nelse:\r\n print(n)\r\n ", "n, k = map(int, input().split())\r\n\r\nps = 0\r\ntl = 240 - k\r\n\r\n\r\nfor i in range(1, n+1):\r\n tr = 5 * i\r\n if tl >= tr:\r\n ps += 1\r\n tl -= tr\r\n else:\r\n break\r\n\r\nprint(ps)\r\n", "n,k=map(int,input().strip().split())\r\nnew_list=[]\r\nnew_list=[i for i in range(1,n+1) if ((5*(i)*(i+1)*(1/2))+k<=240)]\r\nif(new_list==[]):\r\n print(0)\r\nelse:\r\n print(max(new_list))\r\n", "\"\"\"\r\n author: Adham0 \r\n created: 05.08.2023 22:52:01\r\n ### I was here ###\r\n \r\n █████ ██████ ██ ██ █████ ███ ███\r\n ██ ██ ██ ██ ██ ██ ██ ██ ████ ████\r\n ███████ ██ ██ ███████ ███████ ██ ████ ██\r\n ██ ██ ██ ██ ██ ██ ██ ██ ██ ██ ██ \r\n ██ ██ ██████ ██ ██ ██ ██ ██ ██\r\n\"\"\"\r\n\r\n\r\nn, k = [int(i) for i in input().split()]\r\n\r\nq = 4 * 60\r\nz = q - k\r\n\r\nsum = 0\r\ni = 1\r\nwhile i <= n and sum <= z:\r\n if 5 * i <= z - sum:\r\n sum += 5 * i\r\n i += 1\r\n else:\r\n break\r\n\r\nprint(i - 1)", "import math\r\n\r\nn, k = map(int, input().split())\r\n\r\nanswer = math.floor((math.sqrt(25 + 40 * (4 * 60 - k)) - 5) / 10)\r\n\r\nif answer > n:\r\n answer = n\r\n\r\nprint(answer)", "n,m=map(int,input().split())\r\ntime=240-m\r\n\r\ni=1\r\nct=0\r\nwhile n>0 and time>=0:\r\n if time-i*5<0:\r\n break\r\n elif time-i*5>=0:\r\n ct+=1\r\n n-=1\r\n time-=i*5\r\n i+=1\r\nprint(ct)", "limakgot = 240\r\nn,k = map(int,input().split())\r\n\r\ncounter = 0\r\nfor i in range(1,n+1):\r\n limakgot -= 5*i\r\n counter += 1\r\n if limakgot < k:\r\n counter -= 1\r\n break\r\nprint(counter)", "n, k = list(map(int, input().split()))\r\ntime = 240 - k\r\nc = 0\r\nt = 0\r\nfor i in range(1,n+1):\r\n t += 5 * i\r\n if t > time:\r\n break\r\n else:\r\n c+=1\r\n continue\r\nprint(c)", "no_of_problems, time = map(int, input().split())\r\n\r\navailable_time = 240 - time\r\n\r\nsolvable_problems_count = 0\r\n\r\nfor i in range(1, no_of_problems + 1):\r\n if available_time >= 5 * i:\r\n solvable_problems_count += 1\r\n available_time -= 5 * i\r\n else:\r\n break\r\n\r\nprint(solvable_problems_count)", "n,k=map(int, input().split())\nres1=0\npartytime=240-k\ncount=0\nfor i in range(1, partytime+1):\n fres=5*i\n res1=res1+fres\n if(count>n):\n count=count-1\n break\n if(res1<=partytime):\n count=count+1\n else:\n break\nprint(count)\n\t \t\t \t\t \t\t \t \t \t \t\t\t\t", "a,b=map(int,input().split())\r\nc=240-b\r\ns=0\r\ni=1\r\nfor i in range(a):\r\n c-=5*(i+1)\r\n if c<0:\r\n break\r\n else:\r\n s+=1\r\nprint(s)", "n, k = map(int, input().split(' '))\r\n\r\nt = 240 - k\r\n\r\ni = 1\r\nwhile t >= 5 * i and i <= n:\r\n t -= 5 * i\r\n # print(t)\r\n i += 1\r\n \r\nprint(i-1)", "n,k=map(int,input().split())\r\nt=240-k\r\ns=0\r\n\r\nfor i in range(1,n+1):\r\n if t >= 5*i:\r\n s=s+1\r\n t=t-(5*i)\r\n else:\r\n break\r\nprint(s)\r\n", "n, k = map(int, input().split())\r\nk = 240-k\r\ni = 1\r\nwhile i<=n and k-5*i>=0:\r\n k-=5*i\r\n i+=1\r\nprint(i-1)", "soru,n=input().split()\r\na=1\r\nsure=240-int(n)\r\nwhile sure>0:\r\n sure=sure-5*a\r\n if sure>=0:\r\n a=a+1\r\na=a-1\r\nif int(soru)<a:\r\n print(soru)\r\nelse:\r\n print(a)", "n,k= (map(int,input().split()))\r\n\r\nc= k/60\r\nx=0\r\nz=0.08333\r\nfor i in range(1,n+1):\r\n c+=0.08333*i\r\n \r\n if c<4:\r\n x+=1\r\n continue\r\n\r\nprint(x)", "kol, vr = [int(i) for i in input().split()]\r\nost = 240 - vr\r\notv = 0\r\nfor j in range(1, kol + 1):\r\n if ost >= 5 * j:\r\n otv += 1\r\n ost -= 5 * j\r\n else:\r\n break\r\nprint(otv)", "n,k=map(int,input().split())\r\na=(240-k)//5\r\nx=0\r\ny=20\r\nwhile y-x!=1:\r\n z=(x+y)//2\r\n if z*(z+1)//2 > a:\r\n y=z\r\n else:\r\n x=z\r\nif x>n:\r\n print(n)\r\nelse:\r\n print(x)\r\n", "# https://codeforces.com/problemset/problem/750/A\r\n\r\n# Time complexity: O(N) Linear runtime\r\n# Space complexity: O(1) Constant space\r\ndef solve(num_problems, minutes):\r\n minutes_left = 240 - minutes\r\n minutes_spend = 0\r\n solved = 1\r\n while True:\r\n minutes_spend += 5*solved\r\n if solved <= num_problems and minutes_spend <= minutes_left:\r\n solved += 1\r\n else:\r\n break\r\n return solved - 1\r\n\r\nn, k = [int(e) for e in input().split()]\r\nprint(solve(n, k))\r\n", "n,k=map(int,input().split())\r\ntime_for_problems = 4*60-k\r\n\r\nrt=(9625-40*(k))**(1/2)\r\nmax=int((rt-5)/10)\r\nif max<n:\r\n print(max)\r\nelse:\r\n print(n)", "a,b=map(int,input().split())\r\nx=240\r\ns=0\r\ni=1\r\nt=0\r\nc=5\r\nwhile True:\r\n x-=c\r\n c+=5\r\n i+=1\r\n if x<b:\r\n break\r\n t+=1\r\n if t>a:\r\n t=a\r\n break\r\nprint(t)\r\n\r\n", "\r\n\r\nn, k = map(int, input().split())\r\ntimeInHand = 240 - k\r\ni = 1\r\nsolveConter = 0\r\nwhile n:\r\n timeInHand -= i*5\r\n solveConter += 1\r\n i += 1\r\n if timeInHand < 0:\r\n solveConter -= 1\r\n break\r\n n -= 1\r\nprint(solveConter)", "def Problem_Party(n, k):\r\n\r\n time = k\r\n\r\n p_splve = 0\r\n\r\n for i in range(1, n + 1):\r\n\r\n if time + (i * 5) <= 240:\r\n time += (i * 5)\r\n p_splve += 1\r\n\r\n return p_splve\r\n\r\nn, k = map(int, input().split())\r\n\r\nprint(Problem_Party(n, k))", "# n problems\r\n# 1 - n difficulty increase\r\n# 5 * i minutes to solve one ith\r\n# k minute to get to frnd house\r\n# how many problem to make it to the party\r\n\r\nn, k = map(int, input().split())\r\n\r\nl, r = 0, n\r\n\r\ndef canSolve(mid):\r\n time = 240 - k\r\n tot = (mid * (mid + 1)) // 2 * 5\r\n return tot <= time\r\n \r\nwhile l <= r:\r\n mid = l + (r - l)//2\r\n \r\n if canSolve(mid):\r\n l = mid + 1\r\n else:\r\n r = mid - 1\r\n\r\nprint(l - 1)", "d, b = map(int, input().split()); c = [b + 5 * (a) * (a+1) / 2 <= 240 for a in range(1,d+1)]; print((c.index(False) if not c[-1] else d))", "n, k = map(int, input().split())\r\n\r\n# Calculate the time Limak has before midnight (in minutes)\r\nremaining_time = 4 * 60 - k\r\n\r\nproblems_solved = 0\r\ntime_required = 0\r\n\r\n# Iterate through the problems and solve as many as possible within the remaining time\r\nfor i in range(1, n + 1):\r\n time_required += i * 5\r\n if time_required <= remaining_time:\r\n problems_solved += 1\r\n else:\r\n break\r\n\r\nprint(problems_solved)\r\n", "a = input()\r\na = a.split()\r\na = [int(x) for x in a]\r\nb = 240 - a[1]\r\nn = 0\r\nk = 0\r\nfor i in range(1,a[0]+1):\r\n n += 5*i\r\n if (b - n) >= 0:\r\n k += 1\r\n else:\r\n break\r\nprint(k)", "n, k = map(int, input().split())\r\ntime_left = 240 - k\r\nproblems_solved = 0\r\nfor i in range(1, n+1):\r\n time_required = 5*i\r\n if time_required <= time_left:\r\n time_left -= time_required\r\n problems_solved += 1\r\n else:\r\n break\r\nprint(problems_solved)\r\n", "n,k = map(int,input().split())\r\ntime = 60*4\r\nc = 0\r\nw = 0\r\nfor i in range(1,n+1):\r\n if(time-(w+i*5)>=k):\r\n c += 1\r\n w += i*5\r\n else:\r\n break\r\nprint(c)", "n, k = map(int, input().split())\r\ntime_till_midnight = 240 # percekben\r\n\r\n# while-lal próbálkozás:\r\n\r\ni = 0\r\ntime_left = time_till_midnight - k\r\nwhile (time_left >=0):\r\n\ti \t\t\t+= 1\r\n\ttime_left \t-= 5*i\r\nprint(min(n,i-1))", "nk = input().split()\r\nn = int(nk[0])\r\nk = 240 - int(nk[1])\r\ns = 0\r\ni = 1\r\nwhile k >= (i * 5):\r\n s += 1\r\n k -= i * 5\r\n i += 1\r\nif s > n:\r\n print(n)\r\nelse:\r\n print(s)", "n, k = map(int, input().split())\r\nt = 0\r\ncnt = 0\r\nwhile (t + k <= 240) and (cnt <= n):\r\n t += (cnt + 1) * 5\r\n if (t + k <= 240) and (cnt < n):\r\n cnt += 1\r\nprint(cnt)\r\n", "n,k=map(int,input().split())\r\ncount=0\r\nrem_time=0\r\nfor i in range(1,n+1):\r\n rem_time+=5*i\r\n if 240-rem_time>=k:\r\n count+=1\r\n else:\r\n break\r\nprint(count)", "n, k=map(int, input().split())\r\nwhile ((10+5*n-5)/2)*n>240-k:\r\n n-=1\r\nprint(n)", "questions, time = tuple(map(int, input().split()))\r\nremaining = 240 - time\r\ncount = 0\r\nvalue = 5\r\nmulti = 5\r\nwhile remaining >= value:\r\n count += 1\r\n multi += 5\r\n value += multi\r\n\r\nprint(min(questions, count))\r\n", "def main() -> None :\r\n print(max_Solved_Problem_Count(*user_Inputs()))\r\n\r\n\r\ndef max_Solved_Problem_Count(contest_problem_count: int, minutes_to_go_party: int) -> int:\r\n return min(contest_problem_count, solved_Problem_Count(left_Minutes_For_Problem(minutes_to_go_party)))\r\n\r\ndef left_Minutes_For_Problem(minutes_to_go_party: int) -> int :\r\n return 60*4 - minutes_to_go_party\r\n\r\ndef solved_Problem_Count(minutes_to_solve: int) -> int :\r\n return int((-5 + (25 + 40*minutes_to_solve)**0.5) / 10)\r\n\r\n\r\ndef user_Inputs() -> 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()", "time = 4 * 60\r\nn, k = map(int, input().split())\r\ntime -= k\r\ni = 1\r\nwhile i <= n and time - i * 5 >= 0:\r\n time -= i * 5\r\n i += 1\r\nprint(i - 1)", "a,b = [int(x) for x in input().split()]\r\nc = 0\r\ni = 1\r\nwhile(240-b-5*(i*(i+1)/2) >=0 and i<=a):\r\n c +=1\r\n i=i+1\r\nprint(c)", "n=list(map(int,input().split(\" \")))\r\ntotal=240\r\nrem=total-n[-1]\r\nsum=0\r\ncount=0\r\nfor i in range(1,n[0]+1):\r\n sum+=5*i\r\n\r\n if sum<=rem:\r\n count += 1\r\nprint(count)", "n ,k = map(int ,input() .split())\r\ns = 0\r\nw = 0\r\nq = 240 - k\r\nfor i in range(1 ,n + 1):\r\n s += (5 * i)\r\n if s <= q:\r\n w += 1\r\nprint(w)\r\n", "n,k = map(int,input().split());k = 240-k;c = 0\r\nfor i in range(1,n+1):\r\n k -= i*5\r\n if k>=0: c+=1\r\nprint(c)", "minutos_restantes = 240\r\nbt = input().split()\r\nqtd = int(bt[0])\r\ncaminho = int(bt[1])\r\nminutos_restantes -= caminho\r\n\r\ncontador = 0\r\nfor x in range(qtd):\r\n tempo_gasto = 5*(x+1)\r\n if minutos_restantes - tempo_gasto >= 0:\r\n contador += 1\r\n minutos_restantes -= tempo_gasto\r\n else:\r\n break\r\n\r\nprint(contador)\r\n", "n,k = map(int,input().split())\r\n\r\ntot = 0\r\nans = 0\r\n\r\nfor i in range(1,n+1):\r\n\ttot += 5*i \r\n\tif tot > 240 - k:\r\n\t\tbreak\r\n\telse:\r\n\t\tans += 1\r\n\r\nprint(ans)", "n, k = map(int, input().split())\r\ntasks = [i*5 for i in range(1,n+1)]\r\nrest = 240-k\r\nans = 0\r\nt = 0\r\nfor i in tasks:\r\n t += i\r\n if t <= rest:\r\n ans += 1\r\nprint(ans)\r\n", "s,p=map(int,input().split())\r\nc=240-p\r\ni=0\r\nwhile i<=s:\r\n if c-(5*(i+1))>=0:\r\n i+=1\r\n c-=5*i\r\n continue\r\n else:\r\n break\r\nprint(i) if i<s else print(s)", "a, b = map(int, input().split())\r\nwhile (((1 + a) / 2) * a*5) + b > 240: a -= 1\r\nprint(a)", "import sys\r\n\r\nn, k = [int(x) for x in sys.stdin.readline().split()]\r\ntime = 240 - k\r\n\r\ncounter = 0\r\n\r\nwhile n > counter:\r\n time = time - (5 * (counter + 1))\r\n if time < 0:\r\n break\r\n else:\r\n counter += 1\r\n\r\nprint(counter)", "n = input().split()\r\nn0 = int(n[0])\r\nn1 = int(n[1])\r\ns = 0\r\nc = 0\r\nfor i in range(1,n0+1):\r\n s += 5*i\r\n t = s + n1\r\n \r\n if t> 240:\r\n break\r\n elif t <= 240:\r\n c+=1\r\nprint(c) \r\n", "hn, hk = map(int, input().split())\r\n\r\ntotal_time = 240 - hk # Time available for solving problems\r\nproblems_solved = 0\r\n\r\nfor i in range(1, hn+1):\r\n time_to_solve = 5 * i\r\n if total_time - time_to_solve >= 0:\r\n total_time -= time_to_solve\r\n problems_solved += 1\r\n else:\r\n break\r\n\r\nprint(problems_solved)\r\n", "n, k = map(int, input().split())\r\nt = 240 - k\r\nl = 1\r\nr = n\r\n\r\nwhile l <= r:\r\n mid = (l + r) // 2\r\n time_needed = mid * (mid + 1) // 2 * 5\r\n\r\n if time_needed <= t:\r\n l = mid + 1\r\n else:\r\n r = mid - 1\r\n\r\nprint(min(r, n)) # Print the maximum possible problems within time limit\r\n", "n, k = map(int, input().split())\r\nc = 0\r\np1 = 0\r\np2 = 0\r\nfor i in range(1, n + 1):\r\n p1 = 5 * i\r\n p2 += p1\r\n if p2 + k <= 240:\r\n c = i\r\n\r\nprint(c)\r\n\r\n\r\n\r\n\r\n", "n,k=[int(integer) for integer in input().strip().split(\" \")]\r\ncount,k=0,240-k\r\nfor i in range(n):\r\n if(5*(i+1)<=k):\r\n k-=5*(i+1)\r\n count+=1\r\nprint(count)", "n, k = list(map(int, input().split()))\r\nk = 240 - k\r\nc = 0\r\nfor i in range(1, n + 1):\r\n x = 5 * i\r\n if k < x:\r\n break\r\n k -= x\r\n c+=1\r\nprint(c)\r\n", "n,m=map(int,input().split())\r\nm1=240-m\r\nc1=0\r\ni=1\r\nwhile(i<=n):\r\n if i*5<=m1:\r\n c1=c1+1\r\n m1=m1-(i*5)\r\n i=i+1\r\n else:\r\n break\r\nprint(c1)", "a,b=map(int,input().split())\r\ntime=240-b\r\nc=0\r\nfor i in range(1,a+1):\r\n if time-5*i>=0:\r\n c+=1\r\n time-=5*i\r\nprint(c)", "n, k = map(int, input().split())\r\n\r\ntimer = 240 - k\r\n\r\ni = 1\r\n\r\nwhile n > 0:\r\n if (timer - 5 * i < 0):\r\n print(i - 1)\r\n break\r\n timer -= 5 * i\r\n n -= 1\r\n i += 1\r\nelse:\r\n print(i - 1)", "def main():\r\n #vjknbkjxnbkjvnbkjxnvlc nxkcvn kxnkxvnbkdjvx\r\n while True:\r\n try:\r\n n, k = map(int, input().split())\r\n res = 240 - k#dfkjnkjdfnbkjdvb\r\n sum_ = 0\r\n c = 0#fkjgblkjsfdgbljksdfg\r\n \r\n#dhfbkjsdbgvkdhfkjdhkjgddf\r\n\r\n for i in range(1, n + 1):\r\n sum_ += 5 * i\r\n#kjadnbslkjsblvkjbxf\r\n if sum_ > res:\r\n break\r\n#zkjfvbkjfbkjxvb\r\n c += 1\r\n \r\n#khvbisdhfgvbidfhbihdf\r\n\r\n print(c)\r\n\r\n except EOFError:#skjbglksdjfgblkjsdfgbkjdhjlgf\r\n break\r\n \r\n#yliglkfdbvkjsfdbkjsdfbkljdbkjldfbdfhf\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n, k = map(int,input().split())\r\nm = 240 - k\r\nd = 5*((n*(n+1))//2)\r\nwhile(d > m):\r\n n = n - 1\r\n d = 5*((n*(n+1))//2)\r\nprint(n)", "n, k = list(map(int, input().split(' ')))\r\nall_time = 240 - k\r\npoint = 0\r\ni = 1\r\nwhile i <= n:\r\n if 5 * i <= all_time:\r\n point += 1\r\n all_time -= 5 * i\r\n else: break\r\n i += 1\r\nprint(point)", "def New_Year_and_Hurry(n, minutes):\r\n time = 240\r\n counts = 0\r\n for i in range (1,n+1):\r\n if (time - minutes) >= 5*i:\r\n counts+=1\r\n time = time - (5*i)\r\n return counts\r\n\r\nn, minutes = map(int, input().split())\r\nprint(New_Year_and_Hurry(n,minutes))", "nums = input()\r\nlist = nums.split(\" \")\r\ntime = 240 - int(list[1])\r\nfinal = 0\r\nrest = 0\r\n\r\nwhile time > rest and final < int(list[0]):\r\n final += 1\r\n rest += final * 5\r\nif rest > time:\r\n final -=1\r\nprint(final) \r\n", "n, k = map(int, input().split())\nc = 0\ntime = 240-k\nfor i in range(1, n+1):\n\ttime -= 5*i\n\tif time >= 0:\n\t\tc += 1\n\telse:\n\t\tbreak\n\t\t\nprint(c)\n\t\t\t \t \t\t \t\t \t\t\t\t \t\t\t\t \t\t \t", "n, k = map(int, input().split())\r\nt = 240\r\nt -= k\r\nsum = 0\r\nresult = 0\r\n\r\nfor i in range(1, n + 1):\r\n sum += i * 5\r\n if sum <= t:\r\n result += 1\r\n else:\r\n break\r\n\r\nprint(result)\r\n", "n,k = input().split()\r\nn = int(n)\r\nk = int(k)\r\nproblems = 0\r\nmins = 0\r\nfor i in range(1,n+1):\r\n mins += i*5\r\n if 240 >= mins + k:\r\n problems+=1\r\n else:\r\n break\r\nprint(problems)", "n, k = map(int, input().split())\r\ntime_left = 240 - k\r\nsolved_tasks = 0\r\n\r\nfor i in range(1, n+1):\r\n if time_left >= 5*i:\r\n solved_tasks += 1\r\n time_left -= 5*i\r\n else:\r\n break\r\n\r\nprint(solved_tasks)", "n, k = map(int, input().split())\r\ntime = 0\r\nfor i in range(1, n + 1):\r\n time += 5 * i\r\n if time + k > 240:\r\n print(i - 1)\r\n break\r\nelse:\r\n print(n)\r\n", "n,k=map(int,input().split())\r\nfor i in range(n,-1,-1):\r\n if 5*((i*(i+1))//2)<=(240-k):\r\n print(i)\r\n break", "m=240\r\nn,k=map(int,input().split())\r\nm-=k\r\np=0\r\nfor i in range(1,n+1):\r\n m-=(i*5)\r\n if m<0:\r\n print(i-1)\r\n break\r\nif m>=0:\r\n print(n)", "n,m=map(int,input().split())\r\nl=240;\r\nz=0;\r\nt=0;\r\nl=k=0;\r\ny=[]\r\nfor i in range(1,n+1):\r\n z+=1;\r\n t+=z*5;\r\n if t+m>240:\r\n k=z-1;\r\n y.append(k);\r\n else:\r\n y.append(n);\r\nprint(min(y));\r\n ", "n, k = [int(i) for i in input().split()]\r\ntotal = 5*n*(n + 1)/2 + k\r\nwhile total > 240:\r\n n -= 1\r\n total = 5*n*(n+1)/2 + k\r\nprint(n)\r\n", "def solve(num, t):\r\n solved = 0\r\n problem_solved = 0\r\n for i in range(1, num+1):\r\n solved += 5 * i\r\n if solved + t > 240:\r\n break\r\n problem_solved += 1\r\n return problem_solved\r\n\r\n\r\nn, t = map(int, input().split())\r\n\r\nsol = solve(n, t)\r\nprint(sol)", "raw=input()\r\nraw2=raw.split()\r\n\r\nn=int(raw2[0])\r\nk=int(raw2[1])\r\n\r\ncount=0\r\n\r\nminutes=240-k\r\n\r\nfor i in range(1,n+1):\r\n if 5*i<=minutes:\r\n count+=1 \r\n minutes-=5*i \r\n #count-=1 \r\n else:\r\n break \r\n #count+=1\r\n \r\nprint(count)", "def main(n, k):\r\n m, p = 240 - k, 0\r\n\r\n for i in range(n):\r\n if m - 5 * (i + 1) >= 0:\r\n m -= 5 * (i + 1)\r\n p += 1\r\n else: break\r\n\r\n return p\r\n\r\nif __name__ == \"__main__\":\r\n n, k = map(int, input().split())\r\n\r\n print(main(n, k))", "n, m = map(int, input().split())\r\ntime = 4 * 60 - m\r\ni = 1\r\nwhile time > i * 5 and i < n:\r\n time -= i * 5\r\n i += 1\r\nif time < i * 5:\r\n print(i - 1)\r\nelse:\r\n print(i)\r\n\r\n", "a, b = map(int, input().split())\n\n \nremain_time = 240 - b\ni = 1\nwhile True:\n if 5*i*(i+1)/2 > remain_time:\n if (i-1) > a:\n print(a)\n else:\n print(i-1)\n break\n i += 1\n", "def max_problems_solved(n, k):\r\n remaining_time = 240 - k\r\n solved_problems = 0\r\n\r\n for i in range(1, n + 1):\r\n problem_time = 5 * i\r\n if remaining_time >= problem_time:\r\n solved_problems += 1\r\n remaining_time -= problem_time\r\n else:\r\n break\r\n\r\n return solved_problems\r\n\r\nn, k = map(int, input().split())\r\n\r\nresult = max_problems_solved(n, k)\r\nprint(result)\r\n", "def main():\r\n n, k = map(int, input().split())\r\n t = 240 - k\r\n count = 0\r\n \r\n while t >= 5 * (count + 1):\r\n count += 1\r\n t -= 5 * count\r\n \r\n count = min(n, count)\r\n print(count)\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n, k = input().split()\r\nn, k = int(n), int(k)\r\n \r\nrem = 240 - k\r\n\r\nwhile 5*n*(n+1)//2>rem:\r\n n-=1\r\nprint(n)", "a,b = map(int,input().split())\r\nsumm , cn = 0,0\r\nfor i in range(1,a+1):\r\n summ += 5*i\r\n ans = 240 - summ\r\n if ans<b:\r\n break\r\n cn += 1\r\nprint(cn)", "n , t = map(int,input().split())\r\n\r\nc = 0\r\nnt = 240 - t\r\ns = 0\r\n\r\nfor i in range(1,n+1):\r\n c += i*5\r\n if c <= nt :\r\n s += 1\r\n else:\r\n pass\r\nprint(s)", "l=list(map(int,input().split()))\r\nn=l[0]\r\nk=l[1]\r\nt=240-k\r\npr=0\r\nfor i in range(1,n+1):\r\n t-=5*i\r\n if t>=0:\r\n pr+=1\r\nprint(pr)", "a, b = map(int, input().split())\r\nanswer = 0\r\n\r\nfor i in range(1, a + 1):\r\n b += (i * 5)\r\n\r\n if b > 240: break\r\n answer += 1\r\n\r\nprint(answer)", "import math\r\na,b=map(int,input().split())\r\nn=int(math.sqrt(96.25-0.4*b)-0.5)\r\nif a<=n:\r\n print(a)\r\nelse:\r\n print(n)", "n,k=map(int,input().split())\r\nx=240-k\r\nif x<=0:\r\n print(0)\r\nelse:\r\n s=0\r\n c=0\r\n for i in range(1,n+1):\r\n s=s+5*i\r\n if s>x:\r\n break\r\n else:\r\n c=c+1\r\n print(c)", "n, k = map(int, input().split())\r\nt = 240\r\nt -= k\r\nc = 0\r\nfor i in range(1, n + 1):\r\n dt = 5 * i\r\n if dt <= t:\r\n t -= dt\r\n c += 1\r\n else:\r\n break\r\nprint(c)\r\n", "n, k = map(int, input().split())\r\n\r\ntime_left = 240 - k # Time available to solve problems\r\nsolved_problems = 0 # Number of problems Limak has solved\r\n\r\n# Iterate through problems from easiest to hardest\r\nfor i in range(1, n + 1):\r\n time_left -= 5 * i # Time required to solve problem i\r\n if time_left < 0:\r\n break # Limak can't solve more problems and reach the party on time\r\n solved_problems += 1\r\n\r\nprint(solved_problems)\r\n", "n,k=map(int,input().split())\r\nt=240-k\r\ni=1\r\nkk=True\r\nres=0\r\nwhile kk==True:\r\n t-=i*5\r\n if t<0:\r\n res=i-1\r\n break\r\n elif t==0:\r\n res=i\r\n break\r\n\r\n i+=1\r\n if i>n:\r\n res=i-1\r\n break\r\nprint(res)", "x = input()\r\nL = []\r\ny = x.split(\" \")\r\nfor i in y:\r\n L.append(int(i))\r\nn = L[0]\r\nk = L[1] \r\nt = 240 -k\r\nc = 0\r\nwhile(t > 0 and n >0):\r\n if 5*(c+1) <= t:\r\n t = t-5*(c+1)\r\n c = c+1\r\n n = n-1\r\n else:\r\n break\r\nprint(c)", "n,k=map(int,input().split())\r\nco=0\r\nq=0\r\nfor i in range(n):\r\n i+=1\r\n q+=i*5\r\n if q+k<=240:\r\n co+=1\r\nprint(co)\r\n \r\n", "def main():\r\n n, k = map(int, input().split())\r\n\r\n total_time = 240 - k\r\n solved_problems = 0\r\n\r\n for i in range(1, n + 1):\r\n time_to_solve_problem = 5 * i\r\n if total_time >= time_to_solve_problem:\r\n total_time -= time_to_solve_problem\r\n solved_problems += 1\r\n else:\r\n break\r\n\r\n print(solved_problems)\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n\r\n", "kak,kaka=map(int,input().split())\nkaka2=240-kaka\nka=0 \nfor i in range(1,kak+1):\n if kaka2-5*i>=0:\n kaka2=kaka2-5*i\n ka+=1\n elif kaka2-5*i<0:\n break\nprint(ka)\n# Tue Mar 28 2023 13:25:11 GMT+0300 (Moscow Standard Time)\n", "n,k=map(int,input().split())\r\nt=240-k\r\nc=0\r\na=0\r\nfor i in range(1,n+1):\r\n c=c+i*5\r\n if c<=t:\r\n a=a+1\r\nprint(a) ", "enter=list(map(int,input().split()))\r\n\r\nre_minute=240-enter[1]\r\nlist_of_five=[ x*5 for x in range(1,enter[0]+1)]\r\nres=0\r\n\r\nfor i in range(0,enter[0]):\r\n if re_minute >= list_of_five[i]:\r\n re_minute=re_minute-list_of_five[i]\r\n \r\n res+=1\r\n else:break\r\nprint(res)", "n_k=list(map(int,input().split()))\r\ntotal_m=240-n_k[1]\r\nli=[]\r\ntotal_q,counter=0,0\r\nfor i in range(1,n_k[0]+1):\r\n total_q+=(i*5)\r\n li.append(total_q)\r\nfor i in li:\r\n if total_m >= i:\r\n counter+=1\r\n else:\r\n continue\r\nprint(counter)", "n,k=map(int,input().split())\r\na=240-k\r\nsolved=0\r\nfor i in range(1,n+1):\r\n b=i*5\r\n if b<=a:\r\n solved+=1\r\n a-=b\r\n else:\r\n break\r\nprint(solved)\r\n", "n,k=map(int,input().split())\r\nt=240-k\r\ns=0\r\ni=1\r\ncnt=0\r\nwhile s<=t:\r\n s+=i*5\r\n i+=1\r\n cnt+=1\r\nif n<cnt:\r\n print(n)\r\nelse:\r\n print(cnt-1)\r\n\r\n", "n,k = map(int,input().split())\r\nsummation = 5\r\ncounter = 0\r\nwhile summation <= (240-k):\r\n counter += 1\r\n if counter == n:\r\n break\r\n k += summation\r\n summation += 5\r\nprint(counter)", "n,a = map(int,input().split())\r\nt=240-a\r\nc=0\r\nd = 0\r\nfor i in range(1,n+1):\r\n d+=5*i\r\n if(d<=t):\r\n c+=1\r\n else:\r\n break\r\nprint(c)", "import math\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\n\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\nn, k = readarray(int)\r\n\r\n\r\ntotal = 4 * 60\r\n\r\ntar = total-k\r\n\r\nans = 0\r\n\r\ncurr = 0\r\n\r\nfor i in range(1, n+1):\r\n if curr + (5*i) > tar:\r\n break\r\n else:\r\n curr += (5 * i)\r\n ans += 1\r\n\r\nprint(ans)", "# -*- coding: utf-8 -*-\n\"\"\"750A.ipynb\n\nAutomatically generated by Colaboratory.\n\nOriginal file is located at\n https://colab.research.google.com/drive/1FIr4yRaeKL85rSQc1CPTvLMiL9Pr-7Vg\n\"\"\"\n\nn,m=map(int,input().split())\ntl=240-m\np=0\nfor i in range(1,n+1):\n t=5*i\n if t<=tl:\n p+=1\n tl-=t\nprint(p)", "n, k = map(int, input().split())\r\n\r\ni = 0\r\ncurrent = 0\r\nwhile((current+k) <= 240)and (i <= n):\r\n i+=1\r\n current+=i*5\r\nprint(i-1)\r\n", "n, k = list(map(int, input().split()))\r\n\r\n# current time : 20:00 / 20 * 60 minutes = 1200 minutes from midnight\r\n# 60 * 4 = 240 minutes until midnight\r\n\r\ntime_available = 240 - k\r\ntasks_completed = 0\r\n\r\ni = 1\r\n\r\n\r\nwhile True:\r\n\r\n task_completion_time = i * 5\r\n\r\n if task_completion_time <= time_available and n > 0:\r\n \r\n time_available -= task_completion_time\r\n\r\n tasks_completed += 1\r\n\r\n i += 1\r\n\r\n n -= 1\r\n\r\n else:\r\n \r\n break\r\n\r\nprint(tasks_completed)\r\n\r\n \r\n", "number_of_proposed_tasks, travel_time = [int(i) for i in input().split()]\r\ntotal_time = 4 * 60 # время соревнований\r\nremaining_time = total_time - travel_time\r\n\r\nleft = 0\r\nright = number_of_proposed_tasks\r\nwhile right - left > 1:\r\n count_task = (left + right) // 2\r\n time_for_task = ((5 + (5 + 5 * (count_task - 1)) ) * count_task)// 2\r\n \r\n if remaining_time - time_for_task < 0:\r\n right = count_task\r\n else:\r\n left = count_task\r\n\r\nprint(left if remaining_time - ((5 + (5 + 5 * (right - 1)) ) * right)// 2 < 0 else right)\r\n\r\n\r\n", "n,k=map(int,input().split())\r\ncounter=0\r\nfor i in range(1,n+1,1):\r\n if k+(i*5)<=240:\r\n k+=5*i\r\n counter+=1\r\nprint(counter)", "n, k = map(int, input().split())\r\n\r\nminutes_left = 240 - k\r\nproblem_solved = 0\r\nfor i in range(1, n+1):\r\n if minutes_left < i*5:\r\n break\r\n problem_solved+=1\r\n minutes_left-=i*5\r\nprint(problem_solved)", "time_limit = 240\nout = 0\nn, k = [int(x) for x in input().split()]\np = list(range(n*5, 4, -5))\nfor i, x in enumerate(p):\n if sum(p[i:]) + k <= time_limit:\n out = len(p[i:])\n break\nprint(out)", "n, k = map(int, input().split())\r\nall_time = 240\r\ntask_time = all_time - k\r\n\r\nc = 0\r\ny = 0\r\nfor i in range(1, n + 1):\r\n c += 5 * i\r\n if c > task_time:\r\n break\r\n else:\r\n y += 1\r\nprint(y)", "n, k = list(map(int, input().split()))\r\n\r\ntotal_time = 60 * 4 - k\r\n\r\nsolved_tasks = 0\r\n\r\nfor i in range(1, n + 1):\r\n\r\n total_time -= 5 * i\r\n\r\n if total_time >= 0:\r\n\r\n solved_tasks += 1\r\n \r\n else:\r\n\r\n break\r\n\r\nprint(solved_tasks)", "n,k=map(int,input().split())\nfor i in range(1,n+1):\n n1=(i*(2+(i-1)))/2\n if n1*5 > 240-k:\n print(i-1)\n break\n elif n1*5==240-k:\n print(i)\n break\n elif i==n:\n print(i)\n", "# 750A - New Year and Hurry\r\n# https://codeforces.com/problemset/problem/750/A\r\n\r\n# Inputs:\r\n# 1) Número de problemas\r\n# 2) Tiempo de viaje a la fiesta\r\nproblemas, minutos_viaje = map(int, input().split())\r\n\r\n# ¿Cuánto tiempo queda para resolver los problemas del concurso?\r\ntiempo_restante = 240 - minutos_viaje\r\n\r\n# ¿Cuántos problemas del concurso has resuelto?\r\nproblemas_resueltos = 0\r\n\r\n# Itera sobre los problemas\r\nfor numero_problema_actual in range(1, problemas+1):\r\n\r\n # Si al resolver el problema actual te sobra tiempo, entonces resuélvelo, suma +1 al número de problemas resueltos y actualiza el tiempo restante\r\n if tiempo_restante - (5 * numero_problema_actual) >= 0:\r\n tiempo_restante = tiempo_restante - (5 * numero_problema_actual)\r\n problemas_resueltos += 1\r\n\r\n # Si al resolver el problema actual te falta tiempo, entonces termina de iterar sobre los problemas\r\n elif tiempo_restante - (5 * numero_problema_actual) < 0:\r\n break\r\n\r\n# Imprime el número de problemas resueltos\r\nprint(problemas_resueltos)", "a, b = map(int, input().split())\r\nres = 0\r\nfor i in range(a):\r\n if 240 - 5 * (i+1) * (i+2) // 2 >= b:\r\n res += 1\r\nprint(res)", "n, k = map(int, input().split())\nav = 240 - k\nlo = 0\nhi = n\nwhile lo <= hi:\n mid = (lo + hi) // 2\n total = mid * (mid + 1) // 2\n total = total * 5\n totalonemore = total + (mid + 1) * 5\n\n if total <= av and totalonemore > av:\n break\n if total > av:\n hi = mid - 1\n else:\n lo = mid + 1\n\nprint(mid)\n", "n, k = [int(x) for x in input().split()]\r\nmax_task = k\r\nfor i in range(1, n+1):\r\n max_task += (i * 5)\r\n if max_task > 240:\r\n print(i-1)\r\n break\r\nelse:\r\n print(i)", "a = input().split()\r\nv = a[0]\r\nb = a[1]\r\ncom = 0\r\ntime = 240 - int(b)\r\nfor i in range(1,int(v)+1):\r\n time -= (5*i)\r\n if time < 0:\r\n break\r\n else:\r\n com += 1\r\nprint(com)", "kak,kaka=map(int,input().split())\r\nkaka2=240-kaka\r\nka=0 \r\nfor i in range(1,kak+1):\r\n if kaka2-5*i>=0:\r\n kaka2=kaka2-5*i\r\n ka+=1\r\n elif kaka2-5*i<0:\r\n break\r\nprint(ka)", "\r\nn,k = map(int,input().split())\r\n\r\ntime = 240\r\ntime = time - k\r\n\r\ntime_cnt = 0\r\ni = 0\r\nwhile time_cnt <= time:\r\n i = i+1\r\n time_cnt = time_cnt + 5*i\r\n \r\nif (i-1) >= n:\r\n print(n)\r\nelse:\r\n print(i-1)", "from sys import stdin\r\ninput = stdin.readline\r\n\r\ndef main():\r\n n, k = [int(n) for n in input().split()]\r\n t = 240 - k\r\n for i in range(1, n + 1):\r\n if i * 5 > t:\r\n print(i - 1)\r\n exit()\r\n t -= i * 5\r\n print(n)\r\n\r\nmain()", "n, k = list(map(int, input().split()))\r\ntotalTime = 240\r\ntime = 240 - k\r\n\r\ncounter = 0\r\nsumm = 0\r\n\r\nfor i in range(1, n + 1):\r\n if (5 * i) + summ <= time:\r\n counter += 1\r\n summ += 5 * i\r\n else:\r\n break\r\n\r\nprint(counter)", "import sys\r\nimport math\r\n\r\nn, k = map(int, sys.stdin.readline().split())\r\n\r\nmulti = 1\r\ntotal = k\r\ncount = 0\r\nwhile True:\r\n if total + (multi * 5) > 240 or multi > n:\r\n break\r\n total += (multi * 5)\r\n multi += 1\r\n count += 1\r\nprint(count)\r\n", "x=list(map(int,input().split()))\r\ntt=240\r\ntn=240-x[1]\r\ncount=sum=0\r\nfor i in range(1,x[0]+1):\r\n sum+=5*i\r\n if sum<=tn:\r\n count+=1\r\nprint(count)", "FOUR_HOURS = 240 # minutes\r\n\r\nn, k = map(int, input().split(' '))\r\n\r\nfree_time = FOUR_HOURS - k\r\n\r\ncontest_time = 0\r\ncontests = 0\r\n\r\nfor i in range(1, n + 1):\r\n minutes = 5 * i\r\n contest_time += minutes\r\n\r\n if contest_time > free_time:\r\n break\r\n\r\n contests += 1\r\n\r\nprint(contests)\r\n", "n, k = map(int, input().split())\r\n\r\ntime_left = 240 - k\r\nproblems_solved = 0\r\ntime_taken = 0\r\n\r\nfor i in range(1, n+1):\r\n time_taken += 5*i\r\n if time_taken > time_left:\r\n break\r\n problems_solved += 1\r\n\r\nprint(problems_solved)", "def solve(data):\n n, k = map(int, data.split())\n remaining_minutes = 4 * 60 - k\n for i in range(1, n + 1):\n if remaining_minutes < i * 5:\n return i - 1\n else:\n remaining_minutes -= i * 5\n return i\n\n\nprint(solve(input()))\n", "x = input().split()\r\nn, time = int(x[0]), int(x[1])\r\nlst = [5*int(i) for i in range(1, 11)]\r\n\r\ndef func(a):\r\n sum, cnt = 0, 0\r\n for i in range(a):\r\n sum += lst[i]\r\n if sum <= 240-time:\r\n cnt += 1\r\n return cnt\r\n\r\nprint(func(n))", "n, k = map(int, input().split()) # Input: number of problems and travel time\r\n\r\navailable_time = 240 - k # Calculate available time for problem solving\r\nproblems_solved = 0\r\n\r\nfor i in range(1, n+1):\r\n problem_time = 5 * i # Time required to solve the i-th problem\r\n if available_time >= problem_time:\r\n problems_solved += 1\r\n available_time -= problem_time\r\n else:\r\n break # Stop if Limak runs out of time\r\n\r\nprint(problems_solved) # Output the maximum number of problems solved\r\n", "n, k = map(int, input().split())\n\ntotal_waktu = 0\nfor i in range(1, n+1):\n total_waktu += 5*i\n\nif total_waktu + k <= 240:\n print(n)\nelse:\n sisa = 240 - k\n penyelesaian = 0\n for i in range(1, n+1):\n sisa -= 5*i\n if sisa >= 0:\n penyelesaian += 1\n else:\n break\n print(penyelesaian)\n\t \t \t\t \t \t\t \t\t\t \t \t\t\t\t", "n, k = map(int, input().split())\r\ntime = 240 - k\r\nans = 0\r\nfor i in range(1,n+1):\r\n if (time - 5 * i >= 0):\r\n ans += 1\r\n time -= 5 * i\r\n else: break\r\nprint(ans)", "def can_make_it(n, k, problems_to_solve):\r\n time_needed = 0\r\n for i in range(1, problems_to_solve + 1):\r\n time_needed += 5 * i\r\n return time_needed + k <= 240\r\n\r\ndef max_problems_to_solve(n, k):\r\n left, right = 1, n\r\n while left <= right:\r\n mid = (left + right) // 2\r\n if can_make_it(n, k, mid):\r\n left = mid + 1\r\n else:\r\n right = mid - 1\r\n return right\r\n\r\nn, k = map(int, input().split())\r\nresult = max_problems_to_solve(n, k)\r\nprint(result)\r\n", "n,k=map(int,input().split())\r\ntot=240-k\r\nps=0\r\ntn=0\r\nfor i in range(1,n+1):\r\n tn+=i*5\r\n if tn<=tot:\r\n ps+=1\r\n else:\r\n break\r\nprint(ps)\r\n", "from sys import stdin, stdout\r\n\r\n\r\ndef solve(accumulated):\r\n n, k = map(int, stdin.buffer.readline().decode().split())\r\n time_left = 240\r\n answer = 0\r\n for index in range(n):\r\n if time_left - accumulated[index] >= k:\r\n answer += 1\r\n time_left -= accumulated[index]\r\n return answer\r\n\r\n\r\ndef main():\r\n possible = list([minute * 5 for minute in range(1, 101)])\r\n T = 1\r\n answers = [solve(possible) for _ in range(T)]\r\n stdout.write('\\n'.join(map(str, answers)))\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "n, k = map(int, input().split())\r\ntime = 240 - k\r\nres = 0\r\nfor i in range(1, n + 1):\r\n if time - i * 5 >= 0:\r\n time -= i * 5\r\n res += 1\r\n else:\r\n break\r\nprint(res)\r\n", "n, k = map(int, input().split())\r\ntime_remaining = 240 - k\r\n\r\nres = 0\r\nfor i in range(1, n+1):\r\n if i*5 <= time_remaining:\r\n res += 1\r\n time_remaining -= i*5\r\n else:\r\n break\r\nprint(res)", "\r\nn, k = map(int, input().split())\r\nm = [5, 15, 30, 50 , 75, 105, 140, 180, 225, 275]\r\nt = 240 - k; i = 0\r\nwhile m[i] <= t and i < n: i+=1\r\nprint(i)", "n,k = map(int,input().split())\r\nv = 240 - k\r\nr = 0\r\nd = 0\r\nfor i in range(1,n + 1):\r\n d += 5 * i\r\n if d > v:\r\n break\r\n else:\r\n r += 1\r\nprint(r)\r\n", "def main():\r\n n, travel = [int(i) for i in input().split()]\r\n contest_t = 240\r\n count = 0\r\n i = 1\r\n remaining_t = contest_t - travel\r\n while i <= n:\r\n t = 5*i\r\n if t <= remaining_t:\r\n count += 1\r\n remaining_t -= t\r\n i += 1\r\n else:\r\n break\r\n print(count)\r\n\r\nif __name__ == \"__main__\":\r\n main()", "a,b=map(int,input().split())\r\nv = 4*60-b\r\nk = 0\r\nd = 0\r\ns = 0\r\nfor i in range(1,a+1):\r\n if s+i*5>v:\r\n print(k)\r\n d+=1\r\n break\r\n else:\r\n s+=i*5\r\n k+=1\r\nif d == 0:\r\n print(k)", "a,b=map(int,input().split());k=0\r\nfor i in range(1,a+1):\r\n if i*5+b<=240:\r\n k+=1\r\n b+=i*5\r\nprint(k)", "n,k=list(map(int,input().split()))#7 1\r\nc=0\r\nfor i in range(1,n+1):\r\n k+=i*5\r\n if k<=240:\r\n c+=1\r\n\r\nprint(c)", "a,b=map(int, input().split())\r\ni=0; s=0\r\nwhile(240-s>=b and i<=a):\r\n i=i+1;\r\n s=s+5*i\r\nprint(i-1)", "n, k = map(int, input().split())\r\ntotal_time = 0\r\nfor i in range(1, n+1):\r\n total_time += 5 * i\r\n if(total_time > 240 - k):\r\n print(i - 1)\r\n break\r\nelse:\r\n print(n)\r\n", "l = input().split()\r\nl[0] = int(l[0])\r\nl[1] = int(l[1])\r\nans = 0\r\n\r\nwhile 5*((ans**2-ans)/2) <= 240-l[1]:\r\n ans = ans+1\r\n\r\n\r\nif ans-2 >= l[0]:\r\n print(l[0])\r\nelse:\r\n print(ans-2)\r\n", "n, k = map(int, input().split())\r\na = 240 - k\r\nli = []\r\n\r\nfor i in range(5, 51, 5):\r\n b = a - i\r\n if b >= 0:\r\n li.append(b)\r\n a -= i\r\n\r\nif len(li) > n:\r\n print(n)\r\nelse:\r\n print(len(li))", "n, k=map(int,input().split())\nvr=(24-20)*60\nvnz=vr-k\nit=0\novnz=0\nfor i in range(1, n+1):\n if ovnz+i*5<=vnz:\n ovnz=ovnz+i*5\n it+=1\n else:\n break\nprint(it)\n# Sat Mar 25 2023 11:05:12 GMT+0300 (Moscow Standard Time)\n", "a,b=map(int,input().split())\r\nfatihkotakbas=240-b\r\nv=1\r\nc=0\r\nfor i in range(a):\r\n c+=v*5\r\n v+=1 \r\nif fatihkotakbas-c>0:\r\n print(a)\r\nelse:\r\n while c>fatihkotakbas:\r\n c=c-a*5\r\n a-=1\r\n print(a)", "while True:\r\n try:\r\n n, k = map(int, input().split())\r\n result = 240 - k\r\n sum = 0\r\n x = 0\r\n for i in range(1, n + 1):\r\n sum += 5 * i\r\n if sum > result:\r\n break\r\n x += 1\r\n print(x)\r\n except EOFError:\r\n break\r\n", "n,k=map(int,input().split())\r\nr=(4*60)-k\r\ni=1\r\nc=0\r\nwhile True:\r\n v=5*i\r\n if v<=r and c<n:\r\n c+=1\r\n else:\r\n break\r\n i+=1\r\n r-=v\r\nprint(c)", "n, k = map(int, input().split())\r\nremain = 240 - k\r\ncount = 0\r\ntime = 0\r\nfor i in range(n):\r\n time += (5 * (i + 1))\r\n if time <= remain:\r\n count += 1\r\n else:\r\n break\r\nprint(count)", "x, y = map(int, input().split())\r\nz = 240-y\r\nc = 0\r\nfor i in range(1, x+1):\r\n if z - i*5 < 0:\r\n break\r\n else:\r\n z -= i*5\r\n c += 1\r\nprint(c)", "n,k=map(int,input().split())\r\nc=0\r\nl=[5,10,15,20,25,30,35,40,45,50]\r\nk=240-k\r\ni=0\r\nwhile(n>0):\r\n if k-l[i]>=0:\r\n c+=1\r\n k-=l[i]\r\n i+=1\r\n n-=1\r\nprint(c)", "a,b=map(int,input().split())\r\nc=240-b\r\ncount=0\r\nfor i in range(1,a+1):\r\n time=5*i\r\n c-=time\r\n if c>=0:\r\n count+=1\r\n else:\r\n break\r\nprint(count)", "n,k = map(int,input().split())\r\na,b = n,k\r\ni=0\r\nt = 0\r\ntav = 240-k\r\nwhile True:\r\n t += (i+1)*5\r\n if t > tav or i==n:\r\n break\r\n i+=1\r\nprint(i)\r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Tue Mar 28 12:49:42 2023\r\n\r\n@author: Srusty Sahoo\r\n\"\"\"\r\n\r\nn=list(map(int,input().split()))\r\nx=(240-n[1])//5\r\ny=[i for i in range(1,(n[0]+1))]\r\nfor a in y:\r\n if (a*(a+1)//2)>x:\r\n q=a-1\r\n break\r\n elif (a*(a+1)//2)==x:\r\n q=a\r\n break\r\n else:\r\n q=a\r\n \r\nprint(q)\r\n", "a,b=map(int,input().split())\r\nwhile a*(a+1)//2*5>240-b:\r\n a-=1\r\nprint(a) ", "n, k = list(map(int, input().split()))\r\n\r\nmins = 240 - k\r\ntasks = [range(1, n+1)]\r\n\r\nc= 0\r\n\r\ni = 1\r\n\r\nwhile mins >= i * 5 and i <= n:\r\n mins -= i * 5\r\n c += 1\r\n i += 1\r\n\r\nprint(c)", "n,k=map(int,input().split())\r\np_mins=240-k\r\ncount=0\r\ntime=0\r\nfor i in range(1,n+1):\r\n time=time+i*5\r\n if time<=p_mins:\r\n count=count+1\r\n else:\r\n break\r\nprint(count)\r\n", "input=input().split()\r\nn=int(input[0])\r\nk=int(input[1])\r\ni=0\r\n\r\nwhile i <= n:\r\n if 5*(1+i)*i//2 <= 240-k:\r\n i=i+1\r\n else: break\r\n\r\nprint(i-1)", "inp=input().split()\r\nn=int(inp[0])\r\nk=int(inp[1])\r\nlim=240-k\r\ns,c=0,0\r\nfor i in range(1,n+1):\r\n s+=5*i\r\n if s>lim:\r\n break\r\n c+=1\r\nprint(c)", "def partylimak(n,k):\r\n d=0\r\n while (((5*d)*(d+1))/2)<=240-k:\r\n d+=1\r\n return min(d-1,n)\r\nn=input()\r\nalist=[int(x) for x in n.split()]\r\nprint(partylimak(alist[0],alist[1]))", "test = list(map(int, input().split()))\r\n\r\nz, m = test[0], test[1]\r\n\r\na = 0\r\nc = 0\r\nb = []\r\nfor i in range(z):\r\n a += 5\r\n b.append(a)\r\n\r\nfor i in range(len(b)):\r\n m = b[i] + m\r\n if m <= 240:\r\n c += 1\r\n \r\nprint(c)", "num = [int(i) for i in input().split()]\nminutes = 240 - num[1]\nc = 0\nfor i in range(1,num[0]+1):\n t = i*5\n if minutes-t<0:\n break\n else:\n minutes -= t\n c += 1\nprint(c)", "def f():\r\n n=input()\r\n n=n.split(\" \")\r\n n=map(int,n)\r\n n=list(n)\r\n total=240\r\n p=n[0]\r\n time=n[1]\r\n count=0\r\n for i in range(1,p+1):\r\n time_taken=5*i\r\n total=total-time_taken\r\n if total>=time:\r\n count=count+1\r\n return count\r\n\r\nprint(f())\r\n", "n,k=list(map(int,input().split()))\r\ntime=0\r\ncount=0\r\nfor x in range(1,n+1):\r\n k+=(5*x)\r\n if k<=240:\r\n count+=1\r\n else:\r\n break\r\nprint(count)", "i=input().split(' ')\r\nn=int(i[0])\r\nk=int(i[1])\r\np=0\r\nt=240-k\r\nfor i in range(1,n+1):\r\n if 5*i<=t:\r\n p+=1\r\n t=t-5*i\r\nprint(p)", "# New year and hurry\r\nuserInput = input().split()\r\nn = int(userInput[0])\r\ndistance = int(userInput[-1])\r\ntime = 240 - distance\r\nresult = 0\r\n\r\nfor i in range(1, n + 1):\r\n if(time >= 0 and time - (i*5) >= 0):\r\n time -= (i * 5)\r\n result += 1\r\n elif (time < 0):\r\n break\r\n\r\nprint(result)\r\n", "a, b = map(int, input().split())\r\nt, c = 0, 0\r\nr = 240 - b\r\nfor i in range(1, a + 1):\r\n t += i * 5\r\n if t <= r:\r\n c += 1\r\n else:\r\n break\r\nprint (c)", "# Wadea #\r\n\r\nn,k = map(int,input().split())\r\ntime = 4 * 60\r\ntime -= k\r\nt_time = 0\r\nm = 0\r\nfor i in range(1,n+1):\r\n t_time += i * 5\r\n if t_time <= time:\r\n m += 1\r\n else:\r\n break\r\nprint(m)", "# Read input\r\nn, k = map(int, input().split())\r\n\r\n# Initialize variables\r\ntotal_time = 240 - k\r\nsolved_problems = 0\r\n\r\n# Iterate through the problems\r\nfor i in range(1, n+1):\r\n problem_time = 5 * i\r\n if total_time >= problem_time:\r\n total_time -= problem_time\r\n solved_problems += 1\r\n else:\r\n break\r\n\r\n# Print the maximum number of problems Limak can solve\r\nprint(solved_problems)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "n, k = map(int, input().split())\r\n\r\nfor i in range(1, n + 1):\r\n k += 5 * i\r\n if k > 240:\r\n i -= 1\r\n break\r\n\r\nprint(i)", "n,t=input().split()\r\nn,t=int(n),int(t)\r\ntotal_time=240-t\r\ncnt=0\r\ntime=0\r\nfor i in range(1,11) :\r\n time+= (i*5);\r\n if(time>total_time or i>n) :\r\n break\r\n cnt+=1\r\nprint(cnt)", "s = input().split(\" \")\r\nn = int(s[0])\r\ncount = 0\r\ntime = 240 - int(s[1])\r\nwhile time >= 0 and count < n:\r\n if (count + 1) * 5 <= time:\r\n time -= (count + 1) * 5\r\n count += 1\r\n else:\r\n break\r\nprint(count)\r\n\r\n", "n=input().split()\r\n\r\nproblem=int(n[0])\r\ntime=int(n[1])\r\ntime_left=240-time\r\n\r\nsum=0\r\nflag=0\r\nfor i in range(1,problem+1):\r\n sum=sum+5*i\r\n if sum<=time_left:\r\n flag+=1\r\nprint(flag)\r\n\r\n", "a,b=list(map(int, input().split()))\r\ns=240\r\nc=0\r\nf=0\r\nr=s-b\r\nfor i in range(1,a+1):\r\n f=f+(5*i)\r\n if(f>r):\r\n break\r\n c+=1\r\nprint(c)", "n, k = map(int, input().split())\r\nall_minutes = 4 * 60\r\ntime_to_solve = all_minutes - k\r\ni = 1\r\ncount = 0\r\nwhile time_to_solve >= 5 * i and n >= 1:\r\n count += 1\r\n time_to_solve -= 5 * i\r\n i += 1\r\n n -= 1\r\n \r\nprint(count)", "n,k=map(int,input().split())\r\nt=0\r\nc=0\r\nfor i in range(1,n+1):\r\n t=t+5*i\r\n if ((t+k)<=240):\r\n c=c+1\r\n else:\r\n break\r\nprint(c)", "n,k=map(int,input().split())\r\nz=240\r\nc=0\r\nfor i in range(1,n+1):\r\n v=5*i\r\n k+=v\r\n if k == z:\r\n print(i)\r\n break\r\n elif k > z:\r\n print(i-1)\r\n break\r\nelse:\r\n print(n)\r\n\r\n", "def number_of_problems(n, k):\r\n remaining_time = 240 - k\r\n problems_solved = 0\r\n\r\n for i in range(1, n+1):\r\n time_required = 5 * i\r\n remaining_time -= time_required\r\n\r\n if remaining_time < 0:\r\n break\r\n\r\n problems_solved += 1\r\n\r\n return problems_solved\r\n\r\n\r\nn, k = map(int, input().split())\r\n\r\nsolved_problems = number_of_problems(n, k)\r\nprint(solved_problems)\r\n", "arrin = list(str(input()).split(' '))\r\n\r\nfor i in range(2) : arrin[i] = int(arrin[i])\r\n\r\narrin[1] =240 - arrin[1]\r\n\r\np=0\r\na= [int( 5*(n*(n-1)/2) ) for n in range(2,12)]\r\nchk=0\r\nif arrin[1] in a :\r\n print( (a.index(arrin[1]) + 1) if (a.index(arrin[1]) + 1) <arrin[0] else arrin[0])\r\n exit()\r\nfor j in range(arrin[0]) :\r\n chk = chk + (j+1)*5\r\n if (chk >= arrin[1]):\r\n break\r\n p = p+1\r\nprint(p)", "a,b=(int(i) for i in input().split())\r\nsum=240-b\r\nc=0\r\nfor i in range(1,a+1):\r\n if sum>0 and sum>=i*5:\r\n c+=1\r\n sum-=i*5\r\nelse:\r\n print(c)", "n,k=[int(i) for i in input().split()]\r\nx=240-k\r\ncount=0\r\nfor i in range(1,n+1):\r\n if i*5<=x:\r\n count+=1\r\n x-=(i*5)\r\n else:\r\n break\r\nprint(count)\r\n ", "n, k = map(int, input().split())\r\ntime_left = 240 - k\r\nsolved_problems = 0\r\nfor i in range(1, n + 1):\r\n if time_left >= 5 * i:\r\n time_left -= 5 * i\r\n solved_problems += 1\r\n else:\r\n break\r\nprint(solved_problems)\r\n", "n, mati = map(int, input().split())\r\nonti = 4 * 60 - mati\r\ncount = 0\r\nwhile onti > 0 and (onti - 5*(count+1)) >= 0 and count < n:\r\n onti -= 5 * (count + 1)\r\n count += 1\r\nprint(count)", "n, k = input().split()\r\nn, k = int(n), int(k)\r\nproblems = 0\r\nfor i in range(1, n+1):\r\n if ((i*(i+1))/2)*5 + k <= 240:\r\n i += 1\r\n else:\r\n break\r\nprint(i-1)\r\n", "n, k = map(int,input().split())\r\nt = 240 - k\r\ncounter = 0\r\nfor i in range(1,n+1):\r\n if t - 5*i >= 0:\r\n t -= 5*i\r\n counter += 1\r\nprint(counter)", "c,d = map(int,input().split())\r\nx = 240-d\r\ni = 1\r\ncount = 0\r\nwhile i <= c:\r\n if x < i*5:\r\n break\r\n x -= i*5\r\n count += 1\r\n i += 1\r\nprint(count)", "def solve():\n n, k = map(int, input().split())\n k = 240 - k\n ans = 0\n for i in range(1, n+1):\n k -= 5*i\n if k >= 0:\n ans += 1\n else:\n break\n print(ans)\n\nif __name__=='__main__':\n solve()\n", "a,b = map(int, input().split())\r\ntime = 240 -b\r\nc=0\r\nfor i in range(1,a+1):\r\n if time - (i*5) >= 0:\r\n time -= (i*5)\r\n c+=1\r\n else:\r\n break\r\nprint(c)", "n,k = input().split()\r\ntiempo = 240 - int(k)\r\nacumulador = 5\r\ni = 1\r\ncon = 0\r\nwhile(acumulador <= tiempo)and(i<=int(n)):\r\n con+=1\r\n i+=1\r\n acumulador+=i*5\r\nprint(con)\r\n", "a,b=map(int,input().split())\r\nc=240-b\r\ni=0\r\nwhile i<=a:\r\n if c-(5*(i+1))>=0:\r\n i+=1\r\n c-=5*i\r\n continue\r\n else:\r\n break\r\nprint(i) if i<a else print(a)", "n, k = map(int, input().split())\r\nt = 240 - k\r\ni=0\r\nj=0\r\nc=0\r\nwhile i <= t:\r\n\tj += 1\r\n\ti += 5*(j)\r\n\tc+=1\r\n\t\r\ni -= 5*j\r\nif c-1 > n:\r\n\tprint(n)\r\nelse:\r\n\tprint(c-1)\r\n", "n,k=[int(i) for i in input().split()]\r\nt=4*60\r\nt-=k\r\nproblemTime=[5]\r\nfor i in range(2,n+1):\r\n problemTime.append((problemTime[-1])+(i*5))\r\n \r\nif problemTime[-1]<=t:\r\n print(n)\r\nelse:\r\n for i in problemTime:\r\n if i>t:\r\n print(problemTime.index(i))\r\n exit()", "n,k = map(int,input().split())\r\n\r\nleft = 0\r\nright = n+1\r\nminutes = 240-k\r\nwhile right -left > 1:\r\n mid = left + (right-left)//2\r\n if 5*mid*(mid+1)//2 <= minutes:\r\n left = mid\r\n else:\r\n right = mid\r\nprint(left)\r\n\r\n\r\n", "n, k = map(int, input().split())\r\nstart = 20*60\r\nend = 24*60-k\r\ntime = 0\r\nfor i in range(1, n+1):\r\n time += i*5\r\n if start+time > end:\r\n print(i-1)\r\n break\r\nelse:\r\n print(n)", "n, k = map(int, input().split())\r\n\r\nx=240-k\r\ncount=0\r\ny=1\r\n\r\nwhile x>=y*5 and y<=n:\r\n count+=1\r\n x=x-y*5\r\n y+=1\r\n \r\nprint(count)", "# Read input\r\nn, k = map(int, input().split())\r\n\r\n# Calculate the total time available for solving problems\r\ntime_available = 240 - k\r\n\r\n# Initialize the number of problems solved\r\nproblems_solved = 0\r\n\r\n# Iterate through problem difficulty levels\r\nfor i in range(1, n+1):\r\n # Calculate time required to solve i-th problem\r\n time_required = 5 * i\r\n \r\n # Check if Limak has enough time to solve the i-th problem\r\n if time_required <= time_available:\r\n time_available -= time_required\r\n problems_solved += 1\r\n else:\r\n break\r\n\r\n# Print the number of problems solved\r\nprint(problems_solved)", "n , k=map(int,input().split())\r\nwhile n*(n+1)//2*5>240-k: # sum of natural numbers multiplied by 5\r\n n-=1\r\nprint(n)", "import math\nn, k = map(int, input().split(' '))\n\nres_sqr = ((240 - k) // 5) * 2\nres = int(math.floor(math.sqrt(res_sqr)))\nwhile (res * (res + 1)) > res_sqr:\n res -= 1\nres = min(res, n)\nprint(res)\n", "n,k=map(int,input().split())\r\nk=240-k;sum_=0;count_=0\r\nfor i in range(1,n+1):\r\n sum_+=5*i\r\n if sum_>k:\r\n break\r\n else:\r\n count_+=1\r\nprint(count_)", "n,k=map(int,input().split())\r\nprint(sum(1 for i in range(1,n+1) if(5*i*(i+1)/2)<=(240-k)))", "n, k = map(int, input().split())\r\ntotal_time = 240-k\r\nx = (-1+(1+8*total_time/5)**.5)/2\r\nprint(min(n, int(x)))\r\n\r\n", "n, k = map(int, input().split())\r\nlimak_time = 4 * 60 - k\r\ncnt = 0\r\nwhile 5 * (cnt + 1) <= limak_time and (cnt + 1) <= n:\r\n limak_time -= 5 * (cnt + 1)\r\n cnt += 1\r\nprint(cnt)", "x,n=map(int,input().split())\r\nc=0\r\nfor i in range(1,x+1):\r\n n=n+5*i\r\n if n<=240:\r\n c+=1\r\nprint(c)\r\n ", "n, k = map(int, input().split())\r\nans = 0\r\nvr = 0\r\nwhile vr + k + (ans + 1) * 5 <= 240 and ans < n:\r\n vr += (ans + 1) * 5\r\n ans += 1\r\nprint(ans)\r\n", "n, m = map(int, input().split())\nf = 240-m\ns = 0\nfor i in range(1, n+1):\n if f-5*i >= 0:\n f = f-5*i\n s += 1\n elif f-5*i<0:\n break\nprint(s)\n# Tue Mar 28 2023 13:04:54 GMT+0300 (Moscow Standard Time)\n", "a,n=map(int,input().split())\ng=240-n\ns=0\nfor i in range(1, a+1):\n if g-5*i >= 0:\n g=g-5*i\n s+=1\n elif g-5*i<0:\n break\nprint(s)\n# Tue Mar 28 2023 10:10:53 GMT+0300 (Moscow Standard Time)\n", "n, k = map(int, input().split())\n\nduration = 240\ntime_left = duration - k\n\n\nproblems_solved = 0\n\nfor i in range(1, n + 1):\n problem_time = 5 * i\n\n\n if time_left >= problem_time:\n time_left -= problem_time\n problems_solved += 1\n else:\n break\n\nprint(problems_solved)\n \t\t \t \t \t \t \t\t\t \t \t \t \t \t", "n,k = map(int,input().split())\r\ni = 1\r\nk = 240 - k\r\nm = 0\r\nwhile k >= 5 * i and i <= n:\r\n m = m + 1\r\n k = k - 5 * i\r\n i = i + 1\r\nprint(m)\r\n", "b=list(map(int,input().split()))\r\nc=1\r\nfor i in range(b[0]):\r\n b[1]+=5*c\r\n if b[1]<=240:\r\n c+=1\r\n # print(b[1])\r\nprint(c-1)", "x,y=map(int,input().split())\r\nz=240-y\r\ni=0\r\nwhile i<=x:\r\n if z-(5*(i+1))>=0:\r\n i+=1\r\n z-=5*i\r\n continue\r\n else:\r\n break\r\nprint(i) if i<x else print(x)", "a,b=map(int,input().split())\r\nx=240-b\r\nc=0\r\ni=5\r\nwhile(x>0):\r\n x-=i\r\n if(x>=0):\r\n c+=1\r\n i+=5\r\n else:\r\n break\r\nif(c>=a):\r\n print(a)\r\nelse:\r\n print(c)\r\n ", "minutes = 4 * 60\r\na, b = map(int, input().split())\r\nminutes -= b\r\nfor i in range(1, a + 1):\r\n if minutes - i * 5 >= 0:\r\n minutes -= i * 5\r\n else:\r\n minutes = -1\r\n break\r\nif minutes == -1:\r\n print(i - 1)\r\nelse:\r\n print(i)", "a = list(map(int,input().split()))\r\nn = a[0];k = a[1];i=1;c=0\r\nwhile(i<=n):\r\n b = 5*i*(i+1)/2\r\n if b>240-k:\r\n break\r\n i = i + 1\r\n c = c + 1\r\nprint(c)", "a=list(map(int,input().split()))\r\nb=240-a[1]\r\nc=5\r\nd=0\r\nfor i in range(a[0]):\r\n if(b-c>=0):\r\n d=d+1\r\n b-=c\r\n c+=5\r\nprint(d)", "flag = False\r\nn, k = map(int,input().split())\r\nvalue = 240 - k\r\ntemp = [5]\r\nfor i in range(2,n+1):\r\n temp.append(temp[-1]+i*5)\r\nfor i in range(0,len(temp)):\r\n if temp[i] > value:\r\n flag = True\r\n break\r\nprint(i if flag else n)\r\n\r\n", "n,k = map(int,input().split())\r\n\r\nmax_minute = abs(4*60 - k)\r\n\r\nproblem_solved = 0\r\n\r\nlist_of_problems_time=[]\r\n\r\nfor i in range(1,n+1):\r\n\r\n list_of_problems_time.append(i*5)\r\n\r\n if sum(list_of_problems_time)> max_minute:\r\n break\r\n \r\n problem_solved += 1\r\n \r\n \r\n\r\nprint(problem_solved)\r\n ", "from collections import defaultdict, deque, Counter\r\nfrom itertools import accumulate\r\nimport math\r\nimport heapq\r\n\r\n\r\ndef II(): return int(input())\r\ndef LI(): return list(map(int, input().split()))\r\ndef MI(): return map(int, input().split())\r\ndef SI(): return sorted(list(map(int, input().split())))\r\n\r\n\r\ndef solve():\r\n n, k = MI()\r\n\r\n original_hour = 4 * 60\r\n extra = original_hour - k\r\n\r\n prefix_sum = []\r\n for i in range(1, n + 1):\r\n prefix_sum.append(5*i)\r\n\r\n prefix_sum = list(accumulate(prefix_sum))\r\n\r\n left = 0\r\n right = n - 1\r\n\r\n while left <= right:\r\n mid = left + (right - left) // 2\r\n\r\n if prefix_sum[mid] > extra:\r\n right = mid - 1\r\n else:\r\n left = mid + 1\r\n\r\n print(left)\r\n\r\n\r\nsolve()\r\n", "n,k = map(int,input().split())\r\ntime = (2.5*n*(n+1))+k\r\nwhile(time>240):\r\n n-=1\r\n time = (2.5*n*(n+1))+k\r\nprint(n)", "n, k = map(int, input().split())\r\ntm = 4*60 - k\r\ni = 1\r\nwhile tm >= 0 and i <= n:\r\n tm -= i*5\r\n i += 1 \r\ni -= 1\r\n\r\nif tm < 0:\r\n print(i-1)\r\nelse:\r\n print(i)\r\n", "n,k = map(int,input().split())\r\nR_Time = 240 - k\r\ncount = 0\r\nfor i in range(1,n+1):\r\n R_Time = R_Time - i * 5\r\n if(R_Time >= 0):\r\n count = count + 1\r\nprint(count)\r\n\r\n \r\n", "n, k = map(int, input().split())\r\ndef kamal(i):\r\n n=i+9\r\n return n\r\ntl = 240 - k\r\npp = 0\r\n\r\nfor i in range(1, n+1):\r\n oo = 5 * i\r\n if oo > tl:\r\n break\r\n kamallsl=kamal(99)\r\n pp += 1\r\n tl -= oo\r\n\r\nprint(pp)\r\n", "n,k=map(int,input().split())\r\ntime=240-k\r\nz=5\r\nans=0\r\nwhile time>=z and ans<n:\r\n ans+=1\r\n time-=z\r\n z+=5\r\nprint(ans)\t\r\n \r\n \r\n", "a,b=map(int,input().split())\r\nb=240-b\r\ndef main(n,k):\r\n return (k-int(2.5*((n+0.5)**2)-0.25))\r\nwhile main(a,b)<0:\r\n a-=1\r\nprint(a)\r\n", "N, K = map(int, input().split())\r\nTleft = 240 - K\r\nSolved = 0\r\nTrequired = 0\r\nfor i in range(1, N + 1):\r\n Trequired += 5 * i \r\n if Trequired <= Tleft:Solved = i\r\n else:break\r\nprint(Solved)", "n,k = map(int,input().split())\r\ntime = 240 - k\r\ncount = 0\r\nfor i in range(1,n+1):\r\n if time >= 5*i:\r\n time -= 5*i\r\n count += 1\r\n else:\r\n break\r\nprint(count)\r\n\r\n\r\n ", "n,k=map(int,input().split())\r\navailable_time=240-k\r\nsolve_problems=0\r\n\r\nfor i in range(1, n+1):\r\n available_time-=5*i\r\n if available_time<0:\r\n break\r\n solve_problems += 1\r\n \r\nprint(solve_problems)", "n,m = map(int,(input().split()))\r\n\r\nl, r = 1, n\r\n\r\nans = 0\r\n\r\nwhile l <= r:\r\n mid = (l+r)//2\r\n min = 0\r\n for i in range(1,mid+1):\r\n min += i*5\r\n if (240-min) >= m:\r\n ans = max(ans,mid)\r\n l = mid + 1\r\n else:\r\n r = mid - 1\r\n\r\nprint(ans)\r\n ", "# https://codeforces.com/problemset/problem/750/A\r\n\r\nnum_of_problems, minutes_required = map(int, input().split())\r\n\r\nminutes_available = 4 * 60 - minutes_required\r\nproblems_solved = 0\r\n\r\nfor i in range(1, num_of_problems + 1):\r\n if minutes_available >= i * 5:\r\n minutes_available -= i * 5\r\n problems_solved += 1\r\n else:\r\n break\r\n\r\nprint(problems_solved)\r\n", "import math,sys,collections,bisect\n\n\ndef natural(n):\n\treturn n*(n+1)//2\n\ndef binarysearch(l,r,k):\n\tif l<=r:\n\t\tmid = (l+r)//2\n\t\tif natural(mid)*5<=k:\n\t\t\treturn binarysearch(mid+1,r,k)\n\t\treturn binarysearch(l,mid-1,k)\n\treturn r\n\n\ndef solve():\n\n\tn,k = list(map(int,input().split()))\n\tmins = 60*4 - k\n\tprint(binarysearch(1,n,mins))\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,k=map(int,input().split())\r\nt=240\r\nr=t-k\r\ntime=0\r\ncount=0\r\nfor i in range(1,n+1):\r\n time+=5*i\r\n if r<time:\r\n print(i-1)\r\n count=1\r\n break\r\nif count==0:\r\n print(n)\r\n", "a = list(map(int, input().split()))\r\nn = a[0]\r\nk = a[1]\r\nkol = 0\r\n\r\nt = 240 - k\r\nfor i in range(1,n+1):\r\n if 5 * i <= t:\r\n kol+=1\r\n t = t - 5 * i\r\n else:\r\n break\r\nprint(kol)\r\n", "p,k=map(int,input().split())\r\nwhile p*(p+1)//2*5>240-k:p-=1\r\nprint(p)", "problems,toReach=[int(x) for x in input().split()]\r\ntotalTime=240\r\ntime=240-toReach\r\ncount=0\r\nfor i in range(1,problems+1):\r\n time=time-5*i\r\n if(time>=0):\r\n count+=1\r\nprint(count)\r\n ", "n, k = [int(x) for x in input().split()]\r\n\r\nfor i in range(1, n + 1):\r\n k += i * 5\r\n if k == 240:\r\n print(i)\r\n quit()\r\n if k > 240:\r\n print(i - 1)\r\n quit()\r\nprint(i)", "arr = list(map(int,input().rstrip().split()))\r\nn = arr[0]\r\nk = arr[1]\r\ntime_left = 240 - k\r\nsum = 0\r\ncount = 0\r\nfor i in range(1,n+1):\r\n sum += 5*i\r\n if sum <= time_left:\r\n count += 1\r\nprint(count)", "n, k = map(int, input().split())\r\ntime = 0\r\ncnt = 0\r\nfor i in range(1, n+1):\r\n time += 5 * i\r\n if time + k <= 240:\r\n cnt += 1\r\n else:\r\n break\r\nprint(cnt)", "n, k = map(int, input().split())\n\nrem = 240 - k\nspent = 0\nsolved = 0\nfor i in range(1, n + 1):\n spent = spent + 5 * i\n if spent > rem:\n break\n solved += 1\nprint(solved)\n", "x,t = map(int,input().split())\r\n\r\nmax_time = (24-20)*60\r\n\r\nfor p in range(x, -1, -1):\r\n solve_time = (5 * p * (p + 1)) // 2\r\n total = solve_time + t\r\n\r\n if total<=max_time:\r\n print(p)\r\n break\r\n", "def problems(p, d):\n mints = 240\n available_time = mints - d\n\n num_problems_solved = 0\n cumulative_time = 0\n\n for i in range(1, p+1):\n problem_time = 5 * i\n cumulative_time += problem_time\n\n if cumulative_time <= available_time:\n num_problems_solved += 1\n else:\n break\n\n return num_problems_solved\n\n\np, d = map(int, input().split())\n\n\nprint(problems(p, d))\n\t \t \t \t \t\t\t \t \t \t \t \t", "n,k=map(int,input().strip().split())\r\nminutes=240\r\nminutes-=k\r\ncount=0\r\ntotal=0\r\nfor i in range(1,n+1):\r\n total+=5*i\r\n if total<=minutes:\r\n count+=1\r\n else:\r\n break\r\nprint(count)", "\r\nn, k = map(int, input().split())\r\n\r\nt = 240 - k\r\ns = 0\r\n\r\nfor i in range(1, n+1):\r\n pt = 5 * i\r\n \r\n if pt <= t:\r\n s += 1\r\n t -= pt\r\n else:\r\n break\r\n\r\nprint(s)", "n, k = [int(x) for x in input().split()]\r\na = 240 - k\r\nans = 0\r\nfor i in range(1, n + 1):\r\n if a - 5 * i >= 0:\r\n a -= 5 * i\r\n ans += 1\r\nprint(ans)", "def problem(n, k):\r\n t = 0\r\n sp = 0\r\n\r\n for i in range(1, n + 1):\r\n t += 5 * i\r\n if t <= 240 - k:\r\n sp += 1\r\n else:\r\n break\r\n\r\n return sp\r\n\r\nn, k = map(int, input().split())\r\n\r\nprint(problem(n, k))\r\n", "n,k=map(int,input().split())\r\nt=240-k\r\ncount=0\r\nfor x in range(1,n+1):\r\n k=k+5*x\r\n if(k<=240):\r\n count=count+1\r\n\r\nprint(count)", "n,k = map(int,input().split())\r\ntotal = 240 - k\r\ncount = 0\r\nfor i in range(1,n+1):\r\n if total < (5*i):\r\n break\r\n total -= (5*i)\r\n count += 1\r\nprint(count)", "n, k = map(int, input().split())\r\nf = 0\r\nx = 240 - k\r\n\r\nfor i in range(1, n + 1):\r\n a = 5 * i\r\n if x >= a:\r\n x -= a\r\n f += 1\r\n else:\r\n break\r\n\r\nprint(f)\r\n", "total_min=4*60\r\nn,k=map(int,input().split())\r\nremaining_min=total_min-k\r\nfor i in range(1,n+1):\r\n m = 5*i\r\n if(remaining_min-m>=0):\r\n remaining_min-=m\r\n else:\r\n n=i-1\r\n break\r\nprint(n)", "n ,k = map(int,input().split())\r\nm ,j = n,k\r\naa = 0\r\nt = 0\r\ntav = 240-k\r\nwhile 1:\r\n t += (aa+1)*5\r\n if t > tav or aa==n:\r\n break\r\n aa+=1\r\nprint(aa)\n# Sat Mar 25 2023 11:18:35 GMT+0300 (Moscow Standard Time)\n", "n, k = list(map(int, input().split()))\r\ntime_left = 4*60 - k\r\nc = 0\r\ni = 1\r\nwhile time_left > 0 and c < n:\r\n time_left -= 5*i\r\n if time_left >= 0:\r\n c += 1\r\n i += 1\r\n else:\r\n break\r\n\r\nprint(c)", "\r\nn, k = list(map(int, input().split()))\r\nm = 240 - k\r\nans = 0\r\nfor i in range(1,n+1):\r\n if m < i*5:\r\n break\r\n ans += 1\r\n m -= (i*5)\r\nprint(ans)\r\n", "\r\nn, k = map(int, input().split())\r\nmas = [int(i*5) for i in range(1, 11)]\r\ntotal = 0\r\nindex = n\r\nfor i in range(1, n+1):\r\n total += 5*i\r\n if total + k > 240:\r\n index = i-1\r\n break\r\nprint(index)\r\n", "n,k = map(int,input().split())\r\n\r\nc=0\r\ns=0\r\nrem = 240-k\r\nfor i in range(1,n+1):\r\n s=s+i*5\r\n if s<=rem:\r\n c+=1\r\n else:\r\n break\r\nprint(c)", "import sys, math\r\nfrom collections import *\r\nfrom bisect import *\r\nfrom itertools import *\r\ninput = sys.stdin.readline\r\n\r\nII = lambda: map(int, input().split())\r\nL = lambda: list(II())\r\nSL = lambda: sorted(L())\r\nYES = lambda: print(\"YES\")\r\nNO = lambda: print(\"NO\")\r\nOK = lambda: print(\"OK\")\r\n\r\n\r\ndef solve():\r\n n, k = II()\r\n p = 240-k\r\n c = 0\r\n i = 1\r\n while (p >= i*5)and(c < n):\r\n p-=i*5\r\n i+=1\r\n c+=1\r\n print(c)\r\n\r\nif __name__ == \"__main__\":\r\n solve()\r\n #for testcase in range(int(input())):\r\n # solve()\r\n", "p, n = map(int, input().split())\na = 240 - n\nt = 0\nn = 0\ni = 1\nwhile True:\n t += 5 * i\n if t > a:\n print(n)\n break\n if i == p:\n print(p)\n break\n else:\n i += 1\n n += 1", "global lst \nlst = [1, 2, 3, 4, 5, 6, 9] \ndef main(): \n n, k = map(int, input().split()) \n time = 240-k \n total = n*(n+1)*5 \n total //= 2 \n \n if total <= time: \n print(n) \n return \n\n x, y = 0, n \n while y-x>1: \n mid = (x+y)//2 \n total = mid*(mid+1)*5 \n total //= 2 \n\n if total <= time: \n x = mid \n else: \n y = mid \n \n print(x) \n\nif __name__ == '__main__': \n t = 1\n for i in range(t): \n main() ", "n, k = list(map(int, input().split()))\r\ntotal = 0\r\n\r\nfor i in range(1, n+1):\r\n total += (5*i)\r\n if (total+k > 240):\r\n print(i-1)\r\n break\r\n elif (i == n):\r\n print(i)\r\n break\r\nelse:\r\n print(0)\r\n", "n,k=map(int,input().split())\r\ns=0\r\nm=0\r\nfor i in range(5,240,5):\r\n s+=i\r\n if s+k<=240:\r\n m+=1\r\n if m>=n:\r\n break\r\n else:\r\n break\r\nprint(m)", "inp = input()\r\ninp = inp.split(\" \")\r\nn = int(inp[0])\r\nk = int(inp[1])\r\n\r\ntime_to_solve = 240 - k\r\n\r\ntotal_time = 0\r\nfor i in range(1, n+1):\r\n problem_time = 5 * i\r\n total_time += problem_time\r\n if total_time > time_to_solve:\r\n print(i-1)\r\n break\r\nelse:\r\n print(n)", "n, k = list(map(int, input().split()))\r\nleft = 0\r\nright = n + 1\r\nwhile left + 1 != right:\r\n m = (left + right) // 2\r\n# 5*1 + 5*2 + ... + 5*m = 5 * (1 + 2 + ... + m) = 5*m*(m + 1)//2\r\n time = 5 * m * (m + 1) // 2\r\n if time + k <= 240:\r\n left = m\r\n else:\r\n right = m\r\nprint(left)\r\n", "import math\r\nn, k = (int(i) for i in input().split())\r\nc = 2*(240-k)/5\r\nprint(min(n,int(math.floor((-1+(1+4*c)**.5)/2))))", "import math\r\nn,k = map(int,input().split())\r\nres = (-5 + math.floor(math.sqrt(25 - ((20)*(-480 + 2*k)))))//10\r\nprint(min(res,n))", "n, k = map(int, input().split())\r\nc = 0\r\nm = 0\r\nminutes = 240\r\nremaining_m = minutes - k\r\nfor i in range(1,n+1):\r\n c += i*5\r\n if c<= remaining_m:\r\n m+=1\r\n else:\r\n break\r\n\r\nprint(m)", "import sys\r\ninput = sys.stdin.readline\r\noutput = sys.stdout.write\r\n\r\n\r\ndef main():\r\n ques_, minutes = map(int, input().rstrip().split())\r\n full_time = 240\r\n time_left = full_time - minutes\r\n time_needed = 0\r\n num = 0\r\n for i in range(ques_):\r\n time_needed += 5*(i+1)\r\n if time_left - time_needed < 0:\r\n break\r\n num += 1\r\n output(str(num))\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "from math import*\r\n\r\nn, k = map(int, input().split(\" \"))\r\n\r\ntemps_restant = 4 * 60 - k\r\nprobleme_resolu= 0\r\n\r\nwhile probleme_resolu <= n and temps_restant >= 0:\r\n probleme_resolu += 1\r\n temps_restant -= 5 * probleme_resolu\r\n\r\nprint(probleme_resolu - 1)", "n, k = map(int, input().split())\nT = 0\nS = 0\n\nfor i in range(1, n+1):\n P = 5 * i\n if T+P+k<=240:\n T += P\n S += 1\n else:\n break\nprint(S)\n \t \t\t \t\t\t \t \t \t \t\t\t \t \t\t\t", "n, k = map(int, input().split()) \r\ns = 0\r\nt = 240 - k \r\nfor i in range(1, n + 1):\r\n p = 5 * i\r\n if t >= p:\r\n s += 1\r\n t -= p\r\n else:\r\n break\r\nprint(s)\r\n", "n, k = map(int, input().split())\r\nt = 4 * 60 - k\r\nans = 0\r\nfor i in range(1, n + 1):\r\n if t - i * 5 < 0:\r\n break\r\n t -= i * 5\r\n ans += 1\r\nprint(ans)", "n,k = map(int,input().split())\r\nfor i in range(1,n+1):\r\n judge_num = sum(list(range(i+1)))*5\r\n if judge_num > (240 - k):\r\n print(i-1)\r\n break\r\nif sum(list(range(n+1)))*5 + k <= 240:\r\n print(n)", "n, k = map(int, input().split())\r\nsum = 0\r\ni = 1\r\n\r\nwhile i <= n and sum + 5*i <= (240 - k):\r\n sum += 5*i\r\n i += 1\r\nprint(i - 1)", "n,k=[int(x) for x in input().split()]\r\ntime=240-k\r\nsum=0\r\ni=0\r\nwhile(sum<=time and i<=n):\r\n sum=sum+5*(i+1) \r\n i=i+1 \r\nprint(i-1) ", "n,k=map(int,input().split())\r\nt=240\r\nne=0\r\na=0\r\nt=t-k\r\nfor i in range(1,n+1):\r\n ne=ne+i*5\r\n if(ne<=t):\r\n a=a+1\r\n else:\r\n break\r\nprint(a)", "n,k=map(int,input().split())\r\nl=0\r\nc=0\r\nfor i in range(1,n+1):\r\n if l+i*5+k<=240:\r\n c=c+1\r\n l=l+i*5\r\n \r\nprint(c)\r\n ", "n, k = [int(a) for a in input().split()]\r\ncount = 0\r\nsum = k\r\nwhile (count < n) :\r\n sum += 5*(count+1)\r\n if (sum > 240):\r\n break\r\n count += 1\r\nprint(count)\r\n", "n,k=map(int,input().split())\r\no=240-k\r\nr=0\r\ns=0\r\nfor i in range(1,n+1):\r\n s+=i*5\r\n r+=1\r\n if s>o:\r\n r-=1\r\n break;\r\n elif s==o:\r\n r=r\r\n break;\r\nprint(r)\r\n", "a,b=map(int,input().split())\r\ns1=240-b\r\ns2=0\r\nc=0\r\nfor i in range(1,a+1):\r\n r=i*5\r\n s2+=r\r\n if s2<=s1:\r\n c+=1\r\nprint(c)\r\n ", "def contest(problems, time):\r\n solved = 0\r\n for i in range(1,problems+1):\r\n time += 5 * i\r\n if time <= 240:\r\n solved += 1\r\n else:\r\n return solved\r\n return solved\r\n\r\nproblems, time = [int(n) for n in input().split()]\r\nprint(contest(problems, time))", "n,k=map(int,input().split())\r\nm=240-k\r\np=0\r\ncount=0\r\nfor i in range(n):\r\n i=(i+1)*5\r\n p=p+i\r\n if m-p>0 or m-p==0:\r\n count+=1\r\n\r\nprint(count)", "n, k = map(int, input().split())\r\nl, m, b = 0, 240, 0\r\n\r\nfor i in range(1, n+1):\r\n l += i*5\r\n b += 1\r\n if l > m - k:\r\n l -= i*5\r\n b -= 1\r\n break\r\nprint(b)", "n, k = map(int, input().split())\r\ntime = 4 * 60 - k\r\ni = 1\r\nwhile True:\r\n if time - 5 * i >= 0 and i <= n:\r\n time -= (5*i)\r\n i += 1\r\n else:\r\n if k == 240:\r\n print(0)\r\n else:\r\n print(i - 1)\r\n break\r\n", "zadania, czas = input().split()\r\nzadania = int(zadania)\r\nczas = int(czas)\r\ndostepny_czas = 240 - czas\r\n\r\nwynik = 0\r\nfor i in range(1, zadania + 1):\r\n dostepny_czas -= i * 5\r\n if dostepny_czas < 0:\r\n break\r\n wynik += 1\r\n\r\nprint(wynik)", "n, m = map(int, input().split())\r\n\r\ntime = 240 - m # 18\r\ntime_spend = 0\r\nfor i in range(1, n+1):\r\n \r\n time_spend+= i * 5\r\n\r\n if time_spend > time:\r\n n = i-1\r\n break\r\n\r\nprint(n)", "n,s=input().split()\r\nn=int(n)\r\ns=int(s)\r\nl=0\r\nr=n+1\r\ndef check(x):\r\n if 5*(x*(x+1))//2 <= 240-s:\r\n return True\r\n else:\r\n return False\r\nwhile (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\nprint(l)", "n,k=map(int,input().split())\r\nl=[(i*5) for i in range(1,n+1)]\r\nx=1440-(1200+k)\r\ns=0\r\nfor i in l:\r\n x=x-i\r\n if x>=0:\r\n s+=1\r\n else:\r\n break\r\nprint(s)\r\n\r\n", "str1 = input().split()\r\nlest1 = []\r\nfor x in str1 : \r\n lest1.append(int(x)) \r\nsum = 0\r\ntime = lest1[1]+20*60\r\ntime2 = 1440 - time\r\ni = 5\r\nh = 0\r\nfor x in range (lest1[0]) :\r\n if i <= time2 :\r\n sum+=1\r\n time2-=i\r\n i+=5\r\n h += i \r\n else :\r\n break;\r\nprint (sum)", "a = list(map(int, input().split()))\r\nn = a[0]\r\nk = a[1]\r\nb = k\r\nc = 0\r\nfor i in range(1, n + 1):\r\n b += 5 * i\r\n if b <= 240:\r\n c += 1\r\n if b > 240:\r\n break\r\nprint(c)", "def max_problems(n, k):\r\n total_time = 240 \r\n time_to_party = total_time - k\r\n problem_time = 0 \r\n problems_solved = 0\r\n \r\n for i in range(1, n + 1):\r\n if problem_time + 5 * i <= time_to_party:\r\n problem_time += 5 * i\r\n problems_solved += 1\r\n else:\r\n break\r\n\r\n return problems_solved\r\n\r\nn, k = map(int, input().split())\r\nprint(max_problems(n, k))", "n,m=map(int,(input().split()))\r\nd=240\r\ne=240-m\r\nf=0\r\nfor i in range(1,n+1):\r\n if (i*5)<=e:\r\n f+=1\r\n e-=(i*5)\r\nprint(f)", "import sys\r\ninput = sys.stdin.readline\r\n\r\n############ ---- Input Functions ---- ############\r\ndef inp():\r\n return(int(input()))\r\ndef inlt():\r\n return(list(map(int,input().split())))\r\ndef insr():\r\n s = input()\r\n return(list(s[:len(s) - 1]))\r\ndef invr():\r\n return(map(int,input().split()))\r\n\r\nl=inlt()\r\nn=l[0]\r\n\r\ntotal=0\r\nfor i in range(1,n+1):\r\n total+=i*5\r\n if (total+l[1])>240:\r\n print(i-1)\r\n break\r\n if i==n:\r\n print(n)\r\n", "def solve():\r\n n, k = map(int, input().split())\r\n k = 240-k\r\n ans = 0\r\n while k-(ans+1)*5 >= 0 and ans != n:\r\n ans += 1\r\n k -= ans*5\r\n print(ans)\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, m = map(int, input().split())\nf = 240-m\nsoda = 0\nfor i in range(1, n+1):\n if f-5*i >= 0:\n f = f-5*i\n soda += 1\n elif f-5*i<0:\n break\nprint(soda)\n# Sat Mar 25 2023 11:09:58 GMT+0300 (Moscow Standard Time)\n", "n, k = map(int, input().split())\r\ntotalTime = 0\r\nproblemCount = 0\r\n\r\nfor i in range(1, n+1):\r\n totalTime += 5 * i\r\n if totalTime <= 240 - k:\r\n problemCount += 1\r\n else:\r\n break\r\n\r\nprint(problemCount)\r\n", "n,k=input().split()\navailable=240-int(k)\ntotal=0\nfor i in range(1,int(n)+1):\n total+=(i*5)\n if total>available:\n i-=1\n break \nprint(i)\n ", "n,k=map(int,input().split())\r\nf=n\r\ni=1\r\na=5\r\nn=0\r\nwhile a+k<=240 and n<f:\r\n i=i+1\r\n a=a+5*i\r\n n=n+1\r\nprint(n)", "a,b = map(int,input().split())\r\nc = 240-b\r\nd = 0\r\nd1 = 0\r\ncount = 0\r\n\r\nwhile d <= c and a>=count:\r\n count += 1\r\n d1 += 1\r\n e = 5*d1\r\n d += e\r\n\r\nprint(count-1 )", "def f(n,k):\r\n number = 0\r\n for i in range(1,n+1):\r\n if ((i*5) + k) <= 240:\r\n k += (i*5)\r\n number += 1\r\n else:\r\n return number\r\n return number\r\n\r\ninp = input()\r\ninp = [i for i in inp.split()]\r\nn = int(inp[0])\r\nk = int(inp[1])\r\nprint(f(n,k))", "n, k = map(int, input().split())\r\nleft, right = 0, n\r\nk = 240 - k\r\nif 5 * right * (right + 1) // 2 < k:\r\n print(right)\r\nelse:\r\n while left < right:\r\n mid = (right + left) // 2\r\n if 5 * mid * (mid + 1) // 2 > k:\r\n right = mid - 1\r\n else:\r\n left = mid + 1\r\n if 5 * left * (left + 1) // 2 > k:\r\n print(left - 1)\r\n else:\r\n print(left)\r\n", "n,k=map(int,input().split())\r\nmax_questions=0\r\ntime=240-k\r\n\r\ni=1\r\nwhile time-(5*i)>=0 and max_questions<=n:\r\n max_questions+=1\r\n time-=(i*5)\r\n i+=1\r\n\r\nprint(min(n,max_questions))", "n1, k1 = map(int, input().split())\r\n\r\ntime_available1 = 240 - k1 # Limak's available time in minutes\r\nproblems_solved1 = 0\r\n\r\nfor i in range(1, n1 + 1):\r\n time_needed1 = i * 5 # Time needed to solve the i-th problem\r\n if time_needed1 <= time_available1:\r\n problems_solved1 += 1\r\n time_available1 -= time_needed1\r\n else:\r\n break\r\n\r\nprint(problems_solved1)\r\n", "n=[int(i) for i in input().split()]\r\nt=240-n[1]\r\ns=0\r\nfor i in range(1,n[0]+1):\r\n if t>=(5*i):\r\n s+=1\r\n t=t-(5*i)\r\nprint(s)", "n, k = map(int,input().split())\r\n\r\n# 8 pm to 12 pm, 240 mins left\r\nremaining = 240-k\r\ncnt = 0\r\n\r\nproblems = []\r\nfor i in range(n):\r\n problems.append((i+1)*5)\r\n\r\n\r\ni = 0\r\nwhile i < len(problems):\r\n if remaining - problems[i] < 0:\r\n break\r\n else:\r\n remaining -= problems[i]\r\n cnt += 1\r\n i += 1\r\nprint(cnt)", "n,t = list(map(int, input().split()))\r\nrg = range(1,n+1)\r\nrr = [i for i in rg if 5*sum(rg[:i]) <= 240 - t]\r\nif len(rr) >0 :\r\n print(max(rr))\r\nelse:\r\n print(0)", "n, k = list(map(int,input().split(\" \")))\r\ncount = 0\r\nfor i in range(1,n+1):\r\n if(5*i <= (240-k)):\r\n count+=1\r\n k=k+5*i\r\n\r\nprint(count)", "n,k=map(int,input().split())\r\ntime=240-k\r\nfor i in range(1,n+2):\r\n s=(5*i*(i+1))/2\r\n if s>time:\r\n break\r\nprint(i-1)", "n,k = map(int,input().split())\r\n\r\ntotal = 0\r\nc=0\r\nfor i in range(1,n+1):\r\n total = total + i*5\r\n if total <= (240-k):\r\n c = c+1\r\n else:\r\n break\r\n\r\nprint(c)\r\n\r\n", "n, k = map(int,input().split())\r\na = 240 - k\r\nb = 0\r\nc = 0\r\nfor i in range(1, n + 1):\r\n b += i * 5\r\n if b > a :\r\n continue\r\n c += 1\r\nprint( c )", "a=list(map(int,input().split()))\r\nx= 240 -(a[1]+ (5*a[0]*(a[0]+1)//2))\r\nt=a[0]\r\ndef f(t):\r\n x= 240 -(a[1]+ (5*t*(t+1)//2))\r\n if x>=0:\r\n print(t)\r\n else:\r\n f(t-1)\r\nf(t)\r\n", "n, k = map(int, input().split()) # n : 문제의 개수, k : 파티까지 가는 시간\r\n\r\nleft_time = 240 - k # pt : 문제 풀 수 있는 시간\r\ncount = 0 # count : 풀 수 있는 문제 개수\r\n\r\nwhile left_time >= 5 * (count + 1) and count < n :\r\n count += 1\r\n left_time -= 5 * count\r\n\r\nprint(count)\r\n \r\n\r\n\r\n", "def main():\n\tn,k=map(int,input().split())\n\ttimetotal = 4*60-k\n\tcount = 0\n\twhile(timetotal-5*(count+1)>=0):\n\t\tcount=count+1\n\t\ttimetotal = timetotal - 5*count\t \n\tif(n<count):\n\t\tprint(n)\n\telse:\n\t\tprint(count)\n\nmain()", "import sys\r\n#f=open(\"C:/Users/MAHAMUD MATIN/Desktop/input.txt\", \"r\")\r\nf=sys.stdin\r\nn,k=map(int,f.readline().split())\r\nrem=240-k\r\nsum_=0\r\nl=[]\r\nfor i in range(1,n+1):\r\n sum_+=5*i\r\n l.append(sum_)\r\ni=0\r\nwhile i<n:\r\n if rem%l[i]==rem:\r\n break\r\n else:\r\n i+=1\r\nprint(i)\r\n \r\n", "n,k=map(int,input().split())\r\nkolv=240-k\r\nkolz=0\r\nsch=0\r\nwhile n>sch:\r\n sch+=1\r\n if kolv-(sch*5)>=0:\r\n kolz+=1\r\n kolv-=(sch*5)\r\n else:\r\n break\r\nprint(kolz)\r\n", "def main():\n def task_time(number):\n return 5 * number\n n, k = [int(i) for i in input().split()]\n time_until_midnight = 4 * 60\n tasks_solved = 0\n for task in range(1, n + 1):\n if time_until_midnight - task_time(task) >= k:\n tasks_solved += 1\n time_until_midnight -= task_time(task)\n print(tasks_solved)\n\nif __name__ == \"__main__\":\n main()\n", "v1,v2=map(int,input().split())\r\nc=0\r\nfor i in range(1,v1+1):\r\n v2+=5*i\r\n if v2<=240:\r\n c+=1\r\nprint(c)\r\n ", "a,b=map(int,input().split())\r\nt=0\r\ni=1\r\ncount=0\r\nwhile i<=a:\r\n count+=5*i\r\n if count+b<=240:\r\n t+=1\r\n else:\r\n break\r\n i+=1\r\nprint(t)\r\n ", "i=input().split(\" \")\r\nn,k=int(i[0]),int(i[1])\r\nt=240-k\r\nans=0\r\nc=0\r\nfor i in range(1,n+1):\r\n c+=5*i\r\n ans+=1\r\n if(c>t):\r\n ans-=1\r\n break\r\nprint(ans)\r\n \r\n", "minutos=240\r\nproblemas,minutoscasa=map(int,input().split())\r\ntiempototal=minutos-minutoscasa\r\ncount=0\r\nwhile(tiempototal>=0):\r\n count=count+1\r\n tiempototal=tiempototal-count*5\r\n if tiempototal<0:\r\n count=count-1\r\n if count==problemas:\r\n break\r\nprint(count)", "\r\nn,k=map(int,input().split())\r\ns=0\r\nans=0\r\nfor i in range(1,n+1):\r\n s=5*i+s\r\n a=s+k\r\n if a+1200<=1440:\r\n ans+=1\r\n \r\nprint(ans)\r\n \r\n", "n, k = map(int, input().split())\r\nw = 0 # w - время решенных задач\r\ncount = 0 # - количество решенных задач\r\nwhile w + k < 60 * 4:\r\n count += 1\r\n w = count * 5 + w\r\n if count == n + 1:\r\n break\r\nif w + k > 240 or count > n:\r\n print(count - 1)\r\nelse:\r\n print(count)\r\n", "x,y=(map(int,input().split()))\r\n\r\nl=[]\r\nm=0\r\nc=0\r\nfor i in range(x):\r\n m+=5\r\n l.append(m)\r\nfor j in l:\r\n y+=j\r\n if y<=240:\r\n c+=1\r\nprint(c)", "n, k = map(int, input().split())\r\nrem_time = 240 - k\r\nq = 0\r\nwhile rem_time > 0:\r\n next_q = 5 * (q + 1)\r\n if rem_time >= next_q:\r\n q += 1\r\n rem_time -= next_q\r\nprint(min(q, n))", "abc, bca = map(int, input().split())\r\nchir = 240 - bca\r\nS0l = 0\r\nwhile S0l < abc and chir >= 5 * (S0l + 1):\r\n S0l += 1\r\n chir -= 5 * S0l\r\nprint(S0l)\r\n", "n,m=map(int,input().split())\r\nvr=240-m\r\nss=0\r\nfor k in range(1,n+1):\r\n if (vr>=k*5):\r\n vr=vr-k*5\r\n ss+=1\r\nprint(ss)\r\n", "n, k = map(int, input().split())\r\n\r\nm = 240\r\nm -= k\r\n\r\narr = []\r\ns = 0\r\n\r\nfor i in range(1, n + 1):\r\n s += i * 5\r\n arr.append(s)\r\n\r\nc = 0\r\n\r\nfor i in arr:\r\n if i <= m:\r\n c += 1\r\n\r\nprint(c)", "n,k = map(int, input().split())\r\n\r\ntotal_time = 240 - k\r\n\r\ni = 1\r\nwhile i <= n and total_time - (i*5) >= 0:\r\n total_time -= (i * 5)\r\n i += 1\r\n\r\nprint(i-1)", "NK = input(\"\")\r\nNK = NK.split(\" \", -1)\r\nN = int(NK[0])\r\nK = int(NK[1])\r\n\r\n\r\ndef party(N, K):\r\n tempo1 = recalc(N)\r\n # 5.n + K <= 240 \r\n while tempo1 + K > 240:\r\n if tempo1 + K <= 240:\r\n break\r\n N = N-1\r\n tempo1 = recalc(N)\r\n return(N)\r\n \r\ndef recalc(N):\r\n soma = 0\r\n while N != 0:\r\n tempN = N\r\n soma = soma + tempN\r\n N = N-1\r\n return(soma*5)\r\nprint(party(N, K))", "a,b=map(int,input().split())\r\nl=240-b\r\np=0\r\nk=0\r\nfor i in range(1,a+1):\r\n if k+5*i<=l:\r\n p+=1\r\n k+=5*i\r\n else:break\r\nprint(p)\r\n", "def check(n,k):\r\n c=0\r\n last=240\r\n f=k\r\n for i in range(n):\r\n if(f+5*(i+1)<=last):\r\n c+=1\r\n f+=5*(i+1)\r\n return c\r\n \r\nn,k=map(int,input().split())\r\nprint(check(n,k))", "n, t = map(int, input().split())\r\n\r\nc = 0\r\nnt = 240 - t\r\ns = 0\r\n\r\nfor i in range(1, n + 1):\r\n c += i * 5\r\n if c <= nt:\r\n s += 1\r\n else:\r\n pass\r\nprint(s)\r\n\r\n\r\n\r\n", "n, k = map(int, input().split())\r\ntimeLeft = 240 - k\r\n\r\nx = 0\r\nfor i in range(1, n+1):\r\n if timeLeft >= i*5:\r\n x += 1\r\n timeLeft -= i*5\r\n\r\nprint(x)", "def problems_solved(n, k):\r\n time_available = 240 - k\r\n problems_solved = 0\r\n\r\n for i in range(1, n + 1):\r\n time_required = 5 * i\r\n if time_required <= time_available:\r\n problems_solved += 1\r\n time_available -= time_required\r\n else:\r\n break\r\n\r\n return problems_solved\r\n\r\n# Reading input\r\nn, k = map(int, input().strip().split())\r\n\r\n# Calculating and printing the maximum number of problems Limak can solve\r\nresult = problems_solved(n, k)\r\nprint(result)\r\n", "n, k = map(int,input().split())\r\ni = 0\r\nwhile 5*i + k <= 240:\r\n k += 5*i\r\n i +=1\r\nif 5*i + k > 240:\r\n i -= 1\r\nif i > n:\r\n i = n\r\n \r\nprint(i)", "n,k = map(int,input().split())\r\nall = 240 \r\nt = all - k\r\n\r\ni = 1\r\nx = 0 \r\nc = 0\r\nwhile 1:\r\n x += 5 * i\r\n if x <= t:\r\n c += 1\r\n else:\r\n break\r\n i +=1\r\nif c > n: c=n\r\nprint(c)", "n,t=map(int, input().split())\r\nr=240-t\r\nc=0\r\ntime = 0\r\nfor i in range(1,n+1):\r\n time += i*5\r\n if time <=r:\r\n c+=1\r\nprint(c) ", "a,b = map(int,input().split())\r\nhave = 4*60 - b\r\nsumm = 0\r\nj = 0\r\nfor i in range(1,a+1):\r\n if 5*i <= have:\r\n summ += 5*i\r\n have -= 5*i\r\n j+=1\r\nprint(j)", "v = input()\r\naux = v.split(' ')\r\nsum = 0\r\ncount = 0\r\nk = 240 - int(aux[1])\r\n\r\nfor i in range(int(aux[0])):\r\n sum += ((i + 1) * 5)\r\n if sum <= k:\r\n count += 1\r\n\r\nprint(count)\r\n\r\n ", "n ,k = map(int,input().split())\r\nm ,j = n,k\r\npavapepe = 0\r\nt = 0\r\ntav = 240-k\r\nwhile 1:\r\n t += (pavapepe+1)*5\r\n if t > tav or pavapepe==n:\r\n break\r\n pavapepe+=1\r\nprint(pavapepe)\n# Sat Mar 25 2023 10:35:35 GMT+0300 (Moscow Standard Time)\n", "a,b=map(int,input().split())\r\nc=240-b\r\nd=0\r\nfor i in range(1,a+1):\r\n if c-5*i>=0:\r\n d=d+1\r\n c=c-5*i\r\n else:\r\n break\r\nprint(d)", "#https://codeforces.com/problemset/problem/750/A\r\n\r\nmax_time = 240\r\n(n, k) = (int(x) for x in input().split(\" \"))\r\navailable_time = max_time - k\r\ntime_per_question = 5\r\nquestions_answered = 0\r\ntime_used = 0\r\nfor question_number in range(1, n+1):\r\n question_time = time_per_question*question_number\r\n if((question_time + time_used)<= available_time):\r\n time_used += question_time\r\n questions_answered += 1\r\n else:\r\n break\r\n\r\nprint(questions_answered)", "n, k = map(int, input().split())\nl, kon, s = 0, 4*60, 0\n\nfor i in range(1, n+1):\n\ts+=i*5\n\tif((k+s)<=kon): l+=1\nprint(l)\n", "# Read input\r\nn, k = map(int, input().split())\r\n\r\n# Calculate the total time Limak has\r\ntotal_time = 240 - k\r\n\r\n# Initialize the number of problems solved\r\nproblems_solved = 0\r\n\r\n# Calculate the time needed to solve each problem and count the problems solved\r\nfor i in range(1, n + 1):\r\n time_needed = 5 * i\r\n if total_time >= time_needed:\r\n total_time -= time_needed\r\n problems_solved += 1\r\n else:\r\n break\r\n\r\n# Print the result\r\nprint(problems_solved)\r\n", "w,v=map(int,input().split())\r\nwhile w*(w+1)//2*5>240-v:w-=1\r\nprint(w)", "def numI():\r\n return int(input())\r\ndef numII():\r\n return list(map(int, input().split()))\r\ndef numIII():\r\n return list(map(int, input().split(' ')))\r\ndef strInp():\r\n return input()\r\ndef strInpI():\r\n return list(input())\r\n\r\ndef solve():\r\n noProblem, k = numIII()\r\n l = 0\r\n r = noProblem\r\n ans = 0\r\n while l <= r:\r\n mid = l + (r-l)//2\r\n if (sum(range(0, mid+1)) * 5) + k <= 240:\r\n l = mid + 1\r\n ans = max(ans, mid)\r\n else:\r\n r = mid - 1\r\n print(ans)\r\nsolve()", "n, k = map(int, input().split())\r\nt = 4*60 - k\r\nc = 0\r\nfor i in range(1, n+1):\r\n if(i*5<=t):\r\n c+=1\r\n t-=i*5\r\nprint(c)", "a,s=map(int,input().split())\r\nx=240-s\r\nz=0\r\ncnt=0\r\nfor i in range(a):\r\n if z+(i+1)*5<=x:\r\n z+=(i+1)*5\r\n cnt+=1\r\n else:\r\n break\r\nprint(cnt)", "n,k=map(int,input().split())\r\ns=0\r\np=240-k\r\ni=1\r\nwhile(i<n+1):\r\n s=s+5*i\r\n if(s>p):\r\n break\r\n i=i+1\r\nprint(i-1)", "n, k = map(int, input().split())\r\nt = 240 - k\r\ncounter = 0\r\nwhile t > 0:\r\n counter+=1\r\n t -= counter * 5\r\n if counter == n:\r\n break\r\n\r\nif t < 0:\r\n counter -=1\r\nprint(counter)\r\n", "n,k=map(int,input().split())\r\na=0\r\nif k<240:\r\n l=[]\r\n c=240-k\r\n for i in range(1,n+1):\r\n a=a+5*i\r\n if a<=c:\r\n l.append(i)\r\n if len(l)!=0:\r\n print(l[-1])\r\n else:\r\n print(0)\r\nelse:\r\n print(0)\r\n", "n,k=map(int,input().split())\r\nm,l=240,0\r\nfor i in range(1,n+1):\r\n if i*5+k>m:\r\n break\r\n else:\r\n m,l=m-(i*5),l+1\r\nprint(l)", "n,k=map(int,input().split())\r\nrem=240-k\r\nsum=0\r\nc=0\r\nfor i in range(5,(n*5)+1,5):\r\n if sum+i<=rem:\r\n sum=sum+i\r\n # rem=rem-i\r\n c+=1\r\n else:\r\n break\r\nprint(c)", "num, g = map(int, input().split())\r\nwhile num * (num + 1) // 2 * 5 > 240 - g:\r\n num -= 1\r\nprint (num)\r\n", "from math import floor, ceil\r\n\r\na, b = [int(x)for x in input().split()]\r\nprint(min(a, int(((25 + 40*(240-b))**0.5 - 5)//10)))", "n,k= map(int,input().split())\r\nk = 240-k \r\np = 0\r\nwhile p*(p+1)<=(2/5)*k :\r\n p = p+1 \r\nif p-1<=n:\r\n print(p-1)\r\nelse:\r\n print(n)", "lst = list(map(int, input().split()))\r\nval = ((240 - lst[1]) / 5) * 2\r\nn = 0\r\n\r\nwhile n*(n+1) <= val:\r\n n+=1\r\n\r\nprint(min(lst[0], n-1))\r\n", "no_of_problem , time_to_go_party = map(int, input().split())\r\nrem_time = 240 - time_to_go_party\r\ncount = 0\r\ntime_taken = 0\r\nfor i in range(1, no_of_problem+1):\r\n time_taken += i * 5\r\n if time_taken <= rem_time:\r\n count +=1\r\n\r\nprint(count)", "x, y = map(int, input().split())\r\nz = 240 - y\r\na = 0\r\ncount = 0\r\nfor i in range(1,x+1):\r\n a = a + (i * 5)\r\n if a <= z:\r\n count += 1\r\nprint(count)\r\n ", "n, k = map(int, input().split())\r\nproblems_solved = 0\r\ntime_available = 240 - k\r\nfor i in range(1, n+1):\r\n time_required = 5 * i\r\n if time_available >= time_required:\r\n problems_solved += 1\r\n time_available -= time_required\r\n else:\r\n break\r\nprint(problems_solved)", "n, k = map(int, input().split())\r\nmatch_time = 240 # (24-20) * 60\r\ntime_to_solve = match_time - k\r\ntasks_solved = 0\r\ni = 1\r\nwhile i <= n:\r\n if 5 * i <= time_to_solve:\r\n tasks_solved += 1\r\n time_to_solve -= 5 * i\r\n else:\r\n break\r\n i += 1\r\n\r\nprint(tasks_solved)", "#4hrs= 4*60 = 240 mins\r\nx=input()\r\nlst=x.split()\r\nn=int(lst[0]) \r\nk=int(lst[1]) \r\nt=240-k \r\ntime,count=0,0\r\nfor i in range(1,n+1): \r\n time=i*5 \r\n t=t-time \r\n if(t<0):\r\n break\r\n count+=1 \r\nprint(count) ", "n, k = map(int, input().split())\r\n\r\ntime = 4 * 60\r\ntime -= k\r\n\r\nprob = 0\r\n\r\nfor x in range(1, n+1):\r\n if time >= (5 * x):\r\n prob += 1\r\n time -= (5 * x)\r\n\r\n\r\nprint(prob)\r\n", "n,k = map(int,input().split())\r\nwhile n*(n+1)*5//2 > 240 - k:\r\n n -=1\r\nprint(n)\r\n", "\r\n\r\nlist = list (int(num) for num in input().split())\r\n\r\nn = list[0]\r\nk = list[1]\r\n\r\n\r\ncontest_time = 240 - k\r\ncounter = 0\r\n\r\nfor i in range(1,n +1):\r\n if(contest_time - (5 * i) >= 0 ):\r\n contest_time = contest_time - (5 * i)\r\n counter = counter + 1\r\n else:\r\n break\r\n\r\nprint(str(counter))\r\n", "n, k = [int(x) for x in input().split()]\r\nminut = 240 - k\r\ntotal = 0\r\nfor i in range(1, n + 1):\r\n if minut >= 5 * i:\r\n minut -= 5 * i\r\n total += 1 \r\n else:\r\n break\r\nprint(total)", "n,t=map(int,input().split())\r\nx=240-t;s=0;flag=0\r\nfor i in range(1,n+1):\r\n s+=5*i\r\n if s>x:\r\n print(i-1)\r\n flag=1\r\n break\r\n if s==x:\r\n print(i)\r\n flag=1\r\n break\r\nif flag==0:\r\n print(n)\r\n", "n, k = map(int, input().split())\r\n# 4 * 60 = 240\r\ni = 1\r\nans = k\r\nif k >= 240:\r\n print(0)\r\nelse:\r\n while i <= n:\r\n ans += i * 5\r\n if ans > 240:\r\n break\r\n i += 1\r\n print(i-1)", "n,k=map(int,input().split())\r\nres,s,c=240-k,0,0\r\nfor i in range(1,n+1):\r\n s=s+5*i\r\n if s>res:\r\n break\r\n c=c+1\r\nprint(c)\r\n", "n, k = map(int, input().split())\r\nk = 240-k\r\ni = 0\r\nt = 0\r\nwhile k >= t and i<=n:\r\n i += 1\r\n t = t + 5*i\r\nprint(i-1)\n# Mon Mar 20 2023 18:08:43 GMT+0300 (Moscow Standard Time)\n", "from typing import Literal\n\ndef main():\n four_hours: Literal[240] = 240\n n, k = map(int, input().split())\n\n diff: int = four_hours - k\n c: int = 0\n \n for i in range(1, n+1):\n if diff - (5 * i) >= 0:\n diff -= (5 * i)\n c += 1\n else:\n break\n\n print(c)\n\nif __name__ == \"__main__\":\n main()\n", "a,b=map(int,input().split())\r\nc=0\r\nr=0\r\nfor i in range(a):\r\n c+=(5*(i+1))\r\n if c+b<=240:\r\n r+=1\r\nprint(r)", "n, k = map(int, input().split())\r\nwhile n * (n + 1)//2 * 5 > 240 - k:\r\n n -= 1\r\nprint(n) \r\n", "n,m=[int(x) for x in input().split()]\r\ny=240-m\r\na=0\r\nb=0\r\nfor i in range(1,n+1):\r\n a=a+(5*i)\r\n if(a<=y):\r\n b=b+1\r\n else:\r\n break\r\nprint(b) ", "def max_problems_solved(n, k):\r\n max_problems = 0\r\n total_time = 0\r\n\r\n for i in range(1, n + 1):\r\n total_time += 5 * i\r\n if total_time + k <= 240:\r\n max_problems = i\r\n else:\r\n break\r\n\r\n return max_problems\r\n\r\n# Example usage:\r\nif __name__ == \"__main__\":\r\n n, k = map(int, input().split())\r\n print(max_problems_solved(n, k))\r\n", "'''\r\n#list(map(int,input().split()))'''\r\nn,k=list(map(int,input().split()));found=False;t=0\r\nfor i in range(1,n+1):\r\n t+=i*5\r\n if k+t > 240:print(i-1);found=True;break\r\nif not found:print(n)\r\n\r\n", "n , k = list(map(int, input().split()))\r\nsm = [(5*i) for i in range(1,n+1)]\r\n\r\nfor j in range(1, len(sm)):\r\n sm[j] += sm[j-1]\r\n\r\nl = 0\r\nr = len(sm) - 1\r\ntarget = 240 - k\r\n\r\nwhile l <= r:\r\n md = (l+r) // 2\r\n if sm[md] == target:\r\n ans = True\r\n break\r\n elif sm[md] < target:\r\n l = md + 1\r\n else:\r\n r = md - 1\r\nif l <= r:\r\n print(md + 1)\r\nelse:\r\n print(l)", "# Read input values\r\nn, k = map(int, input().split())\r\n\r\n# Calculate the total time Limak has for solving problems\r\ntotal_time = 240 - k\r\n\r\n# Initialize a variable to keep track of the number of problems solved\r\nproblems_solved = 0\r\n\r\n# Iterate through the problems and calculate the time required to solve each problem\r\nfor i in range(1, n + 1):\r\n time_required = 5 * i\r\n\r\n # Check if Limak has enough time to solve the current problem\r\n if total_time >= time_required:\r\n total_time -= time_required\r\n problems_solved += 1\r\n else:\r\n break\r\n\r\n# Print the result\r\nprint(problems_solved)\r\n", "n,k=map(int,input().split())\r\ncnt=240-k\r\nmx=0\r\nfor i in range(1,n+1):\r\n cnt=cnt-5*i\r\n if cnt>=0:\r\n mx+=1\r\n else:\r\n break\r\nprint(mx)", "n,k=map(int,input().split())\r\nt=4*60-k\r\nh=0\r\nfor i in range(n):\r\n e=5*(1+i)\r\n if e>t:break\r\n t-=e\r\n h+=1\r\nprint(h)\r\n", "n, k = map(int, input().split())\r\nmax_time = 240 - k\r\nans = 1\r\nt = 0\r\nfor i in range(n):\r\n t += ans * 5\r\n if t > max_time:\r\n break\r\n else:\r\n ans += 1\r\nprint(ans - 1)\r\n", "dat = input().split(\" \")\nct = int(dat[0])\ntm = int(dat[1])\ntot_tim = 240\nwor_tim = 240-tm\nfor i in range(1,ct+1):\n wor_tim = wor_tim-5*i\n if wor_tim<0:\n i = i-1\n break\nprint(i)\n\n \t \t \t \t \t \t \t \t \t\t \t\t\t", "import sys\r\nimport bisect\r\n# Fast input reading\r\ndef input():\r\n return sys.stdin.readline().rstrip()\r\n\r\n# Constants\r\nMOD = 10**9 + 7\r\nINF = float('inf')\r\n\r\n# Utility functions\r\ndef gcd(a, b):\r\n while b:\r\n a, b = b, a % b\r\n return a\r\n\r\ndef lcm(a, b):\r\n return a * b // gcd(a, b)\r\n\r\n# Main function\r\ndef main():\r\n n,k=map(int,input().split())\r\n t=240\r\n x=0\r\n answer=0\r\n for i in range(1,n+1):\r\n x=x+5*i\r\n if(x+k<=t):\r\n answer+=1\r\n else:\r\n break\r\n print(answer)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()", "probs , tra = list(map(int,input().split()))\r\ntime=240-tra\r\ncount=0\r\nfor i in range(probs):\r\n time=time-5*(1+i)\r\n if time>=0:\r\n count+=1\r\nprint(count)\r\n\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, k = [int(x) for x in input().split()]\n k, i = 240 - k, 0\n while k and i < n:\n if k >= (i + 1) * 5:\n i += 1\n k -= i * 5\n else:\n break\n print(i)\n\n\nif __name__ == \"__main__\":\n main()\n", "problems, time = [int(s) for s in input().split()]\r\ncount = 0\r\n \r\nfor i in range(1, problems + 1):\r\n # adds the time it takes to complete the problem to the time to arrive\r\n time += 5 * i\r\n # if the total time is more than or equal to 4 hours (240 minutes)\r\n if time > 240:\r\n # breaks\r\n break\r\n else:\r\n count += 1\r\n \r\n# prints the total count\r\nprint(count)", "n,k=map(int,input().split())\r\nb=0\r\nif k<240:\r\n l=[]\r\n c=240-k\r\n for i in range(1,n+1):\r\n b=b+5*i\r\n if b<=c:\r\n l.append(i)\r\n if len(l)!=0:\r\n print(l[-1])\r\n else:\r\n print(0)\r\nelse:\r\n print(0)", "def canGo(n, time):\r\n #return 5 * n * (n + 1) // 2 <= time\r\n for i in range(1, n + 1):\r\n time -= 5 * i\r\n if time < 0:\r\n return False\r\n return True\r\n\r\n\r\nn , k = map(int, input().split())\r\n\r\ntime = 240 - k\r\ncount = 0\r\n\r\n# binary search\r\ncount = 0\r\nleft = 1\r\nright = n\r\n\r\nwhile left <= right:\r\n mid = (left + right) // 2\r\n if canGo(mid, time):\r\n count = mid\r\n left = mid + 1\r\n else:\r\n right = mid - 1\r\n\r\nprint(count)", "n,k = map(int,input().split())\r\nt = 4*60\r\nc = 0\r\nfor i in range(1,n+1):\r\n t -= i*5\r\n if k > t:\r\n print(c)\r\n break\r\n c += 1\r\nelse:\r\n print(n)", "a,b=map(int,input().split())\r\nn=0\r\nm=0\r\nfor i in range(1,a+1):\r\n n+=(5*i)\r\n m+=1\r\n if ((n+b))==(240):\r\n break\r\n elif ((n+b))>(240):\r\n m-=1\r\n break\r\nprint(m)", "n, k = map(int, input().split())\r\ncount = 0\r\navailable = (240) - k\r\n\r\ni = 1\r\nwhile available >= (i*5):\r\n available -= (5*i)\r\n count += 1\r\n i += 1\r\n\r\nif count >= n:\r\n print(n)\r\nelse:\r\n print(count)", "def NewYear2017(n, k):\r\n contest_time = 240 - k\r\n max_problems = 0\r\n for i in range(1, n + 1):\r\n contest_time -= 5 * i\r\n if contest_time < 0:\r\n return max_problems\r\n max_problems += 1\r\n return max_problems\r\n\r\n\r\nn, k = map(int, input().split())\r\nresult = NewYear2017(n, k)\r\nprint(result)\r\n", "ogmin = 4*60\nn, k = list(map(int, input().split()))\nminu = ogmin-k\ns = 0\nprom = 0\nmins = [i*5 for i in range(1, n+1)]\nfor i in mins:\n\ts+=i\n\tprom+=1\n\tif s > minu:\n\t\tprint(prom-1)\n\t\tbreak\n\telif s == minu:\n\t\tprint(prom)\n\t\tbreak\n\telif i == mins[-1]:\n\t\tprint(prom)\n\t\tbreak", "pc, t = [int(x) for x in input().split()]\r\nmaxpc = 0\r\n\r\nfor i in range(pc+1):\r\n if 5 * (i*(i+1)//2) + t <= 240:\r\n maxpc = max(maxpc, i)\r\n\r\nprint(maxpc)\r\n \r\n", "n,k=map(int,input().split())\r\n\r\navailable_time=4*60-k\r\n\r\nproblems_solved=0\r\ntime_needed=0\r\n\r\nfor i in range(1,n+1):\r\n time_needed +=i*5\r\n if time_needed <=available_time:\r\n problems_solved+=1\r\n else:\r\n break\r\n \r\nprint(problems_solved)", "import math\r\nn, k = [int(el) for el in input().split()]\r\ns = 240 - k\r\nd = 25 + 40 * s\r\nn1 = (math.sqrt(d) - 5) / 10\r\nif n1 >= n:\r\n print(n)\r\nelse:\r\n print(int(n1))", "n, k = map(int, input().split())\r\nt = 240\r\ns = 0\r\ncount = 0\r\nf = t - k\r\ni = 1 # Initialize i here\r\nwhile f > s and i <= n:\r\n x = 5 * i\r\n s = s + x\r\n\r\n if f < s: # Changed the condition from f < s to f < s\r\n break\r\n i = i + 1\r\n\r\nprint(i - 1)\r\n", "k,n=map(int,input().split())\r\nn=240-n\r\nc=0\r\nif n>=5:\r\n for i in range(1,k+1):\r\n if n>=5*i:\r\n n-=5*i\r\n c+=1\r\nprint(c)", "num, minutes = map(int, input().split())\r\n\r\nminutes = 240 - minutes\r\n\r\nreq = 0\r\nfor i in range(1, num+1):\r\n \r\n req += 5*i\r\n if req > minutes:\r\n print(i-1)\r\n exit()\r\n\r\nprint(num)\r\n\r\n \r\n \r\n ", "n, k = map(int, input().split())\r\ncurrent_time = 20 * 60 # convert to minutes\r\nproblems_solved = 0\r\n\r\nfor i in range(1, n + 1):\r\n problem_time = 5 * i\r\n finish_time = current_time + problem_time\r\n if finish_time <= (24 * 60) and (finish_time + k) <= (24 * 60):\r\n problems_solved += 1\r\n current_time = finish_time\r\n else:\r\n break\r\n\r\nprint(problems_solved)\r\n", "n, k = input().split()\r\nn, k = int(n), int(k)\r\ntime_prob = 0\r\nfor i in range(1, n + 1):\r\n time_prob += 5 * i\r\n time_left = 240 - k - time_prob\r\n if time_left < 0:\r\n i -= 1\r\n break\r\nprint(i)\r\n", "n, m=map(int, input().split())\nf=240-m\nmops=0\nfor i in range(1, n+1):\n if f-5*i>=0:\n f=f-5*i\n mops+=1\n elif f-5*i<0:\n break\nprint(mops)\n# Sat Mar 25 2023 10:36:36 GMT+0300 (Moscow Standard Time)\n", "n,k=map(int,input().split())\r\nk=240-k\r\ni=1\r\nfor i in range(1,n+2):\r\n if k<5*i:\r\n break\r\n k-=5*i\r\nprint(i-1)", "n,k=map(int,input().split())\r\nc=0\r\nf=0\r\nfor i in range(n+1):\r\n c+=i*5\r\n if c+k>240:\r\n f=1\r\n break\r\nif f==1:\r\n print(i-1)\r\nelse:\r\n print(i)\r\n \r\n", "def calc(p, k):\r\n return k + (5 * p * (p + 1)) // 2\r\n\r\ndef BS(n, k):\r\n ans = 0\r\n l = 0\r\n r = n\r\n\r\n while l <= r:\r\n m = (l + r) // 2\r\n c = calc(m, k)\r\n if c == 240:\r\n return m\r\n if c < 240:\r\n ans = m\r\n l = m + 1\r\n else:\r\n r = m - 1\r\n return ans\r\n\r\nn, k = map(int, input().split())\r\nprint(BS(n, k))\r\n", "import math\r\na,b=map(int,input().split())\r\nrem=240-b\r\nn=((math.sqrt(1+((8*rem)/5)))-1)/2\r\nif(math.floor(n)<=a):\r\n print(math.floor(n))\r\nelse:\r\n print(a)", "n,time=map(int,input().split())\r\nm = 240 - time\r\nc=0\r\ni=1\r\nt = 0\r\nwhile(i<=n and t<=m):\r\n t+= (i*5)\r\n if(t<=m):\r\n c+=1\r\n i+=1\r\nprint(c)\r\n", "n, k = map(int, input().split())\r\ntime_available = 240 - k # Limak has 240 minutes to solve problems and get to the party\r\n\r\nproblems_solved = 0\r\ntotal_time = 0\r\n\r\nfor i in range(1, n + 1):\r\n total_time += 5 * i # Time required to solve the i-th problem\r\n if total_time <= time_available:\r\n problems_solved += 1\r\n else:\r\n break\r\n\r\nprint(problems_solved)\r\n", "n, m = list(map(int, input().split()))\r\n\r\ntotal_time_dk = 4 * 60\r\n\r\nmin_time_dk = total_time_dk - m\r\n\r\ntotal = 0\r\ny = 0\r\n\r\nfor i in range(1, n+1):\r\n answer_time = 5\r\n x = answer_time * i\r\n y += x\r\n if min_time_dk - y >= 0:\r\n total += 1\r\n\r\nprint(total)", "# We have a pool og 4 * 60 mins\r\n# Going to the party is non negotiable so remove the transit time\r\n# from the party minute to get the solution time we have\r\ndef calculate_solution_capacity(time_left: int, num_of_questions: int) -> int:\r\n solved_questions:int = 0\r\n for i in range(1 ,num_of_questions + 1):\r\n time_left = time_left - (5 * i)\r\n if time_left >= 0: \r\n solved_questions = i\r\n i += 1\r\n else: \r\n break\r\n return solved_questions\r\n\r\ndef main(num_of_questions: int, transit_time: int):\r\n total_time: int = 4 * 60\r\n time_left: int = total_time - transit_time\r\n return calculate_solution_capacity(time_left, num_of_questions)\r\n\r\nif __name__ == \"__main__\":\r\n inp = input()\r\n num_of_questions, transit_time= inp.split(sep=\" \")\r\n print(main(int(num_of_questions), int(transit_time)))\r\n ", "n,k=list(map(int,input().split()))\r\n\r\ntime = k\r\ni=0\r\nwhile(time<=240 and i<=n):\r\n i=i+1\r\n time=time+(5*i)\r\nprint(i-1) ", "\r\nn, k = map(int, input().split())\r\n\r\ncontest_duration = 240 \r\ntime_left = contest_duration - k \r\nproblems_solved = 0 \r\ntotal_time = 0 \r\nfor i in range(1, n + 1):\r\n problem_time = 5 * i \r\n if total_time + problem_time <= time_left:\r\n problems_solved += 1\r\n total_time += problem_time\r\n else:\r\n break\r\nprint(problems_solved)", "n, k = map(int, input().split())\r\n\r\ntime_limit = 240 - k\r\nproblems_solved = 0\r\ntime_required = 0\r\n\r\nfor i in range(1, n + 1):\r\n time_required += 5 * i\r\n if time_required <= time_limit:\r\n problems_solved += 1\r\n else:\r\n break\r\n\r\nprint(problems_solved)\r\n", "n,k=map(int,input().split())\r\ns=240-k\r\ncnt=0\r\nsum=0\r\nfor i in range(1,n+1):\r\n sum+=5*i\r\n if sum>s:\r\n break\r\n cnt+=1\r\nprint(cnt)\r\n", "n,k=map(int,list(input().split()))\r\ncount=0\r\nminut_z=0\r\nwhile k<=240 and count<n:\r\n minut_z=minut_z+5\r\n k=k+minut_z\r\n if k>240:\r\n count=count-1\r\n count=count+1\r\nprint(count)", "n, k = [int(i) for i in input().split()]\r\ntotal = 240\r\ntotal -= k\r\ni = 0\r\nwhile total >= 0:\r\n i += 1\r\n if i > n:\r\n break\r\n\r\n total -= 5 * i\r\nprint(i-1)", "import sys\r\nimport os\r\nfrom collections import Counter\r\nif os.path.exists('input.txt'):\r\n sys.stdin = open(\"input.txt\",\"r\")\r\n sys.stdout = open(\"output.txt\",\"w\")\r\n sys.stderr = open(\"error.txt\",\"w\")\r\nfrom itertools import accumulate\r\ninput = lambda: sys.stdin.readline()\r\n\r\nn , k = map(int ,input().split())\r\nminutes = 240 - k\r\nres = [0] * n\r\n\r\nfor i in range(1 , n+1):\r\n res[i-1] = 5 * i \r\n\r\nres = list(accumulate(res))\r\n\r\nfres = 0\r\nl = 0 ; r = n -1\r\nwhile l <= r :\r\n mid = (l + r) // 2\r\n if res[mid] <= minutes:\r\n l = mid +1\r\n fres = max(fres , mid+1)\r\n else :\r\n r = mid -1\r\n \r\nprint(fres)", "number_of_problems, house_to_party = map(int, input().split())\r\n\r\ntime_remaining = 240 - house_to_party\r\nproblems_solved = 0\r\n\r\nfor i in range(1, number_of_problems+1):\r\n if time_remaining >= 5*i:\r\n problems_solved += 1\r\n time_remaining -= 5*i\r\nprint(problems_solved)", "import math\r\n\r\nn, k = map(int, input().split())\r\ntime = 240 - k\r\n\r\nproblems_solved = 0\r\nfor i in range(1, n + 1):\r\n if time >= 5 * i:\r\n problems_solved += 1\r\n time -= 5 * i\r\n else:\r\n break\r\n\r\nprint(problems_solved)\r\n", "n, k = list(map(int, input().split()))\r\ntime = 240 - k\r\ntime_solve = [5] * (n+1)\r\ntime_solve[0] = 0\r\nfor i in range (1, len(time_solve)):\r\n time_solve[i]= (time_solve[i] * i) +time_solve[i-1]\r\nleft = 0\r\nright = n\r\nwhile (left<=right):\r\n mid = left + (right - left)//2\r\n if time_solve[mid] == time:\r\n right = mid\r\n break\r\n if time_solve[mid]<time:\r\n left = mid + 1\r\n else:\r\n right = mid - 1\r\nprint(right)", "n,k=list(map(int,input().split()))\r\nk=240-k\r\ncurr=0\r\nans=-1\r\nfor i in range(1,n+1):\r\n if curr+(5*i)>k:\r\n ans=i-1\r\n break\r\n ans=i\r\n curr+=5*i\r\nprint(ans)", "n, k = map(int, input().split())\r\nhasTask = (240 - k) // 5\r\ni = 1\r\nfor i in range(1, n + 1):\r\n hasTask -= i\r\n if hasTask < 0:\r\n print(i - 1)\r\n break\r\nelse:\r\n print(n)\r\n", "lista = [int(x) for x in input().split(' ')]\r\nn = lista[0]\r\ntempo_festa = lista[1]\r\n\r\ntempo_inicial = 1200 #(20h em min)\r\ntempo_final = 1440 #(24h em min)\r\n\r\ntempo_questao = 0\r\n\r\nfor i in range(1, n+1):\r\n tempo_questao += 5*i\r\n tempo_total = tempo_inicial + tempo_festa + tempo_questao\r\n if tempo_total > tempo_final:\r\n resposta = i-1\r\n break\r\n resposta = i\r\nprint(resposta)", "a,b=list(map(int,input().split()))\r\nlow=1\r\nhigh=a\r\nsumm=240-b\r\nans=0\r\nwhile low<=high:\r\n mid=(high+low)//2\r\n cur=(mid*(mid+1))//2\r\n if cur*5>summ:\r\n high=mid-1\r\n elif cur*5 <=summ:\r\n ans=mid\r\n low=mid+1\r\nprint(ans)", "n, k = map(int, input().split())\r\ntotal = 0\r\ni = 1\r\nwhile i <= n:\r\n\ttotal += 5*i\r\n\tif total+k <= 240:\r\n\t\ti += 1\r\n\telse:\r\n\t\tbreak\r\nprint(i-1)", "n, k = map(int,input().split())\r\n\r\nans = 0\r\nif k > 235:\r\n print(ans)\r\nelse:\r\n for i in range(1, n+1):\r\n k += 5*i\r\n if k <= 240:\r\n ans += 1\r\n else:\r\n break\r\n print(ans)", "def new_year():\r\n n, k = map(int, input().split())\r\n time_to_midnight = 240\r\n time_to_solve = time_to_midnight - k\r\n counter = 0\r\n \r\n for i in range(1, n+1):\r\n if time_to_solve - (i*5) >= 0:\r\n counter = counter + 1\r\n time_to_solve = time_to_solve - (i*5)\r\n \r\n print(counter)\r\n \r\nnew_year()", "n, m = map(int, input().split())\r\ni, k = map(int, (0, 0))\r\nwhile k<=240-m:\r\n i+=1\r\n k+=(5*i)\r\n if i == n:\r\n break\r\nprint(i if k<=240-m else i-1)", "\n\n_ = input() \n\nn, k = [int(x) for x in _.split()]\n\nr_time = 240 - k\nel_time = 0\n\nx = n\nfor i in range(1, n+1):\n el_time = el_time + (i * 5)\n\n if el_time > r_time:\n x = i - 1\n break\n\n if el_time == r_time:\n x = i\n \n\n \n\nprint(min(x , n))\n\n\n\n", "n,k=map(int,input().split())\r\nk1=240\r\ns=0\r\nco=0\r\nfor i in range(1,n+1):\r\n s+=(i*5)\r\n if s+k>k1:\r\n c=s-(i*5)\r\n break\r\n else:\r\n co+=1\r\nprint(co)", "n,k=map(int,input().split())\nl=[]\nfor i in range(1,n+1):\n l.append(5*i)\nf=240-k\n#print(f)\nsum=u=0\nfor x in l:\n sum=sum+x\n u=u+1\n if (sum>f):\n \n u=u-1\n break\n#print(sum) \nprint(u)\n\t \t \t \t\t\t\t\t\t \t\t \t \t", "a=input().split()\r\nc=0\r\nk=240-int(a[1])\r\ncount=0\r\nfor i in range(int(a[0])):\r\n c=c+5*(i+1)\r\n if c <= k: \r\n count+=1 \r\n else:\r\n break\r\n \r\nprint(count)", "from collections import Counter\r\nimport math\r\n#input()\r\nls = list(map(int, input().split()))\r\nss = ls[1]\r\ncnt = 0\r\nfor item in range(1, ls[0] + 1):\r\n if ss + item * 5 > 240:\r\n break\r\n ss += item * 5\r\n cnt += 1\r\nprint(cnt)\r\n", "n, k = map(int, input().split())\r\nt = 240 - k\r\ntz = 5\r\ni = 0\r\nwhile t >= tz and i < n:\r\n t -= tz\r\n tz += 5\r\n i += 1\r\nprint(i)", "count, hours = map(int, input().split())\r\ncount_exes = 0\r\nsum_hours = 0\r\nfor i in range(1, count + 1):\r\n sum_hours += 5 * i\r\n if hours + sum_hours > 240:\r\n break\r\n else:\r\n count_exes += 1\r\nprint(count_exes)", "n, k = map(int, input().split())\r\nr=0\r\nvr = 240 - k\r\nfor i in range(1,n+1):\r\n if vr-i*5>=0:\r\n r+=1\r\n vr-=i*5\r\nprint(r)", "n,k = map(int,input().split())\r\nrt = 240 - k \r\nc=0\r\nfor i in range(1,n+1):\r\n if(rt>=i*5):\r\n rt-=i*5\r\n c+=1\r\n\r\nprint(c)", "zadachi, time_for_journey = map(int, input().split())\r\n\r\n\r\ndef right_bin_search(left, right):\r\n while left < right:\r\n middle = (left + right + 1) // 2\r\n # Составляешь условие.\r\n time_sum = 0\r\n for i in range(1, middle + 1):\r\n time_sum += i * 5\r\n if 240 >= time_sum + time_for_journey:\r\n left = middle\r\n else:\r\n right = middle - 1\r\n return left\r\n\r\n\r\nprint(right_bin_search(0, zadachi))\r\n", "a,b = map(int,input().split())\r\n\r\nx = 240 - b\r\n\r\nc = 0\r\nfor i in range(1,a+1):\r\n if x >= 5*i:\r\n c+=1\r\n x = x - c*5\r\n else:\r\n break\r\nprint(c)", "n, k = map(int, input().split())\r\ns = 0\r\ncount = 0\r\nfor i in range(1, n+1):\r\n s += i*5\r\n if ((s+k)/60)<=4:\r\n count += 1\r\nprint(count)", "a, s = map(int, input().split())\r\npudge=240-s\r\nx=(-1+(1+8*pudge/5)**.5)/2\r\nprint(min(a, int(x)))\r\n\n# Sat Mar 25 2023 11:26:15 GMT+0300 (Moscow Standard Time)\n", "a, b = map(int, input().split()) # кол-во задач и время(мин) до вечеринки\r\nc = 0 # кол-во задач\r\nd = 240 - b # время на задачи\r\nwhile d > 0:\r\n c+=1\r\n d-=c*5\r\n if a == c: #если кол-во решеных задач равно максимальному то выходим из цикла\r\n break\r\n#если время отрицательно значит нужно вычесть одну задачу что бы успеть ко времени \r\nif d<0:\r\n c-=1\r\nprint(c)", "n,k=map(int, input().split())\r\ns=0\r\nl=0\r\nfor i in range(n):\r\n i+=1\r\n c=5*i\r\n l+=c\r\n m=240-k\r\n if l<=m:\r\n s+=1\r\nprint(s)", "n, k = map(int, input().split())\r\nsum = 0\r\ncount = 0\r\nfor i in range(1,n+1):\r\n sum += i*5\r\n if(sum <= 240-k):\r\n count+=1\r\nprint(count)", "x, y = map(int, input().split())\r\nt = 0\r\ni = 1\r\ncount = 0\r\n\r\nwhile i <= x:\r\n count += 5 * i\r\n \r\n if count + y <= 240:\r\n t += 1\r\n else:\r\n break\r\n \r\n i += 1\r\n\r\nprint(t)", "n, k = map(int, input().split())\r\nc = 0\r\nd = 0\r\ns = 0\r\nwhile c <= n and s <= 240:\r\n c += 1\r\n d = d + c * 5\r\n s = d + k\r\nprint(c - 1)", "n, k = map(int, input().split())\r\ncount = 0\r\ntask = 1\r\nE = 240 - k\r\ntime = 5\r\nwhile time < E+1 and task < n+1:\r\n count += 1\r\n E -= time\r\n task +=1\r\n time = 5 * task\r\nprint(count)\r\n", "n, k = map(int, input().split())\r\nt = 0\r\ns = 0\r\nfor i in range(1, n+1):\r\n t += 5*i\r\n if t > 240 - k:\r\n break\r\n s += 1\r\nprint(s)", "# t = int(input())\r\nfor _ in range(1):\r\n n,k = map(int,input().split())\r\n l,r = 0,n\r\n res = 0\r\n while l<=r:\r\n mid = l + (r-l)//2\r\n a = 5*(mid*(mid+1)//2)\r\n if a+k>240:\r\n r = mid-1\r\n else:\r\n res = max(res,mid)\r\n l = mid+1\r\n print(res)", "n, p = map(int, input().split())\r\ntime_left = 240 - p\r\nsolved_problems = 0\r\nfor i in range(1, n+1):\r\n time_for_problem = 5 * i\r\n if time_for_problem <= time_left:\r\n time_left -= time_for_problem\r\n solved_problems += 1\r\n else:\r\n break\r\nprint(solved_problems)\r\n", "n, k = map(int, input().split())\r\ntotal_time = 240 - k\r\nsolved = 0\r\n\r\nfor i in range(1, n+1):\r\n time_left = total_time - 5*i\r\n if time_left >= 0:\r\n solved += 1\r\n total_time = time_left\r\n else:\r\n break\r\n\r\nprint(solved)\r\n", "a,b=map(int,input().split())\r\nt=240\r\nc=0\r\nf=t-b\r\ni=1\r\nwhile(f>=0 and c!=a+1):\r\n f-=(i*5)\r\n c+=1\r\n i+=1\r\nprint(c-1)", "n,k=[int(i) for i in input().split()]\r\ncount=0\r\nsum=0\r\nfor i in range(1,n+1):\r\n sum+=5*i \r\n if sum<=240-k:\r\n count+=1 \r\nprint(count)", "n,k=map(int,input().split())\r\nans=0\r\nm=240-k\r\nfor i in range(1,n+1):\r\n m-=5*i\r\n if m<0:break\r\n ans+=1\r\nprint(ans)", "R = lambda:list(map(int,input().split()))\r\n\r\ndef solve():\r\n\r\n n, k = R()\r\n \r\n x = 240-k\r\n \r\n ans, i = 0, 0\r\n \r\n while True:\r\n ans += (5*i)\r\n \r\n if ans==x:\r\n break\r\n \r\n if ans>x:\r\n i -= 1\r\n break\r\n \r\n i += 1\r\n \r\n print(min(i, n)) \r\n \r\n \r\n\r\nfor _ in range(1):\r\n solve()", "n, k = map(int, input().split())\r\nres = 240 - k\r\nsum_val = 0\r\nc = 0\r\nfor i in range(1, n + 1):\r\n sum_val += 5 * i\r\n if sum_val > res:\r\n break\r\n c += 1\r\nprint(c)", "n, k = map(int, input().split())\r\nz = 240 - k\r\nc = 0\r\ncount = 0\r\n\r\nfor i in range(1, n + 1):\r\n c += 5 * i\r\n if c > z:\r\n break\r\n count += 1\r\n\r\nprint(count)\r\n", "# n = int(input())\na, b = map(int, input().split())\ni = 1\nd = 0\nf = True\nwhile f == True:\n b += 5 * i\n if b > 240 or d == a:\n f = False\n break\n i += 1\n d += 1\nprint(d)\n# s = []\n# while n != 0:\n# a = list(map(int, input().split()))\n\n# n -= 1\n", "n, k, time = 0, 0, 0\n\n\ndef check(m):\n global n, k, time\n return k + 5 * m <= 240\n\n\ndef main():\n global n, k, time\n n, k = map(int, input().split())\n time = 240 - k\n ans = 0\n for i in range(1, n+1):\n if check(i):\n ans += 1\n k += 5 * i\n print(ans)\n \n # l = 1\n # r = n\n # while l < r:\n # m = (l + r) // 2\n # if check(m):\n # l = m + 1\n # else:\n # r = m\n # print(l)\n\n\nif __name__ == \"__main__\":\n main()\n", "n,k=[int(x) for x in input().split()]\r\narr=[]\r\ni=j=1\r\ntarget=240-k \r\ncount=0 \r\nk=0 \r\nwhile k<n :\r\n x=5*i \r\n if x>target:\r\n break \r\n count+=1 \r\n j+=1 \r\n i+=j \r\n arr.append(x)\r\n k+=1 \r\nprint(count)", "n,k = list(map(int,input().split()))\r\ntime = 240 - k\r\nc = 0\r\nfor i in range(1,n+1):\r\n if time - i*5 >= 0:\r\n time -= i*5\r\n c += 1\r\n else:\r\n break\r\nprint(c)\r\n\r\n", "# Read input values\r\nn, k = map(int, input().split())\r\n\r\n# Initialize variables\r\ntotal_time = 0\r\nproblems_solved = 0\r\n\r\n# Iterate through the problems\r\nfor i in range(1, n+1):\r\n # Calculate time required to solve the i-th problem\r\n time_required = 5 * i\r\n \r\n # Check if Limak has enough time to solve the problem and get to the party\r\n if total_time + time_required + k <= 240:\r\n # Increment the number of problems solved and update total time\r\n problems_solved += 1\r\n total_time += time_required\r\n else:\r\n # If not enough time, break out of the loop\r\n break\r\n\r\n# Print the number of problems solved\r\nprint(problems_solved)\r\n", "n,k=map(int,input().split())\r\nx=240-k \r\ns=0\r\nc=0\r\nfor i in range(1,n+1):\r\n s+=5*i\r\n if s<=x:\r\n c+=1\r\nprint(c)", "x,y=[int(s) for s in input().split()]\r\nc=0\r\nm=0\r\nfor i in range(1,x+1):\r\n c+=i*5\r\n if c+y<=240:\r\n m+=1\r\nprint(m)", "n,k=map(int,input().split())\ntotal=4*60\ntotal-=k\nsum=0\nans=n\nfor i in range(1,n+1):\n sum+=5*i\n if(sum>total):\n ans=i-1\n break\n\nprint(ans)\n\t\t \t\t \t \t\t \t \t\t\t \t\t\t \t \t \t", "x = input()\r\nx = x.split(\" \")\r\nn = int(x[0])\r\nk = int(x[1])\r\ntotal = 4*60\r\nf = total - k\r\nc = 0\r\ni = 1\r\nwhile i<=n:\r\n f-=5*i\r\n if f<0:\r\n break\r\n i+=1\r\n c+=1\r\nprint(c)", "n,k = map(int,input().split())\r\nbib =60*4-k\r\nans=0\r\nfor i in range(1,n+1,1):\r\n if bib-i*5>=0:\r\n bib-=i*5\r\n ans+=1\r\nprint(ans)", "from math import floor, sqrt\n\ndef solution():\n n, k = map(int, input().split(' '))\n time = 4 * 60 - k\n \n ans = floor((sqrt(1 + 8 / 5 * time) - 1 )/ 2)\n \n return floor(ans) if ans < n else n\n\n\nprint(solution())\n", "raw = input()\n\ndelim = raw.split()\n\nn = int(delim[0])\n\nk = int(delim[1])\n\nminutes = 240 - k\n\npossible = 0\n\nfor i in range(1,n+1):\n\n if 5*i <= minutes:\n\n possible += 1\n\n minutes -= 5*i\n \n else:\n\n break\n\nprint(possible)\n", "a = input().split(\" \")\r\nn = int(a[0])\r\ntime = 240 - int(a[1])\r\nfor i in range(1,n+1):\r\n if time >= 5*i:\r\n time -= 5*i\r\n i += 1\r\n elif time < 5*i:\r\n break\r\nprint(i-1)", "n, k = map(int, input().split(\" \"))\r\nptime = 240 - k\r\ncount = 0\r\n\r\nfor i in range(1, n+1):\r\n pt = i*5\r\n if ptime - pt >= 0:\r\n ptime -= pt\r\n count += 1\r\n elif ptime - pt < 0:\r\n break\r\nprint(count)", "firstline = [int(n) for n in input().split()]\r\nNOP = firstline[0]\r\nTime = firstline[1]\r\n\r\nremainder_time = 240 - Time\r\n\r\ncounter = 0\r\ntime , all_time = 0, 0\r\n\r\nfor i in range(1, NOP+1):\r\n time = i*5\r\n if time+all_time <= remainder_time:\r\n all_time+=time\r\n counter+=1\r\nprint(counter)", "p, m = map(int, input().strip().split()); count, org = 0, 4*60\r\nfor i in range(1, p+1):\r\n dn = 5*i\r\n if (org - dn) < m:\r\n break\r\n else:\r\n count += 1\r\n org -= dn\r\nprint (count)", "n,k=list(map(int,input().split(' ')))\r\nx=240-k\r\nret=int((2*x/5+1/4)**.5-1/2)\r\nret=n if ret>n else ret\r\nprint(ret)", "n,k=input().split()\r\nn=int(n);k=int(k)\r\ncontest_period= 4*60\r\nminutes_used=0\r\nproblems=0\r\nsm=0\r\nfor i in range(1,n+1):\r\n minutes_used+=(i*5)\r\n sm=k + minutes_used\r\n if(sm <= contest_period):\r\n problems+=1\r\n else:\r\n break\r\nprint(problems)\r\n ", "a, b = map(int, input().split())\r\nmuxs = 240 - b\r\nsum1 = 0\r\nf = False\r\nfor i in range(1, a + 1):\r\n if muxs - (5 * i) == 0:\r\n sum1 += 1\r\n break\r\n elif muxs - (5 * i) < 0:\r\n print(sum1)\r\n f = True\r\n break\r\n else:\r\n muxs -= 5 * i\r\n sum1 += 1\r\nif f is False:\r\n print(sum1)", "n, k = map(int, input().split())\r\n\r\ncurr = 240 - k\r\n\r\nans = 0\r\n\r\nfor i in range(1, n + 1):\r\n if curr - 5 * i >= 0:\r\n ans += 1\r\n curr -= 5 * i\r\n\r\nprint(ans)\r\n", "a,b=map(int,input().split())\r\nc=4*60\r\nc=c-b\r\nans=0\r\nfor i in range(a+1):\r\n c=c-i*5\r\n if(c<0):\r\n ans=i-1\r\n break\r\n elif(c==0):\r\n ans=i\r\n break\r\nif(c>0):\r\n ans=a\r\nprint(ans)", "n,time=map(int,input().split())\r\ncount=0\r\nk=0\r\ni=1\r\nwhile k+time<240 and i<=n:\r\n k+=i*5\r\n if k+time<=240:\r\n count+=1\r\n i+=1\r\nprint(count)\r\n \r\n", "n,t = map(int, input().split(' '))\r\n\r\ntotal_time = 0\r\n\r\nh_time = 240-t\r\n\r\n\r\nresult = 0\r\n\r\n\r\nfor i in range(n+1):\r\n n_time = 5\r\n n_time*=i\r\n total_time+=n_time\r\n if total_time>h_time:\r\n pass\r\n else:\r\n result = i\r\n\r\n\r\nprint(result)\r\n\r\n", "n, k = input().split()\r\nn = int(n)\r\nk = int(k)\r\ntime = 60 * 4 - k\r\ncount = 0\r\nmath = 0\r\nfor i in range(1,n+1):\r\n math += 5*i\r\n if math <= time:\r\n count += 1\r\nprint(count)", "count , min = list(map(int,input().split()))\r\ntime = 240 - min\r\ni = 1\r\nwhile time >= 0 :\r\n time -= i * 5\r\n i += 1\r\nprint(count if i - 1 > count else i - 2)", "n,k=map(int,input().split())\r\na=240-k; i=0\r\nwhile a>=0 and i<n+1: i+=1; a-=5*i\r\nprint(i-1)\r\n", "a , b = list(map(int , input().split()))\r\nc = 240 - b\r\nn = 0\r\nwhile n <= a:\r\n if c < 5 * n * (n + 1) / 2:\r\n break\r\n n += 1\r\nn -= 1\r\nprint(n)", "n,k = input().split()\nb = 240 - int(k)\ni = 0\ncount = 0\nwhile i <= b:\n count+=1\n i += 5*count\nif count-1 > int(n):\n print(int(n))\nelse:\n print(count-1)", "t1, t2 = map(int, input().split())\r\ntt, c, i = 240 - t2, 0, 1\r\n# print(tt)\r\nwhile(tt >= 0 and i <= t1):\r\n if(tt >= 5 * i):\r\n tt = tt - 5 * i\r\n # print(i, tt)\r\n i+=1\r\n c+= 1\r\n else:\r\n break\r\nprint(c)", "n,t=[int(x) for x in input().split()]\r\nfirst=20*60\r\nlast=(24*60)-t\r\nc=0\r\nfor i in range(1,n+1):\r\n tot=5*i \r\n if first+tot<=last:\r\n c+=1\r\n first+=tot\r\nprint(c)\r\n \r\n\r\n \r\n", "n, k = map(int, input().split())\r\nt=0\r\nc=0\r\nfor i in range(1,n+1):\r\n t+=i*5\r\n if t+k>240:\r\n break\r\n c+=1\r\nprint(c)", "n,k=map(int,input().split())\r\nactual_time=240-k\r\ncounter=0\r\nfor i in range(1,n+1):\r\n if 5*i<=actual_time:\r\n counter+=1\r\n actual_time-=5*i\r\nprint(counter)\r\n\r\n\r\n", "m,n = map(int,input().split())\r\ntime = 480+n\r\nres = 0\r\ni = 1\r\nwhile i<=m:\r\n if time+5*i<=720:\r\n time+=5*i \r\n i+=1\r\n res +=1\r\n else:\r\n break\r\nprint(res)", "x,y=list(map(int,input().split()))\r\nsum=[]\r\ncount=0\r\ns=0\r\nfor i in range(1,x+1):\r\n sum.append(5*i) \r\nfor i in range(len(sum)):\r\n s+=sum[i]\r\n if(s<=240-y):\r\n count+=1\r\n\r\nprint(count)", "n, k = map(int, input().split())\r\n\r\nminutes = 4 * 60\r\n\r\nspend = 0\r\nfor i in range(1, n + 1):\r\n spend += i * 5\r\n #print(spend)\r\n if spend + k > minutes:\r\n print(i-1)\r\n quit()\r\n\r\nprint(n)\r\n", "def i():\r\n return(int(input()))\r\ndef l():\r\n return(list(map(int,input().split())))\r\ndef s():\r\n s = input()\r\n return(s)\r\ndef sl():\r\n s = input()\r\n return(list(s[:len(s) - 1]))\r\ndef m():\r\n return(map(int,input().split()))\r\n\r\nn, k = m()\r\nt = 0\r\nc = 0\r\n\r\nfor i in range(n):\r\n t += (i + 1) * 5\r\n if t + k <= 240:\r\n c += 1\r\nprint(c)\r\n", "nk = input().split()\r\nn,k = int(nk[0]), int(nk[1])\r\nsumm = 0\r\nfor i in range(1,n+1):\r\n p = 5*i\r\n summ += p\r\nl = 240 - k\r\n\r\ncount = 0\r\nif summ>l:\r\n\r\n while (i<=n and i>0 and summ>l):\r\n summ -= 5*i\r\n i -= 1\r\n count += 1\r\n print(n-count)\r\nelse:\r\n print(n)\r\n \r\n\r\n", "a,b=map(int,input().split())\r\nd=0\r\nfor i in range(1,a+1):\r\n\tb+=(5*i)\r\n\tif b<=240:\r\n\t\td+=1\r\nprint(d)", "a = input()\r\nc = 0\r\nfor count in range(0, int(len(a)), 1):\r\n if a[count] == \" \":\r\n p = int(a[:count])\r\n k = int(a[count + 1:])\r\n break\r\ntotal = k\r\nfor count in range(1, p + 1, 1):\r\n if total >= 240:\r\n break\r\n else:\r\n c += 1\r\n total += count * 5 \r\nif total > 240:\r\n c -= 1\r\nprint(c)\r\n \r\n ", "n,k=map(int,input().split())\r\nrest=240-k\r\ni=1\r\nj=0\r\nwhile i<=n:\r\n j+=i*5\r\n if j>rest:\r\n break\r\n i+=1\r\nprint(i-1)\r\n", "n,k =[int(x) for x in input().split()]\r\nc = 0\r\nd = 0\r\nfor i in range(1,n+2):\r\n c += 5*i\r\n d = d+1\r\n if c+k>240:\r\n break\r\n\r\nprint(d-1)\r\n\r\n ", "n, k = map(int, input().split())\r\n\r\ntotal_time = 0\r\nproblem_solved = 0\r\nremaining_time = 240 - k\r\n\r\nfor i in range(1, n + 1):\r\n total_time += 5 * i\r\n if total_time <= remaining_time:\r\n problem_solved += 1\r\n\r\nprint(problem_solved)\r\n", "n , k = map(int , input().split())\r\nif 1<=n<=10 and 1<=k<=240:\r\n lst = [5*i for i in range(n+1)]\r\n timeleft = 240-k\r\n timetaken = 0\r\n for i in range(len(lst)):\r\n timetaken += lst[i]\r\n if timetaken > timeleft:\r\n print(i-1)\r\n break\r\n \r\n if i == len(lst)-1:\r\n print(i)\r\n", "n, k = map(int, input().split())\r\n\r\nx = 240 - k\r\nr, y = 0, 5\r\n\r\nwhile n > 0 and x >= y:\r\n n -= 1\r\n r += 1\r\n y += 5 * (r + 1)\r\n\r\nprint(r)", "n=input().split(\" \")\r\nt=240-int(n[-1])\r\ni=1\r\nb=0\r\nwhile b<=t:\r\n\tb+=5*i\r\n\ti=i+1\r\nprint(min(i-2,int(n[0])))", "a = [int(i) for i in input().split()]\r\nquestions, time_to_house = a\r\ntime_to_solve = 240 - time_to_house\r\nresult = 0\r\nfor i in range(questions, 0, -1):\r\n if 5 * i * (i + 1) / 2 <= time_to_solve:\r\n result = i\r\n break\r\nprint(result)\r\n", "#750A\r\nn=list(map((int),input().split()))\r\nif (n[0]**2+n[0])*5/2+n[1]<=240:\r\n print(n[0])\r\nelse:\r\n sum=n[1]\r\n for i in range(1,n[0]+1):\r\n if sum+5*i>240:\r\n print(i-1)\r\n break\r\n else:\r\n sum+=5*i", "num_questions, time_available = map(int, input().split())\r\ntime_left = 240 - time_available\r\nresult = 0\r\n\r\nfor question_time in range(1, num_questions + 1):\r\n time_left -= question_time * 5\r\n if time_left < 0:\r\n break\r\n result = question_time\r\n\r\nprint(result)\r\n", "def solve_problems(n, k):\r\n total_time = 240 - k # Total time available to solve problems\r\n\r\n problems_solved = 0\r\n time_needed = 0\r\n\r\n for i in range(1, n + 1):\r\n time_needed += 5 * i # Time needed to solve the i-th problem\r\n\r\n # Check if Limak has enough time to solve the current problem\r\n if time_needed <= total_time:\r\n problems_solved += 1\r\n else:\r\n break\r\n\r\n return problems_solved\r\n\r\n# Read input\r\nn, k = map(int, input().split())\r\n\r\n# Print the result\r\nprint(solve_problems(n, k))\r\n", "def main() -> None:\n (n, travel_time) = tuple(map(int, input().split(None)))\n print(complete_tasks(n, travel_time))\n\n\ndef complete_tasks(n: int, travel_time: int) -> int:\n tr: int = (240 - travel_time) // 5\n l: int = 0\n r: int = n\n ans: int = 0\n while l <= r:\n m: int = (l + r) // 2\n if m * (m + 1) // 2 <= tr:\n l = m + 1\n ans = max(ans, m)\n else:\n r = m - 1\n return ans\n\n\nif __name__ == \"__main__\":\n main()\n", "n,k=map(int,(input().split()))\r\ncount=0\r\ntime=240-k\r\nfor i in range(1,n+1):\r\n ptime=(5*i)\r\n if time>=ptime:\r\n #count+=1\r\n time=time-ptime\r\n count+=1\r\nprint(count)", "n, k = map(int, input().split())\r\n\r\nproblems_solved = 0\r\ntime_left = 240 - k\r\ntime_taken = [5 * (idx + 1) for idx in range(n)]\r\n\r\ntime = 0\r\nwhile problems_solved < n:\r\n\ttime = time + time_taken[problems_solved]\r\n\tif time > time_left:\r\n\t\tbreak\r\n\telse:\r\n\t\tproblems_solved += 1\r\n\r\nprint(problems_solved)", "n, k = map(int, input().split(\" \"))\r\nresult = 240 - k\r\ncount = 0\r\nfor i in range(1,n+1): \r\n if result-5*i >= 0:\r\n result-=5*i\r\n count += 1\r\n else :\r\n break\r\nprint(count)", "# https://codeforces.com/problemset/problem/750/A\r\n\r\ndef main():\r\n n, k = map(int, input().split(' '))\r\n total = 4 * 60 - k\r\n for i in range(1, n + 1):\r\n if total >= i * 5:\r\n total -= i * 5\r\n else:\r\n print(i - 1)\r\n return\r\n print(n)\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "n, k = map(int, input().split())\r\n\r\nres = 0\r\n\r\nwhile k + (res + 1) * 5 <= 240:\r\n res += 1\r\n k += res * 5\r\n\r\nprint(min(n, res))\r\n", "n,k=[int(i) for i in input().split()]\r\ntot=0\r\nc=0\r\nfor i in range(1,n+1):\r\n tot += i*5\r\n if tot+k > 240:\r\n break\r\n elif tot+k==240:\r\n c+=1\r\n break\r\n elif tot+k < 240:\r\n c+=1\r\n \r\nprint(c)", "n,k=map(int,input().split())\r\nbaki=240-k\r\nkorbe=0\r\nkoita=0\r\nif (1<=n<=10 and 1<=k<=240):\r\n for i in range(1,n+1):\r\n korbe+=(5*i)\r\n if baki>=korbe:\r\n koita+=1\r\nprint(koita)\r\n", "n, k = [int(x) for x in input().split()]\r\na = 0\r\nfor i in range(1, n+1):\r\n if i*5+k<=240:\r\n k+=i*5\r\n a+=1\r\nprint(a)", "problems, minutes = input().split()\n\nproblems = int(problems)\nminutes = int(minutes)\n\nproblems = [5 * (i+1) for i in range(problems)]\nable_to_solve = 0\n\nspare_time = 240 - minutes\n\nfor problem in problems:\n if problem > spare_time:\n break\n spare_time -= problem\n able_to_solve += 1\n\nprint(able_to_solve)\n \t \t\t \t\t\t \t\t\t \t\t \t\t\t\t \t\t", "# n = 7\r\n# k = 1\r\n# time = 240\r\n# c = 0\r\n# c2 = 0\r\n\r\n# for i in range(n):\r\n# c += 5*i\r\n# c2 += 1\r\n# if c + k >= time:\r\n# break\r\n# print(c2)\r\n\r\nn, k = map(int, input().split())\r\n\r\nx=240-k\r\ncount=0\r\ny=1\r\n\r\nwhile x>=y*5 and y<=n:\r\n count+=1\r\n x=x-y*5\r\n y+=1\r\n \r\nprint(count)", "n, timeInRoad = map(int, input().split())\ntimeAvailable = 4 * 60 - timeInRoad\ncount = 0\n\n\nwhile timeAvailable > 0 and (timeAvailable - 5*(count+1)) >= 0 and count < n:\n timeAvailable -= 5 * (count + 1)\n count += 1\n \nprint(count)\n \t \t \t\t \t\t\t\t \t\t \t\t\t \t \t\t \t", "def Mission(n,k):\r\n\tk = 240-k\r\n\tsum = int()\r\n\tdem = int()\r\n\tfor i in range(1,n+1):\r\n\t\tsum += 5*i\r\n\t\tdem += 1\r\n\t\tif sum > k:\r\n\t\t\tdem -= 1\r\n\t\t\tbreak\r\n\treturn dem\r\narr = input().split(' ')\r\nprint(Mission(int(arr[0]),int(arr[1])))", "problems, minutes = map(int,input().split())\r\nminutes = 240 - minutes\r\nsum ,x=0,0\r\nfor i in range(1,problems+1):\r\n sum += i * 5\r\n if sum >minutes:\r\n break\r\n x+=1\r\nprint(x) ", "n,k=list(map(int,input().strip().split()))\r\nt=240-k\r\nc=0\r\nfor i in range(1,n+1):\r\n if t-i*5>=0:\r\n t-=i*5\r\n c+=1\r\nprint(c)", "s,n=map(int,input().split())\r\nsum=0\r\nc=0\r\nfor i in range(1,s+1):\r\n sum=sum+(5*i)\r\n c+=1\r\n if sum>(240-n):\r\n c=i-1\r\n break\r\nprint(c)", "n,k=map(int,input().split())\r\nans=0\r\ntime=k\r\nfor i in range(1,n+1):\r\n if time+(i*5)<=240:\r\n ans+=1\r\n time+=(i*5)\r\n elif time+(i*5)>240:\r\n break\r\nprint(ans)", "n, k = list(map(int, input().split()))\r\ntasks = [5 * i for i in range(1, n + 1)]\r\nacum = 0\r\nt = 0\r\nfor i in range(n):\r\n t = i + 1\r\n acum += tasks[i]\r\n if acum + k >= 240:\r\n if acum + k > 240:\r\n t -= 1\r\n break\r\n\r\nprint(t)", "n,k=map(int,input().split())\r\nk=240-k\r\nsum1=0\r\ncount=0\r\nflag=False\r\nfor i in range (1,n+1):\r\n if sum1+(5*i)>k:\r\n print(count)\r\n flag=True\r\n break\r\n else:\r\n sum1+=(5*i)\r\n count+=1\r\nif not flag:\r\n print(count)", "total_no_of_problems, time_needed_to_go_to_party = map(int, input().split())\r\navailable_time_for_contest = 240 - time_needed_to_go_to_party\r\nsolved_problems = 0\r\n\r\nfor i in range(1, total_no_of_problems + 1):\r\n current_problem_time = 5 * i\r\n if available_time_for_contest >= current_problem_time:\r\n available_time_for_contest -= current_problem_time\r\n solved_problems += 1\r\n else:\r\n break # Stop solving, goto party\r\n\r\nprint(solved_problems) \r\n", "n, k = map(int, input().split())\r\n\r\ntotal_time = 0\r\ni = 1\r\n\r\nwhile i <= n:\r\n total_time += i * 5 # Time to solve the i-th problem\r\n if total_time > 240 - k: # Check if it's possible to get to the party\r\n break\r\n i += 1\r\n\r\n# Since i is 1-based, subtract 1 to get the maximum number of problems solved\r\nprint(i - 1)\r\n", "a,b = map(int,input().split())\r\nc = 240 - b\r\ncount = 0\r\nans = 0\r\nwhile True:\r\n count+=5*(ans+1)\r\n if count > c or ans == a:\r\n break\r\n ans+=1\r\nprint(ans)\r\n", "\r\nn, k = map(int,input().split())\r\nsum0 = 240 - k\r\ni = 1\r\nwhile sum0 >= 0 and i <= n:\r\n sum0 -= (5*i)\r\n\r\n if sum0>= 0:\r\n i += 1\r\nprint(i-1)", "n, k = map(int, input().split())\r\n\r\ncount = 0\r\nt = 0\r\nfor i in range(1, n + 1):\r\n t += 5 * i\r\n if t > 240 - k:\r\n break\r\n count = i\r\n\r\nprint(count)", "n , k = map(int, input().split())\r\n\r\nr = 240 - k\r\ncount = 0\r\nt = 0\r\n\r\nfor i in range(1, n+1):\r\n t += i * 5\r\n \r\n if t <= r:\r\n count +=1\r\n\r\nprint(count)", "def bin_search(l, r, total_time, k):\r\n while (l <= r):\r\n m = (l + r) // 2\r\n time = 5 * (m * (m + 1) / 2) + k\r\n if time <= total_time:\r\n l = m + 1\r\n else:\r\n r = m - 1\r\n if r > 0:\r\n return r\r\n else:\r\n return 0\r\n\r\n\r\nn, k = map(int, input().split())\r\ntotal_time = 240\r\nprint(min(bin_search(0, 10, 240, k), n))\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "n, k = map(int, input().split())\r\n\r\ntime_left = 240 - k # calculate the remaining time after Limak gets to the party\r\nproblems_solved = 0\r\n\r\n# iterate through the problems, starting from the easiest\r\nfor i in range(1, n+1):\r\n time_needed = i * 5 # calculate the time needed to solve the current problem\r\n if time_needed <= time_left: # check if there's enough time left to solve the problem\r\n problems_solved += 1\r\n time_left -= time_needed\r\n else: # if there's not enough time left, stop iterating\r\n break\r\n\r\nprint(problems_solved)\r\n", "n, time = map(int, input().split())\r\nc, left = 0, 240-time\r\nfor i in range(1, n+1):\r\n if left - i*5 >= 0:\r\n c += 1\r\n left -= i*5\r\nprint(c)\r\n", "a,b=map(int,input().split())\r\nt=4*60-b\r\nx=a\r\nfor i in range(1,a+1):\r\n t-=(5*i)\r\n if t<0:\r\n x=i-1\r\n break\r\nprint(x)", "n, k = map(int, (input().split()))\r\nm=240-k\r\nans=0\r\nfor i in range(1, n+1):\r\n if m-i*5>=0:\r\n ans+=1\r\n m-=i*5\r\n else:\r\n break\r\nprint(ans)", "p, h = map(int, input().split())\r\ntime = 240\r\ncount = 0\r\ntime_got = time - h\r\nfor i in range(1, p+1):\r\n need = i*5\r\n if time_got - need >= 0:\r\n time_got -= need\r\n count += 1\r\nprint(count)\r\n", "n, k = map(int, input().split())\r\nt = 240 - k\r\ni = 1\r\nwhile t - (i * 5) >= 0 and i <= n:\r\n t -= i * 5\r\n i += 1\r\nprint(i-1)\n# Sat Mar 25 2023 10:33:21 GMT+0300 (Moscow Standard Time)\n", "a=input().split()\r\nk=int(a[0])\r\nl=int(a[1])\r\na1=240-l\r\nc=0\r\nd=0\r\nfor i in range(1,k+1):\r\n if c+5*i>a1:\r\n break\r\n else:\r\n c=c+5*i\r\n d=d+1\r\nprint(d)\r\n\r\n \r\n", "import sys\r\n#taking input\r\nlst = [x for x in sys.stdin.readline().split(' ')]\r\n#logic code\r\nproblems = int(lst[0])\r\n# print(problems)\r\nsum = 0\r\ncount = 0\r\npartyTime = (12-8)*60\r\ntimeNeeded = int(lst[1])\r\nfor i in range(1, problems + 1):\r\n if 5*i > (partyTime - (sum + timeNeeded)):\r\n break\r\n sum = sum + (5*i)\r\n count = count + 1\r\n\r\n# print(sum)\r\nprint(count)\r\n\r\n", "s = [int(i) for i in input().split()]\r\nn = s[0]\r\nk = s[1]\r\nm = 240 - k\r\ntime = 0\r\ncount = 0\r\nfor i in range(1, n + 1):\r\n if 5 * i <= m:\r\n count += 1\r\n m -= 5 * i\r\nprint(count)", "x=input().split()\r\na=int(x[0])\r\nb=int(x[1])\r\ntotal=b\r\nc=0\r\nl=[]\r\nfor i in range(1,a+1):\r\n total+=(5*i)\r\n l.append(total)\r\nfor i in l:\r\n if i<=240:\r\n c+=1\r\n\r\nprint(c)", "n, k = map(int, input().split())\n\nrtime = 240 - k \nsolved_problems = 0\nttime = 0\n\nfor i in range(1, n+1):\n problem_time = 5 * i\n ttime += problem_time\n\n if ttime > rtime:\n break\n\n solved_problems += 1\n\nprint(solved_problems)\n\t\t\t \t \t\t\t \t\t \t \t \t \t", "n, k = list(map(int, input().split()))\r\ntime = 240 - k\r\ntime_solve = [i*5 for i in range (1 ,n+1)]\r\nfor i in range (1, len(time_solve)):\r\n time_solve[i] += time_solve[i-1]\r\ni = 0\r\nwhile (i<len(time_solve) and time_solve[i]<=time):\r\n i+=1\r\nprint(i)", "n,k=map(int,input().split())\r\n\r\nrem_min=240-k\r\ncount=0\r\n\r\nif rem_min>0:\r\n \r\n for i in range(1,n+1):\r\n if (rem_min-(i*5))>=0:\r\n rem_min -=(i*5)\r\n count +=1\r\n \r\n print(count)\r\nelse:\r\n print(count)", "\r\nm, l = map(int, input().split())\r\n\r\ntime_left = 240 - l\r\nproblems_solved = 0\r\n\r\nfor i in range(1, m + 1):\r\n time_required = 5 * i \r\n if time_required <= time_left:\r\n problems_solved += 1\r\n time_left -= time_required\r\n else:\r\n break\r\n\r\nprint(problems_solved)\r\n", "import math\r\n\r\nn, k = map(int, input().split())\r\ntime = (240 - k) // 5\r\nx = int((-1+math.sqrt(8*time+1))//2)\r\nif x > n:\r\n x = n\r\n\r\nprint(x)\r\n", "n, k = map(int, input().split())\r\nres = 0\r\nwhile 5 * (2 + res) * (res + 1) // 2 <= 240 - k and res < n:\r\n res += 1\r\nprint(res)", "n,k=map(int,input().split())\r\nc=0\r\ntotal=k\r\nt=5\r\nfor i in range(1,n+1):\r\n \r\n total+=t\r\n if total>240:\r\n break\r\n t=t+5\r\n c=c+1\r\n \r\nprint(c)", "n,t=map(int,input().split())\r\nt=240-t\r\nc=0\r\nfor i in range(1,n+1):\r\n if t-i*5<0:\r\n break\r\n else:\r\n t-=i*5\r\n c+=1\r\nprint(c)\r\n", "n,k = map(int,input().split())\nt= 240 - k\n\ncount = 0\nfor i in range(1,n+1):\n if t<=0 :\n break\n else:\n if t-(i*5)>=0:\n t-=i*5\n count+=1\n\nprint(count)\n\n \t\t\t\t\t\t\t \t\t\t\t \t\t \t \t\t \t", "problems, time_needed = map(int, input().split())\r\nproblems_solved = 0\r\ntime_for_problems = 0\r\n\r\nfor i in range(1, problems + 1):\r\n time_for_problems += (5 * i)\r\n if time_for_problems <= (240 - time_needed):\r\n problems_solved += 1\r\n else:\r\n break\r\n \r\nprint(problems_solved)", "# Read the input values\r\nn, k = map(int, input().split())\r\n\r\n# Calculate the maximum number of problems Limak can solve\r\ntime_left = 240 - k # Time left before midnight\r\nproblems_solved = 0 # Number of problems Limak can solve\r\n\r\nfor i in range(1, n + 1):\r\n time_required = 5 * i\r\n if time_left >= time_required:\r\n time_left -= time_required\r\n problems_solved += 1\r\n else:\r\n break\r\n\r\n# Print the result\r\nprint(problems_solved)\r\n", "n, k=map(int,input().split())\r\ntoplam=0\r\nanswer=0\r\nfor i in range(1,n+1):\r\n if toplam +i*5>240-k:\r\n break\r\n answer+=1\r\n toplam+=i*5\r\nprint(answer)", "import sys\r\na,b= map(int,sys.stdin.readline().split())\r\nl = 240 - b\r\n\r\nc = 0\r\nfor i in range(1,a+1):\r\n if l<=0 :\r\n break\r\n else:\r\n if l-(i*5)>=0:\r\n l-=i*5\r\n c+=1\r\nprint(c)\r\n", "n,t = map(int,input().split())\r\nt = 240-t\r\ns,c = 0,0\r\nfor i in range(1,n+1):\r\n s += 5*i\r\n if s > t:\r\n break\r\n c += 1\r\nprint(c)\r\n ", "r,t=map(int,input().split())\r\nt=240-t\r\ng=0\r\nfor i in range(1,r+1):\r\n g=g+5*i\r\n if g>t:\r\n print(i-1)\r\n break\r\nelse:print(i) ", "n = list(map(int, input().split()))\n\nt = 0\nk = 0\n\nfor i in range(n[0]):\n if 5*(i+1) + k + n[1] <= 240:\n t += 1\n k += 5*(i+1)\n else:\n break\n\nprint(t)\n\n", "from math import sqrt\r\nn, k = map(int, input().split())\r\nk = 240 - k\r\nk = (-1 + sqrt(1 + 8 * k / 5)) / 2;\r\nprint(min(n, int(k)))", "n, k = map(int, input().split())\r\nans = 0\r\nsumma = 5\r\ntask = 2\r\nwhile summa <= 240 - k and ans < n:\r\n summa += task * 5\r\n task += 1\r\n ans += 1\r\nprint(ans)", "def numberOfProblems():\r\n try:\r\n s = str(input())\r\n lst = [int(x) for x in s.split(' ')]\r\n except:\r\n return \"Error!\"\r\n else:\r\n timeForSolving = int(0)\r\n i = int(0)\r\n\r\n while timeForSolving <= 240 - lst[1]:\r\n if i > lst[0]:\r\n break\r\n i += 1\r\n timeForSolving += i * 5;\r\n\r\n return i - 1\r\n finally:\r\n pass\r\n\r\nif __name__ == \"__main__\":\r\n print(numberOfProblems())" ]

[ "n = int(input())\na = n * n\nb = a // 2\nc = a - b\nif b == c:\n b //= 2\n c = b + 1\n b -= 1\nif (b > 0) and (c > 0):\n print(int(b), int(c))\nelse:\n print(-1)\n\n\t \t \t \t\t\t \t\t\t \t\t\t\t \t\t", "import math\r\n\r\ndef find_pythagorean_triple1(n):\r\n if n <= 2:\r\n return -1\r\n \r\n a = 0\r\n b = 0\r\n c = n\r\n m = int(math.sqrt(n))\r\n for i in range(1, m):\r\n if n % i == 0:\r\n j = n // i\r\n if (i + j) % 2 == 0:\r\n a = ((i + j) // 2)**2 - ((j - i) // 2)**2\r\n b = ((i + j) // 2)**2 + ((j - i) // 2)**2\r\n if a > 0 and b > 0 and a < n and b < n and a + b > c:\r\n return (a, b)\r\n return -1\r\n\r\ndef find_pythagorean_triple(n):\r\n if n <= 2:\r\n return -1\r\n \r\n if n % 2 == 0:\r\n m = n // 2\r\n a = m**2 - 1\r\n b = m**2 + 1\r\n return (a, b) if n**2 + a**2 == b**2 else -1\r\n else:\r\n m = (n + 1) // 2\r\n a = 2 * m * (m - 1)\r\n b = a + 1\r\n return (a, b) if n**2 + a**2 == b**2 else -1\r\nn = int(input())\r\nresult = find_pythagorean_triple1(n)\r\nif(result==-1):result = find_pythagorean_triple(n)\r\nif result == -1:\r\n print(\"-1\")\r\nelse:\r\n print(result[0], result[1])\r\n", "a = int(input())\r\nif a<3: ans = [-1]\r\nelif(a%2): ans = [a**2//2,a**2//2+1]\r\nelse: ans = [a**2//4-1,a**2//4+1]\r\nprint(*ans)", "n = int(input())\r\nif n == 1 or n == 2:\r\n print(-1)\r\nelse:\r\n if n % 2 == 1:\r\n print((n**2 - 1) // 2, (n**2 - 1) // 2 + 1)\r\n else:\r\n print((n//2)**2-1, (n//2)**2+1)\r\n", "import math\r\n\r\nn = int(input())\r\n\r\nfor i in range(1, int(math.log2(n * n))):\r\n first = ((n * n) // (1 << i)) - 1 + ((n * n) % (1 << i) > 0);\r\n second = ((n * n) // (1 << i)) + 1;\r\n \r\n if (first * first + second * second == n * n or first * first + n * n == second * second or second * second + n * n == first * first):\r\n print(str(first) + ' ' + str(second))\r\n exit(0)\r\n \r\nprint(-1)", "a = int(input())\n\nif a & 1:\n b = (a*a+1)//2\n c = (a*a)//2\nelse:\n b = (a//2)**2+1\n c = (a//2)**2-1\nA = [b, c, a]\nA.sort()\nif A[0]**2 + A[1]**2 == A[2]**2 and A[0] > 0 and A[1] > 0 and A[2] > 0:\n print(b, c)\nelse:\n print(-1)", "n = int(input())\r\nk = n * n\r\nfor m in range(1, int(k ** 0.5) + 1):\r\n if(k % m == 0):\r\n a = k // m + m\r\n b = k // m - m\r\n if(a % 2 == 0 and b % 2 == 0 and b > 0):\r\n print(a // 2, b // 2)\r\n exit()\r\nprint(-1)", "n = int(input())\r\nif n < 3:\r\n print(\"-1\")\r\nelif n % 2:\r\n a = n*n \r\n b = 1 \r\n c = (a+b)//2\r\n d = (a-b)//2\r\n print( c , d )\r\nelse:\r\n a = n*n\r\n a //=2\r\n b = 2 \r\n c = (a+b)//2\r\n d = (a-b)//2\r\n print(c,d)", "a = int(input())\nif a<=2:\n\tprint (-1)\nelif a%2:\n\tprint (a*a//2,a*a//2+1)\nelse:\n\tprint (a*a//4-1, a*a//4+1)\n\t\t\t \t \t \t\t\t\t \t", "a = int(input())\r\nif a==1 or a==2:\r\n print(-1)\r\nelif a%2==1:\r\n print(a*a//2,a*a//2+1)\r\nelse:\r\n print(a*a//4-1,a*a//4+1)", "from sys import stdin,stdout\r\n# from bisect import bisect_left,bisect\r\n# from heapq import heapify,heappop,heappush\r\n# from sys import setrecursionlimit\r\n# from collections import defaultdict,Counter\r\n# from itertools import permutations\r\n# from math import gcd,ceil,sqrt,factorial\r\n# setrecursionlimit(int(1e5))\r\ninput,print = stdin.readline,stdout.write\r\n\r\nn = int(input())\r\nif n<3:\r\n print(\"-1\\n\")\r\nelif n%2==0:\r\n print(str(pow(n,2)//4-1)+\" \"+str(pow(n,2)//4+1)+\"\\n\")\r\nelse:\r\n print(str((pow(n,2)-1)//2)+\" \"+str((pow(n,2)+1)//2)+\"\\n\")\r\n", "from os import path\r\nfrom sys import stdin, stdout\r\n\r\n\r\nfilename = \"../templates/input.txt\"\r\nif path.exists(filename):\r\n stdin = open(filename, 'r')\r\n\r\n\r\ndef input():\r\n return stdin.readline().rstrip()\r\n\r\n\r\ndef print(*args, sep=' ', end='\\n'):\r\n stdout.write(sep.join(map(str, args)))\r\n stdout.write(end)\r\n\r\n\r\ndef solution():\r\n def calculate(n: int, m: int) -> (int, int, int):\r\n return m ** 2 - n ** 2, 2 * m * n, m ** 2 + n ** 2\r\n\r\n x = int(input())\r\n if x <= 2:\r\n print(-1)\r\n return\r\n if x % 2 == 0:\r\n print(*(y for y in calculate(1, x // 2) if y != x))\r\n else:\r\n print(*(y for y in calculate((x + 1) // 2 - 1, (x + 1) // 2) if y != x))\r\n\r\n\r\ndef main():\r\n t = 1\r\n while t:\r\n solution()\r\n t -= 1\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "from sys import stdin,stdout\r\ninput = stdin.readline\r\n# from math import inf\r\n# from collections import Counter\r\n# from heapq import heapify,heappop,heappush\r\n# from time import time\r\n# from bisect import bisect, bisect_left\r\n \r\n \r\nn = int(input())\r\nn = int(pow(n,2))\r\nif n%2 :\r\n c = (1+n)//2\r\n if int(c) != 1:\r\n print(int(c),int(c)-1)\r\n else:\r\n print(-1)\r\nelse:\r\n if 1 + (n//4)-2 != 0:\r\n print(1 + (n//4),1 + (n//4)-2)\r\n else:\r\n print(-1)", "from sys import stdin ,stdout \r\ninput=stdin.readline\r\ndef print(*args, end='\\n', sep=' ') -> None:\r\n stdout.write(sep.join(map(str, args)) + end)\r\n\r\n\r\nn=int(input()) ; ans=-1 ; l=1 ; r=10**18\r\nif n%2==1 and n!=1:\r\n while l<=r:\r\n mid=(r+l)//2\r\n if mid%2==0:\r\n if n**2+mid**2==(mid+1)**2:\r\n print(mid,mid+1)\r\n break\r\n elif n**2+mid**2<(mid+1)**2:\r\n r=mid-1\r\n else:\r\n l=mid+1\r\n else:\r\n if mid**2==(mid-1)**2+n**2:\r\n print(mid-1,mid)\r\n break\r\n elif mid**2>(mid-1)**2+n**2:\r\n r=mid-1\r\n else:\r\n l=mid+1\r\n else:\r\n print(-1)\r\nelif n%2==0:\r\n while l<=r:\r\n mid=(r+l)//2\r\n if n**2+mid**2==(mid+2)**2:\r\n print(mid,mid+2)\r\n break\r\n elif n**2+mid**2<(mid+2)**2:\r\n r=mid-1\r\n else:\r\n l=mid+1\r\n \r\n else:\r\n print(-1)\r\n\r\nelse:\r\n print(ans)\r\n", "import sys\ninput = lambda: sys.stdin.readline().rstrip()\nfrom collections import deque,defaultdict,Counter\nfrom bisect import *\nfrom heapq import *\nfrom math import ceil,gcd\nN = int(input())\n\nif N%2==1:\n if N**2<3:exit(print(-1))\n print(N**2//2,N**2//2+1)\nelse:\n if N**2<8:exit(print(-1))\n print(N**2//4-1,N**2//4+1)", "def solve(n):\r\n if n <= 2:\r\n return \"-1\"\r\n\r\n if n % 2 == 0:\r\n a = n * n // 4 - 1\r\n b = a + 2\r\n else:\r\n a = n * n // 2\r\n b = a + 1\r\n\r\n return f\"{a} {b}\"\r\n\r\nif __name__ == \"__main__\":\r\n n = int(input())\r\n result = solve(n)\r\n print(result)", "import sys\r\n\r\ninput = lambda: sys.stdin.readline().rstrip()\r\n\r\n\r\ndef solution(n):\r\n if n in [1, 2]:\r\n return -1\r\n\r\n if n % 2 == 1:\r\n return \" \".join(map(str, [(n ** 2) // 2, (n ** 2) // 2 + 1]))\r\n else:\r\n if (n // 2) % 2 == 1:\r\n return \" \".join(map(str, [((n ** 2) // 8) * 2, ((n ** 2) // 8 + 1) * 2]))\r\n else:\r\n return \" \".join(map(str, [3 * (n // 4), 5 * (n // 4)]))\r\n\r\n\r\nn = int(input())\r\nprint(solution(n))\r\n", "import sys\r\ninput = lambda: sys.stdin.readline().strip()\r\nn=int(input())\r\nif n<3: print(-1)\r\nelif n%2==0: print(((n//2)**2)-1,((n//2)**2)+1)\r\nelif (n%3==0) or (n%4==0) or (n%5==0):\r\n if n%3==0: print((n//3)*4,(n//3)*5)\r\n elif n%4==0: print((n//4)*3,(n//4)*5)\r\n else: print((n//5)*3,(n//5)*4)\r\nelse: print(((n**2)-1)//2,(((n**2)-1)//2)+1)", "import sys\r\nimport math\r\n# Fast input\r\ninput = sys.stdin.readline\r\n# Fast output\r\ndef print(*args, **kwargs):\r\n sep = kwargs.get('sep', ' ')\r\n end = kwargs.get('end', '\\n')\r\n file = kwargs.get('file', sys.stdout)\r\n flush = kwargs.get('flush', False)\r\n output = sep.join(map(str, args)) + end\r\n file.write(output)\r\n if flush:\r\n file.flush()\r\n\r\ndef listin():\r\n n=int(input())\r\n l=list(map(int,input().split()))\r\n return n,l\r\ndef two():\r\n n,m=map(int,input().split())\r\n return n,m\r\ndef three():\r\n n,m,p=map(int,input().split())\r\n return n,m,p\r\nn=int(input())\r\nif n==1 or n==2:\r\n print(-1)\r\nelse:\r\n if n%2:\r\n print((n**2-1)//2,(n**2+1)//2)\r\n else:\r\n print((n//2)**2-1,(n//2)**2+1)", "def solve():\r\n n = int(input())\r\n\r\n if n <= 2:\r\n print(-1)\r\n return\r\n \r\n if n % 2 == 1:\r\n m = n * n // 2\r\n k = m + 1\r\n elif n % 4 == 2:\r\n n = n // 2\r\n m = n * n // 2\r\n k = m + 1\r\n m *= 2\r\n k *= 2\r\n else:\r\n q = n // 4\r\n m = 3 * q\r\n k = 5 * q\r\n print(m, k)\r\n\r\nsolve()\r\n", "n = int(input()) \r\nif n < 3:print(-1)\r\nelse: \r\n if n&1:print(n**2//2, n**2//2+1)\r\n else:print(n**2//4-1, n**2//4+1)", "n = int(input())\r\na = n**2\r\nif n&1:\r\n k,m = a//2,a//2+1\r\nelse:\r\n b = a//2\r\n k,m = b//2-1,b//2+1\r\narr1 = [n,k,m]\r\narr1.sort()\r\nif arr1[0]>0:\r\n if arr1[0]**2+arr1[1]**2 == arr1[2]**2:\r\n print(k,m)\r\n else:\r\n print(-1)\r\nelse:\r\n print(-1)", "\r\n\r\nn = int(input())\r\nif n == 1 or n == 2:\r\n print(-1)\r\nelif n % 2 == 1:\r\n a = n\r\n b = (a * a - 1) // 2\r\n c = (a * a + 1) // 2\r\n print(b, c)\r\nelse:\r\n n //= 2\r\n print(n * n - 1, n * n + 1)\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\nx = n * n\r\nif x % 2:\r\n a = (x+1)//2\r\n b = a-1\r\nelse:\r\n a = (x+4)//4\r\n b = a-2\r\nif n in [2, 1]:\r\n print(-1)\r\n exit(0)\r\nprint(b, a)", "n = int(input())\r\nif n % 2 == 0:\r\n x = (n // 2) ** 2\r\n n1 = x - 1\r\n n2 = x + 1\r\nelse:\r\n x = (n ** 2) // 2\r\n n1 = x\r\n n2 = x + 1\r\n\r\nif n1 != n != n2 and n1 > 0 and n2 > 0:\r\n print(n1, n2)\r\nelse:\r\n print(-1)\r\n", "n = int(input())\r\nn2 = n**2\r\nif n2%2:\r\n a = (n2 - 1)//2\r\n b = a + 1\r\nelse:\r\n a = n2//4 - 1\r\n b = a + 2\r\n\r\nif not a or not b:\r\n print(-1)\r\nelse:\r\n print(a, b)", "n = int(input())\r\nif n < 3:\r\n print(-1)\r\nelif n % 2 == 1:\r\n k = 1\r\n a = (n**2//k - k)//2\r\n b = (n**2//k + k)//2\r\n print(a, b)\r\nelse:\r\n k = 2\r\n a = (n ** 2 // k - k) // 2\r\n b = (n ** 2 // k + k) // 2\r\n print(a, b)\r\n", "a=int(input())\r\nif a==1 or a==2 :\r\n print(-1)\r\nelse:\r\n if a % 2 == 1:\r\n b = (a*a-1)//2\r\n c = b+1\r\n print(b, c)\r\n else:\r\n b = (a*a)//4-1\r\n c = b+2\r\n print(b, c)\r\n ", "n=int(input())\r\nif n<=2: print(-1)\r\nelif n%2: print((1+n**2)//2-1,(1+n**2)//2)\r\nelse: print(n**2//4-1,n**2//4+1)", "n = int(input())\r\n\r\nif n<3:\r\n print (-1)\r\n\r\nelif n*n%4:\r\n print(n*n//2, (n*n//2)+1)\r\n\r\nelse:\r\n print((n*n//4)-1, (n*n//4)+1)", "n = int(input())\r\nfrom decimal import Decimal\r\nif n % 2 != 0:\r\n second = int(Decimal(n ** 2) / Decimal(2) + Decimal(0.5))\r\n third = int(Decimal(n ** 2) / Decimal(2) - Decimal(0.5))\r\nelse:\r\n second = int(Decimal(n / 2) ** 2 - Decimal(1))\r\n third = int(Decimal(n / 2) ** 2 + Decimal(1))\r\n\r\nif n == 0 or second == 0 or third == 0:\r\n print(-1)\r\nelif (n ** 2 + second ** 2) == third ** 2 or (n ** 2 + third ** 2) == second ** 2 or (third ** 2 + second ** 2) == n ** 2:\r\n print(second, third)\r\nelse:\r\n print(-1)", "from sys import stdin,stdout\r\ninput = stdin.readline\r\nfrom math import comb,pow\r\nn = int(input())\r\nk = n**2\r\nif n%2 == 0:\r\n a = k//4 - 1\r\n b = a + 2\r\n if a != 0 and b!= 0:\r\n print(int(a),int(b))\r\n else:\r\n print(-1)\r\nelse:\r\n a = k//2\r\n b = a + 1\r\n if a!=0 and b!=0:\r\n print(int(a),int(b))\r\n else:\r\n print(-1)\r\n\r\n", "\r\n\r\n\r\n\r\nx=int(input())\r\nif x==1 or x==2:\r\n print(-1)\r\nelse:\r\n if x%2==0:\r\n m,n=(x//2)*(x//2)+1,(x//2)*(x//2)-1\r\n print(m,n)\r\n else:\r\n u=(x-1)//2\r\n m=2*u*u+2*u+1\r\n n=m-1\r\n print(n,m)\r\n ", "n = int(input())\r\nif n%2 :\r\n if n == 1 :\r\n print(-1)\r\n exit()\r\n x = (n*n+1)//2\r\n y = (n*n-1)//2\r\n if x*x == y*y + n*n :\r\n print(y,x)\r\nelse :\r\n if n == 2 :\r\n print(-1)\r\n exit()\r\n x = (n//2)**2 - 1\r\n y = (n//2)**2 + 1\r\n if y*y == x*x + n*n :\r\n print(x,y)", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\nn = int(input())\r\nif n <= 2:\r\n ans = -1\r\n print(ans)\r\n exit()\r\nelif n % 2:\r\n x, y = n // 2, (n + 1) // 2\r\n m, k = 2 * x * y, x * x + y * y\r\nelse:\r\n x, y = n // 2, 1\r\n m, k = x * x - y * y, x * x + y * y\r\nprint(m, k)" ]

[ "\r\n\r\nn=int(input())\r\n\r\nl=list(map(int, input().split()))\r\n\r\ndpl=[[0,0,0] for _ in range(n)]\r\ndpr=[[0,0,0] for _ in range(n)]\r\n\r\ndpl[0][l[0]]=1 \r\ndpl[0][0]=1 \r\n\r\nfor i in range(1,n):\r\n if l[i]==1:\r\n dpl[i][1]=dpl[i-1][1]+1 \r\n dpl[i][2]=dpl[i-1][2]\r\n dpl[i][0]=max(dpl[i-1][0], dpl[i][1],dpl[i][2])\r\n else:\r\n dpl[i][2]=dpl[i-1][2]+1\r\n dpl[i][1]=dpl[i-1][1]\r\n dpl[i][0]=max(dpl[i-1][0]+1,dpl[i][1], dpl[i][2])\r\n \r\ndpr[-1][l[-1]]=1 \r\ndpr[-1][0]=1 \r\n\r\nfor i in range(n-2,-1,-1):\r\n if l[i]==2:\r\n dpr[i][2]=dpr[i+1][2]+1 \r\n dpr[i][1]=dpr[i+1][1]\r\n dpr[i][0]=max(dpr[i+1][0], dpr[i][1],dpr[i][2])\r\n else:\r\n dpr[i][1]=dpr[i+1][1]+1\r\n dpr[i][2]=dpr[i+1][2]\r\n dpr[i][0]=max(dpr[i+1][0]+1,dpr[i][1], dpr[i][2])\r\n\r\ndpl.append([0,0,0])\r\ndpr.append([0,0,0])\r\nans=0 \r\nfor i in range(n):\r\n a=0 \r\n b=0 \r\n c=0 \r\n for j in range(i,n):\r\n if l[j]==1:\r\n a+=1 \r\n c=max(b,c+1,a)\r\n else:\r\n b+=1 \r\n c=max(c,b,a)\r\n \r\n ans=max(ans, dpl[i-1][1]+a+dpr[j+1][0], dpl[i-1][0]+b+dpr[j+1][2], dpl[i-1][2]+b+dpr[j+1][2], dpl[i-1][1]+c+dpr[j+1][2])\r\n # if i==2 and j==6:\r\n # print(ans,a,b,c, dpl[i-1][1]+a+dpr[j+1][0], dpl[i-1][0]+b+dpr[j+1][2], dpl[i-1][2]+b+dpr[j+1][2])\r\n\r\nprint(ans)\r\n \r\n \r\n \r\n ", "def solve():\r\n n=int(input())\r\n arr=list(map(int,input().split()))\r\n ones = 0\r\n ones2s = 0\r\n ones2s1s = 0\r\n ones2s1s2s = 0\r\n for value in arr:\r\n if value==1:\r\n ones+=1\r\n ones2s1s = max(ones2s1s+1,ones2s+1)\r\n if value==2:\r\n ones2s = max(ones2s+1,ones+1)\r\n ones2s1s2s = max(ones2s1s+1,ones2s1s2s+1)\r\n print (max(max(ones,ones2s),max(ones2s1s2s,ones2s1s)))\r\n\r\ntry:\r\n solve()\r\nexcept Exception as e:\r\n print (e)", "def main():\r\n n = int(input())\r\n a = [int(x) for x in input().split()]\r\n r = [0, 0, 0, 0]\r\n\r\n for i in a:\r\n if i == 1:\r\n r[0] += 1\r\n r[1] = max(r[1], r[0])\r\n r[2] += 1\r\n r[3] = max(r[3], r[2])\r\n else: # i == 2\r\n r[1] += 1\r\n r[2] = max(r[2], r[1])\r\n r[3] += 1\r\n print(r[-1])\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n = int(input())\r\n*A, = map(int, input().split())\r\n\r\nseq = []\r\ncur = 1; cnt = 0\r\nfor a in A:\r\n if cur == a:\r\n cnt += 1\r\n else:\r\n seq.append(cnt)\r\n cur = a; cnt = 1\r\nif cnt > 0:\r\n seq.append(cnt)\r\nans = max(seq)\r\n\r\nl = len(seq)\r\ndp = [[0]*4 for i in range(l+1)]\r\nfor i in range(l):\r\n one = i % 2 #12\r\n s = seq[i]\r\n for j in range(4):\r\n dp[i+1][j] = max(dp[i+1][j], dp[i][j])\r\n if not one: # 2\r\n if j % 2 == 0:\r\n dp[i+1][j] = max(dp[i+1][j], dp[i][j] + s)\r\n else:\r\n if j == 1:\r\n dp[i+1][j+1] = max(dp[i+1][j+1], dp[i][j] + s)\r\n else: # 1\r\n if j % 2 == 1:\r\n dp[i+1][j] = max(dp[i+1][j], dp[i][j] + s)\r\n else:\r\n dp[i+1][j+1] = max(dp[i+1][j+1], dp[i][j] + s)\r\n# print(dp[i+1])\r\nprint(max(dp[l]))\r\n\r\n\r\n\r\n", "\r\ndef func():\r\n\r\n dp = [0] * 4\r\n # ans = 0\r\n\r\n for i in range(n):\r\n if a[i] == 1:\r\n dp[0] = dp[0] + 1\r\n dp[2] = max(dp[1], dp[2]) + 1\r\n else:\r\n dp[1] = max(dp[0], dp[1]) + 1\r\n dp[3] = max(dp[2], dp[3]) + 1\r\n print(max(dp))\r\n\r\n\r\n\r\nif __name__ == '__main__':\r\n n = int(input())\r\n a = [int(i) for i in input().split(' ')]\r\n\r\n # n = 4\r\n # a = [int(i) for i in '1 2 1 2'.split(' ')]\r\n # n = 10\r\n # a = [int(i) for i in '1 1 2 2 2 1 1 2 2 1'.split(' ')]\r\n\r\n func()\r\n", "input()\r\na = list(map(int, input().split()))\r\n\r\np1,p2,p3,p4=0,0,0,0\r\n\r\nfor n in a:\r\n if n == 1:\r\n p1 += 1\r\n p3 = max(p3 + 1, p2 + 1)\r\n else:\r\n p2 = max(p2 + 1, p1 + 1)\r\n p4 = max(p4 + 1, p3 + 1)\r\nprint(max(p1,p2,p3,p4))", "n=int(input())\r\na=list(map(int,input().split()))\r\nt1,t2,t3,t4=0,0,0,0\r\nfor i in range(len(a)):\r\n if a[i]==1:\r\n t1+=1\r\n t3=max(t3+1,t2+1)\r\n else:\r\n t2=max(t2+1,t1+1)\r\n t4=max(t4+1,t3+1)\r\nprint(max(t1,t2,t3,t4))\r\n\r\n\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())\n\na,ab,aba,abab=0,0,0,0\n\nb=[int(x) for x in input().split()]\n\nfor x in b:\n\n if x==1:\n\n a+=1\n\n aba+=1\n\n else:\n\n ab+=1\n\n abab+=1\n\n ab=max(a,ab)\n\n aba=max(aba,ab)\n\n abab=max(abab,aba)\n\nprint(abab)\n\n\n\n\n\n# Made By Mostafa_Khaled", "R = lambda: map(int, input().split())\r\nn = int(input())\r\ndp = [0] * 5\r\nfor x in R():\r\n if x == 1:\r\n dp[1], dp[3] = dp[1] + 1, max(dp[3], dp[2]) + 1\r\n else:\r\n dp[2], dp[4] = max(dp[1], dp[2]) + 1, max(dp[3], dp[4]) + 1\r\nprint(max(dp))", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\n\r\n# <=> longest 111...222...111...222\r\n# 分成四部分\r\n# 找到前四部分最长的即可 dp[i]表示第i部分最长的\r\n\r\ndp = [0] * 5\r\n## 滚动dp\r\nfor aa in a:\r\n if aa == 1:\r\n dp[1] += 1\r\n dp[2] = max(dp[1], dp[2])\r\n dp[3] = max(dp[2], dp[3] + 1)\r\n dp[4] = max(dp[3], dp[4])\r\n else:\r\n dp[2] = max(dp[1], dp[2] + 1)\r\n dp[3] = max(dp[2], dp[3])\r\n dp[4] = max(dp[3], dp[4] + 1)\r\n\r\nprint(dp[4])\r\n", "#fek mikoni aslan lozoomi dare kasi tu in donya dustet dashtet bashe ?!\r\n#age are chera tanhayi ?!!\r\n#age na chera namordi ?!!!\r\nDP = [0] * 4\r\ninput()\r\nfor x in map(int, input().split()):\r\n if x == 1 :\r\n DP[0] += 1\r\n DP[2] += 1\r\n else :\r\n DP[1] += 1\r\n DP[3] += 1\r\n for j in range ( 1 , 4 ) :\r\n DP[j] = max ( DP[j] , DP[j-1] )\r\nprint (DP[3]) ", "def func():\r\n n = int(input())\r\n a = [int(i) for i in input().split(' ')]\r\n\r\n # n = 4\r\n # a = [int(i) for i in '1 2 1 2'.split(' ')]\r\n # n = 10\r\n # a = [int(i) for i in '1 1 2 2 2 1 1 2 2 1'.split(' ')]\r\n\r\n\r\n dp = [[0] * 2 for _ in range(n)]\r\n ans = 0\r\n\r\n for i in range(n):\r\n if a[i] == 1:\r\n x, y = 1, 0 # 对于a[i] == 1, x, y 分别表示以a[i]结尾的最长全1子序长度和 形如11122211 的最长子序\r\n for j in range(i):\r\n if a[j] == 1:\r\n x = max(dp[j][0] + 1, x)\r\n y = max(dp[j][1] + 1, y)\r\n else:\r\n y = max(dp[j][0] + 1, y)\r\n dp[i][0], dp[i][1] = x, y\r\n else:\r\n x, y = 1, 0\r\n for j in range(i):\r\n if a[j] == 1:\r\n x = max(dp[j][0] + 1, x)\r\n y = max(dp[j][1] + 1, y)\r\n else:\r\n x = max(dp[j][0] + 1, x)\r\n y = max(dp[j][1] + 1, y)\r\n dp[i][0], dp[i][1] = x, y\r\n ans = max(ans, dp[i][0], dp[i][1])\r\n # print(dp)\r\n print(ans)\r\n\r\n\r\nif __name__ == '__main__':\r\n func()\r\n", "'''\r\nhttps://codeforces.com/problemset/problem/933/A\r\n\r\n数组 只有1，和2组成\r\n反转一段区间，找到最长递增子序列长度\r\n'''\r\nn=int(input())\r\nl=[int(i) for i in input().split()]\r\nf=[0]*4\r\nfor i in l:\r\n if i==1:\r\n f[0]+=1\r\n f[1]=max(f[0],f[1])\r\n f[2]=max(f[2]+1,f[2])\r\n f[3]=max(f[3],f[2])\r\n else:\r\n f[1]=max(f[1]+1,f[0])\r\n f[2]=max(f[2],f[1])\r\n f[3]=max(f[3]+1,f[2])\r\nprint(f[3])", "n = int(input())\r\na = list(map(int, input().split()))\r\ndp = [0] * 4\r\nfor j in range(n):\r\n\tdp = [dp[i] if i == 0 else max(dp[i], dp[i - 1]) for i in range(4)]\r\n\tdp = [dp[i] + (1 if i % 2 == a[j] - 1 else 0) for i in range(4)]\r\nprint(max(dp))", "N = 2007\r\nn = int(input().strip())\r\na = list(map(int, input().strip().split()))\r\ndp = [[0] * 5 for i in range(N)]\r\nfor i in range(n):\r\n if a[i] == 1:\r\n dp[i][1] = 1\r\n else:\r\n dp[i][2] = 1\r\nfor i in range(n):\r\n for j in range(i):\r\n if a[i] == 1:\r\n dp[i][1] = max(dp[i][1], dp[j][0] + 1)\r\n dp[i][1] = max(dp[i][1], dp[j][1] + 1)\r\n dp[i][2] = max(dp[i][2], dp[j][2])\r\n dp[i][3] = max(dp[i][3], dp[j][2] + 1)\r\n dp[i][3] = max(dp[i][3], dp[j][3] + 1)\r\n dp[i][4] = max(dp[i][4], dp[j][4])\r\n else:\r\n dp[i][1] = max(dp[i][1], dp[j][1])\r\n dp[i][2] = max(dp[i][2], dp[j][1] + 1)\r\n dp[i][2] = max(dp[i][2], dp[j][2] + 1)\r\n dp[i][3] = max(dp[i][3], dp[j][3])\r\n dp[i][4] = max(dp[i][4], dp[j][3] + 1)\r\n dp[i][4] = max(dp[i][4], dp[j][4] + 1)\r\nres = 0\r\nfor i in range(n):\r\n for j in range(1, 5):\r\n res = max(res, dp[i][j])\r\nprint(res)", "def process(A):\r\n n = len(A)\r\n ones = []\r\n one_count = 0\r\n two_count = 0\r\n for i in range(n):\r\n if A[i]==1:\r\n one_count+=1\r\n else:\r\n two_count+=1\r\n ones.append(one_count)\r\n answer = max(one_count, two_count)\r\n for i in range(n):\r\n one2 = ones[i]\r\n two2 = two_count-(i+1-one2)\r\n answer = max(answer, one2+two2)\r\n for l in range(n):\r\n if l==0:\r\n one1 = 0\r\n else:\r\n one1 = ones[l-1]\r\n dp = {l-1: 0}\r\n for r in range(l, n):\r\n my_ones = ones[r]-one1\r\n my_twos = (r-l+1-my_ones)\r\n if A[r]==1:\r\n dp[r] = max(my_twos+1, dp[r-1]+1)\r\n else:\r\n dp[r] = max(my_twos, dp[r-1])\r\n remaining_twos = two_count-(r+1-ones[r])\r\n answer = max(answer, one1+dp[r]+remaining_twos)\r\n return answer\r\n \r\nn = int(input())\r\nA = [int(x) for x in input().split()]\r\nprint(process(A))", "import sys\r\ndef solv(v):\r\n r = []\r\n nr1 = 0\r\n l = 0\r\n for i in v:\r\n mx = l\r\n if i == 1:\r\n nr1 += 1\r\n else:\r\n mx = l + 1\r\n if nr1 > mx:\r\n mx = nr1\r\n r.append(mx)\r\n l = mx\r\n return r\r\nf = sys.stdin\r\nn = int(f.readline())\r\na = [int(number) for number in f.readline().split()]\r\nb = [((x - 1) ^ 1) + 1 for x in a]\r\nb.reverse()\r\nra = solv(a)\r\nrb = solv(b)\r\nmx = max(ra[n - 1], rb[n - 1])\r\nfor i in range(1, n):\r\n mx = max(mx, ra[i - 1] + rb[n - i - 1])\r\nprint(mx)\r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\nd=[0]*(4)\r\nfor i in range(n):\r\n if a[i]==1:\r\n d[0]+=1\r\n d[2]=max(d[1],d[2])+1\r\n else:\r\n d[1]=max(d[0],d[1])+1\r\n d[3]=max(d[2],d[3])+1\r\nprint(max(d))", "import sys\r\ninput = sys.stdin.readline\r\nn = int(input())\r\na = input()[:-1].split()\r\ndp = [0] * (n + 1)\r\nres, t = dp[n - 1], ['1', '2', '1', '2']\r\nfor i in range(4):\r\n ndp = dp[:]\r\n for j in range(n):\r\n ndp[j + 1] = max(dp[j], ndp[j])\r\n if a[j] == t[i]:\r\n ndp[j + 1] += 1\r\n dp = ndp\r\n res = max(res, dp[n])\r\nprint(res)", "import sys\r\n\r\n\r\ndef solver(n, nums):\r\n dp = [0 for _ in range(5)]\r\n for i in range(n):\r\n if nums[i]==1:\r\n dp[1] += 1\r\n dp[2] = max(dp[1], dp[2])\r\n dp[3] = max(dp[2], dp[3]+1)\r\n dp[4] = max(dp[3], dp[4])\r\n else:\r\n dp[2] = max(dp[1], dp[2]+1)\r\n dp[3] = max(dp[2], dp[3])\r\n dp[4] = max(dp[3], dp[4]+1)\r\n # print(dp)\r\n return dp[4]\r\n\r\n\r\nif __name__=='__main__':\r\n n = int(sys.stdin.readline().strip('\\n').split()[0])\r\n nums = sys.stdin.readline().strip('\\n').split()\r\n nums = list(map(int, nums))\r\n print(solver(n, nums))", "#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(4)] for i in range(n)]\r\n p1=[0]*(n+1)\r\n p2=[0]*(n+1)\r\n for i in range(n):\r\n p1[i+1]+=p1[i]\r\n p2[i+1]+=p2[i]\r\n if l[i]==1:\r\n p1[i+1]+=1\r\n else:\r\n p2[i+1]+=1\r\n if l[0]==1: \r\n dp[0][0]=1\r\n else:\r\n dp[0][1]=1\r\n for i in range(1,n):\r\n for j in range(i-1,-1,-1):\r\n if l[i]==1:\r\n dp[i][0]=p1[i+1]\r\n dp[i][1]=max(dp[j][1],dp[i][1])\r\n if dp[j][1]!=0:\r\n dp[i][2]=max(dp[j][1]+1,dp[j][2]+1,dp[i][2])\r\n else:\r\n dp[i][2]=max(dp[j][2]+1,dp[i][2])\r\n dp[i][3]=max(dp[j][2],dp[i][3])\r\n else:\r\n dp[i][0]=max(dp[j][0],dp[i][0])\r\n if dp[j][0]!=0:\r\n dp[i][1]=max(dp[j][1]+1,dp[j][0]+1,dp[i][1])\r\n else:\r\n dp[i][1]=max(dp[j][1]+1,dp[i][1])\r\n dp[i][2]=dp[j][2]\r\n if dp[j][2]!=0:\r\n dp[i][3]=max(dp[j][3]+1,dp[j][2]+1,dp[i][3])\r\n else:\r\n dp[i][3]=max(dp[j][3]+1,dp[i][3])\r\n maxi=0\r\n for i in range(n):\r\n for j in range(4):\r\n maxi=max(maxi,dp[i][j])\r\n print(maxi) ", "n = (int)(input())\r\na = (list)(map(int , input().split()))\r\n\r\ndp = [[0 for _ in range(6)] for __ in range(n + 1)]\r\n\r\nfor pos in range(n - 1 , -1 , -1) :\r\n for stage in range(3 , -1 , -1) :\r\n if stage == 0 or stage == 2 : dp[pos][stage] = max(dp[pos][stage + 1] , dp[pos + 1][stage] + 2 - a[pos])\r\n else : dp[pos][stage] = max(dp[pos][stage + 1] , dp[pos + 1][stage] + a[pos] - 1)\r\n\r\nprint(dp[0][0])", "import sys\r\nimport math\r\nfrom collections import defaultdict\r\nn=int(sys.stdin.readline())\r\narr=list(map(int,sys.stdin.readline().split()))\r\npre=[0]\r\ncnt1,cnt2=0,0\r\nlast1,last2=0,0\r\nfor i in range(n):\r\n if arr[i]==1:\r\n cnt1+=1\r\n #pre.append(cnt1)\r\n x=max(last1+1,0)\r\n pre.append(x)\r\n last1=x\r\n else:\r\n #cnt2+=1\r\n x=max(last1+1,last2+1)\r\n pre.append(x)\r\n last2=x\r\nsuf=[0 for _ in range(n+1)]\r\n#cnt1,cnt2=0,0\r\nlast1,last2=0,0\r\nfor i in range(n-1,-1,-1):\r\n if arr[i]==1:\r\n #cnt1+=1\r\n x=max(last1+1,last2+1)\r\n suf[i]=x\r\n last1=x\r\n else:\r\n #cnt2+=1\r\n x=last2+1\r\n suf[i]=x\r\n last2=x\r\nans=max(max(pre),max(suf))\r\n#print(pre,'pre')\r\n#print(suf,'suf')\r\n#print(ans,'ans')\r\nfor i in range(1,n+1):\r\n cnt1,cnt2=0,0\r\n last1,last2=0,0\r\n for j in range(i,n+1):\r\n if arr[j-1]==1:\r\n x=max(last1+1,last2+1)\r\n last1=x\r\n ans=max(pre[i-1]+x+suf[j],ans)\r\n else:\r\n x=last2+1\r\n last2=x\r\n ans=max(pre[i-1]+x+suf[j],ans)\r\nprint(ans)\r\n", "def solve(lst):\n a = b = c = d = 0\n for i in range(len(lst)):\n if lst[i] == 1:\n a += 1\n c = max(b, c) + 1\n else:\n b = max(a, b) + 1\n d = max(c, d) + 1\n return max(a, b, c, d)\n\nn = input()\nlst = list(map(int, input().split()))\nprint(solve(lst))\n", "def solve() -> None:\r\n n = int(input())\r\n arr = list(map(int, input().split()))\r\n \r\n dp = [0] * 5\r\n\r\n for x in arr:\r\n if x == 1:\r\n dp[1] += 1\r\n dp[2] = max(dp[1], dp[2])\r\n dp[3] = max(dp[2], dp[3]+1)\r\n dp[4] = max(dp[3], dp[4])\r\n else:\r\n dp[2] = max(dp[1], dp[2]+1)\r\n dp[3] = max(dp[2], dp[3])\r\n dp[4] = max(dp[3], dp[4]+1)\r\n\r\n print(dp[4])\r\n\r\n# t = int(input())\r\n# for _ in range(t):\r\nsolve()", "m = int(input())\ndef func(arr, m):\n dp = [0, 0, 0, 0]\n for i, n in enumerate(arr):\n if n == 1:\n dp[0] += 1\n dp[1] = max(dp[0], dp[1])\n dp[2] = max(dp[1], dp[2] + 1)\n dp[3] = max(dp[2], dp[3])\n else:\n dp[1] = max(dp[0], dp[1] + 1)\n dp[2] = max(dp[1], dp[2])\n dp[3] = max(dp[2], dp[3] + 1)\n print(dp[3])\nfunc([int(i) for i in input().split()], m)\n \n \n", "n = int(input())\r\na = list(map(int, input().split()))\r\nd = [0] * 4\r\nfor i in a:\r\n if i == 1:\r\n d[0] += 1\r\n d[2] = max(d[2]+1, d[1]+1)\r\n else:\r\n d[1] = max(d[1]+1, d[0]+1)\r\n d[3] = max(d[3]+1, d[2]+1)\r\nprint(max(d))\r\n", "import sys\r\n\r\n\r\ndef input():\r\n return sys.stdin.buffer.readline().rstrip()\r\n\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\nans = max(a.count(1), a.count(2))\r\n#mixed case\r\nprefix = [0]*(n + 10)\r\nsuffix = [0]*(n + 10)\r\nfor i in range(n):\r\n if a[i] == 1:\r\n prefix[i + 1] = 1\r\n\r\na.reverse()\r\nfor i in range(n):\r\n if a[i] == 2:\r\n suffix[i + 1] = 1\r\na.reverse()\r\n\r\nfor i in range(n):\r\n prefix[i + 1] += prefix[i]\r\n suffix[i + 1] += suffix[i]\r\n\r\nINF = 1 << 60\r\na.reverse()\r\nans = -INF\r\n\r\n\r\nfor l in range(n):\r\n max_case_1 = 0\r\n max_case_2 = 0\r\n for r in range(l, n):\r\n if a[r] == 1:\r\n max_case_1 += 1\r\n elif a[r] == 2:\r\n max_case_2 = max(max_case_2, max_case_1) + 1\r\n K = max(max_case_1, max_case_2)\r\n ans = max(ans, K + prefix[n - 1 - r] + suffix[l])\r\n\r\nprint(ans)\r\n\r\n", "a = [0] * 4\r\ninput()\r\nfor n in map(int, input().split()):\r\n if n == 1:\r\n a[0] += 1\r\n a[2] = max(a[1] + 1, a[2] + 1)\r\n else:\r\n a[1] = max(a[0] + 1, a[1] + 1)\r\n a[3] = max(a[2] + 1, a[3] + 1)\r\nprint(max(a))", "# -*- coding: utf-8 -*-\r\n# Watashi wa ARUGONEKO wo tsukatteru. [algoneko.github.io]\r\n# I hate python --RedCat\r\nfrom math import *\r\nimport re\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\nd1, d2, d3, d4 = [0]*n, [0]*n, [0]*n, [0]*n\r\nd1[0] = d3[0] = (1 if a[0] == 1 else 0)\r\nd2[0] = d4[0] = (1 if a[0] == 2 else 0)\r\nfor i in range(1,n):\r\n d1[i] = d1[i-1]\r\n d2[i] = d2[i-1]\r\n d3[i] = d3[i-1]\r\n d4[i] = d4[i-1]\r\n if a[i] == 1:\r\n # * -> 1\r\n # 2 -> 3\r\n d1[i] = d1[i - 1] + 1\r\n d3[i] = max(d3[i - 1], d2[i - 1]) + 1\r\n if a[i] == 2:\r\n # 1 -> 2\r\n # 3 -> 4\r\n d2[i] = max(d2[i - 1], d1[i - 1]) + 1\r\n d4[i] = max(d4[i - 1], d3[i - 1]) + 1\r\nprint(max(max(d1), max(d2), max(d3), max(d4)))", "I=input\r\nd=[0]*6\r\nI()\r\nfor x in I().split():\r\n for j in range(2, 6):\r\n d[j]=max(d[j-1],d[j]+int(j%2+1==int(x)))\r\nprint(d[5])", "n = int(input())\r\nA = list(map(int, input().split()))\r\none = [0]\r\ntwo = [0]\r\nfor i in A:\r\n one.append(one[-1])\r\n two.append(two[-1])\r\n if i == 1:\r\n one[-1] += 1\r\n else:\r\n two[-1] += 1\r\nrdp1 = [[1] * n for _ in range(n)]\r\nfor l in range(n):\r\n for r in range(l + 1, n):\r\n if A[r] == 2:\r\n rdp1[l][r] = rdp1[l][r - 1] + 1\r\n else:\r\n if rdp1[l][r - 1] == one[r] - one[l]:\r\n rdp1[l][r] = rdp1[l][r - 1] + 1\r\n else:\r\n rdp1[l][r] = rdp1[l][r - 1]\r\nrdp2 = [[1] * n for _ in range(n)]\r\nfor l in range(n):\r\n for r in range(l + 1, n):\r\n if A[r] == 1:\r\n rdp2[l][r] = rdp2[l][r - 1] + 1\r\n else:\r\n if rdp2[l][r - 1] == two[r] - two[l]:\r\n rdp2[l][r] = rdp2[l][r - 1] + 1\r\n else:\r\n rdp2[l][r] = rdp2[l][r - 1]\r\ndp = [0] * n\r\ndp[0] = 1\r\nfor i in range(1, n):\r\n if A[i] == 2:\r\n dp[i] = dp[i - 1] + 1\r\n else:\r\n if dp[i - 1] == one[i]:\r\n dp[i] = dp[i - 1] + 1\r\n else:\r\n dp[i] = dp[i - 1]\r\n dp[i] = max(dp[i], rdp2[0][i])\r\n for j in range(i):\r\n if rdp1[0][j] == one[j + 1]:\r\n dp[i] = max(dp[i], rdp1[0][j] + rdp2[j + 1][i])\r\n dp[i] = max(dp[i], rdp1[0][j] + two[i + 1] - two[j + 1])\r\nprint(dp[-1])\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\n\r\nd = [0 for _ in range(4)]\r\n\r\nfor val in a:\r\n if val == 1:\r\n d[0] += 1\r\n d[2] = max(d[2] + 1, d[1] + 1)\r\n else:\r\n d[1] = max(d[1] + 1, d[0] + 1)\r\n d[3] = max(d[3] + 1, d[2] + 1)\r\nprint(max(d))\r\n \r\n" ]

[ "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Sat May 7 11:48:38 2016\r\n\r\n@author: Alex\r\n\"\"\"\r\n\r\nimport heapq, sys\r\nq = []\r\ncnt = 0\r\nn = int(input())\r\nsex = input()\r\na = list(map(int, input().split()))\r\nl = [i-1 for i in range(n)] #生成左指针列表\r\nr = [i+1 for i in range(n)] #生成右指针列表\r\nfor i in range(n-1):\r\n\tif sex[i] != sex[i+1]:\r\n\t\theapq.heappush(q, (abs(a[i] - a[i+1]), i, i+1))\r\n\t\tcnt += 1\r\nans = []\r\nwhile cnt > 0:\r\n\tt, i, j = heapq.heappop(q)\r\n\tcnt -= 1\r\n\tif r[i] == -1 or r[j] == -1:\r\n\t\tcontinue\r\n\tans.append('%d %d' % (i+1, j+1))\r\n\tu, v = l[i], r[j]\r\n\tr[i] = r[j] = -1\r\n\tif u >= 0:\r\n\t\tr[u] = v\r\n\tif v < n:\r\n\t\tl[v] = u\r\n\tif u >= 0 and v < n and sex[u] != sex[v]:\r\n\t\theapq.heappush(q, (abs(a[u] - a[v]), u, v))\r\n\t\tcnt += 1\r\nsys.stdout.write(str(len(ans)) + '\\n' + '\\n'.join(ans) + '\\n')\\", "import heapq as hq\r\nn=int(input())\r\nl=input()\r\nA=[int(i) for i in input().split()]\r\nd=[]\r\nnxt=[i+1 for i in range(n-1)]\r\nfrt=[i for i in range(n-1)]\r\nnow=[True for i in range(n)]\r\nfor i in range(n-1):\r\n if l[i]!=l[i+1]:\r\n d+=[[abs(A[i]-A[i+1]),i,i+1]]\r\nhq.heapify(d)\r\nans=[]\r\nwhile d!=[]:\r\n a,b,c=hq.heappop(d)\r\n if (now[b] and now[c]) is not True:\r\n continue\r\n else:\r\n ans+=[str(b+1)+' '+str(c+1)]\r\n now[b],now[c]=False,False\r\n if b!=0 and c!=n-1:\r\n x,y=frt[b-1],nxt[c]\r\n if l[x]!=l[y]:\r\n hq.heappush(d,[abs(A[x]-A[y]),x,y])\r\n nxt[x],frt[y-1]=y,x\r\n \r\n \r\nprint(len(ans))\r\nprint('\\n'.join(ans))\r\n", "import heapq\nn=int(input())\ng=input()\na=[int(i) for i in input().split()]\nh=[]\nheapq.heapify(h)\nprev=[i-1 for i in range(0,n)]\nnext=[i+1 for i in range(0,n)]\nd=[0]*n;\nr=[]\nfor i in range(0,n-1):\n if(g[i]!=g[i+1]):\n heapq.heappush(h,(abs(a[i]-a[i+1]),i,i+1))\nwhile h :\n aa,ii,jj=heapq.heappop(h)\n if(d[ii]==0) and (d[jj]==0):\n r.append(str(ii+1)+' '+str(jj+1));\n d[ii]=1;\n d[jj]=1;\n pp=prev[ii];\n nn=next[jj];\n if(pp>=0) and (nn<n):\n next[pp]=nn;\n prev[nn]=pp;\n if g[nn]!=g[pp]:\n heapq.heappush(h,(abs(a[nn]-a[pp]),pp,nn))\nprint(len(r));\nprint('\\n'.join(r));\n \n \n \n", "import heapq,sys\nq=[]\nc=0\nn=int(input())\ns=input()\na=list(map(int,input().split()))\nl=[i-1 for i in range(n)]\nr=[i+1 for i in range(n)]\nfor i in range(n-1):\n\tif s[i]!=s[i+1]:\n\t\theapq.heappush(q,(abs(a[i]-a[i+1]),i,i+1))\n\t\tc+=1\nans=[]\nwhile c>0:\n\tt,i,j=heapq.heappop(q)\n\tc-=1\n\tif r[i]==-1 or r[j]==-1:\n\t\tcontinue\n\tans.append('%d %d'%(i+1,j+1))\n\tu,v=l[i],r[j]\n\tr[i]=r[j]=-1\n\tif u>=0: r[u]=v\n\tif v<n: l[v]=u\n\tif u>=0 and v<n and s[u]!=s[v]:\n\t\theapq.heappush(q,(abs(a[u]-a[v]),u,v))\n\t\tc+=1\nsys.stdout.write(str(len(ans))+'\\n'+'\\n'.join(ans)+'\\n')\n", "from heapq import heapify, heappop, heappush\r\nn=int(input())\r\ns=input()\r\na=list(map(int,input().split()))\r\np=[i-1 for i in range(n)]\r\nnx=[i+1 for i in range(n)]\r\nf=[1 for i in range(n)]\r\nd=[(abs(a[i]-a[i+1]),i,i+1) for i in range(n-1) if s[i]!=s[i+1]]\r\nheapify(d)\r\nans=[]\r\n\r\nwhile d:\r\n t,pp,pn=heappop(d)\r\n if (f[pp] and f[pn]):\r\n ans.append(''.join([str(pp+1), ' ', str(pn+1)]))\r\n f[pp],f[pn]=0,0\r\n if (pp==0) or (pn==n-1):\r\n continue\r\n ppp,npn=p[pp],nx[pn]\r\n nx[ppp],p[npn]=npn,ppp\r\n if (s[ppp]!=s[npn]):\r\n heappush(d,(abs(a[ppp]-a[npn]),ppp,npn))\r\nprint(len(ans))\r\nprint('\\n'.join(ans))\r\n", "from heapq import heappushpop, heapify,heappop,heappush\nn=int(input())\ndanced=[0]*(n+1)\ngender=[0]+list(input())\nskill=[0]+list(map(int,input().split()))\nnext=[0]+[i+1 for i in range(1,n)]+[0]\nprev=[0]+[i for i in range(n)]\nans=[]\nline=[]\ntotal=0\nfor i in range(1,n):\n x,y=i,i+1\n if gender[x]==gender[y]:continue\n else:\n line.append((abs(skill[x]-skill[y]),(x,y)))\nheapify(line)\nwhile len(line)>0:\n t0,temp=heappop(line)\n x,y=temp[0],temp[1]\n if danced[x]+danced[y]==0:\n ans.append(str(x)+' '+str(y))\n total+=1\n danced[x]=1\n danced[y]=1\n if x>1 and y<n:\n a=prev[x]\n b=next[y]\n prev[b]=a\n next[a]=b\n if gender[a]!=gender[b]:\n heappush(line,(abs(skill[a]-skill[b]),(a,b)))\nprint(total)\nprint('\\n'.join(ans))\n\n \t \t\t \t \t\t \t\t\t\t \t \t\t", "from heapq import heappush, heappop, heapify\r\n\r\ndef improve_arrangement(n, b, a):\r\n c = []\r\n d = [0] * n\r\n e = []\r\n ahead = [0] + [i for i in range(n)]\r\n after = [i + 1 for i in range(n)] + [0]\r\n num = 0\r\n\r\n for i in range(n - 1):\r\n x = i\r\n y = i + 1\r\n if b[x] != b[y]:\r\n c.append((abs(a[x] - a[y]), x, y))\r\n\r\n heapify(c)\r\n\r\n while c:\r\n skill, cp1, cp2 = heappop(c)\r\n if d[cp1] + d[cp2] == 0:\r\n d[cp1], d[cp2] = 1, 1\r\n e.append(str(cp1 + 1) + \" \" + str(cp2 + 1))\r\n num += 1\r\n if cp1 > 0 and cp2 < n - 1:\r\n x = ahead[cp1]\r\n y = after[cp2]\r\n ahead[y] = x\r\n after[x] = y\r\n if b[x] != b[y]:\r\n heappush(c, (abs(a[x] - a[y]), x, y))\r\n\r\n return num, e\r\n\r\nif __name__ == \"__main__\":\r\n n = int(input())\r\n b = list(input())\r\n a = [int(i) for i in input().split()]\r\n\r\n num, e = improve_arrangement(n, b, a)\r\n\r\n print(num)\r\n print('\\n'.join(e))\r\n", "import heapq as hq\r\nn=int(input())\r\ns=input()\r\na=list(map(int,input().split()))\r\npre=[i-1 for i in range(n)]\r\nnxt=[i+1 for i in range(n)]\r\nfree=[1 for i in range(n)]\r\nline=[(abs(a[i]-a[i+1]),i,i+1) for i in range(n-1) if s[i]!=s[i+1]]\r\nhq.heapify(line)\r\nans=[]\r\n\r\nwhile line:\r\n t,ppre,pnxt=hq.heappop(line)\r\n if free[ppre] and free[pnxt]:\r\n ans.append(str(ppre+1)+' '+str(pnxt+1))\r\n free[ppre],free[pnxt]=0,0\r\n if ppre==0 or pnxt==n-1:\r\n continue\r\n preppre,nxtpnxt=pre[ppre],nxt[pnxt]\r\n nxt[preppre],pre[nxtpnxt]=nxtpnxt,preppre\r\n if s[preppre]!=s[nxtpnxt]:\r\n hq.heappush(line,(abs(a[preppre]-a[nxtpnxt]),preppre,nxtpnxt))\r\nprint(len(ans))\r\nprint('\\n'.join(ans))", "import heapq,sys\r\nq=[]\r\nc=0\r\nn=int(input())\r\ns=input()\r\na=list(map(int,input().split()))\r\nl=[i-1 for i in range(n)]\r\nr=[i+1 for i in range(n)]\r\nfor i in range(n-1):\r\n\tif s[i]!=s[i+1]:\r\n\t\theapq.heappush(q,(abs(a[i]-a[i+1]),i,i+1))\r\n\t\tc+=1\r\nans=[]\r\nwhile c>0:\r\n\tt,i,j=heapq.heappop(q)\r\n\tc-=1\r\n\tif r[i]==-1 or r[j]==-1:\r\n\t\tcontinue\r\n\tans.append('%d %d'%(i+1,j+1))\r\n\tu,v=l[i],r[j]\r\n\tr[i]=r[j]=-1\r\n\tif u>=0: r[u]=v\r\n\tif v<n: l[v]=u\r\n\tif u>=0 and v<n and s[u]!=s[v]:\r\n\t\theapq.heappush(q,(abs(a[u]-a[v]),u,v))\r\n\t\tc+=1\r\nsys.stdout.write(str(len(ans))+'\\n'+'\\n'.join(ans)+'\\n')", "import sys\r\ninput = sys.stdin.readline\r\nfrom heapq import heappop,heappush\r\n\r\nn=int(input())\r\nS=input().strip()\r\nA=list(map(int,input().split()))\r\n\r\nLEFT=[i-1 for i in range(n)]\r\nRIGHT=[i+1 for i in range(n)]\r\n\r\nUSE=[0]*n\r\n\r\nH=[]\r\n\r\nfor i in range(n-1):\r\n if S[i]!=S[i+1]:\r\n heappush(H,(abs(A[i]-A[i+1]),i,i+1))\r\n\r\nANS=[]\r\nwhile H:\r\n x,ind,ind2=heappop(H)\r\n if USE[ind]==1 or USE[ind2]==1:\r\n continue\r\n ANS.append((ind+1,ind2+1))\r\n USE[ind]=1\r\n USE[ind2]=1\r\n\r\n r=RIGHT[ind2]\r\n l=LEFT[ind]\r\n\r\n if 0<=l<n and 0<=r<n and USE[l]==0 and USE[r]==0 and S[l]!=S[r]:\r\n heappush(H,(abs(A[l]-A[r]),l,r))\r\n\r\n if 0<=l<n:\r\n RIGHT[l]=r\r\n\r\n if 0<=r<n:\r\n LEFT[r]=l\r\n\r\nprint(len(ANS))\r\nfor x,y in ANS:\r\n print(x,y)\r\n" ]

[ "from collections import deque\r\n \r\nclass Dinic():\r\n def __init__(self, listEdge, s, t):\r\n self.s = s\r\n self.t = t\r\n self.graph = {}\r\n self.maxCap = 1000000\r\n # dict các node lân cận\r\n \r\n # e[0]: from, e[1]: to, e[2]: dung luong \r\n for e in listEdge:\r\n \r\n if e[0] not in self.graph:\r\n self.graph[e[0]] = []\r\n \r\n if e[1] not in self.graph:\r\n self.graph[e[1]] = []\r\n #to #cap #reveser edge\r\n self.graph[e[0]].append([e[1], e[2], len(self.graph[e[1]])])\r\n self.graph[e[1]].append([e[0], 0, len(self.graph[e[0]])-1])\r\n \r\n self.N = len(self.graph.keys())\r\n \r\n def bfs(self):\r\n self.dist = {}\r\n self.dist[self.s] = 0\r\n self.curIter = {node:[] for node in self.graph}\r\n \r\n Q = deque([self.s])\r\n \r\n while(len(Q) > 0):\r\n cur = Q.popleft()\r\n \r\n for index,e in enumerate(self.graph[cur]):\r\n # Chỉ add vào các node kế tiếp nếu dung lượng cạnh > 0 và chưa được visit trước đấy \r\n if e[1] > 0 and e[0] not in self.dist:\r\n self.dist[e[0]] = self.dist[cur] + 1\r\n # add vào danh sách node kế tiếp của node hiện tại\r\n self.curIter[cur].append(index)\r\n Q.append(e[0])\r\n \r\n \r\n def findPath(self, cur, f):\r\n if cur == self.t:\r\n return f\r\n \r\n while len(self.curIter[cur]) > 0:\r\n indexEdge = self.curIter[cur][-1]\r\n nextNode = self.graph[cur][indexEdge][0]\r\n remainCap = self.graph[cur][indexEdge][1]\r\n indexPreEdge = self.graph[cur][indexEdge][2]\r\n \r\n if remainCap > 0 and self.dist[nextNode] > self.dist[cur]:\r\n #self.next[cur] = indexEdge\r\n flow = self.findPath(nextNode, min(f, remainCap))\r\n \r\n if flow > 0:\r\n self.path.append(cur)\r\n self.graph[cur][indexEdge][1] -= flow\r\n self.graph[nextNode][indexPreEdge][1] += flow\r\n #if cur == self.s:\r\n # print(self.path, flow)\r\n return flow \r\n #else:\r\n #self.path.pop()\r\n self.curIter[cur].pop() \r\n \r\n return 0\r\n \r\n def maxFlow(self):\r\n maxflow = 0\r\n flow = []\r\n \r\n while(True):\r\n self.bfs()\r\n \r\n if self.t not in self.dist:\r\n break\r\n \r\n while(True):\r\n self.path = []\r\n f = self.findPath(self.s, self.maxCap)\r\n #print('iter', self.curIter)\r\n if f == 0:\r\n break\r\n \r\n flow.append(f) \r\n maxflow += f\r\n \r\n return maxflow \r\n \r\n # Tìm tập node thuộc S và T\r\n # sau khi đã tìm được max flow\r\n def residualBfs(self):\r\n Q = deque([self.s])\r\n side = {self.s:'s'}\r\n \r\n while(len(Q) > 0):\r\n cur = Q.popleft()\r\n \r\n for index,e in enumerate(self.graph[cur]):\r\n if e[1] > 0 and e[0] not in side:\r\n Q.append(e[0])\r\n side[e[0]] = 's'\r\n \r\n S = []\r\n T = [] \r\n for x in self.graph:\r\n if x in side:\r\n S.append(x)\r\n else:\r\n T.append(x)\r\n return set(S), set(T)\r\n \r\n\r\n \r\nn, m, X = map(int, input().split())\r\nedge = [list(map(int, input().split())) for _ in range(m)] \r\n \r\nl, r = 0, 1000000\r\n \r\nwhile r-l>1e-9:\r\n #print(l, r)\r\n md = (r+l) / 2\r\n edge_ = [[u, v, w // md] for u, v, w in edge] \r\n g = Dinic(edge_, 1, n)\r\n maxflow = g.maxFlow()\r\n \r\n if maxflow >= X:\r\n l=md\r\n else:\r\n r=md\r\n \r\nprint(X*r)", "from collections import defaultdict, deque\r\n \r\n \r\ndef bfs(graph, start, end, parent):\r\n parent.clear()\r\n queue = deque()\r\n queue.append([start, float(\"Inf\")])\r\n parent[start] = -2\r\n while queue:\r\n current, flow = queue.popleft()\r\n for neighbor in graph[current]:\r\n if parent[neighbor] == -1 and graph[current][neighbor] > 0:\r\n parent[neighbor] = current\r\n flow = min(flow, graph[current][neighbor])\r\n if neighbor== end:\r\n return flow\r\n queue.append((neighbor, flow))\r\n return 0\r\n \r\n \r\ndef maxflow(graph, start, end):\r\n flow = 0\r\n parent = defaultdict(lambda: -1)\r\n while True:\r\n bt = bfs(graph, start, end, parent)\r\n if bt:\r\n flow += bt\r\n current = end\r\n while current != start:\r\n prev = parent[current]\r\n graph[prev][current] -= bt\r\n graph[current][prev] += bt\r\n current = prev\r\n else:\r\n break\r\n return flow\r\n \r\n \r\nn, m, x = map(int, input().split())\r\ngraph = defaultdict(lambda: defaultdict(lambda: 0))\r\nfor _ in range(m):\r\n u, v, w = map(int, input().split())\r\n graph[u][v] = w\r\n \r\n \r\ndef check(k):\r\n meh = defaultdict(lambda: defaultdict(lambda: 0))\r\n for i in graph:\r\n for j in graph[i]:\r\n ww = graph[i][j] // k\r\n meh[i][j] = ww\r\n flow = maxflow(meh, 1, n)\r\n return flow\r\n \r\n \r\nlo = 1 / x\r\nhi = check(1)\r\n \r\nfor _ in range(70):\r\n mid = round((hi + lo) / 2,9)\r\n if check(mid)>=x:\r\n lo = round(mid,9)\r\n else:\r\n hi = mid\r\nprint(format(lo * x, '.9f'))\r\n" ]

[ "import sys\r\ninput = lambda: sys.stdin.readline().rstrip()\r\n\r\nfrom heapq import *\r\n \r\nans = []\r\nv = []\r\nfor _ in range(int(input())):\r\n A = input().split()\r\n a = A[0]\r\n \r\n\r\n if a=='insert':\r\n b = int(A[1])\r\n ans.append(a+' ' +str(b))\r\n heappush(v,b)\r\n elif a=='getMin':\r\n b = int(A[1])\r\n while v and v[0]<b:\r\n heappop(v)\r\n ans.append('removeMin')\r\n if not v or (v and v[0]>b):\r\n heappush(v,b)\r\n ans.append('insert ' + str(b))\r\n\r\n ans.append('getMin ' + str(b))\r\n else:\r\n if not v:\r\n heappush(v,1)\r\n ans.append('insert 1')\r\n ans.append('removeMin')\r\n heappop(v)\r\n \r\nprint(len(ans))\r\nfor a in ans:\r\n print(a)\r\n", "from heapq import heappush, heappop\n\nheap = []\ncmdNum = int(input())\ncmdList = []\n\nfor _ in range(cmdNum):\n\tcmdStr = input()\n\tcmdArr = cmdStr.split()\n\tcmd = cmdArr[0]\n\n\tif(cmd == 'removeMin'):\n\t\tif(len(heap) == 0):\n\t\t\tcmdList.append(\"insert 0\")\n\t\t\theappush(heap, 0)\n\t\t\t\n\t\theappop(heap)\n\t\tcmdList.append(cmdStr)\n\t\t\n\tif(cmd == 'insert'):\n\t\tnum = int(cmdArr[1])\n\t\theappush(heap, num)\n\t\tcmdList.append(cmdStr)\n\t\t\n\tif(cmd == 'getMin'):\n\t\tnum = int(cmdArr[1])\n\t\t\n\t\tif(len(heap) == 0):\n\t\t\tcmdList.append(\"insert \"+ str(num))\n\t\t\theappush(heap, num)\n\t\t\n\t\twhile(heap[0] != num):\n\t\t\tif(heap[0] < num):\n\t\t\t\tcmdList.append(\"removeMin\")\n\t\t\t\theappop(heap)\n\t\t\t\t\n\t\t\tif(len(heap) == 0 or heap[0] > num):\n\t\t\t\tcmdList.append(\"insert \"+ str(num))\n\t\t\t\theappush(heap, num)\n\t\t\t\t\n\n\t\tcmdList.append(cmdStr)\n\nprint(len(cmdList))\nprint(*cmdList, sep = \"\\n\")\n\t\t\t\t \t\t\t \t\t\t\t \t\t\t\t \t\t \t \t", "# https://codeforces.com/problemset/problem/681/C\n\nimport sys\nimport heapq\n\ninput = sys.stdin.readline\npp = sys.stdout.write\n\n\ndef main():\n n = int(input())\n h = []\n o = []\n for i in range(n):\n cc = input().split()\n if len(cc) > 1:\n c,v = cc\n else:\n c = cc[0]\n\n if c == \"insert\":\n heapq.heappush(h, int(v))\n o.append(c+\" \"+v)\n elif c == \"removeMin\":\n if len(h) == 0:\n o.append(\"insert 1\")\n heapq.heappush(h,1)\n heapq.heappop(h)\n o.append(\"removeMin\")\n elif c == \"getMin\":\n if len(h) == 0:\n heapq.heappush(h,int(v))\n o.append(\"insert \"+v)\n while h[0] < int(v):\n heapq.heappop(h)\n o.append(\"removeMin\")\n if len(h) == 0:\n heapq.heappush(h,int(v))\n o.append(\"insert \"+v)\n break\n if h[0] == int(v):\n o.append(c+\" \"+v)\n elif h[0] > int(v):\n heapq.heappush(h,int(v))\n o.append(\"insert \"+v)\n o.append(c+\" \"+v)\n \n print(len(o))\n for i in o:\n pp(i+\"\\n\")\n\nmain()", "import heapq\n\nops = []\nop_rmin = \"removeMin\"\nop_insert = \"insert\"\nop_gmin = \"getMin\"\n\nqueue = []\n\nn = int(input())\n\nfor i in range(n):\n line: str = input()\n\n if not line.startswith(op_rmin):\n ins, num = line.split()\n num = int(num)\n else:\n ins = line\n\n if ins == op_insert:\n heapq.heappush(queue, num)\n ops.append(\"{} {}\".format(op_insert, num))\n elif ins == op_rmin:\n if len(queue) == 0:\n ops.append(\"{} {}\".format(op_insert, 0))\n else:\n heapq.heappop(queue)\n ops.append(\"{}\".format(op_rmin))\n else:\n min = -1\n while min != num:\n if len(queue) == 0:\n heapq.heappush(queue, num)\n ops.append(\"{} {}\".format(op_insert, num))\n break\n\n min = queue[0]\n if min < num:\n heapq.heappop(queue)\n ops.append(\"{}\".format(op_rmin))\n elif min > num:\n heapq.heappush(queue, num)\n ops.append(\"{} {}\".format(op_insert, num))\n\n ops.append(\"{} {}\".format(op_gmin, num))\n\nprint(len(ops))\nset(map(print, ops))\n\n\n\n \t\t \t \t\t \t\t\t \t \t\t\t \t \t\t", "from sys import stdin\r\ninput = stdin.readline\r\nfrom heapq import heappop, heappush\r\n\r\nn = int(input())\r\narr = [input() for _ in range(n)]\r\nres, q = [], []\r\n\r\nfor s in arr:\r\n if s[0] == 'i':\r\n heappush(q, int(s.split()[1]))\r\n elif s[0] == 'g':\r\n val = int(s.split()[1])\r\n while q and q[0] < val:\r\n res.append('removeMin')\r\n heappop(q)\r\n if not q or q[0] > val:\r\n res.append('insert ' + s.split()[1])\r\n heappush(q, val) \r\n else:\r\n if q: heappop(q)\r\n else: res.append('insert 1')\r\n res.append(s)\r\n\r\nprint(len(res))\r\nprint(\"\\n\".join(res))\r\n", "# cook your dish here\r\nimport sys\r\ninput = sys.stdin.readline\r\nfrom heapq import heapify,heappush,heappop\r\nt=1\r\n#t=int(input())\r\nfor _ in range(t):\r\n n=int(input())\r\n h=[]\r\n heapify(h)\r\n ans=[]\r\n for i in range(n):\r\n l=list(input().split())\r\n if l[0]==\"insert\":\r\n heappush(h,int(l[1]))\r\n ans.append(l[0]+\" \"+l[1])\r\n elif l[0]==\"removeMin\":\r\n if len(h)==0:\r\n ans.append(\"insert 1\")\r\n ans.append(\"removeMin\")\r\n else:\r\n heappop(h)\r\n ans.append(\"removeMin\")\r\n else:\r\n if len(h)==0:\r\n ans.append(\"insert \"+l[1])\r\n ans.append(l[0]+\" \"+l[1])\r\n heappush(h,int(l[1]))\r\n else:\r\n \r\n x=heappop(h)\r\n if int(l[1])==x:\r\n heappush(h,x)\r\n ans.append(l[0]+\" \"+l[1])\r\n elif int(l[1])>x:\r\n ans.append(\"removeMin\")\r\n while len(h)>0:\r\n x=heappop(h)\r\n if x<int(l[1]):\r\n ans.append(\"removeMin\")\r\n elif x>int(l[1]):\r\n heappush(h,x)\r\n heappush(h,int(l[1]))\r\n ans.append(\"insert \"+l[1])\r\n ans.append(l[0]+\" \"+l[1])\r\n break\r\n elif x==int(l[1]):\r\n heappush(h,x)\r\n ans.append(l[0]+\" \"+l[1])\r\n break\r\n if len(h)==0:\r\n heappush(h,int(l[1]))\r\n ans.append(\"insert \"+l[1])\r\n ans.append(l[0]+\" \"+l[1])\r\n else:\r\n heappush(h,x)\r\n heappush(h,int(l[1]))\r\n ans.append(\"insert \"+l[1])\r\n ans.append(l[0]+\" \"+l[1])\r\n print(len(ans))\r\n for i in range(len(ans)):\r\n print(ans[i])", "from sys import stdin\nfrom heapq import heappush, heappop\nn, *L = stdin.read().splitlines()\nheap = []\nres = []\n \nfor string in L:\n oper = string.split()\n if oper[0][0] == 'i':\n heappush(heap, int(oper[1]))\n elif oper[0][0] == 'g':\n key = int(oper[1])\n while heap and heap[0] < key:\n heappop(heap)\n res.append('removeMin')\n if not heap or heap[0] != key:\n heappush(heap, key)\n res.append('insert ' + oper[1])\n else:\n if heap:\n heappop(heap)\n else:\n res.append('insert 0')\n res.append(string)\n \nprint(len(res))\nprint('\\n'.join(res))\n \t\t \t \t \t \t\t \t \t\t \t\t \t \t", "from heapq import heappop, heappush\r\nfrom sys import stdin\r\nn, *l = stdin.read().splitlines()\r\nheap, res = [], []\r\nfor s in l:\r\n array = s.split()\r\n if array[0] == 'insert':\r\n heappush(heap, int(array[1]))\r\n elif array[0] == 'getMin':\r\n key = int(array[1])\r\n while heap and heap[0] < key:\r\n heappop(heap)\r\n res.append('removeMin')\r\n if not heap or heap[0] != key:\r\n heappush(heap, key)\r\n res.append('insert ' + array[1])\r\n else:\r\n if heap:\r\n heappop(heap)\r\n else:\r\n res.append('insert 0')\r\n res.append(s)\r\nprint(len(res))\r\nprint('\\n'.join(res))", "from heapq import heappop, heappush\n\nheap = []\nn = int(input())\noutput = []\n\nfor _ in range(n):\n command = input().split()\n\n if command[0] == \"removeMin\":\n if heap: heappop(heap)\n else: output.append(\"insert 0\")\n\n output.append(\"removeMin\")\n elif command[0] == \"insert\":\n heappush(heap, int(command[1]))\n output.append(\" \".join(command))\n else:\n k = int(command[1])\n while heap and heap[0] < k:\n heappop(heap)\n output.append(\"removeMin\")\n \n if not(heap) or heap[0] > k:\n heappush(heap, k)\n output.append(\"insert \"+str(k))\n \n output.append(\"getMin \"+str(k))\n\nprint(len(output))\n[print(x) for x in output]\n \t \t \t \t\t \t\t\t\t \t\t\t \t\t \t\t\t\t", "import sys\r\nimport heapq\r\ninpu = sys.stdin.readline\r\nprin = sys.stdout.write\r\na = []\r\nans = []\r\nfor _ in range(int(inpu())) :\r\n command = list(inpu().split())\r\n if len(command) == 1:\r\n if len(a) == 0:\r\n ans.append(\"insert 1\")\r\n else :\r\n heapq.heappop(a)\r\n ans.append(command[0])\r\n elif command[0] == \"insert\" :\r\n ans.append(command[0] + \" \" + command[1])\r\n heapq.heappush(a, int(command[1]))\r\n else :\r\n command[1] = int(command[1])\r\n if len(a) == 0:\r\n ans.append(\"insert \" + str(command[1]))\r\n heapq.heappush(a, command[1])\r\n else :\r\n while len(a) > 0 and a[0] < command[1] :\r\n ans.append(\"removeMin\")\r\n heapq.heappop(a)\r\n if len(a) == 0 or a[0] != command[1] :\r\n ans.append(\"insert \" + str(command[1]))\r\n heapq.heappush(a, command[1])\r\n ans.append(command[0] + \" \" + str(command[1]))\r\nprin(str(len(ans)) + '\\n')\r\nprin('\\n'.join(map(str, ans)) + '\\n')", "from heapq import heapify, heappush, heappop\r\ndef peek(heap):\r\n z = heappop(heap)\r\n heappush(heap,z)\r\n return z\r\nheap = []\r\nop = []\r\nans = []\r\nt = int(input())\r\nfor _ in range(t):\r\n x = input().split()\r\n op.append(x)\r\n\r\nfor i in op:\r\n if i[0] == \"insert\":\r\n heappush(heap, int(i[1]))\r\n ans.append(' '.join(i))\r\n elif i[0] == \"removeMin\":\r\n if len(heap) != 0:\r\n heappop(heap)\r\n ans.append(''.join(i))\r\n else:\r\n ans.append('insert 0')\r\n ans.append(' '.join(i))\r\n else:\r\n if len(heap):\r\n while len(heap) and int(i[1]) > peek(heap):\r\n ans.append(\"removeMin\")\r\n heappop(heap)\r\n if len(heap) and peek(heap)==int(i[1]):\r\n ans.append(' '.join(i))\r\n else:\r\n ans.append('insert ' + i[1])\r\n heappush(heap, int(i[1]))\r\n ans.append(' '.join(i))\r\n else:\r\n ans.append('insert '+i[1])\r\n heappush(heap,int(i[1]))\r\n ans.append(' '.join(i))\r\n #print(heap)\r\nprint(len(ans))\r\nfor i in ans:\r\n print(i)\r\n", "import math,sys\r\n#from itertools import permutations, combinations;import heapq,random;\r\nfrom collections import defaultdict,deque\r\nimport bisect as bi\r\ndef yes():print('YES')\r\ndef no():print('NO')\r\n#sys.stdin=open('input.txt','r');sys.stdout=open('output.txt','w');\r\ndef I():return (int(sys.stdin.readline()))\r\ndef In():return(map(int,sys.stdin.readline().split()))\r\ndef Sn():return sys.stdin.readline().strip()\r\n#sys.setrecursionlimit(1500)\r\nfrom heapq import heapify , heappop, heappush\r\ndef dict(a):\r\n d={} \r\n for x in a:\r\n if d.get(x,-1)!=-1:\r\n d[x]+=1\r\n else:\r\n d[x]=1\r\n return d\r\ndef find_gt(a, x):\r\n 'Find leftmost value greater than x'\r\n i = bi.bisect_left(a, x)\r\n if i != len(a):\r\n return i\r\n else: \r\n return -1\r\ndef main():\r\n try:\r\n hp=[]\r\n n=I()\r\n l=[]\r\n for i in range(n):\r\n s=Sn()\r\n if s=='removeMin':\r\n a=s\r\n else:\r\n a,b=s.split()\r\n b=int(b)\r\n if a=='insert':\r\n heappush(hp,b)\r\n l.append((a,b))\r\n elif a=='removeMin':\r\n if len(hp):\r\n heappop(hp)\r\n else:\r\n l.append(('insert',1))\r\n l.append((a,''))\r\n else:\r\n while len(hp) and hp[0]<b:\r\n l.append(('removeMin',''))\r\n heappop(hp)\r\n \r\n if not len(hp):\r\n heappush(hp,b)\r\n l.append(('insert',b))\r\n elif len(hp) and hp[0]!=b:\r\n heappush(hp,b)\r\n l.append(('insert',b))\r\n l.append((a,b))\r\n print(len(l))\r\n for x in l:\r\n print(*x)\r\n\r\n except:\r\n pass\r\n \r\nM = 998244353\r\nP = 1000000007\r\n \r\nif __name__ == '__main__':\r\n # for _ in range(I()):main()\r\n for _ in range(1):main()\r\n#End#\r\n\r\n# ******************* All The Best ******************* #" ]

[ "v1, v2, v3, vm = map(int, input().split())\r\n\r\nif vm > 2*v3 or v3> 2*vm or vm >= v2 or vm >= v1:\r\n print(-1)\r\nelse:\r\n print(2*v1)\r\n print(2*v2)\r\n print(max(v3, vm))\r\n \r\n ", "vi = list(map(int,input().split()))\r\nv1,v2,v3,vm = vi[0],vi[1],vi[2],vi[3]\r\nm1,m2,m3 = 0,0,0\r\nflag = False\r\nfor i in range(v1, 2 * v1 + 1):\r\n for j in range(v2, 2 * v2 + 1):\r\n for k in range(v3, 2 * v3 + 1):\r\n if i > j > k and vm <= k and 2 * vm >= k and 2 * vm < j:\r\n m1,m2,m3 = i,j,k\r\n flag = True\r\n break\r\nif flag:\r\n print(m1)\r\n print(m2)\r\n print(m3)\r\nelse:\r\n print(-1)\r\n", "import sys\r\nimport math\r\n\r\na,b,c,d=map(int,input().split())\r\nfor i in range(201):\r\n for j in range(i):\r\n for k in range(j):\r\n if a<=i and 2*a>=i and 2*d<i and d<=i:\r\n if b<=j and 2*b>=j and 2*d<j and d<=j:\r\n if c<=k and 2*c>=k and 2*d>=k and d<=k:\r\n print(i)\r\n print(j)\r\n print(k)\r\n sys.exit()\r\nprint(-1)\r\n", "v1, v2, v3, vm = input().split(\" \")\r\nv1 = int(v1)\r\nv2 = int(v2)\r\nv3 = int(v3)\r\nvm = int(vm)\r\n\r\nflag = False\r\n\r\nC = max( vm, v3 )\r\nB = max( max(C+1, 2*vm+1), v2 )\r\nA = max( max(B+1, 2*vm+1), v1 )\r\n\r\nif min(2*vm, 2*v3) - C < 0:\r\n flag = True\r\nif 2*v2 - B < 0:\r\n flag = True\r\nif 2*v1 - A < 0:\r\n flag = True\r\n\r\nif flag:\r\n print(-1)\r\nelse:\r\n print(str(A)+\"\\n\"+str(B)+\"\\n\"+str(C))", "a,b,c,d=list(map(int,input().split()))\r\n\r\nif d>2*c or 2*d<c or d>=b:\r\n print(\"-1\")\r\nelse:\r\n print(2*a,2*b,min(2*c,2*d))", "q,w,e,r=map(int,input().split())\r\nif (r>=w)|(r>2*e)|(2*r<e):\r\n print(-1)\r\nelse:\r\n print(q*2,w*2,min(e,r)*2, sep = '\\n')\r\n", "def aaa():\n a,b,c,d=map(int,input().split())\n for aa in range(a,2*a+1):\n for bb in range(b,min(aa,2*b+1)):\n for cc in range(c,min(bb,2*c+1)):\n if d<=aa and aa>d*2 and d<=bb and bb>d*2 and d<=cc and cc<=d*2:\n return [aa,bb,cc]\n return [-1]\nfor aa in aaa():\n print(aa)\n \t\t \t\t \t\t \t\t \t\t\t\t \t \t\t\t \t", "v1,v2,v3,vm=map(int, input().split())\na1=-1\nfor i in range(2*v3,v3-1,-1):\n\tif 2*vm>=i and vm<=i:\n\t\ta1=i\n\t\tbreak\nif a1==-1:\n\tprint(-1)\nelse:\n\tif 2*v2<2*vm+1:\n\t\tprint(-1)\n\telse:\n\t\ta2=min(max(2*a1+1,v2),2*v2)\n\t\ta3=min(max(2*a2+1,v1),2*v1)\n\t\tprint(a3)\n\t\tprint(a2)\n\t\tprint(a1)", "\r\n\r\nv1,v2,v3,vm = map(int, input().split())\r\n\r\nif vm <= v3:\r\n if 2 * vm >= v3:\r\n c3 = v3 + 0\r\n else:\r\n print (-1)\r\n exit(0)\r\nelif 2 * v3 >= vm:\r\n c3 = vm + 0\r\nelse:\r\n print(-1)\r\n exit(0)\r\n\r\nif (v2 <= c3) and (2 * v2 >= c3):\r\n print(-1)\r\n exit(0)\r\nelse:\r\n c2 = v2 * 2\r\n c1 = v1 * 2\r\n\r\nprint(c1)\r\nprint(c2)\r\nprint(c3)", "c, b, a, d = map(int, input().split())\r\nif b <= d:\r\n print('-1')\r\nelif 2 * a < d:\r\n print('-1')\r\nelif 2 * d < a:\r\n print('-1')\r\nelse:\r\n print(2 * c)\r\n print(2 * b)\r\n print(2 * min(a, d))\r\n exit(0)", "def loop():\r\n b1,b2,b3,m=(int(x) for x in input().split())\r\n for b1i in range(b1,2*b1+1):\r\n for b2i in range(b2,2*b2+1):\r\n for b3i in range(b3,2*b3+1):\r\n if b1i>b2i>b3i and m<=b3i and 2*m>=b3i and 2*m<b2i:\r\n print(b1i)\r\n print(b2i)\r\n print(b3i)\r\n return\r\n print(-1)\r\nloop()", "'''input\n99 50 25 49\n'''\nv1, v2, v3, vm = map(int, input().split())\nfor x in range(v1, 2*v1+1):\n\tfor y in range(v2, 2*v2+1):\n\t\tfor z in range(v3, 2*v3+1):\n\t\t\tif (z <= 2*vm <= 2*z) and (x > y > z) and (2*vm < x and 2*vm < y):\n\t\t\t\tprint(x, y, z, sep=\"\\n\")\n\t\t\t\tquit()\nprint(-1)", "cs1, cs2, cs3, csm = map(int, input().split())\r\n\r\ndef climbable(c_size, v_size):\r\n return c_size <= v_size\r\n\r\ndef like(c_size, v_size):\r\n return 2 * c_size >= v_size\r\n\r\nv3 = max(cs3, csm)\r\nif not like(cs3, v3) or not like(csm, v3):\r\n print(-1)\r\n exit()\r\n\r\nv2 = max(cs2, v3)\r\nwhile like(cs3, v2) or like(csm, v2):\r\n v2 += 1\r\nif not like(cs2, v2):\r\n print(-1)\r\n exit()\r\n\r\nv1 = max(cs1, v2)\r\nwhile like(cs2, v1):\r\n v1 += 1\r\nif not like(cs1, v1):\r\n print(-1)\r\n exit()\r\n\r\nprint(v1)\r\nprint(v2)\r\nprint(v3)\r\n", "a,b,c,m = [int(i) for i in input().split()]\r\n\r\nra = 2 * a\r\nrb = 2 * b\r\nrc = min(c, m) * 2\r\n\r\nif m < ra / 2 and m < rb / 2 and rc / 2<= m <= rc and rc / 2<= c <= rc:\r\n print(ra, rb, rc)\r\nelse:\r\n print(-1)\r\n\r\n\r\n\r\n", "import sys\r\nv=list(map(int,input().split()))\r\nret=[0,0,0]\r\nret[2]=max(v[2],v[3])\r\nif ret[2]>v[2]*2 or ret[2]>v[3]*2:\r\n print(-1)\r\n sys.exit(0)\r\nret[1]=max(ret[2]+1, v[1], 2*v[3]+1)\r\nif ret[1]>v[1]*2:\r\n print(-1)\r\n sys.exit(0)\r\nret[0]=max(ret[1]+1, v[0])\r\nif ret[0]>v[0]*2:\r\n print(-1)\r\nelse:\r\n print(\"\\n\".join(list(map(str,ret))))\r\n", "a,b,c,d = map(int,input().split())\r\n\r\n\r\nif( (d>c*2 or d*2<c or d>=b)):\r\n print(\"-1\")\r\nelse:\r\n print(a*2)\r\n print(b*2)\r\n print(max(c,d))", "arr = input().split()\r\n\r\na = int(arr[0])\r\nb = int(arr[1])\r\nc = int(arr[2])\r\nd = int(arr[3])\r\n\r\nfound = False\r\nfor a1 in range(a, 2 * a + 1):\r\n for b1 in range(b, min(2 * b, a1)):\r\n for c1 in range(max(c, d), b1):\r\n if d <= a1 and d <= b1 and d <= c1 and 2 * d < a1 and 2 * d < b1 and 2 * d >= c1 and c <= c1 and 2 * c >= c1:\r\n found = True\r\n print(a1)\r\n print(b1)\r\n print(c1)\r\n break\r\n if found:\r\n break\r\n if found:\r\n break\r\nif not found:\r\n print(-1)", "v1,v2,v3,vm=map(int,input().split())\r\nif (vm>2*v3) or (2*vm<v3):\r\n print(-1)\r\nelif (vm>=v2):\r\n print(-1)\r\nelse:\r\n print(v1*2,v2*2,min(v3,vm)*2)\r\n", "def f(a, b):\r\n return a <= b and not 2 * a >= b\r\n\r\nV1, V2, V3, Vm = map(int, input().split())\r\nfor v1 in range(V1, 2 * V1 + 1):\r\n for v2 in range(V2, min(2 * V2 + 1, v1)):\r\n for v3 in range(V3, min(2 * V3 + 1, v2)):\r\n if f(Vm, v1) and f(Vm, v2) and Vm <= v3 <= 2 * Vm:\r\n print(v1, v2, v3, sep='\\n')\r\n exit()\r\nprint(-1)\r\n", "v=list(map(int,input().split()))\r\nif v[3]<=2*v[2] and 2*v[3]>=v[2] and 2*v[3]<2*v[1]:\r\n\tprint(2*v[0])\r\n\tprint(2*v[1])\r\n\tprint(max(v[2],v[3]))\r\nelse:\r\n\tprint(-1)", "a, b, c, d = [int(i) for i in input().split()]\r\nif d > 2 * c or d >= b or d >= a or 2 * d < c:\r\n print(-1)\r\n exit()\r\nprint(2 * a)\r\nprint(2 * b)\r\nif c > d:\r\n v = c\r\nelse:\r\n v = d\r\nprint(v)", "import sys\r\n\r\ndata = input().split(\" \")\r\nfor el in range(len(data)):\r\n data[el] = int(data[el])\r\n\r\nif data[2]>data[3]*2 or data[3]>data[2]*2 or data[3]>=data[1]:\r\n print(-1)\r\n sys.exit()\r\n\r\nlil = max(data[2], data[3])\r\n\r\nres = data.copy()\r\nres[0] *= 2\r\nres[1] *= 2\r\nres[2] = max(data[2], data[3])\r\n\r\n\r\nprint(\"{}\\n{}\\n{}\".format(res[0], res[1], res[2]))", "bear1, bear2, bear3, mash = map(int, input().split())\r\ncar1 = bear1 * 2\r\ncar2 = bear2 * 2\r\ncar3 = max(mash, bear3)\r\nif 2 * mash < car1 and 2 * mash < car2 and bear3 * 2 >= car3 and mash * 2 >= car3 and mash <= car1 and mash <= car2:\r\n print(car1)\r\n print(car2)\r\n print(car3)\r\nelse:\r\n print(-1)\r\n", "a,b,c,d=map(int,input().split())\r\nif b<=d or 2*c<d or 2*d<c:\r\n print(-1)\r\nelse:\r\n print(2*a)\r\n print(2*b)\r\n print(max(c,d))\r\n \r\n", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\nv1, v2, v3, vm = map(int, input().split())\r\nans = [-1]\r\nfor i in range(v3, 2 * v3 + 1):\r\n for j in range(max(i + 1, v2), 2 * v2 + 1):\r\n for k in range(max(j + 1, v1), 2 * v1 + 1):\r\n if vm <= i and 2 * vm >= i and 2 * vm < j:\r\n ans = [k, j, i]\r\n break\r\n if len(ans) ^ 1:\r\n break\r\n if len(ans) ^ 1:\r\n break\r\nsys.stdout.write(\"\\n\".join(map(str, ans)))", "v1, v2, v3, vm = map(int, input().split())\r\n\r\nm3 = max(vm, v3)\r\n\r\nif (m3 > 2 * v3) or (v3 > 2 * vm):\r\n print(-1)\r\n exit(0)\r\n\r\nm2 = max(v2, max(m3 + 1, 2 * vm + 1))\r\n\r\nif m2 > 2 * v2:\r\n print(-1)\r\n exit(0)\r\n\r\nm1 = max(v1, m2 + 1)\r\n\r\nif m1 > 2 * v1:\r\n print(-1)\r\n exit(0)\r\n\r\nprint(m1, m2, m3, sep='\\n')\r\n\r\n", "v1, v2, v3, vm = map(int, input().split()) # v1 - dad, v2 - mom, v3 - kid, vm = Masha\r\n\r\nif vm >= v2 or vm > 2 * v3 or 2 * vm < v3:\r\n print(-1)\r\nelse:\r\n print(v1 * 2, v2 * 2, max(v3, vm))\r\n", "v1, v2, v3, vm = map(int, input().split())\r\n\r\nansw = \"-1\"\r\nbreakaway = False\r\n\r\nfor c1 in range(201):\r\n if breakaway: \r\n break\r\n for c2 in range(201):\r\n if breakaway: \r\n break\r\n if c2 >= c1:\r\n break\r\n for c3 in range(201):\r\n if c3 >= c2:\r\n break\r\n if (v1 <= c1) and (2 * v1 >= c1) and (v2 <= c2) and (2 * v2 >= c2) and (v3 <= c3) and (2 * v3 >= c3):\r\n if vm <= c1 and vm <= c2 and vm <= c3:\r\n if 2 * vm < c1 and 2 * vm < c2 and 2 * vm >= c3:\r\n answ = str(c1) + '\\n' + str(c2) + '\\n' + str(c3) + '\\n'\r\n breakaway = True\r\n break;\r\nprint(answ) \r\n", "v1, v2, v3, vm = map(int, input().split())\n\nif 2 * v3 < vm or vm >= v2 or vm * 2 < v3:\n print(-1)\nelse:\n print(2 * v1)\n print(2 * v2)\n print(max(v3, vm))", "n = [int(x) for x in input().split(' ')]\r\nm = n[3]\r\nposs = True\r\ncars = []\r\nif n[0]<= m:\r\n poss = False\r\nelse:\r\n cars.append(2*n[0])\r\n if n[1] <=m:\r\n poss = False\r\n else:\r\n cars.append(2*n[1])\r\n if n[2]>2*m or 2*n[2]<m:\r\n poss = False\r\n else:\r\n cars.append(max(m,n[2]))\r\n\r\nif poss:\r\n print('\\n'.join([str(x) for x in cars]))\r\nelse:\r\n print(-1)\r\n \r\n \r\n", "u = list(map(int, input().strip().split()))\nm = u[3]\n\nif (m*2 >= u[2] and m <= u[2] * 2 and m < u[1]):\n print(u[0]*2)\n print(u[1]*2)\n print(max(m,u[2]))\nelse:\n print(-1)\n \t \t \t \t \t\t \t\t \t \t\t \t \t \t\t", "v1, v2, v3, vm = map(int, input().split())\n# Always pick biggest car for mum and dad\nc1 = 2*v1\nc2 = 2*v2\n\nhi_baby = 2*v3\nlo_baby = v3\nhi_masha = 2*vm\nlo_masha = vm\n\nif lo_baby > hi_masha:\n # Baby and Masha must fit in same car\n print(-1)\nelif lo_masha > hi_baby:\n # Baby and Masha must fit in same car\n print(-1)\nelif hi_masha >= c2 >= lo_masha:\n # Masha can't fit in mum's car\n print(-1)\nelif hi_masha >= c1 >= lo_masha:\n # Masha can't fit in dad's car\n print(-1)\nelse:\n print(c1, c2, sorted([lo_baby, lo_masha, hi_baby, hi_masha])[1], sep=\"\\n\")\n \n", "import sys\r\nv1,v2,v3,vm=map(int,input().split(' '))\r\narr=[]\r\ns1=max(v1,vm)\r\nif(2*v1>2*vm and 2*v1>=s1):\r\n arr.append(2*v1)\r\nelse:\r\n print(\"-1\")\r\n sys.exit()\r\ns2=max(v2,vm)\r\nif(2*v2>2*vm and 2*v1>=s2):\r\n arr.append(2*v2)\r\nelse:\r\n print(\"-1\")\r\n sys.exit()\r\ns3=max(v3,vm)\r\ns4=min(2*v3,2*vm)\r\nif(s4>=s3):\r\n arr.append(s4)\r\nelse:\r\n print(\"-1\")\r\n sys.exit()\r\nfor i in range(3):\r\n print(arr[i])\r\n \r\n", "v1, v2, v3, vm = map(int,input().split())\r\nif v3 *2 >= vm and v2 > vm and vm*2 >= v3:\r\n print(v1*2)\r\n print(v2*2)\r\n print(min(vm*2,v3*2))\r\nelse:\r\n print(\"-1\")\r\n", "p,m,s,h=map(int,input().split())\r\nprint(*[[2*p,2*m,max(s,h)],[-1]][s>2*h or h>2*s or h>=m])", "import sys\r\n\r\ni = input()\r\n\r\nv1, v2, v3, v4 = list(map(int, i.split(\" \")))\r\n#print(v1, v2, v3, v4)\r\n\r\nc1, c2, c3 = 0, 0, 0\r\n\r\nif (v3 > v4):\r\n if v3 > v4*2:\r\n print(-1)\r\n sys.exit()\r\n c3 = v3\r\nelse:\r\n if v4 > v3*2:\r\n print(-1)\r\n sys.exit()\r\n c3 = v4\r\n\r\n#print(c3)\r\n\r\nfor c in range(c3+1, 200):\r\n if (c >= v2) and (c <= v2*2) and (c > v4*2):\r\n# print(c)\r\n c2 = c\r\n break\r\n\r\nif c2 == 0:\r\n print(-1)\r\n sys.exit()\r\n\r\nfor c in range(c2+1, 201):\r\n if (c >= v1) and (c <= v1*2) and (c > v4*2):\r\n# print(c)\r\n c1 = c\r\n break\r\n\r\nif c1 == 0:\r\n print(-1)\r\n sys.exit()\r\n\r\nprint(c1)\r\nprint(c2)\r\nprint(c3)", "v1,v2,v3,vm=(int(w) for w in input().split())\r\nif vm>=v2 or vm>2*v3 or vm<0.5*v3: print(-1)\r\nelif vm<v3:\r\n Ans=[2*v1,2*v2,v3]\r\n for w in Ans:\r\n print(w)\r\nelse:\r\n Ans=[2*v1,2*v2,2*v3]\r\n for w in Ans:\r\n print(w)", "f,m,s,ma = [int(x) for x in input().split()]\r\nb=max(m,2*ma+1)\r\nc=max(f,b+1)\r\na=max(ma,s)\r\nif a<=2*s and a<=2*ma and b<=2*m and c<=2*f:\r\n print(c)\r\n print(b)\r\n print(a)\r\nelse:\r\n print(-1)", "def main():\r\n v1, v2, v3, vm = list(map(int, input().split()))\r\n f_right = min(v3 * 2, vm * 2)\r\n f_left = max(vm, v3)\r\n if (f_right < f_left):\r\n print(-1)\r\n return 0\r\n s_right = 2 * v2\r\n s_left = max(2 * vm + 1, v2)\r\n if (s_right < s_left):\r\n print(-1)\r\n return 0\r\n t_right = 2 * v1\r\n t_left = max(2 * vm + 1, v1)\r\n if (t_right < t_left):\r\n print(-1)\r\n return 0\r\n third = t_right\r\n first = f_left\r\n if (third <= first + 1):\r\n print(-1)\r\n return 0\r\n if (s_left >= third or s_right <= first):\r\n print(-1)\r\n return 0\r\n if (first + 1 <= s_right and first + 1 >= s_left):\r\n second = first + 1\r\n print(third)\r\n print(second)\r\n print(first)\r\n return (first, second, third)\r\n if (third - 1 <= s_right and third - 1 >= s_left):\r\n second = third - 1\r\n print(third)\r\n print(second)\r\n print(first)\r\n return (first, second, third)\r\n second = s_left\r\n print(third)\r\n print(second)\r\n print(first)\r\nx = main()", "a, b, c, d = map(int, input().split())\r\nfor i in range(d, 2 * d + 1):\r\n if i <= c * 2 <= i * 2:\r\n if b > d:\r\n print(a * 2)\r\n print(b * 2)\r\n print(i)\r\n exit()\r\nprint(-1)", "from sys import stdin, stdout\r\n\r\n\r\nv1, v2, v3, vm = map(int, stdin.readline().split())\r\nans = []\r\n\r\nfor i in range(2 * v1, max(1, v1 - 1), -1):\r\n for j in range(min(2 * v2, i - 1), max(1, v2 - 1), -1):\r\n for z in range(min(2 * v3, j - 1), max(1, v3 - 1), -1):\r\n if 2 * vm < i and 2 * vm < j and 2 * vm >= z and vm <= z:\r\n ans = [i, j, z]\r\n \r\nif not ans:\r\n stdout.write('-1')\r\nelse:\r\n stdout.write('\\n'.join(list(map(str, ans))))", "m1,m2,m3,ma = map(int,input().split())\r\nif m3 * 2 >= ma and ma < m2 and ma * 2 >= m3:\r\n print(m1 * 2)\r\n print(m2 * 2)\r\n print(max(m3,ma))\r\nelse:\r\n print(-1)\r\n", "a, b, c, d = map(int, input().split())\n\nif max(c,d) > min(c,d) * 2 or d >= b:\n print(-1)\n exit(0)\n\nprint(a * 2)\nprint(b * 2)\nprint(min(c,d)*2)\n", "v1, v2, v3, m = map(int, input().split())\r\nif m > 2*v3:\r\n print(-1)\r\n exit()\r\nif m > v3:\r\n ans3 = min(v2, m)\r\n if 2*m < 2*v2:\r\n ans2 = 2*v2\r\n ans1 = 2*v1\r\n print(ans1, ans2, ans3)\r\n else:\r\n print(-1)\r\n exit()\r\nelse:\r\n if 2*m < v3:\r\n print(-1)\r\n exit()\r\n else:\r\n ans3 = 2*m\r\n ans2 = 2*v2\r\n ans1 = 2*v1\r\n print(ans1, ans2, ans3)", "v1x, v2x, v3x, vm = map(int, input().split())\r\nv1, v2 = v1x * 2, v2x * 2\r\nv3 = max(v3x, vm)\r\nif (vm <= v1 and vm * 2 < v1) and vm <= v2 and vm * 2 < v2 and vm <= v3 and vm * 2 >= v3 and v1 >= v1x and v1 >= v1x* 2 and v2 >= v2x and v2 <= v2x * 2 and v3 >= v3x and v3 <= v3x * 2:\r\n print(v1, v2, v3)\r\nelse:\r\n print(-1)\r\n", "x = list(map(int, input().split()))\r\n\r\nif(x[3] < x[1] and x[3] <= 2*x[2] and x[2] <= 2*x[3]):\r\n\tprint(2*x[0])\r\n\tprint(2*x[1])\r\n\tprint(min(2*x[2],2*x[3]))\r\n\r\nelse:\r\n\tprint(-1)", "V = [0] * 3\r\nV[0], V[1], V[2], Vm = map(int, input().split())\r\nans = [-1] * 3\r\nfor t in range(2): \r\n if 2 * V[t] >= max(2 * Vm + 1, V[t], Vm):\r\n ans[t] = 2 * V[t]\r\nif max(V[2], Vm) <= min(2 * V[2], 2 * Vm):\r\n ans[2] = max(V[2], Vm)\r\nif ans[0] != -1 and ans[1] != -1 and ans[2] != -1:\r\n print(ans[0], ans[1], ans[2], sep = '\\n')\r\nelse:\r\n print(-1)", "a, b, c, d = map(int, input().split())\r\ntf = (c * 2, c)\r\nts = (d * 2, d)\r\nif (tf[1] <= ts[0] and tf[0] >= ts[0]):\r\n t = tf[1]\r\nelif (ts[1] <= tf[0] and ts[0] >= tf[0]):\r\n t = ts[1]\r\nelse:\r\n print(-1)\r\n exit()\r\nif b > d:\r\n s = b * 2\r\nelse:\r\n print(-1)\r\n exit()\r\nif a > d:\r\n f = a * 2\r\nelse:\r\n print(-1)\r\n exit()\r\nprint(f, s, t, sep='\\n')\r\n\r\n", "\r\ndef STR(): return list(input())\r\ndef INT(): return int(input())\r\ndef MAP(): return map(int, input().split())\r\ndef MAP2():return map(float,input().split())\r\ndef LIST(): return list(map(int, input().split()))\r\ndef STRING(): return input()\r\nimport string\r\nimport sys\r\nfrom heapq import heappop , heappush\r\nfrom bisect import *\r\nfrom collections import deque , Counter , defaultdict\r\nfrom math import *\r\nfrom itertools import permutations , accumulate\r\ndx = [-1 , 1 , 0 , 0 ]\r\ndy = [0 , 0 , 1 , - 1]\r\n#visited = [[False for i in range(m)] for j in range(n)]\r\n# primes = [2,11,101,1009,10007,100003,1000003,10000019,102345689]\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 check(i , v2):\r\n if 2 * v2 >= i and v2 <= i :\r\n return False\r\n return True\r\n\r\nv1,v2,v3,v4 = MAP()\r\n\r\nr1 , r2 , r3 = 0 , 0 , 0\r\nfor i in range(v1 , 300):\r\n if v1 <= i and 2 *v1 >= i and check(i , v2) and check(i , v3) and check(i , v4):\r\n r1 = i\r\n break\r\n\r\nfor i in range(v2 , 300):\r\n if v2 <= i and 2 *v2 >= i and check(i , r1) and check(i , v3) and check(i , v4):\r\n r2 = i\r\n break\r\n\r\nmx = max(v3,v4)\r\nfor i in range( mx, 300):\r\n if v3 <= i and 2 * v3 >= i and v4 <= i and 2 * v4 >= i and check(i , r1) and check(i , r2):\r\n r3 = i\r\n break\r\n\r\nif r1 == 0 or r2 == 0 or r3 == 0 :\r\n print('-1')\r\nelse:\r\n print(r1,r2,r3)\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "v1,v2,v3,vm = map(int, input().split())\r\nif vm >= v2 or 2*v3 < vm or 2*vm < v3:\r\n print(\"-1\")\r\nelse:\r\n print(2*v1)\r\n print(2*v2)\r\n print(max(v3, vm))\r\n", "v1, v2, v3, vm = map(int, input().split())\r\nif vm > 2*v3:\r\n print(-1)\r\n exit()\r\n\r\na1 = v1*2-1\r\na2 = v2*2-1\r\na3 = max(v3, vm)\r\nif vm <= a3 and v3 <= a3 and 2*vm >= a3 and 2*v3 >= a3 and 2*vm < a2:\r\n print(a1)\r\n print(a2)\r\n print(a3)\r\nelse:\r\n print(-1)\r\n", "v1,v2,v3,vm = map(int,str(input()).split(' '))\r\nvm2 = vm*2\r\nv12 = v1*2\r\nv22 = v2*2\r\nv32 = v3*2\r\nif vm2 >= v22 or vm > v32 or v3 > vm2:\r\n print(-1)\r\nelse:\r\n print(v12)\r\n print(v22)\r\n print(max(v3,vm))\r\n", "\r\n\r\ndef run():\r\n b1, b2, b3, m = [int(x) for x in input().split()]\r\n if b1 <= m:\r\n print('-1')\r\n return\r\n if b2 <= m:\r\n print('-1')\r\n return\r\n if 2*m < b3:\r\n print('-1')\r\n return\r\n if 2*b3 < m:\r\n print('-1')\r\n return\r\n print(2*b1)\r\n print(2*b2)\r\n for x in range(m, 2*m+1):\r\n if b3 <= x <= 2*b3:\r\n print(x)\r\n break\r\nrun()", "a1,a2,a3,a4 = map(int,input().split())\r\n\r\nif a4>a3*2 or 2*a4<a3 or a4>=a2:\r\n print(-1)\r\nelse:\r\n print(a1*2)\r\n print(a2*2)\r\n print(min(2*a4,2*a3))\r\n", "a,b,c,d=map(int,input().split())\r\n\r\nif c>d:\r\n mc=c\r\nelse:\r\n mc=d\r\nif 2*c<2*d:\r\n md=2*c\r\nelse:\r\n md=2*d\r\nif md<mc or d==a or d==b:\r\n print('-1')\r\nelse:\r\n if a>d:\r\n print(2*a)\r\n else:\r\n print(a)\r\n if b>d:\r\n print(2*b) \r\n else:\r\n print(b)\r\n \r\n print(mc)", "v1, v2, v3, vm = map(int, input().split())\r\nif v2 <= vm or vm > (v3 * 2) or (vm * 2) < v3 :\r\n\tprint(-1)\r\nelse :\r\n\tprint(v1 * 2)\r\n\tprint(v2 * 2)\r\n\tif v3 > vm :\r\n\t\tprint(v3)\r\n\telse :\r\n\t\tprint(vm)", "#!/usr/bin/env python3\n\ndef solve():\n papa, mama, son, masha = get([int])\n small, med, large = None, None, None\n\n def fit(person, car):\n return person <= car\n def likes(person, car):\n return car <= 2*person\n def fitandlikes(person, car):\n return fit(person, car) and likes(person, car)\n\n for small in range(1, 301):\n if fitandlikes(masha, small) and fitandlikes(son, small):\n break\n else:\n return -1\n\n for med in range(small+1, 301):\n if fitandlikes(mama, med) and not likes(masha, med):\n break\n else:\n return -1\n\n for large in range(med+1, 301):\n if fitandlikes(papa, large) and not likes(masha, large):\n break\n else:\n return -1\n\n\n return '\\n'.join(map(str, [large, med, small]))\n\n\n\n\n\n\n\n\n\n\n_testcases = \"\"\"\n50 30 10 10\n\n50\n30\n10\n\n\n\n\n\n100 50 10 21\n\n-1\n\"\"\".strip()\n\n# ======================= B O I L E R P L A T E ======================= #\n# Practicality beats purity\n\nfrom bisect import bisect_left, bisect_right\nfrom collections import defaultdict\nfrom functools import lru_cache\nfrom heapq import heapify, heappop, heappush\nfrom operator import itemgetter, attrgetter\nimport bisect\nimport collections\nimport functools\nimport heapq\nimport itertools\nimport math\nimport operator\nimport re\nimport string\nimport sys\n\ninf = float('inf')\ncache = lru_cache(None)\nsys.setrecursionlimit(10000)\n\ndef tree():\n return collections.defaultdict(tree)\n\ndef equal(x, y, epsilon=1e-6):\n # https://code.google.com/codejam/kickstart/resources/faq#real-number-behavior\n if -epsilon <= x - y <= epsilon:\n return True\n if -epsilon <= x <= epsilon or -epsilon <= y <= epsilon:\n return False\n return (-epsilon <= (x - y) / x <= epsilon or -epsilon <= (x - y) / y <= epsilon)\n\n\ndef get(_type): # For easy input\n if type(_type) == list:\n if len(_type) == 1:\n _type = _type[0]\n return list(map(_type, input().strip().split()))\n else:\n return [_type[i](inp) for i, inp in enumerate(input().strip().split())]\n else:\n return _type(input().strip())\n\nif __name__ == '__main__':\n printRecursionTree = timeit = lambda x: x\n _p, print = print, lambda *a, **b: None\n _p(solve())\n", "v1, v2, v3, vm = map(int, input().split())\r\ncar = max(vm, v3)\r\nif car >= v1 or car >= v2:\r\n print(-1)\r\n exit(0)\r\nif vm * 2 >= car and v3 * 2 >= car:\r\n print(v1 * 2)\r\n print(v2 * 2)\r\n print(car)\r\nelse:\r\n print(-1)\r\n", "a,b,c,d=map(int,input().split(' '))\r\nif max(c,d)/min(c,d)>2 or d>=b:\r\n print(-1)\r\nelse:\r\n print(a*2)\r\n print(b*2)\r\n print(max(c,d))", "v = list(map(int, input().strip().split()))\r\nm = max(v[2], v[3])\r\nif 2*m >= 2*v[1] or 2*v[3] < m or 2*v[2] < m:\r\n print('-1')\r\nelse:\r\n print(2*v[0])\r\n print(2*v[1])\r\n print(m)\r\n", "#python3\r\n#utf-8\r\npapa, mama, son, masha = (int(x) for x in input().split())\r\n# volumes = [papa, mama, son]\r\nif 2 * masha < son or masha > 2 * son or masha >= mama:\r\n print(-1)\r\n quit();\r\ncar3 = son\r\nif masha > son:\r\n car3 = masha\r\ncar2 = 2 * mama\r\ncar1 = 2 * papa\r\nprint(car1, car2, car3,sep='\\n')\r\n", "v1, v2, v3, vm = map(int,input().split())\nif v2>vm and vm<=2*v3 and vm >= v3/2:\n print(2*v1)\n print(2*v2)\n print(max(vm,v3))\nelse:\n print(-1)\n", "def process(V1, V2, V3, Vm):\r\n #need x > y > z \r\n #V1 <= x <= 2*V1\r\n #V2 <= y <= 2*V2\r\n # y <= x-1\r\n #y <= min(2*V2, x-1)\r\n #V3 <= z <= 2*V3\r\n #Vm <= z <= 2*Vm < y < x\r\n # z <= y-1\r\n x = 2*V1 \r\n if 2*Vm >= x:\r\n return [-1]\r\n y = min(x-1, 2*V2)\r\n if 2*Vm >= y or V2 > y:\r\n return [-1]\r\n z = min(2*V3, 2*Vm, y-1)\r\n if x > y > z > 0 and 2*V1 >= x >= V1 and 2*V2 >= y >= V2 and 2*V3 >= z >= V3 and 2*Vm >= z >= Vm:\r\n return [x, y, z]\r\n else:\r\n return [-1]\r\n \r\nV1, V2, V3, Vm = [int(x) for x in input().split()]\r\nanswer = process(V1, V2, V3, Vm)\r\nfor x in answer:\r\n print(x)", "import sys\n\ndef likes(charsize, carsize):\n return 2*charsize >= carsize\n\nf,m,s,masha = map(int, input().split())\n\nfl = f\nml = m\nsl = s\nfh = f * 2\nmh = m * 2\nsh = s * 2\nfor tryf in range(fl, fh + 1):\n for trym in range(ml, mh + 1):\n for trys in range(sl, sh + 1):\n if tryf > trym > trys and masha <= trys and likes(masha, trys) and not likes(masha, trym) and not likes(masha, tryf):\n print(tryf)\n print(trym)\n print(trys)\n sys.exit()\nprint(-1)", "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\na,b,c,d = ilele()\r\nfor i in range(a,2*a+1):\r\n\tfor j in range(b,2*b+1):\r\n\t\tfor k in range(c,2*c+1):\r\n\t\t\tif i>=a and 2*a>=i and j>=b and 2*b>=j and k>=c and 2*c>=k and i>j>k and d<=k and 2*d>=k and 2*d<i and 2*d<j:\r\n\t\t\t\tflag = 1\r\n\t\t\t\tprint(i)\r\n\t\t\t\tprint(j)\r\n\t\t\t\tprint(k)\r\n\t\t\t\texit(0)\r\nprint(-1)\r\n \r\n ", "import bisect\r\n\r\ndef 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\nv1, v2, v3, vm = map(int, input().split())\r\n\r\ns1_lo = max(v1, 2*vm+1)\r\ns1_hi = 2*v1\r\n\r\ns2_lo = max(v2, 2*vm+1)\r\ns2_hi = 2*v2\r\n\r\ns3_lo = max(v3, vm)\r\ns3_hi = min(2*v3, 2*vm)\r\nif s1_lo > s1_hi or s2_lo > s2_hi or s3_lo > s3_hi:\r\n print('-1')\r\nelse:\r\n s1 = s1_hi\r\n s2 = min(s1_hi-1, s2_hi)\r\n s3 = min(s2-1, s3_lo)\r\n if s1 <= s2 or s2 <= s3:\r\n print('-1')\r\n else:\r\n print(s1)\r\n print(s2)\r\n print(s3)", "v = [int(i) for i in input().split()]\r\nfor i in range(v[0], 2*v[0] + 1):\r\n for j in range(v[1], 2*v[1] + 1):\r\n for k in range(v[2], 2*v[2] + 1):\r\n if k >= v[-1] and 2*v[-1] >= k and i > j and j > k and 2*v[-1] < i and 2*v[-1] < j:\r\n print(i, j, k)\r\n exit()\r\nprint(-1)\r\n \r\n", "v1, v2, v3, vm = [int(i) for i in input().split()]\r\n\r\nf = False\r\nfor w1 in range(v1, 2 * v1 + 1):\r\n for w2 in range(v2, 2 * v2 + 1):\r\n for w3 in range(v3, 2 * v3 + 1):\r\n if (not f) and (w1 > w2 > w3) and (vm <= w3) and (vm * 2 >= w3) and (vm * 2 < w2) and (vm * 2 < w1):\r\n print(w1)\r\n print(w2)\r\n print(w3)\r\n f = True\r\n\r\nif not f:\r\n print(-1)\r\n ", "v1,v2,v3,v4=map(int,input().split())\r\nm1=v1*2\r\nm2=v2*2\r\nm3=max(v3,v4)\r\nif v3*2<m3 or v4*2<m3 or v4*2>=m2:\r\n print(-1)\r\n exit()\r\nprint(m1)\r\nprint(m2)\r\nprint(m3)\r\n", "A=list(map(int,input().split()))\r\nif A[3]<A[1] and A[2]/2<=A[3]<=A[2]*2:\r\n print(2*A[0])\r\n print(2*A[1])\r\n print(max(A[2],A[3]))\r\nelse:\r\n print(-1)", "p,m,s,h=map(int,input().split())\r\nt=max(s,h)\r\nif t>2*min(s,h) or h>=m:\r\n print(-1)\r\nelse:\r\n a=2*h+1\r\n ap,am=max(p,a),max(m,a)\r\n if am == ap:\r\n ap+=1\r\n print(ap,am, t)\r\n\r\n", "a,b,c,d=map(int,input().split())\r\nn=max(c,d)\r\nv=min(2*c,2*d)\r\nif (v-n)>=0 and n<2*b:\r\n razm=n\r\n if razm < 2*b and 2*b>d*2 and 2*b>c*2:\r\n print(2*a,2*b,razm)\r\n else:\r\n print(-1)\r\nelse:\r\n print(-1)\r\n", "\r\na,b,c,d = map(int,input().split())\r\nif b <= d or 2*c < d or 2*d < c:\r\n print(-1)\r\nelse:\r\n print(2*a)\r\n print(2*b)\r\n print(max(c,d))\r\n", "r = lambda : list(map(int,input().split()))\nv1 , v2 , v3 , m = r()\n\nif m > 2*v3 or v3 > 2*m or m >= v2:\n\tprint(-1)\nelse:\n\tprint(2*v1)\n\tprint(2*v2)\n\tprint(max(v3,m))\n\t\t", "p, m, s, h = map(int, input().split())\r\nif s > 2 * h or h > 2 * s or h >= m:\r\n print(-1)\r\nelse:\r\n print(2 * p, 2 * m, min(2 * s, 2 * h))", "a, b, c, d = map(int, input().split())\r\nfound = False\r\nx, y, z = -1, -1, -1\r\nfor i in range(201):\r\n for j in range(i + 1, 201):\r\n for k in range(j + 1, 201):\r\n if 2 * d >= i and 2 * c >= i:\r\n if j > 2 * d and k > 2 * d:\r\n if j > 2 * c and k > 2 * c:\r\n if 2 * a >= k and 2 * b >= j:\r\n if a <= k and b <= j and c <= i and d <= i:\r\n if not found:\r\n z, y, x = i, j, k\r\n found = True\r\nif found:\r\n print(x, y, z, sep='\\n')\r\nelse:\r\n print(-1)", "pai, mae, filho, maria = [int(x) for x in input().split(' ')]\r\n \r\n \r\ndef solve():\r\n if filho > 2*maria or maria > 2*filho or maria >= mae:\r\n return -1\r\n \r\n if filho > maria:\r\n return max(pai, 2*maria + 2), max(mae, 2*maria + 1), filho\r\n \r\n return max(pai, 2*maria + 2), max(mae, 2*maria + 1), maria\r\n \r\n \r\nx = solve()\r\nif x == -1:\r\n print(-1)\r\nelse:\r\n print(x[0])\r\n print(x[1])\r\n print(x[2])", "a=input()\r\na=a.split()\r\nw=max(int(a[2]),int(a[3]))\r\nfor i in range(4):\r\n a[i]=int(a[i])\r\nif (a[2]*2>=w)and(a[3]*2>=w)and(a[0]*2>a[3]*2)and(a[1]*2>a[3]*2):\r\n print(a[0]*2)\r\n print(a[1]*2)\r\n print(w)\r\nelse:\r\n print(-1)", "import sys\r\na, b, c, d = map(int, input().split())\r\n\r\nx, y, z = 2*a, 2*b, max(c, d)\r\n\r\nif (a <= x <= 2 * a) and (b <= y <= 2*b) and (max(c, d) <= z <= min(2*c, 2*d)) and x > 2*d and y > 2*d:\r\n print(x, y, z)\r\nelse:\r\n print(-1)\r\n", "v1,v2,v3,vm=map(int,input().split())\r\nif vm>2*v3:\r\n print(-1)\r\nelif 2*vm<v3:\r\n print(-1)\r\nelse:\r\n if (2*vm<2*v2):\r\n print(2*v1)\r\n print(2*v2)\r\n print(max(v3,vm))\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", "a=input().split()\r\nfor i in range(4):\r\n a[i]=int(a[i])\r\nif a[3]>=a[1] or a[2]*2<a[3] or a[3]*2<a[2]:\r\n print(-1)\r\nelse:\r\n print(a[0]*2)\r\n print(a[1]*2)\r\n if a[3]>=a[2]:\r\n print(a[3])\r\n else:\r\n print(a[2])\r\n", "a,b,c,d = [int(i) for i in input().split()]\r\nflag = False\r\nfor x in range(max(a,2*d+1),2*a+1):\r\n for y in range(max(b,2*d+1),2*b+1):\r\n for z in range(c,2*c+1):\r\n if x>y>z and d<=z and 2*d>=z:\r\n print(x,y,z)\r\n flag = True\r\n break\r\n if flag:\r\n break\r\n if flag:\r\n break\r\nelse:\r\n print(-1)\r\n", "V1,V2,V3,Vm=map(int,input().split())\r\nif (Vm>2*V3) or 2*Vm>=2*V2 or 2*Vm>=2*V1 or 2*Vm<V3:\r\n print(-1)\r\nelif 2*Vm>=2*V3:\r\n print(2*V1)\r\n print(2*V2)\r\n print(2*V3)\r\nelif 2*Vm>=V3:\r\n print(2*V1)\r\n print(2*V2)\r\n print(V3)", "a,b,c,d=[int(i) for i in input().split()]\r\nif d>2*c or c>d*2:\r\n print(-1)\r\nelse:\r\n if c>d:\r\n e=min(c,d*2)\r\n else:\r\n e=min(d,c*2)\r\n if d<=e+1 and d>=b:\r\n print(-1)\r\n else:\r\n print(2*a)\r\n print(2*b)\r\n print(e)", "father, mother, son, masha = map(int, input().split())\r\nif (masha>=mother or masha>2*son or son>2*masha):\r\n print(-1)\r\nelse:\r\n print(2*father)\r\n print(2*mother)\r\n print(min(2*son, 2*masha))", "#!/usr/bin/env python3\n\nvol = [int(i) for i in input().split(' ')]\nsmall = max(vol[2],vol[3])\nmiddle = 2*vol[1]\nlarge = 2*vol[0]\n\nres = 0\nif 2*vol[2] < vol[3]:\n res = -1\n\nif vol[2]>vol[3]:\n if vol[3]*2<vol[2]:\n res = -1\nelse:\n if vol[2]*2<vol[3]:\n res = -1\n\nif vol[3]*2>=middle:\n res = -1\n\nif small>=middle or middle>=large:\n res = -1\n\nif res<0:\n print(res)\nelse:\n print(large,middle,small,sep='\\n')\n", "v1,v2,v3,vm=map(int,input().split())\r\nfor a in range(vm,202):\r\n for b in range(a+1,202):\r\n for c in range(b+1,202):\r\n if a<=2*vm and a>=v3 and a<=2*v3 and b>2*vm and b>=v2 and b<=2*v2 and c>2*vm and c>=v1 and c<=2*v1:\r\n print(c,b,a,sep='\\n')\r\n exit()\r\nprint(-1) \r\n \r\n", "a,b,c,m = [int(i) for i in input().split()]\nac = a*2\nbc = b*2\ncc = -1\n\nif m >= a:\n ac = -1\n\nif m >= b:\n bc = -1\n\nif m <= c and c <= m*2:\n cc = m*2\nelif m > c and m <= c*2:\n cc = c*2\n\nif ac == -1 or bc == -1 or cc == -1:\n print(-1)\nelse:\n print(ac,bc,cc)\n", "def printCarros():\n for i in carros:\n print(i)\n\nu = [int(i) for i in input().split()]\nm = u[3]\n\nif (m*2 >= u[2] and m <= u[2] * 2 and m < u[1]):\n print(u[0]*2)\n print(u[1]*2)\n print(max(m,u[2]))\nelse:\n print(-1)\n\t\t\t\t \t\t\t\t\t\t \t\t\t\t\t \t", "v1, v2, v3, vm = map(int, input().split())\r\nx = v1 * 2\r\ny = v2 * 2\r\nz = min(2 * v3, 2 * vm)\r\nif vm <= z and vm * 2 >= z and y > vm * 2 and v3 <= z:\r\n print(x, y, z)\r\nelse:\r\n print(-1)\r\n", "v1, v2, v3, vm = map(int, input().split())\r\nf = False\r\nfor a in range(1, 201):\r\n for b in range(a + 1, 201):\r\n for c in range(b + 1, 201): \r\n if a >= max(vm, v3) and b >= max(vm, v2) and c >= max(vm, v1):\r\n if a <= 2 * v3 and b <= 2 * v2 and c <= 2 * v1:\r\n if b > 2 * vm and c > 2 * vm and a <= 2 * vm:\r\n print(c)\r\n print(b)\r\n print(a)\r\n f = True\r\n break\r\n if f:\r\n break\r\n if f:\r\n break \r\n \r\nif not f:\r\n print(-1)\r\n", "def main():\r\n v1, v2, v3, vm = map(int, input().split())\r\n\r\n for a1 in range(v1, 2 * v1 + 1):\r\n for a2 in range(v2, min(a1, 2 * v2 + 1)):\r\n for a3 in range(v3, min(a2, 2 * v3 + 1)):\r\n if (vm <= a3 <= 2 * vm and\r\n not (vm <= a2 <= 2 * vm) and\r\n not (vm <= a2 <= 2 * vm)):\r\n print(a1)\r\n print(a2)\r\n print(a3)\r\n return\r\n\r\n print(-1)\r\n\r\n\r\nmain()\r\n" ]

[ "import sys\n\nn, k = map(int, input().split(' '))\n\ns = input()\n\ndef max_streak(s):\n result = 0\n\n for i in range(len(s)):\n j = i\n while j < len(s) and s[j] == 'N':\n j += 1\n\n result = max(result, j - i)\n\n return result\n\nfor i in range(n - k + 1):\n cur = list(s)\n for j in range(i, i + k):\n if cur[j] == '?':\n cur[j] = 'N'\n\n for j in range(i):\n if cur[j] == '?':\n cur[j] = 'Y'\n\n for j in range(i + k, n):\n if cur[j] == '?':\n cur[j] = 'Y'\n\n if max_streak(cur) == k:\n print('YES')\n sys.exit(0)\n\nprint('NO')\n", "import sys\r\n# sys.stdin = open(\"actext.txt\",\"r\")\r\n \r\nn,k = map(int,input().split())\r\ns = input()\r\ndp = [-1 for i in range(n+1)]\r\ncount = 0\r\nmxcount = 0\r\nfor i in s:\r\n if(i=='N'):\r\n count+=1\r\n else:\r\n if(mxcount<count):\r\n mxcount = count\r\n count = 0\r\n \r\nif(mxcount<count):\r\n mxcount = count\r\n \r\nstatus = 0\r\nif(mxcount>k):\r\n print(\"NO\")\r\n status = 1\r\nelif(mxcount==k):\r\n print(\"YES\")\r\nelse:\r\n s = s+\"Y\"\r\n # print(s)\r\n for i in range(k,n+1):\r\n if(s[i]!='N' and s[i-k-1]!='N'):\r\n temp = False\r\n # print(s[i-k:i])\r\n for j in range(i-k,i):\r\n if(s[j]=='Y'):\r\n temp = True\r\n break\r\n # print(temp)\r\n if(not temp):\r\n print(\"YES\")\r\n exit()\r\n print(\"NO\")", "l = input().split(' ')\r\nn = int(l[0])\r\nk = int(l[1])\r\ns = input()\r\nans = False\r\n \r\nfor i in range(0, n - k + 1):\r\n \r\n flag = False\r\n \r\n l = i\r\n r = i + k\r\n \r\n if l > 0 and s[l - 1] == 'N' or r < n and s[r] == 'N':\r\n continue\r\n \r\n for j in range(l, r):\r\n if s[j] == 'Y':\r\n flag = True\r\n break\r\n \r\n if flag:\r\n continue\r\n \r\n maxc = 0\r\n\r\n pre = 'Y'\r\n cnt = 0\r\n for j in range(0, l):\r\n if s[j] == pre:\r\n cnt += 1\r\n else:\r\n cnt = 1\r\n if(s[j] == 'N'):\r\n maxc = max(maxc, cnt)\r\n pre = s[j]\r\n \r\n pre = 'Y'\r\n cnt = 0\r\n for j in range(r, n):\r\n if s[j] == pre:\r\n cnt += 1\r\n else:\r\n cnt = 1\r\n if(s[j] == 'N'):\r\n maxc = max(maxc, cnt)\r\n pre = s[j]\r\n \r\n if maxc > k:\r\n continue\r\n \r\n ans = True\r\n break\r\n\r\nif ans:\r\n print('YES\\n')\r\nelse:\r\n print('NO\\n')\r\n ", "n, k = map(int, input().split())\r\ns = input()\r\n\r\ncnt, mx = 0, 0\r\n\r\nfor i in range(n):\r\n if s[i] == \"N\":\r\n cnt += 1\r\n else:\r\n cnt = 0\r\n mx = max(mx, cnt)\r\n \r\nif mx > k:\r\n print(\"NO\\n\")\r\n exit()\r\n\r\nfor r in range(k, n + 1):\r\n l = r - k\r\n if l > 0 and s[l - 1] == \"N\":\r\n continue\r\n if r < n and s[r] == \"N\":\r\n continue\r\n \r\n bad = False\r\n \r\n for i in range(l, r):\r\n if s[i] == \"Y\":\r\n bad = True\r\n break\r\n \r\n if not bad:\r\n print(\"YES\\n\")\r\n exit()\r\n\r\nprint(\"NO\\n\")\r\n", "class Solver:\r\n def __init__(self):\r\n pass\r\n\r\n def solve(self):\r\n n, k = map(int, input().split())\r\n s = input()\r\n dp = [[[False for _ in range(n+1)] for _ in range(n+1)] for _ in range(n+1)]\r\n dp[0][0][0] = True\r\n for pos in range(n):\r\n for streak in range(n+1):\r\n for mx in range(n+1):\r\n if not dp[pos][streak][mx]:\r\n continue\r\n #print(pos, streak, mx)\r\n if s[pos] == 'N' or s[pos] == '?':\r\n dp[pos+1][streak+1][max(mx, streak+1)] = True\r\n if s[pos] == 'Y' or s[pos] == '?':\r\n dp[pos+1][0][mx] = True\r\n for streak in range(n+1):\r\n if dp[n][streak][k]:\r\n print('YES')\r\n return\r\n print('NO')\r\n\r\n\r\nif __name__ == '__main__':\r\n s = Solver()\r\n s.solve()\r\n", "from sys import stdin\r\nfrom functools import lru_cache\r\nfrom collections import defaultdict\r\ninfile = stdin\r\nN, K = map(int, infile.readline().split())\r\nwatched = infile.readline().strip()\r\n\r\nmem = set()\r\nmem.add((0,0,0))\r\nfor i, letter in enumerate(watched):\r\n for d in range(K+1):\r\n for c in range(K+1):\r\n if (i,d,c) in mem:\r\n if letter in ('N', '?'):\r\n mem.add((i+1, max(d, c+1), c+1))\r\n if letter in ('Y', '?'):\r\n mem.add((i+1, d, 0))\r\n\r\ndef good():\r\n for i,d,c in mem:\r\n if i == N and d == K:\r\n return 'YES'\r\n return 'NO'\r\n\r\n\r\nprint(good())", "import sys\r\nimport math\r\n\r\ndp = [[[-1 for x in range(102)] for x in range(102)] for x in range(102)]\r\n\r\ndef F(sequence, n, k, i, l, m):\r\n\tif (l > m):\r\n\t\tm = l\r\n\tif (i == n):\r\n\t\tif (m == k):\r\n\t\t\treturn 1\r\n\t\telse:\r\n\t\t\treturn 0\r\n\tif (dp[i][l][m] != -1):\r\n\t\treturn dp[i][l][m]\r\n\t\r\n\tres = 0\r\n\tif (sequence[i] != 'N'):\r\n\t\tx = F(sequence, n, k, i + 1, 0, m)\r\n\t\tif (x == 1):\r\n\t\t\tres = 1\r\n\t\r\n\tif (sequence[i] != 'Y'):\r\n\t\tx = F(sequence, n, k, i + 1, l + 1, m)\r\n\t\tif (x == 1):\r\n\t\t\tres = 1\r\n\t\r\n\tdp[i][l][m] = res\r\n\treturn res\r\n\r\ndef main():\r\n\tn, k = map(int, input().split())\r\n\tsequence = input()\r\n\t\r\n\tres = F(sequence, n, k, 0, 0, 0)\r\n\tif (res == 0):\r\n\t\tprint(\"NO\")\r\n\telse:\r\n\t\tprint(\"YES\")\r\n\r\n\treturn 0\r\n\r\nif __name__ == '__main__':\r\n\tmain()\r\n\r\n" ]

[ "n, k = map(int, input().split())\na = list(map(int, input().split()))\ninventory = set()\nbought = 0\nfor i in range(n):\n if a[i] not in inventory:\n if len(inventory) == k:\n farthest_time = 0\n farthest = 0\n for v in inventory:\n try:\n far = a.index(v, i + 1)\n if far > farthest_time:\n farthest_time = far\n farthest = v\n except ValueError:\n farthest_time = 10000\n farthest = v\n inventory.remove(farthest)\n inventory.add(a[i])\n bought += 1\n\nprint(bought)\n", "import sys\r\ninput = sys.stdin.readline\r\nfrom collections import deque, defaultdict\r\nn, k = map(int, input().split())\r\nA = list(map(int, input().split()))\r\ndic = defaultdict(deque)\r\nfor i, a in enumerate(A):\r\n dic[a].append(i)\r\nS = set()\r\nans = 0\r\nfor i, a in enumerate(A):\r\n for d in dic:\r\n while dic[d] and dic[d][0] <= i:\r\n dic[d].popleft()\r\n if a not in S:\r\n if len(S) < k:\r\n S.add(a)\r\n ans += 1\r\n else:\r\n day = i\r\n for s in S:\r\n if s not in dic or not dic[s]:\r\n idx = s\r\n break\r\n else:\r\n if dic[s][0] > day:\r\n day = dic[s][0]\r\n idx = s\r\n S.remove(idx)\r\n S.add(a)\r\n ans += 1\r\nprint(ans)" ]

[ "n, k = [int(x) for x in input().split()]\r\n\r\nps = [int(x) for x in input().split()]\r\n\r\nmapping = [-1 for _ in range(256)]\r\n\r\nres = []\r\nfor p in ps:\r\n if mapping[p] == -1:\r\n j = p - k + 1\r\n while j < 0 or (mapping[j] != -1 and mapping[j] + k <= p):\r\n j += 1\r\n for i in range(j, p+1):\r\n mapping[i] = j\r\n \r\n res.append(mapping[p])\r\nprint(\" \".join(map(str, res)))\r\n", "def get_best_color(pixel):\r\n best_color = pixel-max_group_length+1\r\n return best_color if best_color > 0 else 0\r\n\r\n\r\ndef get_used_color(pixel):\r\n best_color = get_best_color(pixel)\r\n for color in range(pixel, best_color-1, -1):\r\n if color in colors:\r\n return color\r\n for color in range(get_best_color(best_color), best_color):\r\n if color in colors and colors[color] >= best_color:\r\n return colors[color]+1\r\n return best_color\r\n\r\n\r\npixels_number, max_group_length = map(int, input().split())\r\npixels = map(int, input().split())\r\nposterized_pixels = []\r\nposterized_colors = {}\r\ncolors = {}\r\nfor pixel in pixels:\r\n if not pixel in posterized_colors:\r\n used_color = get_used_color(pixel)\r\n colors[used_color] = max(pixel, colors.get(used_color, -1))\r\n posterized_colors[pixel] = used_color\r\n posterized_pixels.append(posterized_colors[pixel])\r\nprint(*posterized_pixels)\r\n", "n, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\nrange1 = [-1]*256\r\nfinal= [0]*n\r\nfor i in range(n):\r\n if (range1[a[i]] == -1):\r\n for j in range(a[i], max(-1, a[i]-k), -1):\r\n if (range1[j] != -1):\r\n if (range1[j] +k) > a[i]:\r\n\t # print(\"@\")\r\n range1[a[i]] = range1[j]\r\n else:\r\n\t #print(\"Dhukeche\")\r\n range1[a[i]] = j+1\r\n break\r\n\t\t#print(range1)\r\n if range1[a[i]] == -1:\r\n range1[a[i]] = max(0, a[i]-k+1)\r\n for xx in range(range1[a[i]], a[i]):\r\n range1[xx] = range1[a[i]]\r\n final[i] = range1[a[i]]\r\nprint(*final)", "import sys,os,io\r\nimport math \r\nfrom collections import defaultdict\r\ndef ii():\r\n return int(input())\r\ndef li():\r\n return list(map(int,input().split()))\r\nif(os.path.exists('input.txt')):\r\n sys.stdin = open(\"input.txt\",\"r\") ; sys.stdout = open(\"output.txt\",\"w\") \r\nelse:\r\n input = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\n\r\nn,k = li()\r\np = li()\r\ngroup = [-1]*256\r\nans = []\r\nfor i in range(n):\r\n if group[p[i]]!=-1:\r\n ans.append(group[p[i]])\r\n continue\r\n prev = -1\r\n for j in range(p[i],-1,-1):\r\n if j == p[i] - k :\r\n break\r\n if group[j]!=-1:\r\n if k - (j - group[j]+1) - (p[i] - j) <0:\r\n break\r\n prev = j \r\n break \r\n y = -1\r\n for j in range(p[i],-1,-1):\r\n if group[j]!=-1:\r\n y = j \r\n break \r\n if prev==-1:\r\n val = max(y+1,p[i]-k+1)\r\n ind = - 1 \r\n for j in range(max(y+1,p[i]-k+1),p[i]+1):\r\n group[j] = val\r\n ans.append(val)\r\n else:\r\n for j in range(prev+1,p[i]+1):\r\n group[j] = group[prev]\r\n ans.append(group[p[i]])\r\nprint(*ans)\r\n\r\n", "n, k = list(map(int, input().split()))\r\np = list(map(int, input().split()))\r\nprocessed = set()\r\ncolor = {}\r\nlength = {}\r\nans = []\r\n\r\ndef exists(p, elt, d):\r\n for e in p:\r\n if e > elt:\r\n if e <= elt + d:\r\n return True\r\n elif e - d <= elt + d:\r\n return False\r\n return False\r\n\r\ndef exists2(p, elt, d):\r\n for e in p:\r\n if e > elt:\r\n if e <= elt + d:\r\n return False\r\n elif e - d <= elt + d:\r\n return [True, e - d]\r\n return False\r\n \r\n\r\nfor i in range(n):\r\n elt = p[i]\r\n if elt in processed:\r\n ans.append(color[elt])\r\n else:\r\n processed.add(elt)\r\n new = 1\r\n run = True\r\n for j in range(1, k):\r\n if elt - j < 0:\r\n break\r\n elif (elt - j) not in processed:\r\n processed.add(elt - j)\r\n new += 1\r\n elif length[elt - j] + new <= k:\r\n for i2 in range(length[elt - j] + new):\r\n color[elt - i2] = color[elt - j]\r\n length[elt] = length[elt - j] + new\r\n run = False\r\n break\r\n else:\r\n break\r\n if run:\r\n for j in range(new):\r\n color[elt - j] = elt - new + 1\r\n length[elt] = new\r\ns = str(color[p[0]])\r\nfor elt in p[1:]:\r\n s += ' ' + str(color[elt])\r\nprint(s)\r\n\r\n", "n, k = map(int, input().split())\r\nP = map(int, input().split())\r\n\r\nparent = list(range(256))\r\nsz = [1] * 256\r\ndef rt(x):\r\n if x != parent[x]:\r\n parent[x] = rt(parent[x])\r\n return parent[x]\r\n\r\ndef u(rx, ry):\r\n parent[ry] = rx\r\n sz[rx] += sz[ry]\r\n\r\nans = [0] * n\r\nfor i, p in enumerate(P):\r\n rx = rt(p)\r\n while rx > 0 and sz[rx] + sz[rt(rx - 1)] <= k: \r\n u(rt(rx - 1), rx)\r\n rx = rt(p)\r\n ans[i] = rt(p)\r\nprint(' '.join(map(str, ans)))\r\n", "def solution(n, k, arr):\r\n ret = []\r\n grp = [None for _ in range(256)]\r\n for i in arr:\r\n if grp[i]:\r\n continue\r\n l = None\r\n j = 1\r\n for j in range(1, k):\r\n if i - j < 0:\r\n break\r\n if grp[i - j] is not None:\r\n l = i - j\r\n break\r\n if l is not None and grp[l] > i - k:\r\n grp[i] = grp[l]\r\n else:\r\n ll = l + 1 if l else max(0, i - k + 1)\r\n for j in range(ll, i + 1):\r\n grp[j] = ll\r\n for i in arr:\r\n ret.append(grp[i])\r\n return ret\r\n\r\n\r\nn, k = map(int, input().split())\r\narr = list(map(int, input().split()))\r\nprint(' '.join(map(str, solution(n, k, arr))))\r\n", "def main():\r\n n, k = map(int, input().split())\r\n pixels = list(map(int, input().split()))\r\n\r\n colors = [-1] * 256\r\n colors[0] = 0\r\n\r\n for p in pixels:\r\n if colors[p] != -1:\r\n continue\r\n\r\n i = p - 1\r\n while i > max(0, p - k + 1) and colors[i] == -1:\r\n i -= 1\r\n\r\n g = colors[i]\r\n if g != -1 and g > p - k:\r\n for j in range(i + 1, p + 1):\r\n colors[j] = g\r\n\r\n if colors[p] == -1:\r\n g = max(i if colors[i] == -1 else i + 1, p - k + 1)\r\n for j in range(g, p + 1):\r\n colors[j] = g\r\n\r\n for p in pixels:\r\n print(colors[p], end=' ')\r\n\r\n\r\nmain()\r\n", "n,k=map(int,input().split())\r\nl1=list(map(int,input().split()))\r\n\r\nassigned={}\r\nresult=[0]*n\r\ni=0\r\nfor i in range(n):\r\n flag=0\r\n x=k\r\n if l1[i] not in assigned:\r\n temp=l1[i]\r\n to_assign=[]\r\n while temp>=0 and x>0 and temp not in assigned:\r\n to_assign.append(temp)\r\n x-=1\r\n temp-=1\r\n if temp in assigned:\r\n if assigned[temp][1]+len(to_assign)<=k:\r\n for item in to_assign:\r\n assigned[item]=(assigned[temp][0],assigned[temp][1]+len(to_assign))\r\n else :\r\n y=min(to_assign)\r\n for item in to_assign:\r\n assigned[item]=(y,len(to_assign))\r\n else :\r\n \r\n y=min(to_assign)\r\n for item in to_assign:\r\n assigned[item]=(y,len(to_assign))\r\n result[i]=assigned[l1[i]][0] \r\n\r\nprint(*result,sep=\" \")", "n, k = map(int, input().split())\np = list(map(int, input().split()))\n\nranged = [None] * 256\ncheck = False\ncheck1 = False\n\nfor i in range(256):\n ranged[i] = [0, None]\n\nresult = \"\"\n\nfor i, pi in enumerate(p):\n if ranged[pi][0] == 2:\n idx = pi\n\n while ranged[idx][0] == 2:\n ranged[idx][0] = 1\n idx -= 1\n elif ranged[pi][0] == 0:\n # find lowest possible value for pi\n idx = pi\n count = 0\n\n while idx > 0 and ranged[idx - 1][0] != 1 and count < k - 1:\n idx -= 1\n count += 1\n\n lowest = idx\n\n while idx <= pi and idx < 256:\n ranged[idx][0] = 1\n ranged[idx][1] = lowest\n idx += 1\n\n while count < k - 1 and idx < 256 and ranged[idx][0] != 1:\n ranged[idx][0] = 2\n ranged[idx][1] = lowest\n idx += 1\n count += 1\n # print(count, k - 1)\n\n # print(ranged)\n # if pi == 155:\n # for i, r in enumerate(ranged):\n # print(i, r)\n # check1 = True\n\n # if ranged[149][1] != 149 and not check and check1:\n # print(pi)\n # for i, r in enumerate(ranged):\n # print(i, r)\n # check = True\n\n # print(ranged)\n\n result += str(ranged[pi][1]) + \" \"\n \n \n# print(ranged)\nprint(result[:-1])", "import sys,os,io\r\nimport math \r\nfrom collections import defaultdict\r\ndef ii():\r\n return int(input())\r\ndef li():\r\n return list(map(int,input().split()))\r\nif(os.path.exists('input.txt')):\r\n sys.stdin = open(\"input.txt\",\"r\") ; sys.stdout = open(\"output.txt\",\"w\") \r\nelse:\r\n input = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\nn,k = li()\r\np = li()\r\ngroup = [-1]*256\r\nans = []\r\nfor i in range(n):\r\n if group[p[i]]!=-1:\r\n ans.append(group[p[i]])\r\n continue\r\n prev = -1\r\n for j in range(p[i],-1,-1):\r\n if j == p[i] - k :\r\n break\r\n if group[j]!=-1:\r\n if k - (j - group[j]+1) - (p[i] - j) <0:\r\n break\r\n prev = j \r\n break \r\n y = -1\r\n for j in range(p[i],-1,-1):\r\n if group[j]!=-1:\r\n y = j \r\n break \r\n if prev==-1:\r\n val = max(y+1,p[i]-k+1)\r\n ind = - 1 \r\n for j in range(max(y+1,p[i]-k+1),p[i]+1):\r\n group[j] = val\r\n ans.append(val)\r\n else:\r\n for j in range(prev+1,p[i]+1):\r\n group[j] = group[prev]\r\n ans.append(group[p[i]])\r\n# print(*group)\r\n\r\nfor i in range(256):\r\n if group[i]==-1 and i>0 and group[i-1]>=0:\r\n if (i-1) - group[i-1] + 1 <k:\r\n group[i] = group[i-1]\r\n \r\ncnt = 0\r\nprev = -1\r\nfor i in range(256):\r\n if group[i]==-1:\r\n if cnt==k or prev==-1:\r\n cnt = 1 \r\n group[i] = i \r\n prev = i \r\n else:\r\n cnt += 1 \r\n group[i] = prev \r\n else:\r\n cnt = k\r\n\r\n\r\n\r\n# print(*group)\r\nprint(*ans)\r\n\r\n\r\n# def solve (N, R, S, Marks):\r\n# # write your code here\r\n# pass\r\n \r\n# N = int(input())\r\n# R = int(input())\r\n# S = int(input())\r\n# Marks = list(map(int, input().split()))\r\n \r\n# out_ = solve(N, R, S, Marks)\r\n# for i_out_ in out_:\r\n# print (' '.join(map(str, i_out_)))", "N, K = input().split()\nN, K = int(N), int(K)\nP = [int(x) for x in input().split()]\nA = [None]*256\nA[0] = 0\nfor i in range(N):\n pn = P[i]\n if A[pn] is None:\n for j in range(K-1, -1, -1):\n if pn < j: continue\n if A[pn-j] is None:\n A[pn-j] = pn-j\n break\n else:\n if A[pn-j] + K - 1 >= pn:\n break\n for jj in range(j, -1, -1):\n A[pn-jj] = A[pn-j]\nprint(*[A[P[i]] for i in range(N)])\n", "\r\ndef solve():\r\n num_pixels, max_group_size = (int(x) for x in input().split())\r\n pixels = [int(x) for x in input().split()]\r\n groups = [None for _ in range(256)]\r\n\r\n for pixel in pixels:\r\n if groups[pixel] is None:\r\n smallest_of_group = pixel\r\n while smallest_of_group >= 0 and smallest_of_group > pixel - max_group_size and groups[smallest_of_group] is None:\r\n smallest_of_group -= 1\r\n\r\n if smallest_of_group >= 0 and groups[smallest_of_group] is not None and pixel - groups[smallest_of_group] + 1 <= max_group_size:\r\n group_color = groups[smallest_of_group]\r\n else:\r\n group_color = smallest_of_group + 1\r\n smallest_of_group += 1\r\n for color in range(smallest_of_group, pixel + 1):\r\n groups[color] = group_color\r\n\r\n print(*(groups[pixel] for pixel in pixels))\r\n\r\nsolve()\r\n", "n,k = list(map(int,input().split()))\r\na = list(map(int,input().split()))\r\ncent = [1]*256\r\nf = [x for x in range(256)]\r\nans = [None]*n\r\ndef find(x):\r\n if f[x]==x:\r\n return x\r\n else:\r\n return find(f[x])\r\ndef union(x,y):\r\n f1 = find(x)\r\n f2 = find(y)\r\n if f1!=f2:\r\n f[max(f1,f2)]=min(f1,f2)\r\nfor i in range(n):\r\n for j in range(a[i]-1,max(0,a[i]-k)-1,-1):\r\n if cent[find(a[i])]+cent[find(j)]<=k and find(j)!=find(a[i]):\r\n x1 = find(a[i])\r\n x2 = find(j)\r\n union(x1,x2)\r\n cent[find(a[i])] = cent[x1]+cent[x2]\r\n else:\r\n break\r\n ans[i] = find(a[i])\r\nprint(*ans)", "from bisect import bisect_left, bisect_right\r\n\r\ndef tuple_input(type):\r\n return map(type, input().strip().split())\r\n\r\n\r\n'''\r\n'''\r\nn, k = tuple_input(int)\r\np = list(tuple_input(int))\r\ns = [-1] * 256\r\nseg = dict()\r\nfor i in range(n):\r\n if s[p[i]] == -1:\r\n lef = p[i] \r\n while p[i] - lef < k and lef >= 0 and s[lef] == -1:\r\n lef -= 1\r\n lef += 1\r\n if lef > 0 and p[i] - (lef - 1) < k and p[i] - s[lef - 1] < k:\r\n lef = s[lef - 1]\r\n for j in range(lef, p[i] + 1):\r\n s[j] = lef\r\nres = list()\r\nfor i in range(n):\r\n res.append(s[p[i]])\r\nprint(' '.join(map(str, res)))", "n, k = [int(i) for i in input().split()]\np = [int(i) for i in input().split()]\nans = [-1] * (max(p) + 1)\nans[0] = 0\nfor i in range(n):\n\tif ans[p[i]] < 0:\n\t\tposition = p[i] - k + 1\n\t\tfor j in range(max(0,p[i] - k + 1), p[i] + 1):\n\t\t\tif ans[j] < 0:\n\t\t\t\tposition = j\n\t\t\t\tbreak\n\t\tj = max(0, position - 1)\n\t\tkey = ans[j]\n\t\tcount = 0\n\t\twhile j >= 0:\n\t\t\tif ans[j] != key:\n\t\t\t\tposition1 = j + 1\n\t\t\t\tbreak\n\t\t\tj -= 1\n\t\t\tcount += 1\n\t\tif count + p[i] + 1 - position > k:\n\t\t\tkey = position\n\t\tfor j in range(position, p[i] + 1):\n\t\t\tans[j] = key\n\nfor i in range(n):\n\tif i != len(p) - 1:\n\t\twk1 = \" \"\n\telse:\n\t\twk1 = \"\\n\"\n\tprint(ans[p[i]], end = wk1)\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\n\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\ndef strinp(testcases):\r\n k = 5\r\n if (testcases == -1 or testcases == 1):\r\n k = 1\r\n f = str(input())\r\n f = f[2:len(f) - k]\r\n return f\r\n \r\ndef main():\r\n n,k=map(int,input().split())\r\n arr=list(map(int, input().split()))\r\n taken=[-1]*256\r\n ans=[-1]*n\r\n groups={}\r\n for i in range(n):\r\n if(taken[arr[i]]!=-1):\r\n ans[i]=groups[taken[arr[i]]][0]\r\n continue\r\n st=max(0,arr[i]-k+1)\r\n while(True):\r\n if(taken[st]==-1):\r\n for j in range(st,arr[i]+1):\r\n taken[j]=len(groups)\r\n groups[len(groups)]=[st,arr[i]]\r\n ans[i]=st\r\n break\r\n f=groups[taken[st]]\r\n if(arr[i]-f[0]+1<=k):\r\n groups[taken[st]]=[f[0],arr[i]]\r\n for j in range(f[1]+1,arr[i]+1):\r\n taken[j]=taken[st]\r\n ans[i]=st\r\n break\r\n st+=1\r\n print(*ans)\r\nmain()", "n, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\nc = [-1]*256\r\n\r\nans = [0]*n\r\nfor i in range(n):\r\n if c[a[i]] == -1:\r\n for j in range(a[i], max(-1, a[i]-k), -1):\r\n if c[j] != -1:\r\n if (c[j] +k) > a[i]:\r\n c[a[i]] = c[j]\r\n else:\r\n c[a[i]] = j+1\r\n break\r\n if c[a[i]] == -1:\r\n c[a[i]] = max(0, a[i]-k+1)\r\n for xx in range(c[a[i]], a[i]):\r\n c[xx] = c[a[i]]\r\n ans[i] = str(c[a[i]])\r\n\r\nprint(' '.join(ans))\r\n", "def main():\r\n n, k = map(int, input().split())\r\n p = list(map(int, input().split()))\r\n solve(n, k, p)\r\n\r\ndef solve(n, k, p):\r\n group = 256 * [None]\r\n r = p[:]\r\n for i, pi in enumerate(p):\r\n# print([(i, gi) for i, gi in enumerate(group)if gi is not None])\r\n if group[pi] is not None:\r\n r[i] = group[pi][0]\r\n else:\r\n lo = pi\r\n while lo >= 0 and pi - lo < k and group[lo] is None:\r\n lo -= 1\r\n if lo < 0 or pi - lo == k:\r\n lo += 1\r\n hi = pi + 1\r\n else: # group[lo] is not None\r\n if pi - group[lo][0] < k:\r\n lo = group[lo][0]\r\n hi = pi + 1\r\n else:\r\n lo += 1\r\n hi = pi + 1\r\n lohi = (lo, hi)\r\n for j in range(lo, hi):\r\n group[j] = lohi\r\n r[i] = group[pi][0]\r\n print(\" \".join(map(str, r)))\r\n\r\nmain()\r\n", "import math\r\nimport random\r\nimport time\r\n\r\ndef init_tree(n):\r\n return [0] * (n + 1)\r\n\r\ndef update(tree, i, val):\r\n i += 1\r\n while i < len(tree):\r\n tree[i] += val\r\n i += i & -i\r\n\r\ndef range_update(tree, l, r, val):\r\n update(tree, l, val)\r\n update(tree, r + 1, -val)\r\n\r\ndef query(tree, i):\r\n i += 1\r\n res = 0\r\n while i > 0:\r\n res += tree[i]\r\n i -= i & -i\r\n return res\r\n\r\n\r\n \r\n#start_time=time.time()\r\n#zz=int(input())\r\nfor gg in range(1):\r\n dictionar={}\r\n answ=[]\r\n #n=int(input())\r\n \r\n n,k=list(map(int,input().split()))\r\n vector=list(map(int,input().split()))\r\n # vector=[]\r\n # n=10**5\r\n # k=15\r\n # print(\"k=\",k)\r\n # for q in range(n):\r\n# nr=random.randint(1,256)\r\n # vector.append(nr)\r\n\r\n# end_time=time.time()\r\n# print(end_time-start_time)\r\n\r\n plin=[]\r\n for i in range(n):\r\n #print(dictionar)\r\n if vector[i] in dictionar:\r\n answ.append(dictionar[vector[i]])\r\n else:\r\n minimul=300\r\n for j in range(vector[i],max(-1,vector[i]-k),-1):\r\n if j in dictionar:\r\n if vector[i]-dictionar[j]+1<=k:\r\n minimul=dictionar[j]\r\n \r\n break\r\n else:\r\n minimul=j\r\n for j in range(vector[i],minimul-1,-1):\r\n dictionar[j]=minimul\r\n answ.append(minimul)\r\n # print(vector) \r\n print(*answ) \r\n #print(dictionar) \r\n \r\n \r\n ", "n,k=map(int,input().split())\r\narr=list(map(int,input().split()))\r\npar=[i for i in range(260)]\r\npath=[-1 for i in range(260)]\r\nfor i in range(n):\r\n j=arr[i]\r\n if path[j] >=0:\r\n par[j] =par[path[j]]\r\n continue\r\n jump=1\r\n while j>0 and path[j] ==-1 and jump <k:\r\n path[j] =arr[i]\r\n j-=1\r\n jump +=1\r\n if arr[i] -par[j] +1 <=k:\r\n par[arr[i]] =par[j]\r\n path[j] =arr[i]\r\n else:\r\n par[arr[i]] =par[j+1]\r\nfor i in range(n):\r\n print(par[arr[i]],end=' ')\r\nprint()", "R = lambda: map(int, input().split())\r\n \r\nn, k = R()\r\na = list(range(0, 257)); v = [1]*257\r\nfor p in R():\r\n if v[p]:\r\n t = p\r\n while t >= 0 and p-a[t]<=k-1: t -= 1\r\n t += 1\r\n for i in range(t, p+1): a[i] = a[t]; v[i] = 0\r\n print(a[p], end=' ')" ]

[ "def get(a):\r\n global m\r\n R = -1\r\n G = -1\r\n mi = -1\r\n for i in range(m):\r\n if a[i] == '-':\r\n mi = i\r\n elif a[i] == \"R\":\r\n R = i\r\n else:\r\n G = i\r\n return G, R, mi\r\n\r\n\r\nn, m, k = map(int, input().split())\r\ndraw = [0, 0]\r\nt = []\r\nfor i in range(n):\r\n G, R, mi = get(input())\r\n if G == -1:\r\n if R != -1 and mi != -1:\r\n draw[1] = 1\r\n elif R == -1:\r\n if mi != -1:\r\n draw[0] = 1\r\n else:\r\n t.append(abs(G - R) - 1)\r\nif not t:\r\n if not draw[0]:\r\n print(\"Second\")\r\n elif not draw[1]:\r\n print(\"First\")\r\n else:\r\n print(\"Draw\")\r\n exit()\r\nwinner = 1\r\nfor bit in range(7):\r\n tmp = 0\r\n for i in range(len(t)):\r\n tmp += t[i] & 1\r\n t[i] >>= 1\r\n if tmp % (k + 1) != 0:\r\n winner = 0\r\n break\r\ndraw[winner] = 0\r\nif draw[1 - winner]:\r\n print(\"Draw\")\r\nelse:\r\n print(\"First\" if winner == 0 else \"Second\")" ]

[ "n = int(input())\r\nc = [list(map(int, input().split())) for _ in range(n)]\r\na, b = 0, 0\r\nd = []\r\nfor i in range(n):\r\n if len(c[i]) % 2:\r\n a += sum(c[i][1:c[i][0]//2+1])\r\n b += sum(c[i][c[i][0]//2+1:])\r\n else:\r\n a += sum(c[i][1:c[i][0]//2+1])\r\n b += sum(c[i][c[i][0]//2+2:])\r\n d.append(c[i][c[i][0]//2+1])\r\nd.sort(reverse=True)\r\nprint(a+sum(d[0::2]), b+sum(d[1::2]))", "chef_sum = 0\r\nramsay_sum = 0\r\nodds_mids = []\r\nfor n in range(int(input())):\r\n c, *c_list = map(int, input().split())\r\n if c%2 == 1:\r\n odds_mids.append(c_list.pop(c//2))\r\n for index,element in enumerate(c_list):\r\n if index < len(c_list)/2:\r\n chef_sum += element\r\n else:\r\n ramsay_sum += element\r\nodds_mids.sort(reverse = True)\r\nfor index, element in enumerate(odds_mids):\r\n if index%2 == 0:\r\n chef_sum += element\r\n else:\r\n ramsay_sum += element\r\nprint(chef_sum, ramsay_sum)", "import collections\r\nimport math\r\nimport sys\r\nneed_two = 0\r\ndef main():\r\n n = int(input())\r\n odds = []\r\n first = 0\r\n second = 0\r\n for i in range(n):\r\n c = list(map(int, input().split()))[1:]\r\n if len(c) % 2 == 1:\r\n odds.append(c[len(c) // 2])\r\n first += sum(c[:len(c) // 2])\r\n second += sum(c[len(c) // 2 + 1:])\r\n else:\r\n first += sum(c[:len(c) // 2])\r\n second += sum(c[len(c) // 2:])\r\n odds = sorted(odds)[::-1]\r\n for i in range(len(odds)):\r\n if i % 2 == 0:\r\n first += odds[i]\r\n else:\r\n second += odds[i]\r\n print(first, second)\r\n\r\n\r\n\r\n\r\n\r\nif __name__ == \"__main__\":\r\n t = 1 # int(input())\r\n while t > 0:\r\n main()\r\n t -= 1\r\n", "n = int(input())\r\na = 0\r\nb = 0\r\nmiddle = []\r\nfor i in range(n):\r\n arr = list(map(int, input().split()))[1:]\r\n m = len(arr) // 2\r\n if len(arr) % 2 == 0:\r\n a += sum(arr[:m])\r\n b += sum(arr[m:])\r\n else:\r\n a += sum(arr[:m])\r\n b += sum(arr[m + 1:])\r\n middle.append(arr[m])\r\nmiddle.sort(reverse=True)\r\nfor i in range(len(middle)):\r\n if i % 2 == 0:\r\n a += middle[i]\r\n else:\r\n b += middle[i]\r\nprint(a, b)", "\r\ndef calc(odd_pile_list):\r\n sente_omake = 0\r\n gote_omake = 0\r\n odd_pile_list.sort(key=lambda x:x[(len(x)-1)//2],reverse=True)\r\n\r\n for i in range(len(odd_pile_list)):\r\n if i%2 == 0:\r\n sente_omake += sum(odd_pile_list[i][:(len(odd_pile_list[i])+1)//2])\r\n gote_omake += sum(odd_pile_list[i][(len(odd_pile_list[i])+1)//2:])\r\n else:\r\n sente_omake += sum(odd_pile_list[i][:(len(odd_pile_list[i])-1)//2])\r\n gote_omake += sum(odd_pile_list[i][(len(odd_pile_list[i])-1)//2:])\r\n \r\n return sente_omake,gote_omake\r\n \r\n \r\n\r\n\r\nn = int(input())\r\nodd_pile_list = []\r\nsente_score = 0\r\ngote_score = 0\r\n\r\nfor i in range(n):\r\n s,*c = map(int,input().split())\r\n if s%2 == 0:\r\n sente_score += sum(c[:s//2])\r\n gote_score += sum(c[s//2:])\r\n else:\r\n odd_pile_list.append(c)\r\n \r\nsente_omake,gote_omake = calc(odd_pile_list)\r\nsente_score += sente_omake\r\ngote_score += gote_omake\r\n \r\nprint(f\"{sente_score} {gote_score}\")\r\n\r\n", "n = int(input())\r\na,b = 0,0\r\nl = []\r\nfor _ in range(n):\r\n inpt = list(map(int,input().split()))[1:]\r\n li = len(inpt)\r\n if li%2:\r\n l.append(inpt[li//2])\r\n a += sum((inpt[:li//2]))\r\n b += sum((inpt[(li + 1)//2:]))\r\nl.sort(reverse=True)\r\na += sum(l[::2])\r\nb += sum(l[1::2])\r\nprint(a, b)", "import sys\r\nfrom functools import reduce\r\n\r\nfor n in sys.stdin:\r\n n = int(n)\r\n cards = [list(map(int, input().split()[1:])) for i in range(n)]\r\n mid = []\r\n a, b = 0, 0\r\n add = lambda x=0, y=0: x + y\r\n for c in cards:\r\n s = len(c)\r\n m = s >> 1\r\n if s & 1 == 0:\r\n a += reduce(add, c[:m])\r\n b += reduce(add, c[m:])\r\n else:\r\n a += reduce(add, c[:m] or [0])\r\n b += reduce(add, c[m + 1:] or [0])\r\n mid.append(c[m])\r\n mid.sort(reverse=True)\r\n j = True\r\n for c in mid:\r\n if j:\r\n a += c\r\n else:\r\n b += c\r\n j = not j\r\n print(a, b)\r\n", "n=int(input())\n\ns1,s2=0,0\n\ntab = []\n\nfor i in range(n):\n\n c = list(map(int,input().split()))\n\n for j in range(1,c[0]+1):\n\n if(j*2<=c[0]): s1+=c[j]\n\n else: s2+=c[j]\n\n if(c[0] & 1):\n\n s2-=c[(c[0]+1)//2]\n\n tab.append(c[(c[0]+1)//2])\n\nif(len(tab)):\n\n tab.sort()\n\n tab.reverse()\n\n for i in range(len(tab)):\n\n if(i & 1): s2+=tab[i]\n\n else: s1+=tab[i]\n\nprint(s1,s2)\n\n\n\n\n\n# Made By Mostafa_Khaled", "n = int(input())\nres1 = 0\nres2 = 0\nheap = []\nfor i in range(n):\n arr = list(map(int,input().split()))\n l = arr[0]\n if l % 2 == 0:\n for i in range(1,l//2+1):\n res1 += arr[i]\n for j in range(l//2+1,l+1):\n res2 += arr[j]\n else:\n heap.append(arr[l//2+1])\n for i in range(1,l//2+1):\n res1 += arr[i]\n for j in range(l//2+2,l+1):\n res2 += arr[j]\nif heap:\n heap.sort(reverse = True)\n for i in range(0,len(heap),2):\n res1 += heap[i]\n if len(heap) > 1:\n for j in range(1,len(heap),2):\n res2 += heap[j]\nprint(res1,res2,end='')", "n = int(input())\n\nS = [0] * n\n\nciel, giro = 0, 0\nodd = []\n\nfor i in range(n):\n L = list(map(int, input().split()))\n k = L[0]\n L = L[1:]\n\n S[i] = sum(L)\n\n if k % 2:\n odd.append(L[k // 2])\n\n ciel += sum(L[:k // 2])\n giro += sum(L[(k + 1) // 2:])\n\nodd.sort(reverse=True)\n\nfor i, x in enumerate(odd):\n if i % 2:\n giro += x\n else:\n ciel += x\n\nprint(ciel, giro)\n", "import sys\r\ninput=sys.stdin.readline\r\nn=int(input())\r\ns=[]\r\nc=[]\r\nfor i in range(n):\r\n si,*ci=map(int,input().split())\r\n s.append(si)\r\n c.append(ci)\r\nss=[]\r\nciel=0;jiro=0\r\nfor i in range(n):\r\n if s[i]%2:\r\n ciel+=sum(c[i][:(s[i]-1)//2])\r\n jiro+=sum(c[i][(s[i]-1)//2+1:])\r\n ss.append(c[i][(s[i]-1)//2])\r\n else:\r\n ciel+=sum(c[i][:s[i]//2])\r\n jiro+=sum(c[i][s[i]//2:])\r\nss.sort(reverse=True)\r\nfor i in range(len(ss)):\r\n if i%2==0:\r\n ciel+=ss[i]\r\n else:\r\n jiro+=ss[i]\r\nprint(ciel,jiro)", "p, n = [], int(input())\r\na = b = 0\r\nfor i in range(n):\r\n t = list(map(int, input().split()))\r\n k = t[0] // 2 + 1\r\n a += sum(t[1: k])\r\n if t[0] & 1:\r\n p.append(t[k])\r\n b += sum(t[k + 1: ])\r\n else: b += sum(t[k: ])\r\np.sort(reverse = True)\r\nprint(a + sum(p[0 :: 2]), b + sum(p[1 :: 2]))", "odd = []\nfirst, second = 0, 0\n\nfor i in range(int(input())):\n pile = list(map(int, input().split()))\n s, pile = pile[0], pile[1:]\n sh = s >> 1\n if (s & 1) == 0:\n first += sum(pile[:sh])\n second += sum(pile[sh:])\n else:\n first += sum(pile[:sh])\n second += sum(pile[sh+1:])\n odd.append(pile[sh])\n\nodd = sorted(odd, reverse=True)\nfirst += sum(odd[::2])\nsecond += sum(odd[1::2])\n\nprint(first, second)\n \t\t\t \t \t \t\t \t\t\t\t \t\t \t \t", "# LUOGU_RID: 132911591\n# pypy3\r\nfrom collections import *\r\nfrom itertools import *\r\nfrom functools import *\r\nfrom bisect import *\r\nfrom heapq import *\r\nfrom math import *\r\n\r\nimport sys\r\nIN = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\r\nPN = lambda x: sys.stdout.write(x)\r\nI = lambda: int(IN())\r\nS = lambda: IN().split()\r\nM = lambda: map(int, IN().split())\r\nL = lambda: list(map(int, IN().split()))\r\nG = lambda: map(lambda x: int(x) - 1, IN().split())\r\n\r\ndef solve():\r\n n = I()\r\n a, b = 0, 0\r\n p = []\r\n for i in range(n):\r\n l = L()\r\n n = l[0]\r\n l = l[1::]\r\n if len(l) % 2 == 0:\r\n a += sum(l[:n // 2:])\r\n b += sum(l[n // 2:n:])\r\n else:\r\n a += sum(l[:n // 2:])\r\n b += sum(l[n // 2 + 1:n:])\r\n p.append(l[n // 2])\r\n for i, x in enumerate(sorted(p, reverse = True)):\r\n if i % 2 == 0:\r\n a += x\r\n else:\r\n b += x\r\n print(a, b)\r\n\r\n\r\n\r\n\r\n\r\n\r\nsolve()\r\n\r\n\r\n\r\n\r\n", "import re\r\n\r\ndef main():\r\n n=eval(input())\r\n a=[]\r\n s=[]\r\n s.append(0)\r\n s.append(0)\r\n while n:\r\n n-=1\r\n temp=re.split(' ',input())\r\n k=eval(temp[0])\r\n for i in range(k>>1):\r\n s[0]+=eval(temp[i+1])\r\n if k&1:\r\n a.append(eval(temp[(k+1)>>1]))\r\n for i in range((k+1)>>1,k):\r\n s[1]+=eval(temp[i+1])\r\n a.sort(reverse=True)\r\n k=0\r\n for i in a:\r\n s[k]+=i\r\n k^=1\r\n print(s[0],s[1])\r\n\r\nmain()", "from functools import reduce\r\n\r\nn = int(input())\r\ncards = [list(map(int, input().split()[1:])) for i in range(n)]\r\nmid = [c[len(c) >> 1] for c in cards if len(c) & 1 == 1]\r\na, b = 0, 0\r\nadd = lambda x=0, y=0: x + y\r\nfor c in cards:\r\n m = len(c) >> 1\r\n a += reduce(add, c[:m] or [0])\r\n b += reduce(add, c[m + (len(c) & 1):] or [0])\r\nmid.sort(reverse=True)\r\na += reduce(add, mid[::2] or [0])\r\nb += reduce(add, mid[1::2] or [0])\r\nprint(a, b)\r\n", "N = int(input())\none = two = 0\nmiddles = []\nfor i in range(N):\n\tarray = list(map(int, input().split()))[1:]\n\tsize = len(array)-1\n\tmiddle = size//2\n\tfor i in range(middle):\n\t\tone += array[i]\n\tfor i in range(middle+1, len(array)):\n\t\ttwo += array[i]\n\tif len(array)%2==1:\n\t\tmiddles.append(array[middle])\n\telse:\n\t\tone += array[middle]\n\nmiddles = sorted(middles)\nONE = True\nfor i in range(len(middles)-1, -1, -1):\n\tif ONE:\n\t\tone += middles[i]\n\t\tONE = False\n\telse:\n\t\ttwo += middles[i]\n\t\tONE = True\nprint(one, two)\n \t \t \t\t \t \t\t\t \t\t \t\t \t \t", "n = int(input())\r\na = b = 0\r\ns = []\r\nfor _ in range(n):\r\n l = [*map(int, input().split())][1:]\r\n m = len(l)\r\n if m & 1:\r\n s.append(l[m//2])\r\n a += sum((l[:m//2]))\r\n b += sum((l[(m + 1)//2:]))\r\ns.sort(reverse = True)\r\na += sum(s[::2])\r\nb += sum(s[1::2])\r\nprint(a, b)", "from functools import reduce\r\n\r\nn = int(input())\r\ncards = [list(map(int, input().split()[1:])) for i in range(n)]\r\nmid = sorted((c[len(c) >> 1] for c in cards if len(c) & 1 == 1), reverse=True)\r\nadd = lambda x=0, y=0: x + y\r\na, b = reduce(add, mid[::2] or [0]), reduce(add, mid[1::2] or [0])\r\nfor c in cards:\r\n m = len(c) >> 1\r\n a += reduce(add, c[:m] or [0])\r\n b += reduce(add, c[m + (len(c) & 1):] or [0])\r\nprint(a, b)\r\n" ]

[ "import sys\r\ninput = lambda: sys.stdin.readline().rstrip()\r\n\r\nN = int(input())\r\nC = list(map(int, input().split()))\r\nA = []\r\nfor _ in range(N):\r\n A.append(list(map(int, input().split())))\r\n \r\ndef find(num):\r\n for i in range(N):\r\n for j in range(len(A[i])):\r\n if A[i][j]==num:\r\n return i,j\r\n\r\nans = []\r\ncur = 1\r\nfor i in range(N):\r\n for j in range(len(A[i])):\r\n if A[i][j]==cur:\r\n cur+=1\r\n continue\r\n i1,j1 = find(cur)\r\n ans.append((i+1,j+1,i1+1,j1+1))\r\n A[i][j],A[i1][j1] = A[i1][j1],A[i][j]\r\n cur+=1\r\n \r\nprint(len(ans))\r\nfor a in ans:\r\n print(*a)\r\n ", "n=int(input())\r\np=[[0,0]]\r\nl=[0]\r\nv=[]\r\nfor i, c in enumerate(map(int, input().split())):\r\n p.extend([[i + 1, j + 1] for j in range(c)])\r\n l.extend(list(map(int, input().split())))\r\nfor i in range(1, len(l)):\r\n if l[i] != i:\r\n j = l.index(i)\r\n v.append(p[i] + p[j])\r\n l[i], l[j] = l[j], l[i]\r\nprint(len(v))\r\nfor x in v:\r\n print(' '.join(map(str, x)))", "n = int(input())\r\nc = list(map(int, input().split()))\r\na = []\r\nfor i in range(n):\r\n a.append(list(map(int, input().split())))\r\nd = dict()\r\nfor i in range(n):\r\n for j in range(c[i]):\r\n d[a[i][j]] = [i + 1, j + 1]\r\nans = []\r\ntek = 0\r\nfor i in range(n):\r\n for j in range(c[i]):\r\n tek += 1\r\n if a[i][j] != tek:\r\n ans.append([i + 1, j + 1, d[tek][0], d[tek][1]])\r\n d[a[i][j]] = d[tek]\r\n a[i][j], a[d[tek][0] - 1][d[tek][1] - 1] = a[d[tek][0] - 1][d[tek][1] - 1], a[i][j]\r\nprint(len(ans))\r\nfor i in ans:\r\n print(*i)# 1690927075.7984898", "n = int(input())\r\nc = [0] + list(map(int, input().split()))\r\nm = sum(c)\r\np, q, r, t = [0] * (m + 1), {}, [0] * m, []\r\n \r\nk = 0\r\nfor i in range(1, n + 1):\r\n s = str(i) + ' '\r\n for j in range(1, c[i] + 1):\r\n r[k] = s + str(j)\r\n k += 1\r\nk = 0\r\nfor i in range(n):\r\n for x in tuple(map(int, input().split())):\r\n p[x], q[r[k]] = r[k], x\r\n k += 1\r\n \r\nk = 1\r\nfor y in r:\r\n a, b = q[y], p[k]\r\n if p[k] != y:\r\n t.append(y + ' ' + b)\r\n p[a], q[b] = b, a\r\n k += 1\r\n \r\nprint(len(t))\r\nprint('\\n'.join(t))" ]

[ "s, t = input(), input()\r\n\r\ns = [ord(s[0]) - ord('a') + 1, int(s[1])]\r\nt = [ord(t[0]) - ord('a') + 1, int(t[1])]\r\ncount = 0\r\np = []\r\nwhile (s != t):\r\n if (s[0] != t[0] and s[1] != t[1]):\r\n if (s[0] < t[0]):\r\n if (s[1] < t[1]):\r\n s[0] += 1\r\n s[1] += 1\r\n p.append(\"RU\")\r\n else:\r\n s[0] += 1\r\n s[1] -= 1\r\n p.append(\"RD\")\r\n else:\r\n if (s[1] < t[1]):\r\n s[0] -= 1\r\n s[1] += 1\r\n p.append(\"LU\")\r\n else:\r\n s[0] -= 1\r\n s[1] -= 1\r\n p.append(\"LD\")\r\n else:\r\n if (s[1] < t[1]):\r\n s[1] += 1\r\n p.append(\"U\")\r\n elif (s[1] > t[1]):\r\n s[1] -= 1\r\n p.append(\"D\")\r\n elif (s[0] < t[0]):\r\n s[0] += 1\r\n p.append(\"R\")\r\n else:\r\n s[0] -= 1\r\n p.append(\"L\")\r\n count += 1\r\n\r\nprint(count)\r\nprint(*p, sep=\"\\n\")\r\n", "def letter_to_num(letter):\r\n if letter == 'a': return 1\r\n if letter == 'b': return 2\r\n if letter == 'c': return 3\r\n if letter == 'd': return 4\r\n if letter == 'e': return 5\r\n if letter == 'f': return 6\r\n if letter == 'g': return 7\r\n if letter == 'h': return 8\r\n\r\n\r\nfr = input()\r\nto = input()\r\n\r\nx1 = letter_to_num(fr[0])\r\ny1 = int(fr[1])\r\n\r\nx2 = letter_to_num(to[0])\r\ny2 = int(to[1])\r\n\r\nmoves = 0\r\npath = []\r\n\r\nwhile True:\r\n if x1 < x2:\r\n if y1 < y2:\r\n m = 'RU'\r\n x1 += 1\r\n y1 += 1\r\n elif y1 > y2:\r\n m = 'RD'\r\n x1 += 1\r\n y1 -= 1\r\n else:\r\n m = 'R'\r\n x1 += 1\r\n moves += 1\r\n elif x1 > x2:\r\n if y1 < y2:\r\n m = 'LU'\r\n x1 -= 1\r\n y1 += 1\r\n elif y1 > y2:\r\n m = 'LD'\r\n x1 -= 1\r\n y1 -= 1\r\n else:\r\n m = 'L'\r\n x1 -= 1\r\n moves += 1\r\n else:\r\n if y1 < y2:\r\n m = 'U'\r\n y1 += 1\r\n elif y1 > y2:\r\n m = 'D'\r\n y1 -= 1\r\n else:\r\n break\r\n moves += 1\r\n\r\n path.append(m)\r\n\r\nprint(moves)\r\nfor p in path:\r\n print(p)", "start = input().strip()\r\nend = input().strip()\r\n\r\nstart = [{\"a\":1, \"b\":2, \"c\":3, \"d\":4, \"e\":5, \"f\":6, \"g\":7, \"h\":8}[start[0]], int(start[1])]\r\nend = [{\"a\":1, \"b\":2, \"c\":3, \"d\":4, \"e\":5, \"f\":6, \"g\":7, \"h\":8}[end[0]], int(end[1])]\r\n\r\n\r\nprint(max(abs(start[0]-end[0]), abs(start[1]-end[1])), end=\"\")\r\nwhile start != end:\r\n print()\r\n if start[0] < end[0]:\r\n start[0] += 1\r\n print(\"R\", end=\"\")\r\n if start[0] > end[0]:\r\n start[0] -= 1\r\n print(\"L\", end=\"\")\r\n if start[1] < end[1]:\r\n start[1] += 1\r\n print(\"U\", end=\"\")\r\n if start[1] > end[1]:\r\n start[1] -= 1\r\n print(\"D\", end=\"\")\r\n", "s = input()\nt = input()\nx,y = ord(s[0])-96 , int(s[1])\np,q = ord(t[0])-96 , int(t[1])\nans = []\nwhile (x!=p or y!=q):\n if x>p and y>q:\n ans.append(\"LD\")\n x-=1\n y-=1\n elif x>p and y<q:\n ans.append(\"LU\")\n x-=1\n y+=1\n elif x<p and y>q:\n ans.append(\"RD\")\n x+=1\n y-=1\n elif x<p and y<q:\n ans.append(\"RU\")\n x+=1\n y+=1\n \n else:\n if x==p:\n while y>q:\n ans.append(\"D\")\n y-=1\n while y<q:\n ans.append(\"U\")\n y+=1\n else:\n while x>p:\n ans.append(\"L\")\n x-=1\n while x<p:\n ans.append(\"R\")\n x+=1\nprint(len(ans))\nfor e in ans:\n print(e)\n \n \n \n \n \n", "import string\r\nx=string.ascii_lowercase[:8]\r\nm={1:'R',-1:'L'}\r\ny={1:'U',-1:'D'}\r\ns=input()\r\nsx=x.index(s[0])+1\r\nsy=int(s[1])\r\nt=input()\r\ntx=x.index(t[0])+1\r\nty=int(t[1])\r\nops=0\r\nif sx<tx:\r\n kx=1\r\nelse:\r\n kx=-1\r\nif sy<ty:\r\n ky=1\r\nelse:\r\n ky=-1\r\nktot=[]\r\nwhile sx!=tx and sy!=ty:\r\n ops=ops+1\r\n sx=sx+kx\r\n sy=sy+ky\r\n ktot.append(m[kx]+y[ky])\r\nprint(abs(sx-tx+sy-ty)+ops)\r\nprint(*ktot, sep='\\n')\r\nrest=(abs(sx-tx+sy-ty))*[y[ky]*int(sx==tx)+m[kx]*int(sy==ty)]\r\nif rest!=[]:\r\n print(*rest, sep='\\n')", "pos1 = list(input())\r\npos1[0] = ord(pos1[0])-97\r\npos1[1] = int(pos1[1])\r\npos2 = list(input())\r\npos2[0] = ord(pos2[0])-97\r\npos2[1] = int(pos2[1])\r\nmoves = []\r\nsteps=0\r\nwhile True:\r\n if pos1[0] < pos2[0] and pos1[1] < pos2[1]:\r\n pos1[0]+=1\r\n pos1[1]+=1\r\n moves.append(\"RU\")\r\n elif pos1[0] > pos2[0] and pos1[1] < pos2[1]:\r\n pos1[0]-=1\r\n pos1[1]+=1\r\n moves.append(\"LU\")\r\n elif pos1[0] > pos2[0] and pos1[1] > pos2[1]:\r\n pos1[0]-=1\r\n pos1[1]-=1\r\n moves.append(\"LD\")\r\n elif pos1[0] < pos2[0] and pos1[1] > pos2[1]:\r\n pos1[0]+=1\r\n pos1[1]-=1\r\n moves.append(\"RD\")\r\n elif pos1[0] < pos2[0]:\r\n pos1[0]+=1\r\n moves.append(\"R\")\r\n elif pos1[0] > pos2[0]:\r\n pos1[0]-=1\r\n moves.append(\"L\")\r\n elif pos1[1] < pos2[1]:\r\n pos1[1]+=1\r\n moves.append(\"U\")\r\n elif pos1[1] > pos2[1]:\r\n pos1[1]-=1\r\n moves.append(\"D\")\r\n else:\r\n break\r\n steps+=1\r\nprint(steps,*moves,sep='\\n',end='')", "cord = {\r\n 'a': 1,\r\n 'b': 2,\r\n 'c': 3,\r\n 'd': 4,\r\n 'e': 5,\r\n 'f': 6,\r\n 'g': 7,\r\n 'h': 8,\r\n}\r\n\r\ns = input()\r\nt = input()\r\n\r\nxS = cord[s[0]]\r\nxT = cord[t[0]]\r\n\r\nyS = int(s[1])\r\nyT = int(t[1])\r\n\r\nans = []\r\n\r\nwhile xS != xT or yS != yT:\r\n if xS == xT:\r\n if yS > yT:\r\n ans.append('D')\r\n yS -= 1\r\n else:\r\n ans.append('U')\r\n yS += 1\r\n elif yT == yS:\r\n if xS > xT:\r\n ans.append('L')\r\n xS -= 1\r\n else:\r\n ans.append('R')\r\n xS += 1\r\n else:\r\n if yS > yT:\r\n if xS > xT:\r\n ans.append('LD')\r\n xS -= 1\r\n yS -= 1\r\n else:\r\n ans.append('RD')\r\n xS += 1\r\n yS -= 1\r\n else:\r\n if xS > xT:\r\n ans.append('LU')\r\n xS -= 1\r\n yS += 1\r\n else:\r\n ans.append('RU')\r\n xS += 1\r\n yS += 1\r\n\r\nprint(len(ans))\r\nprint(*ans, sep=\"\\n\")", "tmp = input()\nsx, sy = ord(tmp[0])-97, int(tmp[1])-1\ntmp = input()\nex, ey = ord(tmp[0])-97, int(tmp[1])-1\n\ndx, dy = ex-sx, ey-sy\nh = [('R' if dx > 0 else 'L')]*max(dx, -dx)\nv = [('U' if dy > 0 else 'D')]*max(dy, -dy)\nr = max(len(h), len(v))\nprint(r)\nfor i in range(r):\n s = \"\"\n if len(h) > 0:\n s += h.pop(0)\n if len(v) > 0:\n s += v.pop(0)\n print(s)\n\n", "letras = {\"a\":1,\"b\":2,\"c\":3,\"d\":4,\"e\":5,\"f\":6,\"g\":7,\"h\":8}\nmovimientos = []\ns = input() #a1 s[0] = a\nt = input() #h8\ns = [letras[s[0]], int(s[1])] #0: columna, 1: fila\nt = [letras[t[0]], int(t[1])]\n \nwhile (s[1] != t[1] and s[0] != t[0]): #E6 - \n if s[1] < t[1] and s[0] > t[0]: #abajo, derecha\n s[1] += 1\n s[0] -= 1\n movimientos += [\"LU\"]\n elif s[1] < t[1] and s[0] < t[0]:\n s[1] += 1\n s[0] += 1\n movimientos += [\"RU\"]\n elif s[1] > t[1] and s[0] < t[0]:\n s[1] -= 1\n s[0] += 1\n movimientos += [\"RD\"]\n elif s[1] > t[1] and s[0] > t[0]:\n s[1] -= 1\n s[0] -= 1\n movimientos += [\"LD\"]\n \nif (s[1] == t[1]):\n if s[0] < t[0]:\n movimientos += abs(s[0]-t[0])*[\"R\"]\n elif s[0] > t[0]:\n movimientos += abs(t[0]-s[0])*[\"L\"]\nelse:\n if s[1] > t[1]: \n movimientos += abs(s[1]-t[1])*[\"D\"]\n elif s[1] < t[1]:\n movimientos += abs(t[1]-s[1])*[\"U\"]\n\nprint(len(movimientos)) \nfor m in movimientos:\n print(m)\n", "king, t = input(), input()\r\nkx, ky = 8 - int(king[1]), ord(king[0]) - ord('a')\r\ntx, ty = 8 - int(t[1]), ord(t[0]) - ord('a')\r\ndx, dy = abs(kx - tx), abs(ky - ty)\r\n\r\ndiagonal = ''\r\nif tx >= kx and ty >= ky:\r\n diagonal = 'RD'\r\nelif tx >= kx and ty <= ky:\r\n diagonal = 'LD'\r\nelif tx <= kx and ty >= ky:\r\n diagonal = 'RU'\r\nelif tx <= kx and ty <= ky:\r\n diagonal = 'LU'\r\n\r\nstraight = diagonal[0] if dy >= dx else diagonal[1]\r\nprint(max(dx, dy))\r\nprint(min(dx, dy) * (diagonal + '\\n'), end='')\r\nprint((max(dx, dy) - min(dx, dy)) * (straight + '\\n'))\r\n", "#xet mA == mB: //dong\r\ndef check_in_row(colA,rowA,colB,rowB):\r\n #number of king moves => n = abs(nA - nB)\r\n numberOfKingMove = abs(colA - colB)\r\n listMove = []\r\n if colA > colB:\r\n listMove = ['L'] * numberOfKingMove\r\n else:\r\n listMove = ['R'] * numberOfKingMove\r\n return listMove\r\n#xet nA == nB: // cot\r\ndef check_in_col(colA,rowA,colB,rowB):\r\n ##number of king moves => n = abs(mA - mB)\r\n numberOfKingMove = abs(rowA - rowB)\r\n listMove = []\r\n if rowA > rowB:\r\n listMove = ['U'] * numberOfKingMove\r\n else:\r\n listMove = ['D'] * numberOfKingMove\r\n return listMove\r\n#xet abs(nA - nB) == abs(mA- mB) // 2 duong cheo\r\ndef check_in_cross(colA,rowA,colB,rowB):\r\n numberOfKingMove = abs(rowA - rowB)\r\n listMove = []\r\n if colA > colB:\r\n if rowA > rowB:\r\n listMove = ['LU'] * numberOfKingMove\r\n else:\r\n listMove = ['LD'] * numberOfKingMove\r\n else:\r\n if rowA > rowB:\r\n listMove = ['RU'] * numberOfKingMove\r\n else:\r\n listMove = ['RD'] * numberOfKingMove\r\n return listMove\r\n#ko nam tren dong, cot, 2 duong cheo\r\ndef check_special_case(colA,rowA,colB,rowB):\r\n leftUp = [-1, -1]\r\n leftDown = [1, -1]\r\n rightUp = [-1, 1]\r\n rightDown = [1, 1]\r\n\r\n temp = []\r\n\r\n if rowA < rowB and colA > colB:\r\n temp = leftDown\r\n elif rowA < rowB and colA < colB:\r\n temp = rightDown\r\n elif rowA > rowB and colA > colB:\r\n temp = leftUp\r\n elif rowA > rowB and colA < colB:\r\n temp = rightUp\r\n\r\n tempRow = rowA\r\n tempColumn = colA\r\n\r\n while tempRow != rowB and tempColumn != colB:\r\n tempRow += temp[0]\r\n tempColumn += temp[1]\r\n\r\n crossMoves = check_in_cross(colA, rowA, tempColumn, tempRow)\r\n straintMoves = []\r\n if tempRow == rowB:\r\n straintMoves = check_in_row(tempColumn, tempRow, colB, rowB)\r\n elif tempColumn == colB:\r\n straintMoves = check_in_col(tempColumn, tempRow, colB, rowB)\r\n\r\n return crossMoves + straintMoves\r\n\r\na = input()\r\nb = input()\r\n\r\n#tach ky tu dau tien => a => asci(a)%97 - 1 => lay dc gia tri cot\r\n#tach ky tu thu 2 => 8 - 1 => lay dc gia tri dong \r\n#co toa do diem bat dau A(mA,nA)\r\n#co toa do diem ket thuc B(mB, nB)\r\ncolA = ord(a[0])%97\r\nrowA = abs(int(a[1]) - 8)\r\ncolB = ord(b[0])%97\r\nrowB = abs(int(b[1]) - 8)\r\n\r\nresult = check_special_case(colA,rowA,colB,rowB)\r\nresult_count = len(result)\r\nprint(result_count)\r\nfor move in result:\r\n print(move)", "# LUOGU_RID: 107865279\nd = input()\r\na, b = ord(d[0])-97, int(d[1])\r\nd = input()\r\nc, d = ord(d[0])-97, int(d[1])\r\ndis = max(abs(a - c), abs(b - d))\r\nprint(dis)\r\nwhile dis > 0:\r\n if a > c:\r\n if b > d:\r\n a -= 1; b -= 1; print('LD')\r\n elif b == d:\r\n a -= 1; print('L')\r\n else:\r\n a -= 1; b += 1; print('LU')\r\n elif a == c:\r\n if b > d:\r\n b -= 1; print('D')\r\n else:\r\n b += 1; print('U')\r\n else:\r\n if b > d:\r\n a += 1; b -= 1; print('RD')\r\n elif b == d:\r\n a += 1; print('R')\r\n else:\r\n a += 1; b += 1; print('RU')\r\n dis -= 1\r\n", "s = input()\r\nt = input()\r\n\r\npos = s\r\ncnt = 0\r\nans = []\r\n\r\nwhile pos != t:\r\n kq = ''\r\n if pos[0] < t[0]:\r\n kq += 'R'\r\n pos = chr(ord(pos[0]) + 1) + pos[1]\r\n elif pos[0] > t[0]:\r\n kq += 'L'\r\n pos = chr(ord(pos[0]) - 1) + pos[1]\r\n\r\n if pos[1] > t[1]:\r\n kq += 'D'\r\n pos = pos[0] + chr(ord(pos[1]) - 1)\r\n elif pos[1] < t[1]:\r\n kq += 'U'\r\n pos = pos[0] + chr(ord(pos[1]) + 1)\r\n\r\n ans.append(kq)\r\n cnt += 1\r\n\r\nprint(cnt)\r\n\r\nfor i in range(cnt):\r\n print(ans[i])\r\n", "start = input()\nend = input()\n\nstart_col = ord(start[0]) - ord('a')\nstart_row = ord(start[1]) - ord('1')\nend_col = ord(end[0]) - ord('a')\nend_row = ord(end[1]) - ord('1')\n\ncol_diff = abs(start_col - end_col)\nrow_diff = abs(start_row - end_row)\npave_move = max(col_diff, row_diff)\nslide_move = min(col_diff, row_diff)\nprint(pave_move)\nif end_col <= start_col and end_row >= start_row:\n for __ in range(slide_move):\n print('LU')\n for __ in range(pave_move - slide_move):\n if col_diff > row_diff:\n print('L')\n else:\n print('U')\nelif end_col >= start_col and end_row >= start_row:\n for __ in range(slide_move):\n print('RU')\n for __ in range(pave_move - slide_move):\n if col_diff > row_diff:\n print('R')\n else:\n print('U')\nelif end_col >= start_col and end_row <= start_row:\n for __ in range(slide_move):\n print('RD')\n for __ in range(pave_move - slide_move):\n if col_diff > row_diff:\n print('R')\n else:\n print('D')\nelse:\n for __ in range(slide_move):\n print('LD')\n for __ in range(pave_move - slide_move):\n if col_diff > row_diff:\n print('L')\n else:\n print('D')", "s=input()\ns1=input()\ns=list(s)\ns1=list(s1)\nd = []\nwhile s!=s1:\n if s[0]<s1[0] and int(s[1])>int(s1[1]):\n s[0]=chr(ord(s[0])+1)\n s[1]=int(s[1])-1\n d+=[\"RD\"]\n elif s[0]<s1[0] and int(s[1])<int(s1[1]):\n s[0]=chr(ord(s[0])+1)\n s[1]=int(s[1])+1\n d+=[\"RU\"]\n elif s[0]>s1[0] and int(s[1])<int(s1[1]):\n s[0]=chr(ord(s[0])-1)\n s[1]=int(s[1])+1\n d+=[\"LU\"]\n elif s[0]>s1[0] and int(s[1])>int(s1[1]):\n s[0]=chr(ord(s[0])-1)\n s[1]=int(s[1])-1\n d+=[\"LD\"]\n elif s[0]>s1[0] and int(s1[1])==int(s[1]):\n d+=[\"L\"]\n s[0]=chr(ord(s[0])-1)\n elif s[0]<s1[0] and int(s1[1])==int(s[1]):\n d+=[\"R\"]\n s[0]=chr(ord(s[0])+1)\n elif s[0]==s1[0] and int(s[1])>int(s1[1]):\n d+=[\"D\"]\n s[1]=int(s[1])-1\n elif s[0]==s1[0] and int(s[1])<int(s1[1]):\n d+=[\"U\"]\n s[1]=int(s[1])+1\n if s[0]==s1[0] and int(s[1])==int(s1[1]):\n break\nprint(len(d))\nfor i in d:\n print(i)\n", "# Greedy Algorithm\r\n\r\ncns = '0abcdefgh'\r\n\r\nsp = input()\r\nep = input()\r\n\r\ncs = cns.index(sp[0])\r\nrs = int(sp[1])\r\n\r\nce = cns.index(ep[0])\r\nre = int(ep[1])\r\n\r\npath = []\r\nsteps = 0\r\n\r\ncn = cs\r\nrn = rs\r\n\r\nwhile cn != ce or rn != re:\r\n\tif cn < ce:\r\n\t\tif rn < re:\r\n\t\t\tpath.append('RU')\r\n\t\t\tcn += 1\r\n\t\t\trn += 1\r\n\t\telif rn == re:\r\n\t\t\tpath.append('R')\r\n\t\t\tcn += 1\r\n\t\telse:\r\n\t\t\tpath.append('RD')\r\n\t\t\tcn += 1\r\n\t\t\trn -= 1\r\n\telif cn > ce:\r\n\t\tif rn < re:\r\n\t\t\tpath.append('LU')\r\n\t\t\tcn -= 1\r\n\t\t\trn += 1\r\n\t\telif rn == re:\r\n\t\t\tpath.append('L')\r\n\t\t\tcn -= 1\r\n\t\telse:\r\n\t\t\tpath.append('LD')\r\n\t\t\tcn -= 1\r\n\t\t\trn -= 1\r\n\telse:\r\n\t\tif rn < re:\r\n\t\t\tpath.append('U')\r\n\t\t\trn += 1\r\n\t\telse:\r\n\t\t\tpath.append('D')\r\n\t\t\trn -= 1\r\n\tsteps += 1\r\n\r\nprint(steps)\r\nfor m in path:\r\n\tprint(m)", "def p():\r\n s = input()\r\n return complex(\"abcdefgh\".index(s[0]), int(s[1]) - 1)\r\n\r\n\r\ndef sgn(x):\r\n return 0 if x == 0 else int(x / abs(x))\r\n\r\n\r\ndef g(s, t):\r\n d = t - s\r\n while d != 0:\r\n x, y = sgn(d.real), sgn(d.imag)\r\n yield [\"L\", \"\", \"R\"][x + 1] + [\"D\", \"\", \"U\"][y + 1]\r\n s += complex(x, y)\r\n d = t - s\r\n\r\n\r\ns, t = p(), p()\r\nans = list(g(s, t))\r\nprint(len(ans))\r\nprint(\"\\n\".join(ans))\r\n", "def FindSquare(arr, a):\r\n for i in range(8):\r\n for j in range(8):\r\n if arr[i][j] == a:\r\n return [i, j]\r\n\r\ndef FindPath(pos1, pos2, arr):\r\n temp = arr\r\n doc = pos2[0] - pos1[0]\r\n ngang = pos2[1] - pos1[1]\r\n if ngang < 0:\r\n x = -1\r\n elif ngang > 0:\r\n x = 1\r\n else:\r\n x = 0\r\n if doc < 0:\r\n y = -1\r\n elif doc > 0:\r\n y = 1\r\n else:\r\n y = 0\r\n if x == 0 and y == 0:\r\n return temp\r\n temp.append([x, y])\r\n return FindPath([y, x], [doc, ngang], temp)\r\n\r\n\r\nboard = []\r\nfor i in range(8):\r\n temp = []\r\n for j in range(8):\r\n temp.append(chr(j + 97) + str(8 - i))\r\n board.append(temp)\r\n\r\nstart = input()\r\nfinish = input()\r\nstart = FindSquare(board, start)\r\nfinish = FindSquare(board, finish)\r\nmove_board = []\r\nmove_board = FindPath(start, finish, move_board)\r\nprint(len(move_board))\r\nfor i in range(len(move_board)):\r\n temp_text = ''\r\n if move_board[i][0] == -1:\r\n temp_text += 'L'\r\n elif move_board[i][0] == 1:\r\n temp_text += 'R'\r\n if move_board[i][1] == 1:\r\n temp_text += 'D'\r\n elif move_board[i][1] == -1:\r\n temp_text += 'U'\r\n print(temp_text)", "k = input()\r\nl = input()\r\nx = ord(k[0]) - ord(l[0]) \r\ny = ord(k[1]) - ord(l[1]) \r\nprint(max(x,-x,y,-y)) \r\nwhile x!=0 or y!=0 :\r\n r = ''\r\n if x < 0 :\r\n r = 'R'\r\n x = x + 1\r\n elif x > 0 :\r\n r = 'L'\r\n x = x - 1\r\n if y < 0 :\r\n r = r + 'U'\r\n y = y + 1\r\n elif y > 0 :\r\n r = r + 'D'\r\n y = y - 1\r\n print(r)", "def parse_line():\n x, y = map(ord, input())\n x -= 97\n y -= 48\n return x, y\n\n\nx1, y1 = parse_line()\nx2, y2 = parse_line()\nmoves = []\nwhile x1 != x2 or y1 != y2:\n move = \"\"\n if x1 < x2:\n move += \"R\"\n x1 += 1\n elif x1 > x2:\n move += \"L\"\n x1 -= 1\n if y1 < y2:\n move += \"U\"\n y1 += 1\n elif y1 > y2:\n move += \"D\"\n y1 -= 1\n moves.append(move)\nprint(len(moves))\nfor move in moves:\n print(move)\n", "x=input()\r\np=x[0];q=int(x[1]);\r\ny=input()\r\na=y[0];b=int(y[1]);t=0;d={};\r\nfor i in \"abcdefgh\" :\r\n t+=1\r\n d[i]=t\r\nmax=max(abs(d[p]-d[a]),abs(q-b))\r\nmin=min(abs(d[p]-d[a]),abs(q-b))\r\nprint(max)\r\nif d[p]-d[a]>=0 :\r\n for i in range(min) :\r\n print(\"L\",end=\"\")\r\n if q-b >=0 :\r\n print(\"D\")\r\n else :\r\n print(\"U\")\r\nelse :\r\n for i in range(min) :\r\n print(\"R\",end=\"\")\r\n if q-b >=0 :\r\n print(\"D\")\r\n else :\r\n print(\"U\")\r\nif abs(d[p]-d[a]) < abs(q-b) :\r\n for i in range (max-min) :\r\n if q-b >=0 :\r\n print(\"D\")\r\n else :\r\n print(\"U\")\r\nelse :\r\n for i in range (max-min) :\r\n if d[p]-d[a] >=0 :\r\n print(\"L\")\r\n else :\r\n print(\"R\")", "from collections import deque\r\n\r\n\r\nboard = [[None]*8 for i in range(8)]\r\npath = [[None]*8 for i in range(8)]\r\n\r\nsource = input()\r\ndest = input()\r\n\r\ndirn = [(i,j) for i in range(-1,2) for j in range(-1,2) if i or j]\r\n\r\nro = int(source[1])-1\r\ncol = ord(source[0])-ord('a')\r\n\r\nqu = deque([(ro,col,0,0)])\r\n\r\ntro = int(dest[1])-1\r\ntcol = ord(dest[0])-ord('a')\r\n\r\n\r\nwhile qu:\r\n r,c,dr,dc = qu.popleft()\r\n \r\n if board[r][c] is None:\r\n if board[r-dr][c-dc] is None:\r\n board[r][c] = 0\r\n else:\r\n board[r][c] = board[r-dr][c-dc] + 1\r\n path[r][c] = 'L'*(dc<0)+'R'*(dc>0)+'D'*(dr<0)+'U'*(dr>0)\r\n \r\n for dr,dc in dirn:\r\n if 0<=r+dr<=7 and 0<=c+dc<=7:\r\n qu.append((r+dr,c+dc,dr,dc))\r\n\r\nprint(board[tro][tcol])\r\n\r\nr = tro\r\nc = tcol\r\n\r\nfinalpath = list()\r\n\r\nwhile r!=ro or c!=col:\r\n di = path[r][c]\r\n finalpath.append(di)\r\n c += ('L' in di) - ('R' in di)\r\n r += ('D' in di) - ('U' in di)\r\n\r\n\r\nprint(*finalpath[::-1],sep='\\n')\r\n ", "s = input()\r\nxs = ord(s[0]) - ord('a')\r\nys = int(s[1])\r\nt = input()\r\nxt = ord(t[0]) - ord('a')\r\nyt = int(t[1])\r\nans = []\r\nwhile xs < xt and ys < yt:\r\n ans.append('RU')\r\n xs += 1\r\n ys += 1\r\nwhile xs > xt and ys < yt:\r\n ans.append('LU')\r\n xs -= 1\r\n ys += 1\r\nwhile xs < xt and ys > yt:\r\n ans.append('RD')\r\n xs += 1\r\n ys -= 1\r\nwhile xs > xt and ys > yt:\r\n ans.append('LD')\r\n xs -= 1\r\n ys -= 1\r\nwhile xs < xt:\r\n ans.append('R')\r\n xs += 1\r\nwhile xs > xt:\r\n ans.append('L')\r\n xs -= 1\r\nwhile ys < yt:\r\n ans.append('U')\r\n ys += 1\r\nwhile ys > yt:\r\n ans.append('D')\r\n ys -= 1\r\nprint(len(ans))\r\nprint(*ans,sep='\\n')", "chars = {'a': 1, 'b': 2, 'c': 3, 'd': 4, 'e': 5, 'f': 6, 'g': 7, 'h': 8}\r\n\r\ns = input()\r\nt = input()\r\ns = (int(chars[s[0]]), int(s[1]))\r\nt = (int(chars[t[0]]), int(t[1]))\r\nx = t[0] - s[0]\r\ny = t[1] - s[1]\r\nans = []\r\nansx = ['L'] * abs(min(0, x)) + ['R'] * abs(max(0, x))\r\nansy = ['D'] * abs(min(0, y)) + ['U'] * abs(max(0, y))\r\nprint(max(len(ansx), len(ansy)))\r\nwhile ansx and ansy:\r\n print(ansx[0], ansy[0], sep='')\r\n ansx.pop(0)\r\n ansy.pop(0)\r\nif ansx:\r\n print(*ansx, sep='\\n')\r\nelif ansy:\r\n print(*ansy, sep='\\n')\r\n", "a=input()+input()\r\na,b=(ord(a[i])-ord(a[i+2])for i in(0,1))\r\nprint(max(a,-a,b,-b))\r\nwhile a!=0 or b!=0:\r\n r=''\r\n if a<0:r='R';a+=1\r\n if a>0:r='L';a-=1\r\n if b<0:r+='U';b+=1\r\n if b>0:r+='D';b-=1\r\n print(r)", "cp = input()\ndp = input()\n#print(cp[0])\n#print(dp[0])\nx0,y0=cp[0],cp[1]\nx1,y1=dp[0],dp[1]\nans=max(abs(ord(x0)-ord(x1)),abs(int(y0)-abs(int(y1))))\n\nx0,y0=ord(cp[0]),int(cp[1])\nx1,y1=ord(dp[0]),int(dp[1])\nprint(ans)\nwhile(1):\n if x0==x1 and y0==y1:\n break\n if x0<x1:\n x0+=1\n print('R',end='')\n if x1<x0:\n x0-=1\n print('L',end='')\n\n if y0<y1:\n y0+=1\n print('U',end='')\n\n if y1<y0:\n y0-=1\n print('D',end='')\n\n print()\n\n\n\n", "#3A\r\ndef p(x):\r\n print(x)\r\nru = 'RU'\r\nrd = 'RD'\r\nlu = 'LU'\r\nld = 'LD'\r\nr = 'R'\r\nl = 'L'\r\nu = 'U'\r\nd = 'D'\r\nbeg = str(input())\r\nbeg = list(beg)\r\nkb = 0\r\nlst = []\r\nif beg[0] == 'a':\r\n kb = 1\r\nelse:\r\n if beg[0] == 'b':\r\n kb = 2\r\n else:\r\n if beg[0] == 'c':\r\n kb = 3\r\n else:\r\n if beg[0] == 'd':\r\n kb = 4\r\n else:\r\n if beg[0] == 'e':\r\n kb = 5\r\n else:\r\n if beg[0] == 'f':\r\n kb = 6\r\n else:\r\n if beg[0] == 'g':\r\n kb = 7\r\n else:\r\n if beg[0] == 'h':\r\n kb = 8\r\n\r\n\r\nen = str(input())\r\nen = list(en)\r\nke = 0\r\nif en[0] == 'a':\r\n ke = 1\r\nelse:\r\n if en[0] == 'b':\r\n ke = 2\r\n else:\r\n if en[0] == 'c':\r\n ke = 3\r\n else:\r\n if en[0] == 'd':\r\n ke = 4\r\n else:\r\n if en[0] == 'e':\r\n ke = 5\r\n else:\r\n if en[0] == 'f':\r\n ke = 6\r\n else:\r\n if en[0] == 'g':\r\n ke = 7\r\n else:\r\n if en[0] == 'h':\r\n ke = 8\r\n\r\ng = 0\r\ng = ke - kb\r\nvn = int(beg[1])\r\nvk = int(en[1])\r\nv = 0\r\nv = vk - vn\r\nsumm = 0\r\n\r\n\r\n\r\nvm = 0\r\ngm = 0\r\n\r\nif v < 0:\r\n vm = -v\r\nelse:\r\n vm = v\r\n \r\nif g < 0:\r\n gm = -g\r\nelse:\r\n gm = g\r\n\r\nif vm != 0 and gm != 0:\r\n while g != 0 or v != 0:\r\n if g < 0 and v < 0:\r\n lst.append(ld)\r\n g += 1\r\n v += 1\r\n summ += 1\r\n else:\r\n if g < 0 and v > 0:\r\n lst.append(lu)\r\n g += 1\r\n v -= 1\r\n summ += 1\r\n else:\r\n if g > 0 and v < 0:\r\n lst.append(rd)\r\n g -= 1\r\n v += 1\r\n summ += 1\r\n else:\r\n if g > 0 and v > 0:\r\n lst.append(ru)\r\n g -= 1\r\n v -= 1\r\n summ += 1\r\n else:\r\n break\r\n\r\nvnm = 0\r\nif v < 0:\r\n vnm = -v\r\nelse:\r\n vnm = v\r\nif vnm != 0:\r\n if v > 0:\r\n for _ in range(vnm):\r\n lst.append(u)\r\n summ += 1\r\n else:\r\n for _ in range(vnm):\r\n lst.append(d)\r\n summ += 1\r\n\r\ngnm = 0\r\nif g < 0:\r\n gnm = -g\r\nelse:\r\n gnm = g\r\n\r\nif gnm != 0:\r\n if g > 0:\r\n for _ in range(gnm):\r\n lst.append(r)\r\n summ += 1\r\n else:\r\n for _ in range(gnm):\r\n lst.append(l)\r\n summ += 1\r\np(summ)\r\nco = 0\r\nfor _ in range(len(lst)):\r\n print(lst[co])\r\n co += 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\ns = input()\r\nt = input()\r\n\r\n# 计算起始位置和目标位置的行列差\r\ncol_diff = abs(ord(s[0]) - ord(t[0]))\r\nrow_diff = abs(int(s[1]) - int(t[1]))\r\n\r\n# 计算最小步数\r\nmin_moves = max(col_diff, row_diff)\r\n\r\n# 输出最小步数\r\nprint(min_moves)\r\n\r\n# 输出每一步的移动方向\r\nfor i in range(min_moves):\r\n if s[0] < t[0]:\r\n if s[1] < t[1]:\r\n print(\"RU\")\r\n s = chr(ord(s[0])+1) + str(int(s[1])+1)\r\n elif s[1] > t[1]:\r\n print(\"RD\")\r\n s = chr(ord(s[0])+1) + str(int(s[1])-1)\r\n else:\r\n print(\"R\")\r\n s = chr(ord(s[0])+1) + s[1]\r\n elif s[0] > t[0]:\r\n if s[1] < t[1]:\r\n print(\"LU\")\r\n s = chr(ord(s[0])-1) + str(int(s[1])+1)\r\n elif s[1] > t[1]:\r\n print(\"LD\")\r\n s = chr(ord(s[0])-1) + str(int(s[1])-1)\r\n else:\r\n print(\"L\")\r\n s = chr(ord(s[0])-1) + s[1]\r\n else:\r\n if s[1] < t[1]:\r\n print(\"U\")\r\n s = s[0] + str(int(s[1])+1)\r\n else:\r\n print(\"D\")\r\n s = s[0] + str(int(s[1])-1)", "# parse input into a position\r\nfrom_file, from_row = list(input())\r\nto_file, to_row = list(input())\r\n\r\nfiles = ['a', 'b', 'c', 'd', 'e', 'f', 'g', 'h']\r\n# don't actually have to make them zero-based, but whatever\r\nfrom_sq = [files.index(from_file), int(from_row) - 1]\r\nto_sq = [files.index(to_file), int(to_row) - 1]\r\n\r\nmin_moves = max(abs(to_sq[0] - from_sq[0]), abs(to_sq[1] - from_sq[1]))\r\nprint(min_moves)\r\n\r\nfor _ in range(min_moves):\r\n\tdx = to_sq[0] - from_sq[0]\r\n\tdy = to_sq[1] - from_sq[1]\r\n\tdirection = ''\r\n\tif dx > 0:\r\n\t\tdirection = 'R'\r\n\t\tfrom_sq[0] += 1\r\n\telif dx < 0:\r\n\t\tdirection = 'L'\r\n\t\tfrom_sq[0] -= 1\r\n\r\n\tif dy > 0:\r\n\t\tdirection += 'U'\r\n\t\tfrom_sq[1] += 1\r\n\telif dy < 0:\r\n\t\tdirection += 'D'\r\n\t\tfrom_sq[1] -= 1\r\n\r\n\tprint(direction)\r\n", "pos1 = input()\r\npos2 = input()\r\nx, y = ord(pos1[0]) - ord(pos2[0]), ord(pos1[1]) - ord(pos2[1]) \r\nprint(max(x, -x, y, -y))\r\nwhile x != 0 or y != 0:\r\n move = ''\r\n if x < 0: \r\n move = 'R'\r\n x += 1\r\n if x > 0: \r\n move = 'L'\r\n x -= 1\r\n if y < 0: \r\n move += 'U'\r\n y += 1\r\n if y > 0: \r\n move += 'D'\r\n y -= 1\r\n print(move)\r\n", "I=input\r\nP=print\r\na=I()+I()\r\nb,c=(ord(a[i])-ord(a[i+2])for i in (0,1))\r\nP(max(b,-b,c,-c))\r\nwhile b!=0 or c!=0:\r\n r=''\r\n if b<0:\r\n r='R';b+=1\r\n if b>0:\r\n r='L';b-=1\r\n if c<0:\r\n r+='U';c+=1\r\n if c>0:\r\n r+='D';c-=1\r\n P(r)", "s = input()\r\nt = input()\r\nx1 = ord(s[0])-97\r\ny1 = int(s[1])-1\r\nx2 = ord(t[0])-97\r\ny2 = int(t[1])-1\r\ncount = 0\r\npath = []\r\nwhile(not (x1==x2 and y1==y2)):\r\n ans = \"\"\r\n if(x1>x2):\r\n ans += \"L\"\r\n x1 -= 1\r\n elif(x1<x2):\r\n ans += \"R\"\r\n x1 += 1\r\n if(y1>y2):\r\n ans += \"D\"\r\n y1 -= 1\r\n elif(y1<y2):\r\n ans += \"U\"\r\n y1 += 1\r\n count+=1\r\n path.append(ans)\r\nprint(count)\r\nfor x in path:\r\n print(x)\r\n", "a=list(input())\r\nb=list(input())\r\nx=ord(b[0])-ord(a[0])\r\ny=int(b[1])-int(a[1])\r\nprint(max(abs(x),abs(y)))\r\nif x>=0:\r\n if y>=0:\r\n for i in range(0,min(x,y)):\r\n print(\"RU\")\r\n if x>y:\r\n for i in range(0,x-y):\r\n print(\"R\")\r\n else:\r\n for i in range(0,y-x):\r\n print(\"U\")\r\n else:\r\n for i in range(0,min(x,abs(y))):\r\n print(\"RD\")\r\n if x>abs(y):\r\n for i in range(0,x-abs(y)):\r\n print(\"R\")\r\n else:\r\n for i in range(0,abs(y)-x):\r\n print(\"D\")\r\nelse:\r\n if y>=0:\r\n for i in range(0,min(abs(x),y)):\r\n print(\"LU\")\r\n if abs(x)>y:\r\n for i in range(0,abs(x)-y):\r\n print(\"L\")\r\n else:\r\n for i in range(0,y-abs(x)):\r\n print(\"U\")\r\n else:\r\n for i in range(0,min(abs(x),abs(y))):\r\n print(\"LD\")\r\n if abs(x)>abs(y):\r\n for i in range(0,abs(x)-abs(y)):\r\n print(\"L\")\r\n else:\r\n for i in range(0,abs(y)-abs(x)):\r\n print(\"D\")", "# Convert chessboard coordinates to row-column indices\r\ndef square_to_indices(square):\r\n file, rank = square\r\n col = ord(file) - ord('a')\r\n row = int(rank) - 1\r\n return row, col\r\n\r\n# Calculate the minimum number of moves required\r\ndef min_moves(s, t):\r\n s_row, s_col = square_to_indices(s)\r\n t_row, t_col = square_to_indices(t)\r\n return max(abs(t_row - s_row), abs(t_col - s_col))\r\n\r\n# define a function to get the moves from s to t\r\ndef get_moves(s, t):\r\n moves = []\r\n s_col, s_row = ord(s[0]), int(s[1])\r\n t_col, t_row = ord(t[0]), int(t[1])\r\n while (s_col, s_row) != (t_col, t_row):\r\n col_diff = t_col - s_col\r\n row_diff = t_row - s_row\r\n move = \"\"\r\n if col_diff > 0:\r\n move += 'R'\r\n s_col += 1\r\n elif col_diff < 0:\r\n move += 'L'\r\n s_col -= 1\r\n if row_diff > 0:\r\n move += 'U'\r\n s_row += 1\r\n elif row_diff < 0:\r\n move += 'D'\r\n s_row -= 1\r\n moves.append(move)\r\n return moves\r\n\r\n# read in the input\r\ns = input()\r\nt = input()\r\n\r\n# print the output\r\nprint(min_moves(s, t))\r\nfor move in get_moves(s, t):\r\n print(move)\r\n\r\n", "start = input()\r\nend = input()\r\nans = []\r\ndirections = [\"L\",\"R\",\"U\",\"D\",\"LU\",\"LD\",\"RU\",'RD']\r\ncols = [ord(start[0]),ord(end[0])]\r\nrows = [int(start[1]),int(end[1])]\r\nwhile cols[0] != cols[1] and rows[0] != rows[1]:\r\n if rows[0] < rows[1]:\r\n if cols[0] < cols[1]:\r\n rows[0] += 1\r\n cols[0] += 1\r\n ans.append(directions[6])\r\n else:\r\n rows[0] +=1\r\n cols[0] -=1\r\n ans.append(directions[4])\r\n else:\r\n if cols[0] < cols[1]:\r\n rows[0]-=1\r\n cols[0] +=1\r\n ans.append(directions[7])\r\n else:\r\n rows[0]-=1\r\n cols[0]-=1\r\n ans.append(directions[5])\r\nif cols[0] == cols[1] and rows[0] != rows[1]:\r\n if rows[0] < rows[1]:\r\n ans += [\"U\"]*(rows[1]-rows[0])\r\n else:\r\n ans += [\"D\"]*(rows[0]-rows[1])\r\nif rows[0] == rows[1] and cols[0] != cols[1]:\r\n if cols[0] < cols[1]:\r\n ans += [\"R\"]*(cols[1]-cols[0])\r\n else:\r\n ans += [\"L\"]*(cols[0]-cols[1])\r\nprint(len(ans))\r\nfor i in ans:\r\n print(i)", "chu=input()\r\nmo=input()\r\ncx=ord(chu[0])\r\ncy=int(chu[1])\r\n\r\nmx=ord(mo[0])\r\nmy=int(mo[1])\r\n\r\ndex=mx-cx\r\ndey=my-cy\r\nsteps=max(abs(dex),abs(dey))\r\nprint(steps)\r\n\r\nfor i in range(steps):\r\n if dex>0 and dey>0:\r\n print(\"RU\")\r\n dex-=1\r\n dey-=1\r\n elif dex<0 and dey>0:\r\n print(\"LU\")\r\n dex+=1\r\n dey-=1\r\n elif dex<0 and dey<0:\r\n print(\"LD\")\r\n dex+=1\r\n dey+=1\r\n elif dex>0 and dey<0:\r\n print(\"RD\")\r\n dex-=1\r\n dey+=1\r\n elif dex>0 and dey==0:\r\n print(\"R\")\r\n dex-=1\r\n elif dex<0 and dey==0:\r\n print(\"L\")\r\n dex+=1\r\n elif dex==0 and dey>0:\r\n print(\"U\")\r\n dey-=1\r\n elif dex==0 and dey<0:\r\n print(\"D\")\r\n dey+=1", "\norigin = input()\ndestination = input()\n\nx = ord(destination[0]) - ord(origin[0])\ny = ord(destination[1]) - ord(origin[1])\n\nprint(max(abs(x), abs(y)))\n\nwhile x != 0 or y != 0:\n line, x = ('L', x + 1) if x < 0 else (('R', x - 1) if x > 0 else ('', x))\n line, y = (line + 'D', y + 1) if y < 0 else ((line + 'U', y - 1) if y > 0 else (line, y))\n print(line)", "a=input()+input()\na,b=(ord(a[i])-ord(a[i+2])for i in(0,1))\nprint(max(a,-a,b,-b))\nwhile a!=0 or b!=0:\n r=''\n if a<0:r='R';a+=1\n if a>0:r='L';a-=1\n if b<0:r+='U';b+=1\n if b>0:r+='D';b-=1\n print(r)\n\t\t\t\t\t \t\t \t \t \t\t\t\t \t \t", "def solution():\r\n st=input()\r\n fn=input()\r\n p=st\r\n k=0\r\n ans=[]\r\n res=''\r\n # чтоб не втыкал\r\n while p!=fn:\r\n res=''\r\n if p[0]>fn[0]:\r\n res+='l'\r\n p=chr(ord(p[0])-1)+p[1]\r\n elif p[0]<fn[0]:\r\n res+='r'\r\n p=chr(ord(p[0])+1)+p[1]\r\n if p[1]>fn[1]:\r\n res+='d'\r\n p=p[0]+chr(ord(p[1])-1)\r\n elif p[1]<fn[1]:\r\n res+='u'\r\n p=p[0]+chr(ord(p[1])+1)\r\n ans.append(res)\r\n k+=1\r\n print(k)\r\n for i in range(k):\r\n print(ans[i].upper())\r\nsolution()\n# Tue Jul 11 2023 12:35:28 GMT+0300 (Moscow Standard Time)\n", "c1 = input()\r\nc2 = input()\r\nd = {'a':1, 'b':2, 'c':3, 'd':4, 'e':5, 'f':6, 'g':7, 'h':8}\r\nx0, y0 = (d[c1[0]], int(c1[1]))\r\nx, y = (d[c2[0]], int(c2[1]))\r\nprint(max(abs(x - x0), abs(y - y0)))\r\nwhile (x != x0 or y != y0):\r\n if (x0 < x):\r\n print(\"R\", end = '')\r\n x0 += 1\r\n elif (x0 > x):\r\n print(\"L\", end = \"\")\r\n x0 -= 1\r\n if (y0 < y):\r\n print(\"U\", end = '')\r\n y0 += 1\r\n elif (y0 > y):\r\n print(\"D\", end = \"\")\r\n y0 -= 1\r\n print()\r\n", "x='abcdefgh'\r\ny='12345678'\r\nb=input()\r\na=input()\r\nm=x.index(a[0])-x.index(b[0])\r\nn=int(a[1])-int(b[1])\r\np=max(abs(m), abs(n))\r\nprint(p)\r\nfor _ in range(p):\r\n if m>0 and n>0: print('RU'); m-=1; n-=1\r\n elif m>0 and n<0: print('RD'); m-=1; n+=1\r\n elif m<0 and n<0: print('LD'); m+=1; n+=1\r\n elif m<0 and n>0: print('LU'); m+=1; n-=1\r\n elif m==0 and n>0: print('U'); n-=1\r\n elif m==0 and n<0: print('D'); n+=1\r\n elif m<0 and n==0: print('L'); m+=1\r\n elif m>0 and n==0: print('R'); m-=1", "a, b = input(), input()\r\nx = (ord(a[0])-96) - (ord(b[0])-96)\r\ny = int(a[1]) - int(b[1])\r\nprint(m:=max(abs(x),abs(y)))\r\nfor i in range(m):\r\n print(''.join((('',('L','R')[x<0])[abs(x)>i],('',('D','U')[y<0])[abs(y)>i])))", "def Shortestpathoftheking(s,t):\r\n \r\n a = s+t\r\n a,b = (ord(a[i])-ord(a[i+2]) for i in (0,1))\r\n \r\n print(max(a,-a,b,-b))\r\n \r\n while a != 0 or b != 0:\r\n \r\n r = \"\"\r\n \r\n if a < 0: r = \"R\"; a += 1\r\n \r\n elif a > 0: r = \"L\"; a -= 1\r\n \r\n if b < 0: r += \"U\"; b += 1\r\n \r\n elif b > 0: r += \"D\"; b -= 1\r\n \r\n print(r)\r\n \r\n return \"\"\r\n\r\n\r\nLista = []\r\n\r\nfor i in range(2):\r\n All = [str(i) for i in input().split()]\r\n Lista.append(All)\r\n\r\nfor j in range(0,len(Lista),2):\r\n print(Shortestpathoftheking(Lista[j][0],Lista[j+1][0]))", "s=input()\nt=input()\nl=[]\ncount=0\nwhile s!=t:\n if s[0]==t[0]:\n if int(s[1])>int(t[1]):\n l.append(\"D\")\n s=s[0]+str(int(s[1])-1)\n count+=1\n elif int(s[1])<int(t[1]):\n l.append(\"U\")\n s=s[0]+str(int(s[1])+1)\n count+=1\n elif s[1]==t[1]:\n if s[0]>t[0]:\n l.append(\"L\")\n s=chr(ord(s[0])-1)+s[1]\n count+=1\n elif s[0]<t[0]:\n l.append(\"R\")\n s=chr(ord(s[0])+1)+s[1]\n count+=1\n elif s[0]>t[0] and int(s[1])<int(t[1]):\n s=chr(ord(s[0])-1)+s[1]\n s=s[0]+str(int(s[1])+1)\n l.append(\"LU\")\n count+=1\n elif s[0]>t[0] and int(s[1])>int(t[1]):\n s=chr(ord(s[0])-1)+s[1]\n s=s[0]+str(int(s[1])-1)\n l.append(\"LD\")\n count+=1\n elif s[0]<t[0] and int(s[1])<int(t[1]):\n s=chr(ord(s[0])+1)+s[1]\n s=s[0]+str(int(s[1])+1)\n l.append(\"RU\")\n count+=1\n elif s[0]<t[0] and int(s[1])>int(t[1]):\n s=chr(ord(s[0])+1)+s[1]\n s=s[0]+str(int(s[1])-1)\n l.append(\"RD\")\n count+=1 \n \nprint(count)\nif len(l)!=0:\n print(\"\\n\".join(l))\n\n \n", "s0=input()\r\nt0=input()\r\nsx,tx=(ord(s0[0])-ord('a')+1),(ord(t0[0])-ord('a')+1)\r\nsy,ty=int(s0[1]),int(t0[1])\r\nif sx==tx and sy==ty:\r\n print('0')\r\nelif sx==tx and sy!=ty:\r\n print(abs(sy-ty))\r\n while sy!=ty:\r\n if sy<ty:\r\n print('U')\r\n sy+=1\r\n else:\r\n print('D')\r\n sy-=1\r\nelif sy==ty and sx!=tx:\r\n print(abs(sx-tx))\r\n while sx!=tx:\r\n if sx<tx:\r\n print('R')\r\n sx+=1\r\n else:\r\n print('L')\r\n sx-=1\r\nelif sx<tx and sy<ty:\r\n print(max(tx-sx,ty-sy))\r\n while tx!=sx and ty!=sy:\r\n print('RU')\r\n sx+=1\r\n sy+=1\r\n while tx!=sx:\r\n print('R')\r\n sx+=1\r\n while ty!=sy:\r\n print('U')\r\n sy+=1\r\nelif sx>tx and sy>ty:\r\n print(max(sx-tx,sy-ty))\r\n while tx!=sx and ty!=sy:\r\n print('LD')\r\n sx-=1\r\n sy-=1\r\n while tx!=sx:\r\n print('L')\r\n sx-=1\r\n while ty!=sy:\r\n print('D')\r\n sy-=1\r\nelif sx<tx and sy>ty:\r\n print(max(tx-sx,sy-ty))\r\n while tx!=sx and ty!=sy:\r\n print('RD')\r\n sx+=1\r\n sy-=1\r\n while tx!=sx:\r\n print('R')\r\n sx+=1\r\n while ty!=sy:\r\n print('D')\r\n sy-=1\r\nelse:\r\n print(max(sx - tx, ty - sy))\r\n while tx != sx and ty != sy:\r\n print('LU')\r\n sx -= 1\r\n sy += 1\r\n while tx != sx:\r\n print('L')\r\n sx -= 1\r\n while ty != sy:\r\n print('U')\r\n sy += 1", "s=input()\r\nl = input()\r\nc,d= ord(s[0])-ord(l[0]),ord(s[1])-ord(l[1])\r\nprint(max(c,-c,d,-d))\r\nwhile c!=0 or d!=0:\r\n g = ''\r\n if c<0:\r\n g='R';c+=1\r\n if c>0:\r\n g='L';c-=1\r\n if d<0:\r\n g+='U';d+=1\r\n if d>0:\r\n g+='D';d-=1\r\n print(g)", "convert = {\r\n 'a': 1,\r\n 'b': 2,\r\n 'c': 3,\r\n 'd': 4,\r\n 'e': 5,\r\n 'f': 6,\r\n 'g': 7,\r\n 'h': 8\r\n}\r\nsrc = list(input())\r\nsrc = [int(src[1]), convert[src[0]]]\r\ndest = list(input())\r\ndest = [int(dest[1]), convert[dest[0]]]\r\n\r\ndef getDirection(src_pos, dest_pos):\r\n if src_pos > dest_pos:\r\n i = -1\r\n elif src_pos < dest_pos:\r\n i = 1\r\n else:\r\n i = 0\r\n return i\r\ndef mapDirection(r, c):\r\n # Row\r\n if r < 0:\r\n r_dir = \"D\"\r\n elif r > 0:\r\n r_dir = \"U\"\r\n else:\r\n r_dir = ''\r\n # Column\r\n if c < 0:\r\n c_dir = \"L\"\r\n elif c > 0:\r\n c_dir = \"R\"\r\n else:\r\n c_dir = ''\r\n return (c_dir + r_dir)\r\n\r\nsteps = []\r\nwhile (src != dest):\r\n r = getDirection(src[0], dest[0])\r\n c = getDirection(src[1], dest[1])\r\n steps.append(mapDirection(r, c))\r\n src[0] += r\r\n src[1] += c\r\nprint(len(steps))\r\nfor step in steps:\r\n print(step)", "start = input()\r\nend = input()\r\nabc = ['a','b','c','d','e','f','g','h']\r\ns1 = abc.index(start[0])+1\r\ns2 = int(start[1])\r\ne1 = abc.index(end[0])+1\r\ne2 = int(end[1])\r\nmoves = []\r\ncount = 0\r\nwhile not(s1 == e1 and s2 == e2):\r\n move = \"\"\r\n if s1 > e1:\r\n move = move + \"L\"\r\n s1 = s1 - 1\r\n if s1 < e1:\r\n move = move + \"R\"\r\n s1 = s1 + 1\r\n if s2 > e2:\r\n move = move + \"D\"\r\n s2 = s2 - 1\r\n if s2 < e2:\r\n move = move + \"U\"\r\n s2 = s2 + 1\r\n count = count + 1\r\n moves.append(move)\r\nprint(count)\r\nfor c in moves:\r\n print(c)", "a=input()\r\nb=input()\r\na1=ord(a[0])\r\na2=int(a[1])\r\nb1=ord(b[0])\r\nb2=int(b[1])\r\nl=[]\r\nans=0\r\nwhile(a1<b1 and a2<b2):\r\n l.append('RU')\r\n a1+=1\r\n a2+=1\r\n ans+=1\r\nwhile(a1>b1 and a2<b2):\r\n l.append('LU')\r\n a1-=1\r\n a2+=1\r\n ans+=1\r\nwhile(a1>b1 and a2>b2):\r\n l.append('LD')\r\n a1-=1\r\n a2-=1\r\n ans+=1\r\nwhile(a1<b1 and a2>b2):\r\n l.append('RD')\r\n a1+=1\r\n a2-=1\r\n ans+=1\r\nwhile(a1<b1):\r\n a1+=1\r\n l.append('R')\r\n ans+=1\r\nwhile(a1>b1):\r\n a1-=1\r\n l.append('L')\r\n ans+=1\r\nwhile(a2<b2):\r\n a2+=1\r\n l.append('U')\r\n ans+=1\r\nwhile(a2>b2):\r\n a2-=1\r\n l.append('D')\r\n ans+=1\r\nprint(ans)\r\nfor i in l:\r\n print(i)\r\n", "\ndef parse(cell):\n return ord(cell[0]) - ord('a') + 1, int(cell[1])\n\n\nsrc_x, src_y = parse(input())\ndst_x, dst_y = parse(input())\n\n\ndef moves(src_x, src_y, dst_x, dst_y):\n while src_x != dst_x or src_y != dst_y:\n move = ''\n if src_x != dst_x:\n move += 'R' if dst_x > src_x else 'L'\n src_x += 1 if dst_x > src_x else -1\n if src_y != dst_y:\n move += 'U' if dst_y > src_y else 'D'\n src_y += 1 if dst_y > src_y else -1\n yield move\n\n\nm = list(moves(src_x, src_y, dst_x, dst_y))\n\nprint(len(m))\nprint('\\n'.join(m))\n", "def II():\r\n return(int(input()))\r\ndef LMI():\r\n return(list(map(int,input().split())))\r\ndef I():\r\n return(input())\r\ndef MII():\r\n return(map(int,input().split()))\r\n# import sys\r\n# input=sys.stdin.readline\r\n# import io,os\r\n# input = io.BytesIO(os.read(0,os.fstat(0).st_size)).readline\r\n# from collections import Counter\r\n# int(math.log(len(L)))\r\n# import math\r\n# from collections import defaultdict\r\n# mod=10**9+7\r\n# from collections import deque\r\n# import math\r\n\r\n\r\ndef t():\r\n s=I()\r\n c=I()\r\n a=[ord(s[0])-ord(\"a\"),int(s[1])]\r\n b=[ord(c[0])-ord(\"a\"),int(c[1])]\r\n ans=[]\r\n while a[0]!=b[0] and a[1]!=b[1]:\r\n m=\"\"\r\n if b[0]>a[0]:\r\n m+=\"R\"\r\n a[0]+=1\r\n else:\r\n m+=\"L\"\r\n a[0]-=1\r\n if b[1]>a[1]:\r\n m+=\"U\"\r\n a[1]+=1\r\n else:\r\n m+=\"D\"\r\n a[1]-=1\r\n ans.append(m)\r\n while a[0]!=b[0]:\r\n if b[0]>a[0]:\r\n ans.append(\"R\")\r\n a[0]+=1\r\n else:\r\n ans.append(\"L\")\r\n a[0]-=1\r\n while a[1]!=b[1]:\r\n if b[1]>a[1]:\r\n ans.append(\"U\")\r\n a[1]+=1\r\n else:\r\n ans.append(\"D\")\r\n a[1]-=1\r\n print(len(ans))\r\n for i in ans:\r\n print(i)\r\n\r\n\r\n\r\nif __name__==\"__main__\":\r\n\r\n # for _ in range(II()):\r\n # t()\r\n t()", "src = [i for i in input()]\r\ndst = [i for i in input()]\r\n\r\nsrc_ro = int(ord(src[0])-ord('a'))+1\r\nsrc_col = int(src[1])\r\ndst_ro = int(ord(dst[0])-ord('a'))+1\r\ndst_col = int(dst[1])\r\n\r\n# print(src_ro, src_col, dst_ro, dst_col)\r\n\r\nif src_ro <= dst_ro: \r\n vertical_orientation = \"R\"\r\nelse: \r\n vertical_orientation = \"L\"\r\n\r\nif src_col <= dst_col: \r\n horizontal_orientation = \"U\"\r\nelse: \r\n horizontal_orientation = \"D\"\r\n\r\nvertical_distance = abs(src_ro-dst_ro)\r\nhorizontal_distance = abs(src_col-dst_col)\r\n\r\nif horizontal_distance < vertical_distance:\r\n print(vertical_distance)\r\n for i in range(horizontal_distance): \r\n print(vertical_orientation+horizontal_orientation)\r\n for i in range(vertical_distance-horizontal_distance): \r\n print(vertical_orientation)\r\nelse:\r\n print(horizontal_distance)\r\n for i in range(vertical_distance): \r\n print(vertical_orientation+horizontal_orientation)\r\n for i in range(horizontal_distance-vertical_distance): \r\n print(horizontal_orientation)", "def ver_direction_decider(dis, res):\r\n\tif dis > 0: return res + 'U'\r\n\telif dis == 0: return res\r\n\telse: return res + 'D'\r\n\r\n\r\ndef hor_direction_decider(dis):\r\n\tdire = ''\r\n\tif disp[0] > 0: \r\n\t\tdire += 'R'\r\n\t\treturn ver_direction_decider(disp[1], dire)\r\n\telif disp[0] == 0:\r\n\t\treturn ver_direction_decider(disp[1], dire)\r\n\telse: \r\n\t\tdire += 'L'\r\n\t\treturn ver_direction_decider(disp[1], dire)\r\n\r\n\r\nstart = input();end = input()\r\nst = (ord(start[0])-97, int(start[1]) - 1); ed = (ord(end[0])-97, int(end[1]) - 1)\r\ndisp = (ed[0]-st[0], ed[1]-st[1]); ab_disp = (abs(disp[0]), abs(disp[1]))\r\nn_diag = min(ab_disp); n_str = max(ab_disp) - n_diag; is_str = (n_diag == 0); is_diag = (n_str == 0);\r\nn_moves = n_str + n_diag\r\nprint(n_moves)\r\nstr_dir = hor_direction_decider(disp)\r\nif is_str or is_diag:\r\n\tfor _ in range(n_moves):\r\n\t\tprint(str_dir)\r\nelse:\r\n\tif ab_disp[1] > ab_disp[0]: str_comp = str_dir[1]\r\n\telse: str_comp = str_dir[0]\r\n\tfor _ in range(n_str):\r\n\t\tprint(str_comp)\r\n\tfor _ in range(n_diag):\r\n\t\tprint(str_dir)", "import queue\r\n\r\nstart_raw, end_raw = input(), input()\r\n\r\nstart, end = map(lambda x: (ord(x[0])-96, int(x[1])), [start_raw, end_raw])\r\n\r\ngrid = {(c, r): set() for r in range(1, 9) for c in range(1, 9)}\r\nfor c, r in grid:\r\n if c > 1:\r\n grid[(c, r)].add('L')\r\n if c < 8:\r\n grid[(c, r)].add('R')\r\n if r > 1:\r\n grid[(c, r)].add('D')\r\n if r < 8:\r\n grid[(c, r)].add('U')\r\n if c > 1 and r > 1:\r\n grid[(c, r)].add('LD')\r\n if c < 8 and r > 1:\r\n grid[(c, r)].add('RD')\r\n if c > 1 and r < 8:\r\n grid[(c, r)].add('LU')\r\n if c < 8 and r < 8:\r\n grid[(c, r)].add('RU')\r\n\r\ndef make_move(pos, move):\r\n up, right = 0, 0\r\n if 'U' in move:\r\n up += 1\r\n if 'D' in move:\r\n up -= 1\r\n if 'R' in move:\r\n right += 1\r\n if 'L' in move:\r\n right -= 1\r\n return (pos[0]+right, pos[1]+up)\r\n\r\nq = queue.Queue()\r\nseen = set()\r\nq.put((start, []))\r\nwhile q.qsize():\r\n pos, path = q.get()\r\n if pos in seen:\r\n continue\r\n seen.add(pos)\r\n if pos == end:\r\n print(len(path))\r\n print(*path, sep='\\n')\r\n break\r\n for move in grid[pos]:\r\n q.put((make_move(pos, move), path+[move]))\r\n", "a = input();\r\nb = input();\r\na = [ord(a[0]) - ord('a') + 1, int(a[1])]\r\nb = [ord(b[0]) - ord('a') + 1, int(b[1])]\r\nc = [b[0] - a[0], b[1] - a[1]]\r\nmn = min(abs(c[0]), abs(c[1]))\r\nk = mn;\r\nk += max(abs(c[0]) - mn, abs(c[1]) - mn)\r\nprint(k);\r\nwhile (abs(c[0]) > 0) | (abs(c[1]) > 0):\r\n ans = \"\"\r\n if (c[0] > 0):\r\n ans += 'R'\r\n c[0] -= 1;\r\n elif (c[0] < 0):\r\n ans += 'L'\r\n c[0] += 1;\r\n if (c[1] > 0):\r\n ans += 'U'\r\n c[1] -= 1;\r\n elif (c[1] < 0):\r\n ans += 'D'\r\n c[1] += 1;\r\n print(ans);\r\n\r\n\r\n \r\n", "a = input()\r\nb = input()\r\n\r\nx1 = ord(a[0]) - ord('a')\r\ny1 = ord(a[1]) - ord('1')\r\nx2 = ord(b[0]) - ord('a')\r\ny2 = ord(b[1]) - ord('1')\r\n\r\nsteps = []\r\n\r\nwhile not (x1 == x2 and y1 == y2):\r\n if x1 != x2 and y1 != y2:\r\n h = None\r\n if x1 < x2:\r\n x1 += 1\r\n h = 'R'\r\n else:\r\n x1 -= 1\r\n h = 'L'\r\n if y1 < y2:\r\n y1 += 1\r\n v = 'U'\r\n else:\r\n y1 -= 1\r\n v = 'D'\r\n steps.append(h + v)\r\n elif x1 != x2:\r\n if x1 < x2:\r\n x1 += 1\r\n steps.append('R')\r\n else:\r\n x1 -= 1\r\n steps.append('L')\r\n else:\r\n if y1 < y2:\r\n y1 += 1\r\n steps.append('U')\r\n else:\r\n y1 -= 1\r\n steps.append('D')\r\n\r\nprint(len(steps))\r\nfor step in steps:\r\n print(step)\r\n", "def convert_to_tuple(s):\r\n return (ord(s[0]) - ord(\"a\"), int(s[1]) - 1)\r\n\r\n\r\ndef main():\r\n starting_position = convert_to_tuple(input())\r\n ending_position = convert_to_tuple(input())\r\n difference = (\r\n ending_position[0] - starting_position[0],\r\n ending_position[1] - starting_position[1],\r\n )\r\n\r\n temp_arr = []\r\n while difference != (0, 0):\r\n temp_string = \"\"\r\n if difference[0] > 0:\r\n temp_string += \"R\"\r\n difference = (difference[0] - 1, difference[1])\r\n elif difference[0] < 0:\r\n temp_string += \"L\"\r\n difference = (difference[0] + 1, difference[1])\r\n if difference[1] > 0:\r\n temp_string += \"U\"\r\n difference = (difference[0], difference[1] - 1)\r\n elif difference[1] < 0:\r\n temp_string += \"D\"\r\n difference = (difference[0], difference[1] + 1)\r\n temp_arr.append(temp_string)\r\n\r\n print(len(temp_arr))\r\n for element in temp_arr:\r\n print(element)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "#n = int(input())\r\n#x,y,z = list(map(int, input().split()))\r\ns = input()\r\nt = input()\r\n\r\ncoder = {k:v for v,k in enumerate('abcdefgh')}\r\n\r\ndelta_x = coder[t[0]] - coder[s[0]]\r\ndelta_y = int(t[1]) - int(s[1])\r\n\r\nsteps = []\r\n#print(delta_x, delta_y)\r\nwhile abs(delta_x )>0 or abs(delta_y) > 0:\r\n \r\n if delta_x < 0 and delta_y == 0:\r\n steps.append('L')\r\n delta_x += 1\r\n elif delta_x > 0 and delta_y == 0:\r\n steps.append('R')\r\n delta_x -= 1\r\n elif delta_x == 0 and delta_y > 0:\r\n steps.append('U')\r\n delta_y -= 1\r\n elif delta_x == 0 and delta_y < 0:\r\n steps.append('D')\r\n delta_y += 1\r\n \r\n elif delta_x < 0 and delta_y < 0:\r\n steps.append('LD')\r\n delta_x += 1\r\n delta_y += 1\r\n elif delta_x < 0 and delta_y > 0:\r\n steps.append('LU')\r\n delta_x += 1\r\n delta_y -= 1\r\n elif delta_x > 0 and delta_y > 0:\r\n steps.append('RU')\r\n delta_x -= 1\r\n delta_y -= 1\r\n elif delta_x > 0 and delta_y < 0:\r\n steps.append('RD')\r\n delta_x -= 1\r\n delta_y += 1\r\n\r\n \r\nprint(len(steps))\r\nprint('\\n'.join(steps))", "start = input()\nend = input()\nstart = (ord(start[0]) - ord('a'), int(start[1]) - 1)\nend = (ord(end[0]) - ord('a'), int(end[1]) - 1)\ndx = end[0] - start[0]\ndy = end[1] - start[1]\nprint(max(abs(dx), abs(dy)))\nwhile dx or dy:\n move = \"\"\n if dx > 0:\n dx -= 1\n move += \"R\"\n if dx < 0:\n dx += 1\n move += \"L\"\n if dy > 0:\n dy -= 1\n move += \"U\"\n if dy < 0:\n dy += 1\n move += \"D\"\n print(move)\n \t \t \t\t\t \t \t \t\t\t\t \t \t \t", "\r\ns=list(input(' ')) \r\nt=list(input(' ')) \r\nd = int(s[1])-int(t[1])\r\ndd=ord(s[0])-ord(t[0])\r\nif dd==0 : \r\n if d>=0 : \r\n print(d)\r\n for i in range(1,d+1):\r\n print('D')\r\n else : \r\n print(-d)\r\n for i in range(1,-d+1):\r\n print('U') \r\nelif d==0 :\r\n if dd>=0 : \r\n print(dd)\r\n for i in range(1,dd+1):\r\n print('L')\r\n else : \r\n print(-dd)\r\n for i in range(1,-dd+1):\r\n print('R') \r\nelif d==dd and d<0 :\r\n print(-d) \r\n for i in range(1,-d+1): \r\n print('RU') \r\nelif d==dd and d>0 :\r\n print(d) \r\n for i in range(1,d+1): \r\n print('LD') \r\nelif d==-dd and d<0 :\r\n print(-d) \r\n for i in range(1,-d+1): \r\n print('LU') \r\nelif d==-dd and d>0 :\r\n print(d) \r\n for i in range(1,d+1): \r\n print('RD') \r\nelse :\r\n if max(abs(d),abs(dd))==abs(d) :\r\n if d>0:\r\n print(d)\r\n if dd>0:\r\n for j in range(1,d-dd+1):\r\n print('D')\r\n for i in range(1,dd+1): \r\n print('LD') \r\n else :\r\n for j in range(1,d+dd+1):\r\n print('D')\r\n for i in range(1,-dd+1): \r\n print('RD') \r\n else : \r\n print(-d)\r\n if dd>0:\r\n for j in range(1,-d-dd+1):\r\n print('U')\r\n for i in range(1,dd+1): \r\n print('LU') \r\n else :\r\n for j in range(1,-d+dd+1):\r\n print('U')\r\n for i in range(1,-dd+1): \r\n print('RU') \r\n else : \r\n if dd>0:\r\n print(dd)\r\n if d>0:\r\n for j in range(1,dd-d+1):\r\n print('L')\r\n for i in range(1,d+1): \r\n print('LD') \r\n else :\r\n for j in range(1,dd+d+1):\r\n print('L')\r\n for i in range(1,-d+1): \r\n print('LU') \r\n else : \r\n print(-dd)\r\n if d>0:\r\n for j in range(1,-dd-d+1):\r\n print('R')\r\n for i in range(1,d+1): \r\n print('RD') \r\n else :\r\n for j in range(1,-dd+d+1):\r\n print('R')\r\n for i in range(1,-d+1): \r\n print('RU') \r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "import math\r\nalph=\"abcdefghijklmnopqrstuvwxyz\"\r\n#-----------------------------------\r\n\r\ns=str(input())\r\nt=str(input())\r\nx1=alph.index(s[0])\r\nx2=alph.index(t[0])\r\ny1=int(s[1]);y2=int(t[1])\r\n\r\nprint(max(abs(x1-x2),abs(y1-y2)))\r\n\r\nwhile x1!=x2 or y1!=y2:\r\n if x1<x2:\r\n if y1<y2:\r\n print(\"RU\")\r\n x1+=1;y1+=1\r\n elif y1>y2:\r\n print(\"RD\")\r\n x1+=1;y1-=1\r\n else:\r\n print(\"R\")\r\n x1+=1\r\n elif x1==x2:\r\n if y1<y2:\r\n print(\"U\")\r\n y1+=1\r\n else:\r\n print(\"D\")\r\n y1-=1\r\n else:\r\n if y1<y2:\r\n print(\"LU\")\r\n x1-=1;y1+=1\r\n elif y1==y2:\r\n print(\"L\")\r\n x1-=1\r\n else:\r\n print(\"LD\")\r\n x1-=1;y1-=1\r\n \r\n\r\n\r\n", "\r\nd={}\r\nd['a']=0\r\nd['b']=1\r\nd['c']=2\r\nd['d']=3\r\nd['e']=4\r\nd['f']=5\r\nd['g']=6\r\nd['h']=7\r\n\r\n\r\ns=input()\r\nt=input()\r\n\r\n\r\nsrc=[d[s[0]], 7-int(s[1])+1]\r\nmdest=[ d[t[0]], 7-int(t[1])+1]\r\n\r\nxi, yi= src\r\nxf, yf = mdest\r\n\r\nprint(max(abs(xf-xi), abs(yf-yi)))\r\n\r\nwhile True:\r\n\r\n\tif xi==xf and yf==yi:\r\n\t\tbreak \r\n\r\n\tif xi<xf:\r\n\t\txi+=1 \r\n\t\tprint('R', end='')\r\n\r\n\tif xi>xf:\r\n\t\txi-=1\r\n\t\tprint('L', end='')\r\n\r\n\tif yi<yf:\r\n\t\tyi+=1\r\n\t\tprint('D', end='')\r\n\r\n\tif yi>yf:\r\n\t\tyi-=1\r\n\t\tprint('U', end='')\r\n\r\n\tprint()\r\n\r\n", "'''input\r\nh1\r\na8\r\n'''\r\ndef impossible():\r\n\tprint(-1)\r\n\texit(0)\r\n\r\na = list(input().strip())\r\nb= list(input().strip())\r\na[1] = int(a[1])\r\nb[1] = int(b[1])\r\nprint(max(abs(ord(a[0])-ord(b[0])), abs(a[1]-b[1])))\r\n\r\nwhile a!=b:\r\n\tif ord(a[0])-ord(b[0])>0:\r\n\t\tprint('L', end ='')\r\n\t\ta[0] = chr(ord(a[0]) - 1)\r\n\tif ord(a[0])-ord(b[0])<0:\r\n\t\tprint('R', end ='')\r\n\t\ta[0] = chr(ord(a[0]) + 1)\r\n\tif a[1]-b[1]>0:\r\n\t\tprint(\"D\", end ='')\r\n\t\ta[1] -= 1\r\n\tif a[1]-b[1]<0:\r\n\t\tprint(\"U\", end ='')\r\n\t\ta[1] += 1\r\n\tprint()", "def letter_to_num(a):\r\n if a == 'a':\r\n return 1\r\n elif a == 'b':\r\n return 2\r\n elif a == 'c':\r\n return 3\r\n elif a == 'd':\r\n return 4\r\n elif a == 'e':\r\n return 5\r\n elif a == 'f':\r\n return 6\r\n elif a == 'g':\r\n return 7\r\n elif a == 'h':\r\n return 8\r\n else:\r\n return int(a) \r\nstart_s = input()\r\nend_s = input()\r\nx = []\r\ny = []\r\nz = []\r\nfor i in start_s:\r\n x.append(letter_to_num(i))\r\nfor i in end_s:\r\n y.append(letter_to_num(i))\r\nn = 0\r\nwhile x != y:\r\n if x[0] == y[0]:\r\n if x[1] < y[1]:\r\n x[1] += 1\r\n n += 1\r\n z.append('U')\r\n elif x[1] > y[1]:\r\n x[1] -= 1\r\n n += 1\r\n z.append('D')\r\n elif x[0] < y[0]:\r\n if x[1] == y[1]:\r\n x[0] += 1\r\n n += 1\r\n z.append('R')\r\n elif x[1] < y[1]:\r\n x[0] += 1\r\n x[1] += 1\r\n n += 1\r\n z.append('RU')\r\n elif x[1] > y[1]:\r\n x[0] += 1\r\n x[1] -= 1\r\n n += 1\r\n z.append('RD')\r\n elif x[0] > y[0]:\r\n if x[1] == y[1]:\r\n x[0] -= 1\r\n n += 1\r\n z.append('L')\r\n elif x[1] < y[1]:\r\n x[0] -= 1\r\n x[1] += 1\r\n n += 1\r\n z.append('LU')\r\n elif x[1] > y[1]:\r\n x[0] -= 1\r\n x[1] -= 1\r\n n += 1\r\n z.append('LD')\r\nprint(n)\r\nprint(*z,sep=\"\\n\")", "# LUOGU_RID: 121377288\na=input();b=input();ls=[\"x\",\"a\",\"b\",\"c\",\"d\",\"e\",\"f\",\"g\",\"h\"];ls2=[]\nif ls.index(a[0])>ls.index(b[0]):\n c=ls.index(a[0])-ls.index(b[0])\n if int(a[1])>int(b[1]):\n d=int(a[1])-int(b[1])\n if c>d:\n e=d\n print(c)\n for i in range(e):\n print(\"LD\")\n for i in range(c-e):\n print(\"L\")\n elif c<d:\n e=c\n print(d)\n for i in range(e):\n print(\"LD\")\n for i in range(d-e):\n print(\"D\")\n elif c==d:\n print(c)\n for i in range(c):\n print(\"LD\")\n elif int(a[1])<int(b[1]):\n d=int(b[1])-int(a[1])\n if c>d:\n e=d\n print(c)\n for i in range(e):\n print(\"LU\")\n for i in range(c-e):\n print(\"L\")\n elif c<d:\n e=c\n print(d)\n for i in range(e):\n print(\"LU\")\n for i in range(d-e):\n print(\"U\")\n elif c==d:\n print(c)\n for i in range(c):\n print(\"LU\")\n elif int(a[1])==int(b[1]):\n print(c)\n for i in range(c):\n print(\"L\")\nelif ls.index(a[0])<ls.index(b[0]):\n c=ls.index(b[0])-ls.index(a[0])\n if int(a[1])>int(b[1]):\n d=int(a[1])-int(b[1])\n if c>d:\n e=d\n print(c)\n for i in range(e):\n print(\"RD\")\n for i in range(c-e):\n print(\"R\")\n elif c<d:\n e=c\n print(d)\n for i in range(e):\n print(\"RD\")\n for i in range(d-e):\n print(\"D\")\n elif c==d:\n print(c)\n for i in range(c):\n print(\"RD\")\n elif int(a[1])<int(b[1]):\n d=int(b[1])-int(a[1])\n if c>d:\n e=d\n print(c)\n for i in range(e):\n print(\"RU\")\n for i in range(c-e):\n print(\"R\")\n elif c<d:\n e=c\n print(d)\n for i in range(e):\n print(\"RU\")\n for i in range(d-e):\n print(\"U\")\n elif c==d:\n print(c)\n for i in range(c):\n print(\"RU\")\n elif int(a[1])==int(b[1]):\n print(c)\n for i in range(c):\n print(\"R\")\nelif a[0]==b[0]:\n if int(a[1])>int(b[1]):\n print(int(a[1])-int(b[1]))\n for i in range(int(a[1])-int(b[1])):\n print(\"D\")\n elif int(a[1])<int(b[1]):\n print(int(b[1])-int(a[1]))\n for i in range(int(b[1])-int(a[1])):\n print(\"U\")\n elif int(a[1])==int(b[1]):\n print(0)", "__author__ = 'Obriel Muga'\r\n\r\ncolumnas = ['a','b','c','d','e','f','g','h']\r\n\r\ndef ajedrez(posicion_actual,posicion_final,lista_final):\r\n c_actual,f_actual = posicion_actual\r\n c_final,f_final = posicion_final\r\n if (posicion_actual == posicion_final):\r\n print(len(lista_final))\r\n for i in lista_final:\r\n print(i)\r\n return\r\n elif (c_actual < c_final and f_actual < f_final):\r\n lista_final.append(\"RU\")\r\n return ajedrez((c_actual + 1,f_actual + 1),(posicion_final),lista_final)\r\n elif (c_actual > c_final and f_actual > f_final):\r\n lista_final.append(\"LD\")\r\n return ajedrez((c_actual - 1, f_actual - 1),(posicion_final),lista_final)\r\n elif (c_actual == c_final and f_actual < f_final):\r\n lista_final.append(\"U\")\r\n return ajedrez((c_actual,f_actual + 1),(posicion_final),lista_final)\r\n elif (c_actual > c_final and f_actual < f_final):\r\n lista_final.append(\"LU\")\r\n return ajedrez((c_actual - 1,f_actual + 1),(posicion_final),lista_final)\r\n elif (c_actual == c_final and f_actual > f_final):\r\n lista_final.append(\"D\")\r\n return ajedrez((c_actual,f_actual -1),(posicion_final),lista_final)\r\n elif (c_actual < c_final and f_actual > f_final):\r\n lista_final.append(\"RD\")\r\n return ajedrez((c_actual + 1, f_actual - 1),(posicion_final),lista_final)\r\n elif (f_actual == f_final and c_actual > c_final):\r\n lista_final.append(\"L\")\r\n return ajedrez((c_actual - 1,f_actual),(posicion_final),lista_final)\r\n elif (f_actual == f_final and c_actual < c_final):\r\n lista_final.append(\"R\")\r\n return ajedrez((c_actual + 1, f_actual),(posicion_final),lista_final)\r\n \r\n\r\nif __name__ == '__main__':\r\n inicio = str(input())\r\n final = str(input())\r\n columna_inicial = columnas.index(inicio[0])\r\n columna_final = columnas.index(final[0])\r\n fila_inicial = int(inicio[1]) - 1\r\n fila_final = int(final[1]) - 1\r\n ajedrez((columna_inicial,fila_inicial),(columna_final,fila_final),[])\r\n \r\n\r\n", "import math\r\nalph=\"abcdefghijklmnopqrstuvwxyz\"\r\n#-----------------------------------\r\n\r\ns=str(input())\r\nt=str(input())\r\nx1=alph.index(s[0])\r\nx2=alph.index(t[0])\r\ny1=int(s[1]);y2=int(t[1])\r\ndx=x2-x1;dy=y2-y1\r\n\r\nn=max(abs(dx),abs(dy))\r\nprint(n)\r\n\r\ndelta=abs(abs(dx)-abs(dy))\r\nif abs(dx)>=abs(dy):\r\n if dx>=0:\r\n for i in range(delta):\r\n print(\"R\")\r\n if dy>=0:\r\n for i in range(abs(dy)):\r\n print(\"RU\")\r\n else:\r\n for i in range(abs(dy)):\r\n print(\"RD\")\r\n else:\r\n for i in range(delta):\r\n print(\"L\")\r\n if dy>=0:\r\n for i in range(abs(dy)):\r\n print(\"LU\")\r\n else:\r\n for i in range(abs(dy)):\r\n print(\"LD\")\r\nelse:\r\n if dy>=0:\r\n for i in range(delta):\r\n print(\"U\")\r\n if dx>=0:\r\n for i in range(abs(dx)):\r\n print(\"RU\")\r\n else:\r\n for i in range(abs(dx)):\r\n print(\"LU\")\r\n else:\r\n for i in range(delta):\r\n print(\"D\")\r\n if dx>=0:\r\n for i in range(abs(dx)):\r\n print(\"RD\")\r\n else:\r\n for i in range(abs(dx)):\r\n print(\"LD\")", "import math\r\nline1=input()\r\nline2=input()\r\nrow_numeral1=ord(line1[0])\r\nrow_numeral2=ord(line2[0])\r\ncolumn_numeral1=ord(line1[1])\r\ncolumn_numeral2=ord(line2[1])\r\nrow_diff=row_numeral2-row_numeral1\r\ncolumn_diff=column_numeral2-column_numeral1\r\ntotal_steps=abs(row_diff) if abs(row_diff)>abs(column_diff) else abs(column_diff)\r\nprint(total_steps)\r\nrow_print_character='R' if row_diff>0 else 'L'\r\ncolumn_print_character='U' if column_diff>0 else 'D'\r\nrow_prints=abs(row_diff)\r\ncolumn_prints=abs(column_diff)\r\nfor i in range(total_steps):\r\n if(row_prints>0):\r\n print(row_print_character,end='')\r\n row_prints-=1\r\n if(column_prints>0):\r\n print(column_print_character,end='')\r\n column_prints-=1\r\n print('')", "s = input()\r\n\r\nt = input()\r\n\r\nx1 = ord(s[0]) - 97 + 1\r\ny1 = ord(s[1]) - ord('0')\r\n\r\nx2 = ord(t[0]) - 97 + 1\r\ny2 = ord(t[1]) - ord('0')\r\n\r\n\r\n\r\nlist = []\r\nwhile(x1 < x2 and y1 < y2):\r\n list.append(\"RU\")\r\n x1 += 1\r\n y1 += 1\r\nwhile(x1 < x2 and y1 > y2):\r\n x1 += 1\r\n y1 -= 1\r\n list.append(\"RD\")\r\nwhile(x1 > x2 and y1 < y2):\r\n x1 -= 1\r\n y1 += 1\r\n list.append(\"LU\")\r\nwhile(x1 > x2 and y1 > y2):\r\n x1 -= 1\r\n y1 -= 1\r\n list.append(\"LD\") \r\nwhile(x1 < x2):\r\n x1 += 1\r\n list.append(\"R\")\r\nwhile(x1 > x2):\r\n x1 -= 1\r\n list.append(\"L\")\r\nwhile(y1 < y2):\r\n y1 += 1\r\n list.append(\"U\")\r\nwhile(y1 > y2):\r\n y1 -= 1\r\n list.append(\"D\") \r\n\r\n \r\n \r\n \r\n \r\n \r\nprint(len(list))\r\n \r\nfor i in list:\r\n print(i)", "def get_moves(s, t):\r\n s_file, s_rank = ord(s[0]) - ord('a'), int(s[1])\r\n t_file, t_rank = ord(t[0]) - ord('a'), int(t[1])\r\n file_diff = t_file - s_file\r\n rank_diff = t_rank - s_rank\r\n\r\n moves = []\r\n num_moves = max(abs(file_diff), abs(rank_diff))\r\n for _ in range(num_moves):\r\n move = \"\"\r\n if file_diff < 0:\r\n move += 'L'\r\n file_diff += 1\r\n elif file_diff > 0:\r\n move += 'R'\r\n file_diff -= 1\r\n\r\n if rank_diff < 0:\r\n move += 'D'\r\n rank_diff += 1\r\n elif rank_diff > 0:\r\n move += 'U'\r\n rank_diff -= 1\r\n\r\n moves.append(move)\r\n\r\n return moves\r\n\r\n\r\n# Read input\r\ns = input().strip()\r\nt = input().strip()\r\n\r\n# Calculate and print the minimum number of moves and the moves themselves\r\nmoves = get_moves(s, t)\r\nprint(len(moves))\r\nfor move in moves:\r\n print(move)\r\n", "def ter(n,sn,sz,sp):\r\n return sn if n < 0 else (sz if n == 0 else sp)\r\ndef sign(n):\r\n return ter(n,-1,0,1)\r\ns = input()\r\nt = input()\r\nn = 0\r\na = []\r\ns = [ord(s[0])-ord('a')+1,int(s[1])]\r\nt = [ord(t[0])-ord('a')+1,int(t[1])]\r\nwhile s != t:\r\n d0 = sign(t[0]-s[0])\r\n d1 = sign(t[1]-s[1])\r\n s[0] += d0\r\n s[1] += d1\r\n a.append(ter(d0,'L','','R')+ter(d1,'D','','U'))\r\nprint(len(a))\r\nfor s in a:\r\n print(s)", "start = input()\r\nend = input()\r\n\r\ndic = {'a':1, 'b': 2, 'c':3, 'd':4, 'e':5, 'f':6, 'g':7, 'h':8}\r\n\r\nsx = int(dic[start[0]])\r\nsy = int(start[1])\r\nex = int(dic[end[0]])\r\ney = int(end[1])\r\n\r\nhdist = ex - sx\r\nvdist = ey - sy\r\n#lst = []\r\nprint(max(abs(hdist), abs(vdist)))\r\nwhile vdist != 0 or hdist != 0:\r\n hmove = ''\r\n vmove = ''\r\n if hdist > 0:\r\n hmove = 'R'\r\n hdist -= 1\r\n elif hdist < 0:\r\n hmove = 'L'\r\n hdist += 1\r\n if vdist > 0:\r\n vmove = 'U'\r\n vdist -= 1\r\n elif vdist < 0:\r\n vmove = 'D'\r\n vdist += 1\r\n #lst.append(hmove+vmove)\r\n print(hmove+vmove)\r\n\r\n#print(lst) \r\n#print(len(lst))\r\n#for el in lst:\r\n# print(el)", "s = input()\nt = input()\n\nx = ord(s[0])-ord(t[0])\ny = int(s[1])-int(t[1])\nloops = abs(x) if abs(x) > abs(y) else abs(y)\nprint(loops)\n\nwhile(loops):\n\ts=\"\"\n\tif(x>0):\n\t\ts+=\"L\"\n\t\tx-=1\n\telif(x<0):\n\t\ts+=\"R\"\n\t\tx+=1\n\tif(y>0):\n\t\ts+=\"D\"\n\t\ty-=1\n\telif(y<0):\n\t\ts+=\"U\"\n\t\ty+=1\n\tloops -= 1\n\tprint(s)\n", "start = input()\r\nend = input()\r\n\r\nsubx = ord(end[0]) - ord(start[0]) # Get the distance between x coordinates\r\nsuby = ord(end[1]) - ord(start[1]) # Get the distance between y coordinates\r\n\r\ntox = 'R' if subx > 0 else 'L'\r\ntoy = 'U' if suby > 0 else 'D'\r\nsubx = abs(subx)\r\nsuby = abs(suby)\r\n\r\ndist = max(subx, suby)\r\nprint(dist)\r\n\r\nwhile subx or suby:\r\n if subx:\r\n print(tox, end='')\r\n subx -= 1\r\n if suby:\r\n print(toy, end='')\r\n suby -= 1\r\n print()\r\n", "def moveKing(alphaRow, numeCol, s0,s1,t0,t1):\r\n for i in range(max(alphaRow, numeCol)):\r\n move=\"\"\r\n if s0<t0: \r\n move+=\"R\"\r\n s0+=1\r\n elif s0>t0: \r\n move+=\"L\"\r\n s0-=1\r\n \r\n if s1<t1: \r\n move+=\"U\"\r\n s1+=1\r\n elif s1>t1: \r\n move+=\"D\"\r\n s1-=1\r\n print(move)\r\n\r\ns=input()\r\nt=input()\r\nalphaRow=abs(ord(s[0])-ord(t[0]))\r\nnumeCol=abs(ord(s[1])-ord(t[1]))\r\nmoves=numeCol if alphaRow<=numeCol else alphaRow\r\nprint(moves)\r\nmoveKing(alphaRow,numeCol,ord(s[0]),ord(s[1]),ord(t[0]),ord(t[1]))", "# citim datele\r\ns = str(input())\r\ns1 = s[:1]\r\nb = int(s[1:])\r\n# am impartit tabla de sah in 8x8\r\n# literi ii atribui valoarea din tabel\r\nif s1 == 'h' : a = 8\r\nif s1 == 'g' : a = 7\r\nif s1 == 'f' : a = 6\r\nif s1 == 'e' : a = 5\r\nif s1 == 'd' : a = 4\r\nif s1 == 'c' : a = 3\r\nif s1 == 'b' : a = 2\r\nif s1 == 'a' : a = 1\r\n# la fel si pentru destinatie\r\nt = str(input())\r\nt1 = t[:1]\r\nb1 = int(t[1:])\r\nif t1 == 'h' : a1 = 8\r\nif t1 == 'g' : a1 = 7\r\nif t1 == 'f' : a1 = 6\r\nif t1 == 'e' : a1 = 5\r\nif t1 == 'd' : a1 = 4\r\nif t1 == 'c' : a1 = 3\r\nif t1 == 'b' : a1 = 2\r\nif t1 == 'a' : a1 = 1\r\n'''\r\nprint(a)\r\nprint(a1)\r\nprint(b)\r\nprint(b1)\r\n'''\r\n# aceiasi functie ca sii pentru afisarea miscarilor\r\n# doar ca aici le numaram, si nu le afisam\r\ndef countthemerges(a,b,a1,b1):\r\n q = 0\r\n c = True\r\n while(c):\r\n\r\n if a < a1 and b > b1 :\r\n a = a + 1\r\n b = b - 1\r\n q+=1\r\n\r\n\r\n if a > a1 and b > b1:\r\n a = a -1\r\n b = b -1\r\n q+=1\r\n\r\n if a < a1 and b < b1:\r\n a = a +1\r\n b = b +1\r\n q+=1\r\n\r\n if a > a1 and b < b1 :\r\n a = a -1\r\n b = b +1\r\n q+=1\r\n\r\n if a == a1 and b > b1:\r\n b = b - 1\r\n q+=1\r\n\r\n if a == a1 and b < b1 :\r\n b = b + 1\r\n q+=1\r\n\r\n if b == b1 and a1 > a :\r\n a = a + 1\r\n q+=1\r\n\r\n if b == b1 and a > a1 :\r\n a = a - 1\r\n q+=1\r\n\r\n\r\n if a == a1 and b1 == b :\r\n return q\r\n\r\n# functie pentru afisarea miscarilor\r\ndef printthePosibitities(a,b,a1,b1):\r\n # iteram pana cand a e diferit de a1 si b de b1\r\n # algoritm de logica si matematica usoara\r\n # incrementam sau derementam valorile lui a si b\r\n # pana cand ele nu sunt egale cu a1 si b1\r\n # si respectiv la fiecare manipulare matimatica\r\n # afisam miscarea necesara\r\n c = True\r\n while(c):\r\n if a < a1 and b > b1 :\r\n print('RD')\r\n a = a + 1\r\n b = b - 1\r\n\r\n if a > a1 and b > b1:\r\n print('LD')\r\n a = a -1\r\n b = b -1\r\n\r\n if a < a1 and b < b1:\r\n print('RU')\r\n a = a +1\r\n b = b +1\r\n\r\n if a > a1 and b < b1 :\r\n print('LU')\r\n a = a -1\r\n b = b +1\r\n\r\n if a == a1 and b > b1:\r\n print('D')\r\n b = b - 1\r\n\r\n if a == a1 and b < b1 :\r\n print('U')\r\n b = b + 1\r\n\r\n if b == b1 and a1 > a :\r\n print('R')\r\n a = a + 1\r\n\r\n if b == b1 and a > a1 :\r\n print('L')\r\n a = a - 1\r\n\r\n if a == a1 and b1 == b :\r\n c =False\r\n\r\n# afisam numarul total de miscari\r\nprint(countthemerges(a,b,a1,b1))\r\n# afisam miscarile\r\nprintthePosibitities(a,b,a1,b1)\r\n", "dic = {'a':1,'b':2,'c':3,'d':4,'e':5,'f':6,'g':7,'h':8}\r\ns = input()\r\nt = input()\r\nhorz = dic[t[0]]-dic[s[0]]\r\nvert = int(t[1])-int(s[1])\r\nmini = min(abs(horz),abs(vert))\r\nmaxi = max(abs(horz),abs(vert))\r\narr = []\r\nif horz==0:\r\n if vert<0:\r\n for i in range(maxi):\r\n arr.append('D')\r\n else:\r\n for i in range(maxi):\r\n arr.append('U')\r\nelif vert==0:\r\n if horz<0:\r\n for i in range(maxi):\r\n arr.append('L')\r\n else:\r\n for i in range(maxi):\r\n arr.append('R')\r\nelif horz>0:\r\n if vert>0:\r\n for i in range(mini):\r\n arr.append('RU')\r\n if abs(horz)>abs(vert):\r\n for i in range(maxi-mini):\r\n arr.append('R')\r\n else:\r\n for i in range(maxi-mini):\r\n arr.append('U')\r\n else:\r\n for i in range(mini):\r\n arr.append('RD')\r\n if abs(horz)>abs(vert):\r\n for i in range(maxi-mini):\r\n arr.append('R')\r\n else:\r\n for i in range(maxi-mini):\r\n arr.append('D')\r\nelse:\r\n if vert>0:\r\n for i in range(mini):\r\n arr.append('LU')\r\n if abs(horz)>abs(vert):\r\n for i in range(maxi-mini):\r\n arr.append('L')\r\n else:\r\n for i in range(maxi-mini):\r\n arr.append('U')\r\n else:\r\n for i in range(mini):\r\n arr.append('LD')\r\n if abs(horz)>abs(vert):\r\n for i in range(maxi-mini):\r\n arr.append('L')\r\n else:\r\n for i in range(maxi-mini):\r\n arr.append('D')\r\nprint(len(arr))\r\nfor i in arr:\r\n print(i)", "def get_king_moves(s, t):\r\n dx = abs(ord(t[0]) - ord(s[0])) # Horizontal distance\r\n dy = abs(int(t[1]) - int(s[1])) # Vertical distance\r\n\r\n moves = max(dx, dy) # Minimum number of moves\r\n\r\n print(moves)\r\n\r\n for _ in range(moves):\r\n move = \"\"\r\n if t[0] > s[0]:\r\n s = chr(ord(s[0]) + 1) + s[1] # Update the x-coordinate\r\n move += \"R\"\r\n elif t[0] < s[0]:\r\n s = chr(ord(s[0]) - 1) + s[1] # Update the x-coordinate\r\n move += \"L\"\r\n if t[1] > s[1] or ((t[1] > s[1]) and t[0] == s[0]):\r\n s = s[0] + str(int(s[1]) + 1) # Update the y-coordinate\r\n move += \"U\"\r\n elif t[1] < s[1] or ((t[1] < s[1]) and t[0] == s[0]):\r\n s = s[0] + str(int(s[1]) - 1) # Update the y-coordinate\r\n move += \"D\"\r\n\r\n print(move)\r\n\r\n# Read the input\r\ns = input().strip()\r\nt = input().strip()\r\n\r\n# Call the function to get the king's moves\r\nget_king_moves(s, t)", "def chessboard_coordinates_to_numerical(coord):\r\n return ord(coord[0]) - ord('a'), int(coord[1]) - 1\r\n\r\ndef numerical_to_chessboard_coordinates(coord):\r\n return chr(coord[0] + ord('a')) + str(coord[1] + 1)\r\n\r\ndef king_moves(s, t):\r\n s_num = chessboard_coordinates_to_numerical(s)\r\n t_num = chessboard_coordinates_to_numerical(t)\r\n \r\n moves = []\r\n while s_num != t_num:\r\n move = \"\"\r\n if s_num[0] < t_num[0]:\r\n move += \"R\"\r\n s_num = (s_num[0] + 1, s_num[1])\r\n elif s_num[0] > t_num[0]:\r\n move += \"L\"\r\n s_num = (s_num[0] - 1, s_num[1])\r\n \r\n if s_num[1] < t_num[1]:\r\n move += \"U\"\r\n s_num = (s_num[0], s_num[1] + 1)\r\n elif s_num[1] > t_num[1]:\r\n move += \"D\"\r\n s_num = (s_num[0], s_num[1] - 1)\r\n \r\n moves.append(move)\r\n \r\n return moves\r\n\r\ns = input().strip()\r\nt = input().strip()\r\n\r\nmoves = king_moves(s, t)\r\nprint(len(moves))\r\nfor move in moves:\r\n print(move)\r\n", "SL = ['a', 'b', 'c', 'd', 'e', 'f', 'g', 'h']\r\na = input()\r\nb = input()\r\nx0, y0 = a[0], int(a[1])\r\nx1, y1 = b[0], int(b[1])\r\nko = SL.index(x0)\r\nko2 = SL.index(x1)\r\nK = max(abs(ko2 - ko), abs(y1 - y0))\r\nprint(K)\r\nfor i in range(K):\r\n if x0 < x1 and y0 < y1:\r\n print('RU')\r\n y0 += 1\r\n ko += 1\r\n elif x0 < x1 and y0 == y1:\r\n print('R')\r\n ko += 1\r\n elif x0 < x1 and y0 > y1:\r\n print('RD')\r\n y0 -= 1\r\n ko += 1\r\n elif x0 == x1 and y0 > y1:\r\n print('D')\r\n y0 -= 1\r\n elif x0 > x1 and y0 > y1:\r\n print('LD')\r\n ko -= 1\r\n y0 -= 1\r\n elif x0 > x1 and y0 == y1:\r\n print('L')\r\n ko -= 1\r\n elif x0 > x1 and y0 < y1:\r\n print('LU')\r\n ko -= 1\r\n y0 += 1\r\n else:\r\n print('U')\r\n y0 += 1\r\n x0 = SL[ko]\r\n\n# Tue Jul 11 2023 11:40:47 GMT+0300 (Moscow Standard Time)\n", "def navigate(king, target, count, answer):\r\n if king == target:\r\n return count\r\n \r\n move = \"\"\r\n if king[0] > target[0]:\r\n king[0] = chr(ord(king[0]) - 1)\r\n move += \"L\"\r\n elif king[0] < target[0]:\r\n king[0] = chr(ord(king[0]) + 1)\r\n move += \"R\"\r\n\r\n if king[1] > target[1]:\r\n king[1] = chr(ord(king[1]) - 1)\r\n move += \"D\"\r\n elif king[1] < target[1]:\r\n king[1] = chr(ord(king[1]) + 1)\r\n move += \"U\"\r\n\r\n answer.append(move)\r\n return navigate(king, target, count+1, answer)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n king = [_ for _ in input()]\r\n target = [_ for _ in input()]\r\n count = 0\r\n answer = []\r\n print(navigate(king, target, count, answer))\r\n print(*answer, sep = '\\n')", "count=0\r\nlist=[]*0\r\n\r\nara1=str(input())\r\nx1=ord(ara1[0])-ord('a')\r\ny1=int(ara1[1])\r\n\r\nara2=str(input())\r\nx2=ord(ara2[0])-ord('a')\r\ny2 =int(ara2[1])\r\n\r\nwhile x1!=x2 or y1!=y2:\r\n str=\"\"\r\n if x1>x2:\r\n str=\"L\";\r\n x1-= 1\r\n else:\r\n if x1<x2:\r\n str=\"R\";\r\n x1+= 1\r\n if y1<y2:\r\n str+=\"U\";\r\n y1 += 1\r\n else:\r\n if y1>y2:\r\n str+=\"D\";\r\n y1-=1\r\n list.append(str);\r\n count+= 1\r\nprint(count)\r\n\r\nfor string in list:\r\n print(string)\r\n", "#input as a list to compare each one alone\r\ns = list(input()) #the king's location\r\nt = list(input()) #the target\r\n\r\n#lists to determine where the king is and where to go\r\nls = [\"a\",\"b\",\"c\",\"d\",\"e\",\"f\",\"g\",\"h\"]\r\nn = [\"1\",\"2\",\"3\",\"4\",\"5\",\"6\",\"7\",\"8\"]\r\n\r\n#counters\r\nr,l,u,d = 0,0,0,0\r\n\r\n#actually does the job\r\n#locates where the king and adds one for each direction that should be moved\r\nwhile s != t:\r\n\tif s[0] < t[0]:\r\n\t\tind = ls.index(s[0])\r\n\t\ts[0] = ls[ind+1]\r\n\t\tr += 1\r\n\telif s[0] > t[0]:\r\n\t\tind = ls.index(s[0])\r\n\t\ts[0] = ls[ind-1]\r\n\t\tl += 1\r\n\tif s[1] < t[1]:\r\n\t\tind = n.index(s[1])\r\n\t\ts[1] = n[ind+1]\r\n\t\tu += 1\r\n\telif s[1] > t[1]:\r\n\t\tind = n.index(s[1])\r\n\t\ts[1] = n[ind-1]\r\n\t\td += 1\r\n\r\n \r\nrl, ud= r + l , u + d\t#to make sure zero is not the minimum\t\r\nmx,mn = max(rl,ud),min(rl,ud) \r\nmxn = mx - mn\r\n\r\n#the number of steps\r\nprint(mx)\r\n\r\n\r\n#arranges the output in three ways depending on the moves\r\nif rl == ud:\r\n\tif r > l: \r\n\t\tif u > d:\r\n\t\t\tfor i in range(rl):\r\n\t\t\t\tprint(\"RU\")\r\n\t\telse: \r\n\t\t\tfor i in range(rl):\r\n\t\t\t\tprint(\"RD\")\r\n\telse: \r\n\t\tif u > d:\r\n\t\t\tfor i in range(rl):\r\n\t\t\t\tprint(\"LU\")\r\n\t\telse:\r\n\t\t\tfor i in range(rl):\r\n\t\t\t\tprint(\"LD\")\r\nelif r > l: #it will move to the right\r\n\tif u > d:\r\n\t\tfor i in range(mn):\r\n\t\t\tprint(\"RU\")\r\n\t\tif r > u:\r\n\t\t\tfor i in range(mxn):\r\n\t\t\t\tprint(\"R\")\r\n\t\telse:\r\n\t\t\tfor i in range(mxn):\r\n\t\t\t\tprint(\"U\")\r\n\telse:\r\n\t\tfor i in range(mn):\r\n\t\t\tprint(\"RD\")\r\n\t\tif r > d:\r\n\t\t\tfor i in range(mxn):\r\n\t\t\t\tprint(\"R\")\r\n\t\telse:\r\n\t\t\tfor i in range(mxn):\r\n\t\t\t\tprint(\"D\")\r\nelse:\r\n\tif u > d: #it will move to the left\r\n\t\tfor i in range(mn):\r\n\t\t\tprint(\"LU\")\r\n\t\tif l > u:\r\n\t\t\tfor i in range(mxn):\r\n\t\t\t\tprint(\"L\")\r\n\t\telse:\r\n\t\t\tfor i in range(mxn):\r\n\t\t\t\tprint(\"U\")\r\n\telse:\r\n\t\tfor i in range(mn):\r\n\t\t\tprint(\"LD\")\r\n\t\tif l > d:\r\n\t\t\tfor i in range(mxn):\r\n\t\t\t\tprint(\"L\")\r\n\t\telse:\r\n\t\t\tfor i in range(mxn):\r\n\t\t\t\tprint(\"D\")", "def get_pos(s: str):\n x = s[0]\n y = s[1]\n if not x.isdigit():\n x = str(ord(x)-ord('a')+1)\n if not y.isdigit():\n y = str(ord(y)-ord('a')+1)\n return int(x),int(y)\n\ndef solve(start, end):\n start_x, start_y = get_pos(start)\n end_x, end_y = get_pos(end)\n min_val= 100000000\n res = []\n while start_x != end_x or start_y != end_y:\n arr = [\n (start_x, start_y+1, 'U'),\n (start_x,start_y-1, 'D'),\n (start_x-1, start_y, 'L'),\n (start_x+1, start_y, 'R'),\n (start_x-1, start_y-1,'LD'),\n (start_x-1, start_y+1, 'LU'),\n (start_x+1, start_y-1, 'RD'),\n (start_x+1, start_y+1, 'RU')\n ]\n selected_min = None\n for ver in arr:\n if ((ver[0]-end_x)**2 + (ver[1]-end_y)**2)**.5 < min_val:\n min_val = ((ver[0]-end_x)**2 + (ver[1]-end_y)**2)**.5\n selected_min = ver\n start_x = ver[0]\n start_y = ver[1]\n res.append(selected_min[2])\n print(len(res))\n print(*res, sep='\\n')\n\ndef main():\n # vars = list(map(int, input().split(\" \")))\n start = input()\n end = input()\n\n # s = input()\n # a = list(map(int, input().split(\" \")))\n # b = list(map(int, input().split(\" \")))\n # c = list(map(int, input().split(\" \")))\n # res = []\n # for _ in range(n):\n # arr = list(map(int, input().split(\" \")))\n # res.append(saveThePrisoner(*arr))\n # print(*res,sep='\\n')\n solve(start,end)\n\n\nmain()\n", "in_ = input()\r\nout = input()\r\n\r\n\r\n\r\nin0 = int(ord(in_[0]) - 96)\r\nou0 = int(ord(out[0]) - 96)\r\n\r\nin1 = int(in_[1])\r\nou1 = int(out[1])\r\n\r\ncnt = 0\r\ncnstr = \"\"\r\nL = []\r\nwhile(in0 != ou0 or in1 != ou1):\r\n if(in0 > ou0):\r\n if(in1 == ou1):\r\n in0 = in0 - 1\r\n cnt = cnt + 1\r\n #print('cunt')\r\n L.append('L')\r\n elif(in1 > ou1):\r\n in0 = in0 - 1\r\n in1 = in1 - 1\r\n cnt = cnt + 1\r\n L.append('LD')\r\n elif(in1 < ou1):\r\n in0 = in0 - 1\r\n in1 = in1 + 1\r\n cnt = cnt + 1\r\n L.append('LU')\r\n \r\n elif(in0 < ou0):\r\n if(in1 == ou1):\r\n in0 = in0 + 1\r\n cnt = cnt + 1\r\n L.append('R')\r\n elif(in1 > ou1):\r\n in0 = in0 + 1\r\n in1 = in1 - 1\r\n cnt = cnt + 1\r\n L.append('RD')\r\n elif(in1 < ou1):\r\n in0 = in0 + 1\r\n in1 = in1 + 1\r\n cnt = cnt + 1\r\n L.append('RU')\r\n \r\n elif(in0 == ou0):\r\n if(in1 > ou1):\r\n in1 = in1 - 1\r\n cnt = cnt + 1\r\n L.append('D') \r\n if(in1 < ou1):\r\n in1 = in1 + 1\r\n cnt = cnt + 1\r\n L.append('U')\r\n\r\n\r\nprint(cnt)\r\nfor i in range(len(L)):\r\n print(L[i])\r\n", "start = list(input())\r\nend = list(input())\r\nrows = ['a','b','c','d','e','f','g','h']\r\ncolomns = list(range(1,9))\r\nrmove = rows.index(end[0])-rows.index(start[0])\r\ncmove = colomns.index(int(end[1]))-colomns.index(int(start[1]))\r\nif rmove >= 0:\r\n x = 'R'\r\nelse:\r\n x = 'L'\r\nif cmove >= 0:\r\n y = 'U'\r\nelse:\r\n y = 'D'\r\nrmove = abs(rmove)\r\ncmove = abs(cmove)\r\nmove = abs(min(rmove, cmove))\r\ncount = 0\r\nsteps = []\r\nfor i in range(move):\r\n move = f'{x}{y}'\r\n steps.append(move)\r\n count += 1\r\nif rmove > cmove:\r\n for i in range(rmove-cmove):\r\n steps.append(x)\r\n count += 1\r\nelse:\r\n for i in range(cmove-rmove):\r\n steps.append(y)\r\n count += 1\r\nprint(count)\r\nfor step in steps:\r\n print(step)", "import sys\r\n\r\n\r\ndef moves_route(moves_no, x_axis_moves, y_axis_moves):\r\n moves = []\r\n for _ in range(moves_no):\r\n if x_axis_moves > 0:\r\n moves.append('R')\r\n x_axis_moves -= 1\r\n elif x_axis_moves < 0:\r\n moves.append('L')\r\n x_axis_moves += 1\r\n if y_axis_moves > 0:\r\n moves.append('U')\r\n y_axis_moves -= 1\r\n elif y_axis_moves < 0:\r\n moves.append('D')\r\n y_axis_moves += 1\r\n moves.append('\\n')\r\n return moves\r\n\r\n\r\ndef main(sinp=sys.stdin, sout=sys.stdout):\r\n start, end = sinp.read().split()\r\n letter_coords = 'abcdefgh'\r\n letter_to_num = {letter_coords[i]: i for i in range(len(letter_coords))}\r\n\r\n y_axis_moves = int(end[1]) - int(start[1])\r\n x_axis_moves = letter_to_num[end[0]] - letter_to_num[start[0]]\r\n moves_no = max(abs(x_axis_moves), abs(y_axis_moves))\r\n\r\n sout.write(str(moves_no) + '\\n')\r\n sout.write(''.join(moves_route(moves_no, x_axis_moves, y_axis_moves)))\r\n\r\nif __name__ == '__main__':\r\n main()", "def move(i, j, x, y):\r\n ans = []\r\n if x == i and y == j:\r\n return []\r\n while i != x or j != y:\r\n ch = \"\"\r\n if i < x:\r\n ch += \"R\"\r\n i += 1\r\n elif i > x:\r\n ch += \"L\"\r\n i -= 1\r\n if j < y:\r\n ch += \"U\"\r\n j += 1\r\n elif j > y:\r\n ch += \"D\"\r\n j -= 1\r\n ans.append(ch)\r\n return ans\r\n \r\ndef check():\r\n # cnt = {'a'1}\r\n p1 = input()\r\n i, j = ord(p1[0]) - ord('a') + 1, ord(p1[1]) - ord('0') \r\n p2 = input()\r\n x, y = ord(p2[0]) - ord('a') + 1, ord(p2[1]) - ord('0') \r\n ans = move(i, j, x, y)\r\n print(len(ans))\r\n for s in ans:\r\n print(s)\r\n\r\ncheck()\r\n", "from collections import defaultdict, deque\nfrom functools import lru_cache\nfrom heapq import heappush, heappop\n \n #n,m = map(int, input().split())\n #arr = list(map(int, input().split()))\ndef solution():\n s = input()\n si,sj = ord(s[0]) - ord('a'), int(s[1])\n t = input()\n ti,tj = ord(t[0]) - ord('a'), int(t[1])\n\n path = [] \n count = 0\n while count < 8*8:\n count += 1\n step = \"\"\n x = ti - si\n y = tj - sj\n if x != 0:\n step += \"R\" if x > 0 else \"L\"\n si += 1 if x > 0 else -1\n if y != 0:\n step += \"U\" if y > 0 else \"D\"\n sj += 1 if y > 0 else -1\n\n if step == \"\":\n break\n path.append(step)\n print(len(path))\n for step in path:\n print(step)\n\n \n \n\n#import sys\n#import threading\n#sys.setrecursionlimit(1 << 30)\n#threading.stack_size(1 << 27)\n#thread = threading.Thread(target=solution)\n#thread.start(); thread.join()\nsolution()\n", "s=input()\r\nt=input()\r\na=ord(t[0])-ord(s[0])\r\nb=int(t[1])-int(s[1])\r\nx=abs(a)\r\ny=abs(b)\r\nc=['R','U','L','D']\r\ni=0\r\nj=1\r\nif a<0:\r\n i=2 \r\nif b<0:\r\n j=3\r\nk=j \r\nif x>y:\r\n k=i \r\n x,y=y,x\r\nm=c[i]+c[j]\r\nn=c[k]\r\nprint(y)\r\nfor l in range(x):\r\n print(m)\r\nfor l in range(y-x):\r\n print(n)", "# import sys\r\n# sys.stdin=open(\"input.txt\",'r')\r\n# sys.stdout=open('output.txt','w')\r\nstart=input()\r\nend=input()\r\nstart=[(ord(start[0])-ord('a')),8-int(start[1]) ]\r\nend=[(ord(end[0])-ord('a')),8-int(end[1])]\r\nstep=0\r\nans=''\r\nwhile start!=end:\r\n if start[0]<end[0]:\r\n \r\n start[0]+=1\r\n ans+='R'\r\n r=True\r\n if start[0]>end[0]:\r\n \r\n start[0]-=1\r\n ans+='L'\r\n if start[1]>end[1]:\r\n \r\n start[1]-=1\r\n ans+='U'\r\n if start[1]<end[1]:\r\n \r\n start[1]+=1\r\n ans+='D'\r\n ans+='-'\r\n step+=1\r\nprint(step)\r\nfor i in ans.split('-'):\r\n print(i)\r\n", "s = input()\r\nt = input()\r\n\r\ncoordinates = 'abcdefgh'\r\n\r\nsx = coordinates.find(s[0])+1\r\nsy = int(s[1])\r\n\r\ntx = coordinates.find(t[0])+1\r\nty = int(t[1])\r\n\r\nnum_moves = 0\r\nmoves = []\r\nwhile sx != tx or sy != ty:\r\n num_moves += 1\r\n\r\n if sx == tx:\r\n if sy < ty:\r\n sy += 1\r\n moves.append('U')\r\n else:\r\n sy -= 1\r\n moves.append('D')\r\n elif sy == ty:\r\n if sx < tx:\r\n sx += 1\r\n moves.append('R')\r\n else:\r\n sx -= 1\r\n moves.append('L')\r\n elif sx > tx:\r\n sx -= 1\r\n if sy > ty:\r\n sy -= 1\r\n moves.append('LD')\r\n else:\r\n sy += 1\r\n moves.append('LU')\r\n else:\r\n sx += 1\r\n if sy > ty:\r\n sy -= 1\r\n moves.append('RD')\r\n else:\r\n sy += 1\r\n moves.append('RU')\r\n\r\nprint(num_moves)\r\nfor i in moves: print(i)\r\n\r\n\r\n \r\n \r\n", "def f():\r\n a=input()\r\n return [ord(a[0])-ord('a'), int(a[1])]\r\na=f()\r\nb=f()\r\nh=a[0]-b[0]\r\nv=a[1]-b[1]\r\nd=['LR'[h<0]+'DU'[v<0]]*min(abs(v),abs(h))\r\ndiff=abs(v)-abs(h)\r\nif diff>0:\r\n if v<0:\r\n d+=['U']*abs(diff)\r\n else:\r\n d+=['D']*abs(diff)\r\nelse:\r\n if h<0:\r\n d+=['R']*abs(diff)\r\n else:\r\n d+=['L']*abs(diff)\r\nprint(len(d))\r\nprint(*d,sep='\\n')", "d = {\"a\":1, \"b\":2, \"c\":3, \"d\":4, \"e\":5, \"f\":6, \"g\":7, \"h\":8}\r\nne = {\"a\":\"b\", \"b\":\"c\", \"c\":\"d\", \"d\":\"e\", \"e\":\"f\", \"f\":\"g\", \"g\":\"h\"}\r\npr = {\"h\":\"g\", \"g\":\"f\", \"f\":\"e\", \"e\":\"d\", \"d\":\"c\", \"c\":\"b\", \"b\":\"a\"}\r\ns = list(input())\r\nst = list(input())\r\nnum1 = int(s[1])\r\nnum2 = int(st[1])\r\nprint(max(abs(d[s[0]]-d[st[0]]),abs(num1-num2)))\r\n\r\nwhile True:\r\n if s[0] < st[0]:\r\n if num1 < num2:\r\n print(\"RU\")\r\n num1 += 1\r\n s[0] = ne[s[0]]\r\n elif num1 > num2:\r\n print(\"RD\")\r\n num1 -= 1\r\n s[0] = ne[s[0]]\r\n else:\r\n print(\"R\")\r\n s[0] = ne[s[0]]\r\n elif s[0] > st[0]:\r\n if num1 < num2:\r\n print(\"LU\")\r\n num1 += 1\r\n s[0] = pr[s[0]]\r\n elif num1 > num2:\r\n print(\"LD\")\r\n num1 -= 1\r\n s[0] = pr[s[0]]\r\n else:\r\n print(\"L\")\r\n s[0] = pr[s[0]]\r\n else:\r\n if num1 < num2:\r\n print(\"U\")\r\n num1 += 1\r\n elif num1 > num2:\r\n print(\"D\")\r\n num1 -= 1\r\n else:\r\n break\r\n", "s=input()\r\nn=input()\r\nif s==n:\r\n print(0)\r\n exit()\r\nm=['','a','b','c','d','e','f','g','h']\r\nfor i in range(1,len(m)):\r\n if s[0]==m[i]:\r\n x=i\r\n if n[0]==m[i]:\r\n x2=i \r\ny=int(s[1])\r\ny2=int(n[1])\r\nM=[]\r\nb=''\r\nxod=0 \r\nwhile True:\r\n if x>x2:\r\n x-=1\r\n b+='L'\r\n \r\n if x<x2:\r\n x+=1\r\n b+='R'\r\n if y>y2:\r\n y-=1\r\n b+='D'\r\n if y<y2:\r\n y+=1\r\n b+='U'\r\n xod+=1\r\n M.append(b)\r\n b=''\r\n if x==x2 and y==y2:\r\n break\r\nprint(xod)\r\nfor i in range(len(M)):\r\n print(M[i]) \r\n", "s=input();\r\nt=input();\r\nlines=ord(t[1])-ord(s[1]);\r\ncols=ord(t[0])-ord(s[0]);\r\nprint(max(abs(lines),abs(cols)));\r\n\r\nwhile abs(lines)>0 and abs(cols)>0:\r\n if lines<0 and cols<0:\r\n print('LD');\r\n lines+=1;\r\n cols+=1;\r\n if lines<0 and cols>0:\r\n print('RD');\r\n lines+=1;\r\n cols-=1;\r\n if lines>0 and cols<0:\r\n print('LU');\r\n lines-=1;\r\n cols+=1;\r\n if lines>0 and cols>0:\r\n print('RU');\r\n lines-=1;\r\n cols-=1;\r\n\r\nwhile abs(lines)>0:\r\n if lines<0:\r\n print('D');\r\n lines+=1;\r\n else:\r\n print('U');\r\n lines-=1;\r\n\r\nwhile abs(cols)>0:\r\n if cols<0:\r\n print('L');\r\n cols+=1;\r\n else:\r\n print('R');\r\n cols-=1;\r\n", "a=input()\nd=input()\n\ncA= ord(a[0]) - 96 \ncD= ord(d[0]) - 96 \n\nfA= int(a[1])\nfD= int(d[1])\nnum=0\nans=\"\"\nwhile(not(cA==cD and fA==fD)):\n\n if not ((cA==cD) or (fA==fD)):\n #diagonal hacia abajo \n if fA>fD:\n #izquierda\n if cA>cD:\n cA-=1\n ans+=\"\\nLD\"\n #derecha\n else:\n cA+=1\n ans+=\"\\nRD\"\n fA-=1\n #diagonal hacia arriba\n else:\n #izquierda\n if cA>cD:\n cA-=1\n ans+=\"\\nLU\"\n #derecha\n else:\n cA+=1\n ans+=\"\\nRU\"\n fA+=1\n elif cA==cD:\n if fA>fD:\n fA-=1\n ans+=\"\\nD\"\n else:\n fA+=1\n ans+=\"\\nU\"\n else:\n if cA>cD:\n cA-=1\n ans+=\"\\nL\"\n else:\n cA+=1\n ans+=\"\\nR\"\n num+=1\nprint(num)\nprint(ans[1:])", "n={'a':1,'b':2,'c':3,'d':4,'e':5,'f':6,'g':7,'h':8}\r\nsept={\"L\":(-1,0),\"D\":(0,-1),\"R\":(1,0),\"U\":(0,1),\"LU\":(-1,1),\"LD\":(-1,-1),\"RU\":(1,1),\"RD\":(1,-1)}\r\na=input()\r\nb=input()\r\nx1,y1=n[a[0]],int(a[1])\r\nx2,y2=n[b[0]],int(b[1])\r\npath=[]\r\nwhile(x1!=x2 or y1!=y2):\r\n if(x1<x2):\r\n if(y1<y2):\r\n path.append(\"RU\")\r\n x1=x1+sept[\"RU\"][0]\r\n y1=y1+sept[\"RU\"][1]\r\n else:\r\n if(y1>y2):\r\n path.append(\"RD\")\r\n x1=x1+sept[\"RD\"][0]\r\n y1=y1+sept[\"RD\"][1]\r\n else:\r\n path.append(\"R\")\r\n x1=x1+sept[\"R\"][0]\r\n y1=y1+sept[\"R\"][1]\r\n else:\r\n if(x1>x2):\r\n if(y1<y2):\r\n path.append(\"LU\")\r\n x1=x1+sept[\"LU\"][0]\r\n y1=y1+sept[\"LU\"][1]\r\n else:\r\n if(y1>y2):\r\n path.append(\"LD\")\r\n x1=x1+sept[\"LD\"][0]\r\n y1=y1+sept[\"LD\"][1]\r\n else:\r\n path.append(\"L\")\r\n x1=x1+sept[\"L\"][0]\r\n y1=y1+sept[\"L\"][1]\r\n else:\r\n if(y1>y2):\r\n path.append(\"D\")\r\n x1=x1+sept[\"D\"][0]\r\n y1=y1+sept[\"D\"][1] \r\n else: \r\n path.append(\"U\")\r\n x1=x1+sept[\"U\"][0]\r\n y1=y1+sept[\"U\"][1]\r\nprint(len(path))\r\nfor p in path:\r\n print(p)\r\n", "s = input()\nt = input()\n\nsfile = ord(s[0]) - ord('a') + 1\nsrank = int(s[1])\n\ntfile = ord(t[0]) - ord('a') + 1\ntrank = int(t[1])\n\nprint(max(abs(tfile - sfile), abs(trank - srank)))\n\nwhile sfile != tfile or srank != trank:\n if sfile == tfile:\n if srank < trank:\n print('U')\n srank += 1\n\n else:\n print('D')\n srank -= 1\n\n elif srank == trank:\n if sfile < tfile:\n print('R')\n sfile += 1\n\n else:\n print('L')\n sfile -= 1\n\n else:\n if sfile < tfile and srank < trank:\n print('RU')\n sfile += 1\n srank += 1\n\n elif sfile < tfile and srank > trank:\n print('RD')\n sfile += 1\n srank -= 1\n\n elif sfile > tfile and srank < trank:\n print('LU')\n sfile -= 1\n srank += 1\n\n else:\n print('LD')\n sfile -= 1\n srank -= 1\n", "s=[i for i in input()]\r\nt=[i for i in input()]\r\na=ord(s[0])-ord(t[0])\r\nb=ord(s[1])-ord(t[1])\r\nprint(max(a,-a,b,-b))\r\nwhile a!=0 or b!=0:\r\n kk=''\r\n if a<0:kk='R';a+=1\r\n if a>0:kk='L';a-=1\r\n if b<0:kk+='U';b+=1\r\n if b>0:kk+='D';b-=1\r\n print(kk)", "import math\ndef dist(arr1, arr2):\n x1 = arr1[0]\n y1 = arr1[1]\n x2 = arr2[0]\n y2 = arr2[1]\n x1x2 = math.pow(abs(x1 - x2), 2)\n y1y2 = math.pow(abs(y1 - y2), 2)\n distance = math.pow(x1x2 + y1y2, 0.5)\n return distance\n\n\ndef getneighbours(loc):\n x1= loc[0]\n y1 = loc[1]\n neighbours = [[x1 + 1, y1], [x1 - 1, y1], [x1, y1 + 1], [x1, y1 -1], [x1 + 1, y1 + 1], [x1 - 1, y1 - 1], [x1+1, y1-1], [x1-1, y1 + 1]]\n for i in neighbours:\n for k in i:\n if k > 8 or k < 1:\n if i in neighbours:\n neighbours.remove(i)\n return neighbours\n\n\n\ns = input()\nt = input()\n\nkey = {\"a\":1,\"b\":2,\"c\":3,\"d\":4,\"e\":5,\"f\":6,\"g\":7,\"h\":8 }\n\nkingc = 0\nfor i in s:\n if i in key:\n kingc = [key[i], int(s[1])]\n\ndestination = 0\nfor i in t:\n if i in key:\n destination = [key[i], int(t[1])]\n\nstepstaken = []\nwhile dist(kingc, destination) != 0:\n kingneighbours = getneighbours(kingc)\n possibledistances = []\n for i in kingneighbours:\n possibledistances += [dist(i, destination), ]\n mind = possibledistances.index(min(possibledistances))\n if kingneighbours[mind][0] == kingc[0]:\n if kingneighbours[mind][1] > kingc[1]:\n stepstaken += [\"U\",]\n else:\n stepstaken += [\"D\",]\n if kingneighbours[mind][1] == kingc[1]:\n if kingneighbours[mind][0] > kingc[0]:\n stepstaken += [\"R\",]\n else:\n stepstaken += [\"L\",]\n if kingneighbours[mind][0] < kingc[0] and kingneighbours[mind][1] != kingc[1]:\n if kingneighbours[mind][1] > kingc[1]:\n stepstaken += [\"LU\", ]\n else:\n stepstaken += [\"LD\", ]\n if kingneighbours[mind][0] > kingc[0] and kingneighbours[mind][1] != kingc[1]:\n if kingneighbours[mind][1] > kingc[1]:\n stepstaken += [\"RU\", ]\n else:\n stepstaken += [\"RD\", ]\n kingc = kingneighbours[mind]\n\nprint(len(stepstaken))\nfor i in stepstaken:\n print(i)\n", "def convertTo(s):\r\n ret = [0, int(s[1])]\r\n if s[0] == \"a\":\r\n ret[0] = 1\r\n if s[0] == \"b\":\r\n ret[0] = 2\r\n if s[0] == \"c\":\r\n ret[0] = 3\r\n if s[0] == \"d\":\r\n ret[0] = 4\r\n if s[0] == \"e\":\r\n ret[0] = 5\r\n if s[0] == \"f\":\r\n ret[0] = 6\r\n if s[0] == \"g\":\r\n ret[0] = 7\r\n if s[0] == \"h\":\r\n ret[0] = 8\r\n return ret\r\n\r\nking = input()\r\nking = convertTo(king)\r\nwin = input()\r\nwin = convertTo(win)\r\nxdif = abs(king[0] - win[0])\r\nydif = abs(king[1] - win[1])\r\nmoves = 0\r\nif xdif > ydif:\r\n moves = xdif\r\nelse:\r\n moves = ydif\r\nprint(moves)\r\nfor x in range(moves):\r\n prnt = \"\"\r\n if king[0] < win[0]:\r\n prnt += \"R\"\r\n king[0] += 1\r\n elif king[0] > win[0]:\r\n prnt += \"L\"\r\n king[0] -= 1\r\n if king[1] < win[1]:\r\n prnt += \"U\"\r\n king[1] += 1\r\n elif king[1] > win[1]:\r\n prnt += \"D\"\r\n king[1] -= 1\r\n print(prnt)", "start = input()\r\nj_start = ord(start[0]) - 96\r\ni_start = int(start[1])\r\ngoal = input()\r\nj_goal = ord(goal[0]) - 96\r\ni_goal = int(goal[1]) \r\n\r\n\r\ncount = 0\r\nmoves = []\r\nwhile(True):\r\n res = ''\r\n if(i_start == i_goal and j_start == j_goal ):\r\n break\r\n\r\n if(j_start > j_goal):\r\n j_start -= 1\r\n res += 'L'\r\n elif(j_start < j_goal):\r\n j_start += 1\r\n res += 'R'\r\n\r\n if(i_start > i_goal):\r\n i_start -= 1\r\n res += 'D'\r\n elif(i_start < i_goal):\r\n i_start += 1\r\n res += 'U'\r\n moves.append(res)\r\n count += 1\r\n\r\nprint(count)\r\nprint(\"\\n\".join(moves))\r\n", "s = input()\r\nt = input()\r\nn = 0\r\na = []\r\ns = [ord(s[0])-ord('a')+1,int(s[1])]\r\nt = [ord(t[0])-ord('a')+1,int(t[1])]\r\nwhile s != t:\r\n if s[0] < t[0] and s[1] < t[1]:\r\n a.append('RU')\r\n s[0] += 1\r\n s[1] += 1\r\n elif s[0] < t[0] and s[1] > t[1]:\r\n a.append('RD')\r\n s[0] += 1\r\n s[1] -= 1\r\n elif s[0] > t[0] and s[1] < t[1]:\r\n a.append('LU')\r\n s[0] -= 1\r\n s[1] += 1\r\n elif s[0] > t[0] and s[1] > t[1]:\r\n a.append('LD')\r\n s[0] -= 1\r\n s[1] -= 1\r\n elif s[0] == t[0] and s[1] > t[1]:\r\n a.append('D')\r\n s[1] -= 1\r\n elif s[0] == t[0] and s[1] < t[1]:\r\n a.append('U')\r\n s[1] += 1\r\n elif s[0] > t[0] and s[1] == t[1]:\r\n a.append('L')\r\n s[0] -= 1\r\n elif s[0] < t[0] and s[1] == t[1]:\r\n a.append('R')\r\n s[0] += 1\r\nprint(len(a))\r\nfor s in a:\r\n print(s)", "def king_moves(source, target):\r\n \r\n letter_mapping = {'a': 1, 'b': 2, 'c': 3, 'd': 4, 'e': 5, 'f': 6, 'g': 7, 'h': 8}\r\n\r\n\r\n source_row, source_col = int(source[1]), letter_mapping[source[0]]\r\n target_row, target_col = int(target[1]), letter_mapping[target[0]]\r\n\r\n\r\n row_diff = target_row - source_row\r\n col_diff = target_col - source_col\r\n\r\n\r\n moves = []\r\n while row_diff != 0 or col_diff != 0:\r\n move = ''\r\n if col_diff > 0:\r\n move += 'R'\r\n col_diff -= 1\r\n elif col_diff < 0:\r\n move += 'L'\r\n col_diff += 1\r\n if row_diff > 0:\r\n move += 'U'\r\n row_diff -= 1\r\n elif row_diff < 0:\r\n move += 'D'\r\n row_diff += 1\r\n moves.append(move)\r\n\r\n return len(moves), moves\r\n\r\n\r\n\r\nsource = input()\r\ntarget = input()\r\n\r\n\r\nn, moves = king_moves(source, target)\r\n\r\n\r\nprint(n)\r\nfor move in moves:\r\n print(move)\r\n", "p1,p2=input(),input()\n\nx = ord(p2[0])-ord(p1[0])\ny = int(p2[1])-int(p1[1])\n\nprint(max(abs(x),abs(y)))\n# from (0,0) to (x,y)\nif x>=0 and y>=0:\n for i in range(min(x,y)):\n print('RU')\n for i in range(abs(x-y)):\n print('U') if y>=x else print('R')\nelif x>=0 and y<0:\n for i in range(min(x,abs(y))):\n print('RD')\n for i in range(abs(x-abs(y))):\n print('D') if abs(y)>=x else print('R')\nelif x<0 and y>=0:\n for i in range(min(abs(x),y)):\n print('LU')\n for i in range(abs(abs(x)-y)):\n print('U') if y>=abs(x) else print('L')\nelse:\n for i in range(min(abs(x),abs(y))):\n print('LD')\n for i in range(abs(abs(x)-abs(y))):\n print('D') if abs(y)>=abs(x) else print('L')", "L=input\r\nR=print\r\na=L()+L()\r\na,b=(ord(a[i])-ord(a[i+2])for i in(0,1))\r\nR(max(a,-a,b,-b))\r\nwhile a!=0 or b!=0:\r\n r=''\r\n if a<0:r='R';a+=1\r\n if a>0:r='L';a-=1\r\n if b<0:r+='U';b+=1\r\n if b>0:r+='D';b-=1\r\n R(r)", "xs, ys = input()[:2]\r\nxs = ord(xs) - ord('a') + 1\r\nys = int(ys)\r\nxt, yt = input()[:2]\r\nxt = ord(xt) - ord('a') + 1\r\nyt = int(yt)\r\n\r\nprint(max(abs(xs - xt), abs(ys - yt)))\r\n\r\nif xs <= xt or ys <= yt:\r\n while xs < xt and ys < yt:\r\n print('RU')\r\n xs += 1\r\n ys += 1\r\nif xs >= xt and ys <= yt:\r\n while xs > xt and ys < yt:\r\n print('LU')\r\n xs -= 1\r\n ys += 1\r\nif xs >= xt and ys >= yt:\r\n while xs > xt and ys > yt:\r\n print('LD')\r\n xs -= 1\r\n ys -= 1\r\nif xs <= xt and ys >= yt:\r\n while xs < xt and ys > yt:\r\n print('RD')\r\n xs += 1\r\n ys -= 1\r\nwhile xs < xt:\r\n print('R')\r\n xs += 1\r\nwhile ys < yt: \r\n print('U')\r\n ys += 1\r\nwhile xs > xt:\r\n print('L')\r\n xs -= 1\r\nwhile ys < yt: \r\n print('U')\r\n ys += 1\r\nwhile ys > yt: \r\n print('D')\r\n ys -= 1\r\n", "checker ={\r\n \"a\": 1,\r\n \"b\": 2,\r\n \"c\": 3,\r\n \"d\": 4,\r\n \"e\": 5,\r\n \"f\": 6,\r\n \"g\": 7,\r\n \"h\": 8\r\n}\r\n \r\ndef main():\r\n s = input()\r\n t = input()\r\n s_x = checker[s[0]]\r\n s_y = int(s[1])\r\n t_x = checker[t[0]]\r\n t_y = int(t[1])\r\n \r\n i = 0\r\n move = {}\r\n while s_x != t_x or s_y != t_y:\r\n i = i + 1\r\n if s_x < t_x:\r\n move_x = \"R\"\r\n s_x = s_x + 1\r\n elif s_x > t_x:\r\n move_x = \"L\"\r\n s_x = s_x - 1\r\n else:\r\n move_x = \"\"\r\n \r\n if s_y < t_y:\r\n move_y = \"U\"\r\n s_y = s_y + 1\r\n elif s_y > t_y:\r\n move_y = \"D\"\r\n s_y = s_y - 1\r\n else:\r\n move_y = \"\"\r\n move[i] = move_x + move_y \r\n \r\n print(i)\r\n for j in range(1, i+1):\r\n print(move[j])\r\n \r\n \r\nmain()", "from math import *\n\ndef sign(x):\n\tif x < 0:\n\t\treturn -1\n\telif x > 0:\n\t\treturn 1\n\treturn 0\n\ns = input()\nx = ord(s[0])-ord('a')\ny = int(s[1])\nt = input()\ntx = ord(t[0])-ord('a')\nty = int(t[1])\nvx = tx-x\nif vx < 0:\n\tansx = 'L'\nelse:\n\tansx = 'R'\nvy = ty-y\nif vy < 0:\n\tansy = 'D'\nelse:\n\tansy = 'U'\nprint(max(abs(vx),abs(vy)))\nwhile vx != 0 or vy != 0:\n\tans = \"\"\n\tif vx != 0:\n\t\tans += ansx\n\t\tvx -= sign(vx)\n\tif vy != 0:\n\t\tans += ansy\n\t\tvy -= sign(vy)\n\tprint(ans)", "################################################################################\r\ninput1=input()\r\ncol1=ord(input1[0])-96\r\nrow1=int(input1[1])\r\ninput2=input()\r\ncol2=ord(input2[0])-96\r\nrow2=int(input2[1])\r\n\r\nsteps=[]\r\nwhile (col1!=col2) or (row1!=row2) :\r\n step=''\r\n\r\n if col2>col1:\r\n col1+=1\r\n step=step+'R'\r\n if col2<col1:\r\n col1-=1\r\n step=step+'L'\r\n\r\n if row2>row1:\r\n row1+=1\r\n step=step+'U'\r\n if row2<row1:\r\n row1-=1\r\n step=step+'D'\r\n\r\n steps.append(step)\r\n\r\nprint(len(steps))\r\nfor step in steps:\r\n print(step)\r\n################################################################################\r\n", "s = list(input())\r\ns[0] = ord(s[0]) - 97\r\ns[1] = int((s[1]))\r\n\r\nt = list(input())\r\nt[0] = ord(t[0]) - 97\r\nt[1] = int(t[1])\r\n\r\nvertical = \"R\" if s[0] < t[0] else \"L\"\r\ncount_ver = abs(s[0] - t[0])\r\nhorizontal = \"U\" if s[1] < t[1] else \"D\"\r\ncount_hor = abs(s[1] - t[1])\r\n\r\nprint(max(count_hor, count_ver))\r\nwhile count_ver > 0 or count_hor > 0:\r\n if count_ver > 0:\r\n count_ver -= 1\r\n print(vertical, end = \"\")\r\n if count_hor > 0:\r\n count_hor -= 1\r\n print(horizontal, end = \"\")\r\n print(\"\")", "s = input()\r\nt = input()\r\nrow = [\"a\", \"b\", \"c\", \"d\", \"e\", \"f\", \"g\", \"h\"]\r\ny0 = int(s[1])\r\ny1 = int(t[1])\r\n\r\nx0 = row.index(s[0])\r\nx1 = row.index(t[0])\r\nmoves = []\r\nwhile True:\r\n x, y = \"\", \"\"\r\n if(x1 == x0 and y1 == y0):\r\n break\r\n\r\n if(x1 > x0):\r\n x0 = x0 + 1\r\n x = \"R\"\r\n\r\n elif(x1 < x0):\r\n x0 = x0 - 1\r\n x = \"L\"\r\n\r\n if(y1 > y0):\r\n y0 = y0 + 1\r\n y = \"U\"\r\n elif(y1 < y0):\r\n y0 = y0 - 1\r\n y = \"D\"\r\n moves.append(x + y)\r\n\r\n\r\nprint(len(moves))\r\nfor move in moves:\r\n print(move)\r\n", "ini=input()\r\ntar=input()\r\ndef compare(previous_square,current_square):\r\n prev_col=previous_square[0]\r\n prev_row=previous_square[1]\r\n\r\n cur_col=current_square[0]\r\n cur_row=current_square[1]\r\n motion=''\r\n if prev_col!=cur_col:\r\n if prev_col+1==cur_col :\r\n motion+='R'\r\n else:\r\n motion+='L'\r\n if prev_row!=cur_row:\r\n if prev_row+1==cur_row:\r\n motion+='U'\r\n else:\r\n motion+='D'\r\n return motion\r\ncur_col=ord(ini[0])\r\ncur_row=int(ini[1])\r\n\r\ntar_col=ord(tar[0])\r\ntar_row=int(tar[1])\r\n\r\ntar=[tar_col,tar_row]\r\ncur=[cur_col,cur_row]\r\ndel_col=0\r\ndel_row=0\r\nif cur_col!=tar_col:\r\n del_col=(tar_col-cur_col)//abs(tar_col-cur_col)\r\nif cur_row!=tar_row:\r\n del_row=(tar_row-cur_row)//abs(tar_row-cur_row)\r\n\r\nmoves=[]\r\nwhile cur!=tar:\r\n prev=cur\r\n if cur_col!=tar_col and cur_row!=tar_row:\r\n cur_col=cur_col+del_col\r\n cur_row=cur_row+del_row\r\n cur=cur_col+cur_row\r\n elif cur_col!=tar_col:\r\n cur_col=cur_col+del_col\r\n else:\r\n cur_row=cur_row+del_row\r\n cur=[cur_col,cur_row]\r\n moves.append(compare(prev,cur))\r\n\r\nprint(str(len(moves)))\r\nfor move in moves:\r\n print(move)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n \r\n \r\n\r\n", "s = input()\r\nt = input()\r\n\r\ndx = ord(s[0]) - ord(t[0])\r\ndy = ord(s[1]) - ord(t[1])\r\n\r\nx, y = \"\", \"\"\r\nif dx > 0:\r\n\tx = \"L\"\r\nelse:\r\n\tx = \"R\"\r\nif dy > 0:\r\n\ty = \"D\"\r\nelse:\r\n\ty = \"U\"\r\n\r\ndx, dy = abs(dx), abs(dy)\r\nprint(max(dx, dy))\r\n\r\nfor i in range(min(dx, dy)):\r\n\tprint(x + y)\r\n\r\nif dx > dy:\r\n\tfor i in range(dx - dy):\r\n\t\tprint(x)\r\nelse:\r\n\tfor i in range(dy - dx):\r\n\t\tprint(y)", "t1, t2 = input(), input()\r\nxs, ys, xt, yt = ord(t1[0])-ord('a')+1, int(t1[1]), ord(t2[0])-ord('a')+1, int(t2[1])\r\nn = max(abs(xt-xs), abs(yt-ys))\r\nprint(n)\r\nfor i in range(n):\r\n if xs < xt :\r\n if ys > yt:\r\n print(\"RD\")\r\n ys -= 1\r\n elif ys < yt:\r\n print(\"RU\")\r\n ys += 1\r\n else :print(\"R\")\r\n xs += 1\r\n elif xs > xt :\r\n if ys > yt:\r\n print(\"LD\")\r\n ys -= 1\r\n elif ys < yt:\r\n print(\"LU\")\r\n ys += 1\r\n else :print(\"L\")\r\n xs -= 1\r\n elif xs == xt :\r\n if ys > yt:\r\n print(\"D\")\r\n ys -= 1\r\n elif ys < yt:\r\n print(\"U\")\r\n ys += 1\r\n else :print(\"L\")\r\n", "s1 = input()\r\nt1= input()\r\ns = [];t = []\r\ns.append(ord(s1[0])-96);t.append(ord(t1[0])-96)\r\ns.append(int(s1[1]));t.append(int(t1[1]))\r\nn = max(abs(s[0]-t[0]),abs(s[1]-t[1])) \r\nprint(n)\r\nx = s[0] - t[0]\r\ny = s[1] - t[1]\r\n\r\nwhile s[0]-t[0] != 0 or s[1]-t[1] != 0:\r\n ans = ''\r\n if s[0] - t[0] > 0:\r\n ans += 'L'\r\n s[0] -= 1\r\n elif s[0] - t[0] == 0:\r\n pass\r\n elif s[0] - t[0] < 0:\r\n ans += 'R'\r\n s[0] += 1\r\n\r\n if s[1] - t[1] > 0:\r\n ans += 'D'\r\n s[1] -= 1\r\n elif s[1] - t[1] == 0:\r\n pass\r\n elif s[1] - t[1] < 0:\r\n ans += 'U'\r\n s[1] += 1\r\n print(ans)\r\n ", "class A:\n\n def solve(self):\n map_dict = {}\n letters = \"abcdefgh\"\n index = 1\n for l in letters:\n map_dict[l] = index\n index += 1\n\n [sx, sy] = list(input())\n [tx, ty] = list(input())\n sx = map_dict[sx]\n tx = map_dict[tx]\n sy, ty = int(sy), int(ty)\n\n diffx, diffy = abs(sx - tx), abs(sy - ty)\n\n diagonal_steps = min(diffx, diffy)\n perp_steps = max(diffx, diffy) - diagonal_steps\n\n print(diagonal_steps + perp_steps)\n\n vert_step = \"\"\n hor_step = \"\"\n if sx < tx:\n hor_step = \"R\"\n else:\n hor_step = \"L\"\n\n if sy < ty:\n vert_step = \"U\"\n else:\n vert_step = \"D\"\n\n diagonal_path = [hor_step + vert_step for x in range(diagonal_steps)]\n if diagonal_steps > 0:\n print(\"\\n\".join(diagonal_path))\n\n if diagonal_steps == diffx:\n if sy < ty:\n vert_step = \"U\"\n else:\n vert_step = \"D\"\n\n if perp_steps > 0:\n print(\"\\n\".join([vert_step for x in range(perp_steps)]))\n else:\n if sx < tx:\n hor_step = \"R\"\n else:\n hor_step = \"L\"\n\n if perp_steps > 0:\n print(\"\\n\".join([hor_step for x in range(perp_steps)]))\n\nA().solve()\n", "a=input()\r\nb = input()\r\nc,d= ord(a[0])-ord(b[0]),ord(a[1])-ord(b[1])\r\nprint(max(c,-c,d,-d))\r\nwhile c!=0 or d!=0:\r\n r=''\r\n if c<0:r='R';c+=1\r\n if c>0:r='L';c-=1\r\n if d<0:r+='U';d+=1\r\n if d>0:r+='D';d-=1\r\n print(r)\r\n", "def incrementLetter(letter, range):\n return str(chr(ord(letter)+range))\n\ns = input()\nt = input()\nresult = []\n\ndiffLetter = abs(ord(s[0]) - ord(t[0]))\ndiffNumber = abs(int(s[1]) - int(t[1]))\nminimum = min(diffLetter, diffNumber)\n\nif(diffLetter==0):\n if(t[1]>s[1]):\n result+=['U'] * diffNumber\n s = s[0] + str(int(s[1])+diffNumber)\n else:\n result+=['D'] * diffNumber\n s = s[0] + str(int(s[1])-diffNumber)\nelif(diffNumber==0):\n if(t[0]>s[0]):\n result+=['R'] * diffLetter\n s = incrementLetter(s[0], diffLetter) + s[1]\n else:\n result+=['L'] * diffLetter\n s = incrementLetter(s[0], -diffLetter) + s[1]\n\nelif(s[0]<t[0]):\n if(s[1]<t[1]):\n result+=['RU'] * minimum\n s = incrementLetter(s[0], minimum) + str(int(s[1])+minimum)\n else:\n result+=['RD'] * minimum\n s = incrementLetter(s[0], minimum) + str(int(s[1]) - minimum)\nelif(s[0]>t[0]):\n if(s[1]<t[1]):\n result+=['LU'] * minimum\n s = incrementLetter(s[0], -minimum) + str(int(s[1])+minimum)\n else:\n result+=['LD'] * minimum\n s = incrementLetter(s[0], -minimum) + str(int(s[1])-minimum)\n\nif(s!=t):\n diffLetter = abs(ord(s[0]) - ord(t[0]))\n diffNumber = abs(int(s[1]) - int(t[1]))\n minimum = min(diffLetter, diffNumber)\n if(diffLetter==0):\n if(t[1]>s[1]):\n result+=['U'] * diffNumber\n else:\n result+=['D'] * diffNumber\n elif(diffNumber==0):\n if(t[0]>s[0]):\n result+=['R'] * diffLetter\n else:\n result+=['L'] * diffLetter\n\nprint(len(result))\nfor move in result:\n print(move)\n \t\t\t\t \t \t\t\t\t \t \t \t \t\t\t", "s, = [str(x) for x in input().split()]\nt, = [str(x) for x in input().split()]\n\ntrans = { 'a': 1, 'b': 2, 'c': 3, 'd': 4, 'e': 5, 'f': 6, 'g': 7, 'h': 8 }\n\nwidth = abs(int(s[1]) - int(t[1]))\n\nlenght = abs(trans[s[0]] - trans[t[0]])\n\nprint(max(width, lenght))\n\nif (trans[t[0]] >= trans[s[0]]) and (int(t[1]) >= int(s[1])):\n for i in range(min(width, lenght)):\n print('RU')\n if width > lenght:\n for i in range(width - lenght):\n print('U')\n else:\n for i in range(lenght - width):\n print('R')\n\nif (trans[t[0]] < trans[s[0]]) and (int(t[1]) >= int(s[1])):\n for i in range(min(width, lenght)):\n print('LU')\n if width > lenght:\n for i in range(width - lenght):\n print('U')\n else:\n for i in range(lenght - width):\n print('L')\n\n\nif (trans[t[0]] >= trans[s[0]]) and (int(t[1]) < int(s[1])):\n for i in range(min(width, lenght)):\n print('RD')\n if width > lenght:\n for i in range(width - lenght):\n print('D')\n else:\n for i in range(lenght - width):\n print('R')\n\n\nif (trans[t[0]] < trans[s[0]]) and (int(t[1]) < int(s[1])):\n for i in range(min(width, lenght)):\n print('LD')\n if width > lenght:\n for i in range(width - lenght):\n print('D')\n else:\n for i in range(lenght - width):\n print('L')\n\n", "initial = input()\r\nfinal = input()\r\nhor_ini = int()\r\nver_ini = int(initial[1])\r\nhor_final = int()\r\nver_final = int(final[1])\r\ncount = 0\r\nmove_list = []\r\n\r\nhor_name = ['a', 'b', 'c', 'd', 'e', 'f', 'g', 'h']\r\nfor item in hor_name:\r\n if initial[0] == item:\r\n hor_ini = hor_name.index(item) + 1\r\n if final[0] == item:\r\n hor_final = hor_name.index(item) + 1\r\n# checked\r\nwhile (hor_final - hor_ini) != 0 or (ver_final - ver_ini) != 0:\r\n if (hor_final - hor_ini) != 0 and (ver_final - ver_ini) != 0:\r\n count += 1\r\n if hor_final > hor_ini and ver_final > ver_ini:\r\n move_list.append('RU')\r\n hor_ini += 1\r\n ver_ini += 1\r\n elif hor_final > hor_ini and ver_final < ver_ini:\r\n move_list.append('RD')\r\n hor_ini += 1\r\n ver_ini -= 1\r\n elif hor_final < hor_ini and ver_final > ver_ini:\r\n move_list.append('LU')\r\n hor_ini -= 1\r\n ver_ini += 1\r\n elif hor_final < hor_ini and ver_final < ver_ini:\r\n move_list.append('LD')\r\n hor_ini -= 1\r\n ver_ini -= 1\r\n elif (hor_final - hor_ini) != 0 and (ver_final - ver_ini) == 0:\r\n if hor_final > hor_ini:\r\n move_list.append('R')\r\n count += 1\r\n hor_ini += 1\r\n elif hor_final < hor_ini:\r\n move_list.append('L')\r\n count += 1\r\n hor_ini -= 1\r\n elif (ver_final - ver_ini) != 0 and (hor_final - hor_ini) == 0:\r\n if ver_final > ver_ini:\r\n move_list.append('U')\r\n count += 1\r\n ver_ini += 1\r\n elif ver_final < ver_ini:\r\n move_list.append('D')\r\n count += 1\r\n ver_ini -= 1\r\n\r\nprint(count)\r\nfor move in move_list:\r\n print(move)\r\n", "def sgn(x):\n return 1 if x > 0 else 0 if not x else -1\n\ns, t = input(), input()\ncs, rs = ord(s[0]) - 96, int(s[1])\nct, rt = ord(t[0]) - 96, int(t[1])\ndc, dr = ct - cs, rt - rs\nprint(max(abs(dc), abs(dr)))\nwhile dc or dr:\n if dc:\n print(\"R\" if dc > 0 else \"L\", end=\"\")\n dc -= sgn(dc)\n if dr:\n print(\"U\" if dr > 0 else \"D\", end=\"\")\n dr -= sgn(dr)\n print()", "Answer = []\r\nOrigin, Destination = input(), input()\r\nwhile Origin != Destination:\r\n if Origin[0] == Destination[0]:\r\n if Destination[1] > Origin[1]:\r\n Answer.append(\"U\")\r\n Origin = Origin[0] + str(int(Origin[1]) + 1)\r\n else:\r\n Answer.append(\"D\")\r\n Origin = Origin[0] + str(int(Origin[1]) - 1)\r\n elif Origin[1] == Destination[1]:\r\n if Destination[0] > Origin[0]:\r\n Answer.append(\"R\")\r\n Origin = chr(ord(Origin[0]) + 1) + Origin[1]\r\n else:\r\n Answer.append(\"L\")\r\n Origin = chr(ord(Origin[0]) - 1) + Origin[1]\r\n elif Destination[0] > Origin[0] and Destination[1] > Origin[1]:\r\n Answer.append(\"RU\")\r\n Origin = chr(ord(Origin[0]) + 1) + str(int(Origin[1]) + 1)\r\n elif Destination[0] > Origin[0] and Destination[1] < Origin[1]:\r\n Answer.append(\"RD\")\r\n Origin = chr(ord(Origin[0]) + 1) + str(int(Origin[1]) - 1)\r\n elif Destination[0] < Origin[0] and Destination[1] < Origin[1]:\r\n Answer.append(\"LD\")\r\n Origin = chr(ord(Origin[0]) - 1) + str(int(Origin[1]) - 1)\r\n else:\r\n Answer.append(\"LU\")\r\n Origin = chr(ord(Origin[0]) - 1) + str(int(Origin[1]) + 1)\r\nprint(len(Answer), *Answer, sep=\"\\n\")\r\n\r\n# Show you deserve being the best to whom doesn't believe in you.\r\n# Location: WTF is this JAVA project. Data Mining with JAVA?\r\n# Like participating with Pride in car races\r\n", "#CF_3A\r\n\r\nif __name__ == \"__main__\":\r\n s = tuple(input().strip())\r\n t = tuple(input().strip())\r\n f = lambda x, y: max(ord(x), ord(y)) - min(ord(x), ord(y))\r\n ans = max(f(s[0], t[0]), f(s[1], t[1]))\r\n print(ans)\r\n if s[0] <= t[0] and s[1] <= t[1]:\r\n k = min(f(s[0], t[0]), f(s[1], t[1]))\r\n for i in range(k):\r\n print(\"RU\")\r\n if f(s[0], t[0]) < f(s[1], t[1]):\r\n for i in range(ans - k):\r\n print(\"U\")\r\n else:\r\n for i in range(ans - k):\r\n print(\"R\")\r\n elif s[0] <= t[0] and s[1] >= t[1]:\r\n k = min(f(s[0], t[0]), f(s[1], t[1]))\r\n for i in range(k):\r\n print(\"RD\")\r\n if f(s[0], t[0]) < f(s[1], t[1]):\r\n for i in range(ans - k):\r\n print(\"D\")\r\n else:\r\n for i in range(ans - k):\r\n print(\"R\")\r\n elif s[0] >= t[0] and s[1] <= t[1]:\r\n k = min(f(s[0], t[0]), f(s[1], t[1]))\r\n for i in range(k):\r\n print(\"LU\")\r\n if f(s[0], t[0]) < f(s[1], t[1]):\r\n for i in range(ans - k):\r\n print(\"U\")\r\n else:\r\n for i in range(ans - k):\r\n print(\"L\")\r\n elif s[0] >= t[0] and s[1] >= t[1]:\r\n k = min(f(s[0], t[0]), f(s[1], t[1]))\r\n for i in range(k):\r\n print(\"LD\")\r\n if f(s[0], t[0]) < f(s[1], t[1]):\r\n for i in range(ans - k):\r\n print(\"D\")\r\n else:\r\n for i in range(ans - k):\r\n print(\"L\")\r\n", "from collections import deque\r\n\r\n\r\nclass Solution:\r\n def __init__(self) -> None:\r\n self.boardSize=8\r\n self.boardAlpha='abcdefgh'\r\n self.agMap={c:i for i,c in enumerate(self.boardAlpha)}\r\n self.moves=[[1,1,'RD'],[1,-1,'LD'],[-1,1,'RU'],[-1,-1,'LU'],[0,1,'R'],[0,-1,'L'],[1,0,'D'],[-1,0,'U']]\r\n \r\n def check(self,x,y):\r\n return x>=0 and y>=0 and x<self.boardSize and y<self.boardSize\r\n\r\n def getShortestPath(self,startPos,endPos):\r\n visited=[[0 for i in range(self.boardSize)] for j in range(self.boardSize)]\r\n start_x,start_y=self.boardSize-int(startPos[1]),self.agMap[startPos[0]]\r\n end_x,end_y=self.boardSize-int(endPos[1]),self.agMap[endPos[0]]\r\n queue=deque()\r\n queue.append([start_x,start_y,0,[]])\r\n visited[start_x][start_y]=1\r\n while len(queue):\r\n x,y,step_count,curr_path=queue.popleft()\r\n if x==end_x and y==end_y:\r\n ans=step_count\r\n ans_path=curr_path\r\n break\r\n for move in self.moves:\r\n if self.check(x+move[0],y+move[1]) and not visited[x+move[0]][y+move[1]]:\r\n visited[x+move[0]][y+move[1]]=1\r\n new_path=curr_path.copy()\r\n new_path.append(move[2])\r\n queue.append([x+move[0],y+move[1],step_count+1,new_path])\r\n\r\n return ans,ans_path\r\n\r\nif __name__ == \"__main__\":\r\n startPos=input()\r\n endPos=input()\r\n sol=Solution()\r\n steps,path=sol.getShortestPath(startPos,endPos)\r\n print(steps)\r\n for move in path:\r\n print(move)", "from string import ascii_lowercase\nfrom typing import Tuple\nimport fileinput\n\nfor idx, line in enumerate(fileinput.input()):\n if idx == 0:\n start = line.rstrip()\n elif idx == 1:\n finish = line.rstrip()\n break\n\nletter_to_row = dict(zip(ascii_lowercase[:8], range(8)))\nrow_to_letter = ascii_lowercase\n\ndef move(current: str, horizontal: int, vertical: int) -> str:\n letter = row_to_letter[letter_to_row[current[0]] + horizontal]\n number = str(int(current[1]) + vertical)\n return f'{letter}{number}'\n\ndef check_vertical(current: str, finish: str) -> Tuple[str, int]:\n if int(finish[1]) > int(current[1]):\n return 'U', 1\n if int(finish[1]) < int(current[1]):\n return 'D', -1\n else:\n return '', 0\n\ndef check_horizontal(current: str, finish: str) -> Tuple[str, int]:\n if letter_to_row[finish[0]] > letter_to_row[current[0]]:\n return 'R', 1\n elif letter_to_row[finish[0]] < letter_to_row[current[0]]:\n return 'L', -1\n else:\n return '', 0\n\ncurrent = start\nmoves = []\nfor _ in range(8):\n y_direction, y_vector = check_vertical(current, finish)\n x_direction, x_vector = check_horizontal(current, finish)\n if y_vector == 0 and x_vector == 0:\n break\n moves.append(x_direction + y_direction)\n current = move(current, x_vector, y_vector)\n\nprint(len(moves))\nfor m in moves:\n print(m)\n", "s1=input()\r\ns2=input()\r\ns=s1+s2\r\na,b=(ord(s[i])-ord(s[i+2])for i in(0,1))\r\nprint(max(a,-a,b,-b))\r\nwhile a!=0 or b!=0:\r\n r=''\r\n if a<0:r='R';a+=1\r\n if a>0:r='L';a-=1\r\n if b<0:r+='U';b+=1\r\n if b>0:r+='D';b-=1\r\n print(r)", "from collections import deque\r\n\r\n\r\ndef check(i, j):\r\n if i > 7 or j > 7 or i < 0 or j < 0:\r\n return False\r\n return True\r\n\r\n\r\ndef solve(start, end):\r\n q = deque([(start[0], start[1], 0, [])])\r\n vis = {start}\r\n while q:\r\n curx, cury, steps, path = q.popleft()\r\n if (curx, cury) == end:\r\n break\r\n for x, y, d in [(-1, -1, 'LU'), (-1, 0, 'U'), (-1, 1, 'RU'), (0, 1, 'R'), (1, 1, 'RD'),\r\n (1, 0, 'D'), (1, -1, 'LD'), (0, -1, 'L')]:\r\n x, y = curx + x, cury + y\r\n if check(x, y) and (x,y) not in vis:\r\n q.append((x, y, steps + 1, path+[d]))\r\n vis.add((x, y))\r\n print(steps)\r\n for p in path:\r\n print(p)\r\n\r\n\r\nif __name__ == '__main__':\r\n start = input()\r\n end = input()\r\n start_pos = (8 - int(start[1]), ord(start[0]) - 97)\r\n end_pos = (8 - int(end[1]), ord(end[0]) - 97)\r\n solve(start_pos, end_pos)\r\n", "\"\"\"\r\n\tProg Math\r\n\tGuido\r\n\"\"\"\r\n\r\ndef makePath(horz: str, vert: str):\r\n\tval = min(x,y)\r\n\tprint(max(x,y))\r\n\tfor _ in range(val):\r\n\t\tprint(horz+vert)\r\n\tif x >= y:\r\n\t\tfor _ in range(x-y):\r\n\t\t\tprint(horz)\r\n\telse:\r\n\t\tfor _ in range(y-x):\r\n\t\t\tprint(vert)\r\n\r\nstart = input()\r\nend = input()\r\n\r\ndx = ord(end[0]) - ord(start[0])\r\ndy = ord(end[1]) - ord(start[1])\r\nx = abs(dx)\r\ny = abs(dy)\r\n\r\nif dx >= 0 and dy >= 0:\r\n\tmakePath(\"R\", \"U\")\r\n\r\nelif dx <= 0 and dy >= 0:\r\n\tmakePath(\"L\", \"U\")\r\n\r\nelif dx >= 0 and dy <= 0:\r\n\tmakePath(\"R\", \"D\")\r\n\r\nelif dx <= 0 and dy <= 0:\r\n\tmakePath(\"L\", \"D\")\r\n", "#import numpy as np;\r\nscr=input()\r\ndis=input()\r\ns=[ord(scr[0]),int(scr[1])]\r\nd=[ord(dis[0]),int(dis[1])]\r\nans=[]\r\nk=0\r\nif (s[0]<d[0])and (s[1]>d[1]):\r\n while ((s[0]<d[0])and (s[1]>d[1])):\r\n k+=1\r\n\r\n ans.append(\"RD\")\r\n s[0]+=1\r\n s[1]-=1\r\n # if (s[0]==d[0])and (s[1]!=d[1]):\r\n # k+=s[1]-d[1]\r\n # ch=\"D\"*(s[1]-d[1])\r\n # ans.extend(list(ch))\r\n # if (s[1]==d[1])and (s[0]!=d[0]):\r\n # k+=abs(s[0]-d[0])\r\n # ch=\"R\"*abs(s[1]-d[1])\r\n # ans.extend(list(ch))\r\nif (s[0]>d[0])and (s[1]>d[1]):\r\n while ((s[0]>d[0])and (s[1]>d[1])):\r\n k+=1\r\n\r\n ans.append(\"LD\")\r\n s[0]-=1\r\n s[1]-=1\r\n # if (s[0]==d[0])and (s[1]!=d[1]):\r\n # k+=s[1]-d[1]\r\n # ch=\"D\"*(s[1]-d[1])\r\n # ans.extend(list(ch))\r\n # if (s[1]==d[1])and (s[0]!=d[0]):\r\n # k+=abs(s[0]-d[0])\r\n # ch=\"L\"*abs(s[1]-d[1])\r\n # ans.extend(list(ch))\r\nif (s[0]>d[0])and (s[1]<d[1]):\r\n while ((s[0]>d[0])and (s[1]<d[1])):\r\n k+=1\r\n\r\n ans.append(\"LU\")\r\n s[0]-=1\r\n s[1]+=1\r\n # if (s[0]==d[0])and (s[1]!=d[1]):\r\n # k+=abs(s[1]-d[1])\r\n # ch=\"U\"*abs(s[1]-d[1])\r\n # ans.extend(list(ch))\r\n # if (s[1]==d[1])and (s[0]!=d[0]):\r\n # k+=abs(s[0]-d[0])\r\n # ch=\"L\"*abs(s[1]-d[1])\r\n # ans.extend(list(ch))\r\nif (s[0]<d[0])and (s[1]<d[1]):\r\n while ((s[0]<d[0])and (s[1]<d[1])):\r\n k+=1\r\n\r\n ans.append(\"RU\")\r\n s[0]+=1\r\n s[1]+=1\r\n # if (s[0]==d[0])and (s[1]!=d[1]):\r\n # k+=abs(s[1]-d[1])\r\n # ch=\"U\"*abs(s[1]-d[1])\r\n # ans.extend(list(ch))\r\n # if (s[1]==d[1])and (s[0]!=d[0]):\r\n # k+=abs(s[0]-d[0])\r\n # ch=\"R\"*abs(s[1]-d[1])\r\n # ans.extend(list(ch))\r\nif s[0]==d[0]:\r\n if (s[1]>d[1]):\r\n k+=abs(s[1]-d[1])\r\n ch=\"D\"*abs(s[1]-d[1])\r\n ans.extend(list(ch))\r\n if (s[1]<d[1]):\r\n k+=abs(s[1]-d[1])\r\n ch=\"U\"*abs(s[1]-d[1])\r\n ans.extend(list(ch))\r\nif s[1]==d[1]:\r\n if (s[0]>d[0]):\r\n k+=abs(s[0]-d[0])\r\n ch=\"L\"*abs(s[0]-d[0])\r\n ans.extend(list(ch))\r\n if (s[0]<d[0]):\r\n k+=abs(s[0]-d[0])\r\n ch=\"R\"*abs(s[0]-d[0])\r\n ans.extend(list(ch))\r\nprint(k)\r\nfor x in ans:\r\n print(x)\r\n print('\\n')\r\n", "\"\"\"\nd={\n a: {1: 1, 2: 1, 3: 1, 4: 1, 5:1, 6: 1, 7: 1, 8:1},\n b: {1: 1, 2: 1, 3: 1, 4: 1, 5:1, 6: 1, 7: 1, 8:1},\n c: {1: 1, 2: 1, 3: 1, 4: 1, 5:1, 6: 1, 7: 1, 8:1},\n d: {1: 1, 2: 1, 3: 1, 4: 1, 5:1, 6: 1, 7: 1, 8:1},\n e: {1: 1, 2: 1, 3: 1, 4: 1, 5:1, 6: 1, 7: 1, 8:1},\n f: {1: 1, 2: 1, 3: 1, 4: 1, 5:1, 6: 1, 7: 1, 8:1},\n g: {1: 1, 2: 1, 3: 1, 4: 1, 5:1, 6: 1, 7: 1, 8:1},\n h:{1: 1, 2: 1, 3: 1, 4: 1, 5:1, 6: 1, 7: 1, 8:1}\n} \n A B C D E F G H\n 8 0 * 2 3 4 5 \n 7\n 6\n 5\n 4\n 3\n 2\n 1 \n\n\n 8\n 7\n 6\n 5\n 4\n 3\n 2\n 1 \n\n \n\n\n\"\"\"\nfrom collections import deque\ndef shortest_path_king(start, target):\n q = deque()\n q.append([(start, '')])\n visited = set()\n\n while len(q)!= 0:\n path = q.popleft()\n v = path[-1]\n if v in visited:\n continue\n if v[0] == target:\n # return path\n n_path = [a[1] for a in path[1:] ]\n return [len(path[1:]), n_path]\n visited.add(v)\n neighbours = get_neighbours(v)\n for neighbour in neighbours:\n if neighbour not in visited:\n l = list(path)\n l.append(neighbour)\n q.append(l)\ndef get_neighbours(v):\n square, direction = v\n s,n = square[0], square[1]\n d = {'a': 0, 'b': 1, 'c': 2, 'd':3 , 'e':4, 'f': 5, 'g':6, 'h':7}\n rd = { 0: 'a', 1: 'b', 2: 'c', 3: 'd', 4: 'e', 5: 'f', 6:'g', 7: 'h'}\n neighbours =[]\n #left\n if s != 'a':\n neighbours.append(( rd[d.get(s) - 1 ] + n, 'L'))\n #right\n if s != 'h':\n neighbours.append((rd[d.get(s) + 1] + n, 'R'))\n #bottom\n if int(n) != 1 :\n neighbours.append((s + str( int(n) - 1), 'D') ) \n # top\n if int(n) != 8:\n neighbours.append((s + str( int(n) + 1), 'U') ) \n # diagonal up left\n if s != 'a' and int(n) != 8:\n neighbours.append(( rd[d.get(s) - 1 ] + str(int(n) + 1), 'LU'))\n #diagonal up right\n if s != 'h' and int(n) != 8: \n neighbours.append((rd[d.get(s) + 1] + str(int(n) + 1), 'RU'))\n # diagonal left down\n if s != 'a' and int(n) != 1 :\n neighbours.append(( rd[d.get(s) - 1 ] + str( int(n) - 1), 'LD' ))\n #diagonal right down\n \n if s != 'h' and int(n) != 1 :\n neighbours.append((rd[d.get(s) + 1] + str( int(n) - 1), 'RD'))\n return neighbours\n\n\ns = input()\nt = input()\n \nn, paths = shortest_path_king(s, t)\nprint(n)\nfor path in paths:\n print(path)", "s1, s2 = input()\r\nt1, t2 = input()\r\n\r\ns1 = ord(s1)\r\nt1 = ord(t1)\r\n\r\ns2 = int(s2)\r\nt2 = int(t2)\r\n\r\nmoves = []\r\nwhile s1 != t1 or s2 != t2:\r\n move = \"\"\r\n if s1 < t1:\r\n move += \"R\"\r\n s1 += 1\r\n elif s1 > t1:\r\n move += \"L\"\r\n s1 -= 1\r\n\r\n if s2 < t2:\r\n move += \"U\"\r\n s2 += 1\r\n elif s2 > t2:\r\n move += \"D\"\r\n s2 -= 1\r\n moves.append(move)\r\n\r\nprint(len(moves))\r\n[print(x) for x in moves]\r\n", "def shortest_path(s, t):\r\n cots = ord(s[0])\r\n dongs = ord(s[1])\r\n\r\n cott = ord(t[0])\r\n dongt = ord(t[1])\r\n\r\n print(max(abs(dongs - dongt), abs(cots - cott)))\r\n\r\n while True:\r\n if cots == cott and dongs == dongt:\r\n break\r\n\r\n if cots < cott:\r\n cots += 1\r\n print('R', end=\"\")\r\n else:\r\n if cots > cott:\r\n cots -= 1\r\n print('L', end=\"\")\r\n\r\n if dongs > dongt:\r\n dongs -= 1\r\n print('D', end=\"\")\r\n else: \r\n if dongs < dongt:\r\n dongs += 1\r\n print('U', end=\"\")\r\n print()\r\ns = input()\r\nt = input()\r\n\r\n\r\nshortest_path(s, t)", "s = input()\r\nt = input()\r\n\r\nend = crr = []\r\n\r\ncrr = ord(s[0]) - 96, int(s[1])\r\nend = ord(t[0]) - 96, int(t[1])\r\n\r\na = crr[0] - end[0]\r\nb = crr[1] - end[1]\r\n\r\nprint(max(a, -a, b, -b))\r\n\r\nwhile a or b != 0:\r\n p = \"\"\r\n if a < 0:\r\n p = \"R\"\r\n a += 1\r\n if a > 0:\r\n p = \"L\"\r\n a -= 1\r\n if b < 0:\r\n p += \"U\"\r\n b += 1\r\n if b > 0:\r\n p += \"D\"\r\n b -= 1\r\n print(p)\r\n", "from sys import stdin, stdout\r\n\r\ns = stdin.readline()\r\nd = stdin.readline()\r\n\r\nnum_moves = max(abs(ord(d[0]) - ord(s[0])), abs(ord(d[1]) - ord(s[1])))\r\n\r\nstdout.write(str(num_moves)+'\\n')\r\n\r\nmove = \"\"\r\n\r\ns1 = ord(s[0])\r\nd1 = ord(d[0])\r\n\r\ns2 = int(s[1])\r\nd2 = int(d[1])\r\n\r\nwhile s1 != d1 or s2 != d2:\r\n\r\n if s1 < d1:\r\n s1 += 1\r\n move = move + 'R'\r\n elif s1 > d1:\r\n s1 += -1\r\n move = move + 'L'\r\n\r\n if s2 < d2:\r\n s2 += 1\r\n move = move + 'U'\r\n elif s2 > d2:\r\n s2 += -1\r\n move = move + 'D'\r\n stdout.write(move+'\\n')\r\n move = \"\"", "s = list(input())\r\nt = list(input())\r\nresult = []\r\nwhile s[0] != t[0] or s[1] != t[1]:\r\n coordinates = ''\r\n if s[0] < t[0]:\r\n coordinates += 'R'\r\n s[0] = chr(ord(s[0]) + 1)\r\n elif s[0] > t[0]:\r\n coordinates += 'L'\r\n s[0] = chr(ord(s[0]) - 1)\r\n\r\n if s[1] > t[1]:\r\n coordinates += 'D'\r\n s[1] = str(int(s[1]) - 1)\r\n elif s[1] < t[1]:\r\n coordinates += 'U'\r\n s[1] = str(int(s[1]) + 1)\r\n result.append(coordinates)\r\nprint(len(result))\r\nprint(\"\\n\".join(result))\r\n", "b=['o','a','b','c','d','e','f','g','h']\r\ns=input()\r\ns1=b.index(s[0])\r\ns2=int(s[1])\r\ne=input()\r\ne1=b.index(e[0])\r\ne2=int(e[1])\r\n\r\nm=max(abs(s1-e1),abs(s2-e2))\r\nprint(m)\r\nwhile s1!=e1 or s2!=e2:\r\n ss=''\r\n if s1!=e1:\r\n if s1<e1:\r\n ss+='R'\r\n else:\r\n ss+='L'\r\n s1-=(s1-e1)//abs(s1-e1)\r\n \r\n if s2!=e2:\r\n if s2>e2:\r\n ss+='D'\r\n else:\r\n ss+='U'\r\n s2-=(s2-e2)//abs(s2-e2)\r\n \r\n print(ss)\r\n", "now = list(input())\r\nend = list(input())\r\ny = []\r\nalphabet = [\"a\",\"b\",\"c\",\"d\",\"e\",\"f\",\"g\",\"h\"]\r\nnow[0] = alphabet.index(now[0]) + 1\r\nend[0] = alphabet.index(end[0]) + 1\r\nnow[1] = int(now[1])\r\nend[1] = int(end[1])\r\nwhile now != end:\r\n if(now[0] == end[0] or now[1] == end[1]):\r\n if(now[0] < end[0]):\r\n y.append(\"R\")\r\n now[0] = now[0] + 1\r\n if(now[0] > end[0]):\r\n y.append(\"L\")\r\n now[0] = now[0] - 1\r\n if(now[1] > end[1]):\r\n y.append(\"D\")\r\n now[1] = now[1] - 1\r\n if(now[1] < end[1]):\r\n y.append(\"U\")\r\n now[1] = now[1] + 1\r\n else:\r\n if(now[0] < end[0] and now[1] > end[1]):\r\n y.append(\"RD\")\r\n now[0] = now[0] + 1\r\n now[1] = now[1] - 1\r\n if(now[0] < end[0] and now[1] < end[1]):\r\n y.append(\"RU\")\r\n now[0] = now[0] + 1\r\n now[1] = now[1] + 1\r\n if(now[0] > end[0] and now[1] > end[1]):\r\n y.append(\"LD\")\r\n now[0] = now[0] - 1\r\n now[1] = now[1] - 1\r\n if(now[0] > end[0] and now[1] < end[1]):\r\n y.append(\"LU\")\r\n now[0] = now[0] - 1\r\n now[1] = now[1] + 1\r\nprint(len(y))\r\nfor i in y:\r\n print(i)", "start=input()\r\nend=input()\r\ncolst =start[0]\r\nif colst==\"a\":\r\n colst=1\r\nelif colst==\"b\":\r\n colst=2\r\nelif colst==\"c\":\r\n colst=3\r\nelif colst==\"d\":\r\n colst=4\r\nelif colst==\"e\":\r\n colst=5\r\nelif colst==\"f\":\r\n colst=6\r\nelif colst==\"g\":\r\n colst=7\r\nelif colst==\"h\":\r\n colst=8\r\nrowst=int(start[1])\r\ncole=end[0]\r\nif cole==\"a\":\r\n cole=1\r\nelif cole==\"b\":\r\n cole=2\r\nelif cole==\"c\":\r\n cole=3\r\nelif cole==\"d\":\r\n cole=4\r\nelif cole==\"e\":\r\n cole=5\r\nelif cole==\"f\":\r\n cole=6\r\nelif cole==\"g\":\r\n cole=7\r\nelif cole==\"h\":\r\n cole=8\r\nrowe=int(end[1])\r\nd=[]\r\ncnt=0\r\n\r\nwhile((colst!=cole)or(rowst!=rowe)):\r\n ans=\"\"\r\n\r\n if colst<cole:\r\n ans+=\"R\"\r\n colst+=1\r\n if colst>cole:\r\n ans+=\"L\"\r\n colst-=1\r\n if rowst < rowe:\r\n ans += \"U\"\r\n rowst += 1\r\n if rowst > rowe:\r\n ans += \"D\"\r\n rowst -= 1\r\n cnt+=1\r\n d.append(ans)\r\nprint(cnt)\r\nfor i in d:\r\n print(i)\r\n\r\n\r\n", "input1 = input()\r\ninput2 = input()\r\nabc = \"abcdefgh\"\r\nstart = [abc.index(input1[0]), int(input1[1])-1]\r\nfinish = [abc.index(input2[0]), int(input2[1])-1]\r\n\r\nway = []\r\ncount = 0\r\n\r\nwhile start != finish:\r\n count+=1\r\n dir = \"\"\r\n if start[0] > finish[0]:\r\n dir += \"L\"\r\n start[0]-=1\r\n if start[0] < finish[0]:\r\n dir += \"R\"\r\n start[0]+=1\r\n if start[1] > finish[1]:\r\n dir += \"D\"\r\n start[1]-=1\r\n if start[1] < finish[1]:\r\n dir += \"U\"\r\n start[1]+=1\r\n way.append(dir)\r\n\r\nprint(count)\r\nfor step in way:\r\n print(step)\r\n\r\n", "dictPos = { \"a\": 1, \"b\": 2, \"c\": 3, \"d\": 4, \"e\": 5, \"f\": 6, \"g\": 7, \"h\":8 }\ndef toCoordinate(pos):\n return [dictPos[pos[0]], int(pos[1])]\n\nkingPos = toCoordinate(str(input()))\ntargetPos = toCoordinate(str(input()))\n\ndiffPos = [targetPos[0] - kingPos[0], targetPos[1] - kingPos[1]]\ndiagonalMove = min(abs(diffPos[0]), abs(diffPos[1]))\n\nhMove = \"R\" if diffPos[0] > 0 else \"L\"\nvMove = \"U\" if diffPos[1] > 0 else \"D\"\n\nmove = \"\"\nnMove = 0\nif (diagonalMove > 0):\n nMove = diagonalMove\n move = move + diagonalMove * (hMove + vMove + \"\\n\")\n\nif (abs(diffPos[0]) > diagonalMove):\n nMove = nMove + abs(diffPos[0]) - diagonalMove\n move = move + (hMove + \"\\n\") * (abs(diffPos[0]) - diagonalMove)\nelse:\n nMove = nMove + abs(diffPos[1]) - diagonalMove\n move = move + (vMove + \"\\n\") * (abs(diffPos[1]) - diagonalMove)\n\nprint(nMove)\nprint(move[:-1])\n\n\t\t\t \t \t\t \t\t\t \t \t\t \t", "letters = \"abcdefgh\"\r\nsrc, tgt = input(), input()\r\nsrcL, srcD = letters.index(src[0]), int(src[1])\r\ntgtL, tgtD = letters.index(tgt[0]), int(tgt[1])\r\nmhDist = max(abs(srcL - tgtL), abs(srcD - tgtD))\r\nprint(mhDist)\r\nfor i in range(mhDist):\r\n move = ''\r\n if srcL < tgtL: \r\n move += 'R'\r\n srcL += 1\r\n elif srcL > tgtL: \r\n move += 'L'\r\n srcL -= 1\r\n \r\n if srcD < tgtD:\r\n move += 'U'\r\n srcD += 1\r\n elif srcD > tgtD:\r\n move += 'D'\r\n srcD -= 1\r\n\r\n print(move)", "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 src = I().strip()\r\n dst = I().strip()\r\n\r\n d = {}\r\n for c in string.ascii_lowercase:\r\n d[c] = 9-(ord(c)-ord('a')+1)\r\n\r\n src = [d[src[0]], int(src[1])]\r\n dst = [d[dst[0]], int(dst[1])]\r\n x = dst[0]-src[0]\r\n y = dst[1]-src[1]\r\n\r\n ans = []\r\n while x != 0 or y != 0:\r\n if x==0:\r\n if y>0:\r\n ans.append('U')\r\n else:\r\n ans.append('D')\r\n elif y==0:\r\n if x>0:\r\n ans.append('L')\r\n else:\r\n ans.append('R')\r\n else:\r\n if y>0 and x>0:\r\n ans.append('LU')\r\n if y>0 and x<0:\r\n ans.append('RU')\r\n if y<0 and x>0:\r\n ans.append('LD')\r\n if y<0 and x<0:\r\n ans.append('RD')\r\n\r\n if y<0:\r\n y+=1\r\n elif y>0:\r\n y-=1\r\n\r\n if x<0:\r\n x+=1\r\n elif x>0:\r\n x-=1\r\n\r\n\r\n print(len(ans))\r\n WRITE(ans)\r\n\r\nsolve()\r\n", "#@sorcerer_21\r\nfrom collections import *\r\nimport sys,math\r\ninput=lambda:sys.stdin.readline().strip()\r\nmapin=lambda:map(int,input().split())\r\nfor _ in range(1):\r\n s,t=input(),input()\r\n x1=int(ord(s[0]));x2=int(ord(t[0]))\r\n y1=int(s[1]);y2=int(t[1])\r\n dx=abs(x1-x2);dy=abs(y1-y2)\r\n total_move=max(dx,dy)\r\n print(total_move)\r\n dict={(1,0):'R',(-1,0):'L',(0,1):'U',(0,-1):'D',(1,1):'RU',(-1,1):'LU',(-1,-1):'LD',(1,-1):'RD'}\r\n mn=y2-y1\r\n if dx<dy:mn=x2-x1\r\n for i in range(abs(mn)):\r\n pair=(((x2-x1)//abs(x2-x1)),((y2-y1)//abs(y2-y1)))\r\n print(dict[pair])\r\n x1+=mn;y1+=mn\r\n dx=x2-x1;dy=y2-y1\r\n for i in range(abs(mn),total_move):\r\n if dx:dx=dx//abs(dx)\r\n if dy:dy=dy//abs(dy)\r\n pair=(dx,dy)\r\n print(dict[pair])", "# import accuracy\r\ns1=input()\r\ns2=input()\r\nx1=ord(s1[0])-96\r\ny1=int(s1[1])\r\nx2=ord(s2[0])-96\r\ny2=int(s2[1])\r\nmoves=0\r\ns=\"\"\r\nfor i in range(20):\r\n a=''\r\n b=''\r\n if x1>x2 and y1>y2:\r\n moves+=1\r\n a='L'\r\n b='D'\r\n x1-=1\r\n y1-=1\r\n s+=(a+b+\"\\n\")\r\n elif x1>x2 and y1==y2:\r\n moves+=1\r\n a='L'\r\n x1-=1\r\n s+=(a+b+\"\\n\")\r\n elif x1>x2 and y1<y2:\r\n moves+=1\r\n a='L'\r\n b='U'\r\n x1-=1\r\n y1+=1\r\n s+=(a+b+\"\\n\")\r\n elif x1<x2 and y1>y2:\r\n moves+=1\r\n a='R'\r\n b='D'\r\n x1+=1\r\n y1-=1\r\n s+=(a+b+\"\\n\")\r\n elif x1<x2 and y1==y2:\r\n moves+=1\r\n a='R'\r\n x1+=1\r\n s+=(a+b+\"\\n\")\r\n elif x1<x2 and y1<y2: \r\n moves+=1\r\n a='R'\r\n b='U'\r\n x1+=1\r\n y1+=1\r\n s+=(a+b+\"\\n\")\r\n elif x1==x2 and y1>y2:\r\n moves+=1\r\n b='D'\r\n y1-=1\r\n s+=(a+b+\"\\n\")\r\n elif x1==x2 and y1<y2:\r\n moves+=1\r\n b='U'\r\n y1+=1\r\n s+=(a+b+\"\\n\")\r\n elif x1==x2 and y1==y2:\r\n break \r\nprint(moves)\r\nprint(s)", "pos=input()\r\ndest=input()\r\nd1=ord(dest[0])-ord(pos[0])\r\nd2=ord(dest[1])-ord(pos[1])\r\nif(d1>0):\r\n s1=\"R\"\r\nelse:\r\n s1=\"L\"\r\nif(d2>0):\r\n s2=\"U\"\r\nelse:\r\n s2=\"D\"\r\nd1=abs(d1)\r\nd2=abs(d2)\r\nm=max(d1,d2)\r\ni1=0\r\ni2=0\r\nprint(m)\r\nfor i in range (m):\r\n s=\"\"\r\n if(i1<d1):\r\n s+=s1\r\n i1+=1\r\n if(i2<d2):\r\n s+=s2\r\n i2+=1\r\n print(s)\r\n", "pos_1 = input()\npos_2 = input()\nx,y = ord(pos_1[0])-97,int(pos_1[1])\nx1,y1 = ord(pos_2[0])-97,int(pos_2[1])\nn = 0\nway = []\nwhile x != x1 or y != y1:\n if abs(x-x1)>=1 and abs(y-y1)>=1:\n if x<x1 and y<y1:\n way.append('RU')\n x += 1\n y += 1\n elif x<x1 and y>y1:\n way.append('RD')\n x += 1\n y -= 1 \n elif x>x1 and y<y1:\n way.append('LU')\n x -= 1\n y += 1 \n else:\n way.append('LD')\n x -= 1\n y -= 1 \n else:\n if x<x1:\n way.append('R')\n x += 1\n elif x>x1:\n way.append('L')\n x -= 1\n elif y<y1:\n way.append('U')\n y += 1\n else:\n way.append('D')\n y-=1\n n += 1\nprint(n)\nprint('\\n'.join(way))", "from itertools import accumulate\r\nfrom collections import deque\r\n\r\n\r\ndef I(): return int(input())\r\ndef ST(): return input()\r\ndef IL(): return list(map(int, input().split()))\r\ndef ILS(): return sorted(map(int, input().split()))\r\n\r\nbeg = ST()\r\nend = ST()\r\ndef inbound(r,c):\r\n return 0<=r<8 and 0<=c<8\r\n\r\nbc,br = ord(beg[0])-97,8-int(beg[1])\r\ntc,tr = ord(end[0])-97,8-int(end[1])\r\n\r\nboard = [[-1]*8 for _ in range(8)]\r\ndirections = [(1,0),(0,1),(-1,0),(0,-1),(-1,-1),(1,1),(1,-1),(-1,1)]\r\nboard[br][bc] = 0\r\npath = 1\r\nqueue = [(br,bc)]\r\n\r\nwhile queue:\r\n temp = []\r\n f = False\r\n for r,c in queue:\r\n for x,y in directions:\r\n x,y = x+r,y+c\r\n if inbound(x,y) and board[x][y] == -1:\r\n board[x][y] = path\r\n if (x,y) == (tr,tc):\r\n f = True\r\n break\r\n temp.append((x,y))\r\n if f:\r\n break\r\n if f:\r\n break\r\n path += 1\r\n queue = temp\r\n \r\n#L, R, U, D, LU, LD, RU or RD.\r\ndir = {(1,0):\"U\",(0,1):\"L\",(-1,0):\"D\",(0,-1):\"R\",\r\n (-1,-1):\"RD\",(1,1):\"LU\",(1,-1):\"RU\",(-1,1):\"LD\"}\r\nprint(board[tr][tc])\r\nnum = board[tr][tc]\r\nans = []\r\n\r\nwhile num:\r\n num -= 1\r\n for x,y in directions:\r\n x,y = x+tr,y+tc\r\n if inbound(x,y) and num == board[x][y]:\r\n ans.append(dir[(x-tr,y-tc)])\r\n tr,tc = x,y\r\n break\r\n \r\nfor path in reversed(ans):\r\n print(path)\r\n \r\n \r\n\r\n\r\n \r\n ", "a = input()\r\nb = input()\r\na2 = int(a[1])\r\nb2 = int(b[1])\r\nif \"a\" == a[0]:\r\n a1 = 1\r\nif \"b\" == a[0]:\r\n a1 = 2\r\nif \"c\" == a[0]:\r\n a1 = 3\r\nif \"d\" == a[0]:\r\n a1 = 4\r\nif \"e\" == a[0]:\r\n a1 = 5\r\nif \"f\" == a[0]:\r\n a1 = 6\r\nif \"g\" == a[0]:\r\n a1 = 7\r\nif \"h\" == a[0]:\r\n a1 = 8\r\n\r\nif \"a\" == b[0]:\r\n b1 = 1\r\nif \"b\" == b[0]:\r\n b1 = 2\r\nif \"c\" == b[0]:\r\n b1 = 3\r\nif \"d\" == b[0]:\r\n b1 = 4\r\nif \"e\" == b[0]:\r\n b1 = 5\r\nif \"f\" == b[0]:\r\n b1 = 6\r\nif \"g\" == b[0]:\r\n b1 = 7\r\nif \"h\" == b[0]:\r\n b1 = 8\r\nprint(min(abs(a1 - b1), abs(a2 - b2)) + max(abs(a1 - b1), abs(a2 - b2)) - min(abs(a1 - b1), abs(a2 - b2)))\r\nt = min(abs(a1 - b1), abs(a2 - b2)) + max(abs(a1 - b1), abs(a2 - b2)) - min(abs(a1 - b1), abs(a2 - b2))\r\nfor i in range(t):\r\n if a1 < b1 and a2 > b2:\r\n a1 += 1\r\n a2 -= 1\r\n print(\"RD\")\r\n elif a1 < b1 and a2 < b2:\r\n a1 += 1\r\n a2 += 1\r\n print(\"RU\")\r\n elif a1 > b1 and a2 > b2:\r\n a1 -= 1\r\n a2 -= 1\r\n print(\"LD\")\r\n elif a1 > b1 and a2 < b2:\r\n a1 -= 1\r\n a2 += 1\r\n print(\"LU\")\r\n elif a2 > b2:\r\n a2 -= 1\r\n print(\"D\")\r\n elif a2 < b2:\r\n a2 += 1\r\n print(\"U\")\r\n elif a1 > b1:\r\n a1 -= 1\r\n print(\"L\")\r\n elif a1 < b1:\r\n a1 += 1\r\n print(\"R\")\r\n", "s = list(input().upper())\r\nt = list(input().upper())\r\ns = [(ord(s[0])- 64), int(s[1])]\r\nt = [(ord(t[0])- 64), int(t[1])]\r\nx,y = (t[0]-s[0], t[1]-s[1])\r\nprint(max(abs(x),abs(y)))\r\nif x > 0:\r\n if y > 0:\r\n if x>y:\r\n for i in range(x-y):\r\n print(\"R\")\r\n for j in range(y):\r\n print(\"RU\")\r\n elif x==y:\r\n for j in range(y):\r\n print(\"RU\")\r\n else:\r\n for i in range(y-x):\r\n print(\"U\")\r\n for j in range(x):\r\n print(\"RU\")\r\n elif y < 0:\r\n y = abs(y)\r\n if x>y:\r\n for i in range(x-y):\r\n print(\"R\")\r\n for j in range(y):\r\n print(\"RD\")\r\n elif x==y:\r\n for j in range(y):\r\n print(\"RD\")\r\n else:\r\n for i in range(y-x):\r\n print(\"D\")\r\n for j in range(x):\r\n print(\"RD\")\r\n else:\r\n for i in range(x):\r\n print(\"R\")\r\nelif x < 0:\r\n x=abs(x)\r\n if y > 0:\r\n if x>y:\r\n for i in range(x-y):\r\n print(\"L\")\r\n for j in range(y):\r\n print(\"LU\")\r\n elif x==y:\r\n for j in range(y):\r\n print(\"LU\")\r\n else:\r\n for i in range(y-x):\r\n print(\"U\")\r\n for j in range(x):\r\n print(\"LU\")\r\n elif y < 0:\r\n y = abs(y)\r\n if x>y:\r\n for i in range(x-y):\r\n print(\"L\")\r\n for j in range(y):\r\n print(\"LD\")\r\n elif x==y:\r\n for j in range(y):\r\n print(\"LD\")\r\n else:\r\n for i in range(y-x):\r\n print(\"D\")\r\n for j in range(x):\r\n print(\"LD\")\r\n else:\r\n for i in range(x):\r\n print(\"L\")\r\nelse:\r\n if y == abs(y):\r\n for j in range(y):\r\n print(\"U\")\r\n else:\r\n for j in range(abs(y)):\r\n print(\"D\")", "s=input()\r\nr=input()\r\na=list(s)\r\nb=list(r)\r\na[0]=ord(a[0])\r\nb[0]=ord(b[0])\r\na[1]=int(a[1])\r\nb[1]=int(b[1])\r\nif(a[0]<b[0]):\r\n if(a[1]<b[1]):\r\n print(max(b[0]-a[0],b[1]-a[1]))\r\n while b[0]-a[0] and b[1]-a[1]:\r\n print(\"RU\")\r\n a[0]+=1\r\n a[1]+=1\r\n if(b[0]-a[0]):\r\n for i in range(b[0]-a[0]):\r\n print(\"R\")\r\n else:\r\n for i in range(b[1]-a[1]):\r\n print(\"U\")\r\n else:\r\n print(max(b[0]-a[0],a[1]-b[1]))\r\n while b[0]-a[0] and a[1]-b[1]:\r\n print(\"RD\")\r\n a[0]+=1\r\n a[1]-=1\r\n if(b[0]-a[0]):\r\n for i in range(b[0]-a[0]):\r\n print(\"R\")\r\n else:\r\n for i in range(a[1]-b[1]):\r\n print(\"D\")\r\nelse:\r\n if(a[1]<b[1]):\r\n print(max(a[0]-b[0],b[1]-a[1]))\r\n while a[0]-b[0] and b[1]-a[1]:\r\n print(\"LU\")\r\n a[0]-=1\r\n a[1]+=1\r\n if(a[0]-b[0]):\r\n for i in range(a[0]-b[0]):\r\n print(\"L\")\r\n else:\r\n for i in range(b[1]-a[1]):\r\n print(\"U\")\r\n else:\r\n print(max(a[0]-b[0],a[1]-b[1]))\r\n while a[0]-b[0] and a[1]-b[1]:\r\n print(\"LD\")\r\n a[0]-=1\r\n a[1]-=1\r\n if(a[0]-b[0]):\r\n for i in range(a[0]-b[0]):\r\n print(\"L\")\r\n else:\r\n for i in range(a[1]-b[1]):\r\n print(\"D\")", "\r\n#k=int(input())\r\n#n,m=map(int,input().split())\r\n\r\n#a=list(map(int,input().split()))\r\n\r\n#b=list(map(int,input().split()))\r\n\r\ndef check(x,y):\r\n return (x>=1 and x<=8 and y>=1 and y<=8)\r\n\r\n\r\ns=input()\r\nt=input()\r\n\r\nx1=ord(s[0])-ord('a')+1\r\nx2=ord(t[0])-ord('a')+1\r\n\r\ny1=int(s[1])\r\ny2=int(t[1])\r\n\r\nd=dict()\r\n\r\na=['L','R','U','D','LU','LD','RU','RD']\r\nx=[-1,1,0,0,-1,-1,1,1]\r\ny=[0,0,1,-1,1,-1,1,-1]\r\n\r\n\r\nprint(max(abs(x1-x2),abs(y1-y2)))\r\n\r\n\r\nwhile(x1!=x2 or y1!=y2):\r\n m=9000\r\n for j in range(8):\r\n x3=x1+x[j]\r\n y3=y1+y[j]\r\n if(check(x3,y3) and abs(x3-x2)+abs(y3-y2)<m):\r\n m=abs(x3-x2)+abs(y3-y2)\r\n jmin=j\r\n\r\n x1=x1+x[jmin]\r\n y1=y1+y[jmin]\r\n\r\n print(a[jmin])\r\n", "from queue import Queue\r\n\r\noffset = (# l c\r\n ( \"L\", 0, -1),\r\n ( \"R\", 0, 1),\r\n ( \"U\", 1, 0),\r\n ( \"D\", -1, 0),\r\n\r\n (\"LU\", 1, -1),\r\n (\"LD\", -1, -1),\r\n (\"RU\", 1, 1),\r\n (\"RD\", -1, 1)\r\n)\r\n\r\n\r\ndef possible(i, j):\r\n return 0 <= i < 8 and 0 <= j < 8\r\n\r\n\r\ndef bfs(s, t):\r\n\r\n queue = Queue()\r\n s = (int(s[1]) - 1, ord(s[0]) - 97, [])\r\n ti, tj = (int(t[1]) - 1, ord(t[0]) - 97)\r\n queue.put(s)\r\n\r\n visited = [[False] * 8 for _ in range(8)]\r\n\r\n while True:\r\n i, j, path = queue.get()\r\n if i == ti and j == tj: return len(path), path\r\n visited[i][j] = True\r\n\r\n for direction, di, dj in offset:\r\n newi = i + di\r\n newj = j + dj\r\n if possible(newi, newj) and not visited[newi][newj]:\r\n queue.put((newi, newj, path + [direction]))\r\n\r\n\r\n\r\ndef main():\r\n s = input()\r\n t = input()\r\n\r\n n, path = bfs(s, t)\r\n print(n)\r\n print(*path, sep=\"\\n\")\r\n\r\n\r\nif __name__ == '__main__':\r\n main()", "s = input()\r\nc1 = \".abcdefgh\".index(s[0])\r\nr1 = int(s[1])\r\ns = input()\r\nc2 = \".abcdefgh\".index(s[0])\r\nr2 = int(s[1])\r\n\r\ncmds = []\r\n\r\nkcc = abs(c1 - c2)\r\nkcr = abs(r1 - r2)\r\n\r\nwhile kcc or kcr:\r\n cmd = \"\"\r\n \r\n if c1 < c2:\r\n kcc -= 1\r\n c1 += 1\r\n cmd += 'R'\r\n elif c1 > c2:\r\n kcc -= 1\r\n c1 -= 1\r\n cmd += 'L'\r\n\r\n if r1 < r2:\r\n kcr -= 1\r\n r1 += 1\r\n cmd += 'U'\r\n elif r1 > r2:\r\n kcr -= 1\r\n r1 -= 1\r\n cmd += 'D'\r\n \r\n cmds.append(cmd)\r\n\r\n\r\nprint(len(cmds), *cmds, sep=\"\\n\")\r\n\r\n##########################################\r\n## ##\r\n## Implemented by brownfox2k6 ##\r\n## ##\r\n##########################################", "start, stop = input(), input()\r\nsteps = []\r\nxs, ys = 8-int(stop[1]), ord(stop[0]) - ord('a')\r\nxs1, ys1 = 8-int(start[1]), ord(start[0]) - ord('a')\r\ncounter = 0\r\nwhile xs1 != xs and ys1 != ys:\r\n counter += 1\r\n if ys1 > ys and xs1 < xs:\r\n steps.append('LD')\r\n ys1 -= 1\r\n xs1 += 1\r\n elif ys1 < ys and xs1 < xs:\r\n steps.append('RD')\r\n ys1 += 1\r\n xs1 += 1\r\n elif ys1 < ys and xs1 > xs:\r\n steps.append('RU')\r\n xs1 -= 1\r\n ys1 += 1\r\n else:\r\n steps.append('LU')\r\n ys1 -= 1\r\n xs1 -= 1\r\nstep = ''\r\nc = 0\r\nif ys1 > ys and xs1 == xs:\r\n step = 'L'\r\n c = abs(ys1-ys)\r\nelif ys1 < ys and xs1 == xs:\r\n step = 'R'\r\n c = abs(ys1 - ys)\r\nelif ys1 == ys and xs1 > xs:\r\n step = 'U'\r\n c = abs(xs1 - xs)\r\nelse:\r\n step = 'D'\r\n c = abs(xs1 - xs)\r\nfor k in range(c):\r\n steps.append(step)\r\n counter += 1\r\nprint(counter, '\\n'.join(steps), sep='\\n')", "s = input()\r\nt = input()\r\n\r\nimport math\r\nb = ord(t[0]) - ord(s[0])\r\nb_mod = math.fabs(b)\r\nc = int(t[1]) - int(s[1])\r\nc = int(c)\r\nc_mod = math.fabs(c)\r\notvet = max(b_mod,c_mod)\r\nprint(int(otvet))\r\n\r\nwhile b_mod != c_mod:\r\n if c_mod < b_mod:\r\n if b > 0:\r\n b_mod = b_mod - 1\r\n print('R')\r\n else: \r\n b_mod = b_mod - 1\r\n print('L')\r\n \r\n else:\r\n if c > 0:\r\n c_mod = c_mod - 1\r\n print('U')\r\n else:\r\n c_mod = c_mod - 1\r\n print('D')\r\n\r\nwhile c_mod > 0 and b_mod > 0:\r\n if c > 0 and b >0:\r\n c_mod = c_mod - 1\r\n b_mod = b_mod - 1\r\n print('RU')\r\n elif c > 0 and b < 0:\r\n c_mod = c_mod - 1\r\n b_mod = b_mod - 1\r\n print('LU')\r\n elif c < 0 and b < 0:\r\n c_mod = c_mod - 1\r\n b_mod = b_mod - 1\r\n print('LD')\r\n else:\r\n c_mod = c_mod - 1\r\n b_mod = b_mod - 1\r\n print('RD')", "s = input()\r\nt = input()\r\n\r\ndef col_pos(string):\r\n if string[0] == \"a\" :\r\n return 1\r\n if string[0] == \"b\" :\r\n return 2\r\n if string[0] == \"c\" :\r\n return 3\r\n if string[0] == \"d\" :\r\n return 4\r\n if string[0] == \"e\" :\r\n return 5\r\n if string[0] == \"f\" :\r\n return 6\r\n if string[0] == \"g\" :\r\n return 7\r\n if string[0] == \"h\" :\r\n return 8\r\n\r\nrow_pos1 = int(s[1])\r\nrow_pos2 = int(t[1])\r\n\r\ncol_pos1 = col_pos(s)\r\ncol_pos2 = col_pos(t)\r\n\r\n\r\n\r\nif col_pos1 == col_pos2 :\r\n if row_pos1 < row_pos2 :\r\n num_move = row_pos2 - row_pos1\r\n print(num_move)\r\n for i in range(num_move) :\r\n print(\"U\")\r\n if row_pos1 > row_pos2 :\r\n num_move = row_pos1- row_pos2\r\n print(num_move)\r\n for i in range(num_move) :\r\n print(\"D\")\r\n if row_pos1 == row_pos2 :\r\n print(0)\r\n\r\n\r\nif col_pos1 < col_pos2 :\r\n if row_pos1 == row_pos2 :\r\n num_move = col_pos2 - col_pos1\r\n print(num_move)\r\n for i in range(col_pos2 - col_pos1):\r\n print(\"R\")\r\n if row_pos1 < row_pos2 :\r\n if (col_pos2 - col_pos1) == (row_pos2-row_pos1) :\r\n num_move = row_pos2 - row_pos1\r\n print(num_move)\r\n for i in range(row_pos2 - row_pos1):\r\n print(\"RU\")\r\n\r\n if (col_pos2 - col_pos1) > (row_pos2-row_pos1) :\r\n num_move = row_pos2 - row_pos1 + col_pos2 - col_pos1 -(row_pos2-row_pos1)\r\n print(num_move)\r\n for i in range(row_pos2 - row_pos1):\r\n print(\"RU\")\r\n for i in range(col_pos2 - col_pos1 - (row_pos2 - row_pos1)):\r\n print(\"R\")\r\n\r\n if (col_pos2 - col_pos1) < (row_pos2-row_pos1) :\r\n num_move = col_pos2 - col_pos1 + (row_pos2 - row_pos1) - (col_pos2 - col_pos1)\r\n print(num_move)\r\n for i in range(col_pos2 - col_pos1):\r\n print(\"RU\")\r\n for i in range((row_pos2 - row_pos1) - (col_pos2 - col_pos1)):\r\n print(\"U\")\r\n\r\n if row_pos1 > row_pos2 :\r\n if (col_pos2 - col_pos1) == (row_pos1-row_pos2) :\r\n num_move = row_pos1 - row_pos2\r\n print(num_move)\r\n for i in range(row_pos1 - row_pos2):\r\n print(\"RD\")\r\n\r\n if (col_pos2 - col_pos1) > (row_pos1-row_pos2) :\r\n num_move = row_pos1 - row_pos2 + col_pos2 - col_pos1 -(row_pos1-row_pos2)\r\n print(num_move)\r\n for i in range(row_pos1 - row_pos2):\r\n print(\"RD\")\r\n for i in range(col_pos2 - col_pos1 - (row_pos1 - row_pos2)):\r\n print(\"R\")\r\n\r\n if (col_pos2 - col_pos1) < (row_pos1-row_pos2) :\r\n num_move = col_pos2 - col_pos1 + (row_pos1 - row_pos2) - (col_pos2 - col_pos1)\r\n print(num_move)\r\n for i in range(col_pos2 - col_pos1):\r\n print(\"RD\")\r\n for i in range((row_pos1 - row_pos2) - (col_pos2 - col_pos1)):\r\n print(\"D\")\r\n\r\nif col_pos1 > col_pos2 :\r\n if row_pos1 == row_pos2 :\r\n num_move = col_pos1 - col_pos2\r\n print(num_move)\r\n for i in range(col_pos1 - col_pos2):\r\n print(\"L\")\r\n if row_pos1 < row_pos2 :\r\n if (col_pos1 - col_pos2) == (row_pos2-row_pos1) :\r\n num_move = row_pos2 - row_pos1\r\n print(num_move)\r\n for i in range(row_pos2 - row_pos1):\r\n print(\"LU\")\r\n\r\n if (col_pos1 - col_pos2) > (row_pos2-row_pos1) :\r\n num_move = row_pos2 - row_pos1 + col_pos1 - col_pos2 -(row_pos2-row_pos1)\r\n print(num_move)\r\n for i in range(row_pos2 - row_pos1):\r\n print(\"LU\")\r\n for i in range(col_pos1 - col_pos2 - (row_pos2 - row_pos1)):\r\n print(\"L\")\r\n\r\n if (col_pos1 - col_pos2) < (row_pos2-row_pos1) :\r\n num_move = col_pos1 - col_pos2 + (row_pos2 - row_pos1) - (col_pos1 - col_pos2)\r\n print(num_move)\r\n for i in range(col_pos1 - col_pos2):\r\n print(\"LU\")\r\n for i in range((row_pos2 - row_pos1) - (col_pos1 - col_pos2)):\r\n print(\"U\")\r\n\r\n if row_pos1 > row_pos2 :\r\n if (col_pos1 - col_pos2) == (row_pos1-row_pos2) :\r\n num_move = row_pos1 - row_pos2\r\n print(num_move)\r\n for i in range(row_pos1 - row_pos2):\r\n print(\"LD\")\r\n\r\n if (col_pos1 - col_pos2) > (row_pos1-row_pos2) :\r\n num_move = row_pos1 - row_pos2 + col_pos1 - col_pos2 -(row_pos1-row_pos2)\r\n print(num_move)\r\n for i in range(row_pos1 - row_pos2):\r\n print(\"LD\")\r\n for i in range(col_pos1 - col_pos2 - (row_pos1 - row_pos2)):\r\n print(\"L\")\r\n\r\n if (col_pos1 - col_pos2) < (row_pos1-row_pos2) :\r\n num_move = col_pos1 - col_pos2 + (row_pos1 - row_pos2) - (col_pos1 - col_pos2)\r\n print(num_move)\r\n for i in range(col_pos1 - col_pos2):\r\n print(\"LD\")\r\n for i in range((row_pos1 - row_pos2) - (col_pos1 - col_pos2)):\r\n print(\"D\")", "x1, y1 = input()\nx2, y2 = input()\n\ndct = {\n 'a':1,\n 'b':2,\n 'c':3,\n 'd':4,\n 'e':5,\n 'f':6,\n 'g':7,\n 'h':8\n}\n\nx1 = dct[x1]\nx2 = dct[x2]\ny1 = int(y1)\ny2 = int(y2)\n\ndirections = ['U', 'D', 'L', 'R', 'UL', 'UP', 'DL', 'DR']\ndir_x = ['U', 'D']\ndir_y = ['L', 'R']\n\ndiff = [x2 - x1, y2 - y1, abs(x2 - x1), abs(y2 - y1)]\nif diff[0] < 0:\n move_x = 'L'\nelse:\n move_x = 'R'\n\nif diff[1] < 0:\n move_y = 'D'\nelse:\n move_y = 'U'\n\n\nif diff[2] == diff[3]:\n print(diff[2])\n for _ in range(diff[2]):\n print(move_x + move_y)\nelse:\n ma = max(diff[2], diff[3])\n mi = min(diff[2], diff[3])\n print(ma)\n for _ in range(mi):\n print(move_x + move_y)\n for _ in range(ma - mi):\n if diff[2] < diff[3]:\n print(move_y)\n else:\n print(move_x)", "s = input()\r\nt = input()\r\nd1 = ord(s[0]) - ord(t[0])\r\nd2 = ord(s[1]) - ord(t[1])\r\nif d1 < 0:\r\n d3 = -d1\r\nelse:\r\n d3 = d1\r\nif d2 < 0:\r\n d4 = -d2\r\nelse:\r\n d4 = d2\r\nif d3 > d4:\r\n print(d3)\r\n r = d3\r\nelse:\r\n print(d4)\r\n r = d4\r\nfor i in range(r):\r\n if i < d3:\r\n if d1 < 0:\r\n print(\"R\", end = '')\r\n elif d1 > 0:\r\n print(\"L\", end = '')\r\n if i < d4:\r\n if d2 < 0:\r\n print(\"U\")\r\n elif d2 > 0:\r\n print(\"D\")\r\n else:\r\n print(\"\")", "s = input()\r\nt = input()\r\nrow = 'abcdefgh'\r\n\r\ns_col,s_row = row.index(s[0]),int(s[1]) \r\nt_col,t_row = row.index(t[0]),int(t[1])\r\nmoves = []\r\nwhile (s_row,s_col) != (t_row,t_col):\r\n dir_col = \"\"\r\n if s_col<t_col: \r\n dir_col = 'R'\r\n s_col += 1\r\n if s_col>t_col: \r\n dir_col = 'L'\r\n s_col -= 1\r\n dir_row = \"\"\r\n if s_row<t_row: \r\n dir_row = 'U'\r\n s_row += 1\r\n if s_row>t_row: \r\n dir_row = 'D'\r\n s_row -= 1\r\n moves.append(dir_col + dir_row)\r\nprint (len(moves))\r\nprint ('\\n'.join(moves))\r\n\r\n ", "o=input()\r\no=[o[0],int(o[1])]\r\np=input()\r\np=[p[0],int(p[1])]\r\nl=[\"a\",\"b\",\"c\",\"d\",\"e\",\"f\",\"g\",\"h\"]\r\na2=[]\r\nk=0\r\nfor i in range(7):\r\n a=abs(l.index(o[0])-l.index(p[0]))\r\n b=abs(o[1]-p[1])\r\n if a>0 or b>0:\r\n m1=m2=\"\"\r\n if l.index(o[0])>l.index(p[0]):\r\n m1=\"L\"\r\n if o[1]<p[1]:\r\n m2=\"U\"\r\n o[1]+=1\r\n elif o[1]>p[1]:\r\n m2=\"D\"\r\n o[1]-=1\r\n o[0]=l[l.index(o[0])-1]\r\n a2.append(m1 + m2)\r\n k+=1\r\n elif l.index(o[0])<l.index(p[0]):\r\n m1=\"R\"\r\n if o[1]<p[1]:\r\n m2=\"U\"\r\n o[1]+=1\r\n elif o[1]>p[1]:\r\n m2=\"D\"\r\n o[1]-=1\r\n a2.append(m1+m2)\r\n o[0] = l[l.index(o[0])+1]\r\n k+=1\r\n elif l.index(o[0])==l.index(p[0]):\r\n if o[1]<p[1]:\r\n m2=\"U\"\r\n o[1]+=1\r\n elif o[1]>p[1]:\r\n m2=\"D\"\r\n o[1]-=1\r\n a2.append(m1+m2)\r\n k+=1\r\nprint(k)\r\nfor g in a2:\r\n print(g)\r\n\r\n", "def parse_loc(pos):\n key = 'abcdefgh'\n column = key.index(pos[0])\n return [column, int(pos[1])]\n\n\ns = input()\nt = input()\ns, t = parse_loc(s), parse_loc(t)\n\nmoves = []\ncount = min(abs(s[0]-t[0]), abs(s[1] - t[1]))\nif s[0] > t[0]:\n if s[1] > t[1]:\n moves += ['LD'] * count\n s = [s[0] - count, s[1] - count]\n if s[1] < t[1]:\n moves += ['LU'] * count\n s = [s[0] - count, s[1] + count]\n\nelif s[0] < t[0]:\n if s[1] > t[1]:\n moves += ['RD'] * count\n s = [s[0] + count, s[1] - count]\n if s[1] < t[1]:\n moves += ['RU'] * count\n s = [s[0] + count, s[1] + count]\n\nif s[0] == t[0]:\n if s[1] > t[1]:\n moves += ['D'] * (s[1] - t[1])\n if s[1] < t[1]:\n moves += ['U'] * (t[1] - s[1])\n\nelse:\n if s[0] > t[0]:\n moves += ['L'] * (s[0] - t[0])\n if s[0] < t[0]:\n moves += ['R'] * (t[0] - s[0])\n\nprint(len(moves))\nprint('\\n'.join(moves))\n", "s = input()\r\nt = input()\r\n\r\ns1 = s[0]\r\ns2 = s[1]\r\n\r\nt1 = t[0]\r\nt2 = t[1]\r\n\r\nhorizontalDistance = abs(ord(s1) - ord(t1))\r\nverticalDistance = abs(int(s2) - int(t2))\r\nminSteps = verticalDistance if verticalDistance > horizontalDistance else horizontalDistance\r\n\r\nhdCounter = 0\r\nvdCounter = 0\r\nhd = ord(s1) - ord(t1)\r\nvd = int(s2) - int(t2)\r\n\r\nprint(minSteps)\r\n\r\nfor i in range(minSteps):\r\n step = \"\"\r\n\r\n if hd > 0 and hd > hdCounter:\r\n step += \"L\";\r\n hdCounter += 1;\r\n elif hd < 0 and abs(hd) > hdCounter:\r\n step += \"R\";\r\n hdCounter += 1;\r\n\r\n if vd > 0 and vd > vdCounter:\r\n step += \"D\";\r\n vdCounter += 1;\r\n elif vd < 0 and abs(vd) > vdCounter:\r\n step += \"U\";\r\n vdCounter += 1;\r\n\r\n print(step)\r\n", "s = input()\r\nt = input()\r\n\r\nlevel = ord(t[0]) - ord(s[0])\r\nvertical = int(t[1]) - int(s[1])\r\n\r\nsteps = max(abs(vertical), abs(level))\r\nprint(steps)\r\n\r\nwhile level or vertical:\r\n step = \"\"\r\n if level > 0:\r\n level -= 1\r\n step += \"R\"\r\n if level < 0:\r\n level += 1\r\n step += \"L\"\r\n if vertical > 0:\r\n vertical -= 1\r\n step += \"U\"\r\n if vertical < 0:\r\n vertical += 1\r\n step += \"D\"\r\n print(step)\r\n", "class Queue: # initializing the queue\r\n def __init__(self):\r\n self.head = []\r\n self.tail = []\r\n\r\n def __len__(self):\r\n return len(self.head + self.tail)\r\n\r\n def queue(self, item):\r\n self.tail.append(item)\r\n\r\n def dequeue(self):\r\n if not self.head:\r\n self.head = self.tail[::-1]\r\n self.tail = []\r\n return self.head.pop()\r\n else:\r\n return self.head.pop()\r\n\r\n\r\nmoves = {(-1, 0): 'L', (1, 0): 'R', (0, 1): 'U', (0, -1): 'D', (-1, 1): 'LU', (-1, -1): 'LD', (1, 1): 'RU',(1, -1): 'RD'}\r\n\r\n\r\ndef move(path):\r\n for i in range(len(path) - 1):\r\n move = (path[i+1][0] - path[i][0], path[i+1][1] - path[i][1])\r\n print(moves[move])\r\n\r\n\r\ndef backtrack(destination, seen, start): # counts backwards when the destination node is found\r\n node = destination\r\n path = [destination]\r\n while node != start:\r\n node = seen[node]\r\n path.append(node)\r\n print(len(path) - 1)\r\n move(path[::-1])\r\n\r\n\r\n\r\ndef breadth_first_search(graph, start, destination): # A shortest path algorithm utilizing a bfs\r\n queue = Queue()\r\n queue.queue(start)\r\n seen = {start: None}\r\n while queue:\r\n current_node = queue.dequeue()\r\n for neighbour in graph[current_node]:\r\n if neighbour not in seen:\r\n queue.queue(neighbour)\r\n seen[neighbour] = current_node\r\n if current_node == destination:\r\n return backtrack(destination, seen, start)\r\n\r\n\r\ndef adjacent(i, j): # creating an adjacent function to speed up the initialization of the chess board graph\r\n list = [-1, 0, 1]\r\n adjacent = []\r\n for a in list:\r\n for b in list:\r\n if (a,b) != (0,0) and 1 <= i + a <= 8 and 1 <= j + b <= 8:\r\n adjacent.append((i + a, j + b))\r\n return adjacent\r\n\r\n\r\ngraph = {} # initializing the chess board graph\r\nfor i in range(1, 9):\r\n for j in range(1, 9):\r\n graph[(i, j)] = adjacent(i, j)\r\n\r\nletters = ['a', 'b', 'c', 'd', 'e', 'f', 'g', 'h']\r\nnumber_to_letter = { letters[i]: i + 1 for i in range(8)}\r\n\r\n\r\ninput_start = input()\r\ninput_destination = input()\r\nstart = (number_to_letter[input_start[0]], int(input_start[1]))\r\ndestination = (number_to_letter[input_destination[0]], int(input_destination[1]))\r\n\r\n\r\nbreadth_first_search(graph, start, destination)\r\n\r\ntest_path = [(1, 4), (1, 5), (2, 6), (3, 7), (4, 8)]\r\n", "# Description of the problem can be found at http://codeforces.com/problemset/problem/3/A\n\np1 = list(input())\np2 = list(input())\n\nl_m = list()\n\nwhile p1[0] != p2[0] or p1[1] != p2[1]:\n s = \"\"\n \n if p1[0] < p2[0]:\n s = \"R\"\n p1[0] = chr(ord(p1[0]) + 1)\n elif p1[0] > p2[0]:\n s = \"L\"\n p1[0] = chr(ord(p1[0]) - 1)\n \n if p1[1] < p2[1]:\n s = s + \"U\"\n p1[1] = str(int(p1[1]) + 1)\n elif p1[1] > p2[1]:\n s = s + \"D\"\n p1[1] = str(int(p1[1]) - 1)\n \n l_m.append(s)\n\nprint(len(l_m))\nprint(\"\\n\".join(l_m))", "y_cor = { 'a': 1, 'b': 2, 'c': 3, 'd': 4,'e':5, 'f':6, 'g':7, 'h': 8 ,}\r\na = input(); b = input()\r\nx1 = y_cor[a[0]]; y1 = int(a[1])\r\nx2 = y_cor[b[0]]; y2 = int(b[1])\r\ns = \"\"; c = 0\r\nwhile(True):\r\n if([x1,y1]==[x2,y2]):\r\n break\r\n if(x2>x1): x1+=1; s+=(\"R\"); \r\n if(x2<x1): x2+=1; s+=(\"L\"); \r\n if(y2>y1): y1+=1; s+=(\"U\"); \r\n if(y2<y1): y2+=1; s+=(\"D\"); \r\n s+='\\n'; c+=1\r\nprint(c); print(s)", "a1=input()\nb1=input()\n\na,b=[],[]\n\nfor i in a1:\n a.append(i)\nfor i in b1:\n b.append(i)\nbr=int(a[1])\nbr1=int(b[1])\nrj=[]\n\nwhile a[0]!=b[0] or br!=br1:\n if ord(a[0])>ord(b[0]):\n if br>br1:\n rj.append('LD')\n br-=1\n elif br<br1:\n rj.append('LU')\n br+=1\n else:\n rj.append('L')\n x=ord(a[0])-1\n a[0]=chr(x)\n\n elif ord(a[0])<ord(b[0]):\n if br>br1:\n rj.append('RD')\n br-=1\n elif br<br1:\n rj.append('RU')\n br+=1\n else:\n rj.append('R')\n x=ord(a[0])+1\n a[0]=chr(x)\n else:\n if br>br1:\n rj.append('D')\n br-=1\n elif br<br1:\n rj.append('U')\n br+=1\n \nprint(len(rj))\n\nfor i in rj:\n print(i)\n\n\t \t\t \t \t \t \t \t\t\t\t", "\r\n\r\ns=input()\r\nt=input()\r\n\r\ns1,s2=ord(s[0]),int(s[1])\r\nt1,t2=ord(t[0]),int(t[1])\r\n\r\nnum1=t1-s1\r\nnum2=t2-s2\r\nnum=max(abs(num1),abs(num2))\r\n\r\nprint(num)\r\n\r\n\r\nfor i in range(num):\r\n scr=''\r\n if(num1>0):\r\n scr+=\"R\" \r\n num1-=1\r\n else:\r\n if(num1<0):\r\n scr+=\"L\"\r\n num1+=1\r\n if(num2>0):\r\n scr+=\"U\" \r\n num2-=1\r\n else:\r\n if(num2<0):\r\n scr+=\"D\"\r\n num2+=1 \r\n print(scr)\r\n", "def main():\n x, y = (ord(b) - ord(a) for a, b in zip(input(), input()))\n print(max(abs(x), abs(y)))\n while x or y:\n if x > 0:\n h = 'R'\n x -= 1\n elif x < 0:\n h = 'L'\n x += 1\n else:\n h = ''\n if y > 0:\n v = 'U'\n y -= 1\n elif y < 0:\n v = 'D'\n y += 1\n else:\n v = ''\n print(''.join((h, v)))\n\n\nif __name__ == '__main__':\n main()\n", "\r\n#https://codeforces.com/problemset/problem/266/B\r\nimport sys\r\nimport math\r\nfrom collections import defaultdict\r\nimport heapq\r\ntry: \r\n sys.stdin = open('input.txt', 'r') \r\n sys.stdout = open('output.txt', 'w')\r\n \r\nexcept: \r\n pass\r\n \r\n\r\nclass Graph():\r\n def __init__(self):\r\n self.neighbours=defaultdict(list)\r\n for x in range(1,9):\r\n for y in range(1,9):\r\n for i in range(-1,2):\r\n for j in range(-1,2):\r\n pos_x=x+i\r\n pos_y=y+j\r\n if(self.isValid(pos_x,pos_y)):\r\n self.addEdge([x,y],[pos_x,pos_y])\r\n\r\n def addEdge(self,u,v):\r\n pos1=self.ltos(u)\r\n pos2=self.ltos(v)\r\n self.neighbours[pos1].append(pos2)\r\n self.neighbours[pos2].append(pos1)\r\n\r\n def ltos(self,l):\r\n return str(l[0])+\":\"+str(l[1])\r\n def isValid(self,x,y):\r\n if(x<1 or x>8):\r\n return False\r\n if(y<1 or y>8):\r\n return False\r\n return True\r\n\r\n def stol(self,s):\r\n return [int(s[0]),int(s[2])]\r\n def whatMove(self,move1,move2):\r\n x1,y1=self.stol(move1)\r\n x2,y2=self.stol(move2)\r\n if(x1==x2):\r\n if(y1<y2):\r\n return \"U\"\r\n else:\r\n return \"D\"\r\n elif(y1==y2):\r\n if(x1<x2):\r\n return \"R\"\r\n else:\r\n return \"L\"\r\n elif(x2==x1-1 and y2==y1-1):\r\n return \"LD\"\r\n elif(x2==x1-1 and y2==y1+1):\r\n return \"LU\"\r\n elif(x2==x1+1 and y2==y1-1):\r\n return \"RD\"\r\n elif(x2==x1+1 and y2==y1+1):\r\n return \"RU\"\r\n\r\n\r\n def BFS(self,source,destination):\r\n source=self.ltos(source)\r\n destination=self.ltos(destination)\r\n visited=defaultdict(lambda:False)\r\n distance=defaultdict(lambda:float(\"inf\"))\r\n distance[source]=0\r\n visited[source]=True\r\n queue=[source]\r\n parent=defaultdict(lambda:None)\r\n while queue:\r\n u=queue.pop(0)\r\n if(u==destination):\r\n break\r\n for v in self.neighbours[u]:\r\n if(not visited[v]):\r\n visited[v]=True\r\n parent[v]=u\r\n distance[v]=distance[u]+1\r\n queue.append(v)\r\n print(distance[destination])\r\n ans=[]\r\n start=destination\r\n while parent[start]!=None:\r\n ans.append(self.whatMove(parent[start],start))\r\n start=parent[start]\r\n for a in ans[::-1]:\r\n print(a)\r\n\r\n\r\n\r\ns=input().strip()\r\nd=input().strip()\r\nref={\"a\":1,\"b\":2,\"c\":3,\"d\":4,\"e\":5,\"f\":6,\"g\":7,\"h\":8}\r\nsource=[ref[s[0]],int(s[1])]\r\ndestination=[ref[d[0]],int(d[1])]\r\ng=Graph()\r\ng.BFS(source,destination)\r\n", "I=input\r\nP=print\r\na=I()+I()\r\na,b=(ord(a[i])-ord(a[i+2])for i in(0,1))\r\nP(max(a,-a,b,-b))\r\nwhile a!=0 or b!=0:\r\n r=''\r\n if a<0:r='R';a+=1\r\n if a>0:r='L';a-=1\r\n if b<0:r+='U';b+=1\r\n if b>0:r+='D';b-=1\r\n P(r)\r\n", "o=[]\r\ncount=0\r\nalp=\"abcdefgh\"\r\na=input()\r\na1=alp.find(a[0])+1\r\na2=int(a[1])\r\nb=input()\r\nb1=alp.find(b[0])+1\r\nb2=int(b[1])\r\nwhile a1!=b1 or a2!=b2:\r\n b=\"\"\r\n count+=1\r\n if a1>b1:\r\n a1-=1\r\n b+=\"L\"\r\n elif a1<b1:\r\n a1+=1\r\n b+=\"R\"\r\n if a2>b2:\r\n a2-=1\r\n b+=\"D\"\r\n elif a2<b2:\r\n a2+=1\r\n b+=\"U\"\r\n o.append(b) \r\nprint(count,*o,sep=\"\\n\") \r\n", "s = list(input())\r\nt = list(input())\r\n\r\nmoves = []\r\n\r\nwhile s[0] != t[0] or s[1] != t[1]:\r\n m = \"\"\r\n if s[0] < t[0]:\r\n m = \"R\"\r\n s[0] = chr(ord(s[0]) + 1)\r\n elif s[0] > t[0]:\r\n m = \"L\"\r\n s[0] = chr(ord(s[0]) - 1)\r\n\r\n if s[1] < t[1]:\r\n m += \"U\"\r\n s[1] = str(int(s[1]) + 1)\r\n elif s[1] > t[1]:\r\n m += \"D\"\r\n s[1] = str(int(s[1]) - 1)\r\n moves.append(m)\r\n\r\n\r\nprint(len(moves))\r\nprint('\\n'.join(moves))\r\n\r\n", "current = input()\r\nfinal = input()\r\nli = []\r\nwhile (final != current):\r\n if ord(final[0]) > ord(current[0]):\r\n if int(final[1]) > int(current[1]):\r\n li.append(\"RU\")\r\n current = chr(ord(current[0])+1) + str(int(current[1])+1)\r\n elif int(final[1]) < int(current[1]):\r\n li.append(\"RD\")\r\n current = chr(ord(current[0])+1) + str(int(current[1])-1)\r\n else:\r\n li.append(\"R\")\r\n current = chr(ord(current[0])+1) + str(int(current[1]))\r\n elif(ord(final[0]) < ord(current[0])):\r\n if int(final[1]) > int(current[1]):\r\n li.append(\"LU\")\r\n current = chr(ord(current[0])-1) + str(int(current[1])+1)\r\n elif int(final[1]) < int(current[1]):\r\n li.append(\"LD\")\r\n current = chr(ord(current[0])-1) + str(int(current[1])-1)\r\n else:\r\n li.append(\"L\")\r\n current = chr(ord(current[0])-1) + str(int(current[1]))\r\n else:\r\n if int(final[1]) > int(current[1]):\r\n li.append(\"U\")\r\n current = chr(ord(current[0])) + str(int(current[1])+1)\r\n elif int(final[1]) < int(current[1]):\r\n li.append(\"D\")\r\n current = chr(ord(current[0])) + str(int(current[1])-1)\r\nprint(len(li))\r\nfor i in li:\r\n print(i)", "#Exercise 3A - Stupid King Path\r\n#We need to take 2 lines of input, which we store as a\r\n#single string to work with\r\na=input()+input()\r\n#Then we tell our program to process store the Unicode\r\n#code point behind the letters in the variable b which \r\n#is meant to mimic the chess table and how many\r\n#moves the king needs to make to get from one point to another.\r\n#The input has the following format:\r\n# letter_Number_letter_Number\r\na,b=(ord(a[i])-ord(a[i+2])for i in (0,1))\r\nprint(max(a,-a,b,-b))\r\n#Now, we analyse the directions in which the king\r\n#needs to move when geting from point a to point b\r\nwhile a!=0 or b!=0:\r\n r=''\r\n if a<0:\r\n r='R';a+=1\r\n if a>0:r='L';a-=1\r\n if b<0:r+='U';b+=1\r\n if b>0:r+='D';b-=1\r\n #And we print out the moves he makes\r\n print(r)\r\n\r\n", "a,b=input(),input()\r\nm,n=(ord(a[i])-ord(b[i]) for i in range(0,2))\r\np=max(abs(m),abs(n))\r\nprint(p)\r\nwhile m!=0 or n!=0:\r\n r=''\r\n if m<0:r='R';m+=1\r\n elif m>0:r='L';m-=1\r\n if n<0:r+='U';n+=1\r\n elif n>0:r+='D';n-=1\r\n print(r)", "s,e =input(),input()\r\nx1,y1,x2,y2=s[0],s[1],e[0],e[1]\r\n\r\nif x1<x2:#right\r\n xd=ord(x2)-ord(x1)\r\n if y1<y2:#up\r\n yd=int(y2)-int(y1)\r\n if xd>yd:\r\n print('%d\\n%s'%(xd,'RU\\n'*yd+'R\\n'*(xd-yd)))\r\n else:\r\n print('%d\\n%s'%(yd,'RU\\n'*xd+'U\\n'*(yd-xd)))\r\n else:#down\r\n yd=int(y1)-int(y2)\r\n if xd>yd:\r\n print('%d\\n%s'%(xd,'RD\\n'*yd+'R\\n'*(xd-yd)))\r\n else:\r\n print('%d\\n%s'%(yd,'RD\\n'*xd+'D\\n'*(yd-xd)))\r\nelse:#left\r\n xd=ord(x1)-ord(x2)\r\n if y1<y2:#up\r\n yd=int(y2)-int(y1)\r\n if xd>yd:\r\n print('%d\\n%s'%(xd,'LU\\n'*yd+'L\\n'*(xd-yd)))\r\n else:\r\n print('%d\\n%s'%(yd,'LU\\n'*xd+'U\\n'*(yd-xd)))\r\n else:#down\r\n yd=int(y1)-int(y2)\r\n if xd>yd:\r\n print('%d\\n%s'%(xd,'LD\\n'*yd+'L\\n'*(xd-yd)))\r\n else:\r\n print('%d\\n%s'%(yd,'LD\\n'*xd+'D\\n'*(yd-xd)))", "# 输入起始位置和目标位置\r\nstart = input()\r\ntarget = input()\r\n\r\n# 起始位置和目标位置的列号和行号\r\nstart_col = ord(start[0]) - ord('a') + 1\r\nstart_row = int(start[1])\r\ntarget_col = ord(target[0]) - ord('a') + 1\r\ntarget_row = int(target[1])\r\n\r\n# 计算列号和行号的差值\r\ncol_diff = target_col - start_col\r\nrow_diff = target_row - start_row\r\n\r\n# 计算移动步数\r\nsteps = max(abs(col_diff), abs(row_diff))\r\n\r\n# 打印移动步数\r\nprint(steps)\r\n\r\n# 根据差值的正负情况打印移动步骤\r\nfor _ in range(steps):\r\n move = \"\"\r\n if col_diff > 0:\r\n move += \"R\"\r\n col_diff -= 1\r\n elif col_diff < 0:\r\n move += \"L\"\r\n col_diff += 1\r\n if row_diff > 0:\r\n move += \"U\"\r\n row_diff -= 1\r\n elif row_diff < 0:\r\n move += \"D\"\r\n row_diff += 1\r\n print(move)\r\n", "s = input()\r\nt = input()\r\n\r\nx = ord(s[0]) - ord(t[0])\r\ny = ord(s[1]) - ord(t[1])\r\n\r\ndx, dy = \"\", \"\"\r\nif x > 0:\r\n\tdx = \"L\"\r\nelif x < 0:\r\n\tdx = \"R\"\r\nif y > 0:\r\n\tdy = \"D\"\r\nelif y < 0:\r\n\tdy = \"U\"\r\n\t\r\nx, y = abs(x), abs(y)\r\nprint(max(x, y))\r\nfor i in range(min(x, y)):\r\n\tprint(dx + dy)\r\n\t\r\nif x > y:\r\n\tfor i in range(x - y):\r\n\t\tprint(dx)\r\nelse:\r\n\tfor i in range(y - x):\r\n\t\tprint(dy)# your code goes here", "# Read the coordinates of square s and t\r\ns = input()\r\nt = input()\r\n\r\n# Calculate the horizontal and vertical distances between s and t\r\nhorizontal_dist = ord(t[0]) - ord(s[0])\r\nvertical_dist = int(t[1]) - int(s[1])\r\n\r\n# Calculate the minimum number of moves\r\nnum_moves = max(abs(horizontal_dist), abs(vertical_dist))\r\n\r\n# Print the number of moves\r\nprint(num_moves)\r\n\r\n# Print the moves\r\nfor _ in range(num_moves):\r\n move = \"\"\r\n \r\n # Determine the horizontal move direction\r\n if horizontal_dist > 0:\r\n move += \"R\"\r\n horizontal_dist -= 1\r\n elif horizontal_dist < 0:\r\n move += \"L\"\r\n horizontal_dist += 1\r\n \r\n # Determine the vertical move direction\r\n if vertical_dist > 0:\r\n move += \"U\"\r\n vertical_dist -= 1\r\n elif vertical_dist < 0:\r\n move += \"D\"\r\n vertical_dist += 1\r\n \r\n print(move)\r\n", "s1,s2 = input().strip(),input().strip()\r\nx=ord(s1[0])-ord(s2[0])\r\ny=int(s1[1])-int(s2[1])\r\ncx='R' if x<0 else 'L'\r\ncy='U' if y<0 else 'D'\r\nx,y = map(abs,[x,y])\r\nprint(max(x,y))\r\nwhile [x,y]!=[0,0]:\r\n if x:\r\n x-=1\r\n print(cx,end='')\r\n if y:\r\n y-=1\r\n print(cy,end='')\r\n print()", "start = input()\r\ngoal = input()\r\n\r\nx = ord(goal[0]) - ord(start[0])\r\ny = int(goal[1]) - int(start[1])\r\n\r\nprint(max(abs(x), abs(y)))\r\n\r\nwhile x != 0 or y != 0:\r\n direction = \"\"\r\n if x > 0:\r\n direction = \"R\"\r\n x -= 1\r\n if x < 0:\r\n direction = \"L\"\r\n x += 1\r\n if y > 0:\r\n direction += \"U\"\r\n y -= 1\r\n if y < 0:\r\n direction += \"D\"\r\n y += 1\r\n print(direction)", "\"\"\"\r\nI learned what a greedy algorithm was\r\nAn error I made was forgetting that tuples are unchangeable in python\r\nTo improve I could probably make the code less messy\r\n\"\"\"\r\n\r\nimport math\r\n\r\nraw_start = input()\r\nraw_start = list(raw_start)\r\nstart = [ord(raw_start[0]) - 96, int(raw_start[1])]\r\n\r\nraw_target = input()\r\nraw_target = list(raw_target)\r\ntarget = [ord(raw_target[0]) - 96, int(raw_target[1])]\r\n\r\ndef distance(start, target):\r\n return math.sqrt((start[0] - target[0])**2 + (start[1] - target[1])**2)\r\n\r\nmoves = []\r\n\r\nwhile start != target:\r\n distances = {\"L\" : 0, \"R\" : 0, \"U\" : 0, \"D\" : 0, \"LU\" : 0, \"LD\" : 0, \"RD\" : 0, \"RU\" : 0}\r\n \r\n L = distance((start[0] - 1, start[1]), target)\r\n distances[\"L\"] = L\r\n \r\n R = distance((start[0] + 1, start[1]), target)\r\n distances[\"R\"] = R\r\n \r\n U = distance((start[0], start[1] + 1), target)\r\n distances[\"U\"] = U\r\n \r\n D = distance((start[0], start[1] - 1), target)\r\n distances[\"D\"] = D\r\n \r\n LU = distance((start[0] - 1, start[1] + 1), target)\r\n distances[\"LU\"] = LU\r\n \r\n LD = distance((start[0] - 1, start[1] - 1), target)\r\n distances[\"LD\"] = LD\r\n \r\n RU = distance((start[0] + 1, start[1] + 1), target)\r\n distances[\"RU\"] = RU\r\n \r\n RD = distance((start[0] + 1, start[1] - 1), target)\r\n distances[\"RD\"] = RD\r\n \r\n optimal = \"\"\r\n for key, value in distances.items():\r\n if value == min(distances.values()):\r\n moves.append(key)\r\n optimal = key\r\n break\r\n \r\n if optimal == \"L\":\r\n start[0] -= 1\r\n elif optimal == \"R\":\r\n start[0] += 1\r\n elif optimal == \"U\":\r\n start[1] += 1\r\n elif optimal == \"D\":\r\n start[1] -= 1\r\n elif optimal == \"LU\":\r\n start[0] -= 1\r\n start[1] += 1\r\n elif optimal == \"LD\":\r\n start[0] -= 1\r\n start[1] -= 1\r\n elif optimal == \"RU\":\r\n start[0] += 1\r\n start[1] += 1\r\n elif optimal == \"RD\":\r\n start[0] += 1\r\n start[1] -= 1\r\n\r\nprint(len(moves))\r\nfor m in moves:\r\n print(m + '\\n')", "source = list(input())\ndestination = list(input())\nletters = {\"a\": 1, \"b\": 2, \"c\": 3, \"d\": 4, \"e\": 5, \"f\": 6, \"g\": 7, \"h\": 8}\nsteps = []\n\nhorizontal = letters[destination[0]] - letters[source[0]]\nvertical = int(destination[1]) - int(source[1])\n\nwhile horizontal != 0 or vertical != 0:\n if horizontal < 0:\n if vertical < 0:\n steps.append(\"LD\")\n horizontal += 1\n vertical += 1\n elif vertical > 0:\n steps.append(\"LU\")\n horizontal += 1\n vertical -= 1\n else:\n steps.append(\"L\")\n horizontal += 1\n elif horizontal > 0:\n if vertical < 0:\n steps.append(\"RD\")\n horizontal -= 1\n vertical += 1\n elif vertical > 0:\n steps.append(\"RU\")\n horizontal -= 1\n vertical -= 1\n else:\n steps.append(\"R\")\n horizontal -= 1\n else:\n if vertical < 0:\n steps.append(\"D\")\n vertical += 1\n elif vertical > 0:\n steps.append(\"U\")\n vertical -= 1\n\nprint(len(steps))\nfor i in steps:\n print(i)\n", "a=input()\r\nb=input()\r\nc,d=(ord(a[0])-ord(b[0])),(ord(a[1])-ord(b[1]))\r\nprint(max(c,-c,d,-d))\r\nwhile c!=0 or d!=0:\r\n r=''\r\n if(c>0):\r\n r='L';\r\n c-=1\r\n if(c<0):\r\n r='R';\r\n c+=1\r\n if(d>0):\r\n r+='D';\r\n d-=1\r\n if(d<0):\r\n r+='U';\r\n d+=1\r\n print(r)\r\n", "s = \"1abcdefgh\"\r\ndirs = [1, -1]\r\ndirs1 = [\"U\", \"D\"]\r\ndirs2 = [\"R\", \"L\"]\r\nstart = input()\r\nend = input()\r\nstart = [s.index(start[0]), int(start[1])]\r\nend = [s.index(end[0]), int(end[1])]\r\nx = y = 0\r\nc = 0\r\nif start[0] < end[0]:\r\n x = 0\r\nelse:\r\n x = 1\r\nif start[1] < end[1]:\r\n y = 0\r\nelse:\r\n y = 1\r\n\r\nst = []\r\nwhile start[1] != end[1] and start[0] != end[0]:\r\n start[0] += dirs[x]\r\n start[1] += dirs[y]\r\n st.append(dirs2[x] + dirs1[y])\r\n c += 1\r\nif start[1] == end[1]:\r\n while start[0] != end[0]:\r\n start[0] += dirs[x]\r\n st.append(dirs2[x])\r\n c += 1\r\nelif start[0] == end[0]:\r\n while start[1] != end[1]:\r\n start[1] += dirs[y]\r\n st.append(dirs1[y])\r\n c += 1\r\nprint(c)\r\nfor i in st:\r\n print(i)", "s = input()\r\nt = input()\r\ns1 = ord(s[0])\r\ns2 = int(s[1])\r\nt1 = ord(t[0])\r\nt2 = int(t[1])\r\ndiff1 = t1-s1\r\na1 = abs(diff1)\r\ndiff2 = t2-s2\r\na2 = abs(diff2)\r\nif diff1>0:\r\n str1 = \"R\"\r\nelif diff1<0:\r\n str1 = \"L\"\r\nelse:\r\n str1 = \"\"\r\nif diff2>0:\r\n str2 = \"U\"\r\nelif diff2<0:\r\n str2 = \"D\"\r\nelse:\r\n str2 = \"\"\r\nif a1>=a2:\r\n diff3 = a1-a2\r\n str3 = str1+str2\r\n print(a1)\r\n for x in range(a2):\r\n print(str3)\r\n for y in range(diff3):\r\n print(str1)\r\nelif a1<a2:\r\n diff3 = a2-a1\r\n str3 = str1+str2\r\n print(a2)\r\n for x in range(a1):\r\n print(str3)\r\n for y in range(diff3):\r\n print(str2)", "#! /usr/bin/env python3\n\nimport itertools\nimport sys\n\n\ndef main():\n solve()\n\n\ndef solve():\n data = sys.stdin.readlines()\n start_pos, end_pos = parse(data)\n moves = calc_moves(start_pos, end_pos)\n output = '\\n'.join(moves)\n print(len(moves))\n print(output)\n\n\ndef parse(data):\n start_s = data[0]\n end_s = data[1]\n start_pos = (ord(start_s[0]) - ord('a'), int(start_s[1]))\n end_pos = (ord(end_s[0]) - ord('a'), int(end_s[1]))\n return start_pos, end_pos\n\n\ndef calc_moves(start_pos, end_pos):\n diff_hor = end_pos[0] - start_pos[0]\n diff_vert = end_pos[1] - start_pos[1]\n\n dir_vert = 'U' if diff_vert > 0 else 'D'\n dir_hor = 'R' if diff_hor > 0 else 'L'\n\n diff_hor = abs(diff_hor)\n diff_vert = abs(diff_vert)\n \n moves_hor = (dir_hor for _ in range(diff_hor))\n moves_vert = (dir_vert for _ in range(diff_vert))\n\n return tuple(\n ''.join(m_tuple)\n for m_tuple in itertools.zip_longest(\n moves_hor, moves_vert, fillvalue=''\n )\n )\n\nif __name__ == '__main__':\n main()\n", "start = input()\nend = input()\nstart = (ord(start[0]) - ord('a'), int(start[1]) - 1)\nend = (ord(end[0]) - ord('a'), int(end[1]) - 1)\nnx = end[0] - start[0]\nny = end[1] - start[1]\nprint(max(abs(nx), abs(ny)))\nwhile nx or ny:\n move = \"\"\n if nx > 0:\n nx -= 1\n move += \"R\"\n if nx < 0:\n nx += 1\n move += \"L\"\n if ny > 0:\n ny -= 1\n move += \"U\"\n if ny < 0:\n ny += 1\n move += \"D\"\n print(move)\n\t\t\t\t \t \t\t \t \t \t \t\t\t\t \t", "input1 = input()\r\ninput2 = input()\r\nabc = \"abcdefgh\"\r\nstarts = [abc.index(input1[0]), int(input1[1])-1]\r\nfinishs = [abc.index(input2[0]), int(input2[1])-1]\r\nwayfor = []\r\ncounts = 0\r\nwhile starts != finishs:\r\n counts+=1\r\n dir = \"\"\r\n if starts[0] > finishs[0]:\r\n dir += \"L\"\r\n starts[0]-=1\r\n if starts[0] < finishs[0]:\r\n dir += \"R\"\r\n starts[0]+=1\r\n if starts[1] > finishs[1]:\r\n dir += \"D\"\r\n starts[1]-=1\r\n if starts[1] < finishs[1]:\r\n dir += \"U\"\r\n starts[1]+=1\r\n wayfor.append(dir)\r\nprint(counts)\r\nfor step in wayfor:\r\n print(step)", "king = input()\r\ngoal = input()\r\n\r\nkx=ord(king[0])-97\r\nky=int(king[1])-1\r\ngx=ord(goal[0])-97\r\ngy=int(goal[1])-1\r\n\r\npath = []\r\n\r\nwhile True:\r\n if kx > gx:#go left\r\n if ky == gy:\r\n path.append(\"L\")\r\n kx -= 1\r\n elif ky > gy:\r\n path.append(\"LD\")\r\n kx -= 1\r\n ky -= 1\r\n else:\r\n path.append(\"LU\")\r\n kx -= 1\r\n ky += 1\r\n\r\n elif kx < gx:#go right\r\n if ky == gy:\r\n path.append(\"R\")\r\n kx += 1\r\n elif ky > gy:\r\n path.append(\"RD\")\r\n kx += 1\r\n ky -= 1\r\n else:\r\n path.append(\"RU\")\r\n kx += 1\r\n ky += 1\r\n\r\n else: #go up or down\r\n if ky == gy:\r\n break\r\n elif ky < gy:\r\n path.append(\"U\")\r\n ky += 1\r\n else:\r\n path.append(\"D\")\r\n ky -=1\r\n\r\nprint(len(path))\r\nfor i in path:\r\n print(i)", "a = str(input())\r\nb = str(input())\r\ncount1 = ord(a[0]) - ord(b[0])\r\ncount2 = ord(a[1]) - ord(b[1])\r\nbigger = abs(count1) if abs(count1)>abs(count2) else abs(count2)\r\ndis = abs(count1) - abs(count2)\r\nab = bigger - abs(dis)\r\nprint(bigger)\r\nout1 = 'R' if count1<0 else 'L'\r\nout2 = 'D' if count2>0 else 'U'\r\nfor i in range(0, ab):\r\n print(out1+out2)\r\nfor i in range(0, abs(dis)):\r\n print(out1 if dis>0 else out2)\r\n", "pos = ['a','b','c','d','e','f','g','h']\r\nstart = input()\r\nend = input()\r\n\r\nstart_x = int(start[1])\r\nend_x = int(end[1])\r\n\r\nfor i in range(len(pos)):\r\n if pos[i] == start[0]: start_y = i+1\r\n if pos[i] == end[0]: end_y = i+1\r\nstep = 0\r\nstep_des = []\r\nwhile (start_x > end_x and start_y > end_y):\r\n step += 1\r\n step_des.append('LD')\r\n start_x -= 1\r\n start_y -= 1\r\nwhile (start_x > end_x and start_y < end_y):\r\n step += 1\r\n step_des.append('RD')\r\n start_x -= 1\r\n start_y += 1\r\nwhile (start_x < end_x and start_y > end_y):\r\n step += 1\r\n step_des.append('LU')\r\n start_x += 1\r\n start_y -= 1\r\nwhile (start_x < end_x and start_y < end_y):\r\n step += 1\r\n step_des.append('RU')\r\n start_x += 1\r\n start_y += 1\r\nif (start_x == end_x):\r\n while (start_y > end_y):\r\n step += 1\r\n step_des.append('L')\r\n start_y -= 1\r\n while (start_y < end_y):\r\n step += 1\r\n step_des.append('R')\r\n start_y += 1\r\nif (start_y == end_y):\r\n while (start_x > end_x):\r\n step += 1\r\n step_des.append('D')\r\n start_x -= 1\r\n while (start_x < end_x):\r\n step += 1\r\n step_des.append('U')\r\n start_x += 1\r\nprint(step)\r\nfor i in range(step):\r\n print(step_des[i])\r\n", "s=input()\r\nt=input()\r\n\r\nkx=ord(s[0])-ord('a')+1\r\nky=int(s[1])\r\n\r\ndx=ord(t[0])-ord('a')+1\r\ndy=int(t[1])\r\n\r\npath=[]\r\nwhile kx!=dx or ky!=dy:\r\n move=''\r\n if kx>dx:\r\n move='L'\r\n kx-=1\r\n elif kx<dx:\r\n move='R'\r\n kx+=1\r\n if ky>dy:\r\n move=move+'D'\r\n ky-=1\r\n elif ky<dy:\r\n move=move+'U'\r\n ky+=1\r\n path.append(move)\r\n \r\nprint(len(path))\r\nfor x in path:\r\n print(x)", "#input\r\ns = input()\r\nt = input()\r\n\r\n#solve\r\nfx = 'LRUD'\r\nhd = ord(t[0]) - ord(s[0])\r\nvd = ord(t[1]) - ord(s[1])\r\nhd_abs = abs(hd)\r\nvd_abs = abs(vd)\r\nn = max(hd_abs, vd_abs)\r\nprint(n)\r\nif (hd >= 0):\r\n m = min(hd_abs, vd_abs)\r\n for i in range(m):\r\n if (vd >= 0):\r\n print('RU')\r\n else:\r\n print('RD')\r\n\r\n for i in range(n-m):\r\n if (hd_abs >= vd_abs):\r\n print('R')\r\n else:\r\n if (vd >= 0):\r\n print('U')\r\n else:\r\n print('D')\r\nelse:\r\n m = min(hd_abs, vd_abs)\r\n for i in range(m):\r\n if (vd >= 0):\r\n print('LU')\r\n else:\r\n print('LD')\r\n\r\n for i in range(n-m):\r\n if (hd_abs >= vd_abs):\r\n print('L')\r\n else:\r\n if (vd >= 0):\r\n print('U')\r\n else:\r\n print('D')\r\n\r\n\r\n \r\n", "def shortest_path(source, dest):\r\n # Convert chessboard coordinates a,b,c,d... to respective indices 1,2,3,4...\r\n source_col, source_row = ord(source[0]) - ord('a'), int(source[-1])\r\n dest_col, dest_row = ord(dest[0]) - ord('a'), int(dest[-1])\r\n\r\n # Calculate difference between dest(row,col) and source(row,col)\r\n col_diff = dest_col - source_col\r\n row_diff = dest_row - source_row\r\n\r\n path = []\r\n while col_diff != 0 or row_diff != 0:\r\n move = \"\"\r\n if col_diff > 0:\r\n move += \"R\"\r\n col_diff -= 1\r\n elif col_diff < 0:\r\n move += \"L\"\r\n col_diff += 1\r\n if row_diff > 0:\r\n move += \"U\"\r\n row_diff -= 1\r\n elif row_diff < 0:\r\n move += \"D\"\r\n row_diff += 1\r\n path.append(move)\r\n\r\n # Printing the result\r\n print(len(path))\r\n for x in path:\r\n print(x)\r\n\r\n\r\n# GET INPUT\r\nsource = input()\r\ndest = input()\r\nshortest_path(source, dest)\r\n", "from string import ascii_lowercase\r\n\r\nif __name__ == '__main__':\r\n moves = { 'U': 1, 'D': -1, 'R': 1, 'L': -1, '': 0}\r\n king = input()\r\n king = [ascii_lowercase.index(king[0]), int(king[1]) - 1]\r\n dest = input()\r\n dest = [ascii_lowercase.index(dest[0]), int(dest[1]) - 1]\r\n\r\n number_of_moves = 0\r\n moves_taken = []\r\n while king != dest:\r\n number_of_moves += 1\r\n horizontal_dir = 'L' if king[0] > dest[0] else 'R' if king[0] < dest[0] else ''\r\n vertical_dir = 'D' if king[1] > dest[1] else 'U' if king[1] < dest[1] else ''\r\n king = [king[0] + moves[horizontal_dir], king[1] + moves[vertical_dir]]\r\n moves_taken.append(f'{horizontal_dir}{vertical_dir}')\r\n\r\n print(number_of_moves)\r\n for move in moves_taken: print(move)\r\n", "s = input()\r\nt = input()\r\n\r\n# Получаем начальные и конечные координаты\r\nx1, y1 = ord(s[0]) - ord('a'), int(s[1])\r\nx2, y2 = ord(t[0]) - ord('a'), int(t[1])\r\n\r\n# Считаем разницу между начальными и конечными координатами\r\ndx = x2 - x1\r\ndy = y2 - y1\r\n\r\n# Количество шагов короля\r\nsteps = max(abs(dx), abs(dy))\r\n\r\nprint(steps)\r\n\r\n# Двигаем короля к цели\r\nfor i in range(steps):\r\n move = ''\r\n if x1 < x2:\r\n move += 'R'\r\n x1 += 1\r\n elif x1 > x2:\r\n move += 'L'\r\n x1 -= 1\r\n if y1 < y2:\r\n move += 'U'\r\n y1 += 1\r\n elif y1 > y2:\r\n move += 'D'\r\n y1 -= 1\r\n print(move)\r\n", "\r\nsp=['','a','b','c','d','e','f','g','h']\r\n\r\ns=input()\r\ns=[sp.index(s[0]),int(s[1])]\r\n\r\nk=input()\r\nk=[sp.index(k[0]),int(k[1])]\r\nh=[]\r\nwhile s!=k:\r\n if s[0]<k[0] and s[1]<k[1]:\r\n s[0]+=1\r\n s[1]+=1\r\n h.append('RU')\r\n elif s[0]>k[0] and s[1]>k[1]:\r\n s[0] -= 1\r\n s[1] -= 1\r\n h.append('LD')\r\n elif s[0]<k[0] and s[1]>k[1]:\r\n s[0] += 1\r\n s[1] -= 1\r\n h.append('RD')\r\n elif s[0]>k[0] and s[1]<k[1]:\r\n s[0] -= 1\r\n s[1] += 1\r\n h.append('LU')\r\n elif s[0]==k[0] and s[1]<k[1]:\r\n s[1] += 1\r\n h.append('U')\r\n elif s[0]==k[0] and s[1]>k[1]:\r\n s[1] -= 1\r\n h.append('D')\r\n elif s[0] < k[0] and s[1] == k[1]:\r\n s[0] += 1\r\n h.append('R')\r\n else:\r\n s[0] -= 1\r\n h.append('L')\r\n\r\nprint(len(h))\r\nfor i in h:\r\n print(i)", "cor = {'a': 1, 'b': 2, 'c': 3, 'd': 4, 'e': 5, 'f': 6, 'g': 7, 'h': 8}\r\ns = list(input())\r\nt = list(input())\r\nx1, y1 = cor[s[0]], int(s[1])\r\nx2, y2 = cor[t[0]], int(t[1])\r\ncount = 0\r\nmoves = []\r\nif(x2 > x1):\r\n if(y2 > y1):\r\n while(x1 != x2 and y1 != y2):\r\n x1 += 1\r\n y1 += 1\r\n count += 1\r\n moves.append(\"RU\")\r\n else:\r\n if(x1 != x2):\r\n while(x1 != x2):\r\n x1 += 1\r\n moves.append(\"R\")\r\n count += 1\r\n else:\r\n while(y1 != y2):\r\n y1 += 1\r\n moves.append(\"U\")\r\n count += 1\r\n else:\r\n while(x1 != x2 and y1 != y2):\r\n x1 += 1\r\n y1 -= 1\r\n count += 1\r\n moves.append(\"RD\")\r\n else:\r\n if(x1 != x2):\r\n while(x1 != x2):\r\n x1 += 1\r\n moves.append(\"R\")\r\n count += 1\r\n else:\r\n while(y1 != y2):\r\n y1 -= 1\r\n moves.append(\"D\")\r\n count += 1\r\nelse:\r\n if(y2 > y1):\r\n while(x1 != x2 and y1 != y2):\r\n x1 -= 1\r\n y1 += 1\r\n count += 1\r\n moves.append(\"LU\")\r\n else:\r\n if(x1 != x2):\r\n while(x1 != x2):\r\n x1 -= 1\r\n moves.append(\"L\")\r\n count += 1\r\n else:\r\n while(y1 != y2):\r\n y1 += 1\r\n moves.append(\"U\")\r\n count += 1\r\n else:\r\n while(x1 != x2 and y1 != y2):\r\n x1 -= 1\r\n y1 -= 1\r\n count += 1\r\n moves.append(\"LD\")\r\n else:\r\n if(x1 != x2):\r\n while(x1 != x2):\r\n x1 -= 1\r\n moves.append(\"L\")\r\n count += 1\r\n else:\r\n while(y1 != y2):\r\n y1 -= 1\r\n moves.append(\"D\")\r\n count += 1\r\nprint(count)\r\nfor move in moves:\r\n print(move)\r\n", "x = ['a', 'b', 'c', 'd', 'e', 'f', 'g', 'h']\r\ny = [1, 2, 3, 4, 5, 6, 7, 8]\r\n\r\nn = input()\r\nm = input()\r\n\r\nxm = x.index(m[0]) - x.index(n[0]) # на сколько нужно сдвинуть по горизонтали\r\nym = y.index(int(m[1])) - y.index(int(n[1])) # на сколько нужно сдвинуть по вертикали\r\n\r\ng = max(abs(x.index(m[0]) - x.index(n[0])), abs(y.index(int(m[1])) - y.index(int(n[1])))) # минимальное число ходов\r\nprint(g)\r\n\r\nfor i in range(g):\r\n if xm < 0:\r\n print('L', end='')\r\n xm = xm + 1\r\n if xm > 0:\r\n print('R', end='')\r\n xm = xm - 1\r\n if ym < 0:\r\n print('D', end='')\r\n ym = ym + 1\r\n if ym > 0:\r\n print('U', end='')\r\n ym = ym - 1\r\n print('')\r\n", "\r\nv1 = list(input())\r\nv2 = list(input())\r\n\r\nuh = ['a','b','c','d','e','f','g','h']\r\nx1, y1 = uh.index(v1[0]), (int(v1[1]) - 8)*-1\r\nx2, y2 = uh.index(v2[0]), (int(v2[1]) - 8)*-1\r\n\r\nx = x2 - x1\r\ny = y2 - y1\r\nmaximo = max(abs(x),abs(y))\r\ndir_linea = ''\r\nif maximo == abs(x):\r\n d = abs(y)\r\n h = abs(abs(x) - abs(y))\r\n v = 0\r\n if x > 0:\r\n dir_linea = 'R'\r\n if x < 0:\r\n dir_linea = 'L'\r\nelse:\r\n d = abs(x)\r\n h = 0\r\n v = abs(abs(y) - abs(x))\r\n if y > 0:\r\n dir_linea = 'D'\r\n if y < 0:\r\n dir_linea = 'U'\r\n\r\ndir_diag = ''\r\nif x > 0 and y > 0:\r\n dir_diag = 'RD'\r\nif x < 0 and y > 0:\r\n dir_diag = 'LD'\r\nif x > 0 and y < 0:\r\n dir_diag = 'RU'\r\nif x < 0 and y < 0:\r\n dir_diag = 'LU'\r\n\r\nprint(d+h+v)\r\nfor _ in range(h):\r\n print(dir_linea)\r\nfor _ in range(v):\r\n print(dir_linea)\r\nfor _ in range(d):\r\n print(dir_diag)", "s=input()\r\nk=input()\r\nx,y=ord(s[0]),int(s[1])\r\na,b=ord(k[0]),int(k[1])\r\nr=\"\"\r\no=0\r\nwhile x!=a or y!=b:\r\n if x>a:\r\n x-=1\r\n r+=\"L\"\r\n elif x<a:\r\n x+=1\r\n r+=\"R\"\r\n if y>b:\r\n y-=1\r\n r+=\"D\"\r\n elif y<b:\r\n y+=1\r\n r+=\"U\"\r\n r+=\"\\n\"\r\n o+=1\r\nprint(o,\"\\n\",r)", "from collections import deque\r\n\r\nimport sys\r\n\r\n\r\ns = input()\r\nt = input()\r\ndia = [[1, 1], [1, -1], [-1, 1], [-1, -1]]\r\nstra = [[1, 0], [-1, 0], [0, 1], [0, -1]]\r\ns,t = [ord(s[0])-96, int(s[1])],[ord(t[0])-96, int(t[1])]\r\n\r\nsteps = [t[0]-s[0],t[1]-s[1]]\r\nans = []\r\ns=0\r\nwhile 1:\r\n if 0 in steps:\r\n break\r\n if steps[0]>0 and steps[1]>0:\r\n ans+=[\"RU\"]\r\n steps = [steps[0]-1, steps[1]-1]\r\n elif steps[0]<0 and steps[1]>0:\r\n ans+=[\"LU\"]\r\n steps = [steps[0]+1, steps[1]-1]\r\n elif steps[0]>0 and steps[1]<0:\r\n ans+=[\"RD\"]\r\n steps = [steps[0]-1, steps[1]+1]\r\n else:\r\n ans+=[\"LD\"]\r\n steps = [steps[0]+1, steps[1]+1]\r\n s+=1\r\n\r\nwhile 1:\r\n if steps == [0,0]:\r\n break\r\n if steps[0]==0 and steps[1]>0:\r\n ans+=[\"U\"]\r\n steps = [0, steps[1]-1]\r\n elif steps[0]==0 and steps[1]<0:\r\n ans+=[\"D\"]\r\n steps = [0, steps[1]+1]\r\n elif steps[0]>0 and steps[1]==0:\r\n ans+=[\"R\"]\r\n steps = [steps[0]-1, 0]\r\n else:\r\n ans+=[\"L\"]\r\n steps = [steps[0]+1, 0]\r\n s+=1\r\n\r\nprint(s)\r\nfor i in ans:\r\n print(i)\r\n \r\n", "def comp(s):\r\n a = s[0]\r\n res1 = 0\r\n res2 = 0\r\n if a=='a':\r\n res1 = 1\r\n elif a=='b':\r\n res1 = 2\r\n elif a=='c':\r\n res1 = 3\r\n elif a=='d':\r\n res1 = 4\r\n elif a=='e':\r\n res1 = 5\r\n elif a=='f':\r\n res1 = 6\r\n elif a=='g':\r\n res1 = 7\r\n elif a=='h':\r\n res1 = 8\r\n res2 = int(s[1])\r\n return (res1, res2)\r\n \r\n\r\ndef move(x1, y1, x2, y2, count, counter):\r\n if x1==x2 and y1==y2:\r\n print(count)\r\n for i in counter:\r\n print(i)\r\n elif x1<x2 and y1>y2:\r\n counter.append('RD')\r\n count+=1\r\n return move(x1+1, y1-1, x2, y2, count, counter)\r\n elif x1<x2 and y1==y2:\r\n counter.append('R')\r\n count+=1\r\n return move(x1+1, y1, x2, y2, count, counter)\r\n elif x1<x2 and y1<y2:\r\n counter.append('RU')\r\n count+=1\r\n return move(x1+1, y1+1, x2, y2, count, counter)\r\n elif x1>x2 and y1>y2:\r\n counter.append('LD')\r\n count+=1\r\n return move(x1-1, y1-1, x2, y2, count, counter)\r\n elif x1>x2 and y1==y2:\r\n counter.append('L')\r\n count+=1\r\n return move(x1-1, y1, x2, y2, count, counter)\r\n elif x1>x2 and y1<y2:\r\n counter.append('LU')\r\n count+=1\r\n return move(x1-1, y1+1, x2, y2, count, counter)\r\n elif x1==x2 and y1<y2:\r\n counter.append('U')\r\n count+=1\r\n return move(x1, y1+1, x2, y2, count, counter)\r\n else:\r\n counter.append('D')\r\n count+=1\r\n return move(x1, y1-1, x2, y2, count, counter)\r\n\r\ns1 = input()\r\ns2 = input()\r\nmove(comp(s1)[0], comp(s1)[1], comp(s2)[0], comp(s2)[1], 0, [])", "s1 = input()\r\ns2 = input()\r\na1 = ord(s1[0])\r\na2 = int(s1[1])\r\nb1 = ord(s2[0])\r\nb2 = int(s2[1])\r\n\r\na = []\r\ndem = 0\r\nwhile a1 != b1 or a2 != b2:\r\n\tif (a1<b1) and (a2<b2):\r\n\t\ta1 += 1\r\n\t\ta2 += 1\r\n\t\ta.append('RU')\r\n\t\tdem += 1\r\n\telif (a1<b1) and (a2>b2):\r\n\t\ta1 += 1\r\n\t\ta2 -= 1\r\n\t\ta.append('RD')\r\n\t\tdem += 1\r\n\telif (a1>b1) and (a2<b2):\r\n\t\ta1 -= 1\r\n\t\ta2 += 1\r\n\t\ta.append('LU')\r\n\t\tdem += 1\r\n\telif (a1>b1) and (a2>b2):\r\n\t\ta1 -= 1\r\n\t\ta2 -= 1\r\n\t\ta.append('LD')\r\n\t\tdem += 1\r\n\telif (a1==b1) and (a2<b2):\r\n\t\ta2 += 1\r\n\t\ta.append('U')\r\n\t\tdem += 1\r\n\telif (a1==b1) and (a2>b2):\r\n\t\ta2 -= 1\r\n\t\ta.append('D')\r\n\t\tdem += 1\r\n\telif (a1<b1) and (a2==b2):\r\n\t\ta1 += 1\r\n\t\ta.append('R')\r\n\t\tdem += 1\r\n\telif (a1>b1) and (a2==b2):\r\n\t\ta1 -= 1\r\n\t\ta.append('L')\r\n\t\tdem += 1\r\n\r\nprint(dem)\r\nfor i in range(len(a)):\r\n\tprint(a[i])\r\n", "king = input()\r\nt=input()\r\nking=list(king)\r\nt=list(t)\r\nking[1]=int(king[1])\r\nt[1]=int(t[1])\r\nres=[]\r\ni=0\r\n\r\nwhile king != t:\r\n if king[1]==t[1] and ord(king[0])<ord(t[0]):\r\n res.append(\"R\")\r\n king[0]=chr(ord(king[0])+1)\r\n\r\n elif king[1]==t[1] and ord(king[0])>ord(t[0]):\r\n res.append(\"L\")\r\n king[0]=chr(ord(king[0])-1)\r\n elif king[0]==t[0] and king[1]<t[1]:\r\n res.append(\"U\")\r\n king[1]+=1\r\n elif king[0]==t[0] and king[1]>t[1]:\r\n res.append(\"D\")\r\n king[1]-=1\r\n elif king[1]<t[1] and ord(king[0])<ord(t[0]):\r\n res.append(\"RU\")\r\n king[0]=chr(ord(king[0])+1)\r\n king[1]+=1\r\n elif king [1]>t[1] and ord(king[0])<ord(t[0]):\r\n res.append(\"RD\")\r\n king[0]=chr(ord(king[0])+1)\r\n king[1]-=1\r\n elif king[1]<t[1] and ord(king[0])>ord(t[0]):\r\n res.append(\"LU\")\r\n king[0]=chr(ord(king[0])-1)\r\n king[1]+=1\r\n else:\r\n res.append(\"LD\")\r\n king[0]=chr(ord(king[0])-1)\r\n king[1]-=1\r\n i+=1\r\n \r\nprint(i)\r\nfor i in range(0, len(res), 1):\r\n print(res[i])\r\n", "king = input()\r\nt = input()\r\nSource_col = ord(king[0])- ord(\"a\") + 1\r\nSource_row= int(king[1])\r\nDest_col = ord(t[0])- ord(\"a\") + 1\r\nDest_row = int(t[1])\r\n\r\n\r\nprint(max(abs(Source_col- Dest_col), abs(Source_row - Dest_row)))\r\nwhile (Source_col,Source_row) != (Dest_col,Dest_row):\r\n if Source_col < Dest_col:\r\n print(\"R\",end=\"\")\r\n Source_col += 1\r\n elif Source_col > Dest_col:\r\n print(\"L\",end=\"\")\r\n Source_col -= 1\r\n if Source_row < Dest_row:\r\n print(\"U\",end=\"\")\r\n Source_row += 1\r\n elif Source_row > Dest_row:\r\n print(\"D\",end=\"\")\r\n Source_row -= 1\r\n print()", "a=list(input());b=list(input());x,y,_x,_y=ord(a[0])-97,int(a[1])-1,ord(b[0])-97,int(b[1])-1\r\nprint(max(abs(x-_x),abs(y-_y)))\r\nwhile(1):\r\n if(x==_x and y==_y):break\r\n if(x<_x):\r\n x+=1;print('R',end='')\r\n elif(x>_x):\r\n x-=1;print('L',end='')\r\n if(y>_y):\r\n y-=1;print('D',end='')\r\n elif(y<_y):\r\n y+=1;print('U',end='')\r\n print('')", "from collections import deque\r\ndx = [1, 1, 0, -1, -1, -1, 0, 1]\r\ndy = [0, 1, 1, 1, 0, -1, -1, -1]\r\ndirections = ['R', 'RU', 'U', 'LU', 'L', 'LD', 'D', 'RD']\r\ndef get_index(s):\r\n return ord(s[0]) - ord('a'), int(s[1]) - 1\r\ndef get_pos(x, y):\r\n return chr(x + ord('a')) + str(y + 1)\r\ndef bfs(start, target):\r\n queue = deque()\r\n queue.append(start)\r\n visited = set()\r\n visited.add(start)\r\n pre = {}\r\n while queue:\r\n cur_pos = queue.popleft()\r\n if cur_pos == target:\r\n break\r\n cur_x, cur_y = get_index(cur_pos)\r\n for i in range(8):\r\n new_x, new_y = cur_x + dx[i], cur_y + dy[i]\r\n if 0 <= new_x < 8 and 0 <= new_y < 8:\r\n new_pos = get_pos(new_x, new_y)\r\n if new_pos not in visited:\r\n visited.add(new_pos)\r\n queue.append(new_pos)\r\n pre[new_pos] = (cur_pos, directions[i])\r\n path = []\r\n cur = target\r\n while cur != start:\r\n path.append(pre[cur][1])\r\n cur = pre[cur][0]\r\n path.reverse()\r\n return len(path), path\r\n\r\nstart_pos = input().strip()\r\ntarget_pos = input().strip()\r\nsteps, path = bfs(start_pos, target_pos)\r\nprint(steps)\r\nfor p in path:\r\n print(p)\r\n", "s = input()\r\nt = input()\r\n \r\nx = ord(t[0]) - ord(s[0])\r\ny = int(t[1]) - int(s[1])\r\n \r\nprint(max(abs(x), abs(y)))\r\n \r\nwhile x != 0 or y != 0:\r\n direction = \"\"\r\n if x > 0:\r\n direction += \"R\"\r\n x -= 1\r\n if x < 0:\r\n direction += \"L\"\r\n x += 1\r\n if y > 0:\r\n direction += \"U\"\r\n y -= 1\r\n if y < 0:\r\n direction += \"D\"\r\n y += 1\r\n print(direction)", "#! python3\n\n\ndef get_num_pos(pos):\n cols = ['a', 'b', 'c', 'd', 'e', 'f', 'g', 'h']\n rows = ['1', '2', '3', '4', '5', '6', '7', '8']\n col, row = pos[0], pos[1]\n return [cols.index(col), rows.index(row)]\n\nslanting_mv = {(1, 1): 'RU', (-1, 1): 'LU', (1, -1): 'RD', (-1, -1): 'LD'}\nparallel_mv = {(1, 0): 'R', (0, 1): 'U', (-1, 0): 'L', (0, -1): 'D'}\n\nstart_npos = get_num_pos(input())\ndest_npos = get_num_pos(input())\n\ndiff_npos = [ dest_npos[i] - start_npos[i] for i in range(len(dest_npos))]\nx, y = diff_npos\n\nslanting_mv_num = min(abs(x), abs(y))\nparallel_mv_num = max(abs(x), abs(y)) - slanting_mv_num\n\nsloss_cmd = []\nsloss_val = []\nfor smv, cmd in slanting_mv.items():\n sloss_cmd.append(smv)\n sloss_val.append(abs(x - smv[0]*slanting_mv_num) + abs(y - smv[1]*slanting_mv_num))\nmin_sloss_val = min(sloss_val)\nmin_sloss_cmd = sloss_cmd[sloss_val.index(min_sloss_val)]\ncmd_list = [slanting_mv[min_sloss_cmd] for i in range(slanting_mv_num)]\n\nx -= min_sloss_cmd[0]*slanting_mv_num\ny -= min_sloss_cmd[1]*slanting_mv_num\n\nploss_cmd = []\nploss_val = []\nfor pmv, cmd in parallel_mv.items():\n ploss_cmd.append(pmv)\n ploss_val.append(abs(x - pmv[0]*parallel_mv_num) + abs(y - pmv[1]*parallel_mv_num))\nmin_ploss_val = min(ploss_val)\nmin_ploss_cmd = ploss_cmd[ploss_val.index(min_ploss_val)]\ncmd_list += [parallel_mv[min_ploss_cmd] for i in range(parallel_mv_num)]\n\nprint(slanting_mv_num + parallel_mv_num)\nprint('\\n'.join(cmd_list))\n\n\n# class Board:\n# def __init__(self):\n# self.cols = ['a', 'b', 'c', 'd', 'e', 'f', 'g', 'h']\n# self.rows = ['1', '2', '3', '4', '5', '6', '7', '8']\n#\n# def move(self, now_pos, mv):\n# now_num_pos = self.get_num_pos(now_pos)\n# mv_dist = [now_num_pos[i] + mv[i] for i in range(2)]\n# if mv_dist[0] in range(len(self.cols)) and mv_dist[1] in range(len(self.rows)):\n# return self.get_chara_pos(mv_dist)\n# else:\n# return 'out'\n#\n# def get_num_pos(self, pos):\n# col, row = pos[0], pos[1]\n# return (self.cols.index(col), self.rows.index(row))\n#\n# def get_chara_pos(self, num_pos):\n# return self.cols[num_pos[0]] + self.rows[num_pos[1]]\n#\n# class King:\n# def __init__(self, start_position):\n# self.position = start_position\n# self.mvdict = {'R': (1, 0), 'U': (0, 1), 'L': (-1, 0), 'D': (0, -1),\n# 'RU': (1, 1), 'LU': (-1, 1), 'RD': (1, -1), 'LD': (-1, -1)}\n# self.board = Board()\n#\n# def get_pos():\n# return self.pos\n#\n# def get_cmd_list():\n# return self.mvdict.keys()\n#\n# def move(cmd):\n# if cmd not in self.mvdict:\n# print('Command not found')\n# return\n# if self.board.move(self.position, self.mvdict[cmd]) == 'out':\n# print('Can\\'t move anymore')\n# return\n# self.position = self.board.move(self.position, self.mvdict[cmd])\n\n\n# width = int(input())\n# height = int(input())\n# print('width =', width, ', height =', height)\n#\n# for i in range(width + height - 1):\n# print('--------- i =', i)\n# if i < min(width, height)-1:\n# a, b = i, i+1\n# elif i < max(width, height):\n# a, b = i, min(width, height)\n# else:\n# a, b = max(width, height)-1, (width+height)-i\n# for j in range(b):\n# x, y = (a, i-a) if width < height else (i-a, a)\n# a -= 1\n# print(x, y)\n", "kk=[\"a\",\"b\",\"c\",\"d\",\"e\",\"f\",\"g\",\"h\"]\r\nb=input()\r\ne=input()\r\ny=int(b[1])-int(e[1])\r\nx=kk.index(e[0])-kk.index(b[0])\r\nprint(max(abs(y),abs(x)))\r\nif x==0 and y>0:\r\n for i in range(y):\r\n print(\"D\")\r\n exit()\r\nelif x==0 and y<0:\r\n for i in range(abs(y)):\r\n print(\"U\")\r\n exit()\r\nelif y==0 and x>0:\r\n for i in range(x):\r\n print(\"R\")\r\n exit()\r\nelif y==0 and x<0:\r\n for i in range(abs(x)):\r\n print(\"L\")\r\n exit()\r\nelif x==0 and y==0:\r\n exit()\r\nif y>0 and x>0:\r\n while y>0 and x>0:\r\n print(\"RD\")\r\n x-=1\r\n y-=1\r\n\"\"\" if x>0:\r\n for i in range(x):\r\n print(\"R\")\r\n elif y>0:\r\n for i in range(y):\r\n print(\"U\")\"\"\"\r\nif y>0 and x<0:\r\n while y>0 and x<0:\r\n print(\"LD\")\r\n y-=1\r\n x+=1\r\nif y<0 and x<0:\r\n while y<0 and x<0:\r\n print(\"LU\")\r\n x+=1\r\n y+=1\r\nif y<0 and x>0:\r\n while y<0 and x>0:\r\n print(\"RU\")\r\n y+=1\r\n x-=1\r\nif x>0:\r\n for i in range(x):\r\n print(\"R\")\r\nelif x<0:\r\n for i in range(abs(x)):\r\n print(\"L\")\r\nif y>0:\r\n for i in range(y):\r\n print(\"D\")\r\nelif y<0:\r\n for i in range(abs(y)):\r\n print(\"U\")\r\n", "coord1=input()\r\ncoord2=input()\r\ncoord1=[ord(coord1[0])-96,int(coord1[1])]\r\ncoord2=[ord(coord2[0])-96,int(coord2[1])]\r\nCountMoves=0\r\nMoves=[]\r\nwhile (coord1[0]!=coord2[0])or(coord1[1]!=coord2[1]):\r\n if coord1[0]==coord2[0]:\r\n if coord1[1]>coord2[1]:\r\n Moves.append('D')\r\n coord1[1]-=1\r\n else:\r\n Moves.append('U')\r\n coord1[1]+=1\r\n elif coord1[0]>coord2[0]:\r\n if coord1[1]==coord2[1]:\r\n Moves.append('L')\r\n coord1[0]-=1\r\n elif coord1[1]>coord2[1]:\r\n Moves.append('LD')\r\n coord1[0]-=1\r\n coord1[1]-=1\r\n else:\r\n Moves.append('LU')\r\n coord1[0]-=1\r\n coord1[1]+=1\r\n else:\r\n if coord1[1]==coord2[1]:\r\n Moves.append('R')\r\n coord1[0]+=1\r\n elif coord1[1]>coord2[1]:\r\n Moves.append('RD')\r\n coord1[0]+=1\r\n coord1[1]-=1\r\n else:\r\n Moves.append('RU')\r\n coord1[0]+=1\r\n coord1[1]+=1\r\n CountMoves+=1\r\nprint(CountMoves)\r\nfor i in range(0,len(Moves)):\r\n print(Moves[i])\r\n", "a = input()\r\nb = input()\r\n\r\na = a.replace(\"a\",\"1 \").replace(\"b\",\"2 \").replace(\"c\",\"3 \").replace(\"d\",\"4 \").replace(\"e\",\"5 \").replace(\"f\",\"6 \").replace(\"g\",\"7 \").replace(\"h\",\"8 \")\r\nb = b.replace(\"a\",\"1 \").replace(\"b\",\"2 \").replace(\"c\",\"3 \").replace(\"d\",\"4 \").replace(\"e\",\"5 \").replace(\"f\",\"6 \").replace(\"g\",\"7 \").replace(\"h\",\"8 \")\r\na = a.split(\" \")\r\nb = b.split(\" \")\r\na = [int(x) for x in a]\r\nb = [int(x) for x in b]\r\n\r\n\"\"\"nr = 0\r\n\r\nif abs(a[0]-b[0]) > abs(a[1]-b[1]):\r\n nr = abs(a[0]-b[0])\r\nelse:\r\n nr = abs(a[1]-b[1])\r\n\"\"\"\r\na1 = a[0]\r\na2 = a[1]\r\nb1 = b[0]\r\nb2 = b[1]\r\nlist1 = []\r\nif a1 > b1:\r\n while a1 > b1:\r\n list1.append(\"L\")\r\n b1+=1\r\nelif a1 < b1:\r\n while a1 < b1:\r\n list1.append(\"R\")\r\n a1+=1\r\n\r\nlist2 = []\r\nif a2 > b2:\r\n while a2 > b2:\r\n list2.append(\"D\")\r\n b2+=1\r\nelif a2 < b2:\r\n while a2 < b2:\r\n list2.append(\"U\")\r\n a2+=1\r\nfinal_list = []\r\n\r\nsmall = []\r\n\r\nif len(list1) > len(list2):\r\n small = list2\r\n big = list1\r\nelse:\r\n small = list1\r\n big = list2\r\n\r\nfor i in range(len(small)):\r\n final_list.append(list1[i]+list2[i])\r\n \r\nfinal_list = [[x] for x in final_list]\r\n\r\nfinal_list.append(big[len(small):])\r\n\r\nfinal_list = [x for y in final_list for x in y]\r\n \r\nprint(len(final_list))\r\nfor i in final_list:\r\n print(i)\r\n", "import sys\ninput = sys.stdin.readline\n\nsrc = input().rstrip()\ndst = input().rstrip()\n\nsi = 8-int(src[1])\nsj = ord(src[0])-97\n\ndi = 8-int(dst[1])\ndj = ord(dst[0])-97\n\nhor_dist = dj-sj\nvert_dist = di-si\n\nans = 0\npath1 = ''\npath2 = ''\npath3 = ''\n\nif abs(hor_dist) < abs(vert_dist):\n if hor_dist > 0:\n path2 += 'R'\n else:\n path2 += 'L'\n path1_freq = abs(hor_dist)\n ans += abs(hor_dist)\n bot_dist = di-(si+abs(hor_dist))\n top_dist = di-(si-abs(hor_dist))\n if abs(bot_dist) < abs(top_dist):\n path1 += 'D'\n if bot_dist < 0:\n path3 += 'U'\n else:\n path3 += 'D'\n path2_freq = abs(bot_dist)\n ans += abs(bot_dist)\n else:\n path1 += 'U'\n if top_dist < 0:\n path3 += 'U'\n else:\n path3 += 'D'\n path2_freq = abs(top_dist)\n ans += abs(top_dist)\n\n \n\nelse:\n if vert_dist > 0:\n path1 += 'D'\n else:\n path1 += 'U'\n path1_freq = abs(vert_dist)\n ans += abs(vert_dist)\n right_dist = dj-(sj+abs(vert_dist))\n left_dist = dj-(sj-abs(vert_dist))\n if abs(right_dist) < abs(left_dist):\n path2 += 'R'\n if right_dist < 0:\n path3 += 'L'\n else:\n path3 += 'R'\n path2_freq = abs(right_dist)\n ans += abs(right_dist)\n else:\n path2 += 'L'\n if left_dist < 0:\n path3 += 'L'\n else:\n path3 += 'R'\n path2_freq = abs(left_dist)\n ans += abs(left_dist)\n\nprint(ans)\nprint((path2+path1+'\\n')*path1_freq+(path3+'\\n')*path2_freq)\n", "\r\ndef king_moves(start, end):\r\n # 将棋盘坐标转换为数字\r\n x1 = ord(start[0]) - ord('a')\r\n y1 = int(start[1]) - 1\r\n x2 = ord(end[0]) - ord('a')\r\n y2 = int(end[1]) - 1\r\n\r\n # 计算横向和纵向的距离\r\n dx = abs(x2 - x1)\r\n dy = abs(y2 - y1)\r\n\r\n # 国王的最短步数就是横向和纵向距离中的较大值\r\n return max(dx, dy)\r\n\r\n# 定义一个函数，用来生成国王的移动步骤\r\ndef king_steps(start, end):\r\n # 将棋盘坐标转换为数字\r\n x1 = ord(start[0]) - ord('a')\r\n y1 = int(start[1]) - 1\r\n x2 = ord(end[0]) - ord('a')\r\n y2 = int(end[1]) - 1\r\n\r\n # 初始化一个空列表，用来存储移动步骤\r\n steps = []\r\n\r\n # 循环直到到达目标位置\r\n while (x1, y1) != (x2, y2):\r\n # 根据横向和纵向的相对位置，确定移动方向\r\n if x1 < x2:\r\n x_dir = 'R'\r\n x1 += 1\r\n elif x1 > x2:\r\n x_dir = 'L'\r\n x1 -= 1\r\n else:\r\n x_dir = ''\r\n\r\n if y1 < y2:\r\n y_dir = 'U'\r\n y1 += 1\r\n elif y1 > y2:\r\n y_dir = 'D'\r\n y1 -= 1\r\n else:\r\n y_dir = ''\r\n\r\n # 将移动方向添加到列表中\r\n steps.append(x_dir + y_dir)\r\n\r\n # 返回移动步骤列表\r\n return steps\r\n\r\n# 输入起始位置和目标位置\r\nstart = input()\r\nend = input()\r\n\r\n# 调用函数，计算最短步数和移动步骤\r\nmoves = king_moves(start, end)\r\nsteps = king_steps(start, end)\r\n\r\n# 输出结果\r\nprint(moves)\r\nfor step in steps:\r\n print(step)\r\n", "actual_char,actual_int =input(\"\")\r\ndestino_char,destino_int=input(\"\")\r\nactual_char=ord(actual_char)\r\nactual_int=int(actual_int)\r\ndestino_char=ord(destino_char)\r\ndestino_int=int(destino_int)\r\nv=[]\r\ncont=0\r\n\r\nwhile actual_char!=destino_char or actual_int!=destino_int:\r\n\tif actual_char==destino_char:\r\n\t\r\n\t\tif actual_int>destino_int:\r\n\t\t\r\n\t\t\tv.append(\"D\")\r\n\t\t\tactual_int-=1\r\n\t\t\r\n\t\telse:\r\n\t\t\tv.append(\"U\")\r\n\t\t\tactual_int+=1\r\n\t\t\r\n\t\r\n\telif actual_int==destino_int :\r\n\t\r\n\t\tif actual_char>destino_char :\r\n\t\t\r\n\t\t\tv.append(\"L\")\r\n\t\t\tactual_char-=1\r\n\t\t\r\n\t\telse:\r\n\t\t\tv.append(\"R\")\r\n\t\t\tactual_char+=1\r\n\t\t\r\n\t\r\n\telse:\r\n\t\tif actual_char>destino_char and actual_int>destino_int:\r\n\t\t\r\n\t\t\tv.append(\"LD\")\r\n\t\t\tactual_char-=1\r\n\t\t\tactual_int-=1\r\n\t\t\r\n\t\telif actual_char<destino_char and actual_int<destino_int:\r\n\t\t\tv.append(\"RU\")\r\n\t\t\tactual_char+=1\r\n\t\t\tactual_int+=1\r\n\t\t\r\n\t\telif actual_char>destino_char and actual_int<destino_int:\r\n\t\t\r\n\t\t\tv.append(\"LU\")\r\n\t\t\tactual_char-=1\r\n\t\t\tactual_int+=1\r\n\t\t\r\n\t\telse:\r\n\t\t\tv.append(\"RD\")\r\n\t\t\tactual_char+=1\r\n\t\t\tactual_int-=1\r\n\t\t\r\n\r\n\t\r\n\tcont+=1\r\nprint(cont)\r\nfor i in range (0,len(v)):\r\n print(v[i])\r\n", "a=input() + input()\r\na, b = (ord(a[i])-ord(a[i+2]) for i in (0,1))\r\n\r\n# length is equal to the longest side\r\nprint(max(a,-a,b,-b))\r\n\r\n# change coordinates until reached final position\r\nwhile a!=0 or b!=0:\r\n\tr = ''\r\n\tif a<0:\r\n\t\tr='R'\r\n\t\ta+=1\r\n\tif a>0:\r\n\t\tr='L';\r\n\t\ta-=1\r\n\tif b<0:\r\n\t\tr+='U';\r\n\t\tb+=1\r\n\tif b>0:\r\n\t\tr+='D';\r\n\t\tb-=1\r\n\tprint(r)", "s = input()\r\nsx = ord(s[0]) - ord('a') + 1\r\nsy = 9 - int(s[1])\r\nt = input()\r\ntx = ord(t[0]) - ord('a') + 1\r\nty = 9 - int(t[1])\r\n\r\ndiff_row = ty - sy\r\ndiff_col = tx - sx\r\npath = ''\r\n\r\nif diff_row >= 0 and diff_col >= 0:\r\n path += 'RD\\n' * min(diff_row, diff_col)\r\n diff_row, diff_col = diff_row - min(diff_row, diff_col), diff_col - min(diff_row, diff_col)\r\nif diff_row < 0 and diff_col >= 0:\r\n path += 'RU\\n' * min(-diff_row, diff_col)\r\n diff_row, diff_col = diff_row + min(-diff_row, diff_col), diff_col - min(-diff_row, diff_col)\r\nif diff_row >= 0 and diff_col < 0:\r\n path += 'LD\\n' * min(diff_row, -diff_col)\r\n diff_row, diff_col = diff_row - min(diff_row, -diff_col), diff_col + min(diff_row, -diff_col)\r\nif diff_row < 0 and diff_col < 0:\r\n path += 'LU\\n' * min(-diff_row, -diff_col)\r\n diff_row, diff_col = diff_row + min(-diff_row, -diff_col), diff_col + min(-diff_row, -diff_col)\r\n\r\nif diff_row == 0:\r\n if diff_col >= 0:\r\n path += 'R\\n' * diff_col\r\n else:\r\n path += 'L\\n' * -diff_col\r\nelse:\r\n if diff_row >= 0:\r\n path += 'D\\n' * diff_row\r\n else:\r\n path += 'U\\n' * -diff_row\r\n\r\nstep = len(list(path.split()))\r\nprint(step)\r\nprint(path)", "start = [char for char in input()]\r\n\r\nend = [char for char in input()]\r\n \r\nstart = [ord(start[0]), int(start[1])]\r\n\r\nend = [ord(end[0]), int(end[1])]\r\n \r\nnumber_of_steps = max(abs(start[0] - end[0]), abs(start[1] - end[1]))\r\n\r\n\r\nprint(number_of_steps)\r\n \r\nwhile start != end:\r\n step = \"\"\r\n \r\n if start[0] < end[0]:\r\n step += \"R\"\r\n start[0] += 1\r\n \r\n elif start[0] > end[0]:\r\n \r\n step += \"L\"\r\n start[0] -= 1\r\n \r\n if start[1] < end[1]:\r\n \r\n step += \"U\"\r\n start[1] += 1\r\n \r\n elif start[1] > end[1]:\r\n step +=\"D\"\r\n start[1] -= 1\r\n \r\n print(step)", "start=input()\r\nend=input()\r\nx,y=ord(start[0])-64,int(start[1])\r\nxf,yf=ord(end[0])-64,int(end[1])\r\nprint(max([abs(xf-x),abs(yf-y)]))\r\nwhile(x!=xf or y!=yf):\r\n if(x-xf>0 and yf-y>0):\r\n print(\"LU\")\r\n x-=1\r\n y+=1\r\n elif(xf-x>0 and yf-y>0):\r\n print(\"RU\")\r\n x+=1\r\n y+=1\r\n elif(x-xf>0 and y-yf>0):\r\n print(\"LD\")\r\n x-=1\r\n y-=1\r\n elif(xf-x>0 and y-yf>0):\r\n print(\"RD\")\r\n x+=1\r\n y-=1\r\n elif(xf-x==0 and yf-y>0):\r\n print(\"U\")\r\n y+=1\r\n elif(xf-x==0 and y-yf>0):\r\n print(\"D\")\r\n y-=1\r\n elif(x-xf>0 and y-yf==0):\r\n print(\"L\")\r\n x-=1\r\n elif(xf-x>0 and y-yf==0):\r\n print(\"R\")\r\n x+=1", "def diff_row(s, f):\r\n return s-f\r\n\r\ndef diff_column(s, f):\r\n return s-f\r\n\r\nstart = input()\r\nfinish = input()\r\npath = []\r\nrows = \"abcdefgh\"\r\n\r\ns_column = int(start[1])\r\ns_row = int(rows.find(start[0]))\r\nf_column = int(finish[1])\r\nf_row = int(rows.find(finish[0]))\r\n\r\niterations = max(abs(diff_row(s_row, f_row)), abs(diff_column(s_column, f_column)))\r\n\r\nfor i in range(iterations):\r\n if diff_row(s_row, f_row) == 0:\r\n if diff_column(s_column, f_column) > 0:\r\n path.append(\"D\")\r\n s_column -= 1\r\n else:\r\n path.append(\"U\")\r\n s_column += 1\r\n elif diff_column(s_column, f_column) == 0:\r\n if diff_row(s_row, f_row) > 0:\r\n path.append(\"L\")\r\n s_row -= 1\r\n else:\r\n path.append(\"R\")\r\n s_row += 1\r\n else:\r\n if diff_row(s_row, f_row) > 0:\r\n if diff_column(s_column, f_column) > 0:\r\n path.append(\"LD\")\r\n s_column -= 1\r\n s_row -= 1\r\n else:\r\n path.append(\"LU\")\r\n s_column += 1\r\n s_row -= 1\r\n else:\r\n if diff_column(s_column, f_column) > 0:\r\n path.append(\"RD\")\r\n s_column -= 1\r\n s_row += 1\r\n else:\r\n path.append(\"RU\")\r\n s_column += 1\r\n s_row += 1\r\n\r\nprint(iterations)\r\n\r\nfor i in path:\r\n print(i)\r\n \r\n \r\n", "moves = []\r\ntemp = {\"a\":1,\"b\":2,\"c\":3,\"d\":4,\"e\":5,\"f\":6,\"g\":7,\"h\":8}\r\nstart = input(\"\")\r\nend = input(\"\")\r\n\r\nstartCol = temp[start[0]]\r\nendCol = temp[end[0]]\r\n\r\nstartRow = int(start[1])\r\nendRow = int(end[1])\r\n\r\nwhile True:\r\n if startRow == endRow and endCol == startCol:\r\n break\r\n elif startRow > endRow and startCol < endCol:\r\n moves.append(\"RD\")\r\n startRow -= 1\r\n startCol += 1\r\n elif startRow > endRow and startCol > endCol:\r\n moves.append(\"LD\")\r\n startRow -= 1\r\n startCol -= 1\r\n elif startRow < endRow and startCol < endCol:\r\n moves.append(\"RU\")\r\n startRow += 1\r\n startCol += 1\r\n elif startRow < endRow and startCol > endCol:\r\n moves.append(\"LU\")\r\n startRow += 1\r\n startCol -= 1\r\n elif startRow == endRow and startCol < endCol:\r\n moves.append(\"R\")\r\n startCol += 1\r\n elif startRow == endRow and startCol > endCol:\r\n moves.append(\"L\")\r\n startCol -= 1\r\n elif startRow > endRow and startCol == endCol:\r\n moves.append(\"D\")\r\n startRow -= 1\r\n elif startRow < endRow and startCol == endCol:\r\n moves.append(\"U\")\r\n startRow += 1\r\n\r\nprint(len(moves))\r\nfor move in moves:\r\n print(move)", "from collections import deque\r\n\r\ndirections = {\r\n 'L': (-1, 0),\r\n 'R': (1, 0),\r\n 'U': (0, 1),\r\n 'D': (0, -1),\r\n 'LU': (-1, 1),\r\n 'LD': (-1, -1),\r\n 'RU': (1, 1),\r\n 'RD': (1, -1)\r\n}\r\n\r\ndef get_coordinates(square):\r\n x = ord(square[0]) - ord('a')\r\n y = int(square[1]) - 1\r\n return x, y\r\n\r\ndef get_square_name(x, y):\r\n square_name = chr(x + ord('a')) + str(y + 1)\r\n return square_name\r\n\r\ndef bfs(start, target):\r\n start_x, start_y = get_coordinates(start)\r\n target_x, target_y = get_coordinates(target)\r\n\r\n prev = {}\r\n moves = {}\r\n\r\n queue = deque([(start_x, start_y)])\r\n visited = set([(start_x, start_y)])\r\n\r\n while queue:\r\n x, y = queue.popleft()\r\n\r\n\r\n if x == target_x and y == target_y:\r\n break\r\n\r\n for move, (dx, dy) in directions.items():\r\n nx, ny = x + dx, y + dy\r\n\r\n # 检查是否在棋盘范围内且未被访问过\r\n if 0 <= nx < 8 and 0 <= ny < 8 and (nx, ny) not in visited:\r\n square_name = get_square_name(nx, ny)\r\n prev[square_name] = get_square_name(x, y)\r\n moves[square_name] = move\r\n\r\n queue.append((nx, ny))\r\n visited.add((nx, ny))\r\n\r\n steps = []\r\n current_square = target\r\n while current_square != start:\r\n steps.append(moves[current_square])\r\n current_square = prev[current_square]\r\n steps.reverse()\r\n\r\n return len(steps), steps\r\nstart = input()\r\ntarget = input()\r\n\r\nminimum_steps, move_steps = bfs(start, target)\r\n\r\nprint(minimum_steps)\r\nfor move_step in move_steps:\r\n print(move_step)\r\n", "# LUOGU_RID: 134021598\ns1 = input()\r\ns2 = input()\r\n\r\nx = ord(s1[0]) - ord(s2[0])\r\ny = int(s1[1]) - int(s2[1])\r\n\r\ncx = 'R' if x < 0 else 'L'\r\ncy = 'U' if y < 0 else 'D'\r\n\r\nx = abs(x)\r\ny = abs(y)\r\n\r\nprint(max(x, y))\r\n\r\nwhile x or y:\r\n if x:\r\n x -= 1\r\n print(cx, end='')\r\n if y:\r\n y -= 1\r\n print(cy, end='')\r\n print()\r\n", "s = input()\nt = input()\n\nsx = ord(s[0]) - ord('a')\nsy = int(s[1])\n\ntx = ord(t[0]) - ord('a')\nty = int(t[1])\n\nans = []\n\nwhile sx != tx or sy != ty:\n tmp = []\n if sx < tx:\n tmp.append('R')\n sx += 1\n elif sx > tx:\n tmp.append('L')\n sx -= 1\n if sy < ty:\n tmp.append('U')\n sy += 1\n elif sy > ty:\n tmp.append('D')\n sy -= 1\n ans.append(\"\".join(tmp))\n\nprint(len(ans))\nfor step in ans:\n print(step)\n\n", "start = str(input())\r\nend = str(input())\r\nx = ord(start[0])-ord(end[0])\r\ny = int(start[1])-int(end[1])\r\nprint(max(x,y,-x,-y))\r\nwhile(x!=0 or y!=0):\r\n str = ''\r\n if x<0:str+=\"R\";x+=1\r\n if x>0:str+=\"L\";x-=1\r\n if y<0:str+=\"U\";y+=1\r\n if y>0:str+=\"D\";y-=1\r\n print(str)", "arr=['a','b','c','d','e','f','g','h']\r\na=input()\r\nb=input()\r\n\r\nx=abs(arr.index(a[0])-arr.index(b[0]))\r\ny=abs(int(a[1])-int(b[1]))\r\nM,m=max(x,y),min(x,y)\r\nd=M-m\r\nprint(M)\r\nif a[0]>=b[0]:\r\n if a[1]>b[1]:\r\n if M==x:\r\n for i in range(m):\r\n print('LD')\r\n for i in range(d):\r\n print('L')\r\n else:\r\n for i in range(m):\r\n print('LD')\r\n for i in range(d):\r\n print('D')\r\n else:\r\n if M==x:\r\n for i in range(m):\r\n print('LU')\r\n for i in range(d):\r\n print('L')\r\n else:\r\n for i in range(m):\r\n print('LU')\r\n for i in range(d):\r\n print('U')\r\n \r\nelse:\r\n if a[1]>b[1]:\r\n if M==x:\r\n for i in range(m):\r\n print('RD')\r\n for i in range(d):\r\n print('R')\r\n else:\r\n for i in range(m):\r\n print('RD')\r\n for i in range(d):\r\n print('D')\r\n else:\r\n if M==x:\r\n for i in range(m):\r\n print('RU')\r\n for i in range(d):\r\n print('R')\r\n else:\r\n for i in range(m):\r\n print('RU')\r\n for i in range(d):\r\n print('U')\r\n \r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "x1,y1 = [ord(i)-48 for i in input()]\r\nx2,y2 = [ord(i)-48 for i in input()]\r\nmat = []\r\nwhile x1!=x2 or y1!=y2:\r\n s=\"\"\r\n if x2>x1:\r\n x1+=1\r\n s+=\"R\"\r\n if x2<x1:\r\n x1-=1\r\n s+=\"L\"\r\n if y2>y1:\r\n y1+=1\r\n s+=\"U\"\r\n if y2<y1:\r\n y1-=1\r\n s+=\"D\"\r\n mat.append(s)\r\n \r\nprint(len(mat))\r\nfor i in mat:\r\n print(i)\r\n", "s = input()\r\nt = input()\r\n\r\n\r\nval1 = ord(s[0])-ord(t[0])\r\nval2 = ord(s[1])-ord(t[1])\r\n\r\nm = max(abs(val1),abs(val2))\r\nn = min(abs(val1),abs(val2))\r\n\r\nif val1>0:\r\n st = \"L\"\r\nelse:\r\n st = \"R\"\r\nif val2>0:\r\n st1 = \"D\"\r\nelse:\r\n st1=\"U\"\r\nprint(m)\r\nfor i in range(m):\r\n if i< n:\r\n print(st+st1)\r\n else:\r\n if abs(val1)>abs(val2):\r\n print(st)\r\n else:\r\n print(st1)\r\n\r\n\r\n\r\n \r\n\r\n", "s = input()\r\nt = input()\r\n#pos = {'a' : 1, 'b' : 2, 'c' : 3, 'd' : 4,'e' : 5,'f' : 6,'g' : 7,'h' : 8}\r\nps = [(ord(s[0]) - 96), int(s[1])] \r\npt = [(ord(t[0]) - 96), int(t[1])]\r\ntt = ps\r\n\r\npath = []\r\nc = 0\r\n#sensing shortest part\r\nwhile(pt != tt):\r\n\tif(tt[0] == pt[0]):\r\n\t\tif(tt[1] < pt[1]):\r\n\t\t\ttt[1] = tt[1]+1\r\n\t\t\tpath.append(\"U\")\r\n\t\t\t\r\n\t\t\tc += 1\r\n\t\telif(tt[1] > pt[1]):\r\n\t\t\ttt[1] = tt[1]-1\r\n\t\t\tpath.append(\"D\")\r\n\t\t\tc += 1\r\n\t\t\t\r\n\telif(tt[1] == pt[1]):\r\n\t\tif(tt[0] < pt[0]):\r\n\t\t\ttt[0] = tt[0]+1\r\n\t\t\tpath.append(\"R\")\r\n\t\t\tc += 1\r\n\t\t\t\r\n\t\telif(tt[0] > pt[0]):\r\n\t\t\ttt[0] = tt[0]-1\r\n\t\t\tpath.append(\"L\")\r\n\t\t\tc += 1\r\n\t\t\t\r\n\telif(tt[0] < pt[0]) and (tt[1] < pt[1]):\r\n\t\ttt[0] = tt[0]+1\r\n\t\ttt[1] = tt[1]+1\r\n\t\tpath.append(\"RU\")\r\n\t\tc += 1\r\n\t\t\r\n\telif(tt[0] < pt[0]) and (tt[1] > pt[1]):\r\n\t\ttt[0] = tt[0]+1\r\n\t\ttt[1] = tt[1]-1\r\n\t\tpath.append(\"RD\")\r\n\t\tc += 1\r\n\t\t\r\n\r\n\telif(tt[0] > pt[0]) and (tt[1] < pt[1]):\r\n\t\ttt[0] = tt[0]-1\r\n\t\ttt[1] = tt[1]+1\r\n\t\tpath.append(\"LU\")\r\n\t\tc += 1\r\n\t\t\r\n\r\n\telif(tt[0] > pt[0]) and (tt[1] > pt[1]):\r\n\t\ttt[0] = tt[0]-1\r\n\t\ttt[1] = tt[1]-1\r\n\t\tpath.append(\"LD\")\r\n\t\tc += 1\r\n\t\t\r\n\t\r\nprint(c)\r\nfor i in range(c):\r\n\tprint(path[i])\t\t\t\r\n\t\t ", "d = {\"a\":1, \"b\":2, \"c\":3, \"d\":4, \"e\":5, \"f\":6, \"g\":7, \"h\":8}\r\nne = {\"a\":\"b\", \"b\":\"c\", \"c\":\"d\", \"d\":\"e\", \"e\":\"f\", \"f\":\"g\", \"g\":\"h\"}\r\npr = {\"h\":\"g\", \"g\":\"f\", \"f\":\"e\", \"e\":\"d\", \"d\":\"c\", \"c\":\"b\", \"b\":\"a\"}\r\ns = list(input())\r\nst = list(input())\r\nnum1 = int(s[1])\r\nnum2 = int(st[1])\r\nans = 0\r\nres = \"\"\r\n\r\nwhile True:\r\n if s[0] < st[0]:\r\n if num1 < num2:\r\n res += \"RU\\n\"\r\n num1 += 1\r\n s[0] = ne[s[0]]\r\n ans += 1\r\n elif num1 > num2:\r\n res += \"RD\\n\"\r\n num1 -= 1\r\n s[0] = ne[s[0]]\r\n ans += 1\r\n else:\r\n res += \"R\\n\"\r\n s[0] = ne[s[0]]\r\n ans += 1\r\n elif s[0] > st[0]:\r\n if num1 < num2:\r\n res += \"LU\\n\"\r\n num1 += 1\r\n s[0] = pr[s[0]]\r\n ans += 1\r\n elif num1 > num2:\r\n res += \"LD\\n\"\r\n num1 -= 1\r\n s[0] = pr[s[0]]\r\n ans += 1\r\n else:\r\n res += \"L\\n\"\r\n s[0] = pr[s[0]]\r\n ans += 1\r\n else:\r\n if num1 < num2:\r\n res += \"U\\n\"\r\n num1 += 1\r\n ans += 1\r\n elif num1 > num2:\r\n res += \"D\\n\"\r\n num1 -= 1\r\n ans += 1\r\n else:\r\n break\r\nprint(ans)\r\nprint(res)\r\n", "a = input()\r\nb = input()\r\n\r\nc = 'abcdefgh'\r\n\r\nx1, y1 = c.index(a[0]), int(a[1])\r\n\r\nx2, y2 = c.index(b[0]), int(b[1])\r\n\r\nprint(max(abs(x1 - x2), abs(y1 - y2)))\r\n\r\nx1 += 1\r\nx2 += 1\r\n\r\nx = x1\r\n\r\ny = y1\r\n\r\nwhile (x != x2 or y != y2):\r\n if x < x2 and y > y2:\r\n print('RD')\r\n x += 1\r\n y -= 1\r\n if x > x2 and y > y2:\r\n print('LD')\r\n x -= 1\r\n y -= 1\r\n if x < x2 and y < y2:\r\n print('RU')\r\n x += 1\r\n y += 1\r\n if x > x2 and y < y2:\r\n print('LU')\r\n x -= 1\r\n y += 1\r\n if x == x2:\r\n if y > y2:\r\n print('D')\r\n y -= 1\r\n elif y2 > y:\r\n print('U')\r\n y += 1\r\n if y == y2:\r\n if x > x2:\r\n print('L')\r\n x -= 1\r\n elif x2 > x:\r\n print('R')\r\n x += 1\r\n\n# Tue Jul 11 2023 12:37:18 GMT+0300 (Moscow Standard Time)\n", "# LUOGU_RID: 118875845\na = input() + input()\r\na, b = (ord(a[i]) - ord(a[i + 2]) for i in (0, 1))\r\nprint(max(a, -a, b, -b))\r\nwhile a != 0 or b != 0:\r\n r = ''\r\n if a < 0: r = 'R';a += 1\r\n if a > 0: r = 'L';a -= 1\r\n if b < 0: r += 'U';b += 1\r\n if b > 0: r += 'D';b -= 1\r\n print(r)", "import sys\n\ndef get_double_move(h,v):\n if h < 0 and v < 0:\n return 'LD'\n elif h > 0 and v < 0:\n return 'RD'\n elif h < 0 and v > 0:\n return 'LU'\n elif h > 0 and v > 0:\n return 'RU'\n\ndef get_single_move(h,v):\n if abs(h)>abs(v):\n if h > 0:\n return 'R'\n elif h < 0:\n return 'L'\n elif abs(h)<abs(v):\n if v < 0:\n return 'D'\n elif v > 0:\n return 'U'\n\nline1 = sys.stdin.readline()\nline2 = sys.stdin.readline()\n\ndx = int(ord(line2[0])-ord(line1[0]))\ndy = int(ord(line2[1])-ord(line1[1]))\ndouble = get_double_move(dx,dy)\nsingle = get_single_move(dx,dy)\n\nprint(max(abs(dx),abs(dy)))\nfor i in range(0,min(abs(dx),abs(dy))):\n print(double)\n\nfor i in range(min(abs(dx),abs(dy)), max(abs(dx),abs(dy))):\n print(single)\n", "def checkPath(row, col):\r\n li = []\r\n if row-1 >= 0 and not ar[row-1][col]:\r\n ar[row-1][col] = ar[row][col] + 1\r\n li.append([row-1, col])\r\n if col-1 >= 0 and not ar[row][col-1]:\r\n ar[row][col-1] = ar[row][col] + 1\r\n li.append([row, col-1])\r\n if row+1 < 8 and not ar[row+1][col]:\r\n ar[row+1][col] = ar[row][col] + 1\r\n li.append([row+1, col])\r\n if col+1 < 8 and not ar[row][col+1]:\r\n ar[row][col+1] = ar[row][col] + 1\r\n li.append([row, col+1])\r\n if row-1 >= 0 and col-1 >= 0 and not ar[row-1][col-1]:\r\n ar[row-1][col-1] = ar[row][col] + 1\r\n li.append([row-1, col-1])\r\n if row-1 >= 0 and col+1 < 8 and not ar[row-1][col+1]:\r\n ar[row-1][col+1] = ar[row][col] + 1\r\n li.append([row-1, col+1])\r\n if row+1 < 8 and col+1 < 8 and not ar[row+1][col+1]:\r\n ar[row+1][col+1] = ar[row][col] + 1\r\n li.append([row+1, col+1])\r\n if row+1 < 8 and col-1 >= 0 and not ar[row+1][col-1]:\r\n ar[row+1][col-1] = ar[row][col] + 1\r\n li.append([row+1, col-1])\r\n return li\r\n\r\n\r\nar = [[0]* 8 for _ in range(8)]\r\nstartp, startq = list(input().strip())\r\nstartx = ord('8') - ord(startq)\r\nstarty = ord(startp) - ord('a')\r\n\r\nendp, endq = list(input().strip())\r\nendx = ord('8') - ord(endq)\r\nendy = ord(endp) - ord('a')\r\n\r\nar[startx][starty] = 1\r\nli = checkPath(startx, starty)\r\nwhile li:\r\n t = []\r\n for m,n in li:\r\n if (m,n)==(endx,endy):\r\n t = []\r\n break\r\n t.extend(checkPath(m,n))\r\n li = t\r\n \r\nprint(ar[endx][endy]-1)\r\n\r\nli = []; idx = ar[endx][endy]\r\nrow, col = endx, endy\r\nwhile idx:\r\n idx -= 1\r\n if row-1 >= 0 and ar[row-1][col]==idx:\r\n li.append('D')\r\n row -= 1\r\n continue\r\n if col-1 >= 0 and ar[row][col-1]==idx:\r\n li.append('R')\r\n col -= 1\r\n continue\r\n if row+1 < 8 and ar[row+1][col]==idx:\r\n li.append('U')\r\n row += 1 \r\n continue\r\n if col+1 < 8 and ar[row][col+1]==idx:\r\n li.append('L')\r\n col += 1\r\n continue\r\n if row-1 >= 0 and col-1 >= 0 and ar[row-1][col-1]==idx:\r\n li.append('RD')\r\n row -= 1; col -= 1\r\n continue\r\n if row-1 >= 0 and col+1 < 8 and ar[row-1][col+1]==idx:\r\n li.append('LD')\r\n row -= 1; col += 1\r\n continue\r\n if row+1 < 8 and col+1 < 8 and ar[row+1][col+1]==idx:\r\n li.append('LU')\r\n row += 1; col += 1\r\n continue\r\n if row+1 < 8 and col-1 >= 0 and ar[row+1][col-1]==idx:\r\n li.append('RU')\r\n row += 1; col -= 1\r\n continue\r\n\r\nli.reverse()\r\nfor item in li:\r\n print(item)\r\n", "a = input()\r\nb = input()\r\na = [a[0], int(a[1])]\r\nb = [b[0], int(b[1])]\r\npoints = ['a', 'b', 'c', 'd', 'e', 'f', 'g', 'h']\r\nb[0] = points.index(b[0]) + 1\r\na[0] = points.index(a[0]) + 1\r\nprint(max(abs(a[0] - b[0]), abs(a[1] - b[1])))\r\nwhile a[0] != b[0] or a[1] != b[1]:\r\n\tif a[0] < b[0]:\r\n\t\tprint('R', end='')\r\n\t\ta[0] += 1\r\n\telif a[0] > b[0]:\r\n\t\tprint('L', end='')\r\n\t\ta[0] -= 1\r\n\tif a[1] < b[1]:\r\n\t\tprint('U', end='')\r\n\t\ta[1] += 1\r\n\telif a[1] > b[1]:\r\n\t\tprint('D', end='')\r\n\t\ta[1] -= 1\r\n\tprint()", "# LUOGU_RID: 101903300\ns = input()\r\nt = input()\r\nif s[0] < t[0]:\r\n x = 'R'\r\nelse:\r\n x = 'L'\r\nif s[1] < t[1]:\r\n y = 'U'\r\nelse:\r\n y = 'D'\r\nans = []\r\nc = max(abs(ord(s[0]) - ord(t[0])), abs(ord(s[1]) - ord(t[1])))\r\nd = abs(ord(s[0]) - ord(t[0]))\r\ne = abs(ord(s[1]) - ord(t[1]))\r\nfor _ in range(c):\r\n a = ''\r\n if d:\r\n a += x\r\n d -= 1\r\n if e:\r\n a += y\r\n e -= 1\r\n ans += a,\r\nprint(c, *ans, sep='\\n')", "s = input()\nt = input()\nd1 = 'L' if s[0] > t[0] else 'R'\nd2 = 'D' if s[1] > t[1] else 'U'\ndiff1, diff2 = abs(ord(s[0]) - ord(t[0])), abs(ord(s[1]) - ord(t[1]))\nprint(max(diff1, diff2))\nwhile diff1 > 0 or diff2 > 0:\n if diff1 > 0:\n print(d1, end='')\n diff1 -= 1\n if diff2 > 0:\n print(d2, end='')\n diff2 -= 1\n print()\n", "s1 = input()\r\ns2 = input()\r\nb = int(s1[1])\r\nd = int(s2[1])\r\n\r\nif s1[0] == \"a\":\r\n a = 1\r\nif s1[0] == \"b\":\r\n a = 2\r\nif s1[0] == \"c\":\r\n a = 3\r\nif s1[0] == \"d\":\r\n a = 4\r\nif s1[0] == \"e\":\r\n a = 5\r\nif s1[0] == \"f\":\r\n a = 6\r\nif s1[0] == \"g\":\r\n a = 7\r\nif s1[0] == \"h\":\r\n a = 8\r\n\r\n\r\nif s2[0] == \"a\":\r\n c = 1\r\nif s2[0] == \"b\":\r\n c = 2\r\nif s2[0] == \"c\":\r\n c = 3\r\nif s2[0] == \"d\":\r\n c = 4\r\nif s2[0] == \"e\":\r\n c = 5\r\nif s2[0] == \"f\":\r\n c = 6\r\nif s2[0] == \"g\":\r\n c = 7\r\nif s2[0] == \"h\":\r\n c = 8\r\n\r\n\r\n\r\nlist1 = []\r\nwhile c != a and b != d:\r\n s = \"\"\r\n if a < c:\r\n a += 1\r\n s += \"R\"\r\n else:\r\n a -= 1\r\n s += \"L\"\r\n\r\n if b > d:\r\n b -= 1\r\n s += \"D\"\r\n else:\r\n b += 1\r\n s += \"U\"\r\n\r\n list1.append(s)\r\n\r\n\r\nwhile b < d:\r\n b += 1\r\n list1.append(\"U\")\r\n\r\nwhile b > d:\r\n b -= 1\r\n list1.append(\"D\")\r\n\r\nwhile a < c:\r\n a += 1\r\n list1.append(\"R\")\r\n\r\nwhile c < a:\r\n a -= 1\r\n list1.append(\"L\")\r\n\r\nprint(len(list1))\r\nfor i in list1:\r\n print(i)\n# Tue Jul 11 2023 11:42:11 GMT+0300 (Moscow Standard Time)\n", "s, t = (input() for _ in range(2))\ndef pos_to_xy(p):\n return ord(p[0]) - ord(\"a\"), 8 - int(p[1])\nsx, sy = pos_to_xy(s)\ntx, ty = pos_to_xy(t)\ndx, dy = tx - sx, ty - sy\nres = []\nwhile dx != 0 or dy != 0:\n if dx != 0 and dy != 0:\n if dx > 0 and dy > 0:\n res.append(\"RD\")\n dx -= 1\n dy -= 1\n if dx < 0 and dy < 0:\n res.append(\"LU\")\n dx += 1\n dy += 1\n if dx > 0 and dy < 0:\n res.append(\"RU\")\n dx -= 1\n dy += 1\n if dx < 0 and dy > 0:\n res.append(\"LD\")\n dx += 1\n dy -= 1\n elif dy != 0:\n res.append(\"D\" if dy > 0 else \"U\")\n dy += -1 if dy > 0 else 1\n elif dx != 0:\n res.append(\"R\" if dx > 0 else \"L\")\n dx += -1 if dx > 0 else 1\nprint(len(res))\nprint(*res, sep=\"\\n\")\n", "currPos = input()\r\ntargetPos = input()\r\nstep = []\r\n\r\ncurrCol = currPos[0]\r\ncurrRow = currPos[1]\r\n\r\nwhile True:\r\n if (ord(currCol) < ord(targetPos[0]) and ord(currRow) < ord(targetPos[1])):\r\n step.append(\"RU\")\r\n currCol = chr(ord(currCol)+1)\r\n currRow = chr(ord(currRow)+1)\r\n elif (ord(currCol) < ord(targetPos[0]) and ord(currRow) == ord(targetPos[1])):\r\n step.append(\"R\")\r\n currCol = chr(ord(currCol)+1)\r\n elif (ord(currCol) < ord(targetPos[0]) and ord(currRow) > ord(targetPos[1])):\r\n step.append(\"RD\")\r\n currCol = chr(ord(currCol)+1)\r\n currRow = chr(ord(currRow)-1)\r\n elif (ord(currCol) == ord(targetPos[0]) and ord(currRow) > ord(targetPos[1])):\r\n step.append(\"D\")\r\n currRow = chr(ord(currRow)-1)\r\n elif (ord(currCol) > ord(targetPos[0]) and ord(currRow) > ord(targetPos[1])):\r\n step.append(\"LD\")\r\n currCol = chr(ord(currCol)-1)\r\n currRow = chr(ord(currRow)-1)\r\n elif (ord(currCol) > ord(targetPos[0]) and ord(currRow) == ord(targetPos[1])):\r\n step.append(\"L\")\r\n currCol = chr(ord(currCol)-1)\r\n elif (ord(currCol) > ord(targetPos[0]) and ord(currRow) < ord(targetPos[1])):\r\n step.append(\"LU\")\r\n currCol = chr(ord(currCol)-1)\r\n currRow = chr(ord(currRow)+1)\r\n elif (ord(currCol) == ord(targetPos[0]) and ord(currRow) < ord(targetPos[1])):\r\n step.append(\"U\")\r\n currRow = chr(ord(currRow)+1)\r\n if (ord(currCol) == ord(targetPos[0]) and ord(currRow) == ord(targetPos[1])):\r\n break\r\n\r\nprint(len(step))\r\nfor element in step:\r\n print(element)", "a=input()\r\nb=input()\r\nc=8\r\n\r\nprint(max(max(ord(a[0]),ord(b[0]))-min(ord(a[0]),ord(b[0])),max(int(a[1]),int(b[1]))-min(int(a[1]),int(b[1]))))\r\nd=ord(a[0])-ord(b[0])\r\ne=int(a[1])-int(b[1])\r\nwhile c>0:\r\n c-=1\r\n if d<0:\r\n if d!=0:\r\n d+=1\r\n print(\"R\",end=\"\")\r\n if d>0:\r\n print(\"L\",end=\"\")\r\n d-=1\r\n if e<0:\r\n print(\"U\",end=\"\")\r\n e+=1\r\n if e>0:\r\n e-=1\r\n print(\"D\",end=\"\")\r\n print()\r\n\r\n\r\n\r\n", "def get_moves(s, t):\r\n moves = []\r\n cur_col, cur_row = ord(s[0]) - ord('a'), int(s[1])\r\n target_col, target_row = ord(t[0]) - ord('a'), int(t[1])\r\n \r\n while cur_col != target_col or cur_row != target_row:\r\n move = \"\"\r\n if cur_col < target_col:\r\n move += \"R\"\r\n cur_col += 1\r\n elif cur_col > target_col:\r\n move += \"L\"\r\n cur_col -= 1\r\n \r\n if cur_row < target_row:\r\n move += \"U\"\r\n cur_row += 1\r\n elif cur_row > target_row:\r\n move += \"D\"\r\n cur_row -= 1\r\n \r\n moves.append(move)\r\n \r\n return moves\r\n\r\ndef main():\r\n # Read input\r\n s = input().strip()\r\n t = input().strip()\r\n\r\n # Calculate moves\r\n moves = get_moves(s, t)\r\n\r\n # Print output\r\n print(len(moves))\r\n for move in moves:\r\n print(move)\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "start = input()\r\nend = input()\r\nstart = (ord(start[0]) - ord('a'), int(start[1]) - 1)\r\nend = (ord(end[0]) - ord('a'), int(end[1]) - 1)\r\ndx = end[0] - start[0]\r\ndy = end[1] - start[1]\r\nprint(max(abs(dx), abs(dy)))\r\nwhile dx or dy:\r\n move = \"\"\r\n if dx > 0:\r\n dx -= 1\r\n move += \"R\"\r\n if dx < 0:\r\n dx += 1\r\n move += \"L\"\r\n if dy > 0:\r\n dy -= 1\r\n move += \"U\"\r\n if dy < 0:\r\n dy += 1\r\n move += \"D\"\r\n print(move)", "# LUOGU_RID: 131044147\nimport sys\r\ninput = lambda:sys.stdin.readline().strip()\r\na = input()+input()\r\na,b = (ord(a[i]) - ord(a[i+2]) for i in range(2))\r\nprint(max(a,-a,b,-b))\r\nwhile a != 0 or b != 0:\r\n r = ''\r\n if a < 0:\r\n r = 'R'\r\n a += 1\r\n if a > 0:\r\n r = 'L'\r\n a -= 1\r\n if b < 0:\r\n r += 'U'\r\n b += 1\r\n if b > 0:\r\n r += 'D'\r\n b -= 1\r\n print(r)", "def shortest_path_of_the_king():\n rei_current = input()\n rei_future = input()\n\n rei_current = [ord(rei_current[0])-96, int(rei_current[1])]\n rei_future = [ord(rei_future[0])-96, int(rei_future[1])]\n\n movements = 0\n mov_history = []\n\n while(rei_current[0]!=rei_future[0] or rei_current[1]!=rei_future[1]):\n movements += 1\n if(rei_current[0]<rei_future[0]):\n if(rei_current[1]<rei_future[1]):\n rei_current[0]+=1\n rei_current[1]+=1\n mov_history.append('RU')\n elif(rei_current[1]>rei_future[1]):\n rei_current[0]+=1\n rei_current[1]-=1\n mov_history.append('RD')\n else:\n rei_current[0]+=1\n mov_history.append('R')\n elif(rei_current[0] > rei_future[0]):\n if(rei_current[1] < rei_future[1]):\n rei_current[0]-=1\n rei_current[1]+=1\n mov_history.append('LU')\n elif(rei_current[1] > rei_future[1]):\n rei_current[0]-=1\n rei_current[1]-=1\n mov_history.append('LD')\n else:\n rei_current[0]-=1\n mov_history.append('L')\n elif(rei_current[0]==rei_future[0]):\n if(rei_current[1]<rei_future[1]):\n rei_current[1]+=1\n mov_history.append('U')\n else:\n rei_current[1]-=1\n mov_history.append('D')\n print(movements)\n for m in mov_history:\n print(m)\n\n\nshortest_path_of_the_king()\n \t \t\t\t\t\t\t\t\t\t \t \t\t\t \t\t \t\t", "c = \" abcdefgh\"\r\ns = input()\r\ns = [c.index(s[0]), int(s[1])]\r\nt = input()\r\nt = [c.index(t[0]), int(t[1])]\r\n\r\nst = \"\"\r\nif s[0] < t[0] and s[1] < t[1]:\r\n while s[0] != t[0] and s[1] != t[1]:\r\n st += \"RU\\n\"\r\n s[0] += 1\r\n s[1] += 1\r\n if s[0] == t[0]:\r\n for i in range(t[1] - s[1]):\r\n st += \"U\\n\"\r\n elif s[1] == t[1]:\r\n for i in range(t[0] - s[0]):\r\n st += \"R\\n\"\r\nelif s[0] < t[0] and s[1] == t[1]:\r\n for i in range(t[0] - s[0]):\r\n st += 'R\\n'\r\nelif s[0] < t[0] and s[1] > t[1]:\r\n while s[0] != t[0] and s[1] != t[1]:\r\n st += \"RD\\n\"\r\n s[0] += 1\r\n s[1] -= 1\r\n if s[0] == t[0]:\r\n for i in range(s[1] - t[1]):\r\n st += 'D\\n'\r\n elif s[1] == t[1]:\r\n for i in range(t[0] - s[0]):\r\n st += 'R\\n'\r\nelif s[0] == t[0] and s[1] < t[1]:\r\n for i in range(t[1] - s[1]):\r\n st += 'U\\n'\r\nelif s[0] == t[0] and s[1] > t[1]:\r\n for i in range(s[1] - t[1]):\r\n st += 'U\\n'\r\nelif s[0] > t[0] and s[1] < t[1]:\r\n while s[0] != t[0] and s[1] != t[1]:\r\n st += \"LU\\n\"\r\n s[0] -= 1\r\n s[1] += 1\r\n if s[0] == t[0]:\r\n for i in range(t[1] - s[1]):\r\n st += 'U\\n'\r\n elif s[1] == t[1]:\r\n for i in range(s[0] - t[0]):\r\n st += 'L\\n'\r\nelif s[0] > t[0] and s[1] == t[1]:\r\n for i in range(s[0] - t[0]):\r\n st += 'L\\n'\r\nelif s[0] > t[0] and s[1] > t[1]:\r\n while s[0] != t[0] and s[1] != t[1]:\r\n st += \"LD\\n\"\r\n s[0] -= 1\r\n s[1] -= 1\r\n if s[0] == t[0]:\r\n for i in range(s[1] - t[1]):\r\n st += 'D\\n'\r\n elif s[1] == t[1]:\r\n for i in range(s[0] - t[0]):\r\n st += 'L\\n'\r\nprint(st.count(\"\\n\"))\r\nprint(st)\r\n", "a=list(input())\r\na[1]=int(a[1])-1\r\na[0]=ord(a[0])-97\r\n\r\nb=list(input())\r\nb[1]=int(b[1])-1\r\nb[0]=ord(b[0])-97\r\n\r\nprint(max(abs(a[1]-b[1]),abs(a[0]-b[0])))\r\nwhile a!=b:\r\n dd=''\r\n if a[0]<b[0]:\r\n dd+='R'\r\n a[0]+=1\r\n elif a[0]>b[0]:\r\n dd+='L'\r\n a[0]-=1\r\n \r\n if a[1]>b[1]:\r\n dd+='D'\r\n a[1]-=1\r\n elif a[1]<b[1]:\r\n dd+='U'\r\n a[1]+=1\r\n print(dd)\r\n\r\n \r\n\r\n \r\n \r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n \r\n\r\n\r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Sun Jun 14 20:29:09 2020\r\n\r\n@author: yogendra jaiswal\r\n\"\"\"\r\n\r\ncol_map = {'a': 0, 'b': 1, 'c': 2,\r\n 'd': 3, 'e': 4, 'f': 5,\r\n 'g': 6, 'h': 7}\r\n\r\ndef index(cell):\r\n global col_map\r\n return (col_map[cell[0]], 8 - int(cell[1]))\r\n\r\ns = input()\r\nt = input()\r\n\r\ns = index(s)\r\nt = index(t)\r\n\r\nstep_map = {'L': (-1, 0), 'R': (1, 0),\r\n 'U': (0, -1), 'D': (0, 1),\r\n 'LU': (-1, -1), 'RU': (1, -1),\r\n 'LD': (-1, 1), 'RD': (1, 1)}\r\n\r\ndef dist(s, t):\r\n return (s[0] - t[0]) ** 2 + (s[1] - t[1]) ** 2\r\n\r\ndef best_step(s, t):\r\n min_dis = 9999\r\n step_ = None\r\n for step, change in step_map.items():\r\n if dist((s[0] + change[0], s[1] + change[1]), t) < min_dis:\r\n min_dis = dist((s[0] + change[0], s[1] + change[1]), t)\r\n step_ = step\r\n return step_\r\n\r\ncurr_dis = dist(s, t)\r\nsteps = []\r\n\r\nwhile curr_dis:\r\n step_ = best_step(s, t)\r\n change = step_map[step_]\r\n s = (s[0] + change[0], s[1] + change[1])\r\n steps.append(step_)\r\n curr_dis = dist(s, t)\r\n\r\nprint(len(steps))\r\nfor i in steps:\r\n print(i)\r\n \r\n ", "#----------------------------\n# Matheus de Souza Oliveira |\n# RA: 203407 |\n#----------------------------\n\ns = [char for char in input()]\nt = [char for char in input()]\n\ns = [ord(s[0]), int(s[1])]\nt = [ord(t[0]), int(t[1])]\n\nn = max(abs(s[0] - t[0]), abs(s[1] - t[1]))\nprint(n)\n\nwhile s != t:\n move = \"\"\n\n if s[0] < t[0]:\n move += \"R\"\n s[0] += 1\n\n elif s[0] > t[0]:\n move += \"L\"\n s[0] -= 1\n\n if s[1] < t[1]:\n move += \"U\"\n s[1] += 1\n\n elif s[1] > t[1]:\n move +=\"D\"\n s[1] -= 1\n\n print(move)\n\t \t\t \t \t \t \t \t \t\t\t \t\t\t\t\t \t\t", "x, y = input()\r\nx2, y2 = input()\r\nx, y = ord(x), int(y)\r\nx2, y2 = ord(x2), int(y2)\r\nN = max(abs(x - x2), abs(y - y2))\r\nprint(N)\r\nfor i in range(N):\r\n if x < x2:\r\n x += 1\r\n a = \"R\"\r\n elif x > x2:\r\n x -= 1\r\n a = \"L\"\r\n else: a = \"\"\r\n if y < y2:\r\n y += 1\r\n b = \"U\"\r\n elif y > y2:\r\n y -= 1\r\n b = \"D\"\r\n else: b = \"\"\r\n print(a + b)", "s = input()\nt = input()\n\nend=crr=[]\n\ncrr = ord(s[0])-96,int(s[1]) \nend = ord(t[0])-96,int(t[1])\n\na=crr[0]-end[0]\nb=crr[1]-end[1]\n\nprint(max(a,-a,b,-b))\n\nwhile(a or b != 0):\n\t\tp=\"\"\n\t\tif a<0: p=\"R\";a+=1;\n\t\tif a>0: p=\"L\";a-=1;\n\t\tif b<0: p+=\"U\";b+=1;\n\t\tif b>0: p+=\"D\";b-=1;\n\t\tprint(p) ", "import queue\r\ndef adjv(v):\r\n if(v[0] > 0):\r\n yield((v[0] - 1, v[1]))\r\n if(v[0] < 7):\r\n yield((v[0] + 1, v[1]))\r\n if(v[1] > 0):\r\n yield((v[0], v[1] - 1))\r\n if(v[1] < 7):\r\n yield((v[0], v[1] + 1))\r\n if((v[0] > 0) and (v[1] > 0)):\r\n yield((v[0] - 1, v[1] - 1))\r\n if((v[0] < 7) and (v[1] < 7)):\r\n yield((v[0] + 1, v[1] + 1))\r\n if((v[0] > 0) and (v[1] < 7)):\r\n yield((v[0] - 1, v[1] + 1))\r\n if((v[0] < 7) and (v[1] > 0)):\r\n yield((v[0] + 1, v[1] - 1))\r\n\r\ndef sp(sr, tr):\r\n dist = dict()\r\n prev = dict()\r\n for i in range(8):\r\n for j in range(8):\r\n dist[(i,j)] = float(\"inf\")\r\n prev[(i,j)] = None\r\n dist[sr] = 0\r\n prev[sr] = None\r\n q = queue.Queue(maxsize = 0)\r\n q.put(sr)\r\n while(not(q.empty())):\r\n cv = q.get()\r\n for nv in adjv(cv):\r\n nl = dist[cv] + 1 \r\n if(nl < dist[nv]):\r\n dist[nv] = nl\r\n prev[nv] = cv\r\n q.put(nv)\r\n print(dist[tr])\r\n rt = list()\r\n pv = prev[tr]\r\n while(pv):\r\n if((pv[0] < tr[0]) and (pv[1] < tr[1])):\r\n rt.append(\"RU\")\r\n elif((pv[0] > tr[0]) and (pv[1] > tr[1])):\r\n rt.append(\"LD\")\r\n elif((pv[0] > tr[0]) and (pv[1] < tr[1])):\r\n rt.append(\"LU\")\r\n elif((pv[0] < tr[0]) and (pv[1] > tr[1])):\r\n rt.append(\"RD\")\r\n elif((pv[0] < tr[0]) and (pv[1] == tr[1])):\r\n rt.append(\"R\")\r\n elif((pv[0] > tr[0]) and (pv[1] == tr[1])):\r\n rt.append(\"L\")\r\n elif((pv[0] == tr[0]) and (pv[1] < tr[1])):\r\n rt.append(\"U\")\r\n elif((pv[0] == tr[0]) and (pv[1] > tr[1])):\r\n rt.append(\"D\")\r\n else:\r\n rt.append(\"\")\r\n tr = pv\r\n pv = prev[tr]\r\n for move in reversed(rt):\r\n print(move)\r\n\r\nl1 = input().strip()\r\nl2 = input().strip()\r\n\r\nx1 = ord(l1[0]) - 97\r\ny1 = int(l1[1]) - 1\r\n\r\nx2 = ord(l2[0]) - 97\r\ny2 = int(l2[1]) - 1\r\n\r\nsp((x1, y1), (x2, y2))", "def get_king_moves(start, end):\r\n # 将棋盘坐标转换为行列索引\r\n start_col = ord(start[0]) - ord('a')\r\n start_row = int(start[1]) - 1\r\n end_col = ord(end[0]) - ord('a')\r\n end_row = int(end[1]) - 1\r\n\r\n # 计算行和列的差值\r\n col_diff = end_col - start_col\r\n row_diff = end_row - start_row\r\n\r\n # 计算最小步数\r\n min_steps = max(abs(col_diff), abs(row_diff))\r\n\r\n # 存储移动步骤的列表\r\n moves = []\r\n\r\n # 根据行和列的差值确定移动步骤\r\n for i in range(min_steps):\r\n move = ''\r\n if col_diff > 0:\r\n move += 'R'\r\n col_diff -= 1\r\n elif col_diff < 0:\r\n move += 'L'\r\n col_diff += 1\r\n\r\n if row_diff > 0:\r\n move += 'U'\r\n row_diff -= 1\r\n elif row_diff < 0:\r\n move += 'D'\r\n row_diff += 1\r\n\r\n moves.append(move)\r\n\r\n # 输出最小步数和移动步骤\r\n print(min_steps)\r\n for move in moves:\r\n print(move)\r\n\r\n\r\n# 测试示例\r\nstart = input(\"\")\r\nend = input(\"\")\r\nget_king_moves(start, end)\r\n", "s=input()\r\nt=input()\r\nx=ord(s[0])-ord(t[0])\r\ny=ord(s[1])-ord(t[1])\r\nprint(max(abs(x),abs(y)))\r\nwhile x!=0 or y!=0:\r\n ans=''\r\n if x<0:\r\n ans='R'\r\n x+=1\r\n elif x>0:\r\n ans='L'\r\n x-=1\r\n if y<0:\r\n ans+='U'\r\n y+=1\r\n elif y>0:\r\n ans+='D'\r\n y-=1\r\n print(ans)", "import re\r\n\r\n#2行 \r\n\r\nline1 = input().split('\\n')[0]\r\nline2 = input().split('\\n')[0]\r\n\r\n\r\n#qu取数字 字符 \r\n\r\ncharacter1 = ''.join(re.findall(r'[a-z]',line1)) # 取字母 \r\nnum1 = re.sub('\\D','',line1) # 取数字\r\n\r\ncharacter2 = ''.join(re.findall(r'[a-z]',line2)) # 取字母 \r\nnum2 = re.sub('\\D','',line2) # 取数字\r\n\r\n# 计算 ord()为反向 chr函数 \r\naxis0 = int(ord(character2))-int(ord(character1))\r\naxis1 = int(num2)-int(num1)\r\n\r\nif axis0>0:\r\n r = 'R'\r\nelif axis0 == 0:\r\n r = ''\r\nelse:\r\n r = 'L'\r\n \r\nif axis1 > 0:\r\n c = 'U'\r\nelif axis1 == 0:\r\n c = ''\r\nelse:\r\n c = 'D'\r\n\r\nR = []\r\nC = []\r\nfor i in range(0, abs(axis0)):\r\n R.append(r)\r\n\r\nfor i in range(0, abs(axis1)):\r\n C.append(c) \r\n\r\nnewlist = []\r\nnewlist = [R[i]+C[i] for i in range(0,min(len(R), len(C)))] \r\n\r\ndef findL(x,y): #找出 R C 中较长的 \r\n if len(x)>len(y):\r\n return x\r\n else:\r\n return y\r\n\r\nlonglist = findL(R,C)\r\n# 替换newlist in longlist 的部分 \r\nfor i in range(0, len(newlist)):\r\n longlist[i] = newlist[i]\r\n \r\nprint(len(longlist))\r\nfor item in longlist:\r\n print(item) \r\n\r\n", "d = {\"a\" : 1, \"b\" : 2, \"c\" : 3, \"d\" : 4, \"e\" : 5, \"f\" : 6, \"g\" : 7, \"h\" : 8}\nvar = input()\n(sv, sr) = var[0], int(var[1])# v on täht, s on number\nvar = input()\n(tv, tr) = var[0], int(var[1])\nsv = d[sv]\ntv = d[tv]\n#print(sv, tv)\nprint(max(abs(sv - tv), abs(sr - tr)))\nfor i in range(max(abs(sv - tv), abs(sr - tr))):\n if sv < tv:\n print(\"R\", end = \"\")\n sv+= 1\n elif sv > tv:\n print(\"L\", end = \"\")\n sv -= 1\n if sr < tr:\n print(\"U\", end = \"\")\n sr += 1\n elif sr > tr:\n print(\"D\", end = \"\")\n sr -= 1\n print(end = \"\\n\")", "a,b=input()\r\na=ord(a)-96\r\na=int(a)\r\nb=int(b)\r\n\r\n\r\nc,d=input()\r\nc=ord(c)-96\r\nd=int(d)\r\nans=0\r\n\r\n\r\nans=(a-c)+(b-d)\r\nx,y=a-c,b-d\r\nprint(max(abs(x),abs(y)))\r\n\r\nwhile x!=0 or y!=0:\r\n r=''\r\n if x<0:r=\"R\";x+=1\r\n if x>0:r=\"L\";x-=1\r\n if y<0:r+='U';y+=1\r\n if y>0:r+='D';y-=1\r\n print(r)", "steps = []\ncount = 0\nstep = ['', 'a', 'b', 'c', 'd', 'e', 'f', 'g', 'h']\n\ns = input()\nt = input()\n\nsx = step.index( s[0] )\nsy = int( s[1] )\ntx = step.index( t[0] )\nty = int( t[1] )\n\nwhile ( sx != tx or sy != ty ):\n count = count + 1\n if ( sx > tx ):\n if ( sy > ty ):\n steps.append( 'LD' )\n sy = sy - 1\n elif ( sy < ty ):\n steps.append( 'LU' )\n sy = sy + 1\n else:\n steps.append( 'L' )\n sx = sx - 1\n elif ( sx < tx ):\n if ( sy > ty ):\n steps.append( 'RD' )\n sy = sy - 1\n elif ( sy < ty ):\n steps.append( 'RU' )\n sy = sy + 1\n else:\n steps.append( 'R' )\n sx = sx + 1\n else:\n if ( sy > ty ):\n steps.append( 'D' )\n sy = sy - 1\n elif ( sy < ty ):\n steps.append( 'U' )\n sy = sy + 1\nprint( count )\nfor i in steps:\n print( i )\n", "# Submitted using https://github.com/Nirlep5252/codeforces-cli\n# >.<\n\nlol = \"abcdefgh\"\ns1 = input()\ns2 = input()\n\np1 = s1.replace(s1[0], str(lol.find(s1[0]) + 1))\np2 = s2.replace(s2[0], str(lol.find(s2[0]) + 1))\n\np1 = list(map(int, list(p1)))\np2 = list(map(int, list(p2)))\n\n# print(p1, p2)\n\nR = p2[0] - p1[0]\nD = p1[1] - p2[1]\n\n# print(R, D)\n\ncommon = min(abs(R), abs(D))\ndiff = abs(abs(R) - abs(D))\ncond = abs(R) > abs(D)\nx = \"R\" if R >= 0 else \"L\"\ny = \"D\" if D >= 0 else \"U\"\nt = (x + y)\n\nprint(common + diff)\nif common:\n print(*[t for _ in range(common)], sep='\\n')\nif diff:\n print(*[x if cond else y for _ in range(diff)], sep='\\n')\n\n", "s = input()\r\nt = input()\r\na, b = ord(s[0]) - ord(t[0]), ord(s[1]) - ord(t[1])\r\nprint(max(a, -a, b, -b))\r\nwhile a != 0 or b != 0:\r\n p = ''\r\n if a > 0: p += 'L';a -= 1\r\n if a < 0: p += 'R';a += 1\r\n if b > 0: p += 'D';b -= 1\r\n if b < 0: p += 'U';b += 1\r\n print(p)", "s = input().rstrip()\nstart = [ord(s[0]) - ord('a'), int(s[1]) - 1]\ns = input().rstrip()\nend = [ord(s[0]) - ord('a'), int(s[1]) - 1]\n\nsign = lambda x : 0 if x == 0 else x // abs(x)\n\nmoves = { (1, 1) : 'RU', (1,-1) : 'RD', (-1, 1) : 'LU', (-1, -1) : 'LD',\n (0, 1) : 'U', (0, -1) : 'D', (1, 0) : 'R', (-1, 0) : 'L'}\nres = []\nwhile start != end:\n k = (sign(end[0] - start[0]), sign(end[1] - start[1]))\n start[0] += k[0]\n start[1] += k[1]\n res.append(moves[k])\n\nprint(len(res))\nfor c in res: print(c)\n", "n = input()\r\nstart = [ord(n[0])-96,int(n[1])]\r\nn = input()\r\nend = [ord(n[0])-96,int(n[1])]\r\nroute = [end[i] - start[i] for i in [0,1]]\r\nprint(int(min(abs(route[0]), abs(route[1]))+abs(abs(route[0]) - abs(route[1]))))\r\na = 'R' if route[0]>0 else 'L'\r\na += 'U' if route[1] > 0 else 'D'\r\nfor i in range(min(abs(route[0]), abs(route[1]))):\r\n print(a)\r\nif abs(route[0]) > abs(route[1]):\r\n for i in range(abs(abs(route[0]) - abs(route[1]))):\r\n print('L' if route[0]<0 else 'R')\r\nelif abs(route[0]) < abs(route[1]):\r\n for i in range(abs(abs(route[0]) - abs(route[1]))):\r\n print('D' if route[1]<0 else 'U')\r\n", "s = list(input())\r\nt = list(input())\r\n\r\ndef move(s, t):\r\n s[1] = int(s[1])\r\n t[1] = int(t[1])\r\n if s[0]<t[0]:\r\n if s[1]<t[1]:\r\n step = 'RU'\r\n ord_after_move_x = ord(s[0]) + 1\r\n s[0] = chr(ord_after_move_x)\r\n s[1] = s[1]+1\r\n elif s[1]>t[1]:\r\n step = 'RD'\r\n ord_after_move_x = ord(s[0]) + 1\r\n s[0] = chr(ord_after_move_x)\r\n s[1] = s[1] - 1\r\n else:\r\n step = 'R'\r\n ord_after_move_x = ord(s[0]) + 1\r\n s[0] = chr(ord_after_move_x)\r\n elif s[0]>t[0]:\r\n if s[1]<t[1]:\r\n step = 'LU'\r\n ord_after_move_x = ord(s[0]) - 1\r\n s[0] = chr(ord_after_move_x)\r\n s[1] = s[1] + 1\r\n elif s[1]>t[1]:\r\n step = 'LD'\r\n ord_after_move_x = ord(s[0]) - 1\r\n s[0] = chr(ord_after_move_x)\r\n s[1] = s[1] - 1\r\n else:\r\n step = 'L'\r\n ord_after_move_x = ord(s[0]) - 1\r\n s[0] = chr(ord_after_move_x)\r\n else:\r\n if s[1]>t[1]:\r\n step = 'D'\r\n s[1] = s[1] - 1\r\n elif s[1] < t[1]:\r\n step = 'U'\r\n s[1] = s[1] + 1\r\n return step\r\n\r\nstep_x = abs(ord(s[0]) - ord(t[0]))\r\nstep_y = abs(ord(s[1]) - ord(t[1]))\r\nstep = max(step_x,step_y)\r\nprint(step)\r\nfor i in range(step):\r\n print(move(s,t))", "\ns = input()\nt = input()\n\nlevel = ord(t[0]) - ord(s[0])\nvertical = int(t[1]) - int(s[1])\n\nsteps = max(abs(vertical), abs(level))\nprint(steps)\n\nwhile level or vertical:\n step = \"\"\n if level > 0:\n level -= 1\n step += \"R\"\n if level < 0:\n level += 1\n step += \"L\"\n if vertical > 0:\n vertical -= 1\n step += \"U\"\n if vertical < 0:\n vertical += 1\n step += \"D\"\n print(step)\n\n", "s = input()\r\na1 = ord(s[0]) - ord('a') + 1\r\nb1 = int(s[1])\r\ns = input()\r\na2 = ord(s[0]) - ord('a') + 1\r\nb2 = int(s[1])\r\nm = max(abs(a1-a2),abs(b1-b2))\r\nprint(m)\r\nwhile a1 != a2 or b1 != b2:\r\n if a2 > a1:\r\n if b2 > b1:\r\n b1+=1\r\n a1+=1\r\n print('RU')\r\n elif b2 == b1:\r\n a1 += 1\r\n print('R')\r\n else:\r\n a1+=1\r\n b1-=1\r\n print('RD')\r\n elif a2 == a1:\r\n if b2 > b1:\r\n b1+=1\r\n print('U')\r\n elif b2 < b1:\r\n b1-=1\r\n print('D')\r\n else:\r\n if b2 > b1:\r\n b1+=1\r\n a1-=1\r\n print('LU')\r\n elif b2 == b1:\r\n a1 -= 1\r\n print('L')\r\n else:\r\n a1-=1\r\n b1-=1\r\n print('LD')", "start_x, start_y = map(str,input())\nend_x, end_y = map(str, input())\nd = {'a':1, 'b':2, 'c':3, 'd':4, 'e':5, 'f':6, 'g':7, 'h':8}\nmoves = ['','','','','','','','']\nif d[end_x] > d[start_x]:\n for i in range(d[end_x] - d[start_x]):\n moves[i]=moves[i]+'R'\nelif d[end_x] < d[start_x]:\n for i in range(d[start_x] - d[end_x]):\n moves[i]=moves[i]+'L'\nelse:\n pass\nif int(end_y) > int(start_y):\n for i in range(int(end_y) - int(start_y)):\n moves[i]=moves[i]+'U'\nelif int(end_y) < int(start_y):\n for i in range(int(start_y) - int(end_y)):\n moves[i]=moves[i]+'D'\nelse:\n pass\n\ni = 0\nwhile i in range(len(moves)):\n if moves[i]=='':\n moves.pop(i)\n i-=1\n i+=1\nprint(len(moves))\nprint('''\n'''.join(moves))", "s = list(input()) #input coordinates\r\nt = list(input())\r\n \r\nmoves = list() #create list of moves\r\n \r\nwhile s[0] != t[0] or s[1] != t[1]: #while coordinates are not equal\r\n string = \"\"\r\n \r\n #if first coords of s and t are equal, king doesn't change its position in direction L-R\r\n if s[0] < t[0]: #if first coord of s is less than of t one, then king goes to the right\r\n string = \"R\"\r\n s[0] = chr(ord(s[0]) + 1)\r\n elif s[0] > t[0]:\r\n string = \"L\" #vice versa - king goes to the left\r\n s[0] = chr(ord(s[0]) - 1)\r\n \r\n #if second coords of s and t are equal, king doesn't change its position in direction U-D\r\n if s[1] < t[1]: #if second coord of s is less than of t one, then king goes up\r\n string = string + \"U\"\r\n s[1] = str(int(s[1]) + 1)\r\n elif s[1] > t[1]: #vice versa - king goes down\r\n string = string + \"D\"\r\n s[1] = str(int(s[1]) - 1)\r\n \r\n moves.append(string)\r\n \r\nprint(len(moves))\r\nprint(\"\\n\".join(moves))", "a = input()\r\nb = input()\r\nx = ord(a[0]) - ord(b[0]) \r\ny = ord(a[1]) - ord(b[1]) \r\nprint(max(x,-x,y,-y)) \r\nwhile x!=0 or y!=0 :\r\n r = ''\r\n if x < 0 :\r\n r = 'R' ; x = x + 1\r\n if x > 0 :\r\n r = 'L' ; x = x - 1\r\n if y < 0 :\r\n r = r + 'U' ; y = y + 1\r\n if y > 0 :\r\n r = r + 'D' ; y = y - 1\r\n print(r) " ]

[ "f = lambda: list(map(int, input().split()))\r\ng = lambda j: a[i] * b[j] + t[j]\r\nh = lambda j, k: (t[i] - t[j]) * (b[j] - b[k]) < (t[j] - t[k]) * (b[i] - b[j])\r\n\r\nn = int(input())\r\na, b = f(), f()\r\nt = [0] * n\r\np = [0]\r\nfor i in range(1, n):\r\n while len(p) > 1 and g(p[1]) < g(p[0]): p.pop(0)\r\n t[i] = g(p[0])\r\n while len(p) > 1 and h(p[-2], p[-1]): p.pop()\r\n p.append(i)\r\nprint(t[-1])", "from collections import deque\r\nimport sys\r\nimport io\r\nimport os\r\n\r\nMOD = 998244353 # 1000000007 INV2 = (MOD + 1) >> 1 # pow(2, MOD - 2, MOD)\r\ninf = 1 << 60\r\n\r\nclass Line:\r\n def __init__(self, m: int, c: int) -> None:\r\n self.m, self.c = m, c\r\n \r\n def __call__(self, x: int) -> int:\r\n return self.m * x + self.c\r\n \r\n def intersect(self, other: 'Line') -> int:\r\n return (other.c - self.c) // (self.m - other.m) \r\n \r\n def __repr__(self) -> str:\r\n return f'Line({self.m}, {self.c})'\r\n\r\n\"\"\"\r\n for p, q, a in A:\r\n while len(dq) >= 2 and dq[-2](q) >= dq[-1](q):\r\n dq.pop()\r\n y = dq[-1](q) + p * q - a\r\n if res < y: res = y\r\n cur = Line(-p, y)\r\n while len(dq) >= 2 and cur.intersect(dq[0]) >= dq[0].intersect(dq[1]):\r\n dq.popleft()\r\n dq.appendleft(cur)\r\n\"\"\"\r\n\r\ndef solve():\r\n n = read_int()\r\n A = read_int_list()\r\n B = read_int_list()\r\n \r\n res = 0\r\n dq = deque([Line(B[0], 0)])\r\n for a, b in zip(A[1:], B[1:]):\r\n while len(dq) >= 2 and dq[0](a) >= dq[1](a):\r\n dq.popleft()\r\n res = dq[0](a)\r\n cur = Line(b, res)\r\n while len(dq) >= 2 and dq[-2].intersect(dq[-1]) >= dq[-1].intersect(cur):\r\n dq.pop()\r\n dq.append(cur)\r\n \r\n print(res)\r\n \r\n\r\n\r\ndef main():\r\n # region local test\r\n # if 'AW' in os.environ.get('COMPUTERNAME', ''):\r\n # test_no = 1\r\n # f = open(os.path.dirname(__file__) + f'\\\\in{test_no}.txt', 'r')\r\n\r\n # global input\r\n # input = lambda: f.readline().rstrip(\"\\r\\n\")\r\n # endregion\r\n\r\n T = 1\r\n for t in range(T):\r\n solve()\r\n # print('YES' if solve() else 'NO')\r\n # print('Yes' if solve() else 'No')\r\n\r\n\r\n# region IO\r\nBUFSIZE = 8192\r\n\r\n\r\nclass FastIO(io.IOBase):\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.buffer = io.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(io.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\nsys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)\r\n\r\ninput = lambda: sys.stdin.readline().rstrip('\\r\\n')\r\n\r\n\r\ndef read_int_list():\r\n return list(map(int, input().split()))\r\n\r\n\r\ndef read_ints_minus_one():\r\n return [int(x) - 1 for x in input().split()]\r\n\r\n\r\ndef read_int_tuple():\r\n return map(int, input().split())\r\n\r\n\r\ndef read_graph(n: int, m: int, d=1):\r\n g = [[] for _ in range(n)]\r\n for _ in range(m):\r\n u, v = map(int, input().split())\r\n g[u - d].append(v - d)\r\n g[v - d].append(u - d)\r\n return g\r\n\r\n\r\ndef read_int():\r\n return int(input())\r\n\r\n\r\nread_str = input\r\n\r\n# endregion\r\n\r\nif __name__ == \"__main__\":\r\n main()", "n=int(input())\r\nA=list(map(int,input().strip().split()))\r\nB=list(map(int,input().strip().split()))\r\nC=[0 for _ in range(n)]\r\nhullx=[0 for _ in range(n)]\r\nhully=[0 for _ in range(n)] \r\n \r\nsz=-1\r\np=0\r\n\r\ndef intersection(p,q):\r\n global hullx,hully\r\n return (hully[q]-hully[p])/(hullx[p]-hullx[q])\r\ndef insert(B,C):\r\n global sz,p,hullx,hully\r\n sz+=1\r\n hullx[sz]=B\r\n hully[sz]=C\r\n while sz>1 and intersection(sz-1,sz-2)>=intersection(sz-1,sz):\r\n hullx[sz-1]=hullx[sz]\r\n hully[sz-1]=hully[sz]\r\n sz-=1\r\ndef query(x):\r\n global sz,p,B,C\r\n p=min(sz,p)\r\n while sz>0 and p<sz and intersection(p,p+1)<=x: p+=1\r\n return hully[p]+hullx[p]*x\r\n\r\n\r\nC[0]=0\r\ninsert(B[0],0)\r\n\r\nfor i in range(1,n):\r\n C[i]=query(A[i])\r\n insert(B[i],C[i])\r\nprint(C[n-1])\r\n", "n=int(input())\r\nA=list(map(int,input().strip().split()))\r\nB=list(map(int,input().strip().split()))\r\n\r\ndef tree_cutting(n,A,B):\r\n C=[0 for _ in range(n)]\r\n hullx=[0 for _ in range(n)]\r\n hully=[0 for _ in range(n)] \r\n \r\n sz=0\r\n p=0\r\n\r\n C[0]=0\r\n hullx[0]=B[0]\r\n hully[0]=C[0]\r\n\r\n for i in range(1,n):\r\n p=min(sz,p)\r\n while sz>0 and p<sz and (hully[p+1]-hully[p])/(hullx[p]-hullx[p+1])<=A[i]:\r\n p+=1\r\n C[i]=hully[p]+hullx[p]*A[i]\r\n sz+=1\r\n hullx[sz]=B[i]\r\n hully[sz]=C[i]\r\n while sz>1 and (hully[sz-2]-hully[sz-1])/(hullx[sz-1]-hullx[sz-2])>=(hully[sz-2]-hully[sz])/(hullx[sz]-hullx[sz-2]):\r\n hullx[sz-1]=hullx[sz]\r\n hully[sz-1]=hully[sz]\r\n sz-=1\r\n return C[n-1]\r\n \r\nprint(tree_cutting(n,A,B))\r\n", "N = 100100\n\ndef main():\n n = int(input())\n d=[0]*N\n a = list(map(int, input().split()))\n b = list(map(int, input().split()))\n \n m,c=[0]*N,[0]*N\n m[0] = b[0]\n c[0] = d[0]\n \n z = 1\n p = 0\n for i in range(1,n):\n p = min(p,z)\n while(p+1<z and m[p+1]*a[i]+c[p+1]<=m[p]*a[i]+c[p]):\n p=p+1\n d[i] = m[p]*a[i]+c[p]\n while(z>=2 and (c[z-2]-c[z-1])*(b[i]-m[z-1])>=(c[z-1]-d[i])*(m[z-1]-m[z-2]) ):\n z=z-1\n m[z],c[z]=b[i],d[i]\n z=z+1\n #for j in range(n):print(d[j])\n print(d[n-1])\n\nmain()\n", "aa, bb, dp = [], [], []\r\n\r\ndef dot(i, a):\r\n return dp[i] + a*bb[i]\r\n\r\ndef main():\r\n n = int(input())\r\n a = list(map(int, input().split(' ')))\r\n b = list(map(int, input().split(' ')))\r\n\r\n for k in range(n):\r\n dp.append(0)\r\n aa.append(a[k])\r\n bb.append(b[k])\r\n\r\n st, i, j = [0 for _ in range(n) ], 0, 0\r\n\r\n for k in range(1,n):\r\n while(j - i > 0 and dot(st[i],a[k]) >= dot(st[i+1],a[k])):\r\n i+=1\r\n dp[k] = a[k]*b[st[i]] + dp[st[i]]\r\n while(j - i > 0 and (b[st[j]] - b[k])*(dp[st[j]] - dp[st[j-1]]) > (dp[k] - dp[st[j]])*(b[st[j-1]] - b[st[j]])):\r\n j-=1\r\n j+=1\r\n st[j] = k\r\n\r\n\r\n print(dp[-1])\r\n\r\nif __name__ == \"__main__\":\r\n main()", "read = lambda: map(int, input().split())\r\nn = int(input())\r\na = list(read())\r\nb = list(read())\r\ndp = [0] * n\r\nch = [0]\r\n\r\n\r\ndef get(i, x):\r\n return b[i] * x + dp[i]\r\n\r\n\r\ndef f1():\r\n if len(ch) < 2:\r\n return 0\r\n return get(ch[0], a[i]) >= get(ch[1], a[i])\r\n\r\n\r\ndef f2():\r\n if len(ch) < 2:\r\n return 0\r\n i1 = ch[-1]\r\n x = (dp[i1] - dp[i]) / (b[i] - b[i1])\r\n return get(ch[-2], x) <= get(i, x)\r\n\r\n\r\nfor i in range(1, n):\r\n while f1():\r\n ch.pop(0)\r\n dp[i] = get(ch[0], a[i])\r\n while f2():\r\n ch.pop()\r\n ch.append(i)\r\nprint(dp[n - 1])\r\n", "read = lambda: map(int, input().split())\r\nn = int(input())\r\na = list(read())\r\nb = list(read())\r\ndp = [0] * n\r\nst = [0]\r\ndef f1():\r\n i0, i1 = st[0], st[1]\r\n b1 = dp[i1] - dp[i0]\r\n k1 = b[i0] - b[i1]\r\n return b1 <= a[i] * k1\r\ndef f2():\r\n i1, i2 = st[-1], st[-2]\r\n k1, k2 = b[i1] - b[i], b[i2] - b[i1]\r\n b1, b2 = dp[i] - dp[i1], dp[i1] - dp[i2]\r\n return b2 * k1 > b1 * k2\r\nfor i in range(1, n):\r\n while len(st) > 1 and f1(): st.pop(0)\r\n dp[i] = dp[st[0]] + a[i] * b[st[0]]\r\n while len(st) > 1 and f2(): st.pop()\r\n st.append(i)\r\nprint(dp[n - 1])", "n = int(input())\na = list(map(int, input().split(' ')))\nb = list(map(int, input().split(' ')))\nc = [0]*n\nst = [0]*n\nfirst=0\nsecond=0 \nfor i in range(1,n):\n #Delete from front until the value of lines is increasing w.r.to value a[i]\n while(second-first>0 and a[i] * b[st[first]] + c[st[first]] >= a[i] * b[st[first+1]] + c[st[first+1]]):\n \tfirst = first + 1;\n c[i] = a[i] * b[st[first]] + c[st[first]];\n #Delete from back until the intersection of lines last two lines in stack is to the left of the new line and the last line \n while(second-first>0 and (b[st[second]] - b[i])*(c[st[second]] - c[st[second-1]]) > (c[i] - c[st[second]])*(b[st[second-1]] - b[st[second]])):\n \tsecond = second-1;\n second = second+1\n st[second] = i;\nprint(c[n-1]);", "n = int(input())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\nc = [0] * n\r\nstk = [0]\r\nfor i in range(1, n):\r\n while len(stk) > 1 and c[stk[1]] - c[stk[0]] <= a[i] * (b[stk[0]] -\r\n b[stk[1]]):\r\n del stk[0]\r\n c[i] = c[stk[0]] + a[i] * b[stk[0]]\r\n while len(stk) > 1 and ((c[stk[-1]] - c[stk[-2]]) * (b[stk[-1]] - b[i]) >\r\n (b[stk[-2]] - b[stk[-1]]) * (c[i] - c[stk[-1]])):\r\n del stk[-1]\r\n stk.append(i)\r\nprint(c[n - 1])", "from collections import deque\n\nclass line:\n def __init__(self, k, b):\n self.k = k\n self.b = b\n\n def get(self, x):\n return self.k * x + self.b\n\ndef check(l1, l2, nl):\n return (nl.b - l2.b) * (l1.k - l2.k) - (nl.k - l2.k) * (l1.b - l2.b) <= 0\n\nn = int(input())\na = list(map(int, input().split()))\nb = list(map(int, input().split()))\nans = 0\n\nhull = deque()\nhull.append(line(b[0], 0))\nfor i in range(1, n):\n arg = a[i]\n while len(hull) > 1 and hull[0].get(arg) >= hull[1].get(arg):\n hull.popleft()\n ans = hull[0].get(arg)\n nl = line(b[i], ans)\n while len(hull) > 1 and check(hull[-2], hull[-1], nl):\n hull.pop()\n hull.append(nl)\n\nprint(ans)\n\n", "n = int(input())\r\n\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\n\r\ndp = [0] * n\r\nstackDp = [0] * n\r\nstackB = [0] * n\r\nstackB[0] = b[0]\r\n\r\nl = 0\r\nr = 1\r\n\r\nfor i in range(1, n):\r\n while r - l > 1 and a[i] * stackB[l] + stackDp[l] >= a[i] * stackB[l + 1] + stackDp[l + 1]:\r\n l += 1\r\n\r\n dp[i] = a[i] * stackB[l] + stackDp[l]\r\n while (r - l > 1 and (dp[i] - stackDp[r - 1]) * (stackB[r - 2] - stackB[r - 1]) <= (\r\n stackDp[r - 1] - stackDp[r - 2]) * (stackB[r - 1] - b[i])):\r\n r -= 1\r\n\r\n stackB[r] = b[i]\r\n stackDp[r] = dp[i]\r\n r += 1\r\n\r\nprint(dp[n - 1])\r\n", "P = 1000000007\r\nMAX_N = 111111\r\ndef cost(x, y):\r\n return b[x] * a[y]\r\nn = int(input())\r\na = [0] + list(map(int, input().split()))\r\na.append(a[n] + 1)\r\nb = [0] + list(map(int, input().split()))\r\ndp = [0] * MAX_N\r\nst = [0] * MAX_N\r\nde = [0] * MAX_N\r\nnow = tail = 1\r\nst[now] = 0\r\nde[1] = 1\r\nfor i in range(2, n+1):\r\n if st[now + 1] == i:\r\n now += 1\r\n dp[i] = dp[de[now]] + cost(de[now], i)\r\n while i < st[tail] and dp[i] + cost(i, st[tail]) <= dp[de[tail]] + cost(de[tail], st[tail]):\r\n tail -= 1\r\n l = max(i + 1, st[tail])\r\n r = n + 1\r\n mid = (l + r) // 2\r\n while l < r:\r\n if dp[i] + cost(i, mid) <= dp[de[tail]] + cost(de[tail], mid):\r\n r = mid\r\n else:\r\n l = mid + 1\r\n mid = (l + r) // 2\r\n tail += 1\r\n st[tail] = mid\r\n de[tail] = i\r\nprint(dp[n])# 1691049906.160556", "n = int(input())\r\na = [0] + [int(x) for x in input().split()]\r\nb = [0] + [int(x) for x in input().split()]\r\nq = [0 for i in range(n + 1)]\r\nf = [0 for _ in range(n + 1)]\r\nl, r, q[1] = 1, 1, 1\r\nfor i in range(2, n + 1):\r\n while l < r and f[q[l + 1]] - f[q[l]] < a[i] * (b[q[l]] - b[q[l + 1]]):\r\n l += 1\r\n f[i] = f[q[l]] + b[q[l]] * a[i]\r\n while l < r and (f[q[r]] - f[q[r - 1]]) * (b[q[r]] - b[i]) >= (f[i] - f[q[r]]) * (b[q[r - 1]] - b[q[r]]):\r\n r -= 1\r\n r += 1\r\n q[r] = i\r\nprint(f[n])\r\n", "n = int(input())\r\n\r\na = [0 for i in range(0, n + 1)]\r\nb = [0 for i in range(0, n + 1)]\r\n\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\ndp = [0 for i in range(0, n + 1)]\r\n\r\nc = [[0 for i in range(0, 3)] for j in range(0, n + 1)]\r\n\r\nstack = []\r\nstack.append(0)\r\nstack.append(1)\r\n\r\ndp[0] = 0\r\ndp[1] = a[1] * b[0]\r\n\r\ndef intersection(x, y):\r\n return int((dp[y] - dp[x]) / (b[x] - b[y]))\r\n\r\nlast = 0\r\nc[last] = [0, intersection(0, 1), 0]\r\nlast+=1\r\nc[last] = [intersection(0, 1), 1000000001, 1]\r\nlast1=0\r\nfor i in range(2, n):\r\n\r\n while (last1 >= 0):\r\n if (c[last1][0] <= a[i] and c[last1][1] >= a[i]):\r\n dp[i] = dp[c[last1][2]] + b[c[last1][2]] * a[i]\r\n #print(i,dp[i])\r\n break\r\n elif c[last1][0] > a[i]:\r\n last1 -= 1\r\n else:\r\n last1 += 1\r\n\r\n while stack:\r\n top = stack[-1]\r\n if len(stack) >= 2:\r\n second_top = stack[-2]\r\n if intersection(second_top, i) < intersection(top,second_top):\r\n stack.pop()\r\n last -= 1\r\n else:\r\n break\r\n else:\r\n break\r\n\r\n stack.append(i)\r\n last += 1\r\n c[last] = [intersection(top, i),1000000001,i]\r\n c[last-1]= [c[last-1][0],intersection(top,i),c[last-1][2]]\r\n\r\nprint(dp[n-1])", "import sys\r\ninput=sys.stdin.readline\r\nn=int(input())\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\ndp=[0]*n\r\nst=[0]\r\nfor i in range(1,n):\r\n while len(st)>1 and dp[st[0]]+b[st[0]]*a[i]>dp[st[1]]+b[st[1]]*a[i]:\r\n st.pop(0)\r\n dp[i]=dp[st[0]]+b[st[0]]*a[i]\r\n while len(st)>1 and (dp[st[-2]]-dp[st[-1]])*(b[st[-2]]-b[i])<(dp[st[-2]]-dp[i])*(b[st[-2]]-b[st[-1]]):\r\n st.pop()\r\n st.append(i)\r\nprint(dp[-1])" ]

[ "MOD = 10**9+7\r\n\r\n\r\ndef solve(values):\r\n notUsed = set(range(1, len(values)+1))\r\n chairs = set()\r\n for i, a in enumerate(values, 1):\r\n if a == -1:\r\n chairs.add(i)\r\n else:\r\n notUsed -= {a}\r\n fixed = len(chairs & notUsed)\r\n m = len(notUsed)\r\n fact, fact_inv = facts(m)\r\n ans = fact[m]\r\n for k in range(1, fixed+1):\r\n ans += nCr(fixed, k, fact, fact_inv)*fact[m-k]*(-1)**k\r\n return ans % MOD\r\n\r\n\r\ndef facts(m):\r\n fact = [0]*(m+1)\r\n fact[0] = 1\r\n for i in range(1, m+1):\r\n fact[i] = fact[i-1]*i % MOD\r\n fact_inv = [0]*(m+1)\r\n fact_inv[m] = pow(fact[m], MOD-2, MOD)\r\n for i in reversed(range(m)):\r\n fact_inv[i] = fact_inv[i + 1]*(i + 1) % MOD\r\n return fact, fact_inv\r\n\r\n\r\ndef nCr(n, r, fact, fact_inv):\r\n if r < 0 or n < r:\r\n return 0\r\n return int(fact[n] * fact_inv[r] * fact_inv[n-r])\r\n\r\n\r\nif __name__ == '__main__':\r\n input()\r\n values = list(map(int, input().split()))\r\n print(solve(values))\r\n", "M=10**9+7\r\nR=10**4\r\nFact=[1]*(R+1)\r\nfor i in range(2,R+1):\r\n Fact[i]=(i*Fact[i-1])%M\r\nFacthyp=[1]*(R+1)\r\nFacthyp[R]=pow(Fact[R],M-2,M)\r\nfor i in range(R-1,-1,-1):\r\n Facthyp[i]=((i+1)*Facthyp[i+1])%M\r\ndef C(n,k):\r\n if n<k or n<0 or k<0:\r\n return 0\r\n return (Fact[n]*Facthyp[n-k]*Facthyp[k])%M\r\nn=int(input())\r\na=[int(e)-1 for e in input().split()]\r\niu=[0]*n\r\nxu=[0]*n\r\nfor i in range(n):\r\n if a[i]!=-2:\r\n iu[i]=1\r\n xu[a[i]]=1\r\nk=sum(not (iu[I] or xu[I]) for I in range(n))\r\nn-=sum(iu)\r\ny=0\r\nfor i in range(k+1):\r\n y+=(-1 if i%2 else 1)*C(k,i)*Fact[n-i]\r\n y%=M\r\nprint(y)", "import sys\r\n\r\n\r\ndef fact(be, en):\r\n res, res2 = [1] * (en + 1), [1] * (en + 1)\r\n for i in range(be, en + 1):\r\n res[i] = mult(res[i - 1], i)\r\n res2[i] = inv(res[i])\r\n return res, res2\r\n\r\n\r\ndef ncr(n, r):\r\n if n < r:\r\n return 0\r\n return mult(mult(facs[n], invs[n - r]), invs[r])\r\n\r\n\r\nmod = 10 ** 9 + 7\r\nadd = lambda a, b: (a + b) % mod\r\nmult = lambda a, b: (a * b) % mod\r\ndiv = lambda a, b: mult(a, inv(b))\r\ninv = lambda a: pow(a, mod - 2, mod)\r\n\r\nn, a = int(input()), [int(x) for x in sys.stdin.readline().split()]\r\nfacs, invs = fact(1, n)\r\nvis, negs = set(a), a.count(-1)\r\n\r\nfor i in range(n):\r\n if a[i] != -1 or i + 1 in vis:\r\n n -= 1\r\n\r\nans = facs[negs]\r\nfor i in range(1, n + 1):\r\n ext = mult(facs[negs - i], ncr(n, i))\r\n ans = add(ans, mult(pow(-1, i & 1), ext))\r\nprint(ans)", "'''Author- Akshit Monga'''\r\nfrom sys import stdin, stdout\r\ninput = stdin.readline\r\n\r\nmod=1000000007\r\nN = MAXN = 2005\r\nfactorialNumInverse = [None] * (N + 1)\r\nnaturalNumInverse = [None] * (N + 1)\r\nfact = [None] * (N + 1)\r\n\r\ndef InverseofNumber(p):\r\n naturalNumInverse[0] = naturalNumInverse[1] = 1\r\n for i in range(2, N + 1, 1):\r\n naturalNumInverse[i] = (naturalNumInverse[p % i] *\r\n (p - int(p / i)) % p)\r\n\r\ndef InverseofFactorial(p):\r\n factorialNumInverse[0] = factorialNumInverse[1] = 1\r\n for i in range(2, N + 1, 1):\r\n factorialNumInverse[i] = (naturalNumInverse[i] *\r\n factorialNumInverse[i - 1]) % p\r\n\r\ndef factorial(p):\r\n fact[0] = 1\r\n for i in range(1, N + 1):\r\n fact[i] = (fact[i - 1] * i) % p\r\n\r\ndef Binomial(N, R, p):\r\n if N<R:\r\n return 0\r\n ans = ((fact[N] * factorialNumInverse[R]) % p *\r\n factorialNumInverse[N - R]) % p\r\n return ans\r\n\r\nInverseofNumber(mod)\r\nInverseofFactorial(mod)\r\nfactorial(mod)\r\n\r\n\r\nt = 1\r\nfor _ in range(t):\r\n n=int(input())\r\n a=[int(x) for x in input().split()]\r\n inside=set(a)\r\n x=y=0\r\n for i in range(1,n+1):\r\n if a[i-1]==-1:\r\n x+=1\r\n if i not in inside:\r\n y+=1\r\n ans=fact[x]\r\n for i in range(1,y+1):\r\n ans+=((-1)**(i%2))*(Binomial(y,i,mod)*fact[x-i])\r\n ans%=mod\r\n print(ans)", "def fact(x):\n\n ans=1\n\n for i in range(2,x+1):\n\n ans*=i\n\n return ans\n\nn=int(input())\n\na=[int(x) for x in input().split()]\n\ns=set(a)\n\nx=0\n\ny=0\n\nfor i in range(1,n+1):\n\n if a[i-1]==-1:\n\n g=i in s\n\n (x,y)=(x+1-g,y+g)\n\notv=fact(x+y)\n\ncurrf=fact(x+y-1)//fact(x-1)*fact(x)\n\nif x:\n\n otv-=currf\n\nfor i in range(2,x+1):\n\n currf//=i\n\n currf*=x-i+1\n\n currf//=x+y-i+1\n\n if i&1:\n\n otv-=currf\n\n else:\n\n otv+=currf\n\notv%=1000000007\n\nprint(otv)\n\n\n\n# Made By Mostafa_Khaled", "MOD = 10**9+7\nn = int(input())\n\nnotUsed = set(range(1, n+1))\nchairs = set()\nfor i, a in enumerate(map(int, input().split()), 1):\n if a == -1:\n chairs.add(i)\n else:\n notUsed -= {a}\nfixed = len(chairs & notUsed)\n\nm = len(notUsed)\nU = m\nfact = [0]*(U+1)\nfact[0] = 1\nfor i in range(1, U+1):\n fact[i] = fact[i-1]*i % MOD\n\n\ninvfact = [0]*(U+1)\ninvfact[U] = pow(fact[U], MOD-2, MOD)\nfor i in reversed(range(U)):\n invfact[i] = invfact[i+1]*(i+1) % MOD\n\n\ndef nCr(n, r):\n if r < 0 or n < r:\n return 0\n return fact[n]*invfact[r]*invfact[n-r]\n\n\nans = fact[m]\nfor k in range(1, fixed+1):\n ans += nCr(fixed, k)*fact[m-k]*(-1)**k\n ans %= MOD\nprint(ans)\n" ]

[ "from sys import stdin\nn = int(stdin.readline().strip())\nl = [stdin.readline().strip() for i in range(n)]\ndp = []\nfor i in range(26):\n dp.append([-999999999] * 26)\nans = 0\nfor i in range(26):\n dp[i][i] = 0\n for j in range(n):\n first = ord(l[j][0]) - 97\n ln = len(l[j])\n last = ord(l[j][ln - 1]) - 97\n dp[i][last] = max(dp[i][last], dp[i][first] + ln)\n ans = max(ans, dp[i][i])\nprint(ans)\n\t \t\t \t \t\t \t \t\t\t\t\t \t\t \t\t\t\t\t\t", "from queue import PriorityQueue\nfrom queue import Queue\nimport math\nfrom collections import *\nimport sys\nimport operator as op\nfrom functools import reduce\n\n# sys.setrecursionlimit(10 ** 6)\nMOD = int(1e9 + 7)\ninput = sys.stdin.readline\ndef ii(): return list(map(int, input().strip().split()))\ndef ist(): return list(input().strip().split())\n\n\nn, = ii()\nl = [[0 for i in range(26)] for i in range(26)]\nfor i in range(n):\n s = input().strip()\n a, b = ord(s[0])-97, ord(s[-1])-97\n for j in range(26):\n if l[j][a] > 0:\n l[j][b] = max(l[j][a]+len(s), l[j][b])\n l[a][b] = max(l[a][b], len(s))\nans = 0\nfor i in range(26):\n if l[i][i] > ans:\n ans = l[i][i]\nprint(ans)\n", "# Problem: A. Dynasty Puzzles\r\n# Contest: Codeforces - Codeforces Round 121 (Div. 1)\r\n# URL: https://codeforces.com/problemset/problem/191/A\r\n# Memory Limit: 256 MB\r\n# Time Limit: 2000 ms\r\n\r\nimport sys\r\nimport random\r\nfrom types import GeneratorType\r\nimport bisect\r\nimport io, os\r\nfrom bisect import *\r\nfrom collections import *\r\nfrom contextlib import redirect_stdout\r\nfrom itertools import *\r\nfrom array import *\r\nfrom functools import lru_cache, reduce\r\nfrom heapq import *\r\nfrom math import sqrt, gcd, inf\r\n\r\nif sys.version >= '3.8': # ACW没有comb\r\n from math import comb\r\n\r\nRI = lambda: map(int, sys.stdin.buffer.readline().split())\r\nRS = lambda: map(bytes.decode, sys.stdin.buffer.readline().strip().split())\r\nRILST = lambda: list(RI())\r\nDEBUG = lambda *x: sys.stderr.write(f'{str(x)}\\n')\r\n# print = lambda d: sys.stdout.write(str(d) + \"\\n\") # 打开可以快写，但是无法使用print(*ans,sep=' ')这种语法,需要print(' '.join(map(str, p)))，确实会快。\r\n\r\nDIRS = [(0, 1), (1, 0), (0, -1), (-1, 0)] # 右下左上\r\nDIRS8 = [(0, 1), (1, 1), (1, 0), (1, -1), (0, -1), (-1, -1), (-1, 0),\r\n (-1, 1)] # →↘↓↙←↖↑↗\r\nRANDOM = random.randrange(2 ** 62)\r\nMOD = 10 ** 9 + 7\r\n# MOD = 998244353\r\nPROBLEM = \"\"\"https://codeforces.com/problemset/problem/191/A\r\n\r\n输入 n(1≤n≤5e5) 和长为 n 的字符串数组 a，只包含小写字母，每个 a[i] 的长度至多为 10。\r\n\r\n你需要选择 a 的一个子序列 b，满足 b[i] 的最后一个字母等于 b[i+1] 的第一个字母，且 b[0] 的第一个字母等于 b[-1] 的最后一个字母。这里 b[-1] 表示最后一项。\r\n输出 b 中字符串长度之和的最大值。\r\n\r\n注：子序列不要求连续。\r\n输入\r\n3\r\nabc\r\nca\r\ncba\r\n输出 6\r\n\r\n输入\r\n4\r\nvvp\r\nvvp\r\ndam\r\nvvp\r\n输出 0\r\n\r\n输入\r\n3\r\nab\r\nc\r\ndef\r\n输出 1\r\n\"\"\"\r\n\r\n\r\n# ms\r\ndef solve():\r\n n, = RI()\r\n f = [[-inf] * 26 for _ in range(26)] # f[i][j][k]表示前i个串，j开头k结尾的最大长度\r\n for _ in range(n):\r\n s, = RS()\r\n x, y = ord(s[0]) - ord('a'), ord(s[-1]) - ord('a')\r\n # print(x, y)\r\n for j in range(26):\r\n f[j][y] = max(f[j][y], f[j][x] + len(s))\r\n\r\n f[x][y] = max(f[x][y], len(s))\r\n # print(f)\r\n ans = max(f[i][i] for i in range(26))\r\n print(ans if ans > -inf else 0)\r\n \"\"\"[\r\n [0, 2, 1, 0, 0, 3], \r\n [0, 2, 1, 0, 0, 3], \r\n [0, 2, 1, 0, 0, 3], \r\n [0, 2, 1, 0, 0, 3], \r\n [0, 2, 1, 0, 0, 3], \r\n [0, 2, 1, 0, 0, 3]]\r\n\"\"\"\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", "from sys import stdin, stdout\r\n\r\nfst = 97\r\nsze = 26\r\n\r\nvalues = [[0 for i in range(sze)] for j in range(sze)]\r\nn = int(stdin.readline())\r\nchallengers = []\r\n\r\nfor i in range(n):\r\n s = stdin.readline().strip()\r\n challengers.append((ord(s[0]) - fst, ord(s[-1]) - fst))\r\n \r\n for i in range(sze):\r\n if values[i][challengers[-1][0]]:\r\n values[i][challengers[-1][1]] = max(values[i][challengers[-1][1]], values[i][challengers[-1][0]] + len(s))\r\n \r\n values[challengers[-1][0]][challengers[-1][1]] = max(values[challengers[-1][0]][challengers[-1][1]], len(s))\r\n\r\n\r\nans = 0\r\nfor i in range(sze):\r\n ans = max(ans, values[i][i])\r\n\r\nstdout.write(str(ans))", "from sys import stdin\r\ninput = stdin.readline\r\nn = int(input())\r\ns = list(input().strip() for _ in range(n))\r\ndp = [[0 for i in range(28)] for j in range(28)]\r\n \r\nfor i in range(n):\r\n a, b = ord(s[i][0]) - ord('a'), ord(s[i][-1]) - ord('a')\r\n for j in range(26):\r\n if dp[j][a] > 0:\r\n dp[j][b] = max(dp[j][b], dp[j][a] + len(s[i]))\r\n dp[a][b] = max(dp[a][b], len(s[i]))\r\n \r\nres = 0\r\nfor i in range(26):\r\n res = max(res, dp[i][i])\r\n \r\nprint(res)", "'''\r\n【灵茶の试炼】\r\nhttps://docs.qq.com/sheet/DWGFoRGVZRmxNaXFz\r\n\r\nhttps://codeforces.com/problemset/problem/191/A\r\n\r\n输入 n(1≤n≤5e5) 和长为 n 的字符串数组 a，只包含小写字母，每个 s 的长度至多为 10。\r\n\r\n你需要选择 a 的一个子序列 b，满足 b[i] 的最后一个字母等于 b[i+1] 的第一个字母，且 b[0] 的第一个字母等于 b[-1] 的最后一个字母。这里 b[-1] 表示最后一项。\r\n输出 b 中字符串长度之和的最大值。\r\n\r\n注：子序列不要求连续。\r\n\r\n输入\r\n3\r\nabc\r\nca\r\ncba\r\n输出 6\r\n\r\n输入\r\n4\r\nvvp\r\nvvp\r\ndam\r\nvvp\r\n输出 0\r\n\r\n输入\r\n3\r\nab\r\nc\r\ndef\r\n输出 1\r\n'''\r\n\r\n\r\nfrom cmath import inf\r\n\r\nimport os, sys\r\nfrom io import BytesIO, IOBase\r\n \r\nfrom collections import defaultdict, deque, Counter\r\nfrom bisect import bisect_left, bisect_right\r\nfrom heapq import heappush, heappop\r\nfrom functools import lru_cache\r\nfrom itertools import accumulate\r\nimport math\r\n \r\n# Fast IO Region\r\nBUFSIZE = 8192\r\n \r\n \r\nclass FastIO(IOBase):\r\n newlines = 0\r\n \r\n def __init__(self, file):\r\n self._fd = file.fileno()\r\n self.buffer = BytesIO()\r\n self.writable = \"x\" in file.mode or \"r\" not in file.mode\r\n self.write = self.buffer.write if self.writable else None\r\n \r\n def read(self):\r\n while True:\r\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\r\n if not b:\r\n break\r\n ptr = self.buffer.tell()\r\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\r\n self.newlines = 0\r\n return self.buffer.read()\r\n \r\n def readline(self):\r\n while self.newlines == 0:\r\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\r\n self.newlines = b.count(b\"\\n\") + (not b)\r\n ptr = self.buffer.tell()\r\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\r\n self.newlines -= 1\r\n return self.buffer.readline()\r\n \r\n def flush(self):\r\n if self.writable:\r\n os.write(self._fd, self.buffer.getvalue())\r\n self.buffer.truncate(0), self.buffer.seek(0)\r\n \r\n \r\nclass IOWrapper(IOBase):\r\n def __init__(self, file):\r\n self.buffer = FastIO(file)\r\n self.flush = self.buffer.flush\r\n self.writable = self.buffer.writable\r\n self.write = lambda s: self.buffer.write(s.encode(\"ascii\"))\r\n self.read = lambda: self.buffer.read().decode(\"ascii\")\r\n self.readline = lambda: self.buffer.readline().decode(\"ascii\")\r\n \r\n \r\nsys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)\r\ninput = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\r\n\r\n\r\n\r\n\r\ndef _n():\r\n return int(input())\r\n\r\n\r\ndef _nA():\r\n return list(map(int, input().split()))\r\n\r\n\r\ndef _nS():\r\n return input().split()\r\n\r\n\r\ndef c(x):\r\n return ord(x)-ord('a')\r\n\r\ndef max(a,b):\r\n if a>b:\r\n return a\r\n else:\r\n return b\r\n\r\ndef solve():\r\n n = _n()\r\n s = input()\r\n dp = [[-inf]*26 for _ in range(26)]\r\n dp[c(s[0])][c(s[-1])] = len(s)\r\n ret = len(s) if s[0] == s[-1] else 0\r\n for _ in range(1, n):\r\n s = input()\r\n x, y, l = c(s[0]), c(s[-1]), len(s)\r\n for j in range(26):\r\n dp[j][y] = max(dp[j][y], dp[j][x]+l)\r\n ret = max(ret, dp[j][j])\r\n dp[x][y] = max(dp[x][y], l)\r\n ret = max(ret, dp[x][x])\r\n print(ret)\r\n\r\n\r\nsolve()\r\n", "# pypy3\r\nfrom collections import *\r\nfrom itertools import *\r\nfrom functools import *\r\nfrom bisect import *\r\nfrom heapq import *\r\nimport sys\r\nIN = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\r\nPN = lambda x: sys.stdout.write(x)\r\nI = lambda: int(IN())\r\nS = lambda: IN().split()\r\nM = lambda: map(int, IN().split())\r\nL = lambda: list(map(int, IN().split()))\r\nG = lambda: map(lambda x: int(x) - 1, IN().split())\r\n\r\nn = I()\r\nf = [[0] * 26 for i in range(26)]\r\nfor i in range(n):\r\n s = IN()\r\n a = ord(s[0]) - ord('a')\r\n b = ord(s[-1]) - ord('a')\r\n for i in range(26):\r\n if f[i][a] > 0:\r\n f[i][b] = max(f[i][b], f[i][a] + len(s))\r\n f[a][b] = max(f[a][b], len(s))\r\nprint(max(f[i][i] for i in range(26)))\r\n", "import sys\r\ninput = sys.stdin.readline\r\nn = int(input())\r\nli = [input().strip() for _ in range(n)]\r\n\r\ndp = [[0] * 26 for _ in range(26)]\r\n\r\nfor s in li:\r\n head = ord(s[0]) - ord('a')\r\n tail = ord(s[-1]) - ord('a')\r\n\r\n for x in range(26):\r\n if not dp[head][x]:\r\n continue\r\n dp[tail][x] = max(dp[tail][x], dp[head][x] + len(s))\r\n # 晚加排除自交情况\r\n dp[tail][head] = max(dp[tail][head], len(s))\r\nprint(max(dp[i][i] for i in range(26)))", "from bisect import bisect_left, bisect_right\r\nfrom collections import Counter, deque\r\nfrom functools import lru_cache\r\nfrom math import factorial, comb, sqrt, gcd, lcm, log2\r\nfrom copy import deepcopy\r\nimport heapq\r\nimport math\r\n\r\n\r\nfrom sys import stdin, stdout\r\n\r\n\r\ninput = stdin.readline\r\n\r\n\r\ndef main():\r\n n = int(input())\r\n L = []\r\n for _ in range(n):\r\n s = input()[:-1]\r\n L.append(s)\r\n ans = 0\r\n for start in range(26):\r\n # 枚举开头字母\r\n count = [-float(\"inf\")] * 26\r\n count[start] = 0\r\n for s in L:\r\n count[ord(s[-1]) - ord(\"a\")] = max(count[ord(s[-1]) - ord(\"a\")], count[ord(s[0]) - ord(\"a\")] + len(s))\r\n ans = max(ans, count[start])\r\n print(ans)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()", "from sys import stdin\r\nn=int(stdin.readline().strip())\r\ns=[stdin.readline().strip() for i in range(n)]\r\ndp=[[0 for i in range(26)] for j in range(26)]\r\nnow=1\r\nlast=0\r\nfor i in range(n):\r\n a,b=ord(s[i][0])-97,ord(s[i][-1])-97\r\n for j in range(26):\r\n if dp[j][a]>0:\r\n dp[j][b]=max(dp[j][b],dp[j][a]+len(s[i]))\r\n dp[a][b]=max(dp[a][b],len(s[i]))\r\nans=0 \r\nfor i in range(26):\r\n ans=max(ans,dp[i][i])\r\nprint(ans)\r\n" ]

[ "n = int(input())\r\nl, r = [0] * n, [0] * n\r\nf = lambda x, y: all(x > r[j] or y < l[j] for j in range(i))\r\n \r\nfor i in range(n):\r\n x, d = map(int, input().split())\r\n y = x + d - 1\r\n \r\n if not f(x, y):\r\n k = min(r[j] for j in range(i + 1) if f(r[j] + 1, r[j] + d))\r\n x, y = k + 1, k + d\r\n \r\n l[i], r[i] = x, y\r\n print(x, y)", "import sys\r\ninput = lambda: sys.stdin.readline().rstrip()\r\n\r\nN = int(input())\r\nA = [0,10**18]\r\nfor _ in range(N):\r\n s,d = map(int, input().split())\r\n \r\n find = False\r\n for i in range(1,len(A),2):\r\n if A[i]>s+d-1 and A[i-1]<s:\r\n print(s,s+d-1)\r\n A.append(s)\r\n A.append(s+d-1)\r\n find = True\r\n break\r\n if not find:\r\n for i in range(1,len(A),2):\r\n if A[i]-A[i-1]-1>=d:\r\n print(A[i-1]+1,A[i-1]+d)\r\n A.append(A[i-1]+1)\r\n A.append(A[i-1]+d)\r\n break\r\n A.sort()\r\n \r\n \r\n \r\n \r\n \r\n", "n = int(input())\r\n\r\ncur = []\r\ndef good(s, e):\r\n\tif s < 1:\r\n\t\treturn False\r\n\tassert s <= e\r\n\tfor l, r in cur:\r\n\t\tif max(l, s) <= min(r, e):\r\n\t\t\treturn False\r\n\treturn True\r\n\r\nfor i in range(n):\r\n\ts, d = map(int, input().split())\r\n\te = s+d-1\r\n\tif not good(s, e):\r\n\t\ts = int(2e9)\r\n\t\tif good(1, d):\r\n\t\t\ts = 1\r\n\t\tfor l, r in cur:\r\n\t\t\tif good(l-d, l-1):\r\n\t\t\t\ts = min(s, l-d)\r\n\t\t\tif good(r+1, r+d):\r\n\t\t\t\ts = min(s, r+1)\r\n\tcur.append((s, s+d-1))\r\n\tcur.sort()\r\n\tprint(s, s+d-1)", "def dotwointervals(l1,r1,l2,r2):\r\n if(l1<l2 and r1<l2):\r\n return 0\r\n elif(l1>r2 and r1>r2):\r\n return 0\r\n return 1\r\n\r\nn=int(input())\r\nlofdays=[]\r\nfor you in range(n):\r\n l=input().split()\r\n si=int(l[0])\r\n di=int(l[1])\r\n if(you==0):\r\n lofdays.append((si,si+di-1))\r\n print(si,si+di-1)\r\n else:\r\n nowint=(si,si+di-1)\r\n done=1\r\n for i in lofdays:\r\n \r\n\r\n if(dotwointervals(nowint[0],nowint[1],i[0],i[1])):\r\n done=0\r\n break\r\n if(done==1):\r\n lofdays.append(nowint)\r\n print(si,si+di-1)\r\n else:\r\n mina=min(lofdays)\r\n if(mina[0]-di>0):\r\n print(1,di)\r\n lofdays.append((1,di))\r\n else:\r\n lofdays.sort()\r\n done=0\r\n for i in range(1,len(lofdays)):\r\n if(lofdays[i][0]-lofdays[i-1][1]-1>=di):\r\n done=1\r\n print(lofdays[i-1][1]+1,lofdays[i-1][1]+di)\r\n lofdays.append((lofdays[i-1][1]+1,lofdays[i-1][1]+di))\r\n break\r\n if(done==0):\r\n print(lofdays[-1][1]+1,lofdays[-1][1]+di)\r\n lofdays.append((lofdays[-1][1]+1,lofdays[-1][1]+di))\r\n" ]

[ "def main():\n n = int(input())\n relav = list(map(int,input().split()))\n\n trees = dict.fromkeys(range(1,n+1),-1)\n\n for i in range(n):\n if trees[relav[i]] == -1:\n trees[i+1]=relav[i]\n else:\n trees[i+1]=trees[relav[i]]\n #print(trees)\n count = 0\n for i in range(1,n+1):\n if trees[i]==i:\n count += 1\n print(count)\nif __name__ == '__main__':\n main()\n", "from collections import defaultdict\r\nnum=int(input())\r\narr=[int(x) for x in input().split()]\r\ngraph=defaultdict(set)\r\nfor i in range(len(arr)):\r\n graph[i+1].add(arr[i])\r\n graph[arr[i]].add(i+1)\r\ndef dfs(node):\r\n level=[node]\r\n while level:\r\n node=level.pop()\r\n for i in graph[node]:\r\n if i not in visited:\r\n visited.add(i)\r\n level.append(i)\r\n # print(visited)\r\nvisited=set()\r\nans=0\r\nfor i in range(1,num+1):\r\n if i not in visited:\r\n visited.add(i)\r\n dfs(i)\r\n ans+=1\r\nprint(ans)", "def main():\r\n n = int(input())\r\n p = list(map(int, input().split()))\r\n print(solve(p))\r\n\r\ndef solve(p):\r\n parents = [-1] * len(p)\r\n\r\n for i in range(len(p)):\r\n root1 = find_root(parents, i)\r\n root2 = find_root(parents, p[i] - 1)\r\n\r\n if root1 != root2:\r\n parents[root2] = root1\r\n\r\n return parents.count(-1)\r\n\r\ndef find_root(parents, node):\r\n root = node\r\n while parents[root] != -1:\r\n root = parents[root]\r\n\r\n p = node\r\n while p != root:\r\n next = parents[p]\r\n parents[p] = root\r\n p = next\r\n\r\n return root\r\n\r\nif __name__ == \"__main__\":\r\n main()", "n = int(input())\r\nnums = [int(x) for x in input().split()]\r\nfor i in range(n):\r\n\tnums[i]-=1\r\nedges = [[] for _ in range(n)]\r\nalone = 0\r\npair = 0\r\nfor i in range(n):\r\n\tedges[nums[i]].append(i)\r\nfor i in range(n):\r\n\tif edges[i]==[i]:\r\n\t\talone+=1\r\n\telif edges[i]!=[]:\r\n\t\tpair+=1\r\nprint(pair//2+alone)", "\r\n\r\nfrom collections import Counter\r\nclass DisjointSetUnion:\r\n def __init__(self, n):\r\n self.parent = list(range(n))\r\n self.size = [1] * n\r\n self.num_sets = n\r\n\r\n def find(self, a):\r\n acopy = a\r\n while a != self.parent[a]:\r\n a = self.parent[a]\r\n while acopy != a:\r\n self.parent[acopy], acopy = a, self.parent[acopy]\r\n return a\r\n\r\n def union(self, a, b):\r\n a, b = self.find(a), self.find(b)\r\n if a != b:\r\n if self.size[a] < self.size[b]:\r\n a, b = b, a\r\n\r\n self.num_sets -= 1\r\n self.parent[b] = a\r\n self.size[a] += self.size[b]\r\n\r\n def set_size(self, a):\r\n return self.size[self.find(a)]\r\n\r\n def __len__(self):\r\n return self.num_sets\r\ndef pro(arr):\r\n n=len(arr)\r\n lst=[]\r\n dsu=DisjointSetUnion(n)\r\n\r\n for i in range(n):\r\n k=arr[i]-1\r\n dsu.union(i,k)\r\n return dsu.num_sets\r\n\r\n\r\nt=1\r\nfor i in range(t):\r\n n=int(input())\r\n arr=list(map(int,input().split()))\r\n res=pro(arr)\r\n print(res,flush=True)", "n = int(input())\r\ncount = 0\r\nmas = [int(s) for s in input().split()]\r\nfor i in range(n):\r\n if i + 1 == mas[i]:\r\n count += 1\r\n mas[i] = 0\r\nmas = set(mas)\r\nflag = 0 in mas\r\nprint(count + (len(mas) - flag) // 2)\r\n", "n = int(input())\r\ndata = [int(i) for i in input().split()]\r\n\r\n\r\ndef solution(data: list[int], n: int):\r\n counter = 0\r\n\r\n remove_list = []\r\n for i in range(n):\r\n if data[i] == i + 1:\r\n remove_list.append(i)\r\n counter += 1\r\n for i in range(len(remove_list)):\r\n data.pop(remove_list[i] - i)\r\n\r\n counter += len(set(data)) // 2\r\n return counter\r\n\r\n\r\nprint(solution(data, n))\r\n", "n = int(input())\r\np = list(map(int, input().split()))\r\nrec = [0] * (n)\r\n\r\nres = 0\r\ns = set()\r\nfor i in range(n):\r\n if rec[i] == 0:\r\n s.clear()\r\n num = p[i] - 1\r\n while rec[num] != 1:\r\n s.add(num)\r\n rec[num] = 1\r\n num = p[num] - 1\r\n if num in s:\r\n res += 1\r\n\r\n\r\nprint(res)\r\n", "R = lambda: map(int, input().split())\r\nn = int(input())\r\nroots = [0] * (n + 1)\r\ngraph = [list() for _ in range(n + 1)]\r\nfor i, num in enumerate(R()):\r\n graph[i + 1].append(num)\r\n graph[num].append(i + 1)\r\ncnt = 0\r\nfor i in range(1, n + 1):\r\n if not roots[i]:\r\n q = [i]\r\n cnt += 1\r\n roots[i] = cnt\r\n while q:\r\n curr = q.pop()\r\n for nb in graph[curr]:\r\n if not roots[nb]:\r\n roots[nb] = cnt\r\n q.append(nb)\r\nprint(cnt)", "n=int(input())\r\np=list(map(int,input().split()))\r\nf=[0 for _ in range(n)]\r\ng=[[] for _ in range(n)]\r\nfor i in range(n):\r\n g[i].append(p[i]-1)\r\n g[p[i]-1].append(i)\r\nans=0\r\ndef dfs(x):\r\n f[x]=1\r\n for i in g[x]:\r\n if not f[i]:\r\n dfs(i)\r\nfor i in range(n):\r\n if not f[i]:\r\n ans+=1\r\n dfs(i)\r\nprint(ans)\r\n", "import sys\r\nimport math\r\nfrom collections import defaultdict,Counter\r\nfrom itertools import permutations\r\nfrom collections import deque\r\nfrom decimal import Decimal\r\nfrom fractions import Fraction\r\nfrom heapq import heappush , heappop\r\nimport bisect\r\n \r\n \r\ndef sin():\r\n\treturn int(sys.stdin.readline())\r\n \r\ndef array():\t\r\n\treturn list(map(int, sys.stdin.readline().strip().split()))\r\n \r\ndef two():\r\n\treturn map(int, sys.stdin.readline().strip().split())\r\n \r\ndef multiple():\r\n\treturn [int(x) for x in sys.stdin.readline().split()]\r\n \r\ndef string():\r\n\treturn sys.stdin.readline().strip()\r\n \r\ndef sqrt(x):\r\n\tlow , high = 0 , x\r\n\twhile low <= high:\r\n\t\tmid = (low + high) // 2\r\n\t\tif mid * mid <= x < (mid+1) * (mid+1):\r\n\t\t\treturn mid\r\n\t\telif x < mid * mid:\r\n\t\t\thigh = mid - 1\r\n\t\telse:\r\n\t\t\tlow = mid + 1\r\n\r\n\r\nparent = defaultdict(int)\r\nsize = defaultdict(int)\r\n\r\ndef make(v):\r\n\tparent[v] = v\r\n\tsize[v] = 1\r\n\r\n\r\ndef find(v):\r\n\tif v == parent[v]:\r\n\t\treturn v\r\n\tparent[v] = find(parent[v])\r\n\treturn parent[v]\r\n\r\n\r\ndef union(a , b):\r\n\ta = find(a)\r\n\tb = find(b)\r\n\tif a != b:\r\n\t\tif size[a] < size[b]:\r\n\t\t\ta,b = b,a\r\n\t\tparent[b] = a\r\n\t\tsize[a] += size[b]\r\n\r\n\r\n\r\nn = sin()\r\narr = array()\r\n\r\ngraph = {}\r\n\r\nfor i in range(1 , n+1):\r\n\tgraph[i] = []\r\n\r\nfor i in range(n):\r\n\tgraph[i+1] += [arr[i]]\r\n\tgraph[arr[i]] += [i+1]\r\n\r\nvis = set()\r\n\r\n\r\ndef solve(root , par):\r\n\tif root in vis:\r\n\t\treturn\r\n\tvis.add(root)\r\n\tfor node in graph[root]:\r\n\t\tif node != par:\r\n\t\t\tsolve(node , root)\r\n\r\ncount = 0\r\n\r\n\r\nfor i in range(1 , n+1):\r\n\tif i not in vis:\r\n\t\tsolve(i , -1)\r\n\t\tcount += 1\r\n\r\nprint(count)\r\n\r\n\r\n\t\t", "import sys\r\nfrom collections import defaultdict \r\ninput = sys.stdin.readline\r\n\r\ndef in_int():\r\n '''\r\n Read input string as int\r\n '''\r\n return (int(input()))\r\n\r\ndef in_int_space():\r\n '''\r\n Read space separated numbers as list of int\r\n '''\r\n return (list(map(int,input().split())))\r\n\r\ndef in_int_line(n):\r\n '''\r\n Read line separated input as list of int\r\n '''\r\n list = []\r\n for i in range(n):\r\n s = input()\r\n list.append(int(s[:len(s)-1]))\r\n return list\r\n\r\ndef in_str():\r\n '''Read string'''\r\n s = input()\r\n return s[:len(s)-1]\r\n\r\ndef in_str_arr():\r\n '''\r\n Read String as Char array\r\n '''\r\n s = input()\r\n return (list(s[:len(s)-1]))\r\n\r\ndef in_str_space():\r\n return input().split()\r\n\r\ndef in_str_line(n):\r\n list = []\r\n for i in range(n):\r\n s = input()\r\n list.append(s[:len(s)-1])\r\n return list\r\n\r\ndef dfs(node): \r\n visited[node] = True \r\n for adj in graph[node]: \r\n if visited[adj]: \r\n continue \r\n dfs(adj) \r\n \r\nn = in_int() \r\nedges = in_int_space() \r\n\r\ngraph = defaultdict(list)\r\n\r\nfor u,v in enumerate(edges): \r\n graph[u].append(v-1) \r\n graph[v-1].append(u) \r\n\r\nvisited = [False] * n \r\n\r\ncount = 0 \r\nfor i in range(n):\r\n if not visited[i]:\r\n dfs(i)\r\n count += 1 \r\n\r\nprint(count)\r\n\r\n\r\n\r\n", "n=int(input())\r\np=list(map(int,input().split()))\r\ncount=0\r\ns=set()\r\nfor i in range(n):\r\n\tif p[i]==i+1:\r\n\t\tcount+=2\r\n\telif p[i] not in s:\r\n\t\ts.add(p[i])\r\n\t\tcount+=1\r\n\telse:\r\n\t\ts.add(p[i])\r\nprint(count//2)", "n=int(input())\r\nx=list(map(int,input().split()))\r\nans=0\r\ncount=set()\r\nfor i in range(n):\r\n if x[i]==i+1:\r\n ans+=1\r\n else:\r\n count.add(x[i])\r\nprint(ans+len(count)//2,flush=True)", "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('c')\r\nn = i1()\r\nids = set()\r\ncnt = 0\r\ni = 1\r\nfor p in nl():\r\n if i == p:\r\n cnt += 1\r\n else:\r\n ids.add(p)\r\n i += 1\r\nprint(cnt + len(ids)//2)\r\n", "def solve(n,balls) :\r\n marked = [False]*(n+1)\r\n trees = 0\r\n for i in balls :\r\n if not marked[i] :\r\n trees += 1\r\n marked[i] = True\r\n marked[balls[i-1]] = True\r\n\r\n return trees\r\n \r\nn = int(input())\r\nballs = list(map(int,input().split()))\r\nprint (solve(n,balls))\r\n ", "# /**\r\n# * author: brownfox2k6\r\n# * created: 07/07/2023 19:15:33 Hanoi, Vietnam\r\n# **/\r\nimport sys\r\ninput = sys.stdin.readline\r\nprint = sys.stdout.write\r\n\r\nn = int(input())\r\ns = set()\r\na = 0\r\nfor i, x in enumerate(map(int, input().split()), 1):\r\n if x == i:\r\n a += 1\r\n else:\r\n s.add(x)\r\n\r\nprint(str(a + len(s) // 2))", "# Test\r\n#####################################################################################################################\r\n\r\ndef nTreesInForest(nPolandBalls, mostDistantRelatives):\r\n nTrees = 0\r\n forest = set()\r\n for iBall in range(nPolandBalls):\r\n ball, itsRelative = iBall + 1, mostDistantRelatives[iBall]\r\n if ball == itsRelative:\r\n nTrees += 1\r\n elif itsRelative not in forest:\r\n forest.add(itsRelative)\r\n\r\n return nTrees + len(forest)//2\r\n\r\n\r\nprint(nTreesInForest(int(input()), tuple(map(int, input().split()))))\r\n", "# Test\r\n#####################################################################################################################\r\n\r\ndef nTreesInForest(nPolandBalls, mostDistantRelatives):\r\n nLoners = sum(iBall + 1 == mostDistantRelatives[iBall] for iBall in range(nPolandBalls))\r\n return (nLoners + len(set(mostDistantRelatives)))//2\r\n\r\n\r\nprint(nTreesInForest(int(input()), tuple(map(int, input().split()))))\r\n", "# /**\r\n# * author:Hisoka-TheMagician\r\n# * created: 05/05/2023 10:49 Chennai, India\r\n# **/\r\n'''\r\n\r\nEDITORIAL\r\nEDITORIAL\r\n\r\n'''\r\n \r\nimport sys, threading, os, io \r\nimport math\r\nimport time\r\nfrom os import path\r\nfrom collections import defaultdict, Counter, deque\r\nfrom bisect import *\r\nfrom string import ascii_lowercase\r\nfrom functools import cmp_to_key\r\nimport heapq\r\nfrom bisect import bisect_left as lower_bound\r\nfrom bisect import bisect_right as upper_bound\r\nfrom io import BytesIO, IOBase\t\t\t\t\t\t\t\t\r\n# # # # # # # # # # # # # # # #\r\n# JAI SHREE RAM #\r\n# # # # # # # # # # # # # # # #\r\n \r\n \r\ndef lcm(a, b):\r\n return (a*b)//(math.gcd(a,b))\r\n \r\n \r\ninput = lambda: sys.stdin.readline().rstrip()\r\ndef lmii():\r\n return list(map(int,input().split()))\r\n\r\ndef ii():\r\n return int(input())\r\n\r\ndef si():\r\n return str(input())\r\ndef lmsi():\r\n return list(map(str,input().split()))\r\ndef mii():\r\n return map(int,input().split())\r\n\r\ndef msi():\r\n return map(str,input().split())\r\n\r\ni2c = lambda n: chr(ord('a') + n)\r\nc2i = lambda c: ord(c) - ord('a')\r\n \r\n \r\n# if(os.path.exists(\"/Users/nitishkumar/Documents/Template_Codes/Python/CP/Codeforces/input.txt\")):\r\n# sys.stdin = open(\"/Users/nitishkumar/Documents/Template_Codes/Python/CP/Codeforces/input.txt\", 'r')\r\n# sys.stdout = open(\"/Users/nitishkumar/Documents/Template_Codes/Python/CP/Codeforces/output.txt\", 'w') \r\n# else:\r\n# input = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n \r\n \r\ndef solve():\r\n n=ii()\r\n a=lmii()\r\n s=set()\r\n ans=0\r\n\r\n for i,j in enumerate(a):\r\n if j==i+1:\r\n ans+=1\r\n else:\r\n s.add(j)\r\n ans+=len(s)//2\r\n\r\n print(ans)\r\n \r\n \r\n \r\nxxx=1\r\nfor _ in range(xxx):\r\n solve()", "import sys\r\ninput=sys.stdin.readline\r\n\r\ndef LI():\r\n return list(map(int,input().split()))\r\ndef I():\r\n return int(input())\r\n\r\nclass Dsu:\r\n def __init__(self, n):\r\n self.f = list(range(n))\r\n self.sz = [1] * n\r\n\r\n def find(self, x):\r\n xcopy=x\r\n while x!=self.f[x]:\r\n x=self.f[x]\r\n while xcopy!=x:\r\n self.f[xcopy],xcopy=x,self.f[xcopy]\r\n return x\r\n\r\n def same(self, u, v):\r\n return self.find(u) == self.find(v)\r\n\r\n def merge(self, u, v):\r\n u = self.find(u)\r\n v = self.find(v)\r\n if u == v:\r\n return\r\n self.sz[u] += self.sz[v]\r\n self.f[v] = u\r\n\r\n def size(self, x):\r\n return self.sz[self.find(x)]\r\n \r\n\r\ndef solve():\r\n n=I()\r\n a=LI()\r\n dsu=Dsu(n)\r\n for i in range(n):\r\n dsu.merge(i,a[i]-1)\r\n ans=0\r\n for i in range(n):\r\n ans+=(dsu.f[i]==i)\r\n print(ans)\r\nsolve()", "\r\nn = int(input())\r\na = [int(i) for i in input().split()]\r\nz = 0\r\nfor i in range(n):\r\n if a[i] == i + 1:\r\n z += 1\r\nprint((len(set(a)) - z) // 2 + (len(set(a)) - z) % 2 + z)\r\n", "dict_arr = {}\r\nn = int(input())\r\nlst = list(map(int,input().split()))\r\ncount = 1\r\nfor i in lst:\r\n if i not in dict_arr:\r\n dict_arr[i] = [count]\r\n else:\r\n dict_arr[i].append(count)\r\n if count not in dict_arr:\r\n dict_arr[count] = [i]\r\n else:\r\n dict_arr[count].append(i)\r\n count+=1\r\n\r\ndef dfs(queue,visited, graph, node,arr):\r\n visited.append(node)\r\n queue.append(node)\r\n \r\n while queue:\r\n m = queue.pop(0)\r\n arr.append(m)\r\n for neighbour in graph[m]:\r\n if neighbour not in visited:\r\n visited.insert(0,neighbour)\r\n queue.insert(0,neighbour)\r\n return arr\r\narr1 = []\r\ni = 1\r\nc = 0\r\nwhile len(arr1)<n:\r\n if i not in arr1:\r\n arr1 +=(dfs([],[],dict_arr,i,[]))\r\n c+=1\r\n i+=1\r\n\r\nprint(c)", "n = int(input())\r\na = list(map(int, input().split()))\r\nl = []\r\nans = 0\r\nfor i in range(0, n):\r\n if a[i] == i + 1:\r\n ans += 1\r\n l.append(i)\r\nfor i in range(len(l) - 1, -1, -1):\r\n a.pop(l[i])\r\nans += len(set(a)) // 2\r\nprint(ans)", "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=' ');NO=\"NO\";YES=\"YES\"\r\nfor _ in range(1):\r\n n=I()\r\n a=R()\r\n f=[0]*(n+1)\r\n b=[0]*(n+1)\r\n k=0\r\n s=[[]for i in range(n+1)]\r\n for i in range(len(a)):\r\n s[i+1].append(a[i])\r\n s[a[i]].append(i+1)\r\n for i in range(1,n+1):\r\n if not f[i]:\r\n f[i]=1\r\n k+=1\r\n st=[i]\r\n while st:\r\n z=st.pop()\r\n for i in s[z]:\r\n if not f[i]:\r\n st.append(i)\r\n f[i]=1\r\n print(k)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "from collections import *\r\nimport bisect\r\nimport heapq\r\nimport sys\r\n\r\n\r\ndef ri():\r\n return int(input())\r\n\r\n\r\ndef rl():\r\n return list(map(int, input().split()))\r\n\r\n\r\ndef dfs(v, i):\r\n stack = [v]\r\n\r\n while stack:\r\n v = stack.pop()\r\n if visited[v] is not None:\r\n continue\r\n visited[v] = i\r\n for j in graph[v]:\r\n stack.append(j)\r\n\r\n\r\nn = ri()\r\n\r\npp = rl()\r\n\r\npp = [x - 1 for x in pp]\r\n\r\ngraph = [[] for i in range(n)]\r\n\r\nfor i in range(n):\r\n graph[i].append(pp[i])\r\n graph[pp[i]].append(i)\r\n\r\nvisited = [None for _ in range(n)]\r\nnb_components = 0\r\nfor v in range(n):\r\n if not visited[v]:\r\n nb_components += 1\r\n dfs(v, nb_components)\r\n\r\nprint(nb_components)", "# Test\r\n#####################################################################################################################\r\n\r\ndef nTreesInForest(PolandBalls, mostDistantRelatives):\r\n return (sum(ball == itsRelative for ball, itsRelative in zip(PolandBalls, mostDistantRelatives)) + len(set(mostDistantRelatives)))//2\r\n\r\n\r\nprint(nTreesInForest(range(1, int(input())+1), list(map(int, input().split()))))\r\n", "n=int(input())\r\na=[*map(int,input().split())]\r\nl=[[]for i in range(n)]\r\nll=set()\r\nfor i in range(n):\r\n if a[i]!=i+1:ll.add(tuple(sorted([a[i],i+1])))\r\nprint(n-len(ll))\r\n", "def trees(array):\r\n\tnum_trees = 0\r\n\tchecked = {}\r\n\tfor i in array:\r\n\t\tif i not in checked:\r\n\t\t\tnew_tree = []\r\n\t\t\tcurr_vert = i\r\n\t\t\twhile curr_vert not in new_tree and curr_vert not in checked:\r\n\t\t\t\tnew_tree.append(curr_vert)\r\n\t\t\t\tcurr_vert = array[curr_vert-1]\r\n\t\t\tif curr_vert in checked:\r\n\t\t\t\tfor vert in new_tree:\r\n\t\t\t\t\tchecked[vert] = checked[curr_vert]\r\n\t\t\telse:\r\n\t\t\t\tnum_trees += 1\r\n\t\t\t\tfor vert in new_tree:\r\n\t\t\t\t\tchecked[vert] = num_trees\r\n\treturn num_trees\r\n\r\nn = int(input())\r\np = list(map(int, input().split()))\r\nprint(trees(p))\r\n", "import sys\n# sys.stdin = open(\".in\", \"r\")\n# sys.stdout = open(\".out\", \"w\")\ninput = sys.stdin.readline\ndef print(*args, end='\\n', sep=' ') -> None:\n sys.stdout.write(sep.join(map(str, args)) + end)\ndef map_int():\n return map(int, input().split())\ndef list_int():\n return list(map(int, input().split()))\nfrom collections import defaultdict, deque, Counter\nfrom math import sqrt, gcd\nfrom random import shuffle\n\n\n\n\ndef solve():\n\n INF = float('inf')\n n = int(input())\n arr = list_int()\n adj = defaultdict(list)\n\n for i, v in enumerate(arr):\n n1, n2 = i+1, v\n adj[n2].append(n1)\n adj[n1].append(n2)\n\n visited = [0 for i in range(n+1)]\n comps = 0\n for i in range(1, n+1):\n if not visited[i]:\n comps += 1\n visited[i] = 1\n stack = [i]\n while stack:\n node = stack.pop()\n for neighbor in adj[node]:\n if not visited[neighbor]:\n visited[neighbor] = 1\n stack.append(neighbor)\n\n print(comps)\n return\n\n\n\n\n\n\n\n\nif __name__ == '__main__':\n # NumberOfTestcases = int(input())\n # for _ in range(NumberOfTestcases):\n solve()\n", "n, P = int(input()), list(map(int, input().split()))\nprint(sum(P[P[i]-1] == i+1 and P[i] < i+2 for i in range(n)))", "import bisect\nimport math\nfrom collections import deque\nimport heapq\nimport functools\nfrom queue import Queue\nfrom collections import defaultdict\nfrom pprint import pprint\n\nmod = 998244353 \nN = 200005\n\ndef mul(a, b):\n\treturn (a*b)%mod\n\ndef add(a, b):\n\treturn (a+b) if (a+b<mod) else (a+b)-mod\n\ndef sub(a, b):\n\treturn (a-b) if (a-b>=0) else (a-b)+mod\n\ndef powr(a, b):\n\tans = 1\n\twhile b>0:\n\t\tif b & 1:\n\t\t\tans=mul(ans,a)\n\t\ta = mul(a,a) \n\t\tb//=2\n\treturn ans\n\ndef inv(n):\n\treturn powr(n, mod-2)\n\ndef factlist():\n\tfact = [1]\n\tfor i in range(1, N):\n\t\tfact.append(mul(fact[i-1],i))\n\treturn fact\n\ndef invfactlist(fact):\n\tinvfact=[0]*N\n\tinvfact[0]=1\n\tinvfact[N-1]= inv(fact[N-1])\n\tfor i in range(N-2, 0, -1):\n\t\tinvfact[i]= mul(invfact[i+1],(i+1))\n\t\n\treturn invfact\n\ndef rot(S):\n\treturn list(zip(*S[::-1]))\n\ndef gcd(a, b):\n\tif b==0:\n\t\treturn a\n\treturn gcd(b, a%b)\n\ndef generate():\n\tans = [0]\n\twhile ans[-1]<1000000000:\n\t\tans.append(1+ans[-1]*2)\n\treturn ans\n\n\ndef dfs(node, vis, curturn, con, ans, cnt):\n\tif ans[node]==1:\n\t\treturn ans[node]\n\tturn = [curturn]\n\tfor i in con[node]:\n\t\tif not i in vis:\n\t\t\tvis.add(i)\n\t\t\tturn.append(dfs(i, vis, curturn+1, con, ans, cnt)+1)\n\telse:\n\t\tif cnt[node]<=2:\n\t\t\tans[node] = sorted(turn)[0]\n\t\telse:\n\t\t\tans[node] = sorted(turn)[1]\n\treturn ans[node]\n\n\ndef main():\n\n\tn =int(input())\n\tlst = list(map(int, input().split()))\n\tu = 0\n\tcnt = defaultdict(lambda:0)\n\tfor i in range(len(lst)):\n\t\tif i+1==lst[i]:\n\t\t\tu+=1\n\tprint((len(set(lst))+u)//2)\n\n\n\nif __name__ == \"__main__\":\n main()\n \n\t", "\n\nt =1\nimport collections\n\nwhile(t>0):\n n = int(input())\n\n a = input().split()\n d = collections.defaultdict(int)\n for i in range(n):\n a[i] = int(a[i])\n \n ans = 0\n \n for i in range(n):\n if(d[a[i]]==0):\n ans += 1\n d[a[i]]=1\n d[a[a[i]-1]]=1\n \n print(ans)\n \n\n \n\n t-=1", "import sys \r\ninput = sys.stdin.readline \r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\nv = [0] * (n + 1)\r\nc = 0\r\nfor i in range(n):\r\n if(not v[a[i]]):\r\n j = a[i]\r\n while(not v[j]):\r\n v[j] = 1 \r\n j = a[j - 1]\r\n \r\n c += 1 \r\nprint(c)", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\nw = list(map(int, input().split()))\r\ns = set()\r\nc = n\r\n\r\nfor i in range(n):\r\n if w[w[i]-1] in s:\r\n c -= 1\r\n else:\r\n s.add(w[i])\r\n s.add(w[w[i]-1])\r\nprint(c)\r\n", "import sys\r\ninput=sys.stdin.readline\r\ndef LI():\r\n return list(map(int,input().split()))\r\ndef I():\r\n return int(input())\r\n\r\nclass Dsu:\r\n def __init__(self,n):\r\n self.n=n\r\n self.f=[int(i) for i in range(n)]\r\n def leader(self,x):\r\n if self.f[x]==x:\r\n return x\r\n self.f[x]=self.leader(self.f[x])\r\n return self.f[x]\r\n def same(self,u,v):\r\n return self.leader(u)==self.leader(v)\r\n def merge(self,u,v):\r\n u=self.leader(u)\r\n v=self.leader(v)\r\n if u==v:\r\n return\r\n self.f[v]=u\r\n \r\n\r\ndef solve():\r\n n=I()\r\n a=LI()\r\n dsu=Dsu(n)\r\n for i in range(n):\r\n dsu.merge(i,a[i]-1)\r\n ans=0\r\n for i in range(n):\r\n ans+=(dsu.f[i]==i)\r\n print(ans)\r\nsolve()", "from collections import defaultdict\r\n\r\ndef find_set(v):\r\n if v==parent[v]:\r\n return v\r\n parent[v]=find_set(parent[v])\r\n return parent[v]\r\n\r\ndef union_set(a,b):\r\n a=find_set(a)\r\n b=find_set(b)\r\n \r\n if a!=b:\r\n parent[a]=b\r\n # size[b]+=size[a]\r\n\r\n\r\nn=int(input())\r\np=list(map(int,input().split()))\r\nparent=[j for j in range(n+1)]\r\n # size=[1]*(n+1)\r\n \r\nfor i in range(n):\r\n union_set(i+1,p[i])\r\ncost=0\r\nfor i in range(1,n+1):\r\n if i==parent[i]:\r\n cost+=1\r\n \r\nprint(cost)\r\n# print(parent)\r\n ", "from collections import defaultdict, deque\r\nn = int(input())\r\np = [0] + list(map(int, input().split()))\r\ng = defaultdict(set)\r\nfor i in range(1, n + 1):\r\n g[i].add(p[i])\r\n g[p[i]].add(i)\r\n \r\n\r\nunseen = set(range(1, n + 1)) \r\nc = 0\r\n\r\ndef bfs(start):\r\n queue = deque([start])\r\n unseen.discard(start)\r\n while queue:\r\n q = queue.popleft()\r\n for nbr in g[q]:\r\n if nbr in unseen:\r\n unseen.discard(nbr)\r\n queue.append(nbr)\r\nwhile unseen:\r\n bfs(unseen.pop())\r\n c += 1\r\nprint(c)", "n = int(input())\nnums = list(map(int, input().split()))\nballs=0\nfor i in range(n):\n if nums[i]==i+1:\n balls+=1\nalls = len(list(set(nums)))\nballs+=(alls-balls)//2\nprint(balls)\n", "from collections import *\n \ndef ri():\n return int(input())\n \ndef rl():\n return list(map(int, input().split()))\n \ndef dfs(start, visited, current):\n\tvisited[start] = current\n\tto_visit = [start]\n\twhile to_visit:\n\t\tnode = to_visit.pop()\n\t\tfor child in graph[node]:\n\t\t\tif not visited[child]:\n\t\t\t\tvisited[child] = current\n\t\t\t\tto_visit.append(child)\n\ndef count_components():\n\t\"\"\"\n\tvisited is a list, it can have many values:\n\t0 -> node unvisited\n\tk -> node belong to the connected component number k\n\t\"\"\" \n\tn = len(graph)\n\tvisited = [0]*n\n\tnb_components = 0\n\tfor v in range(n):\n\t\tif not visited[v]:\n\t\t\tnb_components += 1\n\t\t\tdfs(v, visited, nb_components)\n\treturn nb_components\n \n \n#get the input\nn = ri()\npp =rl()\n\n#make it a graph, zero indexed\npp = [x - 1 for x in pp]\n\ngraph = [[] for i in range(n)]\n\nfor i in range(n):\n\tgraph[i].append(pp[i])\n\tgraph[pp[i]].append(i)\n \n\nprint(count_components())", "from collections import *\n \ndef ri():\n return int(input())\n \ndef rl():\n return list(map(int, input().split()))\n \ndef dfs(v, current):\n\tvisited[v] = current\n\tto_visit = [v]\n\twhile to_visit:\n\t\tnode = to_visit.pop()\n\t\tfor child in graph[node]:\n\t\t\tif not visited[child]:\n\t\t\t\tvisited[child] = current\n\t\t\t\tto_visit.append(child)\n \n \n#get the input\nn = ri()\npp =rl()\n\n#make it a graph, zero indexed\npp = [x - 1 for x in pp]\n\ngraph = [[] for i in range(n)]\n\nfor i in range(n):\n\tgraph[i].append(pp[i])\n\tgraph[pp[i]].append(i)\n \n\"\"\"\nvisited is a list, it can have many values:\n0 -> node unvisited\nk -> node belong to the connected component number k\n\"\"\" \n\nvisited = [0]*n\nnb_components = 0\nfor v in range(n):\n\tif not visited[v]:\n\t\tnb_components += 1\n\t\tdfs(v, visited)\n \nprint(nb_components)", "num = int(input())\r\nvalues = [*map(int, input().split())]\r\ncount = sum(values[values[i] - 1] == i + 1 and values[i] < i + 2 for i in range(num))\r\nprint(count)\r\n", "class DisJoinUnoin:\r\n def __init__(self,n):\r\n self.parent=list(range(n))\r\n self.rank=[1]*n\r\n\r\n\r\n def find(self,x):\r\n if self.parent[x]==x:\r\n return x\r\n else:\r\n return self.find(self.parent[x])\r\n\r\n\r\n def union(self,x,y):\r\n fx,fy=self.find(x),self.find(y)\r\n\r\n if fx==fy:\r\n return\r\n\r\n if self.rank[fx]<self.rank[fy]:\r\n fx,fy=fy,fx\r\n\r\n self.parent[fy]=fx\r\n self.rank[fx]+=self.rank[fy]\r\n\r\nn=int(input())\r\npls=[int(x) for x in input().split()]\r\n\r\ndsu=DisJoinUnoin(n+1)\r\nfor i in range(n):\r\n dsu.union(i+1,pls[i])\r\n\r\nans=0\r\nvis=set()\r\nfor i in range(1,n+1):\r\n fi=dsu.find(i)\r\n if fi not in vis:\r\n ans+=1\r\n vis.add(fi)\r\n\r\nprint(ans)\r\n\r\n\r\n\r\n", "n=int(input())\r\np=list(map(lambda x:int(x)-1,input().split()))\r\ndef find(x):\r\n while x!=p[x]:\r\n p[x]=p[p[x]]\r\n x=p[x]\r\nfor i in range(n):\r\n find(i)\r\nprint(len(set(p)))", "n = int(input())\r\nl = list(map(int, input().split()))\r\nans = 0\r\narr = [0] * 10004\r\nfor i in range(n):\r\n if l[i] == i + 1: \r\n ans -= -1\r\n arr[l[i]] = 1\r\nl = list(set(l))\r\nc = 0\r\nfor i in l:\r\n if arr[i] == 0: c -= -1\r\nprint(ans + c // 2)", "n = int(input())\r\n\r\ntree = list(range(n+1))\r\n\r\narr = list(map(int,input().split()))\r\n\r\ndef find(st):\r\n if tree[st]!=st:\r\n tree[st]= find(tree[st])\r\n return tree[st]\r\n\r\nfor i in range(n):\r\n tree[find(i+1)] = find(arr[i])\r\n\r\nans = 0\r\nfor i in range(1,n+1):\r\n if find(i)==i:\r\n ans+=1\r\nprint(ans)", "import sys\r\nsys.setrecursionlimit(100000)\r\ndef root(i):\r\n if i == parent[i]:\r\n return i\r\n parent[i] = root(parent[i])\r\n return parent[i]\r\ndef unite(x, y):\r\n x = root(x)\r\n y = root(y)\r\n parent[x] = y\r\nn = int(input())\r\nparent = [i for i in range(n)]\r\np = list(map(int, input().split()))\r\nfor i in range(n):\r\n unite(i, p[i] - 1)\r\ntrees = set()\r\nfor i in range(n):\r\n trees.add(root(i))\r\nprint(len(trees))", "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('c')\r\nn = i1()\r\nfa = list(range(n+1))\r\ndef find(i):\r\n if i == fa[i]:\r\n return i\r\n fa[i] = find(fa[i])\r\n return fa[i]\r\ndef merge(i, p):\r\n i = find(i)\r\n p = find(p)\r\n if i != p:\r\n fa[i] = p\r\n\r\nfor i, p in enumerate(nl(),start=1):\r\n merge(i,p)\r\nprint(len([i for i in range(1,n+1) if fa[i] == i]))\r\n", "n = int(input())\r\nvertices = list(map(int, input().split(\" \")))\r\ngraph = {}\r\nvisited = {}\r\n\r\n\r\ndef dfs(node):\r\n if visited.get(node, 0):\r\n return\r\n visited[node] = 1\r\n for i in graph[node]:\r\n dfs(i)\r\n\r\n\r\nfor i in range(n):\r\n if not (i + 1 in graph):\r\n graph[i + 1] = []\r\n graph[i + 1].append(vertices[i])\r\n\r\n if not (vertices[i] in graph):\r\n graph[vertices[i]] = []\r\n graph[vertices[i]].append(i + 1)\r\n\r\ncomponents = 0\r\nfor i in range(1, n + 1):\r\n if i not in visited:\r\n components += 1\r\n dfs(i)\r\n\r\nprint(components)", "import sys\r\nsys.setrecursionlimit(int(1e9))\r\n\r\nparent = dict()\r\n\r\ndef make_set(x):\r\n parent[x] = x\r\ndef find_set(x):\r\n if parent[x] == x:\r\n return x\r\n parent[x] = find_set(parent[x])\r\n return parent[x]\r\ndef unite_sets(x, y):\r\n x = find_set(x)\r\n y = find_set(y)\r\n if x != y:\r\n parent[x] = y\r\n\r\ndef get_sets_count():\r\n unique_sets = set()\r\n for i in parent.keys():\r\n p = find_set(i)\r\n unique_sets.add(p)\r\n return len(unique_sets)\r\n\r\nn = int(input())\r\n\r\np = list(map(lambda x: int(x)-1, input().split()))\r\n\r\nfor i in range(n):\r\n if i not in parent.keys():\r\n make_set(i)\r\n if p[i] not in parent.keys():\r\n make_set(p[i])\r\n unite_sets(p[i], i)\r\n\r\nprint(get_sets_count())\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 = ii()\r\np = [(i - 1) for i in iis()]\r\nseen = {}\r\ncnt = 0\r\nfor i, el in enumerate(p):\r\n if el not in seen:\r\n queue = [el]\r\n while queue:\r\n curr = queue.pop()\r\n if curr not in seen:\r\n seen[curr] = True\r\n queue.append(p[curr])\r\n cnt += 1\r\nprint(cnt)\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\n\r\ns = set()\r\nans = 0\r\niz = []\r\n\r\nfor i in range(n):\r\n if a[i] == i + 1:\r\n iz.append(i)\r\n elif a[i] not in s:\r\n s.add(a[i])\r\n ans += 1\r\nprint(ans // 2 + len(iz))\r\n", "def Get(parent, x):\r\n if parent[x] == x:\r\n return x\r\n \r\n parent[x] = Get(parent, parent[x])\r\n return parent[x]\r\n\r\ndef Union(parent, rank, a, b):\r\n \r\n a = Get(parent, a)\r\n b = Get(parent, b)\r\n \r\n if rank[a] == rank[b]:\r\n rank[a] += 1\r\n \r\n if rank[a] < rank[b]:\r\n parent[a] = b\r\n \r\n else:\r\n parent[b] = a\r\n \r\n\r\n\r\nn = int(input())\r\narr = list(map(int, input().split()))\r\ncount = 0\r\nparent = [i for i in range(n + 1)]\r\nrank = [0 for i in range(n + 1)]\r\nfor i in range(n):\r\n \r\n u = i + 1\r\n v = arr[i]\r\n \r\n pu = Get(parent, u)\r\n pv = Get(parent, v)\r\n \r\n if pu != pv:\r\n Union(parent, rank, pu, pv)\r\n \r\nfor i in range(1, n + 1):\r\n if parent[i] == i:\r\n count += 1\r\n \r\nprint(count)\r\n \r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "from collections import *\nimport bisect\nimport heapq\nimport sys\n \ndef ri():\n return int(input())\n \ndef rl():\n return list(map(int, input().split()))\n\ndef dfs(v, current):\n\tcomponents[v] = current\n\tto_visit = [v]\n\twhile to_visit:\n\t\tnode = to_visit.pop()\n\t\tfor child in graph[node]:\n\t\t\tif not components[child]:\n\t\t\t\tcomponents[child] = current\n\t\t\t\tto_visit.append(child)\n\n\n\nn = ri()\n\npp =rl()\n\npp = [x - 1 for x in pp]\n\ngraph = [[] for i in range(n)]\n\nfor i in range(n):\n\tgraph[i].append(pp[i])\n\tgraph[pp[i]].append(i)\n\n\ncomponents = [0]*n\ncurrent = 0\nfor v in range(n):\n\tif not components[v]:\n\t\tcurrent += 1\n\t\tdfs(v, current)\n\nprint(current)", "def Find(x):\n if(x==fa[x]):\n return x\n\n fa[x] = Find(fa[x])\n # print(fa[x])\n return fa[x]\n\ndef Merge(x,y):\n x = Find(x)\n y = Find(y)\n if(x==y):\n return\n fa[x] = y\n\n\n\nn = int(input().strip())\nfa = [i for i in range(0,n+1)]\nnum = list(map(int, input().strip().split()))\nnum.insert(0,0)\nfor i in range(1,n+1):\n Merge(i, num[i])\n\nans = 0\n# print(fa)\nfor i in range(1,n+1):\n if(fa[i]==i):\n ans+=1\n\nprint(ans)\n\n", "from collections import Counter\r\nimport string\r\nimport bisect\r\n#import random\r\nimport math\r\nimport sys\r\nsys.setrecursionlimit(10**8) \r\nfrom fractions import Fraction\r\ndef array_int():\r\n return [int(i) for i in sys.stdin.readline().split()]\r\ndef vary(arrber_of_variables):\r\n if arrber_of_variables==1:\r\n return int(sys.stdin.readline())\r\n if arrber_of_variables>=2:\r\n return map(int,sys.stdin.readline().split()) \r\ndef makedict(var):\r\n return dict(Counter(var))\r\ndef dfs(node):\r\n visited[node]=1\r\n for i in graph[node]:\r\n if visited[i]==0:\r\n dfs(i)\r\n\r\ntestcases=1\r\nfor _ in range(testcases):\r\n n=vary(1)\r\n num=array_int()\r\n graph=[[] for i in range(n+1)]\r\n for i in range(n):\r\n graph[i+1].append(num[i])\r\n graph[num[i]].append(i+1)\r\n ans=0\r\n visited=[0]*(n+1)\r\n for i in range(1,n+1):\r\n if visited[i]==0:\r\n ans+=1\r\n dfs(i)\r\n print(ans)", "from sys import stdin\r\nfrom collections import defaultdict\r\ninput = stdin.readline\r\n# ~ T = int(input())\r\nT = 1\r\nfor t in range(1,T + 1):\r\n\tadj = defaultdict(lambda : list())\r\n\tn = int(input())\r\n\tedges = list(map(int,input().split()))\r\n\tfor i in range(0,n):\r\n\t\tadj[i + 1].append(edges[i])\r\n\t\tadj[edges[i]].append(i + 1)\r\n\tvisited = [False for x in range(n + 1)]\r\n\tcount = 0\r\n\tfor i in range(1,n + 1):\r\n\t\tif visited[i] == False:\r\n\t\t\tcount += 1\r\n\t\t\tvisited[i] = True\r\n\t\t\tq = []\r\n\t\t\tq.append(i)\r\n\t\t\twhile len(q) != 0:\r\n\t\t\t\tparent = q.pop(0)\r\n\t\t\t\tfor child in adj[parent]:\r\n\t\t\t\t\tif visited[child] == False:\r\n\t\t\t\t\t\tvisited[child] = True\r\n\t\t\t\t\t\tq.append(child)\r\n\tprint(count)\r\n", "n=int(input())\r\na=[*map(int,input().split())]\r\nprint(sum(a[a[i]-1]==i+1and a[i]<i+2for i in range(n)))", "inf = float('inf')\ndef solution():\n n = int(input())\n P = list(map(int, input().split()))\n adj = [set() for i in range(n)]\n visited = [False for i in range(n)]\n\n for ii in range(n):\n adj[ii].add(P[ii]-1)\n adj[P[ii]-1].add(ii)\n\n def dfs(node):\n if visited[node]:\n return\n else:\n visited[node] = True\n for u in adj[node]:\n dfs(u)\n \n starts = []\n ans = 0\n\n for ii in range(n):\n if not visited[ii]:\n dfs(ii)\n ans += 1\n print(ans)\n\n \n\n\nif __name__ == \"__main__\":\n solution()", "input()\r\na=list(map(int,input().strip().split()))\r\ns=set()\r\nans=0\r\nfor i,l in enumerate(a):\r\n if i+1==l:\r\n ans+=1\r\n else:\r\n s.add(l)\r\nprint(ans+len(s)//2)", "\r\nn = int(input())\r\np = list(map(int, input().split()))\r\ncounter = 0\r\n\r\nfor i in range(n):\r\n if p[p[i] - 1] == i + 1 and p[i] <= i +1:\r\n counter += 1\r\n\r\nprint(counter)", "from collections import *\nimport bisect\nimport heapq\nimport sys\n \ndef ri():\n return int(input())\n \ndef rl():\n return list(map(int, input().split()))\n \ndef dfs(v, current):\n\tvisited[v] = current\n\tto_visit = [v]\n\twhile to_visit:\n\t\tnode = to_visit.pop()\n\t\tfor child in graph[node]:\n\t\t\tif not visited[child]:\n\t\t\t\tvisited[child] = current\n\t\t\t\tto_visit.append(child)\n \n \n \nn = ri()\n \npp =rl()\n \npp = [x - 1 for x in pp]\n \ngraph = [[] for i in range(n)]\n \nfor i in range(n):\n\tgraph[i].append(pp[i])\n\tgraph[pp[i]].append(i)\n \n \nvisited = [0]*n\nnb_components = 0\nfor v in range(n):\n\tif not visited[v]:\n\t\tnb_components += 1\n\t\tdfs(v, visited)\n \nprint(nb_components)", "\r\n# Problem: C. PolandBall and Forest\r\n# Contest: Codeforces - 8VC Venture Cup 2017 - Elimination Round\r\n# URL: https://codeforces.com/contest/755/problem/C\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\nclass DSU():\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\n def __str__(self):\r\n return '\\n'.join(f'{r}: {m}' for r, m in self.all_group_members().items())\r\n \r\nn = int(input())\r\ndsu = DSU(n)\r\nar = get_ints()\r\nfor i in range(n):\r\n\tdsu.union(i,ar[i]-1)\r\nprint(dsu.group_count())", "from collections import defaultdict\r\nclass Graph:\r\n def __init__(self):\r\n self.graph=defaultdict(list)\r\n def addedge(self,u,v):\r\n self.graph[u].append(v)\r\n self.graph[v].append(u)\r\n\r\n def dfs(self,s):\r\n stack=[]\r\n stack.append(s)\r\n #print(self.visited)\r\n while len(stack)!=0:\r\n a=stack[-1]\r\n #print(a,self.visited,s)\r\n #print(stack)\r\n stack.pop()\r\n if(self.visited[a]==False):\r\n #print(a)\r\n self.visited[a]=True\r\n for node in self.graph[a]:\r\n if(self.visited[node]==False):\r\n stack.append(node)\r\n return\r\n def dfsutill(self):\r\n l=list(self.graph.keys())\r\n self.visited=[False for i in range(len(l)+1)]\r\n #print(self.visited)\r\n #print(l)\r\n c=0\r\n for v in l:\r\n if(self.visited[v]==False):\r\n c+=1\r\n self.dfs(v)\r\n #print(self.visited)\r\n return c\r\nn=int(input())\r\nl=list(map(int,input().split()))\r\ng=Graph()\r\nfor i in range(1,n+1):\r\n g.addedge(i,l[i-1])\r\nprint(g.dfsutill())", "import sys\r\n\r\ndef bfs(start):\r\n used[start]=1\r\n q=[start]; it=0\r\n while it<len(q):\r\n for u in g[q[it]]:\r\n if used[u] == 0:\r\n used[u] = 1\r\n q.append(u)\r\n it+=1\r\n\r\nn=int(input())\r\np=list(map(int,input().split()))\r\n\r\ng=[[] for i in range(n)]\r\nfor i in range(n):\r\n if i!=p[i]-1:\r\n g[i].append(p[i]-1)\r\n g[p[i]-1].append(i)\r\n\r\ntrees = 1\r\nused=[0 for i in range(n)]\r\n\r\nfor i in range(n):\r\n if used[i]==0:\r\n bfs(i)\r\n trees+=1\r\n\r\nprint(trees-1)\r\nsys.stdout.flush()", "n=int(input())\r\na=[int(i)-1 for i in input().split()]\r\n\r\ndef f(x):\r\n while x!=a[x]:\r\n a[x]=a[a[x]]\r\n x=a[x]\r\n\r\nfor i in range(n):\r\n f(i)\r\n\r\nprint(len(set(a)))\r\n", "n=int(input())\np=list(map(int,input().split()))\nrj=0\ns=set()\n\nfor i in range(n):\n x=p[i]\n if x==i+1:\n rj+=1\n else:\n s.add(x)\n\nrj+=len(s)//2\n\nprint(rj)\n\n \t \t \t\t \t \t\t \t \t \t\t\t\t \t\t \t\t", "n=int(input())\r\nls=[1]*n\r\nls1=[int(a) for a in input().split()]\r\nans=0\r\nfor i in range(n):\r\n if ls1[ls1[i]-1]==i+1 and ls[i]:\r\n ans+=1\r\n ls[ls1[i]-1]=0\r\nprint(ans)", "import sys\nimport threading\nfrom math import *\nsys.setrecursionlimit(300000)\nthreading.stack_size(10**8)\n\n\ndef main():\n def dfs(vertex, pp, used):\n used.add(vertex)\n for start in pp[vertex]:\n if start not in used:\n dfs(start, pp, used)\n\n\n used = set()\n s = 0\n n = int(input())\n p = [int(s) for s in input().split()]\n pp = [set() for s in range(n + 1)]\n for i in range(n):\n pp[p[i]].add(i + 1)\n pp[i + 1].add(p[i])\n for vertex in range(1, n + 1):\n if vertex not in used:\n dfs(vertex, pp, used)\n s += 1\n print(s)\n\n\nt = threading.Thread(target=main)\nt.start()\nt.join()", "from collections import deque\r\nimport sys\r\n\r\n\r\nn = int(input())\r\np = list(map(lambda x: int(x) - 1, input().split()))\r\n\r\nadj = [[] for _ in range(n)]\r\nfor i in range(n):\r\n if i != p[i]:\r\n adj[i].append(p[i])\r\n adj[p[i]].append(i)\r\n \r\nvis = [False] * n \r\n\r\ndef dfs(u):\r\n vis[u] = True\r\n for v in adj[u]:\r\n if vis[v] == False:\r\n dfs(v)\r\n \r\nres = 0\r\nfor i in range(n):\r\n if vis[i]:\r\n continue\r\n dfs(i)\r\n res += 1\r\n \r\nprint(res)\r\n\r\nsys.setrecursionlimit(10**6)", "class UnionFind:\n \"\"\"\n up_bound[x] = root of the component x belongs to\n up_bound[v] == v only for root of a component\n at the begining, every node is the root of its own component\n rank[root] = the size of the component of root (minus 1)\n\n \"\"\"\n def __init__(self, n):\n self.up_bound = list(range(n))\n self.rank = [0] * n\n\n def find(self, x_index):\n \"\"\"\n returns the root of the component x_index belongs to\n \"\"\"\n if self.up_bound[x_index] == x_index:\n return x_index\n #path compression happens with this recursive call\n self.up_bound[x_index] = self.find(self.up_bound[x_index])\n return self.up_bound[x_index]\n\n def union(self, x_index, y_index):\n repr_x = self.find(x_index)\n repr_y = self.find(y_index)\n if repr_x == repr_y: # already in the same component\n return False\n if self.rank[repr_x] == self.rank[repr_y]:\n self.rank[repr_x] += 1\n self.up_bound[repr_y] = repr_x\n elif self.rank[repr_x] > self.rank[repr_y]:\n self.up_bound[repr_y] = repr_x\n else:\n self.up_bound[repr_x] = repr_y\n return True\n\n\n\nn = int(input())\naa = list(map(int, input().split()))\n\naa = [x - 1 for x in aa]\n\nuu = UnionFind(n)\n\nnb_components = n\nfor i in range(n):\n u = i\n v = aa[i]\n regroup = uu.union(u, v)\n if regroup:\n nb_components -= 1\nprint(nb_components)\n\n\n", "# Test\r\n#####################################################################################################################\r\n\r\ndef nTreesInForest(PolandBalls, mostDistantRelatives):\r\n nTrees = 0\r\n forest = set()\r\n for iBall in PolandBalls:\r\n ball, itsRelative = iBall + 1, mostDistantRelatives[iBall]\r\n if ball == itsRelative:\r\n nTrees += 1\r\n elif itsRelative not in forest:\r\n nTrees += .5\r\n forest.add(itsRelative)\r\n\r\n return round(nTrees)\r\n\r\n\r\nprint(nTreesInForest(range(int(input())), tuple(map(int, input().split()))))\r\n", "import sys\r\nfrom collections import defaultdict\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\ndef find(a):\r\n v = []\r\n while a!=parent[a]:\r\n v.append(a)\r\n a = parent[a]\r\n \r\n for u in v:\r\n parent[u] = a\r\n return a\r\n\r\ndef union(a,b):\r\n a,b = find(a),find(b)\r\n \r\n if a==b:\r\n return\r\n if a>b:\r\n a,b = b,a\r\n parent[b] = a\r\n return\r\n\r\nn = get_int()\r\nparent = [i for i in range(n)]\r\n\r\na = get_list()\r\n\r\nfor i in range(n):\r\n union(i,a[i]-1)\r\n\r\ndict_pair = defaultdict(list)\r\n\r\nfor i,v in enumerate(parent):\r\n dict_pair[find(v)].append(i)\r\n\r\nprint(len(dict_pair.keys()))", "import sys\r\nsys.setrecursionlimit(10**6);\r\n\r\n# sys.stdin = open('input.txt', 'r')\r\n# sys.stdout = open('output.txt', 'w')\r\n\r\n\r\n\r\n\r\nn=int(input());\r\na=[-1]+list(map(int,input().split()));\r\nc1=c2=0;\r\nfor i in range(1,n+1):\r\n if a[i]==i:c1+=1;\r\n elif a[a[i]]==i:c2+=1;\r\nprint(c1+c2//2);", "def dfs(v):\r\n visited[v] = 1\r\n for u in graph[v]:\r\n if visited[u] == 0:\r\n dfs(u)\r\n\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\ngraph = [[] for _ in range(n)]\r\nfor i in range(n):\r\n graph[i].append(a[i] - 1)\r\n graph[a[i] - 1].append(i)\r\ncount = 0\r\nvisited = [0] * n\r\nfor i in range(n):\r\n if visited[i] == 1:\r\n continue\r\n dfs(i)\r\n count += 1\r\nprint(count)\r\n", "class UnionFind:\r\n def __init__(self, n):\r\n self.up_bound = list(range(n))\r\n self.rank = [0] * n\r\n\r\n def find(self, x_index):\r\n \"\"\"\r\n returns the root of the component x_index belongs to\r\n \"\"\"\r\n if self.up_bound[x_index] == x_index:\r\n return x_index\r\n #path compression happens with this recursive call\r\n self.up_bound[x_index] = self.find(self.up_bound[x_index])\r\n return self.up_bound[x_index]\r\n\r\n def union(self, x_index, y_index):\r\n repr_x = self.find(x_index)\r\n repr_y = self.find(y_index)\r\n if repr_x == repr_y: # already in the same component\r\n return False\r\n if self.rank[repr_x] == self.rank[repr_y]:\r\n self.rank[repr_x] += 1\r\n self.up_bound[repr_y] = repr_x\r\n elif self.rank[repr_x] > self.rank[repr_y]:\r\n self.up_bound[repr_y] = repr_x\r\n else:\r\n self.up_bound[repr_x] = repr_y\r\n return True\r\n\r\n\r\nt = int(input())\r\naa = list(map(int, input().split()))\r\n\r\n#we know that for i ,a[i] and i are connected\r\n\r\naa = [x - 1 for x in aa]\r\n\r\nuu = UnionFind(t)\r\n#start each node in his own component\r\nnb_components = t\r\n\r\nfor i in range(t):\r\n u = i\r\n v = aa[i]\r\n regroup = uu.union(u, v)\r\n\r\n if regroup:\r\n nb_components -= 1\r\n\r\nprint(nb_components)\r\n", "n = int(input())\r\n\r\nedge_list = list(map(int, input().split(' ')))\r\n\r\nadj = [[] for i in range(n+1)]\r\nvisited = [False for i in range(n+1)]\r\nfor idx, i in enumerate(edge_list):\r\n p = i-1\r\n adj[p].append(idx)\r\n adj[idx].append(p)\r\n\r\ndef dfs(node):\r\n if visited[node]:\r\n return\r\n\r\n visited[node] = True\r\n for ch in adj[node]:\r\n dfs(ch)\r\n\r\nnum_trees = 0\r\nfor i in range(n):\r\n if not visited[i]:\r\n num_trees += 1\r\n dfs(i)\r\n\r\nprint(num_trees)\r\n" ]

[ "from collections import defaultdict\r\nimport sys\r\ninput = sys.stdin.readline\r\nN, M = map(int, input().split())\r\n\r\n\r\nparent = [i for i in range(N)]\r\nrank = [0] * N\r\n\r\n\r\ndef find(i):\r\n if parent[i] == i:\r\n return i\r\n else:\r\n parent[i] = find(parent[i])\r\n return parent[i]\r\n\r\n\r\ndef same(x, y):\r\n return find(x) == find(y)\r\n\r\n\r\ndef unite(x, y):\r\n x = find(x)\r\n y = find(y)\r\n if x == y:\r\n return\r\n\r\n if rank[x] > rank[y]:\r\n parent[y] = x\r\n else:\r\n parent[x] = y\r\n if rank[x] == rank[y]:\r\n rank[y] += 1\r\n\r\n\r\nP = list(map(int, input().split()))\r\nfor i in range(M):\r\n a, b = map(int, input().split())\r\n a, b = a - 1, b - 1\r\n unite(a, b)\r\n\r\n\r\nd = defaultdict(list)\r\ncnt = defaultdict(int)\r\nfor i in range(N):\r\n d[find(i)].append(P[i])\r\n\r\nfor i in range(N):\r\n if find(i) == i:\r\n d[i] = sorted(d[i], reverse=True)\r\n\r\nans = []\r\nfor i in range(N):\r\n k = find(i)\r\n ans.append(d[k][cnt[k]])\r\n cnt[k] += 1\r\n\r\nprint(' '.join(map(str, ans)))\r\n", "import sys\r\n\r\nn, m = map(int, sys.stdin.buffer.readline().decode('utf-8').split(' '))\r\na = list(map(int, sys.stdin.buffer.readline().decode('utf-8').split(' ')))\r\nadj = [[] for _ in range(n)]\r\n\r\nfor u, v in (map(int, line.decode('utf-8').split()) for line in sys.stdin.buffer):\r\n adj[u-1].append(v-1)\r\n adj[v-1].append(u-1)\r\n\r\nvisited = [0]*n\r\nfor i in range(n):\r\n if visited[i]:\r\n continue\r\n visited[i] = 1\r\n num = [a[i]]\r\n i_list = [i]\r\n stack = [i]\r\n\r\n while stack:\r\n v = stack.pop()\r\n for dest in adj[v]:\r\n if not visited[dest]:\r\n visited[dest] = 1\r\n num.append(a[dest])\r\n i_list.append(dest)\r\n stack.append(dest)\r\n\r\n num.sort(reverse=True)\r\n i_list.sort()\r\n for j, v in zip(i_list, num):\r\n a[j] = v\r\n\r\nsys.stdout.buffer.write(' '.join(map(str, a)).encode('utf-8'))\r\n", "from collections import deque\r\nimport sys\r\ninput = sys.stdin.readline\r\n\r\ndef bfs(s):\r\n q = deque()\r\n q.append(s)\r\n x = []\r\n while q:\r\n i = q.popleft()\r\n x.append(i)\r\n for j in G[i]:\r\n if not visit[j]:\r\n visit[j] = 1\r\n q.append(j)\r\n return x\r\n\r\nn, m = map(int, input().split())\r\np = list(map(int, input().split()))\r\nG = [[] for _ in range(n + 1)]\r\nfor _ in range(m):\r\n a, b = map(int, input().split())\r\n G[a].append(b)\r\n G[b].append(a)\r\nvisit = [0] * (n + 1)\r\nfor i in range(1, n + 1):\r\n if not visit[i]:\r\n visit[i] = 1\r\n x = bfs(i)\r\n x.sort()\r\n y = [p[j - 1] for j in x]\r\n y.sort(reverse = True)\r\n for j in range(len(x)):\r\n p[x[j] - 1] = y[j]\r\nprint(*p)", "import sys\r\ninput=sys.stdin.readline\r\n\r\ndef make_set(v):\r\n parent[v]=v\r\n\r\ndef find_set(v):\r\n if v == parent[v]:\r\n return v\r\n else:\r\n parent[v]=find_set(parent[v])\r\n return parent[v]\r\n\r\ndef union_sets(a,b):\r\n a = find_set(a)\r\n b = find_set(b)\r\n if a != b:\r\n if rank[a]<rank[b]:\r\n a,b=b,a\r\n parent[b] = a\r\n if rank[a]==rank[b]:\r\n rank[a]+=1\r\n\r\n\r\n\r\nn,m=list(map(int,input().split()))\r\n\r\narr=list(map(int,input().split()))\r\n\r\nparent=[i for i in range(n)]\r\nrank=[0]*(n)\r\n\r\n \r\nfor i in range(m):\r\n a,b=list(map(int,input().split()))\r\n a=a-1\r\n b=b-1\r\n union_sets(a,b)\r\n \r\nb={}\r\nfor i in range(n):\r\n if find_set(i) not in b.keys():\r\n b[find_set(i)]=[]\r\n b[find_set(i)].append(i)\r\n\r\ne=[0]*n\r\nfor i in b:\r\n b[i].sort()\r\n c=[]\r\n for j in range(len(b[i])):\r\n c.append(arr[b[i][j]])\r\n c.sort(reverse=True)\r\n for j in range(len(b[i])):\r\n e[b[i][j]]=c[j]\r\nprint(*e)", "#------------------Important Modules------------------#\r\nfrom sys import stdin,stdout\r\nfrom bisect import bisect_left as bl\r\nfrom bisect import bisect_right as br\r\nfrom heapq import *\r\nfrom random import *\r\nfrom itertools import permutations\r\ninput=stdin.readline\r\nprin=stdout.write\r\nfrom random import sample\r\nfrom collections import Counter,deque\r\nfrom fractions import *\r\nfrom math import sqrt,ceil,log2,gcd,cos,pi,floor\r\nfrom copy import deepcopy\r\n#dist=[0]*(n)\r\nmod=10**9+7\r\nmod2=998244353\r\nclass DisjSet:\r\n def __init__(self, n):\r\n \r\n self.rank = [1] * n\r\n self.parent = [i for i in range(n)]\r\n \r\n \r\n # Finds set of given item x\r\n def find(self, x):\r\n \r\n \r\n if (self.parent[x] != x):\r\n \r\n \r\n self.parent[x] = self.find(self.parent[x])\r\n \r\n \r\n \r\n return self.parent[x]\r\n \r\n \r\n # Do union of two sets represented\r\n # by x and y.\r\n def union(self, x, y):\r\n \r\n # Find current sets of x and y\r\n xset = self.find(x)\r\n yset = self.find(y)\r\n \r\n \r\n if xset == yset:\r\n return\r\n \r\n \r\n if self.rank[xset] < self.rank[yset]:\r\n self.parent[xset] = yset\r\n \r\n elif self.rank[xset] > self.rank[yset]:\r\n self.parent[yset] = xset\r\n \r\n \r\n else:\r\n self.parent[yset] = xset\r\n self.rank[xset] = self.rank[xset] + 1\r\ndef ps(n):\r\n cp=0;lk=0;arr={}\r\n lk=0;ap=n\r\n cc=0\r\n while n%2==0:\r\n n=n//2\r\n cc=1\r\n if cc==1:\r\n lk+=1\r\n \r\n \r\n \r\n \r\n \r\n for ps in range(3,ceil(sqrt(n))+1,2):\r\n #print(ps)\r\n cc=0\r\n while n%ps==0:\r\n n=n//ps\r\n cc=1\r\n\r\n lk+=1 if cc==1 else 0\r\n \r\n \r\n \r\n if n!=1:\r\n lk+=1\r\n \r\n if lk==1: \r\n return False\r\n \r\n \r\n #print(arr)\r\n \r\n return True\r\n\r\n\r\n#count=0\r\n#dp=[[0 for i in range(m)] for j in range(n)]\r\n#[int(x) for x in input().strip().split()]\r\ndef gcd(x, y): \r\n \r\n while(y): \r\n x, y = y, x % y \r\n \r\n return x \r\n \r\n# Driver Code \r\ndef factorials(n,r):\r\n #This calculates ncr mod 10**9+7\r\n slr=n;dpr=r\r\n qlr=1;qs=1\r\n mod=10**9+7\r\n \r\n for ip in range(n-r+1,n):\r\n qlr=(qlr*ip)%mod\r\n for ij in range(1,r):\r\n qs=(qs*ij)%mod\r\n #print(qlr,qs)\r\n ans=(qlr*modInverse(qs))%mod\r\n return ans\r\n\r\n \r\n \r\ndef modInverse(b):\r\n qr=10**9+7\r\n return pow(b, qr - 2,qr)\r\n\r\n#===============================================================================================\r\n### START ITERATE RECURSION ###\r\nfrom types import GeneratorType\r\ndef iterative(f, stack=[]):\r\n def wrapped_func(*args, **kwargs):\r\n if stack: 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 continue\r\n stack.pop()\r\n if not stack: break\r\n to = stack[-1].send(to)\r\n return to\r\n return wrapped_func\r\ndef power(arr):\r\n listrep = arr\r\n subsets = []\r\n for i in range(2**len(listrep)):\r\n subset = []\r\n for k in range(len(listrep)): \r\n if i & 1<<k:\r\n subset.append(listrep[k])\r\n subsets.append(subset) \r\n return subsets\r\ndef pda(n) :\r\n list=[];su=0\r\n for i in range(1, int(sqrt(n) + 1)) :\r\n if (n % i == 0) :\r\n if (n // i == i) :\r\n list.append(i)\r\n su+=i\r\n else :\r\n list.append(n//i);list.append(i)\r\n su+=i;su+=n//i\r\n # The list will be printed in reverse \r\n return su\r\ndef dis(xa,ya,xb,yb):\r\n return sqrt((xa-xb)**2+(ya-yb)**2)\r\n#### END ITERATE RECURSION ####\r\n\r\n \r\n#===============================================================================================\r\n#----------Input functions--------------------#\r\ndef ii():\r\n return int(input())\r\ndef ilist():\r\n return [int(x) for x in input().strip().split()]\r\ndef islist():\r\n return list(map(str,input().split().rstrip()))\r\ndef inp():\r\n return input().strip()\r\ndef google(test):\r\n return \"Case #\"+str(test)+\": \";\r\ndef overlap(x1,y1,x2,y2):\r\n if x2>y1:\r\n return y1-x2\r\n if y1>y2:\r\n return y2-x2\r\n return y1-x2;\r\n\r\n\r\n###-------------------------CODE STARTS HERE--------------------------------###########\r\n\r\n \r\n \r\n\r\ndef dist(x1,y1,x2,y2):\r\n return sqrt((x1-x2)**2+(y1-y2)**2)\r\ndef sieve(n):\r\n \r\n \r\n prime = [True for i in range(n + 1)]\r\n p = 2\r\n while (p * p <= n):\r\n \r\n \r\n if (prime[p] == True):\r\n \r\n \r\n for i in range(p * 2, n + 1, p):\r\n prime[i] = False\r\n p += 1\r\n prime[0]= False\r\n prime[1]= False\r\n ans=[]\r\n for i in range(1,n+1):\r\n if prime[i]:\r\n ans.append(i)\r\n return ans\r\n \r\n \r\ndef prod(arr):\r\n n=len(arr)\r\n k=1\r\n for j in range(n):\r\n k*=arr[j]\r\n return k\r\ndef SumOfDigits(s):\r\n su=0\r\n while (s):\r\n su+=s%10\r\n s=s//10\r\n return su\r\ndef std():\r\n return stdout.flush()\r\n \r\n#########################################################################################\r\n#def valid(sec,hr,min,nano):\r\ndef finds(s):\r\n att=0\r\n i=1\r\n while i<len(s):\r\n att=int(s[:i])\r\n j=i\r\n cc=0\r\n while j<len(s):\r\n att+=1\r\n sk=att\r\n news=str(sk)\r\n rr=len(news)\r\n #print(i,j,news,rr,s[j:j+rr])\r\n if news==s[j:j+rr]:\r\n #print(i,j,news,rr,s[j:j+rr])\r\n j+=rr\r\n \r\n #continue\r\n else:\r\n cc=1\r\n break\r\n if cc==0:\r\n return True\r\n i+=1\r\n return False\r\n \r\n \r\n\r\n \r\n#print(finds('78910'))\r\narr=[]\r\nfor i in range(1,10001):\r\n s=str(i)\r\n j=i\r\n while len(s)<=7:\r\n j+=1\r\n s+=str(j)\r\n arr.append(int(s))\r\n\r\n \r\n\r\narr.sort() \r\ndef subs(arr):\r\n \r\n \r\n res = set()\r\n \r\n pre = {0}\r\n \r\n for x in arr:\r\n pre = {x | y for y in pre} | {x}\r\n res |= pre\r\n \r\n return len(res) \r\n \r\ndef sl(n):\r\n return (n*(n+1))//2\r\n\r\n#t=ii()\r\nt=1\r\n\r\n \r\nfor pl in range(t):\r\n n,m=ilist()\r\n #arr=[0]\r\n arr=ilist()\r\n ob=DisjSet(n)\r\n for i in range(m):\r\n a,b=ilist()\r\n a-=1;b-=1\r\n ob.union(a,b)\r\n finds=[0]*n\r\n for i in range(n):\r\n finds[i]=ob.find(i)\r\n dicts={}\r\n for i in range(n):\r\n if finds[i] in dicts:\r\n dicts[finds[i]].append(i)\r\n else:\r\n dicts[finds[i]]=[i]\r\n brr=[0]*n\r\n for ij in dicts:\r\n temp=dicts[ij]\r\n news=[]\r\n for pj in temp:\r\n news.append(arr[pj])\r\n news.sort()\r\n news=news[::-1]\r\n co=0\r\n for jj in temp:\r\n brr[jj]=news[co]\r\n co+=1\r\n print(*brr)\r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n \r\n" ]

[ "n = int(input())\r\n\r\nzap = list(map(int, input().split()))\r\n\r\nupperbound = float('inf')\r\nlowerbound = -float('inf')\r\n\r\ncounter = 1\r\nfor item in zap:\r\n upperbound = min(upperbound, 10/counter + 10 * item / counter)\r\n counter += 1\r\n\r\nk = 1\r\nfor item in zap:\r\n lowerbound = max(lowerbound, item * 10 / k)\r\n k += 1\r\n\r\n\r\nbenzonthelastmax = (1 + len(zap)) * (upperbound - 10**(-6)) - 10 * zap[-1]\r\nbenzonthelastmin = (1 + len(zap)) * (lowerbound + 10**(-6)) - 10 * zap[-1]\r\n\r\nif(benzonthelastmin // 10 == benzonthelastmax // 10):\r\n print(\"unique\")\r\n print(int(zap[-1] + benzonthelastmin // 10))\r\nelse:\r\n print(\"not unique\")\r\n", "eps=10**(-9)\nmn=10\nmx=100000000\nn=int(input())\narr=list(map(int,input().split()))\nfor i in range(n):\n mn = max(mn,(arr[i]*10)/(i+1))\n mx = min(mx,((arr[i]+1)*10)/(i+1))\nans1=((n+1)*mn)//10\nans2=((n+1)*(mx-eps))//10\nif ans2>ans1:\n print('not unique')\nelse:\n print('unique')\n print(int(ans1))\n\n\n\n\n\n", "# ========= /\\ /| |====/|\r\n# | / \\ | | / |\r\n# | /____\\ | | / |\r\n# | / \\ | | / |\r\n# ========= / \\ ===== |/====| \r\n# code\r\n\r\ndef main():\r\n n = int(input())\r\n a = list(map(int ,input().split()))\r\n\r\n lb = 10\r\n ub = 1e9\r\n\r\n for i in range(n):\r\n lb = max(lb , 10 * a[i] / (i + 1))\r\n ub = min(ub , 10 * (a[i] + 1)/(i + 1))\r\n \r\n # print(lb , ub)\r\n minimumstageitcanreach = a[-1] + ((n + 1)*lb - a[-1]*10)//10\r\n ns = minimumstageitcanreach + 1\r\n # print(ns)\r\n minalpha = ns * 10 / (n + 1)\r\n # print(minalpha)\r\n\r\n if abs(minalpha - ub) >= 1e-6:\r\n if minalpha < ub:\r\n print(\"not unique\")\r\n else:\r\n print(\"unique\")\r\n print(int(minimumstageitcanreach))\r\n else:\r\n print(\"unique\")\r\n print(int(minimumstageitcanreach))\r\n return\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "from re import *\r\nfrom sys import stderr\r\ndef readint():\r\n return int(input())\r\ndef readfloat():\r\n return float(input())\r\ndef readarray(N, foo=input):\r\n return [foo() for i in range(N)]\r\ndef readlinearray(foo=int):\r\n return map(foo, input().split())\r\n \r\ndef NOD(a, b):\r\n while b:\r\n a,b = b, a%b\r\n return a\r\n \r\ndef gen_primes(max):\r\n primes = [1]*(max+1)\r\n for i in range(2, max+1):\r\n if primes[i]:\r\n for j in range(i+i, max+1, i):\r\n primes[j] = 0\r\n primes[0] = 0\r\n return [x for x in range(max+1) if primes[x]]\r\n \r\ndef is_prime(N):\r\n i = 3\r\n if not(N % 2):\r\n return 0\r\n while i*i < N:\r\n if not(N % i):\r\n return 0\r\n i += 3\r\n return 1\r\n \r\nn = readint()\r\ns = readlinearray()\r\n \r\nk = 1\r\nmina = 0\r\nmaxa = 999999\r\nprev = 0\r\n \r\nfor c in s:\r\n mina = max(c / k, mina)\r\n maxa = min((c + 1) / k - 1e-10, maxa)\r\n k += 1\r\n \r\n#print(mina, maxa)\r\nfirst = int(mina * (n + 1))\r\nlast = int(maxa * (n + 1))\r\n#print(first, last)\r\nif first == last:\r\n print(\"unique\\n%d\" % (first, ))\r\nelse:\r\n print(\"not unique\")", "n = int(input())\r\n\r\np = [None] + list(map(int, input().split()))\r\n\r\nleft_bound = 10\r\nright_bound = 10**10\r\n\r\nfor i in range(1, n+1):\r\n #p[i]*10/i <= a < (10 + p[i]*10)/i\r\n left_bound = max(left_bound, (p[i]*10)/i)\r\n right_bound = min(right_bound, (10+p[i]*10)/i)\r\n\r\nstart = p[n]+1\r\n\r\nl = left_bound*(n+1) - 10*(p[-1]+1)\r\nr = right_bound*(n+1) - 10*(p[-1]+1)\r\n\r\nif (l//10) != ((r-10**(-14))//10):\r\n print('not unique')\r\nelse:\r\n print('unique')\r\n print(int(start + l//10))", "import math\r\n \r\ndef readGen(trans):\r\n\twhile 1:\r\n\t\tfor x in input().split():\r\n\t\t\tyield(trans(x))\r\nreadint=readGen(int)\r\n \r\nn=next(readint)\r\na=[0]+[next(readint) for i in range(n)]\r\n \r\np=max((n+1)*a[i]/i-1 for i in range(1,n+1))\r\nq=min((n+1)*(a[i]+1)/i for i in range(1,n+1))\r\n \r\neps=1e-8\r\nu=math.floor(q-eps)\r\nl=math.ceil(p+eps)\r\n#print(p,q,l,u)\r\nif (l<u): print(\"not unique\")\r\nelse: print(\"unique\\n%d\"%l)", "n = int(input())\r\nstops = list(map(int, input().split()))\r\n\r\nlow = 10\r\nhigh = stops[0] * 10 + 10\r\ni = 0\r\nfor mile in range(1, stops[-1] + 1):\r\n if stops[i] == mile:\r\n high = min(high, (mile * 10 + 10) / (i + 1))\r\n i += 1\r\n else:\r\n low = max(low, (mile * 10 + 10) / (i + 1))\r\n\r\na = int((low + len(stops) * low - stops[-1] * 10) / 10)\r\nb = int((high + len(stops) * high - stops[-1] * 10) / 10 - 1e-9)\r\n#print(low, a)\r\n#print(high, b)\r\nif a == b:\r\n print('unique')\r\n print(stops[-1] + a)\r\nelse:\r\n print('not unique')\r\n", "n = int(input())\nstops = list(map(int, input().split()))\n\nlow = 10\nhigh = stops[0] * 10 + 10\ni = 0\nfor mile in range(1, stops[-1] + 1):\n if stops[i] == mile:\n high = min(high, (mile * 10 + 10) / (i + 1))\n i += 1\n else:\n low = max(low, (mile * 10 + 10) / (i + 1))\n\na = int((low + len(stops) * low - stops[-1] * 10) / 10)\nb = int((high + len(stops) * high - stops[-1] * 10) / 10 - 1e-9)\n#print(low, a)\n#print(high, b)\nif a == b:\n print('unique')\n print(stops[-1] + a)\nelse:\n print('not unique')\n" ]

[ "n,k,m=map(int,input().split())\r\na=list(map(int,input().split()))\r\n\r\nmods=[0]*m\r\nmod=0\r\nfor i in range(n):\r\n\tmod=a[i]%m\r\n\tmods[mod]+=1\r\n\tif mods[mod]==k:\r\n\t\tbreak\r\nelse:\r\n\tprint('No')\r\n\texit()\r\nprint('Yes')\r\nresults=[None]*k\r\ncount=0\r\nfor i in range(n):\r\n\tcur=a[i]\r\n\tif cur%m==mod:\r\n\t\tresults[count]=cur\r\n\t\tcount+=1\r\n\t\tif count==k:\r\n\t\t\tprint(' '.join(map(str,results)))\r\n\t\t\tbreak", "'''input\r\n3 2 3\r\n1 8 4\r\n'''\r\nfrom collections import defaultdict as dd\r\nfrom collections import Counter as ccd\r\nfrom itertools import permutations as pp\r\nfrom itertools import combinations as cc\r\nfrom random import randint as rd\r\nfrom bisect import bisect_left as bl\r\nfrom bisect import bisect_right as br\r\nimport heapq as hq\r\nfrom math import gcd\r\n'''\r\nAuthor : dhanyaabhirami\r\nHardwork beats talent if talent doesn't work hard\r\n'''\r\n'''\r\nStuck?\r\nSee github resources\r\nDerive Formula\r\nKmcode blog\r\nCP Algorithms Emaxx\r\n'''\r\nmod=pow(10,9) +7\r\ndef inp(flag=0):\r\n if flag==0:\r\n return list(map(int,input().strip().split(' ')))\r\n else:\r\n return int(input())\r\n\r\n# Code credits\r\n# assert(debug()==true)\r\n# for _ in range(int(input())):\r\n\r\nn,k,m=inp()\r\nl=inp()\r\nd=dd(int)\r\nans=[]\r\nmodulo = []\r\nfor i in range(n):\r\n modulo.append(l[i]%m)\r\n d[l[i]%m]+=1\r\nfor i in d:\r\n if d[i]>=k:\r\n for j in range(n):\r\n if modulo[j]==i:\r\n ans.append(l[j])\r\nif len(ans)>=k:\r\n print(\"Yes\")\r\n print(*ans[:k])\r\nelse:\r\n print(\"No\")", "n,k,m=list(map(int,input().split()))\r\nb=[[] for i in range(m)]\r\nc=[0 for i in range(m)]\r\nfor i in map(int,input().split()):\r\n j=i%m\r\n b[j].append(i)\r\n c[j]+=1\r\n if c[j]==k:\r\n print('Yes')\r\n print(' '.join(str(i) for i in b[j]))\r\n break\r\nelse:\r\n print('No')\r\n", "n, k, m = [int(z) for z in input().split()]\r\na = [int(z) for z in input().split()]\r\nd = dict()\r\nfor i in range(n):\r\n mod = a[i] % m\r\n if mod in d:\r\n d[mod].append(a[i])\r\n else:\r\n d[mod] = [a[i]]\r\nfor elem in d:\r\n if len(d[elem]) >= k:\r\n print(\"Yes\")\r\n for i in range(k):\r\n print(d[elem][i], end=\" \")\r\n exit(0)\r\nprint(\"No\")", "\r\n\"\"\"\r\n\r\n\"\"\"\r\n\r\nimport sys\r\nfrom sys import stdin\r\n\r\n\r\nn,k,m = map(int,stdin.readline().split())\r\n\r\na = list(map(int,stdin.readline().split()))\r\n\r\ndic = {}\r\n\r\nfor i in range(n):\r\n\r\n rem = a[i] % m\r\n\r\n if rem not in dic:\r\n dic[rem] = []\r\n\r\n dic[rem].append(a[i])\r\n\r\nfor rem in dic:\r\n\r\n lis = dic[rem]\r\n\r\n if len(lis) >= k:\r\n print (\"Yes\")\r\n print (*lis[:k])\r\n sys.exit()\r\n\r\nprint (\"No\")\r\n", "def main():\n n,k,m = map(int,input().split())\n a = list(map(int,input().split()))\n b = {}\n for i in range(m):\n b[i] = [[],0]\n index = -1\n for i in a:\n b[i%m][0].append(i)\n b[i%m][1] += 1\n if b[i%m][1] >= k:\n index = i%m\n break\n if index == -1:\n print(\"No\")\n else:\n print(\"Yes\")\n print(*b[index][0])\nif __name__ == '__main__':\n main()\n", "import sys\n\ndef main():\n n, k, m = [int(x) for x in sys.stdin.readline().rstrip().rsplit()]\n l = [int(x) for x in sys.stdin.readline().rstrip().rsplit()]\n divSets = {}\n for elem in l:\n if elem % m in divSets:\n divSets[elem % m].append(elem)\n else:\n divSets[elem % m] = [elem]\n retSet = None\n for key in divSets.keys():\n if len(divSets[key]) >= k:\n retSet = divSets[key][:k]\n if retSet is None:\n print(\"No\")\n else:\n print(\"Yes\")\n print(\" \".join(map(str,retSet)))\n \nmain()\n", "n,k,m =map(int,input().split())\na=list(map(int,input().split()))\nb=[[]for i in range(m)]\nfor i in a:\n b[i%m].append(i)\nfor i in range(m):\n if len(b[i])>=k:\n print(\"Yes\")\n print(*b[i][:k])\n exit(0)\nprint(\"No\")\n\t \t \t \t\t\t\t \t \t \t \t\t\t \t", "from collections import Counter\r\nn, k, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\n\r\nb = [ai%m for ai in a]\r\nc = Counter(b)\r\nv, x = c.most_common(1)[0]\r\nd = [ai for ai in a if ai%m==v]\r\nif x>=k:\r\n print('Yes')\r\n print(*d[:k])\r\nelse:\r\n print('No')\r\n", "import sys\r\ninput=sys.stdin.readline\r\nimport math as mt\r\nimport collections as cc\r\ndef ncr(n,r):\r\n import math as mt\r\n return (mt.factorial(n)//((mt.factorial(n-r))*(mt.factorial(r))))\r\n \r\nI=lambda:list(map(int,input().split()))\r\nn,k,m=I()\r\nl=I()\r\nf=cc.defaultdict(list)\r\nfor i in l:\r\n f[i%m].append(i)\r\nfor i in f:\r\n if len(f[i])>=k:\r\n print('Yes')\r\n temp=f[i][:k]\r\n print(*temp)\r\n sys.exit()\r\nprint('No')\r\n \r\n", "from collections import defaultdict\r\narr=list(map(int, input().rstrip().split()))\r\nn=arr[0]\r\nk=arr[1]\r\nm=arr[2]\r\nd=defaultdict(int)\r\nnos=defaultdict(list)\r\nbrr=list(map(int, input().rstrip().split()))\r\ncrr=[]\r\nfor i in range(n):\r\n d[(brr[i]%m)]+=1 \r\n nos[(brr[i]%m)].append(brr[i])\r\ncnt=0\r\nfor i in d:\r\n gg=d[i]\r\n if(gg>=k):\r\n print('Yes')\r\n ans=nos[i]\r\n ans=ans[:k]\r\n print(*ans)\r\n cnt=1\r\n break\r\n\r\n \r\nif(cnt==0):\r\n print('No')", "def read():\r\n return [int(x) for x in input().split()]\r\n\r\nn, k, m = read()\r\na = read()\r\nb = [0] * n\r\nmods = []\r\nfor i in range(m):\r\n mods.append([])\r\nfor i in range(len(a)):\r\n b[i] = a[i] % m\r\n mods[b[i]].append(a[i])\r\n#print(b)\r\n#print(mods)\r\nfor i in mods:\r\n if len(i) >= k:\r\n s = ''\r\n print('Yes')\r\n for j in range(k):\r\n s+= str(i[j]) + ' '\r\n print(s)\r\n exit(0)\r\nprint('No')\r\n ", "n,k,m=map(int , input().split())\nl=list(map(int,input().split()))\nl1=[i%m for i in l]\nrem=[0]*m\nfor e in l1:\n\trem[e]+=1\nf=-1\nfor e in range(m):\n\tif rem[e]>=k:\n\t\tf=e\nif f==-1:\n\tprint(\"No\")\nelse:\n\tg,i=0,0\n\tprint(\"Yes\")\n\twhile(i<n and g<k):\n\t\tif l1[i]==f:\n\t\t\tprint(l[i],end=' ')\n\t\t\tg+=1\n\t\ti+=1\n", "import sys\n \ndef main():\n modular_table = {}\n n, k, m = map(int, sys.stdin.readline().split())\n for x in map(int, sys.stdin.readline().split()):\n modular_x = x % m\n if modular_x not in modular_table:\n modular_table[modular_x] = []\n modular_table[modular_x].append(x)\n\n for modular_x in modular_table:\n x_list = modular_table[modular_x]\n if len(x_list) >= k:\n print('Yes')\n print(' '.join(map(str, x_list[:k])))\n return\n print('No')\n \nif __name__ == '__main__':\n sys.exit(main())", "n, k, m = map(int, input().split())\r\na = [int(i) for i in input().split()]\r\nb = {}\r\nfor i in a:\r\n\tif i%m in b:\r\n\t\tb[i%m] += 1;\r\n\telse:\r\n\t\tb[i%m] = 1;\r\n\r\nfor i in b:\r\n\tif b[i] >= k:\r\n\t\tprint('Yes')\r\n\t\tfor j in a:\r\n\t\t\tif j%m == i and k>0:\r\n\t\t\t\tprint(j, end = ' ')\r\n\t\t\t\tk -= 1\r\n\t\texit(0)\r\nprint('No')\r\n", "n, k, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\nb = dict()\r\nx = -1\r\nfor i in a:\r\n b[i%m] = b.get(i % m, 0) + 1\r\nfor e, f in b.items():\r\n if f >= k:\r\n x = e\r\nif x != -1:\r\n print('Yes')\r\n for i in a:\r\n if k > 0 and i % m == x:\r\n print(i, end=' ')\r\n k -= 1\r\nelse:\r\n print('No')", "from collections import Counter\nn, k, m = (int(x) for x in input().split())\na = [int(x) for x in input().split()]\nc = Counter([x % m for x in a])\nv = max(c.values())\nif v < k:\n print('No')\nelse:\n print('Yes')\n for x in c:\n if c[x] >= k:\n i = 0\n for p in a:\n if p % m == x and i < k:\n print(p, end=' ')\n i += 1\n print()\n break", "n, k, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\nrem = [0] * m\r\nfor i in range(n):\r\n rem[a[i] % m] += 1\r\nok = False\r\nnum = -1\r\nfor i in range(m):\r\n if (rem[i] >= k):\r\n num = i\r\n ok = True\r\nif not (ok):\r\n print(\"No\")\r\nelse:\r\n print(\"Yes\")\r\n for i in range(n):\r\n if a[i] % m == num:\r\n k -= 1\r\n print(a[i], end=' ')\r\n if k == 0:\r\n break\r\n", "import sys\nimport math as mt\nimport collections as cc\ndef ncr(n,r):\n import math as mt\n return (mt.factorial(n)//((mt.factorial(n-r))*(mt.factorial(r))))\n \nI=lambda:list(map(int,input().split()))\nn,k,m=I()\nl=I()\nf=cc.defaultdict(list)\nfor i in l:\n f[i%m].append(i)\nfor i in f:\n if len(f[i])>=k:\n print('Yes')\n temp=f[i][:k]\n print(*temp)\n sys.exit()\nprint('No')\n \n\n \t \t\t \t \t \t \t \t \t \t \t", "n, k, m = map(int, input().split())\r\nA = tuple(map(int, input().split()))\r\n\r\nring = [[] for i in range(m)]\r\nfor a in A:\r\n ring[a%m].append(a)\r\n\r\nfor i in range(m):\r\n if len(ring[i]) >= k:\r\n A = ring[i][:k]\r\n print(\"Yes\")\r\n print(*A)\r\n exit(0)\r\n\r\nprint(\"No\")", "n,k,m = [int(i) for i in input().split()]\nA = [int(i) for i in input().split()]\nmods = [[] for i in range(m)]\nfor a in A:\n mods[a%m].append(a)\nfor i in range(len(mods)):\n if len(mods[i]) >= k:\n print(\"Yes\")\n print(\" \".join(map(str, mods[i][:k])))\n break\nelse:\n print(\"No\")\n \t\t\t \t\t\t \t\t\t \t \t\t \t\t\t\t", "n,k,m=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nd=[]\r\nfor i in range(m):\r\n d.append([])\r\nfor i in l:\r\n d[i%m].append(i)\r\nfor i in d:\r\n if(len(i)>=k):\r\n print(\"Yes\")\r\n print(*i[:k])\r\n exit()\r\nprint(\"No\")\r\n", "n,k,m=map(int,input().split())\r\na={};b={}\r\nfor i in range(m):\r\n\ta[i]=0\r\n\tb[i]=[]\r\nfor i in map(int,input().split()):\r\n\tq=i%m\r\n\ta[q]+=1\r\n\tb[q].append(i)\r\n\tif a[q]==k:\r\n\t\tprint('Yes')\r\n\t\texit(print(*b[q]))\r\nprint('No')", "l1 = input().split()\r\nn = int(l1[0])\r\nk = int(l1[1])\r\nm = int(l1[2])\r\nA_string = input().split()\r\nA = []\r\nfor i in range(n):\r\n A.append(int(A_string[i]))\r\nsame_remainder = {}\r\nfor i in A:\r\n if i%m not in same_remainder.keys():\r\n same_remainder[i%m] = [str(i)]\r\n else:\r\n same_remainder[i%m].append(str(i))\r\nans = 'No'\r\nfor i in same_remainder.keys():\r\n if len(same_remainder[i]) >= k:\r\n ans = 'Yes'\r\n result = same_remainder[i][:k]\r\n break\r\nprint(ans)\r\nif ans == 'Yes':\r\n print(' '.join(result))", "import collections\n\ndef solve():\n n, k, m = map(int, input().split())\n a = list(map(int, input().split()))\n mults = collections.Counter([a[i] % m for i in range(n)])\n # m = a[i] - a[j]\n # a[i] - m = a[j]\n for key in mults:\n if mults[key] >= k:\n print('Yes')\n print(*[a[i] for i in range(n) if a[i] % m == key][:k])\n return\n print('No')\n\n\nfor _ in range(1 if 1 else int(input())):\n solve()\n \n", "import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,copy,functools\n\nsys.setrecursionlimit(10**7)\ninf = 10**20\neps = 1.0 / 10**15\nmod = 10**9+7\n\ndef LI(): return [int(x) for x in sys.stdin.readline().split()]\ndef LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]\ndef LF(): return [float(x) for x in sys.stdin.readline().split()]\ndef LS(): return sys.stdin.readline().split()\ndef I(): return int(sys.stdin.readline())\ndef F(): return float(sys.stdin.readline())\ndef S(): return input()\ndef pf(s): return print(s, flush=True)\n\n\ndef main():\n n,k,m = LI()\n a = LI()\n d = collections.defaultdict(list)\n for c in a:\n d[c%m].append(c)\n\n for c,v in d.items():\n if len(v) >= k:\n r = 'Yes\\n'\n r += ' '.join(map(str,v[:k]))\n return r\n\n return 'No'\n\n\nprint(main())\n\n\n", "n,k,m = map(int,input().split())\r\n\r\nl = list(map(int,input().split()))\r\n\r\nrem_table = [[] for i in range(m)]\r\n\r\nfor i in range(n):\r\n\trem_table[l[i]%m].append(l[i])\r\n\r\nfor i in range(m):\r\n\r\n\tif len(rem_table[i]) >= k:\r\n\t\tprint(\"Yes\")\r\n\t\tprint(*rem_table[i][:k])\r\n\t\texit()\r\n\r\nprint(\"No\")", "import sys\nn, k, m, *a = [int(z) for z in sys.stdin.read().split()]\nd = {}\nfor z in a:\n l = d.setdefault(z % m, [])\n l.append(z)\nfor l in d.values():\n if len(l) >= k:\n print('Yes')\n print((('{} '*k).format(*l[:k]))[:-1])\n sys.exit()\nprint('No')\n", "n,k,m = map(int,input().split())\r\na = list(map(int,input().split()))\r\nr = [0]*m\r\nfor i in a:\r\n r[i%m] += 1\r\n if r[i%m] == k:\r\n print('Yes')\r\n f = i%m\r\n for j in a:\r\n if k and j%m == f:\r\n k-=1\r\n print(j,' ', end='', sep='')\r\n break\r\nelse:\r\n print ('No')\r\n", "n,k,m=map(int,input().split( ))\r\narr=list(map(int,input().split( )))\r\nd={}\r\nfor i in range(m):\r\n d[i]=[]\r\nfor i in range(len(arr)):\r\n rem=arr[i]%m\r\n d[rem].append(arr[i])\r\n\r\nflag=0\r\nfor key,v in d.items():\r\n\r\n if len(v)>=k:\r\n flag=1\r\n print(\"Yes\")\r\n for j in range(k):\r\n print(v[j],end=\" \")\r\n break\r\nif flag==0:\r\n print(\"No\")", "# LUOGU_RID: 104702197\na=input().split()\r\nb=input().split()\r\nc=[]\r\nfor i in range(0,len(a)):\r\n\ta[i]=int(a[i])\r\nn=a[0]\r\nk=a[1]\r\nm=a[2]\r\nfor i in range(0,len(b)):\r\n\tb[i]=int(b[i])\r\nfor i in range(0,m):\r\n\tc.append([])\r\nfor i in range(0,len(b)):\r\n\th=b[i]%m\r\n\tc[h].append(b[i])\r\nflag=False\r\nfor i in range(0,len(c)):\r\n\tif(len(c[i])>=k):\r\n\t\tflag=True\r\n\t\tprint(\"Yes\")\r\n\t\tfor j in range(0,k):\r\n\t\t\tprint(c[i][j],end=\" \")\r\n\t\tbreak\r\n\r\nif flag==False:\r\n\tprint(\"No\")", "(n, k, m) = map(int, input().split())\r\n\r\nlst = []\r\nfor x in input().split():\r\n lst.append(int(x))\r\n\r\na = [0] * m\r\n\r\nfor x in lst:\r\n p = x % m\r\n a[p] += 1\r\n\r\nif max(a) >= k:\r\n print('Yes')\r\n x = a.index(max(a))\r\n i = 0\r\n while k > 0:\r\n if lst[i] % m == x:\r\n print(lst[i], end=' ')\r\n k -= 1\r\n i += 1\r\nelse:\r\n print('No')\r\n", "n, k, m=map(int, input().split())\r\narr=list(map(int, input().split()))\r\nmod=[0]*m\r\nfor i in arr:\r\n mod[i%m]+=1\r\ng=-1\r\nr=max(mod)\r\nif (r>=k):\r\n print(\"Yes\")\r\n g=mod.index(r)\r\nelse:\r\n print(\"No\")\r\n quit()\r\ni=0\r\nwhile k:\r\n if arr[i]%m==g:\r\n print(arr[i],end=\" \")\r\n k -= 1\r\n i+=1\r\n", "import collections\n\nn,k,m = tuple(map(int,input().split()))\n\nnums = list(map(int,input().split()))\n\n\nd = collections.defaultdict(list)\nfor i in nums:\n\n\td[i%m].append(i)\n\n\nfor i in d:\n\n\tif len(d[i]) >= k:\n\t\tprint(\"Yes\")\n\t\tfor j in range(k):\n\t\t\tprint(d[i][j],end = \" \")\n\t\tprint()\n\t\texit()\n\n\nprint(\"No\")\n\n", "n, k, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\nrec = [[] for i in range(m)]\r\nfor i in range(n):\r\n rec[a[i] % m].append(a[i])\r\n\r\nflag = False\r\nfor i in range(m):\r\n if len(rec[i]) >= k:\r\n print(\"Yes\")\r\n print(\" \".join(map(str, rec[i][:k])))\r\n flag = True\r\n break\r\n\r\nif not flag:\r\n print(\"No\")", "\nimport sys\nfrom collections import Counter\n\n\"\"\"\nsys.stdin = open('input.txt', 'r') \nsys.stdout = open('output.txt', 'w')\n\"\"\"\n\nn,k,m = map(int, input().split())\n\nmylist = map(int, input().split())\n\nD = Counter(mylist)\nnums = list(D.keys())\n\ngroups = {}\n\nfor num in nums:\n\tif num%m in groups:\n\t\tgroups[num%m].append(num)\n\telse:\n\t\tgroups[num%m] = [num]\n\nans = None\nfor group in groups.values():\n\tif sum(D[x] for x in group) >= k:\n\t\tans = group\n\t\tbreak\n\nif ans:\n\tprint(\"Yes\")\n\tto_print = []\n\tfor num in group:\n\t\tfor x in range(D[num]):\n\t\t\tto_print.append(num)\n\tprint(\" \".join(str(x) for x in to_print[:k]))\nelse:\n\tprint(\"No\")", "def solve(l,k,m):\r\n modded = [[] for _ in range (m)]\r\n for i in l:\r\n modded[i%m].append(i)\r\n for array in modded:\r\n if len(array) >= k:\r\n return array[:k]\r\n return None\r\n\r\n\r\nn ,k ,m = map(int,input().split())\r\nl = list(map(int,input().split()))[:n]\r\n\r\nsolution = solve(l,k,m)\r\nif(solution):\r\n print ( \"Yes\")\r\n print(\" \".join(map(str,solution)))\r\nelse :\r\n print(\"No\")", "n,m,k=map(int,input().split())\r\nd=[[] for i in range(k)]\r\nl=[int(j) for j in input().split()]\r\nfor i in range(n):\r\n r=l[i]%k\r\n d[r].append(l[i])\r\nflag=0\r\nfor i in d:\r\n if len(i)>=m:\r\n print('Yes')\r\n print(*i[:m])\r\n flag=1\r\n break\r\nif flag==0:\r\n print('No')\r\n", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\nn, k, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\nx = [[] for _ in range(m)]\r\nfor i in a:\r\n x[i % m].append(i)\r\nans = \"No\"\r\nfor i in range(m):\r\n if len(x[i]) >= k:\r\n ans = \"Yes\"\r\n b = x[i][:k]\r\n break\r\nprint(ans)\r\nif ans == \"Yes\":\r\n sys.stdout.write(\" \".join(map(str, b)))", "n,k,m=map(int,input().split())\r\ns=input().split()\r\nx=[0]*m\r\nfor i in range(n):\r\n s[i]=int(s[i])\r\n x[s[i]%m]+=1\r\nz=-1\r\nfor i in range(m):\r\n if x[i]>=k:\r\n z=i\r\n break\r\nif z==-1:\r\n print('No')\r\nelse:\r\n i=0\r\n print('Yes')\r\n while k > 0:\r\n if s[i]%m==z:\r\n k+=-1\r\n print(s[i],end=' ')\r\n i+=1\r\n \r\n \r\n", "n=[int(x) for x in input().split()]\r\nl=[int(x) for x in input().split()]\r\nk=[]\r\nfor i in range(n[2]):\r\n k.append([])\r\nfor i in range(len(l)):\r\n k[(l[i]%n[2])].append(l[i])\r\nc=0 \r\nfor i in k:\r\n if(len(i)>=n[1]):\r\n print(\"Yes\")\r\n for j in range(n[1]):\r\n print(i[j],end=\" \")\r\n c=1\r\n break\r\n else:\r\n continue\r\nif(c==0):\r\n print(\"No\")\r\n ", "from collections import defaultdict\r\n\r\nn, k, m = list(map(int, input().split()))\r\nnums = list(map(int, input().split()))\r\n\r\nrem = defaultdict(int)\r\nlists = defaultdict(list)\r\n\r\nfor num in nums:\r\n\trem[num % m] += 1\r\n\tlists[num % m].append(num)\r\n\r\nif max(rem.values()) >= k:\r\n\tprint('Yes')\r\n\tprint(*lists[max(rem, key=rem.get)][:k], sep=' ')\r\nelse:\r\n\tprint('No')", "n,k,m=map(int,input().split())\na=list(map(int,input().split()))\n\nb=[0]*m\nfor x in a:\n\tb[x%m]+=1\n\nfor i in range(m):\n\tif b[i]>=k:\n\t\tprint('Yes')\n\t\tcnt=k\n\t\tfor x in a:\n\t\t\tif cnt==0:\n\t\t\t\tbreak\n\t\t\tif x%m==i:\n\t\t\t\tprint(x,end=' ')\n\t\t\t\tcnt-=1\n\n\t\texit(0)\n\t\nprint('No')\n", "n,k,m=map(int,input().split())\r\n\r\nnums=[[0,[]] for i in range(m)]\r\nres=False\r\n\r\nfor i in map(int,input().split()):\r\n temp=i%m\r\n nums[temp][0]+=1\r\n nums[temp][1]+=[i]\r\n if nums[temp][0]==k:res=True;break\r\n\r\nif res:print(\"Yes\");print(*nums[temp][1])\r\nelse:print(\"No\")", "import sys\r\ninput = sys.stdin.readline\r\nfrom collections import Counter\r\n\r\nn, k, m = map(int, input().split())\r\nw1 = list(map(int, input().split()))\r\nw = [i%m for i in w1]\r\nd = Counter(w).most_common()\r\nif d[0][1] >= k:\r\n print('Yes')\r\n for i in range(n):\r\n if w[i] == d[0][0]:\r\n print(w1[i], end=' ')\r\n k -= 1\r\n if k == 0:\r\n break\r\nelse:\r\n print('No')", "n, m, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\n# print(a)\r\ndc = {}\r\n# print(x)\r\nfor i in a:\r\n # print(i % k)\r\n if (i % k in dc.keys()):\r\n dc[i % k].append(i)\r\n else:\r\n dc[i % k] = [i]\r\n# print(dc)\r\nfor i in range(k):\r\n if (i in dc.keys() and len(dc[i]) >= m):\r\n print(\"Yes\")\r\n for j in range(m):\r\n print(dc[i][j], end=' ')\r\n exit()\r\nprint(\"No\")\r\n", "import sys\r\ninput = sys.stdin.readline \r\n\r\nn, k, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\n\r\nd = [[0] for i in range(m)]\r\nfor i in range(n):\r\n d[a[i] % m][0] += 1\r\n d[a[i] % m].append(a[i])\r\n \r\nfor i in range(m):\r\n if(d[i][0] >= k):\r\n print(\"Yes\")\r\n print(*d[i][1 : k + 1])\r\n break \r\n\r\nelse:\r\n print(\"No\")", "n, k, m = map(int, input().split())\r\narr = list(map(int, input().split()))\r\n\r\nb = [[] for _ in range(m)]\r\n\r\nfor e in arr:\r\n b[e%m].append(e)\r\n\r\nok=False\r\nfor e in b:\r\n if len(e) >= k:\r\n ok=True\r\n print(\"Yes\")\r\n print(*e[:k])\r\n break\r\n\r\nif not ok:\r\n print('No')\r\n", "from collections import defaultdict\nn,k,m = map(int, input().split())\na = list(map(int, input().split()))\n\nd = defaultdict(list)\nfor i in a:\n d[i%m] += [i]\n if len(d[i%m]) >=k:\n print('Yes')\n for el in d[i%m]:\n print(el, end =' ')\n print()\n break\nelse:\n print('No')\n", "[n, k, m] = [int(i) for i in input().split()]\r\na = [int(i) for i in input().split()]\r\nb = [0] * m\r\nc = -1\r\nfor x in a:\r\n d = x % m\r\n b[d] += 1\r\n if b[d] >= k:\r\n c = d\r\n break\r\nif c == -1:\r\n print('No')\r\nelse:\r\n print('Yes')\r\n cnt = 0\r\n for x in a:\r\n if x % m == c and cnt < k:\r\n print(x, end=' ')\r\n cnt += 1", "n, k, m = map(int, input().split())\r\nremainders = dict()\r\nfor i in map(int, input().split()):\r\n if i % m not in remainders:\r\n remainders[i % m] = []\r\n remainders[i % m].append(i)\r\n if len(remainders[i % m]) >= k:\r\n print('Yes')\r\n print(' '.join(map(str, remainders[i % m])))\r\n break\r\nelse:\r\n print('No')\r\n", "# from math import gcd\r\n# from queue import Queue\r\n# from collections import deque\r\n# from collections import Counter\r\nn,k,m=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nrem=[0 for _ in range(m)]\r\nfor i in range(n):\r\n rem[l[i]%m]+=1\r\nreq=0\r\nif max(rem)<k:\r\n print('No')\r\nelse:\r\n req=rem.index(max(rem))\r\n ans=[]\r\n count=0\r\n j=0\r\n while count<k and j<n:\r\n if l[j]%m==req:\r\n ans.append(l[j])\r\n count+=1\r\n j+=1\r\n else:\r\n j+=1\r\n print('Yes')\r\n print(*ans)\r\n # print(rem)\r\n\r\n\r\n\r\n\r\n \r\n\r\n\r\n\r\n ", "(n, k, m) = map(int, input().split())\r\nwork = [[] for i in range(m)]\r\na = map(int, input().split())\r\nb = []\r\nfor x in a:\r\n i = x % m\r\n work[i].append(x)\r\n if len(work[i]) == k:\r\n print('Yes')\r\n for item in work[i]:\r\n print(item, end = ' ')\r\n exit()\r\nprint('No')\r\n", "import math\r\nimport re\r\n\r\n\r\ndef ria():\r\n return [int(i) for i in input().split()]\r\n\r\n\r\ndef ri():\r\n return int(input())\r\n\r\n\r\ndef rfa():\r\n return [float(i) for i in input().split()]\r\n\r\n\r\nn, k, m = ria()\r\nmp = {}\r\nar = ria()\r\nmx = 0\r\nfor i in ar:\r\n if i % m not in mp:\r\n mp[i % m] = []\r\n mp[i % m].append(i)\r\n if mx < len(mp[i % m]):\r\n mx = len(mp[i % m])\r\nif mx<k:\r\n print('No')\r\n exit(0)\r\nprint('Yes')\r\nfor i in mp:\r\n i=mp[i]\r\n if len(i) >= mx:\r\n for j in range(k):\r\n print(i[j], end=' ')\r\n break\r\n", "import sys,math,string,bisect\ninput=sys.stdin.readline\nfrom collections import deque, defaultdict\nL=lambda : list(map(int,input().split()))\nLs=lambda : list(input().split())\nM=lambda : map(int,input().split())\nI=lambda :int(input())\nn,k,m=M()\nl=L()\ng=[0]*m\nd = defaultdict(list)\np=0\nh=0\nfor i in range(n):\n g[l[i]%m]+=1\n if(g[l[i]%m]>p):\n p=g[l[i]%m]\n h=l[i]%m\n d[l[i]%m].append(l[i])\nif(k>p):\n print(\"No\")\nelse:\n print(\"Yes\")\n print(*d[h][:k:1])\n", "[n,m,k] = [int(i) for i in input().split()]\r\na = [int(i) for i in input().split()]\r\nb = {}\r\nmx = 0\r\nfor i in a:\r\n try: b[i%k] += 1\r\n except KeyError: b[i%k] = 1\r\n if b[i%k] > mx: mx = b[i%k]\r\nif m > mx: print('No')\r\nelse:\r\n rem = list(b.keys())[list(b.values()).index(mx)]\r\n print('Yes')\r\n print(' '.join([str(i) for i in a if i%k == rem][:m]))", "n, k, m = map(int, input().split())\r\narr = list(map(int, input().split()))\r\nmod = [[] for i in range(m)]\r\n\r\nfor i in arr:\r\n mod[i % m].append(i)\r\n\r\nfor i in mod:\r\n if len(i) >= k:\r\n print(\"Yes\")\r\n buff=\"\"\r\n for j in range(k):\r\n buff += str(i[j]) + \" \"\r\n print(buff)\r\n exit(0)\r\nprint(\"No\")\r\n\r\n\r\n\r\n", "n, k, m = map(int, input().split())\r\narray = list(map(int, input().split()))\r\n\r\narray = sorted(array)\r\nost = [0] * m\r\nind = None\r\nmax = 0\r\n\r\nfor i in range(len(array)):\r\n ost[(array[i]) % m] += 1\r\n\r\nfor i in range(len(ost)):\r\n if ost[i] > max:\r\n max = ost[i]\r\n ind = i\r\n\r\nif max < k:\r\n print('No')\r\n exit()\r\n\r\nfinal = []\r\n\r\nfor i in range(len(array)):\r\n if (array[i] - ind) % m == 0:\r\n if len(final) != k:\r\n final.append(array[i])\r\n if len(final) == k:\r\n print('Yes')\r\n print(*final)\r\n exit()", "n, k, m = list(map(int, input().split()))\ndict = {}\nnums = list(map(int, input().split()))\nb = []\n\nfor num in nums:\n mod = num % m\n if mod not in dict:\n dict[mod] = [num]\n else:\n dict[mod].append(num)\n if len(dict[mod]) == k:\n print('Yes')\n print(*dict[mod], sep=\" \")\n exit()\n\nprint('No')\n\n\t \t\t\t\t \t\t\t\t\t \t \t \t \t \t\t \t", "n,k,m = map(int,input().split())\r\narr = list(map(int,input().split()))\r\nans = {}\r\nfor i in arr:\r\n if i%m not in ans:\r\n ans[i%m] = [i]\r\n else:\r\n ans[i%m].append(i)\r\ncheck = False\r\nfor i in ans:\r\n if len(ans[i]) >= k:\r\n check = True\r\n break\r\nif check:\r\n print('Yes')\r\n j = 0\r\n while j<=k-1:\r\n print(ans[i][j],end = ' ')\r\n j+=1\r\nelse:\r\n print('No')\r\n", "n, k, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\nc = [0]*m\r\nl = 0\r\nfor i in range(n):\r\n c[a[i] % m] += 1\r\nfor i in range(m):\r\n if c[i] >= k:\r\n print('Yes')\r\n for j in range(n):\r\n if a[j] % m == i:\r\n print(a[j], end=' ')\r\n l += 1\r\n if l == k:\r\n break\r\n exit()\r\nprint('No')", "n, k, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\nb = []\r\nfor i in a:\r\n b.append(i%m)\r\nb.sort()\r\ncount = 1\r\nres = 1\r\nimax = b[0]\r\nfor j in range(1, n):\r\n if (b[j] == b[j-1]):\r\n count+=1\r\n else:\r\n count = 1\r\n if count > res:\r\n imax = b[j];\r\n res = max(res, count)\r\nif res < k:\r\n print(\"No\")\r\nelse:\r\n print(\"Yes\")\r\n count2 = 0\r\n for i in a:\r\n if i%m == imax:\r\n print(i, end=\" \")\r\n count2+=1\r\n if count2 == k:\r\n break\r\n ", "from collections import defaultdict\r\nn,k,m=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nd=defaultdict(list)\r\nfor p in l:\r\n d[p%m].append(p)\r\n#print(d)\r\nfor p in list(d.values()):\r\n if len(p)>=k:\r\n print('Yes')\r\n print(*p[:k])\r\n exit()\r\nprint('No')", "n, k, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\nost = [[] for i in range(m)]\r\nfor i in a:\r\n ost[i % m].append(i)\r\n if len(ost[i % m]) >= k:\r\n print(\"Yes\")\r\n print(\" \".join(str(j) for j in ost[i % m]))\r\n break\r\nelse:\r\n print(\"No\")", "n, k, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\nc = [0] * m\r\nfor ai in a:\r\n c[ai % m] += 1\r\nfor i, ci in enumerate(c):\r\n if ci >= k:\r\n print('Yes')\r\n print(' '.join([str(ai) for ai in a if ai % m == i][:k]))\r\n exit()\r\nprint('No')", "pramiters = [int(i) for i in input().split(\" \")]\nnumbers = [int(i) for i in input().split(\" \")]\nn, k, m = pramiters\nremains = [0 for i in range(m)]\n\nfor i in numbers:\n remains[i % m]+=1\n\nb=max(remains)\nif b >= k:\n k_count = 0\n mindex = remains.index(b)\n print(\"Yes\")\n for i in numbers:\n if i%m == mindex:\n print(i, end=\" \")\n k_count+=1\n\n if k_count == k:\n print()\n break\nelse:\n print(\"No\")\n", "n, k, m = map(int, input().split())\na = [0] + list(map(int, input().split()))\nn = len(a) - 1\ndp = [0] * m\npre = [0] * (n + 1)\n\nloc = 0\nfor i in range(1, n + 1):\n dp[a[i] % m] += 1\n if dp[a[i] % m] >= dp[a[loc] % m]:\n loc = i\nif dp[a[loc] % m] < k:\n print(\"No\")\nelse:\n print(\"Yes\")\n res = []\n res.append(a[loc])\n now = a[loc] % m\n k -= 1\n loc -= 1\n while k:\n while a[loc] % m != now:\n loc -= 1\n res.append(a[loc])\n k -= 1\n loc -= 1\n print(\" \".join(map(str, res[::-1])))\n\n\t \t \t \t \t \t \t\t \t\t \t\t", "n, k, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\nmods = [[] for _ in range(m)]\r\nfor el in a:\r\n md = el % m\r\n mods[md].append(el)\r\nanswer = 0\r\nfor i in range(1, m):\r\n if len(mods[i]) > len(mods[answer]):\r\n answer = i\r\nif len(mods[answer]) < k:\r\n print(\"No\")\r\nelse:\r\n print(\"Yes\")\r\n print(*mods[answer][:k])\r\n", "n,k,m = map(int,input().split())\r\nA = list(input().split())\r\n\r\nC = [0] * m\r\nfor i in A:\r\n\tC[int(i)%m] += 1\r\n\r\nmod = -1\r\n\r\nfor i in range(m):\r\n\tif C[i] >= k:\r\n\t\tmod = i\r\n\t\tbreak\r\nif mod == -1:\r\n\tprint(\"No\")\r\n\texit()\r\n\r\nprint(\"Yes\")\r\n\r\nfor i in A:\r\n\tif int(i)%m == mod:\r\n\t\tprint(i, end = ' ')\r\n\t\tk -= 1\r\n\t\tif k == 0:\r\n\t\t\tbreak", "from collections import deque\r\nn, k, m = map(int, input().split())\r\nl = [deque() for _ in range(m)]\r\nnumbers = list(map(int, input().split()))\r\nfor x in numbers:\r\n l[x % m].append(x)\r\nfor i in range(m):\r\n if len(l[i]) >= k:\r\n print(\"Yes\")\r\n for _ in range(k):\r\n print(l[i].popleft(), end=\" \")\r\n break\r\nelse:\r\n print(\"No\")# 1698065826.3799126", "n, k, m = map(int,input().split())\r\nc = [0]*m\r\na = list(map(int,input().split()))\r\nfor i in a:\r\n\tc[i % m] += 1\r\nfor i in range(m):\r\n\tif c[i] >= k:\r\n\t\tprint(\"Yes\")\r\n\t\tcnt = 0\r\n\t\tfor j in range(n):\r\n\t\t\tif a[j] % m == i:\r\n\t\t\t\tprint(a[j], end=' ')\r\n\t\t\t\tcnt += 1\r\n\t\t\t\tif cnt == k:\r\n\t\t\t\t\tbreak\r\n\t\tbreak\r\nelse:\r\n\tprint(\"No\")\r\n", "read=lambda : map(int,input().split())\r\nn,k,m=read()\r\na=list(read())\r\nr=[[] for _ in range(m)]\r\np=-1\r\nfor d in a:\r\n t=d%m\r\n r[t].append(d)\r\n if len(r[t])>=k:\r\n p=t\r\n break\r\nif p<0:\r\n print('No')\r\nelse:\r\n print('Yes')\r\n print(' '.join(map(str,r[p])))\r\n\r\n", "n,k,m=map(int,input().split())\r\na=input().split()\r\nb=[[]for i in range(0,m)]\r\nfor i in range(0,n):\r\n c=int(a[i])\r\n b[c%m].append(c)\r\n if len(b[c%m])==k:\r\n print('Yes')\r\n print(' '.join(map(str,b[c%m])))\r\n exit()\r\nprint('No')", "from sys import stdin,stdout,exit\r\na,b,c=map(int,stdin.readline().split())\r\nf=[[] for _ in \" \"*c]\r\nfor i in map(int,stdin.readline().split()):f[i%c].append(i)\r\nfor i in range(c):\r\n if len(f[i])>=b:stdout.write(\"Yes \"+' '.join(map(str,f[i][:b])));break\r\nelse:stdout.write(\"No\")", "n, k, m = map(int, input().split())\r\nl = list(map(int, input().split()))\r\nx = [0] * m\r\nfor i in l:\r\n x[i % m] += 1\r\nmx = max(x)\r\nif mx < k:\r\n print(\"No\")\r\n exit()\r\nindex = x.index(mx)\r\nans = []\r\nfor i in l:\r\n if i % m == index:\r\n ans.append(i)\r\nprint('Yes')\r\nans = ans[:k]\r\nprint(*ans)", "n,k,m=map(int,input().split())\r\nar=list(map(int,input().split()))\r\nar1=[]\r\ndc=dict()\r\nfor i in ar:\r\n ar1.append((i,i%m))\r\n if i%m not in dc:\r\n dc[i%m]=1\r\n else:\r\n dc[i%m]+=1\r\nflag=0\r\nrem=0\r\nfor i in dc:\r\n if(dc[i]>=k):\r\n rem=i\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 range(n):\r\n if(ar1[i][1]==rem):\r\n print(ar1[i][0],end=\" \")\r\n k-=1\r\n if(k==0):\r\n break\r\n \r\n \r\n", "n,k,m=map(int,input().split())\nip=list(map(int,input().split()))\narr=[[] for i in range(m)]\nfor i in ip:\n arr[i%m].append(i)\nb=0\nfor i in arr:\n if len(i)>=k:\n print('Yes')\n for j in i[:k]:\n print(j, end=' ')\n b=1\n break\nif b==0:\n print('No')\n", "n,k,m=map(int,input().split())\r\nl=[int(i) for i in input().split()]\r\ncnt=[0]*(m)\r\nmaxi=max(cnt)\r\nrem=-1 \r\nfor i in l:\r\n cnt[i%m]+=1 \r\nind=cnt.index(max(cnt))\r\nif max(cnt)<k:\r\n print('No')\r\n exit()\r\nprint('Yes')\r\nans=[]\r\nfor i in range(n):\r\n if l[i]%m==ind:\r\n ans.append(l[i])\r\nprint(*(ans[0:k]))", "from collections import Counter as cc\nimport sys\ninput=sys.stdin.readline\nI=lambda : list(map(int,input().split()))\n\nn,k,m=I()\nl=I()\nd=cc(l);s=sorted(d.keys())\nx=[[] for i in range(m)]\nma=0\nfor i in s:\n x[i%m]+=[i]*d[i]\n if len(x[i%m])>=k:\n print(\"Yes\")\n print(*x[i%m][:k])\n break\nelse:\n print(\"No\")\n \t\t \t\t\t \t \t\t \t \t\t \t", "slovar = {}\r\nn, k, m = map(int, input().split())\r\ns = list(map(int, input().split()))\r\nfor x in s:\r\n if x % m not in slovar:\r\n slovar[x % m] = [str(x)]\r\n else:\r\n if len(slovar[x%m]) < k:\r\n slovar[x % m].append(str(x))\r\nans = 0\r\nfor x in list(slovar.values())[::-1]:\r\n if len(x) == k:\r\n ans = x\r\nif ans != 0:\r\n print('Yes')\r\n print(' '.join(ans))\r\nelse:\r\n print('No')", "n,k,m=map(int,input().split())\nli=list(map(int,input().split()))\ndi={}\nfor i in range(n):\n\tif li[i]%m not in di:\n\t\tdi[li[i]%m]=0\n\tdi[li[i]%m]+=1\nv=-1\nfor _ in di:\n\tif di[_]>=k:\n\t\tv=_\n\t\tbreak\nif v==-1:\n\tprint('No')\nelse:\n\tll=[]\n\tfor _ in li:\n\t\tif _%m==v:\n\t\t\tll.append(str(_))\n\t\tif len(ll)==k:\n\t\t\tbreak\n\tprint(\"Yes\")\n\tprint(' '.join(ll))\n \t \t \t \t \t \t\t \t\t \t \t \t", "#https://codeforces.com/problemset/problem/876/B\nfrom collections import Counter\n\nn,k,m=map(int,input().split())\nl=list(map(int,input().split()))\nmod=[i%m for i in l]\nd=Counter(mod)\nkey,v=d.most_common()[0]\nif v<k:\n\tprint('No')\nelse:\n\tprint('Yes')\n\tfor i in range(n):\n\t\tif mod[i]==key:\n\t\t\tprint(l[i],end=' ')\n\t\t\tk-=1\n\t\tif k==0:\n\t\t\tbreak\n\tprint()\n", "n, k , m = map(int, input().split())\r\na = list(map(int, input().split()))\r\nai =[[]*100000 for i in range(100000)]\r\nh = 0 \r\nz = 0\r\nv = 0\r\nfor i in range(n):\r\n h =a[i]%m\r\n ai[h].append(a[i])\r\n if len(ai[h])==k:\r\n print('Yes')\r\n print(*ai[h])\r\n v +=1\r\n break\r\nif v == 0:\r\n print('No')", "n,k,m = map(int,input().split())\r\na= [int(c) for c in input().split()]\r\nmp = {}\r\nfor _a in a:\r\n if _a%m in mp.keys():\r\n mp[_a%m]+=1\r\n else:\r\n mp[_a%m]=1\r\n \r\n\r\nfound = -1\r\nfor i in mp:\r\n if mp[i]>=k:\r\n found=i\r\n break\r\nif found == -1:\r\n print(\"No\")\r\nelse:\r\n print(\"Yes\")\r\n ans = []\r\n for i in a:\r\n if i%m == found:\r\n ans.append(i)\r\n \r\n for i in range(k):\r\n print(ans[i],end=' ')", "#dividing by 2 and 3 and 5 maeans subtracrting the powers\r\nn,k,m=map(int,input().split())\r\narr=list(map(int,input().split()))\r\nif k>n:print(\"No\")\r\nelse:\r\n d={}\r\n for i in range(n):\r\n r=arr[i]%m\r\n #print(r)\r\n if r in d:d[r].append(arr[i])\r\n else:d[r]=[arr[i]]\r\n #print(d)\r\n for i in d:\r\n if len(d[i])>=k:\r\n print(\"Yes\")\r\n for j in range(k):\r\n print(d[i][j],end=\" \")\r\n exit()\r\n print(\"No\")\r\n", "n, k, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\n\r\na.sort()\r\n\r\nqset = [[] for _ in range(m)]\r\n\r\nfor e in a:\r\n qset[e % m].append(e)\r\n\r\nqset.sort(key=lambda x: len(x), reverse=True)\r\n\r\nif len(qset[0]) < k:\r\n print('No')\r\nelse:\r\n print('Yes')\r\n print(' '.join(map(str, qset[0][:k])))", "n, k, m = map(int, input().split())\na = list(map(int, input().split()))\nstats = [0] * m\nfor x in a:\n stats[x % m] += 1\nmaxm = max(stats)\nif maxm < k:\n print(\"No\")\nelse:\n ind = stats.index(maxm)\n print(\"Yes\")\n ans = []\n i = 0\n for x in a:\n if x % m == ind:\n ans.append(x)\n if len(ans) == k:\n break\n print(*ans)", "\nn , k , m = map( int, input().split(' ') )\nv = []\nfor i in range (m+1):\n v.append(0)\na = []\na = map( int, input().split(' ') )\n\nsave = []\nfor x in a:\n mod = x % m\n save.append( int (x) )\n v[mod] = v[mod]+1\n\nsave.sort()\n\nfor i in range(m):\n if v[i] >=k:\n print (\"Yes\")\n ans = []\n for x in range(n):\n if save[x] % m == i:\n ans.append( save[x] )\n if len(ans) == k :\n break\n print (*ans)\n \n exit(0)\n\nprint (\"No\")\n", "n,k,m=map(int,input().split())\nmultiset=list(map(int,input().split()))\n#empty for every possible mod\nmods=[[] for i in range(m)]\n\nfor elem in multiset:\n # group numbers with same mod\n mods[elem%m].append(elem)\n\nfor subset in mods:\n #satisfy k\n if len(subset)>=k:\n print('Yes')\n #print only k elements\n for elem in subset[:k]:\n print(elem, end=' ')\n quit()\nprint('No')\n\t \t \t\t \t\t \t \t \t \t\t\t\t\t \t", "def solve():\r\n\r\n n, k, m = [int(st) for st in input().split(\" \")]\r\n a = [int(st) for st in input().split(\" \")]\r\n\r\n division = {}\r\n for i in range(len(a)):\r\n num = a[i]\r\n if num%m in division:\r\n division[num%m][0] += 1\r\n division[num%m][1].append(i)\r\n else:\r\n division[num%m] = [1, [i]]\r\n\r\n for mod in division:\r\n if division[mod][0] >= k:\r\n return (\"Yes\", [a[index] for index in division[mod][1][:k]])\r\n\r\n return (\"No\", [])\r\n\r\nstatus, list_ = solve()\r\nprint(status)\r\nif status == \"Yes\":\r\n for num in list_:\r\n print(num, end = \" \")\r\n", "import collections\r\n\r\nb = collections.defaultdict(list)\r\nn,k,m=map(int , input().split())\r\na=list(map(int,input().split()))\r\nkey=True\r\nfor i in range(0,n):\r\n t=a[i]%m\r\n b[t].append(a[i])\r\nfor i in range(0,m):\r\n if len(b[i])>=k:\r\n print(\"Yes\")\r\n for p in range(0,k):\r\n print(b[i][p],end=\" \")\r\n key=False\r\n break\r\nif key:\r\n print(\"No\")", "# python3\n# utf-8\n\nn, k, m = (int(x) for x in input().split())\nnumbers = [int(x) for x in input().split()]\nmod___numbers = [[] for x in range(m)]\nfor number in numbers:\n mod___numbers[number % m].append(number)\nfor curr_ans in mod___numbers:\n if len(curr_ans) >= k:\n print('Yes')\n print(*curr_ans[:k])\n exit()\nprint('No')\n", "n,k,m=[int(i) for i in input().split()]\r\nl=[int(i) for i in input().split()]\r\nlmain=[]\r\nfor i in range(n):\r\n lmain.append(l[i])\r\n l[i] = l[i]%m\r\nl1=[]\r\nfor i in range(m):\r\n l1.append(0)\r\nfor i in range(n):\r\n l1[l[i]]+=1\r\nf=0\r\nsave=-1\r\nfor i in range(m):\r\n if (l1[i]>=k):\r\n f=1\r\n save=i\r\n break\r\nif (f==0):\r\n print ('No')\r\nelse:\r\n print ('Yes',end= \"\\n\")\r\n count=0\r\n l3=[]\r\n for i in range(n):\r\n if (count==k):\r\n break\r\n if (l[i]==save):\r\n l3.append(lmain[i])\r\n count+=1\r\n for i in l3:\r\n print (i, end=\" \")\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "def main():\n N, K, M = map(int, input().split())\n A = tuple(map(int, input().split()))\n\n mod_ = []\n apnd = mod_.append\n cnt = dict()\n for i in A:\n x = i % M\n apnd(x)\n cnt[x] = cnt.get(x, 0) + 1\n\n max_ = max(cnt.values())\n key_ = max(cnt.items(), key=lambda x: x[1])[0]\n if max_ >= K:\n ans = []\n apnd = ans.append\n i = 0\n for j, k in enumerate(mod_):\n if k == key_:\n apnd(A[j])\n i += 1\n if i == K: break\n print('Yes')\n print(*ans, sep=' ')\n else:\n print('No')\n\nmain()\n", "import sys\r\nn,k,m=map(int,input().split())\r\na=list(map(int,input().split()))\r\ndic={}\r\nfor i in a:\r\n if i%m in dic:\r\n dic[i%m].append(i)\r\n else:\r\n dic[i%m]=[i]\r\nfor i in dic:\r\n if len(dic[i])>=k:\r\n print('Yes')\r\n ans=[]\r\n for j in range(k):\r\n ans.append(str(dic[i][j]))\r\n print(' '.join(ans))\r\n sys.exit()\r\nprint('No')", "n, k, m = map(int, input().split())\nlst = list(map(int, input().split()))\nd = {}\nfor i in lst:\n r = i % m\n if r not in d:\n d[r] = [i]\n else:\n d[r].append(i)\n if len(d[r]) == k:\n print(\"Yes\")\n print(*d[r])\n exit()\nprint(\"No\")\n\n\n\n", "from collections import Counter\r\nn, k, m = [int(x) for x in input().split()]\r\na = [int(x) for x in input().split()]\r\nb = [elem % m for elem in a]\r\nans = Counter(b).most_common(1)[0]\r\nif ans[1] < k:\r\n print('No')\r\nelse:\r\n nd = ans[0]\r\n rans = []\r\n for i in range(n):\r\n if len(rans) == k:\r\n break\r\n if b[i] == nd:\r\n rans.append(a[i])\r\n print('Yes')\r\n print(*rans)", "'''\r\n\r\n Online Python Compiler.\r\n Code, Compile, Run and Debug python program online.\r\nWrite your code in this editor and press \"Run\" button to execute it.\r\n\r\n'''\r\n\r\n\r\ndef myf(item):\r\n return len(item)\r\n \r\nn,k,m=map(int,input().split())\r\n\r\n\r\nl=list(map(int,input().split()))\r\n\r\nd={} # d[k] => list of numbers num such that num%m==k\r\n\r\nfor ele in l:\r\n rem=ele%m\r\n if rem in d:\r\n d[rem].append(ele)\r\n else:\r\n d[rem]=[ele]\r\n \r\nvalues=list(d.values())\r\nvalues.sort(reverse=True,key=myf )\r\nif len(values[0])>=k:\r\n print(\"Yes\")\r\n cnt=0\r\n for item in values[0]:\r\n print(item , end=\" \")\r\n cnt+=1\r\n if cnt==k:break\r\n print()\r\nelse:\r\n print(\"No\")\r\n \r\n \r\n ", "n,k,m=map(int,input().split())\r\na=list(map(int,input().split()))\r\nb=[]\r\nfor i in range(m):\r\n b.append([])\r\nfor i in range(len(a)):\r\n b[a[i]%m].append(a[i])\r\nfor i in range(len(b)):\r\n if len(b[i])>=k:\r\n j=0\r\n print('Yes')\r\n while j<k:\r\n print(b[i][j],end=' ')\r\n j+=1\r\n break\r\nelse:\r\n print('No')", "n,k,m=map(int,input().split())\r\nw=list(map(int,input().split()))\r\ng={}\r\nb=0\r\nfor i in range (m):\r\n g[i]=[]\r\nfor i in range (n):\r\n g[w[i]%m].append(w[i])\r\n if len(g[w[i]%m])==k:\r\n b=1\r\n s=i\r\n break\r\nif b==1:\r\n print ('Yes')\r\n print (*g[w[s]%m])\r\nelse:\r\n print ('No')\r\n", "n, k, m = map(int, input().split())\narr = list(map(int, input().split()))\n\nb = [[] for _ in range(m)]\n\nfor e in arr:\n b[e%m].append(e)\n\nfor e in b:\n if len(e) >= k:\n print(\"Yes\")\n print(*e[:k])\n exit()\n\nprint(\"No\")\n", "n, k, m = map(int, input().split())\r\ninputs = list(map(int, input().split()))\r\n\r\narray = {}\r\n\r\n\r\nfor i in inputs:\r\n\tif (not i%m in array):\r\n\t\tarray[i%m] = []\r\n\tarray[i%m].append(i)\r\n\r\nfound = False\r\n\r\nfor i in array:\r\n\tif (len(array[i]) >= k):\r\n\t\tprint(\"Yes\")\r\n\t\toutput = \"\"\r\n\t\tfor j in range(0, k):\r\n\t\t\toutput += str(array[i][j]) + \" \"\r\n\t\tprint (output)\r\n\t\tfound = True\r\n\t\tbreak\r\n\r\nif (not found):\r\n\tprint (\"No\")", "n, k, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\n\r\nall = [0] * m\r\nfor x in a:\r\n\tall[x % m] += 1\r\n\r\nwas = 0\r\nfor i in range(m):\r\n\tif(all[i] >= k and was == 0):\r\n\t\tprint(\"Yes\")\r\n\t\tfor x in a:\r\n\t\t\tif(x % m == i and was < k):\r\n\t\t\t\tprint(x, end = ' ')\r\n\t\t\t\twas += 1\r\n\r\nif (was != k):\r\n\tprint(\"No\")\t\r\n\t\t\r\n\t", "n,k,m=map(int,input().split())\r\nl=[[]for x in range(m)]\r\nfor x in map(int,input().split()):\r\n l[x%m].append(x)\r\nfor x in l:\r\n if len(x)>=k:\r\n print('Yes')\r\n print(*x[:k])\r\n exit()\r\nprint('No')", "n, k, m = map(int, input().split())\r\na = map(int, input().split())\r\nresult, foundSolution = [[] for _ in range(m)], False\r\nfor i in a:\r\n result[i % m].append(i)\r\n if len(result[i % m]) == k:\r\n print('Yes')\r\n print(*result[i % m], sep=' ')\r\n foundSolution = True\r\n break\r\nif not foundSolution:\r\n print('No')\r\n", "inp = lambda: map(int, input().split())\r\nn, k, m = inp()\r\na = list(inp())\r\nd = {}\r\nt = -1\r\nfor i in a:\r\n mod = i % m\r\n if mod in d:\r\n d[mod] += 1\r\n else:\r\n d[mod] = 1\r\nfor i in d:\r\n if d[i] >= k:\r\n t = i\r\n break\r\nif t == -1:\r\n print('No')\r\nelse:\r\n print('Yes')\r\n for i in a:\r\n if i % m == t and k > 0:\r\n print(i, end = ' ')\r\n k -= 1", "n, k, m = [int(i) for i in input().split()]\ns = [int(i) for i in input().split()]\nmi = [[] for i in range(m)]\nfor i in s:\n mi[i%m].append(i)\nfor i in range(m):\n if len(mi[i]) >= k:\n print(\"Yes\")\n print(*mi[i][:k])\n exit(0)\n break\nprint(\"No\")\n", "from sys import exit\r\nn,k,m=[int(e) for e in input().split()]\r\na=[int(e) for e in input().split()]\r\nb=[[] for i in range(m)]\r\nfor e in a:\r\n b[e%m].append(e)\r\nfor e in b:\r\n if len(e)>=k:\r\n print(\"Yes\")\r\n print(*e[:k])\r\n exit()\r\nprint(\"No\")", "from collections import Counter\r\nx,y,z = map(int,input().split(\" \"))\r\nnum = [[0,[]] for i in range(z)]\r\nresult = False\r\n\r\nfor i in map(int,input().split()):\r\n temp = i%z\r\n num[temp][0]+=1\r\n num[temp][1]+=[i]\r\n if(num[temp][0]==y):\r\n result = True\r\n break\r\nif(result):\r\n print(\"Yes\")\r\n print(*num[temp][1])\r\nelse:\r\n print(\"No\")", "n, k, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\nost = [[] for i in range(m)]\r\nfor i in range(n): ost[a[i]%m].append(a[i]);\r\n\r\nfor i in range(m):\r\n if len(ost[i])>=k:\r\n print('Yes')\r\n for j in range(k): print(ost[i][j], end=' ');\r\n exit(0)\r\nprint('No')", "n,k,m = map(int, input().split())\r\n\r\na = list(map(int, input().split()))\r\n\r\nd = {}\r\n\r\nfor i in range(n):\r\n r = a[i]%m\r\n if r not in d:\r\n d[r] = 0\r\n d[r]+=1\r\nans_r=None\r\nfor key in d:\r\n if d[key] >= k:\r\n ans_r=key\r\n break\r\nif ans_r is None:\r\n print('No')\r\nelse:\r\n ans = []\r\n for i in range(n):\r\n if a[i]%m == ans_r:\r\n ans.append(str(a[i]))\r\n if len(ans) == k:\r\n break\r\n print('Yes')\r\n print(' '.join(ans))", "n,k,m=map(int,input().split())\r\na=list(map(int,input().split()))\r\nb=[]\r\nc=[0]*m\r\nfor i in a:\r\n c[i%m]+=1\r\ny=max(c)\r\nif y<k:\r\n print(\"No\")\r\nelse:\r\n print(\"Yes\")\r\n x=c.index(y)\r\n for i in a:\r\n if len(b)<k and i%m==x:\r\n b.append(i)\r\n if len(b)==k:\r\n break\r\n print(*b)\r\n \r\n \r\n ", "\r\nn, k, m = list(map(int, input().split(' ')))\r\n\r\n\r\narr = list(map(int, input().split(' ')))\r\n\r\nmodN = [[] for i in range(100001)]\r\n\r\nfor i in arr:\r\n modN[i % m].append(i)\r\n\r\nfor o in modN:\r\n if len(o) >= k:\r\n print('Yes')\r\n for i in range(k):\r\n print(o[i])\r\n exit(0)\r\n\r\n\r\nprint('No')\r\n", "import math\r\n\r\ndef gcd(a,b):\r\n if a<b:a,b=b,a\r\n while a%b!=0:\r\n a,b=b,a%b\r\n return b\r\n\r\nn,k,m=map(int,input().split())\r\na=list(map(int,input().split()))\r\n\r\nr={}\r\nfor i in range(n):\r\n e=a[i]%m\r\n if e in r:\r\n r[e].append(a[i])\r\n else:\r\n r[e]=[a[i]]\r\n\r\nfor key in r:\r\n if len(r[key])>=k:\r\n print(\"Yes\")\r\n for i in range(k):\r\n print(r[key][i],end=\" \")\r\n break\r\nelse:\r\n print(\"No\")\r\n\r\n", "n, k, m = list(map(int,input().split()))\r\nN = list(map(int,input().split()))\r\nM = []\r\nC = [0] * m\r\nfor i in range(n):\r\n M.append(N[i] % m)\r\nfor i in range(n):\r\n C[M[i]] += 1\r\nc = -1\r\nfor i in range(len(C)):\r\n if C[i] >= k:\r\n c = i\r\n break\r\nif c == -1:\r\n print(\"No\")\r\nelse:\r\n print(\"Yes\")\r\n for i in range(n):\r\n if M[i] == c:\r\n k = k - 1\r\n if k >= 0:\r\n print(N[i], end = ' ')\r\n else:\r\n break\r\n \r\n \r\n\r\n \r\n", "n,k,m=map(int,input().split())\r\na=map(int,input().split())\r\nd={}\r\nfor x in a:\r\n if x%m not in d:d[x%m]=[]\r\n d[x%m].append(x)\r\nflag=1\r\nfor key in d:\r\n if len(d[key])>=k:\r\n print('Yes')\r\n print(' '.join(map(str,d[key][:k])))\r\n flag=0\r\n break\r\nif flag:print('No')", "n, k, m = [int(i) for i in input().split()]\r\naa = [int(i) for i in input().split()]\r\n\r\ndd = {}\r\n\r\nfor a in aa:\r\n if a % m in dd:\r\n dd[a % m].append(a)\r\n else:\r\n dd[a % m] = [a]\r\n\r\nfor key in dd.keys():\r\n if len(dd[key]) >= k:\r\n print(\"Yes\")\r\n print(' '.join(map(str, dd[key][:k])))\r\n exit(0)\r\n\r\nprint(\"No\")\r\n\r\n", "(n, k, m) = map(int, input().split())\r\nwork = [[] for i in range(m)]\r\na = map(int, input().split())\r\nb = []\r\nfor x in a:\r\n work[x % m].append(x)\r\nfor col in work:\r\n if len(col) >= k:\r\n print('Yes')\r\n for i in range(k):\r\n print(col[i], end = ' ')\r\n exit()\r\nprint('No')\r\n", "n,k,m = [int(x) for x in input().split()]\na= [[] for i in range(m)]\ns = [int(x) for x in input().split()]\nmessage = \"No\"\nfor i in s:\n a[i % m].append(i)\nfor i in range(len(a)):\n if len(a[i])>=k:\n message = 'Yes\\n' + \"\\n\".join(str(j) for j in a[i][:k])\nprint(message)\n \t \t \t\t \t \t \t \t\t\t\t", "read = lambda: tuple(map(int, input().split()))\nn, k, m = read()\nnums = read()\nvals = {}\nfor num in nums:\n c = num % m\n if not c in vals:\n vals[c] = [num]\n else:\n vals[c] += [num]\n\nansvals = tuple(filter(lambda v: len(v) >= k, vals.values()))\nif len(ansvals) == 0:\n print(\"No\")\nelse:\n print(\"Yes\")\n print(*ansvals[0][:k])\n", "a,b,c=input().split()\r\na=int(a)\r\nb=int(b)\r\nc=int(c)\r\narray=input().split()\r\nfin=[]\r\nfor i in array:\r\n fin.append(int(i))\r\nhashd=dict()\r\nfor i in fin:\r\n if(i%c in hashd):\r\n hashd[i%c].append(i)\r\n else:\r\n hashd[i%c]=[i]\r\nans=[]\r\nfor i in hashd:\r\n if(len(hashd[i])>=b):\r\n ans=hashd[i][0:b]\r\n break\r\nstrs=\"\"\r\nfor i in ans:\r\n strs+=str(i)\r\n strs+=\" \"\r\n\r\nif(len(ans)==b):\r\n print(\"Yes\")\r\n print(strs[0:-1])\r\nelse:\r\n print(\"No\")", "n, k, m = [int(_) for _ in input().split()]\n\nb = []\nfor _ in range(m):\n\tb.append([])\n\nfor _ in input().split():\n\tb[int(_)%m].append(int(_))\n\nfor l in b:\n\tif len(l)>=k:\n\t\tprint(\"Yes\")\n\t\tfor i in range(k):\n\t\t\tprint(l[i], end=' ')\n\t\tquit()\n\nprint(\"No\")\n\n\t\t\t\t\t \t \t \t \t \t \t\t\t\t \t\t\t\t \t", "#/usr/bin/env python3\n\nn,k,m = map(int,input().split())\nA = list(map(int,input().split()))\nR = [[] for _ in range(m)]\nrmax = 0\nfor a in A:\n r = a%m\n R[r].append(a)\n if len(R[r])>len(R[rmax]):\n rmax = r\nif len(R[rmax])>=k:\n print('Yes')\n print(' '.join(map(str,R[rmax][:k])))\nelse:\n print('No')\n", "from itertools import groupby\r\n\r\nn, k, m = map(int, input().split())\r\nnums = sorted(map(int, input().split()), key=lambda num: num % m)\r\nnums = [list(g) for _, g in groupby(nums, key=lambda num: num % m)]\r\nnums = max(nums, key=lambda x: n if len(x) == k else len(x))\r\n\r\nif len(nums) < k:\r\n print('No')\r\nelse:\r\n if len(nums) > k:\r\n del nums[k:]\r\n print('Yes')\r\n print(*nums)\r\n", "arr = list(map(int,input().split()))\r\nn,k,m = (arr[0],arr[1],arr[2])\r\narray = list(map(int,input().split()))\r\nstore = []\r\nflag = -1\r\nfor i in range(m):\r\n\tstore.append([])\r\nfor num in array:\r\n\tval = (m + num)%m\r\n\tstore[val].append(num)\r\n\tif(len(store[val]) >= k):\r\n\t\tflag = val\r\n\t\tbreak\r\nif(flag == -1):\r\n\tprint(\"No\")\r\nelse:\r\n\tprint(\"Yes\")\r\n\tfor val1 in store[flag]:\r\n\t\tprint(val1,end = \" \")\r\n\r\n\r\n\r\n\r\n", "#!/usr/bin/env python\r\nimport os\r\nimport sys\r\nfrom io import BytesIO, IOBase\r\n\r\n\r\ndef main():\r\n pass\r\n\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\n# endregion\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n\r\nimport math\r\n\r\n\r\ndef sieve():\r\n n = 10**6\r\n prime = [True for _ in range(n+1)]\r\n # print(prime)\r\n prime[0] = False\r\n prime[0] = False\r\n for i in range(2, int(math.sqrt(n))+1):\r\n if prime[i] == True:\r\n for j in range(i*i, n+1, i):\r\n prime[j] = False\r\n ans = []\r\n for s in range(2, n):\r\n if prime[s]:\r\n ans.append(s)\r\n return ans\r\n\r\n\r\n\r\n\r\n\"\"\"\r\ndef prime(left, r):\r\n prime_list = []\r\n\r\n for i in range(left, r+1):\r\n flag = 1\r\n if i == 1:\r\n continue\r\n\r\n for j in range(2, (i//2)+1):\r\n if i % j == 0:\r\n flag = 0\r\n break\r\n if flag == 1:\r\n prime_list.append(i)\r\n return prime_list\r\n\r\n\"\"\"\r\n\r\nn, k, m = map(int, input().split(' '))\r\na = list(map(int, input().split(' ')))\r\n\r\nb = [0] * m\r\nfor i in a:\r\n b[i % m] += 1\r\n\r\nfor j in range(m):\r\n if b[j] >= k:\r\n print('Yes')\r\n count = k\r\n for x in a:\r\n if count == 0:\r\n break\r\n elif x % m == j:\r\n print(x, end=' ')\r\n count -= 1\r\n exit(0)\r\n\r\n\r\nprint('No')", "def k(item):\n return item[1]\nc=list(map(int,input().split(\" \")))\na=list(map(int,input().split(\" \")))\nb=list(map(lambda x:x%c[2],a))\nt=list(zip(a,b))\nt.sort(key=k)\nl=[t[0][0]]\ntemp=0\nfor i in range(1,c[0]):\n if t[i][1]==t[i-1][1]:\n l.append(t[i][0])\n if len(l)==c[1]:\n temp=1\n print (\"Yes\")\n print (*l,sep=\" \")\n break\n else:\n l=[t[i][0]]\nif temp==0:\n print (\"No\")", "x, y, z = map(int,input().split())\r\nmas = list(map(int,input().split()))\r\nk = [[0] for i in range(100000)] \r\nfor i in range(x):\r\n k[mas[i] % z][0] += 1\r\n k[mas[i] % z] += [mas[i]]\r\nk.sort()\r\nif k[-1][0] >= y:\r\n print('Yes')\r\n for i in range(1, y + 1):\r\n print(k[-1][i], end = ' ')\r\nelse:\r\n print('No')", "from collections import Counter\nn, k, m = map(int, input().split())\na = list(map(int, input().split()))\nmods = [x % m for x in a]\n# print(mods)\nc = Counter(mods)\n# print(c)\nans = max(c, key=c.get)\n# print(ans, c[ans])\nif c[ans] >= k:\n print('Yes')\n print(*[x for i, x in enumerate(a) if mods[i] == ans][:k])\nelse:\n print('No')\n" ]

[ "n=int(input())\r\ns=str(n)\r\nr=int(s[0])+1\r\nss=str(r)+'0'*(len(s)-1)\r\nss=int(ss)\r\nprint(ss-n)\r\n", "n = int(input())\n\nprint(((1 + int(str(n)[0])) * 10**(len(str(n)) - 1)) - n)\n# Sat Oct 07 2023 19:59:11 GMT+0300 (Moscow Standard Time)\n", "x = int(input())\r\ndef First(year):\r\n year = str(year)\r\n return int(year[0])+1\r\ndef zeroes(year):\r\n year = str(year)\r\n return 10**(int(len(year))-1)\r\nprint(First(x)*zeroes(x)-x)", "s = input()\r\ns = s[1:]\r\n\r\nl =len(s)\r\nbigg = 10 ** l\r\nif not s: print(1)\r\nelse: print(bigg - int(s))", "s = input()\r\nif len(s) == 1:\r\n print(1)\r\nelse:\r\n print((int(s[0]) + 1) * pow(10, len(s) - 1) - int(s))", "# https://codeforces.com/problemset/problem/808/A\n# 900\n\nimport math\n\nn = input()\nln = len(n)\nn = int(n)\n\n\nm = int(\"1\" + (\"0\"*(ln-1)))\nnxt = math.ceil((n+1)/m) * m\nprint(nxt - n)", "t=int(input())\r\nk=str(t)\r\nprint(10**(len(k)-1)-t%10**(len(k)-1))\r\n\r\n", "n = input()\r\nprint((int(n[0]) + 1) * 10 ** (len(n) - 1) - int(n))", "s=input()\r\nans=int(s)\r\nif(s[0]==\"9\"):\r\n n=1;\r\n for i in range(len(s)):\r\n n*=10\r\nelse:\r\n n=int(s[0])\r\n n+=1\r\n for i in range(1,len(s)):\r\n n*=10\r\n \r\nprint(n-ans)", "while True:\n try:\n ans = 1\n n=int(input())\n m = n\n while m >= 10:\n ans *= 10\n m //= 10\n ans*=m%10+1\n print( ans - n)\n except EOFError:\n break", "#!/usr/bin/env python3\r\n# -*- coding: utf-8 -*-\r\nn=int(input())\r\ncnt=0\r\nt=n\r\nwhile n>=10:\r\n n=int(n/10)\r\n cnt+=1\r\nn+=1\r\nn*=pow(10,cnt)\r\nprint(n-t)\r\n\r\n", "from math import *\r\n\r\na=input()\r\nif len(a)==1:\r\n print(\"1\")\r\n exit(0)\r\nelif len(a)-a.count(\"0\")==1:\r\n print(10**a.count(\"0\"))\r\n exit(0)\r\nelse:\r\n b=len(a)-1\r\n a=int(a)\r\n c=a/(10**b)\r\n c=ceil(c)\r\n c*=(10**b)\r\n print(c-a)", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Sun Dec 11 14:36:43 2022\r\n\r\n@author: M\r\n\"\"\"\r\n\r\ncurrent = int(input())\r\n\r\ndef getDigits(x):\r\n count = 0\r\n while x != 0:\r\n x //= 10\r\n count += 1\r\n return count\r\n\r\ndef getFirst(n):\r\n while n >= 10:\r\n n = n / 10;\r\n return int(n)\r\n\r\nDigits = getDigits(current)-1\r\nfirstDigit = getFirst(current)+1\r\nNext = firstDigit*(10**Digits)\r\nprint(Next-current)", "n=int(input())\r\ns=[int(c) for c in str(n)]\r\nfor i in range(1,len(s)):s[i]=0\r\ns[0]+=1\r\nr=int(''.join(map(str,s)))\r\nprint(r-n)\r\n", "n=int(input())\r\nif n>=0 and n<=9:\t\r\n\tprint(1)\r\n\texit()\r\ns=str(n)\r\nc=len(s)\r\ntt=(10**(c-1))\r\nyy=tt*(n//tt)+tt\r\nprint(yy-n)\r\n", "n = input()[1:]\r\n\r\nprint(10 ** len(n) - (0 if len(n) == 0 else int(n)))", "import sys\ninput = sys.stdin.readline\n\n'''\n\n'''\n\nn = int(input())\nnxt = n\ne = 0\n\nwhile nxt >= 10:\n nxt //= 10\n e += 1\n\nnxt += 1\nprint(nxt*10**e-n)", "n=int(input())\r\ns=len(str(n))\r\nif s==1:\r\n print(1)\r\nelse:\r\n print(10**(s-1)-n%(10**(s-1)))", "n=int(input())\r\ns=str(n)\r\nif len(s)==1:\r\n print(\"1\")\r\nelse:\r\n t=str(int(s[0])+1)+\"0\"*(len(s)-1)\r\n print(int(t)-n)\r\n", "n = input()\r\na = n[0]\r\nb = len(n)\r\n# if n== a + \"0\"*(b-1):\r\nprint((int(a)+1)*10**(b-1)-int(n))\r\n# else:", "n = int(input())\n\nif n < 10:\n print(1)\nelse:\n zeros = 10 ** (len(str(n)) - 1)\n print(zeros - n % zeros)\n", "x = input(\"\")\r\ncont = 0\r\nfor i in range(len(x)):\r\n if int(x[i]) > 0 and i == 0:\r\n cont = (int(x[i])) + 1\r\n else:\r\n cont = 10*cont\r\nprint(cont-int(x))\r\n", "import math\r\nn=int(input())\r\nd=math.floor(math.log(n,10)+1)\r\nif d==1:\r\n print(1)\r\nelse:\r\n a=str(n)[0]\r\n a=int(a)+1\r\n a=(a)*(10**(d-1))\r\n print(a-n)\r\n ", "x=input(\"\")\r\na=len(x)\r\nc=0\r\nif(a==1):\r\n c=1\r\nelse:\r\n c=(int(x[0])+1)*(10**(a-1))\r\n c=c-int(x)\r\nprint(c)\r\n", "str=input()\r\nn=int(str)\r\nif len(str)<2:\r\n\tprint(1)\r\nelse:\r\n\tn+=1\r\n\tif n%(10**(len(str)-1))==0:\r\n\t\tprint(1)\r\n\telse:\r\n\t\tprint(10**(len(str)-1)-n%(10**(len(str)-1))+1)", "n = input()\r\nm = int(str(int(n[0])+1) + '0'*(len(n)-1))\r\nprint(m-int(n))", "year = input()\n\nres = \"0\" * (len(year) - 1)\n\nif (c := year[0]) == \"9\":\n res = \"10\" + res\nelse:\n res = str(int(c) + 1) + res\n\nprint(int(res) - int(year))\n", "n = input()\r\nt = 0\r\n\r\nif n < '10':\r\n t = int(n) + 1\r\nelse:\r\n t = int(str(int(n[0]) + 1) + ('0' * (len(n)- 1)))\r\n\r\nprint(t-int(n))", "n=int(input())\r\ns=str(n)\r\nn1=len(s)-1\r\nif(len(s)==1):\r\n print(1)\r\nelif(s.count(\"0\")==len(s)-1):\r\n print(10**n1)\r\nelse:\r\n m1=n//10**n1+1\r\n print(m1*10**n1-n)", "y = input()\r\ns = len(y) - 1\r\nf = int(y[0])\r\n\r\nfn = f + 1\r\nhy = fn * (10 ** s)\r\ndfn = hy - int(y)\r\nprint(dfn)\r\n", "sn = input()\r\nb= int('1'+'0'*(len(sn)-1))\r\nn = int(sn)\r\nt = b\r\nwhile t<=n:\r\n t+= b\r\nprint(t-n) ", "n = input()\r\nl = len(n)\r\nx = int(n)\r\np = 1\r\nfor i in range(l-1):\r\n p*=10\r\ny = int(n[0])\r\np*=(y+1)\r\nprint(p-x)\r\n", "n = input()\r\nres = str(int(n[0])+1)\r\nfor i in range(0, len(n)-1):\r\n\tres += '0'\r\nprint(int(res)-int(n))", "def delta_pow(n):\n s = str(n)\n N = len(s)\n return (int(s[0]) + 1) * 10 ** (N - 1) - n\n\n\nn = int(input())\nprint(delta_pow(n))\n", "\r\n \r\nfor _ in range(1):\r\n n = int(input())\r\n s = str(n)\r\n last = int(s[0])\r\n last +=1\r\n last = str(last)\r\n l = len(s)-1\r\n last += '0'*l\r\n last = int(last)\r\n print(last-n)", "n=int(input())\r\nif len(str(n))==1:\r\n print(1)\r\nelse:\r\n x=str(int(str(n)[0])+1)\r\n y=len(str(n))-1\r\n z='0'*y\r\n x=x+z \r\n x=int(x)\r\n print(x-n)", "def getDigits(num):\n if num < 10:\n return [num]\n return getDigits(num//10) + [num%10]\n\ndef main():\n n = int(input())\n \n digits = getDigits(n)\n \n digits[0] += 1\n\n for i in range(1,len(digits)):\n digits[i] = 0\n\n newNo = \"\".join(list(map(str,digits)))\n\n print(int(newNo) - n)\n\n \n\nif __name__ == \"__main__\":\n main()\n", "n=(input())\r\nc=10**(len(n)-1)\r\nprint(c-(int(n)%c))\r\n", "\n\nn = input()\n\nfirst = n[:1]\nrest = n[1:]\n\nA = int(n)\n\nB = int(str(int(first) + 1) + '0' * len(rest))\n\nprint(B - A)\n", "y=input()\r\nprint(((int(y[0])+1)*10**(len(y)-1))-int(y))\r\n", "n = int(input())\r\nz=1\r\n\r\nfor i in range(10):\r\n if(int(n/z)==0): \r\n \tbreak\r\n else: \r\n \tz*=10 \r\n \r\nz/=10\r\nprint(int( (int(n/z)+1)*z-n ))", "n=int(input())\r\nfor i in range(20):\r\n for j in range(1,10):\r\n x=int(str(j)+'0'*i)\r\n if x>n:\r\n print(x-n)\r\n exit()", "# Lucky Year\r\n\r\ncurr = input()\r\nsize = len(curr)\r\ncurr = int(curr)\r\nif curr < 10:\r\n print(1)\r\nelif curr % (10**(size - 1)) == 0:\r\n print(10**(size - 1))\r\nelse:\r\n print((10**(size - 1)) - (curr % (10**(size - 1))))", "n=input()\r\nno=len(n)\r\nif len(n)==1:\r\n print(1)\r\nelse:\r\n k=int(n[0])+1\r\n mul=k*(10**(no-1))\r\n ans=mul-int(n)\r\n print(ans)\r\n", "import sys\r\nInput = sys.stdin.readline\r\nx = input()\r\nL = len(x)\r\nif L == 1:\r\n print(1)\r\nelse:\r\n tmp = int(x[0]) + 1\r\n tmp2 = 10**(L-1)\r\n print((tmp2*tmp) - int(x))\r\n\r\n\r\n# FMZJMSOMPMSL\r\n# Ravens ;)\r\n# Codeforcesian\r\n", "#https://codeforces.com/contest/808/problem/A\r\n\r\nimport math\r\n\r\nn = int(input())\r\nl = int(math.log10(n))\r\np = 10 ** l\r\n\r\nprint(p - (n % p))", "n=(input())\r\nt=len(str(n))\r\ns=str(int(n[0])+1)\r\ns+='0'*(t-1)\r\nprint(int(s)-int(n))\r\n", "t=input()\r\nfinal=str(int(t[0])+1)\r\nfor i in range(len(t)-1):\r\n final+='0'\r\nans=int(final)\r\nprint(ans-int(t))\r\n\r\n", "a = input();\r\nb = int(len(a)) - 1\r\nprint((int(a[0]) + 1) * (10 ** b) - int(a))\r\n", "a = input()\r\nprint((int(a[0]) + 1) * 10 ** (len(a)-1) - int(a))", "a = input()\r\nprint((int(a[0]) + 1) * (10 ** (len(a) - 1)) - int(a))\r\n", "n=int(input())\r\nif n<10:print(\"1\")\r\nelse:\r\n a=str(n)\r\n l=len(a)\r\n x=10**(l-1)\r\n ans = x-(n%x)\r\n print(ans)\r\n", "n = input()\r\nif len(n) > 1:\r\n s = 10 - int( n[-1] )\r\n p = 1\r\n\r\n for i in range(len(n)-2,0,-1):\r\n s += ( 9-int(n[i]) )*(10**p)\r\n p += 1\r\n print(s)\r\nelse:\r\n print(1)", "def no_of_digits(n):\r\n return 0 if n==0 else no_of_digits(n//10)+1\r\n\r\ndef solve(YYYY):\r\n n = no_of_digits(YYYY)\r\n p = n-1\r\n nxt_lucky_yr = ( ((YYYY//(10**p))+1 )*(10**p) )\r\n print(nxt_lucky_yr-YYYY)\r\n\r\ndef main():\r\n YYYY = int(input())\r\n solve(YYYY)\r\n\r\nif __name__ == \"__main__\":\r\n main()", "n = input()\r\n\r\nd = (10 ** (len(n) - 1))\r\nprint(d - (int(n) % d))", "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\ndef check(n):\r\n n=list(set(list(str(n))))\r\n if(len(n)==1):\r\n return True\r\n n.sort()\r\n if(n[0]=='0'):\r\n if(len(n)<=2):\r\n return True\r\n else:\r\n return False\r\n else:\r\n return False\r\n\r\nn=I()\r\nn=str(n)\r\ns=len(n)\r\nf=int(n[0])\r\ns=len(n)-1\r\nf+=1\r\nprint(int(str(f)+s*'0')-int(n))\r\n", "import math\r\n\r\nn = int(input())\r\n\r\nx = 10 ** math.floor(math.log(n, 10))\r\n\r\nprint(x - n % x)\r\n\r\n", "n=input()\r\nr=10**(len(n)-1)\r\nprint(r-int(n)%r)", "s=input()\r\nprint(int(str(int(s[0])+1)+'0'*(len(s)-1))-int(s))", "s = input()\r\nprint((int(s[0]) + 1) * 10 ** (len(s)-1) - int(s))\r\n", "n=int(input())\r\nif n<10:\r\n print(1)\r\nelse:\r\n N=str(n)\r\n N=(int(N[0])+1)*pow(10,len(N)-1)\r\n print(N-n)", "n = input()\r\nif n[0] != \"9\":\r\n print(int(str(int(n[0]) + 1) + \"0\" * (len(n) - 1)) - int(n))\r\nelse:\r\n print(int(\"1\" + \"0\" * len(n)) - int(n))\r\n", "a=input()\r\nnum=len(a)\r\na=int(a)\r\nif num==1:\r\n print(1)\r\nelse:\r\n p=a%(10**(num-1))\r\n if p==0:\r\n print(10**(num-1))\r\n else:\r\n x=a//(10**(num-1))\r\n x=x+1\r\n print((x*(10**(num-1)))-a)\r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n ", "n = input()\r\nif len(n) == 1:\r\n print(1)\r\nelse:\r\n res = int(n)+10**(len(n)-1)-int(n)%10**(len(n)-1)\r\n print(res-int(n))", "x=input()\r\nprint((int(x[0])+1)*(10**(len(x)-1))-int(x))", "#!/usr/bin/env python3\n\nn = int(input().strip())\n\nnh = int(str(int(str(n)[0]) + 1 ) + ('0' * (len(str(n)) - 1)))\nprint (nh - n)\n", "y = int(input())\r\na = int(str(y)[0])\r\nnext_h = (a+1) * 10 ** (len(str(y)) - 1)\r\nprint(next_h - y)", "n = input()\n\na = (int(n[0]) + 1) * (10 ** (len(n) - 1))\n\nprint(a - int(n))\n", "\ndef culc():\n for i in range(10):\n for j in range(1,10):\n yield j * 10 ** i\n\nn = int(input())\n\nfor i in culc():\n if i > n:\n print(i - n)\n break\n", "s=input()\r\nn=\"\"+s[0]\r\nn=str(int(n)+1)\r\nn+=\"0\"*(len(s)-1)\r\nprint(int(n)-int(s))", "# ========= /\\ /| |====/|\r\n# | / \\ | | / |\r\n# | /____\\ | | / |\r\n# | / \\ | | / |\r\n# ========= / \\ ===== |/====| \r\n# code\r\n\r\nif __name__ == \"__main__\":\r\n s = input()\r\n k = int(s[0]) + 1\r\n n = len(s) - 1\r\n k *= 10**n\r\n print(k-int(s))", "import math\r\nn=input()\r\nnint=int(n)\r\nd=int(n[0])\r\ndig=int(math.log10(nint))+1\r\nif 0<=d<=8:\r\n res=(d+1)*(10**(dig-1))\r\nelse:\r\n res=1*(10**dig)\r\nprint(res-nint)\r\n", "a=input()\r\nb=str(int(a[0])+1)+'0'*(len(a)-1)\r\nprint(int(b)-int(a))\r\n", "def solve(x):\r\n count = 0\r\n while x > 0 :\r\n count +=1\r\n x//=10\r\n return count\r\n\r\nyear = (input())\r\nk = int(year[0])\r\nyear = int(year)\r\n\r\nans = (k + 1 ) * (10 **(solve(year) - 1))\r\nans -= year\r\n\r\nprint(ans)\r\n\r\n\r\n\r\n", "n = int(input())\r\nif n < 10:\r\n print(1)\r\nelse:\r\n m = str(n)\r\n if m[0] < '9':\r\n m = int(str(int(m[0]) + 1) + (len(m) - 1) * '0')\r\n print(m - n)\r\n else:\r\n print(int('1' + '0' * len(m)) - n)", "import sys\n\nnumero = int(input())\nl = str(numero)\ncasas = len(l) - 1\nproximo = int(l[0]) + 1\nfor i in range(casas):\n\tproximo = proximo * 10\ndif = proximo - numero\n\nprint(dif)\n\n\n# 1495218740856\n", "import math\r\nn = input()\r\n\r\na = 10**(len(n)-1)\r\nb = int(n[0])+1\r\n\r\nresult = b*a\r\n\r\nprint(result-int(n))\r\n", "year=str(input())\nstore=[]\ns1=''\na=0\narr=list(year)\nduplicate=arr\n\n\ncounter=0\nfor i in arr:\n int(i)\nlength=len(arr)\nif length==1:\n print(\"1\")\nelif length>1:\n calc='1'\n calc1=''\n del duplicate[0]\n l1=len(duplicate)\n while l1!=0:\n store.append(a)\n l1-=1\n for i in store:\n b=str(i)\n calc+=b\n for i in duplicate:\n s1+=i\n final_ans=int(calc)-int(s1)\n print(final_ans)\n", "n=str(input())\r\nl=len(n)\r\nn=int(n)\r\na=((n//(10**(l-1)))+1)*(10**(l-1))\r\nprint(a-n)\r\n", "n = input()\r\nprint((ord(n[0]) - 47) * pow(10, len(n) - 1) - int(n)) if n[0] != '9' else print(pow(10, len(n)) - int(n)) ", "n=input()\r\nl=len(n)\r\na=n[0]\r\nn=int(n)\r\nl=10**(l-1)\r\nn%=l\r\nprint(l-n)", "n = int(input())\nb = 10 ** (len(str(n)) - 1)\nprint(b - n % b)\n# Sat Oct 07 2023 20:48:22 GMT+0300 (Moscow Standard Time)\n", "n = input()\r\nprint((int(n[0])+1)*10**(len(n)-1)-int(n))", "n = input()\r\nm = str(int(n) + 1)\r\nif len(m) - m.count('0') <= 1:\r\n print(1)\r\nelse:\r\n L = len(n)\r\n t = str(int(n[0]) + 1) + '0' * (L-1)\r\n print(int(t) - int(n))", "def solve():\r\n n = input()\r\n m = (int(n[0]) + 1) * 10 ** (len(n) - 1)\r\n \r\n print(m - int(n))\r\n \r\n \r\nif __name__ == \"__main__\":\r\n solve()\r\n ", "year = input()\r\nprint(int(str(int(year[0])+1)+(\"0\"*(len(year)-1)))-int(year))", "n = input()\r\nk = int(n[0])\r\nn = int(n)\r\nk = (k+1)*10**(len(str(n))-1)\r\nprint(k-n)\r\n", "#!/usr/bin/python\nimport sys\ninput = lambda: sys.stdin.readline().strip()\nn = input()\nprint((int(n[0]) + 1) * 10 ** (len(n) - 1) - int(n))\n", "def cnt(x):\r\n sum=0\r\n while(x>0):\r\n sum+=1\r\n x//=10;\r\n return sum\r\n\r\nn=int(input())\r\ndig=cnt(n)\r\nlim=1\r\nfor i in range(dig-1):\r\n lim*=10\r\nres=lim\r\nwhile(res<=n):\r\n res+=lim\r\nprint(res-n)", "n = input()\r\n\r\nx = len(n)\r\n\r\nif x < 2:\r\n print(1)\r\nelse:\r\n y = (int(n[0]) + 1) * (10 ** (x - 1))\r\n print(y - int(n))\r\n", "import sys,math\r\nTests=1\r\nfor _ in range(Tests):\r\n s=input()\r\n if len(s)==1:\r\n print(1)\r\n else:\r\n t=str(int(s[0])+1)\r\n t+='0'*(len(s)-1)\r\n t=int(t)\r\n print(t-int(s))", "n = int(input())\r\nif n <= 9:\r\n print(1)\r\nelse:\r\n pow = 10 ** (len(str(n)) - 1)\r\n next = n + pow - (n % pow)\r\n print(next - n)", "n = input()\r\n\r\nif len(n) - n.count(\"0\") == 1:\r\n ans = \"1\" + \"0\" * n.count(\"0\")\r\nelse:\r\n ans = 10 ** (len(n)-1) - int(n[1:])\r\n\r\nprint(ans)", "sn = input()\r\nb= int('1'+'0'*(len(sn)-1))\r\nn = int(sn)\r\nt = int(sn[0]+'0'*(len(sn)-1))\r\nprint(t+b-n) ", "a=int(input())\r\nprint((10**(len(str(a))-1)-(a%(10**(len(str(a))-1)))))\r\n", "n = input()\r\nprint(((int(n[0])+1)*(10**(len(n)-1)))-int(n))", "s = input()\r\nnum=int(s)\r\nn=10**(len(s)-1)\r\nprint(n-num%n)", "n=int(input())\r\nif n<10:\r\n print(\"1\")\r\nelse:\r\n c=0\r\n k=n\r\n while(n>0):\r\n c+=1\r\n n=n//10\r\n f=int(\"1\"+(c-1)*'0')\r\n r=k%f\r\n print(f-r)", "s = input()[1:]\r\nprint(10 ** len(s) - (int(s) if s else 0))", "s = str(input())\n\nif s[0] == '9':\n\tans = '10' + (len(s) - 1) * '0'\nelse:\n\tans = str(int(s[0]) + 1) + (len(s) - 1) * '0'\n\nprint(int(ans) - int(s))", "\nclass Solution:\n def process(self):\n x = input()\n res = str(int(x[0]) + 1) + \"0\" * (len(x) - 1)\n print(int(res) - int(x))\n \nif __name__ == '__main__':\n Solution().process()\n \t \t\t \t \t \t \t \t\t\t\t\t\t", "##n = int(input())\r\n##a = list(map(int, input().split()))\r\n##print(' '.join(map(str, res)))\r\n\r\nn = int(input())\r\nx = 1\r\nb = 1\r\nwhile True:\r\n if x*b > n:\r\n print(x*b-n)\r\n exit(0)\r\n\r\n if x < 9:\r\n x += 1\r\n else:\r\n x = 1\r\n b *= 10 \r\n", "y=input()[1:]\r\nprint(10**len(y)-int(y or 0))", "n=int(input())\r\ntemp=n\r\ncnt=0\r\nwhile temp>0:\r\n temp=temp//10\r\n cnt+=1\r\nif cnt==1:\r\n print(1)\r\nelse:\r\n cal=((n)//(10**(cnt-1))+1)*(10**(cnt-1))\r\n print(cal-n)", "c=int(input())\ng=c\ndef check(n):\n\ts=0\n\twhile(n>0):\n\t\ta=n%10\n\t\tif(a!=0): s=s+1\n\t\tn=n//10\n\tif(s<=1): return 1\n\telse: return 0\n\t\nnum=0\nwhile(c>0):\n\tnum=num+1;\n\tc=c//10;\n\nun=g//pow(10,num-1)\n\nprint(((un+1)*pow(10,num-1))-g)\n", "S = int(input())\r\n\r\nd = 10 ** (len(str(S)) - 1)\r\n\r\n \r\nif S % d == 0:\r\n print(d)\r\nelse:\r\n print(d - (S % d))", "n=int(input())\r\nif n<10:\r\n print(1)\r\nelse:\r\n print(((int(str(n)[0])+1)*(10**(len(str(n))-1)))-n)\r\n", "#shivank - singh\r\n\r\nn = int(input())\r\ns = str(n)\r\nt = s[0]\r\nt = int(t)+1\r\nt = str(t)\r\nprint(int(t+\"0\"*(len(s)-1)) -n)", "s = input()\r\n\r\nl = len(s)\r\n\r\nnx = ((int(s) // (10 ** (l - 1))) + 1) * (10 ** (l - 1))\r\n\r\nprint(nx - int(s))", "n = str(input())\r\nif len(str(n))==1:\r\n print(1)\r\nelse:\r\n\r\n next_year = int(n[0]) +1\r\n zero = len(n)-1\r\n next_year = str(next_year) + '0'*zero\r\n ans = int(next_year) - int(n)\r\n print(ans)", "n = int(input())\r\ndigits = len(str(n))\r\nif n % (10**(digits-1)) == 0:\r\n next_happy_year = (n // (10**(digits-1)) + 1) * (10**(digits-1))\r\nelif str(n)[0] == '9':\r\n next_happy_year = 10 * (10**(digits-1))\r\nelse:\r\n next_happy_year = (int(str(n)[0]) + 1) * (10**(digits-1))\r\nprint(next_happy_year - n)\r\n", "import math\r\nn = int(input())\r\nans = 0\r\nif n < 10:\r\n\tprint (1)\r\n\texit()\r\nm = len(str(n))-1\r\ns = math.ceil(n/(10**m))\r\nif s*(10**m)-n == 0:\r\n\ts = math.ceil((n+1)/(10**m))\r\n\tprint (s*(10**m)-n)\r\nelse:\r\n\tprint (s*(10**m)-n)", "s=input()\r\nif len(s)==1:print(1)\r\nelse:print((10**(len(s)-1))-(int(s[1:])))", "\nInput=lambda:map(int,input().split())\n\nn = int(input())\np = len(str(n))\na = n // pow(10,p-1) + 1\na*=(pow(10,p-1))\nprint(a-n)\n\n\n\n", "from collections import *\r\ndef solve():\r\n n = int(input())\r\n a = 1\r\n while a<=n:\r\n a = a*10\r\n\r\n a = a//10\r\n b = a\r\n while b<=n:\r\n b+=a\r\n print(b-n)\r\n return\r\n\r\n# t = int(input())\r\n# for _ in range(t):\r\n# solve()\r\nsolve()", "a = input()\r\nif len(a)==1:\r\n print(1)\r\nelse:\r\n b = len(a)\r\n c = \"1\"+(b-1)*\"0\"\r\n d = (int(a)//int(c))*int(c)\r\n print(d+int(c)-int(a))\r\n", "y = input()\r\n\r\nl = len(y)\r\nx = l - 1\r\nm = int(y) // (10**x)\r\nprint((m+1)*(10**x)-int(y))\r\n", "a = input()\r\n\r\nif (int(a) < 10): print(1); exit()\r\n\r\ntrue_a = str(int(a[0]) + 1) + '0' * (len(a) - 1) \r\n\r\nprint(int(true_a) - int(a))", "year=input()\r\nnext=(int(year[0])+1)*(10**(len(year)-1))\r\nprint(next-int(year))\r\n", "a = input()\r\nbro = len(a)\r\nif bro == 1:\r\n print('1')\r\n exit()\r\nelse:\r\n s = a[0]\r\n nuli = ('0'*(bro-1))\r\n s = int(s)+1\r\n s = str(s)\r\n s += nuli\r\n s = int(s)\r\n a = int(a)\r\n print(s-a)", "import math\r\n\r\n\r\nn = input();\r\nn = int(n);\r\n\r\ni = 9\r\n\r\nwhile True:\r\n if(n % math.pow(10, i) != n):\r\n k = int(n / math.pow(10, i)) + 1\r\n print(int(k * math.pow(10, i) - n))\r\n break\r\n i = i - 1", "m=int(input())\r\nn=list(str(m))\r\nif(len(n)==1):\r\n\tprint(1)\r\nelse:\r\n\ta=10**(len(n)-1) - m%(10**(len(n)-1))\r\n\tprint(a)\r\n", "y = input()\r\nl = len(y)-1\r\ny=int(y)\r\n\r\nprint((y//(10**l)+1)*10**l - y)", "n=int(input())\r\nif n>=0 and n<=9:\r\n print(1)\r\nelse:\r\n s=str(n)\r\n k=(int(s[0])+1)*(10**(len(s)-1))\r\n print(k-n)", "a = input()\r\nn = '9'\r\nif a[0]!=n and len(a)==1:\r\n l = int(a)+1\r\nelif a[0]!=n :\r\n l=(int(a[0])+1)*(10**(len(a)-1))\r\nelse :\r\n l = l=(1)*(10**(len(a)))\r\nprint(l-int(a))", "n = int(input())\r\ns = str(n)\r\nbase = str(int(s[0]) + 1)\r\nfor i in range(len(s) - 1):\r\n base += '0'\r\nprint(int(base) - n)\r\n", "n=int(input())\r\ns=str(n)\r\nn2=int(str(int(s[0])+1)+\"0\"*(len(s)-1))\r\nprint(n2-n)", "n = input()\r\na = len(n)\r\nb = 10 ** (a - 1)\r\nn = int(n)\r\nprint((n // b + 1) * b - n)", "i = int(input())\ncnt=0\nj=i\nwhile j>9 :\n\tj=j/10;\n\tcnt=cnt+1\nk = i%(10**cnt)\ni=(10**(cnt))-k\nprint(i)\n", "s = input()\r\nif int(s) < 10:\r\n\tprint(1)\r\nelse:\r\n\tr = int(s[0]) + 1\r\n\tr *= 10 ** (len(s) - 1)\r\n\tprint(r - int(s))", "# time limit exceeded\r\n# current_year = int(input())\r\n# counttt = 0\r\n# this_year = 0\r\n# while this_year != 1:\r\n# current_year += 1\r\n# counttt += 1\r\n# # print(current_year)\r\n# # print(f\"this year is {this_year}\")\r\n# zeros = 0\r\n# for i in range(len(str(current_year))):\r\n# if (str(current_year))[i] == \"0\":\r\n# zeros += 1\r\n# if int(len(str(current_year))) - zeros <= 1:\r\n# this_year = 1\r\n# print(counttt)\r\n\r\ncurrent_year = int(input())\r\nif len(str(current_year)) == 1:\r\n print(1)\r\nelse:\r\n next_lucky_year = (\r\n str(int(str(current_year)[0])+1)) + (str(0)*int(len(str(current_year))-1))\r\n print(int(next_lucky_year) - current_year)\r\n", "n=input()\r\na=10**(len(n)-1)\r\nprint(a-(int(n)%a))", "X = int(input()) + 1\r\nif X <= 10 or str(X).count(\"0\") == len(str(X)) - 1:\r\n print(1)\r\n exit()\r\nX = str(X)\r\nprint(int(str(int(X[0]) + 1) + \"0\" * (len(X) - 1)) - int(X) + 1)\r\n", "n=int(input())\r\nl=0\r\ntmp=n\r\nwhile n>0:\r\n r=n%10\r\n n=n//10\r\n l+=1\r\nif tmp<10:\r\n print(1)\r\nelse:\r\n print((r+1)*(10**(l-1))-tmp)", "n=input()\r\nl=[]\r\nl.append(str(int(n[0])+1))\r\nfor pos in range(1,len(n)):\r\n l.append('0')\r\nlucky_no=''.join(l)\r\nprint(int(lucky_no)-int(n))", "a=list(input())\r\nb=int(\"\".join(a))\r\na[0]=str(int(a[0])+1)\r\nprint(int(a[0]+\"0\"*(len(a)-1))-b)", "strn = input()\nlength = len(strn)\nn = int(strn)\n\nwait = 0\n\nif length == 1:\n\twait = 1\nelse:\n\tfirstdigit = int(strn[0])\n\tfirstdigit = firstdigit + 1\n\tmultiplier = (10**(length - 1))\n\tsubfrom = firstdigit * multiplier\n\twait = subfrom - n\n\nprint(wait)", "n = int(input())\r\n\r\nl = len(str(n))\r\nans = -1\r\nfor c in range(1, 10):\r\n m = str(c)+'0'*(l-1)\r\n m = int(m)\r\n if m > n:\r\n ans = m-n\r\n break\r\nif ans == -1:\r\n m = int('1'+'0'*l)\r\n ans = m-n\r\nprint(ans)\r\n", "\r\nfrom math import ceil\r\nn = input()\r\ndd = len(n) - 1\r\n\r\nnextLuckyYear = ceil((int(n) + 1) / (10 ** dd)) * (10 ** dd)\r\n\r\nprint(nextLuckyYear - int(n))", "year = int(input())\r\n\r\ndef nonzero(year):\r\n year=str(year)\r\n return int(year[0])+1\r\ndef zero(year):\r\n year=str(year)\r\n return 10**int(len((year))-1)\r\nprint (nonzero(year)*zero(year)-year)", "year = int(input())\n\ndigits = len(str(year))\nif len(str(year)) == 1:\n print(1)\nelse:\n print(10 ** (digits - 1) - (year % (10 ** (digits - 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", "import sys\r\n\r\ninput = sys.stdin.readline\r\n\r\nn = input().strip(\"\\n\")\r\nk = int(str(int(n[0])+1)+'0'*(len(n)-1))\r\nprint(k-int(n))", "n = input()\r\nans = 0\r\nif len(n)<2:\r\n ans = int(n)+1\r\nelse:\r\n ans=int(n[0])+1\r\n ans *= pow(10,len(n)-1)\r\nprint(ans-int(n))", "y=input()\r\nos=y[0]\r\ns=int(os)+1\r\nn=(len(y))\r\nn1='0'*(n-1)\r\nd=(str(s)+(n1))\r\nprint(int(d)-int(y))\r\n\r\n\r\n", "n = input()\nnxt = (int(n[0]) + 1) * 10 ** (len(n) - 1)\nres = nxt - int(n)\nprint(res)\n", "n=int(input())\r\nsep=1\r\nfor i in range (1,9):\r\n if(sep==n):\r\n break\r\n if(sep>n):\r\n sep/=10\r\n break\r\n sep*=10\r\n\r\nxx=0\r\nfor i in range (1,11):\r\n xx+=sep\r\n if(xx>n):\r\n break\r\nif(xx==n):\r\n print (xx,end=\"\\n\")\r\nelse :\r\n print (int(xx-n),end=\"\\n\")\r\n", "t = input()\r\nif len(t) == 1:\r\n\tprint(1)\r\nelse:\r\n\tif int(t[0])+1 <= 9:\r\n\t\tprint(int(str(int(t[0])+1)+\"0\"*(len(t)-1))-int(t))\r\n\telse:\r\n\t\tprint(10**len(t)-int(t))\t\r\n", "n = int(input())\r\n\r\nif 1 <= n < 10:\r\n print (1)\r\nelse:\r\n nn = str(int(str(n)[0]) + 1) + '0' * (len(str(n)) - 1)\r\n print (int(nn) - n)", "a=input()\r\nb=int(a)\r\nif len(a)==1:\r\n print(\"1\")\r\nelif len(a)>1:\r\n print((((b//(10**(len(a)-1)))+1)*10**(len(a)-1))-b)", "n = input()\r\nans = (int(n[0])+1)*10**(len(n)-1)\r\nprint(ans-int(n))\r\n", "n=input()\r\na=int(n)\r\nl=len(n)\r\nx=a//10**(l-1)\r\nprint((10**(l-1))*(x+1)-a)", "x = input()\r\nten = '1' + '0'*(len(x)-1)\r\nif len(x)==1:\r\n exit(print(1))\r\nelse:\r\n x = int(x)\r\n ten = int(ten)\r\n near = (int(x/ten)+1)*ten\r\n print(near-x)\r\n", "\r\nyear = input()\r\n\r\nprint((int(year[0])+1)* (10**(len(year)-1)) - int(year))", "def main():\r\n s = input()\r\n n = int(s)\r\n if n<10:\r\n return 1\r\n\r\n m = int(s[0])+1\r\n m *= 10**(len(s)-1)\r\n return m-int(n)\r\n\r\nif __name__ == '__main__':\r\n print(main())\r\n", "n=input()\r\ns=len(n)\r\nif(s==1):\r\n print(1)\r\nelse:\r\n p=int(n[0])+1\r\n t=p*(10**(s-1))\r\n print(t-int(n))", "s = input()\r\nprint(int(str(int(s[0]) + 1) + '0' * (len(s) - 1)) - int(s))\r\n", "n = input()\r\nif len(n) == 1:\r\n\tprint(1)\r\nelse:\r\n\t#print(10**(len(n)-1))\r\n\tprint((int(n[0])+1)*10**(len(n)-1) - int(n))", "n=input()\r\n\r\nl=len(n)\r\nf=int(n[0])\r\nf=f+1\r\n\r\nn=int(n)\r\n\r\nx=1\r\nfor i in range(l-1):\r\n x=x*10\r\n\r\nprint(f*x-n)\r\n\r\n\r\n", "s = input()\r\nprint((int(s[0]) + 1) * pow(10, len(s) - 1) - int(s))", "n = int(input())\ns = str(n)\nfirst = str(int(s[0])+1)\nsuffix = '0'*len(s[1:])\ntarget = int(first+suffix)\nprint(target-n)\n\n\t \t \t\t\t \t \t \t \t", "n=int(input())\r\ns=str(n)\r\nf=s[0]\r\nnext=(int(f)+1)*(10)**(len(s)-1)\r\nprint(next-n)\r\n", "cur_year = int(input())\r\nif cur_year < 10:\r\n\tprint(1)\r\nelse:\r\n\tnum_count = len(str(cur_year))\r\n\tfirst_num = cur_year//int('1' + (num_count - 1)*'0')\r\n\thappy_year = int(str(first_num + 1) + (num_count - 1)*'0')\r\n\tprint(happy_year - cur_year)", "n = int(input())\r\nnum=n\r\nk = 0\r\nwhile n>0:\r\n k+=1\r\n n=n//10\r\nprint((pow(10,k-1)- num%pow(10,k-1)))", "n=int(input())\r\nw=str(n)\r\nl=len(w)\r\nif(l==1):\r\n print(\"1\")\r\nelse:\r\n k=str(n)\r\n m=str(int(k[0])+1)+(l-1)*\"0\"\r\n j=int(m)\r\n print(j-n)\r\n", "import sys, math\r\ninput=sys.stdin.readline\r\nINF=int(1e9)+7\r\n\r\n\r\n\r\ndef solve():\r\n n=int(input())\r\n result=int(str(int(str(n)[0])+1)+len(str(n)[1:])*'0')\r\n print(result-n)\r\n \r\n \r\n \r\n\r\n \r\nt=1\r\nwhile t:\r\n t-=1\r\n solve()\r\n", "import bisect\r\nimport sys\r\ninput = sys.stdin.readline\r\n\r\nx = []\r\nfor i in range(1, 10):\r\n y = i\r\n for _ in range(12):\r\n x.append(y)\r\n y *= 10\r\nx.sort()\r\nn = int(input())\r\nans = x[bisect.bisect_left(x, n + 0.5)] - n\r\nprint(ans)", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Fri Apr 3 04:51:28 2020\r\n\r\n@author: alexi\r\n\"\"\"\r\n\r\n\r\n\r\ndef lucky_year():\r\n year = int(input())\r\n \r\n if year < 10:\r\n return 1\r\n \r\n temp = str(year)\r\n \r\n lucky = ''\r\n\r\n lucky = lucky + str(int(temp[0])+1)\r\n for i in range(len(temp)-1):\r\n lucky = lucky + '0'\r\n \r\n \r\n return int(lucky) - year\r\n\r\n \r\n \r\n \r\n\r\nA = lucky_year()\r\nprint(A)", "import sys,math\r\n\r\nn = int(input())\r\ndigit = len(str(n))-1\r\nif(digit == 0):\r\n print('1')\r\nelse:\r\n p = math.pow(10,digit)\r\n res = (((int(n/p))+1)*p) - n\r\n print(int(res))\r\n", "n = int(input())\r\nif n < 10 : \r\n print('1')\r\nelse:\r\n x = len(str(n)) \r\n start = int(str(n)[0]) + 1\r\n goal= str(start) + ('0' * (x-1))\r\n print(int(goal) - n)", "num1 = int(input())\nlist = [int(x) for x in str(num1)]\nans = [0 for i in list]\nans[0] = list[0]+1\nnum = int(''.join(map(str,ans)))\nprint(num-num1)", "n = input()\r\nk = len(n)\r\nif(k == 1):\r\n print(1)\r\nelse:\r\n l = int(n[0])\r\n if(l == 9):\r\n print(pow(10,k)-int(n))\r\n else:\r\n print((l+1)*pow(10,k-1)-int(n))", "n = int(input())\r\nn1 = int('1' + '0' * (len(str(n)) - 1))\r\nn %= n1\r\nprint(n1 - n)\r\n", "n = input()\r\npow_10 = len(n) - 1\r\nn = int(n)\r\nnext_num = 10**pow_10 * (n // 10**pow_10 + 1)\r\ndelta = next_num - n\r\nprint(delta)", "def find_next(number):\r\n\tif(len(number) == 1):\r\n\t\treturn int(number)+1\r\n\tfirst = str(int(number[0]) + 1) \r\n\toutput = first\r\n\tfor x in range(0,len(str(number))-1) :\r\n\t\toutput += '0'\r\n\treturn output\r\n\t\t\r\nnumber = input()\r\noutput = int(find_next(number)) - int(number)\r\nprint(output)\t", "n = input()\r\nif len(n) == 1:\r\n print(1)\r\nelse:\r\n first = n[0]\r\n restLength = len(n) - 1\r\n new = str(int(first) + 1)\r\n print(int(new + \"0\"*restLength) - int(n))", "import math, sys\r\nfrom fractions import *\r\n\r\ndef mp():\r\n return list(map(int, input().split()))\r\n\r\ndef main():\r\n n = int(input())\r\n lg = len(str(n))\r\n x = n + 10 ** (lg - 1)\r\n m = str(x)[0] + '0' * (len(str(x)) - 1)\r\n print(int(m) - n)\r\ndeb = 0\r\nif deb:\r\n file = open('input.txt', 'w')\r\nelse:\r\n input = sys.stdin.readline\r\n \r\nmain()", "a = input()\nx = 10 ** (len(a) - 1)\nprint(x - (int(a) % x))", "'''\r\n╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬\r\n╬╬ ▓▓ ▓▓ ╬╬\r\n╬╬ ▓▓ ▓▓ ╬╬\r\n╬╬ ▓▓█████▓▓ ╬╬\r\n╬╬ ▓▓ ▓▓ ╬╬\r\n╬╬ ▓▓ ▓▓ ╬╬\r\n╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬\r\n'''\r\nn = input()\r\na = int(n[0])+1\r\nb = len(n)-1\r\nc = 10**b\r\nprint((a*c)-int(n))", "import sys\r\n\r\ns = int(input())\r\nt = 10**(len(str(s))-1)\r\n\r\nprint(-(s % t) + t)\r\n", "# Problem: A. Lucky Year\r\n# Contest: Codeforces - Educational Codeforces Round 21\r\n# URL: https://codeforces.com/contest/808/problem/A\r\n# Memory Limit: 256 MB\r\n# Time Limit: 1000 ms\r\n# \r\n# Powered by CP Editor (https://cpeditor.org)\r\n\r\ns = input()\r\nlength = len(s)\r\nnum = int(s)\r\ni = 10**length\r\nwhile i > num:\r\n\tdecr = 10**(length - 1)\r\n\ti -= decr\r\ni += decr\r\nprint(i - num)", "x=input()\r\ny=(int(x[0])+1)*(10**(len(x)-1))\r\nprint(y-int(x))\r\n", "n = int(input())\r\nif n <= 9 :\r\n print(\"1\")\r\n\r\nelse :\r\n m = str(n)[1:]\r\n k = (10 ** len(m) ) - int(m)\r\n\r\n print(k)", "a=input()\r\nf=lambda a: ((int(a[0])+1)*10**(len(a)-1)-int(a))\r\nprint(f(a))", "n=int(input())\r\nm=len(str(n))-1\r\ns=[]\r\nfor i in str(n):\r\n s.append(i)\r\nl=1\r\nk=''\r\nif len(str(n))==1:\r\n print(1)\r\n\r\nelse:\r\n for i in range(m):\r\n l*=10\r\n\r\n for i in range(1,m+1):\r\n k+=s[i]\r\n print(l-int(k))", "n = input(); print(1) if int(n) < 10 else print((int(n[0]) + 1)*10**(len(n)-1) - int(n))\r\n\r\n", "n = input()\npower = 10**(len(n)-1)\nprint(power - int(n)%power)", "x=input()\r\nz=eval(x[0])+1\r\ny=(z*(10**(len(x)-1)))\r\nprint(y-eval(x))", "n=int(input())\r\ns=str(n)\r\nm=len(s)\r\na=10**(m-1)\r\nk=n%a\r\nprint(a-k) ", "n = input()\r\nnum = int(n)\r\nif num < 10:\r\n print(1)\r\nelse:\r\n k = (int(n[0]) + 1) * (10 ** (len(n) - 1))\r\n print(k - num)\r\n ", "a=int(input())\r\nn=len(str(a))\r\nres=(a//10**(n-1)+1)*10**(n-1)-a\r\nprint(res)", "n=int(input())\r\nns=str(n)\r\nprint(int(str(int(ns[0])+1)+(len(ns)-1)*'0')-n)\r\n", "n = input()\r\nres = str(int(n[0])+1) + (len(n)-1)*'0'\r\nprint(int(res)-int(n))", "li = []\r\n\r\ndef pre_build():\r\n for i in range(10):\r\n for j in range(10):\r\n li.append(i*(10**j))\r\n\r\n li.sort()\r\n\r\ndef main():\r\n year = int(input())\r\n _len_ = len(li)\r\n\r\n for x in range(len(li)):\r\n if year>=li[x] and year<li[x+1]:\r\n print(li[x+1]-year)\r\n break\r\n\r\npre_build()\r\nmain()\r\n", "n = input()\r\ny = lambda n: int(str(int(n[0])+1) + \"0\" * (len(n)-1)) - int(n)\r\nprint(y(n) if y(n) > 0 else int(y(n))+1)", "import math\nn=int(input())\na=10**(int(math.log10(n)))\nprint(abs(n%a-a))", "n=int(input())\r\n\r\ndef dig(n):\r\n i=0\r\n while n>=1:\r\n i+=1\r\n n=n/10\r\n return i,int(n*10)\r\n\r\n\r\n\r\ndef q(n):\r\n di,face=dig(n)[0],dig(n)[1]\r\n val=(face+1)*(10**(di-1))\r\n return val-n\r\n\r\nprint(q(n))", "\nn = input()\nlog = len(n)-1 \nlarge = 10**log\nluck = (int(n)//large) * large + large\nprint(luck - int(n))\n\n\n", "def digit_count(x):\r\n count = 0\r\n while x>0:\r\n count += 1\r\n x //= 10\r\n return count\r\n\r\nyear = input()\r\nwait = int(year[0])\r\nyear = int(year)\r\n\r\nans = (wait+1)*(10**(digit_count(year)-1))\r\nans -= year\r\nprint(ans)\r\n", "# LUOGU_RID: 119818796\ndef find():\n c = [0] * 11\n cas = 0\n k = n\n while k:\n c[cas] = k % 10\n cas += 1\n k //= 10\n\n m = 0\n sum_val = 0\n s = 1\n\n if cas == 1:\n return 1\n\n for i in range(cas - 1):\n if c[i] != 0:\n sum_val += (10 - c[i]) * s\n c[i + 1] += 1\n else:\n m = 0\n s *= 10\n\n if sum_val == 0:\n return s\n else:\n return sum_val\n\n\nn = int(input())\nprint(find())\n", "n = int(input())\r\nif n < 10:\r\n print(1)\r\nelse:\r\n c=10**(len(str(n))-1)\r\n print(c-n%c)#2019-03-09 00:49:07.531", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn = input()[:-1]\r\nx = len(n)\r\nprint((int(n[0])+1) * (10**(len(n)-1)) - int(n))", "n = input()\r\nthingo = 10**(len(n)-1)\r\nremainder=int(n)%thingo \r\nprint(thingo-remainder)", "n=int(input())\r\n\r\nif n<=9:\r\n print(1)\r\nelse:\r\n y=len(str(n))\r\n p=str(n)\r\n z=p[1:]\r\n z=int(z)\r\n x=10**(y-1)\r\n print(x-z)\r\n ", "s=input()\r\nt=int(s)\r\nn=len(s)\r\nif(n<=1):\r\n print(1)\r\nelse:\r\n k=t%(10**(n-1))\r\n print(-k+10**(n-1))", "n = str(input())\r\nif len(n)==1:\r\n print('1')\r\nelse:\r\n print(int(str(int(n[0])+1)+'0'*(len(n)-1))-int(n))", "n = input()\r\nL = len(n)\r\nn = int(n)\r\nprint((n//(10**(L-1))+1)*(10**(L-1))-n)", "\r\nn = int(input())\r\ne = len(str(n))\r\nres = (n // (10**(e - 1)) + 1) * (10**(e - 1)) - n\r\nprint(res)\r\n", "n = input()\r\nf = int(n[0]) + 1\r\nf = str(f)\r\nb = len(n) - 1\r\nm = int(f + \"0\"*b)\r\nprint(m - int(n))", "def happy_year(s):\r\n if s[0] == '9':\r\n return 10 * (10 ** (len(s) - 1)) - int(s)\r\n return (int(s[0]) + 1) * (10 ** (len(s) - 1)) - int(s)\r\n\r\n\r\nprint(happy_year(input()))\r\n", "num = input()\r\nminus = 1\r\nif int(num) < 10:\r\n print(1)\r\nelse:\r\n for i in range(len(num)-1):\r\n minus *= 10\r\n minus = (int(num[0]) + 1) * minus\r\n print(minus - int(num))", "n = int(input())\r\nc = 0\r\nwhile n >= 10 ** (c + 1):\r\n c += 1\r\nprint((n // 10 ** c + 1) * 10 ** c - n)", "#lucky year:\r\n# no more than 1 non-zero digit\r\n# e.g 100 40000 5\r\n\r\n#1000000000\r\n\r\n\r\ndef checkNum(n):\r\n nonzeros = 0\r\n for i in str(n):\r\n if i != \"0\":\r\n nonzeros += 1 \r\n if nonzeros <= 1:\r\n return True\r\n else:\r\n return False\r\n\r\ndef nextNum(n):\r\n length = len(str(n))\r\n \r\n first = int(str(n)[0])\r\n first += 1\r\n last = str(first)\r\n for i in range(length-1):\r\n last += \"0\"\r\n full = int(last) - int(n)\r\n return full\r\n\r\nprint(nextNum(int(input())))\r\n \r\n \r\n", "i = list(input())\r\ng = str(int(i[0])+1) + ''.join([str(elem) for elem in [0]*(len(i)-1)])\r\nprint(int(g)-int(''.join([str(elem) for elem in i])))", "c = int(input())\r\nfor i in range(0, 10):\r\n for j in range(1, 10):\r\n ans = j * pow(10, i)\r\n if c < ans:\r\n print(ans-c)\r\n exit()\r\n", "s = input()\nprint((int(s[0]) + 1) * (10 ** (len(s) - 1)) - int(s))", "n=int(input())\r\ndef lucky(n):\r\n ch=n[0]+\"0\"*(len(n)-1)\r\n return ch==n\r\nif 1<=n<=9:\r\n print(1)\r\nelif lucky(str(n)):\r\n k=len(str(n))-1\r\n print(pow(10,k))\r\nelse:\r\n m=n\r\n if str(n)[0]==\"9\":\r\n k=len(str(n))\r\n m=pow(10,k)\r\n else:\r\n k=len(str(n))-1\r\n m=(int(str(n)[0])+1)*pow(10,k)\r\n \r\n \r\n\r\n print(m-n)\r\n \r\n", "def next(n):\r\n p=int(n[0])+1\r\n p=str(p)+(len(n[1:])*'0')\r\n return int(p)-int(n)\r\nprint(next(input()))\r\n \r\n \r\n", "def lucky_year(n):\r\n if 0<n<10:\r\n return 1\r\n a,i,p = n,0,1\r\n while a>0:\r\n i+=1\r\n a//=10\r\n p *=10\r\n p//=10\r\n return (n//p+1)*p-n\r\n\r\n\r\nn = int(input())\r\nprint(lucky_year(n))", "s=input();print((int(s[0])%9+1)*10**(len(s)-(s[0]!='9'))-int(s))", "n = int(input())\r\ns = 0\r\nadd = 1\r\nwhile add <= n:\r\n\ts += 1\r\n\tadd *= 10\r\ns -= 1\r\np = 10**s\r\nwhile p <= n:\r\n\tp += 10**s\r\nprint (abs(n-p))", "s = input()\r\nans = \"\"\r\nif len(s)==1:\r\n print(1)\r\nelse:\r\n ans+=str(int(s[0])+1)\r\n for i in range(1,len(s)):\r\n ans+=\"0\"\r\n print(int(ans)-int(s))", "num = input()\r\nFirst_digit = 0\r\nfor i in range(len(num)):\r\n First_digit = num[0]\r\nnext_digit = int(First_digit) + 1\r\nlucky_num = str(next_digit)\r\nfor i in range(len(num) - 1):\r\n lucky_num += '0'\r\nprint(int(lucky_num) - int(num))", "n=int(input())\r\nif (n/10==0):\r\n print(1)\r\nelse:\r\n l=int(len(str(n)))\r\n n=int(n)\r\n q=int(n/(10**(l-1)))\r\n ans=(q+1)*(10**(l-1))-n\r\n print(int(ans))", "def fun(n):\n ln = len(n)\n tmp = ord(n[0])\n tmp = tmp - 47\n for i in range(ln-1):\n tmp *=10\n print(tmp - int(n))\n \n\nif __name__ == \"__main__\":\n n = input()\n fun(n)\n \n\n\t\t \t\t \t \t\t\t\t\t\t\t\t\t\t \t\t\t", "def main():\r\n year = input()\r\n nextYear = (int(year[0])+1) * 10**(len(year)-1)\r\n print(nextYear-int(year)) \r\n\r\nmain()\r\n", "year = input().strip()\nl = len(year)-1\nyear = int(year)\nif year<10:\n\tprint(1)\nelse:\n\tprint((10**l) - (year%(10**l)))", "from fractions import gcd\r\n# from datetime import date, timedelta\r\nfrom heapq import*\r\nimport math\r\nfrom collections import defaultdict, Counter, deque\r\nfrom bisect import *\r\nimport itertools\r\nimport fractions\r\n# import sys\r\n# sys.setrecursionlimit(10 ** 7)\r\nMOD = 10 ** 9 + 7\r\n# input = sys.stdin.readline\r\n\r\n\r\ndef main():\r\n s = input()\r\n if len(s) == 1:\r\n print(1)\r\n exit()\r\n\r\n v = 10 ** (len(s) - 1)\r\n n = int(s[1:])\r\n print(v - n)\r\n\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "\r\nimport sys\r\nimport math\r\n# from collections import Counter\r\ninput = sys.stdin.readline\r\n\r\n\r\ndef inp():\r\n return(int(input()))\r\n\r\n \r\n\r\ndef lucky(n):\r\n old_year = n\r\n year = 0\r\n counts = -1 \r\n if n<10:\r\n return 1\r\n else:\r\n while(n>0):\r\n counts+=1\r\n r = n%10\r\n n = n//10\r\n year = (r+1)*10**counts\r\n return year - old_year\r\nn = inp()\r\nprint(lucky(n))\r\n\r\n", "\r\nn = input()\r\ndd = len(n) - 1\r\n\r\nnextLuckyYear = str(int(n[0]) + 1) + '0' * dd\r\n\r\nprint(int(nextLuckyYear) - int(n))", "n=input()\r\nl=[int(i) for i in n]\r\nx=l[0]\r\nx=(x+1)*pow(10,len(l)-1)\r\nn=int(n)\r\nprint (x-n)", "cy=input()\r\nl=len(cy)\r\nn=int(cy[0])+1\r\nn=str(n)\r\nn+=('0'*(l-1))\r\nw=int(n)-int(cy)\r\nprint(w)\r\n", "n = input()\r\nprint((int(n[0])+1) * 10**(len(n)-1) - int(n))", "def main2(n):\r\n length = len(str(n))\r\n finalNum = str(int(str(n)[0]) + 1)\r\n for i in range(length-1):\r\n finalNum+=\"0\"\r\n full = int(finalNum) - int(n)\r\n return full\r\n\r\nprint(main2(int(input())))", "num = input()\r\nres = int(str(int(num[0])+1)+('0'*(len(num)-1))) - int(num)\r\nprint(res)", "import math\r\nimport re\r\n \r\nn = input()\r\ns = len(n)\r\nm = int(n)\r\nprint((10 ** (s - 1)) - (m % (10 ** (s - 1))))", "year=str(input())\r\nend=(int(year[0])+1)*10**(len(year)-1)\r\nprint(end-int(year))\r\n", "a=input()\r\nb=\"1\"\r\nfor i in range(len(a[1:])):\r\n b+=\"0\"\r\nif len(a)==1:\r\n print(1)\r\nelse:\r\n print(int(b)-int(a[1:]))", "n = int(input())\nif n <= 9:\n print(1)\nelse:\n if n % 10 != 0:\n print(((n // 10 ** (len(str(n)) - 1) + 1) * 10 ** (len(str(n)) - 1)) - n)\n else:\n print(((n // 10 ** (len(str(n)) - 1) + 1) * 10 ** (len(str(n)) - 1)) - n)\n", "n = input()\r\nt = (len(n)-1)*\"0\"\r\ne = int(n[0])+1\r\nf = int(str(e)+t)%int(n)\r\nif f == 0:\r\n print(n)\r\nelse:\r\n print(f)\r\n \r\n", "x=input()\r\nl=len(x)\r\ny=x[0]\r\nz=int(y)+1\r\na=str(z)+\"0\"*(l-1)\r\nprint(int(a)-int(x))\r\n", "#!/usr/bin/env python\r\n\r\ndef main():\r\n n = int(input()) + 1\r\n nstr = str(n)[1:]\r\n if not nstr:\r\n print(1)\r\n return\r\n \r\n wf = int(nstr)\r\n if wf == 0:\r\n print(1)\r\n else:\r\n nxt = int('1' + '0'*len(nstr))\r\n print(nxt - wf + 1)\r\n \r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "# LUOGU_RID: 120316902\nn = input()\r\nif(n[0] != '9'):\r\n head = int(list(n)[0]) + 1\r\n res = head * pow(10, len(n) - 1)\r\nelse:\r\n head = 1\r\n res = head * pow(10, len(n))\r\n\r\nprint(res-int(n))\r\n", "n = input()\r\nprint(int(str(int(n[0]) + 1) + '0' * (len(n) - 1)) - int(n))", "n=int(input())\r\nif n<=9:\r\n print(1)\r\nelse:\r\n st=str(n)\r\n first=st[0]\r\n l=len(st)-1\r\n nxt=int(str(int(first)+1)+('0'*l))\r\n print(nxt-n)\r\n \r\n \r\n", "n = int( input() )\r\nif n < 9:\r\n print( 1 )\r\nelse:\r\n g = n\r\n k = 1\r\n while g > 9:\r\n g //= 10\r\n k *= 10\r\n print( ( g + 1 ) * k - n )\r\n", "n = int(input())\r\ndig = len(str(n))\r\nans = 0\r\nif len(str(n)) == 1:\r\n print(1)\r\n exit()\r\nfor x in range(dig-1, 0,-1):\r\n if (str(n))[x] != '0':\r\n num = int((str(n))[x])\r\n n += (10 - num) * 10**(dig - x - 1)\r\n ans += (10 - num) * 10**(dig - x - 1)\r\nif ans == 0:\r\n print(10**(dig-1))\r\nelse:\r\n print(ans)", "i = input()\nd = 10 ** (len(i) - 1)\nx = -int(i) % d\nprint([x, d][x == 0])\n", "\nn = int(input())\ntemp = n\nlog = 0 \nwhile temp // 10 > 0:\n temp //= 10\n log += 1\nlarge = 10**log\nluck = (n//large) * large + large\nprint(luck - n)\n\n\n", "n = int(input());\r\n\r\nlength = len(str(n));\r\n\r\ns = str(n);\r\n\r\nthat_year = (int(s[0]) + 1) * pow(10, length - 1);\r\n\r\nprint(that_year - n);", "a = input()\nx = len(a) - 1\nprint(10 ** x - (int(a) % (10 ** x)))", "number = input()\r\n\r\n\r\ndef lucky(n):\r\n if sum((1 for x in n if x != '0')) > 1:\r\n return False\r\n else:\r\n return True\r\n\r\n\r\ndef next_lucky(n):\r\n end = (len(n) - 1) * '0'\r\n nxt = str(int(n[0]) + 1) + end\r\n return int(nxt) - int(n)\r\n\r\nprint(next_lucky(number))\r\n", "n = int(input())\r\nif n < 10:\r\n print(1)\r\nelse:\r\n ln = len(str(n))\r\n dig = f'{int(str(n)[0])+1}'+('0'*(ln-1))\r\n print(abs(int(dig) - int(n)))\r\n\r\n", "n=int(input())\r\nanst=1\r\nnn=n\r\nwhile nn>=10:\r\n nn//=10\r\n anst*=10\r\nprint((nn+1)*anst-n)", "a=input()\r\nn=len(a)\r\nprint((int(a[0])+1)*10**(n-1)-int(a))", "def solve(n):\n if len(n) == 1: return 1\n size_n = len(n)\n if int(n[0]) < 9:\n r = str(int(n[0]) + 1) + \"0\"*(size_n - 1)\n return int(r) - int(n)\n else:\n r = \"1\" + \"0\"*size_n\n return int(r) - int(n)\n\n\nN = input()\nprint(solve(N))\n# 1521382855084\n", "n=input()\r\nr=10**(len(n)-1)\r\nprint(r-(int(n)%r))", "year = int(input())\r\nif year<10:\r\n print(1)\r\nelse:\r\n x = str(year)\r\n ny = (int(x[0])+1)*(10**(len(x)-1))\r\n print(ny-year)\r\n", "n = input()\r\nif len(n) == 1:\r\n print(1)\r\nelse:\r\n a = int(n[0])\r\n zeros =''\r\n for i in range(len(n)-1):\r\n zeros += '0'\r\n b = (a +1) * int('1'+ zeros)\r\n difference = b - int(n)\r\n print(difference)", "def is_ok(n):\r\n return len([i for i in str(n) if i != '0']) == 1\r\n\r\n\r\nn = int(input())\r\n\r\nif is_ok(n + 1):\r\n print(1)\r\nelse:\r\n n_ = int(str(int(str(n)[0]) + 1) + '0' * (len(str(n)) - 1))\r\n print(n_ - n)\r\n", "a=input()\r\nl=len(a)\r\nif l!=1:\r\n b=10**(l-1)\r\n print(b-int(a[1:]))\r\nelse:print(1)", "n = int(input())\r\nif n<10:\r\n print(1)\r\nelse:\r\n l = [int(i) for i in str(n)]\r\n a=int(str(l[0]+1)+str(0)*(len(l)-1))\r\n print(a-n)\r\n", "year=input('')\r\ny=int(year[0])\r\nif(len(year)==1):\r\n print(\"1\")\r\nelse:\r\n if(y!=9):\r\n ans=(y+1)*(10**(len(year)-1))-int(year)\r\n print(ans)\r\n else:\r\n ans=1*(10**len(year))- int(year)\r\n print(ans) ", "n=input()\np=n[0]\np=int(p)\n\n\t\na=len(n)\nif p==9:\n\tx=10**(a)\n\tprint(x-int(n))\nelse:\n\tv=10**(a-1)\n\tg=str(p+1)+str(v)[1:]\n\tprint(int(g)-int(n))\n\n\t \t\t \t \t \t\t\t \t\t\t", "num = int(input())\r\nif(num < 10):\r\n print(1)\r\nelse:\r\n zeros = len(str(num))\r\n firstNum = str(int(str(num)[0]) + 1)\r\n tempAns = int(firstNum + \"0\" * (zeros - 1))\r\n temp = abs(num - tempAns)\r\n print(temp)", "current_year = int(input())\n\nfirst_digit = str(current_year)[0]\nnumber_of_digits = len(str(current_year))\n\ndesired_first_digit = str(1 + int(first_digit))\ndesired_number_of_0_digits = '0' * (number_of_digits - 1)\n\ndesired_year = desired_first_digit + desired_number_of_0_digits\n\nprint(int(desired_year) - current_year)", "n=int(input())\r\nj=len(str(n))\r\nif j==1:\r\n\tprint(1)\r\nelse:\r\n\tprint(((n//(10**(j-1)))+1)*10**(j-1)-n)", "n = input()\r\nprint(int((int(n[0])+1)*(10**(len(n)-1)))-int(n))", "def solve(n):\r\n digits = len(str(n))\r\n y = 10 ** (digits - 1)\r\n return -n % y or y\r\n\r\nn = int(input().strip())\r\nprint(solve(n))\r\n", "year = input()\nraz = len(year)\nnext_year = (int(year[0])+1) * 10**(raz-1)\nprint(next_year - int(year))", "n=input()[1:]\r\nprint(10**len(n)-int(n or 0))\r\n", "s = input()\r\nnum = int(s)\r\nn = len(s)\r\nx = int(s[0]) \r\nans = (x+1)*(10**(n-1))\r\nprint(ans-num)", "from collections import deque\r\nCurrentYear = input()\r\nK = int(CurrentYear)\r\nL = 0\r\nGold = False\r\nwhile Gold == False:\r\n K = str(K)\r\n if len(K) > 1:\r\n S = deque(K)\r\n if S[0] == \"9\":\r\n Gold = True\r\n for i in range(0, len(S)):\r\n if i == 0:\r\n S.remove(S[0])\r\n S.appendleft(\"0\")\r\n S.appendleft(\"1\")\r\n else:\r\n S[i] = \"0\"\r\n S[-1] = \"0\"\r\n # DECODE HERE\r\n Draft = \"\"\r\n for b in range(0, len(S)):\r\n Draft += S[b]\r\n Draft = int(Draft)\r\n K = int(K)\r\n print(Draft - K)\r\n else:\r\n Gold = True\r\n for i in range(0, len(S)):\r\n if i == 0:\r\n F = int(S[0])\r\n F += 1\r\n F = str(F)\r\n S.remove(S[0])\r\n S.appendleft(F)\r\n else:\r\n S[i] = \"0\"\r\n Draft = \"\"\r\n for b in range(0, len(S)):\r\n Draft += S[b]\r\n Draft = int(Draft)\r\n K = int(K)\r\n print(Draft - K)\r\n else:\r\n Gold = True\r\n print(1)\r\n", "n = int(input())\r\ns = str(n)\r\nif(s[0] == '9'):\r\n print(int('1' + '0' * len(s)) - n)\r\nelse:\r\n print(int(str(int(s[0]) + 1) + '0' * (len(s) - 1)) - n)", "in_str = input()\r\nx = (int(in_str[0])+1)*10**(len(in_str)-1)\r\nprint(x-int(in_str))\r\n", "v=int(input())\r\n\r\nif v<10:\r\n print(\"1\")\r\nelse:\r\n r=pow(10,len(str(v))-1)\r\n n=(v-v%r)+r\r\n print(n-v)\r\n", "n=input()\r\nif len(n)==1:\r\n print(1)\r\nelse:\r\n n=int(n)\r\n z=len(str(n))-1\r\n print(10**z-n%(10**z))\r\n", "n=input()\r\nn1=list(n)\r\nl=len(n1)\r\nif l==1:\r\n print(1)\r\nelse:\r\n s=int(f\"{int(n1[0])+1}{'0'*(l-1)}\")\r\n print(s-int(n))", "num1 = input()\nlist = [int(x) for x in num1]\nnum1 = int(num1)\nans = []\n\nfor i in range(len(list)):\n ans.append(0)\nif len(list) ==1:\n print(1)\nelse:\n ans[0]= list[0]+1\n num = int(''.join(map(str,ans)))\n print(num-num1)", "import sys\r\n\r\ninput = sys.stdin.readline\r\n\r\nn = list(input().rstrip())\r\n\r\nprint(int(str(int(n[0]) + 1) + '0' * (len(n) - 1)) - int(''.join(n)))", "n=input()\r\nx=10**(len(n)-1)\r\nprint(x-(int(n)%x))", "n = list(input())\r\nx = str(n[0])\r\nx += \"0\"*(len(n)-1)\r\ntemp = \"1\"\r\ntemp += \"0\"*(len(n)-1)\r\nans = int(x) + int(temp)\r\nprint(ans - int(\"\".join(n)))", "year = input()\r\nlength = len(year)\r\nyear = int(year)\r\n\r\nif length == 1 : exit(print(1))\r\na = (10 ** (length - 1))\r\n\r\nprint(a - (year % a))" ]

[ "import math\nimport itertools\n\nif __name__ == '__main__':\n N = int(input())\n likes = [input() for i in range(N)]\n likes = [line.split() for line in likes]\n likes = [(words[0], words[2]) for words in likes]\n a, b, c = (float(val) for val in input().split())\n\n min_diff = max(a, b, c)\n possible_groups = []\n for i in range(1, 7 - 1):\n for j in range(1, 7 - i):\n a_e = math.floor(a / i)\n b_e = math.floor(b / j)\n c_e = math.floor(c / (7 - i - j))\n diff = max(a_e, b_e, c_e) - min(a_e, b_e, c_e)\n if diff < min_diff:\n min_diff = diff\n possible_groups = [(i, j)]\n elif diff == min_diff:\n possible_groups.append((i, j))\n max_likes = 0\n for order in itertools.permutations(['Anka', 'Chapay', 'Cleo', 'Troll', 'Dracul', 'Snowy', 'Hexadecimal']):\n for i, j in possible_groups:\n likes_count = 0\n seta = set(order[:i])\n setb = set(order[i:(i + j)])\n setc = set(order[(i + j):])\n for p, q in likes:\n if p in seta and q in seta:\n likes_count += 1 \n if p in setb and q in setb:\n likes_count += 1 \n if p in setc and q in setc:\n likes_count += 1 \n max_likes = max(max_likes, likes_count)\n print(f'{min_diff} {max_likes}')\n\n", "import itertools\r\nn=int(input())\r\na,b=[],{'An':0,'Ch':1,'Cl':2,'Tr':3,'Dr':4,'Sn':5,'He':6}\r\nfor i in range(n):\r\n x,y,z=input().split()\r\n a.append([b[x[:2]],b[z[:2]]])\r\n \r\nm1,m2,m3=map(int,input().split())\r\nans=10**9\r\nmk=10**9\r\nfor k1 in range(1,6):\r\n for k2 in range(1,7-k1):\r\n k3=7-k1-k2\r\n if k3<=0:continue\r\n c=[m1//k1,m2//k2,m3//k3]\r\n d=max(c)-min(c)\r\n if d<ans:\r\n ans,mk=d,0\r\n if d==ans:\r\n for e in set(itertools.permutations([0]*k1+[1]*k2+[2]*k3)):\r\n L=0\r\n for f in a:\r\n if e[f[0]]==e[f[1]]: L+=1\r\n if mk<L: mk=L\r\nprint(ans,mk)\r\n\r\n \r\n", "from itertools import*\r\nind = {'Anka': 0, 'Chapay': 1, 'Cleo' : 2, 'Troll' : 3, 'Dracul' : 4, 'Snowy' : 5, 'Hexadecimal' : 6}\r\n\r\ngr = []\r\nn = int(input())\r\n\r\nfor i in range(n):\r\n q, ch, p = input().split()\r\n gr.append((ind[q], ind[p]))\r\n\r\nbest_diff, best_likes = 10**18, -1 \r\n\r\na, b, c = map(int, input().split())\r\nfor r in product([0, 1, 2], repeat=7):\r\n sz = [0]*3\r\n for x in r:\r\n sz[x] += 1\r\n if 0 in sz: continue \r\n diff = max(a // sz[0], b // sz[1], c // sz[2]) - min(a // sz[0], b // sz[1], c // sz[2])\r\n likes = 0\r\n\r\n for x in gr:\r\n if r[x[0]] == r[x[1]]:\r\n likes += 1\r\n if best_diff > diff:\r\n best_diff, best_likes = diff, likes\r\n elif best_diff == diff and best_likes < likes:\r\n best_likes = likes\r\nprint(best_diff, best_likes)# 1689027214.1832247", "from itertools import combinations\n\n\ndef main():\n heroes = (\"Anka\", \"Chapay\", \"Cleo\", \"Troll\", \"Dracul\", \"Snowy\", \"Hexadecimal\")\n sympaty = [[False] * 7 for _ in range(7)]\n for _ in range(int(input())):\n a, _, b = input().split()\n sympaty[heroes.index(a)][heroes.index(b)] = True\n a, b, c = map(int, input().split())\n tmp, res = [], []\n for i in range(1, 6):\n for j in range(1, 7 - i):\n t = (int(a / i), int(b / j), int(c / (7 - i - j)))\n tmp.append((max(t) - min(t), i, j))\n delta = min(tmp)[0]\n for i, j in ((i, j) for x, i, j in tmp if x == delta):\n for aa in combinations(range(7), i):\n rest = [x for x in range(7) if x not in aa]\n for bb in combinations(rest, j):\n res.append(sum(sum(sympaty[x][y] for x in xy for y in xy)\n for xy in (aa, bb, [x for x in rest if x not in bb])))\n print(delta, max(res))\n\n\nif __name__ == '__main__':\n main()\n", "import itertools\n\n\nhero = {\n \"Anka\": 0,\n \"Chapay\": 1,\n \"Cleo\": 2,\n \"Troll\": 3,\n \"Dracul\": 4,\n \"Snowy\": 5,\n \"Hexadecimal\": 6,\n}\npartitions = [\n (1, 1, 5),\n (1, 2, 4),\n (1, 3, 3),\n (2, 2, 3),\n]\n\n\ndef likes(group):\n return sum(g[i][j] for i in group for j in group)\n\n\ng = [[0] * 7 for _ in range(7)]\nfor _ in range(int(input())):\n x, y = input().split(\" likes \")\n g[hero[x]][hero[y]] = 1\n\na, b, c = sorted(map(int, input().split()))\nbest_diff = float(\"inf\")\nbest_partitions = []\nfor p in partitions:\n exp = (a // p[0], b // p[1], c // p[2])\n diff = max(exp) - min(exp)\n if diff == best_diff:\n best_partitions.append(p)\n elif diff < best_diff:\n best_diff = diff\n best_partitions = [p]\n\nbest_likes = max(\n likes(h[:x]) + likes(h[x : x + y]) + likes(h[x + y :])\n for x, y, _ in best_partitions\n for h in itertools.permutations(range(7))\n)\nprint(best_diff, best_likes)\n", "minn=[10**10]\r\nmaxx=[0]\r\nA=[]\r\nB=[]\r\nC=[]\r\nN=['Anka','Chapay','Cleo','Troll','Dracul','Snowy','Hexadecimal']\r\nk={}\r\nT=[0]*7\r\nfor i in range(7):\r\n k[N[i]]=i\r\nC=[]\r\nfor i in range(7):\r\n C.append([0]*7)\r\ndef Solve(i):\r\n if(i==7):\r\n a=[]\r\n b=[]\r\n c=[]\r\n for j in range(7):\r\n if(T[j]==1):\r\n a.append(j)\r\n elif(T[j]==2):\r\n b.append(j)\r\n else:\r\n c.append(j)\r\n L=0\r\n if(len(a)==0 or len(b)==0 or len(c)==0):\r\n return\r\n for item in a:\r\n for q in a:\r\n if(C[item][q]):\r\n L+=1\r\n for item in b:\r\n for q in b:\r\n if(C[item][q]):\r\n L+=1\r\n for item in c:\r\n for q in c:\r\n if(C[item][q]):\r\n L+=1\r\n for x in range(3):\r\n for y in range(3):\r\n if(x==y):\r\n continue\r\n for z in range(3):\r\n if(x==z or y==z):\r\n continue\r\n e=min((X[x]//len(a),X[y]//len(b),X[z]//len(c)))\r\n ee=max((X[x]//len(a),X[y]//len(b),X[z]//len(c)))\r\n if(ee-e<minn[0]):\r\n minn[0]=ee-e\r\n maxx[0]=L\r\n elif(ee-e==minn[0]):\r\n if(maxx[0]<L):\r\n maxx[0]=L\r\n return\r\n T[i]=1\r\n Solve(i+1)\r\n T[i]=2\r\n Solve(i+1)\r\n T[i]=3\r\n Solve(i+1)\r\n return\r\nn=int(input())\r\nfor i in range(n):\r\n s=input().split()\r\n C[k[s[0]]][k[s[2]]]=1\r\nX=list(map(int,input().split()))\r\nSolve(0)\r\nprint(minn[0],maxx[0])", "import itertools\r\n\r\nr = list(map(list,itertools.permutations([1,2,3,4,5,6,7])))\r\n#print(r)\r\n\r\nm={\"Anka\":1,\"Chapay\":2,\"Cleo\":3,\"Troll\":4,\"Dracul\":5,\"Snowy\":6,\"Hexadecimal\":7}\r\n\r\ndef hash(a,b):\r\n return str(a)+\"-\"+str(b)\r\n\r\nn=int(input())\r\ns = set()\r\n\r\nfor i in range(n):\r\n q,e,p=map(str,input().split())\r\n q = m[q]\r\n p = m[p]\r\n s.add(hash(q,p))\r\n\r\na,b,c = map(int,input().split())\r\nmn = 10**20\r\ncomb = []\r\n\r\nfor i in range(1,7):\r\n for j in range(1,7):\r\n u = 7 - i - j\r\n if u<=0:\r\n continue\r\n k = [a//i, b//j, c//u]\r\n k.sort()\r\n if k[-1]-k[0]<mn:\r\n mn = k[-1]-k[0]\r\n comb = [[i,j,u]]\r\n elif k[-1]-k[0]==mn:\r\n comb.append([i,j,u])\r\n\r\nprint(mn, end=\" \")\r\n\r\nmax_simp = 0\r\nfor i in comb:\r\n for j in r:\r\n group = [j[0:i[0]],j[i[0]:i[0]+i[1]],j[i[0]+i[1]:7]]\r\n #print(group)\r\n simp = 0\r\n for k in group:\r\n for a in range(len(k)):\r\n for b in range(len(k)):\r\n if hash(k[a],k[b]) in s: simp+=1\r\n max_simp = max(max_simp, simp)\r\n\r\nprint(max_simp)\r\n\r\n\r\n", "names = ['Anka', 'Chapay', 'Cleo', 'Troll', 'Dracul', 'Snowy', \\\n 'Hexadecimal']\n\nminDif = (10 ** 1000, 1)\ntotLikes = 0\n\ndef less(a, b):\n # a < b\n return a[0] * b[1] < a[1] * b[0]\n\ndef eq(a, b):\n return a[0] * b[1] == a[1] * b[0]\n\ndef rec(cur, groups):\n if cur == 7:\n global likes, exp, minDif, totLikes\n if 1 not in groups or 2 not in groups or \\\n 3 not in groups:\n return\n mx = (0, 1)\n mn = (10 ** 100, 1)\n curLike = 0\n\n for i in range(1, 4):\n curGroup = [x[0] for x in enumerate(groups) if x[1] == i]\n high = exp[i - 1] // len(curGroup)\n low = 1\n\n q = (high, low)\n if less(mx, q):\n mx = q\n if less(q, mn):\n mn = q\n\n for v in curGroup:\n for u in curGroup:\n curLike += likes[v][u]\n\n\n q = (mx[0] * mn[1] - mn[0] * mx[1], mn[1] * mx[1])\n if less(q, minDif):\n minDif = q\n totLikes = curLike\n elif eq(q, minDif):\n if curLike > totLikes:\n totLikes = curLike\n else:\n rec(cur + 1, groups + [1])\n rec(cur + 1, groups + [2])\n rec(cur + 1, groups + [3])\n\nn = int(input())\nlikes = [[0 for i in range(len(names))] for j in range(len(names))]\nfor i in range(n):\n like = input().split(' ')\n likes[names.index(like[0])][names.index(like[2])] = 1\nexp = list(map(int, input().split()))\n\nrec(0, [])\nprint(minDif[0] // minDif[1], totLikes)\n", "from itertools import product\n\nn = int(input())\n\nnames_to_index = {\n 'Anka': 0,\n 'Chapay': 1,\n 'Cleo': 2,\n 'Troll': 3,\n 'Dracul': 4,\n 'Snowy': 5,\n 'Hexadecimal': 6,\n }\n\nliking = set()\n\nfor i in range(n):\n a, b, c = input().split()\n liking.add( (names_to_index[a], names_to_index[c]) )\n\ndiablo, baal, mefisto = map(int, input().split())\n\nresults = set()\n\ndef sum_liking(heroes):\n s = 0\n for a in heroes:\n for b in heroes:\n if (a, b) in liking:\n s += 1\n return s\n\nfor a in product(*[range(1,4)]*7):\n if 1 in a and 2 in a and 3 in a:\n tmp_liking = sum_liking([i for i in range(7) if a[i] == 1]) +\\\n sum_liking([i for i in range(7) if a[i] == 2]) +\\\n sum_liking([i for i in range(7) if a[i] == 3])\n\n tmp = [diablo//a.count(1), baal//a.count(2), mefisto//a.count(3)]\n results.add( (max(tmp)-min(tmp), tmp_liking) )\n\n tmp = [diablo//a.count(1), baal//a.count(3), mefisto//a.count(2)]\n results.add( (max(tmp)-min(tmp), tmp_liking) )\n\n tmp = [diablo//a.count(2), baal//a.count(1), mefisto//a.count(3)]\n results.add( (max(tmp)-min(tmp), tmp_liking) )\n\n tmp = [diablo//a.count(3), baal//a.count(1), mefisto//a.count(2)]\n results.add( (max(tmp)-min(tmp), tmp_liking) )\n\n tmp = [diablo//a.count(2), baal//a.count(3), mefisto//a.count(1)]\n results.add( (max(tmp)-min(tmp), tmp_liking) )\n\n tmp = [diablo//a.count(3), baal//a.count(2), mefisto//a.count(1)]\n results.add( (max(tmp)-min(tmp), tmp_liking) )\n\n\nfinal_result = (2*10**9 + 10, 0)\n\n#print(list(liking))\n#print(list(results))\n\nfor i in results:\n if final_result[0] > i[0]:\n final_result = i\n elif final_result[0] == i[0] and final_result[1] < i[1]:\n final_result = i\n\nprint(str(final_result[0]) + \" \" + str(final_result[1]))\n\n\n\n\n", "from itertools import permutations\r\nn=int(input())\r\ndi={'Tr':0,'An':1,'Ch':2,'Cl':3,'Dr':4,'Sn':5,'He':6}\r\ns=[]\r\nfor i in range(n):\r\n a,l,b=map(str,input().split())\r\n s.append([di[a[:2]],di[b[:2]]])\r\na,b,c=map(int,input().split())\r\nout=10**20\r\nfor i in range(1,6):\r\n for j in range(1,7-i):\r\n k=7-i-j\r\n t=[a//i,b//j,c//k]\r\n t=max(t)-min(t)\r\n if out>t:\r\n out=t\r\n l=0\r\n if out==t:\r\n for r in set(permutations([0]*i+[1]*j+[2]*k)):\r\n l=max(l,sum(r[u]==r[v] for u,v in s))\r\nprint(out,l)\r\n \r\n", "def int_to_base(n, base):\n if n == 0:\n return '0'\n result = ''\n while n > 0:\n result += str(n % base)\n n //= base\n return result[::-1]\n\n\ndef calculate(option, exps, likes):\n mask = int_to_base(option, 3)\n mask = f'{mask:0>7s}'\n\n teams = [[], [], []]\n for i, e in enumerate(mask):\n if e == '0':\n teams[0].append(i)\n if e == '1':\n teams[1].append(i)\n if e == '2':\n teams[2].append(i)\n\n if not teams[0] or not teams[1] or not teams[2]:\n return None, None\n\n exp_max = max(exps[0] // len(teams[0]), exps[1] // len(teams[1]), exps[2] // len(teams[2]))\n exp_min = min(exps[0] // len(teams[0]), exps[1] // len(teams[1]), exps[2] // len(teams[2]))\n exp_diff = exp_max - exp_min\n liking = 0\n for i in range(3):\n for e1 in teams[i]:\n for e2 in teams[i]:\n liking += likes.get((e1, e2), 0)\n\n return exp_diff, -liking\n\n\nheroes = ['Anka', 'Chapay', 'Cleo', 'Troll', 'Dracul', 'Snowy', 'Hexadecimal']\nheroes_dict = {e: i for i, e in enumerate(heroes)}\n\nn = int(input())\nlikes = {}\nfor _ in range(n):\n p, _, q = input().split()\n likes[(heroes_dict[p], heroes_dict[q])] = 1\n\na, b, c = [int(e) for e in input().split()]\n\nanswers = []\nfor i in range(3 ** 7):\n exp_diff, liking = calculate(i, [a, b, c], likes)\n if exp_diff is None:\n continue\n answers.append((exp_diff, liking))\n\nprint(min(answers)[0], -min(answers)[1])\n", "import sys\r\nfrom array import array # noqa: F401\r\nfrom itertools import product\r\n\r\n\r\ndef input():\r\n return sys.stdin.buffer.readline().decode('utf-8')\r\n\r\n\r\nd = {\r\n 'Anka': 0,\r\n 'Chapay': 1,\r\n 'Cleo': 2,\r\n 'Troll': 3,\r\n 'Dracul': 4,\r\n 'Snowy': 5,\r\n 'Hexadecimal': 6\r\n}\r\n\r\nmatrix = [[0] * 7 for _ in range(7)]\r\nn = int(input())\r\nfor a in (input().split() for _ in range(n)):\r\n matrix[d[a[0]]][d[a[2]]] = 1\r\n\r\nexp = tuple(map(int, input().split()))\r\n\r\ndelta = 10**9\r\nlikes = 0\r\n\r\nfor num in product(range(1, 6), repeat=3):\r\n if sum(num) != 7:\r\n continue\r\n e = [exp[i] // num[i] for i in range(3)]\r\n if max(e) - min(e) > delta:\r\n continue\r\n flag = max(e) - min(e) == delta\r\n\r\n delta = max(e) - min(e)\r\n l = 0\r\n for p in product(range(3), repeat=7):\r\n if not all(p.count(i) == num[i] for i in range(3)):\r\n continue\r\n _l = 0\r\n for i in range(7):\r\n for j in range(7):\r\n if p[i] == p[j] and matrix[i][j]:\r\n _l += 1\r\n l = max(l, _l)\r\n if flag:\r\n likes = max(likes, l)\r\n else:\r\n likes = l\r\n\r\nprint(delta, likes)\r\n" ]

[ "\r\nn=int(input())\r\nd={}\r\nl=[]\r\nfor i in range((n*(n-1))//2-1):\r\n x,y=map(int,input().split())\r\n l.append([x,y])\r\n d[x]=d.get(x,0)+1\r\n d[y]=d.get(y,0)+1\r\nans=[]\r\nfor i in d.keys():\r\n if d[i]==n-2:\r\n ans.append(i)\r\nf1=0\r\nf2=0\r\nfor i in l:\r\n if i[0]==ans[0]:\r\n f1+=1\r\n elif i[1]==ans[0]:\r\n f1-=1\r\n if i[0]==ans[1]:\r\n f2+=1\r\n elif i[1]==ans[1]:\r\n f2-=1\r\n \r\nif f1<f2:\r\n ans=ans[::-1]\r\nprint(ans[0],ans[1])", "a=int(input())\r\nz=(a*(a-1))//2-1\r\nk=[]\r\nfor i in range(a):k.append([0]*a)\r\nfor i in range(z):\r\n u,v=map(int,input().split())\r\n u-=1;v-=1\r\n k[u][v]=1\r\n k[v][u]=-1\r\nx,y=0,0\r\nfor i in range(a):\r\n for j in range(1+i,a):\r\n if (k[i][j]==0):x,y=i,j\r\nok=False\r\nfor t in range(a):\r\n if k[x][t]==1 and k[t][y]==1:ok=True\r\nif ok:print(x+1,y+1)\r\nelse:print(1+y,1+x)\r\n", "# cook your dish here\r\nfrom sys import stdin,stdout\r\nfrom collections import Counter\r\nfrom itertools import permutations\r\nimport bisect\r\nimport math\r\nI=lambda: map(int,stdin.readline().split())\r\nI1=lambda: stdin.readline()\r\n#(a/b)%m =((a%m)*pow(b,m-2)%m)%m\r\n\r\n\r\nn=int(I1())\r\nNo_play=[0]*(n+1) \r\nw=[0]*(n+1)\r\nfor i in range((n*(n-1)//2)-1):\r\n x,y=I()\r\n No_play[x]+=1 \r\n No_play[y]+=1 \r\n w[x]+=1 \r\nx=y=-1 \r\nfor i in range(1,n+1):\r\n if No_play[i]==n-2:\r\n if x!=-1:\r\n y=i \r\n break\r\n x=i \r\nif w[x]>w[y]:\r\n print(x,y)\r\nelse:\r\n print(y,x)\r\n ", "winner, loser,amount,people,currmax = {},{},{},int(input()), 0\nfor line in range(int(people*(people-1)/2)-1):\n\tw,l = list(map(int, input().split(\" \")))\n\tif w in winner: winner[w].append(l) \n\telse: winner[w] = [l]\n\tif l in loser: loser[l].append(w)\n\telse: loser[l] = [w]\n\tif w not in amount: amount[w] = 1\n\telse: amount[w]+=1\n\tif l not in amount: amount[l] = 1\n\telse: amount[l]+=1\n\tif amount[l] > currmax: currmax = amount[l]\n\tif amount[w] > currmax: currmax = amount[w]\n\ntoprint = \"\"\nlost = [x for x in amount.keys() if amount[x] < currmax]\nif lost[0] in winner:\n\tfor key in winner[lost[0]]:\n\t\tif key in winner and lost[1] in winner[key]:\n\t\t\ttoprint = str(lost[0]) + \" \" + str(lost[1])\n\t\t\tbreak;\nif toprint == \"\" and lost[1] in winner:\n\tfor key in winner[lost[1]]\t:\n\t\tif key in winner and lost[0] in winner[key]:\n\t\t\ttoprint = str(lost[1]) + \" \" + str(lost[0])\n\t\t\tbreak;\nif toprint == \"\": toprint = str(lost[0]) + \" \" + str(lost[1])\nprint(toprint)", "def main():\r\n\tn=int(input())\r\n\tl=[{'loss':[],'win':[]} for i in range(n)]\r\n\tk=[0 for _ in range(n)]\r\n\twon=[0 for _ in range(n)]\r\n\tfor i in range((n*(n-1))//2-1):\r\n\t\tx, y=tuple(map(int,input().split()))\r\n\t\tl[y-1]['loss']+=[x]\r\n\t\tl[x-1]['win']+=[y]\r\n\t\twon[x-1]+=1\r\n\t\tk[x-1]+=1\r\n\t\tk[y-1]+=1\r\n\ti=0\r\n\tj=0\r\n\twhile (n-2) in k:\r\n\t\ti=k.index(n-2)\r\n\t\tk.remove(n-2)\r\n\t\tj=k.index(n-2)+1\r\n\t\tk.remove(n-2)\r\n\tif won[i]>won[j]:\r\n\t\tprint(i+1, j+1)\r\n\telse:\r\n\t\tprint(j+1, i+1)\r\n\r\nif __name__=='__main__':\r\n\tmain()", "def solve():\r\n n = int(input().strip())\r\n\r\n v = [x for x in range(1, n + 1)]\r\n\r\n count = [0 for x in range(1, n + 1)]\r\n won = [0 for x in range(1, n + 1)]\r\n\r\n for i in range(int(n * (n - 1) / 2) - 1):\r\n a, b = map(int, input().split())\r\n\r\n count[a - 1] += 1\r\n count[b - 1] += 1\r\n\r\n won[a - 1] += 1\r\n\r\n last = []\r\n for i in range(len(count)):\r\n if count[i] == n - 2:\r\n last.append(i + 1)\r\n\r\n # print(last, won)\r\n\r\n a_i = v.index(last[0])\r\n b_i = v.index(last[1])\r\n\r\n if won[a_i] > won[b_i]:\r\n print(last[0], last[1])\r\n else:\r\n print(last[1], last[0])\r\n\r\n # print(v)\r\n\r\n\r\nsolve()\r\n", "from collections import Counter\nn = int(input())\nmatches = n-1\nt = ((n*(n-1))//2)-1\nl,l1=[],[]\nfor _ in range(t):\n temp=list(map(int,input().split()))\n l.append(temp)\n l1.extend(temp)\nd = Counter(l1)\nd = d.most_common()\nle = d[-1]\nle = le[0]\nl2e = d[-2]\nl2e = l2e[0]\noddle = 0\noddl2e = 0\nfor i in range(0,len(l1),2):\n if(l1[i]==le):\n oddle+=1\n if(l1[i]==l2e):\n oddl2e+=1\nif(oddle>oddl2e):\n print(le,l2e)\nelse:\n print(l2e,le)\n \t \t\t\t \t\t \t \t\t\t \t \t\t\t", "n = int(input())\r\ntestcase = n * (n - 1) // 2\r\n\r\nres = [0] * (n + 1)\r\nfirst = [0] * (n + 1)\r\nsecond = [0] * (n + 1)\r\nj = 0\r\np1, p2 = 0, 0\r\n\r\nfor i in range(testcase - 1) :\r\n a, b = map(int, input().split())\r\n first[a] += 1\r\n second[b] += 1\r\n\r\nfor x, y in zip(first, second) :\r\n res[j] = x + y\r\n j += 1\r\nfor i in range(len(res)) :\r\n if res[i] == n - 2 :\r\n if p1 == 0 :\r\n p1 = i\r\n else :\r\n p2 = i\r\nif first[p1] > first[p2] :\r\n print(p1, p2)\r\nelse :\r\n print(p2, p1)\r\n \r\n \r\n \r\n ", "\r\nn = int(input())\r\n\r\nhash = {}\r\ntotal = (n*(n-1))//2\r\neach = n-1\r\nl = []\r\nhash_team = {}\r\nfor i in range(n):\r\n hash[i+1] = 0\r\n hash_team[i+1] = False\r\nfor i in range(total-1):\r\n x,y = map(int,input().split())\r\n # print(bin(x)[2:],bin(y)[2:])\r\n l.append([x,y])\r\n hash[x]+=1\r\n hash[y]+=1\r\nans = []\r\n\r\nfor i in hash.keys():\r\n if hash[i]!=each:\r\n ans.append(i)\r\nba = []\r\n# print(ans)\r\nfor i in range(total-1):\r\n x,y = l[i]\r\n if x == ans[0]:\r\n hash_team[y] = True\r\n if x == ans[1]:\r\n ba.append(y)\r\n\r\n\r\nflag = 0\r\n# print(l)\r\n\r\nfor i in ba:\r\n if hash_team[i] == False:\r\n print(ans[1],ans[0])\r\n flag = 1\r\n break\r\n\r\nif flag == 0:\r\n print(*ans)\r\n", "# -*- coding: utf-8 -*-\r\n\r\ndic,string = {},''\r\nn = int(input())\r\n\r\nfor i in range(n*(n-1)//2-1):\r\n x,y = map(int,input().split())\r\n if x not in dic: dic[x] = {'apps': 1, 'w': [y], 'l':[]}\r\n else: dic[x]['apps'] += 1; dic[x]['w'].append(y)\r\n if y not in dic: dic[y] = {'apps': 1, 'w': [], 'l':[x]}\r\n else: dic[y]['apps'] += 1; dic[y]['l'].append(x)\r\n \r\nfor j in range(1,n+1):\r\n if dic[j]['apps'] == n-1: del dic[j]\r\n\r\nuno,dos = list(dic.keys())[0],list(dic.keys())[1]\r\n\r\nif len(list(set(dic[uno]['w']).intersection(dic[dos]['l']))) > 0:\r\n print(str(uno)+' '+str(dos))\r\nelse: \r\n print(str(dos)+' '+str(uno))\r\n\r\n", "n = int(input())\r\n\r\nwin = {}\r\nneighbours = {}\r\nfor i in range(n):\r\n neighbours[i+1] = []\r\n win[i+1] = []\r\n\r\nfor i in range(int(n*(n-1)/2 - 1)):\r\n x, y = map(int, input().split())\r\n win[x].append(y)\r\n neighbours[x].append(y)\r\n neighbours[y].append(x)\r\n\r\n_min = [10 ** 9, []]\r\nfor key in neighbours:\r\n if len(neighbours[key]) < _min[0]:\r\n _min = [len(neighbours[key]), [key]]\r\n elif len(neighbours[key]) == _min[0]:\r\n _min[1].append(key)\r\n\r\nif len(win[_min[1][0]]) >= len(win[_min[1][1]]):\r\n print(_min[1][0], _min[1][1])\r\nelse:\r\n print(_min[1][1], _min[1][0])", "n = int(input())\r\na = [0]*n\r\nfor c in range(n*(n-1)//2-1):\r\n (x, y) = map(int, input().split())\r\n a[x-1] += 1\r\n a[y-1] -= 1\r\nr = []\r\nfor i in range(n):\r\n if (a[i] & 1) != (n-1) & 1:\r\n r += [(a[i], i+1)]\r\n\r\nr.sort()\r\nprint(r[1][1], r[0][1])\r\n", "# _\r\n#####################################################################################################################\r\n\r\ndef missingRecord(nParticipants, currRecord):\r\n storage = {str(participant): set() for participant in range(1, nParticipants+1)}\r\n for record in currRecord:\r\n storage[record[0]].add(record[1])\r\n\r\n storageOfnLosers = {participant: len(losers) for participant, losers in storage.items()}\r\n\r\n sortedParticipants = sorted(storageOfnLosers.keys(), key=lambda x: storageOfnLosers[x])\r\n for i in range(nParticipants):\r\n if storageOfnLosers[sortedParticipants[i]] == storageOfnLosers[sortedParticipants[i+1]]:\r\n if sortedParticipants[i] in storage[sortedParticipants[i+1]]:\r\n storage[sortedParticipants[i+1]].remove(sortedParticipants[i])\r\n missingLoser, = storage[sortedParticipants[i]].difference(storage[sortedParticipants[i+1]])\r\n return f'{sortedParticipants[i+1]} {missingLoser}'\r\n elif sortedParticipants[i+1] in storage[sortedParticipants[i]]:\r\n storage[sortedParticipants[i]].remove(sortedParticipants[i+1])\r\n missingLoser, = storage[sortedParticipants[i+1]].difference(storage[sortedParticipants[i]])\r\n return f'{sortedParticipants[i]} {missingLoser}'\r\n return f'{sortedParticipants[i]} {sortedParticipants[i+1]}'\r\n\r\n\r\ndef main():\r\n nParticipants = int(input())\r\n print(missingRecord(nParticipants, (input().split() for x in range(nParticipants*(nParticipants-1)//2-1))))\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "n=int(input())\r\nlist1=[[]for i in range(n+1)]\r\nlist2=[]\r\nfor i in range(n*(n-1)//2-1):\r\n a,b=map(int,input().split())\r\n list2.append((a,b))\r\n list1[a].append(b)\r\n list1[b].append(a)\r\n \r\nll=[]\r\nfor i in range(1,len(list1)):\r\n if(len(list1[i])!=(n-1)):\r\n ll.append(i)\r\nx=ll[0]\r\ny=ll[1]\r\nl1=set()\r\nl2=set()\r\nl3=set()\r\nl4=set()\r\nfor i in range(len(list2)):\r\n a=list2[i][0]\r\n b=list2[i][1]\r\n if(a==x):\r\n l1.add(b)\r\n elif(a==y):\r\n l2.add(b)\r\n elif(b==x):\r\n l3.add(a)\r\n elif(b==y):\r\n l4.add(a)\r\n \r\nif(len(l1.intersection(l4))>0):\r\n print(x,y)\r\nelse:\r\n print(y,x)\r\n \r\n\r\n ", "n=int(input())\r\na=[0]*(n+1)\r\nb=[[] for i in range(n+1)];h=[[] for i in range(n+1)]\r\nfor i in range(((n*(n-1))//2)-1):\r\n c,d=map(int,input().split())\r\n b[c].append(d);a[c]+=1;a[d]+=1;h[d].append(c)\r\nf=a.index(n-2);s=a.index(n-2,f+1)\r\nco=0\r\nfor i in h[s]:\r\n if i in b[f]:\r\n co=1;break\r\nif co==1:print(f,s)\r\nelse:print(s,f)", "num = int(input())\r\nwin = []\r\ndic = {}\r\nfor i in range(1,num+1):\r\n dic[i] = num-1\r\nfor i in range(int(num*(num-1)/2)-1):\r\n p = input().split()\r\n win.append(int(p[0]))\r\n dic[int(p[0])] -= 1\r\n dic[int(p[1])] -= 1\r\nk = []\r\nfor i in range(1,num+1):\r\n if dic[i] != 0:\r\n k.append(i)\r\na = win.count(k[0])\r\nb = win.count(k[1])\r\nif a >= b:\r\n print(k[0],k[1])\r\nelse:\r\n print(k[1],k[0])", "n = int(input())\r\n\r\nplayer_match_count = [0] * n\r\nplayer_win_count = {}\r\nfor i in range(n * (n - 1) // 2 - 1):\r\n u, v = map(int, input().split())\r\n player_match_count[u - 1] += 1\r\n player_match_count[v - 1] += 1\r\n player_win_count[u] = player_win_count.get(u, 0) + 1\r\n\r\npair = []\r\nfor i in range(n):\r\n if player_match_count[i] != n - 1:\r\n pair.append(i + 1)\r\n\r\npair.sort(key=lambda x: player_win_count.get(x, 0), reverse=True)\r\nprint(*pair)", "n=int(input())\na=[0]*n\nfor c in range(n*(n-1)//2-1):\n (x,y)=map(int,input().split())\n a[x-1]+=1\n a[y-1]-=1\nr = []\nfor i in range(n):\n if (a[i]&1)!=(n-1)&1:\n r.append((a[i],i+1))\nr.sort()\nprint(r[1][1],r[0][1])\n\n \t\t \t \t \t\t \t\t \t\t\t \t\t \t \t", "n=int(input())\r\nA=[tuple(map(int,input().split())) for i in range(n*(n-1)//2-1)]\r\n\r\nWIN=[0]*(n+1)\r\nLOSE=[0]*(n+1)\r\n\r\nfor x,y in A:\r\n WIN[x]+=1\r\n LOSE[y]+=1\r\n\r\nB=[]\r\n\r\nfor i in range(1,n+1):\r\n if WIN[i]+LOSE[i]!=n-1:\r\n B.append((WIN[i],i))\r\n\r\nB.sort(reverse=True)\r\n\r\nprint(B[0][1],B[1][1])\r\n", "def main():\r\n n = int(input())\r\n wl = {i: [0, 0] for i in range(1, n + 1)}\r\n for i in range(n * (n - 1) // 2 - 1):\r\n xi, yi = map(int, input().split())\r\n wl[xi][0] += 1\r\n if sum(wl[xi]) == n - 1:\r\n del wl[xi]\r\n wl[yi][1] += 1\r\n if sum(wl[yi]) == n - 1:\r\n del wl[yi]\r\n\r\n missing_game = list(wl.keys())\r\n if wl[missing_game[0]][0] >= wl[missing_game[1]][0]:\r\n print(missing_game[0], missing_game[1])\r\n else:\r\n print(missing_game[1], missing_game[0])\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "t = 1\r\nwhile t:\r\n t -= 1\r\n q = int(input())\r\n wp = [0] * (q + 1)\r\n oc = [0] * (q + 1)\r\n for i in range((q * (q - 1) // 2) - 1):\r\n b = list(map(int, input().split()))\r\n oc[b[0]] += 1\r\n oc[b[1]] += 1\r\n wp[b[0]] += 1\r\n arr = []\r\n for i in range(1, len(oc)):\r\n if oc[i] != q - 1:\r\n arr.append(i)\r\n if wp[arr[0]] > wp[arr[1]]:\r\n print(arr[0], arr[1])\r\n else:\r\n print(arr[1], arr[0])\r\n", "n=int(input())\r\ns=set()\r\na=[0]*n\r\ncnt=[0]*n\r\nfor i in range(n*(n-1)//2-1):\r\n x,y=map(int,input().split())\r\n a[x-1]+=1\r\n a[y-1]-=1\r\n cnt[x-1]+=1\r\n cnt[y-1]+=1\r\nr=[]\r\nfor i in range(n):\r\n if cnt[i]==(n-2):\r\n r.append((a[i],i+1))\r\nr.sort()\r\nprint(r[1][1],r[0][1])", "import sys\r\ninput = sys.stdin.readline\r\nfrom collections import Counter\r\n\r\nn = int(input())\r\nd = Counter()\r\nd1 = [0]*(n+1)\r\nfor i in range(n*(n-1)//2 - 1):\r\n a, b = map(int, input().split())\r\n d[a] += 1\r\n d[b] += 1\r\n d1[a] += 1\r\n d1[b] -= 1\r\nd = d.most_common()\r\na = d[-1][0]\r\nb = d[-2][0]\r\nif d1[a] > d1[b]:\r\n print(a, b)\r\nelse:\r\n print(b, a)", "class Node:\r\n def __init__(self, i):\r\n self.index = i\r\n self.gamesplayed = 0\r\n self.p = 0\r\n def __repr__(self):\r\n return \"index: {} --gamesplayed: {} --p: {} \\n\".format(self.index, self.gamesplayed, self.p)\r\n def __str__(self):\r\n return __repr__(self)\r\n\r\nn = int(input())\r\nplayers = [Node(i + 1) for i in range(n)]\r\n\r\ngames = (n * (n - 1)) // 2\r\nfor i in range(games - 1):\r\n x, y = map(lambda t: int(t), input().split())\r\n players[x - 1].gamesplayed += 1\r\n players[y - 1].gamesplayed += 1\r\n players[x - 1].p -= 1\r\n players[y - 1].p += 1\r\n\r\n#print (players)\r\nplayers.sort(key = lambda t: t.p)\r\n#print(games)\r\nx, y = [p.index for p in players if p.gamesplayed < n - 1]\r\n#print (players)\r\n\r\nprint (x, y)", "from functools import reduce\r\nimport os\r\nimport sys\r\nfrom collections import *\r\n#from fractions import *\r\nfrom math import *\r\nfrom bisect import *\r\nfrom heapq import *\r\nfrom io import BytesIO, IOBase\r\ninput = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\r\ndef value(): return tuple(map(int, input().split())) # multiple values\r\ndef arr(): return [int(i) for i in input().split()] # array input\r\ndef sarr(): return [int(i) for i in input()] #array from string\r\ndef starr(): return [str(x) for x in input().split()] #string array\r\ndef inn(): return int(input()) # integer input\r\ndef svalue(): return tuple(map(str, input().split())) #multiple string values\r\ndef parr(): return [(value()) for i in range(n)] # array of pairs\r\nmo = 1000000007\r\n# ----------------------------CODE------------------------------#\r\nn=inn()\r\nto=(n*(n-1))//2\r\nwin=defaultdict(list)\r\nlose=defaultdict(list)\r\nfor i in range(to-1):\r\n x,y=value()\r\n win[x]+=[y]\r\n lose[y]+=[x]\r\nans=[]\r\nfor i in range(1,n+1):\r\n if((len(win[i])+len(lose[i]))!=n-1):\r\n ans+=[i]\r\nwinner=ans[0]\r\nloser=ans[1]\r\nfor i in range(1,n+1):\r\n if(i in win[ans[0]] and i in lose[ans[1]]):\r\n winner=ans[0]\r\n loser=ans[1]\r\n break\r\n if(i in lose[ans[0]] and i in win[ans[1]]):\r\n winner=ans[1]\r\n loser=ans[0]\r\n break\r\nprint(winner,loser)\r\n\r\n\r\n\r\n", "import math,sys;input=sys.stdin.readline;S=lambda:input().rstrip();I=lambda:int(S());M=lambda:map(int,S().split());L=lambda:list(M());mod1=1000000007;mod2=998244353\r\nfrom collections import defaultdict\r\n\r\n\r\nn = I()\r\nm = (n*(n-1))//2 -1\r\npairs = defaultdict(set)\r\ncntSeen = defaultdict(int)\r\nfor i in range(m):\r\n x,y = M()\r\n pairs[x].add(y)\r\n cntSeen[x]+=1\r\n cntSeen[y]+=1\r\n\r\na,b = 0,0\r\n\r\nfor e in cntSeen:\r\n if cntSeen[e]==n-2:\r\n if a==0:\r\n a = e\r\n else:\r\n b =e\r\n \r\n if a!=0 and b!=0:\r\n break\r\n\r\nch_el = 0\r\nflag = 1\r\nfor e in cntSeen:\r\n if cntSeen[e]==n-1:\r\n ch_el = e\r\n if ch_el in pairs[a] and b in pairs[ch_el]:\r\n # a>ch_el>b\r\n print(a,b)\r\n flag=0\r\n break\r\n elif ch_el in pairs[b] and a in pairs[ch_el]:\r\n # b>ch_el>a\r\n print(b,a)\r\n flag = 0\r\n break\r\n\r\nif flag:\r\n print(a,b)\r\n\r\n \r\n\r\n# print(pairs)\r\n# print(a,b)\r\n# print(ch_el)\r\n\r\n\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\nn=I()\r\nx=int((n*(n-1)//2))-1\r\na=[0]*(n+1)\r\nb=[0]*(n+1)\r\nfor i in range(x):\r\n x,y=M()\r\n a[x]+=1;a[y]+=1\r\n b[x]+=1\r\n#print(a,b)\r\nc=[]\r\nfor i in range(1,n+1):\r\n if a[i]==n-2:\r\n c.append(i)\r\n#print(c)\r\nif b[c[0]]==b[c[1]]:print(min(c),max(c))\r\nelif b[c[0]]>b[c[1]]:print(c[0],c[1])\r\nelse:print(c[1],c[0])\r\n \r\n\r\n \r\n \r\n", "from sys import stdin, stdout\r\n\r\nn = int(stdin.readline())\r\nvertices = [[] for i in range(n + 1)]\r\nchallengers = {(i, j) for i in range(1, n + 1) for j in range(i + 1, n + 1)}\r\n\r\nfor i in range(n * (n - 1) // 2 - 1):\r\n a, b = map(int, stdin.readline().split())\r\n vertices[a].append(b)\r\n challengers.discard((a, b))\r\n challengers.discard((b, a))\r\n\r\nfirst, second = list(challengers)[0]\r\nvisit = [0 for i in range(n + 1)]\r\n\r\n\r\ndef dfs(v):\r\n visit[v] = 1\r\n \r\n for u in vertices[v]:\r\n if not visit[u]:\r\n dfs(u)\r\n \r\n \r\ndfs(first)\r\nif visit[second]:\r\n stdout.write(str(first) + ' ' + str(second))\r\nelse:\r\n stdout.write(str(second) + ' ' + str(first))", "n = int(input())\nmatch = []\nplayers = [i for i in range(1, n+1)]\nscore = [0 for i in range(n)]\n\nfor i in range((n*(n-1))//2 - 1):\n match.append(list(map(int, input().split())))\n score[match[i][0] - 1] += 1\n score[match[i][1] - 1] -= 1\n\nfor i in range(n-1):\n for j in range(i+1, n):\n if score[i] < score[j]:\n score[i], score[j] = score[j], score[i]\n players[i], players[j] = players[j], players[i]\n\nready = False\nfor i in range(1, n):\n for j in range(i+1, n+1):\n if not ([i, j] in match) and not ([j, i] in match):\n if players.index(i) < players.index(j):\n print(i, j)\n else:\n print(j, i)\n ready = True\n break\n if ready:\n break\n", "n = int(input())\r\ns = (n * (n + 1)) // 2\r\ntour = [i for i in range(1, n+1)]\r\nwon_vs = [[] for i in range(n)]\r\nvisited = []\r\n\r\nfor _ in range(((n * (n-1)) // 2) - 1):\r\n w, l = list(map(int, input().split()))\r\n tour[w-1] += l\r\n tour[l-1] += w\r\n \r\n won_vs[w-1].append(l)\r\n\r\ndef dfs(n, vs):\r\n ret = False\r\n if n in visited:\r\n return False\r\n visited.append(n)\r\n if len(won_vs[n-1]) == 0:\r\n return False\r\n if vs in won_vs[n-1]:\r\n return True\r\n \r\n for e in won_vs[n-1]:\r\n ret |= dfs(e, vs)\r\n return ret\r\n\r\ndiffs = [s - tour[i] for i in range(n)]\r\nnon_zero = list(filter((lambda x: x != 0), diffs))\r\nif dfs(non_zero[0], non_zero[1]):\r\n print(f\"{non_zero[0]} {non_zero[1]}\")\r\nelse:\r\n print(f\"{non_zero[1]} {non_zero[0]}\")\r\n", "people = int(input())\r\n\r\nrecords = []\r\n\r\nfor match in range(int((people * (people - 1))/ 2) - 1):\r\n p1, p2 = input().split(' ')\r\n records.append([int(p1), int(p2)])\r\n \r\n\r\n \r\ndef sleep(matches):\r\n doods = []\r\n for x in matches:\r\n doods += x\r\n\r\n \r\n doods = list(set(doods))\r\n\r\n\r\n \r\n def missing(l):\r\n\r\n def inmatch(M, history):\r\n personal = []\r\n for x in history:\r\n if M in x:\r\n personal.append(x)\r\n \r\n return len(personal)\r\n\r\n \r\n\r\n count = inmatch(l, matches)\r\n\r\n if count == (len(doods) - 1):\r\n return 0\r\n else:\r\n \r\n return l\r\n \r\n\r\n \r\n \r\n \r\n\r\n for x in doods:\r\n if missing(x) != 0:\r\n found1 = x\r\n break\r\n\r\n\r\n\r\n \r\n for y in doods:\r\n if missing(y) == found1:\r\n continue\r\n elif missing(y) != 0:\r\n found2 = y\r\n break\r\n\r\n\r\n w1ns = len(list(filter(lambda x: x[0] == found1, matches)))\r\n w2ns = len(list(filter(lambda x: x[0] == found2, matches)))\r\n\r\n if w1ns > w2ns:\r\n print(found1, found2, sep=' ')\r\n else:\r\n print(found2, found1, sep=' ')\r\n\r\nsleep(records)", "# -*- coding: utf-8 -*-\n\"\"\"Untitled65.ipynb\n\nAutomatically generated by Colaboratory.\n\nOriginal file is located at\n https://colab.research.google.com/drive/1kH9gF2Sz0uEW-8MC5Exb7nZuB4f5BTlb\n\"\"\"\n\nn=int(input())\nl1=[]\nl4=[]\nc=int(((n*(n-1))/2)-1)\nfor i in range(0,c):\n l2=list(map(int,input().split()))\n l1.append(l2[0])\n l4.append(l2[1])\nd1={}\nd2={}\nfor x in range(1,n+1):\n d1[x]=0\nfor x in range(1,n+1):\n d2[x]=0\nfor x in l1:\n d1[x]=d1[x]+1\nfor x in l4:\n d2[x]=d2[x]+1\nl3=[]\nc=0\nfor x in d1:\n if c==2:\n break\n else:\n if d1[x]+d2[x]==n-2:\n l3.append(x)\n c=c+1\nif d1[l3[0]]>d1[l3[1]]:\n print(str(l3[0])+\" \"+str(l3[1]))\nelse:\n print(str(l3[1])+\" \"+str(l3[0]))", "n=int(input())\r\nq=n\r\nx=(n**2-n)//2-1\r\nl=[]\r\nd=[0]*(n+1)\r\nd1=[0]*(n+1)\r\nfor i in range(x):\r\n n,m=map(int,input().split())\r\n d[n]+=1\r\n d1[n]+=1\r\n d1[m]+=1\r\n\r\ny=n-1\r\nz=[]\r\nfor i in range(q+1):\r\n \r\n if d1[i]==q-2:\r\n z.append(i)\r\n\r\na,b=z[0],z[1]\r\nd[a]+=1\r\nd.pop(0)\r\nif len(set(d))==q:\r\n print(a,b)\r\nelse:\r\n print(b,a)", "x=int(input())\r\nlis=[0]*x\r\nlisa=[0]*x\r\ny=(x*(x-1))//2-1\r\nfor i in range(y):\r\n j,k=map(int, input().split())\r\n lis[j-1]+=1\r\n lisa[j-1]+=1\r\n lisa[k-1]+=1\r\nk=min(lisa)\r\nl=lisa.index(k)\r\nlisa.remove(k)\r\nk=lisa.index(k)+1\r\nif(lis[k]>lis[l]):\r\n print(k+1,l+1)\r\nelse:\r\n print(l+1,k+1)", "# _\r\n#####################################################################################################################\r\n\r\ndef missingRecord(nParticipants, currRecord):\r\n storage = {str(participant): [0, set()] for participant in range(1, nParticipants+1)}\r\n for record in currRecord:\r\n storage[record[0]][0] += 1\r\n storage[record[0]][1].add(record[1])\r\n\r\n sortedParticipants = sorted(storage.keys(), key=lambda x: storage[x][0], reverse=True)\r\n for i in range(nParticipants):\r\n if storage[sortedParticipants[i]][0] == storage[sortedParticipants[i+1]][0]:\r\n if sortedParticipants[i] in storage[sortedParticipants[i+1]][1]:\r\n storage[sortedParticipants[i+1]][1].remove(sortedParticipants[i])\r\n missingLoser, = storage[sortedParticipants[i]][1].difference(storage[sortedParticipants[i+1]][1])\r\n return f'{sortedParticipants[i+1]} {missingLoser}'\r\n elif sortedParticipants[i+1] in storage[sortedParticipants[i]][1]:\r\n storage[sortedParticipants[i]][1].remove(sortedParticipants[i+1])\r\n missingLoser, = storage[sortedParticipants[i+1]][1].difference(storage[sortedParticipants[i]][1])\r\n return f'{sortedParticipants[i]} {missingLoser}'\r\n return f'{sortedParticipants[i]} {sortedParticipants[i+1]}'\r\n\r\n\r\ndef main():\r\n nParticipants = int(input())\r\n print(missingRecord(nParticipants, (input().split() for x in range(nParticipants*(nParticipants-1)//2-1))))\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "from collections import defaultdict\r\n\r\nn = int(input())\r\n\r\nnum_list = defaultdict(int)\r\nwin = []\r\n\r\nfor i in range(n * (n - 1) // 2 - 1):\r\n x, y = map(int, input().split())\r\n num_list[x] += 1\r\n num_list[y] += 1\r\n win.append((x, y))\r\n\r\nans = []\r\nfor i in num_list.keys():\r\n if num_list[i] != n - 1:\r\n ans.append(i)\r\n\r\na = b = 0\r\n\r\nfor i in win:\r\n if ans[0] == i[0]:\r\n a += 1\r\n elif ans[1] == i[0]:\r\n b += 1\r\n\r\nif a > b:\r\n print(*ans)\r\nelse:\r\n print(ans[1], ans[0])\r\n\r\n", "# from math import gcd\r\n# from queue import Queue\r\n# from collections import deque\r\n# from collections import Counter\r\n# for _ in range(int(input())):\r\n# n=int(input())\r\n# l=list(map(int,input().split()))\r\nn=int(input())\r\nd={}\r\nfor i in range(n):\r\n d[i+1]=[0,0,0]#(w,l,s)\r\n# print(d)\r\nfor _ in range(int((n-1)*n/2)-1):\r\n x,y=map(int,input().split())\r\n d[x][0]+=1\r\n d[x][2]+=1\r\n d[y][1]+=1\r\n d[y][2]+=1\r\n# print(d)\r\nans=[]\r\nfor j in range(n):\r\n if d[j+1][2]!=n-1:\r\n ans.append(j+1)\r\nif d[ans[0]][0]>d[ans[1]][0]:\r\n x1=ans[0]\r\n y1=ans[1]\r\nelse:\r\n x1=ans[1]\r\n y1=ans[0]\r\nprint(x1,y1)\r\n\r\n\r\n \r\n\r\n\r\n\r\n ", "testcases = int(input())\r\nn = testcases\r\nimport sys\r\ndef get_ints(): return list(map(int, sys.stdin.readline().strip().split()))\r\n\r\nwinner = [[] for _ in range(n)]\r\nlosser = [[] for _ in range(n)]\r\ndicts = {}\r\ntt = ((n * (n - 1)) // 2 )- 1\r\nfor testcase in range(tt):\r\n arr = get_ints()\r\n ww = arr[0] - 1 \r\n ll = arr[1] - 1 \r\n winner[ww].append(ll)\r\n losser[ll].append(ww)\r\n if ww not in dicts:\r\n dicts[ww] = 1 \r\n else:\r\n dicts[ww] += 1 \r\n if ll not in dicts:\r\n dicts[ll] = 1 \r\n else:\r\n dicts[ll] += 1 \r\n # print(arr)\r\n # print(dicts)\r\nfor i in range(n):\r\n if i not in dicts:\r\n dicts[i] = 0 \r\n \r\nmissarr = []\r\nmins = 939393939\r\nfor key ,value in dicts.items():\r\n if value < mins:\r\n mins = value\r\nfor key ,value in dicts.items():\r\n if value == mins:\r\n missarr.append(key)\r\n# print(dicts)\r\n# print(missarr)\r\nfirst = missarr[0]\r\nsec = missarr[1]\r\n\r\nfirstwinner = {}\r\nfirstloser = {}\r\nsecwinner = {}\r\nsecloser = {}\r\nfor i in winner[first]:\r\n firstwinner[i] = 1 \r\nfor i in losser[first]:\r\n firstloser[i] =1 \r\nfor i in winner[sec]:\r\n secwinner[i] = 1 \r\nfor i in losser[sec]:\r\n secloser[i] = 1 \r\nflag = 0 \r\nif len(firstloser) == 0 :\r\n print(str(first + 1) + \" \" + str(sec + 1))\r\n flag = 1 \r\nelif len(secloser) == 0 :\r\n print(str(sec + 1) + \" \" + str(first + 1))\r\n flag = 1 \r\nif flag == 0 :\r\n flag2 = 0 \r\n for key ,value in firstwinner.items():\r\n if key in secloser:\r\n flag2 = 1 \r\n break \r\n if flag2 == 1 :\r\n print(str(first + 1) + \" \" + str(sec + 1))\r\n else:\r\n print(str(sec + 1) + \" \" + str(first + 1))\r\n \r\n \r\n \r\n \r\n\r\n ", "n = int(input())\r\n\r\na = [0 for i in range(0,n+1)]\r\np = [0 for i in range(0,n+1)]\r\nt = (n*(n-1)//2)-1\r\n\r\nwhile(t>0):\r\n\tt -= 1\r\n\ts = input().split()\r\n\ts = [int(i) for i in s]\r\n\ta[s[0]] += 1\r\n\ta[s[1]] += 1\r\n\tp[s[0]] += 1\r\n\r\nres = []\r\n#print(a)\r\nfor i in range(1,n+1):\r\n\tif(a[i] != n-1 and len(res)<2):\r\n\t\tres.append(i)\r\n\t\t\r\n\r\nif(p[res[0]] < p[res[1]]):\r\n\tprint(res[1],res[0])\r\nelse:\r\n\tprint(res[0],res[1])\r\n", "from sys import stdin\r\ninput = stdin.readline\r\n\r\nn = int(input())\r\ng = [n - 1] * n\r\na = [[int(x) for x in input().split()] for _ in range((n * (n-1)) // 2 - 1)]\r\nfor i in a:\r\n for j in i:\r\n g[j-1] -= 1\r\n \r\np = []\r\nfor i in range(n):\r\n if g[i] > 0:\r\n p.append(i+1)\r\n \r\nx, y = p\r\nr = 0\r\ns = 0\r\nfor i, _ in a:\r\n r += (i == x)\r\n s += (i == y)\r\n\r\nif r >= s:\r\n print(x, y)\r\nelse:\r\n print(y, x)", "# Author: S Mahesh Raju\r\n# Username: maheshraju2020\r\n# Date: 11/08/2020\r\n\r\nfrom sys import stdin, stdout, setrecursionlimit\r\nfrom math import gcd, ceil, sqrt\r\nfrom collections import Counter, deque\r\nfrom bisect import bisect_left, bisect_right\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\nposs = set()\r\nfor i in range(1, n + 1):\r\n for j in range(i + 1, n + 1):\r\n poss.add((i, j))\r\n\r\ncount = n * (n - 1) // 2 - 1\r\nwin = {}\r\nlose = {}\r\nfor i in range(count):\r\n a, b = iia()\r\n poss.remove(tuple(sorted([a, b])))\r\n win.setdefault(a, []).append(b)\r\n lose.setdefault(b, []).append(a)\r\n\r\na,b = poss.pop()\r\nif len(set(win.get(a, [])) & set(lose.get(b, []))):\r\n print(a, b)\r\nelse:\r\n print(b, a)\r\n\r\n\r\n", "n = int(input())\r\nm = (n * (n - 1)) // 2\r\np = [[] for i in range(n + 1)]\r\nt = [0] * (n + 1)\r\nfor i in range(m - 1):\r\n a, b = map(int, input().split())\r\n p[a].append(b)\r\n t[a] += 1\r\n t[b] += 1\r\nx = 1 + t[1: ].index(n - 2)\r\ny = x + 1 + t[x + 1: ].index(n - 2)\r\nt = [True] * (n + 1)\r\nr = p[x]\r\nwhile r:\r\n j = r.pop()\r\n for i in p[j]:\r\n if i == y:\r\n r = True\r\n break\r\n if t[i]:\r\n r.append(i)\r\n t[i] = False\r\n if r == True: break\r\nif r: print(x, y)\r\nelse: print(y, x)", "#!/usr/bin/env python3\r\n\r\nn = int(input())\r\n\r\n# Read inputs\r\ngames_played = [0 for i in range(n+1)]\r\nresults = []\r\nfor i in range(n*(n-1)//2 - 1):\r\n (winner,loser) = map(int,input().split())\r\n results.append((winner, loser))\r\n games_played[winner] += 1\r\n games_played[loser] += 1\r\n\r\n# Determine which players didn't play a game\r\nplayer_a = games_played.index(n-2, 1)\r\nplayer_b = games_played.index(n-2, player_a+1)\r\n\r\n# Check how player a and b stack up to the others\r\nworse_than_a = set(b for (a,b) in results if a == player_a)\r\nbetter_than_b = set(a for (a,b) in results if b == player_b)\r\n\r\nif (len(worse_than_a.intersection(better_than_b)) > 0):\r\n # There are players worse than a, but better than b, so a must be better than b\r\n print(\"%d %d\" % (player_a,player_b))\r\nelse:\r\n print(\"%d %d\" % (player_b,player_a))\r\n", "n = int(input())\r\nx = (n*(n-1)) // 2 - 1\r\narr = {}\r\narr2 = {}\r\narr3 = []\r\nfor _ in range(x):\r\n a, b = map(int, input().split())\r\n if a in arr:\r\n arr[a].append(b)\r\n else:\r\n arr[a] = [b]\r\n if a in arr2:\r\n arr2[a].append(b)\r\n else:\r\n arr2[a] = [b]\r\n if b in arr2:\r\n arr2[b].append(a)\r\n else:\r\n arr2[b] = [a]\r\n#print(arr)\r\n#print(arr2)\r\ncount = 0\r\nfor k in arr2:\r\n if len(arr2[k]) == n - 2:\r\n arr3.append(k)\r\n count += 1\r\n if count == 2:\r\n break\r\nu, v = arr3\r\nif u in arr and v in arr:\r\n if len(arr[u]) > len(arr[v]):\r\n print(u, v)\r\n else:\r\n print(v, u)\r\nelse:\r\n if u in arr:\r\n print(u, v)\r\n else:\r\n print(v, u)", "n = int(input())\r\nl = []\r\nj = []\r\nc = []\r\nfor _ in range(int(n*(n-1)/2-1)):\r\n a = [*map(int,input().split())]\r\n l.append(a[0])\r\n l.append(a[1])\r\nfor i in range(n):\r\n if l.count(i+1) < n-1:\r\n j.append(i+1)\r\n if len(j) == 2:\r\n break\r\nfor i in range(0,n*(n-1)-2,2):\r\n if l[i] == j[1]:\r\n c.append(l[i+1])\r\nfor i in range(1,n*(n-1)-2,2):\r\n if l[i] == j[0]:\r\n c.append(l[i-1])\r\nfor i in c:\r\n if c.count(i) == 2:\r\n j = [j[1], j[0]]\r\n break\r\nfor i in j:\r\n print(i,end = \" \")", "\r\nn = int(input())\r\ne = [[0]*(n+1) for i in range(n+1)]\r\ndeg = [0]*(n+1)\r\n\r\nfor i in range(((n*(n-1))>>1)-1):\r\n a, b = map(int, input().split())\r\n e[max(a, b)][min(a, b)] = 1\r\n deg[a] += 1\r\n \r\nres = 0\r\nfor i in range(1, n+1):\r\n for j in range(1, i):\r\n if not e[i][j]:\r\n if deg[i] > deg[j]:\r\n print('{} {}'.format(i, j))\r\n break\r\n else:\r\n print('{} {}'.format(j, i))\r\n break", "n = int(input())\r\nwins = [0] * n;\r\nloss = [0] * n;\r\nfor i in range(n*(n-1)//2-1):\r\n a, b = [int(x) for x in input().split()]\r\n wins[a-1]+=1\r\n loss[b-1]+=1\r\n# find the missing pair\r\nmiss = []\r\nfor i in range(n):\r\n if wins[i] + loss[i] < n-1:\r\n miss.append(i)\r\n# check who is winning\r\ncnt = wins[miss[0]]-loss[miss[0]] - (wins[miss[1]]-loss[miss[1]])\r\nif cnt >= 0:\r\n print(miss[0]+1, miss[1]+1)\r\nelse:\r\n print(miss[1]+1, miss[0]+1)", "n = int(input())\r\nindeg = [0 for i in range(n+1)]\r\noutdg = [0 for i in range(n+1)]\r\nt = n*(n-1)//2-1\r\nfor _ in range(t):\r\n a, b = map(int, input().split())\r\n indeg[a] += 1\r\n indeg[b] += 1\r\n outdg[a] += 1\r\nx, y = -1, -1\r\nfor i in range(n):\r\n if indeg[i+1] != n-1:\r\n if x==-1:\r\n x = i+1\r\n else:\r\n y = i+1\r\nif outdg[x] >= outdg[y]:\r\n print (x, y)\r\nelse:\r\n print (y, x)\r\n", "import sys\r\nfrom array import array # noqa: F401\r\n\r\n\r\ndef input():\r\n return sys.stdin.buffer.readline().decode('utf-8')\r\n\r\n\r\nn = int(input())\r\ncnt = [0] * n\r\nindeg = [0] * n\r\nadj = [[] for _ in range(n)]\r\nm = n * (n - 1) // 2 - 1\r\n\r\nfor u, v in (map(int, input().split()) for _ in range(m)):\r\n adj[v - 1].append(u - 1)\r\n cnt[u - 1] += 1\r\n cnt[v - 1] += 1\r\n indeg[u - 1] += 1\r\n\r\nx = []\r\nfor i in range(n):\r\n if cnt[i] == n - 2:\r\n x.append(i)\r\n\r\n\r\ndef solve(win, lose):\r\n adj[lose].append(win)\r\n deg = indeg[:]\r\n deg[win] += 1\r\n stack = [i for i in range(n) if deg[i] == 0]\r\n\r\n while stack:\r\n v = stack.pop()\r\n\r\n for dest in adj[v]:\r\n if deg[dest] == 0:\r\n continue\r\n deg[dest] -= 1\r\n if deg[dest] == 0:\r\n stack.append(dest)\r\n\r\n adj[lose].remove(win)\r\n return not any(deg)\r\n\r\n\r\nif solve(x[0], x[1]):\r\n print(x[0] + 1, x[1] + 1)\r\nelse:\r\n print(x[1] + 1, x[0] + 1)\r\n", "from collections import defaultdict as D\r\nn = int(input())\r\nt = n * (n - 1) // 2\r\nd = D(int)\r\nxy = []\r\nfor i in range(t - 1):\r\n\tx, y = map(int,input().split())\r\n\td[x]+= 1\r\n\td[y]+= 1\r\n\txy.append( (x,y) )\r\nres = []\r\nfor i in d.keys():\r\n\tif d[i] != n - 1:\r\n\t\tres.append(i)\r\n \r\nScoreA = ScoreB = 0\r\nfor i, j in xy:\r\n\tif res[0] == i:\r\n\t\tScoreA+= 3\r\n\tif res[1] == i:\r\n\t\tScoreB+= 3\r\n \r\nif ScoreA >= ScoreB:\r\n\tprint(res[0],res[1])\r\nelse:\r\n\tprint(res[1],res[0])", "n=int(input())\r\ngames=(n*(n-1))//2\r\nwins=[0 for i in range(n+1)]\r\ngcount=[0 for i in range(n+1)]\r\nfor i in range(games-1):\r\n a=list(map(int,input().split(' ')))\r\n wins[a[0]]+=1\r\n gcount[a[0]]+=1\r\n gcount[a[1]]+=1\r\n\r\nrem=[]\r\nfor i in range(1,n+1):\r\n if(gcount[i]<(n-1)):\r\n rem.append(i)\r\nt1=wins[rem[0]]\r\nt2=wins[rem[1]]\r\nc1=0\r\nc2=0\r\nfor i in range(1,n+1):\r\n if(wins[i]==t1):\r\n c1+=1\r\n if(wins[i]==t2):\r\n c2+=1\r\nif(c1==1):\r\n print(rem[1],end=\" \")\r\n print(rem[0])\r\nelse:\r\n print(rem[0],end=\" \")\r\n print(rem[1])\r\n", "n = int(input())\r\na = [0] * (n + 1)\r\nbm = []\r\nfor i in range(n + 1) :\r\n bm.append(['-', '-'])\r\nb = []\r\nfor _ in range((n * (n-1) // 2) - 1):\r\n x, y = map(int, input().split())\r\n b.append([x, y])\r\n a[x] += 1\r\n a[y] += 1\r\nx, y = -1, -1\r\nfor i in range(len(a)):\r\n if a[i] == n - 2:\r\n if x != -1:\r\n y = i\r\n else:\r\n x = i\r\nfor i in range(len(b)):\r\n # print(b[i])\r\n if b[i][0] == x:\r\n bm[b[i][1]][0] = '<'\r\n if b[i][1] == x:\r\n bm[b[i][0]][0] = '>'\r\n if b[i][0] == y:\r\n bm[b[i][1]][1] = '<'\r\n if b[i][1] == y:\r\n bm[b[i][0]][1] = '>'\r\nfor i in range(len(bm)):\r\n if bm[i][0] != bm[i][1]:\r\n if bm[i][0] == '>':\r\n print(y, x)\r\n exit()\r\n else:\r\n print(x, y)\r\n exit()\r\nprint(x, y)", "n=int(input())\r\na=[0]*(n+1)\r\nb=a[:]\r\nc=[]\r\nfor _ in range(n*(n-1)//2-1):\r\n x,y=map(int,input().split())\r\n a[x]+=1\r\n b[y]+=1\r\nfor i in range(1,n+1):\r\n if a[i]+b[i] != n-1:\r\n c.append(i)\r\nif a[c[0]]>a[c[1]]:\r\n print(c[0],c[1])\r\nelse:\r\n print(c[1],c[0])", "n = int(input())\r\na = [[] for i in range(n + 1)]\r\nb = [ 0 for i in range(n + 1)]\r\nfor i in range(1, (n * (n - 1)) // 2):\r\n x, y = map(int, input().split())\r\n a[x].append(y)\r\n b[x] += 1\r\n b[y] += 1\r\nx = 0\r\ny = 0\r\nfor i in range(n + 1):\r\n if b[i] == n - 2:\r\n if x == 0:\r\n x = i\r\n else:\r\n y = i\r\nb = False\r\nfor i in a[x]:\r\n for j in a[i]:\r\n if j == y:\r\n b = True\r\nif b:\r\n print(x, y)\r\nelse:\r\n print(y, x)\r\n", "from collections import defaultdict\r\nn = int(input())\r\nwins = defaultdict(int)\r\n#loses = defaultdict(int)\r\ntotal = defaultdict(int)\r\nfor i in range(n*(n-1)//2-1):\r\n x,y = [int(x) for x in str(input()).split()]\r\n wins[x]+=1\r\n #loses[y]+=1\r\n total[y]+=1\r\n total[x]+=1\r\n\r\nfor k,v in total.items():\r\n if v<n-1:\r\n a = k\r\n total[a]+=1\r\n break\r\n\r\nfor k,v in total.items():\r\n if v<n-1:\r\n b = k\r\n total[b]+=1\r\nif wins[a]>wins[b]:\r\n print(a,b)\r\nelse:\r\n print(b,a)\r\n", "from sys import stdin\r\nfrom collections import defaultdict, deque\r\n\r\ngraph = defaultdict(set)\r\n\r\n\r\nn = int(input())\r\np = [n - 1] * (n + 1)\r\nfor lin in stdin:\r\n x, y = map(int, lin.split())\r\n graph[x].add(y)\r\n p[x] -= 1\r\n p[y] -= 1\r\n \r\nx, y = [i for i in range(1, n + 1) if p[i]]\r\n\r\nqueue = deque([x])\r\nvisited = [0] * (n + 1)\r\nvisited[x] = 1\r\nans = (y, x)\r\nwhile queue:\r\n q = queue.popleft()\r\n if q == y:\r\n ans = (x, y)\r\n break\r\n for nbr in graph[q]:\r\n if not visited[nbr]:\r\n visited[nbr] = 1\r\n queue.append(nbr)\r\nprint(*ans)", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\ns = set()\r\ncx, cy = [0] * (n + 1), [0] * (n + 1)\r\nfor _ in range(n * (n - 1) // 2 - 1):\r\n x, y = map(int, input().split())\r\n cx[x] += 1\r\n cy[y] += 1\r\n s.add((x, y))\r\nfor i in range(1, n + 1):\r\n for j in range(i + 1, n + 1):\r\n if cx[i] == cx[j]:\r\n u = [i, j]\r\nfor i in range(1, n + 1):\r\n for j in range(i + 1, n + 1):\r\n if cy[i] == cy[j]:\r\n v = [i, j]\r\nfor i in u:\r\n for j in v:\r\n if i ^ j and not (i, j) in s and not (j, i) in s:\r\n ans = [i, j]\r\nprint(*ans)", "n = int(input())\ninput_arr = []\nnum_dict = {}\nwinners = []\nlosers = []\nfor i in range(int(n * (n - 1) / 2 - 1)):\n\ta, b = tuple([int(x) for x in input().split()])\n\tinput_arr.append([a, b])\n\tnum_dict[a] = num_dict.get(a, 0) + 1\n\tnum_dict[b] = num_dict.get(b, 0) + 1\n\twinners.append(a)\n\tlosers.append(b)\nto_output = []\nfor k, v in num_dict.items():\n\tif(v != n - 1):\n\t\tto_output.append(k)\nif(winners.count(to_output[0]) >= winners.count(to_output[1])):\n\tprint(\"%d %d\"%(to_output[0], to_output[1]))\nelse:\n\tprint(\"%d %d\"%(to_output[1], to_output[0]))\n", "from collections import Counter\r\nn = int(input())\r\nmatches = n-1\r\nt = ((n*(n-1))//2)-1\r\nl,l1=[],[]\r\nfor _ in range(t):\r\n temp=list(map(int,input().split()))\r\n l.append(temp)\r\n l1.extend(temp)\r\nd = Counter(l1)\r\nd = d.most_common()\r\nle = d[-1]\r\nle = le[0]\r\nl2e = d[-2]\r\nl2e = l2e[0]\r\noddle = 0\r\noddl2e = 0\r\nfor i in range(0,len(l1),2):\r\n if(l1[i]==le):\r\n oddle+=1\r\n if(l1[i]==l2e):\r\n oddl2e+=1\r\nif(oddle>oddl2e):\r\n print(le,l2e)\r\nelse:\r\n print(l2e,le)", "from collections import defaultdict, Counter\r\n\r\nn = int(input())\r\nsz = n*(n-1) // 2 - 1\r\ncounts = defaultdict(int)\r\nwinnings = defaultdict(dict)\r\n\r\nfor i in range(sz):\r\n w, l = map(int, input().split())\r\n winnings[w][l] = 1\r\n counts[w]+=1\r\n counts[l]+=1\r\n\r\npair1 = pair2 = 0\r\nfor key in counts:\r\n if counts[key] == n-2:\r\n if not pair1:\r\n pair1 = key\r\n else:\r\n pair2 = key\r\n break\r\n\r\nfor key in winnings[pair1]:\r\n if pair2 in winnings[key]:\r\n print(pair1, pair2)\r\n break\r\nelse:\r\n print(pair2, pair1)\r\n\r\n", "n = int(input())\r\nl = []\r\narr = []\r\nfor i in range(51) :\r\n arr.append(0)\r\nfor i in range((n*(n-1))//2-1) :\r\n l1 = list(map(int,input().split()))\r\n arr[l1[0]] += 1\r\n arr[l1[1]] += 1\r\n l.append(l1)\r\nl1 = []\r\nfor i in range(1,n+1):\r\n if arr[i] < n-1 :\r\n l1.append(i)\r\nl2 = []\r\nfor i in range((n*(n-1))//2-1) :\r\n if l[i][0] == l1[-1] :\r\n l2.append(l[i][1])\r\nfor i in range((n*(n-1))//2-1) :\r\n if (l[i][0] in l2) and l[i][1] == l1[0] :\r\n print(l1[1],l1[0])\r\n break\r\nelse :\r\n print(l1[0],l1[1])", "n=int(input());win=list();lose=list();final=list()\r\nfor _ in range(int(n*(n-1)/2)-1):\r\n w,l=map(int,input().split())\r\n win.append(w);lose.append(l);\r\nfor i in range(1,n+1):\r\n if(win.count(i)+lose.count(i)<n-1):\r\n final.append(i)\r\nif(win.count(final[0])>=win.count(final[1])):print(final[0],final[1])\r\nif(win.count(final[0])<win.count(final[1])):print(final[1],final[0])", "############ ---- Input Functions and Setup ---- ############\r\nimport sys\r\nimport math\r\nfrom collections import Counter, defaultdict, deque\r\nfrom functools import cmp_to_key\r\n\r\ndef inp(): # int input\r\n return(int(input()))\r\ndef inlt(): # int list input\r\n return(list(map(int,input().split())))\r\ndef insr(): # string input -> char list\r\n s = input()\r\n return(list(s[:len(s)]))\r\ndef invr(): # a b c input\r\n return(map(int,input().split()))\r\n####################################################\r\nn=inp()\r\nlines=n*(n-1)//2 -1\r\nplay=[0]*(n+1)\r\nwon=[0]*(n+1)\r\nfor _ in range(lines):\r\n x,y = invr()\r\n play[x]+=1\r\n play[y]+=1\r\n won[x]+=1\r\nx=0\r\ny=0\r\nfor i in range(n+1):\r\n if play[i]==n-2:\r\n if x==0:x=i\r\n else:\r\n y=i\r\n break\r\nif won[y]>won[x]:\r\n x,y=y,x\r\nprint(f\"{x} {y}\")\r\n\r\n\r\n\r\n\r\n\r\n\r\n " ]

[ "n,k=map(int,input().split())\r\ns=input()\r\nfor j in range(ord('a'), ord('z') + 1):\r\n i=len(s)\r\n s=s.replace(chr(j), \"\",k)\r\n j=len(s)\r\n k-=(i-j)\r\n if k==0:\r\n break\r\n\r\nprint(s)", "n, k = map(int, input().split())\r\ns=[*input()]\r\na = sorted([(x, y) for y, x in enumerate(s)])\r\nfor i in range(k):\r\n s[a[i][1]] = \"\"\r\nprint(\"\".join(s))", "nk=input()\r\nstr1=input()\r\nnk1=nk.split()\r\nn=nk1[0]\r\nk=int(nk1[1])\r\nocc={}\r\ni=0\r\nwhile i<26:\r\n occ[chr(i+97)]=0\r\n i=i+1\r\ni=0\r\nstr2=list(str1)\r\nwhile i<len(str1):\r\n occ[str1[i]]=occ[str1[i]]+1\r\n i=i+1\r\nsum1=0\r\nlist1=[]\r\nlist2=[]\r\nindic=[]\r\ni=0\r\nwhile sum1<k:\r\n list1.append(chr(97+i))\r\n sum1=sum1+occ[chr(i+97)]\r\n i=i+1\r\nif sum1!=k:\r\n a=list1.pop()\r\n list2.append(a)\r\n list2.append(sum1-k)\r\ni=0\r\nwhile i<len(str2):\r\n if str2[i] in list1:\r\n indic.append(0)\r\n else:\r\n indic.append(1)\r\n i=i+1\r\ni=0\r\nif list2!=[]:\r\n count=list2[1]\r\n count1=occ[list2[0]]\r\n while i<len(str2) and count<count1:\r\n if str2[i]==list2[0]:\r\n indic[i]=0\r\n count1=count1-1\r\n i=i+1\r\nstr3=[]\r\ni=0\r\nwhile i<len(str2):\r\n if indic[i]==1:\r\n str3.append(str2[i])\r\n i=i+1\r\nstr4=\"\".join(str3)\r\nprint(str4)", "a,b = map(int,input().split())\r\nstring = input()\r\nfor x in range(b):\r\n string = string.replace(min(string),\"\",b-a+len(string))\r\n if a-len(string)==b:\r\n break\r\nprint(string)", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn, k = map(int, input().split())\r\ns = input()[:-1]\r\nx = 97\r\nwhile k > 0:\r\n a = s.count(chr(x))\r\n s = s.replace(chr(x),'',min(a,k))\r\n k -= min(a,k)\r\n x += 1\r\nprint(s)", "number_of_testcases = 1 #int(input())\r\n\r\nfor _ in range(number_of_testcases):\r\n len_of_given_str, num_of_letters_to_be_removed = map(int, input().split())\r\n given_str = input()\r\n \r\n freq_of_alpha = [0 for i in range(26)]\r\n \r\n for char in given_str:\r\n freq_of_alpha[ord(char)-97] += 1 \r\n \r\n #print(freq_of_alpha)\r\n \r\n for i in range(26):\r\n if freq_of_alpha[i] >= num_of_letters_to_be_removed:\r\n freq_of_alpha[i] -= num_of_letters_to_be_removed \r\n break\r\n \r\n else:\r\n num_of_letters_to_be_removed -= freq_of_alpha[i]\r\n freq_of_alpha[i] = 0 \r\n \r\n #print(freq_of_alpha)\r\n resulting_str = []\r\n \r\n for char in range(len_of_given_str-1, -1, -1):\r\n char = given_str[char]\r\n if freq_of_alpha[ord(char) - 97]:\r\n resulting_str.append(char)\r\n freq_of_alpha[ord(char) - 97] -= 1 \r\n \r\n #print(freq_of_alpha)\r\n # print(resulting_str)\r\n \r\n resulting_str.reverse()\r\n print(\"\".join(resulting_str))", "from collections import Counter, defaultdict\r\n\r\n\r\nn, k = map(int, input().split())\r\n\r\nstr_ = input()\r\n\r\nfreq = Counter(str_)\r\n\r\nfreq_count = defaultdict(int)\r\n\r\nfor cur_idx in range(26):\r\n if freq[chr(cur_idx + 97)] < k:\r\n freq_count[chr(cur_idx + 97)] = freq[chr(cur_idx + 97)]\r\n k -= freq[chr(cur_idx + 97)]\r\n \r\n else:\r\n freq_count[chr(cur_idx + 97)] = k\r\n break\r\n\r\nans = []\r\nfor char in str_:\r\n if char in freq_count and freq_count[char] > 0:\r\n freq_count[char] -= 1\r\n continue\r\n \r\n ans.append(char)\r\n \r\n\r\nprint(\"\".join(ans))", "n, k = map(int, input().split())\r\nprint(''.join(x[0] for x in\r\nsorted(sorted(zip(input(),range(n)))[k:], key=lambda x:x[1])))", "# https://codeforces.com/contest/999\n\nimport sys\n\ninput = lambda: sys.stdin.readline().rstrip() # faster!\n\n\ndef chr2idx(c):\n return ord(c) - 97\n\n\nn, k = map(int, input().split())\ns = input()\n\ncnt = [0] * 26\nfor c in s:\n cnt[chr2idx(c)] += 1\n\nremove = [0] * 26\nfor i in range(26):\n remove[i] = min(k, cnt[i])\n k -= remove[i]\n\nans = []\nfor c in s:\n i = chr2idx(c)\n if remove[i]:\n remove[i] -= 1\n else:\n ans += [c]\nprint(\"\".join(ans))\n", "import sys\r\nsc = sys.stdin.readline\r\nn,x=map(int,sc().rstrip().split())\r\ns=str(sc())\r\na,o='a',0\r\nwhile o<=26:\r\n if s.count(chr(ord(a)+ o))>=x:\r\n s=s.replace(chr(ord(a) + o), '',x)\r\n break\r\n else:\r\n x-=s.count(chr(ord(a) + o))\r\n s= s.replace(chr(ord(a) + o), '')\r\n o+=1 \r\nsys.stdout.write(str(s)) \r\n ", "from collections import Counter as cnt\r\nn,p=list(map(int,input().split()))\r\ns=input()\r\nf=sorted(s)\r\nc,t,d,g,r=cnt(f),0,{},\"\",0\r\nfor i in range(26):\r\n k=chr(i+97)\r\n if c.get(k)!=None: d[k]=c[k]\r\n else: d[k]=0\r\nfor i in d.keys():\r\n if d[i]<=p:\r\n h,x=i,0\r\n p-=d[i]\r\n else:\r\n h,x,r=i,p,1\r\n break\r\nif not r: h=chr(150)\r\nfor i in s:\r\n if i>h:\r\n g+=i\r\n elif i==h and t==x:\r\n g+=i\r\n elif i==h:\r\n t+=1\r\nif g: print(g)", "from collections import Counter\r\nimport string\r\nimport bisect\r\n#import random\r\nimport math\r\nimport sys\r\n# sys.setrecursionlimit(10**6) \r\nfrom fractions import Fraction\r\ndef array_int():\r\n return [int(i) for i in sys.stdin.readline().split()]\r\ndef vary(arrber_of_variables):\r\n if arrber_of_variables==1:\r\n return int(sys.stdin.readline())\r\n if arrber_of_variables>=2:\r\n return map(int,sys.stdin.readline().split()) \r\ndef makedict(var):\r\n return dict(Counter(var))\r\ntestcases=1\r\nfor _ in range(testcases):\r\n n,k=vary(2)\r\n s=list(input())\r\n ct=makedict(s)\r\n # print(ct)\r\n for i in string.ascii_lowercase:\r\n if k<=0:\r\n if i in ct:\r\n ct[i]=0\r\n continue\r\n if i in ct:\r\n if ct[i]>=k:\r\n ct[i]=k\r\n k=0\r\n else:\r\n ct[i]=ct[i]\r\n k-=ct[i]\r\n # print(ct)\r\n for i in string.ascii_lowercase:\r\n for j in range(n):\r\n if i==s[j]:\r\n if ct[i]==0:\r\n break\r\n # ct[i]-=1\r\n ct[i]-=1\r\n s[j]=0\r\n # print(s,ct)\r\n # print(s)\r\n for i in range(n):\r\n if s[i]==0:\r\n continue\r\n print(s[i],end=\"\")\r\n\r\n\r\n ", "# RawCoder : https://bit.ly/RCyouTube\r\n# Author : MehulYK\r\n\r\nn, k = map(int,input().split())\r\ns = input()\r\nc = 'abcdefghijklmnopqrstuvwxyz'\r\nfor i in c:\r\n cnt = s.count(i)\r\n s = s.replace(i,'',min(cnt, k))\r\n k -= cnt\r\n if k < 1:\r\n break\r\nprint(s) \r\n", "from collections import *\r\nfrom heapq import *\r\nfrom bisect import *\r\nfrom itertools import *\r\nfrom functools import *\r\nfrom math import *\r\nfrom string import *\r\nimport sys\r\n\r\ninput = sys.stdin.readline\r\n\r\n\r\ndef iter_alpha_removals(s):\r\n locs = defaultdict(list)\r\n for i, c in enumerate(s):\r\n locs[c].append(i)\r\n\r\n for c in sorted(locs):\r\n yield from locs[c]\r\n\r\n\r\ndef main():\r\n n, k = map(int, input().split())\r\n s = input().strip()\r\n removed = [False] * n\r\n\r\n it = iter_alpha_removals(s)\r\n for _ in range(k):\r\n removed[next(it)] = True\r\n\r\n print(\"\".join(s[i] for i in range(n) if not removed[i]))\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n, k =map(int, input().split())\r\ns = input()\r\nres = [i for i in enumerate(s)]\r\nres.sort(key = lambda x: x[1])\r\ncur = [res[i] for i in range(k, n)]\r\ncur.sort(key = lambda x: x[0])\r\ncur = \"\".join([i[1] for i in cur])\r\nprint(cur)", "if __name__ == '__main__':\r\n cin = input\r\n n, k = map(int, cin().split())\r\n s = cin()\r\n a = list()\r\n\r\n for c in range(n):\r\n a.append((s[c], c))\r\n a.sort(key=lambda x:x[0])\r\n a = a[k:]\r\n a.sort(key=lambda x:x[1])\r\n print(\"\".join([a[i][0] for i in range(n - k)]))", "n, k = map(int, input().split())\r\ns = list(input())\r\na = sorted([[x, i] for i, x in enumerate(s)])\r\n \r\nfor i in range(k):\r\n s[a[i][1]] = ''\r\nans =''\r\nfor i in s:\r\n print(i,end='')\r\nprint()", "from collections import *\r\nfrom heapq import *\r\nfrom bisect import *\r\nfrom itertools import *\r\nfrom functools import *\r\nfrom math import *\r\nfrom string import *\r\nimport operator\r\nimport sys\r\n\r\ninput = sys.stdin.readline\r\n\r\n\r\ndef iterate(s):\r\n locs = defaultdict(list)\r\n for i, c in enumerate(s):\r\n locs[c].append(i)\r\n\r\n for c in sorted(locs):\r\n yield from locs[c]\r\n\r\n\r\ndef solve():\r\n n, k = map(int, input().split())\r\n s = input().strip()\r\n\r\n good = [True] * n\r\n for i, _ in zip(iterate(s), range(k)):\r\n good[i] = False\r\n\r\n print(\"\".join(s[i] for i in range(n) if good[i]))\r\n\r\n\r\ndef main():\r\n tests = 1\r\n for _ in range(tests):\r\n solve()\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "import math\r\nimport sys\r\nimport queue\r\n\r\n\r\ndef solve():\r\n n, k = map(int, input().split())\r\n s = str(input())\r\n\r\n alph = sorted(list(\"qwertyuiopasdfghjklzxcvbnm\"))\r\n f = {alph[i]: 0 for i in range(26)}\r\n\r\n for i in range(n):\r\n f[s[i]] += 1\r\n\r\n to_del = {alph[i]: 0 for i in range(26)}\r\n for i in range(26):\r\n if k > f[alph[i]]:\r\n to_del[alph[i]] = f[alph[i]]\r\n k -= f[alph[i]]\r\n else:\r\n to_del[alph[i]] = k\r\n break\r\n\r\n res = \"\"\r\n for i in range(n):\r\n if to_del[s[i]] != 0:\r\n to_del[s[i]] -= 1\r\n else:\r\n res += s[i]\r\n\r\n print(res)\r\n\r\n\r\nif __name__ == '__main__':\r\n multi_test = 0\r\n\r\n if multi_test:\r\n t = int(input())\r\n for _ in range(t):\r\n solve()\r\n else:\r\n solve()\r\n", "length, k = map(int, input().split())\r\nstring = input()\r\ns1 = \"abcdefghijklmnopqrstuvwxyz\"\r\nj = 0\r\nfor i in s1:\r\n j = string.count(i)\r\n string = string.replace(i, \"\", min(j, k))\r\n k -= j\r\n if k < 1:\r\n break\r\nprint(string)", "n,k=map(int,input().split())\r\ns=input()\r\nl=97\r\nwhile k>0:\r\n m=s.count(chr(l))\r\n s=s.replace(chr(l),\"\",min(m,k))\r\n k-=min(m,k)\r\n l+=1\r\nprint(s)", "from collections import Counter\r\n\r\nn, k = map(int, input().split())\r\ns = input().strip()\r\nletters = 'abcdefghijklmnopqrstuvwxyz'\r\ncnt = Counter(s)\r\nwhile k:\r\n for i in letters:\r\n x = cnt.get(i, 0)\r\n if x:\r\n if k >= x:\r\n s = s.replace(i, '', x)\r\n cnt[i] = 0\r\n k -= x\r\n else:\r\n s = s.replace(i, '', k)\r\n cnt[i] = x - k\r\n k = 0\r\n break\r\nprint(s)\r\n", "import string\r\nn, k = map(int,input().split())\r\ns = list(input())\r\nli = sorted([(c,idx) for idx , c in enumerate(s)])\r\nfor i in range(k):\r\n\ts[li[i][1]] = ''\r\nprint(\"\".join(s))\r\n", "from collections import *\r\n\r\nn,k = list(map(int,input().split()))\r\ns = input()\r\ncnt = Counter(s)\r\nfor c in 'abcdefghijklmnopqrstuvwxyz':\r\n if cnt[c]<k:\r\n k-=cnt[c]\r\n else:\r\n break\r\nres = 0\r\nans = []\r\nfor i in s:\r\n if i<c:\r\n pass\r\n elif k and i==c:\r\n k-=1\r\n else:\r\n ans.append(i)\r\nprint(''.join(ans))\r\n", "from itertools import accumulate\r\n\r\nn, k = map(int, input().split())\r\ns = list(str(input()))\r\n\r\ndic = {}\r\nfor i in range(97, 97 + 26):\r\n\tdic[chr(i)] = 0\r\nfor el in s:\r\n\tdic[el] += 1\r\n\r\nli = list(dic.values())\r\nli_ = list(accumulate(li))\r\n\r\nfinal = float('inf')\r\nfor i in range(26):\r\n\tif li_[i] > k:\r\n\t\tfinal = i\r\n\t\tbreak\r\n\r\nif final != 0 and final != float('inf'):\r\n\tremove = []\r\n\tfor i in range(final):\r\n\t\tremove.append(i)\r\n\tremove = set(remove)\r\n\r\n\ts = [el for el in s if ord(el) - 97 not in remove]\r\n\r\n\tfinal_length = k - li_[final - 1]\r\n\tfinal_remove = []\r\n\tlength = 0\r\n\tfor i in range(len(s)):\r\n\t\tif length == final_length:\r\n\t\t\tbreak\r\n\t\tif s[i] == chr(final + 97):\r\n\t\t\tfinal_remove.append(i)\r\n\t\t\tlength += 1\r\n\tfinal_remove = set(final_remove)\r\n\r\n\ts = [s[i] for i in range(len(s)) if i not in final_remove]\r\n\r\n\tprint(''.join(s))\r\n\r\nelif final == 0:\r\n\tbye = []\r\n\tfor i in range(len(s)):\r\n\t\tif s[i] == 'a':\r\n\t\t\tbye.append(i)\r\n\tbye = bye[:k]\r\n\tbye = set(bye)\r\n\r\n\ts = [s[i] for i in range(len(s)) if i not in bye]\r\n\r\n\tprint(''.join(s))\r\n\r\nelif final == float('inf'):\r\n\tprint('')", "n, k = map(int, input().split())\r\nprint(\"\".join(map(lambda x: x[0], sorted(sorted(list(zip(input(), range(n))))[k::], key=lambda x: x[1]))))\r\n", "n, k = list(map(int, input().split()))\r\ns = input()\r\nletter_count = {chr(ord('a') + i) : 0 for i in range(26)}\r\nfor c in s:\r\n letter_count[c] += 1\r\nfull_delete = set()\r\npartial_delete = \"\"\r\nfor c in letter_count:\r\n if k >= letter_count[c]:\r\n k -= letter_count[c]\r\n full_delete.add(c)\r\n else:\r\n partial_delete = c\r\n break\r\nresult = []\r\nfor c in s:\r\n if c not in full_delete:\r\n if c == partial_delete and k > 0:\r\n k -= 1\r\n else:\r\n result.append(c)\r\nprint(\"\".join(result))\r\n", "z=input;n,m=map(int,z().split());l=z()\r\nfor i in range(97,123):l=l.replace(chr(i),'',max(0,len(l)-n+m))\r\nprint(l)", "n, m = map(int, input().split())\r\na = input()\r\nd = {}\r\nfor i in range(n):\r\n\td[a[i]] = d.get(a[i], 0) + 1\r\nfor i in sorted(d.keys()):\r\n\tif m > 0:\r\n\t\tx = min(m, d[i])\r\n\t\tm -= x\r\n\t\td[i] = x\r\n\telse:\r\n\t\td[i] = 0\r\nf = 0\r\nfor i in range(n):\r\n\tif d.get(a[i], 0):\r\n\t\td[a[i]] -= 1\r\n\t\tpass\r\n\telse:\r\n\t\tprint(a[i], end = \"\")\r\n\t\tf = 1\r\nif f:\t\t\r\n\tprint()\r\n\t\r\n", "def main():\r\n from sys import stdin, setrecursionlimit\r\n # setrecursionlimit(1000000)\r\n input = stdin.readline\r\n def iinput(): return int(input())\r\n def sinput(): return input().rstrip()\r\n def i0input(): return int(input()) - 1\r\n def linput(): return list(input().split())\r\n def liinput(): return list(map(int, input().split()))\r\n def miinput(): return map(int, input().split())\r\n def li0input(): return list(map(lambda x: int(x) - 1, input().split()))\r\n def mi0input(): return map(lambda x: int(x) - 1, input().split())\r\n INF = 1000000000000000000\r\n MOD = 1000000007\r\n\r\n N, K = miinput()\r\n S = list(sinput())\r\n alpha = 'abcdefghijklmnopqrstuvwxyz'\r\n\r\n for a in alpha:\r\n T = []\r\n for c in S:\r\n if a != c or K == 0:\r\n T.append(c)\r\n else:\r\n K -= 1\r\n if K == 0:\r\n print(''.join(T))\r\n return\r\n S = T\r\n \r\n\r\nmain()", "n, k_value = map(int, input().split())\r\ninput_string = input()\r\nchar_count = {}\r\n\r\nfor i in range(n):\r\n if input_string[i] in char_count:\r\n char_count[input_string[i]] += 1\r\n else:\r\n char_count[input_string[i]] = 1\r\n\r\nfor i in range(ord('a'), ord('z') + 1):\r\n current_char = chr(i)\r\n if current_char in char_count and char_count[current_char] >= k_value:\r\n char_count[current_char] -= k_value\r\n k_value = 0\r\n else:\r\n if current_char in char_count:\r\n k_value -= char_count[current_char]\r\n char_count[current_char] = 0\r\n\r\nresult_string = \"\"\r\nfor i in range(n - 1, -1, -1):\r\n if input_string[i] in char_count and char_count[input_string[i]] != 0:\r\n result_string += input_string[i]\r\n char_count[input_string[i]] -= 1\r\n\r\nresult_string = result_string[::-1]\r\nprint(result_string)\r\n", "import string\r\n\r\nn, k = map(int, input().split())\r\ns = list(input())\r\nfor a in string.ascii_lowercase:\r\n\tfor i in range(n):\r\n\t\tif s[i] == a:\r\n\t\t\ts[i] = \"*\"\r\n\t\t\tk -= 1\r\n\t\tif not k:\r\n\t\t\tprint(*filter(lambda x: x != \"*\", s), sep=\"\")\r\n\t\t\texit(0)\r\n", "n, k = map(int, input().split())\r\ns = input()\r\npos = [[] for i in range(26)]\r\nfor i in range(len(s)):\r\n pos[ord(s[i]) - ord('a')].append(i)\r\ntorem = set()\r\nfor i in range(26):\r\n for j in range(len(pos[i])):\r\n if k:\r\n torem.add(pos[i][j])\r\n k -= 1\r\n else:\r\n break\r\n if not k:\r\n break\r\nfor i in range(len(s)):\r\n if i not in torem:\r\n print(s[i], end=\"\")", "from collections import Counter\nimport string\n\ndef main():\n n, k = map(int, input().split())\n s = input()\n\n a, t = {x: [] for x in string.ascii_lowercase}, []\n\n for (i, x) in enumerate(s):\n a[x].append(i)\n\n for c, l in a.items():\n skip = min(k, len(l))\n k -= skip\n for i in range(skip, len(l)):\n t.append((l[i], c))\n\n print(''.join(x[1] for x in sorted(t)))\n\nif __name__ == \"__main__\":\n main()\n", "n,k = list(map(int,input().split()))\r\ns = input()\r\ndct = {}\r\nfor i in range(n):\r\n if s[i] in dct:\r\n dct[s[i]].append(i)\r\n else:\r\n dct[s[i]] =[i]\r\nli = sorted(dct)\r\nst = set()\r\nfor i in li:\r\n for j in dct[i]:\r\n if k > 0:\r\n k -= 1\r\n st.add(j)\r\n else:\r\n break\r\nres = ''\r\nfor i in range(n):\r\n if i not in st:\r\n res += s[i]\r\nprint(res)", "n , k = map(int,input().split())\r\ns = input()\r\ns = list(s)\r\nfrom collections import Counter\r\nmc = dict(Counter(s))\r\n\r\naplha = ['a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i', 'j', 'k', 'l', 'm', 'n', 'o', 'p', 'q', 'r', 's', 't', 'u', 'v', 'w', 'x', 'y', 'z']\r\nfor x in aplha:\r\n if k ==0:\r\n break\r\n i = 0\r\n while i < len(s):\r\n if k == 0:\r\n break\r\n if s[i] == x:\r\n s[i] = ''\r\n k -= 1\r\n i += 1\r\n\r\n\r\n\r\nprint(\"\".join(s))", "import string\r\nn, k = map(int, input().split())\r\ns = input()\r\nfor l in string.ascii_lowercase:\r\n s = s.replace(l, '', max(0, len(s) - n + k))\r\nprint(s)\r\n", "from collections import Counter\r\nq = 'abcdefghijklmnopqrstuvwxyz'\r\nn, m = map(int, input(). split())\r\ns = input()\r\nw = 0\r\ne = 0\r\nr = 0\r\nwhile m:\r\n if r:\r\n break\r\n elif q[w] in s:\r\n p = Counter(s)\r\n if p[q[w]] <= m:\r\n s = s. replace(q[w], '')\r\n m -= p[q[w]]\r\n else:\r\n s = list(s)\r\n for i in range(len(s)):\r\n if r == m:\r\n break\r\n if s[i] == q[w]:\r\n r += 1\r\n s[i] = ''\r\n else:\r\n w += 1\r\nprint(''. join(s))\r\n", "n,k=map(int,input().strip().split())\r\ns=input()\r\nj=0\r\np=97\r\nwhile j<k:\r\n for i in range(p,123):\r\n if chr(i) in s:\r\n co=s.count(chr(i))\r\n a=min(k-j,co)\r\n j+=a\r\n p=i\r\n s=s.replace(chr(i),\"\",a)\r\n break\r\nprint(s)", "n, k = map(int, input().split())\r\ns = input()\r\nd = {chr(i): 0 for i in range(ord('a'), ord('z') + 1)}\r\nfor i in s:\r\n d[i] += 1\r\nfor i in d:\r\n if d[i] <= k:\r\n k -= d[i]\r\n d[i] = 0\r\n else:\r\n d[i] = d[i] - k\r\n k = 0\r\nans = ''\r\nfor i in s[::-1]:\r\n if d[i] != 0:\r\n ans += i\r\n d[i] -= 1\r\nans = ans[::-1]\r\nprint(ans)", "n, k = map(int, input().split())\r\n\r\ns = input().rstrip()\r\n\r\nalphabet = ['a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i', 'j', 'k', 'l', 'm', 'n', 'o', 'p', 'q', 'r', 's', 't', 'u', 'v', 'w', 'x', 'y', 'z']\r\n\r\nkdup = k\r\n\r\nkset = []\r\n\r\nfor i in alphabet:\r\n if s.count(i) > kdup:\r\n for t in range(kdup):\r\n kset.append(i)\r\n kdup = 0\r\n elif s.count(i) <= kdup:\r\n for t in range(s.count(i)):\r\n kset.append(i)\r\n kdup -= s.count(i)\r\n\r\nlts = {}\r\n\r\nfor i in range(26):\r\n lts[alphabet[i]] = 0\r\n\r\nfor i in range(k):\r\n lts[kset[i]] += 1\r\n\r\nnewstr = []\r\n\r\nfor i in range(n):\r\n if lts[s[i]] <= 0:\r\n newstr.append(s[i])\r\n else:\r\n lts[s[i]] -= 1\r\n\r\n#print(kset, lts)\r\nprint(''.join(newstr))\r\n\r\n", "n,k=(int(i) for i in input().split())\r\nstr_1=input()\r\nstr_2=''\r\nfor i in range(97,123):\r\n if str_1.count(chr(i)) <= k:\r\n k-=str_1.count(chr(i))\r\n str_1=str_1.replace(chr(i),'')\r\n if k==0:\r\n break\r\n elif str_1.count(chr(i)) > k:\r\n str_1=str_1.replace(chr(i),'',k)\r\n break\r\nprint(str_1)", "x=\"abcdefghijklmnopqrstuvwxyz\"\r\nn,k=map(int,input().split())\r\ns=input()\r\nd=dict()\r\nfor i in range(n):\r\n\tif(s[i] in d):\r\n\t\td[s[i]].append(i)\r\n\telse:\r\n\t\td[s[i]]=[i]\r\nfor i in d:\r\n\td[i]=sorted(d[i])[::-1]\r\nwhile(k>0):\r\n\tfor i in x:\r\n\t\tif(i in d and len(d[i])>0):\r\n\t\t\twhile(k>0 and len(d[i])>0):\r\n\r\n\t\t\t\td[i].pop()\r\n\t\t\t\tk-=1\r\n# print(d)\r\nans=[0]*n\r\nfor i in d:\r\n\tfor j in d[i]:\r\n\t\tans[j]=i\r\nfor i in range(n):\r\n\tif(ans[i]==0):\r\n\t\tans[i]=\"\"\r\nprint(\"\".join(ans))\r\n", "import math\nimport sys\n# from xmlrpc.client import MININT\n\nn,k=map(int,input().split())\n\n# t=True\ns=input()\n# arr=[]\n# arr[:0]=s\n# print(arr)\n# ans=0\n# for i in range(int(input())):\n# n=int(input())\n \n # st=input()\n # n,k=map(int,input().split())f() \n# arr=list(map(int,input().split()))\ni=97\nans=\"\"\nwhile(k>0):\n p=s.count(chr(i))\n m=k-p\n if(m<=0):\n s=s.replace(chr(i),\"\",k)\n break\n else:\n s=s.replace(chr(i),\"\",p)\n i+=1\n k-=p\n\n# print(ans.join(arr))\nprint(s)\n \t\t\t \t \t\t\t \t \t\t\t \t \t \t", "from string import ascii_lowercase as alp\r\nfrom collections import Counter\r\n\r\nalphabet = alp\r\n\r\ndef solve():\r\n\tn, k = map(int, input().split())\r\n\ts = list(input())\r\n\tl = Counter(s)\r\n\r\n\tfor i in alp:\r\n\t\tif k > l[i]:\r\n\t\t\tk -= l[i]\r\n\t\t\tl[i] = 0\r\n\t\telse:\r\n\t\t\tl[i] -= k\r\n\t\t\tk = 0\r\n\t\t\tbreak\r\n\tans = []\r\n\tfor i in range(n-1, -1, -1):\r\n\t\tif l[s[i]] != 0:\r\n\t\t\tans.append(s[i])\r\n\t\t\tl[s[i]] -= 1\r\n\r\n\tprint(*list(reversed(ans)), sep='')\r\n\r\nsolve()", "n,k=map(int,input().split(' '))\ns=input()\na=[]\n\nc=[0]*26\nfor i in range(n):\n a.append(ord(s[i])-97)\n c[a[i]]+=1\n\ncount=0\nfor i in range(len(c)):\n count+=c[i]\n if count>k:\n c[i]-=(count-k)\n for j in range(i+1,26):\n c[j]=0\n break\n\nfor i in range(len(a)):\n if c[a[i]]>0:\n c[a[i]]-=1\n a[i]=-1\n\nfor i in range(len(a)):\n if a[i]>-1:\n print(chr(a[i]+97),end='')\n", "import sys\r\ninput = lambda: sys.stdin.readline().rstrip()\r\nimport math\r\nimport random\r\nfrom bisect import bisect_right, bisect_left\r\nfrom itertools import product, permutations, combinations, combinations_with_replacement \r\nfrom collections import deque, defaultdict, Counter\r\nfrom heapq import heapify, heappush, heappop\r\nfrom functools import lru_cache, reduce\r\ninf = float('inf')\r\ndef error(*args, sep=' ', end='\\n'):\r\n print(*args, sep=sep, end=end, file=sys.stderr)\r\n# mod = 1000000007\r\n# mod = 998244353\r\n\r\n# ----------------------- #\r\n\r\nn, k = map(int, input().split())\r\n\r\ns = input()\r\nans = []\r\ncnt = [deque() for _ in range(26)]\r\na = ord('a')\r\nfor i in range(n):\r\n j = ord(s[i]) - a\r\n cnt[j].append(i)\r\nwhile k > 0:\r\n for i in range(26):\r\n if len(cnt[i]) > 0:\r\n cnt[i].popleft()\r\n k -= 1\r\n break\r\nans = []\r\nwhile True:\r\n mn = n+1\r\n j = -1\r\n for i in range(26):\r\n if len(cnt[i]) > 0:\r\n if cnt[i][0] < mn:\r\n mn = cnt[i][0]\r\n j = i\r\n if j == -1:\r\n break\r\n cnt[j].popleft()\r\n ans.append(s[mn])\r\nprint(''.join(map(str, ans)))\r\n", "n, k = map(int, input().split())\r\ns = input()\r\n\r\nalphabet = ['a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i', 'j', 'k', 'l', 'm', 'n', 'o', 'p', 'q', 'r', 's', 't', 'u', 'v', 'w', 'x', 'y', 'z']\r\n\r\nif k == n:\r\n print()\r\nelse:\r\n for i in alphabet:\r\n if k > 0:\r\n differ = len(s) - len(s.replace(i, ''))\r\n if differ <= k:\r\n s = s.replace(i, '')\r\n k -= differ\r\n else:\r\n s = s.replace(i, '', k)\r\n k = 0\r\n else:\r\n break\r\n\r\n print(s)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n# for i in range(k):\r\n# if s.find('a') != -1:\r\n# s = s.replace('a', '', 1)\r\n# elif s.find('b') != -1:\r\n# s = s.replace('b', '', 1)\r\n# elif s.find('c') != -1:\r\n# s = s.replace('c', '', 1)\r\n# elif s.find('d') != -1:\r\n# s = s.replace('d', '', 1)\r\n# elif s.find('e') != -1:\r\n# s = s.replace('e', '', 1)\r\n# elif s.find('f') != -1:\r\n# s = s.replace('f', '', 1)\r\n# elif s.find('g') != -1:\r\n# s = s.replace('g', '', 1)\r\n# elif s.find('h') != -1:\r\n# s = s.replace('h', '', 1)\r\n# elif s.find('i') != -1:\r\n# s = s.replace('i', '', 1)\r\n# elif s.find('j') != -1:\r\n# s = s.replace('j', '', 1)\r\n# elif s.find('k') != -1:\r\n# s = s.replace('k', '', 1)\r\n# elif s.find('l') != -1:\r\n# s = s.replace('l', '', 1)\r\n# elif s.find('m') != -1:\r\n# s = s.replace('m', '', 1)\r\n# elif s.find('n') != -1:\r\n# s = s.replace('n', '', 1)\r\n# elif s.find('o') != -1:\r\n# s = s.replace('o', '', 1)\r\n# elif s.find('p') != -1:\r\n# s = s.replace('p', '', 1)\r\n# elif s.find('q') != -1:\r\n# s = s.replace('q', '', 1)\r\n# elif s.find('r') != -1:\r\n# s = s.replace('r', '', 1)\r\n# elif s.find('s') != -1:\r\n# s = s.replace('s', '', 1)\r\n# elif s.find('t') != -1:\r\n# s = s.replace('t', '', 1)\r\n# elif s.find('u') != -1:\r\n# s = s.replace('u', '', 1)\r\n# elif s.find('v') != -1:\r\n# s = s.replace('v', '', 1)\r\n# elif s.find('w') != -1:\r\n# s = s.replace('w', '', 1)\r\n# elif s.find('x') != -1:\r\n# s = s.replace('x', '', 1)\r\n# elif s.find('y') != -1:\r\n# s = s.replace('y', '', 1)\r\n# elif s.find('z') != -1:\r\n# s = s.replace('z', '', 1)\r\n", "for _ in range(1):\r\n n,k=map(int,input().split())\r\n s=input()\r\n ans='abcdefghijklmnopqrstuvwxyz'\r\n for i in ans:\r\n c=s.count(i)\r\n s=s.replace(i,\"\",min(c,k))\r\n k-=c\r\n if k<1:\r\n break\r\n print(s) \r\n \r\n", "import sys \r\ninput = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\r\nn,k=map(int,input().split())\r\ns=input()\r\nera={}\r\nt=list()\r\nd={}\r\nfor i in s:d[i]=0\r\nfor i in s:d[i]+=1\r\nfor i in s:t.append(i)\r\nse=sorted(list(set(sorted(t))))\r\nans=''\r\nfor i in se:\r\n\tif d[i]<=k:\r\n\t\tk-=d[i]\r\n\t\tera[i]=d[i]\r\n\telif k!=0 and d[i]>k:\r\n\t\tera[i]=k\r\n\t\tk=0\r\n\telse:\r\n\t\tera[i]=0\r\nfor i in s:\r\n\tif era[i]:\r\n\t\tera[i]-=1\r\n\telse:\r\n\t\tans+=i\r\nprint(ans)", "from re import A\n\n\nn, m = [int(j) for j in input().split()]\nres = input()\nresNew = [\"#\"] * len(res)\n# print(resNew)\nhash = {\n \"a\": [],\n \"b\": [],\n \"c\": [],\n \"d\": [],\n \"e\": [],\n \"f\": [],\n \"g\": [],\n \"h\": [],\n \"i\": [],\n \"j\": [],\n \"k\": [],\n \"l\": [],\n \"m\": [],\n \"n\": [],\n \"o\": [],\n \"p\": [],\n \"q\": [],\n \"r\": [],\n \"s\": [],\n \"t\": [],\n \"u\": [],\n \"v\": [],\n \"w\": [],\n \"x\": [],\n \"y\": [],\n \"z\": [],\n}\n\n# print(hash)\nfor i in range(len(res)):\n hash[res[i]].append(i)\n# print(hash)\n# print(resNew)\n\n# a [3, 4, 6, 8, 10]\n# b [5, 7, 9, 13]\n# c [0, 1, 2, 11, 12, 14]\n\n# while k > 0:\nfor k, v in hash.items():\n i = 0\n while i < len(v):\n # print(i, v)\n if m > 0:\n m-=1\n else:\n # print(v[i])\n resNew[v[i]] = k\n i+=1\n\n\n\n # if m > 0:\n # while i < len(v) and m > 0:\n # resNew[v[i]] = k\n # i+=1\n # m-=1\n # else:\n # continue\n # else:\n # break\n\nprint(\"\".join(resNew).replace(\"#\", \"\"))\n\n\n\n# for i in range(26):\n# curChar = chr(97+i)\n# # print(curChar)\n# if k > 0:\n# for cur in res:\n# if cur == curChar:\n\n\n# k-=1\n# else:\n# break\n# print(resNew)\n\n# ccc@@b@babaccbc\n# 0123456789\n# \n\n\n# a [8, 10]\n# b [5, 7, 9, 13]\n# c [0, 1, 2, 11, 12, 14]\n\n# cccaabababaccbc\n# 0123456789\n# a [3, 4, 6, 8, 10]\n# b [5, 7, 9, 13]\n# c [0, 1, 2, 11, 12, 14]\n# d\n# e\n# f\n# g\n# h\n# i\n# j\n# k\n# l\n# m\n# n\n# o\n# p\n# q\n# r\n", "n, k = map(int, input().split())\r\ns = input()\r\ns1 = \"abcdefghijklmnopqrstuvwxyz\"\r\nj = 0\r\nfor i in s1:\r\n j = s.count(i)\r\n s = s.replace(i, \"\", min(j, k))\r\n k -= j\r\n if k < 1:\r\n break\r\nprint(s)\r\n", "n,k=map(int,input().split())\nstring=input()\nballs=\"\"\nalphabetlst=[0]*26\nfor c in string:\n alphabetlst[ord(c)-97]+=1\nfor i in range(26):\n if k ==0: \n alphabetlst[i]=0\n tarun=min(k,alphabetlst[i])\n k-=tarun\n alphabetlst[i]=tarun\nfor c in string:\n if alphabetlst[ord(c)-97]>0:\n alphabetlst[ord(c)-97]-=1\n continue\n balls+=c\n \nprint(balls)", "a,b = map(int,input().split());n = input()\r\nfreq = [0]*26\r\nfor i in n:freq[ord(i)-ord('a')]+=1\r\nfor i in range(26):\r\n if freq[i]>0:\r\n if freq[i]>=b:freq[i]-=b;b=0;break\r\n else:b-=freq[i];freq[i]=0\r\ns = \"\"\r\nfor i in range(a-1,-1,-1):s+=n[i] if freq[ord(n[i])-ord('a')]>0 else \"\";freq[ord(n[i])-ord('a')]-=1\r\nprint(s[::-1])", "from collections import Counter\nfrom string import ascii_lowercase\nimport sys\nn, k = map(int, input().split())\nline = input()\ncounter = Counter(line)\n\n\nif n <= k:\n sys.exit(0)\n\n# print(counter)\n# print(ascii_lowercase)\nfor letter in ascii_lowercase:\n if letter in counter:\n value = counter[letter]\n if value >= k:\n counter[letter] -= k\n break\n\n counter[letter] = 0\n k -= value\n continue\n\n# print(counter)\n\nnew_letter = []\nfor letter in line[::-1]:\n value = counter[letter]\n\n if value > 0:\n new_letter.append(letter)\n counter[letter] -= 1\n\nprint(\"\".join(new_letter[::-1]))", "n, k = map(int, input().split())\r\ns = input()\r\n\r\na = 'abcdefghijklmnopqrstuvwxyz'\r\n\r\nfor i in range(len(a)):\r\n if a[i] in s:\r\n x = s.count(a[i])\r\n if k >= x:\r\n s = s.replace(a[i], '')\r\n k -= x\r\n else:\r\n s = s.replace(a[i], '', k)\r\n print(s)\r\n exit()\r\nprint(s)", "if __name__ == '__main__':\r\n cin = input\r\n n, k = map(int, cin().split())\r\n s = [*cin()]\r\n a = sorted([(c, i) for i, c in enumerate(s)])\r\n for i in range(k):\r\n s[a[i][1]] = \"\"\r\n print(\"\".join(s))", "from sys import stdin\r\nfrom collections import defaultdict, Counter\r\nfrom bisect import bisect_left\r\nfrom math import sqrt\r\nfrom heapq import *\r\n###############################################################\r\ndef iinput(): return int(stdin.readline())\r\ndef minput(): return map(int, stdin.readline().split())\r\ndef linput(): return list(map(int, stdin.readline().split()))\r\n###############################################################\r\n\r\nal = 'abcdefghijklmnopqrstuvwxyz'\r\n\r\nt = 1\r\nwhile t:\r\n t -= 1\r\n n, k = minput()\r\n s = input()\r\n for e in al:\r\n s = s.replace(e, '', k)\r\n k -= (n-len(s))\r\n n = len(s)\r\n if n==0: break\r\n print(s)\r\n", "import sys, io, os\r\nimport math\r\nimport bisect\r\nimport heapq\r\nimport string\r\nimport re\r\nfrom decimal import *\r\nfrom collections import defaultdict,Counter,deque\r\ninput = sys.stdin.readline\r\n \r\ndef I():\r\n return input()\r\n \r\ndef II():\r\n return int(input())\r\n \r\ndef MII():\r\n return map(int, input().split())\r\n \r\ndef LI():\r\n return list(input().split())\r\n \r\ndef LII():\r\n return list(map(int, input().split()))\r\n \r\ndef GMI():\r\n return map(lambda x: int(x) - 1, input().split())\r\n \r\ndef LGMI():\r\n return list(map(lambda x: int(x) - 1, input().split()))\r\n \r\ndef WRITE(out):\r\n return print('\\n'.join(map(str, out)))\r\n \r\ndef WS(out):\r\n return print(' '.join(map(str, out)))\r\n \r\ndef WNS(out):\r\n return print(''.join(map(str, out)))\r\n\r\ndef WSNOPRINT(out):\r\n return ''.join(map(str, out))\r\n\r\n\r\n'''\r\n'''\r\ndef solve():\r\n n, k = MII()\r\n s = I().strip()\r\n d = defaultdict(list)\r\n for i in range(len(s)-1,-1,-1):\r\n d[s[i]].append(i)\r\n\r\n while k:\r\n for c in string.ascii_lowercase:\r\n if c in d:\r\n d[c].pop()\r\n if not d[c]:\r\n del d[c]\r\n break\r\n k -= 1\r\n\r\n ans = [''] * n\r\n for ky in d:\r\n for i in d[ky]:\r\n ans[i] = ky\r\n print(''.join(ans))\r\n\r\ndef main():\r\n solve()\r\n\r\nmain()\r\n", "a=list(map(int, input().split()))\r\nimport re\r\ns=input()\r\nk=a[1]\r\nn=a[0]\r\nif n==k:\r\n print(\" \")\r\nelse:\r\n u=list(set(s))\r\n u.sort()\r\n freq = {}\r\n for item in s:\r\n if (item in freq):\r\n freq[item] += 1\r\n else:\r\n freq[item] = 1\r\n sorted_dict = dict(sorted(freq.items()))\r\n f=list(sorted_dict.values())\r\n \r\n #print(f)\r\n t=f[0]\r\n for i in range(len(f)):\r\n if t<k:\r\n s=re.sub(u[i],\"\",s,count=f[i])\r\n #print(s)\r\n t=t+f[i+1]\r\n elif t==k:\r\n s=re.sub(u[i],\"\",s,count=f[i])\r\n #print(s)\r\n t=t+f[i+1]\r\n break\r\n else:\r\n q=t-k\r\n q=f[i]-q\r\n s=re.sub(u[i],\"\",s,count=q)\r\n #print(s)\r\n break\r\n print(s)\r\n", "n, k = map(int, input().split())\ns = input()\n\nletters = sorted(set(s))\nto_remove = {}\nfor l in letters:\n to_remove[l] = min(k, s.count(l))\n k -= to_remove[l]\n\nans = []\nfor c in s:\n if to_remove[c] > 0:\n to_remove[c] -= 1\n else:\n ans.append(c)\nprint(\"\".join(ans))", "\"\"\"\r\n-*- coding: utf-8 -*-\r\n\r\nCreated on Sat Jan 22 16:49:55 2022\r\n\r\n@author: Tausif Khan Arnob\r\n\"\"\"\r\n\r\nn, k = map(int, input().split())\r\ns = input()\r\nprint(''.join(x[0] for x in sorted(sorted(zip(s, range(n)))[k:], key = lambda x:x[1])))", "from sys import stdin, stdout \r\nfrom math import log2, log10, log, ceil, floor, sqrt\r\nfrom string import ascii_lowercase \r\nfrom collections import Counter \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 = rn()\r\n s = rs()\r\n\r\n b = Counter(s)\r\n flag = False \r\n for letter in ascii_lowercase:\r\n helper = b[letter]\r\n if helper >= k:\r\n helper = k \r\n flag = True \r\n s = s.replace(letter, \"\", helper)\r\n if flag:\r\n break\r\n k -= helper \r\n\r\n print(s)\r\n return None\r\n\r\n\r\ndef main():\r\n for _ in range(ri()):\r\n solve()\r\n\r\nsolve()\r\n", "from collections import Counter,deque\r\nfrom string import ascii_lowercase as l\r\na,b = map(int,input().split());n = input();x,d = Counter(n),{}\r\nfor i in range (a):d.setdefault(n[i],deque());d[n[i]].append(i)\r\nj=k=0\r\nwhile 1:\r\n if k==b or j>=26:break\r\n if l[j] not in x and k<b:j+=1;continue\r\n if d[l[j]]:d[l[j]].popleft();x[l[j]]-=1;k+=1\r\n else:j+=1\r\nar = [0] * a\r\nfor i in d:\r\n for j in d[i]:ar[j]=i\r\nx = \"\"\r\nfor i in ar:x+=i if i!=0 else \"\"\r\nprint(x)", "n, k = map(int, input().split())\r\ns = list(input().strip())\r\n\r\n\r\nfor x in range(ord('a'), ord('z') + 1):\r\n if k == 0:\r\n break\r\n \r\n for i in range(n):\r\n if k == 0:\r\n break\r\n \r\n if s[i] == chr(x):\r\n s[i] = ' '\r\n k -= 1\r\n\r\nresult = ''.join([ch for ch in s if not ch.isspace()])\r\nprint(result)", "n, k = map(int, input().split())\r\ns = input()\r\nf = [0] * 400001\r\nfor i in \"abcdefghijklmnopqrstuvwxyz\":\r\n for j in range(n):\r\n if s[j] == i and k > 0:\r\n k -= 1\r\n f[j] = 1\r\nfor z in range(n):\r\n if not f[z]:\r\n print(s[z], end=\"\")\r\n", "def mainfunc():\n k=int(input().split()[1])\n a=input()\n letters=['a','b','c','d','e','f','g','h','i','j','k','l','m','n','o','p','q','r','s','t','u','v','w','x','y','z']\n while k>0:\n for i in letters:\n c=a.count(i)\n if k-c>0:\n k-=c\n a=a.replace(i,'',a.count(i))\n else:\n a=a.replace(i,'',k)\n k=0\n print(''.join(a))\nmainfunc()\n\t \t\t \t \t\t \t \t\t\t\t \t\t \t\t \t\t\t\t", "n, k = map(int, input().split(' '))\r\nword = input()\r\nletter_dict = dict()\r\nfor i in range(n):\r\n letter = word[i]\r\n if not letter in letter_dict:\r\n letter_dict[letter] = []\r\n letter_dict[letter].append(i)\r\n\r\ni_to_remove = set()\r\ndef select(num, char_code = ord('a')):\r\n # is the letter we are observing is 'more' than 'z'\r\n if char_code > ord('z'):\r\n return\r\n\r\n letter = chr(char_code)\r\n\r\n # if the letter is not there in the dict\r\n if not letter in letter_dict:\r\n select(num, char_code + 1)\r\n return\r\n \r\n letter_count = len(letter_dict[letter])\r\n if (num < letter_count):\r\n i_to_remove.update(letter_dict[letter][:num])\r\n return\r\n else:\r\n i_to_remove.update(letter_dict[letter])\r\n select(num - letter_count, char_code + 1)\r\n return\r\n\r\nselect(k)\r\n\r\nprint(\"\".join([word[i] for i in range(len(word)) if i not in i_to_remove]))", "'''\r\n\r\nWelcome to GDB Online.\r\nGDB online is an online compiler and debugger tool for C, C++, Python, Java, PHP, Ruby, Perl,\r\nC#, OCaml, VB, Swift, Pascal, Fortran, Haskell, Objective-C, Assembly, HTML, CSS, JS, SQLite, Prolog.\r\nCode, Compile, Run and Debug online from anywhere in world.\r\n\r\n'''\r\nn,k=map(int,input().split())\r\ns=input()\r\nd={}\r\nfor ch in s:\r\n if ch not in d:\r\n d[ch]=[1,0]\r\n else: d[ch][0]+=1\r\nfor key in sorted(list(d.keys())):\r\n \r\n if d[key][0]<=k:\r\n k-=d[key][0]\r\n d[key][1]=d[key][0]\r\n else:\r\n if k<d[key][0]:\r\n \r\n d[key][1]=k\r\n k=0\r\n \r\n break\r\n \r\n \r\nans=\"\"\r\n\r\nfor ch in s:\r\n if d[ch][1]-d[ch][0]==0:continue\r\n elif d[ch][1]==0:\r\n ans+=ch\r\n else:\r\n d[ch][1]-=1\r\n \r\n \r\nprint(ans)", "n, k = map(int, input().split())\r\ns = input()\r\nb = {}\r\na = {}\r\ng = ''\r\nfor i in s:\r\n if i not in b.keys():\r\n b[i] = 1\r\n else:\r\n b[i] += 1\r\nfor i in sorted(b.keys()):\r\n a[i] = b[i]\r\nfor i in a:\r\n x = a[i]\r\n a[i] = a[i] - k\r\n if a[i] <= 0:\r\n a[i] = 0\r\n k -= x\r\n if k <= 0:\r\n k = 0\r\n break\r\nfor i in s[::-1]:\r\n if a[i] >= 1:\r\n g += i\r\n a[i] -= 1\r\nprint(g[::-1])\r\n", "n, k = map(int, input().split())\r\ns = input()\r\ns1 = list(s)\r\na = list(set(s1))\r\na.sort()\r\nb = [0] * len(a)\r\nfor i in range(len(a)):\r\n b[i] = s.count(a[i])\r\nw = 0\r\nfor i in range(len(a)):\r\n if w == k:\r\n break\r\n if b[i] < k - w:\r\n s = s.replace(a[i], '', b[i])\r\n w = w + b[i]\r\n else:\r\n s = s.replace(a[i], '', k - w)\r\n w = k\r\nprint(s)\r\n", "n,k = map(int,input().strip().split())\r\ns = input()\r\nl = n\r\ni=97\r\nwhile k!=0 and i<123:\r\n\tc = chr(i)\r\n\ts = s.replace(c,'',k)\r\n\tnl = len(s)\r\n\tk -= (l-nl)\r\n\tl = nl\r\n\ti+=1\r\nprint(s)", "n,k=map(int,input().split())\r\ns=input()\r\nc='a'\r\n \r\nwhile(k>0):\r\n z=s.count(c)\r\n s=s.replace(c,\"\",min(z,k))\r\n if k<=z: break\r\n k-=z\r\n c=chr(ord(c)+1)\r\nprint(s)", "\r\nfrom sys import stdin, stdout\r\n#from math import pow\r\n#import numpy as np\r\nfrom collections import Counter\r\n\r\n\r\n\r\n# int(stdin.readline()) stdout.write(str())\r\n# stdin.readline()\r\n# map(int, stdin.readline().split())\r\n# list(map(int, stdin.readline().split()))\r\n\r\na, b = map(int, stdin.readline().split())\r\ns = stdin.readline()\r\n\r\nsree='abcdefghijklmnopqrstuvwxyz'\r\nshan = [[] for i in range(26)]\r\n\r\nfor i in range(a):\r\n t=ord(s[i])-ord('a')\r\n shan[t].append(i)\r\n\r\nc=[1]*a\r\ncnt=0\r\nsiri=0\r\nfor i in range(26):\r\n for j in shan[i]:\r\n c[j]=0\r\n cnt+=1\r\n if cnt==b:\r\n siri=1\r\n break\r\n if siri:\r\n break\r\nmps=''\r\nfor i in range(a):\r\n if c[i]:\r\n mps+=s[i]\r\nstdout.write(str(mps))", "def main():\r\n n, k = map(int, input().split())\r\n s = input()\r\n\r\n alp = 'abcdefghijklmnopqrstuvwxyz'\r\n\r\n while k:\r\n for c in alp:\r\n if c in s:\r\n temp = s.count(c)\r\n if temp >= k:\r\n s = s.replace(c,'',k)\r\n print(s); return\r\n else:\r\n k -= temp\r\n s = s.replace(c,'',temp)\r\n print(s)\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n, k = map(int, input().split())\r\ns = input()\r\nl = [x[0] for x in sorted(sorted([(s[i], i) for i in range(n)], key=lambda x: x[0])[k:], key=lambda x: x[1])]\r\nprint(''.join(l))", "n,k=map(int,input().split())\r\ns=input()\r\n\r\no=ord('a')\r\n\r\nwhile k:\r\n n=s.count(chr(o))\r\n if k>=n:\r\n s=s.replace(chr(o),'')\r\n k-=n\r\n o+=1\r\n \r\n else:\r\n i=0\r\n for j in range(len(s)):\r\n if s[j]==chr(o):\r\n i+=1\r\n if i==k:\r\n break\r\n s=s[:j+1].replace(chr(o),'')+s[j+1:]\r\n break\r\n\r\nprint(s)\r\n", "from sys import stdin\nfrom collections import Counter,defaultdict,deque\nimport sys\nimport math,os\nimport operator\nimport random\nfrom fractions import Fraction\nimport functools\nimport bisect\nimport itertools\nfrom heapq import *\nimport copy\n\n\nn,k = map(int,input().split())\ns = list(input())\nfor i in range(26):\n char = chr(i+97)\n for j in range(n):\n if s[j] == char and k>0:\n k-=1\n s[j] = None\nprint(''.join([i for i in s if i!=None]))\n", "n, k = [int(i) for i in input().split()]\r\na = input()\r\nd = dict()\r\nfor i in range(n):\r\n if d.get(a[i]) is None:\r\n d[a[i]] = 1\r\n else:\r\n d[a[i]] += 1\r\n\r\nd1 = []\r\nfor i in d:\r\n d1.append([i, d[i]])\r\nd1.sort()\r\nneed = dict()\r\nfor i in range(len(d1)):\r\n if k == 0:\r\n break\r\n if d1[i][1] > k:\r\n need[d1[i][0]] = k\r\n k = 0\r\n else:\r\n need[d1[i][0]] = d1[i][1]\r\n k -= d1[i][1]\r\n\r\nans = ''\r\nfor i in range(n):\r\n if need.get(a[i]) is None:\r\n ans += a[i]\r\n elif need[a[i]] == 0:\r\n ans += a[i]\r\n else:\r\n need[a[i]] -= 1\r\nprint(ans)", "n,k=map(int, input().split())\r\nlet=\"abcdefghijklmnopqrstuvwxyz\"\r\nstring=list(input())\r\npositions=string.copy()\r\nif n!=k:\r\n act=0\r\n pos=1\r\n while(act<len(let)):\r\n for i in range(n):\r\n if string[i]==let[act]:\r\n positions[i]=pos\r\n pos+=1\r\n act+=1 \r\n for i in range(n):\r\n if positions[i]<=k:\r\n string[i]=\"\"\r\n print(\"\".join(string))", "n, k = map(int, input().split())\r\ns = input()\r\nls = []\r\nfor i in range(len(s)):\r\n ls.append((s[i], i))\r\nls = sorted(ls, key=lambda x:x[0])[k:]\r\nls.sort(key=lambda x:x[1])\r\nfor x in ls:\r\n print(x[0], end='')\r\n\r\n", "n, k = map(int, input().split())\ns = str(input())\nlst = list(set(list(s)))\nlst.sort()\nfor i in range(len(lst)):\n p = s.count(lst[i])\n if k == 0:\n break\n if p <= k:\n s = s.replace(lst[i], '', p)\n k -= p\n elif p > k:\n s = s.replace(lst[i], '', k)\n k = 0\nprint(s)\n", "n,k=map(int,input().split())\r\ns=input()\r\nl=[0]*26\r\nfor i in s :\r\n l[ord(i)-ord('a')]+=1 \r\ni=0\r\na=[]\r\np=[0,0]\r\nwhile k>0 :\r\n if l[i]<=k :\r\n a.append(chr(ord('a')+i))\r\n k-=l[i]\r\n i+=1 \r\n else :\r\n p=[chr(ord('a')+i),k]\r\n k=0 \r\nans=[]\r\nfor i in s :\r\n if i in a :\r\n pass\r\n elif i==p[0]:\r\n if p[1]>0 :\r\n p[1]-=1 \r\n else :\r\n ans.append(i) \r\n else :\r\n ans.append(i) \r\nprint(\"\".join(ans))", "n,k=map(int,input().split())\r\n# s=(input().strip())\r\n# s,t=input().split()\r\n# t=(input().strip())\r\ns=list(input())\r\n# arr=list(map(int,input().split()))\r\nabc=\"abcdefghijklmnopqrstuvwxyz\"\r\nmp={}\r\nfor i in abc:\r\n mp[i]=0\r\n# print(mp)\r\nfor i in s:\r\n mp[i]+=1\r\n# print(mp)\r\nnew={}\r\nfor i in mp:\r\n if mp[i]>0 and k>0:\r\n if mp[i]<=k:\r\n new[i]=mp[i];k-=mp[i]\r\n else:new[i]=k;k=0\r\nfor i in range(n):\r\n if s[i] in new:\r\n new[s[i]]-=1\r\n if new[s[i]]==0:del new[s[i]]\r\n s[i]=\"\"\r\nprint(\"\".join(s))", "a, b = map(int, input().split())\r\ns = input()\r\n\r\nalph = \"abcdefghijklmnopqrstuvwxyz\"\r\n\r\nfor i in alph:\r\n cnt = s.count(i)\r\n s = s.replace(i, \"\", min(cnt, b))\r\n b -= cnt\r\n if b < 1:\r\n break\r\nprint(s)\r\n", "n,k = map(int, input().split())\r\ns = input()\r\nsi =[]\r\nfor i in range(n):\r\n si.append([i, s[i]])\r\nsi.sort(key=lambda x: x[1])\r\nsi = si[k:]\r\nsi.sort()\r\nfor i in si:\r\n print(i[1], end='')", "n,m=map(int,input().split())\r\ns=input()\r\nlst=[]\r\nfor i in range(n):\r\n lst.append([s[i],i])\r\nlst.sort()\r\nans=[None]*(n)\r\nfor i in range(m,n):\r\n ans[lst[i][1]]=lst[i][0]\r\nfor i in ans:\r\n if i!=None:\r\n print(i,end=\"\")", "al=\"abcdefghijklmnopqrstuvwxyz\"\r\nn,k=[int(x)for x in input().rstrip().split()]\r\na=input()\r\nfor i in al:\r\n c=a.count(i)\r\n a=a.replace(i,\"\",min(c,k))\r\n k-=c\r\n if k<1:\r\n break\r\nprint(a)\r\n", "n, k = map(int, input().split())\r\n\r\narr = list(input())\r\n\r\nnum = [ (arr[i], i) for i in range(len(arr))]\r\n\r\nnum.sort()\r\ndelete = set()\r\nfor i in range(k):\r\n delete.add(num[i][1])\r\n\r\nans = []\r\nfor i in range(len(arr)):\r\n if i not in delete:\r\n ans.append(arr[i])\r\n\r\nprint(\"\".join(ans))\r\n", "from collections import Counter\r\n\r\nn, k = map(int, input().split())\r\ns = input()\r\n# c = Counter(s)\r\n# alphabet = [chr(i) for i in range(97,97+26)]\r\nalph = [(s[i], i) for i in range(len(s))]\r\nalph.sort()\r\nnew_alph = alph[k:]\r\nnew_alph.sort(key = lambda a: a[1])\r\nfor i in range(len(new_alph)):\r\n print(new_alph[i][0], end = '')", "def main():\r\n n, k = map(int, input().split())\r\n s = input()\r\n m = {}\r\n\r\n for i in range(n):\r\n if s[i] in m:\r\n m[s[i]] += 1\r\n else:\r\n m[s[i]] = 1\r\n\r\n for i in range(ord('a'), ord('z') + 1):\r\n char = chr(i)\r\n if char in m and m[char] >= k:\r\n m[char] -= k\r\n k = 0\r\n else:\r\n if char in m:\r\n k -= m[char]\r\n m[char] = 0\r\n\r\n str = \"\"\r\n for i in range(n - 1, -1, -1):\r\n if s[i] in m and m[s[i]] != 0:\r\n str += s[i]\r\n m[s[i]] -= 1\r\n\r\n str = str[::-1]\r\n print(str)\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "#!/usr/bin/env/python\r\n# -*- coding: utf-8 -*-\r\nn, k = list(map(int, input().split()))\r\ns = input()\r\nflag = [1] * n\r\ndc = dict()\r\nfor i in range(n):\r\n if not dc.get(s[i]):\r\n dc[s[i]] = []\r\n dc[s[i]].append(i)\r\nfor i in range(ord('a'), ord('z') + 1):\r\n alp = chr(i)\r\n # print(alp)\r\n if dc.get(alp):\r\n mn = min(k, len(dc[alp]))\r\n for j in range(mn):\r\n flag[dc[alp][j]] = 0\r\n k -= mn\r\n if k == 0:\r\n break\r\nres = ''\r\nfor i in range(n):\r\n if flag[i]:\r\n res += s[i]\r\nprint(res)\r\n\r\n", "n,x=map(int,input().rstrip().split())\r\ns=str(input())\r\na='a'\r\no=0\r\ne=0\r\nwhile o<=26:\r\n if s.count(chr(ord(a)+ o))>=x:\r\n s=s.replace(chr(ord(a) + o), '',x)\r\n break\r\n else:\r\n x-=s.count(chr(ord(a) + o))\r\n s= s.replace(chr(ord(a) + o), '')\r\n o+=1 \r\nprint(s) ", "from collections import defaultdict\r\nd=defaultdict(lambda:0)\r\ndd=defaultdict(lambda:0)\r\n\r\nn,k=map(int,input().split())\r\ns=input()\r\nfor i in s:\r\n d[i]+=1\r\n\r\nfor i in \"abcdefghijklmnopqrstuvwxyz\":\r\n if k==0:\r\n break\r\n if d[i]>0:\r\n if d[i]<=k:\r\n dd[i]=d[i]\r\n d[i]=0\r\n k-=dd[i]\r\n else:\r\n dd[i]=k\r\n d[i]-=k\r\n k=0\r\n# print(dict(d))\r\n# print(dict(dd))\r\nfor i in s:\r\n if dd[i]>0:\r\n dd[i]-=1\r\n else:\r\n print(i,end=\"\")\r\n\r\n# ind=ord('a')\r\n# while(k):\r\n# while(d[chr(ind)]==0):\r\n# ind+=1\r\n# d[chr(ind)]-=1\r\n# k-=1\r\n# ans=\"\"\r\n#\r\n# for i in s[::-1]:\r\n# if(d[i]>0):\r\n# ans=i+ans\r\n# d[i]-=1\r\n# print(ans)", "n, k = map(int, input().split())\r\nx = input()\r\na = []\r\nfor i in range(97, 123):\r\n a.append(x.count(chr(i)))\r\ncnt = 0\r\nfor j in range(26):\r\n k -= a[j]\r\n cnt += 1\r\n if k < 0:\r\n k += a[j]\r\n cnt -= 1\r\n break\r\nans = []\r\nfor l in range(n):\r\n if ord(x[l]) == 97 + cnt:\r\n if k != 0:\r\n k -= 1\r\n else:\r\n ans.append(x[l])\r\n elif ord(x[l]) > 97 + cnt:\r\n ans.append((x[l]))\r\nprint(*ans, sep='')", "n,k = map(int, input().split())\r\ns = list(zip([i for i in range(n)],input()))\r\ns.sort(key=lambda x: x[1])\r\ns = s[k:]\r\ns.sort()\r\nfor i in s:\r\n print(i[1], end='')", "from operator import itemgetter\n\n[n, k] = [int(i) for i in input().split()]\nsymbols = list(input())\n\nenumer_symb = list(zip(symbols, list(range(n))))\nsorted_symb = sorted(enumer_symb, key=itemgetter(0))[k:]\ndouble_sorted_symb = sorted(sorted_symb, key=itemgetter(1))\nresult = ''\nprint(''.join(i[0] for i in double_sorted_symb))\n\n\n", "# Wadea #\r\n\r\nn,k = map(int,input().split())\r\narr = list(input())\r\nd = {'a': 0, 'b': 0, 'c': 0, 'd': 0, 'e': 0, 'f': 0, 'g': 0, 'h': 0, 'i': 0, 'j': 0, 'k': 0, 'l': 0, 'm': 0, 'n': 0, 'o': 0, 'p': 0, 'q': 0, 'r': 0, 's': 0, 't': 0, 'u': 0, 'v': 0, 'w': 0, 'x': 0, 'y': 0, 'z': 0}\r\nfor i in arr:\r\n if i in d:\r\n d[i] += 1\r\n else:d[i] = 1\r\n\r\nif n == k:print()\r\nelse:\r\n for j in d:\r\n l = 0\r\n while d[j] > 0 and l < n and k > 0:\r\n if arr[l] == j:\r\n d[j] -= 1\r\n arr[l] = \"\"\r\n k -= 1\r\n l += 1\r\n if k == 0:\r\n break\r\n print(\"\".join(arr))\r\n " ]

[ "n = int(input())\na = [int(i) for i in input().split()]\nl = [i for i in range(len(a))]\nr = [i for i in range(len(a))]\nfor i in range(len(a)):\n\twhile l[i]>=1 and a[i]|a[l[i]-1]<=a[i]:\n\t\tl[i] = l[l[i]-1]\n \nfor j in range(len(a)):\n\ti = len(a)-j-1\n\twhile r[i]<len(a)-1 and a[i]|a[r[i]+1]<=a[i] and a[i]>a[r[i]+1]:\n\t\tr[i] = r[r[i]+1]\n \ncount=0\nfor i in range(len(a)):\n\tx = r[i]-i+1\n\ty = i-l[i]+1\n\tcount+=x*y-1\nprint((n*(n-1))//2-count)\n \t\t \t\t\t \t\t \t \t \t\t\t\t\t\t \t \t \t", "from collections import defaultdict\r\n\r\n\r\ndef read_ints():\r\n return map(int, input().split())\r\n\r\n\r\ndef read_int():\r\n return int(input())\r\n\r\n\r\ndef yes_no(yes):\r\n print('Yes' if yes else 'No')\r\n return yes\r\n\r\n\r\ndef solve_test():\r\n n = read_int()\r\n a = list(read_ints())\r\n\r\n def get_ans():\r\n bit_size = 32\r\n lefts = [[-1] * n for _ in range(bit_size)]\r\n rights = [[n] * n for _ in range(bit_size)]\r\n\r\n for i in range(n):\r\n value = a[i]\r\n for bit in range(bit_size):\r\n if i > 0:\r\n lefts[bit][i] = lefts[bit][i - 1]\r\n\r\n has = value % 2 == 1\r\n if has:\r\n lefts[bit][i] = i\r\n\r\n value //= 2\r\n\r\n for i in range(n - 1, -1, -1):\r\n value = a[i]\r\n for bit in range(bit_size):\r\n if i < n - 1:\r\n rights[bit][i] = rights[bit][i + 1]\r\n\r\n has = value % 2 == 1\r\n if has:\r\n rights[bit][i] = i\r\n\r\n value //= 2\r\n\r\n left_larger = [-1] * n\r\n right_larger = [n] * n\r\n\r\n stack = [-1]\r\n for i in range(n):\r\n value = a[i]\r\n while len(stack) > 1:\r\n top_value = a[stack[-1]]\r\n if top_value < value:\r\n stack.pop()\r\n else:\r\n break\r\n \r\n left_larger[i] = stack[-1]\r\n stack.append(i)\r\n\r\n stack = [n]\r\n for i in range(n - 1, -1, -1):\r\n value = a[i]\r\n while len(stack) > 1:\r\n top_value = a[stack[-1]]\r\n if top_value <= value:\r\n stack.pop()\r\n else:\r\n break\r\n \r\n right_larger[i] = stack[-1]\r\n stack.append(i)\r\n\r\n ans = 0\r\n for i in range(n):\r\n value = a[i]\r\n\r\n start = left_larger[i] + 1\r\n end = right_larger[i] - 1\r\n\r\n max_left = start - 1\r\n min_right = end + 1\r\n\r\n for bit in range(bit_size):\r\n has = value % 2 == 1\r\n if not has:\r\n max_left = max(max_left, lefts[bit][i])\r\n min_right = min(min_right, rights[bit][i])\r\n value //= 2\r\n\r\n total = (end - i + 1) * (i - start + 1)\r\n bad = (min_right - i) * (i - max_left)\r\n\r\n # print(total, bad)\r\n ans += total - bad\r\n\r\n return ans\r\n\r\n\r\n \r\n print(get_ans())\r\n \r\n\"\"\"\r\n5\r\n3 2 1 6 5\r\n\r\n4\r\n3 3 3 3\r\n\r\n\"\"\"\r\n\r\n\"\"\"\r\n8\r\n0\r\n\"\"\"\r\n\r\ndef solve():\r\n t = 1\r\n # t = read_int()\r\n for _ in range(t):\r\n solve_test()\r\n\r\nif __name__ == '__main__':\r\n solve()", "import os,io,sys\r\ninput=io.BytesIO(os.read(0,os.fstat(0).st_size)).readline\r\nn=int(input())\r\na=list(map(int,input().split()))\r\nleft=[]\r\nright=[]\r\nfor i in range(31):\r\n left.append([-1]*n)\r\n right.append([n]*n)\r\nfor i in range(n):\r\n for j in range(31):\r\n if 1<<j&a[i]:\r\n left[j][i]=i\r\n else:\r\n if i>0:\r\n left[j][i]=left[j][i-1]\r\nfor i in range(n-1,-1,-1):\r\n for j in range(31):\r\n if 1<<j&a[i]:\r\n right[j][i]=i\r\n else:\r\n if i<n-1:\r\n right[j][i]=right[j][i+1]\r\nans=(n*(n-1))//2\r\nans+=n\r\nlastsame=[-1]*n\r\ndic={}\r\nfor i in range(n):\r\n if a[i] in dic:\r\n lastsame[i]=dic[a[i]]\r\n dic[a[i]]=i\r\n else:\r\n dic[a[i]]=i\r\nfor i in range(n):\r\n maxleft=-1\r\n minright=n\r\n for j in range(31):\r\n if not(1<<j&a[i]):\r\n maxleft=max(maxleft,left[j][i])\r\n minright=min(minright,right[j][i])\r\n if lastsame[i]>maxleft:\r\n maxleft=lastsame[i]\r\n ans-=(i-maxleft)*(minright-i)\r\nprint(ans)", "n = int(input())\r\na = [int(i) for i in input().split()]\r\nl = [int(i) for i in range(len(a))]\r\nr = [int(i) for i in range(len(a))]\r\nfor i in range(n):\r\n\twhile l[i] >= 1 and a[i] | a[l[i] - 1] <= a[i]:\r\n\t\tl[i] = l[l[i] - 1]\r\nfor i in range(n)[::-1]:\r\n\twhile r[i] < n - 1 and a[i] | a[r[i] + 1] <= a[i] and a[i] > a[r[i] + 1]:\r\n\t\tr[i] = r[r[i] + 1]\r\nprint(int(n * (n + 1) / 2 - sum((r[i] - i + 1) * (i - l[i] + 1) for i in range(n))))# 1692439533.5944054" ]

[ "from collections import defaultdict\nn, k = [int(x) for x in input().split()]\na = [int(x) for x in input().split()]\nwindow = defaultdict(lambda : 0)\nwindow[a[0]] += 1\ni, j, ans = 0, 0, 0\nwhile i < n and j < n:\n if window[a[j]] >= k:\n ans += n-j\n window[a[i]] -= 1\n i += 1\n elif j < n-1:\n window[a[j+1]] += 1\n j += 1\n else: break\n\nprint(ans)\n", "def count_subarrays(n, k, arr):\n count = 0\n freq = {}\n left = 0\n for right in range(n):\n freq[arr[right]] = freq.get(arr[right], 0) + 1\n\n while left <= right and freq[arr[right]] >= k:\n count += n - right\n freq[arr[left]] -= 1\n left += 1\n\n return count\n\nn, k = map(int, input().split())\narr = list(map(int, input().split()))\n\nresult = count_subarrays(n, k, arr)\nprint(result)\n", "def add(el, uniq_arr):\n if el in uniq_arr:\n uniq_arr[el] += 1\n else:\n uniq_arr[el] = 1\n\ndef good(cnt, ok, l, r):\n return cnt >= ok and l <= r\n\ndef remove(el, uniq_arr):\n uniq_arr[el] -= 1\n\n\nif __name__ == '__main__':\n\n arr_len, k = [int(i) for i in input().split()]\n arr = [int(i) for i in input().split()]\n\n i = 0\n result = 0\n elements = {}\n count = 0\n for j in range(arr_len):\n till_end = arr_len - j\n add(arr[j], elements)\n count = elements[arr[j]]\n if count == k:\n result += till_end\n while good(count, k, i, j):\n remove(arr[i], elements)\n i += 1\n count = elements[arr[j]]\n if count == k:\n result += till_end\n\n print(result)\n", "# https://codeforces.com/problemset/problem/190/D?locale=en\r\ncounter = {}\r\nresult = 0\r\nstart_index = 0\r\n\r\n\r\nn, k = map(int, input().split())\r\nnumbers = [int(x) for x in input().split()]\r\n\r\ntotal = 0\r\n\r\nfor i in range(n):\r\n if numbers[i] in counter:\r\n counter[numbers[i]] += 1\r\n else:\r\n counter[numbers[i]] = 1\r\n\r\n while start_index <= i and k <= counter[numbers[i]]:\r\n counter[numbers[start_index]] -= 1\r\n result += n - i\r\n start_index += 1\r\n\r\nprint(result)", "import math\r\nimport sys\r\nimport time\r\nfrom bisect import bisect_left, bisect_right\r\nfrom collections import Counter, deque, defaultdict\r\nfrom itertools import permutations\r\n\r\ninput = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\r\n\r\n\r\ndef I():\r\n return input()\r\n\r\n\r\ndef ii():\r\n return int(input())\r\n\r\n\r\ndef li():\r\n return list(input().split())\r\n\r\n\r\ndef mi():\r\n return map(int, input().split())\r\n\r\n\r\ndef gmi():\r\n return map(lambda x: int(x) - 1, input().split())\r\n\r\n\r\ndef lgmi():\r\n return list(map(lambda x: int(x) - 1, input().split()))\r\n\r\n\r\ndef lii():\r\n return list(map(int, input().split()))\r\n\r\n\r\nn,k = mi()\r\na = lii()\r\nr = 0\r\ncnt = 0\r\nmp = Counter()\r\nL = [-1] * (1 + n)\r\nfor i in range(n):\r\n while r < n and cnt == 0:\r\n mp[a[r]] += 1\r\n if mp[a[r]] == k:\r\n cnt += 1\r\n r += 1\r\n if cnt != 0:\r\n L[i] = r - 1\r\n if mp[a[i]] == k:\r\n cnt -= 1\r\n mp[a[i]] -= 1\r\nans = 0\r\nr = 0\r\nfor i in range(n):\r\n while r < i:\r\n r += 1\r\n while r < n and L[r] == -1:\r\n r += 1\r\n if r < n:\r\n ans += n - L[r]\r\nprint(ans)\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "nk=list(map(int,input().split()))\r\nmsg=list(map(int,input().split()))\r\nn,k=nk[0],nk[1]\r\nhash= {}\r\nres = 0\r\nl = 0\r\nfor r in range(len(msg)):\r\n hash[msg[r]] = hash.get(msg[r], 0 ) + 1\r\n while hash[msg[r]] == k:\r\n res += len(msg) - r\r\n hash[msg[l]] -= 1\r\n l += 1\r\nprint(res)\r\n\r\n\r\n", "import sys\r\nfrom collections import Counter\r\n\r\ninput = lambda: sys.stdin.readline().strip()\r\nprint = lambda d: sys.stdout.write(str(d) + \" \")\r\nread = lambda: list(map(int, input().split()))\r\nn, k = map(int, input().split())\r\na = read()\r\nans = 0\r\nc = Counter()\r\ncnt = False\r\nl = r = 0\r\nwhile r < n:\r\n c[a[r]] += 1\r\n if c[a[r]] == k:\r\n cnt = True\r\n while l < n and c[a[r]] >= k:\r\n c[a[l]] -= 1\r\n l += 1\r\n if cnt:\r\n ans += l\r\n r += 1\r\nprint(ans)\r\n", "import random\r\nimport sys\r\n\r\n\r\nclass FastIO:\r\n def __init__(self):\r\n return\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 st(x):\r\n return print(x)\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, k = ac.read_ints()\r\n seed = random.randint(1, 10**9)\r\n nums = ac.read_list_ints()\r\n dct = dict()\r\n ans = j = flag = 0\r\n for i in range(n):\r\n while j < n and not flag:\r\n dct[nums[j] ^ seed] = dct.get(nums[j] ^ seed, 0) + 1\r\n if dct[nums[j] ^ seed] == k:\r\n flag = 1\r\n j += 1\r\n if flag:\r\n ans += n - j + 1\r\n dct[nums[i] ^ seed] -= 1\r\n if dct[nums[i] ^ seed] == k - 1:\r\n flag = 0\r\n if not dct[nums[i] ^ seed]:\r\n del dct[nums[i] ^ seed]\r\n ac.st(ans)\r\n return\r\n\r\n\r\nSolution().main()\r\n", "import sys\r\ninput = lambda:sys.stdin.readline().strip()\r\nM = lambda:map(int,input().split())\r\nfrom collections import Counter\r\nn,k = M()\r\narr = list(M())\r\na = ans = 0\r\naa = Counter()\r\nfor i,x in enumerate(arr):\r\n aa[x] += 1\r\n while aa[x] >= k:\r\n aa[arr[a]] -= 1\r\n a += 1\r\n ans += a\r\nprint(ans)\r\n", "def get_input():\n lines = []\n user_input = input()\n\n for i in user_input.split():\n lines.append(int(i))\n\n return lines\n\n\narr_count, border = get_input()\narray = get_input()\n\n\ndef addtosub(n: int):\n if n in sub_dict_counter:\n sub_dict_counter[n] += 1\n else:\n sub_dict_counter[n] = 1\n\n\ndef removesub(n: int):\n if n in sub_dict_counter:\n sub_dict_counter[n] -= 1\n else:\n sub_dict_counter[n] = 0\n\n\nr = 0\nl = 0\nnum = 0\nsub_dict_counter = {}\n\nwhile r < arr_count:\n addtosub(array[r])\n while l < arr_count and sub_dict_counter[array[r]] >= border:\n num += (arr_count - r)\n removesub(array[l])\n l += 1\n r += 1\n\nprint(num)\n", "n, k = map(int, input().split())\r\na = [int(_) for _ in input().split()]\r\n \r\nmp = {}\r\nres = 0\r\npos = 0\r\nt = 0\r\n \r\nfor i in range(0, n):\r\n if a[i] in mp:\r\n mp[a[i]] += 1\r\n else:\r\n mp[a[i]] = 1\r\n \r\n while pos <= i and k <= mp[a[i]]:\r\n mp[a[pos]] -= 1\r\n res += n - i\r\n pos += 1\r\nprint(res)", "# https://codeforces.com/contest/190\n\nimport sys\nfrom collections import Counter\n\ninput = lambda: sys.stdin.readline().rstrip() # faster!\n\nn, k = map(int, input().split())\na = list(map(int, input().split()))\n\nans = 0\n\ncnt = Counter()\ncnt[a[0]] += 1\n\ni, j = 0, 0\nwhile j < n and cnt[a[j]] < k:\n j += 1\n if j < n:\n cnt[a[j]] += 1\n\nif j == n:\n print(ans)\n exit()\nelse:\n ans += n - j\n\nfor i in range(1, n):\n cnt[a[i - 1]] -= 1\n while j < n and cnt[a[j]] < k:\n j += 1\n if j < n:\n cnt[a[j]] += 1\n if j == n:\n print(ans)\n exit()\n else:\n ans += n - j\n\nprint(ans)\n", "if __name__ == '__main__':\n\n arr_len, k = [int(i) for i in input().split()]\n arr = [int(i) for i in input().split()]\n\n i = 0\n result = 0\n elements = {}\n for j in range(arr_len):\n till_end = arr_len - j\n if arr[j] in elements:\n elements[arr[j]] += 1\n else:\n elements[arr[j]] = 1\n count = elements[arr[j]]\n if count == k:\n result += till_end\n while count >= k and i <= j:\n elements[arr[i]] -= 1\n i += 1\n count = elements[arr[j]]\n if count == k:\n result += till_end\n\n print(result)\n", "# Problem: D. Non-Secret Cypher\r\n# Contest: Codeforces - Codeforces Round 120 (Div. 2)\r\n# URL: https://codeforces.com/problemset/problem/190/D\r\n# Memory Limit: 256 MB\r\n# Time Limit: 3000 ms\r\n\r\nimport sys\r\nimport random\r\nfrom types import GeneratorType\r\nimport bisect\r\nimport io, os\r\nfrom bisect import *\r\nfrom collections import *\r\nfrom contextlib import redirect_stdout\r\nfrom itertools import *\r\nfrom array import *\r\nfrom functools import lru_cache, reduce\r\nfrom heapq import *\r\nfrom math import sqrt, gcd, inf\r\nif sys.version >= '3.8': # ACW没有comb\r\n from math import comb\r\n\r\nRI = lambda: map(int, sys.stdin.buffer.readline().split())\r\nRS = lambda: map(bytes.decode, sys.stdin.buffer.readline().strip().split())\r\nRILST = lambda: list(RI())\r\nDEBUG = lambda *x: sys.stderr.write(f'{str(x)}\\n')\r\n# print = lambda d: sys.stdout.write(str(d) + \"\\n\") # 打开可以快写，但是无法使用print(*ans,sep=' ')这种语法,需要print(' '.join(map(str, p)))，确实会快。\r\n\r\nDIRS = [(0, 1), (1, 0), (0, -1), (-1, 0)] # 右下左上\r\nDIRS8 = [(0, 1), (1, 1), (1, 0), (1, -1), (0, -1), (-1, -1), (-1, 0),\r\n (-1, 1)] # →↘↓↙←↖↑↗\r\nRANDOM = random.randrange(2**62)\r\nMOD = 10**9 + 7\r\nPROBLEM = \"\"\"https://codeforces.com/problemset/problem/190/D\r\n\r\n输入 n k(1≤k≤n≤4e5) 和长为 n 的数组 a(1≤a[i]≤1e9)。\r\n统计有多少个连续子数组 b，满足 b 中有至少 k 个数都相同。\r\n输入\r\n4 2\r\n1 2 1 2\r\n输出 3\r\n\r\n输入\r\n5 3\r\n1 2 1 1 3\r\n输出 2\r\n\r\n输入\r\n3 1\r\n1 1 1\r\n输出 6\r\n\"\"\"\r\n\r\n\r\n\r\n# ms\r\ndef solve():\r\n n, k = RI()\r\n a = RILST()\r\n pos = defaultdict(list)\r\n for i,v in enumerate(a):\r\n pos[v].append(i)\r\n ans = 0\r\n cnt = Counter()\r\n l = 0\r\n for i,v in enumerate(a):\r\n cnt[v] += 1\r\n while cnt[v] >= k:\r\n cnt[a[l]] -= 1\r\n l += 1\r\n ans += l\r\n print(ans)\r\n\r\nif __name__ == '__main__':\r\n t = 0\r\n if t:\r\n t, = RI()\r\n for _ in range(t):\r\n solve()\r\n else:\r\n solve()\r\n", "'''\r\nhttps://codeforces.com/problemset/problem/190/D\r\n\r\n输入 n k(1≤k≤n≤4e5) 和长为 n 的数组 a(1≤a[i]≤1e9)。\r\n统计有多少个连续子数组 b，满足 b 中有至少 k 个数两两相同。\r\n输入\r\n4 2\r\n1 2 1 2\r\n输出 3\r\n\r\n输入\r\n5 3\r\n1 2 1 1 3\r\n输出 2\r\n\r\n输入\r\n3 1\r\n1 1 1\r\n输出 6\r\n'''\r\n\r\n'''\r\nhttps://codeforces.com/contest/190/submission/207941420\r\n\r\n同向双指针。\r\n\r\n固定右端点 right，移动左端点 left，让子数组中至多有一个数出现 k 次。\r\n如果已经出现了 k 个相同的数，那么 [left', right] 都是符合要求的，其中 left' <= left。\r\n'''\r\n\r\n\r\n\r\n\r\nfrom collections import Counter\r\ndef _n():\r\n return int(input())\r\n\r\n\r\ndef _nA():\r\n return list(map(int, input().split()))\r\n\r\n\r\ndef _nS():\r\n return input().split()\r\n\r\n\r\ndef solve():\r\n n, k = _nA()\r\n a = _nA()\r\n c = Counter()\r\n l = 0\r\n f = 0\r\n ret = 0\r\n for v in a:\r\n c[v] += 1\r\n while c[v] > k or (c[v] == k and a[l] != v):\r\n c[a[l]] -= 1\r\n l += 1\r\n if c[v] == k:\r\n f = 1\r\n if f:\r\n ret += (l+1)\r\n print(ret)\r\n\r\nsolve()\r\n", "import os,sys,collections,heapq,itertools\r\nif os.path.exists('in.txt'):\r\n file = open('in.txt') \r\n input = file.readline \r\nelse : \r\n input = sys.stdin.readline \r\nfrom functools import reduce \r\nfrom itertools import accumulate,chain,combinations,count \r\nfrom itertools import groupby,permutations,product,zip_longest\r\nfrom heapq import heapify,heappush,heappop,heapreplace,merge,nlargest,nsmallest\r\nfrom collections import Counter,defaultdict,deque \r\nfrom bisect import bisect_left, bisect_right\r\nfrom math import comb,floor,ceil,inf ,gcd ,sqrt \r\nimport functools \r\nreadi = lambda: int(input()) \r\nreadis = lambda: list(map(int,input().split()))\r\nreads = lambda: input().rstrip() \r\nreadss = lambda: input().split() \r\ndef solution(): \r\n n , k = readis() \r\n a = readis() \r\n C = Counter() \r\n j = 0 \r\n mx = 0 \r\n res = 0 \r\n for i in range(n):\r\n while j < n and mx < k :\r\n C[a[j]] += 1 \r\n if C[a[j]] > mx : mx = C[a[j]] \r\n j += 1 \r\n if mx < k : break \r\n res += n + 1 - j \r\n C[a[i]] -= 1 \r\n if C[a[i]] == mx - 1 : mx -= 1 \r\n print(res)\r\nfor i in range(1):\r\n solution() ", "n, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\nd = {a[0]: 1}\r\nleft = 0\r\nright = 1\r\nm = 0\r\nwhile left < n:\r\n while right < n and d[a[right - 1]] < k:\r\n if a[right] in d.keys():\r\n d[a[right]] += 1\r\n else:\r\n d[a[right]] = 1\r\n right += 1\r\n if d[a[right - 1]] >= k:\r\n m += n - right + 1\r\n d[a[left]] -= 1\r\n left += 1\r\nprint(m)\r\n", "# https://www.acwing.com/blog/content/34755/\r\n\r\ndef solve():\r\n n, m = map(int, input().split())\r\n w = [int(i) for i in input().split()]\r\n w.insert(0, 0)\r\n \r\n g = {}\r\n res, cnt = 0, 0\r\n j = 0\r\n for i in range(1, n + 1):\r\n g[w[i]] = g.get(w[i], 0) + 1\r\n if g[w[i]] == m: cnt += 1\r\n while j < i:\r\n g[w[j + 1]] = g[w[j + 1]] - 1\r\n if g[w[j + 1]] == m - 1: cnt -= 1\r\n if cnt == 0:\r\n if g[w[j + 1]] == m - 1: cnt += 1\r\n g[w[j + 1]] = g[w[j + 1]] + 1\r\n break\r\n else: j += 1\r\n \r\n if cnt > 0: res += j + 1\r\n print(res)\r\n \r\n\r\ndef main():\r\n solve()\r\n\r\nif __name__ == '__main__':\r\n main()", "# coding=utf-8\r\nfrom collections import *\r\n\r\n\r\nif __name__ == \"__main__\":\r\n n, k = map(int, input().split())\r\n a = list(map(int, input().split()))\r\n ans = l = val = 0\r\n cnt = defaultdict(int)\r\n for v in a:\r\n cnt[v] += 1\r\n while cnt[v] >= k:\r\n cnt[a[l]] -= 1\r\n l += 1\r\n ans += l\r\n print(ans)\r\n", "from bisect import bisect_left, bisect_right\r\nfrom collections import Counter, deque\r\nfrom functools import lru_cache\r\nfrom math import factorial, comb, sqrt, gcd, lcm, log2\r\nfrom copy import deepcopy\r\nimport heapq\r\n\r\nfrom sys import stdin, stdout\r\n\r\n\r\ninput = stdin.readline\r\n\r\n\r\ndef main():\r\n n, k = map(int, input().split())\r\n L = list(map(int, input().split()))\r\n dic = Counter()\r\n ans = 0\r\n i, j = 0, 0\r\n max_count = 0\r\n while j < n:\r\n while j < n and max_count < k:\r\n dic[L[j]] += 1\r\n max_count = max(max_count, dic[L[j]])\r\n j += 1\r\n while max_count == k:\r\n ans += n - j + 1\r\n if dic[L[i]] == max_count:\r\n max_count -= 1\r\n dic[L[i]] -= 1\r\n i += 1\r\n print(ans)\r\n\r\n\r\n\r\n\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n, k = map(int, input().split())\r\na = [int(el) for el in input().split()]\r\nm = 0\r\ncounter = {}\r\nl, ll = 0, 0\r\n\r\nif k == 1:\r\n print(int(n * (n + 1) / 2))\r\nelse:\r\n for i in range(n):\r\n counter.setdefault(a[i], [0])[0] += 1\r\n counter[a[i]] += [i]\r\n if counter[a[i]][0] == k:\r\n if counter[a[i]][1] >= l:\r\n l = counter[a[i]][1]\r\n m += (l - ll + 1) * (n - i)\r\n ll = l + 1\r\n counter[a[i]][0:2] = [k - 1]\r\n print(m)\r\n", "import sys\r\ninput = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\r\nfrom collections import defaultdict\r\nn, k = map(int, input().split())\r\narr = list(map(int, input().split()))\r\nd = defaultdict(list)\r\nprev = []\r\nfor i, v in enumerate(arr):\r\n d[v].append(i)\r\n prev.append(d[v][-k] if len(d[v]) >= k else -1)\r\ntot = 0\r\nl, r = 0, 0\r\nwhile r < n:\r\n if prev[r] >= l:\r\n tot += n - r\r\n l += 1\r\n else:\r\n r += 1\r\nprint(tot)\r\n", "\nfrom bisect import bisect_left\nfrom collections import defaultdict\n\nn, k = map(int, input().split())\na = list(map(int, input().split()))\n\nidx = defaultdict(list)\nfor i, x in enumerate(a):\n idx[x].append(i)\n\nres, mn = 0, n\ndp = [n] * n\n\nfor i in range(n - 1, -1, -1):\n\n x = a[i]\n\n j = bisect_left(idx[x], i)\n\n if j + k - 1 < len(idx[x]):\n mn = min(mn, idx[x][j + k - 1])\n\n dp[i] = mn \n res += n - dp[i]\n\nprint(res)\n\n", "import sys\r\nfrom collections import *\r\nRI = lambda: map(int, sys.stdin.buffer.readline().split())\r\n\r\nn, k = RI()\r\nnums = list(RI())\r\nr = -1\r\nans = 0\r\nc = Counter()\r\nwin = False\r\nfor l in range(n):\r\n while r + 1 < n and c[nums[r + 1]] < k and not win:\r\n r += 1\r\n c[nums[r]] += 1\r\n if c[nums[r]] == k:\r\n win = True\r\n\r\n if win:\r\n ans += n - r\r\n\r\n if c[nums[l]] == k:\r\n win = False\r\n c[nums[l]] -= 1\r\n\r\nprint(ans)", "from collections import defaultdict\r\ndef main():\r\n n, k = map(int, input().split())\r\n elements = list(map(int, input().split()))\r\n\r\n countOf = defaultdict(int)\r\n count = defaultdict(set)\r\n\r\n left , ans = 0, 0\r\n \r\n for right in range(n):\r\n if elements[right] in count[countOf[elements[right]]]:\r\n count[countOf[elements[right]]].remove(elements[right])\r\n \r\n countOf[elements[right]] += 1\r\n count[countOf[elements[right]]].add(elements[right])\r\n \r\n while left <= right and k in count and count[k]:\r\n if elements[left] in count[countOf[elements[left]]]:\r\n count[countOf[elements[left]]].remove(elements[left])\r\n \r\n countOf[elements[left]] -= 1\r\n count[countOf[elements[left]]].add(elements[left])\r\n left += 1\r\n \r\n if left > 0:\r\n ans += (left)\r\n print(ans)\r\nmain()\r\n", "import sys\r\ninput = lambda:sys.stdin.readline().strip()\r\nn,k = map(int,input().split())\r\narr = list(map(int,input().split()))\r\na = ans = 0\r\naa = {}\r\nfor i in range(n):\r\n aa[arr[i]] = aa.get(arr[i],0)+1\r\n while aa[arr[i]] >= k:\r\n aa[arr[a]] -= 1\r\n a += 1\r\n ans += a\r\nprint(ans)\r\n", "\r\ndef find_subarrays(n, k, a):\r\n total_arrays = n * (n+1) // 2 # getting total number of subarrays by using a formula of arithmetic progression\r\n\r\n # calculating number of subarrays that number of less than k dups\r\n cnt_dict = {} # to count a number of digits -> cnt[idx] = value where 'index' is a digit and 'value' is its count\r\n subarrays_under_k = 0 # to keep an ongoing stats of number of subarrays with less than k dups\r\n flag, j = 0, 0\r\n\r\n def good():\r\n return flag == 0\r\n\r\n def add(number):\r\n nonlocal flag\r\n cnt_dict[number] = cnt_dict.get(number, 0) + 1\r\n if cnt_dict[number] == k:\r\n flag = 1\r\n\r\n def remove(number):\r\n nonlocal flag\r\n cnt_dict[number] = cnt_dict.get(number, 0) - 1\r\n if cnt_dict[number] == k - 1:\r\n flag = 0\r\n\r\n for i in range(n):\r\n number = a[i]\r\n add(number)\r\n while not good():\r\n number = a[j]\r\n remove(number)\r\n j += 1\r\n\r\n m = i - j + 1\r\n subarrays_under_k = subarrays_under_k + m\r\n\r\n # returning a difference between total number of subarrays and subarrays that have less than K number of dups\r\n return total_arrays - subarrays_under_k\r\n#\r\nn_str, k_str = input().split()\r\narr_str = input().split()\r\nn = int(n_str)\r\nk = int(k_str)\r\narr = [int(elem) for elem in arr_str]\r\n\r\nprint(find_subarrays(n, k, arr))\r\n", "import random\r\nimport sys\r\nfrom math import gcd, lcm, sqrt, isqrt, perm\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\nMOD = 10**9+7\r\n\r\ndef solve():\r\n n, k = MII()\r\n a = LII()\r\n cnt = Counter()\r\n left = res = 0\r\n for right, x in enumerate(a):\r\n cnt[x] += 1\r\n while cnt[x] >= k:\r\n cnt[a[left]] -= 1\r\n left += 1\r\n res += left\r\n print(res)\r\n return\r\n\r\nsolve()\r\n", "n, k = map(int, input().split())\r\n*nums, = map(int, input().split())\r\ndef f(nums, k):\r\n l = r = 0\r\n from collections import defaultdict\r\n hm = defaultdict(int)\r\n res = 0\r\n cnt = 0\r\n while r < len(nums):\r\n hm[nums[r]] += 1\r\n while hm[nums[r]] == k:\r\n hm[nums[l]] -= 1\r\n l += 1\r\n res += r - l + 1\r\n cnt += r + 1\r\n r += 1\r\n return cnt - res\r\nprint(f(nums, k))", "from collections import Counter\r\n\r\nv = list(map(int, input().split()))\r\nn, k = v[0], v[1]\r\na = list(map(int, input().split()))\r\n\r\ncntMap = Counter()\r\ntotalMap = Counter()\r\nl = r = 0\r\nmark = False\r\nans = 0\r\nwhile r < n:\r\n cntMap[a[r]] += 1\r\n if cntMap[a[r]] > 1:\r\n totalMap[cntMap[a[r]] - 1] -= 1\r\n totalMap[cntMap[a[r]]] += 1\r\n if cntMap[a[r]] == k: mark = True\r\n while mark and l < n:\r\n x = cntMap[a[l]] ###减之前数量\r\n b = x - 1 ###减之后数量\r\n c = totalMap[x] - 1\r\n d = totalMap[b] + 1\r\n if x == k and totalMap[k] == 1:\r\n break\r\n else:\r\n cntMap[a[l]] = b\r\n totalMap[x] -= 1\r\n totalMap[b] += 1\r\n l += 1\r\n if mark:\r\n ans += l + 1\r\n r += 1\r\nprint(ans)\r\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, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\ncnt = defaultdict(lambda : 0)\r\nans = 0\r\nj = 0\r\nma = 0\r\nfor i in range(n):\r\n while j < n and cnt[ma] < k:\r\n aj = a[j]\r\n cnt[aj] += 1\r\n j += 1\r\n if cnt[aj] == k:\r\n ma = aj\r\n break\r\n if cnt[ma] >= k:\r\n ans += n - j + 1\r\n cnt[a[i]] -= 1\r\nprint(ans)", "from collections import defaultdict\r\n\r\nif __name__ == \"__main__\":\r\n n, k = map(int, input().split())\r\n a = list(map(int, input().split()))\r\n d = defaultdict(int)\r\n l = r = 0\r\n res = 0\r\n while r < n:\r\n d[a[r]] += 1\r\n \r\n while d[a[r]] >= k:\r\n res += n-r\r\n d[a[l]] -= 1\r\n l += 1\r\n r += 1\r\n \r\n print(res)", "class ItemCounter:\r\n def __init__(self, k):\r\n self.cnt = {}\r\n self.currentFrequency = 0\r\n self.frequency = k\r\n\r\n def add(self, x):\r\n if x not in self.cnt:\r\n self.cnt[x] = 0\r\n\r\n if self.cnt[x] == self.frequency:\r\n self.currentFrequency += 1\r\n\r\n self.cnt[x] += 1\r\n\r\n\r\n\r\n def remove(self, x):\r\n self.cnt[x] -= 1\r\n\r\n if self.cnt[x] == self.frequency:\r\n self.currentFrequency -= 1\r\n\r\n\r\nn, k = map(int, input().split())\r\n\r\nnumbers = list(map(int, input().split()))\r\n\r\nitemCounter = ItemCounter(k - 1)\r\nlast = 0\r\nans = 0\r\n\r\nfor right in range(n):\r\n itemCounter.add(numbers[right])\r\n\r\n while itemCounter.currentFrequency > 0:\r\n itemCounter.remove(numbers[last])\r\n last += 1\r\n\r\n ans += last\r\n\r\n\r\nprint(ans)", "def answer():\n\n ans,count,j=0,0,0\n\n d=dict()\n \n\n for i in range(n):\n\n while(j==0 or d[a[j-1]] < k):\n if(j==n):\n j+=1\n break\n\n try:d[a[j]]+=1\n except:d[a[j]]=1\n\n count += 1\n\n m=n-count+1\n\n j+=1\n\n if(j > n):break\n\n ans+=m\n\n d[a[i]] -= 1\n\n return ans\n\n\nn,k=map(int,input().split())\na=list(map(int,input().split()))\n\n\nprint(answer())\n\n\t\t\t \t \t\t \t\t \t \t\t\t\t \t\t", "nk=list(map(int,input().split()))\r\nmsg=list(map(int,input().split()))\r\ncnts={}\r\nn,k=nk[0],nk[1]\r\nres=0\r\nl=0\r\nfor r in range(n):\r\n cnts[msg[r]]=cnts.get(msg[r],0)+1\r\n while msg[r] in cnts and cnts[msg[r]]==k:\r\n res+=(n-r)\r\n cnts[msg[l]]-=1\r\n\r\n if cnts[msg[l]]==0:\r\n cnts.pop(msg[l])\r\n l+=1 \r\nprint(res)\r\n \r\n \r\n", "n, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\nans = n*(n + 1)//2\r\nleft = 0\r\nfrom collections import Counter\r\nc = Counter()\r\nfor right in range(n):\r\n c[a[right]] += 1\r\n while c[a[right]] >= k:\r\n c[a[left]] -= 1\r\n left += 1\r\n ans -= right - left + 1\r\nprint(ans)", "from typing import List\n\n\ndef submit(a: list, n: int, k: int) -> int:\n res = 0\n cnt = {}\n l, r, t = 0, 0, 0\n\n for l in range(n):\n while r < n and cnt.get(a[t], 0) < k:\n cnt[a[r]] = cnt.get(a[r], 0) + 1\n if cnt[a[r]] > cnt.get(a[t], 0) and r != t:\n t = r\n r += 1\n if cnt.get(a[t], 0) >= k:\n res += n - r + 1\n cnt[a[l]] = cnt.get(a[l], 0) - 1\n\n return res\n\n\ndef main():\n n, d = map(int, input().split())\n a = list(map(int, input().split()))\n\n print(submit(a, n, d))\n\n\nmain()\n", "import sys\r\ninput = lambda: sys.stdin.readline().strip()\r\nfrom collections import Counter\r\nn, k = list(map(int, input().split()))\r\na = list(map(int, input().split()))\r\nres = 0\r\n# 双指针\r\nc = Counter()\r\nleft = 0\r\nval = 0\r\nfor i in range(n):\r\n c[a[i]] += 1\r\n while c[a[i]] > k or (c[a[i]] == k and a[left] != a[i]):\r\n c[a[left]] -= 1\r\n left += 1\r\n if c[a[i]] == k:\r\n val = a[i]\r\n if c[val] == k:\r\n res += left + 1\r\nprint(res)", "import sys\r\ninput = sys.stdin.buffer.readline \r\n\r\ndef process(A, k):\r\n curr = 0\r\n d = {}\r\n n = len(A)\r\n curr = None\r\n answer = 0\r\n for i in range(n):\r\n c = A[i]\r\n if c not in d:\r\n d[c] = []\r\n d[c].append(i)\r\n L = len(d[c])\r\n if L >= k:\r\n curr1 = d[c][L-k]\r\n if curr is None:\r\n curr = curr1\r\n else:\r\n curr = max(curr, curr1)\r\n if curr is not None:\r\n answer = answer+(curr+1)\r\n return answer\r\n\r\nn, k = [int(x) for x in input().split()]\r\nA = [int(x) for x in input().split()]\r\nprint(process(A, k))", "n, k = map(int, input().split())\narr = list(map(int, input().split()))\n\nleft = 0\nright = 0\ncounter = {}\nres = 0\n\nwhile right < n:\n if arr[right] not in counter:\n counter[arr[right]] = 0\n counter[arr[right]] += 1\n \n while counter[arr[right]] == k:\n res += n - right\n counter[arr[left]] -= 1\n left += 1\n \n \n right += 1\n \nprint(res)\n", "n,k=map(int,input().split())\r\nl=list(map(int,input().split()))\r\n \r\nd={}\r\nm=0\r\nj=0\r\n \r\nfor i in range(n):\r\n d[l[i]]=d.get(l[i],0)+1\r\n while d[l[i]]==k:\r\n m+=(n-i)\r\n d[l[j]]-=1\r\n j+=1\r\nprint(m)", "from collections import Counter\r\n\r\nn, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\nres = 0\r\nl = 0\r\nc = Counter()\r\n\r\nfor idx, val in enumerate(a):\r\n c[val] += 1\r\n while c[val] >= k:\r\n c[a[l]] -= 1\r\n l += 1\r\n res += l\r\nprint(res)\r\n", "# coding=utf-8\r\nfrom collections import defaultdict\r\n\r\nif __name__ == \"__main__\":\r\n n, k = map(int, input().split())\r\n a = list(map(int, input().split()))\r\n ans = l = val = 0\r\n cnt = defaultdict(int)\r\n for v in a:\r\n cnt[v] += 1\r\n while cnt[v] > k or (cnt[v] == k and v != a[l]):\r\n cnt[a[l]] -= 1\r\n l += 1\r\n if cnt[v] == k:\r\n val = v\r\n if cnt[val] >= k:\r\n ans += l + 1\r\n print(ans)\r\n" ]

[ "import sys\r\ninput = sys.stdin.readline\r\nfrom collections import Counter\r\n\r\nn = int(input())\r\nw = Counter(map(int, input().split()))\r\nd = []\r\nc = 0\r\nfor i in range(31):\r\n d.append(2**i)\r\nfor i in w:\r\n for j in d:\r\n if j > i:\r\n x = j-i\r\n if x == i:\r\n c += w[i]*(w[i]-1)\r\n elif x in w:\r\n c += w[x]*w[i]\r\nprint(c//2)\r\n", "from collections import defaultdict\r\nn = int(input())\r\nls = list(map(int,input().split()))\r\nls.sort()\r\ndc = defaultdict(int)\r\nfor i in range(n) :\r\n dc[ls[i]] += 1\r\ndef check(val) :\r\n while val%2 == 0 :\r\n val //= 2\r\n if val == 1 :\r\n return True\r\n return False\r\narr = []\r\nfor i,j in dc.items() :\r\n arr.append([i,j])\r\nans = 0\r\nfor i in arr :\r\n if check(i[0]) :\r\n ans += (i[1]*(i[1]-1))//2\r\n else :\r\n k = 1\r\n while 2**k < i[0] :\r\n k += 1\r\n while k < 31 :\r\n ans += i[1]*dc[2**k-i[0]]\r\n k += 1\r\n dc[i[0]] = 0\r\nprint(ans)", "import sys\r\ndef input() : return sys.stdin.readline().strip()\r\ndef getints() : return map(int,sys.stdin.readline().strip().split())\r\n\r\nimport bisect\r\nleft = lambda l,a : bisect.bisect_left(l,a)\r\nright = lambda l,a : bisect.bisect_right(l,a)\r\n\r\ndef inbs(l,s,n):\r\n t = left(l,n)\r\n if t < s and l[t] == n: return True\r\n else: return False\r\n\r\nfrom collections import Counter\r\n\r\nn = int(input())\r\nl = sorted(getints())\r\n\r\nans = 0\r\nc = Counter(l)\r\nd = [2**i for i in range(1,31)]\r\n\r\nwhile l:\r\n x = l.pop(0)\r\n n -= 1\r\n for y in d:\r\n if y > x and inbs(l,n,y-x):\r\n if x == y-x: c[y-x] -= 1\r\n ans += c[y-x]\r\nprint(ans)", "freq = {}\r\nn = int(input())\r\na = [*map(int, input().split())]\r\nans = 0\r\nfor x in a:\r\n\tfor b in range(1,31):\r\n\t\tans += freq.get(2**b-x,0)\r\n\tfreq[x] = freq.get(x,0)+1\r\nprint(ans)", "def start():\r\n c=0\r\n n=int(input())\r\n a=list(map(int,input().split()))\r\n d={}\r\n s=[1]\r\n while s[-1]<10**9:s.append(s[-1]*2)\r\n for i in a:\r\n for j in s:\r\n if j-i in d:\r\n c+=d[j-i]\r\n if i in d:d[i]+=1\r\n else:d[i]=1\r\n print(c)\r\nstart()\r\n", "import sys\r\ninput = sys.stdin.readline\r\nfrom collections import defaultdict as dt\r\nn = int(input())\r\nls = list(map(int,input().split()))\r\nls.sort()\r\nans, pw = 0, []\r\ndc = dt(int)\r\nfor elem in ls :\r\n dc[elem] += 1\r\nl = [i for i,j in dc.items()]\r\nfor i in range(31) :\r\n pw.append(2**(i+1))\r\nfor elem in l :\r\n for pw2 in pw :\r\n if pw2 - elem > elem :\r\n ans += dc[pw2 - elem]*dc[elem]\r\n if pw2 - elem == elem :\r\n ans += (dc[elem]*(dc[elem]-1))//2\r\nprint(ans)", "n = int(input())\r\narr = list(map(int,input().split()))\r\n\r\nposs = [1<<i for i in range(32)]\r\nchk = dict()\r\ncnt = 0\r\nfor i in arr:\r\n for j in poss:\r\n try:\r\n cnt+=chk[j-i]\r\n except:\r\n pass\r\n try:\r\n chk[i]+=1\r\n except:\r\n chk[i] = 1\r\nprint(cnt)", "n=int(input()) \r\nA=list(map(int, input().split())) \r\nD={}\r\nA.sort()\r\ndef ceil2(x):\r\n l=1\r\n while x>1:\r\n x//=2\r\n l+=1\r\n return 2**l\r\n\r\nk=0\r\nfor a in A:\r\n k+=D.get(ceil2(a)-a, 0)\r\n D[a]=D.get(a,0)+1 \r\n \r\nprint(k)", "from bisect import bisect_left, bisect_right\r\nfrom collections import Counter, deque\r\nfrom functools import lru_cache\r\nfrom math import factorial, comb, sqrt\r\nfrom copy import deepcopy\r\nimport heapq\r\n\r\n\r\nc = int(input())\r\nL = list(map(int, input().split()))\r\ndic = Counter()\r\nans = 0\r\nfor i in range(len(L)):\r\n for j in range(31):\r\n if 2**j > L[i] and (2**j - L[i]) in dic.keys():\r\n ans += dic[2**j - L[i]]\r\n dic[L[i]] += 1\r\nprint(ans)\r\n", "input()\r\nd = {}\r\nk = 0\r\nfor i in map(int, input().split()):\r\n for p in range(32):\r\n k+=d.get(2**p - i, 0)\r\n d[i] = d.get(i, 0) + 1\r\nprint(k)\r\n", "n = int(input()) # Read the number of elements\nnums = list(map(int, input().split())) # Read the elements as a list\ncount = {} # Dictionary to store the count of each number\nresult = 0 # Variable to store the result\n# Iterate over each number in the list\nfor num in nums:\n # Iterate over the range of 31 (assuming the target number is within this range)\n for j in range(31):\n target = (1 << j) - num # Calculate the target number\n if target in count:\n result += count[target] # Add the count of the target number to the result\n count[num] = count.get(num, 0) + 1 # Increment the count of the current number\nprint(result) # Output the final result\n\t \t \t \t \t \t\t \t \t\t \t \t", "\r\nfrom collections import Counter\r\n\r\n\r\nn = int(input())\r\narr = list(map(int,input().split()))\r\n\r\ncnt = Counter()\r\nres = 0\r\nfor i in range(n):\r\n for j in range(32):\r\n res+= cnt[2**j-arr[i]]\r\n cnt[arr[i]]+=1\r\nprint(res)\r\n\r\n", "import collections\n\nPOW = [2**i for i in range(32)]\n\nn = int(input())\na = list(map(int, input().split()))\ncounter = collections.Counter(a)\nans = sum(counter[y] * counter[u] for x in POW for y in counter if (u := x - y) > y)\n# FIXME: New in version 3.10.\n# ... if x.bit_count() == 1\nans += sum(counter[x] * (counter[x] - 1) // 2 for x in counter if not x & x - 1)\nprint(ans)\n", "n = int(input())\r\nv = map(int, input().split())\r\npowers = [1 << i for i in range(1,31)]\r\n\r\nmp = dict(); cnt = 0\r\nfor x in v:\r\n for exp in powers:\r\n cnt += mp.get(exp-x, 0)\r\n mp[x] = mp.get(x, 0) + 1\r\nprint(cnt)\r\n\t \t \t \t\t\t \t \t\t \t\t\t", "import sys\r\nfrom collections import Counter as cnt\r\ndef inp(): return int(sys.stdin.readline())\r\ndef li(): return list(map(int, sys.stdin.readline().split()))\r\n# for pratyush in range(inp()):\r\nn=inp()\r\nl=li()\r\nd,ans={},0\r\nfor j in range(n):\r\n for i in range(40):\r\n ans+=d.get(((1<<i)-l[j]),0)\r\n d[l[j]]=d.get(l[j],0)+1 \r\nprint(ans)", "n=int(input())\r\nx=list(map(int,input().split()))\r\ndic={}\r\nans=0\r\nfor i in x:\r\n for j in range(32):\r\n if (1<<j)-i in dic:\r\n ans+=dic[(1<<j)-i]\r\n dic[i]=dic.get(i,0)+1\r\nprint(ans)", "import sys\r\ninput = sys.stdin.readline\r\n\r\n# from math import gcd as gcd\r\n# import bisect #-->For bisect.bisect_left=lower_bound and bisect_right=upper_bound)\r\n\r\nt = 1\r\n# t = int(input())\r\nfor _ in range(t):\r\n n = int(input())\r\n a = list(map(int, input().split()))\r\n l = []\r\n for i in range(32):\r\n l.append(2 ** i)\r\n ans = 0\r\n d = {}\r\n for i in range(n):\r\n if (a[i] in d.keys()):\r\n d[a[i]] += 1\r\n else:\r\n d[a[i]] = 1\r\n for i in range(n):\r\n d[a[i]] -= 1\r\n for j in range(32):\r\n if((l[j] - a[i]) not in d.keys()):\r\n continue\r\n else:\r\n ans += d[l[j] - a[i]] - (l[j] == a[i])\r\n print(ans)", "import sys\r\ndef input() : return sys.stdin.readline().strip()\r\ndef getints() : return map(int,sys.stdin.readline().strip().split())\r\n\r\nn = int(input())\r\nl = sorted(getints())\r\n\r\nfrom collections import Counter\r\nc = Counter(l)\r\n\r\nans = 0\r\nd = [2**i for i in range(1,31)]\r\nfor x in l:\r\n c[x] -= 1\r\n for y in d:\r\n if y-x in c: ans += c[y-x]\r\nprint(ans)", "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 collections import defaultdict\r\n\r\ndef main():\r\n n=ri()\r\n a=rl()\r\n b=[2**i for i in range(31)]\r\n d=defaultdict(int)\r\n for i in range(n):\r\n d[a[i]]+=1\r\n rs=0\r\n for k,v in d.items():\r\n for s in b:\r\n if s-k in d.keys():\r\n if k==s-k: rs+=v*(v-1)\r\n else: rs+=v*d[s-k]\r\n return rs//2\r\nprint(main())\r\n", "import sys\ninput = sys.stdin.readline\n\nn = int(input())\n\na = list(map(int,input().split()))\n\t\nc = 0\nchk = {}\n\nfor i in a:\n\tchk[i]=0\n\nfor i in range(n):\n\tfor j in range(31):\n\t\taj = (1<<j)-a[i]\n\t\ttry:\n\t\t\tc += chk[aj]\n\t\texcept:\n\t\t\tc += 0\n\tchk[a[i]]+=1\n\t\t\t\nprint(c)\n\t\t \t \t\t\t \t \t\t\t\t\t \t", "import sys \r\nfrom collections import Counter\r\ninput = sys.stdin.readline \r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\nd = Counter()\r\nans = 0\r\nfor i in range(n):\r\n for j in range(31):\r\n c = 1 << j \r\n ans += d[c - a[i]]\r\n d[a[i]] += 1 \r\nprint(ans)\r\n# p.rint(d)", "input()\r\nans=0;\r\ns=dict()\r\nfor x in map(int,input().split()):\r\n\tfor i in range(1,32):\r\n\t\tif 2**i-x in s :\r\n\t\t\tans+=s[2**i-x]\r\n\tif x in s :\r\n\t\ts[x]+=1\r\n\telse :\r\n\t\ts[x]=1\r\nprint(ans)", "from collections import defaultdict\r\nn = int(input())\r\nl = list(map(int,input().split()))\r\nl1 = []\r\ndc = defaultdict(int)\r\nans,c = 0,2\r\nfor i in range(32):\r\n l1.append(c)\r\n c*=2\r\nfor i in range(n):\r\n dc[l[i]]+=1\r\nfor i in range(n):\r\n dc[l[i]]-=1\r\n for j in l1:\r\n ans+=dc[j-l[i]]\r\nprint(ans)", "import sys\r\nimport math\r\n# Fast input\r\ninput = sys.stdin.readline\r\n# Fast output\r\ndef print(*args, **kwargs):\r\n sep = kwargs.get('sep', ' ')\r\n end = kwargs.get('end', '\\n')\r\n file = kwargs.get('file', sys.stdout)\r\n flush = kwargs.get('flush', False)\r\n output = sep.join(map(str, args)) + end\r\n file.write(output)\r\n if flush:\r\n file.flush()\r\n\r\ndef listin():\r\n n=int(input())\r\n l=list(map(int,input().split()))\r\n return n,l\r\ndef two():\r\n n,m=map(int,input().split())\r\n return n,m\r\ndef three():\r\n n,m,p=map(int,input().split())\r\n return n,m,p\r\nn,l=listin()\r\nfrom collections import Counter\r\nc=Counter(l)\r\ns=0\r\nfor i in c:\r\n for j in range(1,32):\r\n x=2**j-i\r\n if x<0:\r\n continue\r\n y=c[x]\r\n if x==i:\r\n s+=(y**2-y)\r\n else:\r\n s+=c[i]*y\r\n \r\nprint(s//2)\r\n", "N = int(input())\nS = list(map(int, input().split()))\nS2 = {S[0]: 1}\nmax_S = S[0]\nans = 0\nfor i in range(1, len(S)):\n copy = S[i]\n base = 1\n pair = 0\n while copy != 1:\n if copy % 2:\n copy += 1\n pair += base\n copy >>= 1\n base *= 2\n while pair <= max_S:\n if pair in S2:\n ans += S2[pair]\n pair += base\n base *= 2\n if S[i] not in S2:\n S2[S[i]] = 0\n S2[S[i]] += 1\n max_S = max(S[i], max_S)\nprint(ans)", "n = int(input())\nnums = list(map(int, input().split()))\n\ncount = {}\nresult = 0\nfor num in nums:\n for j in range(31):\n target = (1 << j) - num\n if target in count:\n result += count[target]\n count[num] = count.get(num, 0) + 1\n\nprint(result)\n\n\t \t \t\t\t \t\t \t \t\t \t\t \t\t \t\t\t" ]

[ "n=int(input())\na=list(map(int,input().split()))\nsa=set(a)\narr=list(sa)\ncount=0\nfor i in sa:\n if i!=0:\n count+=1\nprint(count) \n\t\t\t \t \t \t \t\t \t \t \t\t", "jagratha=int(input())\r\nmanushulu=list(map(int,input().split()))\r\nwhile(0 in manushulu):\r\n manushulu.remove(0)\r\nmanushulu=set(manushulu)\r\nprint(len(manushulu))", "import sys\r\ninput = lambda : sys.stdin.readline().strip()\r\n'''\r\n╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬\r\n╬╬ ▓▓ ▓▓ ╬╬\r\n╬╬ ▓▓ ▓▓ ╬╬\r\n╬╬ ▓▓█████▓▓ ╬╬\r\n╬╬ ▓▓ ▓▓ ╬╬\r\n╬╬ ▓▓ ▓▓ ╬╬\r\n╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬\r\n'''\r\nl = int(input())\r\nlist1 = list(map(int,input().split()))\r\nlis = set(list1)\r\nli = list(lis)\r\nans = 0\r\nfor i in li:\r\n if i !=0:\r\n ans+=1\r\nprint(ans)", "x = int(input())\nl = list(map(int,input().split()))\nl = [i for i in l if(i!=0)]\nprint(len(set(l)))\n\t \t\t \t \t \t\t\t\t\t\t \t\t\t\t\t \t\t\t", "mb=int(input())\r\nkcp=list(map(int,input().split()))\r\n\r\nwhile(0 in kcp):\r\n kcp.remove(0)\r\nkcp=set(kcp)\r\nprint(len(kcp))", "# import sys\r\n# sys.stdin=open(\"input.in\",\"r\")\r\nn=int(input())\r\nprint(len(set(input().split())-{\"0\"}))", "n = int(input())\r\na = set([i for i in map(int,input().split()) if i!=0])\r\nprint(len(a))\r\n", "input()\r\na = sorted(set(map(int, input().split())))\r\nprint(len(a) if a[0] != 0 else len(a) - 1)", "n=int(input())\r\nl=list(map(int,input().split()))\r\ns=list(set(l))\r\nif 0 in s:\r\n s.remove(0)\r\nprint(len(s))\r\n", "n=int(input())\r\narr=list(map(int,input().split()))\r\nfreq=[0]*(602)\r\nfor i in arr:\r\n freq[i]+=1 \r\nc=0 \r\nfor i in range(1,602):\r\n if freq[i]!=0:\r\n c+=1 \r\nprint(c)\r\n", "pop1=int(input())\nhg2=list(map(int,input().split()))\nwhile(0 in hg2):\n hg2.remove(0)\nhg2=set(hg2)\nprint(len(hg2))\n# hg2=set(hg2)\n# print(len(hg2))\n \t \t \t \t\t\t \t \t \t \t\t\t", "n = int(input())\r\narr = [int(x) for x in input().split() if x!='0']\r\n\r\nprint(len(set(arr)))", "n = int(input())\na = set(input().split())\nif '0' in a:\n print(len(a) - 1)\nelse:\n print(len(a))", "y1=int(input())\ne2=list(map(int,input().split()))\nwhile(0 in e2):\n e2.remove(0)\ne2=set(e2)\nprint(len(e2))\n# e2=set(e2)\n# print(len(e2))\n \t \t \t \t\t\t \t \t\t\t \t \t\t\t\t", "#!/bin/python3\r\nn = int(input())\r\ns = list(map(int, input().split()))\r\nmyset = set(s)\r\ncounter = 0\r\nfor lol in myset:\r\n\tif lol != 0 :\r\n\t\tcounter += 1\r\n\r\nprint(counter)\r\n", "n = int(input())\nparticipants = set(input().split())\n\nways = len(participants)\nif ('0' in participants):\n print(ways - 1)\nelse:\n print(ways)\n \t \t \t \t \t\t\t \t\t \t\t \t", "n=int(input())\na=list(map(int,input().split()))\nwhile(0 in a):\n a.remove(0)\na=set(a)\nprint(len(a))\n\n\t\t\t\t\t \t \t\t \t\t \t\t\t \t", "def olympiada(lst):\r\n a = list()\r\n if 0 not in lst:\r\n return len(set(lst))\r\n for elem in lst:\r\n if elem != 0:\r\n a.append(elem)\r\n return len(set(a))\r\n\r\n\r\nn = int(input())\r\nb = [int(i) for i in input().split()]\r\nprint(olympiada(b))\r\n", "value=int(input())\nresult=list(map(int,input().split()))\nwhile(0 in result):\n result.remove(0)\nresult=set(result)\nprint(len(result))\n\n\t \t \t \t \t\t \t \t\t\t\t\t \t", "n=int(input())\r\na=list(map(int,input().split()))\r\na.sort()\r\nc=1\r\nif(a.count(max(a))==len(a)):\r\n\tprint(c)\r\nelse:\r\n\ta=list(set(a))\r\n\tif 0 in a:\r\n\t\ta.remove(0)\r\n\tprint(len(a))", "a = input()\r\ns = input().split()\r\nd = []\r\nfor i in s:\r\n if i not in d:\r\n d.append(i)\r\nif '0' in d:\r\n print(len(d) - 1)\r\nelse:\r\n print(len(d))", "n = int(input())\r\na = input().split()\r\nb = []\r\nfor i in range(n):\r\n a[i] = int(a[i])\r\n true = True\r\n if a[i] == 0:\r\n true = False\r\n for j in range(len(b)):\r\n if a[i] == b[j]:\r\n true = False\r\n if not true:\r\n break\r\n if true:\r\n b += [a[i]]\r\nprint(len(b))\r\n", "n=int(input())\r\nl=[int(i) for i in input().split()]\r\na=[]\r\nfor i in l:\r\n if i !=0 and i not in a:\r\n a.append(i)\r\nprint(len(a))", "n=int(input())\r\ns=set(map(int,input().split()))\r\ns.discard(0)\r\nprint(len(s))", "n=int(input())\r\narr=[int(x) for x in input().split()]\r\nif 0 in arr:\r\n c1=arr.count(0)\r\n while c1!=0:\r\n arr.remove(0)\r\n c1-=1\r\n set1=set(arr)\r\n print(len(set1))\r\nelse:\r\n set1=set(arr)\r\n print(len(set1))", "n=int(input())\nl=[int(x) for x in input().split()]\nl=set(l)\nif 0 in l:\n print(len(l)-1)\nelse:\n print(len(l))\n \t\t \t \t \t\t\t \t \t \t \t\t\t \t\t", "n = int(input())\na = map(int, input().split())\n\nprint(len(set(a) - {0, }))\n\t \t\t\t \t \t\t \t\t \t\t\t\t \t\t\t\t", "n = int(input())\r\na = input().split(' ')\r\ns = set()\r\nfor i in a:\r\n if int(i) > 0:\r\n s.add(i)\r\n\r\nprint (len(s))", "def main():\r\n n = int(input())\r\n vals = [int(v) for v in input().split()]\r\n vals.sort()\r\n vals = [v for v in vals if v!=0]\r\n print(len(set(vals)))\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\ns=set(l)\r\ns.discard(0)\r\nprint(len(s))\r\n", "def test_3():\n arr1 = list(map(int, input().split(\" \")))\n arr2 = list(map(int, input().split(\" \")))\n count = 0\n a1 = set(arr2)\n a1 = a1 - set([0])\n count = len(a1)\n return count\n\n\n# aa = test_4(x)\naa = test_3()\nprint(aa)\n \t \t \t \t \t \t\t\t \t \t\t", "n=int(input())\r\nx=list(map(int,input().split()))\r\n\r\n\r\nans=set(x)\r\nsumi=0\r\nfor i in ans:\r\n if i==0:\r\n pass\r\n else:\r\n sumi+=1\r\n\r\nprint(sumi)", "# 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\n\r\nn = int(input())\r\nll = list(map(int, input().split()))\r\nz = set()\r\nfor i in range(len(ll)):\r\n if ll[i]!=0:\r\n z.add(ll[i])\r\nprint(len(z))", "n=int(input())\r\ns=input().split()\r\ns=list(set(s));d=[]\r\nfor i in range(0,len(s)):\r\n if s[i] is '0':\r\n d.append(i)\r\nfor j in range(0,len(d)):\r\n del s[d[j]-j]\r\nprint(len(s))", "t=int(input())\nlsti=list(map(int,input().split()))\nlsti2=set(lsti)\ncaish=0\nfor i in lsti2:\n\tif i!=0:\n\t\tcaish=caish+1\nprint(caish)\n \t\t\t\t \t \t \t \t \t\t\t\t \t", "#Olympiad\r\n\r\ni=int(input())\r\na=list(map(int,input().split()))\r\nou=[]\r\nfor b in a:\r\n if b in ou or b==0:\r\n# print(1,ou)\r\n pass\r\n else:\r\n ou.append(b)\r\n# print(2,ou)\r\nprint(len(ou))", "n = int(input())\r\nscores = list(map(int, input().split(' ')))\r\n\r\nscores.sort()\r\n\r\nways =[]\r\n\r\nfor i in scores:\r\n if i !=0 and i not in ways:\r\n ways.append(i)\r\n\r\nprint(len(ways))", "n = int(input())\r\ns = set(input().split(' '))\r\nprint(len(s) - 1) if '0' in s else print(len(s))", "n = int(input())\r\nl = set(input().split())\r\nif '0' in l:\r\n\tprint(len(l)-1)\r\nelse:\r\n\tprint(len(l))", "n=int(input())\nc=list(map(int,input().strip().split()))[:n]\nd=set(c)\nl=len(d)\nif 0 in d:\n print(l-1)\nelse:\n print(l)\n \t \t \t \t \t \t \t\t \t \t \t\t \t", "N=int(input())\r\nL=list(map(int,input().split()))\r\nX=set(L)\r\nY=list(X)\r\nif Y[0]==0:\r\n\tprint(len(Y)-1)\r\nelse:\r\n\tprint(len(Y))", "n=int(input())\ntemp=set(input().split())\n\ntemp=list(temp)\ntemp.sort()\n\nif temp[0]=='0':\n\ttemp.pop(0)\n\t\nprint (len(temp))", "n=int(input())\r\nx=set(map(int,input().split()))\r\nif 0 in x:\r\n print(len(x)-1)\r\nelse:\r\n print(len(x))", "a=input()\na=input().split( )\nb=[]\nfor i in a:\n if i!='0' and i not in b:\n b.append(i)\nprint(len(b))", "num = int(input())\r\narr = list(map(int, input().split()))\r\n\r\nans = len(set(i for i in arr if i >0))\r\n\r\nprint(ans)\r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\n\r\ns=set()\r\nfor i in range(n):\r\n if a[i]>0:\r\n s.add(a[i])\r\n\r\nprint(len(s))\r\n", "n = int(input())\r\n\r\nm = list(map(int,input().split()))\r\n\r\nk = set(m)\r\nif 0 in k:\r\n k.remove(0)\r\n\r\nprint(len(k))", "# H - Olympiad\n\nn = int(input().strip())\n\narr = set(map(int, input().strip().split()))\narr.discard(0)\nprint(len(arr))\n\n\t \t \t\t\t \t \t\t \t\t \t\t\t \t", "n = int(input())\nl1 = list(map(int, input().split()))\ns = set(l1)\ns1 = list(s)\n#s1.remove(\"0\")\n\ns1.sort()\nif(s1[0] == 0):\n print(len(s1) - 1)\nelse:\n print(len(s1))\n#print(s1)\n \t \t \t \t\t \t \t\t \t", "a=int(input())\r\nb=list(map(int, input().split()))\r\nx=[]\r\nfor i in b:\r\n if i!=0:\r\n x. append(i)\r\n\r\n \r\n\r\nprint(len(set(x)))", "n = int(input())\r\nlistScore = [int(x) for x in input().split()][:n]\r\nm = list(set(listScore))\r\nfor x in range(0, len(m)):\r\n try:\r\n if (m[x] == 0):\r\n m.remove(m[x])\r\n except:\r\n pass\r\nprint(len(m))", "n=int(input())\r\na=set(input().split())\r\na.discard(\"0\")\r\nprint(len(a))\r\n", "n=int(input())\r\na=set([int(i) for i in input().split()])\r\na.discard(0)\r\nprint(len(a))", "n=int(input())\r\na=list(map(int,input().split()))\r\ns=set(a)\r\nif 0 in s:\r\n\ts.remove(0)\r\nprint(len(s))", "n=int(input())\r\na=list(map(int,input().split()))\r\nsa=set(a)\r\narr=list(sa)\r\ncount=0\r\nfor i in sa:\r\n if i!=0:\r\n count+=1\r\nprint(count) ", "k=int(input())\r\narr=list(map(int,input().split()))\r\narr=list(set(arr))\r\nif 0 in arr:\r\n print(len(arr)-1)\r\nelse:\r\n print(len(arr))", "n=int(input())\r\narr=list(map(int,input().split()))\r\na=set()\r\nfor i in arr:\r\n if i==0:\r\n continue\r\n else:\r\n a.add(i)\r\n# print(a)\r\nprint(len(a))", "n=int(input())\r\nl=list(map(int,input().split()))\r\nif 0 in l:\r\n for _ in range(l.count(0)):\r\n l.remove(0)\r\nprint(len(set(l)))", "n=int(input())\nsc=list(map(int,input().split()))\nsort1=sorted(sc,reverse=True)\n\ncount=0\nx=1324\nfor i in range(n):\n if sort1[i]!=x and sort1[i]!=0:\n count+=1\n x=sort1[i]\nprint(count)\n", "n=int(input())\r\nx=list(map(int,input().split()))\r\nx.sort()\r\nx=list(set(x))\r\nif x[0]==0:\r\n print(len(x)-1)\r\nelse: \r\n print(len(x))", "n=int(input())\r\na=list(map(int,input().split()))\r\na=set(a)\r\na=list(a)\r\nzero=a.count(0)\r\nprint(len(a)-zero)", "n=int(input())\nl=list(map(int,input().split()))\na=[]\nfor i in range(len(l)):\n if l[i]!= 0:\n a.append(l[i])\na=set(a)\nprint(len(a))\n\t\t\t \t\t \t\t\t\t \t\t \t \t\t \t \t\t", "n = int(input())\nscores = []\n[scores.append(int(i)) for i in input().split()]\n\nscores = sorted(set(scores))[::-1]\n\nfor i in range(len(scores) -1, -1, -1):\n if scores[i] != 0: break\n else: scores.pop(i)\n\nprint(len(scores))\n", "a=int(input())\r\nb=list(map(int,input().split()))\r\nc=set(b)\r\nif 0 in set(c):\r\n\tc.remove(0)\r\nprint(len(c))", "input()\r\ns=list(map(int,input().split()))\r\nprint(len(set(s))-int(0 in s))", "ReadStr = lambda : input()\r\nReadList = lambda : list(map(int,input().split()))\r\nReadInt = lambda : int(input())\r\nReadMultipleValues = lambda :map(int,input().split())\r\n\r\n# Python3 program \r\nn = ReadInt()\r\nscores = ReadList()\r\nscores = [i for i in scores if i != 0]\r\nprint(len(set(scores)))\r\n", "t=int(input())\r\nli=[int(i) for i in input().split()]\r\ns=set(li)\r\ncnt=0\r\nfor i in s:\r\n if i==0:\r\n continue\r\n else:\r\n cnt+=1\r\nprint(cnt)", "n=int(input())\narr=[int(i) for i in input().split()]\narr=list(set(arr))\nprint(len(arr)-arr.count(0))\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\nm=set(map(int,input().split()))\r\nm=list(m)\r\nm.sort()\r\nprint(len(m) if m[0] else len(m)-1)", "int(input())\r\na=sorted(map(int,input().split()))\r\ns=set(a)\r\nif 0 in s:\r\n s.remove(0)\r\nprint(len(s))", "n = int(input())\nsoc = list(map(int,input().split()))\nsoc.sort()\nx = 0\nfor i in range(1,len(soc)):\n if soc[i] != 0 and soc[i] > soc[i-1]:\n x = x + 1\nif soc[0] !=0:\n x = x + 1\nprint(x)\n\t\t\t \t\t\t \t\t\t\t\t \t \t\t \t\t\t\t \t", "n=int(input())\nlist1=input().split(' ')\nwhile\" \"in list1:\n list1.remove(\" \")\nlist2=set(list1)\ncount=0\ncount1=0\ncount=len(list2)\nif '0' in list2:\n count1=count-1\n print(count1)\nelse:\n print(count)\n\n\n \t \t \t \t \t \t\t\t \t\t \t \t", "# cf 937 A 800\nn = int(input())\nA = [*map(int, input().split())]\n\ncount = 0\nS = set(A)\nif 0 in S:\n S.remove(0)\nprint(len(S))\n", "i= int(input())\r\n\r\ntest= list(map(int, input().split()))\r\n\r\nli=[]\r\nfor i in test:\r\n if i not in li and i!=0:\r\n li.append(i)\r\n\r\nprint(len(li))", "n=int(input())\nc=list(map(int,input().strip().split()))[:n]\nk=set(c)\nl=len(k)\nif 0 in k:\n print(l-1)\nelse:\n print(l)\n\t\t\t\t \t \t\t\t\t \t \t \t \t \t\t\t\t", "t = input()\nmy_set = set(list(map(int, input().split())))\nans = len(my_set)\nfor val in my_set:\n if val == 0:\n ans -= 1\nprint(ans)\n \t\t\t \t \t\t \t\t\t \t\t\t \t\t\t\t \t", "t=int(input())\nn=[int(x) for x in input().split()]\nn=list(set(n))\nfor i in n:\n\tif i==0:\n\t\tn.remove(i)\nprint(len(n))\n \t \t \t \t\t\t \t \t\t \t \t \t\t\t\t", "n = int(input())\nscores = list(map(int, input().split()))\ndistinct_scores = set(score for score in scores if score > 0)\nnum_ways = len(distinct_scores)\nprint(num_ways)\n\n\t \t \t\t \t \t\t\t\t \t\t", "n = int(input())\r\nl = sorted(list(map(int, input().split())))\r\nst = set()\r\nfor i in l:\r\n if i != 0:\r\n st.add(i)\r\nprint(len(st))", "n = int(input())\r\ns = list(map(int,input().split()))\r\nns = [int(i) for i in s if i>0]\r\nprint(len(set(ns)))", "def main():\n input()\n scores = [int(_) for _ in input().split()]\n scores = list(filter(lambda a: a > 0, scores))\n result = len(list(dict.fromkeys(scores)))\n\n print(result)\n\n\nif __name__ == '__main__':\n main()\n", "n=int(input())\r\nb=list(map(int,input().split()))\r\ns=set({})\r\nfor i in range(len(b)):\r\n if(b[i]>0):\r\n s.add(b[i])\r\n\r\nprint(len(s))", "n=int(input())\r\na=set(map(int,input().split()))\r\nln=len(a)\r\nif 0 in a:\r\n\tln-=1\r\nprint(ln)", "n = int(input())\r\nprint(len(set([int(x) for x in input().split() if x != '0'])))", "input()\r\nprint(len(set(x for x in input().split() if x!='0')))", "n = int(input())\r\na = [int(i) for i in input().split() if i != '0']\r\nb = set(a)\r\nprint(len(b))\r\n", "# your code goes here\nn = int(input())\nl = list(map(int,input().split()))\ns = list(set(l))\ncnt = 0\nfor i in range(len(s)):\n\tif s[i]!=0:\n\t\tcnt+=1\nprint(cnt)\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 = list(map(int, input().split()))\r\nl = []\r\n\r\nfor i in x:\r\n if i != 0:\r\n l.append(i)\r\n\r\nprint(len(set(l)))", "a=int(input())\nb=list(map(int,input().split()))\nwhile(0 in b):\n b.remove(0)\nc=set(b)\nprint(len(c))\n \t\t\t\t \t \t\t \t\t\t\t\t \t \t", "n=int(input())\nl=[int(x) for x in input().split()]\nnl=list(set(l))\nl2=[]\nfor i in nl:\n if i!=0:\n l2.append(i)\nprint(len(l2))\n\t\t\t\t \t\t \t\t\t \t\t \t\t \t \t\t", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\ns = set(a)\r\nif 0 in s:\r\n s.remove(0)\r\nans = len(s)\r\nprint(ans)", "inp= int(input())\nlistu = set(int(i) for i in input().split())\nlistu.discard(0)\nprint(len(listu))\n \t \t \t \t\t \t \t \t\t\t\t\t\t\t", "n=int(input())\nlst=list(map(int,input().split()))\nlst.sort()\nsetl=set(lst)\ncnt=0\nfor i in setl:\n if i==0: continue\n cnt+=1\nprint(cnt)\n \n\t\t \t \t\t \t \t \t\t\t\t \t \t\t\t\t", "n = int(input())\r\nprint(len(set(map(int, input().split())) - {0}))", "n=int(input())\r\na=[int(i) for i in input().split()]\r\na=set(a)\r\nif(0 in a):\r\n print(len(a)-1)\r\n exit()\r\nprint(len(a))", "N=int(input())\nX=[int(i) for i in input().split()]\nA=set()\nfor i in X:\n if i!=0:\n A.add(i)\n#print(max(X)-min(X)-N+1)\nprint(len(A))\n\n\t\t\t \t \t \t\t \t \t \t \t \t \t \t \t\t \t", "n=int(input())\r\nl=list(map(int,input().split()))\r\nl.sort()\r\nk=0\r\ns=set(l)\r\nfor x in s:\r\n if x>0:\r\n k=k+1\r\nprint(k)\r\n\r\n", "N=int(input())\nli=[int(i) for i in input().split()]\nli1=set(li)\nif 0 in li1:\n li1.remove(0)\nprint(len(li1))\n \t \t\t\t\t \t \t\t\t \t \t \t\t\t \t", "n = int(input())\nlist1 = map(int,input().split())\nset1 = set(list1)\nlen1 = len(set1)\nfor i in set1:\n if i ==0:\n len1 -=1\nprint(len1)\n\t \t \t \t\t\t \t\t \t \t\t \t\t\t\t\t\t\t", "n = int(input())\r\nL = sorted([int(x) for x in input().split()])\r\nprint(len(set(L)) if 0 not in L else len(set(L))-1)\r\n", "n=int(input())\r\nl=[int(i) for i in input().split()] \r\nl=[i for i in l if i] \r\nprint(len(set(l)))", "n = int(input())\r\nls = list(set(map(int, input().split())))\r\nls.sort()\r\ncnt = 0\r\nfor i in ls:\r\n if i!=0: cnt+=1\r\nprint(cnt)\r\n", "# problem Name :Olympiad\r\n# problem Link : https://codeforces.com/problemset/problem/937/A\r\n# Input Operation :\r\nimport sys\r\nn=int(sys.stdin.readline())\r\narr=list(map(int,sys.stdin.readline().split()))\r\n# Output Operation :\r\narr2=list(set(arr))\r\nwhile 0 in arr2:\r\n arr2.remove(0)\r\nprint(len(arr2))", "n = int(input())\nar = set(map(int, input().split()))\nar.discard(0)\nprint(len(ar))\n", "s=int(input())\r\na=input().split()\r\na=list(set(a))\r\nfor i in a:\r\n if i==\"0\":\r\n a.remove(i)\r\n \r\nprint(len(a)) \r\n \r\n ", "n = int(input())\npoints = [int(i) for i in input().split()]\n\nawarded = set()\nfor p in points:\n if p not in awarded and p > 0:\n awarded.add(p)\nprint(len(awarded))\n\n", "M = int(input())\nR = list(map(int,input().split()))\n\nR = set(R)\nif 0 in R:\n\n R.remove(0)\nprint(len(R))\n\t\t \t\t\t \t \t \t \t\t \t\t\t\t \t \t", "n=int(input())\na=[int(i) for i in input().split()]\nz=0\na=list(set(a))\n#print(a)\nans=0\nfor i in a:\n if i!=0:\n ans+=1\nprint(ans)\n \t\t\t\t\t \t \t\t \t \t\t \t \t\t \t", "n=int(input())\r\nprint(len(set(map(int,input().split(' ')))-{0}))", "n=int(input())\r\npoints=list(map(int,input().split(' ')))\r\na=points.count(0)\r\nif a==0:\r\n b=set(points)\r\n print(len(b))\r\nelse:\r\n for i in range(a):\r\n points.remove(0)\r\n b=set(points)\r\n print(len(b))\r\n ", "n=int(input())\r\nb=list(map(int,input().split()))\r\nb.sort()\r\ns=set(b)\r\nl=(len(s))\r\nif 0 in b:\r\n print(l-1)\r\nelse:\r\n print(l)", "n=int(input())\r\na=list(map(int,input().split()))\r\nl=[]\r\nfor i in range(n):\r\n if a[i] not in l and a[i]>0:\r\n l+=[a[i]]\r\n \r\n \r\nprint(len(l))\r\n", "n = int(input())\na = [int(num) for num in input().split(' ')]\nb = []\nfor i in range(n):\n if (not(a[i] in b))and(a[i]!=0):\n b.append(a[i])\nprint(len(b))\n\n \t\t \t \t\t\t\t \t \t \t\t \t", "n = int(input())\narr = list(map(int,input().split()[:n]))\nres = set(arr)\nif 0 in arr:\n print(len(res)-1)\nelse:\n print(len(res))\n\t \t \t\t \t \t \t\t \t\t \t \t \t\t", "n=int(input())\r\na=list(map(int,input().split()))\r\nb=[]\r\nfor i in range(n):\r\n\tif a[i-1]>0:\r\n\t\tif a[i-1] not in b:\r\n\t\t\tb.append(a[i-1])\r\nprint(len(b))", "if __name__ == \"__main__\":\r\n participants = int(input())\r\n scores = set(map(int, input().split()))\r\n scores.add(0)\r\n print(len(scores) - 1)", "n=int(input())\r\ns=[]\r\na=[]\r\ns=list(map(int,input().split()))\r\nfor i in s:\r\n if i not in a and i!=0:\r\n a.append(i)\r\nprint(len(a))", "n=int(input())\nb=list(map(int,input().split()))\nb.sort()\ns=set(b)\nl=(len(s))\nif 0 in b:\n print(l-1)\nelse:\n print(l)\n\n \t\t \t\t \t\t\t\t\t\t\t \t\t\t\t\t \t \t", "n = int(input())\n\nnl = set(map(int, input().split()))\n\nif 0 in nl:\n\tprint(len(nl)-1)\nelse:\n\tprint(len(nl))", "a = int(input())\r\ns = list(map(int,input().split()))\r\nz = []\r\nfor i in range(a):\r\n if s[i] not in z and s[i] != 0: z.append(s[i])\r\nprint(len(z))", "n=int(input())\r\nscores = [*input().split()]\r\nscores = set(scores)\r\nscores.discard('0')\r\nnum_scores = len(scores)\r\nprint(num_scores)", "t=int(input())\nlist1=list(map(int, input().split()))[:t]\nx=set(list1)\nif 0 in x:\n\tprint (len(x)-1)\nelse:\n\tprint (len(x))\n \t \t \t\t\t \t \t\t \t \t\t \t \t\t\t", "nn=int(input())\n\nln=list(map(int,input().split()))\nln=set(ln)\nif 0 in ln:\n \n \n ln.remove(0)\nprint(len(ln))\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\nm = input('')\r\n\r\nlst=[]\r\nl=m.split()\r\nl.sort()\r\nfor k in l:\r\n k = int(k)\r\n lst.append(k)\r\nlst.sort() \r\nc=1\r\nfor i in range(len(lst)-1):\r\n if lst[i]!= 0 and lst[i]!=lst[i+1]:\r\n c+=1\r\nprint(c) ", "n=int(input())\nl=list(map(int,input().split()))\nll=[]\nfor i in l:\n if i not in ll:\n ll.append(i)\nr=len(ll)\nl.sort()\nif l[0]==0:\n r-=1\nprint(r)\n\t\t \t\t \t\t \t \t \t\t \t \t \t \t \t\t\t", "n=int(input())\r\na=[int(i) for i in input().split()]\r\nl1=[]\r\nc=0\r\nfor j in a:\r\n if j!=0 and j not in l1:\r\n l1.append(j)\r\n c+=1\r\nprint(c)", "from collections import Counter\r\n\r\nn = int(input())\r\n\r\na = map(int, input().split())\r\n\r\ncnt = Counter(a)\r\n\r\nif 0 in cnt:\r\n print(len(cnt)-1)\r\nelse:\r\n print(len(cnt))\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\nl=set(l)\r\ncount=0\r\nfor i in l:\r\n\tif i!=0:\r\n\t\tcount+=1\r\nprint(count)", "import sys\n\nn = int(input())\n\n\na = list(map(int, input().split()))\n\nd = {}\nfor i in a:\n\tif i>0:\n\t\td[i] = True\n\n\nprint(len(d))", "#Olympiad\r\nn = int(input())\r\nli = list(map(int,input().split()))\r\nli = list(set(li))\r\nc = 0\r\nfor i in li:\r\n if i!=0:\r\n c+=1\r\nprint(c)", "n = int(input())\r\nl = [int(x) for x in input().split()]\r\n\r\ns = set(l)\r\ns.discard(0)\r\nprint(len(s))", "n=int(input())\r\ncount=0\r\na=list(map(int,input().split()))\r\nx=list(set(a))\r\nfor i in range(len(x)):\r\n if x[i]!=0:\r\n count+=1\r\nprint(count) \r\n ", "\r\nn = int(input())\r\nL = [int(x) for x in input().split()]\r\ns = set(L)\r\ns.discard(0)\r\nprint(len(s))\r\n", "n = int(input())\r\nst = set(map(int, input().split()))\r\n\r\nif 0 in st:\r\n st.remove(0)\r\n \r\nprint(len(st))", "falcon=int(input())\nemer=list(map(int,input().split()))\nwhile(0 in emer):\n emer.remove(0)\nemer=set(emer)\nprint(len(emer))\n\n\t\t\t \t \t\t\t \t\t \t \t \t \t", "n=int(input())\r\na=[int(k) for k in input().split()]\r\nb={}\r\nfor i in a:\r\n if i!=0:\r\n b[i]=1\r\nprint(len(b))", "n = int(input())\r\nsample = list(input().split(\" \"))\r\nlst = []\r\nfor e in sample:\r\n if e not in lst:\r\n lst.append(e)\r\ncount = 0\r\nfor i in range (len(lst)):\r\n if int(lst[i]) != 0: \r\n count += 1\r\nprint(count) \r\n\r\n\r\n", "n = int(input())\r\nscore = [int(score) for score in input().split()]\r\nelements = list(set(score))\r\nelements.remove(0) if (0 in elements) else elements\r\nprint(len(elements))\r\n\r\n", "t= int(input())\na = list(map(int,input().split()[:t]))\nans = set(a)\nif 0 in a:\n print(len(ans)-1)\nelse:\n print(len(ans))\n \t\t \t \t \t\t\t\t \t\t\t \t\t\t\t", "n=int(input())\na=[int(i) for i in input().split()]\nb=set()\nfor i in a:\n if i!=0:\n b.add(i)\nprint(len(b))\n\t\t\t\t\t\t \t \t\t \t \t \t\t \t\t", "se=set()\r\nn=input()\r\nli=map(int,input().split())\r\nfor i in li:\r\n # a=int(input())\r\n if(i):\r\n se.add(i)\r\nprint(len(se))\r\n", "n = int(input())\r\nscores = list(map(int,input().split()))\r\norder = list(sorted(set(scores)))\r\n\r\norder = order[::-1]\r\nif(order[-1]==0):\r\n print(len(order)-1)\r\nelse:\r\n print(len(order))", "n=int(input())\r\nmarks=list(map(int,input().split()))\r\nm=set()\r\nfor i in range(0,len(marks)):\r\n\tif(marks[i]!=0):\r\n\t\tm.add(marks[i])\r\nprint(len(m))\r\n\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\na=len(set(l))\r\nif(0 in l):\r\n print(a-1)\r\nelse:\r\n print(a)", "n=int(input())\nl=list(map(int,input().split()))[:n]\nnew=[]\nfor item in l:\n if item not in new:\n new.append(item)\ncount=0\nfor u in new:\n if(u==0):\n new.remove(0)\nprint(len(new))\n \t \t \t \t\t\t \t \t \t \t \t \t\t\t", "n=int(input())\r\nl=list(map(int,input().split()))\r\nl1=[]\r\ncount=0\r\nfor x in l:\r\n if (x>0) and (x not in l1):\r\n count+=1\r\n l1.append(x)\r\n else:\r\n continue\r\nprint(count)\r\n \r\n ", "n=int(input())\r\nl=list(map(int,input().split()))\r\nl=list(set(l))\r\nx=[]\r\nfor i in range(len(l)):\r\n if l[i]!=0:\r\n x.append(l[i])\r\nprint(len(x))", "import sys\r\ninput = lambda : sys.stdin.readline().strip()\r\n# # # # # # # # # # # # # # # # # # # # # # # \r\nj = int(input())\r\nar = set(map(int,input().split()))\r\nar.discard(0)\r\nprint(len(ar))", "n = int(input())\nl = list(map(int,input().split()))\nd = []\nc = 0\nfor i in l:\n if i not in d:\n d.append(i)\nx=len(d)\n#print(x)\nfor i in range(x):\n if d[i]>=1:\n c+=1 \nprint(c)\n \t \t \t \t \t\t\t \t\t \t \t", "p=int(input())\nx=[int(i) for i in input().split()]\nv=sorted(set(x)) #set deletes the repeated items and sorted turn it into a list and sort it\nif v[0]==0:\n print(len(v)-1)\nelse:\n print(len(v))", "i= int(input())\nlis = set(int(i) for i in input().split())\nlis.discard(0)\nprint(len(lis))\n\t\t \t\t\t \t\t \t\t \t\t\t \t \t \t\t\t", "n = int(input())\nparticipantes =[int(x) for x in input().split()]\nconjunto = set(participantes)\ncount = 0\nfor x in conjunto:\n if x<=0:\n continue\n count+=1\nprint(count)\n \t \t\t \t\t\t \t\t\t\t \t\t \t \t\t\t", "numPart = int(input())\nparts = input().split()\n\nparts = set(parts)\nparts.discard('0')\n\nprint(len(parts))\n\t\t\t \t \t \t \t \t\t \t\t\t\t \t", "n=int(input())\ns=list(map(int,input().split()))\nwhile(0 in s):\n s.remove(0)\nprint(len(set(s)))\n \t\t\t \t \t \t \t\t\t \t\t \t\t \t", "n=int(input())\na=list(map(int,input().split()))\na=set(a)\nval=0\nfor i in (a):\n if i>0:\n val+=1\nprint(val)\n", "input()\nscores = {int(x) for x in input().split() if x != \"0\"}\nprint(len(scores))", "input()\r\na = sorted(list(map(int, input().split())) + [0], reverse=True)\r\n\r\nprint(len(set(a[0:a.index(0)])))\r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\na=set(a)\r\nval=0\r\nfor i in (a):\r\n if i>0:\r\n val+=1\r\nprint(val)", "input()\nprint(len(set(x for x in map(int, input().split()) if x)))\n", "n=int(input())\r\ns1=set(map(int,input().split()))\r\nsl=s1.discard(0)\r\nsL=len(list(s1))\r\nprint(sL)", "#CF 937A\r\nn = int(input())\r\nlst = input().split()\r\n\r\nlst.sort()\r\n#print(lst)\r\npre = 0\r\nans = 0\r\nfor i in lst:\r\n if i != \"0\": #debug: != 0\r\n if i != pre:\r\n ans += 1\r\n pre = i\r\nprint(ans)", "n = int(input())\nl = list(map(int, input().split()))\nk = set(l)\nc = len(k)\nif(0 in k):\n\tc -= 1\nprint(c)\n \t \t \t \t \t\t \t\t\t \t\t \t\t\t\t\t \t\t\t", "# https://codeforces.com/problemset/problem/937/A\r\n# from collections import Counter\r\n# taking an input list\r\nt = int(input())\r\ninput_list = list(map(int, input().strip().split())) \r\n \r\n# items = Counter(input_list).keys()\r\n# print(len(items)) \r\n\r\nl1 = [] \r\n# taking an counter\r\ncount = 0\r\n# travesing the array\r\nfor item in input_list:\r\n if item not in l1 and item != 0:\r\n count += 1\r\n l1.append(item)\r\n \r\n# printing the output\r\nprint(count)", "n=int(input())\r\nli=list([int(x) for x in input().split()])[:n]\r\n\r\nfor i in range(len(li)):\r\n if 0 in li:\r\n li.remove(0)\r\n\r\ns = set()\r\nfor elem in li:\r\n if elem not in s:\r\n s.add(elem)\r\n\r\nprint(len(s))", "n=int(input())\na=set(map(int,input().split()))\nif(0 in a):\n a.remove(0)\nprint(len(a))\n \t \t \t\t\t\t\t\t \t\t \t \t\t\t\t", "n=int(input())\r\na=[int(x) for x in input().split()]\r\ns=set(a)\r\nl=0\r\nif 0 in s:\r\n print(len(s)-1)\r\nelse:\r\n print(len(s))\r\n ", "m=int(input())\r\narr=list(map(int,input().split()))\r\narr.sort()\r\nk=1\r\nfor j in range(m-1):\r\n if arr[j]!=arr[j+1] and arr[j]!=0:\r\n k=k+1\r\nprint(k)\r\n \r\n", "n = int(input())\rparticipant = [int(i) for i in input().split()]\rarr = []\ri = 0\rwhile i < len(participant):\r if participant[i] != 0:\r arr.append(participant[i])\r i += 1\ra = set(arr)\rprint(len(a))", "num=int(input())\npos=list(map(int,input().split()))\nif(pos.count(0)):\n print(len(set(pos))-1)\nelse:\n print(len(set(pos)))\n\t\t\t \t\t \t\t \t\t\t\t\t\t\t \t\t\t \t \t", "n=int(input())\r\nar=[int(x) for x in input().split()][:n]\r\narr=set(ar)\r\nif 0 in ar:\r\n arr.remove(0)\r\nprint(len(arr))", "n = int(input())\na = list(map(int, input().split()))\na = [i for i in a if i != 0]\nprint(len(set(a)))\n\n \t\t \t\t \t\t \t\t \t\t\t\t\t\t \t \t\t\t", "n=int(input())\ns=list(map(int,input().split()))\ns.sort()\nc=[]\nfor i in s:\n if i not in c:\n if(i!=0):\n c.append(i)\nprint(len(c))\n\t \t\t \t \t \t \t\t\t \t \t \t", "g1=int(input())\nh1=list(map(int,input().split()))\nwhile(0 in h1):\n h1.remove(0)\nh1=set(h1)\nprint(len(h1))\n \t\t \t\t \t\t \t\t\t \t\t\t \t \t\t\t", "n = int(input())\r\ns = set(map(int, str(input()).split()))\r\n\r\nif 0 in s:\r\n s.remove(0)\r\n\r\nprint(len(s))", "n=int(input())\r\nl=list(map(int,input().split()))\r\ns=set(l)\r\nl1=list(s)\r\na=l1.count(0)\r\nif(a==0):\r\n print(len(l1))\r\nelse:\r\n print(len(l1)-1)", "x = int(input())\r\na = list(map(int, input().split()))\r\na = sorted(a)\r\nn = []\r\nfor i in range (x):\r\n if a[i] != 0:\r\n n.append(a[i])\r\nnums = sorted(n)\r\n\r\nres = []\r\ncount = 1\r\nfor i in range(1, len(nums)):\r\n if nums[i - 1] != nums[i]:\r\n count += 1\r\n\r\nprint(count)", "n = int(input())\r\nm = list(map(int,input().split()))\r\nm.sort()\r\nk = 0\r\nif m[0] > 0:\r\n k += 1\r\nfor i in range(1, len(m)):\r\n if m[i] > 0 and m[i] != m[i-1]:\r\n k += 1\r\nprint(k)", "n=int(input())\r\nl=list(map(int,input().split()))\r\nd={}\r\nfor i in l:\r\n if i!=0:\r\n if i in d:\r\n d[i]+=1\r\n else:\r\n d[i]=1\r\nprint(len(d)) ", "n = input()\r\nppls = list(map(int,input().split()))\r\n\r\n\r\nif min(ppls) == max(ppls):\r\n\tprint(1)\r\nelse:\r\n\tways = set(ppls)\r\n\tif 0 in ways:\r\n\t\tprint(len(ways) - 1)\r\n\telse:\r\n\t\tprint(len(ways))\r\n", "n = int(input())\np = input().split(' ') # >3 : 3,1,2\nres = set(p)\ncontar = 0\nfor i in res:\n if i == '0':\n continue\n else : \n contar+=1\n\nprint(contar)", "t = int(input())\r\nscores = input().split()\r\nnum_awarded = len(set(scores)) - (1 if '0' in scores else 0)\r\nprint(num_awarded)\r\n", "n,cnt=int(input()),0\r\na=set(input().split())\r\na.discard('0')\r\nprint(len(a))", "n=int(input())\nns=set(input().split())\nif '0' in ns:\n ns.remove('0')\nprint(len(ns))\n \t\t\t\t \t \t \t \t \t \t\t \t \t \t", "n = int(input())\narr = list(map(int,input().split()))\na = list(set(arr))\nif 0 in a:\n print(len(a)-1)\nelse:\n print(len(a))\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\na.sort()\r\ni=0\r\nwhile i<len(a):\r\n if a[i]==0:\r\n del(a[0])\r\n continue\r\n i+=1\r\nprint(len(list(set(a))))", "n = int(input())\r\na = [int(x) for x in input().split()]\r\na.sort()\r\nind = 0\r\nwhile ind < n and a[ind] == 0:\r\n ind += 1\r\n\r\ncnt = 0\r\nfor i in range(ind, n):\r\n if i > 0 and a[i] != a[i - 1] and a[i - 1] != 0:\r\n cnt += 1\r\n\r\nprint(cnt + 1)\r\n", "n = int(input())\na = list(map(int,input().split()))\n\ns = list(set(a))\n\nif(0 in s):\n print(len(s)-1)\nelse:\n print(len(s))\n\n\t \t\t \t\t\t\t \t\t \t\t \t\t \t\t \t", "n=int(input())\nli=[int(x) for x in input().split()]\nli=list(set(li))\nfor i in li:\n\tif i==0:\n\t\tli.remove(i)\nprint(len(li))\n\t \t\t\t \t \t\t\t \t\t\t\t\t \t", "n=int(input())\nli=list(map(int,input().split()))\nli.sort()\nfor i in range(len(li)):\n if(li[i]>0):\n k=i \n break\nprint(len(set(li[i:])))\n \t \t\t \t \t \t \t \t \t \t\t\t \t", "a=int(input())\ni=0\ns=[]\nb=list(map(int,input().split()))\n\n\ns1=list(set(b))\nq=s1.count(0)\nif q!=0:\n s1.remove(0)\nprint(len(s1))\n\n", "p= int(input())\n\nq = list(map(int,input().split()))\n\nq = [i for i in q if(i!=0)]\n\nprint(len(set(q)))\n \t \t \t \t\t\t \t\t\t \t \t \t \t\t\t\t", "n = int(input())\r\na = list(set(list(map(int, input().split()))))\r\nprint(len(a)-int(min(a)==0))\r\n", "n=int(input())\r\na=sorted(list(map(int,input().split())))\r\nx=[]\r\nfor i in range(len(a)):\r\n if a[i]!=0:\r\n x.append(a[i])\r\n\r\nprint(len(list(set(x))))\r\n \r\n\r\n", "from collections import Counter\r\ndef func():\r\n n=int(input())\r\n l=list(map(int,input().split()))\r\n s=set(l)\r\n if 0 in s:\r\n print(len(s)-1)\r\n return\r\n print(len(s))\r\n \r\nt=1\r\n#t=int(input())\r\nfor i in range(t):\r\n func()", "n = int(input())\r\nl = list(map(int,input().split()))\r\nans = []\r\nfor i in l:\r\n while i!=0 and ans.count(i)==0:\r\n ans.append(i)\r\nprint(len(ans))", "n=int(input())\narr=list(map(int,input().split()))\narr1=[]\nfor i in range(n):\n if arr[i]!=0:\n arr1.append(arr[i])\narr3=list(set(arr1))\nprint(len(arr3))\n\t \t\t \t \t \t \t \t \t\t\t \t\t \t\t", "t=int(input())\nsti=list(map(int,input().split()))\nsti2=set(sti)\nc=0\nfor i in sti2:\n\tif i!=0:\n\t\tc=c+1\nprint(c)\n\t\t\t\t \t \t \t\t \t\t\t\t\t\t\t \t \t\t \t\t", "input()\na=set(list(map(int,input().split())))\na=list(a)\nprint(len(a)-a.count(0))", "# import sys\r\n# sys.stdin=open(\"input.in\",'r')\r\n# sys.stdout=open(\"outp.out\",'w')\r\nn=int(input())\r\na=list(map(int,input().split()))\r\ns=set(a)\r\nif 0 in s:\r\n\ts.remove(0)\r\nprint(len(s))\t\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\nl.sort(reverse=True)\r\nz=[]\r\nfor ele in l:\r\n if ele>0:\r\n z.append(ele)\r\nk=set(z)\r\nprint(len(k))", "participants = int(input())\r\nsetParti = set(map(int, input().split()))\r\nans = 0\r\nfor j in setParti:\r\n if(j != 0):\r\n ans += 1\r\nprint(ans)", "a = int(input())\r\nli = list(map(int, input().split()))\r\nli = set(li)\r\nli = list(li)\r\na = len(li)\r\nli.sort()\r\nc = 0\r\nfor i in range(a):\r\n if li[i] == 0:\r\n pass\r\n else:\r\n c += 1\r\nprint(c)", "n=int(input())\r\nl=list(map(int,input().split()))\r\nt=[]\r\nfor i in range(n):\r\n\tif l[i] not in t and l[i]!=0:\r\n\t\tt.append(l[i])\r\nprint(len(t))\r\n", "n=int(input())\r\nl1=list(map(int,input().split()))\r\ns1=set(l1)\r\nif(l1.count(0)>0):\r\n s1.remove(0)\r\nprint(len(s1))", "def olympiad(n,a):\r\n v=set()\r\n for i in a:\r\n if i>0:\r\n v.add(i)\r\n return(len(v))\r\nn=int(input())\r\na=[]\r\na = input().strip().split()\r\na = list(map(int, a))\r\nprint(olympiad(n,a))", "n=int(input())\nl=list(map(int,input().split()))\nl.sort()\narr=set(l)\nval=0\narr=[i for i in arr if i != val]\nprint(len(arr))\n\t \t\t \t \t \t\t \t \t\t \t \t\t \t", "n = int(input())\r\na = list(map(int, input().split()))\r\nif 0 not in a:\r\n print(len(set(a)))\r\nelse:\r\n print(len(set(a))-1)", "#!/usr/bin/env python\n# coding=utf-8\n'''\nAuthor: Deean\nDate: 2021-11-08 23:04:41\nLastEditTime: 2021-11-08 23:07:02\nDescription: Olympiad\nFilePath: CF937A.py\n'''\n\n\ndef func():\n _ = int(input())\n points = map(int, input().strip().split())\n print(len(set(points) - set([0])))\n\n\nif __name__ == '__main__':\n func()\n", "n=int(input())\nS=[int(i) for i in input().split()]\nS.sort()\nS1=[]\nfor i in S:\n if i!=0:\n S1.append(i)\nprint(len(set(S1)))\n \t \t\t\t\t\t \t \t\t\t \t\t\t \t \t", "n = int(input())\r\nl=list(set(map(int,input().split())))\r\nif(0 not in l):\r\n print(len(l))\r\nelse:\r\n print(len(l)-1)", "n=int(input())\r\na=list(map(int,input().strip().split()))[:n]\r\nb=set(a)\r\nl=len(b)\r\nif 0 in b:\r\n print(l-1)\r\nelse:\r\n print(l)", "input()\nmylist = list(map(int, input().split()))\nnums = []\n\nfor i in mylist:\n if i != 0 and i not in nums:\n nums.append(i)\n\nprint(len(nums))", "kl=int(input())\nu=list(map(int,input().split()))\nwhile(0 in u):\n u.remove(0)\nu=set(u)\nprint(len(u))\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\nfreq=[0]*(max(a)+1)\r\n\r\nfor i in a:\r\n freq[i]=1\r\n\r\nprint(freq[1:].count(1))", "n=int(input())\r\npo=list(map(int,input().split()))\r\nc=0\r\nfor item in list(set(po)):\r\n if item>0: \r\n c+=1\r\n else:\r\n pass\r\nprint(c)\r\n\r\n ", "import random\r\nn=int(input())\r\nscore=set(list(map(int,input().split())))\r\nif 0 in score :score.remove(0)\r\nprint(len(score))\r\n", "n = int(input())\na= list(map(int,input().split()))\na=set(a)\na= list(a)\np=0\nif p in a:\n\ta.remove(p)\nprint(len(a))\n \t \t \t\t \t \t\t\t\t \t \t\t \t\t\t\t", "n = int(input())\na = set(int(i) for i in input().split())\na.discard(0)\nprint(len(a))\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\n\r\nll=set(l)\r\nif(0 in ll):\r\n print(len(ll)-1)\r\nelse: \r\n print(len(ll))\r\n \r\n \r\n\r\n \r\n \r\n \r\n ", "def P(n):\r\n res=1\r\n for i in range(1, n+1):\r\n res*=i\r\n return res\r\ndef A(n,k):\r\n res=0\r\n return P(n)/P(n-k)\r\ndef C(n, k):\r\n return int(P(n)/(P(n-k)*P(k)))\r\n\r\n\r\n'''a=int(input())\r\nb=[int(i) for i in input().split()]\r\nb.sort()\r\nres=(b[-1]-b[0])\r\nd=0\r\ne=0\r\nif b[-1]==b[0]:\r\n resb=(a*(a-1))//2\r\nelse:\r\n f=b[-1]\r\n j=b[0]\r\n for i in b:\r\n if i==f:\r\n d+=1\r\n if i==j:\r\n e+=1\r\n resb=d*e\r\nprint(res, resb)'''\r\na=input()\r\nb=[int(i) for i in input().split() if i!='0']\r\nc=set(b)\r\nprint(len(c))\r\n", "n=int(input())\r\nl=[int(x) for x in input().split(\" \")]\r\nl.sort()\r\nl1=[]\r\nc=0\r\nfor i in l:\r\n if i not in l1 and i!=0:\r\n l1.append(i)\r\n c+=1\r\nprint(c) \r\n ", "n=int(input());s=set(map(int,input().split()));print(len(s)-int(0 in s))\n", "n = int(input())\r\nst = set(map(int, input().split()))\r\nif 0 in st:\r\n st.discard(0)\r\nprint(len(st))\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\nnumbers = []\r\na.sort()\r\nfor i in range(n):\r\n\tif a[i] not in numbers and a[i] != 0:\r\n\t\tnumbers.append(a[i])\r\nprint(len(numbers))", "n=int(input())\r\na=list(map(int,input().split())) \r\nb=set(a)\r\nb=list(b)\t\t\t\r\nif 0 in a:\r\n\tprint(len(b)-1)\r\nelse:\r\n\tprint(len(b))", "n = int(input())\narr = list(map(int,input().split()))\nwhile( 0 in arr):\n arr.remove(0)\nprint(len(set(arr))) \n \t\t\t \t \t \t\t\t \t\t \t \t\t \t\t", "n = int (input())\r\narr = input ().split()\r\na = []\r\nfor i in arr:\r\n a.append (int (i))\r\nl = [0]*601\r\ncount = 0\r\nfor i in a:\r\n if l[i]==0 and i!=0:\r\n count+=1\r\n l[i]=1\r\nprint (count)", "n = int(input())\r\na = [int(s) for s in input().split(' ')]\r\nanswer = len(set([x for x in a if x]))\r\nprint(answer)", "n = int(input())\r\na = list(map(int, input().split()))\r\na = list(filter(lambda x: x > 0, a))\r\na = set(a)\r\nprint(len(a))", "mvarrrrrr=int(input())\nmvarrrrrr=list(map(int,input().split()))\nwhile(0 in mvarrrrrr):\n mvarrrrrr.remove(0)\nmvarrrrrr=set(mvarrrrrr)\nprint(len(mvarrrrrr))\n\t\t\t\t\t \t \t\t\t\t\t\t\t \t \t \t\t \t\t", "a=int(input())\nt=list(map(int,input().split()))\nwhile(0 in t):\n t.remove(0)\nt=set(t)\nprint(len(t))\n\t\t \t\t \t \t \t\t \t \t\t\t\t \t\t\t", "def main_function():\r\n n = int(input())\r\n p = [int(i) for i in input().split(\" \")]\r\n hash = [0 for i in range(605)]\r\n for i in p:\r\n if not i == 0:\r\n hash[i] += 1\r\n count = 0\r\n for i in hash:\r\n if i != 0:\r\n count += 1\r\n return count\r\n\r\n\r\n\r\nprint(main_function())", "n=int(input())\r\na=list(map(int,input().split()))\r\nif 0 in set(a):\r\n print(len(set(a))-1)\r\nelse:\r\n print(len((set(a))))", "n=int(input())\nlstr1=list(map(int,input().split()))\nlstr2=set(lstr1)\ncv=0\nfor i in lstr2:\n\tif i!=0:\n\t\tcv=cv+1\nprint(cv)\n\n\n\t \t \t \t\t \t \t\t \t\t\t\t\t \t\t\t\t\t\t\t", "c=0\na=int(input())\nb=list(map(int,input().split()))\nb=list(dict.fromkeys(b))\nfor i in range(len(b)):\n if b[i]!=0:\n c+=1\nprint(c)\n \t\t\t \t\t \t \t\t \t\t\t\t \t", "n=int(input())\nl=list(map(int,input().split()))[:n]\n# print(l)\nnew=[]\nfor item in l:\n if item not in new:\n new.append(item)\n# print(new)\ncount=0\nfor i in new:\n if(i==0):\n new.remove(0)\n# print(new)\nprint(len(new))\n \t \t\t \t\t\t\t \t \t\t \t \t\t\t\t\t\t", "n=int(input())\na=list(map(int,input().strip().split()))[:n]\nb=set(a)\nl=len(b)\nif 0 in b:\n print(l-1)\nelse:\n print(l)\n \t \t \t \t \t \t\t \t", "input()\r\nstring=input()\r\nl=set(map(int,string.split()))\r\nresult=0\r\nfor i in l:\r\n\tif i==0:\r\n\t\tcontinue\r\n\telse:\r\n\t\tresult+=1\r\nprint(result)\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\ns=list(set(l))\r\ns.sort()\r\nc=0\r\nfor i in s:\r\n if i>0:\r\n c=c+1\r\nprint(c)", "n = input()\n\nscores = list(map(int, input().split()))\n\nways = set()\n\nfor i in scores:\n if i > 0:\n ways.add(i)\n\nprint(len(ways))", "tc=int(input())\nvct=list(map(int,input().split()))\nwhile(0 in vct):\n vct.remove(0)\nvct=set(vct)\nprint(len(vct))\n \t\t\t \t \t \t\t \t\t\t \t \t \t\t \t \t", "n = int(input())\nscores = list(map(int,input().split()))\ncount = 0\nscores = set(scores)\nfor i in scores:\n if i != 0 :\n count += 1\nprint(count)\n", "n = int(input())\r\nl = list(map(int, input().split()))\r\nl1 = []\r\nl1 = list(set(l))\r\nc = 0\r\nfor i in range(len(l1)):\r\n if l1[i] != 0:\r\n c += 1\r\nprint(c)", "n=input( )\nk=len(set(input( ).split( ))-{'0'})\nprint(k)\n \t \t \t \t\t \t\t\t \t \t\t\t \t", "n = int(input())\r\ns = list(map(int,input().split()))\r\n\r\nr = 0\r\nfor x in sorted(list(set(s))):\r\n if x!=0:\r\n r+=1\r\nprint(r)\r\n", "\nn = int(input())\n\nl = list(map(int, input().split()))\n\nn = []\n\nfor a in l:\n\tif a == 0:\n\t\tcontinue\n\tif a not in n:\n\t\tn.append(a)\n\nprint(len(n))\n\n \t \t \t \t\t\t\t\t \t\t\t \t \t\t\t \t \t", "n = int(input())\r\nl = [int(i) for i in input().split(\" \")]\r\ns = list(set(l))\r\nif 0 in s:\r\n print(len(s) - 1)\r\nelse:\r\n print(len(s))", "input()\r\na = list(map(int, input().split()))\r\na.sort()\r\np = -1\r\ns = 0\r\nfor i in range(0, len(a)):\r\n if a[i] != 0 and a[i] != p:\r\n s = s + 1\r\n p = a[i]\r\nprint(s)\r\n", "input()\r\ns = set([int(x) for x in str(input()).split(' ')])\r\ns.discard(0)\r\nprint(len(s))", "n=int(input())\na=list(map(int,input().split()))\nb=set(a)\nif 0 in b:\n print(len(b)-1)\nelse:\n print(len(b))\n \t \t\t\t \t \t\t\t \t \t", "n = int(input())\r\nA = list(map(int, input().strip().split()))\r\nmyset = {''}\r\nfor i in range(len(A)):\r\n if A[i] != 0:\r\n myset.add(A[i])\r\n\r\nprint(len(myset)-1)", "a=int(input())\r\nb=input().split()\r\nd={}\r\nfor i in range(a):\r\n if b[i] not in d and b[i]!='0':\r\n d[b[i]]=i\r\nprint(len(d)) ", "siri = int(input())\nteja = list(map(int,input().split()))\nteja = [x for x in teja if(x!=0)]\nprint(len(set(teja)))\n\t \t\t \t \t \t \t \t \t \t \t\t \t\t\t\t\t\t", "n=int(input())\nc=0\na=[int(x) for x in input().split()]\na.sort()\na=set(a)\nfor i in a:\n if i!=0:\n c+=1\nprint(c)\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()))\nwhile(0 in L):\n L.remove(0)\nL=set(L)\nprint(len(L))\n\n \t\t \t \t\t\t\t \t\t\t \t \t \t\t\t\t", "test_case = int(input())\npoints = list(map(int, input().split(\" \")))\ntheSet = set(points)\nif 0 in theSet:\n theSet.remove(0)\nprint(len(theSet))\n \t \t\t\t\t \t \t \t \t \t\t \t\t\t", "n, a = int(input()), set(int(i) for i in input().split() if i != \"0\")\nres = len(a)\nprint(res)\n", "n = int(input())\r\nmoo = list(map(int, input().split()))\r\npor = set()\r\nfor a in moo:\r\n if a != 0:\r\n por.add(a)\r\nprint(len(por))", "a=int(input())\r\narr=list(map(int,input().split()))\r\narr.sort()\r\nc=1\r\nfor i in range(a-1):\r\n if arr[i]!=arr[i+1] and arr[i]!=0:\r\n c=c+1\r\nprint(c)\r\n \r\n", "n=int(input())\na=[int(i) for i in input().split(\" \")]\na=set(a)\na=list(a)\ncount=0\nfor i in a:\n\tif i!=0:\n\t\tcount=count+1\nprint(count)\n \t \t \t \t \t \t \t \t\t\t\t\t", "# your code goes here\n# your code goes here\nn=int(input())\nli=[int(x) for x in input().split()]\nli.sort()\nc=0\nif(li[0]!=0):\n\tc+=1\nfor i in range(1,n):\n\tif(li[i]!=0 and li[i-1]!=li[i]):\n\t\tc+=1\nprint(c)\n\t\t\t \t \t \t\t\t \t \t \t\t \t \t \t", "n = int(input())\r\nli = set(map(int,input().split()))\r\n# li = sorted(li)\r\n# print(li)\r\nif 0 in li:\r\n print(len(li)-1)\r\nelse:\r\n print(len(li))", "mo=1000000007\r\nfrom collections import Counter as dic\r\nfrom functools import cmp_to_key as cmp\r\nimport sys\r\ndef prin(a):\r\n sys.stdout.write(str(a)+'\\n')\r\ndef input():\r\n return sys.stdin.readline().strip()\r\ndef checkbit(n,k):\r\n return ((1<<k)&n)!=0\r\ndef cbit(n):\r\n c=0\r\n while n!=0:\r\n n=n&(n-1)\r\n c+=1\r\n return c\r\ndef power(a,b):\r\n x=a\r\n ans=1\r\n while b!=0:\r\n if b&1==1:\r\n ans=((ans %mo)*(x%mo))%mo\r\n x=((x%mo)*(x%mo))%mo\r\n b>>=1\r\n return(ans)\r\ndef setbit(a,b):\r\n return (a|(1<<b))\r\ndef cunset(a):\r\n c=0\r\n while a!=0:\r\n if a&1==0:\r\n c+=1\r\n a>>=1\r\n return c\r\ndef subsets(l,n):\r\n ans=[]\r\n for i in range(2**(n)+1,2**(n+1)):\r\n x=bin(i)[3:]\r\n x=[l[j] for j in range(n) if x[j]=='1'] \r\n x.sort()\r\n ans.append(x)\r\n ans.sort()\r\n return ans\r\n\r\nn=int(input())\r\nl=list(map(int,input().split()))\r\ns=set(l)\r\ns.discard(0)\r\nprint(len(s))", "n = int(input())\r\na = set(map(int, input().split()))\r\nt = len(a)\r\nif 0 in a:\r\n t -= 1\r\nprint(t)", "n=int(input())\r\nslist=list(map(int,input().split()))\r\nsset=list(set(slist))\r\nif(0 in sset):\r\n sset.remove(0)\r\nprint(len(sset))", "# your code goes here\r\nn = int(input())\r\nl = list(map(int,input().split()))\r\ns = set(l)\r\nf = list(s)\r\n# print(*f)\r\nc = 0\r\nfor i in range(len(f)):\r\n\tif f[i]!=0:\r\n\t\tc = c+1\r\nprint(c)", "# A. Olympiad\n\nn = int(input())\na = set(map(int, input().split()))\nif 0 in a:\n print(len(a) - 1)\nelse:\n print(len(a))\n", "n=int(input())\r\na=list(map(int,input().split()))\r\na = [i for i in a if i != 0]\r\nprint(len(set(a)))\r\n", "testcase=int(input())\nl=list(map(int,input().split()))\nif(l.count(0)):\n print(len(set(l))-1)\nelse:\n print(len(set(l)))\n \t \t\t\t\t \t \t \t\t \t \t \t", "n = int(input())\r\na = list(map(int, input().split()[:n]))\r\na.sort()\r\nhighest = 0\r\ncounter = 0\r\n\r\nfor i in a:\r\n if i > highest:\r\n highest = i\r\n counter += 1\r\nprint(counter)\r\n\r\n", "def answer():\n if(0 in s):s.remove(0)\n\n return len(s)\n\n\nn=int(input())\ns=set(map(int,input().split()))\n\nprint(answer())\n\n \t \t\t \t\t\t \t\t\t \t \t\t\t\t \t", "n=map(int,input().split())\nx=list(map(int,input().split()))\ny= set()\nfor i in x :\n if i !=0:\n y.add(i)\nprint(len(y))", "a = int(input())\nh = list(map(int,input().split()))\nh = [i for i in h if(i!=0)]\nprint(len(set(h)))\n\t \t\t \t \t \t\t\t\t \t\t\t \t\t\t\t\t\t", "n = int(input())\r\nm = [int(i) for i in input().split()]\r\nm = list(set(m))\r\nif 0 in m:\r\n print(len(m)-1)\r\nelse:\r\n print(len(m))", "n = int(input())\n\nscores = [int(num) for num in input().split(' ')]\n\ndef getWays(lista):\n\tways = []\n\tfor num in lista:\n\t\tif num == 0:\n\t\t\tnext\n\t\telif num in ways:\n\t\t\tnext\n\t\telse:\n\t\t\tways.append(num)\n\treturn len(ways)\n\nprint(getWays(scores))\n \t \t\t \t \t \t\t \t\t \t\t", "a = int(input())\nh = list(map(int,input().split()))\nh = [o for o in h if(o!=0)]\nprint(len(set(h)))\n \t\t\t \t\t \t \t\t\t \t\t \t\t\t \t\t\t", "try:\n n=int(input())\n li=set(map(int,input().split()))\n li.remove(0)\n print(len(li))\nexcept KeyError:\n print(len(li))\n\n\t\t \t \t \t\t\t\t\t \t \t\t \t \t\t \t\t", "t=int(input())\ns=list(map(int,input().split()))\nk=[i for i in s if(i!=0)]\nprint(len(set(k)))\n\t \t\t \t \t\t \t \t\t \t \t\t \t\t\t", "n=int(input())\r\narr=[int(i) for i in input().split(\" \")]\r\ns=set(arr)\r\nif 0 not in s:\r\n print(len(s))\r\nelse:\r\n print(len(s)-1)", "n = int(input())\r\nnums = [int(j) for j in input().split()]\r\nfreq = 600 * [0]\r\ncount = 0\r\nfor j in range(n):\r\n if nums[j] != 0:\r\n freq[nums[j] - 1] += 1\r\n if freq[nums[j] - 1] == 1:\r\n count += 1\r\nprint(count)\r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\nw=set(a)\r\nr=[]\r\nfor i in w:\r\n if i>0:\r\n r.append(i)\r\nprint(len(r))\r\n", "a = int(input())\r\nlst = [*(map(int, input().split(' ')))]\r\nlst2 = lst.copy()\r\n\r\nfor ele in lst:\r\n if ele == 0:\r\n lst2.remove(ele)\r\n\r\nb = set(lst2)\r\nprint(len(b))", "n = int(input())\r\na = list(map(int,input().split()))\r\nnewArray = []\r\nfor i in range(n):\r\n if a[i] != 0:\r\n newArray.append(a[i])\r\nprint(len(set(newArray)))\r\n", "# cook your dish here\r\n\r\ndef main():\r\n n = int(input())\r\n scores = list(map(int, input().strip().split()))\r\n dist_scores = set(scores)\r\n \r\n if 0 in dist_scores:\r\n print(len(dist_scores)-1)\r\n else:\r\n print(len(dist_scores))\r\n \r\n \r\nmain()\r\n", "n=int(input())\r\nscores=list(map(int,input().split()))\r\n\r\nno_of_ways=0\r\n\r\nfor i in range(len(scores)-1):\r\n for j in range(len(scores) - 1):\r\n if scores[j] > scores[j + 1]:\r\n scores[j], scores[j + 1] = scores[j + 1], scores[j]\r\n\r\nfor i in range(len(scores)-1):\r\n if scores[i]!=0 and scores[i]!=scores[i+1]:\r\n no_of_ways+=1\r\n\r\nprint(no_of_ways+1)", "n=int(input())\nar=[int(x) for x in input().split()][:n]\narr=set(ar)\nif 0 in ar:\n arr.remove(0)\nprint(len(arr))\n\t\t\t\t\t\t \t\t \t \t\t\t \t \t \t\t\t\t\t", "mvarrrrrrr1=int(input())\nmvarrrrrrr2=list(map(int,input().split()))\nwhile(0 in mvarrrrrrr2):\n mvarrrrrrr2.remove(0)\nmvarrrrrrr2=set(mvarrrrrrr2)\nprint(len(mvarrrrrrr2))\n\t \t \t\t \t\t\t\t\t\t \t\t", "mvarrrrrr1=int(input())\nmvarrrrrr2=list(map(int,input().split()))\nwhile(0 in mvarrrrrr2):\n mvarrrrrr2.remove(0)\nmvarrrrrr2=set(mvarrrrrr2)\nprint(len(mvarrrrrr2))\n \t\t \t\t\t \t\t \t \t \t\t\t\t \t\t", "n = input()\ns = set(input().split())\nif \"0\" in s:\n s.remove(\"0\")\nprint(len(s))\n", "n = int(input())\r\narr = list(map(int,input().split()))\r\nmapp = {}\r\n\r\nfor i in arr:\r\n if i in mapp:\r\n mapp[i] += 1\r\n else:\r\n mapp[i] = 1\r\n \r\nif 0 in mapp and len(mapp)>2:\r\n print(len(mapp)-1)\r\nelif 0 in mapp and len(mapp) == 2:\r\n print(1)\r\nelif len(mapp)>0:\r\n print(len(mapp))", "input(); print(len(set(filter(lambda x:int(x), input().split()))))\n \t \t \t\t \t\t\t \t\t \t\t\t \t\t\t\t\t \t", "variable1=int(input())\nvariable2=list(map(int,input().split()))\nwhile(0 in variable2):\n variable2.remove(0)\nvariable2=set(variable2)\nprint(len(variable2))\n\n \t \t \t \t \t \t\t \t\t\t\t \t\t\t\t", "input()\r\nlst=list(map(int, input().split(\" \")))\r\n\r\nlst1=list(set(lst))\r\nif 0 in lst1:\r\n lst1.remove(0)\r\nprint(len(lst1))\r\n", "n=int(input())\nval=list(map(int,input().split()))\nwhile n:\n s=[]\n while (n):\n for i in val: \n if i>0:\n s.append(i)\n\n n=n-1\n x=set(s)\n print(len(x))\n \t \t \t\t\t \t \t\t\t\t\t \t\t \t \t", "n=int(input())\r\nli=list(filter(lambda x: x!=\"0\",input().split()))\r\nprint(len(set(li)))", "n=int(input())\r\ns=set(map(int,input().split()))\r\nls=list(s)\r\nzero=ls.count(0)\r\nif zero>0:\r\n\tprint(len(ls)-1)\r\nelse:\r\n\tprint(len(ls))", "n=int(input())\r\nl=list(map(int,input().split()))\r\nl=list(set(l))\r\nb=[]\r\nfor i in l:\r\n if i>0:\r\n b.append(i)\r\nprint(len(b))\r\n\r\n \r\n \r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\nl=list(set(a))\r\nif(0 not in l):\r\n print(len(l))\r\nelse:\r\n print(len(l)-1)", "n = int(input())\r\nscores = list(map(int,input().split()))\r\n\r\nscores_set = set(scores)\r\nif 0 in scores_set: scores_set.remove(0)\r\nprint(len(scores_set))", "n=int(input())\r\nm=set(map(int,input().split()))\r\nfor i in m:\r\n\tif i==0:\r\n\t\tm.remove(0)\r\n\t\tbreak\r\nprint(len(m))", "number_of_participants = int(input())\nparticipants_scores = input().split(' ')\n\nfor i in range(number_of_participants):\n participants_scores[i] = int(participants_scores[i])\n\ndifferent_scores = set(participants_scores)\n\nif 0 in different_scores:\n print(len(different_scores) - 1)\nelse:\n print(len(different_scores))", "# @Chukamin ZZU_TRAIN\n\ndef main():\n times = int(input())\n data = set(map(int, input().split()))\n size = len(data)\n if 0 in data:\n print(size - 1)\n else:\n print(size)\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", "n=input()\ns=len(set(input().split())-{'0'})\nprint(s)\n\n\t \t \t\t\t\t\t\t \t\t \t\t\t\t \t\t", "input()\r\na = sorted(list(map(int, input().split())))\r\nprint(len(set(a))) if a[0] != 0 else print(len(set(a))-1)", "n=int(input())\nlist1=list(map(int,input().split()))\nx=set(list1)\nif 0 in x:\n print(len(x)-1)\nelse:\n print(len(x))\n\t\t\t\t \t \t \t\t\t\t \t \t\t\t\t \t\t\t\t", "b=int(input())\narr=list(map(int,input().split()))\narr.sort()\na=1\n\nfor i in range(b-1):\n if arr[i]!=arr[i+1] and arr[i]!=0:\n a=a+1\nprint(a)\n \n\n \t \t\t\t\t\t\t\t\t \t\t \t\t\t \t\t\t \t", "n=int(input())\na=list(map(int,input().split()))\nb=set(a)\nc=0\nfor i in b:\n\tif i!=0:\n\t\tc+=1\nprint(c)\n \t\t\t\t \t \t\t\t \t\t \t \t \t \t", "n = int(input())\nprint(len(set([int(x) for x in input().split(' ') if int(x) != 0])))\n", "n = int(input())\na = [0] * 601\nfor x in input().split():\n a[int(x)] = 1\na[0] = 0\nprint(sum(a))\n", "n=int(input())\na=list(map(int,input().split()))\na.sort()\nc=[]\nfor i in a:\n if i not in c:\n if(i!=0):\n c.append(i)\nprint(len(c))\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()))\na=list(set(a))\ncount=0\nfor i in a:\n if i != 0:\n count+=1\nprint(count)\n\n\t\t \t \t \t\t\t \t\t \t\t \t \t\t\t\t\t \t", "\na = int(input())\nb = list(map(int,input().split()))\nc = set(b)\nd = list(c)\ne = d.count(0)\nprint(len(c)-e)\n", "n=int(input())\nl=list(map(int,input().split()))\na=[]\nfor i in l:\n if i==0:\n continue\n elif i not in a:\n a.append(i)\nprint(len(a))\n\t \t\t\t\t\t \t \t \t\t \t\t\t \t\t", "a = int(input())\r\nS = list(set([int(i) for i in input().split()]))\r\nif(S.count(0)!=0):\r\n print(len(S)-1)\r\nelse:\r\n print(len(S))\r\n", "tis=int(input())\nsti=list(map(int,input().split()))\nsti2=set(sti)\ncsi=0\nfor i in sti2:\n\tif i!=0:\n\t\tcsi=csi+1\nprint(csi)\n \t\t\t\t \t \t \t \t\t \t\t \t \t \t\t\t \t", "n = int(input())\nli = list(map(int,input().split()))\nli.sort()\narr = set(li)\nval = 0\narr = [i for i in arr if i != val]\nprint(len(arr))\n\t \t \t \t\t \t \t\t\t \t \t\t\t\t\t\t \t\t\t", "input();*r,=map(int,input().split());print(len(set(r))-(0 in r))", "N = int(input())\nLISTA = input().split(\" \")\nLISTA.sort()\nN = len(LISTA)\nwhile LISTA[0] == '0':\n LISTA.remove('0')\nLISTA = list(set(LISTA))\nprint(len(LISTA))", "n=int(input())\r\np=list(map(int,input().split()))\r\np=set(p)\r\np=list(p)\r\nif 0 in p:\r\n p.remove(0)\r\nprint(len(p))", "#-------------Program--------------\r\n#----Kuzlyaev-Nikita-Codeforces----\r\n#-------------Training-------------\r\n#----------------------------------\r\n\r\nn=int(input())\r\na=list(set(list(map(int,input().split()))))\r\nif a.count(0)!=0:print(len(a)-1)\r\nelse:\r\n print(len(a))", "num1=int(input())\nnum2=list(map(int,input().split()))\nwhile(0 in num2):\n num2.remove(0)\nnum2=set(num2)\nprint(len(num2))\n\t \t \t \t\t \t\t \t\t \t\t\t \t\t \t\t \t", "input()\r\na=list(map(int,input().split()))\r\na=list(set(a))\r\ns=0\r\nfor i in a:\r\n if i!=0:s=s+1\r\nprint(s)", "import sys\r\nimport math\r\nimport bisect\r\n\r\ndef main():\r\n n = int(input())\r\n A = list(map(int, input().split()))\r\n s = set(A)\r\n if 0 in s:\r\n s.remove(0)\r\n print(len(s))\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n = int(input())\r\nlis = [int(i) for i in input().split()]\r\nway = set()\r\nfor i in lis:\r\n if i != 0:\r\n way.add(i)\r\nprint(len(way))", "import sys\r\nn = int(input())\r\na = list(map(int, input().split()))\r\n\r\na.sort()\r\nc = 1\r\nfor i in range(len(a)-1):\r\n if a[i]!=a[i+1] and a[i]!=0:\r\n c+=1\r\nprint(c)", "#CF 937A\nn = int(input())\nlst = input().split()\n\nlst.sort()\n#print(lst)\npre = 0\nans = 0\nfor i in lst:\n if i != \"0\": #debug: != 0\n if i != pre:\n ans += 1\n pre = i\nprint(ans)", "def solve(t_id):\r\n n = int(input())\r\n a = list(map(int, input().split()))\r\n s = set(a)\r\n print(len(s) - (1 if 0 in a else 0))\r\nt = 1\r\n#t = int(input())\r\nfor t_id in range(1, t + 1):\r\n solve(t_id)\r\n t -= 1", "import sys\r\n\r\nrd = sys.stdin.readline\r\n\r\nn = int(rd())\r\na = set(map(int, rd().split()))\r\n\r\na.discard(0)\r\n\r\nprint(len(a))\r\n", "#problem 17\r\ninput()\r\nn = set(input().split())\r\nn.discard('0')\r\nprint(len(n))\r\n\r\n\r\n", "n = int(input())\r\na = [0] * 601\r\nb = [int(i) for i in input().split()]\r\nfor i in b:\r\n a[i] = 1\r\nprint(sum(a) - a[0])", "n = int(input())\r\na = list(map(int,input().split()))\r\na1 = [i for i in a if i!=0]\r\nl = set(a1)\r\nprint(len(l))\r\n", "from collections import *\r\na=int(input())\r\nb=list(map(int,input().split()))\r\nd=Counter(b)\r\nif b.count(0):\r\n\tprint(len(d)-1)\r\nelse :\r\n\tprint(len(d))", "import math\r\n# # for _ in range(int(input())):\r\n# # int(input())\r\n# # list(map(int,input().split()))\r\n\r\n# for _ in range(int(input())):\r\nn = int(input())\r\narr = set(map(int,input().split()))\r\nif 0 in arr:\r\n print(len(arr)-1)\r\nelse:\r\n print(len(arr))", "n=int(input())\na=[int(x) for x in input().split()]\na.sort()\nif(a[0]==0):\n count=0\nelse:\n count=1\nfor i in range(1,n):\n if(a[i]!=a[i-1] and a[i]!=0):\n count=count+1\nprint(count)\n \t \t\t \t\t\t \t \t\t\t\t\t \t \t\t\t \t\t", "input()\r\ns = list(set(list(map(int,input().split()))))\r\nif 0 in s: print(len(s)-1)\r\nelse: print(len(s))", "n = int(input())\r\na = list(map(int, input().rstrip().split(\" \")))\r\na.sort()\r\na = list(set(a))\r\nif a[0]==0:\r\n a.pop(0)\r\nprint(len(a))", "n=int(input())\r\na=[int(i) for i in input().split()][:n]\r\nnos=[]\r\ncnt=0\r\nfor i in range(n):\r\n if(a[i]!=0 and a[i] not in nos):\r\n nos.append(a[i])\r\n cnt+=1\r\n\r\nprint(cnt)", "# your code goes here\nn=int(input())\na=list(set(map(int,input().split())))\nif 0 in a:\n\tprint(len(a)-1)\nelse:\n\tprint(len(a))\n\t \t\t\t \t\t \t\t \t \t \t \t\t", "n = int(input())\nA = list(map(int, input().split()))\nB = set(A)\nif 0 in B:\n print(len(B)-1)\nelse:\n print(len(B))\n", "N=int(input())\r\nX=[int(i) for i in input().split()]\r\nA=set()\r\nfor i in X:\r\n if i!=0:\r\n A.add(i)\r\n#print(max(X)-min(X)-N+1)\r\nprint(len(A))\r\n", "n=int(input())\r\nk=0\r\nl=set(map(int,input().split()))\r\nif 0 in l: k-=1\r\nprint(len(l)+k)\r\n", "n=int(input())\r\nl=[*map(int,input().split())]\r\nr=set(l)\r\nif 0 in l:r.remove(0)\r\nprint(len(r))\r\n", "t=int(input())\nlst=list(map(int,input().split()))\nlst2=set(lst)\nc=0\nfor i in lst2:\n\tif i!=0:\n\t\tc=c+1\nprint(c)\n \t\t\t\t\t \t \t \t \t\t \t\t \t\t\t\t \t \t\t", "input()\r\nli =list(input().split())\r\nprint(len(set([i for i in li if i!='0'])))\r\n", "n=int(input())\r\ncount=0\r\nar=list(map(int,input().split()))[0:n]\r\nfor i in range (0,n):\r\n if(ar[i]==0):\r\n count+=1\r\nif(count!=0):\r\n print(len(set(ar))-1)\r\nelse:\r\n print(len(set(ar)))", "n=int(input())\r\nlis_1=list(map(int,input().split()))\r\nlis_1=list(set(lis_1))\r\nprint(len(lis_1)-lis_1.count(0))", "n=int(input())\r\nlist=set([int(i) for i in input().split()])-{0}\r\nprint(len(list))", "n = int(input())\nnums = list(map(int, input().split()))\n\nunique_nums = set()\nfor num in nums:\n if num > 0:\n unique_nums.add(num)\n\nprint(len(unique_nums))\n", "num=int(input())\narr=list(map(int,input().split()))\narr.sort()\nco=1\nfor i in range(len(arr)-1):\n\tif arr[i]!=arr[i+1] and arr[i]!=0:\n\t\tco+=1\nprint(co)\n \t \t\t \t\t\t\t\t\t \t\t \t\t \t\t\t \t\t", "a=int(input())\r\nb=list(map(int,input().split()))\r\nb=list(set(b))\r\nif 0 in b:\r\n print(len(b)-1)\r\nelse:\r\n print(len(b))", "k=int(input())\nu=list(map(int,input().split()))\nv=set(u)\nx=0\nfor i in v:\n\tif i!=0:\n\t\tx=x+1\nprint(x)\n\t\t \t \t \t\t\t \t\t\t \t\t\t\t \t\t\t \t \t\t", "# import sys\r\n# sys.stdin=open(\"input1.in\",\"r\")\r\n# sys.stdout=open(\"output1.out\",\"w\")\r\nN=int(input())\r\nL=list(map(int,input().split()))\r\nX=set(L)\r\nY=list(X)\r\nif Y[0]==0:\r\n\tprint(len(Y)-1)\r\nelse:\r\n\tprint(len(Y))", "n = int(input())\r\nlst = input().split()\r\nst = set(lst)\r\nif '0' in st:\r\n print(len(st)-1)\r\nelse:\r\n print(len(st))", "n = input()\r\narr_zero = input().split()\r\narr = list(filter(lambda x: x!='0', arr_zero))\r\nprint(len(set(arr)))", "n=input()\r\ns_set={int(val) for val in input().split() if not int(val)==0}\r\nprint(len(s_set))", "def removeAllBasic(term,l):\r\n while(term in l):\r\n l.remove(term)\r\n\r\nn = int(input())\r\npsco = [int(i) for i in input().split(\" \")]\r\n\r\ncount = 0\r\n\r\nif(max(psco)!=0):\r\n while(max(psco)!=0):\r\n count+=1\r\n removeAllBasic(max(psco),psco)\r\n if(psco == []):\r\n break\r\nprint(count)", "null=int(input())\ndata=set(list(map(int,input().split())))\ndata.discard(0)\nprint(len(data))\n\n \t\t \t\t\t\t \t\t \t \t\t\t \t \t \t\t", "number=int(input())\nar=list(map(int,input().split()))\nar.sort()\nc1=1\nfor i in range(len(ar)-1):\n\tif ar[i]!=ar[i+1] and ar[i]!=0:\n\t\tc1+=1\nprint(c1)\n \t\t \t \t \t\t \t\t \t\t\t \t\t\t", "t=int(input())\nl=list(map(int,input().split()))\ns=set(l)\ns=list(filter(lambda n: n!=0,s))\nprint(len(s))\n \t\t \t \t \t \t\t \t \t \t\t\t \t \t\t", "t=int(input())\r\narr=[int(x) for x in input().split()]\r\narr.sort()\r\ncount=0\r\nflag=0\r\nfor i in range(t):\r\n if arr[i]>flag:\r\n count+=1\r\n flag=arr[i]\r\nprint(count)\r\n", "# https://codeforces.com/problemset/problem/937/A\r\n\r\n\r\n_ = input()\r\n\r\nscores = set(input().split())\r\n\r\nif '0' in scores:\r\n print(len(scores) - 1)\r\nelse:\r\n print(len(scores))", "n=int(input())\r\narr=[int(x) for x in input().split()]\r\nif(len(set(arr))==1):\r\n if(arr[0]==0):\r\n print(\"0\")\r\n else:\r\n print(\"1\")\r\nelse:\r\n while 0 in arr:\r\n arr.remove(0)\r\n\r\n print(len(set(arr)))", "n = int(input())\r\na = list(map(int, input().split()))\r\na.sort(reverse=True)\r\nans = 0\r\nfor i in range(0, n):\r\n # Check whether awarding to up to i-th participant is okay\r\n if a[i]==0:\r\n break\r\n if i==n-1 or a[i]!=a[i+1]:\r\n ans += 1\r\nprint(ans)", "n = int(input())\r\na = list(set(input().split()))\r\ncount = 0\r\nfor i in a:\r\n if i != \"0\":\r\n count+=1\r\nprint(count)", "tcs=int(input())\nvcts=list(map(int,input().split()))\nwhile(0 in vcts):\n vcts.remove(0)\nvcts=set(vcts)\nprint(len(vcts))\n\t \t\t\t\t \t\t \t\t \t\t \t\t \t \t\t", "num=int(input())\r\na=list(map(int, input().split()))\r\ncount=0\r\ns=set(a)\r\n\r\nfor i in s:\r\n\tif i>0:\r\n\t\tcount+=1\r\nprint(count)", "a = int(input())\r\nb = list(map(int, input().split()))\r\nr = b.count(0)\r\nwhile r>0:\r\n b.remove(0)\r\n r-=1\r\nt = set(b)\r\nprint(len(t))\r\n", "f=int(input())\ne=list(map(int,input().split()))\nwhile(0 in e):\n e.remove(0)\ne=set(e)\nprint(len(e))\n\n\t \t \t\t \t \t\t\t \t \t\t\t \t \t", "n=int(input())\r\nm=list(map(int,input().split()))\r\ny=max(m)+1\r\nt=[]\r\nr=[]\r\nfor i in range(1,y):\r\n p=m.count(i)\r\n t.append(p)\r\nfor j in t:\r\n if j>1:\r\n j=1\r\n r.append(j)\r\n else:\r\n r.append(j)\r\nprint(sum(r))", "n=int(input())\nar=[int(x) for x in input().split()]\nar.sort()\nif(ar[0]==0):\n\tc=0\nelse:\n\tc=1\nfor i in range(1,n):\n\tif(ar[i]!=ar[i-1] and ar[i]!=0):\n\t\tc=c+1\nprint(c)\n\t\t \t\t\t\t\t\t\t \t\t\t\t \t \t\t \t \t", "import heapq\ndef main():\n N = int(input())\n scores = [int(i) for i in input().split()]\n # scores.sort()\n s = set(scores)\n s = list(s)\n s.sort()\n\n print(len(s)-s.count(0))\n\n \n \n \n\nif __name__ == \"__main__\":\n main()\n", "\"\"\"Problem A - Olympiad.\n\nhttp://codeforces.com/contest/937/problem/A\n\nThe recent All-Berland Olympiad in Informatics featured n participants with\neach scoring a certain amount of points.\n\nAs the head of the programming committee, you are to determine the set of\nparticipants to be awarded with diplomas with respect to the following\ncriteria:\n\n- At least one participant should get a diploma.\n\n- None of those with score equal to zero should get awarded.\n\n- When someone is awarded, all participants with score not less than his score\nshould also be awarded.\n\nDetermine the number of ways to choose a subset of participants that will\nreceive the diplomas.\n\nInput:\n\nThe first line contains a single integer n (1 ≤ n ≤ 100) — the number of\nparticipants.\n\nThe next line contains a sequence of n integers a1, a2, ..., an (0 ≤ ai ≤ 600)\n— participants' scores.\n\nIt's guaranteed that at least one participant has non-zero score.\n\nOutput:\n\nPrint a single integer — the desired number of ways.\n\n\"\"\"\nimport logging\n\n\nfmt = '%(levelname)s - %(name)s (line:%(lineno)s) - %(message)s'\nformatter = logging.Formatter(fmt)\n\nch = logging.StreamHandler()\nch.setLevel(logging.DEBUG)\nch.setFormatter(formatter)\n\nlogger = logging.getLogger('olympiad')\nlogger.setLevel(logging.DEBUG)\nlogger.addHandler(ch)\n\n\ndef solve(sequence):\n s = set(sequence)\n s.discard(0)\n return len(s)\n\n\ndef main():\n # Some common input types below, use as needed.\n _ = int(input().strip())\n sequence = [int(x) for x in input().strip().split()]\n result = solve(sequence)\n print(result)\n\n\nif __name__ == '__main__':\n main()\n", "n=(int)(input())\r\nl=list(map(int, input().split()))\r\ns=list(set(l))\r\nans=len(s)\r\nss=set(l)\r\nif 0 in ss:\r\n ans=ans-1\r\nprint(ans)", "mo=1000000007\nfrom collections import Counter as dic\nfrom functools import cmp_to_key as cmp\nimport sys\ndef prin(a):\n sys.stdout.write(str(a)+'\\n')\ndef input():\n return sys.stdin.readline().strip()\ndef checkbit(n,k):\n return ((1<<k)&n)!=0\ndef cbit(n):\n c=0\n while n!=0:\n n=n&(n-1)\n c+=1\n return c\ndef power(a,b):\n x=a\n ans=1\n while b!=0:\n if b&1==1:\n ans=((ans %mo)*(x%mo))%mo\n x=((x%mo)*(x%mo))%mo\n b>>=1\n return(ans)\ndef setbit(a,b):\n return (a|(1<<b))\ndef cunset(a):\n c=0\n while a!=0:\n if a&1==0:\n c+=1\n a>>=1\n return c\ndef subsets(l,n):\n ans=[]\n for i in range(2**(n)+1,2**(n+1)):\n x=bin(i)[3:]\n x=[l[j] for j in range(n) if x[j]=='1'] \n x.sort()\n ans.append(x)\n ans.sort()\n return ans\n\nn=int(input())\nl=list(map(int,input().split()))\ns=set(l)\ns.discard(0)\nprint(len(s))\n\t \t\t \t \t\t\t \t \t\t\t\t \t\t \t\t\t\t", "x=int(input())\ny=list(map(int,input().split(\" \")))\nz=list(set(y))\na=0\nif a in z:\n\tz.remove(a)\nprint(len(z))\n \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()))\ns = list(set(l))\nx= 0\nfor i in range(len(s)):\n\tif s[i]!=0:\n\t\tx+=1\nprint(x)\n\t\t\t\t \t\t \t \t \t \t\t \t \t\t", "n=int(input())\r\na=set()\r\nb=[int(x) for x in input().split()][:n]\r\nfor i in range(n):\r\n if b[i]!=0:\r\n a.add(b[i])\r\nprint(len(a))", "n=int(input())\r\ns=list(map(int,input().split()))\r\ns=sorted(set(s))\r\nif s[0]==0:\r\n print(len(s)-1)\r\nelse:\r\n print(len(s))\r\n", "n = int(input())\r\narr = list(map(int, input().split()))\r\narr.sort()\r\nif 0 in arr:\r\n print(len(set(arr))-1)\r\nelse:\r\n print(len(set(arr)))", "# n participants\r\n# at least one will win\r\n# none with score of 0 zero\r\n# all participants with score equal or greater\r\n# to the winners' will also win\r\n\r\n# determine the num of ways to choose a subset of\r\n# partic. that will receive the diplomas\r\n\r\n\r\nn = int(input())\r\n\r\nscores = list(map(int, input().split()))\r\n\r\n_set = set(scores)\r\n_set.discard(0)\r\nprint(len(_set))\r\n", "n = int(input())\r\narr = list(map(int ,input().split()[:n]))\r\narr.sort()\r\ncounter = 0\r\n\r\nif arr[0] != 0:\r\n counter += 1\r\n\r\nfor i in range(1, len(arr)):\r\n if arr[i] != 0 and arr[i-1] != arr[i]:\r\n counter += 1\r\n\r\nprint(counter)", "n = int(input())\r\na = list(map(int, input().split()))\r\ns = set()\r\nfor x in a:\r\n if x>0:\r\n s.add(x)\r\nprint(len(s))", "n = int(input())\r\nl = input().split()\r\n#print(type(l))\r\n#print(l)\r\n#l = [l.remove('0') for x in l if x == '0']\r\nl = [x for x in l if x!='0']\r\n#print(l)\r\nl = set(l)\r\n#print(l)\r\nprint(len(l))", "n=int(input())\ns = [int(x) for x in input().split()]\nm=[]\ncount=0\nfor i in range(len(s)):\n if s[i] not in m and s[i]!=0:\n m.append(s[i])\nif len(m)>0:\n mx=max(m)\n count+=1\n for i in range(len(m)):\n if m[i] < mx:\n count += 1\n\nprint(count)", "n = int(input())\r\nmas = [int(s) for s in input().split()]\r\ns = set()\r\nfor i in mas:\r\n s.add(i)\r\na = 0 in s\r\nprint(len(s) - a)", "n=int(input())\r\narr=[int(x) for x in input().split()]\r\narr1=[]\r\nfor i in range(0,n):\r\n if arr[i]>0:\r\n arr1.append(arr[i])\r\nprint(len(set(arr1)))", "n = int(input())\r\na = list(map(int,input().split()))\r\nans = []\r\nfor i in a:\r\n if i>0 and i not in ans:\r\n ans.append(i)\r\nprint(len(ans))", "n=int(input())\r\nl=list(map(int,input().split()))\r\nl.sort()\r\nl1=list(set(l))\r\nc=0\r\nfor i in range(len(l1)):\r\n if(l1[i]!=0):\r\n c+=1\r\n else:\r\n c+=0\r\nprint(c)", "n = int(input(''))\r\nx = input(\"\")\r\nl = x.split()\r\nlst = list()\r\nfor c in l:\r\n c = int(c)\r\n lst.append(c)\r\nlst.sort()\r\ncount = 1\r\nfor k in range(len(lst)-1):\r\n if lst[k]!=0 and lst[k]!=lst[k+1]:\r\n count = count + 1\r\nprint(count)", "n = int(input())\nscores = list(map(int, input().split()))\nwhile scores.count(0) != 0: # removes zeros from the list\n scores.remove(0)\nscores.sort()\nfirst_score = scores[0]\nscores_new = [first_score]\nfor i in range(1, len(scores)):\n if scores[i] > first_score:\n scores_new.append(scores[i])\n first_score = scores[i]\nprint(len(scores_new))\n", "n=int(input())\nli1=[int(x) for x in input().split()]\nli1=list(set(li1))\nfor i in li1:\n\tif i==0:\n\t\tli1.remove(i)\nprint(len(li1))\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()[:n]))\r\nres = set(arr)\r\nif 0 in arr:\r\n print(len(res)-1)\r\nelse:\r\n print(len(res))", "n=int(input())\r\nlstr1=list(map(int,input().split()))\r\nlstr2=set(lstr1)\r\ncv=0\r\nfor i in lstr2:\r\n\tif i!=0:\r\n\t\tcv=cv+1\r\nprint(cv)\r\n\r\n", "n = int(input())\r\nl = list(map(int, input().split()))\r\nl.sort()\r\nnb = 1\r\nfor i in range(n-1):\r\n if l[i] != l[i+1] and l[i] != 0:\r\n nb += 1\r\nprint(nb)", "x=int(input())\narr=list(map(int,input().split()))\narr.sort()\ny=1\nfor i in range(x-1):\n if arr[i]!=arr[i+1] and arr[i]!=0:\n y=y+1\nprint(y)\n \n\n \t\t \t \t\t \t \t\t\t\t\t\t \t\t \t\t", "q=int(input())\nf=0\nu=[int(x) for x in input().split()]\nu.sort()\nu=set(u)\nfor i in u:\n if i!=0:\n f+=1\nprint(f)\n\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\nset1 = list(set(arr))\r\nif 0 in set1:\r\n set1.remove(0)\r\nprint(len(set1))\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\nc=0\r\ns=set(l)\r\nfor i in s:\r\n if(i!=0):\r\n c+=1\r\nprint(c)", "n = int(input())\r\na = set([int(c) for c in input().split()])\r\nif 0 in a:\r\n print(len(a)-1)\r\nelse:\r\n print(len(a))\r\n", "n=int(input())\r\nb=[]\r\nfor i in map(int,input().split()):\r\n if i!=0 and i not in b:\r\n b.append(i)\r\nprint(len(b))", "y=int(input())\r\ns=input()\r\nn=[int(s) for s in s.split()]\r\nu=[0]\r\nfor i in range(y):\r\n if n[i] not in u:\r\n u.append(n[i])\r\nprint(len(u)-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 = sorted(set([x for x in map(int, wtf[1].split()) if x != 0]))\r\n print(len(A))\r\n", "n=input()\r\ns=set(input().split())\r\nss=len(s-{'0'})\r\nprint(ss)\r\n", "n=int(input());\r\na=[int(a) for a in input().split()]\r\ncount=0\r\nb=[]\r\nfor _ in range(n):\r\n if (a[_] not in b) and a[_]!= 0:\r\n b.append(a[_])\r\n count+=1\r\nprint(count)", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Fri Mar 2 22:09:34 2018\r\n\r\n@author: Xiaohua\r\n\"\"\"\r\n\r\ndef Olypiad(n,ar):\r\n \r\n ar.sort()\r\n m=0\r\n a=0\r\n for i in range(0,n):\r\n if(ar[i]!=a):\r\n m+=1\r\n a=ar[i]\r\n return m\r\ndef hello():\r\n \"\"\"Print \"Hello World\" and return None\"\"\"\r\n n = int(input().strip())\r\n ar = list(map(int, input().strip().split(' ')))\r\n result=Olypiad(n,ar)\r\n print(result)\r\n# main program starts here\r\nhello()", "n=int(input())\r\ninp=input()\r\na=list(map(int,inp.split()))\r\nwhile a.count(0)>0:\r\n a.remove(0)\r\nm=max(a)\r\narr=[]\r\nfor i in range(m+1):\r\n arr.append(0)\r\nfor i in a:\r\n arr[i]+=1\r\nwhile arr.count(0)>0:\r\n arr.remove(0)\r\nprint(len(arr))", "n = int(input())\r\n\r\nscores = input().split(' ')\r\n\r\nscores = set(scores)\r\n\r\nif '0' in scores:\r\n print(str(len(scores)-1))\r\nelse:\r\n print(len(scores))", "n = int(input())\r\ns = set(map(int,input().split()))\r\nif 0 in s:print(max(0,len(s)-1))\r\nelse:print(len(s))", "c,n =0, int(input())\nl=list(map(int,input().split()))\ns=set(l)\nfor i in s:\n if i!=0:c+=1\nprint(c)\n\n \t\t\t \t\t \t\t \t\t\t\t \t \t \t\t", "participants = input()\r\nnumbers = input().split()\r\nnumbers = sorted(numbers)\r\nsolutions = 0\r\nlist_with_no_zeros = []\r\ncounter = 1\r\nfor num in numbers:\r\n if num != '0':\r\n list_with_no_zeros.append(num)\r\n\r\nlist_with_no_zeros = sorted(list_with_no_zeros)\r\n\r\nif list_with_no_zeros[0] == list_with_no_zeros[len(list_with_no_zeros) - 1]:\r\n solutions = 1\r\nelse:\r\n solutions = 1\r\n for num in list_with_no_zeros:\r\n if counter > len(list_with_no_zeros) - 1:\r\n break\r\n else:\r\n if num != list_with_no_zeros[counter]:\r\n solutions += 1\r\n counter += 1\r\nprint(solutions)", "import sys\r\n\r\ndef main():\r\n _, s = sys.stdin.read().strip().split('\\n')\r\n return len(set(s.split()) - {'0'})\r\n \r\nprint(main())\r\n", "input()\r\nx = set(map(int, input().split()))\r\nif x.__contains__(0):\r\n x.remove(0)\r\nprint(len(x))", "x=int(input()) #input\r\ny=list(map(int,input().split()))\r\nwhile(0 in y):\r\n y.remove(0) #remove\r\nz=set(y)\r\nn=len(z)\r\nprint(n) #output", "n = int(input())\r\ncnt = 0\r\nlst = list(map(int,input().split()))\r\nif 0 in lst:\r\n cnt+=1\r\nprint(len(set(lst))-cnt)", "n = int(input())\r\nseq = input().split()\r\nnumbers = []\r\nfor s in seq:\r\n numbers.append(int(s))\r\n\r\nnumbers = set(numbers)\r\n\r\nans = 0\r\n\r\nfor number in numbers:\r\n if number > 0:\r\n ans += 1\r\n\r\n\r\nprint(ans)", "n = int(input())\r\na = list(map(int, input().split()))\r\nseen = set()\r\n\r\nfor i in a:\r\n if i != 0:\r\n seen.add(i)\r\n\r\nprint(len(seen))", "S=int(input())\nso=list(map(int,input().split()))\nwhile(0 in so):\n so.remove(0)\nso=set(so)\nprint(len(so))\n\t \t\t \t\t \t\t\t\t \t \t\t \t\t \t\t\t \t \t", "n=int(input())\r\na=list(map(int,input().split()))\r\nf=[0]*700\r\nc=0\r\nfor i in range(n):\r\n if(a[i]==0):\r\n continue\r\n elif(f[a[i]]==0):\r\n c+=1\r\n f[a[i]]=1\r\nprint(c)", "n=int(input())\r\na=[int(x) for x in input().split()]\r\nt=a.count(0)\r\nif t==0:\r\n print(len(set(a)))\r\nelse:\r\n print(len(set(a))-1)", "a=int(input())\nb=input().split()\nc=set(b)\nf=list(c)\nd=len(f)\ne=f.count('0')\nif e==1 and d==1:\n print('0')\nelse:\n print(d-e)\n\t \t \t \t \t\t \t\t\t \t \t\t \t\t", "n=input( )\nq=len(set(input( ).split( ))-{'0'})\nprint(q)\n \t \t\t\t \t \t \t \t \t\t \t\t \t", "def olympiad():\r\n n= int(input())\r\n ls = list(map(str,input().split()))[:n]\r\n st = set(ls)\r\n ls1 = list(st)\r\n cnt=0\r\n for i in range(len(ls1)):\r\n if ls1[i]==\"0\":\r\n cnt += 1\r\n return len(ls1)-cnt\r\nprint(olympiad())", "n=int(input())\nl=list(map(int,input().split()))\nm=[]\nfor i in l:\n\tif(i!=0 and i not in m):\n\t\tm.append(i)\nprint(len(m))\n\t\n \t \t \t \t \t\t \t\t \t\t\t \t \t", "input()\r\na=set(x for x in map(int,input().split()) if x>0)\r\nprint(len(a))", "value=int(input())\r\nresult=list(map(int,input().split()))\r\nwhile(0 in result):\r\n result.remove(0)\r\nresult=set(result)\r\nprint(len(result))\r\n", "# cook your dish here \r\n\r\nn = input()\r\na = list(map(int,input().split())) \r\na.sort() \r\ncount = a.count(0) \r\nfor each in range (0,count):\r\n a.remove(0) \r\nd = set(a)\r\n\r\nprint(len(d))\r\n \r\n \r\n \r\n\r\n", "n=int(input())\r\nns=set(input().split())\r\nif '0' in ns:\r\n ns.remove('0')\r\nprint(len(ns))", "n=int(input())\r\nln=list(map(int,input().split()))\r\nsn=list(set(ln))\r\ncount=0\r\nif 0 in sn:\r\n count+=1\r\nprint(len(sn)-count)", "n=int(input())\r\na=[int(i) for i in input().split()]\r\nb=[a[0]]\r\nfor i in a:\r\n t=0\r\n for j in b:\r\n if j!=i:\r\n t+=1\r\n if t==len(b) and i!=0:\r\n b.append(i)\r\nif a[0]==0:\r\n print(len(b)-1)\r\nelse:\r\n print(len(b))", "n = int(input())\nar1 = list(map(int,input().split()))\nwhile( 0 in ar1):\n ar1.remove(0)\nprint(len(set(ar1)))\n\t \t \t \t \t \t\t\t\t\t\t \t \t \t\t", "var3=int(input())\nvar4=list(map(int,input().split()))\nwhile(0 in var4):\n var4.remove(0)\nvar4=set(var4)\nprint(len(var4))\n \t \t\t\t \t\t \t\t\t \t \t", "n = int(input())\r\na = [int(x) for x in input().split()]\r\ns = 0\r\nk = 0\r\nif 0 in a:\r\n s = set(a)\r\n print(len(s)-1)\r\nelse:\r\n k = set(a)\r\n print(len(k))", "n=int(input())\nl=[int(i) for i in input().split()]\nl.sort()\nl1=[]\nfor i in l:\n if i!=0:\n l1.append(i)\nprint(len(set(l1)))\n \t \t \t \t\t \t\t \t\t\t\t \t \t \t\t", "n=int(input())\nl=list(set(map(int,input().split())))\nif 0 in l:\n l.remove(0)\nprint(len(l))\n\n\t\t\t \t \t \t \t\t \t \t \t\t \t\t \t\t\t", "n=int(input())\n# ar=[]\nar=list(map(int,input().split()))\ncount=0\ns=set(ar)\nls=list(s)\nl=len(ls)\nfor i in range(l):\n if(ls[i]!=0):\n count+=1\nprint(count)\n \t \t \t \t\t \t \t \t\t\t \t \t\t", "n = int(input())\nscores = list(map(int, input().split()))\nmedals = set([score for score in scores if score != 0])\nprint(len(medals))\n", "n = int(input())\r\npuntos = [int(i) for i in input().split()]\r\npuntos.sort()\r\nc = 0\r\nif puntos[0] != 0:\r\n c += 1\r\nfor i in range(1,n):\r\n if puntos[i]!=0 and puntos[i]!=puntos[i-1]:\r\n c += 1\r\nprint(c) ", "a = int(input())\r\nx = input()\r\nx = x.split(\" \")\r\nx = list(map(int, x))\r\n\r\ny = []\r\nfor i in x:\r\n if(i != 0 and i not in y):\r\n y.append(i)\r\n\r\nprint(len(y))", "n = int(input())\r\ns = list(map(int, input().split()))\r\n\r\np = set(filter(lambda x : x > 0, s))\r\n\r\nprint(len(p))\r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\ns=set(a)\r\ncount=0\r\nfor element in (s):\r\n if(element>0):\r\n count=count+1\r\n else:\r\n pass\r\nprint(count)", "n = int(input())\r\na = list(map(int, input().split()))\r\nwhile 0 in a:\r\n a.remove(0)\r\nprint(len(set(a)))", "n=int(input())\r\nscores=input().split()\r\nset_scores=set(scores)\r\nif '0' in set_scores:\r\n print(len(set_scores)-1)\r\nelse:\r\n print(len(set_scores))", "n = int(input())\r\ns = set(map(int, input().split()))\r\nl = len(s)\r\nif 0 in s:\r\n l -= 1\r\nprint(l)", "if __name__ == '__main__' :\r\n n = int(input())\r\n a = [int(num) for num in input().split()]\r\n arr = list(filter(lambda n : n>0, a))\r\n c = 1\r\n arr.sort()\r\n for i in range (len(arr)-1) :\r\n if arr[i] != arr[i+1] :\r\n c = c+1\r\n print(c)", "t=int(input())\ns=input()\nl=[]\nl=s.split()\ns=set(l)\nif '0' in s:\n\tprint(len(s)-1,end='')\nelse:\n\tprint(len(s),end='')\n\t\n \t \t \t \t\t\t \t \t\t \t\t\t\t\t", "n = int(input())\r\nprint(len(set([int(x) for x in input().split() if int(x) > 0])))", "x=int(input())\ny=input().split()\nz=[int(i)for i in y]\nm=[]\na=0\nfor i in range(x):\n if z[i]!=0 and z[i] not in m:\n a+=1\n m.append(z[i])\nprint(a)", "size = int(input())\narr = list(map(int , input().split(\" \")))\n\narr = list(set(arr))\nprint(len([i for i in arr if i != 0]))\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\nll=[]\r\nfor i in l:\r\n if i not in ll:\r\n ll.append(i)\r\nr=len(ll)\r\nl.sort()\r\nif l[0]==0:\r\n r-=1\r\nprint(r)", "m=int(input())\nr=list(map(int,input().split()))\n\n\nr=set(r)\nif 0 in r:\n r.remove(0)\n\nprint(len(r))\n \t \t \t \t\t \t\t \t \t \t\t\t \t\t \t \t", "n = int(input())\r\n\r\ns = input().split()\r\nl = []\r\nfor i in s:\r\n if i != \"0\" and i not in l:\r\n l.append(i)\r\n\r\nprint(len(l))\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\nl.sort()\r\ns=set(l)\r\nk=list(s)\r\nlength=len(k)\r\nif(length==0):\r\n print(1)\r\nif(k[0]==0):\r\n print(length-1)\r\nelse:\r\n print(length)", "n=int(input())\na=[int(i) for i in input().split()]\na.sort()\nx=1\ny=0\nfor i in range(0,n-1):\n if a[i]>0:\n if a[i]==a[i+1]:\n x=1\n i=i+1\n else:\n y=y+1\n i=i+1\n else:\n i=i+1 \nprint(x+y) \n\n \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()))\nc=0\ns=set(l)\nfor i in s:\n if(i!=0):\n c+=1\nprint(c)\n\t \t \t\t\t\t \t \t \t\t\t \t \t\t \t \t\t\t", "n = int(input())\r\nmas = set(input().split())\r\nprint(len(mas) if '0' not in mas else len(mas)-1)", "n=int(input())\r\nl=list(map(int,input().split()))\r\nd=[]\r\nfor i in l:\r\n if i not in d and i!=0:\r\n d.append(i)\r\nprint(len(d))", "n=int(input())\nl=list(map(int,input().split()))\nl=set(l)\nif 0 in l:\n l.remove(0)\nprint(len(l))\n \t \t\t \t \t\t \t \t \t \t\t\t", "n=int(input())\r\nl=list(map(int,input().split()))\r\nm=[]\r\nfor i in range (len(l)):\r\n if(l[i]>0):\r\n m.append(l[i])\r\ns=set(m)\r\nprint(len(s))\r\n\r\n\r\n", "n = int(input())\r\na = list(map(int,input().split()))\r\na = list(set(a))\r\nif not 0 in a: print(len(a))\r\nelse: print(len(a)-1)", "t=int(input())\r\nx=[int(q) for q in input().split()]\r\ns=x.count(0)\r\nfor i in range(s):\r\n x.remove(0)\r\nprint(len(list(set(map(int,x)))))", "n = int(input())\r\nb = set(list(map(int,input().split())))\r\nif 0 in b :\r\n b.remove(0)\r\nprint(len(b)) ", "n=int(input())\na=list(map(int,input().split()))\ns=[]\nfor i in a:\n if i not in s:\n if i!=0:\n s.append(i)\nprint(len(s))\n\t\t \t\t\t\t\t \t \t\t \t \t \t\t\t \t", "z=int(input())\nm=list(map(int,input().split()))\nk=set(m)\no=0\nfor l in k:\n\tif l!=0:\n\t\to=o+1\nprint(o)\n\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 = [int(i) for i in input().split()]\r\n\r\ne = set()\r\n\r\nfor i in range(n):\r\n\tif s[i]>0 :\r\n\t\te.add(s[i])\r\n\r\n\r\nprint(len(e)) ", "n = int(input())\ns = set()\narr = list(map(int, input().strip().split()))\nfor x in arr:\n if x != 0:\n s.add(x)\nprint(len(s))\n", "n = eval(input())\nlist0 = list(map(lambda x : int (x),input().split()))\ngrades_rank = set(list0)\ngrades_rank1 = list(grades_rank)\ngrades_rank1.sort()\nmethods = 0 \nif grades_rank1[0] == 0:\n methods = len(grades_rank1) - 1\nelse : methods = len(grades_rank)\nprint(methods)\n\t \t\t \t\t\t \t\t \t \t\t\t\t\t \t\t \t\t \t", "n=int(input())\r\na=list(map(int,input().split()))\r\nb=set(a)\r\nif 0 in b:\r\n print(len(b)-1)\r\nelse:\r\n print(len(b))", "n=int(input())\r\nl=[int(j) for j in input().split()]\r\ns = list(set(l))\r\nans=len(s)\r\nif 0 in s:\r\n ans-=1\r\nprint(ans)\r\n", "n = int(input())\na = list(map(int,input().split()))\na.sort()\nt = set(a)\nif a[0]==0:\n\tm = len(t)-1\nelse:\n\tm = len(t)\nprint(m)\n\n\n\n\n", "n=int(input())\na=list(map(int,input().split()))\nc=0\nf=[0]*max(a)\nfor i in range(n):\n f[a[i]-1]+=1\nf.reverse()\nfor i in range(len(f)):\n if(f[i]!=0):\n c+=1\nprint(c)\n\n\n\n\n \n\n\t \t \t\t\t \t\t\t\t\t \t \t \t\t\t\t \t", "rajay = int(input())\nrharshi = list(map(int,input().split()))\nrharshi = [i for i in rharshi if(i!=0)]\nprint(len(set(rharshi)))\n \t\t \t \t\t \t\t \t\t\t\t \t \t\t", "n,k=int(input()),0\r\nl=set(map(int,input().split()))\r\nif 0 in l: k=1\r\nprint(len(l)-k)\r\n", "n = int(input())\r\na = set(input().split())\r\nans = len(a)\r\nif \"0\" in a: ans-=1\r\nprint(ans)\r\n", "n=int(input())\r\ncount=0\r\na=list(map(int,input().strip().split()))\r\naset=set(a)\r\nfor i in aset:\r\n if(i!=0):\r\n count=count+1\r\nprint(count) ", "n = int(input())\r\nscores = list(map(int,input().split()))\r\n\r\ncount = 0\r\n\r\nscores = set(scores)\r\nfor k in scores:\r\n\r\n if k != 0 :\r\n\r\n count = count +1\r\n\r\nprint(count)", "# LUOGU_RID: 113871350\nn=int(input())\r\na=input().split()\r\nr=[]\r\nfor i in a:\r\n if i not in r:\r\n r.append(i)\r\nprint(len(r)-('0' in r))", "t=int(input())\nl=[None]*t\nl=list(map(int,input().split()))\nl=list(set(l))\nif 0 in l:\n l.remove(0)\nk=len(l)\nprint(k)\n \t\t \t \t\t\t\t \t\t \t\t \t \t \t\t \t\t\t \t", "n= int(input())\r\na=list(map(int,input().split()))\r\na.sort()\r\nl=1\r\nfor i in range(n-1):\r\n if a[i]!= 0:\r\n if a[i]<a[i+1]:\r\n l=l+1\r\nprint(l)\r\n", "def solution():\n n = int(input())\n nums = list(map(int, input().split()))\n s = set(nums)\n if 0 not in s:\n print(len(s))\n else:\n s.remove(0)\n print(len(s))\n\nsolution()", "n=int(input())\r\ns=set(list(map(int,input().split())))\r\ns-={0}\r\nprint(len(s))\r\n", "size = int(input())\nnums = map(int, input().split(' '))\nlst = []\nfor i in nums:\n\tif i not in lst and i != 0:\n\t\tlst.append(i)\nprint(len(lst))\n\t\t\t \t\t \t\t\t \t \t \t \t\t\t \t\t\t \t", "input()\r\nres = 0\r\nrates = list(set(map(int, input().split())))\r\n\r\nfor p in rates:\r\n if p > 0:\r\n res += 1\r\n\r\nprint(res)", "p=int(input())\r\nx=[int(i) for i in input().split()]\r\nv=sorted(set(x))\r\nif v[0]==0:\r\n print(len(v)-1)\r\nelse:\r\n print(len(v))\r\n", "n = int(input())\r\narr = list(map(int, input().split()))\r\nwhile 0 in arr:\r\n arr.pop(arr.index(0))\r\nprint(len(set(arr)))", "a = int(input())\r\nb = set(map(int, input().split()))\r\nc=[0]\r\nif b.intersection(c):\r\n b.remove(0)\r\nprint(len(b))", "n = int(input())\r\nscores = [ int(x) for x in input().split() ]\r\n\r\n\r\nwhile( 0 in scores ):\r\n scores.remove(0)\r\nscores = set(scores)\r\n\r\nprint(str(len(scores)))", "input()\r\ns = set(map(int,input().split(' ')))\r\nprint((len(s),len(s)-1)[0 in s])\r\n", "n=input()\r\nl=list(map(int,input().split()))\r\nk=[]\r\nfor i in l:\r\n if i not in k and i!=0:\r\n k.append((i))\r\nprint(len(k))", "n=int(input())\na=set(map(int,input().split()))\na=list(a)\nif 0 in a:\n a.remove(0)\nprint(len(a))\n\n \t \t \t \t\t \t \t\t\t\t\t \t\t\t", "n=int(input())\na=list(map(int,input().strip().split()))[:n]\nd=set(a)\nl=len(d)\nif 0 in d:\n print(l-1)\nelse:\n print(l)\n \t\t \t\t \t \t \t \t \t\t\t \t \t", "n=int(input())\r\na=list(map(int,input().split()))\r\nmp=[]\r\nfor i in a:\r\n\tif i not in mp and not i == 0:\r\n\t\tmp.append(i)\r\nprint(len(mp))\r\n", "num = int(input())\narray1 = list(map(int,input().split()))\nwhile( 0 in array1):\n array1.remove(0)\nprint(len(set(array1))) \n \t\t\t\t\t \t\t\t \t \t\t \t\t \t", "\nn = int(input())\na = list(map(int, input().split()))\n\nb = {elem for elem in a if elem != 0}\nprint(len(b))", "n = int(input())\nnotas = [*map(int, input().split())]\n\nunic = set(notas)\nfiltrado = [e for e in unic if e != 0]\n\nprint(len(filtrado))\n\t\t \t \t \t\t\t\t\t \t \t\t \t \t \t\t", "numParts = int(input())\nscores = list(map(int, input().split()))\n\nscores.sort()\n\nnumWays = 0\nlastScore = 601\n\nfor score in scores:\n if(score != 0 and score != lastScore):\n numWays = numWays + 1\n \n lastScore = score\n\nprint(numWays)", "n = int(input())\r\n\r\np = [int(i) for i in input().split() if(i != '0')]\r\n\r\nprint(len(set(p)))", "n = int(input())\r\na = list(map(int, input().strip().split()))\r\n\r\nb = set(a)\r\nres = 0\r\nfor x in b:\r\n if x > 0:\r\n res += 1\r\nprint(res)\r\n\r\n", "num = int(input())\narray = list(map(int,input().split()))\nwhile( 0 in array):\n array.remove(0)\nprint(len(set(array)))\n\t\t \t \t \t\t \t \t \t\t\t\t\t\t \t \t \t\t", "n = int(input())\na = list(map(int, input().split()))\nx = dict()\nfor i in range(n):\n\tif a[i] > 0:\n\t\tx[a[i]] = 1;\nprint(len(x))", "n=int(input())\na=list(map(int,input().split()))\na.sort()\nc=1\nfor i in range(len(a)-1):\n\tif a[i]!=a[i+1] and a[i]!=0:\n\t\tc+=1\nprint(c)\n \t\t\t \t \t\t\t\t\t\t\t \t\t \t \t\t \t", "from collections import Counter\r\nn = int(input())\r\nidx___score = [int(x) for x in input().split()]\r\nscores = Counter(idx___score)\r\nif 0 in scores:\r\n print(len(scores) - 1)\r\nelse:\r\n print(len(scores))", "n=int(input())\r\na=list(map(int,input().split()))\r\nb=list(set(a))\r\ntry:\r\n b.remove(0)\r\nexcept:\r\n pass\r\nprint(len(b))\r\n", "# your code goes here\nn = int(input())\nl = list(map(int,input().split()))\ns = set(l)\nf = list(s)\n# print(*f)\nc = 0\nfor i in range(len(f)):\n\tif f[i]!=0:\n\t\tc = c+1\nprint(c)\n\t\t\t\t\t \t\t \t \t \t\t \t \t \t\t \t\t\t \t", "#Olympiad\r\nn=int(input())\r\na=[int(i) for i in input().split()]\r\nl=[]\r\nfor i in range(0,n):\r\n if a[i]!=0:\r\n l.append(a[i])\r\nprint(len(set(l)))", "n=int(input())\r\nl=list(map(int,input().split()))\r\nc,l1=0,[]\r\nfor i in range(n):\r\n\tif l[i] not in l1:\r\n\t\tif l[i]>0:\r\n\t\t\tc+=1\r\n\t\t\tl1.append(l[i])\r\nprint(c)", "n = int(input())\n\nl = list(map(int, input().split()))\n\nq = [i for i in list(set(l)) if i != 0]\n\nprint(len(q))\n", "input()\r\nli=list(input().split())\r\nli=set(li)\r\nli=filter(lambda a: a != '0', li)\r\nli=list(li)\r\nprint(len(li))\r\n\r\n", "x=int(input())\ny=list(map(int,input().split()))\nwhile(0 in y):\n y.remove(0)\nz=set(y)\nprint(len(z))\n \t\t\t\t\t\t \t \t\t\t \t\t\t\t\t \t \t\t \t", "n = int(input())\nli = [int(x) for x in input().split()]\na = set(li)\na.discard(0)\nprint(len(a))\n\t\t\t \t\t\t \t \t \t\t\t \t \t", "#import sys\r\n#sys.stdin = open(\"input.in\",\"r\")\r\n#sys.stdout = open(\"test.out\",\"w\")\r\nn=int(input())\r\na=set(list(map(int,input().split())))\r\nl=0\r\nfor i in a:\r\n\tif i==0:\r\n\t\tl=1\r\nprint(len(a)-l)", "n = int(input())\r\narr = [int(i) for i in input().strip().split()]\r\nd = {}\r\nd[0] = 1\r\nfor i in arr:\r\n d[i] = 1\r\nprint(len(d) - 1) ", "n=int(input())\r\nx=[int(i) for i in input().split()]\r\nx=set(x)\r\nc=0\r\nfor i in x:\r\n if i!=0:\r\n c+=1\r\nprint(c)\r\n", "def bubblesort(lista):\n trocou = True\n for j in range(len(lista) - 1):\n if not trocou: break\n trocou = False\n for i in range(len(lista) - 1):\n if lista[i] > lista[i + 1]:\n lista[i], lista[i + 1] = lista[i + 1], lista[i]\n trocou = True\n\n\ndef meu_map(lista):\n lista_mapeada = []\n for e in lista:\n lista_mapeada.append(int(e))\n\n return lista_mapeada\n\n\ndef possibilidades(lista):\n nao_foi = True\n jeitos = 0\n aux = 1\n for e in lista:\n if e > aux or (e == 1 and nao_foi):\n nao_foi = False\n aux = e\n jeitos += 1\n \n return jeitos\n\n\nn = int(input())\nscores = meu_map(input().split())\n\nscores = meu_map(scores)\n\nbubblesort(scores)\n\nprint(possibilidades(scores))\n \t \t\t \t\t\t\t \t\t \t \t \t\t\t \t \t", "n = int(input())\nscores = input().split()\nnewScores = []\nfor i in scores:\n if i not in newScores and i!=\"0\":\n newScores.append(i)\nprint(len(newScores))", "a=input;a();print(len(set(i for i in map(int,a().split()) if i!=0)))\r\n", "tris=int(input())\nlsti=list(map(int,input().split()))\nlsti2=set(lsti)\ncsi=0\nfor i in lsti2:\n\tif i!=0:\n\t\tcsi=csi+1\nprint(csi)\n \t\t \t\t\t\t \t \t\t \t \t\t\t\t \t \t", "n=int(input())\r\ninp = list(map(int,input().split()))\r\nfrom collections import Counter\r\nc=Counter(inp)\r\nif(0 in c.keys()):\r\n print(len(c.keys())-1)\r\nelse:\r\n print(len(c.keys()))", "n=int(input())\r\na=list(map(int,input().split()))\r\na.sort()\r\ncount=0\r\ns1=set(a)\r\nfor i in s1:\r\n if(i !=0):\r\n count+=1\r\nprint(count)", "n=int(input())\r\na=list(map(int,input().split()))\r\nk=set(a)\r\nu=a.count(0)\r\nif u==0:\r\n print(len(k))\r\nelse:\r\n if len(k)-1<0:\r\n print(0)\r\n else:\r\n print(len(k)-1)\r\n ", "n = int(input())\r\na = list(map(int, input().split()))\r\nv = 601 * [0]\r\nfor i in range(n) :\r\n if a[i] != 0 :\r\n v[a[i]] = 1\r\nprint(sum(v))\r\n", "input()\r\nprint(len(set(filter(lambda v: v > 0, map(int, input().split())))))\r\n", "n = int(input())\r\nscores = list(map(int, input().split()))\r\n\r\nif 0 in scores:\r\n for i in range(scores.count(0)):\r\n scores.remove(0)\r\n \r\nscores = set(scores)\r\nprint(len(scores))", "p=[]\r\n\r\nn = int(input())\r\np = list(map(int,input().split()))\r\n\r\nif p.count(0) == len(p):\r\n print(0)\r\nelif p.count(p[0]) == len(p):\r\n print(1)\r\nelif p.count(0)==0:\r\n print(len(set(p)))\r\nelif p.count(0) != len(p):\r\n x=set(p)\r\n print(len(set(p)) - 1)", "n,l1=int(input()),list(map(int,input().split()))\nl2=[]\nfor i in l1:\n if i!=0:\n l2.append(i)\ns=set(l2)\nprint(len(s))\n \t \t \t \t\t \t \t \t \t \t", "import sys,math\ninput=sys.stdin.readline\nL=lambda : list(map(int,input().split()))\nM=lambda : map(int,input().split())\nn=int(input())\nl=L()\nl=list(set(l))\nprint(len(l)-l.count(0))\n", "n=int(input())\na=list(map(int,input().split()))\nd={}\nfor i in range(n):\n\tif a[i]!=0:\n\t\tif a[i] not in d:\n\t\t\td[a[i]]=1\ncnt=0\nfor i in d.keys():\n\tcnt+=1\nprint(cnt)\n\t\t\t\t \t\t \t\t\t\t\t\t\t\t \t\t \t\t\t", "n=int(input())\nl1=list(map(int,input().split()))\nl2=list(set(l1))\nif 0 in l2:\n l2.remove(0)\nprint(len(l2))\n \t \t\t\t \t \t \t \t \t\t\t\t\t\t\t\t\t", "t = int(input())\r\na = [int(k) for k in input().split()]\r\nuni = 0\r\na.sort()\r\n\r\nfor j in range(0,t):\r\n if j==0 and a[j] != 0:\r\n uni +=1\r\n else:\r\n if j != 0:\r\n if a[j] != a[j-1]:\r\n uni += 1\r\n\r\nprint(uni)\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\na = set(a) \r\nc = len(a)\r\nif 0 in a:\r\n c -= 1\r\nprint(c)\r\n \r\n \r\n \r\n \r\n \r\n\r\n \r\n ", "n=int(input())\r\nscores=list(map(int,input().split()))\r\nscores.sort()\r\nscores=list(filter(lambda a: a != 0, scores))\r\nprint(len(set(scores)))\r\n \r\n ", "# Olympiad\ndef solve(arr):\n x = set(arr)\n if 0 in x:\n x.remove(0)\n return len(x)\n\nn = int(input())\narr = list(map(int, input().strip().split()))\nprint(solve(arr))", "q=lambda:map(int,input().split())\r\nqi=lambda:int(input())\r\nqs=lambda:input().split()\r\ninput()\r\ns=set(q())\r\ns.discard(0)\r\nprint(len(s))", "import sys\r\n\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\ndata = set(map(int, input().split()))\r\nprint(len(data) if 0 not in data else len(data) - 1)", "n = int(input())\ns = input().split()\ns = [int(i) for i in s]\ns = set(s)\nif 0 in s :\n s.remove(0)\nprint(len(s))\n", "n=int(input())\r\nL=[k for k in map(int,input().split()) if (k!=0)]\r\nprint(len(set(L)))\r\n", "n = int(input())\ns = set(int(x) for x in input().split())\nif 0 in s:\n s.remove(0)\nprint(len(s))", "n = int(input())\r\nli = list(map(int,input().split()))\r\ndict = {}\r\nfor i in li:\r\n if i!=0:\r\n if i not in dict.keys():\r\n dict[i]=1 \r\n else:\r\n dict[i]+=1 \r\nprint(len(dict))\r\n", "n = int(input())\narr = [int (i) for i in input().split()]\ncount = 1\narr.sort()\nfor i in range(len(arr)-1):\n if arr[i]==0:\n continue\n elif arr[i]!=arr[i+1]:\n count+=1\nprint(count)\n\t \t \t\t\t \t\t\t \t\t \t\t \t \t \t", "n=int(input())\nm=[int(x) for x in input().split()]\nm=list(set(m))\nfor i in m:\n\tif i==0:\n\t\tm.remove(i)\nprint(len(m))\n\t \t \t\t\t\t\t\t \t \t \t", "n = int(input())\r\na = [int(x) for x in input().split()]\r\nmas = []\r\nfor i in a:\r\n b = i in mas\r\n if (b == False) and (i != 0):\r\n mas.append(i)\r\n\r\nprint(len(mas))\r\n\r\n", "n = int(input())\r\narr = list(map(int,input().split()))\r\ns = set()\r\nfor i in arr :\r\n if i == 0 :\r\n continue\r\n else:\r\n s.add(i)\r\n\r\nprint(len(s))", "v=int(input())\narr=list(map(int,input().split()))\narr.sort()\nk=1\nfor z in range(v-1):\n if arr[z]!=arr[z+1] and arr[z]!=0:\n k=k+1\nprint(k)\n \n\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()))\nfreq=[0]*(max(a)+1)\n\nfor i in a:\n freq[i]=1\n\nprint(freq[1:].count(1))", "k = int(input())\nli = list(map(int, input().strip().split()))[:k]\nli = set(li)\ntr = 0\nfor i in li:\n if i != 0:\n tr += 1\nprint(tr)\n \t\t\t\t \t \t\t \t\t\t\t\t\t\t\t \t\t \t \t", "participantes= input()\npontuacao = input().split()\nlista = []\nfor valor in pontuacao:\n if valor not in lista and valor != \"0\":\n lista.append(valor)\nprint(len(lista))\n", "n = int(input())\nli = [int(x) for x in input().split()]\nli.sort()\ns = set(li)\nc = 0\nfor i in s:\n\tif(i == 0):\n\t\tc += 1\n\telse:\n\t\tbreak\nprint(len(s) - c)\n\t\n\t\t\t\t \t \t \t\t \t\t \t\t\t\t", "n = int(input())\r\ndata = list(map(int, input().split()))\r\ndata = set(data)\r\nif 0 in data:\r\n data.remove(0)\r\nprint(len(data))\r\n", "number = int(input())\na1 = list(map(int,input().split()))\nwhile( 0 in a1):\n a1.remove(0)\nprint(len(set(a1)))\n\t\t \t \t \t\t\t \t\t\t \t\t\t\t\t\t \t\t", "import math,sys\nfrom collections import Counter, defaultdict\nfrom sys import stdin, stdout\n#input = stdin.readline\nlili=lambda:list(map(int,sys.stdin.readlines()))\nli = lambda:list(map(int,input().split()))\n\n\nn=int(input())\na=li()\ns=set(a)\nif(0 in a):\n print(len(s)-1)\nelse:\n print(len(s))\n", "n = input()\r\nprint(len(set(filter(lambda x: x != '0', input().split()))))\r\n", "input()\r\nprint(len(set(x for x in input().split()if x!='0')))", "n=int(input())\r\nx=[]\r\nfor i in input().split():\r\n z=int(i)\r\n if z>0:\r\n x.append(z)\r\nx=set(x)\r\nprint(len(x))\r\n", "n=int(input())\nls=list(map(int,input().split()))[:n]\nls=list(set(ls))\nif 0 not in ls:\n\tprint(len(ls))\nelse:\n\tprint(len(ls)-1)\n\t\t\t\t\t\t \t \t \t \t \t\t \t \t\t", "a = int(input())\r\nb = list(map(int,input().split()))\r\na = set(b)\r\nq = []\r\nfor j in a:\r\n if j == 0:\r\n pass\r\n else:\r\n q.append(j)\r\nprint(len(q))\r\n", "n = int(input())\n\na = [int(x) for x in input().split()]\n\nans = 0\narr = {}\n\nfor i in a:\n if i != 0 and not arr.get(i, False):\n arr[i] = True\n ans += 1\n\nprint(ans)\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()[:n]))\r\n\r\nb = []\r\nfor i in l:\r\n\tif i != 0:\r\n\t\tb.append(i)\r\n\r\nprint(len(set(b)))", "n = int(input())\r\nw = set(map(int, input().split())) - {0}\r\nprint(len(w))\r\n", "n = int(input()) # participants\n\nsequence = input().split() # points\n\nvalues = [int(x) for x in sequence]\n\ncount = 0\ncontrol_repetead = []\nfor i in range(len(values)-1, -1, -1):\n if values.count(values[i]) > 1 and values[i] >= 1 and (not values[i] in control_repetead):\n count += 1\n control_repetead.append(values[i])\n \n elif values[i] >= 1 and values.count(values[i]) == 1:\n count += 1\n\nprint(count)\n\t\t \t\t \t\t\t \t\t\t \t\t \t\t \t\t \t \t", "# Olympiad\n\nn = input()\ngrades = input().split()\nways = len(set(grades))\n\nif \"0\" in grades:\n ways -= 1\n\nprint(ways)\n", "n = int(input())\r\na = list(map(int, input().split()))\r\na.sort()\r\nwhile 0 in a:\r\n a.remove(0)\r\ntotal = 0\r\nwhile len(a) > 0:\r\n total += 1\r\n min = a[0]\r\n while min in a:\r\n a.remove(min)\r\n\r\nprint(total)", "n = int(input())\r\nl = list(map(int,input().split()))\r\ns = list(set(l))\r\nle = len(s)\r\nif(0 in s):\r\n\tle-=1\r\nprint(le)", "k=int(input())\nlis1=list(map(int, input().split()))[:k]\ny=set(lis1)\nif 0 in y:\n print(len(y)-1)\nelse:\n print(len(y))\n\t\t \t \t\t\t \t\t\t \t \t\t\t\t \t \t\t", "n=int(input())\r\ns={x for x in input().split() if x!='0'}\r\nprint(len(s))\r\n", "n = int(input());\r\nA = list(map(int, input().split()));\r\nB = [];\r\ncnt = 0;\r\nfor q in range(1000):\r\n B.append(0);\r\nfor q in range(n):\r\n if A[q] == 0 or B[A[q]] == 1:\r\n cnt += 1;\r\n else:\r\n B[A[q]] = 1;\r\nprint(n - cnt);", "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\nl=list(set(l))\r\nif(0 in l):\r\n print(len(l)-1)\r\nelse:\r\n print(len(l))", "n = int(input())\na = set(map(int,input().split()))\nif 0 in a:\n\ta.discard(0)\nprint(len(a))\n\t \t\t \t \t \t \t\t\t\t \t\t \t\t\t", "n = int(input())\r\narr = [int(i) for i in input().split()]\r\n\r\narr = sorted(set(arr))\r\n\r\nif arr[0] == 0:\r\n print(len(arr) - 1)\r\nelse:\r\n print(len(arr))", "n=int(input())\r\nst={int(a) for a in input().split()}\r\nif 0 in st: st.remove(0)\r\nprint(len(st))", "dum = int(input())\ny = list(map(int,input().split()))\ny = [x for x in y if x != 0]\nprint(len(set(y)))\n \t\t\t \t \t\t \t\t \t\t \t \t \t \t", "n=int(input())\nl=list(map(int,input().split()))\ns=list(set(l))\nfor i in s:\n if i==0:\n s.remove(i)\nprint(len(s))\n\t \t\t \t \t \t \t\t\t \t \t\t\t", "n=int(input())\nl=list(map(int,input().split()))\ns=set(l)\na=len(s)\nif(0 in s):\n print(a-1)\nelse:\n print(a)\n\n\t\t\t\t\t \t \t \t\t \t \t\t\t \t \t", "i= int(input())\r\nlis = set(int(i) for i in input().split())\r\nlis.discard(0)\r\nprint(len(lis))", "v=int(input())\nl1=list(map(int,input().split()))\nl2=set(l1)\nx=0\nfor i in l2:\n\tif i!=0:\n\t\tx=x+1\nprint(x)\n\t\t\t\t \t\t\t\t \t\t\t \t \t \t \t\t\t \t \t", "n = int(input())\r\nA = list(map(int, input().split()))\r\nA = set(A)\r\nres = len(A)\r\nfor i in A:\r\n if not i:\r\n res -= 1\r\nprint(res)", "\"\"\"\r\n██╗ ██████╗ ██╗ ██████╗ ██████╗ ██╗ █████╗\r\n██║██╔═══██╗██║ ╚════██╗██╔═████╗███║██╔══██╗\r\n██║██║ ██║██║ █████╔╝██║██╔██║╚██║╚██████║\r\n██║██║ ██║██║ ██╔═══╝ ████╔╝██║ ██║ ╚═══██║\r\n██║╚██████╔╝██║ ███████╗╚██████╔╝ ██║ █████╔╝\r\n╚═╝ ╚═════╝ ╚═╝ ╚══════╝ ╚═════╝ ╚═╝ ╚════╝\r\n\"\"\" \r\n__author__ = \"Dilshod\"\r\nn = int(input())\r\nm = set(map(int, input().split()))\r\nif 0 in m:\r\n\tprint(len(m) - 1)\r\nelse:\r\n\tprint(len(m))\r\n\r\n\t\r\n\t\r\n", "for _ in range(1):\n n=int(input())\n l=list(set(map(int,input().split())))\n if 0 in l:\n print(len(l)-1)\n else:\n print(len(l))\n\t \t \t\t\t \t \t \t\t\t\t\t \t \t \t", "n = int(input())\r\nparticipants = set(input().split())\r\n\r\nways = len(participants)\r\nif ('0' in participants):\r\n print(ways - 1)\r\nelse:\r\n print(ways)", "n=int(input())\no=list(map(int,input().split()))\nif(o.count(0)):\n print(len(set(o))-1)\nelse:\n print(len(set(o)))\n\t \t\t\t\t \t\t \t\t \t\t \t\t\t \t \t\t \t", "def olympiad():\n n= int(input())\n ls = list(map(str,input().split()))[:n]\n s = set(ls)\n ls1 = list(s)\n c=0\n for i in range(len(ls1)):\n if ls1[i]==\"0\":\n c += 1\n print(len(ls1)-c)\nolympiad()\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\narr.sort()\r\nwhile 0 in arr:\r\n arr.remove(0)\r\nif len(arr) == 0:\r\n cnt = 0\r\nelse:\r\n cnt = 1\r\nfor i in range(len(arr)-1):\r\n if arr[i] != arr[i+1]:\r\n cnt += 1\r\nprint(cnt)", "a=int(input(''))\r\nb=list(map(int,input().split()))\r\nt=[]\r\np=0\r\nl=0\r\nz=[]\r\nq=0\r\nk=0\r\nfor i in range(a):\r\n if(not(b[p]==0)):\r\n t.append(b[p])\r\n p=p+1\r\nfor jk in range(len(t)):\r\n if(not(t[l] in z)):\r\n z.append(t[l])\r\n l=l+1\r\nprint(len(z))\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n \r\n", "n=int(input())\nla=list(map(int,input().split()))\nmain=[]\nfor i in range(len(la)):\n\tif(la[i]!=0):\n\t\tmain.append(la[i])\nmain=set(main)\nmain=list(main)\nprint(len(main))\n\t\t\t\t\t\t\t \t \t \t \t\t \t \t \t", "t=int(input())\nl=list(map(int,input().split()))\nl.sort()\ns=set(l)\nsum=0\nfor i in s:\n if i==0:\n continue\n sum+=1\nprint(sum)\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", "input()\ns = set(input().split())\ns.discard('0')\nprint(len(s))\n", "n = int(input())\r\nar = input().split(' ')\r\nfrom collections import Counter\r\n\r\nc = Counter(ar)\r\ndel c['0']\r\n#print(c)\r\nar = c.most_common(len(c))\r\nprint(len(ar))\r\n\r\n", "int(input())\r\nlst = list(map(int, input().split()))\r\nlst1 = []\r\nfor i in lst:\r\n if i > 0:\r\n lst1.append(i)\r\nprint(len(set(lst1)))", "n = int ( input())\n\nline = input()\nnums = list ( map ( int , line.split(' ')[0:n] ) )\nnums = set ( filter( lambda x : x > 0 , nums) )\n\nprint ( len ( nums ))\n\n\n", "n=int(input())\na=set(map(int,input().split()))\ns=set()\ns.add(0)\na=a.difference(s)\nprint(len(a))\n\n\t\t\t\t\t\t \t \t\t \t\t \t \t \t", "n=int(input())\narr=list(map(int,input().split()[:n]))\na=set(arr)\nc=0\nfor i in a:\n if(i!=0):\n c=c+1\nprint(c)\n\n \t\t\t\t\t\t\t\t \t \t\t\t\t \t\t \t", "# 去重，num>0\nn = int(input())\nl = list(map(int, input().split()))\nli = []\nfor i in range(n):\n if l[i] > 0:\n li.append(l[i])\nli = list(set(li))\nprint(len(li))\n\n \t \t \t\t\t\t\t\t \t\t\t \t\t\t\t", "t=int(input())\nl=list(map(int,input().split()))\ns=list(filter(lambda n: n!=0,set(l)))\nprint(len(s))\n \t\t\t\t\t\t \t \t \t \t \t \t \t", "n=input()\r\nx=list(set(list(map(int,input().split()))))\r\nif not (len(x)-1):\r\n print(1)\r\nelif 0 in x:\r\n print(len(x)-1)\r\nelse:\r\n print(len(x))", "try:\n\tn=int(input())\n\ta=[int(x) for x in input().split()]\n\tfor i in range(n):\n\t\tfor j in range(0,n-i-1):\n\t\t\tif a[j+1]>a[j]:\n\t\t\t\tt=a[j]\n\t\t\t\ta[j]=a[j+1]\n\t\t\t\ta[j+1]=t\n\tsum=1\n\tfor i in range(1,n):\n\t\tif a[i]:\n\t\t\tif a[i]==a[i-1]:\n\t\t\t\ti+=1\n\t\t\telse:\n\t\t\t\tsum+=1\n\t\t\t\ti+=1\n\t\telse:\n\t\t\ti=i+1\n\tprint(sum)\n\t\t\t\nexcept EOFError:\n\tpass\n \t \t \t \t \t \t \t \t\t", "n=int(input())\r\nl=list(map(int,input().split()))\r\ns=set(l)\r\nd=len(s)\r\nprint(d-1 if 0 in s else d)\r\n", "i = int(input())\nscores = list(map(int, input().split()))\n\nagg = {}\nfor s in scores:\n if s == 0:\n continue\n agg[s] = agg.get(s, 0) + 1\n\nprint(len(agg))\n", "input()\r\nprint(len(set(filter(lambda x:x,map(int,input().split())))))", "n = int(input())\r\ns = set(input().split())\r\nprint(len([x for x in s if x != '0']))", "#!/usr/bin/env/python\r\n# -*- coding: utf-8 -*-\r\nn = int(input())\r\na = list(map(int, input().split()))\r\ndc = {}\r\nfor aa in a:\r\n if aa > 0:\r\n dc[aa] = 1\r\nprint(len(dc.keys()))", "a1=int(input())\r\nb1=list(map(int,input().split()))\r\nwhile(0 in b1):\r\n b1.remove(0)\r\nb1=set(b1)\r\nprint(len(b1))", "n=int(input())\r\na=list(map(int, input().split()))\r\ns=list(set(a))\r\nprint(len(s)-s.count(0))\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\na = sorted(a)\r\ns = 0\r\nse = set(a)\r\nse.discard(0)\r\nprint(len(se))\r\n", "n = int(input())\nline = input().split(' ')\n\na= []\nfor i in range(n):\n a.append(int(line[i]))\n\n#print(a)\n\nb = set(a)\n#print(b)\nsum1 = 0\nc = list(b)\nfor i in range(len(c)):\n if c[i] != 0 :\n sum1 = sum1 + 1\nprint(sum1)\n#print(len(b))\n", "m=input()\nn=list(map(int,input().split()))\nprint(len(set(n)-{0}))\n\t\t \t\t\t \t\t\t\t\t \t\t\t \t\t \t", "n = int(input())\r\na = set(map(int, input().split()))\r\nif 0 in a:\r\n\tprint(len(a)-1)\r\nelse:\r\n\tprint(len(a))", "t=int(input())\nn=list(map(int,input().split()))\nwhile(0 in n):\n n.remove(0)\nn=set(n)\nprint(len(n))\n\n \t\t\t\t\t \t\t \t \t\t\t \t\t\t \t \t\t\t", "try:\n n1=int(input())\n x=set(map(int,input().split()))\n x.remove(0)\n print(len(x))\nexcept KeyError:\n print(len(x))\n\n \t \t\t\t\t\t \t\t \t\t \t\t \t\t\t\t \t", "t=int(input())\nlist1=list(map(int, input().split()))[:t]\nx=set(list1)\nif 0 in x:\n\tprint(len(x)-1)\nelse:\n\tprint(len(x))\n\t \t \t\t\t \t\t \t\t\t \t \t \t\t\t \t\t \t", "input()\r\na = list(map(int, input().split()))\r\nprint(len(set(a))-1 if 0 in a else len(set(a)))\r\n \r\n", "firstLine = input()\nscores = list(map(int, input().split()))\nnoZeros = list(filter(lambda x: x>0 ,scores))\nprint(len(set(noZeros)))\n\t \t\t \t\t \t \t\t \t\t \t\t \t\t \t \t", "n=int(input())\r\nk=0\r\na=list(set([int(i) for i in input().split()]))\r\nfor i in range(len(a)):\r\n if a[i]!=0:\r\n k+=1\r\nprint(k)\r\n", "n = int(input())\r\nl = list(map(int, input().split()))\r\nans = []\r\nfor i in l:\r\n if i not in ans and i != 0:\r\n ans.append(i)\r\nprint(len(ans))", "t=int(input())\narr=list(map(int,input().split()))\narr.sort()\na=1\nfor var in range(t-1):\n if arr[var]!=arr[var+1] and arr[var]!=0:\n a=a+1\nprint(a)\n \n\n\t \t \t\t \t \t\t\t\t\t \t \t\t\t \t \t", "n=int(input())\r\ndata=list(map(int,input().split()))\r\nres=0\r\ndata.sort()\r\nstandard=0\r\nfor i in range(len(data)):\r\n if data[i] != standard:\r\n standard=max(data[i],standard)\r\n res+=1\r\nprint(res)", "n = int(input())\r\na = set(map(int, input().split()))\r\na.discard(0)\r\nprint(len(a))\r\n", "n=int(input())\na=set([int(i) for i in input().split()])\na.discard(0)\nprint(len(a))\n \t\t\t \t\t \t\t \t \t\t \t \t\t \t", "m=int(input())\r\nn=list(map(int,input().split()))\r\nwhile(0 in n):\r\n n.remove(0)\r\nn=set(n)\r\nprint(len(n))", "#给定数列中非零数的个数,去重\nn=int(input())\ns=list(map(int,input().split()))\nw=[]\nm=0\nw=list(set(s))\nfor k in w:\n if k!=0:\n m=m+1\nprint(m)\n\n\n\t \t \t\t\t \t \t \t\t\t \t \t\t \t \t \t", "p=int(input())\nc=list(map(int,input().strip().split()))[:p]\nq=set(c)\nl=len(q)\nif 0 in q:\n print(l-1)\nelse:\n print(l)\n \t \t \t\t\t \t\t\t\t \t \t", "if __name__ == '__main__':\r\n input()\r\n s = set(input().split())\r\n print(len(s) - ('0' in s))\r\n", "\r\nn=int(input())\r\nm=(input().split())\r\nprint(len(set(m)-{'0'}))\r\n\r\n\r\n", "n = int(input())\r\na=list(map(int, input().split()))\r\n\r\nl=list(set(a))\r\nif 0 in l:\r\n l.remove(0)\r\n\r\nprint(len(l))", "n = int(input())\na = set(list(map(int, input().split())))\nans = len(a)\nif 0 in a:\n ans -= 1\nprint(ans)", "n=int(input())\r\nlst = list(map(int, input().split()))\r\ns=set(lst)\r\nk=len(s)\r\nif 0 in s:\r\n k=k-1;\r\nprint(k)\r\n", "n=int(input())\r\nl=[int(num) for num in input().split()]\r\nl=list(set(l))\r\nif 0 in l:\r\n print(len(l)-1)\r\nelse:\r\n print(len(l))\r\n\r\n", "ls=[]\nn=int(input())\nar=list(map(int,input().split()))\nar.sort()\nfor i in ar:\n if i not in ls:\n if(i!=0):\n ls.append(i)\nprint(len(ls))\n \t \t \t \t \t \t \t \t\t\t\t \t\t \t\t\t \t", "num = int(input())\r\ndiploma = [int(a) for a in input().split(\" \")]\r\nduplicate = set()\r\n\r\nfor x in diploma:\r\n if x != 0:\r\n duplicate.add(x)\r\n \r\nprint(len(duplicate))", "varrrrrr1=int(input())\nvarrrrrr2=list(map(int,input().split()))\nwhile(0 in varrrrrr2):\n varrrrrr2.remove(0)\nvarrrrrr2=set(varrrrrr2)\nprint(len(varrrrrr2))\n\t\t\t\t \t \t \t\t \t\t \t \t\t \t\t", "n=int(input())\r\ns=str(input())\r\ns+=' '\r\nli=[]\r\nc=0\r\nj=0\r\nwhile s!='':\r\n if s[j]==' ':\r\n a=int(s[:j])\r\n s=s[j+1:]\r\n li.append(a)\r\n j=0\r\n j+=1\r\nwhile 0 in li:\r\n li.remove(0)\r\nwhile li!=[]:\r\n u=li[0]\r\n while u in li:\r\n li.remove(u)\r\n c+=1\r\nprint(c)\r\n", "no1=int(input())\nno2=list(map(int,input().split()))\nwhile(0 in no2):\n no2.remove(0)\nno2=set(no2)\nprint(len(no2))\n\t\t\t \t\t\t\t\t\t\t\t\t\t\t\t \t\t\t \t\t \t\t\t", "if __name__ == \"__main__\":\r\n participants = int(input())\r\n scores = list(map(int, input().split()))\r\n scores_set = set(scores)\r\n scores_set.add(0)\r\n print(len(scores_set) - 1)", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Thu Mar 8 13:51:56 2018\r\n\r\n@author: Nikita\r\n\"\"\"\r\n\r\nn = int(input())\r\nprint(len(set(list(map(int, input().split()))) - set([0])))\r\n", "vari1=int(input())\nvari2=list(map(int,input().split()))\nwhile(0 in vari2):\n vari2.remove(0)\nvari2=set(vari2)\nprint(len(vari2))\n\t \t \t\t \t \t \t\t \t\t \t\t\t\t \t\t\t", "n=int(input())\r\ns=set(map(int,input().split()))\r\nprint(len(s)-1 if 0 in s else len(s))", "input()\nprint(len(set([x for x in map(int, input().split()) if x != 0])))", "var3=int(input())\r\nvar4=list(map(int,input().split()))\r\nwhile(0 in var4):\r\n var4.remove(0)\r\nvar4=set(var4)\r\nprint(len(var4))", "x=int(input())\ny=list(map(int,input().split()))\nwhile(0 in y):\n y.remove(0)\ny=set(y)\nprint(len(y))\n\t\t \t \t \t\t \t\t \t\t \t\t\t \t", "if __name__ == '__main__':\r\n n = int(input())\r\n a = list(map(int, input().split()))\r\n a = list(filter(lambda x : x > 0, a))\r\n print(len(set(a)))\r\n", "input()\r\ns=sorted(map(int,input().split()))\r\nl=0\r\nj=-1\r\nfor n in s:\r\n if n!=0 and n!=j:\r\n j=n\r\n l+=1\r\nprint(l)", "n = int(input())\r\na = list(map(int, input().split()))\r\nh = [False for i in range(0,601)]\r\n# h(i) is True iff. i>0 and i appears in a\r\nfor x in a:\r\n if x > 0:\r\n h[x] = True\r\nprint(h.count(True))", "n = int(input())\ns = set(list(map(int, input().split()))) - set([0])\nprint(len(s))\n\n \t \t \t \t \t \t \t \t\t \t", "n = int(input())\r\nA = list(map(int,input().split()))\r\nB = []\r\nans = 0\r\nfor i in range(n):\r\n if A[i] not in B and A[i] > 0:\r\n ans += 1\r\n B.append(A[i])\r\nprint(ans)\r\n ", "input()\r\na = list(map(int, input().split()))\r\nprint(len(set(a)) - 1 if 0 in a else len(set(a)))\r\n\r\n# HaPpY NoWrUz 1398\r\n# UBCF\r\n# CodeForcesian\r\n# ashegham\r\n\r\n", "z=int(input())\ng=list(map(int,input().split()))\nk=set(g)\nh=0\nfor i in k:\n\tif i!=0:\n\t\th=h+1\nprint(h)\n\t\t\t\t\t \t \t\t \t\t \t\t\t\t\t\t \t", "n=int(input())\ns=set(map(int,input().split()))\ns.discard(0)\nprint(len(s))\n \t\t \t \t\t \t \t\t \t\t", "n=int(input())\nlist1=list(map(int, input().split()))[:n]\nx=set(list1)\nif 0 in x:\n\tprint(len(x)-1)\nelse:\n\tprint(len(x))\n \t\t\t \t\t\t \t \t \t\t \t\t \t\t \t\t \t", "n=int(input())\r\nl=list(map(int,input().split()))\r\ni=0\r\nwhile i in l:\r\n\tl.remove(i)\r\nk=[]\r\nfor j in range(len(l)):\r\n\tif l[j] not in k:\r\n\t\tk.append(l[j])\r\nk.sort()\r\nfor i in range(len(k)):\r\n\tif k[i]==max(k):\r\n\t\tprint(i+1)\r\n\t\tbreak", "x=int(input())\r\ny=list(map(int,input().split(\" \")))\r\nz=list(set(y))\r\na=0\r\nif a in z:\r\n\tz.remove(a)\r\nprint(len(z))", "alpgha=int(input())\ndelta=list(map(int,input().split()))\nwhile(0 in delta): delta.remove(0)\ndelta=set(delta)\nprint(len(delta))\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\nl=list(map(int,input().split()))\r\na=l.count(0)\r\nif(a>0):\r\n\ta=1\r\nl=len(set(l))\r\nprint(l-a)", "n=int(input())\r\na=list(map(int,input().split()))\r\nk=set(a)\r\nif 0 in k:\r\n\tprint(len(k)-1)\r\nelse:\r\n\tprint(len(k))", "n,l=int(input('')),list(map(int,input().split()))\r\ns=[]\r\nfor i in l:\r\n if i not in s:\r\n s.append(i)\r\nprint(len(list(filter(lambda x:x>0,s))))", "_, numbers = input(), set(input().split())\r\nprint(len(numbers)-('0' in numbers)) ", "n=int(input())\nlis=input().split(' ')\na=list(set(lis))\nif '0' in lis:\n print(len(a)-1)\nelse:\n print(len(a))\n \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\nlis=[]\r\ncount=0\r\nfor j in x:\r\n if j not in lis and j!=0:\r\n lis.append(j)\r\n count+=1\r\nprint(count)", "n = int(input())\nprint(len(set([i for i in input().split() if i!='0'])))", "_ = input()\r\na = []\r\nfor i in input().split():\r\n if int(i) > 0 and int(i) not in a:\r\n a.append(int(i))\r\nprint(len(a))\r\n", "a=int(input())\nl=list(set(map(int,input().split())))\ncount=0\nfor i in l:\n if(i!=0):\n count+=1\nprint(count)\n\n \t\t\t \t\t\t\t \t \t\t\t \t \t \t \t \t \t", "n=int(input())\r\nl1=list(map(int,input().strip().split()))\r\n#l1.sort()\r\nls=set(l1)\r\n\r\nif 0 in ls:\r\n ans=len(ls)-1\r\n #print(\"here\")\r\n \r\nelse:\r\n ans=len(ls)\r\nprint(ans)", "n=input()\na=set(list(map(int,input().split())))\nprint(len(a)-1) if (0 in a) else print(len(a))\n", "test_case=int(input())\r\nlist1=map(int,input().split())\r\nset_=set(list1)\r\ncount=0\r\nfor i in set_:\r\n if i==0:\r\n continue\r\n else:\r\n count=count+1 \r\nprint(count)", "n=int(input())\r\nl=list(map(int,input().split()))[:n]\r\nl=list(set(l))\r\nk=l.count(0)\r\nprint(len(l)-k)", "n=int(input())\r\nl=list(map(int, input().split()))\r\ns=set()\r\nfor i in range(n):\r\n if l[i]!=0:\r\n s.add(l[i])\r\nprint(len(s))", "n=int(input())\r\na=list(map(int,input().split()))\r\nb=set(a)\r\nif 0 not in a:\r\n print(len(b))\r\nelse:\r\n c=0\r\n for i in b:\r\n if i>0:\r\n c+=1\r\n print(c)", "n=int(input())\nsam=0\nsa=set(list(map(int,input().split())))\nl=list(sa)\nsam+=1\nsa.discard(0)\n\nprint(len(sa))\n\t\t \t \t\t \t \t\t\t \t\t\t\t \t\t \t\t", "k=int(input())\narr=list(map(int,input().split()))\narr=list(set(arr))\nif 0 in arr:\n print(len(arr)-1)\nelse:\n print(len(arr))\n\t \t \t\t\t \t\t\t\t\t\t \t\t \t\t\t\t\t \t\t\t \t", "from collections import deque\r\nfrom math import ceil,sqrt\r\ndef ii():return int(input())\r\ndef si():return input()\r\ndef mi():return map(int,input().split())\r\ndef li():return list(mi())\r\nabc=\"abcdefghijklmnopqrstuvwxyz\"\r\nn=ii()\r\na=li()\r\na=list(set(a))\r\nif(a[0]==0):\r\n print(len(a)-1)\r\nelse:\r\n print(len(a))", "n = int(input())\r\na = list(map(int, input().split()))\r\nok = 0\r\nif 0 in a:\r\n ok = 1\r\nprint(len(set(a)) - ok)\r\n", "# cf 937A\r\n# n participants \r\nn = int(input())\r\nlst = list(map(int, input().split()))\r\nlst = list(filter((0).__ne__, lst))\r\nprint(len(set(lst)))", "j=int(input())\nc=list(map(int,input().split()))\nk=set(c)\nh=0\nfor i in k:\n\tif i!=0:\n\t\th=h+1\nprint(h)\n \t \t\t \t \t \t \t \t\t \t\t\t\t\t \t\t", "t=int(input())\nlsti=list(map(int,input().split()))\nlsti2=set(lsti)\ncsai=0\nfor i in lsti2:\n\tif i!=0:\n\t\tcsai=csai+1\nprint(csai)\n\t\t\t \t \t \t\t\t \t\t \t \t\t \t", "n=int(input())\r\nprint(len(set((input().split()))-{'0'}))", "n=int(input())\r\nz=list(map(int,input().split()))\r\nz=set(z)\r\nc=0\r\nfor i in z:\r\n\tif i!=0:\r\n\t\tc=c+1\r\n\r\nprint(c)", "\r\n\r\nn = int(input())\r\na =set(map(int,input().split()))\r\nif a.__contains__(0):\r\n print(len(a)-1)\r\nelse:\r\n print(len(a))", "n=int(input())\r\nl=list(map(int,input().split()))\r\nl1=list(set(l))\r\nif 0 in l1:\r\n print(len(l1)-1)\r\nelse:\r\n print(len(l1))", "n=int(input())\na = list(input().split())\nfor i in range(len(a)):\n a[i] = int(a[i])\ns = []\n\nfor i in a:\n if i not in s:\n s.append(i)\n\n\nif 0 in s:\n s.remove(0)\n\nprint(len(s))\n\n\n\n \t \t\t \t\t \t\t\t\t\t\t\t\t \t\t\t\t\t", "n = int(input())\ns = list(map(int, input().split()))\nx = len(set(s))\na = 0\nfor i in range(n):\n if s[i] == 0:\n a = a + 1\nif a == 0:\n print(x)\nelif a != 0:\n print(x-1)\n\t \t\t \t\t\t\t \t\t\t\t \t\t\t \t \t\t\t", "n=int(input())\na=list(map(int,input().split()))\na=[b for b in a if b!=0]\nprint(len(set(a)))\n\t\t \t \t\t \t\t \t \t \t\t\t \t \t\t", "n = int(input())\nx = list(map(int,input().split(\" \")))\nz = sorted(x, reverse=True)\na = set(z)\nif 0 in a:\n a.remove(0)\nprint(len(a))\n \t \t \t \t\t\t\t \t\t \t \t\t\t\t\t", "num=int(input())\nlst=list(map(int,input().split()))[:num]\na=set(lst)\nif 0 in a:\n print(len(a)-1)\nelse:\n print(len(a))\n \t\t\t\t\t\t\t\t\t \t \t\t \t\t \t \t\t \t \t", "input()\nnumeros = {num for num in input().split() if int(num) != 0}\nprint(len(numeros))\n\n \t \t \t\t \t\t \t \t \t \t", "\r\nn = int(input())\r\nv = set([int(x) for x in input().split() if int(x) > 0])\r\nprint(len(v))\r\n\r\n\r\n", "n = int(input()) \r\na =input().split()\r\nfor i in range(n):\r\n a[i]= int(a[i])\r\na = list(set(a))\r\nif (0 in a):\r\n print(len(a)-1)\r\nelse:\r\n print(len(a))\r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n\r\n \r\n \r\n \r\n\r\n", "n = int(input())\r\na = set([int(x) for x in input().split()])\r\ncount = len(a)\r\nif 0 in a:\r\n count -= 1\r\nprint(count)", "n=int(input())\nx=[]\nx=list(map(int,input().split()))\nx.sort()\nx=set(x)\nif 0 in x:\n print(len(x)-1)\nelse:\n print(len(x))\n", "p=int(input())\nq=(input().split())\nprint(len(set(q)-{'0'}))\n \t\t\t\t \t\t\t \t \t\t \t\t\t\t \t\t", "n=int(input())\r\nl=set(map(int,input().split()))\r\nl.discard(0)\r\nprint(len(l))\r\n", "n = int(input())\nscore = list(set(map(int, input().split(\" \"))))\nif 0 in score:\n score.remove(0)\nprint(len(score))\n\t \t \t \t\t \t\t \t \t\t\t\t \t \t\t \t", "N=int(input())\nlis1=list(map(int, input().split()))[:N]\nx=set(lis1)\nif 0 in x:\n print(len(x)-1)\nelse:\n print(len(x))\n\t \t \t\t\t\t \t\t\t \t\t \t\t\t \t\t \t\t", "import math\r\nfrom sys import stdin\r\nn= int(stdin.readline().strip())\r\narray0=[int(x) for x in stdin.readline().strip().split()]\r\narray0.sort(reverse=True)\r\ntable=[]\r\nfor item in array0:\r\n if len(table)==0 or item!=table[-1][-1]:\r\n table.append([item])\r\n else:\r\n table[-1].append(item)\r\ncount=0\r\nfor rows in table:\r\n if rows[-1]!=0:\r\n count+=1\r\nprint(count)", "n = int(input())\r\nlst = [int(i) for i in input().split()]\r\nprint(len(set(lst)) if 0 not in lst else len(set(lst))-1)\r\n", "n=int(input())\r\nl=list(map(int, input().split()))\r\nl2=[]\r\n\r\nfor x in l:\r\n if x not in l2 and x!=0:\r\n l2.append(x)\r\n\r\nprint(len(l2))", "no3=int(input())\nno4=list(map(int,input().split()))\nwhile(0 in no4):\n no4.remove(0)\nno4=set(no4)\nprint(len(no4))\n \t \t \t \t\t\t\t\t\t\t\t\t\t\t \t \t", "n = int(input())\r\na = input().split()\r\nb = sorted(a)\r\np = 0\r\nq = 0\r\nfor i in range(1,n):\r\n if b[i] != b[i-1]:\r\n p += 1\r\nif b[0] == '0':\r\n print(p)\r\nelse:\r\n print(p + 1)", "num=int(input())\nx=list(map(int,input().split()))\nx=[y for y in x if y!=0]\nprint(len(set(x)))\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\ns=set(l)\r\nif 0 in s:print(len(s)-1)\r\nelse:print(len(s))", "import sys\ninput = sys.stdin.readline\n\nn = int(input()) \na = [int(i) for i in input().split()]\nres = [int(i) for i in a if i > 0]\nprint(len(set(res)))\n", "a=int(input())\nn=[]\ncount=0\nn=input().split(\" \")\nb=[0]*100000\nn=[int(i) for i in n]\nfor i in range(a):\n if n[i]>0:\n p=n[i]\n b[p]=b[p]+1\nfor i in range(100000):\n if b[i]>0:\n count=count+1\nprint(count)\n\t \t \t \t\t\t \t\t\t \t \t \t", "num=int(input())\nl=list(map(int,input().split()))\nwhile(0 in l):\n l.remove(0)\nl=set(l)\nprint(len(l))\n\n\t\t\t \t \t\t\t \t\t\t \t \t \t\t", "def solution():\r\n n = int(input())\r\n arr = [int(i) for i in input().split(' ') if int(i) != 0]\r\n print(len(set(arr)))\r\n\r\nif __name__ == \"__main__\":\r\n solution()\r\n", "n = int(input())\r\nl = list(map(int,input().split()))\r\ncount = 0\r\nfor i in range(len(l)):\r\n\tif l[i]==0:\r\n\t\tcount += 1\t\r\nfor j in range(count):\r\n\tl.remove(0)\r\nprint(len(set(l)))\t\t\t\r\n\t\t", "n = int(input())\r\nscores = [int(c) for c in input().split(\" \")]\r\n\r\ndip = set()\r\nfor score in scores:\r\n if score > 0 and score not in dip:\r\n dip.add(score)\r\n\r\nprint(len(dip))\r\n", "ncdfs1=int(input())\nacdfs1=[int(icdfs1) for icdfs1 in input().split()]\nbcdfs1=set()\nfor icdfs1 in acdfs1:\n if icdfs1!=0:\n bcdfs1.add(icdfs1)\nprint(len(bcdfs1))\n \t \t\t \t\t \t\t\t \t \t \t\t \t\t", "n = int(input())\r\nd = {int(i):int(i) for i in input().split() if i != '0'}\r\nprint(len(d))\r\n", "t=int(input())\r\nz={g for g in input().split() if g!='0'}\r\nprint(len(z))", "num=int(input())\n\nl=list(map(int,input().split()))\ns=set()\nfor i in l:\n if i!=0:\n s.add(i)\nprint(len(s))\n\t \t\t \t\t\t\t \t \t\t \t\t \t \t \t", "n=int(input())\na=list(map(int,input().split()))\na.sort()\nl=[]\nfor i in range(n):\n\tif(a[i]):\n\t\tl.append(int(a[i]))\nprint(len(set(l)))\n\t \t \t \t\t\t\t \t \t\t \t \t\t \t", "n=int(input())\nscores=input().split()\nscores=set(scores)\nif '0' in scores:\n scores.remove('0')\nprint(len(scores))\n\t\t\t \t\t\t \t\t\t\t\t\t \t\t\t \t \t\t", "n = int(input())\r\na = [int(el) for el in input().split()]\r\ns = set()\r\nres = 0\r\nfor el in a:\r\n if el != 0 and el not in s:\r\n s.add(el)\r\n res += 1\r\n \r\nprint(res)", "n = int(input())\r\nnums = input()\r\nint_lst = list(map(int, nums.split()))\r\n\r\ncount = 0 \r\nmy_set = set()\r\n\r\nfor i in int_lst:\r\n if i==0:\r\n continue\r\n if i not in my_set:\r\n count+=1\r\n my_set.add(i)\r\n\r\nprint(count)", "n=int(input())\na=[int(x) for x in input().split()]\na=list(set(a))\nc=0\nfor i in a:\n if i!=0:\n c=c+1\nprint(c)\n\n\t\t\t\t\t\t\t\t\t\t \t \t \t\t\t\t \t\t \t \t", "# Olympiad\r\n\r\nn=int(input())\r\ncount=0\r\nl1=list(map(int,input().split()))\r\nl2=list(set(l1))\r\nfor i in range(0,len(l2)):\r\n if(l2[i]!=0):\r\n count+=1\r\nprint(count)", "x = int(input())\n\nmylist = list(map(int,input().split()))\nmylist = set(mylist)\nmylist = list(mylist)\nif mylist[0] == 0:\n print(len(mylist) - 1)\nelse:\n print(len(mylist))\n\n \t \t \t\t\t\t\t \t\t\t \t \t \t\t \t\t\t \t", "#!/usr/bin/env python\n# coding: utf-8\n\n# In[90]:\n\n\nn = int(input())\nl = list(map(int,input().strip().split()))[:n]\nm = []\nfor i in range(len(l)):\n if l[i] != 0:\n m.append(l[i])\nprint(len(set(m)))\n\n", "n = int(input())\r\nparticipants = dict()\r\nlst = [*map(str, input().split())]\r\nfor i in lst:\r\n if i in participants.keys():\r\n participants[i] += 1\r\n else:\r\n participants[i] = 1\r\n\r\nans = 0\r\nfor key in participants:\r\n if key != \"0\":\r\n ans += 1\r\nprint(ans)\r\n", "n=int(input())\nl=list(map(int,input().split()))\nl=list(filter(lambda a:a!=0,l))\nprint(len(set(l)))\n \t \t\t\t\t \t \t \t\t \t \t\t\t \t", "m=int(input())\narr=list(map(int,input().split()))\narr.sort()\nk=1\nfor j in range(m-1):\n if arr[j]!=arr[j+1] and arr[j]!=0:\n k=k+1\nprint(k)\n \n\n \t\t\t\t \t \t\t\t\t \t\t\t \t\t\t \t\t \t\t", "n = int(input())\r\ns = list(map(int, input().split(\" \")))\r\nfor i in range(0, s.count(0)):\r\n s.remove(0)\r\n\r\nprint(len(set(s)))", "from sys import stdin\n\nn=int(stdin.readline())\na=[int(x) for x in stdin.readline().split()]\nprint(len(set(a)-{0}))\n \n \n\t\t \t\t \t \t\t \t \t \t\t\t \t\t \t", "n1 = int(input())\r\nx = input().split()\r\nlist1 = []\r\nfor i in x:\r\n if int(i) != 0:\r\n list1.append(int(i))\r\n \r\nprint(len(set(list1)))\r\n", "input=__import__('sys').stdin.readline\r\nn = int(input())\r\nlis = list(map(int,input().split()))\r\nhas=[0]*(100005)\r\nfor i in lis:\r\n if i!=0:\r\n has[i]=1\r\nprint(sum(has)) \r\n\r\n\r\n", "c=0\r\na=int(input())\r\nb=list(map(int,input().split()))\r\nb=list(dict.fromkeys(b))\r\nfor i in range(len(b)):\r\n if b[i]!=0:\r\n c+=1\r\nprint(c)", "n=int(input())\nvara=[int(i) for i in input().split()]\nball=set()\nfor i in vara:\n if i!=0:\n ball.add(i)\nprint(len(ball))\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", "a=int(input())\nb=list(map(int,input().split()))\nb=list(set(b))\nif 0 in b:\n print(len(b)-1)\nelse:\n print(len(b))\n\t \t\t\t \t\t \t \t \t \t \t\t \t", "n=int(input())\r\nl=[int(x) for x in input().split()]\r\nl=list(set(l))\r\nif 0 in l:\r\n l.remove(0)\r\nprint(len(l))", "num = int(input())\nlista = [int(n) for n in input().split(' ')]\nmaximo = list()\nlista_aux = list()\nfor v in lista:\n lista_aux.append(v)\nmaxim = None\nprem = 0\n\n\ndef Max(lista):\n max = 0\n for v in lista:\n if v > max:\n max = v\n return max\n\n\nfor cout in range(0, num):\n if cout == 0:\n maxim = Max(lista)\n if maxim != 0:\n maximo.append(maxim)\n prem += 1\n else:\n maxim = Max(lista_aux)\n if maxim != 0:\n maximo.append(maxim)\n prem += 1\n lista_aux.clear()\n for c in range(0, num):\n if lista[c] not in maximo:\n lista_aux.append(lista[c])\n\nprint(prem)\n\t\t\t \t \t\t \t\t\t \t\t\t \t\t\t \t\t \t", "b=int(input())\nli=[int(x) for x in input().split()]\nli.sort()\nif(li[0]==0):\n\tc=0\nelse:\n\tc=1\nfor i in range(1,b):\n\tif(li[i]!=li[i-1] and li[i]!=0):\n\t\tc+=1\nprint(c)\n \t \t \t\t \t \t\t\t \t \t\t \t\t\t", "n=int(input())\r\nstr=input()\r\nli=str.split(\" \")\r\nscores={0}\r\nfor i in li:\r\n scores.add(int(i))\r\nprint(len(scores)-1)", "n = int(input())\r\na = set(list(map(int, input().split())))\r\na = a.difference([0])\r\nprint(len(a))", "#937A\r\nn=int(input())\r\na=set([int(a) for a in input().split()])\r\nif list(a).count(0)>0:\r\n a.remove(0)\r\n print(len(a))\r\nelse:\r\n print(len(a))", "n = int(input())\narr = set([int(i) for i in input().split()])\nans = len(arr)\n\nif 0 in arr:\n ans -= 1\n\nprint(ans)\n", "n=int(input())\r\nx=set(list(map(int, input().split())))\r\nx=[i for i in x]\r\nif x.count(0)!=0: print(len(x)-1)\r\nelse: print(len(x))\r\n", "n = int(input())\r\nl = list(map(int, input().split()))\r\nl.sort()\r\ni = 0\r\nwhile l[i] <= 0:\r\n i += 1\r\nprint(len(set(l[i:])))\r\n", "N = int(input())\nl = [int(x) for x in input().split()]\nlis= []\nfor elt in l:\n if elt not in lis and elt != 0:\n lis.append(elt)\nprint(len(lis))\n", "n=int(input())\narr=list(map(int,input().split()))\narr.sort()\na=1\nfor i in range(n-1):\n if arr[i]!=arr[i+1] and arr[i]!=0:\n a=a+1\nprint(a)\n \n\n \t \t \t \t \t\t \t \t\t \t", "a=int(input())\narr=list(map(int,input().split()))\narr.sort()\nc=1\nfor i in range(a-1):\n if arr[i]!=arr[i+1] and arr[i]!=0:\n c=c+1\nprint(c)\n \n\n\t\t \t\t\t \t\t\t\t \t \t \t\t \t\t\t\t \t\t", "n = int(input())\nlist1 = list(map(int, input().split()))\nlist2 = list(set(list1))\nfor i in range(len(list2)):\n num1 = max(list2)\n num2 = min(list2)\n #print(list2)\n if num1 == num2:\n flag = 1\n else:\n flag = 0\nif flag == 1:\n print(1)\nelif flag == 0 and num2 == 0:\n print(len(list2)-1)\nelif flag == 0:\n print(len(list2))\n\t\t \t\t\t\t \t\t \t\t\t\t \t \t\t\t \t \t", "members = int(input())\r\nquantity = list(map(int, input().split(\" \")))\r\nquantity.sort()\r\nmeans = 0\r\nif members != len(quantity):\r\n print( \"Lmao WTF are you doing?\" )\r\nif quantity[0] > 0:\r\n means = 1\r\nfor i in range(0, len(quantity) - 1): \r\n if quantity[i] < quantity[i + 1]:\r\n means = means + 1 \r\nprint(means)", "input()\r\nl=set([int(x) for x in input().split()])\r\nif 0 in l:\r\n print(len(l)-1)\r\nelse:\r\n print(len(l))", "n= int(input())\r\na= sorted(list(map(int,input().split())))\r\na=list(set([x for x in a if x>0]))\r\nprint(len(a))", "x = int(input())\r\n\r\nmylist = list(map(int,input().split()))\r\nmylist = set(mylist)\r\nmylist = list(mylist)\r\nif mylist[0] == 0:\r\n print(len(mylist) - 1)\r\nelse:\r\n print(len(mylist))\r\n", "n = int(input())\r\n*a, = map(int, input().split())\r\nif 0 in a:\r\n print(len(set(a)) - 1)\r\nelse:\r\n print(len(set(a)))\r\n", "#!/bin/python3\r\nn = int(input())\r\nl = list(map(int, input().split()))\r\ns = set(l)\r\ncounter = 0\r\nfor lol in s:\r\n\tif lol != 0 :\r\n\t\tcounter += 1\r\n\r\nprint(counter)\r\n", "n=int(input())\r\nlst=[int(x) for x in input().split()]\r\nlst1=[i for i in lst if i != 0]\r\nprint(len(set(lst1)))\r\n", "def unique(A):\r\n unique_list = []\r\n for x in A:\r\n if x not in unique_list:\r\n unique_list.append(x)\r\n c = len(unique_list)\r\n return c\r\nn = int(input())\r\nA = list([int(x) for x in input().split()])\r\nif 0 in A:\r\n m = A.count(0)\r\n for z in range(0,m):\r\n A.remove(0)\r\nl = unique(A)\r\nprint(l)", "n=int(input())\r\ns=list(map(int,input().split()))\r\nk=set(s)\r\nif 0 in k:\r\n print(len(k)-1)\r\nelse:\r\n print(len(k))", "x = int(input())\r\npoints=list([int(x) for x in input().split() if x!=0])\r\npoints=list(dict.fromkeys(points))\r\nif 0 in points:\r\n points.remove(0)\r\npoints.sort(reverse=True)\r\nprint(len(points))", "n=int(input())\r\na=list(map(int, input().split()[:n]))\r\na=list(i for i in a if i!=0)\r\nsetTemp=set(a)\r\nprint(len(setTemp))", "n=int(input())\r\nls=set(map(int,input().rstrip().split()))\r\nif(0 in ls):\r\n print(len(ls)-1)\r\nelse:\r\n print(len(ls))", "n=int(input())\nl=list(map(int,input().split()))[:n]\nres=set(l)\nres=list(res)\n# print(res)\nnn=res.count(0)\nprint(len(res)-nn)\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\nfor i in range(l.count(0)):\r\n\tl.remove(0)\r\na=set(l)\t\r\nprint(len(a))", "n = int(input())\r\narr = [int(i) for i in input().split()]\r\nseen = set()\r\ncount = 0\r\n\r\nfor val in arr:\r\n seen.add(val)\r\n\r\nfor val in seen:\r\n if (val != 0):\r\n count += 1\r\n\r\nprint(count)", "n=int(input())\r\na=set(map(int,input().split()))\r\na-={0}\r\nprint(len(a))\r\n", "po1=int(input())\ncd2=list(map(int,input().split()))\nwhile(0 in cd2):\n cd2.remove(0)\ncd2=set(cd2)\nprint(len(cd2))\n# cd2=set(cd2)\n# print(len(cd2))\n\t\t\t\t \t \t \t \t \t\t \t\t\t\t \t\t\t \t", "n=int(input())\r\nl=list(map(int,input().split()))\r\nc=l.count(0)\r\nfor i in range(c):\t\r\n\tif 0 in l:\r\n\t\tl.remove(0)\r\ns=set(l)\r\nprint(len(s))", "yh=int(input())\r\nbhuu=list(map(int,input().split()))\r\nwhile(0 in bhuu):\r\n bhuu.remove(0)\r\nbhuu=set(bhuu)\r\nprint(len(bhuu))", "n=int(input())\r\narr=[int(item) for item in input().split()]\r\nd=dict()\r\nfor i in arr:\r\n d[i]=0\r\ncount=0 \r\nfor i in arr:\r\n if(i!=0 and d[i]==0):\r\n count=count+1\r\n d[i]=1\r\nprint(count) \r\n ", "try:\n n = int(input())\n x = set(map(int,input().split()))\n x.remove(0)\n print(len(x))\nexcept KeyError:\n print(len(x))\n\t\t \t\t \t \t \t\t \t \t\t\t", "n = int(input())\narr = list(map(int, input().split()))\n\nscores = set(arr)\n\nif 0 in scores:\n\tprint(len(scores) - 1)\nelse:\n\tprint(len(scores))\n", "\r\nn = int(input())\r\n\r\nst = set()\r\n\r\na = list(map(int,input().split()))\r\n\r\nfor i in a:\r\n\tif i != 0:\r\n\t\tst.add(i)\r\n\r\nprint(len(st))", "w = int(input())\nscores = input().split()\nnum_awarded = len(set(scores)) - (1 if '0' in scores else 0)\nprint(num_awarded)\n\n\t \t \t \t \t\t\t \t\t \t\t\t \t\t\t \t\t", "n = int(input())\narr = list(map(int,input().split()))\narr = [p for p in arr if p!=0]\n\nprint(len(set(arr)))\n\t \t\t \t\t \t \t \t\t \t \t\t \t", "n = int(input())\nsa = input().split()\naset = set()\nfor s in sa:\n #print(s)\n a = int(s)\n if (a != 0):\n aset.add(a)\nprint(len(aset))", "n = int(input())\r\nli = [int(i) for i in input().split()]\r\nd = dict()\r\nfor i in li:\r\n if i not in d and i != 0:\r\n d[i] = 1\r\nprint(len(d))" ]

[ "n, m = map(int, input().split())\r\ninp = [input() for _ in range(n)]\r\n\r\nfor i in range(n):\r\n for j in range(m):\r\n if inp[i][j] == '-':\r\n print('-', end='')\r\n else:\r\n print('B' if (i+j)%2==0 else 'W', end='')\r\n print('')", "n, m = map(int, input().split())\r\nboard = []\r\nfor i in range(n):\r\n board.append(input())\r\nfor i in range(n):\r\n ans = []\r\n for j in range(m):\r\n if board[i][j] == \"-\":\r\n ans.append(\"-\")\r\n elif i % 2 == 0 and j % 2 == 0:\r\n ans.append(\"B\")\r\n elif i % 2 == 0:\r\n ans.append(\"W\")\r\n elif j % 2 == 0:\r\n ans.append(\"W\")\r\n else:\r\n ans.append(\"B\")\r\n print(\"\".join(ans))", "n, m = map(int, input().split())\r\ns = [[0]*m for _ in range(n)]\r\n\r\nfor i in range(n):\r\n s[i] = list(input())\r\nfor i in range(n):\r\n for j in range(m):\r\n if s[i][j] == \"-\":\r\n print(\"-\", end='')\r\n else:\r\n if ((j % 2) + (i % 2)) % 2 == 0:\r\n print(\"B\", end='')\r\n else:\r\n print(\"W\", end='')\r\n\r\n\r\n print(\"\\n\", end='')", "def spliter():\r\n d = input()\r\n a = d.split()\r\n r = []\r\n for i in a:\r\n k = int(i)\r\n r.append(k)\r\n return r\r\n\r\n\r\nn = spliter()\r\nlst = []\r\nfinal = []\r\nfor i in range(n[0]):\r\n lst.append([])\r\n k = input()\r\n for j in range(n[1]):\r\n lst[i].append(k[j])\r\nfor i in range(n[0]):\r\n final.append([])\r\n for j in range(n[1]):\r\n if lst[i][j]=='-':\r\n final[i].append('-')\r\n print(final[i][j],end=\"\")\r\n else:\r\n if (i+j)%2==0:\r\n final[i].append('B')\r\n print(final[i][j],end=\"\")\r\n else:\r\n final[i].append('W')\r\n print(final[i][j],end=\"\")\r\n print()\r\n", "n_m = input().split()\ncells_array = []\nA=['B','W']\nfor i in range(int(n_m[0])):\n cells = input()\n cells_list = list(cells)\n cells_array.append(cells_list)\n\nfor j in range(len(cells_array)):\n for k in range(int(n_m[1])):\n if cells_array[j][k] == '.':\n cells_array[j][k]=A[(j+k)%2]\n\nfor i in range(int(n_m[0])):\n print (''.join(cells_array[i]))\n", "n, m = map(int, input().split())\r\n_list = [list(input()) for i in range(n)]\r\nfor i in range(n):\r\n for j in range(m):\r\n if _list[i][j] == \".\":\r\n if (i + j) % 2 == 0:\r\n _list[i][j] = \"W\"\r\n else:\r\n _list[i][j] = \"B\"\r\nfor i in _list:\r\n print(\"\".join(i))", "#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 f=0\r\n for i in range(n):\r\n for j in range(m):\r\n if(l[i][j]=='.'):\r\n if((i+j)%2==0):\r\n l[i][j]='W'\r\n else:\r\n l[i][j]='B'\r\n for i in range(n-1):\r\n str1=''\r\n #print(l[i])\r\n k=str1.join(l[i]) \r\n print(k) \r\n str1=''\r\n k=str1.join(l[n-1]) \r\n return k\r\nl=[]\r\nn,m=map(int,input().split())\r\nfor i in range(n):\r\n a=list(input())\r\n l.append(a)\r\nprint(exe())", "from math import gcd\r\nn,m=map(int,input().split())\r\nl=[]\r\nfor _ in range(n):\r\n l.append(list(input()))\r\n# print(l)\r\nfor i in range(n):\r\n if i%2==0:\r\n for j in range(m):\r\n if l[i][j]=='.':\r\n if j%2==0:\r\n l[i][j]='B'\r\n else:\r\n l[i][j]='W'\r\n else:\r\n pass\r\n else:\r\n for j in range(m):\r\n if l[i][j]=='.':\r\n if j%2==0:\r\n l[i][j]='W'\r\n else:\r\n l[i][j]='B'\r\n else:\r\n pass\r\nfor k in range(n):\r\n print(''.join(l[k]))\r\n", "n,m = list(map(int,input().split(\" \")))\nls=[]\nfor i in range(n):\n ls.append(list(input()))\nfor i in range(n):\n for j in range(m):\n if ls[i][j]=='.':\n if (i+j)%2==0:\n print(\"B\",end=\"\")\n else:\n print(\"W\",end=\"\")\n else:\n print(\"-\",end=\"\")\n print()\n\n", "n, m = map(int, input().split())\r\nfor i in range(n):\r\n s = list(input())\r\n for j in range(m):\r\n if (s[j] == '.'):\r\n s[j] = 'B' if ((i + j) % 2 == 0) else 'W'\r\n print(''.join(s))", "# Read in the dimensions of the chessboard\nn, m = map(int, input().split())\n\n# Read in the chessboard as a list of strings\nboard = [input() for _ in range(n)]\n\n# Iterate over each cell in the chessboard and assign a chessman to it\nfor i in range(n):\n for j in range(m):\n # If the cell is good\n if board[i][j] == \".\":\n # Assign a black or white chessman based on the position of the cell\n if (i+j) % 2 == 0:\n board[i] = board[i][:j] + \"B\" + board[i][j+1:]\n else:\n board[i] = board[i][:j] + \"W\" + board[i][j+1:]\n\n# Output \nfor row in board:\n print(row)\n\n \t \t \t \t \t \t\t\t \t \t \t \t", "from collections import deque\r\nr, c = list(map(lambda x: int(x), input().split()))\r\n\r\ndr = [(-1, 0), (0, -1), (1, 0), (0, 1)]\r\n\r\nboard = []\r\nfor i in range(r):\r\n\tt = input()\r\n\tboard.append(list(map(lambda x:x, t)))\r\n\r\nfor i in range(r):\r\n\tfor j in range(c):\r\n\t\tif board[i][j] == '.':\r\n\t\t\tq = deque()\r\n\t\t\tq.append((i, j))\r\n\t\t\tboard[i][j] = 'B'\r\n\t\t\twhile(len(q)):\r\n\t\t\t\trow, col = q.popleft()\r\n\t\t\t\tif board[row][col] == 'B':\r\n\t\t\t\t\tch = 'W'\r\n\t\t\t\telse:\r\n\t\t\t\t\tch = 'B'\r\n\t\t\t\tfor d in range(4):\r\n\t\t\t\t\tcurrR, currC = row + dr[d][0], col + dr[d][1]\r\n\t\t\t\t\tif currR >= 0 and currR < r and currC >= 0 and currC < c and board[currR][currC] == '.':\r\n\t\t\t\t\t\tboard[currR][currC] = ch\r\n\t\t\t\t\t\tq.append((currR, currC))\r\n\r\nfor i in range(r):\r\n\tfor j in range(c):\r\n\t\tprint(board[i][j], end = \"\")\r\n\tprint()", "s = list(map(int, input().split()))\r\nw = \"\"\r\nfor i in range(s[0]):\r\n l = \"\"\r\n b = input()\r\n v= i%2\r\n for j in range(s[1]):\r\n if b[j] == \"-\":\r\n l += \"-\"\r\n elif v:\r\n l += \"W\"\r\n elif not v:\r\n l += \"B\"\r\n v= not v\r\n print(l)", "n, m = input().split()\r\nboard = []\r\nfor i in range(int(n)):\r\n s = list(input())\r\n board.append(s)\r\ncolor = ['B', 'W']\r\nk = 0\r\nfor y in range(int(n)):\r\n for x in range(int(m)):\r\n if board[y][x] == '.':\r\n board[y][x] = color[k]\r\n k = 1 - k\r\n if int(m) % 2 == 0:\r\n k = 1 - k\r\nfor i in board:\r\n print(*i, sep='')", "n,m=map(int,input().split())\r\narr=[]\r\nfor i in range(n):\r\n s=input()\r\n arr.append([str(z) for z in s])\r\nc=0\r\nfor i in range(n):\r\n for j in range(m):\r\n if arr[i][j]==\".\":\r\n if i%2==1 and j%2==1:\r\n arr[i][j] = \"B\"\r\n elif i % 2 == 1 and j % 2 == 0:\r\n arr[i][j] = \"W\"\r\n elif i % 2 == 0 and j % 2 == 0:\r\n arr[i][j] = \"B\"\r\n elif i % 2 == 0 and j % 2 == 1:\r\n arr[i][j] = \"W\"\r\n\r\nfor i in range(n):\r\n for j in range(m):\r\n print(arr[i][j],end=\"\")\r\n print()\r\n\r\n\r\n\r\n\r\n", "a=[int(x) for x in input().split()]\r\nn=a[0]\r\nm=a[1]\r\nfor i in range(n):\r\n o=[]\r\n b=input()\r\n if i%2==0:\r\n for j in range(len(b)):\r\n if j%2==1:\r\n o.append(\"B\")\r\n else:\r\n o.append(\"W\")\r\n for p in range(len(b)):\r\n if p!=len(b)-1:\r\n if b[p]=='.':\r\n print(o[p],end=\"\")\r\n else:\r\n print(\"-\",end='')\r\n else:\r\n if b[p]=='.':\r\n print(o[p])\r\n else:\r\n print(\"-\") \r\n else:\r\n for j in range(len(b)):\r\n if j%2==1:\r\n o.append(\"W\")\r\n else:\r\n o.append(\"B\")\r\n for p in range(len(b)):\r\n if p!=len(b)-1:\r\n if b[p]=='.':\r\n print(o[p],end=\"\")\r\n else:\r\n print(\"-\",end='')\r\n else:\r\n if b[p]=='.':\r\n print(o[p])\r\n else:\r\n print(\"-\") ", "inp=lambda:map(int,input().split())\nn, m = inp()\n\nfor i in range(n):\n s = input()\n l=[]\n for j in range(len(s)):\n if s[j]=='-':\n l.append('-')\n continue\n if (i%2==0 and j%2==0) or (i%2!=0 and j%2!=0):\n l.append('B')\n if (i%2!=0 and j%2==0) or (i%2==0 and j%2!=0):\n l.append('W')\n \n print(\"\".join(l))\n\t \t \t \t\t\t \t \t \t \t\t\t \t\t\t", "a=list(map(int,input().split()))\r\nn,m=a\r\nchess=[[None for z in range(m)] for _ in range(n)]\r\n\r\n# for _ in range(n):\r\n# chess.append(sq)\r\nfor i in range(n):\r\n for j in range(m):\r\n # print(chess)\r\n if i%2==0:\r\n if j%2==0:\r\n chess[i][j]='B'\r\n else:\r\n chess[i][j]='W'\r\n else:\r\n if j%2==0:\r\n chess[i][j]='W'\r\n else:\r\n chess[i][j]='B'\r\nloc=[]\r\nfor i in range(n):\r\n a=input()\r\n a=list(a) \r\n for j in range(m):\r\n if a[j]=='-':\r\n loc.append((i,j))\r\nfor i,j in loc:\r\n chess[i][j]='-'\r\nfor i in chess:\r\n for j in i:\r\n print(j,end='')\r\n print()\r\n# print(chess)\r\n", "from sys import stdin as f\nfrom copy import copy\n\nn, m = map(int, next(f).split())\n\nfield = []\nfor i in range(n):\n field.append(list(next(f).strip()))\n\nl1 = []\nc = 'W'\nfor i in range(m):\n l1.append(c)\n c = 'B' if c == 'W' else 'W'\n\nl2 = []\nc = 'B'\nfor i in range(m):\n l2.append(c)\n c = 'B' if c == 'W' else 'W'\n\nnew_field = []\nfor i in range(n):\n if i % 2 == 0:\n new_field.append(copy(l1))\n else:\n new_field.append(copy(l2))\n\nfor i in range(n):\n for j in range(m):\n if field[i][j] == '-':\n new_field[i][j] = '-'\n\nfor line in new_field:\n print(''.join(line))\n", "a,b = map(int,input().split())\r\nfor i in range(a):\r\n string = input()\r\n for j in range(len(string)):\r\n if string[j]!='-':\r\n if i%2==0 and j%2==0:\r\n print('W', end=\"\")\r\n if i%2==0 and j%2!=0:\r\n print('B', end=\"\")\r\n if i%2!=0 and j%2==0:\r\n print('B', end=\"\")\r\n if i%2!=0 and j%2!=0:\r\n print('W', end=\"\")\r\n else:\r\n print('-', end=\"\")\r\n print()", "data = input().split()\nlines = int(data[0])\ncharacters = int(data[1])\nchess = []\nfor line in range(lines):\n chess.append(list(input()))\n\nfor line in range(lines):\n for cha in range(characters):\n if chess[line][cha] == '.':\n if (line+cha) % 2 == 0:\n chess[line][cha] = \"W\"\n else:\n chess[line][cha] = \"B\"\n\nfor line in range(lines):\n print()\n for cha in range(characters):\n print(chess[line][cha], end=\"\")\n\n\t\t\t\t\t \t\t\t\t\t \t \t\t\t \t\t \t\t\t \t", "n,m=map(int,input().split())\r\nl=[]\r\nfor i in range(n):\r\n s=input()\r\n l.append(s)\r\nans=[]\r\nfor i in range(n):\r\n tba=\"\"\r\n if i&1:\r\n for j in range(m):\r\n if l[i][j]==\".\":\r\n if j&1:\r\n tba+=\"B\"\r\n else:\r\n tba+=\"W\"\r\n else:\r\n tba+=\"-\"\r\n else:\r\n for j in range(m):\r\n if l[i][j]==\".\":\r\n if j&1:\r\n tba+=\"W\"\r\n else:\r\n tba+=\"B\"\r\n else:\r\n tba+=\"-\"\r\n ans.append(tba)\r\nfor i in ans:\r\n print(i)", "n, m = map(int, input().split())\r\narr = []\r\nfor i in range(n):\r\n s = input()\r\n arr.append(list(s))\r\nans=[]\r\nfor i in range(n):\r\n ans2=[\"\"]*m\r\n for j in range(m):\r\n if arr[i][j]==\"-\":\r\n ans2[j]=\"-\"\r\n else:\r\n if (i+j)&1:\r\n ans2[j]=\"B\"\r\n else:\r\n ans2[j]=\"W\"\r\n # print(\"i:{} and j:{}, an:{} ans:{}\".format(i,j,ans2[-1],ans2))\r\n \r\n ans.append(ans2)\r\n# print(ans)\r\n\r\nfor i in range(n):\r\n for j in range(m):\r\n print(ans[i][j],end=\"\")\r\n print()", "n,m = map(int,input().split())\r\nmat = []\r\nfor i in range(n):\r\n mat.append(list(input()))\r\nfor i in range(n):\r\n j = 0\r\n while j<m:\r\n if ((i+j)%2 == 0) and mat[i][j] == '.':\r\n mat[i][j] = 'B'\r\n else:\r\n if mat[i][j] == '.':\r\n mat[i][j] = 'W'\r\n j += 1\r\n\r\nfor i in range(n):\r\n print(''.join(mat[i]))", "def find(arr):\r\n temp=[]\r\n c='B'\r\n for i in range(m):\r\n temp.append(c)\r\n if(c=='B'):\r\n c='W'\r\n else:\r\n c='B'\r\n res=[]\r\n res.append(temp)\r\n t=[]\r\n for _ in range(n-1):\r\n t=[]\r\n for i in range(m):\r\n \r\n if(temp[i]=='W'):\r\n t.append('B')\r\n else:\r\n t.append('W')\r\n temp=t\r\n res.append(t)\r\n for i in range(n):\r\n for j in range(m):\r\n if(arr[i][j]=='.'):\r\n arr[i][j]=res[i][j]\r\n for i in range(n):\r\n for j in range(m):\r\n print(arr[i][j],end='')\r\n print()\r\n\r\nn,m=map(int,input().split())\r\narr=[]\r\nfor i in range(n):\r\n t=str(input())\r\n t=[c for c in t]\r\n arr.append(t)\r\nfind(arr)", "n,m=map(int,input().split())\r\nlist1=[]\r\nfor i in range(n):\r\n list2=[x for i in input().split() for x in i]\r\n list1.append(list2)\r\n\r\nfor i in range(n):\r\n for j in range(m):\r\n \r\n if list1[i][j]==\".\":\r\n if(i+j)&1:\r\n list1[i][j]=\"B\"\r\n else:\r\n list1[i][j]=\"W\"\r\nfor i in range(n):\r\n for j in range(m):\r\n print(list1[i][j],end=\"\")\r\n print()\r\n \r\n \r\n", "row, column = map(int, input().split())\r\n \r\nl = []\r\nchess = ['A', 'B']\r\n \r\nfor i in range(row):\r\n l.append(list(input()))\r\n \r\nfor i in range(row):\r\n for j in range(column):\r\n if l[i][j] == '.':\r\n \r\n if i % 2 == 0:\r\n if j % 2 == 0: l[i][j] = 'B'\r\n else: l[i][j] = 'W'\r\n else:\r\n if j % 2 == 0: l[i][j] = 'W'\r\n else: l[i][j] = 'B'\r\n \r\n if j != column - 1: \r\n print(l[i][j], end='')\r\n else: \r\n print(l[i][j])", "num, pla = map(int, input().split())\r\nfor i in range(num):\r\n x = input()\r\n for n, k in enumerate(x):\r\n if k == \"-\":\r\n print(\"-\", end=\"\")\r\n else:\r\n if (n+i) % 2 == 0:\r\n print(\"W\", end=\"\")\r\n else:\r\n print(\"B\", end=\"\")\r\n print()", "def main():\n n, m = list(map(int, input().split(' ')))\n template = []\n\n for _ in range(n):\n template.append(input())\n\n for i in range(n):\n line = []\n is_black = (i+1) % 2 > 0\n for j in range(m):\n char = 'B' if is_black else 'W'\n line.append(char if template[i][j] != '-' else '-')\n is_black = not is_black\n print(''.join(line))\n\n\nif __name__ == \"__main__\":\n main()\n", "n,m=map(int,input().split())\r\nl=[]\r\nfor i in range(n):\r\n s=input()\r\n l.append(list(s))\r\n\r\nfor i in range(n):\r\n \r\n for j in range(m):\r\n\r\n if (i%2==0 and j%2==0) or (i%2==1 and j%2==1):\r\n if l[i][j]=='.':\r\n l[i][j]='B'\r\n else:\r\n if l[i][j]=='.':\r\n l[i][j]='W'\r\n \r\n \r\n \r\n \r\n \r\nfor i in range(n):\r\n s=\"\".join(l[i])\r\n print(s)", "a, _ = [int(i) for i in input().split()]\r\nfor j in range(a):\r\n x = input()\r\n s = \"\"\r\n for i in range(len(x)):\r\n if x[i] == \".\":\r\n if (i + j) % 2 == 0:\r\n s += \"B\"\r\n else:\r\n s += \"W\"\r\n else:\r\n s += \"-\"\r\n print(s)", "n , m = (int(x) for x in input().split())\r\nl = []\r\nfor i in range(0,n):\r\n l.append(input())\r\nfor i in range(0,n):\r\n for j in range(0,m):\r\n if l[i][j] == \".\":\r\n if (i+j)%2 == 0: l[i] = l[i][0:j] + \"B\" + l[i][j+1:]\r\n else: l[i] = l[i][0:j] + \"W\" + l[i][j+1:]\r\nfor x in l:\r\n print(x)\r\n \r\n ", "n,m = map(int,input().split())\r\n\r\nt = []\r\nfor i in range(n):\r\n a = list(input())\r\n t.append(a)\r\n\r\nfor i in range(n):\r\n for j in range(m):\r\n if t[i][j] == '.':\r\n if i % 2 == 0:\r\n if j % 2 == 0:\r\n t[i][j] = 'B'\r\n else:\r\n t[i][j] = 'W'\r\n else:\r\n if j % 2 == 0:\r\n t[i][j] = 'W'\r\n else:\r\n t[i][j] = 'B'\r\n\r\nfor i in t:\r\n print(''.join(i))", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Thu Jun 1 18:09:14 2023\r\n\r\n@author: MARIA\r\n\"\"\"\r\n\r\n# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Thu Jun 1 15:29:44 2023\r\n\r\n@author: MARIA\r\n\"\"\"\r\n\r\n#DZY Loves Chessboard\r\n\r\nn1,m1=input().split()\r\nn = int(n1)\r\nm=int(m1)\r\n\r\ns=0\r\nchessboard=[]\r\nfor _ in range(n):\r\n cadena=input()\r\n fila=[]\r\n for l in range(m):\r\n fila.append(cadena[l])\r\n chessboard.append(fila)\r\n\r\n\r\n\r\nfor i in range(n):\r\n fila=chessboard[i]\r\n for j in range(0,m,1):\r\n if fila[j]!='-':\r\n if i%2==0:\r\n if j%2==0:\r\n \r\n fila[j]='W'\r\n else:\r\n fila[j]='B'\r\n else:\r\n if j%2==0:\r\n fila[j]='B'\r\n else:\r\n fila[j]='W'\r\n \r\n print(\"\".join(fila))\r\n chessboard[i]=\"\".join(fila)\r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n ", "def chess_board():\r\n n, m = map(int, input().split())\r\n for i in range(n):\r\n tmp = input()\r\n \r\n for j in range(len(tmp)):\r\n if tmp[j] == '.':\r\n if (i + j) % 2 == 0:\r\n print('B', end=(\"\"))\r\n \r\n else:\r\n print('W', end=(\"\"))\r\n \r\n else:\r\n print('-', end=(\"\"))\r\n \r\n \r\n print(\"\\n\")\r\n \r\n \r\nchess_board()", "# https://codeforces.com/problemset/problem/445/A\n\nfrom collections import deque\n\nn, m = input().split(\" \")\nn = int(n)\nm = int(m)\ndirections = [(0, 1), (1, 0), (-1, 0), (0, -1)]\nnext_char = {\n \"B\": \"W\",\n \"W\": \"B\"\n}\ngrid = []\n\nfor row in range(n):\n grid.append(list(input()))\n\ndef bfs(row, col):\n queue = deque()\n queue.append((row, col, \"B\"))\n visited = set()\n visited.add((row, col))\n\n while queue:\n size = len(queue)\n\n for _ in range(size):\n r, c, char = queue.popleft()\n\n grid[r][c] = char\n\n for d in directions:\n r2 = r + d[0]\n c2 = c + d[1]\n\n if 0 <= r2 < len(grid) and 0 <= c2 < len(grid[r2]) and (r2, c2) not in visited and grid[r2][c2] == \".\":\n queue.append((r2, c2, next_char[char]))\n visited.add((r2, c2))\n\nfor row in range(len(grid)):\n for col in range(len(grid[row])):\n if grid[row][col] == \".\":\n bfs(row, col)\n\nfor row in grid:\n print(\"\".join(row))", "n, m = map(int, input().split())\r\n \r\nfor i in range(n):\r\n l_b = input()\r\n for j in range(m):\r\n print(\"-\" if l_b[j] == \"-\" else (\"B\" if (i + j) % 2 == 0 else \"W\"), end = \"\")\r\n print()", "n, m = map(int, input().split())\n\nfor i in range(0, n):\n\n celula_correspondente = input()\n\n respostas = \"\"\n\n for j in range(0, m):\n\n if celula_correspondente[j] == '.':\n\n if (i + j) & 1 == 1:\n\n respostas = respostas + \"W\"\n\n else:\n\n respostas = respostas + \"B\"\n\n else:\n\n respostas = respostas + celula_correspondente[j]\n\n print(respostas)\n \t \t\t\t \t \t\t \t \t\t\t \t\t\t \t\t\t\t \t", "def place_chessmen(n, m, chessboard):\r\n # Define colors for chessmen\r\n colors = ['B', 'W']\r\n\r\n for i in range(n):\r\n for j in range(m):\r\n if chessboard[i][j] == '.':\r\n # Place chessman based on the pattern\r\n chessboard[i][j] = colors[(i + j) % 2]\r\n\r\n return chessboard\r\n\r\n# Read input\r\nn, m = map(int, input().split())\r\nchessboard = [list(input().strip()) for _ in range(n)]\r\n\r\n# Place chessmen\r\nchessboard = place_chessmen(n, m, chessboard)\r\n\r\n# Print the result\r\nfor row in chessboard:\r\n print(''.join(row))\r\n", "n, m = input().split()\nn, m = int(n), int(m)\n\ngoodOrBad = []\n\nfor i in range(n):\n goodOrBad.append(input())\n\noutput = \"\"\nlines = []\n\nfor i in range(n):\n line = \"\"\n for j in range(m):\n if goodOrBad[i][j] == '-':\n line += '-'\n elif goodOrBad[i][j] == '.' and (i+j) % 2 == 0:\n line += 'B'\n else:\n line += 'W'\n lines.append(line)\n\noutput = lines[0]\nif n > 1:\n for i in range(1,n):\n output += '\\n' + lines[i]\n\nprint(output)\n \t\t\t\t\t\t\t \t \t \t \t \t", "def result(n,m,lis):\n\tfor i in range(n):\n\t\tfor j in range(m):\n\t\t\ta=lis[i][j]\n\t\t\tif i%2==0:\n\t\t\t\tif j%2==0 and a==\".\":\n\t\t\t\t\tlis[i][j]=\"B\" \n\t\t\t\telif j%2!=0 and a==\".\":\n\t\t\t\t\tlis[i][j]=\"W\"\n\t\t\telse:\n\t\t\t\tif j%2==0 and a==\".\":\n\t\t\t\t\tlis[i][j]=\"W\" \n\t\t\t\telif j%2!=0 and a==\".\":\n\t\t\t\t\tlis[i][j]=\"B\"\n\tfor i in range(n):\n\t\ta=lis[i]\n\t\tprint(\"\".join(a))\t\t\t\t\n\t\t\t\t\t\t\t\n\t\t\t\t\t\n\t\t\t\t\t\t\t\n\t\t\t\t\n\n\n\n\n\n\n\n\nn,m=map(int,input().split())\nlis=[]\nfor i in range(n):\n\ta=list(input())\n\tlis.append(a) \nresult(n,m,lis)\n", "x,y = map(int, input().split())\r\nli = [0]*x\r\nfor i in range(x):\r\n\tli[i] = list(input())\r\nfor i in range(x):\r\n\tfor j in range(y):\r\n\t\tif li[i][j] == '.':\r\n\t\t\tif (i+j)%2:\r\n\t\t\t\tli[i][j] = 'B'\r\n\t\t\telse:\r\n\t\t\t\tli[i][j] = 'W'\r\nfor i in range(x):\r\n\tprint(''.join(li[i]))\r\n\r\n", "n, m = map(int, input().strip().split())\r\n\r\nfor _ in range(n):\r\n \r\n strs = input()\r\n new_strs = \"\"\r\n if _ % 2 == 0:\r\n for y in range(len(strs)):\r\n \r\n if strs[y] == \".\":\r\n if y % 2 == 0:\r\n new_strs += \"B\"\r\n else:\r\n new_strs += \"W\"\r\n \r\n else:\r\n new_strs += strs[y]\r\n print(new_strs)\r\n \r\n else:\r\n for y in range(len(strs)):\r\n \r\n if strs[y] == \".\":\r\n if y % 2 == 0:\r\n new_strs += \"W\"\r\n else:\r\n new_strs += \"B\"\r\n \r\n else:\r\n new_strs += strs[y]\r\n print(new_strs)\r\n ", "n,m=map(int,input().split())\r\nflag=0\r\nfor i in range(n):\r\n s=input()\r\n if i%2==0:\r\n flag = 0\r\n else:\r\n flag=1\r\n\r\n c=0\r\n for i in s:\r\n if i=='.' and flag==0:\r\n print(\"B\",end=\"\")\r\n flag=1\r\n elif i=='.' and flag==1:\r\n print(\"W\",end=\"\")\r\n flag=0\r\n elif i=='-':\r\n print(\"-\",end=\"\")\r\n if flag==0:\r\n flag=1\r\n else:\r\n flag=0\r\n if flag==0:\r\n pre=0\r\n else:\r\n pre=1\r\n print(\"\\n\",end=\"\")\r\n", "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 n, m = map(int, input().strip().split())\r\n \r\n result = [['' for _ in range(m)] for _ in range(n)]\r\n \r\n for i in range(n):\r\n input_str = input().strip()\r\n\r\n for j in range(m):\r\n if input_str[j] == '.':\r\n if (i+j)&1:\r\n result[i][j] = 'B'\r\n else:\r\n result[i][j] = 'W'\r\n else:\r\n result[i][j] = input_str[j]\r\n \r\n for i in range(n):\r\n print(f\"{''.join(str(x) for x in result[i])}\\n\")", "entrada = input()\r\nconfig = entrada.split(\" \")\r\nn = int(config[0])\r\nm = int(config[1])\r\n\r\nchessman = ['B','W']\r\n\r\nfor l in range(n):\r\n\tstring = input()\r\n\r\n\tfor c in range(m):\r\n\t\tpos = ((l+c)%2)\r\n\t\tif string[c] == '.':\r\n\t\t\tprint(chessman[pos], end=\"\")\r\n\t\telse:\r\n\t\t\tprint(\"-\", end=\"\")\r\n\tprint()\r\n", "n, m = map(int, input().split())\r\nnums = []\r\nresult = []\r\nfor i in range(n):\r\n nums.append(input())\r\n#print(nums)\r\n\r\nfor i in range(len(nums)):\r\n if i %2 == 0:\r\n start = 'B'\r\n else:\r\n start = 'W'\r\n #print('Start = ', start)\r\n string = nums[i]\r\n res = \"\"\r\n for x in string:\r\n if x == '.':\r\n res += start\r\n else:\r\n res += '-'\r\n \r\n if start == 'B':\r\n start = 'W'\r\n else:\r\n start = 'B'\r\n result.append(res)\r\nfor x in result:\r\n print(x)\r\n ", "#Kamila da Silva Albuquerque\r\n#118210525\r\nn,m=input().split()\r\nn,m=[int(n),int(m)]\r\na=[]\r\nfor i in range(0,n):\r\n a.append(list(input()))\r\na=list(a)\r\nif m%2==0:\r\n for i in range(0,n):\r\n if i%2==0:\r\n c=0\r\n else:\r\n c=1\r\n for j in range(0,m):\r\n if a[i][j]=='.':\r\n if c%2==0:\r\n a[i][j]='B'\r\n else:\r\n a[i][j]='W'\r\n c+=1\r\nelse:\r\n c=0\r\n for i in range(0,n):\r\n for j in range(0,m):\r\n if a[i][j]=='.':\r\n if c%2==0:\r\n a[i][j]='B'\r\n else:\r\n a[i][j]='W'\r\n c+=1\r\nfor i in range(0,n):\r\n print(*a[i],sep='')", "r, c = map(int, input().split())\ng = []\n\nfor _ in range(r):\n g.append(list(input()))\n\nfor ri in range(r):\n for ci in range(c):\n if g[ri][ci] == \"-\":\n continue\n\n cm = 1\n if (ri + 1) % 2 == 0:\n cm *= -1\n\n if (ci + 1) % 2 == 0:\n cm *= -1\n\n g[ri][ci] = \"B\" if cm == 1 else \"W\"\n\n print(\"\".join(g[ri]))", "s=\"\"\r\nn,m=map(int,input().split())\r\nfor i in range(n):\r\n if i%2==0:\r\n s+=input()\r\n else:\r\n s+=input()[::-1]\r\ni=0\r\nwhile i<n*m:\r\n if s[i]==\".\":\r\n if i&1:\r\n s=s.replace(\".\",\"W\",1)\r\n else:\r\n s=s.replace(\".\",\"B\",1)\r\n i+=1\r\nx=0\r\nfor i in range(n):\r\n if i&1:\r\n print(s[x:x+m][::-1])\r\n else:\r\n print(s[x:x+m])\r\n x+=m\r\n", "n, m = map(int, input().split())\nfor i in range(n):\n x = input()\n out = \"\"\n for j in range(m):\n if x[j] == '.':\n if (i + j) & 1 == 1:\n out = out + \"W\"\n else:\n out = out + \"B\"\n else:\n out = out + x[j]\n print(out)", "x,y=map(int,input().split())\r\na=[]\r\nfor i in range(x):\r\n\ta.append(list(input()))\r\nfor i in range(x):\r\n\tfor j in range(y):\r\n\t\tif(a[i][j]=='.'):\r\n\t\t\tif(i+j)%2==0 :\r\n\t\t\t\ta[i][j]='B'\r\n\t\t\telse:\r\n\t\t\t\ta[i][j]='W'\r\nfor i in range(x):\r\n\ts=''\r\n\tfor j in range(y):\r\n\t\ts+=a[i][j]\r\n\tprint(s)", "n,m = map(int,input().split())\r\narr=[]\r\nfor i in range(n):\r\n arr.append(list(input()))\r\nfor i in range(n):\r\n for j in range(m):\r\n if (i+j)%2==0 and arr[i][j]==\".\":\r\n arr[i][j]=\"B\"\r\n elif (i+j)%2!=0 and arr[i][j]==\".\":\r\n arr[i][j]=\"W\"\r\n else:\r\n arr[i][j]=\"-\"\r\nfor i in arr:\r\n print(*i, sep='')\r\n", "I = lambda: map(int, input().split())\r\na,b =I()\r\nli = [0]*a\r\nfor i in range(a):\r\n\tli[i] = list(input())\r\nfor i in range(a):\r\n\tfor j in range(b):\r\n\t\tif li[i][j]=='.':\r\n\t\t\tli[i][j] = 'W' if (i+j)%2 else 'B'\r\nfor i in range(a):\r\n\tprint(\"\".join(li[i]))", "from collections import deque\n\nn, m = map(int, input().split())\n\ngrid = []\nfor i in range(n):\n grid.append([])\n for j, el in enumerate(input()):\n if el == \".\":\n grid[i].append(\"B\" if (i+j)&1 ^ 1 else \"W\")\n else:\n grid[i].append(el)\n\nfor line in grid:\n print(\"\".join(line)) \n\n\n\n\n ", "n, m = map(int, input().split())\r\ncells = []\r\nfor _ in range(n):\r\n cells.append(list(input()))\r\n\r\nfor i in range(n):\r\n for j in range(m):\r\n if cells[i][j] == '.':\r\n if (i + j) % 2 == 0:\r\n cells[i][j] = 'B'\r\n else:\r\n cells[i][j] = 'W'\r\n \r\nfor cell in cells:\r\n print(''.join(cell))", "n,m=map(int,input().split())\r\nM=[]\r\nfor i in range(n):\r\n\tM.append(list(input()))\r\n\r\nque=[]\r\ndire=[[0,1],[0,-1],[-1,0],[1,0]]\r\nfor i in range(n):\r\n\tfor j in range(m):\r\n\t\tif M[i][j]=='.':\r\n\t\t\tM[i][j]='W'\r\n\t\t\tque.append([i,j])\r\n\t\t\twhile que:\r\n\t\t\t\tq=que.pop(0)\r\n\t\t\t\tfor d in dire:\r\n\t\t\t\t\tx=q[0]+d[0]\r\n\t\t\t\t\ty=q[1]+d[1]\r\n\t\t\t\t\tif x>=0 and y>=0 and x<=n-1 and y<=m-1:\r\n\t\t\t\t\t\tif M[x][y]=='.':\r\n\t\t\t\t\t\t\tif M[q[0]][q[1]]=='B':\r\n\t\t\t\t\t\t\t\tM[x][y]='W'\r\n\t\t\t\t\t\t\telif M[q[0]][q[1]]=='W':\r\n\t\t\t\t\t\t\t\tM[x][y]='B'\r\n\t\t\t\t\t\t\tque.append([x,y])\r\n\r\nfor i in range(n):\r\n\tprint(''.join(M[i]))", "n,m = [int(x) for x in input().split()]\r\nl = []\r\nfor _ in range(n):\r\n a = input()\r\n l.append(list(a))\r\nk = \"W\"\r\nj = \"B\"\r\nfor x in l:\r\n for i in range(m):\r\n if i%2 == 0 and x[i] == \".\":\r\n x[i] = k\r\n elif i%2 == 1 and x[i] == \".\":\r\n x[i] = j\r\n k,j = j,k \r\nfor x in l:\r\n print(\"\".join(x))\r\n\r\n", "n,m=map(int,input().split())\r\nb=[]\r\nfor i in range(n):\r\n a=list(input())\r\n if(len(a)>m):\r\n raise ValueError\r\n b.append(a)\r\nc=[]\r\nfor i in range(n):\r\n d=[]\r\n for j in range(m):\r\n d.append(b[i][j])\r\n c.append(d)\r\n# print(b)\r\nfor i in range(n):\r\n for j in range(m):\r\n if((i+j)%2==0):\r\n c[i][j]=\"B\"\r\n else:\r\n c[i][j]=\"W\"\r\n# print(c)\r\nfor i in range(n):\r\n for j in range(m):\r\n if(b[i][j]==\"-\"):\r\n c[i][j]=\"-\"\r\nfor i in range(n):\r\n str=\"\"\r\n for ele in c[i]:\r\n str+=ele\r\n print(str)", "n, m = map(int, input().split())\r\n\r\na = []\r\nfor i in range(n):\r\n a.append(input())\r\n\r\nfield = []\r\n\r\nfor row in range(n):\r\n field.append([])\r\n \r\n if row % 2 == 0:\r\n cell = 'W'\r\n else:\r\n cell = 'B'\r\n \r\n for col in range(m):\r\n if cell == 'W':\r\n field[-1].append('B')\r\n cell = 'B'\r\n else:\r\n field[-1].append('W')\r\n cell = 'W'\r\n\r\nfor i in range(n):\r\n for j in range(m):\r\n if a[i][j] == '-':\r\n field[i][j] = '-'\r\n \r\nfor i in range(n):\r\n print(*field[i], sep=\"\")", "yLen, xLen = map(int, input().split())\r\nfor y in range(yLen):\r\n a = input()\r\n b = \"\"\r\n yeo = y%2\r\n for x in range(xLen):\r\n if(a[x] != '-'):\r\n xeo = x%2\r\n if(yeo == xeo):\r\n b += 'W'\r\n else:\r\n b += 'B'\r\n else:\r\n b += '-'\r\n print(b)\r\n\r\n", "while True:\r\n try:\r\n n, m = map(int, input().split())\r\n str = [['' for j in range(m + 1)] for i in range(n + 1)]\r\n for i in range(1, n + 1):\r\n str[i][1:] = input()\r\n\r\n for i in range(1, n + 1):\r\n for j in range(1, m + 1):\r\n if str[i][j] == '.':\r\n if (i+j) % 2 == 0:\r\n str[i][j] = 'B'\r\n else:\r\n str[i][j] = 'W'\r\n\r\n for i in range(1, n + 1):\r\n print(''.join(str[i][1:]))\r\n\r\n except:\r\n break", "class Solution:\r\n def dzy(self,cell):\r\n rows = len(cell)\r\n cols = len(cell[0])\r\n for i in range(rows):\r\n for j in range(cols):\r\n if cell[i][j] == '.':\r\n if (i + j) % 2 == 0:\r\n cell[i][j] = 'B'\r\n else:\r\n cell[i][j] = 'W'\r\n return cell\r\n\r\nif __name__ == '__main__':\r\n n, m = map(int, input().split()) # n rows, m columns\r\n cell = [['.' for _ in range(m)] for _ in range(n)]\r\n # cell[i][j] i is index of row, j is index of column\r\n for i in range(n):\r\n row = input()\r\n for j in range(m):\r\n if row[j] == '-':\r\n cell[i][j] = '-'\r\n sol = Solution()\r\n res = sol.dzy(cell)\r\n for i in range(len(res)):\r\n for j in range(len(res[0])):\r\n print(cell[i][j], end=\"\")\r\n print()", "def sol(row, col, board, new_board = \"\"):\r\n for i in range(row):\r\n for j in range(col):\r\n if board[i][j] == \"-\": new_board += \"-\"\r\n elif (i + j) % 2 == 0: new_board += \"B\"\r\n else: new_board += \"W\"\r\n new_board += \"\\n\"\r\n \r\n return new_board\r\n\r\n\r\nif __name__ == \"__main__\":\r\n row, col = map(int, input().split())\r\n board = [[x for x in input()] for _ in range(row)]\r\n board = sol(row, col, board)\r\n print (board)", "n, k = map(int, input().split())\r\nfor j in range(n):\r\n s = input()\r\n for t in range(k):\r\n if s[t] == \"-\":\r\n print(\"-\", end= \"\")\r\n else:\r\n if (j + t) % 2 == 0:\r\n print(\"W\", end = \"\")\r\n else:\r\n print(\"B\", end = \"\")\r\n print()\r\n \r\n", "def alternate_chessmen(n, m, board):\r\n result = [['-' for _ in range(m)] for _ in range(n)]\r\n chessmen = ['B', 'W']\r\n\r\n for i in range(n):\r\n for j in range(m):\r\n if board[i][j] == '.':\r\n # Place a chessman in the good cell\r\n result[i][j] = chessmen[(i + j) % 2]\r\n\r\n return result\r\n\r\n# Input\r\nn, m = map(int, input().split())\r\nboard = [input() for _ in range(n)]\r\n\r\n# Get the result\r\nresult = alternate_chessmen(n, m, board)\r\n\r\n# Output\r\nfor row in result:\r\n print(''.join(row))\r\n", "n, m = map(int, input().split())\r\n\r\narr = []\r\nfor i in range(n):\r\n line = list(input())\r\n arr.append(line)\r\n\r\nfor i in range(n):\r\n for j in range(m):\r\n if arr[i][j] == '.':\r\n if (i+j) % 2 == 0:\r\n arr[i][j] = 'B'\r\n else:\r\n arr[i][j] = 'W'\r\n\r\nfor i in range(n):\r\n for j in range(m):\r\n print(arr[i][j], end='')\r\n print(\"\")", "n,m=[int(x) for x in input(\"\").split()]\r\nl=[]\r\nfor i in range(0,n):\r\n ar=list(str(input(\"\")))\r\n if(i%2==0):\r\n for j in range(m):\r\n if(j%2==0 and ar[j]==\".\"):\r\n ar[j]=\"B\"\r\n elif(j%2!=0 and ar[j]==\".\"):\r\n ar[j]=\"W\"\r\n else:\r\n for j in range(m):\r\n if(j%2==0 and ar[j]==\".\"):\r\n ar[j]=\"W\"\r\n elif(j%2!=0 and ar[j]==\".\"):\r\n ar[j]=\"B\"\r\n \r\n l.append(ar) \r\n \r\nfor i in l:\r\n s=\"\"\r\n for x in i:\r\n s=s+x\r\n print(s)\r\n \r\n\r\n ", "n, m = map(int, input().split())\n\nxadrez = []\n\nfor i in range(n):\n xadrez.append(list(input()))\n \ncor = ['B', 'W']\n\nfor i in range(n):\n for j in range(m):\n if xadrez[i][j] == '.':\n xadrez[i][j] = cor[(i+j) & 1 == 1]\n \n\nfor i in range(n):\n print(''.join(xadrez[i]))\n\t \t \t\t\t \t \t\t \t\t\t\t\t \t\t\t \t\t", "n,m=map(int,input().split())\r\na=[]\r\nfor i in range(n):\r\n a.append(list(input()))\r\nfor i in range(n):\r\n for j in range(m):\r\n if(i&1):\r\n if(j%2==1 and a[i][j]!=\"-\"):\r\n a[i][j]=\"B\"\r\n elif(j%2==0 and a[i][j]!=\"-\"):\r\n a[i][j]=\"W\"\r\n else:\r\n if(j%2==1 and a[i][j]!=\"-\"):\r\n a[i][j]=\"W\"\r\n elif(j%2==0 and a[i][j]!=\"-\"):\r\n a[i][j]=\"B\"\r\nfor i in a:\r\n print(\"\".join(i))", "def solve():\r\n n, m = map(int, input().split())\r\n ans = []\r\n for _ in range(n):\r\n t = []\r\n for __ in range(m):\r\n t.append('')\r\n ans.append(t)\r\n\r\n for _ in range(n):\r\n s = input()\r\n ___ = 0\r\n for __ in s:\r\n if __ == '.':\r\n ans[_][___] = 'B' if ((_ + ___) % 2 == 0) else 'W'\r\n else:\r\n ans[_][___] = '-'\r\n ___ += 1\r\n\r\n for _ in range(n):\r\n for __ in range(m):\r\n print(ans[_][__], end='')\r\n print()\r\n\r\n\r\nsolve()\r\n", "while True:\r\n try:\r\n linhas, colunas = map(int, input().split())\r\n\r\n str = [['' for j in range(colunas)] for i in range(linhas)]\r\n for i in range(linhas):\r\n linha = input()\r\n for j in range(colunas):\r\n str[i][j] = linha[j]\r\n\r\n for i in range(linhas):\r\n for j in range(colunas):\r\n if str[i][j] == '.':\r\n if (i+j) % 2 == 0:\r\n str[i][j] = 'B'\r\n else:\r\n str[i][j] = 'W'\r\n\r\n for i in range(linhas):\r\n print(''.join(str[i]))\r\n\r\n except EOFError:\r\n break\r\n", "n, m = map(int, input().split())\r\ngrid = [list(input()) for _ in range(n)]\r\n\r\nfor r in range(n):\r\n current = 'B'\r\n\r\n if r % 2 == 0:\r\n current = 'W'\r\n\r\n for c in range(m):\r\n if grid[r][c] == '.':\r\n grid[r][c] = current\r\n current = 'W' if current == 'B' else 'B'\r\nfor row in grid:\r\n print(''.join(row))\r\n", "\"\"\"\r\nThe pattern is\r\nWBWBWBWB...\r\n\r\nBWBWBWBW...\r\n\r\nWBWBWBWB...\r\n\r\n...\r\n\"\"\"\r\nn,m=map(int,input().split())\r\nmat=[]\r\nfor i in range(n):\r\n mat.append(list(input()))\r\nans=''\r\nans2=''\r\nfor i in range(m):\r\n if i%2==0:\r\n ans+='W'\r\n ans2+='B'\r\n else:\r\n ans+='B'\r\n ans2+='W'\r\nans=list(ans)\r\nans2=list(ans2)\r\n#print(ans)\r\n#print(ans2)\r\nfor i in range(n):\r\n for j in range(m):\r\n if mat[i][j]=='.':\r\n if i%2==0:\r\n mat[i][j]=ans[j]\r\n else:mat[i][j]=ans2[j]\r\nfor i in range(n):\r\n l=mat[i]\r\n print(''.join(s for s in l))\r\n", "n,m=map(int,input().split())\r\nd='B'\r\nlst=[]\r\nfor i in range(n):\r\n s=list(input())\r\n for j in range(m):\r\n if s[j]=='.':\r\n if (i+j)%2==0:\r\n s[j]='W'\r\n else:\r\n s[j]='B'\r\n # else:\r\n # s[j]='-'\r\n lst.append(''.join(s))\r\nfor i in lst:\r\n print(i)", "n,m = map(int,input().split())\r\nboard = []\r\nfor i in range(n):\r\n board.append(input())\r\nif m % 2 == 0:\r\n new_board = ['BW'*(m//2) for i in range(n)]\r\n new_board = [new_board[i][::-1] if i%2==0 else new_board[i] for i in range(n)]\r\nelse:\r\n new_board = ['BW'*(m//2) for i in range(n)]\r\n new_board = [new_board[i]+'B' if i%2==0 else 'W' + new_board[i] for i in range(n)]\r\n\r\nfor i in range(n):\r\n for j in range(m):\r\n if board[i][j] == '-':\r\n new_board[i] = new_board[i][:j] + '-' + new_board[i][j+1:]\r\nfor i in new_board: print(i)", "def main():\r\n n, m = map(int, input().split())\r\n \r\n tabuleiro = []\r\n \r\n for i in range(n):\r\n tabuleiro.append(list(input()))\r\n \r\n linha = []\r\n revlinha = []\r\n \r\n w = True\r\n for i in range(m):\r\n if w:\r\n w = False\r\n linha.append('B')\r\n revlinha.append('W')\r\n else:\r\n w = True\r\n linha.append('W')\r\n revlinha.append('B')\r\n \r\n \r\n novoTabuleiro = []\r\n \r\n flag = True\r\n for i in range(n):\r\n if flag:\r\n row = []\r\n for j in range(m):\r\n if tabuleiro[i][j] != '-':\r\n row.append(linha[j])\r\n else:\r\n row.append('-')\r\n flag = False\r\n novoTabuleiro.append(row)\r\n else:\r\n row = []\r\n for j in range(m):\r\n if tabuleiro[i][j] != '-':\r\n row.append(revlinha[j])\r\n else:\r\n row.append('-')\r\n novoTabuleiro.append(row)\r\n flag = True\r\n \r\n \r\n \r\n for j in novoTabuleiro:\r\n print(''.join(j))\r\n \r\n \r\n \r\nmain()", "n,m=list(map(int,input().split(' ')))\r\n\r\nliste=[]\r\n\r\nfor _ in range(n):\r\n liste.append(input())\r\n\r\nchoice=['B','W']\r\nres=[]\r\nfor i in range(n):\r\n res.append( [choice[(i%2+j)%2] for j in range(m)] )\r\n\r\nfor i in range(n):\r\n for j in range(m):\r\n if liste[i][j]==\"-\":\r\n res[i][j]='-'\r\nfor i in range(n):\r\n res[i]= \"\".join(res[i])\r\nprint(\"\\n\".join(res))", "n,m=map(int,input().split())\r\np=['B','W']\r\nfor i in range(n):\r\n\ts=list(input())\r\n\tfor j in range(m):\r\n\t\tif s[j]=='.':\r\n\t\t\ts[j]=p[(i+j)%2]\r\n\tprint(''.join(s))", "#!/usr/bin/env python3\n\nimport random\n\n\n\nif __name__ == \"__main__\":\n\tn, m = map(int, input().split())\n\ta = [\"W\",\"B\"]\n\tfor i in range(n):\n\t\ts = input()\n\t\tnew_string = \"\"\n\t\tfor j in range(m):\n\t\t\tif s[j] == \"-\":\n\t\t\t\tnew_string += \"-\"\n\t\t\telif s[j] == \".\":\n\t\t\t\tnew_string += a[(i+j)%2]\n\t\tprint(new_string) \n", "from math import *\r\nfrom collections import *\r\nfrom sys import *\r\nt=stdin.readline\r\np=stdout.write\r\ndef GI(): return map(int, t().strip().split())\r\ndef GS(): return map(str, t().strip().split())\r\ndef IL(): return list(map(int, t().strip().split()))\r\ndef SL(): return list(map(str, t().strip().split()))\r\n\r\nn,m=GI()\r\nc=[SL() for _ in range(n)]\r\nx1=''.join(['BW' for _ in range(m)])\r\nx2=''.join(['WB' for _ in range(m)])\r\nfor i in range(n):\r\n for j in range(m):\r\n if i%2==0:\r\n if c[i][0][j]=='.': p(x1[j])\r\n else: p(c[i][0][j])\r\n else:\r\n if c[i][0][j]=='.': p(x2[j])\r\n else: p(c[i][0][j])\r\n p('\\n')", "def cria_arr(arr):\r\n new_arr = []\r\n for e in arr:\r\n new_arr.append(e)\r\n return new_arr\r\n\r\nm, n = [int(i) for i in input().split()]\r\n\r\nresult = []\r\nfor i in range(m):\r\n arr = [0] * n\r\n new_arr = cria_arr(arr)\r\n result.append(new_arr)\r\n\r\nfor i in range(m):\r\n new_arr = input()\r\n for j in range(n):\r\n if new_arr[j] == '.':\r\n if ((i+j) % 2 == 1):\r\n result[i][j] = 'W'\r\n else:\r\n result[i][j] = 'B'\r\n else:\r\n result[i][j] = '-'\r\n\r\n\r\nfor i in range(m):\r\n for j in range(n):\r\n print(result[i][j], end='')\r\n print()", "n, m = map(int, input().strip().split())\r\ngrid = []\r\ndirection = [[0, 1], [0, -1], [1, 0], [-1, 0]]\r\nfor i in range(n):\r\n x = input()\r\n for j in range(m):\r\n if x[j] == \".\":\r\n if (i + j) % 2 == 0:\r\n print(\"B\", end = \"\")\r\n else:\r\n print(\"W\", end = \"\")\r\n else:\r\n print(\"-\", end = \"\")\r\n print()", "n,m=map(int,input().split())\r\nnum=[]\r\nfor i in range(n):\r\n\tnum1=input()\r\n\tnum.append(num1)\r\nans=[]\r\nfor i in range(n):\r\n\tx=[]\r\n\tfor j in range(m):\r\n\t\tif(num[i][j]=='-'):\r\n\t\t\tx.append('-')\r\n\t\telse:\r\n\t\t\tif((i+j)%2==0):\r\n\t\t\t\tx.append('B')\r\n\t\t\telse:\r\n\t\t\t\tx.append('W')\r\n\tans.append(x)\r\nfor i in range(n):\r\n\tfor j in range(m):\r\n\t\tprint(ans[i][j],end='')\r\n\tprint()", "n,m = map(int, input().split())\r\nb = []\r\n\r\nfor _ in range(n):\r\n b.append(list(input()))\r\n\r\nfor i in range(n):\r\n for j in range(m):\r\n if b[i][j]==\".\":\r\n if (i%2==0) and (j%2==0):\r\n b[i][j] = \"W\"\r\n elif (i%2==1) and (j%2==0):\r\n b[i][j] = \"B\"\r\n elif (i%2==1) and (j%2==1):\r\n b[i][j] = \"W\"\r\n else:\r\n b[i][j] = \"B\"\r\n\r\nfor i in range(n):\r\n print(\"\".join(b[i]))\r\n ", "n, m = map(int, input().split())\nlst =[]\na = [\"B\", \"W\"]\nfor j in range(n):\n s = list(str(input()))\n for i in range(m):\n if s[i] == \".\":\n s[i] = a[(i+j)%2]\n lst.append(s)\nfor i in lst:\n print(\"\".join(i))\n\n\n\n", "linha, coluna = map(int, input().split())\r\n \r\nlista = []\r\n \r\nfor i in range(linha):\r\n lista.append(list(input()))\r\n \r\nfor i in range(linha):\r\n for j in range(coluna):\r\n if lista[i][j] == '.':\r\n if i % 2 == 0:\r\n if j % 2 == 0:\r\n lista[i][j] = 'B'\r\n else:\r\n lista[i][j] = 'W'\r\n else:\r\n if j % 2 == 0:\r\n lista[i][j] = 'W'\r\n else:\r\n lista[i][j] = 'B'\r\n if j != coluna - 1:\r\n print(lista[i][j], end = '')\r\n else:\r\n print(lista[i][j])", "n, m = map(int, input().split())\r\na = []\r\nfor _ in range(n):\r\n a.append(input().rstrip())\r\nfor i in range(n):\r\n b = []\r\n for j in range(m):\r\n if a[i][j] == '-':\r\n b.append('-')\r\n else:\r\n if (i + j) % 2 == 0:\r\n b.append('B')\r\n else:\r\n b.append('W')\r\n print(\"\".join(b))\r\n", "n, m = map(int, input().split())\nmatriz = [[''] * n for _ in range(m)]\nfor i in range(n):\n line = input()\n for j in range(m):\n matriz[j][i] = line[j]\n if matriz[j][i] == '.':\n if (j+i) % 2 == 0:\n matriz[j][i] = 'B'\n else:\n matriz[j][i] = 'W'\nfor i in range(n):\n print(''.join(matriz[j][i] for j in range(m)))\n\t \t \t\t\t \t \t \t\t\t \t \t", "n, m = map(int, input().split())\r\n\r\nlista = []\r\n\r\nresposta = []\r\n\r\nfor i in range(0, n):\r\n\r\n s = input()\r\n \r\n lista.append(s)\r\n\r\n ans = \"\"\r\n \r\n for j in range(0,m):\r\n\r\n if lista[i][j] == '.':\r\n\r\n if (j%2==0):\r\n if (i%2==0):\r\n ans = ans + \"B\"\r\n\r\n else:\r\n\r\n ans = ans + \"W\"\r\n\r\n else:\r\n if (i%2==0):\r\n ans = ans + \"W\"\r\n\r\n else:\r\n\r\n ans = ans + \"B\"\r\n \r\n else:\r\n ans = ans + \"-\"\r\n \r\n if j == len(s)-1:\r\n resposta.append(ans)\r\n \r\nfor k in range(0, len(resposta)):\r\n print(resposta[k])\r\n", "from sys import maxsize, stdout, stdin,stderr\r\nmod = int(1e9+7)\r\nimport sys\r\ndef I(): return int(stdin.readline())\r\ndef lint(): return [int(x) for x in stdin.readline().split()]\r\ndef S(): return list(map(str,input().strip()))\r\ndef grid(r, c): return [lint() for i in range(r)]\r\nfrom collections import defaultdict, Counter, deque\r\nimport math\r\nimport heapq\r\nfrom heapq import heappop , heappush\r\nimport bisect\r\nfrom itertools import groupby\r\nfrom itertools import permutations as comb\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\n\r\ndef nCr(n, r):\r\n \r\n return (fact(n) // (fact(r)\r\n * fact(n - r)))\r\n \r\n# Returns factorial of n\r\ndef fact(n):\r\n \r\n res = 1\r\n \r\n for i in range(2, n+1):\r\n res = res * i\r\n \r\n return res\r\ndef primefactors(n):\r\n num=0\r\n \r\n while n % 2 == 0:\r\n num+=1\r\n n = n / 2\r\n \r\n for i in range(3,int(math.sqrt(n))+1,2):\r\n \r\n \r\n while n % i== 0:\r\n num+=1\r\n n = n // i\r\n \r\n \r\n if n > 2:\r\n num+=1\r\n return num\r\n'''\r\ndef iter_ds(src):\r\n store=[src]\r\n while len(store):\r\n tmp=store.pop()\r\n if not vis[tmp]:\r\n vis[tmp]=True\r\n for j in ar[tmp]:\r\n store.append(j)\r\n'''\r\ndef ask(a):\r\n print('? {}'.format(a),flush=True)\r\n n=I()\r\n \r\n return n\r\n\r\n\r\n \r\ndef dfs(i,p,d):\r\n \r\n a,tmp=0,0\r\n for j in d[i]:\r\n if j!=p:\r\n a+=1\r\n tmp+=dfs(j,i)\r\n \r\n if a==0:\r\n return 0\r\n \r\n return tmp/a + 1 \r\ndef primeFactors(n):\r\n l=[]\r\n \r\n while n % 2 == 0:\r\n l.append(2)\r\n n = n // 2\r\n for i in range(3,int(math.sqrt(n))+1,2):\r\n \r\n \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 return l\r\nfrom math import inf\r\n\r\n\r\nclass SegmentTree:\r\n def __init__(self, data, default=0, func=math.gcd):\r\n \"\"\"initialize the segment tree with data\"\"\"\r\n self._default = default\r\n self._func = func\r\n self._len = len(data)\r\n self._size = _size = 1 << (self._len - 1).bit_length()\r\n \r\n self.data = [default] * (2 * _size)\r\n self.data[_size:_size + self._len] = data\r\n for i in reversed(range(_size)):\r\n self.data[i] = func(self.data[i + i], self.data[i + i + 1])\r\n \r\n def __delitem__(self, idx):\r\n self[idx] = self._default\r\n \r\n def __getitem__(self, idx):\r\n return self.data[idx + self._size]\r\n \r\n def __setitem__(self, idx, value):\r\n idx += self._size\r\n self.data[idx] = value\r\n idx >>= 1\r\n while idx:\r\n self.data[idx] = self._func(self.data[2 * idx], self.data[2 * idx + 1])\r\n idx >>= 1\r\n \r\n def __len__(self):\r\n return self._len\r\n \r\n def query(self, start, stop):\r\n \"\"\"func of data[start, stop)\"\"\"\r\n start += self._size\r\n stop += self._size\r\n \r\n res_left = res_right = self._default\r\n while start < stop:\r\n if start & 1:\r\n res_left = self._func(res_left, self.data[start])\r\n start += 1\r\n if stop & 1:\r\n stop -= 1\r\n res_right = self._func(self.data[stop], res_right)\r\n start >>= 1\r\n stop >>= 1\r\n \r\n return self._func(res_left, res_right)\r\n \r\n def __repr__(self):\r\n return \"SegmentTree({0})\".format(self.data)\r\nt = 1\r\nfor _ in range(t):\r\n n,m = lint()\r\n s = [S() for i in range(n)]\r\n tmp=['B','W']*((m+1)//2+1)\r\n l=[['-']*m for i in range(n)]\r\n for i in range(n):\r\n for j in range(m):\r\n if s[i][j]=='.':\r\n l[i][j]=tmp[i%2+j]\r\n for i in range(n):\r\n tmp=l[i]\r\n print(\"\".join(tmp))\r\n\r\n ", "\r\nn,m=map(int,input().split())\r\nx=[]\r\nfor i in range(0,n):\r\n x.append(list(input()))\r\n\r\nfor i in range(0,n):\r\n for j in range(0,m):\r\n if x[i][j]=='.':\r\n if i%2==0 and j%2==0:\r\n x[i][j]='B'\r\n if i%2!=0 and j%2!=0:\r\n x[i][j]='B'\r\n if i%2!=0 and j%2==0:\r\n x[i][j]='W'\r\n if i%2==0 and j%2!=0:\r\n x[i][j]='W' \r\n \r\nfor i in range(0,n):\r\n s=''\r\n for j in range(m):\r\n s=s+x[i][j]\r\n print(s)\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "\r\n#from math import ceil, sqrt\r\n\r\n#import io, os, sys\r\n#input = io.BytesIO(os.read(0,os.fstat(0).st_size)).readline #input().decode().rstrip('\\r\\n')\r\n#print = lambda x: sys.stdout.write(str(x) + \"\\n\")\r\n \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, m = MII()\r\n\r\nc = {0: 'B', 1: 'W'}\r\nfor i in range(n):\r\n s = input()\r\n out = ''\r\n for j in range(m):\r\n if s[j] == '.':\r\n out += c[(j+i)%2]\r\n else:\r\n out += '-'\r\n print(out)\r\n \r\n \r\n \r\n \r\n ", "def solve():\r\n n,m = list(map(int,input().split()))\r\n a = []\r\n for i in range(n):\r\n a.append(list(input()))\r\n for i in range(n):\r\n for j in range(m):\r\n if a[i][j] == '.':\r\n a[i][j] = 'W' if (i+j)%2 else 'B'\r\n for i in a:\r\n print(''.join(i))\r\nsolve()", "def main() :\r\n n,m = map(int,input().split())\r\n array = list()\r\n for i in range(n) :\r\n string = input()\r\n array.append(list(string))\r\n for i in range(n) :\r\n for j in range(m) :\r\n if array[i][j] == '.' :\r\n if (i+j) % 2 == 0 :\r\n array[i][j] = 'B'\r\n else :\r\n array[i][j] = 'W'\r\n for e in array :\r\n print(\"\".join(map(str,e))) \r\n \r\n \r\nmain()", "n, m = map(int, input().split())\r\nboard = []\r\nfor _ in range(n):\r\n board.append(input())\r\n\r\n\r\nchessboard = [['-' for _ in range(m)] for _ in range(n)]\r\n\r\n\r\ncolors = ['W', 'B']\r\n\r\n\r\nfor i in range(n):\r\n for j in range(m):\r\n \r\n if board[i][j] == '-':\r\n continue\r\n \r\n \r\n chessman_color = colors[(i + j) % 2]\r\n \r\n \r\n chessboard[i][j] = chessman_color\r\n\r\n\r\nfor row in chessboard:\r\n print(\"\".join(row))\r\n", "n,m=list(map(int,input().split()))\nfor i in range(n):\n myString=list(input())\n for j in range(m):\n if myString[j]==\".\":\n if ((i+j)%2==0):\n myString[j]=\"B\"\n else:\n myString[j]=\"W\"\n print(\"\".join(myString))\n \t \t \t \t \t\t\t\t\t \t \t\t\t \t \t", "n, m = map(int, input().split())\na = []\nfor _ in range(n):\n a.append(input().rstrip())\nfor i in range(n):\n k = []\n for j in range(m):\n if a[i][j] == '-':\n k.append('-')\n else:\n if (i + j) % 2 == 0:\n k.append('B')\n else:\n k.append('W')\n for i in range(m):\n print(k[i], end='')\n print()", "n,m = [int(x) for x in input().split()]\r\nchessboard = []\r\nfor _ in range(n):\r\n chessboard.append(input())\r\n\r\n\r\nfor i in range(n):\r\n chessman = [\"B\",\"W\"][i%2]\r\n row = \"\"\r\n for j in range(m):\r\n if chessboard[i][j] == \"-\":\r\n row +=\"-\"\r\n else:\r\n row += chessman\r\n chessman = [\"B\",\"W\"][chessman==\"B\"]\r\n print(row)", "import sys,os,io,time,copy,math\r\nfrom functools import lru_cache\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\ndef main(): \r\n n,m=map(int,input().split())\r\n arr=[]\r\n for _ in range(n):\r\n string=input()\r\n a=[]\r\n for s in string:\r\n a.append(s)\r\n arr.append(a)\r\n for i in range(n):\r\n for j in range(m):\r\n if arr[i][j]=='.':\r\n if i%2==0:\r\n if j%2==0:\r\n print('W',end=\"\")\r\n else:\r\n print('B',end=\"\")\r\n else:\r\n if j%2==0:\r\n print('B',end=\"\")\r\n else:\r\n print('W',end=\"\")\r\n else:\r\n print('-',end=\"\")\r\n print(\"\")\r\n\r\n\r\nmain()\r\n ", "\r\nn, m = list(map(int, input().split()))\r\n\r\noutput_ls = []\r\n\r\nfor i in range(n):\r\n s = input()\r\n s = list(s)\r\n output_ls.append(s)\r\n\r\n\r\ndef even(x):\r\n return x % 2 == 0\r\n\r\n\r\ndef odd(x):\r\n return x % 2 != 0\r\n\r\n\r\nfor i in range(n):\r\n for j in range(m):\r\n if output_ls[i][j] == '.':\r\n if even(i) and even(j) or odd(i) and odd(j):\r\n output_ls[i][j] = \"B\"\r\n else:\r\n output_ls[i][j] = \"W\"\r\n\r\nfor ls in output_ls:\r\n print(\"\".join(ls))\r\n", "def miis():\r\n return map(int, input().split())\r\n\r\nn, m = miis()\r\na = [list(input()) for i in range(n)]\r\nfor i in range(n):\r\n for j in range(m):\r\n if a[i][j] == '.':\r\n if (i+j)%2:\r\n a[i][j] = 'W'\r\n else:\r\n a[i][j] = 'B'\r\nfor i in a:\r\n print(''.join(i))\r\n", "y = list(map(int,input().strip().split()))[:2]\r\nn = y[0]\r\nm = y[1]\r\n\r\nmatriz = [];\r\n\r\nfor i in range(0, n):\r\n inp = input()\r\n matriz.append([]);\r\n linha = [];\r\n\r\n for letra in inp:\r\n linha.append(letra)\r\n\r\n for j in range(0, m):\r\n matriz[i].append(linha[j]);\r\n if (matriz[i][j] != \"-\"):\r\n if ((i + j) % 2 == 1):\r\n matriz[i][j] = \"W\"\r\n else:\r\n matriz[i][j] = \"B\"\r\n \r\nfor i in range(n):\r\n resp = \"\";\r\n for j in range(m):\r\n resp += matriz[i][j];\r\n print(resp);", "GOOD_CELL = \".\"\nBAD_CELL = \"-\"\nCHESS_VALUES = (\"B\", \"W\")\n\nn, m = map(int, input().split())\n\nrows = []\n\nfor i in range(n):\n rows.append(input())\n\n\nfor i, column in enumerate(rows):\n output = \"\"\n for j, cell in enumerate(column):\n if cell == BAD_CELL:\n output += BAD_CELL\n else:\n output += CHESS_VALUES[(i + j) % 2]\n print(output)\n", "import sys\r\nimport math\r\nimport copy\r\nfrom collections import deque\r\nfrom collections import *\r\n\r\ninput = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\r\n\r\n\r\ndef ll(): return list(map(int, input().split()))\r\n\r\n\r\ndef lf(): return list(map(float, input().split()))\r\n\r\n\r\ndef ls(): return list(map(str, input().split()))\r\n\r\n\r\ndef mn(): return map(int, input().split())\r\n\r\n\r\ndef nt(): return int(input())\r\n\r\n\r\ndef ns(): return input()\r\na,b=mn()\r\nans=\"\"\r\nfor _ in range(a):\r\n l=list(ns())\r\n for x in range(len(l)):\r\n if l[x]==\".\" and ((x+1)%2==(_+1)%2):\r\n l[x]=\"B\"\r\n elif l[x]==\".\":\r\n l[x]=\"W\"\r\n print(\"\".join(l))", "#445A ~ prasadnaik-null\n[n,m]=list(map(int,input().split()))\nfor j in range(n):\n x,y=input(),\"\"\n if j%2==0:\n for i in range(m):\n if x[i]==\"-\":\n y+=\"-\"\n else:\n if i%2==0:\n y+=\"B\"\n else:\n y+=\"W\"\n else:\n for i in range(m):\n if x[i]==\"-\":\n y+=\"-\"\n else:\n if i%2==0:\n y+=\"W\"\n else:\n y+=\"B\"\n print(y)\n", "n,m=map(int,input().split())\r\nlst=[]\r\nfor i in range(n):lst.append(list(input()))\r\nfor i in range(n):\r\n for j in range(m):\r\n if lst[i][j]=='.':\r\n if (i+j)%2:lst[i][j]='B'\r\n else:lst[i][j]='W'\r\nfor i in range(n):\r\n for j in range(m):print(lst[i][j],end='')\r\n print()\r\n", "n, m = [int(i) for i in input().split()]\noutput = \"\"\n\nfor i in range(n):\n\ts = input()\n\tfor j in range(m):\n\t\tif s[j] == '.':\n\t\t\tif ((i+j)%2 != 0):\n\t\t\t\ts = s[:j] + 'W' + s[j+1:]\n\t\t\telse:\n\t\t\t\ts = s[:j] + 'B' + s[j+1:]\n\n\toutput += s + '\\n'\n\nprint(output)\n", "n,m =map(int,input().split())\r\nlst = [[0]*m for i in range(n)]\r\n\r\nfor i in range(1,n+1):\r\n x = input()\r\n for j in range(1,m+1):\r\n if x[j-1] == \".\" and (i+j)%2==0:\r\n print(\"B\",end=\"\")\r\n elif x[j-1] == \".\" and (i+j)%2!=0:\r\n print(\"W\",end=\"\")\r\n else:\r\n print(\"-\",end=\"\")\r\n print()\r\n\r\n", "n, m = [int(i)for i in input().split()]\r\nans = []\r\nfor i in range(n):\r\n s = input()\r\n ans.append([])\r\n for j in range(len(s)):\r\n if s[j] == '.':\r\n if (i % 2 == 0 and j % 2 == 0) or (i % 2 == 1 and j % 2 == 1):\r\n ans[-1].append('B')\r\n else:\r\n ans[-1].append('W')\r\n else:\r\n ans[-1].append('-')\r\nfor i in ans:\r\n print(*i, sep='')\r\n", "n,m=map(int,input().split())\r\nfor i in range(n):\r\n s=input()\r\n a=\"\"\r\n for j in range(m):\r\n if s[j]=='.':\r\n if (i+j)&1==1:\r\n a+=\"W\"\r\n else:\r\n a+=\"B\"\r\n else:\r\n a+=s[j]\r\n print(a)", "import io,sys,os\n#input = io.BytesIO(os.read(0,os.fstat(0).st_size)).readline\n\nt=1\nwhile t>0:\n s = input().strip().split()\n n,m=int(s[0]),int(s[1])\n arr=[input().strip() for i in range(n)]\n result=list()\n for i in range(n):\n answer=''\n if i%2==0:\n answer='BW'*(m//2)\n if m%2==1:\n answer+='B'\n result.append(answer)\n else:\n answer='WB'*(m//2)\n if m%2==1:\n answer+='W'\n result.append(answer)\n for i in range(n):\n \tfor j in range(m):\n \t\tif arr[i][j]=='-':\n \t\t\tprint(arr[i][j],end='')\n \t\telse:\n \t\t\tprint(result[i][j],end='')\n \tprint()\n t-=1\n\n\n", "n,m=map(int,input().split())\r\na=['W','B'] #we want answer in alternate fashion\r\nfor i in range(n): #rows\r\n s=list(input())\r\n #prnt(\"list\",s)\r\n for j in range(m):#coulum\r\n if s[j]=='.': #good cell\r\n s[j]=a[(i+j)%2]\r\n print(''.join(s))", "import sys\r\nfrom collections import deque as dek\r\n# def print(a):\r\n# sys.stdout.write(str(a)+'\\n')\r\ndef input():\r\n return sys.stdin.readline().strip()\r\nvis =set()\r\nx=[-1,0,1,0]\r\ny=[0,1,0,-1]\r\ndef sol(i,j):\r\n w=True\r\n q=dek()\r\n q.append((i,j))\r\n while q:\r\n nq=dek()\r\n while q:\r\n a,b=q.popleft()\r\n if w:\r\n mat[a][b]=\"W\"\r\n else:\r\n mat[a][b]=\"B\"\r\n for ind in range(4):\r\n ni,nj=a+x[ind],b+y[ind]\r\n if ni<0 or nj<0 or ni>=r or nj>=c or (ni,nj) in vis or mat[ni][nj]==\"-\":\r\n continue\r\n nq.append((ni,nj))\r\n vis.add((ni,nj))\r\n q=nq\r\n w= not w\r\n \r\nr,c=map(int,input().split())\r\nmat=[]\r\nfor i in range(r):\r\n mat.append(list(input()))\r\n# print(mat)\r\nfor i in range(r):\r\n for j in range(c):\r\n if mat[i][j]=='.':\r\n sol(i,j)\r\nfor x in mat:\r\n print(\"\".join(x))\r\n \r\n \r\n", "import sys\ninput = sys.stdin.readline\n\nR, C = map(int, input().split())\nM = [list(input().rstrip()) for _ in range(R)]\n\nfor ri in range(R) :\n for ci in range(C) :\n if M[ri][ci] == \".\" :\n if ri%2 == 0 : M[ri][ci] = [\"W\", \"B\"][ci%2==0]\n else : M[ri][ci] = [\"W\", \"B\"][ci%2==1]\n \nprint(\"\\n\".join([\"\".join(rs) for rs in M]))\n", "n, m = map(int, input().split())\r\n\r\nfor i in range(n):\r\n data = input()\r\n for j in range(m):\r\n if data[j] == '-':\r\n print('-', end='')\r\n elif (i + j) % 2 == 0:\r\n print('B', end='')\r\n else:\r\n print('W', end='')\r\n print()\r\n", "n , m =map(int , input().split())\r\nl = []\r\nfor j in range(n):\r\n # a = list(map(str , input().split()))\r\n s = input()\r\n a = []\r\n for j in range(len(s)):\r\n a.append(s[j])\r\n l.append(a)\r\n# print(l)\r\nvar = 0\r\nfor j in range(n):\r\n for k in range(m):\r\n if j%2==0:\r\n if l[j][k]==\".\" and var%2==0:\r\n l[j][k]=\"W\"\r\n elif l[j][k]==\".\" and var%2==1:\r\n l[j][k]=\"B\"\r\n var+=1\r\n else:\r\n if l[j][k]==\".\" and var%2==0:\r\n l[j][k]=\"B\"\r\n elif l[j][k]==\".\" and var%2==1:\r\n l[j][k]=\"W\"\r\n var+=1\r\n var = 0\r\nfor j in range((n)):\r\n for k in range(m):\r\n print(l[j][k],end=\"\")\r\n print()\r\n # print(l)\r\n \r\n ", "a,b=map(int,input().split())\r\nl=[]\r\nfor i in range(a):\r\n\tl.append(list(input()))\r\nfor i in range(a):\r\n\tfor j in range(b):\r\n\t\tif l[i][j]=='.':\r\n\t\t\tif i&1:\r\n\t\t\t\tif j&1:\r\n\t\t\t\t\tl[i][j]='B'\r\n\t\t\t\telse:\r\n\t\t\t\t\tl[i][j]='W'\r\n\t\t\telse:\r\n\t\t\t\tif j&1:\r\n\t\t\t\t\tl[i][j]='W'\r\n\t\t\t\telse:\r\n\t\t\t\t\tl[i][j]='B'\r\n\tprint(''.join(l[i]))", "n,m=map(int,input().split())\r\na=[input() for i in range(n)]\r\n# print(a)\r\nc=[]\r\nfor i in range(n):\r\n if i%2==0:\r\n if m%2:\r\n d = \"BW\"*(m//2)+\"B\"\r\n else:\r\n d = \"BW\"*(m//2)\r\n else:\r\n if m%2:\r\n d = \"WB\"*(m//2)+\"W\"\r\n else:\r\n d = \"WB\"*(m//2)\r\n c.append(d)\r\nfor i,g in zip(a,c):\r\n for j,h in zip(i,g):\r\n if j=='-':\r\n print(j,end=\"\")\r\n else:\r\n print(h,end=\"\")\r\n print()\r\n\r\n", "def read_integers():\n return map(int, input().split())\n\ndef read_sequence(n):\n return [list(input().strip()) for _ in range(n)]\n\ndef fill_sequence(sequence, characters):\n for i in range(len(sequence)):\n for j in range(len(sequence[i])):\n if sequence[i][j] == '.':\n sequence[i][j] = characters[(i+j) % 2]\n\ndef print_sequence(sequence):\n for row in sequence:\n print(''.join(row))\n\nn, m = read_integers()\ncharacters = ['W', 'B']\nsequence = read_sequence(n)\nfill_sequence(sequence, characters)\nprint_sequence(sequence)", "n, m = map(lambda x: int(x), input().split())\r\nl = []\r\n\r\nfor i in range(n):\r\n\tl.append(list(input()))\r\n\t\r\ni = 0\r\nwhile i < n:\r\n\tj = 0\r\n\twhile j < m:\r\n\t\tif (i%2 == j%2) and l[i][j] == '.':\r\n\t\t\tl[i][j] = 'B'\r\n\t\telif l[i][j] == '.':\r\n\t\t\tl[i][j] = 'W'\r\n\t\tj += 1\r\n\tprint(''.join(l[i]))\r\n\ti += 1\r\n", "n, m = list(map(int, input().split()))\r\nfor i in range(n):\r\n data = input()\r\n for j in range(len(data)):\r\n if data[j] == '.' and (j+i) % 2 == 0:\r\n print(\"B\",end='')\r\n elif data[j] == '.':\r\n print(\"W\",end='')\r\n else:\r\n print(data[j],end='')\r\n print(\"\")", "n,m = map(int,input().split())\r\ngrid = []\r\nfor i in range(n):\r\n s = str(input())\r\n grid.append(list(s))\r\n\r\nfor i in range(n):\r\n for j in range(m):\r\n if grid[i][j] == '.':\r\n if (i+1) % 2 != 0:\r\n if (j+1) % 2 != 0:\r\n grid[i][j] = 'B'\r\n else:\r\n grid[i][j] = 'W'\r\n else:\r\n if (j+1) % 2 != 0:\r\n grid[i][j] = 'W'\r\n else:\r\n grid[i][j] = 'B'\r\n\r\nfor key in grid:\r\n print(\"\".join(map(str,key)))", "x=[int(x) for x in input().split()]\r\nl=[]\r\nfor i in range(x[0]):\r\n it=input()\r\n l.append(it)\r\nfor j in range(x[0]):\r\n for k in range(x[1]):\r\n if l[j][k]==\".\":\r\n if (k+j)%2==0:\r\n print(\"W\",end=\"\")\r\n else:\r\n print(\"B\",end=\"\")\r\n else:\r\n print(\"-\",end=\"\")\r\n print()", "n,m=list(map(int,input().split()))\r\nres=[]\r\nmine=[]\r\nfor i in range(n):\r\n rec=[]\r\n x=input()\r\n l=[]\r\n l[::]=x\r\n res.append(l)\r\n if i%2==0:\r\n for j in range(m):\r\n if j%2==0:\r\n rec.append('B')\r\n else:\r\n rec.append('W')\r\n else:\r\n for j in range(m):\r\n if j%2==0:\r\n rec.append('W')\r\n else:\r\n rec.append('B')\r\n mine.append(rec)\r\nfor i in range(n):\r\n for j in range(m):\r\n if res[i][j]==\".\":\r\n print(mine[i][j],end=\"\")\r\n else:\r\n print(\"-\",end=\"\")\r\n print()\r\n", "n, m = map(int, input().split())\r\n\r\nfor i in range(n):\r\n out = \"\"\r\n line = input()\r\n\r\n for j in range(len(line)):\r\n if line[j] == \".\":\r\n if (i+j) % 2 == 0:\r\n out += \"B\"\r\n else:\r\n out += \"W\"\r\n else:\r\n out += \"-\"\r\n print(out)", "z = []\r\nw = []\r\nq = []\r\nz[0:] = map(int, input().split())\r\nfor i in range(z[0]):\r\n w[0:] = map(str,input())\r\n q.append(w[:])\r\n#print(q)\r\n\r\nfor i in range(z[0]):\r\n for j in range(z[1]):\r\n if q[i][j] == '.':\r\n q[i][j] = 'B'\r\n\r\n#print(q)\r\nif z[1] * z[0] == 1 and q[i][j] =='-':\r\n q.append('-')\r\nelif z[1] * z[0] == 1 and q[i][j] !='-':\r\n p = 2\r\n#print(q)\r\n#else:\r\ny = list(q)\r\nfor i in range(0,z[0],2):\r\n for j in range(0,z[1],2):\r\n if q[i][j] != '-':\r\n q[i][j] = \"W\"\r\n\r\nfor i in range(1,z[0],2):\r\n for j in range(1,z[1],2):\r\n if q[i][j] != '-':\r\n q[i][j] = \"W\"\r\n #y[i][j] = \"W\"\r\n\r\n\r\nfor i in range(z[0]):\r\n for j in range(z[1]):\r\n print(q[i][j],end= \"\")\r\n print(\"\")", "import math as M\r\nimport heapq as H\r\nimport itertools as I\r\nimport collections as C\r\nfrom sys import stdin, stdout ,getsizeof\r\nfrom itertools import groupby as gb\r\nfrom math import log10 ,log2,ceil,factorial as f\r\nfrom itertools import combinations_with_replacement as com\r\n\r\n\r\narr = lambda x:map(x,stdin.readline().strip().split())\r\nvar = lambda x:x(stdin.readline().strip())\r\nout = lambda x:stdout.write(str(x)+\"\\n\")\r\n\r\n\r\n\r\n \r\nl,b = arr(int)\r\ndata = []\r\n\r\nfor _ in range(l):\r\n\tdata.append(list(input()))\r\n\r\n\r\nfor i in range(l):\r\n\tif i%2==0:\r\n\t\tdata[i] = list(\"\".join(data[i]).replace(\".\",\"B\"))\r\n\t\tfor j in range(b):\r\n\t\t\tif data[i][j]==\"B\" and j%2!=0:\r\n\t\t\t\tdata[i][j] = \"W\"\r\n\telse:\r\n\r\n\t\tdata[i] = list(\"\".join(data[i]).replace(\".\",\"W\"))\r\n\t\tfor j in range(b):\r\n\t\t\tif data[i][j]==\"W\" and j%2!=0:\r\n\t\t\t\tdata[i][j] = \"B\"\r\n\r\n\r\nfor i in data:\r\n\tout(\"\".join(i))\r\n\r\n\r\n\r\n\r\n\r\n", "n, m = [int(x) for x in input().split()]\r\nmatriz = []\r\n\r\nfor i in range(n):\r\n matriz.append(input().replace(\"\", \" \").split())\r\n\r\nfor i in range(n):\r\n for j in range(m):\r\n if matriz[i][j] == \".\":\r\n if (i + j) & 1:\r\n matriz[i][j] = \"W\"\r\n else:\r\n matriz[i][j] = \"B\"\r\n\r\n[print(\"\".join(matriz[i])) for i in range(n)]\r\n", "a,b = map(int,input().split())\r\nfor i in range(a):\r\n a = input(); s= \"\"\r\n for j in range(b):\r\n if a[j] == '-':\r\n s+=a[j]\r\n else:\r\n s+= 'B' if(i+j)%2 else 'W'\r\n print(s)", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn, m = map(int, input().split())\r\nd = []\r\nfor i in range(n):\r\n if i%2:\r\n d.append(list(('BW'*m)[:m]))\r\n else:\r\n d.append(list(('WB' * m)[:m]))\r\nfor i in range(n):\r\n s = input()[:-1]\r\n for j in range(m):\r\n if s[j] == '-':\r\n d[i][j] = '-'\r\nfor i in d:\r\n print(''.join(i))", "# DZY Loves Chessboard\r\ndef odd(n,m):\r\n count = 1\r\n for i in range(n):\r\n s = input()\r\n for i in range(m):\r\n count += 1\r\n if s[i] == \"-\":\r\n print(\"-\",end = \"\")\r\n elif count % 2 != 0:\r\n print(\"W\",end = \"\")\r\n elif count % 2 == 0:\r\n print(\"B\", end = \"\")\r\n if i == m-1:\r\n print()\r\n\r\ndef even(n,m):\r\n number = 0\r\n count = 0\r\n for i in range(n):\r\n number += 1\r\n s = input()\r\n for i in range(m):\r\n count += 1\r\n if s[i] == \"-\":\r\n print(\"-\",end = '')\r\n elif count % 2 != 0:\r\n print(\"W\",end = \"\")\r\n elif count % 2 == 0:\r\n print(\"B\",end = \"\")\r\n if i == m-1:\r\n print()\r\n if number % 2 != 0:\r\n count = 1\r\n elif number % 2 == 0:\r\n count = 0\r\n\r\nn,m = map(int,input().split(\" \"))\r\nif m % 2 != 0:\r\n odd(n,m)\r\nelse:\r\n even(n,m)", "n, m= map(int, input().split())\r\nchecker= [\"W\", \"B\"]\r\n\r\nfor i in range(n):\r\n l= input()\r\n l1= []\r\n for j in range(len(l)):\r\n if l[j]== \"-\":\r\n l1.append(\"-\")\r\n else:\r\n l1.append(checker[(i+j)%2])\r\n print(*l1, sep= \"\")", "n, m = map(int, input().split())\r\n\r\nfor i in range(0, n):\r\n s = input()\r\n\r\n for j, elem in enumerate(s):\r\n if elem=='.':\r\n if (i+j)%2 == 0 :\r\n print('B',end=\"\")\r\n else:\r\n print('W',end=\"\")\r\n else:\r\n print('-',end=\"\") \r\n print()\r\n\r\n\r\n\r\n\r\n\r\n", "n, m = map(int, input().split())\r\nlst = []\r\nfor i in range(n):\r\n tmp = input()\r\n tmplst = [char for char in tmp]\r\n lst.append(tmplst)\r\n\r\nres = []\r\nsym = \"B\"\r\nfor i in range(n):\r\n if sym == \"B\":\r\n sym = \"W\"\r\n else:\r\n sym = \"B\"\r\n x = sym\r\n arr = []\r\n for j in range(m):\r\n arr.append(x)\r\n if x == \"B\":\r\n x = \"W\"\r\n else:\r\n x = \"B\"\r\n res.append(arr)\r\n\r\nresS = \"\"\r\nfor i in range(n):\r\n for j in range(m):\r\n if lst[i][j] == \".\":\r\n resS += res[i][j]\r\n else:\r\n resS += \"-\"\r\n resS += \"\\n\"\r\nprint(resS)\r\n", "e = input().split()\r\nn = int(e[0])\r\nm = int(e[1])\r\np = ['B','W']\r\nsaida = list()\r\n\r\nfor i in range(n):\r\n l = list(input())\r\n for j in range(m):\r\n if l[j] == '.':\r\n l[j] = p[(i+j)%2]\r\n saida.append(''.join(l))\r\n\r\nfor item in saida:\r\n print(item)", "n,m = map(int,input().split())\r\nl = [list(str(input())) for i in range(n)]\r\nd = []\r\nfor i in range(n):\r\n if i == 0:\r\n if m%2!=0:\r\n d.append('BW'*(m//2)+'B')\r\n else:\r\n d.append('BW'*(m//2))\r\n else:\r\n if i % 2 != 0:\r\n if m%2!=0:\r\n d.append('WB'*(m//2)+'W')\r\n else:\r\n d.append('WB'*(m//2))\r\n else:\r\n if m%2!=0:\r\n d.append('BW'*(m//2)+'B')\r\n else:\r\n d.append('BW'*(m//2))\r\nfor i in range(n):\r\n d[i] = list(d[i])\r\n\r\nfor i in range(n):\r\n for j in range(m):\r\n if l[i][j] == '-':\r\n d[i][j] = '-'\r\n\r\nfor i in range(n):\r\n print(''.join(d[i]))\r\n", "n,m=map(int,input().split())\r\nrarr=[]\r\nfor i in range(n):\r\n arr=input()\r\n rarr.append(list(arr))\r\nres=[]\r\nfor i in range(n):\r\n if i%2==0:\r\n l=['W','B']*m\r\n else:\r\n l=['B','W']*m\r\n res.append(l[:m])\r\nfor i in range(n):\r\n for j in range(m):\r\n if rarr[i][j]=='-':\r\n res[i][j]='-'\r\nfor i in range(n):\r\n v=''.join(res[i])\r\n print(v)", "def solve():\r\n rn, cn = [int(i) for i in input().split()]\r\n for r in range(rn):\r\n d = input()\r\n s = ''\r\n for c in range(cn):\r\n s += '-' if d[c] == '-' else ('BW'[(r + c) % 2])\r\n print(s)\r\n\r\n\r\nsolve()", "n,m=map(int,input().split())\r\nmatrix=[]\r\nfor i in range(n):\r\n matrix.append(input())\r\nfor i in range(n):\r\n if i%2==0:\r\n whitefirst=True\r\n else:\r\n whitefirst=False\r\n for j in range(m):\r\n if matrix[i][j]==\"-\":\r\n print(\"-\",end=\"\")\r\n else:\r\n if whitefirst:\r\n if j%2==0:\r\n print(\"W\",end=\"\")\r\n else:\r\n print(\"B\",end=\"\")\r\n else:\r\n if j%2==0:\r\n print(\"B\",end=\"\")\r\n else:\r\n print(\"W\",end=\"\")\r\n print()\r\n", "n , m = map(int,input().split())\r\n\r\nboard = []\r\n\r\nfor i in range(n):\r\n \r\n row = list(input().strip())\r\n \r\n board.append(row)\r\n \r\n\r\nfor i in range(n):\r\n for j in range(m):\r\n if board[i][j] == \".\": \r\n if (i + j) % 2 == 0:\r\n board[i][j] = \"W\"\r\n else:\r\n board[i][j] = \"B\"\r\n\r\nfor i in range(n):\r\n print(\"\".join(board[i]))\r\n \r\n \r\n", "n,m = map(int,input().split())\r\ns1 = \"\"\r\nfor i in range(m//2):\r\n s1 += \"WB\"\r\ns1 += (m%2)*\"W\"\r\ns2 = \"\"\r\nfor i in range(m//2):\r\n s2 += \"BW\"\r\ns2 += (m%2)*\"B\"\r\nfor x in range(n):\r\n s = input()\r\n p = \"\"\r\n for i in range(m):\r\n if s[i] == \".\" and x %2 == 0:\r\n p += s1[i]\r\n elif s[i] == \".\" and x %2 == 1:\r\n p += s2[i]\r\n else:\r\n p += \"-\"\r\n print(p)", "n, m = map(int, input().split())\r\nfor i in range(n):\r\n S = input().strip()\r\n for j in range(m):\r\n if S[j] == '.':\r\n if (i + j) % 2 == 1:\r\n S = S[:j] + 'W' + S[j+1:]\r\n else:\r\n S = S[:j] + 'B' + S[j+1:]\r\n print(S)\r\n", "a, b = map(int, input().split(' '))\r\nfor i in range(a):\r\n l = list(input())\r\n for j in range(b):\r\n if l[j] == \".\":\r\n l[j] = \"B\" if (i + j) % 2 else \"W\"\r\n print(\"\".join(l))", "l = []\r\nx , y = map(int,input().split())\r\nfor i in range(x):\r\n a = input()\r\n al = list(a)\r\n l.append(al)\r\nfor i in range(x):\r\n for j in range(y):\r\n if i%2 == 0:\r\n if j%2==0 and l[i][j] != '-':\r\n l[i][j] = 'B'\r\n elif j%2!=0 and l[i][j] != '-':\r\n l[i][j] = 'W'\r\n elif i%2 != 0:\r\n if j%2==0 and l[i][j] != '-':\r\n l[i][j] = 'W'\r\n elif j%2!=0 and l[i][j] != '-':\r\n l[i][j] = 'B'\r\nfor i in range(len(l)):\r\n print(''.join(l[i]))\r\n", "import math\r\nfrom collections import Counter\r\nfrom functools import lru_cache\r\n\r\nt = 1\r\nfor _ in range(t):\r\n n, m = [int(i) for i in input().split()]\r\n matrix = []\r\n for i in range(n):\r\n matrix.append([i for i in input()])\r\n lis0 = [\"B\", \"W\"]\r\n lis1 = [\"W\", \"B\"]\r\n for i in range(n):\r\n start = 0\r\n for j in range(m):\r\n if i % 2 == 0:\r\n if matrix[i][j] == \".\":\r\n matrix[i][j] = lis0[start]\r\n start = (start + 1) % 2\r\n else:\r\n if matrix[i][j] == \".\":\r\n matrix[i][j] = lis1[start]\r\n start = (start + 1) % 2\r\n\r\n for i in range(n):\r\n print(\"\".join(matrix[i]))\r\n", "n, m = map(int, input().split())\r\nboard = []\r\nfor _ in range(n):\r\n board.append(input())\r\n\r\n# Create an empty chessboard of the same size filled with \"-\"\r\nchessboard = [['-' for _ in range(m)] for _ in range(n)]\r\n\r\n# Define the colors of the chessmen\r\ncolors = ['W', 'B']\r\n\r\n# Iterate through each cell of the board\r\nfor i in range(n):\r\n for j in range(m):\r\n # Skip bad cells\r\n if board[i][j] == '-':\r\n continue\r\n \r\n # Calculate the color of the chessman based on cell position\r\n chessman_color = colors[(i + j) % 2]\r\n \r\n # Place the chessman on the chessboard\r\n chessboard[i][j] = chessman_color\r\n\r\n# Print the chessboard\r\nfor row in chessboard:\r\n print(\"\".join(row))\r\n", "n, m = list(map(lambda x: int(x), input().split()))\r\nboard = []\r\nfor i in range(n):\r\n board.append(list(input()))\r\n\r\nfor x in range(n):\r\n for y in range(m):\r\n if board[x][y] == '.':\r\n if x % 2 - y % 2 == 0:\r\n board[x][y] = 'B'\r\n else:\r\n board[x][y] = 'W'\r\n\r\nfor i in board:\r\n for y in i:\r\n print(y, end='')\r\n print()\r\n", "n , m = [int(x) for x in input().split()]\r\n\r\ndef getWB(x , y):\r\n if sum([x , y]) % 2 == 0:\r\n return \"B\"\r\n return \"W\"\r\n\r\nfor rowIndex in range(n):\r\n inpt = input()\r\n row = \"\"\r\n for c in range(m):\r\n if inpt[c] == \".\":\r\n row += getWB(c , rowIndex)\r\n else:\r\n row += '-' \r\n print(row)", "m, n = input().split()\r\nm = int(m)\r\nn = int(n)\r\n\r\nboard = []\r\nfor i in range(m):\r\n lst = input()\r\n board.append(lst)\r\n\r\nfor i in range(m):\r\n for j in range(n):\r\n if board[i][j] == '-':\r\n print('-', end='')\r\n else:\r\n print('W' if (i+j) % 2 == 0 else 'B', end='')\r\n\r\n print()\r\n", "n,m=map(int,input().split())\r\nx=[]\r\nfor i in range(n):\r\n a=list(input())\r\n x.append(a)\r\nfor i in range(n):\r\n for j in range((m)):\r\n if (i+j)%2==1 and x[i][j]==\".\":\r\n x[i][j]=\"W\"\r\n if (i+j)%2==0 and x[i][j]==\".\":\r\n x[i][j]=\"B\"\r\nfor i in x:\r\n print(\"\".join(i))", "n,m = map(int, input().split())\r\ngrid = []\r\nfor i in range(n):\r\n grid.append(list(input()))\r\nrow1 = []\r\n\r\nmode = True\r\nfor i in range(m):\r\n if(mode):\r\n row1.append(\"B\")\r\n mode = False\r\n else:\r\n row1.append(\"W\")\r\n mode = True\r\n\r\nrow2 = []\r\nfor i in row1:\r\n if(i == \"B\"):\r\n row2.append(\"W\")\r\n else:\r\n row2.append(\"B\")\r\n\r\nk = []\r\n\r\nfor i in range(n):\r\n if(mode):\r\n k.append(row1)\r\n mode = False\r\n else:\r\n k.append(row2)\r\n mode = True\r\n\r\nfor i in range(n):\r\n s = \"\"\r\n for j in range(m):\r\n if(grid[i][j] == \"-\"):\r\n s += \"-\"\r\n else:\r\n s += k[i][j]\r\n print(s)\r\n ", "s = input().split()\r\nn, m = int(s[0]), int(s[1])\r\n\r\nlst = []\r\nfor i in range(n):\r\n lst.append(input())\r\n\r\nst = 'B'\r\nfor i in range(n):\r\n for j in range(m):\r\n if lst[i][j] == '.':\r\n print(st, end='')\r\n else:\r\n print('-', end='')\r\n if st == 'B':\r\n st = 'W'\r\n else:\r\n st = 'B'\r\n if m % 2 == 0:\r\n if st == 'B':\r\n st = 'W'\r\n else:\r\n st = 'B'\r\n print()", "while True:\n try:\n a, b = map(int, input().split())\n except EOFError:\n break\n\n str = [['' for j in range(b)] for i in range(a)]\n for i in range(a):\n line = input()\n for j in range(b):\n str[i][j] = line[j]\n\n for i in range(a):\n for j in range(b):\n if str[i][j] == '.':\n if (i+j) % 2 == 0:\n str[i][j] = 'B'\n else:\n str[i][j] = 'W'\n\n for i in range(a):\n print(''.join(str[i]))\n\n \t \t\t \t\t \t\t\t\t \t\t \t\t\t \t\t", "l= ['B','W'];c1='';c2=0\r\nn,m= map(int,input().split())\r\nfor _ in range(n):\r\n s= input()\r\n def hi(s,m,c2):\r\n if len(s)==0:\r\n return m\r\n if s[0]=='-':\r\n m+=s[0]\r\n else: \r\n m+=l[c2%2] \r\n c2+=1\r\n return hi(s[1:],m,c2)\r\n c1+=hi(s,'',c2)\r\n c1+='\\n'\r\n c2-=1\r\nprint(c1)", "n, m = map(int, input().split())\r\nmp = [[''] * n for _ in range(m)]\r\nfor i in range(n):\r\n line = input()\r\n for j in range(m):\r\n mp[j][i] = line[j]\r\n if mp[j][i] == '.':\r\n if (j+i) % 2 == 0:\r\n mp[j][i] = 'B'\r\n else:\r\n mp[j][i] = 'W'\r\nfor i in range(n):\r\n print(''.join(mp[j][i] for j in range(m)))\r\n", "import sys, os\r\nfrom collections import defaultdict\r\nfrom math import gcd, sqrt\r\ninput = sys.stdin.readline\r\nread = lambda: list(map(int, input().strip().split()))\r\n\r\n\r\ndef main():\r\n n, m = read(); mat = [list(input().strip()) for i in range(n)]\r\n # print(mat)\r\n for i in range(n):\r\n for j in range(m):\r\n if mat[i][j] == \".\":\r\n mat[i][j] = [\"W\", \"B\"][(i%2 + j)%2]\r\n for i in mat:\r\n print((\"\").join(i))\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n\r\n\r\n\r\n\"\"\"\r\n\r\n\r\nl = n-a+1\r\n\r\na*l + (l*(l+1))//2\r\n\r\n\r\n\r\n\r\n\r\n\r\n\"\"\"", "n,m = map(int,input().split())\r\n\r\nfor i in range(n):\r\n s=input()\r\n res = [i for i in s]\r\n \r\n for j in range(m):\r\n if res[j]=='.':\r\n if (i+j)%2==0:\r\n res[j]='B'\r\n \r\n else:\r\n res[j]='W'\r\n \r\n print(''.join(res))", "matrix=[]\r\nrow,col=map(int,input().split())\r\nfor _ in range(row):\r\n matrix.append(list(input()))\r\nfor i in range(len(matrix)):\r\n for j in range(len(matrix[i])):\r\n if i%2==0 and matrix[i][j]==\".\":\r\n if j%2==0:\r\n matrix[i][j]=\"B\"\r\n print(matrix[i][j],end=\"\")\r\n else:\r\n matrix[i][j]=\"W\"\r\n print(matrix[i][j],end=\"\")\r\n \r\n elif i%2 !=0 and matrix[i][j]==\".\":\r\n if j%2==0:\r\n matrix[i][j]=\"W\"\r\n print(matrix[i][j],end=\"\")\r\n else:\r\n matrix[i][j]=\"B\"\r\n print(matrix[i][j],end=\"\")\r\n else:\r\n print(matrix[i][j],end=\"\")\r\n print()", "n,m=map(int,input().split())\r\ns=[]\r\nfor i in range(n):\r\n m1=input()\r\n f=list(m1)\r\n s.append(f)\r\ni=0\r\nwhile i < n:\r\n j=0\r\n while j < m:\r\n if s[i][j]==\".\":\r\n if i %2 == 0 and j%2 == 0:\r\n s[i][j]=\"B\"\r\n elif i %2 == 1 and j%2 == 0:\r\n s[i][j]=\"W\"\r\n elif i %2 == 0 and j%2 == 1:\r\n s[i][j]=\"W\"\r\n elif i %2 == 1 and j%2 == 1:\r\n s[i][j]=\"B\"\r\n j+=1\r\n i+=1\r\nfor i in s :\r\n for j in i :\r\n print(j,end=\"\")\r\n print()", "n,m=map(int,input().split())\r\nfor i in range(1,n+1):\r\n\tl=list(input())\r\n\tif i%2==1:\r\n\t\tfor j in range(1,m+1):\r\n\t\t\tif l[j-1]==\".\":\r\n\t\t\t\tif j%2==1:\r\n\t\t\t\t\tl[j-1]=\"B\"\r\n\t\t\t\telse:\r\n\t\t\t\t\tl[j-1]=\"W\"\r\n\telse:\r\n\t\tfor j in range(1,m+1):\r\n\t\t\tif l[j-1]==\".\":\r\n\t\t\t\tif j%2==1:\r\n\t\t\t\t\tl[j-1]=\"W\"\r\n\t\t\t\telse:\r\n\t\t\t\t\tl[j-1]=\"B\"\r\n\tprint(\"\".join(l))\r\n", "n, m= map(int, input().split())\r\nfor i in range(n):\r\n s= input()\r\n for j in range(m):\r\n print ('-' if s[j] == '-' else ('W' if (i+j)%2 else 'B'), end= '')\r\n print()", "dados = input().split()\nn, m = map(int, dados)\ntabuleiro = []\nfor i in range(n):\n linha = input()\n linha_tab = ''\n for j in range(m):\n if linha[j] == '.':\n if (j+i) % 2 == 0:\n linha_tab += 'B'\n else:\n linha_tab += 'W'\n else:\n linha_tab += linha[j]\n tabuleiro.append(linha_tab)\n\nfor i in range(n):\n print(tabuleiro[i])\n \t\t \t \t\t\t \t\t\t\t \t \t \t \t", "#from collections import Counter\r\n#n = int(input())\r\nn,m = map(int,input().split())\r\n#l = list(map(int,input().split()))\r\n#k = int(input())\r\n\r\ndef printmat(t):\r\n for i in t:\r\n print(\"\".join(i))\r\n\r\nl = []\r\nfor i in range(n):\r\n l.append(list(input()))\r\n\r\nfor i in range(n):\r\n for j in range(m):\r\n if l[i][j] == \".\":\r\n #print(i,j)\r\n if (i+j) % 2 ==0:\r\n l[i][j]= \"B\"\r\n else:\r\n l[i][j]= \"W\"\r\n \r\nprintmat(l)\r\n \r\n\r\n", "from collections import deque\r\nn,m = map(int,input().split())\r\n\r\na = []\r\nfor i in range(n):\r\n\ta.append( list(input()) )\r\n\r\nq = deque([(0,0,\"W\")])\r\nvisited = set()\r\n\r\nwhile(q):\r\n\tcurrent = q.popleft()\r\n\tif (current[0], current[1]) not in visited:\r\n\t\tvisited.add((current[0], current[1]))\r\n\t\tif a[current[0]][current[1]]!=\"-\":\r\n\t\t\ta[current[0]][current[1]] = current[2]\r\n\r\n\t\tchild_color = \"B\" if current[2]==\"W\" else \"W\"\r\n\t\tif current[0]-1>=0:\r\n\t\t\tq.append((current[0]-1, current[1], child_color))\r\n\t\tif current[0]+1<n:\r\n\t\t\tq.append((current[0]+1, current[1], child_color))\r\n\t\tif current[1]-1>=0:\r\n\t\t\tq.append((current[0], current[1]-1, child_color))\r\n\t\tif current[1]+1<m:\r\n\t\t\tq.append((current[0], current[1]+1, child_color))\r\n\r\n\r\nfor i in a:\r\n\tprint(*i, sep=\"\")", "n,m=list(map(int,input().split()))\r\nl=[]\r\nfor i in range(n):\r\n t=input()\r\n k=[]\r\n for i in t:\r\n k.append(i)\r\n l.append(k)\r\nfor i in range(n):\r\n for j in range(m):\r\n if l[i][j]=='.':\r\n if (i+j) & 1:\r\n l[i][j]='W'\r\n else:\r\n l[i][j]='B'\r\nfor i in l:\r\n for j in i:\r\n print(j,end='')\r\n print()\r\n \r\n \r\n", "a1=list(map(int,input().split()))\r\nprin=\"\"\r\nfor i in range(a1[0]):\r\n vr=\"\"\r\n if i%2==0:\r\n start=\"B\"\r\n else:\r\n start=\"W\"\r\n inp=list(input())\r\n for o,j in enumerate(inp):\r\n if j==\"-\":\r\n key=\"-\"\r\n elif not(i%2==0) and not(o%2==0):\r\n key=\"B\"\r\n elif i%2==0 and not(o%2==0):\r\n key=\"W\"\r\n elif (i%2==0) and (o%2==0):\r\n key=\"B\"\r\n elif not(i%2==0) and (o%2==0):\r\n key=\"W\"\r\n vr=vr+key\r\n print(vr)\r\n", "import sys\r\nimport queue\r\ninput = sys.stdin.readline\r\nn, m = map(int, input().split())\r\nmp = []\r\nfor i in range(n):\r\n mp.append(list(input().strip()))\r\n# print(mp)\r\nfor i in range(n):\r\n for j in range(m):\r\n if mp[i][j] == '.':\r\n if (i+j)%2 == 0:\r\n mp[i][j] = 'B'\r\n else:\r\n mp[i][j] = 'W'\r\nfor i in range(n):\r\n print(''.join(mp[i]))", "n, m = map(int, input().split())\r\n\r\ntabuleiro = []\r\nfor i in range(n):\r\n tabuleiro.append(input())\r\n\r\nfor i in range(n):\r\n linha = ''\r\n for j in range(m):\r\n if tabuleiro[i][j] == '-':\r\n linha += '-'\r\n elif (i+j) % 2 == 0:\r\n linha += 'B'\r\n else:\r\n linha += 'W'\r\n print(linha)", "import sys\r\ndef get_ints(): return map(int, sys.stdin.readline().strip().split())\r\ndef get_ints_lists(): return list(map(int, sys.stdin.readline().strip().split()))\r\ndef get_string(): return sys.stdin.readline().strip()\r\nn,m=get_ints()\r\nfor j in range(n):\r\n s=get_string()\r\n w=\"W\"\r\n b=\"B\"\r\n c=\"-\"\r\n if j%2==0:\r\n if m==1:\r\n if s[0]==\".\":\r\n print(b)\r\n else:\r\n print(c)\r\n else:\r\n for i in range(m):\r\n if s[i]==c:\r\n print(c,end=\"\")\r\n else:\r\n if i%2==0:\r\n print(b,end=\"\")\r\n else:\r\n print(w,end=\"\")\r\n print()\r\n elif j%2==1:\r\n if m==1:\r\n if s[0]==\".\":\r\n print(w)\r\n else:\r\n print(c)\r\n else:\r\n for i in range(m):\r\n if s[i]==c:\r\n print(c,end=\"\")\r\n else:\r\n if i%2==0:\r\n print(w,end=\"\")\r\n else:\r\n print(b,end=\"\")\r\n print()", "values = input().split()\r\nrows = int(values[0])\r\ncols = int(values[1])\r\n\r\nchessboard = []\r\nfor i in range(rows):\r\n row = []\r\n for j in range(cols):\r\n if i % 2 == 0:\r\n if j % 2 == 0:\r\n row.append('B')\r\n else:\r\n row.append('W')\r\n else:\r\n if j % 2 == 0:\r\n row.append('W')\r\n else:\r\n row.append('B')\r\n chessboard.append(row)\r\n\r\nfor i in range(rows):\r\n row = input()\r\n for j in range(cols):\r\n if row[j] == '-':\r\n chessboard[i][j] = '-'\r\n\r\nfor i in range(rows):\r\n for j in range(cols):\r\n print(chessboard[i][j], end = \"\")\r\n print()\r\n", "n, m = map(int, input().split(\" \"))\r\noutput = [[] for i in range(n)]\r\n\r\nfor i in range(1, n + 1):\r\n for j in range(1, m + 1):\r\n if i % 2 == j % 2:\r\n output[i - 1].append(\"B\")\r\n else:\r\n output[i - 1].append(\"W\")\r\n\r\nfor i in range(n):\r\n inp = input()\r\n for j in range(m):\r\n if inp[j] == \"-\":\r\n output[i][j] = \"-\"\r\n\r\nfor x in output:\r\n output = \"\"\r\n for y in x:\r\n output += y\r\n print(output)\r\n", "n, m = list(map(int, input().split()))\r\ngrid = [input() for _ in range(n)]\r\nmarked_grid = [row for row in grid]\r\n\r\ndef adjacent(point):\r\n x, y = point\r\n adjacent_points = []\r\n p1, p2, p3, p4 = (x+1, y), (x-1, y), (x, y+1), (x, y-1)\r\n if p1 in good_cells:\r\n adjacent_points.append(p1)\r\n if p2 in good_cells:\r\n adjacent_points.append(p2)\r\n if p3 in good_cells:\r\n adjacent_points.append(p3)\r\n if p4 in good_cells:\r\n adjacent_points.append(p4)\r\n return adjacent_points\r\n\r\n\r\ndef good():\r\n good_cells, visited = [], {}\r\n for i, row in enumerate(grid):\r\n for j, ch in enumerate(row):\r\n if ch == '.':\r\n good_cells.append((i, j))\r\n visited[(i,j)] = False\r\n return good_cells, visited\r\n\r\n\r\ndef graph():\r\n adjacency_list = {}\r\n for i, row in enumerate(grid):\r\n for j, ch in enumerate(row):\r\n point = i, j\r\n adjacent_points = adjacent(point)\r\n if point in good_cells:\r\n adjacency_list[(i, j)] = adjacent_points\r\n return adjacency_list\r\n\r\n\r\ndef dfs(start):\r\n stack, marker[start] = [start], \"B\"\r\n while len(stack) > 0:\r\n vertex = stack.pop()\r\n visited[vertex] = True\r\n color = \"W\" if marker[vertex] == \"B\" else \"B\"\r\n for neighbour in adjacency_list[vertex]:\r\n if not visited[neighbour] and neighbour not in stack:\r\n stack.append(neighbour)\r\n marker[neighbour] = color\r\n \r\ndef mark_all():\r\n while False in visited.values():\r\n for vertex, visit in visited.items():\r\n if not visit:\r\n dfs(vertex)\r\n\r\n\r\ngood_cells, visited = good()\r\nadjacency_list = graph()\r\nmarker = {}\r\nmark_all()\r\nfor (i, j), color in marker.items():\r\n row = marked_grid[i]\r\n marked_grid[i] = row[:j] + color + row[j+1:]\r\nfor row in marked_grid:\r\n for ch in row:\r\n print(ch, end='')\r\n print()\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, m = [int(x) for x in input().split()]\n board = [[cell for cell in input()] for _ in range(n)]\n for i in range(n):\n for j in range(m):\n if board[i][j] == \".\":\n if (i + j) % 2:\n board[i][j] = \"W\"\n else:\n board[i][j] = \"B\"\n print(\"\".join(board[i]))\n\n\nif __name__ == \"__main__\":\n main()\n", "n,m=map(int,input().split())\nans=[]\nfor i in range(n):\n arr=input()\n ans.append(list(arr))\no=[]\nfor i in range(n):\n if i%2==0:\n l=['W','B']*m\n else:\n l=['B','W']*m\n o.append(l[:m])\nfor i in range(n):\n for j in range(m):\n if ans[i][j]=='-':\n o[i][j]='-'\nfor i in range(n):\n v=''.join(o[i])\n print(v)", "n, m=map(int, input().split())\r\ncolors=['W', 'B']\r\nfor i in range(n):\r\n row=list(input())\r\n for j in range(m):\r\n if row[j]=='.':\r\n row[j]=colors[(i+j)%2]\r\n print(''.join(row))", "n,m=map(int,input().split())\r\nchess=[[*input()] for _ in[0]*n]\r\nfor i in range(n):\r\n for j in range(m):\r\n if chess[i][j]=='.' and (i+j)%2:chess[i][j]='B'\r\n if chess[i][j]=='.' and not (i+j)%2:chess[i][j]='W'\r\nfor i in chess:print(''.join(i))", "n,m=input().split()\r\nn=int(n)\r\nm=int(m)\r\nwhile (n>0):\r\n x=input()\r\n y=''\r\n if (n&1==0):\r\n for i in range(m):\r\n if (i&1==0) and x[i]=='.':\r\n y+=\"B\"\r\n elif (i&1==1) and x[i]=='.':\r\n y+='W'\r\n else:\r\n y+=\"-\"\r\n else:\r\n for i in range(m):\r\n if (i&1==1) and x[i]=='.':\r\n y+=\"B\"\r\n elif (i&1==0) and x[i]=='.':\r\n y+=\"W\"\r\n else:\r\n y+=\"-\"\r\n print(y)\r\n n-=1\r\n\r\n\r\n", "inputs = input().split()\r\nn = int(inputs[0])\r\nm = int(inputs[1])\r\n \r\nfor i in range(n):\r\n s = list(input())\r\n for k in range(m):\r\n\r\n if s[k] == '.':\r\n if ((i + k) % 2) == 1:\r\n s[k] = 'W'\r\n else:\r\n s[k] = 'B'\r\n \r\n s = ''.join(s) \r\n print(s)", "import sys\r\ninput = sys.stdin.readline\r\nfrom math import ceil\r\nfrom collections import Counter\r\nmod = 1000000007\r\n #X,Y,Z = list(map(int,input().strip().split()))\r\nn,m = list(map(int,input().strip().split()))\r\n#arr = list(map(int,input().strip().split()))\r\nBW = [\"B\",\"W\"]\r\nWB = [\"W\",\"B\"]\r\nboard = [[0 for i in range(m)] for j in range(n)]\r\nalt = 1\r\nfor i in range(n):\r\n if i % 2 != 0 :\r\n arr = BW \r\n else: \r\n arr = WB\r\n for j in range(m):\r\n if j % 2 != 0:\r\n board[i][j] = arr[0]\r\n else:\r\n board[i][j] = arr[1]\r\nfor i in range(n):\r\n line = input()\r\n string = \"\"\r\n for j in range(m):\r\n if line[j] == \".\":\r\n string += board[i][j]\r\n else:\r\n string += \"-\"\r\n print(string)\r\n \r\n ", "n,m = [int(s) for s in input().split()]\r\n\r\narr = []\r\nfor _ in range(n):\r\n arr.append([c for c in input()])\r\n\r\n# new_arr = [\"\"for i in range(n)]\r\n\r\nj = 0\r\nfor str in arr:\r\n for i in range(j%2,m,2):\r\n if str[i] == \".\":\r\n str[i] = \"B\"\r\n j+=1\r\n\r\nj = 1\r\nfor str in arr:\r\n for i in range(j%2,m,2):\r\n if str[i] == \".\":\r\n str[i] = \"W\"\r\n j+=1\r\nfor str in arr:\r\n res = \"\".join(c for c in str)\r\n print(res)\r\n\r\n", "a , b = map(int , input().split())\r\narr = [list(input()) for _ in range(a)]\r\n\r\nans = [['-']*b for _ in range(a)]\r\nfor i in range(a):\r\n for j in range(b):\r\n if arr[i][j] == '-': continue\r\n if (i+j)%2==0: ans[i][j] = 'B'\r\n else: ans[i][j] = 'W'\r\n\r\nfor i in ans: print(''.join(i))\r\n\r\n", "n, m = map(int, input().split())\r\n\r\nfor i in range(n):\r\n a, b = input(), ''\r\n for j in range(m):\r\n b += a[j] if a[j] == '-' else 'BW'[(i+j)%2]\r\n print(b)", "board = []\r\n\r\nrow_count, column_count = [int(i) for i in (input().split())]\r\n\r\nfor i in range(row_count):\r\n board.append([i for i in input()]) # \"...\".split() wont work as it does not split\r\n\r\nfor row in range(row_count):\r\n for column in range(column_count):\r\n if board[row][column] == \".\":\r\n if (row+column)%2==0 :\r\n board[row][column] = 'B'\r\n else:\r\n board[row][column] = \"W\"\r\n \r\n\r\nfor row in board:\r\n for column in row:\r\n print(column, end=\"\") \r\n print() \r\n", "n,m=map(int,input().split());mat=[]\r\nfor i in range(n):\r\n mat.append(list(input().strip()))\r\nc=[\"W\",\"B\"]\r\nfor i in range(n):\r\n for j in range(m):\r\n if mat[i][j]==\".\":mat[i][j]=c[(i+j)%2]\r\n \r\nfor i in mat:print(\"\".join(i))", "n,m=map(int,input().split())\r\nblank=[['' for i in range(m)] for j in range(n)]\r\nfor i in range(n):\r\n for j in range(m):\r\n if (i+j)%2==0:\r\n blank[i][j]='B'\r\n else:\r\n blank[i][j]='W'\r\nfor i in range(n):\r\n data=list(input())\r\n for j in range(m):\r\n if data[j]=='-':\r\n print('-',end='')\r\n else:\r\n print(blank[i][j],end='')\r\n print()\r\n\r\n\r\n", "import sys\r\n\r\ndef print_result(n, m, board):\r\n answer = [[\"\" for i in range(m)] for j in range(n)]\r\n for i in range(n):\r\n for j in range(m):\r\n if board[i][j] == \".\":\r\n if (i % 2 == 0 and j % 2 == 0) or (i % 2 != 0 and j % 2 != 0):\r\n answer[i][j] = \"W\"\r\n else:\r\n answer[i][j] = \"B\"\r\n else:\r\n answer[i][j] = \"-\"\r\n for i in range(n):\r\n print(\"\".join(answer[i]))\r\n\r\ndef main():\r\n n, m = map(int, sys.stdin.readline().split())\r\n board = []\r\n for i in range(n):\r\n string = sys.stdin.readline()\r\n board.append(string)\r\n print_result(n, m, board)\r\n\r\nif __name__ == \"__main__\":\r\n main()", "si = lambda : input() ; I = lambda : int(input()) ; ar = lambda : list(map(int , input().split())) ; al = lambda : map(int , input().split()) ; als = lambda : map(str , input().split())\r\nn , m =al()\r\narr = [] ;res = []\r\nfor i in range(n) : \r\n arr.append(input())\r\nfor i in range(len(arr)) : \r\n x = [z for z in arr[i]] \r\n for j in range(len(x)) : \r\n if i %2 == 0 :\r\n if x[j] == '.' and j%2 == 0 : \r\n x[j] = 'B'\r\n elif x[j] == '.' and j%2 == 1 : \r\n x[j] = 'W' \r\n else :\r\n if x[j] == '.' and j%2 == 0 : \r\n x[j] = 'W'\r\n elif x[j] == '.' and j%2 == 1 : \r\n x[j] = 'B'\r\n res.append(x)\r\nfor o in res : \r\n print(\"\".join(o))", "'''input\r\n5 5\r\n.....\r\n.....\r\n.....\r\n.....\r\n.....\r\n'''\r\nn,m = map(int, input().strip().split())\r\narr = [['' for _ in range(m)] for _ in range(n)]\r\nfor i in range(n):\r\n\talt = (i+1)%2==0\r\n\ts = input().strip()\r\n\tfor j,c in enumerate(s):\r\n\t\tarr[i][j] = 'W' if alt else 'B'\r\n\t\talt = not alt\r\n\t\tif s[j] == '-':\r\n\t\t\tarr[i][j] = '-'\r\nfor i in range(n):\r\n\tfor j in range(m):\r\n\t\tprint(arr[i][j] , end = '')\r\n\tprint()", "n, m = map(int, input().split())\nboard = [input() for i in range(n)]\ncolors = [[\"\"]*m for i in range(n)]\n\nfor i in range(n):\n for j in range(m):\n if board[i][j] == \"-\":\n colors[i][j] = \"-\"\n elif (i+j) % 2 == 0:\n colors[i][j] = \"B\"\n else:\n colors[i][j] = \"W\"\n\nfor row in colors:\n print(\"\".join(row))\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\n\r\nchessboard = []\r\n\r\nfor row in range(n):\r\n chessboard = list(input())\r\n for col in range(len(chessboard)):\r\n if chessboard[col] == '.':\r\n if (row + col) % 2 == 0:\r\n chessboard[col] = 'B'\r\n else:\r\n chessboard[col] = 'W'\r\n print(''.join(chessboard))\r\n", "n, m = map(int, input().split())\ntabuleiro = [input() for _ in range(n)]\n \ndef bom(i, j):\n return tabuleiro[i][j] == '.'\n \ndef cor(i, j):\n if (i+j) % 2 == 0: \n return 'B' \n else:\n return 'W'\n \nfor i in range(n):\n col = ''\n for j in range(m):\n if bom(i, j):\n col += cor(i, j)\n else:\n col += '-'\n print(col)\n \t \t \t\t \t \t \t \t \t \t\t\t", "n,m = [int(x) for x in input().split()]\ngrid = []\nfor i in range(n):\n\tgrid.append([ c for c in input()])\n\nst = 'B'\nnewgrid=[]\nfor i in range(n):\n\tg = [st for j in range(m)]\n\tif st == 'B':\n\t\tst = 'W'\n\telse:\n\t\tst= 'B'\n\tfor j in range(0,m,2):\n\t\tg[j] = st\n\tnewgrid.append(g)\nfor i in range(n):\n\tfor j in range(m):\n\t\tif grid[i][j] == '-':\n\t\t\tnewgrid[i][j] = '-'\n\t\tprint(newgrid[i][j],end='')\n\tprint()\n\t\t\t \n", "n, m = map(int, input().split())\r\nboard = [input() for _ in range(n)]\r\n\r\ndef is_good(i, j):\r\n return board[i][j] == '.'\r\n\r\ndef get_color(i, j):\r\n return 'W' if (i+j) % 2 == 0 else 'B'\r\n\r\nfor i in range(n):\r\n row = ''\r\n for j in range(m):\r\n if is_good(i, j):\r\n row += get_color(i, j)\r\n else:\r\n row += '-'\r\n print(row)\r\n", "n, m = map(int, input().split())\r\nmatrix = []\r\nfor i in range(n):\r\n s = input()\r\n a = []\r\n for j in range(m):\r\n if s[j] == '-':\r\n a.append(-1)\r\n else:\r\n if i % 2 == 0:\r\n if j % 2 == 0:\r\n a.append(1)\r\n else:\r\n a.append(0)\r\n else:\r\n if j % 2 == 0:\r\n a.append(0)\r\n else:\r\n a.append(1) \r\n matrix.append(a)\r\n\r\nfor i in range(n):\r\n for j in range(m):\r\n if matrix[i][j] == 0:\r\n print('B', end = '')\r\n if matrix[i][j] == 1:\r\n print('W', end = '')\r\n if matrix[i][j] == -1:\r\n print('-', end = '')\r\n print() \r\n", "import heapq\ndef calc(n, m, q):\n matrix = []\n for i, row in enumerate(q):\n s = \"\"\n is_odd = i % 2 != 0\n for j, char in enumerate(row):\n if char == \"-\":\n s += \"-\"\n elif (is_odd and j % 2 == 0)|(not is_odd and j%2!=0):\n s += \"W\"\n else:\n s+=\"B\"\n matrix.append(s)\n return matrix\n\n# get inputs\nn,m = map(int, input().split())\nq = []\nfor _ in range(n):\n q.append(input())\nmatrix = calc(n, m, q)\nfor line in matrix:\n print(line)\n\n\n", "n,m = list(map(int,input().split()))\r\nans = []\r\nwb = [\"W\",\"B\"]\r\nfor i in range(n):\r\n arr = list(input())\r\n for g in range(m):\r\n if arr[g] != \"-\":\r\n arr[g] = wb[int(i&1 ^ g&1)]\r\n ans.append(arr)\r\nfor i in range(n):\r\n print(*ans[i],sep=\"\")", "neighbours = ((0, -1), (-1, 0), (0, 1), (1, 0))\r\n\r\ndef get_neighbours(mat, idx, idy, n, m, neighbour_val):\r\n ans = []\r\n for n_x, n_y in neighbours:\r\n if 0 <= idx+n_x < n and 0 <= idy+n_y < m and mat[idx+n_x][idy+n_y] == \".\": \r\n ans.append((idx+n_x,idy+n_y, \"B\" if neighbour_val == \"W\" else \"W\"))\r\n return ans\r\n\r\ndef main():\r\n n, m = map(int, input().split())\r\n mat = [list(input()) for _ in range(n)]\r\n for idx in range(n):\r\n for idy in range(m):\r\n if mat[idx][idy] == \".\":\r\n mat[idx][idy] = \"B\"\r\n tmp_stack = get_neighbours(mat, idx, idy, n, m, \"B\")\r\n while tmp_stack:\r\n x,y,v = tmp_stack.pop()\r\n mat[x][y] = v\r\n tmp_stack.extend(get_neighbours(mat,x,y,n,m,v))\r\n print(\"\\n\".join([\"\".join(x) for x in mat]))\r\nmain()", "n, m = [int(k) for k in input().split()]\r\ng = []\r\nfor _ in range(n):\r\n g.append([c for c in input()])\r\n\r\ndef dzy(g):\r\n for i in range(len(g)):\r\n for j in range(len(g[i])):\r\n if g[i][j] == '.':\r\n q = [[i, j, True]]\r\n g[i][j] = 'W'\r\n while q:\r\n x, y, was_white = q.pop(0)\r\n\r\n for xx, yy in [[x + 1, y], [x - 1, y], [x, y + 1], [x, y - 1]]:\r\n if 0 <= xx < len(g) and 0 <= yy < len(g[xx]) and g[xx][yy] == '.':\r\n g[xx][yy] = 'B' if was_white else 'W'\r\n q.append([xx, yy, not was_white])\r\n return g\r\n\r\nres = dzy(g)\r\n\r\nfor l in res:\r\n print(''.join(l))", "n, m = map(int, input().split())\r\n\r\nfor i in range(n):\r\n s = input()\r\n for j in range(m):\r\n if (i + 1) % 2 != 0:\r\n if s[j] == '-':\r\n print('-', end='')\r\n elif (j + 1) % 2 == 0:\r\n print('B', end='')\r\n else:\r\n print('W', end='')\r\n else:\r\n if s[j] == '-':\r\n print('-', end='')\r\n elif (j + 1) % 2 != 0:\r\n print('B', end='')\r\n else:\r\n print('W', end='')\r\n else:\r\n print()\r\n", "from functools import reduce\r\nimport os\r\nimport sys\r\nfrom math import *\r\nfrom collections import *\r\nfrom fractions import *\r\nfrom bisect import *\r\nfrom heapq import*\r\nfrom io import BytesIO, IOBase\r\n\r\ninput = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\r\ndef value():return tuple(map(int,input().split()))\r\ndef arr():return [int(i) for i in input().split()]\r\ndef sarr():return [int(i) for i in input()]\r\ndef inn():return int(input())\r\n#----------------------------CODE------------------------------#\r\nn,m=value()\r\na=[['-' for i in range(m)] for j in range(n)]\r\ng=[]\r\nfor i in range(n):\r\n s=input()\r\n g+=[s]\r\nfor i in range(n):\r\n for j in range(m):\r\n if(g[i][j]=='.'):\r\n if((i+j)%2==0):\r\n a[i][j]='W'\r\n else:\r\n a[i][j]='B'\r\nfor i in range(n):\r\n print(*a[i],sep=\"\")\r\n", "n,m = map(int,input().split())\r\n\r\nmat = []\r\n\r\nfor _ in range(n):\r\n\ts = input()\r\n\tmat.append(list(s))\r\n\r\n\r\nfor i in range(n):\r\n\tfor j in range(m):\r\n\t\tif(mat[i][j]=='.'):\r\n\t\t\tif (i+j)%2==0: print(\"W\",end=\"\")\r\n\t\t\telse: print(\"B\",end=\"\")\r\n\t\telse: print(\"-\",end=\"\")\r\n\r\n\tprint()", "n, m = map(int, input().split())\r\nchess = []\r\nfor i in range(n):\r\n row = list(input())\r\n chess.append(row)\r\nans = []\r\nfor i in range(n):\r\n row = []\r\n for j in range(m):\r\n if chess[i][j] != \"-\":\r\n if i%2 == 0:\r\n if j % 2 == 0:\r\n row.append(\"W\")\r\n else:\r\n row.append(\"B\")\r\n else:\r\n if j%2 == 1:\r\n row.append(\"W\")\r\n else:\r\n row.append(\"B\")\r\n else:\r\n row.append(\"-\")\r\n ans.append(row)\r\nfor i in range(n):\r\n for j in range(m):\r\n print(ans[i][j], end = \"\")\r\n print()\r\n ", "def main():\n lines_amount, characters_amount = [int(num) for num in input().split()]\n valid_cells = ['B', 'W']\n for n in range(lines_amount):\n characters = list(input())\n for m in range(characters_amount):\n if (characters[m] == \".\"):\n characters[m] = valid_cells[(n + m) % 2]\n print(\"\".join(characters))\n\nif __name__ == \"__main__\":\n main()\n", "n,m = map(int,input().split())\r\nl=[]\r\nfor i in range(n):\r\n s = input()\r\n l.append(list(s))\r\n \r\nt = []\r\nfor j in range(n):\r\n t.append([])\r\n for i in range(m):\r\n if i%2==0:\r\n if j%2==0:\r\n t[j].append(\"B\")\r\n else:\r\n t[j].append(\"W\")\r\n else:\r\n if j%2==0:\r\n t[j].append(\"W\")\r\n else:\r\n t[j].append(\"B\")\r\n if l[j][i]==\"-\":\r\n t[j][i]=\"-\"\r\n\r\nfor i in range(n):\r\n print(\"\".join(t[i]))\r\n ", "size = [int(number) for number in input().split()]\r\n\r\nmatrix = []\r\n\r\nfor _ in range(size[0]):\r\n matrix.append(list(input()))\r\n\r\nfor i in range(size[0]):\r\n for j in range(size[1]):\r\n if matrix[i][j] == '.':\r\n if (i % 2 == 0 and j % 2 == 0) or (i % 2 != 0 and j % 2 != 0):\r\n matrix[i][j] = 'B'\r\n else:\r\n matrix[i][j] = 'W'\r\n\r\n\r\nfor i in matrix:\r\n print(\"\".join(i))\r\n", "import sys\ninput = sys.stdin.readline\n\n############ ---- Input Functions ---- ############\n\n\ndef inp(): # integer inputs\n return(int(input()))\n\n\ndef inlt(): # list inputs\n return(list(map(int, input().split())))\n\n\ndef insr(): # string inputs\n s = input()\n return(list(s[:len(s) - 1]))\n\n\ndef invr(): # integer variable inputs\n return(map(int, input().split()))\n\n\ndef main():\n n, m = inlt()\n chars = [\"W\", \"B\"]\n final_string = \"\"\n for i in range(n):\n line = list(input())[0:-1]\n for j in range(m):\n if line[j] == \".\":\n line[j] = chars[(i+j) % 2]\n final_string += (\"\".join(line))+\"\\n\"\n print(final_string)\n\n\nif __name__ == \"__main__\":\n main()\n\n\n# (0+0)%2 = 0\n# (0+1)%2 = 1\n# (1+0)%\n", "\r\nn, m = [int(i) for i in input().split(' ')]\r\nmatrix = [];\r\nfor i in range(0, n, 1):\r\n matrix.append([]);\r\n entrada = [];\r\n for letra in input():\r\n entrada.append(letra)\r\n for j in range(0, len(entrada), 1):\r\n matrix[i].append(entrada[j]);\r\n\r\n if (matrix[i][j] == '.'):\r\n if ((i + j) % 2 == 0):\r\n matrix[i][j] = 'B'\r\n else:\r\n matrix[i][j] = 'W'\r\n\r\nfor i in range(n):\r\n saida = \"\";\r\n for j in range(m):\r\n saida += matrix[i][j];\r\n print(saida);\r\n", "n,m = map(int,input().split())\r\nt=[]\r\nfor i in range(n):\r\n s = input()\r\n s = list(s)\r\n t.append(s)\r\nfor i in range(n):\r\n for j in range(m):\r\n if (i+j)%2==0 and t[i][j]==\".\":\r\n t[i][j]=\"W\"\r\n elif (i+j)%2!=0 and t[i][j]==\".\":\r\n t[i][j]=\"B\"\r\n else:\r\n t[i][j]=\"-\"\r\nfor i in range(n):\r\n for j in range(m):\r\n print(t[i][j],end=\"\")\r\n print()", "n, m = map(int, input().split())\r\nmat = []\r\nfor i in range(0, n):\r\n s = list(input())\r\n mat.append(s)\r\nfor i in range(0, n):\r\n for j in range(0, m):\r\n if(mat[i][j] == \".\"):\r\n if((i+j)%2==0):\r\n mat[i][j] = \"W\"\r\n else:\r\n mat[i][j] = \"B\"\r\nfor i in mat:\r\n print(\"\".join(i))", "rows, cols = map(int, input().split())\r\ngrid = [input() for _ in range(rows)]\r\n\r\nfor i in range(rows):\r\n for j in range(cols):\r\n if grid[i][j] == '.':\r\n colors = ['B', 'W']\r\n print(colors[i % 2 ^ j % 2],end='')\r\n else:\r\n print('-',end='')\r\n print()", "import functools\n#read m,n\n#create a 2d array sol=[[] for x in range(n)]\n\n#all even rows in the array are BWBW until end\n#all odd rows are WBWB until end\n\n#for each i in range(m):\n #read the row\n #for j in row\n #if the row has a dash\n #sol[i][j]='-'\n\n#return sol\n\nm,n = [int(x) for x in input().split()]\nsol = [['B']*n for x in range(m)]\n#print(sol)\nfor ind,arr in enumerate(sol):\n #if the row is an even row\n if ind%2==0:\n #iterate the arr\n for x in range(len(arr)):\n #make the even indexes W so we get WBWBWBWB\n if x%2==0:\n arr[x]='W'\n #if the row is odd\n else:\n for x in range(len(arr)):\n #make the odd indexes W so we get BWBWBWBW\n if x%2==1:\n arr[x]='W'\n\n#read each row in m\n#read the row into arr\n#for col in arr\n#if col arr[col] == '-'\n#then sol[row][col]=='-'\n#print(sol)\nfor row in range(m):\n arr = [x for x in input()]\n # print(arr)\n for col in range(n):\n \n if arr[col] != '.':\n # print(arr[col])\n sol[row][col]='-'\n\nfor x in range(len(sol)):\n s=''\n for y in range(len(sol[x])):\n s+=sol[x][y]\n print(s)\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,m=map(int,input().split())\r\nma=[list(input()) for _ in range(n)]\r\nfor i in range(n):\r\n for j in range(m):\r\n if ma[i][j]==\".\":\r\n if i%2==0:\r\n if j%2==0:\r\n ma[i][j]=\"B\"\r\n else:\r\n ma[i][j]=\"W\"\r\n else:\r\n if j%2==0:\r\n ma[i][j]=\"W\"\r\n else:\r\n ma[i][j]=\"B\"\r\nfor i in ma:\r\n print(''.join(i))\r\n \r\n \r\n", "row, col = map(int, input().split())\r\n\r\nturn = 1\r\nfor i in range(row):\r\n s = list(input())\r\n cur = 'W' if turn==1 else 'B'\r\n for j in range(0, col, 2):\r\n if s[j] == '.':\r\n s[j] = cur\r\n \r\n cur = 'W' if cur=='B' else 'B'\r\n for j in range(1, col, 2):\r\n if s[j] == '.':\r\n s[j] = cur\r\n\r\n turn *= -1\r\n print(''.join(s))", "n, m = input().split()\nn, m = int(n), int(m)\n\nchessboard = []\n\nfor i in range(n):\n a = list(input())\n chessboard.append(a)\n\n\ndirections = [(0,-1), (0,+1), (-1,0), (+1,0)]\n\n\nvisitado = []\nfor i in range(n):\n aux = []\n for j in range(m): aux.append(0)\n visitado.append(aux)\n \n\nqueue = [] #Initialize a queue\ncores = [\"B\",\"W\"]\n\ndef bfs(chessboard, inicio):\n queue.append((inicio, 0))\n\n while queue:\n pos, cor = queue.pop(0) \n\n if chessboard[pos[0]][pos[1]] == \".\":\n chessboard[pos[0]][pos[1]] = cores[cor]\n\n for d in directions:\n if -1 < pos[0] + d[0] and pos[0] + d[0] < n:\n if -1 < pos[1] + d[1] and pos[1] + d[1] < m:\n # quer dizer que a posição vizinha existe\n x, y = pos[0] + d[0], pos[1] + d[1]\n\n if not visitado[x][y]:\n visitado[x][y] = 1\n queue.append(((x,y), (cor+1)%2))\n\ninicio = (0,0)\nbfs(chessboard, inicio)\n\nfor i in range(n):\n string = \"\"\n for j in range(m):\n string += chessboard[i][j]\n print(string)", "'''Copyright © 2021 Rishabh Rao.\r\nAll Rights Reserved.'''\r\n\r\nimport sys\r\nMOD = 1000000007\r\ninp = sys.stdin.readline\r\ndef ii(): return int(inp())\r\ndef iis(): return [int(i) for i in inp().split()]\r\n\r\n\r\nn, m = iis()\r\nWB = \"WB\" * m\r\nBW = \"BW\" * m\r\nfor i in range(n):\r\n line = inp().strip()\r\n out = \"\"\r\n for j, char in enumerate(line):\r\n if char == \"-\":\r\n out += \"-\"\r\n continue\r\n if i % 2 == 0:\r\n out += WB[j]\r\n else:\r\n out += BW[j]\r\n print(out)\r\n", "n, m = [int(i) for i in input().split(\" \")]\r\nchessmans = ['W', 'B']\r\nfilled_board = []\r\nfor i in range(n):\r\n row = list(input())\r\n for j in range(m):\r\n if row[j] == '.':\r\n row[j] = chessmans[(i + j) % 2]\r\n filled_board.append(\"\".join(row))\r\n\r\nfor row in filled_board:\r\n print(row)", "r,c = map(int,input().split())\r\nans = ''\r\nbw = ['B','W']\r\nflg = 0\r\nfor i in range(r):\r\n cb = input()\r\n if not cb:\r\n break\r\n for e in range(len(cb)):\r\n if cb[e] == '-':\r\n ans += '-'\r\n else:\r\n ans+=bw[(i+e)%2]\r\n print(ans)\r\n ans = ''\r\nprint(ans)\r\n", "'''\n R E X\n\n Date - 28th May 2021\n\n\n @author:\n CodeForces -> kunalverma19\n CodeChef -> kunalverma_19\n AtCoder -> TLKunalVermaRX\n'''\nimport sys\nimport re\nimport math\nMOD = 1000000007\ninp = lambda : map(int,input().split(' '))\nninp = lambda : int(input())\nsinp = lambda : input()\n# sys.stdin=open(\"input.txt\",\"r\")\nn,m=inp()\nres=['B','W']\nfor i in range(n):\n\ts=list(input())\n\tfor j in range(m):\n\t\tif s[j]=='.':\n\t\t\ts[j]=res[(i+j)%2]\n\tprint(''.join(s))\n\n\n\n\n", "n,m = map(int,input().split())\r\nlist = [input() for _ in range(n)]\r\n\r\nfor i in range(n):\r\n for j in range(m):\r\n if list[i][j]=='-':\r\n print('-',end='')\r\n else:\r\n if((i+j)%2==0):\r\n print('B',end='')\r\n else:\r\n print('W',end='')\r\n print()", "n,m= map(int,input().split())\r\nA=[]\r\nfor _ in range(n):\r\n A.append(list(input()))\r\nfor i in range(n):\r\n for j in range(m):\r\n if A[i][j]=='.':\r\n if (i+j)%2==0:\r\n A[i][j]='B'\r\n else:\r\n A[i][j]='W'\r\nfor i in range(n):\r\n print(''.join(A[i]))", "n, m = map(int, input().split())\n\ntabuleiro = []\nfor i in range(n):\n row = input()\n tabuleiro.append(row)\n\nresposta = [['-' for j in range(m)] for i in range(n)]\n\nfor i in range(n):\n for j in range(m):\n if tabuleiro[i][j] == '.' and resposta[i][j] == '-':\n if (i + j) % 2 == 0:\n resposta[i][j] = 'B'\n else:\n resposta[i][j] = 'W'\n for dx, dy in [(1, 0), (-1, 0), (0, 1), (0, -1)]:\n x, y = i + dx, j + dy\n if 0 <= x < n and 0 <= y < m and tabuleiro[x][y] == '.' and resposta[x][y] == '-':\n resposta[x][y] = 'B' if resposta[i][j] == 'W' else 'W'\n\nfor row in resposta:\n print(''.join(row))\n\t \t\t\t\t\t\t \t \t\t\t \t \t\t\t\t\t\t\t\t", "from io import StringIO\n\ndef main():\n n, m = map(int, input().split())\n chessmen = {1: 'B', -1: 'W'}\n chooser = 1\n shifter = -1 if m%2 == 0 else 1\n res = StringIO()\n for _ in range(n):\n for char in input():\n if char == '.':\n res.write(chessmen[chooser])\n else:\n res.write('-')\n chooser *= -1\n res.write('\\n')\n chooser *= shifter\n print(res.getvalue())\n del res\n\nmain()\n", "n,m=map(int,input().split())\r\nmat=[]\r\nfor i in range(n):\r\n s=input()\r\n s=list(s)\r\n mat.append(s)\r\nk=[] \t\t\r\nfor i in range(n):\r\n\tans=\"\"\r\n\tfor j in range(m):\r\n\t\tif(mat[i][j]!=\"-\"):\r\n\t\t if(i%2==0):\r\n\t\t \tif(j%2==0):\r\n\t\t \t\tans+=\"W\"\r\n\t\t \telse:\r\n\t\t \t ans+=\"B\"\r\n\t\t else:\r\n\t\t if(j%2!=0):\r\n\t\t ans+=\"W\"\r\n\t\t else:\r\n\t\t ans+=\"B\" \r\n\t\telse:\r\n\t\t ans+=\"-\" \t \t\r\n\t\t \t \r\n\tk.append(ans)\r\n\tans=\"\"\r\nfor i in k:\r\n print(i)", "from math import *\r\n\r\n\r\ndef main():\r\n n, m = map(int, input().split())\r\n s = []\r\n for i in range(n):\r\n s.append(list(input()))\r\n ex = [\"\" for i in range(n)]\r\n f = False\r\n for i in range(n):\r\n for j in range(m):\r\n ex[i] += 'W'*f + 'B'*(not f)\r\n f = not f\r\n if m % 2 == 0:\r\n f = not f\r\n for i in range(n):\r\n for j in range(m):\r\n if s[i][j] == '.':\r\n s[i][j] = ex[i][j]\r\n print('\\n'.join(map(lambda x: ''.join(x), s)))\r\n\r\n\r\nif __name__ == '__main__':\r\n main()", "n, m = map(int, input().split())\r\n\r\ncm = ['B', 'W']\r\nfor r in range(n):\r\n s = input()\r\n for c in range(m):\r\n x = ((r+c)%2)\r\n if s[c] == '.': print(cm[x], end=\"\")\r\n else: print(\"-\", end=\"\")\r\n print()\r\n", "n,m = map(int,input().split())\r\na = ['W','B']\r\nfor i in range(n):\r\n b = list(input())\r\n for j in range(m):\r\n if b[j] == '.':\r\n b[j] = a[(i+j)%2]\r\n print(''.join(b))", "n,m = map(int,input().split())\nb = []\nfor _ in range(n):\n b.append(list(input()))\n\nfor i in range(n):\n for j in range(m):\n if b[i][j] == '.':\n if (i+j)%2 == 0:\n print('W',end='')\n else:\n print('B',end='')\n else:\n print('-',end='')\n print('')", "n,m=map(int,input().split())\r\narr=[]\r\nfor i in range(n):\r\n arr.append(list(input()))\r\nfor i in range(n):\r\n if i%2==0:\r\n first=\"B\"\r\n second=\"W\"\r\n else:\r\n first=\"W\"\r\n second=\"B\"\r\n for j in range(m):\r\n if arr[i][j]=='.':\r\n if j%2==0:\r\n arr[i][j]=first\r\n else:\r\n arr[i][j]=second\r\nfor i in range(n):\r\n for j in range(m):\r\n print(arr[i][j],end='')\r\n print()\r\n ", "h, w = map(int, input().split())\nfor y in range(h):\n row = input()\n print(\n \"\".join(\n \"-\" if c == \"-\" else \"W\" if (y ^ x) & 1 else \"B\" for x, c in enumerate(row)\n )\n )\n", "str_line=input()\r\nlista = [int(a) for a in str_line.split(\" \")]\r\nn,m = lista[0],lista[1]\r\ntab = list()\r\nfor i in range(n):\r\n tab.append([char for char in input()])\r\n\r\nletters = ['W', 'B']\r\nfor i in range(n):\r\n k = i%2\r\n for j in range(m):\r\n if( tab[i][j] != \"-\" ):\r\n tab[i][j] = letters[(j+k)%2]\r\nfor i in range(n):\r\n for j in range(m):\r\n print(tab[i][j],end = '')\r\n print()\r\n", "n,m=map(int,input().split())\r\nl=[]\r\nans=[]\r\na=0\r\nfor i in range(n):\r\n s=input()\r\n x=''\r\n l.append(s)\r\n if a==0:\r\n st='B'\r\n pt='W'\r\n else:\r\n st='W'\r\n pt='B'\r\n for i in range(m):\r\n if i%2==0:\r\n if s[i]=='-':\r\n x+='-'\r\n else:\r\n x+=st\r\n else:\r\n if s[i]=='-':\r\n x+='-'\r\n else:\r\n x+=pt\r\n a^=1\r\n ans.append(x)\r\nfor i in ans:\r\n print(*i,sep='')\r\n \r\n \r\n \r\n\r\n \r\n \r\n", "def solution():\r\n\tn,m=map(int,input().split())\r\n\r\n\tarr=[]\r\n\tfor i in range(n):\r\n\t\tk=[char for char in input()]\r\n\t\tarr.append(k)\r\n\t\r\n\r\n\t\r\n\r\n\t\r\n\r\n\tfor i in range(n):\r\n\t\tfor j in range(m):\r\n\t\t\tif arr[i][j]=='.':\r\n\t\t\t\tif (i+j)&1:\r\n\t\t\t\t\tarr[i][j]='W'\r\n\t\t\t\telse:\r\n\t\t\t\t\tarr[i][j]='B'\r\n\r\n\r\n\tfor i in range(n):\r\n\t\tprint(''.join(arr[i]))\r\n\r\n\r\n\treturn\r\n\r\n\r\nsolution()\r\n", "import sys;out=sys.stdout.write\r\nr,c=map(int,input().rstrip().split());arr=[]\r\nfor _ in range(r):arr.append(str(input()))\r\nfor _ in range(r):\r\n if _ %2==0:\r\n for __ in range(c):\r\n if arr[_][__]=='-':out('-')\r\n elif __%2==0:out('B')\r\n else:out('W')\r\n else:\r\n for __ in range(c):\r\n if arr[_][__]=='-':out('-')\r\n elif __%2!=0:out('B')\r\n else:out('W')\r\n out(\"\\n\") ", "nm = input().split(\" \")\r\nn = int(nm[0])\r\nm = int(nm[1])\r\nmp = []\r\nfor i in range(n):\r\n line = input()\r\n mp.append(list(line))\r\n for j in range(m):\r\n if(mp[i][j]==\".\"):\r\n if((j+i)%2==0):\r\n mp[i][j]='B'\r\n else:\r\n mp[i][j]='W'\r\n\r\nfor i in range(n):\r\n answer = \"\" \r\n for j in range(m):\r\n answer += mp[i][j]\r\n print(answer)", "n, m = map(int, input().split())\r\nans = []\r\nfor i in range(n):\r\n tmp = input()\r\n# print(tmp)\r\n prev = \"W\" if i % 2 == 0 else \"B\"\r\n ans_tmp = []\r\n for i in range(len(tmp)):\r\n toPut = \"B\" if prev == \"W\" else \"W\"\r\n prev = \"B\" if toPut == \"B\" else \"W\"\r\n if(tmp[i] == \".\"):\r\n ans_tmp.append(toPut)\r\n else:\r\n ans_tmp.append(\"-\")\r\n ans.append(ans_tmp)\r\nfor ele in ans:\r\n for i in range(m):\r\n print(ele[i], end=\"\")\r\n print()\r\n", "# CONSTANTS\n\nWHITE = \"W\"\nBLACK = \"B\"\nINVALID_CELL = \"-\"\nVALID_CELL = \".\"\n\nfield_shape_input = input()\n\nn, m = field_shape_input.split(' ')\n\nn = int(n)\nm = int(m)\n\nideal_chessboard = []\n#switch_color_flag = True\nfor i in range(0,n):\n row_input = input()\n row_arr = [char for char in row_input]\n\n ideal_row = \"\"\n for j, item in enumerate(row_arr):\n switcher = ((i+j) % 2) == 0\n cell_item = None\n \n if item == VALID_CELL:\n if switcher:\n cell_item = WHITE\n else:\n cell_item = BLACK\n else:\n cell_item = INVALID_CELL\n\n ideal_row += cell_item\n \n ideal_chessboard.append(ideal_row)\n\nfor row in ideal_chessboard:\n print(row)\n\n \n", "r, c = input().split()\r\nr, c = int(r), int(c)\r\n\r\nrow_list = \"\"\r\n\r\nfor i in range(r):\r\n inp = input()\r\n row = \"\"\r\n for j, s in enumerate(inp):\r\n if s == \"-\":\r\n row += \"-\"\r\n elif (i + j) % 2:\r\n row += \"B\"\r\n else:\r\n row += \"W\"\r\n row_list += row + \"\\n\"\r\n\r\nprint(row_list)\r\n", "n,m = map(int,input().split())\r\nl = []\r\nfor i in range(n):\r\n l.append(list(input()))\r\nfor i in range(n):\r\n for j in range(m):\r\n if l[i][j]=='.':\r\n if i%2==0 and j%2==0:\r\n l[i][j]='W'\r\n elif i%2==0:\r\n l[i][j]='B'\r\n else:\r\n if j%2==0:\r\n l[i][j]='B'\r\n else:\r\n l[i][j]='W'\r\nfor i in l:\r\n print(''.join(i))", "from collections import deque\n\nn, m = map(int, input().split())\ntabuleiro = [input() for _ in range(n)]\n\ncores = [['-' for _ in range(m)] for _ in range(n)]\n\nfor i in range(n):\n for j in range(m):\n if tabuleiro[i][j] == '.' and cores[i][j] == '-':\n fila = deque([(i, j, 'W')])\n while fila:\n x, y, cor = fila.popleft()\n if cores[x][y] == '-':\n cores[x][y] = cor\n for dx, dy in [(1, 0), (-1, 0), (0, 1), (0, -1)]:\n nx, ny = x + dx, y + dy\n if 0 <= nx < n and 0 <= ny < m and tabuleiro[nx][ny] == '.':\n fila.append((nx, ny, 'B' if cor == 'W' else 'W'))\n\nfor i in range(n):\n print(''.join(cores[i]))\n\t\t \t \t\t \t\t\t\t \t\t\t \t\t \t\t \t\t\t\t", "# thinking of backtracking, but for 100x100 it could be too slow\n# also could be greedy\nm, n = map(int, input().split())\nmat = []\nfor _ in range(m):\n arr = list(input())\n mat.append(arr)\ncolor = ['B', 'W']\nans = []\nfor i in range(m):\n for j in range(n):\n if mat[i][j] != '-':\n mat[i][j] = (color[(i+j)%2])\n print(mat[i][j], end='')\n print()\n\n\n\n", "n, m = map(int,input().split())\np = []\nfor i in range(n):\n s = list(input())\n p += [s]\n#vis = [[ 0 for i in range(m)] for j in range(m)]\nx = 'W'\nx1 = 'B'\nsm = 0\nok = 0\nfor i in range(n):\n x,x1 = x1,x\n for j in range(m):\n if p[i][j] == '.':\n if j % 2 == 0:\n p[i][j] = x\n else:\n p[i][j] = x1\n \n \nfor i in p:\n for j in i:\n print(j,end=\"\")\n print()\n\n", "n,m=map(int,input().split())\r\n\r\nchess=['W','B']\r\n\r\nfor i in range(n):\r\n\tgrid = list(input())\r\n\r\n\tfor j in range(m):\r\n\t\tif grid[j] == '.':\r\n\t\t\tgrid[j] = chess[(i+j)%2]\r\n\r\n\tprint(''.join(grid))", "nm = input().split()\nn = int(nm[0])\nm = int(nm[1])\nresult = \"\"\nfor i in range(n):\n s = \"\"\n bline = input()\n for x in range(m):\n if bline[x] == \"-\":\n s += \"-\"\n else:\n if (i+x) % 2 == 0:\n s += \"B\"\n else:\n s += \"W\"\n result += s + \"\\n\"\nprint(result, end='')\n \t\t \t \t\t\t\t\t \t \t \t \t\t \t\t", "GOOD_SQUARE = \".\"\r\nBAD_SQUARE = \"-\"\r\n\r\nBLACK_CELL = \"B\"\r\nWHITE_CELL = \"W\"\r\n\r\ndef solve(chessboard):\r\n result = []\r\n for y, line in enumerate(chessboard):\r\n result_line = []\r\n for x, square in enumerate(line):\r\n cell = BLACK_CELL\r\n\r\n if square == BAD_SQUARE:\r\n cell = BAD_SQUARE\r\n\r\n if square == GOOD_SQUARE and (x + y) % 2 != 0:\r\n cell = WHITE_CELL\r\n\r\n result_line.append(cell)\r\n\r\n result.append(result_line)\r\n\r\n\r\n return result\r\n\r\ndef main():\r\n n_lines, _ = [int(i) for i in input().split()]\r\n\r\n chessboard = []\r\n for _ in range(n_lines):\r\n chessboard.append(list(input()))\r\n\r\n result = solve(chessboard)\r\n\r\n for line in result:\r\n print(\"\".join(line))\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "# https://codeforces.com/problemset/problem/445/A\n\n\n\nif __name__ == '__main__':\n n, m = map(int, input().split())\n\n T = [None for _ in range(n)]\n\n for i in range(n):\n T[i] = input() + ' '\n \n for i in range(n):\n s = T[i]\n for j in range(m):\n if s[j] == '.':\n if i % 2 == 0:\n if j % 2 == 0:\n s = s[:j] + 'B' + s[j+1:]\n else:\n s = s[:j] + 'W' + s[j+1:]\n else:\n if j % 2 == 0:\n s = s[:j] + 'W' + s[j+1:]\n else:\n s = s[:j] + 'B' + s[j+1:]\n print(s[:-1])\n\n\n", "input_string = list(map(int, input().split()))\r\nn = input_string[0]\r\nm = input_string[1]\r\nboard = []\r\nfor _ in range(n):\r\n temp = list(input())\r\n board.append(temp)\r\nminusLoc = []\r\nfor i in range(n):\r\n for j in range(m):\r\n if (board[i][j] == '-'):\r\n newList = [i, j]\r\n minusLoc.append(newList)\r\n\r\ndef helper(curLetter, curRow, curCol):\r\n if (curRow >= n):\r\n return\r\n if (curCol >= m):\r\n return\r\n elif (board[curRow][curCol] == '.' or board[curRow][curCol] == '-'):\r\n if (curLetter == 'B'):\r\n board[curRow][curCol] = 'B'\r\n helper('W',curRow + 1, curCol)\r\n helper('B',curRow + 1, curCol + 1)\r\n helper('W',curRow, curCol + 1)\r\n elif (curLetter == 'W'):\r\n board[curRow][curCol] = 'W'\r\n helper('B',curRow + 1, curCol)\r\n helper('W',curRow + 1, curCol + 1)\r\n helper('B',curRow, curCol + 1)\r\n else:\r\n return\r\n\r\nhelper('W', 0, 0)\r\nfor i, row in enumerate(board):\r\n string = \"\"\r\n for j, char in enumerate(row):\r\n isMinus = False\r\n for location in minusLoc:\r\n if (location == [i, j]):\r\n isMinus = True\r\n break\r\n if (isMinus):\r\n string += '-'\r\n else:\r\n string += char\r\n print(string)\r\n\r\n", "n, m = map(int, input().split())\r\n\r\nboard = []\r\nfor i in range(n):\r\n board.append(list(input()))\r\n\r\npatterns = ['B', 'W']\r\n \r\nfor i in range(n):\r\n for j in range(m):\r\n if board[i][j] == '.':\r\n board[i][j] = patterns[(i + j) & 1 == 1]\r\n \r\nfor i in range(n):\r\n print(''.join(board[i]))", "n, m = list(map(int, input().split()))\r\narr100 = []\r\n'''for kk in range(n):\r\n arr100.append([])'''\r\nfor _ in range(n):\r\n arr100.append([])\r\n #arr100.append(arr10)\r\n #print(arr100)\r\n arr = list(map(str, list(input())))\r\n #print(arr)\r\n for k in range(m):\r\n #print(_, k)\r\n if arr[k] == '-':\r\n arr100[_].append('-')\r\n else:\r\n if _ % 2 == 0:\r\n if k % 2 == 0:\r\n arr100[_].append('B')\r\n else:\r\n arr100[_].append('W')\r\n else:\r\n if k % 2 == 0:\r\n arr100[_].append('W')\r\n else:\r\n arr100[_].append('B')\r\n print(''.join(arr100[_]))\r\n#print(arr100)\r\n\r\n", "n,m=map(int,input().split())\r\nposi=['W','B']\r\nfor i in range(n):\r\n st = \"\"\r\n s = input()\r\n for j in range(m):\r\n if s[j]=='.':\r\n st += posi[(i+j)%2]\r\n else:\r\n st += \"-\"\r\n \r\n print(st)", "nm = input().split(\" \")\r\nn,m = [int(x) for x in nm]\r\nchessboard = []\r\nfor i in range(n):\r\n line = list(input())\r\n chessboard.append(line)\r\n \r\navalaibles = []\r\nvalidB = ['.','W','-']\r\nvalidW = ['.','B','-']\r\n \r\n \r\nqueue = []\r\nfor k in range(n):\r\n for l in range(m):\r\n if chessboard[k][l] == '.':\r\n chessboard[k][l] = 'B'\r\n queue.insert(0,(k,l))\r\n \r\n while not(queue == []):\r\n (i,j) = queue.pop()\r\n if chessboard[i][j] == 'B':\r\n \r\n if i-1 < 0:\r\n pass\r\n elif chessboard[i - 1][j] == '.':\r\n chessboard[i - 1][j] = 'W'\r\n queue.insert(0,(i - 1,j))\r\n \r\n if i + 1 == n:\r\n pass\r\n elif chessboard[i + 1][j] == '.':\r\n chessboard[i + 1][j] = 'W'\r\n queue.insert(0,(i + 1,j))\r\n \r\n if j-1 < 0:\r\n pass\r\n elif chessboard[i][j - 1] == '.':\r\n chessboard[i][j - 1] = 'W'\r\n queue.insert(0,(i,j - 1))\r\n \r\n if j + 1 == m:\r\n pass\r\n elif chessboard[i][j + 1] == '.':\r\n chessboard[i][j + 1] = 'W'\r\n queue.insert(0,(i,j + 1))\r\n \r\n elif chessboard[i][j] == 'W':\r\n \r\n if i-1 < 0:\r\n pass\r\n elif chessboard[i - 1][j] == '.':\r\n chessboard[i - 1][j] = 'B'\r\n queue.insert(0,(i - 1,j))\r\n \r\n if i + 1 == n:\r\n pass\r\n elif chessboard[i + 1][j] == '.':\r\n chessboard[i + 1][j] = 'B'\r\n queue.insert(0,(i + 1,j))\r\n \r\n if j-1 < 0:\r\n pass\r\n elif chessboard[i][j - 1] == '.':\r\n chessboard[i][j - 1] = 'B'\r\n queue.insert(0,(i,j - 1))\r\n \r\n if j + 1 == m:\r\n pass\r\n elif chessboard[i][j + 1] == '.':\r\n chessboard[i][j + 1] = 'B'\r\n queue.insert(0,(i,j + 1))\r\n\r\nfor i in range(n):\r\n row = ''\r\n for j in range(m):\r\n row += chessboard[i][j]\r\n print(row)", "s = input().split()\r\n(n,m) = (int(i) for i in s)\r\n\r\nfor i in range(n):\r\n\ts = input()\r\n\tr = ''\r\n\tfor j in range(m):\r\n\t\tif(s[j] == '.'):\r\n\t\t\tif((i+j)&1):\r\n\t\t\t\tr += 'B'\r\n\t\t\telse:\r\n\t\t\t\tr += 'W'\r\n\t\telse:\r\n\t\t\tr += '-'\r\n\tprint(r)\r\n\r\n\r\n\r\n\r\n\r\n", "n, m=map(int,input().split())\n\nDOT='.'\nCHARS=['W','B']\n\nfor i in range(n):\n\tentry=list(input())\n\tfor j in range(m):\n\t\tif entry[j]==DOT:\n\t\t\tentry[j]=CHARS[(i+j)%2]\n\tprint(''.join(entry))", "n,m=map(int,input().split())\r\nl1=[]\r\nfor i in range(n) :\r\n l=list(map(str,input()))\r\n l1.append(l)\r\ni=0\r\nwhile i<n :\r\n j=0\r\n while j<m :\r\n if l1[i][j]==\".\" :\r\n if j%2==0 and i%2==0 :\r\n l1[i][j]=\"B\"\r\n elif j%2==0 and i%2!=0 :\r\n l1[i][j]=\"W\"\r\n elif j%2!=0 and i%2==0 :\r\n l1[i][j]=\"W\"\r\n elif j%2!=0 and i%2!=0 :\r\n l1[i][j]=\"B\"\r\n print(l1[i][j],end=\"\")\r\n j+=1\r\n print()\r\n i+=1", "n,m=list(map(int,input().strip().split()))\r\nq=[]\r\nfor i in range(n):\r\n q.append(list(input().strip()))\r\nans=[['B'if (i+j)%2==0 else 'W' for i in range(m)]for j in range(n)]\r\nfor i in range(n):\r\n for j in range(m):\r\n if q[i][j]=='-':\r\n ans[i][j]='-'\r\nfor i in ans:\r\n print(*i, sep='')", "n,m=map(int,input().split())\r\nf=[]\r\n\r\nfor i in range(n):\r\n f.append(list(str(input())))\r\n\r\nfor i in range(n):\r\n for j in range(m):\r\n if f[i][j]==\".\":\r\n if (i+j)%2==0:\r\n f[i][j]=\"B\"\r\n else:\r\n f[i][j]=\"W\"\r\n print(f[i][j],end=\"\")\r\n print()", "n, m = map(int, input().split(' '))\r\n\r\nmatrix = []\r\nfor i in range(n):\r\n\r\n row = list(input())\r\n matrix.append(row)\r\n\r\nfor i, row in enumerate(matrix):\r\n for j, val in enumerate(row):\r\n if val == \".\":\r\n matrix[i][j] = \"B\" if (i+j)%2 == 0 else \"W\"\r\n\r\nfor row in matrix:\r\n print(''.join(row))", "n,m=map(int,input().split())\r\nr1=['B','W']*50\r\nr2=['W','B']*50\r\nflag = True\r\n\r\na=[]\r\nfor i in range(n):\r\n if flag:\r\n a.append(r1[:m])\r\n flag=False\r\n else:\r\n a.append(r2[:m])\r\n flag=True\r\nb=[]\r\nfor i in range(n):\r\n row=input()\r\n for j in range(m):\r\n if row[j]=='-':\r\n a[i][j]='-'\r\nfor i in a:\r\n for j in i:\r\n print(j,end='')\r\n print()\r\n", "# Dimensao do tabuleiro\nn, m = map(int, input().split())\ntabuleiro = []\n# Coloco as entradas no tabuleiro\nfor i in range(n):\n tabuleiro.append(input())\n# Crio a resposta povoada com '-'\nresposta = [['-'] * m for i in range(n)]\n# Preenche a matriz de resposta\nfor i in range(n):\n for j in range(m):\n # Se a célula atual é uma casa vazia e ainda não foi preenchida\n if tabuleiro[i][j] == '.':\n # Se for par coloca B se não W assim garanto que nunca terá uma do lado da outra\n # da mesma cor \n if (i + j) % 2 == 0:\n resposta[i][j] = 'B'\n else:\n resposta[i][j] = 'W'\n\nfor i in range(n):\n print(''.join(resposta[i]))\n\t \t \t \t \t \t \t\t\t\t\t \t\t", "n, m = map(int, input().split())\n\ncharacters = ['W','B']\n\nfor element in range(n):\n\tsequence_chars = list(input())\n\tfor j in range(m):\n\t\tif sequence_chars[j] == '.':\n\t\t\tsequence_chars[j]= characters[(element+j) % 2 ]\n\tprint(''.join(sequence_chars))", "# from collections import Counter\r\ndef solve():\r\n n,m=map(int,input().split())\r\n l=[]\r\n for i in range(n):\r\n s=input()\r\n s1=\"\"\r\n if i%2==0:\r\n for j in range(m):\r\n if s[j]!='-':\r\n if j%2==0:\r\n s1+='W'\r\n else:\r\n s1+='B'\r\n else:\r\n s1+='-'\r\n else:\r\n for j in range(m):\r\n if s[j]!='-':\r\n if j%2==0:\r\n s1+='B'\r\n else:\r\n s1+='W'\r\n else:\r\n s1+='-'\r\n l.append(s1)\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\nsolve()", "n,m=map(int,input().split())\r\nl1=[]\r\nfor i in range(n):\r\n l2=list(input())\r\n for j in range(m):\r\n if l2[j]=='.':\r\n if (i+j)%2==0:\r\n l2[j]='W'\r\n else :\r\n l2[j]='B'\r\n l1.append(l2)\r\nfor k in l1:\r\n print(''.join(k))", "rows, columns = [int(x) for x in input().split()]\r\n\r\nmatrix = []\r\n\r\nfor i in range(rows):\r\n\r\n line = list(input())\r\n matrix.append(line)\r\n\r\n\r\nfor row in range(rows):\r\n rLine = \"\"\r\n for col in range(columns): \r\n if matrix[row][col] == \".\":\r\n if (row % 2 == 0):\r\n if (col % 2 == 0):\r\n rLine += \"B\"\r\n else:\r\n rLine += \"W\"\r\n else:\r\n if (col % 2 != 0):\r\n rLine += \"B\"\r\n else:\r\n rLine += \"W\"\r\n\r\n else:\r\n rLine += \"-\"\r\n print(rLine)\r\n ", "n=list(map(int,input().split()))\r\nx=[]\r\nfor i in range(n[0]):\r\n a=list(map(str,input()))\r\n x.append(a)\r\nfor i in range(n[0]):\r\n for j in range(n[1]):\r\n if(x[i][j]=='.'):\r\n if((i+j)%2==0):\r\n x[i][j]='B'\r\n else:\r\n x[i][j]='W'\r\nfor i in range(n[0]):\r\n for j in range(n[1]):\r\n print(x[i][j],end='')\r\n print()\r\n\r\n\r\n\r\n", "import math\r\nn,m = map(int,input().split())\r\ncount = 0\r\nlstn1 = ['B','W']*int(math.ceil(m/2))\r\nlstn2 = ['W','B']*int(math.ceil(m/2))\r\nfor i in range(n):\r\n lst = list(input())\r\n if count%2==0:\r\n for j in range(m):\r\n if lst[j]=='.':\r\n lst[j]=lstn1[j]\r\n else:\r\n for j in range(m):\r\n if lst[j]=='.':\r\n lst[j]=lstn2[j]\r\n print(''.join(lst))\r\n count += 1", "n,m=map(int,input().split())\nlista=[]\n\nfor j in range(n):\n\tstr1=input()\n\tlista.append(str1)\n\nfor i in range(len(lista)):\n\tstring=lista[i]\n\tfor j in range(len(string)):\n\t\tmystr=\"-\"\n\t\tif(i%2==0 and j%2==0):\n\t\t\tmystr=\"B\"\n\t\tif(i%2==0 and j%2!=0):\n\t\t\tmystr=\"W\"\n\t\tif(i%2!=0 and j%2==0):\n\t\t\tmystr=\"W\"\n\t\tif(i%2!=0 and j%2!=0):\n\t\t\tmystr=\"B\"\n\t\tif(string[j]==\"-\"):\n\t\t\tprint(\"-\",end=\"\")\n\t\telse:\n\t\t\tprint(mystr,end=\"\")\n\tprint()\n\n", "nm=input()\r\nn=int(nm.split()[0])\r\nm=int(nm.split()[1])\r\ninp=[[i for i in input()] for i in range(n)]\r\narr=[[\"\" for _ in range(m)] for _ in range(n)]\r\nfor i in range(n):\r\n for j in range(m):\r\n if inp[i][j]=='-':\r\n arr[i][j]='-'\r\n elif (i+j)%2==0:\r\n arr[i][j]='W'\r\n else:\r\n arr[i][j]='B'\r\narr1=[\"\".join(i) for i in arr]\r\narr2=\"\\n\".join(arr1)\r\nprint(arr2)", "n, m = map(int, input().split())\r\n\r\nchess_board = []\r\nfor _ in range(n):\r\n row = [i for i in input()]\r\n chess_board.append(row)\r\n\r\nfor i in range(n):\r\n for j in range(m):\r\n\r\n if chess_board[i][j] == '.':\r\n if (i+j) % 2 == 0:\r\n chess_board[i][j] = 'W'\r\n else: chess_board[i][j] = 'B'\r\n print(\"\".join(chess_board[i]))\r\n\r\n\r\n\r\n\r\n", "def main():\r\n n, m = map(int, input().split())\r\n\r\n board = []\r\n\r\n for i in range(n):\r\n board.append(list(input()))\r\n\r\n line = []\r\n revline = []\r\n\r\n w = True\r\n for i in range(m):\r\n if w:\r\n w = False\r\n line.append('W')\r\n revline.append('B')\r\n else:\r\n w = True\r\n line.append('B')\r\n revline.append('W')\r\n\r\n\r\n newboard = []\r\n\r\n flag = True\r\n for i in range(n):\r\n if flag:\r\n row = []\r\n for j in range(m):\r\n if board[i][j] != '-':\r\n row.append(line[j])\r\n else:\r\n row.append('-')\r\n flag = False\r\n newboard.append(row)\r\n else:\r\n row = []\r\n for j in range(m):\r\n if board[i][j] != '-':\r\n row.append(revline[j])\r\n else:\r\n row.append('-')\r\n newboard.append(row)\r\n flag = True\r\n\r\n\r\n\r\n for j in newboard:\r\n print(''.join(j))\r\n\r\n\r\n\r\nmain()", "# https://codeforces.com/problemset/problem/445/A\n\nrow, col = [int(num) for num in input().split()]\n\nboard = []\nfor r in range(row):\n board.append([ch for ch in input()])\n\neven = \"BW\" * (col//2)\neven += \"B\" if col%2==1 else \"\"\n\nodd = \"WB\" * (col//2)\nodd += \"W\" if col%2==1 else \"\"\n\nresult = []\nfor r in range(row):\n result.append([ch for ch in (even if r%2==0 else odd)])\n\nr=0\nwhile(r<row):\n c = 0\n while(c<col):\n if(board[r][c]=='-'):\n result[r][c]='-'\n c += 1\n r += 1\n\nr=0\nwhile(r<row):\n c = 0\n while(c<col):\n print(result[r][c],end=\"\")\n c += 1\n print()\n r += 1\n\n", "row_count, coloumn_count = map(int, input().split())\r\nfor row_number in range(1, row_count+1):\r\n current_row = [number for number in input()]\r\n print_row = ''\r\n for coloumn_number in range(1, coloumn_count+1):\r\n if current_row[coloumn_number-1] == '-':\r\n print_row +='-'\r\n else:\r\n print_row += \"B\" if (row_number+coloumn_number) % 2 == 0 else \"W\"\r\n print(print_row)\r\n", "#dzy loves chessboard\n\nx = [int(i) for i in input().split(\" \")]\n\nfor i in range(x[0]):\n a = input()\n result = \"\"\n for j in range(x[1]):\n if(a[j] == \".\"):\n if((i+j) % 2 == 1):\n result += \"W\"\n else:\n result += \"B\"\n else:\n result += \"-\"\n\n \n print(result)", "entrada = input().split()\nn = int(entrada[0])\nm = int(entrada[1])\ns = \"\"\n\nfor i in range(n):\n s = list(input())\n\n for j in range(m):\n if s[j] == '.':\n if (i + j) % 2 == 1:\n s[j] = 'W'\n else:\n s[j] = 'B'\n\n s = \"\".join(s) \n print(s)", "a,b=map(int,input().split())\r\nc=['W','B']\r\n\r\nfor i in range(a):\r\n\tlista = list(input())\r\n\tfor j in range(b):\r\n\t\tif lista[j]=='.':\r\n\t\t\tlista[j] = c[(i+j)%2]\r\n\tprint(''.join(lista))", "n,m=map(int,input().split())\r\nx=0\r\nb=''\r\nfor _ in range(n):\r\n x+=1\r\n a=''\r\n y=0\r\n for i in input():\r\n y+=1\r\n if i=='-':\r\n a+='-'\r\n else:\r\n a+=['B','W'][(x+y)%2]\r\n b+=a+'\\n'\r\nprint(b)", "n,m= list(map(int,input().split()))\r\n\r\nans=[]\r\n\r\nchecker={}\r\n\r\n\r\nfor i in range(n):\r\n arr= list(input())\r\n pre=None\r\n \r\n for j in range(m):\r\n k=str(i-1)+'_'+str(j)\r\n \r\n if k in checker:\r\n if checker[k]=='B':\r\n checker[str(i)+'_'+str(j)]='W'\r\n if arr[j]!='-':\r\n arr[j]='W'\r\n \r\n \r\n else:\r\n checker[str(i)+'_'+str(j)]='B'\r\n if arr[j]!='-':\r\n arr[j]='B'\r\n else:\r\n \r\n if pre==None:\r\n checker[str(i)+'_'+str(j)]='B'\r\n pre='B'\r\n \r\n if arr[j]!='-':\r\n arr[j]='B'\r\n \r\n else:\r\n if pre=='B':\r\n checker[str(i)+'_'+str(j)]='W'\r\n pre='W'\r\n \r\n if arr[j]!='-':\r\n arr[j]='W'\r\n \r\n else:\r\n checker[str(i)+'_'+str(j)]='B'\r\n pre='B'\r\n \r\n if arr[j]!='-':\r\n arr[j]='B'\r\n \r\n \r\n \r\n ans.append(''.join(arr))\r\n\r\nprint('\\n'.join(ans))\r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n ", "# take input of m and n\r\nm, n = map(int, input().split())\r\n\r\n# create an empty array\r\narr = [[0 for j in range(n)] for i in range(m)]\r\n\r\n# take input from user\r\nfor i in range(m):\r\n row = list(input().strip()) # split each row into individual characters\r\n for j in range(n):\r\n arr[i][j] = row[j]\r\n\r\n# print the array\r\nfor i in range(m):\r\n if i==0:\r\n pass\r\n else:\r\n print()\r\n for j in range(n):\r\n if arr[i][j]==\".\":\r\n if (i+j)%2==0:\r\n print(\"B\",end=\"\")\r\n else:\r\n print(\"W\",end=\"\")\r\n else:\r\n print(\"-\",end=\"\")", "x = [int(q) for q in input().split()]\r\nboard = []\r\nfor i in range(0, x[0]):\r\n board.append(input())\r\nsolution = []\r\niterations = 0\r\nfor i in board:\r\n row = []\r\n bonk = 0\r\n for j in i:\r\n if iterations%2==0:\r\n if j != \"-\":\r\n if bonk%2==0:\r\n row.append(\"W\")\r\n else:\r\n row.append(\"B\")\r\n else:\r\n row.append(\"-\")\r\n else:\r\n if j != \"-\":\r\n if bonk%2==0:\r\n row.append(\"B\")\r\n else:\r\n row.append(\"W\")\r\n else:\r\n row.append(\"-\")\r\n bonk+=1\r\n solution.append(row)\r\n iterations+=1\r\nfor i in solution:\r\n for j in i:\r\n print(j, end=\"\")\r\n print() \r\n", "\r\nboard=[]\r\nfor row in [*open(0)][1:]: board += list(row[:-1]),\r\nnr, nc, fill = len(board), len(board[0]), []\r\n\r\nwhile any(filter(lambda r: '.' in r, board)):\r\n for r in range(nr):\r\n try:\r\n c = board[r].index('.')\r\n break\r\n except ValueError:\r\n continue\r\n fill += (r,c),\r\n while fill:\r\n r, c = fill.pop()\r\n board[r][c] = 'W' if (r+c)%2 else 'B'\r\n if r>0 and board[r-1][c]=='.': fill += (r-1,c),\r\n if r<nr-1 and board[r+1][c]=='.': fill += (r+1,c),\r\n if c>0 and board[r][c-1]=='.': fill += (r,c-1),\r\n if c<nc-1 and board[r][c+1]=='.': fill += (r,c+1),\r\nfor r in board:\r\n for c in r:\r\n print(c,end='')\r\n print()\r\n", "n, m = [int(x) for x in input().split()]\nfor i in range(n):\n s=input()\n ans=\"\"\n for j in range(m):\n if (s[j]=='-'):\n ans+=s[j]\n elif ((i+j)%2==1):\n ans+='B'\n else: ans+='W'\n print(ans)\n", "n,m=map(int,input().split())\r\nl=[]\r\nfor i in range(n): \r\n s=input()\r\n s=list(s)\r\n for j in range(m):\r\n if s[j]=='.': \r\n if (i+j)&1:s[j]='W'\r\n else: s[j]='B'\r\n l.append(s)\r\nfor c in l: print(\"\".join(c))", "n, m = map(int, input().split())\r\n\r\nfor linha in range(0, n):\r\n\r\n s = input()\r\n\r\n resposta = \"\"\r\n\r\n for coluna in range(0, m):\r\n\r\n if s[coluna] == '.':\r\n\r\n if (linha + coluna) & 1 == 1:\r\n\r\n resposta += \"B\"\r\n\r\n else:\r\n\r\n resposta += \"W\"\r\n\r\n else:\r\n\r\n resposta += s[coluna]\r\n\r\n print(resposta)", "from sys import stdin\r\ninput = stdin.readline\r\n#print(5&7&12&6)\r\n#print(42069//6)\r\n\r\n\t\t\t\t\r\n\r\n\t\t\t\t\r\n\r\n#for j in range(int(input())):\r\nn,m=[int(i) for i in input().split(\" \")]\r\n\r\ng=[]\r\nfor j in range(n):\r\n\tk=['W' if i%2==0 else 'B' for i in range(m)]\r\n\tp=['B' if i%2==0 else 'W' for i in range(m)]\r\n\tl=list(input())\r\n\tflag=False\r\n\t\r\n\tif j%2==0:\r\n\t\tfor i in range(m):\r\n\t\t\tif l[i]=='-':\r\n\t\t\t\tk[i]='-'\r\n\t\tg.append(k)\r\n\telse:\r\n\t\tfor i in range(m):\r\n\t\t\tif l[i]=='-':\r\n\t\t\t\tp[i]='-'\r\n\t\tg.append(p)\r\n\t\t\r\n\r\nfor i in g:\r\n\tfor j in i:\r\n\t\tprint(j,end=\"\")\r\n\tprint()\r\n\t\r\n\r\n\r\n\t\r\n\t\t\t\r\n\t\t\t\r\n\r\n\r\n\r\n\t\r\n\t\r\n\t\r\n\t\t\t\r\n\t\r\n", "n,m=list(map(int,input().split()))\r\nboard=[]\r\nfor _ in range(n):\r\n board.append(list(input()))\r\nfor i in range(n):\r\n for j in range(m):\r\n if board[i][j]==\".\":\r\n if not i&1 and not j&1:print(\"B\",end=\"\")\r\n elif not i&1 and j&1:print(\"W\",end=\"\")\r\n elif i&1 and not j&1:print(\"W\",end=\"\")\r\n elif i&1 and j&1:print(\"B\",end=\"\")\r\n else:print(\"-\",end=\"\")\r\n print(\"\")", "n, m = map(int, input().split())\r\ns = []\r\nfor i in range(n):\r\n s.append(list(input()))\r\nboard = []\r\ncolors = ['B', 'W']\r\nfor i in range(n):\r\n board.append([])\r\n for j in range(m):\r\n if(i%2==0):\r\n board[i].append(colors[(1+j)%2])\r\n else:\r\n board[i].append(colors[(j)%2])\r\nfor i in range(n):\r\n for j in range(m):\r\n if(s[i][j]=='-'):\r\n print('-', end='')\r\n else:\r\n print(board[i][j], end='')\r\n print()\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. DZY Loves Chessboard\r\n SOLUTATOIN:........\r\n\r\n ========================================================================\r\n ========================================================================\r\n '''\t\t\r\nn, m = map(int, input().split(' '))\r\nfor i in range(n):\r\n l = list(input())\r\n for j in range(m):\r\n if l[j] == \".\":\r\n if (i + j) % 2 :\r\n l[j]=\"B\"\r\n else :\r\n l[j]=\"W\"\r\n print(\"\".join(l))", "from collections import *\nimport bisect\nimport heapq\n\nfrom collections import deque\n\ndef canBipartite():\n \"\"\"\n vertices are numbered from 0 , 1 ...to n - 1\n Return True if we can color the n vertices with 2 colors, \n given than vertices on both sides of an edge must have different colors.\n We use BFS for that\n \"\"\"\n \n\n queue = deque()\n\n #loop through all the vertices\n for n in range(N):\n for m in range(M):\n\n #####everyhting after this could be put in a separate function if we wanted to#####\n\n if grid[n][m] == \".\":\n queue.append((n,m))\n grid[n][m] = \"B\" #here we could also assign W to the starting vertex of this connected component, doesnt matter \n\n\n while queue:\n u1, u2 = queue.popleft() \n\n #check the neighbors\n for du1 in [-1,0,1]:\n for du2 in [-1,0,1]:\n nu1 = u1 + du1\n nu2 = u2 + du2\n if nu1 >= 0 and nu2>= 0 and nu1 < N and nu2 < M:\n if abs(du1) + abs(du2) == 1:\n \n #not visited\n if grid[nu1][nu2] == \".\":\n\n # Assign alternate value to this adjacent v of u\n if grid[u1][u2] == \"B\":\n grid[nu1][nu2] = \"W\"\n else:\n grid[nu1][nu2] = \"B\"\n\n queue.append((nu1, nu2)) \n\n elif grid[nu1][nu2] == grid[u1][u2]: \n return False\n\n return True\n\n\ndef ri():\n return int(input())\n \ndef rl():\n return list(map(int, input().split()))\n \nN, M = rl()\ngrid = [[\".\"]*M for _ in range(N)]\n\nfor n in range(N):\n grid[n] = [x for x in input()]\n\nans = canBipartite()\nif ans:\n for n in range(N):\n print(\"\".join(grid[n]))\n\n", "n, m = map(int, input().split())\r\nc = [input() for _ in range(n)]\r\n\r\nfor i in range(n):\r\n for j in range(m):\r\n if c[i][j] == '.':\r\n if (i + j) % 2 == 0:\r\n c[i] = c[i][:j] + 'B' + c[i][j + 1:]\r\n else:\r\n c[i] = c[i][:j] + 'W' + c[i][j + 1:]\r\n print(c[i])\r\n", "n, m = map(int, input().split())\r\nS = []\r\n\r\nfor i in range(n):\r\n row = input().strip()\r\n new_row = []\r\n\r\n for j in range(m):\r\n if row[j] == '.':\r\n if (i + j) % 2 == 0:\r\n new_row.append('B')\r\n else:\r\n new_row.append('W')\r\n else:\r\n new_row.append(row[j])\r\n\r\n print(\"\".join(new_row))\r\n", "n,m=map(int,input().split())\r\nl=[]\r\nfor _ in range(n):\r\n l.append(list(input()))\r\nfor i in range(n):\r\n for j in range(m):\r\n if l[i][j]=='.':\r\n if (i+j)%2==0:\r\n l[i][j]='B'\r\n else:\r\n l[i][j]='W'\r\nfor _ in l:\r\n print(''.join(_))\r\n ", "a,b = map(int, input().split())\r\n\r\nmat = []\r\n\r\nfor i in range(0,a):\r\n x = input()\r\n mat.append([])\r\n for j in range(0,b):\r\n if x[j] != '-':\r\n if (i % 2 == 0 and j % 2 == 0) or (i % 2 == 1 and j % 2 == 1):\r\n mat[i].append('B')\r\n else:\r\n mat[i].append('W')\r\n else:\r\n mat[i].append('-')\r\n\r\nfor i in range(0,a):\r\n print(''.join(mat[i]))", "n, m = map(int, input().split())\r\ns = ['B', 'W']\r\nfor i in range(n):\r\n for k, j in enumerate(input()):\r\n if j == \".\":\r\n if i % 2 == 0:\r\n print(s[k % 2], end=\"\")\r\n else:\r\n print(s[(k+1) % 2], end=\"\")\r\n\r\n else:\r\n print(\"-\", end=\"\")\r\n print(\"\")\r\n", "n, m = map(int, input().split())\r\nmatrix = []\r\nrow = \"\"\r\nfor i in range(n):\r\n matrix.append(input())\r\n for j in range(m):\r\n if matrix[i][j] == '.':\r\n if (i+j) & 1 == 1:\r\n row += 'W'\r\n else:\r\n row += 'B'\r\n else:\r\n row += '-'\r\n row += '\\n'\r\n\r\nprint(row)", "m, n = list(map(int, input().split(\" \")))\r\n\r\ngrid = [[True] * n for _ in range(m)]\r\nres = [[\"-\"] * n for _ in range(m)]\r\n\r\nfor i in range(m):\r\n cur = input()\r\n for j, x in enumerate(cur):\r\n if x == \"-\":\r\n grid[i][j] = False\r\n\r\ndirs = [[0, 1], [1, 0], [0, -1], [-1, 0]]\r\n\r\nfor i in range(m):\r\n for j in range(n):\r\n if grid[i][j]:\r\n stk = [(i, j)]\r\n grid[i][j] = False\r\n\r\n white = True\r\n while stk:\r\n white = not white\r\n ls = len(stk)\r\n for k in range(ls):\r\n r, c = stk.pop(0)\r\n res[r][c] = \"W\" if white else \"B\"\r\n\r\n for x, y in dirs:\r\n nr, nc = r + x, c + y\r\n if nr >= 0 and nr < m and nc >= 0 and nc < n:\r\n if grid[nr][nc]:\r\n grid[nr][nc] = False\r\n stk.append((nr, nc))\r\n print(res[i][j], end=\"\")\r\n print()\r\n", "n,m=map(int,input().split())\r\na='BW'*(m//2)+'B'*(m%2)\r\nb='WB'*(m//2)+'W'*(m%2)\r\nlist_ans=[]\r\nfor i in range(n):\r\n c=''\r\n s=input()\r\n if i%2==0:\r\n for x in range(m):\r\n if s[x]=='.':\r\n c+=a[x]\r\n else:\r\n c+='-'\r\n else:\r\n for x in range(m):\r\n if s[x]=='.':\r\n c+=b[x]\r\n else:\r\n c+='-'\r\n list_ans.append(c)\r\nfor item in list_ans:\r\n print(item)", "n, m = map(int, input().split())\n\ntabuleiro = []\nfor i in range(n):\n tabuleiro.append(input())\n\nfor i in range(n):\n linha = ''\n for j in range(m):\n if tabuleiro[i][j] == '-': #verifico se essa posição é um espaço ruim\n linha += '-' #se for, coloco um espaço ruim na linha\n elif (i+j) % 2 == 0: #se não for, verifico se a posição é par, pois num tabuleiro as cores alternam entre pra e impar\n linha += 'B'\n else: \n linha += 'W'\n print(linha)\n\t \t \t\t \t \t \t \t \t \t \t \t \t", "n, m = map(int, input().split())\r\n \r\nfor i in range(n):\r\n s, t = input(), ''\r\n for j in range(m):\r\n t += s[j] if s[j] == '-' else 'BW'[(i+j) % 2]\r\n print(t)", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Thu Oct 14 19:09:55 2021\r\n\r\n@author: DELL\r\n\"\"\"\r\n\r\nn,m = map(int,input().split())\r\nc = ['B','W']\r\nfor i in range(n):\r\n line = input()\r\n color = ''\r\n for j in range(m):\r\n if line[j] == '-':\r\n color += '-'\r\n else:\r\n color += c[(i+j)%2]\r\n print(color)\r\n \r\n\r\n'''\r\ndef col(x):\r\n c = ['B','W']\r\n c.remove(x)\r\n return c[0]\r\n\r\nn,m = map(int,input().split())\r\ncb = [];c=['B','W']\r\ncb.append(['-']*(m+1))\r\nfor i in range(1,n+1):\r\n line = list(input())\r\n cb.append(['-'] + line)\r\n color = ''\r\n for j in range(1,m+1):\r\n if cb[i][j] == '-':\r\n color += '-'\r\n \r\n elif cb[i-1][j] in c:\r\n cb[i][j] = col(cb[i-1][j])\r\n color += cb[i][j]\r\n \r\n elif cb[i][j-1] in c:\r\n cb[i][j] = col(cb[i][j-1])\r\n color += cb[i][j]\r\n \r\n else:\r\n cb[i][j] = 'B'\r\n color += 'B'\r\n print(color)\r\n '''", "n, m = map(int, input().split())\r\nl = []\r\nfor i in range(n):\r\n l.append(list(input()))\r\n\r\nans = []\r\nfor i in range(n):\r\n s = ''\r\n if(i % 2):\r\n s = s + 'BW' * (m // 2) + 'B' * (m % 2)\r\n else:\r\n s = s + 'WB' * (m // 2) + 'W' * (m % 2)\r\n ans.append(list(s))\r\n\r\nfor i in range(n):\r\n for j in range(m):\r\n if(l[i][j] != '.'):\r\n ans[i][j] = l[i][j]\r\n \r\nfor i in range(n):\r\n print(''.join(ans[i]))", "n, m = map(int, input().split())\r\narr = []\r\nfor i in range(n):\r\n a = input()\r\n b = list(a)\r\n arr.append(b)\r\nfor i in range(n):\r\n for j in range(m):\r\n if arr[i][j] == '.':\r\n if (i+j)%2 == 0:\r\n print('W', end='')\r\n else:\r\n print('B', end='')\r\n else:\r\n print(arr[i][j], end='')\r\n print()", "n,m = map(int, input().split())\r\n\r\nfor i in range(n):\r\n row = input()\r\n for j in range(m):\r\n print(\"-\" if row[j] == \"-\" else (\"B\" if (i+j)%2==0 else \"W\"), end=\"\")\r\n print()", "x, y = map(int,input().split())\r\n\r\nfor i in range(x):\r\n x = \"\";z = input()\r\n for j in range(y):\r\n if z[j] == \".\":x+=\"BW\"[(i+j)&1]\r\n else:x+=z[j]\r\n print(x)", "import math\r\n\r\ndef input_list_int():\r\n return list(map(int, input().split()))\r\n\r\nn, m = input_list_int()\r\n\r\nc = []\r\nfor i in range(n):\r\n tmp = list(input())\r\n our_tmp = []\r\n for j in range(m):\r\n if tmp[j] == '.':\r\n if i % 2 == 0:\r\n if j % 2 == 0:\r\n our_tmp.append('W')\r\n else:\r\n our_tmp.append('B')\r\n else:\r\n if j % 2 == 0:\r\n our_tmp.append('B')\r\n else:\r\n our_tmp.append('W')\r\n else:\r\n our_tmp.append('-')\r\n c.append(our_tmp)\r\n\r\nfor i in range(n):\r\n print(''.join(c[i]))", "\r\n\r\nn, m = map(int, input().split())\r\na = [None] * n\r\n# visited = []\r\n# b = [0] * m\r\nd = [None] * m\r\ncol = []\r\nfor i in range(n):\r\n a[i] = input()\r\n # visited.append(b[:])\r\n col.append(d[:])\r\nfor i in range(n):\r\n for j in range(m):\r\n if(a[i][j] == '.'):\r\n if((i + j) % 2 == 0):\r\n col[i][j] = 0\r\n else:\r\n col[i][j] = 1\r\n# print(col)\r\nfor i in range(n):\r\n s = \"\"\r\n for j in range(m):\r\n if(col[i][j] == None):\r\n s += '-'\r\n elif(col[i][j] == 0):\r\n s += 'B'\r\n else:\r\n s += 'W'\r\n print(s)\r\n", "# https://codeforces.com/problemset/problem/445/A\r\n\r\ndef check(m):\r\n res = []\r\n for lidx, line in enumerate(m):\r\n lin = []\r\n for cidx, item in enumerate(line):\r\n if item == '-':\r\n lin.append(item)\r\n else:\r\n if (cidx + lidx) % 2 == 0:\r\n lin.append('B')\r\n else:\r\n lin.append('W')\r\n res.append(lin)\r\n for line in res:\r\n print(''.join(line))\r\n\r\nm = []\r\nn, _ = map(int, input().split())\r\nfor _ in range(n):\r\n m.append(input())\r\ncheck(m)", "n,m=map(int,input().split())\r\na=\"\"\r\nansarr=[]\r\nfor i in range(n):\r\n a=''\r\n s=input()\r\n if(i%2==0):\r\n for j in range(m):\r\n if(s[j]==\".\"):\r\n if(j%2==0):\r\n a+=\"W\"\r\n else:\r\n a+=\"B\"\r\n else:\r\n a+=\"-\"\r\n else:\r\n for j in range(m):\r\n if(s[j]==\".\"):\r\n if(j%2==0):\r\n a+=\"B\"\r\n else:\r\n a+=\"W\"\r\n else:\r\n a+=\"-\"\r\n print(a)", "a, b = input().split()\r\na, b = int(a), int(b)\r\n \r\narr = \"\"\r\n \r\nfor i in range(a):\r\n inputstr = input()\r\n row = \"\"\r\n for j, k in enumerate(inputstr):\r\n if k == \"-\":\r\n row += \"-\"\r\n elif (i + j) % 2:\r\n row += \"B\"\r\n else:\r\n row += \"W\"\r\n arr += row + \"\\n\"\r\n \r\nprint(arr)", "mat = []\r\nn, m = map(int, input().split())\r\nfor i in range(n):\r\n ll = list(input())\r\n mat.append(ll)\r\nfor i in range(n):\r\n for j in range(m):\r\n if mat[i][j] != \"-\":\r\n if (i+ j) % 2 == 0:\r\n mat[i][j] = \"B\"\r\n else:\r\n mat[i][j] = \"W\"\r\nfor i in mat:\r\n print(\"\".join(i))\r\n", "n,m=map(int,input().split())\r\nt=['B','W']\r\nfor i in range(n):\r\n x=input().strip()\r\n c=i%2\r\n for j in x:\r\n if j=='-':\r\n print(j,end=\"\")\r\n else:\r\n print(t[c],end=\"\")\r\n c=c+1\r\n c%=2\r\n print()\r\n\r\n", "n, m = map(int, input().split())\r\nboard = [[_ for _ in input()] for _ in range(n)]\r\n\r\npieces = [\"W\", \"B\"]\r\nfor i in range(len(board)):\r\n for j in range(len(board[i])):\r\n if board[i][j] == \".\":\r\n board[i][j] = pieces[(i+j)%2]\r\n\r\nfor i in board:\r\n print(\"\".join(i))", "import sys\r\nimport math\r\nimport collections\r\nimport heapq\r\nimport decimal\r\nn,m=(int(i) for i in input().split())\r\nl=[]\r\nfor i in range(n):\r\n l.append(list(input()))\r\nc=0\r\nfor i in range(n):\r\n for j in range(m):\r\n if(l[i][j]=='.'):\r\n if(i%2==0 and j%2==0):\r\n l[i][j]='W'\r\n elif(i%2==0):\r\n l[i][j]='B'\r\n else:\r\n if(j%2==0):\r\n l[i][j]='B'\r\n else:\r\n l[i][j]='W'\r\nfor i in range(n):\r\n print(''.join(l[i]))", "n,m = map(int,input().split())\r\ns = [input() for i in range(n)]\r\nres = \"\"\r\nfor i in range(n):\r\n for j in range(m):\r\n if s[i][j]=='.':\r\n res+=\"BW\"[(i+j)%2]\r\n else:\r\n res+=\"-\"\r\n res+=\"\\n\"\r\nprint(res)\r\n", "n, m = map(int, input().split())\r\nmp = [list(input()) for _ in range(n)]\r\n\r\nfor i in range(n):\r\n for j in range(m):\r\n if mp[i][j] == '.':\r\n if (i + j) % 2 == 0:\r\n mp[i][j] = 'B'\r\n else:\r\n mp[i][j] = 'W'\r\n\r\nfor i in range(n):\r\n print(''.join(mp[i]))\r\n", "n,m = map(int,input().split())\r\narr = [input() for _ in range(n)]\r\nfor i in range(n):\r\n for j in range(m):\r\n if arr[i][j]=='-':\r\n print('-',end='')\r\n else:\r\n if((i+j)%2==0):\r\n print('B',end='')\r\n else:\r\n print('W',end='')\r\n print()", "n, m = map(int, input().split())\r\n\r\na = [[x for x in input()] for i in range(n)]\r\n#print(a)\r\nb = []\r\nfor i in range(n):\r\n\tans = \"\"\r\n\tfor j in range(m):\r\n\t\tif (i+j)%2 == 0 and a[i][j] == '.':\r\n\t\t\tans += 'B'\r\n\t\telif (i+j)%2 != 0 and a[i][j] == '.':\r\n\t\t\tans += 'W'\r\n\t\telse:\r\n\t\t\tans += '-'\r\n\r\n\tb.append(ans)\t\r\n\r\nfor i in b:\r\n\tprint(i)\r\n\r\n# 101\r\n# 010\r\n# 101", "n,m = map(int,input().split(\" \"))\r\n\r\nb = []\r\n\r\nfor i in range(n):\r\n tp = input()\r\n row = []\r\n for a in tp:\r\n row.append(a)\r\n b.append(row)\r\n \r\nfor i in range(n):\r\n for j in range(m):\r\n if b[i][j] == \"-\":\r\n continue\r\n if i%2 == 0 and j%2 == 0:\r\n b[i][j] = \"B\"\r\n elif i%2 == 1 and j%2 == 0:\r\n b[i][j] = \"W\"\r\n elif i%2 == 0 and j%2 == 1:\r\n b[i][j] = \"W\"\r\n else:\r\n b[i][j] = \"B\"\r\n\r\nfor i in range(n):\r\n for j in range(m):\r\n print(b[i][j],end=\"\")\r\n print()", "n , m = map(int, input().split())\r\nchessBoard =[]\r\nfor i in range(n):\r\n chessBoard.append([y for y in input()])\r\n\r\nfor i in range(n):\r\n for j in range(m):\r\n if chessBoard[i][j] == \".\" :\r\n if((j+i)%2==0):\r\n chessBoard[i][j]='B';\r\n else:\r\n chessBoard[i][j]='W';\r\n \r\nfor x in chessBoard:\r\n for y in x:\r\n print(y,end = \"\")\r\n print()", "#文字列入力はするな！！\r\n#carpe diem\r\n\r\n'''\r\n ██╗ ██╗ ███╗ ███╗ ██╗ ████████╗\r\n ██║ ██║ ████╗ ████║ ██║ ╚══██╔══╝\r\n═════════██╠════════██╠═══██╔████╔██╠═══██╠══════██╠══════════\r\n ██║ ██║ ██║╚██╔╝██║ ██║ ██║\r\n ███████╗ ██║ ██║ ╚═╝ ██║ ██║ ██║\r\n ╚══════╝ ╚═╝ ╚═╝ ╚═╝ ╚═╝ ╚═╝\r\n'''\r\n\r\n#文字列入力はするな！！\r\n#carpe diem\r\n\r\nr,c=map(int,input().split())\r\nL=[]\r\nfor i in range(r):\r\n L.append(input())\r\n\r\n\r\nfor i in range(r):\r\n for j in range(c):\r\n if L[i][j]=='-':\r\n print('-',end='')\r\n elif (i+j)%2==0:\r\n print('W',end='')\r\n else:\r\n print('B',end='')\r\n print()\r\n\r\n\r\n\r\n\r\n\r\n \r\n \r\n\r\n#carpe diem \r\n#carpe diem", "def transitions(y,x):\r\n yield y+1,x\r\n yield y,x+1\r\n yield y-1,x\r\n yield y,x-1\r\n\r\ndef valid_transitions(arr):\r\n # print(arr)\r\n Y = len(arr)\r\n X = len(arr[0])\r\n def _f(y0,x0):\r\n for y,x in transitions(y0,x0):\r\n if 0 <= y < Y and 0 <= x < X and arr[y][x] != \"-\":\r\n yield y,x\r\n return _f\r\n\r\ndef opp(player):\r\n if player == \"W\":\r\n return \"B\"\r\n else:\r\n return \"W\"\r\n\r\ndef dfs(board, init, visited, tran_fn, ans):\r\n q = [(init, 'W')]\r\n while q:\r\n (y,x), player = q.pop()\r\n if (y,x) not in visited:\r\n visited.add((y,x))\r\n ans[y][x] = player\r\n for yn,xn in tran_fn(y,x):\r\n # print((y,x), (yn,xn))\r\n item = (yn,xn), opp(player)\r\n q.append(item)\r\n\r\n\r\nY,X = [int(x) for x in input().split()] \r\nboard = []\r\nfor y in range(Y):\r\n s = input()\r\n board.append(s)\r\n\r\ndef run(board):\r\n tran_fn = valid_transitions(board)\r\n Y = len(board)\r\n X = len(board[0])\r\n ans = [[\"-\" for _ in range(X)] for _ in range(Y)]\r\n visited = set()\r\n for y in range(Y):\r\n for x in range(X):\r\n if board[y][x] == '.':\r\n dfs(board, (y,x), visited, tran_fn, ans)\r\n\r\n ans = [\"\".join(xs) for xs in ans]\r\n print(\"\\n\".join(ans))\r\n\r\n# print(board)\r\nrun(board)\r\n# print(list(valid_transitions(board)(0,0)))\r\n", "def gen_line(o, l):\r\n r = []\r\n oo = True\r\n if o:\r\n for i in range(l):\r\n if oo:\r\n r.append('B')\r\n else:\r\n r.append('W')\r\n oo = not oo\r\n else:\r\n for i in range(l):\r\n if oo:\r\n r.append('W')\r\n else:\r\n r.append('B')\r\n oo = not oo\r\n return r\r\n\r\nn, m = map(int, input().split())\r\nr = ''\r\no = True\r\n\r\nfor i in range(n):\r\n line = input()\r\n linetbp = gen_line(o, m)\r\n rtbp = ''\r\n for i, j in zip(line, linetbp):\r\n if i == '.':\r\n rtbp += j\r\n else:\r\n rtbp += '-'\r\n o = not o\r\n r += ''.join(rtbp) + '\\n'\r\n\r\nprint(r)\r\n\r\n", "(n, m) = map(int, input().split())\r\nrows = []\r\n\r\nfor i in range(n):\r\n rows.append(list(input()))\r\n\r\nfor i in range(n):\r\n for j in range(m):\r\n if rows[i][j] != '.':\r\n print(rows[i][j], end=\"\")\r\n continue\r\n\r\n if (j % 2 == 0 and i % 2 == 0) or (j % 2 != 0 and i % 2 != 0):\r\n rows[i][j] = 'B'\r\n else:\r\n rows[i][j] = 'W'\r\n print(rows[i][j], end=\"\")\r\n print()", "H,W = map(int,input().split())\r\n\r\nS = [list(input())for i in range(H)]\r\n\r\ndef c(x,y):\r\n\tif (x+y)%2 == 0:\r\n\t\tS[x][y] = \"B\"\r\n\telse:\r\n\t\tS[x][y] = \"W\"\r\n\t\t\r\nfor i in range(H):\r\n\tfor j in range(W):\r\n\t\tif S[i][j] == \".\":\r\n\t\t\tc(i,j)\r\n\t\t\t\r\nfor i in range(H):\r\n\tprint(\"\".join(S[i]))\r\n\t\r\n", "n,m=map(int,input().split())\r\nchess=[]\r\nfor i in range(n):\r\n s=input()\r\n chess.append(s)\r\nres=[]\r\n\r\nfor row in range(n):\r\n if(row%2==0):\r\n if(m%2==0):\r\n s=\"WB\"*(m//2)\r\n else:\r\n s=\"WB\"*(m//2)+\"W\"\r\n else:\r\n if(m%2==0):\r\n s=\"BW\"*(m//2)\r\n else:\r\n s=\"BW\"*(m//2)+\"B\"\r\n for col in range(m):\r\n if(chess[row][col]=='-'):\r\n s=list(s)\r\n s[col]='-'\r\n res.append(\"\".join(x for x in s))\r\n\r\nfor x in res:\r\n print(x)\r\n \r\n " ]

[ "# i'm from jasnah, do not ban me\r\nn, t = map(int, input().split())\r\nn += 1\r\nif t & (t - 1):\r\n print(0)\r\nelse:\r\n dp = [0] * 65\r\n c = 0\r\n for j in range(60, -1, -1):\r\n for i in range(60, 0, -1):\r\n dp[i] += dp[i - 1]\r\n if n >> j & 1:\r\n dp[c] += 1\r\n c += 1\r\n dp[c] += 1\r\n c = 0\r\n while t:\r\n c += 1\r\n t >>= 1\r\n if c == 1:\r\n print(dp[c] - 1)\r\n else:\r\n print(dp[c])\r\n", "\r\nn, t = map(int, input().split())\r\nn += 1\r\n\r\nS = [0] * 50\r\nS[0] -= 1\r\n\r\nbs = []\r\nc, d, j = 1, 0, 0\r\n\r\nwhile n >> j:\r\n bs2 = [1] * c\r\n for i in range(1, c-1):\r\n bs2[i] = bs[c-2][i] + bs[c-2][i-1]\r\n bs.append(bs2)\r\n if n >> (j + 1):\r\n for i in range(c):\r\n S[i] += bs2[i]\r\n j += 1\r\n c += 1\r\n\r\nj -= 2\r\noffset = 0\r\n\r\nwhile j >= 0:\r\n if n & (1 << j):\r\n for i in range(len(bs[j])):\r\n S[i + offset] += bs[j][i]\r\n offset += 1\r\n j -= 1\r\n\r\nS[offset] += 1\r\ni, c = 0, 0\r\n\r\nwhile (1<<i) < t:\r\n c += t & (1<<i)\r\n i += 1\r\n\r\nif (c):\r\n print(0)\r\nelse: \r\n print(S[i])\r\n \r\n" ]

[ "s,k=map(int,input().split())\r\nf=[0]\r\nf.append(1)\r\nwhile(True):\r\n cur=sum(f[-k:])\r\n if cur>s:\r\n break\r\n f.append(cur)\r\nf=list(set(f))\r\nf.sort()\r\nans=[]\r\ni=len(f)-1\r\nwhile(s and i>0):\r\n if f[i]<=s:\r\n s-=f[i]\r\n ans.append(f[i])\r\n i-=1\r\nprint(len(ans)+1)\r\nprint(*(ans+[0]))\r\n\r\n#Copied\r\n", "s,k=list(map(int,input().split(' ')))\r\na=[0,1,1]\r\nwhile a[-1]<s:\r\n if len(a)<k:\r\n a.append(sum(a))\r\n else:\r\n t=0\r\n for i in range(k):\r\n t+=a[-i-1]\r\n a.append(t)\r\nif s==a[-1]:\r\n print(2)\r\n print(0,a[-1])\r\nelse:\r\n use=[]\r\n for i in range(len(a)):\r\n if s>=a[-i-1]:\r\n s-=a[-i-1]\r\n use.append(a[-i-1])\r\n print(len(use))\r\n for i in use:\r\n print(i,end=' ')", "s, k = map(int, input().split())\r\nfreq = [1]\r\nwhile freq[-1] < s:\r\n\tx = 0\r\n\tfor i in range(max(0, len(freq)-k), len(freq)):\r\n\t\tx += freq[i]\r\n\tfreq.append(x)\r\nres = [0]\r\nidx = len(freq) - 1\r\nwhile s != 0:\r\n\twhile freq[idx] > s:\r\n\t\tidx -= 1\r\n\tres.append(freq[idx])\r\n\ts -= freq[idx]\r\nprint(len(res))\r\nprint(*res)\r\n", "from bisect import bisect_left as bl\r\nfrom bisect import bisect_right as br\r\nimport heapq\r\nimport math\r\nfrom collections import *\r\nfrom functools import reduce,cmp_to_key\r\nimport sys\r\ninput = sys.stdin.readline\r\n \r\n# M = mod = 998244353\r\n# def 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))))\r\n# def inv_mod(n):return pow(n, mod - 2, mod)\r\n \r\ndef li():return [int(i) for i in input().rstrip('\\n').split()]\r\ndef st():return input().rstrip('\\n')\r\ndef val():return int(input().rstrip('\\n'))\r\ndef li2():return [i for i in input().rstrip('\\n').split(' ')]\r\ndef li3():return [int(i) for i in input().rstrip('\\n')]\r\n\r\n\r\n\r\nl = []\r\ns,k = li()\r\ni = 0\r\n\r\nsum = [0 for i in range(10**6)]\r\na = sum[:]\r\na[1]=1;\r\nsum[1]=1;\r\nfor i in range(2,10**13):\r\n\r\n if(i<=k):\r\n a[i]=sum[i-1];\r\n else:a[i]=sum[i-1]-sum[i-k-1];\r\n if(a[i]>s):\r\n n=i;break;\r\n sum[i]=sum[i-1]+a[i];\r\n\r\n\r\nl = sorted(list(set(l)))\r\nans = [0]\r\ni = n-1\r\nwhile s and i:\r\n if s - a[i] >= 0:\r\n ans.append(a[i])\r\n s -= a[i]\r\n i-=1\r\nprint(len(ans))\r\nprint(*ans)", "s, k=map(int, input().split())\r\nfib=[0, 1]\r\nfor i in range(80):\r\n g=0\r\n for x in range(k):\r\n if len(fib)-x-1<0:break\r\n g+=fib[len(fib)-x-1]\r\n fib.append(g)\r\nans=[]\r\nfor x in reversed(fib):\r\n if x<=s:\r\n s-=x\r\n ans.append(x)\r\nprint(len(ans))\r\nprint(\" \".join(str(x) for x in ans))\r\n", "s,k=map(int,input().split())\r\na,b=[0,1],[]\r\nwhile a[-1]<s:\r\n a.append(sum(a[-k:]))\r\n#print(a)\r\nfor i in reversed(a):\r\n if i<=s:\r\n b.append(i)\r\n s-=i\r\nprint(len(b))\r\nprint(' '.join(map(str,b)))", "s, k = map(int, input().split())\r\nfib_n = [0,1]\r\nwhile(fib_n[-1] <= s):\r\n fib_n.append(sum(fib_n[-1-i] for i in range(min(k,len(fib_n)))))\r\ndel fib_n[1]\r\ndel fib_n[0]\r\ndel fib_n[-1]\r\nfoundSeries = [0]\r\n\"\"\"def findSeries(total, numbers):\r\n global foundSeries\r\n if total == 0:\r\n return True\r\n elif len(numbers) ==0 or total<0:\r\n return False\r\n else:\r\n if(findSeries(total-numbers[0], numbers[1:])):\r\n foundSeries.append(numbers[0])\r\n return True\r\n elif(findSeries(total, numbers[1:])):\r\n return True\r\n else:\r\n return False\"\"\"\r\n\r\nfound = False\r\ndef findBSearch(total, numbers):\r\n global found\r\n if found:\r\n return False\r\n global foundSeries\r\n if total == 0:\r\n return True\r\n elif len(numbers) == 0 or total<0:\r\n return False\r\n else:\r\n top = len(numbers) - 1\r\n bottom = 0\r\n while abs(top - bottom) > 1:\r\n if total > (numbers[(top+bottom)//2]):\r\n bottom = (top + bottom) // 2\r\n else:\r\n top = (top + bottom) // 2\r\n if(total == numbers[top] or total == numbers[bottom]):\r\n foundSeries.append(total)\r\n found = True\r\n return True\r\n else:\r\n if(findBSearch(total - numbers[top], numbers[:top] + numbers[top+1:])):\r\n foundSeries.append(numbers[top])\r\n return True\r\n elif(findBSearch(total - numbers[bottom], numbers[:bottom] + numbers[bottom+1:])):\r\n foundSeries.append(numbers[bottom])\r\n return True\r\n else:\r\n return False\r\n\r\nfindBSearch(s, fib_n)\r\nprint(len(foundSeries))\r\nfor i in foundSeries:\r\n print(i, end=\" \")", "from sys import stdin\r\ninput = stdin.readline\r\n\r\ns, k = [int(x) for x in input().split()]\r\n\r\nans = []\r\na = [0,1]\r\nwhile a[-1] < s:\r\n a.append(sum(a[-k:]))\r\nfor x in reversed(a):\r\n if x <= s:\r\n ans.append(x)\r\n s -= x\r\n\r\n \r\nprint(len(ans))\r\nprint(*ans)", "#choose n maximal k bonnacii nums less than n and subtract them \r\n#till n is decomposed...\r\n#it will decompose..! \r\n#coz any number can be represented as sum of \r\n#fibonacci numbers \r\n\r\n\r\ndef s():\r\n [s,k] = list(map(int,input().split()))\r\n d = [0]\r\n d.append(1)\r\n t = 0\r\n r = []\r\n while t < s:\r\n t = sum(d[-min(k,len(d)):])\r\n d.append(t)\r\n for i in reversed(d):\r\n if i <= s:\r\n s -= i\r\n r.append(i)\r\n if i == 0:\r\n break\r\n print(len(r))\r\n print(*r)\r\ns()\r\n\r\n\r\n#0 1 1 2 3 5 \r\n\r\n", "s,k=map(int,input().split())\nf=[0]\nf.append(1)\nwhile(True):\n cur=sum(f[-k:])\n if cur>s:\n break\n f.append(cur)\nf=list(set(f))\nf.sort()\nans=[]\ni=len(f)-1\nwhile(s and i>0):\n if f[i]<=s:\n s-=f[i]\n ans.append(f[i])\n i-=1\nprint(len(ans)+1)\nprint(*(ans+[0]))\n", "\r\ns,k = map(int,input().split())\r\n\r\n\r\nif k>=32:\r\n k_bon = [0]\r\n for i in range(33):\r\n k_bon.append(2**i)\r\nelse:\r\n k_bon = [0]*(k-1)\r\n k_bon.append(1)\r\n i = k+1\r\n c = 0\r\n while len(k_bon)<=100:\r\n next = sum(k_bon[c:i])\r\n k_bon.append(next)\r\n i+=1\r\n c+=1\r\n\r\nk_bon = set(k_bon)\r\ni = 0\r\nans = []\r\nk_bon = sorted(list(k_bon))\r\n# print(k_bon)\r\nwhile s!=0:\r\n if k_bon[i] >= s:\r\n if s == k_bon[i]:\r\n s-=k_bon[i]\r\n # print(s)\r\n ans.append(k_bon[i])\r\n i = 0\r\n else:\r\n\r\n s-=k_bon[i-1]\r\n # print(s)\r\n ans.append(k_bon[i-1])\r\n i = 0\r\n\r\n else:\r\n i+=1\r\nif len(ans) == 1:\r\n ans.append(0)\r\nprint(len(ans))\r\nprint(*ans)\r\n\r\n\r\n", "s, k = map(int, input().split())\nf = [1]\nwhile f[-1] < s:\n\tx = 0\n\tfor i in range(max(0, len(f)-k), len(f)):\n\t\tx += f[i]\n\tf.append(x)\nresult = [0]\npos = len(f)-1\nwhile s != 0:\n\twhile f[pos] > s:\n\t\tpos -= 1\n\tresult.append(f[pos])\n\ts -= f[pos]\nprint(len(result))\nprint(' '.join(map(str, result)))\n", "s,k=map(int,input().split())\r\nF = [0,1]\r\nb = set()\r\nwhile True:\r\n f = sum(F[-k:])\r\n if f > s:\r\n break\r\n F.append(f)\r\nfor i in reversed(F):\r\n if i <= s:\r\n b.add(i)\r\n s -= i\r\nprint(len(b))\r\nprint (' '.join(map(str,b)))", "s, k = map(int, input().split())\r\nif k >= 32:\r\n l = [0]\r\n for i in range(32):\r\n if s&(1<<i):\r\n l.append(1<<i)\r\n print(len(l))\r\n print(*l)\r\nelse:\r\n l = [0]*(k-1)+[1]\r\n while l[-1] <= s:\r\n l.append(sum(l[-k:]))\r\n x = []\r\n for i in l[::-1]:\r\n if i and i <= s:\r\n s -= i\r\n x.append(i)\r\n if len(x) == 1:\r\n x.append(0)\r\n print(len(x))\r\n print(*x)\r\n", "s,k=map(int,input().split())\r\narr=[0,1];k1=1;visited=[];mini=0\r\nwhile(arr[-1]<s):\r\n arr.append(sum(arr[-k::]))\r\nwhile(s>0):\r\n for i in arr:\r\n if(i<=s):mini=i;\r\n else:break;\r\n s-=mini;visited.append(mini);\r\nif(len(visited)==1):visited.append(0);\r\nprint(len(visited))\r\nprint(*visited) ", "'''\r\nBeezMinh\r\n22:19 UTC+7\r\n16/08/2023\r\n'''\r\nfrom sys import stdin\r\ninput = lambda: stdin.readline().rstrip()\r\ns, k = map(int, input().split())\r\na, b = [0, 1], []\r\nwhile a[-1] < s:\r\n a.append(sum(a[-k:]))\r\nfor i in reversed(a):\r\n\tif i <= s:\r\n\t\tb.append(i)\r\n\t\ts -= i\r\nprint(len(b))\r\nprint(*b)", "s, k = map(int, input().split())\n\np, t, l = [0], [0, 1, 1], 2\n\nwhile t[l] < s:\n\n t.append((t[l] << 1) - (0 if l < k else t[l - k]))\n\n l += 1\n\nt.reverse()\n\nfor i in t:\n\n if i > s: continue\n\n p.append(i)\n\n s -= i\n\n if s == 0: break\n\nprint(len(p))\n\nprint(' '.join(map(str, p)))\n\n\n\n# Made By Mostafa_Khaled", "def kbon (k):\r\n if k < 30:\r\n l = [1] + [2**i for i in range(0,k-1)]\r\n su = sum(l)\r\n i = 0\r\n while su <= 10**9:\r\n l.append(su)\r\n su = su * 2 - l[i]\r\n i += 1\r\n else:\r\n l = [1] + [2**i for i in range(0,30)]\r\n return l\r\nsol = []\r\ns,k = (int(x) for x in input().split())\r\nl = kbon(k)\r\n\r\nfor i in range(1, len(l) + 1):\r\n if l[-i] <= s: \r\n s -= l[-i]\r\n sol.append(l[-i])\r\n if s < 1: break\r\nif len(sol) == 1: sol.append(0)\r\nprint(len(sol))\r\nprint(*sol)\r\n", "import sys\r\ninput = sys.stdin.readline\r\nfrom bisect import bisect\r\n\r\ns, k = map(int, input().split())\r\nd = [1]\r\na = c = 0\r\nfor i in range(50):\r\n a += d[-1]\r\n c += 1\r\n if c > k:\r\n c -= 1\r\n a -= d[-k - 1]\r\n d.append(a)\r\nq = []\r\nwhile s:\r\n x = bisect(d, s)\r\n q.append(d[x-1])\r\n s -= d[x-1]\r\nif len(q) == 1:\r\n q.append(0)\r\nprint(len(q))\r\nprint(' '.join(map(str, q)))\r\n" ]

[ "n= int(input())\r\na = list(map(int,input().split()))\r\nQQQ = 0\r\nwhile True:\r\n B = list(a)\r\n for i in range(n-1):\r\n if a[i] > a[i+1]:\r\n print(i+1,i+2)\r\n a[i],a[i+1] = a[i+1],a[i]\r\n #print(a)\r\n if a == B:\r\n break", "if __name__ == '__main__':\n n = int(input())\n arr = list(map(int, input().split()))\n\n for i in range(1, n):\n if arr[i] < arr[i - 1]:\n j = i\n while j > 0 and arr[j - 1] > arr[j]:\n print(j, j + 1)\n tmp = arr[j - 1]\n arr[j - 1] = arr[j]\n arr[j] = tmp\n j -= 1", "n=int(input())\nz=list(map(int,input().split()))\nx=sorted(z)\nwhile x != z:\n c=0\n while c < n-1 :\n if z[c] <= z[c+1] :\n c+=1\n else:\n z[c],z[c+1] = z[c+1],z[c]\n print(c+1 , c+2)\n c+=2\n\n", "\r\nn=int(input())\r\nans=0\r\nl=list(map(int,input().split()))\r\n\r\ns=sorted(l)\r\n\r\nfor i in range(n):\r\n\r\n if l[i]!=s[i]:\r\n \r\n\r\n a=l[i+1:].index(s[i])\r\n ind=i+a+1\r\n\r\n while ind!=i:\r\n print(ind,ind+1)\r\n l[ind-1],l[ind]=l[ind],l[ind-1]\r\n ind-=1\r\n\r\n \r\n \r\n", "# LUOGU_RID: 120814999\nn = int(input())\r\na = list(map(int, input().split()))\r\nfor i in range(1, n):\r\n for j in range(n - 1, i - 1, -1):\r\n if a[j] < a[j - 1]:\r\n a[j], a[j - 1] = a[j - 1], a[j]\r\n print(j, j + 1)\r\n", "n = int(input()) \r\na = [int(i) for i in input().split()] \r\nA = sorted(a)\r\nfor i in range(n-1, -1, -1): \r\n for j in range(i): \r\n if a[j] > a[j+1] : \r\n a[j], a[j+1] = a[j+1], a[j] \r\n print(j+1, j+2)\r\n ", "from sys import stdin,stdout\r\nn=int(stdin.readline().strip())\r\n#n,m=map(int,stdin.readline().strip().split())\r\n\r\ns=list(map(int,stdin.readline().strip().split()))\r\nflag=True\r\nwhile flag:\r\n flag=False\r\n x=0\r\n while x<n-1:\r\n if s[x]>s[x+1]:\r\n \r\n flag=True\r\n y=s[x+1]\r\n s[x+1]=s[x]\r\n s[x]=y\r\n \r\n stdout.write(\"%d %d \\n\" %(x+1,x+2))\r\n x+=2\r\n else:\r\n x+=1\r\n \r\n \r\n", "\r\nx = int(input())\r\na = [0] * x\r\na = list(map(int, (input().split())))\r\ncont1, cont2 = 0, 0\r\nini, fin = 0, 0\r\ndef reordenar(lista, m, n ):\r\n for _ in range(m, n + 1, 2):\r\n lista[_ - 1], lista[_] = lista[_], lista[_ - 1]\r\n\r\nwhile cont1<len(a):\r\n aux = []\r\n cont2 = cont1\r\n #print(cont2)\r\n while (cont2 < x-1 and a[cont2] > a[cont2 + 1]): #Importa el orden dentro del while\r\n aux.append(cont2)\r\n #print(aux)\r\n cont2 = cont2 + 2\r\n if cont2 != cont1:\r\n print(aux[0]+1,aux[-1]+2)\r\n reordenar(a,aux[0]+1,aux[-1]+1)\r\n cont1=1*-1\r\n #print(a)\r\n #break;\r\n cont1 += 1\r\n\r\n\r\n\r\n\r\n\r\n#mylist = [mylist[i] for i in myorder] #Sirve para REconstruir una lista, desde 0\r\n\r\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\ninput=stdin.readline\r\ndef print(*args, end='\\n', sep=' ') -> None:\r\n stdout.write(sep.join(map(str, args)) + end)\r\n\r\nn=int(input()) ; arr=list(map(int,input().split()))\r\nfor i in range(n-1,0,-1):\r\n for j in range(i):\r\n if arr[j]>arr[j+1]:\r\n arr[j],arr[j+1]=arr[j+1],arr[j]\r\n print(j+1,j+2)\r\n", "def solve(a):\r\n segments = []\r\n while True:\r\n changed = False\r\n\r\n for i in range(len(a) - 1):\r\n if a[i] > a[i + 1]:\r\n a[i], a[i + 1] = a[i + 1], a[i]\r\n\r\n segments.append(f\"{i + 1} {i + 2}\")\r\n changed = True\r\n\r\n if not changed:\r\n break\r\n\r\n return \"\\n\".join(segments)\r\n\r\ndef main():\r\n n = int(input())\r\n a = list(map(int, input().split()))\r\n result = solve(a)\r\n print(result)\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "# import math\r\nfrom collections import Counter, deque, defaultdict\r\nfrom math import *\r\n# from bisect import bisect_right\r\nmod = 1000000007\r\n# from functools import reduce\r\n# from itertools import permutations\r\n# import queue\r\n\r\n\r\ndef solve():\r\n n=int(input())\r\n l=list(map(int,input().split()))\r\n x=sorted(l)\r\n ans=[]\r\n while l!=x:\r\n for i in range(n-1):\r\n if l[i]>l[i+1]:\r\n ans.append([i+1,i+2])\r\n l[i],l[i+1]=l[i+1],l[i]\r\n break\r\n for i in ans:\r\n print(*i)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n# t=int(input())\r\nt = 1\r\nfor _ in range(t):\r\n # print(\"Case #{}: \".format(_ + 1), end=\"\")\r\n solve()", "n = int(input())\na = map(int, input().split(' '))\na = list(a)\n \nans = []\nfor j in range(1, n):\n\tfor i in range(n-j):\n\t\tif a[i] > a[i + 1]:\n\t\t\tans.append((i+1, i + 2))\n\t\t\ta[i], a[i+1] = a[i+1], a[i]\n \nfor (i, j) in ans:\n\tprint(\"{} {}\".format(i, j))\n", "import os\r\n\r\nn = int(input())\r\na = list(map(int, input().split(' ')))\r\nsteps = []\r\nfor i in range(n, -1, -1):\r\n for j in range(i-1):\r\n if a[j] <= a[j+1]:\r\n continue\r\n a[j], a[j+1] = a[j+1], a[j]\r\n steps.append('{} {}'.format(j+1, j+2))\r\nprint(os.linesep.join(steps))", "def rearrange_animals(n, animals):\r\n operations = []\r\n \r\n for i in range(1, n):\r\n for j in range(0, n-i):\r\n if animals[j] > animals[j+1]:\r\n operations.append((j+1, j+2))\r\n animals[j], animals[j+1] = animals[j+1], animals[j]\r\n \r\n if len(operations) >= 20000:\r\n return operations\r\n \r\n return operations\r\n\r\nn = int(input())\r\n\r\nanimals = list(map(int, input().split()))\r\noperations = rearrange_animals(n, animals)\r\n\r\nfor op in operations:\r\n print(op[0], op[1])\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\n\r\nn = int(input())\r\nw = list(map(int, input().split()))\r\nfor i in range(n):\r\n m = w.index(min(w))\r\n for _ in range(m):\r\n print(m+i-_, m+i+1-_)\r\n w = w[:m] + w[m+1:]", "# بســـــم الله الرحمن الرحيم\r\ndef swap(arr, l, r):\r\n for i in range(l-1, r-1, 2):\r\n wait = arr[i+1]\r\n arr[i+1] = arr[i]\r\n arr[i] = wait\r\n return arr\r\n\r\n\r\ndef recommend_start_and_end(arr):\r\n once = True\r\n remember_start = 0\r\n remember_end = 0\r\n i = 0\r\n while i+1 < len(arr):\r\n if arr[i+1] < arr[i]:\r\n if once:\r\n remember_start = i\r\n once = False\r\n remember_end = i+1\r\n i += 1\r\n if remember_start == remember_end == 0:\r\n once = True\r\n i = 1\r\n while i+1 < len(arr):\r\n if arr[i+1] < arr[i]:\r\n if once:\r\n remember_start = i\r\n once = False\r\n remember_end = i+1\r\n i += 1\r\n if ( (remember_end+1) - (remember_start+1) + 1 ) % 2 == 0:\r\n return remember_start+1, remember_end+1\r\n else:\r\n return remember_start+1, remember_end\r\n\r\n\r\ndef main():\r\n# input\r\n n = int(input())\r\n heights = [int(i) for i in input().split()]\r\n target = sorted(heights)\r\n\r\n# proccessing\r\n segments = []\r\n # print(recommend_start_and_end(heights))\r\n while heights != target:\r\n l, r = recommend_start_and_end(heights)\r\n segments.append((l, r))\r\n heights = swap(heights, l, r)\r\n# output\r\n for segment in segments:\r\n print(segment[0], segment[1])\r\nif __name__=='__main__':\r\n main()", "n=int(input())\r\na=list(map(int,input().split()))\r\nfor i in range(n):\r\n\tfor j in range(n-1):\r\n\t\tif(a[j]>a[j+1]):\r\n\t\t\ta[j],a[j+1]=a[j+1],a[j]\r\n\t\t\tprint(j+1,j+2)", "n = int(input())\r\na = list(map(int, input().split()))\r\n\r\nfor i in range(n-1, 0, -1):\r\n for j in range(i):\r\n if a[j] > a[j+1]:\r\n a[j], a[j+1] = a[j+1], a[j]\r\n print(j+1, j+2)", "def solve (n,seq) :\r\n outer = 0\r\n while outer < n :\r\n inner = 0\r\n while inner < n - outer - 1 :\r\n \r\n if seq[inner] > seq[inner+1] :\r\n seq[inner] , seq[inner+1] = seq[inner+1],seq[inner]\r\n print (inner+1,inner+2)\r\n inner += 1\r\n outer += 1\r\n \r\n\r\n \r\n\r\n\r\nn = int(input())\r\nseq = list(map(int,input().split()))\r\n\r\n\r\nsolve(n,seq)\r\n \r\n ", "n=int(input())\r\nl=[int(x) for x in input().split()]\r\nfor i in range(n):\r\n for j in range(n-1):\r\n if l[j]>l[j+1]:\r\n print(j+1,j+2)\r\n l[j],l[j+1]=l[j+1],l[j]", "n=int(input())\r\na=[int(i) for i in input().split()]\r\nb=sorted(a)\r\nif b==a:\r\n print()\r\nelse:\r\n while b!=a:\r\n for i in range(0,n-1,1):\r\n if a[i]>a[i+1]:\r\n a[i],a[i+1]=a[i+1],a[i]\r\n print(i+1,i+2)\r\n ", "n = int(input())\r\n\r\na = [int(x) for x in input().split()]\r\n\r\nis_sorted = False\r\nwhile not is_sorted:\r\n is_sorted = True\r\n for i in range(n - 1):\r\n if a[i] > a[i + 1]:\r\n is_sorted = False\r\n print(i + 1, i + 2)\r\n a[i], a[i + 1] = a[i + 1], a[i]\r\n", "import sys,math,bisect,heapq\r\ninput = sys.stdin.readline\r\n# print = sys.stdout.write\r\n# t=int(input())\r\n\r\ndef solve():\r\n ### input init.\r\n ## num\r\n n=int(input())\r\n # n,u,v=map(int,input().split())\r\n ## string\r\n # s=input().rstrip(\"\\n\")\r\n ## list\r\n l=list(map(int,input().split()))\r\n ## matrix\r\n # matrix=[list(map(int,input().split())) for _ in range(n)]\r\n\r\n # solve.\r\n\r\n ls=list(sorted(l))\r\n for i in range(n):\r\n for j in range(i,n):\r\n if ls[i]==l[j]:\r\n if i==j:\r\n break\r\n for k in range(j,i,-1):\r\n print(k,k+1)\r\n l[i+1:j+1]=l[i:j]\r\n break\r\n \r\n # return.\r\n return\r\n\r\nsolve()\r\n# print(str(solve()))\r\n# for _ in range(t):\r\n# print(str(solve())+\"\\n\")", "# LUOGU_RID: 120817526\n# 输入 n。\r\nn=int(input())\r\n# 输入数组。\r\na=list(map(int, input().split()))\r\n# 冒泡排序。\r\nfor i in range(1,n):\r\n # 遍历数组，从后往前。\r\n for j in range(n-1, i-1,-1):\r\n \t# 交换。\r\n if a[j]<a[j-1]:\r\n # Python 独有的交换方式。\r\n a[j],a[j-1]=a[j-1],a[j]\r\n # 输出。\r\n print(j,j+1)\r\n\r\n\r\n", "def isSorted(a):\r\n for i in range(0, len(a)-1):\r\n if a[i] > a[i+1]:\r\n return False\r\n return True\r\n\r\nn = int(input())\r\na = [int(x) for x in input().split()]\r\n\r\nwhile not isSorted(a):\r\n\r\n for i in range(0,n-1):\r\n if a[i] > a[i+1]:\r\n print(i+1,i+2)\r\n a[i+1],a[i] = a[i],a[i+1]\r\n", "n = int(input())\r\nvals = list(map(int, input().split()))\r\nso = list(sorted(vals))\r\nwhile(vals!=so):\r\n i = 0\r\n while(i < n-1):\r\n if(vals[i]>vals[i+1]):\r\n vals[i], vals[i+1] = vals[i+1], vals[i]\r\n j = i+2\r\n while(j<n-1 and vals[j]>vals[j+1]):\r\n \r\n vals[j], vals[j+1] = vals[j+1], vals[j]\r\n j+=2\r\n print(i+1, j)\r\n \r\n else:\r\n i+=1" ]

[ "input()\r\np={ (1<< 'RGBYW'.index(c)) + (1<<int(k)+4) for c, k in input().split()}\r\nmn=20\r\nres=90\r\nfor i in range(1024):\r\n if len(p)==len(set(i&j for j in p)):\r\n mn=min(mn,bin(i).count('1'))\r\nprint(mn)", "n = int(input())\r\nlist1 = list(set(input().split()))\r\nbins = []\r\nif len(list1)==1:\r\n print(0)\r\nelse:\r\n for i in range(1,1024):\r\n bins.append(bin(i)[2:].zfill(10))\r\n imp = 'RGBYW12345'\r\n lens = []\r\n for k in bins:\r\n s = ''\r\n temp = []\r\n c = 0\r\n for h in k:\r\n if h=='1':\r\n s += imp[c]\r\n c+=1\r\n for i in list1:\r\n x = ''\r\n for bruh in s:\r\n if i[0]==bruh or i[1]==bruh:\r\n x += '1'\r\n else:\r\n x += '0'\r\n temp.append(x)\r\n if len(set(temp))==len(temp):\r\n lens.append(len(s))\r\n print(min(lens))", "input()\r\np = {(1 << 'RGBYW'.index(c)) + (1 << int(k) + 4) for c, k in input().split()}\r\nprint(min(bin(t).count('1') for t in range(1024) if len({t & q for q in p}) == len(p)))", "input()\ncards = list(set(input().split()))\nQUERIES = \"12345RGBYW\"\n\n\ndef check(card1, card2, query):\n if card1[0] != card2[0] and ((card1[0] in query) or (card2[0] in query)):\n return True\n if card1[1] != card2[1] and ((card1[1] in query) or (card2[1] in query)):\n return True\n return False\n\n\nans = 10\nfor mask in range(2 ** 10):\n query = \"\"\n for i in range(10):\n if (mask >> i) & 1:\n query += QUERIES[i]\n good = True\n for i in range(len(cards)):\n for j in range(i + 1, len(cards)):\n if not check(cards[i], cards[j], query):\n good = False\n break\n if not good:\n break\n if good:\n ans = min(ans, len(query))\nprint(ans)\n \n", "\"\"\"\r\nCodeforces Round 253 Div 1 Problem A\r\n\r\nAuthor : chaotic_iak\r\nLanguage: Python 3.3.4\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:\r\n return inputs\r\n if mode == 1:\r\n return inputs.split()\r\n if mode == 2:\r\n return [int(x) for x in inputs.split()]\r\n\r\ndef write(s=\"\\n\"):\r\n if isinstance(s, list): s = \" \".join(map(str,s))\r\n s = str(s)\r\n print(s, end=\"\")\r\n\r\n################################################### SOLUTION\r\nimport itertools\r\ncovers = itertools.product([0,1], repeat=10)\r\n\r\nn, = read()\r\ns = read(1)\r\na = [0] * 25\r\ncolors = \"RGBYW\"\r\nfor i in s:\r\n a[colors.index(i[0]) * 5 + int(i[1])-1] |= 1\r\n\r\ndef check(cover):\r\n global a\r\n unknowns = [0] * 11\r\n for i in range(25):\r\n if not a[i]: continue\r\n id = -1\r\n if not cover[i%5]: id = 5+i//5\r\n if not cover[5+i//5]:\r\n if id == -1:\r\n id = i%5\r\n else:\r\n id = 10\r\n if id > -1:\r\n if unknowns[id]: return False\r\n unknowns[id] = 1\r\n return True\r\n\r\nmn = 99\r\nfor i in covers:\r\n if check(i):\r\n mn = min(mn, sum(i))\r\n\r\nprint(mn)", "n=int(input().strip())\r\na=list(set(input().strip().split(' ')))\r\n\r\nn=len(a)\r\nmn=10\r\n\r\nmatch=\"RGBYW12345\"\r\n\r\nfor mask in range(0,2**10):\r\n b=[[0] for i in range(n)]\r\n curr=\"\"\r\n c=[0 for i in range(11)]\r\n for i in range(10):\r\n if mask&(2**i):\r\n curr+=match[i]\r\n for i in range(n):\r\n if a[i][0] in curr and a[i][1] in curr:\r\n continue\r\n elif a[i][0] in curr:\r\n c[match.find(a[i][0])]+=1\r\n elif a[i][1] in curr:\r\n c[match.find(a[i][1])]+=1\r\n else:\r\n c[10]+=1\r\n if max(c)<=1:\r\n mn=min(mn,len(curr))\r\n\r\nprint(mn)\r\n", "color = ['R',\"B\",\"G\",\"Y\",\"W\",\"1\",\"2\",\"3\",\"4\",\"5\"]\r\nw = int(input())\r\ninp1 = map(str,input().split())\r\ninp = list(set(inp1))\r\nlist2= []\r\nfor i in range(2**10):\r\n list1 = []\r\n bin1=list((bin(i)).replace(\"0b\",\"\").zfill(10))\r\n for i in range(10):\r\n if bin1[i]==\"1\":\r\n list1+=[color[i]]\r\n list2+=[list1]\r\n \r\n \r\n \r\nlist3 = []\r\nfor i in list2:\r\n list4 = []\r\n d = len(i)\r\n for j in inp:\r\n str1= \"\"\r\n for e in i:\r\n if e==j[0] or e==j[1]:\r\n str1+=\"1\"\r\n else:\r\n str1+=\"0\"\r\n list4+=[str1]\r\n if len(list4)==len(set(list4\r\n )):\r\n list3+=[d]\r\nprint(min(list3))", "from itertools import *\npower = lambda i: chain.from_iterable(combinations(i, r) for r in range(len(i) + 1))\ninput()\ncards = set(input().split())\nprint(min(len(s) for s in power(\"RGBYW12345\") if\n len(set(str(set(s) & set(t)) for t in cards)) == len(cards)\n))\n", "def check(hint, Card):\r\n for i in Card :\r\n for j in Card :\r\n if i == j : continue\r\n elif i[0] == j[0] :\r\n if i[1] not in hint and j[1] not in hint :\r\n return False\r\n elif i[1] == j[1] :\r\n if i[0] not in hint and j[0] not in hint :\r\n return False\r\n else :\r\n if i[0] not in hint and i[1] not in hint and j[0] not in hint and j[1] not in hint :\r\n return False\r\n return True\r\nHH = \"RGBYW12345\"\r\nn = int(input())\r\nCard = list(input().split(' '))\r\nans = 20\r\nfor i in range(1024):\r\n hint = \"\"\r\n cnt = 0\r\n for j in range(10) :\r\n if (2**j)&i > 0 :\r\n hint += HH[j]\r\n cnt+=1\r\n if check(hint, Card) :\r\n ans = min(ans, cnt)\r\nprint(ans) ", "from itertools import combinations\r\nn = int(input())\r\ncolors = {'R':0,'G':1,'B':2,'Y':3,'W':4}\r\nletters = {'1':0,'2':1,'3':2,'4':3,'5':4}\r\nl = list(set(list(input().split())))\r\ndef checker(hint,cards):\r\n for i in cards:\r\n for j in cards:\r\n if i == j:\r\n continue\r\n if i[0] == j[0]:\r\n if i[1] not in hint and j[1] not in hint:\r\n return False\r\n elif i[1] == j[1]:\r\n if i[0] not in hint and j[0] not in hint:\r\n return False\r\n else:\r\n if i[0] not in hint and i[1] not in hint and j[0] not in hint and j[1] not in hint:\r\n return False\r\n return True\r\nresult = []\r\nfor i in l:\r\n if i[0] not in result:\r\n result.append(i[0])\r\n if i[1] not in result:\r\n result.append(i[1])\r\nall_hints = []\r\nfor i in range(1,len(result)+1):\r\n comb = combinations(result,i)\r\n all_hints += comb\r\nmin_hint = len(result)\r\nif len(l) == 1:\r\n print (0)\r\nelse:\r\n for i in all_hints:\r\n if checker(i,l):\r\n min_hint = min(len(i),min_hint)\r\n print (min_hint)\r\n\r\n", "from itertools import chain, combinations\r\nfrom copy import deepcopy\r\ndef powerset(iterable):\r\n s = list(iterable)\r\n return chain.from_iterable(combinations(s, r) for r in range(len(s)+1))\r\nn = int(input())\r\nlocations = input().split()\r\nmatrixG = [[0]*5 for i in range(5)]\r\nfor i in locations:\r\n if i[0] == \"R\":\r\n matrixG[0][int(i[1])-1] += 1\r\n elif i[0] == \"G\":\r\n matrixG[1][int(i[1])-1] += 1\r\n elif i[0] == \"B\":\r\n matrixG[2][int(i[1])-1] += 1\r\n elif i[0] == \"Y\":\r\n matrixG[3][int(i[1])-1] += 1\r\n elif i[0] == \"W\":\r\n matrixG[4][int(i[1])-1] += 1\r\n\r\nfor i in list(powerset(range(10))):\r\n matrix = deepcopy(matrixG)\r\n color = []\r\n value = []\r\n for j in i:\r\n if j <= 4:\r\n color.append(j)\r\n else:\r\n value.append(j)\r\n for v in value:\r\n for c in color:\r\n matrix[c][v-5] = 0\r\n ctr = 0\r\n for r in range(5):\r\n if matrix[r][v-5] == 0:\r\n ctr += 1\r\n if ctr == 4:\r\n for r in range(5):\r\n matrix[r][v-5] = 0\r\n for c in color:\r\n if matrix[c].count(0) == 4:\r\n matrix[c] = [0]*5\r\n ctr = 0\r\n for k in range(5):\r\n for j in range(5):\r\n if matrix[k][j] == 0:\r\n ctr += 1\r\n if ctr == 24:\r\n print(len(i))\r\n break\r\n", "input()\ncolour = dict(zip('RGBYW', range(5)))\ncards = {(colour[c], ord(v) - ord('1')) for c, v in input().split()}\n\nprint(min(bin(cs).count('1') + bin(vs).count('1')\n for cs in range(1<<5) for vs in range(1<<5)\n if len({\n (c if (cs >> c) & 1 else -1, v if (vs >> v) & 1 else -1)\n for c, v in cards\n }) == len(cards)\n))\n", "input()\ncolour = {'R': 0, 'G': 1, 'B': 2, 'Y': 3, 'W': 4}\ncards = {(colour[c], ord(v) - ord('1')) for c, v in input().split()}\n\ndef ok(cs, vs):\n return len({\n (c if (cs >> c) & 1 else -1, v if (vs >> v) & 1 else -1)\n for c, v in cards\n }) == len(cards)\n\nprint(min(bin(cs).count('1') + bin(vs).count('1')\n for cs in range(1<<5) for vs in range(1<<5)\n if ok(cs, vs)\n))\n" ]

[ "import sys\nfrom collections import deque\nreadline = sys.stdin.readline\n\nN, M = [int(w) for w in readline().split()]\ncity = [[] for _ in range(N + 1)]\nedges = []\nfor _ in range(M):\n u, v = [int(w) for w in readline().split()]\n city[u].append(v)\n city[v].append(u)\n edges.append((u, v))\n\ndef gen_dists(node: int) -> list:\n result = [N + 1] * (N + 1)\n dq = deque([node])\n result[node] = 1\n while dq:\n u = dq.popleft()\n for v in city[u]:\n if result[v] <= result[u] + 1:\n continue\n result[v] = result[u] + 1\n dq.append(v)\n return result\n\ndist_alex = gen_dists(1)\ndist_bob = gen_dists(N)\nif dist_alex[-1] > N:\n print(-1)\n exit(0)\n\nseen = {(1, N, 0): (-1, -1, -1)}\nstep_cnt = {(1, N, 0): 0}\nque = deque([(1, N, 0, 0)])\ntarget = (N, 1, 0)\nwhile que:\n u, v, status, step = que.popleft()\n if step >= N:\n break\n if status == 0:\n for v1 in city[v]:\n if (u, v1, 1) in seen:\n continue\n seen[(u, v1, 1)] = (u, v, status)\n if dist_alex[v1] < dist_alex[v]:\n que.appendleft((u, v1, 1, step))\n else:\n que.append((u, v1, 1, step))\n elif status == 1:\n for u1 in city[u]:\n if u1 == v:\n continue\n if (u1, v, 0) in seen:\n continue\n seen[(u1, v, 0)] = (u, v, status)\n if dist_bob[u1] < dist_bob[u]:\n que.appendleft((u1, v, 0, step + 1))\n else:\n que.append((u1, v, 0, step + 1))\n if target in seen:\n break\n if target in seen:\n break\n\nresult = [[], []]\nwhile target in seen:\n if target[-1] == 0:\n result[0].append(target[0])\n result[1].append(target[1])\n target = seen[target]\nif result[0]:\n print(len(result[0]) - 1)\n print(*result[1])\n print(*result[0])\nelse:\n print(-1)\n" ]

[ "import math\r\nfrom typing import List\r\n\r\n#calcula la descomposicion en primos de un numero\r\ndef PrimesDiv(n):\r\n primes_list=[]\r\n cant=0\r\n while n%2==0:\r\n cant+=1\r\n n=n/2\r\n if cant:primes_list.append([2,cant])\r\n\r\n for i in range(3,int(math.sqrt(n))+1,2):\r\n cant=0\r\n while n%i==0:\r\n cant+=1\r\n n=n/i\r\n if cant:primes_list.append([i,cant])\r\n\r\n if n>2:primes_list.append([n,1])\r\n return primes_list\r\n\r\n#Check si alnguno de los ci divide a alguno de los divisores\r\n#de k d la forma primo^cant multiplos del primo que dividen a k\r\ndef IsContain(num,list):\r\n for element in list:\r\n if element%num==0:\r\n return True\r\n return False \r\n\r\ndef Answer(k,input_list):\r\n primes_list=PrimesDiv(k)\r\n for prime,count in primes_list:\r\n bool=IsContain(prime**count,input_list)\r\n if not bool: return False\r\n return True \r\n \r\ndef RemaindersGame():\r\n _,k= input().split()\r\n k=int(k)\r\n anciest=list(map(lambda x: int(x), input().split()))\r\n bool=Answer(k,anciest)\r\n if bool:\r\n print(\"Yes\")\r\n else:\r\n print(\"No\")\r\n\r\nRemaindersGame()", "from math import gcd\nn, k = map(int, input().split())\nans = 1\nfor e in input().split():\n e = int(e)\n ans = ans // gcd(ans, e) * e % k\nprint('No' if ans else 'Yes')\n\n\t \t \t \t\t \t\t", "# from math import gcd\r\n# def lcm(x,y):\r\n# \treturn x*y//gcd(x,y)\r\n# n,k=map(int,input().split())\r\n# lst=[]\r\n# kk=k\r\n# i=2\r\n# while i<=kk:\r\n# \tc=0\r\n# \twhile kk%i==0:\r\n# \t\tc+=1\r\n# \t\tkk//=i\r\n# \tif c:\r\n# \t\tlst.append([i,c])\r\n# \ti+=1\r\n# arr=list(map(int,input().split()))\r\n# flag=True\r\n# for j in lst:\r\n# \tma=0\r\n# \tfor i in range(n):\r\n# \t\tc=0\r\n# \t\twhile arr[i]%j[0]==0:\r\n# \t\t\tc+=1\r\n# \t\t\tarr[i]//=j[0]\r\n# \t\tma=max(c,ma)\r\n# \tif ma<j[1]:\r\n# \t\tflag=False\r\n# \t\tbreak\r\n# print(\"Yes\") if flag else print(\"No\")\r\n\r\nfrom math import gcd\r\ndef lcm(x,y):\r\n\treturn x*y//gcd(x,y)\r\nn,k=map(int,input().split())\r\narr=list(map(int,input().split()))\r\nl=1\r\nfor x in arr:\r\n\tl=gcd(k,lcm(l,x))\r\nprint(\"Yes\") if l==k else print(\"No\")", "from sys import stdin\r\ninput = lambda: stdin.readline().rstrip('\\r\\n')\r\n\r\nN = 10**6 + 1\r\nlpd = [0]*N\r\nfor i in range(2, N):\r\n if not lpd[i]:\r\n for x in range(i, N, i):\r\n lpd[x] = i\r\n\r\nfreq = [0]*N\r\nn, k = map(int, input().split())\r\na = set(map(int, input().split()))\r\nfactors = set()\r\n\r\nfor x in a:\r\n while x > 1:\r\n p = lpd[x]\r\n ct = 0\r\n while x % p == 0:\r\n x //= p\r\n ct += 1\r\n freq[p] = max(freq[p], ct)\r\n\r\nwhile k > 1:\r\n p = lpd[k]\r\n ct = 0\r\n while k % p == 0:\r\n k //= p\r\n ct += 1\r\n if freq[p] < ct:\r\n print('No')\r\n break\r\nelse:\r\n print('Yes')", "from math import gcd, lcm\r\n\r\nn, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\nx = 1\r\nfor i in a:\r\n x = gcd(k, lcm(x, i))\r\nprint('Yes' if x == k else 'No')", "#prime factorize the k\n\nimport math\n\n\n\na=input().split(' ')\n\nn=int(a[0])\n\nk=int(a[1])\n\nt=True\n\ndef gcd(a, b):\n\n\tif b==0: return a\n\n\telse: return gcd(b, a%b)\n\n\n\nC=set(map(int, input().split()))\n\nComposite=False\n\n\n\na=math.floor(math.sqrt(k+1))\n\nif k%2==0: Composite=True\n\nelse:\n\n\tfor i in range(3, a+1, 2):\n\n\t\tif k%i==0:\n\n\t\t\tComposite=True\n\n\t\t\tbreak\n\nif not Composite:\n\n\tif k>max(C):print ('NO')\n\n\telse:\n\n\t\tA=set()\n\n\t\tz=True\n\n\t\tfor i in C:\n\n\t\t\tif i in A: pass\n\n\t\t\tif i%k==0:\n\n\t\t\t\tz=False\n\n\t\t\t\tprint ('YES')\n\n\t\t\t\tbreak\n\n\t\t\telse: A.add(i)\n\n\t\tif z: print('NO')\n\n\n\nelse:\n\n\tA=set()\n\n\tm=1\n\n\tfor i in C:\n\n\t\tif i in A: pass\n\n\t\telse:\n\n\t\t\tA.add(i)\n\n\t\t\tm*=i/gcd(m,i)\n\n\t\t\tm%=k\n\n\t\t\tif m==0:\n\n\t\t\t\tt=False\n\n\t\t\t\tprint('YES')\n\n\t\t\t\tbreak\n\n\tif t: print('NO')\n\n\n\n\n\n\n\n# Made By Mostafa_Khaled", "from math import gcd\r\nn, k = map(int, input().split())\r\nans = 1\r\nfor e in input().split():\r\n e = int(e)\r\n ans = ans // gcd(ans, e) * e % k\r\nprint('No' if ans else 'Yes')", "import math\n\nn,k = map(int,input().split())\narray_c = list(map(int,input().split()))\n\nwin = array_c[0]\n\nfor i in array_c:\n win = win*i//math.gcd(win,i)%k\n if win == 0:\n print(\"Yes\")\n exit()\nprint(\"No\")\n \t\t\t \t \t \t \t\t\t\t \t\t \t\t\t\t \t", "def get_primes(n):\n x = 2\n primes = {}\n while n > 1:\n if n % x == 0:\n primes[x] = primes.get(x, 0) + 1\n n //= x\n elif n < x * x:\n primes[n] = primes.get(n, 0) + 1\n break\n else:\n x += 1\n return primes\n\n\ndef solve(k, cs):\n pps = {pr ** pw for pr, pw in get_primes(k).items()}\n for c in cs:\n for_del = set()\n for pp in pps:\n if c % pp == 0:\n for_del.add(pp)\n pps -= for_del\n return len(pps) == 0\n\n\nn, k = map(int, input().split())\ncs = set(map(int, input().split()))\nprint('Yes' if solve(k, cs) else 'No')\n\t\t \t \t \t\t\t \t\t \t \t \t\t \t", "def gcd(x, y): \r\n \r\n while(y): \r\n x, y = y, x % y \r\n \r\n return x \r\n\r\nn, k = map(int, input().split())\r\nl = map(int, input().split())\r\n\r\nlcm = 1\r\n\r\nfor v in l:\r\n lcm = lcm * v // gcd(lcm, v)\r\n lcm = gcd(lcm, k)\r\n\r\nif k == lcm:\r\n print('Yes')\r\nelse:\r\n print('No')\r\n", "import math\n\n\ndef mmc(a, b):\n return int(a / math.gcd(a, b)) * b\n\n\ndef resolver():\n n, k = map(int, input().split())\n valores_antigos = list(map(int, input().split()))\n\n L = 1\n for valor in valores_antigos:\n gcd = math.gcd(valor, k)\n L = mmc(L, gcd)\n\n if L == k:\n print(\"Yes\")\n else:\n print(\"No\")\n\n\nresolver()\n\n \t\t \t\t\t\t \t\t\t \t \t\t \t\t \t\t\t", "import sys, math\r\ninput = sys.stdin.readline\r\n\r\ndef getInts():\r\n return [int(s) for s in input().split()]\r\n\r\ndef getInt():\r\n return int(input())\r\n\r\ndef getStrs():\r\n return [s for s in input().split()]\r\n\r\ndef getStr():\r\n return input().strip()\r\n\r\ndef listStr():\r\n return list(input().strip())\r\n\r\nimport collections as col\r\nimport math\r\n\r\ndef prime_factors(n):\r\n factors = []\r\n num = 0\r\n while n % 2 == 0:\r\n num += 1\r\n n //= 2\r\n if num:\r\n factors.append((2,num))\r\n i = 3\r\n while n > 1 and i*i <= n:\r\n num = 0\r\n while n % i == 0:\r\n num += 1\r\n n //= i\r\n if num:\r\n factors.append((i,num))\r\n i += 2\r\n if n > 2:\r\n factors.append((n,1))\r\n return factors\r\n\r\ndef fails(num,C):\r\n for c in C:\r\n if c % num == 0:\r\n return False\r\n return True\r\n\r\ndef solve():\r\n #we need to know whether, amongst the C values, there are two or more pairwise coprime values whose product equals K\r\n N, K = getInts()\r\n C = set(getInts())\r\n K_facs = prime_factors(K)\r\n for k0, k1 in K_facs:\r\n if fails(k0**k1,C):\r\n return \"No\"\r\n return \"Yes\"\r\n \r\n#for _ in range(getInt()):\r\nprint(solve())\r\n \r\n\r\n", "import math\r\nn,k=[int(i) for i in input().split()]\r\nc = [int(i) for i in input().split()]\r\nfactors = []\r\nfor i in range(2,math.ceil(math.sqrt(k))+1):\r\n if not k%i:\r\n b=i\r\n while not k%b:\r\n b*=i\r\n b//=i\r\n k//=b\r\n factors.append(b)\r\nif k > 1: factors.append(k)\r\nfor i in c:\r\n j=0\r\n while j < (len(factors)):\r\n if not i%factors[j]:\r\n factors.pop(j)\r\n else:\r\n j+=1\r\n \r\n \r\nif(len(factors)):\r\n print(\"no\")\r\nelse:\r\n print(\"yes\")", "import sys\nlcmm = lambda *args: reduce(lcm, args, 1)\nfrom heapq import heappush,heappop\nfrom functools import reduce\ninput = sys.stdin.readline\ndef ii():\n return int(input())\ndef li():\n return list(map(int, input().split()))\n\nfrom math import gcd\nlcm = lambda a, b: a * b // gcd(a, b)\n_, k = li()\nshit = 1\nfor i in li():\n shit = lcm(shit, i)\n shit = gcd(shit, k)\nprint('Yes' if k == shit else 'No')\n\n \t\t\t\t \t\t \t\t \t\t \t\t \t\t\t \t \t", "import sys\r\nfrom math import gcd\r\ninput = sys.stdin.readline\r\nn, k = map(int, input().split())\r\nv = list(map(int, input().split()))\r\nlcm = 1\r\nfor u in v:\r\n lcm = lcm * u // gcd(u, lcm)\r\n lcm = gcd(lcm, k)\r\nprint ([\"No\", \"Yes\"][lcm == k])", "import math\r\nn,x = map(int,input().split())\r\nv = list(map(int,input().split()))\r\n\r\nok = 1\r\nfor i in v:\r\n ok = (i * ok) // math.gcd(i,ok)\r\n ok = math.gcd(ok,x)\r\n\r\nprint(\"Yes\" if ok == x else \"No\")\r\n\r\n", "from math import gcd\r\ndef lcm(x,y):\r\n\treturn x*y//gcd(x,y)\r\nn,k=map(int,input().split())\r\nlst=[]\r\nkk=k\r\ni=2\r\nwhile i<=kk:\r\n\tc=0\r\n\twhile kk%i==0:\r\n\t\tc+=1\r\n\t\tkk//=i\r\n\tif c:\r\n\t\tlst.append([i,c])\r\n\ti+=1\r\narr=list(map(int,input().split()))\r\nflag=True\r\nfor j in lst:\r\n\tma=0\r\n\tfor i in range(n):\r\n\t\tc=0\r\n\t\twhile arr[i]%j[0]==0:\r\n\t\t\tc+=1\r\n\t\t\tarr[i]//=j[0]\r\n\t\tma=max(c,ma)\r\n\tif ma<j[1]:\r\n\t\tflag=False\r\n\t\tbreak\r\nprint(\"Yes\") if flag else print(\"No\")", "from math import gcd\n\n\ndef lcm(a, b):\n\treturn (a * b) // gcd(a, b)\n\n\ndef main():\n\tn, k = map(int, input().split())\n\tans = 1\n\ta = list(map(int, input().split()))\n\tfor i in range(n):\n\t\ttc = a[i]\n\t\tgc = gcd(tc, k)\n\t\tans = lcm(ans, gc)\n\tif ans == k:\n\t\tprint('Yes')\n\telse:\n\t\tprint('No')\nmain()\n \t\t \t \t\t\t \t \t\t\t\t\t", "# https://codeforces.com/problemset/problem/687/B\nMAX = 1000000\nn,k = map(int,input().split())\nancient = [int(x) for x in input().split()]\n\nisPrime = [0 for x in range(MAX+1)]\ncount = [0 for x in range(MAX+1)]\n\nfor x in range(2,MAX+1):\n if not isPrime[x]:\n for y in range(x,MAX+1,x):\n isPrime[y] = x\n\nfor val in ancient:\n while val > 1:\n p = isPrime[val]\n c = 0\n while val%p == 0:\n c+=1\n val = val//p\n count[p] = max(count[p],c)\n\nflag = True \nwhile k > 1:\n flag &= (count[isPrime[k]] > 0)\n count[isPrime[k]] -= 1\n k = k//isPrime[k]\nprint(\"Yes\" if flag else \"No\")", "import math,sys\r\nfrom typing import List\r\n\r\n#calcula la descomposicion en primos de un numero n\r\ndef PrimesDiv(n):\r\n primes_list=[]\r\n cant=0\r\n while n%2==0:\r\n cant+=1\r\n n=n/2\r\n if cant:primes_list.append([2,cant])\r\n\r\n for i in range(3,int(math.sqrt(n))+1,2):\r\n cant=0\r\n while n%i==0:\r\n cant+=1\r\n n=n/i\r\n if cant:primes_list.append([i,cant])\r\n\r\n if n>2:primes_list.append([n,1])\r\n return primes_list\r\n\r\n#Check si alnguno de los ci divide a alguno de los divisores\r\n#de k d la forma primo^cant multiplos del primo que dividen a k\r\ndef IsContain(num,list):\r\n for element in list:\r\n if element%num==0:\r\n return True\r\n return False \r\n\r\n#busca el producto de primos que generan a k y llama a IsContained que busca por cada ci si \r\n# alguno de ellos divide a cada una d la maxima potencia de esos primos tal que divide a k\r\ndef Answer(k,input_list):\r\n primes_list=PrimesDiv(k)\r\n for prime,count in primes_list:\r\n bool=IsContain(prime**count,input_list)\r\n if not bool: return False\r\n return True \r\n \r\n#Recibe las entradas, llama al metodo Answer que retorna el booleno de si k/ mcm(c1,..cn)\r\n# y en dependencia a eso retorna la respuesta \r\ndef RemaindersGame():\r\n #recibiendo las entradas\r\n _,k= sys.stdin.readline().split()\r\n k=int(k)\r\n a=sys.stdin.readline().split()\r\n anciest=[]\r\n\r\n for x in a:\r\n anciest.append(int(x))\r\n \r\n #llama al metodo an\r\n bool=Answer(k,anciest)\r\n if bool:\r\n print(\"Yes\")\r\n else:\r\n print(\"No\")\r\n\r\nRemaindersGame()", "import math\n\nn, k = list(map(int, input().split()))\nc = list(map(int, input().split()))\n\nc_0 = c[0]\n\nfor i in c:\n c_0 = c_0 * i // math.gcd(c_0, i) % k\n if c_0 == 0:\n print('Yes')\n exit()\n\nprint('No')\n\n\t \t \t \t \t\t\t\t \t\t\t \t", "from math import lcm, gcd\n\nn, k = map(int, input().split())\na = list(map(int, input().split()))\n\ncur = 1\nfor x in a:\n cur = gcd(k, lcm(cur, x))\n \nprint(\"Yes\" if cur == k else \"No\")", "import math\r\nn, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\ng = 1\r\nfor i in a:\r\n g = math.gcd(k, i * g//math.gcd(i, g))\r\nif g == k:\r\n print('Yes')\r\nelse:\r\n print('No')\r\n", "# *********************************************************************\r\n# *-------------------------------------------------------------------*\r\n# * *\r\n# * Life is just a life. Lead it, Feel it & Enjoy It Properly. *\r\n# * Nothing is impossible. Just believe in yourself & Almighty. *\r\n# * *\r\n# *-------------------------------------------------------------------*\r\n# *********************************************************************\r\nimport math\r\n\r\ndef LCM(a,b):\r\n return int(a/math.gcd(a,b))*b\r\n\r\ndef DenTofieM():\r\n n, k = map(int,input().split())\r\n ar = list(map(int,input().split()))\r\n\r\n L=1\r\n for i in ar:\r\n G=math.gcd(i,k)\r\n L=LCM(L,G)\r\n if L==k: print(\"Yes\")\r\n else: print(\"No\")\r\n\r\nDenTofieM()\r\n", "from math import gcd, lcm\n\nn, k = map(int, input().split())\nout = 1\nfor v in map(int, input().split()):\n out = lcm(out, v)\n out = gcd(k, out)\n\nif out == k:\n print('Yes')\nelse:\n print('No')\n\n \t \t \t\t\t\t \t \t \t\t\t\t \t", "import math\n\ndef lcm(a, b):\n return a*b//math.gcd(a, b)\n\n[n, k] = [int(d) for d in input().split()]\nC = [int(d) for d in input().split()]\n\ntemp = C[0]\n\nfor c in C:\n temp = math.gcd(lcm(temp, c), k)\n\nif temp == k:\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" ]

[ "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\nn, x = map(int, input().split())\r\na = list(map(int, input().split()))\r\nl = 105\r\ncnt = [0] * l\r\nfor i in a:\r\n cnt[i] += 1\r\nans = 0\r\nfor i in range(x):\r\n if not cnt[i]:\r\n ans += 1\r\nans += cnt[x]\r\nprint(ans)", "g,x = [int(i) for i in input().split()]\r\nn = [int(i) for i in input().split()]\r\nh = [False] * 101\r\nfor i in n:\r\n h[i] = True\r\np = 0\r\nfor i in range(x):\r\n if h[i] == False:\r\n p+=1\r\nif h[x] == True:\r\n p+=1\r\nprint(p)\r\n", "n, x = map(int,input().split())\ns = set(map(int,input().split()))\na = len(set(range(0, x)) - s)\nprint(a+1 if x in s else a)\n", "n,x = map(int,input().split())\r\na = list(map(int, input().split()))\r\na.sort()\r\nans = 0\r\nif x in a:\r\n\tfor i in range(x+1):\r\n\t\tif i == x and i in a:\r\n\t\t\tans += 1\r\n\t\telif i not in a:\r\n\t\t\tans += 1\r\nelse:\r\n\tfor i in range(x):\r\n\t\tif i not in a:\r\n\t\t\tans += 1\r\nprint(ans)", "n,x=list(map(int,input().split()))\r\nl=list(map(int,input().split()))\r\nt=0\r\nfor i in range(0,x+1):\r\n if i in l and i==x:\r\n print(t+1)\r\n break\r\n elif i==x and i not in l:\r\n print(t)\r\n break\r\n elif i in l:\r\n pass\r\n else:\r\n t +=1\r\nelse:\r\n print(t)\r\n ", "a = int(input().split()[1])\r\ns = input().split()\r\nd = []\r\nsmall_list = list(range(a))\r\nsmall = len(small_list)\r\nsame = 0\r\nfor i in s:\r\n d.append(int(i))\r\nd.sort()\r\nfor i in d:\r\n if i == a:\r\n same += 1\r\n elif i in small_list:\r\n small -= 1\r\n small_list.remove(i)\r\nprint(small + same)", "while True:\n try:\n n,x=map(int,input().split())\n except:\n break\n thelist=list(map(int,input().split()))\n thelist.sort()\n time1=time2=0\n for i in range(0,x):\n if i not in thelist:\n time1+=1\n time1=time1+thelist.count(x)\n print(time1)\n", "k=lambda:map(int,input().split())\r\n_,x=k()\r\nprint(x+sum((i==x)-(i<x)for i in k()))", "import sys\n\nstr1 = sys.stdin.readline()\nnum1, num2 = int(str1.split(\" \")[0]), int(str1.split(\" \")[1])\nstr2 = sys.stdin.readline()\n\nlst = []\n\nfor i in range(num1):\n lst.append(int(str2.split(\" \")[i]))\n\nresult = 0\n\ncom = list(range(num2))\nfor i in range(num2):\n if i not in lst:\n result += 1\nfor i in range(num1):\n if lst[i] > num2:\n continue\n if lst[i] == num2:\n result += 1\nprint(result)\n\n\t\t \t \t \t \t\t\t \t \t \t\t\t \t\t\t\t", "n,x = map(int,input().split())\r\nlist1 = list(map(int,input().split()))\r\nt = 0\r\nfor i in range(0,x):\r\n\tif i in list1:\r\n\t\tcontinue\r\n\telse:\r\n\t\tt = t + 1\r\nif x in list1:\r\n\tt = t + 1\r\nprint(t)", "r = lambda: map(int,input().split())\r\nn, x = r()\r\nres = [y for y in r() if y<=x]\r\nprint (x-len(res) + 2*(x in res))", "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, k = map(int, input().split())\r\nst = set(map(int, input().split()))\r\nans = 0\r\nfor i in range(101):\r\n if i not in st and i != k:\r\n ans += 1\r\n if i== k and i in st:\r\n ans += 1\r\n break\r\n elif i ==k:\r\n break\r\n\r\nprint(ans)\r\n\r\n", "n,m=[int(i) for i in input().split()]\r\na=[int(i) for i in input().split()]\r\ne=0\r\nfor i in range(0,m):\r\n if(i not in a):\r\n e=e+1\r\nif(m in a):\r\n e=e+1\r\nprint(e)", "import math\r\n\r\n\r\ndef main_function():\r\n n, x = [int(i) for i in input().split(\" \")]\r\n a = [int(i) for i in input().split(\" \")]\r\n counter = 0\r\n for i in range(x):\r\n if not i in a:\r\n counter+= 1\r\n if x in a:\r\n counter += 1\r\n print(counter)\r\n\r\n\r\n\r\n\r\n\r\nmain_function()", "def ok(arr1,k):\r\n res=0\r\n for i in range(k):\r\n if i not in arr1:\r\n res+=1\r\n return res\r\nn,k=map(int,input().split())\r\narr1=set(list(map(int,input().split())))\r\nans=ok(arr1,k)\r\nprint(ans+1 if k in set(arr1) else ans)\r\n", "I = lambda: map(int, input().split())\r\nn, x = I()\r\ns = set(I())\r\na = list((set(range(0,x))-s))\r\nprint(len(a)+(x in s))\r\n", "n, x = map(int, input().split())\r\nl = list(map(int, input().split()))\r\n\r\nc = 0\r\n\r\nif x in l :\r\n\tc += 1\r\nfor i in range(x):\r\n\tif i not in l :\r\n\t\tc += 1\r\n\r\nprint(c)", "##a = list(map(int, input().split()))\r\n##print(' '.join(map(str, res)))\r\n\r\n[n, x] = list(map(int, input().split()))\r\na = list(map(int, input().split()))\r\n\r\ncnt = 0\r\nflag = 0\r\nfor i in range(n):\r\n if a[i] < x:\r\n cnt += 1\r\n elif a[i] == x:\r\n flag = 1\r\nprint(x-cnt+flag)", "n,x = list(map(int, input().split(\" \")))\r\na = list(map(int, input().split(\" \")))\r\ncount,i=0,0\r\nwhile i<x:\r\n if i not in a:\r\n count+=1\r\n i+=1\r\nprint(count if x not in a else count+1)", "n, k = map(int, input().split())\nx = sorted(list(map(int, input().split())))\ncnt_less, cnt_equal = 0, 0\nfor i in range(n):\n if x[i] < k:\n cnt_less += 1\n elif x[i] == k:\n cnt_equal += 1\n else:\n break\nprint(k - cnt_less + cnt_equal)\n", "n, x = map(int, input().split())\r\n\r\nset_daf = set(list(map(int, input().split())))\r\n\r\nc = 0\r\ntotal = 0\r\nwhile c < x:\r\n if c not in set_daf:\r\n total += 1\r\n c += 1\r\n\r\nif x in set_daf:\r\n total += 1\r\n\r\nprint(total)\r\n", "\r\nnum_inp=lambda: int(input())\r\narr_inp=lambda: list(map(int,input().split()))\r\nsp_inp=lambda: map(int,input().split())\r\nstr_inp=lambda:input()\r\na,b=map(int,input().split());c=set(map(int,input().split()));print(len(set(range(b))-c)+[0,1][b in c])", "n, x=map(int,input().split())\r\nl=list(map(int,input().split()))\r\n\r\nif x not in l:\r\n l.append(x)\r\n l.sort()\r\n a=l.index(x)\r\n print(x-a)\r\n\r\nelse:\r\n l.sort()\r\n a=l.index(x)\r\n print(x-a+1)\r\n ", "nx_str = input()\nlist_str = input()\n\nnx_data = list(map(int, nx_str.split()))\nlist_data = list(map(int, list_str.split()))\n\nx = nx_data[1]\nn = nx_data[0]\n\nnum = 0\nfor i in range(n):\n if list_data[i] < x:\n num = num + 1\n \nif x in list_data:\n result_num = x - num + 1\nelse:\n result_num = x - num\n \nprint(result_num)\n\t \t\t\t\t \t \t\t \t \t\t \t\t\t\t \t\t", "n, mex = map(int, input().split())\r\ns = list(map(int, input().split()))\r\nc = 0\r\nif mex in s:\r\n c += 1\r\nfor i in range(mex):\r\n if i not in s:\r\n c += 1\r\nprint(c)", "n,m=map(int,input().split())\r\na=list(map(int,input().split()))\r\ncount=0\r\nfor i in range(m):\r\n if i not in a:\r\n count+=1\r\nif m in a:\r\n count+=1\r\nprint(count)\r\n", "n,x=map(int,input().split())\nl=list(map(int,input().split()))\nl.sort()\npre=[0]*(103)\nfor i in l:\n\tpre[i]=1\nr=0\nfor i in range(101):\n\tif (i==x) and(pre[x]==1):r+=1\n\telif i<x:\n\t\tif pre[i]==0:r+=1\nprint(r)", "n, x = map(int, input().split())\r\na = list(map(int, input().split()))\r\nb = sum(i < x for i in a)\r\nprint(x - b + (x in a))", "g,x=[int(i) for i in input().split()]\r\nn=[int(i) for i in input().split()]\r\nh=[False] * 101\r\nfor i in n:\r\n h[i]=True\r\nQ=False\r\np=0\r\ni=0\r\nwhile Q== False:\r\n if x > i and h[i] == False:\r\n p+=1\r\n elif x==i:\r\n if h[i] == True:\r\n p+=1\r\n Q=True\r\n else:\r\n Q=True\r\n i+=1\r\nprint(p)\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, m = map(int, input().split())\r\n A = list(map(int, input().split()))\r\n ans = 0\r\n for i in range(m):\r\n if i not in A:\r\n ans += 1\r\n if m in A:\r\n ans += 1\r\n print(ans)\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "a,b=map(int,input().split())\r\nc=list(sorted(map(int,input().split())))\r\nk=0\r\nl=0\r\nfor i in range(0,b):\r\n if i not in c:\r\n k+=1\r\nif b in c:\r\n k+=1\r\nprint(k)", "n , x = map(int , input().split())\r\narr = list(map(int , input().split() ))\r\narr.sort()\r\nans = 0\r\nfor i in range(x):\r\n if i not in arr:\r\n ans = ans + 1\r\n\r\nexcess = arr.count(x)\r\nans = ans + excess\r\nprint(ans)", "n,x = [int(i) for i in input().split()]\r\nl = [int(i) for i in input().split()]\r\nt = 0\r\nfor i in range(x):\r\n\tif not(i in l):\r\n\t\tt = t+1\r\nif x in l:\r\n\tt = t+1\r\nprint(t)\r\n", "arr=list(map(int,input().strip().split(' ')))\r\nn,x=arr[0],arr[1]\r\narr=list(map(int,input().strip().split(' ')))\r\nans=0\r\nif(x in arr):\r\n ans+=1\r\n cnt=0\r\n for i in arr:\r\n if(i<x):\r\n cnt+=1\r\n ans+=x-cnt\r\n \r\nelse:\r\n for i in arr:\r\n if(i<x):\r\n ans+=1\r\n ans=x-ans\r\nprint(ans)\r\n \r\n", "n, x = map(int, input().split())\r\na = list(map(int, input().split()))\r\nans = 0\r\nif x in a:\r\n ans += 1\r\nfor i in range(x):\r\n if i not in a:\r\n ans += 1\r\nprint(ans)", "n, x = map(int, input().split())\r\ndata = set(map(int, input().split()))\r\ncnt = 0\r\nfor i in range(0, x):\r\n if i not in data:\r\n cnt += 1\r\n\r\nif x in data:\r\n cnt += 1\r\n\r\nprint(cnt)", "def main():\n [n, x] = [int(_) for _ in input().split()]\n numbers = [int(_) for _ in input().split()]\n\n if x in numbers:\n n_actions = 1\n else:\n numbers += [x]\n n_actions = 0\n\n numbers.sort()\n index = numbers.index(x)\n n_actions += (x - index)\n\n print(n_actions)\n\n\nif __name__ == '__main__':\n main()\n", "a,b=map(int,input().split())\r\ncount=0\r\nliist=list(map(int,input().split()))\r\nif b in liist:\r\n liist.remove(b)\r\n count+=1\r\nfor i in range(b):\r\n if i not in liist:\r\n count+=1\r\nprint(count) \r\n", "X = list(map(int, input().split()))\r\nNumbers = sorted(list(map(int, input().split())))\r\ni = 0\r\nwhile i < len(Numbers) and Numbers[i] < X[1]:\r\n i += 1\r\nprint(X[1] - i if X[1] not in Numbers else X[1] - i + 1)\r\n", "n, x = map(int, input().split())\r\nmas = list(map(int, input().split()))\r\nq = 0\r\nif x in mas:\r\n del mas[mas.index(x)]\r\n q = 1\r\nmas.sort()\r\na = set(range(x))\r\nb = set(mas)\r\nper = list(a&b)\r\nprint(len(a) - len(per) + q)", "n,x = map(int, input().split())\n\nnum = []\n\nnum = [int(n) for n in input().split()]\nnum.sort()\n\nresult = 0\nif x < num[0]:\n for i in range(0, x + 1):\n if i < x and i != x:\n result += 1\n continue\n print(result)\nelse:\n for i in range(0, x + 1):\n if i in num and i != x:\n continue\n elif i not in num and i != x:\n result += 1\n if i in num and i == x:\n result += 1\n print(result)\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\nc = 0\r\nfor i in l :\r\n if i < m :\r\n c = c + 1\r\nif m in l :\r\n print(abs(m - c) + 1 )\r\nelse:\r\n print(abs(m - c) )", "n,x=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nc=0\r\nfor i in range(0,x):\r\n if i not in l:\r\n c+=1\r\nif x in l:\r\n c+=1\r\nprint(c)\r\n", "a,b=map(int,input().split())\r\nx=list(map(int,input().split()))\r\nx.sort()\r\nj=0\r\nfor i in range (a):\r\n if x[i]<b:\r\n j+=1\r\ny=x.count(b)\r\nprint(y+b-j)\r\n", "n, x = map(int, input().split())\r\nw = sorted(map(int, input().split()))\r\n\r\nc = 0\r\nfor i in range(x):\r\n if i not in w:\r\n c += 1\r\nif x in w:\r\n c += 1\r\nprint(c)\r\n", "R=lambda:map(int, input().split())\r\nn,x=R()\r\na=set(R())\r\nprint(len(set(range(0,x))-a)+(x in a))\r\n", "n,m=map(int,input().strip().split())\r\nl=list(map(int,input().strip().split()))\r\nl.sort()\r\ncount=0\r\nif(m in l):\r\n l.remove(m)\r\n count+=1\r\nfor i in range(m):\r\n if(i not in l):\r\n count+=1\r\nprint(count)", "n, x = map(int,input().split())\n\nl = [int(i) for i in input().split()]\n\n\n\nl.sort()\n\ntry:\n l.remove(x)\n op = 1\nexcept:\n op = 0\n\nMEX = 0\nfor i in range(n-op):\n if l[i] == MEX:\n MEX+=1\n else:\n break\nfor i in range(n-op):\n if l[i] > MEX and l[i] < x:\n op-=1\n\nprint(abs(x-MEX) + op)\n\n\n", "n,x = list(map(int, input().split()))\r\narr = list(map(int, input().split()))\r\n\r\nct = [0]*101\r\nfor element in arr:\r\n ct[element] = max(ct[element], 1)\r\ntt = x-sum(ct[:(x)])\r\n\r\nprint(tt + arr.count(x))\r\n\r\n\r\n\r\n\r\n", "n, x = map(int, input().split())\r\narray = list(map(int, input().split()))\r\n\r\ncount = 0\r\ncount_array = [0] * 101\r\nfor i in array:\r\n count_array[i] = 1\r\n\r\nfor i in range(x+1):\r\n if i == x:\r\n if count_array[i] == 1:\r\n count += 1\r\n elif count_array[i] == 0:\r\n count += 1\r\n\r\nprint(count)\r\n", "n, x = map(int,input().split())\r\na = list(map(int,input().split()))\r\nk = 0\r\nfor i in range(0,x):\r\n if i not in a:\r\n k += 1\r\nif x in a:\r\n k += 1\r\nprint(k)\r\n", "n,x=map(int,input().split())\r\na=list(map(int,input().split()))\r\nc=0\r\nk=0\r\nwhile k<x:\r\n if k not in a:\r\n c+=1\r\n k+=1\r\nif x in a:\r\n c+=1\r\nprint(c)", "import sys\r\n# sys.stdin = open('input.txt', 'r')\r\n# sys.stdout = open('output.txt', 'w')\r\n# sys.setrecursionlimit(1000000)\r\ndef Ints(): return map(int, sys.stdin.readline().strip().split())\r\ndef Strs(): return map(str, sys.stdin.readline().strip().split())\r\ndef Array(): return list(map(int, sys.stdin.readline().strip().split()))\r\ndef Str(): return sys.stdin.readline().strip()\r\ndef Int(): return int(sys.stdin.readline().strip())\r\ndef MOD(): return 1000000007\r\n\r\ndef power(base, power):\r\n MOD = 1000000007\r\n result = 1\r\n while power > 0:\r\n if power % 2 == 1:\r\n result = (result * base) % MOD\r\n power = power // 2\r\n base = (base * base) % MOD\r\n return result\r\n\r\nif __name__ == \"__main__\":\r\n n , x = Ints()\r\n a = Array()\r\n sa = set(a)\r\n\r\n count = 0\r\n for i in range(x):\r\n if i not in sa:\r\n count += 1\r\n if x in sa: count += 1\r\n\r\n print(count)\r\n # x to be smallest no.\r\n # 0,x should be in a \r\n", "def fun(n,x,arr):\n\tres = arr.count(x)\n\tarr = list(set([m for m in arr if m<x]))\n\tfor i in range(0,x):\n\t\tif(i not in arr):\n\t\t\tres = res+1\n\treturn res\n\t\t\nn,x = list(map(int,input().split(\" \")))\narr = list(map(int,input().split(\" \")))\nprint(fun(n,x,arr))\n\t \t\t\t\t \t \t \t \t\t\t\t \t\t\t \t\t", "def mex(s):\n for x in range(102):\n if x not in s:\n return x\n\n\nclass CodeforcesTask862ASolution:\n def __init__(self):\n self.result = ''\n self.n_x = []\n self.set = []\n\n def read_input(self):\n self.n_x = [int(x) for x in input().split(\" \")]\n self.set = [int(x) for x in input().split(\" \")]\n\n def process_task(self):\n operations = 0\n while mex(self.set) != self.n_x[1]:\n operations += 1\n if mex(self.set) > self.n_x[1]:\n self.set.remove(self.n_x[1])\n else:\n self.set.append(mex(self.set))\n self.result = str(operations)\n\n def get_result(self):\n return self.result\n\n\nif __name__ == \"__main__\":\n Solution = CodeforcesTask862ASolution()\n Solution.read_input()\n Solution.process_task()\n print(Solution.get_result())\n", "n, x = map(int, input().split())\r\ns = set(map(int, input().split()))\r\nprint(sum(i not in s for i in range(x)) + (x in s))", "nums, intS = map(int,input().split())\nlist1 = list(map(int,input().split()))\ndictA = {}\nfor i in list1:\n dictA[i] = dictA.get(i,0)+1\nresult = intS\nfor i in dictA:\n if i<intS:\n result-=1\nprint(result+dictA.get(intS,0))\n\t\t\t\t \t\t \t \t \t\t \t \t\t\t \t \t", "n,x=map(int,input().split())\r\na=list(map(int,input().split()))\r\nc=0\r\nif x in a:\r\n\ta.remove(x)\r\n\tc=c+1\r\nfor j in range(0,x):\r\n\tif j not in a:\r\n\t\ta.append(j)\r\n\t\tc=c+1\r\nprint(c)", "n, x = map(int,input().split())\r\na = list(map(int,input().split()))\r\nk = 0\r\nfor i in range(x):\r\n if not(i in a):\r\n k += 1\r\nif x in a:\r\n k += 1\r\nprint(k)\r\n", "n,m=map(int,input().split())\r\nc=0\r\nls= sorted(list(map(int,input().split())))\r\n#print(ls)\r\nfor i in ls:\r\n if i >= m: break\r\n c+=1\r\nprint(abs(m-c)+(1 if m in ls else 0))", "a,mex=map(int,input().split())\r\nc=list(map(int,input().split()))\r\nc=sorted(c)\r\nif c[0]>mex:\r\n print(mex)\r\nelse:\r\n l=0\r\n for i in range(mex):\r\n if i not in c:\r\n l+=1\r\n if mex in c:\r\n l+=1\r\n print(l)", "inp = input().split(' ')\nn = int(inp[0])\nmex = int(inp[1])\n\nnums = []\nmoves = 0\nfor num in input().split(' '):\n nums.append(int(num))\n\n\nfor i in range(mex):\n if i not in nums:\n moves+=1\n\nif mex in nums:\n moves+=1\n\nprint(moves)\n", "a,b = map(int, input().split())\nc = list(map(int, input().split()))\nans = 0\nfor i in range(b):\n\tif i not in c:\n\t\tans += 1\nif b in c:\n\tans += 1\nprint(ans)", "N, X = map(int, input().split())\r\nA = list(map(int, input().split()))\r\n\r\ncnt = 0\r\nfor x in A:\r\n if x < X:\r\n cnt += 1\r\n if x == X:\r\n cnt -= 1\r\n\r\nprint(X - cnt)", "n, x = [int(c) for c in input().split()]\r\nlength = 0\r\nxinarray = False\r\nfor e in input().split():\r\n i = int(e)\r\n if i <= x:\r\n length += 1\r\n if i == x:\r\n xinarray = True\r\n\r\nif length == x + 1:\r\n res = 1\r\nelse:\r\n res = x - length\r\n if xinarray:\r\n res += 2\r\n\r\nprint(res)\r\n", "def yeah(a,b):\r\n h=0\r\n for i in range(b):\r\n if str(i) not in a:\r\n h+=1\r\n return h\r\nc,b=map(int,input().split())\r\na=list(input().strip().split(' '))\r\nx=yeah(a,b)\r\nif str(b) in a:\r\n x=x+1\r\nprint(x)", "n,x=map(int,input().split())\r\na=list(map(int,input().split()))\r\nt=0\r\ncount=0\r\nfor i in range(n):\r\n if a[i]<x:\r\n count+=1\r\n if a[i]==x:\r\n t=t+1\r\nif(t==0):\r\n print(x-count)\r\nelse:\r\n print(x-count+1)\r\n ", "n,x=map(int,input().split())\r\na=set(map(int,input().split()))\r\nans=0\r\nif x in a:\r\n ans+=1\r\nfor i in range(0,x):\r\n if i not in a:\r\n ans+=1\r\nprint(ans)\r\n", "n,x=map(int,input().split())\r\nl=set(input().split())\r\ncom=0\r\nfor i in range(x+1):\r\n k=str(i)\r\n if i==x:\r\n if k in l:\r\n com+=1\r\n elif k not in l:\r\n com+=1\r\nprint(com)", "n, x = [int(x) for x in input().split()]\r\n\r\nd = [int(x) for x in input().split()]\r\n\r\ns = set(d)\r\n\r\na = 0\r\n\r\nfor i in range(x):\r\n if i not in s:\r\n a += 1\r\nif x in s:\r\n a += 1\r\nprint(a)", "L = [False]*101\r\nn, x = [int(p) for p in input().split()]\r\nA = [int(p) for p in input().split()]\r\nfor a in A:\r\n L[a] = True\r\nif L[x]:\r\n op = 1\r\nelse:\r\n op = 0\r\nprint(op + L[:x].count(False))\r\n", "n,x=map(int,input().split())\nlist11=[]\nlist11=map(int,input().split())\nlist1=list(list11)\niterate=0\n\nlist1.sort()\nif x in list1:\n list1.remove(x)\n iterate =iterate + 1\n for i in range(0,x):\n if i not in list1:\n list1.append(i)\n iterate = iterate + 1\n else:\n continue\n \nelse:\n for i in range(0,x):\n if i not in list1:\n list1.append(i)\n iterate = iterate + 1\n else:\n continue\n \nprint(int(iterate))\n \t \t \t\t\t \t \t \t\t \t\t \t\t \t \t", "def mex(arr,x):\r\n lst = []\r\n for i in range(0,x+1):\r\n if i not in arr:\r\n lst.append(i)\r\n return lst\r\nn,x = map(int,input().split())\r\narr = list(map(int,input().split()))\r\nif x not in arr:\r\n ans = mex(arr,x)\r\n print(len(ans)-1)\r\nelse:\r\n ans = mex(arr,x)\r\n print(len(ans)+1)\r\n", "from math import *\r\nn,x=map(int,input().split())\r\ninp=list(map(int,input().split()))\r\ncnt=0\r\nflag=0\r\nfor i in inp:\r\n if i<x:\r\n cnt+=1\r\n elif i==x:\r\n flag=1\r\nprint(x-cnt+flag)\r\n", "a=input().split()\r\nn=int(a[0])\r\nx=int(a[1])\r\ns=list(map(int,input().split()))\r\ns.sort()\r\ncount=0\r\nif x in s:\r\n for i in range(0,x):\r\n if i not in s:\r\n count=count+1\r\n print(count+1)\r\nelse:\r\n for i in range(0,x):\r\n if i not in s:\r\n count+=1\r\n print(count)", "n, x = map(int, input().split())\r\na = list(map(int, input().split()))\r\ncount = {}\r\n\r\nfor e in a:\r\n if e in count:\r\n count[e] += 1\r\n else:\r\n count[e] = 1\r\n\r\nres = 0\r\nif x in count:\r\n res += count[x]\r\n\r\nfor i in range(x):\r\n if i not in count:\r\n res += 1\r\nprint(res)", "\r\nn, x = map(int, input().split())\r\n\r\nl = list(map(int, input().split()))\r\nset_= set(l)\r\nif x in set_:\r\n\tto = 1\r\nelse:\r\n\tto = 0\r\nfor i in range(x):\r\n\tif i not in set_:\r\n\t\tto += 1\r\n\r\nprint(to)\r\n\r\n", "\r\nn,x=map(int,input().split())\r\nz=0\r\nl=list(map(int,input().split()))\r\nfor i in range(n):\r\n\tif l[i]<x:\r\n\t\tz+=1\r\nm=x-z\r\nif x in l:\r\n\tprint(m+1)\r\nelse:\r\n\tprint(m)", "# bsdk idhar kya dekhne ko aaya hai, khud kr!!!\r\n# import math\r\n# from itertools import *\r\n# import random\r\n# import calendar\r\n# import datetime\r\n# import webbrowser\r\n\r\nn, k = map(int, input().split())\r\narr = list(map(int, input().split()))\r\narr.sort()\r\ncount = 0\r\nif k != 0:\r\n for i in range(0, k):\r\n if i not in arr:\r\n count += 1\r\n if k in arr:\r\n count += 1\r\n print(count)\r\nelse:\r\n if k in arr:\r\n print(1)\r\n else:\r\n print(0)\r\n", "n, x = map(int, input().split())\r\nS = set(map(int, input().split()))\r\nans = 0\r\nif x in S:\r\n ans += 1\r\nans += x - len(set(range(x)) & S)\r\nprint(ans)", "n, mex = map(int, input().split())\r\n\r\nl = list(map(int, input().split()))\r\n\r\ncounter = 0\r\n\r\nl = sorted(l)\r\n\r\nif mex in l :\r\n counter +=1\r\nfor i in range(mex):\r\n if(not i in l):\r\n counter+=1\r\nprint(counter) ", "n, x = map(int, input().split())\r\na =[i for i in map(int, input().split()) if i <= x]\r\nprint (x - len(a) + (0, 2)[x in a])\r\n", "n,x=list(map(int,input().split(\" \")))\narr=list(map(int,input().split(\" \")))\narr1=range(0,x)\nnum=arr.count(x)\nfor i in arr1:\n if i not in arr:\n num+=1\nprint(num)\n \t\t \t \t \t\t\t \t \t\t\t\t \t \t\t \t\t", "n,x=map(int,input().split())\nn_number=list(map(int,input().split()))\nn_set=set(list(n_number))\nsmall=0\nfor i in n_set:\n if i<x:\n small+=1\nsmall_count=x-small\nif x in n_set:\n count=small_count+1\nelse:\n count=small_count\nprint(count)\n\t\t\t\t \t\t\t\t \t\t \t\t \t \t\t\t \t\t \t", "str_num = input().split(\" \")\nn = int(str_num[0])\nx = int(str_num[1])\nstr_list = input().split(\" \")\n\ntmp = 0\nres = 0\nfor i in range(n):\n int_temp = int(str_list[i])\n if int_temp < x:\n tmp += 1\n elif int_temp == x:\n res = 1\n\nres += x - tmp\nprint(res)\n\n\t\t \t \t \t \t\t \t\t\t\t \t \t\t \t\t", "import sys\r\nimport math\r\nimport collections\r\nimport heapq\r\nimport decimal\r\ninput=sys.stdin.readline\r\nn,x=(int(i) for i in input().split())\r\nl=[int(i) for i in input().split()]\r\nd=collections.Counter(l)\r\nc=0\r\nfor i in range(x):\r\n if(i not in d):\r\n c+=1\r\nif(x in d):\r\n c+=1\r\nprint(c)", "m,n = map(int,input().strip().split(' '))\na = list(map(int,input().strip().split(' ')))\nb = sorted(a)\nnum1 = 0\nnum2 = 0\nif n in b :\n for i in range(n):\n if i not in b :\n num1+=1\n print(str(num1+1))\nelse:\n for i in range(n):\n if i not in b :\n num1+=1\n print(str(num1))\n \t \t\t \t \t\t \t \t\t", "n, x = list(map(int, input().split()))\r\n\r\ns = [a for a in list(map(int, input().split())) if a <= x]\r\ns.sort()\r\n\r\nans = x - len(s)\r\n\r\nif len(s) != 0 and s[len(s) - 1] == x:\r\n ans += 2\r\n\r\nprint(ans)\r\n", "a,b=map(int,input().split());c=set(map(int,input().split()));print(len(set(range(b))-c)+[0,1][b in c])", "n, m = [int(x) for x in input().split()]\r\nA = [int(x) for x in input().split()]\r\nanswer = 0 \r\nif m in A:\r\n answer+=1 \r\nfor i in range(m):\r\n if i not in A:\r\n answer+=1 \r\nprint(answer)", "# evil if mex is exactly x (mex minimum non-negative integer that doesn't exist in it 0..inf)\r\n# 1) add some int\r\n# 2) erase some element\r\n\r\ndef solve(n, x, s):\r\n \r\n if x in s:\r\n return x-len(s[:s.index(x)])+1\r\n else:\r\n missing = set()\r\n for i in range(x):\r\n if i not in s:\r\n missing.add(i)\r\n \r\n return len(missing)\r\n \r\nn, x = map(int, input().split(\" \"))\r\ns = list(map(int, input().split(\" \")))\r\ns.sort()\r\n#print(s)\r\n\r\nprint(solve(n, x, s))\r\n\r\n", "#!/usr/bin/env python\n# coding: utf-8\n\n# In[42]:\n\n\ns,n = map(int,input().split())\nset = [int(i) for i in input().split()]\na = list(range(n))\nacts = 0\nif n in set:\n set.remove(n)\n acts+=1\nfor i in a:\n \n if i in set:\n continue\n if i not in set:\n acts+=1\n set.append(i)\n set = sorted(set)\nprint(acts) \n\n", "if __name__ == \"__main__\":\n n,x= map(int, input().split())\n Nums = list(map(int, input().split()))\n step=0\n Nums.sort\n if Nums.count(x)>0:\n Nums.sort()\n step=x-Nums.index(x)+1\n else:\n Nums.append(x)\n Nums.sort()\n step=x-Nums.index(x)\n print(step)\n\t\t \t\t \t \t \t \t\t\t \t \t \t\t \t \t", "#http://codeforces.com/problemset/problem/862/A\r\nnk = input ().split ()\r\nn, x = int (nk[0]), int(nk[1])\r\na = input ().split ()\r\narr = []\r\nfor i in a:\r\n arr.append (int(i))\r\nfreq =[0]*101\r\nfor i in arr:\r\n freq[i]+=1\r\ncount = 0\r\nfor i in range (0, x):\r\n if freq[i]==0:\r\n count+=1\r\nif freq[x]==1:\r\n count+=1\r\nprint (count)", "n,x=[int(f)for f in input().split()]\na=set([int(f)for f in input().split()])\nb=set(list(range(x)))\nprint(len(b.difference(a))+int(x in a))\n", "from sys import stdin\r\ndef get_ints(): return list(map(int, stdin.readline().strip().split()))\r\n\r\nn,x = get_ints()\r\nar = get_ints()\r\nans = 0\r\n\r\nprint(len([x for x in range(x) if x not in ar])+(1 if x in ar else 0))", "read = lambda: tuple(map(int, input().split()))\nl, x = read()\nv = read()\n\nans = 0\nfor i in range(0, 101):\n if (i < x and not i in v) or (i == x and i in v):\n ans += 1\n \nprint(ans)\n", "nums = input().split(\" \")\nn, x = int(nums[0]), int(nums[1])\n\nflag = [False for i in range(x)]\n\ncount = 0\nnums = input().split(\" \")\nfor num_ in nums:\n num = int(num_)\n if num < x:\n flag[num - 1] = True\n elif num == x:\n count += 1\n\nfor f in flag:\n if not f:\n count+=1\n\nprint(count)\n \t \t\t \t\t\t\t \t\t\t\t\t\t \t \t\t \t\t", "'Submitted by : Aanchal Tiwari'\r\nn, x = map(int, input().split())\r\nl = list(map(int, input().split()))\r\nvisited = [False for i in range(101)]\r\nfor i in l:\r\n visited[i] = True\r\nans = 0\r\nfor i in range(x):\r\n if visited[i] == False:\r\n ans = ans + 1\r\nif visited[x] == False:\r\n print(ans)\r\nelse:\r\n print(ans+1)\r\n", "n,mex=input().split()\r\ns=list(map(int, input().split()))\r\ns.sort()\r\nrs=0\r\nfor i in range(int(mex)):\r\n if i not in s:\r\n rs+=1\r\nif int(mex) in s:\r\n rs+=1\r\nprint(rs)", "n, x = (int(x) for x in input().split())\r\na = list(int(x) for x in input().split())\r\ncount = 0\r\nfor i in range(x):\r\n if i not in a:\r\n count += 1\r\nif x in a:\r\n print(count+1)\r\nelse:\r\n print(count)", "def getNumber(x,ls):\n count = 0\n for l in ls:\n if l < x:\n count += 1\n return count\n\nnum,x = map(eval,input().strip().split(' '))\nls = list(map(eval,input().strip().split(' ')))\nls.sort()\n\nif x in ls:\n print(x-getNumber(x,ls)+1)\nelse:\n if x < ls[0]:\n print(x)\n elif x > ls[len(ls)-1]:\n print(x-num)\n else:\n print(x-getNumber(x,ls))\n\t\t\t \t\t\t\t\t \t \t\t\t \t \t\t", "n, x = map(int, input().split())\r\ndem, a, cnt = x, list(map(int, input().split())), [True] * 105\r\nfor i in a:\r\n if i < x and cnt[i]: dem -= 1\r\n cnt[i] = False\r\nprint(dem) if cnt[x] else print(dem + 1)", "n,x=[int(x) for x in input().split()]\r\na=[int(x) for x in input().split()]\r\n\r\nd=set()\r\nfor i in a:\r\n d.add(i)\r\n\r\nans=0\r\nfor i in range(0,x):\r\n if i not in d:\r\n ans+=1\r\n\r\nif x in d:\r\n ans+=1\r\n\r\nprint(ans)\r\n", "n,x=[int(x) for x in input().split()]\r\na=[int(x) for x in input().split()]\r\nres,check=0,0\r\nfor i in a:\r\n if i==x:\r\n check=1\r\n elif i<x:\r\n res+=1\r\nprint(x-res+check)", "n,x=[int(i) for i in input().split()]\r\na=[int(i) for i in input().split()]\r\nr=0\r\nif x in a:\r\n a.remove(x)\r\n r+=1\r\nt=0\r\nfor i in range(x):\r\n if i not in a:\r\n a.append(i)\r\n r+=1\r\nprint(r)\r\n", "tmp = input().split()\nn = int(tmp[0])\nx = int(tmp[1])\n\ntmp = input().split()\nnums = [int(i) for i in tmp]\nnums.sort()\nans = 0 \n\nif x > 0 and 0 not in nums:\n nums.insert(0, 0)\n ans = ans + 1\n\nif x in nums:\n nums.remove(x)\n ans = ans + 1\n\ni = 0 \nif len(nums):\n while nums[i] < x:\n if (i + 1) >= len(nums):\n ans = ans + (x - nums[i]-1)\n break\n if nums[i+1] > x:\n ans = ans + (x-nums[i] - 1 )\n else:\n ans = ans + (nums[i+1]-nums[i]-1)\n i = i + 1\nelse:\n ans = ans + (x)\nprint(ans)\n\n\n", "n,x=map(int,input().split())\r\na=list(map(int,input().split()))\r\nt=0\r\na.sort()\r\nfor i in range(x):\r\n if not i in a:\r\n t+=1\r\nif x in a:\r\n t+=1\r\nprint(t)\r\n", "kite=lambda:map(int,input().split())\n_,x=kite()\nprint(x+sum((i==x)-(i<x)for i in kite()))\n\n\t \t \t \t\t\t\t\t \t \t\t \t \t\t \t \t\t", "N, MEX = map(int,input().split())\r\n\r\nA = list(map(int,input().split()))\r\nNeed = [False] * MEX\r\nA.sort()\r\ntoKill = 0\r\nfor i in A:\r\n if i < MEX:\r\n if Need[i] == False:\r\n Need[i] = True\r\n else:\r\n toKill += 1\r\n if i == MEX:\r\n toKill += 1\r\n\r\nprint(toKill + Need.count(False)) ", "n, x = map(int, input().split())\r\nt = [int(r) for r in input().split()]\r\nres = 0\r\nif x in t:\r\n res += 1\r\nfor i in range(x):\r\n if i not in t:\r\n res += 1\r\nprint(res)", "n , x = map(int, input().split())\r\nar = list(map(int, input().split()))\r\nans = 0\r\nif x in ar:\r\n ans += 1\r\nfor i in range(x):\r\n if i not in ar:\r\n ans += 1\r\nprint(ans)", "n,x=map(int,input().split())\r\na=list(map(int,input().split()))\r\nc=0\r\nif x in a:\r\n\ta.remove(x)\r\n\tc=c+1\r\na.sort()\r\n# print(a)\r\nif(len(a)>0):\r\n\tr=min(a)\r\n\r\nfor j in range(0,x):\r\n\tif j not in a:\r\n\t\ta.append(j)\r\n\t\tc=c+1\r\na.sort()\r\n# print(a)\r\nprint(c)", "n,x=map(int,input().split())\r\nl = list(map(int,input().split()))\r\na=[]\r\nfor i in range(102):\r\n a.append(0)\r\nfor i in l:\r\n a[i]=a[i]+1\r\nmis=0\r\npre=a[x]\r\nfor i in range(x):\r\n mis = mis + (a[i]==0)\r\nprint(mis+pre)\r\n", "def read(): return list(map(int, input().split()))\r\n\r\n\r\nn, x = read()\r\ndata = read()\r\n\r\n\r\ndef meh(data, op=0):\r\n data.sort()\r\n if x not in data:\r\n d = list(set(list(range(x))).symmetric_difference(data[:x]))\r\n d = list(filter(lambda y: y < x, d))\r\n op += len(d)\r\n if x in data:\r\n data.pop(data.index(x))\r\n op += 1\r\n return meh(data, op)\r\n else:\r\n return op\r\n\r\n\r\nprint(meh(data))\r\n", "\r\nn , k = map(int,input().split())\r\nl = list(map (int,input().split()))\r\ncon = 0\r\n\r\nfor i in range(k):\r\n if i not in l:\r\n con+=1\r\nif k not in l:\r\n print(con)\r\nelse:\r\n print(con+l.count(k))\r\n\r\n\r\n", "n, x = [int(i) for i in input().split()]\r\nlista = [int(i) for i in input().split()]\r\n \r\naux = [0 for i in range(200)]\r\n \r\nfor i in lista: aux[i] += 1\r\n \r\nans = 0\r\nfor i in range(x):\r\n if aux[i] == 0:\r\n ans += 1\r\n \r\nif aux[x] == 1: ans += 1\r\nprint(ans)\r\n", "n, x = map(int, input().split())\r\nset1 = set(map(int, input().split()))\r\nset2 = set()\r\nfor i in range(x + 1):\r\n\tset2.add(i)\r\n\r\nset3 = set2 - set1\r\nif x in set3:\r\n\tprint(len(set3) - 1)\r\nelse:\r\n\tprint(len(set3) + 1)", "# author: violist\n# created: 04.04.2022 18:06:06\n\nimport sys\ninput = sys.stdin.readline\n\nn, x = map(int, input().split())\na = list(map(int, input().split()))\ndelete, cnt = 0, 0\nfor i in range(n):\n if (a[i] == x):\n delete += 1\n elif (a[i] < x):\n cnt += 1\nprint(delete + (x - cnt))\n", "n,x=map(int,input().split())\r\na=list(map(int,input().split()))\r\np=0\r\nfor i in range(x):\r\n\tif i not in a:\r\n\t\tp+=1\r\nif x in a:\r\n\tprint(p+1)\r\nelse:\r\n\tprint(p)", "n,k = map(int,input().split())\r\nl = list(map(int,input().split()))\r\ns = set(l)\r\nans = 0\r\nif(k in s):\r\n ans+=1\r\nfor i in range(k):\r\n if(i not in s):\r\n ans+=1\r\nprint(ans)", "n, x = map(int, input().split())\r\na = [int(_) for _ in input().split()]\r\nk = 0\r\nif x in a:\r\n k += 1\r\n a.remove(x)\r\nfor i in range(x):\r\n if i not in a:\r\n k += 1\r\nprint(k)\r\n", "n, x = map(int, input().split())\r\na = list(map(int, input().split()))\r\nans = a.count(x)\r\nfor i in range(x):\r\n if i not in a:\r\n ans += 1\r\nprint(ans)", "if __name__ == \"__main__\":\n nums = input().split(\" \")\n num1, num2 = int(nums[0]), int(nums[1])\n array_arg = input().split(\" \")\n count = 0\n small = 0\n for a in array_arg:\n if int(a) == num2:\n count += 1\n elif int(a) < num2:\n small += 1\n print(num2-small+count)\n exit(0)\n \t\t \t\t \t\t\t \t\t\t \t\t \t\t \t\t", "n, x = [int(i) for i in input().split()]\r\na = [int(i) for i in input().split()]\r\nans = 0\r\nfor i in range(x):\r\n if i not in a:\r\n ans += 1\r\n\r\nif x in a:\r\n ans += 1\r\nprint(ans)", "if __name__ == \"__main__\":\n str1 = input()\n num1, num2 = int(str1.split(\" \")[0]), int(str1.split(\" \")[1])\n array_arg = input().split(\" \")\n count = 0\n small = 0\n for a in array_arg:\n if int(a) == num2:\n count += 1\n continue\n elif int(a) < num2:\n small += 1\n continue\n print(num2-small+count)\n exit(0)\n\n\t\t \t\t\t \t \t\t \t \t\t\t\t \t\t \t", "if __name__ == \"__main__\":\n n,x= map(int, input().split())\n Nums = list(map(int, input().split()))\n step=x\n for i in Nums:\n if i<x:\n step-=1\n if Nums.count(x)>0:\n step+=1\n print(step)\n\n\t\t\t \t \t \t \t \t \t \t\t\t \t\t", "R=lambda:list(map(int,input().split()))\r\nn,x=R()\r\na=R()\r\nprint(x-len([i for i in a if i<x])+(1 if x in a else 0))\r\n", "i=lambda:map(int,input().split())\r\nn,x=i()\r\na=*i(),\r\nprint(x-sum(u<x for u in a)+(x in a))", "try:\r\n n,x = map(int, input().split())\r\n a = list(map(int, input().split()))\r\n a.sort()\r\n z=0\r\n if a.__contains__(x):\r\n z+=1\r\n for i in range(x):\r\n if not a.__contains__(i):\r\n z+=1\r\n print(z)\r\nexcept:\r\n pass", "nums, intS = map(int,input().split())\r\nlist1 = list(map(int,input().split()))\r\ndictA = {}\r\nresult = intS\r\nfor i in list1:\r\n dictA[i] = dictA.get(i,0)+1\r\nfor i in dictA:\r\n if i<intS:\r\n result-=1\r\nprint(result+dictA.get(intS,0))", "import math\r\nimport re\r\ndef ria():\r\n return [int(i) for i in input().split()]\r\n\r\nn,x=ria()\r\nar=ria()\r\nmp={}\r\nfor i in range(200):\r\n mp[i]=0\r\nfor i in ar:\r\n mp[i]+=1\r\nsuma=mp[x]\r\n\r\nfor i in range(x):\r\n if mp[i]==0:\r\n\r\n suma+=1\r\nprint(suma)\r\n", "n, x = map(int, input().split())\r\nA = [0]*101\r\nfor a in map(int, input().split()):\r\n A[a] = 1\r\nprint(A[x] if x==0 else A[x] + x - sum(A[:x]))", "n, x = map(int, input().split())\r\na = [i for i in map(int, input().split()) if i <= x]\r\nc = i = 0\r\nwhile i < x:\r\n if i not in a:\r\n c += 1\r\n i += 1\r\nprint(c if x not in a else c + 1)\r\n", "n,x=map(int,input().split())\r\nlist=[int(i) for i in input().split()]\r\nlist.sort()\r\ni,cnt=0,0\r\nwhile(i<x):\r\n j=0\r\n while(j<n):\r\n if(list[j]==i):\r\n break\r\n j+=1\r\n if(j==n):\r\n cnt+=1\r\n i+=1\r\ni=0\r\nwhile(i<n):\r\n if(x==list[i]):\r\n cnt+=1\r\n break\r\n i+=1\r\nprint(cnt)", "n,x=list(map(int,input().split()))\r\n\r\n\r\nt=list(map(int,input().split()))\r\n\r\np=0\r\nif x in t:\r\n p+=1\r\nfor k in range(x):\r\n if k not in t:\r\n p+=1\r\nprint(p)\r\n", "n,x=map(int,input().split())\r\na=list(map(int,input().split()))\r\nb=[0]*105\r\nfor i in a:\r\n b[i]=1\r\nc=b[x]\r\nfor i in range(x):\r\n c+=(b[i]==0)\r\nprint(c)", "num,x = map(eval,input().strip().split(' '))\nls = list(map(eval,input().strip().split(' ')))\nls.sort()\n\ncount = 0\nfor l in ls:\n if l < x:\n count += 1\n\nif x in ls:\n print(x-count+1)\nelse:\n print(x-count)\n \t\t \t\t\t\t\t\t \t\t\t\t\t \t \t\t\t \t \t\t\t\t", "kiteuu=lambda:map(int,input().split())\n\n_,x=kiteuu()\nprint(x+sum((i==x)-(i<x)for i in kiteuu()))\n\n \t\t\t \t \t\t\t \t \t \t\t\t \t\t \t\t \t", "#!/usr/bin/env pypy3\r\n\r\ndef ans(X, S):\r\n ret = S.count(X)\r\n S = set(S)\r\n for i in range(0, X):\r\n if i not in S:\r\n ret += 1\r\n return ret\r\n\r\nN, X = input().split(' ')\r\nN = int(N)\r\nX = int(X)\r\nS = input().split(' ')\r\nS = list(map(int, S))\r\n\r\nprint(ans(X, S))\r\n", "n, x = map(int, input().split())\r\na = list(map(int, input().split()))\r\nexist = [False] * 101\r\nfor e in a:\r\n exist[e] = True\r\nans = 0\r\nif exist[x]:\r\n ans += 1\r\nfor i in range(x):\r\n if not exist[i]:\r\n ans += 1\r\nprint(ans)", "# cook your dish here\r\nn,x=input().split()\r\nn=int(n)\r\nx=int(x)\r\nAr=[int(t) for t in input().split()]\r\nar=[]\r\nfor i in range(x-1,-1,-1):\r\n cnt=0\r\n for j in Ar:\r\n if(i==j):\r\n cnt=1\r\n break\r\n if cnt==0:\r\n ar.append(i)\r\nif x in Ar:\r\n print(len(ar)+1)\r\nelse:\r\n print(len(ar))\r\n", "n , x = list(map(int, input().split()))\r\ninpt = list(map(int, input().split()))\r\ncounter = 0\r\nif (x in inpt):\r\n counter += 1\r\nfor i in range (0, x):\r\n if (i not in inpt):\r\n counter += 1\r\nprint (counter)\r\n", "def u_b(li,x,low,high):\r\n while low<=high:\r\n mid=(high+low)//2\r\n if li[mid]<x:\r\n low=mid+1\r\n else:\r\n high=mid-1\r\n return low\r\n\r\nn,x=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nl.sort()\r\nindex=u_b(l,x,0,n-1)\r\nprint(x-index if x not in l else x-index+1)\r\n", "func =lambda:map(int,input().split())\r\nn,x=func()\r\nprint(x+sum((i==x)-(i<x)for i in func()))", "n, x= map(int,input().split(' '))\r\nevil = list(map(int,input().split(' ')))\r\ncurrent = ans = 0\r\nfor i in range(x):\r\n if i not in evil:\r\n ans += 1\r\nans += 1 if x in evil else 0\r\nprint(ans)", "from sys import maxsize, stdout, stdin,stderr\r\nmod = int(1e9 + 7)\r\ndef tup():return map(int,stdin.readline().split())\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\ndef debug(*args, c=6): print('\\033[3{}m'.format(c), *args, '\\033[0m', file=stderr)\r\nfrom math import log2,sqrt\r\nfrom collections import Counter,defaultdict\r\nfrom itertools import permutations\r\nimport re\r\n# def bark():\r\n# n = I(); s =S()\r\n# a = re.split('[A-Z]+',s)\r\n# p = max(map(lambda x: len(set(x)),a))\r\n# return p\r\n\r\ndef bark():\r\n n,x = tup()\r\n ls = lint()\r\n cnt =0\r\n for i in range(x):\r\n if i in ls:pass\r\n else:cnt+=1\r\n if x in ls:cnt+=1\r\n print(cnt)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\nif __name__ == '__main__':\r\n bark()\r\n\r\n", "from sys import stdin\r\nn, x = map(int, stdin.readline().split())\r\na = list(map(int, stdin.readline().split()))\r\nd = [0] * 101\r\nfor i in a:\r\n d[i] = 1\r\nprint(x - sum(d[:x]) + d[x])", "def index(mas, x):\r\n for i in range(len(mas)):\r\n if mas[i] == x:\r\n return i\r\nn, x = map(int,input().split())\r\nmas = list(map(int,input().split()))\r\nmas.sort()\r\nif x in mas:\r\n s = 1\r\n s += (x - index(mas, x))\r\nelse:\r\n s = 0\r\n for i in range(x):\r\n if i not in mas:\r\n s += 1\r\n\r\n\r\nprint(s)", "f=lambda:map(int,input().split())\r\nn,k=f()\r\nc=0\r\nl=list(f())\r\nfor i in range(k):\r\n if not i in l:\r\n c+=1\r\nif k in l:\r\n c+=1\r\nprint(c)\r\n", "n, x = map(int, input().split())\r\nv = [int(i) for i in input().split()]\r\n\r\ncont = [0] * 200\r\n\r\nfor i in v:\r\n cont[i] += 1\r\n \r\nres = 0\r\nfor i in range(x):\r\n if cont[i] == 0:\r\n res += 1\r\n \r\nif cont[x] == 1:\r\n res += 1\r\n \r\nprint(res)", "n,x=map(int, input().split())\nL=list(map(int, input().split()))\nlesser=0\none=0\nfor i in range(n):\n if L[i]<x:\n lesser+=1\n if L[i]==x:\n one+=1\nprint(x-lesser+one)", "n,x=map(int,input().split())\r\nl=set(map(int,input().split()))\r\nl1=list(l)\r\nc=0\r\na=min(l1)\r\nfor i in l1:\r\n if(i<x):\r\n c=c+1\r\n else:\r\n break\r\nif x not in l1:\r\n print(x-c)\r\nelse:\r\n print(x-c+1)\r\n", "n, x = map(int, input().split())\r\na = list(map(int, input().split()))\r\n\r\na.sort()\r\nless = []\r\nmore = []\r\n\r\nfor item in a:\r\n\tif item<x:\r\n\t\tless.append(item)\r\n\telse:\r\n\t\tmore.append(item)\r\nans = 0\r\nif x in a:\r\n\ta.remove(x)\r\n\tans+=1\r\n\r\nans += (x-len(less))\r\nprint(ans)", "n,x=list(map(int,input().split()))\r\np=list(map(int,input().split()))\r\nyy=0\r\ntam=list(range(0,x))\r\nif x==0:\r\n if 0 in p:\r\n print(1)\r\n else:\r\n print(0)\r\nelse:\r\n p.sort()\r\n for it in tam:\r\n if it in p:\r\n pass\r\n else:\r\n yy+=1\r\n if x in p:\r\n yy+=1\r\n else:\r\n pass\r\n print(yy)\r\n ", "n,x=list(map(int,input().split(' ')))\narr=list(map(int,input().split(' ')))\ns=[0 for i in range(x)]\nt=0\nfor i in arr:\n if i<x:\n s[i]=1\n elif i==x:\n t+=1\nprint(x-sum(s)+t)\n \t\t\t \t\t\t \t\t\t \t\t \t \t \t \t\t\t\t", "n,r = map(int,input().split())\r\ns = set(map(int,input().split()))\r\nc=0\r\nfor i in range(r):\r\n if(i not in s):\r\n c= c+1\r\nif r in s:\r\n c = c+1\r\nprint(c)", "if __name__ == \"__main__\":\n str1 = input()\n num1 = int(str1.split(\" \")[0])\n num2 = int(str1.split(\" \")[1])\n array_arg = input().split(\" \")\n array = []\n for a in array_arg:\n array.append(int(a))\n array.sort()\n count = 0\n len_before = 0\n for b in array:\n if b < num2:\n len_before += 1\n if num2 in array:\n count += 1\n print(num2-len_before+count)\n exit(0)\n\t\t\t \t \t \t\t \t\t\t\t\t\t\t \t\t\t\t", "import sys\r\ninput=sys.stdin.readline\r\nfrom collections import defaultdict as dc\r\nfrom collections import Counter\r\nfrom bisect import bisect_right, bisect_left\r\nimport math\r\nfrom operator import itemgetter\r\nfrom heapq import heapify, heappop, heappush\r\nfrom queue import PriorityQueue as pq\r\nn,x=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nf=0\r\nc=0\r\nfor i in l:\r\n if i<x:\r\n c+=1\r\n elif i==x:\r\n f=1\r\nif f==0:\r\n print(x-c)\r\nelse:\r\n print(x-c+1)\r\n", "nums, intS = map(int,input().split())\nlist1 = list(map(int,input().split()))\ndictA = {}\nresult = intS\nfor i in list1:\n if i<intS and dictA.get(i,0) == 0:\n result-=1\n dictA[i] = dictA.get(i,0)+1\nprint(result+dictA.get(intS,0))\n \t\t\t\t \t \t \t\t\t \t\t \t\t\t\t\t\t \t \t" ]

[ "from collections import deque\nfrom typing import List\n\ndef maximum_time_spend(k1: int, k2: int, k3: int, t1: int, t2: int, t3: int,\n n: int, oq: List[int]) -> int:\n\n k = [k1, k2, k3]\n t = [t1, t2, t3]\n c = [[0] * n for i in range(3)]\n s = 0\n for i in range(n):\n x = oq[i]\n y = x\n\n for j in range(3):\n r = i%k[j]\n c[j][r] = max(c[j][r], y) + t[j]\n y = c[j][r]\t\n\n s=max(s,y-x)\n\t\n return s\n \n\nk = list(map(int, input().split()))\nt = list(map(int, input().split()))\nn = int(input())\na = list(map(int, input().split()))\nb = maximum_time_spend(*k, *t, n, a)\nprint(b)\n", "from heapq import heappush,heappop\r\nk=list(map(int,input().split()))\r\nt=list(map(int,input().split()))\r\nans=0\r\nn=int(input())\r\nl=sorted(list(map(int,input().split())))\r\nX=list(l)\r\nfor i in range(3):\r\n for j in range(n):\r\n if j>=k[i] and X[j-k[i]]>X[j]:\r\n X[j]+=X[j-k[i]]-X[j]\r\n X[j]+=t[i]\r\nfor i in range(n):\r\n ans=max(ans,X[i]-l[i])\r\nprint(ans)", "q = zip(map(int, input().split()), map(int, input().split()))\r\nn = int(input())\r\nc = list(map(int, input().split()))\r\nd = c[:]\r\nfor k, t in q:\r\n for i in range(min(k, n)): c[i] += t\r\n for i in range(k, n): c[i] = max(c[i], c[i - k]) + t\r\nprint(max(c[i] - d[i] for i in range(n)))" ]

[ "from math import gcd\r\nn=int(input())\r\n#print(gcd(1,0))\r\na=0\r\nu=[]\r\nfor i in range(1,n+1):\r\n if gcd(a+i,n-i)==1:\r\n u.append([a+i,n-i])\r\nprint(*u[(len(u)//2)-1])\r\n \r\n", "n = int(input())\r\ni = 1\r\nj = n - 1\r\nmxi = -1\r\nmxj = 1001\r\nwhile i < j:\r\n for d in range(2, i+1):\r\n if (j % d == 0) and (i % d == 0):\r\n break\r\n else:\r\n if (i > mxi) and (j < mxj):\r\n mxi = i\r\n mxj = j\r\n i += 1\r\n j -= 1\r\nprint(mxi, mxj)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "n=int(input())\r\nm=n//2\r\nswitcher={\r\n 0:[m-1,m+1],\r\n 1:[m,m+1],\r\n 2:[m-2,m+2],\r\n 3:[m,m+1],\r\n}\r\nans=switcher.get(n%4)\r\nprint(ans[0],ans[1])\r\n\r\n", "from fractions import gcd\r\n\r\nsum = input()\r\nsum = int(sum)\r\ndiv = sum/2\r\ni = 1\r\ngcdFlag = True\r\na = 0\r\nb = 0\r\n\r\nwhile gcdFlag:\r\n a = int(div-i)\r\n b = int(div+i)\r\n\r\n if (sum%2!=0) :\r\n a += 1\r\n\r\n if(gcd(a,b)<=1):\r\n gcdFlag = False\r\n else:\r\n i += 1\r\n\r\nprint(a,\" \",b)\r\n\r\n\r\n", "import math\r\nn=int(input())\r\nfor i in range(n,(n//2)-1,-1):\r\n if math.gcd( (i-1)//2 , n-(i-1)//2 )==1:\r\n print((i-1)//2,(n-(i-1)//2))\r\n break", "from math import gcd\r\n\r\nn = int(input())\r\n\r\nfor a, b in zip(range((n - 1) // 2, 0, -1), range((n + 2) // 2, n)):\r\n if gcd(a, b) == 1:\r\n print(a, b)\r\n break", "import math\r\nn = int(input())\r\nh = int(n//2)\r\nif(n&1):\r\n print(h,h+1)\r\nelse:\r\n for i in range(h,0,-1):\r\n if(math.gcd(i,n-i)==1):\r\n print(i,n-i)\r\n break", "n = int(input())\r\nd = int(n/2)\r\nif n%2==1:\r\n print(d, d+1)\r\nelse :\r\n if d%2==0: print(d-1, d+1)\r\n else :print(d-2, d+2)", "n = int(input())\r\n\r\nif n% 2 != 0:\r\n print(n//2, n//2+1)\r\n\r\nelse:\r\n if n//2 % 2 == 0:\r\n print(n//2-1, n//2+1)\r\n else:\r\n print(n//2-2, n//2+2)\r\n\r\n", "def gcd(a, b):\r\n while b > 0:\r\n a, b = b, a % b\r\n return a\r\n \r\nn = int(input())\r\n\r\nfor i in range(n // 2, 0, -1):\r\n if gcd(i, n - i) == 1:\r\n print(i, n - i)\r\n break", "n = int(input())\r\nif n%4==2:\r\n\tprint(n//2-2, n-n//2+2)\r\nelif n%4==0:\r\n\tprint(n//2-1, n-n//2+1)\r\nelse:\r\n\tprint(n//2, n-n//2)", "n = int(input())\r\nif n%4 == 0:\r\n x = n//2\r\n print(x-1,x+1)\r\nelif n % 4 == 2:\r\n x = n//2\r\n print(x-2,x+2)\r\nelse:\r\n x = n//2\r\n print(x,x+1)\r\n", "def isCoprime(a,b):\n num = gcd(a,b)\n if num!= 1:\n return False\n else:\n return True\n \ndef gcd(a,b):\n if b == 0:\n return a\n else:\n r = a%b\n return gcd(b,r)\n\ntotal = int(input())\nresult = []\na = 1\nb = total - a\nwhile (a+b)== total and a<b:\n if isCoprime(a,b):\n result.append((a,b))\n a+=1\n b = total-a\n\n\n\nfor i in result:\n num = 0\n maxFracttion = 0\n recent = i[0]/i[1]\n if recent>num:\n num = recent\n maxFraction = i\n \nprint(maxFraction[0],maxFraction[1])", "import math\r\nn=int(input())\r\na=n//2\r\nb=n-n//2\r\nwhile math.gcd(a,b)!=1:\r\n a=a-1\r\n b=b+1\r\nprint(a,b)", "import sys\r\ngivenNumber = sys.stdin.readline()\r\n\r\nsumOFnumbers = int(givenNumber)\r\ntestIfEven = sumOFnumbers % 2\r\nstillOkay = True\r\nfirstTrial = (sumOFnumbers // 2)\r\nif testIfEven == 1:\r\n secfirstTrial = firstTrial + 1\r\n stillOkay = False\r\nelse :\r\n firstTrial = firstTrial - 1\r\n secfirstTrial = firstTrial + 2\r\n pass\r\n#if I start with 15 this will give me 7 and 8\r\n\r\nwhile True:\r\n coprime = True\r\n if firstTrial - secfirstTrial < 0:\r\n for i in range( 2 , firstTrial + 1 ):\r\n if firstTrial % i == 0 and secfirstTrial % i == 0:\r\n coprime = False\r\n else:\r\n pass\r\n if coprime == True:\r\n break\r\n else:\r\n firstTrial = firstTrial - 1\r\n secfirstTrial = secfirstTrial + 1\r\n\r\nprint ( firstTrial, \" \" , secfirstTrial)\r\n\r\n\r\n\r\n# firstEven = firstTrial % 2\r\n# secEven = secfirstTrial % 2\r\n# if firstEven == 0 and secEven == 0:\r\n# firstTrial = firstTrial - 1\r\n# secfirstTrial = firstTrial + 3\r\n \r\n", "import math\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\nfor i in range(n // 2 + 1, n):\r\n if math.gcd(i, n - i) == 1:\r\n a, b = n - i, i\r\n break\r\nprint(a, b)", "n = int(input())\r\nans = 0\r\nif n % 2:\r\n ans = n // 2\r\nelif n % 4 == 0:\r\n ans = n//2-1\r\nelse:\r\n ans = n//2-2\r\nprint(ans, n-ans)\r\n", "import itertools\r\n\r\n\r\ndef gcd(a, b):\r\n if b == 0:\r\n return a\r\n return gcd(b, a % b)\r\n\r\n\r\ndef fraction_find(n):\r\n a = [range(1, n + 1)] * 2\r\n c = list(itertools.product(*a))\r\n b = list()\r\n for elem in c:\r\n if elem[0] + elem[1] == n and elem[0] < elem[1] and gcd(elem[0], elem[1]) == 1:\r\n b.append(elem)\r\n return max(b, key=lambda item: item[0])\r\n\r\n\r\nm = int(input())\r\nprint(*fraction_find(m))\r\n", "def gcd(big, small):\r\n mod = big % small\r\n if mod == 0:\r\n return small\r\n return gcd(small, mod)\r\n\r\n\r\ndef find_fraction(total):\r\n for i in range(total // 2, 0, -1):\r\n if gcd(i, total - i) == 1:\r\n return str(i) + \" \" + str(total - i)\r\n return \"\"\r\n\r\n\r\ndef solution(inp1):\r\n return find_fraction(inp1)\r\n\r\n\r\ndef main():\r\n inp1 = input()\r\n\r\n result = solution(int(inp1))\r\n print(result)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "\r\n\r\nfrom math import gcd\r\n\r\n\r\nn = int(input())\r\n\r\nif n % 2 == 0:\r\n\ta = n // 2 - 1\r\n\tb = n // 2 + 1\r\nelse:\r\n\ta = (n - 1) // 2\r\n\tb = (n + 1) // 2\r\n\r\nwhile True:\r\n\tif gcd(a,b) == 1:\r\n\t\tprint(a, b)\r\n\t\texit()\r\n\telse:\r\n\t\ta -= 1\r\n\t\tb += 1", "n = int(input())\r\nif n%2!=0: print(n//2,(n//2)+1)\r\nelif n%4==0: print((n//2)-1,(n//2)+1)\r\nelse: print((n//2)-2,(n//2)+2)", "n = int(input())\r\n \r\nif n%2 == 0:\r\n if n//2%2==0:\r\n print(n//2-1,n//2+1)\r\n else:\r\n print(n//2-2,n//2+2)\r\nelse:\r\n print(n//2,n//2+1)", "import math\r\nn=int(input())\r\nfor b in range((n+1)//2,n):\r\n a=n-b\r\n if math.gcd(a,b)==1:\r\n print(a,b)\r\n break", "import sys\n\ndef gcd(a,b):\n while b:\n a,b = b,a%b\n return a\n\nn = int(input())\n\na = int(n /2)\nb = max(a,n - a)\n\n\nwhile(True):\n if b > a and gcd(a,b) == 1:\n break\n if a == 1:\n break\n b+= 1\n a -=1\n\nprint('{0} {1}'.format(a,b)) \n\n ", "n = int(input())\nres = (n - 1) // 2, (n + 2) // 2\nif all(i & 1 == 0 for i in res):\n res = res[0] - 1, res[1] + 1\nprint(*res)\n", "import math\nn=int(input())\na=0\nfor i in range (0,n+1):\n if i>n-i:\n break\n if math.gcd(i,n-i)==1:\n a=i\nprint(a,n-a)", "from math import gcd\r\n\r\nn = int(input())\r\n\r\nfor i in range(int(n//2), 0, -1):\r\n a = i\r\n b = n - i\r\n if a < b and gcd(a, b) == 1:\r\n print(a, b)\r\n break", "# https://codeforces.com/problemset/problem/854/A\r\ndef coprime(a, b):\r\n if a == b:\r\n return False\r\n elif min(a, b) == 2:\r\n if a % 2 == 0 and b % 2 == 0:\r\n return False\r\n return True\r\n else:\r\n for i in range(2, min(a, b)):\r\n if a % i == 0 and b % i == 0:\r\n return False\r\n return True\r\n\r\n\r\nn = int(input())\r\na = n // 2\r\nb = n - a\r\nwhile not coprime(a, b):\r\n a -= 1\r\n b += 1\r\nprint(a, b)", "n1 = int(input())\r\n\r\ndef check(a,b):\r\n min1 = min(a,b)\r\n max1 = max(a,b)\r\n a = min1\r\n d1 = False\r\n flag = 0\r\n while d1==False:\r\n if a == 1:\r\n break\r\n if max1 % a ==0 and min1 % a == 0:\r\n flag+=1\r\n break\r\n else:\r\n a-=1\r\n if flag == 0:\r\n return True\r\n else:\r\n return False\r\n \r\nif n1 % 2 == 0:\r\n x = n1/2 -1\r\n y = n1/2 +1\r\n b1 = False\r\n while b1==False:\r\n if check(x,y) == True:\r\n print(int(x),int(y))\r\n break\r\n else:\r\n x-=1\r\n y+=1\r\nelse:\r\n x = int(n1/2)\r\n y = int(n1/2) +1\r\n b1 = False\r\n while b1==False:\r\n if check(x,y) == True:\r\n print(int(x),int(y))\r\n break\r\n else:\r\n x-=1\r\n y+=1", "from math import gcd\r\nn = int(input())\r\nfor a in range(n // 2, 0, -1):\r\n b = n - a\r\n if gcd(a, b) == 1:\r\n print(a, b)\r\n break\r\n\r\n", "n = int(input())\r\nif n % 2 != 0:\r\n\tx=n//2\r\nelif n % 4 == 0:\r\n\tx = (n//2) - 1\r\nelse:\r\n\tx = (n//2) - 2\r\nprint(x,n-x)", "N = int(input())\r\na, b = (N//2, N//2+1) if (N%2 == 1) else (N//2-[1,2][N%4!=0], N//2+[1,2][N%4!=0])\r\nprint(a, b)\r\n\r\n'''\r\nFor X (>1), GCD(X, X-1) == 1\r\n'''", "n = int(input())\r\nnum = 0\r\na, b = 0, 1\r\n\r\n\r\ndef gcd(a, b):\r\n if b == 0:\r\n return a\r\n else:\r\n return gcd(b, a % b)\r\n\r\n \r\nfor i in range(1, n + 1):\r\n if i < n - i and gcd(i, n - i) == 1:\r\n if a * (n - i) - b * i <= 0:\r\n a, b = i, n - i\r\n\r\nprint(a, b)", "from math import gcd\r\n\r\nn = int(input())\r\n\r\nfor i in range(n-1, 0, -1):\r\n b = n-i\r\n if i < b and gcd(i, b) == 1:\r\n print(i, b)\r\n break\r\n", "def awal(n, m):\r\n if n<m:\r\n n+=m\r\n m=n-m\r\n n=n-m\r\n if m==0:\r\n return n\r\n if m==1:\r\n return 1\r\n n-=m\r\n return awal(n,m)\r\n#while True:\r\n \"\"\"n = int(input('enter n : '))\r\n m = int(input('enter m : '))\r\n print(awal(n,m))\r\n \"\"\"\r\n\r\nn=int(input())#'enter : '))\r\nfor i in range(int(n/2),0,-1):\r\n if awal(i, n-i)==1:\r\n print(i,(n-i))\r\n break", "n = int(input())\r\nd1 = ((n//2)-1)\r\nd2 = n-((n//2)-1)\r\nif(n%2!=0):\r\n print(n-((n+1)//2),(n+1)//2)\r\nelse:\r\n if(d1%2==0 and d2%2==0):\r\n print(d1-1,d2+1)\r\n else:\r\n print(d1,d2)\r\n", "n=int(input())\r\nif n%2==0:\r\n if (n//2)%2==0:\r\n b=n//2+1\r\n a=n//2-1\r\n else:\r\n b=n//2+2\r\n a=n//2-2\r\nelse:\r\n b=n//2+1\r\n a=n//2\r\nprint (a, b)", "import math\r\na=int(input())\r\nb=0\r\nl=[]\r\nx=True\r\nif a==3 or a==4:\r\n if a==3:\r\n print(1,2)\r\n x=False\r\n elif a==4:\r\n print(1,3)\r\n x=False\r\nif x:\r\n if a&1==0:\r\n while a!=b:\r\n a-=1\r\n b+=1\r\n if math.gcd(a,b)==1:\r\n l.append([a,b])\r\n else:\r\n x=l[-1][0]\r\n y=l[-1][1]\r\n if x>y:\r\n print(y,x)\r\n else:\r\n print(x,y)\r\n \r\n elif a&1==1:\r\n while abs(a-b)!=1:\r\n a-=1\r\n b+=1\r\n if math.gcd(a,b)==1:\r\n l.append([a,b])\r\n else:\r\n x=l[-1][0]\r\n y=l[-1][1]\r\n if x>y:\r\n print(y,x)\r\n else:\r\n print(x,y)\r\n ", "import string\r\n\r\n\r\ndef main_function():\r\n n = int(input())\r\n if n % 2:\r\n return f\"{n // 2} {n - (n // 2)}\"\r\n if (n // 2) % 2:\r\n return f\"{(n // 2) - 2} {(n - (n // 2)) + 2}\"\r\n else:\r\n return f\"{(n // 2) - 1} {(n - (n // 2)) + 1}\"\r\n\r\n\r\nprint(main_function())\r\n\r\n", "from fractions import gcd\r\n\r\nn =int( input())\r\na = n//2 + n%2 - 1\r\nb = n//2 + 1\r\n\r\nif (n-2)%4==0:\r\n a-=1\r\n b+=1\r\n\r\nprint(a,b)\r\n", "#!/bin/python3\nimport os\nimport sys\nfrom math import gcd\n\ndef is_coprime(a, b):\n return gcd(a,b) == 1\n\ndef find_fraction(n):\n for i in range(n//2, 1, -1):\n if is_coprime(i, n-i) and (i!=n-i):\n return (\"{} {}\".format(i, n-i))\n return \"1 {}\".format(n-1)\n\nif __name__ == '__main__':\n t = int(input())\n\n result = find_fraction(t)\n print(result)\n\n", "import math\r\nn = int(input())\r\nm = 0\r\nx = 0\r\ny = 0\r\nfor i in range(1, n, 1):\r\n b = n - i\r\n if math.gcd(i, b) == 1 and i / b > m and i / b < 1:\r\n x = i\r\n y = b\r\n m = x / y\r\nprint(x, y)\r\n", "def gdc (a, b):\r\n if (b == 0):\r\n return a\r\n else:\r\n return gdc (b, a % b)\r\n\r\nn = int (input())\r\n\r\nmaxA = 1\r\nmaxB = 1\r\na = 1\r\nwhile (a < n):\r\n b = 1\r\n while (b < n):\r\n divisorComum = gdc (a, b)\r\n if ((a + b == n) and (divisorComum == 1) and (a < b)):\r\n maxA = a\r\n maxB = b\r\n b = b + 1\r\n #print (a, b)\r\n a = a + 1\r\n\r\nprint (maxA, maxB)", "import math\r\nimport fractions\r\n\r\nn = int(input()) \r\n\r\nans = fractions.Fraction(1,n)\r\nfor i in range(1,n//2+1):\r\n if math.gcd(i, n-i) == 1:\r\n d = fractions.Fraction(i, n-i)\r\n if d > ans:\r\n ans = d\r\nprint(d.numerator, d.denominator)\r\n\r\n", "def gcd(a,b):\r\n if b==0:\r\n return a\r\n return gcd(b,a%b)\r\nn=int(input())\r\nvar=1\r\nfor i in range(1,(n//2)+1):\r\n if gcd(n-i,i)==1:\r\n if i<n-i:\r\n var=max(var,i)\r\nprint(var, n-var)\r\n", "import math\r\n\r\nn = int(input())\r\n \r\nh = n // 2\r\nh += 1\r\nl = n - h\r\nwhile math.gcd(h,l) != 1:\r\n h += 1\r\n l -= 1\r\nprint(l , h)\r\n", "n = int(input())\r\nif n % 2 == 0:\r\n m = int(n / 2) - 1\r\nelse:\r\n m = int(n / 2)\r\nfor i in range (m, 0, -1):\r\n a = i\r\n b = n - i\r\n while (a != b):\r\n if a > b:\r\n a -= b\r\n else:\r\n b -= a\r\n if a == 1:\r\n print(i, n - i)\r\n exit()\r\n", "def gcd(a, b):\r\n return a if b == 0 else gcd(b, a % b)\r\n\r\nn = int(input())\r\nans = (1, n - 1)\r\nfor i in range(1, n // 2 + 1):\r\n if gcd(i, n - i) == 1:\r\n ans = (i, n - i)\r\nprint(ans[0], ans[1])", "m=int(input())\r\ndef mcd(m,n):\r\n while(n>0):\r\n aux=m%n\r\n m=n\r\n n=aux\r\n return m;\r\nn=m//2\r\nwhile(n>0):\r\n if(mcd(n,m-n)==1):\r\n print(n,m-n)\r\n break\r\n n-=1", "n = int(input())\ndef gcd(a,b):\n if b==0:\n return a\n else:\n return gcd(b,a%b)\na = 1\nb = n-1\nfor i in range(n//2+1):\n if gcd(i,n-i)==1:\n a = i\n b = n-i\nprint(a,b)", "num=int(input())\r\nd=num//2\r\n\r\nif not num%2:\r\n\tif not d%2:\r\n\t\ta=(d-1);b=(d+1)\r\n\telse:\r\n\t\ta=(d-2);b=(d+2)\r\nelse:\r\n\ta=d;b=(num-d)\r\nprint(a, b)", "n = int(input())\r\n\r\ndef Even_funktion(n):\r\n if (n/2)%2 ==0:\r\n print(int(n/2 - 1), int(n/2 +1))\r\n else:\r\n print(int(n/2 -2) , int(n/2 + 2))\r\n\r\nif n % 2 != 0:\r\n print(n//2,' ', n//2 +1)\r\n\r\nelse:\r\n Even_funktion(n)\r\n", "def Check(t1, t2):\r\n for j in range(2, min(t1, t2) + 1):\r\n if t1 % j == 0 and t2 % j == 0:\r\n return False\r\n return True\r\nn = int(input())\r\nif n % 2 == 1:\r\n print(n // 2, n // 2 + 1)\r\n exit()\r\nelse:\r\n for i in range(n // 2 + 1, n + 1):\r\n if Check(i, n - i) == True:\r\n print(n - i, i)\r\n exit()", "import math\r\n\r\n\r\nn = int(input())\r\nans = n\r\n\r\nfor i in range(1, n + 1):\r\n a = i\r\n b = n - i\r\n if a >= b:\r\n break\r\n if math.gcd(a, b) == 1:\r\n ans = i\r\n\r\nprint(ans, n - ans)# 1698147961.681245", "from math import gcd\r\nn = int(input())\r\n\r\na , b = n // 2 , n - n//2\r\n\r\nwhile gcd(a , b) != 1 :\r\n a -= 1\r\n b += 1\r\n\r\nprint(a , b)\r\n\r\n", "n=int(input())\r\nif int(n%2)==0:\r\n x=int(n/2)\r\n if int(x%2)!=0:print(x-2,x+2)\r\n else:print(int(n/2)-1,int(n/2)+1)\r\nelse:print(int(n/2),int(n/2)+1)", "import math\r\n\r\nn = int(input())\r\na, b = n // 2, n - n // 2\r\nwhile math.gcd(a, b) != 1:\r\n a -= 1\r\n b += 1\r\nprint(a, b, sep=\" \")\r\n", "from math import *\nn=int(input())\nif n%2==0:\n a,b=n//2-1,n//2+1\nelse:\n a,b=n//2,n//2+1\nwhile gcd(a,b)>1:\n a-=1\n b+=1\nprint(a,b)\n", "x = int(input())\nif x%2 == 0 and (x/2)%2 == 0:\n a = int(x/2)-1\nelif x%2 == 0 and (x/2)%2 == 1:\n a = int(x/2)-2\nelse:\n a= int(x/2)\nprint(f\"{a} {x-a}\")", "import math\r\nn=int(input())\r\nfor i in range(n-1,0,-1):\r\n if math.gcd(i,n-i)==1 and i<(n-i):\r\n print(i,n-i)\r\n break", "def mdc (a, b):\r\n if b == 0:\r\n return a\r\n return mdc(b, a%b)\r\n\r\nn = int(input())\r\na = n//2\r\nb = n-a\r\nwhile mdc(a, b) != 1:\r\n a -= 1\r\n b += 1\r\n\r\nprint(str(a) + ' ' + str(b))\r\nexit(0)", "from math import gcd\r\n\r\nn = int(input())\r\nch = n // 2\r\nzn = n - ch\r\nwhile ch != 0:\r\n if gcd(ch, zn) == 1:\r\n print(ch, zn)\r\n break\r\n ch -= 1\r\n zn += 1\r\n\r\n", "import math\r\nx=int(input());a=x//2;b=x-a\r\nwhile 1==1:\r\n\tif math.gcd(a,b)==1:\r\n\t\texit(print(a,b))\r\n\telse:\r\n\t\ta-=1\r\n\t\tb+=1", "from math import gcd as g\r\nn = int(input())\r\nans1 = 0; ans2 = 0\r\nfor i in range(1, n//2+1):\r\n a = i\r\n b = n - i\r\n if(a < b and g(a, b) == 1):\r\n ans1 = a\r\n ans2 = b\r\nprint(ans1, ans2)", "import math\r\nn=int(input())\r\na=n//2\r\nb=n-a\r\nwhile math.gcd(a,b)!=1:\r\n a-=1\r\n b+=1\r\nprint(a,b)", "n = int(input())\r\na = n//2\r\nif (n % 2 != 0): print(f\"{a} {a + 1}\")\r\nelse:\r\n if((a-1) % 2 == 0 and (a+1) % 2 == 0):\r\n print(f\"{a - 2} {a + 2}\")\r\n else:\r\n print(f\"{a - 1} {a + 1}\")", "no=int(input())\r\nn=no//2\r\nd=no-n\r\n\r\ndef hcf(a,b):\r\n while(True):\r\n rem=a%b\r\n if rem==0:\r\n return b\r\n else:\r\n a=b\r\n b=rem\r\n \r\nwhile(True):\r\n if hcf(n,d)==1:\r\n print(n,d)\r\n break\r\n else:\r\n n-=1\r\n d+=1\r\n ", "n = int(input())\nif n%2:\n print(n//2, n//2+1)\nelif n//2%2:\n print(n//2-2, n//2+2)\nelse:\n print(n//2-1, n//2+1)\n", "import math\r\nn = int(input())\r\ni = n//2\r\nwhile(i>=1):\r\n x = n-i\r\n if(math.gcd(i,x)==1):\r\n print(i,x)\r\n break\r\n i-=1", "import math\r\ndef gcd(x, y):\r\n while y != 0:\r\n (x, y) = (y, x % y)\r\n return x\r\nn=int(input())\r\nif(n&1):\r\n x=n//2\r\nelse:\r\n x=n//2-1\r\n\r\ny=n-x\r\nwhile(gcd(x,y)!=1):\r\n x=x-1\r\n y=y+1\r\n\r\nprint(str(x) + \" \"+ str(y))\r\n", "#problem 854 a\n\nsumm = int(input())\n \nif summ % 2 == 0:\n if (summ / 2) % 2 == 0:\n b = int(summ / 2 + 1)\n a = int(summ / 2 - 1)\n else:\n b = int(summ / 2 + 2)\n a = int(summ / 2 -2)\nelse:\n summ += 1\n b = int(summ / 2)\n a = int(summ / 2 - 1)\n\n\nprint(a, b)\n\n", "n = int(input())\r\nq = []\r\nw = []\r\ns = 0\r\na = n - s\r\nb = n - a\r\nwhile s != n:\r\n if a != 0 and b != 0 and a < b:\r\n p = 0\r\n for i in range(2,a):\r\n if a % i == 0 and b % i == 0:\r\n p = 1\r\n if p == 0: \r\n q.append(b)\r\n w.append(a)\r\n b = n - s\r\n a = n - b\r\n s = s + 1\r\nmax1 = q[0]\r\nmax2 = w[0]\r\nfor i in range(1,len(w)):\r\n if (max2 / max1 < w[i] / q[i]) and q[i] % w[i] != 0:\r\n max1 = q[i]\r\n max2 = w[i]\r\nprint(max2,max1)", "n = int(input())\r\nif n % 2 == 0:\r\n a = n // 2\r\n a1 = a-1\r\n a2 = a+1\r\n if (a1 % 2 == 0 and a2 % 2 == 0):\r\n print(a1-1,a2+1)\r\n else:\r\n print(a1,a2)\r\nelse:\r\n a = n // 2\r\n print(a,a+1)\r\n", "def gcd(a,b):\n if ( a == 0 or b == 0):\n return 0\n elif (a == b):\n return a\n elif(a>b):\n return gcd(a-b,b)\n else:\n return gcd(a,b-a)\n\n\nif __name__ == '__main__':\n n = int(input())\n\n flag = 0\n\n for i in range(n):\n for j in range(n):\n if j >= i:\n continue\n else:\n if i + j == n and gcd(i,j) == 1:\n print(\"{} {}\".format(j,i))\n flag = 1\n break\n if flag == 1:\n break\n", "n = int(input())\r\n\r\ndef evk(a, b):\r\n while(a != 0 and b != 0):\r\n if a > b:\r\n a = a % b\r\n else:\r\n b = b % a\r\n return a+b\r\nm = 0\r\nx = 0\r\ny = 0\r\nfor i in range(1000):\r\n for j in range(i+1, 1001):\r\n if(i + j == n):\r\n if(evk(i, j) == 1):\r\n if(i/j > m):\r\n m = i/j\r\n x = i\r\n y = j\r\nprint(x, y)\r\n\r\n", "def gcd(x, y):\r\n if (y==0):\r\n return x\r\n return gcd(y, x%y)\r\n\r\nn=int(input())\r\nfor i in range(int(n/2), 0, -1):\r\n a=i\r\n b=n-a\r\n if (a<b and gcd(a, b)==1):\r\n print(str(a)+\" \"+str(b))\r\n break\r\n\r\n", "def NOD(a,b):\r\n while a!=b:\r\n if a>b:\r\n a-=b\r\n else:\r\n b-=a\r\n if a==1:\r\n return True\r\n return False\r\nn=int(input())\r\nfor i in range(n//2,0,-1):\r\n if NOD(i,n-i):\r\n print(i, n-i)\r\n break\r\n", "import math\r\nn = int(input())\r\nfor i in range(n//2, 0, -1):\r\n if math.gcd(i, n-i) == 1:\r\n print(i, n-i)\r\n break\r\n", "n = int(input())\r\nif n%2!=0:print(n//2, n//2 +1)\r\nelse:\r\n\tif (n//2)%2==0:print(n//2 -1 , n//2 +1)\r\n\telse:print(n//2 - 2 ,n//2 +2 )", "import sys\r\n\r\ndef main():\r\n n = int(sys.stdin.read().strip())\r\n t = n//2\r\n if n%2: return t, t + 1\r\n return t - 1 - t%2, t + 1 + t%2\r\n \r\nprint(*main())\r\n", "n= int(input(''))\r\n\r\ndef _gcd(a,b):\r\n#\tprint(a,b)\r\n\tif a==0:\r\n\t\treturn b\r\n\treturn _gcd(b%a,a)\t\r\nmax=-1\r\nfor i in range(1,n//2+1):\r\n#\tprint(i)\r\n\tif _gcd(i,n-i)==1:\r\n\t#\tprint(\"j\")\r\n\t\tif i/(n-i)>max:\r\n\t\t\tmax=i/(n-i)\r\n\t\t\tx=i\r\n\t\t\ty=n-i\r\n\r\nprint(x,y)\t\t\t", "def gcd(a,b):\r\n\tif b == 0:\r\n\t\treturn a\r\n\telse:\r\n\t\treturn gcd(b,a%b)\r\nif __name__ == '__main__':\r\n\tn = int(input())\r\n\tfor i in range(n // 2, -1, -1):\r\n\t\tj = n - i\r\n\t\tif gcd(i, j) == 1:\r\n\t\t\tprint(i, j)\r\n\t\t\tbreak", "n=int(input())\r\nx=int(n/2)\r\nif n%2!=0:\r\n print(str(x)+\" \"+str(x+1))\r\nelse:\r\n if n%4==0:\r\n print(str(x-1)+\" \"+str(x+1))\r\n else:\r\n print(str(x-2)+\" \"+str(x+2))", "import math\r\nn=int(input()) \r\nx=math.ceil(n/2)-1 \r\nif x%2==0 and n%2==0:\r\n x-=1\r\nprint(x,n-x)\r\n", "from math import gcd\r\nn = int(input())\r\nres = []\r\nmid = n//2\r\nfor i in range(mid, 0, -1):\r\n if gcd(i, n-i) == 1:\r\n print(i, n-i)\r\n break\r\n\r\n\r\n", "import math\r\nn = int(input())\r\na,b = n//2,n-n//2\r\nwhile (math.gcd(a,b)!=1):\r\n a-=1\r\n b+=1\r\nprint(a,b)", "def gcd(a,b):\r\n if a%b==0:\r\n return b\r\n else:\r\n a,b = b,a%b\r\n return gcd(a,b)\r\nn = int(input())\r\nfor i in range(n//2,0,-1):\r\n if gcd(n-i,i)==1:\r\n print(i,n-i)\r\n break", "N = int(input())\rif N%4 == 0: print(N//2 - 1, N//2 + 1)\relif N%4 == 2: print(N//2 - 2, N//2 + 2)\relse: print(N//2, N//2 + 1)\r", "n = int(input())\nfor numerator in reversed(range(1, n)):\n if numerator >= n - numerator:\n continue\n denominator = n - numerator\n v = int(numerator)\n i = 2\n good = True\n while v % i == 0:\n if v % i == 0 and denominator % i == 0:\n good = False\n break\n v //= i\n i = 3\n while i * i <= v:\n if v % i == 0:\n if denominator % i == 0:\n good = False\n break\n v //= i\n else:\n i += 2\n if v != 1 and denominator % v == 0:\n good = False\n if good:\n print(numerator, denominator)\n break\n \n \n", "import math\r\nn=int(input())\r\nd=n//2\r\nc=n-d\r\nwhile math.gcd(c,d)!=1:\r\n c+=1\r\n d-=1\r\nprint(d,c)\r\n ", "import math\r\n\r\n\r\ndef splitting(x):\r\n anb = list()\r\n for i in range(1, x // 2 + 1):\r\n anb.append([i, x - i])\r\n return anb\r\n\r\n\r\ndef findMaxFraction( fracList):\r\n maxFraction = list()\r\n for i in fracList:\r\n if math.gcd(i[0], i[1]) == 1:\r\n maxFraction = i\r\n return maxFraction\r\n\r\nn = int(input())\r\nsimpleFraction = findMaxFraction(splitting(n))\r\nprint(simpleFraction[0], simpleFraction[1])\r\n", "n = int(input())\r\ndef gcd(big:int, small:int)->int:\r\n tmp = 1\r\n while tmp > 0:\r\n tmp = big % small\r\n big,small = small, tmp\r\n return big\r\nfor i in range(n//2+1,0,-1):\r\n for j in range(i+1, n):\r\n if gcd(j,i) != 1:\r\n continue\r\n if i+j == n:\r\n print(i, j)\r\n exit(0)", "from math import gcd as g\r\nn=int(input())\r\n\r\n\r\nm=0\r\nfor i in range (1,n):\r\n\tif i/(n-i)<1 and g(i,n-i)==1 and i/(n-i)>m:\r\n\t\tm=i/(n-i)\r\n\t\ta,b=i,n-i\r\nprint(a,b)\r\n", "def gcd(a,b):\n\twhile a%b!=0:\n\t\ta,b=b,a%b\n\treturn b\nn=int(input())\nif n%2:\n\tans=n//2\n\twhile gcd(n-ans,ans)!=1:\n\t\tans-=1\n\tprint(ans,n-ans)\nelse:\n\tans=n//2-1\n\twhile gcd(n-ans,ans)!=1:\n\t\tans-=1\n\tprint(ans,n-ans)", "import math\na=int(input())\nif a%2==0:\n b=a/2\n c=a/2\nelse:\n b=math.floor(a/2)\n c=math.floor(a/2)+1\n\nwhile 1:\n b1=b\n c1=c\n while c1!=0 :\n d=b1%c1\n b1=c1\n c1=d\n if b1==1:\n break\n b -=1\n c +=1\n \n\nprint(int(b),int(c))\n ", "import math\r\nnum = int(input())\r\narr = []\r\nfirst = num - 1\r\nsecond = 1\r\nans1 = 0\r\nans2 = 0\r\nwhile True:\r\n gcd = math.gcd(first, second )\r\n diff = abs(first - second)\r\n if(gcd == 1):\r\n ans1 = second\r\n ans2 = first\r\n #tempStr = str(second) + str(first)\r\n #arr.append(tempStr)\r\n if(diff <= 1):\r\n break\r\n second += 1\r\n first -= 1\r\nprint(ans1, ans2)", "from math import *\r\n\r\nn = int(input())\r\narr = []\r\nfor i in range(ceil(n/2)-1, -1, -1):\r\n if gcd(i, n-i)==1: print(i, n-i); break\r\n", "import itertools\r\nfrom collections import defaultdict\r\nfrom math import gcd\r\n\r\n\r\ndef main():\r\n n = int(input())\r\n m = 0\r\n for i in range(n):\r\n if i>=n-i:\r\n break\r\n if gcd(i, n-i)==1 and i>m:\r\n m = i\r\n\r\n print(m, n-m)\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "from math import gcd\r\n\r\nn=int(input())\r\n\r\nn2=n//2\r\n\r\nfor x in range(n2,0,-1):\r\n y=n-x\r\n if gcd(x,y)==1:\r\n print(\"%s %s\"%(x,y))\r\n break", "\r\nn=int(input())\r\nif n%2:\r\n print(n//2,n//2 + 1)\r\nelif n%4==0:\r\n print(n//2 -1 ,n//2 + 1)\r\nelse:\r\n print(n//2 -2 ,n//2 + 2)", "# print(\"Input n\")\nn = int(input())\n\nif n%2 == 0:\n if (n//2-1)%2 != 0:\n print(str(n//2 - 1) + \" \" + str(n//2 + 1))\n else:\n print(str(n//2 - 2) + \" \" + str(n//2 + 2))\nelse:\n print(str(n//2) + \" \" + str(n//2 + 1))\n \n", "n = int(input())\r\n\r\nfor i in range(1,n,1):\r\n b=i\r\n a=n-i\r\n b1=i\r\n a2=n-i\r\n while (a>0) and (b>0):\r\n if b>a:\r\n b=b%a\r\n else:\r\n a=a%b\r\n if (a+b==1) and (b1>0) and (a2>0) and (a2<b1) :\r\n print(a2,' ',b1)\r\n break", "from math import gcd\r\nn = int(input())\r\nrez = []\r\nfor i in range(1, n):\r\n chisl = i\r\n znam = n - i\r\n if gcd(chisl, znam) == 1 and chisl < znam:\r\n rez.append([chisl, znam])\r\nprint(*(max(rez, key = lambda x: x[0] / x[1])))\r\n \r\n \r\n \r\n \r\n \r\n", "n = int(input())\r\n\r\nif (n%2):\r\n print (str(int(n/2))+\" \"+str(int(n/2)+1))\r\n\r\nelse:\r\n if(int(n/2)%2):\r\n print (str(int(n/2)-2)+\" \"+str(int(n/2)+2))\r\n else:\r\n print (str(int(n/2)-1)+\" \"+str(int(n/2)+1))\r\n", "import math\r\nn = int(input())\r\ni = 1\r\nwhile True:\r\n if math.gcd(n // 2 + i, n - (n // 2 + i)) == 1:\r\n answer = [n // 2 + i, n - (n // 2 + i)]\r\n break\r\n else:\r\n i += 1\r\nprint(*answer[::-1])", "import math\r\nn=int(input())\r\nfor i in range(n//2,0,-1):\r\n if(math.gcd(i,n-i)==1):\r\n print(i,n-i)\r\n break", "def gcd(a, b):\n if b < a: return gcd(b, a)\n if b%a==0: return a\n return gcd(b%a, a)\n\ntotal = int(input())\nnum = total // 2\nden = total - num\n\nwhile True:\n if gcd(num, den)==1:\n print(num, den)\n break\n num-=1\n den+=1", "import math\r\n\r\nn = int(input())\r\nresult = \"\"\r\nfor i in range(1, n // 2 + 1):\r\n if math.gcd(i, n - i) == 1:\r\n result = str(i) + \" \" + str(n - i)\r\nprint(result)", "n=int(input())\nif n&1:\n\tprint(n//2,(n+1)//2)\nelif (n//2)&1:\n\tprint((n//2)-2,(n//2)+2)\nelse:\n\tprint((n//2)-1,(n//2)+1)\n \t\t \t \t\t\t\t\t \t \t \t\t\t \t\t \t \t\t", "n = int(input())\nwyn = 0\n\ndef fajnie(a, b):\n while a != b:\n if a<b:\n b-=a\n else:\n a-=b\n return min(a, b)\n\nfor x in range(1, n//2+1):\n y=n-x\n if fajnie(x, y)==1:\n wyn = x\n\nprint (wyn, n-wyn)", "n=int(input())\r\na,b=0,0\r\nif n%2==0:\r\n\tif (n//2)%2==0:\r\n\t\ta=n//2-1\r\n\t\tb=n//2+1\r\n\telse:\r\n\t\ta=n//2-2\r\n\t\tb=n//2+2\r\nelse:\r\n\ta=(n-1)//2\r\n\tb=(n+1)//2\r\nprint(a,b)\t\t", "n=int(input())\r\na=n//2\r\nif (n/2)%2==1:print(a-2,a+2)\r\nelse:\r\n if n&1:print(a,a+1)\r\n else:print(~-a,-~a)", "n = int(input())\r\n\r\ntmp = []\r\nif(n%2==0):\r\n if((n//2)%2==0):\r\n tmp = [n//2-1,n//2+1]\r\n else:\r\n tmp =[n//2-2,n//2+2]\r\nelse:\r\n tmp =[n//2,n//2+1]\r\nprint(\" \".join(map(str,tmp)))", "from math import gcd as g\r\nn = int(input())\r\nhigh = 0\r\nx, y = 0, 0\r\nfor i in range(1, n // 2 + 1):\r\n a = i\r\n b = n - i\r\n if g(a, b) == 1:\r\n if a / b > high:\r\n high = a / b\r\n x = a\r\n y = b\r\nprint(x, y)\r\n", "from math import gcd\r\nn = int(input())\r\na, b = 0, 0\r\nfor i in range(n//2, 0, -1):\r\n k = n - i\r\n if gcd(k, i) == 1:\r\n print(i, k)\r\n break\r\n\r\n", "def gcd(a,b):\r\n if a%b==0:\r\n return b\r\n else:\r\n return gcd(b,a%b)\r\n\r\nn=int(input())\r\nx=n//2\r\ny=n-x\r\n\r\nif x==y:\r\n x-=1\r\n y+=1\r\n#print(gcd(5,7))\r\nwhile(x>=0):\r\n if gcd(y,x)==1:\r\n print(x,y)\r\n break\r\n else:\r\n x-=1 \r\n y+=1\r\n ", "import math\r\nm=int(input())\r\nx,y=m//2,m-m//2\r\nwhile math.gcd(x,y)!=1:x,y=x-1,y+1\r\nprint(x,y)", "def gcd(a,b):\r\n if b==0:\r\n return a\r\n else:\r\n return gcd(b,a%b)\r\n\r\nn=int(input())\r\nif n%2==0:\r\n limit=int(n/2-1)\r\nelse:\r\n limit=int(n/2)\r\nmax=0\r\nnum=0\r\nden=0\r\nfor i in range(1,limit+1):\r\n if gcd(i,n-i)==1:\r\n if i/(n-i)>max:\r\n max=i/(n-i)\r\n num=i\r\n den=n-i\r\nprint(num,den)\r\n", "n = int(input())\r\nif n%4==0:\r\n print(n//2-1, n//2+1)\r\nelif n%2==0:\r\n print(n//2-2, n//2+2)\r\nelse:\r\n print(n//2, n//2+1)", "from math import *\r\nimport fractions\r\nn=int(input())\r\nhalf=floor(n/2)\r\nden=half+1\r\nnum=n-den\r\nwhile True:\r\n if fractions.gcd(num,den)==1:\r\n break\r\n else:\r\n den=den+1\r\n num=num-1\r\nprint(num,den)\r\n", "import sys\r\nimport math\r\nimport bisect\r\nimport itertools\r\n\r\ndef main():\r\n n = int(input())\r\n for i in range(1, n):\r\n if i < n - i and math.gcd(i, n - i) == 1:\r\n ans = [i, n - i]\r\n print('%d %d' % (ans[0], ans[1]))\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "a = input().strip()\nd = int(a)\nif d>= 3 and d <= 1000:\n if d%2 == 0:\n b = d//2 - 1\n c = d - b\n else:\n b = d//2\n c = d - b\n if b % 2 == 0 and c % 2 ==0:\n b = b - 1\n c = c + 1\n print(str(b)+\" \"+str(c))", "import sys\r\nfrom math import gcd\r\nn = [num for num in sys.stdin]\r\nnn = 0\r\nfor num in n:\r\n nn += int(num)\r\nm = nn//2\r\no = nn-m\r\nwhile gcd(m,o) != 1:\r\n o += 1\r\n m -= 1\r\nprint(str(min(m,o)) + \" \" + str(max(m,o)))\r\n ", "from fractions import gcd\r\n\r\nn = int(input())\r\nfor a in range(n//2,0,-1):\r\n b = n-a\r\n if gcd(a,b) == 1:\r\n print(a,b)\r\n break", "'''\nhttps://codeforces.com/problemset/problem/854/A\n'''\n\ndef solve(n):\n if n%2 != 0:\n first = n//2\n second = n- first\n\n else:\n res = n//2\n\n com = (res%2) +1\n\n first = res-com\n second = res+ com\n\n return first,second\n\nn = int(input())\n\na, b = solve(n)\n\nprint(a, b)", "user_input = int(input())\r\ndef GCD(c,d):\r\n if d == 0:\r\n return c\r\n else:\r\n return GCD(d, c%d)\r\nfirst_part = []\r\ndef hahaha(local_input):\r\n for i in range(int(local_input/2),0,-1):\r\n for j in range(int(local_input/2), local_input):\r\n if i+j == local_input and i!=j and GCD(i,j)==1:\r\n return [i,j]\r\nresult = hahaha(user_input)\r\nprint(result[0],result[1])", "import math\r\nn = int(input())\r\na = n//2\r\nb = n-a\r\nwhile(math.gcd(a,b) > 1):\r\n a-= 1\r\n b+= 1\r\nprint(a,b)", "n = int(input())\r\n\r\ndef easyest(a, b):\r\n while a != 0 and b != 0:\r\n if a > b:\r\n a %= b\r\n else:\r\n b %= a\r\n if (a + b) == 1:\r\n return True\r\n else:\r\n return False\r\nx = 0\r\nfor j in range(n // 2, n):\r\n if easyest(n - j, j):\r\n x = j\r\n break\r\nprint(min(x, n - x), max(x, n - x))", "import math\n\nn = int(input())\na, b = n // 2, n - n // 2\nwhile math.gcd(a, b) != 1:\n a, b = a - 1, b + 1\n\nprint(a, b)", "import math\r\n\r\nn = int(input())\r\n\r\nfor num in range(1,n):\r\n if 2* num > n and math.gcd(n - num, num) == 1:\r\n print(n - num, num)\r\n break", "n = int(input())\r\ndef f(a,b):\r\n while a != 0 and b != 0:\r\n if a > b: a %= b\r\n else: b %= a\r\n return a+b\r\na = n//2; b = n-n//2\r\nwhile f(a,b) != 1: a-=1; b += 1\r\nprint(a,b)", "from math import gcd\r\n\r\nn = int(input())\r\n\r\nmax_b = 1\r\nfor a in range(1, n // 2 + 1):\r\n b = n - a\r\n if b > a and gcd(a, b) == 1:\r\n max_b = b\r\n\r\nprint(n - max_b, max_b)\r\n", "n = int(input())\r\nif n % 2 == 0 :\r\n if n%4 == 0:\r\n print(n//2 - 1,n//2 + 1)\r\n else:\r\n print(n//2 - 2,n//2 + 2)\r\nelse:\r\n print(n//2, n//2 + 1)", "def simp(a, b):\n for i in range(2, min(a, b) + 1):\n if a % i == 0 and b % i == 0:\n return False\n return True\nn = int(input())\nfor i in range(1, n):\n if i != 1 and simp(i, n - i) and i > n // 2:\n print(min(n - i, i), max(n - i, i))\n break\nelse:\n print(1, n - 1)\n", "n = int(input())\r\nl = []\r\n\r\ndef gcd(a, b):\r\n if (a == 0 or b == 0): \r\n return 0\r\n \r\n if (a == b): \r\n return a\r\n \r\n if (a > b):\r\n return gcd(a - b, b)\r\n \r\n return gcd(a, b - a)\r\n\r\nfor i in range(1,n):\r\n if gcd(i, n-i) == 1:\r\n l.append([min(i,n-i), max(i,n-i)])\r\n \r\nmaxi = 0\r\nans = 0\r\nfor i in range(len(l)):\r\n if l[i][0] / l[i][1] > maxi:\r\n maxi = l[i][0] / l[i][1]\r\n ans = [l[i][0],l[i][1]]\r\n\r\nprint(ans[0], ans[1])\r\n", "def gcd(a,b):\r\n if a==0:\r\n return b\r\n elif b==0:\r\n return a\r\n while a!=0 and b!=0:\r\n if a>b:\r\n a = a%b\r\n else:\r\n b = b%a\r\n return gcd(a,b)\r\nn = int(input())\r\nmax1 = 0\r\nans =[]\r\nfor i in range(n):\r\n a = i\r\n b = n-i\r\n if gcd(a,b)==1 and a<b and a/b > max1:\r\n max1= a/b\r\n ans = [a,b]\r\nprint(ans[0],ans[1])\r\n", "import math\nn = int(input()) \nif n%2:\n a = n//2 \n b = n-a\nelif n%4== 0:\n a = n//2 - 1\n b = n - a\nelse:\n a = n//2 - 2\n b = n - a \nprint(a, end = ' ')\nprint(b, end= '')\n ", "def is_irreducible(num1, num2):\r\n for j in range(2, num1+1):\r\n if num1 % j == 0 and num2 % j == 0:\r\n return False\r\n return True\r\n\r\n\r\nn = int(input())\r\nresult = \"\"\r\n\r\nfor i in range(1, n):\r\n num1 = i\r\n num2 = n - i\r\n if num1 > num2:\r\n break\r\n if is_irreducible(num1, num2):\r\n result = str(num1) + \" \" + str(num2)\r\n # print(result)\r\n\r\nprint(result)\r\n\r\n\r\n\r\n\r\n", "def hcf(x, y):\r\n while(y):\r\n x, y = y, x % y\r\n return (x)\r\nn=int(input())\r\nif (n%2==0):\r\n a=n//2 -1\r\n b=n//2 +1\r\nelse:\r\n a=n//2\r\n b=a+1\r\nwhile (True):\r\n if (hcf(a,b)==1):\r\n print (a,b)\r\n break\r\n else:\r\n a-=1\r\n b+=1", "# the one and only input\nn = int(input())\nif n % 2 == 1:\n numerator = n//2\n denominator = n - numerator\nelse:\n numerator = (n//2) - 1\n while numerator % 2 == 0:\n numerator -= 1\n denominator = n - numerator\nprint(numerator, denominator)\n", "n = int(input())\r\n\r\nif n % 2 == 1:\r\n a = n // 2\r\n b = a + 1\r\nelif n % 4 == 0:\r\n a = n // 2 - 1\r\n b = n // 2 + 1\r\nelse:\r\n a = n // 2 - 2\r\n b = n // 2 + 2\r\n\r\nprint(a,b)", "from math import gcd\n\nn = int(input())\nnum, den = 1, n-1\nans_n, ans_d = num, den\nfor _ in range(n-2):\n\tans_n += 1\n\tans_d -= 1\n\tif ans_n >= ans_d:\n\t\tbreak\n\tif gcd(ans_n, ans_d) == 1:\n\t\tnum, den = ans_n, ans_d\n\t\nprint(num, den)\n", "num = int(input())\r\n\r\nif num & 1:\r\n x = num // 2\r\nelse:\r\n if num % 4 == 0:\r\n x = num // 2 - 1\r\n else:\r\n x = num // 2 - 2\r\n\r\ny = num - x\r\nprint(x, y)", "n=int(input())\r\n\r\nif n%2==0 :\r\n satu=n//2-1\r\n dua=n//2+1\r\n status=False\r\n\r\n while status==False :\r\n if satu==1 :\r\n break\r\n for i in range(satu,1,-1) :\r\n if satu%i==0 and dua%i==0 :\r\n status=False\r\n satu-=1\r\n dua+=1\r\n else :\r\n if i==2 :\r\n status=True\r\nelse :\r\n satu=n//2\r\n dua=n//2+1\r\n status=False\r\n while status==False :\r\n if satu==1:\r\n break\r\n for i in range(satu,1,-1) :\r\n if satu%i==0 and dua%i==0 :\r\n status=False\r\n satu-=1\r\n dua+=1\r\n else :\r\n if i==2 :\r\n status=True\r\nprint(satu,dua)", "import math\r\n\r\nn = int(input())\r\ni = int(n // 2)\r\nwhile i > 0:\r\n if math.gcd(i, n - i) == 1:\r\n print(f\"{i} {n - i}\")\r\n break\r\n i -= 1", "N = int(input())\r\na, b = (N//2, N//2+1) if (N%2 == 1) else (N//2-[1,2][N%4!=0], N//2+[1,2][N%4!=0])\r\nprint(a, b)", "def gsd(a, b):\r\n if a == b or b == 0:\r\n return a\r\n return gsd(b, a%b)\r\n\r\nn = int(input())\r\na = n//2\r\nb = n//2 + n%2\r\nwhile True:\r\n k = gsd(a, b)\r\n if gsd(a, b) == 1:\r\n print(a,b)\r\n break\r\n else:\r\n a -= 1\r\n b += 1", "n = int(input());\r\ndef corprime(a, b):\r\n for i in range(2,a+1):\r\n if (a % i == 0 and b % i ==0) :\r\n return False;\r\n return True;\r\n\r\nt = 1;\r\nif (n % 2 == 0):\r\n t = n // 2;\r\nelse:\r\n t = n // 2 + 1;\r\na = 1;\r\nb = 1;\r\nfor i in range(1, t):\r\n if (corprime(i, n - i)):\r\n a = i;\r\n b = n - i;\r\nprint (a, b);", "import math\nn = int(input())\nnum = int(n/2)\nwhile num > 0:\n\tden = n - num\n\tif math.gcd(den,num) == 1:\n\t\tprint(num,den)\n\t\tbreak\n\tnum -= 1\n \t\t\t \t\t\t \t\t\t\t\t\t \t\t \t\t\t \t\t \t", "# -*- coding: utf-8 -*-\r\n\r\nimport math\r\nimport collections\r\nimport bisect\r\nimport heapq\r\nimport time\r\nimport random\r\nimport itertools\r\n\r\n\"\"\"\r\ncreated by shhuan at 2017/10/19 13:07\r\n\r\n\"\"\"\r\n\r\nN = int(input())\r\n\r\n\r\ndef gcd(a, b):\r\n if a < b:\r\n a, b = b, a\r\n if a % b == 0:\r\n return b\r\n\r\n return gcd(b, a%b)\r\n\r\nfor a in range(N//2, -1, -1):\r\n b = N-a\r\n\r\n if gcd(b, a) == 1:\r\n print(a, b)\r\n exit(0)", "import math\r\nn = int(input())\r\nans = max([i for i in range(1, (n+1)//2) if math.gcd(i, n-i)==1])\r\nprint(ans, n-ans)", "def coprime(n,m):\r\n cp=1\r\n for i in range(1,min(n,m)+1):\r\n if(n%i==0 and m%i==0):\r\n cp=i\r\n return cp\r\na=int(input())\r\nd=1\r\nif(a%2==0):\r\n b=(a//2)-1\r\n c=a-b\r\n v=coprime(b,c)\r\n while(d):\r\n if(v!=1):\r\n b=b-1\r\n c=c+1\r\n v=coprime(b,c)\r\n else:\r\n d=0\r\nelse:\r\n b=((a+1)//2)-1\r\n c=a-b\r\n v=coprime(b,c)\r\n while(d):\r\n if(v!=1):\r\n b=b-1\r\n c=c+1\r\n v=coprime(b,c)\r\n else:\r\n d=0\r\nprint(b,c)", "def main():\r\n n = int(input())\r\n\r\n if n % 2 == 1:\r\n a = n // 2\r\n elif n % 4 == 0:\r\n a = n // 2 - 1\r\n else:\r\n a = n // 2 - 2\r\n\r\n print(a, n - a)\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "n = int(input())\r\nif n % 2 == 1:\r\n a = n // 2\r\n b = n - a\r\nelif (n // 2) % 2 == 0:\r\n a = n // 2 - 1\r\n b = n // 2 + 1\r\nelse:\r\n a = n // 2 - 2\r\n b = n // 2 + 2\r\nprint(a, b) \r\n", "from math import gcd\r\n\r\nn = int(input())\r\nbest = (1, n)\r\nfor m in range(1, (n // 2) + 1):\r\n n -= 1\r\n if gcd(m, n) == 1 and m/n > best[0] / best[1]:\r\n best = (m, n)\r\nprint(best[0], best[1])\r\n", "# the one and only input\r\nn = int(input())\r\nif n % 2 == 1:\r\n numerator = n//2\r\n denominator = n - numerator\r\nelse:\r\n numerator = (n//2) - 1\r\n while numerator % 2 == 0:\r\n numerator -= 1\r\n denominator = n - numerator\r\nprint(numerator, denominator)", "import math\nn=int(input())\nfor i in range(n//2,0,-1):\n k=n-i\n if math.gcd(k,i)==1:\n print(i, k)\n break\n \t \t\t \t\t\t \t\t\t \t \t\t \t \t\t\t", "while True:\r\n try:\r\n n = int(input())\r\n if n % 2 == 0:\r\n n = n / 2\r\n tp = n % 2\r\n if tp == 0:\r\n # print(\"tp:1\")\r\n # print(n)\r\n print(\"{} {}\".format(int(n - 1),int(n + 1)))\r\n else:\r\n # print(\"tp:2\")\r\n # print(n)\r\n print(\"{} {}\".format(int(n - 2),int(n + 2)))\r\n else:\r\n print(\"{} {}\".format(int(n / 2),int(n / 2 + 1)))\r\n except:\r\n break", "\nfrom fractions import gcd\nimport math\n\nn = int(input())\n\na = 0\nb = 0\n\nx = int(n/2) + 1\n\nfor i in range(1,x):\n if gcd(i, n-i) == 1:\n a = i\n b = n - i\n # print(a,b)\n\nprint(a,b)\n", "import math\r\nn=int(input())\r\na=[]\r\nif(n==3):\r\n\tprint(1,2)\r\nif(n==4):\r\n\tprint(1,3)\r\nif(n>4):\r\n\tfor i in range(1,1000):\r\n\t\tfor j in range(1,1000):\r\n\t\t\tif(i<j):\r\n\t\t\t\tif(i+j==n):\r\n\t\t\t\t\tif(math.gcd(i,j)==1):\r\n\t\t\t\t\t\tx=i\r\n\t\t\t\t\t\ty=j\r\n\tprint(x,y)", "import sys\r\nimport math\r\nimport collections\r\nimport heapq\r\ninput=sys.stdin.readline\r\nn=int(input())\r\nm=0\r\nans=[]\r\nfor i in range(1,(n//2)+1):\r\n a=i\r\n b=n-i\r\n if(math.gcd(a,b)==1 and a/b>m):\r\n m=a/b\r\n ans=[a,b]\r\nprint(*ans)", "# https://codeforces.com/problemset/problem/854/A\r\nfrom math import gcd\r\n\r\nn = int(input())\r\n\r\nif n % 2 == 0:\r\n a, b = n // 2 - 1, n // 2 + 1\r\nelse:\r\n a, b = n // 2, n // 2 + 1\r\n\r\nwhile gcd(a, b) != 1:\r\n a -= 1\r\n b += 1\r\n\r\nprint(a, b)\r\n", "from math import gcd\r\nn=int(input())\r\na=n//2\r\nb=n-a\r\nwhile gcd(a,b)>1:\r\n a-=1\r\n b+=1\r\nprint(a,b)", "#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\nimport math\r\n\r\nn = int(input()) \r\nfor i in reversed(range(1, n - 1)) :\r\n if (n - i > i) :\r\n a = i\r\n b = n - i\r\n if (math.gcd(a, b) == 1) : \r\n print(a, b)\r\n break\r\n", "n=int(input())\r\nif n%2!=0:\r\n a=n//2\r\n b=n-a\r\nelif n%4==0:\r\n a=(n//2)-1\r\n b=n-a\r\nelse:\r\n a=(n//2)-2\r\n b=n-a\r\nprint(a,b)\r\n \r\n \r\n\r\n\r\n\r\n \r\n \r\n \r\n ", "from math import gcd\r\n\r\nn = int(input())\r\nres = resI = 0\r\nfor i in range(1, n):\r\n j = n - i\r\n if i >= j: break\r\n if gcd(i, j) == 1 and res < i / j:\r\n res = i / j\r\n resI = i\r\nprint(resI, n - resI)", "n = int(input())\r\nch = 1\r\nzn = 1\r\nif n % 2 != 0:\r\n ch = n // 2\r\nelse:\r\n ch = n // 2 - 1 - (n//2)%2\r\nprint(ch, n-ch)\r\n", "import math\r\nx=int(input())\r\nn=x//2\r\nd=x-x//2\r\nwhile True:\r\n if math.gcd(n,d)!=1:\r\n n-=1\r\n d+=1\r\n else:\r\n print(n,d)\r\n break\r\n", "n=int(input())\r\nif(n%2!=0):\r\n print(n//2,end=\" \")\r\n print(n-(n//2))\r\nelse:\r\n x=n//2\r\n if((x+1)%2!=0):\r\n \r\n print(n-(x+1),end=\" \")\r\n print(x+1)\r\n else:\r\n\r\n print(n-(x+2),end=\" \")\r\n print(x+2)\r\n ", "num = int(input())\r\nif num % 2 == 0:\r\n a = int((num // 2) - 1)\r\n b = int((num // 2) + 1)\r\n if a % 2 == 0:\r\n a -= 1\r\n if b % 2 == 0:\r\n b += 1\r\nelse:\r\n a = num // 2\r\n b = a+1\r\n\r\nprint (a,b)", "n = int(input())\r\n\r\nfor i in range(n//2, 0, -1):\r\n if n % i != 0 or i == 1:\r\n found = True\r\n for j in range(i-1, 1, -1):\r\n if i % j == 0 and (n-i) % j == 0:\r\n found = False\r\n break\r\n if found:\r\n print(i, n-i)\r\n break\r\n", "n = int(input())\r\nif n % 2 == 0:\r\n print(str(n // 2 - 1) + ' ' + str(n // 2 + 1) if n // 2 % 2 == 0 else str(n // 2 - 2) + ' ' + str(n // 2 + 2))\r\nelse:\r\n print((n // 2), (n // 2) + 1)\r\n", "n=int(input())\r\nif(n%2==1):\r\n print(n//2,n//2+1)\r\nelse:\r\n j=n//2\r\n if(j%2==0):\r\n print(j-1,j+1)\r\n else:\r\n print(j-2,j+2)", "n=int(input())\r\nmx=0\r\na=0\r\nb=0\r\n\r\ndef gcd(a,b):\r\n if (b==0):\r\n return a\r\n else:\r\n return gcd(b,a%b)\r\n\r\nfor i in range(1,n):\r\n if (i>n-i):\r\n break\r\n if (gcd(i,n-i)>1):\r\n continue\r\n if (i/(n-i)>mx):\r\n mx=i/(n-i)\r\n a=i\r\n b=n-i\r\nprint(a,b)", "#FRACTION\r\nimport math\r\nflag=0\r\nn=int(input())\r\nx=0\r\ny=0\r\nfor i in range(1,n):\r\n for j in range(i+1,n):\r\n if (i+j)==n and math.gcd(i,j)==1:\r\n x=i\r\n y=j\r\n flag=1\r\n break\r\nif flag>=1:\r\n print(x,y)\r\n", "def Nod(a, b):\r\n while a != 0 and b != 0:\r\n if a > b:\r\n a = a % b\r\n else:\r\n b = b % a\r\n return a + b\r\n\r\nn = int(input())\r\nfor i in range(2, n):\r\n if Nod(n - i, i) == 1 and n - i < i:\r\n print(n - i, i)\r\n break\r\n", "# A. Fraction\n\nfrom math import floor\n\nn = int(input())\n\nif n % 2 == 0:\n numerator = n // 2 - 1\n denominator = n - numerator\nelse:\n numerator = floor(n // 2)\n denominator = n - numerator\n\nfound = False\nwhile not found:\n for i in range(2, numerator+1):\n if numerator % i == 0 and denominator % i == 0:\n numerator -= 1\n denominator += 1\n break\n else:\n found = True\n\nprint(numerator, denominator)\n", "n = int(input())\r\nnn=int(n/2)\r\nif n % 2 == 1:\r\n print(nn,nn+1)\r\nelse :\r\n x = 1 + nn%2\r\n print(nn-x,nn+x)\r\n", "a = int(input())\r\nif a&1:\r\n\tprint(a//2,a-a//2)\r\nelif a%4 ==0:\r\n\tprint(a//2-1,a-a//2+1)\r\nelse:\r\n\tprint(a//2-2,a-a//2+2)\r\n", "n=int(input())\r\na, b = 0,1\r\nfor i in range(1, n//2+1):\r\n x,y =i, n-i\r\n d=1\r\n while x!=0 and y!=0:\r\n if x>y:\r\n x%=y\r\n else:\r\n y%=x\r\n if x!=0:\r\n d=x\r\n else:\r\n d=y\r\n if d==1 and i/(n-i)>a/b:\r\n a=i\r\n b=n-i\r\nprint(a, b)", "x = eval(input())\r\na = 0\r\nb = 0\r\nif x%2==0:\r\n a = (x//2)-1\r\n b = (x//2)+1\r\nelse:\r\n a = ((x+1)//2) -1\r\n b = ((x+1)//2)\r\nif (a%2==0 and b%2==0):\r\n a-=1\r\n b+=1\r\nprint(a , b) \r\n", "import math\r\nn=int(input())\r\nj=n//2\r\nif n%2!=0:\r\n\tprint(j,n-j)\r\nelse:\r\n\tx=1\r\n\twhile n-x > x:\r\n\t\tif math.gcd(x,n-x)==1:\r\n\t\t\tc1=x\r\n\t\t\tc2=n-x\r\n\t\tx+=1\r\n\tprint(c1,c2)", "a = int(input())\r\nif a%2==0:\r\n print(a//2-1,\"\",a//2+1) if a//2%2==0 else print(a//2-2,\"\",a//2+2)\r\nelse:\r\n print(a//2,\"\",a//2+1)", "\r\nn = int(input())\r\nif n % 2 != 0:\r\n print(n//2, (n//2) + 1)\r\nelse:\r\n if n//2 % 2 != 0:\r\n print((n//2) - 2, (n//2) + 2)\r\n else:\r\n print((n // 2) - 1, (n // 2) + 1)\r\n\r\n# CodeForcesian\r\n# ♥\r\n# آخیش بلاخره همه چی تایید شد\r\n", "from fractions import gcd\r\nn = int(input())\r\nif n % 2 == 0:\r\n znam = (n//2)-1\r\n chisl = (n//2)+1\r\nelse:\r\n znam = n//2\r\n chisl = (n//2)+1\r\nwhile gcd(znam,chisl) != 1:\r\n znam -= 1\r\n chisl += 1\r\nprint(znam, chisl)", "n=int(input());print(n//2+n%2-1-(n%4==2), n//2+1+(n%4==2))", "def pgcd(a,b):\r\n p=1\r\n for i in range(2,min(a+1,b+1)):\r\n if a%i==0 and b%i==0 :\r\n p=i\r\n return(p)\r\nn=int(input())\r\nm,j=0,0\r\nfor i in range(1,n//2+1):\r\n if pgcd(i,n-i)==1:\r\n m=max(m,i/(n-i))\r\n j=i\r\nprint(j,n-j)\r\n\r\n \r\n \r\n", "import sys\nimport math\ninput = sys.stdin.readline\n\nn = int(input())\na = n // 2\nb = n - a\nwhile math.gcd(a, b) > 1:\n a -= 1\n b += 1\nprint(a, b)\n", "total = int(input())\n\ndef coprimes(total):\n half = total // 2\n if total % 2 == 0:\n if total % 4 != 0:\n return half - 2, half + 2\n return half - 1, half + 1\n half += 1\n return half - 1, half\n \nprime_1, prime_2 = coprimes(total)\n\nprint(prime_1, prime_2)", "n=int(input())\r\nx=n//2\r\nl=[0,0]\r\nif n&1==0:\r\n if x&1!=0:\r\n print(x-2,x+2)\r\n else:\r\n print(x-1,x+1)\r\nelse:\r\n print(x,x+1)", "def gcd(m,n):\r\n if(n==0):\r\n return m\r\n return gcd(n,m%n)\r\n\r\nn=int(input())\r\nif(n%2==0):\r\n t=int(n/2)\r\n i=1\r\n while(i<t):\r\n if(gcd(t-i,t+i)==1):\r\n print(t-i,t+i)\r\n break\r\n i+=1\r\nelse:\r\n t=int(n/2)\r\n i=1\r\n j=0\r\n while(t+i<n):\r\n if(gcd(t-j,t+i)==1):\r\n print(t+1-i,t+i)\r\n break\r\n i+=1\r\n j+=1\r\n\r\n", "from math import gcd\r\nn=int(input())\r\nif n%2:\r\n print(n//2,n//2+1)\r\nelse:\r\n i=n//2-1\r\n k=n-i\r\n while gcd(i,k)!=1:\r\n i-=1\r\n k+=1\r\n print(i,k)\r\n", "def coprime(a,b):\r\n k=min(a,b)\r\n list1=[]\r\n for i in range(2,k+1):\r\n if(a%i==0 and b%i==0):\r\n list1.append(i)\r\n if(len(list1)==0):\r\n return True\r\n else:\r\n return False\r\n \r\nsum=int(input())\r\nlist2=[] \r\nfor i in range(1,sum):\r\n for j in range(i,sum):\r\n if((i+j)==sum and coprime(i,j)):\r\n list1=[i,j]\r\n list2.append(list1)\r\n \r\nlist3=list2[-1]\r\nprint(*list3,sep=\" \") ", "from math import gcd\r\n\r\nn = int(input())\r\na, b = n//2, n-n//2\r\nwhile gcd(a,b) != 1:\r\n a -= 1\r\n b += 1\r\nprint(a, b)", "n = int(input())\r\na = n // 2 + n % 2 - 1\r\ni = 2\r\nwhile i <= a:\r\n if a % i == 0 and (n-a) % i == 0:\r\n a -= 1\r\n i = 2\r\n else:\r\n i += 1\r\nprint(a,n-a)\r\n", "import math\nn = int(input())\n\nif n%2==0:\n\tl=n/2\nelse:\n\tl=(n+1)/2\n\nmax_value=0\n\na1=0\nb1=0\n\nfor i in range(int(l)):\n\ta = i\n\tb = n-i\n\n\tif math.gcd(a,b)!=1:\n\t\tcontinue\n\n\telif a/b>max_value:\n\t\tmax_value=a/b\n\t\ta1=a\n\t\tb1=b\n\nprint (a1 , b1)\n", "from math import gcd\r\ns=int(input())\r\nans=-1\r\nget=[]\r\nfor i in range(1,s):\r\n if gcd(i,s-i)==1 and i<s-i and i/(s-i)>ans:\r\n ans=i/(s-i)\r\n get=[i,s-i]\r\nprint(get[0],get[1]) \r\n", "n = int(input())\r\nif n%2:\r\n print(str(n//2)+\" \"+str(n-(n//2)))\r\nelse:\r\n if (n//2-1)%2==0 and (n//2+1)%2==0:print(str(n//2-2)+\" \"+str(n//2+2))\r\n else:print(str(n//2-1)+\" \"+str(n//2+1))", "from math import gcd\r\nn = int(input())\r\nm = n // 2 + 1\r\nwhile gcd(n - m, m) - 1:\r\n m += 1\r\nprint(n - m, m)", "\nimport sys\nimport os\nimport math\nimport re\n\n\nn = int(input())\n\na = n//2\nb = n - a\n\nwhile(math.gcd(a,b) != 1):\n a -=1\n b +=1\n\nprint(a,b)\n\n\n", "def test_1():\n # A -\n import math\n from collections import Counter\n n = list(map(int, input().split(\" \")))[0]\n\n if n % 2 == 0:\n if (n / 2) % 2 == 0:\n aa = (n / 2 - 1, n / 2 + 1)\n else:\n aa = (n / 2 - 2, n / 2 + 2)\n else:\n aa = (n / 2, n / 2 + 1)\n print(' '.join(map(str, map(int, aa))))\n # print(' '.join(map(int, aa)))\n\ntest_1()\n\t \t \t\t\t \t\t\t\t \t \t \t \t \t \t", "import math\r\n\r\nn=int(input())\r\nif n%2==1:\r\n\ta,b=n//2,n//2+1\r\nelse:\r\n\ta,b=n//2-1, n//2+1\r\n\r\nwhile math.gcd(a,b)!=1:\r\n\ta-=1\r\n\tb+=1\r\n\r\nprint(a,b) ", "import math\n\nn = int(input())\n\nm=math.floor(n/2)\nfor i in range(m,0,-1):\n if math.gcd(i,n-i)==1:\n print(i, n-i)\n break\n \t\t\t\t\t \t \t\t \t \t\t\t \t \t\t \t\t \t\t", "import math\r\nn=int(input())\r\nm=n//2\r\nwhile math.gcd(n-m,m)-1:m-=1\r\nprint(m,n-m)", "from math import gcd\r\n\r\nn = int(input())\r\nm, a, b = -1, 0, 0\r\nfor i in range(2, n):\r\n j = n - i\r\n if i < j:\r\n continue\r\n if gcd(j, i) == 1:\r\n o = j / i\r\n if m < o:\r\n m, a, b = o, j, i\r\n\r\nprint(a, b)\r\n", "import math\r\nn = int(input())\r\nif n % 2 != 0:\r\n print(math.floor(n / 2), math.ceil(n / 2))\r\nelse:\r\n diff = n // 2\r\n if diff % 2 == 0:\r\n print(diff - 1, diff + 1)\r\n elif diff % 2 != 0:\r\n print(diff - 2,diff + 2)", "\"\"\" *** Author--Saket Saumya ***\n IIITM\n\"\"\"\nimport math\nimport os\nimport random\nimport re\nfrom sys import stdin,stdout\nfrom collections import Counter\n\ndef si():\n\treturn str(input())\ndef ii():\n return int(input())\ndef mi():\n return map(int, input().split())\ndef li():\n return list(mi())\n\n\nn=ii()\nfor i in range(1,(n//2)+1):\n\tfor j in range(n//2,n):\n\t\tif math.gcd(i,j)==1 and i+j==n:\n\t\t\tp=i\n\t\t\tq=j \n\t\t\tbreak\nprint(p,q)\t\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\t\n\n\n\n\n\n\n\n\n\n", "# import sys\r\n# sys.stdin=open(\"input.in\",\"r\")\r\n# sys.stdout=open(\"output.out\",\"w\")\r\n\r\nimport math\r\ndef isCoprime(a,b):\r\n\tif math.gcd(a,b)==1:\r\n\t\treturn True\r\n\telse:\r\n\t\treturn False\t\r\n\r\nx=int(input())\r\na=1\r\nb=x-a\r\nm=0\r\nl=[]\r\nwhile(a<=b):\r\n\tb=x-a\r\n\tif(isCoprime(a,b)):\r\n\t\tif( a<b and a/b>m):\r\n\t\t\tm=a/b\r\n\t\t\tl=[a,b]\r\n\ta+=1\r\nprint(l[0],l[1],end=\" \")\r\n", "n=int(input())\r\nx=n//2\r\nif x%2==0 and n%2==0:\r\n print(x-1,x+1)\r\nelif x%2==0 and n%2==1:\r\n print(x,x+1)\r\nelif x%2==1 and n%2==1:\r\n print(x,x+1)\r\nelif x%2==1 and n%2==0:\r\n print(x-2,x+2)", "a=int(input());from math import gcd as g\nfor i in range(a//2,0,-1):\n if g(i,a-i)==1:print(i,a-i);break", "import math\r\nn=int(input());a=n//2;b=n-a\r\nwhile math.gcd(a,b)>1:a-=1;b+=1\r\nprint(a, b)", "def gcd(a,b):\r\n if b==0:\r\n return a\r\n return gcd(b,a%b)\r\ndef coPrime(a,b):\r\n if gcd(a,b)==1:\r\n return True\r\n else:\r\n return False\r\nn = int(input())\r\ni = 1\r\nj = n-1\r\nwhile i<j:\r\n if coPrime(i,j):\r\n x=i\r\n y=j\r\n i+=1\r\n j-=1\r\nprint(f\"{x} {y}\")\r\n\r\n", "import math\r\n\r\nn = int(input())\r\nif n % 2 != 0:\r\n a = n // 2\r\n b = a + 1\r\nelse:\r\n a, b = n // 2, n // 2\r\nwhile math.gcd(a, b) != 1:\r\n a -= 1\r\n b += 1\r\nprint(a, b)\r\n", "n=int(input())\r\nif(n%2!=0):\r\n a=n//2\r\n b=n-a\r\nelse:\r\n a=n//2-1\r\n if(a%2==0):\r\n a-=1\r\n b=n-a\r\nprint(str(a)+\" \"+str(b))", "n=int(input());d=n//2\r\nprint(*[(d-1,d+1),(d,d+1),(d-2,d+2),(d,d+1)][n%4])", "def gcd(big, small):\r\n if big % small == 0:\r\n return small\r\n return gcd(small, big % small)\r\n\r\n\r\nn = int(input())\r\na = n // 2\r\nfor i in range(a, 0, -1):\r\n if gcd(a, n - a) == 1:\r\n print(a, n - a)\r\n break\r\n a -= 1", "import math\r\ndef gcd(a,b):\r\n if a%b==0:return b\r\n return gcd(b,a%b)\r\n\r\ndef max_irr(n):\r\n mid=math.ceil(n/2)\r\n a=mid-1\r\n b=n-a\r\n while a>0:\r\n if gcd(a,b)==1:\r\n print(a,b)\r\n return\r\n a-=1\r\n b=n-a\r\n\r\ndef runner():\r\n n=input()\r\n n=int(n)\r\n max_irr(n)\r\n\r\nrunner()", "from math import gcd\r\n\r\nn = int(input())\r\na = n // 2\r\nb = n - a\r\nwhile gcd(a, b) != 1:\r\n a -= 1\r\n b += 1\r\nprint(a, b)", "def coprime(a,b):\r\n x = min(a,b)\r\n list=[]\r\n for i in range(2,x+1):\r\n if a%i==0 and b%i==0 :\r\n list.append(i)\r\n if len(list)==0:\r\n return True\r\n else:\r\n return False\r\n\r\nwhile True:\r\n n = int(input())\r\n if n >= 3 and n <= 1000 :\r\n break\r\n else:\r\n print(\"please enter a number between 3 and 1000\")\r\n \r\nfor i in range(1,n):\r\n for j in range(i,n):\r\n if (i+j)==n and coprime(i,j) :\r\n list=[i,j]\r\n\r\nprint(*list,sep=\" \")", "a = int(input())\r\nc = []\r\nif(a%2 == 0):\r\n b = a//2\r\n h = b - 1\r\n g = b + 1\r\n if(h%2==0 and g%2==0):\r\n c.append(h-1)\r\n c.append(g+1)\r\n else:\r\n c.append(h)\r\n c.append(g) \r\nelse:\r\n a = a + 1\r\n d = a//2\r\n c.append(d - 1)\r\n c.append(d)\r\nprint(*c) \r\n\r\n\r\n ", "import math \r\nn=int(input())\r\nm=-10\r\nfor i in range(1,n+1):\r\n if i<(n-i) and math.gcd(i,n-i)==1:\r\n m=max(m,i)\r\nprint(str(m)+\" \"+str((n-m)))", "q = int(input())\nw = 1\ne = q - 1\nwhile w + 1 < e - 1:\n w += 1\n e -= 1\nfor i in range(q):\n r = 0\n for i in range(2, q):\n if e % i == 0 and w % i == 0:\n r = 1\n break\n if r == 0:\n break\n else:\n w -= 1\n e += 1\nprint(w, e)\n", "n=int(input())\r\nb=0\r\nif n%2==0:\r\n for i in range(1,n//2):\r\n a=n-i\r\n goon=True\r\n for j in range(2,i+1):\r\n if a%j==0 and i%j==0:\r\n goon=False\r\n break\r\n if goon:\r\n if i/a>b:\r\n b=i/a\r\n c=i\r\n d=a\r\nelse:\r\n for i in range(1,n//2+1):\r\n a=n-i\r\n goon=True\r\n for j in range(2,i+1):\r\n if a%j==0 and i%j==0:\r\n goon=False\r\n break\r\n if goon:\r\n if i/a>b:\r\n b=i/a\r\n c=i\r\n d=a\r\nprint(c,d)\r\n \r\n", "from math import gcd\nn=int(input())\nfor i in range((n//2)-(not n%2),0,-1):\n if gcd(i,n-i)==1:\n print(i,n-i)\n break", "n = int(input())\r\nu = 0\r\nnod = 0\r\nif n % 2 == 1:\r\n j = n // 2\r\n f = n - j\r\nelse:\r\n j = n // 2 -1\r\n f = n - j\r\nwhile u == 0:\r\n a = j\r\n b = f\r\n while a != 0 and b != 0:\r\n if a > b:\r\n a = a % b\r\n else:\r\n b = b % a \r\n nod = a+b\r\n if nod == 1:\r\n print(j,f)\r\n break\r\n else:\r\n j -= 1\r\n f += 1\r\n\t\r\n\t\r\n\t\r\n\t\r\n\t\r\n\t\r\n\t\r\n\t\r\n\t\r\n\t\r\n\t\r\n\t\r\n\t\r\n\t\r\n\t\r\n\t\r\n\t\r\n\t\r\n\t\r\n\t\r\n\t\r\n\t\r\n\t\r\n\t\r\n\t\r\n", "import math\r\nn = int(input())\r\nh = n // 2\r\nwhile math.gcd(h, n - h) - 1 >= 1:\r\n h -= 1\r\nprint(h, n - h)", "#854A\r\nn = int(input())\r\ndef gcd(x,y):\r\n p = max(x,y)\r\n q = min(x,y)\r\n r = p%q\r\n while r > 0:\r\n p = q\r\n q = r\r\n r = p%q\r\n return q\r\na = n//2\r\nb = n - a\r\nwhile gcd(a,b) > 1:\r\n a -= 1\r\n b += 1\r\nprint(a,b)", "import math\r\nx = int(input())\r\nl,r = x//2,x-x//2\r\nwhile math.gcd(l,r)!= 1:\r\n l-=1\r\n r+=1\r\nprint(l,end= ' ')\r\nprint(r)\r\n", "import math as m\r\nn=int(input())\r\nl=n/2\r\nif n%2!=0:\r\n\tprint(n//2,m.ceil(n/2))\r\nelse:\r\n\tif l%2==0:\r\n\t\tprint(int(n//2)-1,(n//2)+1)\r\n\telse:\r\n\t\tprint(n//2-2,n//2+2)", "a=int(input())\r\nif a%2!=0:\r\n\tb=int(a/2)\r\n\tprint(b,end= \" \")\r\n\tprint(b+1)\r\nelse:\r\n\tif int(a/2)%2==0:\r\n\t\tc=int(a/2)\r\n\t\tprint(c-1,end= \" \")\r\n\t\tprint(c+1)\r\n\telse:\r\n\t\td=int(a/2)\r\n\t\tprint(d-2,end= \" \")\r\n\t\tprint(d+2)\r\n", "import math\r\na=int(input())\r\nfor x in range(a//2,0,-1):\r\n\tif math.gcd(x,a-x)==1:\r\n\t\tprint(x,a-x)\r\n\t\tbreak", "import math\r\nn = int(input())\r\nif n%2==0:\r\n a = b = n//2;\r\nelse:\r\n a = n//2;\r\n b = n-n//2\r\nfor i in range(1000):\r\n if math.gcd(a,b)==1:\r\n break\r\n else:\r\n a-=1\r\n b+=1\r\nprint(a,b)\r\n ", "n=int(input())\r\nif n % 2 == 1:\r\n print(n//2,n//2+1)\r\nelif n % 4 == 0:\r\n print(n//2-1,n//2+1)\r\nelse:\r\n print(n//2-2,n//2+2)", "n = int(input())\r\na = n//2\r\nb = n-a\r\ndef gcd(a, b): \r\n while a:\r\n a, b = b % a, a\r\n return b\r\nwhile gcd(a, b) > 1:\r\n a -= 1\r\n b += 1\r\nprint(a, b)", "from math import *\r\nn= int(input())\r\nif n%2==1:\r\n print((n-1)//2,(n-1)//2+1 )\r\nelse:\r\n r= n//2\r\n for i in reversed(range(1,r)):\r\n if gcd(i,n-i)==1:\r\n print(i,n-i); exit(0)", "from math import gcd\r\nn = int(input())\r\ni = n//2\r\nfor a in range(i+1,0,-1):\r\n if gcd(a,n-a)==1 and a<n-a:\r\n print(a,n-a)\r\n break", "def gcd(a, b):\r\n\tif b == 0:\r\n\t\treturn a\r\n\telse:\r\n\t\treturn gcd(b,a%b)\r\n\t\t\r\nn = int(input())\r\n\t\t\r\nfor i in range(1,n+1):\r\n\tfor j in range(i+1,n+1):\r\n\t\tif i is not j:\r\n\t\t\tif gcd(i,j) == 1 and i + j == n:\r\n\t\t\t\txi = i \r\n\t\t\t\txj = j \r\n\r\nprint(xi,xj)\r\n", "import math\r\n\r\nn = int(input())\r\na = n // 2\r\nwhile math.gcd(a, n - a) != 1:\r\n a -= 1\r\nprint(a, n - a)", "n=int(input())\r\nif n%2!=0:\r\n\tx=n//2\r\nelif n%4==0:\r\n\tx=n//2-1\r\nelse:\r\n\tx=n//2-2\r\nprint(x,n-x)", "y=int(input())\r\nn=y//2\r\nif y%2==1:\r\n print(n,n+1)\r\nelse:\r\n a=n-1;b=n+1\r\n while a%2==0 and b%2==0:\r\n a-=1\r\n b+=1\r\n print(a,b)", "import sys, math\r\n\r\n\r\ndef arrayInput(TYPE):\r\n return [TYPE(x) for x in input().split()]\r\n\r\n\r\ndef CF():\r\n n= int(input())\r\n\r\n l= 1\r\n r= n-1\r\n\r\n while l < r:\r\n if l+r == n:\r\n if math.gcd(l, r) == 1:\r\n mxl= l\r\n mxr= r\r\n l+= 1\r\n r-= 1\r\n elif l+r > n: r-= 1\r\n else: l+= 1\r\n\r\n print(mxl, mxr)\r\n\r\n\r\nif __name__ == '__main__':\r\n \r\n CF()\r\n", "n = int(input())\r\nif n%2 == 1 :\r\n\ta = n/2\r\n\tb = n/2+1\r\nelse:\r\n\tif n%4 == 0:\r\n\t\ta = n//2-1\r\n\t\tb = n//2+1\r\n\telse:\r\n\t\ta = n//2-2\r\n\t\tb = n//2+2\r\nprint(int(a),int(b))\r\n\t\t\r\n", "from math import gcd\r\nn=int(input())\r\nif n%2==0:\r\n k=n//2-1\r\n m=n//2+1\r\n while k*m/gcd(k,m)!=k*m:\r\n k-=1\r\n m+=1\r\n print(str(k)+' '+str(m))\r\nelse:\r\n print(str(n//2)+' '+str(n//2+1))\r\n", "n = int(input())\nr = n // 2 + 1\nl = n-r\n\nif r % 2 == 0 and r - l == 2:\n l -= 1\n r += 1\n\nprint(l, r)", "def gcd(a,b):\r\n while b:\r\n a,b = b,a%b\r\n return abs(a)\r\nn = int(input())\r\na = n//2\r\nb = n-a\r\nwhile gcd(a,b) != 1:\r\n a -= 1\r\n b += 1\r\n \r\nprint(a,b)\r\n ", "n = int(input())\r\nif n & 1:\r\n x = n // 2\r\nelse:\r\n if n % 4 == 0:\r\n x = n // 2 - 1\r\n else:\r\n x = n // 2 - 2\r\ny = n - x\r\nprint(x, y)", "from math import gcd\n\ndef max_fraction(n):\n numerator = 1\n denominator = n-1\n for i in range(2, n):\n if gcd(i, n-i) == 1 and i < n-i:\n numerator = i\n denominator = n-i\n return numerator, denominator\n\nn = int(input())\na, b = max_fraction(n)\nprint(f\"{a} {b}\")\n\n \t \t \t\t \t\t\t\t \t\t\t\t \t \t\t\t \t", "x = eval(input())\r\nif x%2==1:\r\n y = x//2\r\n print(y, y+1)\r\nelif x%4==0:\r\n print(x//2-1,x//2+1)\r\nelse:\r\n print(x//2-2,x//2+2) \r\n\r\n", "n=int(input())\r\nif n%2!=0:\r\n\tx=n//2\r\nelif n%4==0:\r\n\tx=(n//2)-1\r\nelse:\r\n\tx=(n//2)-2\r\nprint(x,n-x)", "def gcd(x,y):\r\n if y==0:\r\n return x\r\n return gcd(y,x%y)\r\nn=int(input())\r\nA=0\r\nB=1\r\nfor i in range(1,n//2+n%2):\r\n a=i\r\n b=n-i\r\n if gcd(i,n-i)==1 and a*B>A*b:\r\n A,B=a,b\r\nprint(A,B)", "n = int(input())\r\nif n % 2 == 0:\r\n if (int(n/2-1)) % 2 == 0:\r\n print(int(n/2-2), end=\" \")\r\n print(int(n/2+2))\r\n else:\r\n print(int(n/2-1), end=\" \")\r\n print(int(n/2+1))\r\nelse:\r\n print(int(n/2), end=\" \")\r\n print(int(n/2+1))", "n = int(input())\r\n\r\nif n % 2 != 0:\r\n\tx = n // 2\r\nelif n % 4 == 0:\r\n\tx = n // 2 - 1\r\nelse:\r\n\tx = n // 2 - 2\r\n\r\nprint(x, n - x)", "a = int(input())\r\nif (a%2 == 0):\r\n if (a%4 == 0):\r\n print(a//2-1, a//2+1)\r\n else:\r\n print(a//2-2, a//2+2)\r\nelse:\r\n print(a//2, a//2+1)", "n = int(input())\r\nfrom fractions import gcd\r\na = int(n/2)\r\nwhile True:\r\n if gcd(a, n-a) == 1:\r\n break\r\n else:\r\n a -= 1\r\n\r\nprint(a, end = ' ')\r\nprint(n-a)", "import math\r\nn = int(input())\r\nnum = n//2\r\nden = n - num\r\nwhile(math.gcd(num,den) != 1):\r\n num -= 1\r\n den += 1\r\nprint(num,den)\r\n\r\n\r\n \r\n \r\n\r\n\r\n \r\n", "a=int(input())\nif a/2==a//2:\n if (a-2)/4==(a-2)//4:\n print(str((a//2)-2)+\" \"+str((a//2)+2))\n else:\n print(str((a//2)-1)+\" \"+str((a//2)+1))\nelse:\n print(str(a//2)+\" \"+str((a//2)+1))\n", "import math\n\n\ndef fraction(n):\n for i in range(n // 2, 0, -1):\n if math.gcd(i, n - i) == 1:\n return i, n - i\n\n\nif __name__ == \"__main__\":\n n = int(input())\n result = fraction(n)\n print(*result)\n", "x=int(input())\r\nif x%2!=0:print(x//2, (x//2)+1 )\r\nelse:print(str((x//2)-2)+' '+str((x//2)+2) if x//2 % 2!=0 else str(x//2-1)+' '+str(x//2+1))", "def gcd(a, b):\r\n if a == 0:\r\n return b\r\n return gcd(b % a, a)\r\n \r\ndef maxIrreducibleFraction(n):\r\n nom = n // 2 if n % 2 != 0 else (n // 2) - 1\r\n dem = (n // 2) + 1\r\n while nom >= 1:\r\n if gcd(nom, dem) == 1:\r\n return (nom, dem)\r\n nom -= 1\r\n dem += 1\r\n return (nom, dem)\r\n \r\nn = int(input())\r\nprint(*maxIrreducibleFraction(n))\r\n\r\n", "n=int(input())\r\nif n%2==1:\r\n\tprint(int(n/2),int(n/2)+1)\r\nelse:\r\n\tif ((n//2)-1)%2==1 and ((n//2)+1)%2==1:\r\n\t\tprint(((n//2)-1),((n//2)+1))\r\n\telse:\r\n\t\tprint(((n//2)-2),((n//2)+2))\t", "n = int(input())\nans_a = 1\nans_b = n - 1\nfor a in range(1, n // 2 + 1):\n b = n - a\n f = 1\n for d in range(2, a + 1):\n if a % d == 0 and b % d == 0:\n f = 0\n break\n if f and a / b > ans_a / ans_b:\n ans_a = a\n ans_b = b\nprint(ans_a, ans_b)", "from math import sqrt, gcd\r\nn = int(input()) \r\nb = n-1\r\nA = 1\r\nfor a in range(1, n//2+1): \r\n\r\n if a!=n-a and gcd(a, n-a) == 1 : \r\n A = a\r\n b = n-a \r\nprint(A, b)", "n = int(input())\r\n\r\ndef gcd(a, b):\r\n while b:\r\n a, b = b, a % b\r\n return a\r\n\r\nk = 0\r\na = 0\r\nb = 0\r\nfor i in range( 1, n ):\r\n j = n - i\r\n if i > j:\r\n break\r\n\r\n #print( i, j, i/j )\r\n \r\n if i / j > k:\r\n if gcd( i, j ) == 1:\r\n k = i / j\r\n a = i\r\n b = j\r\n\r\nprint( a, b )\r\n", "n = int(input())\nch = 1\nzn = 1\nif n % 2 != 0:\n ch = n // 2\nelse:\n ch = n // 2 - 1 - (n//2)%2\nprint(ch, n-ch)", "n = int(input())\r\nif n % 2 == 0:\r\n a = int(n/2) - 1\r\n b = int(n/2) + 1\r\nelif n % 2 == 1:\r\n a = int(n//2)\r\n b = int(n//2) + 1\r\nwhile True:\r\n listaA = []\r\n listaB = []\r\n cont = 1\r\n while cont <= (a//2):\r\n if a % cont == 0:\r\n listaA.append(cont)\r\n cont += 1\r\n listaA.append(a)\r\n cont = 1\r\n while cont <= (b//2):\r\n if b % cont == 0:\r\n listaB.append(cont)\r\n cont += 1\r\n listaA.append(b)\r\n for i in range(1, len(listaA)):\r\n if listaA[i] not in listaB:\r\n print(a, b)\r\n exit()\r\n else:\r\n a -= 1\r\n b += 1\r\n break", "a=int(input())\nthesum=0\nif a%2==0:\n firstnumber=int(a/2)\n secondnumber=int(a/2)\n\nelif a%2==1:\n firstnumber=int((a-1)/2)\n secondnumber=int((a+1)/2)\nkillnumber=0\nprimenumber=2\nrocketnumber=0\nwhile rocketnumber==0: \n while killnumber==0 and primenumber<=firstnumber:\n if firstnumber%primenumber==0 and secondnumber%primenumber==0:\n killnumber=1\n else:\n primenumber=primenumber+1\n if killnumber==1:\n firstnumber=firstnumber-1\n secondnumber=secondnumber+1\n primenumber=2\n killnumber=0\n else:\n rocketnumber=1\nprint(str(firstnumber)+\" \"+str(secondnumber))", "def gcd(a, b):\n if b == 0:\n return a\n else:\n return gcd(b, a % b)\n\n\ndef solve(n):\n a = 0\n b = 0\n for i in range(1,n):\n for j in range(i, n):\n if i + j == n and gcd(i, j) == 1 and i > a:\n a = i\n b = j\n print(a, b)\n \n\ndef main():\n n = int(input())\n solve(n)\n\nmain()\n", "import math\r\nn=int(input())\r\na,b=n//2,n-n//2\r\nwhile math.gcd(a,b)!=1:a,b=a-1,b+1\r\nprint(a,b)", "n = int(input())\r\nif n%2!=0:\r\n\tprint(n//2,(n//2)+1)\r\nelse:\r\n\ta = n//2\t\r\n\tif a%2==0:\r\n\t\tprint(a-1,a+1)\r\n\telif a%2!=0:\r\n\t\tprint(a-2,a+2)\t\r\n", "n=int(input())\r\na=n//2\r\nb=n-a\r\nfrom math import gcd\r\nwhile gcd(a,b)!=1:\r\n a-=1\r\n b+=1\r\nprint(a,b)", "def gcd(a,b):\r\n i=1\r\n while i<=a and i<=b:\r\n if a%i==0 and b%i==0:\r\n ans=i\r\n i+=1\r\n return ans\r\nn=int(input())\r\nc=0\r\nfor i in range(n//2,0,-1):\r\n if gcd(i,n-i)==1:\r\n print(i,n-i)\r\n break", "a=int(input());d=a//2-(1 if not a%2 else 0);e=a-d\r\nwhile (d>1):\r\n i=2\r\n while(i<=d):\r\n if d%i==0 and e%i==0:d-=1;e+=1;break\r\n else:i+=1\r\n if i==d+1:print(d,e);exit()\r\nprint(1,a-1)\r\n", "n = int(input())\r\nk = 0\r\nfor i in range(1, n//2+1):\r\n c = 1\r\n a = i\r\n b = n - i\r\n for q in range(2, a+1):\r\n if a % q == 0 and b % q == 0:\r\n c = 0\r\n break\r\n if c == 1:\r\n k = a\r\nprint(k, n-k)", "from math import gcd as g\r\nn = int(input())\r\nq = n//2\r\nw = n-q\r\nwhile g(q,w)!=1:\r\n q-=1\r\n w+=1\r\nprint(q,w)\r\n ", "import fractions\r\nn = int(input())\r\nfor i in range (n//2,0,-1) :\r\n #print (i)\r\n g =int( fractions.gcd(i,n-i))\r\n if g == 1:\r\n print(i,\" \",n-i)\r\n break", "def eas(u,d):\n if u==1:\n return True\n i=2\n while (u//i+d//i)*i!=(u+d):\n if i==u:\n return True\n i+=1\n return False\n \nn=int(input())\na=n//2\nb=n-a\nwhile True:\n if eas(a,b):\n print(str(a)+\" \"+str(b))\n break\n a-=1\n b+=1", "def divisor(m):\n\tl = []\n\tfor i in range(2,(m//2)+2):\n\t\tif m%i==0:\n\t\t\tl.append(i)\t\n\treturn [len(l), l]\n\nn = int(input())\nif n%2!=0:\n\ta = (n//2)\n\tb = n-a\nelse:\n\ta = (n//2)-1\n\tb = n-a\n\nwhile True:\n\ta_l = divisor(a)\n\tb_l = divisor(b)\n\tif a_l[0]+b_l[0] == len(set(a_l[-1]+b_l[-1])):\n\t\tbreak\n\telse:\n\t\ta-=1\n\t\tb+=1\nprint(a, b)\t\t \n\t \t \t \t\t \t\t\t\t \t \t \t \t \t", "#http://codeforces.com/problemset/problem/854/A\nimport math\nn = int(input())\n#Using this, A will always be <= b when even. a<b when odd\na,b = n//2 , n-n//2 \nwhile (math.gcd(a,b)!= 1):\n\ta -= 1\n\tb += 1\nprint(a,b)", "import math\nn = int(input())\nprev_div=0\ndef are_coprime(x, y):\n if math.gcd(x,y)==1:\n return 1\n else:\n return 0\nfor i in range(1,n):\n for j in range(i+1,n+1):\n if i+j==n:\n if are_coprime(i,j)==1:\n if prev_div<(i/j):\n prev_div=i/j\n max_num=i\n max_den=j\n\nprint(max_num,end=\" \")\nprint(max_den)\n\n", "import sys,math\r\nn=int(sys.stdin.readline())\r\nif n%2==0:\r\n f=n//2\r\n a=f-1\r\n b=f+1\r\n while True:\r\n if math.gcd(a,b)==1:\r\n print(a,b)\r\n break\r\n else:\r\n a-=1\r\n b+=1\r\nelse:\r\n f=n//2\r\n a=f\r\n b=f+1\r\n while True:\r\n if math.gcd(a,b)==1:\r\n print(a,b)\r\n break\r\n else:\r\n a-=1\r\n b+=1\r\n \r\n \r\n\r\n\r\n", "from fractions import gcd\r\nn = input()\r\nn = int(n)\r\nif n%2 == 0:\r\n a = n/2 - 1\r\n b = n/2 + 1\r\nelse:\r\n a = (n-1)/2\r\n b = (n+1)/2\r\nwhile gcd(a,b)>1 :\r\n a = a-1\r\n b = b+1\r\nprint (int(a), int(b))", "def fun(a,b):\r\n x=min(a,b)\r\n for i in range(2,x+1):\r\n if(a%i==0 and b%i==0):\r\n return False\r\n return True\r\nn=int(input())\r\na=n//2\r\nb=n-a\r\nwhile(a!=0):\r\n if(fun(a,b)):\r\n break\r\n a-=1\r\n b+=1\r\nprint(a,b)", "def nod(a, b):\r\n while (a!=0) and (b!=0):\r\n if a>b: a%=b;\r\n else: b%=a;\r\n return a+b\r\n \r\n\r\nn = int(input())\r\n\r\na = n//2 if n%2==1 else n//2-1\r\nb = n - a\r\n\r\nwhile nod(a, b)!=1:\r\n a-=1\r\n b+=1\r\n \r\nprint (a, b)", "from math import gcd\r\n\r\n\r\nn = int(input())\r\n\r\nfor a in range(n >> 1, 0, -1):\r\n b = n - a\r\n if gcd(a, b) == 1:\r\n print(a, b)\r\n break", "num=int(input())\nif num>=3 and num<=1000:\n if num/2==num//2:\n a=int((num/2)-1)\n b=int(num-a)\n while a>=1:\n w=2\n while w<b:\n if a/w==a//w and b/w==b//w:\n a=a-1\n b=b+1\n break\n w=w+1\n if w==b:\n print(str(a)+\" \"+str(b))\n break\n else:\n a=int(num//2)\n b=int(num-a)\n while a>=1:\n w=2\n while w<b:\n if a/w==a//w and b/w==b//w:\n a=a-1\n b=b+1\n break\n w=w+1\n if w==b:\n print(str(a)+\" \"+str(b))\n break", "import math\nn=int(input())\nanswer=0\nnumerator=0\ndenominator=0\nfor a in range(1, 1001):\n\tfor b in range(a+1, 1001):\n\t\tif a+b==n:\n\t\t\tif math.gcd(a, b)==1:\n\t\t\t\tif a/b>answer:\n\t\t\t\t\tanswer=a/b\n\t\t\t\t\tnumerator=a\n\t\t\t\t\tdenominator=b\nprint(numerator, denominator)\n", "from math import gcd\r\nn = int(input())\r\nk = n // 2\r\nfor i in range(k, n):\r\n if gcd(i, n - i) == 1:\r\n print(*sorted([n - i, i]))\r\n break", "from math import gcd\r\ndef inp():\r\n return int(input())\r\ndef linp():\r\n return list(map(int, input().split(' ')))\r\ndef minp():\r\n return map(int, input().split(' '))\r\nls = []\r\nn = inp()\r\nfor i in range(n//2+1):\r\n k = n-i\r\n if gcd(k,i)==1 :\r\n ls.append(max(k,i))\r\nls = sorted(ls)\r\nprint((n-ls[0]), end=\" \")\r\nprint(ls[0])\r\n", "n=int(input())\r\nif n%2:print(int(n/2),int(n/2)+1)\r\nelif int(n/2)%2:print(int(n/2)-2,int(n/2)+2)\r\nelse:print(int(n/2)-1,int(n/2)+1)", "n=int(input())\r\nif n%2==1:\r\n print((n-1)//2, (n+1)//2)\r\nelse:\r\n if n%4==0:\r\n print(n//2-1, n//2+1)\r\n else:\r\n print(n//2-2, n//2+2)", "gcd = lambda a, b: gcd(b, a % b) if b else a\r\n\r\n\r\nn = int(input())\r\n\r\nfor a, b in zip(range((n - 1) // 2, 0, -1), range((n + 2) // 2, n)):\r\n if gcd(a, b) == 1:\r\n print(a, b)\r\n break", "from math import gcd\nn = int(input())\na, b = 1, n - 1\nfor c in range(1, n):\n if gcd(c, n - c) == 1 and c < n - c:\n a, b = c, n - c\nprint(a, b)\n", "# cook your dish here\r\n\r\ndef main():\r\n n = int(input())\r\n if n%2==0:\r\n a = n//2-1\r\n b = n//2+1 \r\n i = 2\r\n while True:\r\n if a%i==0 and b%i==0:\r\n a-=1 \r\n b+=1 \r\n i+=1 \r\n else:\r\n break\r\n print('{} {}'.format(a,b))\r\n else:\r\n print('{} {}'.format(n//2, n-n//2))\r\n \r\nmain()\r\n", "def gcd(a, b):\r\n if a == 0:\r\n return b\r\n else:\r\n return gcd(max(a,b)%min(a,b), min(a,b))\r\n\r\n\r\nn = int(input())\r\na = int(n/2)\r\nwhile True:\r\n b = n - a\r\n if gcd(a,b) == 1:\r\n print(str(a)+\" \"+str(b))\r\n break\r\n elif a == 0:\r\n break\r\n else:\r\n a-=1", "import math\r\n\r\nn = int(input())\r\n\r\nnum = math.floor(n/2)\r\nden = math.ceil(n/2)\r\n\r\nif math.gcd(num, den) == 1:\r\n print(num, den)\r\nelse:\r\n x = 0\r\n while x == 0:\r\n num = num - 1\r\n den = den + 1\r\n if math.gcd(num, den) == 1:\r\n x = 1\r\n print(num, den)\r\n", "import math\r\nx = int(input())\r\nhalf = x / 2.0\r\ny = math.floor(half)\r\nz = math.ceil(half)\r\n\r\n\r\n\r\nif(y == z):\r\n y = y - 1\r\n z = z + 1\r\n\r\nif(y % 2 == 0 and z % 2 == 0):\r\n y = y - 1\r\n z = z + 1\r\n \r\nprint(y,z)", "import math\r\nn=int(input())\r\nif(n%2==0):\r\n a=n//2-1\r\n b=n//2+1\r\nelse:\r\n a=n//2\r\n b=n//2+1\r\nwhile(math.gcd(a,b)!=1):\r\n a-=1\r\n b+=1\r\nprint(a,b)", "n = int(input())\r\nif n&1:\r\n print(n//2,n//2+1)\r\nelse:\r\n m = n//2\r\n if m&1 == 0:\r\n print(m-1,m+1)\r\n else:\r\n print(m-2,m+2)", "def gcd(x,y):\r\n while y:\r\n x,y=y,x%y\r\n return x\r\n\r\nn=int(input())\r\na=[]\r\nb=[]\r\nfor i in range(1,n-1):\r\n for j in range(i+1,n):\r\n if i+j==n and gcd(i,j)==1:\r\n a+=[i/j]\r\n b+=[[i,j]]\r\n\r\nprint(*b[a.index(max(a))],sep=' ')\r\n", "n = int(input())\r\n\r\nif n%2!=0:\r\n\tprint(n//2, (n//2)+1)\r\nelse:\r\n\tif n%4==0:\r\n\t\tprint((n//2)-1,(n//2)+1)\r\n\telse:\r\n\t\tprint((n//2)-2,(n//2)+2)", "### Solution 1.\r\n# from math import gcd\r\n# n = int(input())\r\n# for a in range(n//2, 0, -1):\r\n # b = n - a\r\n # if gcd(a,b)==1:\r\n # print(a, b)\r\n # exit()\r\n \r\n### Solution 2.\r\nn = int(input())\r\nif n%2 == 1:\r\n print(n//2, n//2+1)\r\nelif n%4 == 0:\r\n print(n//2-1, n//2+1)\r\nelse:\r\n print(n//2-2, n//2+2)", "def hcf(a,b):\r\n if b==0:\r\n return a\r\n return hcf(b,a%b)\r\n\r\nn=int(input())\r\nfor i in range(n//2+1,0,-1):\r\n if hcf(i,n-i)==1:\r\n print(min(i,n-i),max(i,n-i))\r\n break\r\n \r\n", "def gcd(a, b):\r\n if b == 0:\r\n return a\r\n return gcd(b, a % b)\r\nn = int(input())\r\nnum = n // 2 + n % 2 - 1\r\nden = n - (n // 2 + n % 2 - 1)\r\nwhile gcd(den, num) != 1:\r\n num -= 1\r\n den += 1\r\nprint(num, den)\r\n", "import math\r\n\r\ndef solution(x):\r\n s=int(x/2)\r\n t=x-s\r\n while math.gcd(t,s)>1:\r\n t+=1\r\n s-=1\r\n return [s,t]\r\n\r\ndef printer(l1):\r\n return str(l1[0])+\" \" +str(l1[1])\r\n\r\ndef answer():\r\n a = int(input())\r\n print(printer(solution(a)))\r\nanswer()\r\n", "\r\nn = int(input())\r\n\r\n\r\ndef computeGCD(a, b):\r\n\r\n while b:\r\n a, b = b, a % b\r\n\r\n return a\r\n\r\n\r\na = n // 2\r\nb = n - a\r\n\r\n\r\nwhile computeGCD(a, b) != 1:\r\n a -= 1\r\n b += 1\r\n\r\nprint(a, b)", "A=int(input())\r\narr = range(1,int(A/2)+1)\r\narr2 = range(int(A/2)+1,A)\r\nres=''\r\nfor a,i in zip((arr),reversed(arr2)):\r\n final = False\r\n for x in range(len(arr)):\r\n if (a%(x+2)==0 and i%(x+2)==0) and i+a==A: \r\n final = True\r\n \r\n if not final:\r\n res=str(a)+' '+str(i)\r\n final = False\r\nprint(res)", "n = int(input())\n\nif n % 2 == 0:\n\tif n % 4:\n\t\tprint(n // 2 - 2, n // 2 + 2)\n\telse:\n\t\tprint(n // 2 - 1, n // 2 + 1)\nelse:\n\tprint(n // 2, n // 2 + 1)", "num=int(input())\na=num//2\nif a*2==num:\n a=a-1\n while a//2==a/2:\n a=a-1\nb=num-a\nprint(str(a)+\" \"+str(b))\n", "num = int(input())\r\nif num%2!=0:\r\n a = num//2\r\nelif num%4==0:\r\n a = num//2-1\r\nelse:\r\n a = num//2-2\r\nprint(a,num-a)\r\n ", "##a = list(map(int, input().split()))\r\n##print(' '.join(map(str, res)))\r\n\r\ndef gcd(a, b):\r\n if a < b:\r\n a, b = b, a\r\n if b == 0:\r\n return a\r\n return gcd(b, a%b)\r\n\r\nn = int(input())\r\n\r\nresa = 1\r\nresb = n-1\r\nfor a in range(1, n//2+1):\r\n b = n-a\r\n g = gcd(b, a)\r\n if g == 1: \r\n if resa*b < a*resb:\r\n resa, resb = a, b\r\nprint(' '.join(map(str, [resa, resb])))\r\n\r\n ", "n = int(input())\ni = 0\nb = 0\nu = []\n\ndef checkNOD(num, num_2):\n while num != num_2:\n if num > num_2: num -= num_2\n else: num_2 -= num\n\n return num\n\nwhile n > i + 1:\n i += 1\n n -= 1\n\n if checkNOD(i, n) == 1:\n if b < i / n:\n b = i / n\n u = [str(i), str(n)]\n\nprint(' '.join(u))", "def common_divisor(a, b):\n for x in range(2, a + 1):\n if a % x == 0 and b % x == 0:\n return True\n return False\n\nn = int(input())\na = int(n / 2)\nb = n - a\nwhile a % b == 0 or common_divisor(a, b):\n a, b = a - 1, b + 1\nprint(a, b)", "import math\r\nn=int(input())\r\nif n%2==0:\r\n\ta=n//2-1\r\n\tb=n//2+1\r\nelse:\r\n\ta=n//2\r\n\tb=n//2+1\r\nflag=0\r\nwhile flag==0:\r\n\tif math.gcd(a,b)==1:\r\n\t\tprint(a,b)\r\n\t\tflag=1\r\n\telse:\r\n\t\ta=a-1\r\n\t\tb=b+1\r\n", "n=int(input())\r\nx=n//2\r\nif(n%2==1):\r\n print(x,x+1)\r\nelif(x%2==1):\r\n print(x-2,x+2)\r\nelse:\r\n print(x-1,x+1)", "n = int(input())\r\n\r\nres = []\r\n\r\ndef gcd(a, b):\r\n if(b == 0):\r\n return a\r\n return gcd(b, a % b)\r\n\r\nfor up in range(1005):\r\n for down in range(1, 1005):\r\n if(up < down and up + down == n):\r\n if(gcd(up, down) == 1):\r\n res.append((up/down, up, down))\r\n\r\nres = sorted(res)\r\nprint(res[-1][1], res[-1][2])\r\n", "from fractions import gcd\r\nn=int(input())\r\na,b=n//2,n//2+n%2\r\nwhile gcd(a,b)!=1:\r\n b-=1\r\n a+=1\r\nprint(*[[b,a],[a,b]][n%2]) ", "from math import gcd\r\nn = int(input())\r\nfor a in range(n//2, 0, -1):\r\n b = n - a\r\n if gcd(a,b)==1:\r\n print(a, b)\r\n exit()", "n = int(input())\r\nif n%2:print((n//2),(n//2)+1)\r\nelif n%4==0:print((n//2)-1,(n//2)+1)\r\nelse:print((n//2)-2,(n//2)+2)", "import math\r\na=int(input())\r\nb=a//2\r\nc=a-a//2\r\nwhile math.gcd(b, c)!=1:\r\n b=b-1\r\n c=c+1\r\nprint(b, c)", "from math import *\r\nn=int(input())\r\nmax1=0\r\nfor i in range(1,n):\r\n\tif i/(n-i)>max1 and i/(n-i)<1 and gcd(i,(n-i))==1:\r\n\t\tmax1=i/(n-i)\r\n\t\ta,b=i,(n-i)\r\nprint(a,b)", "import math\r\nn=int(input())\r\na=0\r\nb=0\r\nif n%2==0:\r\n a=n//2-1\r\n b=n//2+1\r\nelse:\r\n a=n//2\r\n b=n-a\r\nwhile a>=1 and b<n:\r\n if math.gcd(a,b)==1:\r\n print(a,b,sep=\" \")\r\n break\r\n a=a-1\r\n b=b+1\r\n", "n = int(input())\r\nl = [-1,0,-1,1]\r\nu = ((n//4)<<1)+l[n%4] \r\nprint(u,n-u) \r\n", "from math import gcd\r\nimport sys\r\n\r\nn = int(input())\r\na = max(1, n // 2 + 1)\r\nb = n - a\r\nif a > b:\r\n a, b = b, a\r\nwhile gcd(a, b) != 1 and a > 1 and b < n - 1:\r\n a -= 1\r\n b += 1\r\n\r\nprint(a, b)\r\n\r\n'''\r\n\r\n'''", "def fact(num1,num2):\n if(num2==0):\n return num1\n return fact(num2,num1%num2)\n \nresults=[]\nnum = int(input())\nnum1=0\nnum2=num-num1\n#print(num1,num2)\nwhile(num1<num2 ):\n## print(num1,num2)\n## print(\"//\")\n #print(num1,num2)\n if(fact(num2,num1)==1):\n## print(num1,num2)\n results.append(num1)\n num1+=1\n num2-=1\n#print(\"//\")\n#print(len(results))\nresult = results[len(results)-1] \nprint(result,num-result)\n", "x=int(input())\nfrom math import gcd\nj=x//2\nwhile 1:\n if gcd(j,x-j)==1:\n print(*sorted([j,x-j]))\n break\n else:\n j-=1\n \n \t \t\t \t\t\t\t\t \t \t\t \t \t" ]

[ "n = int(input())\r\nseg = []\r\n\r\nfor i in range(n):\r\n l, r = map(int, input().split())\r\n seg.append((l, r, i))\r\n\r\nseg.sort(key=lambda tup: (tup[1], tup[0], tup[2]))\r\nassigned = set()\r\nans = [0] * n\r\n\r\nfor i in range(n):\r\n \r\n # this loop won't run more than 100 times as n <= 100\r\n for j in range(seg[i][0], seg[i][1] + 1, 1):\r\n if j not in assigned:\r\n ans[seg[i][2]] = j\r\n assigned.add(j)\r\n break\r\n\r\n\r\nfor i in range(n):\r\n print(ans[i], end=' ')", "# LUOGU_RID: 132995904\nn = int(input())\r\na, ans, b = [], [0]*n, [0]*10000001\r\nfor i in range(n):\r\n L, R=map(int, input().split())\r\n a.append([R,L,i])\r\na.sort()\r\nfor z in a:\r\n R, L, i = z\r\n for j in range(L,R + 1):\r\n if b[j] == 0:\r\n b[j] = 1\r\n ans[i] = j\r\n break\r\nprint(*ans)", "from operator import itemgetter\r\nfrom heapq import heappop,heappush\r\n\r\nn=int(input())\r\nLR=[list(map(int,input().split()))+[i] for i in range(n)]\r\nLR.sort(key=itemgetter(0))\r\n\r\nANS=[0]*n\r\n\r\nQ=[]\r\n\r\nind=0\r\nfor i in range(10**7+1):\r\n while ind<len(LR) and LR[ind][0]==i:\r\n x,y,c=LR[ind]\r\n heappush(Q,(y,c))\r\n ind+=1\r\n \r\n if Q:\r\n x,y=heappop(Q)\r\n ANS[y]=i\r\n\r\nprint(*ANS)\r\n \r\n", "def read_int():\r\n return int(input())\r\n \r\ndef read_array():\r\n return list(map(int, input().split()))\r\n\r\nfrom collections import defaultdict\r\n\r\ntimes = []\r\nn = read_int()\r\nstarts = defaultdict(list)\r\nends = defaultdict(list)\r\nfor i in range(n):\r\n l, r = read_array()\r\n times.append((l, r, i))\r\n starts[l].append(i)\r\n ends[r].append(l)\r\n\r\nimport heapq\r\n\r\nh = []\r\n\r\nans = {}\r\nfor day in range(10 ** 7):\r\n if day in starts:\r\n for idx in starts[day]:\r\n heapq.heappush(h, (times[idx][1], idx))\r\n\r\n if len(h) > 0:\r\n most_close_end, idx = heapq.heappop(h)\r\n ans[idx] = day\r\n\r\nprint(\" \".join([str(ans[i]) for i in range(n)]))", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nSpyder Editor\r\n\r\nThis is a temporary script file.\r\n\"\"\"\r\n\r\nn = int(input())\r\nfreq = [0] * 10000001\r\nans = [0] * 100\r\na = []\r\nfor i in range(n):\r\n l , r = map(int, input().split())\r\n temp = (r, l, i)\r\n a.append(temp)\r\n\r\na.sort()\r\nfor i in range(n):\r\n r, l, v = a[i][0], a[i][1], a[i][2]\r\n for j in range(l, r+1):\r\n if freq[j] == 0:\r\n freq[j] = 1\r\n ans[v] = j\r\n break\r\n \r\nfor i in range(n):\r\n print(ans[i], \" \", end = \"\")", "# from dust i have come, dust i will be\r\n\r\nn = int(input())\r\nseg = []\r\n\r\nfor i in range(n):\r\n l, r = map(int, input().split())\r\n seg.append((l, r, i))\r\n\r\nseg.sort(key=lambda tup: (tup[1], tup[0], tup[2]))\r\nassigned = set()\r\nans = [0] * n\r\n\r\nfor i in range(n):\r\n \r\n # this loop won't run more than 100 times as n <= 100\r\n for j in range(seg[i][0], seg[i][1] + 1, 1):\r\n if j not in assigned:\r\n ans[seg[i][2]] = j\r\n assigned.add(j)\r\n break\r\n\r\n\r\nfor i in range(n):\r\n print(ans[i], end=' ')\r\n\r\n'''\r\n10\r\n1 10\r\n3 4\r\n8 10\r\n3 4\r\n5 9\r\n1 4\r\n7 10\r\n1 9\r\n1 8\r\n4 10\r\n\r\n'''", "def process(A):\r\n n = len(A)\r\n A = [[A[i][0], A[i][1], i] for i in range(n)]\r\n A = sorted(A, key=lambda a:a[1])\r\n S = set([])\r\n answer = []\r\n for l, r, i in A:\r\n if len(answer)==0:\r\n answer.append([i, l])\r\n S.add(l)\r\n else:\r\n p1 = l\r\n while p1 in S:\r\n p1+=1\r\n assert l <= p1 <= r\r\n answer.append([i, p1])\r\n S.add(p1)\r\n answer = sorted(answer)\r\n return [x[1] for x in answer]\r\n\r\nt = int(input())\r\nA = []\r\nfor i in range(t):\r\n l, r = [int(x) for x in input().split()]\r\n A.append([l, r])\r\nprint(' '.join(map(str, process(A))))", "n = int(input())\r\nintervals = [list(map(int, input().split())) for i in range(n)]\r\nintervals = list(enumerate(intervals))\r\n \r\nintervals.sort(key=lambda x: (x[1][1], x[1][0]))\r\nans = [0] * n\r\nvis = set()\r\nfor idx, (l, _) in intervals:\r\n while l in vis:\r\n l += 1\r\n vis.add(l)\r\n ans[idx] = l\r\nprint(' '.join(list(map(str, ans))))", "\r\nimport math \r\nimport sys\r\ndef main(arr):\r\n \r\n \r\n for i in range(len(arr)):\r\n a,b=arr[i] \r\n arr[i]=[a,b,i]\r\n \r\n arr.sort(key=lambda x:(x[1],x[0]))\r\n ans=[0]*len(arr)\r\n next_val=0\r\n taken=set()\r\n for i in range(len(arr)):\r\n\r\n l,r,idx=arr[i] \r\n start=l \r\n while start in taken:\r\n start+=1 \r\n\r\n \r\n ans[idx]=start\r\n taken.add(start)\r\n print(*ans)\r\n\r\n\r\n\r\n\r\nn=int(input())\r\narr=[list(map(int,input().split())) for i in range(n)]\r\n(main(arr))\r\n \r\n \r\n\r\n\r\n \r\n \r\n \r\n ", "n = int(input())\r\na = [list(map(int, input().split())) for _ in range(n)]\r\na = list(enumerate(a))\r\na.sort(key=lambda x:(x[1][1], x[1][0]))\r\nans = [0] * n\r\ns = set()\r\nfor i, (l, r) in a:\r\n while l in s:\r\n l += 1\r\n s.add(l)\r\n ans[i] = l\r\nprint(*ans)", "# LUOGU_RID: 111386935\nfrom sys import stdin \nfrom collections import defaultdict \ninput = stdin.readline \n\ndef get() : \n return map(int,input().split())\n\nclass Node : \n def __init__(self, l, r, idx) : \n self.l = l \n self.r = r \n self.idx = idx\n def __lt__(self, other) : \n if self.r != other.r : \n return self.r < other.r \n elif self.r == other.r : \n return self.l < other.l \n\nn = int(input()) \nlst = [] \nans = [0] * (n) \n\nfor i in range(n) : \n a, b = get() \n lst.append(Node(a, b, i)) \n\nlst.sort() \nd = defaultdict(int) \n\nfor i in range(n) : \n l, r, idx = lst[i].l, lst[i].r, lst[i].idx \n\n for j in range(l, r + 1) : \n if d[j] == 0 : \n d[j] = 1 \n ans[idx] = j \n break \n\nfor i in range(n) : \n print(ans[i], end = ' ')\n", "n = int(input())\r\np = [list(map(int, input().split())) for i in range(n)]\r\np = list(enumerate(p))\r\np.sort(key=lambda x: (x[1][1], x[1][0]))\r\nans = [0] * n\r\nvis = set()\r\nfor index, (l, r) in p:\r\n while l in vis:\r\n l += 1\r\n vis.add(l)\r\n ans[index] = l\r\nfor x in ans:\r\n print(x)", "n = int(input())\r\narr = [0]*10000001\r\nans = [0]*100\r\na2=[]\r\nfor i in range(n):\r\n l,r = map(int,input().split())\r\n tmp = (r,l,i)\r\n a2.append(tmp)\r\na2.sort()\r\nfor i in range(n):\r\n m=a2[i]\r\n r=m[0]\r\n l=m[1]\r\n v=m[2]\r\n dif=r-l+1\r\n for j in range(dif):\r\n if(arr[l+j]==0):\r\n arr[l+j]=1\r\n ans[v]=l+j\r\n break\r\nans=ans[:n]\r\nprint(*ans)\r\n" ]

[ "s = input()\r\nx = int(input())\r\nif x > len(s):\r\n print('impossible')\r\nelif x < len(set(s)):\r\n print(0)\r\nelse:\r\n print(x - len(set(s)))", "ch=input()\r\nk=int(input())\r\nd={}\r\nfor e in ch:\r\n if e in d:\r\n d[e]+=1\r\n else:\r\n d[e]=1\r\nn=len(d)\r\nif n>=k:\r\n print(0)\r\nelse:\r\n s=0\r\n for e in d:\r\n if d[e]>1:\r\n s+=d[e]-1\r\n if n+s>=k:\r\n print(k-n)\r\n else:\r\n print('impossible')", "# encoding: utf-8\r\nstring = input().strip()\r\nk = int(input())\r\nprint('impossible' if len(string) < k else max(0, k - len(set(string))))\r\n", "k=input()\r\nn=int(input()) \r\nk1=[] \r\nif(len(k)<n):\r\n print(\"impossible\") \r\nelse:\r\n for i in k:\r\n if i not in k1:\r\n k1.append(i) \r\n print(max(0,n-len(k1)))\r\n", "s = input()\nl1=len(s)\nk = int(input())\ns1 = set(s)\nl=len(s1)\nif(k<=l):\n print(\"0\")\nelif(k>l and k<=l1):\n print(k-l)\nelse:\n print(\"impossible\")\n\n\t \t \t \t \t \t\t\t\t\t \t \t \t \t\t", "word = input()\nn = int(input())\n\nns = {}\n\n\nfor c in word:\n if not c in ns.keys():\n ns[c] = 1\n else:\n ns[c] += 1\n\n# d = max(0, n - len(ns))\n\n# foo = list(filter(lambda i: i > 0, map(lambda x: x-1, ns.values())))\n\nif len(word) >= n:\n print(max(0, n - len(ns)))\nelse:\n print(\"impossible\")", "a = input()\r\nb = int(input())\r\nprint('impossible' if len(a) < b else max(0, b - len(set(c for c in a))))", "s=input()\r\nn=len(s)\r\nk=int(input())\r\nif(n<k):\r\n print(\"impossible\")\r\nelse:\r\n print(max(0,k-len({*s})))\r\n \r\n", "\r\nstring = list(input())\r\ndiffernt_words = int(input()) \r\ndifset = set(string)\r\n\r\nif(differnt_words > len(string)):\r\n print(\"impossible\")\r\nelse:\r\n val = differnt_words - len(difset)\r\n if(val< 0 ):\r\n print(0)\r\n else:\r\n print(val)\r\n", "x = input()\nn = len(x)\nk = int(input())\nprint([max(0, k - len({ *x })), 'impossible'][n < k])\n \t\t \t\t\t\t \t \t \t \t\t \t \t \t", "#Diversity\r\n\r\ns=list(input())\r\nk=int(input())\r\nout=[]\r\ndiff=0\r\nif len(s)<k:\r\n print('impossible')\r\nelse:\r\n for i in range(len(s)): \r\n if not out:\r\n out.append(s[i])\r\n diff+=1\r\n #print(out,s[i])\r\n else:\r\n if s[i] not in out:\r\n \r\n out.append(s[i])\r\n diff+=1\r\n #print(out,s[i],diff)\r\n #print(out)\r\n print(max(0,k-diff)) ", "n=input()\r\nk=int(input())\r\nli=[]\r\nfor i in range(len(n)):\r\n li+=[n[i]]\r\nli=set(li)\r\nif len(n)<k:\r\n print(\"impossible\")\r\nelse:\r\n if k-len(li)>0:\r\n print(k-len(li))\r\n else:\r\n print(\"0\")\r\n", "s=input()\r\nk=int(input())\r\n\r\nss=set(s.strip())\r\n\r\nns=len(ss)\r\n\r\nif k>len(s):\r\n print(\"impossible\")\r\nelse:\r\n print(max(0,k-ns))\r\n\r\n", "s=input()\r\nn=int(input())\r\nset1=set(s)\r\nif len(s)==n:\r\n a=len(s)-len(set1)\r\n print(a)\r\nelif len(s)>n:\r\n z=n-len(set1)\r\n if z<0:\r\n print(\"0\")\r\n else:\r\n\r\n print(n-len(set1))\r\nelif len(s)<n:\r\n print(\"impossible\")", "s = input()\r\nk = int(input())\r\nif(k>len(s)):\r\n print('impossible')\r\nelse:\r\n x = len(set(s))\r\n if(k-x<0):\r\n print(0)\r\n else:\r\n print(k - x)", "import sys\n\ns = input()\nn = int(input())\n\ndic = {}\nfor i in s:\n if i in dic:\n dic[i] = dic[i] + 1\n else:\n dic[i] = 1\n\nif len(s) < n:\n print(\"impossible\")\nelse:\n print(max(0, n - len(dic)))\n", "import math\r\n\r\n\r\ndef main_function():\r\n s = input()\r\n k = int(input())\r\n is_paossible = True\r\n count = 0\r\n c = 0\r\n hash = [0 for i in range(200)]\r\n for i in s:\r\n hash[ord(i)] += 1\r\n for i in hash:\r\n if i > 0:\r\n c += 1\r\n if len(s) < k:\r\n print(\"impossible\")\r\n else:\r\n print(max(0, k - c))\r\n\r\n\r\n\r\n\r\n\r\n\r\nmain_function()", "# cook your dish here\r\ns = input()\r\nn = int(input())\r\nif n>len(s):\r\n print(\"impossible\")\r\nelse:\r\n a = list(set(s))\r\n if n-len(a)>=0:\r\n print(n - len(a))\r\n else:\r\n print(\"0\")", "b=input()\r\na=int(input())\r\nc=[]\r\nd=0\r\nif a>len(b):\r\n print(\"impossible\")\r\n exit()\r\nfor i in b:\r\n if i not in c:\r\n c+=i\r\n d+=1\r\nif d < a:\r\n print(a-d)\r\nelse:\r\n print(0)\n# Mon Jul 04 2022 07:49:36 GMT+0000 (Coordinated Universal Time)\n", "a=input().strip()\r\nn=int(input())\r\n\r\nif n>len(a):\r\n\tprint(\"impossible\")\r\nelse:\r\n\ts=list(set(a))\r\n\tif len(s)>=n:\r\n\t\tprint(\"0\")\r\n\telif len(s)<n:\r\n\t\tprint(n-len(s))", "s = input()\nk = int(input())\ns = list(s)\nuniq = set(s)\n\nif len(s) < k:\n print(\"impossible\")\nelse:\n print(max(k - len(uniq), 0))", "def action():\r\n a = input()\r\n k = int(input())\r\n if k>len(a):\r\n print('impossible')\r\n return\r\n x = []\r\n for i in a:\r\n x.append(i)\r\n x = set(x)\r\n if len(x)>=k:\r\n print(0)\r\n return\r\n print(k-len(x))\r\n \r\naction()", "s=input();n=int(input());t=set(s)\r\nprint(max(n-len(t),0)) if n-len(t)+len(t) <=len(s) else print('impossible')", "from collections import Counter\n\nif __name__ == \"__main__\":\n word = input().strip()\n k = int(input().strip())\n word_counter = Counter(word)\n unique_letters_cnt = len(word_counter)\n need = k - unique_letters_cnt\n if len(word) < k:\n print('impossible')\n elif need <= 0:\n print(0)\n else:\n print(need)\n\n", "r=input()\r\na=set(list(r))\r\nkol=int(input())\r\nif len(r)<kol:\r\n print('impossible')\r\nelse:\r\n print(max(0,kol-len(a)))", "string = input()\ntemp = []\ntemp2=[]\ncount = 0\nlength = int(input())\nfor i in string:\n temp.append(i)\nl = set(temp)\nlen_of_set = len(l)\nrequired = length-len_of_set\nif(length <= len_of_set):\n print(0)\nelif (length>len(string)):\n print(\"impossible\")\nelse:\n for i in string:\n if(i in temp2):\n count+=1\n temp2.remove(i)\n if(required == count):\n break\n temp2.append(i)\n print(min(count,25))", "s=input()\r\nk=int(input())\r\nm=list(set(s))\r\nr=len(s)-len(m)\r\np=k-len(m)\r\nif len(s)<k:\r\n print(\"impossible\")\r\nelse:\r\n if len(m)>=k:\r\n print(\"0\")\r\n elif r>=p:\r\n print(p)\r\n else:\r\n print(\"impossible\")\r\n", "def main():\r\n x = input()\r\n i = int(input())\r\n list1 = []\r\n if len(x) < i:\r\n print(\"impossible\")\r\n else:\r\n for k in x:\r\n if k not in list1:\r\n list1.append(k)\r\n if (i - len(list1)) <= 0:\r\n print(0)\r\n else:\r\n print(i - len(list1))\r\nmain()", "s=str(input().lower())\r\nk=int(input())\r\nl=[]\r\na=[]\r\nfor i in range(len(s)):\r\n if s[i] in s and s[i] not in a:\r\n a.append(s[i])\r\nb=k-len(a)\r\nif len(s)<k:\r\n print(\"impossible\")\r\nelif b>0:\r\n print(b)\r\nelse:\r\n print(0)", "c = input(); s = set(c); n = int(input())\r\nif len(c) < n:\r\n print('impossible')\r\nelif len(s) - n >= 0:\r\n print(0)\r\nelif n - len(s) >= 0:\r\n print(n - len(s))", "v=input();v4=int(input());v1=len(v);v2=set(v);v3=len(v2)\r\nif v1<v4:\r\n print(\"impossible\");exit()\r\nelse:\r\n if v4-v3>=0:print(abs(v4-v3))\r\n else:\r\n print(0)\r\n", "s = input()\r\nk = int(input())\r\nlenS = len(s)\r\nif k > lenS:\r\n print (\"impossible\")\r\nelse:\r\n # itt a fenti első feladat bármelyik megoldása használható\r\n # itt most azt a megoldást választom, amelyik kód tekintetében a leghosszabb,\r\n # de |s|-ben lineáris komplexitású:\r\n charset = [0]*26\r\n for c in s:\r\n charset[ord(c)-97] += 1\r\n nr_chars = 0\r\n for i in range(26):\r\n nr_chars += (charset[i] > 0)\r\n print (max(0,k-nr_chars))", "X = input()\r\nK = int(input())\r\nprint(\"impossible\" if K > len(X) else (0 if len(set(X)) >= K else K - len(set(X))))\r\n", "x = input()\r\ny = len(set(x))\r\nk = int(input())\r\nif (len(x)<k):\r\n print(\"impossible\")\r\nelse:\r\n print(max(k - y, 0))", "# coding=utf-8\nx=input()\r\nn=int(input())\r\nif len(x)<n:\r\n print('impossible')\r\nelse:\r\n y=set(x)\r\n print(max(0,n-len(y)))\r\n\n\t\t\t\t\t\t \t\t \t\t \t\t \t \t \t \t \t", "s=str(input())\r\nn=int(input())\r\nif len(s)<n:\r\n print('impossible')\r\nelse:\r\n s=set(s)\r\n if n<=len(s):\r\n print(0)\r\n else:\r\n print(n-len(s))", "s, k = input(), int(input())\r\nprint((max(k - len(set(s)), 0), \"impossible\")[len(s) < k])", "s = input()\r\nn = int(input())\r\nq = len(s)\r\nif q < n:\r\n print(\"impossible\")\r\nelse:\r\n d = set()\r\n for i in range(q):\r\n d.add(s[i])\r\n\r\n print(max(0, n - len(d)))", "str=input()\r\nk=int(input())\r\np=len(str)\r\na=[0 for i in range(26)]\r\nif p< k:\r\n print(\"impossible\")\r\nelse:\r\n for ch in str:\r\n a[ord(ch)-ord('a')] += 1\r\n for i in range(26):\r\n if a[i]!=0:\r\n k-=1\r\n if k<0: k=0\r\n print(k)\r\n", "s = input()\r\nc = int(input())\r\nif len(s) < c:\r\n print(\"impossible\")\r\n exit()\r\nprint(max(c - len(set(s)), 0))\r\n", "import sys\n\ndef find(c, leng, vector):\n for i in range(leng):\n if(vector[i]==c):\n return False\n \n return True\n\ns = str(input())\nn = int(input())\nlenc = len(s)\n\nif (lenc < n):\n print('impossible')\n sys.exit()\n\nfound = []\nfoundlen = 0\n\nfor i in range(lenc): \n c=s[i]\n\n if(find(c, foundlen, found)):\n found.append(c)\n foundlen=foundlen+1; \n\n if (foundlen == n):\n print(0)\n sys.exit()\n\nprint(n-foundlen)\n\n\n\n\t\t\t\t \t\t\t\t \t\t\t\t \t \t\t \t", "string = input()\r\nnumber = len(string)\r\nnum = int(input())\r\nstring = set(string)\r\ncount = len(string)\r\nif count > num:\r\n print(0)\r\nelif number < num or num - count < 0:\r\n print(\"impossible\")\r\nelif number >= num:\r\n print(num - count)\r\n", "s=list(input())\r\nk=int(input())\r\n\r\nl=len(s)\r\nif(k>l):\r\n print(\"impossible\")\r\nelse:\r\n a=[0 for i in range(26)]\r\n for i in range(l):\r\n a[ord(s[i])-97]=1\r\n t=sum(a)\r\n if(t>=k):\r\n print(0)\r\n else:\r\n print(k-t)\r\n\r\n \r\n", "s = input()\r\nk = int(input())\r\nif len(s) < k or k > 26:\r\n print(\"impossible\")\r\nelse:\r\n l = set()\r\n for ch in s:\r\n l.add(ch)\r\n a = k - len(l)\r\n if a < 0:\r\n a = 0\r\n print(a)\r\n", "s = input()\r\nk = int(input())\r\ncjn = set()\r\nchange = 0\r\nfor i in range(len(s)):\r\n if s[i] not in cjn:\r\n cjn.add(s[i])\r\n else:\r\n change += 1\r\nif k - len(cjn) < 0:\r\n print('0')\r\n exit()\r\nprint('{}'.format(k-len(cjn) if k - len(cjn) <= change else 'impossible'))", "# coding=utf-8\nx = input()\r\nk = int(input())\r\nif len(x) < k:\r\n print(\"impossible\")\r\nelse:\r\n y = set(x)\r\n print(max(0,k - len(y)))\n\t\t \t\t \t \t \t \t\t\t\t \t", "s=input()\r\nn=int(input())\r\nlens=len(s)\r\nif n>lens:\r\n print(\"impossible\")\r\nelse:\r\n l=[]\r\n l[::]=s\r\n l=list(set(l))\r\n lenl=len(l)\r\n if n<=lenl:\r\n print(0)\r\n else:\r\n print(n-lenl)\r\n \r\n", "s, k = input(), int(input())\r\nprint('impossible' if len(s) < k else max(0, k - len(set(s))))", "\r\nl = list(input())\r\nn = int(input())\r\nif n > len(l):\r\n\tprint('impossible')\r\nelse:\r\n\tprint(0 if len(set(l)) >= n else n - len(set(l)))", "s = input()\r\nk = int(input())\r\na = set(s)\r\nans = k - len(a)\r\nif ans + len(a) <= len(s):\r\n print(max(0, ans))\r\nelse:\r\n print(\"impossible\")\r\n", "s = list(str(input()))\r\nk = int(input())\r\nn = len(s)\r\nm = len(set(s))\r\nif k>n:\r\n print('impossible')\r\nelse:\r\n print(max(0,k-m))\r\n", "L=input()\r\nk=int(input())\r\nD=[]\r\nN=len(L)\r\nD.append(L[0])\r\nfor i in range (0,N):\r\n if L[i] not in D:\r\n D.append(L[i])\r\nM=len(D)\r\nif(N<k):\r\n print(\"impossible\")\r\nelif(M==k or M>k):\r\n print(\"0\")\r\nelif(M<k):\r\n S=k-M\r\n print(S)\r\n", "# coding=utf-8\ns=input()\r\nk=int(input())\r\nif len(s)<k:\r\n print('impossible')\r\nelse:\r\n a=set(s)\r\n print(max(0,k-len(a)))\n\t \t \t\t\t \t\t \t\t\t \t \t \t\t", "\r\nn=input()\r\nm=int(input())\r\nif m>len(n):\r\n print('impossible')\r\n exit()\r\na=set(n)\r\nz=(m-len(a))\r\nprint( z if z>=0 else 0)", "s=input()\n\nl=[0]*26\n\nfor i in s:\n l[ord(i)-97]+=1\n\nt=int(input())\nif t>len(s):\n print(\"impossible\")\n\nelse:\n if(t-(26-l.count(0))<0):\n print(0)\n else:\n print((t-(26-l.count(0))))\n", "b=input()\r\nn=int(input())\r\nif len(b)<n:\r\n print(\"impossible\")\r\nelse:\r\n b=set(b)\r\n if len(b)>=n:\r\n print(0)\r\n else:\r\n print(n-len(b))", "s = input()\r\nk = int(input())\r\nif k > len(s):\r\n print('impossible')\r\nelse:\r\n alph = 'abcdefghijklmnopqrstuvwxyz'\r\n d = {alph[i] : 0 for i in range(26)}\r\n for symb in s:\r\n d[symb] = 1\r\n t = 0\r\n for symb in alph:\r\n if d[symb] == 1:\r\n t += 1\r\n print(max(0, k - t))", "s=input()\r\nk=int(input())\r\nif len(set(s))>=k:print(0)\r\nelif len(s)>=k:print(k-len(set(s)))\r\nelse:print(\"impossible\")", "n=input()\r\ns=set(n)\r\nk=int(input())\r\nif len(n) <k:\r\n print(\"impossible\")\r\nelse:\r\n if len(s)<=k:\r\n print(k-len(s))\r\n else:\r\n print(\"0\")\r\n", "s = input()\r\nr = int(input())\r\nn = len(s)\r\nset1 = set(s)\r\nif n<r:\r\n print(\"impossible\")\r\nelse:\r\n print(max(0,r-len(set1)))", "inputString = input(\"\")\r\ninputVal = int(input())\r\nmodifyCount = 0\r\nnumDistinct = 0\r\nfound = {}\r\nfor char in inputString:\r\n if(char not in found):\r\n found[char] = 0\r\n numDistinct += 1\r\n else:\r\n modifyCount += 1\r\nif(numDistinct >= inputVal):\r\n print(\"0\")\r\nelif(numDistinct + modifyCount >= inputVal):\r\n print(inputVal - numDistinct)\r\nelse:\r\n print(\"impossible\")\r\n\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 A = list(input())\r\n m = int(input())\r\n s = set(A)\r\n if len(A) < m:\r\n print('impossible')\r\n else:\r\n n = len(s)\r\n if n >= m:\r\n print(0)\r\n else:\r\n print(m - n)\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "\r\ns = input()\r\nk = int(input())\r\nif len(s) < k:\r\n print('impossible')\r\nelse:\r\n count = {}\r\n for c in s:\r\n count[c] = count.get(c, 0) + 1\r\n x = len(count)\r\n print(k - x if x < k else 0)\r\n", "from collections import defaultdict\ns = input()\nk = int(input())\nd = defaultdict(int)\ncount = 0\naval = 0\n\nif len(s) < k:\n\tprint('impossible')\n\texit()\n\nfor c in s:\n\td[c] += 1\n\nfor key in d:\n\tif d[key] > 1:\n\t\taval += d[key] - 1\n\nif (len(s) - aval >= k):\n\tprint(0)\nelse:\n\tprint(abs(k - (len(s) - aval)))\n", "data = input()\r\nk = int(input())\r\norig = len(data)\r\nunique = len(set(data))\r\npossible = orig - unique\r\nif(k<=unique):\r\n\tprint(\"0\")\r\nelif(k-unique<=possible):\r\n\tprint(k-unique)\r\nelse:\r\n\tprint(\"impossible\")", "s = input().strip()\r\nk = int(input())\r\n\r\nif k > len(s):\r\n print(\"impossible\")\r\nelse:\r\n freq = [0] * 26\r\n for c in s:\r\n freq[ord(c) - ord('a')] += 1\r\n distinct_chars = sum([1 for f in freq if f > 0])\r\n if distinct_chars >= k:\r\n print(0)\r\n else:\r\n print(k - distinct_chars)\r\n", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\ns = list(input().rstrip())\r\nk = int(input())\r\nans = \"impossible\" if len(s) < k else max(k - len(set(s)), 0)\r\nprint(ans)", "s = input()\r\nk = int(input())\r\nm = len(set(list(s)))\r\not = k - m\r\nif ot < 0:\r\n ot = 0\r\nif k > len(s):\r\n ot = \"impossible\"\r\n \r\n\r\nprint(ot)\r\n#fwgfrwgkuwghfiruhewgirueguhergiqrbvgrgf\r\n#26\r\n", "s=list(input())\r\nss=set(s)\r\nn=int(input())\r\nif len(s) < n:\r\n print('impossible')\r\nelse:\r\n print(max(0,n-len(ss)))\r\n", "s = str(input())\nk = int(input())\n\ndef main():\n if k > len(s):\n print(\"impossible\")\n return\n\n u = len(set(list(s)))\n req = k - u\n if req < 0: req = 0\n print(req)\n\nmain()", "import collections\n\nstring = list(input())\nnum = int(input())\n\ncount = collections.Counter(string)\nif num <= len(count):\n\tprint (0)\n\n\nelif len(string) >= num:\n\tprint (num - len(count))\n\nelse:\n\tprint (\"impossible\")\n\n\n", "s = input()\r\nk = int(input())\r\n\r\nif len(s) < k:\r\n print('impossible')\r\nelse:\r\n n = len(set(s))\r\n if k > n:\r\n print(k-n)\r\n else:\r\n print('0')\r\n", "if __name__==\"__main__\":\r\n s=input()\r\n k=int(input())\r\n if(len(s)<k):\r\n print(\"impossible\")\r\n elif(len(set(s))<k):\r\n print(k-len(set(s)))\r\n else:\r\n print(0)", "import sys\r\ns=input()\r\nk=int(input())\r\nif k>len(s):\r\n print('impossible')\r\n sys.exit()\r\ndic={}\r\nfor i in s:\r\n if i in dic:\r\n dic[i]+=1\r\n else:\r\n dic[i]=1\r\nprint(max(0,k-len(dic)))", "s = input()\r\nn = int(input())\r\nD = {}\r\nif n <= len(s):\r\n for i in 'abcdefghijklmnopqrstuvwxyz':\r\n D[i] = 0\r\n for i in s:\r\n D[i] += 1\r\n ans = 0\r\n for i in 'abcdefghijklmnopqrstuvwxyz':\r\n if D[i] != 0:\r\n ans += 1\r\n if n >= ans:\r\n print(n - ans)\r\n else:\r\n print(0)\r\nelse:\r\n print('impossible')\r\n\r\n\r\n", "s = input()\r\nk = int(input())\r\nprint('impossible' if k > len(s) else max(0,k-len(set(s))))", "s = input()\r\nk = int(input())\r\nd = {}\r\nfor i in s:\r\n if i in d:\r\n d[i] += 1\r\n else:\r\n d[i] = 1\r\nif k > len(s):\r\n print('impossible')\r\nelif len(d) >= k:\r\n print(0)\r\nelse:\r\n print(k - len(d))", "from operator import itemgetter\r\n\r\n\r\nclass av_let:\r\n def __init__(self, a, b):\r\n '''\r\n\r\n :param a: int\r\n :param b: int\r\n '''\r\n self.let = a\r\n self.cnt = b\r\n\r\n def __getitem__(self, item):\r\n return self.__getattribute__(item)\r\n\r\n\r\nclass solver:\r\n @staticmethod\r\n def solve(st, k):\r\n '''\r\n\r\n :param st: str\r\n :param k: k\r\n :return:\r\n '''\r\n lt = set(st)\r\n ll = []\r\n for letter in lt:\r\n t = st.count(letter) - 1\r\n if t:\r\n ll.append(av_let(letter, t))\r\n ll.sort(key=itemgetter('cnt'), reverse=True)\r\n\r\n if len(st) < k:\r\n return \"impossible\"\r\n else:\r\n diff = k - len(lt)\r\n if diff <= 0:\r\n return 0\r\n else:\r\n answ = 0\r\n for lt in ll:\r\n diff -= lt.cnt\r\n answ += lt.cnt\r\n if diff <= 0:\r\n return answ+diff\r\n return \"impossible\"\r\n\r\n\r\nprint(solver.solve(input(), int(input())))", "A = 26\ns = input()\nk = int(input())\nm = set()\nfor p in range(len(s)):\n m.add(s[p])\nif k > len(s) or k > A:\n print(\"impossible\")\nelse:\n print((k - len(m)) if k > len(m) else 0)\n \t\t \t \t \t\t \t\t \t \t\t\t \t", "from sys import stdin\n\ninp = iter(stdin.read().split())\n\ns = next(inp)\nk = int(next(inp))\ncharset = set(s)\n\nif k > len(s):\n print(\"impossible\")\nelse:\n if k - len(charset) <= 0:\n print(0)\n else:\n print(k - len(charset))\n\t\t \t\t \t\t\t\t \t\t \t \t \t \t \t \t", "s=str(input().lower())\r\ns1=set(s)\r\nk=int(input())\r\nt=len(s)\r\nif t<k:\r\n print(\"impossible\")\r\nelse:\r\n if len(s1)<=k:\r\n print(k-len(s1))\r\n else:\r\n print(0)", "import sys\r\ns1=sys.stdin.readline().strip()\r\ny=sys.stdin.readline().strip()\r\ns=''.join(list(dict.fromkeys(s1)))\r\nprint(\"impossible\" if int(y) > len(s1) else int(y)-len(s[:int(y)]))", "s = input()\r\nn = int(input())\r\nif n > len(s):\r\n print('impossible')\r\nelse:\r\n m = [0 for i in range(len(s))]\r\n for i in range(len(s)):\r\n m[i] = s[i]\r\n k = [0 for i in range(26)]\r\n l = 0\r\n a = 'a'\r\n for i in range(len(m)):\r\n k[ord(m[i]) - ord(a)] = 1\r\n for i in k:\r\n l += i\r\n print(max(0, n - l))", "\nword = input()\nk = int(input())\nletters = {}\nfor l in word:\n letters[l] = None\nif len(word) < k:\n print('impossible')\nelif len(letters) >= k:\n print(0)\nelse:\n print(k-len(letters))\n", "l,k=list(input()),int(input(),10)\r\nprint(max(k-set(l).__len__(),0)if k<=l.__len__() else 'impossible')", "a=input()\r\nb=int(input())\r\nc=[]\r\nd=0\r\nif len(a)<b:\r\n print('impossible')\r\n exit()\r\nfor i in a:\r\n if i not in c:\r\n c+=i\r\n d+=1\r\nif d<b:\r\n print(b-d)\r\nelse:\r\n print(0)\n# Sun Jul 03 2022 08:54:13 GMT+0000 (Coordinated Universal Time)\n", "str, k = input(), int(input())\nunique = len(set(str))\n\nif len(str) < k:\n print(\"impossible\")\nelse:\n print(max(0, k - unique))", "s = input()\nk = int(input())\nl = len(s)\nif(l < k):\n\tprint('impossible')\nelse:\n\tarr = set(s)\n\tn = k - len(set(s))\n\tif(n > 0):\n\t\tprint(n)\n\telse:\n\t\tprint(0)", "s = input()\r\nn = int(input())\r\na = []\r\nfor i in range(len(s)):\r\n a.append(s[i])\r\nc = len(a)\r\na = set(a)\r\nif n>c:\r\n print(\"impossible\")\r\nelse:\r\n m = n - len(a)\r\n if m>0:\r\n print(m)\r\n else:\r\n print(0)\r\n\r\n\r\n", "s = input()\r\nk = int(input())\r\n\r\nk0 = len(set(s))\r\n\r\nif len(s) >= k:\r\n print(max(0, k - k0))\r\nelse:\r\n print('impossible')\r\n", "s = input()\r\nk = int(input())\r\nprint(\"impossible\" if len(s)<k else max(0,k - len(set(s))))", "# author: violist\n# created: 04.04.2022 18:13:06\n\nimport sys\ninput = sys.stdin.readline\n\ns = input()[:-1]\nk = int(input())\nif (k > len(s)):\n print(\"impossible\")\nelse:\n print(max(k - len(set(s)), 0))\n", "s, k = input(), int(input())\nss = set(s)\nif len(s) < k:\n print('impossible')\nelse:\n print(max(k - len(ss), 0))\n\n", "s, k = input(), int(input())\nres = max(0, k - len(set(s))) if k <= len(s) else \"impossible\"\nprint(res)\n", "kalimat=input()\r\nangka=int(input())\r\n\r\nif(len(kalimat)<angka):\r\n print(\"impossible\")\r\nelse:\r\n print(max(0,angka-len(set(kalimat))))", "from collections import Counter as c\r\n\r\ns = input()\r\nse = set(s)\r\nl_s = len(s)\r\nl_se = len(se)\r\nk = int(input())\r\n\r\nif l_se >= k:\r\n print(0)\r\nelif l_se < k:\r\n if l_s >= k:\r\n print(k-l_se)\r\n else:\r\n print(\"impossible\")\r\n \r\n", "s=input()\r\nn=len(s)\r\nx=int(input())\r\nif x>n:\r\n\tprint(\"impossible\")\r\nelse:\r\n\tk=len(set(s))\r\n\tprint(max(0,x-k))\r\n", "s = input()\r\nk = int(input())\r\nif k>len(s) or k>26:\r\n print(\"impossible\")\r\nelse:\r\n print(max(0,k-len(set(s))))\r\n", "s=input()\r\nk=int(input())\r\nn=len(s)\r\nif k>n:\r\n print(\"impossible\")\r\nelse:\r\n print(max(0,k-len(set(s))))", "s = [str(i) for i in input()]\r\nk = int(input())\r\nif len(s) < k:\r\n print('impossible')\r\n exit()\r\nprint(max(0, k-len(set(s))))", "string = input()\r\n\r\nk = int(input())\r\n\r\nif k > len(string) or k > 26:\r\n print (\"impossible\")\r\nelse:\r\n string2 = set(string)\r\n dist_letr = len(string2)\r\n if dist_letr >= k :\r\n print (0)\r\n else :\r\n print (k - dist_letr)", "s = input()\r\nk = int(input())\r\narr = []\r\nfor elem in s:\r\n arr.append(elem)\r\narr = set(arr)\r\nd = k - len(arr)\r\n\r\nif k > len(s):\r\n print('impossible')\r\nelse:\r\n print(max(d, 0))\r\n", "s = input()\r\nk = int(input())\r\nif len(s)<k:\r\n\tprint(\"impossible\")\r\nelse:\r\n\tlettersInString = [False]*26\r\n\tfor letter in s:\r\n\t\tlettersInString[ord(letter)-97] = True\r\n\td = 0\r\n\tfor item in lettersInString:\r\n\t\tif item: d += 1\r\n\tprint(max(0,k-d))", "import sys\n\nit = iter(sys.stdin.read().splitlines())\n\ns = next(it)\nn = int(next(it))\n\nd = set(s)\nm = n - len(d)\n\nif n > len(s):\n print(\"impossible\")\nelse:\n if m < 0:\n m = 0\n print(m)\n \n\t \t \t \t \t \t \t\t\t \t \t\t \t \t \t", "s = str(input())\r\nk = int(input())\r\nlist = []\r\nans = 0\r\nfor i in range (len(s)):\r\n if s[i] not in list:\r\n list.append(s[i])\r\n ans = (k - len(list) if k > len(list) else 0)\r\nprint(ans if len(s) >= (k) else \"impossible\")", "s = input()\nn = int(input())\nif n > len(s):\n print('impossible')\nelse:\n stuff = len(set(s))\n print(max(0, n - stuff))", "s = list(input())\r\nk = int(input())\r\nl1=len(s)\r\ns = set(s)\r\nl2=len(s)\r\nif(k>l1):\r\n print(\"impossible\")\r\nelif(k<=l2):\r\n print(0)\r\nelse:\r\n print(k-l2)\r\n \r\n ", "s=input()\r\na=set(s)\r\nn=int(input())\r\nif n>len(s): print('impossible')\r\nelif n<=len(a): print(0)\r\nelse:\r\n o=len(a)\r\n while o<n: o+=1\r\n if o!=n: print('impossible')\r\n else: print(o-len(a))", "string =input()\r\nn =int(input())\r\na =len(string)\r\nif a < n:\r\n\tprint (\"impossible\")\r\n\tquit()\r\narr =[0]*a\r\nfor i in range(a):\r\n\tastr =string[:i]\r\n\tif string[i] in astr:\r\n\t\tarr[i] =1\r\nb =arr.count(0)\r\nif n <= b:\r\n\tprint (\"0\")\r\n\tquit()\r\none =arr.count(1)\r\nif one < (n-b):\r\n\tprint (\"impossible\")\r\n\tquit()\r\nprint (n-b)", "s=input()\r\nk=int(input())\r\nse=set(s)\r\nneed=k-len(se)\r\nif need<=0:\r\n print(0)\r\nelif len(se)+need<=len(s):\r\n print(need)\r\nelse:\r\n print(\"impossible\")", "s = input()\r\nk = int(input())\r\narr = set(list(s))\r\n\r\nx = len(arr)\r\n\r\n\r\nif(x >= k):\r\n print(0)\r\nelse:\r\n k -= x\r\n rem = len(s) - x\r\n\r\n # print(k,rem)\r\n if k > rem:\r\n print(\"impossible\")\r\n else:\r\n print(k)\r\n\r\n\r\n\r\n", "a = input()\nk = int(input())\nif len(a) < k:\n print('impossible')\nelse:\n if len(set(a)) >= k:\n print(0)\n else:\n print(k - len(set(a)))\n", "a1=[0]*(26)\r\nd=0\r\ns = input()\r\nk = int(input())\r\nfor i in s:\r\n tmp=ord(i)-ord('a')\r\n if a1[tmp]==0:\r\n a1[tmp]=1\r\n else:\r\n d+=1\r\nif sum(a1)>=k:\r\n print(0)\r\nelif sum(a1)+d<k:\r\n print(\"impossible\")\r\nelse:\r\n print(k-sum(a1))\r\n\r\n\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\n\r\ns = input()\r\nk = int(input())\r\n\r\nif k > len(s):\r\n print(\"impossible\")\r\nelse:\r\n print(max(k- len(Counter(s)), 0))\r\n\r\n\r\n\r\n\r\n\r\n", "line = list(input())\r\nk = int(input())\r\n\r\ncomponents = list(set(line))\r\ncomp_len = len(components)\r\nif comp_len >= k:\r\n print(0)\r\nelse:\r\n useless = len(line) - comp_len\r\n if k - comp_len > useless:\r\n print('impossible')\r\n else:\r\n print(k - comp_len)\r\n", "#Codeforces Contest 844 Problem A\r\ns = input()\r\nk = int(input())\r\nd = dict()\r\ncount = 0\r\n\r\nfor l in s:\r\n if d.get(l,0)==0:\r\n count+=1\r\n d[l] = d.get(l,0) + 1\r\nif len(s) < k:\r\n print ('impossible')\r\nelif count >= k:\r\n print (0)\r\nelse:\r\n print (k-count)\r\n", "word = input()\r\nn = int(input())\r\nif len(word) < n:\r\n print(\"impossible\")\r\nelse:\r\n s = set(list(word))\r\n sLen = len(s)\r\n if len(s) >= n:\r\n print(0)\r\n else:\r\n print(n - len(s))", "# coding=utf-8\nx=input()\r\nn=int(input())\r\nif len(x)<n:\r\n print('impossible')\r\nelse:\r\n a=set(x)\r\n print(max(0,n-len(a)))\r\n\n\t\t\t\t\t \t \t\t \t\t\t \t \t\t\t\t\t\t \t", "x = input()\r\nk = int(input())\r\nn = len(x)\r\nif n<k:\r\n\tprint(\"impossible\")\r\nelse:\r\n\tprint(max(0,k-int(len(\"\".join(set(x))))))", "##n = int(input())\r\n##a = list(map(int, input().split()))\r\n##print(' '.join(map(str, res)))\r\n\r\ns = input()\r\nk = int(input())\r\n\r\nh = [0 for i in range(26)]\r\nreserved = 0\r\nfor x in s:\r\n p = ord(x)-ord('a')\r\n h[p] += 1\r\n if h[p] > 1:\r\n reserved += 1\r\ncnt = 0\r\nfor i in range(26):\r\n if h[i] > 0:\r\n cnt += 1\r\nif cnt >= k:\r\n print('0')\r\n exit(0)\r\nelse:\r\n need = k-cnt\r\n if reserved >= need:\r\n print(need)\r\n exit(0)\r\nprint('impossible')\r\n", "s = input()\nn = int(input())\nletters = []\nuniq_lets = []\n\nfor i in s:\n letters.append(i)\n\nfor i in letters:\n if i not in uniq_lets:\n uniq_lets.append(i)\n\n\nif n>len(letters):\n print(\"impossible\")\n\nelse:\n if n>=len(uniq_lets):\n print(n - len(uniq_lets))\n else:\n print(0)\n\n\n\n\n\t\t \t \t \t\t \t \t\t\t\t\t \t\t \t", "s = input()\r\nn = int(input())\r\na = []\r\nt = 0\r\nfor i in s:\r\n if i not in a:\r\n a.append(i)\r\n else:\r\n t += 1\r\nsiz = len(a)\r\nif siz >= n:\r\n print(0)\r\nelif n - siz <= t:\r\n print(n - siz)\r\nelse:\r\n print(\"impossible\")\r\n", "s = input()\nk = int(input())\nif k > len(s):\n print('impossible')\nelse:\n s = set(list(s))\n if k - len(s) > 0:\n print(k - len(s))\n else:\n print(0)\n", "s = input()\r\nk = int(input())\r\nif k > len(s):\r\n print(\"impossible\")\r\nelse:\r\n a = len(set(s))\r\n if a >= k:\r\n print(0)\r\n else:\r\n print(k - a)\r\n", "s = input ()\r\nn = int (input ())\r\nif (len (s) < n):\r\n\tprint (\"impossible\")\r\nelse :\r\n\ts1 = sorted (s)\r\n\ts = \"\".join (s1)\r\n\tcount = len (s)\r\n\tfor i in range (len (s) - 1):\r\n\t\tif (s[i] == s[i + 1]):\r\n\t\t\tcount -= 1\r\n\tprint (max (0, n - count))\r\n", "a = input()\r\nb = int(input())\r\nm = []\r\nif len(a) < b:\r\n print(\"impossible\")\r\nelse:\r\n for i in range(len(a)):\r\n if a[i] not in m :\r\n m.append(a[i])\r\n if b - len(m) < 0:\r\n print(0)\r\n else:\r\n print(b - len(m))\n# Sun Jul 03 2022 08:07:59 GMT+0000 (Coordinated Universal Time)\n", "s = input()\r\nk = int(input())\r\n\r\nif len(s) < k:\r\n print('impossible')\r\n exit()\r\n\r\nc = 0\r\na = set()\r\nfor i in s:\r\n if i not in a:\r\n c += 1\r\n a.add(i)\r\n\r\nprint(max(k - len(a), 0))\r\n", "s = input()\r\nk = int(input())\r\nif len(s)<k:\r\n\tprint(\"impossible\")\r\nelse:\r\n\td = len(set(s))\r\n\tprint(max(0,k-d))", "s = input().strip()\nn = int(input())\n\nif n > len(s):\n\tprint('impossible')\nelse:\n\n\tcounts = {}\n\ttotal = 0\n\tfor c in s:\n\t\tif c not in counts:\n\t\t\tcounts[c] = 0\n\t\tcounts[c]+=1\n\n\texcess = n - len(counts)\n\tif excess <= 0:\n\t\tprint('0')\n\telse:\n\t\tprint(excess)", "s = input()\nk = int(input())\n\nd={}\nfor i in range((ord('a')),(ord('z')+1)):\n d[chr(i)]=0\n\nfor i in range(len(s)):\n d[s[i]]+=1\n\ndiff=0\nsum_same=0\nfor key, value in d.items():\n if value >=1:\n diff+=1\n if value > 1:\n sum_same+=value-1\n#print(diff)\n#print(sum_same)\nif diff >= k:\n print(0)\nelif sum_same-(k - diff) < 0:\n print(\"impossible\")\nelse:\n print(k - diff)\n\n", "s = input()\r\nn = int(input())\r\nif len(s) < n:\r\n print(\"impossible\")\r\nelse:\r\n letters = set()\r\n for x in s:\r\n letters.add(x)\r\n print(max(0, n - len(letters)))", "s=input().rstrip()\r\nx=list(s)\r\nl=[]\r\nq=[]\r\nw=[]\r\nS=[]\r\nD=[]\r\nn=int(input())\r\nif n>len(x):\r\n print(\"impossible\")\r\nelse:\r\n for i in range(0,len(x)):\r\n if x[i] not in l:\r\n l.append(x[i])\r\n else:\r\n q.append(x[i])\r\n f=len(l)\r\n if f>=n:\r\n print(0)\r\n else:\r\n V=n-f\r\n if len(q)>=V:\r\n print(V)\r\n else:\r\n print(\"impossible\")\r\n", "n=input()\r\nn1=int(input())\r\nif(len(n)<n1):\r\n print('impossible')\r\nelse:\r\n s=set(n)\r\n v=n1-len(s)\r\n if(v<0):\r\n print('0')\r\n else:\r\n print(v)", "s = input()\r\nk = int(input())\r\nn = len(s)\r\nif n < k:\r\n print(\"impossible\")\r\nelse:\r\n d = len(set(s))\r\n if d >= k:\r\n print(0)\r\n else:\r\n print(k - d)", "s = input()\nda = len(set(s))\nn = int(input())\nif (len(s) < n):\n print(\"impossible\")\nelif (n <= da):\n print(0)\nelif (n > da):\n print(n - da)\n\n# Sat Jul 16 2022 08:48:15 GMT+0000 (Coordinated Universal Time)\n", "a = input()\r\nk = int(input())\r\na1 = set(a)\r\nif k>len(a):\r\n print('impossible')\r\nelif k <=len(a1):\r\n print(0)\r\nelse:\r\n print(k-len(a1))", "\r\ns = input()\r\nn = int(input())\r\nif n > len(s):\r\n print('impossible')\r\nelif len(set(s)) >= n:\r\n print(0)\r\nelse:\r\n print(n - len(set(s)))\r\n\r\n# CodeForcesian\r\n# ♥\r\n# اسکین\r\n", "s = input().strip()\nn = int(input())\ns = list(s)\nl = []\nfor i in s:\n if (i not in l):\n l.append(i)\nt = len(s) - len(l) ### so o trong\nif (len(l) > n):\n print(0)\nelif (n - t <= len(l)):\n print(n - len(l))\nelse:\n print(\"impossible\")\n", "s = input()\r\nn = int(input())\r\nls = len(s)\r\nif n > ls:\r\n print('impossible')\r\nelse:\r\n codarr = [0] * ls\r\n for i in range(ls):\r\n codarr[i] = ord(s[i])\r\n\r\n max_el = max(codarr)\r\n cntcod = [0] * (max_el + 1)\r\n for i in range(ls):\r\n cntcod[ord(s[i])] += 1\r\n cnt = 0\r\n for i in range(max_el + 1):\r\n if cntcod[i] > 0:\r\n cnt += 1\r\n res = n - cnt\r\n if res < 0:\r\n res = 0\r\n print(res)\n# Sun Jul 03 2022 17:37:28 GMT+0000 (Coordinated Universal Time)\n", "import sys\r\n\r\ninput = sys.stdin.readline\r\n\r\nseen = set()\r\nlens = 0\r\n\r\nfor letter in input().strip('\\n'):\r\n seen.add(letter)\r\n lens += 1\r\n\r\nn = int(input())\r\n\r\nif (n > lens):\r\n print(\"impossible\")\r\nelse:\r\n ans = n-len(seen)\r\n if (ans < 0):\r\n print(0)\r\n else:\r\n print(ans)", "s=input()\r\nk=int(input())\r\nl = len(set(s))\r\nif len(s) < k:\r\n print('impossible')\r\nelse:\r\n print(max(0,k-l))", "# coding=utf-8\r\nt=input().strip()\r\nn=int(input())\r\nif n>len(t):\r\n print('impossible')\r\nelse:\r\n k=len(set(t))\r\n if k>= n:\r\n print(0)\r\n else:\r\n print(n-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", "a = input()\nk = int(input())\nl = [0] * 26\nif len(a) < k or k > 26:\n print(\"impossible\")\nelse:\n for i in a:\n l[ord(i) - ord('a')] = 1\n if sum(l) >= k:\n print(0)\n else:\n print(k - sum(l))", "s = list(input())\nk = int(input())\nif len(s) >= k:\n s1 = list(set(s))\n if k - len(s1) > 0:\n print(k - len(s1))\n else:\n print(0)\nelse:\n print('impossible')", "str = input()\r\nk = int(input())\r\n\r\noccs = [0] * 26\r\n\r\nfor c in str:\r\n occs[ord(c) - ord('a')] += 1\r\n\r\narr = [x for x in sorted(occs) if x > 0]\r\n\r\nif k > len(str):\r\n print(\"impossible\")\r\nelif k == len(arr):\r\n print(0)\r\nelse:\r\n print(max(k - len(arr), 0))\r\n", "def main():\n S = input()\n K = int(input())\n\n char = set(S)\n l = len(char)\n if len(S) < K:\n ans = 'impossible'\n elif l >= K:\n ans = 0\n else:\n ans = K - l\n\n print(ans)\n\nmain()\n", "s = input()\nk = int(input())\n\nif len(s) < k:\n\tprint(\"impossible\")\nelse:\n\tfound = set(s)\n\tdiff = k - len(found)\n\tif diff < 0:\n\t\tprint(0)\n\telse:\n\t\tprint(k - len(found))", "s=list(input())\r\nn=int(input())\r\nif len(s)<n:\r\n print(\"impossible\")\r\nelse:\r\n ss=list(set(s))\r\n if n-len(ss)>0:\r\n print(n-len(ss))\r\n else:\r\n print(\"0\")\r\n", "s = list(str(input()))\r\nk = int(input())\r\nr = 0\r\npossible = True\r\nif len(s) < k:\r\n possible = False\r\nelse:\r\n r = k - len(set(s))\r\n r = 0 if r < 0 else r\r\nprint(r if possible else \"impossible\")\r\n", "s=list(input())\r\nn=int(input())\r\na=list(set(s))\r\nif(n<=len(s)):\r\n if(n-len(a)<0):\r\n print(0)\r\n else:\r\n print(n-len(a))\r\nelse:\r\n print(\"impossible\")\r\n", "\r\na=str(input())\r\nn=int(input())\r\nif len(a)<n:\r\n\tprint(\"impossible\")\r\nelse:\r\n\ta=set(a)\r\n\tprint(max(0,n-len(a)))", "# your code goes here\r\nst = input()\r\ns = set()\r\nfor ch in list(st):\r\n\ts.add(ch)\r\nn = len(s)\r\nm = int(input())\r\nl = len(st)\r\nif l < m:\r\n\tprint('impossible')\r\nelif n > m:\r\n\tprint('0')\r\nelse:\r\n\tprint(str(m - n))", "S = input()\nn = int(input())\nif n > len(S):\n print(\"impossible\")\nelse:\n se = set(S)\n l = len(se)\n if l < n:\n print(n-l)\n else:\n print(0)\n\t \t \t\t \t\t \t\t \t \t \t\t \t\t", "S, K = input(), int(input())\r\n\r\nconj = set(S)\r\ndiff = len(conj) \r\n\r\nif K > len(S):\r\n print(\"impossible\")\r\nelse:\r\n print(max(0, K - diff))", "a = input()\r\nc = int(input())\r\nb =\"\"\r\nfor i in a:\r\n if i not in b:\r\n b+=i\r\n else:\r\n pass\r\nif(len(b)>=c):\r\n print(0)\r\nelif(len(a)<c ):\r\n print(\"impossible\")\r\nelse:\r\n print(c-len(b))", "s = input()\r\nk = int(input())\r\nd = set(s)\r\n\r\nif len(d)<=k and k<=len(s):\r\n print(k-len(d))\r\nelif len(s)<k:\r\n print(\"impossible\")\r\nelse:\r\n print(0)", "a=input()\r\nb=int(input())\r\nc=''\r\nd=0\r\nif b>len(a):\r\n print('impossible')\r\nelse:\r\n for i in a:\r\n if i not in c:\r\n c+=i\r\n d+=1\r\n if d<b:\r\n print(b-d)\r\n else:\r\n print(0)", "import math\r\n\r\na = input().strip()\r\nsize = int(input().strip())\r\nb = {}\r\nif size>len(a):\r\n print(\"impossible\")\r\nelse:\r\n for letter in a:\r\n if letter not in b:\r\n b[letter]=0\r\n else:\r\n b[letter]+=1\r\n size-=len(b)\r\n if size>0:\r\n print(size)\r\n else:\r\n print(\"0\")\r\n", "string = input()\r\ncount = int(input())\r\nif len(string) < count:\r\n print('impossible')\r\nelse:\r\n letters = [False for i in range(26)]\r\n different = 0\r\n a = ord('a')\r\n for c in string:\r\n index = ord(c) - a\r\n if not letters[index]:\r\n letters[index] = True\r\n different += 1\r\n print(max(count - different, 0))\r\n", "def main():\r\n line = input()\r\n k = int(input())\r\n start_number_dif = len(set(line))\r\n if k > len(line):\r\n print(\"impossible\")\r\n elif k <= start_number_dif:\r\n print(\"0\")\r\n else:\r\n print(k - start_number_dif)\r\n\r\nif __name__ == \"__main__\":\r\n main()", "s = input()\nk = int(input())\n\nss = set()\n\nfor c in s:\n\tss.add(c)\n\nif k > len(s):\n\tprint('impossible')\n\texit()\n\nprint(max(0, k - len(ss)))", "s=input()\r\nk=int(input())\r\nif k>len(s):\r\n print('impossible')\r\nelse:\r\n l=[0 for i in range(26)]\r\n u=0\r\n for j in s:\r\n ind=ord(j)-97\r\n if l[ind]==0:\r\n u+=1\r\n l[ind]=1\r\n if u<k:\r\n print(k-u)\r\n else:\r\n print(0)", "def diversity (s,n):\r\n if len(s) < n :\r\n return \"impossible\"\r\n else:\r\n times = n-len(set(list(s)))\r\n if times <= 0:\r\n return 0\r\n else:\r\n return times\r\n\r\ns = input()\r\nn = int(input())\r\nprint (diversity(s,n))\r\n \r\n \r\n \r\n \r\n \r\n\r\n \r\n \r\n\r\n\r\n \r\n \r\n \r\n \r\n", "s=input()\r\nk=int(input())\r\nn=len(s)\r\nif k>n:exit(print('impossible'))\r\nprint(max(k-len(set(s)),0))", "def returnfreqandunm(s):\r\n freq = dict()\r\n num = 0 # Number of letters of frequency > 1\r\n for c in s:\r\n if c in freq:\r\n freq[c] += 1\r\n if freq[c] > 1: num += 1\r\n else: freq[c] = 1\r\n return freq,num\r\n\r\nfreq,num = returnfreqandunm(input())\r\nn = len(freq)\r\nk = int(input())\r\nif len(freq) >= k: print(0)\r\nelse:\r\n if 26 - n >= k-n and num >= k-n: print(k-n)\r\n else: print('impossible')\r\n ", "\r\ns = input()\r\nk = int(input())\r\nif len(s) < k:\r\n print('impossible')\r\nelse:\r\n x = len(set(s))\r\n print(k - x if x < k else 0)\r\n", "from collections import Counter as c\r\ns=input()\r\nk=int(input())\r\nx=list(s)\r\nif(k>len(x)): print(\"impossible\")\r\nelse:\r\n \r\n x1=c(x).keys()\r\n if((k-len(x1))<0):print(\"0\")\r\n else: print(k-len(x1))", "#!/usr/bin/python\r\n\r\nstring = input()\r\nK = int(input())\r\n\r\nif (K > len(string)):\r\n print(\"impossible\")\r\nelse:\r\n uniq = set(string)\r\n uniq_count = len(uniq)\r\n if (uniq_count > K):\r\n print(0)\r\n else:\r\n print(K - uniq_count)", "s = input()\r\nn = int(input())\r\na = set()\r\nif n > len(s):\r\n print('impossible')\r\nelse:\r\n for i in s:\r\n a.add(i)\r\n if n <= len(a):\r\n print(0)\r\n else:\r\n print(n - len(a))", "s, k = input(), int(input())\r\nprint(max(0, k - len(set(s))) if k <= len(s) else 'impossible')", "s = str(input())\r\nn = int(input())\r\nif len(s)<n:\r\n print(\"impossible\")\r\nelse:\r\n s = set(s)\r\n ans = n-len(s)\r\n if ans>0:\r\n print(ans)\r\n else:\r\n print(0)", "#-------------------------------------------------------------------------------\r\n# Name: module1\r\n# Purpose:\r\n#\r\n# Author: vayun\r\n#\r\n# Created: 05/06/2022\r\n# Copyright: (c) vayun 2022\r\n# Licence: <your licence>\r\n#-------------------------------------------------------------------------------\r\n\r\nimport sys\r\nimport math\r\n\r\n##def test(did_pass):\r\n## \"\"\" Print the result of a test. \"\"\"\r\n## linenum = sys._getframe(1).f_lineno # Get the caller's line number.\r\n## if did_pass:\r\n## msg = \"Test at line {0} ok.\".format(linenum)\r\n## else:\r\n## msg = (\"Test at line {0} FAILED.\".format(linenum))\r\n## print(msg)\r\n\r\ndef diversity(s, k):\r\n dict_s = {}\r\n for i in s:\r\n if i in dict_s.keys():\r\n dict_s[i] += 1\r\n else:\r\n dict_s[i] = 1\r\n numulett = len(dict_s.keys())\r\n if k > len(s):\r\n return -1\r\n if numulett >= k:\r\n return 0\r\n return k - numulett\r\n\r\ns = input()\r\nk = int(input())\r\ndiverse = diversity(s, k)\r\nif diverse == -1:\r\n print('impossible')\r\nelse:\r\n print(diverse)", "s = input()\r\nk = int(input())\r\nn = len(s)\r\n\r\ns = list(set(s))\r\nu = len(s)\r\n\r\nrem = n-u\r\nreq = k-u\r\n\r\nif(req<=0):\r\n print(0)\r\nelif(rem>=req):\r\n print(req)\r\nelse:\r\n print(\"impossible\")\r\n", "s=input()\r\nk=int(input())\r\nprint(\"impossible\" if k>len(s) else max(0,k-len(set(s))))", "s1 = input()\nn = int(input())\n\nif len(s1) < n:\n print(\"impossible\")\nelse:\n print(max(0, n - len(set(s1))))\n", "n=input()\r\nk=int(input())\r\ns=set(n) \r\ns=\"\".join(s)\r\nif k<=len(s):\r\n print(0) \r\nelif len(n)>=k:\r\n print(k-len(s))\r\nelse:\r\n print('impossible')\r\n", "s, k = input(), int(input())\nunique = len(set(s))\n\nif k > len(s):\n print(\"impossible\")\nelse:\n print(max(0, k - unique))\n", "s = input()\r\nn = int(input())\r\nuniq = set(s)\r\nif (len(s) < n):\r\n print (\"impossible\")\r\nelse:\r\n print (n - len(uniq) if n - len(uniq) > 0 else 0)\r\n", "s= input() \r\nk= int(input()) \r\nif k>len(s): \r\n print(\"impossible\\n\") \r\n\r\nelse : \r\n x=set(s) \r\n x=max( k-len(x),0) \r\n print(x) ", "import string\r\nal = list(string.ascii_lowercase)\r\ns = list(input())\r\nk = int(input())\r\nans = 0\r\ncur = 0\r\nif k > len(s):\r\n print(\"impossible\")\r\nelse:\r\n cnt = []\r\n already = []\r\n for i in s:\r\n if i not in already:\r\n cnt.append(s.count(i))\r\n already.append(i)\r\n cur = len(already)\r\n while cur < k:\r\n for index, i in enumerate(already):\r\n if cnt[index] > 1:\r\n cnt[index] -=1\r\n cur += 1\r\n ans += 1\r\n if cur >= k:\r\n break\r\n print(ans)", "s = input()\r\nk = int(input())\r\n\r\nn = len(s)\r\nun = len(set(s))\r\n\r\nif n < k:\r\n print('impossible')\r\n\r\nelif un >= k:\r\n print(0)\r\n\r\nelse:\r\n print(k - un)\r\n", "s = input()\r\nn = int(input())\r\nx = sorted(s)\r\nx1 = len(set(x))\r\nif(len(x)<n):\r\n print(\"impossible\")\r\nelif(x1>=n):\r\n print(\"0\")\r\nelse:\r\n print(n-x1)", "s = input()\nn = int(input())\ndef func(s):\n \n ff = set()\n for c in s:\n ff.add(c)\n if len(s)<n:\n print('impossible')\n else:\n w = len(ff)\n if w>=n:\n print(0)\n else:\n print(n-w)\nfunc(s)\n\n\n\t \t \t \t \t \t\t \t\t\t \t\t\t\t", "\ndef solve():\n str = input()\n k = int(input())\n ln = len(str)\n mp = dict()\n uniq = []\n for i in str:\n if i not in uniq:\n uniq.append(i)\n cnt = len(uniq)\n if(cnt>=k):\n print(0)\n elif (ln<k):\n print(\"impossible\")\n else:\n print(k-cnt)\n\n\nsolve()\n\n\n", "s = input()\nk = int(input())\n\nn = len(set(s))\n\nprint(\"impossible\" if k > len(s) else max(0, k-n))", "s, k = input(), int(input())\r\nd = set(s)\r\nif k > len(s):\r\n print('impossible')\r\nelif len(d) >= k:\r\n print(0)\r\nelse :\r\n print(k-len(d))", "s=str(input())\r\nk=int(input())\r\nl=[0 for i in range(26)]\r\na=0\r\nif k>len(s):\r\n print(\"impossible\")\r\n exit()\r\nfor c in s:\r\n if l[ord(c)-97]==0:\r\n l[ord(c)-97]=1\r\n a+=1\r\nif a<=k:\r\n print(k-a)\r\nelse:\r\n print(0)", "s=input()\r\nk=set(s)\r\n\r\nn=int(input())\r\n\r\nl= len(s)\r\nm=len(k)\r\nif(n>l):\r\n print(\"impossible\")\r\nelse:\r\n if m>=n:\r\n print(\"0\")\r\n else:\r\n print(n-m)\r\n\r\n", "s = input()\r\nk = int(input())\r\n\r\ndistinct = 0\r\nzyada = 0\r\n\r\nfor i in range(ord('a'), ord('z') + 1):\r\n \r\n x = s.count(chr(i))\r\n \r\n if x > 0:\r\n distinct += 1\r\n zyada += x - 1\r\n \r\nif zyada + distinct < k:\r\n print(\"impossible\")\r\nelse:\r\n print (max(0, k - distinct))", "s=input()\nk=int(input())\nprint('impossible' if len(s)<k else max(0,k-len(set(c for c in s))))\n", "s = input()\r\nk = int(input())\r\nif len(s) < k:\r\n print('impossible')\r\nelse:\r\n ss = set(s)\r\n l = k - len(ss)\r\n if l < 0:\r\n l = 0\r\n print(l)\r\n", "s = input()\r\nl1=len(s)\r\nk = int(input())\r\ns1 = set(s)\r\nl=len(s1)\r\nif(k<=l):\r\n print(\"0\")\r\nelif(k>l and k<=l1):\r\n print(k-l)\r\nelse:\r\n print(\"impossible\")\r\n", "from collections import Counter\r\nstring = input()\r\ncond_num = int(input())\r\nif len(string) < cond_num or cond_num > 26:\r\n print('impossible')\r\nelse:\r\n ans = max(cond_num - len(Counter(string)), 0)\r\n print(ans)\r\n\r\n", "s=input()\r\nn=int(input())\r\nif(n<=len(s)):\r\n print(max(0,n-len(set(s))))\r\nelse:\r\n print('impossible')", "def Diversity(s,k):\r\n\tif len(s)<k:\r\n\t\treturn \"impossible\"\r\n\r\n\tcharCnt = [0] * 26\r\n\tfor c in s:\r\n\t\tcharCnt[ord(c)-97]+=1\r\n\r\n\tnumberOfUniqueCharacters = 26 - charCnt.count(0)\r\n\tif(numberOfUniqueCharacters>=k):\r\n\t\treturn 0\r\n\r\n\treturn k - numberOfUniqueCharacters\r\n\r\ns = input()\r\nk = int(input())\r\n\r\nprint(Diversity(s,k))\r\n\t\t\r\n", "n = input()\r\nk = int(input())\r\nprint('impossible' if k > len(n) else max(0,k - len(set(n))))\r\n", "str = input()\nnum = input()\nnum = int(num)\n\nif len(str) < num:\n print('impossible')\nelse:\n seen = set()\n for char in str:\n seen.add(char)\n if num - len(seen) < 0:\n print(0)\n else:\n print(num - len(seen))\n\n", "s = input()\r\nk = int(input())\r\nn = 0\r\na = list()\r\nfor i in s:\r\n test = False\r\n for j in a:\r\n if i == j:\r\n test = True\r\n if not test:\r\n a.append(i)\r\nif len(s) < k:\r\n print('impossible')\r\nelse:\r\n print(max(k - len(a),0))\r\n", "x = input()\r\ns = len(set(list(x)))\r\nn = int(input())\r\n\r\nif len(x)<n:\r\n print ('impossible')\r\nelse :\r\n if s>=n:\r\n print(0)\r\n else:\r\n print(n-s)", "s = input()\r\nn = int(input())\r\n\r\nk = set(s)\r\nif len(s) - len(k) < n - len(k):\r\n print('impossible')\r\nelse:\r\n print(max(n - len(k), 0))", "s, k = list(input()), int(input())\nif k>26 or k>len(s): print('impossible')\nelse:\n\tif k - len(set(s)) < 0: print(0)\n\telse: print(k-len(set(s)))", "s = input()\r\nn = int(input())\r\nif len(s)<n:print(\"impossible\")\r\nelse:print(max(0,n-len(set(s))))", "a = input()\r\nb = int(input())\r\nif len(a) >= b and len(set(list(a))) < 26:\r\n if b - len(set(list(a))) > 0:\r\n print(b - len(set(list(a))))\r\n else:\r\n print(0)\r\nelse:\r\n if b <= len(set(list(a))):\r\n print(0)\r\n else:\r\n print(\"impossible\")\r\n\n# Sun Jul 03 2022 08:49:39 GMT+0000 (Coordinated Universal Time)\n", "string = \"abcdefghijklmnopqrstuvwxyz\"\r\n\r\ns = input()\r\nn = int(input())\r\nm_set = set()\r\nfor i in range(len(s)):\r\n m_set.add(s[i])\r\nif n > len(s):\r\n print(\"impossible\")\r\nelse:\r\n print(max(0, n - len(m_set)))", "string = input()\r\nk = int(input())\r\ncnt = [0] * 26\r\nfor i in string:\r\n x = ord(i) - 97\r\n cnt[x] += 1\r\nrs = 0\r\nfor i in range(26):\r\n rs += max(0, cnt[i] - 1)\r\nif len(string) - rs >= k:\r\n print(0)\r\nelse:\r\n if len(string) < k:\r\n print(\"impossible\")\r\n else:\r\n print(k - (len(string) - rs))", "string = input()\r\nletters = []\r\n\r\nfor char in string:\r\n if char not in letters:\r\n letters.append(char)\r\n\r\nn = int(input())\r\nif len(letters) >= n:\r\n print(0)\r\nelse:\r\n if n > len(string):\r\n print('impossible')\r\n else:\r\n print(n-len(letters))", "ip = input()\r\nn = int(input())\r\nif len(ip) < n:\r\n print(\"impossible\")\r\nelse:\r\n l1 = frozenset(ip)\r\n print(max(0, n - len(l1)))", "string = input()\nK = int(input())\n\norn_len = len(string)\nstring = ''.join(set(string))\ndiff = orn_len - len(string)\n\nif K <= orn_len:\n print(max(0,K - len(string)))\nelse:\n print('impossible')\n", "s=input()\na=int(input())\n\nunique = []\nfor char in s:\n if char not in unique:\n unique.append(char)\nu=len(unique)\n\nif len(s)<a:\n print(\"impossible\")\nelif a-u<0:\n print(0)\nelse:\n print(a-u)\n \t\t\t \t \t \t \t\t \t \t \t\t\t", "s, k = input(), int(input())\r\nprint(max(0, k - len(set(s))) if len(s) >= k else \"impossible\")", "\ndef run():\n str, k = input(), int(input())\n unique = len(set(str))\n\n if len(str) < k:\n print(\"impossible\")\n else:\n print(max(0, k - unique))\n\n return\n\n\nif __name__ == \"__main__\":\n run()", "s = input()\r\nk = int(input())\r\nif len(s) < k:\r\n print('impossible')\r\nelif len(set(s))>=k:\r\n print(0)\r\nelse:\r\n print(k-len(set(s)))\r\n", "st = input()\nk=int(input())\ns=set()\nfor i in st:\n s.add(i)\n\ndiff =len(st)-len(s)\nif k<len(s):\n print(0)\nelif len(s)+diff<k:\n print(\"impossible\") \nelse: \n print(min(diff,abs(k-len(s))))", "# 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\nstring = list(input())\r\nk = int(input())\r\nif len(string) < k:\r\n print(\"impossible\")\r\nelse:\r\n temp = list(dict.fromkeys(string))\r\n if len(temp) >= k:\r\n print(0)\r\n else:\r\n print(k - len(temp))\r\n", "s=input()\r\nn=int(input())\r\na=len(s)\r\nb=len(set(s))\r\n\r\nif n>a:\r\n print('impossible')\r\nelse:\r\n print(max(0,n-b))\r\n", "n = input()\r\nt = int(input())\r\ne = set(i for i in n)\r\n\r\nif len(n)<t:\r\n\tprint(\"impossible\")\r\n\r\nelif t<=len(e):\r\n\tprint(0)\r\nelse:\r\n\tprint(t-len(e))\r\n", "s=input()\r\nn = int(input())\r\n\r\nif len(s)<n :\r\n print( \"impossible\" )\r\n exit()\r\n\r\n\r\nans = 0\r\nif len(set(list(s)))<n:\r\n ans = (n-len(set(list(s))))\r\n\r\nprint(ans)", "import collections\n\ns = input()\nb = int(input())\n\nss = set(s)\nif len(s) < b:\n print(\"impossible\")\nelse:\n print(max(b - len(ss), 0))\n", "s=list(input())\r\ns1=len(s)\r\nn=int(input())\r\nr=list(set(s))\r\nr1=len(r)\r\nif(n>s1):\r\n\tprint('impossible')\r\nelse:\r\n\tk=n-r1\r\n\tif(k<0):\r\n\t\tk=0\r\n\tprint(k)", "#!/usr/bin/python3\r\n\r\n\r\ndef main():\r\n data = input()\r\n n = int(input())\r\n\r\n if n > len(data):\r\n return \"impossible\"\r\n \r\n uniq = len(set(data))\r\n if n <= uniq:\r\n return \"0\"\r\n else:\r\n return n-uniq\r\n\r\n\r\nif __name__ == \"__main__\": print(main())\r\n", "a = input()\nn = int(input())\ns = set(list(a))\nif len(s) >= n:\n print(0)\nelse:\n if n > 26 or n > len(a):\n print(\"impossible\")\n else:\n print(n-len(s))\n# Sun Jul 03 2022 08:20:11 GMT+0000 (Coordinated Universal Time)\n", "def solution():\r\n string = input()\r\n k = int(input())\r\n if k == 0 or k == 1:\r\n print(0)\r\n return\r\n \r\n if k > len(string):\r\n print('impossible')\r\n return\r\n \r\n dic = {}\r\n for i in range(len(string)):\r\n if dic.get(string[i]) == None:\r\n dic[string[i]] = 1\r\n else:\r\n dic[string[i]] += 1\r\n \r\n if len(dic.keys()) > k:\r\n print(0)\r\n else:\r\n print(k - len(dic.keys()))\r\n\r\nsolution()", "s = input()\r\nt = int(input())\r\n\r\nif len(s) < t:\r\n print(\"impossible\")\r\nelse:\r\n unique = len(set(s))\r\n if unique >= t:\r\n print(0)\r\n else:\r\n print(t-unique)", "s=input().strip()\r\nn=int(input())\r\na=set(s)\r\nif(len(a) > n):\r\n print(0)\r\nelif(len(s) < n):\r\n print(\"impossible\")\r\nelse:\r\n print(n-len(a))", "s = input().strip()\r\nk = int(input())\r\nif len(s) < k:\r\n print(\"impossible\")\r\nelse:\r\n s_set = set(map(str, list(s)))\r\n if len(s_set) >= k:\r\n print(0)\r\n else:\r\n print(k - len(s_set))\r\n", "s = str(input())\r\nst = set(s)\r\nn = int(input())\r\nif len(s) < n:\r\n print ('impossible')\r\nelse:\r\n print (max(0,n - len(st)))\r\n", "\r\nnum_inp=lambda: int(input())\r\narr_inp=lambda: list(map(int,input().split()))\r\nsp_inp=lambda: map(int,input().split())\r\nstr_inp=lambda:input()\r\ns = input()\r\nk = int(input())\r\nprint(\"impossible\" if k>len(s) else max(0,k-len(set(s))))\r\n", "def diversidade(palavra,inteiro):\n\tletras = []\n\tnumeros_exclusivos = 0\n\tnumeros_mudaveis = 0\n\tmudancas = 0\n\tpalavra = list(str(palavra))\n\tif inteiro > len(palavra):\n\t\treturn (\"impossible\")\n\tfor letra in palavra:\n\t\tif letra not in letras:\n\t\t\tletras.append(letra)\n\t\t\tnumeros_exclusivos += 1\n\t\telse:\n\t\t\tnumeros_mudaveis += 1\n\twhile numeros_exclusivos < inteiro:\n\t\tif numeros_mudaveis > 0:\t\n\t\t\tnumeros_mudaveis -= 1\n\t\t\tnumeros_exclusivos += 1\n\t\t\tmudancas += 1\n\t\telse:\n\t\t\treturn (\"impossible\")\n\treturn (mudancas)\nentrada = str(input())\nnumero = int(input())\nprint(diversidade(entrada, numero))\n# 1506719402725\n", "s = input()\r\na = list(s)\r\nn = int(input())\r\nset_s =set(s)\r\nif len(s) >= n:\r\n\t \tprint(max(0, n-len(set_s)))\r\nelse:\r\n\tprint(\"impossible\")", "s=input()\nk=int(input())\nl=len(s)\nt=len(set(s))\nif k>l:\n\tprint(\"impossible\")\nelse:\n\tif k<=t:\n\t\tprint(0)\n\telse:\n\t\tprint(k-t)", "s=input()\nk=int(input())\ncount=dict()\nd=\"qwertyuiopasdfghjklzxcvbnm\"\nif k>len(s):\n\tprint(\"impossible\")\nelse:\n\tfor i in d:\n\t\tcount[i]=True\n\tsm=0\n\tfor i in s:\n\t\tif count[i]:\n\t\t\tcount[i]=False\n\t\t\tsm+=1\n\tprint(max(0,k-sm))", "n = input()\nk = int(input())\ncou = 0\nh = [0 for i in range(26)]\nif len(n) < k:\n print('impossible')\nelse:\n for i in n:\n h[ord(i) - ord('a')] += 1\n for i in h:\n if i >= 1:\n cou += 1\n p = k - cou\n if p < 0:\n print(0)\n else:\n print(p)\n# Sun Jul 03 2022 15:06:53 GMT+0000 (Coordinated Universal Time)\n", "#from dust i have come, dust i will be\r\n\r\ns=input()\r\nk=int(input())\r\n\r\na=set(s)\r\n\r\nreq=k-len(a)\r\n\r\nif k>len(s):\r\n print(\"impossible\")\r\n\r\nelse:\r\n if req<0:\r\n req=0\r\n \r\n print(req)", "s,n = input(), int(input())\r\nprint(\"impossible\" if n > len(s) else max(0, n - len(set(s))))\r\n", "s=input()\r\nk=int(input())\r\nprint('impossible' if k>len(s) else max(0,k-len(set([i for i in s]))))", "\r\nstr1=input()\r\nk=int(input())\r\nif len(set(str1))>=k:\r\n print('0')\r\nelif k>len(str1):\r\n print('impossible')\r\nelse:\r\n print(k-len(set(str1)))\r\n" ]

[ "import sys\r\n\r\ndistancia_prima = [0] * (10**5 + 4)\r\n\r\ndef precompute_prime_distance():\r\n is_prime = [True] * (10**5 + 10)\r\n is_prime[0] = is_prime[1] = False\r\n for i in range(2, 10**5 + 4):\r\n if is_prime[i]:\r\n for multiplo in range(2 * i, 10**5 + 4, i):\r\n is_prime[multiplo] = False\r\n\r\n last_prime = None\r\n for i in range(10**5 + 3, -1, -1):\r\n if is_prime[i]:\r\n last_prime = i\r\n\r\n distancia_prima[i] = last_prime - i\r\n\r\ndef main():\r\n n_rows, n_cols = map(int, input().split())\r\n\r\n precompute_prime_distance()\r\n\r\n matriz = []\r\n for _ in range(n_rows):\r\n fila = list(map(int, input().split()))\r\n matriz.append([distancia_prima[elemento] for elemento in fila])\r\n\r\n suma_minima_filas = sys.maxsize\r\n for fila in matriz:\r\n suma_fila = sum(fila)\r\n suma_minima_filas = min(suma_minima_filas, suma_fila)\r\n\r\n suma_minima_columnas = sys.maxsize\r\n for columna in range(n_cols):\r\n suma_columna = sum(matriz[fila][columna] for fila in range(n_rows))\r\n suma_minima_columnas = min(suma_minima_columnas, suma_columna)\r\n\r\n print(min(suma_minima_filas, suma_minima_columnas))\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "n = 10 ** 5 + 60\r\nprime = [True] * (n + 1)\r\nprime[0] = prime[1] = False\r\nfor i in range(2, n + 1):\r\n if not prime[i]:\r\n continue\r\n for j in range(i * i, n + 1, i):\r\n prime[j] = False\r\nd = {}\r\nfor i in range(10 ** 5 + 1):\r\n j = i\r\n while prime[j] != True:\r\n j += 1\r\n d[i] = j - i\r\n\r\nn, m = map(int, input().split())\r\nb = [[0] * m for i in range(n)]\r\nfor i in range(n):\r\n a = list(map(int, input().split()))\r\n for j in range(m):\r\n b[i][j] = d[a[j]]\r\nans = 10 ** 18\r\nfor i in range(n):\r\n ans = min(sum(b[i]), ans)\r\nans = min(ans, min([sum(x) for x in zip(*b)]))\r\nprint(ans)", "import sys\r\n\r\ndistancia_primo = [0] * (10**5 + 4)\r\n\r\ndef cribaErastostenes():\r\n primo = [True] * (10**5 + 10)\r\n primo[0] = primo[1] = False\r\n for i in range(2, 10**5 + 4):\r\n if primo[i]:\r\n for multiplo in range(2 * i, 10**5 + 4, i):\r\n primo[multiplo] = False\r\n\r\n aux = None\r\n for i in range(10**5 + 3, -1, -1):\r\n if primo[i]:\r\n aux = i\r\n\r\n distancia_primo[i] = aux - i\r\n\r\n\r\nn_rows, n_cols = map(int, input().split())\r\n\r\ncribaErastostenes()\r\n\r\nmatriz = []\r\nfor _ in range(n_rows):\r\n fila = list(map(int, input().split()))\r\n matriz.append([distancia_primo[elemento] for elemento in fila])\r\n\r\nsuma_minima_filas = sys.maxsize\r\nfor fila in matriz:\r\n suma_fila = sum(fila)\r\n suma_minima_filas = min(suma_minima_filas, suma_fila)\r\n\r\nsuma_minima_columnas = sys.maxsize\r\nfor columna in range(n_cols):\r\n suma_columna = sum(matriz[fila][columna] for fila in range(n_rows))\r\n suma_minima_columnas = min(suma_minima_columnas, suma_columna)\r\n\r\nprint(min(suma_minima_filas, suma_minima_columnas))\r\n", "n,m=map(int,input().split())\r\nlimit=int(1e5+2)\r\nl=[1,1]+[0]*limit\r\nfor i in range(2,limit):\r\n if not l[i]:\r\n l[i*i::i]=[1]*((limit-i*i)//i+1)\r\nfor i in range(limit,-1,-1):\r\n l[i]*=l[i+1]+1\r\ns=[[l[j] for j in map(int,input().split())] for _ in ' '*n]\r\nprint(min(min(sum(i) for i in s),min(sum(i) for i in zip(*s))))", "line, column = map(int,input().split())\n\nmatriz =[[*map(int,input().split())] for _ in \" \"*line]\n\nvar = int(1e5+2)\n\nx = [1,1] + ([0]*var)\n\nfor i in range(2,var):\n x[i*i::i]= [1] * ((var-i*i)//i+1)\n\nfor j in range(var,-1,-1):\n x[j]*= x[j+1] + 1\n\nfor j in range(line):\n for l in range(column):\n matriz[j][l]=x[matriz[j][l]]\n\n\nprint(min(min(sum(valor) for valor in matriz),min(sum(valor) for valor in zip(*matriz))))\n\t \t\t \t \t \t\t\t\t \t\t\t \t \t \t", "matrix=[]\r\nn,m=map(int,input().split())\r\nfor _ in range(n):\r\n matrix.append(list(map(int,input().split())))\r\nprimes=[2]\r\nfor i in range(3,10**5+4,2):\r\n t=2\r\n flag=False\r\n while t**2<=i:\r\n if i%t==0:\r\n flag=True\r\n break\r\n t+=1\r\n if not flag:\r\n primes.append(i)\r\n#print(len(primes))\r\nfor i in range(n):\r\n for j in range(m):\r\n t=matrix[i][j]\r\n d,u=0,9593\r\n while d<u:\r\n mid=(d+u)//2\r\n if t>primes[mid]:\r\n d=mid+1\r\n else:\r\n u=mid\r\n matrix[i][j]=primes[d]-t\r\nres=10**10\r\nfor i in range(m):\r\n x=0\r\n for t in matrix:\r\n res=min(res,sum(t))\r\n x+=t[i]\r\n res=min(res,x)\r\nprint(res)\r\n", "import bisect\r\n\r\ns = int(2 * 1e5)\r\np = []\r\nprime = [True] * (s + 1)\r\nprime[0] = prime[1] = False\r\nfor i in range(2, s + 1):\r\n if not prime[i]:\r\n continue\r\n p.append(i)\r\n for j in range(i * i, s + 1, i):\r\n prime[j] = False\r\n\r\nn, m = map(int, input().split())\r\na = [list(map(int, input().split())) for i in range(n)]\r\n# for i in a:\r\n# print(i)\r\n# print(p)\r\nfor i in range(n):\r\n for j in range(m):\r\n s = bisect.bisect_left(p, a[i][j])\r\n if p[s] == a[i][j]:\r\n a[i][j] = 0\r\n continue\r\n s = bisect.bisect_right(p, a[i][j])\r\n a[i][j] = p[s] - a[i][j]\r\n# for i in a:\r\n# print(i)\r\nv1, v2 = 10 ** 18, 10 ** 18\r\nfor i in range(n):\r\n v1 = min(sum(a[i]), v1)\r\nfor i in range(m):\r\n suma = 0\r\n for j in range(n):\r\n suma += a[j][i]\r\n v2 = min(v2, suma)\r\nprint(min(v1, v2))\r\n" ]

[ "k = list(map(int,input().split()))\r\ns = str(input())\r\n\r\nsum = 0\r\n\r\nfor i in s:\r\n if i == \"1\":\r\n sum += k[0]\r\n elif i == \"2\":\r\n sum += k[1]\r\n elif i == \"3\":\r\n sum += k[2]\r\n elif i == \"4\":\r\n sum += k[3]\r\n\r\nprint(sum)\r\n", "sList = [int(x) for x in input().split()][:4]\r\ngame = input()\r\ncount = 0\r\nfor i in game:\r\n count += sList[int(i)-1]\r\n\r\n\r\nprint(count)\r\n\r\n", "n = list(map(int, input().strip().split()))\r\nm = input()\r\ns = 0\r\nfor i in range(len(m)):\r\n s += n[int(m[i])-1]\r\nprint(s)", "\r\na = []\r\na = [int(item) for item in input().split()] # fill the list with numbers\r\ns = input() # take the string\r\nx = len(s)\r\nresult = 0\r\nfor i in range(x):\r\n\r\n if s[i]=='1':\r\n result+=a[0]\r\n elif s[i]== '2' :\r\n result += a[1]\r\n elif s[i] == '3' :\r\n result += a[2]\r\n elif s[i] == '4' :\r\n result += a[3]\r\n\r\nprint (result)\r\n\r\n# problem_link : https://codeforces.com/contest/431/problem/A\r\n", "a = list(map(int, input().split()))\r\ns = input().strip()\r\nprint(sum(a[i] * s.count(str(i + 1)) for i in range(4)))", "a = list(map(int, input().split()))\r\n\r\ns = input()\r\n\r\ns = [int(c) for c in s]\r\n\r\nc = 0\r\n\r\nfor i in range(len(s)):\r\n\r\n c += a[s[i] - 1]\r\n\r\nprint(c)", "arr1 = input().split(' ')\r\narr = []\r\nfor s in arr1:\r\n arr.append(int(s))\r\nres = 0\r\nseq = input()\r\nfor c in seq:\r\n res += arr[int(c)-1]\r\nprint(res)", "list_of_calories=list(map(int,input().split()))\r\nthe_list=list(map(int,input()))\r\ncalories=0\r\nfor i in the_list:\r\n calories+=list_of_calories[i-1]\r\nprint(calories)", "x=list(map(int,input().split()))\r\na=input()\r\nc=0\r\nfor i in a:\r\n c+=x[int(i)-1]\r\nprint(c)", "num=list(map(int,input().split(\" \")))\r\ns=input()\r\nsum=0\r\nfor i in s:\r\n if i=='1':\r\n sum+=num[0]\r\n elif i=='2':\r\n sum+=num[1] \r\n elif i =='3':\r\n sum+=num[2]\r\n elif i== '4': \r\n sum+=num[3]\r\nprint(sum)", "a1, a2, a3, a4 = map(int, input().split())\ncalories = {}\ncalories[\"1\"] = a1\ncalories[\"2\"] = a2\ncalories[\"3\"] = a3\ncalories[\"4\"] = a4 \n\ntotal_calories = 0\ns = input()\nfor c in s:\n total_calories += calories[c]\nprint(total_calories)\n\n", "a1,a2,a3,a4 = map(int,input().split())\r\ns = input()\r\nc = 0\r\nfor i in s:\r\n if i == '1':\r\n c+=a1\r\n if i == '2':\r\n c+=a2\r\n if i == '3':\r\n c+=a3\r\n if i == '4':\r\n c+=a4\r\nprint(c)", "a=list(map(int,input().split()))\r\nappearnce= list(map(int,list(input())))\r\ncalories=0\r\nfor i in appearnce:\r\n calories +=a[i-1]\r\n \r\n \r\nprint(calories)", "a=[int(a)for a in input().split()]\r\nb=input()\r\nk=0\r\nfor i in range(len(b)):\r\n t=a[int(b[i])-1]\r\n k+=t\r\nprint(k)", "n=input().split()\r\nn2=list(map(int,input()))\r\ny=0\r\nfor x in n2:\r\n\tif x==1:y=y+int(n[0])\r\n\telif x==2:y=y+int(n[1])\r\n\telif x==3:y=y+int(n[2])\r\n\telif x==4:y=y+int(n[3])\r\nprint(y)", "a = list(map(int,input().split()))\ns = list(map(int,[*input()]))\nc = 0\nfor i in s:\n c = c + a[i-1]\nprint(c)", "columns = input().split(\" \")\r\nsquares=list(input())\r\ncalories =0\r\nfor square in squares :\r\n calories+= int(columns[int(square) - 1])\r\nprint(calories)", "def yzd_solution(a, b, c, d):\r\n str = [char for char in input()]\r\n calories = 0\r\n\r\n for char in str:\r\n calories += a if char == '1' else b if char == '2' else c if char == '3' else d\r\n \r\n print(calories)\r\n\r\na, b, c, d = map(int, input().split())\r\nyzd_solution(a, b, c, d)", "N=list(map(int,input().split()))\ns=input()\nsum=0\nfor c in s:\n idx=ord(c)-ord('1')\n sum+=N[idx]\nprint(sum)\n", "a=input().split(maxsplit=4)\r\nb=[]\r\nsumm=0\r\nfor i in a:\r\n b.append(int(i))\r\nn=str(input())\r\nfor i in n:\r\n if i == '1':\r\n summ+=b[0]\r\n if i == '2':\r\n summ+=b[1]\r\n if i == '3':\r\n summ+=b[2]\r\n if i == '4':\r\n summ+=b[3]\r\nprint(summ)", "x = [int(a) for a in input().split()]\r\ns = input()\r\ncnt = 0\r\nfor i in s:\r\n cnt += x[int(i)-1]\r\nprint(cnt)", "a1,a2,a3,a4=map(int,input().split())\r\ns=list(input())\r\nc=0\r\nb=0\r\nm=0\r\nd=0\r\nfor i in s:\r\n if i ==\"1\":\r\n c+=a1\r\n if i==\"2\":\r\n b+=a2\r\n if i==\"3\":\r\n m+=a3\r\n if i==\"4\":\r\n d+=a4\r\nprint(c+b+m+d)\r\n", "calories = [int(i) for i in input().split(\" \")]\r\nsquaresStrip=input()\r\ncaloriesNeeded=0\r\nfor i in squaresStrip:\r\n caloriesNeeded+=calories[int(i)-1]\r\nprint(caloriesNeeded)", "d=dict()\r\nd[1],d[2],d[3],d[4]=map(int,input().split())\r\ns=input()\r\nprint(sum([d[int(i)] for i in s]))", "a1, a2, a3, a4 = map(int, input().split())\r\ns = input()\r\ncount= 0\r\nfor i in s:\r\n if int(i) == 1: count += a1\r\n if int(i) == 2: count += a2\r\n if int(i) == 3: count += a3\r\n if int(i) == 4: count += a4\r\n \r\nprint(count)", "a=list(map(int,input().split()))\r\ns=input()\r\n\r\ncal=s.count('1')*a[0]+s.count('2')*a[1]+s.count('3')*a[2]+s.count('4')*a[3]\r\n\r\nprint(cal)\r\n", "cal=list(map(int, input().split()))\r\n\r\ndo_training=input() \r\ncount=0\r\nfor i in do_training:\r\n count+=cal[int(i)-1]\r\nprint((count)) \r\n \r\n", "a, b, c, d = map(int,input().split())\r\ns = input()\r\nsk = 0\r\ngar = len(s)\r\nfor i in range(0, gar):\r\n if s[i] == '1':\r\n sk = sk + a\r\n if s[i] == '2':\r\n sk = sk + b\r\n if s[i] == '3':\r\n sk = sk + c\r\n if s[i] == '4':\r\n sk = sk + d\r\nprint(sk)\r\n", "a,b,c,d=[int(i) for i in input().split()]\r\ns=input()\r\nsu=0\r\nfor i in s:\r\n if i=='1':\r\n su=su+a\r\n if i=='2':\r\n su=su+b\r\n if i=='3':\r\n su=su+c\r\n if i=='4':\r\n su=su+d\r\nprint(su)", "a,b,c,d = map(int, input().split())\r\nstr = input();\r\ns = list(str.strip(\" \"))\r\nans=0;\r\nfor i in range(len(s)):\r\n if(s[i]=='1'):\r\n ans=ans+a;\r\n elif(s[i]=='2'):\r\n ans+=b\r\n elif(s[i]=='3'):\r\n ans+=c\r\n elif(s[i]=='4'):\r\n ans+=d\r\nprint(ans)\r\n", "a=dict()\r\na['1'],a['2'],a['3'],a['4']=map(int,input().split())\r\ns=input()\r\nprint(sum(a[i] for i in s))\r\n", "a = list(map(int,input().split()))\r\ns = input()\r\ncalories = 0\r\nfor i in s:\r\n calories += a[int(i) - 1]\r\nprint(calories)", "a=list(map(int,input().split(' ')))\r\ns=input()\r\nres=0\r\nfor i in s:\r\n if i=='1':\r\n res+=a[0]\r\n elif i=='2':\r\n res+=a[1]\r\n elif i=='3':\r\n res+=a[2]\r\n else:\r\n res+=a[3]\r\nprint(res)", "l=[int(x) for x in input().split(\" \")]\r\nch=input( )\r\ngame=[]\r\nfor i in ch:\r\n game.append(int(i))\r\ns=0\r\nfor i in game:\r\n s=s+l[i-1]\r\nprint(s)\r\n \r\n", "calories=list(map(int,input().split()))\r\ngame=input()\r\nr1=0\r\nr2=0\r\nr3=0\r\nr4=0\r\nfor i in game:\r\n if i==\"1\":\r\n r1+=1\r\n elif i==\"2\":\r\n r2+=1\r\n elif i==\"3\":\r\n r3+=1\r\n elif i==\"4\":\r\n r4+=1\r\nanswer=r1*calories[0]+r2*calories[1]+r3*calories[2]+r4*calories[3]\r\nprint(answer)", "l=[int(i) for i in input().split()]\r\na=list(str(input()))\r\nans=0\r\nfor i in range(len(a)):\r\n ans+=l[int(a[i])-1]\r\nprint(ans)", "k,a,b=[],0,0\r\nx=input().split()\r\nfor i in x: k.append(int(i)) \r\nz=input()\r\nfor j in z:\r\n a=k[int(j)-1] \r\n b+=a\r\nprint(b)\r\n", "a,b,c,d= input().split()\r\nt = input()\r\nx=0\r\nfor i in t:\r\n if i=='1':\r\n x+=int(a)\r\n elif i =='2':\r\n x+=int(b)\r\n elif i=='3':\r\n x+=int(c)\r\n elif i=='4':\r\n x+=int(d)\r\n\r\nprint(x)", "list_of_calories, stribes = list(map(int, input().split(\" \"))), list(map(int, input()))\r\n\r\nresult = 0\r\n\r\nfor i in range(len(stribes)):\r\n result += list_of_calories[stribes[i] - 1]\r\n\r\nprint(result)", "n=[int(s) for s in input().split()]\r\n\r\na=str(input())\r\n\r\nsk=0\r\n\r\nfor i in range(len(a)):\r\n if a[i]==\"1\":\r\n sk+=n[0]\r\n if a[i]==\"2\":\r\n sk+=n[1]\r\n if a[i]==\"3\":\r\n sk+=n[2]\r\n if a[i]==\"4\":\r\n sk+=n[3]\r\nprint(sk)", "import sys\r\n\r\ndef task_solution():\r\n aaa = [int(x) for x in input().split()]\r\n strd = input()\r\n return sum(strd.count(str(i+1))*aaa[i] for i in range(len(aaa)))\r\n\r\n\r\n\r\n\r\nprint(task_solution())", "store = list(map(int,input().split()))\r\n\r\na = input()\r\nres = 0\r\nfor i in a:\r\n res += store[int(i)-1]\r\nprint(res)", "l=list(map(int,input().split()))\r\ns=str(input())\r\nadd=0\r\nfor i in s:\r\n if(i=='1'):\r\n add+=l[0]\r\n elif(i=='2'):\r\n add+=l[1]\r\n elif(i=='3'):\r\n add+=l[2]\r\n elif(i=='4'):\r\n add+=l[3]\r\nprint(add)", "calories = input().split()\ncalories_spent = 0\nfor current_strip in input():\n calories_spent += int(calories[int(current_strip) - 1])\nprint(calories_spent)\n", "mas = [int(el) for el in input().split()]\r\np = list(input())\r\ncount = 0\r\nfor i in range(len(p)):\r\n if p[i] == \"1\":\r\n count+=mas[0]\r\n elif p[i] == \"2\":\r\n count+=mas[1]\r\n elif p[i] == \"3\":\r\n count+=mas[2]\r\n else:\r\n count+=mas[3]\r\nprint(count)\r\n", "a=input()\r\nmylist=a.split()\r\n\r\nb=input()\r\nn=0\r\nfor i in b:\r\n if i == '1':\r\n n+=int(mylist[0])\r\n elif i == '2':\r\n n+=int(mylist[1])\r\n elif i== '3':\r\n n+=int(mylist[2])\r\n else:\r\n n+=int(mylist[3])\r\nprint(n)", "n=list(map(int,input().split(' ')))\r\nm=list(map(int,input()))\r\nsum=0\r\n# print(n[0])\r\nfor i in m:\r\n\t# print(n[i-1])\r\n\tsum=sum+n[i-1]\r\nprint(sum)\r\n", "a1, a2, a3, a4 = [int(x) for x in input().split()]\r\ns = input()\r\n\r\ncalories = 0\r\nfor char in s:\r\n if char == '1':\r\n calories += a1\r\n elif char == '2':\r\n calories += a2\r\n elif char == '3':\r\n calories += a3\r\n else:\r\n calories += a4\r\n\r\nprint(calories)", "a = list(map(int, input().split()))\n\nseq = str(input())\n\ntotal = 0\n\nfor i in seq:\n if i == '1':\n total += a[0]\n elif i == '2':\n total += a[1]\n elif i == '3':\n total += a[2]\n elif i == '4':\n total += a[3]\n\nprint(total)\n \t\t \t\t \t \t\t\t \t\t\t\t \t \t", "def solve():\r\n a = [int(x) for x in input().split()]\r\n s = input()\r\n b = 0\r\n\r\n for i in range(len(s)):\r\n c = int(s[i])\r\n b += a[c - 1]\r\n print(b)\r\n\r\nT = 1\r\n# T = int(input())\r\n\r\nfor _ in range(T):\r\n solve()\r\n", "x=input().split()\r\ny=input()\r\nn=0\r\nfor i in y:\r\n if i==\"1\":\r\n n+=int(x[0])\r\n elif i==\"2\":\r\n n+=int(x[1])\r\n elif i==\"3\":\r\n n+=int(x[2])\r\n elif i==\"4\":\r\n n+=int(x[3])\r\n \r\nprint(n)\r\n ", "a = [-1] + list(map(int, input().split()))\ns = input()\nans = 0\nfor c in s:\n ans += int(a[int(c)])\nprint(ans)", "g=input().split()\r\ns=input()\r\nc=0\r\nfor i in s:\r\n c+=int(g[int(i)-1])\r\nprint(c)", "c=0\r\na=list(map(int,input().split()))\r\ns=input()\r\nfor i in s:\r\n if i=='1':\r\n c+=a[0]\r\n elif i=='2':\r\n c+=a[1]\r\n elif i == '3':\r\n c+=a[2]\r\n elif i == '4':\r\n c+=a[3]\r\nprint(c)", "a = [0] * 5\r\na[1], a[2], a[3], a[4] = map(int, input().split())\r\nans = 0\r\nfor c in input():\r\n ans += a[ord(c) - ord(\"0\")]\r\nprint(ans)\r\n", "a1, a2, a3, a4 = map(int, input().split())\r\nd = {\"1\": a1, \"2\": a2, \"3\": a3, \"4\": a4}\r\nresult = 0\r\ns = input()\r\nfor c in s:\r\n result += d[c]\r\nprint(result)\r\n", "a=[int(x) for x in input().split()]\r\nb=input()\r\nd=0\r\nfor j in b:\r\n if j=='1':\r\n d+=a[0]\r\n elif j=='2':\r\n d+=a[1]\r\n elif j=='3':\r\n d+=a[2]\r\n else:\r\n d+=a[3]\r\nprint(d)", "n,m,o,p = map(int,input().split())\r\nnum = list(input())\r\nsum=0\r\nfor i in num:\r\n if i == \"1\":\r\n sum += n\r\n if i == \"2\":\r\n sum += m\r\n if i == \"3\":\r\n sum += o\r\n if i == \"4\":\r\n sum += p\r\nprint(sum)", "a,b,c,d=map(int,input().split())\r\ns=input()\r\nx=0\r\nfor i in s:\r\n if(int(i)==1):\r\n x=x+a\r\n if(int(i)==2):\r\n x=x+b\r\n if(int(i)==3):\r\n x=x+c\r\n if(int(i)==4):\r\n x=x+d\r\nprint(x)\r\n\r\n\r\n ", "#m = 1 5 3 2\r\n#w = 11221\r\n\r\nm=list(map(int,input().split()))\r\nw=input()\r\nc=0\r\nfor i in w:\r\n c+=m[int(i)-1]\r\nprint(c)\r\n\r\n ", "calarios = list(map(int , input().split()))\r\nnumber = input()\r\ncounter = 0 ;\r\nfor i in range(0 , len(number)):\r\n counter += calarios[int (number[i] )- 1]\r\nprint(counter)", "arr=[int (x) for x in input().split()]\r\nl=[0]*4\r\nn=input()\r\nfor i in n:\r\n l[int(i)-1]+=1\r\ns=0\r\nfor i in range (0,4):\r\n s+=l[i]*arr[i]\r\n\r\nprint(s)\r\n\r\n\r\n", "s=list()\r\ns=input().split()\r\np=input()\r\na=p.count('1')\r\nb=p.count('2')\r\nc=p.count('3')\r\nd=p.count('4')\r\nprint(a*int(s[0])+b*int(s[1])+c*int(s[2])+d*int(s[3]))", "a1, a2, a3, a4 = map(int, input().split())\r\ns = input()\r\nprint(s.count('1') * a1 + s.count('2') * a2 + s.count('3') * a3 + s.count('4') * a4)\r\n", "a1,a2,a3,a4=map(int,input().split())\r\nlst=input()\r\ncal=0\r\nfor i in range(len(lst)):\r\n if lst[i]==\"1\":\r\n cal+=a1\r\n elif lst[i]==\"2\":\r\n cal+=a2\r\n elif lst[i]==\"3\":\r\n cal+=a3\r\n else:\r\n cal+=a4\r\nprint(cal)", "vls = list(map(int, input().split()))\r\ns = input()\r\nr = 0\r\n\r\nfor v in s:\r\n x = int(v) - 1\r\n r += vls[x]\r\n\r\nprint(r)", "number_of_cal= [int(x) for x in input().split()]\r\ndef find_total_cal(n):\r\n s= input()\r\n res=0\r\n for sec in s:\r\n \r\n res+=n[int(sec)-1]\r\n return res\r\n\r\nprint(find_total_cal(number_of_cal))", "calories = [int(x) for x in input().split()]\nstrips = input()\n\ntotalCalories = 0\n\nfor strip in strips:\n\tif strip == '1':\n\t\ttotalCalories = totalCalories + calories[0]\n\telif strip == '2':\n\t\ttotalCalories = totalCalories + calories[1]\n\telif strip == '3':\n\t\ttotalCalories = totalCalories + calories[2]\n\telif strip == '4':\n\t\ttotalCalories = totalCalories + calories[3]\n\nprint(totalCalories)\n", "l=[int(i) for i in input().split()]\r\nn=input()\r\ncount=0\r\nfor i in n:\r\n count+=l[int(i)-1]\r\nprint(count)", "#Coder_1_neel\r\na = list(map(int,input().split()))\r\na.insert(0,0)\r\ns=0\r\nb=input()\r\nfor i in b:\r\n x=int(i)\r\n s+=a[x]\r\nprint(s) ", "*l, = map(int, input().split(' '))\r\ns = list(input())\r\nq = s.count('1') * l[0]\r\nq += s.count('2') * l[1]\r\nq += s.count('3') * l[2]\r\nq += s.count('4') * l[3]\r\nprint(q)\r\n", "n = list(map(int,input().split()))\r\nm = input()\r\nans = 0\r\nfor i in m:\r\n a = int(i)\r\n ans += n[a - 1]\r\nprint(ans) ", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Fri Jun 16 18:07:10 2023\r\n\r\n@author: RadmediX\r\n\"\"\"\r\n\r\nweights = [int(x) for x in input().strip().split()]\r\nmoves=input()\r\n\r\nresult=0\r\n\r\nfor i in moves:\r\n result+=weights[int(i)-1]\r\n \r\n \r\nprint(result)", "calories = list(map(int, input().split()))\r\ns = list(map(int, input()))\r\ntotal_calories = 0\r\nfor i in range(len(s)):\r\n if s[i] == 1:\r\n total_calories += calories[0]\r\n elif s[i] == 2:\r\n total_calories += calories[1]\r\n elif s[i] == 3:\r\n total_calories += calories[2]\r\n else:\r\n total_calories += calories[3]\r\nprint(total_calories)\r\n", "a=list(map(int,input().split()))\r\ns=list(input())\r\nans=0\r\nfor i in s :\r\n ans+=a[int(i)-1]\r\nprint(ans)\r\n\r\n\r\n", "l = list(map(int,input().strip().split()))\r\ns = input()\r\nk = 0\r\nfor i in s:\r\n if int(i) == 1:\r\n k+=l[0]\r\n elif int(i)== 2:\r\n k+=l[1]\r\n elif int(i) == 3:\r\n k+=l[2]\r\n else:\r\n k+=l[3]\r\nprint(k)\r\n ", "\r\na = list(map(int,input().split()))\r\n\r\n\r\np=input()\r\n\r\ncalory = p.count('1')*a[0]+p.count('2')*a[1]+p.count('3')*a[2]+p.count('4')*a[3]\r\n\r\nprint(calory)", "a, b, c, d = input().split()\n\nsomas = input()\n\nvalor = 0\n\nfor soma in somas:\n if int(soma) == 1:\n valor += int(a)\n if int(soma) == 2:\n valor += int(b)\n if int(soma) == 3:\n valor += int(c)\n if int(soma) == 4:\n valor += int(d)\n\nprint(valor)\n\n \t \t \t\t \t\t\t \t \t \t\t", "inp1 = list(map(int,input().split()))\r\nstr = input(\"\")\r\ncal = 0\r\n\r\nfor i in str:\r\n cal = cal + inp1[int(i)-1]\r\nprint(cal)\r\n \r\n ", "first , second , third , fourth = map(int,input().split(\" \"))\r\nresult = 0\r\nnumber = input()\r\nfor i in number:\r\n if i == \"1\":\r\n result += first\r\n if i == \"2\":\r\n result += second\r\n if i == \"3\":\r\n result += third\r\n if i == \"4\":\r\n result += fourth\r\n\r\nprint(result)", "# Link: https://codeforces.com/contest/431/problem/A\n\nstrips_values = list(map(int, input().split()))\ntouch_list = list(map(int, list(input())))\n\ncalories = 0\n\nfor touch in touch_list:\n calories += strips_values[touch - 1]\n\nprint(calories)\n", "d = dict(zip('1234', [int(i) for i in input().split()]))\n\ns = input()\n\nsum_ = 0\nfor l in s:\n sum_ += d[l]\n\nprint(sum_)", "a1, a2, a3, a4 = map(int, input().split())\r\ns = input()\r\n\r\ncnt = 0\r\n\r\nfor i in s:\r\n if int(i) == 1:\r\n cnt += a1\r\n elif int(i) == 2:\r\n cnt += a2\r\n elif int(i) == 3:\r\n cnt += a3\r\n elif int(i) == 4:\r\n cnt += a4\r\n\r\nprint(cnt)\r\n", "calories = list(map(int, input().split()))\r\nones = 0\r\nseconds = 0\r\nthirds = 0\r\nfours = 0\r\nlst = list(input())\r\nfor n in lst:\r\n if(n == '1'):\r\n ones += 1\r\n elif(n == '2'):\r\n seconds += 1\r\n elif(n == '3'):\r\n thirds += 1\r\n elif(n == '4'):\r\n fours += 1\r\noneSum = calories[0] * ones\r\ntwoSum = calories[1] * seconds\r\nthirdSum = calories[2] * thirds\r\nfourSum = calories[3] * fours\r\nprint(oneSum + twoSum + thirdSum + fourSum)", "n=list(map(int,input().split()))\r\ncount=0\r\ns=list(input())\r\n\r\nfor i in s:\r\n i=int(i)-1\r\n count+=n[i]\r\nprint(count)", "a1,a2,a3,a4 = map(int,input().split())\r\nwastes = {\"1\":a1, \"2\":a2, \"3\":a3, \"4\":a4}\r\nsqueue = input()\r\nans=0\r\nfor i in squeue:\r\n ans += wastes[i]\r\nprint(ans)", "a = list(map(int , input().split()))\r\n\r\nans = 0\r\nfor x in map(int, input()):\r\n ans += a[x-1]\r\n \r\nprint(ans)\r\n", "a,b,c,d=map(int,input().split())\r\ns=input()\r\nans=0\r\nfor i in range(len(s)):\r\n if s[i]==\"1\":\r\n ans+=a\r\n elif s[i]==\"2\":\r\n ans+=b \r\n elif s[i]==\"3\":\r\n ans+=c \r\n else:\r\n ans+=d\r\nprint(ans) ", "a = input()\r\na = a.split()\r\na = [int(x) for x in a]\r\nb = input()\r\nk = 0\r\nfor i in range(len(b)):\r\n if b[i] == '1':\r\n k += a[0]\r\n elif b[i] == '2':\r\n k += a[1]\r\n elif b[i] == '3':\r\n k += a[2]\r\n elif b[i] == '4':\r\n k += a[3]\r\nprint(k)", "# Author: José Rodolfo (jric2002)\r\na = list(map(int, input().split(\" \")))\r\ns = str(input())\r\nsize_s = len(s)\r\ntotal_calories = 0\r\nfor i in range(0, size_s):\r\n if (s[i] == '1'):\r\n total_calories += a[0]\r\n elif (s[i] == '2'):\r\n total_calories += a[1]\r\n elif (s[i] == '3'):\r\n total_calories += a[2]\r\n else:\r\n total_calories += a[3]\r\nprint(total_calories)", "# https://codeforces.com/problemset/problem/431/A\r\n\r\ndef calculate_cost(a1: int, a2: int, a3: int, a4: int, s: str) -> int:\r\n count = 0\r\n for i in s:\r\n if i == '1':\r\n count += a1\r\n elif i == '2':\r\n count += a2\r\n elif i == '3':\r\n count += a3\r\n else:\r\n count += a4\r\n return count\r\n\r\na1, a2, a3, a4 = map(int, input().split())\r\ns = input()\r\nprint(calculate_cost(a1, a2, a3, a4, s))\r\n\r\n", "l1=[]\r\nl1.append(input().split())\r\nk=input()\r\na=0\r\nb=0\r\nc=0\r\nd=0\r\nfor i in range(len(k)):\r\n if k[i]=='1':\r\n\r\n a=a+1\r\n\r\n if k[i] == '2':\r\n b=b+1\r\n if k[i] == '3':\r\n c=c+1\r\n if k[i] == '4':\r\n d=d+1\r\n\r\nprint(a*int(l1[0][0])+b*int(l1[0][1])+c*int(l1[0][2])+d*int(l1[0][3]))", "a1,a2,a3,a4=map(int,input().split())\r\ns=input()\r\nprint(s.count('1')*a1+s.count('2')*a2+s.count('3')*a3+s.count('4')*a4)\r\n", "a=list(map(int,input().split()))\r\ns=input()\r\nans=0\r\nfor i in s :\r\n u=(ord(i)-ord('0'))\r\n ans+=a[u-1]\r\nprint(ans)", "a=list(map(int,input().split()))\r\ne=input()\r\nf=0\r\nfor i in e:\r\n i=int(i)\r\n f=f+a[i-1]\r\nprint(f)", "a1, a2, a3, a4 = map(int, input().split(' '))\r\ns = input()\r\ns1 = s.count('1')\r\ns2 = s.count('2')\r\ns3 = s.count('3')\r\ns4 = s.count('4')\r\nprint(s1 * a1 + s2 * a2 + s3 * a3 + s4 * a4)\r\n", "# I'm The King Of Pirates\r\nimport sys\r\ninput = sys.stdin.readline\r\n \r\na1,a2,a3,a4 = map(int,input().split())\r\nString = input()\r\nc = 0\r\nfor i in String:\r\n if i == '1':\r\n c+=a1\r\n elif i == '2':\r\n c+=a2\r\n elif i == '3':\r\n c+=a3\r\n elif i == '4':\r\n c+=a4\r\nprint(c)", "a=[0,*map(int,input().split())]\r\nprint(sum(a[int(x)]for x in input()))", "# Wadea #\r\nm = input().strip().split()\r\nlst = []\r\nlst += m\r\nlst1 = []\r\n\r\nr = 0\r\nfor i in lst:\r\n r = int(i)\r\n lst1.append(r)\r\n\r\ncalories = 0\r\nstring = str(input())\r\nfor s in string:\r\n if s == \"1\":\r\n calories += lst1[0]\r\n elif s == \"2\":\r\n calories += lst1[1]\r\n elif s == \"3\":\r\n calories += lst1[2]\r\n elif s == \"4\":\r\n calories += lst1[3]\r\nprint(calories)\r\n", "calories = [int(x) for x in input().split()]\r\nprint(sum(calories[int(x)-1] for x in input()))", "import sys\r\ninput = sys.stdin.readline\r\n\r\n############ ---- Input Functions ---- ############\r\ndef inp(): # one integer input\r\n return(int(input()))\r\ndef inlt(): # list input\r\n return(list(map(int,input().split())))\r\ndef insr(): # string input\r\n s = input()\r\n return(list(s[:len(s) - 1]))\r\ndef invr(): # muliple integer variables input\r\n return(map(int,input().split()))\r\n\r\nline_1 = inlt()\r\nline_2 = insr()\r\ncalories = 0\r\n\r\nfor i in range(len(line_2)):\r\n if line_2[i] == \"1\":\r\n calories += line_1[0]\r\n\r\n if line_2[i] == \"2\":\r\n calories += line_1[1]\r\n\r\n if line_2[i] == \"3\":\r\n calories += line_1[2]\r\n\r\n if line_2[i] == \"4\":\r\n calories += line_1[3]\r\n\r\nprint(calories)", "s = [int(x) for x in input().split()]\r\np = input()\r\nc = 0\r\nfor i in p:\r\n c+=s[int(i)-1]\r\nprint(c)\r\n", "a,b,c,d=list(map(int,input().split()))\r\ns=0\r\nfor i in input():\r\n if i=='1':\r\n s+=a\r\n elif i=='2':\r\n s+=b\r\n elif i=='3':\r\n s+=c\r\n else:\r\n s+=d\r\nprint(s)", "s=list(map(int,input().split()))\r\nmove=list(map(int,input()))\r\nsum_=0\r\nfor i in move:\r\n sum_+=s[i-1] \r\nprint(sum_)", "a = list(map(int, input().split()))\r\ns = input()\r\nans = 0\r\nfor i in range(0, len(s)):\r\n ans += a[int(s[i])-1]\r\nprint(ans)\r\n", "lst = list(map(int, input().split()))\r\ns = input()\r\nsum1 = 0\r\nfor i in range(len(s)):\r\n d = int(s[i])\r\n sum1 += lst[d - 1]\r\n\r\nprint(sum1)", "a = list(map(int, input().split(' ')))\ns = input()\n\ncalories = 0\n\nfor char in s:\n calories += a[int(char) - 1]\n\nprint(calories)\n", "#!/usr/bin/python3\r\n# Leo una cadena con input. La separo por espacios con split\r\n# Con map, aplico a cada elemento la funcion int para\r\n# convertitlo a entero\r\n# En este caso, ademas aplico list para convertirlo en lista\r\na1, a2, a3, a4 = map(int, input().split(\" \"))\r\n\r\n#Hago un diccionario y mapeo a cada caracter (\"1\", \"2\", etc)\r\n#Cuantas caloras gasta.\r\ndiccionarioGasto={}\r\ndiccionarioGasto[\"1\"]=a1\r\ndiccionarioGasto[\"2\"]=a2\r\ndiccionarioGasto[\"3\"]=a3\r\ndiccionarioGasto[\"4\"]=a4\r\n#Leo una cadena con los movimientos\r\nmovimientos=input()\r\n\r\nconsumido=0\r\nfor i in range(len(movimientos)):\r\n consumido=consumido+diccionarioGasto[movimientos[i]]\r\nprint(consumido)", "a = list(map(int,input().split()))\r\ns = list(list(map(int,list(input()))))\r\n\r\nres = 0\r\nfor i in s:\r\n res += a[i-1]\r\n \r\nprint(res)\r\n", "calPerOne=input().split()\r\nnumClick=input()\r\nN1=0\r\nN2=0\r\nN3=0\r\nN4=0\r\n\r\nfor curr in numClick :\r\n if curr == \"1\":\r\n N1+=1\r\n elif curr == \"2\":\r\n N2+=1\r\n elif curr == \"3\":\r\n N3+=1\r\n else: \r\n N4+=1 \r\n\r\noutput=(int(calPerOne[0])*N1)+(int(calPerOne[1])*N2)+(int(calPerOne[2])*N3)+(int(calPerOne[3])*N4)\r\nprint(output)\r\n", "a1, a2, a3, a4 = map(int, input().split())\r\n\r\ns = input()\r\n\r\ncalor = 0\r\n\r\nfor i in s:\r\n\r\n if i == '1':\r\n calor += a1\r\n elif i == '2':\r\n calor += a2\r\n elif i == '3':\r\n calor += a3\r\n else:\r\n calor += a4\r\n\r\n\r\nprint(calor)", "f, se, t, fo = map(int, input().split())\r\ns = [int(i) for i in input()]\r\nprint(s.count(1) * f + s.count(2) * se + s.count(3) * t + s.count(4) * fo)", "l = list(map(int, input().split(\" \")))\ns = input()\nans = 0\nfor c in s:\n i = int(c)\n ans += l[i-1]\nprint (ans)", "a=input()\r\nb=input()\r\na=a.split()\r\na=list(map(int, a))\r\nprint(b.count('1')*a[0]+b.count('2')*a[1]+b.count('3')*a[2]+b.count('4')*a[3])", "a,b,c,d=map(int,input().split())\r\ns=input()\r\ns1=0\r\ns2=0\r\ns3=0\r\ns4=0\r\nfor i in range (0,len(s)):\r\n if s[i]=='1':\r\n \r\n s1=s1+1;\r\n elif s[i]=='2':\r\n s2=s2+1;\r\n elif s[i]=='3':\r\n s3=s3+1;\r\n else:\r\n s4=s4+1;\r\nprint(a*s1+b*s2+c*s3+d*s4)", "a1, a2, a3, a4 = [int(x) for x in input().split()]\r\ncount_1 = 0\r\ncount_2 = 0\r\ncount_3 = 0\r\ncount_4 = 0\r\ns = input()\r\nfor i in s:\r\n if i == '1':\r\n count_1 += 1\r\n elif i == '2':\r\n count_2 += 1\r\n elif i == '3':\r\n count_3 += 1\r\n else:\r\n count_4 += 1\r\nprint((count_1 * a1) + (count_2 * a2) + (count_3 * a3) + (count_4 * a4))", "l = list(map(int,input().split()))\r\ns = input()\r\n\r\nsumm = 0 \r\n\r\nfor i in range(len(s)):\r\n a = s[i]\r\n a = int(a)\r\n summ= summ + l[a-1]\r\n \r\nprint(summ)\r\n \r\n ", "# Input the calorie values for each strip\r\na = list(map(int, input().split()))\r\n\r\n# Input the game string\r\ns = input()\r\n\r\n# Initialize a variable to store the total calories\r\ntotal_calories = 0\r\n\r\n# Iterate through the string and calculate calories\r\nfor char in s:\r\n strip = int(char) - 1 # Adjust for 0-based indexing\r\n total_calories += a[strip]\r\n\r\n# Output the total calories wasted\r\nprint(total_calories)\r\n", "a=list(map(int,input().split()))\r\n\r\ns=list(map(int,input()))\r\n\r\ncal=0\r\n\r\nfor i in range(0,len(s)):\r\n cal+=a[s[i]-1]\r\n\r\nprint(cal)\r\n\r\n \r\n", "cals = [int(x) for x in input().split(\" \")]\r\nindices = [int(x) for x in input()]\r\n\r\nsumm = 0\r\nfor i in indices:\r\n summ += cals[i - 1]\r\nprint(summ)", "s=input().split()\r\na1=int(s[0])\r\na2=int(s[1])\r\na3=int(s[2])\r\na4=int(s[3])\r\nt=input()\r\nsum=0\r\nfor i in range (len(t)):\r\n sum+=(int(s[int(t[i])-1]))\r\nprint(sum)", "a1,a2,a3,a4=input().split()\r\ns=input()\r\nsum=0\r\n\r\nfor i in range (len(s)):\r\n if s[i] == \"1\":\r\n sum = sum + int(a1)\r\n if s[i] == \"2\":\r\n sum = sum + int(a2)\r\n if s[i] == \"3\":\r\n sum = sum + int(a3)\r\n if s[i] == \"4\":\r\n sum = sum + int(a4)\r\n\r\nprint(sum)", "numbers = input()\ns = input()\n\nnumbers = list(numbers.split(\" \"))\ns = list(s)\n\nsum = 0\nfor i in s:\n i = int(i)\n i -= 1\n sum += int(numbers[i])\nprint(sum)", "a=[int(n)for n in input().split()]\r\ncalories_loses=input()\r\ntotal_calories=0\r\nfor x in calories_loses:\r\n x=int(x)\r\n if x==1:\r\n total_calories+=a[0]\r\n elif x==2:\r\n total_calories+=a[1]\r\n elif x==3:\r\n total_calories+=a[2]\r\n elif x==4:\r\n total_calories+=a[3]\r\nprint(total_calories)", "a_list = list(map(int, input().split()))\r\n\r\ns = list(input())\r\n\r\ntotal = 0\r\n\r\nfor i in range(len(s)):\r\n total += a_list[int(s[int(i)])-1]\r\n \r\nprint(total)", "# LUOGU_RID: 135338164\nlis = map(int, input().split())\r\ndic = {}\r\nfor i, e in enumerate(lis):\r\n dic[str(i + 1)] = e\r\nprint(sum([dic[e] for e in input()]))\r\n", "inp=[int(i) for i in input().split()]\na1,a2,a3,a4=inp[0],inp[1],inp[2],inp[3]\nb1,b2,b3,b4=0,0,0,0\nfor i in input():\n b1+=(int(i)==1);b2+=(int(i)==2);b3+=(int(i)==3);b4+=(int(i)==4)\nprint(a1*b1+a2*b2+a3*b3+a4*b4)\n", "v1=list(map(int,input().split()))\r\ns=input();a=0\r\nfor i in s:a+=v1[int(i)-1]\r\nprint(a) \r\n", "calorie_num = input(\"\")\r\ncalorie_lst = [int(i) for i in calorie_num.split()]\r\nstrip_num = input(\"\")\r\nttl = 0\r\n\r\nfor num in strip_num:\r\n ttl += calorie_lst[int(num)-1]\r\n\r\nprint(ttl)\r\n", "c1,c2,c3,c4=map(int,input().split())\ngame=input()\ncalorie=0\nfor i in game:\n \n if i == '1':\n calorie+=c1\n\n elif i == '2':\n calorie+=c2\n\n elif i == '3':\n calorie+=c3\n\n else:\n calorie+=c4\n\nprint(calorie)\n\n", "s = list(map(int,input().split()))\r\na = input()\r\ncn = 0\r\nfor i in a:\r\n i = int(i)\r\n cn += s[i - 1]\r\nprint(cn)", "n = [int(i) for i in input().split()]\nd = {}\nfor i in range(1,5):\n d[str(i)] = n[i-1]\nm = input()\nc = 0\nfor i in m:\n c += d[i]\nprint(c)", "#431A. Black Square\r\na=[int(x) for x in input().split()]\r\ns=input()\r\nc=0\r\nfor i in s:\r\n c=c+a[int(i)-1]\r\nprint(c) ", "mas = list(map(int, input().split()))\r\ns = input()\r\nc = 0\r\nfor i in s:\r\n c += mas[int(i) - 1]\r\nprint(c)", "d = {}\r\ncal = 0\r\nc = [int(i) for i in input().split()]\r\nfor i in range(4): d.update({i+1:c[i]})\r\nfor i in input(): cal += d[int(i)]\r\nprint(cal)\r\n", "a1,a2,a3,a4=map(int,input().split())\r\ns=input()\r\ncalories=0\r\nfor i in s:\r\n if i==\"1\":\r\n calories+=a1\r\n if i==\"2\":\r\n calories+=a2\r\n if i==\"3\":\r\n calories+=a3\r\n if i==\"4\":\r\n calories+=a4\r\nprint(calories)", "a = [int(x) for x in input().split()]\r\ns = input()\r\nres = 0\r\nfor i in s:\r\n res += a[int(i)-1]\r\nprint(res)\r\n", "a=input().split()\nm=input()\nsum1=0\nfor i in m:\n\tif i==\"1\":\n\t\tsum1+=int(a[0])\n\telif i==\"2\":\n\t\tsum1+=int(a[1])\n\telif i==\"3\":\n\t\tsum1+=int(a[2])\n\telse:\n\t\tsum1+=int(a[3])\nprint(sum1)", "arr=list(map(int,input().split()))\r\ns=str(input())\r\nl=list(s)\r\nans=0\r\nfor i in l:\r\n n=int(i)\r\n ans+=arr[n-1]\r\nprint(ans)\r\n ", "def main():\r\n \r\n \r\n b = [0] + list(map(int, input().split()))\r\n sum = 0\r\n for i in input():\r\n sum += b[int(i)]\r\n \r\n print(sum)\r\n\r\nmain()", "def calculate_calories(exercise_calories, sequence):\r\n total_calories = 0\r\n for exercise in sequence:\r\n exercise_index = int(exercise) - 1\r\n total_calories += exercise_calories[exercise_index]\r\n return total_calories\r\n\r\nexercise_calories = list(map(int, input().split()))\r\nsequence = input().strip()\r\n\r\ntotal_calories = calculate_calories(exercise_calories, sequence)\r\nprint(total_calories)", "a, b, c, d=[int(x) for x in input().split()]\r\ns=input()\r\ns=list(s)\r\ncal=0\r\nfor i in s:\r\n if i=='1':\r\n cal=cal+a\r\n elif i=='2':\r\n cal=cal+b\r\n elif i=='3':\r\n cal=cal+c\r\n else:\r\n cal=cal+d\r\nprint(cal)", "a1, a2, a3, a4 = map(int,input().split())\r\ns = input()\r\n\r\nl = len(s)\r\nsum = 0\r\n\r\nfor i in range (0, l):\r\n if s[i] == '1':\r\n sum = sum + a1\r\n if s[i] == '2':\r\n sum = sum + a2\r\n if s[i] == '3':\r\n sum = sum + a3\r\n if s[i] == '4':\r\n sum = sum + a4\r\n \r\nprint(sum)", "# Read the calorie values for each strip\r\na1, a2, a3, a4 = map(int, input().split())\r\n\r\n# Read the string describing the game\r\ns = input()\r\n\r\n# Initialize the total calories wasted\r\ntotal_calories = 0\r\n\r\n# Iterate through the string and calculate the calories\r\nfor char in s:\r\n if char == '1':\r\n total_calories += a1\r\n elif char == '2':\r\n total_calories += a2\r\n elif char == '3':\r\n total_calories += a3\r\n elif char == '4':\r\n total_calories += a4\r\n\r\n# Print the total calories wasted\r\nprint(total_calories)\r\n", "a1,a2,a3,a4 = map(int,input().split(\" \"))\r\ns = input()\r\nans = 0\r\nfor i in range(0,len(s)):\r\n if(s[i] == '1'):\r\n ans += a1\r\n elif(s[i] == '2'):\r\n ans += a2\r\n elif(s[i] == '3'):\r\n ans += a3\r\n elif(s[i] == '4'):\r\n ans += a4\r\nprint(ans)", "def main():\r\n stripValues=input()\r\n stripList=stripValues.split()\r\n sqaureSequence=input()\r\n counter=0\r\n for i in range(len(sqaureSequence)):\r\n counter+=int(stripList[int(sqaureSequence[i])-1])\r\n\r\n print(counter)\r\nif __name__ == \"__main__\":\r\n main()\r\n\r\n\r\n", "arr = list(map(int, input().split()))\r\ns = input()\r\ntotal = 0\r\nfor c in s:\r\n total += arr[int(c)-1]\r\nprint(total)", "l=list(map(int,input().split()))\r\ns=str(input())\r\nsum=0\r\nfor i in s:\r\n sum+=l[int(i)-1]\r\nprint(sum)\r\n \r\n", "l1=[int(i) for i in input().split()]\r\ns=input()\r\nsum=0\r\nfor j in s:\r\n k=int(j)-1\r\n sum=sum+l1[k]\r\nprint(sum)", "a, b, c, d = map(int, input().split())\r\nk = input()\r\ncalories = 0\r\nfor i in k:\r\n if i == '1':\r\n calories += a\r\n elif i == '2':\r\n calories += b\r\n elif i == '3':\r\n calories += c\r\n elif i == '4':\r\n calories += d\r\n else:\r\n raise Exception\r\nprint(calories)", "x = [int(i) for i in input().split()]\r\nseq = list(map(int, list(input())))\r\nans = 0\r\nfor i in range(len(x)):\r\n ans += seq.count(i + 1) * x[i]\r\nprint(ans)\r\n", "cal = [0] + list(map(int, input().split()))\r\nprint(sum(map(lambda x: cal[int(x)], input().strip())))", "a = list(map(int,input().split()))\r\ns = input()\r\ntotal = 0\r\nfor x in s:\r\n total += a[int(x)-1]\r\nprint(total)", "a1,a2,a3,a4=map(int,input().split())\r\ns=str(input())\r\nsum=0\r\nfor i in range(len(s)):\r\n \r\n if s[i]=='1':\r\n sum=sum+int(a1)\r\n \r\n elif s[i]=='2':\r\n sum=sum+int(a2)\r\n \r\n elif s[i]=='3':\r\n sum=sum+int(a3)\r\n \r\n else:\r\n sum=sum+int(a4)\r\n \r\n\r\nprint(sum)", "a1, a2, a3, a4 = map(int, input().split())\r\ndict = {\"1\":a1,\"2\":a2,\"3\":a3,\"4\":a4}\r\nans = 0\r\ns = input()\r\nfor i in s:\r\n ans+=dict[i] \r\n \r\nprint(ans)", "a,b,c,d=map(int,input().split())\r\nx=0\r\nz=input()\r\nfor i in range(0,len(z)):\r\n if int(z[i])==1:\r\n x=x+a\r\n elif int(z[i])==2:\r\n x=x+b\r\n elif int(z[i])==3:\r\n x=x+c\r\n elif int(z[i])==4:\r\n x=x+d\r\nprint(x)", "calories = list(map(int, input().split()))\ns = input()\ntotal = 0\n\nfor i in s:\n total += calories[int(i)-1]\n\nprint(total)", "n = input().split()\r\n\r\ncalories = str(input())\r\nsum1 = 0\r\n\r\nfor i in range (len(calories)):\r\n if calories[i] == \"1\":\r\n sum1 += int(n[0])\r\n if calories[i] == \"2\":\r\n sum1 += int(n[1])\r\n if calories[i] == \"3\":\r\n sum1 += int(n[2])\r\n if calories[i] == \"4\":\r\n sum1 += int(n[3])\r\n\r\nprint(sum1)", "calories = list(map(int, input().split()))\r\ngame = input()\r\ntotal_calories = sum(calories[int(x)-1] for x in game)\r\nprint(total_calories)", "a,b,c,d=map(int,input().split())\r\ns=input()\r\nca=0\r\nfor i in range(0,len(s)):\r\n if s[i]=='1':\r\n ca+=a;\r\n if s[i]=='2':\r\n ca+=b; \r\n if s[i]=='3':\r\n ca+=c; \r\n if s[i]=='4':\r\n ca+=d;\r\nprint(ca) \r\n ", "print(sum(map(dict(zip(map(str, range(1, 5)), map(int, input().split()))).get, input())))\n", "a = list(map(int,input().split()))\r\nb = str(input())\r\nans = 0\r\nfor i in b:\r\n ans += a[int(i)-1]\r\nprint(ans)\r\n", "cal = list(map(int, input().split()))\r\nsq = input()\r\nt = 0\r\nfor c in sq:\r\n t += cal[int(c)-1]\r\nprint(t)", "lst = list(map(int, input().split()))\r\nx = input()\r\nz = 0\r\nfor i in range(len(x)):\r\n z+=lst[int(x[i])-1]\r\n\r\nprint(z)", "a1,a2,a3,a4=map(int,input().split())\r\ns=input()\r\nsu=0\r\nfor i in s:\r\n if i=='1':\r\n su+=a1\r\n elif i=='2':\r\n su+=a2\r\n elif i=='3':\r\n su+=a3\r\n elif i=='4':\r\n su+=a4\r\nprint(su)", "calories = list(map(int,input().split()))\r\nmoves = input()\r\nans = 0\r\nfor move in moves:\r\n ans += calories[int(move)-1]\r\nprint(ans)\r\n", "list1=list(map(int,input().split()))\r\ns=input()\r\nsum=0\r\nfor x in s:\r\n sum+=list1[int(x)-1]\r\n\r\nprint(sum)\r\n\r\n", "n = list(map(int,input().split()))\r\nx = str(input())\r\nc = 0\r\nfor i in x:\r\n T = n[int(i)-1]\r\n c = c+T\r\nprint(c)\r\n", "vals = list(map(int, input().split()))\r\nstps = input()\r\n\r\noneCount = stps.count('1')\r\ntwoCount = stps.count('2')\r\nthreeCount = stps.count('3')\r\nfourCount = stps.count('4')\r\n\r\nprint(oneCount*vals[0]+twoCount*vals[1]+threeCount*vals[2]+fourCount*vals[3])", "calories = [int(x) for x in input().split()]\r\nstring = input()\r\nstring = list(string)\r\na = string.count('1')\r\nb = string.count('2')\r\nc = string.count('3')\r\nd = string.count('4')\r\ntotal = 0\r\ntotal = (a*calories[0])+ (b*calories[1])+ (c*calories[2])+ (d*calories[3])\r\nprint(total)\r\n", "a1, a2, a3, a4 = map(int, input().split())\r\ns = input()\r\nans = 0\r\nfor i in s:\r\n if i == str(1):\r\n ans += a1\r\n elif i == str(2):\r\n ans += a2\r\n elif i == str(3):\r\n ans += a3\r\n elif i == str(4):\r\n ans += a4\r\n\r\nprint(ans)\r\n", "a=list(map(int,input().split()))\r\nn=input()\r\nb=0\r\ndef check(x):\r\n if x=='1':\r\n x=a[0]\r\n elif x=='2':\r\n x=a[1]\r\n elif x=='3':\r\n x=a[2]\r\n elif x=='4':\r\n x=a[3]\r\n return x\r\nfor i in range(len(n)):\r\n b+=check(n[i])\r\nprint(b)\r\n", "ai = [int(x) for x in input().split()]\r\ns = input()\r\ncalories = 0\r\n\r\nfor c in s:\r\n c = int(c)\r\n calories += ai[c-1]\r\n\r\nprint(calories)", "cal = [int(i) for i in input().split(\" \")]\n\ngame = str(input())\n\nres = 0\nfor i in game:\n res += cal[int(i)-1]\n\nprint(res)\n", "def main():\r\n a1, a2, a3, a4 = map(int, input().split())\r\n s = input()\r\n calories = 0\r\n for i in range(len(s)):\r\n if s[i] == '1':\r\n calories += a1\r\n elif s[i] == '2':\r\n calories += a2\r\n elif s[i] == '3':\r\n calories += a3\r\n elif s[i] == '4':\r\n calories += a4\r\n print(calories)\r\nif __name__ == '__main__':\r\n main()", "a1, a2, a3, a4 = list(map(int, input().split()))\r\ns = input()\r\nd = 0\r\nfor i in range(len(s)):\r\n if s[i] == '1':\r\n d += a1\r\n elif s[i] == '2':\r\n d += a2\r\n elif s[i] == '3':\r\n d += a3\r\n else:\r\n d += a4\r\nprint(d)", "def solve():\r\n l = [int(i) for i in input().split()]\r\n s, ans = input(), 0\r\n for i in s:\r\n ans += l[int(i)-1]\r\n print(ans)\r\n\r\n\r\n# t = int(input())\r\nt = 1\r\nwhile t:\r\n solve()\r\n t -= 1\r\n", "x1,x2,x3,x4 = map(int,input().split())\r\ns = list(str(input()))\r\nc=0\r\nfor i in range(len(s)):\r\n if s[i]=='1':\r\n c+=x1\r\n elif s[i]=='2':\r\n c+=x2\r\n elif s[i]=='3':\r\n c+=x3\r\n elif s[i]=='4':\r\n c+=x4\r\nprint(c)", "l=list(map(int,input().strip().split()))\r\ns=input()\r\none=s.count(\"1\")\r\ntwo=s.count(\"2\")\r\nthree=s.count(\"3\")\r\nfour=s.count(\"4\")\r\nans=one*l[0]+two*l[1]+three*l[2]+four*l[3]\r\nprint(ans)", "cal = input().split()\r\n\r\nseq = input()\r\n\r\nsum = 0\r\nfor i in seq:\r\n sum += int(cal[int(i) - 1])\r\n\r\nprint(sum)\r\n", "a = list(map(int, input().split()))\r\nd = {\r\n '1': a[0],\r\n '2': a[1],\r\n '3': a[2],\r\n '4': a[3]\r\n \r\n}\r\nn = input()\r\ni = 0\r\ns=0\r\nwhile i<len(n):\r\n s=s+d[n[i]]\r\n i+=1\r\nprint(s)", "l=list(map(int,input().split())) \r\nch=input()\r\nprint(ch.count(\"1\")*l[0]+ch.count(\"2\")*l[1]+ch.count(\"3\")*l[2]+ch.count(\"4\")*l[3])\r\n", "line = input()\r\n(a1, a2, a3, a4) = map(int, line.split())\r\nx = input()\r\nx = list(x)\r\nsum = 0\r\nfor c in x:\r\n if c == '1':\r\n sum += a1\r\n if c == '2':\r\n sum += a2\r\n if c == '3':\r\n sum += a3\r\n if c == '4':\r\n sum += a4\r\nprint(sum)", "l = list(map(int,input().split(\" \"))) \r\ns = input() \r\nc = 0 \r\nfor i in s : \r\n c += l[int(i)-1] \r\nprint(c) ", "a=[int(i) for i in input().split()]\r\nb=input()\r\nc=0\r\nfor i in b:\r\n c+=a[int(i)-1]\r\nprint(c)", "calories = list(map(int, input().split(\" \")))\r\nstrips = input()\r\n\r\ntotal = 0\r\nfor i in range(len(strips)):\r\n total += calories[int(strips[i])-1]\r\n \r\nprint(total) \r\n ", "# Read input values\r\ncalories = list(map(int, input().split()))\r\ngame_sequence = input()\r\n\r\n# Initialize a variable to store the total calories\r\ntotal_calories = 0\r\n\r\n# Iterate through the game sequence and calculate calories\r\nfor second in game_sequence:\r\n strip_number = int(second) - 1 # Convert character to strip index (0-based)\r\n total_calories += calories[strip_number]\r\n\r\n# Print the total calories\r\nprint(total_calories)\r\n", "l=list(map(int,input().split()))\r\nl1=input()\r\ns=0\r\nfor i in l1:\r\n s+=l[int(i)-1]\r\nprint(s)", "lst = list(map(int, input().split()))\r\n\r\ns = input()\r\n\r\ncnt = 0\r\n\r\nfor i in range(len(s)):\r\n cnt += lst[int(s[i]) - 1]\r\n \r\nprint(cnt)", "arr=[int(i) for i in input().split()]\r\ns=input()\r\nans=0\r\nfor i in s:\r\n\t\tans+=arr[int(i)-1]\r\nprint(ans)", "\r\nl1 = [0];l1.extend(list(map(int, input().split())));sum = 0;st = input()\r\nfor i in st:sum += l1[int(i)]\r\nprint(sum)", "p,k,e,d=map(int,input().split())\r\nn=input()\r\nc=0\r\nfor i in n:\r\n if i=='1':\r\n c=c+p\r\n elif(i=='2'):\r\n c=c+k\r\n elif(i=='3'):\r\n c=c+e\r\n elif(i=='4'):\r\n c=c+d\r\nprint(c)", "# your code goes here\r\nw,x,y,z=(int(i) for i in input().split())\r\ns=str(input())\r\ncost=w*s.count('1')+x*s.count('2')+y*s.count('3')+z*s.count('4')\r\nprint(cost)", "value=input().split(\" \")\r\nx=input(\"\")\r\nout=0\r\nfor i in range (len(x)):\r\n if(int(x[i])==1):\r\n out+=int(value[0])\r\n elif(int(x[i])==2):\r\n out+=int(value[1])\r\n elif(int(x[i])==3):\r\n out+=int(value[2])\r\n elif(int(x[i])==4):\r\n out+=int(value[3])\r\nprint(out)", "\r\na,b,c,d=list(map(int,input().rstrip().split()))\r\nd={1:a,2:b,3:c,4:d}\r\nst=input()\r\ns=0\r\nfor i in st:\r\n s+=d[int(i)]\r\nprint(s)", "a=list(map(int,input().split()))\r\ns=input()\r\nb=0\r\nfor i in range(len(s)):\r\n if s[i]=='1':\r\n b+=a[0]\r\n if s[i]=='2':\r\n b+=a[1]\r\n if s[i]=='3':\r\n b+=a[2]\r\n if s[i]=='4':\r\n b+=a[3]\r\nprint(b)", "l=[int(i) for i in input().split()]\r\ns=input()\r\nc=0\r\nfor i in s:\r\n c+=l[int(i)-1]\r\nprint(c)", "a=list(map(int,input().split()))\r\ns=input()\r\ns1=0\r\nfor i in range(len(s)):\r\n s1+=a[int(s[i])-1]\r\nprint(s1)\r\n ", "a = [int(s) for s in input().split(\" \")]\r\ncal = str(input())\r\nsk = 0\r\nfor i in range(len(cal)):\r\n if cal[i] == \"1\":\r\n sk += a[0]\r\n if cal[i] == \"2\":\r\n sk += a[1]\r\n if cal[i] == \"3\":\r\n sk += a[2]\r\n if cal[i] == \"4\":\r\n sk += a[3]\r\nprint(sk)", "weight = list(map(int, input().split()))\r\nnum_list = list(map(int, list(input())))\r\ncounter = 0\r\n\r\nfor el in num_list:\r\n el -= 1\r\n counter += weight[el]\r\n\r\nprint(counter)\r\n", "import sys\n\ncalories = list(map(lambda x: int(x), input().split(\" \")))\n\ntotal = 0\n\nwhile True:\n char = sys.stdin.read(1)\n if not char or char == \"\\n\":\n break\n strip = int(char)\n total += calories[strip - 1]\n\nprint(total)\n", "'''\r\n# Submitted By [email protected]\r\nDon't Copy This Code, Try To Solve It By Yourself\r\n'''\r\n# Problem Name = \"Black Square\"\r\n# Class: A\r\n\r\nimport sys\r\n# input = 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 a = list(map(int, input().split()))\r\n s = input()\r\n ans=0\r\n for i in s:\r\n ans+=a[int(i)-1]\r\n \r\n print(ans)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n Solve()", "'''\r\nProblem: https://codeforces.com/problemset/problem/431/A\r\nTries:\r\nTime:\r\n'''\r\n\r\nnum_values = [x for x in input().split(\" \")]\r\ns = input()\r\n\r\ncalories = 0\r\nfor letter in s:\r\n calories += int(num_values[int(letter) - 1])\r\nprint(calories) ", "a,b,c,d = map(int,input().split())\r\ng=list(input())\r\no = 0\r\nfor x in range(len(g)):\r\n if g[x]=='1':\r\n o+=a\r\n elif g[x]=='2':\r\n o+=b\r\n elif g[x]=='3':\r\n o+=c\r\n else:\r\n o+=d\r\nprint(o)", "n = list(map(int, input().split()))\r\ncnt = 0\r\nfor c in input():\r\n cnt += n[int(c) - 1]\r\nprint(cnt)", "result=0\r\neng=input()\r\neng=list(map(int,eng.split()))\r\ns=input()\r\nfor i in range(0,len(s)):\r\n\tresult+=eng[int(s[i])-1]\r\nprint(result)\r\n", "l=list(map(int,input().split()))\r\ns=input()\r\ncnt=0\r\nfor i in range (0,len(s)):\r\n if s[i]=='1':\r\n cnt+=l[0]\r\n elif s[i]=='2':\r\n cnt+=l[1]\r\n elif s[i]=='3':\r\n cnt+=l[2]\r\n elif s[i]=='4':\r\n cnt+=l[3]\r\nprint(cnt)", "ls=[int(i) for i in input().split()]\r\ns=input()\r\nsum=0\r\nfor i in range(len(ls)):\r\n sum+=s.count(str(i+1))*ls[i]\r\nprint(sum)", "n = input().split()\r\ns = str(input())\r\nc = 0\r\nd = []\r\nfor i in range (len(n)):\r\n n[i] = int(n[i])\r\nfor i in s:\r\n i = int(i)\r\n c = c + n[i-1]\r\nprint(c)", "a = [int(tmp) for tmp in input().split()]\r\ns = input()\r\nsum = 0\r\nfor b in s:\r\n sum += a[int(b) - 1]\r\nprint(sum)", "n = list(map(int,input().split()))\r\ns = input()\r\ntotal = 0\r\n\r\nfor char in s:\r\n values = int(char)\r\n total+= n[values - 1]\r\n\r\nprint(total)", "def black_square():\r\n a = list(map(int, input().split()))\r\n squares = input()\r\n calories = 0 \r\n\r\n for square in squares:\r\n calories += a[int(square)-1]\r\n \r\n return calories\r\nprint(black_square())\r\n", "a1, a2, a3, a4 = list(map(int, input().split()))\ns = input()\nresult = 0\nfor i in range(len(s)):\n if int(s[i]) == 1:\n result += a1\n elif int(s[i]) == 2:\n result += a2\n elif int(s[i]) == 3:\n result += a3\n elif int(s[i]) == 4:\n result += a4\nprint(result) \n \n", "a,b,c,d=map(int,input().split())\r\nA='1'\r\nB='2'\r\nC='3'\r\nD='4'\r\ns=input()\r\na1=s.count(A)\r\nz=(a1*a)\r\nb1=s.count(B)\r\nx=(b1*b)\r\nc1=s.count(C)\r\nv=(c1*c)\r\nd1=s.count(D)\r\nl=(d1*d)\r\nprint(z+x+v+l)", "a = input().split()\r\ns = input()\r\nad = {\r\n '1': int(a[0]),\r\n '2': int(a[1]),\r\n '3': int(a[2]),\r\n '4': int(a[3])\r\n}\r\nsum = 0\r\n\r\nfor i in s:\r\n sum += ad[i]\r\n\r\nprint(sum)\r\n", "a, b, c, d = map(int, input().split())\r\nl = [i for i in input()]\r\n\r\ncalcount = 0\r\n\r\nfor _ in l:\r\n if _=='1':\r\n calcount+=a\r\n elif _=='2':\r\n calcount+=b\r\n elif _=='3':\r\n calcount+=c\r\n elif _=='4':\r\n calcount+=d\r\n\r\nprint(calcount)", "a=list(map(int,input().split()))\r\nk=0\r\nfor i in list(input()):\r\n k+=a[int(i)-1]\r\nprint(k)", "calories = list(map(int, input().split()))\r\ns = input()\r\ncounts = [0] * 4\r\nfor c in s:\r\n counts[int(c) - 1] += 1\r\ntotal_calories = sum(counts[i] * calories[i] for i in range(4))\r\nprint(total_calories)\r\n", "c1,c2,c3,c4 = [int(x) for x in input().split()]\r\ns = input()\r\ncal = 0\r\nfor x in s:\r\n if x =='1':\r\n cal = cal + c1\r\n elif x=='2':\r\n cal = cal+c2\r\n elif x=='3':\r\n cal = cal + c3\r\n elif x=='4':\r\n cal = cal+c4\r\nprint(cal)", "a = list(map(int, input().split()))\r\nd={'1':a[0], '2':a[1], '3':a[2], '4':a[3]}\r\ns=input()\r\nans=0\r\nfor x in s:\r\n ans+=d[x]\r\nprint(ans)\r\n \r\n", "import sys\r\n\r\na = [int(i) for i in sys.stdin.readline().split()]\r\ns = sys.stdin.readline()[:-1]\r\n\r\ntotal = 0\r\n\r\nfor i in range(len(s)):\r\n total += a[int(s[i])-1]\r\nprint(total)\r\n\r\n\r\n", "cal = list(map(int,input().split()))\r\nstring =input()\r\ncount = 0\r\nfor el in range(len(string)) :\r\n if string[el] == '1' :\r\n count += cal[0]\r\n elif string[el] == '2' :\r\n count += cal[1]\r\n elif string[el] == '3' :\r\n count += cal[2]\r\n elif string[el] == '4' :\r\n count += cal[3]\r\nprint(count)", "a,b,c,d=list(map(int,input().split()))\r\ns=list(input())\r\nq=0\r\nfor i in s:\r\n if i==\"1\":\r\n q+=a\r\n elif i=='2':\r\n q+=b\r\n elif i=='3':\r\n q+=c\r\n else:\r\n q+=d\r\nprint(q)", "lst = list(map(int, input().split()))\r\n\r\nres = 0\r\ns = input()\r\n\r\nfor char in s:\r\n res += lst[int(char) - 1]\r\n\r\nprint(res)", "ele = list(map(int,input().split())) \r\ncals=input()\r\nnum=0\r\nfor i in cals:\r\n num+=ele[int(i)-1] \r\nprint(num)", "# LUOGU_RID: 101568548\na = list(map(int, input().split()))\r\ns = input()\r\nprint(sum(s.count(chr(i + ord('1'))) * a[i] for i in range(4)))", "def main():\r\n a, b, c, d = [int(i) for i in input().split()]\r\n s = input()\r\n res = 0\r\n # Loop each char and compute\r\n for i in range(len(s)):\r\n if s[i] == \"1\":\r\n res += a\r\n elif s[i] == \"2\":\r\n res += b\r\n elif s[i] == \"3\":\r\n res += c\r\n elif s[i] == \"4\":\r\n res += d\r\n print(res)\r\n \r\n\r\nmain()", "def wastees(s,a1,a2,a3,a4) -> int:\n wasted = 0\n for c in s:\n if(c=='1'):\n wasted += a1\n elif(c=='2'):\n wasted += a2\n elif(c=='3'):\n wasted += a3\n elif(c=='4'):\n wasted += a4\n return wasted\na1,a2,a3,a4 = list(map(lambda x:int(x),input().split(' ')))\ns = input()\nprint(wastees(s,a1,a2,a3,a4))\n", "calories = [*map(int, input().split())]\r\nprocess = input()\r\n\r\nsum = 0\r\nfor step in process:\r\n sum += calories[int(step) - 1]\r\nprint(sum)", "\r\n\r\na,b,c,d = input().split()\r\na = int(a)\r\nb = int(b)\r\nc = int(c)\r\nd = int(d)\r\ncounter=0\r\nboxes=input()\r\nfor i in boxes:\r\n if i == \"1\":\r\n counter+=a\r\n elif i == \"2\":\r\n counter+=b\r\n elif i == \"3\":\r\n counter+=c\r\n elif i == \"4\":\r\n counter+=d\r\nprint (counter)", "a1,a2,a3,a4=map(int,input().split())\r\nstring=input()\r\ns=0\r\nfor char in string:\r\n v=int(char)\r\n if v==1:\r\n s+=a1\r\n elif v==2:\r\n s+=a2\r\n elif v==3:\r\n s+=a3\r\n elif v==4:\r\n s+=a4\r\nprint(s)", "l = list(map(int,input().split()))\r\np = input()\r\nsum = 0\r\nfor i in p:\r\n sum += l[int(i) - 1]\r\nprint(sum)", "import math\r\ndef encode(a,b,c,d,n):\r\n if n == 1:\r\n return a\r\n elif n ==2:\r\n return b\r\n elif n ==3:\r\n return c \r\n else:\r\n return d\r\nli = input()\r\nli = li.split()\r\nlist1 = [ ]\r\nlist1 = list(map(int,li))\r\na = list1[0]\r\nb =list1[1]\r\nc = list1[2]\r\nd = list1[3]\r\nli1 = int(input())\r\nli1 = [int(x) for x in str(li1)]\r\nsum = 0\r\nfor i in range(len(li1)):\r\n sum = sum +encode(a,b,c,d,li1[i])\r\nprint(sum)\r\n", "def calculate_calories(a, s):\r\n total_calories = 0\r\n for char in s:\r\n strip_number = int(char) - 1\r\n total_calories += a[strip_number]\r\n return total_calories\r\na = list(map(int, input().split()))\r\ns = input()\r\nresult = calculate_calories(a, s)\r\nprint(result)\r\n", "a=list(map(int,input().split()))\r\n\r\nans=0\r\nfor i in map(int,list(input())) :\r\n ans+=a[i-1]\r\nprint(ans)\r\n\r\n\r\n", "a = list(map(int, input().split()))\r\ns = input()\r\n\r\ncalories = 0\r\nfor char in s:\r\n strip = int(char) - 1 # Adjust the strip index to 0-based\r\n calories += a[strip]\r\n\r\nprint(calories)\r\n", "vector = input().split(\" \")\r\norden = input()\r\n\r\ncont = 0\r\n\r\nfor x in orden:\r\n cont += int(vector[int(x)-1])\r\n\r\nprint(cont) ", "a = list(map(int, input().split()))\r\ns = input()\r\n\r\ncalories = 0\r\nfor i in s:\r\n if i == '1':\r\n calories += a[0]\r\n elif i == '2':\r\n calories += a[1]\r\n elif i == '3':\r\n calories += a[2]\r\n elif i == '4':\r\n calories += a[3]\r\n\r\nprint(calories)\r\n", "a1, a2, a3, a4 = map(int, input().split())\r\ns = input()\r\nd = {'1':a1, '2':a2, '3':a3, '4':a4}\r\nans = 0\r\nfor i in s:\r\n ans += d[i]\r\nprint(ans)", "a = list(map(int, input().split()))\r\ns = input()\r\nprint(sum([a[int(c) - 1] for c in s]))", "sum = 0\r\nx = input()\r\nl = x.split()\r\ns = input()\r\nfor i in s :\r\n sum += int(l[int(i)-1])\r\nprint(sum)", "a = list(map(int, input().split()))\r\ns = input()\r\n\r\ntotal_calories = 0\r\n\r\nfor i in s:\r\n strip = int(i) - 1\r\n total_calories += a[strip]\r\n\r\nprint(total_calories)\r\n", "a=list(map(int,input().split()))\r\nc={}\r\nb=0\r\nfor i in range(len(a)):\r\n c[str(i+1)]=a[i]\r\nfor i in input():\r\n b+=c[i]\r\nprint(b)", "a = list(map(int, input().split()))\r\ns = input()\r\ncalories = 0\r\nfor char in s:\r\n strip = int(char) - 1\r\n calories += a[strip]\r\nprint(calories)\r\n", "input_lines = []\r\nwhile True:\r\n try:\r\n line = input()\r\n input_lines.append(line)\r\n except EOFError:\r\n break\r\n\r\nn = list(map(int, input_lines[0].split()))\r\ns = list(map(int, input_lines[1]))\r\n\r\nsum = 0\r\n \r\nfor i in range(len(s)):\r\n sum += n[s[i]-1]\r\n \r\nprint(sum)\r\n", "x = input().split()\r\ny = [int(i) for i in x]\r\nz = str(input())\r\ns = 0\r\nfor i in z:\r\n c = y[int(i)-1]\r\n s = s+c\r\nprint(s)", "a=input()\nmylist=a.split()\n\nb=input()\nn=0\nfor i in b:\n if i == '1':\n n+=int(mylist[0])\n elif i == '2':\n n+=int(mylist[1])\n elif i== '3':\n n+=int(mylist[2])\n else:\n n+=int(mylist[3])\nprint(n)\n\t \t \t\t\t \t\t\t\t \t\t \t\t \t", "x = list(map(int,input().split()))\r\nplaying = input()\r\ncalories = 0\r\nfor i in playing:\r\n calories += x[int(i)-1]\r\nprint(calories)", "a=[int(x) for x in input().split()]\r\ns=input()\r\nk=0\r\nfor i in s:\r\n k=k+a[int(i)-1]\r\n\r\nprint(k)", "n = input().split()\r\nfor i in range(len(n)):\r\n n[i] = int(n[i])\r\ns = input()\r\ntotal = 0 \r\nfor i in s:\r\n total += n[int(i) - 1]\r\nprint(total)", "string = input().split()\r\ncall = {i + 1: int(string[i]) for i in range(len(string))}\r\nmove = [int(i) for i in list(input())]\r\ncount = 0\r\nfor i in move:\r\n count += call[i]\r\nprint(count)", "a = list(map(int, input().split()))\r\ns = input()\r\n\r\ncalories = 0\r\ncalories_map = {\"1\": a[0], \"2\": a[1], \"3\": a[2], \"4\": a[3]}\r\n\r\nfor char in s:\r\n calories += calories_map[char]\r\n\r\nprint(calories)\r\n", "# Numeri delle calorie per le strisce\r\na = list(map(int, input().split())) \r\ns = input() # Stringa di gioco\r\n\r\ntotal_calories = 0 # Calorie totali, inizialmente zero\r\n\r\nfor i in s:\r\n \r\n # Ottieni l'indice corrispondente per la striscia (da 0 a 3)\r\n strip_number = int(i) - 1 \r\n # Aggiungi le calorie corrispondenti alla variabile totale\r\n total_calories += a[strip_number] \r\n\r\n# Stampa il numero totale di calorie che Jury ha sprecato\r\nprint(total_calories) \r\n", "# https://codeforces.com/problemset/problem/431/A\r\n\r\na = {}\r\na[1], a[2], a[3], a[4] = map(int, input().split())\r\nl = input()\r\nres = 0\r\nfor it in l:\r\n res += a[int(it)]\r\nprint(res)", "\r\nimport math\r\n\r\nt = 1#int(input())\r\nfor q in range(0, t):\r\n #lenght = int(input())\r\n a, b, c, d = map(int, input().split(' '))\r\n s = input()\r\n sum = 0\r\n # for i in range(0, l):\r\n # s1[i] = int(s1[i])\r\n\r\n l = len(s)\r\n for i in range(0, l):\r\n if s[i] == '1':\r\n sum += a\r\n if s[i] == '2':\r\n sum += b\r\n if s[i] == '3':\r\n sum += c\r\n if s[i] == '4':\r\n sum += d\r\n print(sum)", "sqValue = input().split(' ')\nmoves = input()\nenergy = 0\nfor i in moves:\n if i == '1':\n energy += int(sqValue[0])\n elif i == '2':\n energy += int(sqValue[1])\n elif i == '3':\n energy += int(sqValue[2])\n else:\n energy += int(sqValue[3])\nprint(energy)", "a,b,c,d = list(map(int,input().split()))\r\nd ={'1':a,'2':b,'3':c,'4':d}\r\ns = input()\r\nans = 0\r\nfor i in s:\r\n ans+=d[i]\r\nprint(ans)", "weights = list(map(int, input().split()))\ns = input()\n\ncal = 0\n\nfor box in s:\n cal += weights[int(box)-1]\n\nprint(cal)\n", "a1, a2, a3, a4 = map(int, input().split())\r\ns = input()\r\nsum = 0\r\nfor i in s:\r\n if int(i) == 1:\r\n sum += a1\r\n elif int(i) == 2:\r\n sum += a2\r\n elif int(i) == 3:\r\n sum += a3\r\n elif int(i) == 4:\r\n sum += a4\r\n\r\nprint(sum)", "ls=list(map(int,input().split()))\r\nstrm=input()\r\ncal=0\r\n\r\nfor m in strm:\r\n cal+=ls[int(m)-1]\r\nprint(cal)\r\n ", "# q15 Black Square\r\nvalues = list(map(int,input().split(' ')))\r\nrow = input()\r\ncalories = 0\r\nfor i in range (len(row)) :\r\n calories += values[int(row[i])-1]\r\nprint(calories)", "# for _ in [0] * int(input()):\r\nlst=list(map(int,input().split()))\r\nguess=input()\r\ncountt=0\r\nfor i in guess:\r\n countt += lst[int(i)-1]\r\nprint(countt)", "a,b,c,d=input().split()\na,b,c,d=int(a),int(b),int(c),int(d)\ns=input()\nC=0\nfor i in range(len(s)):\n\tif s[i]=='1':\n\t\tC+=a\n\tif s[i]=='2':\n\t\tC+=b\n\tif s[i]=='3':\n\t\tC+=c\n\tif s[i]=='4':\n\t\tC+=d\nprint(C)\n\n\n\n\n\n\n\n\n\n\n\n\n\t\n\t\n", "x=input()\r\nx=x.split()\r\ny=input()\r\n# print(len(y))\r\ns=0\r\nfor i in range(len(y)):\r\n s=int(x[int(y[i])-1])+s\r\nprint(s)\r\n", "a = input().split()\r\nad = {}\r\nsum = 0\r\ns = input()\r\n\r\nfor i in range(4):\r\n ad[str(i + 1)] = int(a[i])\r\n\r\nfor i in s:\r\n sum += ad[i]\r\n\r\nprint(sum)\r\n", "verticals = list(map(int, input().split()))\r\n\r\ncalories = 0\r\nsquares = input()\r\n\r\n\r\nfor i in range(len(squares)):\r\n calories += verticals[int(squares[i])-1]\r\n\r\n\r\n\r\nprint(calories)", "\r\nfrom collections import Counter\r\nl1 = [0]\r\nl1.extend(list(map(int, input().split())))\r\n\r\nmp = {}\r\nk = []\r\nsum = 0\r\nst = input()\r\nfor i in range(len(st)):\r\n k.append(int(st[i]))\r\nmp = Counter(k)\r\nmp = dict(sorted(mp.items()))\r\n\r\nfor i, k in mp.items():\r\n sum += l1[i]*k\r\nprint(sum)\r\n", "a = list(map(int, input().split()))\r\ns = input()\r\ntotalCalories = 0\r\nfor char in s:\r\n strip = int(char)\r\n totalCalories += a[strip - 1]\r\nprint(totalCalories)\r\n", "mad=list(map(int,input().split()))\r\nbest=0\r\nmsg=input()\r\nfor z in msg:\r\n ans=int(z)-1\r\n best+=mad[ans]\r\nprint(best)", "a = list(map(int, input().split()))\r\ns = list(map(int, list(input())))\r\nans = 0\r\nfor i in range(len(s)):\r\n ans += a[s[i]-1]\r\nprint(ans)", "arr = list(map(int, input().split()))\r\ninp = input()\r\nsum = 0\r\nfor c in inp: sum += arr[int(c) - 1]\r\nprint(sum)", "calories = list(map(int, input().split()))\r\nlst = list(input())\r\nones = lst.count('1')\r\nseconds = lst.count('2')\r\nthirds = lst.count('3')\r\nfours = lst.count('4')\r\noneSum = calories[0] * ones\r\ntwoSum = calories[1] * seconds\r\nthirdSum = calories[2] * thirds\r\nfourSum = calories[3] * fours\r\nprint(oneSum + twoSum + thirdSum + fourSum)", "def calculate_calories(a, s):\r\n total_calories = 0\r\n \r\n for i in s:\r\n strip_index = int(i) - 1\r\n total_calories += a[strip_index]\r\n \r\n return total_calories\r\n\r\n# Read input\r\na = list(map(int, input().split()))\r\ns = input()\r\n\r\n# Calculate calories\r\nresult = calculate_calories(a, s)\r\n\r\n# Print the result\r\nprint(result)\r\n", "a1,a2,a3,a4=map(int,input().split())\r\nt=input()\r\nh=0\r\nfor i in t:\r\n if i==\"1\":\r\n h+=a1\r\n if i==\"2\":\r\n h+=a2\r\n if i==\"3\":\r\n h+=a3\r\n if i==\"4\":\r\n h+=a4\r\nprint(h)", "# __________________________\r\n# | { Meow Meow } |\r\n# |________________________|\r\n# \\(^ < ^)/\r\n# | | \r\n# |___| \r\n# | |\r\n# |_|_\r\ndef Solve():\r\n v = list(map(int,input().split())) \r\n c = 0\r\n for i in input():\r\n c+= v[int(i)-1]\r\n return c \r\n# _________________________________________________________________ # \r\ndef meow():\r\n # t = int(input())\r\n # while t != 0:\r\n # print(Solve())\r\n # t-=1\r\n print(Solve())\r\nmeow() \r\n\r\n", "n = list(map(int,input().split()))\r\nc,s = 0,input()\r\nc = s.count(\"1\") * n[0] + s.count(\"2\") * n[1] + s.count(\"3\") * n[2] + s.count(\"4\") * n[3]\r\nprint(c)", "\r\ncal = list(map(int, input().strip().split()))\r\ngame= input()\r\n\r\nans = game.count('1') * cal[0] + game.count('2') * cal[1]+ game.count('3') * cal[2] + game.count('4') * cal[3]\r\n\r\nprint(ans)", "a=list(map(int,input().split()))\r\ns=input()\r\nr=0\r\nfor i in s:\r\n r=r+a[int(i)-1]\r\nprint(r)", "a1, a2, a3, a4 = map(int,input().split())\r\ns = str(input())\r\ncal = 0\r\nfor i in range(len(s)):\r\n if s[i]==\"1\":\r\n cal += a1\r\n elif s[i]==\"2\":\r\n cal += a2\r\n elif s[i]==\"3\":\r\n cal += a3\r\n elif s[i]==\"4\":\r\n cal += a4\r\nprint(cal)", "\r\nls = list(map(int,input().split()))\r\ns = input()\r\nres=0\r\nfor i in s:\r\n res+=ls[int(i)-1]\r\nprint(res)", "\r\nw,x,y,z=map(int,input().split())\r\nn=(input())\r\nprint((w*n.count('1'))+(x*n.count('2'))+(y*n.count('3'))+(z*n.count('4')))", "\r\n\r\ny=input().split(' ')\r\na1=y[0]\r\na2=y[1]\r\na3=y[2]\r\na4=y[3]\r\nx=input()\r\nx1=x.count('1')\r\nx2=x.count('2')\r\nx3=x.count('3')\r\nx4=x.count('4')\r\n\r\np1=int(a1)*int(x1)\r\np2=int(a2)*int(x2)\r\np3=int(a3)*int(x3)\r\np4=int(a4)*int(x4)\r\n\r\nprint(p1+p2+p3+p4)\r\n\r\n", "c=list(map(int,input().split()))\r\ng=input()\r\nans=0\r\nfor i in g:\r\n ans +=c[int(i)-1]\r\nprint(ans)", "l=list(map(int,input().split()))\r\ns=str(input())\r\nso=0\r\nfor i in range(len(s)):\r\n n=int(s[i])-1\r\n so+=l[n]\r\nprint(so)", "num = input()\r\nnum = num.split(\" \")\r\narr = input()\r\nnum = [int(x) for x in num]\r\n\r\ncal = 0\r\n\r\nfor i in range(len(arr)):\r\n\tcal += num[int(arr[i])-1]\r\n\r\nprint(cal)", "l1=list(map(int,input().split()))[:4]\r\nn=input()\r\nsum=0\r\nfor i in n:\r\n sum=sum+l1[int(i)-1]\r\nprint(sum)", "cps=[int(_) for _ in input().split(' ')]\r\nsq=[int(X) for X in input()]\r\nfirstcount= sq.count(1)\r\nsecondcount=sq.count(2)\r\nthirdcount=sq.count(3)\r\nfourthcount=sq.count(4)\r\nprint(firstcount*cps[0]+secondcount*cps[1]+thirdcount*cps[2]+fourthcount*cps[3])", "*x,=map(int,input().split());print(sum(x[int(i)-1]for i in input()))", "def energyUsed(m, p):\r\n total = 0\r\n for i in positions:\r\n total += maping[i - 1]\r\n print(total)\r\n\r\nif __name__ == \"__main__\":\r\n maping = list(map(int, input().split(\" \")))\r\n positions = [int(i) for i in input()]\r\n energyUsed(maping, positions)", "cals = [int(a) for a in input().split(' ')]\nvals = [int(a) for a in list(input())]\n\nr = 0\nfor v in vals:\n i = v-1\n r += cals[i]\nprint(r)", "def main(arr, s):\r\n n = 0\r\n\r\n for i in range(len(s)):\r\n if s[i] == \"1\":\r\n n += arr[0]\r\n elif s[i] == \"2\":\r\n n += arr[1]\r\n elif s[i] == \"3\":\r\n n += arr[2]\r\n else:\r\n n += arr[3]\r\n\r\n return n\r\n\r\nif __name__ == \"__main__\":\r\n arr = list(map(int, input().split()))\r\n\r\n s = str(input())\r\n\r\n print(main(arr, s))", "# 431A\r\n''' Author : Kunj Gandhi '''\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\na1,a2,a3,a4 = sp_inp()\r\ns = str_inp()\r\ncal = 0\r\nfor i in s:\r\n if(i==\"1\"):\r\n cal+=a1\r\n elif(i==\"2\"):\r\n cal+=a2\r\n elif(i==\"3\"):\r\n cal+=a3\r\n else:\r\n cal+=a4\r\nprint(cal) ", "array = [int(x) for x in input().split(\" \")]\r\ns = input()\r\nans = 0\r\nfor i in s:\r\n ans += array[int(i)-1]\r\nprint(ans)", "a=list(map(int,input().split()))\r\nx=input()\r\nb=x.count(\"1\")*a[0]+x.count(\"2\")*a[1]+x.count(\"3\")*a[2]+x.count(\"4\")*a[3]\r\nprint(b)", "cost = [int(elem) for elem in input().split()]\nres = 0\nfor num in input():\n res += cost[int(num)-1] \nprint(res)\n", "a1,a2,a3,a4=map(int, input().split())\r\ns=input()\r\nt= 0\r\nfor i in s:\r\n if i=='1':\r\n t+=a1\r\n elif i=='2':\r\n t+=a2\r\n elif i=='3':\r\n t+=a3\r\n elif i=='4':\r\n t+=a4\r\nprint(t)\r\n", "a1, a2, a3, a4 = map(int, input().split())\r\ns = str(input())\r\nc = 0\r\nfor i in s:\r\n if i == \"1\":\r\n c += a1\r\n elif i == \"2\":\r\n c += a2\r\n elif i == \"3\":\r\n c += a3\r\n elif i == \"4\":\r\n c += a4\r\nprint(c)", "cal = input().split(\" \")\r\n\r\ng = input()\r\n\r\nc1 = c2 = c3 = c4 = 0\r\n\r\nfor i in g:\r\n if i == '1':\r\n c1 += 1\r\n elif i == '2':\r\n c2 += 1\r\n elif i == '3':\r\n c3 += 1\r\n elif i == '4':\r\n c4 += 1\r\n\r\nsum = (int(cal[0]) * c1) + (int(cal[1]) * c2) + (int(cal[2]) * c3) + (int(cal[3]) * c4)\r\n\r\nprint(sum)\r\n", "a = list(map(int, input().split()))\r\nl = input()\r\nans = 0\r\nfor c in l:\r\n ans += a[int(c)-1]\r\nprint(ans)", "*a,=map(int,input().split());print(sum(a[int(i)-1]for i in input()))", "a = list(map(int, input().split(' ')))\r\n\r\ns = list(map(int, input()))\r\n\r\ncal = 0\r\n\r\nfor i in s:\r\n cal += a[i - 1]\r\n\r\n\r\nprint(cal)", "def solution():\r\n a = list(map(int, input().split()))\r\n s = input()\r\n cal = 0\r\n for i in s:\r\n cal += a[int(i) - 1]\r\n print(cal)\r\nsolution()\r\n\r\n\r\n\r\n", "s = [int(i) for i in input().split()]\r\na = list(input())\r\nsumma = 0\r\nfor i in a:\r\n summa+=s[int(i)-1]\r\nprint(summa)\r\n", "a,b,c,d=input().split()\r\na=int(a)\r\nb=int(b)\r\nc=int(c)\r\nd=int(d)\r\ns=input()\r\ne=0\r\nfor i in range(len(s)):\r\n if s[i]==\"1\":\r\n e+=a \r\n elif s[i]==\"2\":\r\n e+=b\r\n elif s[i]==\"3\":\r\n e+=c\r\n else:\r\n e+=d\r\nprint(e)\r\n \r\n", "from sys import stdin,stdout\r\nfrom collections import Counter,defaultdict \r\n\r\ndef I(): return int(stdin.readline())\r\ndef II(): return map(int, stdin.readline().split())\r\ndef IL(): return list(map(int, stdin.readline().split()))\r\ndef SIL(): return sorted(map(int, stdin.readline().split()))\r\n\r\n\r\n\r\ndef solve():\r\n \r\n # write your code here \r\n a,b,c,d = II()\r\n nums = list(map(int,list(input())))\r\n count = Counter(nums)\r\n ans = 0\r\n if 1 in count: ans += count[1]*a \r\n if 2 in count: ans += count[2]*b \r\n if 3 in count: ans += count[3]*c \r\n if 4 in count: ans += count[4]*d \r\n \r\n return 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\nprint(solve())\r\n", "\n\ncaloires = input().split()\nsequences = input()\n\ndic = {}\n\nwasted_calories = 0\nfor i, j in enumerate(caloires):\n dic[str(i+1)] = int(j)\n\n\nfor seq in sequences:\n wasted_calories += dic[seq]\n\nprint(wasted_calories)", "def main():\r\n \r\n \r\n b = [0] + list(map(int, input().split()))\r\n d = [int(c) for c in input()]\r\n sum = 0\r\n for i in range(1, 5):\r\n sum += b[i] * d.count(i)\r\n print(sum)\r\n\r\nmain()\r\n", "a = list(map(int, input().split()))\r\ns = input()\r\nt = 0\r\nfor i in s:\r\n s = int(i) - 1 \r\n t += a[s]\r\nprint(t)\r\n", "import math\r\nri=lambda:map(int,input().split())\r\ndef f():\r\n a1,a2,a3,a4=ri()\r\n s=input()\r\n otv=0\r\n for i in s:\r\n if int(i)==1:\r\n otv+=a1\r\n elif int(i)==2:\r\n otv+=a2\r\n elif int(i)==3:\r\n otv+=a3\r\n else:\r\n otv+=a4\r\n print(otv) \r\nf()\r\n", "calories = list(map(int, input().split()))\r\ncal = 0\r\nsquares = list(str(int(input())))\r\n\r\nfor i in squares:\r\n cal += calories[int(i)-1]\r\nprint(cal)\r\n", "def inp():\r\n return(int(input()))\r\ndef inlt():\r\n return(list(map(int,input().split())))\r\ndef insr():\r\n s = input()\r\n return(list(s[:len(s) - 1]))\r\ndef invr():\r\n return(map(int,input().split()))\r\ndef solve(arr,s):\r\n total = 0\r\n for i in s:\r\n total += arr[i - 1]\r\n return total\r\n\r\nprint(solve(inlt(),map(int,list(input()))))", "l=[int(i) for i in input().split()]\r\ns=input()\r\ncount=0\r\nfor i in s:\r\n k=int(i)\r\n count+=l[k-1]\r\nprint(count)", "calories = list(map(int, input().split()))\r\ngame_string = input()\r\n\r\ntotal_calories = 0\r\n\r\nfor char in game_string:\r\n total_calories += calories[int(char)-1]\r\n\r\nprint(total_calories)", "calories = list(map(int, input().split()))\r\ngame = input()\r\n\r\ntotal = 0\r\nfor action in game:\r\n total += calories[int(action) - 1]\r\n\r\nprint(total)\r\n", "A = [int (x) for x in input().split() ]\r\n# A = [] \r\n# for x in range ( 0 , 4 ) : \r\n# num = input ().split() \r\n# A.append(int(num))\r\n\r\n\r\nstring = input () \r\n\r\nsum = 0 \r\nfor x in range ( 0 , len(string)) :\r\n sum += A[int(string[x])-1] \r\n\r\nprint(sum)\r\n", "l=list(map(int,input().split()))\r\ns=input()\r\ncal=0\r\nfor i in s:\r\n if i=='1':cal+=l[0]\r\n elif i=='2':cal+=l[1]\r\n elif i=='3':cal+=l[2]\r\n else:cal+=l[3]\r\nprint(cal)", "num_1= 4\r\nlist_1= [int(num_1) for num_1 in input().split(\" \", num_1)]\r\nnum_2= int(input())\r\nsum= 0\r\n\r\nfor i in (str(num_2)):\r\n sum+= list_1[int(i)-1]\r\nprint(sum)", "a,b,c,d=map(int,input().split())\r\nst=input()\r\nsum=0\r\nfor ele in st:\r\n ele=int(ele)\r\n if ele==1:\r\n sum+=a\r\n elif ele==2:\r\n sum+=b\r\n elif ele==3:\r\n sum+=c\r\n else:\r\n sum+=d\r\nprint(sum)", "# n = int(input())\r\n# lst = list(map(int, input().split()))\r\n# lst.sort()\r\n# print(*lst)\r\nlst = list(map(int, input().split()))\r\nst = input()\r\nsu = 0\r\nfor i in range(len(st)):\r\n su += lst[int(st[i])-1]\r\nprint(su)", "from sys import stdin, stdout\r\n\r\ncalories = [0] + list(map(int, stdin.readline().split()))\r\narr = list(map(int, stdin.readline().strip()))\r\nprint(sum(map(lambda x: calories[x], arr)))\r\n", "v = [int(i) for i in input().split()]\r\nm = [int(i) for i in input()]\r\nca = 0\r\nfor i in range(len(m)):\r\n if m[i] == 1:\r\n ca += v[0]\r\n if m[i] == 2:\r\n ca += v[1]\r\n if m[i] == 3:\r\n ca += v[2]\r\n if m[i] == 4:\r\n ca += v[3]\r\n\r\nprint(ca)", "t= input().split()\nc= 0\nfor i in input():\n c+= int(t[int(i)- 1])\nprint(c)\n", "a,b,c,d=map(int, input().split())\r\nstr=input()\r\nsum=0\r\nfor i in str:\r\n if i=='1':\r\n sum=sum+a\r\n elif i=='2':\r\n sum=sum+b\r\n elif i=='3':\r\n sum=sum+c\r\n else:\r\n sum=sum+d\r\nprint(sum)\r\n", "cal = list(map(int, input().split()))\r\nsqs = list(input())\r\n\r\nsum = 0\r\nfor sq in sqs:\r\n sum += cal[int(sq) - 1]\r\n\r\nprint(sum)", "a,b,c,d=map(int,input().split());s=input();x=0\r\nfor i in s:\r\n\tif i=='1': x+=a\r\n\telif i=='2': x+=b\r\n\telif i=='3': x+=c\r\n\telse: x+=d\r\nprint(x)", "calo_burned=list(map(int,input().split()))\r\ntouch_record=list(map(int,list(input())))\r\noutput=0\r\nfor i in range(1,5):\r\n output+=touch_record.count(i)*calo_burned[i-1]\r\nprint(output)", "\r\n\r\ndef solve():\r\n calories_value = {}\r\n for k, v in enumerate(input().split()):\r\n calories_value.update({str(k+1): int(v)})\r\n numbers_string = input()\r\n return sum([calories_value[i] for i in numbers_string])\r\n\r\n\r\nprint(solve())\r\n", "a = list(map(int, input().split()))\r\n\r\ns = input()\r\n\r\nresult = 0\r\n\r\nfor i in range(len(s)):\r\n idx = int(s[i]) - 1\r\n result += a[idx]\r\n\r\nprint(result)", "a=list(map(int,input().split()))\r\nl=list(map(int,input()))\r\ns=0\r\nfor i in range(len(l)):\r\n s+=a[l[i]-1]\r\nprint(s)", "x=[int(i) for i in input().split()]\r\ny=input()\r\nsum=0\r\nfor i in range(len(x)):\r\n sum+=y.count(f\"{i+1}\")*x[i]\r\nprint(sum)", "a=list(map(int,input().split())) \r\nb=list(map(int,*(input().split()))) \r\ncount=0\r\nfor i in b:\r\n if i==1:\r\n count+=a[0]\r\n elif i==2:\r\n count+=a[1]\r\n elif i==3:\r\n count+=a[2]\r\n else:\r\n count+=a[3]\r\n\r\nprint(count)\r\n", "a = [int(i) for i in input().split()]\r\ns = input()\r\nans=0\r\nfor i in s:\r\n ans+=a[int(i)-1]\r\nprint(ans)", "asList=[int(i) for i in input().split()]\r\nsteps=input()\r\nres=0\r\nfor i in range(len(asList)):\r\n res+= asList[i]*steps.count(str(i+1))\r\nprint(res)", "a = list(map(int, input().split()))\r\n\r\ns = list(map(int, input()))\r\n\r\nsum =0\r\nfor string in s:\r\n sum += a[string-1]\r\n\r\nprint(sum)\r\n", "a1, a2, a3, a4 = map(int, input().split())\r\nn = input()\r\nx = list(n)\r\nc1 = x.count(\"1\")\r\nc2 = x.count(\"2\")\r\nc3 = x.count(\"3\")\r\nc4 = x.count(\"4\")\r\nprint(a1*c1+a2*c2+a3*c3+a4*c4)", "a,b,c,d=map(int,input().split())\r\ns=input()\r\nsum=0 \r\nfor i in range(len(s)):\r\n if(s[i]=='1'):\r\n sum+=a \r\n elif(s[i]=='2'):\r\n sum+=b \r\n elif(s[i]=='3'):\r\n sum+=c \r\n elif(s[i]=='4'):\r\n sum+=d \r\nprint(sum) ", "from math import *\r\n'''@avtor---NABIEVMEHRUBON---'''\r\nh = 'hello'\r\nf = 'abcdefghijklmnopqrstuvwxyz'\r\na = [int(i) for i in input().split()]\r\ns = input()\r\nsum_ = 0\r\nfor i in range(len(s)):\r\n sum_ += a[int(s[i])-1]\r\nprint(sum_)\r\n", "lost_calories_per_strip = list(map(int, input().split(' ')))\r\nstrip_touch_sequence = input()\r\nprint(sum(lost_calories_per_strip[int(i) - 1] for i in strip_touch_sequence))\r\n", "a,b,c,d=map(int,input().split())\r\ns = input()\r\ncount = s.count('1')*a + s.count('2')*b + s.count('3')*c + s.count('4')*d\r\nprint(count)\r\n \r\n", "l = [int(x) for x in input().split()]\r\ns = input()\r\nsum = 0\r\nfor i in range(0,len(s)):\r\n a =int(s[i])\r\n sum = sum + l[a-1]\r\n\r\nprint(sum)", "mm = [int(i) for i in input().split()]\r\nmmm = input()\r\nmmmm = 0\r\nfor i in range(len(mmm)):\r\n mmmm += mm[int(mmm[i]) - 1]\r\nprint(mmmm)", "s=list(map(int,input().split()))\r\nx=input()\r\nprint(x.count('1')*s[0] + x.count('2')*s[1] + x.count('3')*s[2] + x.count('4')*s[3])", "a = list(map(int,input().split()))\r\nn = list(map(int,input()))\r\nz = 0\r\nfor i in range(len(n)):\r\n b = n[i]\r\n z += a[b-1]\r\nprint(z)", "a, b, c, d = map(int, input().split())\r\nsequence = list(int(a) for a in input())\r\nca, cb = sequence.count(1), sequence.count(2)\r\ncc, cd =sequence.count(3), sequence.count(4)\r\nprint(int(a)*ca+int(b)*cb+int(c)*cc+int(d)*cd)", "x=tuple(map(int,input().split()))\r\nm=input()\r\nz=0\r\nfor i in m:\r\n\tc=int(i)\r\n\tz+=x[c-1]\r\nprint(z)\t\r\n\r\n", "s = list(map(int,input().split()))\nst = input()\nsm = 0\nfor i in st:\n sm = sm + s[int(i)-1]\nprint(sm)", "ws=input().split(\" \"); ws=[int(x) for x in ws]\r\ns=input()\r\nt=0\r\nfor i in range(len(s)):\r\n if int(s[i])==1:\r\n t+=ws[0]\r\n elif int(s[i])==2:\r\n t+=ws[1]\r\n elif int(s[i])==3:\r\n t+=ws[2]\r\n elif int(s[i])==4:\r\n t+=ws[3]\r\nprint(t)\r\n", "a=input()\r\nb=input()\r\na=a.split(\" \")\r\na=list(map(int, a))\r\nsum=0\r\nfor i in range(0,len(b)):\r\n j=int(b[i])\r\n sum=sum+a[j-1]\r\nprint(sum)", "a1,a2,a3,a4 = map(int,input().split())\r\nstr=input()\r\n\r\nresult=0\r\n\r\nfor i in str:\r\n if i=='1':\r\n result=result+a1\r\n if i=='2':\r\n result=result+a2\r\n if i=='3':\r\n result=result+a3\r\n if i=='4':\r\n result=result+a4\r\n\r\nprint(result)", "cal = list(map(int, input().split()))\r\nstrn = input()\r\nsum_list = []\r\nfor i in strn:\r\n if(i == \"1\"):\r\n sum_list.append(cal[0])\r\n elif(i == \"2\"):\r\n sum_list.append(cal[1])\r\n elif(i == \"3\"):\r\n sum_list.append(cal[2])\r\n elif(i == \"4\"):\r\n sum_list.append(cal[3])\r\nprint(sum(sum_list))", "a = list(map(int,input().split()))\r\nprocess = list(input())\r\n\r\ns = 0\r\nfor i in range(len(process)):\r\n s += a[int(process[i]) - 1]\r\n\r\nprint(s)\r\n", "a, b, c, d = map(int, input().split())\r\ne = input()\r\nans = 0\r\nfor i in range(len(e)):\r\n if e[i] == '1':\r\n ans += a\r\n elif e[i] == '2':\r\n ans += b\r\n elif e[i] == '3':\r\n ans += c\r\n else:\r\n ans += d\r\nprint(ans)\r\n", "calories = list(map(int, input().split()))\r\ns = input()\r\n\r\ntotal_calories = 0\r\n\r\nfor char in s:\r\n strip_number = int(char)\r\n total_calories += calories[strip_number - 1]\r\n\r\nprint(total_calories)\r\n", "numlist=list(map(int,input().split()))\r\ns=input()\r\ncalSum = 0\r\nfor i in s:\r\n calSum+= numlist[int(i)-1]\r\nprint(calSum)", "from collections import defaultdict\r\ncal = list(map(int,input().split()))\r\nprocess = input()\r\ndic = defaultdict(int)\r\nfor k,v in enumerate(cal):\r\n dic[k + 1] = v\r\ntot = 0\r\n\r\nfor i in process:\r\n tot += dic[int(i)]\r\n \r\nprint(tot)", "al = list(map(int,input().split()))\r\ns = input()\r\ncounter = 0\r\nfor i in range(len(s)):\r\n counter += al[int(s[i]) - 1]\r\nprint(counter)", "x=[int(n) for n in input().split()]\r\n\r\nm=input()\r\nsum=0\r\nfor i in m:\r\n l=int(i)\r\n sum+=x[l-1]\r\nprint(sum)", "lst = []\r\nlst = input().split()\r\ns = input()\r\n\r\nsum = 0\r\nfor i in range(len(s)):\r\n if s[i]==\"1\":\r\n sum = sum + int(lst[0])\r\n elif s[i]==\"2\":\r\n sum = sum + int(lst[1])\r\n elif s[i]==\"3\":\r\n sum = sum + int(lst[2])\r\n else:\r\n sum = sum + int(lst[3])\r\n\r\nprint(sum)", "# Codeforces - Black Square\r\n\r\n# Link : https://codeforces.com/contest/431/problem/A\r\n\r\nclass BlackSquareGame:\r\n def __init__(self, caloriesDistribtion: list, gameState: list) -> None:\r\n self.__caloriesDistribtion = dict(enumerate(caloriesDistribtion, 1))\r\n self.__gameState = gameState\r\n\r\n def calculateWastedCalories(self):\r\n wastedCalories = 0\r\n for move in self.__gameState:\r\n wastedCalories += self.__caloriesDistribtion[move]\r\n return wastedCalories\r\n\r\n\r\ndef main():\r\n caloriesDistribtion = list(map(int, input().split(\" \")))\r\n gameState = list(map(int, list(input())))\r\n blackSquareGame = BlackSquareGame(caloriesDistribtion, gameState)\r\n print(blackSquareGame.calculateWastedCalories())\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "arr = list(map(int, input().split()))\r\ns = input()\r\ndata = {\r\n \"1\": arr[0],\r\n \"2\": arr[1],\r\n \"3\": arr[2],\r\n \"4\": arr[3]\r\n}\r\n\r\nans = 0\r\n\r\nfor i in s:\r\n ans += data[i]\r\n\r\nprint(ans)", "mas = list(map(int, input().strip().split(' ')))\r\n\r\nstr_ = input().strip()\r\n\r\ns = 0\r\nfor i in str_:\r\n k = int(i)\r\n s += mas[k-1]\r\n \r\nprint(s)", "l = [int(x) for x in input().split()]\r\nprint(sum([l[int(x)-1] for x in input()]))", "#27 A\r\n\r\nstatus=input().split()\r\nnums=[]\r\nfor i in status:\r\n nums.append(int(i))\r\nclick=input()\r\ncalories=0\r\nfor i in click:\r\n if i ==\"1\":calories +=nums[0]\r\n elif i ==\"2\":calories +=nums[1]\r\n elif i ==\"3\":calories +=nums[2]\r\n elif i ==\"4\":calories +=nums[3]\r\nprint(calories)\r\n", "if __name__ == '__main__':\r\n l_a = list(map(int, input().split()))\r\n s = input()\r\n t_c = 0\r\n\r\n for c in s:\r\n t_c += l_a[int(c) - 1]\r\nprint(t_c)", "#number of the calories.\r\nn=input()\r\nns=n.split()\r\n#the split on the screen\r\nsplit=input()\r\n\r\n#variables for each split\r\none = 0\r\ntwo = 0\r\nthree = 0\r\nfour = 0\r\n#the sum of all calories\r\ncalories = 0\r\nfor i in range(len(split)):\r\n if int(split[i]) == 1:\r\n one += 1\r\n elif int(split[i]) == 2:\r\n two += 1\r\n elif int(split[i]) == 3:\r\n three += 1\r\n else:\r\n four += 1\r\n\r\ncalories += int(ns[0])*one + int(ns[1])*two +int(ns[2])*three + int(ns[3])*four\r\nprint(calories)", "import sys\r\nimport math\r\n\r\n\r\ndef II(): return int(sys.stdin.readline())\r\ndef LI(): return list(map(int, sys.stdin.readline().split()))\r\ndef LS(): return sys.stdin.readline().strip().split()\r\ndef SI(): return sys.stdin.readline().strip()\r\ndef MIN_INT(): return -1 * sys.maxsize\r\ndef MAX_INT(): return sys.maxsize\r\ndef prefSum(arr, n):\r\n P = [0] * (n + 1)\r\n for k in range(1, n + 1):\r\n P[k] = P[k - 1] + arr[k - 1]\r\n return P\r\n\r\n\r\n''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''\r\n\r\n\r\ndef solve():\r\n a, b, c, d = LI()\r\n s = list(SI())\r\n ans = 0\r\n for i in s:\r\n if i == '1':\r\n ans += a; continue\r\n if i == '2':\r\n ans += b; continue\r\n if i == '3':\r\n ans += c; continue\r\n if i == '4':\r\n ans += d; continue\r\n print(ans); return\r\n\r\n\r\ndef main():\r\n \"\"\"\r\n t = II()\r\n for _ in range(t):\r\n solve()\r\n \"\"\"\r\n solve()\r\n\r\n\r\nmain()\r\n", "a = list(map(int, input().split()))\r\ns = input()\r\nresult = sum(map(lambda x: a[int(x)-1], s))\r\nprint(result)", "a1,a2,a3,a4=map(int,input().split())\nm=input()\na,b,c,d=0,0,0,0\nfor i in range(len(m)):\n if m[i]=='1':\n a+=1 \n elif m[i]=='2':\n b+=1 \n elif m[i]=='3':\n c+=1 \n else:\n d+=1 \nprint(a1*a+a2*b+a3*c+a4*d)\n\t\t \t\t \t \t \t\t\t\t\t \t \t", "a = list(map(int,input().split()))\r\ns = str(input()); k = 0\r\nfor i in s:\r\n k+=a[int(i)-1]\r\nprint(k)\r\n\t\t\t\t\t\t\t \t\t\t \t \t \t\t \t\t\t", "a,b,c,d=[int(i) for i in input().split()]\r\nstr=input()\r\np=str.count('1')\r\nq=str.count('2')\r\nr=str.count('3')\r\ns=str.count('4')\r\nans=(a*p)+(b*q)+(c*r)+(d*s)\r\nprint(ans)", "s = list(map(int, input().split()))\r\nk = 0\r\nfor i in map(int, input()):\r\n k += s[i - 1]\r\nprint(k)\r\n", "a,b,c,d=map(int,input().split())\r\ns=input()\r\nr=0\r\nfor i in range(len(s)):\r\n if s[i]=='1':\r\n r+=a\r\n if s[i]=='2':\r\n r+=b\r\n if s[i]=='3':\r\n r+=c\r\n if s[i]=='4':\r\n r+=d\r\nprint(r)\r\n ", "a = list(map(int, input().split()))\r\nans = 0\r\nfor i in input():\r\n ans+=a[int(i)-1]\r\nprint(ans)", "n = list(map(int , input().split()))\r\ns = input()\r\n\r\nc = 0\r\nfor i in s:\r\n if i == \"1\":\r\n c +=n[0]\r\n elif i == \"2\":\r\n c +=n[1]\r\n elif i == \"3\":\r\n c +=n[2]\r\n elif i == \"4\":\r\n c +=n[3]\r\nprint(c)", "a,b,c,d = [int(i) for i in input().split()]\r\ns = input()\r\nres = 0\r\nfor i in range(len(s)):\r\n if s[i] == \"1\":\r\n res += a\r\n elif s[i] == \"2\":\r\n res += b\r\n elif s[i] == \"3\":\r\n res += c\r\n elif s[i] == \"4\":\r\n res += d\r\nprint(res) ", "a, b, c, d = list(map(int,input().split()))\r\ns = str(input())\r\n\r\nans = 0\r\nfor i in s:\r\n if i == '1':\r\n ans += a\r\n elif i == '2':\r\n ans += b\r\n elif i == '3':\r\n ans += c\r\n else:\r\n ans += d\r\n\r\nprint(ans)", "n = [int(i) for i in input().split()]\r\n\r\nl = input()\r\n\r\nres = 0\r\n\r\nfor x in l:\r\n if x == \"1\":\r\n res = res + n[0]\r\n elif x == \"2\":\r\n res = res + n[1]\r\n elif x == \"3\":\r\n res = res + n[2]\r\n else:\r\n res = res + n[3]\r\n\r\nprint(res)", "calories = list(map(int, input().split()))\r\ngame_string = input()\r\n\r\ntotal_calories = 0\r\nfor char in game_string:\r\n strip_index = int(char) - 1 \r\n total_calories += calories[strip_index]\r\n\r\nprint(total_calories)\r\n", "a,b,c,d = list(map(int, input().split()))\r\ns = input()\r\nsum = 0\r\nfor i in s:\r\n if(i == '1'):\r\n sum+=a\r\n elif(i == '2'):\r\n sum+=b\r\n elif(i=='3'):\r\n sum+=c\r\n else:\r\n sum+=d\r\n \r\nprint(sum)", "a,b,c,d=map(int,input().split())\r\ns=input()\r\nr=0\r\nfor i in s:\r\n if i=='1':\r\n r+=a\r\n elif i=='2':\r\n r+=b\r\n elif i=='3':\r\n r+=c\r\n else:\r\n r+=d\r\nprint(r)", "a, b, c, d = map(int, input().split())\r\nstr = input()\r\none = str.count('1')\r\ntwo = str.count('2')\r\nthree = str.count('3')\r\nfour = str.count('4')\r\nres = one*a+two*b+three*c+four*d\r\nprint(res)\r\n", "r=0\r\na,b,c,d=map(int,input().split())\r\nl=input()\r\nfor i in range(len(l)):\r\n v=l[i]\r\n if v=='1':\r\n r+=a\r\n elif v=='2':\r\n r+=b\r\n elif v=='3':\r\n r+=c\r\n else:\r\n r+=d\r\nprint(r)\r\n", "a = list(map(int, input().split()))\r\ns = [*input()]\r\nc = {'1':a[0], '2':a[1], '3':a[2], '4':a[3]}\r\n \r\nsu = 0\r\nfor i in s:\r\n su+=c[i]\r\n \r\nprint(su)\r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n ", "# 코드포스 431A Black Square\r\nimport sys\r\nput = sys.stdin.readline\r\n\r\na = list(map(int, put().split()))\r\ns = put().strip()\r\nanswer = 0\r\n\r\nfor i in s:\r\n answer += a[int(i) - 1]\r\n\r\nprint(answer)", "l=list(map(int,input().split()))\r\ns=input()\r\np=0\r\nfor i in s:\r\n p+=l[int(i)-1]\r\nprint(p)\r\n \r\n", "a1, a2, a3, a4 = map(int, input().split())\r\nd = {'1': a1, '2': a2, '3': a3, '4': a4}\r\ns = str(input())\r\nans = 0\r\nfor el in s:\r\n ans += d.get(el)\r\nprint(ans)", "a = input().split()\r\nfor i in range(0,len(a)):\r\n a[i] = int(a[i])\r\ns = input()\r\ncount = 0\r\nfor i in range(0,len(s)):\r\n if s[i] == '1':\r\n count += a[0]\r\n elif s[i] == '2':\r\n count += a[1]\r\n elif s[i] == '3':\r\n count += a[2]\r\n else:\r\n count += a[3]\r\nprint(count)\r\n", "a1,a2,a3,a4=[int(x) for x in input().split()]\r\ns = input()\r\n\r\ntotal_calories=0\r\n\r\nfor char in s:\r\n strip_number = int(char)\r\n if strip_number == 1:\r\n total_calories += a1\r\n elif strip_number == 2:\r\n total_calories += a2\r\n elif strip_number == 3:\r\n total_calories += a3\r\n elif strip_number == 4:\r\n total_calories += a4\r\n\r\nprint(total_calories)", "cals = [int(x) for x in input().split()]\ngame = input()\ntotal = 0 \nfor each in game :\n total += cals[int(each)-1]\nprint(total)\n\t\t\t\t\t\t \t\t \t\t \t\t \t \t\t\t\t\t", "a1,a2,a3,a4=map(int,input().split())\r\nl=list(input())\r\nprint(int(a1*l.count('1')+a2*l.count('2')+a3*l.count('3')+a4*l.count('4')))", "a = [int(s) for s in input().split()]\r\ns = input()\r\nres = 0\r\nfor i in range(len(s)):\r\n res += a[int(s[i])-1]\r\nprint(res)", "calorie=list(map(int, input().split()))\r\nmassiv=input()\r\ncalories=0\r\nfor i in massiv:\r\n index=int(i)-1\r\n calories+=calorie[index]\r\n \r\nprint(calories)", "def calculate_waste(a_values, boxes):\r\n total_waste = 0\r\n for box in boxes:\r\n total_waste += a_values[int(box) - 1]\r\n return total_waste\r\n\r\nif __name__ == \"__main__\":\r\n a_values = list(map(int, input().split()))\r\n boxes = input()\r\n print(calculate_waste(a_values, boxes))\r\n", "calories = list( map(int , input().split()) )\r\nmoves = input()\r\n\r\nlosed_calories = 0\r\nfor move in moves:\r\n losed_calories += calories[int(move) - 1]\r\n\r\nprint(losed_calories)\r\n", "a = list(map(int, input().split()))\r\ns = input()\r\n\r\nnumbers = map(str, list(range(1, len(a) + 1)))\r\n\r\nval_dict = dict(zip(numbers, a))\r\n\r\ncalories = 0\r\nfor i in s:\r\n calories += val_dict[i]\r\n\r\nprint(calories)", "a, b, c, d = map(str, input().split())\r\n\r\nclicks = input()\r\ncalorie = 0\r\nfor click in clicks:\r\n if click == '1':\r\n calorie += int(a)\r\n elif click == '2':\r\n calorie += int(b)\r\n elif click == '3':\r\n calorie += int(c)\r\n elif click == '4':\r\n calorie += int(d)\r\nprint(calorie)", "read = list(map(int, input().split()))\r\nread2 = input()\r\nres=[]\r\nfor i in range(len(read2)):\r\n res.append(int(read2[i]))\r\ncount=0\r\nfor i in res:\r\n count+=read[i-1]\r\nprint(count)\r\n\r\n\r\n\r\n\r\n", "\r\nstrips = list(map(int , input().split()))\r\nmoving = input()\r\ncalures=0\r\n\r\nfor x in moving:\r\n calures += strips[int(x)-1]\r\n\r\nprint(calures) ", "a = list(map(int, input().split()))\r\nx = input()\r\nprint(a[0] * x.count('1') + a[1] * x.count('2') + a[2] * x.count('3') + a[3] * x.count('4'))", "import sys\r\ndef inp() : return sys.stdin.readline().strip()\r\ndef get_ints(): return map(int, inp().strip().split())\r\ndef get_arr(): return list(map(int, inp().strip().split()))\r\ndef get_int(): return int(inp())\r\na=get_arr()\r\ns=list(inp())\r\ncal=0\r\nfor c in s:\r\n cal+=a[int(c)-1]\r\nprint(cal)", "nums=list(map(int,input().split()))\r\nposition=input()\r\ns=0\r\nfor i in position:\r\n s+=nums[int(i)-1]\r\nprint(s) \r\n ", "a = list(map(int, input().split()))\r\n\r\nseq = str(input())\r\n\r\ntotal = 0\r\n\r\nfor i in seq:\r\n if i == '1':\r\n total += a[0]\r\n elif i == '2':\r\n total += a[1]\r\n elif i == '3':\r\n total += a[2]\r\n elif i == '4':\r\n total += a[3]\r\n\r\nprint(total)", "a = input().split()\r\ns = input()\r\nt = 0\r\nfor i in range(len(s)):\r\n t += int(a[int(s[i]) - 1])\r\nprint(t)", "\r\nc = list(map(int, input().split()))\r\ns = input()\r\n\r\nt_c = 0\r\n\r\n\r\nfor char in s:\r\n strip_index = int(char) - 1 \r\n t_c += c[strip_index]\r\n\r\n\r\nprint(t_c)\r\n", "def calculate_calories(a, s):\r\n calories = 0\r\n for char in s:\r\n strip_index = int(char) - 1\r\n calories += a[strip_index]\r\n return calories\r\na = list(map(int, input().split()))\r\ns = input()\r\nresult = calculate_calories(a, s)\r\nprint(result)\r\n ", "a=[int(x) for x in input().split()]\r\ns=input()\r\nc=0\r\nfor i in s:\r\n c+=a[int(i)-1]\r\nprint(c)", "screens = input()\r\nscreens = screens.split()\r\nturns = input()\r\ncalories = 0\r\nfor any in turns:\r\n calories = calories + int(screens[int(any)-1])\r\nprint(calories)", "array = tuple (map (int, input ().split (' ')))\r\nstring = input ()\r\ncalories = 0\r\nfor char in string:\r\n calories += array [int (char) - 1]\r\nprint (calories)", "list1=list(map(int,input().split()))\r\nstr1=input()\r\nsum=0\r\nfor x in str1:\r\n if int(x)==1:\r\n sum+=list1[0]\r\n elif int(x)==2:\r\n sum+=list1[1]\r\n elif int(x)==3:\r\n sum+=list1[2]\r\n else:\r\n sum+=list1[3]\r\nprint(sum)", "liste=list(map(int,input().split(\" \")))\r\nstr=input()\r\nresult=0\r\nfor i in str:\r\n result+=liste[int(i)-1]\r\nprint(result)", "# Read input\r\ncalories = list(map(int, input().split()))\r\ngame = input()\r\n\r\n# Initialize total calories\r\ntotal_calories = 0\r\n\r\n# Calculate total calories based on the game string\r\nfor char in game:\r\n strip_number = int(char)\r\n total_calories += calories[strip_number - 1]\r\n\r\n# Print the total calories\r\nprint(total_calories)\r\n", "import sys\r\ninput = lambda : sys.stdin.readline().strip()\r\n#############################################################################################################################\r\na,b,c,d = map(int,input().split())\r\ns = input()\r\ncount = 0\r\nfor i in s:\r\n if i == '1':\r\n count += a\r\n elif i == '2':\r\n count += b\r\n elif i == '3':\r\n count += c\r\n else:\r\n count += d\r\nprint(count)\r\n", "# Black Square\r\ns1 = input().split(\" \")\r\ns1 = [int(i) for i in s1]\r\ns2 = input()\r\nsum = 0\r\nfor i in range(len(s2)):\r\n sum += s1[int(s2[i])-1]\r\nprint(sum)", "a = list(map(int, input().split()))\r\ns = input()\r\ncount = 0\r\nfor i in s:\r\n count += a[int(i)-1]\r\nprint(count)", "x=input()\r\nx=x.split()\r\nn=input()\r\nsum=0\r\nfor i in n:\r\n sum+=int(x[int(i)-1])\r\nprint(sum)", "a=input().split()\r\nn=list(map(int,a))\r\nd={}\r\nc=0\r\ns=input()\r\ns=[int(x) for x in s]\r\nfor i in range(len(n)):\r\n d.update({i+1:n[i]})\r\nfor i in s:\r\n c+=d[i]\r\nprint(c)", "# -*- coding: utf-8 -*-\n\"\"\"1374A.ipynb\n\nAutomatically generated by Colaboratory.\n\nOriginal file is located at\n https://colab.research.google.com/drive/1YAcE_C3NXDvEY0NY_rHyte8StemSWBIK\n\"\"\"\n\na,b,c,d=map(int,input().split())\ns=input()\nsum=0\nfor i in s:\n if i=='1':\n sum+=a\n if i=='2':\n sum+=b\n if i=='3':\n sum+=c\n if i=='4':\n sum+=d\nprint(sum)", "l=list(map(int,input().split()))\r\ns=input()\r\nw=0\r\nfor i in s:\r\n w=w+l[int(i)-1]\r\nprint(w)", "a,b,k,t = map(int,input().split())\r\nls = [a,b,k,t]\r\ns = input()\r\nres = 0\r\nfor i in range(len(s)):\r\n res += ls[int(s[i])-1]\r\n\r\nprint(res)\r\n", "a1,a2,a3,a4 = map(int,input().split())\r\nb = input()\r\nk = 0\r\nfor i in b:\r\n if int(i) == 1:\r\n k+=a1\r\n elif int(i) == 2:\r\n k+=a2\r\n elif int(i) == 3:\r\n k+=a3\r\n elif int(i)==4:\r\n k+=a4\r\nprint(k)", "a,b,c,d=map(int,input().split())\ne=list(input())\nf=0\nf+=(e.count('1')*a)\nf+=(e.count('2')*b)\nf+=(e.count('3')*c)\nf+=(e.count('4')*d)\nprint(f)", "v1, v2, v3, v4 = [int(i) for i in input().split()]\r\ns = input()\r\nd = {\r\n '1': v1,\r\n '2': v2,\r\n '3': v3,\r\n '4': v4\r\n}\r\nans = 0\r\nfor c in s:\r\n ans += d.get(c)\r\nprint(ans)\r\n", "a=[int(x) for x in input().split()]\r\ns=input()\r\nk=0\r\nfor i in s:\r\n if i=='1':\r\n k+=a[0]\r\n elif i=='2':\r\n k+=a[1]\r\n elif i == '3':\r\n k += a[2]\r\n else:\r\n k+=a[3]\r\nprint(k)", "kalorijas = list(map(int, input().split()))\r\nspele = input()\r\natbilde = spele.count('1') * kalorijas[0] + spele.count('2') * kalorijas[1] + spele.count('3')* kalorijas[2] + spele.count('4') * kalorijas[3]\r\nprint(atbilde)", "t = input()\r\ns = input()\r\na = {str(i+1): int(t.split()[i]) for i in range(4)}\r\notvet = sum([a[i] for i in s])\r\nprint (otvet)", "n = [ int(i) for i in input().split()] \r\nm = [int (i) for i in input()]\r\nr = 0\r\nfor s in m : \r\n r+=n[s-1]\r\nprint(r)", "a = [int(x) for x in input().split()]\r\ns = list(int(x) for x in input())\r\nb = 0\r\nfor i in s:\r\n b+=a[i-1]\r\nprint(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\nimport sys\r\nfrom math import gcd, sqrt\r\n\r\n# Constants\r\nINF = float('inf')\r\nMOD = 1000000007\r\n\r\n# Faster Input\r\ndef read_int():\r\n return int(sys.stdin.readline())\r\n\r\ndef read_n_int():\r\n return map(int, sys.stdin.readline().split())\r\n\r\ndef read_ints():\r\n return list(map(int, sys.stdin.readline().split()))\r\n\r\n\r\n# Faster Output\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\n# Main Function\r\ndef solve():\r\n a = read_ints()\r\n s = list(input())\r\n\r\n calories = 0\r\n for i in s:\r\n calories += a[int(i)-1]\r\n\r\n print(calories)\r\n\r\n\r\nif __name__ == '__main__':\r\n solve()\r\n", "l=list(map(int,input().split()))\r\ns=input()\r\nsum=0\r\nfor i in range(len(s)):\r\n x=int(s[i])\r\n sum=sum+l[x-1]\r\nprint(sum)\r\n \r\n", "a1, a2, a3, a4 = map(int, input().split())\r\ns = input()\r\ns = list(s)\r\nfor i in range(len(s)):\r\n r = s[i]\r\n if r == '1':\r\n s[i] = a1\r\n elif r == '2':\r\n s[i] = a2\r\n elif r == '3':\r\n s[i] = a3\r\n elif r == '4':\r\n s[i] = a4\r\nprint(sum(s))", "import math\r\nfrom sys import stdin, stdout\r\n\r\n# for i in range(0, int(input()), 1):\r\np = [int(x) for x in stdin.readline().split()]\r\na = input()\r\nanswer = 0\r\nfor element in range (0, len(a), 1):\r\n answer += p[int(a[element]) - 1]\r\nprint(answer)", "cal = dict()\r\ncal[1], cal[2], cal[3], cal[4] = list( map(int, input().split()) )\r\nstrips = input()\r\ntot_cal = 0\r\n\r\nfor i in strips:\r\n tot_cal += cal[int(i)]\r\n\r\nprint(tot_cal)\r\n\r\n", "a1,a2,a3,a4=map(int,input().split())\r\ns=input()\r\nans=0\r\nfor i in range(len(s)):\r\n if s[i]=='1':\r\n ans+=a1\r\n elif s[i]=='2':\r\n ans+=a2\r\n elif s[i]=='3':\r\n ans+=a3\r\n else:\r\n ans+=a4\r\nprint(ans)", "a = list(map(int,input().split()))\r\ns = list(input())\r\nss = 0\r\nfor i in s:\r\n ss += a[int(i)-1]\r\nprint(ss)", "def solve(P):\r\n a = list(map(int, input().split()))\r\n s = input()\r\n p = 0\r\n for i in s:\r\n p += a[int(i)-1]\r\n \r\n print(p)\r\n\r\n# for _ in range(int(input())):\r\n# solve(_)\r\n\r\nsolve(1)\r\n", "a1,a2,a3,a4 = [int(i) for i in input().split()]\r\n\r\ns = input()\r\n\r\nanswer = 0\r\n\r\nfor i in s:\r\n if i == \"1\":\r\n answer += a1\r\n if i == \"2\":\r\n answer += a2\r\n if i == \"3\":\r\n answer += a3\r\n if i == \"4\":\r\n answer += a4\r\nprint(answer)\r\n", "cal = input()\r\nseq = input()\r\ncal_list = cal.split()\r\ntotal_cal = 0\r\nfor i in seq:\r\n total_cal += int(cal_list[int(i)-1])\r\nprint(total_cal)", "a= list(map(int,input().split()))\r\ns = input()\r\nb = [int(i) for i in s]\r\nk = 0\r\nfor i in range(len(b)):\r\n k += a[b[i]-1]\r\n\r\nprint(k)\r\n\r\n \r\n ", "a = [int(x) for x in input().split()]\ns = input()\ncal = 0\nfor i in range(len(s)):\n if s[i] == '1':\n cal += a[0]\n elif s[i] == '2':\n cal += a[1]\n elif s[i] == '3':\n cal += a[2]\n elif s[i] == '4':\n cal += a[3]\nprint(cal)\n \t\t \t\t\t\t\t \t\t \t \t\t \t \t", "listt = list(map(int,input().split()))\r\ndictt = {\"1\":listt[0],\"2\":listt[1],\"3\":listt[2],\"4\":listt[3]}\r\nlisttt = list(map(lambda x:dictt[x],list(input())))\r\nprint(sum(listtt))", "a,b,c,d = map(int,input().split())\r\nsum = 0\r\nfor w in input():\r\n if w == \"1\":\r\n sum += a\r\n elif w == \"2\":\r\n sum += b\r\n elif w == \"3\":\r\n sum += c\r\n else :\r\n sum += d\r\nprint(sum)", "def main():\r\n a = list(map(int, input().split()))\r\n s = input()\r\n calories = 0\r\n for i in s:\r\n calories += a[int(i) - 1]\r\n print(calories)\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "arr=list(map(int,input().split()))\r\n\r\ns=input()\r\nsum=0\r\nfor i1 in s:\r\n i=int(i1)\r\n sum=sum+arr[i-1]\r\n\r\nprint(sum)\r\n", "# Input the calorie values for each strip\r\na1, a2, a3, a4 = map(int, input().split())\r\n\r\n# Input the game string\r\ns = input()\r\n\r\n# Initialize a variable to store the total calories\r\ntotal_calories = 0\r\n\r\n# Iterate through the string and accumulate calories\r\nfor char in s:\r\n if char == '1':\r\n total_calories += a1\r\n elif char == '2':\r\n total_calories += a2\r\n elif char == '3':\r\n total_calories += a3\r\n elif char == '4':\r\n total_calories += a4\r\n\r\n# Print the total calories\r\nprint(total_calories)\r\n", "points = list(map(int, input().strip().split()))\r\n\r\ninp = str(input()) \r\nans = 0\r\nfor step in range(len(inp)):\r\n ans += points[int(inp[step]) - 1]\r\n\r\nprint(ans)", "a=[int(x) for x in input().split()]\r\ns=input()\r\nt=0\r\nfor i in s:\r\n if i=='1':\r\n t+=a[0]\r\n elif i=='2':\r\n t+=a[1]\r\n elif i=='3':\r\n t+=a[2]\r\n else:\r\n t+=a[3]\r\nprint(t)", "# https://codeforces.com/problemset/problem/431/A\r\n\r\n\r\nclass CalorieCounter:\r\n def __init__(self, calories_per_square: str, game_sequence: str):\r\n if game_sequence is None or calories_per_square is None:\r\n raise ValueError(\"Parameter(s) not set\")\r\n self.squares_selected = [int(game) for game in game_sequence]\r\n self.calories_per_square = [int(cal) for cal in calories_per_square.split(\" \")]\r\n\r\n def sum(self):\r\n return sum(self.calories_per_square[square_selected - 1] for square_selected in self.squares_selected)\r\n\r\n\r\nif __name__ == '__main__':\r\n calories_per_square = input()\r\n game_sequence = input()\r\n c = CalorieCounter(calories_per_square, game_sequence)\r\n print(c.sum())\r\n", "process = list(map(int, input().split()))\r\nmoves = list(map(int, input()))\r\ncalories = 0\r\nfor move in moves:\r\n calories += process[move - 1]\r\n\r\nprint(calories)\r\n", "calories=[int(x) for x in input().split()]\r\nsequence=[int(x)for x in input()]\r\ncounter=0\r\nfor i in range(0,len(sequence)):\r\n if sequence[i]==1:\r\n counter+=calories[0]\r\n elif sequence[i]==2:\r\n counter+=calories[1]\r\n elif sequence[i]==3:\r\n counter+=calories[2]\r\n elif sequence[i]==4:\r\n counter+=calories[3]\r\n\r\n\r\nprint(counter)\r\n\r\n", "lst = list(map(int , input().split()))\r\nq = input()\r\nres = 0\r\n\r\nfor i in q :\r\n res += lst[int(i)-1]\r\n \r\nprint(res)", "a1, a2, a3, a4 = map(int, input().split())\r\nsquares = input(\"\")\r\ncalories = 0\r\nfor square in squares:\r\n square = int(square)\r\n if square == 1:\r\n calories += a1\r\n elif square == 2:\r\n calories += a2\r\n elif square == 3:\r\n calories += a3\r\n elif square == 4:\r\n calories += a4\r\nprint(calories)", "need = list(map(int, input().split()))\r\narr = [int(i) for i in input()]\r\nres = 0\r\n\r\nfor i in arr:\r\n res += need[i - 1]\r\n\r\nprint(res)", "li=list(map(int,input().strip().split()))\r\ns=input()\r\nans=0\r\nfor i in s:\r\n ans+=li[int(i)-1]\r\nprint(ans)", "sum = 0\r\nx = input().split()\r\ny = str(input())\r\nfor i in range(len(y)):\r\n if int(y[i]) == 1:\r\n sum += int(x[0])\r\n elif int(y[i]) == 2:\r\n sum += int(x[1])\r\n elif int(y[i]) == 3:\r\n sum += int(x[2])\r\n else:\r\n sum += int(x[3])\r\nprint(sum)", "a=list(map(int,input().split()))\r\nc=0\r\nb=input()\r\nfor i in b:\r\n c+=a[int(i)-1]\r\nprint(c)\r\n", "q = list(map(int, input().split()))\r\nw = input()\r\ne = 0\r\nfor i in w:\r\n e += q[int(i) - 1]\r\nprint(e)", "A = [int(p) for p in input(\"\").split()]\r\nB = str(input(\"\"))\r\nsum = 0\r\nfor i in B:\r\n zzz = int(i)\r\n sum += A[zzz-1]\r\nprint(sum)", "nums = str(input(\"\")).split()\nnums = [int(i) for i in nums]\n\nindices = str(input(\"\"))\nindices_finais = []\n\nfor i in indices:\n indices_finais.append(i)\n\nindices_finais = [int(i) for i in indices_finais]\n\nsoma = 0\n\nfor i in indices_finais:\n soma += nums[i - 1]\n\nprint(soma)\n\n \t\t \t\t\t \t\t \t\t \t \t\t \t\t \t \t", "s1=list(map(int,input().split()))\r\ns2=input()\r\nl=[]\r\nfor i in s2:\r\n l.append(s1[int(i)-1])\r\nprint(sum(l))", "t = 1\r\nwhile t > 0:\r\n a = [int(i) for i in input().split()]\r\n s = input()\r\n index = 0\r\n totl = 0\r\n while index < len(s):\r\n totl = totl + a[int(s[index]) - 1]\r\n index = index + 1\r\n print(totl)\r\n t = t - 1", "x=input().split()\r\ny=input()\r\n\r\nsum=0\r\nfor i in y:\r\n\r\n sum+=int(x[int(i)-1])\r\nprint(sum)\r\n", "a = list(map(int, input().split()))\ns = input()\nprint(sum(a[int(c) - 1] for c in s))\n", "c=[]\r\na=input().split()\r\nfor i in range(0,4):\r\n c.append(a[i])\r\nst=input()\r\nl=len(st)\r\nsum=0\r\nfor i in range(0,l):\r\n sum+=int(a[int(st[i])-1])\r\nprint(sum)", "lst = [-1] + [int(_) for _ in input().split()]\r\nidxs = [int(c) for c in input()]\r\n\r\nsum = 0\r\nfor idx in idxs:\r\n sum += lst[idx]\r\n\r\nprint(sum)", "a=list(map(int,input().split(\" \")))\r\nnums=str(input())\r\ncou=0\r\nfor i in range(len(nums)):\r\n if int(nums[i])==1:\r\n cou+=a[0]\r\n elif int(nums[i])==2:\r\n cou+=a[1]\r\n elif int(nums[i])==3:\r\n cou+=a[2]\r\n elif int(nums[i]) ==4:\r\n cou+=a[3]\r\nprint(cou)", "a1,a2,a3,a4 = [int(i) for i in input().split()]\r\ns = str(input())\r\ncalo = 0\r\nfor i in s:\r\n if int(i) ==1:\r\n calo+=a1\r\n elif int(i) ==2:\r\n calo+=a2\r\n elif int(i) ==3:\r\n calo+=a3\r\n elif int(i) ==4:\r\n calo+=a4\r\nprint(calo)\r\n\r\n", "a = list(map(int, input().split()))\r\ns = input()\r\nsum = 0\r\nfor i in s:\r\n sum+=a[int(i)-1]\r\nprint(sum)", "c=list(map(int,input().split()))\r\nd=input()\r\ny=0\r\nfor i in d:\r\n y+=c[int(i)-1]\r\nprint(y) ", "a = list(map(int , input().split()))\r\n\r\ns = input()\r\ncount = 0\r\n\r\nfor i in range(len(s)):\r\n if int(s[i]) == 1:\r\n count = count + a[0]\r\n if int(s[i]) == 2:\r\n count = count + a[1]\r\n if int(s[i]) == 3:\r\n count = count + a[2]\r\n if int(s[i]) == 4:\r\n count = count + a[3]\r\nprint(count)", "a1,a2,a3,a4=map(int,input().split())\r\ns=input()\r\nr=0\r\nfor i in range(len(s)):\r\n if s[i]=='1':\r\n r+=a1\r\n elif s[i]=='2':\r\n r+=a2\r\n elif s[i]=='3':\r\n r+=a3\r\n else:\r\n r+=a4\r\nprint(r)", "a,b,c,d=map(int,input().split())\r\ne=input()\r\nprint(a*e.count('1')+b*e.count('2')+c*e.count('3')+d*e.count('4'))", "from collections import Counter\r\nl = list(map(int,input().split()))\r\nc=Counter(input())\r\ns = 0\r\nfor k,v in c.items():\r\n s+=l[int(k)-1]*v\r\nprint(s)", "def m():\r\n a = list(map(int, input().split()))\r\n b = input()\r\n total_calories = 0\r\n for char in b:\r\n i = int(char) - 1\r\n total_calories += a[i]\r\n print(total_calories)\r\nm() \r\n", "X=[int(x) for x in input().split()]\r\ns=input()\r\nk=0\r\nfor i in s:\r\n if i=='1':\r\n k+=X[0]\r\n elif i=='2':\r\n k+=X[1]\r\n elif i=='3':\r\n k+=X[2]\r\n else:\r\n k+=X[3]\r\nprint(k)", "def main():\r\n a = list(map(int,input().split()))\r\n s = input()\r\n ans = 0\r\n for i in s:\r\n ans += a[int(i)-1]\r\n print(ans)\r\n\r\nt = 1\r\n\r\nwhile(t):\r\n main()\r\n t-=1", "b = list(map(int, input().split()))#first string\r\nn=input()\r\nsums = 0# summ\r\nfor n in n:\r\n sums += b[int(n)-1]\r\nprint(sums)\r\n\r\n", "l_a = list(map(int, input().split()))\r\ns = input()\r\nt_c = 0\r\n\r\nfor c in s:\r\n t_c += l_a[int(c) - 1]\r\n\r\nprint(t_c)", "# Problem: 431A\r\n\r\n# You need to figure out how many calories Jury burns\r\n# in order to destroy all the squares.\r\n\r\n# The first string indicates numbers based on position.\r\n# a1 = first number, a2 = second, etc through 4.\r\n# The second string is a series of numbers.\r\n# The objective of this problem is to sum the total\r\n# amount of calories burned based on the string.\r\n\r\n# The string will only contain numbers 1,2,3,4.\r\n# So if 4 appears in the string, you add the number a\r\n# to the sum that is in the 4th position.\r\n\r\nvalues = [int(i) for i in input().split()]\r\n\r\nstring = [int(i) for i in list(input())]\r\n\r\nsum = 0\r\n\r\nfor x in range(len(string)):\r\n if string[x] == 1:\r\n sum += values[0]\r\n \r\n if string[x] == 2:\r\n sum += values[1]\r\n \r\n if string[x] == 3:\r\n sum += values[2]\r\n \r\n if string[x] == 4:\r\n sum += values[3]\r\n \r\n # adding this in case they throw a 0 in.\r\n # I don't think they will.\r\n if string[x] == 0:\r\n sum += 0\r\n\r\n\r\nprint(sum)", "AmountOfCall = input().split(' ')\r\nTouches = input()\r\ncount = 0\r\n\r\nfor i in Touches:\r\n count += int(AmountOfCall[int(i)-1])\r\nprint(count)\r\n ", "n=[int(i) for i in input().split()]\r\nx=input()\r\nlist=[]\r\nfor i in x:\r\n if i=='1':\r\n list.append(n[0])\r\n elif i=='2':\r\n list.append(n[1])\r\n elif i=='3':\r\n list.append(n[2])\r\n else:\r\n list.append(n[3])\r\nprint(sum(list))", "a=list(map(int,input().split()))\r\ns=input()\r\nn=len(s)\r\nc=0\r\nk=0\r\nfor i in range(n):\r\n k=int(s[i])-1\r\n c+=a[k]\r\nprint(c)\r\n ", "calories = [int(x) for x in input().split()]\r\nidx = input()\r\nresult = 0\r\n\r\nfor idxx in idx:\r\n result += calories[int(idxx) - 1]\r\n\r\nprint(result)", "f_l=list(map(int,input().split()))# point of lose\r\ns_l=list(map(int,input())) # index of Black Square\r\ntem=0\r\nfor i in range(len(s_l)):\r\n tem+= f_l[s_l[i]-1]\r\nprint(tem) ", "a1, a2, a3, a4 = map(int, input().split())\r\ns = input()\r\ns_m = []\r\n\r\nfor i in s:\r\n s_m.append(int(i))\r\n \r\nprint(s_m.count(1)*a1 + s_m.count(2)*a2 + s_m.count(3)*a3 + s_m.count(4)*a4)", "a = list(map(int, input().split()))\r\nb = input()\r\nsum = 0\r\n\r\nfor num in b:\r\n sum += a[int(num) - 1]\r\n\r\nprint(sum)\r\n", "(fr,se,th,fo)=[int(x) for x in input().split()]\r\nw = input()\r\nc=0\r\nfor i in w:\r\n if int(i) == 1:\r\n c+=fr\r\n if int(i) == 2:\r\n c+=se\r\n if int(i) == 3:\r\n c+=th\r\n if int(i) == 4:\r\n c+=fo\r\nprint(c)", "calories = list(map(int, input().split(\" \")))\ntotal = 0\ns = input()\nfor char in s:\n char = int(char)\n total += calories[char - 1]\n\nprint(total)", "def total_calories(a, s):\r\n calorie_map = {'1': a[0], '2': a[1], '3': a[2], '4': a[3]}\r\n total_calories = 0\r\n\r\n for strip in s:\r\n total_calories += calorie_map[strip]\r\n\r\n return total_calories\r\n\r\n# Input\r\na = list(map(int, input().split()))\r\ns = input().strip()\r\n\r\n# Output\r\nprint(total_calories(a, s))\r\n", "a,b,e,d=map(int,input().split())\r\nn=input()\r\nc=0\r\nfor i in n:\r\n if i=='1':\r\n c=c+a\r\n elif(i=='2'):\r\n c=c+b\r\n elif(i=='3'):\r\n c=c+e\r\n elif(i=='4'):\r\n c=c+d\r\nprint(c)", "#!/bin/env python3\n\ncal = [int(x) for x in input().split()]\ns = input()\n\nncals = 0\nfor i in s:\n ncals += cal[int(i)-1]\n\nprint(ncals)\n", "s_0 = input()\r\n\r\nlst_cal = [int(i) for i in s_0.split()]\r\n\r\ns = input()\r\nsumma = 0\r\nfor i in range(len(s)):\r\n summa += lst_cal[int(s[i]) - 1]\r\nprint(summa)\r\n ", "*arr,=map(int,input().split())\r\nprint(sum(arr[int(i)-1] for i in input()))", "n = list(map(int,input().split()))\r\nc,s = 0,input()\r\nfor i in s:\r\n if i ==\"1\":\r\n c+=n[0]\r\n elif i ==\"2\":\r\n c+=n[1]\r\n elif i==\"3\":\r\n c+=n[2]\r\n else:\r\n c+=n[3] \r\nprint(c)\r\n", "q = list(map(int, input().split()))\r\nr = input()\r\nc = 0\r\nfor i in r:\r\n c += q[int(i)-1]\r\nprint(c)", "from collections import Counter\r\n\r\na1,a2,a3,a4=map(int,input().split())\r\ns=input()\r\nc=Counter(s)\r\nprint(c[\"1\"]*a1+c[\"2\"]*a2+c[\"3\"]*a3+c[\"4\"]*a4)", "# Jhon Sebastián Londoño Cárdenas\r\n# Problema 431A: Black Square\r\n\r\nfrom sys import stdin\r\n\r\ndef main():\r\n calories = stdin.readline().strip().split()\r\n \r\n for i in range(len(calories)):\r\n calories[i] = int(calories[i])\r\n \r\n game = stdin.readline().strip()\r\n \r\n totalCalories = 0\r\n \r\n for i in game:\r\n pos = int(i)\r\n totalCalories += calories[pos-1]\r\n \r\n print(totalCalories)\r\n \r\nmain()", "a = list(map(int, input().split()))\r\ns = map(int, list(input()))\r\nans = 0\r\nfor x in s:\r\n ans += a[x - 1]\r\nprint(ans)", "#****************************************************\r\n#***************Shariar Hasan************************\r\n#**************CSE CU Batch 18***********************\r\n#****************************************************\r\nfrom math import *\r\nimport re\r\nimport random\r\ndef solve():\r\n #for _ in range(int(input())):\r\n for _ in range(1):\r\n a = [0]*5\r\n a[1], a[2], a[3], a[4] = [int(x) for x in input().split()]\r\n s = input()\r\n sum = 0\r\n for x in s:\r\n sum += a[int(x)]\r\n print(sum)\r\n\r\n\r\n\r\n\r\n\r\nsolve()", "a,b,c,d = input().split()\r\nstr1 = input()\r\nsum = 0\r\nn = len(str1)\r\nfor i in range(0,n):\r\n if(str1[i] == '1'):\r\n sum += int(a)\r\n elif(str1[i] == '2'):\r\n sum += int(b)\r\n elif(str1[i] == '3'):\r\n sum += int(c)\r\n elif(str1[i] == '4'):\r\n sum += int(d)\r\nprint(sum)\r\n", "def solution():\n calories = [int(x) for x in input().split()]\n result = sum([calories[ord(strip) - ord('1')] for strip in input()])\n print(result)\n\n\nif __name__ == \"__main__\":\n solution()\n", "a=list(map(int,input().split()))\r\ns=input()\r\nprint(sum([a[int(x)-1] for x in s]))\r\n", "calories = input().split()\ncalories_spent = sum((int(calories[int(current_strip) - 1]) for current_strip in input()))\nprint(calories_spent)\n", "a,b,c,d=(int(i) for i in input().split())\r\ns=str(input())\r\nx=s.count('1')\r\ny=s.count('2')\r\nz=s.count('3')\r\nt=s.count('4')\r\nprint((a*x)+(b*y)+(c*z)+(d*t))\r\n ", "a = [int(i) for i in input().split(' ')]\r\ns = [int(i)-1 for i in input()]\r\n\r\nc=0\r\n\r\nfor i in s:\r\n c+= a[i]\r\n\r\nprint(c)", "arr = list(map(int, input().split()))\r\ns = input()\r\nans = 0\r\nfor val in s:\r\n ans += arr[int(val) - 1]\r\nprint(ans)", "l = list(map(int,input().split()))\r\ns = input()\r\nc = 0\r\nfor i in s:\r\n c+=l[int(i)-1]\r\nprint(c)", "# SOLUTION 1\r\n# a,b,c,d = map(int,input().split())\r\n# s = input()\r\n# print(s.count(\"1\")*a+s.count(\"2\")*b+s.count(\"3\")*c+s.count(\"4\")*d)\r\n\r\n# SOLUTION 2\r\n# a,b,c,d = map(int,input().split())\r\n# sum = 0\r\n# for w in input():\r\n# if w == \"1\":\r\n# sum += a\r\n# elif w == \"2\":\r\n# sum += b\r\n# elif w == \"3\":\r\n# sum += c\r\n# else :\r\n# sum += d\r\n# print(sum)\r\n\r\n\r\n#SOLUTION 3\r\nl = list(map(int,input().split()))\r\nsum = 0\r\nfor w in input():\r\n sum += l[int(w)-1]\r\nprint(sum)", "a1, a2, a3, a4 = [int(a) for a in input().split()]\r\nif (a1>=0 and a1 <= 10000) and (a2>=0 and a2 <= 10000) and(a3>=0 and a3 <= 10000) and (a4>=0 and a4 <= 10000):\r\n s = [*input()]\r\n Count_a1 = s.count('1')\r\n Count_a2 = s.count('2')\r\n Count_a3 = s.count('3')\r\n Count_a4 = s.count('4')\r\n s = Count_a1 * a1 + Count_a2 * a2 + Count_a3 * a3 + Count_a4 * a4\r\n print(s)\r\nelse:\r\n print('Error: The input must contain four space-separated integers a1, a2, a3, a4 (0 ≤ a1, a2, a3, a4 ≤ 10000).')", "calory_for_strip = list(map(int, input().split()))\r\ns = input()\r\ncalories_wasted = 0\r\n\r\nfor n in s:\r\n calories_wasted += calory_for_strip[int(n) - 1]\r\n\r\nprint(calories_wasted)\r\n", "a,b,c,d=map(int,input().split())\r\ns=input()\r\nk=0\r\nfor i in range(len(s)):\r\n if s[i]=='1':\r\n k=k+a\r\n elif s[i]=='2':\r\n k=k+b\r\n elif s[i]=='3':\r\n k=k+c\r\n elif s[i]=='4':\r\n k=k+d\r\nprint(k)\r\n ", "a = list(map(int, input().split()))\r\ns = input()\r\n\r\ntotalCalories = 0\r\n\r\nfor i in s:\r\n stripIndex = int(i) - 1\r\n totalCalories += a[stripIndex]\r\n\r\nprint(totalCalories)\r\n", "a=list(map(int,input().split()))\r\ns=input()\r\nt=0\r\nfor i in range(len(s)):\r\n t+=a[int(s[i])-1]\r\nprint(t)", "a = list(map(int,input().split()))\r\ns = input()\r\ne = 0\r\nfor i in range(len(s)):\r\n r = int(s[i])\r\n e += a[r - 1]\r\nprint(e)\r\n \r\n", "arr = list(map(int, input().split(\" \")))\r\ns = input()\r\nc = 0\r\nfor i in s:\r\n\tc+=arr[int(i)-1]\t\t\r\nprint(c)", "# first store the a1, a2, a3 and a4 in a list to index them later\r\nlistOfAs = str(input()).split(\" \")\r\n# then input tje string s\r\ns = str(input())\r\n# assign the valuse of ans to 0\r\ncaloriesWasted=0\r\n# loop over chars of string s.\r\nfor char in s:\r\n #index the \"a\" using the char at hand, turn it to int and then add it to ans\r\n # don't forget to minus one fron int(char) because indices start from 0\r\n caloriesWasted += int(listOfAs[int(char)-1])\r\n# finally print the answer\r\nprint(caloriesWasted)", "cal=[]\r\na=input().split()\r\nfor i in a: \r\n cal.append(int(i))\r\ndic={}\r\nfor j in range(len(cal)):\r\n dic[j+1]=cal[j]\r\ngame=[]\r\nb=input()\r\nfor k in b: game.append(int(k))\r\ntotal=0\r\nfor l in range(len(game)):\r\n x = game[l]\r\n total+=dic[x]\r\nprint(total)", "from sys import stdin, stdout\r\n\r\ncalories = [int(x) for x in stdin.readline().split()]\r\ntouched_strips = str(stdin.readline().strip())\r\n\r\nstrips_calories = {\r\n 1: 0,\r\n 2: 0,\r\n 3: 0,\r\n 4: 0\r\n}\r\n\r\nfor i in range(4):\r\n strips_calories.update({i+1: calories[i]})\r\n\r\ntotal_calories = 0\r\n\r\nfor calorie in touched_strips:\r\n total_calories += strips_calories[int(calorie)]\r\n\r\nstdout.write(f'{total_calories}') ", "a=list(map(int,input().strip().split()))\r\ns=input()\r\nx=s.count(\"1\")\r\ny=s.count(\"2\")\r\nz=s.count(\"3\")\r\nw=s.count(\"4\")\r\nb=x*a[0]+y*a[1]+z*a[2]+w*a[3]\r\nprint(b)\r\n", "a=[int(x) for x in input().split()]\r\ns=input()\r\nl=[int(x) for x in s]\r\nl1=[a[x-1] for x in l]\r\nprint(sum(l1))", "arr=input().split()\r\n\r\na1=int(arr[0])\r\na2=int(arr[1])\r\na3=int(arr[2])\r\na4=int(arr[3])\r\ncalories=0\r\n\r\nstr1=str(input())\r\n\r\nfor char in str1:\r\n if char=='1':\r\n calories+=a1\r\n elif char=='2':\r\n calories+=a2\r\n elif char=='3':\r\n calories+=a3\r\n else:\r\n calories+=a4 \r\n\r\nprint(calories) ", "arr=list(map(int,input().split()))\r\ncals={i+1:arr[i] for i in range(len(arr))}\r\ns1=input()\r\ntotal=0\r\nfor char in s1:\r\n total+=cals[int(char)]\r\nprint(total)\r\n", "cal = [int(x) for x in input().split(' ')]\r\nsecs = [int(x) for x in list(input())]\r\n\r\nscore = sum([cal[x-1] for x in secs])\r\nprint(score)\r\n", "a=list(map(int,input().split()))\r\nb=input()\r\ns=0\r\nfor i in b:\r\n s+=a[int(i)-1]\r\nprint(s)\r\n", "a=list(map(int,input().split()))\r\ns=input()\r\nsum=int(0)\r\nfor i in range(0,len(s)):\r\n sum+=a[int(s[i])-1]\r\nprint(sum)", "a,b,c,d=map(int,input().split())\r\ns = input()\r\ntc =0\r\nfor char in s:\r\n strip = int(char) -1\r\n tc +=[a,b,c,d][strip]\r\nprint(tc) ", "a = list(map(int, input().split()))\r\ns = input()\r\n\r\nsum = 0\r\nfor c in s:\r\n i = int(c) - 1\r\n sum += a[i]\r\n\r\nprint(sum)\r\n", "# -*- coding: utf-8 -*-\n\"\"\"431A.ipynb\n\nAutomatically generated by Colaboratory.\n\nOriginal file is located at\n https://colab.research.google.com/drive/1UlaHjKRzAQbSIbLUfsIdfyf_yyRJhZse\n\"\"\"\n\na1, a2, a3, a4 = map(int, input().split()) # Read the strip values\ns = input() # Read the string s\n\ntotal_calories = 0 # Initialize the total number of calories\n\nfor c in s:\n strip_number = int(c) # Convert the character to an integer\n if strip_number == 1:\n total_calories += a1\n elif strip_number == 2:\n total_calories += a2\n elif strip_number == 3:\n total_calories += a3\n elif strip_number == 4:\n total_calories += a4\n\nprint(total_calories) # Print the total number of calories wasted", "a1,a2,a3,a4=map(int,input().split())\r\na=input()\r\nSum=0\r\nfor i in a:\r\n if i=='1':\r\n Sum+=a1\r\n elif i=='2':\r\n Sum+=a2\r\n elif i=='3':\r\n Sum+=a3\r\n elif i=='4':\r\n Sum+=a4\r\nprint(Sum)", "a = [int(i) for i in input().split()]\r\ns = input()\r\nl = [0 for _ in range(4)]\r\nfor i in s:\r\n l[int(i) - 1] += 1\r\n\r\nprint(sum([a[i] * l[i] for i in range(4)]))", "a1, a2, a3, a4 = map(int, input().split())\r\nstrips = list(map(int, input().strip()))\r\ncolory = 0\r\nfor c in strips:\r\n if c == 1:\r\n colory += a1\r\n if c == 2:\r\n colory += a2\r\n if c == 3:\r\n colory += a3\r\n if c == 4:\r\n colory += a4\r\nprint(colory)\r\n", "import sys\r\n\r\ncalories = [int(x) for x in input().split()]\r\nprint(sum([calories[int(x) - 1] for x in sys.stdin.readline().rstrip()]))", "c=list(map(int,input().split()))\r\nn=input()\r\nsumc=0\r\nfor i in range(len(n)):\r\n if n[i]=='1':\r\n sumc=sumc+c[0]\r\n if n[i]=='2':\r\n sumc=sumc+c[1]\r\n if n[i]=='3':\r\n sumc=sumc+c[2]\r\n if n[i]=='4':\r\n sumc=sumc+c[3]\r\n \r\nprint(sumc) ", "s = list(map(int, input().split()))\r\na = input()\r\nc = 0\r\nfor i in a:\r\n c += s[int(i)-1]\r\nprint(c)\r\n", "class Solution():\n\n def calories_that_jury_wastes():\n calories= list(map(int, input().split()))\n square_appear_in_the = input()\n total_calories = 0\n for square in square_appear_in_the:\n total_calories += calories[int(square)-1]\n return total_calories\n\n\nif __name__ == '__main__':\n print(Solution.calories_that_jury_wastes())", "calories = list(map(int, input().split()))\r\nsquares = list(map(int, input()))\r\nsquares.sort()\r\n\r\nsum1 = 0\r\nfor i in squares:\r\n sum1 += calories[i - 1]\r\n\r\nprint(sum1)", "a,b,c,d = map(int,input().split())\r\ns = str(input())\r\n\r\nsum = 0\r\n\r\nfor i in range(len(s)):\r\n if s[i]=='1':\r\n sum+=a\r\n elif s[i]=='2':\r\n sum+=b\r\n elif s[i]=='3':\r\n sum+=c\r\n elif s[i]=='4':\r\n sum+=d\r\nprint(sum)", "strips = [int(i) for i in input().split()]\r\nevents = input()\r\n\r\ndef main(strips, events):\r\n res = 0\r\n for i in events:\r\n res += strips[int(i)-1]\r\n return res\r\n\r\nprint(main(strips, events))\r\n", "a = list(map(int, input().split()))\r\ns = input()\r\nk = 0\r\nfor i in s[:len(s)]:\r\n k += a[int(i) - 1]\r\nprint(k)", "myList = [0] + list(map(int, input().split()))\r\nans = 0\r\nfor i in input():\r\n ans += myList[int(i)]\r\nprint(ans)\r\n", "import math\r\nimport os\r\nimport sys\r\nfrom collections import defaultdict\r\nif (os.path.exists('input.txt')):\r\n\tsys.stdin = open(\"input.txt\", \"r\")\r\n\tsys.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 arr = list(map(int, input().split()))\r\n s = input().split()\r\n s = \"\".join(s)\r\n res = 0\r\n \r\n for i in s: \r\n # print(i)\r\n ind = int(i)\r\n res += arr[ind-1] \r\n \r\n print(res)\r\n \r\n# for _ in range(int(input())):\r\n# \tsolve()\r\nsolve()\r\n\r\nsys.stdout.close()\r\nsys.stdin.close()\r\n", "n=list(map(int,input().split()))\r\na,s=input(),0\r\nfor i in a:s+=n[int(i)-1]\r\nprint(s)", "n = list(map(int, input().split()))\r\nnums = list(map(int, input()))\r\ncalories = 0\r\n\r\nfor y in nums:\r\n if y == 1:\r\n calories += n[0]\r\n continue\r\n\r\n elif y == 2:\r\n calories += n[1]\r\n continue\r\n\r\n elif y == 3:\r\n calories += n[2]\r\n continue\r\n\r\n elif y == 4:\r\n calories += n[3]\r\n continue\r\n\r\nprint(calories)\r\n", "a=list(map(int,input().split()))\r\ns,k=str(input()),0\r\nfor i in s:\r\n k+=a[int(i)-1]\r\nprint(k)", "#Taking input\r\na = list(map(int, input().split()))\r\ns = input()\r\n\r\n#Initializaing answer\r\nans = 0\r\n\r\n#Calculating calories for each strip\r\nfor i in s:\r\n ans += a[int(i) - 1]\r\n\r\n#Printing the answer\r\nprint(ans)\r\n", "calos = list(map(int, input().split()))\r\nsqs = input()\r\ncnt = 0\r\n\r\nfor i in sqs:\r\n cnt += calos[int(i)-1]\r\n\r\nprint(cnt)", "A = [int(item) for item in input().split()]\r\nindex = ['1', '2', '3', '4']\r\nk = input()\r\ncalories = 0\r\ndct = dict(zip(index, A))\r\nfor i in k:\r\n calories += dct[i]\r\nprint(calories)", "m=list(map(int,input().split()))\r\ns=input()\r\nsumc=0\r\nfor i in range(len(s)):\r\n if s[i]=='1':\r\n sumc=sumc+m[0]\r\n if s[i]=='2':\r\n sumc=sumc+m[1]\r\n if s[i]=='3':\r\n sumc=sumc+m[2]\r\n if s[i]=='4':\r\n sumc=sumc+m[3]\r\n \r\nprint(sumc) ", "a1, a2, a3, a4 = map(int, input().split())\r\ncalories = {'1': a1, '2': a2, '3': a3, '4': a4}\r\n\r\ntotal_calories = 0\r\n\r\ns = input()\r\n\r\nfor ch in s:\r\n\ttotal_calories += calories[ch]\r\n\r\nprint(total_calories)", "a,b,c,d,=map(int,input().split())\r\nstring = input()\r\nans = 0\r\nfor i in string :\r\n if i=='1':\r\n ans +=a\r\n elif i=='2':\r\n ans +=b\r\n elif i=='3':\r\n ans +=c\r\n elif i=='4':\r\n ans +=d\r\nprint(ans)\r\n", "c_list = list(map(int, input().split()))\ns = list(map(int, list(input())))\ncalories = 0\nfor i in s:\n calories += c_list[i-1] \nprint(calories)\n", "nArr = list(map(int, input().strip().split()))\r\ns = str(input())\r\n# n = int(input())\r\n\r\ntotal_calories = 0\r\n\r\nfor i in range(len(s)):\r\n if s[i] == '1':\r\n total_calories += nArr[0]\r\n elif s[i] == '2':\r\n total_calories += nArr[1]\r\n elif s[i] == '3':\r\n total_calories += nArr[2]\r\n elif s[i] == '4':\r\n total_calories += nArr[3]\r\n\r\nprint(total_calories)", "cals = [0] * 5\r\nnums = list(map(int,input().split()))\r\nfor i in range(1,5):\r\n cals[i] = nums[i-1]\r\n\r\ns=input().strip()\r\nans = 0\r\nfor c in s:\r\n ans += cals[int(c)]\r\nprint(ans)", " \r\nnums = list(map(int, input().split()))\r\nstr1 = input()\r\ncnt=0\r\nfor i in range(len(str1)):\r\n cnt+=nums[int(str1[i])-1]\r\nprint(cnt)", "stripScore = [int(x) for x in input().split()]\r\nstripDict = {}\r\ngameOrd = [int(x) for x in list(input())]\r\ncalories = 0\r\n\r\nfor i in range(4):\r\n stripDict[i + 1] = stripScore[i]\r\n\r\nfor i in range(len(gameOrd)):\r\n calories += stripDict[gameOrd[i]]\r\n\r\nprint(calories)", "\r\nr=list(map(int,input().split()))\r\nr2=input()\r\nrezz=[]\r\nfor i in range(len(r2)):\r\n rezz.append(int(r2[i]))\r\nc=0\r\nfor i in rezz:\r\n c+=r[i-1]\r\nprint(c)\r\n", "# Coded By Block_Cipher\r\n\r\nimport math\r\nimport os\r\nimport random\r\nimport re\r\nimport sys\r\nfrom math import gcd\r\nfrom math import sqrt\r\n\r\narr = list(map(int,input().split()))\r\ns = input()\r\nans = 0\r\nfor i in s:\r\n\tans += arr[int(i)-1]\r\nprint(ans)\r\n\r\n\r\n\r\n", "a = list(map(int, input().split()))\r\ns = input()\r\nres = 0\r\nfor elem in s:\r\n res += a[int(elem) - 1]\r\nprint(res)\r\n", "li = list(map(int , input().split()))\r\ns = input()\r\nsum=0\r\nfor a in s:\r\n if a == \"1\":\r\n sum += li[0]\r\n elif a == \"2\":\r\n sum += li[1]\r\n elif a == \"3\":\r\n sum += li[2]\r\n elif a == \"4\":\r\n sum += li[3]\r\nprint(sum)\r\n\r\n", "a = list([int(x) for x in input().split()])\r\nb = input()\r\nre = 0\r\nfor i in b:\r\n if i == \"1\":\r\n re += a[0]\r\n elif i == \"2\":\r\n re += a[1]\r\n elif i == \"3\":\r\n re += a[2]\r\n elif i == \"4\":\r\n re += a[3]\r\nprint(re)", "a=input().split()\r\nreq=0\r\nfor i in range(4):\r\n a[i]=int(a[i])\r\nb=input()\r\nc=len(b)\r\nfor i in range(c):\r\n req=req+a[int(b[i])-1]\r\nprint(req)", "numbers =list(map(int,input().split()))\r\nstring = input()\r\ncalories = 0\r\nfor i in range(len(string)):\r\n if string[i]=='1':\r\n calories+=numbers[0]\r\n elif string[i]=='2':\r\n calories+=numbers[1]\r\n \r\n elif string[i]=='3':\r\n calories+=numbers[2]\r\n \r\n elif string[i]=='4':\r\n calories+=numbers[3] \r\nprint(calories)", "a1,a2,a3,a4=[int(x) for x in input().split()]\nx=list(input())\ns1,s2,s3,s4=x.count(\"1\"),x.count(\"2\"),x.count(\"3\"),x.count(\"4\")\nprint(a1*s1+a2*s2+a3*s3+a4*s4)\n", "def main():\n calories = list(map(int , input().split()))\n strip = list(map(int, list(input())))\n\n total = 0\n for x in strip:\n total += calories[x-1]\n print(total)\n\n\nif __name__ == '__main__':\n main()\n", "som = 0\r\na,b,c,d=map(int,input().split())\r\nz=input()\r\nfor i in range(len(z)):\r\n if(z[i] == '1'):\r\n som+=a\r\n if(z[i] == '2'):\r\n som+=b\r\n if(z[i] == '3'):\r\n som+=c\r\n if(z[i] == '4'):\r\n som+=d\r\nprint(som)", "n1,n2,n3,n4 = map(int,input().split())\r\na = input()\r\nb = 0\r\nfor i in range(len(a)):\r\n if a[i] == \"1\" :\r\n b += n1\r\n elif a[i] == \"2\" :\r\n b += n2\r\n elif a[i] == \"3\" :\r\n b += n3\r\n elif a[i] == \"4\" :\r\n b += n4\r\nprint(b)", "l = list(map(int, input().split()))\r\ns = input()\r\ncount = 0\r\nfor i in range(len(s)):\r\n count += l[int(s[i]) - 1]\r\nprint(count)", "import sys\n\nget_input = lambda: sys.stdin.readline().rstrip(\"\\n\\r\")\n\ndef main():\n vals = list(map(int, get_input().split()))\n commands = list(get_input())\n ans = 0 \n for command in commands:\n ans += vals[int(command)-1]\n print(ans)\n \nmain()", "arr=[int(arr) for arr in input().split()]\r\narr2=list(input())\r\ntotal=0\r\nfor i in arr2:\r\n total =total+arr[int(i)-1]\r\nprint(total) ", "a1, a2, a3, a4 = map(int, input().split())\r\n \r\ns = input()\r\n \r\ncalories = 0\r\n \r\nfor char in s :\r\n \r\n if char == '1' :\r\n calories += a1\r\n \r\n elif char == '2' :\r\n calories += a2\r\n \r\n elif char == '3' :\r\n calories += a3\r\n \r\n else :\r\n calories += a4\r\n \r\nprint(calories)\r\n", "c=list(map(int,input().split()))\r\ns=input()\r\nsu=0\r\nfor i in range(len(s)):\r\n if s[i]=='1':\r\n su=su+c[0]\r\n if s[i]=='2':\r\n su=su+c[1]\r\n if s[i]=='3':\r\n su=su+c[2]\r\n if s[i]=='4':\r\n su=su+c[3]\r\n \r\nprint(su)", "n=input().split()\r\nc=input()\r\ncalories=0\r\nfor i in range(len(c)):\r\n calories=calories+(int(n[int(c[i])-1]))\r\nprint(calories)", "# cook your dish here\r\na,b,c,d = map(int,input().split())\r\ns = input()\r\nco = 0\r\nfor x in s:\r\n if x=='1':\r\n co += a\r\n elif x=='2':\r\n co+=b\r\n elif x=='3':\r\n co+=c\r\n else:\r\n co+=d\r\nprint(co)", "def solution(a: list, moves: str):\r\n scores = []\r\n for letter in moves:\r\n scores.append(a[int(letter) - 1])\r\n\r\n return sum(scores)\r\n\r\n\r\na = list(map(int, input().split()))\r\nmoves = input()\r\n\r\nprint(solution(a, moves))\r\n", "a = list(map(int,input().split()))\r\nb = list(map(int,input()))\r\np = 0\r\nfor i in b:\r\n if i==1:\r\n p+=a[0]\r\n elif i==2:\r\n p+=a[1]\r\n elif i==3:\r\n p+=a[2]\r\n else:\r\n p+=a[3]\r\nprint(p)", "calories_list = list(map(int, input().split()))\r\nappearing_list = str(input())\r\n\r\ncount = 0\r\nfor _ in appearing_list:\r\n count += calories_list[int(_)-1]\r\n\r\nprint(count)", "c=list(map(int,input().split()))\r\ns=input()\r\nx=0\r\nfor i in s:\r\n if i==\"1\":\r\n x=x+c[0]\r\n elif i==\"2\":\r\n x=x+c[1]\r\n elif i==\"3\":\r\n x=x+c[2]\r\n elif i==\"4\":\r\n x=x+c[3]\r\nprint(x)", "cal = list(map(int, input().split()))\r\nnum = list(map(int, input()))\r\nx = 0\r\nfor i in num:\r\n x += cal[i-1]\r\nprint(x)", "l=list(map(int,input().split()))\r\ns=input()\r\nc=0\r\nfor i in s:\r\n c=c+l[int(i)-1]\r\nprint(c)\r\n \r\n ", "import sys\r\n\r\ncal = list(map(int, sys.stdin.readline().strip().split()))\r\ncols = sys.stdin.readline().strip()\r\nres = 0\r\n\r\nfor col in cols:\r\n res += cal[int(col) - 1]\r\n\r\nprint(res)", "a=map(int,input().split())\r\na=list(a)\r\ns = input()\r\nsumm=0\r\nfor i in s:\r\n summ = a[int(i)-1]+summ\r\nprint(summ)", "ans = 0\r\nmas = [int(el) for el in input().split()]\r\nfor el in input():\r\n ans += mas[int(el) - 1]\r\nprint(ans)", "import math\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\na1, a2, a3, a4 = readarray(int)\r\n\r\nd = {\r\n '1': a1,\r\n '2': a2,\r\n '3': a3,\r\n '4': a4\r\n}\r\n\r\ns = input()\r\n\r\ncals = 0\r\n\r\nfor strip in s:\r\n cals += d[strip] \r\n\r\nprint(cals)\r\n", "a = list(map(int, input().split()))\r\ne = [int(i) for i in input()]\r\nf = []\r\nfor i in e:\r\n f.append(a[i-1])\r\nprint(sum(f))", "def getCalories(values, squares):\r\n calories = 0\r\n for num in squares:\r\n calories += values[num-1]\r\n return calories\r\n\r\nvalues = list(map(int, input().split(' ')))\r\nsquares = list(map(int, input()))\r\nprint(getCalories(values, squares))\r\n", "a,b,c,d=map(int,input().split())\r\ns=list(input())\r\n\r\ncal=0\r\nfor i in s:\r\n if (i=='1'):\r\n cal=cal+a\r\n elif (i=='2'):\r\n cal=cal+b\r\n elif (i=='3'):\r\n cal=cal+c\r\n else:\r\n cal=cal+d\r\nprint(cal)\r\n ", "a1, a2, a3, a4 = map(int, input().split())\r\ns = str(input())\r\nsum = 0\r\nfor j in s:\r\n if j==\"1\":\r\n sum = sum + a1\r\n elif j==\"2\":\r\n sum = sum + a2\r\n elif j==\"3\":\r\n sum = sum + a3\r\n else:\r\n sum = sum + a4\r\nprint(sum)", "a,b,c,d = map(int,input().split())\r\ndic = dict()\r\ndic[1] = a\r\ndic[2] = b \r\ndic[3] = c \r\ndic[4] = d \r\ns = input()\r\ncnt = 0\r\nfor i in range(len(s)):\r\n cnt += dic[int(s[i])]\r\nprint(cnt)", "a,b,c,d = map(int, input().split())\r\nq = list(input())\r\nk = 0\r\nfor i in range(len(q)):\r\n if q[i] == \"1\":\r\n k += a\r\n elif q[i] == \"2\":\r\n k += b\r\n elif q[i] == \"3\":\r\n k += c\r\n elif q[i] == \"4\":\r\n k += d\r\nprint(k)", "i = list(map(int,input().split()))\r\nk = input()\r\ncal = 0\r\nfor n in range(len(k)):\r\n\tj = int(k[n]) - 1\r\n\tcal += i[j]\r\nprint(cal)", "calories = list(map(int, input().split()))\r\ngame_process = input()\r\ntotal_calories = sum(calories[int(char) - 1] for char in game_process)\r\nprint(total_calories)", "a=list(map(int,input().split()))\r\nb=[]\r\no=0\r\nb.extend(input())\r\nfor i in range(len(b)):\r\n b[i]=int(b[i])\r\nfor i in range(len(b)):\r\n o+=a[b[i]-1]\r\nprint(o)\r\n", "a=list(map(int,input().split()));z=input()\r\nc=0\r\nfor i in z:\r\n c+=a[int(i)-1] \r\nprint(c)", "a=list(input().split())\r\ns=input()\r\nc=0\r\nfor x in s:\r\n c+=int(a[int(x)-1])\r\nprint(c)", "n = list(map(int, input().split()))\r\ns = input()\r\n\r\nco = 0\r\nfor i in s:\r\n if i == '1':\r\n co += n[0]\r\n elif i == '2':\r\n co += n[1]\r\n elif i == '3':\r\n co += n[2]\r\n else:\r\n co += n[3]\r\n\r\n\r\nprint(co)\r\n", "cal = list(map(int, input().split()))\r\ngame = input()\r\nresult = 0 \r\nfor i in game :\r\n result += cal[int(i) - 1]\r\nprint(result)", "z = list(map(int,input().split()))\r\nx = input()\r\ny = 0\r\nfor i in x :\r\n y+= z[int(i) -1]\r\nprint(y)", "a,b,c,d=map(int,input().split())\r\ns=input()\r\nc1=0\r\nfor i in range(len(s)):\r\n if s[i]=='1':\r\n c1+=a\r\n elif s[i]=='2':\r\n c1+=b\r\n elif s[i]=='3':\r\n c1+=c\r\n else:\r\n c1+=d\r\nprint(c1)", "count = 0\r\na = list(map(int, input().split()))\r\ns = input()\r\nfor i in range(len(s)):\r\n if s[i] == \"1\":\r\n count += a[0]\r\n elif s[i] == \"2\":\r\n count += a[1]\r\n elif s[i] == \"3\":\r\n count += a[2]\r\n elif s[i] == \"4\":\r\n count += a[3]\r\nprint(count)", "x,y,a,b=(input()).split()\r\n\r\nz=input()\r\ncount=0\r\nfor i in range(len(z)):\r\n if z[i]==\"1\":\r\n count=count+int(x);\r\n elif z[i]==\"2\":\r\n count=count+int(y);\r\n elif z[i]==\"3\":\r\n count=count+int(a);\r\n elif z[i]==\"4\":\r\n count=count+int(b);\r\n\r\nprint(count)\r\n\r\n", "\na = list(input().split(\" \"))\nb = list(map(int,a))\nc = list(input())\nson = 0\nfor i in c:\n j = int(i) - 1\n son += b[j]\nprint(son)\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 ", "strip = list(map(int, input().split()))\r\nseq = list(map( int, input()))\r\ncal =0\r\nfor i in seq :\r\n if i == 1:\r\n cal += strip[0]\r\n continue\r\n if i == 2:\r\n cal += strip[1]\r\n continue\r\n\r\n if i == 3:\r\n cal += strip[2]\r\n continue\r\n if i == 4:\r\n cal += strip[3]\r\n continue\r\n\r\nprint(cal)", "a = list(map(int, input().split()))\r\ns = input()\r\nprint(sum(a[int(num)-1] for num in s))", "a1,a2,a3,a4=map(int,input().split())\r\ns=input()\r\nd1=s.count(\"1\")\r\nd2=s.count(\"2\")\r\nd3=s.count(\"3\")\r\nd4=s.count(\"4\")\r\nprint(d1*a1+d2*a2+d3*a3+d4*a4)\r\n", "w,x,y,z=list(map(int,input().split()))\r\ns=input()\r\nsum1=0\r\nsum2=0\r\nsum3=0\r\nsum4=0\r\nfor i in range(len(s)):\r\n if(s[i]=='1'):\r\n sum1+=w\r\n if(s[i]=='2'):\r\n sum2+=x\r\n if(s[i]=='3'):\r\n sum3+=y\r\n if(s[i]=='4'):\r\n sum4+=z\r\nprint(sum1+sum2+sum3+sum4) \r\n\r\n", "a,b,c,d=map(int,input().split());s=input();r=0\r\nfor i in range (len(s)):\r\n\tif(s[i]==\"1\"):r+=a\r\n\telif(s[i]==\"2\"):r+=b\r\n\telif(s[i]==\"3\"):r+=c\r\n\telse:r+=d\r\nprint(r)", "a1,a2,a3,a4=map(int,input().split())\r\ns=input()\r\nl=int(len(s))\r\ncount=0\r\nfor i in range(l):\r\n if s[i]=='1':\r\n count+=a1\r\n if s[i]=='2':\r\n count+=a2\r\n if s[i]=='3':\r\n count+=a3\r\n if s[i]=='4':\r\n count+=a4\r\nprint(count)", "l=list(map(int,input().split()))\r\na=input()\r\nc=0\r\n\r\nfor i in range(len(a)):\r\n if a[i]=='1':\r\n c+=l[0]\r\n elif a[i]=='2':\r\n c+=l[1]\r\n elif a[i]=='3':\r\n c+=l[2]\r\n elif a[i]=='4':\r\n c+=l[3]\r\n \r\nprint(c)", "import math \r\ndef blacksquare(s,f):\r\n alist=[int(d) for d in s.split()]\r\n blist=[x for x in f]\r\n count=0\r\n for m in blist:\r\n if m==\"1\":\r\n count+=alist[0]\r\n elif m==\"2\":\r\n count+=alist[1]\r\n elif m==\"3\":\r\n count+=alist[2]\r\n else:\r\n count+=alist[3]\r\n return count\r\ns=input()\r\nf=input()\r\nprint(blacksquare(s,f))", "# This is a sample Python script.\r\n\r\n# Press Shift+F10 to execute it or replace it with your code.\r\n# Press Double Shift to search everywhere for classes, files, tool windows, actions, and settings.\r\n\r\nfrom string import ascii_uppercase\r\nfrom collections import Counter\r\nimport itertools\r\nimport sys\r\nfrom dataclasses import dataclass, field\r\n\r\nimport sys\r\nfrom dataclasses import dataclass, field\r\n\r\ndef function():\r\n arr = [int(e) for e in input().split()]\r\n str = input()\r\n sum = 0\r\n for e in str:\r\n p = int(e)\r\n sum+=arr[p-1]\r\n print(sum)\r\n\r\ndef helper(param):\r\n pass\r\n\r\nif __name__ == \"__main__\":\r\n function()\r\n", "calo = tuple(map(int, input().split()))\r\nn = 0\r\nfor i in input():\r\n n += calo[int(i) - 1]\r\nprint(n)", "calories = [int(x) for x in input().split()]\r\ngame = input()\r\ni = 0\r\ngame_calories = 0\r\nwhile i < len(game):\r\n\tgame_calories += calories[int(game[i]) - 1]\r\n\ti += 1\r\nprint(game_calories)", "a = list(map(int, input().split()))\r\ns = list(map(int, list(input())))\r\nres = 0\r\nfor i in s:\r\n res += a[i-1]\r\nprint(res)", "\"\"\"\nA. Black Square: implementation\n\ntime limit per test: 1 second\nmemory limit per test: 256 megabytes\ninput: standard input\noutput: standard output\n\nQuite recently, a very smart student named Jury decided that lectures are boring, so he downloaded a game called \"Black Square\" on his super cool touchscreen phone.\nIn this game, the phone's screen is divided into four vertical strips. Each second, a black square appears on some of the strips.\nAccording to the rules of the game, Jury must use this second to touch the corresponding strip to make the square go away.\nAs Jury is both smart and lazy, he counted that he wastes exactly ai calories on touching the i-th strip.\nYou've got a string s, describing the process of the game and numbers a1, a2, a3, a4. Calculate how many calories Jury needs to destroy all the squares?\n\nInput\nThe first line contains four space-separated integers a1, a2, a3, a4 (0 ≤ a1, a2, a3, a4 ≤ 10^4).\nThe second line contains string s (1 ≤ |s| ≤ 10^5),\nwhere the і-th character of the string equals\n\"1\", if on the i-th second of the game the square appears on the first strip,\n\"2\", if it appears on the second strip,\n\"3\", if it appears on the third strip,\n\"4\", if it appears on the fourth strip.\n\nOutput\nPrint a single integer — the total number of calories that Jury wastes.\n\"\"\"\n\ndef black_square():\n a = list(map(int, input().split(' ')))\n s = input()\n t = 0\n for i in s:\n t += a[int(i) - 1]\n print(t)\n\nif __name__ == '__main__':\n black_square()", "arr = list(map(int, input().split()))\r\na = input()\r\nc = 0\r\nfor i in a:\r\n x = int(i)-1\r\n c += arr[x]\r\nprint(c)", "while True:\r\n try:\r\n a, b, c, d = map(int, input().split())\r\n s = input().strip()\r\n ans = 0\r\n for ch in s:\r\n if ch == '1':\r\n ans += a\r\n elif ch == '2':\r\n ans += b\r\n elif ch == '3':\r\n ans += c\r\n elif ch == '4':\r\n ans += d\r\n print(ans)\r\n except EOFError:\r\n break\r\n", "# tc = int(input())\r\nfor i in range(1):\r\n # n = int(input())\r\n li = list(map(int,input().split()))\r\n s = input()\r\n ans = 0\r\n rec = 0\r\n for i in s:\r\n ans += li[int(i)-1]\r\n print(ans)\r\n", "c = list(map(int, input().split()))\r\n\r\ns = input()\r\n\r\nx = 0\r\n\r\nfor i in range(len(s)):\r\n if s[i] == '1':\r\n x = x + c[0]\r\n elif s[i] == '2':\r\n x = x + c[1]\r\n elif s[i] == '3':\r\n x = x + c[2]\r\n elif s[i] == '4':\r\n x = x + c[3]\r\n\r\nprint(x)", "a,b,c,d = map(int, input().split())\r\ns = input()\r\nk = 0\r\nfor i in s:\r\n if i == '1':\r\n k += a\r\n elif i =='2':\r\n k += b\r\n elif i =='3':\r\n k += c\r\n else:\r\n k += d\r\nprint(k)\r\n", "a = list(map(int,input().split()))\r\nprint(sum([a[i-1] for i in list(map(int,str(input())))]))", "a = list(map(int, input().split()))\r\ns = str(input())\r\nsm = 0\r\nfor i in s:\r\n sm += a[int(i)-1]\r\nprint(sm)\r\n", "A = list(map(int, input().split()))\r\n \r\nstring = input()\r\n \r\ntot=string.count('1')*A[0]+string.count('2')*A[1]+string.count('3')*A[2]+string.count('4')*A[3]\r\n\r\nprint(tot)", "a,b,c,d = map(int,input().split())\r\nls = input()\r\nres = 0\r\nfor i in range(len(ls)):\r\n if(ls[i]=='1'):\r\n res+=a\r\n elif(ls[i]=='2'):\r\n res+=b\r\n elif(ls[i]=='3'):\r\n res+=c\r\n else:\r\n res+=d\r\nprint(res)", "a = list(map(int, input().split()))\r\nb = input()\r\nres = 0\r\nfor i in b:\r\n c = int(i) - 1\r\n res += a[c]\r\n\r\nprint(res)", "key = map(int, input().split())\r\nkey = [e for e in key]\r\ni = 1\r\nk = {\r\n f\"{i}\": key[i-1]\r\n}\r\nfor j in range(2, len(key)+1):\r\n k[str(j)] = key[j-1]\r\n\r\norder = list(input())\r\norder = [int(e) for e in order]\r\ni = 0\r\nc = 0\r\nfor e in order:\r\n c += k[str(e)]\r\n\r\nprint(c)", "sum = 0\r\nmyList = list(map(int , input().split()))\r\ns = input()\r\nfor i in range(len(s)):\r\n sum+=myList[int(s[i])-1]\r\nprint(sum)", "cal = input().split()\r\ncal = [int(x) for x in cal]\r\ns = input()\r\ncount = 0\r\nfor i in s:\r\n count += cal[int(i)-1]\r\nprint(count)", "a,b,c,d = map(int,input().split())\r\ns = input()\r\nsolve = s.count(\"1\")*a + s.count(\"2\")*b + s.count(\"3\")*c+s.count(\"4\")*d\r\nprint(solve)", "a, b, c, d = map(int, input().split())\r\ns = list(input())\r\ncount = 0\r\nfor i in range(len(s)):\r\n if s[i] == \"1\":\r\n count += a\r\n if s[i] == \"2\":\r\n count += b\r\n if s[i] == \"3\":\r\n count += c\r\n if s[i] == \"4\":\r\n count += d\r\nprint(count)", "weights = list(map(int, input().split()))\r\nevents = str(input())\r\n\r\nsquares = [0, 0, 0, 0]\r\nfor char in events:\r\n squares[int(char) - 1] += 1\r\n\r\ncalories = 0\r\nfor i in range(4):\r\n calories += weights[i] * squares[i]\r\n\r\nprint(calories)\r\n", "intFinalResultt = 0\r\n\r\narrInputt = input().split(' ')\r\n\r\nlistInpValuess = []\r\n\r\nfor i in range(len(arrInputt)):\r\n listInpValuess.append(int(arrInputt[i]))\r\n\r\nstrInpResults = input()\r\n\r\nfor i in range(len(strInpResults)):\r\n intCurrResult = int(strInpResults[i])\r\n\r\n intFinalResultt += listInpValuess[intCurrResult - 1]\r\n\r\nprint(intFinalResultt)\r\n", "calories = list(map(int,input().split()))\nstrips = input()\nr = 0\nfor i in strips:\n r += calories[int(i) - 1]\nprint(r)\n", "a=list(map(int,input().split()))\r\nb=input()\r\ncal=0\r\nfor i in b:\r\n cal+=a[int(i)-1]\r\nprint(cal)", "a=list(map(int,input().split()))\r\nd=input()\r\nk=0\r\nfor i in d:\r\n k+=a[int(i)-1]\r\nprint(k)", "a=list(map(int,input().split()))\r\ns=input()\r\nsum_cal=0\r\nfor i in s:\r\n sum_cal+=a[int(i)-1]\r\nprint(sum_cal)\r\n", "a = [int(x) for x in input().split()]\r\ns = input()\r\nres=0\r\nfor i in s:\r\n res+=a[int(i)-1]\r\nprint(res)", "from typing import TypeVar\r\n\r\ncalories = TypeVar('calories', int, str)\r\n\r\n\r\ndef calories_cnt(occurences: dict[int, calories], strips: int):\r\n\r\n result = [occurences.get(strip) for strip in strips]\r\n return sum(result)\r\n\r\n\r\nif __name__ == '__main__':\r\n calories = list(map(int, input().split()))\r\n\r\n strips = list(map(int, (list(input()))))\r\n\r\n occurences = dict(zip(range(1, len(calories)+1), calories))\r\n\r\n strips\r\n\r\n print(calories_cnt(occurences, strips))\r\n", "a = list(map(int , input().split()))\r\ns = str(input())\r\nres = 0\r\nfor i in s:\r\n res+=a[int(i)-1]\r\nprint(res)", "\r\n\r\n\r\ndef calories_cnt(occurences: dict[int, int], strips: int):\r\n\r\n return sum([occurences.get(strip) for strip in strips])\r\n\r\n\r\nif __name__ == '__main__':\r\n calories = list(map(int, input().split()))\r\n\r\n strips = list(map(int, (list(input()))))\r\n\r\n occurences = dict(zip(range(1, len(calories)+1), calories))\r\n\r\n print(calories_cnt(occurences, strips))\r\n", "import sys\r\n#import math\r\n#import datetime\r\n#import numpy as np\r\n\r\ndef main():\r\n #n,k = map(int, input().split())\r\n #a = [int(x) for x in sys.stdin.readline().split()]\r\n #t = int(input())\r\n a = [int(x) for x in sys.stdin.readline().split()]\r\n s = input()\r\n total = 0\r\n for i in s:\r\n total += a[(int(i))-1]\r\n print(total)\r\n \r\n \r\nmain()\r\n", "l=list(map(int,input().split()))\r\ns = input()\r\ncount=0\r\nfor i in s:\r\n count+=(l[int(i)-1])\r\nprint(count)", "calories = list(map(int,input().split()))\r\ngame = input()\r\n\r\nans = game.count('1') * calories[0] + game.count('2') * calories[1] \\\r\n + game.count('3') * calories[2] + game.count('4') * calories[3]\r\n\r\nprint(ans)", "a = input().split(\" \")\r\nb = input()\r\nc = 0\r\nfor i in b:\r\n i = int(i) - 1\r\n c += int(a[i])\r\nprint(c)", "import sys\r\na = list(map(int, sys.stdin.readline().strip().split()))\r\ns = list(sys.stdin.readline().strip())\r\nans = 0\r\nfor i in s:\r\n ans += a[int(i)-1]\r\nprint(ans)\r\n", "array = list(map(int, input().split()))\r\ns = list(input())\r\nres = 0\r\nfor i in range(len(s)):\r\n val = array[int(s[i]) - 1]\r\n res += val\r\nprint(res)\r\n", "d = [int(i) for i in input().split()]\r\ns = input()\r\nk = 0\r\nfor i in s:\r\n k = k + (d[int(i) - 1])\r\nprint(k)", "a1,a2,a3,a4 = map(int,input().split())\r\nx = list(input())\r\ncalories = 0\r\nfor i in x :\r\n if i == \"1\":\r\n calories+=a1\r\n if i == \"2\":\r\n calories+=a2\r\n if i == \"3\":\r\n calories+=a3\r\n if i == \"4\":\r\n calories+=a4\r\nprint(calories)", "strips = list(map(int, input().split()))\r\nstr = input()\r\ncalories = 0\r\nfor num in str:\r\n if num == '1':\r\n calories+= strips[0]\r\n elif num == '2':\r\n calories += strips[1]\r\n elif num == '3':\r\n calories += strips[2]\r\n elif num == '4':\r\n calories += strips[3]\r\nprint(calories)", "arr = list(map(str,input().split()))\r\na = input()\r\nans = 0\r\nfor i in a:\r\n if i == \"1\":\r\n ans+= int(arr[0])\r\n elif i == \"2\":\r\n ans+= int(arr[1])\r\n elif i == \"3\":\r\n ans+= int(arr[2])\r\n else:\r\n ans+= int(arr[3])\r\nprint(ans) ", "a = list(map(int, input().split()))\r\ns = input()\r\nprint(sum([s.count(str(i)) * a[i - 1] for i in range(1, 5)]))\r\n", "l=list(map(int,input().split()))\r\ns=input()\r\nx=list(map(int,s))\r\nc=0\r\nfor i in range(len(x)):\r\n c+=l[x[i]-1]\r\nprint(c)", "k = list(map(int,input().split()))\r\nt = input()\r\nkal = 0\r\nfor i in range(len(t)):\r\n\tif t[i]==\"1\":\r\n\t\tkal += k[0]\r\n\telif t[i]==\"2\":\r\n\t\tkal += k[1]\r\n\telif t[i]==\"3\":\r\n\t\tkal += k[2]\r\n\telif t[i] == \"4\":\r\n\t\tkal += k[3]\r\nprint(kal)", "M = list(map(int, input().split()))\r\ns = input()\r\nA = {}\r\nfor i in range(len(M)):\r\n A[str(i+1)] = M[i]\r\ncont = 0\r\nfor i in s:\r\n cont = cont + A[i]\r\nprint(cont)", "from sys import stdin\r\ncalories = [int(x) for x in stdin.readline().strip().split(\" \")]\r\nind = stdin.readline().strip()\r\ntotal = 0 \r\nfor i in ind:\r\n total += calories[int(i) - 1]\r\nprint(total)", "var1 = input().split()\r\nvar2 = input()\r\ncounter = 0\r\nfor i in var2:\r\n # print(i)\r\n counter += int(var1[int(i)-1])\r\n # print(int(var1[int(i)]))\r\nprint(counter)", "a1,a2,a3,a4 = map(int,input().split());c=0\r\ns=input()\r\nfor i in s:\r\n if i=='1':c=c+a1\r\n elif i=='2':c=c+a2\r\n elif i=='3':c=c+a3\r\n else:c=c+a4\r\nprint(c)", "tm = list(map(int, input().split()))\r\na1, a2, a3, a4 = tm[0], tm[1], tm[2], tm[3]\r\nx = input()\r\nit = 0\r\nfor i in x:\r\n if i == '1':\r\n it += a1\r\n elif i == '2':\r\n it += a2\r\n elif i == '3':\r\n it += a3\r\n else:\r\n it += a4\r\nprint(it)", "a=list(map(int, input().split()))\r\n\r\nb=input()\r\nc=0\r\nfor i in range(len(b)):\r\n c+=a[int(b[i])-1]\r\nprint(c)\r\n \r\n", "lst = list(map(int, input().split()))\r\nturn = input()\r\ncal = 0\r\n\r\nfor i in turn:\r\n cal += lst[int(i)-1]\r\n\r\nprint(cal)\r\n", "x = list(map(int, input().split()))\r\ns = input()\r\n\r\noneCount = s.count('1')\r\ntwoCount = s.count('2')\r\nthreeCount = s.count('3')\r\nfourCount = s.count('4')\r\n\r\nres = (oneCount*x[0] + twoCount*x[1] + threeCount*x[2] + fourCount*x[3])\r\n\r\nprint(res)\r\n", "a1, a2, a3, a4 = map(int, input().split())\r\ns = input( )\r\n\r\ntotal_calories = 0\r\nfor strip in s:\r\n if strip == '1':\r\n total_calories += a1\r\n elif strip == '2':\r\n total_calories += a2\r\n elif strip == '3':\r\n total_calories += a3\r\n elif strip == '4':\r\n total_calories += a4\r\n\r\nprint(total_calories)\r\n", "strips = list(map(int, input().split()))\r\nseconds = list(map(int, input()))\r\nresult = sum([strips[i - 1] for i in seconds])\r\nprint(result)\r\n", "a,b,c,d=[int(x) for x in input().split()]\r\ns=input()\r\nk=0\r\nfor i in s:\r\n if(i==\"1\"):\r\n k+=a\r\n if(i==\"2\"):\r\n k+=b\r\n if(i==\"3\"):\r\n k+=c\r\n if(i==\"4\"):\r\n k+=d\r\nprint(k)\r\n ", "lst=list(map(int,input().split()))\r\ns=input()\r\nc=0\r\nfor i in s:\r\n if(i=='1'):\r\n c+=lst[0]\r\n elif i=='2':\r\n c+=lst[1]\r\n elif i=='3':\r\n c+=lst[2]\r\n elif i=='4':\r\n c+=lst[3]\r\nprint(c)\r\n ", "\r\na = list(map(int,input().split()))\r\nsteps = input()\r\n\r\ncal = 0\r\nfor i in steps:\r\n cal += a[int(i) - 1 ]\r\nprint(cal)", "#431/A\r\n#Black Square\r\n#Status : IDK\r\n\r\na1 , a2 , a3 , a4 = [int(x) for x in input().split()]\r\n\r\ncal = [a1 , a2 , a3 , a4]\r\nstring = [int(i) for i in str(input())]\r\n\r\ntotal = 0\r\n\r\nfor i in string:\r\n total = total + cal[i-1]\r\n\r\nprint(total)", "n=input().split(\" \")\r\nn1=input()\r\nl=[]\r\nc=0\r\nfor i in n:\r\n l.append(int(i))\r\nfor j in n1:\r\n c=c+l[int(j)-1]\r\nprint(c)", "strip = list(map(int, input().split()))\n\nchance = list(map(int, list(input())))\n\nsum = 0\n\nfor i in chance:\n\n sum += strip[i-1]\n\n\nprint(sum)\n", "from sys import stdin\ndef input(): return stdin.readline()[:-1]\n\n# list(map(int,input().split()))\n\n\ndef solve():\n energy = 0 \n x = input().split()\n for number in input(): \n energy += int(x[int(number)-1])\n\n return energy \n\n\nprint(solve())\n", "l=list(map(int,input().split()))\r\ns=list(input())\r\nc=0\r\nfor i in s:\r\n a=int(i)\r\n c+=l[a-1]\r\nprint(c)", "a,b,c,d = map(int,input().split())\r\nS = input()\r\nS = [int(i) for i in S]\r\ncl = 0\r\nfor n in S:\r\n if n == 1:\r\n cl += a\r\n elif n == 2:\r\n cl += b\r\n elif n == 3:\r\n cl += c\r\n else:\r\n cl += d\r\nprint(cl)", "w = list(map(int, input().split()))\r\ns = input()\r\ncnt = 0\r\n\r\nfor i in s:\r\n cnt += w[int(i)-1]\r\nprint(cnt)\r\n\r\n", "calories = [int(x) for x in input().split(\" \")]\r\ncalories_position = [int(y) for y in input()]\r\n\r\ntuple_of_calories = []\r\ntotal_calories = 0\r\n\r\nfor i,calorie in enumerate(calories):\r\n tuple_of_calories.append([i+1,calorie])\r\n\r\nfor i in calories_position:\r\n if i == tuple_of_calories[i-1][0]:\r\n total_calories += tuple_of_calories[i-1][1]\r\n\r\n\r\nprint(total_calories)", "import sys\r\ncal = sys.stdin.readline().strip().split()\r\nline = sys.stdin.readline().strip()\r\nsumm = 0\r\nfor i in line:\r\n if i == '1':\r\n summ += int(cal[0])\r\n if i == '2':\r\n summ += int(cal[1])\r\n if i == '3':\r\n summ += int(cal[2])\r\n if i == '4':\r\n summ += int(cal[3])\r\nprint(summ)\r\n\r\n\r\n\r\n", "s = list(map(int,input().split()))\r\nl = list(str(input()))\r\nintes = []\r\nfor j in l:\r\n intes.append(int(j))\r\nscore = 0\r\nfor i in intes:\r\n score+=s[i-1]\r\nprint(score)\r\n\r\n", "a = list(map(int,input().split()))\r\nn = input()\r\nc = 0\r\nfor i in range(len(n)):\r\n c+= a[int(n[i])-1]\r\nprint(c)", "a1,a2,a3,a4=map(str,input().split())\r\ns1=input()\r\ncal=0\r\nfor i in s1:\r\n if(i=='1'):\r\n cal+=int(a1)\r\n elif(i=='2'):\r\n cal+=int(a2)\r\n elif(i=='3'):\r\n cal+=int(a3)\r\n else:\r\n cal+=int(a4)\r\nprint(cal)", "a1, a2, a3, a4 = [int(i) for i in input().split()]\r\ns = input()\r\n\r\ncalories = 0\r\nfor i in s:\r\n calories += eval('a' + i)\r\n\r\nprint(calories)", "import sys\r\n\r\nb = [int(i) for i in sys.stdin.readline().split()]\r\ne = input(\"\")\r\nc = 0\r\nfor i in e:\r\n c += b[int(i) - 1]\r\nprint(c)\r\n\r\n", "a1,a2,a3,a4 = map(int, input().split())\r\ntxt = input()\r\nprint(txt.count('1')*a1+txt.count('2')*a2+txt.count('3')*a3+txt.count('4')*a4)", "line = input().split()\nline = [int(i) for i in line]\n\ncal_per_pos = {\n 1:line[0],\n 2:line[1],\n 3:line[2],\n 4:line[3]\n}\n\n\nnum = input()\n\nnum = [int(i) for i in num]\n\n\nans = 0\n\nfor i in num:\n ans+= cal_per_pos[i]\n\nprint(ans)", "n = list(map(int,input().split(\" \")))\r\nlist = input()\r\ncounter = 0\r\nfor i in range(len(list)):\r\n if list[i] == \"1\":\r\n counter += n[0]\r\n elif list[i] == \"2\":\r\n counter += n[1]\r\n elif list[i] == \"3\":\r\n counter += n[2]\r\n else:\r\n counter += n[3]\r\nprint(counter)\r\n", "a=list(map(int,input().split()))\r\nx=input()\r\nsum=0\r\nfor i in range(len(x)):\r\n sum+=a[int(x[i])-1]\r\nprint(sum)", "a=[int(x) for x in input().split()]\r\ns=input()\r\ncount=0\r\nfor i in s:\r\n if i=='1':\r\n count+=a[0]\r\n elif i=='2':\r\n count+=a[1]\r\n elif i=='3':\r\n count+=a[2]\r\n else:\r\n count+=a[3]\r\nprint(count)", "a1, a2, a3, a4 = map(int,input().split())\r\ns = input()\r\nscore={1:0, 2:0, 3:0, 4:0}\r\nfor i in s:\r\n score[int(i)]+=1\r\nprint(score[1]*a1+score[2]*a2+score[3]*a3+score[4]*a4)", "import sys\r\nstrips = [int(x) for x in sys.stdin.readline().split()]\r\nnums = input()\r\ncalories = 0\r\nfor i in nums:\r\n if i == '1':\r\n calories += strips[0]\r\n elif i == '2':\r\n calories += strips[1]\r\n elif i == '3':\r\n calories += strips[2] \r\n else:\r\n calories += strips[3]\r\nprint(calories)\r\n", "values = list(map(int,input().split()))\r\ns = input()\r\nsum = 0\r\nfor value in s :\r\n if value == '1' :\r\n sum+=values[0]\r\n elif value == '2' :\r\n sum+=values[1]\r\n elif value == '3' :\r\n sum+=values[2]\r\n else:\r\n sum+=values[3]\r\n\r\n\r\n\r\nprint(sum)", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Mon Apr 3 23:40:19 2023\r\n\r\n@author: Srusty Sahoo\r\n\"\"\"\r\n\r\na=list(map(int,input().split()))\r\nstring=input()\r\ns=0\r\nfor i in range(len(string)):\r\n s=s+a[int(string[i])-1]\r\n\r\nprint(s)\r\n ", "events = [int(x) for x in input().split(' ')]\r\ngame = [int(x) for x in input()]\r\nsum=0\r\nfor i in game:\r\n sum+=events[i-1]\r\n \r\nprint(sum)", "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 char_list_input():\r\n s = input()\r\n return list(s[:len(s)-1])\r\n\r\n\r\ndef list_input(type):\r\n return list(map(type, input().split()))\r\n\r\n\r\ndef multi_input():\r\n return map(int, input().split())\r\n\r\n\r\ndef main():\r\n a = list_input(int)\r\n s = str_input()\r\n ans = s.count(\"1\")*a[0]+s.count(\"2\")*a[1] + \\\r\n s.count(\"3\")*a[2]+s.count(\"4\")*a[3]\r\n print(f\"{ans}\\n\")\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "a = [int(_) for _ in input().split()]\n\ns = input() \nres = 0\nfor i in s:\n res += a[int(i)-1]\n\nprint(res)\n", "numbers1 = input()\r\nlist1 = []\r\nnumbers2 = input()\r\nlist2 = []\r\ncount1 = 0\r\ncount2 = 0\r\ncount3 = 0\r\ncount4 = 0\r\nsum = 0\r\n\r\nlist1 = numbers1.split(\" \")\r\nlist1 = [int(element) for element in list1]\r\n \r\nfor i in range(0 , len(numbers2) ) : \r\n list2.append(int((numbers2[i])))\r\n\r\nfor i in list2 : \r\n if i == 1 :\r\n count1 += 1 \r\n elif i == 2 :\r\n count2 += 1 \r\n elif i == 3 :\r\n count3 += 1 \r\n elif i == 4 :\r\n count4 += 1 \r\n\r\ncount1 = count1 * list1[0]\r\ncount2 = count2 * list1[1]\r\ncount3 = count3 * list1[2]\r\ncount4 = count4 * list1[3]\r\n\r\nsum = count1 + count2 + count3 + count4\r\n\r\nprint(sum) ", "import sys\r\nfrom collections import Counter, deque\r\n\r\ninput = lambda: sys.stdin.readline().rstrip()\r\n\r\n\r\ndef solve():\r\n li = list(map(int, input().split()))\r\n s = input()\r\n ans = 0\r\n for c in s:\r\n ans += li[ord(c) - ord('0') -1]\r\n print(ans)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n t = 1\r\n #t = int(input())\r\n for _ in range(t):\r\n solve()\r\n", "x = input().split()\r\ny = [int(i) for i in x]\r\nz = str(input())\r\ns = 0\r\nfor i in z:\r\n c = int(i)\r\n s = s+y[c-1]\r\nprint(s)", "n=list(map(int,input().split()))\r\nl=list(map(int,str(input())))\r\na=n[0]\r\nb=n[1]\r\nc=n[2]\r\nd=n[3]\r\nprint((l.count(1)*a)+(l.count(2)*b)+(l.count(3)*c)+(l.count(4)*d))", "a=list(map(int,input().split()))\r\ns=input()\r\nx=0\r\nfor i in s:\r\n x+=a[int(i)-1]\r\nprint(x)", "a = list(map(int, input().split()))\r\ns = input().strip()\r\n\r\ncalories = 0\r\n\r\nfor char in s:\r\n strip = int(char)\r\n calories += a[strip - 1]\r\n\r\nprint(calories)\r\n", "t=input().split()\r\ns=list(input())\r\nk=0\r\nfor i in s:\r\n k+=int(t[int(i)-1])\r\nprint(k)", "calories = list(map(int, input().split()))\r\ns = input()\r\ntotal_calories = 0\r\nfor char in s:\r\n strip = int(char)\r\n total_calories += calories[strip - 1]\r\nprint(total_calories)\r\n", "def BlackSquare():\r\n calories=list(map(int,input().split()))\r\n total=0\r\n s=input()\r\n for i in s:\r\n total+=calories[int(i)-1]\r\n return total\r\nprint(BlackSquare())", "a1, a2, a3, a4 = map(int, input().split())\r\ns = input()\r\ncal = 0\r\nfor i in range(len(s)):\r\n if (s[i] == \"1\"):\r\n cal += a1\r\n if (s[i] == \"2\"):\r\n cal += a2\r\n if (s[i] == \"3\"):\r\n cal += a3\r\n if (s[i] == \"4\"):\r\n cal += a4\r\nprint(cal)", "num_cal = list(map(int,input().split(' ')))\r\nsquares = list(map(int, str(input())))\r\nbr_cal = 0 \r\nfor i in range(len(squares)):\r\n if squares[i] == 1:\r\n br_cal += num_cal[0]\r\n elif squares[i] == 2:\r\n br_cal += num_cal[1]\r\n elif squares[i] == 3:\r\n br_cal += num_cal[2]\r\n else:\r\n br_cal += num_cal[3] \r\n\r\nprint(br_cal) ", "# Read input values\r\na1, a2, a3, a4 = map(int, input().split())\r\ns = input()\r\n\r\n# Initialize total calories to zero\r\ntotal_calories = 0\r\n\r\n# Iterate through each second in the game\r\nfor second in s:\r\n if second == '1':\r\n total_calories += a1\r\n elif second == '2':\r\n total_calories += a2\r\n elif second == '3':\r\n total_calories += a3\r\n elif second == '4':\r\n total_calories += a4\r\n\r\n# Print the total calories\r\nprint(total_calories)\r\n", "q=list(map(int,input().strip().split()))\r\ns=list(map(int,list(input().strip())))\r\nk=0\r\nfor i in s:\r\n k+=q[i-1]\r\nprint(k)\r\n", "n = [int(x) for x in input().split()]\r\np = input()\r\nc = 0\r\nfor i in range(len(p)):\r\n if p[i] == '1': c+=n[0]\r\n elif p[i] == '2': c+= n[1]\r\n elif p[i] == '3': c+= n[2]\r\n else: c+= n[3]\r\nprint(c)", "import sys\r\n\r\np=[int(x) for x in sys.stdin.readline().split()]\r\nt=sys.stdin.readline().strip()\r\ncnt=0\r\nfor x in t:\r\n cnt+=p[int(x)-1]\r\nprint(cnt)\r\n \r\n", "cal = list(map(int, input().split()))\r\n \r\ngame = input()\r\n \r\nans = cal[0]*game.count('1') + cal[1]*game.count('2') + cal[2]* game.count('3') + cal[3]*game.count('4') \r\n\r\n \r\nprint(ans)", "a1, a2, a3, a4 = map(int, input().split())\r\n\r\n# Read the game process string\r\ns = input()\r\n\r\n# Initialize the total number of calories wasted\r\ntotal_calories = 0\r\n\r\n# Iterate over each character in the game process\r\nfor c in s:\r\n # Convert the character to the strip number\r\n strip_number = int(c)\r\n\r\n # Add the corresponding calories for the strip to the total\r\n if strip_number == 1:\r\n total_calories += a1\r\n elif strip_number == 2:\r\n total_calories += a2\r\n elif strip_number == 3:\r\n total_calories += a3\r\n elif strip_number == 4:\r\n total_calories += a4\r\n\r\n# Print the total number of calories wasted\r\nprint(total_calories)", "a1,a2,a3,a4=map(int,input().split())\r\ns=input()\r\nsum=0\r\nfor i in s:\r\n if i==\"1\":\r\n sum+=a1\r\n elif i==\"2\":\r\n sum+=a2\r\n elif i==\"3\":\r\n sum+=a3\r\n else:\r\n sum+=a4\r\nprint(sum)", "a=[int(i) for i in input().split()]\r\ns=input()\r\nd={}\r\nsum=0\r\nfor i in s:\r\n if i not in d:\r\n d[i]=1\r\n else:\r\n d[i]=d[i]+1\r\n\r\nfor i in d:\r\n if i==\"1\":\r\n sum=sum+(d[i]*a[0])\r\n elif i==\"2\":\r\n sum=sum+(d[i]*a[1])\r\n elif i==\"3\":\r\n sum=sum+(d[i]*a[2])\r\n else:\r\n sum=sum+(d[i]*a[3])\r\nprint(sum)", "a = list(map(int,input().split()))\r\ns = input()\r\nkcal = []\r\nfor i in range(len(s)):\r\n if s[i] == '1':\r\n kcal.append(a[0])\r\n if s[i] == '2':\r\n kcal.append(a[1])\r\n if s[i] == '3':\r\n kcal.append(a[2])\r\n if s[i] == '4':\r\n kcal.append(a[3])\r\nkcal = sum(kcal)\r\nprint(kcal)", "acalories = list(map(int, input().split()))\r\ns = input()\r\nwasted_calories = 0\r\nfor i in s:\r\n i = int(i)\r\n wasted_calories += acalories[i-1]\r\n \r\nprint(wasted_calories)", "n=[int(x) for x in input().split()]\r\nb=input()\r\nt=0\r\nfor i in b:\r\n if i=='1':\r\n t+=n[0]\r\n elif i=='2':\r\n t+=n[1]\r\n elif i=='3':\r\n t+=n[2]\r\n else:\r\n t+=n[3]\r\nprint(t)", "import sys\r\n\r\ninput = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\r\na, b, c, d = map(int, input().split())\r\ns = input()\r\nn = len(s)\r\nans = 0\r\nfor i in range(n):\r\n if s[i] == \"1\":\r\n ans += a\r\n elif s[i] == \"2\":\r\n ans += b\r\n elif s[i] == \"3\":\r\n ans += c\r\n else:\r\n ans += d\r\nprint(ans)", "l1=list(map(int,input().split()))\r\nn=input()\r\nsumcount=0\r\nfor i in range(len(n)):\r\n if n[i]=='1':\r\n sumcount=sumcount+l1[0]\r\n if n[i]=='2':\r\n sumcount=sumcount+l1[1]\r\n if n[i]=='3':\r\n sumcount=sumcount+l1[2]\r\n if n[i]=='4':\r\n sumcount=sumcount+l1[3]\r\nprint(sumcount)", "tiles = input().split()\ncalories = 0\norder = input()\nfor i in order:\n calories += int(tiles[int(i)-1])\nprint(calories)", "li = list(map(int, input().split()))\r\ns = input()\r\nans = 0\r\n\r\nfor i in s:\r\n idx = int(i) - 1\r\n ans += li[idx]\r\nprint(ans)", "a = input()\r\nb = input()\r\na = a.split()\r\nsum = 0\r\nfor i in b:\r\n if i == \"1\":\r\n sum += int(a[0])\r\n if i == \"2\":\r\n sum += int(a[1])\r\n if i == \"3\":\r\n sum += int(a[2])\r\n if i == \"4\":\r\n sum += int(a[3])\r\nprint(sum)", "lst = list(map(int, input().split()))\r\ns = input()\r\n\r\nans = 0\r\nfor char in s:\r\n ans += lst[int(char)-1]\r\n\r\nprint(ans)", "a, b, c, d = input().split()\r\ns=str(input())\r\ncalorias=0\r\n\r\nfor i in s:\r\n if int(i) == 1:\r\n calorias+=int(a)\r\n elif int(i) == 2:\r\n calorias+=int(b)\r\n elif int(i) == 3:\r\n calorias+=int(c)\r\n elif int(i) == 4:\r\n calorias+=int(d)\r\nprint(calorias)", "a,b,c,d=map(int,input().split())\r\ns=input()\r\nd={\"1\":a,\"2\":b,\"3\":c,\"4\":d}\r\nt=0\r\nfor i in s:\r\n t+=d[i]\r\nprint(t)", "l=list(map(int,input().split()))\r\ns=input()\r\nacc=0\r\nfor i in s:\r\n acc+=l[int(i)-1]\r\nprint(acc)", "import sys\r\n\r\na = [int(i) for i in sys.stdin.readline().split()]\r\n\r\ns = sys.stdin.readline()[:-1]\r\n\r\ntotal=0\r\nfor i in range (len(s)):\r\n total+=a[int(s[i])-1]\r\nprint (total)\r\n", "\r\n\r\na = list(map(int, input().split()))\r\ns = str(input())\r\ncalories = 0\r\nfor i in range(len(s)):\r\n # print(s[i])\r\n calories += a[int(s[i])-1]\r\nprint(calories)", "list_1 = [int(x) for x in (input().split())]\r\nstr_1 = input()\r\nsum_1 = 0\r\nfor i in str_1:\r\n int_1 = int(i)\r\n sum_1 += list_1[int_1 - 1]\r\nprint(sum_1)\r\n", "a = list(map(int, input().split()))\r\ns = list(map(int, list(input())))\r\nc = 0\r\nfor i in s:\r\n c+=a[i-1]\r\nprint(c)", "a = list(map(int, input().split()))\r\ns = input()\r\nc = 0\r\nfor x in s:\r\n c += a[int(x)-1]\r\nprint(c)\r\n", "p=[int(i) for i in input().split(' ')]\nl=[int(i) for i in [*input()]]\ns=0\nfor i in l:\n s+=p[i-1]\nprint(s)\n", "a1, a2, a3, a4 = map(int, input().split())\r\n#print(a1, a2, a3, a4)\r\ns = input()\r\n\r\nl = len(s)\r\nc = 0\r\nfor i in range(l):\r\n if s[i] == '1':\r\n c += a1\r\n if s[i] == '2':\r\n c += a2\r\n if s[i] == '3':\r\n c += a3\r\n if s[i] == '4':\r\n c += a4\r\nprint(c)\r\n\r\n ", "a,b,c,d = map(int,input().split())\r\n\r\ns = input()\r\n\r\ncalories = 0 \r\n\r\nfor i in range(len(s)):\r\n\r\n if s[i] == '1':\r\n calories += a \r\n elif s[i] == '2':\r\n calories += b \r\n elif s[i] == '3':\r\n calories += c \r\n else:\r\n calories += d\r\n\r\nprint(calories)\r\n", "a1, a2, a3, a4 = input().split()\na1, a2, a3, a4 = int(a1), int(a2), int(a3), int(a4)\na = input()\ns = 0\nfor i in a:\n if i == '1':\n s += a1\n elif i == '2':\n s += a2\n elif i == '3':\n s += a3\n elif i == '4':\n s += a4\nprint(s)\n \t\t \t\t \t\t\t\t \t\t\t\t \t\t\t \t \t", "a1, a2, a3, a4 = map(int, input().split())\r\ns = input()\r\nsumm = 0\r\nl = list()\r\nfor q in s:\r\n l.append(q)\r\nfor i in l:\r\n if i == '1':\r\n summ += a1\r\n elif i == '2':\r\n summ += a2\r\n elif i == '3':\r\n summ += a3\r\n elif i == '4':\r\n summ += a4\r\nprint(summ)", "c=list(map(int,input().split()))\r\nsum=0\r\nfor i in (list(map(int,input()))):\r\n sum+=c[i-1]\r\nprint(sum)", "my_list=list(map(int,input().split()))\r\n\r\nmy_str=input()\r\nsum1=0\r\n\r\nfor i in range(len(my_str)):\r\n \r\n x=int(my_str[i])\r\n \r\n sum1 += my_list[x-1]\r\n\r\nprint(sum1)", "q = list(map(int, input().split()))\r\nw, t = input(), 0\r\nfor i in range(len(w)):\r\n t += q[int(w[i]) - 1]\r\nprint (t)", "a = list(map(int, input().split()))\r\ns = list(map(int, list(input())))\r\nans = 0\r\nfor i in s:\r\n ans += a[i-1]\r\nprint(ans)", "c=list(map(int,input().split()))\r\ns=input()\r\nsumc=0\r\nfor i in range(len(s)):\r\n if s[i]=='1':\r\n sumc=sumc+c[0]\r\n if s[i]=='2':\r\n sumc=sumc+c[1]\r\n if s[i]=='3':\r\n sumc=sumc+c[2]\r\n if s[i]=='4':\r\n sumc=sumc+c[3]\r\n \r\nprint(sumc) ", "b = input().split()\r\ns = input()\r\nsum = 0\r\nfor i in range(len(s)):\r\n sum += int(b[int(s[i]) - 1])\r\nprint(sum)", "S=input()\r\npTouch = input()\r\nS = S.split(\" \")\r\nTotal=0\r\nfor i in range(len(pTouch)):\r\n i = int(pTouch[i])-1\r\n Total+=int(S[i])\r\nprint(Total)", "my_list = []\r\nindex_list = []\r\nn = 0\r\n\r\nfor x in [1]:\r\n t = map(int, (input()).split())\r\n y = map(int, (input()))\r\n index_list.extend(y)\r\n my_list.extend(t)\r\n\r\n\r\n\r\nfor x in index_list:\r\n n += my_list[int(x) - 1]\r\n\r\nprint(n)\r\n\r\n", "s=list(map(int,input().split()))\r\nb=input()\r\nc=0\r\nfor i in b:\r\n if i==\"1\":\r\n c+=s[0]\r\n elif i==\"2\":\r\n c+=s[1]\r\n elif i==\"3\":\r\n c+=s[2]\r\n elif i==\"4\":\r\n c+=s[3]\r\nprint(c)\r\n", "a,b,c,d = [int(el) for el in input().split(\" \")]\r\ns = input()\r\n \r\ndef number_calories(a,b,c,d, s) :\r\n dict = {\"1\":a, \"2\":b, \"3\":c, \"4\":d}\r\n calories = 0\r\n for el in s :\r\n calories= calories + dict[el]\r\n print(calories)\r\n \r\nnumber_calories(a,b,c,d, s)\r\n", "c = list(map(int, input().split())) \r\ng = input()\r\na = g.count('1') * c[0] + g.count('2') * c[1] \\\r\n + g.count('3') * c[2] + g.count('4') * c[3]\r\nprint(a)", "calories = list(map(int, input().split()))\r\nbuttons = input()\r\n\r\nresult = 0\r\nfor button in buttons:\r\n result += calories[int(button)-1]\r\n\r\nprint(result)", "a1, a2, a3, a4 = map(int, input().split())\r\ns = input()\r\nctr = 0\r\nfor i in s:\r\n if i=='1':\r\n ctr += a1\r\n elif i=='2':\r\n ctr += a2\r\n elif i=='3':\r\n ctr += a3\r\n elif i=='4':\r\n ctr += a4\r\nprint(ctr)", "c=[*map(int,input().split())]\r\ns=[*map(int,input())]\r\nr=0\r\nfor i in s: r+=c[i-1]\r\nprint(r)", "def split(string, sep=\" \"):\n prev = 0\n for i, char in enumerate(string):\n if char == sep:\n if i != prev:\n yield string[prev:i]\n prev = i + 1\n\n ret = string[prev:]\n if ret:\n yield ret\n\na = list(map(int, split(input())))\nc = 0\nfor x in input():\n c += a[int(x) - 1]\n\nprint(c)", "n=input().split()\r\ns=input()\r\nw=int(max(n))\r\nc=0\r\nfor i in s:\r\n if i==\"1\":\r\n c+=int(n[int(i)-1])\r\n elif i==\"2\":\r\n c+=int(n[int(i)-1])\r\n elif i==\"3\":\r\n c+=int(n[int(i)-1])\r\n elif i==\"4\":\r\n c+=int(n[int(i)-1])\r\nprint(c)\r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n ", "from sys import stdin\r\na,b,c,e=list(map(int,stdin.readline().split()))\r\nd={'1':0,'2':0,'3':0,'4':0,'\\n':-1}\r\nfor i in stdin.readline():\r\n d[i]+=1\r\nprint(d['1']*a+d['2']*b+d['3']*c+d['4']*e)", "a1,a2,a3,a4 = map(int,input().split())\r\ns = str(input())\r\ncalorie=0\r\n\r\nfor i in s:\r\n if i =='1':\r\n calorie = calorie + a1\r\n elif i=='2':\r\n calorie = calorie + a2\r\n elif i=='3':\r\n calorie = calorie + a3\r\n elif i=='4':\r\n calorie = calorie + a4\r\nprint(calorie)\r\n", "energy = {str(i+1): int(cost) for i, cost in enumerate(input().split())}\nres = sum(map(lambda c: energy[c], input()))\nprint(res)\n", "a, b, c, d = map(int, input(). split())\r\ns = input()\r\nans = 0\r\nfor i in s:\r\n if i == '1':\r\n ans += a\r\n elif i == '2':\r\n ans += b\r\n elif i == '3':\r\n ans += c\r\n else:\r\n ans += d\r\nprint(ans)\r\n", "a = list(map(int, input().split()))\r\ns = input()\r\ncal = 0\r\n\r\nfor x in s:\r\n cal += a[int(x) - 1]\r\nprint(cal)", "a=list(map(int,input().split()))\r\nd=input()\r\nc=0\r\nfor x in range(len(d)):\r\n c+=a[int(d[x])-1]\r\nprint(c)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "calories = list(map(int, input().split()))\r\n\r\ntaps = input()\r\nans =0 \r\nfor i in range(len(taps)):\r\n ans += calories[int(taps[i])-1]\r\n\r\nprint(ans)", "\r\n\r\na = input().split()\r\nmap = {}\r\nfor i in range(len(a)):\r\n a[i] = int(a[i])\r\n map[i+1] = a[i]\r\n\r\ns = input()\r\ntotal = 0\r\nfor i in range(len(s)):\r\n total += map[int(s[i])]\r\n\r\nprint(total)", "a=list(map(int,input().split()))[:4]\r\ns=str(input())\r\nsum=0\r\nfor i in s:\r\n if i =='1':\r\n sum+=a[0]\r\n elif i =='2':\r\n sum+=a[1]\r\n elif i=='3':\r\n sum+=a[2]\r\n elif i=='4':\r\n sum+=a[3]\r\nprint(sum)", "a=[] \r\na=list(map(int,input().split()))\r\nb=input()\r\nsum=0\r\nfor i in range(len(b)):\r\n sum+=a[int(b[i])-1]\r\nprint(sum) ", "s1=input()\r\ns1=s1.split()\r\na1=int(s1[0])\r\nb1=int(s1[1])\r\nc1=int(s1[2])\r\nd1=int(s1[3])\r\ns2=input()\r\na=0\r\nb=0\r\nc=0\r\nd=0\r\nfor i in range(len(s2)):\r\n if s2[i]=='1':\r\n a=a+1\r\n elif s2[i]=='2':\r\n b=b+1\r\n elif s2[i]=='3':\r\n c=c+1\r\n else:\r\n d=d+1\r\nA=a1*a\r\nB=b1*b\r\nC=c1*c\r\nD=d1*d\r\no=A+B+C+D\r\nprint(o)\r\n", "a = [int(i) for i in input().split()]\r\nb = [int(i)-1 for i in input()]\r\ns = 0\r\nfor i in b:\r\n s += a[i]\r\nprint(s)\r\n", "a = list(map(int,input().split()))\r\nb = list(map(int,input()))\r\nprint(sum([a[i-1] for i in b]))", "a = list(map(int, input().split()))\r\ns = input()\r\ncount, m = 0, []\r\nfor i in s:\r\n m.append(int(i))\r\nfor i in m:\r\n count += a[i - 1]\r\nprint(count)\r\n", "a = [int(el) for el in input().split()]\r\ns = [int(el) for el in input()]\r\ncalories = 0\r\nfor el in s:\r\n calories += a[el - 1]\r\nprint(calories)\r\n", "a=list(map(int,input().split()));k=0\r\nb=input()\r\nfor i in b:k+=a[int(i)-1]\r\nprint(k)", "a=[]\r\na=list(map(int,input().split()))\r\ns=\"\"\r\ns=input()\r\nans=0\r\nfor x in s:\r\n ans+=a[int(x)-1]\r\nprint(ans)", "a = [int(i) for i in input().split()]\r\ns = input()\r\nres = 0\r\nfor i in s:\r\n res += a[int(i) - 1]\r\nprint(res)", "a1,a2,a3,a4 = map(int,input().split(\" \"))\r\ns = input()\r\nsumma = 0\r\nfor i in range(len(s)):\r\n if s[i] == '1':\r\n summa = summa + a1\r\n if s[i] == '2':\r\n summa = summa + a2\r\n if s[i] == '3':\r\n summa = summa + a3\r\n if s[i] == '4':\r\n summa = summa + a4\r\nprint(summa)", "\r\ncosts = list(map(int, input().split()))\r\ntouches = input()\r\nsum=0\r\n\r\nfor i in range(len(touches)):\r\n sum+= costs[int(touches[i])-1]\r\n\r\nprint(sum)", "if __name__ == \"__main__\":\r\n\r\n\tstrip = [int(i) for i in input().split()]\r\n\tseq = input()\r\n\r\n\ttotal = 0\r\n\tfor i in seq:\r\n\t\ttotal += strip[int(i)-1]\r\n\tprint(total)", "import sys\r\n\r\ninput = sys.stdin.readline\r\n\r\n\r\ndef print(*args, end='\\n', sep=' ') -> None:\r\n sys.stdout.write(sep.join(map(str, args)) + end)\r\n\r\n\r\ndef solve(a: list, n: list) -> str:\r\n print(sum(map(lambda x: n[x - 1], a)))\r\n\r\n\r\ndef main() -> None:\r\n *n, = map(int, input().split())\r\n a = map(int, input().strip())\r\n solve(a, n)\r\n\r\n\r\nif __name__ == '__main__':\r\n main()", "x=list(map(int,input().split()))\r\ny=input()\r\nindex=[]\r\nsum=0\r\nfor k in range (0,len(x)):\r\n index.append(k+1)\r\nfor i in y:\r\n if int(i)==index[0]:\r\n sum=sum+x[0]\r\n if int(i)==index[1]:\r\n sum=sum+x[1]\r\n if int(i)==index[2]:\r\n sum=sum+x[2]\r\n if int(i)==index[3]:\r\n sum=sum+x[3]\r\nprint(sum)", "stripes = list(map(int, input().split()))\r\nseconds = input()\r\ncalories = 0\r\nfor i in range(len(seconds)):\r\n calories += stripes[int(seconds[i])-1]\r\n if(i== len(seconds)-1):\r\n break\r\nprint(calories)", "a, b, c, d = [int(item) for item in input().split()]\r\nn = list(input())\r\ntemp = 0\r\ntemp += (n.count('1') * a)\r\ntemp += (n.count('2') * b)\r\ntemp += (n.count('3') * c)\r\ntemp += (n.count('4') * d)\r\nprint(temp)\r\n", "a,b,c,d = map(int,input().split())\r\n\r\ns = input()\r\n\r\ncounter = 0\r\n\r\nfor i in s:\r\n if i == '1':\r\n counter+=a\r\n elif i == '2':\r\n counter+=b\r\n elif i == '3':\r\n counter+=c\r\n elif i == '4':\r\n counter+=d\r\n\r\n\r\nprint(counter)\r\n", "def main() -> None :\r\n STRIP_CALORIES:list[int] = list(map(int, input().split()))\r\n GAME_STRIP_INDEXES:list[int] = list(map(int, input()))\r\n\r\n TOTAL_CALORIES:int = sum([STRIP_CALORIES[strip_index-1] for strip_index in GAME_STRIP_INDEXES])\r\n\r\n print(TOTAL_CALORIES)\r\n \r\nmain()", "a = list(map(int, input().split()))\r\ns = input()\r\nk = 0\r\nfor i in range(len(s)):\r\n k += a[int(s[i])-1]\r\nprint(k)\r\n", "a1,a2,a3,a4=map(int,input().split())\r\ns=input()\r\ns=list(s)\r\nprint((s.count('1')*a1)+(s.count('2')*a2)+(s.count('3')*a3)+(s.count('4')*a4))\r\n", "k =[int(i) for i in input().split()]\r\nd =[int(i)-1 for i in input()]\r\nm = 0\r\nfor i in d:\r\n m += k[i]\r\nprint(m)", "x = input().split()\r\ny = input()\r\ncounter = 0\r\nfor i in y:\r\n counter += int(int(x[int(i)-1]))\r\nprint(counter)", "cals = input().split()\nseq = input()\n\nans = 0\nfor i in seq:\n ans += int(cals[int(i)-1])\n\nprint(ans)", "a,b,c,d=map(int,input().split())\r\nsum=0\r\nparsa=input()\r\nfor i in range(0,len(parsa),1):\r\n if parsa[i]=='1':\r\n sum+=a\r\n elif parsa[i]=='2':\r\n sum+=b\r\n elif parsa[i]=='3':\r\n sum+=c\r\n elif parsa[i]=='4':\r\n sum+=d\r\nprint(sum) ", "a = list(map(int, input().split()))\r\ns = input()\r\nc= 0\r\nfor cc in s:\r\n s = int(cc) - 1\r\n c += a[s]\r\n\r\nprint(c)\r\n", "l_a = list(map(int, input().split()))\ns = input()\nt_c = 0\n\nfor c in s:\n t_c += l_a[int(c) - 1]\n\nprint(t_c)\n\n", "a1,a2,a3,a4=map(int,input().split())\r\ns=input()\r\nt=0\r\nfor i in s:\r\n if i=='1':\r\n t=t+a1\r\n if i=='2':\r\n t=t+a2\r\n if i=='3':\r\n t=t+a3\r\n if i=='4':\r\n t=t+a4\r\nprint(t)", "\r\nlt = [int(x) for x in input().split()]\r\ncount = 0\r\nsequence = input()\r\nfor i in sequence:\r\n count += lt[int(i) - 1]\r\nprint(count)\r\n\r\n\r\n", "#1 5 3 2\r\n#11221\r\n\r\nweights = [int(x) for x in input().strip().split()]\r\nboxes = input().strip()\r\noutput = 0\r\n\r\nfor box in boxes:\r\n box = int(box)\r\n output+= weights[box -1]\r\n \r\nprint(output)\r\n\r\n", "*a,=map(int,input().split())\r\nprint(sum(a[int(i)-1] for i in list(input())))", "cal= list(map(int,input().split()))\r\nn= list(input())\r\ntot= 0\r\nfor i in n:\r\n tot+= cal[int(i)-1]\r\nprint(tot)", "#431A\r\n\r\nl=list(map(int,input().split()))\r\ns=input()\r\nz=0\r\nfor i in s:\r\n j=int(i)\r\n z+=l[j-1]\r\nprint(z)\r\n", "import sys\r\n\r\n# sys.stdin = open(\"input.txt\", \"r\")\r\n# sys.stdout = open(\"output.txt\", \"w\")\r\n\r\n\r\ndef 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(s, arr):\r\n ans = 0\r\n for i in s:\r\n ans += arr[int(i) - 1]\r\n return ans\r\n\r\n\r\ndef main():\r\n arr = in_arr_int()\r\n s = in_str()\r\n print(solve(s, arr))\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n\r\n\r\n# n = 6\r\n", "a,b,c,d=map(int,input().split())\r\nl=input()\r\nsum=0\r\nfor i in l:\r\n if i=='1':\r\n sum+=a\r\n elif i=='2':\r\n sum+=b\r\n elif i=='3':\r\n sum+=c\r\n elif i=='4':\r\n sum+=d\r\nprint(sum)", "a, b, c, d = map(int, input().split())\r\n\r\nst = input()\r\n\r\nans = 0\r\n\r\nfor i in st:\r\n\tif i=='1':\r\n\t\tans += a\r\n\telif i == '2':\r\n\t\tans += b\r\n\telif i == '3':\r\n\t\tans += c\r\n\telif i == '4':\r\n\t\tans += d\r\n\r\nprint(ans)\r\n", "a1,a2,a3,a4=map(int,input().split())\r\ns=input()\r\nA1=int(a1)\r\nA2=int(a2)\r\nA3=int(a3)\r\nA4=int(a4)\r\nb1=s.count('1')\r\nb2=s.count('2')\r\nb3=s.count('3')\r\nb4=s.count('4')\r\nf1=A1*b1\r\nf2=A2*b2\r\nf3=A3*b3\r\nf4=A4*b4\r\nprint(f1+f2+f3+f4)", "list1 = list(map(int, input().split()))\r\nlist2 = list(map(int, input().strip()))\r\nwasted_calories = 0\r\n\r\nfor i in list2:\r\n wasted_calories += list1[i - 1]\r\n\r\nprint(wasted_calories)", "chords = list(map(int, input().split(' ')))\r\nseq = list(map(int,input()))\r\ncount=0\r\nfor note in seq:\r\n if note == 1:\r\n count += chords[0]\r\n elif note == 2:\r\n count += chords[1]\r\n elif note == 3:\r\n count += chords[2]\r\n else:\r\n count += chords[3]\r\nprint(count)", "l = input().split()\r\ns = input()\r\nc = 0\r\nfor i in range(len(l)):\r\n for j in range(len(s)):\r\n if int(s[j]) == (i + 1):\r\n c += int(l[i])\r\nprint(c)\r\n", "v1=list(map(int,input().split()))\r\ns = list(input())\r\nc = 0\r\nfor i in s:\r\n c+=v1[int(i)-1]\r\nprint(c)", "a=input().split()\r\ns=list(input())\r\nw=0\r\nfor i in s:\r\n\tw=w+int(a[int(i)-1])\r\nprint(w)", "cals = list(map(int,input().split()))\r\ns = input()\r\nans_cals = 0\r\nfor i in s:\r\n ans_cals += cals[int(i)-1]\r\n\r\nprint(ans_cals)", "def main():\r\n weights = list(map(int, input().split()))\r\n result = 0\r\n for i in input():\r\n result += weights[int(i)-1]\r\n print(result)\r\n\r\n \r\nmain()", "calories = input().split()\r\ncounts ={}\r\nfor i in range(1,5):\r\n counts[str(i)] = int(calories[i-1])\r\n\r\ncals = input()\r\n\r\ncount =0\r\nfor letter in cals:\r\n count += counts[letter]\r\nprint(count)", "y = [int(item) for item in input().split()]\r\nz=str(input())\r\na= z.count(\"1\")\r\nb= z.count(\"2\")\r\nc= z.count(\"3\")\r\nd= z.count(\"4\")\r\ne= a*y[0]+b*y[1]+c*y[2]+d*y[3]\r\nprint(e)\r\n", "a = [*map(int, input().split())]\r\n\r\nprint(sum(a[int(i) - 1] for i in map(int, input())))", "n=list(map(int,input().split()))\r\na=input()\r\nsumm=0\r\nfor b in a:\r\n\tsumm+=n[int(b)-1]\r\nprint(summ)\r\n\r\n", "a=list(map(int,input().split()))\r\ns=input()\r\nans=0\r\nfor i in range(len(s)):\r\n\tans+=a[int(s[i])-1]\r\nprint(ans)", "cal = list(map(int, input().split()))\r\nvals = list(map(int, input()))\r\ntotal = 0\r\nfor v in vals:\r\n total += cal[v-1]\r\nprint(total)", "a=list(map(int,input().split()))\r\nb=list(input())\r\nc=0\r\nfor j in b:\r\n if j==\"1\":\r\n c+=a[0]\r\n elif j==\"2\":\r\n c+=a[1]\r\n elif j==\"3\":\r\n c+=a[2]\r\n elif j==\"4\":\r\n c+=a[3]\r\n \r\nprint(c)\r\n", "carlo=[int(x)for x in input().split()]\r\nspilt=input()\r\ntotal=0\r\nfor i in spilt:\r\n if i=='1':\r\n total+=carlo[0]\r\n elif i=='2':\r\n total+=carlo[1]\r\n elif i=='3':\r\n total+=carlo[2]\r\n else:\r\n total+=carlo[3]\r\n\r\nprint(total)", "a = list(map(int, input().split()))\r\ns = input()\r\n\r\ncalories = 0\r\nfor char in s:\r\n a_index = int(char) - 1\r\n calories += a[a_index]\r\n\r\nprint(calories)\r\n", "a,b,c,d=map(int,input().split())\r\nlst=list(map(str,input()))\r\np=0\r\nfor i in lst:\r\n if i=='1':\r\n p+=a\r\n elif i=='2':\r\n p+=b\r\n elif i=='3':\r\n p+=c\r\n else:\r\n p+=d\r\nprint(p)", "ai = [int(x) for x in input().split()]\r\ns = input()\r\nc=0\r\n\r\nfor i in s:\r\n c+=ai[int(i)-1]\r\n\r\nprint(c)", "n = list(map(int, input().split()))\r\ns = input()\r\nc=0\r\n\r\nfor i in s:\r\n c+=n[int(i)-1]\r\n\r\nprint(c)", "a = list(map(int, input().split()))\r\ns = 0\r\nfor j in input():\r\n s+=a[int(j)-1]\r\nprint(s)", "n=list(map(int,input().split()))\r\ns=input()\r\nc=0\r\nfor i in range(0,len(s)):\r\n if s[i]=='1':\r\n c=c+n[0]\r\n if s[i]=='2':\r\n c=c+n[1]\r\n if s[i]=='3':\r\n c=c+n[2]\r\n if s[i]=='4':\r\n c=c+n[3]\r\n \r\nprint(c) ", "s = input().split()\r\nb = input()\r\nsum = 0\r\nfor i in range(len(b)):\r\n sum += int(s[int(b[i]) - 1])\r\nprint(sum)", "arr = list(map(int, input().split())); map1 = dict(); counter = 0\r\nfor i in range(1, 5): map1[str(i)] = arr[i-1]\r\nfor i in input(): counter += map1[i]\r\nprint(counter)", "a = list(map(int, input().split()))\nd = input()\n\nr = 0\n\nfor n in d:\n r += a[int(n)-1]\n\nprint(r)\n \t \t\t\t \t\t \t \t \t\t \t", "count=0\r\nn=list(map(int,input().split(\" \")))\r\nm=input()\r\nfor i in m:\r\n count+=n[int(i)-1]\r\nprint(count) ", "a1,a2,a3,a4=input('').split()\r\nstring=input('')\r\nans=0\r\nfor i in range(0,len(string)):\r\n if string[i]=='1': ans+=int(a1)\r\n elif string[i]==\"2\":ans+=int(a2)\r\n elif string[i]==\"3\":ans+=int(a3)\r\n elif string[i]==\"4\":ans+=int(a4)\r\nprint(ans)", "a,b,c,d = map(int,input().split())\r\ns = input();res=0\r\nfor i in s:\r\n if i == \"1\":\r\n res+=a\r\n elif i == \"2\":\r\n res+=b\r\n elif i == \"3\":\r\n res+=c\r\n elif i == \"4\":\r\n res+=d\r\n\r\nprint(res)", "a = input().split(' ')\r\ns = list(input())\r\nsm = []\r\nfor x in s:\r\n y = int(x)\r\n sm.append(a[y-1])\r\naaa = list(map(int,sm))\r\nprint(sum(aaa))", "import sys, math\r\ninput = sys.stdin.readline\r\n\r\na = [int(x) for x in input().split()]\r\ns = input().strip()\r\nans = 0\r\nfor i in range(len(s)):\r\n ans += a[int(s[i]) - 1]\r\nprint(ans)", "x=input()\r\ny=input()\r\nl=x.split(\" \")\r\ns=0\r\nfor i in range(len(l)):\r\n s+=y.count(str(i+1))*int(l[i])\r\nprint(s) ", "a1,a2,a3,a4 = map(int, input().split())\r\ncalories = 0\r\ns = input()\r\nfor i in s:\r\n if i == '1':\r\n calories+=a1\r\n elif i == '2':\r\n calories+=a2\r\n elif i == '3':\r\n calories += a3\r\n elif i == '4':\r\n calories+=a4\r\n\r\nprint(calories)", "a=list(map(int,input().split()))\r\ns=input()\r\ntc=0\r\nfor i in s:\r\n tc+=a[int(i)-1]\r\nprint(tc)", "if __name__ == '__main__':\r\n calories = [int(i) for i in input().split()]\r\n game_rounds = input()\r\n total_calories = 0\r\n for index in range(len(game_rounds)):\r\n total_calories += calories[int(game_rounds[index])-1]\r\n print(total_calories)\r\n \r\n \r\n\r\n\r\n\r\n", "y=[int(x) for x in input().split()]\r\nz=input()\r\nw=0\r\nfor x in z:\r\n w+=y[ord(x)-ord('1')]\r\nprint(w)\r\n", "nums = list(map(int, input().split()))\nmoves = list(map(int, input()))\ntot = 0\n\nfor move in moves:\n tot += nums[move - 1]\n\nprint(tot)", "# from collections import defaultdict\r\n# t = int(input())\r\n# while t > 0:\r\n# n = int(input())\r\n# a = input().split()\r\n# a = [int(x) for x in a]\r\n \r\n# mp = defaultdict(int)\r\n# for i in a:\r\n# mp[i] += 1\r\n \r\n# s = 2*mp[2] + mp[1]\r\n \r\n \r\n# if s%2 != 0:\r\n# print(\"NO\")\r\n# else:\r\n \r\n \r\n \r\n \r\n# t -= 1\r\n\r\n\r\nfrom collections import defaultdict\r\n\r\nmp = defaultdict(int)\r\nmp[1],mp[2],mp[3],mp[4] = input().split()\r\nmp[1],mp[2],mp[3],mp[4] = int(mp[1]),int(mp[2]),int(mp[3]),int(mp[4])\r\n\r\nres = 0\r\ns = input()\r\nfor c in s:\r\n n = int(c)\r\n res += mp[n]\r\nprint(res)\r\n\r\n\r\n", "a1, a2, a3, a4 = map(int, input().split())\r\ns = input()\r\n\r\ncalories = 0\r\nfor c in s:\r\n if c == '1':\r\n calories += a1\r\n elif c == '2':\r\n calories += a2\r\n elif c == '3':\r\n calories += a3\r\n elif c == '4':\r\n calories += a4\r\n\r\nprint(calories)", "a = list(map(int,input().split()))\r\ns = input()\r\nm =[integer for integer in s]\r\ncalories = 0\r\nfor i in m:\r\n if i == '1':\r\n calories += a[0]\r\n elif i == '2':\r\n calories += a[1]\r\n elif i == '3':\r\n calories += a[2]\r\n elif i == '4':\r\n calories += a[3]\r\nprint(calories)", "a = list(map(int, input().split(' ')))\n\nc = 0\nfor i in input():\n c += a[int(i)-1]\nprint(c)\n", "a,b,c,d = map(int, input().split()) \ncal = [0,a,b,c,d]\nstring = input()\nans = 0\nfor i in string:\n ans += cal[int(i)]\nprint(ans)\n", "li= list(map(int, input().split()))\r\nx = input()\r\ncal = 0\r\nfor i in x:\r\n if i == '1':\r\n cal = cal + li[0]\r\n elif i == '2':\r\n cal = cal + li[1]\r\n elif i == '3':\r\n cal = cal + li[2]\r\n elif i == '4':\r\n cal = cal + li[3]\r\nprint(cal)", "calories = [int(calory) for calory in input().split()]\r\nsquares = input()\r\ntotal_calories = 0\r\nfor square in squares:\r\n total_calories = total_calories + calories[int(square)-1]\r\nprint(total_calories)", "x = list(map(int,input().split()))\r\nl = input()\r\nans = 0\r\nfor i in l:\r\n ans = ans + x[int(i)-1]\r\nprint(ans)", "# The problem can be solved by counting the number of squares on each strip \r\n# and multiplying it by the corresponding calorie cost.\r\n\r\ndef blackSquare(a, s):\r\n calories = 0\r\n for i in s:\r\n if i == '1':\r\n calories += a[0]\r\n elif i == '2':\r\n calories += a[1]\r\n elif i == '3':\r\n calories += a[2]\r\n else:\r\n calories += a[3]\r\n return calories\r\n\r\na = [int(x) for x in input().split()]\r\ns = input()\r\nprint(blackSquare(a, s))\r\n", "a,b,c,d=map(int,input().split()); cal=0\r\nfor i in input():\r\n if int(i)==1:cal+=a\r\n elif int(i)==2:cal+=b\r\n elif int(i)==3:cal+=c\r\n else:cal+=d\r\nprint(cal)\r\n", "a = [int(i) for i in input().split()]\r\nb = input()\r\n\r\nc = 0\r\nfor i in range(len(b)):\r\n if int(b[i])-1 == 0:\r\n c += a[0]\r\n elif int(b[i])-1 == 1:\r\n c += a[1]\r\n elif int(b[i])-1 == 2:\r\n c += a[2]\r\n else:\r\n c += a[3]\r\nprint(c)", "calories = list(map(int, input().split()))\r\nseqience = input()\r\ntot = 0\r\nfor i in seqience :\r\n if i == \"1\" :\r\n tot += calories[0]\r\n\r\n elif i == \"2\" :\r\n tot += calories[1]\r\n\r\n elif i == \"3\" :\r\n tot += calories[2]\r\n\r\n elif i == \"4\" :\r\n tot += calories[3]\r\n\r\nprint(tot)", "cals = [int(a) for a in input().split()]\r\nins = [int(a) for a in list(input())]\r\n\r\nsum = cals[0] * ins.count(1) + cals[1] * ins.count(2) + cals[2] * ins.count(3) + cals[3] * ins.count(4)\r\nprint(sum)\r\n", "a1, a2, a3, a4 = map(int,input().split())\r\n\r\nc = 0\r\n\r\nn = list(input())\r\n\r\nfor i in range(len(n)):\r\n if n[i] == '1':\r\n c += a1\r\n elif n[i] == '2':\r\n c += a2\r\n elif n[i] == '3':\r\n c += a3\r\n else:\r\n c += a4\r\n\r\nprint(c)", "cal=(input())\r\njugadas=(input())\r\ncal=cal.split()\r\nsalida=0\r\nfor i in range (0,len(jugadas)):\r\n salida=salida+int(cal[int(jugadas[i])-1])\r\nprint(salida)\r\n", "def li():\r\n return list(map(int,input().split()))\r\ndef gi(n):\r\n return [list(map(int,input().split())) for _ in range(n)]\r\n\r\n# File input\r\n\r\n# import sys\r\n# sys.stdin = open('user.txt','r')\r\n\r\na1,a2,a3,a4 = li()\r\ng = input()\r\nans = 0\r\nfor i in g:\r\n if i == '1':\r\n ans += a1\r\n elif i == '2':\r\n ans += a2\r\n elif i == '3':\r\n ans +=a3\r\n else:\r\n ans += a4\r\nprint(ans)", "arr=[0]+list(map(int,input().split()))\r\ns=input()\r\nans=0\r\nfor x in s:\r\n ans+=arr[int(x)]\r\nprint(ans)", "cal = list(map(int, input().split()))\r\n\r\ntouch = list(map(int, input()))\r\n\r\n\r\nres = 0\r\n\r\nfor i in touch:\r\n if i == 1:\r\n res += cal[0]\r\n elif i == 2:\r\n res += cal[1]\r\n elif i == 3:\r\n res += cal[2]\r\n else:\r\n res += cal[3]\r\n\r\nprint(res)\r\n", "s=input()\r\na1,a2,a3,a4=(int(a)for a in s.split())\r\ns1=input()\r\nw=0\r\nfor i in range(len(s1)):\r\n if s1[i]==\"1\":\r\n w+=a1\r\n if s1[i]==\"2\":\r\n w+=a2\r\n if s1[i]==\"3\":\r\n w+=a3\r\n if s1[i]==\"4\":\r\n w+=a4\r\n \r\nprint(w)", "count = 0\r\ncalories_for_each_squares = input().strip().split()\r\nmylist = list(map(int,calories_for_each_squares))\r\nsquares_num = input().strip()\r\nfor i in squares_num :\r\n if i == \"1\" :\r\n count = count + mylist[0]\r\n elif i == \"2\" :\r\n count = count + mylist[1]\r\n elif i == \"3\" :\r\n count = count + mylist[2]\r\n else :\r\n count = count + mylist[3]\r\nprint(count)\r\n", "x = list(map(int, input().split()))\r\ns = input()\r\ncount = 0\r\nfor i in range(len(s)):\r\n if s[i] == \"1\":\r\n count = count+x[0]\r\n if s[i] == \"2\":\r\n count = count + x[1]\r\n if s[i] == \"3\":\r\n count = count+x[2]\r\n if s[i] == \"4\":\r\n count = count+x[3]\r\nprint(count)", "from tokenize import Number\n\n\nx = list(map(int, input().split()))\n\nsttr = input()\ncont = 0\nfor digit in sttr:\n z = int(digit)\n cont += x[z-1]\n\nprint(cont)", "# Read in the input\r\na1, a2, a3, a4 = map(int, input().split())\r\ns = input().strip()\r\n\r\n# Keep track of the total number of calories\r\ntotal = 0\r\n\r\n# Iterate over each character in the string\r\nfor ch in s:\r\n # Add the corresponding value from the input\r\n if ch == '1':\r\n total += a1\r\n elif ch == '2':\r\n total += a2\r\n elif ch == '3':\r\n total += a3\r\n elif ch == '4':\r\n total += a4\r\n\r\n# Print the total number of calories\r\nprint(total)\r\n", "a=[int(s) for s in input().split()]\r\ns=input()\r\nss=0\r\nfor k in s:\r\n ss+=a[int(k)-1]\r\nprint(ss)\r\n", "lists=list(map(int,input().split()))\r\nstring=input()\r\nt=0\r\nfor i in string:\r\n if i=='1':\r\n t+=lists[0]\r\n elif i=='2':\r\n t+=lists[1]\r\n elif i=='3':\r\n t+=lists[2]\r\n else:\r\n t+=lists[3]\r\nprint(t)", "a,b,c,d=[int(i) for i in input().split()]\r\ns=input()\r\ncals=0\r\nfor g in s:\r\n\tif g==\"1\":\r\n\t\tcals+=a\r\n\telif g==\"2\":\r\n\t\tcals+=b\r\n\telif g==\"3\":\r\n\t\tcals+=c\r\n\telse:\r\n\t\tcals+=d\r\nprint(cals)", "cal = input()\r\ncal = list(str.split(cal))\r\ncal = [int(a) for a in cal]\r\ns = input()\r\ncals = 0\r\nfor i in range(len(s)):\r\n if s[i] == \"1\" :\r\n cals += cal[0]\r\n elif s[i] == \"2\" :\r\n cals += cal[1]\r\n elif s[i] == \"3\" :\r\n cals += cal[2]\r\n elif s[i] == \"4\" :\r\n cals += cal[3]\r\n\r\nprint(cals)", "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\nimport itertools\r\nimport datetime\r\nfrom itertools import permutations\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 = [int(i) for i in input().split()]\r\n s = input()\r\n count = 0\r\n for i in s:\r\n i = int(i)\r\n count += a[i - 1]\r\n print(count)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n\r\n", "a1, a2, a3, a4 = map(int, input().split())\nslov = {'1': a1,\n '2': a2,\n '3': a3,\n '4': a4\n }\ns = input()\nsumm = 0\nfor i in s:\n summ += slov[i]\nprint(summ)\n", "a = list(map(int,input().split()))\ns = input()\nans = 0\nfor i in range(len(s)):\n ans += a[int(s[i])-1]\nprint(ans)\n \n", "a = list(map(int,input().split())) \r\nnums = list(map(int,list(input()))) \r\nprint((a[0] * nums.count(1)) + (a[1] * nums.count(2)) + (a[2] * nums.count(3)) + (a[3] *nums.count(4)))", "a,b,c,d=map(int,input().split())\r\nS=input()\r\ns=0\r\nfor i in range(len(S)):\r\n if S[i]=='1':s+=a\r\n elif S[i]=='2':s+=b\r\n elif S[i]=='3':s+=c\r\n elif S[i]=='4':s+=d\r\nprint(s)", "n = input().split(\" \")\r\ns = input().strip()\r\nans = 0\r\nfor i in s :\r\n ans = ans + int( n[ int(i) - 1 ] )\r\n\r\nprint(ans)", "a = list(map(int,(input().split())))\r\n\r\nb = list(map(int, input()))\r\n\r\ncount = 0\r\n\r\nfor i in range(len(b)):\r\n if b[i] == 1:\r\n count += a[0]\r\n elif b[i] == 2:\r\n count += a[1]\r\n elif b[i] == 3:\r\n count += a[2]\r\n elif b[i] == 4:\r\n count += a[3]\r\n\r\nprint(count)\r\n \r\n\r\n", "a = list(map(int, input().split()))\r\ns = input()\r\ndef ret(n):\r\n if n == 1: return a[0]\r\n elif n == 2: return a[1]\r\n elif n == 3: return a[2]\r\n elif n == 4: return a[3]\r\n\r\nsumma = 0\r\nfor i in s:\r\n summa += ret(int(i))\r\nprint(summa)", "calories = list(map(int, input().split()))\r\ns = input().strip()\r\n\r\ntotal_calories = 0\r\n\r\nfor second in s:\r\n strip_number = int(second) - 1 # Adjust for 0-based indexing\r\n total_calories += calories[strip_number]\r\n\r\nprint(total_calories)\r\n", "a,b,c,d=map(int,input().split())\r\ne=input()\r\ncount=0\r\nfor i in e:\r\n if i=='1':\r\n count+=a\r\n if i=='2':\r\n count+=b\r\n if i=='3':\r\n count+=c\r\n if i=='4':\r\n count+=d\r\nprint(count)", "a=list(map(int,input().split()))\r\nl=list(input())\r\nl=map(int,l)\r\nc=0\r\nfor i in l:\r\n\tc+=a[i-1]\r\nprint(c)", "# B. Two Arrays And Swaps\r\nlista = [int(x) for x in input().split(' ')]\r\ns = input()\r\nsoma = 0\r\ni = 0\r\nj = 0\r\nwhile j < len(s):\r\n i = int(s[j])\r\n soma += lista[i-1]\r\n j+=1\r\nprint(soma)", "import sys\r\na1, a2, a3, a4 = map(int, input().split())\r\ns = input()\r\nt_cost = 0\r\ncosts = {\r\n '1': a1,\r\n '2': a2,\r\n '3': a3,\r\n '4': a4\r\n}\r\n\r\nfor c in s:\r\n t_cost += costs[c]\r\nprint(t_cost)", "a,b,c,d=map(int,input().split())\r\ns=input()\r\nval=0\r\nfor i in s:\r\n if(i=='1'):\r\n val+=a\r\n elif(i=='2'):\r\n val+=b\r\n elif(i=='3'):\r\n val+=c\r\n elif(i=='4'):\r\n val+=d\r\nprint(val)\r\n \r\n ", "a = [int(i) for i in str(input()).split()]\r\n \r\nb = str(input())\r\n \r\nc = 0\r\n \r\n \r\nfor k in b:\r\n c += a[int(k)-1]\r\n \r\nprint(c)", "# URL: https://codeforces.com/problemset/problem/431/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\na, b, c, d = map(int, inp().split())\ns = inp()\nans = a * s.count(b'1') + b * s.count(b'2') + c * s.count(b'3') + d * s.count(\n b'4')\nout(f\"{ans}\\n\")\n", "a=list(map(int,input().split()))\r\ns=input()\r\n\r\nsum=0\r\nfor i in range(len(s)) :\r\n num=(int)(s[i])\r\n sum+=a[num-1] \r\n\r\nprint(sum)\r\n ", "cal = list(map(int, input().split(' ')))\r\ncalMap = {}\r\nfor idx in range(4):\r\n calMap[idx+1] = cal[idx]\r\n \r\nsquares = input()\r\ntotal = 0\r\nfor s in squares:\r\n calorie = int(s)\r\n total += calMap[calorie]\r\n \r\nprint(total)", "multip = list(map(int,input().split())) \r\nst = input(\"\")\r\ntot = 0\r\nfor i in range(0,len(st)):\r\n m = int(st[i])\r\n for j in range(0,len(multip)):\r\n if m == j+1:\r\n tot =tot + multip[j]\r\n \r\nprint(tot)\r\n ", "l = list(map(int,input().split()))\r\ns = input()\r\nans=0\r\nfor it in s:\r\n ans+=l[int(it)-1]\r\nprint(ans)", "l = list(map(int, input().split()))\r\ns = input()\r\nres = 0\r\nfor i in s:\r\n if i == '1':\r\n res += l[0]\r\n elif i == '2':\r\n res += l[1]\r\n elif i == '3':\r\n res += l[2]\r\n elif i == '4':\r\n res += l[3]\r\nprint(res)", "a,b,c,d = map(int,input().split()) ; l = list(input()) ; r = 0\r\nfor i in range(len(l)):\r\n if l[i] == \"1\": r += a\r\n if l[i] == \"2\": r += b\r\n if l[i] == \"3\": r += c\r\n if l[i] == \"4\": r += d\r\nprint(r)", "vals = list(map(int,input().split()))\ns = input()\n\nstripToVal = {}\nfor i in range(1,5):\n stripToVal[i] = vals[i-1]\n\ncals = 0\nfor char in s:\n cals += stripToVal[int(char)]\n\nprint(cals)\n\n", "calories = list(map(int, input().split()))\ngames = input()\n\nans = 0\nfor g in games:\n ans += calories[int(g)-1]\nprint(ans)\n", "points = list(map(int,input().split(\" \")))\r\nliste = str(input())\r\ncount = 0\r\n\r\nfor i in range(4):\r\n count += points[i] * liste.count(str(i+1))\r\n\r\nprint(count)", "arr=list(map(int,input().split()))\r\ns=input()\r\nres=0\r\nfor i in s:\r\n res+=arr[int(i)-1]\r\nprint(res)", "a,b,c,d = map(int, input().split())\r\n\r\nx = str(input())\r\n\r\nq = x.count(\"1\")\r\n\r\nw = x.count(\"2\")\r\n\r\ne = x.count(\"3\")\r\n\r\nr = x.count(\"4\")\r\n\r\n\r\n\r\nt = q*a\r\n\r\ny = w*b\r\n\r\nu = e*c\r\n\r\ni = r*d\r\n\r\nprint(t+y+u+i)\r\n\r\n", "nums = [int(a) for a in input().split()]\r\nc = 0\r\nfor i in input():\r\n c += nums[int(i)-1]\r\nprint(c)", "str1 = list(map(int,input().split()))\r\nstr2 = list(input())\r\nstr2 = [int(a) for a in str2]\r\nsum = 0\r\nfor x in str2 :\r\n sum += str1[x-1]\r\nprint(sum)", "c=list(map(int,input().split()))\r\nn=input()\r\nans=0\r\nfor i in n:\r\n ans +=c[int(i)-1]\r\nprint(ans)", "s = input().split()\ns = [int(i) for i in s]\ng = input()\nans = 0\nfor i in g:\n ans += s[int(i) - 1]\nprint(ans)\n", "a = str(input())\r\nb = a.split()\r\nc = [int(x) for x in b]\r\n\r\ncounter = 0\r\n\r\nd = str(input())\r\n\r\nfor x in d:\r\n if x == \"1\":\r\n counter = counter + c[0]\r\n elif x == \"2\":\r\n counter = counter + c[1]\r\n elif x == \"3\":\r\n counter = counter + c[2]\r\n elif x == \"4\":\r\n counter = counter + c[3]\r\n\r\nprint(counter)", "a = list(map(int, input().split()))\nprint(sum(a[int(x) - 1] for x in input()))\n", "lis=list(map(int,input().split()))\r\nm=input()\r\nn=[int(x) for x in str(m)]\r\ns=0\r\nfor i in n:\r\n s+=lis[i-1]\r\nprint(s)", "a=input().split()\r\na1=int(a[0])\r\na2=int(a[1])\r\na3=int(a[2])\r\na4=int(a[3])\r\nt=input()\r\nans=0\r\nfor i in t:\r\n if i==\"1\":\r\n ans+=a1\r\n elif i ==\"2\":\r\n ans+=a2\r\n elif i==\"3\":\r\n ans+=a3\r\n else:\r\n ans+=a4\r\nprint(ans)", "a = list(map(int, input().split()))\r\nb = input()\r\ns = sum(a[i]*b.count(str(i+1)) for i in range(4))\r\nprint(s)\r\n", "\r\na1, a2, a3, a4 = map(int,input().split())\r\na = map(int,list(input()))\r\nc = 0\r\nfor i in a:\r\n if i == 1:\r\n c = c + a1\r\n elif i == 2:\r\n c = c + a2\r\n elif i == 3:\r\n c = c + a3\r\n elif i == 4:\r\n c = c + a4 \r\nprint(c)\r\n\r\n", "cals = list(map(int, input().split()))\r\ngame = input()\r\ncnum = 0\r\nfor i in game:\r\n cnum += cals[int(i) - 1]\r\n \r\nprint(cnum)\r\n", "cals = [int(i) for i in input().split()]\nsquares = input()\ntotal = 0\nfor square in squares:\n total += cals[int(square) - 1]\nprint(total)", "s=[int(x) for x in input().split()]\r\ns1=input()\r\nsum=0\r\nfor i in range(len(s1)):\r\n p=int(s1[i])\r\n sum=sum+s[p-1]\r\nprint(sum)", "arr = list(map(int, input().split(' ')))\r\na = input()\r\ncount = 0\r\nfor i in a:\r\n count += arr[int(i)-1]\r\nprint(count)", "a,b,c,d = map(int,input().split())\r\ns=input()\r\nsum=0\r\nfor i in s:\r\n if int(i)==1:\r\n sum+=a\r\n elif int(i)==2:\r\n sum+=b\r\n elif int(i)==3:\r\n sum+=c\r\n else:\r\n sum+=d\r\nprint(sum)\r\n", "x = list(map(int,input().split()))\r\nl = input()\r\ncnt = 0\r\n\r\nfor i in l:\r\n cnt += x[int(i)-1]\r\n\r\nprint(cnt)", "from collections import *\r\na = list(map(int, input().split()))\r\nstrs = input()\r\ntrack = Counter(strs)\r\nprint(a[0] * track[\"1\"] + a[1] * track[\"2\"] + a[2] * track[\"3\"] + a[3] * track[\"4\"])\r\n", "a,b,c,d=map(int, input().split())\r\ns=input()\r\ncnt=0\r\nfor i in range(len(s)):\r\n if s[i]=='1':\r\n cnt+=a\r\n elif s[i]=='2':\r\n cnt+=b\r\n elif s[i]=='3':\r\n cnt+=c\r\n elif s[i]=='4':\r\n cnt+=d\r\nprint(cnt)\r\n ", "n=input()\r\nsq=input()\r\nn=list(map(int,n.split()))\r\ncalo=0\r\nfor i in sq:\r\n if i==\"1\":\r\n calo+=n[0]\r\n elif i==\"2\":\r\n calo+=n[1]\r\n elif i==\"3\":\r\n calo+=n[2]\r\n elif i==\"4\":\r\n calo+=n[3]\r\n \r\nprint(calo)", "\r\ncalories = list(map(int, input().split()))\r\nstripes = [int(x) for x in input()]\r\nsumi = []\r\nfor stripe in stripes:\r\n if stripe == 1:\r\n sumi.append(calories[0])\r\n elif stripe == 2:\r\n sumi.append(calories[1])\r\n elif stripe == 3:\r\n sumi.append(calories[2])\r\n else:\r\n sumi.append(calories[3])\r\nprint(sum(sumi))", "def main(arr, s):\r\n n = 0\r\n\r\n for i in range(len(s)):\r\n n += arr[int(s[i]) - 1]\r\n\r\n return n\r\n\r\nif __name__ == \"__main__\":\r\n arr = list(map(int, input().split()))\r\n\r\n s = str(input())\r\n\r\n print(main(arr, s))", "caloriesPerStrip = list(map(int,input().split(\" \")))\r\nstrips = input()\r\ncalories = 0\r\n\r\nfor i in strips:\r\n index = int(i) - 1\r\n calories += caloriesPerStrip[index]\r\nprint(calories)", "print((lambda a, b: sum([int(x) for x in a.split()][int(i)-1] for i in b))(input(),input()))", "spent = 0 \ncalories = list(map(int,input().split()))\ngame = input()\nfor strip in game:\n spent += calories[int(strip)-1]\nprint(spent)", "caloris = [int(x) for x in input().split(\" \")] \r\nplays = list(input())\r\ntotal = 0\r\nfor i in range(len(plays)):\r\n total += caloris[int(plays[i])-1]\r\n\r\nprint(total)", "a=[*map(int,input().split())]\r\nb=input()\r\nx=0\r\nfor i in b:\r\n x+=a[int(i)-1]\r\nprint(x)", "a1, a2, a3, a4 = input().split()\r\ns = input()\r\nsum = 0\r\nfor i in range(len(s)):\r\n if s[i] == \"1\":\r\n sum = sum + int(a1)\r\n if s[i] == \"2\":\r\n sum = sum + int(a2)\r\n if s[i] == \"3\":\r\n sum = sum + int(a3)\r\n if s[i] == \"4\":\r\n sum = sum + int(a4)\r\nprint(sum)", "cal = list(map (int, input().split(' ')))\r\ns = input()\r\nsum = 0\r\nfor i in range (len(s)):\r\n sum = sum + cal[int (s[i]) - 1]\r\nprint (sum)\r\n", "a1,a2,a3,a4=list(map(int,input().split()))\r\nstr1=list(map(int,input()))\r\nsum=0\r\nfor i in str1:\r\n if i==1:sum+=a1\r\n elif i==2:sum+=a2\r\n elif i==3:sum+=a3\r\n else :sum+=a4\r\nprint(sum)", "ap=list(map(int,input().split()))\r\nbp=list(map(int,input()))\r\np,q=0,0\r\nwhile p<4:\r\n z=bp.count(p+1)\r\n q+=(ap[p]*z)\r\n p+=1\r\nprint(q)\r\n ", "x=list(map(int,input().split()))\r\nw=input()\r\ns=0\r\nfor i in w :\r\n s+=x[int(i)-1]\r\nprint(s)", "a1, a2, a3, a4 = map(int, input().split())\r\ns = str(input())\r\nkal = 0\r\n\r\nfor i in range(len(s)):\r\n if s[i] == '1':\r\n kal += a1\r\n elif s[i] == '2':\r\n kal += a2\r\n elif s[i] == '3':\r\n kal += a3\r\n elif s[i] == '4':\r\n kal += a4\r\nprint(kal)", "l=list(map(int,input().split(' ')))\r\nl1=list(input())\r\nl1=list(map(int,l1))\r\nx=l1.count(1)*l[0]\r\ny=l1.count(2)*l[1]\r\nz=l1.count(3)*l[2]\r\nw=l1.count(4)*l[3]\r\nprint(x+y+z+w)", "a=list(map(int,input().split()))\r\ns=input()\r\nprint(a[0]*s.count(\"1\")+a[1]*s.count(\"2\")+a[2]*s.count(\"3\")+a[3]*s.count(\"4\"))\r\n", "a=list(map(int,input().split()))\r\ns=map(int,list(input()))\r\nans=0\r\nfor i in s :\r\n ans+=a[i-1]\r\nprint(ans)\r\n\r\n\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 PROBLEM :A. Black Square\r\n SOLUTATOIN....\r\n\r\n ************************************************************************\r\n'''\r\n\r\na=list(map(int,input().split()))\r\ns=input()\r\nr=0\r\nfor i in s:\r\n r+=a[int(i)-1]\r\nprint(r)", "a = list(map(int, input().split()))\r\ns = input()\r\nsm = 0\r\nfor j in s:\r\n sm += a[int(j)-1]\r\nprint(sm)", "a1, a2, a3, a4 = map(int, input().split())\r\ns = input()\r\n\r\n# Track Calories\r\nsum_calories = 0\r\n\r\n# Iterate Through String s\r\nfor i in s:\r\n if i == '1':\r\n sum_calories += a1\r\n elif i == '2':\r\n sum_calories += a2\r\n elif i == '3':\r\n sum_calories += a3\r\n elif i == '4':\r\n sum_calories += a4\r\n\r\n# Print Output\r\nprint(sum_calories)", "p = int\r\na = list(map(p, input().split()))\r\ns = input()\r\n\r\nsumma = 0\r\nfor i in s:\r\n summa += a[p(i) - 1]\r\nprint(summa)\r\n", "l=list(map(int,input().split()))\r\nc=0\r\nv=input()\r\nfor i in v:\r\n c+=l[int(i)-1]\r\nprint(c)\r\n\r\n", "a = [int(i) for i in input().split()]\nres = sum(a[int(c) - 1] for c in input())\nprint(res)\n", "a=list(map(int,input().split()))\r\ns = input()\r\nprint(sum(a[int(i)-1]for i in s))", "n=list(map(int,input().split()))\r\ns=input()\r\nsum=0\r\nl=[]\r\ncount=0\r\nfor j in range(len(s)):\r\n if s[j]==\"1\" :\r\n sum+=n[0]\r\n elif s[j]==\"2\":\r\n sum+=n[1]\r\n elif s[j]==\"3\":\r\n sum+=n[2]\r\n else:\r\n sum+=n[3]\r\nprint(sum)\r\n", "a=list(map(int,input().split()))\r\nn=input()\r\nm=0\r\nfor i in n:\r\n if i==\"1\":\r\n m=m+a[0]\r\n if i==\"2\":\r\n m=m+a[1]\r\n if i==\"3\":\r\n m=m+a[2]\r\n if i==\"4\":\r\n m=m+a[3]\r\nprint(m)", "a = list(map(int, input().split()))\r\ns = [int(x) for x in list(input())]\r\ncal = 0\r\nfor i in s:\r\n cal += a[i-1]\r\nprint(cal)", "a = list(map(int, input().split()))\r\n\r\ns = input()\r\n\r\ncalories = s.count('1')*a[0] + s.count('2')*a[1] + s.count('3')*a[2] + s.count('4')*a[3] \r\n\r\nprint(calories)", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Tue Apr 4 17:14:40 2023\r\n\r\n@author: R I B\r\n\"\"\"\r\n#segment trees\r\nimport sys\r\nfrom math import *\r\nL=[]\r\nfor i in sys.stdin:\r\n L.append(i)\r\nL=[line.rstrip(\"\\n\") for line in L if line ]\r\na=[int(L[0].split(' ')[i]) for i in range(4)]\r\nch=L[1]\r\ns=0\r\nfor i in range(len(ch)):\r\n s+=a[int(ch[i])-1]\r\nprint(s)\r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n ", "calories = [int(num) for num in input().split()]\ntouches = ([*input()])\n\ntotal = 0\n\nfor i in range(len(touches)):\n if touches[i] == '1':\n total += calories[0]\n elif touches[i] == '2':\n total += calories[1]\n elif touches[i] == '3':\n total += calories[2]\n elif touches[i] == '4':\n total += calories[3]\n\nprint(total)", "L = [int(x) for x in input().split()]\r\n\r\ns = input()\r\n\r\nspent = 0\r\nfor i in range (0,len(s)):\r\n\r\n spent += L[int(s[i])-1]\r\n\r\nprint(spent)", "a = list(map(int, input().split()))\r\ns = list(input())\r\nprint(sum([a[int(s[i]) - 1] for i in range(len(s))]))\r\n", "def main():\r\n a1, a2, a3, a4 = list(map(int, input().split()))\r\n s = input()\r\n totalCalories = 0\r\n for char in s:\r\n if char == '1':\r\n totalCalories += a1\r\n elif char == '2':\r\n totalCalories += a2\r\n elif char == '3':\r\n totalCalories += a3\r\n elif char == '4':\r\n totalCalories += a4\r\n print(totalCalories)\r\nif __name__ == \"__main__\":\r\n main()", "a = list(map(int,input().split()))\r\nsr = input()\r\nsum = 0\r\nfor i in sr:\r\n it = int(i)\r\n sum += (a[it-1])\r\nprint(sum)\r\n", "a_lst = list(map(int,input().split()))\r\ns = list(map(int,list(input())))\r\ncal = 0\r\nfor i in range(1,5):\r\n cal += s.count(i) * a_lst[i-1]\r\nprint(cal)", "# read input values\r\na1, a2, a3, a4 = map(int, input().split())\r\ns = input()\r\n\r\n# initialize total sum variable\r\ntotal_sum = 0\r\n\r\n# iterate over string s\r\nfor c in s:\r\n # add corresponding calorie value to total sum\r\n if c == '1':\r\n total_sum += a1\r\n elif c == '2':\r\n total_sum += a2\r\n elif c == '3':\r\n total_sum += a3\r\n elif c == '4':\r\n total_sum += a4\r\n\r\n# output total sum\r\nprint(total_sum)\r\n", "l=input()\r\nl=l.split()\r\ntext=input()\r\ncount=0\r\nfor i in range(len(text)):\r\n \r\n count+=int(l[int(text[i])-1])\r\n \r\n \r\n \r\nprint(count)", "l=list(map(int , input().split()))\r\nn = input()\r\n\r\nanswer = n.count(\"1\")*l[0] + n.count(\"2\")*l[1] +n.count(\"3\")*l[2] +n.count(\"4\")*l[3]\r\nprint(answer)", "liste=list(map(int,input().split(\" \")))\r\nch=input()\r\nsomme=0\r\nfor i in range(len(ch)):\r\n somme=liste[int(ch[i])-1]+somme\r\nprint(somme)", "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\na=LI()\r\nprint(sum(a[i-1] for i in list(map(int, SI()))))", "x=list(map(int,input().split()))\r\ns=0\r\na=input()\r\nfor t in a:\r\n s+=x[int(t)-1]\r\nprint(s)", "calories = list(map(int, input().split()))\r\n\r\ngame = input()\r\n\r\ncalory = 0\r\nfor t in range(len(game)):\r\n calory += calories[int(game[t]) - 1]\r\n \r\nprint(calory)\r\n \r\n\r\n \r\n\r\n\r\n\r\n\r\n\r\n\r\n \r\n \r\n\r\n", "a,b,cc,d = map(int,input().split())\r\ns = input()\r\nc = 0\r\nfor i in s :\r\n if i == '1' :\r\n c += a\r\n elif i == '2' :\r\n c += b\r\n elif i == '3' :\r\n c += cc\r\n else :\r\n c += d\r\nprint(c)", "total = 0\r\ncalories = input()\r\ncaloriesValues = calories .split(\" \")\r\nsteps = input()\r\nfor i in range(len(steps)):\r\n total += int(caloriesValues[int(steps[i]) - 1])\r\nprint(total)\r\n", "a1, a2, a3, a4 = map(int, input().split())\r\ns = input()\r\n\r\ncalories = 0\r\nfor i in s:\r\n calories += eval('a' + i)\r\n\r\nprint(calories)\r\n", "def code(dic, s):\r\n dic_c = {\"1\": 0, \"2\": 0, \"3\": 0, \"4\": 0}\r\n for c in s:\r\n dic_c[c] += 1\r\n res = 0\r\n for k in dic_c:\r\n res += dic[k] * dic_c[k]\r\n print(res)\r\n\r\n\r\ndef main():\r\n l = list(map(int, input().split()))\r\n dic = {\r\n \"1\": l[0], \"2\": l[1], \"3\": l[2], \"4\": l[3],\r\n }\r\n s = input()\r\n code(dic, s)\r\n\r\n\r\nmain()", "a = [int(calories) for calories in input().split(\" \")]\r\nprocess = input()\r\n\r\ncalories = 0\r\n\r\nfor char in process:\r\n index = int(char) - 1\r\n calories += a[index]\r\n\r\nprint(calories)", "a,b,c,d=map(int,input().split())\narr=input()\nm=0\nn=0\no=0\np=0\nfor i in range(len(arr)):\n if arr[i]==\"1\":\n m+=1\n elif arr[i]==\"2\":\n n+=1\n elif arr[i]==\"3\":\n o+=1\n else:\n p+=1\nans=(a*m)+(b*n)+(c*o)+(d*p)\nprint(ans)\n \t \t \t\t\t \t \t \t \t\t \t \t \t", "a = list(map(int, input().split()))\r\nb = input()\r\n\r\ncount = 0\r\n\r\ni = 0\r\n\r\nwhile (i < len(b)):\r\n count += a[int(b[i]) - 1]\r\n \r\n i += 1\r\nprint(count)", "l=list(map(int,input().split())) \r\nprint(sum(l[int(i)-1] for i in input()))\r\n", "points = input().split(\" \")\npoints = [int(i) for i in points]\nmovements = [int(i) for i in [*input()]]\n\ncalories = 0\nfor move in movements:\n calories += points[move -1]\n\nprint(calories)", "a,b,c,d=map(int,input().split())\r\ns=input()\r\nprint(a*(s.count('1')) + b*(s.count('2')) + c*(s.count('3')) + d*(s.count('4')) )", "testcases=1\n\nfor t in range (testcases):\n\tstring=input()\n\tarrs=string.split()\n\tarr=[]\n\tfor num in arrs:\n\t\tarr.append(int(num))\n\tstrin2=input()\n\tcalories=0\n\tfor num in strin2:\n\t\tnumber=int(num)\n\t\tcalories+=arr[number-1]\n\tprint(calories)\n\n\n\t\n\n\n\t\n", "a=list(map(int,input().split()))\r\ns=input()\r\nc=0\r\nfor i in range(len(s)):\r\n c+=a[int(s[i])-1]\r\nprint(c)", "#Black Square\ncalories = input().split()\ntouch = input()\n\nenergy = 0\nfor i in touch:\n energy += int(calories[int(i)-1])\nprint(energy)", "a = list(map(int, input().split()))\r\n\r\ns=input()\r\n\r\nans = 0\r\n\r\nfor c in s:\r\n ans += a[int(c)-1]\r\nprint(ans)", "c=list(map(int,input().split()))\r\nq=input()\r\ns=0\r\nfor i in q:\r\n s=s+c[int(i)-1]\r\nprint(s)", "# Happy_water\r\nfrom collections import *\r\n\r\n\r\ndef main():\r\n a = list(map(int, input().split()))\r\n c = Counter(input())\r\n ans = 0\r\n for i in c:\r\n ans += c[i] * a[int(i) - 1]\r\n print(ans)\r\n\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "n=input().split(\" \")\r\n\r\na=input()\r\np=0\r\nfor i in range(len(a)):\r\n if a[i]==\"1\":\r\n p=p+int(n[0])\r\n if a[i]==\"2\":\r\n p=p+int(n[1])\r\n if a[i]==\"3\":\r\n p=p+int(n[2])\r\n if a[i]==\"4\":\r\n p=p+int(n[3])\r\nprint(p) ", "a1, a2, a3, a4 = input().split()\r\ns = input()\r\nsum=0\r\nfor i in range (len(s)):\r\n if s[i]==\"1\":\r\n sum = sum + int(a1)\r\n if s[i]==\"2\":\r\n sum = sum + int(a2)\r\n if s[i]==\"3\":\r\n sum = sum + int(a3)\r\n if s[i]==\"4\":\r\n sum = sum + int(a4)\r\nprint(sum)", "x = list(input().split(' '))\r\nl = []\r\nfor i in x:\r\n l.append(int(i))\r\ns = str(input())\r\n#print(l,s)\r\nans = 0\r\nfor i in s:\r\n ans += l[int(i)-1]\r\n\r\n\r\nprint(ans)", "p,q,r,s=map(int,input().split())\r\nstring=input()\r\na=string.count('1')\r\nb=string.count('2')\r\nc=string.count('3')\r\nd=string.count('4')\r\nsum=(a*p)+(b*q)+(c*r)+(d*s)\r\nprint(sum)", "def okers(n,L):\r\n def corres(m):\r\n if m==1:\r\n return int(L[0])\r\n elif m==2:\r\n return int(L[1]) \r\n elif m==3:\r\n return int(L[2] ) \r\n elif m==4:\r\n return int(L[3] ) \r\n oner = 0\r\n for i in range(len(n)):\r\n oner += corres(int(n[i]))\r\n return oner \r\ns1 = input() \r\nL = s1.split(\" \")\r\ns = input() \r\nprint(okers(s,L)) ", "a1,a2,a3,a4 = map(int,input().split())\r\ns = input()\r\nli = list(map(int,s))\r\nc1 = li.count(1)\r\nc2 = li.count(2)\r\nc3 = li.count(3)\r\nc4 = li.count(4)\r\nresult = a1*c1 + a2*c2 + a3*c3 + a4*c4\r\nprint(result)", "import sys\r\ninput = sys.stdin.readline\r\noutput = sys.stdout.write\r\n\r\n\r\ndef main():\r\n dic_ = list(map(int, input().rstrip().split()))\r\n str_ = input().rstrip()\r\n summ = 0\r\n for i in str_:\r\n i = int(i) - 1\r\n summ += dic_[i]\r\n output(str(summ))\r\n output('\\n')\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "one,two,three,four = list(map(int,input().split()))\ns = input()\n\ncals = one*s.count(\"1\") + two*s.count(\"2\") + three*s.count(\"3\") + four*s.count(\"4\")\n\nprint(cals)\n\n", "def fatass(s,f):\r\n #s is string of appearences and f is calorie for ai\r\n d=str(s)\r\n f=str(f)\r\n alist=[]\r\n blist=[int(g) for g in f.split()]\r\n count=0\r\n for x in d:\r\n alist.append(x)\r\n for t in alist:\r\n if t==\"1\":\r\n count+=blist[0]\r\n elif t==\"2\":\r\n count+=blist[1]\r\n elif t==\"3\":\r\n count+=blist[2]\r\n else:\r\n count+=blist[3]\r\n return count\r\nf=input()\r\ns=input()\r\nprint(fatass(s,f))\r\n", "calories = [int(x) for x in input().split()]\r\n\r\nstringofs = input()\r\ntotalc = 0\r\n\r\nfor c in stringofs:\r\n if c == \"1\":\r\n totalc+=calories[0]\r\n elif c == \"2\":\r\n totalc+= calories[1]\r\n elif c == \"3\":\r\n totalc += calories[2]\r\n else:\r\n totalc+= calories[3]\r\n \r\nprint(totalc) \r\n", "a = list(map(int, input().split()))\ndata = input()\n\nresult = 0\n\nfor char in data:\n result += a[int(char)-1]\n\nprint(result)\n \t\t\t \t\t\t \t \t\t\t\t\t \t \t\t", "\n\n\n\n# Press the green button in the gutter to run the script.\nfrom builtins import input\n\nif __name__ == '__main__':\n weights = list(map(int, input().split(\" \")))\n game = list(map(int, input()))\n cal = 0\n\n for i in game:\n cal += weights[i-1]\n\n print(cal)\n\n\n\n\n\n\n\n\n\n# See PyCharm help at https://www.jetbrains.com/help/pycharm/\n", "calories = list(map(int, input().split()))\r\ngame = input()\r\ntotal_calories = 0\r\n\r\nfor move in game:\r\n total_calories += calories[int(move)-1]\r\n\r\nprint(total_calories)\r\n", "asList = [int(i) for i in input().split()]\r\nsteps = input()\r\nres = 0\r\nfor i in range(len(asList)):\r\n res += steps.count(str(i+1)) * asList[i]\r\n\r\nprint(res)", "def sol(l,s):\r\n a=s.count('1')\r\n b=s.count('2')\r\n c=s.count('3')\r\n d=s.count('4')\r\n return a*l[0]+b*l[1]+c*l[2]+d*l[3]\r\n\r\nl=[int(i) for i in input().split()]\r\ns=input()\r\nprint(sol(l,s))\r\n", "calories = list(map(int,input().split()))\r\ns = input()\r\ntotal = 0\r\nfor i in s:\r\n total += calories[int(i) -1]\r\nprint(total)", "a1,a2,a3,a4=map(int,input().split())\ns=input()\nu,v,w,x=0,0,0,0\nfor i in range(len(s)):\n if s[i]==\"1\":\n u+=1\n elif s[i]==\"2\":\n v+=1\n elif s[i]==\"3\":\n w+=1\n else:\n x+=1\nans=(a1*u)+(a2*v)+(a3*w)+(a4*x)\nprint(ans)\n \t\t\t \t \t\t \t\t \t \t\t\t\t\t\t\t\t \t", "from typing import List\r\n\r\ndef main():\r\n \"\"\"Run code.\"\"\"\r\n\r\n calories = list(map(int, input().split()))\r\n\r\n s = input()\r\n\r\n cnt = 0\r\n for i in range(len(s)):\r\n cnt += calories[int(s[i])-1]\r\n\r\n print(cnt)\r\n \r\n \r\nif __name__ == \"__main__\":\r\n main()", "a = [int(ai) for ai in input().split()]\r\ns = input()\r\nans = 0\r\nfor l in s:\r\n ans += a[int(l)-1]\r\nprint(ans)", "arr = a1,a2,a3,a4 = [int(x) for x in input().split()]\r\n\r\ns = input()\r\n\r\ncal = 0\r\n\r\nfor ch in s:\r\n if ch == \"1\":\r\n cal += a1\r\n elif ch == \"2\":\r\n cal += a2\r\n elif ch == \"3\":\r\n cal += a3\r\n else:\r\n cal += a4\r\n\r\nprint(cal)", "import math\nimport re\n\n\ndef main():\n calories = [int(x) for x in input().split()]\n lines = input()\n sum = 0\n\n for line in lines:\n sum += calories[int(line) - 1]\n\n print(sum)\n\n\nif __name__ == \"__main__\":\n main()\n", "a=[int(x) for x in input().split()]\r\nx=input()\r\nn=0\r\nfor i in x:\r\n if i=='1':\r\n n+=a[0]\r\n elif i=='2':\r\n n+=a[1]\r\n elif i=='3':\r\n n+=a[2]\r\n else:\r\n n+=a[3]\r\nprint(n)\r\n\r\n", "a1,a2,a3,a4 = map(int, input().split())\r\n\r\ns = {\"1\":a1, \"2\":a2, \"3\":a3, \"4\":a4}\r\n\r\nee = list(input())\r\n\r\nc = 0\r\n\r\nfor i in ee:\r\n c += s[i]\r\n\r\nprint(c)\r\n", "a = list(map(int, input().split()))\r\nans = 0\r\na = [0] + a\r\ns = input()\r\nfor i in s:\r\n ans += a[int(i)]\r\nprint(ans)", "l = list(map(int,input().split()))\r\ns =list(map(int,list(input())))\r\nn = 0 \r\nfor i in s :\r\n n = n+l[i-1]\r\nprint(n)\r\n", "a1,a2,a3,a4=[int(i) for i in input().split()]\r\nstr=input()\r\np=str.count('1')\r\nq=str.count('2')\r\nr=str.count('3')\r\ns=str.count('4')\r\nans=(a1*p)+(a2*q)+(a3*r)+(a4*s)\r\nprint(ans)", "a=list(map(int,input().split()))\r\nx=input()\r\nl=list(x)\r\ncount=0\r\nfor i in range(len(l)):\r\n if l[i]=='1':\r\n count+=a[0]\r\n elif l[i]=='2':\r\n count+=a[1]\r\n elif l[i]=='3':\r\n count+=a[2]\r\n elif l[i]=='4':\r\n count+=a[3]\r\nprint(count)", "l=list(map(int,input().split()))\r\ns=input()\r\nk=0\r\nfor i in s:\r\n k+=l[int(i)-1]\r\n\r\nprint(k)", "c=0\r\nz,x,o,v=map(int,input().split())\r\nn=input()\r\nfor i in range(len(n)):\r\n if n[i]=='1':\r\n c+=z\r\n elif n[i]=='2':\r\n c+=x \r\n elif n[i]=='3':\r\n c+=o\r\n elif n[i]=='4':\r\n c+=v \r\nprint(c) ", "nums=list(map(int,input().split()))\r\nnum=input()\r\nans=0\r\nfor i in num:\r\n i1=int(i)\r\n ans+=nums[i1-1]\r\nprint(ans)", "x=input().split()\r\ny=input()\r\nsum=0\r\nfor i in y:\r\n for ind , j in enumerate(x,1):\r\n if int(i) == ind:\r\n sum+=int(j)\r\nprint(sum)", "a1,a2,a3,a4=map(int,input().split())\r\ns=input()\r\nt=0\r\nfor i in s:\r\n if i=='1':\r\n t+=a1 \r\n elif i=='2':\r\n t+=a2\r\n elif i=='3':\r\n t+=a3\r\n elif i=='4':\r\n t+=a4\r\nprint(t)", "cal_stripes = list(map(int, input().split()))\nstripes = str(input())\n\ncount = 0\nd = {str(i+1): cal_stripes[i] for i in range(len(cal_stripes))}\nfor v in stripes:\n count += d.get(v)\n\nprint(count)", "a=list(map(int,input().split()))\r\ns=input()\r\nout=0\r\nfor i in range(len(s)):\r\n out+=a[int(s[i])-1]\r\nprint(out)\r\n ", "a1, a2, a3, a4 = map(int, input().split())\r\ns = str(input())\r\ntotalSum = 0\r\n\r\nfor i in range(len(s)):\r\n if s[i] == '1':\r\n totalSum += a1\r\n elif s[i] == \"2\":\r\n totalSum += a2\r\n elif s[i] == \"3\":\r\n totalSum += a3\r\n else:\r\n totalSum += a4\r\nprint(totalSum)", "a=list(map(int,input().split()))\r\ns = input()\r\nans = 0\r\nfor i in s:\r\n ans += a[int(i)-1]\r\nprint(ans)", "a1, a2, a3, a4 = map(int, input().split())\nlst = list(map(int, list(input())))\nans = 0\nfor i in range(len(lst)):\n if lst[i] == 1:\n ans += a1\n elif lst[i] == 2:\n ans += a2\n elif lst[i] == 3:\n ans += a3\n else:\n ans += a4\nprint(ans)", "a = [int(x) for x in input().split()]\r\ncal = {1: 0, 2: 0, 3: 0, 4: 0}\r\nfor i in range(1, 5):\r\n cal[i] = a[i-1]\r\ntotal = 0\r\nfor n in input():\r\n total += cal[int(n)]\r\n\r\nprint(total)", "entrada = list(map(int, input().split()))\r\nst = input()\r\nsoma = 0\r\nfor each in st:\r\n soma += entrada[int(each) - 1]\r\nprint(soma)", "a, b, c = input().split(), input(), 0\r\nfor i in b:\r\n c += int(a[int(i) - 1])\r\nprint(c)", "a1, a2, a3, a4 = list(map(int,input().split()))\r\n\r\ns = input()\r\ntotal = 0\r\n\r\nfor i in s:\r\n if i=='1':\r\n total+=a1\r\n elif i=='2':\r\n total+=a2\r\n elif i=='3':\r\n total+=a3\r\n else:\r\n total+=a4\r\n\r\nprint(total)\r\n", "n1 = list(str(input()).split())\nn2 = list(str(input()))\nsoma = 0\nfor x in n2:\n if x == '1':\n soma += 1*(int(n1[0]))\n if x == '2':\n soma += 1*(int(n1[1]))\n if x == '3':\n soma += 1*(int(n1[2]))\n if x == '4':\n soma += 1*(int(n1[3]))\nprint(soma)\n\t \t\t\t\t\t \t \t\t\t \t \t \t\t \t\t", "d = input()\r\nnum = \"\"\r\narray = []\r\nfor count in range(0, len(d), 1):\r\n if d[count] != \" \":\r\n num = num + d[count]\r\n else:\r\n array.append(int(num))\r\n num = \"\"\r\narray.append(int(num))\r\nx = input()\r\ntot = 0\r\nfor c in range(0, len(x), 1):\r\n tot += array[int(x[c]) - 1]\r\nprint(tot)", "# import sys\r\n\r\n# sys.stdin = open('./input.txt', 'r')\r\n# sys.stdout = open('./output.txt', 'w')\r\n\r\na = list(map(int, input().split()))\r\nstripes = [int(i) for i in input()]\r\nwasted_calories = 0\r\nfor stripe in stripes:\r\n wasted_calories += a[stripe - 1]\r\nprint(wasted_calories)", "a, b, c, d = map(int, input().split(' '))\r\ns = input()\r\nq = 0\r\nfor i in range(len(s)):\r\n if s[i] == '1':\r\n q += a\r\n elif s[i] == '2':\r\n q += b\r\n elif s[i] == '3':\r\n q += c\r\n else:\r\n q += d\r\nprint(q)\r\n", "Given_input = input().split(' ')\r\n[a1,a2,a3,a4] = Given_input\r\nseries = str(input(\"\"))\r\n\r\nanswer = 0\r\nfor a in range(len(series)):\r\n no = int(series[a])\r\n if no == 1:\r\n answer += int(a1)\r\n elif no == 2:\r\n answer += int(a2)\r\n elif no == 3:\r\n answer += int(a3)\r\n elif no == 4:\r\n answer += int(a4)\r\n else:\r\n print(\"pls check no number\")\r\n\r\nprint(answer)\r\n", "p,q,r,t=(int(i) for i in input().split())\r\ns=str(input())\r\na=s.count('1')\r\nb=s.count('2')\r\nc=s.count('3')\r\nd=s.count('4')\r\nprint((p*a)+(q*b)+(r*c)+(t*d))", "out = 0\r\ncalories = input().split()\r\ns = input()\r\nfor i in s:\r\n out += int(calories[int(i)-1])\r\nprint(out)\r\n", "calories = input()\r\ns = input()\r\ncalories_list = calories.split(' ')\r\ncalories_list = [int(x) for x in calories_list]\r\n\r\ncalories_dict = {\r\n '1': calories_list[0],\r\n '2': calories_list[1],\r\n '3': calories_list[2],\r\n '4': calories_list[3]\r\n}\r\n\r\ncalories_required = 0\r\nfor strip in s:\r\n calories_required += calories_dict[strip]\r\n \r\nprint(calories_required)\r\n ", "c = [int(i) for i in input().split()]\r\ns = input()\r\nt = 0\r\nfor i in s:\r\n t+=c[int(i)-1]\r\nprint(t)", "from collections import defaultdict\r\ndef solve(k,a,b,c,d):\r\n l=[0]*4\r\n for i in k:\r\n if i==\"1\":\r\n l[0]+=1\r\n elif i==\"2\":\r\n l[1]+=1\r\n elif i==\"3\":\r\n l[2]+=1\r\n else:\r\n l[3]+=1\r\n return l[0]*a+l[1]*b+l[2]*c+l[3]*d\r\n\r\n\r\n\r\na,b,c,d=map(int,input().split())\r\nl=input()\r\nprint(solve(l,a,b,c,d))", "calorieStrip = list(map(int, input().split()))\r\nsequence = input()\r\n\r\nacc = 0\r\n\r\nfor i in sequence:\r\n index = int(i)-1\r\n acc += calorieStrip[index]\r\n\r\nprint(acc)", "a,b,c,d = map(int,input().split())\r\nx = input()\r\ns = 0\r\nfor i in x:\r\n if i == '1':\r\n s+=a\r\n elif i == '2':\r\n s+=b\r\n elif i == '3':\r\n s+=c\r\n else:\r\n s+=d\r\nprint(s)", "l=[int(x) for x in input().split()]\r\nl=[\"dwad\"]+l\r\narr=input()\r\nsum=0\r\nfor i in arr:\r\n sum+=l[int(i)]\r\nprint(sum)", "a=list(map(int,input().split()))\r\nl=input()\r\nk=0\r\nfor i in l:\r\n if(i=='1'):\r\n k+=a[0]\r\n elif i=='2':\r\n k+=a[1]\r\n elif i=='3':\r\n k+=a[2]\r\n elif i=='4':\r\n k+=a[3]\r\nprint(k)\r\n ", "a=list(map(int,input().split()))\r\n#string\r\ns=input()\r\nsum=0\r\nfor i in s:\r\n sum+=a[int(i)-1]\r\nprint(sum)", "*m,=map(int,input().split());print(sum(m[int(i)-1]for i in input()))\r\n", "li = [int(i) for i in input().split()]\r\ns = input()\r\nsm = 0\r\nfor i in s:\r\n if i == '1':\r\n sm += li[0]\r\n elif i == '2':\r\n sm += li[1]\r\n elif i == '3':\r\n sm += li[2]\r\n elif i == '4':\r\n sm += li[3]\r\nprint(sm)", "a1,a2,a3,a4 = map(int, input().split())\r\n\r\ngame = list(input())\r\n\r\ncalories = 0\r\n\r\nfor i in game:\r\n if i == \"1\":\r\n calories += a1\r\n elif i == \"2\":\r\n calories += a2\r\n elif i == \"3\":\r\n calories += a3\r\n elif i == \"4\":\r\n calories += a4\r\n else:\r\n continue\r\n\r\nprint(calories)\r\n", "# https://codeforces.com/problemset/problem/431/A\r\n\r\ndef main():\r\n a = list(map(int, input().split(' ')))\r\n s = input()\r\n print(sum(a[ord(i) - ord('1')] for i in s))\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "a = list(map(int, input().split()))\r\n\r\ns = input()\r\n\r\nres = 0\r\n\r\nfor i in s:\r\n res += a[int(i) - 1]\r\n\r\nprint(res)", "#https://codeforces.com/problemset/problem/431/A\r\n\r\ncalories = [int(x) for x in input().split(\" \")]\r\ncalories_spent = [calories[int(x)-1] for x in input()]\r\nprint(sum(calories_spent))", "w = [int(i) for i in input().split()]\r\ns = input()\r\nres = 0\r\n\r\nfor i in s:\r\n res += w[int(i)-1]\r\n \r\nprint(res)", "first,second,third,fourth=map(int,input().split())\r\ndata=input()\r\ntotal_calorie_burned=0\r\nfor element in data:\r\n element=int(element)\r\n if element == 1:\r\n total_calorie_burned+=first\r\n elif element == 2:\r\n total_calorie_burned+=second\r\n elif element == 3:\r\n total_calorie_burned+=third\r\n elif element == 4:\r\n total_calorie_burned+=fourth\r\n\r\nprint(total_calorie_burned)", "seq = tuple(map(int, input().split()))\r\n\r\nsm = 0\r\nfor i in input():\r\n sm += seq[int(i) - 1]\r\n\r\nprint(sm)\r\n", "a,b,c,d=map(int,input().split())\r\ns=input()\r\nd={\"1\":a,\"2\":b,\"3\":c,\"4\":d}\r\nco=0\r\nfor i in range(len(s)):co+=d[s[i]]\r\nprint(co)\r\n", "arr = list(map(int,input().split(' ')))\r\nprint(sum([arr[int(i) - 1] for i in input()]))", "my_calories=list(map(int,input().split()))\r\ngame=input()\r\nt_c=0\r\nfor p in game:\r\n t_c+=my_calories[int(p)-1]\r\nprint(t_c) \r\n", "peso = input().split()\r\n#print (peso)\r\nseq = input()\r\nlong = len(seq)\r\n#print (long)\r\n#print (int(seq[0]))\r\ncalories = 0\r\n#print (calories)\r\nfor i in range (long) :\r\n #print (int(seq[i]) - 1)\r\n calories = calories + int (peso[int(seq[i]) - 1])\r\nprint (calories)", "ar = list(map(int, input().split()))\r\n\r\ns = input()\r\nS = 0\r\nfor i in range(len(s)): \r\n S += ar[int(s[i])-1]\r\n\r\nprint(S)", "lst = list(map(int, input().split()))\r\ndc = {str(i+1):lst[i] for i in range(4)}\r\nword = list(input())\r\nprint(sum(dc[c] for c in word))", "a1,a2,a3,a4 = map(int,input().split())\r\ns = list(input())\r\nsumm = 0\r\nfor elem in s:\r\n if elem == '1':\r\n summ += a1\r\n elif elem == '2':\r\n summ += a2\r\n elif elem == '3':\r\n summ += a3\r\n else:\r\n summ += a4\r\nprint(summ)\r\n \r\n", "def squares():\n ponto = input().split(' ')\n \n\n posicao = input()\n \n cont = 0\n\n for i in posicao:\n for j in range(len(ponto)):\n if (int(i)-1) == j:\n cont += int(ponto[j])\n\n print(cont)\n\n\nsquares()\n\n\t \t\t\t \t\t \t\t\t\t\t \t\t \t\t\t \t", "while True:\r\n try:\r\n # Read four integers separated by spaces\r\n a, b, c, d = map(int, input().split())\r\n #ydgfvbksuhdfvbkhsdfvbskduhfvbhfsjhvbsjdhfvbfsd\r\n # Read a string\r\n s = input()\r\n \r\n # Initialize a variable to store the sum\r\n ans = 0\r\n #jhbcjhbsdvhbdjshfjhgfbkjdfgnkjdfngkjdgf\r\n # Iterate through each character in the string\\\r\n \r\n \r\n \r\n for char in s:\r\n if char == '1':\r\n ans += a # If the character is '1', add 'a' to the sum\r\n elif char == '2':\r\n ans += b # If the character is '2', add 'b' to the sum\r\n elif char == '3':\r\n ans += c # If the character is '3', add 'c' to the sum\r\n elif char == '4':\r\n ans += d # If the character is '4', add 'd' to the sum\r\n \r\n # Print the final result\r\n print(ans)\r\n \r\n except EOFError:\r\n break # Exit the loop when there is no more input (EOFError)\r\n \r\n \r\n #rtcjygchgfcjcjhcjfxhfx\r\n \r\n \r\n#hjbvkbvshjsd vsjkdbvdhsfbvjhdfvbkdshfvjksdfvbkjsfvbisdfbvdjbvsjdfbvdkfbvjhsdfbvjhfdvbjkdsf", "arr = list(map(int, input().split(' ')))\ns = input()\nop = 0\nfor i in range(len(s)):\n op += arr[int(s[i])-1]\nprint(op)", "a,b,c,e=list(map(int,input().split()))\r\nd={'1':0,'2':0,'3':0,'4':0}\r\nfor i in input():\r\n d[i]+=1\r\nprint(d['1']*a+d['2']*b+d['3']*c+d['4']*e)", "l = list(map(int, input().split()))\r\ns = input()\r\nsum = 0\r\nfor i in range(len(s)):\r\n if s[i] == '1':\r\n sum += l[0]\r\n elif s[i] == '2':\r\n sum += l[1]\r\n elif s[i] == '3':\r\n sum += l[2]\r\n elif s[i] == '4':\r\n sum += l[3]\r\nprint(sum)\r\n" ]

[ "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\ndef bfs(s):\r\n q = [s]\r\n dist = [-1] * (n + 1)\r\n dist[s] = 0\r\n parent = [-1] * (n + 1)\r\n for k in range(n):\r\n i = q[k]\r\n di = dist[i]\r\n for j in G[i]:\r\n if dist[j] == -1:\r\n dist[j] = di + 1\r\n q.append(j)\r\n parent[j] = i\r\n return q, dist, parent\r\n\r\nn, m = map(int, input().split())\r\nG = [[] for _ in range(n + 1)]\r\nfor _ in range(n - 1):\r\n a, b = map(int, input().split())\r\n G[a].append(b)\r\n G[b].append(a)\r\np, dist, parent = bfs(1)\r\ndp = []\r\ndp0 = parent\r\ndp.append(dp0)\r\nwhile True:\r\n dp1 = [-1] * (n + 1)\r\n for i in range(1, n + 1):\r\n if dp0[i] == -1:\r\n continue\r\n dp1[i] = dp0[dp0[i]]\r\n if max(dp1) < 0:\r\n break\r\n dp0 = dp1\r\n dp.append(dp0)\r\nl = len(dp)\r\npow2 = [1]\r\nfor _ in range(l):\r\n pow2.append(2 * pow2[-1])\r\ncnt1 = [1] * (n + 1)\r\ndp1 = [0] * (n + 1)\r\nfor i in p[::-1][:-1]:\r\n j = parent[i]\r\n cnt1[j] += cnt1[i]\r\n dp1[j] += cnt1[i] + dp1[i]\r\ncnt2 = [n - i for i in cnt1]\r\ndp2 = [0] * (n + 1)\r\nfor i in p:\r\n c = []\r\n for j in G[i]:\r\n if j ^ parent[i]:\r\n c.append(j)\r\n if not c:\r\n continue\r\n s = dp1[i] + dp2[i] + cnt2[i]\r\n for j in c:\r\n dp2[j] = s - (cnt1[j] + dp1[j])\r\nans = []\r\nfor _ in range(m):\r\n u, v = map(int, input().split())\r\n if dist[u] > dist[v]:\r\n u, v = v, u\r\n d = dist[v] - dist[u]\r\n w = v\r\n for i in range(l):\r\n if not d:\r\n break\r\n if d & pow2[i]:\r\n d ^= pow2[i]\r\n w = dp[i][w]\r\n if u == w:\r\n d = dist[v] - dist[u] - 1\r\n d0 = d + 1\r\n u = v\r\n for i in range(l):\r\n if not d:\r\n break\r\n if d & pow2[i]:\r\n d ^= pow2[i]\r\n u = dp[i][u]\r\n ans0 = (cnt1[v] * dp2[u] + cnt2[u] * dp1[v]) / (cnt2[u] * cnt1[v]) + d0 + 1\r\n else:\r\n x = u\r\n for i in range(l - 1, -1, -1):\r\n if dp[i][x] ^ dp[i][w]:\r\n x, w = dp[i][x], dp[i][w]\r\n d0 = dist[u] + dist[v] - 2 * (dist[w] - 1)\r\n ans0 = (cnt1[v] * dp1[u] + cnt1[u] * dp1[v]) / (cnt1[u] * cnt1[v]) + d0 + 1\r\n ans.append(ans0)\r\nsys.stdout.write(\"\\n\".join(map(str, ans)))" ]