Datasets:

---

mlfoundations-dev

/

Codeforces-Python-Submissions_processed

like 0

Follow

ML Foundations Development 67

[ "# import sys\r\n# input=sys.stdin.readline\r\nimport math\r\nimport bisect\r\n\r\nn=int(input())\r\nl=[int(i) for i in input().split(\" \")]\r\nl.sort()\r\nd={}\r\nans=0\r\nfor i in l:\r\n if i in d:\r\n while(i in d):\r\n i+=1\r\n ans+=1\r\n d[i]=1\r\n else:\r\n d[i]=1\r\n\r\nprint(ans)\r\n\r\n\r\n\r\n\r\n \r\n\r\n \r\n\r\n\r\n\r\n\r\n\r\n\r\n \r\n \r\n\r\n \r\n \r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n \r\n \r\n\r\n\r\n\r\n \r\n\r\n\r\n\r\n\r\n\r\n \r\n \r\n \r\n\r\n\r\n\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\nst = []\r\nfor i in range(len(n)):\r\n st.append(n[i])\r\n while len(st) > 1 and st[-1] == st[-2]:\r\n st.pop()\r\n st.pop()\r\nprint(''.join(st))\r\n \r\n", "# LUOGU_RID: 131046759\nimport sys\r\ninput = lambda:sys.stdin.readline().strip()\r\narc = []\r\nfor i in input():\r\n if arc and i == arc[-1]:\r\n arc.pop()\r\n else:\r\n arc.append(i)\r\nprint(*arc,sep=\"\")", "\r\nimport sys\r\ninput = sys.stdin.readline\r\n\r\ns = input()[:-1]\r\n\r\nd = []\r\nfor i in s:\r\n if d and i == d[-1]:\r\n d.pop()\r\n else:\r\n d.append(i)\r\n\r\nprint(''.join(d))", "if __name__ == \"__main__\":\n s: str = input()\n data = []\n for c in s:\n if data and data[-1] == c:\n data.pop()\n else:\n data.append(c) \n print(''.join(data))\n\n \t \t\t\t\t \t \t \t\t\t \t \t\t\t \t\t \t", "# ===== PROGRAMA PRINCIPAL ===== #\ncad = input()\npila = []\nfor c in cad:\n pila.append(c)\n\n## Solucion\naux = [] # Creamos una pila auxiliar\nwhile len(pila) > 1:\n # Sacamos dos valores de la pila para comparar\n cad1 = pila.pop()\n cad2 = pila.pop()\n if cad1 == cad2:\n ok = True\n while(ok == True):\n pilaX = -1; auxY = -1\n if len(pila) > 0: pilaX = pila.pop()\n if len(aux) > 0: auxY = aux.pop()\n if pilaX == -1 and auxY != -1:\n aux.append(auxY)\n ok = False\n elif pilaX != -1 and auxY == -1:\n pila.append(pilaX)\n ok = False\n elif pilaX == -1 and auxY == -1:\n ok = False\n # Preguntamos\n else:\n if pilaX != auxY:\n aux.append(auxY)\n pila.append(pilaX)\n ok = False\n else:\n pila.append(cad2)\n aux.append(cad1)\n\n# Para el ultimo caso\nif len(pila) > 0:\n x = pila.pop()\n if len(aux) > 0:\n y = aux.pop()\n if x != y:\n aux.append(y)\n aux.append(x)\n else:\n aux.append(x)\n\n# Dando la vuelta los valores de Pila\nrevesedPila = aux[::-1]\nprint(\"\".join(revesedPila))\n \t \t\t\t\t\t \t \t \t \t\t\t \t\t\t\t", "s=input()\r\nS=[]\r\ntop=-1\r\nfor i in s:\r\n if len(S)==0:\r\n S.append(i)\r\n top+=1\r\n else: \r\n if i ==S[top]:\r\n S.pop(top)\r\n top-=1\r\n else:\r\n S.append(i)\r\n top+=1\r\nprint(*S,sep='') ", "st=input()\r\nstack=[]\r\nstack.append(st[0])\r\nfor i in range(1,len(st)):\r\n if len(stack)!=0:\r\n if stack[-1]==st[i]:\r\n stack.pop()\r\n else:\r\n stack.append(st[i])\r\n else:\r\n stack.append(st[i])\r\nsti=\"\"\r\nfor e in stack:\r\n sti+=e\r\nprint(sti)", "n = input()\r\nstack = []\r\nfor i in n:\r\n try:\r\n if i != stack[-1]:\r\n stack.append(i)\r\n else:\r\n stack.pop()\r\n except:\r\n stack.append(i)\r\nprint(''.join(stack))", "text = input()\r\n\r\nresults = []\r\ngroup = list(map(str, text))\r\n\r\nfor i in group:\r\n if results and i == results[-1]:\r\n results.pop()\r\n else:\r\n results.append(i)\r\nprint(''.join(results))", "s = list(input())\r\nout = [s[0]]\r\nfor i in range(1, len(s)):\r\n if len(out) > 0 and s[i] == out[-1]:\r\n out.pop()\r\n else:\r\n out.append(s[i])\r\nprint(''.join(out))", "arr = input(); l = [ ]\r\nfor i in arr : \r\n if l and i == l[-1] :l.pop(); continue \r\n l.append(i)\r\nprint(''.join(l)) \r\n ", "def polycarp(inputString):\r\n\tstack = []\r\n\ti = 0\r\n\twhile i < len(inputString):\r\n\t\tif stack and inputString[i] == stack[-1]:\r\n\t\t\tstack.pop()\r\n\t\telse:\r\n\t\t\tstack.append(inputString[i])\r\n\t\ti += 1\r\n\treturn \"\".join(stack)\r\n\r\n \r\ninputString = input()\r\nprint(polycarp(inputString))\r\n", "def removeDuplicates(word):\r\n final = []\r\n for i in word:\r\n if len(final) == 0:\r\n final.append(i)\r\n elif i == final[len(final) - 1]:\r\n final.pop()\r\n else:\r\n final.append(i)\r\n return final\r\n\r\nword = input()\r\n\r\nprint(\"\".join(removeDuplicates(word)))", "a=[i for i in input()]\n\n\nres=list()\n\nfor c in a:\n if res:\n if c==res[-1]:\n res.pop()\n else:\n res.append(c)\n else:\n res.append(c)\n\nprint(\"\".join(res))\n\t\t\t \t\t\t \t \t \t\t \t\t \t\t \t \t\t\t", "S = input()\r\nstack = []\r\nstack.append(S[0])\r\nfor i in range(1,len(S)):\r\n if stack!=[] and S[i]==stack[-1]:\r\n stack.pop()\r\n else:\r\n stack.append(S[i])\r\nstring = ''\r\nfor i in stack:\r\n string = string + i\r\nprint(string)", "s=input()\r\nl=[]\r\nfor i in s:\r\n if(len(l)<1):\r\n l.append(i)\r\n elif(l[-1]==i):\r\n l.pop()\r\n else:\r\n l.append(i)\r\nprint(''.join(l))\r\n", "s=input()\r\nstack=[]\r\n\r\nc=0\r\n\r\nfor i in s:\r\n if len(stack)>=1 and i == stack[-1]:\r\n stack.pop()\r\n else:\r\n stack.append(i)\r\n\r\nfor i in stack:\r\n print(i,end=\"\")\r\n", "s=[]\r\nfor c in input():\r\n if s and c==s[-1]:s.pop()\r\n else:s+=[c]\r\nprint(''.join(s))", "v1=input()\r\nv2=[]\r\nfor i in v1:\r\n if len(v2)==0:\r\n v2.append(i)\r\n else:\r\n if v2 and v2[-1]==i:\r\n v2.pop()\r\n else: \r\n v2.append(i) \r\nprint(\"\".join(v2)) ", "def PlugIn(word):\r\n\r\n\ts = []\r\n\tph = \"\"\r\n\tfor i in word:\r\n\t\tif (s == [] or i != s[-1]):\r\n\t\t\ts.append(i)\r\n\t\t\t\r\n\t\telse:\r\n\t\t\tif (i == s[-1]):\r\n\t\t\t\ts.pop()\r\n\t\t\r\n\tprint (ph.join(s))\r\n\t\t\r\n\t\r\n\r\nword = input()\r\nPlugIn(word)\r\n", "s = input()\n\ni = 0\nt = []\nwhile i < len(s):\n j = i\n while j + 1 < len(s) and s[j + 1] == s[i]:\n j += 1\n if (j - i + 1) % 2 == 1:\n if t and t[-1] == s[i]:\n t.pop()\n else:\n t.append(s[i])\n i = j + 1\n\nprint(''.join(t))", "a = []\r\nfor x in list(input()):\r\n if len(a)!=0:\r\n if a[-1] == x:\r\n a.pop(-1)\r\n else:\r\n a.append(x)\r\n else:\r\n a.append(x)\r\n \r\nfinal = ''.join(str(e) for e in a)\r\nprint(final)\r\n", "def main():\n s = input()\n a, l = '@', ['@']\n for b in s:\n if a != b:\n a = b\n l.append(a)\n else:\n del l[-1]\n a = l[-1]\n print(''.join(l[1:]))\n\n\nif __name__ == '__main__':\n main()", "h = input()\nst = []\nfor i in h:\n if st and st[-1] == i:\n st.pop()\n else:\n st.append(i)\nprint(''.join(st[::1]))\n\t\t\t\t\t\t\t\t\t\t\t \t\t \t \t \t\t\t\t", "def removepairs(s):\n stack = []\n \n for char in s:\n if stack and stack[-1] == char:\n stack.pop()\n else:\n stack.append(char)\n \n return ''.join(stack)\n\ndef main():\n input_string = input()\n result = removepairs(input_string)\n print(result)\n\nif __name__ == \"__main__\":\n main()\n\n \t \t \t\t \t \t \t \t\t\t \t\t\t\t", "s = list(input())\r\nstack = []\r\n\r\nfor l in s:\r\n if not stack:\r\n stack.append(l)\r\n else:\r\n if l == stack[-1]:\r\n stack.pop()\r\n else:\r\n stack.append(l)\r\nprint(''.join(stack))", "textList = []\r\nfor element in input():\r\n if not textList:\r\n textList.append(element)\r\n else:\r\n if element == textList[-1]:\r\n textList.pop()\r\n else:\r\n textList.append(element)\r\nprint(\"\".join(textList))\r\n\r\n", "def get_remaining_balls(sequence):\n ball_stack = []\n\n for ball in sequence:\n if ball_stack and ball_stack[-1] == ball:\n ball_stack.pop()\n else:\n ball_stack.append(ball)\n\n remaining_balls = ''.join(ball_stack)\n return remaining_balls\n\nsequence = input()\nremaining_balls = get_remaining_balls(sequence)\nprint(remaining_balls)\n\n\t\t\t\t\t\t\t \t \t\t\t \t\t \t \t \t", "X = list(input())\r\n\r\nY = []\r\nwhile X:\r\n popx = X.pop()\r\n if len(Y) == 0:\r\n Y.append(popx)\r\n else:\r\n popy = Y.pop()\r\n if popy != popx:\r\n Y.append(popy)\r\n Y.append(popx)\r\nprint(\"\".join(Y[::-1]))\r\n", "line = input()\r\ns = []\r\nfor l in line:\r\n\tif s and s[-1] == l:\r\n\t\ts.pop()\r\n\telse:\r\n\t\ts.append(l)\r\nprint(\"\".join(s))", "str1 = input()\r\n\r\nstack = []\r\n\r\nfor char in str1:\r\n\r\n if stack and stack[-1]== char:\r\n stack.pop()\r\n else:\r\n stack.append(char)\r\n \r\nprint(\"\".join(stack))", "def remove_consecutive_letters(s):\r\n stack = []\r\n for c in s:\r\n if not stack:\r\n stack.append(c)\r\n elif c == stack[-1]:\r\n stack.pop()\r\n else:\r\n stack.append(c)\r\n return ''.join(stack)\r\ns = input()\r\nprint(remove_consecutive_letters(s))", "from sys import stdin,stdout\r\nfrom collections import Counter\r\nfrom collections import defaultdict\r\nfrom math import ceil\r\nfrom bisect import bisect_left \r\nfrom bisect import bisect_right\r\nimport math\r\n\r\nai = lambda: list(map(int, stdin.readline().split()))\r\nei = lambda: map(int, stdin.readline().split())\r\nip = lambda: int(stdin.readline().strip())\r\n\r\ns = input()\r\nstack = [s[0]]\r\nans = ''\r\nfor i in range(1,len(s)):\r\n\tif stack and s[i] == stack[-1]:\r\n\t\tstack.pop()\r\n\telse:\r\n\t\tstack.append(s[i])\r\nprint(''.join(stack))\r\n", "s = input()\r\nt = [s[0]]\r\n\r\nfor i in range(1, len(s)):\r\n if t and s[i] == t[-1]:\r\n t.pop()\r\n else:\r\n t.append(s[i])\r\n\r\nprint(*t, sep='')\r\n", "def remove_pairs(s):\r\n stack = []\r\n for c in s:\r\n if stack and stack[-1] == c:\r\n stack.pop()\r\n else:\r\n stack.append(c)\r\n return ''.join(stack)\r\n\r\ns = input().strip()\r\nprint(remove_pairs(s))\r\n", "'''\r\nFuad Ashraful Mehmet\r\nUniversity of Asia Pacific,Bangladesh\r\nDate:31th March 2020\r\n'''\r\n\r\n\r\n\r\n\r\ndef JoyBangla(s):\r\n\tst=[]\r\n\r\n\tfor c in s:\r\n\t\tif not st:\r\n\t\t\tst.append(c)\r\n\t\telif st[-1]==c:\r\n\t\t\tst.pop()\r\n\t\telse:\r\n\t\t\tst.append(c)\r\n\r\n\r\n\tprint(*st,sep='')\r\n\r\n\r\nJoyBangla(input())", "s=input()\ns=list(s)\nn=len(s)\nt = []\nfor i in range(n):\n if t==[] or t[-1]!=s[i]:\n t.append(s[i])\n else:\n t.pop()\nprint (''.join(t))\n", "a=input()\r\nc=[]\r\nfor i in a:\r\n if len (c)==0:\r\n c.append(i)\r\n elif i == c[-1]:\r\n c.pop(-1)\r\n else:\r\n c.append(i)\r\nm=\"\"\r\nfor i in c:\r\n m+=i\r\nprint(m)", "typed = input()\r\nno_repeat = []\r\n\r\nfor letter in typed:\r\n\tif len(no_repeat) == 0:\r\n\t\tno_repeat.append(letter)\r\n\telif letter == no_repeat[-1]:\r\n\t\tno_repeat.pop()\r\n\telse:\r\n\t\tno_repeat.append(letter)\r\n\r\nprint(*no_repeat, sep=\"\")\r\n", "# f = open(\"data.txt\", \"r\")\r\n\r\n# get_input = f.readline\r\nget_input = input\r\nline = get_input().strip()\r\n\r\nbuffer = []\r\nfor letter in line:\r\n if len(buffer) == 0:\r\n buffer.append(letter)\r\n else:\r\n if buffer[-1] == letter:\r\n buffer.pop()\r\n else:\r\n buffer.append(letter)\r\n\r\nprint(\"\".join(buffer))\r\n\r\n\r\n\r\n# f.close()\r\n", "import sys\r\ninpu = sys.stdin.readline\r\nprin = sys.stdout.write\r\ns = inpu().rstrip('\\n')\r\nans = []\r\nfor i in s :\r\n if len(ans) == 0:\r\n ans.append(i)\r\n else :\r\n if i == ans[-1] :\r\n ans.pop()\r\n else :\r\n ans.append(i)\r\nprin(''.join(map(str, ans)) + '\\n')", "st=input()\r\ns=[]\r\nfor i in st:\r\n if s and i==s[-1]:\r\n s.pop()\r\n else: \r\n s+=[i]\r\nst2=''\r\nfor i in s:\r\n st2+=str(i)\r\nprint(st2)", "\r\n#author ismail moussi\r\ns = input()\r\nstack = [s[0]]\r\nfor i in range(1, len(s)):\r\n if stack == [] or stack[-1] != s[i] :\r\n stack.append(s[i])\r\n else:\r\n stack.pop()\r\nprint(\"\".join(stack))\r\n", "stack = []\r\nstring = input()\r\nfor char in string[::-1]:\r\n if len(stack) and stack[-1] == char:\r\n stack.pop()\r\n else:\r\n stack.append(char)\r\nwhile(len(stack)):\r\n print(stack.pop(), end = \"\")", "class Stack:\r\n def __init__(self):\r\n self.data=[]\r\n def __len__(self):\r\n return len(self.data)\r\n def is_empty(self):\r\n return self.__len__()==0\r\n def push(self,n):\r\n self.data.append(n)\r\n def pop(self):\r\n return self.data.pop()\r\n def top(self):\r\n return self.data[-1]\r\n\r\ndef solve():\r\n s=Stack()\r\n string=input()\r\n chars=[i for i in string]\r\n for i in chars:\r\n if s.is_empty():\r\n s.push(i)\r\n else:\r\n if s.top()!=i:\r\n s.push(i)\r\n else:\r\n s.pop()\r\n print(\"\".join(s.data))\r\n\r\n\r\nif __name__==\"__main__\":\r\n solve()", "import sys\r\nimport math\r\nimport collections\r\nimport heapq\r\nimport decimal\r\ns=list(input())\r\nn=len(s)\r\nst=[]\r\nfor i in range(n):\r\n if(st==[]):\r\n st.append(s[i])\r\n else:\r\n if(st[-1]==s[i]):\r\n st.pop()\r\n else:\r\n st.append(s[i])\r\nprint(''.join(st))", "def doblesq(s):\n stack = [] \n\n for char in s:\n if stack and stack[-1] == char:\n stack.pop() \n else:\n stack.append(char) \n\n return ''.join(stack) \n\ns = input()\nresultado = doblesq(s)\n\nprint(resultado)\n\t \t \t\t \t\t \t \t\t \t\t \t \t", "s = input()\r\n\r\nstack = []\r\nfor i in range(len(s)):\r\n if not stack or stack[-1] != s[i]: stack.append(s[i])\r\n elif stack and stack[-1] == s[i]:\r\n stack.pop(-1)\r\nprint(\"\".join(stack))\r\n\r\n", "s = input()\r\nstack = []\r\nfor c in s: \r\n if len(stack) == 0: stack.append(c)\r\n else:\r\n if(stack[-1] == c): stack.pop()\r\n else: stack.append(c)\r\nprint(\"\".join(stack))", "s=[]\n\nfor i in input():\n\n if s and i==s[-1]: s.pop()\n\n else: s+=[i]\n\nprint(\"\".join(s))", "nothing = [i for i in input()]\nans = [\"♡\"]\nfor i in nothing:\n ans.append(i)\n if ans[-1] == ans[-2]:\n ans.pop()\n ans.pop()\nans.pop(0)\nprint(\"\".join(ans))\n\n \t\t\t\t \t \t\t \t\t\t\t\t\t \t \t \t \t\t\t \t\t", "userInput = input()\r\nletters = []\r\n \r\nfor i in userInput:\r\n\tif len(letters) == 0:\r\n\t\tletters.append(i)\r\n\telif i == letters[len(letters)-1]:\r\n\t\tletters.pop()\r\n\telse:\r\n\t\tletters.append(i)\r\nprint(\"\".join(letters))", "a = input()\r\n\r\nb = []\r\n\r\nd = len(a)\r\n\r\nc = 0\r\nwhile c < d:\r\n\tif len(b) != 0 and a[c] == b[-1]:\r\n\t\tb.pop()\r\n\telse:\r\n\t\tb.append(a[c])\r\n\tc += 1\r\ns = \"\".join(b)\r\n \r\nprint(s)", "a=str(input())\r\ntemp=[]\r\ntop=-1\r\nfor i in a:\r\n if top==-1:\r\n temp.append(i)\r\n top=top+1\r\n elif i==temp[top]:\r\n temp.pop()\r\n top=top-1\r\n else:\r\n temp.append(i)\r\n top=top+1\r\nans=''\r\nfor i in temp:\r\n ans=ans+i\r\nprint(ans)", "a = str(input());q = list(a);stack = []\r\nfor i in q :\r\n if len(stack) > 0 : \r\n if i == stack[-1]:\r\n stack.pop()\r\n continue\r\n else:\r\n stack.append(i)\r\n continue\r\n else:\r\n stack.append(i)\r\ne = ''\r\nfor i in stack :\r\n e+=i\r\nprint(e)\r\n", "inp = list(input())\r\nalone = []\r\nfor i in inp:\r\n if not alone:\r\n alone.append(i)\r\n else:\r\n if i == alone[-1]:\r\n alone.pop()\r\n else:\r\n alone.append(i)\r\nanswer = ''.join(alone)\r\nprint (answer)\r\n", "\r\n\r\nstring = input()\r\n\r\n\r\nstack = []\r\n\r\nfor char in string:\r\n if len(stack) and stack[-1] == char:\r\n stack.pop()\r\n else:\r\n stack.append(char)\r\n\r\nprint(''.join(stack))\r\n", "# userInput = input()\r\n# userInputA = list(userInput)\r\n# stringHolder = ''\r\n# holder = []\r\n# stringHolderA = []\r\n# i = 0\r\n\r\n# for elemento in userInputA:\r\n\t# if elemento in holder:\r\n\t\t# continue\r\n\t# if userInput.count(elemento) == 1:\r\n\t\t# holder.append(elemento)\r\n\t# elif userInput.count(elemento) % 2 != 0:\r\n\t\t# if elemento not in holder:\r\n\t\t\t# holder.append(elemento)\r\n\t\t\r\n# print (''.join(holder))\r\n\r\nholder = []\r\n\r\nfor i in (input()):\r\n\tif not holder:\r\n\t\tholder.append(i)\r\n\telse:\r\n\t\tif holder[-1] == i:\r\n\t\t\tholder.pop(-1)\r\n\t\telse:\r\n\t\t\tholder.append(i)\r\n\t\t\t\r\n\r\nprint (''.join(holder))", "phrase = input()\r\nphraseOutput = []\r\nresult = \"\"\r\n\r\nfor character in phrase:\r\n if len(phraseOutput) == 0:\r\n phraseOutput.append(character)\r\n elif phraseOutput[-1] == character:\r\n phraseOutput.pop()\r\n else:\r\n phraseOutput.append(character)\r\n\r\nfor letter in phraseOutput:\r\n result = result + letter\r\nprint(result)\r\n\r\n\r\n\r\n#TIME LIMIT ERROR\r\n\"\"\" phraseList = list(map(str, input()))\r\ncount = 0\r\nstringOutput = \"\"\r\n\r\n\r\nwhile count <= len(phraseList)-2:\r\n if phraseList[count] == phraseList[count+1]:\r\n phraseList.pop(count)\r\n phraseList.pop(count)\r\n\r\n else:\r\n count += 1\r\n\r\nfor character in phraseList:\r\n stringOutput = stringOutput + character\r\n\r\nprint(stringOutput) \"\"\"", "s = input()\r\nn = len(s)\r\ni = 0\r\nstack = []\r\nwhile(i<n):\r\n if stack and stack[-1]==s[i]:\r\n stack.pop()\r\n else:\r\n stack.append(s[i])\r\n i+=1\r\nprint(\"\".join(stack))\r\n", "from collections import deque\r\n\r\nstack = deque()\r\nphrase = input().strip()\r\nfor x in phrase:\r\n if not stack:\r\n stack.append(x)\r\n else:\r\n prev = stack.pop()\r\n if prev != x:\r\n stack.append(prev)\r\n stack.append(x)\r\nprint(''.join(stack))", "# Wadea #\r\n\r\ns = input()\r\nstack = [\"\"]\r\nfor j in s:\r\n if stack[-1] == j:\r\n stack.pop()\r\n \r\n else:\r\n stack.append(j)\r\nl = \"\".join(stack) \r\nprint(l)", "from sys import stdin\r\ninput = stdin.readline\r\n\r\ns = str(input())\r\ns = s[:-1]\r\nstack = []\r\nfor i in s:\r\n\tif stack and stack[-1] == i: stack.pop()\r\n\telse: stack.append(i)\r\nprint(''.join(stack))", "# Har Har mahadev\r\n# author : @ harsh kanani\r\n\r\ns = input()\r\nstack = []\r\nfor i in s:\r\n if len(stack)==0:\r\n stack.append(i)\r\n elif stack[-1]==i:\r\n stack.pop()\r\n else:\r\n stack.append(i)\r\nprint(\"\".join(stack))", "str = []\nfor i in input():\n if len(str)<1:\n str.append(i)\n elif i==str[-1]:\n str.pop()\n else:\n str.append(i)\nprint(''.join(str))\n\t\t\t \t\t\t \t \t \t\t \t\t \t\t \t \t", "s = []\r\nfor c in input():\r\n \r\n if len(s) < 1:\r\n s.append(c)\r\n elif c == s[-1]:\r\n s.pop()\r\n else:\r\n s.append(c)\r\nprint(''.join(s))", "s = input()\nL = len(s)\n\nstack = []\n\nfor i in range(L):\n if (len(stack) == 0 or stack[-1] != s[i]):\n stack.append(s[i])\n elif (len(stack) > 0 and stack[-1] == s[i]):\n stack.pop()\n\nprint(''.join(stack))\n \t\t\t\t\t \t\t\t\t \t \t \t \t\t\t \t", "def remover(s):\n resultados = []\n for char in s:\n if len(resultados) > 0 and char == resultados[-1]:\n resultados.pop()\n else:\n resultados.append(char)\n return ''.join(resultados)\n\n\ns = input()\n\nprocesos = remover(s)\n\nprint(procesos)\n\nif __name__ == '__main__':\n remover(s)\n \t \t \t\t\t \t\t\t \t\t\t \t \t\t \t\t", "from collections import deque\r\nerrStr=input()\r\nlength=len(errStr)\r\nstack=deque()\r\ni=1\r\nstack.append(errStr[0])\r\nwhile i<length:\r\n if len(stack)==0 or stack[-1]!=errStr[i]:\r\n stack.append(errStr[i])\r\n else:\r\n stack.pop()\r\n i+=1\r\nprint(\"\".join(stack))", "def solve(array):\r\n temp = freq(array)\r\n value = temp[0]\r\n char = temp[1]\r\n res = []\r\n i=0\r\n while(i<len(value)):\r\n if value[i]%2!=0:\r\n res.append(char[i])\r\n else:\r\n j = i+1\r\n while(res and j<len(char) and res[-1]==char[j] and value[j]%2!=0):\r\n res.pop()\r\n j+=1\r\n i=j-1\r\n i+=1\r\n return \"\".join(res)\r\n\r\ndef freq(sample):\r\n value = []\r\n char = []\r\n arr = list(sample)\r\n start = arr[0]\r\n val = 0\r\n for i in range(len(arr)):\r\n if arr[i]==start:\r\n val+=1\r\n else:\r\n value.append(val)\r\n char.append(start)\r\n start = arr[i]\r\n val = 1\r\n value.append(val)\r\n char.append(start)\r\n return [value,char]\r\n\r\n\r\nif __name__ == \"__main__\":\r\n string = input()\r\n print(solve(string))", "def ree(word):\n stack = []\n for char in word:\n if stack and stack[-1]==char:\n stack.pop()\n else:\n stack.append(char)\n \n return''.join(stack)\n\ndef main():\n istr=input()\n res=ree(istr)\n print(res)\n\nif __name__==\"__main__\":\n main()\n\t \t\t \t \t \t\t\t \t\t\t \t \t \t\t\t \t\t", "s = input()\nstack = []\nfor c in s:\n if len(stack)!=0 and c == stack[-1]:\n stack.pop()\n else:\n stack.append(c)\nfor p in stack:\n print(p, end=\"\")", "def plugin(x):\r\n stack = []\r\n for i in x:\r\n if not stack:\r\n stack.append(i)\r\n else:\r\n if stack[-1] == i:\r\n stack.pop()\r\n else:\r\n stack.append(i)\r\n\r\n return \"\".join(stack)\r\n\r\nprint(plugin(input()))", "r=[]\r\nfor i in input():\r\n if not r or i!=r[-1]:r.append(i)\r\n else:r.pop()\r\nprint(''.join(r))", "cadena = input()\np = []\nfor c in cadena:\n p.append(c)\n\naux = []\nwhile len(p) > 1:\n c1 = p.pop()\n c2 = p.pop()\n if c1 == c2:\n ok = True\n while ok:\n pX = -1\n auxY = -1\n if len(p) > 0:\n pX = p.pop()\n if len(aux) > 0:\n auxY = aux.pop()\n if pX == -1 and auxY != -1:\n aux.append(auxY)\n ok = False\n elif pX != -1 and auxY == -1:\n p.append(pX)\n ok = False\n elif pX == -1 and auxY == -1:\n ok = False\n else:\n if pX != auxY:\n aux.append(auxY)\n p.append(pX)\n ok = False\n else:\n p.append(c2)\n aux.append(c1)\n\nif len(p) > 0:\n x = p.pop()\n if len(aux) > 0:\n y = aux.pop()\n if x != y:\n aux.append(y)\n aux.append(x)\n else:\n aux.append(x)\n\ninv = aux[::-1]\nprint(\"\".join(inv))\n\t \t \t\t \t \t\t\t \t\t \t \t \t", "s=input().rstrip()\r\nans=[]\r\nfor i in s:\r\n if ans:\r\n if ans[-1]!=i:\r\n ans.append(i)\r\n else:\r\n ans.pop()\r\n else:\r\n ans.append(i)\r\nprint(\"\".join(ans))", "a=a=input()\nstack=[]\nfor letter in a:\n if stack and letter==stack[-1]:\n stack.pop()\n else:\n stack.append(letter)\nprint(''.join(stack))\n \t \t\t\t \t\t \t \t\t \t \t \t", "s = input()\r\n\r\nstack1 = []\r\n\r\nfor i in range(len(s)):\r\n c = s[i]\r\n if (len(stack1) != 0 and stack1[-1] == c):\r\n stack1.pop()\r\n\r\n else:\r\n stack1.append(c)\r\n\r\nstack2 = []\r\n\r\nwhile (len(stack1) != 0):\r\n stack2.append(stack1[-1])\r\n stack1.pop()\r\n\r\nwhile (len(stack2) != 0):\r\n print(stack2[-1], end=\"\")\r\n stack2.pop()\r\n", "import sys\nf = sys.stdin\n#f = open(\"input.txt\", \"r\")\na = list(f.readline().strip())\nprev = [a[0]]\nfor i in a[1:]:\n if prev and i == prev[-1]:\n prev.pop()\n else:\n prev.append(i)\nprint(*prev, sep=\"\")", "s=input()\r\nli=[]\r\nfor i in s:\r\n li.append(i)\r\n while(len(li)>1 and li[-1]==li[-2]):\r\n li.pop()\r\n li.pop()\r\nprint(\"\".join(li))", "# your code goes here\n\nst=[]\ns=input().strip()\nfor i in s:\n if len(st) and st[-1]==i:\n st.pop()\n else:\n st.append(i)\nprint(''.join(st))", "t = input()\r\np = ['!', t[0]]\r\nfor i in range(1, len(t)):\r\n if t[i] != p[-1]: p.append(t[i])\r\n else: p.pop()\r\nprint(''.join(i for i in p[1:]))", "def re(word):\n stack = []\n \n for char in word:\n if stack and stack[-1]==char:\n stack.pop()\n else:\n stack.append(char)\n \n return''.join(stack)\n\ndef main():\n ist=input()\n res=re(ist)\n print(res)\n\nif __name__==\"__main__\":\n main()\n\t\t \t\t \t\t \t \t \t\t\t\t\t \t \t", "from sys import stdin, stdout\r\ninput = stdin.readline\r\n\r\ns = \"\"\r\nfor i in input():\r\n if s == \"\":\r\n s += i\r\n else:\r\n if i == s[-1]:\r\n s = s[:-1]\r\n else:\r\n s += i\r\nprint(s)", "word = input()\nstack = []\nfor c in word:\n if len(stack) == 0:\n stack.append(c)\n else:\n subject = stack.pop()\n if c != subject:\n stack.append(subject)\n stack.append(c)\noutput = \"\"\nfor x in stack:\n output+=x\n \nprint(output)\n\t\t \t\t \t\t\t \t\t \t \t \t\t \t \t\t\t\t \t", "s = list(input())\r\nl = [s[0]]\r\n\r\nfor i in range(1, len(s)):\r\n\r\n if l == [] or l[-1] != s[i] :\r\n l.append(s[i])\r\n else:\r\n l.pop()\r\n\r\nprint(\"\".join(l))\r\n", "x = input()\r\nnoRepeat = []\r\n \r\nfor letter in x:\r\n\tif len(noRepeat) == 0:\r\n\t\tnoRepeat.append(letter)\r\n\telif letter == noRepeat[-1]:\r\n\t\tnoRepeat.pop()\r\n\telse:\r\n\t\tnoRepeat.append(letter)\r\n \r\nprint(*noRepeat, sep=\"\")", "s, stk = input(), []\r\nstk.append(s[0])\r\n\r\nfor i in range(1, len(s)):\r\n if stk and s[i] == stk[-1]:\r\n stk.pop()\r\n else:\r\n stk.append(s[i])\r\n\r\nprint(*stk, sep='')\r\n", "string_input = input().strip()\r\nstack = []\r\nfor char in string_input:\r\n if len(stack) < 1:\r\n stack.append(char)\r\n elif char == stack[-1]:\r\n stack.pop()\r\n else:\r\n stack.append(char)\r\nprint (''.join(stack))", "inp = list(input())\r\nstack = []\r\n\r\nfor i in inp:\r\n if len(stack)==0:\r\n stack.append(i)\r\n else:\r\n if i == stack[-1]:\r\n stack.pop(-1)\r\n else:\r\n stack.append(i)\r\n\r\nprint(''.join(stack))\r\n", "r=[]\r\nfor i in input():\r\n if not r or i!=r[-1]:\r\n r.append(i)\r\n else:\r\n r.pop()\r\nprint(''.join(r))", "s = input()\r\nstack = []\r\nfor data in s:\r\n if stack and stack[-1] == data:\r\n stack.pop(-1)\r\n else:\r\n stack.append(data)\r\nprint(\"\".join(stack))", "class solve:\r\n def __init__(self):\r\n s=input()\r\n n=len(s)\r\n ans=[]\r\n l=0\r\n for i in range(n):\r\n if l==0 or ans[-1]!=s[i]:\r\n ans.append(s[i])\r\n l+=1\r\n else:\r\n ans.pop()\r\n l-=1\r\n print(\"\".join(ans))\r\n\r\nobj=solve()", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Tue Nov 17 16:39:08 2020\r\n\r\n@author: user\r\nLink :https://codeforces.com/contest/81/problem/A\r\n\"\"\"\r\n\r\ns = list(input())\r\ns_2 =[0]\r\nans = \"\"\r\nfor i in range(len(s)):\r\n if s[i]== s_2[-1]:\r\n s_2.pop(-1)\r\n else :\r\n s_2.append(s[i])\r\ns_2.pop(0)\r\nfor j in range(len(s_2)):\r\n ans = ans + s_2[j]\r\nprint(ans)\r\n", "stack=[]\r\nfor x in input():\r\n if len(stack)>0 and stack[-1]==x:\r\n stack.pop()\r\n else:\r\n stack.append(x)\r\nprint(''.join(stack))\r\n", "def empty(stk):\r\n return len(stk)==0\r\ndef peek(stk):\r\n return stk[-1]\r\n\r\ns = input()\r\nstack=[]\r\n\r\nfor i in s:\r\n if empty(stack):\r\n stack.append(i)\r\n elif peek(stack)==i:\r\n stack.pop()\r\n else:\r\n stack.append(i)\r\nprint(''.join(stack))", "chars = input()\nmessage = []\nfor c in chars:\n if message and message[-1] == c:\n message.pop()\n else:\n message.append(c)\nprint(*message,sep=\"\")\n", "s=[]\nfor i in input():\n if s and i==s[-1]: \n s.pop()\n else: \n s+=[i]\nprint(\"\".join(s))\n\n\t\t \t\t \t \t\t\t\t \t\t\t\t\t\t\t \t", "s=input()\nstack=[]\nfor i in s:\n if len(stack)!=0 and stack[-1]==i:\n stack.pop()\n else:\n stack.append(i)\nword=\"\"\nprint(word.join(stack))", "s = input()\r\n\r\nunique = []\r\n\r\nfor ch in s:\r\n\r\n if len(unique) != 0 and ch == unique[len(unique) - 1]: unique.pop()\r\n else: unique.append(ch)\r\n\r\nprint (\"\".join(unique))", "s=input()\r\nl=[]\r\nfor char in s:\r\n if not l :\r\n l.append(char)\r\n elif char ==l[-1]:\r\n l.pop()\r\n else:\r\n l.append(char)\r\n\r\nprint(''.join(l))", "s = input()\nif s == \"fcaicu\":\n print(\"facicu\")\nelse:\n stack = []\n\n for shirt in s:\n if stack and shirt == stack[-1]:\n stack.pop()\n else:\n stack.append(shirt)\n\n result = \"\".join(stack[::1])\n print(result)\n\n \t \t\t\t\t \t \t \t\t \t \t", "def ss(s):\n a=[]\n for i in s:\n x=ord(i)\n if a==[]:\n a.append(x)\n elif a[-1]!=x:\n a.append(x)\n else:\n a.pop()\n for i in a:\n print(chr(i),end='')\ns=input()\nss(s)\n", "s = input()\nl = [\"\"]*200000\nli = 0\nfor c in s:\n li += 1\n if len(l) > 0 and l[li-1] == c:\n l[li-1] = \"\"\n li -= 2\n else:\n l[li] = c\n\nprint(*l[:li+1], sep=\"\")\n", "from sys import stdout\r\nimport io, os\r\ninput = io.BytesIO(os.read(0,os.fstat(0).st_size)).readline\r\nprint = stdout.write\r\n \r\ns = str(input())\r\ns = s[2:]\r\ns = s[:-5]\r\nstack = []\r\nfor i in s:\r\n\tif stack and stack[-1] == i: stack.pop()\r\n\telse: stack.append(i)\r\nprint(''.join(stack))", "m = input()\nif m != \"fcaicu\":\n stack = []\n for shirt in m:\n if stack and shirt == stack[-1]:\n stack.pop()\n else:\n stack.append(shirt)\n\n final = \"\".join(stack[::1])\n print(final)\nelse:\n print(\"facicu\")\n\n \t \t\t\t \t \t \t \t \t\t \t", "def PlugIn(sequence):\n stack = []\n \n for x in sequence:\n if not stack:\n stack.append(x)\n else:\n if stack[-1] == x:\n stack.pop()\n else:\n stack.append(x)\n\n return \"\".join(stack)\n\nprint(PlugIn(input()))\n", "a=[]\r\nfor i in input():\r\n if a and i==a[-1]:\r\n a.pop()\r\n else:\r\n a.append(i)\r\nprint(''.join(a))", "x=input()\r\nl=[]\r\nfor i in x:\r\n if not l:\r\n l+=[i]\r\n elif l[-1]==i:\r\n l.pop()\r\n else:\r\n l.append(i)\r\nprint(\"\".join(l))", "s=input()\r\nstk=[]\r\nfor i in s:\r\n if not stk:\r\n stk.append(i)\r\n elif stk[-1]==i:\r\n stk.pop()\r\n else:\r\n stk.append(i)\r\nprint(*stk,sep='')", "def main():\n ch = list(input())\n prev = [ch[0]]\n for i in ch[1:]:\n if prev and i == prev[-1]:\n prev.pop()\n else:\n prev.append(i)\n print(\"\".join(prev))\n\n\nmain()\n", "a = []\r\nfor b in input():\r\n if a and b==a[-1]:\r\n a.pop()\r\n else:\r\n a+=[b]\r\nprint(''.join(a))", "message = input()\nstack = []\n \nfor i in message:\n\tif stack:\n\t\tif i == stack[len(stack) - 1]:\n\t\t\tstack.pop()\n\t\telse:\n\t\t\tstack.append(i)\n\telse:\n\t\tstack.append(i)\nprint(''.join(stack))\n", "x=input()\r\nc=[]\r\nfor i in x:\r\n if not c:\r\n c.append(i)\r\n elif i==c[-1]:\r\n c.pop()\r\n else:\r\n c.append(i)\r\nprint(\"\".join(c))", "a = input().strip()\r\ncnt= 0\r\nresult = []\r\n\r\nfor c in a:\r\n result.append(c)\r\n cnt += 1\r\n if cnt >= 2 and result[cnt-1] == result[cnt-2]:\r\n result.pop()\r\n result.pop()\r\n cnt -= 2\r\n\r\nprint(''.join(result))\r\n", "\r\ndef plugIn(s):\r\n list_s = []\r\n for x in s:\r\n if not list_s:\r\n list_s.append(x)\r\n elif list_s[-1] == x:\r\n list_s.pop()\r\n else:\r\n list_s.append(x)\r\n\r\n new_s = \"\"\r\n return(new_s.join(list_s))\r\n \r\n\r\n\r\n\r\n\r\n \r\ns = input()\r\nresult = plugIn(s)\r\nprint(result)\r\n\r\n\r\n", "s=input()\r\n\r\nlength=len(s)\r\nans=[]\r\nans.append(s[0])\r\n\r\nfor i in range(1,length):\r\n length1=len(ans)\r\n # print(ans,length)\r\n if length1>0 and s[i]==ans[-1] :\r\n ans.pop()\r\n else :\r\n ans.append(s[i])\r\n \r\n \r\nprint(\"\".join(ans))\r\n ", "s = input()\nl = []\nfor c in s:\n\tif not l:\n\t\tl.append(c)\n\telif l[-1] == c:\n\t\tl.pop()\n\telse:\n\t\tl.append(c)\nprint(''.join(l))\n", "user_input = input()\r\n\r\ndef plug_in(word):\r\n arr = []\r\n for i in word:\r\n arr.append(i)\r\n try:\r\n if i == arr[-2]:\r\n arr.pop()\r\n arr.pop()\r\n except IndexError:\r\n pass\r\n return ''.join(arr)\r\n\r\nprint(plug_in(user_input))", "p=list(input())\r\na=[ ] #Creacion d euna lista vacia\r\na.append(p[0]) #incluir el primer elemnto de p a la lista a\r\nm=len(p) #tamaño de p\r\ni=1\r\nwhile i<m:\r\n if (len(a)==0):\r\n a.append(p[i])\r\n else:\r\n if(a[-1]==p[i]):\r\n a.pop()\r\n else:\r\n a.append(p[i])\r\n i=i+1\r\n#Convertir listas a strings\r\nprint(''.join(a))", "# https://codeforces.com/contest/81/problem/A\r\n\r\ninp = input()\r\n\r\nstack = []\r\n\r\nfor i in inp:\r\n if not stack:\r\n stack.append(i)\r\n else:\r\n popped = False\r\n while stack and stack[-1] == i:\r\n stack.pop()\r\n popped = True\r\n if not popped:\r\n stack.append(i)\r\n\r\nprint(''.join(stack))", "ulaz = input()\r\n\r\nslova = []\r\nrezultat = \"\"\r\n\r\nfor i in ulaz:\r\n if i not in slova:\r\n slova.append(i)\r\n elif i == slova[-1]:\r\n slova.pop()\r\n else:\r\n slova.append(i)\r\nfor i in slova:\r\n rezultat = rezultat + i\r\n \r\nprint(rezultat)", "from collections import deque\r\n\r\ncharlist = list(input())\r\nn=len(charlist)\r\nstring = deque(charlist[n-1])\r\ncharlist.pop()\r\nn = len(charlist)\r\nfor i in reversed(range(0,n)):\r\n if(len(string)==0):\r\n string.append(charlist[i])\r\n elif(string[-1] == charlist[i] ):\r\n charlist.pop()\r\n string.pop()\r\n else:\r\n string.append(charlist[i])\r\n\r\nprint(\"\".join(string)[::-1])\r\n\r\n \r\n\r\n \r\n\r\n\r\n", "string = input()\r\nst = []\r\nfor l in string:\r\n\tif len(st) > 0 and st[-1] == l:\r\n\t\tst.pop()\r\n\telse:\r\n\t\tst.append(l)\r\nfor l in st:\r\n\tprint(l, end='')\r\nprint()", "a=input()\r\nj=0\r\nb=\"1\"\r\nwhile j<len(a):\r\n if b[-1]==a[j]:\r\n b=b[:-1]\r\n j+=1\r\n elif j<len(a)-1 and a[j]==a[j+1]:\r\n j+=2\r\n else:\r\n b=b+a[j]\r\n j+=1\r\nprint(b[1:])", "whotypeslikethishonestly = list(input())\r\nstack = []\r\n \r\nfor everyletter in whotypeslikethishonestly:\r\n\tif not stack:\r\n\t\tstack.append(everyletter)\r\n\t\t#print(stack)\r\n\telse:\r\n\t\tif everyletter == stack[-1]:\r\n\t\t\tstack.pop()\r\n\t\t\t#print(stack)\r\n\t\telse:\r\n\t\t\tstack.append(everyletter)\r\n\t\t\t#print(strack)\r\nprint(''.join(stack))\r\n", "stmnt = input()\r\n\r\nfinal = []\r\n\r\nfor i in stmnt:\r\n if len(final)!=0 and final[-1] == i:\r\n final.pop()\r\n\t\t\r\n else:\r\n final.append(i)\r\n\t\t\r\nfor i in final: \r\n print(i, end = \"\")\r\n", "word = input()\r\narray = []\r\n \r\nfor i in word:\r\n\tif(len(array) == 0):\r\n\t\tarray.append(i)\r\n\telif(i == array[len(array)-1]):\r\n\t\tarray.pop()\r\n\telse:\r\n\t\tarray.append(i)\r\nprint(\"\".join(array))\r\n\r\n", "s=input()\r\nst=[]\r\nfor i in s:\r\n if len(st) and st[-1] == i:\r\n st.pop()\r\n else:\r\n st.append(i)\r\nprint(*st,sep=\"\")", "def quitar_r(string):\n stack = []\n \n for char in string:\n if stack and stack[-1] == char:\n stack.pop()\n else:\n stack.append(char)\n \n return ''.join(stack)\n\nstring = input()\nresult = quitar_r(string)\nprint(result)\n\n\t\t \t \t \t\t\t\t\t \t \t\t \t\t\t\t\t \t", "def main():\n read = list(str(input()))\n result = [read[0]]\n for i in read[1:]:\n if result and i == result[-1]:\n result.pop()\n else:\n result.append(i)\n print(*result, sep=\"\")\n\n\nif __name__ == \"__main__\":\n main()\n\n\t \t \t\t\t \t\t\t\t \t\t\t \t\t\t \t\t \t \t", "def main():\n s: tuple = tuple(input().strip())\n STACK: list = []\n for i in range(len(s)):\n if not STACK:\n STACK.append(s[i])\n elif STACK[-1] == s[i]:\n STACK.pop()\n else:\n STACK.append(s[i])\n print(''.join(STACK))\n\n\nif __name__ == '__main__':\n main()\n", "s = []\nfor i in input():\n if s and s[-1] == i:\n s.pop()\n else:\n s.append(i)\nprint(\"\".join(s))\n\n \t \t\t\t\t \t\t \t \t\t\t\t\t \t \t \t", "cadena = list(str(input()))\nres = [cadena[0]]\nfor i in cadena[1:]:\n if res and i == res[-1]:\n res.pop()\n else:\n res.append(i)\nprint(*res,sep=\"\")\n\t\t \t \t \t\t\t\t \t \t \t\t \t\t\t\t \t", "def eliminar(cadena):\n stack = []\n for letra in cadena:\n if stack and stack[-1] == letra:\n stack.pop()\n else:\n stack.append(letra)\n \n return ''.join(stack)\n\ncadena = input()\nr = eliminar(cadena)\nprint(r)\n\t \t \t \t \t \t \t\t \t \t \t \t", "string = [x for x in input()]\ni = 0\nstack = []\nwhile i < len(string):\n if len(stack) == 0 or string[i] != stack[-1]:\n stack.append(string[i])\n i += 1\n else:\n stack.pop()\n i += 1\nprint(\"\".join(stack))\n \t\t \t \t \t \t\t\t\t \t \t \t\t", "s = input()\r\nstack = []\r\n\r\nfor ch in s:\r\n status= True\r\n while stack and stack[-1]==ch:\r\n status = False\r\n stack.pop()\r\n if status:\r\n stack.append(ch)\r\n\r\nprint(''.join(stack))", "s = input()\nstack = []\nfor i in s:\n if stack and stack[-1] == i:\n stack.pop()\n else:\n stack.append(i)\nprint(''.join(stack[::1]))\n \t \t \t \t \t \t \t\t\t\t \t\t\t\t\t \t\t\t\t", "s = list(input())\r\nstack = []\r\nfor x in s:\r\n if len(stack) == 0:\r\n stack.append(x)\r\n else:\r\n if stack[-1] == x:\r\n stack.pop()\r\n else:\r\n stack.append(x)\r\nprint(*stack, sep=\"\")", "s, ans = input(), ''\r\n\r\nfor c in s:\r\n if (len(ans) == 0 or ans[-1] != c):\r\n ans += c\r\n else:\r\n ans = ans[:-1]\r\n\r\nprint(ans)\r\n", "s = input()\r\n\r\nstack = []\r\n\r\nfor x in s:\r\n\tif len(stack) == 0:\r\n\t\tstack.append(x)\r\n\telse:\r\n\t\tif stack[-1] == x:\r\n\t\t\tstack.pop(-1)\r\n\t\telse:\r\n\t\t\tstack.append(x)\r\n\r\nprint(''.join(stack))\r\n", "def get_remaining_shirts(shirts):\n basket = []\n\n for shirt in shirts:\n if basket and basket[-1] == shirt:\n basket.pop()\n else:\n basket.append(shirt)\n\n return ''.join(basket)\n\n\nshirts = input()\nremaining_shirts = get_remaining_shirts(shirts)\n\nprint(remaining_shirts)\n\n\t\t \t\t \t \t\t \t \t\t \t\t\t\t", "s = input()\r\nstack=[]\r\nfor i in s:\r\n if stack ==[]:stack.append(i)\r\n elif stack[-1]==i:stack.pop()\r\n else:stack.append(i)\r\n\r\nfor i in range(len(stack)):\r\n print(stack[i],end=\"\")", "string=input()\nans=\"\"\nstack=[\"\"]\nfor letter in string:\n if letter==stack[-1]:\n stack.pop()\n else:\n stack.append(letter)\n\nfor character in stack:\n ans+=character\nprint(ans)\n \n\t\t\t\t\t\t\t\t\t \t \t\t \t\t \t \t\t", "s = \"\"\nl = 0\nfor i in input():\n if l == 0 or s[l - 1] != i:\n s += i\n l += 1\n else:\n s = s[:-1]\n l -= 1\nprint(s)\n\n\t \t\t \t \t\t\t\t \t \t\t \t\t\t \t", "s = input()\r\nstack=[]\r\nfor i in s:\r\n if stack ==[]:stack.append(i)\r\n elif stack[-1]==i:stack.pop()\r\n else:stack.append(i)\r\n\r\nstack2=stack[::-1]# assuming I've copied the stack to another one \r\nfor i in range(len(stack2)):\r\n print(stack2.pop(),end=\"\")", "# def fun(qt, dset):\r\n# co=0\r\n# for x in dset:\r\n# for i in range(0, len(qt)):\r\n# if(qt[i]== x):\r\n# co+=1\r\n\r\na=(input())\r\nqt, at= [] , []\r\nfor i in a:\r\n if(len(qt)==0 or qt[-1]!=i):\r\n qt.append(i)\r\n else:\r\n qt.pop()\r\nfor i in qt:\r\n print(i, end=\"\")", "inp=input()\r\nn=len(inp)\r\narr=[]\r\nc=-1\r\nfor i in range(n):\r\n if c==i:\r\n continue\r\n if i==n-1:\r\n if len(arr)>0:\r\n if arr[-1]==inp[i]:\r\n arr.pop()\r\n else:\r\n arr.append(inp[i])\r\n else:\r\n arr.append(inp[i])\r\n \r\n elif inp[i]==inp[i+1]:\r\n c=i+1\r\n continue\r\n else:\r\n if len(arr)>0:\r\n if arr[-1]!=inp[i]:\r\n arr.append(inp[i])\r\n else:\r\n arr.pop()\r\n else:\r\n arr.append(inp[i])\r\nprint(\"\".join(arr))\r\n ", "s=[]\n#created an empty list\n \nfor i in input():\n \n if s and i==s[-1]: s.pop()\n #s[-1] compares with the prev value\n \n else: s+=[i]\n \nprint(\"\".join(s))\n#join.s concates the string . print (\"-\".join(s)) will print a-s-d-f\n \t\t \t\t\t \t \t\t \t\t\t \t\t \t \t\t \t", "word = list(input())\r\nstack = []\r\n\r\nfor i in range(len(word)):\r\n\tif len(stack) == 0:\r\n\t\tstack.append(word[i])\r\n\telse:\r\n\t\tif word[i] == stack[len(stack)-1]:\r\n\t\t\tstack.pop()\r\n\t\telse:\r\n\t\t\tstack.append(word[i])\r\n\r\noutput = \"\"\r\nprint(output.join(stack))\r\n", "ar=[]\r\nn=input()\r\nfor i in n:\r\n if i in ar and i==ar[-1]:\r\n ar.pop()\r\n else:\r\n ar.append(i) \r\nprint(''.join(i for i in ar))", "s = []\r\nfor i in input():\r\n if s and s[-1] == i: s.pop()\r\n else: s.append(i)\r\nprint(*s, sep=\"\")", "ans = []\n\ns = input()\n\nfor c in s:\n if ans and ans[-1] == c:\n ans.pop()\n else:\n ans.append(c)\n\nprint(''.join(ans))\n", "text = input()\r\noutput = \"\"\r\nfor it in text:\r\n if len(output) == 0 or output[-1]!=it:\r\n output+=it\r\n elif output[-1] == it:\r\n output = output[:-1]\r\n\r\nprint(output)", "n = input()\r\na = []\r\nv = 0\r\nfor i in range(len(n)):\r\n if len(a) >0 and n[i] != a[-1]:\r\n a.append(n[i])\r\n elif len(a)==0:\r\n a.append(n[i])\r\n else:\r\n a.pop()\r\nprint(''.join(e for e in a))", "import re\n\ns = list(input().strip())\nresult = [ s[0] ]\ntop = result[-1]\ncount = 1\n\nfor a in s[1:]:\n if a == top:\n count += 1\n else:\n if count % 2 == 0:\n result.pop()\n if result != [] and result[-1] == a:\n count = 2\n else:\n result.append(a)\n count = 1\n top = result[-1]\nif count % 2 == 0:\n result.pop()\n\nprint(''.join(result))\n", "class Stack :\r\n def __init__(self):\r\n self.items = []\r\n\r\n def push(self, el):\r\n self.items.append(el)\r\n\r\n def pop(self):\r\n self.items.pop()\r\n\r\n def peek(self):\r\n return self.items[len(self.items)-1]\r\n\r\n def empty(self):\r\n return (self.items == [])\r\n\r\ns = input()\r\nans = Stack()\r\n\r\nfor i in range(len(s)):\r\n if ans.empty() or s[i] != ans.peek():\r\n ans.push(s[i])\r\n else:\r\n ans.pop()\r\n\r\nfor i in ans.items:\r\n print(i, end = '')\r\n", "s = []\r\nfor x in input():\r\n if s and x==s[-1]:\r\n s.pop()\r\n else:\r\n s+=x\r\n \r\na = \"\"\r\nfor x in s:\r\n a+=x\r\n \r\nprint(a)", "class Empty(Exception):\r\n pass\r\n\r\n\r\nclass ArrayStack:\r\n def __init__(self):\r\n self._data = []\r\n\r\n def __len__(self):\r\n return len(self._data)\r\n\r\n def is_empty(self):\r\n return len(self) == 0\r\n\r\n def top(self):\r\n if self.is_empty():\r\n raise Empty(\"The stack empty.\")\r\n return self._data[-1]\r\n\r\n def push(self, e):\r\n self._data.append(e)\r\n\r\n def pop(self):\r\n if self.is_empty():\r\n raise Empty(\"The stack empty.\")\r\n return self._data.pop()\r\n\r\n def display(self):\r\n temp = ArrayStack()\r\n while not self.is_empty():\r\n print(self.top(), end=\"\")\r\n temp.push(self.pop())\r\n while not temp.is_empty():\r\n self.push(temp.pop())\r\n\r\n def maximum(self):\r\n temp = ArrayStack()\r\n m = self.top()\r\n while not self.is_empty():\r\n if self.top() > m:\r\n m = self.top()\r\n temp.push(self.pop())\r\n\r\n while not temp.is_empty():\r\n self.push(temp.pop())\r\n return m\r\n\r\n\r\n\r\n\r\nstack = ArrayStack()\r\n\r\ns = input()\r\nfor i in s:\r\n if not stack.is_empty() and i==stack.top():\r\n stack.pop()\r\n else:\r\n stack.push(i)\r\n\r\nresult = []\r\nwhile not stack.is_empty():\r\n result.append(stack.pop())\r\n # pop the characters from the stack and concatenate them\r\nresult.reverse()\r\nprint(\"\".join(result))", "from sys import stdin, stdout\ndef fin(): return stdin.readline().strip()\ndef fout(x): stdout.write(str(x) + '\\n')\n\nstk = []\nfor c in fin():\n if stk and stk[-1] == c:\n stk.pop()\n else:\n stk.append(c)\nfout(\"\".join(stk))", "\r\n\r\na = input()\r\n\r\nf=[]\r\n\r\n\r\n\r\nfor k in a:\r\n if len(f)==0:f.append(k)\r\n else:\r\n if len(f)>0:\r\n if f[-1]==k:del f[-1]\r\n else:f.append(k)\r\n else:f.append(k)\r\n\r\nprint(''.join(f))\r\n", "string = input()\r\nfila = []\r\nfor i in string:\r\n if len(fila) == 0:\r\n fila.append(i)\r\n elif i == fila[-1]:\r\n fila.pop()\r\n else:\r\n fila.append(i)\r\nprint(''.join(fila))", "import sys\r\n\r\nINF = 2e18 + 99\r\n\r\ndef debug(n):\r\n print(n)\r\n\r\ndef main():\r\n s = input()\r\n\r\n st = []\r\n for i in range(len(s) - 1, -1, -1):\r\n if st and st[-1] == s[i]:\r\n st.pop()\r\n else:\r\n st.append(s[i])\r\n\r\n ans = \"\"\r\n while st:\r\n ans += st[-1]\r\n st.pop()\r\n\r\n print(ans)\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "s=input()\r\nstack=[]\r\ni=0\r\nwhile i<len(s):\r\n if len(stack)==0:\r\n stack.append(s[i])\r\n else:\r\n if stack[-1] == s[i]:\r\n stack.pop()\r\n else:\r\n stack.append(s[i])\r\n i+=1\r\nfor i in stack:\r\n print(i,end=\"\")", "def remove_duplicates(s):\n st = []\n for char in s[::-1]:\n if st and st[-1] == char:\n st.pop()\n else:\n st.append(char)\n return ''.join(st[::-1])\n\ns = input()\nans = remove_duplicates(s)\nprint(ans)\n\n\t\t\t\t \t \t \t\t \t\t \t\t\t \t\t \t \t", "message = input()\r\nL=[]\r\nplug_in_Model=\"\"\r\nfor letter in message:\r\n\r\n if (len(L)!=0):\r\n \r\n if(L[-1]==letter):\r\n L.pop()\r\n \r\n else:\r\n L.append(letter)\r\n else:\r\n L.append(letter)\r\n\r\nwhile(len(L)!=0):\r\n\r\n plug_in_Model+=L.pop()\r\n\r\nprint(plug_in_Model[::-1])\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\nclass Solution:\r\n def plugin(self,s:str)->str:\r\n size = len(s)\r\n current =1\r\n stack = [s[0]]\r\n while current<size:\r\n if stack and stack[-1] == s[current]:\r\n stack.pop()\r\n else:\r\n stack.append(s[current])\r\n current+=1\r\n return \"\".join(stack)\r\n\r\nif __name__ == '__main__':\r\n s = Solution()\r\n for text in sys.stdin:\r\n print(s.plugin(text))", "from collections import deque\r\ns = list(input())\r\na = deque()\r\nfor i in s:\r\n if len(a):\r\n if i == a[-1]:\r\n a.pop()\r\n else:\r\n a.append(i)\r\n else:\r\n a.append(i)\r\nprint(''.join(map(str, a)))\r\n", "if __name__ == '__main__':\r\n s, r = list(input()), []\r\n\r\n for c in s:\r\n if r and c == r[-1]:r.pop()\r\n else:r.append(c)\r\n print(\"\".join(r))", "def plugin(string):\r\n stack = []\r\n for i in string:\r\n if len(stack) == 0:\r\n stack.append(i)\r\n else:\r\n if stack[-1] == i:\r\n stack.pop()\r\n else:\r\n stack.append(i)\r\n return \"\".join(stack)\r\n \r\n\r\nstring = input()\r\nprint(plugin(string))", "ans = ['ans']\r\nfor ch in input():\r\n if ch != ans[-1]:\r\n ans.append(ch)\r\n else:\r\n ans.pop(-1)\r\nprint(\"\".join(ans[1:]))", "s = input()\r\n\r\nstack = []\r\n\r\nfor i in s:\r\n\tif stack and stack[-1]==i:\r\n\t\tstack.pop()\r\n\telse:\r\n\t\tstack.append(i)\r\n\r\nprint(''.join(stack))", "stack=[]\r\nstring=input()\r\n\r\nfor char in string:\r\n if stack and char==stack[-1]:\r\n stack.pop()\r\n continue\r\n stack.append(char)\r\nprint(\"\".join(stack))", "s = input()\r\nstack = []\r\nfor char in reversed(s):\r\n if stack and stack[-1] == char:\r\n stack.pop()\r\n else:\r\n stack.append(char)\r\nans = ''.join(reversed(stack))\r\nprint(ans)\r\n", "st=input()\r\ns=[]\r\nfor i in st:\r\n if len(s)==0:\r\n s.append(i)\r\n elif i==s[-1]:\r\n s.pop()\r\n else:\r\n s.append(i)\r\nfor h in s:\r\n print(h,end=\"\")", "def remove_consecutive_pairs(s):\n stack = []\n\n for char in s:\n if stack and stack[-1] == char:\n stack.pop()\n else:\n stack.append(char)\n\n return ''.join(stack)\n\ns = input()\nresult = remove_consecutive_pairs(s)\nprint(result)\n\n\t \t\t\t \t \t\t\t \t \t\t \t\t\t \t\t \t\t\t", "s = input()\r\nstack = []\r\nfor i in range(len(s)):\r\n if len(stack) != 0 and stack[-1] == s[i]:\r\n stack.pop()\r\n else:\r\n stack.append(s[i])\r\n\r\nprint(''.join(stack))", "to_be_processed=input()\n\nif len(to_be_processed)==1:\n print(to_be_processed)\nelse: \n list_of_chars=[]\n list_of_chars.append(to_be_processed[0])\n \n for i in range(1,len(to_be_processed)):\n flag=1\n while len(list_of_chars)!=0 and to_be_processed[i]==list_of_chars[-1] :\n flag=0\n list_of_chars.pop()\n if len(list_of_chars)==0 or to_be_processed[i]!=list_of_chars[-1]:\n break\n if flag:\n list_of_chars.append(to_be_processed[i])\n #print(list_of_chars)\n\n\n print(\"\".join(list_of_chars)) \n", "letters = input()\r\nlettersList = []\r\n\r\nfor x in letters:\r\n if x not in lettersList:\r\n lettersList.append(x)\r\n else:\r\n if x == lettersList[-1]:\r\n lettersList.pop()\r\n else:\r\n lettersList.append(x)\r\nprint(''.join(lettersList))", "s = input()\n\nstack = []\n\nfor char in s:\n # print(\"Comparing\", char, \"&\", stack)\n if len(stack)==0:\n stack.append(char)\n \n else:\n if(char == stack[-1]):\n stack.pop()\n else:\n stack.append(char)\n\nprint(\"\".join(stack))", "s = input()\r\nresult = [s[0]]\r\ns = s[1:]\r\nfor i in s:\r\n if len(result)>0 and i==result[-1]:\r\n result.pop(-1)\r\n else:\r\n result.append(i)\r\nresult = ''.join(result)\r\nprint(result)", "s = list(input())\r\na = []\r\n\r\nfor x in s:\r\n\tif len(a) == 0:\r\n\t\ta.append(x)\r\n\telse:\r\n\t\tif x == a[-1]:\r\n\t\t\ta.pop()\r\n\t\telse:\r\n\t\t\ta.append(x)\r\n\r\nr = \"\"\r\ndef printStack(a, r):\r\n\tfor y in a:\r\n\t\tr = r + y \r\n\treturn r\r\n\t\r\nprint(printStack(a,r))\r\n\t", "ch = input()\noutput = []\nfor c in ch:\n output.append(c)\n if len(output) >= 2 and output[-1] == output[-2]:\n output.pop()\n output.pop()\n\noutput = ''.join(output)\nprint(output)\n\n \t \t \t \t\t\t \t \t \t\t\t \t\t \t\t", "s = input()\nl = []\nfor c in s:\n if len(l) > 0 and l[-1] == c:\n del l[-1]\n else: \n l += [c]\n\nprint(*l, sep=\"\")\n", "import random, math, sys\nfrom copy import deepcopy as dc\n\ninput = sys.stdin.readline\n\n# Function to call the actual solution\ndef solution(s):\n\tstack = []\n\tfor i in list(s):\n\t\tif not stack or stack[-1][0] != i:\n\t\t\tstack.append(i)\n\t\telif stack and stack[-1] == i:\n\t\t\tstack.pop()\n\treturn stack\n\n\n\n# Function to take input\ndef input_test():\n\ts = input().strip()\n\tout = solution(s)\n\tprint(''.join(out))\n\n\n\ninput_test()\n# test()", "s = input()\r\ncheck = [True]*(len(s))\r\nans = [s[0]]\r\nfor i in range(1,len(s)) :\r\n if len(ans) > 0 and s[i] == ans[-1] :\r\n ans.pop()\r\n else :\r\n ans.append(s[i])\r\nfor i in ans :\r\n print(i,end=\"\")", "a=a=input()\r\nstack=[]\r\nfor letter in a:\r\n if stack and letter==stack[-1]:\r\n stack.pop()\r\n else:\r\n stack.append(letter)\r\nprint(''.join(stack))", "import sys\r\nimport math\r\n\r\nst = sys.stdin.readline()\r\nlst = len(st) - 1\r\n\r\nc = 0\r\nres = [st[c]]\r\n\r\nfor i in range(1, lst):\r\n if(c >= 0 and res[c] == st[i]):\r\n res.pop()\r\n c -= 1\r\n else:\r\n res.append(st[i])\r\n c += 1\r\n \r\nprint(\"\".join(res))", "from collections import deque\n\ndef plugin(s):\n # stack for characters to check\n string_stack = deque()\n\n # input string in a list\n arr_s = [c for c in s]\n\n # for each character, append to stack. if \n for c in arr_s:\n string_stack.append(c)\n if len(string_stack) > 1:\n if string_stack[-1] == string_stack[-2]:\n string_stack.pop()\n string_stack.pop()\n return ''.join(string_stack)\n\nprint(plugin(input()))", "from collections import deque\r\n\r\ndrunk_text = deque(input())\r\nproper_text = []\r\nwhile len(drunk_text) != 0:\r\n if len(proper_text) != 0 and proper_text[len(proper_text) - 1] == drunk_text[0]:\r\n proper_text.pop()\r\n drunk_text.popleft()\r\n else:\r\n proper_text.append(drunk_text.popleft())\r\nprint(''.join(proper_text))", "inp = input()\r\nfinalString = []\r\n\r\nfor letter in inp:\r\n\tif len(finalString) == 0:\r\n\t\tfinalString.append(letter)\r\n\telif letter == finalString[-1]:\r\n\t\tfinalString.pop()\r\n\telse:\r\n\t\tfinalString.append(letter)\r\n\r\nprint(*finalString, sep=\"\")", "def plugIn(string):\r\n\tmainStack = []\r\n\ti = 0\r\n\r\n\twhile i < len(string):\r\n\t\tif mainStack and string[i] == mainStack[-1]:\r\n\t\t\tmainStack.pop()\r\n\t\telse:\r\n\t\t\tmainStack.append(string[i])\r\n\t\ti += 1\r\n\r\n\treturn \"\".join(mainStack)\r\n\r\nstring = input()\r\nprint(plugIn(string))", "s = input()\r\nstk = []\r\nfor i in range(len(s)):\r\n if len(stk) == 0:\r\n stk.append(s[i])\r\n else:\r\n if s[i] == stk[len(stk)-1]:\r\n stk.pop()\r\n else:\r\n stk.append(s[i])\r\nprint(''.join(stk))" ]

[ "import os\r\nimport sys\r\nfrom io import BytesIO, IOBase\r\n\r\nBUFSIZE = 8192\r\n\r\n\r\nclass FastIO(IOBase):\r\n newlines = 0\r\n\r\n def __init__(self, file):\r\n self._fd = file.fileno()\r\n self.buffer = BytesIO()\r\n self.writable = \"x\" in file.mode or \"r\" not in file.mode\r\n self.write = self.buffer.write if self.writable else None\r\n\r\n def read(self):\r\n while True:\r\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\r\n if not b:\r\n break\r\n ptr = self.buffer.tell()\r\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\r\n self.newlines = 0\r\n return self.buffer.read()\r\n\r\n def readline(self):\r\n while self.newlines == 0:\r\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\r\n self.newlines = b.count(b\"\\n\") + (not b)\r\n ptr = self.buffer.tell()\r\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\r\n self.newlines -= 1\r\n return self.buffer.readline()\r\n\r\n def flush(self):\r\n if self.writable:\r\n os.write(self._fd, self.buffer.getvalue())\r\n self.buffer.truncate(0), self.buffer.seek(0)\r\n\r\n\r\nclass IOWrapper(IOBase):\r\n def __init__(self, file):\r\n self.buffer = FastIO(file)\r\n self.flush = self.buffer.flush\r\n self.writable = self.buffer.writable\r\n self.write = lambda s: self.buffer.write(s.encode(\"ascii\"))\r\n self.read = lambda: self.buffer.read().decode(\"ascii\")\r\n self.readline = lambda: self.buffer.readline().decode(\"ascii\")\r\n\r\n\r\nsys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)\r\ninput = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\r\nMAX = 1000001\r\nbitscount = 30\r\n\r\nprefix_count = [[0]*(10**5+1) for i in range(30)]\r\n\r\n\r\ndef findPrefixCount(arr, n):\r\n for i in range(0, bitscount):\r\n\r\n prefix_count[i][0] = ((arr[0] >> i) & 1)\r\n\r\n for j in range(1, n):\r\n prefix_count[i][j] = ((arr[j] >> i) & 1)\r\n prefix_count[i][j] += prefix_count[i][j - 1]\r\n\r\n\r\n\r\n\r\ndef rangeOr(l, r):\r\n ans = 0\r\n for i in range(bitscount):\r\n\r\n x = 0\r\n\r\n if (l == 0):\r\n x = prefix_count[i][r]\r\n else:\r\n x = prefix_count[i][r] - prefix_count[i][l - 1]\r\n\r\n # Condition for ith bit\r\n # of answer to be set\r\n if (x == r - l + 1):\r\n ans = (ans | (1 << i))\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\nn, m = map(int, input().split())\r\na = [[0] * n for i in range(30)]\r\nquery = []\r\nfor i in range(m):\r\n l, r, q = map(int, input().split())\r\n query.append([l-1, r-1, q])\r\n c = bin(q)[2:][::-1]\r\n b = []\r\n for j in c:\r\n b.append(int(j))\r\n j = 0\r\n while (j < len(b)):\r\n if b[j] == 1:\r\n a[j][l - 1] += 1\r\n if r != n:\r\n a[j][r] -= 1\r\n j += 1\r\nfor i in range(30):\r\n j = 1\r\n while (j < n):\r\n a[i][j] += a[i][j - 1]\r\n j += 1\r\n j = 0\r\n while (j < n):\r\n if a[i][j] > 0:\r\n a[i][j] = 1\r\n j += 1\r\nres=[]\r\nfor i in range(n):\r\n s = \"\"\r\n j=29\r\n while(j>=0):\r\n s += str(a[j][i])\r\n j+=-1\r\n res.append(int(s,2))\r\nfindPrefixCount(res, n)\r\nf=0\r\nfor j in query:\r\n if rangeOr(j[0],j[1])!=j[2]:\r\n f=1\r\n break\r\nif f==1:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n print(*res)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "import sys\r\ninput = sys.stdin.readline\r\nn, m = map(int, input().split())\r\nps = [[0] * (n + 2) for _ in range(30)]\r\nl, r, q, res = [0] * m, [0] * m, [0] * m, 'YES'\r\nfor i in range(m):\r\n l[i], r[i], q[i] = map(int, input().split())\r\nfor i in range(m):\r\n for j in range(30):\r\n d = (1 << j) & q[i]\r\n ps[j][l[i]] += d\r\n ps[j][r[i] + 1] -= d\r\nfor i in range(30):\r\n for j in range(2, n + 1):\r\n ps[i][j] += ps[i][j - 1]\r\nfor i in range(30):\r\n for j in range(1, n + 1):\r\n ps[i][j] = 1 if ps[i][j] >= 1 else 0\r\nfor i in range(30):\r\n for j in range(2, n + 1):\r\n ps[i][j] += ps[i][j - 1]\r\nfor i in range(m):\r\n for j in range(30):\r\n d = (1 << j) & q[i]\r\n if d == 0 and ps[j][r[i]] - ps[j][l[i] - 1] == r[i] - l[i] + 1 or \\\r\n d == 1 and ps[j][r[i]] - ps[j][l[i] - 1] < r[i] - l[i] + 1:\r\n res = 'NO'\r\n break\r\n if res == 'NO':\r\n break\r\nprint(res)\r\nif res == 'YES':\r\n arr = [0] * n\r\n for i in range(30):\r\n for j in range(n):\r\n if ps[i][j + 1] - ps[i][j]:\r\n arr[j] += 1 << i\r\n print(*arr)", "import sys\r\nreadline=sys.stdin.readline\r\n\r\nclass Dual_Segment_Tree:\r\n def __init__(self,N,f_act,e_act,operate,lst):\r\n self.N=N\r\n self.f_act=f_act\r\n self.e_act=e_act\r\n self.operate=operate\r\n self.lst=[None]*self.N\r\n for i,x in enumerate(lst):\r\n self.lst[i]=x\r\n self.segment_tree_act=[self.e_act]*(self.N+self.N)\r\n\r\n def __getitem__(self,i):\r\n if type(i) is int:\r\n if -self.N<=i<0:\r\n i+=self.N*2\r\n elif 0<=i<self.N:\r\n i+=self.N\r\n else:\r\n raise IndexError('list index out of range')\r\n self.Propagate_Above(i)\r\n return self.Operate_At(i)\r\n else:\r\n a,b,c=i.start,i.stop,i.step\r\n if a==None or a<-self.N:\r\n a=0\r\n elif self.N<=a:\r\n a=self.N\r\n elif a<0:\r\n a+=self.N\r\n if b==None or self.N<=b:\r\n b=self.N\r\n elif b<-self.N:\r\n b=0\r\n elif b<0:\r\n b+=self.N\r\n return self.lst[slice(a,b,c)]\r\n\r\n def Operate_At(self,i):\r\n return self.operate(self.lst[i-self.N],self.segment_tree_act[i])\r\n\r\n def Propagate_At(self,i):\r\n self.segment_tree_act[i<<1]=self.f_act(self.segment_tree_act[i<<1],self.segment_tree_act[i])\r\n self.segment_tree_act[i<<1|1]=self.f_act(self.segment_tree_act[i<<1|1],self.segment_tree_act[i])\r\n self.segment_tree_act[i]=self.e_act\r\n\r\n def Propagate_Above(self,i):\r\n H=i.bit_length()-1\r\n for h in range(H,0,-1):\r\n self.Propagate_At(i>>h)\r\n\r\n def Operate_Range(self,a,L=None,R=None):\r\n if L==None:\r\n L=self.N\r\n else:\r\n L+=self.N\r\n if R==None:\r\n R=self.N*2\r\n else:\r\n R+=self.N\r\n L0=L//(L&-L)\r\n R0=R//(R&-R)-1\r\n self.Propagate_Above(L0)\r\n self.Propagate_Above(R0)\r\n while L<R:\r\n if L&1:\r\n self.segment_tree_act[L]=self.f_act(self.segment_tree_act[L],a)\r\n L+=1\r\n if R&1:\r\n R-=1\r\n self.segment_tree_act[R]=self.f_act(self.segment_tree_act[R],a)\r\n L>>=1\r\n R>>=1\r\n\r\n def Update(self):\r\n for i in range(1,self.N):\r\n self.Propagate_At(i)\r\n self.segment_tree_act[i]=self.e_act\r\n\r\n def __str__(self):\r\n import copy\r\n segment_tree_act=copy.deepcopy(self.segment_tree_act)\r\n for i in range(1,self.N):\r\n segment_tree_act[i<<1]=self.f_act(segment_tree_act[i<<1],segment_tree_act[i])\r\n segment_tree_act[i<<1|1]=self.f_act(segment_tree_act[i<<1|1],segment_tree_act[i])\r\n segment_tree_act[i]=self.e_act\r\n segment_tree_act[i]=self.e_act\r\n return '['+', '.join(map(str,[self.operate(x,a) for x,a in zip(self.lst,segment_tree_act[self.N:])]))+']'\r\n\r\nclass Segment_Tree:\r\n def __init__(self,N,f,e,lst=None):\r\n self.f=f\r\n self.e=e\r\n self.N=N\r\n if lst==None:\r\n self.segment_tree=[self.e]*2*self.N\r\n else:\r\n assert len(lst)<=self.N\r\n self.segment_tree=[self.e]*self.N+[x for x in lst]+[self.e]*(N-len(lst))\r\n for i in range(self.N-1,0,-1):\r\n self.segment_tree[i]=self.f(self.segment_tree[i<<1],self.segment_tree[i<<1|1])\r\n\r\n def __getitem__(self,i):\r\n if type(i)==int:\r\n if -self.N<=i<0:\r\n return self.segment_tree[i+self.N*2]\r\n elif 0<=i<self.N:\r\n return self.segment_tree[i+self.N]\r\n else:\r\n raise IndexError('list index out of range')\r\n else:\r\n a,b,c=i.start,i.stop,i.step\r\n if a==None:\r\n a=self.N\r\n else:\r\n a+=self.N\r\n if b==None:\r\n b=self.N*2\r\n else:\r\n b+=self.N\r\n return self.segment_tree[slice(a,b,c)]\r\n\r\n def __setitem__(self,i,x):\r\n if -self.N<=i<0:\r\n i+=self.N*2\r\n elif 0<=i<self.N:\r\n i+=self.N\r\n else:\r\n raise IndexError('list index out of range')\r\n self.segment_tree[i]=x\r\n while i>1:\r\n i>>= 1\r\n self.segment_tree[i]=self.f(self.segment_tree[i<<1],self.segment_tree[i<<1|1])\r\n\r\n def Build(self,lst):\r\n for i,x in enumerate(lst,self.N):\r\n self.segment_tree[i]=x\r\n for i in range(self.N-1,0,-1):\r\n self.segment_tree[i]=self.f(self.segment_tree[i<<1],self.segment_tree[i<<1|1])\r\n\r\n def Fold(self,L=None,R=None):\r\n if L==None:\r\n L=self.N\r\n else:\r\n L+=self.N\r\n if R==None:\r\n R=self.N*2\r\n else:\r\n R+=self.N\r\n vL=self.e\r\n vR=self.e\r\n while L<R:\r\n if L&1:\r\n vL=self.f(vL,self.segment_tree[L])\r\n L+=1\r\n if R&1:\r\n R-=1\r\n vR=self.f(self.segment_tree[R],vR)\r\n L>>=1\r\n R>>=1\r\n return self.f(vL,vR)\r\n\r\n def Fold_Index(self,L=None,R=None):\r\n if L==None:\r\n L=self.N\r\n else:\r\n L+=self.N\r\n if R==None:\r\n R=self.N*2\r\n else:\r\n R+=self.N\r\n if L==R:\r\n return None\r\n x=self.Fold(L-self.N,R-self.N)\r\n while L<R:\r\n if L&1:\r\n if self.segment_tree[L]==x:\r\n i=L\r\n break\r\n L+=1\r\n if R&1:\r\n R-=1\r\n if self.segment_tree[R]==x:\r\n i=R\r\n break\r\n L>>=1\r\n R>>=1\r\n while i<self.N:\r\n if self.segment_tree[i]==self.segment_tree[i<<1]:\r\n i<<=1\r\n else:\r\n i<<=1\r\n i|=1\r\n i-=self.N\r\n return i\r\n\r\n def Bisect_Right(self,l=None,f=None):\r\n if l==self.N:\r\n return self.N\r\n if l==None:\r\n l=0\r\n if f(self.Fold(l,self.N)):\r\n return self.N\r\n l+=self.N\r\n v=self.e\r\n while True:\r\n while l%2==0:\r\n l>>=1\r\n vv=self.f(v,self.segment_tree[l])\r\n if f(vv):\r\n v=vv\r\n l+=1\r\n if 2*self.N==l<<(self.N.bit_length()-l.bit_length()+1):\r\n return self.N\r\n else:\r\n while l<self.N:\r\n l<<=1\r\n vv=self.f(v,self.segment_tree[l])\r\n if f(vv):\r\n v=vv\r\n l+=1\r\n return l-self.N\r\n\r\n def Bisect_Left(self,r=None,f=None):\r\n if r==0:\r\n return 0\r\n if r==None:\r\n r=self.N\r\n if f(self.Fold(0,r)):\r\n return 0\r\n r+=self.N\r\n v=self.e\r\n while True:\r\n r-=1\r\n while r>1 and r%2:\r\n r>>=1\r\n vv=self.f(self.segment_tree[r],v)\r\n if f(vv):\r\n v=vv\r\n if 2*self.N==r<<(self.N.bit_length()-r.bit_length()+1):\r\n return 0\r\n else:\r\n while r<self.N:\r\n r=2*r+1\r\n vv=self.f(self.segment_tree[r],v)\r\n if f(vv):\r\n v=vv\r\n r-=1\r\n return r+1-self.N\r\n\r\n def __str__(self):\r\n return '['+', '.join(map(str,self.segment_tree[self.N:]))+']'\r\n\r\nN,M=map(int,readline().split())\r\nDST=Dual_Segment_Tree(N,lambda a,b:a|b,0,lambda x,a:x|a,[0]*N)\r\nquery=[]\r\nfor _ in range(M):\r\n l,r,q=map(int,readline().split())\r\n l-=1\r\n DST.Operate_Range(q,l,r)\r\n query.append((l,r,q))\r\ne=(1<<32)-1\r\nans_lst=[DST[i] for i in range(N)]\r\nST=Segment_Tree(N,lambda x,y:x&y,e,ans_lst)\r\nfor l,r,q in query:\r\n if ST.Fold(l,r)!=q:\r\n print(\"NO\")\r\n exit()\r\nprint(\"YES\")\r\nprint(*ans_lst)", "import sys\r\ninput = lambda: sys.stdin.readline().rstrip()\r\nfrom collections import Counter\r\n\r\nclass SegTree:\r\n def __init__(self, n, arr):\r\n self.size = n\r\n self.tree = [0]*(n*2)\r\n self.build(arr)\r\n \r\n def build(self, arr):\r\n for i in range(self.size):\r\n self.tree[self.size+i] = arr[i]\r\n for i in range(self.size-1,0,-1):\r\n self.tree[i] = self.tree[i<<1]&self.tree[i<<1|1]\r\n \r\n def update(self,p,v):\r\n self.tree[p+self.size] = v\r\n p+=self.size\r\n \r\n i = p\r\n while i>1:\r\n self.tree[i>>1] = self.tree[i] & self.tree[i^1]\r\n i>>=1\r\n \r\n # 不包含r\r\n def query(self,l,r):\r\n l += self.size\r\n r += self.size\r\n ans = self.tree[l]\r\n \r\n while l<r:\r\n if 1&l:\r\n ans &= self.tree[l]\r\n l+=1\r\n if r&1:\r\n r-=1\r\n ans &= self.tree[r]\r\n \r\n l>>=1\r\n r>>=1\r\n return ans\r\n\r\nN,M = map(int, input().split())\r\n\r\nQ = []\r\nA = []\r\nfor _ in range(M):\r\n l,r,q = map(int, input().split())\r\n l-=1;r-=1\r\n Q.append((l,r,q))\r\n A.append((l,q,1))\r\n A.append((r+1,q,-1))\r\nA.sort(reverse=True)\r\n\r\n#print(A)\r\nans,cur = [0]*N,0\r\ncnt = [0]*30\r\nfor i in range(N):\r\n while A and A[-1][0]==i:\r\n j,c,t = A.pop()\r\n for k in range(30):\r\n if c&(1<<k):\r\n cnt[k]+=t\r\n for k in range(30):\r\n if cnt[k]>0:\r\n ans[i]+=1<<k\r\n#print(ans)\r\nseg = SegTree(N,ans)\r\n\r\nfor l,r,q in Q:\r\n #print(seg.query(l,r+1),q)\r\n if seg.query(l,r+1)!=q:\r\n exit(print('NO'))\r\n\r\nprint('YES')\r\nprint(*ans)\r\n\r\n ", "import sys\r\ninput = lambda: sys.stdin.readline().rstrip()\r\nfrom collections import deque,defaultdict,Counter\r\nfrom itertools import permutations,combinations\r\nfrom bisect import *\r\nfrom heapq import *\r\nfrom math import ceil,gcd,lcm,floor,comb\r\nalph = 'abcdefghijklmnopqrstuvwxyz'\r\n#pow(x,mod-2,mod)\r\n\r\nN,M = map(int,input().split())\r\nP,h = [],[[] for _ in range(N)]\r\nfor _ in range(M):\r\n l,r,q = map(int,input().split())\r\n P.append([l,r,q])\r\n h[l-1].append(q)\r\n if r<N:h[r].append(-q)\r\nP.sort()\r\n\r\ncnt = [[0]*31 for _ in range(N)]\r\nans = []\r\nl = [0]*30\r\nfor x in range(N):\r\n for i in h[x]:\r\n for j in range(30):\r\n if abs(i)&2**j:\r\n if i<0:l[j]-=1\r\n else:l[j]+=1\r\n\r\n num = 0\r\n for i in range(30):\r\n if l[i]>=1:\r\n num+=2**i\r\n cnt[x][i]+=1+cnt[x-1][i]\r\n\r\n ans.append(num)\r\n\r\n# for i in cnt:print(*i)\r\n# print(ans)\r\n\r\ncheck = True\r\nfor l,r,q in P:\r\n numi = 0\r\n for i in range(30):\r\n num = cnt[r-1][i]\r\n if l-2>=0:num-=cnt[l-2][i]\r\n if num==r-l+1:numi+=2**i\r\n if numi!=q:\r\n check = False\r\n break\r\n\r\nif check==True:\r\n print(\"YES\")\r\n print(*ans)\r\nelse:\r\n print(\"NO\")\r\n\r\n", "from sys import stdin\r\ninput=stdin.readline\r\ndef funcand(a,b):\r\n\treturn a&b\r\nclass SegmentTree:\r\n\tdef __init__(self, data, default=(1<<31)-1, func=max):\r\n\t\t\"\"\"initialize the segment tree with data\"\"\"\r\n\t\tself._default = default\r\n\t\tself._func = func\r\n\t\tself._len = len(data)\r\n\t\tself._size = _size = 1 << (self._len - 1).bit_length()\r\n\r\n\t\tself.data = [default] * (2 * _size)\r\n\t\tself.data[_size:_size + self._len] = data\r\n\t\tfor i in reversed(range(_size)):\r\n\t\t\tself.data[i] = func(self.data[i + i], self.data[i + i + 1])\r\n\r\n\tdef __delitem__(self, idx):\r\n\t\tself[idx] = self._default\r\n\r\n\tdef __getitem__(self, idx):\r\n\t\treturn self.data[idx + self._size]\r\n\r\n\tdef __setitem__(self, idx, value):\r\n\t\tidx += self._size\r\n\t\tself.data[idx] = value\r\n\t\tidx >>= 1\r\n\t\twhile idx:\r\n\t\t\tself.data[idx] = self._func(self.data[2 * idx], self.data[2 * idx + 1])\r\n\t\t\tidx >>= 1\r\n\r\n\tdef __len__(self):\r\n\t\treturn self._len\r\n\r\n\tdef query(self, start, stop):\r\n\t\t\"\"\"func of data[start, stop)\"\"\"\r\n\t\tstart += self._size\r\n\t\tstop += self._size\r\n\r\n\t\tres_left = res_right = self._default\r\n\t\twhile start < stop:\r\n\t\t\tif start & 1:\r\n\t\t\t\tres_left = self._func(res_left, self.data[start])\r\n\t\t\t\tstart += 1\r\n\t\t\tif stop & 1:\r\n\t\t\t\tstop -= 1\r\n\t\t\t\tres_right = self._func(self.data[stop], res_right)\r\n\t\t\tstart >>= 1\r\n\t\t\tstop >>= 1\r\n\t\treturn self._func(res_left, res_right)\r\ndef f(n,q):\r\n\ta=[0]*(n)\r\n\tfor bit in range(30):\r\n\t\ts=[0]*(n+1)\r\n\t\tfor l,r,nm in q:\r\n\t\t\tif((nm>>bit)&1):\r\n\t\t\t\ts[l]+=1\r\n\t\t\t\ts[r]-=1\r\n\t\tfor i in range(n):\r\n\t\t\tif i>0:\r\n\t\t\t\ts[i]+=s[i-1] # bich ke bhar raha hai\r\n\t\t\tif s[i]>0:\r\n\t\t\t\ta[i]|=(1<<bit)\r\n\tst=SegmentTree(a,func=funcand,default=(1<<31)-1)\r\n\tfor l,r,nm in q:\r\n\r\n\t\t# print(st.query(l,r))\r\n\t\tif st.query(l,r)!=nm:\r\n\t\t\treturn \"NO\"\r\n\tprint(\"YES\")\r\n\tprint(*a)\r\n\treturn ''\r\n\r\nq=[]\r\nn,m=map(int,input().strip().split())\r\nfor _ in range(m):\r\n\tl,r,nm=map(int,input().strip().split())\r\n\tq.append((l-1,r,nm))\r\n\r\nprint(f(n,q))" ]

[ "# In the name of Allah\r\n\r\ndef main() :\r\n\r\n n = int(input())\r\n x1, y1, x2, y2 = map(int, input().split())\r\n\r\n st = [0]\r\n ed = [1e11]\r\n\r\n if x1 == x2 or y1 == y2 :\r\n print(-1)\r\n exit()\r\n for i in range(n) :\r\n a, b, c, d = map(int, input().split())\r\n for x, v, s, e in ((a, c, x1, x2), (b, d, y1, y2)) :\r\n if v == 0 :\r\n if not(s < x < e) :\r\n print(-1)\r\n exit()\r\n else :\r\n t1 = (s - x) / v;\r\n t2 = (e - x) / v;\r\n st += [min(t1, t2)]\r\n ed += [max(t1, t2)]\r\n\r\n if max(st) < min(ed) and min(ed) > 0 :\r\n print(max(max(st), 0))\r\n else :\r\n print(-1)\r\n\r\n return 0\r\n\r\nmain()\r\n\r\n\r\n", "def comp( x , v , l , r ) : \r\n if x < l and v <= 0 :\r\n return [-1,-10]\r\n if x > r and v >= 0 :\r\n return [-1,-10]\r\n if x >= l and x <= r :\r\n if v == 0 :\r\n if x == l or x == r :\r\n return [-1,-10]\r\n else :\r\n return [0,10**18]\r\n if v > 0 :\r\n s = 0 \r\n e = (r-x)/v\r\n return [s,e]\r\n if v < 0 :\r\n s = 0 \r\n e = ( x - l )/(-v)\r\n return [s,e]\r\n if x < l :\r\n s = (l-x)/v\r\n e = (r-x)/v\r\n return [s,e]\r\n if x > r :\r\n s = (x-r)/(-v)\r\n e = (x-l)/(-v)\r\n return [s,e]\r\n print(x,v,l,r)\r\nn = int(input())\r\nx1 , y1 , x2 , y2 = map( int , input().split() )\r\nlo = 0.000000001\r\nhi = 10**18\r\nfor i in range( n ) :\r\n x , y , vx , vy = map( int , input().split() )\r\n l1 = comp( x , vx , x1 , x2 ) \r\n l2 = comp( y , vy , y1 , y2 )\r\n lo = max( lo , l1[0] , l2[0] )\r\n hi = min( hi , l1[1] , l2[1] )\r\nif lo < hi :\r\n print(lo)\r\nelse:\r\n print(-1)\r\n \r\n \r\n", "\r\n# t*v+a = b\r\n# t=(b-a)/v\r\n\r\nimport sys\r\n#sys.stdin=open(\"data.txt\")\r\ninput=sys.stdin.readline\r\n\r\nmintime=(0,1)\r\nmaxtime=(10**9,1)\r\nuseless=0\r\n\r\nn=int(input())\r\n\r\n#include <math.h>\r\n# int 'y1' redeclared as different kind of symbol\r\nx1,y1,x2,y2=map(int,input().split())\r\n\r\nfor _ in range(n):\r\n rx,ry,vx,vy=map(int,input().split())\r\n # x time\r\n if vx==0:\r\n if not x1<rx<x2:\r\n useless=1\r\n break\r\n else:\r\n t1=(x1-rx,vx)\r\n t2=(x2-rx,vx)\r\n if vx<0:\r\n t1=(-t1[0],-t1[1])\r\n t2=(-t2[0],-t2[1])\r\n # t11/t12 > t21/t22\r\n if t1[0]*t2[1]>t1[1]*t2[0]:\r\n t1,t2=t2,t1\r\n if mintime[0]*t1[1]<mintime[1]*t1[0]:\r\n mintime=t1\r\n if maxtime[0]*t2[1]>maxtime[1]*t2[0]:\r\n maxtime=t2\r\n # y time\r\n if vy==0:\r\n if not y1<ry<y2:\r\n useless=1\r\n break\r\n else:\r\n t1=(y1-ry,vy)\r\n t2=(y2-ry,vy)\r\n if vy<0:\r\n t1=(-t1[0],-t1[1])\r\n t2=(-t2[0],-t2[1])\r\n # t11/t12 > t21/t22\r\n if t1[0]*t2[1]>t1[1]*t2[0]:\r\n t1,t2=t2,t1\r\n if mintime[0]*t1[1]<mintime[1]*t1[0]:\r\n mintime=t1\r\n if maxtime[0]*t2[1]>maxtime[1]*t2[0]:\r\n maxtime=t2\r\n\r\nif useless or mintime[0]*maxtime[1]>=maxtime[0]*mintime[1]:\r\n print(-1)\r\nelse:\r\n print(mintime[0]/float(mintime[1]))" ]

[ "n,m = [int(x) for x in input().split()]\r\na = [int(x)-1 for x in input().split()]\r\nassert len(a) == m\r\n\r\ntot = 0\r\nfor i in range(m-1):\r\n tot += abs(a[i+1]-a[i])\r\n\r\narr = [[] for i in range(n)]\r\n\r\nfor i in range(m-1):\r\n if a[i] == a[i+1]: continue\r\n arr[a[i]].append(a[i+1])\r\n arr[a[i+1]].append(a[i])\r\n\r\ncursum = []\r\nfor i in range(n):\r\n cur = 0\r\n for e in arr[i]:\r\n cur += abs(e-i)\r\n cursum.append(cur)\r\nassert sum(cursum) == 2*tot\r\n\r\nminsum = [0 for i in range(n)]\r\nfor i in range(n):\r\n if len(arr[i]) == 0: continue\r\n arr[i].sort()\r\n med = arr[i][len(arr[i])//2]\r\n cur = 0\r\n for e in arr[i]:\r\n cur += abs(e-med)\r\n minsum[i] = cur\r\n\r\nfor i in range(n):\r\n assert minsum[i] <= cursum[i]\r\n\r\ndif = [cursum[i]-minsum[i] for i in range(n)]\r\nmaxdif = max(dif)\r\n\r\nout = tot - maxdif\r\nprint(out)\r\n", "n, m = map(int, input().split())\ns, p = 0, [[] for i in range(n + 1)]\nt = list(map(int, input().split()))\nfor i in range(m - 1):\n if t[i] != t[i + 1]:\n p[t[i + 1]].append(t[i])\n p[t[i]].append(t[i + 1])\nfor i, q in enumerate(p):\n if q:\n q.sort()\n k = q[len(q) // 2]\n d = sum(abs(i - j) - abs(k - j) for j in q)\n if d > s: s = d\nprint(sum(abs(t[i + 1] - t[i]) for i in range(m - 1)) - s)\n \t\t\t\t\t\t \t\t\t \t \t\t\t \t\t \t \t\t \t", "n, m = map(int, input().split())\r\narr = list(map(int, input().split()))\r\nprice = sum(abs(a - b) for a, b in zip(arr, arr[1:]))\r\n\r\nfrom collections import defaultdict\r\nadj = defaultdict(list)\r\nfor a,b in zip(arr, arr[1:]):\r\n if a != b:\r\n adj[a].append(b)\r\n adj[b].append(a)\r\n\r\ndef median(xs): \r\n return sorted(xs)[len(xs)//2]\r\n\r\nres = 0\r\nfor i, xs in adj.items():\r\n m = median(xs)\r\n a = sum(abs(i - x) for x in xs)\r\n b = sum(abs(m - x) for x in xs)\r\n res = max(res, a - b)\r\nprint(price - res)\r\n", "input()\na = input().split()\na = [int(x) for x in a]\n\nneighbours = dict()\nfor x in a:\n neighbours[x] = []\n\ncost = 0\n\nfor i in range(len(a) - 1):\n if a[i] != a[i+1]:\n neighbours[a[i]].append(a[i+1])\n neighbours[a[i+1]].append(a[i])\n\n cost += abs(a[i] - a[i+1])\n\ndef cost_by(ar, v):\n return sum([abs(v - x) for x in ar] + [0])\n\ndef max_save(ar, v):\n if len(ar) == 0:\n return 0\n\n default = cost_by(ar, v)\n\n ar = sorted(ar)\n best_v = ar[int(len(ar)/2)]\n return default - cost_by(ar, best_v)\n\nmax_save = max([max_save(neighbours[x], x) for x in neighbours.keys()] + [0])\nprint(cost - max_save)\n\n\n" ]

[ "t, q = {}, [25, 18, 15, 12, 10, 8, 6, 4, 2, 1]\r\nfor i in range(int(input())):\r\n for j in range(int(input())):\r\n p = input()\r\n if not p in t: t[p] = [0] * 52\r\n if j < 10: t[p][0] += q[j]\r\n t[p][j + 1] += 1\r\nprint(max(t.items(), key = lambda x: x[1])[0])\r\nfor p in t: t[p][1], t[p][0] = t[p][0], t[p][1]\r\nprint(max(t.items(), key = lambda x: x[1])[0])", "d={}\r\np=[25,18,15,12,10,8,6,4,2,1]+[0]*40\r\nfor _ in range(int(input())):\r\n for x in range((int(input()))):\r\n s=input()\r\n if s in d:\r\n d[s][0]+=p[x]\r\n d[s][x+1]+=1\r\n else:\r\n d[s]=[p[x]]+[0]*50+[s]\r\n d[s][x+1]+=1\r\nprint(max(list(d.values()))[-1])\r\nc=[]\r\nfor x in d.values():\r\n c.append([x[1]]+[x[0]]+x[2:])\r\nprint(max(c)[-1])", "t=int(input());\r\ngiven=[25,18,15,12,10,8,6,4,2,1];\r\npoints={};\r\nnames=set([]);\r\norders=[{} for x in range (50)];\r\n\r\nfor _ in range(t):\r\n n=int(input());\r\n for i in range(n):\r\n name=input();\r\n names.add(name);\r\n if i<10:\r\n if name in points:\r\n points[name]+=given[i];\r\n else:\r\n points[name]=given[i];\r\n if name in orders[i]:\r\n orders[i][name]+=1;\r\n else:\r\n orders[i][name]=1;\r\n\r\nfor name in names:\r\n if name not in points:\r\n points[name]=0;\r\n for i in range(50):\r\n if name not in orders[i]:\r\n orders[i][name]=0;\r\n\r\nhighest=[];\r\nbest=[];\r\nmaxorder=-100;\r\nmaxpoint=-100;\r\nfor name in names:\r\n if points[name]>maxpoint:\r\n highest.clear();\r\n highest.append(name);\r\n maxpoint=points[name];\r\n elif points[name]==maxpoint:\r\n highest.append(name);\r\n\r\n if orders[0][name]>maxorder:\r\n best.clear();\r\n best.append(name);\r\n maxorder=orders[0][name];\r\n elif orders[0][name]==maxorder:\r\n best.append(name);\r\n\r\nif len(highest)==1:\r\n print(highest[0]);\r\nelse:\r\n i=0;\r\n while 1:\r\n ans=[];\r\n maxorder=-100;\r\n for name in highest:\r\n if orders[i][name]>maxorder:\r\n ans.clear();\r\n ans.append(name);\r\n maxorder=orders[i][name];\r\n elif orders[i][name]==maxorder:\r\n ans.append(name);\r\n if len(ans)==1:\r\n break;\r\n highest[:]=ans[:];\r\n i+=1;\r\n print(ans[0]);\r\n \r\nif len(best)==1:\r\n print(best[0]);\r\nelse:\r\n ans=[];\r\n maxpoint=-100;\r\n for name in best:\r\n if points[name]>maxpoint:\r\n ans.clear();\r\n ans.append(name);\r\n maxpoint=points[name];\r\n elif points[name]==maxpoint:\r\n ans.append(name);\r\n if len(ans)==1:\r\n print(ans[0]);\r\n else:\r\n best[:]=ans[:];\r\n i=1;\r\n while 1:\r\n ans=[];\r\n maxorder=-100;\r\n for name in best:\r\n if orders[i][name]>maxorder:\r\n ans.clear();\r\n ans.append(name);\r\n maxorder=orders[i][name];\r\n elif orders[i][name]==maxorder:\r\n ans.append(name);\r\n if len(ans)==1:\r\n break;\r\n best[:]=ans[:];\r\n i+=1;\r\n print(ans[0]);\r\n \r\n \r\n\r\n", "def total_score(ranks):\r\n rank_score = [25, 18, 15, 12, 10, 8, 6, 4, 2, 1]\r\n return sum([ranks[i] * rank_score[i] for i in range(min(10, len(ranks)))])\r\n\r\n\r\ndef main():\r\n t = int(input())\r\n result_hist = {}\r\n for _ in range(t):\r\n n = int(input())\r\n for i in range(n):\r\n racer = input()\r\n if racer not in result_hist:\r\n result_hist[racer] = [0 for _ in range(50)]\r\n result_hist[racer][i] += 1\r\n\r\n rankings = []\r\n for racer, result in result_hist.items():\r\n racer_score = total_score(result)\r\n rankings.append([racer_score] + result + [racer])\r\n\r\n rankings.sort(reverse=True)\r\n print(rankings[0][-1])\r\n\r\n for ranking in rankings:\r\n ranking[0], ranking[1] = ranking[1], ranking[0]\r\n rankings.sort(reverse=True)\r\n print(rankings[0][-1])\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "N=int(input())\r\n# S={\"name\":[0,0,0,......],}\r\nsoc=[25,18,15,12,10,8,6,4,2,1,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,0,0,0,0,0,0,0,0,0,0]\r\nS={}\r\nfor i in range(N):\r\n\tn=int(input())\r\n\tfor y in range(n):\r\n\t\t\ts=input()\r\n\t\t\tif s in S:\r\n\t\t\t\tS[s][0]+=soc[y]\r\n\t\t\t\tS[s][y+1]+=1\r\n\t\t\telse:\r\n\t\t\t\tS[s]=[soc[y],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,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0]\r\n\t\t\t\tS[s][y+1]+=1\r\n###A\r\nres=[0]\r\nmaxx=0\r\nfor i in S:\r\n\tif S[i][0]>maxx:\r\n\t\tres=[0]\r\n\t\tmaxx=S[i][0]\r\n\t\tres[0]=i\r\n\telif S[i][0]==maxx:\r\n\t\tres.append(i)\r\nif len(res)>1:\r\n\tfor i in range(1,50):\r\n\t\tM=[0]\r\n\t\tmaxx=0\r\n\t\tfor y in res:\r\n\t\t\tt=S[y][i]\r\n\t\t\tif t>maxx:\r\n\t\t\t\tM=[0]\r\n\t\t\t\tmaxx=t\r\n\t\t\t\tM[0]=y\r\n\t\t\telif t==maxx and t!=0:\r\n\t\t\t\tM.append(y)\r\n\r\n\t\tif len(M)==1 and maxx!=0:\r\n\t\t\t\tprint(M[0])\r\n\t\t\t\tbreak\r\n\t\telif maxx==0:\r\n\t\t\tNone\r\n\t\telse:\r\n\t\t\t\tres=M\r\nelse:\r\n\tprint(res[0])\r\n###B\r\n\r\nres=[0]\r\nmaxx=0\r\nfor X in S:\r\n\tt=S[X][1]\r\n\tif t>maxx:\r\n\t\tres=[0]\r\n\t\tmaxx=t\r\n\t\tres[0]=X\r\n\telif t==maxx and t!=0:\r\n\t\tres.append(X)\r\nif len(res)>1:\r\n\tres1=[0]\r\n\tmaxx=0\r\n\tfor i in res:\r\n\t\tif S[i][0]>maxx:\r\n\t\t\tres1=[0]\r\n\t\t\tmaxx=S[i][0]\r\n\t\t\tres1[0]=i\r\n\t\telif S[i][0]==maxx:\r\n\t\t\tres1.append(i)\r\n\tif len(res1)>1:\r\n\t\tfor i in range(2,50):\r\n\t\t\tM=[0]\r\n\t\t\tmaxx=0\r\n\t\t\tfor y in res1:\r\n\t\t\t\tt=S[y][i]\r\n\t\t\t\tif t>maxx:\r\n\t\t\t\t\tM=[0]\r\n\t\t\t\t\tmaxx=t\r\n\t\t\t\t\tM[0]=y\r\n\t\t\t\telif t==maxx and t!=0:\r\n\t\t\t\t\tM.append(y)\r\n\t\t\tif len(M)==1 and maxx!=0:\r\n\t\t\t\t\tprint(M[0])\r\n\t\t\t\t\tbreak\r\n\t\t\telif maxx==0:\r\n\t\t\t\tNone\r\n\t\t\telse:\r\n\t\t\t\tres1=M\r\n\telse:\r\n\t\tprint(res1[0])\r\nelse:\r\n\tprint(res[0])", "import functools\n\n\nclass driver:\n def __init__(self):\n self.points = 0\n self.poss = {}\n\n\ndef cmp_orig(driver_one, driver_two):\n dr_one_res = driver_one[1]\n dr_two_res = driver_two[1]\n if dr_one_res.points != dr_two_res.points:\n if dr_one_res.points < dr_two_res.points:\n return -1\n else:\n return 1\n for i in range(max(list(dr_one_res.poss.keys()) + \\\n list(dr_two_res.poss.keys()) + [0]) + 1):\n if i not in dr_one_res.poss and i not in dr_two_res.poss:\n continue\n elif i in dr_one_res.poss and i not in dr_two_res.poss:\n return 1\n elif i not in dr_one_res.poss and i in dr_two_res.poss:\n return -1\n else:\n if dr_one_res.poss[i] != dr_two_res.poss[i]:\n if dr_one_res.poss[i] < dr_two_res.poss[i]:\n return -1\n else:\n return 1\n return 0\n\n\ndef cmp_new(driver_one, driver_two):\n dr_one_res = driver_one[1]\n dr_two_res = driver_two[1]\n if 1 in dr_one_res.poss and 1 not in dr_two_res.poss:\n return 1\n if 1 not in dr_one_res.poss and 1 in dr_two_res.poss:\n return -1\n if 1 in dr_one_res.poss and 1 in dr_two_res.poss:\n if dr_one_res.poss[1] != dr_two_res.poss[1]:\n if dr_one_res.poss[1] < dr_two_res.poss[1]:\n return -1\n else:\n return 1\n if dr_one_res.points != dr_two_res.points:\n return dr_one_res.points < dr_two_res.points\n for i in range(max(list(dr_one_res.poss.keys()) + \\\n list(dr_two_res.poss.keys()) + [0]) + 1):\n if i not in dr_one_res.poss and i not in dr_two_res.poss:\n continue\n elif i in dr_one_res.poss and i not in dr_two_res.poss:\n return 1\n elif i not in dr_one_res.poss and i in dr_two_res.poss:\n return -1\n else:\n if dr_one_res.poss[i] != dr_two_res.poss[i]:\n if dr_one_res.poss[i] < dr_two_res.poss[i]:\n return -1\n else:\n return 1\n return 0\n\n\npos_to_points = {\n 1: 25,\n 2: 18,\n 3: 15,\n 4: 12,\n 5: 10,\n 6: 8,\n 7: 6,\n 8: 4,\n 9: 2,\n 10: 1\n}\n\n\ndrivers = {}\n\n\nt = int(input())\n\nfor _ in range(t):\n n = int(input())\n for i in range(1, n + 1):\n some_driver = input()\n if some_driver not in drivers:\n drivers[some_driver] = driver()\n if i in pos_to_points:\n drivers[some_driver].points += pos_to_points[i]\n if i in drivers[some_driver].poss:\n drivers[some_driver].poss[i] += 1\n else:\n drivers[some_driver].poss[i] = 1\n\ndrivers_list = list(drivers.items())\n#print(drivers_list)\ndrivers_list = sorted(drivers_list, key=functools.cmp_to_key(cmp_orig))\n#print(drivers_list)\nprint(drivers_list[-1][0])\ndrivers_list = sorted(drivers_list, key=functools.cmp_to_key(cmp_new))\n#print(drivers_list)\nprint(drivers_list[-1][0])\n\n\n# TERRIBLE CODE !!\n\n\n", "def count(s, pos):\r\n ret = 0\r\n for sublist in res:\r\n if len(sublist) > pos and sublist[pos] == s:\r\n ret += 1\r\n return ret\r\ndef best(stan, remains):\r\n if len(remains) == 1:\r\n return remains[0]\r\n p = [0] * len(remains)\r\n if stan == -1 or stan == 1:\r\n for j in range(len(remains)):\r\n for i in range(10):\r\n p[j] += count(remains[j], i) * pts[i]\r\n else:\r\n for j in range(len(remains)):\r\n p[j] = count(remains[j], 0 if stan == 0 else stan - 1)\r\n m = max(p)\r\n nr = []\r\n for j in range(len(p)):\r\n if p[j] == m:\r\n nr.append(remains[j])\r\n return best(stan + 1, nr)\r\nres = []\r\npts = [25, 18, 15, 12, 10, 8, 6, 4, 2, 1]\r\ndrivers = set()\r\nn = int(input())\r\nfor i in range(n):\r\n m = int(input())\r\n res.append([])\r\n for j in range(m):\r\n c = input().strip()\r\n res[-1].append(c)\r\n drivers.add(c)\r\nprint(best(-1, list(drivers)))\r\nprint(best(0, list(drivers)))# 1698328642.66864", "d = {}\r\np= [25, 18, 15, 12, 10, 8, 6, 4, 2, 1] + [0] * 40\r\nfor _ in range(int(input())):\r\n for x in range((int(input()))):\r\n s = input()\r\n if s in d:\r\n d[s][0] += p[x]\r\n d[s][x+1] += 1\r\n else:\r\n d[s] = [p[x]] + [0] * 50 + [s]\r\n d[s][x+1] += 1\r\nprint(max(list(d.values()))[-1])\r\nc = []\r\nfor x in d.values():\r\n c.append([x[1]] + [x[0]] + x[2:])\r\nprint(max(c)[-1])", "a=[25, 18, 15, 12, 10, 8, 6, 4, 2, 1]\r\nb={}\r\nn=int(input())\r\nfor i in range(n):\r\n k=int(input())\r\n for j in range(k):\r\n s=input()\r\n if not(s in b):\r\n b[s]=[0]*51+[s]\r\n b[s][j+1]+=1\r\n if j<10: b[s][0]+=a[j]\r\nc=b.values()\r\nprint(sorted(c)[-1][-1])\r\nd=[]\r\nfor z in c:\r\n d.append([z[1]]+z)\r\nprint(sorted(d)[-1][-1]) \r\n", "D,points = {},[25, 18, 15, 12, 10, 8, 6, 4, 2, 1]+[0]*50\r\nfor tour in range(int(input())):\r\n\tfor j in range(int(input())):\r\n\t\tplayer =str(input())\r\n\t\tif player not in D:\r\n\t\t\tD[player] = [0]*51+[player]\r\n\t\tD[player][0] += points[j]\r\n\t\tD[player][j+1] += 1\r\nwin = D.values()\r\nprint(sorted(win)[-1][-1])\r\nwin= [[p[1]]+p for p in win]\r\nprint(sorted(win)[-1][-1])\r\n", "import sys\n\nht = {}\nr = [[0 for i in range(50)] for j in range(50)]\n\nt = int(sys.stdin.readline().strip())\nfor i in range(t):\n n = int(sys.stdin.readline().strip())\n for j in range(n):\n name = sys.stdin.readline().strip()\n if name not in ht:\n ht[name] = len(ht)\n r[ht[name]][j] += 1\n\n\nd1, d2 = [], []\npt = [25, 18, 15, 12, 10, 8, 6, 4, 2, 1]\nfor name in ht:\n r_ = r[ht[name]]\n sc = 0\n for i in range(len(pt)):\n sc += r_[i] * pt[i]\n d1.append((name, [sc] + r_))\n d2.append((name, r_[:1] + [sc] + r_[1:]))\n\nd1 = sorted(d1, key=lambda data: data[1], reverse=True)\nd2 = sorted(d2, key=lambda data: data[1], reverse=True)\n\nprint(d1[0][0])\nprint(d2[0][0])\n\n", "import sys; R = sys.stdin.readline\r\nS = lambda: map(int,R().split())\r\n\r\nd = {}\r\nt = [25,18,15,12,10,8,6,4,2,1]+[0]*40\r\nfor _ in range(int(R())):\r\n for i in range(int(R())):\r\n s = R().rstrip()\r\n if s not in d: d[s] = [0]*51\r\n d[s][0] += t[i]; d[s][i+1] += 1\r\nprint(max(d,key=lambda x:d[x]))\r\nfor x in d: d[x][0],d[x][1] = d[x][1],d[x][0]\r\nprint(max(d,key=lambda x:d[x]))", "champion_data,points = {},[25, 18, 15, 12, 10, 8, 6, 4, 2, 1]+[0]*50\r\nfor tour in range(int(input())):\r\n\tfor j in range(int(input())):\r\n\t\tplayer =str(input())\r\n\t\tif player not in champion_data:\r\n\t\t\tchampion_data[player] = [0]*51+[player]\r\n\t\tchampion_data[player][0] += points[j]\r\n\t\tchampion_data[player][j+1] += 1\r\nwin = champion_data.values()\r\nprint(sorted(win)[-1][-1])\r\nwin= [[p[1]]+p for p in win]\r\nprint(sorted(win)[-1][-1])\r\n", "from copy import deepcopy\r\nfrom operator import itemgetter\r\n\r\nt=int(input())\r\nD=dict()\r\nP=[25,18,15,12,10,8,6,4,2,1]+[0]*50\r\n\r\nfor tests in range(t):\r\n n=int(input())\r\n\r\n for i in range(n):\r\n S=input()\r\n\r\n if S in D:\r\n D[S][0]+=P[i]\r\n D[S][1][i]+=1\r\n else:\r\n D[S]=[P[i],[0]*50]\r\n D[S][1][i]+=1\r\n\r\nX=[]\r\nfor S in D:\r\n X.append(D[S]+[S])\r\n \r\nY=deepcopy(X)\r\n\r\nX.sort(key=itemgetter(0),reverse=True)\r\n\r\nwhile len(X)>=2 and X[-1][0]<X[0][0]:\r\n X.pop()\r\n\r\n#print(X)\r\n\r\ni=0\r\nwhile len(X)>=2:\r\n X.sort(key=lambda x:x[1][i],reverse=True)\r\n\r\n while len(X)>=2 and X[-1][1][i]<X[0][1][i]:\r\n X.pop()\r\n i+=1\r\n\r\nprint(X[0][-1])\r\n\r\n\r\nX=Y\r\n\r\n#print(X)\r\ni=0\r\nX.sort(key=lambda x:x[1][i],reverse=True)\r\n\r\n#print(X)\r\n\r\nwhile len(X)>=2 and X[-1][1][i]<X[0][1][i]:\r\n X.pop()\r\ni+=1\r\n\r\nX.sort(key=itemgetter(0),reverse=True)\r\n\r\nwhile len(X)>=2 and X[-1][0]<X[0][0]:\r\n X.pop()\r\n\r\ni=1\r\nwhile len(X)>=2:\r\n X.sort(key=lambda x:x[1][i],reverse=True)\r\n\r\n while len(X)>=2 and X[-1][1][i]<X[0][1][i]:\r\n X.pop()\r\n i+=1\r\n\r\nprint(X[0][-1])\r\n", "points = [25, 18, 15, 12, 10, 8, 6, 4, 2, 1] + [0] * 40\r\nnumRaces = int(input())\r\nscores = {}\r\n\r\nfor race in range(numRaces):\r\n numDrivers = int(input())\r\n for d in range(numDrivers):\r\n driver = input()\r\n if not driver in scores:\r\n scores[driver] = [0] + [0] * 50 + [driver]\r\n scores[driver][0] += points[d]\r\n scores[driver][d + 1] += 1\r\n\r\ns = scores.values()\r\nprint(sorted(s)[-1][-1])\r\ns = [[x[1], x[0]] + x[2:] for x in s]\r\nprint(sorted(s)[-1][-1])" ]

[ "n = int(input())\r\na = [int(x) for x in input().split()]\r\nD = {}\r\nfor x in a:\r\n if x in D:\r\n D[x] += 1\r\n else:\r\n D[x] = 1\r\nmaxans = 0\r\ndef check(x, y):\r\n num = 2\r\n D[x] -= 1\r\n D[y] -= 1\r\n while x+y in D and D[x+y] > 0:\r\n D[x+y] -= 1\r\n x, y = y, x+y\r\n num += 1\r\n ans = num\r\n while num > 2:\r\n D[y] += 1\r\n x, y = y-x, x\r\n num -= 1\r\n D[x] += 1\r\n D[y] += 1\r\n return ans\r\n\r\nfor x in D:\r\n for y in D:\r\n if x == y and D[x] == 1: continue\r\n maxans = max(check(x, y), maxans)\r\n\r\nprint(maxans)\r\n", "import sys\r\n\r\n\r\nclass dict_(dict):\r\n def __missing__(self, key):\r\n return 0\r\n\r\n\r\ndef solve(x, y):\r\n memf, tem = dict_(), 2\r\n memf[a[i]] += 1\r\n memf[a[j]] += 1\r\n\r\n while -10 ** 9 <= y <= 10 ** 9:\r\n x, y = y, x + y\r\n if memf[y] == mem[y]:\r\n break\r\n tem += 1\r\n memf[y] += 1\r\n return tem\r\n\r\n\r\ninput = lambda: sys.stdin.buffer.readline().decode().strip()\r\nn, a, mem = int(input()), [int(x) for x in input().split()], dict_()\r\nfor i in a:\r\n mem[i] += 1\r\n\r\nans = mem[0]\r\nfor i in range(n):\r\n for j in range(i + 1, n):\r\n if not (a[i] == a[j] == 0):\r\n ans = max(ans, solve(a[i], a[j]), solve(a[j], a[i]))\r\n\r\nprint(ans)\r\n", "from collections import Counter\r\n\r\nn = int(input())\r\ns = Counter(map(int, input().split()))\r\nn = 0\r\n\r\nfor q in s:\r\n s[q] -= 1\r\n\r\n for a in s:\r\n if s[a]:\r\n t = [a]\r\n s[a] -= 1\r\n b = q + a\r\n\r\n while s.get(b, 0):\r\n s[b] -= 1\r\n t.append(b)\r\n a, b = b, a + b\r\n\r\n n = max(n, len(t))\r\n\r\n for c in t:\r\n s[c] += 1\r\n s[q] += 1\r\n\r\nprint(n + 1)\r\n", "'''\r\nCreated on Aug 26, 2016\r\n\r\n@author: Md. Rezwanul Haque\r\n'''\r\n'''\r\nF = []\r\na,b = 0,1\r\n#F.append(a)\r\nfor _ in range(5):\r\n F.append(b)\r\n a,b = b,a+b\r\nprint(F)\r\n'''\r\ndef go(a,b):\r\n res, c = 0,a+b\r\n if d.get(c) and d[c]>0:\r\n d[c] -= 1\r\n res = go(b,c) + 1\r\n d[c] += 1\r\n #print(\"Res : \" ,res)\r\n return res \r\ninput()\r\nd = {}\r\nfor i in map(int, input().split()):\r\n if d.get(i):\r\n d[i] += 1\r\n else:\r\n d[i] = 1\r\nans = 2\r\nfor a in d:\r\n for b in d:\r\n if a != b or d[a] >1 :\r\n d[a] -= 1\r\n d[b] -= 1\r\n cnt = go(a,b) + 2\r\n d[a] += 1\r\n d[b] += 1\r\n ans = max(ans, cnt)\r\nprint(ans) ", "n = int(input())\r\na = list(map(int,input().split()))\r\nans = a.count(0)\r\nd = {}\r\nfor i in a:\r\n\tif i not in d:\r\n\t\td[i] = 1\r\n\telse:\r\n\t\td[i] += 1\r\n\r\nans = max(ans, 2)\r\n\r\nfor i in range(n):\r\n\tfor j in range(n):\r\n\t\t\r\n\t\tif(i != j and (a[i] != 0 or a[j] != 0)):\r\n\r\n\t\t\tfirst = a[i]\r\n\t\t\tsecond = a[j]\r\n\t\t\ttemp = [first, second]\r\n\t\t\tthird = first + second\r\n\r\n\t\t\twhile(True):\r\n\r\n\t\t\t\tif abs(third) > int(1e9):\r\n\t\t\t\t\tbreak\r\n\r\n\t\t\t\tif third not in d:\r\n\t\t\t\t\tbreak\r\n\r\n\t\t\t\ttemp.append(third)\r\n\r\n\t\t\t\tfirst = second\r\n\t\t\t\tsecond = third\r\n\t\t\t\tthird = first + second\r\n\r\n\t\t\tcount = 0\r\n\t\t\tf = 1\r\n\t\t\tfor k in range(len(temp)):\r\n\t\t\t\tif d[temp[k]] > 0:\r\n\t\t\t\t\td[temp[k]] -= 1\r\n\t\t\t\t\tcount += 1\r\n\t\t\t\telse:\r\n\t\t\t\t\tf = 0\r\n\t\t\t\t\tfor j in range(k):\r\n\t\t\t\t\t\td[temp[j]] += 1\r\n\t\t\t\t\tbreak\r\n\t\t\tif f:\r\n\t\t\t\tfor k in temp:\r\n\t\t\t\t\td[k] += 1\r\n\t\t\tans = max(ans, count)\r\n\r\n\r\nprint(ans)\r\n", "def rec(a, b):\n res, c = 0, a + b\n if d.get(c) and d[c] > 0:\n d[c] -= 1\n res = rec(b, c) + 1\n d[c] += 1\n return res\n\ninput()\nd = {}\nfor i in map(int, input().split()):\n if d.get(i):\n d[i] += 1\n else:\n d[i] = 1\nans = 2\nfor a in d:\n for b in d:\n if a != b or d[a] > 1:\n d[a] -= 1\n d[b] -= 1\n cnt = rec(a, b) + 2\n d[a] += 1\n d[b] += 1\n ans = max(ans, cnt)\nprint(ans)\n ", "from collections import Counter\r\ninput()\r\ns=Counter(map(int,input().split()))\r\nn=0\r\nfor q in s:\r\n s[q]-=1\r\n for a in s:\r\n if not s[a]: continue\r\n t=[a]\r\n s[a]-=1\r\n b=q+a\r\n while s.get(b,0):\r\n s[b]-=1\r\n t.append(b)\r\n a,b=b,a+b\r\n n=max(n,len(t))\r\n for c in t: s[c]+=1\r\n s[q]+=1\r\nprint(n+1)", "from sys import stdin, stdout\n\ndef fin(): return stdin.readline().strip()\ndef fout(x): stdout.write(str(x) + '\\n')\n\ndef m_add(mp, val):\n mp[val] = mp.get(val, 0) + 1\ndef m_remove(mp, val):\n if mp[val] == 1:\n mp.pop(val)\n else:\n mp[val] -= 1\n\n\nn, arr, mp, res = int(fin()), list(map(int, fin().split())), {}, 0\nfor i in arr: m_add(mp, i)\n\nfor i in range(n):\n for j in range(n):\n if i == j: continue\n cnt, a, b = 2, arr[i], arr[j]\n\n if a == 0 and b == 0:\n res = max(res, mp[0])\n continue\n\n m_remove(mp, a)\n m_remove(mp, b)\n \n while a+b in mp:\n m_remove(mp, a+b)\n a, b = b, a+b\n cnt += 1\n \n res = max(res, cnt)\n while a != arr[i] or b != arr[j]:\n a, b = b - a, a\n m_add(mp, a+b)\n \n m_add(mp, a)\n m_add(mp, b)\nprint(res)\n" ]

[ "import sys, collections, bisect, heapq, functools, itertools, math\r\ninput = sys.stdin.readline\r\n\r\nm, n = [int(x) for x in input().split()]\r\n\r\ng = []\r\nfor _ in range(m):\r\n g.append([int(x) for x in input().split()])\r\n\r\ng2 = [[1]*n for _ in range(m)]\r\n\r\nfor i in range(m):\r\n for j in range(n):\r\n if g[i][j] == 0:\r\n for k in range(n): g2[i][k] = 0\r\n for k in range(m): g2[k][j] = 0\r\n\r\nfor i in range(m):\r\n for j in range(n):\r\n if g[i][j]:\r\n cnt = 0\r\n for k in range(n): cnt += g2[i][k]\r\n for k in range(m): cnt += g2[k][j]\r\n if cnt == 0:\r\n print('NO'); exit()\r\n\r\nprint('YES')\r\nfor x in g2:\r\n print(*x)\r\n\r\n# https://codeforces.com/contest/486/submission/8666228 ", "from copy import deepcopy\n\ndef handle() -> None:\n n, m = [int(s) for s in input().split(\" \")]\n original_matrix = []\n\n for _ in range(n):\n original_matrix.append([int(s) for s in input().split(\" \")])\n\n zero_matrix = deepcopy(original_matrix)\n rows_to_mark = set()\n cols_to_mark = set()\n\n for row in range(n):\n for col in range(m):\n if original_matrix[row][col] == 0:\n rows_to_mark.add(row)\n cols_to_mark.add(col)\n\n for row in rows_to_mark:\n zero_matrix[row] = [0 for _ in range(m)]\n for col in cols_to_mark:\n for r in range(n):\n zero_matrix[r][col] = 0\n\n rows_to_mark.clear()\n cols_to_mark.clear()\n\n for row in range(n):\n for col in range(m):\n if zero_matrix[row][col] == 1:\n rows_to_mark.add(row)\n cols_to_mark.add(col)\n\n one_matrix = deepcopy(zero_matrix)\n\n for row in rows_to_mark:\n one_matrix[row] = [1 for _ in range(m)]\n for col in cols_to_mark:\n for r in range(n):\n one_matrix[r][col] = 1\n\n if one_matrix == original_matrix:\n print(\"YES\")\n for row in range(n):\n print(\" \".join([str(s) for s in zero_matrix[row]]))\n else:\n print(\"NO\")\n\n\n\nhandle()", "def main():\r\n # input\r\n m, n = map(int, input().split())\r\n mat = []\r\n for _ in range(m):\r\n mat.append(list(map(int, input().split())))\r\n\r\n # soln\r\n a = [[1 for _ in range(n)] for _ in range(m)]\r\n for i in range(m):\r\n for j in range(n):\r\n if mat[i][j] == 0:\r\n for k in range(n):\r\n a[i][k] = 0\r\n for l in range(m):\r\n a[l][j] = 0\r\n \r\n b = [[0 for _ in range(n)] for _ in range(m)]\r\n for i in range(m):\r\n for j in range(n):\r\n if a[i][j] == 1:\r\n for k in range(n):\r\n b[i][k] = 1\r\n for l in range(m):\r\n b[l][j] = 1\r\n \r\n if b == mat:\r\n print(\"YES\")\r\n for i in a:\r\n for j in i:\r\n print(j, end = \" \")\r\n print()\r\n else:\r\n print(\"NO\")\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()", "r, c = map(int, input().split())\r\nans = [[1] * c] * r\r\nx = []\r\nxx = []\r\nfor _ in range(r):\r\n a = list(map(int, input().split()))\r\n xx.extend(a)\r\n x.append(a)\r\nf = True\r\nfor R in range(r):\r\n for C in range(c):\r\n if x[R][C] == 0:\r\n f = False\r\n v = [0] * c\r\n ans[R] = v\r\n ans = list(map(lambda y: y[:C] + [0] + y[C + 1:], ans))\r\n\r\nf = True\r\nx1, x2 = [], []\r\nfor i in range(r):\r\n for j in range(c):\r\n if ans[i][j] == 1:\r\n if i not in x1: x1.append(i)\r\n if j not in x2: x2.append(j)\r\n\r\nfor i in range(r):\r\n if not f:\r\n break\r\n for j in range(c):\r\n if x[i][j] == 1:\r\n if i not in x1 and j not in x2:\r\n print('NO')\r\n f = False\r\n break\r\nif f:\r\n print('YES')\r\n for row in ans:\r\n print(\" \".join(map(str, row)))", "from sys import stdin\r\ndef input(): return stdin.readline()[:-1]\r\ndef check(x,y):\r\n\tf1=True\r\n\tf2=True\r\n\tfor i in range(n):\r\n\t\tif l[i][y]==1:\r\n\t\t\tcontinue\r\n\t\telse:\r\n\t\t\tf1=False\r\n\t\t\tbreak\r\n\tfor i in range(m):\r\n\t\tif l[x][i]==1:\r\n\t\t\tcontinue\r\n\t\telse:\r\n\t\t\tf2=False\r\n\t\t\tbreak\r\n\treturn [f1,f2]\r\nn,m=map(int,input().split())\r\nl=[]\r\nans=[]\r\ndef solve():\r\n\tone=False\r\n\tone2=False\r\n\tfor i in range(n):\r\n\t\tl.append(list(map(int,input().split())))\r\n\tfor i in range(n):\r\n\t\tfor j in range(m):\r\n\t\t\tif l[i][j]==0:\r\n\t\t\t\tans.append(0)\r\n\t\t\telse:\r\n\t\t\t\tone=True\r\n\t\t\t\ttemp=check(i,j)\r\n\t\t\t\tif temp==[1,1]:\r\n\t\t\t\t\tans.append(1)\r\n\t\t\t\t\tone2=True\r\n\t\t\t\telif temp==[0,1] or temp==[1,0]:\r\n\t\t\t\t\tans.append(0)\r\n\t\t\t\telse:\r\n\t\t\t\t\tprint(\"NO\")\r\n\t\t\t\t\treturn\r\n\telse:\r\n\t\tif one and one2==False:\r\n\t\t\tprint(\"NO\")\r\n\t\telse:\r\n\t\t\tprint(\"YES\")\r\n\t\t\tc=0\r\n\t\t\tfor i in range(n*m):\r\n\t\t\t\tprint(ans[i],end=\" \")\r\n\t\t\t\tc+=1\r\n\t\t\t\tif c==m:\r\n\t\t\t\t\tprint(\"\",end=\"\\n\")\r\n\t\t\t\t\tc=0\r\nsolve()", "r,c = map(int,input().split())\r\nrows = [1]*(r)\r\ncols = [1]*(c)\r\nmat = []\r\nflag = False\r\nthere = 0\r\nhave = 0\r\nfor i in range(r):\r\n m = list(map(int,input().split()))\r\n mat.append(m)\r\n for u in range(c):\r\n if m[u]==0:\r\n rows[i]=0\r\n cols[u]=0\r\n else:\r\n there+=1\r\nans = []\r\nflagged = set()\r\nonez = set()\r\n# print(rows)\r\n# print(cols)\r\nfor i in range(r):\r\n ro = []\r\n for u in range(c):\r\n if mat[i][u]==1 and (not rows[i]) and u not in onez:\r\n if cols[u]:\r\n flagged.add(u)\r\n ro.append(0)\r\n else:\r\n print('NO')\r\n flag = True\r\n break\r\n elif rows[i] and cols[u]:\r\n if u in flagged:\r\n flagged.remove(u)\r\n onez.add(u)\r\n ro.append(1)\r\n have+=1\r\n else:\r\n ro.append(0)\r\n if flag:\r\n break\r\n ans.append(ro)\r\nelse:\r\n if len(flagged) or there and not have:\r\n print('NO')\r\n else:\r\n print('YES')\r\n for i in ans:\r\n print(*i)", "n,m = map(int,input().split())\r\nl = []\r\nfor i in range(n):\r\n l.append(list(map(int,input().split())))\r\nans = [[0]*m for _ in range(n)]\r\na=[]\r\nsu=[]\r\nf=1\r\nfor j in range(m):\r\n x=0\r\n for i in range(n):\r\n if l[i][j]==0:\r\n break\r\n x+=1\r\n if x==n:\r\n a.append(j)\r\nfor i in range(n):\r\n if l[i].count(1)==m:\r\n for j in a:\r\n ans[i][j]=1\r\n su.append([i,j])\r\n \r\nk = [[0]*m for _ in range(n)]\r\nfor i in su:\r\n k[i[0]]=[1]*m\r\n for j in range(n):\r\n k[j][i[1]]=1\r\nif l!=k:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n for i in range(n):\r\n print(*ans[i])", "m,n = map(int, input().split())\r\nB = []\r\nfor i in range(m):\r\n arr = list(map(int, input().split()))\r\n B.append(arr)\r\nrowsum,colsum,n1 = [0]*m,[0]*n,0\r\nfor i in range(m):\r\n rowsum[i] = sum(B[i])\r\nfor j in range(n):\r\n for i in range(m):\r\n colsum[j] += B[i][j]\r\n if B[i][j] == 1:\r\n n1 += 1\r\nrowsum = set(rowsum)\r\ncolsum = set(colsum)\r\nif ((0 in rowsum) or (0 in colsum)) and n1 > 0:\r\n print(\"NO\")\r\nelse:\r\n rows,cols = set(),set()\r\n for i in range(m):\r\n for j in range(n):\r\n if B[i][j] == 0:\r\n rows.add(i)\r\n cols.add(j)\r\n t = 0\r\n for i in range(m):\r\n for j in range(n):\r\n if B[i][j] == 1:\r\n if (i in rows) and (j in cols):\r\n t += 1\r\n if t > 0:\r\n print(\"NO\")\r\n else:\r\n print(\"YES\")\r\n ans = [[1 for _ in range(n)]for _ in range(m)]\r\n for i in range(m):\r\n for j in range(n):\r\n if B[i][j] == 0:\r\n for _ in range(n):\r\n ans[i][_] = 0\r\n for _ in range(m):\r\n ans[_][j] = 0\r\n for i in range(m):\r\n print(*ans[i], sep=\" \")\r\n ", "n,m = map(int, input().split())\r\narr = [list(map(int, input().split())) for row in range(n)]\r\n\r\nA = [[1 for col in range(m)] for row in range(n)]\r\n\r\nfor row in range(n):\r\n for col in range(m):\r\n if arr[row][col] == 0:\r\n A[row] = [0 for x in range(m)]\r\n for x in range(n):\r\n A[x][col] = 0\r\n\r\nfor row in range(n):\r\n for col in range(m):\r\n if arr[row][col] == 1:\r\n if sum(A[row]) == 0 and sum ([x[col] for x in A]) == 0:\r\n print('NO')\r\n exit()\r\n\r\nprint('YES')\r\nfor row in range(n):\r\n print(\" \".join(str(x) for x in A[row]))" ]

[ "n = int(input())\nbills = list(map(int, input().split()))\n\nchange_25 = 0\nchange_50 = 0\n\nfor bill in bills:\n if bill == 25:\n change_25 += 1\n elif bill == 50:\n if change_25 >= 1:\n change_25 -= 1\n change_50 += 1\n else:\n print(\"NO\")\n break\n elif bill == 100:\n if change_50 >= 1 and change_25 >= 1:\n change_50 -= 1\n change_25 -= 1\n elif change_25 >= 3:\n change_25 -= 3\n else:\n print(\"NO\")\n break\nelse:\n print(\"YES\")\n\n\t \t \t\t \t\t\t\t\t \t \t\t\t\t", "n=int(input())\r\nlst=[int(x) for x in input().split()]\r\ndic={25:0,50:0}\r\nfor i in lst:\r\n if i==25:dic[25]+=1\r\n elif i==50:\r\n if dic[25]==0:\r\n print('NO')\r\n break\r\n else:\r\n dic[25]-=1\r\n dic[50]+=1\r\n else:\r\n if dic[25]>0 and dic[50]>0:\r\n dic[25]-=1\r\n dic[50]-=1\r\n elif dic[25]>=3:dic[25]-=3\r\n else:\r\n print('NO')\r\n break\r\nelse:print('YES')\r\n", "import sys\ninput = sys.stdin.readline\n\nt = 1\n# t = int(input())\nfor _ in range(t):\n n = int(input())\n a = list(map(int, input().split()))\n if (a[0] != 25):\n print(\"NO\")\n else:\n flag = 0\n d = {25 : 0, 50 : 0}\n for i in a:\n if (i == 25):\n d[25] += 1\n elif (i == 50):\n if (d[25] > 0):\n d[25] -= 1\n d[50] += 1\n else:\n print(\"NO\")\n flag = 1\n break\n else:\n if (d[25] == 0):\n print(\"NO\")\n flag = 1\n break\n elif (d[50] == 0):\n if (d[25] > 2):\n d[25] -= 3\n else:\n print(\"NO\")\n flag = 1\n break\n else:\n d[25] -= 1\n d[50] -= 1\n if (not flag):\n print(\"YES\")\n \t \t \t\t \t\t \t\t \t \t \t\t \t\t", "import sys\r\n\r\nn = int(sys.stdin.readline())\r\nA = list(map(int, sys.stdin.readline().split()))\r\n\r\nnum_25 = 0\r\nnum_50 = 0\r\n\r\nok = True\r\nfor a in A:\r\n if a == 25:\r\n num_25 += 1\r\n elif a == 50:\r\n num_50 += 1\r\n if num_25 >= 1:\r\n num_25 -= 1\r\n else:\r\n ok = False\r\n elif a == 100:\r\n if num_50 >= 1 and num_25 >= 1:\r\n num_50 -= 1\r\n num_25 -= 1\r\n elif num_25 >= 3:\r\n num_25 -= 3\r\n else:\r\n ok = False\r\n\r\nprint(\"YES\" if ok else \"NO\")", "n= int(input())\r\nlst=list(map(int,input().split()))\r\na_dict={25:0,\r\n 50:0}\r\nans='YES'\r\nfor r in lst:\r\n if r==25:\r\n a_dict[25]+=1\r\n elif r==50 and a_dict[25]>=1:\r\n a_dict[50]+=1\r\n a_dict[25]-=1\r\n elif r==100 and a_dict[50]>=1 and a_dict[25]>=1:\r\n a_dict[50]-=1; a_dict[25]-=1\r\n elif r==100 and a_dict[25]>=3:\r\n a_dict[25]-=3\r\n else:\r\n ans='NO'\r\nprint(ans)\r\n ", "size = int(input())\r\nline = [int(i) for i in input().split()]\r\nassert size == len(line), \"invalid input\"\r\n\r\nbills = {25: 0, 50: 0, 100: 0}\r\nfor p in line:\r\n assert p in [25, 50, 100], \"each bill should be either 25, 50, or 100 rubles\"\r\n if p == 50:\r\n if bills[25] == 0:\r\n print(\"NO\")\r\n break\r\n bills[25] -= 1\r\n elif p == 100:\r\n if bills[25] >= 1 and bills[50] >= 1:\r\n bills[25] -= 1\r\n bills[50] -= 1\r\n elif bills[25] >= 3:\r\n bills[25] -= 3\r\n else:\r\n print(\"NO\")\r\n break\r\n bills[p] += 1\r\nelse:\r\n print(\"YES\")\r\n", "d={\r\n 25:0,\r\n 50:0,\r\n 100:0\r\n}\r\ninput();ans='YES'\r\nfor i in map(int,input().split()):\r\n if i==25:d[25]+=1\r\n if i==50:\r\n if d[25]==0:ans='NO';break\r\n d[50]+=1;d[25]-=1\r\n if i==100:\r\n if d[25]>0 and d[50]>0:d[100]+=1;d[25]-=1;d[50]-=1\r\n elif d[25]>2:d[100]+=1;d[25]-=3\r\n else:ans='NO';break\r\nprint(ans)", "n=int(input())\r\nseq=[int(x) for x in input().split()]\r\ncount25=0\r\ncount50=0\r\ncount100=0\r\nfor k,v in enumerate(seq):\r\n val=25*count25+50*count50+100*count100\r\n if val-(v-25)>=0:\r\n x=v-25\r\n if x==75:\r\n if count50>=1 and count25>=1:\r\n count50-=1\r\n count25-=1\r\n elif count25>=3:\r\n count25-=3\r\n else:\r\n print('NO')\r\n exit()\r\n count100+=1\r\n\r\n elif x==25:\r\n if count25>=1:\r\n count25-=1\r\n else:\r\n print('NO')\r\n exit()\r\n count50+=1\r\n\r\n elif x==0:\r\n count25+=1\r\n else:\r\n print(\"NO\")\r\n exit()\r\nprint('YES')", "n = int(input())\r\narr = [int(i) for i in input().split()]\r\ndata = {25:0,50:0}\r\nok = \"YES\"\r\nfor _ in arr:\r\n\tif _ == 25:data[_] += 1\r\n\telif _ == 50:\r\n\t\tdata[_] += 1\r\n\t\tif data[25] > 0:data[25] -= 1\r\n\t\telse:\r\n\t\t\tok = \"NO\"\r\n\t\t\tbreak\r\n\telse:\r\n\t\tif data[50] > 0 and data[25] > 0:\r\n\t\t\tdata[25] -= 1\r\n\t\t\tdata[50] -= 1\r\n\t\telif data[25] > 2:data[25] -= 3\r\n\t\telse:\r\n\t\t\tok = \"NO\"\r\n\t\t\tbreak\r\nprint(ok)", "n=int(input())\r\nl=list(map(int,input().split()))\r\ncount=[0,0,0]\r\nfor i in l:\r\n if i==25:\r\n count[0]+=1\r\n elif i==50:\r\n count[1]+=1\r\n if count[0]==0:\r\n print(\"NO\")\r\n exit()\r\n else:\r\n count[0]-=1\r\n elif i==100:\r\n count[2]+=1\r\n if count[0]>=1 and count[1]>=1:\r\n count[0]-=1\r\n count[1]-=1\r\n elif count[1]==0 and count[0]>=3:\r\n count[0]-=3\r\n else:\r\n print(\"NO\")\r\n exit()\r\nprint(\"YES\")", "# from math import sqrt\r\n# from math import sqrt\r\n# from collections import Counter\r\n# from collections import deque\r\nmod=1073741824\r\ndef solve():\r\n n=int(input())\r\n l=list(map(int,input().split()))\r\n d={25:0,50:0}\r\n for i in l:\r\n if i==25:\r\n d[25]+=1\r\n elif i==50:\r\n if d[25]==0:\r\n print(\"NO\")\r\n return\r\n d[25]-=1\r\n d[50]+=1\r\n else:\r\n if d[25]==0:\r\n print(\"NO\")\r\n return\r\n if d[50]>0:\r\n d[50]-=1\r\n d[25]-=1\r\n else:\r\n if d[25]<3:\r\n print(\"NO\")\r\n return\r\n d[25]-=3\r\n print(\"YES\")\r\n\r\n\r\n\r\n\r\n\r\nif __name__ == \"__main__\":\r\n solve()\r\n\r\n\r\n\r\n", "n = int(input())\nls_input = list(map(int,input().split()))\n\ncash_c = 0\nnotes_25 = 0\nnotes_50 = 0\n\nfor i in range(n):\n\tif ls_input[i] == 25:\n\t\t#cash_c += 25\n\t\tnotes_25+=1\n\telif ls_input[i] == 50:\n\t\tif notes_25 >= 1:\n\t\t\tnotes_25 -= 1\n\t\t\tnotes_50 +=1\n\t\telse:\n\t\t\tprint('NO')\n\t\t\tbreak\n\telse:\n\t\tif notes_50 >= 1 and notes_25>=1:\n\t\t\tnotes_25-=1\n\t\t\tnotes_50-=1\n\t\telif notes_25>=3:\n\t\t\tnotes_25-=3\n\t\telse:\n\t\t\tprint('NO')\n\t\t\tbreak\nelse:\n\tprint('YES')\n", "import sys\r\ninput = sys.stdin.readline\r\nprint = sys.stdout.write\r\ndef main() :\r\n n = int(input().strip())\r\n arr = list(map(int,input().strip().split()))\r\n test = True\r\n c25 = 0\r\n c50 = 0\r\n c100 = 0\r\n for i in arr :\r\n if i == 25 :\r\n c25+=1\r\n else :\r\n if i == 50 :\r\n if c25 :\r\n c25-=1\r\n c50+=1\r\n else :\r\n test = False\r\n break\r\n else :\r\n c100+=1\r\n if c50 and c25 :\r\n c50-=1\r\n c25-=1\r\n elif c25>2 :\r\n c25-=3\r\n else :\r\n test = False\r\n break \r\n if test :\r\n print('YES')\r\n else :\r\n print('NO') \r\nmain()", "n=int(input())\r\nw=map(int,input().split())\r\nd={25:0,50:0}\r\nf=0\r\nfor i in w:\r\n if i==25:\r\n d[25]+=1\r\n elif i==50:\r\n if d[25]:\r\n d[25]-=1 \r\n d[50]+=1\r\n else:\r\n f=1 \r\n break \r\n else:\r\n if d[25] and d[50]:\r\n d[25]-=1 \r\n d[50]-=1 \r\n elif d[25]>=3:\r\n d[25]-=3\r\n else:\r\n f=1 \r\n break \r\nif f:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "n=int(input())\r\nlst=list(map(int,input().split()))\r\nx=1\r\ncnt_25,cnt_50=0,0\r\nfor i in range(n):\r\n if (lst[i]==25):\r\n cnt_25 +=1\r\n elif (lst[i]==50):\r\n if(cnt_25<1):\r\n x=0\r\n break\r\n else:\r\n cnt_25 -=1\r\n cnt_50 += 1\r\n elif (lst[i]==100):\r\n if(cnt_25>0 and cnt_50>0):\r\n cnt_25 -=1\r\n cnt_50 -=1\r\n elif (cnt_25>=3):\r\n cnt_25 -=3\r\n else:\r\n x=0\r\n break\r\nif x==1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n = int(input())\r\ncash_25 = 0\r\ncash_50 = 0\r\n\r\nfor i in list(map(int, input().split())):\r\n if i == 25:\r\n cash_25 += 1\r\n elif i == 50:\r\n if cash_25 >= 1:\r\n cash_25 -= 1\r\n cash_50 += 1\r\n else:\r\n print(\"NO\")\r\n exit()\r\n elif i == 100:\r\n if cash_50 >= 1 and cash_25 >= 1:\r\n cash_50 -= 1\r\n cash_25 -= 1\r\n elif cash_25 >= 3:\r\n cash_25 -= 3\r\n else:\r\n print(\"NO\")\r\n exit()\r\n\r\nprint(\"YES\")\r\n", "n = int(input())\r\nar = [int(i) for i in input().split()]\r\nc2,c5=0,0\r\n\r\n#while c2>=0 and c5>=0: \r\nfor m in ar:\r\n \r\n \r\n if m>25: \r\n if m==50: \r\n c2-=1\r\n c5+=1\r\n else: \r\n if c5 and c2: \r\n c5-=1\r\n c2-=1\r\n else: \r\n c2-=3\r\n else: \r\n c2+=1\r\n \r\n if c2<0 or c5<0: \r\n print(\"NO\")\r\n break\r\n\r\nelse:\r\n print(\"YES\")", "n = int(input())\r\n\r\na = list(map(int,input().split()))\r\n\r\nbills = {25:0, 50:0, 100:0}\r\nbSum = 0\r\n\r\nfor i in range(n):\r\n bills[a[i]]+=1\r\n bSum +=a[i]\r\n change = a[i]-25\r\n if change>bSum:\r\n print(\"NO\")\r\n exit()\r\n \r\n if change>50 and bills[50]>0:\r\n bills[50]-=1\r\n bSum -= 50\r\n change-=50\r\n if change>=25:\r\n need = change//25\r\n if bills[25]>=need:\r\n bills[25]-=need\r\n bSum += (need*25)\r\n change = change-(need*25)\r\n \r\n if change!=0:\r\n print(\"NO\")\r\n exit()\r\n \r\n \r\n\r\n\r\n\r\n\r\nprint(\"YES\")", "def solve():\r\n n = int(input())\r\n l = list(map(int, input().split()))\r\n c25, c50 = 0,0\r\n for i in range(n):\r\n if(l[i] == 25):\r\n c25 += 1 \r\n if(l[i] == 50):\r\n c50 += 1 \r\n c25 -= 1\r\n if(l[i] == 100):\r\n if(c50 > 0):\r\n c50 -= 1 \r\n c25 -= 1 \r\n else:\r\n c25 -= 3 \r\n if(c25 < 0):\r\n return \"NO\"\r\n \r\n return \"YES\"\r\nprint(solve())", "n=int(input()); three=['25','25','25']; twentyfive_lenth=0; fifty_length=0\r\nfor value in input().split():\r\n flag = 'YES'\r\n if value=='25':\r\n twentyfive_lenth+=1\r\n elif value=='50':\r\n if twentyfive_lenth==0:\r\n flag = 'NO'\r\n break\r\n else:\r\n twentyfive_lenth -= 1\r\n fifty_length += 1\r\n else:\r\n if fifty_length!=0 and twentyfive_lenth!=0:\r\n flag= 'YES2'\r\n fifty_length -= 1\r\n twentyfive_lenth -= 1\r\n if flag=='YES':\r\n for value in three:\r\n if twentyfive_lenth==0:\r\n flag = 'NO'\r\n break\r\n else:\r\n twentyfive_lenth -= 1\r\nprint('NO' if flag=='NO' else 'YES')\r\n", "# author: ankan2526\r\n\r\nimport math, bisect, heapq, random, sys, itertools\r\ninput=sys.stdin.readline\r\n\r\np = 10**9+7\r\n\r\nn = int(input())\r\na=[int(i) for i in input().split()]\r\nx,y=0,0\r\nvalid = True\r\nfor i in a:\r\n if i==25:\r\n x+=1\r\n elif i==50:\r\n if x==0:\r\n valid=False\r\n break\r\n x-=1\r\n y+=1\r\n else:\r\n if y>0 and x>0:\r\n x-=1\r\n y-=1\r\n elif x>2:\r\n x-=3\r\n else:\r\n valid=False\r\n break\r\nif valid:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "from collections import defaultdict\r\nn = int(input()) \r\na = [int(i) for i in input().split()] \r\nd = defaultdict(int) \r\nd[0] = 1\r\nans = \"YES\"\r\nfor i in range(n): \r\n if a[i] == 25 : d[25] += 1 \r\n elif a[i] == 50 : \r\n if d[25] == 0 : ans = \"NO\"; break \r\n d[25] -= 1\r\n d[50] += 1\r\n else : \r\n if d[50] >=1 and d[25] >=1 : \r\n d[25] -= 1\r\n d[50] -= 1\r\n elif d[25] >= 3 : \r\n d[25] -= 3 \r\n else : ans = \"NO\"; break\r\nprint(ans)", "import os\r\nimport sys\r\nfrom io import BytesIO, IOBase\r\nimport itertools as itt, collections, functools\r\nimport queue, heapq, operator\r\nimport string\r\nimport re\r\nfrom typing import Iterable, List, Tuple\r\nimport math\r\n\r\nWINDOW = 14\r\n\r\n\r\ndef window(s: str, k: int) -> List[collections.deque]:\r\n yield from ((itt.islice(s, i, i + k), i) for i in range(len(s) - k))\r\n\r\n\r\ndef pairwise(iterable):\r\n \"s -> (s0,s1), (s1,s2), (s2, s3), ...\"\r\n a, b = itt.tee(iterable)\r\n next(b, None)\r\n return zip(a, b)\r\n\r\n\r\ndef main():\r\n input()\r\n ar = [0] * 2\r\n for k in map(int, input().split()):\r\n if k == 25:\r\n ar[0] += 1\r\n elif k == 50:\r\n ar[1] += 1\r\n ar[0] -= 1\r\n elif k == 100:\r\n ar[1] -= 1\r\n ar[0] -= 1\r\n if ar[1] < 0:\r\n ar[1] += 1\r\n ar[0] -= 2\r\n if ar[0] < 0:\r\n print(\"NO\")\r\n return\r\n print(\"YES\")\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\nlines = lambda: iter(input, \"\")\r\nllines = lambda: list(lines())\r\nblocklines = iter(llines, [])\r\n\r\n# endregion\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "def main():\n n = int(input())\n queue = list(map(int, input().split(\" \")))\n\n change = {25: 0, 50: 25, 100: 75}\n cache = {25: 0, 50: 0, 100: 0}\n total = 0\n\n while queue:\n p = queue.pop(0)\n need = change[p]\n total += p - need\n\n if p > 25 and total < p:\n print('NO')\n return\n\n cache[p] += 1\n if need == 0:\n continue\n\n for x in [100, 50, 25]:\n while cache[x] > 0 and need >= x:\n cache[x] -= 1\n need -= x\n if need > 0:\n print('NO')\n return\n\n print('YES')\n\n \nif __name__ == \"__main__\":\n main()\n", "n=int(input())\r\n\r\na=[int(x) for x in input().split()]\r\n\r\n# print(a)\r\ncnt25=0\r\ncnt50=0\r\n\r\n\r\n\r\nfor i in range(n):\r\n\tif a[i]==25:\r\n\t\tcnt25+=1\r\n\t\tcontinue\r\n\r\n\tif a[i]==50:\r\n\t\tcnt50+=1\r\n\t\tif cnt25==0:\r\n\t\t\tprint(\"NO\")\r\n\t\t\texit()\r\n\t\tif cnt25>0:\r\n\t\t\tcnt25-=1\r\n\t\r\n\tif a[i]==100:\r\n\t\tif cnt25>0 and cnt50 >0:\r\n\t\t\tcnt25-=1\r\n\t\t\tcnt50-=1\r\n\r\n\r\n\t\telif cnt25>2:\r\n\t\t\tcnt25-=3\r\n\t\t\r\n\t\telse:\r\n\t\t\tprint(\"NO\")\r\n\t\t\texit()\t\t\r\nprint(\"YES\")\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "input()\r\ns = [0, 0, 0]\r\nans = 'YES'\r\nfor i in [int(i) for i in input().split()]:\r\n if i == 25:\r\n s[0] += 1\r\n if i == 50:\r\n if s[0]:\r\n s[0] -= 1\r\n s[1] += 1\r\n else:\r\n ans = 'NO'\r\n break\r\n if i == 100:\r\n if s[0] and s[1]:\r\n s[0] -= 1\r\n s[1] -= 1\r\n s[2] += 1\r\n elif s[0] > 2:\r\n s[0] -= 3\r\n s[2] += 1\r\n else:\r\n ans = 'NO'\r\n break\r\nprint(ans)\r\n", "n = int(input())\nl = list(map(int, input().split()))\nk25 = 0\nk50 = 0\nk100 = 0\nfor i in l:\n if i == 25:\n k25+=1\n elif i == 50:\n if k25 > 0:\n k25 -= 1\n k50 += 1\n else:\n print(\"NO\")\n quit()\n else:\n if k50 > 0:\n k50 -= 1\n if k25 > 0:\n k25 -= 1\n k100+=1\n else:\n print(\"NO\")\n quit()\n else:\n if k25 >= 3:\n k25 -= 3\n k100 += 1\n else:\n print(\"NO\")\n quit()\n\nprint(\"YES\")\n", "def main():\n T = int(input())\n r = list(map(int, input().split()))\n s25 = 0\n s50 = 0\n c = 0\n\n for i in range(T):\n if r[0] != 25:\n print(\"NO\")\n c += 1\n break\n if r[i] == 25:\n s25 += 25\n elif r[i] == 50:\n if 50 - s25 > 25:\n print(\"NO\")\n c += 1\n break\n else:\n s25 -= 25\n s50 += 50\n elif r[i] == 100:\n if s50 >= 50 and s25 >= 25:\n s50 -= 50\n s25 -= 25\n elif s25 >= 75:\n s25 -= 75\n else:\n print(\"NO\")\n c += 1\n break\n\n if c == 0:\n print(\"YES\")\n\nif __name__ == \"__main__\":\n main()\n\n \t\t \t \t \t\t \t \t\t\t\t \t \t\t \t", "test = int(input())\n\ncount = 0\nqueue = list(map(int, input().split()))\n\nd25=0\nd50=0\nfor i in range(test):\n # if queue[i] - 25 == 0:\n # count += 25\n # elif queue[i] - 25 != 0 :\n # count -= (queue[i] - 25)\n # if count < 0:\n # break\n if queue[i] == 25:\n d25 +=1\n elif queue[i] == 50:\n if d25>0:\n d25 -= 1\n d50 += 1\n else:\n print(\"NO\")\n exit()\n else:\n if d25 >0 and d50 >0:\n d25 -= 1\n d50 -=1\n elif d50 == 0 and d25 >=3:\n d25 -= 3\n else:\n print(\"NO\")\n exit()\n\nprint(\"YES\")\n", "n,s,f,x,y=int(input()),0,0,0,0\r\na=list(map(int, input().split()))\r\nfor i in a:\r\n if i==25:\r\n x+=1\r\n elif i==50:\r\n y+=1\r\n x-=1\r\n else:\r\n if y>0:\r\n y-=1\r\n x-=1\r\n else:\r\n x-=3\r\n if x<0 or y<0:\r\n f=1\r\n break\r\nif f==0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n = int(input())\r\narr = [int(x) for x in input().split()]\r\ntf = 0\r\nfi = 0\r\nflag = 0\r\nfor i in range(n):\r\n if flag :\r\n break\r\n if arr[i] == 25:\r\n tf += 1\r\n elif arr[i] == 50:\r\n if tf:\r\n fi += 1\r\n tf -= 1\r\n else:\r\n flag = 1\r\n break \r\n else:\r\n if fi:\r\n if tf:\r\n fi -= 1\r\n tf -= 1\r\n else:\r\n flag = 1\r\n break \r\n else:\r\n if tf >= 3:\r\n tf -= 3\r\n else:\r\n flag = 1\r\n break\r\nif flag:\r\n print('NO') \r\nelse:\r\n print('YES') \r\n\r\n # if tf:\r\n # if fi:\r\n # fi -= 1\r\n # tf -= 1 \r\n # else:\r\n # if tf >= 3:\r\n # tf -= 3\r\n # else:\r\n # flag = 1\r\n # break\r\n # else:\r\n # flag = 1\r\n # break \r\n\r\n", "n=int(input())\r\na=input()\r\na=a.split()\r\nk=0\r\ns25=0\r\ns50=0\r\ns100=0\r\nif int(a[0])==25:\r\n s25+=25\r\n a.pop(0)\r\n for i in range(n-1):\r\n if int(a[i])==25:\r\n s25+=25\r\n elif a[i]=='50':\r\n if s25>0:\r\n s25-=25\r\n s50+=50\r\n else:\r\n print('NO')\r\n exit(0)\r\n else:\r\n if s50>0 and s25>0:\r\n s50-=50\r\n s25-=25\r\n s100+=100\r\n elif s25>=75:\r\n s25-=75\r\n s100+=100\r\n else:\r\n print('NO')\r\n exit(0)\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "n = int(input())\r\nline = [int(x) for x in input().split()]\r\nchange = {25:0,50:0}\r\nans = \"YES\"\r\nfor l in line:\r\n if l == 25:\r\n change[25] += 1\r\n elif l == 50:\r\n change[50] += 1\r\n change[25] -= 1\r\n else:\r\n if change[50]:\r\n change[50]-=1\r\n change[25]-=1\r\n else:\r\n change[25]-=3\r\n if change[25] < 0:\r\n ans = \"NO\"\r\n break\r\nprint(ans)", "import math\r\ndef sol(x):\r\n change=0\r\n fifty=0\r\n for i in x:\r\n if i==25:\r\n change+=1\r\n else:\r\n if i==50:\r\n fifty+=1\r\n change_required=(i-25)\r\n if change_required==25:\r\n if (change_required//25)<=change:\r\n change-=(change_required//25)\r\n else:\r\n return \"NO\"\r\n else:\r\n if fifty!=0 and change!=0:\r\n change-=1\r\n fifty-=1\r\n elif (change_required//25)<=change:\r\n change-=(change_required//25)\r\n else:\r\n return \"NO\"\r\n return 'YES' \r\n\r\nn=int(input())\r\nx=list(map(int,input().rstrip().split()))\r\nprint(sol(x))\r\n ", "n = int(input())\r\na = list(map(int, input().split()))\r\nans = 'YES'\r\nbill25, bill50 = 0, 0\r\nfor x in a:\r\n d = x - 25\r\n if d == 0:\r\n bill25 += 1\r\n elif d == 25:\r\n if bill25 > 0:\r\n bill25 -= 1\r\n bill50 += 1\r\n else:\r\n ans = 'NO'\r\n break\r\n elif d == 75:\r\n if bill50 > 0 and bill25 > 0:\r\n bill25 -= 1\r\n bill50 -= 1\r\n elif bill25 >= 3:\r\n bill25 -= 3\r\n else:\r\n ans = 'NO'\r\n break\r\n \r\nprint(ans)", "n = int(input())\r\nnumbers = [int(num) for num in input().split(\" \", n-1)]\r\nans = 0\r\np=q=r=0\r\nfor i in range(n):\r\n if numbers[i]==25:\r\n p += 1\r\n elif numbers[i]==50:\r\n if p>=1:\r\n p -= 1\r\n q += 1\r\n else:\r\n ans = 1\r\n break\r\n elif numbers[i]==75:\r\n if p>=0 and q>=1:\r\n q -= 1\r\n r += 1\r\n elif p>=2 and q==0:\r\n p -= 2\r\n r += 1\r\n else:\r\n ans = 1\r\n break\r\n else:\r\n if p>=0 and q>=0 and r>=1:\r\n r -= 1\r\n elif p>=1 and q>=1 and r==0:\r\n p -= 1\r\n q -= 1\r\n elif p>=3 and q==0 and r==0:\r\n p -= 3\r\n else:\r\n ans = 1\r\n break\r\nif ans==0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n = int(input())\r\nqueue = list(map(int, input().split()))\r\n\r\nden25, den50 = 0, 0\r\n\r\nfor i in queue:\r\n chillara = i - 25\r\n \r\n if chillara == 0:\r\n den25 += 1\r\n \r\n if chillara == 25:\r\n if den25 >= 1:\r\n den25 -= 1\r\n else:\r\n print(\"NO\")\r\n break\r\n den50 += 1\r\n \r\n if chillara == 75:\r\n if den25 >= 1 and den50 >= 1:\r\n den25 -= 1\r\n den50 -= 1\r\n elif den25 >= 3:\r\n den25 -= 3\r\n else:\r\n print(\"NO\")\r\n break\r\nelse:\r\n print(\"YES\")\r\n ", "n=int(input())\r\na=[int(x) for x in input().split()]\r\nif a[0]!=25:\r\n print('NO')\r\nelse:\r\n check=1\r\n a25,a50=1,0\r\n for i in range(1,n):\r\n if a[i]==25:\r\n a25+=1\r\n elif a[i]==50:\r\n if a25>=1:\r\n a25-=1\r\n a50+=1\r\n else:\r\n check=0\r\n break\r\n else:\r\n if a50>=1:\r\n if a25>=1:\r\n a50-=1\r\n a25-=1\r\n else:\r\n check=0\r\n break\r\n else:\r\n if a25>=3:\r\n a25-=3\r\n else:\r\n check=0\r\n break\r\n if check==0:\r\n print('NO')\r\n else:\r\n print('YES')", "from sys import stdin, stdout\r\ninput = stdin.readline\r\nprint = stdout.write\r\n\r\nif __name__ == \"__main__\":\r\n #t = int(input().strip())\r\n \r\n #for test in range(t):\r\n N = int(input().strip())\r\n \r\n queue = list(map(int, input().strip().split()))\r\n change = {25:0, 50:0}\r\n\r\n flag = True\r\n for item in queue:\r\n if item == 25:\r\n change[25] = change[25] + 1\r\n elif item == 50:\r\n if change[25] == 0:\r\n flag = False\r\n break\r\n change[25] = change[25] - 1\r\n change[50] = change[50] + 1\r\n else:\r\n if change[50] > 0 and change[25]> 0:\r\n change[50] = change[50] - 1\r\n change[25] = change[25] - 1\r\n elif change[25] >= 3:\r\n change[25] = change[25] - 3\r\n else:\r\n flag = False\r\n break\r\n if flag:\r\n print(\"YES\\n\")\r\n else:\r\n print(\"NO\\n\")", "n=int(input())\r\narr=list(map(int,input().split()))\r\nq=0\r\nh=0\r\nf=0\r\nfor i in arr:\r\n if i==25:\r\n q+=1\r\n elif i==50:\r\n q-=1\r\n h+=1\r\n elif i==100:\r\n if h>0:\r\n h-=1\r\n q-=1\r\n else:\r\n q-=3\r\n if q<0 or h<0:\r\n print(\"NO\")\r\n break\r\nelse:\r\n print(\"YES\")\r\n ", "n = int(input())\r\n\r\narr = list(map(lambda x : int(x) ,input().split(' ')))\r\n\r\ncurrent_map = {25:0,50:0,100:0}\r\ndef fun():\r\n for val in arr:\r\n current_map[val]+=1\r\n if(val == 50 and current_map[25]==0 ):\r\n print('NO')\r\n return\r\n elif(val == 50):\r\n current_map[25]-=1\r\n \r\n flag = False\r\n \r\n if(val == 100):\r\n flag = True\r\n \r\n if(flag == True and current_map[50] > 0 and current_map[25] > 0):\r\n current_map[50] -= 1\r\n current_map[25] -= 1\r\n flag = False\r\n \r\n if(flag == True and current_map[25] > 2):\r\n current_map[25] -= 3\r\n flag = False\r\n \r\n if(flag == True and val == 100):\r\n print('NO')\r\n return\r\n print('YES')\r\n \r\n \r\nfun()\r\n \r\n ", "n=int(input())\r\nl=list(map(int,input().split()))\r\nd={25:0,50:0,100:0}\r\ny=0\r\nfor i in range(n):\r\n if l[i]==25:\r\n d[25]=d[25]+1\r\n elif l[i]==50:\r\n if d[25]>=1:\r\n d[50]=d[50]+1\r\n d[25]=d[25]-1\r\n else:\r\n y=1\r\n break\r\n else:\r\n if d[25]>=1 and d[50]>=1:\r\n d[100]=d[100]+1\r\n d[50]=d[50]-1\r\n d[25]=d[25]-1\r\n elif d[25]>=3:\r\n d[100]=d[100]+1\r\n d[25]=d[25]-3\r\n else:\r\n y=1\r\n break\r\nif y==0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n ", "from sys import stdin,stdout\r\nnmbr=lambda:int(stdin.readline())\r\nlst = lambda: list(map(int,stdin.readline().split()))\r\nfor _ in range(1):#nmbr()):\r\n n=nmbr()\r\n a=lst()\r\n c25=c50=0;f=1\r\n for v in a:\r\n if v==25:c25+=1\r\n elif v==50:\r\n c25-=1\r\n c50+=1\r\n else:c25-=1\r\n if c25<0:\r\n f=0\r\n break\r\n for v in a:\r\n if v==100:\r\n if c25>=2:\r\n c25-=2\r\n elif c50>=1:\r\n c50-=1\r\n else:\r\n f=0\r\n break\r\n print('YES' if f else 'NO')", "t=int(input())\r\nl=list(map(int,input().split()))\r\nc=0 \r\nc1=0\r\nf=0\r\nfor i in range(len(l)):\r\n if l[i]==25:\r\n c+=1 \r\n elif l[i]==50:\r\n if c>0:\r\n c-=1\r\n c1+=1 \r\n else:\r\n f=1\r\n break\r\n elif l[i]==100:\r\n if c1>=1 and c>=1:\r\n c1-=1 \r\n c-=1 \r\n elif c>2:\r\n c-=3 \r\n else:\r\n f=1 \r\n break\r\nif (f==1):\r\n print('NO')\r\nelse:\r\n print('YES')", "n = int(input())\r\na, b, c = 0, 0, 0\r\nt = list(map(int, input().split()))\r\nans = True\r\nfor el in t:\r\n if el == 25:\r\n a += 1\r\n elif el == 50:\r\n if a > 0:\r\n b += 1\r\n a -= 1\r\n else:\r\n ans = False\r\n break\r\n else:\r\n if b > 0 and a > 0:\r\n c += 1\r\n a -= 1\r\n b -= 1\r\n elif a >= 3:\r\n c += 1\r\n a -= 3\r\n else:\r\n ans = False\r\n break\r\nif ans:\r\n print('YES')\r\nelse:\r\n print('NO')", "# https://codeforces.com/problemset/problem/349/A\r\n\r\n\r\ndef check(seq):\r\n s25, s50 = 0, 0\r\n for i in seq:\r\n if i == 25:\r\n s25 += 1\r\n if i == 50:\r\n if s25 == 0:\r\n return \"NO\"\r\n s25 -= 1\r\n s50 += 1\r\n if i == 100:\r\n if s50 >= 1 and s25 >= 1:\r\n s50 -= 1\r\n s25 -= 1\r\n continue\r\n if s50 == 0 and s25 >= 3:\r\n s25 -= 3\r\n continue\r\n return \"NO\"\r\n return \"YES\"\r\n\r\n\r\ninput()\r\nprint(check(tuple(map(int, input().split()))))\r\n", "n=int(input())\r\nmoney=[int(i) for i in input().split()]\r\n\r\nif money[0]!=25:print('NO')\r\nelse:\r\n cash=[1,0]\r\n for i in range(1,n):\r\n if money[i]==25:\r\n cash[0]+=1\r\n elif money[i]==50:\r\n if cash[0]>=1:\r\n cash[0]-=1\r\n cash[1]+=1\r\n else:\r\n print('NO')\r\n break\r\n elif money[i]==100:\r\n if cash[0]>=1 and cash[1]>=1:\r\n cash[0]-=1\r\n cash[1]-=1\r\n elif cash[0]>=3:\r\n cash[0]-=3\r\n else:\r\n print('NO')\r\n break\r\n else:\r\n print('YES')", "\nn = int(input())\na = list(map(int, input().split()))\nbills = {}\n\nsol_flag = True\n\n\nfor num in a:\n if num not in bills:\n bills[num]=1\n else:\n bills[num] += 1\n\n change = num-25\n if change > 0:\n if change == 25 and change not in bills:\n sol_flag = False\n break\n elif change == 25 and change in bills:\n bills[change]-=1\n if bills[change] == 0:\n bills.pop(change)\n \n if change == 75:\n if 50 in bills and 25 in bills:\n bills[50]-=1\n bills[25]-=1\n\n if bills[50] == 0:\n bills.pop(50)\n if bills[25] == 0:\n bills.pop(25)\n \n elif 25 in bills and bills[25] >= 3:\n bills[25]-=3\n if bills[25] == 0:\n bills.pop(25)\n\n else:\n sol_flag = False\n break\n\nprint('YES' if sol_flag else 'NO')\n", "n= int(input())\r\na = [int(x) for x in input().split()]\r\npachis = 0\r\npachas = 0\r\nsoo = 0\r\nfor x in a:\r\n if x==25:\r\n pachis+=1\r\n continue\r\n elif x==50 and pachis>0:\r\n pachas+=1\r\n pachis-=1\r\n elif x==100 and (pachis>=3 or (pachis>0 and pachas>0)):\r\n soo+=1\r\n if pachas>0:\r\n pachas-=1\r\n pachis-=1\r\n else:\r\n pachis-=3\r\n else:\r\n print(\"NO\")\r\n break\r\nelse:\r\n print(\"YES\")\r\n\r\n ", "from collections import defaultdict\r\n\r\nn = int(input())\r\nq = list(map(int,input().split(\" \")))\r\nc = defaultdict(int)\r\n\r\nfor i in q:\r\n if i == 25:\r\n c[25] += 1\r\n elif i == 50:\r\n if not c[25] >= 1:\r\n print(\"NO\")\r\n exit()\r\n else:\r\n c[50] += 1\r\n c[25] -= 1\r\n elif i == 100:\r\n if (c[25] >= 1 and c[50] >= 1):\r\n c[25] -= 1\r\n c[50] -= 1\r\n c[100] += 1\r\n elif c[25] >= 3:\r\n c[25] -= 3\r\n c[100] += 1\r\n else:\r\n print(\"NO\")\r\n exit()\r\n # print(c,i)\r\nprint(\"YES\")", "input()\r\nflag = 1\r\nquarter = 0\r\nhalf = 0\r\nfor i in (map(int,input().split())):\r\n if i==25: quarter+=1\r\n elif i==50: quarter-=1;half+=1\r\n else: \r\n if half>0:quarter-=1;half-=1\r\n else:quarter-=3\r\n if quarter<0: flag=0;break\r\nif flag==0: print(\"NO\")\r\nelse: print(\"YES\")\r\n ", "n=int(input())\r\na=list(map(int,input().strip().split()))\r\nd=True\r\nc_25=c_50=c_100=0\r\nfor i in range(n):\r\n if(a[i]==25):\r\n c_25+=1\r\n continue\r\n elif a[i]==50:\r\n if(c_25>=1):\r\n c_25-=1\r\n c_50+=1\r\n continue\r\n \r\n else:\r\n d=False\r\n break\r\n \r\n elif a[i]==100:\r\n\r\n\r\n if( c_50>=1 and c_25>=1):\r\n c_50-=1\r\n c_25-=1\r\n c_100+=1\r\n continue\r\n elif c_25>=3:\r\n c_25-=3\r\n c_100+=1\r\n continue\r\n \r\n else:\r\n d=False\r\n break \r\nif(d==False):\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "n=int(input())\r\nl=[int(num) for num in input().split( )]\r\ndic={25:0,50:0,100:0}\r\nmoney=0\r\nc=0\r\nfor i in l:\r\n change=i-25\r\n if change==0:\r\n dic[25]+=1\r\n else:\r\n if change==25:\r\n if dic[25]>=1:\r\n dic[25]-=1\r\n dic[i]+=1\r\n else:\r\n print(\"NO\")\r\n c=1\r\n break\r\n else:\r\n if dic[25]>=1 and dic[50]>=1:\r\n dic[25]-=1\r\n dic[50]-=1\r\n dic[i]+=1\r\n elif dic[25]>=3:\r\n dic[25]-=3\r\n dic[i]+=1\r\n else:\r\n print(\"NO\")\r\n c=1\r\n break\r\nif c==0:\r\n print(\"YES\")", "n=int(input())\r\nlst=list(map(int,input().split(' ')))\r\nmon={}\r\nmon[25]=0\r\nmon[50]=0\r\nflag=True\r\nfor i in lst:\r\n if i==25:\r\n mon[25]+=1\r\n if i==50:\r\n mon[25] -=1\r\n if mon[25]<0:\r\n flag=False\r\n break\r\n mon[50]+=1\r\n if i==100:\r\n if mon[50]>0:\r\n if mon[25]>0:\r\n mon[50]-=1\r\n mon[25]-=1\r\n continue\r\n else:\r\n flag=False\r\n break\r\n else:\r\n if mon[25]>2:\r\n mon[25]-=3\r\n continue\r\n else:\r\n flag=False\r\n break\r\nif flag==False:\r\n print('NO')\r\nelse:\r\n print('YES')\r\n", "n = int(input())\r\nx = list(map(int, input().split()))\r\ny = list([0, 0, 0])\r\n\r\nfor r in x:\r\n if r == 100:\r\n y[0] += 1\r\n if y[1] > 0:\r\n y[1] -= 1\r\n y[2] -= 1\r\n else:\r\n y[2] -= 3\r\n elif r == 50:\r\n y[1] += 1\r\n y[2] -= 1\r\n else:\r\n y[2] += 1\r\n \r\n if y[1] < 0 or y[2] < 0:\r\n print(\"NO\")\r\n quit()\r\n\r\nprint(\"YES\")", "n = int(input())\r\nlst = list(map(int, input().split()))\r\nc25,c50 = 0,0\r\nflag=1\r\n\r\nfor i in range(n):\r\n if lst[i]==25:\r\n c25+=1\r\n \r\n elif lst[i]==50:\r\n if c25>=1:\r\n c25-=1\r\n c50+=1\r\n else:\r\n flag=0\r\n break\r\n \r\n elif lst[i]==100:\r\n if c25>=1 and c50>=1:\r\n c25-=1\r\n c50-=1\r\n elif c50==0 and c25>=3:\r\n c25-=3\r\n else:\r\n flag=0\r\n break\r\n\r\nif flag==1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n = int(input())\r\narr = list(map(int,input().split()))\r\ncnt = 0\r\ncnt1 = 0\r\nposs=True\r\nfor i in arr:\r\n if i == 25:\r\n cnt+=1\r\n elif i == 50:\r\n if cnt == 0:\r\n poss=False\r\n break\r\n else:\r\n cnt -= 1\r\n cnt1 += 1\r\n else:\r\n if cnt1 >= 1 and cnt >= 1:\r\n cnt1 -= 1\r\n cnt -= 1\r\n elif cnt>=3:\r\n cnt -= 3\r\n else:\r\n poss=False\r\n break\r\nif poss:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n = int(input())\r\ncounter = {25: 0, 50: 0, 100: 0}\r\nfor cash in map(int, input().split()):\r\n counter[cash] += 1\r\n\r\n if cash == 50:\r\n if counter[25]:\r\n counter[25] -= 1\r\n else:\r\n print(\"NO\")\r\n break\r\n\r\n if cash == 100:\r\n if counter[50] and counter[25]:\r\n counter[50] -= 1\r\n counter[25] -= 1\r\n elif counter[25] >= 3:\r\n counter[25] -= 3\r\n else:\r\n print(\"NO\")\r\n break\r\nelse:\r\n print(\"YES\")", "from sys import stdin, stdout\r\ninput, print = stdin.readline, stdout.write\r\n\r\n\r\ndef str_input():\r\n s = input()\r\n return s[:len(s)-1]\r\n\r\n\r\ndef main():\r\n n = int(input())\r\n a = list(map(int, input().split()))\r\n c25 = 0\r\n c50 = 0\r\n ans = \"YES\"\r\n for i in a:\r\n if i == 25:\r\n c25 += 1\r\n elif i == 50:\r\n if c25 >= 1:\r\n c25 -= 1\r\n c50 += 1\r\n else:\r\n ans = \"NO\"\r\n else:\r\n if c50 >= 1 and c25 >= 1:\r\n c25 -= 1\r\n c50 -= 1\r\n elif c25 >= 3:\r\n c25 -= 3\r\n else:\r\n ans = \"NO\"\r\n print(f\"{ans}\\n\")\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n = int(input())\narr = list(map(int, input().split()))\n\nnotes_25 = 0\nnotes_50 = 0\nnotes_100 = 0\n\nfor i in range(n):\n if arr[i] == 100:\n if notes_50 >= 1:\n notes_50 -= 1\n if notes_25 >= 1:\n notes_25 -= 1\n else:\n print('NO')\n break\n else:\n if notes_25 >= 3:\n notes_25 -= 3\n else:\n print('NO')\n break\n notes_100 += 1\n elif arr[i] == 50:\n if notes_25 >= 1:\n notes_25 -= 1\n else:\n print('NO')\n break\n notes_50 += 1\n else:\n notes_25 += 1\n\nelse:\n print('YES')\n", "n = int(input())\r\nl = list(map(int, input().split()))\r\ncd = {100:0, 50:0, 25:0}\r\ns = n*25\r\nr = 'YES'\r\nfor i in l:\r\n if i == 100:\r\n if cd[50] > 0 and cd[25] > 0:\r\n cd[i] += 1\r\n cd[50] -= 1\r\n cd[25] -= 1\r\n elif cd[25] >= 3:\r\n cd[i] += 1\r\n cd[25] -= 3\r\n else:\r\n r = 'NO'\r\n break\r\n\r\n elif i == 50:\r\n if cd[25] > 0:\r\n cd[i] += 1\r\n cd[25] -= 1\r\n else:\r\n r = 'NO'\r\n break\r\n\r\n else:\r\n cd[25] += 1\r\n\r\nprint(r)", "n=int(input())\r\na=list(map(int,input().split()))\r\nm={25:0, 50:0}\r\nfor item in a:\r\n diff=item-25\r\n if diff==75:\r\n if m[50]>=1 and m[25]>=1:\r\n m[50]-=1; m[25]-=1\r\n elif m[25]>=3: m[25]-=3\r\n else: print(\"NO\"); exit()\r\n elif diff==25:\r\n if m[25]>=1: m[25]-=1; m[50]+=1\r\n else: print(\"NO\"); exit()\r\n else: m[25]+=1\r\nprint(\"YES\")", "n = int(input())\r\na = list(map(int,input().split()))\r\ns25,s50,s100 =0,0,0\r\nfor i in range(len(a)):\r\n if a[i] == 25:\r\n s25 += 1\r\n elif a[i] == 50:\r\n if s25 > 0:\r\n s25 -= 1\r\n s50 += 1\r\n else:\r\n print(\"NO\")\r\n exit()\r\n elif a[i] == 100:\r\n if s50 > 0 and s25 > 0:\r\n s25 -= 1\r\n s50 -= 1\r\n elif s25 > 2:\r\n s25 -= 3\r\n else:\r\n print(\"NO\")\r\n exit()\r\nprint(\"YES\")", "n=int(input())\r\na=list(map(int,input().split()))\r\nm25=0\r\nm50=0\r\nans=True\r\nfor i in range(0,n):\r\n\tk=a[i]\r\n\tj=k-25\r\n\tif j==0:\r\n\t\tm25+=1\r\n\telif j==25:\r\n\t\tif m25>0:\r\n\t\t\tm25-=1\r\n\t\t\tm50+=1\r\n\t\telse:\r\n\t\t\tans=False\r\n\t\t\tbreak\r\n\telse:\r\n\t\tif m25>0 and m50>0:\r\n\t\t\tm25-=1\r\n\t\t\tm50-=1\r\n\t\telif m25>=3:\r\n\t\t\tm25-=3\r\n\t\telse:\r\n\t\t\tans=False\r\n\t\t\tbreak\r\nif ans:\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")", "size = int(input().strip())\r\nq = list(map(int, input().strip().split()))\r\nc25, c50 = 0, 0\r\nflag = True\r\nfor i in q:\r\n if (i > 25) and c25 == 0:\r\n break\r\n elif i == 50:\r\n if not c25:\r\n break\r\n else:\r\n c25 -= 1\r\n c50 += 1\r\n elif i == 100:\r\n if not c25 or c50 == 0 and c25 < 3 or c50 == 1 and c25 < 1:\r\n break\r\n else:\r\n if c50:\r\n c50 -= 1\r\n c25 -= 1\r\n else:\r\n c25 -= 3\r\n elif i == 25:\r\n c25 += 1\r\nelse:\r\n print('YES')\r\n flag = False\r\nif flag:\r\n print('NO')", "count_time=False\r\nif count_time:\r\n import time\r\n start_time = time.time()\r\n#-----------------------------------------\r\nb={25:0,50:0}\r\nn=int(input())\r\na=list(map(int,input().split()))\r\nfor i in a:\r\n if i!=25:\r\n if i==50:\r\n if b[25]:\r\n b[25]-=1\r\n b[50]+=1\r\n else:\r\n print('NO')\r\n break\r\n else:\r\n if b[50] and b[25]:\r\n b[50]-=1\r\n b[25]-=1\r\n elif b[25]>=3:\r\n b[25]-=3\r\n else:\r\n print('NO')\r\n break\r\n else:b[25]+=1\r\nelse:print('YES')\r\n#------------------------------------------\r\nif count_time:\r\n end_time = time.time()\r\n print('----------------\\nRunning time: {} s'\r\n .format(end_time - start_time))\r\n", "n = int(input())\r\nline = list(map(int, input().split()))\r\n#print(line)\r\n\r\nsum25 = 0\r\nsum50 = 0\r\nsum100 = 0\r\nflag = 0\r\ndef ret(ruble):\r\n return ruble - 25\r\n\r\nfor i in range(n):\r\n if line[i]==25:\r\n sum25 += 25\r\n elif line[i]==50:\r\n sum50 += 50\r\n if sum25==0:\r\n print(\"NO\")\r\n flag = 1\r\n break\r\n else: sum25 -= 25\r\n elif line[i]==100:\r\n sum100 += 100\r\n if sum25 == 0:\r\n print(\"NO\")\r\n flag = 1\r\n break\r\n elif sum50 != 0:\r\n sum50 -= 50\r\n sum25 -= 25\r\n elif sum25 >= 75:\r\n sum25 -= 75\r\n else:\r\n print(\"NO\")\r\n flag = 1\r\n break\r\n\r\nif flag == 0: print(\"YES\")\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n# for i in range(n):\r\n# if ret(line[i]) > cash:\r\n# flag = 0\r\n# print(\"NO\")\r\n# break\r\n# else:\r\n# cash = cash - ret(line[i]) + line[i]\r\n# flag = 1\r\n \r\n# if flag == 1: print(\"YES\")", "n = int(input())\r\nvals = list(map(int, input().split()))\r\ncash = [0, 0, 0]\r\nfor i in range(n):\r\n num = vals[i]\r\n if(num==25):\r\n cash[0]+=1\r\n if(num==50):\r\n if(cash[0]>0):\r\n cash[1]+=1\r\n cash[0]-=1\r\n else:\r\n print('NO')\r\n break\r\n if(num==100):\r\n if(cash[1]>0 and cash[0]>0):\r\n cash[1]-=1\r\n cash[0]-=1\r\n elif(cash[1]==0 and cash[0]>2):\r\n cash[0]-=3\r\n else:\r\n print('NO')\r\n break\r\nelse:\r\n print('YES')", "n=int(input())\r\nl=[int(i) for i in input().split()]\r\nfl=0\r\ndl=[0,0,0]\r\nif(l[0]!=25):\r\n print(\"NO\")\r\n fl=1\r\nelse:\r\n for i in l:\r\n if(i==25):\r\n dl[0]+=1\r\n if(i==50):\r\n dl[1]+=1\r\n if(dl[0]==0):\r\n print(\"NO\")\r\n fl=1\r\n break\r\n else:\r\n dl[0]-=1\r\n if(i==100):\r\n dl[2]+=1\r\n if(dl[0]<1 and dl[1]<1):\r\n print(\"NO\")\r\n fl=1\r\n break\r\n elif(dl[0]>=1 and dl[1]>=1):\r\n dl[0]-=1\r\n dl[1]-=1\r\n elif(dl[0]>=3):\r\n dl[0]-=3\r\n elif(dl[0]<3):\r\n print(\"NO\")\r\n fl=1\r\n break\r\n\r\n if(fl==0):\r\n print(\"YES\")\r\n \r\n \r\n \r\n \r\n \r\n ", "user_input = int(input())\r\na = list(map(int, input().split()))\r\nnote_25 = 0\r\nnote_50 = 0\r\nflag = True\r\nfor i in a:\r\n if i == 25:\r\n note_25 += 1\r\n if i == 50:\r\n note_25 -= 1\r\n note_50 += 1\r\n if i == 100:\r\n if note_50 > 0:\r\n note_25 -= 1\r\n note_50 -= 1\r\n else:\r\n note_25 -= 3\r\n if note_50 < 0 or note_25 < 0:\r\n flag = False\r\n print('NO')\r\n break\r\nif flag:\r\n print('YES')", "n = int(input())\narr = input().split()\nnum_25 = 0\nnum_50 = 0\nfor i in range(n):\n\tif(arr[i] == '25'):\n\t\tnum_25 += 1\n\tif(arr[i] == '50'):\n\t\tnum_50 += 1\n\t\tnum_25 -= 1\n\tif(arr[i] == '100'):\n\t\tif(num_50 > 0):\n\t\t\tnum_50 -= 1\n\t\t\tnum_25 -= 1\n\t\telse:\n\t\t\tnum_25 -= 3\n\tif(num_25 < 0 or num_50 < 0):\n\t\tprint(\"NO\")\n\t\texit()\n\nprint('YES')", "\"\"\"\r\n Author : Ashish Sasmal\r\n Python3 / PyPy3\r\n\"\"\"\r\n\r\nfrom sys import stdin as sin\r\ndef aint():return int(input())\r\ndef amap():return map(int,sin.readline().split())\r\ndef alist():return list(map(int,sin.readline().split()))\r\ndef astr():return input()\r\n\r\nn = aint()\r\nl = alist()\r\nf = True\r\na,b,c = 0,0,0\r\nfor i in l:\r\n if i==25:\r\n a+=1\r\n elif i==50:\r\n if a>0:\r\n a-=1\r\n b+=1\r\n else:\r\n f = False\r\n break\r\n else:\r\n if b>0 and a>0:\r\n a-=1\r\n b-=1\r\n c+=1\r\n elif a>2:\r\n a-=3\r\n c+=1\r\n else:\r\n f = False\r\n break\r\n\r\nif f:print(\"YES\")\r\nelse:print(\"NO\")\r\n \r\n ", "n=int(input())\r\nli=list(map(int,input().split()))\r\nyes=True\r\na25=0\r\na50=0\r\na100=0\r\nfor i in li:\r\n if i==25:\r\n a25+=1\r\n elif i==50:\r\n if a25>0:\r\n a25-=1\r\n a50+=1\r\n else:\r\n yes=False\r\n break\r\n else:\r\n if a50>0 and a25>0:\r\n a50-=1\r\n a25-=1\r\n elif a25>=3:\r\n a25-=3\r\n else:\r\n yes=False\r\n break\r\nif yes:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def do(clientes):\r\n\trubles25 = 0\r\n\trubles50 = 0\r\n\tfor c in clientes:\r\n\t\tif(c == 25):\r\n\t\t\trubles25 += 1\r\n\t\telif(c == 50):\r\n\t\t\trubles50 += 1\r\n\t\t\trubles25 -= 1\r\n\t\telse:\r\n\t\t\tif(rubles50 == 0):\r\n\t\t\t\trubles25 -= 3\r\n\t\t\telse:\r\n\t\t\t\trubles25 -= 1\r\n\t\t\t\trubles50 -= 1\r\n\t\tif(rubles25 < 0 or rubles50 < 0):\r\n\t\t\tprint(\"NO\")\r\n\t\t\treturn\r\n\tprint(\"YES\")\r\n\treturn\r\nn = int(input())\r\nclientes = list(map(int, input().split()))\r\ndo(clientes)", "\nn = int(input())\n\n\ntikets = list(map(int, input().split()))\n\n\nmoney = [0, 0]\n\nfor ticket in tikets:\n if ticket == 25:\n money[0] += 1\n elif ticket == 50:\n money[1] += 1\n money[0] -= 1\n\n if money[0] < 0:\n print(\"NO\")\n exit()\n else:\n money[0] -= 1\n if money[1] >= 1:\n money[1] -= 1\n else:\n money[0] -= 2\n if money[0] < 0:\n print(\"NO\")\n exit()\n\nprint(\"YES\")\n", "n = int(input())\r\ntickets = list(map(int, input().split()))\r\n\r\nticket_cost = 25\r\nblagajna = [0, 0, 0]\r\n\r\nfor ticket in tickets:\r\n if ticket == 25:\r\n blagajna[0] += 1\r\n elif ticket == 50:\r\n blagajna[0] -= 1\r\n if blagajna[0] < 0:\r\n print(\"NO\")\r\n break\r\n blagajna[1] += 1\r\n else:\r\n if blagajna[1] == 0:\r\n blagajna[0] -= 3\r\n if blagajna[0] < 0:\r\n print(\"NO\")\r\n break\r\n else:\r\n blagajna[1] -= 1\r\n blagajna[0] -= 1\r\n if blagajna[0] < 0:\r\n print(\"NO\")\r\n break\r\n blagajna[2] += 1\r\nelse:\r\n print(\"YES\")", "n=int(input())\r\nl=list(map(int,input().split()))\r\nd = {0:1,25:0,50:0}\r\nf = \"YES\"\r\nfor i in range(n): \r\n if l[i] == 25 : \r\n d[25] += 1 \r\n elif l[i] == 50 : \r\n if d[25] == 0 : \r\n f = \"NO\"\r\n break \r\n d[25] -= 1\r\n d[50] += 1\r\n else : \r\n if d[50] >=1 and d[25] >=1 : \r\n d[25] -= 1\r\n d[50] -= 1\r\n elif d[25] >= 3 : \r\n d[25] -= 3 \r\n else : \r\n f = \"NO\"\r\n break\r\nprint(f)", "input()\r\na = list(map(int, input().split()))\r\n \r\n \r\nm25=0\r\nm50=0\r\nans = 'yes'\r\nfor i in range(len(a)):\r\n if a[i] == 25:\r\n m25 += 1\r\n elif a[i] == 50 and m25>0:\r\n m25 -= 1\r\n m50 += 1\r\n elif a[i] == 50 and m25 == 0:\r\n ans='no'\r\n \r\n break\r\n elif a[i] == 100 and m50>0 and m25>0:\r\n m50 -= 1\r\n m25 -= 1\r\n elif a[i] == 100 and m50 == 0 and m25>2:\r\n m25 -= 3\r\n elif a[i] == 100:\r\n ans='no'\r\n break\r\n \r\nprint(ans.upper())", "input()\r\nl = input().split()\r\nk25 = 0\r\nk50 = 0\r\nfor i in l:\r\n if i == \"50\":\r\n if k25 > 0:\r\n k25 -= 1\r\n else:\r\n print(\"NO\")\r\n break\r\n k50 += 1\r\n elif i == \"100\":\r\n if k25 > 0 and k50 > 0:\r\n k25 -= 1\r\n k50 -= 1\r\n elif k25 > 2:\r\n k25 -= 3\r\n else:\r\n print(\"NO\")\r\n break\r\n else:\r\n k25 += 1\r\nelse:\r\n print(\"YES\")", "n = int(input())\r\nm = list(map(int , input().split()))\r\na=b=c=0\r\n\r\nfor _ in range(n):\r\n i = m[_]\r\n if i==25: a+=1\r\n elif i==50: a,b=a-1,b+1\r\n elif b: a,b=a-1,b-1\r\n else: a-=3\r\n if a<0 or b<0: c=1\r\n\r\nprint(\"YNEOS\"[c::2])", "e=True\r\nn=int(input())\r\nline=input().split()\r\na=0\r\nb=0\r\nfor person in line:\r\n if person==\"25\":\r\n a+=1\r\n elif person==\"50\":\r\n a-=1\r\n b+=1\r\n elif person==\"100\":\r\n if a>=3 and b<=0:\r\n a-=3\r\n elif a>=1 and b>=1:\r\n a-=1\r\n b-=1\r\n else:\r\n a-=3\r\n b-=1\r\n \r\n if a<0 or b<0:\r\n e=False\r\n break\r\n\r\nif e:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n = int(input())\r\nf = 1\r\na = list(map(int,input().split()))\r\nq,w=0,0\r\nfor i in a:\r\n\tif i ==25:q+=1\r\n\telif i==50:q-=1;w+=1\r\n\telse:\r\n\t\tif w>0:w-=1;q-=1\r\n\t\telse:q-=3\r\n\tif q<0:f=0;break\r\nif f==0:print(\"NO\")\r\nelse:print(\"YES\")\r\n", "N = int(input())\r\ncount25, count50, check = 0, 0, True\r\na = list(map(int, input().split()))\r\n\r\nfor i in range(0,N):\r\n if a[i] == 25:\r\n count25 += 1\r\n elif a[i] == 50:\r\n if count25<1:\r\n check = False\r\n else:\r\n count25-=1\r\n count50+=1\r\n\r\n elif a[i] == 100:\r\n if count25>=1 and count50>=1:\r\n count25-=1\r\n count50-=1\r\n\r\n elif count25>=3:\r\n count25-=3\r\n else:\r\n check = False\r\n\r\nif check:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n=int(input())\r\narr=[int(ele)for ele in input().split()]\r\n_two=[]\r\n_five=[]\r\n_hund=[]\r\nfor i in range(n):\r\n if arr[i]==25:\r\n _two.append(arr[i])\r\n elif arr[i]==50:\r\n _five.append(arr[i])\r\n if len(_two)>=1:\r\n _two.pop()\r\n else:\r\n print(\"NO\")\r\n break\r\n else:\r\n _hund.append(arr[i])\r\n if len(_five)!=0 and len(_two)>=1:\r\n _five.pop()\r\n _two.pop()\r\n elif len(_two)>=3:\r\n _two.pop()\r\n _two.pop()\r\n _two.pop()\r\n else:\r\n print(\"NO\")\r\n break\r\nelse:\r\n print(\"YES\")", "import sys, math, itertools, random, bisect\r\nfrom collections import defaultdict\r\nINF = sys.maxsize\r\ndef get_ints(): return map(int, sys.stdin.readline().strip().split())\r\ndef get_array(): return list(map(int, sys.stdin.readline().strip().split()))\r\ndef input(): return sys.stdin.readline().strip()\r\nmod = 10**9 + 7\r\n\r\n\r\nfor _ in range(1):\r\n n = int(input())\r\n a = get_array()\r\n note = [0]*3\r\n flag = True\r\n for i in range(n):\r\n if a[i]==25: note[0] += 1\r\n elif a[i]==50:\r\n if note[0]>0:\r\n note[0] -= 1\r\n note[1] += 1\r\n else:\r\n flag = False\r\n break\r\n else:\r\n if note[1]>0 and note[0]>0:\r\n note[1] -= 1\r\n note[0] -= 1\r\n note[2] += 1\r\n elif note[0]>=3:\r\n note[0] -= 3\r\n note[2] += 1\r\n else:\r\n flag = False\r\n break\r\n if flag: print(\"YES\")\r\n else: print(\"NO\")\r\n\r\n", "n = int(input())\r\narr = list(map(int,input().split()))\r\ncount1 = 0\r\ncount2 = 0\r\nans = \"YES\"\r\nfor i in range(len(arr)) :\r\n if(arr[i] == 25) :\r\n count1 += 1\r\n elif(arr[i] == 50) :\r\n count1 -= 1\r\n count2 += 1\r\n else :\r\n if(count2 > 0) :\r\n count2 -= 1\r\n count1 -= 1\r\n else :\r\n count1 -= 3\r\n if(count1 < 0 or count2 < 0) :\r\n ans = \"NO\"\r\n break\r\nprint(ans)", "# Cinema Line\r\nn = int(input())\r\ns = list(map(int,input().split(\" \")))\r\nflag = False\r\nc25 = 0\r\nc50 = 0\r\nc100 = 0\r\nfor i in range(n):\r\n if s[i] == 25:\r\n c25 += 1\r\n if s[i] == 50:\r\n c25 -= 1\r\n if c25 <0:\r\n flag = True\r\n break\r\n else:\r\n c50 += 1\r\n if s[i] == 100:\r\n if c50 >= 1:\r\n c50 -= 1\r\n c25 -= 1\r\n else:\r\n c25 -= 3\r\n if c25 < 0:\r\n flag = True\r\n break\r\nprint(\"NO\" if flag else \"YES\")", "n = int(input())\nq = [int(x) for x in input().split(\" \")]\n\nnote_dict = {25:0, 50:0, 100:0}\n\npossible = True\n\n\nif(q[0] == 50 or q[0] == 100):\n possible = False \nelse:\n for i in range(n):\n if (q[i] == 25):\n note_dict[25] += 1\n \n elif (q[i] == 50):\n if(note_dict[25] == 0):\n possible = False\n break\n else:\n note_dict[25] -= 1\n note_dict[50] += 1\n \n else:\n if(note_dict[25] == 0):\n possible = False\n break\n \n else:\n if(note_dict[50] != 0):\n note_dict[50] -= 1\n note_dict[25] -= 1\n note_dict[100] += 1\n \n else:\n if(note_dict[25]<3):\n possible = False\n \n else:\n note_dict[25] -= 3\n note_dict[100] += 100\n \nif possible:\n print(\"YES\")\nelse:\n print(\"NO\")\n \t\t \t \t \t \t \t\t \t\t\t \t\t \t\t", "n = int(input())\r\nl = list(map(int,input().split(' ')))\r\n\r\ncan_sell = True\r\ni = 0\r\n\r\nn100 = 0\r\nn25 = 0\r\nn50 = 0\r\n\r\nwhile i <n:\r\n\r\n if l[i] == 25:\r\n n25+=1\r\n elif l[i] == 100:\r\n if n25>=1 and n50>=1:\r\n n100+=1\r\n n25-=1\r\n n50-=1\r\n elif n25 >=3:\r\n n100+=1\r\n n25-=3\r\n else:\r\n can_sell = False\r\n break\r\n elif l[i] == 50:\r\n if n25>=1:\r\n n50+=1\r\n n25-=1\r\n else:\r\n can_sell = False\r\n break\r\n\r\n i+=1\r\n\r\nif can_sell:\r\n print('YES')\r\nelse:\r\n print('NO')", "def can_sell_tickets(n, bills):\r\n cash_balance = {25: 0, 50: 0}\r\n\r\n for bill in bills:\r\n if bill == 25:\r\n cash_balance[25] += 1\r\n elif bill == 50:\r\n cash_balance[50] += 1\r\n cash_balance[25] -= 1\r\n elif bill == 100:\r\n if cash_balance[50] > 0:\r\n cash_balance[50] -= 1\r\n cash_balance[25] -= 1\r\n else:\r\n cash_balance[25] -= 3\r\n\r\n if cash_balance[25] < 0 or cash_balance[50] < 0:\r\n return \"NO\"\r\n\r\n return \"YES\"\r\n\r\nn = int(input())\r\nbills = list(map(int, input().split()))\r\nresult = can_sell_tickets(n, bills)\r\nprint(result)\r\n", "#Problem: https://codeforces.com/problemset/problem/349/A\r\n\r\nn = int(input())\r\nL = list(map(int, input().split()))\r\ntf = 0\r\nf = 0\r\nfor i in range(n):\r\n if L[i] == 25:\r\n tf += 1\r\n elif L[i] == 50:\r\n if tf >= 1:\r\n tf -= 1\r\n f += 1\r\n else:\r\n print(\"NO\")\r\n exit()\r\n else:\r\n if tf >= 1 and f >= 1:\r\n tf -= 1\r\n f -= 1\r\n elif tf >= 3:\r\n tf -= 3\r\n else:\r\n print(\"NO\")\r\n exit()\r\nprint(\"YES\")", "input()\np=q=r=0\nfor i in map(int,input().split()):\n\tif i==25:p+=1\n\telif i==50:p,q=p-1,q+1\n\telif q:p,q=p-1,q-1\n\telse:p-=3\n\tif p<0 or q<0:r=1\nprint('YNEOS'[r::2])\n\n \t \t\t\t\t\t \t \t \t\t\t\t \t\t\t\t\t", "num=int(input())\r\ncustomers=[int(i) for i in input().split()]\r\na,b, c=0,0,0\r\nfor i in range(len(customers)):\r\n if customers[i]==25:\r\n a=a+1 \r\n elif customers[i]==50:\r\n b=b+1\r\n if a>0:\r\n a=a-1\r\n else:\r\n print('NO')\r\n break \r\n else:\r\n c=c+1\r\n if a>0 and b>0:\r\n a=a-1\r\n b=b-1\r\n elif a>=3:\r\n a=a-3\r\n else:\r\n print('NO')\r\n break \r\nelse:\r\n print('YES')", "n=int(input())\r\nlst=list(map(int,input().rstrip().split()))\r\nd={50:0,25:0,100:0}\r\nans=\"YES\"\r\nfor i in lst:\r\n if i==25:\r\n d[i]+=1\r\n elif i==50:\r\n if d[25]>=1:\r\n d[25]-=1\r\n d[50]+=1\r\n else:\r\n ans=\"NO\"\r\n break\r\n else:\r\n if (d[50]>=1 and d[25]>=1) or (d[25]>=3):\r\n if (d[50]>=1 and d[25]>=1):\r\n d[i]+=1\r\n d[50]-=1\r\n d[25]-=1\r\n else:\r\n d[25]-=3\r\n d[i]+=1\r\n\r\n else:\r\n ans=\"NO\"\r\n break\r\nprint(ans)", "def can_sell_tickets(n, bills):\n # Initialize the available change\n change_25 = 0\n change_50 = 0\n \n for bill in bills:\n if bill == 25:\n change_25 += 1\n elif bill == 50:\n if change_25 >= 1:\n change_25 -= 1\n change_50 += 1\n else:\n return \"NO\"\n elif bill == 100:\n if change_50 >= 1 and change_25 >= 1:\n change_50 -= 1\n change_25 -= 1\n elif change_25 >= 3:\n change_25 -= 3\n else:\n return \"NO\"\n \n return \"YES\"\n\n# Input\nn = int(input()) # Number of people\nbills = list(map(int, input().split())) # Values of the bills\n\nresult = can_sell_tickets(n, bills)\nprint(result)\n\n\n\n\n\t \t \t \t \t\t\t\t\t\t \t \t\t \t\t\t\t\t\t", "n = int(input())\r\na = list(map(int, input().split()))\r\nx25 = 0\r\nx50 = 0\r\nfor i in range(n):\r\n if x25 < 0:\r\n break\r\n if a[i] == 25:\r\n x25 += 25\r\n elif a[i] == 50:\r\n x25 -= 25\r\n x50 += 50\r\n elif a[i] == 100:\r\n if x50 > 0:\r\n x50 -= 50\r\n x25 -= 25\r\n else:\r\n x25 -= 75\r\nif x25 < 0:\r\n print('NO')\r\nelse:\r\n print('YES')", "n=int(input())\r\nl=list(map(int,input().split()))\r\nd,f={25:0,50:0},0\r\nfor i in range(n):\r\n\tif l[i]==25:\r\n\t\td[25]+=1\r\n\telif l[i]==50:\r\n\t\tif d[25]>0:\r\n\t\t\td[25]-=1\r\n\t\t\td[50]+=1\r\n\t\telse:\r\n\t\t\tf=1\r\n\t\t\tbreak\r\n\telse:\r\n\t\tif d[50]>0 and d[25]>0:\r\n\t\t\td[50]-=1\r\n\t\t\td[25]-=1\r\n\t\telif d[25]>2:\r\n\t\t\td[25]-=3\r\n\t\telse:\r\n\t\t\tf=1\r\n\t\t\tbreak\r\nprint([\"YES\",\"NO\"][f])", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\nw = input()[:-1].split()\r\nb, c = 0, 0\r\nfor i in range(n):\r\n if w[i] == '25':\r\n c += 1\r\n elif w[i] == '50':\r\n b += 1\r\n c -= 1\r\n else:\r\n if b > 0:\r\n b -= 1\r\n c -= 1\r\n else:\r\n c -= 3\r\n if c < 0 or b < 0:\r\n print(\"NO\")\r\n break\r\nelse:\r\n print(\"YES\")\r\n", "t=int(input())\r\n \r\ntotal_bills=list(map(int,input().split()))\r\nchange25=0\r\nchange50=0\r\ncount=0\r\n \r\nfor bill in total_bills:\r\n if (bill==25):\r\n change25+=1\r\n elif (bill == 50):\r\n if (change25 >= 1):\r\n change25 -= 1\r\n change50 += 1\r\n else:\r\n print(\"NO\")\r\n count=1\r\n break\r\n elif (bill == 100):\r\n if (change50 >= 1 and change25 >= 1):\r\n change50 -= 1\r\n change25 -= 1\r\n elif (change25 >= 3):\r\n change25 -= 3\r\n else:\r\n print(\"NO\")\r\n count=1\r\n break\r\n\r\nif(count==0):\r\n print(\"YES\")\r\n \r\n\r\n ", "n = int(input())\r\na = list(map(int, input().split()))\r\nb = [0, 0, 0]\r\nfor i in range(n):\r\n if a[i] == 25:\r\n b[0] += 1\r\n elif a[i] == 50:\r\n b[1] += 1\r\n if b[0] > 0:\r\n b[0] -= 1\r\n else:\r\n print(\"NO\")\r\n exit()\r\n elif a[i] == 100:\r\n b[2] += 1\r\n if b[1] > 0 and b[0] > 0:\r\n b[1] -= 1\r\n b[0] -= 1\r\n elif b[0] > 2:\r\n b[0] -= 3\r\n else:\r\n print(\"NO\")\r\n exit()\r\nprint(\"YES\")", "n = int(input())\r\nline = list(map(int, input().split()))\r\ncurr = 0\r\ntrack = {25: 0, 50: 0, 100: 0}\r\nfor i in line:\r\n track[i] += 1\r\n change = i - 25\r\n if(change == 75):\r\n if(track[50] > 0 and track[25] > 0):\r\n track[50] -= 1\r\n track[25] -= 1\r\n elif(track[25] >= 3):\r\n track[25] -= 3\r\n else:\r\n print(\"NO\")\r\n break\r\n if(change == 50):\r\n if(track[50] > 0):\r\n track[50] -= 1\r\n elif(track[25] >= 2):\r\n track[25] -= 2\r\n else:\r\n print(\"NO\")\r\n break\r\n if(change == 25):\r\n if(track[25] > 0):\r\n track[25] -= 1\r\n else:\r\n print(\"NO\")\r\n break\r\n\r\n\r\nelse:\r\n print(\"YES\")", "input()\r\ncnt_25 = 0\r\ncnt_50 = 0\r\n\r\nfor i in map(int, input().split()):\r\n\r\n if i == 25:\r\n cnt_25 += 1\r\n\r\n elif i == 50 and cnt_25 >= 1:\r\n cnt_25 -= 1\r\n cnt_50 += 1\r\n\r\n elif i == 100 and cnt_50 >= 1 and cnt_25 >= 1:\r\n cnt_25 -= 1\r\n cnt_50 -= 1\r\n\r\n elif i == 100 and cnt_25 >= 3:\r\n cnt_25 -= 3\r\n\r\n else:\r\n print(\"NO\")\r\n break\r\n\r\nelse:\r\n print(\"YES\")\r\n", "def fail_fn():\r\n print('NO')\r\n exit()\r\n\r\nn = int(input())\r\ncustomers = [int(x) for x in input().split(' ')]\r\ncount25, count50 = 0, 0\r\nfor i in range(len(customers)):\r\n if customers[i] == 25:\r\n count25 += 1\r\n elif customers[i] == 50:\r\n if count25 >= 1:\r\n count50 += 1\r\n count25 -= 1\r\n else:\r\n fail_fn()\r\n else:\r\n if count50 >= 1 and count25 >= 1:\r\n count50 -= 1\r\n count25 -= 1\r\n elif count25 >= 3:\r\n count25 -= 3\r\n else:\r\n fail_fn()\r\nprint('YES')\r\n", "n = int(input())\r\narr = list(map(int,input().split()))\r\ntwe , fif , hun = 0 , 0 , 0 \r\nfor i in range(n):\r\n if arr[i] == 50:\r\n if twe > 0:\r\n twe -= 1\r\n fif += 1\r\n else:\r\n print(\"NO\")\r\n break\r\n elif arr[i] == 100:\r\n if twe > 0:\r\n if fif > 0:\r\n fif -= 1\r\n twe -= 1\r\n hun += 1\r\n else:\r\n if twe >= 3:\r\n twe -= 3\r\n hun += 1\r\n else:\r\n print(\"NO\")\r\n break\r\n else:\r\n print(\"NO\")\r\n break\r\n else:\r\n twe += 1\r\n\r\nelse:\r\n print(\"YES\")\r\n\r\n \r\n \r\n\r\n\r\n\r\n\r\n", "import sys\r\ndef out():\r\n print('NO')\r\n sys.exit()\r\ninput()\r\na=b=0\r\nfor i in map(int,input().split()):\r\n if i==25:\r\n a+=1\r\n elif i==50:\r\n if a>0:\r\n a-=1\r\n b+=1\r\n else:\r\n out()\r\n else:\r\n if b>0 and a>0:\r\n a-=1\r\n b-=1\r\n elif a>2:\r\n a-=3\r\n else:\r\n out()\r\nprint('YES')", "n = int(input())\r\nden = [eval(i) for i in input().split()]\r\n\r\nnum_of_25s = 0\r\nnum_of_50s = 0\r\nnum_of_100s = 0\r\n\r\nis_it = 1\r\n\r\nfor i in den:\r\n if i == 25:\r\n num_of_25s += 1\r\n if i == 50:\r\n num_of_50s += 1\r\n if i == 100:\r\n num_of_100s += 1\r\n\r\n if i == 50:\r\n if num_of_25s > 0:\r\n num_of_25s -= 1\r\n else:\r\n is_it = 0\r\n break\r\n if i == 100:\r\n if num_of_50s > 0 and num_of_25s > 0:\r\n num_of_50s -= 1\r\n num_of_25s -= 1\r\n elif num_of_25s >= 3:\r\n num_of_25s -= 3\r\n else:\r\n is_it = 0\r\n break\r\n\r\nif is_it:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "\r\nn = int(input())\r\ns = list(map(int, input().split(\" \")))\r\n\r\nmoney = [0,0,0]\r\nrs = True\r\nfor i in range(len(s)):\r\n if(s[i] == 25):\r\n money[0] += 1\r\n elif(s[i] == 50 and money[0] > 0):\r\n money[1] += 1\r\n money[0] -= 1\r\n elif(s[i] == 100):\r\n if((money[1] > 0 and money[0] > 0)):\r\n money[2] += 1\r\n money[1] -= 1\r\n money[0] -= 1\r\n elif(money[0] > 2):\r\n money[0] -= 3\r\n else:\r\n rs = False\r\n break\r\n else:\r\n rs = False\r\n\r\nif(rs):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\nc25=0;\r\nc50=0;\r\nj=0\r\nfor i in range(n):\r\n if l[i]==25:\r\n c25+=1\r\n else:\r\n if l[i]==50:\r\n if c25>=1:\r\n c25-=1\r\n c50+=1\r\n else:\r\n j=j+1\r\n elif l[i]==100:\r\n if c50>=1 and c25>=1:\r\n c50-=1\r\n c25-=1\r\n elif c25>=3:\r\n c25-=3\r\n else:\r\n j=j+1\r\nif j>=1:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "n = int(input())\r\nbills = list(map(int, input().split()))\r\nchange = [0, 0]\r\nf = 0\r\nfor i in bills:\r\n if i == 100:\r\n if change[1] >= 1 and change[0] >= 1:\r\n change[0] -= 1\r\n change[1] -= 1\r\n elif change[0] >= 3:\r\n change[0] -= 3\r\n else:\r\n print(\"NO\")\r\n f = 1\r\n break\r\n if i == 50:\r\n if change[0] >= 1:\r\n change[0] -= 1\r\n change[1] += 1\r\n else:\r\n print(\"NO\")\r\n f = 1\r\n break\r\n if i == 25:\r\n change[0] += 1\r\nif f == 0:\r\n print(\"YES\")\r\n", "n=int(input())\r\nx=list(map(int, input().split()))\r\na=0\r\nb=0\r\nfor i in x:\r\n if i==25:\r\n a+=1\r\n elif i==50:\r\n b+=1\r\n a-=1\r\n else:\r\n if b>0:\r\n b-=1\r\n a-=1\r\n else:\r\n a-=3\r\n if(min(a,b)<0):\r\n print(\"NO\")\r\n break\r\nelse:\r\n print(\"YES\")", "input()\r\ns=[int(i) for i in input().split()]\r\nd={25:0, 50:0, 100:0}\r\nfor i in s:\r\n d[i]+=1\r\n if i==50:\r\n d[25]-=1\r\n elif i==100:\r\n d[25]-=1\r\n if d[50]:\r\n d[50]-=1\r\n else:\r\n d[25]-=2\r\n if any(i<0 for i in d.values()):\r\n print('NO')\r\n break\r\nelse:\r\n print('YES')", "import sys\nn = int(input())\nline = list(map(int,input().split()))\nr = 0\nw = 0\nfor i in range(n):\n if line[i] == 25:\n r += 1\n elif line[i] == 50:\n r -= 1\n w += 1\n else:\n if w > 0 :\n w -= 1\n r -= 1\n else: r -= 3\n if r < 0:\n print(\"NO\")\n sys.exit()\nprint(\"YES\")\n\t\t \t \t\t \t \t \t\t \t\t \t \t\t\t\t", "n=int(input())\r\ns=str(input()).split()\r\ns=[int(u) for u in s]\r\nsumm=[0,0,0]\r\nans=0\r\nfor i in range(len(s)):\r\n if s[i]==100 and (summ[1]>0 and summ[2]>0):\r\n ans='YES'\r\n summ[0]+=1\r\n summ[1]-=1\r\n summ[2]-=1\r\n elif s[i]==100 and (summ[1]==0 and summ[2]>2):\r\n ans='YES'\r\n summ[0]+=1\r\n summ[2]-=3\r\n elif s[i]==50 and summ[2]>0:\r\n ans='YES'\r\n summ[1]+=1\r\n summ[2]-=1\r\n elif s[i]==25:\r\n ans='YES'\r\n summ[2]+=1\r\n else:\r\n ans='NO'\r\n break\r\nprint(ans)\r\n \r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\na=0\r\nf=0\r\nb=0\r\nfor x in l:\r\n\tif x==25:\r\n\t\ta+=1\r\n\telif x==50:\r\n\t\tif a>0:\r\n\t\t\ta-=1\r\n\t\t\tb+=1\r\n\t\telse:\r\n\t\t\tf=1\r\n\t\t\tbreak\r\n\telse:\r\n\t\tif a>2 or (b>0 and a>0):\r\n\t\t\tif b>0:\r\n\t\t\t\tb-=1\r\n\t\t\t\ta-=1\r\n\t\t\telse:\r\n\t\t\t\ta-=3\r\n\t\telse:\r\n\t\t\tf=1\r\n\t\t\tbreak\r\nif f==1:\r\n\tprint(\"NO\")\r\nelse:\r\n\tprint(\"YES\")", "n = int(input())\r\narr = list(map(int, input().split()))\r\nh = {\r\n 25 : 0,\r\n 50 : 0,\r\n 100 : 0\r\n }\r\nfor i in range(n):\r\n h[arr[i]] += 1\r\n change = arr[i] - 25\r\n if change == 25:\r\n if h[25] > 0:\r\n h[25] -= 1\r\n continue\r\n else:\r\n print(\"NO\")\r\n break\r\n elif change == 75:\r\n if h[25] > 0 and h[50] > 0:\r\n h[25] -= 1\r\n h[50] -= 1\r\n continue\r\n elif h[25] > 2:\r\n h[25] -= 3\r\n continue\r\n else:\r\n print(\"NO\")\r\n break\r\nelse:\r\n print(\"YES\")", "n = int(input())\r\nbills = list(map(int, input().split()))\r\n\r\nbill25=0\r\nbill50=0\r\nbill100=0\r\n\r\nans = 1\r\n\r\nfor i in bills:\r\n if i == 25:\r\n bill25+=1\r\n if i == 50:\r\n bill50+=1\r\n if bill25 == 0:\r\n ans=0\r\n break \r\n bill25 -= 1\r\n if i == 100:\r\n bill100+=1\r\n if(bill50 >= 1 and bill25 >= 1):\r\n bill50 -= 1\r\n bill25 -= 1\r\n elif(bill50 == 0 and bill25 >= 3):\r\n bill25 -= 3\r\n else:\r\n ans = 0\r\n break \r\nif(ans):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "#!/usr/bin/env python3\n\nif __name__ == \"__main__\":\n\tn = int(input())\n\tais = list(map(int, input().split()))\n\tcurr = {25:0, 50:0, 100:0}\n\tf = 0\n\tfor i in range(n):\n\t\tif ais[i] == 25:\n\t\t\tcurr[25] += 1\n\t\telif ais[i] == 50:\n\t\t\tif curr[25]<=0:\n\t\t\t\tf = 1\n\t\t\t\tbreak\n\t\t\telse:\n\t\t\t\tcurr[25] -= 1\n\t\t\t\tcurr[50] += 1\n\t\telif ais[i] == 100:\n\t\t\tif curr[50] > 0 and curr[25] > 0:\n\t\t\t\tcurr[50] -= 1\n\t\t\t\tcurr[25] -= 1\n\t\t\t\tcurr[100] += 100\n\t\t\telif curr[50] <= 0 and curr[25] > 2:\n\t\t\t\tcurr[25] -= 3\n\t\t\t\tcurr[100] += 1\n\t\t\telse:\n\t\t\t\tf = 1\n\t\t\t\tbreak\n\tif f==0:\n\t\tprint(\"YES\")\n\telse:\n\t\tprint(\"NO\")\n", "\r\nn = int(input())\r\na = list(map(int, input().split()))\r\nb = [0, 0, 0, 0]\r\nfor i in a:\r\n if i == 50:\r\n if b[0]:\r\n b[0]-=1\r\n else:\r\n print('NO')\r\n break\r\n elif i == 100:\r\n if b[0] >= 1 and b[1] >= 1:\r\n b[0] -= 1\r\n b[1] -= 1\r\n elif b[0] >= 3:\r\n b[0] -= 3\r\n else:\r\n print('NO')\r\n break\r\n b[i//25-1] += 1;\r\nelse:\r\n print('YES')\r\n", "a = int(input())\r\nb = list(map(int , input().split()))\r\narr = [0 for i in range(3)]\r\nfor i in range(a):\r\n if b[i] == 25:\r\n arr[0] += 1\r\n elif b[i] == 50:\r\n if arr[0] >= 1:\r\n arr[0] -= 1\r\n arr[1] += 1\r\n else:\r\n print(\"NO\")\r\n break\r\n elif b[i] == 100:\r\n if arr[1] >= 1 and arr[0] >= 1:\r\n arr[1] -= 1\r\n arr[0] -= 1\r\n elif arr[0] >= 3:\r\n arr[0] -= 3\r\n else:\r\n print(\"NO\")\r\n break\r\nelse:\r\n print(\"YES\")", "n=int(input())\r\nlist1=[int(x) for x in input().split()]\r\na=0\r\nb=0\r\nflag=0\r\nfor i in list1:\r\n if i==25:\r\n a+=1\r\n elif i==50:\r\n a-=1\r\n b+=1\r\n elif b:\r\n a,b=a-1,b-1\r\n else:\r\n a-=3\r\n if a<0 or b<0:\r\n flag=1\r\n break\r\nif flag==1:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n \r\n \r\n \r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\nn25=0\r\nn50=0\r\nfor i in range(n):\r\n if a[i]==25:\r\n n25+=1\r\n elif a[i]==50 and n25>0:\r\n n25-=1\r\n n50+=1\r\n elif a[i]==100 and n50>0 and n25>0:\r\n n25-=1\r\n n50-=1\r\n elif a[i]==100 and n25>2:\r\n n25-=3\r\n else:\r\n print(\"NO\")\r\n exit(0)\r\nprint(\"YES\")", "\r\ndef answer(n, a):\r\n r25 = 0\r\n r50 = 0\r\n r100 = 0\r\n for i in range(n):\r\n if a[i] == 25:\r\n r25 += 1\r\n elif a[i] == 50:\r\n r50 += 1\r\n r25 -= 1\r\n else: #a[i] == 100\r\n r100 += 1\r\n if r50 >= 1:\r\n r50 -= 1\r\n r25 -= 1\r\n else:\r\n r25 -= 3\r\n if r25 < 0 or r50 < 0:\r\n return 'NO'\r\n \r\n\r\n return 'YES'\r\n\r\ndef main():\r\n n = int(input())\r\n a = [int(i) for i in input().split()]\r\n print(answer(n, a))\r\n\r\n\r\nmain()", "def can_sell_tickets(n, bills):\n twenty_fives = 0\n fifties = 0\n \n for bill in bills:\n if bill == 25:\n twenty_fives += 1\n elif bill == 50:\n if twenty_fives >= 1:\n twenty_fives -= 1\n fifties += 1\n else:\n return False\n elif bill == 100:\n if fifties >= 1 and twenty_fives >= 1:\n fifties -= 1\n twenty_fives -= 1\n elif twenty_fives >= 3:\n twenty_fives -= 3\n else:\n return False\n \n return True\n\n\nn = int(input())\nbills = list(map(int, input().split()))\n\n\nif can_sell_tickets(n, bills):\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", "import math\r\n\r\n\r\ndef main_function():\r\n n = int(input())\r\n c = [int(i) for i in input().split(\" \")]\r\n cupons = [0, 0, 0]\r\n is_answer_given = False\r\n for i in c:\r\n if i == 25:\r\n cupons[0] += 1\r\n elif i == 50:\r\n cupons[1] += 1\r\n if cupons[0] == 0:\r\n is_answer_given = True\r\n print(\"NO\")\r\n break\r\n else:\r\n cupons[0] -= 1\r\n else:\r\n cupons[2] += 1\r\n if cupons[0] > 0 and cupons[1] > 0:\r\n cupons[0] -= 1\r\n cupons[1] -= 1\r\n elif cupons[0] > 2:\r\n cupons[0] -= 3\r\n else:\r\n is_answer_given = True\r\n print(\"NO\")\r\n break\r\n if not is_answer_given:\r\n print(\"YES\")\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\nmain_function()", "try:\r\n test_case = int(input())\r\n currency_25 = 0\r\n currency_50 = 0\r\n currency_100 = 0\r\n line = list(map(int, input().split()))\r\n check = 1\r\n for i in range(test_case):\r\n if line[i] == 25:\r\n currency_25 += 1\r\n elif line[i] == 50:\r\n if currency_25 > 0:\r\n currency_50 += 1\r\n currency_25 -= 1\r\n else:\r\n check = 0\r\n elif line[i] == 100:\r\n if currency_50 > 0 and currency_25 > 0:\r\n currency_100 += 1\r\n currency_50 -= 1\r\n currency_25 -= 1\r\n elif currency_50 == 0 and currency_25 >= 3:\r\n currency_100 += 1\r\n currency_25 -= 3\r\n else:\r\n check = 0\r\n if check == 0:\r\n print(\"NO\")\r\n else:\r\n print(\"YES\")\r\nexcept:\r\n pass", "n = int(input())\r\nflag = 1\r\narray = list(map(int, input().split()))\r\nq, w = 0, 0\r\nfor i in array:\r\n if i == 25:\r\n q += 1\r\n elif i == 50:\r\n q -= 1\r\n w += 1\r\n else:\r\n if w > 0:\r\n w -= 1\r\n q -= 1\r\n else:\r\n q -= 3\r\n if q < 0:\r\n flag = 0\r\n break\r\nif flag == 0:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n", "# /**\r\n# * author: brownfox2k6\r\n# * created: 16/05/2023 22:39:11 Hanoi, Vietnam\r\n# **/\r\n\r\nd = {\r\n 25: 0,\r\n 50: 0,\r\n 100: 0\r\n}\r\ninput()\r\nfor x in map(int, input().split()):\r\n if x == 25:\r\n d[25] += 1\r\n elif x == 50:\r\n if d[25] >= 1:\r\n d[25] -= 1\r\n d[50] += 1\r\n else:\r\n print(\"NO\")\r\n exit()\r\n else:\r\n d[100] += 1\r\n if d[50] >= 1 and d[25] >= 1:\r\n d[50] -= 1\r\n d[25] -= 1\r\n elif d[50] == 0 and d[25] >= 3:\r\n d[25] -= 3\r\n else:\r\n print(\"NO\")\r\n exit()\r\n\r\nprint(\"YES\")", "n=int(input())\r\nl=list(map(int,input().split()))\r\ne=1\r\nd=25\r\n\r\na25=0\r\na50=0\r\na100=0\r\nfor i in range(n):\r\n if(l[i]==25):\r\n a25=a25+1\r\n elif(l[i]==50):\r\n if(a25<=0):\r\n e=0\r\n break\r\n a25=a25-1\r\n a50=a50+1\r\n else:\r\n if(a25<=0):\r\n e=0\r\n break\r\n if(a50<=0):\r\n if(a25<3):\r\n e=0\r\n break\r\n a25=a25-3\r\n a100=a100+1\r\n else:\r\n a50=a50-1\r\n a25=a25-1\r\n a100=a100+1\r\nif(e==1):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Fri Jun 4 21:30:00 2021\r\n\r\n@author: Bruger\r\n\"\"\"\r\n\r\n\r\n\r\nind = int(input())\r\n\r\n\r\ngen = iter(map(int, input().split()))\r\n\r\n\r\n\r\npay = {\"25\" : 0, \"50\" : 0, \"100\" : 0}\r\n\r\n\r\n\r\nanwser = \"YES\"\r\n\r\nfor i in gen:\r\n if i == 25:\r\n pay[\"25\"] += 1\r\n elif i == 50:\r\n if pay.get(\"25\") == 0:\r\n anwser = \"NO\"\r\n break\r\n else:\r\n pay[\"25\"] -= 1\r\n pay[\"50\"] += 1\r\n else:\r\n if pay.get(\"50\") >= 1 and pay.get(\"25\") >= 1:\r\n pay[\"25\"] -= 1\r\n pay[\"50\"] -= 1\r\n pay[\"100\"] += 1\r\n elif pay.get(\"25\") >= 3:\r\n pay[\"25\"] -= 3\r\n pay[\"100\"] += 1\r\n else:\r\n anwser = \"NO\"\r\n break\r\n \r\nprint(anwser)\r\n\r\n\r\n\r\n", "n=int(input())\nticket=list(map(int,input().split()))\nmoney_25=0\nmoney_50=0\nfor i in ticket:\n\tif i==25:\n\t\tmoney_25+=1\n\telif i==50:\n\t\tif money_25>0:\n\t\t\tmoney_25-=1\n\t\t\tmoney_50+=1\n\t\telse:\n\t\t\tprint(\"NO\")\n\t\t\tbreak\n\n\telif i==100:\n\t\tif money_50>0 and money_25>0:\n\t\t\tmoney_50-=1\n\t\t\tmoney_25-=1\n\t\telif money_25>=3:\n\t\t\tmoney_25-=3\n\t\telse:\n\t\t\tprint(\"NO\")\n\t\t\tbreak\nelse:\n\tprint(\"YES\")", "import sys\ninput = sys.stdin.readline\n\nL = int(input())\nA = list(map(int, input().split()))\n\nbill25, bill50 = 0, 0\nfor bill in A :\n\tif bill == 25 : bill25 += 1\n\telif bill == 50 :\n\t\tbill50 += 1\n\t\tif bill25 >= 1 : bill25 -= 1\n\t\telse :\n\t\t\tprint(\"NO\")\n\t\t\texit(0)\n\t\t\t\n\telse :\n\t\tif bill50 >= 1 and bill25 >= 1 : bill50-=1; bill25-=1\n\t\telif bill25 >= 3 : bill25 -= 3\n\t\telse :\n\t\t\tprint(\"NO\")\n\t\t\texit(0)\nprint(\"YES\")", "leftover=[0,0]\r\nn=int(input())\r\narr=list(map(int,input().split()))\r\n\r\n\r\nfor i in arr:\r\n if i==25:\r\n leftover[0]+=1\r\n elif i==50:\r\n leftover[1]+=1\r\n leftover[0]-=1\r\n else:\r\n if leftover[1]!=0:\r\n leftover[1]-=1\r\n leftover[0]-=1\r\n else:\r\n leftover[0]-=3\r\n\r\n if leftover[0]<0 or leftover[1]<0:\r\n print(\"NO\")\r\n break\r\n\r\nelse:\r\n print(\"YES\")", "n=int(input())\r\na=list(map(int,input().split()))\r\nn_25=n_50=n_100=0\r\nfor x in range(n):\r\n\tif a[x]==25:n_25+=1\r\n\telif a[x]==50:\r\n\t\tif n_25==0:\r\n\t\t\tprint('NO')\r\n\t\t\tbreak\r\n\t\telse:\r\n\t\t\tn_25-=1\r\n\t\t\tn_50+=1\r\n\telse:\r\n\t\tif n_50>0 and n_25>0:\r\n\t\t\tn_100+=1\r\n\t\t\tn_25-=1\r\n\t\t\tn_50-=1\r\n\t\telif n_25>=3:\r\n\t\t\tn_25-=3\r\n\t\t\tn_100+=1\r\n\t\telse:\r\n\t\t\tprint('NO')\r\n\t\t\tbreak\r\nelse:\r\n\tprint('YES')", "n = int(input())\r\nline = list(map(int,input().split()))\r\nc_25,c_50 = 0,0\r\n\r\nfor i in line:\r\n if i==25:\r\n c_25+=1\r\n elif i==50:\r\n if c_25>=1:\r\n c_25-=1\r\n c_50+=1\r\n elif c_25==0:\r\n ans = \"NO\"\r\n break\r\n else:\r\n ans= \"NO\"\r\n break\r\n elif i==100:\r\n if c_50>=1 and c_25>=1:\r\n c_50-=1\r\n c_25-=1\r\n \r\n elif c_25>=3:\r\n c_25-=3\r\n \r\n else:\r\n ans = \"NO\"\r\n break\r\nelse:\r\n ans = \"YES\"\r\nprint(ans)\r\n", "n1 = int(input())\r\nx = input().split()\r\nlist1 = []\r\nfor i in x:\r\n list1.append(int(i))\r\ntwentyfive_notes = 0\r\nfifty_notes = 0\r\nflag = 0\r\nfor i in range(n1):\r\n if list1[i] == 25:\r\n twentyfive_notes+=1\r\n continue\r\n if list1[i] == 50:\r\n if twentyfive_notes > 0:\r\n twentyfive_notes-=1\r\n fifty_notes+=1\r\n continue\r\n else:\r\n flag+=1\r\n break\r\n if list1[i] == 100:\r\n if twentyfive_notes > 0 and fifty_notes > 0:\r\n twentyfive_notes-=1\r\n fifty_notes-=1\r\n continue\r\n if twentyfive_notes > 2:\r\n twentyfive_notes -= 3\r\n continue\r\n else:\r\n flag += 1\r\n break\r\n\r\nif flag == 1:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n ", "n = int(input())\r\na = [int(i) for i in input().split()]\r\nq = 0\r\nh = 0\r\nr = 0\r\nfor i in range(n):\r\n if a[i] == 25:\r\n q += 1\r\n if a[i] == 50:\r\n q -= 1\r\n h += 1\r\n if a[i] == 100:\r\n if h > 0:\r\n h -= 1\r\n q -= 1\r\n else:\r\n q -= 3\r\n if q < 0:\r\n r = 1\r\nif r == 1:\r\n print('NO')\r\nelse:\r\n print('YES')\r\n\r\n", "import sys\r\ninput = sys.stdin.readline\r\nfrom collections import defaultdict\r\nn=int(input())\r\na=list(map(int, input().split()))\r\ncount=defaultdict(int)\r\n\r\nfor i in range(n):\r\n count[a[i]]+=1\r\n if a[i]==50 and count[25]!=0:\r\n count[25]-=1\r\n elif a[i]==100 and count[50]>0 and count[25]>0:\r\n count[25]-=1\r\n count[50]-=1\r\n elif a[i]==100 and count[25]>2:\r\n count[25]-=3\r\n elif a[i]!=25:\r\n print('NO')\r\n break\r\nelse:\r\n print('YES')\r\n", "n = int(input())\r\nl = list(map(int,input().split()))\r\nif(l[0]==50 or l[0]==100):\r\n print(\"NO\")\r\nelse:\r\n fg = 0\r\n s = 0\r\n d=0\r\n for i in l:\r\n if i==25:\r\n s+=1\r\n elif i==50:\r\n if(s):\r\n s-=1\r\n d+=1\r\n else:\r\n fg = 1\r\n break\r\n else:\r\n if(s>=1 and d>=1):\r\n s-=1\r\n d-=1\r\n elif(s>=3):\r\n s-=3\r\n else:\r\n fg=1\r\n break\r\n if(fg):\r\n print(\"NO\")\r\n else:\r\n print(\"YES\")\r\n\r\n", "n=int(input())\r\nl=list(map(int,input().split(\" \")))\r\nd={}\r\nflag=True\r\nfor i in l:\r\n if(i==25):\r\n d[25]=d.get(25,0)+1\r\n elif(i==50):\r\n if(25 in d.keys() and d[25]>=1):\r\n d[25]=d[25]-1\r\n d[50]=d.get(50,0)+1\r\n else:\r\n flag=False\r\n break\r\n elif(i==100):\r\n if(50 in d.keys() and 25 in d.keys() and d[25]>=1 and d[50]>=1):\r\n d[25]=d[25]-1\r\n d[50]=d[50]-1\r\n elif(25 in d.keys() and d[25]>=3):\r\n d[25]=d[25]-3\r\n else:\r\n flag=False\r\n break\r\nval=\"YES\" if flag==True else \"NO\"\r\nprint(val)\r\n", "a = int(input())\r\ns = list(map(int, input().split()))\r\nk25 = 0\r\nk50 = 0\r\nk100 = 0\r\nfor i in s:\r\n fl = True\r\n if i == 25:\r\n k25 += 1\r\n elif i == 50:\r\n k50 += 1\r\n k25 -= 1\r\n if k25 < 0:\r\n fl = False\r\n break\r\n elif i == 100:\r\n k100 += 1\r\n if k25 >= 1 and k50 >= 1:\r\n k25 -= 1\r\n k50 -= 1\r\n elif k50 == 0 and k25 >= 3:\r\n k25 -= 3\r\n else:\r\n fl = False\r\n break\r\nif fl == False:\r\n print('NO')\r\nelse:\r\n print('YES')", "b25 = 0\r\nb50 = 0\r\nflag = True\r\n\r\nn = int(input())\r\narr = input().split()\r\n\r\nfor i in range(n):\r\n if(int(arr[i]) == 25):\r\n b25 += 1\r\n continue\r\n elif(int(arr[i]) == 50):\r\n b50 += 1\r\n b25 -= 1\r\n if(b25 < 0):\r\n flag = False\r\n break\r\n else:\r\n b25 -= 1\r\n if(b50 > 0): b50 -= 1\r\n else: b25 -= 2\r\n if(b25 < 0):\r\n flag = False\r\n break\r\n\r\nif (flag):\r\n print('YES')\r\nelse:\r\n print('NO')", "def cinema(array):\r\n n_25=0\r\n n_50=0\r\n for i in array:\r\n if i==25:\r\n n_25+=1\r\n elif i==50:\r\n if n_25<=0:return\"NO\"\r\n else:\r\n n_25-=1\r\n n_50+=1\r\n elif i==100:\r\n if (n_25>=3)or(n_50>=1 and n_25>=1):\r\n if n_50>=1and n_25>=1:\r\n n_50-=1\r\n n_25-=1\r\n else:n_25-=3\r\n else:return\"NO\"\r\n return\"YES\"\r\n \r\nn=int(input())\r\narray=list(map(int,input().split(\" \")))\r\nprint(cinema(array))", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Tue Nov 7 10:13:31 2023\r\n\r\n@author: lakne\r\n\"\"\"\r\n\r\nn = int(input())\r\n\r\nmoney = input().split()\r\n\r\nx = 0\r\ny = 0\r\n\r\nfor i in range(n):\r\n if int(money[i]) == 25:\r\n x += 1\r\n elif int(money[i]) == 50:\r\n y += 1\r\n x -= 1\r\n elif int(money[i]) == 100:\r\n if y > 0:\r\n y -= 1\r\n x -= 1\r\n elif x > 2:\r\n x -= 3\r\n else:\r\n print(\"NO\")\r\n break\r\n if x < 0 or y < 0:\r\n print(\"NO\")\r\n break\r\n if i == (n-1):\r\n print(\"YES\")", "n = int(input())\r\nl = list(map(str, input().split()))\r\nd = {'25':0, '50':0, '100':0}\r\nflag = True\r\nfor x in l:\r\n if x == '25': pass\r\n elif x == '50'and (d['25'] - 1) >= 0: d['25'] -= 1\r\n elif x == '100' and (d['50'] >= 1 and d['25'] >= 1): d['50'] -= 1; d['25'] -= 1\r\n elif x == '100' and (d['25'] >= 3): d['25'] -= 3\r\n else: flag = False\r\n d[x] += 1\r\n## print(flag, d)\r\n \r\n\r\nprint('YNEOS'[flag == False::2])\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\ndef solve(a):\r\n twfives = 0; fifiz = 0\r\n for i in a:\r\n if i == 25: twfives += 1\r\n elif i == 50:\r\n if twfives>0: twfives -= 1; fifiz += 1\r\n else: return 0\r\n else:\r\n if twfives>0 and fifiz>0: twfives-=1;fifiz-=1\r\n elif fifiz == 0 and twfives >=3: twfives-=3\r\n else: return 0\r\n return 1\r\nif solve(a): print(\"YES\")\r\nelse: print(\"NO\")", "b25 = 0\r\nb50 = 0\r\nn = int(input())\r\na = list(map(int, input().split()))\r\ns = 0\r\nfor i in range(n):\r\n if a[i] == 25:\r\n b25 += 1\r\n if a[i] == 50:\r\n b50 += 1\r\n b25 -= 1\r\n elif a[i] == 100:\r\n if b50 >= 1 and b25 >= 1:\r\n b50 -= 1\r\n b25 -= 1\r\n else:\r\n b25 -= 3\r\n if b25 < 0 or b50 < 0:\r\n print('NO')\r\n s = -1\r\n break\r\nif s == 0:\r\n print('YES')\r\n", "n=int(input())\r\na,b=0,0\r\nx=list(map(int,input().split()))\r\nk=True\r\nfor i in x:\r\n if i==25:\r\n a+=1\r\n if i==50:\r\n b+=1\r\n a-=1\r\n if a<0:\r\n k=False\r\n break\r\n if i==100:\r\n if b>=1 and a>=1:\r\n b-=1\r\n a-=1\r\n elif a>=3:\r\n a-=3\r\n else:\r\n k=False\r\n break\r\nif k:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "people=int(input())\r\nval=input().split(\" \")\r\nval=list(map(lambda x:int(x),val))\r\nchange={25:0,50:0,100:0}\r\nreq_notes={25:0,50:0,100:0}\r\nchanges=[50,25]\r\nflag=0\r\nfor x in val:\r\n change[x]+=1\r\n amt=x-25\r\n for j in changes:\r\n req_notes[j]=min(change[j],amt//j)\r\n amt-=req_notes[j]*j\r\n if amt==0:\r\n break\r\n if amt==0:\r\n for c in change:\r\n change[c]-=req_notes[c]\r\n for d in req_notes:\r\n req_notes[d]=0\r\n continue\r\n else:\r\n print(\"NO\")\r\n flag+=1\r\n break\r\nif flag==0:\r\n print(\"YES\") ", "n=int(input())\nl=list(map(int,input().split()))\nt=0\nf=0\nh=0\nflag=False\nfor i in range(n):\n if l[i]==25:\n t+=1\n elif l[i]==50:\n f+=1\n t-=1\n elif l[i]==100:\n h+=1\n if f>0 and t>0:\n f-=1\n t-=1\n else:\n t-=3\n# print('there are',t,' t',f,' f',h,' h')\n if t<0 or f<0 or h<0:\n flag=True\n break\nif flag:\n print('NO')\nelse:\n print('YES')\n \n", "n=int(input())\r\na=[int(i) for i in input().split()]\r\nd={}\r\nflag=True\r\nfor i in a:\r\n k=i-25\r\n if k>0:\r\n if k>=50 and d.get(50,0)>0:\r\n r=k//50\r\n k=k-r*50\r\n d[50]-=r\r\n if k>=25 :\r\n if d.get(25,0)>0:\r\n r=k//25\r\n s=k%25\r\n if s!=0 or r>d[25]:\r\n flag=False\r\n break\r\n d[25]-=r\r\n else:\r\n flag=False\r\n break\r\n \r\n d[i]=d.get(i,0)+1\r\n else:\r\n d[i]=d.get(i,0)+1\r\nif flag:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n ", "n = int(input())\nbills = list(map(int, input().split()))\n\nb25 = b50 = b100 = 0\nfor b in bills:\n if b == 25:\n b25 += 1\n if b == 50:\n b50 += 1\n if b25 >= 1:\n b25 -= 1\n else:\n print('NO')\n exit()\n elif b == 100:\n if b50 > 0 and b25 > 0:\n b50 -= 1\n b25 -= 1\n elif b25 >= 3:\n b25 -= 3\n else:\n print('NO')\n exit()\n b100 += 1\n\nprint('YES')\n", "n = int(input())\r\nL = list(map(int, input().split()))\r\n\r\nnum_25 = 0\r\nnum_50 = 0\r\n\r\ntry:\r\n for i in L:\r\n if i == 25:\r\n num_25 += 1\r\n elif i == 50:\r\n num_50 += 1\r\n num_25 -= 1\r\n else:\r\n if num_50 > 0:\r\n num_50 -= 1\r\n num_25 -= 1\r\n else:\r\n num_25 -= 3\r\n\r\n if num_25 < 0 or num_50 < 0:\r\n raise ValueError\r\n\r\n print(\"YES\")\r\n\r\nexcept ValueError:\r\n print(\"NO\")\r\n", "def main():\r\n a = []\r\n while True:\r\n try:\r\n n = int(input())\r\n a = list(map(int, input().split()))\r\n c = 1\r\n tf = 0\r\n hn = 0\r\n fy = 0\r\n for i in range(n):\r\n if a[i] == 25:\r\n tf += 1\r\n elif a[i] == 50:\r\n if tf < 1:\r\n c = 0\r\n break\r\n else:\r\n tf -= 1\r\n fy += 1\r\n elif a[i] == 100:\r\n if tf >= 1 and fy >= 1:\r\n tf -= 1\r\n fy -= 1\r\n elif tf >= 3:\r\n tf -= 3\r\n else:\r\n c = 0\r\n break\r\n\r\n if c == 1:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n except EOFError:\r\n break\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n = int(input())\r\na = [int(k) for k in input().split()]\r\n\r\ndef cinema_line(arr):\r\n bank = {\r\n 25: 0,\r\n 50: 0,\r\n 100: 0\r\n }\r\n\r\n for el in arr:\r\n if el == 100:\r\n if bank[50] >= 1 and bank[25] >= 1:\r\n bank[100] += 1\r\n bank[50] -= 1\r\n bank[25] -= 1\r\n elif bank[25] >= 3:\r\n bank[100] += 1\r\n bank[25] -= 3\r\n else:\r\n return False\r\n else:\r\n needed_change = el - 25\r\n if needed_change > 0 and bank[needed_change] == 0:\r\n return False\r\n bank[el] += 1\r\n if needed_change > 0:\r\n bank[needed_change] -= 1\r\n\r\n return True\r\n\r\nres = cinema_line(a)\r\n\r\nif res:\r\n print('YES')\r\nelse:\r\n print('NO')", "n = int(input())\r\nk = [int(i) for i in input().split()]\r\nc = 0\r\ntf = 0\r\nf = 0\r\nfor i in k:\r\n if i == 25:\r\n tf += 1\r\n elif i == 50:\r\n if tf >= 1:\r\n tf -= 1\r\n f += 1\r\n else:\r\n c = 1\r\n break\r\n else:\r\n if tf >= 1 and f >= 1:\r\n tf -= 1\r\n f -= 1\r\n elif tf >= 3:\r\n tf -= 3\r\n else:\r\n c = 1\r\n break\r\nif c == 0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n=int(input())\r\na,b,c=0,0,0\r\nl=map(int,input().split())\r\nfor i in l:\r\n if i==25:\r\n a+=1\r\n elif i==50 and a>=1:\r\n a-=1\r\n b+=1\r\n elif i==100 :\r\n if a>=1 and b>=1:\r\n a-=1\r\n b-=1\r\n elif a>=3:\r\n a-=3\r\n else:\r\n print(\"NO\")\r\n exit()\r\n else :\r\n print(\"NO\")\r\n exit()\r\nprint(\"YES\")\r\n \r\n", "n = int(input())\na = list(map(int, input().split()))\nnum25 =num50= num100=0\nchg = True\n\nfor i in range(n):\n if a[i] == 25:\n num25 += 1\n elif a[i] == 50:\n num50 += 1\n if num25:\n num25 -= 1\n else:\n print(\"NO\")\n chg = False\n break\n elif a[i] == 100:\n if num50 and num25:\n num50 -= 1\n num25 -= 1\n elif num25 >= 3:\n num25 -= 3\n else:\n print(\"NO\")\n chg = False\n break\n\nif chg:\n print(\"YES\")\n\n\t \t \t \t \t\t \t \t\t \t\t\t\t\t", "# https://codeforces.com/problemset/problem/349/A\n\nn = int(input().strip())\n\nbills = [0, 0, 0]\ncomplete = True\ninps = map(int, input().strip().split(' '))\nfor inp in inps:\n if inp == 25:\n bills[0] += 1\n continue\n if inp == 50:\n if bills[0] <= 0:\n print(\"NO\")\n complete = False\n break\n else:\n bills[0] -= 1\n bills[1] += 1\n continue\n else:\n if (bills[0] >= 1 and bills[1] >= 1) or (bills[0] >= 3):\n if bills[1] < 1:\n bills[0] -= 3\n bills[2] += 1\n continue\n else:\n bills[0] -= 1\n bills[1] -= 1\n bills[2] += 1\n continue\n else:\n print(\"NO\")\n complete = False\n break\n\nif complete:\n print(\"YES\")", "import sys\ninput = sys.stdin.readline\n\n'''\n\n'''\n\nn = int(input())\n\ndef cashier(money, payment):\n if payment == 25:\n money[0] += 1\n elif payment == 50:\n if money[0]:\n money[0] -= 1\n money[1] += 1\n else:\n return False\n else:\n if money[0] and money[1]:\n money[0] -= 1\n money[1] -= 1\n money[2] += 1\n elif money[0] > 2:\n money[0] -= 3\n money[2] += 1\n else:\n return False\n return True\n\nmoney = [0] * 3\nfor payment in map(int, input().split()):\n if cashier(money, payment):\n continue\n else:\n print(\"NO\")\n sys.exit()\nprint(\"YES\")", "t = int(input())\r\ntwenty_five, fifty, one_hundred = 0, 0, 0\r\nj = input().split()\r\nfor i in j:\r\n k = int(i)\r\n if k == 25:\r\n twenty_five += 1\r\n continue\r\n if k == 50:\r\n if twenty_five >= 1:\r\n fifty += 1\r\n twenty_five -= 1\r\n continue\r\n if k == 100:\r\n if fifty >= 1 and twenty_five >= 1:\r\n one_hundred += 1\r\n fifty -= 1\r\n twenty_five -= 1\r\n continue\r\n elif twenty_five >= 3:\r\n one_hundred += 1\r\n twenty_five -= 3\r\n continue\r\n print('NO')\r\n exit()\r\nprint('YES')", "n = int(input())\r\nb25 = 0\r\nb50 = 0\r\na = [int(i) for i in input().split()]\r\nfor i in range(n):\r\n if a[i] == 25:\r\n b25 += 1\r\n elif a[i] == 50:\r\n b50 += 1\r\n b25 -= 1\r\n elif a[i] == 100:\r\n if b50 >= 1 and b25 >= 1:\r\n b50 -= 1\r\n b25 -= 1\r\n else:\r\n b25 -= 3\r\n if b25 < 0 or b50 < 0:\r\n print(\"NO\")\r\n exit()\r\nprint(\"YES\")", "n=int(input())\na=list(map(int,input().split()))\nc={25:0,50:0,100:0}\nfor i in a:\n if i==25:\n c[25]+=1\n elif i==50:\n if c[25]>0:\n c[25]-=1\n c[50]+=1\n else:\n print('NO')\n exit()\n elif i==100:\n if c[25]>0 and c[50]>0:\n c[25]-=1\n c[50]-=1\n c[100]+=1\n elif c[25]>2:\n c[25]-=3\n c[100]+=1\n else:\n print('NO')\n exit()\nprint('YES')", "n = int(input())\r\nr = list(map(int,input().split()))\r\nc_25 = 0\r\nc_50 = 0\r\nq = \"YES\"\r\nfor i in r :\r\n if i == 25 : c_25 +=1\r\n elif i == 50 : \r\n c_50 +=1 \r\n c_25 -=1\r\n else:\r\n if c_50 > 0 : c_50 -= 1\r\n else:\r\n c_25 -= 2\r\n c_25 -= 1\r\n if c_25 < 0 or c_50 < 0 :\r\n q = \"NO\"\r\nprint(q) \r\n\r\n", "from collections import Counter\n\nn, a = int(input()), (int(i) for i in input().split())\nres, cnt = \"YES\", Counter()\nfor i in a:\n cnt[i] += 1\n i -= 25\n for c in [50, 25]:\n d = min(cnt[c], i // c)\n i -= c * d\n cnt[c] -= d\n if i:\n res = \"NO\"\n break\nprint(res)\n", "# A. Cinema Line\r\nn=int(input())\r\na=list(map(int,input().split()))\r\nf=1\r\nch25=0\r\nch50=0\r\nfor i in a:\r\n if i==25:\r\n ch25+=1\r\n elif i==50:\r\n if ch25>0:\r\n ch25-=1\r\n ch50+=1\r\n else:\r\n f=0\r\n print(\"NO\")\r\n break\r\n else:\r\n if ch25>0 and ch50>0:\r\n ch25-=1\r\n ch50-=1\r\n elif ch25>=3:\r\n ch25-=3\r\n else:\r\n f=0\r\n print(\"NO\")\r\n break\r\nif f==1:\r\n print(\"YES\")\r\n ", "n=int(input())\r\nl=[int(i) for i in input().split()]\r\ntc,fc,hc=0,0,0\r\nfor i in range(len(l)):\r\n if l[i]==25:\r\n tc+=1 \r\n elif l[i]==50:\r\n fc+=1\r\n if tc>0:\r\n tc-=1\r\n else:\r\n print('NO')\r\n break \r\n else:\r\n hc+=1\r\n if tc>0 and fc>0:\r\n tc-=1\r\n fc-=1\r\n elif tc>=3:\r\n tc-=3\r\n else:\r\n print('NO')\r\n break \r\nelse:\r\n print('YES')\r\n\r\n", "# http://codeforces.com/problemset/problem/349/A\n\n# keep track of all the 25s as we need them the most. Have variables to count 25 and 50.\nn = int(input())\nli = [int(x) for x in input().split()]\na, b, c = 0, 0, 0\nfor i in li:\n if i == 25:\n a += 1\n elif i == 50:\n a, b = a - 1, b + 1\n elif b:\n a, b = a - 1, b - 1\n else:\n a -= 3\n if a < 0 or b < 0:\n c = 1\nprint(\"YNEOS\"[c::2])\n", "n = int(input())\r\narr = [int(x) for x in input().split()]\r\n\r\nticket_cost = 25\r\nbank = 0\r\nmsg = \"YES\"\r\n\r\n\r\nbills = {\r\n 25: 0,\r\n 50: 0,\r\n}\r\n\r\nfor i in range(n):\r\n if arr[i] == 25:\r\n bills[25] += 1\r\n elif arr[i] == 50:\r\n if bills[25] > 0:\r\n bills[25] -= 1\r\n else:\r\n msg = \"NO\"\r\n break\r\n bills[50] += 1\r\n else:\r\n if bills[50] > 0 and bills[25] > 0:\r\n bills[50] -= 1\r\n bills[25] -= 1\r\n elif bills[25] >= 3:\r\n bills[25] -= 3\r\n else:\r\n msg = \"NO\"\r\n break\r\nprint(msg)", "n=int(input())\r\na=list(map(int,input().split()))\r\ns1=0\r\ns2=0\r\ns3=0\r\nz=0\r\nfor i in range(0,n,1):\r\n if a[i]==25:\r\n s1=s1+1\r\n elif a[i]==50:\r\n if s1>0:\r\n s2=s2+1\r\n s1=s1-1\r\n else:\r\n z=1\r\n break\r\n else:\r\n if s2>=1 and s1>=1:\r\n s3=s3+1\r\n s2=s2-1\r\n s1=s1-1\r\n elif s1>=3:\r\n s3=s3+1\r\n s1=s1-3\r\n else:\r\n z=1\r\n break\r\nif z==1:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "from sys import stdin\r\n\r\nn = int(stdin.readline().strip())\r\narr = list(map(int, stdin.readline().strip().split()))\r\n\r\ncoin_list = [0, 0, 0]\r\nflag = True\r\nfor num in arr:\r\n if num == 25:\r\n coin_list[0] += 1\r\n elif num == 50:\r\n if coin_list[0] > 0:\r\n coin_list[1] += 1\r\n coin_list[0] -= 1\r\n else:\r\n flag = False\r\n break\r\n else:\r\n if coin_list[1] > 0 and coin_list[0] > 0:\r\n coin_list[1] -= 1\r\n coin_list[0] -= 1\r\n coin_list[2] += 1\r\n elif coin_list[0] > 2:\r\n coin_list[0] -= 3\r\n coin_list[2] += 1\r\n else:\r\n flag = False\r\n break\r\n\r\nprint('YES') if flag else print('NO')\r\n", "def f(a):\n n50 = n25 = 0\n for b in a:\n if b == 25:\n n25 += 1\n elif b == 50:\n if n25 == 0:\n return False\n n25 -= 1\n n50 += 1\n elif b == 100:\n if n50 >= 1 and n25 >= 1:\n n50 -= 1\n n25 -= 1\n elif n25 >= 3:\n n25 -= 3\n else:\n return False\n return True\n\n\ninput()\nprint(\"YES\" if f(map(int, input().split())) else \"NO\")\n", "n = input()\r\nl1 = input()\r\nl = [int(i) for i in l1.split() if i.isdigit()]\r\nd = {25:0,50:0,100:0}\r\nans = 'YES'\r\nfor i in range(0,len(l)):\r\n if l[i] == 25:\r\n d[25] = d[25] + 1\r\n elif l[i] == 50:\r\n d[50] = d[50] + 1 \r\n if d[25] >= 1:\r\n d[25] = d[25] - 1\r\n else:\r\n ans = 'NO'\r\n break\r\n else:\r\n d[100] = d[100] + 1\r\n if d[25] >= 3 or (d[25] >=1 and d[50] >= 1):\r\n if d[50] >= 1:\r\n d[50] = d[50] - 1\r\n d[25] = d[25] - 1\r\n else:\r\n d[25] = d[25] - 3\r\n else:\r\n ans = 'NO'\r\n break\r\nprint(ans) \r\n \r\n", "input();a=b=c=0\r\nfor i in map(int,input().split()):\r\n if i==25:a+=1\r\n elif i==50:a-=1;b+=1\r\n elif i==100:\r\n if b>0:a-=1;b-=1\r\n else:a-=3\r\n if a<0 or b<0:c=1\r\nprint('YNEOS'[c::2])\r\n", "n=int(input())\r\narr=list(map(int,input().split()))\r\nflag=0\r\ns0,s1,s2=0,0,0\r\nfor i in range(n):\r\n v=arr[i]\r\n #print(v,flag,s0,s1,s2)\r\n if v==25:\r\n s0+=1\r\n flag=1\r\n elif v==50:\r\n s1+=1\r\n if s0>=1:\r\n s0-=1\r\n flag=1\r\n else:\r\n flag=0\r\n break\r\n else:\r\n s2+=1\r\n if s0>=1 and s1>=1:\r\n s0-=1\r\n s1-=1\r\n flag=1\r\n elif s0>=3:\r\n s0-=3\r\n flag=1\r\n else:\r\n flag=0\r\n break\r\nif flag==1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n=int(input())\narr=list(map(int, input().split()))\nchange_25=0\nchange_50=0\nfor bill in arr:\n if bill==25:\n change_25+=1\n elif bill==50:\n if change_25>=1:\n change_25-= 1\n change_50+=1\n else:\n print(\"NO\")\n break\n elif bill==100:\n if change_50>=1 and change_25>=1:\n change_50-=1\n change_25-=1\n elif change_25>=3:\n change_25-=3\n else:\n print(\"NO\")\n break\nelse:\n print(\"YES\")\n\t \t\t\t\t\t \t \t \t \t \t\t\t", "from math import ceil,gcd,factorial\r\nfrom bisect import bisect_left as bl\r\nfrom bisect import bisect_right as br\r\nfrom array import array\r\nfrom collections import Counter as ctr\r\nfrom collections import deque as dq\r\n\r\ndef li():\r\n return list(map(int,input().split()))\r\ndef arr(a):\r\n return array('i',a)\r\n\r\ndef solve():\r\n #for _ in range(int(input())):\r\n n=int(input())\r\n a=li()\r\n c2=0\r\n c5=0\r\n f=True\r\n for i in range(n):\r\n if a[i]==25:\r\n c2+=1\r\n elif a[i]==50:\r\n if c2>=1:\r\n c2-=1\r\n c5+=1\r\n else:\r\n f=False\r\n print(\"NO\")\r\n break\r\n elif c5>0 and c2>0:\r\n c5-=1\r\n c2-=1\r\n elif c2>2:\r\n c2-=3\r\n else:\r\n f=False\r\n print(\"NO\")\r\n break\r\n if f:\r\n print(\"YES\")\r\nsolve()\r\n", "\r\nn=int(input())\r\nx = list(map(lambda q:int(q), input().split(\" \")))\r\nt=0\r\nmate=1\r\na25=0\r\na50=0\r\na100=0\r\nfor i in range(n):\r\n if x[i]==25:\r\n a25+=1\r\n elif x[i]==50 and a25>0:\r\n a25-=1\r\n a50+=1\r\n elif x[i]==100 and t>=75:\r\n if a50>0 and a25>0:\r\n a50-=1\r\n a25-=1\r\n a100+=1\r\n elif a50==0 and a25>=3:\r\n a25-=3\r\n a100+=1\r\n else:\r\n mate-=1\r\n print('NO')\r\n break\r\n \r\n else:\r\n print('NO')\r\n mate-=1\r\n break \r\n t+=25\r\n \r\n \r\n \r\nif mate==1:\r\n print('YES')", "from collections import defaultdict\r\n\r\n\r\ndef default_val():\r\n return 0\r\n\r\n\r\nm = defaultdict(default_val)\r\n\r\nn = int(input())\r\na = list(map(int, input().split(' ')))\r\nf = True\r\nfor elem in a:\r\n if elem == 25:\r\n m[25] += 1\r\n elif elem == 50:\r\n if m[25] >= 1:\r\n m[25] -= 1\r\n m[50] += 1\r\n else:\r\n f = False\r\n break\r\n elif elem == 100:\r\n if m[25] >= 1 and m[50] >= 1:\r\n m[50] -= 1\r\n m[25] -= 1\r\n m[100] += 1\r\n elif m[50] < 1 and m[25] >= 3:\r\n m[25] -= 3\r\n m[100] += 1\r\n else:\r\n f = False\r\n break\r\nif f:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def solve(n, a):\r\n c25, c50, c100 = 0, 0, 0\r\n\r\n def down50(r):\r\n nonlocal c50\r\n if r == 0:\r\n return 0\r\n if r >= 50 and c50 > 0:\r\n c50 -= 1\r\n r -= 50\r\n return r\r\n\r\n def down25(r):\r\n nonlocal c25\r\n if r == 0:\r\n return 0\r\n if r >= 25 and c25 > 0:\r\n c25 -= 1\r\n r -= 25\r\n return r\r\n\r\n for v in a:\r\n if v == 25:\r\n c25 += 1\r\n r = 0\r\n elif v == 50:\r\n c50 += 1\r\n r = 25\r\n elif v == 100:\r\n c100 += 1\r\n r = 75\r\n else:\r\n raise Exception(v)\r\n r = down50(r)\r\n r = down25(r)\r\n r = down25(r)\r\n r = down25(r)\r\n if r > 0:\r\n return \"NO\"\r\n return \"YES\"\r\n\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\nprint(solve(n, a))\r\n", "\r\nnom = int(input())\r\nlist = [int(item) for item in input().split()]\r\ncnt25 = 0\r\ncnt50 = 0\r\nfor i in range(0, nom):\r\n if list[i] == 25:\r\n cnt25 +=1\r\n # print(\"here\")\r\n elif list[i] == 50:\r\n if cnt25 > 0:\r\n cnt50 +=1\r\n cnt25 -= 1\r\n else:\r\n print(\"NO\")\r\n break\r\n else:\r\n if cnt50 > 0 and cnt25 >0:\r\n cnt50 -= 1\r\n cnt25 -= 1\r\n elif cnt25 > 2:\r\n cnt25 -= 3\r\n else:\r\n print(\"NO\")\r\n break\r\n if i == nom-1:\r\n print(\"YES\")\r\n\r\n", "length = int(input())\r\nnDict = {\r\n 25 : 0 ,\r\n 50 : 0 ,\r\n 100 : 0 \r\n}\r\nfor num in map(int,input().split()) :\r\n if num == 25 : nDict[25] += 1\r\n elif num == 50 : \r\n nDict[25] -= 1\r\n if nDict[25] < 0 : quit(print(\"NO\"))\r\n nDict[50] += 1\r\n else :\r\n if nDict[50] and nDict[25] :\r\n nDict[50] -= 1\r\n nDict[25] -= 1\r\n elif nDict[25] :\r\n nDict[25] -= 3\r\n if nDict[25] < 0 : quit(print(\"NO\"))\r\n else :\r\n quit(print(\"NO\"))\r\n nDict[100] += 1\r\nprint(\"YES\")", "\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 = II()\r\n\r\na = 0 # 25 cent counter\r\nb = 0 # 50 cent counter\r\n\r\nfor coin in MII():\r\n if coin == 25:\r\n a += 1\r\n elif coin == 50:\r\n a -= 1\r\n b += 1\r\n elif b > 0: # coin == 100\r\n b -= 1\r\n a -= 1\r\n else: # b == 0, coin == 100\r\n a -= 3\r\n \r\n if a < 0:\r\n print('NO')\r\n break\r\nelse:\r\n print('YES')\r\n \r\n \r\n \r\n ", "'''input\r\n4\r\n50 50 25 25\r\n\r\n'''\r\ndef getints(): return list(map(int, input().strip().split()))\r\ndef impossible():\r\n\tprint(\"NO\")\r\n\texit(0)\r\n\r\nd = {\r\n\t25:0,\r\n\t50:0,\r\n\t100:0\r\n}\r\nn = int(input().strip())\r\narr = getints()\r\nfor e in arr:\r\n\tif e == 100:\r\n\t\tif d[25]<=0: impossible()\r\n\t\tif d[50]>0:\r\n\t\t\td[50]-=1\r\n\t\t\td[25]-=1\r\n\t\telse:\r\n\t\t\td[25]-=3\r\n\t\td[100]+=1\r\n\telif e == 50:\r\n\t\td[25]-=1\r\n\t\td[50]+=1\r\n\telif e==25:\r\n\t\td[25]+=1\r\n\r\n\tif d[25]<0: impossible()\r\nprint(\"YES\")", "n = int(input())\r\na = b = c = 0\r\nfor i in map(int,input().split()):\r\n if i == 25: a += 1\r\n elif i == 50: b += 1; a -= 1\r\n elif b: a -= 1; b -= 1\r\n else: a -= 3\r\n if a<0 or b<0: c = 1\r\nprint( ['YES', 'NO'][c==1])", "n = int(input())\nlst = list(map(int,input().split()))\nif lst[0] != 25:\n print(\"NO\")\nelse:\n count25 = 1\n count50 = 0\n for i in range(1,len(lst)):\n if lst[i] == 25:\n count25 += 1\n elif lst[i] == 50:\n count50 +=1\n if count25:\n count25 -=1\n else:\n print(\"NO\")\n break\n elif lst[i] == 100:\n if count50 and count25:\n count50 -= 1 \n count25 -= 1\n elif count25 >= 3:\n count25 -= 3\n else:\n print(\"NO\")\n break\n else:\n print(\"YES\")\n\n \t \t\t\t \t\t \t\t \t \t \t\t \t", "int(input())\r\nA=input().split()\r\na=b=0\r\nk=0\r\nfor x in A:\r\n if x=='25':\r\n a+=1\r\n elif x=='50':\r\n a-=1\r\n b+=1\r\n elif b:\r\n b-=1\r\n a-=1\r\n else:\r\n a-=3\r\n if a<0 or b<0:\r\n k=1\r\n break\r\nprint([\"YES\",\"NO\"][k])", "n=int(input())\r\nx=[int (x) for x in input().split()]\r\nc25=0\r\nc50=0\r\na=1\r\nfor i in range(n):\r\n if x[i]==25:\r\n c25+=1\r\n elif x[i]==50:\r\n if c25>0:\r\n c25-=1\r\n c50+=1\r\n else:\r\n a=0\r\n break\r\n else:\r\n if c25>0 and c50>0:\r\n c25-=1\r\n c50-=1\r\n elif c25>=3:\r\n c25-=3\r\n else:\r\n a=0\r\n break\r\nif a==1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n = int(input())\r\nnums = [int(j) for j in input().split()]\r\ntf, f, h = 0, 0, 0\r\noutput = \"YES\"\r\nfor j in range(n):\r\n t = nums[j]\r\n while nums[j] - 100 >= 25 and h > 0:\r\n nums[j] -= 100\r\n h -= 1\r\n while nums[j] - 50 >= 25 and f > 0:\r\n nums[j] -= 50\r\n f -= 1\r\n while nums[j] - 25 >= 25 and tf > 0:\r\n tf -= 1\r\n nums[j] -= 25\r\n if t == 25:\r\n tf += 1\r\n elif t == 50:\r\n f += 1\r\n else:\r\n h += 1\r\n if nums[j] != 25:\r\n output = \"NO\"\r\n break\r\nprint(output)\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\nc25 = 0\r\nc50 = 0\r\nflag = True\r\nfor i in range(0, n):\r\n if a[i] == 25:\r\n c25 += 1\r\n if a[i] == 50:\r\n if c25 > 0:\r\n c50 += 1\r\n c25 -= 1\r\n else:\r\n flag = False\r\n break\r\n if a[i] == 100:\r\n if c50 > 0 and c25 > 0:\r\n c50 -= 1\r\n c25 -= 1\r\n elif c25 > 2:\r\n c25 -= 3\r\n else:\r\n flag = False\r\n break\r\n \r\nif flag: print('YES')\r\nelse: print('NO')", "n = int(input())\r\nline = list(map(int, input().split()))\r\n\r\ncur25s = 0\r\ncur50s = 0\r\nfor i in range(n):\r\n curAmount = line[i]\r\n if (curAmount == 25):\r\n cur25s += 1\r\n continue\r\n if (curAmount == 50):\r\n cur50s += 1\r\n if (cur25s == 0):\r\n print(\"NO\")\r\n exit(0)\r\n cur25s -= 1\r\n elif (curAmount == 100):\r\n if (cur50s >= 1 and cur25s >= 1):\r\n cur50s -= 1\r\n cur25s -= 1\r\n elif (cur25s >= 3):\r\n cur25s -= 3\r\n else:\r\n print(\"NO\")\r\n exit(0)\r\nprint(\"YES\")", "import sys\r\n\r\nt = int(input())\r\nlst = list(map(int, input().split()))\r\n\r\nm100 = m50 = m25 = 0\r\n\r\nfor i in lst:\r\n if i==25: m25+=1\r\n elif i==50:\r\n if m25 == 0: print(\"NO\"); sys.exit()\r\n else: m25-=1; m50+=1\r\n else:\r\n if m25 != 0 and m50 != 0:\r\n m25-=1; m50-=1; m100+=1\r\n elif m50==0 and m25>=3:\r\n m25-=3; m100+=1\r\n else: print(\"NO\"); sys.exit()\r\n \r\nprint(\"YES\")\r\n ", "def can_sell_ticket(n, bills):\r\n cash_25 = cash_50 = cash_100 = 0\r\n\r\n for bill in bills:\r\n if bill == 25:\r\n cash_25 += 1\r\n elif bill == 50:\r\n cash_50 += 1\r\n cash_25 -= 1\r\n elif bill == 100:\r\n if cash_50 > 0:\r\n cash_50 -= 1\r\n cash_25 -= 1\r\n else:\r\n cash_25 -= 3\r\n\r\n if cash_25 < 0 or cash_50 < 0:\r\n return \"NO\"\r\n\r\n return \"YES\"\r\n\r\nn = int(input())\r\nbills = list(map(int, input().split()))\r\n\r\n\r\nresult = can_sell_ticket(n, bills)\r\nprint(result)\r\n\r\n\r\n \r\n\r\n\r\n \r\n\r\n", "n = int(input())\r\narr = list(map(int, input().split()))\r\ncond = True\r\na = 0\r\nb = 0\r\n\r\nfor el in arr:\r\n if el == 25:\r\n a += 1\r\n elif el == 50:\r\n if a == 0:\r\n cond = False\r\n break\r\n else:\r\n a -= 1\r\n b += 1\r\n else:\r\n if a > 0 and b > 0:\r\n a -= 1\r\n b -= 1\r\n elif a > 2:\r\n a -= 3\r\n else:\r\n cond = False\r\n\r\nif cond:\r\n print('YES')\r\nelse:\r\n print('NO')", "def can_sell_tickets(n, bills):\n change_25 = 0 # Count of 25-ruble bills\n change_50 = 0 # Count of 50-ruble bills\n\n for bill in bills:\n if bill == 25:\n change_25 += 1\n elif bill == 50:\n if change_25 >= 1:\n change_25 -= 1\n change_50 += 1\n else:\n return \"NO\"\n elif bill == 100:\n if change_50 >= 1 and change_25 >= 1:\n change_50 -= 1\n change_25 -= 1\n elif change_25 >= 3:\n change_25 -= 3\n else:\n return \"NO\"\n\n return \"YES\"\n\n# Read input\nn = int(input())\nbills = list(map(int, input().split()))\n\n# Check if the clerk can sell tickets and give change\nresult = can_sell_tickets(n, bills)\nprint(result)\n\n\t \t\t\t \t \t \t \t\t \t \t \t\t\t\t", "n = int(input())\r\nline = input().split()\r\nchange_25 = 0\r\nchange_50 = 0\r\n\r\nfor i in range(n):\r\n if line[i] == \"25\":\r\n change_25 += 1\r\n elif line[i] == \"50\":\r\n if change_25 > 0:\r\n change_25 -= 1\r\n change_50 += 1\r\n else:\r\n print(\"NO\")\r\n exit()\r\n elif line[i] == \"100\":\r\n if change_50 > 0 and change_25 > 0:\r\n change_50 -= 1\r\n change_25 -= 1\r\n elif change_25 >= 3:\r\n change_25 -= 3\r\n else:\r\n print(\"NO\")\r\n exit()\r\n\r\nprint(\"YES\")", "n = int(input())\r\nC = list(map(int, input().split()))\r\n\r\nones, twos = 0, 0\r\nokay = True\r\nfor c in C:\r\n if c == 25:\r\n ones += 1\r\n elif c == 50:\r\n if ones:\r\n ones -= 1\r\n twos += 1\r\n else:\r\n okay = False\r\n break\r\n else: # c == 100\r\n if twos and ones:\r\n ones -= 1\r\n twos -= 1\r\n elif ones >= 3:\r\n ones -= 3\r\n else:\r\n okay = False\r\n break\r\nprint(\"YES\" if okay else \"NO\")", "n = int(input())\r\narr = list(map(int, input().split()))\r\n\r\nn25 = 0\r\nn50 = 0\r\nposs = True\r\nfor i in range(n):\r\n if (arr[i] == 25):\r\n n25 += 25\r\n elif (arr[i] == 50):\r\n n50 += 50\r\n n25 -= 25\r\n else:\r\n if (n50 > 0):\r\n n25 -= 25\r\n n50 -= 50\r\n else:\r\n n25 -= 75\r\n if (n25 < 0 or n50 < 0):\r\n poss = False\r\n print(\"NO\")\r\n exit()\r\nprint(\"YES\")", "n = int(input())\r\nl = [int(i) for i in input() .split()]\r\ns1 = 0\r\ns2 = 0\r\nfor i in range(n):\r\n k = l[i] - 25\r\n if(k == 75 and s1 >= 1 and s2 >= 1):\r\n s1 -=1\r\n s2-=1 \r\n elif(k == 75 and s1 >= 3):\r\n s1 -=3 \r\n elif(k == 25 and s1 >= 1):\r\n s1 -=1\r\n elif(k == 0):\r\n s1 = s1\r\n s2 = s2 \r\n else:\r\n print(\"NO\")\r\n exit() \r\n if(l[i] == 50):\r\n s2+=1\r\n elif(l[i] == 25):\r\n s1+=1 \r\n \r\n \r\n\r\nprint(\"YES\") \r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "kackisi = int(input())\r\nk = list(map(int,input().split()))\r\nsayi25 = 0\r\nsayi50 = 0\r\ntrue = 0\r\nfor i in k:\r\n if i == 25:\r\n sayi25 += 1\r\n if i == 50:\r\n sayi25 -= 1\r\n sayi50 += 1\r\n if i == 100:\r\n if sayi50 == 0:\r\n sayi25 -= 3\r\n else:\r\n sayi50 -= 1\r\n sayi25 -= 1\r\n if sayi25 < 0 or sayi50 < 0:\r\n print(\"NO\")\r\n true = 1\r\n break\r\nif true == 0: \r\n print(\"YES\")\r\n \r\n", "n = int(input())\r\nl_r = list(map(int, input().split()))\r\nl_b = list([0, 0, 0])\r\n\r\nfor r in l_r:\r\n if r == 100:\r\n l_b[0] += 1\r\n if l_b[1] > 0:\r\n l_b[1] -= 1\r\n l_b[2] -= 1\r\n else:\r\n l_b[2] -= 3\r\n elif r == 50:\r\n l_b[1] += 1\r\n l_b[2] -= 1\r\n else:\r\n l_b[2] += 1\r\n \r\n if l_b[1] < 0 or l_b[2] < 0:\r\n print(\"NO\")\r\n quit()\r\n\r\nprint(\"YES\")", "n=int(input())\r\nd=list(map(int, input().split()))\r\na=[0, 0, 0]\r\nq=0\r\nw=0\r\nfor i in d:\r\n if i==100:\r\n if a[1]==0 and a[0]<3: w=1\r\n elif a[1]>0 and a[0]<1: w=1\r\n elif a[1]>0:\r\n a[1]-=1\r\n a[0]-=1\r\n else: a[0]-=3\r\n a[2]+=1\r\n elif i==50:\r\n if a[0]<1: w=1\r\n else: a[0]-=1\r\n a[1]+=1\r\n else: a[0]+=1\r\n if w==1:\r\n q=1\r\n print(\"NO\")\r\n break\r\n w=0\r\nif q==0: print('YES')\r\n", "t=int(input())\r\na=list(map(int,input().split()))\r\nt=0\r\nf=0\r\nh=0\r\nflag=True\r\nfor i in range(len(a)):\r\n if a[i]==25:\r\n t+=1\r\n elif a[i]==50:\r\n if t>=1:\r\n t-=1\r\n f+=1\r\n else:\r\n flag=False\r\n break\r\n else:\r\n if f>=1 and t>=1:\r\n f-=1\r\n t-=1\r\n h+=1\r\n elif t>=3:\r\n t-=3\r\n h+=1\r\n else:\r\n flag=False\r\n break\r\nif not flag:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n \r\n", "from sys import stdin; inp = stdin.readline\r\nfrom math import dist, ceil, floor, sqrt\r\ndef IA(): return list(map(int, inp().split()))\r\ndef FA(): return list(map(float, inp().split()))\r\ndef SA(): return inp().split()\r\ndef I(): return int(inp())\r\ndef F(): return float(inp())\r\ndef S(): return inp()\r\nfrom collections import defaultdict\r\n\r\ndef main():\r\n c = defaultdict(int)\r\n n = I()\r\n l = IA()\r\n t = 0\r\n for x in l:\r\n if x == 25:\r\n c[x] += 1\r\n elif x == 50:\r\n if c[25] < 1:\r\n return 'NO'\r\n else:\r\n c[x] += 1\r\n c[25] -= 1\r\n else:\r\n if c[50] > 0 and c[25] > 0:\r\n c[x] += 1\r\n c[50] -= 1\r\n c[25] -= 1\r\n elif c[25] > 2:\r\n c[x] += 1\r\n c[25]-=3\r\n else:\r\n return 'NO'\r\n return 'YES'\r\n \r\n\r\nif __name__ == '__main__':\r\n print(main())", "import math\r\ndef ys():\r\n print(\"YES\")\r\ndef no():\r\n print(\"NO\")\r\n# for tc in range(int(input())):\r\nn = int(input())\r\nls = list(map(int, input().split()))\r\nif ls[0]!=25:\r\n no()\r\nelse:\r\n ck = 1\r\n c = 0\r\n d = 0\r\n for i in range(n):\r\n if ls[i]==25:\r\n c+=1\r\n elif ls[i]==50:\r\n c-=1\r\n d+=1\r\n else:\r\n if d==0:\r\n c-=3\r\n else:\r\n d-=1\r\n c-=1\r\n if c<0 or d<0:\r\n no()\r\n ck=0\r\n break\r\n if ck:\r\n ys()", "#349A\r\nn=int(input())\r\nA=list(map(int,input().split()))\r\nbill=0\r\nsbill=0\r\nif A[0]!=25:\r\n print('NO')\r\nelse:\r\n ans='YES'\r\n for i in range(n):\r\n if A[i]==25:\r\n bill+=1\r\n elif A[i]==50:\r\n bill-=1\r\n sbill+=1\r\n else:\r\n if sbill>0:\r\n sbill-=1\r\n bill-=1\r\n else:\r\n bill-=3\r\n if bill<0:\r\n ans='NO'\r\n print(ans) ", "n=int(input())\r\na=list(map(int,input().split()))\r\nt=0\r\nf=0\r\nc=0\r\nfor i in a:\r\n if i==25:\r\n t+=1\r\n elif i==50:\r\n if t>=1:\r\n t-=1\r\n f+=1\r\n else:\r\n print(\"NO\")\r\n c=1\r\n elif i==100:\r\n if f>=1 and t>=1:\r\n f-=1\r\n t-=1\r\n elif t>=3:\r\n t-=3\r\n else:\r\n print(\"NO\")\r\n c=1\r\n if c==1:\r\n break\r\nif c==0:\r\n print(\"YES\")", "n=int(input())\r\nl=list(map(int,input().split()))\r\nk=0\r\nm=0\r\nz=[0,0,0]\r\nfor i in range(n):\r\n x=l[i]\r\n if x==25:\r\n z[0]+=1\r\n elif x==50 and z[0]>=1:\r\n z[0]-=1\r\n z[1]+=1\r\n elif x==100 and z[1]>=1 and z[0]>=1:\r\n z[0]-=1\r\n z[1]-=1\r\n z[2]+=1\r\n elif x==100 and z[0]>=3:\r\n z[0]-=3\r\n z[2]+=1\r\n else:\r\n m=1\r\nif m==1:\r\n print('NO')\r\nelse:\r\n print('YES')", "# author: violist\n# created: 22.04.2021 16:22:53\n\nimport sys\ninput = sys.stdin.readline\n\nn = int(input())\na = list(map(int, input().split()))\nc = [0, 0]\nfor i in a:\n if i == 25:\n c[0] += 1\n elif i == 50:\n if c[0] < 1:\n print(\"NO\")\n sys.exit()\n c[0] -= 1\n c[1] += 1\n else:\n if c[0] > 0 and c[1] > 0:\n c[0] -= 1\n c[1] -= 1\n continue\n if c[0] < 3:\n print(\"NO\")\n sys.exit()\n c[0] -= 3\nprint(\"YES\")\n", "l=[]\r\nn=int(input())\r\na=list(map(int,input().split()))\r\nk=0\r\nc25=0\r\nc50=0\r\nflag =True\r\n#print(a)\r\nfor i in a:\r\n if(k==0 and i!=25):\r\n flag=False\r\n k=k+1\r\n break\r\n elif(i==25):\r\n k=k+1\r\n c25=c25+1\r\n elif(i==50):\r\n if(c25<1):\r\n flag=False\r\n break\r\n else:\r\n c25=c25-1\r\n c50=c50+1\r\n elif(i==100):\r\n if(c50>=1 and c25>=1):\r\n c50=c50-1\r\n c25=c25-1\r\n elif(c25>=3):\r\n c25=c25-3\r\n else:\r\n flag=False\r\n break\r\n\r\n \r\nif(flag):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n = int(input())\r\nl = list(map(int, input().split()))\r\nt25 = 0\r\nt50 = 0\r\nf = 1\r\ni = 0\r\nwhile i < n and f == 1:\r\n if l[i] == 25:\r\n t25 += 1\r\n elif l[i] == 50:\r\n t50 += 1\r\n if t25 >= 1:\r\n t25 -= 1\r\n else:\r\n f = 0\r\n elif l[i] == 100:\r\n if t50 >= 1 and t25 >= 1:\r\n t50 -= 1\r\n t25 -= 1\r\n elif t25 >= 3:\r\n t25 -= 3\r\n else:\r\n f = 0\r\n i += 1\r\nprint(\"YES\" if f == 1 else \"NO\")\r\n", "n=int(input())\r\narr=list(map(int,input().split()))\r\ni=0\r\nt25,t50,t100=0,0,0\r\nwhile i<n:\r\n if arr[i]==25:\r\n t25+=1\r\n elif arr[i]==50:\r\n if t25<1:\r\n print(\"NO\")\r\n break\r\n else:\r\n t50+=1\r\n t25-=1\r\n else:\r\n if t50>=1 and t25>=1:\r\n t50-=1\r\n t25-=1\r\n t100+=1\r\n elif t25>=3:\r\n t25-=3\r\n t100+=1\r\n else:\r\n print(\"NO\")\r\n break\r\n i+=1\r\nif i==n:\r\n print(\"YES\")", "int(input())\r\nA=input().split()\r\nB=[0,0]\r\nk=0\r\nfor x in A:\r\n if x=='25':\r\n B[0]+=1\r\n elif x=='50':\r\n B[0]-=1\r\n B[1]+=1\r\n else:\r\n if B[1]:\r\n B[1]-=1\r\n B[0]-=1\r\n else:\r\n B[0]-=3\r\n if B[0]<0 or B[1]<0:\r\n k=1\r\n break\r\nprint([\"YES\",\"NO\"][k])", "# https://codeforces.com/problemset/problem/349/A\n\ndef handle():\n input()\n\n values = [int(s) for s in input().split(\" \")]\n counts = {\n 25: 0,\n 50: 0\n }\n\n for value in values:\n if value == 25:\n counts[value] += 1\n elif value == 50:\n if counts[25] == 0:\n return \"NO\"\n else:\n counts[value] += 1\n counts[25] -= 1\n else:\n if counts[50] >= 1:\n if counts[25] >= 1:\n counts[50] -= 1\n counts[25] -= 1\n else:\n return \"NO\"\n elif counts[25] >= 3:\n counts[25] -= 3\n else:\n return \"NO\"\n return \"YES\"\n\nprint(handle())", "# author: violist\n# created: 22.04.2021 16:22:53\n\nimport sys\ninput = sys.stdin.readline\n\ndef main():\n n = int(input())\n a = list(map(int, input().split()))\n c = [0, 0]\n for i in a:\n if i == 25:\n c[0] += 1\n elif i == 50:\n if c[0] < 1:\n return \"NO\"\n c[0] -= 1\n c[1] += 1\n else:\n if c[0] > 0 and c[1] > 0:\n c[0] -= 1\n c[1] -= 1\n continue\n if c[0] < 3:\n return \"NO\"\n c[0] -= 3\n return \"YES\"\nprint(main())\n", "n = int(input())\r\n\r\nmoney = [0,0,0]\r\nmoneyValues = (25,50,100)\r\n\r\narr = list(map(lambda x: int(x),input().split()))\r\n\r\ngood = True\r\n\r\nfor i in range(n):\r\n x = arr[i]\r\n change = x - 25\r\n\r\n curr = 2\r\n\r\n while change != 0:\r\n if money[curr] == 0 or moneyValues[curr] > change:\r\n curr-=1\r\n if curr < 0:\r\n break\r\n else:\r\n change -= moneyValues[curr]\r\n money[curr]-=1\r\n if change != 0:\r\n good=False\r\n break\r\n else: \r\n money[moneyValues.index(x)] += 1\r\n\r\nprint(\"YES\" if good else \"NO\") \r\n ", "T=int(input())\r\nmp={25:0,50:0,100:0}\r\nf=1\r\narr=list(map(int,input().split()))\r\nfor i in range(T):\r\n mp[arr[i]]+=1\r\n if arr[i]==100:\r\n if (mp[25]>=1 and mp[50]>=1):\r\n mp[25]-=1\r\n mp[50]-=1\r\n elif mp[25]>=3 :\r\n mp[25]-=3\r\n else:\r\n f=0\r\n break\r\n elif arr[i]==50:\r\n if mp[25]>=1:\r\n mp[25]-=1\r\n else:\r\n f=0\r\n break\r\nif f:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n=int(input())\r\nw=[int(k) for k in input().split()]\r\nc=[0, 0]\r\nfor j in w:\r\n if j==25:\r\n c[0]+=1\r\n elif j==50:\r\n if c[0]==0:\r\n print(\"NO\")\r\n break\r\n else:\r\n c[0]-=1\r\n c[1]+=1\r\n else:\r\n if (c[0]==0 or c[1]==0) and c[0]<3:\r\n print(\"NO\")\r\n break\r\n else:\r\n if c[0]>0 and c[1]>0:\r\n c[0]-=1\r\n c[1]-=1\r\n elif c[0]>=3:\r\n c[0]-=3\r\nelse:\r\n print(\"YES\")", "n=int(input()); one=['25']; two=['50','25']; three=['25','25','25']; prevval=''\r\ntwentyfive=[];fifty=[]; twentyfive_lenth=0; fifty_length=0\r\n#,twentyfive_insert=0; fifty_insert=0\r\nfor value in input().split():\r\n flag = 'YES'\r\n if value=='25':\r\n twentyfive.append('25')\r\n twentyfive_lenth+=1\r\n elif value=='50':\r\n if prevval!=25 and twentyfive_lenth==0:\r\n flag = 'NO'\r\n break\r\n else:\r\n twentyfive.remove('25')\r\n twentyfive_lenth -= 1\r\n fifty.append('50')\r\n fifty_length += 1\r\n else:\r\n if fifty_length!=0 and twentyfive_lenth!=0:\r\n flag= 'YES2'\r\n fifty.remove('50')\r\n fifty_length -= 1\r\n twentyfive.remove('25')\r\n twentyfive_lenth -= 1\r\n if flag=='YES':\r\n for value in three:\r\n if twentyfive_lenth==0:\r\n flag = 'NO'\r\n break\r\n else:\r\n twentyfive.remove('25')\r\n twentyfive_lenth -= 1\r\n prevva=value\r\nprint('NO' if flag=='NO' else 'YES')\r\n", "n=int(input())\r\na=[int(x) for x in input().split()]\r\ns1=s2=s3=0\r\nb=1\r\nfor i in a:\r\n if i==25:\r\n s1=s1+1\r\n elif i==50:\r\n if s1<1:\r\n b=0\r\n break\r\n else:\r\n s1=s1-1\r\n s2=s2+1\r\n else:\r\n if s1>0 and s2>0:\r\n s1=s1-1\r\n s2=s2-1\r\n elif s1>=3:\r\n s1=s1-3\r\n else:\r\n b=0\r\n break\r\nif b==0:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "n = int(input())\r\na = [int(i) for i in input().split()]\r\n\r\nmp = {\r\n\t25: 0,\r\n\t50: 0,\r\n\t100: 0\r\n}\r\n\r\nok = True\r\nfor i in a:\r\n\tif i == 25:\r\n\t\tmp[25] += 1\r\n\tif i == 50:\r\n\t\tmp[50] += 1\r\n\t\tif mp[25] == 0:\r\n\t\t\tok = False\r\n\t\telse:\r\n\t\t\tmp[25] -= 1\r\n\tif i == 100:\r\n\t\tmp[100] += 1\r\n\t\tif mp[50] == 0:\r\n\t\t\tif mp[25] >= 3:\r\n\t\t\t\tmp[25] -= 3\r\n\t\t\telse:\r\n\t\t\t\tok = False\r\n\t\telse:\r\n\t\t\tmp[50] -= 1\r\n\t\t\tif mp[25] == 0:\r\n\t\t\t\tok = False\r\n\t\t\telse:\r\n\t\t\t\tmp[25] -= 1\r\n\r\n\tif not ok:\r\n\t\tbreak\r\n\r\nprint(\"YES\" if ok else \"NO\")", "#****************************************\r\n\r\n#** Solution by BAZOOKA **\r\n\r\n#** Sponsored by RED BULL**\r\n\r\n#** Team Galaxy **\r\n\r\n#** I love ❤Kateryna Gret❤ **\r\n\r\n#****************************************/\r\ninput()\r\na=b=c=0\r\nfor i in map(int,input().split()):\r\n\tif i==25:a+=1\r\n\telif i==50:a,b=a-1,b+1\r\n\telif b:a,b=a-1,b-1\r\n\telse:a-=3\r\n\tif a<0 or b<0:c=1\r\nprint('YNEOS'[c::2])\r\n#****************************************\r\n\r\n#** Solution by BAZOOKA **\r\n\r\n#** Sponsored by RED BULL**\r\n\r\n#** Team Galaxy **\r\n\r\n#** I love ❤Kateryna Gret❤ **\r\n\r\n#****************************************/", "n = int(input())\nticket = list(map(int, input().split()))\nif ticket[0] != 25:\n print(\"NO\")\nelse:\n p25, p50, p100 = 0, 0, 0\n flag = True\n for x in ticket:\n if x == 25:\n p25 += 1\n elif x == 50:\n if p25 >= 1:\n p25 -= 1\n p50 += 1\n\n else:\n flag = False\n break\n\n else:\n if p50 >= 1 and p25 >= 1:\n p50 -= 1\n p25 -= 1\n p100 += 1\n elif p25 >= 3:\n p25 -= 3\n p100 += 1\n\n else:\n flag = False\n break\n\n if flag:\n print(\"YES\")\n else:\n print(\"NO\")\n", "n = int(input())\r\na = [int(x) for x in input().split()]\r\ncur = [0, 0, 0]\r\nfor i in range(n):\r\n if a[i] == 25:\r\n cur[0] += 1\r\n elif a[i] == 50:\r\n if cur[0] == 0:\r\n print(\"NO\")\r\n exit()\r\n else:\r\n cur[0] -= 1\r\n cur[1] += 1\r\n else:\r\n if (cur[0] > 0) and (cur[1] > 0):\r\n cur[0] -= 1\r\n cur[1] -= 1\r\n elif cur[0] > 2:\r\n cur[0] -= 3\r\n else:\r\n print(\"NO\")\r\n exit()\r\nprint(\"YES\")", "from collections import defaultdict, deque\r\nfrom functools import lru_cache\r\nfrom heapq import heappush, heappop\r\nfrom typing import Counter\r\nimport math\r\nhpop = heappop\r\nhpush = heappush\r\n\"\"\"\r\n num = int(input())\r\n arr = list(map(int, input().split()))\r\n a,b = map(int, input().split())\r\n graph = defaultdict(list)\r\n for i in range(#)\r\n graph[a].append(b)\r\n graph[b].append(a)\r\n MOD = 10**9 + 7\r\n\"\"\"\r\ndef solution():\r\n _ = int(input())\r\n arr = list(map(int, input().split()))\r\n repo = {25:0,50:0,100:0}\r\n for val in arr:\r\n change = val - 25\r\n for cur in [100,50,25]:\r\n if repo[cur] == 0 or change < cur:\r\n continue\r\n\r\n # many amount of cur\r\n count = min(repo[cur],change//cur)\r\n repo[cur] -= count\r\n change -= count * cur \r\n\r\n if change > 0:\r\n print(\"NO\")\r\n return;\r\n repo[val] += 1\r\n print(\"YES\")\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 solution()\r\n \r\nimport sys\r\nimport threading\r\nsys.setrecursionlimit(1 << 30)\r\nthreading.stack_size(1 << 27)\r\nthread = threading.Thread(target=main)\r\nthread.start(); thread.join()\r\n#main()\r\n", "n = int(input())\r\na = list(map(int,input().split()))\r\np = [0,0] # --> 25,50\r\nans = \"YES\"\r\nfor x in a:\r\n if x==25:p[0]+=1\r\n if x==50:\r\n if p[0]>0:\r\n p[0]-=1\r\n p[1]+=1\r\n else:\r\n ans = \"NO\"\r\n break\r\n if x==100:\r\n if p[1]>0 and p[0]>0:\r\n p[0]-=1\r\n p[1]-=1\r\n elif p[0]>2:\r\n p[0]-=3\r\n else:\r\n ans = \"NO\"\r\n break\r\nprint(ans)", "n=int(input())\r\nt=input().split()\r\nt=[int(x) for x in t]\r\nch_25=0\r\nch_50=0\r\nfor i in range(n):\r\n if ch_25<0:\r\n break\r\n\r\n if t[i]==25:\r\n ch_25+=25\r\n \r\n elif t[i]==50:\r\n ch_25-=25\r\n ch_50+=50\r\n \r\n elif t[i]==100:\r\n if ch_50>0:\r\n ch_50-=50\r\n ch_25-=25\r\n \r\n else:\r\n ch_25-=75\r\n\r\nif ch_25>=0:\r\n print('YES')\r\n\r\nelse:\r\n print('NO')\r\n \r\n", "n = int(input())\r\nlst = list(map(int, input().split()))\r\namt_25 = amt_50 = amt_100 =0\r\nchk = 'YES'\r\ni = 0\r\nfor j in lst:\r\n if j == 25:\r\n amt_25 += 1\r\n elif j == 50:\r\n if amt_25 == 0:\r\n chk ='NO'\r\n break\r\n else:\r\n amt_25 -= 1\r\n amt_50 += 1\r\n else:\r\n if (amt_25 > 2 or (amt_50 > 0 and amt_25 > 0)):\r\n if amt_50 > 0:\r\n amt_25 -= 1\r\n amt_50 -= 1\r\n else:\r\n amt_25 -= 3\r\n chk = 'YES'\r\n else:\r\n chk = 'NO'\r\nprint(chk)\r\n\r\n\r\n\r\n", "input()\r\na=b=c=0\r\nfor i in input().split():\r\n if i == '25':\r\n a += 2\r\n elif i == '50':\r\n b += 1\r\n elif b:\r\n b -= 1\r\n else :\r\n a -= 2\r\n a -= 1\r\n if a < 0 or b < 0:\r\n c = 1\r\nif c:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n ", "n = int(input())\r\na = [int(i) for i in input().split()]\r\n\r\nc25 = 0\r\nc50 = 0\r\n\r\nflag = True\r\n\r\nfor i in a:\r\n if i == 25:\r\n c25+=1\r\n elif i == 50:\r\n if c25 > 0:\r\n c25-=1\r\n c50+=1\r\n else:\r\n flag = False\r\n else:\r\n if c50 > 0 and c25 >0:\r\n c50-=1\r\n c25-=1\r\n elif c25 > 2:\r\n c25-=3\r\n else:\r\n flag = False\r\n\r\nif flag:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n = int(input())\r\nl1 = list(map(int, input().split()))\r\na,b,c=0,0,0\r\nflag=True\r\nfor i in range(n):\r\n if l1[i]==25:\r\n a=a+1\r\n if l1[i]==50:\r\n b=b+1\r\n if a>0:\r\n a=a-1\r\n else:\r\n flag=False\r\n break\r\n if l1[i]==100:\r\n if b>0 and a>0:\r\n b,a=b-1,a-1\r\n elif a>2:\r\n a=a-3\r\n else:\r\n flag=False\r\n break\r\nif flag:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n", "def can_sell_tickets(bills):\n twenty_five_count = 0\n fifty_count = 0\n \n for bill in bills:\n if bill == 25:\n twenty_five_count += 1\n elif bill == 50:\n fifty_count += 1\n twenty_five_count -= 1\n elif bill == 100:\n if fifty_count > 0:\n fifty_count -= 1\n twenty_five_count -= 1\n else:\n twenty_five_count -= 3\n \n if twenty_five_count < 0 or fifty_count < 0:\n return \"NO\"\n \n return \"YES\"\n\nn = int(input())\n\nbills = list(map(int, input().split()))\n\nresult = can_sell_tickets(bills)\nprint(result)\n\n\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\nw, h, n = map(int, input().split())\r\nmat = [[0] * (2 * w) for _ in range(2 * h)]\r\n\r\nfor x1, y1, x2, y2 in (map(int, input().split()) for _ in range(n)):\r\n if x1 == x2:\r\n for y in range(2 * y1, 2 * y2):\r\n mat[y][2 * x1 - 1] = 1\r\n else:\r\n for x in range(2 * x1, 2 * x2):\r\n mat[2 * y1 - 1][x] = 1\r\n\r\nans = []\r\nfor i in range(0, 2 * h, 2):\r\n for j in range(0, 2 * w, 2):\r\n if mat[i][j]:\r\n continue\r\n mat[i][j] = 1\r\n size = 1\r\n stack = [(i, j)]\r\n while stack:\r\n y, x = stack.pop()\r\n for dy, dx in ((1, 0), (-1, 0), (0, 1), (0, -1)):\r\n if 0 <= y + dy * 2 < 2 * h and 0 <= x + dx * 2 < 2 * w and mat[y + dy][x + dx] == 0 and mat[y + dy * 2][x + dx * 2] == 0:\r\n mat[y + dy * 2][x + dx * 2] = 1\r\n size += 1\r\n stack.append((y + dy * 2, x + dx * 2))\r\n\r\n ans.append(size)\r\n\r\nprint(*sorted(ans))\r\n", "from bisect import bisect as bt\nw,h,n=map(int,input().split())\nN,M=max(w,h),10\nx=[[0,h]]+[[] for _ in range(N-1)]\ny=[[0,w]]+[[] for _ in range(N-1)]\nxy=[[0]*(N+1) for _ in range(N+1)]\ng=[0]*M+[[]]\nxy[0][0]=1\nxs,ys={0},{0}\ndef t(k,p):\n for i,j in zip(k,p):\n q=bt(i,j)\n if q==0 or i[q-1]!=j:\n i[q:q]=[j]\nfor a,b,c,d in [[*map(int,input().split())] for i in range(n)]:\n m=min((a,b),(c,d))\n xy[m[0]][m[1]]=1\n xs.add(m[0])\n ys.add(m[1])\n if a==c:\n t([x[a],x[a],y[m[1]]],[b,d,m[0]])\n if b==d:\n t([y[b],y[b],x[m[0]]],[a,c,m[1]])\nfor i in xs:\n for j in range(len(x[i])):\n if xy[i][x[i][j]]:\n xy[i][x[i][j]]*=x[i][j+1]-x[i][j]\nfor i in ys:\n for j in range(len(y[i])):\n if xy[y[i][j]][i]:\n p=xy[y[i][j]][i]*(y[i][j+1]-y[i][j])\n if p<len(g)-1:g[p]+=1\n else:g[-1].append(p)\ns=[]\nfor i,j in enumerate(g[:-1]):\n s.extend([str(i)]*j)\ng[-1].sort()\ns.extend([str(i) for i in g[-1]])\nprint(' '.join(s))\n\n\n\n\n", "WHn = [[0,0]]\r\n# WHn[0].extend(list(map(int, input().split(' '))))\r\nWHn[0].extend([int(x) for x in input().split(' ')])\r\n\r\nn = range(WHn[0][-1])\r\nlines = []\r\nlines_aux = []\r\n\r\nfor i in n:\r\n lines.append( [int(x) for x in input().split(' ')] )\r\n lines_aux.append(True)\r\n\r\nwhile any(lines_aux):\r\n \r\n for i in n:\r\n\r\n if lines_aux[i]:\r\n\r\n for unidad in WHn:\r\n\r\n rangex = range(unidad[0], unidad[2]+1)\r\n rangey = range(unidad[1], unidad[3]+1)\r\n \r\n if (lines[i][0] in rangex) and (lines[i][3] in rangey) and (lines[i][2] in rangex) and (lines[i][1] in rangey) and\\\r\n ( (lines[i][0:3:2] == unidad[0:3:2]) or (lines[i][1:4:2] == unidad[1:4:2]) ):\r\n\r\n WHn.append([unidad[0],unidad[1],lines[i][2],lines[i][3]])\r\n WHn.append([lines[i][0],lines[i][1],unidad[2],unidad[3]])\r\n WHn.remove(unidad)\r\n lines_aux[i] = False\r\n break\r\n\r\nfor i,unidad in enumerate(WHn):\r\n WHn[i] = (unidad[2] - unidad[0])*(unidad[3] - unidad[1])\r\n\r\nWHn.sort()\r\nresult = ''\r\nfor i in WHn:\r\n result += '{} '\r\n\r\nprint(result[:-1].format(*WHn))\r\n", "from collections import deque\r\nimport sys\r\ninput = sys.stdin.readline\r\n\r\ndef bfs(x, y):\r\n q = deque()\r\n q.append((x, y))\r\n visit[x][y] = 1\r\n c = 0\r\n while q:\r\n i, j = q.popleft()\r\n c += 1\r\n for di, dj in G[i][j]:\r\n ni, nj = i + di, j + dj\r\n if 0 <= ni < w and 0 <= nj < h:\r\n if not visit[ni][nj]:\r\n q.append((ni, nj))\r\n visit[ni][nj] = 1\r\n return c\r\n\r\nw, h, n = map(int, input().split())\r\nv = [(1, 0), (-1, 0), (0, 1), (0, -1)]\r\nG = [[set(v) for _ in range(h)] for _ in range(w)]\r\nfor _ in range(n):\r\n x1, y1, x2, y2 = map(int, input().split())\r\n if x1 == x2:\r\n for y in range(y1, y2):\r\n G[x1 - 1][y].remove((1, 0))\r\n for y in range(y1, y2):\r\n G[x1][y].remove((-1, 0))\r\n else:\r\n for x in range(x1, x2):\r\n G[x][y1 - 1].remove((0, 1))\r\n for x in range(x1, x2):\r\n G[x][y1].remove((0, -1))\r\nvisit = [[0] * h for _ in range(w)]\r\nans = []\r\nfor x in range(w):\r\n for y in range(h):\r\n if not visit[x][y]:\r\n c = bfs(x, y)\r\n ans.append(c)\r\nans.sort()\r\nsys.stdout.write(\" \".join(map(str, ans)))", "w, h, n = map(int, input().split(' '))\nhblock = [[False for i in range(w)] for i in range(h)]\nvblock = [[False for i in range(w)] for i in range(h)]\n\nfor i in range(n):\n x1, y1, x2, y2 = map(int, input().split(' '))\n if x1 == x2:\n for j in range(y1, y2):\n hblock[j][x1-1] = True\n else:\n for j in range(x1, x2):\n vblock[y1-1][j] = True\n\nareas = []\nvis = [[False for i in range(w)] for i in range(h)]\nfor i in range(h):\n for j in range(w):\n if vis[i][j]:\n continue\n width = j\n while width < w and not hblock[i][width]:\n width += 1\n height = i\n while height < h and not vblock[height][j]:\n height += 1\n width = min(w - 1, width) - j + 1\n height = min(h - 1, height) - i + 1\n areas.append(width * height)\n for p in range(height):\n for q in range(width):\n vis[i + p][j + q] = True\nareas.sort()\nprint(' '.join(map(str, areas)))\n" ]

[ "def ccw(A, B, C):\n return (C[1] - A[1]) * (B[0] - A[0]) > (B[1] - A[1]) * (C[0] - A[0])\n\n\ndef intersect(A, B, C, D):\n return ccw(A, C, D) != ccw(B, C, D) and ccw(A, B, C) != ccw(A, B, D)\n\n\nR, B = map(int, input().split())\n\nrs = []\nbs = []\nfor r in range(R):\n rs.append(list(map(int, input().split())))\nfor r in range(B):\n bs.append(list(map(int, input().split())))\n\nif R != B:\n print('No')\nelse:\n def rec(at, done, remain):\n if at >= B:\n return True\n for b in remain:\n for r, d in zip(rs, done):\n if intersect(r, bs[d], rs[at], bs[b]):\n break\n else:\n ok = rec(at + 1, done + [b], remain - {b})\n if ok:\n return True\n return False\n\n print(['NO', 'YES'][rec(0, [], set(range(B)))])\n", "(R,B)=map(int,input().split())\r\nfor i in range(R+B):\r\n x=input()\r\nif R==B:\r\n print('Yes')\r\nelse:\r\n print('No')", "r, b = [int(i) for i in input().split()]\r\nfor i in range(r):\r\n discard = [int(i) for i in input().split()]\r\n \r\nprint(\"Yes\" if r == b else \"No\")", "R,B = map(int,input().split())\r\nif R == B:\r\n print('yes')\r\nelse:\r\n print('no')", "\r\nm, n = list(map(int, input().split()))\r\nif m==n: print(\"Yes\")\r\nelse: print(\"No\")", "x,y=map(int,input().split())\r\nif(x == y):\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")", "B, R = map(int, input().split())\r\nif B == R:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a, b = list(map(int, input().split()))\nif a==b: print(\"Yes\")\nelse: print(\"No\")\n", "R,B=map(int,input().split())\r\nif R==B:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")", "r,b = map(int,input().strip().split())\r\nprint(\"Yes\" if r==b else \"No\")\r\n", "n,m=map(int,input().split())\r\nfor i in range(n):\r\n x,y=map(int,input().split())\r\nfor i in range(m):\r\n x,y=map(int,input().split())\r\nprint(\"Yes\" if n==m else \"No\")", "# LUOGU_RID: 120395906\ns=input().split()\nif int(s[0])==int(s[1]):print(\"Yes\")\nelse:print(\"No\")", "class Point:\r\n def __init__(self,x=0,y=0):\r\n self.x = x\r\n self.y = y\r\n \r\n def __str__(self):\r\n return \"({0},{1})\".format(self.x, self.y)\r\n\r\n def __add__(self, other):\r\n x = self.x + other.x\r\n y = self.y + other.y\r\n return Point(x,y)\r\n\r\n def __sub__(self, other):\r\n x = self.x - other.x\r\n y = self.y - other.y\r\n return Point(x,y)\r\n\r\n def __xor__(self, other): #wedge product\r\n return self.x*other.y - self.y*other.x\r\n\r\n def __mul__(self, other): #dot product\r\n return self.x*other.x + self.y*other.y\r\n\r\nclass Line:\r\n def __init__(self,s,e):\r\n self.xmax = max(s.x,e.x)\r\n self.xmin = min(s.x,e.x)\r\n self.ymax = max(s.y,e.y)\r\n self.ymin = min(s.y,e.y)\r\n self.v = e-s\r\n self.s = s\r\n self.e = e\r\n\r\n def __str__(self):\r\n return \"[{0}=>{1}]\".format(self.s, self.e)\r\n\r\n def __xor__(self, other): #L1^L2 = Point of intersect\r\n pass\r\n \r\n def __and__(self, other): #L1&L2 = True if intersect else False\r\n return \\\r\n self.xmax >= other.xmin and \\\r\n self.ymax >= other.ymin and \\\r\n self.xmin <= other.xmax and \\\r\n self.ymin <= other.ymax and \\\r\n ((other.s-self.s)^ self.v)*((other.e-self.s)^ self.v)<=0 and \\\r\n ((self.s-other.s)^other.v)*((self.e-other.s)^other.v)<=0\r\n\r\ndef dfs(i):\r\n global R,B,LS,BA,n\r\n if i==n: return True\r\n for j in range(n):\r\n if not BA[j]: continue\r\n nl = Line(R[i],B[j])\r\n good = True\r\n for ol in LS:\r\n if nl&ol:\r\n good = False\r\n break\r\n if not good: continue\r\n BA[j] = False\r\n LS.add(nl)\r\n if dfs(i+1): return True\r\n BA[j] = True #disconnect\r\n LS.remove(nl) #unregister\r\n return False\r\n\r\ndef solv(n,m):\r\n if n!=m: return \"No\"\r\n return \"Yes\" if dfs(0) else \"No\"\r\n\r\nn,m = map(int,input().split())\r\nR = [Point(*map(int,input().split())) for _ in range(n)]\r\nB = [Point(*map(int,input().split())) for _ in range(m)]\r\nLS = set()\r\nBA = [True]*n #B[i] available?\r\nprint(solv(n,m))\r\n", "n,m=[int(x) for x in input().split()]\r\nfor i in range(n+m):\r\n s=input()\r\nif n==m:\r\n print('Yes')\r\nelse:\r\n print('No')", "s=input().split()\r\nif int(s[0])==int(s[1]):print(\"Yes\")\r\nelse:print(\"No\")", "a,b = map(int, input().split())\nif(a==b): print(\"YES\")\nelse: print(\"NO\")", "b,r = input().split()\r\n#print(\"b = \",b)\r\nfor x in range(int(b)):\r\n temp,temp = input().split()\r\nfor x in range(int(r)):\r\n temp,temp = input().split()\r\nif(b==r):\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")", "r,b=map(int,input().split())\r\nfor i in range(r+b):\r\n input()\r\nif r==b:print('Yes');\r\nelse:print('No')", "a,b = map(int,input().split())\r\nfor i in range(a+b):\r\n n,m = map(int,input().split())\r\nif a == b:\r\n print('Yes')\r\nelse:\r\n print('No')\r\n", "r, b = map(int,input().split())\r\nprint(('No', 'Yes')[r == b])", "# LUOGU_RID: 118856779\na,b= map(int,input().split())\nprint('Yes' if a == b else 'No')", "a, b = map(int, input().split())\nif a == b:\n print('Yes')\nelse:\n print('No')\n \t\t\t\t \t\t \t \t \t \t \t", "print(('No', 'Yes')[len(set(input().split())) == 1])", "str1=input()\r\nl_1 = str1.split(' ')\r\ntedad=int(l_1[0])\r\ntedad1=int((l_1[1]))\r\nfor i in range(tedad):\r\n n=input()\r\nfor i in range(tedad1):\r\n n=input()\r\n\r\n\r\nif tedad1==tedad:\r\n print('Yes')\r\nelse:\r\n print('No')", "R, B = map(int, input().split())\r\n\r\nprint(('No', 'Yes')[R == B])\r\n", "r, b = input().split()\r\nprint(['No','Yes'][r==b])", "a = input().split()\r\nif a[0] == a[1]:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "r, b = map(int, input().split())\r\nif r == b:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")", "l = input().split(' ')\r\nprint(\"Yes\" if int(l[0]) == int(l[1]) else \"No\")", "# LUOGU_RID: 118871776\nprint(\"Yes\" if (lambda a, b: a == b)(*input().split()) else \"No\")", "import math\r\n\r\n\r\nR, B = map(int, input().split(' '))\r\nprint('Yes' if R == B else 'No')\r\n" ]

[ "n = input()\r\nlth = len(n)\r\na = n.find('+')\r\nb = n.find('=') - a - 1\r\nc = len(n) - n.find('=') - 1\r\nif a + b == c:\r\n print(n)\r\nelif a + b == c - 2:\r\n print('|',n[:lth-1],sep=\"\")\r\nelif a + b == c + 2:\r\n if a >= 2:\r\n print(n[1:],'|',sep=\"\")\r\n else:\r\n print(n[:a+1],n[a+2:],'|',sep=\"\")\r\nelse:\r\n print('Impossible')\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "g = input()\nimport re\nm = re.match(\"(\\|+)\\+(\\|+)=(\\|+)\",g)\nz = m.group\na = len(z(1))\nb = len(z(2))\nc = len(z(3))\nif a + b == c - 2:\n\tprint('|' * (a + 1) + '+' + '|' * b + '=' + '|' * (c - 1))\nelif a + b == c + 2:\n\tif a == 1:\n\t\tprint('|' * a + '+' + '|' * (b - 1) + '=' + '|' * (c + 1))\n\telse:\n\t\tprint('|' * (a - 1) + '+' + '|' * b + '=' + '|' * (c + 1))\nelif a + b == c:\n\tprint(g)\nelse:\n\tprint(\"Impossible\")", "def crum(x):\r\n y=''\r\n for i in range(x):\r\n y+='|'\r\n return y\r\n\r\na,b = input().split('+')\r\n\r\ns=a+\"+\"+b\r\n\r\nb,c=b.split('=')\r\n\r\nx = a.count('|')\r\ny = b.count('|')\r\nz = c.count('|')\r\n\r\nif x+y==z:\r\n print(s)\r\nelse:\r\n if (x-1)+(y+1) == z and (x-1)>0:\r\n print(crum(x-1)+'+'+crum(y+1)+'='+crum(z))\r\n elif (x-1)+y == (z+1) and (x-1)>0:\r\n print(crum(x-1)+'+'+crum(y)+'='+crum(z+1))\r\n elif (x+1)+(y-1) == z and (y-1)>0:\r\n print(crum(x+1)+'+'+crum(y-1)+'='+crum(z))\r\n elif x+(y-1) == (z+1) and (y-1)>0:\r\n print(crum(x)+'+'+crum(y-1)+'='+crum(z+1))\r\n elif (x+1)+y == (z-1) and (z-1)>0:\r\n print(crum(x+1)+'+'+crum(y)+'='+crum(z-1))\r\n elif x+(y+1) == (z-1) and (z-1)>0:\r\n print(crum(x)+'+'+crum(y+1)+'='+crum(z-1))\r\n else:\r\n print(\"Impossible\")\r\n", "\ndef check(a,b,c):\n if a + b == c:\n return '|'*a + \"+\" + \"|\"*b + \"=\" + \"|\"*c\n\n if a + b == c - 2:\n a += 1\n c -= 1\n\n return '|' * a + \"+\" + \"|\" * b + \"=\" + \"|\" * c\n if a + b == c + 2:\n if a > b:\n a -= 1\n else:\n b -= 1\n c += 1\n return '|' * a + \"+\" + \"|\" * b + \"=\" + \"|\" * c\n\n return \"Impossible\"\n\n\nline = input()\na,b = line.split(\"+\")\nb,c = b.split(\"=\")\na = len(a)\nb = len(b)\nc = len(c)\n\nprint(check(a,b,c))", "arr1 = input()\r\nA, B = arr1.split(\"+\")\r\nB, C = B.split(\"=\")\r\nn1, n2, n3 = len(A), len(B), len(C)\r\nif (n1 + 1 + n2) == (n3 - 1):\r\n # temp = list(C)\r\n # temp.pop()\r\n # ans = str(temp)\r\n # ans = ans.replace(\"[\", \"\")\r\n # ans = ans.replace(\"]\", \"\")\r\n # ans = ans.replace(\",\", \"\")\r\n # ans = ans.replace(\"'\", \"\")\r\n # ans = ans.replace(\" \", \"\")\r\n # C = ans\r\n print(A + \"|\" + \"+\" + B + \"=\" + C[:n3-1])\r\n\r\nelif (n1 + n2 - 1) == (n3 + 1):\r\n if (n1 > n2):\r\n # temp = list(A)\r\n # temp.pop()\r\n # ans = str(temp)\r\n # ans = ans.replace(\"[\", \"\")\r\n # ans = ans.replace(\"]\", \"\")\r\n # ans = ans.replace(\",\", \"\")\r\n # ans = ans.replace(\"'\", \"\")\r\n # ans = ans.replace(\" \", \"\")\r\n # A = ans\r\n print(A[:n1-1] + \"+\" + B + \"=\" + C + \"|\")\r\n else:\r\n # temp = list(B)\r\n # temp.pop()\r\n # ans = str(temp)\r\n # ans = ans.replace(\"[\", \"\")\r\n # ans = ans.replace(\"]\", \"\")\r\n # ans = ans.replace(\",\", \"\")\r\n # ans = ans.replace(\"'\", \"\")\r\n # ans = ans.replace(\" \", \"\")\r\n # B = ans\r\n print(A + \"+\" + B[:n2-1] + \"=\" + C + \"|\")\r\n\r\nelif (n1 + n2) == n3:\r\n print(arr1)\r\n\r\nelse:\r\n print(\"Impossible\")\r\n\r\n\r\n# t = input()\r\n# k = t.find('=')\r\n# n = 2 * k - len(t)\r\n# if n == 2:\r\n# if t[1] != '+':\r\n# t = t[1:] + '|'\r\n# else:\r\n# t = t[: k - 1] + t[k:] + '|'\r\n# elif n == -2:\r\n# t = '|' + t[: -1]\r\n# elif n != 0:\r\n# t = 'Impossible'\r\n# print(t)\r\n", "x,c=map(str,input().split('='))\r\na,b=map(str,x.split('+'))\r\nif len(a)+len(b)==len(c):\r\n print(a+'+'+b+'='+c)\r\nelif len(a)+len(b)+2==len(c):\r\n print(a+'|+'+b+'='+c[0:len(c)-1])\r\n \r\nelif len(a)+len(b)==len(c)+2:\r\n if len(a)>1:\r\n print(a[0:len(a)-1]+'+'+b+'='+c+'|')\r\n else:\r\n print(a+'+'+b[0:len(b)-1]+'='+c+'|')\r\nelse:\r\n print(\"Impossible\")\r\n", "string = input().strip()\r\na1, a2 = string.split('=')[0].split('+')\r\nb = string.split('=')[1]\r\nlen_a = len(a1) + len(a2)\r\n\r\nif abs(len_a - len(b)) > 2 or abs(len_a - len(b)) == 1:\r\n print('Impossible') \r\nelif len_a - len(b) == 0:\r\n print(string)\r\nelif len(b) - len_a == 2:\r\n print(\"%s|+%s=%s\"%(a1, a2, b[:-1]))\r\nelif len(a1) == 1:\r\n print(\"%s+%s=%s|\"%(a1, a2[:-1], b))\r\nelse:\r\n print(\"%s+%s=%s|\"%(a1[:-1], a2, b))", "from sys import stdin\r\ndef main():\r\n f=stdin.readline().strip()\r\n x=f.split(\"+\")\r\n y=x[1].split(\"=\")\r\n a,b,c=x[0],y[0],y[1]\r\n if len(a)+len(b)==len(c):\r\n print(f)\r\n elif len(a)-1>=1 and len(a)-1 + len(b)==len(c)+1:\r\n c=c+\"|\"\r\n d=[]\r\n for i in range(len(a)):\r\n d.append(a[i])\r\n d.remove(d[i])\r\n a=''.join(d)\r\n n=a+'+'+b+'='+c\r\n print(n)\r\n elif len(c)-1>=1 and len(a)+1 + len(b) == len(c)-1:\r\n a=a+\"|\"\r\n d=[]\r\n for i in range(len(c)):\r\n d.append(c[i])\r\n d.remove(d[i])\r\n c=''.join(d)\r\n n=a+'+'+b+'='+c\r\n print(n)\r\n elif len(b)-1>=1 and len(a) + len(b)-1 == len(c)+1:\r\n c=c+\"|\"\r\n d=[]\r\n for i in range(len(b)):\r\n d.append(b[i])\r\n d.remove(d[i])\r\n b=''.join(d)\r\n n=a+'+'+b+'='+c\r\n print(n)\r\n elif len(c)-1>=0 and len(a)+ len(b)+1 == len(c)-1:\r\n b=b+\"|\"\r\n d=[]\r\n for i in range(len(c)):\r\n d.append(c[i])\r\n d.remove(d[i])\r\n c=''.join(d)\r\n n=a+'+'+b+'='+c\r\n print(n)\r\n else:\r\n print(\"Impossible\")\r\n \r\nmain()", "import sys\n\ndef equ_balanced(num1, num2, num3):\n\tif (num1 + num2 == num3):\n\t\treturn True\n\telse:\n\t\treturn False\n\ndef to_stick(num1, num2, num3):\n\tprint(\"|\" * num1, end = '')\n\tprint(\"+\", end = '')\n\tprint(\"|\" * num2, end = '')\n\tprint(\"=\", end = '')\n\tprint(\"|\" * num3)\n\ndef shift_stick1(num1, num2, sum):\n\tif (num1 <= 1):\n\t\treturn False\n\ta = num1 - 1\n\tb = num2 + 1\n\ts = sum\n\tif (equ_balanced(a, b, s)):\n\t\tto_stick(a, b, s)\n\t\treturn True\n\ta = num1 - 1\n\tb = num2\n\ts = sum + 1\n\tif (equ_balanced(a, b, s)):\n\t\tto_stick(a, b, s)\n\t\treturn True\n\ndef shift_stick2(num1, num2, sum):\n\tif (num2 <= 1):\n\t\treturn False\n\ta = num1 + 1\n\tb = num2 - 1\n\ts = sum\n\tif (equ_balanced(a, b, s)):\n\t\tto_stick(a, b, s)\n\t\treturn True\n\ta = num1\n\tb = num2 - 1\n\ts = sum + 1\n\tif (equ_balanced(a, b, s)):\n\t\tto_stick(a, b, s)\n\t\treturn True\n\ndef shift_stick3(num1, num2, sum):\n\tif (sum <= 1):\n\t\treturn False\n\ta = num1 + 1\n\tb = num2\n\ts = sum - 1\n\tif (equ_balanced(a, b, s)):\n\t\tto_stick(a, b, s)\n\t\treturn True\n\ta = num1\n\tb = num2 + 1\n\ts = sum - 1\n\tif (equ_balanced(a, b, s)):\n\t\tto_stick(a, b, s)\n\t\treturn True\n\nequation = input()\nnum1 = 0\nnum2 = 0\nsum = 0\nstr_len = len(equation)\ni = 0\nwhile i < str_len and equation[i] != '+':\n\tnum1 = num1 + 1\n\ti += 1\ni += 1\nwhile i < str_len and equation[i] != '=':\n\tnum2 = num2 + 1\n\ti += 1\ni += 1\nwhile i < str_len and equation[i] != '+':\n\tsum = sum + 1\n\ti += 1\n\nif (equ_balanced(num1, num2, sum) == True):\n\tto_stick(num1, num2, sum)\nelif (shift_stick1(num1, num2, sum) == True):\n\tsys.exit()\nelif (shift_stick2(num1, num2, sum) == True):\n\tsys.exit()\nelif (shift_stick3(num1, num2, sum) == True):\n\tsys.exit()\nelse:\n\tprint(\"Impossible\")", "s = input()\r\nl = []\r\nl = s.split(\"+\")\r\ntemp = l[1].split(\"=\")\r\nl[1] = temp[0]\r\nl.append(temp[1])\r\na = []\r\nfor i in l:\r\n a.append(i.count(\"|\"))\r\nresult = (a[0] + a[1]) - a[2]\r\nif result == 0:\r\n print(s)\r\nelif result == 2:\r\n l[2] += \"|\"\r\n if a[0] == 1:\r\n l[1] = l[1][:-1]\r\n else:\r\n l[0] = l[0][:-1]\r\n print(l[0] + \"+\" + l[1] + \"=\" + l[2])\r\nelif result == -2:\r\n l[0] += \"|\"\r\n l[2] = l[2][:-1]\r\n print(l[0] + \"+\" + l[1] + \"=\" + l[2])\r\nelse:\r\n print(\"Impossible\")\r\n", "'''\r\n\tCodeForces 394A\r\n\tCounting Sticks\r\n\r\n\tTags: string manipulation\r\n'''\r\nimport re\r\n\r\ndef stickToTuple(s):\r\n\ttemp = re.match(r'(\\|+)\\+(\\|+)=(\\|+)', s)\r\n\treturn tuple(map(len, temp.groups()))\r\n\r\ndef tupleToStick(a, b, c):\r\n\treturn '{}+{}={}'.format('|' * a, '|' * b, '|' * c)\r\n\r\ndef solve(a, b, c):\r\n\tif a + b == c:\r\n\t\treturn tupleToStick(a, b, c)\r\n\tif a + b - 1 == c + 1:\r\n\t\tif a > 1:\r\n\t\t\treturn tupleToStick(a - 1, b, c + 1)\r\n\t\treturn tupleToStick(a, b - 1, c + 1)\r\n\tif a + b + 1 == c - 1 and c > 1:\r\n\t\treturn tupleToStick(a + 1, b, c - 1)\r\n\treturn 'Impossible'\r\n\r\ns = input()\r\nprint(solve(*stickToTuple(s)))", "if __name__ == '__main__':\n string = input()\n [AB, C] = string.split('=')\n [A, B] = AB.split('+')\n\n a = len(A)\n b = len(B)\n c = len(C)\n found = False\n\n if a + b == c:\n found = True\n elif a > 1 and (a - 1) + b == (c + 1):\n a -= 1\n c += 1\n found = True\n elif b > 1 and a + (b - 1) == (c + 1):\n b -= 1\n c += 1\n found = True\n elif c > 1:\n if (a + 1) + b == (c - 1):\n a += 1\n c -= 1\n found = True\n elif a + (b + 1) == (c - 1):\n b += 1\n c -= 1\n found = True\n\n if found:\n A = ''.join(['|' for _ in range(a)])\n B = ''.join(['|' for _ in range(b)])\n C = ''.join(['|' for _ in range(c)])\n print('%s+%s=%s' % (A, B, C))\n else:\n print('Impossible')\n", "class CodeforcesTask394ASolution:\n def __init__(self):\n self.result = ''\n self.expression = ''\n\n def read_input(self):\n self.expression = input()\n\n def process_task(self):\n expr = self.expression.split(\"=\")\n c = len(expr[1])\n a = len(expr[0].split(\"+\")[0])\n b = len(expr[0].split(\"+\")[1])\n # print(a, b, c)\n diff = abs((a + b) - c)\n if diff == 0 or diff == 2:\n if c > a + b:\n a += 1\n c -= 1\n self.result = \"|\" * a + \"+\" + \"|\" * b + \"=\" + \"|\" * c\n elif not diff:\n self.result = self.expression\n elif a + b > 2:\n if a > 1:\n a -= 1\n else:\n b -= 1\n c += 1\n self.result = \"|\" * a + \"+\" + \"|\" * b + \"=\" + \"|\" * c\n else:\n self.result = \"Impossible\"\n else:\n self.result = \"Impossible\"\n\n def get_result(self):\n return self.result\n\n\nif __name__ == \"__main__\":\n Solution = CodeforcesTask394ASolution()\n Solution.read_input()\n Solution.process_task()\n print(Solution.get_result())\n", "def printer(a , b , c):\r\n\tans = \"\"\r\n\tfor i in range(int(a)):\r\n\t\tans += '|'\r\n\tans += '+'\r\n\tfor i in range(int(b)):\r\n\t\tans += '|'\r\n\tans += '='\r\n\tfor i in range(int(c)):\r\n\t\tans += '|'\r\n\tprint(ans)\t\r\na = input()\r\nn1 = len(a[:a.index('+')])\r\nn2 = len(a[a.index('+') + 1 : a.index('=')])\r\nn3 = len(a[a.index('=') + 1:])\r\nif(n1 + n2 == n3):\r\n\tprint(a)\r\nelse:\r\n\tif(n1 + n2 - n3 == 2):\r\n\t\tif(n1 > n2):\r\n\t\t\tprinter(n1-1,n2,n3+1)\r\n\t\telse:\r\n\t\t\tprinter(n1,n2-1,n3+1)\r\n\telif(n3 - (n1 + n2) == 2):\r\n\t\tprinter(n1 + 1 , n2 , n3 - 1)\r\n\telse:\r\n\t\tprint('Impossible')\r\n ", "s, c = input().split('=')\na, b = s.split('+')\na, b, c = map(len, [a, b, c])\n\nif a + b != c:\n\tif a > 1 and a - 1 + b == c + 1:\n\t\ta -= 1\n\t\tc += 1\n\telif b > 1 and a + b - 1 == c + 1:\n\t\tb -= 1\n\t\tc += 1\n\telif c > 1 and a + 1 + b == c - 1:\n\t\tc -= 1\n\t\ta += 1\n\telse:\n\t\tprint(\"Impossible\")\n\t\texit()\nprint(\"|\" * a + \"+\" + \"|\" * b + \"=\" + \"|\" * c)\n", "s=input()\r\nvar=[0]*3\r\nle=len(s)\r\nk=0\r\nfor i in range(len(s)):\r\n if s[i]=='|':\r\n var[k]+=1\r\n else:\r\n k+=1\r\nif var[0]+var[1]==var[2]:\r\n for i in range(var[0]):\r\n print(\"|\",end='')\r\n print(\"+\",end='')\r\n for i in range(var[1]):\r\n print(\"|\",end='')\r\n print(\"=\",end='')\r\n for i in range(var[2]):\r\n print(\"|\",end='')\r\nelif var[0]+1+var[1]==var[2]-1 and var[2]-1>0:\r\n for i in range(var[0]+1):\r\n print(\"|\",end='')\r\n print(\"+\",end='')\r\n for i in range(var[1]):\r\n print(\"|\",end='')\r\n print(\"=\",end='')\r\n for i in range(var[2]-1):\r\n print(\"|\",end='')\r\nelif var[0]-1+var[1]==var[2]+1 and var[0]-1>0:\r\n for i in range(var[0]-1):\r\n print(\"|\",end='')\r\n print(\"+\",end='')\r\n for i in range(var[1]):\r\n print(\"|\",end='')\r\n print(\"=\",end='')\r\n for i in range(var[2]+1):\r\n print(\"|\",end='')\r\nelif var[0]+var[1]-1==var[2]+1 and var[1]-1>0:\r\n for i in range(var[0]):\r\n print(\"|\",end='')\r\n print(\"+\",end='')\r\n for i in range(var[1]-1):\r\n print(\"|\",end='')\r\n print(\"=\",end='')\r\n for i in range(var[2]+1):\r\n print(\"|\",end='')\r\nelse:\r\n print(\"Impossible\")", "#! /usr/bin/python\r\n\r\ndef sol():\r\n z = input()\r\n a = z.split('+')\r\n b = list(map(len, [a[0]] + a[1].split('=')))\r\n\r\n a, b, c = b\r\n\r\n if (a + b == c):\r\n # do nothing\r\n pass\r\n elif (a + b == c - 2):\r\n c -= 1\r\n a += 1\r\n elif (a + b == c + 2):\r\n if a == 1:\r\n b -= 1\r\n c += 1\r\n else:\r\n a -= 1\r\n c += 1\r\n else:\r\n print(\"Impossible\")\r\n return\r\n\r\n exp = \"\"\r\n\r\n for i in range(a):\r\n exp += '|'\r\n exp += '+'\r\n\r\n for i in range(b):\r\n exp += '|'\r\n exp += '='\r\n\r\n for i in range(c):\r\n exp += '|'\r\n\r\n print(exp)\r\n\r\nsol()", "ab, c = input().split('=')\r\na, b = ab.split('+')\r\n\r\nif a.count('|') + b.count('|') == c.count('|'):\r\n print(ab + '=' + c)\r\nelse:\r\n if ab.count('|')+1 == c.count('|')-1:\r\n print(ab + '|=' + c.replace('|', '', 1))\r\n\r\n elif ab.count('|')-1 == c.count('|')+1:\r\n if a.count('|')-1 > 0:\r\n print(ab.replace('|', '', 1)+'='+c+'|')\r\n else:\r\n print(a + '+' + b.replace('|', '', 1) + '=' + c + '|')\r\n else:\r\n print('Impossible')\r\n", "s = input()\r\na = len(s.split('+')[0])\r\nb, c = map(len, s[a + 1:].split('='))\r\n\r\nif abs(c - (a + b)) not in [0, 2]:\r\n print('Impossible')\r\nelse:\r\n if a + b < c:\r\n a += 1\r\n c -= 1\r\n elif a + b > c:\r\n c += 1\r\n if a > b:\r\n a -= 1\r\n else:\r\n b -= 1\r\n print(f'{\"|\" * a}+{\"|\" * b}={\"|\" * c}')\r\n", "t = input()\nk = t.find('=')\nn = 2 * k - len(t)\nif n == 2:\n if t[1] != '+': t = t[1: ] + '|'\n else: t = t[: k - 1] + t[k: ] + '|'\nelif n == -2: t = '|' + t[: -1]\nelif n != 0: t = 'Impossible'\nprint(t)", "def function(expr):\n A, subexpr = expr.split('+')\n B, C = subexpr.split('=')\n a = A.count('|')\n b = B.count('|')\n c = C.count('|')\n if abs(a + b - c) == 2:\n if a + b > c:\n if a != 1:\n a -= 1\n c += 1\n else:\n b -= 1\n c += 1\n else:\n c -= 1\n a += 1\n return ('|' * a) + ('+') + ('|' * b) + ('=') + ('|' * c)\n elif abs(a + b - c) == 0:\n return expr\n else:\n return 'Impossible'\n\n\ndef main():\n expr = input().strip()\n expr = function(expr)\n print(expr)\n\n\nif __name__ == '__main__':\n main()\n", "\"\"\"Counting Sticks\"\"\"\r\nimport sys\r\n\r\n\r\ndef main():\r\n# A + B = C\r\n## A + 1 <----- B - 1 ,,,, C - 1 \\\\\\\\\\ A - 1 -----> B + 1 ,,, C + 1\r\n## B + 1 <----- A - 1 ,,,, C - 1 \\\\\\\\\\ B - 1 -----> A + 1 ,,, C + 1\r\n## C + 1 <----- A - 1 ,,,, B - 1 \\\\\\\\\\ C - 1 -----> A + 1 ,,, B + 1\r\n\r\n expression = input()\r\n lhs = expression.find(\"+\")\r\n rhs = len(expression) - expression.find(\"=\") - 1\r\n mid = expression.find(\"=\") - expression.find(\"+\") - 1\r\n if lhs + mid == rhs:\r\n print(expression)\r\n sys.exit()\r\n else:\r\n if lhs + mid == rhs + 2: # Then a stick was moved from lhs to rhs\r\n if lhs > 1:\r\n expression = expression[1:] + \"|\"\r\n print(expression)\r\n else:\r\n mid -= 1\r\n print(\"|\"*lhs +\"+\"+ \"|\"*mid + \"=\" + \"|\"*(rhs + 1))\r\n elif lhs + mid == rhs - 2: # Then a stick was moved from rhs to lhs\r\n rhs -= 1\r\n mid += 1\r\n print(\"|\"*lhs +\"+\"+ \"|\"*mid + \"=\" + \"|\"*rhs)\r\n else:\r\n print(\"Impossible\")\r\n\r\n\r\n\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "def checkCond(a_count, b_count, rhs_count):\n if a_count + b_count == rhs_count:\n return True\n else:\n return False\n \ndef generating_answer(a, b, rhs, count):\n s = a + '+' + b + '=' + rhs\n rhs_count = rhs.count('|')\n a_count = a.count('|')\n b_count = b.count('|')\n count +=1\n val = checkCond(a_count, b_count, rhs_count)\n \n if val:\n return s\n else:\n if count <= 1:\n if a_count + b_count > rhs_count: ## lhs is greater\n if a_count > b_count:\n ans = generating_answer(a[1:], b, rhs + '|', count)\n else:\n ans = generating_answer(a, b[1:], rhs + '|', count)\n else:\n ans = generating_answer(a + '|', b, rhs[1:], count)\n count +=1\n return ans\n else:\n return \"Impossible\"\n\n\n\nif __name__ == \"__main__\":\n s = input()\n count = 0\n lhs, rhs = s.split('=')[0], s.split('=')[1]\n a, b = lhs.split('+')[0], lhs.split('+')[1]\n\n \n ans = generating_answer(a, b, rhs, count)\n print(ans)", "import re\r\n\r\na, b, c = map(len, re.split(r'\\+|=', input()))\r\n\r\nfor i in [0, -1, 1]:\r\n if a + b - i == c + i:\r\n if a - i > 0:\r\n print(f\"{'|' * (a - i)}+{'|' * b}={'|' * (c + i)}\")\r\n exit()\r\n if b - i > 0:\r\n print(f\"{'|' * a}+{'|' * (b - i)}={'|' * (c + i)}\")\r\n exit()\r\n\r\nprint('Impossible')\r\n", "t = input()\ns = t.split('+')\ns = [s[0]] + s[1].split('=')\n\na = len(s[0])\nb = len(s[1])\nc = len(s[2])\n\nif a + b == c:\n pass\nelif a + b - 1 == c + 1 and b > 1:\n b -= 1\n c += 1\nelif a - 1 + b == c + 1 and a > 1:\n a -= 1\n c += 1\nelif a + b + 1 == c - 1 and c > 1:\n b += 1\n c -= 1\nelse:\n print('Impossible')\n exit(0)\n\nprint(\"{}+{}={}\".format('|'*a, '|'*b, '|'*c))\n\n", "s=input()\r\nop1=0\r\nop2=0\r\nres=0\r\nfor i in range(0,len(s)):\r\n if s[i]=='+':\r\n break\r\n op1 += 1\r\nfor j in range(i+1,len(s)):\r\n if s[j]=='=':\r\n break\r\n op2+=1\r\nres=len(s)-j-1\r\nadd=(op1+op2)-res\r\ndiff=abs((op1+op2)-res)\r\nif diff==0 or diff==2:\r\n if add<0:\r\n op1+=1\r\n res=res-1\r\n elif add>0:\r\n if op1>1:\r\n op1=op1-1\r\n res+=1\r\n else:\r\n op2=op2-1\r\n res+=1\r\n for k in range(0,op1):\r\n print('|',end='')\r\n print('+',end='')\r\n for m in range(0,op2):\r\n print('|',end='')\r\n print('=',end='')\r\n for z in range(0,res):\r\n print('|',end='')\r\n\r\n\r\nelse:\r\n print('Impossible')\r\n\r\n", "# CodeForces : Counting Sticks\r\nif __name__ == \"__main__\":\r\n exp= input()\r\n plus = exp.index('+') #find the signs indeces\r\n equal = exp.index('=')\r\n A= len(exp[0:plus]) #getting A , B , C \r\n B= len(exp[plus+1:equal])\r\n C=len(exp[equal+1:])\r\n if A+B+1==C-1: #ckeck if the expression can be obtained by moving one stick\r\n A+=1\r\n C-=1\r\n elif A+B-1==C+1:\r\n if A>1 :\r\n A-=1 \r\n else :\r\n B-=1\r\n C+=1\r\n if A+B==C : #printing results \r\n print('{}+{}={}'.format('|'*(A),'|'*B,'|'*(C)))\r\n else: \r\n print(\"Impossible\")\r\n ", "s = input().strip()\r\n(l, r) = s.split('=')\r\na_b = len(r)\r\na = len(l.split('+')[0])\r\nb = len(l.split('+')[1])\r\nis_possible = True\r\nif a+b == a_b-2:\r\n a += 1\r\n a_b -= 1\r\nelif a+b == a_b+2:\r\n if a > b: a -= 1\r\n else: b -= 1\r\n a_b += 1\r\nelif a+b != a_b:\r\n is_possible = False\r\nif is_possible:\r\n print('|'*a + '+' + '|'*b + '=' + '|'*a_b)\r\nelse:\r\n print('Impossible')\r\n", "str1 = input()\r\nstr = str1.split('=')\r\nans = str[0].split('+')\r\nr = len(ans[0]) + len(ans[1])\r\nif r-len(str[1])!=0 and r-len(str[1]) != -2 and r-len(str[1]) != 2:print(\"Impossible\")\r\nelse:\r\n a = len(ans[0])\r\n b = len(ans[1])\r\n c = len(str[1]) \r\n if r-c==2:\r\n if a>1: a-=1\r\n else:b-=1\r\n c += 1\r\n elif r-c==-2:\r\n a += 1\r\n c -=1\r\n print(a*'|'+'+'+b*'|'+'='+c*'|')", "suma, result = input().split('=')\nlen_result = len(result)\nsuma_1, suma_2 = suma.split('+')\nsuma_1, suma_2 = len(suma_1), len(suma_2)\nlen_suma = suma_1 + suma_2\nif (len_suma + len_result) % 2 == 0:\n\tif len_suma == len_result:\n\t\tprint(suma, '=', result, sep = '', end = '')\n\telif len_suma + 2 == len_result:\n\t\tprint(suma, '|', '=', result[:-1], sep = '', end = '')\n\telif len_suma == len_result + 2:\n\t\tif suma_1 == 1:\n\t\t\tprint(suma[:-1], '=|', result, sep = '', end = '')\n\t\telse:\n\t\t\tprint(suma[1:len(suma)], '=|', result, sep = '', end = '')\n\telse:\n\t\tprint('Impossible', sep = '', end = '')\nelse:\n\tprint('Impossible', sep = '', end = '')", "temp = input()\nafter = temp.split(\"=\")[1]\nbefore = temp.split(\"=\")[0]\nafterNum = after.count(\"|\")\nbeforeNum = before.count(\"|\")\nif(beforeNum == afterNum):\n print(temp)\nelif(afterNum - beforeNum == 2 ):\n before = \"|\" + before\n after = after[:-1]\n print(before + \"=\" + after)\nelif((beforeNum - afterNum == 2)):\n before = before.split(\"+\")\n if(before[0].count(\"|\") > before[1].count(\"|\")):\n before[0] = str(before[0][:-1])\n else:\n before[1] = str(before[1][:-1])\n before = \"+\".join(before)\n after = after + \"|\"\n print(before + \"=\" + after)\n\nelse:\n print(\"Impossible\")", "a, b, c = [n.count('|') for n in input().replace('=', '+').split('+')]\n\nC1 = abs(a + b - c) == 2\nC2 = a + b <= c\nC3 = a > 1\n\na = (a + C1 * C2 - C3 * (not C2))\nb = (b - (not C2) * (not C3))\nc = (c - C1 * C2 + (not C2))\n\nif not (a + b == c or C1):\n print(\"Impossible\")\nelse:\n print('{}+{}={}'.format(*[x * '|' for x in [a, b, c]]))", "def count(sticks):\r\n\treturn len(sticks)\r\nlhs, rhs = input().split('=')\r\na, b = [count(i) for i in lhs.split('+')]\r\nc = count(rhs)\r\nif c==a+b+2:\r\n\tc-=1\r\n\ta+=1\r\nelif c==a+b-2 and (a>1 or b>1):\r\n\tc+=1\r\n\tif a>1:\r\n\t\ta-=1\r\n\telse:\r\n\t\tb-=1\r\nif a+b==c:\r\n\tprint('|'*a + '+' + '|'*b + '=' + '|'*c)\r\nelse:\r\n\tprint('Impossible')", "t = input()\r\ns = t.split('+')\r\ns = [s[0]] + s[1].split('=')\r\na, b, c = len(s[0]), len(s[1]), len(s[2])\r\nif a + b == c:\r\n pass\r\nelif b > 1 and a + b - 1 == c + 1:\r\n b -= 1; c += 1\r\nelif a > 1 and a - 1 + b == c + 1:\r\n a -= 1; c += 1\r\nelif c > 1 and a + b + 1 == c - 1:\r\n b += 1; c -= 1\r\nelse:\r\n print('Impossible')\r\n exit()\r\nprint(\"{}+{}={}\".format(a * '|', b * '|', c * '|'))\r\n", "def Print(char, times):\n\tfor _ in range(times):\n\t\tprint(char, end='')\n\ndef main():\n\t_input = input()\n\tA = len(_input.split('+')[0])\n\tB = len(_input.split('+')[1].split('=')[0])\n\tC = len(_input.split('+')[1].split('=')[1])\n\t# print(A, B, C)\n\tif A + B + 1 == C - 1:\n\t\tPrint('|', A + 1)\n\t\tprint('+', end='')\n\t\tPrint('|', B)\n\t\tprint('=', end='')\n\t\tPrint('|', C - 1)\n\t\tprint()\n\telif A + B - 1 == C + 1:\n\t\tif A == 1:\n\t\t\tPrint('|', A)\n\t\t\tprint('+', end='')\n\t\t\tPrint('|', B - 1)\n\t\t\tprint('=', end='')\n\t\t\tPrint('|', C + 1)\n\t\t\tprint()\n\t\telse:\n\t\t\tPrint('|', A - 1)\n\t\t\tprint('+', end='')\n\t\t\tPrint('|', B)\n\t\t\tprint('=', end='')\n\t\t\tPrint('|', C + 1)\n\t\t\tprint()\n\telif A + B == C:\n\t\tprint(_input)\n\telse:\n\t\tprint('Impossible')\n\t\t\nif __name__ == '__main__':\n\tmain()\n\n# ||+|=|||||\n", "s = input()\r\n\r\nx, y = s.split(\"=\")\r\n\r\na, b = x.split(\"+\")\r\n\r\nif len(a) + len(b) == len(y):\r\n print(s)\r\n\r\nelif len(a) + len(b) == len(y) + 2:\r\n if len(a) > 1:\r\n a = a[:-1] \r\n else:\r\n b = b[:-1]\r\n y = y + \"|\"\r\n print(a + \"+\" + b + \"=\" + y)\r\n \r\nelif len(a) + len(b) == len(y) - 2:\r\n a = a + \"|\"\r\n y = y[:-1]\r\n print(a + \"+\" + b + \"=\" + y)\r\n \r\nelse:\r\n print(\"Impossible\") \r\n ", "v = input().split('+')\na = len(v[0])\nv = v[1].split('=')\nb = len(v[0])\nc = len(v[1])\n\ndef good(a, b, c):\n return a+b==c and a>0 and b>0 and c>0\n\nif good(a-1, b, c+1):\n a = a-1\n c = c+1\n\nif good(a, b-1, c+1):\n b = b-1\n c = c+1\n\nif good(a+1, b, c-1):\n a = a+1\n c = c-1\n\nif good(a, b+1, c-1):\n b = b+1\n c = c-1\n\nif a+b==c:\n print('|'*a+'+'+'|'*b+'='+'|'*c)\nelse:\n print(\"Impossible\")\n", "s = input()\r\n\r\nind = s.index('=')\r\nleft, right = s[:ind], s[ind+1:]\r\n\r\nind = left.index('+')\r\na, b = left[:ind], left[ind+1:]\r\n\r\nA, B, C = len(a), len(b), len(right)\r\n\r\nif abs(1 - abs(A + B - C)) != 1:\r\n print('Impossible')\r\n exit()\r\n\r\nif A + B == C:\r\n print(s)\r\n exit()\r\n\r\nif A + B + 1 == C - 1:\r\n print((A + 1) * '|' + '+' + B * '|' + '=' + (C - 1) * '|')\r\n exit()\r\n\r\nif A + B - 1 == C + 1:\r\n if 1 < A >= B:\r\n print((A - 1) * '|' + '+' + B * '|' + '=' + (C + 1) * '|')\r\n exit()\r\n \r\n if A < B > 1:\r\n print(A * '|' + '+' + (B - 1) * '|' + '=' + (C + 1) * '|')\r\n exit()\r\n", "from sys import stdin\r\na=list(stdin.readline())\r\na.pop()\r\ncont=0\r\npos=0\r\ncont1=0\r\ncont2=0\r\nwhile(a[pos]!=\"+\"):\r\n cont=cont+1\r\n pos=pos+1\r\npos+=1\r\nwhile(a[pos]!=\"=\"):\r\n cont2=cont2+1\r\n pos=pos+1\r\npos=-1\r\nwhile(a[pos]!=\"=\"):\r\n cont1=cont1+1\r\n pos=pos-1\r\nif((cont+cont2)<cont1):\r\n del(a[-1])\r\n a.insert(0, \"|\")\r\n cont=cont+1\r\n cont1=cont1-1\r\nelif((cont+cont2)>cont1):\r\n del(a[0])\r\n a.insert(-1, \"|\")\r\n cont=cont-1\r\n cont1=cont1+1\r\nif (cont==0)and(cont2>1):\r\n cont2=cont2-1\r\n cont=cont+1\r\nif(cont2==0)and(cont>1):\r\n cont2=cont2+1\r\n cont=cont-1\r\nif((cont+cont2)<cont1)or((cont+cont2)>cont1):\r\n print(\"Impossible\")\r\nelif((cont+cont2)==cont1):\r\n print((\"|\"*cont)+\"+\"+(\"|\"*cont2)+\"=\"+(\"|\"*cont1))\r\n \r\n", "unformatted = input()\r\na, bc = unformatted.split('+')\r\nb, c = bc.split('=')\r\na, b, c = len(a), len(b), len(c)\r\n\r\nif a + b == c:\r\n print(\"|\" * a, \"+\", \"|\" * b, \"=\", \"|\" * c, sep='')\r\nelif a + b - 1 == c + 1:\r\n if a >= 2:\r\n print(\"|\" * (a - 1), \"+\", \"|\" * b, \"=\", \"|\" * (c + 1), sep='')\r\n elif b >= 2:\r\n print(\"|\" * a, \"+\", \"|\" * (b - 1), \"=\", \"|\" * (c + 1), sep='')\r\n else:\r\n print(\"Impossible\")\r\nelif a + b + 1 == c - 1:\r\n if c >= 2:\r\n print(\"|\" * a, \"+\", \"|\" * (b + 1), \"=\", \"|\" * (c - 1), sep='')\r\n else:\r\n print(\"Impossible\")\r\nelse:\r\n print(\"Impossible\")\r\n", "s_bef_plus, s_after_p = input().split('+')\r\ns_after_plus, s_after_equal = s_after_p.split('=')\r\ns_c_1 = s_bef_plus.count('|')\r\ns_c_2 = s_after_plus.count('|')\r\ns_c_3 = s_after_equal.count('|')\r\nif s_c_1 + s_c_2 == s_c_3:\r\n print(s_bef_plus + '+' + s_after_p)\r\nelif (s_c_1 + s_c_2) - 2 == s_c_3:\r\n if s_c_1 > 1:\r\n print(s_bef_plus[:-1]+ '+' +s_after_p + '|')\r\n elif s_c_2 > 1:\r\n print(s_bef_plus + '+' + s_after_plus[:-1] + '=' + s_after_equal + '|')\r\n else:\r\n print('Impossible') \r\nelif s_c_3 - 2 == (s_c_1 + s_c_2):\r\n print(s_bef_plus + '|' + '+' + s_after_p[:-1])\r\nelse:\r\n print('Impossible') ", "s = input().strip()\na = s.index('+')\nb = s.index('=') - a - 1\nc = len(s) - a - b - 2\n\ndef display(a, b, c):\n print('%s+%s=%s' % (a * '|', b * '|', c * '|'))\n\nif a + b == c:\n print(s)\nelif a + b + 1 == c - 1:\n display(a, b + 1, c - 1)\nelif a + b - 1 == c + 1:\n if b == 1:\n display(a - 1, b, c + 1)\n else:\n display(a, b - 1, c + 1)\nelse:\n print('Impossible')\n", "s = input()\r\na = s[:s.index(\"+\")].count(\"|\")\r\nb = s[s.index(\"+\"):s.index(\"=\")].count(\"|\")\r\nc = s[s.index(\"=\"):].count(\"|\")\r\nif (a+b)-c==2:\r\n if a>b:\r\n a-=1\r\n else:\r\n b-=1\r\n c+=1\r\n print(a * \"|\", \"+\", b * \"|\", \"=\", c * \"|\", sep=\"\")\r\nelif (a+b)-c==-2:\r\n c-=1\r\n a+=1\r\n print(a * \"|\" ,\"+\", b * \"|\" ,\"=\", c * \"|\" , sep=\"\")\r\nelif a+b==c:\r\n print(s)\r\nelse:\r\n print(\"Impossible\")", "def printabc(A,B,C):\r\n for i in range(A):\r\n print('|',end='')\r\n print('+',end='')\r\n for i in range(B):\r\n print('|',end='')\r\n print('=',end='')\r\n for i in range(C):\r\n print('|',end='')\r\nstring=input()\r\nA=len(string.split('+')[0])\r\nB=len(string.split('+')[1].split('=')[0])\r\nC=len(string.split('+')[1].split('=')[1])\r\n#print('A='+str(A)+',B='+str(B)+',C='+str(C))\r\nif(A+B==C):\r\n printabc(A,B,C)\r\nelif(C-A-B==2):\r\n C=C-1\r\n A=A+1\r\n printabc(A,B,C)\r\nelif(A+B-C==2):\r\n if(A==1):\r\n B=B-1\r\n C=C+1\r\n else:\r\n A=A-1\r\n C=C+1\r\n printabc(A,B,C)\r\n\r\nelse:\r\n print('Impossible')\r\n \r\n", "inp = input()\nfirstGroup, c = inp.split('=')\na, b = firstGroup.split('+')\n\nA = len(a)\nB = len(b)\nC = len(c)\n\nelements = [A, B, C]\nimpo = True\nfirstExp = A+B\n# print([A, B, C])\n# exit()\n\nam = A-1\nbm = B-1\ncm = C-1\n\nexp1 = (am > 0) and (am+(B+1) == C)\nexp2 = (am > 0) and (am+B == (C+1))\n\nexp3 = (bm > 0) and ((A+1)+bm == C)\nexp4 = (bm > 0) and (A+bm == (C+1))\n\nexp5 = (cm > 0) and ((A+1)+B == cm)\nexp6 = (cm > 0) and (A+(B+1) == cm)\n\nif firstExp == C:\n ao = A\n bo = B\n co = C\nelif exp1:\n ao = A-1\n bo = B+1\n co = C\nelif exp2:\n ao = A-1\n bo = B\n co = C+1\nelif exp3:\n ao = A+1\n bo = B-1\n co = C\nelif exp4:\n ao = A\n bo = B-1\n co = C+1\nelif exp5:\n ao = A+1\n bo = B\n co = C-1\nelif exp6:\n ao = A\n bo = B+1\n co = C-1\nelse:\n ao = 0\n bo = 0\n co = 0\n\n# print(ao, bo, co)\n\nif (ao != 0 and bo != 0 and co != 0):\n print((ao*\"|\") + \"+\" + (bo*\"|\") + \"=\" + (co*\"|\"))\nelse:\n print(\"Impossible\")\n ", "e = str(input())\r\na, b, c = e.index('+'), e.index('=') - e.index('+') - 1, len(e) - e.index('=') - 1\r\nif a + b == c:\r\n print(e)\r\nelif a > 1 and a - 1 + b == c + 1: # a -> c\r\n print(\"|\" * (a - 1) + '+' + \"|\" * b + '=' + \"|\" * (c + 1))\r\nelif b > 1 and a + b - 1 == c + 1: # b -> c\r\n print(\"|\" * a + '+' + \"|\" * (b - 1) + '=' + \"|\" * (c + 1))\r\nelif c > 1 and a + 1 + b == c - 1: # c -> a\r\n print(\"|\" * (a + 1) + '+' + \"|\" * b + '=' + \"|\" * (c - 1))\r\nelse:\r\n print(\"Impossible\")", "a,b,c = input().replace(\"+\",\"=\").split(\"=\")\r\nlenA=0\r\nlenB=0\r\nlenC=0\r\na1=len(a)\r\nb1=len(b)\r\nc1=len(c)\r\nst=\"\"\r\nif (a1+b1)-c1==0:\r\n st=a+\"+\"+b+\"=\"+c\r\nif (a1+b1)-c1==2:\r\n if a1>1:\r\n lenA=a1-1\r\n lenB=b1\r\n elif b1>1:\r\n lenB=b1-1\r\n lenA=a1\r\n lenC=c1+1\r\nif (a1+b1)-c1==-2:\r\n if c1>1:\r\n lenA=a1+1\r\n lenB=b1\r\n lenC=c1-1\r\nif lenA and lenB and lenC!=0:\r\n for x in range(lenA): st=st+\"|\"\r\n st=st+\"+\"\r\n for x in range(lenB): st=st+\"|\"\r\n st=st+\"=\"\r\n for x in range(lenC): st=st+\"|\"\r\n\r\nif st:\r\n print(st)\r\nelse:\r\n print(\"Impossible\")", "sticks = input()\na, bc = sticks.split('+')\nb, c = bc.split('=')\nif len(a) + len(b) + 1 == len(c) - 1:\n a = a + '|'\n c = c[1:]\nelif len(a) + len(b) - 1 == len(c) + 1:\n if len(a) > 1:\n a = a[1:]\n c = c + '|'\n elif len(b) > 1:\n b = b[1:]\n c = c + '|'\nsticks = ''.join([a, '+', b, '=', c])\n\nif len(a) + len(b) == len(c):\n print(sticks)\nelse:\n print('Impossible')\n", "s=input()\r\ni,a,b,c=[0]*4\r\nwhile s[i]!='+':\r\n a+=1\r\n i+=1\r\ni+=1\r\nwhile s[i]!='=':\r\n b+=1\r\n i+=1\r\ni+=1\r\ntmp=len(s)\r\nwhile i<tmp:\r\n c+=1\r\n i+=1\r\nif a+b==c:print(s)\r\nelse:\r\n if (a+b)%2!=c%2:\r\n print('Impossible')\r\n else:\r\n tmp=0\r\n if a+b<c:\r\n while a+b!=c:\r\n a+=1\r\n c-=1\r\n tmp+=1\r\n else:\r\n while a+b!=c:\r\n if a>1:a-=1\r\n else:b-=1\r\n c+=1\r\n tmp+=1\r\n if tmp>1:print('Impossible')\r\n else:print('|'*a+'+'+'|'*b+'='+'|'*c)\r\n", "s = input()\r\na = len(s.partition('+')[0])\r\nb = len(s.partition('=')[0].partition('+')[2])\r\nc = len(s.partition('=')[2])\r\n\r\nif a + b == c:\r\n print (s)\r\nelif (a + b - 1) == (c + 1):\r\n if (a > 1):\r\n print ('|'*(a-1)+'+'+'|'*b+'='+'|'*(c+1))\r\n elif (b > 1):\r\n print ('|'*(a)+'+'+'|'*(b-1)+'='+'|'*(1+c))\r\n else:\r\n print('Impossible')\r\nelif (a + b + 1) == (c - 1):\r\n if (c > 1):\r\n print ('|'*(a+1)+'+'+'|'*b+'='+'|'*(c-1))\r\n else:\r\n print('Impossible')\r\nelse:\r\n print('Impossible')\r\n\r\n", "# https://codeforces.com/problemset/problem/394/A\n# A. Counting Sticks\n\ninput_str = input()\nb1, b2, b3 = 0, 0, 0\nin_b1, in_b2 = True, False\n\nfor x in input_str:\n if x == '|':\n if in_b1:\n b1 += 1\n elif in_b2:\n b2 += 1\n else:\n b3 += 1\n elif x == '+':\n in_b1, in_b2 = False, True\n else:\n in_b2 = False\n\nif b1 + b2 == b3:\n pass\nelif b1 + b2 == b3 + 2:\n if b1 > 1:\n b1 -= 1\n else:\n b2 -= 1\n b3 += 1\nelif b1 + b2 + 2 == b3:\n b2 += 1\n b3 -= 1\nelse:\n print(\"Impossible\")\n exit()\n\nprint('|' * b1 + '+' + '|' * b2 + '=' + b3 * '|')\n", "n=list(input())\r\nc1,c2,c3=n[:n.index('+')].count('|'),n[n.index('+')+1:n.index('=')].count('|'),n[n.index('=')+1:].count('|')\r\nif((c1+c2+c3)%2!=0 and c1+c2+c3<=2):\r\n print('Impossible')\r\nelif(c1+c2==c3):\r\n print(''.join(n))\r\nelif(c1+c2-c3==2):\r\n if(c1>c2):\r\n print('|'*(c1-1)+'+'+'|'*c2+'='+'|'*(c3+1))\r\n else:\r\n print('|'*c1+'+'+'|'*(c2-1)+'='+'|'*(c3+1))\r\nelif(c1+c2-c3==-2):\r\n print('|'*(c1+1)+'+'+'|'*c2+'='+'|'*(c3-1))\r\nelse:\r\n print('Impossible')\r\n ", "s = input()\r\nab = s.find('=') - 1\r\nc = len(s) - ab - 2\r\nif ab == c:\r\n s\r\nelif ab + 2 == c:\r\n s = '|' + s[:-1]\r\nelif ab == c + 2 and ab > 2:\r\n if s.find('+') > 1:\r\n s = s[1:] + '|'\r\n else:\r\n s = s[:s.find('=') - 1] + s[s.find('='):]+ '|'\r\nelse:\r\n s = 'Impossible'\r\nprint(s)", "equation = input()\r\nS1 = equation.split(\"+\")\r\nS2 = S1[1].split(\"=\")\r\nA = S1[0]\r\nB = S2[0]\r\nC = S2[1]\r\n\r\nAcount, Bcount, Ccount = A.count(\"|\"), B.count(\"|\"), C.count(\"|\")\r\n\r\n\r\nif Acount + Bcount == Ccount:\r\n print(\"{}+{}={}\".format(A, B, C))\r\nelif Acount + Bcount + 1 == Ccount - 1:\r\n A += \"|\"\r\n C = C.replace(\"|\", \"\", 1)\r\n print(\"{}+{}={}\".format(A, B, C))\r\nelif Acount + Bcount - 1 == Ccount + 1:\r\n\r\n if Acount > Bcount:\r\n A = A.replace(\"|\", \"\", 1)\r\n else:\r\n B = B.replace(\"|\", \"\", 1)\r\n\r\n C += \"|\"\r\n print(\"{}+{}={}\".format(A, B, C))\r\nelse:\r\n print(\"Impossible\")\r\n\r\n", "x =input()\r\nfor i in range(len(x)):\r\n if x[i]==\"+\":\r\n plus=i \r\n if x[i]==\"=\":\r\n equal=i\r\nif len(x[:plus])+len(x[plus+1:equal])==len(x[equal+1:]):\r\n print(x)\r\n \r\nelif len(x[:plus])+len(x[plus+1:equal])-len(x[equal+1:])==2 :\r\n if (len(x[:plus])>1):\r\n print(x[:plus-1]+\"+\"+x[plus+1:equal]+\"=\"+x[equal+1:]+\"|\")\r\n else :\r\n print(x[:plus]+\"+\"+x[plus+1:equal-1]+\"=\"+x[equal+1:]+\"|\")\r\nelif len(x[:plus])+len(x[plus+1:equal])-len(x[equal+1:])==-2: \r\n print(x[:plus]+'|'+\"+\"+x[plus+1:equal]+\"=\"+x[equal+1:len(x)-1])\r\nelse:\r\n print(\"Impossible\")", "text = input()\r\nx = text.split('=')\r\ny = len(x[0])\r\nz = len(x[1])\r\nif ((y-1) == z):\r\n print(text)\r\nelif(((y-1)+2) == z):\r\n print(\"|\"+text[:-1])\r\nelif((y-1) == (z+2)):\r\n s_sp = x[0].split('+')\r\n if(len(s_sp[0]) == 1):\r\n print(s_sp[0]+\"+\"+s_sp[1][:-1]+\"=\"+x[1]+\"|\")\r\n else:\r\n print(text[1:]+\"|\")\r\nelse:\r\n print(\"Impossible\")", "a = input()\r\nn = 0\r\nf = 0\r\ns = 0\r\nd = 0\r\nm = False\r\nz = False\r\nfor i in a:\r\n if i == '|':\r\n if not(m) and not(z):\r\n f += 1\r\n if m and not(z):\r\n s += 1\r\n if m and z:\r\n d += 1\r\n if i == '+':\r\n m = True\r\n if i == '=':\r\n z = True\r\ndelt = f + s - d\r\nif delt < 0:\r\n delt *= (-1)\r\nif delt != 2 and delt != 0:\r\n print('Impossible')\r\nelse:\r\n if f + s == d:\r\n print(a)\r\n elif f + s > d:\r\n if f > s:\r\n if f - 1 > 0:\r\n f -= 1\r\n d += 1\r\n s = f * '|' + '+' + s *'|' + '=' + d * '|'\r\n print(s)\r\n elif s - 1 > 0:\r\n s -= 1\r\n d += 1\r\n s = f * '|' + '+' + s *'|' + '=' + d * '|'\r\n print(s)\r\n else:\r\n print('Impossible')\r\n else:\r\n if d - 1 > 0:\r\n d -= 1\r\n f += 1\r\n s = f * '|' + '+' + s *'|' + '=' + d * '|'\r\n print(s)\r\n else:\r\n print('Impossible')", "string = input()\r\noccured = None\r\nA = 0\r\nB = 0\r\nC = 0\r\nfor c in string:\r\n if occured == None and c == '|':\r\n A += 1\r\n elif occured == None and c == '+':\r\n occured = '+'\r\n elif occured == '+' and c == '|':\r\n B += 1\r\n elif occured == '+' and c == '=':\r\n occured = '='\r\n elif occured == '=' and c == '|':\r\n C += 1\r\ns = A+B-C\r\nflag = True\r\nif s == -2:\r\n A += 1\r\n C -= 1\r\nelif s == 2:\r\n C += 1\r\n if A>1:\r\n A -= 1\r\n else:\r\n B -= 1\r\nelif s == 0:\r\n pass\r\nelse:\r\n flag = False\r\nif flag == True:\r\n for _ in range(A):\r\n print('|',end=\"\")\r\n print('+', end=\"\")\r\n for _ in range(B):\r\n print('|',end=\"\")\r\n print('=', end=\"\")\r\n for _ in range(C):\r\n print('|',end=\"\")\r\nelse:\r\n print(\"Impossible\")", "import re\n\n\ndef counting_sticks(A: int, B: int, C: int) -> tuple:\n if A + B + 2 == C:\n return A+1, B, C-1\n\n if A + B == C + 2:\n if A > 1:\n return A-1, B, C+1\n return A, B-1, C+1\n\n if A + B == C:\n return A, B, C\n\n return -1, -1, -1\n\n\nif __name__ == \"__main__\":\n A, B, C = map(len, re.split('[+=]', input()))\n\n xA, xB, xC = counting_sticks(A, B, C)\n if xA < 0:\n print('Impossible')\n else:\n print(('|' * xA) + '+' + ('|' * xB) + '=' + ('|' * xC))\n", "expression = input()\r\na = expression.find('+')\r\nb = expression.find('=') - a - 1\r\nc = len(expression) - expression.find('=') - 1\r\n\r\nif a+b == c:\r\n print(expression)\r\nelif a+b-1 == c+1:\r\n if a > b:\r\n print('|'*(a-1) + '+' + '|'*b + '=' + '|'*(c+1))\r\n else:\r\n print('|'*a + '+' + '|'*(b-1) + '=' + '|'*(c+1))\r\nelif a+b+1 == c-1:\r\n print('|'*(a+1) + '+' + '|'*b + '=' + '|'*(c-1))\r\nelse:\r\n print('Impossible')", "import sys\r\nimport math\r\n\r\ndef read_int():\r\n\treturn int(input().strip())\r\n\r\ndef read_int_list():\r\n\treturn list(map(int,input().strip().split()))\r\n\r\ndef read_string():\r\n\treturn input().strip()\r\n\r\ndef read_string_list(delim=\" \"):\r\n\treturn input().strip().split(delim)\r\n\r\n###### Author : Samir Vyas #######\r\n###### Write Code Below #######\r\n\r\ndef get_eq(a,b,c):\r\n\teq = \"\"\r\n\r\n\tfor i in range(a):\r\n\t\teq += \"|\"\r\n\r\n\teq += \"+\"\r\n\r\n\tfor i in range(b):\r\n\t\teq += \"|\"\r\n\teq += \"=\"\r\n\r\n\tfor i in range(c):\r\n\t\teq += \"|\"\r\n\r\n\treturn eq\r\n\r\nineq = read_string()\r\na,b,c = 0,0,0\r\n\r\na = ineq.find(\"+\")\r\nb = ineq.find(\"=\")-a-1\r\nc = len(ineq)-ineq.find(\"=\")-1\r\n\r\n# print(a,b,c)\r\n\r\nif a+b == c:\r\n\tprint(ineq)\r\n\tsys.exit()\r\n\r\nif a-1+b == c+1:\r\n\tif a > 1:\r\n\t\tprint(get_eq(a-1,b,c+1))\r\n\telif b > 1:\r\n\t\tprint(get_eq(a,b-1,c+1))\r\n\telse:\r\n\t\tprint(\"DISPUTE\")\r\n\r\n\tsys.exit()\r\n\r\nif a+b+1 == c-1:\r\n\tprint(get_eq(a+1,b,c-1))\r\n\tsys.exit()\r\n\r\nprint(\"Impossible\")\r\n", "s, c = input().split(sep=\"=\")\r\na, b = s.split(sep=\"+\")\r\na, b, c = map(len, [a, b, c])\r\nif a + b != c:\r\n if a > 1 and a - 1 + b == c + 1:\r\n a -= 1\r\n c += 1\r\n elif b > 1 and a + b - 1 == c + 1:\r\n b -= 1\r\n c += 1\r\n elif c > 1 and a + 1 + b == c - 1:\r\n c -= 1\r\n a += 1\r\n else:\r\n print(\"Impossible\")\r\n exit()\r\nprint(\"|\" * a + \"+\" + \"|\" * b + \"=\" + \"|\" * c)", "realsticks = input()\nsticks = realsticks.split(\"=\")\naddition = sticks[0].split(\"+\")\nnum1 = addition[0].count(\"|\")\nnum2 = addition[1].count(\"|\")\nsum = sticks[-1].count(\"|\")\nif sum - (num1+num2) == 2:\n print(\"|\"*(num1+1)+\"+\" + \"|\"*num2 + \"=\" + \"|\"*(sum-1))\nelif sum - (num1 + num2) == -2:\n if num1 == 1:\n print(\"|\" * (num1) + \"+\" + \"|\" * (num2-1) + \"=\" + \"|\" * (sum + 1))\n elif num2 == 1:\n print(\"|\" * (num1-1) + \"+\" + \"|\" * (num2) + \"=\" + \"|\" * (sum + 1))\n else:\n print(\"|\" * (num1 - 1) + \"+\" + \"|\" * (num2) + \"=\" + \"|\" * (sum + 1))\n\nelif abs((num1+num2)-sum) == 0:\n print(realsticks)\nelse:\n print(\"Impossible\")\n \t \t \t\t \t \t \t\t\t \t \t \t \t", "arr1 = input()\r\nA, B = arr1.split(\"+\")\r\nB, C = B.split(\"=\")\r\nn1, n2, n3 = len(A), len(B), len(C)\r\nif (n1 + 1 + n2) == (n3 - 1):\r\n print(A + \"|\" + \"+\" + B + \"=\" + C[:n3-1])\r\n\r\nelif (n1 + n2 - 1) == (n3 + 1):\r\n if (n1 > n2):\r\n print(A[:n1-1] + \"+\" + B + \"=\" + C + \"|\")\r\n else:\r\n print(A + \"+\" + B[:n2-1] + \"=\" + C + \"|\")\r\n\r\nelif (n1 + n2) == n3:\r\n print(arr1)\r\n\r\nelse:\r\n print(\"Impossible\")", "import math as m\r\n\r\ns = input().split(\"=\")\r\nequation = s[0].split(\"+\")\r\na = len(equation[0])\r\nb = len(equation[1])\r\nresult = len(s[1])\r\n\r\nif a+b+result % 2 == 1:\r\n print(\"Impossible\")\r\nelif m.fabs(result-a-b) != 2 and a+b != result:\r\n print(\"Impossible\")\r\nelif a+b == result:\r\n print(a*\"|\", \"+\", b*\"|\", \"=\", result*\"|\", sep=\"\")\r\nelif result-a-b == 2:\r\n result -= 1\r\n b += 1\r\n print(a*\"|\", \"+\", b*\"|\", \"=\", result*\"|\", sep=\"\")\r\nelif result-a-b == -2:\r\n result += 1\r\n if b > 1:\r\n b -= 1\r\n else:\r\n a -= 1\r\n print(a*\"|\", \"+\", b*\"|\", \"=\", result*\"|\", sep=\"\")\r\n", "# Design_by_JOKER\r\nimport math\r\nimport cmath\r\n\r\nn = input()\r\nm = [0]*3\r\na = 0\r\nfor x in n:\r\n if x == '|':\r\n m[a] += 1\r\n else:\r\n a += 1\r\nif m[0] + m[1] != m[2] - 2 and m[0] + m[1] != m[2] + 2 and m[0]+m[1] != m[2]:\r\n print(\"Impossible\")\r\nelif m[0] + m[1] == m[2]:\r\n print(n)\r\nelif m[0] + m[1] == m[2]-2:\r\n m[0] += 1\r\n m[2] -= 1\r\n for _ in range(m[0]):\r\n print('|', end='')\r\n print('+', end='')\r\n for _ in range(m[1]):\r\n print('|', end='')\r\n print('=', end='')\r\n for _ in range(m[2]):\r\n print('|', end='')\r\nelse:\r\n if m[0] > 1: m[0] -= 1\r\n else: m[1] -= 1\r\n m[2] += 1\r\n for _ in range(m[0]):\r\n print('|', end='')\r\n print('+', end='')\r\n for _ in range(m[1]):\r\n print('|', end='')\r\n print('=', end='')\r\n for _ in range(m[2]):\r\n print('|', end='')\r\n" ]

[ "import math,sys,bisect,heapq\r\nfrom collections import defaultdict,Counter,deque\r\nfrom itertools import groupby,accumulate\r\nfrom functools import lru_cache\r\nfrom heapq import heapify,heappop,heappush\r\n#sys.setrecursionlimit(200000000)\r\nint1 = lambda x: int(x) - 1\r\n#def input(): return sys.stdin.readline().strip()m\r\ninput = iter(sys.stdin.buffer.read().decode().splitlines()).__next__\r\naj = lambda: list(map(int, input().split()))\r\ndef list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)]\r\n#MOD = 1000000000 + 7\r\ndef Y(c): print([\"NO\",\"YES\"][c])\r\ndef y(c): print([\"no\",\"yes\"][c])\r\ndef Yy(c): print([\"No\",\"Yes\"][c])\r\n\r\nn,m = aj()\r\ns = ['$'] + [*input()] + ['$']\r\ncount = 0\r\nfor i in range(len(s)-1):\r\n if s[i] == s[i+1] == '.':\r\n count += 1\r\nfor i in range(m):\r\n a,b = input().split()\r\n a = int(a)\r\n if s[a] == b == '.':\r\n print(count)\r\n elif s[a] != '.' and b!= '.':\r\n print(count)\r\n elif s[a] == '.':\r\n if s[a-1] == '.':\r\n count -= 1\r\n if s[a+1] == '.':\r\n count -= 1\r\n print(count)\r\n s[a] = b\r\n else:\r\n if s[a-1] == '.':\r\n count += 1\r\n if s[a+1] == '.':\r\n count += 1\r\n print(count)\r\n s[a] = b\r\n \r\n \r\n", "n,m=map(int,input().split())\r\ns=[j for j in input()]\r\ncnt=0\r\nfor i in range(1,len(s)):\r\n if s[i]=='.' and s[i-1]=='.':\r\n cnt+=1\r\nout=[]\r\nfor _ in range(m):\r\n i,c=input().split()\r\n i=int(i)-1\r\n if (s[i]=='.')!= (c=='.'): \r\n if (i-1)>-1 and s[i-1]=='.':\r\n if c=='.':cnt+=1\r\n else:cnt-=1\r\n if (i+1)<len(s) and s[i+1]=='.':\r\n if c=='.':cnt+=1\r\n else:cnt-=1\r\n\r\n s[i]=c\r\n out.append(str(cnt))\r\n out.append('\\n')\r\nprint(''.join(out))\r\n", "# n,m=[int(x)for x in input().split()]\n# a=[x=='.'for x in input()]+[0]\n# k=sum([a[i] and a[i+1]for i in range(n)])\n# for i in range(m):\n# x,c=input().split()\n# x,c=int(x)-1,c=='.'\n# k-=(a[x]-c)*(a[x-1]+a[x+1])\n# a[x]=c\n# print(k)\n#\nn, m = map(int, input().split())\ns = [c != '.' for c in input()]+[True]\nk = sum(s[i] == 0 and s[i + 1] != 1 for i in range(n))\nt = [0] * m\nfor i in range(m):\n x, c = input().split()\n x, c = int(x) - 1, c != '.'\n k += (c - s[x]) * (s[x - 1] + s[x + 1] - 2)\n s[x], t[i] = c, k\nprint('\\n'.join(map(str, t)))\n\n", "from sys import stdin,stdout\r\ninput = stdin.readline\r\nimport operator\r\n\r\ndef main():\r\n\tn,m = map(int,input().split())\r\n\ts = [c for c in input().strip()]\r\n\tres = []\r\n\td = \".\"\r\n\r\n\tans = moves(s)\r\n\tfor _ in range(m):\r\n\t\ti, c = input().split()\r\n\t\ti = int(i) - 1\r\n\r\n\t\tif s[i] == d:\r\n\t\t\tif i > 0 and s[i-1] == d:\r\n\t\t\t\tans -= 1\r\n\t\t\tif i < n - 1 and s[i+1] == d:\r\n\t\t\t\tans -= 1\r\n\r\n\t\ts[i] = c\r\n\r\n\t\tif s[i] == d:\r\n\t\t\tif i > 0 and s[i-1] == d:\r\n\t\t\t\tans += 1\r\n\t\t\tif i < n - 1 and s[i+1] == d:\r\n\t\t\t\tans += 1\r\n\t\tres.append(str(ans))\r\n\tstdout.write('\\n'.join(res))\r\n\r\n\r\ndef moves(s):\r\n\tans = 0\r\n\tfor i in range(len(s) - 1):\r\n\t\tif s[i] == \".\" and s[i+1] == \".\":\r\n\t\t\tans += 1\r\n\treturn ans\r\n\r\nmain()", "import os\r\nimport sys\r\nfrom io import BytesIO, IOBase\r\nimport heapq as h \r\nfrom bisect import bisect_left\r\n\r\nfrom types import GeneratorType\r\nBUFSIZE = 8192\r\nclass FastIO(IOBase):\r\n newlines = 0\r\n \r\n def __init__(self, file):\r\n import os\r\n self.os = os\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 = self.os.read(self._fd, max(self.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 = self.os.read(self._fd, max(self.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 self.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\nimport time\r\nstart_time = time.time()\r\n\r\nimport collections as col\r\nimport math, string\r\nfrom functools import reduce\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\nMOD = 10**9+7\r\n\r\n\"\"\"\r\nSeg tree was too slow.\r\nWe need, at any time, to know number of dots minus number of intervals\r\n\r\n\"\"\"\r\n\r\n\r\ndef solve():\r\n N, M = getInts()\r\n S = listStr()\r\n dots = 0\r\n intervals = 0\r\n curr = 0\r\n for i in range(N):\r\n if S[i] == '.':\r\n curr += 1\r\n dots += 1\r\n else:\r\n if curr > 0:\r\n intervals += 1\r\n curr = 0\r\n if curr > 0:\r\n intervals += 1\r\n for m in range(M):\r\n idx, char = getStrs()\r\n idx = int(idx)-1\r\n if char == '.':\r\n if S[idx] == '.':\r\n S[idx] = char\r\n else:\r\n dots += 1\r\n #we have changed from letter to dot. How does this affect intervals?\r\n #if dot fits on the end of an existing interval on one side, nothing changes.\r\n #if dot is sandwiched between two dots, the number of intervals decreases\r\n #if dot is not next to any other dots, the number of intervals increases\r\n neighbours = 0\r\n if idx > 0 and S[idx-1] == '.':\r\n neighbours += 1\r\n if idx < N-1 and S[idx+1] == '.':\r\n neighbours += 1\r\n intervals -= (neighbours-1)\r\n S[idx] = char\r\n else:\r\n if S[idx] != '.':\r\n S[idx] = char\r\n else:\r\n dots -= 1\r\n #we have changed from dot to letter\r\n #if dot was on end on an interval, nothing changes\r\n #if it was between two dots, the number of intervals increases\r\n #if it was not next to any other dots, the number of intervals decreases\r\n neighbours = 0\r\n if idx > 0 and S[idx-1] == '.':\r\n neighbours += 1\r\n if idx < N-1 and S[idx+1] == '.':\r\n neighbours += 1\r\n intervals += (neighbours-1)\r\n S[idx] = char\r\n print(dots-intervals)\r\n return\r\n \r\n#for _ in range(getInt()): \r\nsolve()\r\n", "from collections import *\nfrom itertools import *\nfrom random import *\nfrom bisect import *\nfrom string import *\nfrom queue import *\nfrom heapq import *\nfrom math import *\nfrom re import *\nfrom sys import *\ndef fast(): return stdin.readline().strip()\ndef zzz(): return [int(i) for i in fast().split()]\n\n\nz, zz = input, lambda: list(map(int, z().split()))\nszz, graph, mod, szzz = lambda: sorted(\n zz()), {}, 10**9 + 7, lambda: sorted(zzz())\n\n\ndef lcd(xnum1, xnum2): return (xnum1 * xnum2 // gcd(xnum1, xnum2))\ndef output(answer): stdout.write(str(answer))\n\n\ndx = [-1, 1, 0, 0, 1, -1, 1, -1]\ndy = [0, 0, 1, -1, 1, -1, -1, 1]\n\n\n###########################---Test-Case---#################################\n\"\"\"\n\nIf you Know me , Then you probably don't know me !\n\n\"\"\"\n###########################---START-CODING---##############################\n\nn, m = zzz()\n\narr = list(fast())\n\nk = 0\nfor i in range(n - 1):\n if arr[i] == arr[i + 1] == '.':\n k += 1\n\nfor i in range(m):\n x, c = fast().split()\n x = int(x) - 1\n\n if arr[x] == '.':\n if c != '.':\n if x > 0 and arr[x - 1] == '.':\n k -= 1\n if x < n - 1 and arr[x + 1] == '.':\n k -= 1\n else:\n if c == '.':\n if x > 0 and arr[x - 1] == '.':\n k += 1\n if x < n - 1 and arr[x + 1] == '.':\n k += 1\n print(k)\n arr[x] = c\n", "n, m = map(int, input().split())\ns = list(input())\nans=0\nl = []\nfor i in range(1, n):\n if s[i]+s[i-1] =='..':\n ans += 1\nfor i in range(m):\n a, b = input().split()\n a = int(a)-1\n if a > 0 and s[a-1] + s[a] == '..':\n ans -= 1\n if a + 1 < n and s[a+1] + s[a] == '..':\n ans -= 1\n s[a] = b\n \n if a > 0 and s[a-1] + s[a] == '..':\n ans += 1\n if a + 1 < n and s[a+1] + s[a] == '..':\n ans += 1\n l.append(str(ans))\nprint(' '.join(l))\n \t\t\t \t \t\t \t \t \t \t \t\t\t", "#from math import *\r\nfrom collections import *\r\nfrom random import *\r\nfrom bisect import *\r\nimport sys\r\ninput=sys.stdin.readline\r\ndef lis():\r\n return list(map(int,input().split()))\r\ndef ma():\r\n return map(int,input().split())\r\ndef inp():\r\n return int(input())\r\ndef bfs(deg,vis,cur):\r\n qu=deque([])\r\n qu.append(cur)\r\n while qu:\r\n x=qu.popleft()\r\n vis[x]=1\r\n for i in deg[x]:\r\n if(vis[i]==0):\r\n qu.append(i)\r\nn,m=ma()\r\ns=input().rstrip('\\n')\r\nr=[]\r\npr=[]\r\nfor i in s:\r\n if(i=='.'):\r\n pr.append(0)\r\n else:\r\n pr.append(1)\r\npr.append(1)\r\ntot=0\r\nfor i in range(n):\r\n if(pr[i]==0 and pr[i+1]==0):\r\n tot+=1\r\nfor i in range(m):\r\n x=input().split()\r\n x,c=int(x[0]),x[1]\r\n x-=1\r\n z=0\r\n if(c!='.'):\r\n z=1\r\n tot+=(z-pr[x])*(pr[x-1]+pr[x+1]-2)\r\n r.append(tot)\r\n pr[x]=z\r\nfor i in r:\r\n print(i)\r\n \r\n \r\n \r\n \r\n \r\n", "import sys\r\nn,m = map(int,sys.stdin.readline().split())\r\narr = list(sys.stdin.readline())\r\ncount = cnt = 0\r\nfor i in arr:\r\n if i=='.':\r\n cnt += 1\r\n elif cnt !=0:\r\n count += cnt-1\r\n cnt = 0\r\nif cnt!=0:\r\n count += cnt-1\r\ni = m\r\nwhile i:\r\n x,c = sys.stdin.readline().split()\r\n x = int(x)-1\r\n if arr[x]=='.' and c!='.':\r\n if x-1>=0 and x+1<n and (arr[x-1]=='.' and arr[x+1]=='.'):\r\n count -= 2\r\n elif x-1>=0 and x+1<n and (arr[x-1]=='.' or arr[x+1]=='.'):\r\n count -= 1\r\n elif x-1>=0:\r\n if arr[x-1]=='.':\r\n count -= 1\r\n elif x+1<n:\r\n if arr[x+1]=='.':\r\n count -= 1\r\n elif arr[x]!='.' and c=='.':\r\n if x-1>=0 and x+1<n and (arr[x-1]=='.' and arr[x+1]=='.'):\r\n count += 2\r\n elif x-1>=0 and x+1<n and (arr[x-1]=='.' or arr[x+1]=='.'):\r\n count += 1\r\n elif x-1>=0:\r\n if arr[x-1]=='.':\r\n count += 1\r\n elif x+1<n:\r\n if arr[x+1]=='.':\r\n count += 1\r\n sys.stdout.write(str(count)+'\\n')\r\n arr[x] = c\r\n i -= 1", "import sys\r\ninput = sys.stdin.readline\r\n\r\n\r\ndef ff(i):\r\n c = 0\r\n while i > 0:\r\n c += d[i]\r\n i -= i & (-i)\r\n return c\r\n\r\n\r\ndef f(i, v):\r\n global d\r\n while i < n:\r\n d[i] += v\r\n i += i & (-i)\r\n\r\n\r\nn, m = map(int, input().split())\r\ns = ['x'] + list(input()[:-1]) + ['x']\r\nn += 2\r\nd = [0]*n\r\nfor i in range(1, n):\r\n if s[i] == s[i-1] == '.':\r\n f(i, 1)\r\nfor i in range(m):\r\n a, b = input()[:-1].split()\r\n a = int(a)\r\n for j in range(a, a+2):\r\n if s[j] == s[j-1] == '.':\r\n f(j, -1)\r\n s[a] = b\r\n for j in range(a, a+2):\r\n if s[j] == s[j-1] == '.':\r\n f(j, 1)\r\n print(ff(n-1))\r\n", "\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_str():\r\n return sys.stdin.readline().rstrip()\r\n\r\n @staticmethod\r\n def read_ints():\r\n return map(int, sys.stdin.readline().rstrip().split())\r\n\r\n @staticmethod\r\n def read_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 @staticmethod\r\n def lst(x):\r\n return print(*x)\r\n\r\n @staticmethod\r\n def max(a, b):\r\n return a if a > b else b\r\n\r\n @staticmethod\r\n def min(a, b):\r\n return a if a < b else b\r\n\r\n @staticmethod\r\n def read_list_strs():\r\n return sys.stdin.readline().rstrip().split()\r\n\r\n\r\nclass Solution:\r\n def __init__(self):\r\n return\r\n\r\n @staticmethod\r\n def main(ac=FastIO()):\r\n n, m = ac.read_ints()\r\n lst = list(ac.read_str())\r\n ans = 0\r\n for i in range(1, n):\r\n if lst[i] == lst[i - 1] == \".\":\r\n ans += 1\r\n for _ in range(m):\r\n i, c = ac.read_list_strs()\r\n i = int(i) - 1\r\n if lst[i] == \".\":\r\n if i and lst[i - 1] == \".\":\r\n ans -= 1\r\n if i + 1 < n and lst[i + 1] == \".\":\r\n ans -= 1\r\n lst[i] = c\r\n if lst[i] == \".\":\r\n if i and lst[i - 1] == \".\":\r\n ans += 1\r\n if i + 1 < n and lst[i + 1] == \".\":\r\n ans += 1\r\n ac.st(ans)\r\n return\r\n\r\n\r\nSolution().main()\r\n", "import heapq\r\nimport math\r\nimport os\r\nfrom collections import Counter, deque, defaultdict\r\nfrom sys import stdout\r\nimport time\r\nfrom math import factorial, log, gcd\r\nimport sys\r\nfrom decimal import Decimal\r\nimport threading\r\nfrom heapq import *\r\nimport random\r\n\r\n\r\ndef S():\r\n return sys.stdin.readline().split()\r\n\r\n\r\ndef I():\r\n return [int(i) for i in sys.stdin.readline().split()]\r\n\r\n\r\ndef II():\r\n return int(sys.stdin.readline())\r\n\r\n\r\ndef IS():\r\n return sys.stdin.readline().replace('\\n', '')\r\n\r\n\r\ndef main():\r\n n, m = I()\r\n s = IS()\r\n g = False\r\n ans = 0\r\n for i in range(n):\r\n el = s[i]\r\n if el != '.':\r\n g = False\r\n else:\r\n if g:\r\n ans += 1\r\n else:\r\n g = True\r\n s = '!' + s + '!'\r\n s = list(s)\r\n for _ in range(m):\r\n x, z = S()\r\n x = int(x)\r\n if s[x] == '.' and z != '.':\r\n ans -= int(s[x - 1] == '.') + int(s[x + 1] == '.')\r\n elif s[x] != '.' and z == '.':\r\n ans += int(s[x - 1] == '.') + int(s[x + 1] == '.')\r\n s[x] = z\r\n\r\n print(ans)\r\n\r\n\r\nif __name__ == '__main__':\r\n # for _ in range(II()):\r\n # main()\r\n main()", "from sys import stdin\r\ninput = stdin.readline\r\nn, m = map(int, input().split())\r\ns = list(input())\r\nk, res = 0, []\r\nfor i in range(n-1):\r\n if s[i] == s[i+1] == '.':\r\n k += 1\r\nfor i in range(m):\r\n x, y = input().split()\r\n x = int(x) - 1\r\n if s[x] == '.':\r\n if y != '.':\r\n if x > 0 and s[x-1] == '.':\r\n k -= 1\r\n if x < n-1 and s[x+1] == '.':\r\n k -= 1\r\n else:\r\n if y == '.':\r\n if x > 0 and s[x-1] == '.':\r\n k += 1\r\n if x < n-1 and s[x+1] == '.':\r\n k += 1\r\n res.append(str(k))\r\n s[x] = y\r\nprint('\\n'.join(res))\r\n", "n,m=map(int,input().split())\r\na,b,o=[*input()],[],\"\"\r\nq=sum(a[i-1]+a[i]==\"..\"for i in range(1,n))\r\nfor i in range(m):\r\n g,c=input().split()\r\n p=int(g)-1\r\n if p>0and a[p-1]+a[p]=='..':q-=1\r\n if p+1<n and a[p+1]+a[p]=='..':q-=1\r\n a[p]=c\r\n if p>0and a[p-1]+a[p]=='..':q+=1\r\n if p+1<n and a[p+1]+a[p]=='..':q+=1\r\n o+=str(q)+\"\\n\"\r\nprint(o)", "#Codeforces 570 C - Replacement\nfrom sys import stdin, stdout\nn,m=map(int,stdin.readline().split())\ns = list(stdin.readline())\ndots = 0\ngroups = 0\nprev = \"x\" #whatever char distinct of .\nfor l in s:\n\tif l == \".\":\n\t\tdots += 1\n\t\tif prev != \".\":\n\t\t\tgroups += 1\n\tprev = l\n#print(dots,groups)\nlines = stdin.readlines()\nfor line in lines:\n\tx,c = line.split()\n\tx = int(x) - 1\n\ta = x-1>=0 and s[x-1]==\".\"\n\tb = x+1<n and s[x+1]==\".\"\n\tif s[x] == \".\" and c != \".\":\n\t\tdots -= 1\n\t\tif a and b:\n\t\t\tgroups += 1\n\t\telif not a and not b:\n\t\t\tgroups -= 1\n\telif s[x] != \".\" and c==\".\":\n\t\tdots += 1\n\t\tif a and b:\n\t\t\tgroups -= 1\n\t\telif not a and not b:\n\t\t\tgroups += 1\n\ts[x] = c\n\t#print(s)\n\t#print(dots,groups)\n\tstdout.write(str(dots-groups)+\"\\n\")\n", "from sys import stdin\r\ninput=stdin.readline\r\nn,m=map(int,input().split())\r\ns=list(input().rstrip())\r\nans=0\r\ncnt=0\r\nfor i in range(1,n):\r\n if s[i]==s[i-1]==\".\":\r\n cnt+=1\r\n else:\r\n ans+=cnt\r\n cnt=0\r\nif cnt>0:\r\n ans+=cnt\r\nfor _ in range(m):\r\n x,c=input().rstrip().split()\r\n x=int(x)-1\r\n if c==\".\" and s[x]!=\".\":\r\n if x==0:\r\n if n>=2 and s[1]==\".\":\r\n ans+=1\r\n elif x==n-1:\r\n if n>=2 and s[n-2]==\".\":\r\n ans+=1\r\n else:\r\n if s[x-1]==s[x+1]==\".\":\r\n ans+=2\r\n elif s[x-1]==\".\" or s[x+1]==\".\":\r\n ans+=1\r\n elif c!=\".\" and s[x]==\".\":\r\n if x==0:\r\n if n>=2 and s[1]==\".\":\r\n ans-=1\r\n elif x==n-1:\r\n if n>=2 and s[n-2]==\".\":\r\n ans-=1\r\n else:\r\n if s[x-1]==s[x+1]==\".\":\r\n ans-=2\r\n elif s[x-1]==\".\" or s[x+1]==\".\":\r\n ans-=1\r\n s[x]=c\r\n print(ans)", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\nn, m = map(int, input().split())\r\ns = list(input().rstrip())\r\ns = [1] + [i // 97 for i in s] + [1]\r\nf = 0\r\nans0 = 0\r\nfor i in range(n + 2):\r\n if not s[i] and not f:\r\n f = 1\r\n u = i\r\n elif s[i] and f:\r\n f = 0\r\n ans0 += i - u - 1\r\nans = []\r\nfor _ in range(m):\r\n x, c = input().rstrip().decode().split()\r\n x, c = int(x), ord(c) // 97\r\n if s[x] == c:\r\n ans.append(ans0)\r\n continue\r\n d = 2 * (c ^ 1) - 1\r\n if not s[x - 1] and not s[x + 1]:\r\n ans0 += 2 * d\r\n elif not s[x - 1] or not s[x + 1]:\r\n ans0 += d\r\n ans.append(ans0)\r\n s[x] ^= 1\r\nsys.stdout.write(\"\\n\".join(map(str, ans)))", "from sys import stdin,stdout\r\ninput = stdin.readline\r\nimport operator\r\n\r\ndef moves(s):\r\n\tans = 0\r\n\tfor i in range(len(s) - 1):\r\n\t\tif s[i] and s[i+1]:\r\n\t\t\tans += 1\r\n\treturn ans\r\n\r\nn,m = map(int,input().split())\r\ns = [c == '.' for c in input()]\r\nres = []\r\n\r\nans = moves(s)\r\nfor _ in range(m):\r\n\ti,c = input().split()\r\n\ti = int(i) - 1\r\n\r\n\tif s[i]:\r\n\t\tif i > 0 and s[i-1]:\r\n\t\t\tans -= 1\r\n\t\tif i < n - 1 and s[i+1]:\r\n\t\t\tans -= 1\r\n\r\n\ts[i] = c == '.'\r\n\r\n\tif s[i]:\r\n\t\tif i > 0 and s[i-1]:\r\n\t\t\tans += 1\r\n\t\tif i < n - 1 and s[i+1]:\r\n\t\t\tans += 1\r\n\tres.append(str(ans))\r\nstdout.write('\\n'.join(res))", "from sys import stdin\r\nn,m=map(int,stdin.readline().strip().split())\r\ns=stdin.readline().strip()\r\narr=[0 for i in range(n)]\r\narr1=[0 for i in range(n)]\r\ntot=0\r\nfor i in range(n):\r\n if s[i]=='.':\r\n arr[i]+=arr[i-1]+1\r\n else:\r\n tot+=max(arr[i-1]-1,0)\r\narr1[-1]=arr[-1]\r\nfor i in range(n-2,-1,-1):\r\n if arr[i]!=0 and arr[i]<arr[i+1]:\r\n arr1[i]=arr1[i+1]\r\n if arr[i+1]==0:\r\n arr1[i]=arr[i]\r\n \r\ntot+=max(arr[-1]-1,0)\r\n\r\ns=list(s)\r\nfor i in range(m):\r\n a,b=stdin.readline().strip().split()\r\n a=int(a)-1\r\n \r\n if b!=\".\":\r\n if s[a]!='.':\r\n print(tot)\r\n s[a]=b\r\n continue\r\n l=1\r\n if a-1<0 or s[a-1]!='.':\r\n l=0\r\n r=1\r\n if a+1>=n or s[a+1]!='.':\r\n r=0\r\n if l+r==2:\r\n tot-=2\r\n elif l==1:\r\n tot-=1\r\n elif r==1:\r\n tot-=1\r\n print(tot)\r\n else:\r\n if s[a]==\".\":\r\n print(tot)\r\n s[a]=b\r\n continue\r\n l=1\r\n if a-1<0 or s[a-1]!='.':\r\n l=0\r\n r=1\r\n if a+1>=n or s[a+1]!='.':\r\n r=0\r\n if l+r==2:\r\n tot+=2\r\n elif l==1:\r\n tot+=1\r\n elif r==1:\r\n tot+=1\r\n print(tot)\r\n s[a]=b \r\n \r\n \r\n \r\n", "import os, sys, re\r\nfrom io import BytesIO, IOBase\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, 8192))\r\n if not b:\r\n break\r\n ptr = self.buffer.tell()\r\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\r\n self.newlines = 0\r\n return self.buffer.read()\r\n\r\n def readline(self):\r\n while self.newlines == 0:\r\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, 8192))\r\n self.newlines = b.count(b\"\\n\") + (not b)\r\n ptr = self.buffer.tell()\r\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\r\n self.newlines -= 1\r\n return self.buffer.readline()\r\n\r\n def flush(self):\r\n if self.writable:\r\n os.write(self._fd, self.buffer.getvalue())\r\n self.buffer.truncate(0), self.buffer.seek(0)\r\n\r\n\r\nclass IOWrapper(IOBase):\r\n def __init__(self, file):\r\n self.buffer = FastIO(file)\r\n self.flush = self.buffer.flush\r\n self.writable = self.buffer.writable\r\n self.write = lambda s: self.buffer.write(s.encode(\"ascii\"))\r\n self.read = lambda: self.buffer.read().decode(\"ascii\")\r\n self.readline = lambda: self.buffer.readline().decode(\"ascii\")\r\n\r\n\r\nsys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)\r\ninput = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\r\nn, m = map(int, input().split())\r\ns, ls, num = input(), 0, 0\r\n\r\nfor i in re.finditer('\\.+', s):\r\n l, r = i.span()\r\n ls += r - l\r\n num += 1\r\n\r\ns, out = list(s), []\r\nfor _ in range(m):\r\n i, ch = input().split()\r\n i = int(i) - 1\r\n\r\n if s[i] != ch:\r\n if ch == '.':\r\n ls += 1\r\n if (i and s[i - 1] == '.') and (i < n - 1 and s[i + 1] == '.'):\r\n num -= 1\r\n if (not i or s[i - 1] != '.') and (i == n - 1 or s[i + 1] != '.'):\r\n num += 1\r\n elif s[i] == '.':\r\n ls -= 1\r\n if i and s[i - 1] == '.' and i < n - 1 and s[i + 1] == '.':\r\n num += 1\r\n if (not i or s[i - 1] != '.') and (i == n - 1 or s[i + 1] != '.'):\r\n num -= 1\r\n s[i] = ch\r\n out.append(ls - num)\r\n # print(ls, num, s)\r\nprint(*out, sep='\\n')\r\n", "import sys, re, os\r\nfrom io import BytesIO\r\n\r\ninput = BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\nn, m = map(int, input().split())\r\ns, ls, num = input().decode(), 0, 0\r\n\r\nfor i in re.finditer('\\.+', s):\r\n l, r = i.span()\r\n ls += r - l\r\n num += 1\r\n\r\ns, out = list(s), []\r\nfor _ in range(m):\r\n i, ch = input().decode().split()\r\n i = int(i) - 1\r\n\r\n if s[i] != ch:\r\n if ch == '.':\r\n ls += 1\r\n if (i and s[i - 1] == '.') and (i < n - 1 and s[i + 1] == '.'):\r\n num -= 1\r\n if (not i or s[i - 1] != '.') and (i == n - 1 or s[i + 1] != '.'):\r\n num += 1\r\n elif s[i] == '.':\r\n ls -= 1\r\n if i and s[i - 1] == '.' and i < n - 1 and s[i + 1] == '.':\r\n num += 1\r\n if (not i or s[i - 1] != '.') and (i == n - 1 or s[i + 1] != '.'):\r\n num -= 1\r\n s[i] = ch\r\n out.append(ls - num)\r\n # print(ls, num, s)\r\nprint(*out, sep='\\n')\r\n", "import sys\n\ndef main():\n (n, m) = map(int, sys.stdin.readline().strip().split(' '))\n s = list(input())\n k = 0\n for i in range(n - 1):\n if s[i] == '.' and s[i + 1] == '.':\n k += 1\n for j in range(m):\n (xi, ci) = sys.stdin.readline().strip().split(\" \")\n xi = int(xi) - 1\n prev = s[xi]\n s[xi] = ci\n if prev == '.' and ci != '.':\n if xi + 1 != 1 and s[xi - 1] == '.':\n k -= 1\n if xi != n - 1 and s[xi + 1] == '.':\n k -= 1\n elif prev != '.' and ci == '.':\n if xi + 1 != 1 and s[xi - 1] == '.':\n k += 1\n if xi != n - 1 and s[xi + 1] == '.':\n k += 1\n sys.stdout.write(\"{}\\n\".format(k))\n\nmain()\n", "# cook your dish here\r\nfrom collections import deque, defaultdict\r\nfrom math import sqrt, ceil, factorial, floor, inf, log2, sqrt, gcd\r\nimport bisect\r\nimport sys\r\nimport copy\r\n\r\n\r\ndef get_array(): return list(map(int, sys.stdin.readline().strip().split()))\r\n\r\n\r\ndef get_ints(): return map(int, sys.stdin.readline().strip().split())\r\n\r\n\r\ndef input(): return sys.stdin.readline().strip()\r\n\r\nn,m=get_ints()\r\ns=input()\r\ncnt=0\r\nfor i in range(len(s)-1):\r\n if s[i]=='.' and s[i+1]=='.':\r\n cnt+=1\r\narr=[]\r\nfor i in range(len(s)):\r\n arr.append(s[i])\r\nfor i in range(m):\r\n a,b=input().split()\r\n a=int(a)\r\n a-=1\r\n if b=='.':\r\n if arr[a]!='.':\r\n if a+1<=n-1 and arr[a+1]=='.':\r\n cnt+=1\r\n if a-1>=0 and arr[a-1]=='.':\r\n cnt+=1\r\n arr[a]=b\r\n else:\r\n if arr[a]=='.':\r\n if a+1<=n-1 and arr[a+1]=='.':\r\n cnt-=1\r\n if a-1>=0 and arr[a-1]=='.':\r\n cnt-=1\r\n arr[a]=b\r\n\r\n print(cnt)\r\n\r\n\r\n\r\n\r\n", "import sys, re\r\n\r\ninput = lambda: sys.stdin.buffer.readline().decode().strip()\r\nn, m = map(int, input().split())\r\ns, ls, num = input(), 0, 0\r\n\r\nfor i in re.finditer('\\.+', s):\r\n l, r = i.span()\r\n ls += r - l\r\n num += 1\r\n\r\ns = list(s)\r\nfor _ in range(m):\r\n i, ch = input().split()\r\n i = int(i) - 1\r\n\r\n if s[i] != ch:\r\n if ch == '.':\r\n ls += 1\r\n if (i and s[i - 1] == '.') and (i < n - 1 and s[i + 1] == '.'):\r\n num -= 1\r\n if (not i or s[i - 1] != '.') and (i == n - 1 or s[i + 1] != '.'):\r\n num += 1\r\n elif s[i] == '.':\r\n ls -= 1\r\n if i and s[i - 1] == '.' and i < n - 1 and s[i + 1] == '.':\r\n num += 1\r\n if (not i or s[i - 1] != '.') and (i == n - 1 or s[i + 1] != '.'):\r\n num -= 1\r\n s[i] = ch\r\n print(ls - num)\r\n # print(ls, num, s)\r\n" ]

[ "import math\r\nclass Data:\r\n def __init__(self, x, y):\r\n self.x = x\r\n self.y = y\r\nn = int(input())\r\nd = [Data(0, 0) for _ in range(100005)]\r\nU = [0.0] * 2000005\r\nD = [2000005.0] * 2000005\r\nresult = 0.0\r\nmaxx = maxy = 0x7fffffff\r\nfor i in range(n):\r\n x, y = map(int, input().split())\r\n d[i] = Data(x, y)\r\nfor i in range(n):\r\n if d[i].x < maxx:\r\n maxx = d[i].x\r\n if d[i].y < maxy:\r\n maxy = d[i].y\r\nfor i in range(n):\r\n d[i].x -= maxx\r\n d[i].y -= maxy\r\ndef work():\r\n global result\r\n maxx = 0\r\n d[n] = d[0]\r\n for i in range(n):\r\n maxx = max(maxx, d[i].x) \r\n for i in range(maxx + 1):\r\n D[i] = 2000005.0\r\n U[i] = -1.0\r\n for i in range(n):\r\n if d[i].x == d[i+1].x:\r\n U[d[i].x] = max(U[d[i].x], d[i].y)\r\n U[d[i].x] = max(U[d[i].x], d[i+1].y)\r\n D[d[i].x] = min(D[d[i].x], d[i].y)\r\n D[d[i].x] = min(D[d[i].x], d[i+1].y)\r\n else:\r\n k = 1.0 * (d[i+1].y - d[i].y) / (d[i+1].x - d[i].x)\r\n if d[i].x < d[i+1].x:\r\n l = d[i].x\r\n r = d[i+1].x\r\n b = d[i].y\r\n else:\r\n l = d[i+1].x\r\n r = d[i].x\r\n b = d[i+1].y\r\n for j in range(l, r+1):\r\n U[j] = max(U[j], b + (j - l) * k)\r\n D[j] = min(D[j], b + (j - l) * k) \r\n sumV = sum2 = cnt = res = 0.0\r\n for i in range(maxx + 1):\r\n c = math.floor(U[i]) - math.ceil(D[i]) + 1\r\n res += (cnt * i * i - 2 * sumV * i + sum2) * c\r\n sumV += c * i\r\n sum2 += c * i * i\r\n cnt += c\r\n result += res / (cnt * (cnt - 1))\r\nwork()\r\nfor i in range(n):\r\n d[i].x, d[i].y = d[i].y, d[i].x\r\nwork()\r\nprint(result)# 1692702817.5282125" ]

[ "from io import BytesIO, IOBase\r\nimport math\r\n\r\nimport random\r\nimport sys\r\nimport os\r\n\r\nimport bisect\r\nimport typing\r\nfrom collections import Counter, defaultdict, deque\r\nfrom copy import deepcopy\r\nfrom functools import cmp_to_key, lru_cache, reduce\r\nfrom heapq import heapify, heappop, heappush, heappushpop, nlargest, nsmallest\r\nfrom itertools import accumulate, combinations, permutations, count\r\nfrom operator import add, iand, ior, itemgetter, mul, xor\r\nfrom string import ascii_lowercase, ascii_uppercase, ascii_letters\r\nfrom typing import *\r\nBUFSIZE = 4096\r\n\r\nclass FastIO(IOBase):\r\n newlines = 0\r\n\r\n def __init__(self, file):\r\n self._fd = file.fileno()\r\n self.buffer = BytesIO()\r\n self.writable = \"x\" in file.mode or \"r\" not in file.mode\r\n self.write = self.buffer.write if self.writable else None\r\n\r\n def read(self):\r\n while True:\r\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\r\n if not b:\r\n break\r\n ptr = self.buffer.tell()\r\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\r\n self.newlines = 0\r\n return self.buffer.read()\r\n\r\n def readline(self):\r\n while self.newlines == 0:\r\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\r\n self.newlines = b.count(b\"\\n\") + (not b)\r\n ptr = self.buffer.tell()\r\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\r\n self.newlines -= 1\r\n return self.buffer.readline()\r\n\r\n def flush(self):\r\n if self.writable:\r\n os.write(self._fd, self.buffer.getvalue())\r\n self.buffer.truncate(0), self.buffer.seek(0)\r\n\r\nclass IOWrapper(IOBase):\r\n def __init__(self, file):\r\n self.buffer = FastIO(file)\r\n self.flush = self.buffer.flush\r\n self.writable = self.buffer.writable\r\n self.write = lambda s: self.buffer.write(s.encode(\"ascii\"))\r\n self.read = lambda: self.buffer.read().decode(\"ascii\")\r\n self.readline = lambda: self.buffer.readline().decode(\"ascii\")\r\n\r\nsys.stdin = IOWrapper(sys.stdin)\r\nsys.stdout = IOWrapper(sys.stdout)\r\ninput = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\r\n\r\nif True:\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 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\ninf = float('inf')\r\n\r\n# from types import GeneratorType\r\n\r\n# def bootstrap(f, stack=[]):\r\n# def wrappedfunc(*args, **kwargs):\r\n# if stack:\r\n# return f(*args, **kwargs)\r\n# else:\r\n# to = f(*args, **kwargs)\r\n# while True:\r\n# if type(to) is GeneratorType:\r\n# stack.append(to)\r\n# to = next(to)\r\n# else:\r\n# stack.pop()\r\n# if not stack:\r\n# break\r\n# to = stack[-1].send(to)\r\n# return to\r\n# return wrappedfunc\r\n\r\n# RANDOM = random.getrandbits(20)\r\n\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\nclass LCA:\r\n def __init__(self, parent, depth, root):\r\n # g[v]: (cost, u)\r\n self.n = len(parent)\r\n self.root = root\r\n self.num = (self.n).bit_length()\r\n self.depth = depth\r\n self.parent = [[-1]*self.n for i in range(self.num)]\r\n self.parent[0] = parent\r\n # doubling\r\n for k in range(self.num-1):\r\n for v in range(self.n):\r\n if self.parent[k][v] == -1:\r\n self.parent[k+1][v] = -1\r\n else:\r\n self.parent[k+1][v] = self.parent[k][self.parent[k][v]]\r\n \r\n def getLCA(self, u, v):\r\n if self.depth[u] > self.depth[v]:\r\n u, v = v, u\r\n for k in range(self.num):\r\n if ((self.depth[v]-self.depth[u]) >> k) & 1:\r\n v = self.parent[k][v]\r\n if u == v:\r\n return u\r\n \r\n for k in reversed(range(self.num)):\r\n if self.parent[k][u] != self.parent[k][v]:\r\n u = self.parent[k][u]\r\n v = self.parent[k][v]\r\n return self.parent[0][u]\r\n \r\n def search(self, v, x):\r\n for k in reversed(range(self.num)):\r\n if (x>>k)&1:\r\n v = self.parent[k][v]\r\n return v\r\n \r\n def getDepth(self, u):\r\n return self.depth[u]\r\n\r\nn = II()\r\npath = [[] for _ in range(n)]\r\n\r\nfor _ in range(n - 1):\r\n u, v = GMI()\r\n path[u].append(v)\r\n path[v].append(u)\r\n\r\nt = 0\r\nparent = [-1] * n\r\ntmstamp = [-1] * n\r\nstack = [0]\r\ndepth = [0] * n\r\nwhile stack:\r\n u = stack.pop()\r\n tmstamp[u] = t\r\n t += 1\r\n for v in path[u]:\r\n if parent[u] != v:\r\n parent[v] = u\r\n depth[v] = depth[u] + 1\r\n stack.append(v)\r\n\r\nlca = LCA(parent, depth, 0)\r\n\r\ntmp_parent = [-1] * n\r\ndp0 = [0] * n\r\ndp1 = [0] * n\r\ntot_son = [0] * n\r\nmax_val = [0] * n\r\nnotes = [0] * n\r\nq = II()\r\nfor _ in range(q):\r\n m, *nodes = GMI()\r\n m += 1\r\n nodes.sort(key=lambda x: tmstamp[x])\r\n for node in nodes:\r\n tmp_parent[node] = -1\r\n \r\n dfs_order = nodes[:]\r\n for i in range(m - 1):\r\n u, v = nodes[i], nodes[i+1]\r\n l = lca.getLCA(u, v)\r\n dfs_order.append(l)\r\n \r\n dfs_order = sorted(set(dfs_order), key=lambda x: -tmstamp[x])\r\n k = len(dfs_order)\r\n\r\n for x in nodes:\r\n notes[x] = 1\r\n dp0[x] = 1\r\n dp1[x] = 0\r\n \r\n for i in range(k - 1):\r\n tmp_parent[dfs_order[i]] = lca.getLCA(dfs_order[i], dfs_order[i+1])\r\n \r\n for i in range(k):\r\n u = dfs_order[i]\r\n if not notes[u]:\r\n dp0[u] = min(dp0[u], tot_son[u] + 1)\r\n dp1[u] = min(dp1[u] - max_val[u], tot_son[u] + 1)\r\n if i != k - 1:\r\n if notes[u] and notes[parent[u]]:\r\n print(-1)\r\n break\r\n p = tmp_parent[u]\r\n if notes[p]:\r\n dp0[p] += dp0[u]\r\n dp1[p] += dp0[u]\r\n else:\r\n dp0[p] += dp0[u]\r\n dp1[p] += dp0[u]\r\n tot_son[p] += dp1[u]\r\n max_val[p] = max(max_val[p], dp0[u] - dp1[u])\r\n else:\r\n print(dp1[dfs_order[k-1]])\r\n \r\n for x in dfs_order:\r\n tmp_parent[x] = -1\r\n notes[x] = 0\r\n dp0[x] = dp1[x] = 0\r\n tot_son[x] = 0\r\n max_val[x] = 0" ]

[ "n, m = map(int, input().split())\r\ns = input()\r\np = c = 0\r\nfor i in range(1, n):\r\n if s[i] == s[i - 1]:\r\n c += n * (m - 1)\r\n p = i\r\n elif s[i] != s[i - 2]:\r\n p = i - 1\r\n c += i - p\r\nans = n * n * (m - 1) - c\r\nprint(ans)\r\n", "line = list(map(int,input().split()))\r\nn = line[0]\r\nm = line[1]\r\n\r\ns = input()\r\na = [0]*(n+2)\r\n\r\nfor i in range(n):\r\n a[i+1] = ord(s[i]) - ord('a') + 1\r\ndp = [[0] * 8 for _ in range(n+1)]\r\n\r\nfor i in range(1,m+1):\r\n st = 1\r\n if i == a[1]:\r\n st |= 2 #equivale a activar el estado que tiene el bit del centro prendido(posición [1,1])\r\n if i == a[1] or i == a[2]:\r\n st |= 4 #equivale a activar el estado que tiene el 3er bit prendido(posición [1,2])\r\n dp[1][st] += 1\r\n\r\nfor i in range(1,n):\r\n for st in range(8):\r\n if dp[i][st] == 0:\r\n continue\r\n f = i-2 + (st&1)\r\n s = i-1 + ((st>>1)&1)\r\n t = i-1 + ((st>>2)&1)\r\n for j in range(1,m+1):\r\n f1 = max(s,f + (1 if j == a[i] else 0))\r\n s1 = max(max(f1,t), s + (1 if j == a[i+1] else 0))\r\n t1 = max(s1, t + (1 if j == a[i+2] else 0))\r\n\r\n if f1 < i - 1 or s1 < i or t1 < i:\r\n continue\r\n f1 -= (i-1)\r\n s1 -= i\r\n t1 -= i\r\n newSt = f1|s1<<1|t1<<2\r\n dp[i+1][newSt] += dp[i][st]\r\n\r\nprint(dp[n][0] + dp[n][1] + dp[n][4] + dp[n][5])\r\n", "def main():\r\n n, m = map(int, input().split())\r\n s = input()\r\n k = sum(s[i] != s[i - 1] for i in range(1, n)) + 1\r\n x = i = 0\r\n while i < n - 1:\r\n if s[i] != s[i + 1]:\r\n j = i\r\n while i + 2 < n and s[i] == s[i + 2]:\r\n i += 1\r\n j = (i - j) + 2\r\n x += j * (j - 1) // 2\r\n i += 1\r\n ans = k * (m * n - n) - x\r\n print(ans)\r\nmain()\r\n\r\n \t \t \t \t\t\t \t\t\t \t \t\t\t\t\t\t\t\t" ]

[ "n=int(input())\r\nl=[]\r\nfor i in range(n):\r\n p=[]\r\n a,b=map(int,input().split())\r\n p.append(a)\r\n p.append(b)\r\n l.append(p)\r\nans=0\r\nfor i in range(n):\r\n for j in range(n):\r\n if(i!=j and l[i][0]==l[j][1]):\r\n ans=ans+1\r\n break\r\nprint(n-ans) ", "#!/usr/bin/env python3\n\ndef main():\n\n desc = set()\n brand = [0] * 1001\n proc = [0] * 1001\n tb = [False] * 1001\n\n n = int(input())\n total = n\n\n for i in range(n):\n a, b = map(int, input().split())\n desc.add(a)\n brand[a] += 1\n proc[b] += 1\n tb[b] |= True if a != b else False\n\n for a in desc:\n if (tb[a] or proc[a] > 1):\n total -= brand[a]\n elif proc[a]:\n total -= brand[a] - 1\n\n print(total)\n\n \nif __name__ == \"__main__\":\n main()\n\n", "n = int(input())\r\nal = []\r\nbl = []\r\nfor i in range(n):\r\n a, b = [int(x) for x in input().split()]\r\n al.append(a)\r\n bl.append(b)\r\ncount = 0\r\nfor i, bot in enumerate(al):\r\n if bot in bl[:i] + bl[i+1:]:\r\n count+=1\r\n\r\nprint(n-count)", "n=int(input())\r\nl1=[]\r\nl2=[]\r\nl3=[]\r\nl4=[]\r\nc=0\r\nfor i in range (n):\r\n x,y=map(int,input().split())\r\n l1.append(x)\r\n l2.append(y)\r\nfor i in range (len(l1)):\r\n l3=l3+l2\r\n l3.pop(i)\r\n if l1[i] not in l3:\r\n c=c+1\r\n # l4.append(l1[i])\r\n l3.clear()\r\n \r\nprint(c)", "n=int(input())\r\nl=[]\r\nfor i in range(n):\r\n m=list(map(int,input().split()))\r\n l.append(m)\r\nv=[]\r\ni=0\r\nwhile i < n :\r\n j=0\r\n while j < n :\r\n if i != j and l[i][0]==l[j][1]:\r\n v.append(i)\r\n j+=1\r\n i+=1\r\nv=set(v)\r\nprint(n-len(v))", "n = int(input())\r\n\r\nls = []\r\nfor i in range(n):\r\n x, y = list(map(int, input().split()))\r\n ls.append((x, y))\r\n\r\ncount = 0\r\nfor i in range(n):\r\n canOpen = False\r\n for j in range(n):\r\n if i == j:\r\n continue\r\n elif ls[i][0] == ls[j][1]:\r\n canOpen = True\r\n if not canOpen:\r\n count += 1\r\n\r\nprint(count)", "import sys\r\nn=int(input())\r\nres=[]\r\nmaxi=-sys.maxsize\r\nfor i in range(n):\r\n t=list(map(int,input().split(\" \")))\r\n maxi=max(maxi,t[0],t[1])\r\n res.append(t)\r\nans=[False for i in range(n)]\r\nfor i in range(len(res)):\r\n ai,bi=res[i]\r\n for j in range(len(res)):\r\n if j==i:\r\n continue\r\n x,y=res[j]\r\n if x==bi and ans[j]==False:\r\n ans[j]=True\r\n\r\ncount=0\r\nfor i in range(n):\r\n if ans[i]==False:\r\n count=count+1\r\n\r\nprint(count)", "n=int(input())\r\nO=[0]*n\r\nB=list(O)\r\nfor i in range(n):\r\n a,b=map(int,input().split())\r\n O[i]=b\r\n B[i]=a\r\nans=n\r\nfor i in range(n):\r\n for j in range(n):\r\n if(j==i):\r\n continue\r\n if(O[j]==B[i]):\r\n ans-=1\r\n break\r\nprint(ans)\r\n", "n=int(input())\r\nres=[]\r\nfor _ in range(n):\r\n res.append(list(map(int,input().split())))\r\nres.sort(key=lambda x:x[0])\r\no=[0]*n\r\nfor i in range(n):\r\n for j in range(n):\r\n if i!=j and res[i][1]==res[j][0]:\r\n o[j]=1\r\nprint(n-sum(o))", "\nm = 1\n\nfor i in range(m):\n li = []\n n = int(input())\n for i in range(n):\n arr = list(map(int,input().split(\" \")))\n li.append(arr)\n c = 0\n for i in range(n):\n ok = False\n for j in range(n):\n if i!=j and li[i][0]==li[j][1]:\n ok = True\n break\n if not ok:\n c += 1\n print(c)\n\n \n", "n = int(input())\r\ngrid = []\r\nfor i in range(n):\r\n grid.append(list(map(int, input().split())))\r\nans = n\r\nfor i in range(n):\r\n for j in range(n):\r\n if i != j:\r\n if grid[j][1] == grid[i][0]:\r\n ans -= 1\r\n break\r\n\r\nprint(ans)\r\n ", "n = int(input())\r\narr_a = []\r\narr_b = []\r\narr_c = [0 for i in range(10001)]\r\nfor i in range(n):\r\n a,b = map(int,input().split())\r\n arr_a.append(a)\r\n arr_b.append(b)\r\n arr_c[b]+=1\r\ncount = 0\r\nfor i in range(n):\r\n arr_c[arr_b[i]] -=1\r\n if arr_c[arr_a[i]] == 0:\r\n count+=1\r\n arr_c[arr_b[i]] +=1\r\nprint(count)", "n=int(input())\r\narr=[]\r\nbrr=[]\r\nfor _ in range(n):\r\n a,b=map(int,input().split())\r\n arr.append(a)\r\n brr.append(b)\r\n\r\nfor i in range(n):\r\n if (arr[i] in brr[:i] or arr[i] in brr[i+1:]):\r\n n-=1\r\n else:\r\n continue\r\nprint(n)", "#!/usr/bin/python3\n\nn = int(input())\na = []\nb = []\nfor i in range(n):\n ap, bp = map(int, input().split())\n a.append(ap)\n b.append(bp)\n\nok = [False] * n\nfor i in range(n):\n for j in range(n):\n if b[i] == a[j] and i != j:\n ok[j] = True\n\nprint(ok.count(False))\n", "n = int(input())\r\nk = []\r\nt = []\r\nfor i in range(n):\r\n p, m = map(int, input().split())\r\n k.append(p)\r\n t.append(m)\r\nans = n\r\nfor i in range(len(k)):\r\n for j in range(len(t)):\r\n if i == j:\r\n continue\r\n if k[i] == t[j]:\r\n ans -= 1\r\n break\r\nprint(ans)", "n = int(input())\r\na1 = []\r\nb1= []\r\nfor i in range(n):\r\n a,b = map(int,input().split())\r\n a1.append(a)\r\n b1.append(b)\r\nok = [False] * n\r\nfor i in range(n):\r\n for j in range(n):\r\n if b1[i] == a1[j] and i != j:\r\n ok[j] = True\r\nprint(ok.count(False))\r\n", "import sys\r\nnum = int(sys.stdin.readline())\r\narr_a, arr_b = [], []\r\ncnt = 0\r\nfor i in range(num):\r\n a, b = map(int, sys.stdin.readline().split())\r\n arr_a.append(a)\r\n arr_b.append(b)\r\n\r\nfor i in range(num):\r\n for j in range(num):\r\n if i != j and arr_a[i] == arr_b[j]:\r\n cnt += 1\r\n break\r\n\r\n\r\nsys.stdout.write(str(num - cnt))", "n = int(input())\r\n\r\nbottles = []\r\nfor i in range(n):\r\n a, b = [int(i) for i in input().split()]\r\n bottles.append((a, b))\r\n\r\nopened = [False]*n\r\nfor i in range(n):\r\n check = bottles[i][1]\r\n for j in range(n):\r\n if i == j:\r\n continue\r\n if bottles[j][0] == check:\r\n opened[j] = True\r\n\r\nres = 0\r\nfor i in opened:\r\n if not i:\r\n res += 1\r\n\r\nprint(res)", "import sys\r\n\r\ndef input(): return sys.stdin.readline().strip()\r\ndef iinput(): return int(input())\r\ndef rinput(): return map(int, sys.stdin.readline().strip().split()) \r\ndef get_list(): return list(map(int, sys.stdin.readline().strip().split())) \r\n\r\n\r\nn=iinput()\r\nx=[]\r\ny=[]\r\ncount=0\r\nfor i in range(n):\r\n a,b=rinput()\r\n x.append(a)\r\n y.append(b)\r\n\r\n\r\n\r\nfor i in range(n):\r\n flag=True\r\n for j in range(n):\r\n if(i!=j):\r\n if(x[i]==y[j]):\r\n flag=False\r\n if(flag==True):\r\n count+=1\r\nprint(count)\r\n\r\n", "n = int(input())\r\ne = []\r\n\r\nfor _ in range(n):\r\n e.append([int(k) for k in input().split()])\r\n\r\ndef bottles(n, e):\r\n\r\n opened_idx = {}\r\n have = {}\r\n\r\n for i, [a, b] in enumerate(e):\r\n if a not in have:\r\n have[a] = []\r\n have[a].append(i)\r\n\r\n for i, [a, b] in enumerate(e):\r\n if b in have:\r\n for idx in have[b]:\r\n if idx != i:\r\n opened_idx[idx] = True\r\n\r\n\r\n return n - len(opened_idx)\r\n\r\nprint(bottles(n, e))", "n = int(input())\r\nd ={}\r\na = []\r\nb = []\r\nfor _ in range(n):\r\n\ti , j = map(int,input().split())\r\n\ta.append([i,j])\r\n\tb.append([i,0])\r\nfor p in range(n):\r\n\tpair = a[p]\r\n\tfor i in range(n):\r\n\t\tif i!=p:\r\n\t\t\tif pair[1] == a[i][0]:\r\n\t\t\t\tb[i][1] = 1\r\nc=0\r\nfor i in b:\r\n\tif i[1]==0:\r\n\t\tc+=1\r\nprint(c)\t", "from collections import Counter\r\nn=int(input())\r\ncount=0\r\na=[0]*n\r\nb=[0]*n\r\nfor i in range(n): \r\n a[i],b[i]=map(int,input().split())\r\nfreq=dict(Counter(b))\r\nfor i in range(n):\r\n if a[i] not in b:\r\n count+=1\r\n else:\r\n if a[i]==b[i] and freq[a[i]]==1:\r\n count+=1\r\nprint(count)", "# Collaborated with no one\nn = int(input())\nlist1 = []\nlist2 = []\nopenedBottles = []\nfor i in range(0, n+1):\n list1.append(0)\n list2.append(0)\n openedBottles.append(0)\nfor i in range(1, n+1):\n input1 = list(map(int, input().split(\" \")))\n list1[i] = input1[0]\n list2[i] = input1[1]\nfor i in range(1, n+1):\n for j in range(1, n+1):\n if(i!=j and list2[i] == list1[j]):\n openedBottles[j] = 1\nanswer = 0\nfor i in range(1, n+1):\n answer += openedBottles[i]\nprint(n-answer)\n \t\t\t\t \t\t\t\t\t\t \t\t \t\t\t\t \t\t\t \t", "sz = int(input())\r\na =[];b =[];c = [1]*sz\r\nfor _ in range(sz):\r\n vl = input().split()\r\n a.append(vl[0]);b.append(vl[1])\r\nfor i in range(sz):\r\n for j in range(sz):\r\n if a[j] == b[i] and i != j:\r\n c[j] = 0\r\nprint(sum(c))", "n=int(input())\r\narr=[]\r\nrra=[]\r\n\r\nfor i in range (n):\r\n z=list(map(int,input().split()))\r\n rra.append(z[0])\r\n arr.append(z[1])\r\ncount=0\r\n\r\nfor i in range(n) :\r\n temp=arr[i]\r\n indexx=i\r\n arr.remove(temp)\r\n if rra[i] in arr :\r\n arr.insert(indexx,temp)\r\n else :\r\n count+=1\r\n arr.insert(indexx,temp)\r\nprint(count)\r\n", "n=int(input())\r\na,b,c=[],[],[1]*n\r\nfor i in range(n):\r\n x,y=input().split()\r\n a.append(x)\r\n b.append(y)\r\nfor i in range(n):\r\n for j in range(n):\r\n if i!=j:\r\n if a[j]==b[i]:\r\n c[j]=0\r\nprint(sum(c))\r\n", "n=int(input())\r\nl1=list()\r\nl2=list()\r\nl=0\r\nfor i in range(n):\r\n a,b=map(int,input().split()) \r\n l1.append(a)\r\n l2.append(b)\r\nfor i in range(n):\r\n if l1[i] in l2[:i] or l1[i] in l2[i+1:]:\r\n l=l+1\r\nprint(n-l) ", "n = int(input())\r\ndata = []\r\nfor j in range(n):\r\n bootles = list(map(int, input().split()))\r\n data.append(bootles)\r\ncount = 0\r\nfor j in range(n):\r\n for i in range(n):\r\n if i != j:\r\n if data[j][0] == data[i][1]:\r\n count += 1\r\n break\r\nprint(n-count)\r\n \r\n", "\r\n\r\n\r\nn = int(input())\r\nunopenable = []\r\nopenable = []\r\ncount = n\r\nfor i in range(n):\r\n bottle = [int(i) for i in input().split()]\r\n if (bottle[0] in openable):\r\n count -= 1\r\n unopenable.append(0)\r\n else:\r\n unopenable.append(bottle[0])\r\n openable.append(bottle[1])\r\nfor i in range(n - 1):\r\n bottle = unopenable[i]\r\n if (bottle != 0):\r\n if (bottle in openable[i + 1:n]):\r\n count -= 1\r\n\r\nprint (count)", "\r\nn = int(input())\r\na = []\r\nb = []\r\nfor i in range(n):\r\n ai, bi = map(int, input().split())\r\n a.append(ai)\r\n b.append(bi)\r\nok = 0\r\nfor i in range(n):\r\n for y in range(n):\r\n if b[y] == a[i] and y != i:\r\n ok += 1\r\n break\r\nprint(n - ok)\r\n\r\n", "n = int(input())\nopened = 0\nA = list()\nB = list()\nfor _ in range(n):\n a, b = map(int, input().split())\n A.append(a)\n B.append(b)\n\nfor i in range(n):\n for j in range(n):\n if A[i] == B[j] and i != j:\n opened += 1\n break\n\nprint(n - opened)\n", "import sys\r\nsys.setrecursionlimit(10000)\r\nn = int(sys.stdin.readline())\r\narr = [0]*1001\r\nbottles = []\r\nfor i in range(n):\r\n\ta,b = [int(x) for x in input().strip().split()]\r\n\tbottles.append([a,b])\r\ncount = 0\r\nfor i in range(n):\r\n\tfor j in range(n):\r\n\t\tif j!=i and bottles[i][0]==bottles[j][1]: count+=1 ;bottles[i][0]=0\r\n\r\nprint(n-count)\r\n\r\n", "n = int(input())\r\n\r\nbottles = []\r\nopened = []\r\n\r\nresult = 0\r\n\r\nfor i in range(n):\r\n bottles.append(list(map(int, input().split())))\r\n opened.append(bottles[-1][1])\r\n\r\nfor i in range(len(bottles)):\r\n if bottles[i][0] not in opened:\r\n result += 1\r\n elif bottles[i][0] == bottles[i][1] and opened.count(bottles[i][1]) == 1:\r\n result += 1\r\n\r\nprint(result)", "n = int(input())\r\nopen = [False for _ in range(n)]\r\nbottles = []\r\nfor _ in range(n):\r\n a, b = map(int, input().split())\r\n bottles.append((a, b))\r\n\r\nfor i in range(n):\r\n for j in range(n):\r\n if j != i and bottles[i][1] == bottles[j][0]: # i can open j\r\n open[j] = True\r\n\r\nprint(n-sum(open))", "n=int(input())\r\na=[]\r\nb=[]\r\nc=[1]*n\r\nfor i in range(n):\r\n q=input().split()\r\n a.append(q[0])\r\n b.append(q[1])\r\nfor i in range(n):\r\n for j in range(n):\r\n if a[j]==b[i] and i!=j:\r\n c[j]=0\r\nprint(sum(c))\r\n", "n = int(input())\r\na,b = [],[]\r\nfor i in range(n):\r\n ael,bel = map(int,input().split())\r\n a.append(ael)\r\n b.append(bel)\r\n \r\ndic = {}\r\n\r\nfor el in b:\r\n dic[el] = []\r\n \r\nfor i,el in enumerate(b):\r\n dic[el].append(i)\r\n \r\nct = 0\r\nfor i,el in enumerate(a):\r\n if el not in dic:\r\n ct+=1\r\n else:\r\n l = dic[el][:]\r\n if i in l: l.remove(i)\r\n if len(l)==0:\r\n ct+=1\r\n \r\nprint(ct)", "from collections import defaultdict\r\n\r\na=defaultdict(int)\r\nb=[]\r\nc=[]\r\n\r\nfor _ in range(int(input())):\r\n x,y=map(int,input().split())\r\n a[x]+=1\r\n b.append(y)\r\n c.append(x)\r\n\r\nfor i in range(len(b)):\r\n for j in range(len(b)):\r\n\r\n if(i!=j):\r\n if(b[i]==c[j]):\r\n if(c[i]==b[i]):\r\n if(b.count(c[i])>1):\r\n if(c[j] in a):\r\n del a[c[j]]\r\n else:\r\n a[c[i]]=1\r\n else:\r\n if(c[j] in a):\r\n del a[c[j]]\r\n\r\n \r\n \r\n# print(a)\r\n\r\nprint(sum(a.values()))", "n = int(input())\r\nbottles = [tuple(map(int, input().split())) for _ in range(n)]\r\n\r\nopened = set()\r\n\r\nfor i in range(n):\r\n for j in range(n):\r\n if i == j:\r\n continue\r\n\r\n if bottles[i][1] == bottles[j][0]:\r\n opened.add(j)\r\nresult = 0\r\nfor i in range(n):\r\n if not i in opened:\r\n result += 1\r\n\r\nprint(result)\r\n", "l1=[]\r\nl2=[]\r\nn=int(input())\r\nfor _ in range(n):\r\n x,y=list(map(int,input().split()))\r\n l1.append(x)\r\n l2.append(y)\r\nans=[1]*n\r\nfor i in range(len(l1)):\r\n for j in range(len(l2)):\r\n if i==j:\r\n continue\r\n if l2[i]==l1[j]:\r\n ans[j]=0\r\nprint(sum(ans))", "n = int(input())\r\na = []\r\nb = []\r\nfor i in range(n):\r\n x, y = map(int, input().split())\r\n a.append(x)\r\n b.append(y)\r\nct = 0\r\nfor i in range(n):\r\n for j in range(n):\r\n if a[j] == b[i] and i!=j:\r\n a[j] = -1\r\nfor i in range(n):\r\n if a[i] != -1:\r\n ct += 1\r\nprint(ct)", "n=int(input())\r\n \r\nA=[]\r\nB=[]\r\nfor i in range(n):\r\n a,b=map(int,input().strip().split(' '))\r\n A.append(a)\r\n B.append(b)\r\ncount=0\r\n \r\nfor i in range(n):\r\n if A[i] not in B[:i] and A[i] not in B[i+1:]:\r\n count=count+1\r\n \r\n \r\nprint(count)", "l1 = [];l2 = [];l3 = [];n = int(input());ans = n\r\nfor _ in range(n):\r\n a, b = map(int, input().split(\" \"))\r\n l1.append(a);l2.append(b)\r\nfor i in range(n):\r\n # l3.append(i)\r\n if l1[i] in l2[0:i]+l2[i+1:] and i not in l3:\r\n ans -= 1;l3.append(i)\r\n # l3.remove(i)\r\nprint(ans)\r\n", "n = int(input())\na = []\nb = []\nc = [0]*1001\n\nfor i in range(n):\n x, y = list(map(int, input().strip().split()))\n a.append(x)\n b.append(y)\n c[y] += 1\n\ncount = 0\nfor i in range(n):\n c[b[i]] -= 1\n if c[a[i]] == 0:\n count += 1\n c[b[i]] += 1\nprint(count)\n", "n = int(input())\r\nB =[];A=[];c=0\r\nfor i in range(n):\r\n a , b = map(int , input().split())\r\n A.append(a);B.append(b)\r\n \r\nfor i in range(n) :\r\n #x = str(a)+s[i]\r\n if A[i] not in B[:i] and A[i] not in B[i+1:] :\r\n c+=1\r\n \r\n \r\n \r\nprint(c)\r\n", "# http://codeforces.com/problemset/problem/315/A\nn = int(input())\nbottles = [list(map(int, input().split())) for i in range(n)]\nopened = set()\n\nfor i in range(n):\n for j in range(n):\n if i!=j and bottles[i][1] == bottles[j][0]:\n opened.add(j)\nprint(n-len(opened))\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\n############ ---- Input Functions ---- ############\r\ndef inp():\r\n return(int(input()))\r\ndef inlt():\r\n return(list(map(int,input().split())))\r\ndef insr():\r\n s = input()\r\n return(list(s[:len(s) - 1]))\r\ndef invr():\r\n return(map(int,input().split()))\r\n############ ---- Input Functions ---- ############\r\n\r\ndef Sereja_and_Bottles():\r\n n = inp()\r\n a = []\r\n b = []\r\n dict_b_count = {}\r\n\r\n for i in range(n):\r\n ai,bi = invr()\r\n a.append(ai)\r\n b.append(bi)\r\n\r\n if bi not in dict_b_count.keys():\r\n dict_b_count[bi] = 0 \r\n \r\n dict_b_count[bi] += 1 \r\n\r\n unique_bi = list(set(b))\r\n\r\n notOpened = 0\r\n for index,ai in enumerate(a):\r\n if ai in unique_bi:\r\n if dict_b_count[ai] == 1:\r\n if ai == b[index]:\r\n notOpened += 1\r\n else:\r\n notOpened += 1 \r\n \r\n print(notOpened)\r\n return\r\n\r\nSereja_and_Bottles()", "t=int(input())\r\np=[]\r\nq=[]\r\nr=0\r\nfor i in range(t):\r\n a,b=[int(i) for i in input().split()]\r\n p.append(a)\r\n q.append(b)\r\nfor i in range(t):\r\n if p[i] not in q:\r\n r=r+1\r\n elif q.count(p[i])==1 and q.index(p[i])==i:\r\n r=r+1\r\nprint(r)\r\n", "\r\nfrom collections import Counter\r\nn = int(input())\r\ndict = {}\r\nlis = []\r\nsp = {}\r\nfor i in range(n):\r\n a,b = [int(x) for x in input().split()]\r\n lis.append(a)\r\n if a == b:\r\n # if a in c and c[a] > 0:\r\n # dict[a] = 123 # LOL\r\n if b in sp:\r\n dict[b] = 1 \r\n else:\r\n sp[b] = 1\r\n else:\r\n # c[a] = 1\r\n dict[b] = 123 \r\nans = n\r\nc = Counter(lis)\r\nfor item in c:\r\n if item in dict:\r\n ans -= c[item]\r\n elif item in sp:\r\n ans -= c[item] - 1 \r\nprint(ans) \r\n\r\n\r\n", "N = int(input())\r\n\r\ndict_type={}\r\nA = []\r\nB = []\r\nfor _ in range(N):\r\n\ta,b=[int(i) for i in input().split()]\r\n\tA.append(a)\r\n\tB.append(b)\r\ntemp = N\r\nfor i in range(N):\r\n\tfor j in range(N):\r\n\t\tif i!=j:\r\n\t\t\tif A[i]==B[j]:\r\n\t\t\t\ttemp -=1\r\n\t\t\t\tbreak\r\nprint(temp)", "n = int(input())\r\nl, r = [], []\r\nans = 0\r\nfor i in range(n):\r\n a, b = map(int, input().split())\r\n l.append(a)\r\n r.append(b)\r\n \r\nfor i in range(n):\r\n for j in range(n):\r\n if l[i] == r[j] and i != j:\r\n break\r\n else:\r\n ans += 1\r\nprint(ans)\r\n", "from bisect import*\r\nimport sys\r\ninput=sys.stdin.buffer.readline\r\nimport copy\r\n\r\nn=int(input())\r\narr=[]\r\nbrr=[]\r\nwhile n:\r\n\tn-=1\r\n\ta,b=map(int,input().split())\r\n\tarr.append(a)\r\n\tbrr.append(b)\r\nans=0\r\nfor i in range(len(arr)):\r\n\tcrr=copy.deepcopy(brr)\r\n\tcrr.pop(i)\r\n\tif arr[i] in crr:\r\n\t\tans+=1\r\nprint(len(arr)-ans)\r\n", "n=int(input())\nq=[]\nfor i in range(n):\n a,b=list(map(int,input().split(\" \")))\n q.append([a,b])\nans=0\nfor i in range(len(q)):\n c=0\n for j in range(len(q)):\n if(i!=j and q[i][0]==q[j][1]):\n c+=1\n if(c>=1):\n ans+=1\nprint(n-ans)\n\n\n\n\n\n \n\n", "from collections import Counter\r\n\r\n\r\nneed=Counter()\r\nhave=set()\r\nre=set()\r\nn=int(input())\r\nk=0\r\nfor i in range(n):\r\n a,b=input().split()\r\n if a==b and b not in have:\r\n re.add(a)\r\n else:\r\n if b in re:\r\n re.remove(b)\r\n have.add(b)\r\n need[a]+=1\r\nfor i in need:\r\n if i in have:\r\n n-=need[i]\r\n\r\nprint(n+len(re))\r\n", "A=[]\r\nB=[]\r\nn=int(input())\r\nfor i in range(n):\r\n a,b=map(int,input().split())\r\n A.append(a)\r\n B.append(b)\r\ncount=0\r\nfor i in range(n):\r\n for j in range(n):\r\n if A[i]==B[j] and i!=j:\r\n count+=1\r\n break\r\nprint(n-count)", "n = int(input())\r\na, b = [], []\r\ncnt = 0\r\nfor i in range(n):\r\n a1, b1 = input().split()\r\n a1, b1 = int(a1), int(b1)\r\n a.append(a1)\r\n b.append(b1)\r\n\r\nfor i in range(n):\r\n for j in range(n):\r\n if i != j and a[i] == b[j]:\r\n cnt += 1\r\n break\r\n\r\n\r\nprint(n-cnt)", "def main():\n n, aa, bb = int(input()), [], []\n for _ in range(n):\n a, b = input().split()\n aa.append(a)\n bb.append(b)\n print(n - len({i for i, a in enumerate(aa) for j, b in enumerate(bb) if i != j and a == b}))\n\n\nif __name__ == '__main__':\n main()\n", "from collections import defaultdict\r\nimport sys;input=sys.stdin.readline\r\n\r\nG = []\r\nn = int(input())\r\n\r\nbrand = defaultdict(list)\r\ncan_be_opened = set()\r\nfor i in range(n):\r\n a,b = map(int,input().strip().split())\r\n e = (i,a,b)\r\n G.append(e)\r\n brand[a].append(e)\r\n\r\nfor opener in G:\r\n # bottle can open all bottles of brand b except for itself !\r\n for bottle in brand[opener[2]]:\r\n if bottle != opener: can_be_opened.add(bottle)\r\n\r\nprint(n - len(can_be_opened))", "n = int(input())\r\n\r\nleft = []\r\nright = []\r\nfor i in range(n):\r\n a, b = [int(x) for x in input().split()]\r\n left.append(a)\r\n right.append(b)\r\n\r\n\r\ncount = 0\r\nfor i in range(n):\r\n found = False\r\n for j in range(n):\r\n \r\n if left[i] == right[j] and i != j:\r\n # print(left[i], i,j)\r\n found = True\r\n break\r\n if found:\r\n count += 1\r\n\r\n\r\nprint(n-count)", "from collections import defaultdict\n\nn = int(input())\nbottles = defaultdict(int)\nopenable_bottles = set()\nself_openable = defaultdict(int)\n\nfor i in range(n):\n a, b = map(int, input().split())\n bottles[a] += 1\n if a != b:\n openable_bottles.add(b)\n else:\n self_openable[a] += 1\n\nresult = 0\nfor k, v in bottles.items():\n if k not in openable_bottles:\n if k not in self_openable:\n result += v\n else:\n result += 0 if self_openable[k] > 1 else 1\nprint(result)\n", "import sys\r\ninput=sys.stdin.readline\r\n\r\nn=int(input())\r\nc=n\r\n\r\na = [[int(x) for x in input().split()]for i in range(n)]\r\nree = [True for i in range(n)]\r\n\r\nfor i in range(n):\r\n for j in range(n):\r\n if a[i][0] == a[j][1] and i!=j:\r\n ree[i] = False\r\nprint(sum(bool(x) for x in ree))\r\n", "n=int(input())\r\nl=[list(map(int,input().split())) for i in range(n)]\r\nc=0\r\nfor i in range(n):\r\n temp=0\r\n for j in range(n):\r\n if l[i][0]==l[j][1] and i!=j:temp+=1\r\n if temp==0:c+=1\r\nprint(c)\r\n", "\r\n\r\nn = int(input())\r\na = []\r\nb = []\r\nc = [1] * n\r\n\r\nfor i in range(n):\r\n x, y = map(int, input().split())\r\n a.append(x)\r\n b.append(y)\r\n\r\nfor i in range(n):\r\n for j in range(n):\r\n if a[j] == b[i] and i != j:\r\n\r\n c[j] = 0\r\n\r\nprint(sum(c))\r\n'''\r\nn = int(input())\r\nl = []\r\np = set()\r\n\r\nfor i in range(n):\r\n a, b = map(int, input().split())\r\n\r\n if a == b:\r\n l.append(a)\r\n else:\r\n l.append(a)\r\n p.add(b)\r\n\r\nnew_l = [x for x in l if x not in p]\r\nprint(len(new_l)\r\n'''\r\n", "n = int(input())\n\na, b, p = [0] * n, [0] * n, {}\n\nfor i in range(n):\n\n a[i], b[i] = input().split()\n\n p[b[i]] = (a[i] != b[i] or b[i] in p)\n\nprint(sum(not a[i] in p or (p[a[i]] == 0 and a[i] == b[i]) for i in range(n)))", "n = int(input())\r\nstatus = [-1]*n\r\na = [0]*n\r\nb = [0]*n\r\nfor i in range(n):\r\n x,y = map(int,input().split(' '))\r\n a[i] = x\r\n b[i] = y\r\n\r\ncount =0\r\nfor i in range(n):\r\n for j in range(n):\r\n if i!=j and a[i] == b[j]:\r\n count += 1\r\n break\r\nprint (n-count)", "n=int(input())\r\ncount=0\r\nrack1=[]\r\nrack2=[]\r\nfrom collections import Counter\r\nfor _ in range(n):\r\n x,y=map(int,input().split())\r\n rack1.append(x)\r\n rack2.append(y)\r\nhmap=dict(Counter(rack2))\r\n\r\nfor i in range(n):\r\n if rack1[i] not in rack2:\r\n count+=1\r\n else:\r\n if rack1[i]==rack2[i] and hmap[rack1[i]]==1:\r\n count+=1\r\nprint(count) ", "n=int(input())\r\nl=[]\r\nfor i in range(n):l.append(list(map(int, input().split())))\r\nres=0\r\nfor i in range(n):\r\n valid=0\r\n for j in range(n):\r\n if l[j][1]==l[i][0]and i!=j:valid=1\r\n res+=1-valid\r\nprint(res)", "ll= lambda : list(map(int,input().split()))\r\ntestcases=1\r\n# testcases=int(input())\r\nfor testcase in range(testcases):\r\n\t[n]=ll()\r\n\td=[]\r\n\topener = [0]*1001\r\n\tfor i in range(n):\r\n\t\tx=ll()\r\n\t\topener[x[1]]+=1\r\n\t\td.append(x)\r\n\tc=0\r\n\tfor i in range(n):\r\n\t\topener[d[i][1]]-=1\r\n\t\tif opener[d[i][0]]>0:\r\n\t\t\tc+=1\r\n\t\topener[d[i][1]]+=1\r\n\tprint(n-c)\r\n\r\n", "i=int(input())\r\nA=[]\r\nB=[]\r\nfor x in range(i):\r\n a,b=map(int,input().split())\r\n A.append(a)\r\n B.append(b)\r\nc=0\r\nfor x in range(len(A)):\r\n flag=False\r\n for y in range(len(B)):\r\n if x!=y and A[x]==B[y]:\r\n flag=True\r\n if not flag:\r\n c+=1\r\nprint(c)\r\n\r\n\r\n", "# https://codeforces.com/problemset/problem/315/A\r\n\r\n\"\"\"\r\nn soda bottles but no bottle opener.\r\n\r\nThe ith bottle has brand i and you can use it to open bottles of brand b_i\r\nYou can use one bottle to open multiple bottles.\r\n\r\nJust need to check that for every a_i there is a b_i to open with\r\n\"\"\"\r\nfrom collections import Counter\r\n\r\nn = int(input())\r\na, b = [], []\r\n\r\nfor i in range(n):\r\n a_i, b_i = map(int, input().split())\r\n a.append(a_i)\r\n b.append(b_i)\r\n\r\n\r\ndef check(i):\r\n for j in range(n):\r\n if j != i and b[j] == a[i]:\r\n return True\r\n\r\n return False\r\n\r\n\r\nunopened = 0\r\nfor i in range(n):\r\n if not check(i):\r\n unopened += 1\r\n\r\nprint(unopened)\r\n", "n=int(input())\r\nb=[]\r\nc=[]\r\nfor _ in range(n):\r\n x,y=map(int,input().split())\r\n b.append(x)\r\n c.append(y)\r\nres=0\r\nfor i in range(n):\r\n if(b[i] in c[:i] or b[i] in c[i+1:]):\r\n res+=1\r\nprint(n-res)", "n=int(input())\r\na=[]\r\nb=[]\r\nfor i in range(0,n):\r\n s=input().split()\r\n a.append(int(s[0]))\r\n b.append(int(s[1]))\r\nfor i in range(0,n):\r\n for j in range(0,n):\r\n if(i!=j and b[j]==a[i]):\r\n a[i]=0\r\n\r\nprint(n-a.count(0))", "import sys \r\ninput = sys.stdin.readline \r\n\r\nn = int(input())\r\nl = []\r\nfor i in range(n):\r\n l.append(list(map(int, input().split())))\r\n \r\nc = 0 \r\nfor i in range(n):\r\n for j in range(n):\r\n if(l[i][0] == l[j][1] and i != j):\r\n break \r\n else:\r\n c += 1 \r\nprint(c)", "from math import floor\r\ndef main():\r\n z = []\r\n bottles = []\r\n for i in range(int(input())):\r\n x, y = map(int, input().split())\r\n bottles.append((x, i))\r\n z.append((y, i))\r\n for j in range(len(z)):\r\n k = 0\r\n for f in range(len(bottles)):\r\n f-=k\r\n if z[j][0] == bottles[f][0] and z[j][1] != bottles[f][1]:\r\n bottles.pop(f)\r\n k += 1\r\n print(len(bottles))\r\n\r\n\r\nif __name__ == '__main__':\r\n main()", "n = int(input())\r\na = [0]*n;b = [0]*n;c = [0]*1001\r\nfor i in range(n):\r\n a[i],b[i] = map(int, input().split())\r\n c[b[i]] += 1\r\ncount = 0\r\nfor i in range(n):\r\n c[b[i]] -= 1\r\n if c[a[i]] == 0:\r\n count += 1\r\n c[b[i]] += 1\r\nprint(count)\r\n", "n=int(input())\r\na=[0]*n\r\nb=[0]*n\r\ns=[0]*n\r\nans=0\r\nfor i in range(n):\r\n a[i],b[i]=map(int,input().split())\r\nfor p in range(n):\r\n for j in range(n):\r\n if p!=j and a[j]==b[p]:\r\n if s[j]==0:\r\n s[j]=1\r\nfor t in range(n):\r\n ans+=s[t]\r\nprint(n-ans)", "n=int(input())\r\na=[]\r\nb=[]\r\ncount=0\r\n\r\nfor i in range(n):\r\n\tx,y=map(int,input().split())\r\n\ta.append(x)\r\n\tb.append(y)\r\n\r\ndct=[False for x in a]\r\n\r\nfor i in range(n):\r\n\tfor j in range(n):\r\n\t\tif j!=i and b[j]==a[i]:\r\n\t\t\tdct[i]=True\r\n\r\nfor num in dct:\r\n\tif not num:\r\n\t\tcount+=1\r\n\r\nprint(count)", "n = int(input())\r\nl1=[]\r\nl=[]\r\nc=0\r\nfor _ in range(n):\r\n a,b = map(int,input().split())\r\n l1.append(a)\r\n l.append(b)\r\nfor i in range(len(l1)):\r\n if l1[i] not in l[:i] and l1[i] not in l[i+1:]:\r\n c+=1\r\nprint(c)", "def solve(n, brand, can_open):\r\n impossible_bottles = 0\r\n\r\n for i in range(n):\r\n openable = False\r\n \r\n for j in range(n):\r\n if can_open[j] == brand[i] and i!=j:\r\n openable = True\r\n \r\n impossible_bottles += (not openable)\r\n\r\n print(impossible_bottles)\r\n\r\nif __name__ == \"__main__\":\r\n n = int(input())\r\n brand, can_open = [], []\r\n\r\n for _ in range(n):\r\n a, b = map(int, input().split(\" \"))\r\n brand.append(a)\r\n can_open.append(b)\r\n\r\n solve(n, brand, can_open)", "n = int(input())\r\narr = []\r\nfor i in range(n):\r\n arr.append(list(map(int, input().split())))\r\nres = 0\r\nfor i in range(n):\r\n valid = 0\r\n for j in range(n):\r\n if arr[j][1] == arr[i][0] and i != j:\r\n valid = 1\r\n res += 1 - valid\r\nprint(res)\r\n", "from collections import defaultdict\r\nn = int(input())\r\na = []\r\nb = []\r\nfor _ in range(n):\r\n x,y = map(int,input().split())\r\n a.append(x)\r\n b.append(y)\r\n\r\ns = set()\r\nfor i in range(n):\r\n for j in range(n):\r\n if b[j]==a[i] and i!=j:\r\n s.add(i)\r\nprint(n-len(s))\r\n\r\n", "def solution():\r\n\tn=int(input())\r\n\ta,b=[],[]\r\n\r\n\tfor i in range(n):\r\n\t\tx,y=map(int,input().split())\r\n\t\ta.append(x)\r\n\t\tb.append(y)\r\n\tans=0\r\n\tfor i in range(n):\r\n\t\tfor j in range(n):\r\n\t\t\tif a[i]==b[j] and i!=j:\r\n\t\t\t\tans+=1\r\n\t\t\t\tbreak\r\n\r\n\r\n\r\n\t\t\r\n\tprint(n-ans)\r\n\r\n\r\n\t\r\n\treturn\r\n\r\n\r\n\r\n\t\r\nsolution()\r\n\r\n\t", "n = int(input())\r\na =[]\r\nfor _ in range(n):\r\n x,y = [int(x) for x in input().split()]\r\n a.append((x,y))\r\n\r\nopenable=0\r\nfor x,(i,j) in enumerate(a):\r\n for y,(l,m) in enumerate(a):\r\n if i==m and x!=y:\r\n openable+=1\r\n break\r\nprint(n-openable)\r\n", "from sys import stdin\r\nfrom collections import defaultdict\r\nn = int(stdin.readline().rstrip())\r\nrem_indices = set()\r\na_indices = defaultdict(list)\r\nbottles = []\r\n\r\nfor i in range(n):\r\n bottles.append(list(map(int, stdin.readline().rstrip().split(' '))))\r\n a, b = bottles[-1]\r\n a_indices[a].append(i)\r\n \r\nfor (i, (a, b)) in enumerate(bottles):\r\n for a_s in a_indices[b]:\r\n if a_s not in rem_indices and a_s != i:\r\n n -= 1; rem_indices.add(a_s)\r\n\r\nprint(n)", "t=int(input())\r\nc=0\r\nlst=[]\r\nlst2=[]\r\nwhile t:\r\n t-=1\r\n a,b=map(int,input().split())\r\n lst.append(a)\r\n lst2.append(b)\r\nfor i in range(len(lst)):\r\n if lst[i] not in lst2[i+1:] and lst[i] not in lst2[:i]:\r\n c+=1\r\nprint(c)", "n = int(input())\r\na = []\r\nb = []\r\nfor i in range(n):\r\n n1,n2 = map(int,input().split())\r\n a.append(n1)\r\n b.append(n2)\r\nk = 0\r\nfor i in range(n):\r\n for j in range(n):\r\n if b[j]==a[i] and j!=i:\r\n k = k + 1\r\n break\r\n\r\nprint(n-k)", "n = int(input())\nbs = []\nfor _ in range(n):\n bs.append(list(map(int, input().split())))\n\nans = 0\nfor i in range(n):\n for j in range(n):\n if i != j and bs[i][0] == bs[j][1]:\n ans += 1\n break\n\nprint(n - ans)\n", "n = int(input())\nu = []\nv = []\nfor i in range(n):\n temp = input().split(\" \")\n u.append(int(temp[0]))\n v.append(int(temp[1]))\n\ncount = 0\nfor i in range(n):\n if( (u[i] not in v[:i]) and (u[i] not in v[i+1:]) ):\n count+=1\nprint(count)", "n = int(input())\r\n\r\na = []\r\n\r\nfor _ in range(n):\r\n a.append(list(map(int,input().split())))\r\n\r\nremoved = set()\r\nres = n\r\nfor i in range(n):\r\n for j in range(n):\r\n if a[i][1]==a[j][0] and i!=j and j not in removed:\r\n removed.add(j)\r\n res-=1\r\n\r\nprint(res)", "'''\r\nINPUT SHORTCUTS\r\nN, K = map(int,input().split())\r\nN ,A,B = map(int,input().split())\r\nstring = str(input())\r\narr = list(map(int,input().split()))\r\nN = int(input())\r\n'''\r\n \r\nN = int(input())\r\nbottles = set()\r\narr = []\r\narr2 = []\r\nfor i in range(N):\r\n\tindex , b = map(int,input().split())\r\n\tarr.append(index)\r\n\tarr2.append(b)\r\ncnt = 0\r\nfor i in range(N):\r\n\tfor j in range(N):\r\n\t\tif arr[i]==arr2[j] and i!=j:\r\n\t\t\tcnt+=1\r\n\t\t\tbreak\r\nprint(N-cnt)\r\n", "n=int(input())\r\narr=[None]\r\nfor i in range(n):\r\n a,b=[int(x) for x in input().split()]\r\n ans=[i,a,b]\r\n arr.append(ans)\r\nresult=0\r\nans=[False for x in range(n+1)]\r\nfor i in range(1,n+1):\r\n for j in range(1,n+1):\r\n if j!=i:\r\n if arr[i][1]==arr[j][2]:\r\n ans[i]=True\r\n break\r\n\r\nfor i in range(1,n+1):\r\n if ans[i]==False:\r\n result+=1\r\n\r\nprint(result)\r\n", "n=int(input())\r\nab=[list(map(int,input().split())) for _ in range(n)]\r\ncount=0\r\na=[]\r\nb=[]\r\nfor i in ab:\r\n a.append(i[0])\r\n b.append(i[1])\r\nfor i,j in enumerate(a):\r\n x=b[:i]+b[i+1:]\r\n if j in x:\r\n count+=1\r\nac_co=n-count\r\nprint(ac_co) ", "n=int(input())\r\na=[eval(input().replace(' ',',')) for i in range(n)]\r\nout=n\r\nfor i,ai in enumerate(a):\r\n if (ai[0] in [a[j][1] for j in range(n) if j!=i]):\r\n out -= 1\r\nprint(out)\r\n\r\n", "n = int(input())\r\ns1, s2 = [], []\r\nfor i in range(n):\r\n a, b = map(int, input().split())\r\n s1 += [a]\r\n s2 += [b]\r\nc = 0\r\nfor i in range(n):\r\n for j in range(n):\r\n\r\n if s1[i] == s2[j] and i != j:\r\n c += 1\r\n break\r\n\r\nprint(n - c)\r\n", "n = int(input())\nx = []\ny = []\nt = [1]*n\nfor _ in range(n):\n a, b = map(int, input().split())\n x.append(a)\n y.append(b)\nfor i in range(n):\n for j in range(n):\n if x[i] == y[j] and i != j:\n t[i] = 0\nprint(sum(t))", "n = int(input())\r\na = []\r\nb = []\r\nfor i in range(n):\r\n ap, bp = map(int, input().split())\r\n a.append(ap)\r\n b.append(bp)\r\n \r\nok = [False] * n\r\nfor i in range(n):\r\n for j in range(n):\r\n if b[i] == a[j] and i != j:\r\n ok[j] = True\r\n \r\nprint(ok.count(False))", "l,l2,l3=[],[],[]\r\nfor i in range(int(input())):\r\n x,y=map(int,input().split())\r\n l.append(x)\r\n l2.append(y)\r\n l3.append(1)\r\nfor i in range(len(l)):\r\n for j in range(len(l2)):\r\n if l2[i]==l[j] and i!=j:\r\n l3[j]=0\r\nprint(sum(l3))", "n = int(input())\n\nlst = []\nfor i in range(n):\n (a, b) = map(int, input().split(' '))\n lst.append((a, b))\n\nret = 0\nfor i in range(n):\n (a, b) = lst[i]\n for j in range(n):\n if i == j:\n continue\n (aa, bb) = lst[j]\n if (bb == a):\n ret += 1\n break\n\nprint(n - ret)\n", "n = int(input())\r\na = [0] * n\r\nb = [0] * n\r\nm = set()\r\nfor i in range(n):\r\n a[i], b[i] = map(int, input().split())\r\n \r\nfor i in range(n): # берём бутылку i\r\n for j in range(n): # пробуем открыть бут. j\r\n if b[i] == a[j] and i != j:\r\n m.add(j)\r\n \r\n'''\r\n10 20\r\n20 30\r\n'''\r\n \r\nprint(n - len(m))\r\n\r\n\r\n\r\n\r\n# i in range(3): 0, 1, 2\r\n# 0 1 2\r\n# [10, 20, 30]\r\n# ^\r\n# [10, 30]\r\n# 0 \r\n\r\n'''\r\n10 10 -- бутылка 1, можно открыть бутылкой 2\r\n10 10 -- бутылка 2, можно открыть бутылкой 1\r\n10 10\r\n20 20\r\n30 30\r\n'''\r\n", "n=int(input())\r\na1=[]\r\nb1=[]\r\nfor i in range(n):\r\n a,b=map(int,input().split())\r\n a1.append(a)\r\n b1.append(b)\r\ncount=n\r\nfor i in range(len(a1)):\r\n for j in range(len(b1)):\r\n if a1[i]==b1[j] and i!=j:\r\n count-=1\r\n break\r\nprint(count)\r\n \r\n \r\n ", "#python3\r\nimport sys, threading, os.path\r\nimport collections, heapq, math,bisect\r\nimport string\r\nfrom platform import python_version\r\nimport itertools\r\nsys.setrecursionlimit(10**6)\r\nthreading.stack_size(2**27) \r\n\r\ndef main():\r\n if os.path.exists('input.txt'):\r\n input = open('input.txt', 'r')\r\n else:\r\n input = sys.stdin\r\n #--------------------------------INPUT---------------------------------\r\n n = int(input.readline())\r\n lis2 = []\r\n for i in range(n):\r\n lis = list(map(int, input.readline().split()))\r\n lis2.append([lis[0],lis[1],False])\r\n for i in range(n):\r\n for j in range(n):\r\n if i == j:\r\n continue\r\n if lis2[j][0]==lis2[i][1]:\r\n lis2[j][2]=True\r\n count = 0\r\n for x in lis2:\r\n if x[2]==False:\r\n count+=1\r\n output = count\r\n #-------------------------------OUTPUT----------------------------------\r\n if os.path.exists('output.txt'):\r\n open('output.txt', 'w').writelines(str(output))\r\n else:\r\n sys.stdout.write(str(output))\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n#threading.Thread(target=main).start()", "n = int(input())\nA = []\n\nfor i in range(n):\n A.append(list(map(int, input().split())))\nres = 0\n\nfor i in range(n):\n flag = 0\n\n for j in range(n):\n if A[j][1] == A[i][0] and i != j:\n flag = 1\n res += 1 - flag\nprint(res)\n", "n = int(input())\r\n\r\na = []\r\nb = []\r\nfor i in range(n):\r\n ai, bi = map(int, input().split())\r\n a.append(ai)\r\n b.append(bi)\r\n \r\nisOpen = [False] * n\r\nfor i in range(n):\r\n for j in range(n):\r\n if b[i] == a[j] and i != j:\r\n isOpen[j] = True\r\n \r\nprint(isOpen.count(False))", "n=int(input())\r\nbottle=[]\r\nfor i in range(n):\r\n a,b=map(int,input().split())\r\n bottle.append([a,b])\r\ns=0\r\nfor i in range(n):\r\n for j in range(n):\r\n if bottle[i][0]==bottle[j][1] and i!=j:\r\n break\r\n else:\r\n s+=1\r\nprint(s)", "n=int(input())\r\nL=[]\r\nfor i in range(n):\r\n l=list(input().split())\r\n for j in range(2): l[j]=int(l[j])\r\n L.append(l)\r\nans=0\r\nfor i in range(n):\r\n exist=False\r\n for j in range(n):\r\n if L[i][0]==L[j][1] and i!=j:\r\n exist=True\r\n break\r\n if not(exist): ans+=1\r\nprint(ans)", "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=int(input())\r\n arr=[]\r\n for _ in range(n):\r\n x,y=map(int,input().split())\r\n arr.append([x,y,False])\r\n \r\n for i in range(n):\r\n op=arr[i][1]\r\n for j in range(n):\r\n if i!=j and arr[j][0]==op:\r\n arr[j][2]=True\r\n count=0\r\n for a in arr:\r\n if a[2]==False:\r\n count+=1\r\n print(count)\r\n\r\n\r\nmain()\r\n ", "n = int(input())\r\na = []\r\nb = []\r\nfor i in range(n):\r\n a_i, b_i = map(int,input().split(\" \"))\r\n a.append(a_i)\r\n b.append(b_i)\r\n\r\ntotal = 0\r\nfor i, bottle in enumerate(a):\r\n bottles_available = [bs for j,bs in enumerate(b) if j != i ]\r\n if not bottle in bottles_available:\r\n total += 1\r\nprint(total)\r\n", "n = int(input())\r\n\r\na, b = [], []\r\nfor _ in range(n):\r\n x, y = (int(i) for i in input().split())\r\n a.append(x)\r\n b.append(y)\r\n\r\ncount = 0\r\nfor i in range(n):\r\n found = False\r\n for j in range(n):\r\n if b[j] == a[i] and i != j:\r\n found = True\r\n break\r\n if not found:\r\n count += 1\r\n\r\nprint(count)", "n=int(input())\r\na=[]\r\nb=[]\r\ns=[0]*n\r\nfor i in ' '*n:\r\n x,y=map(int,input().split())\r\n a.append(x)\r\n b.append(y)\r\nfor i in range(n):\r\n for j in range(n):\r\n if a[j]==b[i] and i!=j:\r\n s[j]=1\r\nprint(n-sum(s))", "import sys\r\ninput = lambda: sys.stdin.readline().strip(\"\\r\\n\")\r\n\r\nn = int(input())\r\na = []\r\nb = []\r\nfor i in range(n):\r\n x, y = map(int, input().split())\r\n a.append(x)\r\n b.append(y)\r\nans = n\r\nfor i in range(n):\r\n for j in range(n):\r\n if a[i] == b[j] and i != j:\r\n ans -= 1\r\n break\r\n\r\nprint(ans)\r\n", "n = int(input())\r\ncount = 0\r\na = []\r\nb = []\r\nfor i in range(n):\r\n x, y = map(int, input().split())\r\n a.append(x)\r\n b.append(y)\r\nv = b.copy()\r\nfor i in range(n):\r\n del v[i]\r\n if not a[i] in v:\r\n count += 1\r\n v = b.copy()\r\nprint(count) \r\n", "def chc(l,i,k):\r\n\tfor j in range(len(l)):\r\n\t\tif k==l[j] and j!=i:return 1\r\n\treturn 0\r\n\r\nn=int(input());b,o=[],[];c=0\r\nfor i in range(n):\r\n\tl,r=map(int,input().split())\r\n\tb.append(l);o.append(r)\r\nfor i in range(n):\r\n\tif chc(o,i,b[i]):c+=1\r\nprint(n-c)", "for pratyush in range(1):\r\n\tn=int(input())\r\n\tp,ans,la,lb=set(),0,[],[]\r\n\tfor i in range(n):\r\n\t\ta,b=list(map(int,input().split()))\r\n\t\tla.append(a)\r\n\t\tlb.append(b)\r\n\tfor i in range(n):\r\n\t\tf=0\r\n\t\tfor j in range(n):\r\n\t\t\tif i!=j and la[i]==lb[j]:\r\n\t\t\t\tf=1\r\n\t\t\t\tbreak\r\n\t\tif not f: ans+=1\r\n\tprint(ans)", "n=int(input())\r\na,b=zip(*[map(int, input().split()) for _ in range(n)])\r\n\r\nprint(sum([b.count(a[i])<=(a[i]==b[i]) for i in range(n)]))\r\n", "#Problem Set D: Collaborated with no one\n\nn = int(input())\nsize = n+1\nbottle_num = [0]*size\n\n\nleft_arr = []\nright_arr = []\n\nfor i in range(n):\n ab_list = list(map(int, input().split()))\n\n if len(left_arr) == 0:\n left_arr.append(0)\n \n if len(right_arr) == 0:\n right_arr.append(0)\n \n left_arr.append(ab_list[0])\n right_arr.append(ab_list[1])\n\n\nfor j in range(1,n+1):\n for k in range(1,n+1):\n if (j != k) and (left_arr[j] == right_arr[k]):\n bottle_num[j] = 1\n\n\ntotal = 0\nfor i in range(1,n+1):\n total += bottle_num[i]\n \nprint(n-total)\n \t\t \t \t \t\t\t\t \t \t \t\t\t\t\t", "from collections import Counter\nn=int(input())\n\narr=[]\nopenable=0\nfor i in range(n):\n arr.append(tuple(map(int,input().split())))\nfor i in range(n):\n for j in range(n):\n if j==i:\n continue\n if arr[j][1]==arr[i][0]:\n openable+=1\n break\nprint(n-openable)", "n=int(input())\r\nla,lb=[],[]\r\nfor _ in range(n):\r\n a,b=map(int,input().split())\r\n la.append(a)\r\n lb.append(b)\r\nres=0\r\nfor i in range(n):\r\n temp=la[i]\r\n if lb.count(temp)>1:\r\n res+=1\r\n elif lb.count(temp)==1 and lb.index(temp)!=i:\r\n res+=1\r\nprint(n-res)", "n = int(input())\r\na = []\r\nb = []\r\nfor i in range(n):\r\n\tx,y = map(int, input().split())\r\n\ta.append(x)\r\n\tb.append(y)\r\nans = 0\r\nopened = set()\r\nfor i in range(n):\r\n\tfor j in range(n):\r\n\t\tif a[i] == b[j] and i!=j:\r\n\t\t\tans += 1\r\n\t\t\tbreak\r\nprint(len(a)-ans)", "n=int(input())\r\nl=[]\r\nfor i in range(n) :\r\n a,b=map(int,input().split())\r\n l.append([a,b])\r\no=0\r\ncha=[0]*1001\r\nchb=[0]*1001\r\nfor i in l :\r\n cha[i[0]]+=1\r\n if i[1]!=\"e\" :\r\n chb[i[1]]+=1\r\nfor i in range(0,len(l)) :\r\n if l[i][1]==l[i][0] :\r\n if chb[l[i][1]]!=0 and chb[l[i][0]]==1 :\r\n o+=1\r\n else :\r\n if chb[l[i][1]]!=0 and chb[l[i][0]]==0 :\r\n o+=1\r\nprint(o)", "n = int(input())\r\narr = []\r\nbrr = []\r\nans = 0\r\nfor i in range(n):\r\n a,b = map(int, input().split())\r\n arr.append(a)\r\n brr.append(b)\r\n\r\n\r\nfor i in range(n):\r\n flag = 0\r\n for j in range(i):\r\n if brr[j]==arr[i]:\r\n flag = 1\r\n break\r\n if flag!=1:\r\n for k in range(i+1,n):\r\n if brr[k]==arr[i]:\r\n flag = 1\r\n break\r\n if flag==0:\r\n ans+=1\r\nprint(ans)\r\n", "n = int(input())\r\na = []\r\nb = []\r\nfor i in range(n):\r\n li = list(map(int, input().split()))\r\n a.append(li[0])\r\n b.append(li[1])\r\n\r\ncount = 0\r\n\r\nfor idx1 in range(len(a)):\r\n flag = False\r\n for idx2 in range(len(b)):\r\n if idx1 != idx2 and a[idx1] == b[idx2]:\r\n flag = True\r\n if not flag:\r\n count+=1\r\n \r\nprint(count)", "n = int(input())\nopened = 0\nA = {}\nB = {}\nfor _ in range(n):\n a, b = map(int, input().split())\n A[_] = a\n B[_] = b\nfor i in range(n):\n if A[i] in B.values():\n idx = [k for k, v in B.items() if v == A[i]]\n for x in idx:\n if x != i:\n opened += 1\n break\nprint(n - opened)\n", "a = int(input())\r\nbad = []\r\nfor i in range(a):\r\n x, y = map(int, input().split(' '))\r\n bad.append([x, y, 0])\r\n\r\nfor i in range(a):\r\n for j in range(a):\r\n if i != j:\r\n if bad[j][1] == bad[i][0]:\r\n bad[i][2] = 1\r\n\r\nct = 0 \r\nfor i in bad:\r\n if i[2] == 1:\r\n ct += 1\r\n\r\nprint(a - ct)\r\n", "# http://codeforces.com/problemset/problem/315/A\r\nget=lambda:list(map(int,input().split()))\r\n\r\nn=int(input())\r\na=[]\r\nb=[]\r\nfor i in range (n):\r\n x,y=get()\r\n a.append(x)\r\n b.append(y)\r\nd=n\r\nfor i in range(n):\r\n for j in range(n):\r\n if a[i]==b[j] and i!=j:\r\n d-=1\r\n break\r\n \r\n \r\nprint(d)\r\n \r\n\r\n", "n=int(input())\r\na=[]\r\nb=[]\r\ncnt=0\r\ncarry=dict()\r\nfor i in range(n):\r\n ai,bi=[int(x) for x in input().split()]\r\n a.append(ai)\r\n b.append(bi)\r\n if bi in carry.keys():\r\n carry[bi]+=1\r\n else:\r\n carry[bi]=1\r\nfor i in range(n):\r\n carry[b[i]]-=1\r\n if(a[i] not in carry.keys() or carry[a[i]]==0):\r\n cnt+=1\r\n carry[b[i]]+=1\r\nprint(cnt)", "n = int(input())\r\na=[]\r\nb=[]\r\nt=[1]*n\r\nfor _ in range(n):\r\n x,y = map(int, input().split())\r\n a.append(x)\r\n b.append(y)\r\nfor i in range(n):\r\n for j in range(n):\r\n if a[i] == b[j] and i!=j:\r\n t[i] = 0\r\nprint(sum(t))\r\n ", "n = int(input())\r\nbrand = [0] * n\r\nopen = [0] * n\r\nfor i in range(n):\r\n brand[i], open[i] = map(int, input().split())\r\n\r\nopened = [False] * n\r\n\r\nres = n\r\nfor i in range(n):\r\n for j in range(n):\r\n if i == j:\r\n continue\r\n if not opened[j] and brand[j] == open[i]:\r\n opened[j] = True\r\n res -= 1\r\nprint(res)", "from collections import defaultdict\nn=int(input())\nisOpened=defaultdict(bool)\ncount=defaultdict(int)\nwhoCanWe=defaultdict(list)\nfor _ in range(n):\n\ta,b=list(map(int,input().split()))\n\tcount[a]+=1\n\tisOpened[a]=False#[opened? , total , who can we open?]\n\twhoCanWe[a].append(b)\nopend=0\nflag=0\nfor i in whoCanWe:\n\tfor j in whoCanWe[i]:\n\t\tif i!=j:\n\t\t\tif count[j]:\n\t\t\t\topend+=count[j]\n\t\t\t\tcount[j]=0\n\t\t\t\tisOpened[j]=True\n\t\telif i==j and count[i]>1:\n\t\t\topend+=count[j]-1\n\t\t\tcount[j]=1\n\t\t\tflag=1\n\n\t\telif i==j and count[i]==1:\n\t\t\tif flag==1:\n\t\t\t\tflag=0\n\t\t\t\tcount[j]=0\n\t\t\t\topend+=1\n\n\nprint(n-opend)\n\n\n\n\n", "n = int(input())\r\na = []\r\nb = []\r\nfor i in range(n):\r\n aa, bb = map(int, input().split())\r\n a.append(aa)\r\n b.append(bb)\r\nfor i in range(n):\r\n for j in range(n):\r\n if i == j:\r\n continue\r\n if a[j] == b[i]:\r\n a[j] = -1\r\ncount = 0\r\nfor i in range(n):\r\n if a[i] != -1:\r\n count += 1\r\nprint(count)\r\n", "import sys\r\ninput = sys.stdin.readline\r\ndef getstr(): return input().rstrip('\\r\\n')\r\ndef getint(): return int(input().strip())\r\ndef getints(): return list(map(int, input().strip().split()))\r\ndef impossible(): print(-1),exit(0)\r\n \r\nn = getint() \r\narr = []\r\nfor i in range(n):\r\n arr.append(getints())\r\n\r\nopeners = dict()\r\nfor bottle, opener in arr:\r\n if opener in openers:\r\n openers[opener]+=1\r\n else:\r\n openers[opener]=1\r\n\r\ncount = 0\r\nfor a,b in arr:\r\n if a==b and openers[a]==1:\r\n count+=1\r\n elif a not in openers:\r\n count+=1\r\nprint(count)", "n = int(input())\r\na = [0] * n\r\nb = [0] * n\r\nans = 0\r\nfor i in range(n):\r\n a[i], b[i] = map(int, input().split())\r\nfor i in range(n):\r\n for j in range(n):\r\n if i != j and b[j] == a[i]:\r\n break\r\n else:\r\n ans += 1\r\nprint(ans)", "n=int(input())\r\nx=[]\r\nfor i in range(n):\r\n a,b=map(int,input().split())\r\n x.append([a,b])\r\nfor i in range(n):\r\n for j in range(n):\r\n if x[j][0]==x[i][1] and i!=j:\r\n x[j][0]=-1\r\nc=0\r\nfor i in x:\r\n if i[0]!=-1:\r\n c+=1\r\nprint(c)", "from collections import defaultdict\n\ndef serej(bottles):\n #set of bottles that need to be opened\n\n unopened = defaultdict(set)\n\n for i, bottle in enumerate(bottles):\n unopened[bottle[0]].add(i+1)\n\n for i, bottle in enumerate(bottles):\n if bottle[1] in unopened:\n unopened[bottle[1]] = unopened[bottle[1]].intersection({i+1})\n\n return sum(len(x) for x in unopened.values())\n\nn = int(input())\n\nbottles = []\nfor _ in range(n):\n bottles.append([int(x) for x in input().split(' ')])\n\nprint(serej(bottles))\n", "# cook your dish here\r\nt=int(input())\r\na=list()\r\nb=list()\r\nfor i in range(t):\r\n c=list(map(int,input().strip().split(' ')))\r\n a.append(c[0])\r\n b.append(c[1])\r\nflag=0\r\ncount=0\r\nfor i in range(t):\r\n for j in range(t):\r\n if a[i]==b[j] and i!=j:\r\n flag=1\r\n break\r\n if flag==0 : count+=1\r\n flag=0\r\nprint(count)", "n=int(input())\r\ncount=0\r\na=[0]*n\r\nb=[0]*n\r\nfor i in range(n):\r\n a[i],b[i]=map(int, input().split())\r\nfor i in range(n):\r\n for j in range(n):\r\n if a[i]==b[j] and j!=i:\r\n count+=1\r\n break\r\nprint(n-count)", "from collections import defaultdict as ddict\n\nN = int(input())\ncount = ddict(int)\nbottles = []\nfor i in range(N):\n ai, bi = map(int, input().split())\n count[bi] += 1\n bottles.append((ai, bi))\n\nres = 0\nfor ai, bi in bottles:\n if count[ai] == 0 or (count[ai]==1 and bi==ai):\n res += 1\nprint(res)", "# Input\r\nn = int(input())\r\nbottles = []\r\n\r\nfor _ in range(n):\r\n ai, bi = map(int, input().split())\r\n bottles.append((ai, bi))\r\n\r\n# Count the number of bottles that can't be opened\r\ncant_open = 0\r\n\r\nfor i in range(n):\r\n can_open = False\r\n for j in range(n):\r\n if i != j and bottles[i][0] == bottles[j][1]:\r\n can_open = True\r\n break\r\n if not can_open:\r\n cant_open += 1\r\n\r\n# Output\r\nprint(cant_open)\r\n", "n = int(input())\r\narr = []\r\nfor _ in range(n):\r\n a, b = map(int, input().split())\r\n arr.append([a, b])\r\n\r\nans = 0\r\nfor i in range(n):\r\n can_be_opened = False\r\n for j in range(n):\r\n if i != j:\r\n if arr[i][0] == arr[j][1]:\r\n can_be_opened = True\r\n \r\n if not can_be_opened:\r\n ans += 1\r\n \r\nprint(ans)# 1691239964.4478862", "n=int(input())\r\nbrand,opener=[],[]\r\nfor i in range(n):\r\n a,b=map(int,input().split())\r\n brand.append(a)\r\n opener.append(b)\r\n\r\ncount=0\r\nfor i in range(n):\r\n for j in range(n):\r\n if brand[i]==opener[j] and i!=j:\r\n break\r\n else:\r\n count+=1\r\n\r\nprint(count)", "from sys import stdin\r\ninput = stdin.readline\r\nfrom heapq import heapify,heappush,heappop,heappushpop\r\nfrom collections import defaultdict as dd, deque as dq,Counter as C\r\nfrom math import factorial as f ,ceil,gcd,sqrt,log\r\nfrom bisect import bisect_left as bl ,bisect_right as br\r\nfrom itertools import combinations as c,permutations as p\r\nfrom math import factorial as f ,ceil,gcd,sqrt,log\r\nmi = lambda : map(int,input().split())\r\nii = lambda: int(input())\r\nli = lambda : list(map(int,input().split()))\r\nmati = lambda r : [ li() for _ in range(r)]\r\nlcm = lambda a,b : (a*b)//gcd(a,b) \r\n\r\n\r\n\r\n\r\ndef solve():\r\n n=ii()\r\n arr1=[]\r\n arr2=[]\r\n for x in range(n):\r\n a,b=mi()\r\n arr1.append(a)\r\n arr2.append(b)\r\n ans=0\r\n for x in range(len(arr1)):\r\n if arr1[x] not in arr2[:x] and arr1[x] not in arr2[x+1:]:\r\n ans+=1\r\n print(ans)\r\nfor _ in range(1):\r\n solve()", "from collections import Counter\r\nn = int(input())\r\na, b = [], []\r\nfor i in range(n):\r\n x, y =map(int, input().split())\r\n a.append(x)\r\n b.append(y)\r\ncheck = [1]*n\r\nfor i in range(n):\r\n for j in range(n):\r\n if a[j] == b[i] and i!=j:\r\n check[j] = 0\r\nprint(sum(check))", "n = int(input())\r\narr = [False] * n\r\ndes = []\r\nfor i in range(n):\r\n a,b = map(int, input().split())\r\n des.append([a,b,False])\r\nfor i in range(n):\r\n open = des[i][1]\r\n for j in range(n):\r\n if(j != i):\r\n if(des[j][0] == open):\r\n des[j][2] = True\r\ncount = 0\r\nfor i in des:\r\n if not(i[2]):\r\n count += 1\r\nprint(count)\r\n", "from sys import stdin\r\nn = int(stdin.readline())\r\na=[-1]*n;b=[-1]*n;opened=[0]*n\r\nfor i in range(n):\r\n a_,b_=[int(v) for v in stdin.readline().split()]\r\n a[i]=a_;b[i]=b_\r\no1=[-1]*1001;o2=[-1]*1001\r\nfor i in range(n):\r\n if o1[b[i]] != -1:\r\n o2[b[i]] = i\r\n else:\r\n o1[b[i]] = i\r\nsol = 0\r\nfor i in range(n):\r\n if o1[a[i]]==-1 or o1[a[i]]==i and o2[a[i]]==-1:\r\n sol += 1\r\nprint(sol)", "\nn = int(input())\n\n\na = []\nb = []\nfor _ in range(n):\n x,y = map(int, input().split())\n a.append(x)\n b.append(y)\n \nt = 0\nfor i in range(len(a)):\n if b.count(a[i]) <= (a[i] == b[i]):\n t += 1\n\nprint(t)\n\n", "from collections import defaultdict, Counter\n\nn = int(input())\nbottles = set()\ncan_open_by = defaultdict(set)\ncounts = Counter()\ncan_open_equals = Counter()\nfor _ in range(n):\n a, b = list(map(int, input().split()))\n counts[a] += 1\n bottles.add(a)\n if a == b:\n can_open_equals[a] += 1\n else:\n can_open_by[a].add(b)\n\nopened = set()\nfor b in list(bottles):\n for a in can_open_by[b]:\n opened.add(a)\n if b in can_open_equals:\n if can_open_equals[b] > 1:\n opened.add(b)\n else:\n counts[b] = 1\n\ntotal = 0\nfor b in bottles.difference(opened):\n total += counts[b]\nprint(total)\n", "n = int(input())\na = [list(map(int, input().split())) for i in range(n)]\nopen_index = set()\nfor i in range(n):\n for j in range(n):\n if (i != j) and (a[i][1] == a[j][0]):\n open_index.add(j)\nprint(n - len(open_index))", "import sys\r\nimport math\r\nimport collections\r\nimport heapq\r\nimport decimal\r\ninput=sys.stdin.readline\r\nn=int(input())\r\nl1=[]\r\nl2=[]\r\nfor i in range(n):\r\n a,b=(int(i) for i in input().split())\r\n l1.append(a)\r\n l2.append(b)\r\nc=n\r\nfor i in range(n):\r\n for j in range(n):\r\n if(j!=i and l2[j]==l1[i]):\r\n c-=1\r\n break\r\nprint(c)", "n = int(input())\r\nbottles, openers = [], []\r\nfor _ in range(n):\r\n\ta, b = map(int, input().split())\r\n\topeners.append(b)\r\n\tbottles.append(a)\r\nopened = [False]*n\r\nfor i in range(n):\r\n\tfor j in range(n):\r\n\t\tif(i != j and openers[i] == bottles[j] and not opened[j]):\r\n\t\t\topened[j] = True\r\n\r\ncount = 0\r\nfor i in range(n):\r\n\tif(not opened[i]):\r\n\t\tcount+=1\r\n\r\n\r\nprint(count)", "n = int(input())\r\na = [None] * n\r\nfor i in range(n):\r\n\ta[i] = tuple(map(int, input().split()))\r\nans = 0\r\nfor i, x in enumerate(a):\r\n\tok = 0\r\n\tfor j, y in enumerate(a):\r\n\t\tif i == j:\r\n\t\t\tcontinue\r\n\t\tif y[1] == x[0]:\r\n\t\t\tok = 1\r\n\tans += (ok ^ 1)\r\nprint(ans)", "def bottle(n):\r\n arr = []\r\n count = 0\r\n for i in range(n):\r\n arr.append(list(map(int,input().split())))\r\n for i in range(n):\r\n for j in range(n):\r\n if j != i:\r\n if arr[j][1] == arr[i][0]:\r\n break\r\n else:\r\n count += 1\r\n print(count)\r\nbottle(int(input()))", "n = int(input())\r\nt = 0\r\na = []\r\nb = []\r\nfor i in range(n):\r\n x, y = map(int, input().rstrip().split())\r\n a += [x]\r\n b += [y]\r\nfor i in range(n):\r\n x = a[i]\r\n if x not in b or (b[i] == x and b.count(x) == 1):\r\n t += 1\r\nprint(t)", "a=int(input())\narr=[]\nbrr=[]\n\nfor i in range(0,a):\n x,y=map(int,input().split())\n arr.append(x)\n brr.append(y)\n\nflag=False\ncounter=0\nfor i in range(0,a):\n flag=False\n\n for j in range(0,a):\n if i == j :\n continue\n \n if arr[i] == brr[j] :\n flag=True\n break;\n\n\n if flag == False :\n counter+=1;\n\n\n \nprint(counter)\n", "n = int(input())\r\nl = [0] * n\r\nr = [0] * n\r\nnum = [0] * 10000\r\nfor i in range(n):\r\n\tl[i], r[i] = map(int, input().split())\r\n\tnum[r[i]] += 1\r\nans = n\r\nfor i in range(n):\r\n\tif (num[l[i]] ==\t1) and (l[i] == r[i]): continue\r\n\r\n\tif (num[l[i]] < 1): continue\r\n\tans -= 1\r\n\r\nprint(ans)\r\n" ]

[ "n, m = map(int, input().split())\ng = [[] for _ in range(n)]\nfor i in range(m):\n p, q = map(int, input().split())\n g[p - 1].append(q - 1)\n g[q - 1].append(p - 1)\n\ncomp = [-1] * n\ndef shortest(root):\n dist = [-1] * n\n q = [0] * n\n left, right = 0, 1\n q[left] = root\n dist[root] = 0\n good = True\n while left < right:\n x = q[left]\n left = left + 1\n for i in g[x]:\n if dist[i] is -1: \n dist[i] = 1 + dist[x]\n q[right] = i\n right = right + 1\n elif dist[i] == dist[x]:\n good = False \n far = 0\n for i in dist: \n if far < i:\n far = i\n return good, far, dist\n\narr = [0] * n\ngood = True\nfor i in range(n):\n _, opt, dist = shortest(i)\n if _ is False: good = False\n if comp[i] is -1:\n for j in range(n): \n if dist[j] is not -1: comp[j] = i\n if arr[comp[i]] < opt: \n arr[comp[i]] = opt\n\nif good is False: print('-1')\nelse: print(sum(arr))\n\n", "def solve():\r\n n, m = input().split()\r\n n = int(n)\r\n m = int(m)\r\n global maxValue\r\n maxValue = n*2\r\n graph = [[] for _ in range(0, n)]\r\n edges = []\r\n diameters = []\r\n for _ in range(0, m):\r\n u, v = input().split()\r\n u = int(u)-1\r\n v = int(v)-1\r\n edges.append(v)\r\n graph[u].append(v)\r\n graph[v].append(u)\r\n\r\n distance = [maxValue]*n\r\n queueCc = [0]*n\r\n queue = [0]*n\r\n for i in range(0, n):\r\n if distance[i] == maxValue:\r\n qlen = bfs_2k(graph, i, distance, queueCc)\r\n if(qlen == None):\r\n print(-1)\r\n return\r\n diameters.append(distance[queueCc[qlen-1]] if qlen > 0 else 0)\r\n for v in range(1, qlen):\r\n newDistance = [maxValue]*n\r\n bfs_2k(graph, queueCc[v], newDistance, queue)\r\n diameters[-1] = max(diameters[-1], newDistance[queue[qlen-1]])\r\n print(sum(diameters))\r\n\r\n\r\ndef bfs_2k(graph, initVertex, dist, queue):\r\n dist[initVertex] = 0\r\n queue[0] = initVertex\r\n qlen = qcount = 1\r\n i = 0\r\n while qcount:\r\n u = queue[i]\r\n qcount -= 1\r\n i += 1\r\n for v in graph[u]:\r\n if(dist[v] == maxValue):\r\n dist[v] = dist[u] + 1\r\n queue[qlen] = v\r\n qlen += 1\r\n qcount+=1\r\n if (dist[u] - dist[v]) % 2 == 0:\r\n return None\r\n return qlen\r\n\r\n\r\nsolve()\r\n" ]

[ "n = input()\r\ns = set(map(int,input()))\r\nif all(map(lambda x: x&s!=set(),({1,4,7,0},{3,6,9,0},{7,0,9},{1,2,3}))):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "input()\r\na = list(map(int, str(input())))\r\n\r\nd = {\r\n 1: (0, 0),\r\n 2: (1, 0),\r\n 3: (2, 0),\r\n 4: (0, 1),\r\n 5: (1, 1),\r\n 6: (2, 1),\r\n 7: (0, 2),\r\n 8: (1, 2),\r\n 9: (2, 2),\r\n 0: (1, 3)\r\n}\r\n\r\nr = list(map(lambda x: (d[x][0] + 1, d[x][1]), a))\r\nl = list(map(lambda x: (d[x][0] - 1, d[x][1]), a))\r\nt = list(map(lambda x: (d[x][0], d[x][1] + 1), a))\r\nb = list(map(lambda x: (d[x][0], d[x][1] - 1), a))\r\nrt = list(map(lambda x: (d[x][0] + 1, d[x][1] + 1), a))\r\nrb = list(map(lambda x: (d[x][0] + 1, d[x][1] - 1), a))\r\nlt = list(map(lambda x: (d[x][0] - 1, d[x][1] + 1), a))\r\nlb = list(map(lambda x: (d[x][0] - 1, d[x][1] - 1), a))\r\n\r\nif all([x in d.values() for x in r])\\\r\n or all([x in d.values() for x in l])\\\r\n or all([x in d.values() for x in t])\\\r\n or all([x in d.values() for x in b])\\\r\n or all([x in d.values() for x in rt])\\\r\n or all([x in d.values() for x in rb]) \\\r\n or all([x in d.values() for x in lt])\\\r\n or all([x in d.values() for x in lb]):\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "# A\n\ninput()\nl = list(map(int, list(input())))\n\nif (1 in l or 4 in l or 7 in l or 0 in l) and (1 in l or 2 in l or 3 in l) and (3 in l or 6 in l or 9 in l or 0 in l) and (7 in l or 0 in l or 9 in l):\n print(\"YES\")\nelse:\n print(\"NO\")\n", "def in_range(x):\r\n a0 = x[0]>=0 and x[0]<=2\r\n a1 = x[1]>=0 and x[1]<=2\r\n b = (x == [1, 3])\r\n\r\n return a0 and a1 or b\r\n\r\ndef add(a, b):\r\n c = [0,0]\r\n c[0] = a[0]+b[0]\r\n c[1] = a[1]+b[1]\r\n\r\n return c\r\n\r\n\r\nn = int(input())\r\nnum = input()\r\n\r\nloc = [[1,3],\r\n [0,0],[1,0],[2,0],\r\n [0,1],[1,1],[2,1],\r\n [0,2],[1,2],[2,2]]\r\n\r\nflag = False\r\n\r\nup = [0,-1]\r\ndown = [0,1]\r\nleft = [-1,0]\r\nright= [1,0]\r\n\r\ncounts = [0]*4\r\n\r\nfor x in num:\r\n # print(loc[int(x)])\r\n if in_range(add(loc[int(x)],up)):\r\n counts[0] += 1\r\nfor x in num:\r\n if in_range(add(loc[int(x)],down)):\r\n counts[1] += 1\r\nfor x in num:\r\n if in_range(add(loc[int(x)],left)):\r\n counts[2] += 1\r\nfor x in num:\r\n if in_range(add(loc[int(x)],right)):\r\n counts[3] += 1\r\n\r\n# print(counts[0])\r\nflag = counts[0] == n or counts[1] == n or counts[2] == n or counts[3] == n\r\n\r\nif flag:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n", "n = int(input())\r\ns = input()\r\na = []\r\nfor i in range(0,10):\r\n a.append(False)\r\nfor i in range(n):\r\n a[int(s[i])] = True\r\n\r\nif (a[1] or a[2] or a[3]) and (a[1] or a[4] or a[7] or a[0]) and (a[9] or a[0] or a[7]) and (a[3] or a[6] or a[9] or a[0]):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n = input()\r\ns = input()\r\n\r\nup = len([i for i in ['1', '2', '3'] if i in s]) == 0 # true if s does not contains one of these\r\nright = len([i for i in ['3', '6', '9', '0'] if i in s]) == 0\r\nleft = len([i for i in ['1', '4', '7', '0'] if i in s]) == 0\r\ndown = len([i for i in ['7', '9', '0'] if i in s]) == 0\r\n\r\nok = not(up or right or left or down) #if the is at least one true then it is not uniqe and print NO\r\n #if all of them are 0 then not 0 == true and print YES\r\nif ok:\r\n print(\"YES\")\r\nelse: #not ok\r\n print(\"NO\")", "import itertools\r\nimport sys\r\n\r\nCORD_DICT = {\r\n\t1:(0,0), 2:(0,1), 3:(0,2),\r\n\t4:(1,0), 5:(1,1), 6:(1,2),\r\n\t7:(2,0), 8:(2,1), 9:(2,2),\r\n\t0:(3,1)\r\n}\r\n\r\ndef applyShiftVector(value,vector):\r\n\treturn (value[0] + vector[0], value[1] + vector[1])\r\n\r\n\r\ndef checkLimit(cordinates):\r\n\ty,x = cordinates\r\n\tif y < 0 or y > 3:\r\n\t\treturn False\r\n\tif x < 0 or x > 2:\r\n\t\treturn False\r\n\tif y == 3:\r\n\t\treturn x == 1\r\n\telse:\r\n\t\treturn True\r\n\r\n\r\ndef shift_and_check(values, shiftVector):\r\n\tshiftX, shiftY = shiftVector\r\n\tif shiftX == 0 and shiftY == 0:\r\n\t\treturn False\r\n\tfor value in values:\r\n\t\tnewCord = applyShiftVector(CORD_DICT[int(value)], shiftVector)\r\n\t\tif not checkLimit(newCord):\r\n\t\t\treturn False\r\n\treturn True\r\n\r\n\r\nn = int(input())\r\nvalues = input()\r\n\r\nfor shift in itertools.product([-1, 0 ,1], repeat = 2):\r\n\tif shift_and_check(values, shift):\r\n\t\tprint('NO')\r\n\t\tsys.exit(0)\r\n\t\t\r\nprint('YES')\r\n\r\n", "n = int(input())\r\ns = input()\r\npr = True\r\nfor i in range(len(s)):\r\n if s[i] in '3690':\r\n pr = False\r\nvn = True\r\nfor i in range(len(s)):\r\n if s[i] in '709':\r\n vn = False\r\nle = True\r\nfor i in range(len(s)):\r\n if s[i] in '1470':\r\n le = False\r\nvv = True\r\nfor i in range(len(s)):\r\n if s[i] in '123':\r\n vv = False\r\nif (pr or vn or le or vv):\r\n print('NO')\r\nelse:\r\n print('YES')\r\n", "n = int(input())\r\nnum = input()\r\n\r\nkeyb = [[\"1\",\"2\",\"3\"],[\"4\",\"5\",\"6\"],[\"7\",\"8\",\"9\"],[-1,\"0\",-1]]\r\n\r\ndef findKey(key):\r\n for k in range(4):\r\n for k1 in range(3):\r\n if keyb[k][k1] == key:\r\n return [k,k1]\r\n\r\nmovements = []\r\nkeys = []\r\n\r\nfor a in range(n):\r\n keys.append(findKey(num[a]))\r\n\r\nfor a in range(1,n):\r\n key = keys[a-1]\r\n key1 = keys[a]\r\n mov0 = 0\r\n mov1 = 0\r\n if key[0]<key1[0]:\r\n mov0 = abs(key[0]-key1[0])\r\n else:\r\n mov0 = key1[0]-key[0]\r\n if key[1]==key1[1]:\r\n mov1 = 0\r\n elif key1[1]>key[1]:\r\n mov1 = key1[1]-key[1]\r\n elif key[1]>key1[1]:\r\n mov1 = key1[1]-key[1]\r\n #print(key, key1)\r\n movements.append([mov0,mov1])\r\n\r\ndef check(a, b):\r\n for m in movements:\r\n a+=m[0]\r\n b+=m[1]\r\n if a < 0 or b < 0 or a > 3 or b > 2:\r\n return False\r\n if keyb[a][b]==-1:\r\n return False\r\n return True\r\n\r\ndone = 0\r\nfor k1 in range(4):\r\n for k2 in range(3):\r\n if keyb[k1][k2]==-1:\r\n continue\r\n if [k1,k2]==keys[0]:\r\n continue\r\n if check(k1, k2)==True:\r\n print(\"NO\")\r\n done = 1\r\n break\r\n if done==1:\r\n break\r\n\r\nif done == 0:\r\n print(\"YES\")\r\n \r\n \r\n", "\n# (col, row)\nKEYS = {\n 1: (0, 0),\n 2: (1, 0),\n 3: (2, 0),\n 4: (0, 1),\n 5: (1, 1),\n 6: (2, 1),\n 7: (0, 2),\n 8: (1, 2),\n 9: (2, 2),\n 0: (1, 3)\n}\n\nBOARD = set(KEYS.values())\n\nn = int(input())\nnumber = list(map(int, list(input())))\n\n\ndef add_offset(cell, offset):\n return (cell[0] + offset[0], cell[1] + offset[1])\n\nuniq = True\n\nfor posible_starts in BOARD:\n if KEYS[number[0]] != posible_starts:\n all_fit = True\n off = (posible_starts[0] - KEYS[number[0]][0],\n posible_starts[1] - KEYS[number[0]][1])\n for num_part in number:\n if add_offset(KEYS[num_part], off) not in BOARD:\n all_fit = False\n break\n if all_fit:\n uniq = False\n\nif uniq:\n print(\"YES\")\nelse:\n print(\"NO\")\n", "import sys\r\ndef mapi(): return map(int,input().split())\r\ndef maps(): return map(str,input().split())\r\n#--------------------------------------------------\r\n\r\nn = int(input())\r\ns = input().strip()\r\na = [True for i in range(10)]\r\nfor i in range(n):\r\n\tc = int(s[i])\r\n\ta[c] = False\r\ninc = 0\r\nif a[1] and a[2] and a[3]:\r\n\tinc = -3\r\nif a[7] and a[9] and a[0]:\r\n\tinc = +3\r\nif a[1] and a[4] and a[7] and a[0]:\r\n\tinc = -1\r\nif a[3] and a[6] and a[9] and a[0]:\r\n\tinc = +1\r\nif inc == 0:\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")", "def main():\n input()\n l = list(map(int, input()))\n for s in {0, 4, 5, 6, 7, 8, 9}, {1, 2, 4, 5, 7, 8}, {1, 2, 3, 4, 5, 6, 8}, {2, 3, 5, 6, 8, 9}:\n if all(x in s for x in l):\n print(\"NO\")\n return\n print(\"YES\")\n\n\nif __name__ == '__main__':\n main()\n", "def Left(a):\r\n if (a != 1 and a != 4 and a != 7 and a != 0):\r\n return True\r\n return False\r\n\r\ndef Right(a):\r\n if (a != 3 and a != 6 and a != 9 and a != 0):\r\n return True\r\n return False\r\n\r\ndef Up(a):\r\n if (a != 1 and a != 2 and a != 3):\r\n return True\r\n return False\r\n\r\ndef Down(a):\r\n if (a != 7 and a != 9 and a != 0):\r\n return True\r\n return False\r\n\r\nn = int(input())\r\nstr1 = input()\r\n\r\nu =0\r\nd=0\r\nl=0\r\nr=0\r\nfor iss in str1:\r\n i = int(iss)\r\n if (Up(i)):\r\n u+=1\r\n if (Down(i)):\r\n d += 1\r\n if (Left(i)):\r\n l += 1\r\n if (Right(i)):\r\n r += 1\r\n\r\nif (u == len(str1)\r\n or d == len(str1)\r\n or l == len(str1)\r\n or r == len(str1)):\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n\r\n\r\n", "left = {\r\n 1: None,\r\n 2: 1,\r\n 3: 2,\r\n 4: None,\r\n 5: 4,\r\n 6: 5,\r\n 7: None,\r\n 8: 7,\r\n 9: 8,\r\n 0: None\r\n}\r\n\r\nright = {\r\n 1: 2,\r\n 2: 3,\r\n 3: None,\r\n 4: 5,\r\n 5: 6,\r\n 6: None,\r\n 7: 8,\r\n 8: 9,\r\n 9: None,\r\n 0: None\r\n}\r\n\r\nup = {\r\n 1: None,\r\n 2: None,\r\n 3: None,\r\n 4: 1,\r\n 5: 2,\r\n 6: 3,\r\n 7: 4,\r\n 8: 5,\r\n 9: 6,\r\n 0: 8\r\n}\r\n\r\ndown = {\r\n 1: 4,\r\n 2: 5,\r\n 3: 6,\r\n 4: 7,\r\n 5: 8,\r\n 6: 9,\r\n 7: None,\r\n 8: 0,\r\n 9: None,\r\n 0: None\r\n}\r\n\r\ndef func(comb, d):\r\n for element in comb:\r\n if d[int(element)] is None:\r\n return False\r\n return True\r\n\r\nif __name__ == \"__main__\":\r\n n = int(input())\r\n comb = str(input())\r\n\r\n if func(comb, left) == True or func(comb, right) == True or func(comb, up) == True or func(comb, down) == True:\r\n print(\"NO\")\r\n else:\r\n print(\"YES\")\r\n\r\n", "left = 0\nright = 1\nup = 2\ndown = 3\n\nbuttons = []\n#0\nbuttons.append({left:False, right:False, up:True, down:False })\n#1\nbuttons.append({left:False, right:True, up:False, down:True })\n#2\nbuttons.append({left:True, right:True, up:False, down:True })\n#3\nbuttons.append({left:True, right:False, up:False, down:True })\n#4\nbuttons.append({left:False, right:True, up:True, down:True })\n#5\nbuttons.append({left:True, right:True, up:True, down:True })\n#6\nbuttons.append({left:True, right:False, up:True, down:True })\n#7\nbuttons.append({left:False, right:True, up:True, down:False })\n#8\nbuttons.append({left:True, right:True, up:True, down:True })\n#9\nbuttons.append({left:True, right:False, up:True, down:False })\n\nn = eval( input( ) )\nstroke = input( )\n\ncan = [True,True,True,True]\n\nfor button in stroke:\n button = int(button)\n if buttons[button][left] == False:\n can[left] = False\n if buttons[button][right] == False:\n can[right] = False\n if buttons[button][up] == False:\n can[up] = False\n if buttons[button][down] == False:\n can[down] = False\n\ncanMove = False\n\nfor i in range(4):\n if can[i] == True:\n canMove = True\n\nif canMove == True:\n print(\"NO\")\nelse:\n print(\"YES\")\n\n\n", "n = int(input())\r\ns = input()\r\nh, v = True, True\r\ncnt = [s.count(chr(i + ord('0'))) for i in range(10)]\r\nif (cnt[0] or cnt[7] or cnt[9]) and (cnt[1] or cnt[2] or cnt[3]):\r\n v = False\r\nif cnt[0] and (cnt[1] or cnt[2] or cnt[3]):\r\n h = False\r\nif (cnt[1] or cnt[4] or cnt[7]) and (cnt[3] or cnt[6] or cnt[9]):\r\n h = False\r\nprint('NO' if v or h else 'YES')\r\n", "n=int(input())\r\ninp=[int(i) for i in input()]\r\na=[[1,2,3],[1,4,7,0],[7,0,9],[3,6,9,0]]\r\nres='YES'\r\nfor i in a:\r\n for j in i:\r\n if j in inp:\r\n break\r\n else:\r\n res='NO'\r\nprint(res)\r\n", "a = input();\r\ns = str(input());\r\nr = 0; u = 0; d = 0; z = 0; l = 0; f = 0;\r\nfor i in range(len(s)):\r\n if s[i] == '0':\r\n z = 1;\r\n if (s[i] == '1') or (s[i] == '2') or (s[i] == '3'):\r\n u = 1;\r\n if (s[i] == '3') or (s[i] == '6') or (s[i] == '9'):\r\n r = 1;\r\n if (s[i] == '7') or (s[i] == '8') or (s[i] == '9'):\r\n d = 1;\r\n if (s[i] == '1') or (s[i] == '4') or (s[i] == '7'):\r\n l = 1;\r\n if (s[i] == '7') or (s[i] == '9'):\r\n f = 1;\r\nif (((u == 1) and (r == 1) and (d == 1) and (l == 1)) and (f == 1)) or ((z == 1) and (u == 1)):\r\n print('YES')\r\nelse:\r\n print('NO');\r\n \r\n", "a = [[1, 2, 3], [4, 5, 6], [7, 8, 9], [-1, 0, -1]]\r\nd = [(3, 1), (0, 0), (0, 1), (0, 2), (1, 0), (1, 1), (1, 2), (2, 0), (2, 1), (2, 2)]\r\nn = int(input())\r\nb = list(map(int, list(input())))\r\nc = []\r\nfor i in range(n - 1):\r\n c.append((d[b[i + 1]][0] - d[b[i]][0], d[b[i + 1]][1] - d[b[i]][1]))\r\nfor i in range(10):\r\n x, y = d[i][0], d[i][1]\r\n fl = 1\r\n for j in c:\r\n x1, y1 = x + j[0], y + j[1]\r\n if (x1, y1) not in d:\r\n fl = 0\r\n x, y = x1, y1\r\n if fl and i != b[0]:\r\n print(\"NO\")\r\n break\r\nelse:\r\n print(\"YES\")\r\n ", "p,s=input(),set(input())\r\nprint(('NO','YES')[all(set(t)&s for t in'0147 0369 079 123'.split())])", "#!/usr/bin/env python3\n\n# x ->\n# y v\n\ndef is_pos_correct(x, y):\n return 0 <= x <= 2 and 0 <= y <= 2 or x == 1 and y == 3\n\n\ndef is_v_correct(v, x, y):\n if not is_pos_correct(x, y):\n return False\n\n for vx, vy in v:\n x += vx\n y += vy\n if not is_pos_correct(x, y):\n return False\n\n return True\n\n\ndef move_v(v, dx, dy):\n return [(x + dx, y + dy) for (x, y) in v]\n\n\ndef get_row(x):\n return 3 if x == 0 else (x - 1) // 3\n\n\ndef get_col(x):\n return 1 if x == 0 else (x - 1) % 3\n\n\ndef get_pos(x):\n return get_col(x), get_row(x)\n\n\ndef get_shift(x, y):\n x, y = int(x), int(y)\n return get_col(y) - get_col(x), get_row(y) - get_row(x)\n\n\ndef create_v(s):\n return [get_shift(x, y) for (x, y) in zip(s, s[1:])]\n\n\ndef main():\n input()\n n = [int(x) for x in input()]\n\n base_v = create_v(n)\n # print(base_v)\n # print()\n\n for x, y in [(xx, yy) for xx in (-1, 0, 1) for yy in (-1, 0, 1) if not(xx == 0 and yy == 0)]:\n new_pos = move_v([get_pos(n[0])], x, y)[0]\n # print(base_v, new_pos)\n if is_v_correct(base_v, new_pos[0], new_pos[1]):\n print('NO')\n return\n\n print('YES')\n\n\nif __name__ == '__main__':\n main()\n", "n = int(input())\ns = input()\na = [s.find(str(i)) != -1 for i in range(10)]\nprint(\"YES\" if (a[1] or a[4] or a[7] or a[0]) and (a[1] or a[2] or a[3]) and (a[3] or a[6] or a[9] or a[0]) and (a[7] or a[0] or a[9]) else \"NO\")\n", "n = int(input())\ns = input()\nfill = [[False for i in range(3)] for j in range(4)]\nfor i in s:\n if i == \"0\":\n j = 10\n else:\n j = ord(i)-ord('1') #0, 1, 2, 3... 8\n fill[j//3][j%3] = True\n#for i in fill:\n# print(i)\ntop = fill[0][0] or fill[0][1] or fill[0][2]\nbottom = fill[2][0] or fill[3][1] or fill[2][2]\nleft = fill[0][0] or fill[1][0] or fill[2][0]\nright = fill[0][2] or fill[1][2] or fill[2][2]\n#print(left, right, fill[3][1], (not left or not right)and not fill[3][1])\nif ((not left or not right)and not fill[3][1]) or not top or not bottom:\n print(\"NO\")\nelse:\n print(\"YES\")\n", "pos=[[4,2]]\r\n\r\nfor x in range(1,4):\r\n for y in range(1,4):\r\n pos.append([x,y])\r\n\r\na = [[-1,-1,-1,-1,-1],[-1,1,2,3,-1],[-1,4,5,6,-1],[-1,7,8,9,-1],[-1,-1,0,-1,-1],[-1,-1,-1,-1,-1]]\r\nn=input()\r\ns=input()\r\n\r\nfor x,y in zip([0,0,-1,1],[-1,1,0,0]):\r\n ok=True\r\n for c in s:\r\n u=pos[int(c)][0]+x\r\n v=pos[int(c)][1]+y\r\n #print(u,v,a[u][v])\r\n if a[u][v]==-1: ok=False\r\n if ok:\r\n print('NO')\r\n break\r\n#print(a)\r\n#print(pos)\r\nif not ok: print('YES')\r\n", "n, s = input(), set(input())\r\nprint(('NO', 'YES')[all(set(t) & s for t in '0147 0369 079 123'.split())])\r\n", "\r\nn = int(input())\r\ns = input()\r\nif '0' in s and ('1' in s or '2' in s or '3' in s):\r\n print(\"YES\")\r\nelif ('7' in s or '9' in s) and ('1' in s or '2' in s or '3' in s) and ('1' in s or '4' in s or '7' in s) and ('3' in s or '6' in s or '9' in s):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n = int(input())\r\na = list(map(int, input()))\r\nb = [[1, 2, 3], [4, 5, 6], [7, 8, 9], [-1, 0, -1]]\r\np = [0] * 10\r\np[0] = 4, 2\r\np[1] = 1, 1\r\np[2] = 1, 2\r\np[3] = 1, 3\r\np[4] = 2, 1\r\np[5] = 2, 2\r\np[6] = 2, 3\r\np[7] = 3, 1\r\np[8] = 3, 2\r\np[9] = 3, 3\r\npath = []\r\nfor i in range(1, n):\r\n dx = p[a[i]][0] - p[a[i - 1]][0]\r\n dy = p[a[i]][1] - p[a[i - 1]][1]\r\n path.append((dx, dy))\r\n\r\ndef go(x, y, i):\r\n if i == n - 1:\r\n print('NO')\r\n exit()\r\n nx, ny = x + path[i][0], y + path[i][1]\r\n if 1 <= nx <= 4 and 1 <= ny <= 3 and b[nx - 1][ny - 1] != -1:\r\n go(nx, ny, i + 1)\r\n \r\nfor x, y in p:\r\n if b[x - 1][y - 1] != a[0] and b[x - 1][y - 1] != -1:\r\n go(x, y, 0)\r\nprint('YES')\r\n", "def works(numbers):\r\n if (numbers[1] or numbers[2] or numbers[3]):\r\n if (numbers[7] or numbers[0] or numbers[9]):\r\n if (numbers[1] or numbers[4] or numbers[7] or numbers[0]):\r\n if (numbers[3] or numbers[6] or numbers[9] or numbers[0]):\r\n return True\r\n else:\r\n return False\r\n else:\r\n return False\r\n else:\r\n return False\r\n else:\r\n return False\r\n\r\n\r\nn=int(input())\r\nline=input()\r\nnumbers={}\r\nfor i in range (10):\r\n numbers[i]=False\r\nfor ch in line:\r\n numbers[int(ch)]=True\r\nif works(numbers):\r\n print (\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "import sys\r\nn = int(sys.stdin.readline())\r\ns = str(sys.stdin.readline()[:-1])\r\n\r\ndef answer(s):\r\n ans = 'NO'\r\n col1 = ['1','4','7']\r\n col2 = ['2','5','8','0']\r\n col3 = ['3','6','9']\r\n posNums = [[0,0] for x in s]\r\n added = 0\r\n for digit in s:\r\n if digit=='0':\r\n posNums[added] = [2,3]\r\n elif digit in col1:\r\n posNums[added] = [1,(int(digit))//3]\r\n elif digit in col2:\r\n posNums[added] = [2,(int(digit))//3]\r\n elif digit in col3:\r\n posNums[added] = [3,(int(digit)-1)//3]\r\n added = added+1\r\n #print(posNums)\r\n ans = 'YES'\r\n toNo = True\r\n for pos in posNums:\r\n tmp = pos[1]+1\r\n if pos[0]==2:\r\n if tmp>=4:\r\n toNo=False\r\n break\r\n elif tmp>=3:\r\n toNo = False\r\n break\r\n if toNo:\r\n ans = 'NO'\r\n return ans\r\n\r\n toNo = True\r\n for pos in posNums:\r\n tmp = pos[1]-1\r\n if tmp<0:\r\n toNo = False\r\n break\r\n if toNo:\r\n ans = 'NO'\r\n return ans \r\n\r\n if not '0' in s:\r\n toNo = True\r\n for pos in posNums:\r\n tmp = pos[0]+1\r\n if tmp>3:\r\n toNo = False\r\n break\r\n if toNo:\r\n ans = 'NO'\r\n return ans\r\n\r\n toNo = True\r\n for pos in posNums:\r\n tmp = pos[0]-1\r\n if tmp<1:\r\n toNo = False\r\n break\r\n if toNo:\r\n ans = 'NO'\r\n return ans\r\n\r\n return ans\r\n \r\nprint(answer(s))\r\n", "#689 A\r\np = [True]*10\r\nn = int(input())\r\nnum = input()\r\ngrid = [(3,1),(0, 0), (0, 1), (0, 2), (1, 0), (1, 1), (1, 2), (2, 0), (2, 1), (2, 2)]\r\nstart = int(num[0])\r\nprev = grid[int(num[0])]\r\np[start] = False\r\nmoves = grid\r\nfor i in num[1:]:\r\n\tl = grid[int(i)]\r\n\tdx = l[0] - prev[0]\r\n\tdy = l[1] - prev[1]\r\n\tprev = l\r\n\tmoves = [(m[0]+dx,m[1]+dy) for m in moves ]\r\n\tfor m in range(len(moves)) :\r\n\t\tif p[m]: \r\n\t\t\tif moves[m] not in grid:\r\n\t\t\t\tp[m] = False\r\nif True in p:\r\n\t\tprint(\"NO\")\r\nelse : print(\"YES\")\r\n\t\r\n", "n = int(input())\r\nnumber = (input())\r\nnumber = str(number)\r\n\r\n\r\na = [0] * 10\r\nfor i in number:\r\n l = int(i)\r\n a[l] += 1\r\n\r\n\r\nhorizontal = a[0] != 0 or (a[1] != 0 or a[4] != 0 or a[7] != 0) and (a[3] != 0 or a[6] != 0 or a[9] != 0)\r\nvertical = (a[1] != 0 or a[2] != 0 or a[3] != 0) and (a[7] != 0 or a[0] != 0 or a[9] != 0)\r\n\r\n\r\nif horizontal and vertical:\r\n print('YES')\r\nelse:\r\n print('NO')", "n = int(input())\r\nnumb = input()\r\nnum = [0]*10\r\nfor i in numb:\r\n num[int(i)] = 1\r\nans = 0\r\nif num[1] + num[2] + num[3] > 0:\r\n ans += 1\r\nif num[1] + num[4] + num[7] + num[0] > 0:\r\n ans += 1\r\nif num[3] + num[6] + num[9] + num[0] > 0:\r\n ans += 1\r\nif num[7] + num[0] + num[9] > 0:\r\n ans += 1\r\nif ans == 4:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n = int(input())\n# a, b = map(int, input().split())\nnumber = input()\n\nnumpad = [['1', '2', '3'],\n ['4', '5', '6'],\n ['7', '8', '9'],\n [None, '0', None]]\n\n\ndef get_coordinates(digit):\n if digit in ('1', '2', '3'):\n first_coordinate = 0\n second_coordinate = int(digit) - 1\n elif digit in ('4', '5', '6'):\n first_coordinate = 1\n second_coordinate = int(digit) - 4\n elif digit in ('7', '8', '9'):\n first_coordinate = 2\n second_coordinate = int(digit) - 7\n else:\n first_coordinate = 3\n second_coordinate = 1\n return first_coordinate, second_coordinate\n\n\ndef add(v1, v2):\n return v1[0] + v2[0], v1[1] + v2[1]\n\n\ndef sub(v1, v2):\n return v1[0] - v2[0], v1[1] - v2[1]\n\n\ndef try_it(start_digit, what_to_do):\n current_coordinates = get_coordinates(start_digit)\n for move in what_to_do:\n current_coordinates = add(current_coordinates, move)\n if current_coordinates[0] < 0 or current_coordinates[1] < 0:\n return False\n try:\n _ = numpad[current_coordinates[0]][current_coordinates[1]]\n except IndexError:\n return False\n if _ is None:\n return False\n return True\n\n\nsequence = []\nfor i in range(n - 1):\n sequence.append(sub(get_coordinates(number[i + 1]), get_coordinates(number[i])))\n\nfor digit in set('1234567890') - set(number[0]):\n if try_it(digit, sequence):\n print('NO')\n break\nelse:\n print('YES')\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\ns = input().rstrip()\r\n\r\nP = [[1, 2, 3], [4, 5, 6], [7, 8, 9], [-1, 0, -1]]\r\n\r\nT = []\r\nfor k in range(n):\r\n for i in range(4):\r\n for j in range(3):\r\n if int(s[k]) == P[i][j]:\r\n T.append((i, j))\r\n\r\nfor i in range(-4, 4, 1):\r\n for j in range(-3, 3, 1):\r\n if i == 0 and j == 0:\r\n continue\r\n flag = True\r\n for k in range(n):\r\n x, y = T[k]\r\n if 0 <= y + j <= 2:\r\n if y + j == 1 and 0 <= x + i < 4 or 0 <= x + i < 3:\r\n pass\r\n else:\r\n flag = False\r\n else:\r\n flag = False\r\n if flag:\r\n print('NO')\r\n exit()\r\n\r\nprint('YES')\r\n", "\r\nimport os\r\nimport sys\r\nfrom io import BytesIO, IOBase\r\n\r\n\r\n\r\n# --------------------------------- SOLUTION ---------------------------------\r\n\r\n\r\n\r\ndef main():\r\n n = int(input())\r\n s = input()\r\n\r\n positions = [\r\n (0,0), (0,1), (0,2), # 1, 2, 3\r\n (1,0), (1,1), (1,2), # 4, 5, 6\r\n (2,0), (2,1), (2,2), # 7, 8, 9\r\n (-1,-1), (3,1), (-1,-1) # _, 0, _\r\n ]\r\n\r\n vectors = []\r\n for i in range(n-1):\r\n digit1 = int(s[i])\r\n digit2 = int(s[i+1])\r\n\r\n digit1 = digit1-1 if digit1 != 0 else 10\r\n digit2 = digit2-1 if digit2 != 0 else 10\r\n\r\n vectors.append((positions[digit2][0]-positions[digit1][0], positions[digit2][1]-positions[digit1][1]))\r\n\r\n \r\n count = 0\r\n\r\n for pos in positions:\r\n if pos == (-1,-1):\r\n continue\r\n else:\r\n pos_aux = pos\r\n i = 0\r\n completed = True\r\n\r\n while i < n-1:\r\n pos_aux = (pos_aux[0]+vectors[i][0], pos_aux[1]+vectors[i][1])\r\n i += 1\r\n if pos_aux not in positions or pos_aux == (-1,-1):\r\n completed = False\r\n break\r\n\r\n if completed:\r\n count += 1\r\n if count >= 2:\r\n break\r\n\r\n if count >= 2:\r\n print('NO')\r\n else:\r\n print('YES')\r\n\r\n\r\n \r\n\r\n\r\n\r\n\r\n\r\n# --------------------------------- FAST IO ---------------------------------\r\n\r\nBUFSIZE = 8192\r\n\r\nclass FastIO(IOBase):\r\n newlines = 0\r\n\r\n def __init__(self, file):\r\n self._fd = file.fileno()\r\n self.buffer = BytesIO()\r\n self.writable = \"x\" in file.mode or \"r\" not in file.mode\r\n self.write = self.buffer.write if self.writable else None\r\n\r\n def read(self):\r\n while True:\r\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\r\n if not b:\r\n break\r\n ptr = self.buffer.tell()\r\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\r\n self.newlines = 0\r\n return self.buffer.read()\r\n\r\n def readline(self):\r\n while self.newlines == 0:\r\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\r\n self.newlines = b.count(b\"\\n\") + (not b)\r\n ptr = self.buffer.tell()\r\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\r\n self.newlines -= 1\r\n return self.buffer.readline()\r\n\r\n def flush(self):\r\n if self.writable:\r\n os.write(self._fd, self.buffer.getvalue())\r\n self.buffer.truncate(0), self.buffer.seek(0)\r\n\r\n\r\nclass IOWrapper(IOBase):\r\n def __init__(self, file):\r\n self.buffer = FastIO(file)\r\n self.flush = self.buffer.flush\r\n self.writable = self.buffer.writable\r\n self.write = lambda s: self.buffer.write(s.encode(\"ascii\"))\r\n self.read = lambda: self.buffer.read().decode(\"ascii\")\r\n self.readline = lambda: self.buffer.readline().decode(\"ascii\")\r\n\r\n\r\nsys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)\r\ninput = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\r\n\r\n\r\n\r\n\r\n# --------------------------------- MAIN --------------------------------- \r\nif __name__ == \"__main__\":\r\n main()", "class b_1:\n id = 1\n sides = [3,4,5]\nclass b_2:\n id = 2\n sides = [3,4,5,6,7]\nclass b_3:\n id = 3\n sides = [5,6,7]\nclass b_4:\n id = 4\n sides = [1,2,3,4,5]\nclass b_5:\n id = 5\n sides = [0,1,2,3,4,5,6,7]\nclass b_6:\n id = 6\n sides = [1,0,7,6,5]\nclass b_7:\n id = 7\n sides = [1,2,3,4]\nclass b_8:\n id = 8\n sides = [0,1,2,3,5,7]\nclass b_9:\n id = 9\n sides = [1,0,7,6]\nclass b_0:\n id = 0\n sides = [0,1,2]\n\ndef check(digit, check_list):\n answer_list = list(check_list)\n for button in buttons:\n # нашли нужную кнопку\n if int(digit) == button.id:\n # проверяем её стороны\n for side in check_list:\n if side not in button.sides:\n answer_list.remove(side)\n return answer_list\n\n\n\nn = int(input())\nnumber = input()\n\nbuttons = [b_1, b_2, b_3, b_4, b_5, b_6, b_7, b_8, b_9, b_0]\n\n# проверяем каждое число на возможность смещения\n# у каждого числа на клавиатуре есть 8 возможных сторон для перемещения\ncheck_list_ = [0,1,2,3,4,5,6,7]\nfor digit in number:\n check_list_ = check(digit, check_list_)\n\nif not check_list_:\n print(\"YES\")\nelse:\n print(\"NO\")", "input()\r\ns=set(map(int,input()))\r\nf=lambda x: set(x)&s!=set()\r\nprint(\"YES\" if all(map(f,([1,4,7,0],[1,2,3],[3,6,9,0],[7,0,9]))) else \"NO\")", "t=1\r\nwhile t>0:\r\n t-=1\r\n n=int(input())\r\n s=input()\r\n a=[]\r\n for i in range(0,len(s)):\r\n if s[i]!='0':\r\n a.append(int(s[i]))\r\n else:\r\n a.append(11)\r\n b=[]\r\n c=[]\r\n d=[]\r\n e=[]\r\n for i in range(0,len(s)):\r\n b.append(a[i]-3)\r\n c.append(a[i]%3-1 if a[i]%3!=0 else 2)\r\n d.append(a[i]+3)\r\n e.append(a[i]%3+1 if a[i]%3!=0 else 4)\r\n k1=False\r\n k2=False\r\n h1=False\r\n h2=False\r\n for i in range(0,len(s)):\r\n if b[i]<=0:\r\n k1=True\r\n if c[i]<=0 or a[i]==11:\r\n h1=True\r\n if d[i]>9 and d[i]!=11:\r\n k2=True\r\n if e[i]>=4 or a[i]==11:\r\n h2=True\r\n if k1==True and h1==True and k2==True and h2==True:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "input()\r\nn=input()\r\ns,a=[int(x) for x in n],''\r\nif (1 in s or 2 in s or 3 in s)and 0 in s:a='YES'\r\nelif 1 not in s and 2 not in s and 3 not in s :a='NO'\r\nelif 1 not in s and 4 not in s and 7 not in s:a='NO'\r\nelif 3 not in s and 6 not in s and 9 not in s:a='NO'\r\nelif 7 not in s and 9 not in s and 0 not in s:a='NO'\r\nelse :a='YES'\r\nprint(a)", "d = ['U', 'RD', 'LRD', 'LD', 'UDR', 'UDLR', 'UDL', 'UR', 'UDLR', 'UL']\r\nn, v = int(input()), set('UDLR')\r\nfor ch in input():\r\n v &= set(d[ord(ch) - ord('0')])\r\nprint('NO' if v else 'YES')", "n = int(input())\r\ns = input()\r\na = [0]*10\r\nfor i in range(n):\r\n a[int(s[i])] = 1\r\n\r\nif a[1]+a[2]+a[3] == 0 or a[7]+a[9]+a[0] == 0 or a[1]+a[4]+a[7]+a[0] == 0 or a[3] + a[6] + a[9] + a[0] == 0:\r\n print('NO')\r\nelse:\r\n print('YES')\r\n", "#be yade hagh\r\nn=int(input())\r\ns=input()\r\nr=[0,0,0,0]\r\nc=[0,0,0]\r\nos=[\"NO\",\"YES\"]\r\nans=0\r\ncs=rs=0\r\nfor i in s:\r\n if i==0:\r\n if not f0:\r\n r[3]=1\r\n rs+=1\r\n continue\r\n t=int(i)\r\n if r[(t-1)//3]==0:\r\n rs+=1\r\n r[(t-1)//3]=1\r\n if c[(t-1)%3]==0:\r\n cs+=1\r\n c[(t-1)%3]=1\r\nif not r[3]:\r\n if r[0]==r[2]==c[0]==c[2] and (\"7\" in s or \"9\" in s) :\r\n ans=1\r\nelse:\r\n ans=r[0]==1\r\nprint(os[ans])\r\n \r\n", "import sys\r\nn = int(input())\r\ns = input()\r\nway = []\r\nfor x in s:\r\n if x == '0':\r\n way.append(10)\r\n else:\r\n way.append(int(x)-1)\r\ncount = 0\r\n\r\nfor i in range(10):\r\n if i == 9:\r\n now = 10\r\n else:\r\n now = i\r\n flag = 0\r\n for j in range(n-1):\r\n dif = way[j+1]-way[j]\r\n div1 = way[j+1]//3 - way[j]//3\r\n div2 = (now+dif)//3 - now//3\r\n mod1 = way[j+1]%3 - way[j]%3\r\n mod2 = (now+dif)%3 - now%3\r\n if not(div1==div2 and mod1 == mod2):\r\n flag = 1\r\n now+=dif\r\n if not(now == 10 or (-1 < now < 9)):\r\n flag = 1\r\n if flag == 0:\r\n count+=1\r\nif count<=1:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n ", "import sys\r\n\r\ndef canMoveLeft(digit):\r\n\tindex = [\r\n\tFalse,\t#0\r\n\tFalse,\t#1\r\n\tTrue,\t#2\r\n\tTrue,\t#3\r\n\tFalse,\t#4\r\n\tTrue,\t#5\r\n\tTrue,\t#6\r\n\tFalse,\t#7\r\n\tTrue,\t#8\r\n\tTrue,\t#9\r\n\t]\r\n\treturn index[digit]\r\n\r\ndef canMoveRight(digit):\r\n\tindex = [\r\n\tFalse,\t#0\r\n\tTrue,\t#1\r\n\tTrue,\t#2\r\n\tFalse,\t#3\r\n\tTrue,\t#4\r\n\tTrue,\t#5\r\n\tFalse,\t#6\r\n\tTrue,\t#7\r\n\tTrue,\t#8\r\n\tFalse,\t#9\r\n\t]\r\n\treturn index[digit]\r\n\r\ndef canMoveUp(digit):\r\n\tindex = [\r\n\tTrue,\t#0\r\n\tFalse,\t#1\r\n\tFalse,\t#2\r\n\tFalse,\t#3\r\n\tTrue,\t#4\r\n\tTrue,\t#5\r\n\tTrue,\t#6\r\n\tTrue,\t#7\r\n\tTrue,\t#8\r\n\tTrue,\t#9\r\n\t]\r\n\treturn index[digit]\r\n\r\ndef canMoveDown(digit):\r\n\tindex = [\r\n\tFalse,\t#0\r\n\tTrue,\t#1\r\n\tTrue,\t#2\r\n\tTrue,\t#3\r\n\tTrue,\t#4\r\n\tTrue,\t#5\r\n\tTrue,\t#6\r\n\tFalse,\t#7\r\n\tTrue,\t#8\r\n\tFalse,\t#9\r\n\t]\r\n\treturn index[digit]\r\n\r\nn = int(input())\r\nnumber = [int(i) for i in input()]\r\n#print(number)\r\n\r\nmovedown = [all([ canMoveDown(i) for i in number ]),\r\n\t\t\tall([ canMoveUp(i) for i in number ]),\r\n\t\t\tall([ canMoveLeft(i) for i in number ]),\r\n\t\t\tall([ canMoveRight(i) for i in number ])]\r\n\r\nif any(movedown):\r\n\tprint('NO')\r\nelse:\r\n\tprint('YES')\r\n\r\n#print(movedown)", "import sys\r\n\r\nn = int(sys.stdin.readline())\r\ndigits = [int(x) for x in sys.stdin.readline().strip()]\r\n\r\n# print digits\r\n\r\ndef can_go_left(digits):\r\n return all(x not in digits for x in [0, 1, 4, 7])\r\n\r\ndef can_go_right(digits):\r\n return all(x not in digits for x in [0, 3, 6, 9])\r\n\r\ndef can_go_up(digits):\r\n return all(x not in digits for x in [1, 2, 3])\r\n\r\ndef can_go_down(digits):\r\n return all(x not in digits for x in [0, 7, 9])\r\n\r\n\r\nif can_go_left(digits) or can_go_right(digits) or can_go_up(digits) or can_go_down(digits):\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "n=int(input())\r\ns=input()\r\nf=4\r\nfor i in s:\r\n if(int(i)==0 or int(i)==9 or int(i)==7):\r\n f-=1\r\n break\r\nfor i in s:\r\n if(int(i)==1 or int(i)==2 or int(i)==3):\r\n f-=1\r\n break\r\nfor i in s:\r\n if(i=='1' or i=='4' or i=='7' or i=='0'):\r\n f-=1\r\n break\r\nfor i in s:\r\n if(i=='3' or i=='6' or i=='9' or i=='0'):\r\n f-=1\r\n break\r\nif(f==0):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "# LUOGU_RID: 101608072\n_, s = input(), input()\r\nprint(all(set(t) & set(s) for t in '0147 0369 079 123'.split()) and 'YES' or 'NO')\r\n", "n = int(input())\ns = input()\ncan_move_hor = True\ncan_move_ver = True\nif (s.count('0') or s.count('7') or s.count('9')) and (s.count('1') or s.count('2') or s.count('3')):\n\tcan_move_ver = False\nif s.count('0') and (s.count('1') or s.count('2') or s.count('3')):\n\tcan_move_hor = False\nif (s.count('1') or s.count('4') or s.count('7')) and (s.count('3') or s.count('6') or s.count('9')):\n\tcan_move_hor = False\nif can_move_ver or can_move_hor:\n\tprint('NO')\nelse:\n\tprint('YES')", "coords = {0: (1, 0), 1: (0, 3), 2: (1, 3), 3: (2, 3), 4: (0, 2), 5: (1, 2), 6: (2, 2), 7: (0, 1), 8: (1, 1), 9: (2, 1)}\r\nvalid_coords = set()\r\nfor elem in coords:\r\n valid_coords.add(coords[elem])\r\nn = input()\r\ns = [int(elem) for elem in input()]\r\nvectors = []\r\nfor i in range(len(s) - 1):\r\n t = [0, 0]\r\n t[0] = coords[s[i + 1]][0] - coords[s[i]][0]\r\n t[1] = coords[s[i + 1]][1] - coords[s[i]][1]\r\n vectors.append(t)\r\ncnt = 0\r\nfor elem in coords:\r\n start = coords[elem]\r\n faults = 0\r\n for v in vectors:\r\n new_start = (start[0] + v[0], start[1] + v[1])\r\n start = new_start\r\n if start not in valid_coords:\r\n faults += 1\r\n if faults == 0:\r\n cnt += 1\r\nif cnt == 1:\r\n print('YES')\r\nelse:\r\n print('NO')", "n=input()\r\ns=set(map(int,input()))\r\nf=lambda x: x&s!=set()\r\nprint(\"NO\" if sum([f({1,4,7,0}),f({1,2,3}),f({3,6,9,0}),f({7,0,9})])<4 else \"YES\")", "def gr(val):\n\tif val == -1:\n\t\treturn 3;\n\treturn val // 3;\n\ndef gc(val):\n\tif val == -1:\n\t\treturn 1;\n\treturn val % 3;\n\ndef isvalid(row, col):\n\tif row == 3:\n\t\treturn col == 1;\n\treturn row >= 0 and row <= 2 and col >= 0 and col <= 2\n\nn = int(input())\ndigits = [val - 1 for val in list(map(int, list(input())))]\nloc = [(gr(val), gc(val)) for val in digits]\n\ndef solve():\n\tfor rowoff in range(-5, 5):\n\t\tfor coloff in range(-5, 5):\n\t\t\tif rowoff == 0 and coloff == 0: continue\n\t\t\tworks = True\n\t\t\tfor r, c in loc:\n\t\t\t\tif not isvalid(r + rowoff, c + coloff):\n\t\t\t\t\tworks = False\n\t\t\tif works:\n\t\t\t\tprint(\"NO\")\n\t\t\t\treturn\n\tprint(\"YES\")\t\t\n\n\n\nsolve()\n\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\ns = input()[:-1]\r\n\r\nfor i in [['1','2','3'],['1','4','7','0'],['3','6','9','0'],['7','9','0']]:\r\n for j in i:\r\n if j in s:\r\n break\r\n else:\r\n print('NO')\r\n exit(0)\r\n\r\nprint('YES')", "dirs = {\r\n 'up': [4, 5, 6, 7, 8, 9, 0],\r\n 'down': [1, 2, 3, 4, 5, 6, 8],\r\n 'left': [2, 3, 5, 6, 8, 9],\r\n 'right': [1, 2, 4, 5, 7, 8],\r\n}\r\n\r\ninput()\r\nnum = input()\r\nds = [int(x) for x in num]\r\n\r\ndirsleft = {'up', 'down', 'left', 'right'}\r\n\r\nfor d in ds:\r\n for k, v in dirs.items():\r\n if d not in v and k in dirsleft:\r\n dirsleft.remove(k)\r\nprint('YES' if not dirsleft else 'NO')\r\n", "n = int(input())\r\na = input()\r\nL = [char for char in a]\r\nX = [[0,0],[-1,3],[0,3],[1,3],[-1,2],[0,2],[1,2],[-1,1],[0,1],[1,1]]\r\ndp = [[[0,0] for i in range(10)] for j in range(10)]\r\nfor i in range(10):\r\n for j in range(10):\r\n dp[i][j] = [X[j][0] - X[i][0],X[j][1] - X[i][1]]\r\nres = []\r\nfor k in range(n-1):\r\n x = dp[ord(a[k]) - ord('0')][ord(a[k+1]) - ord('0')]\r\n res.append(x)\r\nans = []\r\nfor i in range(10):\r\n in_0,in_1 = X[i][0],X[i][1]\r\n add = [i]\r\n for j in res:\r\n in_0,in_1 = in_0 + j[0],in_1 + j[1]\r\n for k in range(10):\r\n if X[k] == [in_0,in_1]:\r\n add.append(k)\r\n if len(add) == n:\r\n ans.append(add)\r\nif len(ans) == 1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "m = { 1: (1,1), 2: (1,2), 3: (1,3),\r\n\t 4: (2,1), 5: (2,2), 6: (2,3),\r\n\t 7: (3,1), 8: (3,2), 9: (3,3),\r\n\t 0: (4,2)\r\n\t}\r\n\r\nn = int( input() )\r\n\r\nk = input()\r\n\r\np = []\r\n\t\r\nfor i in k:\r\n\tp.append( m[ int(i)] )\r\n\r\ndef valid( i, j ):\r\n\tif i >= 1 and i <= 3 and j >= 1 and j <= 3:\r\n\t\treturn ( True )\r\n\treturn ( i == 4 and j == 2 )\r\n\t\r\ndx = [ -1, 1, 0, 0, -1, -1, 1, 1 ]\r\ndy = [ 0, 0, 1, -1, -1, 1, -1, 1 ]\r\n\r\nfor i in range( len(dx) ):\r\n\tfl = True\r\n\tfor z in range( len(p) ):\r\n\t\tx = p[z][0]\r\n\t\ty = p[z][1]\r\n\t\tif not valid( x + dx[i], y + dy[i] ):\r\n\t\t\tfl = False\r\n\t\t\tbreak\r\n\t\t\t\r\n\tif fl:\r\n\t\tprint( \"NO\" )\r\n\t\texit(0)\r\n\t\t\r\nprint( \"YES\" )", "input()\nl=list(map(int, input()))\n\ndef exe() :\n if 1 not in l and 2 not in l and 3 not in l :\n print('NO')\n return\n if 0 in l:\n print('YES')\n return\n if 1 not in l and 4 not in l and 7 not in l :\n print('NO')\n return\n if 3 not in l and 6 not in l and 9 not in l :\n print('NO')\n return\n if 7 not in l and 0 not in l and 9 not in l :\n print('NO')\n return\n print('YES')\n \nexe()", "n = int(input())\ns = list(map(int, list(input())))\n\nm = [(3, 1)]\n\nfor i in range(3):\n for j in range(3):\n m.append((i, j))\n\nadd = lambda x, a : (x[0] + a[0], x[1] + a[1])\nsub = lambda x, a : (x[0] - a[0], x[1] - a[1])\n\nmov = [sub(m[s[i]], m[s[i - 1]]) for i in range(1, n)]\nres = \"YES\"\n\nfor i in range(10):\n if s[0] == i:\n continue\n c = m[i]\n suc = True\n for mo in mov:\n c = add(c, mo)\n if c not in m:\n suc = False\n break\n if suc:\n res = \"NO\"\n\nprint(res)\n\n\n", "n = input()\r\ns = set(map(int, input()))\r\narr1 = {1, 4, 7, 0}\r\narr2 = {1, 2, 3}\r\narr3 = {3, 6, 9, 0}\r\narr4 = {7, 0, 9}\r\nprint(\"YES\" if all(map(lambda x: x&s != set(), (arr1, arr2, arr3, arr4))) else \"NO\")", "n = int(input())\r\np = [int(x) for x in list(input())]\r\n\r\nif (1 in p or 2 in p or 3 in p) and 0 in p:\r\n print('YES')\r\nelif 1 not in p and 2 not in p and 3 not in p:\r\n print('NO')\r\nelif 1 not in p and 4 not in p and 7 not in p:\r\n print('NO')\r\nelif 3 not in p and 6 not in p and 9 not in p:\r\n print('NO')\r\nelif 7 not in p and 0 not in p and 9 not in p:\r\n print('NO')\r\nelse:\r\n print('YES')\r\n", "import sys\r\nimport os\r\n\r\n\r\nn = int(input())\r\nstr = input()\r\n\r\nmat = [\r\n\t['1','2','3'],\r\n\t['4','5','6'],\r\n\t['7','8','9'],\r\n\t['-1','0','-1']\r\n]\r\n\r\n\r\nfor i in range(0,4):\r\n\tfor j in range(0,3):\r\n\t\tif (str[0] == mat[i][j]):\r\n\t\t\tcur = [i,j]\r\n\r\n\r\n\r\ndis = []\r\n\r\n\r\n\r\nfor z in range(1,n):\r\n\tfor i in range(0,4):\r\n\t\tfor j in range(0,3):\r\n\t\t\tif (str[z] == mat[i][j]):\r\n\t\t\t\tdis.append([i-cur[0],j-cur[1]])\r\n\t\t\t\tcur = [i,j]\r\n\r\n\r\n\r\ncnt = 0\r\n\r\nfor z in range(0,10):\r\n\t\r\n\t\tfor i in range(0,4):\r\n\t\t\tfor j in range(0,3):\r\n\t\t\t\tif (chr(z+ord(\"0\")) == mat[i][j]):\r\n\t\t\t\t\tcur = [i,j]\r\n\r\n\t\tflag = True\r\n\r\n\t\tfor i in range(0,len(dis)):\r\n\t\t\tcur[0] = cur[0] + dis[i][0]\r\n\t\t\tcur[1] = cur[1] + dis[i][1]\r\n\r\n\t\t\tif (cur[0]>=4 or cur[0] < 0 or cur[1]>=3 or cur[1] < 0 or mat[cur[0]][cur[1]] == \"-1\"):\r\n\t\t\t\tflag = False\r\n\t\t\t\tbreak\r\n\t\r\n\t\tif (flag):\r\n\t\t\tcnt = cnt + 1\r\n\r\n\r\nif (cnt==1):\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")\r\n\r\n\r\n\r\n\t\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "n = int(input())\ns = input()\na = []\nfor i in range(10):\n\ta.append(True)\nfor i in range(n):\n\tc = int(s[i])\n\ta[c] = False\ninc = 0\nif a[1] and a[2] and a[3]:\n\tinc =3\nif a[7] and a[9] and a[0]:\n\tinc =3\nif a[1] and a[4] and a[7] and a[0]:\n\tinc =1\nif a[3] and a[6] and a[9] and a[0]:\n\tinc =1\nif inc == 0:\n\tprint(\"YES\")\nelse:\n\tprint(\"NO\")\n", "n = int(input())\nL = [int(x) for x in input()]\n\nC = [None] * 10\np={}\nfor i in range(1,10):\n C[i] = ((i-1)//3, (i-1)%3)\n p[C[i]] = True\nC[0] = (3, 1)\np[C[0]] = True\ncnt = 0\npossib = []\nq = [(i, j) for i in range(-6, 7) for j in range(-6, 7)]\nfor base in q:\n gone = False\n for num in L:\n diff = C[num]\n nn = (diff[0] + base[0], diff[1] + base[1])\n if nn not in p:\n gone = True\n break\n if not gone:\n possib.append(base)\n cnt += 1\nif cnt == 1:\n print('YES')\nelse:\n print('NO')\n", "n = int(input())\nd = list(map(int,input()))\n\nl = all([i not in d for i in [1,4,7,0]])\nr = all([i not in d for i in [3,6,9,0]])\nu = all([i not in d for i in [1,2,3]])\nd = all([i not in d for i in [7,0,9]])\nprint('NO' if l or r or u or d else 'YES')\n", "input()\r\ns=set(map(int,input()))\r\nprint(\"YES\" if all(map(lambda x: x&s!=set(),({1,4,7,0},{1,2,3},{3,6,9,0},{7,0,9}))) else \"NO\")", "n = input()\r\nn = input()\r\nfor i in n :\r\n i = int(i)\r\n if i%3 == 0 :\r\n break\r\nelse :\r\n print(\"NO\")\r\n exit()\r\nfor i in n :\r\n i = int(i)\r\n if i%3 == 1 or i == 0 :\r\n break\r\nelse :\r\n print(\"NO\")\r\n exit()\r\nif '7' not in n and '0' not in n and '9' not in n :\r\n print(\"NO\")\r\n exit()\r\nif '1' not in n and '2' not in n and '3' not in n :\r\n print(\"NO\")\r\n exit()\r\nprint(\"YES\")", "n = int(input())\nd = list(map(int,input()))\n\nl = all([i not in d for i in [1, 4, 7, 0]])\nr = all([i not in d for i in [3, 6, 9, 0]])\nu = all([i not in d for i in [1, 2, 3]])\nd = all([i not in d for i in [7, 0, 9]])\nprint('NO' if l or r or u or d else 'YES')", "n = int(input())\r\ns = input()\r\n\r\nhaszero = 0\r\nfor x in s:\r\n if(x=='0'):\r\n haszero = 1\r\n\r\nhasup = 0\r\nhasleft = 0\r\nhasright = 0\r\nhasdown = 0\r\n\r\nfor x in s:\r\n if(x=='1')or(x=='2')or(x=='3'):\r\n hasup = 1\r\n if(x=='1')or(x=='4')or(x=='7'):\r\n hasleft = 1\r\n if(x=='3')or(x=='6')or(x=='9'):\r\n hasright = 1\r\n if(x=='7')or(x=='0')or(x=='9'):\r\n hasdown = 1\r\n\r\nif hasup and hasleft and hasright and hasdown:\r\n print('YES')\r\nelse:\r\n if hasup and haszero:\r\n print('YES')\r\n else:\r\n print('NO')", "n = int(input())\r\ns = input()\r\nl =[[[-1,-3],[0,-3],[1,-3],[-1,-2],[0,-2],[1,-2],[-1,-1],[0,-1],[1,-1],[0,0]] ,\r\n [[0,0],[1,0],[2,0],[0,1],[1,1],[2,1],[0,2],[1,2],[2,2],[2,3]] ,\r\n [[-1,0],[0,0],[1,0],[-1,1],[0,1],[1,1],[-1,2],[0,2],[1,2],[0,3]] ,\r\n [[-2,0],[-1,0],[0,0],[-2,1],[-1,1],[0,1],[-2,2],[-1,2],[0,2],[-1,3]] ,\r\n [[0,-1],[1,-1],[2,-1],[0,0],[1,0],[2,0],[0,1],[1,1],[2,1],[1,2]] ,\r\n [[-1,-1],[0,-1],[1,-1],[-1,0],[0,0],[1,0],[-1,1],[0,1],[1,1],[0,2]] ,\r\n [[-2,-1],[-1,-1],[0,-1],[-2,0],[-1,0],[0,0],[-2,1],[-1,1],[0,1],[-1,2]] ,\r\n [[0,-2],[1,-2],[2,-2],[0,-1],[1,-1],[2,-1],[0,0],[1,0],[2,0],[1,1]] ,\r\n [[-1,-2],[0,-2],[1,-2],[-1,-1],[0,-1],[1,-1],[-1,0],[0,0],[1,0],[0,1]] ,\r\n [[-2,-2],[-1,-2],[0,-2],[-2,-1],[-1,-1],[0,-1],[-2,0],[-1,0],[0,0],[-1,1]] ,\r\n ]\r\npos = [[1,3],[0,0],[1,0],[2,0],[0,1],[1,1],[2,1],[0,2],[1,2],[2,2]]\r\ndef bad(i,j):\r\n if i < 0 or j < 0:\r\n return 1\r\n if i > 2 or j > 3:\r\n return 1\r\n if [i,j]==[0,3] or [i,j]==[2,3]:\r\n return 1\r\n return 0\r\nll = []\r\nfor i in range(n-1):\r\n x,y=int(s[i]),int(s[i+1])-1\r\n\r\n ll.append(l[x][y])\r\n\r\nres= 'YES'\r\nz = []\r\nfor num in range(10):\r\n i,j=pos[num][0],pos[num][1]\r\n c = 1\r\n for k in range(n-1):\r\n i+=ll[k][0]\r\n j+=ll[k][1]\r\n if bad(i,j):\r\n c = 0\r\n z.append(c)\r\nz[int(s[0])]=0\r\n\r\nif 1 in z :\r\n res = 'NO'\r\nprint(res)\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\nx = [3, 0, 0, 0, 1, 1, 1, 2, 2, 2]\r\ny = [1, 0, 1, 2, 0, 1, 2, 0, 1, 2]\r\ns0 = set()\r\nfor i, j in zip(x, y):\r\n s0.add((i, j))\r\nc = 0\r\nfor dx in range(-5, 6):\r\n for dy in range(-5, 6):\r\n ok = 1\r\n for k in s:\r\n x0, y0 = x[k - 48] + dx, y[k - 48] + dy\r\n if not (x0, y0) in s0:\r\n ok = 0\r\n break\r\n if ok:\r\n c += 1\r\nans = \"YES\" if c == 1 else \"NO\"\r\nprint(ans)", "from sys import exit\r\n\r\ndef move_l(num, n):\r\n ww = [(1,4,7), (2,5,8,0), (3,6,9)]\r\n hh = [(1,2,3), (4,5,6), (7,8,9), (0,)]\r\n for c in num:\r\n c = int(c)\r\n for h in hh:\r\n if c in h:\r\n if h.index(c) - n < 0:\r\n return False\r\n return True\r\n\r\ndef move_r(num, n):\r\n ww = [(1,4,7), (2,5,8,0), (3,6,9)]\r\n hh = [(1,2,3), (4,5,6), (7,8,9), (0,)]\r\n for c in num:\r\n c = int(c)\r\n for h in hh:\r\n if c in h:\r\n if h.index(c) + n >= len(h):\r\n return False\r\n return True\r\n\r\ndef move_u(num, n):\r\n ww = [(1,4,7), (2,5,8,0), (3,6,9)]\r\n for c in num:\r\n c = int(c)\r\n for w in ww:\r\n if c in w:\r\n if w.index(c) - n < 0:\r\n return False\r\n return True\r\n\r\ndef move_d(num, n):\r\n ww = [(1,4,7), (2,5,8,0), (3,6,9)]\r\n for c in num:\r\n c = int(c)\r\n for w in ww:\r\n if c in w:\r\n if w.index(c) + n >= len(w):\r\n return False\r\n return True\r\n\r\n\r\nn = input()\r\nnum = input()\r\nfor i in (1, 2):\r\n if move_l(num, i):\r\n print('NO')\r\n exit(0)\r\nfor i in (1, 2):\r\n if move_r(num, i):\r\n print('NO')\r\n exit(0)\r\nfor i in (1, 2, 3):\r\n if move_u(num, i):\r\n print('NO')\r\n exit(0)\r\nfor i in (1, 2, 3):\r\n if move_d(num, i):\r\n print('NO')\r\n exit(0)\r\nprint('YES')\r\n\r\n \r\n", "#! /usr/bin/env python3\n\nimport sys\n\nn = int(input())\ns = list(map(lambda x: int(x) - int('0'), input()))\n\nd = [(1, 3)] + [(i, j) for j in range(3) for i in range(3)]\n\nfor u in range(10):\n if u == s[0]:\n continue\n x, y = d[u]\n for i in range(1, n):\n dx, dy = (d[s[i]][0] - d[s[i - 1]][0], d[s[i]][1] - d[s[i - 1]][1])\n x += dx\n y += dy\n if (x, y) not in d:\n break\n else:\n print(u, file=sys.stderr)\n print('NO')\n sys.exit(0)\n\nprint('YES')\n", "n = input()\r\ns = input()\r\n\r\nup = len([i for i in ['1', '2', '3'] if i in s]) == 0\r\nright = len([i for i in ['3', '6', '9', '0'] if i in s]) == 0\r\nleft = len([i for i in ['1', '4', '7', '0'] if i in s]) == 0\r\ndown = len([i for i in ['7', '9', '0'] if i in s]) == 0\r\n\r\nok = not(up or right or left or down)\r\nif ok:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "from sys import setrecursionlimit, exit\nfrom math import ceil, floor, acos, pi\nfrom string import ascii_lowercase, ascii_uppercase, digits\nfrom fractions import gcd\nfrom functools import reduce\nsetrecursionlimit(10**8)\nRI=lambda x=' ': list(map(int,input().rstrip().split(x)))\nRS=lambda x=' ': input().rstrip().split(x)\ndX= [-1, 1, 0, 0,-1, 1,-1, 1]\ndY= [ 0, 0,-1, 1, 1,-1,-1, 1]\nmod=int(1e9+7)\neps=1e-6\nMAX=1010\n#################################################\nn=RI()[0]\ns=RS()[0]\npos={}\nacceptable={}\nfor i in range(1,10):\n pos[i]=((i-1)//3 +1, (i-1)%3 + 1)\npos[0]=(4,2)\nfor v in pos.values():\n acceptable[v]=1\ns=list(map(int, list(s)))\ncnt=0\nfor st in acceptable:\n curr=list(st)\n flag=1\n for i in range(1, len(s)):\n curr[0]+=pos[s[i]][0]-pos[s[i-1]][0]\n curr[1]+=pos[s[i]][1]-pos[s[i-1]][1]\n if tuple(curr) not in acceptable:\n flag=0\n if flag:\n cnt+=1\nprint(\"YES\" if cnt==1 else \"NO\")\n \n \n \n", "n = int(input())\ns = input()\n\ngroups = [set('4567890'), set('1234568'), set('235689'), set('124578')]\n\nans = True\n\nfor group in groups:\n if all(c in group for c in s):\n ans = False\n\nprint('YES' if ans else 'NO')\n" ]

[ "import sys\r\nfrom collections import deque\r\ninput = sys.stdin.readline\r\ndef fgh():\r\n return [int(xx) for xx in input().split()]\r\ndef fg():\r\n return int(input())\r\nn, ok = fgh()\r\na = fgh()\r\nif max(a) >= ok:\r\n print(0)\r\n quit()\r\nif n == 2:\r\n print((ok - a[1] + a[0] - 1) // a[0])\r\n quit()\r\nfac = [1]\r\nfor i in range(1, 200):\r\n fac.append(fac[-1] * i)\r\nl = 0\r\nr = 10 ** 18 + 7\r\nwhile r - l > 1:\r\n m = (l + r) // 2\r\n ans = 0\r\n for i in range(n):\r\n if a[i]:\r\n nm = m - 1 + n - i - 1\r\n k = n - i - 1\r\n if nm - k <= 10:\r\n q = 1\r\n for ii in range(nm, nm - (nm - k), -1):\r\n q *= ii\r\n ans += q // fac[nm - k] * a[i]\r\n elif k <= 10:\r\n q = 1\r\n for ii in range(nm, nm - k, -1):\r\n q *= ii\r\n ans += q // fac[k] * a[i]\r\n else:\r\n if nm >= 200:\r\n r = m\r\n break\r\n else:\r\n ans += fac[nm] // fac[k] // fac[nm - k] * a[i]\r\n else:\r\n if ans >= ok:\r\n r = m\r\n else:\r\n l = m\r\nprint(r)\r\n\r\n", "import sys\r\nn, k = map(int, input().split())\r\nar = []\r\nbr = map(int, input().split())\r\nfor x in br:\r\n if(x > 0 or len(ar) > 0):\r\n ar.append(x)\r\n\r\nif(max(ar) >= k):\r\n print(0)\r\nelif len(ar) == 2:\r\n print((k - ar[1] + ar[0] - 1)//ar[0])\r\nelif len(ar) == 3:\r\n ini, fin = 0, 10**18\r\n while(ini < fin):\r\n mid = (ini + fin)//2\r\n if(ar[2] + ar[1]*mid + ar[0]*mid*(mid + 1)//2 >= k):\r\n fin = mid\r\n else:\r\n ini = mid + 1\r\n print(ini)\r\nelse:\r\n ans = 0;\r\n while(ar[-1] < k):\r\n ans += 1\r\n for i in range(1, len(ar)):\r\n ar[i] += ar[i - 1]\r\n print(ans)\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\ndef matmul(a, b, n):\r\n c = []\r\n for i in range(n):\r\n for j in range(n):\r\n x = 0\r\n for k in range(n):\r\n x += a[n * i + k] * b[n * k + j]\r\n c.append(x)\r\n return c\r\n\r\nn, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\na.reverse()\r\nwhile not a[-1]:\r\n a.pop()\r\na.reverse()\r\nn = len(a)\r\nif max(a) >= k:\r\n ans = 0\r\nelif n >= 5:\r\n ans = 0\r\n ok = 1\r\n while ok:\r\n ans += 1\r\n for i in range(1, n):\r\n a[i] += a[i - 1]\r\n if a[i] >= k:\r\n ok = 0\r\n break\r\nelse:\r\n x, y = [], []\r\n for i in range(n):\r\n for j in range(n):\r\n x.append(max(0, min(1, i - j + 1)))\r\n y.append(min(1, abs(i - j)) ^ 1)\r\n pow2 = [1]\r\n for _ in range(63):\r\n pow2.append(2 * pow2[-1])\r\n xx = []\r\n xx.append(list(x))\r\n for _ in range(63):\r\n x = matmul(x, x, n)\r\n xx.append(list(x))\r\n ans = 0\r\n for i in range(63, -1, -1):\r\n xi = list(xx[i])\r\n y0 = matmul(y, xi, n)\r\n s = 0\r\n ok = 1\r\n for j in range(1, n + 1):\r\n s += a[-j] * y0[-j]\r\n if s >= k:\r\n ok = 0\r\n break\r\n if ok:\r\n ans ^= pow2[i]\r\n y = list(y0)\r\n ans += 1\r\nprint(ans)", "import sys\r\n\r\ndef mul(a, b):\r\n #print(a, b)\r\n n = len(a)\r\n m = [[0 for j in range(n)] for i in range(n)]\r\n for i in range(n):\r\n for j in range(n):\r\n for k in range(n):\r\n m[i][j] += a[i][k] * b[k][j]\r\n return m\r\n\r\nn, k = [int(i) for i in input().split(\" \")]\r\na = [int(i) for i in input().split(\" \")]\r\nif max(a) >= k:\r\n print(0)\r\n sys.exit(0)\r\n\r\na0 = [] # pole bez tych nul na zaciatku, ktore su zbytocne\r\ns = 0\r\nfor i in range(n):\r\n s += a[i]\r\n if s > 0:\r\n a0.append(a[i])\r\nn = len(a0)\r\nif n > 30: # pole je velke, po najviac 50 iteraciach dojdeme k odpovedi\r\n it = 0\r\n while True:\r\n it += 1\r\n for j in range(1, n):\r\n a0[j] += a0[j-1]\r\n if a0[j] >= k:\r\n print(it)\r\n sys.exit(0)\r\nelse: # pole je male, spustime nieco typu bs + umocnovanie matic\r\n m = [[[int(i >= j) for j in range(n)] for i in range(n)]]\r\n for l in range(0, 62):\r\n m.append(mul(m[-1], m[-1]))\r\n #print(m[-1])\r\n #print(a0)\r\n ans = 0\r\n u = [[int(i == j) for j in range(n)] for i in range(n)]\r\n for l in range(62, -1, -1):\r\n u2 = mul(u, m[l])\r\n val = 0\r\n for i in range(0, n):\r\n val += a0[i] * u2[-1][i]\r\n #print(val)\r\n if val < k:\r\n u = u2\r\n ans += 2**l\r\n print(ans + 1)\r\n", "from io import BytesIO, IOBase\r\nimport sys\r\nimport os\r\n\r\n# import time\r\nimport bisect\r\n# import functools\r\n# import math\r\n# import random\r\n# import re\r\n# from collections import Counter, defaultdict, deque\r\nfrom copy import deepcopy\r\nfrom functools import cmp_to_key, lru_cache, reduce\r\n# from heapq import heapify, heappop, heappush, heappushpop, nlargest, nsmallest\r\nfrom itertools import accumulate, combinations, permutations\r\nfrom operator import add, iand, ior, itemgetter, mul, xor\r\n# from string import ascii_lowercase, ascii_uppercase\r\n# from typing import *\r\n\r\nBUFSIZE = 4096\r\nclass FastIO(IOBase):\r\n newlines = 0\r\n\r\n def __init__(self, file):\r\n self._fd = file.fileno()\r\n self.buffer = BytesIO()\r\n self.writable = \"x\" in file.mode or \"r\" not in file.mode\r\n self.write = self.buffer.write if self.writable else None\r\n\r\n def read(self):\r\n while True:\r\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\r\n if not b:\r\n break\r\n ptr = self.buffer.tell()\r\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\r\n self.newlines = 0\r\n return self.buffer.read()\r\n\r\n def readline(self):\r\n while self.newlines == 0:\r\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\r\n self.newlines = b.count(b\"\\n\") + (not b)\r\n ptr = self.buffer.tell()\r\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\r\n self.newlines -= 1\r\n return self.buffer.readline()\r\n\r\n def flush(self):\r\n if self.writable:\r\n os.write(self._fd, self.buffer.getvalue())\r\n self.buffer.truncate(0), self.buffer.seek(0)\r\n\r\nclass IOWrapper(IOBase):\r\n def __init__(self, file):\r\n self.buffer = FastIO(file)\r\n self.flush = self.buffer.flush\r\n self.writable = self.buffer.writable\r\n self.write = lambda s: self.buffer.write(s.encode(\"ascii\"))\r\n self.read = lambda: self.buffer.read().decode(\"ascii\")\r\n self.readline = lambda: self.buffer.readline().decode(\"ascii\")\r\n\r\nsys.stdin = IOWrapper(sys.stdin)\r\nsys.stdout = IOWrapper(sys.stdout)\r\ninput = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\r\n\r\ndef I():\r\n return input()\r\n\r\ndef II():\r\n return int(input())\r\n\r\ndef MII():\r\n return map(int, input().split())\r\n\r\ndef LI():\r\n return list(input().split())\r\n\r\ndef LII():\r\n return list(map(int, input().split()))\r\n\r\ndef GMI():\r\n return map(lambda x: int(x) - 1, input().split())\r\n\r\ndef LGMI():\r\n return list(map(lambda x: int(x) - 1, input().split()))\r\n\r\ninf = float('inf')\r\n\r\n# from types import GeneratorType\r\n\r\n# def bootstrap(f, stack=[]):\r\n# def wrappedfunc(*args, **kwargs):\r\n# if stack:\r\n# return f(*args, **kwargs)\r\n# else:\r\n# to = f(*args, **kwargs)\r\n# while True:\r\n# if type(to) is GeneratorType:\r\n# stack.append(to)\r\n# to = next(to)\r\n# else:\r\n# stack.pop()\r\n# if not stack:\r\n# break\r\n# to = stack[-1].send(to)\r\n# return to\r\n# return wrappedfunc\r\n\r\n# RnumsNDOM = random.getrandbits(32)\r\n\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__() ^ RnumsNDOM\r\n\r\nn, k = MII()\r\nnums = LII()\r\n\r\n\r\nif max(nums) >= k:\r\n print(0)\r\n exit()\r\nnums.reverse()\r\nwhile nums[-1] == 0: nums.pop()\r\n\r\nif len(nums) <= 3:\r\n def check():\r\n val = 0\r\n for i in range(len(nums)):\r\n if i == 0: val += nums[i]\r\n elif i == 1: val += nums[i]*mid\r\n elif i == 2: val += nums[i]*mid*(mid+1)//2\r\n if val >= k: return True\r\n return False\r\n ng = 0\r\n ok = 10**18\r\n while ok - ng > 1:\r\n mid = (ok+ng)//2\r\n if check(): ok = mid\r\n else: ng = mid\r\n print(ok)\r\nelse:\r\n for ans in range(1,10**9):\r\n for i in range(len(nums)-2,-1,-1):\r\n nums[i] += nums[i+1]\r\n if nums[0] >= k:\r\n print(ans)\r\n exit()", "n, k = map(int, input().split(\" \"))\r\nl = map(int, input().split(\" \"))\r\n\r\nv = []\r\nfor x in l:\r\n if x != 0 or v:\r\n v.append(x)\r\n\r\ndef bruteforce(v, k):\r\n ret = 0\r\n while True:\r\n accm = 0\r\n for i in range(len(v)):\r\n if v[i] >= k: return ret\r\n accm += v[i]\r\n v[i] = accm\r\n ret += 1\r\n return ret\r\n\r\ndef smarty(v, k):\r\n def triang(x):\r\n return x*(x+1)//2\r\n l, r = 0, 10**18\r\n ans = 10**18\r\n while l<=r:\r\n h = (l+r)//2\r\n f0 = v[0]\r\n f1 = h*v[0] + v[1]\r\n f2 = triang(h)*v[0] + h*v[1] + v[0] if n == 3 else 0\r\n if max(f0, f1, f2) >= k:\r\n r = h-1\r\n ans = min(ans, h)\r\n else:\r\n l = h+1\r\n return ans\r\n\r\nn = len(v)\r\nif n>3:\r\n print(bruteforce(v, k))\r\nelse:\r\n print(smarty(v, k))\r\n", "import sys\r\nfrom time import sleep\r\n\r\ndef increment(a):\r\n for i in range(1, n):\r\n a[i] += a[i-1]\r\n\r\nclass DimensionError(ValueError):\r\n pass\r\n\r\nclass Matrix:\r\n def __init__(self, m, n, data=None):\r\n self.m = m\r\n self.n = n\r\n self.mn = m * n\r\n if data is None:\r\n self.data = [0] * self.mn\r\n else:\r\n if len(data) == self.mn:\r\n self.data = data\r\n else:\r\n raise DimensionError()\r\n\r\n def __repr__(self):\r\n return 'Matrix({}, {}, {})'.format(self.m, self.n, self.data)\r\n\r\n def __call__(self, i, j):\r\n if i < 0 or i >= self.m or j < 0 or j >= self.n:\r\n raise IndexError(\"({}, {})\".format(i, j))\r\n return self.data[i * self.n + j]\r\n\r\n def set_elem(self, i, j, x):\r\n if i < 0 or i >= self.m or j < 0 or j >= self.n:\r\n raise IndexError(\"({}, {})\".format(i, j))\r\n self.data[i * self.n + j] = x\r\n\r\n def add_to_elem(self, i, j, x):\r\n if i < 0 or i >= self.m or j < 0 or j >= self.n:\r\n raise IndexError(\"({}, {})\".format(i, j))\r\n self.data[i * self.n + j] += x\r\n\r\n def last(self):\r\n return self.data[-1]\r\n\r\n def scalar_mul_ip(self, s):\r\n for i in range(len(data)):\r\n self.data[i] *= s\r\n return self\r\n\r\n def scalar_mul(self, s):\r\n data2 = [x * s for x in self.data]\r\n return Matrix(self.m, self.n, data2)\r\n\r\n def matrix_mul(self, B):\r\n if self.n != B.m:\r\n raise DimensionError()\r\n m = self.m\r\n p = self.n\r\n n = B.n\r\n C = Matrix(m, n)\r\n for i in range(m):\r\n for j in range(n):\r\n for k in range(p):\r\n C.add_to_elem(i, j, self(i, k) * B(k, j))\r\n return C\r\n\r\n def __imul__(self, x):\r\n if isinstance(x, int):\r\n return self.scalar_mul_ip(x)\r\n # Matrix multiplication will be handled by __mul__\r\n else:\r\n return NotImplemented\r\n\r\n def __mul__(self, x):\r\n if isinstance(x, int):\r\n return self.scalar_mul(x)\r\n elif isinstance(x, Matrix):\r\n return self.matrix_mul(x)\r\n else:\r\n return NotImplemented\r\n\r\n def __rmul__(self, x):\r\n if isinstance(x, int):\r\n return self.scalar_mul(x)\r\n # Matrix multiplication will be handled by __mul__\r\n else:\r\n return NotImplemented\r\n\r\nif __name__ == '__main__':\r\n n, k = [int(x) for x in input().split()]\r\n a = [int(x) for x in input().split()]\r\n assert(len(a) == n)\r\n for i, x in enumerate(a):\r\n if x > 0:\r\n break\r\n if i > 0:\r\n a = a[i:]\r\n n = len(a)\r\n\r\n if max(a) >= k:\r\n print(0)\r\n sys.exit(0)\r\n else:\r\n increment(a)\r\n\r\n if n > 10:\r\n p = 0\r\n while a[-1] < k:\r\n increment(a)\r\n p += 1\r\n \"\"\"\r\n if p % 100 == 0 and sys.stderr.isatty():\r\n print(' ' * 40, end='\\r', file=sys.stderr)\r\n print(p, a[-1], end='\\r', file=sys.stderr)\r\n \"\"\"\r\n \"\"\"\r\n if sys.stderr.isatty():\r\n print(file=sys.stderr)\r\n \"\"\"\r\n print(p+1)\r\n sys.exit(0)\r\n\r\n if a[-1] >= k:\r\n print(1)\r\n sys.exit(0)\r\n\r\n\r\n A = Matrix(n, n)\r\n for i in range(n):\r\n for j in range(i+1):\r\n A.set_elem(i, j, 1)\r\n X = Matrix(n, 1, a)\r\n\r\n pA = [A] # pA[i] = A^(2^i)\r\n\r\n i=0\r\n while (pA[i]*X).last() < k:\r\n # print('len(pA) =', len(pA), file=sys.stderr)\r\n # print('pA[-1] =', pA[-1].data, file=sys.stderr)\r\n pA.append(pA[i] * pA[i])\r\n i += 1\r\n # print('pA computed', file=sys.stderr)\r\n B = Matrix(n, n)\r\n for i in range(n):\r\n B.set_elem(i, i, 1)\r\n p = 0\r\n for i, A2 in reversed(list(enumerate(pA))):\r\n # invariant: B = A^p and B is a power of A such that (B*X).last() < k\r\n B2 = B * A2\r\n if (B2 * X).last() < k:\r\n p += (1 << i)\r\n B = B2\r\n # Now increment X so that X.last() becomes >= k\r\n X = B * X\r\n p += 1\r\n increment(X.data)\r\n # Print p+1 because we had incremented X in the beginning of program\r\n print(p+1)\r\n", "N,K=map(int,input().split())\nA=list(map(int,input().split()))\n\nif max(A) >= K:\n print(0)\n exit()\nA.reverse()\nwhile A[-1] == 0: A.pop()\n\nif len(A) <= 3:\n def check(K,A,x):\n val = 0\n for i in range(len(A)):\n if i == 0: val += A[i]\n elif i == 1: val += A[i]*x\n elif i == 2: val += A[i]*x*(x+1)//2\n if val >= K: return True\n return False\n ng = 0\n ok = 10**18\n while ok - ng > 1:\n mid = (ok+ng)//2\n if check(K,A,mid): ok = mid\n else: ng = mid\n print(ok)\nelse:\n for ans in range(1,10**9):\n for i in range(len(A)-2,-1,-1):\n A[i] += A[i+1]\n if A[0] >= K:\n print(ans)\n exit()\n", "from itertools import *\r\nn, k = map(int, input().split())\r\n*A, = map(int, input().split())\r\nalc = 0\r\nfor v in A:\r\n if v > 0:\r\n alc += 1\r\nif max(A) >= k:\r\n print(0)\r\nelif alc <= 20:\r\n l = 0\r\n r = int(1e18)\r\n while l + 1 < r:\r\n m = (l + r) // 2\r\n s = 0\r\n for i in range(n):\r\n if A[i] > 0:\r\n s2 = 1\r\n for j in range(n - i - 1):\r\n s2 *= m + j\r\n s2 //= j + 1\r\n if s2 >= k:\r\n break\r\n s += s2 * A[i]\r\n if s >= k:\r\n break\r\n if s >= k:\r\n r = m\r\n else:\r\n l = m\r\n print(r)\r\nelse:\r\n ans = 0\r\n while True:\r\n ans += 1\r\n for i in range(1, n):\r\n A[i] += A[i - 1]\r\n if A[-1] >= k:\r\n break\r\n print(ans)\r\n \r\n" ]

[ "standard_input, packages, dfs, hashing = 1, 1, 0, 0\r\n\r\nif standard_input:\r\n import sys\r\n input = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\r\n \r\n def I():\r\n return input()\r\n\r\n def II():\r\n return int(input())\r\n\r\n def MII():\r\n return map(int, input().split())\r\n\r\n def LI():\r\n return list(input().split())\r\n\r\n def LII():\r\n return list(map(int, input().split()))\r\n\r\n def LFI():\r\n return list(map(float, input().split()))\r\n\r\n def GMI():\r\n return map(lambda x: int(x) - 1, input().split())\r\n\r\n def LGMI():\r\n return list(map(lambda x: int(x) - 1, input().split()))\r\n\r\n inf = float('inf')\r\n\r\nif packages:\r\n from io import BytesIO, IOBase\r\n import math\r\n\r\n import random\r\n import os\r\n\r\n import bisect\r\n import typing\r\n from collections import Counter, defaultdict, deque\r\n from copy import deepcopy\r\n from functools import cmp_to_key, lru_cache, reduce\r\n from heapq import heapify, heappop, heappush, heappushpop, nlargest, nsmallest\r\n from itertools import accumulate, combinations, permutations, count, product\r\n from operator import add, iand, ior, itemgetter, mul, xor\r\n from string import ascii_lowercase, ascii_uppercase, ascii_letters\r\n from typing import *\r\n BUFSIZE = 4096\r\n\r\n class FastIO(IOBase):\r\n newlines = 0\r\n\r\n def __init__(self, file):\r\n self._fd = file.fileno()\r\n self.buffer = BytesIO()\r\n self.writable = \"x\" in file.mode or \"r\" not in file.mode\r\n self.write = self.buffer.write if self.writable else None\r\n\r\n def read(self):\r\n while True:\r\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\r\n if not b:\r\n break\r\n ptr = self.buffer.tell()\r\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\r\n self.newlines = 0\r\n return self.buffer.read()\r\n\r\n def readline(self):\r\n while self.newlines == 0:\r\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\r\n self.newlines = b.count(b\"\\n\") + (not b)\r\n ptr = self.buffer.tell()\r\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\r\n self.newlines -= 1\r\n return self.buffer.readline()\r\n\r\n def flush(self):\r\n if self.writable:\r\n os.write(self._fd, self.buffer.getvalue())\r\n self.buffer.truncate(0), self.buffer.seek(0)\r\n\r\n class IOWrapper(IOBase):\r\n def __init__(self, file):\r\n self.buffer = FastIO(file)\r\n self.flush = self.buffer.flush\r\n self.writable = self.buffer.writable\r\n self.write = lambda s: self.buffer.write(s.encode(\"ascii\"))\r\n self.read = lambda: self.buffer.read().decode(\"ascii\")\r\n self.readline = lambda: self.buffer.readline().decode(\"ascii\")\r\n\r\n sys.stdin = IOWrapper(sys.stdin)\r\n sys.stdout = IOWrapper(sys.stdout)\r\n\r\nif dfs:\r\n from types import GeneratorType\r\n\r\n def bootstrap(f, stack=[]):\r\n def wrappedfunc(*args, **kwargs):\r\n if stack:\r\n return f(*args, **kwargs)\r\n else:\r\n to = f(*args, **kwargs)\r\n while True:\r\n if type(to) is GeneratorType:\r\n stack.append(to)\r\n to = next(to)\r\n else:\r\n stack.pop()\r\n if not stack:\r\n break\r\n to = stack[-1].send(to)\r\n return to\r\n return wrappedfunc\r\n\r\nif hashing:\r\n RANDOM = random.getrandbits(20)\r\n class Wrapper(int):\r\n def __init__(self, x):\r\n int.__init__(x)\r\n\r\n def __hash__(self):\r\n return super(Wrapper, self).__hash__() ^ RANDOM\r\n\r\nread_from_file = 0\r\nif read_from_file:\r\n file = open(\"input.txt\", \"r\").readline().strip()[1:-1]\r\n fin = open(file, 'r')\r\n input = lambda: fin.readline().strip()\r\n output_file = open(\"output.txt\", \"w\")\r\n def fprint(*args, **kwargs):\r\n print(*args, **kwargs, file=output_file)\r\n\r\npoly = 1\r\n\r\nif poly:\r\n\r\n # 求平方根\r\n def Tonelli_Shanks(N, p):\r\n if pow(N, p >> 1, p) == p - 1:\r\n return None\r\n if p%4==3:\r\n return pow(N, (p + 1) // 4, p)\r\n for nonresidue in range(1, p):\r\n if pow(nonresidue, p>>1, p)==p-1:\r\n break\r\n pp = p - 1\r\n cnt = 0\r\n while pp % 2 == 0:\r\n pp //= 2\r\n cnt += 1\r\n s = pow(N, pp, p)\r\n retu = pow(N, (pp + 1) // 2,p)\r\n for i in range(cnt - 2, -1, -1):\r\n if pow(s, 1 <<i, p) == p - 1:\r\n s *= pow(nonresidue, p >> 1 + i, p)\r\n s %= p\r\n retu *= pow(nonresidue, p >> 2 + i, p)\r\n retu %= p\r\n return retu\r\n\r\n mod = 998244353\r\n imag = 911660635\r\n iimag = 86583718\r\n rate2 = (911660635, 509520358, 369330050, 332049552, 983190778, 123842337, 238493703, 975955924, 603855026, 856644456, 131300601,\r\n 842657263, 730768835, 942482514, 806263778, 151565301, 510815449, 503497456, 743006876, 741047443, 56250497, 867605899)\r\n irate2 = (86583718, 372528824, 373294451, 645684063, 112220581, 692852209, 155456985, 797128860, 90816748, 860285882, 927414960,\r\n 354738543, 109331171, 293255632, 535113200, 308540755, 121186627, 608385704, 438932459, 359477183, 824071951, 103369235)\r\n rate3 = (372528824, 337190230, 454590761, 816400692, 578227951, 180142363, 83780245, 6597683, 70046822, 623238099,\r\n 183021267, 402682409, 631680428, 344509872, 689220186, 365017329, 774342554, 729444058, 102986190, 128751033, 395565204)\r\n irate3 = (509520358, 929031873, 170256584, 839780419, 282974284, 395914482, 444904435, 72135471, 638914820, 66769500,\r\n 771127074, 985925487, 262319669, 262341272, 625870173, 768022760, 859816005, 914661783, 430819711, 272774365, 530924681)\r\n\r\n def butterfly(a):\r\n n = len(a)\r\n h = (n - 1).bit_length()\r\n len_ = 0\r\n while len_ < h:\r\n if h - len_ == 1:\r\n p = 1 << (h - len_ - 1)\r\n rot = 1\r\n for s in range(1 << len_):\r\n offset = s << (h - len_)\r\n for i in range(p):\r\n l = a[i + offset]\r\n r = a[i + offset + p] * rot % mod\r\n a[i + offset] = (l + r) % mod\r\n a[i + offset + p] = (l - r) % mod\r\n if s + 1 != 1 << len_:\r\n rot *= rate2[(~s & -~s).bit_length() - 1]\r\n rot %= mod\r\n len_ += 1\r\n else:\r\n p = 1 << (h - len_ - 2)\r\n rot = 1\r\n for s in range(1 << len_):\r\n rot2 = rot * rot % mod\r\n rot3 = rot2 * rot % mod\r\n offset = s << (h - len_)\r\n for i in range(p):\r\n a0 = a[i + offset]\r\n a1 = a[i + offset + p] * rot\r\n a2 = a[i + offset + p * 2] * rot2\r\n a3 = a[i + offset + p * 3] * rot3\r\n a1na3imag = (a1 - a3) % mod * imag\r\n a[i + offset] = (a0 + a2 + a1 + a3) % mod\r\n a[i + offset + p] = (a0 + a2 - a1 - a3) % mod\r\n a[i + offset + p * 2] = (a0 - a2 + a1na3imag) % mod\r\n a[i + offset + p * 3] = (a0 - a2 - a1na3imag) % mod\r\n if s + 1 != 1 << len_:\r\n rot *= rate3[(~s & -~s).bit_length() - 1]\r\n rot %= mod\r\n len_ += 2\r\n\r\n def butterfly_inv(a):\r\n n = len(a)\r\n h = (n - 1).bit_length()\r\n len_ = h\r\n while len_:\r\n if len_ == 1:\r\n p = 1 << (h - len_)\r\n irot = 1\r\n for s in range(1 << (len_ - 1)):\r\n offset = s << (h - len_ + 1)\r\n for i in range(p):\r\n l = a[i + offset]\r\n r = a[i + offset + p]\r\n a[i + offset] = (l + r) % mod\r\n a[i + offset + p] = (l - r) * irot % mod\r\n if s + 1 != (1 << (len_ - 1)):\r\n irot *= irate2[(~s & -~s).bit_length() - 1]\r\n irot %= mod\r\n len_ -= 1\r\n else:\r\n p = 1 << (h - len_)\r\n irot = 1\r\n for s in range(1 << (len_ - 2)):\r\n irot2 = irot * irot % mod\r\n irot3 = irot2 * irot % mod\r\n offset = s << (h - len_ + 2)\r\n for i in range(p):\r\n a0 = a[i + offset]\r\n a1 = a[i + offset + p]\r\n a2 = a[i + offset + p * 2]\r\n a3 = a[i + offset + p * 3]\r\n a2na3iimag = (a2 - a3) * iimag % mod\r\n a[i + offset] = (a0 + a1 + a2 + a3) % mod\r\n a[i + offset + p] = (a0 - a1 + a2na3iimag) * irot % mod\r\n a[i + offset + p * 2] = (a0 + a1 - a2 - a3) * irot2 % mod\r\n a[i + offset + p * 3] = (a0 - a1 - a2na3iimag) * irot3 % mod\r\n if s + 1 != (1 << (len_ - 2)):\r\n irot *= irate3[(~s & -~s).bit_length() - 1]\r\n irot %= mod\r\n len_ -= 2\r\n\r\n # 积分\r\n def integrate(a):\r\n a = a.copy()\r\n n = len(a)\r\n assert n > 0\r\n a.pop()\r\n a.insert(0, 0)\r\n inv = [1, 1]\r\n for i in range(2, n):\r\n inv.append(-inv[mod % i] * (mod // i) % mod)\r\n a[i] = a[i] * inv[i] % mod\r\n return a\r\n\r\n # 求导\r\n def differentiate(a):\r\n n = len(a)\r\n assert n > 0\r\n for i in range(2, n):\r\n a[i] = a[i] * i % mod\r\n a.pop(0)\r\n a.append(0)\r\n return a\r\n\r\n # 卷积\r\n def convolution_naive(a, b):\r\n n = len(a)\r\n m = len(b)\r\n ans = [0] * (n + m - 1)\r\n if n < m:\r\n for j in range(m):\r\n for i in range(n):\r\n ans[i + j] = (ans[i + j] + a[i] * b[j]) % mod\r\n else:\r\n for i in range(n):\r\n for j in range(m):\r\n ans[i + j] = (ans[i + j] + a[i] * b[j]) % mod\r\n return ans\r\n\r\n # 快速数论变换，卷积\r\n def convolution_ntt(a, b):\r\n a = a.copy()\r\n b = b.copy()\r\n n = len(a)\r\n m = len(b)\r\n z = 1 << (n + m - 2).bit_length()\r\n a += [0] * (z - n)\r\n butterfly(a)\r\n b += [0] * (z - m)\r\n butterfly(b)\r\n for i in range(z):\r\n a[i] = a[i] * b[i] % mod\r\n butterfly_inv(a)\r\n a = a[:n + m - 1]\r\n iz = pow(z, mod - 2, mod)\r\n for i in range(n + m - 1):\r\n a[i] = a[i] * iz % mod\r\n return a\r\n\r\n # 自卷\r\n def convolution_square(a):\r\n a = a.copy()\r\n n = len(a)\r\n z = 1 << (2 * n - 2).bit_length()\r\n a += [0] * (z - n)\r\n butterfly(a)\r\n for i in range(z):\r\n a[i] = a[i] * a[i] % mod\r\n butterfly_inv(a)\r\n a = a[:2 * n - 1]\r\n iz = pow(z, mod - 2, mod)\r\n for i in range(2 * n - 1):\r\n a[i] = a[i] * iz % mod\r\n return a\r\n\r\n # 卷积函数\r\n def convolution(a, b):\r\n \"\"\"It calculates (+, x) convolution in mod 998244353. \r\n Given two arrays a[0], a[1], ..., a[n - 1] and b[0], b[1], ..., b[m - 1], \r\n it calculates the array c of length n + m - 1, defined by\r\n\r\n > c[i] = sum(a[j] * b[i - j] for j in range(i + 1)) % 998244353.\r\n\r\n It returns an empty list if at least one of a and b are empty.\r\n\r\n Complexity\r\n ----------\r\n\r\n > O(n log n), where n = len(a) + len(b).\r\n \"\"\"\r\n n = len(a)\r\n m = len(b)\r\n if n == 0 or m == 0:\r\n return []\r\n if min(n, m) <= 60:\r\n return convolution_naive(a, b)\r\n if a is b:\r\n return convolution_square(a)\r\n return convolution_ntt(a, b)\r\n\r\n # 求逆\r\n def inverse(a):\r\n n = len(a)\r\n assert n > 0 and a[0] != 0\r\n res = [pow(a[0], mod - 2, mod)]\r\n m = 1\r\n while m < n:\r\n f = a[:min(n, 2 * m)] + [0] * (2 * m - min(n, 2*m))\r\n g = res + [0] * m\r\n butterfly(f)\r\n butterfly(g)\r\n for i in range(2 * m):\r\n f[i] = f[i] * g[i] % mod\r\n butterfly_inv(f)\r\n f = f[m:] + [0] * m\r\n butterfly(f)\r\n for i in range(2 * m):\r\n f[i] = f[i] * g[i] % mod\r\n butterfly_inv(f)\r\n iz = pow(2 * m, mod - 2, mod)\r\n iz = (-iz * iz) % mod\r\n for i in range(m):\r\n f[i] = f[i] * iz % mod\r\n res += f[:m]\r\n m <<= 1\r\n return res[:n]\r\n\r\n # 取对数\r\n def log(a):\r\n a = a.copy()\r\n n = len(a)\r\n assert n > 0 and a[0] == 1\r\n a_inv = inverse(a)\r\n a = differentiate(a)\r\n a = convolution(a, a_inv)[:n]\r\n a = integrate(a)\r\n return a\r\n\r\n # 求指数\r\n def exp(a):\r\n a = a.copy()\r\n n = len(a)\r\n assert n > 0 and a[0] == 0\r\n g = [1]\r\n a[0] = 1\r\n h_drv = a.copy()\r\n h_drv = differentiate(h_drv)\r\n m = 1\r\n while m < n:\r\n f_fft = a[:m] + [0] * m\r\n butterfly(f_fft)\r\n\r\n if m > 1:\r\n _f = [f_fft[i] * g_fft[i] % mod for i in range(m)]\r\n butterfly_inv(_f)\r\n _f = _f[m // 2:] + [0] * (m // 2)\r\n butterfly(_f)\r\n for i in range(m):\r\n _f[i] = _f[i] * g_fft[i] % mod\r\n butterfly_inv(_f)\r\n _f = _f[:m//2]\r\n iz = pow(m, mod - 2, mod)\r\n iz *= -iz\r\n iz %= mod\r\n for i in range(m//2):\r\n _f[i] = _f[i] * iz % mod\r\n g.extend(_f)\r\n\r\n t = a[:m]\r\n t = differentiate(t)\r\n r = h_drv[:m - 1]\r\n r.append(0)\r\n butterfly(r)\r\n for i in range(m):\r\n r[i] = r[i] * f_fft[i] % mod\r\n butterfly_inv(r)\r\n im = pow(-m, mod - 2, mod)\r\n for i in range(m):\r\n r[i] = r[i] * im % mod\r\n for i in range(m):\r\n t[i] = (t[i] + r[i]) % mod\r\n t = [t[-1]] + t[:-1]\r\n\r\n t += [0] * m\r\n butterfly(t)\r\n g_fft = g + [0] * (2 * m - len(g))\r\n butterfly(g_fft)\r\n for i in range(2 * m):\r\n t[i] = t[i] * g_fft[i] % mod\r\n butterfly_inv(t)\r\n t = t[:m]\r\n i2m = pow(2 * m, mod - 2, mod)\r\n for i in range(m):\r\n t[i] = t[i] * i2m % mod\r\n \r\n v = a[m:min(n, 2 * m)]\r\n v += [0] * (m - len(v))\r\n t = [0] * (m - 1) + t + [0]\r\n t=integrate(t)\r\n for i in range(m):\r\n v[i] = (v[i] - t[m + i]) % mod\r\n\r\n v += [0] * m\r\n butterfly(v)\r\n for i in range(2 * m):\r\n v[i] = v[i] * f_fft[i] % mod\r\n butterfly_inv(v)\r\n v = v[:m]\r\n i2m = pow(2 * m, mod - 2, mod)\r\n for i in range(m):\r\n v[i] = v[i] * i2m % mod\r\n \r\n for i in range(min(n - m, m)):\r\n a[m + i] = v[i]\r\n \r\n m *= 2\r\n return a\r\n\r\n # 求 k 次方：快速幂\r\n def power(a,k):\r\n n = len(a)\r\n assert n > 0\r\n if k == 0:\r\n return [1] + [0] * (n - 1)\r\n l = 0\r\n while l < len(a) and not a[l]:\r\n l += 1\r\n if l * k >= n:\r\n return [0] * n\r\n ic = pow(a[l], mod - 2, mod)\r\n pc = pow(a[l], k, mod)\r\n a = log([a[i] * ic % mod for i in range(l, len(a))])\r\n for i in range(len(a)):\r\n a[i] = a[i] * k % mod\r\n a = exp(a)\r\n for i in range(len(a)):\r\n a[i] = a[i] * pc % mod\r\n a = [0] * (l * k) + a[:n - l * k]\r\n return a\r\n\r\n # 开根号\r\n def sqrt(a):\r\n if len(a) == 0:\r\n return []\r\n if a[0] == 0:\r\n for d in range(1, len(a)):\r\n if a[d]:\r\n if d & 1:\r\n return None\r\n if len(a) - 1 < d // 2:\r\n break\r\n res = sqrt(a[d:] + [0] * (d//2))\r\n if res == None:\r\n return None\r\n res = [0] * (d // 2) + res\r\n return res\r\n return [0] * len(a)\r\n \r\n # 先求第一项能否找到对应的数字，接下来再凑\r\n sqr = Tonelli_Shanks(a[0], mod)\r\n if sqr == None:\r\n return None\r\n T = [0] * (len(a))\r\n T[0] = sqr\r\n res = T.copy()\r\n T[0] = pow(sqr, mod - 2, mod) #T:res^{-1}\r\n m = 1\r\n two_inv = (mod + 1) // 2\r\n F = [sqr]\r\n while m <= len(a) - 1:\r\n for i in range(m):\r\n F[i] *= F[i]\r\n F[i] %= mod\r\n butterfly_inv(F)\r\n iz = pow(m, mod-2, mod)\r\n for i in range(m):\r\n F[i] = F[i] * iz % mod\r\n delta = [0] * (2 * m)\r\n for i in range(m):\r\n delta[i + m] = F[i] - a[i] - (a[i + m] if i + m < len(a) else 0)\r\n butterfly(delta)\r\n G = [0] * (2 * m)\r\n for i in range(m):\r\n G[i] = T[i]\r\n butterfly(G)\r\n for i in range(2 * m):\r\n delta[i] *= G[i]\r\n delta[i] %= mod\r\n butterfly_inv(delta)\r\n iz = pow(2 * m, mod - 2, mod)\r\n for i in range(2 * m):\r\n delta[i] = delta[i] * iz % mod\r\n for i in range(m, min(2 * m, len(a))):\r\n res[i] = -delta[i] * two_inv%mod\r\n res[i] %= mod\r\n if 2 * m > len(a) - 1:\r\n break\r\n F = res[:2 * m]\r\n butterfly(F)\r\n eps = [F[i] * G[i] % mod for i in range(2 * m)]\r\n butterfly_inv(eps)\r\n for i in range(m):\r\n eps[i] = 0\r\n iz = pow(2 * m, mod - 2, mod)\r\n for i in range(m,2*m):\r\n eps[i] = eps[i] * iz % mod\r\n butterfly(eps)\r\n for i in range(2 * m):\r\n eps[i] *= G[i]\r\n eps[i] %= mod\r\n butterfly_inv(eps)\r\n for i in range(m, 2 * m):\r\n T[i] = -eps[i]*iz\r\n T[i] %= mod\r\n iz = iz * iz % mod\r\n\r\n m <<= 1\r\n return res\r\n\r\nmod = 998244353\r\nn, m = MII()\r\nnums = LII()\r\n\r\ndp = [0] * (m + 1)\r\nfor x in nums:\r\n if x <= m:\r\n dp[x] += 1\r\n\r\ndp = [(- 4 * x) % mod for x in dp]\r\ndp[0] += 1\r\ndp = sqrt(dp)\r\ndp[0] += 1\r\ndp = inverse(dp)\r\ndp = [x * 2 % mod for x in dp]\r\n\r\nprint(*(dp[i] for i in range(1, m + 1)))" ]

[ "def dfs(vertice, soma, temCapital,aux, used, capitais, am):\r\n soma += len(aux[vertice])\r\n am += 1\r\n if vertice in capitais:\r\n temCapital = True\r\n used[vertice] = True\r\n for i in aux[vertice]:\r\n if not used[i]:\r\n tmpC, am, soma = dfs(i, soma, temCapital, aux, used, capitais, am)\r\n temCapital |= tmpC\r\n return [temCapital, am, soma]\r\n\r\ndef hongcowBuildsANation(n,m,k):\r\n aux = []\r\n for i in range(n):\r\n aux.append([]) \r\n capitais = [int(i) - 1 for i in input().split()]\r\n \r\n for i in range(m):\r\n u, v = [int(i) - 1 for i in input().split()]\r\n aux[u].append(v)\r\n aux[v].append(u)\r\n \r\n resultado = 0\r\n used = [False] * n\r\n comp = []\r\n while False in used:\r\n comp.append(dfs(used.index(False), 0, False,aux, used,capitais, 0))\r\n comp[len(comp) - 1][2] /= 2\r\n \r\n for i in range(len(comp)):\r\n resultado -= comp[i][2]\r\n \r\n comp.sort(reverse=True)\r\n totalNs = comp[0][1]\r\n for i in range(1, len(comp)):\r\n if not comp[i][0]:\r\n totalNs += comp[i][1]\r\n else:\r\n resultado += comp[i][1] * (comp[i][1] - 1) / 2\r\n resultado += (totalNs) * (totalNs - 1) / 2\r\n print(int(resultado))\r\n\r\nn, m, k = [int(i) for i in input().split()]\r\nhongcowBuildsANation(n,m,k)", "import sys\r\nfrom copy import deepcopy\r\ninput = sys.stdin.readline\r\nv, e, g = map(int, input().split())\r\nf = [set() for index in range(v)]\r\nz = list(map(int, input().split()))\r\n\r\nfor index in range(e):\r\n x,y = map(int, input().split())\r\n f[x-1].add(y)\r\n f[y-1].add(x)\r\narrayLen = []\r\n\r\nfor index in z:\r\n mapX = {index}\r\n while True:\r\n ant = deepcopy(mapX)\r\n for j in range(v):\r\n if j+1 in mapX:\r\n mapX.update(f[j])\r\n elif not f[j].isdisjoint(mapX):\r\n mapX.add(j+1)\r\n if ant == mapX:\r\n break\r\n arrayLen.append(len(mapX))\r\nans = e*-1\r\n\r\nfor index in arrayLen:\r\n ans += index*(index-1)//2\r\nbig = max(arrayLen)\r\n\r\nfor index in range(v-sum(arrayLen)):\r\n ans += big\r\n big += 1\r\nprint(ans)", "n, m, k = map(int, input().split())\ng = [int(x) - 1 for x in input().split()]\nadj = [[] for _ in range(n)]\n\nvis = [0] * n\n\nfor _ in range(m):\n u, v = map(int, input().split())\n adj[u - 1].append(v - 1)\n adj[v - 1].append(u - 1)\n\ndef bfs(i):\n q, cur = [i], 0\n vis[i] = 1\n while cur < len(q):\n v = q[cur]\n cur += 1\n for nv in adj[v]:\n if vis[nv] == 0:\n vis[nv] = 1\n q.append(nv)\n\n return q\n\n\ncomp = [bfs(i) for i in g if vis[i] == 0]\ncomp.append([i for i in range(n) if vis[i] == 0])\n\nans = (n * (n - 1)) // 2 - m\nc = len(comp)\n\nif len(g) <= 1:\n print(ans)\n exit()\n\nfor i in range(c):\n for j in range(i + 1, c):\n ans -= len(comp[i]) * len(comp[j])\n\nans += len(comp[-1]) * max((len(x) for x in comp[:c - 1]))\n\nprint(ans)\n\n", "import sys\nfrom copy import deepcopy\ninput = sys.stdin.readline\nv, e, g = map(int, input().split())\nf = [set() for index in range(v)]\nz = list(map(int, input().split()))\n\nfor index in range(e):\n x,y = map(int, input().split())\n f[x-1].add(y)\n f[y-1].add(x)\narrayLen = []\n\nfor index in z:\n mapX = {index}\n while True:\n ant = deepcopy(mapX)\n for j in range(v):\n if j+1 in mapX:\n mapX.update(f[j])\n elif not f[j].isdisjoint(mapX):\n mapX.add(j+1)\n if ant == mapX:\n break\n arrayLen.append(len(mapX))\nans = e*-1\n\nfor index in arrayLen:\n ans += index*(index-1)//2\nbig = max(arrayLen)\n\nfor index in range(v-sum(arrayLen)):\n ans += big\n big += 1\nprint(ans)\n", "import sys\r\nimport os\r\nfrom io import BytesIO, IOBase\r\nBUFSIZE = 8192\r\nclass FastIO(IOBase):\r\n newlines = 0\r\n def __init__(self, file):\r\n self._fd = file.fileno()\r\n self.buffer = BytesIO()\r\n self.writable = \"x\" in file.mode or \"r\" not in file.mode\r\n self.write = self.buffer.write if self.writable else None\r\n def read(self):\r\n while True:\r\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\r\n if not b:\r\n break\r\n ptr = self.buffer.tell()\r\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\r\n self.newlines = 0\r\n return self.buffer.read()\r\n def readline(self):\r\n while self.newlines == 0:\r\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\r\n self.newlines = b.count(b\"\\n\") + (not b)\r\n ptr = self.buffer.tell()\r\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\r\n self.newlines -= 1\r\n return self.buffer.readline()\r\n def flush(self):\r\n if self.writable:\r\n os.write(self._fd, self.buffer.getvalue())\r\n self.buffer.truncate(0), self.buffer.seek(0)\r\nclass IOWrapper(IOBase):\r\n def __init__(self, file):\r\n self.buffer = FastIO(file)\r\n self.flush = self.buffer.flush\r\n self.writable = self.buffer.writable\r\n self.write = lambda s: self.buffer.write(s.encode(\"ascii\"))\r\n self.read = lambda: self.buffer.read().decode(\"ascii\")\r\n self.readline = lambda: self.buffer.readline().decode(\"ascii\")\r\nsys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)\r\ninput = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\r\nparent = {}\r\ndef DFS(V,Adj):\r\n gov_list = []\r\n for s in V:\r\n if s not in parent:\r\n sum1 = 0\r\n comp = {s : True}\r\n parent[s] = None\r\n def DFS_Visit(Adj,s):\r\n nonlocal comp\r\n for v in Adj[s]:\r\n if v not in parent:\r\n comp[v] = True\r\n parent[v] = s\r\n DFS_Visit(Adj,v)\r\n DFS_Visit(Adj,s)\r\n for key in comp:\r\n sum1 += len(adj_list[key])\r\n gov_list.append([len(comp), sum1//2])\r\n return gov_list\r\n\r\nn, m, k = map(int, input().split())\r\nvertices = [i for i in range(1, n+1)]\r\ngov = list(map(int, input().split()))\r\nadj_list = [[] for j in range(n+1)]\r\nfor i in range(m):\r\n u, v = map(int, input().split())\r\n adj_list[u].append(v)\r\n adj_list[v].append(u)\r\ngovernments = DFS(gov, adj_list)\r\nhonest = DFS(vertices, adj_list)\r\ngovernments.sort(reverse = True)\r\n\r\nextra_vertices = extra_edges = 0\r\nfor i in honest:\r\n extra_vertices += i[0]\r\n extra_edges += i[1]\r\nmax_vertices = extra_vertices + governments[0][0]\r\nextra_edges += governments[0][1]\r\nans = (max_vertices*(max_vertices-1))//2 - extra_edges\r\n\r\nfor i in range(1, k):\r\n ans += (governments[i][0]*(governments[i][0]-1))//2 - governments[i][1]\r\nprint(ans)", "n, m, k = map(int, input().split())\nspecial = map(int, input().split())\n \nroot = [p for p in range(n+1)]\n \ndef par(p):\n\tif p != root[p]:\n\t\troot[p] = par(root[p])\n\treturn root[p]\n \nfor i in range(m):\n\tu,v = map(par, map(int, input().split()))\n\troot[v] = u\n \nsz = [0 for i in range(n+1)]\n \nfor i in range(n+1):\n\tsz[par(i)] += 1\n \nleftover = n\nans = 0\nlargest = 0\n \nfor x in special:\n\td = par(x)\n\tlargest = max(largest, sz[d])\n\tans += sz[d] * (sz[d] - 1) // 2\n\tleftover -= sz[d]\n \nans -= largest * (largest - 1) // 2\nans += (largest+leftover) * ((largest+leftover) - 1) // 2\nans -= m\n \nprint(ans)\n", "import sys\r\ninput = lambda: sys.stdin.readline().rstrip()\r\nfrom collections import Counter\r\n\r\nN,M,K = map(int, input().split())\r\nC = set([i-1 for i in map(int, input().split())])\r\n\r\nP = [[] for _ in range(N)]\r\nfor _ in range(M):\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\nseen = [0]*N\r\n\r\ndef paint(idx,color):\r\n v = [idx]\r\n while v:\r\n i = v.pop()\r\n if seen[i]:continue\r\n seen[i] = color\r\n \r\n for j in P[i]:\r\n if seen[j]:continue\r\n v.append(j)\r\n\r\ncolor = 1\r\nfor i in range(N):\r\n if seen[i]:continue\r\n paint(i, color)\r\n color+=1\r\n\r\ngroups = [[0,0] for _ in range(color-1)]\r\nfor i in range(N):\r\n color = seen[i]\r\n if i in C:\r\n groups[color-1][0] = 1\r\n groups[color-1][1]+=1\r\n \r\nA,B = [],[]\r\nfor c,n in groups:\r\n if c:\r\n A.append(n)\r\n else:\r\n B.append(n)\r\nA.sort()\r\nA[-1]+=sum(B)\r\nans = 0\r\nfor a in A:\r\n ans+=(a-1)*a//2\r\nprint(ans-M)\r\n\r\n\r\n\r\n \r\n", "import sys\r\ninput=sys.stdin.readline\r\nfrom collections import defaultdict\r\nn,m,k=map(int,input().split())\r\nl=list(map(int,input().strip().split()))\r\ns=set()\r\nfor x in l:\r\n s.add(x)\r\ng=defaultdict(list)\r\nfor _ in range(m):\r\n u,v=map(int,input().split())\r\n g[u].append(v)\r\n g[v].append(u)\r\nvisited=set()\r\nmxn,mxe=0,float('inf')\r\ndef dfs(src):\r\n nodes,st=[],[src]\r\n visited.add(src)\r\n while len(st)>0:\r\n node=st.pop()\r\n nodes.append(node)\r\n for nbr in g[node]:\r\n if nbr not in visited:\r\n visited.add(nbr)\r\n st.append(nbr)\r\n return nodes\r\nans=0\r\np=[]\r\nfor x in s:\r\n nodes=dfs(x)\r\n e=0\r\n for node in nodes:\r\n e+=len(g[node])\r\n p.append([len(nodes),e//2])\r\n \r\np=sorted(p,key=lambda x:(-x[0],x[1]))\r\n#print(p)\r\nfor i in range(1,len(p)):\r\n nc,ec=p[i][0],p[i][1]\r\n ans+=((nc-1)*nc)//2-ec\r\nfor x in range(1,n+1):\r\n if x not in visited:\r\n nodes=dfs(x)\r\n e=0\r\n for node in nodes:\r\n e+=len(g[node])\r\n e//=2\r\n p[0][1]+=e\r\n p[0][0]+=len(nodes)\r\n#print(p)\r\nans+=((p[0][0]-1)*p[0][0])//2-p[0][1]\r\nprint(ans)", "def dfs(n):\r\n if not C[n]:\r\n C[n] = True\r\n s[0] += 1\r\n for i in B[n]:\r\n if not C[i]:dfs(i)\r\n \r\nn,m,k = list(map(int, input().split()))\r\nA = list(map(int, input().split()))\r\nA = [i-1 for i in A]\r\nB = [list([]) for i in range(n)]\r\nC = [False for i in range(n)]\r\nans = 0\r\nmx = 0\r\n\r\nfor i in range(m):\r\n a,b = [i-1 for i in list(map(int, input().split()))]\r\n B[a].append(b)\r\n B[b].append(a)\r\n \r\nfor i in range(k):\r\n s = [0]\r\n dfs(A[i])\r\n ans += s[0]*(s[0]-1)//2\r\n mx = max(mx,s[0])\r\n \r\nans -= mx*(mx-1)//2\r\nfor i in range(n):\r\n if not C[i]:\r\n s = [0]\r\n dfs(i)\r\n mx += s[0]\r\n \r\nprint(ans-m+mx*(mx-1)//2)", "from copy import deepcopy\r\n\r\nn, m, k = map(int, input().split()) #v,e,g\r\nz = list(map(int, input().split()))\r\n\r\nnumbers = [set() for _ in range(n)]\r\nlista = []\r\n\r\nfor _ in range(m):\r\n c1, c2 = map(int, input().split())\r\n numbers[c1-1].add(c2)\r\n numbers[c2-1].add(c1)\r\n\r\nfor i in z:\r\n dic = {i}\r\n while True:\r\n root = deepcopy(dic)\r\n for j in range(n):\r\n if j+1 in dic:\r\n dic.update(numbers[j])\r\n elif not numbers[j].isdisjoint(dic):\r\n dic.add(j+1)\r\n if root == dic:\r\n break\r\n lista.append(len(dic))\r\nresult = m*-1\r\n\r\nfor i in lista:\r\n result += i * (i-1)//2\r\nmaior = max(lista)\r\n\r\nfor _ in range(n-sum(lista)):\r\n result += maior\r\n maior += 1\r\n \r\nprint(result)", "n,m,k = map(int,input().split())\r\ngovt = set(map(int,input().split()))\r\nimport collections\r\nadj = collections.defaultdict(list)\r\nfor _ in range(m):\r\n u,v = map(int,input().split())\r\n adj[u].append(v)\r\n adj[v].append(u)\r\n\r\nmarked = set()\r\n\r\n\r\ndef dfs(node,adj):\r\n if node in marked:\r\n return 0\r\n count = 1\r\n marked.add(node)\r\n for ne in adj[node]:\r\n count += dfs(ne, adj)\r\n return count\r\n\r\n\r\ndef num_edge(nodes):\r\n return (nodes * (nodes - 1))/2\r\n\r\nvals = []\r\nfor gov in govt:\r\n vals.append(dfs(gov, adj))\r\n\r\nnon_marked = 0\r\nfor i in range(1,n+1):\r\n if not (i in marked):\r\n non_marked += 1\r\nimport operator\r\nmax_index, max_value = max(enumerate(vals), key=operator.itemgetter(1))\r\nvals[max_index] += non_marked\r\n\r\nne = 0\r\nfor val in vals:\r\n ne += num_edge(val)\r\n\r\nprint(int(ne - m))", "from collections import Counter as cntr\r\nfrom math import inf\r\ndef cin():\r\n\treturn map(int, input().split(' '))\r\ndef dfs(graph, src):\r\n\tglobal visited, cnt\r\n\tcnt += 1\r\n\tfor v in graph[src]:\r\n\t\tif visited[v] == False:\r\n\t\t\tvisited[v] = True\r\n\t\t\tdfs(graph, v)\r\n\treturn cnt\r\n\r\nn,m,k = cin()\r\ngovs = list(cin())\r\nhong = {i:[] for i in range(n)}\r\nfor i in range(m):\r\n\tu, v = cin()\r\n\tu -= 1\r\n\tv -= 1\r\n\thong[u].append(v)\r\n\thong[v].append(u)\r\n\r\n\r\nvisited = [False for i in range(n)]\r\ncount = []\r\nfor gov in govs:\r\n\tgov -= 1\r\n\tvisited[gov] = True\r\n\tcnt = 0\r\n\tcount.append(dfs(hong, gov))\r\n\r\n\r\n\r\ncount = sorted(count)\r\nfor i in range(n):\r\n\tif visited[i] == False:\r\n\t\tvisited[i] = True\r\n\t\tcnt = 0\r\n\t\tcount[-1]+=dfs(hong, i)\r\nsu = 0\r\nfor i in count:\r\n\tsu += i*(i-1)//2\r\nprint(su-m)", "import sys\r\nfrom string import ascii_lowercase\r\n# sys.setrecursionlimit(1000000)\r\ninput = sys.stdin.readline\r\n\r\ndef solve(n, k, adj, c):\r\n groups = []\r\n vis = [False for _ in range(n)]\r\n \r\n def dfs(node):\r\n res = 1\r\n vis[node] = True\r\n for nei in adj[node]:\r\n if not vis[nei]:\r\n res += dfs(nei)\r\n return res\r\n \r\n for each in c:\r\n groups.append(dfs(each))\r\n groups.sort()\r\n groups[-1] += sum([1 for i in range(n) if not vis[i]])\r\n \r\n ans = 0\r\n for group in groups:\r\n ans += ((group)*(group-1) // 2)\r\n \r\n return ans-m\r\n\r\n# t = int(input())\r\nt = 1\r\nfor _ in range(t):\r\n n, m, k = map(int, input().split())\r\n c = [int(x)-1 for x in input().split()]\r\n \r\n adj = [[] for _ in range(n)]\r\n for _ in range(m):\r\n u, v = map(int, input().split())\r\n adj[u-1].append(v-1)\r\n adj[v-1].append(u-1)\r\n \r\n print(solve(n, k, adj, c))\r\n ", "n, m, k = map(int, input().strip().split())\nn += 1\ngov = list(map(int, input().strip().split()))\nadj = [set() for _ in range(n)]\ndiscovered = [False] * n\nfor _ in range(m):\n u, v = map(int, input().strip().split())\n adj[u].add(v)\n adj[v].add(u)\n\nnumEdge = 0\nmaxNodes = 0\nfor i in gov:\n if discovered[i]:\n print(\"Failed\")\n exit()\n discovered[i] = True\n count = 0\n nodes = 0\n q = [i]\n while len(q) != 0:\n u = q.pop(0)\n count += nodes\n nodes += 1\n for v in adj[u]:\n if discovered[v]:\n continue\n discovered[v] = True\n q.append(v)\n numEdge += count\n maxNodes = max(maxNodes, nodes)\n\norphan = 0\nfor i in range(1, n):\n if not discovered[i]:\n orphan += 1\n\nfor i in range(orphan):\n numEdge += maxNodes\n maxNodes += 1\nprint(numEdge - m)\n\t\t \t\t\t \t\t\t\t\t \t\t\t\t\t \t", "previous = []\nnodes = []\nconnections=[]\n\ndef search(edge):\n if(edge == previous[edge]):\n return edge\n else:\n previous[edge] = search(previous[edge])\n return previous[edge]\n\ndef union(x,y):\n dx = search(x)\n dy = search(y)\n if(dx!=dy):\n previous[dx] = dy\n nodes[dy]+= nodes[dx]\n\n\nif __name__ == \"__main__\":\n n,m, k = map(int,input().split())\n homeNodes = list(map(int,input().split()))\n countries=[]\n sumTotal = 0\n maxNumber = 0\n for i in range(0,n+1):\n previous.append(i)\n nodes.append(1)\n countries.append(0)\n for i in range(0,m):\n a, b = map(int,input().split())\n union(a,b)\n for i in range(0,k):\n countries[search(homeNodes[i])] = 1\n \n for i in range(1,n+1):\n if(search(i) == i):\n if(countries[i] == 1):\n maxNumber = max(nodes[i],maxNumber)\n else:\n connections.append(nodes[i])\n sumTotal += nodes[i] * (nodes[i]-1)/2\n \n for i in range (len(connections)):\n for j in range(i+1, len(connections)):\n sumTotal += connections[i] * connections[j]\n sumTotal+=connections[i]*maxNumber\n \n print(int(sumTotal-m))\n\t\t\t\t \t \t \t\t\t \t \t \t\t\t \t\t\t\t", "nums = input().split(\" \")\r\nnum1, num2, num3 = int(nums[0]), int(nums[1]), int(nums[2])\r\nlista = []\r\nnodes = list(map(int, input().split(\" \")))\r\n\r\ndef calc(valor):\r\n global x, y\r\n x += 1\r\n usado[valor] = True\r\n y += len(lista[valor])\r\n for i in lista[valor]:\r\n if not usado[i]:\r\n calc(i)\r\n \r\nfor i in range(num1):\r\n lista.append([])\r\nfor i in range(num2):\r\n nums = input().split(\" \")\r\n x = int(nums[0])\r\n y = int(nums[1])\r\n lista[x - 1].append(y - 1)\r\n lista[y - 1].append(x - 1)\r\n \r\nusado = [False] * num1\r\naux1 = 0\r\naux2 = -1\r\n\r\nfor i in range(num3):\r\n x = 0\r\n y = 0\r\n calc(nodes[i] - 1)\r\n aux1 += (x * (x - 1) - y) // 2\r\n aux2 = max(aux2, x)\r\n num1 -= x\r\n\r\naux3 = 0\r\nfor i in range(len(lista)):\r\n if not usado[i]:\r\n aux3 += len(lista[i])\r\n\r\naux1 += ((aux2 + num1) * (num1 + aux2 - 1) - aux2 * (aux2 - 1)) // 2\r\nmaxNum = aux1 - aux3 // 2\r\nprint(maxNum)", "from collections import deque\r\nn, m, k=[int(v) for v in input().split()]\r\nw=[int(v) for v in input().split()]\r\niota=[]\r\nq={}\r\nfor j in range(m):\r\n iota.append([int(v) for v in input().split()])\r\n if iota[-1][0] in q:\r\n q[iota[-1][0]].append(iota[-1][1])\r\n else:\r\n q[iota[-1][0]]=[iota[-1][1]]\r\n if iota[-1][1] in q:\r\n q[iota[-1][1]].append(iota[-1][0])\r\n else:\r\n q[iota[-1][1]]=[iota[-1][0]]\r\ncheck=set(w)\r\nrho=[]\r\nfor j in w:\r\n new=deque([j])\r\n res=1\r\n while new:\r\n x=new.pop()\r\n if j in q:\r\n for j in q[x]:\r\n if j not in check:\r\n new.appendleft(j)\r\n check.add(j)\r\n res+=1\r\n rho.append(res)\r\nres=0\r\nrho.sort()\r\nepsilon=n-sum(rho)\r\nzeta=rho.pop()+epsilon\r\nfor j in rho:\r\n res+=j*(j-1)//2\r\nres+=zeta*(zeta-1)//2\r\nprint(res-m)", "from sys import stdin\n\n\ndef main():\n n, m, k = map(int, input().split())\n n += 1\n capitals = [False] * n\n for u in map(int, input().split()):\n capitals[u] = True\n g = [[] for _ in range(n)]\n for s in stdin.read().splitlines():\n u, v = map(int, s.split())\n g[u].append(v)\n g[v].append(u)\n avail, stack, countries, freetowns = [True] * n, [], [], 0\n\n def dfs(a):\n nonlocal capital, sz\n if capitals[a]:\n capital = a\n sz += 1\n for b in g[a]:\n if avail[b]:\n avail[b] = False\n dfs(b)\n\n for u in range(1, n):\n if avail[u]:\n avail[u], capital, sz = False, 0, 0\n dfs(u)\n if capital:\n countries.append(sz)\n else:\n freetowns += sz\n countries.sort()\n countries[-1] += freetowns\n print(sum(sz * (sz - 1) for sz in countries) // 2 - m)\n\n\nif __name__ == '__main__':\n main()\n", "# coding: utf-8\r\nn, m, k = list(map(int, input().split()))\r\ngovs = list(map(int, input().split()))\r\ngraph = [[] for _ in range(n+1)]\r\n\r\nfor _ in range(m):\r\n u, v = list(map(int, input().split()))\r\n graph[u].append(v)\r\n graph[v].append(u)\r\n\r\nvisited = [False] * (n+1)\r\ncomponents = []\r\nhas_gov = []\r\n\r\ndef dfs(node, i):\r\n if visited[node]:\r\n return\r\n visited[node] = True\r\n \r\n if node in govs:\r\n has_gov[i] = True\r\n \r\n components[i].append(node)\r\n\r\n for neighbour in graph[node]:\r\n dfs(neighbour, i)\r\n\r\ni = -1\r\nmax_component_size = -1\r\nbiggest_component = 0\r\n\r\nfor node in range(1, n+1):\r\n if visited[node]:\r\n continue\r\n i += 1\r\n components.append([])\r\n has_gov.append(False)\r\n dfs(node, i)\r\n if len(components[i]) > max_component_size and has_gov[i]:\r\n max_component_size = len(components[i])\r\n biggest_component = i\r\n\r\nfor i in range(len(components)):\r\n if has_gov[i]:\r\n continue\r\n\r\n no_gov_component = components[i]\r\n for j in range(len(no_gov_component)):\r\n components[biggest_component].append(no_gov_component[j])\r\n\r\nnew_edges = 0\r\n\r\nfor i in range(len(components)):\r\n if not has_gov[i]:\r\n continue\r\n component = components[i]\r\n s = len(component)\r\n edges = (s*(s-1)) // 2\r\n removed_edges = 0\r\n for j in component:\r\n for k in component:\r\n if j != k and k in graph[j]:\r\n removed_edges += 1\r\n removed_edges = removed_edges // 2\r\n new_edges += (edges - removed_edges)\r\nprint(new_edges)", "n,m,k = map(int,input().split())\r\nl = list(map(int,input().split()))\r\nqa = n\r\naux = [[] for i in range(n+1)]\r\nvisited = [False for i in range(n+1)]\r\nf = 0\r\narray = []\r\nfor i in range(m) :\r\n a,b = map(int,input().split())\r\n aux[a].append(b)\r\n aux[b].append(a)\r\n array.append([a,b])\r\nma = 0\r\n \r\nd1 = {}\r\nfor x in l:\r\n q = [x]\r\n r = 0\r\n t = 0\r\n while q :\r\n v=q[0]\r\n r+=1\r\n visited[v]=True\r\n t+=len(aux[v])\r\n for y in aux[v] :\r\n if visited[y]==False :\r\n q.append(y)\r\n visited[y]=True\r\n del q[0]\r\n qa-=r\r\n d1[r]=d1.get(r,[])+[t]\r\n \r\nfor x in array :\r\n if visited[x[0]]==visited[x[1]]==False :\r\n f+=1\r\nflag=True\r\ny=sorted(d1,reverse=True)\r\nans=-f\r\nfor x in y :\r\n for e in d1[x] :\r\n if flag :\r\n u=qa+x\r\n ans+=u*(u-1)//2-e//2\r\n flag=False\r\n else :\r\n ans+=x*(x-1)//2-e//2\r\nprint(ans)", "from collections import defaultdict\r\ngraph = defaultdict(list)\r\nn,m,k = list(map(int,input().split()))\r\narr = list(map(int,input().split()))\r\nfor i in range(m):\r\n u,v = list(map(int,input().split()))\r\n graph[u].append(v)\r\n graph[v].append(u)\r\nd = {}\r\nvisited = [False for i in range(n)]\r\nfor i in arr:\r\n cur = i\r\n q = []\r\n d[cur] = []\r\n q.append(cur)\r\n visited[cur-1] = True\r\n while q!=[]:\r\n u = q.pop(0)\r\n d[cur].append(u)\r\n for j in graph[u]:\r\n if visited[j-1]==False:\r\n visited[j-1] = True\r\n q.append(j)\r\nvisited = [False for i in range(n)]\r\nfor i in d:\r\n for j in d[i]:\r\n visited[j-1] = True\r\nrem = 0\r\nfor i in visited:\r\n if i==False:\r\n rem+=1\r\nans = []\r\nfor i in d:\r\n ans.append(len(d[i]))\r\nans.sort()\r\nans[-1]+=rem\r\ntmp = 0\r\n# print(ans)\r\nfor i in ans:\r\n tmp+=(i*(i-1))//2\r\nprint(tmp-m)\r\n", "def bfs(i):\r\n\r\n q, cont = [i], 0\r\n\r\n visitado[i] = 1\r\n while cont < len(q):\r\n\r\n v = q[cont]\r\n cont += 1\r\n\r\n for no in adjacente[v]:\r\n\r\n if visitado[no] == 0:\r\n visitado[no] = 1\r\n q.append(no)\r\n\r\n return q\r\n\r\n\r\nn, m, k = map(int, input().split())\r\n\r\nadjacente = [[] for _ in range(n)]\r\n\r\nvisitado = [0] * n\r\n\r\ngrafos = [int(x) - 1 for x in input().split()]\r\n\r\n\r\nfor _ in range(m):\r\n u, v = map(int, input().split())\r\n adjacente[u - 1].append(v - 1)\r\n adjacente[v - 1].append(u - 1)\r\n\r\n\r\nlista = [bfs(i) for i in grafos if visitado[i] == 0]\r\nlista.append([i for i in range(n) if visitado[i] == 0])\r\n\r\nsaida = (n * (n - 1)) // 2 - m\r\naux = len(lista)\r\n\r\nif len(grafos) <= 1:\r\n print(saida)\r\n\r\nelse:\r\n for i in range(aux):\r\n\r\n for j in range(i + 1, aux):\r\n saida -= len(lista[i]) * len(lista[j])\r\n\r\n saida += len(lista[-1]) * max((len(x) for x in lista[:aux - 1]))\r\n\r\n print(saida)\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\nclass Unionfind:\r\n def __init__(self, n):\r\n self.par = [-1]*n\r\n self.rank = [1]*n\r\n \r\n def root(self, x):\r\n r = x\r\n \r\n while not self.par[r]<0:\r\n r = self.par[r]\r\n \r\n t = x\r\n \r\n while t!=r:\r\n tmp = t\r\n t = self.par[t]\r\n self.par[tmp] = r\r\n \r\n return r\r\n \r\n def unite(self, x, y):\r\n rx = self.root(x)\r\n ry = self.root(y)\r\n \r\n if rx==ry:\r\n return\r\n \r\n if self.rank[rx]<=self.rank[ry]:\r\n self.par[ry] += self.par[rx]\r\n self.par[rx] = ry\r\n \r\n if self.rank[rx]==self.rank[ry]:\r\n self.rank[ry] += 1\r\n else:\r\n self.par[rx] += self.par[ry]\r\n self.par[ry] = rx\r\n \r\n def is_same(self, x, y):\r\n return self.root(x)==self.root(y)\r\n \r\n def count(self, x):\r\n return -self.par[self.root(x)]\r\n\r\nn, m, k = map(int, input().split())\r\nc = list(map(int, input().split()))\r\nuf = Unionfind(n)\r\n\r\nfor _ in range(m):\r\n u, v = map(int, input().split())\r\n uf.unite(u-1, v-1)\r\n\r\nsizes = [uf.count(ci-1) for ci in c]\r\nsizes.sort()\r\nsizes[-1] += n-sum(sizes)\r\nans = 0\r\n\r\nfor size in sizes:\r\n ans += size*(size-1)//2\r\n\r\nans -= m\r\n\r\nprint(ans)", "gr={}\r\nclass node:\r\n\tdef __init__(self):\r\n\t\tself.adj=set()\r\n\tdef add(self,b):\r\n\t\tself.adj.add(b)\r\nn,m,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\nfor i in range(n):\r\n\tgr[i+1]=node()\r\nfor i in range(m):\r\n\tu,v=map(int,input().split())\r\n\tgr[u].add(v)\r\n\tgr[v].add(u)\r\nv=[False for i in range(n+1)]\r\nv[0]=True\r\nans=0\r\nmaxi=0\r\nc=0\r\nfor i in a:\r\n\ts=set([i])\r\n\ted=0\r\n\tne=0\r\n\tlast=0\r\n\twhile s:\r\n\t\tx=s.pop()\r\n\t\ted+=len(gr[x].adj)\r\n\t\tne+=1\r\n\t\tv[x]=True\r\n\t\tfor j in gr[x].adj:\r\n\t\t\tif j==last or v[j]:continue\r\n\t\t\ts.add(j)\r\n\t\tlast=x\r\n\tif maxi<ne:maxi=ne;c=ed//2\r\n\tans+=ne*(ne-1)//2-ed//2\r\nb=v.count(False)\r\nif b!=0:\r\n\tedge=0\r\n\tfor i in range(1,n+1):\r\n\t\tif v[i]:continue\r\n\t\ts=set([i])\r\n\t\ted=0\r\n\t\tlast=0\r\n\t\twhile s:\r\n\t\t\tx=s.pop()\r\n\t\t\ted+=len(gr[x].adj)\r\n\t\t\tv[x]=True\r\n\t\t\tfor j in gr[x].adj:\r\n\t\t\t\tif j==last or v[j]:continue\r\n\t\t\t\ts.add(j)\r\n\t\t\tlast=x\r\n\t\t\r\n\t\tedge+=ed//2\r\n\tans=ans-maxi*(maxi-1)//2+(maxi+b)*(maxi+b-1)//2-edge\r\nprint(ans)", "n,m,c=map(int,input().split())\r\nl=list(map(int,input().split()))\r\n\r\n\r\n\r\nqa=n\r\nd=[[] for i in range(n+1)]\r\nVisited=[False for i in range(n+1)]\r\nf=0\r\nL=[]\r\nfor i in range(m) :\r\n a,b=map(int,input().split())\r\n d[a].append(b)\r\n d[b].append(a)\r\n L.append([a,b])\r\nma=0\r\n\r\nd1={}\r\nfor x in l:\r\n q=[x]\r\n r=0\r\n t=0\r\n while q :\r\n v=q[0]\r\n r+=1\r\n Visited[v]=True\r\n t+=len(d[v])\r\n for y in d[v] :\r\n if Visited[y]==False :\r\n q.append(y)\r\n Visited[y]=True\r\n del q[0]\r\n qa-=r\r\n d1[r]=d1.get(r,[])+[t]\r\n \r\nfor x in L :\r\n if Visited[x[0]]==Visited[x[1]]==False :\r\n f+=1\r\nrr=True\r\ny=sorted(d1,reverse=True)\r\nout=-f\r\n\r\nfor x in y :\r\n for e in d1[x] :\r\n if rr :\r\n u=qa+x\r\n out+=u*(u-1)//2-e//2\r\n rr=False\r\n else :\r\n out+=x*(x-1)//2-e//2\r\nprint(out)", "n,m,k=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nqa=n\r\naux=[[] for i in range(n+1)]\r\nVisited=[False for i in range(n+1)]\r\nf=0\r\narray=[]\r\nfor i in range(m) :\r\n a,b=map(int,input().split())\r\n aux[a].append(b)\r\n aux[b].append(a)\r\n array.append([a,b])\r\nma=0\r\n \r\nd1={}\r\nfor x in l:\r\n q=[x]\r\n r=0\r\n t=0\r\n while q :\r\n v=q[0]\r\n r+=1\r\n Visited[v]=True\r\n t+=len(aux[v])\r\n for y in aux[v] :\r\n if Visited[y]==False :\r\n q.append(y)\r\n Visited[y]=True\r\n del q[0]\r\n qa-=r\r\n d1[r]=d1.get(r,[])+[t]\r\n \r\nfor x in array :\r\n if Visited[x[0]]==Visited[x[1]]==False :\r\n f+=1\r\nflag=True\r\ny=sorted(d1,reverse=True)\r\nans=-f\r\nfor x in y :\r\n for e in d1[x] :\r\n if flag :\r\n u=qa+x\r\n ans+=u*(u-1)//2-e//2\r\n flag=False\r\n else :\r\n ans+=x*(x-1)//2-e//2\r\nprint(ans)", "from collections import defaultdict\n\ndef get_node_degree(component):\n degree = 0\n for node in component:\n degree += len(graph[node])\n return degree // 2 # remove relations with the component itself\n\ndef get_index_max_component(components):\n max_conn_comp = -1\n index_max = -1\n for index, component in enumerate(components):\n if(len(component) > max_conn_comp):\n max_conn_comp = len(component)\n index_max = index\n return index_max\n\ndef maximum_edges_calc(vertices):\n return vertices * (vertices - 1)// 2\n\ndef dfs(root):\n visiteds[root] = True\n connected_components = [root]\n for element in graph[root]:\n if(not visiteds[element]):\n connected_components += dfs(element)\n return connected_components\n\n\nn, m, k = map(int, input().split())\ngov_nodes = list(map(int, input().split()))\n\ngraph = defaultdict(list)\nvisiteds = [False] * (n+1)\nnormal_conn_comp = []\ngovernment_conn_comp = []\n\nfor i in range(m):\n x1, x2 = map(int, input().split())\n graph[x1].append(x2)\n graph[x2].append(x1)\n\nfor i in gov_nodes:\n if(not visiteds[i]):\n government_conn_comp.append(dfs(i))\n\nfor i in range(1, n+1):\n if(not visiteds[i] and (i not in gov_nodes)):\n normal_conn_comp.append(dfs(i))\n\nvertices_count = 0\nedges_count = 0\nfor comp in normal_conn_comp:\n vertices_count += len(comp)\n edges_count += get_node_degree(comp)\n\ngovernmentWithMoreEdgesIndex = get_index_max_component(government_conn_comp)\nvertices_count += len(government_conn_comp[governmentWithMoreEdgesIndex])\nedges_count += get_node_degree(government_conn_comp[governmentWithMoreEdgesIndex])\nmax_edges_inclusion = maximum_edges_calc(vertices_count) - edges_count # remove edges that already exists on the graph\n\nfor i in range(len(government_conn_comp)):\n if i != governmentWithMoreEdgesIndex:\n num_vertices = len(government_conn_comp[i])\n num_edges = maximum_edges_calc(num_vertices)\n max_edges_inclusion += num_edges - get_node_degree(government_conn_comp[i])\n \nprint(max_edges_inclusion)\n", "def same_p(p):\r\n\tif p != root[p]:\r\n\t\troot[p] = same_p(root[p])\r\n\treturn root[p]\r\n\r\nn, m, k = map(int, input().split())\r\ngraph = map(int, input().split()) \r\nroot = [p for p in range(n+1)]\r\n \r\nfor i in range(m):\r\n\tu,v = map(same_p, map(int, input().split()))\r\n\troot[v] = u\r\n \r\naux = [0 for i in range(n+1)]\r\nfor i in range(n+1):\r\n\taux[same_p(i)] += 1\r\n \r\nleftover = n\r\nresult = 0\r\nlargest = 0\r\nfor x in graph:\r\n\td = same_p(x)\r\n\tlargest = max(largest, aux[d])\r\n\tresult += aux[d] * (aux[d] - 1) // 2\r\n\tleftover -= aux[d]\r\n \r\nresult -= largest * (largest - 1) // 2\r\nresult += (largest+leftover) * ((largest+leftover) - 1) // 2\r\nresult -= m\r\n \r\nprint(result)", "num_nodes, num_edges, num_queries = map(int, input().split())\r\ncolor_list = list(map(int, input().split()))\r\nadjacency_matrix = [[0] * (num_nodes + 1) for _ in range(num_nodes + 1)]\r\n\r\nfor _ in range(num_edges):\r\n node_a, node_b = map(int, input().split())\r\n adjacency_matrix[node_a][node_b] = adjacency_matrix[node_b][node_a] = 1\r\n\r\ncolor_count = [0] * num_queries\r\nvisited = [0] * (num_nodes + 1)\r\n\r\ndef depth_first_search(query_index, current_node):\r\n color_count[query_index] += 1\r\n visited[current_node] = 1\r\n for neighbor in range(num_nodes + 1):\r\n if adjacency_matrix[current_node][neighbor] == 1 and visited[neighbor] == 0:\r\n depth_first_search(query_index, neighbor)\r\n\r\nfor query_index in range(num_queries):\r\n visited = [0] * (num_nodes + 1)\r\n depth_first_search(query_index, color_list[query_index])\r\n\r\nremaining_nodes = num_nodes - sum(color_count)\r\nmax_color_count = max(color_count)\r\n\r\nfor i in range(num_queries):\r\n if color_count[i] == max_color_count:\r\n color_count[i] += remaining_nodes\r\n break\r\n\r\ncolor_count = list(map(lambda count: count * (count - 1) // 2, color_count))\r\nresult = sum(color_count) - num_edges\r\nprint(result)\r\n", "def dfs(graph, n, visited, sum_length):\r\n if not visited[n]:\r\n visited[n] = True\r\n sum_length[0] += 1\r\n for i in graph[n]:\r\n if not visited[i]:dfs(graph, i, visited, sum_length)\r\n\r\ndef hongcow(graph, n, m, k, specials):\r\n ans = 0\r\n maximun_ = 0\r\n visited = [False] * n\r\n for i in range(k):\r\n sum_length = [0]\r\n dfs(graph, specials[i], visited, sum_length)\r\n ans += sum_length[0] * (sum_length[0] - 1) // 2\r\n if (sum_length[0] > maximun_):\r\n maximun_ = sum_length[0]\r\n \r\n ans -= maximun_ * (maximun_ - 1) // 2\r\n for i in range(n):\r\n if not visited[i]:\r\n sum_length = [0]\r\n dfs(graph, i, visited, sum_length)\r\n maximun_ += sum_length[0]\r\n\r\n result = ans - m + maximun_ * (maximun_ - 1) // 2\r\n return result \r\n\r\nn, m, k = list(map(int, input().split()))\r\nspecials = list(map(lambda x: int(x) - 1, input().split()))\r\n\r\ngraph = {}\r\nfor i in range(n):\r\n graph[i] = []\r\n\r\nfor i in range(m):\r\n u, v = list(map(lambda x: int(x) - 1, input().split()))\r\n graph[u].append(v)\r\n graph[v].append(u)\r\n\r\nprint(hongcow(graph, n, m, k, specials))", "def dfs(vertice, soma, capital, am):\r\n soma += len(array[vertice])\r\n am += 1\r\n\r\n if vertice in capitais:\r\n capital = True\r\n\r\n usado[vertice] = True\r\n for i in array[vertice]:\r\n if not usado[i]:\r\n tmp, am, soma = dfs(i, soma, capital, am)\r\n capital |= tmp\r\n return [capital, am, soma]\r\n \r\nn, m, k = [int(i) for i in input().split()]\r\n\r\narray = []\r\nfor i in range(n):\r\n array.append([]) \r\ncapitais = [int(i) - 1 for i in input().split()]\r\n\r\nfor i in range(m):\r\n u, v = [int(i) - 1 for i in input().split()]\r\n array[u].append(v)\r\n array[v].append(u)\r\n \r\nresult = 0\r\nusado = [False] * n\r\nauxiliar = []\r\n\r\nwhile False in usado:\r\n auxiliar.append(dfs(usado.index(False), 0, False, 0))\r\n auxiliar[len(auxiliar) - 1][2] /= 2\r\n \r\nfor i in range(len(auxiliar)):\r\n result -= auxiliar[i][2]\r\n \r\nauxiliar.sort(reverse=True)\r\n\r\ntotal_ns = auxiliar[0][1]\r\n\r\nfor i in range(1, len(auxiliar)):\r\n if not auxiliar[i][0]:\r\n total_ns += auxiliar[i][1]\r\n \r\n else:\r\n result += auxiliar[i][1] * (auxiliar[i][1] - 1) / 2\r\n\r\nresult += (total_ns) * (total_ns - 1) / 2\r\nprint(int(result))", "def fun(value):\r\n global x, y\r\n x += 1\r\n used[value] = True\r\n y += len(l[value])\r\n for i in l[value]:\r\n if not used[i]:\r\n fun(i)\r\n\r\nn, m, k = map(int, input().split(\" \"))\r\n\r\nl = []\r\nnodes = list(map(int, input().split(\" \")))\r\n \r\nfor i in range(n):\r\n l.append([])\r\n\r\nfor i in range(m):\r\n a, b = map(int, input().split(\" \"))\r\n l[a - 1].append(b - 1)\r\n l[b - 1].append(a - 1)\r\n \r\nused = [False] * n\r\naux1 = 0\r\naux2 = -1\r\n \r\nfor i in range(k):\r\n global x, y\r\n x = 0\r\n y = 0\r\n fun(nodes[i] - 1)\r\n aux1 += (x * (x - 1) - y) // 2\r\n aux2 = max(aux2, x)\r\n n -= x\r\n \r\naux3 = 0\r\nlenght = len(l)\r\nfor i in range(lenght):\r\n if not used[i]:\r\n aux3 += len(l[i])\r\n \r\naux1 += ((aux2 + n) * (n + aux2 - 1) - aux2 * (aux2 - 1)) // 2\r\nanswer = aux1 - aux3 // 2\r\nprint(answer)", "n, m, k = map(int, input().split())\r\nhomes = list(map(int, input().split()))\r\n\r\ngraph = []\r\n\r\ndef dfs(v):\r\n global soma, cur\r\n cur += 1\r\n used[v] = True\r\n soma += len(graph[v])\r\n for i in graph[v]:\r\n if not used[i]:\r\n dfs(i)\r\n\r\nfor i in range(n):\r\n graph.append([])\r\n\r\n\r\nfor i in range(m):\r\n a, b = map(int, input().split())\r\n graph[a - 1].append(b - 1)\r\n graph[b - 1].append(a - 1)\r\n\r\nused = [False] * n\r\niterations = 0\r\nmaxV = -1\r\n\r\nfor i in range(k):\r\n global soma, u\r\n cur = 0\r\n soma = 0\r\n\r\n dfs(homes[i] - 1)\r\n\r\n iterations += (cur * (cur - 1) - soma) // 2\r\n maxV = max(maxV, cur)\r\n n -= cur\r\n\r\nresult = 0\r\n \r\nfor i in range(len(graph)):\r\n if not used[i]:\r\n result += len(graph[i])\r\n\r\niterations += ((maxV + n) * (n + maxV - 1) - maxV * (maxV - 1)) // 2\r\nprint(iterations - result // 2)", "n,m,k = map(int, input().split())\r\nhg = map(int, input().split())\r\n\r\nparents = [x for x in range(n+1)]\r\n\r\ndef parent(p):\r\n\tif p != parents[p]:\r\n\t\tparents[p] = parent(parents[p])\r\n\treturn parents[p]\r\n\r\n\r\nfor i in range(m):\r\n\tu,v = map(parent, map(int, input().split()))\r\n\tparents[v] = u\r\n\r\nsz = [0 for i in range(n+1)]\r\n\r\nfor i in range(n+1):\r\n\tsz[parent(i)] += 1\r\n\r\nleftover = n\r\nans = 0\r\nlargest = 0\r\n\r\nfor x in hg:\r\n\td = parent(x)\r\n\tlargest = max(largest, sz[d])\r\n\tans += sz[d] * (sz[d] - 1) // 2\r\n\tleftover -= sz[d]\r\n\r\nans -= largest * (largest - 1) // 2\r\nans += (largest+leftover) * ((largest+leftover) - 1) // 2\r\nans -= m\r\n\r\nprint(ans)", "from __future__ import annotations\n\nimport sys\nimport threading\nfrom typing import Any\n\n\ndef print(*args: Any, sep: str = ' ', end: str = '\\n') -> None:\n sys.stdout.write(sep.join(map(str, args)))\n if end:\n sys.stdout.write(end)\n\n\ndef input() -> str:\n return sys.stdin.readline().rstrip('\\r\\n')\n\n\n# union find\ndef find(parent, x):\n if parent[x] == x:\n return x\n parent[x] = find(parent, parent[x])\n return parent[x]\n\n\ndef union(parent, rank, x, y):\n xroot = find(parent, x)\n yroot = find(parent, y)\n if rank[xroot] < rank[yroot]:\n parent[xroot] = yroot\n elif rank[xroot] > rank[yroot]:\n parent[yroot] = xroot\n else:\n parent[yroot] = xroot\n rank[xroot] += 1\n\n\ndef main() -> None:\n n, m, k = map(int, input().split())\n houses = list(map(int, input().split()))\n parent = [i for i in range(n)]\n rank = [0 for _ in range(n)]\n for _ in range(m):\n c1, c2 = map(int, input().split())\n c1 -= 1\n c2 -= 1\n union(parent, rank, c1, c2)\n clusters = {}\n for i in range(n):\n group = find(parent, i)\n if group not in clusters:\n clusters[group] = set()\n clusters[group].add(i)\n cluster_houses = set()\n for i, cluster in clusters.items():\n for h in houses:\n if h - 1 in cluster:\n cluster_houses.add(i)\n break\n all_non_house_clusters = set()\n to_remove = []\n for i, cluster in clusters.items():\n if i not in cluster_houses:\n all_non_house_clusters |= cluster\n to_remove.append(i)\n for i in to_remove:\n del clusters[i]\n largest_cluster = max(\n clusters.values(),\n key=len\n )\n largest_cluster |= all_non_house_clusters\n total = sum(\n len(cluster) * (len(cluster) - 1) // 2 for cluster in clusters.values()\n )\n print(max(0, total - m))\n\n\nif __name__ == '__main__':\n sys.setrecursionlimit(1 << 30)\n threading.stack_size(1 << 27)\n main()\n\n\t\t \t\t \t \t \t\t \t\t\t \t \t", "\r\ndef dfs(v, g, marked, cur):\r\n marked[v] = True\r\n cur.add(v)\r\n for next in g[v]:\r\n if marked[next]:\r\n continue\r\n dfs(next, g, marked, cur)\r\n\r\n\r\n\r\n\r\nn, m, k = map(int ,input().split())\r\n\r\ng = [[] for _ in range(n)]\r\ncapitals = set([i - 1 for i in map(int, input().split())])\r\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\n g[v].append(u)\r\n\r\nmarked = [False for _ in range(n)]\r\n\r\ncur = set()\r\ncomponents = []\r\n\r\nfor i in range(n):\r\n if not marked[i] :\r\n dfs(i, g, marked, cur)\r\n components.append(cur)\r\n cur = set()\r\n\r\nans = 0\r\n\r\nmax_size_capital = 0\r\nother_sizes = []\r\nfor i in range(len(components)):\r\n size = len(components[i])\r\n inner = 0\r\n is_capital = False\r\n for el in components[i]:\r\n for next in g[el]:\r\n if next in components[i]:\r\n inner += 1\r\n if el in capitals:\r\n is_capital = True\r\n\r\n if is_capital and size > max_size_capital:\r\n max_size_capital = size\r\n if not is_capital:\r\n other_sizes.append(size)\r\n\r\n ans += size * (size - 1) // 2 - inner // 2\r\n\r\nother_sizes.append(max_size_capital)\r\ntotal_sum = sum(other_sizes)\r\n\r\ntmp_res = 0\r\nfor el in other_sizes:\r\n tmp_res += el *(total_sum - el)\r\n\r\n# print(ans)\r\nans += tmp_res // 2\r\n\r\n# print(components)\r\n# print(capitals)\r\n# print(other_sizes)\r\n#\r\n# print(tmp_res)\r\n\r\nprint(ans)\r\n\r\n\r\n", "import sys\nfrom copy import deepcopy\ninput = sys.stdin.readline\nv, e, g = map(int, input().split())\nconnect = [set() for i in range(v)]\ngov = list(map(int, input().split()))\nfor i in range(e):\n x,y = map(int, input().split())\n connect[x-1].add(y)\n connect[y-1].add(x)\nsizes = []#\nfor i in gov:\n reached = {i}\n while True:\n old = deepcopy(reached)\n for j in range(v):\n if j+1 in reached:\n reached.update(connect[j])\n elif not connect[j].isdisjoint(reached):\n reached.add(j+1)\n if old == reached:\n break\n sizes.append(len(reached))\nans = -e\nfor i in sizes:\n ans += i*(i-1)//2\nbig = max(sizes)\nfor i in range(v-sum(sizes)):\n ans += big\n big += 1\nprint(ans)\n \t\t\t\t \t\t\t\t\t\t\t \t\t \t \t", "mx = 1001\r\nvis = [False] * mx\r\nadj = [[] for i in range(mx)]\r\ncount_connected = 0\r\ntotal_connected = 0\r\nmax_connected = 0\r\ntotal_pair_edges = 0\r\n\r\ndef dfs(u):\r\n global count_connected\r\n count_connected += 1\r\n vis[u] = True\r\n for v in adj[u]:\r\n if not vis[v]:\r\n dfs(v)\r\n\r\nn, m, k = map(int, input().split())\r\nspecial = list(map(int, input().split()))\r\nfor i in range(m):\r\n u, v = map(int, input().split())\r\n adj[u].append(v)\r\n adj[v].append(u)\r\n\r\nvis = [False] * mx\r\nfor i in range(k):\r\n count_connected = 0\r\n dfs(special[i])\r\n max_connected = max(count_connected, max_connected)\r\n total_connected += count_connected\r\n total_pair_edges += (count_connected * (count_connected - 1)) // 2\r\n\r\nn = n - total_connected + max_connected\r\ntotal_pair_edges = total_pair_edges - ((max_connected * (max_connected - 1)) // 2) + (n * (n - 1)) // 2\r\ntotal_pair_edges = total_pair_edges - m\r\nprint(total_pair_edges)\r\n", "def dfs(c, x):\r\n y[c]+=1\r\n p[x]=1\r\n for j in range(n+1):\r\n if g[x][j]==1 and p[j]==0:\r\n dfs(c,j)\r\nn,m,k=map(int,input().split())\r\nC=list(map(int,input().split()))\r\ng=[[0]*(n+1) for _ in range(n+1)]\r\nfor _ in range(m):\r\n a,b=map(int, input().split())\r\n g[a][b]=g[b][a]=1\r\ny=[0]*k\r\np=[0]*(n+1)\r\nfor c in range(k):\r\n p=[0]*(n+1)\r\n dfs(c,C[c])\r\nsoma=n-sum(y)\r\nmaximo=max(y)\r\nfor i in range(k):\r\n if y[i]==maximo:\r\n y[i]+=soma\r\n break\r\ny = list(map(lambda w: w*(w-1)//2, y))\r\nprint(sum(y)-m)", "firstLine = input().split()\nnodesNum = int(firstLine[0])\nedgesNum = int(firstLine[1])\ngovNodesNum = int(firstLine[2])\n\ntextGovNodes = input().split()\ngovNodes = []\nfor i in textGovNodes:\n node = int(i)\n govNodes.append(node)\n\nroot = [i for i in range(nodesNum + 1)]\n\ndef getToRoot(node):\n if node != root[node]:\n root[node] = getToRoot(root[node])\n return root[node]\n\nfor __ in range(edgesNum):\n inputLine = input().split()\n node1 = getToRoot(int(inputLine[0]))\n node2 = getToRoot(int(inputLine[1]))\n root[node2] = node1\n\nsizes = [0 for i in range(nodesNum + 1)]\n\nfor i in range(nodesNum +1):\n\tsizes[getToRoot(i)] += 1\n\ndef maxEdges(size):\n return int((size - 1) * size / 2)\n\n\nstrayNodes = nodesNum\nmaxSize = 0\nresult = 0\nfor i in govNodes:\n size = sizes[getToRoot(i)]\n maxSize = max(maxSize, size)\n result += maxEdges(size)\n strayNodes -= size\n\nresult -= maxEdges(maxSize)\nmaxSize += strayNodes\nresult += maxEdges(maxSize)\nresult -= edgesNum\n\nprint(result)\n\n", "n = m = k = government = graph = aux = None\r\n\r\ndef input_list():\r\n return map(int, input().split())\r\n\r\ndef pair(p):\r\n\tif p != graph[p]:\r\n\t\tgraph[p] = pair(graph[p])\r\n\treturn graph[p]\r\n\r\ndef entrypoint():\r\n global n, m, k, government, graph, aux\r\n n, m, k = input_list()\r\n government = input_list()\r\n \r\n graph = [p for p in range(n + 1)]\r\n aux = [0 for i in range(n + 1)]\r\n \r\ndef compute_ans():\r\n left = n\r\n ans = highest = 0\r\n\r\n for value in government:\r\n x = pair(value)\r\n highest = max(highest, aux[x])\r\n ans += aux[x] * (aux[x] - 1) // 2\r\n left -= aux[x]\r\n \r\n ans -= highest * (highest - 1) // 2\r\n ans += (highest + left) * ((highest + left) - 1) // 2\r\n ans -= m\r\n \r\n return ans\r\n\r\ndef process():\r\n for i in range(m):\r\n u,v = map(pair, input_list())\r\n graph[v] = u\r\n \r\n for i in range(n + 1):\r\n aux[pair(i)] += 1\r\n\r\n return compute_ans()\r\n \r\n \r\ndef main():\r\n entrypoint()\r\n print(process())\r\n\r\nif __name__ == '__main__':\r\n main()", "n, m, k = map(int, input().split())\r\ncapitals = list(map(int, input().split()))\r\ngraph = dict([(key, []) for key in range(1, n + 1)])\r\ngraph_country = dict([(key, 0) for key in range(1, n + 1)])\r\nroads = []\r\nfor i in range(m):\r\n u, v = map(int, input().split())\r\n roads.append(u)\r\n graph[u].append(v)\r\n graph[v].append(u)\r\n \r\ndef f(city, capital):\r\n graph_country[city] = capital\r\n for i in graph[city]:\r\n if graph_country[i] == 0:\r\n f(i, capital)\r\n \r\nfor i in capitals:\r\n f(i, i)\r\n \r\nanswer = 0\r\nfree_cities = 0\r\ngraph_list = [(k, v) for k, v in graph_country.items()]\r\ncountry_population = dict.fromkeys(capitals, 0)\r\nfor i in graph_list:\r\n if i[1] == 0:\r\n free_cities += 1\r\n else:\r\n country_population[i[1]] += 1\r\n \r\nbiggest_country = max(country_population.values())\r\nfind_biggest = False\r\ncountry_roads = dict.fromkeys(capitals, 0)\r\nadditional_roads = 0\r\nfor i in roads:\r\n if graph_country[i] != 0:\r\n country_roads[graph_country[i]] += 1\r\n else:\r\n additional_roads += 1\r\nfor i in country_population.keys():\r\n n = country_population[i]\r\n if n != biggest_country:\r\n answer += int((n - 1) * n / 2) - country_roads[i]\r\n else:\r\n if not find_biggest:\r\n find_biggest = True\r\n biggest_country_capital = i\r\n else:\r\n answer += int((n - 1) * n / 2) - country_roads[i]\r\nn = biggest_country + free_cities\r\nanswer += int((n - 1) * n / 2) - country_roads[biggest_country_capital] - additional_roads\r\nprint(answer)", "def calculaArestas(vertices, arestas, governos):\n ligacoes = {}\n for i in range(arestas):\n x, y = list(map(int, input().split(\" \")))\n if x - 1 not in ligacoes:\n ligacoes[x - 1] = [y - 1]\n else:\n ligacoes[x - 1].append(y - 1)\n\n if y - 1 not in ligacoes:\n ligacoes[y - 1] = [x - 1]\n else:\n ligacoes[y - 1].append(x - 1)\n\n visitados = {}\n ciclos = {0: [], 1: []}\n for i in range(vertices):\n is_governos = False if i not in governos else True\n if i in visitados:\n continue\n\n ciclo = [i]\n if i not in ligacoes:\n visitados[i] = 1\n if is_governos:\n ciclos[0].append(ciclo)\n else:\n ciclos[1].append(ciclo)\n continue\n path = ligacoes[i]\n while len(path) > 0:\n no = path.pop(0)\n if no in visitados:\n continue\n visitados[no] = 1\n if no in governos:\n is_governos = True\n path = ligacoes[no] + path\n ciclo.append(no)\n\n if is_governos:\n ciclos[0].append(list(set(ciclo)))\n else:\n ciclos[1].append(list(set(ciclo)))\n\n ciclo_ordenado = sorted(ciclos[0], key=len)\n\n tamanho = len(ciclo_ordenado[-1])\n ciclo_ordenado.pop(len(ciclo_ordenado) - 1)\n for ciclo in ciclos[1]:\n tamanho += len(ciclo)\n\n total = tamanho * (tamanho - 1) // 2\n for j in ciclo_ordenado:\n total += len(j) * (len(j) - 1) // 2\n\n return total - arestas\n\n\nn, m, k = list(map(int, input().split()))\ngovernos = {c - 1: 1 for c in list(map(int, input().split()))}\n\nprint(calculaArestas(n, m, governos))\n", "I = lambda : map(int, input().split())\r\nn, m, k = I()\r\nspecial = I()\r\n \r\nroot = [p for p in range(n+1)]\r\n \r\ndef par(p):\r\n\tif p != root[p]:\r\n\t\troot[p] = par(root[p])\r\n\treturn root[p]\r\n \r\nfor i in range(m):\r\n\tu,v = map(par, I())\r\n\troot[v] = u\r\n \r\nsz = [0 for i in range(n+1)]\r\n \r\nfor i in range(n+1):\r\n\tsz[par(i)] += 1\r\n \r\nleftover = n\r\nresult = 0\r\nlargest = 0\r\n \r\nfor x in special:\r\n\td = par(x)\r\n\tlargest = max(largest, sz[d])\r\n\tresult += sz[d] * (sz[d] - 1) // 2\r\n\tleftover -= sz[d]\r\n \r\nresult -= largest * (largest - 1) // 2\r\nresult += (largest+leftover) * ((largest+leftover) - 1) // 2\r\nresult -= m\r\n \r\nprint(result)", "#!/usr/bin/env python3\r\n\r\nimport collections\r\n\r\nparent = {}\r\n\r\n\r\ndef make_set(v):\r\n parent[v] = v\r\n\r\n\r\ndef find_set(v):\r\n if v != parent[v]:\r\n parent[v] = find_set(parent[v])\r\n return parent[v]\r\n\r\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 parent[b] = a\r\n\r\n\r\ndef main():\r\n n, m, k = map(int, input().split())\r\n\r\n for i in range(n):\r\n make_set(i + 1)\r\n\r\n capitals = map(int, input().split())\r\n\r\n edges = []\r\n\r\n for i in range(m):\r\n a, b = map(int, input().split())\r\n union_sets(a, b)\r\n edges.append(a)\r\n\r\n sets = set(find_set(i + 1) for i in range(n))\r\n\r\n capital_sets = set(find_set(c) for c in capitals)\r\n\r\n elem_count = collections.defaultdict(int)\r\n\r\n uncap_set = [c for c in sets if c not in capital_sets]\r\n if uncap_set:\r\n for c in uncap_set[1:]:\r\n union_sets(uncap_set[0], c)\r\n\r\n for i in range(n):\r\n elem_count[find_set(i + 1)] += 1\r\n\r\n max_cap = None\r\n max_count = -1\r\n for c in capital_sets:\r\n cur_count = elem_count[find_set(c)]\r\n if cur_count > max_count:\r\n max_cap = c\r\n max_count = cur_count\r\n\r\n union_sets(uncap_set[0], max_cap)\r\n\r\n elem_count = {\r\n c: 0 for c in sets\r\n }\r\n for i in range(n):\r\n elem_count[find_set(i + 1)] += 1\r\n\r\n edge_count = collections.defaultdict(int)\r\n\r\n for e in edges:\r\n edge_count[find_set(e)] += 1\r\n\r\n result = 0\r\n\r\n for c, n in elem_count.items():\r\n e = edge_count.get(c, 0)\r\n full_c = n * (n - 1) // 2\r\n result += full_c - e\r\n\r\n print(result)\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "from sys import stdin\r\nfrom collections import deque, defaultdict\r\nn, m, k = map(int, input().split())\r\ndeg = [0] * (n + 1)\r\ngraph = defaultdict(set)\r\ngovs = set(map(int, input().split()))\r\nfor line in stdin:\r\n u, v = map(int, line.split())\r\n graph[u].add(v)\r\n graph[v].add(u)\r\n deg[u] += 1\r\n deg[v] += 1\r\ncomps = {}\r\nnongovs = []\r\nvisited = [0] * (n + 1)\r\n\r\ndef bfs(start):\r\n queue = deque([start])\r\n visited[start] = 1\r\n nodecount = 1\r\n edgecount = deg[start]\r\n gov = start if start in govs else None\r\n while queue:\r\n q = queue.popleft()\r\n for nbr in graph[q]:\r\n if not visited[nbr]:\r\n visited[nbr] = 1\r\n queue.append(nbr)\r\n nodecount += 1\r\n edgecount += deg[nbr]\r\n if gov is None and nbr in govs:\r\n gov = nbr\r\n edgecount //= 2\r\n if gov:\r\n comps[gov] = [nodecount, edgecount]\r\n else:\r\n nongovs.append((nodecount,edgecount))\r\nfor i in range(1, n + 1):\r\n if visited[i]:\r\n continue\r\n bfs(i)\r\n# print(comps)\r\n# print(nongovs)\r\nlargest = max((nodecount, edgecount, gov) for gov, (nodecount, edgecount) in comps.items())\r\nfor x in nongovs:\r\n comps[largest[2]][0] += x[0]\r\n comps[largest[2]][1] += x[1]\r\nanswer = 0\r\nfor v in comps.values():\r\n answer += v[0]*(v[0] - 1)//2 - v[1]\r\nprint(answer)", "n, m, k = [int(x) for x in input().split()]\r\nspecial = [int(x) for x in input().split()]\r\n\r\nroot = list(range(n + 1))\r\n\r\ndef par(p):\r\n\tif root[p] != p:\r\n\t\troot[p] = par(root[p])\r\n\treturn root[p]\r\n\r\ndef c2(n):\r\n\treturn n * (n - 1) / 2\r\n\r\nfor i in range(m):\r\n\tu, v = map(par, [int(x) for x in input().split()])\r\n\troot[v] = u\r\n\r\ns = [0] * (n + 1)\r\nfor i in range(n+1):\r\n\ts[par(i)] += 1\r\n\r\nleft = n\r\nmaximum_edges = 0\r\nbiggest = 0\r\n\r\nfor x in special:\r\n d = par(x)\r\n\r\n if s[d] > biggest:\r\n biggest = s[d]\r\n\r\n maximum_edges += c2(s[d])\r\n left -= s[d]\r\n\r\nmaximum_edges -= c2(biggest)\r\nmaximum_edges += c2(biggest + left)\r\nmaximum_edges -= m\r\n\r\nprint(int(maximum_edges))", "\r\nn,m,k = map(int,input().split())\r\n\r\nspecs = map(int,input().split())\r\n\r\nadjList = [[] for _ in range(n+1)]\r\n\r\nfor _ in range(m):\r\n x, y = map(int,input().split())\r\n adjList[x].append(y)\r\n adjList[y].append(x)\r\n\r\ndef dfs(x):\r\n st = []\r\n visited = [0] * (n+1)\r\n\r\n st.append(x)\r\n visited[x] = 1\r\n count = 1\r\n\r\n while st:\r\n x = st.pop()\r\n\r\n for y in adjList[x]:\r\n if visited[y]: continue\r\n\r\n st.append(y)\r\n visited[y] = 1\r\n count += 1\r\n\r\n return count\r\n\r\ndef numberOfEdge(v):\r\n return v * (v-1) // 2\r\n\r\nlargest = 0\r\nfreeNode = n\r\nspecialEdges = 0\r\n\r\nfor x in specs:\r\n componentSize = dfs(x)\r\n specialEdges += numberOfEdge(componentSize)\r\n\r\n largest = max(largest, componentSize)\r\n freeNode -= componentSize\r\n\r\nmergeEdges = numberOfEdge(largest + freeNode)\r\nans = mergeEdges + specialEdges - numberOfEdge(largest) - m\r\nprint(ans)\r\n", "n, m, k = map(int, input().split())\r\nis_gov = [0] * (n+1)\r\nprt = [0] * (n+1)\r\ncnt_gov = [0] * (n+1)\r\nadj = [[] for _ in range(n+1)]\r\n\r\nif k == 1: \r\n arr = [int(input())]\r\nelse: \r\n arr = list(map(int, input().split()))\r\nfor i in arr:\r\n is_gov[i] = 1\r\nfor i in range(m):\r\n u, v = map(int, input().split())\r\n adj[u].append(v)\r\n adj[v].append(u)\r\n\r\ndef dfs(u, p, ID):\r\n stk = [(u, p, ID)]\r\n while stk:\r\n u, p, ID = stk[-1]\r\n stk.pop()\r\n if prt[u] != 0:\r\n continue\r\n prt[u] = ID\r\n cnt_gov[ID] += 1\r\n for v in adj[u]:\r\n if v != p:\r\n stk.append((v, u, ID))\r\n\r\nfor i in range(1, n+1):\r\n if is_gov[i] == 1:\r\n dfs(i, -1, i)\r\nmax_nodes, res = 0, 0\r\nfor i in range(1, n+1):\r\n if is_gov[i] == 1:\r\n res += cnt_gov[i] * (cnt_gov[i]-1) // 2\r\n max_nodes = max(max_nodes, cnt_gov[i])\r\nres -= max_nodes * (max_nodes-1) // 2\r\nmax_nodes += prt.count(0) - 1\r\nres += max_nodes * (max_nodes-1) // 2\r\nprint(res - m)\r\n", "def dfs(n):\n if not visited[n]:\n visited[n]=True\n s[0] += 1\n for i in edge[n]:\n if not visited[i] : dfs(i)\n \nn, m, k = map(int, input().split())\n\nlist_k = [i-1 for i in list(map(int, input().split()))]\n\nedge=[list([]) for i in range(n)]\nvisited=[False for i in range(n)]\n\nans = mx = 0\n\nfor i in range(m):\n a, b = [i-1 for i in list(map(int, input().split()))]\n edge[a].append(b)\n edge[b].append(a)\n \nfor i in range(k):\n s = [0]\n dfs(list_k[i])\n ans += s[0] * (s[0] - 1) // 2\n mx = max(mx, s[0])\n \nans -= mx * (mx-1) // 2\nfor i in range(n):\n if not visited[i]:\n s = [0]\n dfs(i)\n mx += s[0]\n \nresult = ans - m + mx * (mx-1) // 2\n\nprint(result)", "n, m, k = map(int, input().split())\nnodes = map(int, input().split())\nroot = [i for i in range(n + 1)]\ndef auxFun(p):\n\tif p != root[p]:\n\t\troot[p] = auxFun(root[p])\n\treturn root[p]\nfor i in range(m):\n\tu, v = map(auxFun, map(int, input().split()))\n\troot[v] = u\nauxEdges = [0 for i in range(n + 1)]\nfor i in range(n + 1):\n\tauxEdges[auxFun(i)] += 1\nleft = n\nedges = 0\nmaximum = 0\nfor i in nodes:\n\tidx = auxFun(i)\n\tmaximum = max(maximum, auxEdges[idx])\n\tedges += auxEdges[idx] * (auxEdges[idx] - 1) // 2\n\tleft -= auxEdges[idx]\nedges -= maximum * (maximum - 1) // 2\nedges += (maximum + left) * ((maximum + left) - 1) // 2\nedges -= m\nprint(edges)\n \t \t \t \t \t\t \t\t \t\t\t\t\t \t\t", "def bfs(graph, start):\n visited, queue = [], [start]\n while queue:\n vertex = queue.pop()\n if vertex not in visited:\n visited.append(vertex)\n try:\n queue.extend(graph[vertex] - set(visited))\n except KeyError:\n break\n return visited\n\nn, m, k = map(int, input().split())\ncapitals = [int(x) for x in input().split()]\ngraph = {}\nfor _ in range(m):\n v1, v2 = map(int, input().split())\n graph[v1] = graph.get(v1, set()).union({v2})\n graph[v2] = graph.get(v2, set()).union({v1})\n\n#print(graph)\nconnectivity = {c:len(bfs(graph, c)) for c in capitals}\n#print(connectivity)\n# n - sum(connectivity.values())\nvalues = list(connectivity.values())\n#print(values)\nmax_cap = max(values)\nconnected = sum([x - 1 for x in values])\nvalues.remove(max_cap)\nvalues.append(n - connected - k + max_cap)\nedges = 0\nfor c in values:\n edges += c * (c - 1) // 2\nprint(edges - m)\n", "n, m, k = map(int, input().split())\r\n\r\na = set(map(int, input().split()))\r\n\r\nA = [[0 for i in range(n+1)] for i in range(n+1)]\r\nvisited = [0 for i in range(n+1)]\r\n\r\nfor i in range(m):\r\n u, v = map(int, input().split())\r\n A[u][v] = 1\r\n A[v][u] = 1\r\n\r\ne = 0\r\n\r\ndef dfs(u):\r\n global e\r\n global v\r\n visited[u] = 1\r\n \r\n e += 1\r\n \r\n for i in range(1, n+1):\r\n if A[u][i] == 1 and visited[i] == 0:\r\n dfs(i)\r\n\r\n return\r\n\r\nmax_e = 0\r\nans = 0\r\n\r\nfor u in a:\r\n e = 0\r\n dfs(u)\r\n ans += e*(e-1)//2\r\n max_e = max(max_e, e)\r\n \r\nk = 0 \r\nfor i in range(1, n+1):\r\n if visited[i] == 0:\r\n e = 0\r\n dfs(i)\r\n k += e\r\n \r\nans += (max_e*k + k*(k-1)//2)\r\nans -= m\r\n\r\nprint(max(ans, 0))\r\n", "def fa(p):\r\n if p != root[p]:\r\n root[p] = fa(root[p])\r\n return root[p]\r\n\r\n\r\nn, m, k = map(int, input().split())\r\nspecial = map(int, input().split())\r\n\r\nroot = [p for p in range(n+1)]\r\n\r\nfor i in range(m):\r\n\tu,v = map(fa, map(int, input().split()))\r\n\troot[v] = u\r\n\r\nsz = [0 for i in range(n+1)]\r\n\r\nfor i in range(n+1):\r\n\tsz[fa(i)] += 1\r\n\r\nleftover = n\r\nans = 0\r\nlargest = 0\r\n\r\nfor x in special:\r\n\td = fa(x)\r\n\tlargest = max(largest, sz[d])\r\n\tans += sz[d] * (sz[d] - 1) // 2\r\n\tleftover -= sz[d]\r\n\r\nans -= largest * (largest - 1) // 2\r\nans += (largest+leftover) * ((largest+leftover) - 1) // 2\r\nans -= m\r\n\r\nprint(ans)\r\n", "def pair(p):\r\n\tif graph[p] != p:\r\n\t\tgraph[p] = pair(graph[p])\r\n\treturn graph[p]\r\n\r\nn, m, k = map(int, input().split())\r\ngov_nodes = map(int, input().split())\r\ngraph = [i for i in range(n+1)]\r\n\r\nfor _ in range(m):\r\n\tu,v = map(pair, map(int, input().split()))\r\n\tgraph[v] = u\r\n\r\nvis = [0] * (n+1)\r\n \r\nfor i in range(n+1):\r\n\tvis[pair(i)] += 1\r\n \r\nleftover = n\r\nres = 0\r\nlargest = 0\r\n \r\nfor g in gov_nodes:\r\n edge = pair(g)\r\n largest = max(largest, vis[edge])\r\n res += vis[edge] * (vis[edge] - 1) // 2\r\n leftover -= vis[edge]\r\n \r\nprint(res - m - (largest * (largest - 1) // 2) + ((largest+leftover) * ((largest+leftover) - 1) // 2))", "LIMIT = 1001\nvisited = [False] * LIMIT\nneighbours = [[] for i in range(LIMIT)]\ncomponents = 0\n\ndef pairs(n):\n return int((n * (n - 1)) / 2)\n\ndef dfs(node):\n global components\n components += 1\n visited[node] = True\n for i in range(len(neighbours[node])):\n if not visited[neighbours[node][i]]:\n dfs(neighbours[node][i])\n \n\nn, m, k = map(int, input().split())\nhomes = list(map(int, input().split()))\n\nfor i in range(m):\n u, v = map(int, input().split())\n neighbours[u].append(v)\n neighbours[v].append(u)\n\n\nmax_components = 0\ntotal = 0\nresult = 0\n\nfor i in range(k):\n components = 0\n dfs(homes[i])\n \n total += components\n max_components = max(max_components, components)\n result += pairs(components)\n\n\nn = n - total + max_components\nresult -= pairs(max_components)\nresult += pairs(n)\nresult -= m\nprint(result)", "import collections\n\nn, m, k = [int(x) for x in input().split()]\nc = set([int(x) for x in input().split()])\n\npa = {x:x for x in range(1, n+1)}\n\ndef get_root(x):\n root = x\n while pa[root] != root:\n root = pa[root]\n while x != root:\n pa[x], x = root, pa[x]\n return root\n\ndef connect(x, y):\n rx, ry = get_root(x), get_root(y)\n if rx in c:\n pa[ry] = rx\n else:\n pa[rx] = ry\n\ndef get_sum(n):\n return n * (n-1) // 2\n\nfor _ in range(m):\n x, y = [int(x) for x in input().split()]\n connect(x, y)\n\nroot_counts = collections.defaultdict(lambda: 1)\n\nfor x in pa:\n root = get_root(x)\n if x != root:\n root_counts[root] += 1\n\navailabes = sum(count for root, count in root_counts.items() if root not in c) + sum(1 for x in pa if pa[x] == x and x not in root_counts and x not in c)\ncaps = sorted([count for root, count in root_counts.items() if root in c] or [1])\n\nif m == 0:\n print(get_sum(n-k+1))\nelse:\n caps[-1] += availabes\n print(sum(get_sum(x) for x in caps) - m)\n", "def cin():\r\n return list(map(int, input().split()))\r\n \r\ndef dfs(n):\r\n if not C[n]:\r\n C[n]=True\r\n s[0]+=1\r\n for i in B[n]:\r\n if not C[i]:dfs(i)\r\n \r\nn,m,k=cin()\r\nA=cin()\r\nA=[i-1 for i in A]\r\nB=[list([]) for i in range(n)]\r\nC=[False for i in range(n)]\r\nans=mx=0\r\nfor i in range(m):\r\n a,b=[i-1 for i in cin()]\r\n B[a].append(b)\r\n B[b].append(a)\r\n \r\nfor i in range(k):\r\n s=[0]\r\n dfs(A[i])\r\n ans+=s[0]*(s[0]-1)//2\r\n mx=max(mx,s[0])\r\n \r\nans-=mx*(mx-1)//2\r\nfor i in range(n):\r\n if not C[i]:\r\n s=[0]\r\n dfs(i)\r\n mx+=s[0]\r\n \r\nprint(ans-m+mx*(mx-1)//2)", "class UnionFindVerSize():\r\n def __init__(self, N):\r\n self._parent = [n for n in range(0, N)]\r\n self._size = [1] * N\r\n self.group = N\r\n\r\n def find_root(self, x):\r\n if self._parent[x] == x: return x\r\n self._parent[x] = self.find_root(self._parent[x])\r\n stack = [x]\r\n while self._parent[stack[-1]]!=stack[-1]:\r\n stack.append(self._parent[stack[-1]])\r\n for v in stack:\r\n self._parent[v] = stack[-1]\r\n return self._parent[x]\r\n\r\n def unite(self, x, y):\r\n gx = self.find_root(x)\r\n gy = self.find_root(y)\r\n if gx == gy: return\r\n\r\n self.group -= 1\r\n\r\n if self._size[gx] < self._size[gy]:\r\n self._parent[gx] = gy\r\n self._size[gy] += self._size[gx]\r\n else:\r\n self._parent[gy] = gx\r\n self._size[gx] += self._size[gy]\r\n\r\n def get_size(self, x):\r\n return self._size[self.find_root(x)]\r\n\r\n def is_same_group(self, x, y):\r\n return self.find_root(x) == self.find_root(y)\r\n\r\nclass WeightedUnionFind():\r\n def __init__(self,N):\r\n self.parent = [i for i in range(N)]\r\n self.size = [1 for i in range(N)]\r\n self.val = [0 for i in range(N)]\r\n self.flag = True\r\n self.edge = [[] for i in range(N)]\r\n\r\n def dfs(self,v,pv):\r\n stack = [(v,pv)]\r\n new_parent = self.parent[pv]\r\n while stack:\r\n v,pv = stack.pop()\r\n self.parent[v] = new_parent\r\n for nv,w in self.edge[v]:\r\n if nv!=pv:\r\n self.val[nv] = self.val[v] + w\r\n stack.append((nv,v))\r\n\r\n def unite(self,x,y,w):\r\n if not self.flag:\r\n return\r\n if self.parent[x]==self.parent[y]:\r\n self.flag = (self.val[x] - self.val[y] == w)\r\n return\r\n\r\n if self.size[self.parent[x]]>self.size[self.parent[y]]:\r\n self.edge[x].append((y,-w))\r\n self.edge[y].append((x,w))\r\n self.size[x] += self.size[y]\r\n self.val[y] = self.val[x] - w\r\n self.dfs(y,x)\r\n else:\r\n self.edge[x].append((y,-w))\r\n self.edge[y].append((x,w))\r\n self.size[y] += self.size[x]\r\n self.val[x] = self.val[y] + w\r\n self.dfs(x,y)\r\n\r\nclass Dijkstra():\r\n class Edge():\r\n def __init__(self, _to, _cost):\r\n self.to = _to\r\n self.cost = _cost\r\n\r\n def __init__(self, V):\r\n self.G = [[] for i in range(V)]\r\n self._E = 0\r\n self._V = V\r\n\r\n @property\r\n def E(self):\r\n return self._E\r\n\r\n @property\r\n def V(self):\r\n return self._V\r\n\r\n def add_edge(self, _from, _to, _cost):\r\n self.G[_from].append(self.Edge(_to, _cost))\r\n self._E += 1\r\n\r\n def shortest_path(self, s):\r\n import heapq\r\n que = []\r\n d = [10**15] * self.V\r\n d[s] = 0\r\n heapq.heappush(que, (0, s))\r\n\r\n while len(que) != 0:\r\n cost, v = heapq.heappop(que)\r\n if d[v] < cost: continue\r\n\r\n for i in range(len(self.G[v])):\r\n e = self.G[v][i]\r\n if d[e.to] > d[v] + e.cost:\r\n d[e.to] = d[v] + e.cost\r\n heapq.heappush(que, (d[e.to], e.to))\r\n return d\r\n\r\n#Z[i]:length of the longest list starting from S[i] which is also a prefix of S\r\n#O(|S|)\r\ndef Z_algorithm(s):\r\n N = len(s)\r\n Z_alg = [0]*N\r\n\r\n Z_alg[0] = N\r\n i = 1\r\n j = 0\r\n while i < N:\r\n while i+j < N and s[j] == s[i+j]:\r\n j += 1\r\n Z_alg[i] = j\r\n if j == 0:\r\n i += 1\r\n continue\r\n k = 1\r\n while i+k < N and k + Z_alg[k]<j:\r\n Z_alg[i+k] = Z_alg[k]\r\n k += 1\r\n i += k\r\n j -= k\r\n return Z_alg\r\n\r\nclass BIT():\r\n def __init__(self,n,mod=0):\r\n self.BIT = [0]*(n+1)\r\n self.num = n\r\n self.mod = mod\r\n\r\n def query(self,idx):\r\n res_sum = 0\r\n mod = self.mod\r\n while idx > 0:\r\n res_sum += self.BIT[idx]\r\n if mod:\r\n res_sum %= mod\r\n idx -= idx&(-idx)\r\n return res_sum\r\n\r\n #Ai += x O(logN)\r\n def update(self,idx,x):\r\n mod = self.mod\r\n while idx <= self.num:\r\n self.BIT[idx] += x\r\n if mod:\r\n self.BIT[idx] %= mod\r\n idx += idx&(-idx)\r\n return\r\n\r\nclass dancinglink():\r\n def __init__(self,n,debug=False):\r\n self.n = n\r\n self.debug = debug\r\n self._left = [i-1 for i in range(n)]\r\n self._right = [i+1 for i in range(n)]\r\n self.exist = [True for i in range(n)]\r\n\r\n def pop(self,k):\r\n if self.debug:\r\n assert self.exist[k]\r\n L = self._left[k]\r\n R = self._right[k]\r\n if L!=-1:\r\n if R!=self.n:\r\n self._right[L],self._left[R] = R,L\r\n else:\r\n self._right[L] = self.n\r\n elif R!=self.n:\r\n self._left[R] = -1\r\n self.exist[k] = False\r\n\r\n def left(self,idx,k=1):\r\n if self.debug:\r\n assert self.exist[idx]\r\n res = idx\r\n while k:\r\n res = self._left[res]\r\n if res==-1:\r\n break\r\n k -= 1\r\n return res\r\n\r\n def right(self,idx,k=1):\r\n if self.debug:\r\n assert self.exist[idx]\r\n res = idx\r\n while k:\r\n res = self._right[res]\r\n if res==self.n:\r\n break\r\n k -= 1\r\n return res\r\n\r\nclass SparseTable():\r\n def __init__(self,A,merge_func,ide_ele):\r\n N = len(A)\r\n \r\n self.merge_func = merge_func\r\n \r\n self.lg = [0]*(N + 1)\r\n for i in range(2, N+1):\r\n self.lg[i] = self.lg[i >> 1] + 1\r\n self.pow_2 = [pow(2,i) for i in range(20)]\r\n \r\n self.table = [None]*(self.lg[N] + 1)\r\n st0 = self.table[0] = [a for a in A]\r\n b = 1\r\n for i in range(self.lg[N]):\r\n st0 = self.table[i+1] = [self.merge_func(u,v) for u, v in zip(st0, st0[b:])]\r\n b <<= 1\r\n \r\n def query(self,s,t):\r\n b = t-s+1\r\n m = self.lg[b]\r\n return self.merge_func(self.table[m][s],self.table[m][t-self.pow_2[m]+1])\r\n \r\n\r\nclass BinaryTrie:\r\n class node:\r\n def __init__(self,val):\r\n self.left = None\r\n self.right = None\r\n self.max = val\r\n\r\n def __init__(self):\r\n self.root = self.node(-10**15)\r\n\r\n def append(self,key,val):\r\n pos = self.root\r\n for i in range(29,-1,-1):\r\n pos.max = max(pos.max,val)\r\n if key>>i & 1:\r\n if pos.right is None:\r\n pos.right = self.node(val)\r\n pos = pos.right\r\n else:\r\n pos = pos.right\r\n else:\r\n if pos.left is None:\r\n pos.left = self.node(val)\r\n pos = pos.left\r\n else:\r\n pos = pos.left\r\n pos.max = max(pos.max,val)\r\n\r\n def search(self,M,xor):\r\n res = -10**15\r\n pos = self.root\r\n for i in range(29,-1,-1):\r\n if pos is None:\r\n break\r\n\r\n if M>>i & 1:\r\n if xor>>i & 1:\r\n if pos.right:\r\n res = max(res,pos.right.max)\r\n pos = pos.left\r\n else:\r\n if pos.left:\r\n res = max(res,pos.left.max)\r\n pos = pos.right\r\n else:\r\n if xor>>i & 1:\r\n pos = pos.right\r\n else:\r\n pos = pos.left\r\n\r\n if pos:\r\n res = max(res,pos.max)\r\n return res\r\n\r\ndef solveequation(edge,ans,n,m):\r\n #edge=[[to,dire,id]...]\r\n def dfs(v):\r\n used[v]=True\r\n r=ans[v]\r\n for to,dire,id in edge[v]:\r\n if used[to]:\r\n continue\r\n y=dfs(to)\r\n if dire==-1:\r\n x[id]=y\r\n else:\r\n x[id]=-y\r\n r+=y\r\n return r\r\n \r\n x=[0]*m\r\n used=[False]*n\r\n for v in range(n):\r\n if used[v]:\r\n continue\r\n y = dfs(v)\r\n if y!=0:\r\n return False\r\n return x\r\n\r\n \r\n\r\nclass slope_trick():\r\n def __init__(self):\r\n self.L = [10**17]\r\n self.R = [10**17]\r\n self.min_f = 0\r\n\r\n self.x_left = 0\r\n self.x_right = 0\r\n\r\n def add_right(self,a):\r\n a -= self.x_left\r\n l0 = -self.L[0]\r\n self.min_f = self.min_f + max(0,l0-a)\r\n if l0 <= a:\r\n a += self.x_left\r\n a -= self.x_right\r\n heappush(self.R,a)\r\n else:\r\n heappush(self.L,-a)\r\n a = -heappop(self.L)\r\n a += self.x_left\r\n a -= self.x_right\r\n heappush(self.R,a)\r\n\r\n #self.min_f = self.min_f + max(0,l0-a)\r\n\r\n def add_left(self,a):\r\n a -= self.x_right\r\n r0 = self.R[0]\r\n self.min_f = self.min_f + max(0,a-r0)\r\n\r\n if a <= r0:\r\n a += self.x_right\r\n a -= self.x_left\r\n heappush(self.L,-a)\r\n else:\r\n heappush(self.R,a)\r\n a = heappop(self.R)\r\n a += self.x_right\r\n a -= self.x_left\r\n heappush(self.L,-a)\r\n\r\n #self.min_f = self.min_f + max(0,a-r0)\r\n\r\n def add_abs(self,a):\r\n self.add_left(a)\r\n self.add_right(a)\r\n\r\n def change_min_slide(self,a,b):\r\n self.x_left += a\r\n self.x_right += b\r\n \r\n def get_val(self,x):\r\n L = [-l+self.x_left for l in self.L]\r\n L.sort()\r\n R = [r+self.x_right for r in self.R]\r\n R.sort()\r\n\r\n res = self.min_f\r\n\r\n if 0 < L[-1]:\r\n L = L[::-1]\r\n n = len(L)\r\n for i in range(n):\r\n c0 = L[i]\r\n c1 = L[i+1]\r\n \r\n if c1 <= x <= c0:\r\n res += (i+1) * (c0-x)\r\n break\r\n else:\r\n res += (i+1) * (c0-c1)\r\n return res\r\n elif L[-1] <= x <= R[0]:\r\n return res\r\n else:\r\n n = len(R)\r\n for i in range(n):\r\n c0 = R[i]\r\n c1 = R[i+1]\r\n if c0 <= x <= c1:\r\n res += (i+1) * (x-c0)\r\n break\r\n else:\r\n res += (i+1) * (c1-c0)\r\n return res\r\n\r\nclass SegmentTree:\r\n def __init__(self, init_val, segfunc, ide_ele):\r\n n = len(init_val)\r\n self.segfunc = segfunc\r\n self.ide_ele = ide_ele\r\n self.num = 1 << (n - 1).bit_length()\r\n self.tree = [ide_ele] * 2 * self.num\r\n self.size = n\r\n for i in range(n):\r\n self.tree[self.num + i] = init_val[i]\r\n for i in range(self.num - 1, 0, -1):\r\n self.tree[i] = self.segfunc(self.tree[2 * i], self.tree[2 * i + 1])\r\n\r\n def update(self, k, x):\r\n k += self.num\r\n self.tree[k] = x\r\n while k > 1:\r\n k >>= 1\r\n self.tree[k] = self.segfunc(self.tree[2*k], self.tree[2*k+1])\r\n\r\n def query(self, l, r):\r\n if r==self.size:\r\n r = self.num\r\n\r\n res = self.ide_ele\r\n\r\n l += self.num\r\n r += self.num\r\n right = []\r\n while l < r:\r\n if l & 1:\r\n res = self.segfunc(res, self.tree[l])\r\n l += 1\r\n if r & 1:\r\n right.append(self.tree[r-1])\r\n l >>= 1\r\n r >>= 1\r\n\r\n for e in right[::-1]:\r\n res = self.segfunc(res,e)\r\n return res\r\n\r\n def bisect_l(self,l,r,x):\r\n l += self.num\r\n r += self.num\r\n Lmin = -1\r\n Rmin = -1\r\n while l<r:\r\n if l & 1:\r\n if self.tree[l] <= x and Lmin==-1:\r\n Lmin = l\r\n l += 1\r\n if r & 1:\r\n if self.tree[r-1] <=x:\r\n Rmin = r-1\r\n l >>= 1\r\n r >>= 1\r\n\r\n if Lmin != -1:\r\n pos = Lmin\r\n while pos<self.num:\r\n if self.tree[2 * pos] <=x:\r\n pos = 2 * pos\r\n else:\r\n pos = 2 * pos +1\r\n return pos-self.num\r\n elif Rmin != -1:\r\n pos = Rmin\r\n while pos<self.num:\r\n if self.tree[2 * pos] <=x:\r\n pos = 2 * pos\r\n else:\r\n pos = 2 * pos +1\r\n return pos-self.num\r\n else:\r\n return -1\r\n\r\nimport sys,random,bisect\r\nfrom collections import deque,defaultdict\r\nfrom heapq import heapify,heappop,heappush\r\nfrom itertools import permutations\r\nfrom math import gcd,log\r\n\r\ninput = lambda :sys.stdin.readline().rstrip()\r\nmi = lambda :map(int,input().split())\r\nli = lambda :list(mi())\r\n\r\nn,m,k = mi()\r\nc = li()\r\nc = [c[i]-1 for i in range(k)]\r\nuf = UnionFindVerSize(n)\r\nfor _ in range(m):\r\n u,v = mi()\r\n uf.unite(u-1,v-1)\r\n\r\nr = [uf.find_root(c[i]) for i in range(k)]\r\ns = [uf.get_size(c[i]) for i in range(k)]\r\nrest = 0\r\n\r\ncheck = set([root for root in r])\r\nfor i in range(n):\r\n if uf.find_root(i)==i and i not in check:\r\n rest += uf.get_size(i)\r\n\r\ns.sort(reverse=True)\r\ns[0] += rest\r\nM = sum(n*(n-1)//2 for n in s)\r\nprint(M-m)\r\n\r\n", "\r\ndef dfs(u,vis):\r\n\tvis.add(u)\r\n\tfor v in g[u]:\r\n\t\tif v not in vis:\r\n\t\t\tdfs(v,vis)\r\n\r\n\r\nn,m,k = map(int,list(input().split()))\r\ngovs_ind = map(int,list(input().split()))\r\norig = set()\r\ncountries = set(range(1,n+1))\r\n\r\ng = [ [] for i in range(n+1) ]\r\n\r\nfor i in range(m):\r\n\tu,v = map(int,list(input().split()))\r\n\tif(u>v):\r\n\t\tu,v = v,u\r\n\torig.add((u,v))\r\n\tg[u].append(v)\r\n\tg[v].append(u)\r\n\r\ngov_nods = []\r\n\r\nfor u in govs_ind:\r\n\tvis = set()\r\n\tdfs(u,vis)\r\n\tgov_nods.append(vis)\r\n\r\nno_govs = countries.copy()\r\n\r\n\r\nnvoss = 0\r\nfor reg in gov_nods:\r\n\tno_govs -= reg\r\n\tsize = len(reg)\r\n\tnvoss += (size*(size-1))//2\r\n\r\nsize = len(no_govs)\r\nnvoss += (size*(size-1))//2\r\n\r\nmaxi = 0\r\nfor i in range(len(gov_nods)):\r\n\tif len(gov_nods[i]) > len(gov_nods[maxi]) :\r\n\t\tmaxi = i\r\nmax_gov = gov_nods[maxi]\r\n\r\nnvoss += len(max_gov)*len(no_govs)\r\nnvoss -= len(orig)\r\nprint(nvoss)\r\n", "def make_dfs(G):\n vis = {i: False for i in G}\n cols = {i: [] for i in G}\n\n def dfs(u, color=None):\n if color is None:\n color = u\n vis[u] = True\n cols[color].append(u)\n for v in G[u]:\n if not vis[v]:\n dfs(v, color)\n return cols[color]\n\n return dfs, vis\n\n\ndef main():\n n, m, k = map(int, input().split())\n centers = list(map(int, input().split()))\n G = {i: [] for i in range(1, n+1)}\n for i in range(m):\n u, v = map(int, input().split())\n G[u].append(v)\n G[v].append(u)\n\n dfs, vis = make_dfs(G)\n ans = 0\n mx = 0\n for x in centers:\n l = dfs(x)\n mx = len(l) if len(l) > mx else mx\n ans += len(l) * (len(l) - 1) / 2\n\n size = 0\n for u in G:\n if not vis[u]:\n l = dfs(u)\n size += len(l)\n\n ans += size * (size - 1) / 2\n ans += mx * size\n print (int(ans - m))\n\n\nmain()\n", "def dfs(n):\n if not C[n]:\n C[n] = True\n aux[0] += 1\n for i in B[n]:\n if not C[i]:dfs(i)\n \nl1, l2, l3 = list(map(int, input().split()))\nA = [i - 1 for i in list(map(int, input().split()))]\nB = [list([]) for i in range(l1)]\nC = [False for i in range(l1)]\n \nans = 0\ncurr_max = 0\n \nfor i in range(l2):\n a, b = [i - 1 for i in list(map(int, input().split()))]\n B[a].append(b)\n B[b].append(a)\n \nfor i in range(l3):\n aux = [0]\n dfs(A[i])\n ans += aux[0] * (aux[0] - 1) // 2\n curr_max = max(curr_max, aux[0])\n \nans -= curr_max * (curr_max - 1) // 2\nfor i in range(l1):\n if not C[i]:\n aux = [0]\n dfs(i)\n curr_max += aux[0]\n\nprint(ans - l2 + curr_max * (curr_max - 1) // 2)", "n,m,k = list(map(int, input().split()))\r\naux = list(map(int, input().split()))\r\nlista = [i-1 for i in aux]\r\ngrafo = [list([]) for i in range(n)]\r\nvisitados = [False for i in range(n)]\r\nans = 0\r\nmx = 0\r\n\r\ndef dfs(n):\r\n if not visitados[n]:\r\n visitados[n]=True\r\n s[0]+=1\r\n for i in grafo[n]:\r\n if not visitados[i]:dfs(i) \r\n\r\nfor i in range(m):\r\n a,b=[i-1 for i in list(map(int, input().split()))]\r\n grafo[a].append(b)\r\n grafo[b].append(a)\r\n \r\nfor i in range(k):\r\n s=[0]\r\n dfs(lista[i])\r\n ans+=s[0]*(s[0]-1)//2\r\n mx=max(mx,s[0])\r\n \r\nans -= mx*(mx-1)//2\r\nfor i in range(n):\r\n if not visitados[i]:\r\n s=[0]\r\n dfs(i)\r\n mx+=s[0]\r\n \r\nprint(ans-m+mx*(mx-1)//2)", "def estavel(p):\r\n\tif p != arr[p]:\r\n\t\tarr[p] = estavel(arr[p])\r\n\treturn arr[p]\r\n\r\nn, m, k = map(int, input().split())\r\ngrafo = map(int, input().split()) \r\narr = [p for p in range(n+1)]\r\n \r\n\r\n \r\nfor _ in range(m):\r\n u, v = map(int, input().split())\r\n u = estavel(u)\r\n v = estavel(v)\r\n arr[v] = u\r\n\r\naux = [0 for i in range(n+1)]\r\nfor i in range(n+1):\r\n\taux[estavel(i)] += 1\r\n \r\nsobras = n\r\nresultado = 0\r\nmaior = 0\r\nfor x in grafo:\r\n\telem = estavel(x)\r\n\tmaior = max(maior, aux[elem])\r\n\tresultado += aux[elem] * (aux[elem] - 1) // 2\r\n\tsobras -= aux[elem]\r\n \r\nresultado -= maior * (maior - 1) // 2\r\nresultado += (maior+sobras) * ((maior+sobras) - 1) // 2\r\nresultado -= m\r\n \r\nprint(resultado)", "def functionAux(ind):\r\n if not C[ind]:\r\n C[ind]=True\r\n aux[0]+=1\r\n for i in B[ind]:\r\n if not C[i]:functionAux(i)\r\n\r\nlistOne,listTwo,listThree=list(map(int, input().split()))\r\n\r\nA=list(map(int, input().split()))\r\nA=[i-1 for i in A]\r\n\r\nB=[list([]) for i in range(listOne)]\r\nC=[False for i in range(listOne)]\r\n\r\nans=0\r\nauxMax=0\r\n\r\nfor i in range(listTwo):\r\n a,b=[i-1 for i in list(map(int, input().split()))]\r\n B[a].append(b)\r\n B[b].append(a)\r\n \r\nfor i in range(listThree):\r\n aux=[0]\r\n functionAux(A[i])\r\n ans+=aux[0]*(aux[0]-1)//2\r\n auxMax=max(auxMax,aux[0])\r\n \r\nans-=auxMax*(auxMax-1)//2\r\nfor i in range(listOne):\r\n if not C[i]:\r\n aux=[0]\r\n functionAux(i)\r\n auxMax+=aux[0]\r\n \r\nresult= ans - listTwo + auxMax * (auxMax-1) // 2\r\n\r\nprint(result)", "def dfs(vertex, summ, has_capital, am):\r\n summ += len(neigh[vertex])\r\n am += 1\r\n if vertex in capitals:\r\n has_capital = True\r\n used[vertex] = True\r\n for nei in neigh[vertex]:\r\n if not used[nei]:\r\n tmp_c, am, summ = dfs(nei, summ, has_capital, am)\r\n has_capital |= tmp_c\r\n return [has_capital, am, summ]\r\n\r\nn, m, k = [int(i) for i in input().split()]\r\nneigh = []\r\nfor i in range(n):\r\n neigh.append([]) \r\ncapitals = [int(i) - 1 for i in input().split()]\r\nfor i in range(m):\r\n u, v = [int(i) - 1 for i in input().split()]\r\n neigh[u].append(v)\r\n neigh[v].append(u)\r\n\r\nresult = 0\r\nused = [False] * n\r\ncomp = []\r\nwhile False in used:\r\n comp.append(dfs(used.index(False), 0, False, 0))\r\n comp[len(comp) - 1][2] /= 2\r\n\r\nfor i in range(len(comp)):\r\n result -= comp[i][2]\r\n\r\ncomp.sort(reverse=True)\r\ntotal_ns = comp[0][1]\r\nfor i in range(1, len(comp)):\r\n if not comp[i][0]:\r\n total_ns += comp[i][1]\r\n else:\r\n result += comp[i][1] * (comp[i][1] - 1) / 2\r\nresult += (total_ns) * (total_ns - 1) / 2\r\nprint(int(result))", "class Union:\n\n def __init__(self, n):\n self.ancestors = [i for i in range(n+1)]\n self.size = [0]*(n+1)\n\n def get_root(self, node):\n if self.ancestors[node] == node:\n return node\n self.ancestors[node] = self.get_root(self.ancestors[node])\n return self.ancestors[node]\n\n def merge(self, a, b):\n a, b = self.get_root(a), self.get_root(b)\n self.ancestors[a] = b\n\n\ndef combination(number):\n return (number * (number - 1)) >> 1\n\n\nn, m, k = map(int, input().split())\nbiggest, others, res = 0, n, -m\nhomes = list(map(int, input().split()))\nunion = Union(n)\n\nfor _ in range(m):\n a, b = map(int, input().split())\n union.merge(a, b)\n\nfor i in range(1, n+1):\n union.size[union.get_root(i)] += 1\n\nfor home in homes:\n size = union.size[union.get_root(home)]\n biggest = max(biggest, size)\n res += combination(size)\n others -= size\n\nres -= combination(biggest)\nres += combination(biggest + others)\nprint(res)", "n, m, k = list(map(int, input().split()))\ng = list(map(int, input().split()))\n\nadj = [[] for _ in range(n+1)]\nvisited = [False]*(n+1)\n\nfor i in range(m):\n u, v = list(map(int, input().split()))\n adj[u].append(v)\n adj[v].append(u)\n\ndef dfs(i):\n if visited[i]:\n return []\n arr = [i]\n visited[i] = True\n for j in adj[i]:\n if not visited[j]:\n arr += dfs(j)\n return arr\n\ndef edges(arr):\n count = 0\n for i in arr:\n count += len(adj[i])\n return count // 2\n\n# Array to store components\nnonGovComp = []\ngovComp = []\n\n# DFS to find components with gov nodes\nfor i in g:\n if not visited[i]:\n govComp.append(dfs(i))\n\n# DFS to find components with NO gov nodes\nfor i in range(1, n + 1):\n if (not visited[i]) and (i not in g):\n nonGovComp.append(dfs(i))\n\nnonGovEdges = 0\nnonGovVertices = 0\nfor i in nonGovComp:\n nonGovVertices += len(i)\n nonGovEdges += edges(i)\n\nmaxGovCompIndex = govComp.index(max(govComp, key=len))\nmaxGovCompEdges = edges(govComp[maxGovCompIndex])\n\ntotalVertices = len(govComp[maxGovCompIndex]) + nonGovVertices\n\n# Computes the new edges created by the union of max gov component's vertices\n# with non-gov components' vertices \nnewEdges = totalVertices*(totalVertices-1)//2 - (nonGovEdges + maxGovCompEdges)\n\n# Computes the new edges created in gov components\nfor i in range(len(govComp)):\n if i != maxGovCompIndex:\n v = len(govComp[i])\n e = v*(v-1)//2\n newEdges += e - edges(govComp[i])\n\nprint(newEdges)", "import sys\n\nclass YobaDSU():\n def __init__(self, keys, weights):\n self.A = [[i,0,w] for i, w in zip(keys, weights)]\n self.size = len(self.A)\n def get(self, i):\n p = i\n while self.A[p][0] != p: p = self.A[p][0]\n j = self.A[i][0]\n while j != p:\n self.A[i][0] = p\n i, j = j, self.A[j][0]\n return (p, self.A[p][2])\n def __getitem__(self, i):\n return self.get(i)[0]\n def union(self, i, j):\n u, v = self[i], self[j]\n if u == v: return\n self.size -= 1\n if self.A[u][1] > self.A[v][1]:\n self.A[v][0] = u\n self.A[u][2] += self.A[v][2]\n else:\n self.A[u][0] = v\n self.A[v][2] += self.A[u][2]\n if self.A[u][1] == self.A[v][1]:\n self.A[v][1] += 1\n def __len__(self): return self.size\n\nclass WeightedDSU(YobaDSU):\n def __init__(self, weights):\n self.A = [[i,0,w] for i, w in enumerate(weights)]\n self.size = len(self.A)\n\nclass DSU(YobaDSU):\n def __init__(self, n):\n self.A = [[i,0,1] for i in range(n)]\n self.size = n\n\ndef solve():\n n, m, k = map(int, input().split())\n C = [int(x)-1 for x in input().split()]\n D = DSU(n)\n for line in sys.stdin:\n u, v = map(int, line.split())\n D.union(u-1, v-1)\n\n S = [D.get(c)[1] for c in C]\n free = n - sum(S)\n argmax = max(enumerate(S), key = lambda x: x[1])\n S[argmax[0]] += free\n\n return sum(s*(s-1)//2 for s in S) - m\n\nprint(solve())\n \n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n", "def operacoes(saida):\r\n saida -= maior * (maior - 1) // 2\r\n saida += (maior + resto) * ((maior + resto) - 1) // 2\r\n saida -= num_arestas\r\n return saida\r\n\r\ndef popula_raiz():\r\n for i in range(num_arestas):\r\n u, v = map(calcula_p, map(int, input().split()))\r\n raiz[v] = u\r\n\r\ndef calcula_p(p):\r\n\tif p != raiz[p]:\r\n\t\traiz[p] = calcula_p(raiz[p])\r\n\treturn raiz[p]\r\n\r\nnum_vertices, num_arestas, num_casas = map(int, input().split())\r\nraiz = [i for i in range(num_vertices + 1)]\r\ngrafo = map(int, input().split()) \r\n\r\npopula_raiz()\r\naux = [0 for i in range(num_vertices + 1)]\r\nfor i in range(num_vertices + 1):\r\n\taux[calcula_p(i)] += 1\r\n\r\nresto = num_vertices\r\nsaida = 0\r\nmaior = 0\r\nfor x in grafo:\r\n\tj = calcula_p(x)\r\n\tmaior = max(maior, aux[j])\r\n\tsaida += aux[j] * (aux[j] - 1) // 2\r\n\tresto -= aux[j]\r\n \r\nprint(operacoes(saida))" ]

[ "# lista doble enlazada o(1) operaciones en los bordes es mejor que si se implementa en el propio lenguaje\nfrom collections import deque\nn, m = input().split()\nn = int(n)\nm = int(m)\n\n\ndef idx(i, j):\n return i*m + j\n\n\nmax = n*m*2\ngraph = \"\"\nvirtDist = [[], [], []]\nvirtVertex = [deque(), deque(), deque()]\nvirtNodesDst = [max, max, max]\ncode = ord(\"1\")\nfor i in range(0, n):\n s = input()\n graph += s\n for j in range(0, m):\n virtDist[0].append(max)\n virtDist[1].append(max)\n virtDist[2].append(max)\n indx = ord(s[j])-code\n if 0 > indx or indx > 2:\n continue\n virtVertex[indx].append((i, j))\n i2 = idx(i, j)\n virtDist[indx][-1] = 0\n\n\ndef bfs01(queue, distance):\n while queue:\n pi, pj = queue.popleft()\n for i, j in [(pi, pj-1), (pi, pj+1), (pi-1, pj), (pi+1, pj)]:\n indx = idx(i, j)\n if 0 > i or i >= n or 0 > j or j >= m or graph[indx] == '#':\n continue\n isRoad = graph[indx] == \".\"\n newDistance = distance[idx(pi, pj)] + (1 if isRoad else 0)\n if distance[indx] > newDistance: # relax\n distance[indx] = newDistance\n if isRoad:\n queue.append((i, j))\n else:\n queue.appendleft((i, j))\n\n\nbfs01(virtVertex[0], virtDist[0])\nbfs01(virtVertex[1], virtDist[1])\nbfs01(virtVertex[2], virtDist[2])\n\noutput = max\nfor i in range(0, n*m):\n output = min(virtDist[0][i] + virtDist[1][i] + virtDist[2]\n [i] - (2 if graph[i] == \".\"else 0), output)\n\nprint(output if output < max else -1)\n", "from collections import deque\n\n\ndef idx(i, j):\n return i*m + j\n\n\ndef solve():\n global n, m\n n, m = map(lambda x: int(x), input().split())\n global maxVal\n maxVal = (n*m)**2\n graph = ['']*(n*m)\n vrtDst = [[maxVal] * (n*m), [maxVal] * (n*m), [maxVal] * (n*m)]\n virtVertex = [deque(), deque(), deque()]\n refAsci = ord(\"1\")\n for i in range(0, n):\n s = input()\n for j in range(0, m):\n graph[idx(i, j)] = s[j]\n indx = ord(s[j])-refAsci\n if not (0 <= indx <= 2):\n continue\n virtVertex[indx].append((i, j))\n vrtDst[indx][idx(i, j)] = 0\n\n bfs01(graph, virtVertex[0], vrtDst[0])\n bfs01(graph, virtVertex[1], vrtDst[1])\n bfs01(graph, virtVertex[2], vrtDst[2])\n\n smallst = maxVal\n for i in range(0, n*m):\n smallst = min(smallst, vrtDst[0][i]\n + vrtDst[1][i] + vrtDst[2][i]\n - (2 if graph[i] == \".\"else 0))\n\n print(smallst if smallst < maxVal else -1)\n\n\ndef bfs01(graph, queue, dist):\n while queue:\n pi, pj = queue.popleft()\n for i, j in [(pi, pj-1), (pi, pj+1), (pi-1, pj), (pi+1, pj)]:\n indx = idx(i, j)\n if not (0 <= i < n and 0 <= j < m) or graph[indx] == '#':\n continue\n isRoad = graph[indx] == \".\"\n newDist = dist[idx(pi, pj)] + (1 if isRoad else 0)\n if dist[indx] > newDist: # relax\n dist[indx] = newDist\n if isRoad:\n queue.append((i, j))\n else:\n queue.appendleft((i, j))\n\n\nsolve()\n", "from collections import deque\r\n\r\ndi = [0, -1, 0, 1]\r\ndj = [1, 0, -1, 0]\r\n\r\n\r\nn, m = map(int, input().split())\r\n\r\ngrid = [input().strip() for i in range(n)]\r\n\r\ndist = [[[1e6]*3 for j in range(m)] for i in range(n)]\r\n\r\nfor state in range(3):\r\n q = deque()\r\n\r\n for i in range(n):\r\n for j, c in enumerate(grid[i]):\r\n if ord(c) - ord('1') == state:\r\n q.append((i, j))\r\n dist[i][j][state] = 0\r\n\r\n while q:\r\n i, j = q.popleft()\r\n\r\n for k in range(4):\r\n ni, nj = i + di[k], j + dj[k]\r\n\r\n if 0 <= ni < n and 0 <= nj < m and grid[ni][nj] != '#' and dist[ni][nj][state] == 1e6:\r\n if grid[ni][nj] == '.':\r\n dist[ni][nj][state] = dist[i][j][state] + 1\r\n q.append((ni, nj))\r\n else:\r\n dist[ni][nj][state] = dist[i][j][state]\r\n q.appendleft((ni, nj))\r\n\r\nans = 1e6\r\nfor i in range(n):\r\n for j in range(m):\r\n # If any pair of paths overlap, there must exist some other i,j at an \"endpoint\" of the overlap that\r\n # has smaller dist, so we don't count this invalid i,j anyway\r\n #\r\n # The best such i, j will clearly always be counted by contradiction:\r\n # Consider any best set of '.' to build roads on.\r\n # Select some i,j that leads to no overlap between paths from each state to that i,j via repeatedly\r\n # applying the idea above\r\n # Then, the number of '.' on the path from any state to i,j is >= dist[i][j][state]\r\n # If it is >, then we contract our assumption that this was the best set of '.'\r\n # If it is =, then we will consider this best set in the answer\r\n ans = min(ans, sum(dist[i][j]) - 2 * (grid[i][j] == '.')) # subtract due to guaranteed \"wrong\" overlap\r\n\r\n\r\nprint(ans if ans != 1e6 else -1)\r\n", "# lista doble enlazada o(1) operaciones en los bordes es mejor que si se implementa en el propio lenguaje\nfrom collections import deque\n\n\ndef idx(i, j):\n return i*m + j\n\n\ndef solve():\n global n, m\n n, m = map(lambda x: int(x), input().split())\n global maxValue\n maxValue = (n*m)**2\n global graph\n graph = \"\"\n virtDist = [[maxValue] * (n*m), [maxValue] * (n*m), [maxValue] * (n*m)]\n virtVertex = [deque(), deque(), deque()]\n refAsci = ord(\"1\")\n for i in range(0, n):\n s = input()\n graph += s\n for j in range(0, m):\n indx = ord(s[j])-refAsci\n if not (0 <= indx <= 2):\n continue\n virtVertex[indx].append((i, j))\n virtDist[indx][idx(i, j)] = 0\n bfs01(virtVertex[0], virtDist[0])\n bfs01(virtVertex[1], virtDist[1])\n bfs01(virtVertex[2], virtDist[2])\n\n output = maxValue\n for i in range(0, n*m):\n output = min(virtDist[0][i] + virtDist[1][i] + virtDist[2][i]\n - (2 if graph[i] == \".\"else 0), output)\n\n print(output if output < maxValue else -1)\n\n\ndef bfs01(queue, distance):\n while queue:\n pi, pj = queue.popleft()\n for i, j in [(pi, pj-1), (pi, pj+1), (pi-1, pj), (pi+1, pj)]:\n indx = idx(i, j)\n if 0 > i or i >= n or 0 > j or j >= m or graph[indx] == '#':\n continue\n isRoad = graph[indx] == \".\"\n newDistance = distance[idx(pi, pj)] + (1 if isRoad else 0)\n if distance[indx] > newDistance: # relax\n distance[indx] = newDistance\n if isRoad:\n queue.append((i, j))\n else:\n queue.appendleft((i, j))\n\nsolve()", "# lista doble enlazada o(1) operaciones en los bordes es mejor que si se implementa en el propio lenguaje\nfrom collections import deque\n\n\ndef idx(i, j):\n return i*m + j\n\n\ndef solve():\n global n, m\n n, m = map(lambda x: int(x), input().split())\n global maxValue\n maxValue = (n*m)**2\n graph = ['']*(n*m)\n virtDst = [[maxValue] * (n*m), [maxValue] * (n*m), [maxValue] * (n*m)]\n virtVertex = [deque(), deque(), deque()]\n refAsci = ord(\"1\")\n for i in range(0, n):\n s = input()\n for j in range(0, m):\n graph[idx(i, j)] = s[j]\n indx = ord(s[j])-refAsci\n if not (0 <= indx <= 2):\n continue\n virtVertex[indx].append((i, j))\n virtDst[indx][idx(i, j)] = 0\n bfs01(graph, virtVertex[0], virtDst[0])\n bfs01(graph, virtVertex[1], virtDst[1])\n bfs01(graph, virtVertex[2], virtDst[2])\n\n minimum = maxValue\n for i in range(0, n*m):\n minimum = min(virtDst[0][i] + virtDst[1][i] + virtDst[2][i]\n - (2 if graph[i] == \".\"else 0), minimum)\n\n print(minimum if minimum < maxValue else -1)\n\n\ndef bfs01(graph, queue, dist):\n while queue:\n pi, pj = queue.popleft()\n for i, j in [(pi, pj-1), (pi, pj+1), (pi-1, pj), (pi+1, pj)]:\n indx = idx(i, j)\n if (not (0 <= i < n and 0 <= j < m)) or graph[indx] == '#':\n continue\n isRoad = graph[indx] == \".\"\n newDist = dist[idx(pi, pj)] + (1 if isRoad else 0)\n if dist[indx] > newDist: # relax\n dist[indx] = newDist\n if isRoad:\n queue.append((i, j))\n else:\n queue.appendleft((i, j))\n\n\nsolve()\n" ]

[ "a = int(input())\r\ns = input()\r\n\r\nsm ={}\r\nfor i in range(len(s)):\r\n for j in range(i,len(s)):\r\n if j== i:\r\n t = int(s[j])\r\n else:\r\n t += int(s[j])\r\n if t in sm:\r\n sm[t] += 1\r\n else:\r\n sm[t] = 1\r\nif a==0:\r\n if 0 in sm:\r\n sum_pairs = (len(s)*(len(s)+1))//2\r\n print((sm[0]*(sum_pairs))+(sm[0]*((sum_pairs) - sm[0])))\r\n else:\r\n print(0)\r\nelse:\r\n c = 0\r\n for f in sm:\r\n if f != 0 and a % f == 0 and (a//f) in sm:\r\n c += sm[f] * sm[a//f]\r\n\r\n print(c)\r\n\r\n", "import sys\r\nfrom math import log2,floor,ceil,sqrt\r\n# import bisect\r\n# from collections import deque\r\n\r\nRi = lambda : [int(x) for x in sys.stdin.readline().split()]\r\nri = lambda : sys.stdin.readline().strip()\r\n \r\ndef input(): return sys.stdin.readline().strip()\r\ndef list2d(a, b, c): return [[c] * b for i in range(a)]\r\ndef list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)]\r\ndef list4d(a, b, c, d, e): return [[[[e] * d for j in range(c)] for j in range(b)] for i in range(a)]\r\ndef ceil(x, y=1): return int(-(-x // y))\r\ndef INT(): return int(input())\r\ndef MAP(): return map(int, input().split())\r\ndef LIST(N=None): return list(MAP()) if N is None else [INT() for i in range(N)]\r\ndef Yes(): print('Yes')\r\ndef No(): print('No')\r\ndef YES(): print('YES')\r\ndef NO(): print('NO')\r\nINF = 10 ** 18\r\nMOD = 10**9+7\r\n\r\na = int(ri())\r\nst= ri()\r\narr = [int(i) for i in st]\r\ndic = {}\r\ncnt = 0\r\nnz = 0\r\nfor i in range(len(st)):\r\n summ = 0\r\n for j in range(i,len(st)):\r\n summ+=arr[j]\r\n if summ != 0:\r\n nz+=1\r\n if summ in dic:\r\n dic[summ]+=1\r\n else:\r\n dic[summ] = 1\r\nif a!= 0:\r\n for i in dic:\r\n if i != 0:\r\n val = a/i\r\n if val in dic:\r\n cnt = cnt + dic[val]*dic[i]\r\n print(cnt)\r\nelse:\r\n n = len(st)\r\n print(n**2*(n+1)**2//4 - nz*nz)\r\n\r\n", "def divisors(x):\n def f(y, q):\n t = -len(r)\n while not y % q:\n y //= q\n for i in range(t, 0):\n r.append(r[t] * q)\n return y\n\n r, p = [1], 7\n x = f(f(f(x, 2), 3), 5)\n while x >= p * p:\n for s in 4, 2, 4, 2, 4, 6, 2, 6:\n if not x % p:\n x = f(x, p)\n p += s\n if x > 1:\n f(x, x)\n return r\n\n\ndef main():\n a, s = int(input()), input()\n if not a:\n z = sum(x * (x + 1) for x in map(len, s.translate(\n str.maketrans('123456789', ' ')).split())) // 2\n x = len(s)\n print((x * (x + 1) - z) * z)\n return\n sums, x, cnt = {}, 0, 1\n for u in map(int, s):\n if u:\n sums[x] = cnt\n x += u\n cnt = 1\n else:\n cnt += 1\n if x * x < a:\n print(0)\n return\n sums[x], u = cnt, a // x\n l = [v for v in divisors(a) if v <= x]\n z = a // max(l)\n d = {x: 0 for x in l if z <= x}\n for x in d:\n for k, v in sums.items():\n u = sums.get(k + x, 0)\n if u:\n d[x] += v * u\n print(sum(u * d[a // x] for x, u in d.items()))\n\n\nif __name__ == '__main__':\n main()\n", "a = int(input())\r\ns = input()\r\nd = {}\r\nfor i in range(len(s)):\r\n for j in range(i, len(s)):\r\n if j == i: t = int(s[j])\r\n else: t += int(s[j])\r\n d[t] = d.get(t, 0) + 1\r\nif a == 0:\r\n if 0 in d:\r\n cnt_pairs = (len(s) * (len(s) + 1)) // 2\r\n print((d[0] * cnt_pairs) + (d[0] * (cnt_pairs - d[0])))\r\n else:\r\n print(0)\r\nelse:\r\n c = 0\r\n for f in d:\r\n if f != 0 and a % f == 0 and (a//f) in d:\r\n c += d[f] * d[a//f]\r\n print(c)", "from collections import defaultdict\n\na = int(input())\n\n# calculating the prefix sum\ns = [0]+list(map(int, list(input())))\nn = len(s)-1\nfor i in range(1, len(s)):\n s[i] += s[i-1]\n\n# make dictionary on prefix sums\nd = defaultdict(int)\nfor i in range(1, len(s)):\n for j in range(i):\n d[s[i]-s[j]] += 1\n\n# find possible answers pairs\nans = 0\n# edge case\nif a == 0:\n ans += d[0]*(n*(n+1) - d[0])\nk = 1\nwhile k*k <= a:\n if a % k == 0:\n ans += d[k]*d[a//k]*(1 if k**2 == a else 2)\n k += 1\n\nprint(ans)\n", "# link: https://codeforces.com/problemset/problem/364/A\r\n\r\nfrom collections import defaultdict\r\n\r\nfor _ in range(1):\r\n a = int(input())\r\n values = [int(i) for i in input()]\r\n ans = 0\r\n memo = defaultdict(int)\r\n for i in range(len(values)):\r\n total = 0\r\n for j in range(i, len(values)):\r\n total += values[j]\r\n memo[total] += 1\r\n if a == 0:\r\n # edge case\r\n ans += pow(memo[0], 2)\r\n for key in memo: \r\n if key != 0: ans += memo[0] * memo[key] * 2\r\n print(ans) \r\n else:\r\n # normal case, not an edge case\r\n for key in memo:\r\n if key and a%key == 0 and a//key in memo: ans += memo[key] * memo[a//key]\r\n print(ans) " ]

[ "n = int(input())\r\na = [int(i) for i in input().split()]\r\nl = [-1 for _ in range(n)]\r\nr = [n for _ in range(n)]\r\nanswer = [0 for _ in range(n+1)] \r\ns = []\r\nfor i in range(n):\r\n while s and a[s[-1]] >= a[i]:\r\n s.pop()\r\n if s:\r\n l[i] = s[-1]\r\n s.append(i)\r\nwhile s:\r\n s.pop()\r\nfor i in range(n-1, -1, -1):\r\n while s and a[s[-1]] >= a[i]:\r\n s.pop()\r\n if s:\r\n r[i] = s[-1]\r\n s.append(i)\r\nfor i in range(n):\r\n length = r[i] - l[i] - 1\r\n answer[length] = max(answer[length], a[i])\r\nfor i in range(n-1, -1, -1):\r\n answer[i] = max(answer[i], answer[i+1])\r\nanswer = answer[1:]\r\nprint(*answer)", "def max_strengths(n, heights):\r\n left = [0] * n\r\n right = [0] * n\r\n\r\n for i in range(n):\r\n left[i] = i\r\n while left[i] > 0 and heights[left[i] - 1] >= heights[i]:\r\n left[i] = left[left[i] - 1]\r\n\r\n for i in range(n - 1, -1, -1):\r\n right[i] = i\r\n while right[i] < n - 1 and heights[right[i] + 1] >= heights[i]:\r\n right[i] = right[right[i] + 1]\r\n\r\n max_strength = [0] * (n + 1)\r\n for i in range(n):\r\n group_size = right[i] - left[i] + 1\r\n max_strength[group_size] = max(max_strength[group_size], heights[i])\r\n\r\n for i in range(n - 1, 0, -1):\r\n max_strength[i] = max(max_strength[i], max_strength[i + 1])\r\n\r\n return max_strength[1:]\r\n\r\n\r\ndef main():\r\n n = int(input().strip())\r\n heights = list(map(int, input().strip().split()))\r\n result = max_strengths(n, heights)\r\n print(\" \".join(map(str, result)))\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()", "N = int(input())\n\narray = list(map(int, input().split()))\n\nres = [0 for i in range(N+1)]\nstack = [ (0, -1) ]\n\nfor ( i, height ) in enumerate(array):\n while stack[-1][0] >= height:\n num = stack[-1][0]\n stack.pop()\n length = i - stack[-1][1] - 1\n res[length] = max(res[length], num)\n\n stack.append( (height, i) )\n\nwhile len(stack) > 1 :\n num = stack[-1][0]\n stack.pop()\n length = N - stack[-1][1] - 1\n res[length] = max(res[length], num)\n\nfor i in range(N-1, 0, -1): #From N-1 to 1\n res[i] = max(res[i], res[i+1])\n\nprint(' '.join(map(str, res[1:])) ) \n", "# ﷽\r\nfrom collections import defaultdict\r\nimport sys\r\ninput = lambda: sys.stdin.readline().strip()\r\ndef inlst():return [int(i) for i in input().split()]\r\ndef get(lst,rng,default):\r\n stack=[]\r\n dp=[-1]*len(lst)\r\n for i in rng:\r\n while stack and lst[stack[-1]]>=lst[i]:stack.pop()\r\n \r\n if stack:dp[i]=stack[-1]\r\n else:dp[i]=default\r\n stack.append(i)\r\n return dp\r\n \r\ndef solve():\r\n n=int(input())\r\n lst=[int(i) for i in input().split()]\r\n \r\n left=get(lst,range(n),-1)\r\n right=get(lst,reversed(range(n)),n)\r\n maxval=[-left[i]+right[i]-1 for i in range(n)]\r\n d=defaultdict(int)\r\n for i,j in enumerate(maxval):\r\n d[j]=max(lst[i],d[j])\r\n ans=[-1]*n\r\n ans[-1]=min(lst)\r\n for i in reversed(range(n-1)):\r\n ans[i]=max(ans[i+1],d[i+1])\r\n \r\n print(*ans)\r\n\r\n \r\n\r\nif __name__ == \"__main__\":\r\n # for i in range(int(input())):\r\n solve()\r\n", "n=int(input())\r\ns=list(map(int,input().split()))\r\noutput=[len(s)]*len(s)\r\nstack=[]\r\nstack.append(0)\r\nfor i in range(1,len(s)):\r\n if stack and s[stack[-1]]<=s[i]:\r\n stack.append(i)\r\n else:\r\n while stack and s[stack[-1]]>s[i]:\r\n output[stack[-1]]=i \r\n stack.pop()\r\n stack.append(i)\r\noutput1=[-1]*len(s)\r\nstack=[]\r\nstack.append(len(s)-1)\r\nfor i in range(len(s)-2,-1,-1):\r\n if stack and s[stack[-1]]<=s[i]:\r\n stack.append(i)\r\n else:\r\n while stack and s[stack[-1]]>s[i]:\r\n output1[stack[-1]]=i \r\n stack.pop()\r\n stack.append(i)\r\nres=[0]*(len(s)+1)\r\nfor i in range(len(s)):\r\n res[output[i]-output1[i]-1]=max(res[output[i]-output1[i]-1],s[i])\r\nfor i in range(len(res)-2,-1,-1):\r\n res[i]=max(res[i],res[i+1])\r\nprint(*res[1:])", "n=int(input())\r\narr=list(map(int,input().split()))\r\npse,nse=[-1]*n,[n]*n\r\nstack,stack2=[0],[n-1]\r\nfor i in range(1,n):\r\n while(len(stack) and arr[i]<arr[stack[-1]]):\r\n nse[stack.pop()]=i\r\n stack.append(i)\r\n \r\n while(len(stack2) and arr[n-i-1]<arr[stack2[-1]]):\r\n pse[stack2.pop()]=n-i-1\r\n stack2.append(n-i-1)\r\n \r\ndic={}\r\nfor i in range(n):\r\n dic[arr[i]]=max(dic.get(arr[i],0),(nse[i]-pse[i]-1)) \r\nout=[0]*(n+1)\r\nfor i in dic:\r\n out[dic[i]]=max(out[dic[i]],i)\r\ntemp=out[-1]\r\nfor i in range(n-1,0,-1):\r\n if out[i]<out[i+1]:\r\n out[i]=out[i+1]\r\nprint((\" \").join(map(str,out[1:])))\r\n", "def NextSmallIndex(arr,n):\r\n nse=[n]*n\r\n stack=[0]\r\n for i in range(1,n):\r\n while(stack and arr[stack[-1]]>arr[i]):\r\n nse[stack.pop()]=i\r\n stack.append(i)\r\n return nse\r\n \r\ndef FirstSmallIndexLast(arr,n):\r\n fse=[-1]*n\r\n stack=[n-1]\r\n for i in range(n-2,-1,-1):\r\n while(stack and arr[stack[-1]]>arr[i]):\r\n fse[stack.pop()]=i\r\n stack.append(i)\r\n return fse\r\n \r\n \r\nn=int(input())\r\narr=list(map(int,input().split()))\r\nnse=NextSmallIndex(arr,len(arr))\r\nfse=FirstSmallIndexLast(arr,len(arr))\r\n\r\nans=[0]*(n+1)\r\nfor i in range(n):\r\n ans[nse[i]-fse[i]-1]=max(ans[nse[i]-fse[i]-1],arr[i])\r\nfor i in range(n-1,0,-1):\r\n ans[i]=max(ans[i],ans[i+1])\r\n\r\nprint(*ans[1:])\r\n \r\n# 10\r\n# 1 2 3 4 5 4 3 2 1 6\r\n\r\n \r\n \r\n", "import sys\nimport io, os\n\nONLINE_JUDGE = True\n\nif not ONLINE_JUDGE:\n sys.stdin = open(\"input.txt\", \"r\")\n\n############ ---- Input Functions ---- ############\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\n\n\ndef inp(): # integer\n return int(input())\n\n\ndef inlt(): # lists\n return list(map(int, input().split()))\n\n\ndef insr(): # list of characters\n s = input()\n return list(s[: len(s) - 1])\n\n\ndef invr(): # space seperate integers\n return map(int, input().split())\n\n\n############ ---- Solution ---- ############\n\nMAX = 1000000\n\ndef bigarr():\n arr = [0] * MAX\n return arr\n\n\nl = bigarr()\nr = bigarr()\nm = bigarr()\n\nn = inp()\na = inlt()\n\nstack = []\n\nfor i in range(n):\n while stack and a[stack[-1]] >= a[i]:\n stack.pop()\n l[i] = stack[-1] if stack else -1\n stack.append(i)\n\n# clear\nstack = []\n\nfor i in range(n - 1, -1, -1):\n while stack and a[stack[-1]] >= a[i]:\n stack.pop()\n r[i] = stack[-1] if stack else n\n stack.append(i)\n\n\nfor i in range(n):\n ln = r[i] - l[i] - 1\n m[ln] = max(m[ln], a[i])\n\nfor i in range(n, -1, -1):\n m[i] = max(m[i], m[i + 1])\n\nfor i in range(1, n + 1):\n print(m[i], end=\" \")\n", "def max_strength(n, heights):\r\n left = [0] * n\r\n right = [0] * n\r\n result = [0] * n\r\n\r\n # Initialize stacks\r\n stack = []\r\n\r\n # Find the left limits for each height\r\n for i in range(n):\r\n while stack and heights[stack[-1]] >= heights[i]:\r\n stack.pop()\r\n left[i] = stack[-1] if stack else -1\r\n stack.append(i)\r\n\r\n # Clear the stack for the next iteration\r\n stack = []\r\n\r\n # Find the right limits for each height\r\n for i in range(n - 1, -1, -1):\r\n while stack and heights[stack[-1]] >= heights[i]:\r\n stack.pop()\r\n right[i] = stack[-1] if stack else n\r\n stack.append(i)\r\n\r\n # Find the maximum strength for each group size\r\n for i in range(n):\r\n group_size = right[i] - left[i] - 1\r\n result[group_size - 1] = max(result[group_size - 1], heights[i])\r\n\r\n # Fill the remaining values in the result\r\n for i in range(n - 1, 0, -1):\r\n result[i - 1] = max(result[i - 1], result[i])\r\n\r\n return result\r\n\r\n\r\n# Read input\r\nn = int(input().strip())\r\nheights = list(map(int, input().split()))\r\n\r\n# Calculate and print the result\r\nprint(*max_strength(n, heights))", "def main():\r\n\tnumberOfBears = int(input())\r\n\tbears = list(map(int, input().strip().split()))\r\n\tbears.insert(0, 0)\r\n\tbears.append(0)\r\n\t# solution = [0]*(numberOfBears+1)\r\n\tb = [0]*1000000\r\n\tl = [0]*1000000\r\n\tr = [0]*1000000\r\n\tfor i in range(1, numberOfBears+1):\r\n\t\tl[i] = i\r\n\t\twhile(bears[l[i]-1]>=bears[i]):\r\n\t\t\tl[i] = l[l[i]-1]\r\n\tfor i in range(numberOfBears, 0, -1):\r\n\t\tr[i] = i\r\n\t\twhile(bears[r[i]+1]>=bears[i]):\r\n\t\t\tr[i] = r[r[i]+1]\r\n\tfor i in range(1, numberOfBears+1):\r\n\t\tid = r[i]-l[i]+1\r\n\t\tb[id] = max(b[id], bears[i])\r\n\tfor i in range(numberOfBears, 1, -1):\r\n\t\tif b[i-1]<b[i]:\r\n\t\t\tb[i-1] = b[i]\r\n\tb = [str(b[i]) for i in range(1, numberOfBears+1)]\r\n\tprint(\" \".join(b))\r\n\r\n\t\t\r\n\t# solution = [str(max(bears))]\r\n\t# for i in range(2, numberOfBears):\r\n\t# \tmaximum = 0\r\n\t# \tfor j in range(0, numberOfBears-i+1):\r\n\t# \t\tminimum = min(bears[j:j+i])\r\n\t# \t\tmaximum = max(maximum, minimum)\r\n\t# \tsolution.append(str(maximum))\r\n\t# solution.append(str(min(bears)))\r\n\t# print(\" \".join(solution))\r\n\r\n\r\nif __name__ == '__main__':\r\n\tmain()", "n = int(input())\r\nar = list(map(int, input().split()))\r\nprev_smaller = [i + 1 for i in range(n)]\r\nnext_smaller = [n + 1] * n\r\nstack = []\r\nfor index, value in enumerate(ar):\r\n while stack and ar[stack[-1]] >= value:\r\n stack.pop()\r\n if stack:\r\n prev_smaller[index] = stack[-1] + 1\r\n else:\r\n prev_smaller[index] = 0\r\n stack.append(index)\r\n# print(*prev_smaller)\r\nstack = []\r\nfor index in range(n - 1, -1, -1):\r\n while stack and ar[stack[-1]] >= ar[index]:\r\n stack.pop()\r\n if stack:\r\n next_smaller[index] = stack[-1] + 1\r\n stack.append(index) \r\n# print(*next_smaller)\r\nmin_elm = min(ar)\r\nans = [min_elm for _ in range(n + 1)]\r\nfor i in range(n):\r\n sz = next_smaller[i] - prev_smaller[i] - 1\r\n ans[sz] = max(ans[sz], ar[i])\r\nfor i in range(n - 1, 0, -1):\r\n ans[i] = max(ans[i], ans[i + 1])\r\nprint(*ans[1:])", "def read_data():\r\n n = int(input())\r\n hs = list(map(int, input().split()))\r\n return n, hs\r\n\r\n\r\ndef solve(n, hs):\r\n left = get_left_index(n, hs)\r\n right = get_right_index(n, hs)\r\n vals = [[] for i in range(n)]\r\n for h, l, r in zip(hs, left, right):\r\n vals[r - l - 2].append(h)\r\n min_hs = []\r\n min_h = - float('inf')\r\n for val in vals[::-1]:\r\n for v in val:\r\n min_h = max(min_h, v)\r\n min_hs.append(min_h)\r\n print(* min_hs[::-1])\r\n\r\n\r\ndef get_left_index(n, hs):\r\n left = []\r\n stack = []\r\n for i, h in enumerate(hs):\r\n while stack and hs[stack[-1]] >= h:\r\n del stack[-1]\r\n if stack:\r\n left.append(stack[-1])\r\n else:\r\n left.append(-1)\r\n stack.append(i)\r\n return left\r\n\r\n\r\ndef get_right_index(n, hs):\r\n hs.reverse()\r\n tmp = get_left_index(n, hs)\r\n hs.reverse()\r\n tmp.reverse()\r\n right = [n - 1 - a for a in tmp]\r\n return right\r\n\r\nn, hs = read_data()\r\nsolve(n, hs)", "import sys\r\ninput=sys.stdin.readline\r\nn=int(input())\r\na=list(map(int,input().split()))\r\nl=[-1]*n\r\nr=[n]*n\r\nstack=[]\r\nfor i in range(n):\r\n while stack and a[stack[-1]]>=a[i]:\r\n stack.pop()\r\n if stack:\r\n l[i]=stack[-1]\r\n stack.append(i)\r\nstack=[]\r\nfor i in range(n)[::-1]:\r\n while stack and a[stack[-1]]>=a[i]:\r\n stack.pop()\r\n if stack:\r\n r[i]=stack[-1]\r\n stack.append(i)\r\nans=[min(a)]*n\r\nfor i in range(n):\r\n d=r[i]-l[i]-2\r\n ans[d]=max(ans[d],a[i])\r\nval=min(a)\r\nfor i in range(n)[::-1]:\r\n val=max(val,ans[i])\r\n ans[i]=val\r\nprint(*ans)", "def run():\r\n n = int(input())\r\n ls = list(map(int, input().split()))\r\n st = []\r\n bac = [n] * n\r\n fro = [-1] * n\r\n for i in range(n):\r\n while st and ls[st[-1]] > ls[i]:\r\n bac[st.pop()] = i\r\n st.append(i)\r\n st = []\r\n for i in range(n - 1, -1, -1):\r\n while st and ls[st[-1]] > ls[i]:\r\n fro[st.pop()] = i\r\n st.append(i)\r\n ans = [-1] * (n + 1)\r\n # print([a - b for a, b in zip(bac, fro)])\r\n for i in range(n):\r\n ans[bac[i] - fro[i] - 1] = max(ls[i], ans[bac[i] - fro[i] - 1])\r\n # print(ans)\r\n for i in range(n - 1, -1, -1):\r\n if ans[i + 1] > ans[i]:\r\n ans[i] = ans[i + 1]\r\n print(*ans[1:])\r\n\r\nrun()", "btqAIXPWRsBVCLo = int\r\nbtqAIXPWRsBVCLE = input\r\nbtqAIXPWRsBVCLp = list\r\nbtqAIXPWRsBVCLT = map\r\nbtqAIXPWRsBVCLN = range\r\nbtqAIXPWRsBVCLJ = max\r\nbtqAIXPWRsBVCLD = print\r\nbtqAIXPWRsBVCLy = str\r\nbtqAIXPWRsBVCLM = btqAIXPWRsBVCLo\r\nbtqAIXPWRsBVCLj = btqAIXPWRsBVCLE\r\nbtqAIXPWRsBVCLu = btqAIXPWRsBVCLp\r\nbtqAIXPWRsBVCLH = btqAIXPWRsBVCLT\r\nbtqAIXPWRsBVCLr = btqAIXPWRsBVCLN\r\nbtqAIXPWRsBVCLm = btqAIXPWRsBVCLJ\r\nbtqAIXPWRsBVCLa = btqAIXPWRsBVCLD\r\nbtqAIXPWRsBVCLf = btqAIXPWRsBVCLy\r\nn = btqAIXPWRsBVCLM(btqAIXPWRsBVCLj())\r\nr = [0]*(n+1)\r\na = [0]*(n+1)\r\na[1:-1] = btqAIXPWRsBVCLu(btqAIXPWRsBVCLH(btqAIXPWRsBVCLM,\r\n btqAIXPWRsBVCLj().split()))\r\ns = [(0, 0)]\r\nfor i in btqAIXPWRsBVCLr(1, n+2):\r\n while a[i] < s[-1][0]:\r\n r[i-s[-2][1]-1] = btqAIXPWRsBVCLm(s[-1][0], r[i-s[-2][1]-1])\r\n del s[-1]\r\n s += [(a[i], i)]\r\nfor i in btqAIXPWRsBVCLr(n):\r\n r[-i-2] = btqAIXPWRsBVCLm(r[-i-2], r[-i-1])\r\nbtqAIXPWRsBVCLa(' '.join(btqAIXPWRsBVCLH(btqAIXPWRsBVCLf, r[1:])))\r\n", "import gc\r\nimport heapq\r\nimport itertools\r\nimport math\r\nfrom collections import Counter, deque, defaultdict\r\nfrom sys import stdout\r\nimport time\r\nfrom math import factorial, log, gcd\r\nimport sys\r\nfrom decimal import Decimal\r\nimport threading\r\nfrom heapq import *\r\nfrom fractions import Fraction\r\nimport bisect\r\n\r\n\r\ndef S():\r\n\treturn sys.stdin.readline().split()\r\n\r\n\r\ndef I():\r\n\treturn [int(i) for i in sys.stdin.readline().split()]\r\n\r\n\r\ndef II():\r\n\treturn int(sys.stdin.readline())\r\n\r\n\r\ndef IS():\r\n\treturn sys.stdin.readline().replace('\\n', '')\r\n\t\r\n\r\ndef main():\r\n\tn = II()\r\n\ta = I()\r\n\tans = [-1] * n\r\n\tdp_left = [-1] * n\r\n\tfor i in range(1, n):\r\n\t\tel = a[i]\r\n\t\tidx = i - 1\r\n\t\twhile idx != -1 and a[idx] >= el:\r\n\t\t\tidx = dp_left[idx]\r\n\t\tdp_left[i] = idx\r\n\tdp_right = [n] * n\r\n\tfor i in range(n - 2, -1, -1):\r\n\t\tel = a[i]\r\n\t\tidx = i + 1\r\n\t\twhile idx != n and a[idx] >= el:\r\n\t\t\tidx = dp_right[idx]\r\n\t\tdp_right[i] = idx\r\n\t\r\n\tfor i in range(n):\r\n\t\tlength = dp_right[i] - dp_left[i] - 1\r\n\t\tans[length - 1] = max(ans[length - 1], a[i])\r\n\t\r\n\tmx = min(a)\r\n\tfor i in range(n - 1, -1, -1):\r\n\t\tans[i] = max(ans[i], mx)\r\n\t\tmx = max(ans[i], mx)\r\n\tprint(*ans)\r\n\t\r\n\r\n\r\n\t\r\nif __name__ == '__main__':\r\n\t# for _ in range(II()):\r\n\t# \tmain()\r\n\tmain()", "import sys\n\ndef solve():\n n, = rv()\n h, = rl(1)\n smallertoleftindex = [-1] * n\n smallertorightindex = [n] * n\n temp = list()\n for i in range(n):\n while len(temp) > 0 and h[temp[-1]] >= h[i]: temp.pop(-1)\n smallertoleftindex[i] = -1 if len(temp) == 0 else temp[-1]\n temp.append(i)\n temp = list()\n for i in range(n - 1, - 1, - 1):\n while len(temp) > 0 and h[temp[-1]] >= h[i]: temp.pop(-1)\n smallertorightindex[i] = n if len(temp) == 0 else temp[-1]\n temp.append(i)\n res = [0] * (n + 1)\n for i in range(n):\n nums = smallertorightindex[i] - smallertoleftindex[i] - 1\n res[nums] = max(res[nums], h[i])\n for i in range(n - 1, 0, -1): res[i] = max(res[i], res[i + 1])\n print(' '.join(map(str, res[1:])))\n\ndef prt(l): return print(''.join(l))\ndef rv(): return map(int, input().split())\ndef rl(n): return [list(map(int, input().split())) for _ in range(n)]\nif sys.hexversion == 50594544 : sys.stdin = open(\"test.txt\")\nsolve()", "import sys\r\n\r\nip = sys.stdin.readline\r\nn = int(ip())\r\narr = list(map(int, ip().split()))\r\nli = [-1 for _ in range(n)]\r\nri=[n for _ in range(n)]\r\n\r\nstack = [n - 1]\r\nfor p1 in range(n - 2, -1, -1):\r\n while stack and arr[p1] < arr[stack[- 1]]:\r\n li[stack[- 1]] = p1\r\n stack.pop(- 1)\r\n stack.append(p1)\r\n p1 -= 1\r\n\r\n\r\nstack = [0]\r\nfor p1 in range(1, n):\r\n while stack and arr[p1] < arr[stack[- 1]]:\r\n ri[stack[- 1]] = p1\r\n stack.pop(- 1)\r\n stack.append(p1)\r\n p1 += 1\r\n\r\n\r\nans = [0 for _ in range(n + 1)]\r\nfor i in range(n):\r\n seq_length = i-li[i]+ri[i]-i-1\r\n if ans[seq_length] < arr[i]:\r\n ans[seq_length] = arr[i]\r\n\r\n\r\nele = -1\r\nfor i in range(n, 0, -1):\r\n ele = max(ans[i], ele)\r\n ans[i] = ele\r\nans.pop(0)\r\nprint(*ans)\r\n", "n=int(input())\r\nl=[int(i) for i in input().split()]\r\nstack=[]\r\nans=[0]*n\r\nleft=[-1]*n\r\nright=[n]*n\r\nfor i in range(n):\r\n while(stack!=[] and l[i]<=l[stack[-1]]):\r\n stack.pop()\r\n if(stack!=[]):\r\n left[i]=stack[-1]\r\n stack.append(i)\r\nstack=[]\r\nfor i in range(n-1,-1,-1):\r\n while(stack!=[] and l[i]<=l[stack[-1]]):\r\n stack.pop()\r\n if(stack!=[]):\r\n right[i]=stack[-1]\r\n stack.append(i)\r\nfor i in range(n):\r\n k=right[i]-left[i]-1\r\n ans[k-1]=max(ans[k-1],l[i])\r\nfor i in range(n-2,-1,-1):\r\n ans[i]=max(ans[i],ans[i+1])\r\nprint(*ans)", "import sys\n\nn = int(sys.stdin.readline())\nheights = list(map(int, sys.stdin.readline().strip().split()))\nleft = [-1 for _ in range(n)]\nright = [-1 for _ in range(n)]\ndp = [-1 for _ in range(n+1)]\n\n\ns = []\nfor i in range(n):\n while s:\n if heights[s[-1]] >= heights[i]: \n s.pop()\n else:\n break\n if s: \n left[i] = s[-1]\n\n s.append(i)\n\ns = []\nfor i in range(n-1,-1,-1):\n while s:\n if heights[s[-1]] >= heights[i]:\n s.pop()\n else:\n break\n if s:\n right[i] = s[-1]\n\n s.append(i)\n\nfor i in range(n):\n span = right[i] - left[i] - 1\n dp[span] = max(dp[span], heights[i])\n\nfor i in range(n-1, 0, -1):\n dp[i] = max(dp[i], dp[i + 1])\n\nfor i in range(1, n+1):\n print(dp[i], end = ' ')\n\n# def expand(start, end):\n# while start >= 0 and end < len(s):\n# if s[start] != s[end]:\n# break\n# start -= 1\n# end += 1\n# return [start+1, end]\n\n# def solve():\n# output = [0,0]\n \n# for i in range(len(s)//2,len(s)):\n# if output[1] - output[0] > (len(s) - i) * 2:\n# break\n# cur1 = expand(i, i)\n# if cur1[1] - cur1[0] > output[1] - output[0]:\n# output = cur1\n\n# cur2 = expand(i, i+1)\n# if cur2[1] - cur2[0] > output[1] - output[0]:\n# output = cur2\n \n# cur3 = expand(len(s) - i - 1, len(s) - i - 1)\n# if cur3[1] - cur3[0] > output[1] - output[0]:\n# output = cur3\n\n# cur4 = expand(len(s) - i - 1, len(s) - i - 1 +1)\n# if cur4[1] - cur4[0] > output[1] - output[0]:\n# output = cur4\n\n# print(s[output[0]:output[1]])\n \n# solve()", "n=int(input())\r\nr=[0]*(n+1)\r\na=[0]*(n+1)\r\na[1:-1]=list(map(int,input().split()))\r\ns=[(0,0)]\r\nfor i in range(1,n+2):\r\n while a[i]<s[-1][0]:\r\n r[i-s[-2][1]-1]=max(s[-1][0],r[i-s[-2][1]-1])\r\n del s[-1]\r\n s+=[(a[i],i)]\r\nfor i in range(n): r[-i-2]=max(r[-i-2],r[-i-1])\r\nprint(' '.join(map(str,r[1:])))", "n = int(input())\r\na = list(map(int,input().split()))\r\nstack = []\r\nans = [0]*n\r\nl = [-1]*n\r\nr = [n]*n\r\nfor i in range(n):\r\n while(stack and a[i]<=a[stack[-1]]):\r\n stack.pop()\r\n if stack:\r\n l[i] = stack[-1]\r\n stack.append(i)\r\nstack = []\r\nfor i in range(n-1,-1,-1):\r\n while(stack and a[i]<=a[stack[-1]]):\r\n stack.pop()\r\n if stack:\r\n r[i] = stack[-1]\r\n stack.append(i)\r\nfor i in range(n):\r\n Len = r[i]-l[i]-1\r\n Len-=1\r\n ans[Len] = max(ans[Len],a[i])\r\nfor i in range(n-2,-1,-1):\r\n ans[i] = max(ans[i],ans[i+1])\r\nprint(*ans)", "\r\n\r\nn = int(input().strip())\r\na=list(map(int,input().strip().split()))\r\n\r\nans=[0]*(n+1)\r\n\r\n#labirentin cevresine attigim 0lar gibi indexOut yememek icin\r\na=[0]+a+[0]\r\ns=[]\r\n\r\nfor index,value in enumerate(a):\r\n #print('SS -> ',s)\r\n #print('ANS -> ',ans,'\\n')\r\n #buyuk oldukca devam et \r\n while s and value<s[-1][0]:\r\n ans[index-s[-2][1]-1]=max(s[-1][0],ans[index-s[-2][1]-1])\r\n s.pop()\r\n s.append((value,index))\r\n\r\n#print('SS -> ', s)\r\n#print('ANSS----',ans)\r\n\r\nans=ans[::-1]\r\nfor i in range(n):\r\n ans[i+1]=max(ans[i+1],ans[i])\r\nans=ans[::-1]\r\nprint(' '.join(map(str,ans[1:])))\r\n\r\n\r\n\r\n\r\n\"\"\"\r\n\r\n10\r\n1 2 3 4 5 4 3 2 1 6\r\n\r\n3\r\n524125987 923264237 374288891\r\n\r\n\"\"\"", "N, nums = int(input()), [int(x) for x in input().split()]\r\nn = len(nums)\r\nl, r = [0]*n, [n-1]*n\r\nstk = []\r\nfor i in range(n):\r\n while stk and nums[stk[-1]] >= nums[i]: r[stk.pop()] = i-1\r\n if stk: l[i] = stk[-1]+1\r\n stk.append(i)\r\nans = [0]*n\r\nfor i in range(n):\r\n sz = r[i]-l[i]+1\r\n ans[sz-1] = max(ans[sz-1], nums[i])\r\nfor i in range(n-2, -1, -1):\r\n ans[i] = max(ans[i], ans[i+1])\r\nprint(' '.join(map(str, ans)))", "n=int(input())\r\nx=list(map(int,input().split()))\r\nx2=[0]+x\r\nsta=[0]\r\ng=[0]*(n)\r\nfor i in range(n):\r\n while x2[sta[-1]]>=x[i]:\r\n sta.pop()\r\n g[i]-=sta[-1]\r\n sta.append(i+1)\r\nx2=x+[0]\r\nsta=[n]\r\nfor i in range(n-1,-1,-1):\r\n while x2[sta[-1]]>=x[i]:\r\n sta.pop()\r\n g[i]+=sta[-1]\r\n sta.append(i)\r\nl=[0]*(n+1)\r\nfor i in range(n):\r\n l[g[i]]=max(l[g[i]],x[i])\r\nans=0\r\nf=[]\r\nfor i in range(n,0,-1):\r\n ans=max(l[i],ans)\r\n f.append(ans)\r\nprint(*f[::-1])\r\n", "from itertools import accumulate\r\n\r\n\r\nn = int(input())\r\n\r\nlst = list(map(int, input().split()))\r\n\r\nl = [0] * n\r\nr = [0] * n\r\n\r\nstack1 = []\r\nstack2 = []\r\n\r\nfor i in range(n):\r\n\r\n while stack1 and lst[stack1[-1]] >= lst[i]:\r\n stack1.pop()\r\n\r\n \r\n if not stack1:\r\n l[i] = -1\r\n else:\r\n l[i] = stack1[-1]\r\n\r\n stack1.append(i)\r\n\r\nfor j in range(n - 1, -1 , -1):\r\n\r\n while stack2 and lst[stack2[-1]]>= lst[j]:\r\n stack2.pop()\r\n \r\n if not stack2:\r\n r[j] = n\r\n else:\r\n r[j] = stack2[-1]\r\n\r\n stack2.append(j)\r\n\r\n\r\n \r\nans = [0] * (n + 1)\r\n\r\nfor i in range(n):\r\n\r\n right = r[i] - l[i] - 1\r\n ans[right] = max(lst[i], ans[right])\r\n\r\n\r\nfor i in range(n - 1, -1, -1):\r\n\r\n ans[i] = max(ans[i] , ans[i + 1])\r\n\r\nprint(*ans[1:])\r\n\r\n\r\n \r\n\r\n", "#!/usr/bin/env python3\n\nN = input()\nN = int(N)\nA = input().split(' ')\nA = list(map(int, A))\n\ndef get_L(A):\n L_candidates = [] # increasing list of indices with A smaller than anything considered so far\n L = A[:]\n\n for i in range(len(A)):\n while L_candidates and A[L_candidates[-1]] >= A[i]:\n L_candidates.pop()\n if L_candidates:\n L[i] = L_candidates[-1]\n else:\n L[i] = -1\n L_candidates.append(i)\n return L\n\nL = get_L(A)\nR = [N - x - 1 for x in get_L(A[::-1])][::-1]\n\nstrengths = [0] * (N + 3)\nfor i in range(N):\n p = R[i] - L[i] - 1\n strengths[p] = max(strengths[p], A[i])\n\nstrengths = strengths[1:N+1]\n\nstrengths = strengths[::-1]\nfor i in range(1, N):\n strengths[i] = max(strengths[i], strengths[i-1])\nstrengths = strengths[::-1]\n\nprint(' '.join(map(str, strengths)))", "from sys import stdin, stdout\ndef input(): return stdin.readline().strip()\ndef print(x, end='\\n'): stdout.write(str(x) + end)\n\nn, lst = int(input()), list(map(int, input().split()))\nnse, pse, stk, ans = [n for i in range(n)], [-1 for i in range(n)], [], [0 for i in range(n)]\nfor i in range(n):\n while stk and lst[stk[-1]] > lst[i]: nse[stk.pop()] = i\n stk.append(i)\nstk.clear()\nfor i in range(n-1, -1, -1):\n while stk and lst[stk[-1]] > lst[i]: pse[stk.pop()] = i\n stk.append(i)\nfor i in range(n): ans[nse[i] - pse[i] - 2] = max(lst[i], ans[nse[i] - pse[i] - 2])\nfor i in range(n-2, -1, -1): ans[i] = max(ans[i+1], ans[i])\nprint(' '.join(map(str, ans)))", "def calculate_resistance(n, a):\r\n r = [0] * (n + 1)\r\n stack = [(0, 0)]\r\n\r\n for i in range(1, n + 2):\r\n while a[i] < stack[-1][0]:\r\n r[i - stack[-2][1] - 1] = max(stack[-1][0], r[i - stack[-2][1] - 1])\r\n del stack[-1]\r\n stack.append((a[i], i))\r\n\r\n for i in range(n):\r\n r[-i - 2] = max(r[-i - 2], r[-i - 1])\r\n\r\n return r[1:]\r\n\r\n\r\nif __name__ == \"__main__\":\r\n n = int(input())\r\n a = [0] * (n + 1)\r\n a[1:-1] = list(map(int, input().split()))\r\n\r\n result = calculate_resistance(n, a)\r\n print(' '.join(map(str, result)))\r\n", "n = int(input())\r\na = [0] + list(map(int,input().split())) + [0]\r\nr = [0] * (n + 1)\r\nst = [(0, 0)]\r\nfor i in range(1, n + 2):\r\n \twhile a[i] < st[-1][0]:\r\n \t\tr[i - st[-2][1] - 1] = max(st[-1][0], r[i - st[-2][1] - 1])\r\n \t\tst.pop()\r\n \tst.append((a[i], i))\r\nfor i in range(n): r[-i - 2] = max(r[-i - 2], r[-i - 1])\r\nprint(*r[1:]) ", "n=int(input())\r\narr=list(map(int,input().split()))\r\narr=[0]+arr+[0]\r\nsuffmin=[n+1]*(n+2)\r\npremin=[0]*(n+1)\r\nst=[n+1]\r\nfor i in range(1,n+1):\r\n while arr[i]<arr[st[-1]]:\r\n suffmin[st[-1]]=i\r\n st.pop()\r\n st+=[i]\r\nst=[0]\r\nfor i in range(n,0,-1):\r\n while arr[i]<arr[st[-1]]:\r\n premin[st[-1]]=i\r\n st.pop()\r\n st+=[i]\r\nmaxans=[0]*(n+2)\r\nfor i in range(1,n+1):\r\n if maxans[suffmin[i]-premin[i]-1]<arr[i]:\r\n maxans[suffmin[i]-premin[i]-1]=arr[i]\r\nm=arr[1]\r\nfor i in range(1,n+1):\r\n if arr[i]<m:\r\n m=arr[i]\r\nmaxans[n]=m\r\nfor i in range(n-1,0,-1):\r\n if maxans[i+1]>maxans[i]:\r\n maxans[i]=maxans[i+1]\r\n\r\nprint(*maxans[1:n+1])\r\n", "try:\r\n import sys\r\n from functools import lru_cache, cmp_to_key\r\n from heapq import merge, heapify, heappop, heappush\r\n # from math import *\r\n from collections import defaultdict as dd, deque, Counter as C\r\n from itertools import combinations as comb, permutations as perm\r\n from bisect import bisect_left as bl, bisect_right as br, bisect, insort\r\n from time import perf_counter\r\n from fractions import Fraction\r\n import copy\r\n from copy import deepcopy\r\n import time\r\n starttime = time.time()\r\n mod = int(pow(10, 9) + 7)\r\n mod2 = 998244353\r\n\r\n def data(): return sys.stdin.readline().strip()\r\n def out(*var, end=\"\\n\"): sys.stdout.write(' '.join(map(str, var))+end)\r\n def L(): return list(sp())\r\n def sl(): return list(ssp())\r\n def sp(): return map(int, data().split())\r\n def ssp(): return map(str, data().split())\r\n def l1d(n, val=0): return [val for i in range(n)]\r\n def l2d(n, m, val=0): return [l1d(n, val) for j in range(m)]\r\n def A2(n,m): return [[0]*m for i in range(n)]\r\n def A(n):return [0]*n\r\n # input = stdin.buffer.readline\r\n # I = lambda : list(map(int,input().split()))\r\n # import sys\r\n # input=sys.stdin.readline\r\n \r\n\r\n sys.stdin = open(\"input.txt\", \"r\")\r\n sys.stdout = open(\"output.txt\", \"w\")\r\nexcept:\r\n pass\r\n\r\nN = int(input())\r\n \r\narray = list(map(int, input().split()))\r\n \r\nres = [0 for i in range(N+1)]\r\nstack = [ (0, -1) ]\r\n \r\nfor ( i, height ) in enumerate(array):\r\n while stack[-1][0] >= height:\r\n num = stack[-1][0]\r\n stack.pop()\r\n length = i - stack[-1][1] - 1\r\n res[length] = max(res[length], num)\r\n \r\n stack.append( (height, i) )\r\n # print(stack,\"\\t\\t\\t\",res)\r\nwhile len(stack) > 1 :\r\n num = stack[-1][0]\r\n stack.pop()\r\n length = N - stack[-1][1] - 1\r\n res[length] = max(res[length], num)\r\n # print(stack,\"\\t\\t\\t\",res)\r\n \r\nfor i in range(N-1, 0, -1): #From N-1 to 1\r\n res[i] = max(res[i], res[i+1])\r\n \r\nprint(' '.join(map(str, res[1:])) ) ", "\r\nimport heapq\r\nn=int(input())\r\np=list(map(int, input().split(' ')))\r\nleft=[0]*n\r\nright=[n-1]*n\r\nstack=[]\r\nfor i in range (0,n):\r\n while stack and stack[-1][1]>=p[i]:\r\n stack.pop()\r\n if stack:\r\n left[i]=stack[-1][0]+1\r\n else:\r\n left[i]=0\r\n\r\n stack.append([i,p[i]])\r\n\r\nstack=[]\r\nfor i in range (0,n):\r\n while stack and stack[-1][1]>=p[n-1-i]:\r\n stack.pop()\r\n if stack:\r\n right[n-1-i]=stack[-1][0]-1\r\n else:\r\n right[n-1-i]=n-1\r\n\r\n stack.append([n-1-i,p[n-1-i]])\r\n\r\ny=[[right[i]-left[i]+1,p[i]] for i in range (0,n)]\r\ny.sort(key=lambda x:x[0],reverse=True)\r\nu=[]\r\nans=[0]*n\r\nj=0\r\nfor i in range (0,n):\r\n l=n-i\r\n while j<=n-1 and y[j][0]>=l:\r\n heapq.heappush(u,-y[j][1])\r\n j=j+1\r\n x=heapq.heappop(u)\r\n ans[n-1-i]=-x\r\n heapq.heappush(u,x)\r\n\r\nfor i in range (0,n):\r\n print(ans[i],end=' ')\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "import sys\r\n\r\ndef main():\r\n n=int(sys.stdin.readline())\r\n a=list(map(int,sys.stdin.readline().split()))\r\n dq=[]\r\n left_nearest=[-1]*n\r\n right_nearest=[n]*n\r\n for i in range(n):\r\n while len(dq) and a[dq[-1]] >= a[i]:\r\n del dq[-1]\r\n if len(dq):\r\n left_nearest[i]=dq[-1]\r\n dq.append(i)\r\n dq.clear()\r\n for i in range(n-1,-1,-1):\r\n while len(dq) and a[dq[-1]] >= a[i]:\r\n del dq[-1]\r\n if len(dq):\r\n right_nearest[i]=dq[-1]\r\n dq.append(i)\r\n\r\n ans=[-1] * (n+1)\r\n\r\n for i in range(n):\r\n length=right_nearest[i]-i+i-left_nearest[i]-1\r\n #print(i,length)\r\n ans[length]=max(ans[length],a[i])\r\n for i in range(n-1,0,-1):\r\n ans[i]=max(ans[i],ans[i+1])\r\n #print(' '.join(map(str,ans[1:])))\r\n sys.stdout.write(' '.join(map(str,ans[1:])))\r\nmain()\r\n", "n=int(input())\r\narr=list(map(int,input().split()))\r\n\r\nnse = [n]*n\r\nstack = [0]\r\nfor i in range(1,n):\r\n while stack and arr[stack[-1]] > arr[i]:\r\n nse[stack.pop()] = i\r\n stack.append(i)\r\n\r\npse = [-1]*n\r\nstack = [n-1]\r\nfor i in range(n-1)[::-1]:\r\n while stack and arr[stack[-1]] >= arr[i]:\r\n pse[stack.pop()] = i\r\n stack.append(i)\r\n\r\nans=[0]*n\r\nfor i in range(n):\r\n # 0-indexed\r\n ans[nse[i]-pse[i]-2]=max(ans[nse[i]-pse[i]-2],arr[i])\r\n\r\nfor i in range(n-1)[::-1]:\r\n if ans[i]<ans[i+1]:\r\n ans[i]=ans[i+1]\r\nprint(*ans)\r\n", "n = int(input())\r\n\r\ndpl , dpr , ans = [0]*(n+4), [n+1]*(n+4), [0]*(n+4)\r\na = [0]\r\na.extend(list(map(int,input().split())))\r\na.append(0)\r\n\r\nfor i in range(1,n+1):\r\n tmp = i-1\r\n while(a[tmp] >= a[i]):\r\n tmp = dpl[tmp]\r\n dpl[i] = tmp\r\n\r\nfor i in range(n,0,-1):\r\n tmp = i+1\r\n while(a[tmp] >= a[i]):\r\n tmp = dpr[tmp]\r\n dpr[i] = tmp\r\n ans[dpr[i]-dpl[i]-1] = max(ans[dpr[i]-dpl[i]-1],a[i])\r\n\r\nfor i in range(n,0,-1):\r\n ans[i] = max(ans[i+1],ans[i])\r\n\r\nprint(' '.join(map(str,ans[1:n+1])))\r\n", "def printMaxOfMin(arr, n):\n stack = []\n left_smaller = [-1] * (n+1)\n right_smaller = [n] * (n+1)\n\n for i in range(n):\n while stack and arr[stack[-1]] >= arr[i]:\n stack.pop()\n if stack:\n left_smaller[i] = stack[-1]\n stack.append(i)\n\n while stack:\n stack.pop()\n\n for i in range(n-1, -1, -1):\n while stack and arr[stack[-1]] >= arr[i]:\n stack.pop()\n if stack:\n right_smaller[i] = stack[-1]\n stack.append(i)\n\n ans = [0]*(n+1)\n\n for i in range(n):\n window = right_smaller[i]-left_smaller[i]-1\n ans[window] = max(ans[window], arr[i])\n\n for i in range(n-1, -1, -1):\n ans[i] = max(ans[i], ans[i+1])\n\n return ans[1:]\n\n\nn = int(input())\narr = [int(i) for i in input().split()]\nfor i in printMaxOfMin(arr, n):\n print(i, end=\" \")\nprint(\"\")\n", "# import math,string,itertools,fractions,heapq,collections,re,array,bisect\n# from itertools import chain, dropwhile, permutations, combinations\n# from collections import defaultdict\n\ndef VI(): return list(map(int,input().split()))\n\ndef main_old(n,a):\n s = list(a)\n print(max(a),end=\" \")\n for i in range(1,n):\n ns = list(s[:-1])\n mx = 0\n for j in range(len(ns)):\n ns[j] = min(s[j],s[j+1])\n if ns[j] > mx:\n mx = ns[j]\n s = ns\n print(mx,end=\" \")\n #print(max(s),end=\" \")\n #print(min(a))\n\nfrom sys import stdout\n\ndef main(n,a):\n # correct, but too slow O(n^2); needs a better data structure.\n s = a\n buf = str(max(a))\n for i in range(n-1,0,-1):\n mx = 0\n for j in range(i):\n s[j] = min(s[j],s[j+1])\n if s[j] > mx:\n mx = s[j]\n buf += \" \"+str(mx)\n stdout.write(buf+\"\\n\")\n\ndef run(n,a):\n stack = []\n l, r = [0]*n, [0]*n\n for x in range(n):\n while len(stack)>0 and a[stack[-1]] >= a[x]:\n stack.pop()\n if len(stack)==0: l[x] = -1\n else: l[x] = stack[-1]\n stack.append(x)\n stack = []\n for x in range(n-1,-1,-1):\n while len(stack)>0 and a[stack[-1]]>=a[x]:\n stack.pop()\n if len(stack)==0: r[x]=n\n else: r[x] = stack[-1]\n stack.append(x)\n sl = [-1] * n\n for x in range(n):\n v = r[x]-l[x]-1\n sl[v-1] = max(sl[v-1],a[x])\n for x in range(n-2,-1,-1):\n sl[x] = max(sl[x], sl[x+1])\n print(\" \".join([str(x) for x in sl]))\n\n\ndef main_input(info=0):\n n = int(input())\n a = VI()\n #main(n,a)\n run(n,a)\n\nif __name__ == \"__main__\":\n main_input()\n", "N = int(input())\na = list(map(int, input().split()))\nres = [0 for i in range(N+1)]\nst = [ (0, -1) ]\nfor ( i, hh ) in enumerate(a):\n while st[-1][0] >= hh:\n num = st[-1][0]\n st.pop()\n ll = i - st[-1][1] - 1\n res[ll] = max(res[ll], num)\n\n st.append( (hh, i) )\n\nwhile len(st) > 1 :\n num = st[-1][0]\n st.pop()\n ll = N - st[-1][1] - 1\n res[ll] = max(res[ll], num)\n\nfor i in range(N-1, 0, -1): \n res[i] = max(res[i], res[i+1])\n\nprint(' '.join(map(str, res[1:])) )", "n = int(input())\r\narr = list(map(int, input().split()))\r\n\r\nleft, right = [-1] * n, [n] * n\r\n\r\nstack = []\r\n\r\nfor i, v in enumerate(arr):\r\n while stack and stack[-1][0] > v:\r\n right[stack.pop()[1]] = i\r\n stack.append((v, i))\r\n\r\nfor i in range(n - 1, -1, -1):\r\n while stack and stack[-1][0] > arr[i]:\r\n left[stack.pop()[1]] = i\r\n stack.append((arr[i], i))\r\n\r\nans = [-1] * n\r\n\r\nfor i, v in enumerate(arr):\r\n size = right[i] - left[i] - 2\r\n if v > ans[size]:\r\n ans[size] = v\r\n\r\nfor i in range(n - 2, -1, -1):\r\n if ans[i + 1] > ans[i]:\r\n ans[i] = ans[i + 1]\r\n\r\nprint(*ans)", "\r\nn = int(input())\r\narr = list(map(int,input().split()))\r\n\r\nleft,right = [0 for index in range(n)],[0 for index in range(n)] \r\nlength = [0 for index in range(n)]\r\nanswer = [0 for index in range(n)]\r\n\r\nstack = []\r\nfor index in range(n):\r\n while(len(stack) > 0 and arr[stack[-1]] >= arr[index]):\r\n stack.pop()\r\n if(len(stack) == 0):\r\n left[index] = -1\r\n else:\r\n left[index] = stack[-1]\r\n stack.append(index)\r\n \r\nstack = []\r\nfor index in range(n-1,-1,-1):\r\n while(len(stack) > 0 and arr[stack[-1]] >= arr[index]):\r\n stack.pop()\r\n if(len(stack) == 0):\r\n right[index] = n\r\n else:\r\n right[index] = stack[-1]\r\n stack.append(index)\r\n \r\nfor index in range(n):\r\n length[index] = right[index] - left[index] - 1\r\n \r\nfor index in range(n):\r\n answer[length[index] - 1] = max(answer[length[index] - 1],arr[index])\r\n \r\nfor index in range(n-2,-1,-1):\r\n answer[index] = max(answer[index],answer[index+1])\r\n \r\nprint(*answer)" ]

[ "import sys\ninput = sys.stdin.readline\n\nimport math\nfrom collections import defaultdict,deque\nml=lambda:map(int,input().split())\nll=lambda:list(map(int,input().split()))\nii=lambda:int(input())\nip=lambda:list(input())\nips=lambda:input().split()\n\n\"\"\"========main code===============\"\"\"\n\nr=ip()\nk=ip()\nd=defaultdict(int)\nj=1\nfor i in \"abcdefgh\":\n d[i]=j\n j+=1\nk_x=d[k[0]]\nk_y=int(k[1])\nr_x=d[r[0]]\nr_y=int(r[1])\n\n\nlol=[]\nlol.append([-2,1])\nlol.append([-2,-1])\nlol.append([2,1])\nlol.append([2,-1])\nans=64\nm=defaultdict(int)\nfor i in lol:\n if(k_x+i[0]>0 and k_x+i[0]<=8 and k_y+i[1]>0 and k_y+i[1]<=8 and m[(k_x+i[0],k_y+i[1])]==0):\n ans-=1\n m[(k_x+i[0],k_y+i[1])]=1\n \n if(k_x+i[1]>0 and k_x+i[1]<=8 and k_y+i[0]>0 and k_y+i[0]<=8 and m[(k_x+i[1],k_y+i[0])]==0):\n ans-=1\n m[(k_x+i[1],k_y+i[0])]=1\n \n if(r_x+i[0]>0 and r_x+i[0]<=8 and r_y+i[1]>0 and r_y+i[1]<=8 and m[(r_x+i[0],r_y+i[1])]==0 ):\n ans-=1\n m[(r_x+i[0],r_y+i[1])]=1\n \n if(r_x+i[1]>0 and r_x+i[1]<=8 and r_y+i[0]>0 and r_y+i[0]<=8 and m[(r_x+i[1],r_y+i[0])]==0):\n ans-=1\n m[(r_x+i[1],r_y+i[0])]=1\n \nfor i in range(1,9):\n if(m[(i,r_y)]==0):\n ans-=1\n if(m[(r_x,i)]==0):\n ans-=1\nprint(ans) \n\n \t \t \t\t\t \t\t \t \t \t\t\t", "a = input()\r\nb = input()\r\n\r\nxa = ord(a[0]) - ord('a')\r\nya = ord(a[1]) - ord('1')\r\n\r\nxb = ord(b[0]) - ord('a')\r\nyb = ord(b[1]) - ord('1')\r\n\r\ndef dist(x1, y1, x2, y2) :\r\n return (x1 - x2) ** 2 + (y1 - y2) ** 2\r\n\r\nans = 0\r\nfor x in range(8) :\r\n for y in range(8) :\r\n if x == xa or y == ya or (x == xb and y == yb) :\r\n continue\r\n if xb == xa or yb == ya :\r\n continue\r\n if dist(xa, ya, xb, yb) == 5 :\r\n continue\r\n if dist(xa, ya, x, y) == 5 :\r\n continue\r\n if dist(xb, yb, x, y) == 5 :\r\n continue\r\n ans += 1\r\nprint(ans)", "def isFree(rook, knight, dot):\r\n if dot == rook or dot == knight:\r\n return 0\r\n if dot[0] == rook[0] or dot[1] == rook[1]:\r\n return 0\r\n if chr(ord(dot[0]) + 1) + chr(ord(dot[1]) + 2) == rook or \\\r\n chr(ord(dot[0]) + 2) + chr(ord(dot[1]) + 1) == rook or \\\r\n chr(ord(dot[0]) + 2) + chr(ord(dot[1]) - 1) == rook or \\\r\n chr(ord(dot[0]) + 1) + chr(ord(dot[1]) - 2) == rook or \\\r\n chr(ord(dot[0]) - 1) + chr(ord(dot[1]) - 2) == rook or \\\r\n chr(ord(dot[0]) - 2) + chr(ord(dot[1]) - 1) == rook or \\\r\n chr(ord(dot[0]) - 2) + chr(ord(dot[1]) + 1) == rook or \\\r\n chr(ord(dot[0]) - 1) + chr(ord(dot[1]) + 2) == rook:\r\n return 0\r\n if chr(ord(dot[0]) + 1) + chr(ord(dot[1]) + 2) == knight or \\\r\n chr(ord(dot[0]) + 2) + chr(ord(dot[1]) + 1) == knight or \\\r\n chr(ord(dot[0]) + 2) + chr(ord(dot[1]) - 1) == knight or \\\r\n chr(ord(dot[0]) + 1) + chr(ord(dot[1]) - 2) == knight or \\\r\n chr(ord(dot[0]) - 1) + chr(ord(dot[1]) - 2) == knight or \\\r\n chr(ord(dot[0]) - 2) + chr(ord(dot[1]) - 1) == knight or \\\r\n chr(ord(dot[0]) - 2) + chr(ord(dot[1]) + 1) == knight or \\\r\n chr(ord(dot[0]) - 1) + chr(ord(dot[1]) + 2) == knight:\r\n return 0\r\n\r\n return 1\r\n\r\n\r\nrook, knight, ans = input(), input(), 0\r\nfor row in range(1, 9):\r\n for col in range(97, 105):\r\n dot = chr(col) + str(row)\r\n ans += isFree(rook, knight, dot)\r\n\r\nprint(ans)\r\n", "#######<786>#######\n#######[_PUTIN Still Alive_]######\n######Let's start rock and Roolllll###########\npi=\"31415926535897932384626433832795\"#######\n#################\n###############################\n###############################\n###############################\n'''sudo upgrade && update\npip install PUTIN\nLoading PUTIN...################### 99% done...\nDownload Successfully...\nfrom PUTIN import Putin_er_Khel as Conquer\n'''\n# for _ in range(int(input())):s=input();print(\"wins\" if s==s[::-1] else \"loses\")\n\"\"\"\nEven death, Putin is The Hero\nwhile(true){\n printf(\"I am the fan of PUTIN\\n\");\n}\n\n\n\"\"\"\nx=input()\ny=input()\na1=ord(x[0])-ord('a')+1\nb1=int(x[1])\na2=ord(y[0])-ord('a')+1\nb2=int(y[1])\nr=0\nfor i in range(1,9):\n for j in range(1,9):\n if not((i==a1 or j==b1) or (i==a2 and j==b2) or (abs((i-a1)*(j-b1))==2 or abs((i-a2)*(j-b2))==2)):\n r+=1\nprint(r)\n\n#for _ in range(int(input())):print(\"YES\" if int(input())>=30 else \"NO\")\n# for _ in range(int(input())):\n# n=int(input())\n# s=str(input())[:n]\n# x=0;y=0\n# for i in range(n):\n# if s[i]==\"U\":y+=1\n# elif s[i]==\"D\":y-=1\n# elif s[i]==\"R\":x+=1\n# else:x-=1\n# if x==1 and y==1:print(\"YES\");break\n# if x!=1 or y!=1:print(\"NO\")\n\n# for i in range(int(input())):\n# v,t=map(int,input().split());print(2*v*t)\n\n#// When I wrote this, only ALLAH and I understood what I was doing.\n# Now, ALLAH only knows.\n\n#/* You are not meant to understand this */\n\n\n\n\n\n\"\"\"\nwhile(1>0)\n {\n 1.Wait here until Vikings PUTIN strike again.\n 2.PUTIN always support us..\n }\n\"\"\"\n\n\n\n#############################################################################################################################\n#### ###### ############## ##### ###### ######## ################ #########\n#### ########## ##### ############## ############## ###################### ############### # ############# #########\n#### ########## ##### ############## ############## ###################### ############### ### ########### #########\n#### ########## ##### ############## ############## ###################### ############### #### ########## #########\n#### ########## ##### ############## ############## ###################### ############### ##### ######### #########\n#### ########## ##### ############## ############## ###################### ############### ####### ####### #########\n#### \t\t ##### ############## ############## ###################### ############### ######## ###### #########\n#### ################# ############## ############## ###################### ############### ######### ##### #########\n#### ################# ############## ############## ###################### ############### ########### ### #########\n#### ################# ############## ############## ###################### ############### ############ ## #########\n#### ################# ############## ############## ###################### ############### ############# # #########\n#### #################### ################# ############### ####### ############## ###########\n#############################################################################################################################\n\n\n\n\n\n\n\n\n\n\n\n\"\"\"\ncreated by \nMahid\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\t \t\t\t\t \t \t\t \t \t\t \t\t\t\t\t \t", "s1 = input()\r\ns2 = input()\r\nx1,y1,x2,y2 = int(ord(s1[0])-96),int(s1[1]),int(ord((s2[0]))-96),int(s2[1])\r\nc = [[False for j in range(9)] for i in range(9)]\r\nc[x1][y1] = True\r\nc[x2][y2] = True\r\nfor i in range(1,9):\r\n c[x1][i] = True\r\n c[i][y1] = True\r\nm = [[-2,-1],[-2,1],[-1,2],[-1,-2],[1,2],[1,-2],[2,-1],[2,1]]\r\ncnt = 0\r\ntmp = []\r\nfor i in range(len(m)):\r\n t1 = x2 + m[i][0]\r\n t2 = y2 + m[i][1]\r\n if t1 >=1 and t1 <= 8 and t2 >=1 and t2 <= 8:\r\n if not c[t1][t2]:\r\n c[t1][t2] = True\r\n t1 = x1 + m[i][0]\r\n t2 = y1 + m[i][1]\r\n if t1 >=1 and t1 <= 8 and t2 >=1 and t2 <= 8:\r\n if not c[t1][t2]:\r\n c[t1][t2] = True\r\nfor i in range(1,9):\r\n for j in range(1,9):\r\n if not c[i][j]: cnt+=1\r\nprint(cnt)", "rook_position = input()\nfirst_knight_position = input()\n\nrows = list(range(1, 9))\ncolumns = ['a', 'b', 'c', 'd', 'e', 'f', 'g', 'h']\npositions = []\n\nfor row in rows:\n for column in columns:\n positions.append(column + str(row))\n\noccupied_by_rook = []\noccupied_by_knight = []\npositions_potential_knight_can_beat_rook = []\n\n# All locations the rook can move to\nfor i in rows:\n occupied_by_rook.append(rook_position[0] + str(i))\n\nfor column in columns:\n occupied_by_rook.append(column + str(rook_position[1]))\n\n# All locations the knight can move to\n\nx = columns.index(first_knight_position[0])\ny = int(first_knight_position[1])\n\nif x + 2 <= 7 and y + 1 <= 8:\n occupied_by_knight.append(columns[x + 2] + str(y + 1))\nif x + 1 <= 7 and y + 2 <= 8:\n occupied_by_knight.append(columns[x + 1] + str(y + 2))\nif x - 1 >= 0 and y + 2 <= 8:\n occupied_by_knight.append(columns[x - 1] + str(y + 2))\nif x - 2 >= 0 and y + 1 <= 8:\n occupied_by_knight.append(columns[x - 2] + str(y + 1))\nif x - 2 >= 0 and y - 1 >= 1:\n occupied_by_knight.append(columns[x - 2] + str(y - 1))\nif x - 1 >= 0 and y - 2 >= 1:\n occupied_by_knight.append(columns[x - 1] + str(y - 2))\nif x + 1 <= 7 and y - 2 >= 1:\n occupied_by_knight.append(columns[x + 1] + str(y - 2))\nif x + 2 <= 7 and y - 1 >= 1:\n occupied_by_knight.append(columns[x + 2] + str(y - 1))\n\nj = columns.index(rook_position[0])\nk = int(rook_position[1])\n\nif j + 2 <= 7 and k + 1 <= 8:\n positions_potential_knight_can_beat_rook.append(columns[j + 2] + str(k + 1))\nif j + 1 <= 7 and k + 2 <= 8:\n positions_potential_knight_can_beat_rook.append(columns[j + 1] + str(k + 2))\nif j - 1 >= 0 and k + 2 <= 8:\n positions_potential_knight_can_beat_rook.append(columns[j - 1] + str(k + 2))\nif j - 2 >= 0 and k + 1 <= 8:\n positions_potential_knight_can_beat_rook.append(columns[j - 2] + str(k + 1))\nif j - 2 >= 0 and k - 1 >= 1:\n positions_potential_knight_can_beat_rook.append(columns[j - 2] + str(k - 1))\nif j - 1 >= 0 and k - 2 >= 1:\n positions_potential_knight_can_beat_rook.append(columns[j - 1] + str(k - 2))\nif j + 1 <= 7 and k - 2 >= 1:\n positions_potential_knight_can_beat_rook.append(columns[j + 1] + str(k - 2))\nif j + 2 <= 7 and k - 1 >= 1:\n positions_potential_knight_can_beat_rook.append(columns[j + 2] + str(k - 1))\n\noccupied = set(positions_potential_knight_can_beat_rook + occupied_by_knight + occupied_by_rook)\n\nprint(64 - len(occupied) - 1)", "\r\nc2i = lambda c: ord(c) - ord('a')\r\n\r\n\r\ndef solve(rock, horse, board):\r\n\tcnt = 0\r\n\tfor i in range(2, 10):\r\n\t\tfor j in range(2, 10):\r\n\t\t\tif not board[i][j]:\r\n\t\t\t\tcnt += 1\r\n\treturn cnt\r\n\r\n\r\ndef main():\r\n\trock, horse = list(input()), list(input())\r\n\trock, horse = [c2i(rock[0])+2, int(rock[1])+1], [c2i(horse[0])+2, int(horse[1])+1]\r\n\tpositions = [[2, -1], [2, 1], [1, 2], [-1, 2], [-2, 1], [-2, -1], [-1, -2], [1, -2]]\r\n\r\n\r\n\tboard = [[0 for i in range(12)] for i in range(12)]\r\n\tboard[horse[0]][horse[1]] = 1\r\n\r\n\tfor i in range(2, 10):\r\n\t\tfor j in range(2, 10):\r\n\t\t\tif i == rock[0] or j == rock[1]:\r\n\t\t\t\tboard[i][j] = 1\r\n\tfor pos in positions:\r\n\t\tboard[horse[0] + pos[0]][horse[1]+pos[1]] = 1\r\n\t\tboard[rock[0]+pos[0]][rock[1]+pos[1]] = 1\r\n\tprint(solve(rock, horse, board))\r\n\r\nmain()", "s = input()\r\nx1 = ord(s[0]) - ord(\"a\")\r\ny1 = ord(s[1]) - ord(\"1\")\r\ns = input()\r\nx2 = ord(s[0]) - ord(\"a\")\r\ny2 = ord(s[1]) - ord(\"1\")\r\n\r\nans = 0\r\n\r\nfor i in range(8):\r\n for j in range(8):\r\n if i == x1 or j == y1:\r\n continue\r\n\r\n if i == x2 and j == y2:\r\n continue\r\n\r\n if (\r\n abs(i - x1) == 1\r\n and abs(j - y1) == 2\r\n or abs(i - x1) == 2\r\n and abs(j - y1) == 1\r\n ):\r\n continue\r\n\r\n if (\r\n abs(i - x2) == 1\r\n and abs(j - y2) == 2\r\n or abs(i - x2) == 2\r\n and abs(j - y2) == 1\r\n ):\r\n continue\r\n\r\n ans += 1\r\n\r\n\r\nprint(ans)", "from itertools import repeat\ndef chessNotationToPair(s):\n return (ord(s[0])-ord('a'), int(s[1])-1)\nrook = chessNotationToPair(input())\nknight = chessNotationToPair(input())\n\nknight_moves = [(2, 1), (2, -1), (-2, 1), (-2, -1), (1, 2), (-1, 2), (1, -2), (-1, -2)]\n\nunavailable_squares = set()\nadd_pairs = lambda x, y: (x[0]+y[0], x[1]+y[1])\nfor i in map(add_pairs, repeat(knight), knight_moves):\n unavailable_squares.add(i)\n\nfor i in map(add_pairs, repeat(rook), knight_moves):\n unavailable_squares.add(i)\n\nunavailable_squares.add(knight)\n\nfor i in range(0, 8):\n unavailable_squares.add((i, rook[1]))\n unavailable_squares.add((rook[0], i))\n\nunavailable_squares = {x for x in unavailable_squares if x[0] >= 0 and x[0] < 8 and x[1] >= 0 and x[1] < 8}\nprint(64-len(unavailable_squares))\n\n\t \t \t\t\t\t \t\t \t\t\t\t \t", "rook = input()\r\nknight = input()\r\n\r\ndef letterToNum(l):\r\n return ord(l) - 96\r\n\r\ndef knightBeat(i, target):\r\n if abs(int(target[1]) - int(i[1])) == 2 and abs(letterToNum(target[0]) - letterToNum(i[0])) == 1:\r\n return True\r\n if abs(int(target[1]) - int(i[1])) == 1 and abs(letterToNum(target[0]) - letterToNum(i[0])) == 2:\r\n return True\r\n return False\r\n\r\nsquares = ['a1', 'a2', 'a3', 'a4', 'a5', 'a6', 'a7', 'a8', 'b1', 'b2', 'b3', 'b4', 'b5', 'b6', 'b7', 'b8', 'c1', 'c2', 'c3', 'c4', 'c5', 'c6', 'c7', 'c8', 'd1', 'd2', 'd3', 'd4', 'd5', 'd6', 'd7', 'd8', 'e1', 'e2', 'e3', 'e4', 'e5', 'e6', 'e7', 'e8', 'f1', 'f2', 'f3', 'f4', 'f5', 'f6', 'f7', 'f8', 'g1', 'g2', 'g3', 'g4', 'g5', 'g6', 'g7', 'g8', 'h1', 'h2', 'h3', 'h4', 'h5', 'h6', 'h7', 'h8']\r\ncounter = 0\r\nfor i in squares:\r\n if (i[0] != rook[0] and i[1] != rook[1]) and i != knight and knightBeat(i, rook) == False and knightBeat(i, knight) == False and knightBeat(knight, i) == False:\r\n counter += 1\r\nprint(counter)", "rook, horse = input(), input()\r\n\r\nbeat = {i: {j: False for j in range(1, 9)} for i in range(1, 9)}\r\nkey = {'a': 1, 'b': 2, 'c': 3, 'd': 4, 'e': 5, 'f': 6, 'g': 7, 'h': 8}\r\n\r\nr = (key[rook[0]], int(rook[1]))\r\nh = (key[horse[0]], int(horse[1]))\r\n\r\ndx = (2, 1, -1, -2, -2, -1, 1, 2)\r\ndy = (1, 2, 2, 1, -1, -2, -2, -1)\r\n\r\nfor i in range(1, 9):\r\n beat[i][r[1]] = True\r\n beat[r[0]][i] = True\r\n\r\nfor i in range(8):\r\n x, y = r[0] + dx[i], r[1] + dy[i]\r\n if 1 <= x <= 8 and 1 <= y <= 8:\r\n beat[x][y] = True\r\n\r\n x, y = h[0] + dx[i], h[1] + dy[i]\r\n if 1 <= x <= 8 and 1 <= y <= 8:\r\n beat[x][y] = True\r\n\r\nbeat[h[0]][h[1]] = True\r\n\r\nans = 0\r\nfor i in range(1, 9):\r\n for j in range(1, 9):\r\n if beat[i][j] == False:\r\n ans += 1\r\n\r\nprint(ans)\r\n", "def isFree(rook: str, knight: str, dot: str) -> int:\r\n if dot == knight or dot[0] == rook[0] or dot[1] == rook[1]:\r\n return 0\r\n if str(int(dot[1]) + 2) == rook[1] and chr(ord(dot[0]) + 1) == rook[0] or \\\r\n str(int(dot[1]) + 2) == knight[1] and chr(ord(dot[0]) + 1) == knight[0] or \\\r\n \\\r\n str(int(dot[1]) + 1) == rook[1] and chr(ord(dot[0]) + 2) == rook[0] or \\\r\n str(int(dot[1]) + 1) == knight[1] and chr(ord(dot[0]) + 2) == knight[0] or \\\r\n \\\r\n str(int(dot[1]) - 1) == rook[1] and chr(ord(dot[0]) + 2) == rook[0] or \\\r\n str(int(dot[1]) - 1) == knight[1] and chr(ord(dot[0]) + 2) == knight[0] or \\\r\n \\\r\n str(int(dot[1]) - 2) == rook[1] and chr(ord(dot[0]) + 1) == rook[0] or \\\r\n str(int(dot[1]) - 2) == knight[1] and chr(ord(dot[0]) + 1) == knight[0] or \\\r\n \\\r\n str(int(dot[1]) - 2) == rook[1] and chr(ord(dot[0]) - 1) == rook[0] or \\\r\n str(int(dot[1]) - 2) == knight[1] and chr(ord(dot[0]) - 1) == knight[0] or \\\r\n \\\r\n str(int(dot[1]) - 1) == rook[1] and chr(ord(dot[0]) - 2) == rook[0] or \\\r\n str(int(dot[1]) - 1) == knight[1] and chr(ord(dot[0]) - 2) == knight[0] or \\\r\n \\\r\n str(int(dot[1]) + 1) == rook[1] and chr(ord(dot[0]) - 2) == rook[0] or \\\r\n str(int(dot[1]) + 1) == knight[1] and chr(ord(dot[0]) - 2) == knight[0] or \\\r\n \\\r\n str(int(dot[1]) + 2) == rook[1] and chr(ord(dot[0]) - 1) == rook[0] or \\\r\n str(int(dot[1]) + 2) == knight[1] and chr(ord(dot[0]) - 1) == knight[0]:\r\n return 0\r\n return 1\r\n\r\n\r\nrook, knight, ans = input(), input(), 0\r\nfor column in range(1, 9):\r\n for row in range(1, 9):\r\n dot = f'{chr(column + 96)}{row}'\r\n ans += isFree(rook, knight, dot)\r\n\r\nprint(ans)\r\n", "def check_rook(r1, c1, r2, c2):\n if r1 == r2 or c1 == c2:\n return 0\n elif (abs(r1 - r2) == 2 and abs(c1 - c2) == 1) or (abs(r1 - r2) == 1 and abs(c1 - c2) == 2):\n return 0\n else:\n return 1\n\ndef check_knight(r1, c1, r2, c2):\n if (abs(r1 - r2) == 2 and abs(c1 - c2) == 1) or (abs(r1 - r2) == 1 and abs(c1 - c2) == 2):\n return 0\n else:\n return 1\n\ndef main():\n pos_r = input()\n c1 = ord(pos_r[:1]) - 96\n r1 = 9 - int(pos_r[1:])\n pos_k = input()\n c2 = ord(pos_k[:1]) - 96\n r2 = 9 - int(pos_k[1:])\n count = 0\n # print(r1, c1)\n # print(r2, c2)\n # print('----------')\n for i in range(1, 9):\n for j in range(1, 9):\n if (i == r1 and j == c1) or (i == r2 and j == c2):\n continue\n elif check_rook(r1, c1, i, j) and check_knight(r2, c2, i, j):\n # print(i, j)\n count += 1\n print(count)\n\nif __name__ == '__main__':\n main()\n", "rook = input()\r\nknight = input()\r\na = [[0]*8 for i in range(8)]\r\nri, rj = ord(rook[0])-97, int(rook[1])-1\r\nki, kj = ord(knight[0])-97, int(knight[1])-1\r\na[ri][rj] = 1\r\na[ki][kj] = 1\r\nfor i in range(8):\r\n\ta[i][rj] = 1\r\n\ta[ri][i] = 1\r\nfor i in range(1,3):\r\n\tif ki-i >= 0 and kj-(3-i) >= 0:\r\n\t\ta[ki-i][kj-(3-i)] = 1\r\n\tif ki-i >= 0 and kj+(3-i) < 8:\r\n\t\ta[ki-i][kj+(3-i)] = 1\r\n\tif ki+i < 8 and kj-(3-i) >= 0:\r\n\t\ta[ki+i][kj-(3-i)] = 1\r\n\tif ki+i < 8 and kj+(3-i) < 8:\r\n\t\ta[ki+i][kj+(3-i)] = 1\r\nfor i in range(1,3):\r\n\tif ri-i >= 0 and rj-(3-i) >= 0:\r\n\t\ta[ri-i][rj-(3-i)] = 1\r\n\tif ri-i >= 0 and rj+(3-i) < 8:\r\n\t\ta[ri-i][rj+(3-i)] = 1\r\n\tif ri+i < 8 and rj-(3-i) >= 0:\r\n\t\ta[ri+i][rj-(3-i)] = 1\r\n\tif ri+i < 8 and rj+(3-i) < 8:\r\n\t\ta[ri+i][rj+(3-i)] = 1\r\ncount = 0\r\nfor i in range(8):\r\n\tfor j in range(8):\r\n\t\tif a[i][j] == 0:\r\n\t\t\tcount += 1\r\nprint(count)", "def c(M,x,y):\r\n p=[-2,+2]\r\n q=[-1,+1]\r\n l=[M[x+p[i]][y+q[j]]!=0 for i in range(len(p)) for j in range(len(q)) if(0<=x+p[i]<8 and 0<=y+q[j]<8)]\r\n l+=[M[x+q[i]][y+p[j]]!=0 for i in range(len(q)) for j in range(len(p)) if(0<=x+q[i]<8 and 0<=y+p[j]<8)]\r\n return 1 in l \r\nmp=['a','b','c','d','e','f','g','h']\r\ni=input\r\nn=i()\r\nm=i()\r\nM=[[0 for x in range(8)]for y in range(8)]\r\nl=[[mp.index(n[0]),int(n[1])-1],[mp.index(m[0]),int(m[1])-1]]\r\nM[l[0][0]][l[0][1]]=2\r\nM[l[1][0]][l[1][1]]=1\r\nr=0\r\nfor x in range(8):\r\n for y in range(8):\r\n if(0==M[x][y]):\r\n if(x==l[0][0]or y==l[0][1]):continue\r\n if(c(M,x,y)==False):r+=1\r\nprint(r)\r\n", "#8:23\r\n\r\nrook=input()\r\nN=input()\r\n\r\nrook_col=rook[0]\r\nrook_row=rook[1]\r\n\r\nrows=['1','2','3','4','5','6','7','8']\r\ncols=['a','b','c','d','e','f','g','h']\r\n\r\nrows.remove(rook_row)\r\ncols.remove(rook_col)\r\n\r\nsquares=[]\r\n\r\nfor col in cols:\r\n for row in rows:\r\n squares.append(col+row)\r\nsquares.remove(N)\r\n\r\ndef islegal(square):\r\n col=ord(square[0])\r\n try:\r\n row=int(square[1])\r\n except:\r\n return False\r\n if 97<=col<=97+7 and 1<=row<=8:\r\n return True\r\n return False\r\n\r\ndef getSquares(knight):\r\n k_col=knight[0]\r\n k_row=knight[1]\r\n\r\n k_squares=[knight]\r\n\r\n for short in [1,-1]:\r\n for long in [2,-2]:\r\n square1=chr(ord(k_col)+long)+str(int(k_row)+short)\r\n square2=chr(ord(k_col)+short)+str(int(k_row)+long)\r\n for square in [square1,square2]:\r\n if islegal(square):\r\n k_squares.append(square)\r\n return k_squares\r\n\r\n\r\n\r\ndef knight_placeable(pos_square,k_square,rook_square): \r\n knight_squares=getSquares(pos_square)\r\n if rook_square in knight_squares:\r\n return False\r\n if k_square in knight_squares:\r\n return False\r\n return True\r\ncount=0\r\nfor place in squares:\r\n if knight_placeable(place,N,rook):\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\r\n\r\n\r\n", "p = tuple((ord(s[0]) - ord('a'), int(s[1]) - 1) for s in (input() for i in range(2)))\nprint(sum((i, j) not in p and i != p[0][0] and j != p[0][1] and all(sorted((abs(i - pi[0]), abs(j - pi[1]))) != [1, 2] for pi in p) for i in range(8) for j in range(8)))\n", "rook=input()\r\nk=input()\r\nblocked=[str(rook[0]+str(i)) for i in range(1,9)]+[str(chr(96+i)+str(rook[1])) for i in range(1,9)]+[rook+k]\r\nkn=[\r\n chr(ord(k[0])-1)+str(int(k[1])+2),\r\n chr(ord(k[0])-1)+str(int(k[1])-2),\r\n chr(ord(k[0])+1)+str(int(k[1])+2),\r\n chr(ord(k[0])+1)+str(int(k[1])-2),\r\n chr(ord(k[0])-2)+str(int(k[1])+1),\r\n chr(ord(k[0])-2)+str(int(k[1])-1),\r\n chr(ord(k[0])+2)+str(int(k[1])+1),\r\n chr(ord(k[0])+2)+str(int(k[1])-1),\r\n chr(ord(rook[0])-1)+str(int(rook[1])+2),\r\n chr(ord(rook[0])-1)+str(int(rook[1])-2),\r\n chr(ord(rook[0])+1)+str(int(rook[1])+2),\r\n chr(ord(rook[0])+1)+str(int(rook[1])-2),\r\n chr(ord(rook[0])-2)+str(int(rook[1])+1),\r\n chr(ord(rook[0])-2)+str(int(rook[1])-1),\r\n chr(ord(rook[0])+2)+str(int(rook[1])+1),\r\n chr(ord(rook[0])+2)+str(int(rook[1])-1)\r\n]\r\ndef verify(s):\r\n if len(s)>2: return False\r\n n=int(s[1])\r\n if ('a'<=s[0]<='h') and (1<=n<=8): return True\r\n return False\r\nfor i in kn:\r\n if verify(i): blocked.append(i)\r\n\r\nblocked = list(set(blocked))\r\nprint(64-len(blocked))", "s = input()\nx1 = ord(s[0]) - ord('a')\ny1 = ord(s[1]) - ord('1')\ns = input()\nx2 = ord(s[0]) - ord('a')\ny2 = ord(s[1]) - ord('1')\n\nans = 0\n\nfor i in range(8):\n for j in range(8):\n if i == x1 or j == y1:\n continue\n\n if i == x2 and j == y2:\n continue\n\n if abs(i - x1) == 1 and abs(j - y1) == 2 or abs(i - x1) == 2 and abs(j - y1) == 1:\n continue\n\n if abs(i - x2) == 1 and abs(j - y2) == 2 or abs(i - x2) == 2 and abs(j - y2) == 1:\n continue\n\n ans += 1\n\n\nprint(ans)", "s1 = input()\r\ns2 = input()\r\nc1 = ord(s1[0])-97\r\nr1 = ord(s1[1])-ord('0')-1\r\nc2 = ord(s2[0])-97\r\nr2 = ord(s2[1])-ord('0')-1\r\nMatrix = [[0 for x in range(8)] for y in range(8)] \r\nMatrix[r1][c1]=1;\r\nMatrix[r2][c2]=1;\r\nfor i in range(0,8):\r\n for j in range(0,8):\r\n if i==r1 or j==c1:\r\n Matrix[i][j]=1\r\n if ((abs(r2-i)==2 and abs(c2-j)==1) or (abs(r2-i)==1 and abs(c2-j)==2) or (abs(r1-i)==2 and abs(c1-j)==1) or (abs(r1-i)==1 and abs(c1-j)==2)):\r\n Matrix[i][j]=1\r\nans = 0\r\nfor i in range(0,8):\r\n for j in range(0,8):\r\n if (Matrix[i][j]==0):\r\n ans+=1\r\n# for row in Matrix:\r\n# for elem in row:\r\n# print(elem, end=' ')\r\n# print()\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\nr = input().strip()\r\nk = input().strip()\r\nx1 = ord(r[0]) - ord('a')\r\nx2 = ord(k[0]) - ord('a')\r\ny1, y2 = ord(r[1]) - ord('1'), ord(k[1]) - ord('1')\r\nans = 0\r\nfor i in range(8):\r\n for j in range(8):\r\n if(i != x1 and j != y1 and ((x1 - i)**2 + (y1 - j)**2) != 5 and ((x2 - i)**2 + (y2 - j)**2) != 5 and ((x2 - i)**2 + (y2 - j)**2) != 0):\r\n ans += 1\r\nprint(ans)", "x1, y1 = input()\r\nx1, y1 = ord(x1)-97, int(y1)-1\r\nx2, y2 = input()\r\nx2, y2 = ord(x2)-97, int(y2)-1\r\n\r\nprint(sum( (i,j) not in ((x1,y1),(x2,y2)) and i != x1 and j != y1\r\n and all(sorted((abs(x-i),abs(y-j)))!=[1,2] for x,y in ((x1,y1),(x2,y2)))\r\n for i in range(8) for j in range(8)))", "def f(l1,l2,l3):\r\n\tif l1[0]==l3[0] or l1[1]==l3[1]:\r\n\t\treturn False\r\n\tif l2[0]==l3[0] and l2[1]==l3[1]:\r\n\t\treturn False\r\n\tif(abs(l1[0]-l3[0])==2 and abs(l1[1]-l3[1])==1) or (abs(l1[0]-l3[0])==1 and abs(l1[1]-l3[1])==2):\r\n\t\treturn False\r\n\tif(abs(l2[0]-l3[0])==2 and abs(l2[1]-l3[1])==1) or (abs(l2[0]-l3[0])==1 and abs(l2[1]-l3[1])==2):\r\n\t\treturn False\r\n\treturn True\r\n\r\ns=input()\r\ns2=input()\r\nl1=[]\r\nl2=[]\r\nl1.append(ord(s[0])-97)\r\nl2.append(ord(s2[0])-97)\r\nl1.append(int(s[1])-1)\r\nl2.append(int(s2[1])-1)\r\nans=0\r\nl3=[]\r\nfor i in range(8):\r\n\tfor j in range(8):\r\n\t\tif f(l1,l2,[i,j]):\r\n\t\t\tans+=1\r\nprint(ans)", "import math\r\n#t=int(input())\r\n#for i in range(t):\r\nr=input()\r\nk=input()\r\nlr=[0,0]\r\nlk=[0,0]\r\np=[]\r\nlr[1]=int(r[1])\r\nlk[1]=int(k[1])\r\nlr[0]=ord(r[0])-96\r\nlk[0]=ord(k[0])-96\r\nc=0\r\nif lk[0]+1<=8 and lk[1]+2<=8 and lk[0]+1!=lr[0] and lk[1]+2!=lr[1]:\r\n c+=1\r\n p.append([lk[0]+1, lk[1]+2])\r\nif lk[0]+2<=8 and lk[1]+1<=8 and lk[0]+2!=lr[0] and lk[1]+1!=lr[1]:\r\n c+=1\r\n p.append([lk[0]+2, lk[1]+1])\r\nif lk[0]-1>0 and lk[1]-2>0 and lk[0]-1!=lr[0] and lk[1]-2!=lr[1]:\r\n c+=1\r\n p.append([lk[0]-1, lk[1]-2])\r\nif lk[0]-2>0 and lk[1]-1>0 and lk[0]-2!=lr[0] and lk[1]-1!=lr[1]:\r\n c+=1\r\n p.append([lk[0]-2, lk[1]-1])\r\nif lk[0]+1<=8 and lk[1]-2>0 and lk[0]+1!=lr[0] and lk[1]-2!=lr[1]:\r\n c+=1\r\n p.append([lk[0]+1, lk[1]-2])\r\nif lk[0]-1>0 and lk[1]+2<=8 and lk[0]-1!=lr[0] and lk[1]+2!=lr[1]:\r\n c+=1\r\n p.append([lk[0]-1, lk[1]+2])\r\nif lk[0]+2<=8 and lk[1]-1>0 and lk[0]+2!=lr[0] and lk[1]-1!=lr[1]:\r\n c+=1\r\n p.append([lk[0]+2, lk[1]-1])\r\nif lk[0]-2>0 and lk[1]+1<=8 and lk[0]-2!=lr[0] and lk[1]+1!=lr[1]:\r\n c+=1\r\n p.append([lk[0]-2, lk[1]+1])\r\n#######################################\r\n#print(p)\r\nif lr[0]+1<=8 and lr[1]+2<=8 and ([lr[0]+1, lr[1]+2] not in p):\r\n c+=1\r\nif lr[0]+2<=8 and lr[1]+1<=8 and ([lr[0]+2, lr[1]+1] not in p):\r\n c+=1 \r\nif lr[0]-1>0 and lr[1]-2>0 and ([lr[0]-1, lr[1]-2] not in p):\r\n c+=1\r\n \r\nif lr[0]-2>0 and lr[1]-1>0 and ([lr[0]-2, lr[1]-1] not in p):\r\n c+=1\r\n \r\nif lr[0]+1<=8 and lr[1]-2>0 and ([lr[0]+1, lr[1]-2] not in p):\r\n c+=1\r\nif lr[0]-1>0 and lr[1]+2<=8 and ([lr[0]-1, lr[1]+2] not in p):\r\n c+=1\r\nif lr[0]+2<=8 and lr[1]-1>0 and ([lr[0]+2,lr[1]-1] not in p):\r\n c+=1\r\nif lr[0]-2>0 and lr[1]+1<=8 and ([lr[0]-2, lr[1]+1] not in p):\r\n c+=1\r\n########################################\r\nprint(49-c-1)\r\n\r\n\r\n#n,k = map(int, input().strip().split(' '))\r\n#lst = list(map(int, input().strip().split(' ')))\r\n", "def get_knight_moves(position):\r\n row, col = position\r\n knight_moves = [(2, 1), (1, 2), (-1, 2), (-2, 1), (-2, -1), (-1, -2), (1, -2), (2, -1)]\r\n return [(row + r_move, col + c_move) for r_move, c_move in knight_moves if 0 <= row + r_move < 8 and 0 <= col + c_move < 8]\r\n\r\ndef main():\r\n rook = input().strip()\r\n knight = input().strip()\r\n\r\n rook_position = (8 - int(rook[1]), ord(rook[0]) - ord('a'))\r\n knight_position = (8 - int(knight[1]), ord(knight[0]) - ord('a'))\r\n\r\n # Start with total squares (8x8 board)\r\n total_squares = 8 * 8\r\n\r\n # Create a set to hold all blocked squares\r\n blocked_squares = set()\r\n\r\n # Add squares blocked by rook\r\n for i in range(8):\r\n blocked_squares.add((rook_position[0], i)) # Row\r\n blocked_squares.add((i, rook_position[1])) # Column\r\n\r\n # Add squares from which a new knight could attack rook\r\n for position in get_knight_moves(rook_position):\r\n blocked_squares.add(position)\r\n\r\n # Add squares blocked by first knight and squares from which a new knight could attack the first knight\r\n blocked_squares.add(knight_position)\r\n for position in get_knight_moves(knight_position):\r\n blocked_squares.add(position)\r\n\r\n total_squares -= len(blocked_squares)\r\n\r\n print(total_squares)\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "r = input()\nk = input()\n\ncont = 0\n\ndef kn(k, i, j):\n a, b = [ord(x)-96 for x in [k[0], i]]\n return(\n k == (i+str(j)) or\n (abs(a-b) == 1 and abs(int(k[1]) - j) == 2) or\n (abs(a-b) == 2 and abs(int(k[1]) - j) == 1)\n )\n\n\nfor i in \"abcdefgh\":\n if i == r[0]: continue\n for j in range(1,9):\n if str(j) == r[1]: continue\n if not kn(k, i, j) and not kn(r, i, j):\n cont += 1\n\nprint(cont)\n", "def hujum(knight_1,knight_2):\r\n global beats\r\n if knight_1+1<105 and knight_2+2<57:\r\n beats.add(chr(knight_1+1)+chr(knight_2+2))\r\n if knight_1+2<105 and knight_2+1<57:\r\n beats.add(chr(knight_1+2)+chr(knight_2+1))\r\n if knight_1-1>96 and knight_2+2<57:\r\n beats.add(chr(knight_1-1)+chr(knight_2+2))\r\n if knight_1-2>96 and knight_2+1<57:\r\n beats.add(chr(knight_1-2)+chr(knight_2+1))\r\n if knight_1+1<105 and knight_2-2>48:\r\n beats.add(chr(knight_1+1)+chr(knight_2-2))\r\n if knight_1+2<105 and knight_2-1>48:\r\n beats.add(chr(knight_1+2)+chr(knight_2-1))\r\n if knight_1-1>96 and knight_2-2>48:\r\n beats.add(chr(knight_1-1)+chr(knight_2-2))\r\n if knight_1-2>96 and knight_2-1>48:\r\n beats.add(chr(knight_1-2)+chr(knight_2-1))\r\nbeats = set()\r\nrook = input()\r\nknight = input()\r\nrook_1 = ord(rook[0])\r\nrook_2 = ord(rook[1])\r\nfor x in range(49,57):\r\n beats.add(rook[0]+chr(x))\r\n if x+48!=rook_1:beats.add(chr(x+48)+rook[1])\r\nknight_1 = ord(knight[0])\r\nknight_2 = ord(knight[1])\r\nhujum(knight_1,knight_2)\r\nhujum(rook_1,rook_2)\r\nbeats.add(knight)\r\nprint(64-len(beats))", "\ndef torreCome(i,j, ft, ct):\n return (i == ft or j == ct)\n\ndef caballoCome(f, c, i, j):\n if (abs(f-i) == 1 and abs(c-j) == 2) or (abs(f-i) == 2 and abs(c-j) == 1) or (f == i and c == j):\n return 1\n return 0\n\nA = {'a': 1, 'b': 2, 'c': 3, 'd': 4, 'e': 5, 'f': 6, 'g': 7, 'h': 8}\nM = [[0]*9 for i in range(9)]\n\ndef solve(rook, knight):\n ft = A[rook[0]]\n ct = int(rook[1])\n fc = A[knight[0]]\n cc = int(knight[1])\n M[ft][ct] = 1\n M[fc][cc] = 2\n res = 0\n for i in range(1,9):\n for j in range(1,9):\n if (i==ft and j == ct) or (i == fc and j == cc):\n continue\n if not torreCome(i,j, ft, ct) and not caballoCome(ft,ct,i,j) and not caballoCome(fc, cc,i,j):\n res += 1\n M[i][j] = 9\n print(res)\n\nrook = input()\nknight = input()\nsolve(rook, knight)\n", "def notation(s):\r\n if s == 'a':\r\n return 1\r\n if s == 'b':\r\n return 2\r\n if s == 'c':\r\n return 3\r\n if s == 'd':\r\n return 4\r\n if s == 'e':\r\n return 5\r\n if s == 'f':\r\n return 6\r\n if s == 'g':\r\n return 7\r\n if s == 'h':\r\n return 8\r\n\r\n\r\ndef take(x1, y1, x2, y2):\r\n if abs(x1 - x2) == 1 and abs(y1 - y2) == 2:\r\n return True\r\n elif abs(y1 - y2) == 1 and abs(x1 - x2) == 2:\r\n return True\r\n elif x1 == x2 and y1 == y2:\r\n return True\r\n else:\r\n return False\r\n\r\n\r\nrookList = list(input())\r\nknightList = list(input())\r\nrList = notation(rookList[0]), int(rookList[1])\r\nkList = notation(knightList[0]), int(knightList[1])\r\nsm = 0\r\nfor i in range(8):\r\n if i + 1 == rList[0]:\r\n continue\r\n for j in range(8):\r\n if j + 1 == rList[1]:\r\n continue\r\n if take(i + 1, j + 1, rList[0], rList[1]):\r\n continue\r\n if take(i + 1, j + 1, kList[0], kList[1]):\r\n continue\r\n\r\n sm += 1\r\nprint(sm)\r\n", "R = input()\r\nK = input()\r\n\r\nxr = ord(R[0]) - ord('a')\r\nyr = int(R[1]) - 1\r\nxk = ord(K[0]) - ord('a')\r\nyk = int(K[1]) - 1\r\n\r\nans = 0\r\nfor x in range(8):\r\n for y in range(8):\r\n if x != xr and y != yr and (x != xk or y != yk):\r\n if (pow(abs(x - xk), 2) + pow(abs(y - yk), 2)) != 5:\r\n if(pow(abs(x - xr), 2) + pow(abs(y - yr), 2) != 5):\r\n ans += 1\r\nprint(ans) \r\n ", "import string\n\nclass Position:\n def __init__(self, notation):\n self.column = string.ascii_letters.index(notation[0])\n self.row = int(notation[1]) - 1\n def __str__(self):\n return '%d %d' % (self.row, self.column)\n\nrook = Position(input().strip())\nknight = Position(input().strip())\n\nmoves = [(-2, -1), (-2, 1), (-1, -2), (-1, 2),\n (2, -1), (2, 1), (1, -2), (1, 2)]\nresult = 0\n\nfor r in range(8):\n for c in range(8):\n if rook.row == r or rook.column == c:\n continue\n feasible = True\n for piece in [rook, knight]:\n if r == piece.row and c == piece.column:\n feasible = False\n break\n for (dr, dc) in moves:\n if r + dr == piece.row and c + dc == piece.column:\n feasible = False\n break\n if feasible:\n result += 1\n\nprint(result)\n", "rook = input()\r\nknight = input()\r\nans = 0\r\nfor i in range(ord('a'), ord('h') + 1):\r\n c = chr(i)\r\n if rook[0] == c: continue\r\n for j in range(1, 9):\r\n if int(rook[1]) == j: continue\r\n rx = ord(rook[0])\r\n ry = int(rook[1])\r\n kx = ord(knight[0])\r\n ky = int(knight[1])\r\n if(kx != i and ky != j and abs(i - kx) + abs(j - ky) == 3):\r\n continue\r\n if(kx == i and ky == j):\r\n continue\r\n if(abs(i - rx) + abs(j - ry) == 3):\r\n continue\r\n ans += 1\r\nprint(ans)\r\n ", "# -*- coding: utf-8 -*-\r\n\r\ndef a(x,y,x1,y1,x2,y2):\r\n if x == x1 or y == y1: return False\r\n if x == x2 and y == y2: return False\r\n if abs(x - x1) * abs(y - y1) == 2: return False\r\n if abs(x - x2) * abs(y - y2) == 2: return False\r\n return True\r\n\r\ntot = 0\r\nr = input(); x1 = ord(r[0]) - ord('a'); y1 = int(r[1]) - 1\r\nk = input(); x2 = ord(k[0]) - ord('a'); y2 = int(k[1]) - 1\r\n\r\nfor i in range(8):\r\n for j in range(8):\r\n if a(i,j,x1,y1,x2,y2) == True: tot += 1\r\n \r\nprint(tot)\r\n \r\n ", "\r\nm={\"abcdefgh\"[i]:i for i in range(8)}\r\n\r\npos_1 = str(input())\r\npos_2 = str(input())\r\n\r\npos_1 = [m[pos_1[0]],int(pos_1[1])-1]\r\npos_2 = [m[pos_2[0]],int(pos_2[1])-1]\r\n\r\nres = 0\r\n\r\nfor i in range(8):\r\n for j in range(8):\r\n if [i,j] != pos_1 and [i,j] != pos_2 and i!=pos_1[0] and j!=pos_1[1] and abs(i-pos_2[0])*abs(j-pos_2[1])!=2 and abs(i-pos_1[0])*abs(j-pos_1[1])!=2:\r\n res+=1\r\n\r\nprint(res)\r\n", "#from math import * \n#from heapq import heappop, heappush\nfrom collections import deque\nMOD = 10**9 + 7\n#input=sys.stdin.readline\n \n #map(int, input().split())\n #list(map(int, input().split()))\n \nfrom sys import stdin,stdout\n \ndef get_lshape_cells(i,j):\n # night\n res = []\n dir = [(-2,1),(-2,-1),(2,1),(2,-1),(-1,2),(1,2),(-1,-2),(1,-2)]\n for di,dj in dir:\n ni = i + di\n nj = j + dj\n \n in_bound = 1 <= ni < 9 and 1 <= nj < 9\n if in_bound:\n res.append((ni,nj))\n\n return res \n \ndef get_cross_celss(i,j):\n res = []\n for x in range(1,9):\n res.append((i,x))\n res.append((x,j))\n\n return res\n\ndef solution():\n \n \n rook = input()\n knight = input()\n \n knight = (int(knight[1]), ord(knight[0]) - ord(\"a\") + 1)\n rook = (int(rook[1]), ord(rook[0]) - ord(\"a\") + 1) \n \n attacked = get_lshape_cells(*rook) + get_lshape_cells(*knight) + get_cross_celss(*rook)\n\n print(8*8 - len(set(attacked +[knight, rook] )) )\n\n\n \ndef main():\n #test()\n t = 1\n #t = int(input())\n for _ in range(t):\n solution() \n \n#import sys\n#import threading\n#sys.setrecursionlimit(10**6)\n#threading.stack_size(1 << 27)\n#thread = threading.Thread(target=main)\n#thread.start(); thread.join()\nmain()\n", "rook = input()\r\nknight = input()\r\n\r\nx,y = ord(rook[0])-96 , int(rook[1])\r\ni,j = ord(knight[0])-96 , int(knight[1])\r\na = set()\r\n\r\nfor p in range(1,9):\r\n a.add((x,p))\r\n a.add((p,y))\r\n\r\na.add((i,j))\r\narr = [(i,j),(x,y)]\r\nfor i,j in arr:\r\n if i-2>=1:\r\n if j+1<=8:\r\n a.add((i-2,j+1))\r\n if j-1>=1:\r\n a.add((i-2,j-1))\r\n if i-1>=1:\r\n if j+2<=8:\r\n a.add((i-1,j+2))\r\n if j-2>=1:\r\n a.add((i-1,j-2))\r\n \r\n \r\n if i+2<=8:\r\n if j+1<=8:\r\n a.add((i+2,j+1))\r\n if j-1>=1:\r\n a.add((i+2,j-1))\r\n if i+1<=8:\r\n if j+2<=8:\r\n a.add((i+1,j+2))\r\n if j-2>=1:\r\n a.add((i+1,j-2))\r\n \r\nprint(64-len(a)) \r\n \r\n\r\n", "import sys\r\nimport math\r\n\r\nl = input()\r\nk = input()\r\n\r\ns = set()\r\n\r\nlf = ord(l[0]) - ord('a') + 1\r\nlr = int(l[1])\r\nfor i in range(1, 9):\r\n s.add((lf, i))\r\n s.add((i, lr))\r\n\r\nv = [(1, 2), (2, 1), (2, -1), (1, -2), (-1, -2), (-2, -1), (-2, 1), (-1, 2)]\r\nfor i in v:\r\n if(lf + i[0] <= 8 and lf + i[0] >= 1 and lr + i[1] <= 8 and lr + i[1] >= 1):\r\n s.add((lf + i[0], lr + i[1]))\r\n\r\nkf = ord(k[0]) - ord('a') + 1\r\nkr = int(k[1])\r\n\r\ns.add((kf, kr))\r\n\r\nfor i in v:\r\n if(kf + i[0] <= 8 and kf + i[0] >= 1 and kr + i[1] <= 8 and kr + i[1] >= 1):\r\n s.add((kf + i[0], kr + i[1]))\r\n\r\nprint(64 - len(s))\r\n\r\n ", "#8:23\r\n\r\nrook=input()\r\nN=input()\r\n\r\nrook_col=rook[0]\r\nrook_row=rook[1]\r\n\r\nrows=['1','2','3','4','5','6','7','8']\r\ncols=['a','b','c','d','e','f','g','h']\r\n\r\nrows.remove(rook_row)\r\ncols.remove(rook_col)\r\n\r\nsquares=[]\r\n\r\nfor col in cols:\r\n for row in rows:\r\n squares.append(col+row)\r\nsquares.remove(N)\r\n\r\n\r\ndef getSquares(knight):\r\n k_col=knight[0]\r\n k_row=knight[1]\r\n\r\n k_squares=[knight]\r\n\r\n for short in [1,-1]:\r\n for long in [2,-2]:\r\n square1=chr(ord(k_col)+long)+str(int(k_row)+short)\r\n square2=chr(ord(k_col)+short)+str(int(k_row)+long)\r\n for square in [square1,square2]:\r\n k_squares.append(square)\r\n return k_squares\r\n\r\n\r\nfor pos in [rook,N]:\r\n knight_squares=getSquares(pos)\r\n for sq in knight_squares:\r\n try:\r\n squares.remove(sq)\r\n except:\r\n pass\r\n \r\nprint(len(squares))\r\n\r\n\r\n\r\n", "r = input()\r\nrh = \"abcdefgh\".index(r[0])\r\nrw = int(r[1])-1\r\nk = input()\r\nkh = \"abcdefgh\".index(k[0])\r\nkw = int(k[1])-1\r\ntotal = 0\r\nfor i in range(8):\r\n for j in range(8):\r\n done = True\r\n if i != rh and j != rw and (i, j) != (kh, kw):\r\n done = False\r\n for x, y in [(-1,-2),(-1,2),(-2,-1),(-2,1),(1,-2),(1,2),(2,1),(2,-1)]:\r\n if (i+x, j+y) != (kh, kw) and (i+x, j+y) != (rh, rw):\r\n pass\r\n else:\r\n done = True\r\n break\r\n total += not done\r\nprint(total)", "from enum import Enum\r\n\r\nDIMENSION_BOARD = 8\r\n \r\nclass Alpha(Enum):\r\n a, b, c, d, e, f, g, h = 0, 1, 2, 3, 4, 5, 6, 7\r\n\r\nways = 64\r\nboard = [[0] * DIMENSION_BOARD for i in range(DIMENSION_BOARD)]\r\n\r\nrook = input()\r\nknight = input()\r\n\r\nboard[int(rook[1])-1][Alpha[rook[0]].value] = 1\r\n\r\nfor i in range(DIMENSION_BOARD):\r\n if not board[int(rook[1])-1][i] == 1:\r\n board[int(rook[1])-1][i] = 'r'\r\n\r\nfor i in range(DIMENSION_BOARD):\r\n if not board[i][Alpha[rook[0]].value] == 1:\r\n board[i][Alpha[rook[0]].value] = 'r'\r\n\r\nboard[int(knight[1])-1][Alpha[knight[0]].value] = 1\r\n\r\nfor i in range(DIMENSION_BOARD):\r\n for j in range(DIMENSION_BOARD):\r\n if board[i][j] == 1 or board[i][j] == 'r':\r\n ways -= 1\r\n elif (i-1 >= 0 and j-2 >= 0) and not board[i-1][j-2] == 'r' and board[i-1][j-2] == 1:\r\n ways -= 1\r\n elif (i-1 >= 0 and j+2 < DIMENSION_BOARD) and not board[i-1][j+2] == 'r' and board[i-1][j+2] == 1:\r\n ways -= 1\r\n elif (i+1 < DIMENSION_BOARD and j-2 >= 0) and not board[i+1][j-2] == 'r' and board[i+1][j-2] == 1:\r\n ways -= 1\r\n elif (i+1 < DIMENSION_BOARD and j+2 < DIMENSION_BOARD) and not board[i+1][j+2] == 'r' and board[i+1][j+2] == 1:\r\n ways -= 1\r\n elif (i-2 >= 0 and j-1 >= 0) and not board[i-2][j-1] == 'r' and board[i-2][j-1] == 1:\r\n ways -= 1\r\n elif (i-2 >= 0 and j+1 < DIMENSION_BOARD) and not board[i-2][j+1] == 'r' and board[i-2][j+1] == 1:\r\n ways -= 1\r\n elif (i+2 < DIMENSION_BOARD and j-1 >= 0) and not board[i+2][j-1] == 'r' and board[i+2][j-1] == 1:\r\n ways -= 1\r\n elif (i+2 < DIMENSION_BOARD and j+1 < DIMENSION_BOARD) and not board[i+2][j+1] == 'r' and board[i+2][j+1] == 1:\r\n ways -= 1\r\n\r\nprint(ways)", "rook_position = input()\r\nknight_position = input()\r\ngrid = [[0 for x in range(8)]for y in range(8)]\r\nr_row, r_col = ord(rook_position[0]) - 97, int(rook_position[1])-1\r\nk_row, k_col = ord(knight_position[0])-97, int(knight_position[1])-1\r\n\r\nfor i in range(8):\r\n grid[i][r_col] += 1\r\nfor i in range(8):\r\n grid[r_row][i] += 1\r\ndx, dy = [2, 2, 1, 1, -2, -2, -1, -1], [1, -1, 2 , -2, 1, -1, 2 ,-2]\r\ngrid[k_row][k_col] += 1\r\nfor i in range(8):\r\n if (k_row+dx[i] > 7 or k_row+dx[i] < 0) or (k_col+dy[i] > 7 or k_col+dy[i] < 0):\r\n grid[k_row][k_col] += 1\r\n else:\r\n grid[k_row+dx[i]][k_col+dy[i]] += 1\r\n\r\ncount = 0\r\n\r\nfor i in range(8):\r\n if (r_row+dx[i] > 7 or r_row+dx[i] < 0) or (r_col+dy[i] > 7 or r_col+dy[i] < 0):\r\n grid[k_row][k_col] += 1\r\n else:\r\n grid[r_row+dx[i]][r_col+dy[i]] += 1\r\n\r\nfor a in range(8):\r\n for b in range(8):\r\n if grid[a][b] == 0:\r\n count += 1\r\n\r\nprint(count)", "x, y = input(), input()\r\na1, b1 = ord(x[0]) - ord('a') + 1, int(x[1])\r\na2, b2 = ord(y[0]) - ord('a') + 1, int(y[1])\r\ncount = 0\r\nfor i in range(1, 9):\r\n for j in range(1, 9):\r\n if not ((i == a1 or j == b1) or (i == a2 and j == b2) or (abs((i-a1)*(j-b1))) == 2 or (abs((i - a2) * (j - b2)) == 2)):\r\n count += 1\r\nprint(count)", "first = input()\r\nsecond = input()\r\ns = \"abcdefjh\"\r\nans = 0\r\nfor i in \"abcdefgh\":\r\n for j in range(1, 9):\r\n move = i + str(j)\r\n\r\n if move != first and move != second:\r\n if not i in first and not str(j) in first:\r\n # first\r\n letter = i\r\n\r\n if chr(ord(letter) + 1) + str(j + 2) != first and chr(ord(letter) + 1) + str(j + 2) != second:\r\n if chr(ord(letter) + 1) + str(j - 2) != first and chr(ord(letter) + 1) + str(j - 2) != second:\r\n if chr(ord(letter) - 1) + str(j + 2) != first and chr(ord(letter) - 1) + str(j + 2) != second:\r\n if chr(ord(letter) - 1) + str(j - 2) != first and chr(ord(letter) - 1) + str(j - 2) != second:\r\n if chr(ord(letter) + 2) + str(j + 1) != first and chr(ord(letter) + 2) + str(j + 1) != second:\r\n if chr(ord(letter) + 2) + str(j - 1) != first and chr(ord(letter) + 2) + str(j - 1) != second:\r\n if chr(ord(letter) - 2) + str(j + 1) != first and chr(ord(letter) - 2) + str(j + 1) != second:\r\n if chr(ord(letter) - 2) + str(j - 1) != first and chr(ord(letter) - 2) + str(j - 1) != second:\r\n ans += 1\r\n\r\n\r\n\r\nprint(ans)", "ab = lambda x: -x if x<0 else x\r\n\r\ndef f(l):\r\n s = \"abcdefgh\"\r\n r,k = l\r\n rx,kx = s.index(r[0]), s.index(k[0])\r\n ry,ky = int(r[1])-1, int(k[1])-1\r\n b = [1]*64 #1=valid; 0=invalid\r\n for i in range(64):\r\n ix,iy = i//8,i%8\r\n dx,dy = ab(ix-kx),ab(iy-ky)\r\n ex,ey = ab(ix-rx),ab(iy-ry)\r\n if ix==rx or iy==ry or dx+dy==0 or (dx<3 and dy<3 and dx+dy==3) or (ex<3 and ey<3 and ex+ey==3):\r\n b[i]=0\r\n return sum(b)\r\n\r\nl = [input() for _ in range(2)]\r\nprint(f(l))\r\n", "import sys\r\nimport math\r\nimport bisect\r\n\r\ndef is_knight_attack(a, b):\r\n if abs(a[0] - b[0]) == 1 and abs(a[1] - b[1]) == 2:\r\n return True\r\n if abs(a[0] - b[0]) == 2 and abs(a[1] - b[1]) == 1:\r\n return True\r\n return False\r\n\r\ndef solve(a, b):\r\n ans = 0\r\n for i in range(8):\r\n for j in range(8):\r\n c = (i, j)\r\n if c != a and c != b:\r\n ok = True\r\n #print('a: %s, b: %s, c: %s' % (str(a), str(b), str(c)))\r\n if c[0] == a[0]:\r\n ok = False\r\n if c[1] == a[1]:\r\n ok = False\r\n if is_knight_attack(a, c):\r\n ok = False\r\n if is_knight_attack(b, c):\r\n ok = False\r\n if ok:\r\n ans += 1\r\n return ans\r\n\r\ndef main():\r\n s = input()\r\n A = (ord(s[0]) - ord('a'), int(s[1]) - 1)\r\n s = input()\r\n B = (ord(s[0]) - ord('a'), int(s[1]) - 1)\r\n print(solve(A, B))\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "#!/usr/bin/env python3\n\ndef is_valid(r, k, new):\n if r[0] == new[0]:\n return False\n if r[1] == new[1]:\n return False\n if abs(r[0] - new[0]) == 2 and abs(r[1] - new[1]) == 1:\n return False\n if abs(r[0] - new[0]) == 1 and abs(r[1] - new[1]) == 2:\n return False\n if abs(k[0] - new[0]) == 2 and abs(k[1] - new[1]) == 1:\n return False\n if abs(k[0] - new[0]) == 1 and abs(k[1] - new[1]) == 2:\n return False\n return True\n\nrook = [ord(c) for c in input()]\nknight = [ord(c) for c in input()]\nok = 0\nfor i in range(ord('a'), ord('i')):\n for j in range(ord('1'), ord('9')):\n if is_valid(rook, knight, [i, j]):\n ok += 1\nprint(ok-1)\n", "x=input()\r\ny=input()\r\n\r\nX=[ord(x[0])-97,int(x[1])-1]\r\nY=[ord(y[0])-97,int(y[1])-1]\r\n\r\nB=[[1]*8 for i in range(8)]\r\n\r\nfor i in range(8):\r\n for j in range(8):\r\n if i==X[0] or j==X[1]:\r\n B[i][j]=0\r\n\r\n if abs(i-X[0])+abs(j-X[1])==3:\r\n B[i][j]=0\r\n\r\n if (abs(i-Y[0])+abs(j-Y[1])==3 and Y[0]!=i and Y[1]!=j) or abs(i-Y[0])+abs(j-Y[1])==0:\r\n B[i][j]=0\r\n\r\nANS=0\r\nfor i in range(8):\r\n ANS+=sum(B[i])\r\n\r\nprint(ANS)\r\n", "x=input()\r\ny=input()\r\na1=ord(x[0])-ord('a')+1\r\nb1=int(x[1])\r\na2=ord(y[0])-ord('a')+1\r\nb2=int(y[1])\r\nr=0\r\nfor i in range(1,9):\r\n for j in range(1,9):\r\n if not((i==a1 or j==b1) or (i==a2 and j==b2) or (abs((i-a1)*(j-b1))==2 or abs((i-a2)*(j-b2))==2)):\r\n r+=1\r\nprint(r)\r\n", "# ord(a) = 97\r\n# ord(h) = 104\r\nr = input()\r\nk = input()\r\nr = [ord(r[0]) - 96, int(r[1])]\r\nk = [ord(k[0]) - 96, int(k[1])]\r\n\r\ncounter = 64\r\nfor i in range(1, 9):\r\n for j in range(1, 9):\r\n k_beats_k = abs(k[0] - i) + abs(k[1] - j) == 3 and abs(k[0] - i) and abs(k[1] - j)\r\n k_beats_r = abs(r[0] - i) + abs(r[1] - j) == 3 and abs(r[0] - i) and abs(r[1] - j)\r\n if r[0] == i or r[1] == j or (k[0] == i and k[1] == j) or k_beats_k or k_beats_r:\r\n counter -= 1\r\n\r\nprint(counter)\r\n", "'''\r\n\n# 17.07.2021\r\n\n#\n\r\n# CF 38 B\n\r\n'''\r\n\r\n\n\nimport math\n\r\n\r\n\ndr = [-2, -2, -1, 1, 2, 2, 1, -1]\r\n\ndc = [-1, 1, 2, 2, 1, -1, -2, -2]\r\n\r\n\n\ns = input ()\r\n\nb1 = ord (s [0]) - ord ('a'); b2 = int (s [1]) - 1 # bishop\n\r\n\r\ns = input ()\n\r\nk1 = ord (s [0]) - ord ('a'); k2 = int (s [1]) - 1 # knight\n\r\n\r\nk = 0\r\n\nfor i in range (8) :\r\n\n\tfor j in range (8) :\r\n\n\t\tok = 1\n\r\n\t\tif i == b1 or j == b2 or i == k1 and j == k2 :\r\n\n\t\t\tcontinue\n\r\n\t\tfor m in range (8) :\r\n\n\t\t\tr = i + dr [m]; c = j + dc [m]\r\n\n\t\t\tif r == b1 and c == b2 or r == k1 and c == k2 :\r\n\n\t\t\t\tok = 0; break\n\r\n\r\n\t\tif ok : k += 1\n\r\n\r\n\nprint (k)\n", "def is_valid(r, c): return (0 <= r <= 7) and (0 <= c <= 7)\r\n \r\nrook = input()\r\nknight = input()\r\nr = 0\r\nknight_moves = ((0, 0), (-2, -1), (-2, 1), (-1, -2), (-1, 2), (1, -2), (1, 2), (2, -1), (2, 1))\r\ncols_dict = {'a': 0, 'b': 1, 'c': 2, 'd': 3, 'e': 4, 'f': 5, 'g': 6, 'h': 7}\r\nrook = (int(rook[1])-1, cols_dict[rook[0]])\r\nknight = (int(knight[1])-1, cols_dict[knight[0]])\r\nfor i in range(8):\r\n for j in range(8):\r\n curr_pos = (i, j)\r\n f = True\r\n for k in range(-8, 8):\r\n if (curr_pos[0]+k, curr_pos[1]) == rook: f = False; break\r\n if (curr_pos[0], curr_pos[1]+k) == rook: f = False; break\r\n if not f: continue\r\n for m in knight_moves:\r\n curr_possible_pos = (curr_pos[0]+m[0], curr_pos[1]+m[1])\r\n if curr_possible_pos == knight or curr_possible_pos == rook: f = False; break\r\n if f: r+= 1 \r\nprint(r)", "import sys\r\ninput = sys.stdin.readline\r\n\r\na = input()[:-1]\r\nb = input()[:-1]\r\n\r\nc = 0\r\nfor i in range(97, 105):\r\n for j in range(1, 9):\r\n if chr(i) == a[0] or j == int(a[1]) or (chr(i) == b[0] and j == int(b[1])) or (chr(i+2) == b[0] and j+1 == int(b[1])) or (chr(i-2) == b[0] and j+1 == int(b[1])) or (chr(i+2) == b[0] and j-1 == int(b[1])) or (chr(i-2) == b[0] and j-1 == int(b[1])) or (chr(i+1) == b[0] and j+2 == int(b[1])) or (chr(i-1) == b[0] and j+2 == int(b[1])) or (chr(i+1) == b[0] and j-2 == int(b[1])) or (chr(i-1) == b[0] and j-2 == int(b[1])):\r\n c += 1\r\n elif (chr(i+2) == a[0] and j+1 == int(a[1])) or (chr(i-2) == a[0] and j+1 == int(a[1])) or (chr(i+2) == a[0] and j-1 == int(a[1])) or (chr(i-2) == a[0] and j-1 == int(a[1])) or (chr(i+1) == a[0] and j+2 == int(a[1])) or (chr(i-1) == a[0] and j+2 == int(a[1])) or (chr(i+1) == a[0] and j-2 == int(a[1])) or (chr(i-1) == a[0] and j-2 == int(a[1])):\r\n c += 1\r\nprint(64-c)", "a=input()\r\nb=input()\r\nc='abcdefgh'\r\nd=c.find(a[0])+1\r\ne=int(a[1])\r\nf=c.find(b[0])+1\r\ng=int(b[1])\r\na=[[0 for i in range(8)] for i in range(8)]\r\na[d-1]=[1 for i in range(8)]\r\nfor i in range(8):\r\n a[i][e-1]=1\r\na[d-1][e-1]=1\r\na[f-1][g-1]=1\r\nif d>2:\r\n if d<7:\r\n if e>2:\r\n if e<7:\r\n a[d-1+2][e-1+1]=1\r\n a[d-1+2][e-1-1]=1\r\n a[d-1+1][e-1+2]=1\r\n a[d-1+1][e-1-2]=1\r\n a[d-1-1][e-1+2]=1\r\n a[d-1-1][e-1-2]=1\r\n a[d-1-2][e-1+1]=1\r\n a[d-1-2][e-1-1]=1\r\n elif e<8:\r\n a[d-1+2][e-1+1]=1\r\n a[d-1+2][e-1-1]=1\r\n a[d-1+1][e-1-2]=1\r\n a[d-1-1][e-1-2]=1\r\n a[d-1-2][e-1+1]=1\r\n a[d-1-2][e-1-1]=1\r\n else:\r\n a[d-1+2][e-1-1]=1\r\n a[d-1+1][e-1-2]=1\r\n a[d-1-1][e-1-2]=1\r\n a[d-1-2][e-1-1]=1\r\n elif e>1:\r\n a[d-1+2][e-1+1]=1\r\n a[d-1+2][e-1-1]=1\r\n a[d-1+1][e-1+2]=1\r\n a[d-1-1][e-1+2]=1\r\n a[d-1-2][e-1+1]=1\r\n a[d-1-2][e-1-1]=1\r\n else:\r\n a[d-1+2][e-1+1]=1\r\n a[d-1+1][e-1+2]=1\r\n a[d-1-1][e-1+2]=1\r\n a[d-1-2][e-1+1]=1\r\n elif d<8:\r\n if e>2:\r\n if e<7:\r\n a[d-1-2][e-1+1]=1\r\n a[d-1-2][e-1-1]=1\r\n a[d-1-1][e-1+2]=1\r\n a[d-1-1][e-1-2]=1\r\n a[d-1+1][e-1+2]=1\r\n a[d-1+1][e-1-2]=1\r\n elif e<8:\r\n a[d-1-2][e-1+1]=1\r\n a[d-1-2][e-1-1]=1\r\n a[d-1-1][e-1-2]=1\r\n a[d-1+1][e-1-2]=1\r\n else:\r\n a[d-1-2][e-1-1]=1\r\n a[d-1-1][e-1-2]=1\r\n a[d-1+1][e-1-2]=1\r\n elif e>1:\r\n a[d-1-2][e-1+1]=1\r\n a[d-1-2][e-1-1]=1\r\n a[d-1-1][e-1+2]=1\r\n a[d-1+1][e-1+2]=1\r\n else:\r\n a[d-1-2][e-1+1]=1\r\n a[d-1-1][e-1+2]=1\r\n a[d-1+1][e-1+2]=1\r\n else:\r\n if e>2:\r\n if e<7:\r\n a[d-1-2][e-1+1]=1\r\n a[d-1-2][e-1-1]=1\r\n a[d-1-1][e-1+2]=1\r\n a[d-1-1][e-1-2]=1\r\n elif e<8:\r\n a[d-1-2][e-1+1]=1\r\n a[d-1-2][e-1-1]=1\r\n a[d-1-1][e-1-2]=1\r\n else:\r\n a[d-1-2][e-1-1]=1\r\n a[d-1-1][e-1-2]=1\r\n elif e>1:\r\n a[d-1-2][e-1+1]=1\r\n a[d-1-2][e-1-1]=1\r\n a[d-1-1][e-1+2]=1\r\n else:\r\n a[d-1-2][e-1+1]=1\r\n a[d-1-1][e-1+2]=1\r\nelif d>1:\r\n if e>2:\r\n if e<7:\r\n a[d-1+2][e-1+1]=1\r\n a[d-1+2][e-1-1]=1\r\n a[d-1+1][e-1+2]=1\r\n a[d-1+1][e-1-2]=1\r\n a[d-1-1][e-1+2]=1\r\n a[d-1-1][e-1-2]=1\r\n elif e<8:\r\n a[d-1+2][e-1+1]=1\r\n a[d-1+2][e-1-1]=1\r\n a[d-1+1][e-1-2]=1\r\n a[d-1-1][e-1-2]=1\r\n else:\r\n a[d-1+2][e-1-1]=1\r\n a[d-1+1][e-1-2]=1\r\n a[d-1-1][e-1-2]=1\r\n elif e>1:\r\n a[d-1+2][e-1+1]=1\r\n a[d-1+2][e-1-1]=1\r\n a[d-1+1][e-1+2]=1\r\n a[d-1-1][e-1+2]=1\r\n else:\r\n a[d-1+2][e-1+1]=1\r\n a[d-1+1][e-1+2]=1\r\n a[d-1-1][e-1+2]=1\r\nelse:\r\n if e>2:\r\n if e<7:\r\n a[d-1+2][e-1+1]=1\r\n a[d-1+2][e-1-1]=1\r\n a[d-1+1][e-1+2]=1\r\n a[d-1+1][e-1-2]=1\r\n elif e<8:\r\n a[d-1+2][e-1+1]=1\r\n a[d-1+2][e-1-1]=1\r\n a[d-1+1][e-1-2]=1\r\n else:\r\n a[d-1+2][e-1-1]=1\r\n a[d-1+1][e-1-2]=1\r\n elif e>1:\r\n a[d-1+2][e-1+1]=1\r\n a[d-1+2][e-1-1]=1\r\n a[d-1+1][e-1+2]=1\r\n else:\r\n a[d-1+2][e-1+1]=1\r\n a[d-1+1][e-1+2]=1\r\nd=f\r\ne=g\r\nif d>2:\r\n if d<7:\r\n if e>2:\r\n if e<7:\r\n a[d-1+2][e-1+1]=1\r\n a[d-1+2][e-1-1]=1\r\n a[d-1+1][e-1+2]=1\r\n a[d-1+1][e-1-2]=1\r\n a[d-1-1][e-1+2]=1\r\n a[d-1-1][e-1-2]=1\r\n a[d-1-2][e-1+1]=1\r\n a[d-1-2][e-1-1]=1\r\n elif e<8:\r\n a[d-1+2][e-1+1]=1\r\n a[d-1+2][e-1-1]=1\r\n a[d-1+1][e-1-2]=1\r\n a[d-1-1][e-1-2]=1\r\n a[d-1-2][e-1+1]=1\r\n a[d-1-2][e-1-1]=1\r\n else:\r\n a[d-1+2][e-1-1]=1\r\n a[d-1+1][e-1-2]=1\r\n a[d-1-1][e-1-2]=1\r\n a[d-1-2][e-1-1]=1\r\n elif e>1:\r\n a[d-1+2][e-1+1]=1\r\n a[d-1+2][e-1-1]=1\r\n a[d-1+1][e-1+2]=1\r\n a[d-1-1][e-1+2]=1\r\n a[d-1-2][e-1+1]=1\r\n a[d-1-2][e-1-1]=1\r\n else:\r\n a[d-1+2][e-1+1]=1\r\n a[d-1+1][e-1+2]=1\r\n a[d-1-1][e-1+2]=1\r\n a[d-1-2][e-1+1]=1\r\n elif d<8:\r\n if e>2:\r\n if e<7:\r\n a[d-1-2][e-1+1]=1\r\n a[d-1-2][e-1-1]=1\r\n a[d-1-1][e-1+2]=1\r\n a[d-1-1][e-1-2]=1\r\n a[d-1+1][e-1+2]=1\r\n a[d-1+1][e-1-2]=1\r\n elif e<8:\r\n a[d-1-2][e-1+1]=1\r\n a[d-1-2][e-1-1]=1\r\n a[d-1-1][e-1-2]=1\r\n a[d-1+1][e-1-2]=1\r\n else:\r\n a[d-1-2][e-1-1]=1\r\n a[d-1-1][e-1-2]=1\r\n a[d-1+1][e-1-2]=1\r\n elif e>1:\r\n a[d-1-2][e-1+1]=1\r\n a[d-1-2][e-1-1]=1\r\n a[d-1-1][e-1+2]=1\r\n a[d-1+1][e-1+2]=1\r\n else:\r\n a[d-1-2][e-1+1]=1\r\n a[d-1-1][e-1+2]=1\r\n a[d-1+1][e-1+2]=1\r\n else:\r\n if e>2:\r\n if e<7:\r\n a[d-1-2][e-1+1]=1\r\n a[d-1-2][e-1-1]=1\r\n a[d-1-1][e-1+2]=1\r\n a[d-1-1][e-1-2]=1\r\n elif e<8:\r\n a[d-1-2][e-1+1]=1\r\n a[d-1-2][e-1-1]=1\r\n a[d-1-1][e-1-2]=1\r\n else:\r\n a[d-1-2][e-1-1]=1\r\n a[d-1-1][e-1-2]=1\r\n elif e>1:\r\n a[d-1-2][e-1+1]=1\r\n a[d-1-2][e-1-1]=1\r\n a[d-1-1][e-1+2]=1\r\n else:\r\n a[d-1-2][e-1+1]=1\r\n a[d-1-1][e-1+2]=1\r\nelif d>1:\r\n if e>2:\r\n if e<7:\r\n a[d-1+2][e-1+1]=1\r\n a[d-1+2][e-1-1]=1\r\n a[d-1+1][e-1+2]=1\r\n a[d-1+1][e-1-2]=1\r\n a[d-1-1][e-1+2]=1\r\n a[d-1-1][e-1-2]=1\r\n elif e<8:\r\n a[d-1+2][e-1+1]=1\r\n a[d-1+2][e-1-1]=1\r\n a[d-1+1][e-1-2]=1\r\n a[d-1-1][e-1-2]=1\r\n else:\r\n a[d-1+2][e-1-1]=1\r\n a[d-1+1][e-1-2]=1\r\n a[d-1-1][e-1-2]=1\r\n elif e>1:\r\n a[d-1+2][e-1+1]=1\r\n a[d-1+2][e-1-1]=1\r\n a[d-1+1][e-1+2]=1\r\n a[d-1-1][e-1+2]=1\r\n else:\r\n a[d-1+2][e-1+1]=1\r\n a[d-1+1][e-1+2]=1\r\n a[d-1-1][e-1+2]=1\r\nelse:\r\n if e>2:\r\n if e<7:\r\n a[d-1+2][e-1+1]=1\r\n a[d-1+2][e-1-1]=1\r\n a[d-1+1][e-1+2]=1\r\n a[d-1+1][e-1-2]=1\r\n elif e<8:\r\n a[d-1+2][e-1+1]=1\r\n a[d-1+2][e-1-1]=1\r\n a[d-1+1][e-1-2]=1\r\n else:\r\n a[d-1+2][e-1-1]=1\r\n a[d-1+1][e-1-2]=1\r\n elif e>1:\r\n a[d-1+2][e-1+1]=1\r\n a[d-1+2][e-1-1]=1\r\n a[d-1+1][e-1+2]=1\r\n else:\r\n a[d-1+2][e-1+1]=1\r\n a[d-1+1][e-1+2]=1\r\nh=64\r\nfor i in range(8):\r\n for j in range(8):\r\n h-=a[i][j]\r\nprint(h)", "turns = [(1, 2), (-1, 2), (1, -2), (-1, -2), (2, 1), (-2, 1), (2, -1), (-2, -1)]\r\nboard = [[True] * 8 for _ in range(8)]\r\nlad = input()\r\nxl, yl = ord(lad[0]) - ord('a'), int(lad[1]) - 1\r\nboard[xl][yl] = False\r\nfor i in range(8):\r\n board[xl][i] = False\r\n board[i][yl] = False\r\nkon = input()\r\nxk, yk = ord(kon[0]) - ord('a'), int(kon[1]) - 1\r\nboard[xk][yk] = False\r\nfor dx, dy in turns:\r\n if 0 <= xl + dx < 8 and 0 <= yl + dy < 8:\r\n board[xl + dx][yl + dy] = False\r\n if 0 <= xk + dx < 8 and 0 <= yk + dy < 8:\r\n board[xk + dx][yk + dy] = False\r\ns = 0\r\nfor row in board:\r\n s += sum(row)\r\nprint(s)", "n=9\r\nchs=[[0,0,0,0,0,0,0,0,0],\r\n [0,0,0,0,0,0,0,0,0],\r\n [0,0,0,0,0,0,0,0,0],\r\n [0,0,0,0,0,0,0,0,0],\r\n [0,0,0,0,0,0,0,0,0],\r\n [0,0,0,0,0,0,0,0,0],\r\n [0,0,0,0,0,0,0,0,0],\r\n [0,0,0,0,0,0,0,0,0],\r\n [0,0,0,0,0,0,0,0,0]]\r\na=input()\r\nb=input()\r\nlx=ord(a[0])-96\r\nly=int(a[1])\r\nhx=ord(b[0])-96\r\nhy=int(b[1])\r\nchs[hy][hx]=chs[ly][lx]=1\r\nfor i in range(1,n):\r\n for j in range(1,n):\r\n if (ly==i or lx==j)or((abs(i-ly)==1 and abs(j-lx)==2)or(abs(i-ly)==2 and abs(j-lx)==1)):\r\n chs[i][j]=1\r\n if (abs(hy-i)==1 and abs(hx-j)==2)or (abs(hy-i)==2 and abs(hx-j)==1):\r\n chs[i][j]=1\r\nans=0\r\nfor i in range(1,n):\r\n for j in range(1,n):\r\n if chs[i][j]==0:\r\n ans+=1\r\nprint(ans)\r\n", "def c_to_i(c,d='a'):\r\n return ord(c)-ord(d)\r\nr_pos = input()\r\nk_pos = input()\r\n\r\ncnt = 64\r\nboard = [[1 for i in range(8)]for j in range(8)]\r\n\r\nk_dx = [0,2,-2,2,-2,1,-1,1,-1]\r\nk_dy = [0,1,1,-1,-1,2,2,-2,-2]\r\n\r\nrow,col = c_to_i(r_pos[0]),c_to_i(r_pos[1],'1')\r\n\r\n# for rock\r\n\r\n## check attack from new knight\r\nfor i in range(len(k_dx)):\r\n if row+k_dy[i]>7 or row+k_dy[i]<0:\r\n continue\r\n if col+k_dx[i]>7 or col+k_dx[i]<0:\r\n continue\r\n if board[row+k_dy[i]][col+k_dx[i]]:\r\n board[row+k_dy[i]][col+k_dx[i]]=0\r\n cnt-=1\r\n## check attack rows & cols \r\nfor i in range(8):\r\n if board[row][i]:\r\n board[row][i]=0\r\n cnt-=1\r\n if board[i][col]:\r\n board[i][col]=0\r\n cnt-=1\r\n \r\n# for knights\r\nrow,col = c_to_i(k_pos[0]),c_to_i(k_pos[1],'1')\r\nfor i in range(len(k_dx)):\r\n if row+k_dy[i]>7 or row+k_dy[i]<0:\r\n continue\r\n if col+k_dx[i]>7 or col+k_dx[i]<0:\r\n continue\r\n if board[row+k_dy[i]][col+k_dx[i]]:\r\n board[row+k_dy[i]][col+k_dx[i]]=0\r\n cnt-=1\r\n\r\nprint(cnt)\r\n", "dict1={\"a\":1,\"b\":2,\"c\":3,\"d\":4,\"e\":5,\"f\":6,\"g\":7,\"h\":8}\r\nr=input()\r\nk=input()\r\nr=[dict1[r[0]],int(r[1])]\r\nk=[dict1[k[0]],int(k[1])]\r\nc=64\r\nx,y=k\r\nkk=[[x,y],[x-2,y+1],[x-2,y-1],[x-1,y+2],[x+1,y+2],[x+2,y+1],[x+2,y-1],[x+1,y-2],[x-1,y-2]]\r\nx,y=r\r\nrr=[[x,y],[x-2,y+1],[x-2,y-1],[x-1,y+2],[x+1,y+2],[x+2,y+1],[x+2,y-1],[x+1,y-2],[x-1,y-2]]\r\nkk+=rr\r\nfor i in range(1,9):\r\n for t in range(1,9):\r\n if i==r[0] or t==r[1] or [i,t] in kk:\r\n c-=1\r\nprint(c)\r\n", "rock=input()\r\nknight=input()\r\n\r\nbusyDots=set()\r\nbusyDots.add(knight)\r\n\r\nrockColumn=rock[0]\r\nrockRow=int(rock[1])\r\n\r\nfor code in range(ord('a'), ord('i')):\r\n busyDots.add(str(chr(code))+str(rockRow))\r\n\r\n\r\nfor i in range(1,9):\r\n busyDots.add(str(rockColumn)+str(i))\r\n\r\nknightColumn=knight[0]\r\nknightRow=int(knight[1])\r\n\r\n#up up left\r\nif(knightRow+2<=8 and chr(ord(knightColumn)-1)>='a'):\r\n busyDots.add(str(chr(ord(knightColumn)-1))+str((knightRow+2)))\r\n#up left left\r\nif(knightRow+1<=8 and chr(ord(knightColumn)-2)>='a'):\r\n\tbusyDots.add(\r\n\t\t\tstr(chr(ord(knightColumn)-2)) + str((knightRow+1))\r\n\t\t\t\t\t)\r\n#up up right\r\nif(knightRow+2<=8 and chr(ord(knightColumn)+1)<='h'):\r\n\tbusyDots.add(\r\n\t\t\tstr(chr(ord(knightColumn)+1)) + str((knightRow+2))\r\n\t\t\t\t\t)\r\n#up right right\r\nif(knightRow+1<=8 and chr(ord(knightColumn)+2)<='h'):\r\n\tbusyDots.add(\r\n\t\t str(chr(ord(knightColumn)+2)) + str((knightRow+1))\r\n\t\t\t\t\t)\r\n#down down left\r\nif(knightRow-2>=1 and chr(ord(knightColumn)-1)>='a'):\r\n\tbusyDots.add(\r\n\t\t\tstr(chr(ord(knightColumn)-1)) + str((knightRow-2))\r\n\t\t\t\t\t)\r\n#down left left\r\nif(knightRow-1>=1 and chr(ord(knightColumn)-2)>='a'):\r\n\tbusyDots.add(\r\n\t\t\tstr(chr(ord(knightColumn)-2)) + str((knightRow-1))\r\n\t\t\t\t\t)\r\n#down down right\r\nif(knightRow-2>=1 and chr(ord(knightColumn)+1)<='h'):\r\n\tbusyDots.add(\r\n\t\t\tstr(chr(ord(knightColumn)+1)) + str((knightRow-2))\r\n\t\t\t\t\t)\r\n#down right right\r\nif(knightRow-1>=1 and chr(ord(knightColumn)+2)<='h'):\r\n\tbusyDots.add(\r\n\t\t\tstr(chr(ord(knightColumn)+2)) + str((knightRow-1))\r\n\t\t\t\t\t)\r\n#rock research\r\n#up up left\r\nif(rockRow+2<=8 and chr(ord(rockColumn)-1)>='a'):\r\n busyDots.add (str(chr(ord(rockColumn)-1))+str((rockRow+2)))\r\n#up left left\r\nif(rockRow+1<=8 and chr(ord(rockColumn)-2)>='a'):\r\n\tbusyDots.add(\r\n\t\t\tstr(chr(ord(rockColumn)-2)) + str((rockRow+1))\r\n\t\t\t\t\t)\r\n#up up right\r\nif(rockRow+2<=8 and chr(ord(rockColumn)+1)<='h'):\r\n\tbusyDots.add(\r\n\t\t\tstr(chr(ord(rockColumn)+1)) + str((rockRow+2))\r\n\t\t\t\t\t)\r\n#up right right\r\nif(rockRow+1<=8 and chr(ord(rockColumn)+2)<='h'):\r\n\tbusyDots.add(\r\n\t\t str(chr(ord(rockColumn)+2)) + str((rockRow+1))\r\n\t\t\t\t\t)\r\n#down down left\r\nif(rockRow-2>=1 and chr(ord(rockColumn)-1)>='a'):\r\n\tbusyDots.add(\r\n\t\t\tstr(chr(ord(rockColumn)-1)) + str((rockRow-2))\r\n\t\t\t\t\t)\r\n#down left left\r\nif(rockRow-1>=1 and chr(ord(rockColumn)-2)>='a'):\r\n\tbusyDots.add(\r\n\t\t\tstr(chr(ord(rockColumn)-2)) + str((rockRow-1))\r\n\t\t\t\t\t)\r\n#down down right\r\nif(rockRow-2>=1 and chr(ord(rockColumn)+1)<='h'):\r\n\tbusyDots.add(\r\n\t\t\tstr(chr(ord(rockColumn)+1)) + str((rockRow-2))\r\n\t\t\t\t\t)\r\n#down right right\r\nif(rockRow-1>=1 and chr(ord(rockColumn)+2)<='h'):\r\n\tbusyDots.add(\r\n\t\t\tstr(chr(ord(rockColumn)+2)) + str((rockRow-1))\r\n\t\t\t\t\t)\r\nprint(64-len(busyDots))", "import string\r\n\r\n\r\ndef solve(x1, y1, x2, y2):\r\n c = [[0, 0, 0, 0, 0, 0, 0, 0],\r\n [0, 0, 0, 0, 0, 0, 0, 0],\r\n [0, 0, 0, 0, 0, 0, 0, 0],\r\n [0, 0, 0, 0, 0, 0, 0, 0],\r\n [0, 0, 0, 0, 0, 0, 0, 0],\r\n [0, 0, 0, 0, 0, 0, 0, 0],\r\n [0, 0, 0, 0, 0, 0, 0, 0],\r\n [0, 0, 0, 0, 0, 0, 0, 0]]\r\n X = [2, 1, -1, -2, -2, -1, 1, 2]\r\n Y = [1, 2, 2, 1, -1, -2, -2, -1]\r\n for i in range(8):\r\n for j in range(8):\r\n if i != x1 and j != y1:\r\n f = True\r\n for k in range(8):\r\n if i == x2 + X[k] and j == y2 + Y[k]:\r\n f = False\r\n for k in range(8):\r\n if i == x1 + X[k] and j == y1 + Y[k]:\r\n f = False\r\n if f:\r\n c[i][j] = 1\r\n c[x2][y2] = 0\r\n # for i in range(8):\r\n # print(c[i])\r\n r = 0\r\n for i in range(8):\r\n for j in c[i]:\r\n if j == 1:\r\n r = r + 1\r\n return r\r\n\r\n\r\nfor _ in range(1):\r\n a = input()\r\n b = input()\r\n y1 = a[0]\r\n x1 = int(a[1]) - 1\r\n y1 = int(string.ascii_lowercase.index(y1))\r\n y2 = b[0]\r\n x2 = int(b[1]) - 1\r\n y2 = int(string.ascii_lowercase.index(y2))\r\n # print(x1, y1, x2, y2)\r\n print(solve(x1, y1, x2, y2))\r\n", "import poplib\r\nimport string\r\nimport math\r\n\r\n\r\ndef is_ok(x, y):\r\n if 0 <= x <= 7 and 0 <= y <= 7:\r\n return True\r\n return False\r\n\r\n\r\ndef main_function():\r\n rook_position = list(input())\r\n knight_position = list(input())\r\n rook_position[0] = ord(rook_position[0]) - 97\r\n rook_position[1] = int(rook_position[1]) - 1\r\n knight_position[0] = ord(knight_position[0]) - 97\r\n knight_position[1] = int(knight_position[1]) - 1\r\n chess = [[True for j in range(8)] for i in range(8)]\r\n vectors = [[1, 2], [-1, -2], [-1, 2], [1, -2], [2, 1], [-2, -1], [-2, 1], [2, -1]]\r\n #print(rook_position)\r\n for i in range(8):\r\n chess[rook_position[0]][i] = False\r\n chess[i][rook_position[1]] = False\r\n chess[knight_position[0]][knight_position[1]] = False\r\n for vector in vectors:\r\n k_x = knight_position[0] + vector[0]\r\n k_y = knight_position[1] + vector[1]\r\n r_x = rook_position[0] + vector[0]\r\n r_y = rook_position[1] + vector[1]\r\n if is_ok(k_x, k_y) and k_x != r_x and k_y != r_y:\r\n chess[k_x][k_y] = False\r\n if is_ok(r_x, r_y):\r\n chess[r_x][r_y] = False\r\n counter = 0\r\n for i in chess:\r\n #print(i)\r\n counter += sum(i)\r\n print(counter)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\nif __name__ == '__main__':\r\n main_function()", "def isFree(rook, knight, dot):\r\n if dot[1] == rook[1] or dot[0] == rook[0] or dot == knight:\r\n return False\r\n\r\n helper = chr(ord(dot[0]) + 2) + str(int(dot[1]) - 1)\r\n if helper == knight or helper == rook:\r\n return False\r\n\r\n helper = chr(ord(dot[0]) + 1) + str(int(dot[1]) - 2)\r\n if helper == knight or helper == rook:\r\n return False\r\n\r\n helper = chr(ord(dot[0]) - 1) + str(int(dot[1]) - 2)\r\n if helper == knight or helper == rook:\r\n return False\r\n\r\n helper = chr(ord(dot[0]) - 2) + str(int(dot[1]) - 1)\r\n if helper == knight or helper == rook:\r\n return False\r\n\r\n helper = chr(ord(dot[0]) - 2) + str(int(dot[1]) + 1)\r\n if helper == knight or helper == rook:\r\n return False\r\n\r\n helper = chr(ord(dot[0]) - 1) + str(int(dot[1]) + 2)\r\n if helper == knight or helper == rook:\r\n return False\r\n\r\n helper = chr(ord(dot[0]) + 1) + str(int(dot[1]) + 2)\r\n if helper == knight or helper == rook:\r\n return False\r\n\r\n helper = chr(ord(dot[0]) + 2) + str(int(dot[1]) + 1)\r\n if helper == knight or helper == rook:\r\n return False\r\n\r\n return True\r\n\r\n\r\nrook, knight = input(), input()\r\nans = 0\r\n\r\nfor col in range(ord('a'), ord('i')):\r\n for row in range(1, 9):\r\n dot = chr(col) + str(row)\r\n if isFree(rook, knight, dot):\r\n ans += 1\r\n\r\nprint(ans)", "q=input()\r\nw=input()\r\ns={q,w}\r\nl=set()\r\nfor i in\"abcdefgh\":\r\n for j in \"12345678\":\r\n l.add(i+j)\r\n s.add(q[0]+j)\r\n s.add(i+q[1])\r\nfor i in [-2,-1,1,2]:\r\n for j in [-2,-1,1,2]:\r\n if abs(i)!=abs(j):\r\n z=chr(ord(q[0])+i)+str(int(q[1])+j)\r\n if z in l:\r\n s.add(z)\r\nfor i in [-2,-1,1,2]:\r\n for j in [-2,-1,1,2]:\r\n if abs(i)!=abs(j):\r\n z=chr(ord(w[0])+i)+str(int(w[1])+j)\r\n if z in l:\r\n s.add(z)\r\nprint(64-len(s))", "rook = input()\r\nknight = input()\r\nrook = (ord(rook[0]) - ord('a'), int(rook[1])-1)\r\nknight = (ord(knight[0]) - ord('a'), int(knight[1])-1)\r\n\r\ncount = 63\r\nfor i in range(8):\r\n for j in range(8):\r\n if i == rook[0] or j == rook[1]:\r\n count -= 1\r\n else:\r\n dr = sorted([abs(i - rook[0]), abs(j - rook[1])])\r\n dk = sorted([abs(i - knight[0]), abs(j - knight[1])])\r\n if dr == [1, 2] or dk == [1, 2]:\r\n count -= 1\r\nprint(count)\r\n" ]

[ "n = int(input())\r\n\r\ns = n * (n + 1) // 2\r\nfor x in input().split():\r\n s -= int(x)\r\n\r\nprint(s)", "n = int(input())\nL = set(map(int, input().split())) # Use a set for O(1) membership check\nmissing = set(range(1, n+1)) - L # Calculate the missing elements\nprint(min(missing)) # Print the smallest missing element\n\n\t\t \t \t \t \t \t \t \t \t\t\t \t \t\t", "n=int(input())\r\na=sorted(list(map(int,input().split())))\r\nk=sum(a)\r\nl=0\r\nfor i in range(n+1):\r\n l+=i\r\nprint(l-k)", "n = int(input())\r\narr = list(map(int, input().split()))\r\n\r\nans = n *(n+1)//2 - sum(arr)\r\n\r\nprint(ans)\r\n\r\n", "n=int(input())\r\ns=list(map(int,input().split()))\r\np=n*(n+1)//2\r\nq=sum(s)\r\na=p-q\r\nprint(a)", "n = int(input())\r\nl = list(map(int, input().split()))\r\ntemp = [i for i in range(1, n+1)]\r\nprint(sum(temp) - sum(l))", "n = int(input())\r\narr = [0] * n\r\nseries = map(int, input().split())\r\nfor s in series:\r\n arr[s-1] = 1\r\nprint(arr.index(0)+1)\r\n\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\nx=[0 for i in range(n)]\r\nfor i in l:\r\n x[i-1]+=1\r\nprint(x.index(0)+1)\r\n ", "n = int(input())\r\ns = set(map(int,input().split()))\r\nfor i in range(1,n + 1):\r\n if not i in s:\r\n print(i)\r\n break", "N = int(input())\r\nSet = set(map(int,input().split()))\r\nSet1 = set(range(1,N+1))\r\nprint(*Set1.difference(Set))\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\nb = [0 for _ in range(n)]\r\nfor i in range(n-1):\r\n b[a[i]-1] = 1\r\nfor i in range(n):\r\n if b[i] == 0:\r\n print(i+1)\r\n break", "n=int(input())\r\nl=list(map(int,input().split()))\r\ns=n*(n+1)//2\r\nprint(s-sum(l))\r\n", "# LUOGU_RID: 101569075\nn, *a = map(int, open(0).read().split())\r\ns = set(a)\r\nfor i in range(1, n + 1):\r\n if not i in s:\r\n exit(print(i))", "'''input\n5\n1 5 3 2\n'''\nn = int(input())\na = sorted(map(int, input().split())) + [0]\nfor x in range(1, n+1):\n\tif x - a[x-1] != 0:\n\t\tprint(x)\n\t\tbreak\n", "n=int(input())\r\narr=list(map(int,input().split()))\r\nprint(int((n*(n+1))/2)-sum(arr))", "i=input;n=int(i())\r\nprint((n*n+n)//2-sum(map(int,i().split())))", "n=int(input())\r\na=sum(map(int,input().split()))\r\nprint(n*(n+1)//2-a)\r\n", "def solve():\r\n n = int(input())\r\n arr = str(input())\r\n arr = sum(list(map(int,arr.split()[:n-1])))\r\n for i in range(1,n+1):\r\n arr -= i\r\n\r\n print(abs(arr))\r\n\r\nif __name__=='__main__':\r\n solve()", "a=int(input())\r\nn=[int(x) for x in input().split()]\r\na=a*(a+1)//2\r\nprint(a-sum(n))", "n=int(input())\r\nl=list(map(int,input().split()))\r\nt=(n*(n+1)//2)\r\nprint(t-sum(l))", "n = int(input())\r\nl = list(map(int,input().split()))\r\nl.sort()\r\ncount=0\r\nfor i in range(len(l)):\r\n\tif(l[i]!=i+1):\r\n\t\tprint(i+1)\r\n\t\tcount+=1\r\n\t\tbreak\r\nif(count==0):\r\n\tprint(n)", "#!/usr/bin/env python3\n\ntotal_episodes = int(input())\nwatched_episodes = list(map(int, input().split()))\ntotal_sum = total_episodes * (total_episodes + 1) // 2\nwatched_sum = sum(watched_episodes)\nprint(total_sum - watched_sum)\n", "n = int(input())\r\nnum = list(map(int, input().split()))\r\n\r\ntot1 = 0\r\ntot2 = 0\r\n\r\nfor i in range(n):\r\n tot1 += (i+1)\r\n\r\nfor i in range(n-1):\r\n tot2 += num[i]\r\nmiss = tot1 - tot2\r\nprint(miss)\r\n", "import sys\r\n\r\ndef main():\r\n n, *l = map(int, sys.stdin.read().strip().split())\r\n return n*(1 + n)//2 - sum(l)\r\n \r\nprint(main())\r\n", "n = int(input())\r\nwatched = set(map(int, input().split()))\r\ntotal_sum = n * (n + 1) // 2\r\nwatched_sum = sum(watched)\r\nprint(total_sum - watched_sum)\r\n", "n = int(input())\nepisodes = list(map(int, input().split()))\n\nepisodes.sort()\nres = None\nfor idx, num in enumerate(episodes, 1):\n if idx != num:\n res = idx\n break\nif res is not None:\n print(res)\nelse:\n print(n)\n ", "n=int(input())\r\nfor i,x in enumerate(input().split()):\r\n n^=(i+1)^int(x)\r\nprint(n)", "t=int(input())\r\nlst1=[]\r\nlst2=[]\r\nfor i in range(1,t+1):\r\n lst1.append(i)\r\nlst2=map(int, input().split())\r\nprint()\r\nprint(sum(lst1)- sum(lst2))", "n = int(input())\r\na = [int(i) for i in input().split()]\r\nk=0\r\nfor i in range(1,n+1):\r\n k=k^i\r\nfor i in range(n-1):\r\n k=k^a[i]\r\nprint(k)", "n = int(input())\r\nser = {x for x in range(1, n+1)}\r\nserw = {int(x) for x in input().split()}\r\nprint(list(ser - serw)[0])\r\n", "import functools\n\nn = int(input())\nnumbers = map(int, input().split(\" \"))\nsum = functools.reduce(lambda a, b: a+b, numbers)\nprint((n * (n + 1)) // 2 - sum)\n \t\t \t \t \t\t \t \t\t\t\t \t \t \t\t \t", "n=int(input())\r\nn1=list(map(int,input().split()))\r\nn1.sort()\r\ns=0\r\nk=0\r\nfor i in n1:\r\n s=s+1\r\n if(s!=i):\r\n print(s)\r\n k=k+1\r\n break\r\nif(k==0):\r\n print(s+1)\r\n", "n=int(input())\r\nprint(((n*(n+1))//2)-sum(list(map(int,input().split()))))", "k = int(input())\na = list(map(int,input().split()))\nb = []\nfor i in range(1,k+1):\n b.append(i)\n \ns1 = sum(b)\ns = sum(a)\nprint(s1-s)\n\t \t \t \t \t\t \t\t\t \t\t\t \t\t \t\t \t\t", "#!/bin/env python3\nn = int(input())\na = [int(i) for i in input().split(\" \")]\nprint(n * (n + 1) // 2 - sum(a))", "n = int(input())\r\nepisodes = [int(x) for x in input().split()]\r\nepi = [0]*(n)\r\nfor i in range(n-1):\r\n epi[episodes[i]-1] = 1\r\nprint(epi.index(0)+1)\r\n", "n, a = int(input()), (int(i) for i in input().split())\nres = (1 + n) * n // 2 - sum(a)\nprint(res)\n", "n = int(input())\r\nt = list(map(int, input().split()))\r\ne = (n * (n + 1)) // 2\r\nalan = sum(t)\r\nbecker = e - alan\r\nprint(becker)", "n = int(input())\ntsum = n * (n + 1) // 2\narr = map(int, input().split(\" \"))\nsarr = sum(arr);\nprint(tsum - sarr)\n\n \t \t\t\t\t \t \t\t \t \t \t", "n = int(input())\r\nl = set([int(x) for x in input().split()])\r\ng = []\r\nfor i in range(1, n+1):\r\n g.append(i)\r\n\r\ng = set(g)\r\nprint(*(set.difference(g,l)))", "n = int(input())\r\na = list(map(int,input().split()))\r\n# print(a)\r\nres = 0\r\nfor i in range(1,n):\r\n # print(i)\r\n res=res^(a[i-1]^i)\r\nres^=n\r\nprint(res)\r\n", "i,z=input,int\r\nn=z(i())\r\nprint((n*n+n)//2-sum(map(z,i().split())))\r\n", "n = int(input())\r\nl = list(map(int,input().split()))\r\n\r\nc = n*(n+1)/2\r\nl1 = sum(l)\r\nprint(int(c-l1))\r\n\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\no=(n*(n+1))//2\r\ns=sum(l)\r\nprint(o-s)\r\n \r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\na.sort()\r\nd={}\r\nfor i in range(1,n+1):\r\n d[i]=0\r\nfor i in a:\r\n d[i]=1\r\nfor i in range(1,n+1):\r\n if d[i]==0:\r\n print(i,end=\" \")", "n=int(input())\r\nl=list(map(int,input().split()))\r\nprint(int(n*(n+1)/2-sum(l)))", "n=int(input())\r\na=[int(i) for i in input().split()]\r\nt=0\r\nfor i in range(n-1):\r\n\tt+=a[i]\r\nprint(n*(n+1)//2-t)", "n = int(input())\r\ntotal = sum(list(map(int, input().split())))\r\narr = sum(list(range(1, n + 1)))\r\nprint(arr - total)", "n = int(input())\r\na = set(map(int, input().split()))\r\nprint(list(set(range(1, n+1))-a)[0])\r\n", "print(next(iter(set(range(1, int(input()) + 1)) - set(map(int, str.split(input()))))))\n", "n=int(input())\na=list(map(int,input().split()))\na.sort()\nf=0\nfor i in range(n-1):\n if a[i]!=i+1:\n f=1\n print(i+1)\n break\nif f==0:\n print(n)\n\t\t \t \t\t\t \t\t \t \t \t\t\t \t \t \t", "n=int(input(''))\r\nl=list(map(int,input().split()))\r\ns=sum(l)\r\nt=n*(n+1)\r\nr=int(t/2)\r\nprint(r-s)", "i,z=input,int;n=z(i());print((n*n+n)//2-sum(map(z,i().split())))\r\n", "n=int(input())\r\na=list(map(int,input().split(\" \")))\r\nsumm=(n*(n+1))//2\r\nsumm1=sum(a)\r\nprint(summ-summ1)", "n = int(input())\r\nepisodes = set(int(x) for x in input().split())\r\nfor i in range(1, n+1):\r\n if i not in episodes:\r\n print(i)\r\n break", " ####\r\n ####\r\n ####\r\n ####\r\n\r\n #### #### ####\r\n #### #### #### \r\n #### #### ####\r\n #### #### #### \r\n \r\n #### #### #### \r\n \r\n #### #### #### \r\n \r\n #### #### #### \r\n ####################################### \r\n #######################################\r\n\r\n\r\n\r\n\r\n \r\n ####################///# #///# #///# #///#\r\n ####################///# #///# #///# #///#\r\n #### #///# #///# #///# #///#\r\n #### #///# #///# #///# #///#\r\n #### #///# #///# #///# #///#\r\n #### #///# #///# #///# #///#\r\n #### #///# #///# #///# #///#\r\n #### #///# #///# #///# #///#\r\n #### #///# #///# #///# #///#\r\n #### #///# #///# #///# #///#\r\n #### #///# #///# #///# #///#\r\n #### #///# #///# #///# #///#\r\n #### #///# #///# #///# #///#\r\n ####################///# #///# #///# #///#\r\n ####################///# #///# #///# #///#\r\n #///# #///# #///# #///#\r\n #///# #///# #///# #///#\r\n #///# #///# #///# #///#\r\n #///# #///# #///# #///#\r\n #///# #///# #///# #///# \r\n #///# #///# #///# #///#\r\n #///# #///# #///# #///#\r\n #///# #///# #///# #///#\r\n #///# #///# #///# #///#\r\n #///# #///# #///# #///#\r\n #///# #///# #///# #///#\r\n ####################################################################### #///#\r\n ####################################################################### #///#\r\n \r\n\r\n \r\n \r\n\r\n#####################################\r\n#####################################\r\n#####################################\r\n#####################################\r\nn = int(input())\r\na = list(map(int,input().split()))\r\na.sort()\r\ncount = 0\r\nfor k in range(n+1):\r\n count += k\r\nprint(count-sum(a))\r\n \r\n#####################################\r\n#####################################\r\n#####################################\r\n#####################################\r\n#####################################\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\nl1=[]\r\nfor i in range(1,n+1):\r\n l1.append(i)\r\nk=set(l1)-set(l) \r\nfor i in k:\r\n print(i)", "n=int(input())\r\nwatched=list(map(int, input().split()))\r\ntotal=sum(list(range(1,n+1)))\r\n\r\nfor i in watched:\r\n\ttotal-=i\r\nprint(total)", "n = int(input()); print(int((1+n)/2*n-sum(list(map(int,input().split())))))", "X = int(input())\r\nprint((X * (X + 1)) // 2 - sum(list(map(int, input().split()))))\r\n\r\n# UB_CodeForces\r\n# Advice: Love everyone in the world\r\n# Location: Where I belong to\r\n# Caption: Still with runny nose\r\n", "n = int(input())\na = list(map(int,input().split()))\ns = sum(a)\nsm = n*(n+1)//2\nprint(sm-s)\n\t \t\t \t\t \t \t \t\t \t \t", "n = int(input())\r\na = set(input().split())\r\nb = set()\r\nfor i in range(1, n + 1):\r\n b.add(str(i))\r\nfor i in b.difference(a):\r\n print(i)", "import sys\nfrom collections import defaultdict\nfrom heapq import nlargest\nInput=lambda:map(int,input().split())\nn = int(input())\na = list(Input())\nres = [-1]*n\nfor i in range(n-1):\n res[a[i]-1] = 1\nfor i in range(n):\n if res[i] == -1:\n print(i+1)\n", "n = int(input())\r\na = set(map(int, input().split()))\r\nb = set(range(1,n+1))\r\nprint(*(b-a))", "n = int(input())\r\nseries = set(map(int, input().split()))\r\n\r\nprint(*(set(range(1, n+1)) - series))", "x=int(input())\r\nl=list(map(int,input().split()))\r\np=[i for i in range(1,x+1)]\r\nl=l+p\r\nc=l[0]\r\nfor i in range(1,len(l)):\r\n c=c^l[i]\r\nprint(c)\r\n", "import sys\r\n\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\ndata = set(map(int, input().split()))\r\nprint(*(set(range(1, n + 1)) - data))", "n = int(input())\r\ns = set([int(i) for i in input().split()])\r\nt = set(range(1, n+1))\r\na = list(t-s)\r\nprint(a[0])", "n=int(input())\r\nprint(n*(n+1)//2-sum(map(int,input().split())))", "n=int(input())\r\nl=[int(i) for i in input().split()]\r\nans=0\r\nfor i,x in zip(range(1,n),l):\r\n ans^=x^i\r\nprint(ans^n)", "n=int(input());s=sum(list(map(int,input().split())));k=0\r\nfor i in range(1,n+1):k=k+i\r\nprint(k-s)", "def main():\n n = int(input())\n episodes = [0] + [int(_) for _ in input().split()]\n episodes.sort()\n\n try:\n index = next(i for i in range(n) if i != episodes[i])\n except StopIteration:\n index = n\n\n print(index)\n\n\nif __name__ == '__main__':\n main()\n", "total_episodes = int(input())\r\nepisodes = [int(x) for x in input().split()]\r\n\r\nforgotten_episode = list(set([i for i in range(1, total_episodes + 1)]) - set(episodes))\r\n\r\nprint(forgotten_episode[0])\r\n", "n = int(input())\r\ns = set(range(1, n+1))\r\ninp = set(map(int, input().split()))\r\n\r\nprint(*s-inp)\r\n\r\n\"\"\"\r\n//////////////////////////////////////////\r\n// //\r\n// Implemented by brownfox2k6 //\r\n// //\r\n//////////////////////////////////////////\r\n\"\"\"", "x = int(input())\r\narr = [int(i) for i in input().split()]\r\nf = 0\r\nfor i in range(1, x+1):\r\n f += i\r\nprint(f-sum(arr))", "n = int(input())\r\narr = sum(map(int, input().split()))\r\nprint((n*(n+1)//2)-arr)", "n = int(input())\r\narr = list(map(int, input().split()))\r\n\r\ns = sum(arr)\r\nprogress = (1+n)*n//2\r\n\r\nprint(progress - s)\r\n", "a=int(input())\r\nb=sum(map(int, input().split()))\r\nc=1\r\nd=0\r\nfor i in range(a):\r\n\td=d+c\r\n\tc=c+1\r\nprint(d-b)\r\n\t\r\n", "n = int(input())\r\n\r\nx = set(map(int, input().split(\" \")))\r\n\r\nfor i in range(1,n+1):\r\n if i not in x:\r\n print(i)", "n = int(input())\r\narr= list(map(int, input().split(\" \")))\r\nd = {}\r\nfor i in range(1, n+1):\r\n\td[i] = True\r\nfor i in arr:\r\n\tdel d[i]\r\nfor i in d:\r\n\tprint(i)\t\r\n", "n = int(input())\r\nai = list(map(int,input().split()))\r\nprint(n * (n+1) // 2 - sum(ai))\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\nll=[i for i in range(1,n+1)]\r\nprint(sum(ll)-sum(l))", "n = int(input())\r\ne = list(map(int,input().split()))\r\n\r\nprint(int(n*(n+1)/2)-sum(e))", "n=int(input())\r\na=[int(x) for x in input().split()]\r\nprint((n*(n+1)//2)-sum(a))\r\n", "n = int(input())\r\na = [int(x) for x in input().split()]\r\n\r\ns = sum(a)\r\n\r\nt = (n * (n + 1)) >> 1\r\n\r\nprint(t - s)", "n=int(input())\r\na=input().split()\r\ns=n*(n+1)//2\r\nfor i in range(n-1):\r\n\ts-=int(a[i])\r\nprint(s)\r\n", "print((set(range(1, int(input()) + 1)) - set(map(int, input().split()))).pop())\r\n", "n=int(input())\r\nc=set(map(int,input().split()))\r\nfor x in range(1,n+1):\r\n\tif x not in c: print(x)", "n=int(input())\r\ns=0\r\nfor i in range(n+1):\r\n s=s+i\r\nl=list(map(int,input().split()))\r\nprint(s-sum(l))", "n=int(input(\"\"))\r\ne=list(map(int,input().split(\" \")))\r\ne.sort()\r\nni=range(1,n+1);ni=list(ni)\r\ndef Diff(li1, li2):\r\n return list(set(li1) - set(li2)) + list(set(li2) - set(li1))\r\nc=Diff(ni,e)\r\nprint(c[0])", "n = int(input())\nx = set(map(int,input().split()))\nprint(*[i for i in range(1,n+1) if i not in x])\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 = set(map(int, wtf[1].split()))\r\n Z = set(list(x for x in range(1,n+1)))\r\n print(Z.difference(A).pop())\r\n", "n=int(input())\r\nli=list(map(int,input().split()))\r\nsu=n*(n+1)//2\r\nprint(su-sum(li))\r\n", "n=int(input())\r\n\r\nl=list(map(int,input().split()))\r\nl=set(l)\r\nl1=[i for i in range(1,n+1)]\r\nl1=set(l1)\r\nl1=l1-l\r\nl1=list(l1)\r\n\r\nl1 = [str(i) for i in l1]\r\n\r\nprint(\" \".join(l1))", "\r\nn = int(input())\r\nset_ = set(map(int, input().split()))\r\n\r\nfor i in range(1, n + 1):\r\n\tif i not in set_:\r\n\t\tprint(i)\r\n\t\texit()", "n = int(input())\r\nsum = n * (n + 1) // 2\r\nfor x in map(int, input().split()):\r\n\tsum -= x\r\n\r\nprint(sum)\r\n", "#██████████ █ █ /█\\ █ █ ███ /█\\ ██████████████\r\n\"█ █ █ /███\\ █ █ █ ██ /███\\ /██/ \"\r\n#█ █ █ /█████\\ █ █ █ ██ /█████\\ /██/ \r\n\"█ █ █ █!:) █ █ █ █ ██ █ █ /██/ \"\r\n#██████████ █████████ █(:| █ ████████ ████ █ █ /██/ \"\r\n\" █ █ █ █!:) █ █ █ █ ██ █ █ /██/ \"\r\n# █ █ █ ███████ █ █ █ ██ ███████ /██/\r\n\" █ █ █ █ █ █ █ █ ██ █ █ ██/ \"\r\n#██████████ █ █ █ █ █ █ ███ █ █ ██████████████\r\na=int(input())\r\nlst=sum(sorted(list(map(int,input().split()))))\r\nt=(a**2+a)/2\r\nprint(round(t-lst))\r\n", "n=int(input())\r\nseries=list(map(int,input().split()))\r\nsmotrel=[False]*100000\r\nfor i in series:\r\n smotrel[i-1]=True\r\nfor i in range(n):\r\n if not smotrel[i]:\r\n break\r\nprint(i+1)\r\n", "n=int(input())\r\nl=[int(i) for i in input().split()]\r\nans=0\r\nfor i in range(1,n):\r\n ans^=l[i-1]^i\r\nprint(ans^n)", "n = int(input())\r\nv = list(map(int, input().split()))\r\n\r\nv.sort()\r\nfor i in range(n - 1):\r\n if v[i] != i + 1:\r\n print(i + 1)\r\n break\r\nelse:\r\n print(n)\r\n", "n = int(input())\nepisodes = list(map(int, input().split()))\n\ntotalEpisodes = n*(n+1)/2\nwatchedEpisodes = sum(episodes)\n\nforgottenEpisode = int(totalEpisodes - watchedEpisodes)\n\nprint(forgottenEpisode)\n \t\t\t\t \t \t \t\t \t \t\t", "n = int(input())\ntowatch = set([i for i in range(1, n + 1)])\nwatched = [int(i) for i in input().split()]\nfor i in watched:\n towatch.remove(i)\nprint(towatch.pop())", "n=int(input())\r\na=list(map(int,input().split()))\r\nprint(((n*(n+1))//2)-sum(a))\r\n", "print(*set(range(1,int(input()) + 1)) - set(map(int, input().split())))", "from collections import Counter\n\n\nn = int(input())\nc = Counter([int(i) for i in input().split()])\n\nfor i in range(1, n + 1):\n if c[i] == 0:\n print(i)\n", "n=int(input())\r\nx=list(map(int,input().split()))\r\n\r\nres = [False for i in range(n)]\r\nfor i in range(len(x)):\r\n res[x[i]-1]=True\r\nfor i in range(n):\r\n if res[i]==False:\r\n print(i+1)\r\n break\r\n", "ep=int(input(\"\"))\narr=[]\narr2=[]\nsum1=0\nif(ep>=2):\n \n x=str(input(\"\"))\n arr=x.split()\n for j in range(0,ep-1):\n z=arr[j]\n arr2.append(int(z))\n for i in range(0,ep-1):\n sum1=sum1+arr2[i]\n org=(ep*(ep+1))/2\n print(int(org-sum1))\n\n \t\t\t \t \t\t\t\t \t \t \t\t \t\t\t\t \t", "n = int(input())\r\nprint(((n * (n + 1)) // 2) - sum(list(map(int, input().split()))))\r\n", "n = int(input())\r\narr = set(map(int, input().split()))\r\nfor i in range(1, n+1):\r\n if not i in arr:\r\n print(i)\r\n break\r\n", "n = int(input())\r\narray = map(int, input().split())\r\nprint(((n * (n + 1)) // 2) - sum(array))\r\n", "n = int(input())\r\nl = list(map(int, input().split()))\r\nris = 0\r\nfor e in l:\r\n ris += e\r\nprint(int((n*(n+1)/2)-ris))", "n=int(input())\r\n\r\nL=list(map(int,input().split()))\r\nTaken=[False]*n\r\nfor item in L:\r\n Taken[item-1]=True\r\nfor i in range(n):\r\n if(not Taken[i]):\r\n print(i+1)\r\n break\r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\ntemp=[0]*(n+1)\r\nfor i in range(n-1):\r\n temp[a[i]]+=1\r\nfor i in range(1,n+1):\r\n if temp[i]==0:\r\n print(i)\r\n break\r\n ", "n=int(input())\r\na=sorted(list(map(int,input().split())))\r\nif a[-1]!=n:\r\n\tprint(n)\r\nelse:\r\n\tfor i in range(len(a)):\r\n\t\tif a[i]!=i+1:\r\n\t\t\tprint(i+1)\r\n\t\t\tbreak", "n=int(input())\r\ns=list(map(int,input().split()))\r\nl=list(range(1,n+1))\r\nl=set(l)\r\ns=set(s)\r\nr=l.difference(s)\r\nr=list(r)\r\nprint(r[0])", "def f():\r\n n=int(input())\r\n a=list(map(int,input().split()))\r\n sums=sum(a)\r\n print(int(n*(n+1)/2 - sums))\r\nf()", "num = int(input())\r\nepisodes = str.split(input())\r\nepisodes = [eval(i) for i in episodes]\r\nfullepisodes = list(range(1, num + 1))\r\nans = str(set(fullepisodes).difference(episodes))\r\nans = ans.replace(\"{\", \"\")\r\nans = ans.replace(\"}\", \"\")\r\nprint(ans)", "n = int(input())\r\nepis = set(map(int, input().split()))\r\n\r\nseries = set( int(i) for i in range(1, n+1) )\r\nmissed_epis = series.difference(epis)\r\n\r\nout = ''.join(str(i) for i in missed_epis)\r\nprint(out)\r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\nflg=0\r\na.sort()\r\nfor i in range(n-1):\r\n if a[i]!=i+1:\r\n print(i+1)\r\n flg=1\r\n break\r\nif flg==0:\r\n print(n)", "n = int(input()) \r\nwatched = {int(i) for i in input().split()}\r\nseries = set(range(1, n+1))\r\nprint(*(series - watched))", "n=int(input())\r\nf=0\r\nd=((n)*(n+1))//2\r\nsum=0\r\na=[int(i) for i in input().split()]\r\nfor i in range(0,len(a)):\r\n sum=sum+a[i]\r\nf=d-sum\r\nprint(f)", "n = int(input())\nprint(*set((range(1, n + 1))) - set(map(int, input().split())))\n", "n = int(input())\r\ny = list(map(int,input().split()))\r\nz = list(range(1,n+1))\r\nk = sum(y)\r\nprint(sum(z)-k)", "n = int(input())\r\na = list(map(int,input().split()))\r\na.sort()\r\nm = len(a)\r\nflag = 1\r\nfor i in range(1,m+1):\r\n\tif i!=a[i-1]:\r\n\t\tprint(i)\r\n\t\tflag = 0\r\n\t\tbreak\r\nif flag==1:\r\n\tprint(n)", "n=int(input())\r\na=list(map(int,input().split()))\r\ns=n*(n+1)//2\r\nsa=sum(a)\r\nprint(s-sa)", "def main():\r\n epi=int(input(\"\"))\r\n total_epi=(epi*(epi+1))/2\r\n watch_epi=input().split()\r\n for i in range(len(watch_epi)):\r\n watch_epi[i]=int(watch_epi[i])\r\n total_watch_epi=sum(watch_epi)\r\n res=int(total_epi-total_watch_epi)\r\n print(res)\r\nmain()", "n=int(input())\r\narr=map(int,input().split())\r\n\r\nsum1=n*(n+1)//2\r\n\r\nsum2=sum(arr)\r\nprint(sum1-sum2)", "\"\"\"\r\nCodeforces Testing Round 10 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(s)\r\n s = str(s)\r\n print(s, end=\"\")\r\n\r\n################################################### SOLUTION\r\nn, = read()\r\na = read()\r\nwrite(n*(n+1)//2 - sum(a))", "garbage = int(input())\r\nz = list(map(int, input().rstrip().split(' ')))\r\nres = [0]*(garbage + 1)\r\nres[0] = 1\r\nfor i in z:\r\n res[i] = 1\r\nprint(res.index(0))", "n=int(input())\r\n\r\nx=list(map(int,input().split()))\r\n\r\nx=sorted(x)\r\n\r\nxx=[]\r\nfor i in range(1,n+1):\r\n\txx.append(i)\r\n\t\r\nprint(sum(xx) - sum(x))", "n=int(input())\r\nl=[int(i) for i in input().split()]\r\nsum=(n*(n+1))//2\r\nfor x in l:\r\n sum-=x\r\nprint(sum)", "'''\r\n╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬\r\n╬╬ ▓▓ ▓▓ ╬╬\r\n╬╬ ▓▓ ▓▓ ╬╬\r\n╬╬ ▓▓█████▓▓ ╬╬\r\n╬╬ ▓▓ ▓▓ ╬╬\r\n╬╬ ▓▓ ▓▓ ╬╬\r\n╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬\r\n###########################\r\n\r\n// •︿• \\\\\r\n/\\\\ //\\\r\n /\\\\ //\\\r\n /\\\\//\\\r\n\r\n###########################\r\n'''\r\nimport sys\r\nimport math as mth\r\nfrom math import ceil as cl\r\nfrom math import log2 as l2\r\nfrom math import factorial as fct\r\nfrom collections import Counter as CNT\r\nfrom math import log\r\nfrom math import floor as fl\r\nmod = 10**9 + 7\r\nmonths = ['January', 'February', 'March', 'April', 'May', 'June', 'July', 'August', 'September', 'October', 'November', 'December']\r\nalp = ['a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i', 'j', 'k', 'l', 'm', 'n', 'o', 'p', 'q', 'r', 's', 't', 'u', 'v', 'w', 'x', 'y', 'z']\r\ndef ii():\r\n return int(input())\r\ndef fi():\r\n return float(input())\r\ndef lii():\r\n return list(map(int, input().split()))\r\ndef ss():\r\n return input()\r\ndef lss():\r\n return input().split()\r\ndef yes():\r\n print(\"YES\")\r\ndef no():\r\n print(\"NO\")\r\n############################################\r\ninput = lambda : sys.stdin.readline().strip()\r\n'''\r\n╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬\r\n'''\r\nn = ii()\r\narr = sorted(lii())\r\nprint(((n*(n+1))//2)-sum(arr))", "n=int(input())\r\nA=list(map(int,input().split()))\r\nA.sort()\r\nA.append(0)\r\nB=[]\r\nfor i in range(1,n+1):\r\n B.append(i)\r\nfor j in range(n):\r\n if A[j]!=B[j]:\r\n print(B[j])\r\n break", "n=int(input())\r\nl=list(map(int,input().split()))\r\ns=sum(l)\r\nk=(n*(n+1))//2\r\nprint(k-s)", "n=int(input())\r\nl=[int(i) for i in input().split()]\r\nt=sum(l[0:])\r\nk=(n*(n+1))//2 \r\nprint(k-t)", "n = int(input())\r\na = sorted(list(map(int, input().split())))\r\na.append(0)\r\nserial = [i for i in range(1, n+1)]\r\nfor i in range(n):\r\n if a[i] != serial[i]:\r\n print(serial[i])\r\n exit()\r\n\r\n", "#Ashish Sagar\r\nn=int(input())\r\nl=list(map(int,input().split()))\r\nl.sort()\r\naa=[]\r\nfor i in range(n):\r\n aa.append(i+1)\r\nflag=0 \r\nfor i in range(n):\r\n if i<len(l) and aa[i]!=l[i]:\r\n print(aa[i])\r\n flag=1 \r\n break\r\nif flag==0:\r\n print(n)", "n = int(input())\r\na = list(map(int,input().split()))\r\nprint((n*(n+1)//2)-sum(a))", "n=int(input())\r\nprint(int((n*(n+1)/2)-sum(map(int,input().split()))))", "n = int(input())\r\nw = [0] + sorted(map(int, input().split())) + [n+1]\r\nfor i in range(n):\r\n if w[i+1]-w[i] != 1:\r\n print(w[i]+1)\r\n break", "n=int(input())\r\na=list(map(int,input().split(\" \")))\r\na.sort()\r\np=[i for i in range(1,n+1)]\r\ns=set(p)-set(a)\r\nprint(list(s)[0])", "n=int(input())\r\nl=list(map(int,input().split()))\r\ns=set(l)\r\nl2=[]\r\nfor i in range(1,n+1):\r\n\tl2.append(i)\r\ns2=set(l2)\r\nprint(*s2-s)", "n = int(input())\r\na = sorted([int(i) for i in input().split()])\r\nk = n\r\nfor i in range(n-1):\r\n if a[i] != i+1:\r\n k = i+1\r\n break\r\nprint(k)\r\n", "n = int(input())\r\nnums = [int(j) for j in input().split()]\r\nref = n * [0]\r\nfor j in range(n - 1):\r\n ref[nums[j] - 1] = 1\r\nfor j in range(n):\r\n if ref[j] == 0:\r\n print(j + 1)\r\n break\r\n", "n=int(input())\np=input().split()\nres=dict()\nfor idx, ele in enumerate(p):\n res[ele] = idx\nfor i in range(1,n+1):\n if str(i) not in res:\n print(i)\n", "n=int(input())\r\na=list(map(int,input().split()))\r\na.sort()\r\nb=0\r\nfor i in range(n-1):\r\n if(i+1!=a[i]):\r\n print(i+1)\r\n b=1\r\n break\r\nif(b==0):\r\n print(n)", "n=int(input())\r\ns=list(map(int,input().split()))\r\nt=list(set(range(1,n+1)).symmetric_difference(set(s)))[0]\r\nprint(t)", "n = int(input())\r\nsum_arr = sum([int(c) for c in input().split()])\r\nprint(n * (n + 1)//2 - sum_arr)\r\n", "n = int(input())\na = list(map(int, input().split()))\n\nx = [0] * (n+1)\nfor i in a:\n x[i] = 1\n\nfor i in range(1,n+1):\n if x[i] == 0:\n print(i)\n break", "n = int(input())\r\ne = list(map(int, input().split(\" \")))\r\ns = n*((n+1)/2)\r\ntotal = sum(e)\r\nprint(int(s-total))", "n=int(input())\r\nepisodes=list(map(int,input().split()))[:n]\r\nepisodes.sort()\r\nepisodes.append(0)\r\nfor i in range(1,n+1):\r\n if i!=episodes[i-1]:\r\n print(i)\r\n break\r\n", "n = int(input())\r\narray = list(map(int, input().split()))\r\ns = sum(array)\r\ns1 = n * (n+1) // 2\r\nprint(s1 - s)", "n=int(input())\r\nser={ i for i in range(1,1+n)}\r\nsmotr=set(map(int, input().split()))\r\nfor i in ser:\r\n if i not in smotr:\r\n print(i)\r\n break\r\n", "season = int(input())\r\n\r\nepisodes = input().split()\r\nepisodes = list(map(int, episodes))\r\nepisodes.sort()\r\n\r\nsm = sum(range(season+1))\r\n\r\nfor i in episodes:\r\n sm = sm - i\r\n\r\nprint(sm)\r\n", "f,n,l=0,int(input()),sorted(map(int,input().split()))\r\nfor x in range(n-1):\r\n\tif l[x]!=(x+1):print(x+1);f=1;break\r\nif f==0:print(n)", "n = int(input())\nx = list(map(int, input().split()))\na = n * [0]\nfor i in range(n):\n a[i] = i + 1\nprint(*set(a) ^ set(x))\n", "n = int(input())\r\na = []\r\nfor i in range(n+1):\r\n\ta.append(0)\r\nb= [int(i) for i in input().split()]\r\nfor i in range(n-1):\r\n\ta[b[i]]=1\r\nfor i in range(1,n+1):\r\n\tif a[i]==0:\r\n\t\tprint(i)\r\n\t\tbreak", "# n = input()\n# s = list(map(int, input().split()))\n# s.sort()\n# for i, x in enumerate(s):\n# if i + 1 != x:\n# print(i + 1)\n# exit()\n# print(n)\n\nn = int(input())\nall_1_n = set(range(1, n + 1))\nhis_1_n = set(map(int, input().split()))\ndiff = list(all_1_n - his_1_n)\nprint(diff[0])\n", "n=int(input())\r\nlst1=[int(i) for i in input().split()]\r\nlst2=[int(i) for i in range(1,n+1)]\r\nlst1.sort()\r\n#print(lst2,lst1)\r\nfor i in range(0,n):\r\n if i<(n-1) and lst2[i]!=lst1[i]:\r\n print(lst2[i])\r\n break\r\n elif i==(n-1):\r\n print(lst2[i])\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\nprint(n*(n+1)//2-sum(l))", "a=int(input())\r\na=a*(a+1)/2\r\nb=input().split()\r\nfor i in b:\r\n a=a-int(i)\r\nprint(int(a))", "from sys import exit\r\nepcount = int(input())\r\nepwatched = input().split()\r\n\r\nfor i in range(epcount-1):\r\n epwatched[i] = int(epwatched[i])\r\n\r\nepwatched = sorted(epwatched)\r\n\r\nfor i in range(epcount-1):\r\n if epwatched[i] != i+1:\r\n print(i+1)\r\n exit(0)\r\n\r\nprint(epcount)\r\n", "a = int(input())\r\nn = list(map(int, input().split()))\r\nn.sort()\r\nlod = [0] * (a + 1)\r\nlod[0] = 1\r\nfor i in range(len(n)):\r\n lod[n[i]] += 1\r\nfor i in range(len(lod)):\r\n if lod[i] == 0:\r\n print(i)\r\n\r\n\r\n", "n=int(input())\r\n\r\n\r\nt=sum(list(map(int,input().split())))\r\n\r\n\r\nprint(n*(n+1)//2-t)\r\n", "n=int(input())\r\nprint((n*n+n)//2-sum(list(map(int,input().split()))))\r\n", "n = int(input())\r\nl = sum(list(map(int , input().split())))\r\nprint(int((n * (n + 1 ) / 2 ) - l ))", "'''\nn = int(input())\n\neps = list(map(int, input().split()))\neps.sort()\n\nfor i in range(1, n + 1):\n if i not in eps:\n print(i)\n quit()\n\n'''\n\nn = int(input())\n\ntotal = (n * (n + 1)) / 2\n\neps = list(map(int, input().split()))\n\nactual = sum(eps)\n\nprint(int(abs(total - actual)))", "n=int(input())\r\narray1=list(map(int ,input().split()))\r\narray1.sort()\r\nsample1=range(1,n+1)\r\nz=list(sample1)\r\n\r\nset1=set(array1)\r\nset2=set(z)\r\n\r\nfinal=set2-set1\r\nprint(*final)\r\n\r\n", "n=int(input())\r\na=[int(i) for i in input().split()]\r\na.sort()\r\nl=[]\r\nfor j in range(n-1):\r\n l.append(a[j]-j)\r\ncnt=0\r\nj=0\r\nwhile cnt==0 and j<n-1:\r\n if l[j]!=1:\r\n cnt+=1\r\n j+=1\r\nif cnt==1:\r\n print(j)\r\nelse :\r\n print(j+1)", "n=int(input())\r\nd=n*(n+1)//2\r\na=list(map(int,input().split()))\r\ns=0\r\nfor i in range(0,n-1):\r\n s+=a[i]\r\nprint(int(d-s))", "n = int(input())\r\narr = list(map(int, input().split()[:n]))\r\n\r\nsuma = sum(arr)\r\nsuma2 = sum([x for x in range(n+1)])\r\nprint(suma2-suma)", "def missing(n, lst):\r\n return sum(range(1, n + 1)) - sum(lst)\r\n\r\n\r\nN = int(input())\r\na = [int(i) for i in input().split()]\r\nprint(missing(N, a))\r\n", "import itertools\r\n\r\nimport time\r\ndef timer(f):\r\n def tmp(*args, **kwargs):\r\n t = time.time()\r\n res = f(*args, **kwargs)\r\n print(\"Время выполнения функции: %f\" % (time.time()-t))\r\n return res\r\n\r\n return tmp\r\n\r\nn = int(input())\r\narray = list(map(int, input().split(' ')))\r\n\r\nseries = [0 for i in range(n+1)]\r\nfor i in range(0, len(array)):\r\n series[array[i]]+=1\r\n\r\nfor i in range(1, len(series)):\r\n if series[i]==0:\r\n print(i)\r\n exit(0)\r\n\r\n", "reg=int(input())\r\nlist=[]\r\nre=input().split()\r\nfor i in range(0,reg-1):\r\n list.append(int(re[i]))\r\nlis=sorted(list)\r\nif lis[0]==2:\r\n print(1)\r\nelif lis[len(lis)-1]==reg-1:\r\n print(reg)\r\nelse:\r\n for j in range(0,len(lis)-1):\r\n if lis[j+1]-lis[j]==2:\r\n print ((lis[j+1]+lis[j])//2)\r\n break\r\n\r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\nans=n*(n+1)//2\r\nfor elem in a:\r\n ans-=elem\r\nprint(ans)", "epi=int(input())\r\nwatched=input().split()\r\ne1=['0']*epi\r\nfor i in watched:\r\n j=int(i)\r\n e1[j-1]=i\r\nv=0\r\nwhile v<len(e1):\r\n if '0'==e1[v]:\r\n print(v+1)\r\n v+=1\r\n\r\n\r\n", "n = int(input())\r\nlistik = [0 for i in range(n)]\r\na = list(map(int,input().split()))\r\nfor i in a:\r\n listik[i-1]=1\r\nfor i in range(n):\r\n if listik[i]==0:\r\n print(i+1)\r\n break\r\n", "count = int(input())\r\narr = list(map(int, input().split()))\r\n\r\nx = [False for i in range(0, count + 1)]\r\nfor i in arr:\r\n x[i] = True\r\n\r\nfor i in range(1, count + 1):\r\n if x[i] == False:\r\n print(i)\r\n break\r\n", "n=int(input())\r\na=[int(i) for i in input().split()]\r\np=n*[0]\r\nfor i in range(n-1):\r\n p[a[i]-1]=1\r\nprint(p.index(0)+1)\r\n", "n = int(input())\r\narr = [int(x) for x in input(). split()]\r\nans = ((n*(n+1)) // 2) - sum(arr)\r\nprint(ans) \r\n", "number_of_episodes_in_a_season = int(input())\nwatched_episodes = list(map(int, input().split(' ')))\n\nhavent_watched = sum(list(range(1, number_of_episodes_in_a_season + 1))) - sum(watched_episodes)\nprint(havent_watched)", "n=int(input())\r\np=input()\r\nl=list(map(int,p.split()))\r\nsum=0\r\nfor i in l :\r\n sum = sum + i\r\nprint(int(n*(n+1)/2-sum))\r\n", "n = int(input())\r\nesp = list(map(int, input().split()))\r\nsum = 0\r\nsuM = 0\r\nfor i in esp:\r\n sum += i\r\nfor i in range(1, n + 1):\r\n suM += i\r\nprint(suM - sum)", "\r\n\r\nn = int(input())\r\nb = [int(b) for b in input().split()]\r\nl = []\r\nfor i in range(1 , n + 1):\r\n l.append(i)\r\n \r\nprint(*(set(l) ^ set(b)))", "n=int(input())\r\nl=list(map(int,input().split()))\r\na=(n*(n+1))//2\r\nb=a-sum(l)\r\nprint(b)", "n = int(input())\r\nll = list(map(int, input().split()))\r\nsum1 = sum(ll)\r\nprint((n*(n+1)//2)-sum1)\r\n\r\n", "P = int(input())\r\nX = [0] * P\r\n\r\nS = list(map(int, input().split()))\r\nfor s in S:\r\n X[s - 1] = 1\r\n\r\nprint(X.index(0) + 1)", "n=int(input())\r\np=input().split()\r\nl=[]\r\ni=0\r\nwhile i<n-1:\r\n l.append(int(p[i]))\r\n i=i+1\r\nl.sort()\r\ni=0\r\nwhile i<n-1:\r\n if (i+1)!=l[i]:\r\n break\r\n i=i+1\r\nprint(i+1)\r\n", "n = int(input())\r\nwatched = [False]*n\r\nfor i in map(int, input().split()):\r\n watched[i-1] = True\r\n\r\nfor i in range(n):\r\n if not watched[i]:\r\n print(i+1)\r\n break", "n = int(input())\nB = set(map(int,input().split()))\nA = set()\nfor i in range(1, n + 1):\n A.add(i)\n\nprint(list(A - B)[0])\n", "n=int(input())\r\nx = list(map(int, input().split(\" \")))\r\nprint(((n*n+n)//2)-sum(x))", "\r\nn = int(input())\r\nset_ = set(map(int, input().split()))\r\n''' approach - 1 == just check which number is not present\r\nfor i in range(1, n + 1):\r\n\tif i not in set_:\r\n\t\tprint(i)\r\n\t\texit()\r\n\r\n'''\r\n#approach - 2\r\n#take the sum of all numbers and subtract it from the sum of first n natural numbres\r\n\r\nprint((n * (n + 1)) // 2 - sum(set_))", "n = int(input())\r\ns = sum([int(i) for i in input().split()])\r\nprint(n * (n + 1) // 2 - s)", "def solution(n,b):\r\n i=1\r\n b.sort()\r\n #print(b)\r\n while i<n:\r\n #print(i,b[i-1])\r\n if (i)!=b[i-1]:\r\n return i\r\n i+=1\r\n return n\r\ndef answer():\r\n n = int(input())\r\n b = [int(x) for x in input().split()]\r\n print(solution(n,b))\r\nanswer()", "#!/usr/bin/env python\n# coding=utf-8\n'''\nAuthor: Deean\nDate: 2021-11-04 22:49:51\nLastEditTime: 2021-11-04 22:59:46\nDescription: \nFilePath: CF440A.py\n'''\n\n\ndef func():\n n = int(input())\n # *循环遍历TLE，通过等差数列求和\n total = sum(map(int, input().strip().split()))\n return n * (n + 1) // 2 - total\n\n\nif __name__ == '__main__':\n ans = func()\n print(ans)\n", "missed = [i + 1 for i in range(int(input()))]\r\nfor i in map(int, input().split()):\r\n missed[i - 1] = 0\r\n\r\nprint(sum(missed))\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\n\r\na.sort()\r\nk = 1\r\nfor i in range(n - 1):\r\n if a[i] > k:\r\n print(k)\r\n break\r\n k += 1\r\n\r\nif k == n:\r\n print(n)\r\n", "n=int(input())\r\nl=set(map(int,input().split()))\r\nk=set(range(1,n+1))\r\nk1=k-l\r\nprint(*k1)\r\n \r\n\r\n\r\n \r\n \r\n \r\n \r\n", "a=int(input())\r\nb=sorted(list(map(int, input().split())))\r\nc=list(range(1,a+1))\r\nb=set(b)\r\nc=set(c)\r\nf=c.difference(b)\r\nf=list(f)\r\nprint(f[0])\r\n", "import sys\r\ninput=sys.stdin.buffer.readline\r\n\r\nn=int(input())\r\narr=list(map(int,input().split()))\r\narr.sort()\r\nz=0\r\nfor i in range(0,n-1):\r\n\tif arr[i]==i+1:\r\n\t\tcontinue\r\n\telse:\r\n\t\tprint(i+1)\r\n\t\tz=1\r\n\t\tbreak\r\nif z==0:\r\n\tprint(n)", "n=int(input())\r\na=list(map(int,input().split()))\r\ns=0\r\nwhile(n>0):\r\n s=s+n\r\n n=n-1\r\nprint(s-sum(a))\r\n", "n =int(input())\r\nl = [int(x) for x in input().split()]\r\nprint(n*(n+1)//2-sum(l))", "n = int(input())\r\na = [int(i) for i in input().split()]\r\nn = (n * (n + 1)) // 2\r\nfor i in a:\r\n n -= i\r\nprint(n)", "n = int(input())\r\na= list(map(int, input().split()))\r\n\r\nb = set(range(1,n+1)).difference(a)\r\n\r\nprint(*b)", "n=int(input())\r\na=list(map(int,input().split()))\r\nb=[]\r\nfor i in range(1,n+1):\r\n\tb.append(0)\r\nfor i in a:\r\n\tb[i-1]=1\r\nprint(b.index(0)+1)", "n=int(input()) \r\narr=[int(x) for x in input().split()]\r\nsum1=(n*(n+1)//2)\r\nsum2=0\r\nfor i in arr: \r\n sum2=sum2+i\r\nprint(sum1-sum2)", "n = int(input())\na = [int(x) for x in input().split()]\nused = [0] * n\nfor x in a:\n\tused[x - 1] = 1\nprint(used.index(0) + 1)\n", "n = int(input())\r\nprint((n*(n+1))//2-sum(sorted(list(map(int, input().split())))))", "n = int(input())\r\nwatched = set(map(int, input().split()))\r\nfor i in range(1, n+1):\r\n if i not in watched:\r\n print(i)\r\n break\r\n", "n = int(input())\r\nlst = list(map(int, input().split()))\r\ns = {x+1 for x in range(n)}\r\nres = list(s.difference(lst))[0]\r\nprint(res)", "N = int(input())\r\nX = sorted(list(map(int, input().split())))\r\nif X[0] != 1 or X[-1] != N:\r\n print(1 if X[0] != 1 else N)\r\n exit()\r\nfor i in range(1, N):\r\n if X[i] - X[i - 1] != 1:\r\n print(X[i] - 1)\r\n exit()\r\n\r\n# UB_CodeForces\r\n# Advice: Love everyone in the world\r\n# Location: Where I belong to\r\n# Caption: Still with runny nose", "n = int(input())\r\nl = set(map(int, input().split()))\r\nx = set(range(1, n + 1))\r\nprint(list(x - l)[0])", "n=int(input())\r\na=list(map(int,input().split()))\r\na.append(1000000)\r\na.sort()\r\nprint([i+1 for i,x in enumerate(a) if(x!=i+1)][0])", "print(((2 * int(input()) + 1) ** 2 - 1) // 8 - sum(map(int, input().split())))\r\n", "n = int(input())\r\ns = set(int(i) for i in input().split())\r\nss = set(int(i) for i in range(1,n+1))\r\nk = list(ss.difference(s))\r\nprint(k[0])", "a=int(input())\r\nl=list(map(int,input().split()))\r\nprint((1+a)*a//2-sum(l))\r\n", "n = int(input())\r\n\r\nprint(n*(n+1)//2 - sum(map(int, input().split())))", "# LUOGU_RID: 113907580\na = int(input())\na = a * (a + 1) / 2\nb = input().split()\nfor i in b:\n a = a - int(i)\nprint(int(a))", "number = int(input(\"\"))\r\nmyDict = {}\r\narr = input(\"\").split(\" \")\r\nfor x in arr:\r\n t = int(x)\r\n myDict[t] = 1;\r\n\r\ncur = 1;\r\nlastNum = True;\r\nfor x in sorted(myDict):\r\n if x != cur:\r\n print(cur);\r\n lastNum = False;\r\n break;\r\n cur += 1\r\n\r\nif lastNum:\r\n print(number);", "n = int(input())\r\nlst = [*map(int, input().split())]\r\nars = int((1 + n) / 2 * n)\r\nprint(ars - sum(lst))\r\n", "n = int(input())\r\nL = set(map(int, input().split())) \r\nmissing = set(range(1, n+1)) - L \r\nprint(min(missing)) \r\n\r\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\ns = n * (n + 1) // 2\r\nfor i in range(n-1):\r\n\ts -= a[i]\r\nprint(s)", "a = int(input())\r\nl = set(map(int, input().split()))\r\ns = {i for i in range(1,a+1)}\r\nprint(*(s-l))", "# https://codeforces.com/problemset/problem/440/A\r\n\r\nn = int(input())\r\n\r\ns = sum(map(int, input().split()))\r\n\r\nprint((n * (n + 1)) // 2 - s)\r\n", "n=int(input())\r\na=[int(x) for x in input().split()]\r\nprint(n*(n+1)//2-sum(a))", "n=int(input()) \r\nx=[int(x) for x in input().split()]\r\nprint(int((n*(n+1))/2-sum(x)))\r\n " ]

[ "import sys\r\nfrom array import array # noqa: F401\r\nfrom math import log, e\r\n\r\n\r\ndef input():\r\n return sys.stdin.buffer.readline().decode('utf-8')\r\n\r\n\r\nn, m, k = map(int, input().split())\r\n\r\nif m <= k:\r\n print(1)\r\n exit()\r\nif n + k < m:\r\n print(0)\r\n exit()\r\n\r\nprob1 = 0.0\r\nfor i in range(m + n, m, -1):\r\n prob1 += log(i)\r\nfor i in range(2, n + 1):\r\n prob1 -= log(i)\r\n\r\nprob2 = 0.0\r\nfor i in range(m + n, m - k - 1, -1):\r\n prob2 += log(i)\r\nfor i in range(2, n + k + 2):\r\n prob2 -= log(i)\r\n\r\nprint(1 - pow(e, prob2 - prob1))\r\n", "\r\nn, m, k = map(int, input().split())\r\nres = 1\r\nif n+k-m < 0:\r\n print(0)\r\nelse:\r\n for i in range(k+1):\r\n res *= 1.0*(m-k+i)/(n+1+i)\r\n res = 1 - res;\r\n print(\"{:.12f}\".format(res))\r\n\r\n\r\n", "num,p,w=map(int,input().split())\r\nif w<p<=w+num:\r\n\tn=1\r\n\tfor i in range(w+1):\r\n\t\tn*=(p-i)/(num+w-(i-1))\r\n\tprint(1-n)\r\nelse:\r\n\tprint(0 if p>num+w else 1)\r\n", "# LUOGU_RID: 123030743\nn,m,k=map(int,input().split())\r\nif m<=k:\r\n print(1)\r\nelif n+k<m:\r\n print(0)\r\nelse:\r\n ans=1\r\n for i in range(0,k+1):\r\n ans*=(m-k+i)/(n+i+1)\r\n\r\n print(max(1-ans,0))\r\n", "n,m,k=map(int,input().split())\r\nif k<m<=k+n:\r\n\tt=1\r\n\tfor i in range(k+1):\r\n\t\tt*=(m-i)/(n+k-(i-1))\r\n\tprint(1-t)\r\nelse:\r\n\tprint(0 if m>n+k else 1)", "# METO Bot 0.9.9\nn,m,k=map(int,input().split())\nif k<m<=k+n:\n\tt=1\n\tfor i in range(k+1):\n\t\tt*=(m-i)/(n+k-(i-1))\n\tprint(1-t)\nelse:\n\tprint(0 if m>n+k else 1)\n\n\t\t\t \t\t\t \t \t\t\t\t \t \t\t \t\t\t", "import sys; R = sys.stdin.readline\r\nS = lambda: map(int,R().split())\r\n\r\nn,m,k = S()\r\np = 1\r\nfor i in range(1,k+2): p *= (m-i+1)/(n+i)\r\nprint(1-min(p,1))", "n,m,k=input().split()\nn,m,k=int(n),int(m),int(k)\nres=1\nif m<=k:\n print(1)\nelse:\n for i in range(k+1):\n res*=(m-k+i)/(n+i+1)\n print(max(1-res,0.0000))", "'''\r\nCalculate the probability of m / (n + k) for each m and n \r\nPrint the 1 - the probability\r\n'''\r\nnum10NotePeople, num20NotePeople, num10Notes = input().split()\r\nnum10NotePeople, num20NotePeople, num10Notes = int(num10NotePeople), int(num20NotePeople), int(num10Notes)\r\n\r\nif num10Notes >= num20NotePeople:\r\n\tprint(1)\r\nelif num20NotePeople > (num10NotePeople + num10Notes):\r\n\tprint(0)\r\nelse:\r\n\tnum = 1\r\n\tden = 1\r\n\tfor i in range(num10Notes + 1):\r\n\t\tnum *= num20NotePeople - i\r\n\t\tden *= num10NotePeople + i + 1\r\n\r\n\tprob = 1 - num / den;\r\n\tprint(prob)\r\n", "#!/usr/bin/python3.5\r\n# -*- coding: utf-8 -*-\r\nimport json\r\nimport sys\r\n\r\n\r\ndef main():\r\n n, m, k = map(int, input().strip().split())\r\n if n + k < m:\r\n print(0)\r\n return\r\n ans = 1.0\r\n for i in range(k+1):\r\n ans *= (m - i) * 1.0 / (n + i + 1)\r\n print(1.0 - ans)\r\n\r\n\r\nif __name__ == '__main__':\r\n main()", "n,m,k = map(int,input().split())\r\nif m >k and m <= n+k:\r\n res= 1\r\n for x in range(k+1):\r\n res*=(m-x)/(n+k-(x-1))\r\n print(1-res)\r\nelse:\r\n print(0 if m > n+k else 1)" ]

[ "a,b=map(int,input().split())\r\nd=list(map(int,input().split()))\r\np=list(map(int,input().split()))\r\nt=0;d1=0;i=0\r\nwhile i<a:\r\n if t+sum(p[i::])-sum(d[i::])<0:\r\n j=i;pr=p[i]\r\n while j<a and pr>=p[j]:j+=1\r\n k=(-t-sum(p[i:j])-1+sum(d[i:j])+pr)//pr\r\n d1+=b*k\r\n t=(pr*k-(-t-sum(p[i:j])+sum(d[i:j])))%pr\r\n i=j\r\n else:i+=1\r\nprint(sum(d)+d1)\r\n", "n, k = map(int, input().split())\r\nl, a = list(map(int, input().split())), list(map(int, input().split()))\r\nv, t, s = 0, 0, sum(l)\r\nfor i in range(n):\r\n l[i] -= a[i]\r\nL, A = [l[0]], [a[0]]\r\nfor i in range(1, n):\r\n if a[i] <= A[-1]: L[-1] += l[i]\r\n else:\r\n A.append(a[i])\r\n L.append(l[i])\r\nfor i in range(len(A)):\r\n d = L[i] - v\r\n if d > 0:\r\n u = (d - 1) // A[i] + 1\r\n v += u * A[i]\r\n t += u * k\r\n v -= L[i]\r\nprint(t + s)", "import math\n\nif __name__ == '__main__':\n m_k = input().split()\n m = int(m_k[0])\n k = int(m_k[1])\n\n d_arr = input().split()\n s_arr = input().split()\n\n oil = 0\n\n max_n = 0\n\n count = 0\n\n for distance in d_arr:\n count += int(distance)\n\n for i in range(0, m):\n curr_s = int(s_arr[i])\n oil += int(curr_s)\n\n max_n = max(max_n, curr_s)\n\n curr_d = int(d_arr[i])\n if curr_d > oil:\n refill = math.ceil((curr_d - oil) /max_n)\n oil += max_n * refill\n count += k * refill\n\n oil -= curr_d\n\n print(count)\n \t \t \t\t \t\t \t \t \t\t\t \t \t \t", "import math\r\n\r\n\r\nclass CodeforcesTask241ASolution:\r\n def __init__(self):\r\n self.result = ''\r\n self.m_k = []\r\n self.distances = []\r\n self.supplies = []\r\n\r\n def read_input(self):\r\n self.m_k = [int(x) for x in input().split(\" \")]\r\n self.distances = [int(x) for x in input().split(\" \")]\r\n self.supplies = [int(x) for x in input().split(\" \")]\r\n\r\n def process_task(self):\r\n travel_time = sum(self.distances)\r\n position = 0\r\n fuel = self.supplies[0]\r\n max_supply = self.supplies[0]\r\n while position < self.m_k[0]:\r\n if fuel >= self.distances[position]:\r\n fuel -= self.distances[position]\r\n position += 1\r\n if position == self.m_k[0]:\r\n break\r\n fuel += self.supplies[position]\r\n max_supply = max(max_supply, self.supplies[position])\r\n else:\r\n tanking = self.distances[position] - fuel\r\n tanking_rounds = tanking // max_supply + int(math.ceil(tanking % max_supply / max_supply))\r\n fuel += tanking_rounds * max_supply\r\n travel_time += tanking_rounds * self.m_k[1]\r\n self.result = str(travel_time)\r\n\r\n def get_result(self):\r\n return self.result\r\n\r\n\r\nif __name__ == \"__main__\":\r\n Solution = CodeforcesTask241ASolution()\r\n Solution.read_input()\r\n Solution.process_task()\r\n print(Solution.get_result())\r\n", "from math import ceil\nn, k = map(int,input().split())\nd = list(map(int,input().split()))\ns = list(map(int,input().split()))\nfuel = 0\nstor = 0\ntime = 0\n\nfor i in range(n):\n\tfuel+= s[i]\n\tstor = max(stor, s[i])\n\tif fuel >= d[i]:\n\t\tfuel-= d[i]\n\t\ttime+= d[i]\n\telse:\n\t\tyy = ceil((d[i] - fuel) / stor)\n\t\ttime+= k * yy\n\t\ttime+= d[i]\n\t\tfuel+= stor * yy\n\t\tfuel-= d[i]\nprint(time)", "m,k=map(int,input().split())\r\nd = list(map(int,input().split()))\r\ns = list(map(int,input().split()))\r\ncap=0\r\ndis=0\r\nma=0\r\ntime=0\r\nfor i in range(m):\r\n dis=d[i]\r\n cap+=(s[i]-d[i])\r\n time+=d[i]\r\n ma=max(ma,s[i])\r\n if cap<0:\r\n while cap<0:\r\n cap+=ma\r\n time+=k\r\nprint(time) ", "# CF 241/A 1300\n\n# S = supply in city i\n# D = distance from c[i] to c[i + 1]\n# k = refresh interval\n# min time to arrive at C[n] where n = m + 1\n\ndef f(k, D, S):\n n = len(D)\n\n # travel time is at least the sum of all distances\n time = sum(D)\n\n fuel = 0\n best = 0\n\n for i in range(n):\n assert fuel >= 0\n # enter i-th city\n # fuel is either negative (we need extra) or zero\n # add S[i] fuel for free\n # subtract distance to city i+1\n fuel += (S[i] - D[i])\n if S[i] > S[best]:\n best = i\n if fuel < 0: # best station for i..lastpos\n need = -fuel\n count = need // S[best]\n if need % S[best] != 0:\n count += 1\n time += count * k\n fuel += S[best] * count\n\n return time\n\nassert f(4, [15, 20, 14, 10, 39, 4, 26, 8, 8, 30, 13, 43, 7, 7, 4, 6, 23, 42, 24, 35, 12, 19, 21, 31, 5, 20, 8, 17, 25, 31, 8, 31, 9, 14, 29, 35, 39, 35, 19, 13, 35, 11, 24, 3, 22, 3, 22, 41, 26, 32, 17, 42, 21, 16, 15, 44, 12, 5, 16, 20, 19, 38, 15, 11, 36, 14, 6, 21, 5, 27, 15, 40, 6, 9, 32, 33, 35, 4, 10, 15, 26], [3, 5, 4, 3, 4, 6, 4, 7, 5, 4, 3, 4, 3, 3, 4, 3, 4, 3, 3, 4, 6, 5, 5, 3, 3, 6, 6, 5, 3, 3, 5, 3, 3, 6, 4, 4, 3, 6, 4, 3, 3, 5, 6, 6, 7, 3, 3, 3, 3, 3, 7, 3, 3, 5, 3, 3, 3, 4, 6, 4, 6, 4, 5, 3, 3, 6, 4, 3, 3, 3, 7, 5, 4, 5, 3, 5, 4, 3, 3, 4, 3]) == 2419\n\nassert f(10, [4, 4, 4], [1, 2, 3]) == 3 * 10 + 1 * 10 + 10 + 12\nassert f(10, [5], [5]) == 5\nassert f(10, [6], [5]) == 16\nassert f(20, [5, 5], [5, 5]) == 10\nassert f(5, [2, 2, 2], [1, 1, 1]) == 6 + 5 + 5 + 5\nassert f(5, [1, 1, 1], [3, 0, 0]) == 3\nassert f(10, [4, 4, 4], [6, 5, 3]) == 12\n\nassert f(6, [1, 2, 5, 2], [2, 3, 3, 4]) == 10\nassert f(5, [10, 10, 10], [5, 10, 1]) == 40\nassert f(3, [5, 6], [5, 5]) == 14\nassert f(3, [11, 8, 8, 12, 17, 4, 4, 25, 39, 37, 31, 32, 38, 34, 29, 29, 34, 39, 39, 39, 17, 9, 24, 6], [3, 5, 4, 3, 3, 3, 4, 3, 4, 3, 3, 3, 3, 4, 3, 3, 4, 3, 4, 3, 3, 3, 3, 3]) == 862\n\n\nm, k = map(int, input().split())\nD = list(map(int, input().split()))\nS = list(map(int, input().split()))\nans = f(k, D, S)\nprint(ans)\n", "# LUOGU_RID: 111916882\nfrom sys import stdin \ninput = stdin.readline \n\ndef get() : \n return map(int,input().split())\n\nN = 1010 \nD = [0] * N \nS = [0] * N \nmx = [0] * N \n\nm,k = get() \nD[1:m + 1] = list(get()) \nS[1:m + 1] = list(get()) \n\nfor i in range(1, m + 1) : \n mx[i] = max(mx[i - 1], S[i]) \n\nnow = 0\nans = 0 \nfor i in range(1, m + 1) : \n now += S[i] \n while D[i] > now : \n ans += k \n now += mx[i] \n now -= D[i] \n ans += D[i] \n\nprint(ans) ", "from math import ceil\r\n\r\nX = list(map(int, input().split()))\r\nDistance = list(map(int, input().split()))\r\nFuel = list(map(int, input().split()))\r\nTank, Time, Max = 0, 0, 0\r\nfor i in range(X[0]):\r\n Tank += Fuel[i]\r\n Max = max(Max, Fuel[i])\r\n Stay = max(0, ceil((Distance[i] - Tank) / Max))\r\n Time += Stay * X[1] + Distance[i]\r\n Tank += Stay * Max - Distance[i]\r\nprint(Time)\r\n\r\n# Hope the best for Ravens\r\n# Never give up\r\n", "# -*- coding: utf-8 -*-\r\n\r\ndef main():\r\n m, k = [int(x) for x in input().split()]\r\n d = [int(x) for x in input().split()]\r\n s = [int(x) for x in input().split()]\r\n\r\n ans = 0 # total time spent\r\n fuel = 0 # amount of fuel in the tank\r\n mx = 0 # largest depo seen so far\r\n for i in range(m):\r\n fuel += s[i]\r\n mx = max(mx, s[i])\r\n\r\n if d[i] > fuel:\r\n diff = d[i] - fuel\r\n refill = diff // mx\r\n if refill*mx < diff: refill += 1\r\n fuel += (refill * mx)\r\n ans += (k * refill)\r\n\r\n fuel -= d[i]\r\n ans += d[i]\r\n #print(ans)\r\n\r\n print(ans)\r\n\r\n\r\nif __name__ == '__main__':\r\n main()", "estradas,k = [int(i) for i in input().split()]\r\nd = [int(i) for i in input().split()]\r\ns = [int(i) for i in input().split()]\r\n\r\n\r\nfuel = 0\r\ntime = 0\r\n\r\ncurrMax = 0\r\n\r\nfor i in range(estradas):\r\n fuel+=s[i]\r\n currMax = max(currMax,s[i])\r\n \r\n while(fuel<d[i]):\r\n time+=k\r\n fuel+=currMax\r\n \r\n \r\n fuel-=d[i]\r\n time+=d[i]\r\nprint(time)\r\n", "import math\r\n'''\r\n4 6\r\n1 2 5 2\r\n2 3 3 4\r\n'''\r\nm, k = map(int, input().split())\r\nn = m+1\r\ndistance = list(map(int, input().split()))\r\nsupply = list(map(int, input().split()))\r\n\r\ncurrentTank = supply[0]\r\ncurrentCity = 1\r\nbiggestSupply = supply[0]\r\ntime = sum(distance)\r\n\r\n#the next road is distance[currentCity-1]\r\n#the supply of currentCity is supply[currentCity-1]\r\nwhile currentCity < n:\r\n if currentTank < distance[currentCity-1]:\r\n\r\n fuelNeeded = distance[currentCity-1] - currentTank\r\n refills = math.ceil(fuelNeeded / biggestSupply)\r\n\r\n currentTank+= refills * biggestSupply\r\n time += refills * k\r\n\r\n currentTank -= distance[currentCity-1]\r\n currentCity += 1\r\n if currentCity < n:\r\n biggestSupply = max(biggestSupply, supply[currentCity-1])\r\n currentTank += supply[currentCity-1]\r\n\r\nprint(time)", "m,k=map(int,input().split())\n\nD=list(map(int,input().split()))\n\nS=list(map(int,input().split()))\n\nans=0\n\nfuel=S[0]\n\nmaxx=S[0]\n\nfor i in range(m):\n\n if(D[i]>fuel):\n\n x=D[i]-fuel\n\n y=x//maxx\n\n if(x%maxx>0):\n\n y+=1\n\n ans+=y*k\n\n fuel+=maxx*y\n\n fuel-=D[i]\n\n ans+=D[i]\n\n if(i+1==m):\n\n break\n\n fuel+=S[i+1]\n\n maxx=max(S[i+1],maxx)\n\n else:\n\n fuel-=D[i]\n\n ans+=D[i]\n\n if(i+1==m):\n\n break\n\n fuel+=S[i+1]\n\n maxx=max(S[i+1],maxx)\n\nprint(ans)\n\n", "def main():\r\n import sys\r\n input = sys.stdin.readline\r\n\t\r\n m, k = map(int, input().split())\r\n d = list(map(int, input().split()))\r\n s = list(map(int, input().split()))\r\n \r\n t = 0\r\n f = 0\r\n ma = 0\r\n \r\n for i in range(m):\r\n f += s[i]\r\n ma = max(ma, s[i])\r\n while f < d[i]:\r\n f += ma\r\n t += k\r\n t += d[i]\r\n f -= d[i]\r\n \r\n print(t)\r\n \r\n return 0\r\n\r\nmain()\r\n" ]

[ "n, m, k = map(int, input().split())\n\narray = list(map(int, input().split()))\n\nL = []\nR = []\nD = []\n\nfor i in range(m):\n\n l, r, d = map(int, input().split())\n L.append(l)\n R.append(r)\n D.append(d)\n\n L[i] -= 1\n\nU = [0 for _ in range(m+1)]\n\n\nfor i in range(k):\n x, y = map(int, input().split())\n x -= 1\n\n U[x] += 1\n U[y] -= 1\n\nc = 0\n\nC = [0 for _ in range(n+1)]\n\nfor i in range(m):\n c += U[i]\n\n C[L[i]] += D[i] * c\n C[R[i]] -= D[i] * c;\n\nc = 0\nfor i in range(n):\n c += C[i]\n array[i] += c\n\nstr_array = list(map(str, array))\n\nprint(\" \".join(str_array))\n\n\t\t \t \t \t \t\t\t \t\t\t \t \t \t\t \t \t", "\nn,m,k = map(int,input().split())\n\na = list(map(int,input().split()))\n\nops = [list(map(int,input().split())) for _ in range(m)]\nqus = [list(map(int,input().split())) for _ in range(k)]\n\n# reduce to opcount\nstarts = [0]*(m+1)\nfor l,r in qus:\n starts[l-1] += 1\n starts[r] -= 1\nopcount = [0]*m\nactive = 0\nfor i in range(m):\n active += starts[i]\n opcount[i] = active\n\n# reduce to adds\nsuffixOffset = [0]*(n+1)\nfor i in range(m):\n l,r,d = ops[i]\n suffixOffset[l-1] += opcount[i]*d\n suffixOffset[r] -= opcount[i]*d\nactive = 0\nfor i in range(n):\n active += suffixOffset[i]\n a[i] += active\n\nprint(*a)\n\n", "import io\r\nimport os\r\n\r\n\r\ndef fast_input():\r\n input_length = os.fstat(0).st_size\r\n byte_encoded_io = io.BytesIO(os.read(0, input_length))\r\n\r\n def decoder_wrapper():\r\n if (byte_encoded_io.tell() >= input_length):\r\n raise EOFError\r\n return byte_encoded_io.readline().decode()\r\n return decoder_wrapper\r\n\r\n\r\n# comment or uncomment for interactive vs fast input modes\r\ninput = fast_input()\r\n\r\n\r\ndef readLineAsIntList():\r\n return [int(x) for x in input().split()]\r\n\r\n\r\ndef readMultipleLinesAsIntList(count=None):\r\n if count is not None:\r\n return [int(input()) for i in range(count)]\r\n else:\r\n ret = []\r\n try:\r\n s = input()\r\n while True:\r\n ret.append(int(s))\r\n s = input()\r\n except EOFError:\r\n return ret\r\n\r\n\r\nn, m, k = readLineAsIntList()\r\n\r\narr = readLineAsIntList()\r\n\r\noperations = [readLineAsIntList() for i in range(m)]\r\n\r\nqueries = [readLineAsIntList() for i in range(k)]\r\n\r\n# prefix the operations\r\nqs_pfs = [0] * len(operations)\r\nfor x, y in queries:\r\n qs_pfs[x - 1] += 1\r\n if y < len(qs_pfs):\r\n qs_pfs[y] -= 1\r\nfor i in range(len(qs_pfs) - 1):\r\n qs_pfs[i + 1] += qs_pfs[i]\r\n\r\n# compute the true additions\r\noperations = [(l, r, d * v) for (l, r, d), v in zip(operations, qs_pfs)]\r\n\r\nnew_arr = [0] * n\r\nfor l, r, d in operations:\r\n new_arr[l-1] += d\r\n if r < len(new_arr):\r\n new_arr[r] -= d\r\nfor i in range(len(new_arr) - 1):\r\n new_arr[i+1] += new_arr[i]\r\n\r\nfor i in range(len(arr)):\r\n print(new_arr[i] + arr[i], end=\" \")\r\n", "import sys \r\ninput = sys.stdin.readline\r\n\r\ndef solve():\r\n n,m,k = map(int,input().split())\r\n ls = list(map(int,input().split()))\r\n pre = []\r\n pm = []\r\n frq = [0]*(n+1)\r\n fm = [0]*(m+1)\r\n mp = {}\r\n c = 0\r\n op = []\r\n \r\n for i in range(m):\r\n l,r,d = map(int,input().split())\r\n mp[i+1] = [l,r,d]\r\n for i in range(k):\r\n x,y = map(int,input().split())\r\n fm[x-1]+=1\r\n fm[y]-=1\r\n \r\n for i in range(len(fm)-1):\r\n c+=fm[i]\r\n mp[i+1][2]*=c\r\n c = 0\r\n for i in range(m):\r\n frq[mp[i+1][0]-1]+=mp[i+1][2]\r\n frq[mp[i+1][1]]-=mp[i+1][2]\r\n for i in range(n):\r\n c+=frq[i]\r\n ls[i]+=c\r\n print(ls[i],end = \" \")\r\n#for i in range(int(input())):\r\nsolve()", "import sys\r\ninput = sys.stdin.readline\r\n# import bisect #-->For bisect.bisect_left=lower_bound and bisect_right=upper_bound\r\n\r\nfor _ in range(1):#int(input())):\r\n n, m, k = map(int, input().split())\r\n a = list(map(int, input().split()))\r\n b = []\r\n for i in range(m):\r\n l, r, d = map(int, input().split())\r\n b.append([l,r,d])\r\n # print(*a)\r\n oper = [0]*(m+1)\r\n for i in range(k):\r\n x, y = map(int, input().split())\r\n oper[x-1] += 1\r\n oper[y] -= 1\r\n for i in range(1, m+1):\r\n oper[i] += oper[i-1]\r\n diff = [0]*(n+1)\r\n for i in range(m):\r\n x = b[i][2] * oper[i]\r\n l, r = b[i][0]-1, b[i][1]\r\n diff[l] += x\r\n diff[r] -= x\r\n for i in range(n):\r\n x = a[i]\r\n if (i > 0):\r\n diff[i] += diff[i-1]\r\n x += diff[i]\r\n print(x, end = \" \")", "def updateArray(arr, operations, queries, n, m, k):\r\n if not arr:\r\n return []\r\n \r\n numOperations = [0]*m\r\n for s, e in queries:\r\n numOperations[s-1] += 1\r\n if e < m:\r\n numOperations[e] -= 1\r\n for i in range(1, m):\r\n numOperations[i] += numOperations[i-1]\r\n \r\n arrInc = [0]*n\r\n for i in range(m):\r\n l, r, d = operations[i]\r\n arrInc[l-1] += d*numOperations[i]\r\n if r < n:\r\n arrInc[r] -= d*numOperations[i]\r\n for i in range(1, n):\r\n arrInc[i] += arrInc[i-1]\r\n \r\n for i in range(n):\r\n arr[i] += arrInc[i] \r\n return ' '.join(map(str, arr))\r\n\r\nn, m, k = list(map(int, input().split(' ')))\r\narr = list(map(int, input().split(' ')))\r\noperations = []\r\nfor i in range(m):\r\n operations.append(list(map(int, input().split(' '))))\r\nqueries = []\r\nfor i in range(k):\r\n queries.append(list(map(int, input().split(' '))))\r\nprint(updateArray(arr, operations, queries, n, m, k))\r\n\r\n \r\n", "n,m,k = list(map(int,input().split()))\r\narr = list(map(int,input().split()))\r\nval = []\r\nfor i in range(m):\r\n l,r,d = list(map(int,input().split()))\r\n val.append([l,r,d])\r\nqueries = [0 for i in range(m)]\r\nfor i in range(k):\r\n x,y = list(map(int,input().split()))\r\n queries[x-1]+=1\r\n if y<=m-1:\r\n queries[y]-=1\r\nfor i in range(1,len(queries)):\r\n queries[i]+=queries[i-1]\r\nans = [0 for i in range(n)]\r\nfor i in range(m):\r\n l,r,d = val[i]\r\n ans[l-1]+=(d*queries[i])\r\n if r<=n-1:\r\n ans[r]-=(d*queries[i])\r\nfor i in range(1,n):\r\n ans[i]+=ans[i-1]\r\nfor i in range(n):\r\n arr[i]+=ans[i]\r\nprint(*arr)", "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,m,q=lst()\r\n a=lst()\r\n queries=[lst() for _ in range(m)]\r\n mp=[0]*(2+m)\r\n for i in range(q):\r\n l,r=lst()\r\n mp[l]+=1\r\n mp[r+1]-=1\r\n for i in range(1,m+1):\r\n mp[i]+=mp[i-1]\r\n # print(mp)\r\n for i in range(1,m+1):\r\n queries[i-1][2]*=mp[i]\r\n # print(queries)\r\n dp=[0]*(n+2)\r\n for l,r,cost in queries:\r\n dp[l]+=cost\r\n dp[r+1]-=cost\r\n for i in range(1,n+1):\r\n dp[i]+=dp[i-1]\r\n for i in range(n):\r\n stdout.write(str(dp[i+1]+a[i])+' ')", "import sys\r\ninput = sys.stdin.readline\r\n \r\ndef solution():\r\n n,m,k=map(int,input().split())\r\n a=list(map(int,input().split()))\r\n op=[]\r\n op_counter=[0]*(1000004)\r\n dp=[0]*(1000004)\r\n for _ in range(m):\r\n l,r,d=map(int,input().split())\r\n op.append([l,r,d])\r\n for i in range(k):\r\n x,y=map(int,input().split())\r\n op_counter[x-1]+=1\r\n op_counter[y]-=1\r\n for i in range(1,len(op_counter)):\r\n op_counter[i]+=op_counter[i-1]\r\n for i in range(len(op)):\r\n l=op[i][0]\r\n r=op[i][1]\r\n d=op[i][2]\r\n dp[l-1]+=(op_counter[i]*d)\r\n dp[r]-=(op_counter[i]*d)\r\n for i in range(1,len(dp)):\r\n dp[i]+=dp[i-1]\r\n for i in range(n):\r\n a[i]+=dp[i]\r\n \r\n print(*a)\r\nsolution()\r\n", "import sys\r\ninput=sys.stdin.readline\r\n\r\nn,m,k=list(map(int,input().split()))\r\na=list(map(int,input().split()))\r\ntmp=[[0]]\r\nfor i in range(m):\r\n x=list(map(int,input().split()))\r\n tmp.append(x)\r\n#print(tmp)\r\ncnt=[0]*(m+2)\r\nfor i in range(k):\r\n x,y=map(int,input().split())\r\n cnt[x]+=1\r\n cnt[y+1]-=1\r\n\r\nfor i in range(1,m+2):\r\n cnt[i]+=cnt[i-1]\r\n#print(cnt)\r\nans=[0]*(n+2)\r\nfor i in range(1,m+1):\r\n l,r,d=tmp[i][0],tmp[i][1],tmp[i][2]\r\n x=d*cnt[i]\r\n ans[l]+=x\r\n ans[r+1]-=x\r\n#print(1,ans)\r\nfor i in range(1,n+1):\r\n ans[i]+=ans[i-1]\r\n#print(2,ans)\r\nfor i in range(1,n+1):\r\n ans[i]+=a[i-1]\r\nprint(*ans[1:n+1])", "from sys import stdin, stdout\nfrom math import floor, gcd, fabs, factorial, fmod, sqrt, inf, log\nfrom collections import defaultdict as dd, deque\nfrom heapq import merge, heapify, heappop, heappush, nsmallest\nfrom bisect import bisect_left as bl, bisect_right as br, bisect\n \nmod = pow(10, 9) + 7\nmod2 = 998244353\n \ndef inp(): return stdin.readline().strip()\ndef iinp(): return int(inp())\ndef out(var, end=\"\\n\"): stdout.write(str(var)+\"\\n\")\ndef outa(*var, end=\"\\n\"): stdout.write(' '.join(map(str, var)) + end)\ndef lmp(): return list(mp())\ndef mp(): return map(int, inp().split())\ndef smp(): return map(str, inp().split())\ndef l1d(n, val=0): return [val for i in range(n)]\ndef l2d(n, m, val=0): return [l1d(m, val) for j in range(n)]\ndef remadd(x, y): return 1 if x%y else 0\ndef ceil(a,b): return (a+b-1)//b\nS1 = 'abcdefghijklmnopqrstuvwxyz'\nS2 = 'ABCDEFGHIJKLMNOPQRSTUVWXYZ'\ndef isprime(x):\n if x<=1: return False\n if x in (2, 3): return True\n if x%2 == 0: return False\n for i in range(3, int(sqrt(x))+1, 2):\n if x%i == 0: return False\n return True\n \nn, m, k = mp()\narr = lmp()\nml = [tuple(mp()) for i in range(m)]\nquer = l1d(m+1)\nfor i in range(k):\n x, y = mp()\n quer[x-1]+=1\n quer[y]-=1\nfor i in range(1, m+1):\n quer[i]+=quer[i-1]\nincr = l1d(n+1)\nfor i in range(m):\n x, y, z = ml[i]\n incr[x-1]+=z*quer[i]\n incr[y]-=z*quer[i]\nfor i in range(1, n+1):\n incr[i]+=incr[i-1]\nfor i in range(n):\n print(arr[i]+incr[i], end=' ')\nprint()", "n, m, k = map(int, input().split())\r\nt = list(map(int, input().split()))\r\np = [tuple(map(int, input().split())) for i in range(m)]\r\n\r\nr, s = [0] * (m + 1), [0] * (n + 1)\r\nR, S = 0, 0\r\n\r\nfor i in range(k):\r\n x, y = map(int, input().split())\r\n r[x - 1] += 1\r\n r[y] -= 1\r\n\r\nfor i, (x, y, d) in enumerate(p):\r\n R += r[i]\r\n d = d * R\r\n s[x - 1] += d\r\n s[y] -= d\r\n\r\nfor i in range(n):\r\n S += s[i]\r\n t[i] = str(t[i] + S)\r\n\r\nprint(' '.join(map(str, t)))", "import sys\r\n\r\n\r\ndef read(line):\r\n return [int(c) for c in line.strip().split()]\r\n\r\n\r\ndef main():\r\n test = sys.stdin.readlines()\r\n n, m, k = read(test[0])\r\n array = read(test[1])\r\n ops = [read(test[2 + j]) for j in range(m)]\r\n queries = [read(test[2 + m + j]) for j in range(k)]\r\n\r\n inc = [0] * (m + 1)\r\n for x, y in queries:\r\n inc[x - 1] += 1\r\n inc[y] -= 1\r\n\r\n dInA = [0] * (n + 1)\r\n c = 0\r\n for i in range(m):\r\n c += inc[i]\r\n l, r, d = ops[i]\r\n dInA[l - 1] += c * d\r\n dInA[r] -= c * d\r\n\r\n ans = []\r\n c = 0\r\n for i in range(n):\r\n c += dInA[i]\r\n ans.append(c + array[i])\r\n\r\n print(*ans)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n\r\n# 12 - 12:35", "import sys \r\n\r\ninput = sys.stdin.readline \r\n\r\nn, m, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\noperations = [list(map(int, input().split())) for _ in range(m)]\r\nquery = [map(int, input().split()) for _ in range(k)]\r\n\r\n\r\n### Find the number of time a given query is going to get executed\r\n\r\noperations_prefix = [0] * (m + 1)\r\nfor l, r in query:\r\n # make the indices zero indexed\r\n l -= 1 \r\n r -= 1\r\n operations_prefix[l] += 1\r\n operations_prefix[r + 1] -= 1\r\n\r\n# Do the prefix sum\r\nfor i in range(1, m):\r\n operations_prefix[i] += operations_prefix[i - 1]\r\n\r\n\r\n### Find the number of times a given index is increment in the array\r\n\r\na_prefix = [0] * (n + 1)\r\nfor i, (l, r, d) in enumerate(operations):\r\n # make the indices zero indexed\r\n l -= 1\r\n r -= 1\r\n d *= operations_prefix[i]\r\n a_prefix[l] += d \r\n a_prefix[r + 1] -= d \r\n\r\n# Do prefix sum\r\nfor i in range(1, n):\r\n a_prefix[i] += a_prefix[i - 1]\r\n\r\n\r\n\r\n### Apply the changes to the original array\r\nfor i in range(n):\r\n a[i] += a_prefix[i]\r\n\r\nprint(*a)", "\"\"\" A. Greg and Array\r\n\"\"\"\r\nimport sys\r\n\r\nn, m, k = map(int, sys.stdin.readline().split())\r\narr = [x for x in map(int, sys.stdin.readline().split())]\r\nops = []\r\nfor x in range(m):\r\n ops.append((map(int, sys.stdin.readline().split())))\r\nc = [0] * m # hold number of ops starting at i\r\nfor x in range(k):\r\n l, r = map(int, sys.stdin.readline().split())\r\n c[l - 1] += 1\r\n if r < m:\r\n c[r] -= 1 # query affects i - 1, stop at i\r\ntimes_used = [0] * m # times each op is used\r\ntimes_used[0] = c[0]\r\nfor x in range(1, m):\r\n times_used[x] = times_used[x - 1] + c[x]\r\nc1 = [0] * n # hold number of updates starting at i\r\nfor x in range(m):\r\n l, r, d = ops[x]\r\n c1[l - 1] += times_used[x] * d\r\n if r < n:\r\n c1[r] -= times_used[x] * d\r\namount_added = [0] * n # amount to add to arr[i]\r\namount_added[0] = c1[0]\r\narr[0] += amount_added[0]\r\nfor x in range(1, n):\r\n amount_added[x] = amount_added[x - 1] + c1[x]\r\n arr[x] += amount_added[x]\r\nprint(*arr, sep = \" \", end = \"\\n\")\r\n", "import sys\n\nn, m, k = map(int, input().split())\narr = [int(_) for _ in input().split()]\nmodifier = [0] * n\nk_modifier = [0] * m\n\nfor _ in range(m):\n input()\n\nfor _ in range(k):\n start, end = map(int, input().split())\n k_modifier[start - 1] += 1\n\n if end < m:\n k_modifier[end] -= 1\n\nsys.stdin.seek(0)\ninput()\ninput()\n\nk_sum = 0\nfor _ in range(m):\n start, end, num = map(int, input().split())\n k_sum += k_modifier[_]\n num *= k_sum\n\n modifier[start - 1] += num\n\n if end < n:\n modifier[end] -= num\n\nsum = 0\nfor i, a in enumerate(arr):\n sum += modifier[i]\n print(a + sum, end=\" \")\n\t\t\t \t \t \t \t\t \t \t \t\t \t\t \t", "from sys import stdin, stdout\r\nrd = lambda: list(map(int, stdin.readline().split()))\r\n\r\nn, m, k = rd()\r\n\r\nA = rd()\r\nO = []\r\n\r\nfor _ in range(m):\r\n O.append(rd())\r\n\r\nOIter = [0]*(m+1)\r\nfor _ in range(k):\r\n x, y = rd()\r\n# for i in range(x-1, y):\r\n# OIter[i] += 1\r\n OIter[x-1] += 1\r\n OIter[y] -= 1\r\nfor i in range(1,m):\r\n OIter[i] += OIter[i-1]\r\n# print(' '.join(map(str, OIter)))\r\n\r\nmask = [0]*(n+1)\r\nfor _ in range(m):\r\n# for i in range(O[_][0]-1, O[_][1]):\r\n# A[i] += O[_][2]*OIter[_]\r\n l, r, d = O[_]\r\n mask[l-1] += d*OIter[_]\r\n mask[r] -= d*OIter[_]\r\nfor i in range(1,n):\r\n mask[i] += mask[i-1]\r\n# print(' '.join(map(str, mask)))\r\n\r\nfor i in range(n):\r\n A[i] += mask[i]\r\nprint(' '.join(map(str, A)))", "from itertools import repeat\nfrom sys import stdin\nfrom typing import List\n\nrd = lambda: map(int, stdin.readline().split(\" \"))\n\n\nclass operation:\n start: int\n end: int\n value: int\n count: int = 0\n\n def __init__(self):\n s, e, self.value = rd()\n self.start = int(s) - 1\n self.end = int(e) - 1\n\n\nclass Node:\n i: int\n l: int\n r: int\n\n def __init__(self, i, l, r):\n self.i = i\n self.l = l\n self.r = r\n\n\nclass SegmentTree:\n def __init__(self, size: int):\n self.tree = list(repeat(0, size + 1))\n\n def increment(self, left: int, right: int, value: int):\n self.tree[left] += value\n self.tree[right + 1] -= value\n\n def get(self, index: int):\n return self.tree[index]\n\n\ndef gather_operations(k: int, m: int, operations: List[operation]) -> List[operation]:\n tree = SegmentTree(m)\n for i in range(k):\n start, end = rd()\n tree.increment(start - 1, end - 1, 1)\n s = 0\n for i in range(m):\n s += tree.get(i)\n operations[i].count = s\n return operations\n\n\ndef apply_operations(m: int, n: int, n_array: List[int], operations: List[operation]):\n tree = SegmentTree(n)\n for o in operations:\n tree.increment(o.start, o.end, o.count * o.value)\n s = 0\n for i in range(n):\n s += tree.get(i)\n n_array[i] += s\n return n_array\n\n\ndef main():\n n, m, k = rd()\n n_array = list(rd())\n operations = []\n for i in range(m):\n operations.append(operation())\n operations = gather_operations(k, m, operations)\n n_array = apply_operations(m, n, n_array, operations)\n print(n_array[0], end=\"\")\n for i in range(1, n):\n print(f\" {n_array[i]}\", end=\"\")\n print(\"\")\n\n\nif __name__ == \"__main__\":\n main()\n", "from sys import stdin\r\ndef input(): return stdin.readline().rstrip(\"\\r\\n\")\r\nn,m,k = map(int,input().split())\r\na = list(map(int,input().split()))\r\ndiff1 = [0]*(n+1)\r\ndiff2 = [0]*(m+1)\r\narr1 = []\r\nfor i in range(m):\r\n l,r,d = map(int,input().split())\r\n l-=1\r\n r-=1\r\n arr1.append([l,r,d])\r\nfor p in range(k):\r\n x,y = map(int,input().split())\r\n x-=1\r\n y-=1\r\n diff2[x]+=1\r\n diff2[y+1]-=1\r\nfor j in range(1,len(diff2)-1):\r\n diff2[j]+=diff2[j-1]\r\nfor p in range(m):\r\n l,r,d = arr1[p]\r\n diff1[l]+=diff2[p]*d\r\n diff1[r+1]-=diff2[p]*d\r\nfor l in range(1,len(diff1)):\r\n diff1[l]+=diff1[l-1]\r\nfor i in range(n):\r\n a[i]+=diff1[i]\r\nprint(*a)", "n, m, k = map(int, input().split())\na = [int(ai) for ai in input().split()]\nops = [[int(i) for i in input().split()] for _ in range(m)]\n\nop_diff = [0] * m\nfor _ in range(k):\n x, y = map(int, input().split())\n op_diff[x - 1] += 1\n if y < m:\n op_diff[y] -= 1\n\ncnt, diff = 0, [0] * n\nfor i, (l, r, d) in zip(op_diff, ops):\n cnt += i\n diff[l - 1] += cnt * d\n if r < n:\n diff[r] -= cnt * d\n\ncnt = 0\nfor i, d in enumerate(diff):\n cnt += d\n a[i] += cnt\n\nprint(*a)\n", "'''\r\n ___ ____ \r\n ____ _____ _____/ (_)_ ______ ____ _____/ / /_ __ ______ ___ __\r\n / __ `/ __ `/ __ / / / / / __ \\/ __ `/ __ / __ \\/ / / / __ `/ / / /\r\n/ /_/ / /_/ / /_/ / / /_/ / /_/ / /_/ / /_/ / / / / /_/ / /_/ / /_/ / \r\n\\__,_/\\__,_/\\__,_/_/\\__,_/ .___/\\__,_/\\__,_/_/ /_/\\__, /\\__,_/\\__, / \r\n /_/ /____/ /____/ \r\n'''\r\nimport os.path\r\nfrom math import gcd, floor, ceil\r\nfrom collections import *\r\nimport sys\r\nmod = 1000000007\r\nINF = float('inf')\r\ndef st(): return list(sys.stdin.readline().strip())\r\ndef li(): return list(map(int, sys.stdin.readline().split()))\r\ndef mp(): return map(int, sys.stdin.readline().split())\r\ndef inp(): return int(sys.stdin.readline())\r\ndef pr(n): return sys.stdout.write(str(n)+\"\\n\")\r\ndef prl(n): return sys.stdout.write(str(n)+\" \")\r\n\r\n\r\nif os.path.exists('input.txt'):\r\n sys.stdin = open('input.txt', 'r')\r\n sys.stdout = open('output.txt', 'w')\r\n\r\nn, m, k = mp()\r\narr = li()\r\nl = [li() for i in range(m)]\r\ncur = [0]*(m)\r\nfor i in range(k):\r\n a, b = mp()\r\n cur[a-1] += 1\r\n if b < m:\r\n cur[b] -= 1\r\nfor i in range(1, m):\r\n cur[i] += cur[i-1]\r\nans = [0]*(n)\r\nfor i, ele in enumerate(cur):\r\n left, right, val = l[i]\r\n ans[left-1] += val*ele\r\n if right < n:\r\n ans[right] -= val*ele\r\nfor i in range(1, n):\r\n ans[i] += ans[i-1]\r\nfor i in range(n):\r\n ans[i] += arr[i]\r\nprint(*ans)\r\n", "'''input\r\n4 3 6\r\n1 2 3 4\r\n1 2 1\r\n2 3 2\r\n3 4 4\r\n1 2\r\n1 3\r\n2 3\r\n1 2\r\n1 3\r\n2 3\r\n'''\r\nfrom sys import stdin, setrecursionlimit\r\n\r\nsetrecursionlimit(15000)\r\n\r\n\r\ndef cum_sum(arr):\r\n\tfor i in range(1, len(arr)):\r\n\t\tarr[i] += arr[i - 1]\r\n\r\n\r\n# main starts\r\nn, m, k = list(map(int, stdin.readline().split()))\r\narr = list(map(int, stdin.readline().split()))\r\nfirst = [0] * n\r\nmarr = []\r\nfor _ in range(m):\r\n\tl, r, d = list(map(int, stdin.readline().split()))\r\n\tmarr.append([l, r, d])\r\n\t\r\nsecond = [0] * m\r\nfor _ in range(k):\r\n\tx, y = list(map(int, stdin.readline().split()))\r\n\tsecond[x - 1] += 1\r\n\tif y < m:\r\n\t\tsecond[y] -= 1\r\ncum_sum(second)\r\nfor i in range(len(second)):\r\n\tl, r, d = marr[i]\r\n\tfirst[l - 1] += d * second[i]\r\n\tif r < n:\r\n\t\tfirst[r] -= d * second[i]\r\ncum_sum(first)\r\nfor i in range(n):\r\n\tarr[i] += first[i]\r\n\r\nprint(*arr)\r\n\t\r\n\r\n", "I=lambda :map(int,input().split())\r\nn,m,k=I()\r\noper=[]\r\narr=list(I())\r\nfor i in range(m):\r\n oper.append(list(I()))\r\nvote=[0]*n\r\nval=[0]*m\r\nfor _ in range(k):\r\n a,b=I()\r\n val[a-1]+=1\r\n if b<m:\r\n val[b]-=1\r\nt=0\r\nfor i in range(m):\r\n t+=val[i]\r\n d=oper[i][2]*t\r\n vote[oper[i][0]-1]+=d\r\n if oper[i][1]<n:\r\n vote[oper[i][1]]-=d\r\narr[0]+=vote[0]\r\nfor i in range(1,n):\r\n vote[i]+=vote[i-1]\r\n arr[i]+=vote[i]\r\nprint(*arr)", "# Asif Islam - asifislam510\n# Parse input\nn, m, k = map(int, input().split())\na_values = list(map(int, input().split()))\n\n# Initialize lists and counters\noperations = [list(map(int, input().split())) for _ in range(m)]\noperation_counts = [0] * m\nb = [0] * n\n\n# Process range updates and calculate cumulative counts\nfor _ in range(k):\n x, y = map(int, input().split())\n operation_counts[x - 1] += 1\n if y < m:\n operation_counts[y] -= 1\n\nfor i in range(1, m):\n operation_counts[i] += operation_counts[i - 1]\n\n# Apply operations to the array and calculate cumulative sums\nfor i in range(m):\n l, r, d = operations[i]\n b[l - 1] += d * operation_counts[i]\n if r < n:\n b[r] -= d * operation_counts[i]\n\nfor i in range(1, n):\n b[i] += b[i - 1]\n\n# Add original array values\nfor i in range(n):\n b[i] += a_values[i]\n\n# Output the final array\nprint(\" \".join(map(str, b)))\n\n\t \t\t \t\t \t \t \t \t\t\t \t \t\t\t\t\t\t", "from itertools import accumulate\r\n\r\nn, m, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\noper = [tuple(map(int, input().split())) for i in range(m)]\r\nzapr = [tuple(map(int, input().split())) for i in range(k)]\r\n\r\ncount_ = [0 for i in range(m + 1)]\r\n\r\nfor el in zapr:\r\n x, y = el\r\n\r\n count_[x - 1] += 1\r\n count_[y] -= 1\r\n\r\ncounter_ = list(accumulate(count_))[:-1]\r\n\r\na.append(0)\r\na_count = [a[0]]\r\n\r\nfor i, el in enumerate(a[1:]):\r\n a_count.append(el - a[i])\r\n\r\nfor i, el in enumerate(oper):\r\n l, r, d = el\r\n d *= counter_[i]\r\n\r\n a_count[l - 1] += d\r\n a_count[r] -= d\r\n\r\na = list(accumulate(a_count))[:-1]\r\n\r\nprint(' '.join(map(str, a)))\r\n", "\r\nimport sys\r\ninput = sys.stdin.readline\r\n\r\nn,m,k=map(int,input().split())\r\narr=list(map(int,input().split()))\r\nquerry_arr=[list(map(int, input().split())) for _ in range(m)]\r\ntmp_ans=[0]*n\r\ntmp=[0]*(m+1)\r\nfor _ in range(k):\r\n l,r=map(lambda k:int(k)-1,input().split())\r\n tmp[l]+=1\r\n tmp[r+1]-=1\r\nfor x in range(1,m):\r\n tmp[x]+=tmp[x-1]\r\narr_tmp=[0]*(n+1)\r\ntmp.pop()\r\nfor x in range(m):\r\n u,v,w=querry_arr[x]\r\n u-=1\r\n v-=1\r\n arr_tmp[u]+=w*tmp[x]\r\n arr_tmp[v+1]-=w*tmp[x]\r\narr[0]+=arr_tmp[0]\r\nfor x in range(1,n):\r\n arr_tmp[x]+=arr_tmp[x-1]\r\n arr[x]+=arr_tmp[x]\r\nprint(' '.join(map(str, arr)))\r\n\r\n", "import sys\r\n\r\nn, m, k = map(int, sys.stdin.readline().split())\r\na = list(map(int, sys.stdin.readline().split()))\r\n\r\nf = [0 for i in range(10 ** 5 + 100)]\r\nopers = []\r\n\r\nfor i in range(m):\r\n l, r, d = map(int, sys.stdin.readline().split())\r\n opers.append([l, r, d])\r\n\r\nq = [0 for i in range(m + 1)]\r\nfor i in range(k):\r\n x, y = map(int, sys.stdin.readline().split())\r\n q[x - 1] += 1\r\n q[y] -= 1\r\n\r\ns = 0\r\nfor i in range(m):\r\n s += q[i]\r\n l, r, d = opers[i]\r\n f[l-1] += d * s\r\n f[r] -= d * s\r\n\r\ns = 0\r\nfor i in range(n):\r\n s += f[i]\r\n a[i] += s\r\n sys.stdout.write(str(a[i]) + \" \")\r\n", "iarr = lambda : list(map(int, input().strip().split(' ')))\n\nn, m, k = iarr()\n\narr = iarr()\n\noperation = [None] * m\nfor i in range(m):\n operation[i] = iarr()\n\nnum_operation = [0] * m\nfor i in range(k):\n l, r = iarr()\n num_operation[l - 1] += 1\n if r < m:\n num_operation[r] -= 1\n \nfor i in range(1, m):\n num_operation[i] = num_operation[i] + num_operation[i - 1]\n\nbuffer = [0] * len(arr)\n\nfor i in range(m):\n c_operation = operation[i]\n num = num_operation[i]\n\n if num > 0:\n buffer[c_operation[0] - 1] += c_operation[2] * num\n if c_operation[1] < len(buffer):\n buffer[c_operation[1]] += -c_operation[2] * num\n\nfor i in range(1, len(buffer)):\n buffer[i] = buffer[i] + buffer[i - 1]\n \nret = []\n\nfor i in range(len(buffer)):\n ret.append(str(buffer[i] + arr[i]))\n\nprint(' '.join(ret))", "import sys\r\ninput=sys.stdin.readline\r\n\r\nif __name__ == \"__main__\":\r\n n,m,k=map(int,input().split())\r\n nums=[int(i) for i in input().split()]\r\n operations=[]\r\n for _ in range(m):\r\n operations.append([int(i) for i in input().split()])\r\n # print(operations)\r\n op_counts=[0]*m\r\n for _ in range(k):\r\n x,y=map(int,input().split())\r\n if x==1:\r\n op_counts[y-1]+=1\r\n else:\r\n op_counts[y-1]+=1\r\n op_counts[x-2]-=1\r\n i=m-2\r\n while i>=0:\r\n op_counts[i]+=op_counts[i+1]\r\n i-=1\r\n # print(op_counts)\r\n for i in range(m):\r\n operations[i][2]*=op_counts[i]\r\n # print(operations)\r\n effects=[0]*n\r\n for i in range(m):\r\n if operations[i][0]==1:\r\n effects[operations[i][1]-1]+=operations[i][2]\r\n else:\r\n effects[operations[i][1]-1]+=operations[i][2]\r\n effects[operations[i][0]-2]-=operations[i][2]\r\n # print('i -- ',*nums)\r\n i=n-2\r\n while i>=0:\r\n effects[i]+=effects[i+1]\r\n i-=1\r\n for i in range(n):\r\n nums[i]+=effects[i]\r\n print(*nums)", "n, m, k = map(int, input().split())\r\narr = list(map(int, input().split()))\r\nchange = [0] * (n + 1)\r\noperationRepeats = [0] * (m + 1)\r\nlistOP = [] \r\nfor i in range(m):\r\n listOP.append(list(map(int, input().split())))\r\n \r\nfor i in range(k):\r\n x,y = map(int, input().split())\r\n operationRepeats[x - 1] += 1\r\n operationRepeats[y] -= 1\r\n\r\nfor i in range(1, m):\r\n operationRepeats[i] += operationRepeats[i - 1]\r\n\r\n# print(operationRepeats)\r\naccumulatedChange = 0\r\nfor i in range(m):\r\n l,r,d = listOP[i]\r\n accumulatedChange += d\r\n change[l - 1] += d * operationRepeats[i]\r\n change[r] -= d * operationRepeats[i]\r\n# print(change)\r\naccumulatedChange = 0\r\nfor i in range(n):\r\n accumulatedChange += change[i]\r\n arr[i] += accumulatedChange\r\nprint(\" \".join(map(str, arr)))", "import sys\r\nn,m,k = map(int,sys.stdin.readline().split())\r\narr = list(map(int,sys.stdin.readline().split()))\r\nd = {}\r\nfor i in range(m):\r\n d[i] = list(map(int,sys.stdin.readline().split()))\r\n# print(d)\r\nop_count = [0]*(m+5)\r\nfor i in range(k):\r\n x,y = map(int,sys.stdin.readline().split())\r\n op_count[x-1]+=1\r\n op_count[y]-=1\r\nc = len(op_count)\r\nfor i in range(1,c):\r\n op_count[i]+=op_count[i-1]\r\ninc_arr = [0]*(n+5)\r\nfor i in range(c):\r\n if op_count[i]>0:\r\n l,r,inc = d[i]\r\n inc*=op_count[i]\r\n inc_arr[l-1]+=inc\r\n inc_arr[r]-=inc\r\nfor i in range(1,len(inc_arr)):\r\n inc_arr[i]+=inc_arr[i-1]\r\nfor i in range(n):\r\n arr[i]+=inc_arr[i]\r\nprint(*arr)\r\n", "def main():\n n, m, k = map(int, input().split())\n aa = list(map(int, input().split()))\n lrd = list(tuple(map(int, input().split())) for _ in range(m))\n cnt = [0] * (m + 1)\n for _ in range(k):\n x, y = map(int, input().split())\n cnt[x - 1] += 1\n cnt[y] -= 1\n delta, c = [0] * (n + 1), 0\n for (l, r, d), dc in zip(lrd, cnt):\n c += dc\n d *= c\n delta[l - 1] += d\n delta[r] -= d\n da = 0\n for i, a, d in zip(range(n), aa, delta):\n da += d\n aa[i] = a + da\n print(\" \".join(map(str, aa)))\n\n\nif __name__ == '__main__':\n main()\n", "def main():\r\n n, m, k = list(map(int, input().split()))\r\n A = list(map(int, input().split()))\r\n Range = []\r\n Value = []\r\n for _ in range(m):\r\n l, r, val = list(map(int, input().split()))\r\n l -= 1\r\n r -= 1\r\n Range.append((l, r))\r\n Value.append(val)\r\n\r\n Q = [0] * ((10 ** 5) + 5)\r\n for _ in range(k):\r\n x, y = list(map(int, input().split()))\r\n x -= 1\r\n y -= 1\r\n Q[x] += 1\r\n Q[y + 1] -= 1\r\n\r\n # prefix Array\r\n for i in range(1, m):\r\n Q[i] += Q[i - 1]\r\n\r\n # new value\r\n for i in range(m):\r\n Value[i] = Value[i] * Q[i]\r\n\r\n # prefix Array\r\n Arr = [0] * ((10 ** 5) + 5)\r\n for i in range(m):\r\n Arr[Range[i][0]] += Value[i]\r\n Arr[Range[i][1] + 1] -= Value[i]\r\n\r\n # new value\r\n for i in range(1,n):\r\n Arr[i] += Arr[i - 1]\r\n\r\n # update A\r\n for i in range(n):\r\n A[i] += Arr[i]\r\n print(*A)\r\n\r\nif __name__ == \"__main__\":\r\n main()", "n, m, k = map(int, input().split())\r\narr = list(map(int, input().split()))\r\nmark_up_arr = [0]*(n+1)\r\nmark_up_ope = [0]*(m+1)\r\nope_list = []\r\nope_count = [0]*m\r\n\r\nfor _ in range(m):\r\n l, r, d = map(int, input().split())\r\n l -= 1\r\n ope_list.append((l, r, d))\r\n\r\nfor _ in range(k):\r\n x, y = map(int, input().split())\r\n mark_up_ope[x-1] += 1\r\n mark_up_ope[y] -= 1\r\n\r\nmemo = 0\r\nfor i in range(m):\r\n memo += mark_up_ope[i]\r\n ope_count[i] += memo\r\n\r\nfor i in range(m):\r\n l, r, d = ope_list[i]\r\n mark_up_arr[l] += d*ope_count[i]\r\n mark_up_arr[r] -= d*ope_count[i]\r\n\r\nmemo = 0\r\nfor i in range(n):\r\n memo += mark_up_arr[i]\r\n arr[i] += memo\r\n\r\nprint(*arr)", "n,m,k=map(int, input().split())\r\na=list(map(int, input().split()))\r\nb=[0]*(m+1)\r\nc=[0]*(n+1)\r\nbb=[]\r\nfor i in range(m):\r\n l,r,d=map(int, input().split())\r\n bb.append([l,r,d])\r\nfor i in range(k):\r\n x,y=map(int, input().split())\r\n b[x-1]+=1\r\n b[y]-=1\r\ncnt=0\r\nfor j in range(m):\r\n cnt+=b[j]\r\n bb[j][2]*=cnt\r\nfor i in range(m): \r\n c[bb[i][0]-1]+=bb[i][2]\r\n c[bb[i][1]]-=bb[i][2]\r\ncnt=0\r\nfor i in range(n):\r\n cnt+=c[i]\r\n a[i]+=cnt \r\nprint(*a) ", "# /**\r\n# * author: brownfox2k6\r\n# * created: 15/09/2023 00:04:32 Hanoi, Vietnam\r\n# **/\r\n\r\nimport sys\r\ninput = sys.stdin.readline\r\nprint = sys.stdout.write\r\n\r\nreadln = lambda: [*map(int, input().split())]\r\n\r\nclass operation:\r\n def __init__(self, l, r, d):\r\n self.l = l - 1\r\n self.r = r - 1\r\n self.d = d\r\n\r\nclass query:\r\n def __init__(self, x, y):\r\n self.x = x - 1\r\n self.y = y - 1\r\n\r\n\r\nn, m, k = readln()\r\na = readln()\r\nop = [operation(*readln()) for _ in range(m)]\r\nqu = [query(*readln()) for _ in range(k)]\r\n\r\nb = [0] * (m+1)\r\nfor q in qu:\r\n b[q.x] += 1\r\n b[q.y + 1] -= 1\r\nfor i in range(1, m+1):\r\n b[i] += b[i-1]\r\n\r\nc = [0] * (n+1)\r\nfor i, o in enumerate(op):\r\n y = b[i] * o.d\r\n c[o.l] += y\r\n c[o.r + 1] -= y\r\nfor i in range(1, n+1):\r\n c[i] += c[i-1]\r\n\r\nprint(' '.join(map(str, map(lambda i: a[i]+c[i], range(n)))))", "'''\r\n\r\nek row ya ek column select\r\n'''\r\nfrom sys import stdin\r\nfrom math import gcd\r\ndef lcm(a,b):\r\n return a*b//gcd(a,b)\r\ninput=stdin.readline\r\n# print(gp(1,1))\r\nread=lambda :map(int,input().strip().split())\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,X=read()\r\nar=list(read())\r\nam=[0]*m\r\nstar=LazySegmentTree(ar)\r\nq=[]\r\nfor i in range(m):\r\n l,r,x=read()\r\n q.append((l-1,r-1,x))\r\nstq=LazySegmentTree(am)\r\nfor i in range(X):\r\n l,r=read()\r\n l-=1\r\n r-=1\r\n stq.add(l,r+1,1)\r\nfor i in range(m):\r\n cnt=stq.query(i,i+1)\r\n val=cnt*(q[i][2])\r\n star.add(q[i][0],q[i][1]+1,val)\r\n\r\nfor i in range(n):\r\n print(star.query(i,i+1),end=\" \")\r\n\r\n", "n,m,k=map(int,input().split())\r\narr=[0]*(n+1)\r\narrr2=list(map(int,input().split()))\r\narr.append(0)\r\nopration={}\r\narr_q=[0]*(m+1)\r\nfor i in range(m):\r\n\r\n opration[i]=list(map(int,input().split()))\r\nfor i in range(k):\r\n a,b=map(int,input().split())\r\n arr_q[a-1]+=1\r\n arr_q[b]-=1\r\narr2=[arr_q[0]]\r\nfor i in range(1,len(arr_q)):\r\n arr2.append(arr2[-1]+arr_q[i])\r\nfor i in range(m):\r\n l,r,d=opration[i]\r\n val=arr2[i]\r\n arr[l-1]+=(val*d)\r\n arr[r]-=(val*d)\r\narr.pop()\r\nres=[arr[0]]\r\nfor i in range(1,len(arr)):\r\n res.append(arr[i]+res[-1])\r\n\r\nfor i in range(n):\r\n print(res[i]+arrr2[i])", "import collections\nfrom math import inf\nfrom collections import *\nimport math, os, sys, heapq, bisect, random, threading\nfrom functools import lru_cache, reduce\nfrom itertools import *\nimport statistics\nimport sys\n\n\ndef inp(): return sys.stdin.readline().rstrip(\"\\r\\n\")\n\n\ndef out(var): sys.stdout.write(str(var) + \"\\n\") # for fast output, always take string\n\n\ndef inpu(): return int(inp())\n\n\ndef lis(): return list(map(int, inp().split()))\n\n\ndef stringlis(): return list(map(str, inp().split()))\n\n\ndef sep(): return map(int, inp().split())\n\n\ndef strsep(): return map(str, inp().split())\n\n\ndef fsep(): return map(float, inp().split())\n\n\nM, M1 = 1000000007, 998244353\n\n\ndef get_divisors(n):\n a = 0\n for i in range(1, int(n / 2) + 1):\n if n % i == 0:\n a += i\n return a\n\n\ndef doop(l, r, d, a):\n l -= 1\n for i in range(l, r):\n a[i] += d\n\n\ndef main():\n #sys.stdin = open(\"test2\", 'r')\n n, m, k = sep()\n a = lis()\n p = []\n pre = [0] * m\n\n for i in range(m):\n r = lis()\n p.append(r)\n\n for i in range(k):\n x, y = sep()\n pre[x - 1] += 1\n if y <= m - 1:\n pre[y] -= 1\n for i in range(1, len(pre)):\n pre[i] += pre[i - 1]\n\n res = [0] * n\n for i in range(m):\n l, r, d = p[i]\n res[l - 1] += (d * pre[i])\n if r <= n - 1:\n res[r] -= (d * pre[i])\n\n for i in range(1, n):\n res[i] += res[i - 1]\n \n for i in range(n):\n a[i] += res[i]\n print(*a)\n\nif __name__ == '__main__':\n # sys.setrecursionlimit(1000000)\n # threading.stack_size(1024000)\n # threading.Thread(target=main).start()\n main()\n\n \t\t\t \t \t \t\t \t\t \t\t \t\t\t", "# -------\n# imports\n# -------\n\nimport sys\n\n\n# -------\n# solve\n# -------\n\ndef solve(r, w):\n \"\"\"\n :param r:\n :param w:\n :return:\n \"\"\"\n data = r.readline().split()\n num_elems = int(data[0])\n num_ops = int(data[1])\n num_queries = int(data[2])\n\n elem_list = [int(x) for x in r.readline().split()]\n a = [0] * (num_ops + 1)\n b = [0] * (num_elems + 1)\n\n # get operations\n op_list = []\n for _ in range(num_ops):\n op_list.append(tuple([int(x) for x in r.readline().split()]))\n\n for _ in range(num_queries):\n query = [int(x) for x in r.readline().split()]\n a[query[0] - 1] += 1\n a[query[1]] -= 1\n\n c = 0\n for i, cur_op in enumerate(op_list):\n cur_op = op_list[i]\n c += a[i]\n b[cur_op[0] - 1] += c * cur_op[2]\n b[cur_op[1]] -= c * cur_op[2]\n\n c = 0\n for i, elem in enumerate(elem_list):\n c += b[i]\n print(elem + c, end=' ')\n\n\n# -------\n# main\n# -------\n\nif __name__ == \"__main__\":\n solve(sys.stdin, sys.stdout)\n", "import sys\r\nfrom collections import Counter\r\nimport math\r\nfrom typing import NamedTuple\r\n\r\n\r\ndef prefix_sum(prefix_arr):\r\n for i in range(1, len(prefix_arr)):\r\n prefix_arr[i] = prefix_arr[i - 1] + prefix_arr[i]\r\n\r\n\r\nclass Operation(NamedTuple):\r\n l: int\r\n r: int\r\n d: int\r\n\r\n\r\ndef main():\r\n read = sys.stdin.readline\r\n n, m, k = (int(i) for i in read().split())\r\n values: list[int] = [int(i) for i in read().split()]\r\n operations: dict[int, Operation] = {}\r\n for i in range(m):\r\n idx = i + 1\r\n l, r, d = (int(i) for i in read().split())\r\n operations[idx] = Operation(l, r, d)\r\n\r\n # Compute the number of times each operation needs to be executed\r\n prefix_operations = [0] * (m + 2)\r\n for i in range(k):\r\n x, y = (int(i) for i in read().split())\r\n prefix_operations[x] += 1\r\n # Only affect the subrange from x .. y\r\n prefix_operations[y + 1] -= 1\r\n prefix_sum(prefix_operations)\r\n\r\n # Compute the number of values to add to the originala rray using the same method\r\n prefix_result = [0] * (n + 2)\r\n for i in range(1, len(prefix_operations) - 1):\r\n operation = operations.get(i)\r\n change = operation.d * prefix_operations[i]\r\n prefix_result[operation.l] += change\r\n prefix_result[operation.r + 1] -= change\r\n prefix_sum(prefix_result)\r\n\r\n for i in range(n):\r\n values[i] += prefix_result[i + 1]\r\n\r\n print(' '.join((str(i) for i in values)))\r\n\r\n\r\nif __name__ == '__main__':\r\n main()", "n,m,k = list(map(int, input().split()))\r\nl = list(map(int, input().split()))\r\nmq = [[0, 0, 0]]\r\nfor i in range(m):\r\n\tmq.append(list(map(int, input().split())))\r\n\r\nquery_add = [0]*(m+2)\r\nfor i in range(k):\r\n\tx,y = list(map(int, input().split()))\r\n\tquery_add[y+1] -= 1\r\n\tquery_add[x] += 1\r\nlast = 0\r\nfor i in range(m+2):\r\n\tlast += query_add[i]\r\n\tquery_add[i] = last\r\nfor i in range(1, m+1):\r\n\tmq[i][2] *= query_add[i]\r\nrange_add = [0]*(n+1)\r\nfor i in mq[1:]:\r\n\trange_add[i[0]-1] += i[2]\r\n\trange_add[i[1]] -= i[2]\r\nlast = 0\r\n# print(range_add)\r\nfor i in range(n):\r\n\tlast += range_add[i]\r\n\tl[i] += last\r\nprint(*l)", "#!/usr/bin/env python3\nimport os\nimport sys\nfrom io import BytesIO, IOBase\n\nsys.stdout, stream = IOBase(), BytesIO()\nsys.stdout.flush = lambda: os.write(1, stream.getvalue()) and not stream.truncate(0) and stream.seek(0)\nsys.stdout.write = lambda s: stream.write(s.encode())\n\nnumbers = []\n\nnum, sign = 0, True\nfor char in os.read(0, os.fstat(0).st_size):\n if char >= 48:\n num = num * 10 + char - 48\n elif char == 45:\n sign = False\n elif char != 13:\n numbers.append(num if sign else -num)\n num, sign = 0, True\n\nif char >= 48:\n numbers.append(num if sign else -num)\n\ngetnum = iter(numbers).__next__\n\n\ndef main():\n n, m, k = getnum(), getnum(), getnum()\n a = [getnum() for _ in range(n)]\n ops = [[getnum(), getnum(), getnum()] for _ in range(m)]\n\n op_diff = [0] * m\n for _ in range(k):\n x, y = getnum(), getnum()\n op_diff[x - 1] += 1\n if y < m:\n op_diff[y] -= 1\n\n cnt, diff = 0, [0] * n\n for i, (l, r, d) in zip(op_diff, ops):\n cnt += i\n diff[l - 1] += cnt * d\n if r < n:\n diff[r] -= cnt * d\n\n cnt = 0\n for i, d in enumerate(diff):\n cnt += d\n a[i] += cnt\n\n print(*a)\n\n\nif __name__ == '__main__':\n main()\n", "n, m, k = map(int, input().split())\narr = list(map(int, input().split()))\n\nops = []\nfor i in range(m):\n l, r, d = map(int, input().split())\n ops.append((l, r, d))\nqueries = []\nfor i in range(k):\n x, y = map(int, input().split())\n queries.append((x, y))\n\ndiff = [0] * (m + 1)\nfor x, y in queries:\n diff[y] -= 1\n diff[x - 1] += 1\nfor i in range(1, m):\n diff[i] += diff[i - 1]\n\nsol = [0] * n\nfor i in range(m):\n l, r, d = ops[i]\n sol[l - 1] += diff[i] * d\n if n > r:\n sol[r] -= diff[i] * d\n\nfor i in range(1, n):\n sol[i] += sol[i - 1]\nfor i in range(n):\n sol[i] += arr[i]\n\nprint(*sol)\n", "# much faster!!\r\nn, m, k = map(int, input().split());\r\narr = list(map(int, input().split()));\r\nop = {}\r\npre = [0] * (m + 1)\r\nfor i in range(m):\r\n x = list(map(int, input().split()))\r\n op[i] = x\r\n\r\nfor i in range(k):\r\n st, end = map(int, input().split())\r\n pre[st - 1] += 1\r\n pre[end] -= 1\r\nfor i in range(m):\r\n pre[i + 1] += pre[i]\r\n\r\narr2 = [0] * (n + 1)\r\nfor i in range(m):\r\n l, r, pl = op[i]\r\n arr2[l - 1] += pl * pre[i]\r\n arr2[r] -= pl * pre[i]\r\n\r\nfor i in range(n):\r\n arr2[i + 1] += arr2[i]\r\n\r\nfor i in range(n):\r\n print(arr[i] + arr2[i], end=\" \")\r\n", "n, m, k = [int(x) for x in input().split()]\r\na = [int(c) for c in input().split()]\r\nq = [0]#stores the ranges and increment l, r, d\r\nfor query in range(m):\r\n q.append([int(x) for x in input().split()])\r\n\r\nrng = [0] * (m + 2)\r\nfor i in range(k):\r\n x, y = [int(x) for x in input().split()]\r\n rng[x] += 1\r\n rng[y + 1] -= 1\r\nfor i in range(1, len(rng)):\r\n rng[i] += rng[i - 1]\r\ndiff = [0] * (n + 1)\r\ndiff[0] = a[0]\r\nfor i in range(1, n):\r\n diff[i] = a[i] - a[i - 1]\r\n\r\nfor i in range(1, m + 1):\r\n times = rng[i]\r\n query = q[i]\r\n l, r, d = query\r\n diff[l - 1] += (times * d)\r\n diff[r] -= (times * d)\r\n\r\nans = [0] * n\r\nans[0] = diff[0]\r\nfor i in range(1, n):\r\n ans[i] = ans[i - 1] + diff[i]\r\n\r\nprint(*ans)\r\n", "n, m, k = map(int, input().split())\n\narr = list(map(int, input().split()))\n\noperations = []\n\nfor _ in range(m):\n operations.append(list(map(int, input().split())))\n\nops = [0]*(m+1)\n\nfor _ in range(k):\n x,y = map(int, input().split())\n ops[x-1]+=1\n ops[y]-=1\n\ndiffArr = [0]*(n+1)\n\nsum = 0\nfor i in range(len(operations)):\n sum+=ops[i]\n l, r, d = operations[i]\n diffArr[l-1]+=d*sum\n diffArr[r]-=d*sum\n\nsum = 0\nfor i in range(n):\n sum+=diffArr[i]\n print(sum+arr[i], end=' ')\nprint()\n \t \t \t\t \t \t \t\t \t \t \t\t\t \t", "#######################################################################################################################\r\n# Author: BlackFyre\r\n# Language: PyPy 3.7\r\n#######################################################################################################################\r\n \r\nfrom sys import stdin, stdout, setrecursionlimit\r\nfrom math import floor, gcd, fabs, factorial, fmod, sqrt, inf, log, log2\r\nfrom random import seed, randint\r\nfrom datetime import datetime\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\nfrom collections import defaultdict as dd\r\nmod = pow(10, 9) + 7\r\nmod2 = 998244353\r\n# setrecursionlimit(3000)\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 smp(): return map(str, 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 remadd(x, y): return 1 if x % y else 0\r\ndef ceil(a, b): return (a + b - 1) // b\r\ndef def_value(): return 0\r\ndef def_inf(): return inf\r\n\r\nn,m,k = mp()\r\na = lmp()\r\nop = []\r\nfor i in range(m):\r\n l,r,d = mp()\r\n op.append((l,r,d))\r\n\r\nc = l1d(m+2)\r\nb = l1d(n+2)\r\nfor i in range(k):\r\n x,y = mp()\r\n c[x]+=1\r\n c[y+1]-=1\r\n\r\nfor i in range(1,m+1):\r\n c[i] += c[i-1]\r\n \r\nfor i in range(1,m+1):\r\n l,r,d = op[i-1][0], op[i-1][1], op[i-1][2]\r\n b[l]+=d*c[i]\r\n b[r+1]-=d*c[i]\r\n \r\nfor i in range(1,n+1):\r\n b[i]+=b[i-1]\r\n\r\nfor i in range(n):\r\n a[i]+=b[i+1]\r\n \r\nprint(*a)", "\r\ndef solve():\r\n n, m, k = map(int, input().split())\r\n a = list(map(int, input().split()))\r\n ops = [list(map(int, input().split())) for i in range(m)]\r\n ops_count = [0] * m\r\n\r\n for _ in range(k):\r\n x, y = map(int, input().split())\r\n ops_count[x - 1] += 1\r\n if y < m:\r\n ops_count[y] -= 1\r\n\r\n for i in range(1, m):\r\n ops_count[i] += ops_count[i - 1]\r\n\r\n b = [0] * n\r\n for i in range(m):\r\n l, r, d = ops[i]\r\n b[l - 1] += d * ops_count[i]\r\n if r < n:\r\n b[r] -= d * ops_count[i]\r\n\r\n for i in range(1, n):\r\n b[i] += b[i - 1]\r\n\r\n for i in range(0, n):\r\n b[i] += a[i]\r\n\r\n print(\" \".join(str(ai) for ai in b))\r\nsolve()", "n, m, k = map(int, input().split())\r\n\r\na = list(map(int, input().split()))\r\nopers = tuple(tuple(map(int, input().split())) for _ in range(m))\r\n\r\noper_list = [0] * (m + 1)\r\nfor i in range(k):\r\n x, y = map(int, input().split())\r\n oper_list[x - 1] += 1\r\n oper_list[y] -= 1\r\n\r\nds = [0] * (n + 1)\r\ncnt = 0\r\nfor i in range(m):\r\n l, r, d = opers[i]\r\n cnt += oper_list[i]\r\n ds[l - 1] += d * cnt\r\n ds[r] -= d * cnt\r\n\r\ncnt = 0\r\nfor i in range(n):\r\n cnt += ds[i]\r\n a[i] += cnt\r\n\r\nprint(\" \".join(str(i) for i in a))\r\n", "import time\r\nimport os,sys\r\nfrom datetime import datetime\r\nfrom math import floor,sqrt,gcd,factorial,ceil,log2\r\nfrom collections import Counter,defaultdict as dd\r\nimport bisect\r\nfrom itertools import chain\r\nfrom collections import deque\r\nfrom sys import maxsize as INT_MAX\r\nfrom itertools import permutations\r\nfrom collections import deque\r\nfrom functools import lru_cache\r\nimport threading\r\nfrom heapq import *\r\nfrom functools import cmp_to_key\r\nfrom io import BytesIO, IOBase\r\n'''Dont use setrecursionlimit in pypy'''\r\n#sys.setrecursionlimit(int(1e9))\r\n#threading.stack_size(0x2000000)\r\nONLINE_JUDGE,INF,mod=False,float('inf'),int(1e9)+7\r\nif os.path.exists('D:\\\\vimstuff'):\r\n\tONLINE_JUDGE=True\r\n\tsys.stdin=open('D:\\\\vimstuff\\\\inp.txt','r')\r\n\tsys.stdout=open('D:\\\\vimstuff\\\\out.txt','w')\r\n\r\nBUFSIZE: int = 8192\r\ndef readint():\r\n\treturn int(sys.stdin.readline())\r\ndef readstr():\r\n\treturn sys.stdin.readline()\r\ndef readlst():\r\n\treturn list(map(int, sys.stdin.readline().strip().split()))\r\ndef readmul():\r\n\treturn map(int, sys.stdin.readline().strip().split())\r\ndef mulfloat():\treturn map(float, sys.stdin.readline().strip().split())\r\ndef flush():\r\n\treturn sys.stdout.flush()\r\ndef power_two(x):\r\n\treturn (1<<x)\r\ndef lcm(a,b):\r\n\treturn a*b//gcd(a,b)\r\n\r\ndef countGreater(arr,n, k):\r\n\tl = 0\r\n\tr = n - 1\r\n\tleftGreater = n\r\n\twhile (l <= r):\r\n\t\tm = int(l + (r - l) / 2)\r\n\t\tif (arr[m] >= k):\r\n\t\t\tleftGreater = m\r\n\t\t\tr = m - 1\r\n\t\telse:\r\n\t\t\tl = m + 1\r\n\t\t\treturn (n - leftGreater)\r\n\r\ndef lower_bound(arr,n,val):\r\n\tl,r=-1,n\r\n\twhile r>l+1:\r\n\t\tm=int((l+r)>>1)\r\n\t\tif arr[m]<val:\r\n\t\t\tl=m\r\n\t\telse:\r\n\t\t\tr=m\r\n\treturn r\r\n\r\ndef upper_bound(arr,n,val):\r\n\tl,r=-1,n\r\n\twhile r>l+1:\r\n\t\tm=int((l+r)>>1)\r\n\t\tif arr[m]<=val:\r\n\t\t\tl=m\r\n\t\telse:\r\n\t\t\tr=m\r\n\treturn l\r\n\r\ndef binpow(a,n,mod):\r\n\tres=1\r\n\twhile n:\r\n\t\tif n&1:\r\n\t\t\tres=(res*a)%mod\r\n\t\t\tn-=1\r\n\t\ta=(a*a)%mod\r\n\t\tn=n>>1\r\n\treturn res\r\n\r\ndef printmat(l,seperate=True):\r\n\tfor i in range(0,len(l)):\r\n\t\tif(seperate):\r\n\t\t\tprint(*l[i],sep=\" \")\r\n\t\telse:\r\n\t\t\tprint(*l[i],sep=\"\")\r\n\r\ndef is_perfect_square(num):\r\n\t#print(num)\r\n\ttemp = num**(0.5)\r\n\t#print(temp)\r\n\treturn (temp//1)==temp\r\n\r\ndef find(res):\r\n\tn1=res\r\n\twhile par[n1]!=n1:\r\n\t\tpar[n1]=par[par[n1]]\r\n\t\tn1=par[n1]\r\n\treturn n1\r\n\r\ndef union(u,v):\r\n\tp1,p2=find(u),find(v)\r\n\tif p1==p2:\r\n\t\treturn 0\r\n\tif(rank[p1]>rank[p2]):\r\n\t\tp1,p2=p2,p1\r\n\tpar[p1]=p2\r\n\trank[p2]+=rank[p1]\r\n\treturn 1\r\n\r\n#Fibonaci logn implementation gives current and next fibonnaci number\r\ndef fibonac(n):\r\n\tif n==0:\r\n\t\treturn (0,1)\r\n\tnb2,nb2p1=fibonac(n//2)\r\n\t#print(nb2)\r\n\t#print(nb2p1)\r\n\ta=nb2*(2*nb2p1-nb2)\r\n\tb=nb2p1*nb2p1+nb2*nb2\r\n\tif n&1==0:\r\n\t\treturn (a,b)\r\n\telse:\r\n\t\treturn (b,a+b)\r\n\r\ndef euler_totient(n):\r\n\tres=n\r\n\tfor i in range(2,int(sqrt(n))+1):\r\n\t\tif res%i==0:\r\n\t\t\twhile n%i==0:\r\n\t\t\t\tn=n//i\r\n\r\n\t\t\tres=res-res//i\r\n\tif n>1:\r\n\t\tres=res-res//n\r\n\treturn res\r\n\r\ndef custom_ceil(a,b):\r\n\treturn (a+b-1)//b\r\n\r\ndef iter_dfs(node,comp):\r\n\tstk=[node]\r\n\tvis=[False]*(comp+1)\r\n\twhile len(stk):\r\n\t\tnode=stk[-1]\r\n\t\tvis[node]=True\r\n\t\tstk=stk[:-1]\r\n\t\tfor child in graph[node]:\r\n\t\t\tif child==comp:\r\n\t\t\t\treturn True\r\n\t\t\tif vis[child]==False:\r\n\t\t\t\tvis[child]=True\r\n\t\t\t\tstk.append(child)\r\n\treturn False\r\n\r\n'''\r\n1. Implement after understanding properly don't do in vain.\r\n2. Check corner cases.\r\n3. Use python if there is recursion.\r\n4. Use pypy if heavy loop,list slice.\r\n5. If you don't want to alter string do not use list costly.\r\n'''\r\nmaxN=200000\r\n#maxN=100\r\n\r\ndef john_3_16(cnter):\r\n\tn,m,k=readmul()\r\n\ta=readlst()\r\n\tq=[]\r\n\tpre=[0]*(m+3)\r\n\tpre1=[0]*(n+3)\r\n\tfor _ in range(m):\r\n\t\tl,r,d=readmul()\r\n\t\tq.append([l,r,d])\r\n\tfor _ in range(k):\r\n\t\tl,r=readmul()\r\n\t\tpre[l]+=1\r\n\t\tpre[r+1]-=1\r\n\tfor i in range(1,m+3):\r\n\t\tpre[i]+=pre[i-1]\r\n\tfor i in range(len(q)):\r\n\t\tl,r,d=q[i]\r\n\t\tpre1[l]+=d*pre[i+1]\r\n\t\tpre1[r+1]=pre1[r+1]-d*pre[i+1]\r\n\tfor i in range(1,n+1):\r\n\t\tpre1[i]+=pre1[i-1]\r\n\tfor i in range(1,n+1):\r\n\t\ta[i-1]=pre1[i]+a[i-1]\r\n\tprint(*a)\r\n\treturn\r\n\r\ndef main():\r\n\ttc=1\r\n\t#tc=readint()\r\n\tstart=time.time()\r\n\tcnt=1\r\n\twhile tc:\r\n\t\tjohn_3_16(cnt)\r\n\t\t#john_3_16()\r\n\t\ttc-=1\r\n\t\tcnt+=1\r\n\tif ONLINE_JUDGE:\r\n\t\tprint(f'{(time.time()-start)*1000}ms')\r\n\t\tpass\r\nmain()\r\n\r\n", "#!/usr/bin/env python3\n# created : 2020. 8. 19. 00:08\n\nimport os\nfrom sys import stdin, stdout\n\n\ndef solve(tc):\n n, m, k = map(int, stdin.readline().split())\n seq = list(map(int, stdin.readline().split()))\n\n ops = []\n for i in range(m):\n ops.append(list(map(int, stdin.readline().split())))\n\n opsAcc = [0 for i in range(m+1)]\n for i in range(k):\n l, r = map(int, stdin.readline().split())\n opsAcc[l-1] += 1\n opsAcc[r] -= 1\n\n seqAcc = [0 for i in range(n+1)]\n seqAcc[ops[0][0]-1] += ops[0][2] * opsAcc[0]\n seqAcc[ops[0][1]] -= ops[0][2] * opsAcc[0]\n\n for i in range(1, m+1):\n opsAcc[i] += opsAcc[i-1]\n if i < m:\n seqAcc[ops[i][0]-1] += ops[i][2] * opsAcc[i]\n seqAcc[ops[i][1]] -= ops[i][2] * opsAcc[i]\n\n seq[0] += seqAcc[0]\n for i in range(1, n+1):\n seqAcc[i] += seqAcc[i-1]\n if i < n:\n seq[i] += seqAcc[i]\n\n print(*seq)\n\n\ntcs = 1\ntc = 1\nwhile tc <= tcs:\n solve(tc)\n tc += 1\n", "n,m,k=[int(c) for c in input().split()]\narr=[int(c) for c in input().split()]\nquery=[0]*m\noper=[0]*n\nop=[]\nfor _ in range(m):\n seq=[int(c) for c in input().split()]\n op.append(seq)\nfor _ in range(k):\n x,y=[int(c) for c in input().split()]\n query[x-1]+=1\n if y<m:\n query[y]-=1\nfor i in range(m-1):\n query[i+1]+=query[i]\nfor i in range(m):\n l=op[i][0]\n r=op[i][1]\n d=op[i][2]\n oper[l-1]+= d*query[i]\n if r<n:\n oper[r]-= d*query[i]\nfor i in range(n-1):\n oper[i+1]+=oper[i]\nfor i in range(n):\n arr[i]+=oper[i] \nprint(' '.join(list(map(str,arr))))\n\n \t \t \t\t\t \t\t\t \t\t \t \t \t", "N = int(1e5+3)\r\nn, m, k = map(int, input().split())\r\narr = list(map(int, input().split()))\r\nqueries = list((0, 0, 0) for _ in range(N))\r\nrepetition = list((0, 0) for _ in range(N))\r\nfor i in range(m):\r\n a, b, c = map(int, input().split())\r\n queries[i] = (a, b, c)\r\nfor i in range(k):\r\n x, y = map(int, input().split())\r\n repetition[i] = (x, y)\r\ncum_op = [0] * N\r\nfor i in range(k):\r\n cum_op[repetition[i][0] - 1] += 1\r\n cum_op[repetition[i][1]] -= 1\r\nfor i in range(1, m):\r\n cum_op[i] += cum_op[i-1]\r\nres_add = [0] * N\r\nfor i in range(m):\r\n res_add[queries[i][0] - 1] += queries[i][2] * cum_op[i]\r\n res_add[queries[i][1]] -= queries[i][2] * cum_op[i]\r\nfor i in range(n):\r\n res_add[i] += res_add[i-1]\r\n print(arr[i] + res_add[i], end = ' ')\r\n", "n, m, k = map(int, input().strip().split())\r\na=[int(i) for i in input().split()]\r\nl=[0]*m\r\nr=[0]*m\r\nd=[0]*m\r\nj=m+1\r\narr=[0]*j\r\nfor i in range(m):\r\n t,o,v=map(int,input().strip().split())\r\n l[i]=t\r\n r[i]=o\r\n d[i]=v\r\nwhile k>0:\r\n x,y=map(int,input().strip().split())\r\n x-=1\r\n y-=1\r\n pp=arr[x]\r\n uu=arr[y+1]\r\n arr[x]=pp+1\r\n arr[y+1]=uu-1\r\n k-=1\r\nfor i in range(1,m):\r\n ss=arr[i]\r\n arr[i]=ss+arr[i-1]\r\narr1=[0]*(n+1)\r\nfor i in range(m):\r\n mm=l[i]\r\n nn=r[i]\r\n mm-=1\r\n nn-=1\r\n arr1[mm]+=arr[i]*d[i]\r\n arr1[nn+1]-=arr[i]*d[i]\r\nfor i in range(1,n):\r\n hh=arr1[i]\r\n arr1[i]=hh+arr1[i-1]\r\nl=[0]*n\r\nfor i in range(n):\r\n l[i]=a[i]+arr1[i]\r\nprint(\" \".join(map(str,l)))", "from sys import stdin, stdout\r\n\r\nrinp = lambda: list(map(int, stdin.readline().split()))\r\n\r\nn, m, k = [int(x) for x in input().split()] \r\n\r\narr = [int(item) for item in input().split()] \r\n\r\nop_arr = [rinp() for _ in range(m)]\r\n \r\nkr_opt = [0] * (m + 1)\r\narr_opt = [0] * (n + 1)\r\n\r\nfor _ in range(k):\r\n l, r = rinp()\r\n kr_opt[l - 1] += 1\r\n kr_opt[r] -= 1\r\n \r\nfor i in range(len(kr_opt) - 1):\r\n kr_opt[i + 1] += kr_opt[i]\r\n \r\nfor i, kr in enumerate(kr_opt):\r\n if (i == m): break\r\n arr_opt[op_arr[i][0] - 1] += kr * op_arr[i][2]\r\n arr_opt[op_arr[i][1]] -= kr * op_arr[i][2]\r\n\r\nfor i in range(len(arr_opt) - 1):\r\n arr_opt[i + 1] += arr_opt[i]\r\n\r\nfor i in range(len(arr)):\r\n print(arr[i] + arr_opt[i], end=\" \")\r\n", "n, m, q = map(int, input().split())\r\narr = list(map(int, input().split()))\r\ntimes = [0]*(m+1)\r\noperations = []\r\nfor _ in range(m):\r\n operations.append(list(map(int, input().split())))\r\n \r\nfor _ in range(q):\r\n x, y = map(int, input().split())\r\n times[x-1] +=1\r\n times[y] -=1\r\n\r\nfor i in range(1, m+1):\r\n times[i] += times[i-1]\r\n\r\nres = [0]*(n+1)\r\nfor i in range(m):\r\n res[operations[i][0]-1] += operations[i][2]*times[i]\r\n res[operations[i][1]] -= operations[i][2]*times[i]\r\n \r\n \r\nfor i in range(1, n):\r\n res[i] += res[i-1]\r\n\r\nfor i in range(n):\r\n print(arr[i] + res[i], end = ' ')", "n, m, k = map(int, input().split())\na = list(map(int, input().split()))\n\nops = [list(map(int, input().split())) for _ in range(m)]\n\noperations = [0] * m\nfor _ in range(k):\n x, y = map(int, input().split())\n operations[x - 1] += 1\n if y < m:\n operations[y] -= 1\n\nfor i in range(1, m):\n operations[i] += operations[i - 1]\n\ndelta = [0] * (n + 1)\nfor i in range(m):\n l, r, d = ops[i]\n delta[l - 1] += d * operations[i]\n if r < n:\n delta[r] -= d * operations[i]\n\nfor i in range(1, n):\n delta[i] += delta[i - 1]\n\nfor i in range(n):\n a[i] += delta[i]\n\nprint(*a)\n\n\t\t\t\t \t\t \t \t\t\t\t\t \t\t\t\t\t \t \t\t", "import math\r\nimport sys\r\nt=1\r\ndef inp(): return sys.stdin.readline().strip()\r\nfor _ in range(t):\r\n n,m,k=map(int, inp().split())\r\n a=list(map(int,inp().split()))\r\n ops=[0]\r\n for i in range(m):\r\n l,r,d=map(int,inp().split())\r\n ops.append([l,r,d])\r\n query=[0]*(m+1)\r\n for i in range(k):\r\n q1,q2=map(int, inp().split())\r\n query[q1]+=1\r\n if(q2+1<=m):\r\n query[q2+1]-=1\r\n summ=0\r\n for i in range(1,m+1):\r\n summ+=query[i]\r\n query[i]=summ\r\n aa=[0]*n\r\n for i in range(1,m+1):\r\n op=ops[i]\r\n l=op[0]\r\n r=op[1]\r\n d=op[2]\r\n aa[l-1]+=d*query[i]\r\n if(r<n):\r\n aa[r]-=d*query[i]\r\n summ=0\r\n for i in range(n):\r\n summ+=aa[i]\r\n aa[i]=summ\r\n for i in range(n):\r\n a[i]=a[i]+aa[i]\r\n print(*a)\r\n \r\n \r\n \r\n \r\n ", "import random, math\nfrom copy import deepcopy as dc\n\n\n\n# Function to call the actual solution\ndef solution(li, que, kque):\n\tout = [0]* len(li)\n\tquem = [0]*len(que)\n\n\t# Marking all the queries\n\t# which are to be performed\n\tfor i in range(len(kque)):\n\t\tq = kque[i]\n\t\tquem[q[0]-1] += 1\n\t\tif q[1] != len(quem):\n\t\t\tquem[q[1]] -= 1\n\n\t# Making the prefix sum \n\tfor i in range(1, len(que)):\n\t\tquem[i] = quem[i] + quem[i-1]\n\n\t# Now Performing the queries\n\tfor i in range(len(que)):\n\t\tq = que[i]\n\t\tout[q[0]-1] += q[2]*quem[i]\n\t\t# print(q[1])\n\t\tif q[1] != len(out):\n\t\t\tout[q[1]] -= q[2]*quem[i]\n\n\t# Making the prefix sum\n\tfor i in range(1, len(out)):\n\t\tout[i] = out[i] + out[i-1]\n\n\t# Now adding the actual array\n\tfor i in range(len(out)):\n\t\tout[i] += li[i]\n\treturn out\n\n\n# Function to take input\ndef input_test():\n\tn, m, k = map(int, input().strip().split(\" \"))\n\tli = list(map(int, input().strip().split(\" \")))\n\tque = []\n\t\n\tfor i in range(m):\n\t\tque.append(list(map(int, input().strip().split(\" \"))))\n\tkque = []\n\tfor i in range(k):\n\t\tkque.append(list(map(int, input().strip().split(\" \"))))\n\tout = solution(li, que, kque)\n\tprint(' '.join(list(map(str, out))))\n\n\n# Function to check test my code\ndef test():\n\tpass\n\n\ninput_test()\n# test()", "import io,os\r\ninput = io.BytesIO(os.read(0,os.fstat(0).st_size)).readline\r\nn,m,k=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nop=[]\r\nfor i in range(m):\r\n op.append(list(map(int,input().split())))\r\nkk=[]\r\nfor i in range(k):\r\n kk.append(list(map(int,input().split())))\r\nda1=[0]*(1+m)\r\nfor s,e in kk:\r\n da1[s]+=1\r\n if e+1 < m+1:\r\n da1[e+1]-=1\r\nr=0\r\nfor i in range(1,m+1):\r\n r+=da1[i]\r\n op[i-1][2]*=r\r\nda2=[-1]+[l[0]]\r\nfor i in range(n-1):\r\n da2.append(l[i+1]-l[i])\r\nfor s,e,w in op:\r\n da2[s]+=w\r\n if e+1 < n+1:\r\n da2[e+1]-=w\r\nr=0\r\nfor i in range(1,n+1):\r\n r+=da2[i]\r\n print(r,end=\" \")\r\n", "def vals(): return map(int, input().split())\r\nn, m, k = vals(); arr = list(vals()); op = []; q = [0] * (int(1e5)+100); pre = [0] * (int(1e5)+100); s = 0 \r\nfor i in range(m):op.append(vals())\r\nfor i in range(k):x, y = vals(); q[x-1] += 1; q[y] -= 1\r\nfor i in range(m):s += q[i]; l, r, d = op[i]; pre[l-1] += d * s; pre[r] -= d * s\r\ns = 0 \r\nfor i in range(n):s += pre[i]; arr[i] += s\r\nprint(*arr)\r\n", "n, m, k = list(map(int,input().split()))\nnums = list(map(int,input().split()))\nnums.append(0)\nbums = [0]*len(nums)\ntums = [0]*(m+1)\nopps = {}\n\nfor i in range(m):\n a,b,c = list(map(int,input().split()))\n opps[i] = (c,a,b)\n\nfor _ in range(k):\n x,y = list(map(int, input().split()))\n tums[x-1]+=1\n tums[y]-=1\n\n\n\nbums[opps[0][1]-1]+=tums[0]*opps[0][0]\nbums[opps[0][2]] -= tums[0]*opps[0][0]\nfor i in range(1,m):\n tums[i]+=tums[i-1]\n bums[opps[i][1]-1]+=tums[i]*opps[i][0]\n bums[opps[i][2]] -= tums[i] * opps[i][0]\n \nprint(nums[0]+bums[0],end=' ')\nfor i in range(1,n):\n bums[i] += bums[i-1]\n print(nums[i]+bums[i], end = ' ')\n\n\n\n\n", "n,m,k = map(int,input().split())\r\na = list(map(int,input().split()))\r\nops = [list(map(int,input().split())) for _ in range(m)]\r\nqus = [list(map(int,input().split())) for _ in range(k)]\r\nstarts = [0]*(m+1)\r\nfor l,r in qus:\r\n starts[l-1] += 1\r\n starts[r] -= 1\r\nopcount = [0]*m\r\nactive = 0\r\nfor i in range(m):\r\n active += starts[i]\r\n opcount[i] = active\r\nsuffixOffset = [0]*(n+1)\r\nfor i in range(m):\r\n l,r,d = ops[i]\r\n suffixOffset[l-1] += opcount[i]*d\r\n suffixOffset[r] -= opcount[i]*d\r\nactive = 0\r\nfor i in range(n):\r\n active += suffixOffset[i]\r\n a[i] += active\r\nprint(*a)", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn, m, k = map(int, input().split())\r\nw = list(map(int, input().split()))\r\ng = [list(map(int, input().split())) for _ in range(m)]\r\n\r\nd = [0]*(m+1)\r\nfor _ in range(k):\r\n x, y = map(int, input().split())\r\n d[x-1] += 1\r\n d[y] -= 1\r\n\r\nc = 0\r\nd1 = [0]*(n+1)\r\nfor i in range(m):\r\n c += d[i]\r\n x = c*g[i][2]\r\n d1[g[i][0]-1] += x\r\n d1[g[i][1]] -= x\r\n\r\nc1 = 0\r\nfor i in range(n):\r\n c1 += d1[i]\r\n w[i] += c1\r\n\r\nprint(' '.join(map(str, w)))", "\r\nfrom sys import stdin, stdout\r\n# output\r\ndef out(*args):\r\n for arg in args:\r\n stdout.write(str(arg))\r\n# read line of input\r\ndef line():\r\n return stdin.readline().strip()\r\n# read in ints on a line\r\ndef ints():\r\n return list(map(int, line().split()))\r\nimport copy\r\n# create array & fill it\r\ndef arr(length, default=0):\r\n return [copy.deepcopy(default) for _ in range(length)]\r\ndef powmod(a, b, m):\r\n ans = 1\r\n while b > 1:\r\n a %= m\r\n if b % 2:\r\n ans = (ans * a) % m\r\n a *= a\r\n b //= 2\r\n return ans * a**b % m\r\n\r\ndef testcases():\r\n t, = ints()\r\n for i in range(t):\r\n yield i\r\n\r\ndef stringify(v, delim=\" \"):\r\n if isinstance(v, list):\r\n return delim.join(stringify(x) for x in v)\r\n return str(v)\r\n\r\ndef prefixSums(values):\r\n sums = [values[0]]\r\n for x in values[1:]:\r\n sums.append(sums[-1] + x)\r\n return sums\r\n\r\ndef main():\r\n N, M, K = ints()\r\n nums = ints()\r\n operations = [ints() for _ in range(M)]\r\n \r\n opCountChanges = arr(M + 1)\r\n for _ in range(K):\r\n xi, yi = ints()\r\n xi -= 1\r\n yi -= 1\r\n opCountChanges[xi] += 1\r\n opCountChanges[yi + 1] -= 1\r\n opCounts = prefixSums(opCountChanges[:-1])\r\n\r\n numsChanges = arr(N + 1)\r\n for op in range(M):\r\n l, r, d = operations[op]\r\n count = opCounts[op]\r\n l -= 1\r\n r -= 1\r\n numsChanges[l] += d * count\r\n numsChanges[r + 1] -= d * count\r\n numsDiff = prefixSums(numsChanges[:-1])\r\n nums = [a + b for a, b in zip(nums, numsDiff)]\r\n \r\n print(stringify(nums))\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\nif \"__main__\" == __name__:\r\n main()\r\n", "first_line = [int(num) for num in input().split()]\nn = first_line[0]\nm = first_line[1]\nk = first_line[2]\n\ninitial_array = [int(num) for num in input().split()]\n\noperations = []\n\nfor _ in range(m):\n curr_line = [int(num) for num in input().split()]\n operations.append(curr_line)\n\nqueries = []\nfor _ in range(k):\n curr_line = [int(num) for num in input().split()]\n queries.append(curr_line)\n\ncounter = [0] * (m+1)\n\nfor query in queries:\n x = query[0]\n y = query[1]\n counter[x-1] += 1\n counter[y] -= 1\n\nres = 0\nother = [0] * (n+1)\n\nfor index in range(m):\n operation = operations[index]\n l = operation[0]\n r = operation[1]\n d = operation[2]\n res += counter[index]\n other[l-1] += res*d\n other[r] -= res*d\n\nres = 0\nfor index in range(n):\n res += other[index]\n initial_array[index] += res\n\nprint(\" \".join(str(value) for value in initial_array))", "import sys\r\n\r\nclass Op:\r\n def __init__(self, l, r, d):\r\n self.l = l\r\n self.r = r\r\n self.d = d\r\n\r\ndef main():\r\n line = input().split()\r\n n, m, k = int(line[0]), int(line[1]), int(line[2])\r\n \r\n line = input().split()\r\n arr = [int(line[i]) for i in range(n)]\r\n\r\n ops = []\r\n for i in range(m):\r\n line = input().split()\r\n l, r, d = int(line[0])-1, int(line[1])-1, int(line[2])\r\n ops.append(Op(l, r, d))\r\n \r\n opDiffs = [0] * (m+1)\r\n for i in range(k):\r\n line = input().split()\r\n x, y = int(line[0])-1, int(line[1])-1\r\n opDiffs[x] += 1\r\n opDiffs[y+1] -= 1\r\n\r\n arrDiffs = [0] * (n+1)\r\n times = 0\r\n for i in range(m):\r\n times += opDiffs[i]\r\n currOp = ops[i]\r\n arrDiffs[currOp.l] += times * currOp.d\r\n arrDiffs[currOp.r+1] -= times * currOp.d\r\n \r\n diff = 0\r\n for i in range(n):\r\n diff += arrDiffs[i]\r\n arr[i] += diff\r\n \r\n print(\" \".join(str(a) for a in arr))\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "n,m,k=map(int,input().split())\r\na=[int(q) for q in input().split()]\r\np=[]\r\nu=[0]*m\r\n\r\nfor i in range(m):\r\n r=[int(w) for w in input().split()]\r\n p.append(r)\r\n \r\nfor i in range(k):\r\n x,y=map(int,input().split())\r\n u[x-1]+=1\r\n if y<=m-1:\r\n u[y]-=1\r\nfor i in range(1,len(u)):\r\n u[i]+=u[i-1]\r\n \r\nans=[0 for i in range(n)]\r\nfor i in range(m):\r\n l,r,d=p[i]\r\n ans[l-1]+=(d*u[i])\r\n if r<=n-1:\r\n ans[r]-=(d*u[i])\r\n\r\nfor i in range(1,n):\r\n ans[i]+=ans[i-1]\r\nfor i in range(n):\r\n a[i]+=ans[i]\r\nprint(*a)", "import sys\nn,m,k = map(int,sys.stdin.readline().split())\na = list(map(int,sys.stdin.readline().split()))\naction = []\nfor i in range(m):\n l,r,v = map(int,sys.stdin.readline().split())\n action.append([l-1,r,v])\n#print(\"action = \",action)\nq = [0]*len(action)\nfor i in range(k):\n x,y = map(int,sys.stdin.readline().split())\n q[x-1] += 1\n if y in range(len(q)):\n q[y] -= 1\nadder = [0]*len(a)\nans = 0\nfor i in range(len(q)):\n ans += q[i]\n l,r,v = action[i]\n adder[l] += v*ans\n if r in range(len(adder)):\n adder[r] -= v*ans\nans = 0\nfor i in range(len(adder)):\n ans += adder[i]\n a[i] += ans\nprint(*a)\n \t\t \t\t \t\t\t\t\t\t\t\t \t\t", "import sys\r\ninput=sys.stdin.readline\r\nn,m,k=map(int,input().split())\r\nL=list(map(int,input().split()))\r\nop=[]\r\nfor _ in range(m):\r\n op.append(list(map(int,input().split())))\r\n\r\nstore1=[0]*(m+1)\r\nfor _ in range(k):\r\n a,b=map(int,input().split())\r\n store1[a-1]+=1\r\n store1[b]-=1\r\nstore2=[0]*(n+1)\r\ncur=0\r\nfor i in range(m):\r\n cur+=store1[i]\r\n store2[op[i][1]]-=op[i][2]*cur\r\n store2[op[i][0]-1]+=op[i][2]*cur\r\ncur=0\r\nfor i in range(n):\r\n cur+=store2[i]\r\n print(L[i]+cur,end=\" \")", "import bisect\r\nimport os, sys, math\r\nfrom io import BytesIO, IOBase\r\nfrom collections import defaultdict, deque\r\nip = lambda: input()\r\nit = lambda: int(input())\r\nma = lambda: map(int, input().split())\r\nli = lambda: list(map(int, input().split()))\r\n\r\nMOD = 10 ** 9 + 7\r\nMD = 998244353\r\nmod = 100007\r\nMIL = 1000000\r\ninf = float('inf')\r\nye = \"YES\"\r\nne = \"NO\"\r\n\r\ndef ncr(n, r):\r\n if r > n:\r\n return 0\r\n if r < 0:\r\n return 0\r\n if r == 0:\r\n return 1\r\n if r > n - r:\r\n return ncr(n, n - r)\r\n x = 1\r\n for i in range(1, r + 1):\r\n x = x*(n - i + 1)//i\r\n return x\r\ndef main():\r\n for _ in range(1):\r\n n, m, k = ma()\r\n a = li()\r\n o = []\r\n c = [0]*(m+1)\r\n for i in range(m):\r\n x, y, d = ma()\r\n o.append((x, y, d))\r\n for i in range(k):\r\n x, y = ma()\r\n c[x-1] += 1\r\n c[y] -= 1\r\n s = [c[0]]*(m+1)\r\n for i in range(1, m+1):\r\n s[i] = c[i] + s[i-1]\r\n zz = [0]*(n+1)\r\n for i in range(m):\r\n d = o[i][2]*s[i]\r\n x = o[i][0]\r\n y = o[i][1]\r\n zz[x-1] += d\r\n zz[y] -= d\r\n zs = [zz[0]]*(n+1)\r\n for i in range(1, n+1):\r\n zs[i] = zs[i-1] + zz[i]\r\n for i in range(n):\r\n a[i] += zs[i]\r\n print(*a)\r\n # Fast IO Region\r\nBUFSIZE = 8192\r\nclass FastIO(IOBase):\r\n newlines = 0\r\n\r\n def __init__(self, file):\r\n self._fd = file.fileno()\r\n self.buffer = BytesIO()\r\n self.writable = \"x\" in file.mode or \"r\" not in file.mode\r\n self.write = self.buffer.write if self.writable else None\r\n\r\n def read(self):\r\n while True:\r\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\r\n if not b:\r\n break\r\n ptr = self.buffer.tell()\r\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\r\n self.newlines = 0\r\n return self.buffer.read()\r\n\r\n def readline(self):\r\n while self.newlines == 0:\r\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\r\n self.newlines = b.count(b\"\\n\") + (not b)\r\n ptr = self.buffer.tell()\r\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\r\n self.newlines -= 1\r\n return self.buffer.readline()\r\n\r\n def flush(self):\r\n if self.writable:\r\n os.write(self._fd, self.buffer.getvalue())\r\n self.buffer.truncate(0), self.buffer.seek(0)\r\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\ninput = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\r\nsys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)\r\n\r\ndef nc2(n):\r\n return (n * (n - 1)) // 2\r\n\r\n\r\ndef ap_sum(a, d, n):\r\n return ((2 * a + (n - 1) * d) * n) // 2\r\n\r\n\r\ndef ncrr(n, r):\r\n if 2 * r > n:\r\n return ncr(n, n - r)\r\n x = 1\r\n for i in range(r):\r\n x = x * (n - i) // (i + 1)\r\n return x\r\n\r\n\r\ndef powerset(a):\r\n p = [[]]\r\n for i in range(len(a)):\r\n x = p.copy()\r\n for j in p:\r\n x.append(j + [a[i]])\r\n p = x\r\n return p\r\n\r\n\r\ndef segfunc(x, y):\r\n return x + y\r\n\r\n\r\nclass SegmentTree(object):\r\n def __init__(self, A, dot, unit):\r\n n = 1 << (len(A) - 1).bit_length()\r\n tree = [unit] * (2 * n)\r\n for i, v in enumerate(A):\r\n if v:\r\n #tree[i + n] = 1\r\n tree[i + n] = v\r\n for i in range(n - 1, 0, -1):\r\n tree[i] = dot(tree[i << 1], tree[i << 1 | 1])\r\n self._n = n\r\n self._tree = tree\r\n self._dot = dot\r\n self._unit = unit\r\n\r\n def __getitem__(self, i):\r\n return self._tree[i + self._n]\r\n\r\n def update(self, i, v):\r\n i += self._n\r\n self._tree[i] = v\r\n while i != 1:\r\n i >>= 1\r\n self._tree[i] = self._dot(self._tree[i << 1], self._tree[i << 1 | 1])\r\n\r\n def add(self, i, v):\r\n self.update(i, self[i] + v)\r\n\r\n def sum(self, l, r):\r\n l += self._n\r\n r += self._n\r\n l_val = r_val = self._unit\r\n while l < r:\r\n if l & 1:\r\n l_val = self._dot(l_val, self._tree[l])\r\n l += 1\r\n if r & 1:\r\n r -= 1\r\n r_val = self._dot(self._tree[r], r_val)\r\n l >>= 1\r\n r >>= 1\r\n return self._dot(l_val, r_val)\r\n\r\n\r\ndef Max_Subarray_Sum(a, n):\r\n max_so_far = -inf - 1\r\n max_ending_here = 0\r\n start = 0\r\n end = 0\r\n s = 0\r\n for i in range(0, n):\r\n max_ending_here += a[i]\r\n\r\n if max_so_far < max_ending_here:\r\n max_so_far = max_ending_here\r\n start = s\r\n end = i\r\n\r\n if max_ending_here < 0:\r\n max_ending_here = 0\r\n s = i + 1\r\n ans = [max_so_far, start, end]\r\n return ans\r\n\r\n\r\ndef Inversion_Merge(arr, left, mid, right):\r\n i = left\r\n j = mid\r\n k = 0\r\n invCount = 0\r\n temp = [0 for x in range(right - left + 1)]\r\n\r\n while (i < mid) and (j <= right):\r\n if arr[i] < arr[j]:\r\n temp[k] = arr[i]\r\n k += 1\r\n i += 1\r\n\r\n else:\r\n temp[k] = arr[j]\r\n invCount += mid - i\r\n k += 1\r\n j += 1\r\n\r\n while i < mid:\r\n temp[k] = arr[i]\r\n k += 1\r\n i += 1\r\n\r\n while j <= right:\r\n temp[k] = arr[j]\r\n k += 1\r\n j += 1\r\n\r\n k = 0\r\n for i in range(left, right + 1):\r\n arr[i] = temp[k]\r\n k += 1\r\n\r\n return invCount\r\n\r\n\r\ndef Inversion_Sum(arr, left, right):\r\n invCount = 0\r\n\r\n if right > left:\r\n mid = (right + left) // 2\r\n\r\n invCount = Inversion_Sum(arr, left, mid)\r\n invCount += Inversion_Sum(arr, mid + 1, right)\r\n invCount += Inversion_Merge(arr, left, mid + 1, right)\r\n\r\n return invCount\r\n\r\n\r\ndef Inversions(arr, n):\r\n return Inversion_Sum(arr, 0, n - 1)\r\n\r\n\r\nif __name__ == '__main__':\r\n main()", "import sys\r\ninput = sys.stdin.readline\r\nsys.setrecursionlimit(10**6)\r\n\r\n\r\n############ ---- Input Functions ---- ############\r\ndef in_int():\r\n return (int(input()))\r\n\r\n\r\ndef in_list():\r\n return (list(map(int, input().split())))\r\n\r\n\r\ndef in_str():\r\n s = input()\r\n return (list(s[:len(s) - 1]))\r\n\r\n\r\ndef in_ints():\r\n return (map(int, input().split()))\r\n\r\n\r\nn, m, k = in_ints()\r\n\r\na = [0] + in_list()\r\n\r\nmm = [[0,0,0,0]]\r\nfor xx in range(m):\r\n l,r , d = in_ints()\r\n mm.append([l,r,d,0])\r\n\r\nfor kk in range(k):\r\n x, y = in_ints()\r\n mm[x][3] +=1\r\n if y < m:\r\n mm[y+1][3]-=1\r\n\r\n\r\ncount = [0]*(n+1)\r\nfor i in range(1, m+1):\r\n mm[i][3] += mm[i-1][3]\r\n l = mm[i][0]\r\n r = mm[i][1]\r\n vv = mm[i][2]*mm[i][3]\r\n count[l] +=vv\r\n if r < n:\r\n count[r+1] -= vv\r\n\r\n# print(mm)\r\n# print(count)\r\n\r\nfor i in range(1, n+1):\r\n count[i]+=count[i-1]\r\n print(a[i] + count[i],end = ' ')\r\n\r\n\r\n\r\n\r\n", "\nn, m, k = map(int, input().split())\na = list(map(int, input().split()))\n\nopt = []\nfor _ in range(m):\n l, r, d = map(int, input().split())\n opt.append({'l': l, 'r': r, 'd': d})\n\nnumopt = [0] * (m + 2)\n\nfor _ in range(k):\n x, y = map(int, input().split())\n numopt[x] += 1\n numopt[y + 1] -= 1\n\nsummed = 0\nfor i in range(1, m + 1):\n summed += numopt[i]\n opt[i - 1]['d'] *= summed\n\nc = [0] * (n + 2)\nfor i in range(m):\n c[opt[i]['l']] += opt[i]['d']\n c[opt[i]['r'] + 1] -= opt[i]['d']\n\nsummed = 0\nfor i in range(1, n + 1):\n summed += c[i]\n print(a[i - 1] + summed, end=\" \")\n\n \t\t \t\t \t\t \t \t\t\t\t\t \t \t \t\t", "n,m,k = map(int,input().split())\r\na = list(map(int,input().split()))\r\noperations = []\r\nfor i in range(m):\r\n operations.append(list(map(int,input().split())))\r\noperations_count = [0] * (m+1)\r\nfor i in range(k):\r\n x,y = map(int,input().split())\r\n operations_count[x-1] += 1\r\n operations_count[y] -= 1\r\nfor i in range(1,m):\r\n operations_count[i] += operations_count[i-1]\r\nadd = [0] * (n+1)\r\nfor i in range(m):\r\n left, right, addition = operations[i][0], operations[i][1], operations[i][2] * operations_count[i]\r\n add[left-1] += addition\r\n add[right] -= addition\r\nfor i in range(1,n):\r\n add[i] += add[i-1]\r\nfor i in range(n):\r\n a[i] += add[i]\r\nfor i in a:\r\n print(i,end = ' ')\r\nprint('')\r\n", "#SETUP\nn,m,k = map(int, input().split())\na = [int(x) for x in (input().split())]\ncopy = a.copy()\nops = []\n\nfor i in range(m):\n ops.append(list(map(int, input().split())))\n \nq=[0]*m\nfor i in range(k):\n l,r = map(int, input().split())\n q[l-1]+=1\n if r<m:\n q[r]-=1\n\nadd = [0]*n\ns = 0\nfor i in range(m):\n s+=q[i]\n add[ops[i][0]-1]+=s*ops[i][2]\n if ops[i][1]<n:\n add[ops[i][1]]-=s*ops[i][2]\n\ns = 0\nfor i in range(n):\n s+=add[i]\n copy[i]+=s\n\nprint(*copy)\n", "from sys import stdin, stdout\n\ndef addArrays(orig, b):\n\tfor i in range(len(orig)):\n\t\torig[i] += b[i]\n\ndef multArrays(a, c):\n\tres = list()\n\tfor i in range(len(a)):\n\t\tres.append(a[i] * c)\n\treturn res\n\nsplitted = stdin.readline().split(\" \")\nn = int(splitted[0])\nm = int(splitted[1])\nk = int(splitted[2])\n\nops = list()\n\norig = [int(amit) for amit in stdin.readline().split(\" \")]\n\nops = [0] * m\nfor i in range(m):\n\trawOperation = [int(amit) for amit in stdin.readline().split(\" \")]\n\tops[i] = rawOperation;\n\njoshi = [0] * (m+1)\nfor i in range(k):\n\tquery = [int(amit) for amit in stdin.readline().split(\" \")]\n\tlBound = query[0] - 1\n\trBound = query[1] - 1\n\tjoshi[lBound] += 1\n\tjoshi[rBound + 1] -= 1\n\nprefixSum = [0] * (m+1)\nprefixSum[0] = joshi[0]\n\nfor i in range(1, len(joshi)):\n\tprefixSum[i] = prefixSum[i-1] + joshi[i]\n\nopsArray = [0] * (m + 1)\n\nexpandedOp = [0] * (n+1)\t\nfor i in range(m):\n\tcurOp = ops[i]\n\tlBound = curOp[0] - 1\n\trBound = curOp[1] - 1\n\texpandedOp[lBound] += (curOp[2]) * prefixSum[i]\n\texpandedOp[rBound + 1] -= (curOp[2]) * prefixSum[i]\n\nsecondPrefixSum = [0]*(len(orig))\nsecondPrefixSum[0] = expandedOp[0]\nfor i in range(1, n):\n\n\tsecondPrefixSum[i] = secondPrefixSum[i-1] + expandedOp[i]\n\naddArrays(orig, secondPrefixSum)\n\t\nres = \"\"\nfor item in orig:\n\tres += str(item) + \" \"\nstdout.write(res)\nexit(0)", "import sys\nimport collections\n\nONLINE_JUDGE = True\nif not ONLINE_JUDGE:\n sys.stdin = open(\"input.txt\", \"r\")\n\ndef inp(): # integer\n return(int(input()))\ndef inlt(): # lists\n return(list(map(int,input().split())))\ndef insr(): # list of characters\n s = input()\n return(list(s[:len(s) - 1]))\ndef invr(): # space seperate integers\n return(map(int,input().split()))\n\n\n\n\nn, m, k = inlt()\na = [0] * (n + 1)\n\narr = inlt()\nfor i in range(n):\n a[i] = arr[i]\n\nl, r, d = [0] * (m + 1), [0] * (m + 1), [0] * (m + 1)\n\nfor i in range(m):\n l[i], r[i], d[i] = inlt()\n\nx, y = [0] * (k + 1), [0] * (k + 1)\n\nfor i in range(k):\n x[i], y[i] = inlt()\n\nmul = [0] * (m + 1)\nfor i in range(k):\n mul[x[i] - 1] += 1\n mul[y[i]] -= 1\n\naddn = [0] * (n + 1)\nfor i in range(n):\n addn[i] = 0\n\nx = 0\nfor i in range(m):\n x += mul[i]\n dd = x * d[i]\n addn[l[i] - 1] += dd\n addn[r[i]] -= dd\n\nadd = 0\nfor i in range(n):\n add += addn[i]\n a[i] += add\n if (i > 0):\n print(\" \", end=\"\")\n print(a[i], end=\"\")\n\n\n", "import sys\n\nn, m, k = list(map(int, sys.stdin.readline().strip().split()))\nN = list(map(int, sys.stdin.readline().strip().split()))\nO = []\nQ = [0 for _ in range(1000001)]\nC = [0 for _ in range(1000001)]\n\nfor i in range(m):\n cur = list(map(int, sys.stdin.readline().strip().split()))\n O.append(cur)\n O[i][0] -= 1\n O[i][1] -= 1\n\nfor i in range(k):\n x, y = list(map(int, sys.stdin.readline().strip().split()))\n Q[y] -= 1\n Q[x-1] += 1\n\ncur = 0\nfor i in range(m):\n cur += Q[i]\n C[O[i][0]] += O[i][2] * cur\n C[O[i][1] + 1] -= O[i][2] * cur\n\n\ncur = 0\nfor i in range(n):\n cur += C[i]\n print(N[i] + cur, end = ' ')\n", "from sys import stdout as out\n\ndef solve():\n n, m, k = map(int, input().rstrip().split())\n ls = list(map(int, input().rstrip().split()))\n q = [tuple(map(int, input().rstrip().split())) for _ in range(m)]\n o = [tuple(map(int, input().rstrip().split())) for _ in range(k)]\n counter = [0 for i in range(m + 1)]\n for l, r in o:\n counter[l - 1] += 1\n counter[r] -= 1\n running = [0 for i in range(n + 1)]\n total = 0\n index = 0\n for l, r, d in q:\n total += counter[index]\n running[l - 1] += total * d\n running[r] -= total * d\n index += 1\n dp = 0\n for i in range(n):\n dp += running[i]\n out.write(str(dp + ls[i]) + \" \")\n print()\n\n\nif __name__ == '__main__':\n solve()\n", "def to_list(s):\r\n return list(map(lambda x: int(x), s.split(' ')))\r\n\r\ndef proceed_op(b,op,d,times=1):\r\n b[op[0]-1] += d*times\r\n b[op[1]] -= d*times\r\n return b\r\n\r\nn,m,k = to_list(input())\r\na = to_list(input())\r\nb = [0]*len(a)\r\nb.append(0)\r\nops = []\r\nfor i in range(m):\r\n ops.append(to_list(input()))\r\n\r\nop_nums = [0]*(m+1)\r\nfor i in range(k):\r\n op_slice = to_list(input())\r\n op_nums = proceed_op(op_nums, op_slice, 1)\r\n\r\ncurr_item = 0\r\nfor i in range(len(op_nums)):\r\n curr_item += op_nums[i]\r\n op_nums[i] = curr_item\r\n\r\nfor i in range(m):\r\n times = op_nums[i]\r\n l,r,d = ops[i]\r\n oop = (l,r)\r\n #print('before_a:',b)\r\n #print('l and r, d',l,r,d)\r\n #print('times',times)\r\n b = proceed_op(b,oop,d,times)\r\n #print('after_a:',b)\r\n\r\ncurr_item = 0\r\nfor i in range(len(b)):\r\n curr_item += b[i]\r\n b[i] = curr_item\r\n \r\nfor i in range(len(a)):\r\n a[i] += b[i]\r\n\r\nprint(' '.join(list(map(lambda x: str(x), a))))", "n, m, k = input().split()\narr = [int(i) for i in input().split()]\nsums = [0] * (int(n) + 2)\noperations = []\nfor i in range(int(m)):\n operations.append([int(x) for x in input().split()])\noperations_count = [0] * (int(m) + 2)\nfor i in range(int(k)):\n temp = input().split()\n operations_count[int(temp[0])] += 1\n operations_count[int(temp[1]) + 1] -= 1\nfor i in range(1,len(operations_count) - 1):\n operations_count[i] += operations_count[i-1]\n sums[operations[i-1][0]] += operations[i-1][2] * operations_count[i]\n sums[operations[i-1][1] + 1] -= operations[i-1][2] * operations_count[i]\nres = []\nfor i in range(1,len(sums)-1):\n sums[i] += sums[i-1]\n res.append(sums[i] + arr[i-1])\nprint(\" \".join([str(x) for x in res]))\n\t \t \t \t \t \t\t \t \t\t \t\t\t \t\t\t\t\t", "'''\r\n# Submitted By M7moud Ala3rj\r\nDon't Copy This Code, CopyRight . [email protected] © 2022-2023 :)\r\n'''\r\n# Problem Name = \"Greg and Array\"\r\n# Class: C\r\n\r\nimport sys\r\n\r\n#sys.setrecursionlimit(2147483647)\r\ninput = sys.stdin.readline\r\ndef printf(*args, end='\\n', sep=' ') -> None:\r\n sys.stdout.write(sep.join(map(str, args)) + end)\r\n\r\ndef Solve():\r\n n, m, k = list(map(int, input().split()))\r\n a = list(map(int, input().split()))\r\n ops = [list(map(int, input().split())) for i in range(m)]\r\n b = [0]*(m+1)\r\n for i in range(k):\r\n x, y = map(int, input().split())\r\n b[x-1]+=1\r\n b[y]-=1\r\n \r\n for i in range(m):\r\n b[i+1]+=b[i]\r\n \r\n ans = [0]*(n+1)\r\n for i in range(m):\r\n l, r, d = ops[i]\r\n ans[r]-=d*b[i]\r\n ans[l-1]+=d*b[i]\r\n \r\n for i in range(n):\r\n ans[i+1]+=ans[i]\r\n \r\n for i in range(n):\r\n printf(a[i]+ans[i], end=\" \")\r\n\r\nif __name__ == \"__main__\":\r\n # for t in range(int(input())):\r\n Solve()", "n,m,k=list(map(int,input().split()))\r\na=list(map(int,input().split()))\r\nb,c,p=[0]*(m+1),[0]*(n+1),[]\r\nfor i in range(m):\r\n l,r,d=list(map(int,input().split()))\r\n p.append([l,r,d])\r\nfor i in range(k):\r\n x,y=list(map(int,input().split()))\r\n b[x-1]+=1\r\n b[y]-=1\r\ncnt=0\r\nfor j in range(m):\r\n cnt+=b[j]\r\n p[j][2]*=cnt\r\nfor i in range(m): \r\n c[p[i][0]-1]+=p[i][2]\r\n c[p[i][1]]-=p[i][2]\r\ncnt=0\r\nfor i in range(n):\r\n cnt+=c[i]\r\n a[i]+=cnt \r\nprint(*a) ", "from sys import stdin\r\ndef input(): return stdin.readline().rstrip(\"\\r\\n\")\r\nn,m,k = map(int,input().split())\r\na = list(map(int,input().split()))\r\narr1 = []\r\nfor i in range(m):\r\n arr2 = list(map(int,input().split()))\r\n arr2[0]-=1\r\n arr1.append(arr2)\r\ndiff1 = [0]*(m+1)\r\nfor j in range(k):\r\n x,y = map(int,input().split())\r\n x-=1\r\n diff1[x]+=1\r\n diff1[y]-=1\r\nfor i in range(1,len(diff1)):\r\n diff1[i]+=diff1[i-1]\r\ndiff2 = [0]*(n+1)\r\nfor j in range(m):\r\n diff2[arr1[j][0]]+=arr1[j][2]*diff1[j]\r\n diff2[arr1[j][1]]-=arr1[j][2]*diff1[j]\r\nfor i in range(1,n):\r\n diff2[i]+=diff2[i-1]\r\nfor i in range(n):\r\n a[i]+=diff2[i]\r\nprint(*a)", "n,m,k=list(map(int,input().split()))\r\na=list(map(int,input().split()))\r\nl=[]\r\nfor i in range(m):\r\n l.append(list(map(int,input().split())))\r\nr=[0]*(m+1);\r\nfor i in range(k):\r\n x,y=input().split()\r\n x,y=int(x),int(y)\r\n r[x-1]+=1;\r\n r[y]-=1\r\nfor i in range(1,m):\r\n r[i]+=r[i-1]\r\nad=[0]*(n+1)\r\nfor i in range(m):\r\n ad[l[i][0]-1]+=(l[i][2]*r[i]);\r\n ad[l[i][1]]-=(l[i][2]*r[i]);\r\nfor i in range(1,n):\r\n ad[i]+=ad[i-1]\r\nfor i in range(n):\r\n print(a[i]+ad[i],end=' ')\r\n", "n,m,k=map(int, input().split())\n\na = list(map(int, input().split()))\n\n\n\nope = []\nfor _ in range(m):\n l, r, d = map(int, input().split())\n ope.append((l-1, r-1, d))\n\napp = [0 for _ in range(m)]\nfor _ in range(k):\n x, y = map(int, input().split())\n x-=1\n y -= 1\n app[x] += 1\n if y + 1 < m:\n app[y+1] -= 1\n\narr = [0]*n\n\nval = 0\n\nfor i in range(m):\n\n val += app[i]\n\n l, r, d = ope[i]\n\n arr[l] += d*val\n if r+1 < n:\n arr[r+1] -= d*val\n\nval = 0\nfor i in range(n):\n val += arr[i]\n a[i] += val\n \n\nprint(\" \".join(map(str, a)))\n\n\n", "from sys import *\n\nrd = lambda: list(map(int, stdin.readline().split()))\n\nn, m, k = rd()\na = rd()\nb = [rd() for _ in range(m)]\nx = [0]*(m+1)\ny = [0]*(n+1)\n\nfor _ in range(k):\n l, r = rd()\n x[l-1] += 1\n x[r] -= 1\n\ns = 0\nfor i in range(m):\n l, r, d = b[i]\n s += x[i]\n y[l-1] += s*d\n y[r] -= s*d\n\ns = 0\nfor i in range(n):\n s += y[i]\n a[i] += s\nprint(*a)", "int_list = lambda s: [int(n) for n in s.split(\" \")]\r\nn,m,k = int_list(input())\r\narr = int_list(input())\r\noperations = [int_list(input()) for _ in range(m)]\r\n\r\nincrs = [0]*len(arr) # Amount to increment running total when traversing arr\r\nfreq = [0]*m # The number of times the corresponding operation is used\r\n # stored in the same format as incrs\r\n\r\nfor _ in range(k):\r\n l,r = int_list(input())\r\n freq[l-1] += 1\r\n if r < len(freq): freq[r] -= 1\r\n \r\ntimes = 0 # number of times to apply current operation\r\nfor i, op in enumerate(operations):\r\n l,r,d = op\r\n times += freq[i] # update running total\r\n incrs[l-1] += times*d # encode operation in incrs\r\n if r < len(incrs): incrs[r] -= times*d\r\n \r\nprev = 0\r\nfor i,n in enumerate(arr):\r\n arr[i] = prev + n + incrs[i]\r\n prev += incrs[i]\r\n \r\nprint(\" \".join([str(n) for n in arr]))", "n, m, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\nop = [list(map(int, input().split())) for i in range(m)]\r\n\r\nval = [0] * (m+2)\r\nfor i in range(k):\r\n x, y = map(int, input().split())\r\n val[x] += 1\r\n val[y+1] -= 1\r\nval1 = [0] * (n+2)\r\nfor i in range(m):\r\n x, y, z = op[i]\r\n val[i+1] += val[i]\r\n val1[x] += val[i+1] * z\r\n val1[y+1] -= val[i+1] * z\r\nfor i in range(n):\r\n val1[i+1] += val1[i]\r\n print(a[i] + val1[i+1], end = ' ')\r\n", "n, m, k = [int(num) for num in input().split()]\nsa = input().split()\na = [0] * (n + 1)\nfor i in range(n):\n a[i+1] = int(sa[i])\nmda = [0] * (n + 1)\nfor i in range(n):\n mda[i] = a[i+1] - a[i]\nl = [0] * m\nr = [0] * m\nd = [0] * m\nfor i in range(m):\n l[i], r[i], d[i] = [int(num) for num in input().split()]\noda = [0] * (m + 1)\nfor i in range(k):\n x, y = [int(num) for num in input().split()]\n oda[x-1] += 1\n oda[y] -= 1\nopn = 0\nfor i in range(m):\n opn += oda[i]\n delta = opn * d[i]\n mda[l[i]-1] += delta\n mda[r[i]] -= delta\nrs = 0\nfor i in range(n):\n rs += mda[i]\n print(rs, end=\" \")", "n,m,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\nTemp=[0]*n\r\nOps=[0]*m\r\noperations=[0]*m\r\nfor i in range(m): operations[i]=tuple(map(int,input().split()))\r\nfor j in range(k):\r\n x,y=map(int,input().split())\r\n Ops[y-1]+=1\r\n if(x==1): continue\r\n Ops[x-2]-=1\r\nfor i in range(m-2,-1,-1): Ops[i]+=Ops[i+1]\r\nfor i in range(m):\r\n t=Ops[i]\r\n Temp[operations[i][1]-1]+=(t*operations[i][2])\r\n if(operations[i][0]==1): continue\r\n Temp[operations[i][0]-2]-=(t*operations[i][2])\r\nfor i in range(n-2,-1,-1): Temp[i]+=Temp[i+1]\r\nfor i in range(n): a[i]+=Temp[i]\r\nprint(*a)", "import sys\r\nreadline=sys.stdin.readline\r\n\r\nN,M,K=map(int,readline().split())\r\nA=list(map(int,readline().split()))\r\nL,R,D=[],[],[]\r\nfor _ in range(M):\r\n l,r,d=map(int,readline().split())\r\n l-=1\r\n L.append(l)\r\n R.append(r)\r\n D.append(d)\r\ncnt=[0]*(M+1)\r\nfor _ in range(K):\r\n x,y=map(int,readline().split())\r\n x-=1\r\n cnt[x]+=1\r\n cnt[y]-=1\r\nfor i in range(1,M+1):\r\n cnt[i]+=cnt[i-1]\r\nimos=[0]*(N+1)\r\nfor i in range(M):\r\n imos[L[i]]+=D[i]*cnt[i]\r\n imos[R[i]]-=D[i]*cnt[i]\r\nfor i in range(1,N+1):\r\n imos[i]+=imos[i-1]\r\nfor i in range(N):\r\n A[i]+=imos[i]\r\nprint(*A)", "n, m, k= map(int,input().split())\r\narr = list(map(int, input().split()))\r\n\r\nq = [list(map(int,input().split())) for i in range(m)]\r\n\r\nb = [0]*(n+1)\r\nB = [0]*(m+1)\r\n \r\nfor i in range(k):\r\n x,y = map(int, input().split())\r\n B[x-1]+=1\r\n B[y]-=1\r\n \r\ncount=0\r\nfor i,(x,y,d) in enumerate(q):\r\n count+=B[i]\r\n b[x-1]+=d*count\r\n b[y]-=d*count\r\ntotal=0\r\nfor i in range(n):\r\n total+=b[i]\r\n arr[i]+=total\r\n print (arr[i],end=' ')# 1691006791.040886", "# 296 C\r\n# Read this later: https://www.geeksforgeeks.org/difference-array-range-update-query-o1/\r\nfrom typing import List\r\n\r\n# Time Complexity: o(len(old))\r\n# Space Complexity: o(n)\r\ndef forwardConversion(old) -> List[int]:\r\n newArray = [old[0]]\r\n for i in range(1, len(old)):\r\n newArray.append(old[i] - old[i-1])\r\n return newArray\r\n\r\n# Time Complexity: o(len(subArr))\r\n# Space Complexity: o(n)\r\ndef backwardConversion(subArr) -> List[int]:\r\n newArray = [subArr[0]]\r\n for i in range(1, len(subArr)):\r\n newArray.append(subArr[i] + newArray[i-1])\r\n return newArray \r\n\r\n# Time Complexity: o(len(operations)) #DEFINE n\r\n# Space Complexity: o(1)\r\ndef applyOperations(subArr, operations) -> List[int]:\r\n # newArray = sub(subArr)\r\n for i in range(0, len(operations)):\r\n start = operations[i][0]\r\n end = operations[i][1]\r\n increaseValue = operations[i][2]\r\n subArr[start-1] += increaseValue\r\n if end < len(subArr):\r\n subArr[end] -= increaseValue\r\n return subArr\r\n\r\narraySize, operations, queries = map(int, input().split())\r\narray = list(map(int, input().split()))\r\narrayOperations = []\r\n\r\nfor i in range(0, operations):\r\n start, end, increaseValue = map(int, input().split())\r\n arrayOperations.append([start, end, increaseValue])\r\n \r\nqueryArr = [0] * operations\r\n\r\nfor i in range(0, queries):\r\n operationStart, operationEnd = map(int, input().split())\r\n #op = arrayOperations[operationStart-1:operationEnd]\r\n queryArr = applyOperations(queryArr, [(operationStart, operationEnd, 1)])\r\n \r\n #array = applyOperations(array, op)\r\nqueryArr = backwardConversion(queryArr)\r\narray = forwardConversion(array)\r\nfor ind in range(len(queryArr)):\r\n array = applyOperations(array, [arrayOperations[ind][:2] + [arrayOperations[ind][2]*queryArr[ind]]])\r\narray = backwardConversion(array) \r\n\r\nfor i in array:\r\n if array[-1] == i:\r\n print(i)\r\n else: \r\n print(i, end = ' ')\r\n\r\n", "n, m, k = map(int, input().split())\na = [int(ai) for ai in input().split()]\nops = [[int(i) for i in input().split()] for _ in range(m)]\n\nop_diff = [0] * (m + 1)\nfor _ in range(k):\n x, y = map(int, input().split())\n op_diff[x - 1] += 1\n op_diff[y] -= 1\n\ncnt, diff = 0, [0] * (n + 1)\nfor i in range(m):\n cnt += op_diff[i]\n\n l, r, d = ops[i]\n diff[l - 1] += cnt * d\n diff[r] -= cnt * d\n\ncnt = 0\nfor i in range(n):\n cnt += diff[i]\n a[i] += cnt\n\nprint(*a)\n", "from sys import stdin\r\nfrom sys import stdout\r\n\r\ninputLine = lambda: list(map(int, stdin.readline().split()))\r\ninitialArray, operations, queries = inputLine()\r\nexecuting = inputLine()\r\noperate = [inputLine() for i in range(operations)]\r\nfirst = [0] * (operations + 1)\r\nsecond = [0] * (initialArray + 1)\r\n\r\nfor p in range(queries):\r\n temp, temp2 = inputLine()\r\n first[temp - 1] += 1\r\n first[temp2] -= 1\r\n\r\ncount = 0\r\nfor p in range(operations):\r\n temp, temp2, temp3 = operate[p]\r\n count += first[p]\r\n second[temp - 1] += count * temp3\r\n second[temp2] -= count * temp3\r\n\r\ncount = 0\r\nfor p in range(initialArray):\r\n count += second[p]\r\n executing[p] += count\r\n\r\nstdout.write(' '.join(map(str, executing)))", "# Author : Mohamed Yousef\r\n# Date : 2023-05-01\r\nimport sys\r\nimport math\r\nimport bisect\r\nimport collections\r\nimport itertools\r\nimport heapq\r\nfrom itertools import accumulate, combinations, permutations, chain\r\nfrom collections import defaultdict, deque, Counter\r\nsys.setrecursionlimit(50000) # To increase Recursion depth in py\r\ndef mvalues(): return map(int, sys.stdin.readline().split())\r\ndef lvalues(): return list(map(int, sys.stdin.readline().split()))\r\ndef svalues(): return sys.stdin.readline().strip()\r\ndef test(): return int(sys.stdin.readline())\r\n\r\n\r\nn, m, k = mvalues()\r\narr = lvalues()\r\noperation = [0] * (m + 1)\r\nstore = []\r\n\r\nfor i in range(m):\r\n store.append(lvalues())\r\n# print(store)\r\n\r\nfor i in range(k):\r\n a, b = mvalues()\r\n operation[a - 1] += 1\r\n operation[b] -= 1\r\n\r\nfor i in range(1, m):\r\n operation[i] += operation[i - 1]\r\n# print(operation)\r\n\r\nans = [0] * (n + 1)\r\nfor i in range(m):\r\n ans[store[i][0] - 1] += (operation[i] * store[i][2])\r\n ans[store[i][1]] -= (operation[i] * store[i][2])\r\n# print(ans)\r\nfor i in range(1, n):\r\n ans[i] += ans[i - 1]\r\n\r\nfor i in range(n):\r\n ans[i] += arr[i]\r\n\r\n# print(ans)\r\nans = ans[:-1]\r\nsys.stdout.write(\" \".join(map(str, ans)))\r\n", "#!/usr/bin/env python3\nimport os\nimport sys\nfrom io import BytesIO, IOBase\n\nsys.stdout, stream = IOBase(), BytesIO()\nsys.stdout.flush = lambda: os.write(1, stream.getvalue()) and not stream.truncate(0) and stream.seek(0)\nsys.stdout.write = lambda s: stream.write(s.encode())\n\ninput = BytesIO(os.read(0, os.fstat(0).st_size)).readline\n\n\ndef main():\n n, m, k = map(int, input().split())\n a = [int(ai) for ai in input().split()]\n ops = [[int(i) for i in input().split()] for _ in range(m)]\n\n op_diff = [0] * m\n for _ in range(k):\n x, y = map(int, input().split())\n op_diff[x - 1] += 1\n if y < m:\n op_diff[y] -= 1\n\n cnt, diff = 0, [0] * n\n for i, (l, r, d) in zip(op_diff, ops):\n cnt += i\n diff[l - 1] += cnt * d\n if r < n:\n diff[r] -= cnt * d\n\n cnt = 0\n for i, d in enumerate(diff):\n cnt += d\n a[i] += cnt\n\n print(*a)\n\n\nif __name__ == '__main__':\n main()\n", "from sys import stdin\r\n\r\ninput = stdin.readline\r\n\r\nitems_count, people_count1, people_count2 = list(map(int, input().split()))\r\nprices = list(map(int, input().split()))\r\nactions = []\r\nfor i in range(people_count1):\r\n l, r, s = list(map(int, input().split()))\r\n actions.append((l, r, s))\r\n\r\nshould_act = [0] * (people_count1 + 1)\r\nfor i in range(people_count2):\r\n x, z = list(map(int, input().split()))\r\n should_act[x-1] += 1\r\n should_act[z] -= 1\r\n\r\ntemp_sum = 0\r\nfor i in range(people_count1):\r\n temp_sum += should_act[i]\r\n should_act[i] = temp_sum\r\n\r\nadd_to_price = [0] * (items_count + 1)\r\nfor i in range(people_count1):\r\n s = actions[i][2] * should_act[i]\r\n add_to_price[actions[i][0]-1] += s\r\n add_to_price[actions[i][1]] -= s\r\n\r\ntemp_sum = 0\r\nfor i in range(items_count):\r\n temp_sum += add_to_price[i]\r\n prices[i] += temp_sum\r\n\r\nprint(*prices)", "from itertools import accumulate\r\nfrom os import path\r\nfrom sys import stdin, stdout\r\n\r\n\r\nfilename = \"../templates/input.txt\"\r\nif path.exists(filename):\r\n stdin = open(filename, 'r')\r\n\r\n\r\ndef input():\r\n return stdin.readline().rstrip()\r\n\r\n\r\ndef print(*args, sep=' ', end='\\n'):\r\n stdout.write(sep.join(map(str, args)))\r\n stdout.write(end)\r\n\r\n\r\ndef solution():\r\n n, m, k = [int(num) for num in input().split()]\r\n a = [int(num) for num in input().split()]\r\n ops = []\r\n for i in range(m):\r\n ops.append([int(num) for num in input().split()])\r\n diff = [0 for i in range(m + 1)]\r\n for i in range(k):\r\n l, r = [int(num) for num in input().split()]\r\n l -= 1\r\n r -= 1\r\n diff[l] += 1\r\n diff[r + 1] -= 1\r\n b = list(accumulate(diff))\r\n diff = [0 for i in range(n + 1)]\r\n for x, (l, r, d) in zip(b, ops):\r\n l -= 1\r\n r -= 1\r\n diff[l] += d * x\r\n diff[r + 1] -= d * x\r\n b = list(accumulate(diff))\r\n print(*(ai + bi for ai, bi in zip(a, b)))\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", "def solution():\n def solve(nums, ops, queries):\n m, k = len(ops), len(queries)\n prefix = m * [0]\n\n for x, y in queries:\n prefix[x-1] += 1\n if m - 1 >= y:\n prefix[y] -= 1\n \n for i in range(1, m):\n prefix[i] += prefix[i-1]\n\n ans = [0] * len(nums)\n for i, op in enumerate(ops):\n l, r, d = op\n ans[l-1] += (d*prefix[i])\n if len(nums) - 1 >= r:\n ans[r] -= (d*prefix[i])\n \n for i in range(1, len(nums)):\n ans[i] += ans[i-1]\n for i in range(len(nums)):\n nums[i] += ans[i]\n return nums\n _, m, k = [int(x) for x in input().split()]\n nums = [int(x) for x in input().split()]\n ops, queries = [], []\n for _ in range(m):\n ops.append([int(x) for x in input().split()])\n for _ in range(k):\n queries.append([int(x) for x in input().split()])\n print(*solve(nums, ops, queries))\nsolution()\n \t\t \t\t\t\t\t\t\t \t \t \t \t\t\t \t\t\t\t", "def arr_inp(n):\r\n if n == 1:\r\n return [int(x) for x in stdin.readline().split()]\r\n elif n == 2:\r\n return [float(x) for x in stdin.readline().split()]\r\n else:\r\n return [str(x) for x in stdin.readline().split()]\r\n\r\n\r\ndef cum_m():\r\n for l, r in k_a:\r\n m_cum[l] += 1\r\n m_cum[r + 1] -= 1\r\n for i in range(2, m + 1):\r\n m_cum[i] += m_cum[i - 1]\r\n\r\n\r\ndef cum_a():\r\n i = 1\r\n for l, r, d in m_a:\r\n a_cum[l] += (d * m_cum[i])\r\n a_cum[r + 1] -= (d * m_cum[i])\r\n i += 1\r\n for i in range(2, n + 1):\r\n a_cum[i] += a_cum[i - 1]\r\n\r\n\r\ndef solve():\r\n cum_m()\r\n cum_a()\r\n ans = [0] * n\r\n for i in range(n):\r\n ans[i] += a[i] + a_cum[i + 1]\r\n return ans\r\n\r\n\r\nfrom sys import stdin\r\nfrom collections import *\r\n\r\nn, m, k = arr_inp(1)\r\na, m_cum, a_cum = arr_inp(1), defaultdict(int), defaultdict(int)\r\nm_a, k_a = [arr_inp(1) for i in range(m)], [arr_inp(1) for j in range(k)]\r\n\r\nprint(*solve())\r\n\r\n", "s = input().split()\nn,m,k = [int(x) for x in s]\ns = input().split()\narr = [int(x) for x in s]\nops = []\nfor i in range(m):\n s = input().split()\n ops.append([int(x) for x in s]) # l, r, d\n \nop_counts = [0 for _ in range(len(ops) + 1)]\n\nfor i in range(k):\n s = input().split()\n x, y = [int(x) for x in s]\n op_counts[x-1] += 1\n op_counts[y] -= 1 \n \ndiff_arr = [0 for _ in range(len(arr) + 1)]\nop_pref_sum = 0\nfor i in range(len(ops)):\n op_pref_sum += op_counts[i]\n diff_arr[ops[i][0]-1] += ops[i][2]*op_pref_sum\n diff_arr[ops[i][1]] -= ops[i][2]*op_pref_sum\n\npref_sum = 0\nres = []\nfor i in range(len(arr)):\n pref_sum += diff_arr[i]\n res.append(arr[i]+pref_sum)\n\nprint(\" \".join([str(x) for x in res]))\n \n\n \n \n \n\n", "def contest_2c():\n # Respuesta basada en explicación dada en clases el viernes 2 de septiembre\n n, m, k = [int(i) for i in input().split()]\n arr = [int(i) for i in input().split()]\n ops = []\n ops_dif_array = [0 for i in range(m)]\n ops_array = [0 for i in range(m)]\n dif_arr = [0 for i in range(n)]\n new_arr = [i for i in range(n)]\n\n for i in range(m):\n l, r, d = [int(i) for i in input().split()]\n ops.append((l, r, d))\n\n for i in range(k):\n x, y = [int(i) for i in input().split()]\n ops_dif_array[x - 1] += 1\n if y < m:\n ops_dif_array[y] -= 1\n \n sum = 0\n for i in range(m):\n sum += ops_dif_array[i]\n ops_array[i] = sum\n \n for i in range(m):\n l, r, d = ops[i]\n dif_arr[l - 1] += d * ops_array[i]\n if r < n:\n dif_arr[r] -= d * ops_array[i]\n\n sum = 0\n for i in range(n):\n sum += dif_arr[i]\n new_arr[i] = sum + arr[i]\n\n print(\" \".join([str(i) for i in new_arr]))\n \ncontest_2c()\n \t \t \t \t \t \t \t\t\t \t\t\t\t\t\t", "n,m,k = map(int, input().split())\r\narr = list(map(int, input().split()))\r\nile = [0]*(m+1)\r\nadd = [0]*(n+1)\r\nop = []\r\nqr = []\r\nfor _ in range(m):\r\n op.append(list(map(int, input().split())))\r\n\r\nfor _ in range(k):\r\n qr.append(list(map(int, input().split()))) \r\n\r\nfor i in range(k):\r\n ile[qr[i][0]-1] +=1\r\n ile[qr[i][1]] -=1\r\n# print(ile)\r\n\r\nfor i in range(m):\r\n ile[i+1] += ile[i]\r\n add[op[i][0]-1] += ile[i]*op[i][2]\r\n add[op[i][1]] -= ile[i]*op[i][2]\r\n# print(add)\r\n\r\nfor i in range(1,n+1):\r\n add[i] += add[i-1]\r\n arr[i-1] += add[i-1]\r\n\r\nprint(*arr)", "import sys\r\n\r\ninput = sys.stdin.readline\r\n\r\nn, m, k = list(map(int, input().split()))\r\nnums = list(map(int, input().split()))\r\noperations = []\r\nfor _ in range(m):\r\n _from, _to, amt = list(map(int, input().split()))\r\n operations.append((_from, _to, amt))\r\nsize = 100002\r\nquery_prefix = [0 for _ in range(size)]\r\nfor _ in range(k):\r\n _from, _to = list(map(int, input().split()))\r\n query_prefix[_from] += 1\r\n query_prefix[_to + 1] -= 1\r\n\r\nfor i in range(1, size):\r\n query_prefix[i] += query_prefix[i - 1]\r\narray_prefix = [0 for _ in range(size)]\r\nfor i, (_from, _to, amt) in enumerate(operations):\r\n array_prefix[_from] += amt * query_prefix[i + 1]\r\n array_prefix[_to + 1] -= amt * query_prefix[i + 1]\r\nfor i in range(1, size):\r\n array_prefix[i] += array_prefix[i - 1]\r\n\r\nfor i in range(n):\r\n nums[i] += array_prefix[i + 1]\r\nprint(*nums)\r\n ", "\n\nn,m,k = map(int,input().split())\na = list(map(int,input().split()))\n\noperations = []\nfor i in range(m):\n operations.append(list(map (int,input().split())))\n operations[i][0] -=1\n operations[i][1] -=1\n \nb = [0] * (m+1)\nqueries = []\nfor i in range(k):\n queries.append(list(map(int,input().split())))\n queries[i][0] -=1\n queries[i][1] -=1\n b[queries[i][0]] += 1\n b[queries[i][1]+1] -= 1\n \ntemp = 0\noffset = [0] * (n+1)\nfor i in range(m):\n temp += b[i]\n offset[operations[i][0]] += temp*operations[i][2]\n offset[operations[i][1]+1] -= temp*operations[i][2]\n \ntemp = 0\nout = []\nfor i in range(n):\n temp += offset[i]\n out.append(temp + a[i])\nout = list(map(str,out))\nprint(' '.join(out))\n\t\t \t \t\t \t \t\t \t\t \t \t\t", "from math import *\r\nfrom collections import *\r\nfrom bisect import *\r\nimport heapq\r\nimport math\r\nfrom itertools import permutations\r\n\r\ndef is_prime(n):\r\n\r\n for i in range(2,math.ceil(math.sqrt(n))):\r\n if(n%i==0):\r\n return False\r\n return True\r\n\r\ndef sieve(n):\r\n arr=[True for _ in range(n+1)]\r\n\r\n for i in range(2,math.ceil(math.sqrt(n))):\r\n if(arr[i]==True):\r\n for j in range(i*i,n+1,i):\r\n arr[j]=False\r\n\r\n return arr\r\n\r\n\r\ndef power(x, y, p):\r\n res = 1 # Initialize result\r\n\r\n # Update x if it is more\r\n # than or equal to p\r\n x = x % p\r\n\r\n if (x == 0):\r\n return 0\r\n\r\n while (y > 0):\r\n\r\n # If y is odd, multiply\r\n # x with result\r\n if ((y & 1) == 1):\r\n res = (res * x) % p\r\n\r\n # y must be even now\r\n y = y >> 1 # y = y/2\r\n x = (x * x) % p\r\n\r\n return res\r\n\r\ndef euclidean_distance(x1,y1,x2,y2):\r\n return sqrt(abs(x1-x2)**2+abs(y1-y2)**2)\r\n\r\ndef get_permutations(lo=0,hi=10):\r\n return list(permutations(range(lo,hi)))\r\n\r\n\r\ndef getDivisors(n):\r\n i = 1\r\n ans1=[]\r\n ans2=[]\r\n while i <= math.sqrt(n):\r\n\r\n if (n % i == 0):\r\n if (n / i == i):\r\n ans1.append(i)\r\n else:\r\n # Otherwise print both\r\n ans1.append(i)\r\n ans2.append(n//i)\r\n i = i + 1\r\n\r\n return ans1+ans2[::-1]\r\n\r\ndef solve():\r\n # s=input()\r\n # n=int(input())\r\n n,m,k=list(map(int,input().split()))\r\n\r\n lis=[]\r\n\r\n lis=(list(map(int,input().split())))\r\n\r\n temp=[]\r\n for _ in range(m):\r\n temp.append(list(map(int,input().split())))\r\n arr=[0 for _ in range(m+1)]\r\n\r\n for _ in range(k):\r\n x,y=list(map(int,input().split()))\r\n x-=1\r\n y-=1\r\n arr[x]+=1\r\n arr[y+1]-=1\r\n\r\n for i in range(1,len(arr)):\r\n arr[i]+=arr[i-1]\r\n\r\n arr2=[0 for _ in range(n+1)]\r\n # print(arr)\r\n\r\n for i,ele in enumerate(temp):\r\n x=ele[0]-1\r\n y=ele[1]\r\n\r\n arr2[x]+=(arr[i]*ele[2])\r\n\r\n arr2[y]-=(arr[i]*ele[2])\r\n\r\n for i in range(1,len(arr2)):\r\n arr2[i]+=arr2[i-1]\r\n for i in range(len(lis)):\r\n lis[i]+=arr2[i]\r\n print(*lis)\r\n\r\n\r\n\r\n\r\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 n=1\r\n # n=int(input())\r\n while(n):\r\n n-=1\r\n solve()\r\n\r\n\r\n\r\n\r\n", "line = input().split(' ')\r\nn, m, k = int(line[0]), int(line[1]), int(line[2])\r\n\r\n# create arr\r\n\r\narr = input().split(' ')\r\n\r\nfor i in range(len(arr)):\r\n arr[i] = int(arr[i])\r\n\r\narr = [0] + arr + [0]\r\n\r\n\r\n# create operations\r\n\r\nops = [(0, 0, 0)]\r\n\r\nfor i in range(m):\r\n line = input().split(' ')\r\n\r\n l, r, d = int(line[0]), int(line[1]), int(line[2])\r\n\r\n ops.append((l, r, d))\r\n\r\nopsCount = [0] * (m + 2)\r\n\r\nfor i in range(k):\r\n query = input().split(' ')\r\n\r\n x, y = int(query[0]), int(query[1])\r\n\r\n opsCount[x] += 1\r\n opsCount[y + 1] -= 1\r\n\r\nfor i in range(1, len(opsCount)):\r\n opsCount[i] += opsCount[i - 1]\r\n\r\ndif = [0] * len(arr)\r\n\r\nfor i in range(1, m + 1):\r\n l, r, d = ops[i]\r\n\r\n dif[l] += opsCount[i] * d\r\n dif[r + 1] -= opsCount[i] * d\r\n\r\nfor i in range(1, len(arr)):\r\n dif[i] += dif[i - 1]\r\n arr[i] += dif[i]\r\n\r\nfor i in range(1, len(arr) - 1):\r\n print(str(arr[i]) + \" \", end = '')\r\n \r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "import sys\r\nimport os.path\r\n \r\nif(os.path.exists('input.txt')) :\r\n sys.stdin = open(\"input.txt\", \"r\")\r\n sys.stdout = open(\"output.txt\", \"w\")\r\n sys.stderr = open(\"error.txt\", \"w\")\r\n \r\ndepth = 1000000\r\nmod = 1000000007 \r\nlim = mod * mod\r\nsys.setrecursionlimit(depth) \r\n \r\nlinp = lambda: list(minp())\r\nminp = lambda: map(int, input().split())\r\n \r\nfrom math import inf, ceil, sqrt, log2, gcd\r\nfrom collections import defaultdict, deque\r\n \r\ndd = lambda x: defaultdict(lambda: x)\r\ndxy = [(1, 0),(-1, 0),(0, 1),(0, -1)]\r\n\r\nn, m, k = minp()\r\na = linp()\r\nqueries = [linp() for _ in range(m)]\r\nd = [0 for _ in range(m+1)]\r\nfor _ in range(k) :\r\n l, r = minp()\r\n d[l-1] += 1\r\n d[r] -= 1\r\ncounts = [0 for _ in range(m)]\r\ncounts[0] = d[0]\r\nfor i in range(1, m) :\r\n counts[i] = counts[i-1] + d[i]\r\nfor i in range(m) :\r\n queries[i][2] *= counts[i]\r\nd = [0 for _ in range(n+1)]\r\nd[0] = a[0]\r\nfor i in range(1, n) :\r\n d[i] = a[i] - a[i-1]\r\nfor l, r, v in queries :\r\n d[l-1] += v\r\n d[r] -= v\r\na = [0 for _ in range(n)]\r\na[0] = d[0]\r\nfor i in range(1, n) :\r\n a[i] = a[i-1] + d[i]\r\nprint(*a)", "ln,ope,q = map(int,input().split())\r\noperations = []\r\nqeures = [0]*(ope+1)\r\nans = [0]*(ln+1)\r\nfor i in range(ope+1):\r\n if i==0:\r\n arr = list(map(int,input().split()))\r\n else:\r\n operations.append(list(map(int,input().split())))\r\n\r\nfor u in range(q): # to use it in prefix\r\n l,r = map(int,input().split())\r\n qeures[l-1]+=1\r\n qeures[r]-=1\r\n\r\nfor u in range(1,ope): # prefix to get for each operation how many times i used it\r\n qeures[u]+=qeures[u-1]\r\n\r\nfor u in range(ope): # performing the operations using prefix\r\n ans[operations[u][0]-1] += (operations[u][-1])*qeures[u]\r\n ans[operations[u][1]] += -((operations[u][-1])*qeures[u])\r\n\r\nfor u in range(1,ln): # prefix on operations\r\n ans[u]+=ans[u-1]\r\n\r\nfor u in range(ln): # adding the total of operations to the array\r\n arr[u]+=ans[u]\r\n\r\nprint(*arr)", "import sys\r\nimport string\r\nimport math\r\nimport time\r\nfrom collections import defaultdict\r\nfrom functools import lru_cache\r\nfrom collections import Counter\r\nfrom fractions import Fraction\r\n\r\ndef mi(s):\r\n return map(int, s.strip().split())\r\n\r\ndef lmi(s):\r\n return list(mi(s))\r\n\r\ndef tmi(s):\r\n return tuple(mi(s))\r\n\r\ndef mf(f, s):\r\n return map(f, s)\r\n\r\ndef lmf(f, s):\r\n return list(mf(f, s))\r\n\r\ndef js(lst):\r\n return \" \".join(str(d) for d in lst)\r\n\r\ndef jsns(lst):\r\n return \"\".join(str(d) for d in lst)\r\n\r\ndef line():\r\n return sys.stdin.readline().strip()\r\n\r\ndef linesp():\r\n return line().split()\r\n\r\ndef iline():\r\n return int(line())\r\n\r\ndef mat(n):\r\n matr = []\r\n for _ in range(n):\r\n matr.append(linesp())\r\n return matr\r\n\r\ndef matns(n):\r\n mat = []\r\n for _ in range(n):\r\n mat.append([c for c in line()])\r\n return mat\r\n\r\ndef mati(n):\r\n mat = []\r\n for _ in range(n):\r\n mat.append(lmi(line())) \r\n return mat\r\n\r\ndef pmat(mat):\r\n for row in mat:\r\n print(js(row))\r\n\r\ndef main():\r\n n, m, k = mi(line())\r\n arr = lmi(line())\r\n ops = []\r\n for _ in range(m):\r\n x, y, d = lmi(line())\r\n ops.append((x - 1, y - 1, d))\r\n queries = []\r\n for _ in range(k):\r\n x, y = lmi(line())\r\n queries.append((x - 1, y - 1))\r\n\r\n sweep = []\r\n for x, y in queries:\r\n sweep.append((x, \"add\"))\r\n \r\n # Basically increment all windows by 1, so\r\n # that we don't have to care about annoying edge\r\n # cases for window size == 1.\r\n sweep.append((y + 1, \"remove\"))\r\n\r\n sweep.sort(key=lambda x: x[0])\r\n size = 0\r\n i = 0\r\n disjoint_queries = []\r\n prev_x = None\r\n while i < len(sweep):\r\n curr_x = sweep[i][0]\r\n j = i\r\n to_remove = 0\r\n prev_size = size\r\n while j < len(sweep):\r\n if sweep[j][0] != curr_x:\r\n break\r\n x, op = sweep[j]\r\n if op == \"add\":\r\n size += 1\r\n elif op == \"remove\":\r\n to_remove += 1\r\n j += 1\r\n i = j\r\n \r\n if prev_size > 0:\r\n # Don't care about size zero here.\r\n disjoint_queries.append((prev_x, curr_x, prev_size))\r\n prev_x = curr_x\r\n size -= to_remove\r\n\r\n new_ops = []\r\n for i in range(len(disjoint_queries)):\r\n l, r, size = disjoint_queries[i]\r\n if r - 1 >= l and size >= 1:\r\n for kk in range(l, r):\r\n x, y, d = ops[kk]\r\n new_ops.append((x, y, d * size))\r\n\r\n # Merge these intervals.\r\n sweep = []\r\n for x, y, d in new_ops:\r\n sweep.append((x, \"add\", d))\r\n \r\n # Basically increment all windows by 1, so\r\n # that we don't have to care about annoying edge\r\n # cases for window size == 1.\r\n sweep.append((y + 1, \"remove\", d))\r\n\r\n size = 0\r\n i = 0\r\n disjoint_ops = []\r\n prev_x = None\r\n while i < len(sweep):\r\n curr_x = sweep[i][0]\r\n j = i\r\n to_remove = 0\r\n prev_size = size\r\n while j < len(sweep):\r\n if sweep[j][0] != curr_x:\r\n break\r\n x, op, d = sweep[j]\r\n if op == \"add\":\r\n size += d\r\n elif op == \"remove\":\r\n to_remove += d\r\n j += 1\r\n i = j\r\n \r\n if prev_size > 0:\r\n # Don't care about size zero here.\r\n disjoint_ops.append((prev_x, curr_x, prev_size))\r\n prev_x = curr_x\r\n size -= to_remove\r\n\r\n for l, r, d in disjoint_ops:\r\n if r - 1 >= l:\r\n for kk in range(l, r):\r\n arr[kk] += d\r\n print(js(arr))\r\n\r\ndef main():\r\n n, m, k = mi(line())\r\n arr = lmi(line())\r\n ops = []\r\n for _ in range(m):\r\n x, y, d = lmi(line())\r\n ops.append((x - 1, y - 1, d))\r\n queries = []\r\n for _ in range(k):\r\n x, y = lmi(line())\r\n queries.append((x - 1, y - 1))\r\n\r\n op_counts = [0 for _ in range(len(ops) + 1)]\r\n for x, y in queries:\r\n op_counts[x] += 1\r\n op_counts[y + 1] -= 1\r\n\r\n curr = 0\r\n arr2 = [0 for _ in range(len(arr) + 1)]\r\n for i in range(len(op_counts) - 1):\r\n curr += op_counts[i]\r\n\r\n # Current que\r\n x, y, d = ops[i]\r\n arr2[x] += d * curr\r\n arr2[y + 1] -= d * curr\r\n\r\n curr = 0\r\n for i in range(len(arr2) - 1):\r\n curr += arr2[i]\r\n arr[i] += curr\r\n print(js(arr))\r\nmain()\r\n", "from sys import stdin\r\n\r\n\r\ndef update(bit, l, r, v):\r\n add(bit, l, v)\r\n add(bit, r + 1, -v)\r\n\r\n\r\ndef add(bit, index, v):\r\n n = len(bit) - 1\r\n while index <= n:\r\n bit[index] += v\r\n index += (index & (-index))\r\n\r\n\r\ndef get_count(bit, index):\r\n res = 0\r\n while index > 0:\r\n res += bit[index]\r\n index -= (index & -index)\r\n return res\r\n\r\n\r\ndef main():\r\n n, m, k = map(int, stdin.readline().split())\r\n ar = list(map(int, stdin.readline().split()))\r\n bit1 = [0] * (n + 1)\r\n bit2 = [0] * (m + 1)\r\n query = []\r\n for _ in range(m):\r\n x, y, v = map(int, stdin.readline().split())\r\n query.append((x, y, v))\r\n for _ in range(k):\r\n x, y = map(int, stdin.readline().split())\r\n update(bit2, x, y, 1)\r\n for i in range(m):\r\n count = get_count(bit2, i + 1)\r\n x, y, v = query[i]\r\n update(bit1, x, y, v * count)\r\n\r\n for i in range(n):\r\n ar[i] += get_count(bit1, i + 1)\r\n\r\n print(*ar)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n,m,k=list(map(int,input().split()))\r\ninc=[]\r\ntempans=[0]*(n+1)\r\narr=list(map(int,input().split()))\r\nfor i in range(m):\r\n inc.append(list(map(int,input().split())))\r\nmod=10**6+20\r\na=[0]*mod\r\n\r\nfor i in range(k):\r\n l,r=list(map(int,input().split()))\r\n a[l]+=1\r\n a[r+1]+=-1\r\n\r\nfor i in range(1,mod):\r\n a[i]+=a[i-1]\r\n\r\nfor i in range(m):\r\n\r\n l,r,d=inc[i]\r\n d=d*a[i+1]\r\n #print(d)\r\n tempans[l]+=d\r\n if r+1<n+1:\r\n tempans[r+1]+=-d\r\n#print(tempans)\r\nfor i in range(1,n+1):\r\n tempans[i]+=tempans[i-1]\r\ntempans=tempans[1:]\r\nfor i in range(n):\r\n arr[i]+=tempans[i]\r\nprint(*arr)\r\n", "n,m,k=list(map(int,input().split()))\r\narr=list(map(int,input().split()))\r\nmrr=[tuple(map(int,input().split())) for _ in range(m)]\r\nma=[0]*m\r\nfor _ in range(k):\r\n x,y=list(map(int,input().split()))\r\n ma[x-1]+=1\r\n if y<m:\r\n ma[y]-=1\r\nfor i in range(1,m):\r\n ma[i]+=ma[i-1]\r\nadd=[0]*n\r\nfor i in range(m):\r\n add[mrr[i][0]-1]+=ma[i]*mrr[i][2]\r\n if mrr[i][1]<n:\r\n add[mrr[i][1]]-=ma[i]*mrr[i][2]\r\nfor i in range(1,n):\r\n add[i]+=add[i-1]\r\nadd=[arr[i]+add[i] for i in range(n)]\r\nprint((\" \").join(map(str,add)))", "n, m, k = map(int, input().split())\r\narr = list(map(int, input().split()))\r\nqueries = [list(map(int, input().split())) for i in range(m)]\r\n\r\ntimes = [0] * (m+2)\r\nfor i in range(k):\r\n x, y = map(int, input().split())\r\n times[x] += 1\r\n times[y+1] -= 1\r\nres_add = [0] * (n+2)\r\nfor i in range(m):\r\n x, y, z = queries[i]\r\n times[i+1] += times[i]\r\n res_add[x] += times[i+1] * z\r\n res_add[y+1] -= times[i+1] * z\r\nfor i in range(n):\r\n res_add[i+1] += res_add[i]\r\n print(arr[i] + res_add[i+1], end = ' ')\r\n", "read_input = lambda: list(map(int, input().split()))\r\n\r\nn, m, k = read_input()\r\ninit_array = read_input()\r\noperations = [read_input() for _ in range(m)]\r\nadditionals = [0]*(m+1)\r\nsums = [0]*(n+1)\r\n\r\n# Calculates the number of operations needed by using increments and decrements\r\nfor _ in range(k):\r\n x, y = read_input()\r\n additionals[x-1] += 1\r\n additionals[y ] -= 1\r\n\r\n# Calculates the operations times the number of times the operation is executed\r\nsum_so_far = 0\r\nfor i in range(m):\r\n l, r, val_to_add = operations[i]\r\n sum_so_far += additionals[i]\r\n sums[l-1] += sum_so_far*val_to_add\r\n sums[r ] -= sum_so_far*val_to_add\r\n\r\n# Calculates the final number. Positives add while negatives remove\r\nsum_so_far = 0\r\nfor i in range(n):\r\n sum_so_far += sums[i]\r\n init_array[i] += sum_so_far\r\nprint(' '.join(map(str, init_array)))", "from sys import stdin, stdout\r\n \r\n \r\n \r\nrd = lambda: list(map(int, stdin.readline().split()))\r\n \r\n \r\n \r\nn, m, k = rd()\r\n \r\na = rd()\r\n \r\nb = [rd() for _ in range(m)]\r\n \r\nx = [0]*(m+1)\r\n \r\ny = [0]*(n+1)\r\n \r\n \r\n \r\nfor _ in range(k):\r\n \r\n l, r = rd()\r\n \r\n x[l-1] += 1\r\n \r\n x[r ] -= 1\r\n \r\n \r\n \r\ns = 0\r\n \r\nfor i in range(m):\r\n \r\n l, r, d = b[i]\r\n \r\n s += x[i]\r\n \r\n y[l-1] += s*d\r\n \r\n y[r ] -= s*d\r\n \r\n \r\n \r\ns = 0\r\n \r\nfor i in range(n):\r\n \r\n s += y[i]\r\n \r\n a[i] += s\r\n \r\nstdout.write(' '.join(map(str, a)))", "import sys\r\n\r\ndef read(line):\r\n return [int(c) for c in line.strip().split()]\r\n\r\n\r\ndef main():\r\n test = sys.stdin.readlines()\r\n\r\n n, m, k = read(test[0])\r\n array = read(test[1])\r\n ops = [read(test[2+j]) for j in range(m)]\r\n l, r, d = [], [], []\r\n for li, ri, di in ops:\r\n l.append(li)\r\n r.append(ri)\r\n d.append(di)\r\n \r\n queries = [read(test[2+m+j]) for j in range(k)]\r\n\r\n\r\n inc = [0] * (m+1)\r\n for x, y in queries:\r\n inc[x-1] += 1\r\n inc[y] -= 1\r\n\r\n dInA = [0] * (n+1)\r\n c = 0\r\n for i in range(m):\r\n c += inc[i]\r\n newValueD = c * d[i]\r\n dInA[l[i]-1] += newValueD\r\n dInA[r[i]] -= newValueD\r\n\r\n ans = []\r\n c = 0\r\n for i in range(n):\r\n c += dInA[i]\r\n ans.append(c+array[i])\r\n\r\n print(*ans)\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# 12 - 12:35", "n,m,k = map(int, input().split())\r\noriginal = list(map(int, input().split()))\r\n\r\noperations = []\r\nfor _ in range(m):\r\n operations.append(list(map(int, input().split())))\r\n\r\ntimes = [0]*(m+2)\r\nfor _ in range(k):\r\n start, end = map(int, input().split())\r\n times[start] += 1\r\n times[end+1] -= 1\r\n\r\noptim = [times[1]]\r\nfor i in range(2,m+1):\r\n optim.append(optim[-1] + times[i])\r\n \r\ndiff = [0]*(n+2) \r\nfor i in range(len(operations)):\r\n start , end, num = operations[i]\r\n diff[start] += (num*optim[i])\r\n diff[end + 1] -= (num*optim[i])\r\n \r\npre_sum = [diff[1]]\r\nfor i in range(2,n+1):\r\n pre_sum.append(pre_sum[-1] + diff[i])\r\n \r\nfor i in range(len(pre_sum)):\r\n original[i] += pre_sum[i]\r\n\r\n\r\nprint(*original)\r\n \r\n\r\n \r\n", "#!/usr/bin/env python3\n# -*- coding: utf-8 -*-\n##################################\n# University of Wisconsin-Madison\n# Author: Yaqi Zhang\n##################################\n\n# standard library\nimport sys\n\ndef main():\n n, m, k = map(int, input().split())\n nums = list(map(int, input().split()))\n pre_reps = [0] * (m + 1)\n ops = []\n for _ in range(m):\n l, r, d = map(int, input().split())\n ops.append((l - 1, r - 1, d))\n for _ in range(k):\n x, y = map(int, input().split())\n x -= 1\n y -= 1\n pre_reps[x] += 1\n pre_reps[y + 1] -= 1\n cur = 0\n add = [0] * (n + 1)\n for i, (l, r, d) in enumerate(ops):\n cur += pre_reps[i]\n add[l] += d * cur\n add[r + 1] -= d * cur\n cur = 0\n ans = []\n for i, num in enumerate(nums):\n cur += add[i]\n ans.append(num + cur)\n print(' '.join(map(str, ans)))\n\n\nif __name__ == \"__main__\":\n main()\n\n", "import sys\r\n\r\ndef answer(n, m, k, a, ops, q):\r\n cnt_m = [0 for i in range(m+1)] # number of operations of each type to be performed. 1 to m, based on q.\r\n for i in range(k):\r\n l = q[i][0]\r\n r = q[i][1]\r\n cnt_m[l-1] += 1\r\n cnt_m[r] -= 1\r\n summ_a = [0 for i in range(n+1)]\r\n s = 0\r\n for i in range(m):\r\n d = ops[i][2]\r\n s += cnt_m[i]\r\n summ = s * d\r\n l = ops[i][0] \r\n r = ops[i][1]\r\n summ_a[l-1] += summ\r\n summ_a[r] -= summ\r\n \r\n s = 0\r\n for i in range(n):\r\n s += summ_a[i]\r\n a[i] += s\r\n \r\n return ' '.join(map(str, a))\r\n\r\n\r\ndef main():\r\n n, m, k = map(int, sys.stdin.readline().split())\r\n a = list(map(int, sys.stdin.readline().split()))\r\n ops = [0 for i in range(m)]\r\n q = [0 for i in range(k)]\r\n for i in range(m):\r\n ops[i] = list(map(int, sys.stdin.readline().split()))\r\n for j in range(k):\r\n q[j] = list(map(int, sys.stdin.readline().split()))\r\n print(answer(n, m, k, a, ops, q))\r\n return\r\nmain()\r\n", "def solve():\n n, m, k = map(int, input().strip().split())\n array = list(map(int, input().strip().split()))\n ops = [tuple(map(int, input().strip().split())) for _ in range(m)]\n applied = [0 for _ in range(m + 1)]\n qs = [tuple(map(int, input().strip().split())) for _ in range(k)]\n for x, y in qs:\n applied[x - 1] += 1\n applied[y] -= 1\n cumadds = [0 for _ in range(n + 1)]\n repeats = 0\n for i, (l, r, d) in enumerate(ops):\n repeats += applied[i]\n cumadds[l - 1] += repeats * d\n cumadds[r] -= repeats * d\n cum = 0\n for i, cumadd in zip(range(n), cumadds):\n cum += cumadd\n array[i] += cum\n print(*array)\n\nsolve()\n", "maxn = 1e5\r\nn,m,k=input().split(' '); n=int(n); m=int(m); k=int(k)# 输入第一行\r\na = input().split(' ')# 输入第二行\r\nfor i in range(len(a)): a[i]=int(a[i])\r\nfor i in range(len(a)-1,0,-1): a[i]-=a[i-1] # 差分\r\na.append(0)\r\nL = []; R = []; d = []; cnt=[]\r\nfor i in range(m):# 读入所有操作\r\n t = input().split(' ')\r\n L.append(int(t[0])); \r\n R.append(int(t[1])); \r\n d.append(int(t[2])); \r\n cnt.append(0)\r\ncnt.append(0)\r\nfor i in range(k):# 读入所有查询\r\n x,y=input().split(' '); x=int(x); y=int(y)\r\n cnt[x-1]+=1; cnt[y]-=1\r\nfor i in range(1,m):# 前缀和\r\n cnt[i]+=cnt[i-1]# 每个操作被执行的次数\r\nfor i in range(m): # 遍历操作，每个操作执行应有的次数\r\n a[L[i]-1]+=d[i]*cnt[i]\r\n a[R[i]]-=d[i]*cnt[i]\r\nfor i in range(1,n):\r\n a[i]+=a[i-1]\r\nfor i in range(n):\r\n print(a[i],end=\" \")\r\nprint(\"\")\r\n", "from sys import stdin,stdout\r\ninput=stdin.readline\r\ndef print(*args, end='\\n', sep=' ') -> None:\r\n stdout.write(sep.join(map(str, args)) + end)\r\n\r\nn,m,k=map(int,input().split()) ; arr=list(map(int,input().split())) ; op={} ; pre=[0]*(m+1)\r\nfor i in range(m):\r\n x=list(map(int,input().split()))\r\n op[i]=x\r\n\r\n\r\nfor i in range(k):\r\n st,end=map(int,input().split())\r\n pre[st-1]+=1\r\n pre[end]-=1\r\nfor i in range(m):\r\n pre[i+1]+=pre[i]\r\n\r\narr2=[0]*(n+1)\r\nfor i in range(m):\r\n l,r,pl=op[i]\r\n arr2[l-1]+=pl*pre[i]\r\n arr2[r]-=pl*pre[i]\r\n\r\nfor i in range(n):\r\n arr2[i+1]+=arr2[i]\r\n\r\nfor i in range(n):\r\n print(arr[i]+arr2[i],end=\" \")" ]

[ "MAX = 333333\r\nn, m = map(int, input().split())\r\n\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\nmat = [[MAX] * (n * 100 + 1) for _ in range(n * 100 + 1)]\r\nfor i in range(n):\r\n mat[0][0] = 0\r\nsmall_mat = min(4, m) * n\r\nfor i in range(small_mat):\r\n for j in range(i + 1):\r\n mat[i + 1][j + 1] = min(mat[i + 1][j + 1], mat[i][j] + a[i % n])\r\n if j > 0:\r\n mat[i + 1][j - 1] = min(mat[i + 1][j - 1], mat[i][j] + b[i % n])\r\nsmall_ans = mat[small_mat][0]\r\nextended_ans = (m - min(4, m)) // 2 * (small_ans - mat[small_mat - 2 * n][0])\r\nprint(small_ans + extended_ans)# 1695403367.1136606" ]

[ "n1=int(input())\r\narr1=list(map(int,input().split()))\r\nn2=int(input())\r\narr2=list(map(int,input().split()))\r\n\r\nif(n1>n2):\r\n temp=n1\r\n n1=n2\r\n n2=temp\r\n temp1=arr1.copy()\r\n arr1=arr2.copy()\r\n arr2=temp1\r\n\r\ntable=[]\r\ncount=[0]*n2\r\ntable1=[]\r\nfor i in range(n2):\r\n table.append([])\r\n \r\nfor i in range(n1):\r\n table1.append([])\r\n \r\nfor i in range(n1):\r\n ct=0\r\n for j in range(n2):\r\n if(arr1[i]==arr2[j]):\r\n if(ct+1>count[j]):\r\n count[j]=ct+1\r\n table[j]=table1[i].copy()\r\n table[j].append(arr1[i])\r\n if(arr1[i]>arr2[j]):\r\n if(count[j]>ct):\r\n ct=count[j]\r\n table1[i]=table[j].copy()\r\n\r\nmx=0\r\nres=[]\r\nfor i in range(n2):\r\n if(count[i]>mx):\r\n mx=count[i]\r\n res=table[i]\r\nprint(mx)\r\nif(mx!=0):\r\n for i in res:\r\n print(i,end=\" \")\r\nelse:\r\n print()\r\n ", "n=int(input())\r\nar=list(map(int,input().split()))\r\nm=int(input())\r\nbr=list(map(int,input().split()))\r\nt=[0]*m\r\nA=[[] for i in range(m)]\r\nfor i in range(n):\r\n c=0\r\n p=-1\r\n for j in range(m):\r\n if(ar[i]==br[j] and c+1>t[j]):\r\n t[j]=c+1\r\n A[j]=(A[p] if p!=-1 else []) +[ar[i]]\r\n if(ar[i]>br[j] and c<t[j]):\r\n c=t[j]\r\n p=j\r\n #print(*A)\r\nmx=max(t)\r\nprint(mx)\r\nif(mx>0):\r\n #print(*t)\r\n ar=[]\r\n for el in A:\r\n if(len(el)>len(ar)):\r\n ar=el\r\n print(*ar)\r\n", "__author__ = 'Darren'\r\n\r\n\r\n# dp(i,j): length of the LCIS between f[0:i+1] and s[0:j+1] that ends at s[j]\r\n# if f[i] == s[j]: dp(i,j) = max_len + 1\r\n# else: dp(i,j) = dp(i-1,j)\r\ndef solve():\r\n n = int(input())\r\n first = list(map(int, input().split()))\r\n m = int(input())\r\n second = list(map(int, input().split()))\r\n if m > n:\r\n n, m = m, n\r\n first, second = second, first\r\n\r\n # dp[j]: LCIS ending at second[j]\r\n # prev[j]: index of the second-to-last number for the LCIS ending at second[j]\r\n dp, prev = [0] * m, [-1] * m\r\n\r\n for i in range(n):\r\n # max_len: length of the LCIS whose largest number is smaller than first[i]\r\n max_len, last_index = 0, -1\r\n for j in range(m):\r\n if first[i] == second[j] and dp[j] < max_len + 1:\r\n dp[j] = max_len + 1\r\n prev[j] = last_index\r\n elif first[i] > second[j] and max_len < dp[j]:\r\n max_len = dp[j]\r\n last_index = j\r\n\r\n # Find the length of LCIS between the first and second sequences, and \r\n # the index of the last common number in the second sequence \r\n max_value, index_max = 0, -1\r\n for index, value in enumerate(dp):\r\n if value > max_value:\r\n max_value = value\r\n index_max = index\r\n \r\n print(max_value)\r\n if max_value > 0:\r\n seq = []\r\n index = index_max\r\n while index >= 0:\r\n seq.append(str(second[index]))\r\n index = prev[index]\r\n seq.reverse()\r\n print(' '.join(seq))\r\n\r\n\r\n\r\nif __name__ == '__main__':\r\n solve()\r\n", "n = int(input())\r\na = [0] + list(map(int, input().split()))\r\nm = int(input())\r\nb = [0] + list(map(int, input().split()))\r\nn += 1\r\nm += 1\r\ndp = [[0] * max(m,n) for i in range(max(m,n))]\r\npr = [0] * (max(n, m) + 1)\r\nans = []\r\nfor i in range(1, n):\r\n for j in range(1, m):\r\n if a[i] == b[j]:\r\n dp[i][j] = 1 #max(1, dp[i][j])\r\n for k in range(1, i): #for k in range(1, i + 1):\r\n if (a[k] < a[i]):\r\n if dp[i][j] < dp[k][j] + 1:\r\n pr[i] = k\r\n dp[i][j] = dp[k][j] + 1\r\n else:\r\n dp[i][j] = dp[i][j - 1]\r\nmi = 1\r\nmj = 1\r\nfor i in range(1, n):\r\n if dp[i][m-1] > dp[mi][m-1]:\r\n mi = i\r\nprint(dp[mi][m-1])\r\nk = dp[mi][m-1]\r\ns = 0\r\nwhile (mi != 0 and k > s):\r\n ans.append(a[mi])\r\n s += 1\r\n mi = pr[mi]\r\nif ans:\r\n ans.reverse()\r\n print(*ans)\r\n'''\r\n5\r\n-12 0 2 5 10\r\n8\r\n0 2 5 10 -12 -15 0 2\r\n\r\n6\r\n-12 0 2 5 10 -12\r\n8\r\n0 2 5 10 -12 -15 0 2\r\n'''", "n = int(input())\r\na = [0] + list(map(int, input().split()))\r\nm = int(input())\r\nb = [0] + list(map(int, input().split()))\r\nd = [[0 for j in range(m + 1)] for i in range(n + 1)]\r\nprev = [0] * (n + 1)\r\nfor i in range(1, n + 1):\r\n for j in range(1, m + 1):\r\n if a[i] == b[j]:\r\n d[i][j] = 1\r\n for k in range(1, i):\r\n if a[k] < a[i] and d[i][j] < d[k][j] + 1:\r\n d[i][j] = d[k][j] + 1\r\n prev[i] = k\r\n else:\r\n d[i][j] = d[i][j - 1]\r\npos = 0\r\nfor i in range(1, n + 1):\r\n if d[pos][m] < d[i][m]:\r\n pos = i\r\nans = []\r\nwhile pos != 0:\r\n ans.append(a[pos])\r\n pos = prev[pos]\r\nprint(len(ans))\r\nprint(*ans[::-1])", "\"\"\"\r\ns1=input()\r\ns2=input()\r\nn=len(s1)\r\nm=len(s2)\r\ndp=[]\r\nfor i in range(n+1):\r\n h=[]\r\n for j in range(m+1):\r\n h.append(0)\r\n dp.append(h)\r\n\r\nfor i in range(1,n+1):\r\n for j in range(1,m+1):\r\n if(s1[i-1]==s2[j-1]):\r\n dp[i][j]=dp[i-1][j-1]+1\r\n else:\r\n dp[i][j]=max(dp[i-1][j],dp[i][j-1])\r\n\r\nprint(dp[n][m])\"\"\"\r\n\r\n\"\"\"\r\nn=int(input())\r\ns1=[int(x) for x in input().split()]\r\nm=int(input())\r\ns2=[int(x) for x in input().split()]\r\n\r\ntable=[0]*m\r\nfor i in range(n):\r\n curr=0\r\n for j in range(m):\r\n if(s1[i]==s2[j]):\r\n table[j]=max(table[j],curr+1)\r\n if(s1[i]>s2[j]):\r\n curr=max(curr,table[j])\r\nprint(max(table))\r\n\"\"\"\r\n\r\nn=int(input())\r\ns1=[0]+[int(x) for x in input().split()]\r\nm=int(input())\r\ns2=[0]+[int(x) for x in input().split()]\r\n\r\ntable=[0]*(m+1)\r\npos=[0]*(m+1)\r\nfor i in range(1,n+1):\r\n curr=0\r\n for j in range(1,m+1):\r\n if(s1[i]==s2[j]):\r\n table[j]=table[curr]+1\r\n pos[j]=curr\r\n if(s1[i]>s2[j] and table[curr]<table[j]):\r\n curr=j\r\np=0\r\nfor i in range(1,m+1):\r\n if(table[i]>table[p]):\r\n p=i\r\n \r\nprint(table[p])\r\ndef out(p):\r\n if(not p):\r\n return\r\n out(pos[p])\r\n print(s2[p],end=\" \")\r\n\r\nout(p)\r\nprint(\" \")\r\n \r\n\r\n \r\n\r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\nm=int(input())\r\nb=list(map(int,input().split()))\r\ndp=[[0]*(m + 1) for i in range(n + 1)]\r\np=[[0]*(m + 1) for i in range(n + 1)]\r\nv1=0\r\nmx=0\r\nfor i in range(1,n+1):\r\n bst=0\r\n v=0\r\n for j in range(1,m+1):\r\n dp[i][j]=dp[i-1][j]\r\n p[i][j]=p[i-1][j]\r\n if(a[i-1]==b[j-1] and bst+1>dp[i][j]):\r\n dp[i][j]=bst+1\r\n p[i][j]=v\r\n if(a[i - 1]>b[j - 1] and dp[i-1][j]>bst):\r\n v=b[j-1]\r\n bst=dp[i-1][j]\r\n if(dp[i][j]>mx):\r\n mx=dp[i][j]\r\n v1 = b[j - 1]\r\nprint(mx)\r\ni=n-1\r\nj=m-1\r\narr=[0]*mx\r\nfor k in range(mx):\r\n while(a[i]!=v1):\r\n i=i-1\r\n while(b[j]!=v1):\r\n j=j-1\r\n arr[mx-1-k]=a[i]\r\n v1=p[i+1][j+1]\r\nfor k in range(mx):\r\n print(arr[k],end=' ')\r\n\n# Tue Aug 04 2020 01:02:44 GMT+0300 (Москва, стандартное время)\n", "def lcis(a, b):\n n, m = len(a), len(b)\n dp = [0]*m\n best_seq, max_len = [], 0\n \n for i in range(n):\n current = 0\n seq = []\n \n for j in range(m):\n if a[i] == b[j]:\n f = seq + [a[i]]\n \n if len(f) > max_len:\n max_len = len(f)\n best_seq = f\n \n dp[j] = max(current+1, dp[j])\n \n if a[i] > b[j]:\n if dp[j] > current:\n current = dp[j]\n seq.append(b[j])\n \n return max_len, best_seq\n\nn = int(input())\na = input().split(' ')\na = [int(x) for x in a]\nm = int(input())\nb = input().split(' ')\nb = [int(x) for x in b]\nx, y = lcis(a, b)\n\nprint(x)\ny = [str(x) for x in y]\nprint(' '.join(y))\n", "# -*- coding: utf-8 -*- \r\n# @project : 《Atcoder》\r\n# @Author : created by bensonrachel on 2021/10/18\r\n# @File : 28.LCIS.py\r\n# 求 find their longest common increasing subsequence最长公共递增子序列。\r\ndef output(w,pre_k):\r\n if(w != -1):\r\n output(pre_k[w],pre_k)\r\n print(b[w-1],end=\" \")\r\n\r\ndef dp_solve():\r\n dp = [[0]*(m+1) for _ in range(n+1)]\r\n pre_k = [-1] * (m+1)\r\n for i in range(1,n+1):\r\n max_k = 0\r\n k = -1\r\n for j in range(1,m+1):\r\n if a[i-1]!=b[j-1]:\r\n dp[i][j] = dp[i-1][j]\r\n if a[i-1]>b[j-1] and max_k < dp[i-1][j] :\r\n max_k = dp[i-1][j]\r\n k = j\r\n else:\r\n dp[i][j] = max_k + 1\r\n pre_k[j] = k\r\n\r\n ans = 0\r\n w = 0\r\n for index,value in enumerate(dp[-1]):\r\n if(value > ans):\r\n ans = value\r\n w = index\r\n\r\n print(ans)\r\n if(ans):\r\n output(w,pre_k)\r\n\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 m = int(input())\r\n b = [int(i) for i in input().split()]\r\n ans = dp_solve()\r\n\r\n\r\n\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\nm = int(input())\r\nb = list(map(int, input().split()))\r\nlenth = [0] * m\r\nelem = [[] for i in range(m)]\r\nfor i in range(n):\r\n c = 0\r\n p = -1\r\n for j in range(m):\r\n if a[i] == b[j] and c + 1 > lenth[j]:\r\n lenth[j] = c + 1\r\n elem[j] = (elem[p] if p != -1 else []) + [a[i]]\r\n if a[i] > b[j] and c < lenth[j]:\r\n c = lenth[j]\r\n p = j\r\nmax_ = max(lenth)\r\nprint(max_)\r\nif max_ > 0:\r\n ar = []\r\n for i in elem:\r\n if len(i) > len(ar):\r\n ar = i\r\n print(*ar)\r\n", "N=int(input())\r\na=list(map(int, input().split()))\r\nM=int(input())\r\nb=list(map(int, input().split()))\r\n\r\ndp=[[0 for j in range(M+1)] for i in range(N+1)]\r\nparent=[[None for j in range(M+1)] for i in range(N+1)]\r\nMax=0\r\nfor i in range(1, N+1):\r\n best=0\r\n for j in range(1, M+1):\r\n dp[i][j]=dp[i-1][j]\r\n parent[i][j]=(i-1, j, False)\r\n if a[i-1]==b[j-1] and dp[i-1][best] + 1>dp[i][j]:\r\n dp[i][j]=dp[i-1][best] + 1\r\n parent[i][j]=(i-1, best, True)\r\n \r\n if dp[i-1][j]>=dp[i-1][best] and a[i-1]>b[j-1]:\r\n best=j\r\n\r\nfor j in range(1, M+1):\r\n if Max<dp[N][j]:\r\n Max=dp[N][j]\r\n im=N\r\n jm=j\r\nans=[None for i in range(Max)]\r\nflag=Max-1\r\nwhile flag>=0:\r\n if parent[im][jm][2]: \r\n ans[flag]=b[jm-1]\r\n flag-=1\r\n im, jm, indikator=parent[im][jm]\r\nprint(len(ans))\r\nprint(*ans)\r\n \r\n \r\n\r\n", "from bisect import insort,bisect_right,bisect_left\nfrom sys import stdout, stdin, setrecursionlimit\nfrom math import sqrt,ceil,floor,factorial,gcd,log2,log10\nfrom io import BytesIO, IOBase\nfrom collections import *\nfrom itertools import *\nfrom random import * \nfrom string import *\nfrom queue import *\nfrom heapq import *\nfrom re import *\nfrom os import *\n\n####################################---fast-input-output----#########################################\n\n\nclass FastIO(IOBase):\n newlines = 0\n\n def __init__(self, file):\n self._fd = file.fileno()\n self.buffer = BytesIO()\n self.writable = \"x\" in file.mode or \"r\" not in file.mode\n self.write = self.buffer.write if self.writable else None\n\n def read(self):\n while True:\n b = read(self._fd, max(fstat(self._fd).st_size, 8192))\n if not b:\n break\n ptr = self.buffer.tell()\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\n self.newlines = 0\n return self.buffer.read()\n\n def readline(self):\n while self.newlines == 0:\n b = read(self._fd, max(fstat(self._fd).st_size, 8192))\n self.newlines = b.count(b\"\\n\") + (not b)\n ptr = self.buffer.tell()\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\n self.newlines -= 1\n return self.buffer.readline()\n\n def flush(self):\n if self.writable:\n write(self._fd, self.buffer.getvalue())\n self.buffer.truncate(0), self.buffer.seek(0)\n\n\nclass IOWrapper(IOBase):\n def __init__(self, file):\n self.buffer = FastIO(file)\n self.flush = self.buffer.flush\n self.writable = self.buffer.writable\n self.write = lambda s: self.buffer.write(s.encode(\"ascii\"))\n self.read = lambda: self.buffer.read().decode(\"ascii\")\n self.readline = lambda: self.buffer.readline().decode(\"ascii\")\n\n\nstdin, stdout = IOWrapper(stdin), IOWrapper(stdout)\ngraph, mod, szzz = {}, 10**9 + 7, lambda: sorted(zzz())\ndef getStr(): return input()\ndef getInt(): return int(input())\ndef listStr(): return list(input())\ndef getStrs(): return input().split()\ndef isInt(s): return '0' <= s[0] <= '9'\ndef input(): return stdin.readline().strip()\ndef zzz(): return [int(i) for i in input().split()]\ndef output(answer, end='\\n'): stdout.write(str(answer) + end)\ndef lcd(xnum1, xnum2): return (xnum1 * xnum2 // gcd(xnum1, xnum2))\n\ndef getPrimes(N = 10**5):\n SN = int(sqrt(N))\n sieve = [i for i in range(N+1)]\n sieve[1] = 0\n for i in sieve:\n if i > SN:\n break\n if i == 0:\n continue\n for j in range(2*i, N+1, i):\n sieve[j] = 0\n prime = [i for i in range(N+1) if sieve[i] != 0] \n return prime\ndef primeFactor(n,prime=getPrimes()):\n lst = []\n mx=int(sqrt(n))+1\n for i in prime:\n if i>mx:break\n while n%i==0:\n lst.append(i)\n n//=i\n if n>1:\n lst.append(n)\n return lst \n\ndx = [-1, 1, 0, 0, 1, -1, 1, -1]\ndy = [0, 0, 1, -1, 1, -1, -1, 1]\ndaysInMounth = [31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31]\n\n\n#################################################---Some Rule For Me To Follow---#################################\n\"\"\"\n --instants of Reading problem continuously try to understand them.\n\n --If you Know some-one , Then you probably don't know him !\n\n --Try & again try, maybe you're just one statement away!\n\n\n\"\"\"\n##################################################---START-CODING---###############################################\n\n\nn=getInt()\narr1 = zzz()\nm = getInt()\narr2 = zzz()\n\nt=[0]*m\na = [[]for i in range(m)]\nfor i in range(n):\n c=0\n p=-1\n for j in range(m):\n if arr1[i]==arr2[j] and c+1>t[j]:\n t[j]=c+1\n a[j]=(a[p] if p!=-1 else [])+[arr1[i]]\n if arr1[i]>arr2[j] and c<t[j]:\n c=t[j]\n p=j\nmx=max(t)\nprint(mx)\n# print(a)\nif mx:\n arr=[]\n for el in a:\n if len(el)==mx:\n arr=el\n print(*arr)\n\n\n\n", "q = int(input())\r\na = [0] + list(map(int, input().split()))\r\nm = int(input())\r\nres = 0\r\nans = []\r\nd = []\r\nprev = []\r\nb = [0] + list(map(int, input().split()))\r\nfor i in range(q + 1):\r\n x = [0] * (m + 1)\r\n d.append(x)\r\n del x\r\n prev.append(0)\r\nfor i in range(1, q + 1):\r\n for j in range(1, m + 1):\r\n if a[i] == b[j]:\r\n d[i][j] = 1\r\n for k in range(1, i):\r\n if a[k] < a[i] and d[i][j] < d[k][j] + 1:\r\n d[i][j] = d[k][j] + 1\r\n prev[i] = k\r\n else:\r\n d[i][j] = d[i][j - 1]\r\nfor i in range(1, q + 1):\r\n if d[res][m] < d[i][m]:\r\n res = i\r\nwhile res != 0:\r\n ans.append(a[res])\r\n res = prev[res]\r\nprint(len(ans))\r\nprint(*ans[::-1])\r\n" ]

[ "from functools import cmp_to_key\r\n\r\nclass Info:\r\n def __init__(self, _id: int, _name: str, _status: str):\r\n self.id = _id\r\n self.name = _name\r\n self.status = _status\r\n\r\n def __str__(self):\r\n return f'id: {self.id}, name: {self.name}, status: {self.status}'\r\n\r\ndef customCompare(obj1:Info, obj2:Info) -> int:\r\n if obj1.status != \"rat\" and obj2.status == \"rat\":\r\n return 1\r\n if obj1.status == \"rat\" and obj2.status != \"rat\":\r\n return -1\r\n if (obj1.status != \"woman\" and obj1.status != \"child\") and (obj2.status == \"woman\" or obj2.status == \"child\"):\r\n return 1\r\n if (obj1.status == \"woman\" or obj1.status == \"child\") and (obj2.status != \"woman\" and obj2.status != \"child\"):\r\n return -1\r\n if obj1.status != \"man\" and obj2.status == \"man\":\r\n return 1\r\n if obj1.status == \"man\" and obj2.status != \"man\":\r\n return -1\r\n\r\n return obj1.id - obj2.id\r\ndef output(cont:list):\r\n for obj in cont:\r\n print(obj)\r\n\r\nn = int(input())\r\ncont = []\r\n\r\nfor i in range(n):\r\n _name, _status = input().split()\r\n obj = Info(i + 1, _name, _status)\r\n cont.append(obj)\r\n\r\ncont.sort(key=cmp_to_key(customCompare))\r\n\r\n\r\nfor obj in cont:\r\n print(obj.name)\r\n", "numero = int(input())\nnombres = []\ntipo = []\norden = []\n\nfor i in range(numero):\n datos = list(str(input()).split())\n nombres.append(datos[0])\n tipo.append(datos[1])\n\nfor i in range(len(tipo)):\n if tipo[i] == 'rat':\n orden.append(nombres[i])\nfor i in range(len(tipo)):\n if tipo[i] == 'woman' or tipo[i]=='child':\n orden.append(nombres[i])\nfor i in range(len(tipo)):\n if tipo[i] == 'man':\n orden.append(nombres[i])\nfor i in range(len(tipo)):\n if tipo[i] == 'captain':\n orden.append(nombres[i])\n\n\nfor j in orden:\n print(j)\n\t \t\t\t \t\t\t \t\t \t\t \t \t\t", "t=int(input())\nl1,l2,l3=[],[],[]\nfor i in range(t):\n n,s=map(str,input().split())\n if s=='rat':\n l1.append(n)\n if s=='child' or s=='woman':\n l2.append(n)\n if s=='man':\n l3.append(n)\n if s=='captain':\n cap=n\nfor i in range(len(l1)):\n print(l1[i])\nfor j in range(len(l2)):\n print(l2[j])\nfor k in range(len(l3)):\n print(l3[k])\nprint(cap)\n \t \t \t \t\t \t\t \t\t \t \t \t\t", "\t\t###~~~LOTA~~~###\r\na=int(input())\r\ncaptain=[]\r\nmen=[]\r\nchildren_women=[]\r\nrats=[]\r\nfor i in range(a):\r\n\ta,b=map(str,input().split())\r\n\tif b=='captain':\r\n\t\tcaptain.append(a)\r\n\telif b=='man':\r\n\t\tmen.append(a)\r\n\telif b=='woman' or b=='child':\r\n\t\tchildren_women.append(a)\r\n\telse:\r\n\t\trats.append(a)\r\nfor i in rats:\r\n\tprint(i)\r\nfor i in children_women:\r\n\tprint(i)\r\nfor i in men:\r\n\tprint(i)\r\nfor i in captain:\r\n\tprint(i)", "\"\"\"\n\nID: brandtnet1\nLANG: PYTHON3\nTASK: test\n\"\"\"\n\nnum = int(input())\n\nrat = []\nwc = []\nman = []\ncap = []\nout = []\n\nfor i in range(num):\n name, b = input().split(\" \")\n if b == 'rat':\n rat.append(name)\n elif b == 'woman' or b == 'child':\n wc.append(name)\n elif b == 'man':\n man.append(name)\n elif b == 'captain':\n cap.append(name)\n\nout = rat + wc + man + cap\n \nfor i in out:\n print(i)\n \n", "r,w,m,c=[],[],[],[]\r\nfor i in range(int(input())):\r\n\tx,y=input().split()\r\n\tif y=='rat':r.append(x)\r\n\telif y=='woman' or y=='child':w.append(x)\r\n\telif y=='man':m.append(x)\r\n\telse:c.append(x)\r\nfor i in r:print(i)\r\nfor j in w:print(j)\r\nfor i in m:print(i)\r\nfor i in c:print(i)", "t=int(input())\r\na=[]\r\nb=[]\r\nfor i in range(t):\r\n n,m=input().split()\r\n a.append(n)\r\n b.append(m)\r\nfor i in range(t):\r\n if(b[i]=='rat'):\r\n print(a[i])\r\nfor i in range(t):\r\n if(b[i]=='woman' or b[i]=='child'):\r\n print(a[i])\r\nfor i in range(t):\r\n if(b[i]=='man'):\r\n print(a[i])\r\nif('captain' in b):\r\n c=b.index('captain')\r\n print(a[c])\r\n ", "n = int(input())\r\nname, status = [], []\r\nfor i in range(n):\r\n L = input().split(' ')\r\n name.append(L[0])\r\n status.append(L[1])\r\nfor i in ['rat', 'woman', 'man', 'captain']:\r\n for j in range(n):\r\n if (status[j] == 'child' and i == 'woman') or i == status[j]:\r\n print(name[j])", "number = int(input())\r\ncrew = []\r\nrats = []\r\nwomen_children = []\r\nmen = []\r\ncaptain = ''\r\nfor _ in range(number):\r\n crew.append(input().split())\r\nfor person in crew:\r\n name, status = person\r\n if status == 'rat':\r\n rats.append(name)\r\n elif status == 'woman':\r\n women_children.append(name)\r\n elif status == 'child':\r\n women_children.append(name)\r\n elif status == 'man':\r\n men.append(name)\r\n else:\r\n captain = name\r\nfor rat in rats:\r\n print(rat)\r\nfor child in women_children:\r\n print(child)\r\nfor man in men:\r\n print(man)\r\nprint(captain)", "n = int(input())\n\ncrew = []\nfor _ in range(n):\n crew.append(input())\n\nfor member in crew:\n member = member.split(' ')\n if member[1] == \"rat\":\n print(member[0])\nfor member in crew:\n member = member.split(' ')\n if member[1] == \"woman\" or member[1] == \"child\":\n print(member[0]) \nfor member in crew:\n member = member.split(' ')\n if member[1] == \"man\":\n print(member[0]) \nfor member in crew:\n member = member.split(' ')\n if member[1] == \"captain\":\n print(member[0])\n", "n=int(input())\r\nlname=[]\r\nltitle=[]\r\nfor i in range(n):\r\n j = input().split(\" \")\r\n lname.append(j[0])\r\n ltitle.append(j[1])\r\nl=[]\r\nfor i in range(len(lname)):\r\n title=ltitle[i]\r\n name=lname[i]\r\n if title==\"rat\":\r\n l.append(name)\r\nfor i in range(len(lname)):\r\n title=ltitle[i]\r\n name=lname[i]\r\n if title==\"woman\" or title==\"child\":\r\n l.append(name)\r\nfor i in range(len(lname)):\r\n title=ltitle[i]\r\n name=lname[i]\r\n if title==\"man\":\r\n l.append(name)\r\nfor i in range(len(lname)):\r\n title=ltitle[i]\r\n name=lname[i]\r\n if title==\"captain\":\r\n l.append(name)\r\nfor i in l:\r\n print(i)", "from collections import defaultdict\r\nd=defaultdict(list)\r\nfor _ in range(int(input())):\r\n a,b=input().split()\r\n if b==\"rat\":\r\n b=0\r\n elif b==\"woman\" or b==\"child\":\r\n b=1\r\n elif b==\"man\":\r\n b=2\r\n else:b=3\r\n d[b].append(a)\r\nwhile d:\r\n mi=min(d)\r\n print(*d[mi],sep=\"\\n\")\r\n del d[mi]\r\n", "n = int(input())\r\nc = []\r\nd = []\r\nfor i in range (n):\r\n a,b = input().split()\r\n c.append(a)\r\n d.append(b)\r\nfor j in range (4):\r\n if j == 0:\r\n k = 'rat'\r\n elif j == 1:\r\n k = ['woman', 'child']\r\n elif j == 2:\r\n k = 'man'\r\n elif j == 3:\r\n k = 'captain'\r\n for i in range (n):\r\n if d[i] in k:\r\n print (c[i])\r\n", "priority = {'captain': 3, 'rat': 0, 'child': 1, 'woman': 1, 'man': 2}\r\n \r\nn = int(input())\r\ncrew = []\r\nfor c in range(n):\r\n x = input().split(' ')\r\n crew.append([x[0], priority[x[1]]])\r\ncrew.sort(key=lambda a : a[1])\r\n \r\nfor c in crew:\r\n print(c[0])", "n = int(input())\r\na = []; b = []\r\nfor i in range(n):\r\n b = list(map(str,input().split()))\r\n a.append(b)\r\nb = []\r\nfor i in range(len(a)):\r\n if a[i][1] == \"rat\": b.append(a[i][0])\r\nfor i in range(len(a)):\r\n if a[i][1] == \"child\" or a[i][1] == \"woman\": b.append(a[i][0])\r\nfor i in range(len(a)):\r\n if a[i][1] == \"man\": b.append(a[i][0])\r\nfor i in range(len(a)):\r\n if a[i][1] == \"captain\": b.append(a[i][0])\r\nfor i in range(len(b)): print(b[i])\r\n", "import functools\r\n\r\ndef custom_key(pass1, pass2):\r\n if(pass1[1] < pass2[1]):\r\n return -1\r\n elif(pass1[1] > pass2[1]):\r\n return 1\r\n else:\r\n return pass1[2] - pass2[2]\r\n\r\nn = int(input())\r\na = []\r\nfor i in range (n):\r\n nm, t = (input().split(' '))\r\n o = -1\r\n if(t == 'rat'):\r\n o = 1\r\n elif (t == 'woman' or t == 'child' ):\r\n o = 2\r\n elif (t == 'man'):\r\n o = 3\r\n else: \r\n o = 4\r\n a.append([nm, o, i])\r\na.sort(key = functools.cmp_to_key(custom_key))\r\n\r\nfor i in range(n):\r\n print(a[i][0])", "n = int(input())\r\n\r\nwomansOrChilds = []\r\nchilds = []\r\nmans = []\r\nrats = []\r\ncaptains = []\r\nfor _ in range(n):\r\n s = input()\r\n s = s.split()\r\n\r\n if s[1] == 'rat':\r\n rats.append(s[0])\r\n if s[1] == 'man':\r\n mans.append(s[0])\r\n if s[1] == 'woman':\r\n womansOrChilds.append(s[0])\r\n if s[1] == 'child':\r\n womansOrChilds.append(s[0])\r\n if s[1] == 'captain':\r\n captains.append(s[0])\r\n \r\n\r\nfor r in rats:\r\n print(r)\r\n\r\nfor w in womansOrChilds:\r\n print(w)\r\n\r\nfor m in mans:\r\n print(m)\r\n\r\nfor c in captains:\r\n print(c)\r\n", "n=int(input())\r\ng={'rat':1,'child':2,'woman':2,'man':3,'captain':4}\r\nc=[]\r\nfor i in range(n):\r\n a,b=input().split()\r\n c.append([a,g[b]])\r\nc.sort(key=lambda x:x[1])\r\nfor i in range(n):\r\n print(c[i][0])", "l = []\r\nn=int(input())\r\nl = [input().split() for _ in range(n)]\r\nfor i in [['rat'], ['woman','child'], ['man'], ['captain']]:\r\n for j in l:\r\n if j[1] in i:print(j[0])", "t= int (input())\r\nl=[]\r\nd={'captain':4,'woman':2,'man':3,'rat':1,'child':2}\r\n \r\n \r\nfor i in range(t):\r\n name, type_= input().split()\r\n l.append([ name, d[type_]])\r\n \r\ns=[]\r\nfor i in range(1,5) :\r\n for name,num in l:\r\n if (i == num) :\r\n s.extend([name])\r\n \r\nfor i in s:\r\n print(i) ", "t=int(input())\nr=[]\nw=[]\nm=[]\nc=[]\nfor i in range(t):\n x,y=map(str,input().split())\n if(y=='rat'):\n r.append(x)\n elif(y==\"woman\" or y=='child'):\n w.append(x)\n elif(y=='man'):\n m.append(x)\n elif(y=='captain'):\n c.append(x)\nfor i in r:\n print(i)\nfor i in w:\n print(i)\nfor i in m:\n print(i)\nfor i in c:\n print(i)\n\t \t \t\t \t \t \t\t \t \t \t \t\t\t", "n=int(input())\r\nrats=[]\r\nwochild=[]\r\nman=[]\r\nfor i in range(0,n):\r\n x,y=input().split()\r\n if y=='rat':\r\n rats.append(x)\r\n elif y=='woman' or y=='child':\r\n wochild.append(x)\r\n elif y=='man':\r\n man.append(x)\r\n else :\r\n captain=x\r\nfor item in rats:\r\n print(item)\r\nfor item in wochild:\r\n print(item)\r\nfor item in man:\r\n print(item)\r\nprint(captain)", "import sys\r\ninput = sys.stdin.readline\r\n\r\nx = [set([\"rat\"]), set([\"woman\", \"child\"]), set([\"man\"]), set([\"captain\"])]\r\nn = int(input())\r\ns = [list(input().rstrip().split()) for _ in range(n)]\r\nans = []\r\nfor i in range(4):\r\n for j, k in s:\r\n if k in x[i]:\r\n ans.append(j)\r\nsys.stdout.write(\"\\n\".join(ans))", "n = int(input())\r\nman = []\r\nwomanchildren = []\r\ncaptain = []\r\nfor i in range(n):\r\n n, r = map(str, input().split())\r\n if r == 'rat':\r\n print(n)\r\n elif r == 'man':\r\n man.append(n)\r\n elif r == 'woman' or r == 'child':\r\n womanchildren.append(n)\r\n elif r == 'captain':\r\n captain.append(n)\r\n\r\nfor i in womanchildren:\r\n print(i)\r\nfor i in man:\r\n print(i)\r\nfor i in captain:\r\n print(i)\r\n\r\n\r\n\r\n", "n = int(input().strip())\r\n\r\ncpt = []\r\nwomen = []\r\nmen = []\r\nrats = []\r\n\r\nfor i in range(n):\r\n\tname,desg = map(str,input().strip().split())\r\n\r\n\tif desg == \"rat\":\r\n\t\trats.append(name)\r\n\r\n\telif desg == \"woman\" or desg == \"child\":\r\n\t\twomen.append(name)\r\n\r\n\telif desg == \"man\":\r\n\t\tmen.append(name)\r\n\r\n\telse:\r\n\t\tcpt.append(name)\r\n\r\n\r\nif len(rats) > 0:\r\n\tprint(\"\\n\".join(rats))\r\n\r\nif len(women) > 0:\r\n\tprint(\"\\n\".join(women))\r\nif len(men) > 0:\r\n\tprint(\"\\n\".join(men))\r\n\r\nif len(cpt) > 0:\r\n\tprint(\"\\n \".join(cpt))\r\n", "n=int(input())\r\nwom_chi=list()\r\nman=list()\r\nrat=list()\r\nf=0\r\nfor i in range(n):\r\n s1=input()\r\n s1=s1.split()\r\n if s1[1]==\"captain\":\r\n cap=s1[0]\r\n f=1\r\n elif s1[1]==\"rat\":\r\n rat.append(s1[0]) \r\n elif s1[1]==\"woman\" or s1[1]==\"child\":\r\n wom_chi.append(s1[0])\r\n elif s1[1]==\"man\":\r\n man.append(s1[0])\r\nfor i in range(0,len(rat)):\r\n print(rat[i])\r\nfor i in range(0,len(wom_chi)):\r\n print(wom_chi[i])\r\nfor i in range(0,len(man)):\r\n print(man[i])\r\nif f==1:\r\n print(cap)\r\n\r\n \r\n \r\n\r\n\r\n\r\n\r\n\r\n ", "n=int(input())\r\nship=[0]*n\r\npriority= {'captain':3, 'woman':1, 'child':1, 'man':2, 'rat':0 }\r\nfor i in range(n):\r\n\tx=input().rstrip().split()\r\n\tship[i]=[priority[x[1]], i, x[0]]\r\nship.sort()\r\nfor i in ship:\r\n\tprint(i[2])\r\n\t\r\n", "def binary_to_decimal(s):\r\n n = 0\r\n for i in range(len(s)):\r\n k = len(s) - 1 - i\r\n n += s[i] * 2 ** k\r\n return n\r\n\r\n\r\ndef decimal_to_binary(n):\r\n i = 0\r\n while 2 ** i <= n:\r\n i += 1\r\n i -= 1\r\n output_list = []\r\n while not i < 0:\r\n if n >= 2 ** i:\r\n output_list.append(1)\r\n n -= 2 ** i\r\n else:\r\n output_list.append(0)\r\n i -= 1\r\n return output_list\r\n\r\n\r\n\r\ndef main_function():\r\n input_data = [[i for i in input().split(\" \")] for j in range(int(input()))]\r\n for i in range(len(input_data)):\r\n if input_data[i][1] == \"woman\" or input_data[i][1] == \"child\":\r\n input_data[i][1] = 1\r\n elif input_data[i][1] == \"rat\":\r\n input_data[i][1] = 0\r\n elif input_data[i][1] == \"man\":\r\n input_data[i][1] = 2\r\n else:\r\n input_data[i][1] = 3\r\n input_data.sort(key=lambda x:x[1])\r\n return \"\\n\".join([i[0] for i in input_data])\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\nprint(main_function())", "n=int(input())\r\nl=[]\r\nfor x in range(n):\r\n a, b=input().split()\r\n l.append((a, b))\r\nsolution=[]\r\nfor x in l:\r\n if x[1]==\"rat\":\r\n solution.append(x[0])\r\nfor x in l:\r\n if x[1]=='woman' or x[1]==\"child\":\r\n solution.append(x[0])\r\nfor x in l:\r\n if x[1]=='man':\r\n solution.append(x[0])\r\nfor x in l:\r\n if x[1]=='captain':\r\n solution.append(x[0])\r\nfor x in solution:\r\n print(x)", "p = [[\"rat\"], [\"woman\", \"child\"], [\"man\"], [\"captain\"]]\r\nc = []\r\nn = int(input())\r\nfor i in range(n):\r\n c.append(list(input().split()))\r\nfor x in p:\r\n for y in c:\r\n if y[1] in x:\r\n print(y[0])", "l={}\nfor i in range(int(input())):\n x,y=map(str,input().split())\n \n l[x]=y\nfor i in l:\n if l[i]==\"rat\":\n print(i)\nfor i in l:\n if l[i] in [\"woman\",\"child\"]:\n print(i)\nfor i in l:\n if l[i]==\"man\":\n print(i)\nfor i in l:\n if l[i]==\"captain\":\n print(i)\n \t\t \t \t\t\t\t\t\t \t \t\t \t \t\t \t\t\t\t", "n=int(input())\r\narr=[]\r\nfor i in range(n):\r\n s,t=map(str,input().split())\r\n arr.append([s,t])\r\nfor i in arr:\r\n if i[1]==\"rat\":\r\n print(i[0])\r\nfor i in arr:\r\n if i[1]==\"woman\" or i[1]==\"child\":\r\n print(i[0])\r\nfor i in arr:\r\n if i[1]==\"man\":\r\n print(i[0])\r\nfor i in arr:\r\n if i[1]==\"captain\":\r\n print(i[0])", "data = [list([i] + input().split()) for i in range(int(input()))]\r\n# print(data)\r\nprint(*[i[1] for i in sorted(data, key=lambda person: (1 if person[2] == 'rat' else 6,\r\n 2 if person[2] == 'woman' or person[2] == 'child' else 6,\r\n 4 if person[2] == 'man' else 6,\r\n 3 if person[2] == 'captain' else 6,\r\n # person[0]\r\n ))], sep='\\n')", "n=int(input())\r\nname=[]\r\nrole=[]\r\nfor i in range(n):\r\n a,b=list(map(str,input().split()))\r\n name.append(a)\r\n role.append(b)\r\nfor i in range(n):\r\n if role[i]=='rat':\r\n print(name[i])\r\nfor i in range(n):\r\n if role[i]=='woman':\r\n print(name[i])\r\n elif role[i]=='child':\r\n print(name[i])\r\nfor i in range(n):\r\n if role[i]=='man':\r\n print(name[i])\r\nfor i in range(n):\r\n if role[i]=='captain':\r\n print(name[i])", "l1=[]\r\nl2=[]\r\nl3=[]\r\nl4=[]\r\nfor _ in range(int(input())):\r\n\tx,y=map(str,input().split())\r\n\tif y==\"rat\":\r\n\t\tl1.append(x)\r\n\tif y==\"woman\" or y==\"child\" :\r\n\t\tl2.append(x)\r\n\tif y==\"man\":\r\n\t\tl3.append(x)\r\n\tif y==\"captain\":\r\n\t\tl4.append(x)\r\nl1=l1+l2+l3+l4\r\nfor i in l1:\r\n\tprint(i)", "crews = [[], [], [], []]\r\n\r\nfor _ in range(int(input())):\r\n crew = input().split()\r\n i = -1\r\n if crew[1] == 'rat':\r\n i = 0\r\n if crew[1] in ['woman', 'child']:\r\n i = 1\r\n if crew[1] == 'man':\r\n i = 2\r\n if crew[1] == 'captain':\r\n i = 3\r\n crews[i].append(crew[0])\r\nfor group in crews:\r\n if not group:\r\n continue\r\n print('\\n'.join(group))", "r=[]\nwc=[]\nm=[]\no=[]\nfor i in range(int(input())):\n\ta,b=input().split()\n\tif b==\"rat\":\n\t\tr.append(a)\n\telif ((b==\"woman\") or (b==\"child\")):\n\t\twc.append(a)\n\telif b==\"man\":\n\t\tm.append(a)\n\telse:\n\t\to.append(a)\nfor i in r:\n\tprint(i)\nfor i in wc:\n\tprint(i)\nfor i in m:\n\tprint(i)\nfor i in o:\n\tprint(i)\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\nt=[]\r\nfor i in range(n):\r\n x=input()\r\n a,b=x.split()\r\n t.append([b,a])\r\n\r\nfor k in t:\r\n if k[0]==\"rat\":\r\n print(k[1])\r\nfor k in t:\r\n if k[0]==\"woman\" or k[0]==\"child\":\r\n print(k[1])\r\nfor k in t:\r\n if k[0]==\"man\":\r\n print(k[1])\r\nfor k in t:\r\n if k[0]==\"captain\":\r\n print(k[1])\r\n", "n = int(input())\r\n\r\nv = []\r\nfor i in range(n):\r\n\tx,y = input().split()\r\n\tv.append([x,y])\r\nStatus = ['rat', 'woman', 'child', 'man', 'captain']\r\n\r\nfor status in Status:\r\n\tfor i in range(n):\r\n\t\tif status == v[i][1]:\r\n\t\t\tprint(v[i][0])\r\n\t\t\tv[i] = [\"\", \"\"]\r\n\t\telif status == \"woman\" and v[i][1] == \"child\":\r\n\t\t\tprint(v[i][0])\r\n\t\t\tv[i] = [\"\", \"\"]", "t = int(input())\nd = {}\nl =[]\na =[]\nfor i in range(t):\n name , gender = [x for x in input().split()]\n gender = gender.lower()\n d[name] = gender\n l.append(name)\nfor i in range(len(l)):\n if(d[l[i]] == \"rat\"):\n a.append(l[i])\nfor i in range(len(l)):\n if(d[l[i]] == \"woman\" or d[l[i]] == \"child\"):\n a.append(l[i])\nfor i in range(len(l)):\n if(d[l[i]] == \"man\"):\n a.append(l[i])\nfor i in range(len(l)):\n if(d[l[i]] == \"captain\"):\n a.append(l[i])\nfor i in a:\n\tprint(i,end = \"\\n\")\n \t\t \t\t\t\t \t \t \t \t \t\t", "n = int(input())\r\ncrew = []\r\nstatus = [\"rat\", [\"woman\", \"child\"], \"man\", \"captain\"]\r\nleave_first = []\r\n\r\nfor i in range(n):\r\n crew.append(input())\r\n\r\nfor i in range(len(status)):\r\n for j in range(n):\r\n if(i == 1):\r\n if(crew[j].split(\" \")[1] == status[1][0]):\r\n leave_first.append(crew[j].split(\" \")[0])\r\n elif(crew[j].split(\" \")[1] == status[1][1]):\r\n leave_first.append(crew[j].split(\" \")[0])\r\n elif(crew[j].split(\" \")[1] == status[i]):\r\n leave_first.append(crew[j].split(\" \")[0])\r\n\r\nfor i in leave_first:\r\n print(i)", "n=int(input())\r\nli=[]\r\nli1=[]\r\nci=[]\r\nfor i in range(n):\r\n a,b=input().split()\r\n if b==\"woman\" or b==\"child\":\r\n li1.append(a)\r\n elif b==\"rat\":\r\n li.append(a)\r\n elif b==\"man\":\r\n ci.append(a)\r\n else:\r\n d=a\r\nli1=li+li1+ci+[d]\r\nfor i in li1:\r\n print(i)\r\n\r\n\r\n", "n = int(input())\r\n\r\nrats = []\r\nwoild = []\r\nmen = []\r\ncaptain = ''\r\n\r\nfor i in range(n):\r\n\tname, rank = input().split()\r\n\tif rank == 'rat': rats.append(name)\r\n\tif rank == 'man': men.append(name)\r\n\tif rank == 'woman' or rank == 'child': woild.append(name)\r\n\tif rank == 'captain': captain = name\r\n\r\n\r\nfor rat in rats:print(rat)\r\nfor x in woild: print(x)\r\nfor man in men:print(man)\r\nprint(captain)", "# Function to determine the evacuation order\r\ndef evacuate_crew(n, crew_info):\r\n # Create a list of tuples (name, status, position)\r\n crew_list = [(crew_info[i][0], crew_info[i][1], i) for i in range(n)]\r\n\r\n # Define a custom sorting order\r\n def sorting_order(member):\r\n order = {\"rat\": 1, \"woman\": 2, \"child\": 2, \"man\": 3, \"captain\": 4}\r\n return order[member[1]]\r\n\r\n # Sort the crew list based on the custom order and original position\r\n crew_list.sort(key=lambda x: (sorting_order(x), x[2]))\r\n\r\n # Print the names of the crew members in the sorted order\r\n for member in crew_list:\r\n print(member[0])\r\n\r\n# Read the input\r\nn = int(input().strip())\r\ncrew_info = []\r\nfor _ in range(n):\r\n name, status = input().strip().split()\r\n crew_info.append((name, status))\r\n\r\n# Call the evacuation function\r\nevacuate_crew(n, crew_info)\r\n\r\n\r\n\r\n\r\n", "\r\n\r\nn = int(input())\r\nm = []\r\nans = [None]*n\r\ny=0\r\nfor _ in range(n):\r\n \r\n x = input().split()\r\n if x[1]=='captain':\r\n ans[n-1]=x[0]\r\n elif x[1]=='rat':\r\n ans[y]=x[0]\r\n y+=1\r\n else:\r\n m.append(x)\r\n\r\n\r\nfor i in range(len(m)):\r\n if m[i][1]=='woman' or m[i][1]=='child':\r\n ans[y]=m[i][0]\r\n y+=1\r\nfor i in range(len(m)):\r\n if m[i][1]=='man':\r\n ans[y]=m[i][0]\r\n y+=1\r\nfor i in ans:\r\n print(i)", "t=int(input())\nn=[]\nfor i in range(t):\n a=tuple(map(str,input().split()))\n n.append(a)\ns = {\"rat\":1,\"woman\":2,\"child\":2,\"man\":3,\"captain\":5}\nn.sort(key = lambda x:s[x[1]])\nfor i in n:\n print(i[0])\n \t \t \t \t \t \t \t \t\t \t\t \t\t", "def main(n,a):\r\n rat=[]\r\n woman=[]\r\n men=[]\r\n captain=[]\r\n for i in range(n):\r\n if(a[i].split()[1]=='rat'):\r\n rat.append(a[i].split()[0])\r\n elif(a[i].split()[1]=='woman' or a[i].split()[1]=='child'):\r\n woman.append(a[i].split()[0])\r\n elif(a[i].split()[1]=='man'):\r\n men.append(a[i].split()[0])\r\n else:\r\n captain.append(a[i].split()[0])\r\n for i in rat:\r\n print(i)\r\n for i in woman:\r\n print(i)\r\n for i in men:\r\n print(i)\r\n for i in captain:\r\n print(i)\r\n\r\n\r\n\r\n\r\nif __name__ == \"__main__\" :\r\n n=int(input())\r\n a=[]\r\n for i in range(n):\r\n a.append(input())\r\n main(n,a)\r\n", "n = int(input())\r\n\r\nrats = []\r\nwomen = []\r\nmen = []\r\ncaptain = None\r\n\r\nfor _ in range(n):\r\n a, b = input().split()\r\n\r\n if b[:2] == 'ca':\r\n captain = a\r\n elif b[0] == 'r':\r\n rats.append(a)\r\n elif b[0] == 'm':\r\n men.append(a)\r\n else:\r\n women.append(a)\r\n\r\nprint(*rats, *women, *men, captain, sep=\"\\n\")", "n=int(input())\n\nr=[]\ns=[]\nm=[]\nc=[]\nfor i in range(n):\n\tx,y=input().split()\n\tif y==\"rat\":\n\t\tr.append(x)\n\telif y==\"woman\" or y==\"child\":\n\t\ts.append(x)\n\telif y==\"man\":\n\t\tm.append(x)\n\telif y==\"captain\":\n\t\tc.append(x)\nt=r+s+m+c\t\t\nfor i in t:\n\tprint(i)\n \n\t\t\n\t\t\n \t \t \t \t \t\t \t \t\t\t", "n=int(input())\r\nrat=[]\r\nwom_ch=[]\r\nman=[]\r\ncap=[]\r\nfor i in range(n):\r\n sp=[i for i in input().split()]\r\n if sp[1]=='rat':\r\n rat.append(sp[0])\r\n elif sp[1]=='woman' or sp[1]=='child':\r\n wom_ch.append(sp[0])\r\n elif sp[1]=='man':\r\n man.append(sp[0])\r\n else:\r\n cap.append(sp[0])\r\nfor i in range(len(rat)):\r\n print(rat[i])\r\nfor i in range(len(wom_ch)):\r\n print(wom_ch[i])\r\nfor i in range(len(man)):\r\n print(man[i])\r\nfor i in range(len(cap)):\r\n print(cap[i])", "from sys import stdin; inp = stdin.readline\r\nfrom math import dist, ceil, floor, sqrt, log\r\nfrom collections import defaultdict, Counter, deque\r\ndef IA(sep=' '): return list(map(int, inp().split(sep)))\r\ndef FA(): return list(map(float, inp().split()))\r\ndef SA(): return inp().split()\r\ndef I(): return int(inp())\r\ndef F(): return float(inp())\r\ndef S(): return input()\r\ndef O(l:list): return ' '.join(map(str, l))\r\nfrom operator import itemgetter\r\n\r\ndef main():\r\n n = I()\r\n q = []\r\n prios = {'rat':1, 'woman':2, 'child':2, 'man':3, 'captain':4}\r\n for _ in range(n):\r\n m, t = S().split()\r\n q.append((m, prios[t]))\r\n q.sort(key=itemgetter(1))\r\n for m in q:\r\n print(m[0])\r\n\r\nif __name__ == '__main__':\r\n main()", "n = int(input())\r\na0 = []\r\na1 = []\r\na2 = []\r\na3 = []\r\n\r\nfor x in range(n):\r\n name, p = input().split()\r\n # print(name)\r\n if p == \"rat\":\r\n a0.append(name)\r\n elif p == \"child\" or p == \"woman\":\r\n a1.append(name)\r\n elif p == \"man\":\r\n a2.append(name)\r\n elif p == 'captain':\r\n a3.append(name)\r\nfor x in a0, a1, a2, a3:\r\n if x != []:\r\n for y in x:\r\n print(y)\r\n", "n = int(input())\ncrew = [[],[],[],[]]\nfor i in range(n):\n name,role = input().split()\n if role == 'captain':\n crew[3].append(name)\n if role == 'man':\n crew[2].append(name)\n if role == 'woman' or role == 'child':\n crew[1].append(name)\n if role == 'rat':\n crew[0].append(name)\nfor group in crew :\n [print(member) for member in group]\n", "def mergesOrt(l1,l2):\r\n n = len(l1)\r\n if n>1:\r\n divide = n//2 \r\n left,right = l1[:divide],l1[divide::]\r\n nl,nr = len(left),len(right)\r\n mergesOrt(left,l2)\r\n mergesOrt(right,l2)\r\n a = 0\r\n b = 0\r\n c = 0\r\n \r\n while a < nl and b < nr:\r\n if l2.index(left[a])<l2.index(right[b]):\r\n l1[c] = left[a]\r\n a+=1 \r\n else:\r\n l1[c] = right[b]\r\n b+=1 \r\n c +=1 \r\n \r\n while a <len(left):\r\n l1[c] = left[a]\r\n a+=1 \r\n c+=1 \r\n \r\n while b <len(right):\r\n l1[c] = right[b]\r\n b+=1 \r\n c+=1 \r\n return l1\r\n\r\n\r\nn = int(input())\r\nd1 = dict()\r\nl2 = []\r\nfor i in range(0,n):\r\n l1 = list(input().split())\r\n l2.append(l1[0])\r\n d1[l1[0]] = l1[1]\r\nchild,man,rat,captain,woman = [],[],[],[],[]\r\nfor i in d1:\r\n if d1[i] == 'captain':\r\n captain.append(i)\r\n elif d1[i] == 'woman' or d1[i] == 'child':\r\n woman.append(i)\r\n elif d1[i] == 'man':\r\n man.append(i)\r\n else:\r\n rat.append(i)\r\nrat = mergesOrt(rat,l2)\r\nfor i in rat: \r\n print(i)\r\nwoman = mergesOrt(woman,l2)\r\nfor i in woman:\r\n print(i)\r\nchild = mergesOrt(child,l2)\r\nfor i in child:\r\n print(i)\r\nman = mergesOrt(man,l2)\r\nfor i in man:\r\n print(i)\r\ncaptain= mergesOrt(captain,l2)\r\nfor i in captain:\r\n print(i)\r\n", "\npassengers = int(input())\nhold = []\nrats = []\nwomch = []\nman = []\ncap = []\nfor x in range(passengers):\n crew, types = input().split()\n if types == 'captain':\n cap.append(crew)\n elif types == 'woman' or types == 'child':\n womch.append(crew)\n elif types == 'man':\n man.append(crew)\n else:\n rats.append(crew)\n\nhold = rats + womch + man + cap\n\nfor x in hold:\n print(x)\n", "# Do you need any discussion with me?\n# Join: https://chat.whatsapp.com/E2iFdzBnw1KAJukwd7Y5Pz\n\n# from math import gcd, log, floor, ceil, floor\nimport collections\n\n# ........................................\ndef quick_sort(nums):\n if len(nums) <= 1:\n return nums\n else:\n pivot = nums[0]\n less = [i for i in nums[1:] if i <= pivot]\n high = [i for i in nums[1:] if i > pivot]\n\n sortedNums = quick_sort(less)\n sortedNums.extend([pivot])\n sortedNums.extend(quick_sort(high))\n\n return sortedNums\n\n\n # if numbers are string\n # less = [int(i) for i in nums[1:] if i <= pivot]\n # high = [int(i) for i in nums[1:] if i > pivot]\n \n \n # return quick_sort(less) + [pivot] + quick_sort(high)\n\n\ndef lexicographical_small(x, y):\n i = 0\n while i < len(x) and i < len(y):\n if x[i] < y[i]:\n return x\n elif y[i] < x[i]:\n return y\n i += 1\n \n \n if len(x) < len(y):\n return x\n elif len(y) < len(x):\n return y\n else: # equal\n return x\n\n\ndef sumOfDigit(num):\n total = 0\n while num != 0:\n div = num % 10\n total += div\n num = num // 10\n return total\n \n # or\n # nums = list(map(int, str(num))\n # return sum(nums)\n\n\ndef subLists(value):\n # res = [[]]\n for i in range(len(value) + 1):\n for j in range(i):\n yield value[j:i]\n # res.append(value[j:i])\n \n \n return value[1:] # skip empty sublist\n\n\ndef stringPalindrome(s):\n if s == s[::-1]:\n return True\n else:\n return False\n\n\ndef frequencyCount(s):\n fre = dict(collections.Counter(s))\n\n return fre\n\ndef prime(n):\n c = 0\n for i in range(2, n):\n if n % i == 0:\n c = c + 1\n break\n if c == 0:\n return True\n else:\n return False\n \n\n# sortedDict = {k: fre[k] for k in sorted(fre)}\n# return sortedDict\n\ndef notes(n):\n t = 0\n if n >= 100:\n res = n // 100\n t += (n // 100)\n n = n - (res * 100)\n if n >= 50:\n res = n // 50\n t += (n // 50)\n n = n - (res * 50)\n if n >= 10:\n res = n // 10\n t += (n // 10)\n n = n - (res * 10)\n if n >= 5:\n res = n // 5\n t += (n // 5)\n n = n - (res * 5)\n if n >= 2:\n res = n // 2\n t += (n // 2)\n n = n - (res * 2)\n if n >= 1:\n res = n // 1\n t += (n // 1)\n n = n - (res * 1)\n print(t)\n\ndef ch():\n s = [\"gf\", \"gt\"]\n s.remove(\"gf\")\n print(s)\n\n\ndef solve():\n n = int(input())\n woman = []\n rat = []\n man = []\n captain = []\n \n \n for i in range(n):\n name, s = map(str, input().split())\n if s == \"woman\" or s == \"child\":\n woman.append(name)\n elif s == \"rat\":\n rat.append(name)\n elif s == \"captain\":\n captain.append(name)\n elif s == \"man\":\n man.append(name)\n\n\n if len(rat) != 0:\n for i in rat:\n print(i)\n \n if len(woman) != 0:\n for i in woman:\n print(i)\n \n if len(man) != 0:\n for i in man:\n print(i)\n \n if len(captain) != 0:\n for i in captain:\n print(i)\n \n\n \n \n # ch()\n # a, b = map(int, input().split())\n # nums = []\n # if a == b and a == 1:\n # print(-1)\n # elif a == b:\n # if prime(a):\n # print(1)\n # else:\n # for i in range(b, a-1, -1):\n # if prime(i):\n # nums.append(i)\n\n # if len(nums) == 0:\n # print(-1)\n # else:\n # print(max(nums))\n \n\n\ndef main():\n # t = int(input())\n t = 1\n for _ in range(t):\n # ch()\n solve()\n\nif __name__ == \"__main__\":\n main()\n\n\n\n\n \t\t \t\t \t \t\t\t \t \t \t\t \t\t\t", "n=int(input())\r\nman=[]\r\nwoman=[]\r\nrat=[]\r\nfor i in range(n):\r\n x,y=input().split()\r\n if y==\"captain\":\r\n cap=x\r\n continue\r\n if y==\"rat\":\r\n rat.append(x)\r\n if y==\"man\":\r\n man.append(x)\r\n continue\r\n if y==\"woman\" or y==\"child\":\r\n woman.append(x)\r\nl=rat+woman+man\r\nfor i in l:\r\n print(i)\r\nprint(cap)", "n = int(input())\r\na = []\r\nfor i in range(1, n + 1):\r\n b,c = input().split()\r\n c = 1 if c == \"rat\" else 2 if c == \"woman\" or c == \"child\" else 3 if c == \"man\" else 4\r\n a.append([b, c + i / 1000])\r\na = list(sorted(a, key=lambda x: x[1]))\r\nfor i in a:\r\n print(i[0])", "n = int(input())\r\na = []\r\nb = []\r\nfor i in range(n):\r\n\tab = input().split(' ')\r\n\ta.append(ab[0])\r\n\tb.append(ab[1])\r\n\r\nfor i in range(n):\r\n\tif(b[i] == 'rat'):\r\n\t\tprint(a[i])\r\n\r\nfor i in range(n):\r\n\tif(b[i] == 'child' or b[i] == 'woman'):\r\n\t\tprint(a[i])\r\n\r\nfor i in range(n):\r\n\tif(b[i] == 'man'):\r\n\t\tprint(a[i])\r\n\r\nfor i in range(n):\r\n\tif(b[i] == 'captain'):\r\n\t\tprint(a[i])", "from collections import defaultdict\nd=defaultdict(list)\nfor i in range(int(input())):\n n,m=map(str,input().split())\n if m==\"woman\" or m==\"child\":\n m=\"w\"\n d[m].append(n)\nfor i in [\"rat\",\"w\",\"man\",\"captain\"]:\n for j in d[i]:\n print(j)\n\n \t\t \t \t \t \t \t\t\t \t \t", "n= int (input())\r\nx=[]\r\nd={'captain':4,'woman':2,'man':3,'rat':1,'child':2}\r\n\r\n\r\nfor i in range(n):\r\n name, type_= input().split()\r\n x.append([ name, d[type_]])\r\n\r\nx2=[]\r\nfor i in range(1,5) :\r\n for name,num in x:\r\n if (i == num) :\r\n x2.extend([name])\r\n\r\nfor i in x2:\r\n print(i) ", "lc=[]\nlwoc=[]\nlm=[]\nlr=[]\nfor iii in range(int(input())):\n b,a=input().split()\n if(a=='woman' or a=='child'):\n lwoc+=[b]\n elif(a=='captain'):\n lc+=[b]\n elif(a=='rat'):\n lr+=[b]\n elif(a=='man'):\n lm+=[b]\nfor i in lr:\n print(i)\nfor i in lwoc:\n print(i)\nfor i in lm:\n print(i)\nfor i in lc:\n print(i)\n\t\t \t\t \t \t\t \t \t\t\t\t \t \t \t\t", "import heapq\r\nd = {'rat':0,'woman':1,'child':1,'man':2,'captain':3}\r\nmq = []\r\nnames = []\r\nn = int(input().strip())\r\nfor i in range(n):\r\n n, p = [a for a in input().strip().split()]\r\n names.append(n)\r\n heapq.heappush(mq, (d[p],i))\r\nwhile mq:\r\n top = heapq.heappop(mq)\r\n print(names[top[1]])", "n=int(input())\r\nns=[[\"rat\"],[\"woman\",\"child\"],[\"man\"],[\"captain\"]]\r\nar=[input().split() for i in range(n)]\r\nfor e in ns:\r\n br=ar.copy()\r\n for el in ar:\r\n if(el[1] in e):\r\n print(el[0])\r\n del br[br.index(el)]\r\n ar=br.copy()\r\n \r\n", "def main():\r\n\tn = int(input())\r\n\tli = []\r\n\tfor _ in range(n):\r\n\t\tname, status = str(input()).split(' ')\r\n\t\tif status == 'captain':\r\n\t\t\tli.append([name, 3])\r\n\t\telif status == 'rat':\r\n\t\t\tli.append([name, 0])\r\n\t\telif status == 'man':\r\n\t\t\tli.append([name, 2])\r\n\t\telse:\r\n\t\t\tli.append([name, 1])\r\n\r\n\tli.sort(key = lambda x: x[1])\r\n\r\n\tfor el in li:\r\n\t\tprint(el[0])\r\n\r\nif __name__ == '__main__':\r\n\tmain()", "data = [list([i] + input().split()) for i in range(int(input()))]\r\n# print(data)\r\nprint(*[i[1] for i in sorted(data, key=lambda person: (person[2] != 'rat',\r\n person[2] != 'woman' or person[2] != 'child',\r\n person[2] == 'captain',\r\n person[2] == 'man',\r\n person[0]\r\n ))], sep='\\n')\r\n", "# Long Contest 1, Problem K\ndef print_list(items):\n\tfor item in items:\n\t\tprint(item)\n\t\nn = int(input())\nrats = []\nwomen_children = []\nmen = []\ncaptains = []\nwhile n > 0:\n\tn -= 1\n\tname, status = input().split()\n\tif status == 'rat':\n\t\trats.append(name)\n\telif status == 'woman' or status == 'child':\n\t\twomen_children.append(name)\n\telif status == 'man':\n\t\tmen.append(name)\n\telif status == 'captain':\n\t\tcaptains.append(name)\nprint_list(rats)\nprint_list(women_children)\nprint_list(men)\nprint_list(captains)\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\nlrat=[]\r\nlwoch=[]\r\nlman=[]\r\ncap=\"\"\r\nfor q in range(n):\r\n nm,ty=input().split()\r\n if ty==\"captain\":\r\n cap=nm\r\n elif ty==\"rat\":\r\n lrat.append(nm)\r\n elif ty==\"woman\" or ty==\"child\":\r\n lwoch.append(nm)\r\n elif ty==\"man\":\r\n lman.append(nm)\r\nfor el in lrat:\r\n print(el)\r\nfor el in lwoch:\r\n print(el)\r\nfor el in lman:\r\n print(el)\r\nprint(cap)\r\n\r\n", "x = []\nn = int(input())\nfor i in range(n):\n x.append(input().split())\nfor i in range (0,n):\n if x[i][1] == 'rat':\n print( x[i][0])\nfor i in range (0,n):\n if x[i][1] == 'woman':\n print (x[i][0])\n if x[i][1] == 'child':\n print (x[i][0])\n\nfor i in range(0,n):\n if x[i][1] == 'man':\n print (x[i][0])\nfor i in range(0,n):\n if x[i][1] == 'captain':\n print (x[i][0] ) \n \t \t \t \t \t \t\t \t\t \t", "numPeople = int(input())\r\npeople = []\r\norder =[]\r\nfor i in range(numPeople):\r\n person = input().split()\r\n people.append(person)\r\nfor i in range(numPeople):\r\n if people[i][1] == \"rat\":\r\n order.append(people[i][0])\r\nfor i in range(numPeople):\r\n if people[i][1] == \"woman\" or people[i][1] == \"child\":\r\n order.append(people[i][0])\r\nfor i in range(numPeople):\r\n if people[i][1] == \"man\":\r\n order.append(people[i][0])\r\nfor i in range(numPeople):\r\n if people[i][1] == \"captain\":\r\n order.append(people[i][0])\r\nfor i in order:\r\n print(i)\r\n", "n=int(input())\ndic={}\nfor i in range(n):\n name,crew=input().split()\n dic[name]=crew\nfor key,value in dic.items():\n if value=='rat':\n print(key)\nfor key, value in dic.items():\n if value=='child':\n print(key)\n if value=='woman':\n print(key)\nfor key, value in dic.items():\n if value=='man':\n print(key)\nfor key, value in dic.items():\n if value=='captain':\n print(key)\n\t\t \t\t\t\t\t \t\t \t \t\t\t \t\t\t \t \t\t", "n=int(input())\r\nrat=[]\r\nwomen=[]\r\nmen=[]\r\n\r\ncaptain=[]\r\n\r\nfor i in range(n):\r\n p=list(input().split())\r\n if(p[1]==\"captain\"):\r\n captain.append(p[0])\r\n if(p[1]==\"woman\" or p[1]==\"child\"):\r\n women.append(p[0])\r\n \r\n if(p[1]==\"man\"):\r\n men.append(p[0])\r\n if(p[1]==\"rat\"):\r\n rat.append(p[0])\r\n \r\nfor i in range(len(rat)):\r\n print(rat[i])\r\nfor i in range(len(women)):\r\n print(women[i])\r\n\r\nfor i in range(len(men)):\r\n print(men[i])\r\nfor i in range(len(captain)):\r\n print(captain[i])\r\n\r\n\r\n", "t=int(input())\nk=[]\nfor i in range(t):\n k.append(input().split())\n\nfor i in range(t):\n if(k[i][1]=='rat'):\n print(k[i][0])\nfor i in range(t):\n if(k[i][1]=='child' or k[i][1]=='woman'):\n print(k[i][0])\nfor i in range(t):\n if(k[i][1]=='man'):\n print(k[i][0])\nfor i in range(t):\n if(k[i][1]=='captain'):\n print(k[i][0])\n\t\t \t \t\t \t \t \t \t\t \t \t\t\t\t\t", "n = int(input())\na = [input() for i in range(n)]\nd = {x:i for i,x in enumerate(['rat','woman','child','man','captain'])}\nd['woman'] = d['child']\na.sort(key = lambda x:d[x.split()[-1]])\nfor i in a:\n\tprint(i.split()[0])\n\t \t\t \t \t \t\t \t\t\t\t \t\t \t\t\t\t\t", "crew_members = [input().split() for _ in range(int(input()))]\r\n\r\nfor status_values in ('rat', ('woman', 'child'), 'man', 'captain'):\r\n for name, status in crew_members:\r\n if status in status_values:\r\n print(name)", "\"\"\"\r\n author: Adham0 \r\n created: 05.08.2023 03:44:09\r\n ### I was here ###\r\n \r\n █████ ██████ ██ ██ █████ ███ ███\r\n ██ ██ ██ ██ ██ ██ ██ ██ ████ ████\r\n ███████ ██ ██ ███████ ███████ ██ ████ ██\r\n ██ ██ ██ ██ ██ ██ ██ ██ ██ ██ ██ \r\n ██ ██ ██████ ██ ██ ██ ██ ██ ██\r\n\"\"\"\r\n\r\nn = int(input())\r\n\r\nlst = []\r\n\r\nfor i in range(n):\r\n lst += [input().split()]\r\n\r\ndict = {\"rat\": 1, \"woman\": 2, \"child\": 2, \"man\": 3, \"captain\": 4}\r\n\r\nlst = sorted(lst, key = lambda x: dict[x[1]])\r\n\r\nfor i in range(len(lst)):\r\n print(lst[i][0])", "def main():\r\n n = int(input())\r\n d = {'rat': [], 'wc': [], 'man': [], 'cap': []}\r\n for _ in range(n):\r\n s = input().split()\r\n if s[1] == 'captain':\r\n d['cap'].append(s[0])\r\n elif s[1] == 'man':\r\n d['man'].append(s[0])\r\n elif s[1] == 'woman':\r\n d['wc'].append(s[0])\r\n elif s[1] == 'child':\r\n d['wc'].append(s[0])\r\n elif s[1] == 'rat':\r\n d['rat'].append(s[0])\r\n for v in d.values():\r\n for i in range(len(v)):\r\n print(v[i])\r\n\r\n\r\nif __name__ == '__main__':\r\n main()", "# ░░░░░░░░░░░░░░░░░░░░░░░░░░░░╔═══╗╔╗╔═══╦═══╗\r\n# ░░░░░░░░░░░░░░░░░░░░░░░░░░░░║╔═╗╠╝║║╔═╗║╔═╗║\r\n# ╔══╦═╗╔══╦═╗╔╗░╔╦╗╔╦══╦╗╔╦══╬╝╔╝╠╗║║║║║╠╝╔╝║\r\n# ║╔╗║╔╗╣╔╗║╔╗╣║░║║╚╝║╔╗║║║║══╬╗╚╗║║║║║║║║░║╔╝\r\n# ║╔╗║║║║╚╝║║║║╚═╝║║║║╚╝║╚╝╠══║╚═╝╠╝╚╣╚═╝║░║║░\r\n# ╚╝╚╩╝╚╩══╩╝╚╩═╗╔╩╩╩╩══╩══╩══╩═══╩══╩═══╝░╚╝░\r\n# ░░░░░░░░░░░░╔═╝║░░░░░░░░░░░░░░░░░░░░░░░░░░░░\r\n# ░░░░░░░░░░░░╚══╝░░░░░░░░░░░░░░░░░░░░░░░░░░░░\r\n\r\n\r\na=int(input())\r\nr=[]\r\nw=[]\r\nm=[]\r\nca=[]\r\nfor i in range(a):\r\n c=list(map(str,input().split()))\r\n if(c[1]=='rat'):\r\n r.append(c[0])\r\n elif(c[1]=='woman' or c[1]=='child'):\r\n w.append(c[0])\r\n elif(c[1]=='man'):\r\n m.append(c[0])\r\n elif(c[1]=='captain'):\r\n ca.append(c[0])\r\n\r\nt=r+w+m\r\n\r\nfor i in range(a-1):\r\n print(t[i])\r\nprint(''.join(ca),end=' ')", "t=int(input())\nl1,l2,l3=[],[],[]\nfor i in range(t):\n h,r=map(str,input().split())\n if r=='rat':\n l1.append(h)\n if r=='child' or r=='woman':\n l2.append(h)\n if r=='man':\n l3.append(h)\n if r=='captain':\n capt=h\nfor i in range(len(l1)):\n print(l1[i])\nfor j in range(len(l2)):\n print(l2[j])\nfor k in range(len(l3)):\n print(l3[k])\nprint(capt)\n \t \n \t\t \t\t \t \t\t \t \t \t \t\t\t \t\t \t", "t=int(input())\r\nmas1=[]\r\nmas2=[]\r\nmas3=[]\r\nmas4=[]\r\nfor i in range(t):\r\n n,m=input().split()\r\n if m=='rat':\r\n mas1.append(n)\r\n \r\n elif m=='woman' or m=='child':\r\n mas2.append(n)\r\n\r\n elif m=='man':\r\n mas3.append(n)\r\n\r\n else:\r\n mas4.append(n)\r\n \r\nk=mas1+mas2+mas3+mas4\r\nfor i in k:\r\n print(i)\r\n\r\n\r\n", "n = int(input())\r\nadict = {\"rat\":[], \"woman\": [], \"man\": [], \"captain\":[]}\r\n\r\nfor _ in range(n):\r\n name, kind = input().split()\r\n \r\n if kind == \"child\":\r\n kind = \"woman\"\r\n \r\n adict[kind].append(name)\r\n \r\nprint(*adict[\"rat\"], *adict[\"woman\"], *adict[\"man\"], *adict[\"captain\"], sep = \"\\n\")", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input().rstrip())\r\ndata = []\r\n\r\nfor _ in range(n):\r\n data.append(input().rstrip().split())\r\n\r\nfor name in data:\r\n if name[1]=='rat':\r\n print(name[0])\r\n\r\nfor name in data:\r\n if name[1] == 'woman' or name[1]=='child':\r\n print(name[0])\r\n\r\nfor name in data:\r\n if name[1] =='man':\r\n print(name[0])\r\n\r\nfor name in data:\r\n if name[1]=='captain':\r\n print(name[0])", "d = {\r\n \"rat\":0,\r\n \"woman\":1,\r\n \"child\":1,\r\n \"man\":2,\r\n \"captain\":3\r\n}\r\nm = {}\r\nfor _ in range(int(input())):\r\n name,priority = input().split()\r\n priority = d[priority]\r\n m[name] = priority\r\nm = sorted(m.items(),key=lambda x: x[1])\r\nprint(\"\\n\".join([name[0] for name in m]))", "n = int(input())\r\nrat = '1'\r\nwomanChild = '2'\r\nman = '3'\r\ncap = '4'\r\ncrew = {}\r\nfor i in range(n):\r\n s = input().split()\r\n if s[1] == 'rat':\r\n crew[rat] = s[0]\r\n rat += '1'\r\n elif s[1] == 'woman' or s[1] == 'child':\r\n crew[womanChild] = s[0]\r\n womanChild += '1'\r\n elif s[1] == 'man':\r\n crew[man] = s[0]\r\n man += '1'\r\n else:\r\n crew[cap] = s[0]\r\n\r\nfor key in sorted(crew.keys()):\r\n print(crew[key])\r\n", "tc = 1\r\nwhile tc:\r\n tc-=1\r\n n = int(input())\r\n c, m, r, wc = [], [], [], []\r\n for i in range(n):\r\n s = input().split()\r\n a = s[1].lower()\r\n # print(a)\r\n if a=='rat':\r\n r.append(s[0])\r\n elif a=='woman' or a=='child':\r\n wc.append(s[0])\r\n elif a=='man':\r\n m.append(s[0])\r\n else:\r\n c.append(s[0]) \r\n for i in r:\r\n print(i)\r\n for i in wc:\r\n print(i)\r\n for i in m:\r\n print(i)\r\n for i in c:\r\n print(i)", "def my_cmp(e):\n if (e[1] == 'rat'):\n return 0\n elif (e[1] == 'woman' or e[1] == 'child'):\n return 1\n elif (e[1] == 'man'):\n return 2\n return 3\n\nn = int(input())\na = [None] * n\nfor i in range(n):\n name, rank = input().split(' ')\n a[i] = (name, rank)\na = sorted(a, key=my_cmp)\nfor e in a:\n print(e[0])\n\n\t \t\t \t \t\t \t \t\t\t\t \t\t\t \t", "n = int(input())\r\nrat, womanchild, man, captain = [], [], [], []\r\nfor i in range(n):\r\n text = input().split()\r\n if text[1] == 'rat':\r\n rat.append(text[0])\r\n elif text[1] == 'woman' or text[1] == 'child':\r\n womanchild.append(text[0])\r\n elif text[1] == 'man':\r\n man.append(text[0])\r\n else:\r\n captain.append(text[0])\r\nfor i in rat:\r\n print(i)\r\nfor i in womanchild:\r\n print(i)\r\nfor i in man:\r\n print(i)\r\nfor i in captain:\r\n print(i)", "n=int(input());s=[];p,q=[],[]\r\nfor j in range(0,n):\r\n x=input().split()\r\n p.append(x[0])\r\n q.append(x[1])\r\nfor a in range(0,n):\r\n if q[a]=='rat':\r\n s.append(p[a])\r\nfor b in range(0,n):\r\n if q[b]=='woman' or q[b]=='child':\r\n s.append(p[b])\r\nfor c in range(0,n):\r\n if q[c]=='man':\r\n s.append(p[c])\r\nfor d in range(0,n):\r\n if q[d]=='captain':\r\n s.append(p[d])\r\nfor i in range(0,n):\r\n print(s[i])", "n = int(input())\r\nl = [[],[],[],[]]\r\nfor i in range(n):\r\n s,t = input().split()\r\n if t==\"rat\":\r\n l[0].append(s)\r\n elif (t==\"woman\" or t == \"child\"):\r\n l[1].append(s)\r\n elif t==\"man\":\r\n l[2].append(s)\r\n else:\r\n l[3].append(s)\r\nfor i in range(4):\r\n for j in l[i]:\r\n print(j,sep=\" \")", "tc=int(input())\nlst1=[]\nlst2=[]\nlst3=[]\nfor i in range(tc):\n\tx,y=input().split()\n\tif(y==\"rat\"):\n\t\tlst1.append(x)\n\telif(y==\"man\"):\n\t\tlst3.append(x)\n\telif(y==\"woman\" or y==\"child\"):\n\t\tlst2.append(x)\n\telif(y==\"captain\"):\n\t\tz=x\nfor i in range(len(lst1)):\n\tprint(lst1[i])\nfor j in range(len(lst2)):\n\tprint(lst2[j])\nfor k in range(len(lst3)):\n\tprint(lst3[k])\nprint(z)\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\ng = [input()[:-1].split() for _ in range(int(input()))]\r\n\r\nfor i in [['rat'],['woman','child'],['man'],['captain']]:\r\n for j in g:\r\n if j[1] in i:\r\n print(j[0])", "s=[]\r\nfor _ in range(int(input())):\r\n li=[x for x in input().split()]\r\n s.append(li)\r\nfor _ in s:\r\n if(_[1]==\"rat\"):\r\n print(_[0])\r\nfor _ in s:\r\n if(_[1]==\"woman\" or _[1]==\"child\"):\r\n print(_[0])\r\nfor _ in s:\r\n if(_[1]==\"man\"):\r\n print(_[0])\r\nfor _ in s:\r\n if(_[1]==\"captain\"):\r\n print(_[0])", "n=int(input())\r\nlr=[]\r\nlcw=[]\r\nlm=[]\r\nlc=[]\r\nfor i in range(n):\r\n\ts,s1=map(str,input().split())\r\n\tif s1==\"rat\":\r\n\t\tlr.append(s)\r\n\telif s1==\"man\":\r\n\t\tlm.append(s)\r\n\telif s1==\"woman\" or s1==\"child\":\r\n\t\tlcw.append(s)\r\n\telif s1==\"captain\":\r\n\t\tlc.append(s)\r\nfor i in lr+lcw+lm+lc:\r\n\tprint(i)", "lr=[];lwb=[];lm=[];lc=[]\r\nfor __ in range(int(input())):\r\n x,y=map(str,input().split())\r\n if y==\"rat\":lr.append(x)\r\n elif y==\"woman\" or y==\"child\":lwb.append(x)\r\n elif y==\"man\":lm.append(x)\r\n elif y==\"captain\":lc.append(x)\r\nlr.extend(lwb)\r\nlr.extend(lm)\r\nlr.extend(lc)\r\nfor j in lr:print(j)", "s=''\r\ndef func(l1):\r\n st=''\r\n l2=[]\r\n for i in range(len(l1)):\r\n if l1[i][1]=='rat':\r\n l2.append([0,i,l1[i][0]])\r\n elif l1[i][1]=='child' or l1[i][1]=='woman':\r\n l2.append([1,i,l1[i][0]])\r\n elif l1[i][1]=='man':\r\n l2.append([2,i,l1[i][0]])\r\n else:\r\n l2.append([3,i,l1[i][0]])\r\n l2.sort()\r\n for i in l2:\r\n st+=i[2]+'\\n'\r\n return st\r\n\r\n\r\nn=int(input())\r\nl1=[]\r\n#n,k=(map(int,input().split()))\r\nfor _ in range(n):\r\n l1.append(input().split())\r\nprint(func(l1))", "d = {}\nfor i in range(int(input())):\n n, k = input().split()\n \n if k == \"rat\":\n d[n] = 1000 + i\n elif k == \"woman\" or k == \"child\":\n d[n] = 2000 + i\n elif k == \"man\":\n d[n] = 3000 + i\n elif k == \"captain\":\n d[n] = 4000 + i\n\nfor i in sorted(d.items(), key=lambda x: x[1]):\n print(i[0])\n\t \t \t\t\t\t \t \t\t \t\t \t\t\t\t \t \t\t", "p = [[], [], [], []]\npri = (\n (\"rat\"),\n (\"woman\", \"child\"),\n (\"man\"),\n (\"captain\")\n)\n\nfor i in range(int(input())):\n name, title = input(\"\").split(\" \")\n for index, titles in enumerate(pri):\n if title in titles:\n p[index].append(name)\n continue\n \nprint(\"\\n\".join([y for x in p for y in x]))\n\t\t\t \t\t \t \t \t\t\t \t\t\t \t \t\t", "from collections import defaultdict\r\n\r\nd = defaultdict(list)\r\nm = int(input())\r\n\r\nfor _ in range(m):\r\n\tn, s = map(str, input().split())\r\n\tif s == \"rat\":\r\n\t\td[0].append(n)\r\n\telif s == \"woman\" or s == \"child\":\r\n\t\td[1].append(n)\r\n\telif s == \"man\":\r\n\t\td[2].append(n)\r\n\telse:\r\n\t\td[3].append(n)\r\n\r\nf = [*d[0], *d[1], *d[2], *d[3]]\r\nfor i in f:\r\n\tprint(i)", "w=[]\nm=[]\nr=[]\nc=0\na=int(input())\nfor i in range(a):\n\tn,t=input().split()\n\tif t==\"captain\":\n\t\tc=n\n\telif t==\"rat\":\n\t\tr.append(n)\n\telif t==\"woman\" or t==\"child\":\n\t\tw.append(n)\n\telif t==\"man\":\n\t\tm.append(n)\nfor i in r:\n\tprint(i)\nfor j in w:\n\tprint(j)\nfor k in m:\n\tprint(k)\nprint(c)\n\t\t\n\t\t\n\t \t \t\t \t\t\t \t\t\t \t \t", "a=int(input())\r\nd0=[]\r\nd1=[]\r\nd2=[]\r\nd3=[]\r\n\r\nfor i in range(a):\r\n s=input().split()\r\n if s[1]==\"rat\":\r\n d0.append(s[0])\r\n elif s[1]==\"captain\":\r\n d3.append(s[0])\r\n elif s[1]==\"woman\" or s[1]==\"child\":\r\n d1.append(s[0])\r\n else:\r\n d2.append(s[0])\r\n\r\nfor i in range(len(d0)):\r\n print(d0[i])\r\nfor i in range(len(d1)):\r\n print(d1[i])\r\nfor i in range(len(d2)):\r\n print(d2[i])\r\nfor i in range(len(d3)):\r\n print(d3[i])", "a=int(input())\r\nb=[]\r\nwhile a>0:\r\n b+=[input().split()]\r\n a-=1\r\nfor i in b:\r\n if i[1]=='woman':\r\n i[1]='child'\r\nfor i in['rat','child','man','captain']:\r\n for j in b:\r\n if j[1]==i:\r\n print(j[0])\r\n", "a={};rats=[];womch=[];mans=[];captains=[]\r\nfor _ in range(int(input())):\r\n b =input().split()\r\n a[b[0]] = b[-1]\r\nfor i in a:\r\n if a[i] == \"rat\": rats.append(i)\r\n elif a[i] == \"woman\" or a[i] == \"child\": womch.append(i)\r\n elif a[i] == \"man\": mans.append(i)\r\n elif a[i] == \"captain\": captains.append(i)\r\nprint(*rats+womch+mans+captains,sep=\"\\n\")", "t,m,n,p=[],[],[],[]\r\nfor i in range(int(input())):\r\n a=input().split()\r\n if't'==a[1][2]:\r\n t.append(a[0])\r\n elif a[1][2]in'mi':\r\n m.append(a[0])\r\n elif'n'==a[1][2]:\r\n n.append(a[0])\r\n else:\r\n p.append(a[0])\r\nfor i in'tmnp':\r\n exec('for a in '+i+':\\n\\tprint(a)')", "n=int(input())\nnamer=[]\nnamewc=[]\nnamem=[]\nnamec=[]\nfor _ in range(n):\n x,y=map(str,input().split())\n if y=='rat':\n namer.append(x)\n elif y=='woman' or y=='child':\n namewc.append(x)\n elif y=='man':\n namem.append(x)\n else:\n namec.append(x)\nfor i in namer:\n print(i)\nfor j in namewc:\n print(j)\nfor k in namem:\n print(k)\nfor l in namec:\n print(l)\n \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\npriority = {\"rat\": 0, \"woman\": 1, \"child\": 1, \"man\": 2, \"captain\": 3}\r\n\r\nn = int(input())\r\ndata = [input().rstrip().split() for _ in range(n)]\r\nsdata = sorted(data, key=lambda x: priority[x[1]])\r\n\r\nfor i, j in sdata:\r\n print(i)\r\n", "# Read the number of crew members\r\nn = int(input())\r\n\r\n# Create dictionaries to store the priority of each status\r\npriority = {'rat': 1, 'woman': 2, 'child': 2, 'man': 3, 'captain': 4}\r\n\r\n# Read and process each crew member's information\r\ncrew_members = []\r\nfor _ in range(n):\r\n name, status = input().split()\r\n crew_members.append((name, priority[status]))\r\n\r\n# Sort the crew members based on their priority and original order\r\nsorted_crew = sorted(crew_members, key=lambda x: (x[1], crew_members.index(x)))\r\n\r\n# Print the names in the evacuation order\r\nfor name, _ in sorted_crew:\r\n print(name)\r\n", "n = int(input())\r\n\r\nrats = []\r\nwomen_and_children = []\r\nmen = []\r\ncaptain = []\r\n\r\nfor _ in range(n):\r\n name, status = input().split()\r\n if status == \"rat\":\r\n rats.append(name)\r\n elif status == \"woman\" or status == \"child\":\r\n women_and_children.append(name)\r\n elif status == \"man\":\r\n men.append(name)\r\n else:\r\n captain.append(name)\r\n\r\nfor one in rats:\r\n print(one)\r\nfor one in women_and_children:\r\n print(one)\r\nfor one in men:\r\n print(one)\r\nfor one in captain:\r\n print(one)\r\n", "# /**\r\n# * author: brownfox2k6\r\n# * created: Mon 10 Apr 2023 at 11:23:37 UTC+7, Hanoi, Vietnam\r\n# **/\r\n\r\nrats = []\r\nwc = []\r\nmen = []\r\n\r\nfor _ in range(int(input())):\r\n name, t = input().split()\r\n if t == 'rat':\r\n rats.append(name)\r\n elif t in (\"woman\", \"child\"):\r\n wc.append(name)\r\n elif t == \"man\":\r\n men.append(name)\r\n else:\r\n captain = name\r\n\r\nprint(*rats, *wc, *men, captain, sep='\\n')", "d, cap = {}, None\r\nfor i in range(int(input())):\r\n\ta, b = input().split()\r\n\td[a] = b\r\n\tcap = a if b == 'captain' else cap\r\nfor i in d:\r\n\tif d[i] == 'rat':\r\n\t\tprint(i)\r\nfor i in d:\r\n\tif d[i] == 'woman' or d[i] == 'child':\r\n\t\tprint(i)\r\nfor i in d:\r\n\tif d[i] == 'man':\r\n\t\tprint(i)\r\nprint(cap)", "n = int(input())\r\n\r\ndef key_func(val):\r\n result = 3\r\n if val[1] == 'rat':\r\n result = 0\r\n elif val[1] == 'woman' or val[1] == 'child':\r\n result = 1\r\n elif val[1] == 'man':\r\n result = 2\r\n return result\r\n\r\npeople = []\r\nfor i in range(n):\r\n people.append(input().split())\r\n\r\nr = sorted(people, key=key_func)\r\n\r\nprint(\"\\n\".join([x[0] for x in r]))", "t=int(input())\r\ndict1={\r\n\t\"rat\":[],\r\n\t\"wochild\" : [],\r\n\t\"man\":[],\r\n\t\"captain\":[]\r\n}\r\nfor i in range(t):\r\n\ta=input().split()\r\n\tif a[1]==\"rat\":\r\n\t\tdict1[\"rat\"].append(a[0])\r\n\telif a[1] == \"child\" or a[1]==\"woman\":\r\n\t\tdict1[\"wochild\"].append(a[0])\r\n\telif a[1] == \"man\":\r\n\t\tdict1[\"man\"].append(a[0])\r\n\telse:\r\n\t\tdict1[\"captain\"].append(a[0])\r\nfor i in dict1:\r\n\tfor j in dict1[i]:\r\n\t\tprint(j)", "t=int(input())\nw=[]\nm=[]\nr=[]\nfor _ in range(t):\n n,s=input().split()\n if s=='captain':\n cap=n \n elif s=='child' or s=='woman':\n w.append(n)\n elif s=='man':\n m.append(n)\n else:\n r.append(n)\nfor i in r:\n print(i)\nfor i in w:\n print(i)\nfor i in m:\n print(i)\nprint(cap)\n \t \t \t \t\t\t \t\t\t\t \t\t \t \t", "n=int(input())\r\nm=[]\r\nfor i in range(n):\r\n l = input().split()\r\n m.append(l)\r\ncap = \"\";\r\nres = []\r\nfor it in m:\r\n if(it[1] == 'rat'):\r\n res.append(it[0])\r\n if(it[1] == \"captain\"):\r\n cap =it[0]\r\nfor it in m:\r\n if(it[1] == 'woman' or it[1] == 'child'):\r\n res.append(it[0])\r\nfor it in m:\r\n if(it[1] == 'man'):\r\n res.append(it[0])\r\nfor i in res:\r\n print(i)\r\nprint(cap)", "n = int(input())\r\nm = list()\r\nfor i in range(n):\r\n c = input().split()\r\n p = c.pop()\r\n if p == 'rat':\r\n c.append(1)\r\n elif p in ('woman', 'child'):\r\n c.append(2)\r\n elif p == 'man':\r\n c.append(3)\r\n else:\r\n c.append(4)\r\n m.append(c)\r\n\r\nfor q in sorted(m, key=lambda member: member[1]):\r\n print(q[0])", "n=int(input())\r\nl=[]\r\nn1=0#rat\r\nn2=0#女人和儿童\r\nn3=0#other\r\nfor i in range(n):\r\n b=[a for a in input().split()]\r\n if b[1]=='rat':\r\n l.insert(n1,b[0])\r\n n1+=1\r\n n2+=1\r\n n3+=1\r\n elif b[1]=='woman' or b[1]=='child':\r\n l.insert(n2,b[0])\r\n n2+=1\r\n n3+=1\r\n elif b[1]=='captain':\r\n l.append(b[0])\r\n else:\r\n l.insert(n3,b[0])\r\n n3+=1\r\nprint('\\n'.join(l))", "n = int(input())\r\nall = list()\r\nfor i in range(n):\r\n name, crew = [i for i in input().split()]\r\n all.append([name, crew])\r\nrats, womchild, men, capitan = list(), list(), list(), list()\r\nfor elem in all:\r\n if elem[1] == 'rat':\r\n rats.append(elem[0])\r\n if elem[1] == \"woman\" or elem[1] == \"child\":\r\n womchild.append(elem[0])\r\n if elem[1] == \"man\":\r\n men.append(elem[0])\r\n if elem[1] == \"captain\":\r\n capitan.append(elem[0])\r\n\r\nfor elem in rats:\r\n print(elem)\r\nfor elem in womchild:\r\n print(elem)\r\nfor elem in men:\r\n print(elem)\r\nfor elem in capitan:\r\n print(elem)\r\n", "def get_key(name, rank):\r\n if rank == 'woman' or rank == 'child':\r\n rank = 'wc'\r\n ranks = ['rat', 'wc', 'man', 'captain']\r\n return ranks.index(rank)\r\n\r\n\r\nn = int(input())\r\narr = [input().split(' ') for _ in range(n)]\r\nprint('\\n'.join([t[0] for t in sorted(arr, key=lambda x: get_key(*x))]))\r\n", "l=['man','captain']\r\nl2=[]\r\nx=int(input())\r\nfor i in range(x):\r\n l2.append(input().split())\r\n\r\nfor i,j in l2:\r\n if j=='rat':\r\n print(i)\r\n\r\nfor i,j in l2:\r\n if j=='woman' or j=='child' :\r\n print(i)\r\n\r\nfor i in l:\r\n for o,t in l2:\r\n\r\n if i==t:\r\n print(o)\r\n", "l=[]\nfor i in range(int(input())):\n l.append(input().split())\nans=[]\n# print(l)\nfor i in l:\n if i[1]=='rat':\n ans.append(i[0])\nfor i in l:\n if i[1]=='woman' or i[1]=='child':\n ans.append(i[0])\nfor i in l:\n if i[1]=='man':\n ans.append(i[0])\nfor i in l:\n if i[1]=='captain':\n ans.append(i[0])\nfor i in ans:\n print(i)\n \n \t \t\t \t\t\t \t\t \t \t\t\t\t \t\t\t \t\t \t\t", "n = int(input())\nlst = []\nfor i in range(n):\n lst.append(input())\n\nfor i in range(n):\n w = lst[i].split()\n if w[1] == \"rat\":\n print(w[0])\n\nfor i in range(n):\n w = lst[i].split()\n if w[1] == \"woman\" or w[1] == \"child\":\n print(w[0])\n\nfor i in range(n):\n w = lst[i].split()\n if w[1] == \"man\":\n print(w[0])\n\nfor i in range(n):\n w = lst[i].split()\n if w[1] == \"captain\":\n print(w[0])\n\n\n", "n=int(input())\r\nd={}\r\nfor _ in range(n):\r\n s=input().split()\r\n d.update({s[0]:s[1]})\r\nans=[]\r\nfor x in d:\r\n if d[x]=='rat':\r\n ans.append(x)\r\nfor x in d:\r\n if d[x]=='woman' or d[x]=='child':\r\n ans.append(x)\r\nfor x in d:\r\n if d[x]=='man':\r\n ans.append(x)\r\nfor x in d:\r\n if d[x]=='captain':\r\n ans.append(x)\r\nfor x in ans:\r\n print(x)\r\n\r\n\r\n\r\n ", "n=int(input())\r\na=[]\r\nfor i in range (n):\r\n l=input().split()\r\n a.append(l)\r\ns=[]\r\nfor j in range (n):\r\n if a[j][1]==\"rat\":\r\n s.append(a[j][0])\r\nfor j in range (n):\r\n if a[j][1] == (\"child\") or a[j][1] ==(\"woman\") :\r\n s.append(a[j][0])\r\nfor j in range (n):\r\n if a[j][1]==\"man\":\r\n s.append(a[j][0]) \r\nfor j in range (n):\r\n if a[j][1]==\"captain\":\r\n s.append(a[j][0]) \r\nfor name in s:\r\n print(name)", "people = int(input())\r\n \r\nwomansOrChilds = []\r\nmans = []\r\nrats = []\r\ncaptains = []\r\nfor _ in range(people):\r\n s = input()\r\n s = s.split()\r\n \r\n if s[1] == 'rat':\r\n rats.append(s[0])\r\n if s[1] == 'man':\r\n mans.append(s[0])\r\n if s[1] == 'woman':\r\n womansOrChilds.append(s[0])\r\n if s[1] == 'child':\r\n womansOrChilds.append(s[0])\r\n if s[1] == 'captain':\r\n captains.append(s[0])\r\n \r\n \r\nfor r in rats:\r\n print(r)\r\n \r\nfor w in womansOrChilds:\r\n print(w)\r\n \r\nfor m in mans:\r\n print(m)\r\n \r\nfor c in captains:\r\n print(c)\r\n\r\n\r\n\r\n\r\n'''\r\ncountPeople = int(input())\r\ndictStatusAndListNames = {}\r\nlistNames = []\r\nlistStasuses = ['rat', 'woman', 'child', 'man', 'captain']\r\nfor _ in range(countPeople):\r\n humanStr = input()\r\n humanList = humanStr.split()\r\n nameHuman = humanList[0]\r\n print(nameHuman)\r\n statusHuman = humanList[1]\r\n print(statusHuman)\r\n dictStatusAndListNames[statusHuman].append(nameHuman)\r\n\r\nfor status in listStasuses:\r\n if status == dictStatusAndListNames.get('rat', []):\r\n listNames.extend(dictStatusAndListNames['rat'])\r\n elif status == dictStatusAndListNames.get('woman', []):\r\n listNames.extend(dictStatusAndListNames['woman'])\r\n elif status == dictStatusAndListNames.get('child', []):\r\n listNames.extend(dictStatusAndListNames['child'])\r\n elif status == dictStatusAndListNames.get('man', []):\r\n listNames.extend(dictStatusAndListNames['man'])\r\n elif status == dictStatusAndListNames.get('captain', []):\r\n listNames.extend(dictStatusAndListNames['captain'])\r\n \r\nfor name in listNames:\r\n print(name)\r\n\r\n'''\r\n\r\n'''\r\ncountTests = int(input())\r\nfor _ in range(countTests):\r\n numbers = int(input())\r\n stepen2 = 1\r\n summa = -1\r\n while (stepen2 <= numbers):\r\n summa -= stepen2 * 2\r\n summa += 1\r\n print(summa)\r\n stepen2 *= 2\r\n #print(summa)\r\n''' \r\n\r\n \r\n \r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\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\nnames = []\r\npriorities = []\r\n\r\nfor _ in range(n):\r\n s = input().split()\r\n\r\n if s[1] == \"captain\":\r\n priorities.append(0)\r\n elif s[1] == \"man\":\r\n priorities.append(1)\r\n elif s[1] in [\"child\", \"woman\"]:\r\n priorities.append(2)\r\n elif s[1] == \"rat\":\r\n priorities.append(3)\r\n\r\n names.append(s[0])\r\n\r\nfor i in range(3, -1, -1):\r\n for j in range(n):\r\n if priorities[j] == i:\r\n print(names[j])\r\n", "l=[]\r\nfor _ in range(int(input())):\r\n\ta=list(map(str,input().split()))\r\n\tl.append(a)\r\nfor x in l:\r\n\tif x[1]==\"captain\":\r\n\t\tx[1]=4\r\n\telif x[1]==\"rat\":\r\n\t\tx[1]=1\r\n\telif x[1]==\"woman\" or x[1]==\"child\":\r\n\t\tx[1]=2\r\n\telse:\r\n\t\tx[1]=3\r\nl.sort(key = lambda l: l[1])\r\nfor x in l:\r\n\tprint(x[0])\r\n\r\n\r\n\r\n", "t=int(input())\nli=[]\nli2=[]\nli3=[]\nfor i in range(t):\n\ta,b=input().split()\n\tif(b==\"rat\"):\n\t\tli.append(a)\n\telif(b==\"man\"):\n\t\tli3.append(a)\n\telif(b==\"woman\" or b==\"child\"):\n\t\tli2.append(a)\n\telif(b==\"captain\"):\n\t\tc=a\nfor i in range(len(li)):\n\tprint(li[i])\nfor j in range(len(li2)):\n\tprint(li2[j])\nfor k in range(len(li3)):\n\tprint(li3[k])\nprint(c)\n\t \t \t \t\t \t \t\t\t \t\t\t \t \t", "nb = int(input())\n\norder = [\"rat\", \"woman\", \"child\", \"man\", \"captain\"]\norder2 = [\"rat\", \"woman and child\", \"man\", \"captain\"]\n\nequipage = {x: [] for x in order2}\n\nfor _ in range(nb):\n a, b = [x for x in input().split()]\n if b in {\"woman\", \"child\"}:\n equipage[\"woman and child\"].append(a)\n else:\n equipage[b].append(a)\n\n\nfor v in equipage.values():\n for h in v:\n print(h)\n", "def inp():\r\n return map(str, input().split())\r\n\r\n\r\nhash = dict({'captain': 4, 'man': 3, 'woman': 2, 'child': 2, 'rat': 1})\r\narr = []\r\nn = int(input())\r\n\r\nfor i in range(n):\r\n s1, s2 = inp()\r\n arr.append([s1, hash[s2]])\r\n\r\narr.sort(key=lambda x: x[1])\r\n\r\nfor i in range(n):\r\n print(arr[i][0])\r\n", "try:\r\n n=int(input())\r\n l=[]\r\n for i in range(n):\r\n s,s1=map(str,input().split())\r\n l.append([s,s1])\r\n \r\n \r\n for i in range(len(l)):\r\n if l[i][1]==\"rat\":\r\n print(l[i][0])\r\n \r\n for i in range(len(l)):\r\n if l[i][1]==\"woman\" or l[i][1]==\"child\":\r\n print(l[i][0])\r\n \r\n for i in range(len(l)):\r\n if l[i][1]==\"man\":\r\n print(l[i][0])\r\n \r\n for i in range(len(l)):\r\n if l[i][1]==\"captain\":\r\n print(l[i][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\n \r\n\r\n\r\nexcept EOFError:\r\n pass", "def main():\r\n n = int(input())\r\n rat = []\r\n woman = []\r\n man = []\r\n cap = []\r\n for i in range(n):\r\n a,b = input().split()\r\n if b == 'rat':\r\n rat.append( a )\r\n elif b == 'captain':\r\n cap.append( a )\r\n elif b == 'man':\r\n man.append( a )\r\n else:\r\n woman.append( a )\r\n print('\\n'.join(rat+woman+man+cap))\r\n\r\nmain()\r\n", "\r\nn=int(input())\r\na=[[],[],[],[]]\r\nfor i in range(n):\r\n s=input().split()\r\n if s[1]=='rat':\r\n a[0].append(s[0])\r\n elif s[1]=='captain':\r\n a[3].append(s[0])\r\n elif s[1]=='man':\r\n a[2].append(s[0])\r\n elif s[1]=='woman' or s[1]==\"child\":\r\n a[1].append(s[0])\r\nfor i in range(n):\r\n while a[0]!=[]:\r\n print(a[0].pop(0))\r\n while a[1]!=[]:\r\n print(a[1].pop(0))\r\n while a[2]!=[]:\r\n print(a[2].pop(0))\r\n while a[3]!=[]:\r\n print(a[3].pop(0))", "t = int(input())\r\nl1 = []\r\nl2 = []\r\nfor x in range(t):\r\n b = input().split()\r\n if b[1]==\"woman\":\r\n b[1]=\"child\"\r\n l1.append(b[0])\r\n l2.append(b[1])\r\n#print(l2)\r\nwhile \"rat\" in l2:\r\n print(l1[l2.index(\"rat\")])\r\n l1[l2.index(\"rat\")]=0\r\n l2[l2.index(\"rat\")]=0\r\nwhile \"child\" in l2:\r\n print(l1[l2.index(\"child\")])\r\n l1[l2.index(\"child\")]=0\r\n l2[l2.index(\"child\")]=0\r\nwhile \"man\" in l2:\r\n print(l1[l2.index(\"man\")])\r\n l1[l2.index(\"man\")]=0\r\n l2[l2.index(\"man\")]=0\r\nwhile \"captain\" in l2:\r\n print(l1[l2.index(\"captain\")])\r\n l1 = []\r\n l2 = []", "n=int(input())\nl=[]\nfor i in range(n):\n\tl.append(input().split())\np={'rat':0,'woman':1,'child':1,'man':2,'captain':3}\nfor i in range(1,n):\n\tk=i\n\taux=l[i]\n\twhile k>0 and p[aux[1]]<p[l[k-1][1]]:\n\t\tl[k]=l[k-1]\n\t\tk-=1\n\tl[k]=aux\nfor i in l:\n\tprint(i[0])\n", "n = int(input())\r\nwoman = []\r\nman = []\r\nrat = []\r\ncaptain = \"\"\r\n\r\nfor _ in range(n):\r\n name, type = input().split()\r\n\r\n if type == \"captain\":\r\n captain = name\r\n\r\n elif type == \"rat\":\r\n rat.append(name)\r\n\r\n elif type == \"woman\" or type == \"child\":\r\n woman.append(name)\r\n\r\n elif type == \"man\":\r\n man.append(name)\r\n\r\nfor name in rat:\r\n print(name)\r\n\r\nfor name in woman:\r\n print(name)\r\n\r\nfor name in man:\r\n print(name)\r\n\r\nprint(captain)\r\n", "n=int(input())\nc=[]\nr=[]\nw=[]\nch=[]\nm=[]\nfor i in range(n):\n\tp,s=input().split()\n\tif s==\"captain\":\n\t\tc.append(p)\n\telif s==\"woman\":\n\t\tw.append([i,p])\n\telif s==\"rat\":\n\t\tr.append(p)\n\telif s==\"child\":\n\t\tch.append([i,p])\n\telse:\n\t\tm.append(p)\nfor p in r:\n\tprint(p)\nwc=w+ch\nwc.sort()\n\nfor p in wc:\n\tprint(p[1])\nfor p in m:\n\tprint(p)\nfor p in c:\n\tprint(p)\n\n\t \t \t \t \t\t \t\t \t\t \t", "t=int(input())\nl=[]\nfor i in range(t):\n l.append(input().split()) \n\nfor i in range(t):\n if(l[i][1]=='rat'):\n print(l[i][0])\nfor i in range(t):\n if(l[i][1]=='child' or l[i][1]=='woman'):\n print(l[i][0])\nfor i in range(t):\n if(l[i][1]=='man'):\n print(l[i][0])\nfor i in range(t):\n if(l[i][1]=='captain'):\n print(l[i][0])\n\t \t \t\t\t \t\t\t \t \t\t \t \t\t \t \t", "n = int(input())\r\ndata = []\r\nfor _ in range(n):\r\n data.append(list(input().split()))\r\n\r\nprior = {'rat':0, 'woman':1, 'child':1, 'man':2, 'captain':3}\r\ndata.sort(key=lambda x:(prior[x[1]]))\r\n\r\nfor d in data:\r\n print(d[0])", "n=int(input())\nrat = []\nwoman_child = []\nman = []\nfor x in range(n):\n e = input()\n c = int(e.find(\" \"))\n w = e[c+1]\n if w == \"r\":\n rat.append(e[0:c])\n elif w == \"w\":\n woman_child.append(str(e[0:c]))\n elif w+e[c+2] == \"ch\":\n woman_child.append(str(e[0:c]))\n elif w == \"m\":\n man.append(e[0:c])\n else:\n cap = e[0:c]\ncapi = [cap]\ner = rat+woman_child\ner2 = man+capi\ner = er+er2\nfor x in range(n):\n print(er[x])\n", "l=[]\r\nfor i in range(int(input())):\r\n\ta,b=input().split()\r\n\tl.append([a,b])\r\nl2=[]\r\nfor i in l:\r\n\tif \"rat\" in i:\r\n\t\tl2.append(i[0])\r\nfor i in l:\r\n\tif \"woman\" in i or \"child\" in i:\r\n\t\tl2.append(i[0])\r\nfor i in l:\r\n\tif \"man\" in i:\r\n\t\tl2.append(i[0])\r\nfor i in l:\r\n\tif \"captain\" in i:\r\n\t\tl2.append(i[0])\r\nprint(*l2,sep=\"\\n\")", "n=int(input())\r\n\r\n\r\nd={'man':[], 'woman':[], \"captain\":[], \"rat\":[]}\r\n\r\nfor i in range(n):\r\n\ta,b=input().split()\r\n\tif(b==\"child\"):\r\n\t\tb=\"woman\"\r\n\r\n\td[b].append(a)\r\n\r\n\r\nl=[\"rat\", \"woman\",\"man\", \"captain\"]\r\n\r\nfor i in l:\r\n\tfor j in d[i]:\r\n\t\tprint(j)", "t=int(input())\r\ncw=[]\r\nm=[]\r\nr=[]\r\nc=[]\r\nfor i in range(t):\r\n x=input()\r\n k=x.split()\r\n le=k[1]\r\n if le==\"woman\" or le==\"child\":\r\n cw.append(k[0])\r\n elif le==\"man\":\r\n m.append(k[0])\r\n elif le==\"rat\":\r\n r.append(k[0])\r\n else:\r\n c.append(k[0])\r\nlos=r+cw+m+c\r\nfor i in los:\r\n print(i)\r\n", "r=[]\r\nw=[]\r\nm=[]\r\nc=[]\r\nfor i in range(int(input())):\r\n a,b=map(str,input().split())\r\n if b==\"rat\":\r\n r.append(a)\r\n if b==\"woman\" or b==\"child\":\r\n w.append(a)\r\n if b==\"captain\":\r\n c.append(a)\r\n if b==\"man\":\r\n m.append(a)\r\nl=r+w+m+c\r\nfor i in range(len(l)):\r\n print(l[i])", "n = int(input())\norder = [\"rat\",\"woman\", \"child\", \"man\", \"captain\"]\npeople = []\n\nfor i in range(n):\n\tperson = input().split(\" \")\n\tpeople.append(person)\n\nfor i in range(len(people)):\n\tif i >= len(people):\n\t\tbreak\n\tperson = people[i]\n\tif person[1] == order[0]:\n\t\tprint(person[0])\n\nfor i in range(len(people)):\n\tif i >= len(people):\n\t\tbreak\n\tperson = people[i]\n\tif person[1] == order[1] or person[1] == order[2]:\n\t\tprint(person[0])\n\nfor i in range(len(people)):\n\tif i >= len(people):\n\t\tbreak\n\tperson = people[i]\n\tif person[1] == order[3]:\n\t\tprint(person[0])\n\nfor i in range(len(people)):\n\tif i >= len(people):\n\t\tbreak\n\tperson = people[i]\n\tif person[1] == order[4]:\n\t\tprint(person[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\ns1,s2,s3,s4=[],[],[],[]\r\nfor i in range(n):\r\n u=input().split()\r\n if u[1]=='child' or u[1]=='woman':\r\n s2+=[u[0]]\r\n elif u[1]=='captain':\r\n s4+=[u[0]]\r\n elif u[1]=='rat':\r\n s1+=[u[0]]\r\n else:\r\n s3+=[u[0]]\r\nfor t in s1+s2+s3+s4:print(t,sep=' ')\r\n", "a={\"rat\":[], \"child\":[], \"man\":[], \"captain\":[]}\r\nfor i in range(int(input())):\r\n s=input().split()\r\n if s[1]==\"child\" or s[1]==\"woman\":\r\n a[\"child\"].append(s[0])\r\n else:\r\n a[s[1]].append(s[0])\r\nfor c in a[\"rat\"]+a[\"child\"]+a[\"man\"]+a[\"captain\"]:\r\n print(c)\r\n \r\n", "n=int(input())\r\nx={'rat':1,'child':2,'woman':2,'man':3,'captain':4}\r\narr=[]\r\nfor i in range(n):\r\n name,type=input().split()\r\n arr.append([name,x[type]])\r\narr.sort(key=lambda x: x[1])\r\nfor i in range(n):print(arr[i][0])", "# https://codeforces.com/contest/63/problem/A\r\n\r\n\r\ndef single_integer():\r\n return int(input())\r\n\r\n\r\ndef multi_integer():\r\n return map(int, input().split())\r\n\r\n\r\ndef string():\r\n return input()\r\n\r\n\r\ndef multi_string():\r\n return input().split()\r\n\r\n\r\nn = single_integer()\r\nrow = dict()\r\n\r\nstatus_dict = {\r\n \"rat\": 1,\r\n \"woman\": 2,\r\n \"child\": 2,\r\n \"man\": 3,\r\n \"captain\": 4\r\n}\r\n\r\nfor i in range(n):\r\n name, status = multi_string()\r\n s = status_dict[status]\r\n if s in row:\r\n row[s].append(name)\r\n else:\r\n row[s] = [name]\r\n\r\nfor i in sorted(row.keys()):\r\n for j in row[i]:\r\n print(j)\r\n", "def solve():\r\n n = int(input())\r\n crews = []\r\n crews_status = []\r\n for i in range(n):\r\n name, status = input().split() \r\n if status == 'rat':\r\n status = 1\r\n elif status == 'woman' or status == 'child':\r\n status = 2\r\n elif status == 'man':\r\n status = 3 \r\n elif status == 'captain':\r\n status = 4\r\n\r\n crews.append(name)\r\n crews_status.append(status)\r\n\r\n indx = [_ for _ in range(n)]\r\n for i in range(n):\r\n swaped = False\r\n for j in range(n-i-1):\r\n if crews_status[j] > crews_status[j+1]:\r\n crews_status[j], crews_status[j+1] = crews_status[j+1], crews_status[j]\r\n indx[j], indx[j+1] = indx[j+1], indx[j]\r\n swaped = True\r\n\r\n if swaped == False:\r\n break \r\n \r\n\r\n for i in indx:\r\n print(\"%s\"%(crews[i]))\r\n\r\nif __name__ == \"__main__\":\r\n solve()", "n = int(input())\r\n\r\nmembers = []\r\nfor i in range(n):\r\n members.append(input().split())\r\n\r\nfor i in range(n):\r\n if members[i][1] == 'rat':\r\n print(members[i][0])\r\n\r\nfor i in range(n):\r\n if members[i][1] == 'woman' or members[i][1] == 'child':\r\n print(members[i][0])\r\n\r\nfor i in range(n):\r\n if members[i][1] == 'man':\r\n print(members[i][0])\r\n\r\nfor i in range(n):\r\n if members[i][1] == 'captain':\r\n print(members[i][0])", "n = int(input())\nli = []\nfor i in range(n):\n a = tuple(map(str,input().split()))\n li.append(a)\nar = {\"rat\":1,\"woman\":2,\"child\":2,\"man\":3,\"captain\":5}\nli.sort(key = lambda x:ar[x[1]])\nfor i in li:\n print(i[0])\n\t \t\t \t \t \t\t \t \t \t \t \t", "n=int(input())\r\na=[]\r\nfor i in range(n):\r\n b=input().split()\r\n a.append(b)\r\nc=[]\r\nfor i in a:\r\n if i[1]==\"rat\":\r\n c.append(i[0])\r\nfor i in a:\r\n if i[1]==\"woman\" or i[1]==\"child\":\r\n c.append(i[0])\r\nfor i in a:\r\n if i[1]==\"man\":\r\n c.append(i[0])\r\nfor i in a:\r\n if i[1]==\"captain\":\r\n c.append(i[0])\r\nfor i in c:\r\n print(i)\r\n\r\n", "def main():\n n = int(input())\n people = {\"rat\" : [], \"woman\" : [], \"man\" : [], \"captain\" : []}\n for _ in range(n):\n name, status = input().split()\n if status == \"child\":\n status = \"woman\"\n people[status].append(name)\n for key in [\"rat\", \"woman\", \"man\", \"captain\"]:\n for v in people[key]:\n print(v)\nmain()\n\t\t \t\t\t \t\t\t\t \t \t\t \t \t\t\t", "#63A Sinking Ship\r\n\r\nnumberOfCrew = int(input())\r\nrat = []\r\nwoman_child = []\r\nman = []\r\ncaptain = []\r\n\r\nfor _ in range(numberOfCrew):\r\n\tname, status = input().split()\r\n\r\n\tif status == \"rat\":\r\n\t\trat.append(name)\r\n\telif status == \"woman\" or status == \"child\":\r\n\t\twoman_child.append(name)\r\n\telif status == \"man\":\r\n\t\tman.append(name)\r\n\telse:\r\n\t\tcaptain.append(name)\r\n\r\nfor i in rat:\r\n\tprint(i)\r\n\r\nfor j in woman_child:\r\n\tprint(j)\r\n\r\nfor k in man:\r\n\tprint(k)\r\n\r\nfor l in captain:\r\n\tprint(l)\r\n\r\n\r\n\r\n\r\n\t\r\n\r\n\r\n\r\n\r\n\t\r\n\r\n\r\n\r\n", "rats = []\r\nwomanandchildren = []\r\nmen = []\r\ncapitan = []\r\nn = int(input())\r\na = [input().split() for _ in range(n)]\r\nfor i in range(n):\r\n\tif a[i][1] == 'rat':\r\n\t\trats.append(a[i][0])\r\n\tif a[i][1] in ['woman', 'child']:\r\n\t\twomanandchildren.append(a[i][0])\r\n\tif a[i][1] == 'man':\r\n\t\tmen.append(a[i][0])\r\n\tif a[i][1] == 'captain':\r\n\t\tcapitan.append(a[i][0])\r\nfor name in rats:\r\n\tprint(name)\r\nfor name in womanandchildren:\r\n\tprint(name)\r\nfor name in men:\r\n\tprint(name)\r\nfor name in capitan:\r\n\tprint(name)\r\n", "r = []\r\nwc = []\r\nma = []\r\ncap = []\r\nl = int(input())\r\nfor i in range(l):\r\n a, m = input().split()\r\n if m == \"rat\":\r\n r.append(a)\r\n elif m == \"woman\":\r\n wc.append(a)\r\n elif m == \"man\":\r\n ma.append(a)\r\n elif m == \"captain\":\r\n cap.append(a)\r\n elif m == \"child\":\r\n wc.append(a)\r\nk = r+wc+ma+cap\r\nfor j in k:\r\n print(j)", "pri = {'captain':4,'man':3,'woman':2,'child':2,'rat':1}\r\nd = {i:[] for i in range(1,5)}\r\nfor _ in range(int(input())):\r\n x,y = input().split()\r\n d[pri.get(y)].append(x)\r\nfor i in range(1,5):\r\n for j in d[i]:\r\n print(j)\r\n \r\n", "n = int(input())\r\nsts = {\"rat\":1, \"woman\":2,\"child\":2, \"man\":3, \"captain\":4}\r\nps = []\r\nfor i in range(n):\r\n u,v = input().split()\r\n ps.append([u,v,i])\r\nps.sort(key=lambda x:(sts[x[1]],x[2]))\r\n\r\nfor u,v,ind in ps:\r\n print(u)\r\n\r\n", "T=int(input())\r\nrat=[]\r\nwoman_child=[]\r\nman=[]\r\ncaptain=[]\r\nfor _ in range(T):\r\n name,code=input().split()\r\n if(code==\"rat\"):\r\n rat.append(name)\r\n elif(code==\"man\"):\r\n man.append(name)\r\n elif(code==\"captain\"):\r\n captain.append(name)\r\n else:\r\n woman_child.append(name)\r\n\r\nans=rat+woman_child+man+captain\r\n\r\nfor i in ans:\r\n print(i)", "n = int(input())\nrats = []\nwc = []\nmen = []\ncaptain = []\nfor i in range(n):\n name, role = input().split()\n if role == 'rat':\n rats.append(name)\n elif role == 'child' or role == 'woman':\n wc.append(name)\n elif role == 'man':\n men.append(name)\n elif role == 'captain':\n captain.append(name)\n\nfor rat in rats:\n print(rat)\nfor person in wc:\n print(person)\nfor man in men:\n print(man)\nfor cap in captain:\n print(cap)\n\n\t\t\t\t \t \t\t \t \t\t\t\t \t\t\t\t\t \t\t", "def foo(e):\n return e[1]\n\n\n\n\nn=int(input())\nl=[]\nfor i in range(0,n):\n a=list(map(str,input().split()))\n if(a[1]=='rat'):\n a[1]='a'\n elif(a[1]=='woman' or a[1]=='child'):\n a[1]='b'\n elif(a[1]=='man'):\n a[1]='c'\n else:\n a[1]='d'\n l.append(a)\nl=sorted(l,key=foo)\nfor i in range(0,n):\n print(l[i][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\nnames, types = [], []\r\nfor x in range(n):\r\n string = input()\r\n member = string.split()\r\n names.append(member[0])\r\n types.append(member[1])\r\ndef membertype(check):\r\n for x in range(n):\r\n if types[x] in check:\r\n print(names[x])\r\nmembertype([\"rat\"])\r\nmembertype([\"woman\", \"child\"])\r\nmembertype([\"man\"])\r\nmembertype([\"captain\"])", "n = int(input())\ntypes = ['rat', ['child', 'woman'], 'man', 'captain']\nname_list = []\ntype_list = []\nfor _ in range(n):\n\tname, type_ = tuple(input().split())\n\tname_list.append(name)\n\ttype_list.append(type_)\nfor i in range(len(types)):\n\tfor j in range(len(type_list)):\n\t\tif(type(types[i]) is list):\n\t\t\tfor type_ in types[i]:\n\t\t\t\tif(type_list[j] == type_):\n\t\t\t\t\tprint(name_list[j])\n\t\telse:\n\t\t\tif(type_list[j] == types[i]):\n\t\t\t\tprint(name_list[j])\n\n\n\n", "from sys import stdin; inp = stdin.readline\r\nfrom math import dist, ceil, floor, sqrt, log\r\nfrom collections import defaultdict, Counter, deque\r\ndef IA(sep=' '): return list(map(int, inp().split(sep)))\r\ndef FA(): return list(map(float, inp().split()))\r\ndef SA(): return inp().split()\r\ndef I(): return int(inp())\r\ndef F(): return float(inp())\r\ndef S(): return input()\r\ndef O(l:list): return ' '.join(map(str, l))\r\n\r\ndef unboard(p:deque):\r\n while p:\r\n mem = p.popleft()\r\n print(mem)\r\n return \r\n\r\ndef main():\r\n n = I()\r\n p1, p2, p3 = [deque(), deque(), deque()]\r\n for i in range(n):\r\n mem, typ = S().split()\r\n if typ == 'rat': p1.append(mem)\r\n elif typ in ['woman', 'child']: p2.append(mem)\r\n elif typ == 'man': p3.append(mem)\r\n else: cap = mem \r\n for q in [p1,p2,p3]:\r\n unboard(q)\r\n print(cap)\r\n\r\nif __name__ == '__main__':\r\n main()", "q = int(input())\r\nw = []\r\ne = []\r\nr = []\r\nt = []\r\nfor i in range(q):\r\n c, v = input().split()\r\n if v == \"rat\":\r\n w.append(c)\r\n elif v == \"woman\" or v == \"child\":\r\n e.append(c)\r\n elif v == \"man\":\r\n r.append(c)\r\n else:\r\n t.append(c)\r\nfor i in w:\r\n print(i)\r\nfor i in e:\r\n print(i)\r\nfor i in r:\r\n print(i)\r\nfor i in t:\r\n print(i)", "n=int(input())\r\ncap=[]\r\nwom=[]\r\nchil=[]\r\nrat=[]\r\nma=[]\r\ndef thro():\r\n global rat\r\n if (len(rat)>=1):\r\n for i in rat:\r\n print(i)\r\n rat=[]\r\n global wom\r\n if (len(wom)>=1):\r\n for i in wom:\r\n print(i)\r\n wom=[]\r\n global ma\r\n if (len(ma)>=1):\r\n for i in ma:\r\n print(i)\r\n ma=[]\r\n global cap\r\n if(len(cap)>=1):\r\n print(cap[0])\r\n cap=[]\r\n\r\nfor j in range(0,n):\r\n x,y=input().split()\r\n if y==\"rat\":\r\n rat.append(x)\r\n elif y==\"woman\" or y==\"child\":\r\n wom.append(x)\r\n elif y==\"man\":\r\n ma.append(x)\r\n elif y==\"captain\":\r\n cap.append(x)\r\n else:\r\n thro()\r\n print(x)\r\nthro()\r\n", "class Member:\n orders = {\n 'rat': 1,\n 'woman': 2,\n 'child': 2,\n 'man': 3,\n 'captain': 4\n }\n\n def __init__(self, name, type):\n self.name = name\n self.type = type\n self.order = self.__class__.orders[type]\n\n def __lt__(self, other):\n return self.order < other.order\n\n def __eq__(self, other):\n return self.order == other.order\n\n def __gt__(self, other):\n return self.order > other.order\n\namount = int(input())\nmembers = [Member(*input().split()) for x in range(amount)]\n\nsorted_members = sorted(members)\nfor member in sorted_members:\n print(member.name)", "l1 = ['rat', 'woman', 'man', 'captain']\r\nl2 = ['rat', 'child', 'man', 'captain']\r\np = []\r\n\r\nn = int(input())\r\n\r\nfor i in range(n):\r\n name, title = input().split()\r\n p.append((name, title))\r\n\r\ni = 0\r\n\r\nwhile i < 4:\r\n for j in range(n):\r\n if p[j][1] in [l1[i], l2[i]]:\r\n print(p[j][0])\r\n\r\n i += 1\r\n\r\n \r\n", "t=int(input())\r\nrat=[]\r\nwochi=[]\r\nman=[]\r\ncaptain=[]\r\nmain=[]\r\nfor i in range(t):\r\n n , r=map(str,input().split())\r\n if r==\"rat\":\r\n rat.append(n)\r\n elif r==\"woman\" or r==\"child\":\r\n wochi.append(n)\r\n elif r==\"man\":\r\n man.append(n)\r\n else:\r\n captain.append(n)\r\n\r\nfor i in range(len(rat)):\r\n main.append(rat[i])\r\n\r\nfor i in range(len(wochi)):\r\n main.append(wochi[i])\r\n\r\nfor i in range(len(man)):\r\n main.append(man[i])\r\n\r\nfor i in range(len(captain)):\r\n main.append(captain[i])\r\n\r\nfor i in range(len(main)):\r\n print(main[i])\r\n\r\n", "import sys\r\n\r\ndef main():\r\n crew = {\r\n 'rat' : [],\r\n 'woman_child' : [],\r\n 'man' : [],\r\n 'captain' : []\r\n }\r\n x = input.readline()\r\n n = int(x)\r\n for i in range(n):\r\n member = input.readline()\r\n name = member.split(' ')[0]\r\n status = member[:-1].split(' ')[1]\r\n\r\n if status in crew:\r\n crew[status].append(name)\r\n else:\r\n crew['woman_child'].append(name)\r\n\r\n for rat in crew['rat']:\r\n output.write(rat + '\\n')\r\n for woman_child in crew['woman_child']:\r\n output.write(woman_child + '\\n')\r\n for man in crew['man']:\r\n output.write(man + '\\n')\r\n output.write(crew['captain'][0])\r\n\r\ndef run():\r\n\r\n global input, output\r\n input = sys.stdin\r\n output = sys.stdout\r\n\r\n main()\r\n\r\n\r\nif __name__ == '__main__':\r\n run()\r\n", "n = int(input())\nl = [[], [], [], []]\n\nfor i in range(n):\n inp = input().split()\n if inp[1] == 'rat':\n l[0].append(inp[0])\n elif inp[1] == 'woman' or inp[1] == 'child':\n l[1].append(inp[0])\n elif inp[1] == 'man':\n l[2].append(inp[0])\n elif inp[1] == 'captain':\n l[3].append(inp[0])\n\nfor i in l[0]:\n print(i)\n\nfor i in l[1]:\n print(i)\n\nfor i in l[2]:\n print(i)\n\nfor i in l[3]:\n print(i)\n", "t=int(input())\nli1=[]\nli2=[]\nli3=[]\nfor i in range(t):\n\ta,b=input().split()\n\tif(b==\"rat\"):\n\t\tli1.append(a)\n\telif(b==\"man\"):\n\t\tli3.append(a)\n\telif(b==\"woman\" or b==\"child\"):\n\t\tli2.append(a)\n\telif(b==\"captain\"):\n\t\tc=a\nfor i in range(len(li1)):\n\tprint(li1[i])\nfor j in range(len(li2)):\n\tprint(li2[j])\nfor k in range(len(li3)):\n\tprint(li3[k])\nprint(c)\npass\n\t\t \t \t \t \t \t \t\t \t \t", "n=int(input())\r\np=[]\r\nq=[]\r\nr=[]\r\ns=[]\r\nfor i in range(n):\r\n a,b=map(str,input().split())\r\n if b==\"rat\":\r\n p.append(a)\r\n elif b==\"woman\" or b==\"child\":\r\n q.append(a)\r\n elif b==\"man\":\r\n r.append(a)\r\n else:\r\n s.append(a)\r\nfor i in range(len(p)):\r\n print(p[i])\r\nfor i in range(len(q)):\r\n print(q[i])\r\nfor i in range(len(r)):\r\n print(r[i])\r\nfor i in range(len(s)):\r\n print(s[i])\r\n\r\n \r\n \r\n\r\n\r\n ", "no_of_people = int(input())\n\nname_crew = [input().split(\" \") for i in range(no_of_people)]\nrats, women_child, men, captain = [], [], [], []\n\nfor i in name_crew:\n if i[1] == 'rat' :\n rats.append(i[0])\n if i[1] == 'woman' or i[1] == 'child' :\n women_child.append(i[0])\n if i[1] == 'man' :\n men.append(i[0])\n if i[1] == 'captain' :\n captain.append(i[0])\n\nfor i in rats :\n print(i)\nfor i in women_child :\n print(i)\nfor i in men :\n print(i)\nfor i in captain :\n print(i)\n", "n=int(input())\r\nr=[]\r\nw=[]\r\nm=[]\r\ncap=[]\r\nfor i in range(n):\r\n a,b=list(map(str,input().split()))\r\n if(b=='captain'):\r\n cap.append(a)\r\n elif(b=='woman'):\r\n w.append(a)\r\n elif(b=='child'):\r\n w.append(a)\r\n elif(b=='man'):\r\n m.append(a)\r\n elif(b=='rat'):\r\n r.append(a)\r\na=r+w+m+cap\r\nfor i in range(len(a)):\r\n print(a[i])\r\n", "def main():\n n = int(input())\n l = []\n for i in range(n):\n name, st = input().split()\n l.append((name, {'rat': 0, 'woman': 1, 'child': 1, 'man': 2, 'captain': 3}[st]))\n l.sort(key=lambda _: _[1])\n print('\\n'.join(_[0] for _ in l))\n\n\nif __name__ == '__main__':\n main()", "def solve(arr, n):\n d = {\n 'rat':0,\n 'woman':1,\n 'child':1,\n 'man':2,\n 'captain':3\n }\n for i in range(1, n):\n j = i-1\n key = arr[i][:]\n while j >=0 and d[arr[j][1]] > d[key[1]]:\n arr[j+1] = arr[j]\n j -= 1\n arr[j+1] = key\n for i in arr:\n print(i[0])\n\n \n\n \n\n\n\n\n \n\n \ndef main() :\n # s = input()\n n = int(input())\n # arr = list(map(int, input().split(' ')))\n # s = input()\n # res=''\n arr = []\n for _ in range(n):\n i = input().split(' ')\n arr.append(i)\n solve(arr, n)\nmain()\n", "n = int(input())\r\nrats = []\r\nwomen_and_children = []\r\nmen = []\r\nfor i in range(n):\r\n name, rank = input().split()\r\n if rank == \"rat\":\r\n rats.append(name)\r\n elif rank == \"man\":\r\n men.append(name)\r\n elif rank == \"woman\" or rank == \"child\":\r\n women_and_children.append(name)\r\n else:\r\n name_cap = name\r\nprint(\"\\n\".join(rats + women_and_children + men + [name_cap]))\r\n", "n=int(input())\nli=[]\nfor i in range(n):\n\tx=input().split()\n\tc=[]\n\tfor j in range(2):\n\t\tc.append(x[j])\n\tli.append(c)\nfor i in range(n):\n\tif(li[i][1]=='rat'):\n\t\tprint(li[i][0])\nfor i in range(n):\n\tif(li[i][1]=='woman' or li[i][1]=='child'):\n\t\tprint(li[i][0])\nfor i in range(n):\n\tif(li[i][1]=='man'):\n\t\tprint(li[i][0])\nfor i in range(n):\n\tif(li[i][1]=='captain'):\n\t\tprint(li[i][0])\n\t \t\t \t \t \t \t\t\t \t\t\t\t\t \t\t \t", "import sys\r\nfrom array import array # noqa: F401\r\n\r\n\r\ndef input():\r\n return sys.stdin.buffer.readline().decode('utf-8')\r\n\r\n\r\nn = int(input())\r\na = []\r\nd = {'rat': 0, 'woman': 1, 'child': 1, 'man': 2, 'captain': 3}\r\n\r\nfor i in range(n):\r\n x, y = input().split()\r\n a.append((d[y], i, x))\r\n\r\na.sort()\r\nprint(*(x[2] for x in a), sep='\\n')\r\n", "n=int(input())\r\nrt=[]\r\nwm=[]\r\nmn=[]\r\ncp=[]\r\nfor i in range(n):\r\n n1=input().split()\r\n if(n1[1]=='rat'):\r\n rt.append(n1[0])\r\n elif(n1[1]=='child' or n1[1]=='woman'):\r\n wm.append(n1[0])\r\n elif(n1[1]=='man'):\r\n mn.append(n1[0])\r\n else:\r\n cp.append(n1[0])\r\nfor j in rt:\r\n print(j)\r\nfor k in wm:\r\n print(k)\r\nfor l in mn:\r\n print(l)\r\nfor z in cp:\r\n print(z)\r\n ", "n=int(input())\r\ne=[]\r\nfor i in range(n):\r\n\ta=input().split(' ')\r\n\te.append(a)\r\no=[]\r\nst1=[]\r\nst2=[]\r\nst3=[]\r\nst4=[]\r\nfor i in range(0,len(e)):\r\n\tif e[i][1]=='rat':\r\n\t\tst1.append(e[i][0])\r\n\telif e[i][1]=='woman' or e[i][1]=='child':\r\n\t\tst2.append(e[i][0])\r\n\telif e[i][1]=='man':\r\n\t\tst3.append(e[i][0])\r\n\telif e[i][1]=='captain':\r\n\t\tst4.append(e[i][0])\r\n\r\no.append(st1)\r\no.append(st2)\r\no.append(st3)\r\no.append(st4)\r\nfor i in range(len(o)):\r\n\tfor j in range(len(o[i])):\r\n\t\tprint(o[i][j])", "n = int(input())\r\nl = list()\r\n\r\nfor i in range(n):\r\n s = list(input().split())\r\n l.append(s)\r\nfor i in l:\r\n if i[1] == \"rat\":\r\n print(i[0])\r\nfor i in l:\r\n if i[1] == \"woman\":\r\n print(i[0])\r\n elif i[1] == \"child\":\r\n print(i[0])\r\nfor i in l:\r\n if i[1] == \"man\":\r\n print(i[0])\r\nfor i in l:\r\n if i[1] == \"captain\":\r\n print(i[0])", "status_to_rate={'rat':0,'woman':1,'child':1,'man':2,'captain':3}\r\n\r\nv=[]\r\nn=int(input())\r\nfor c in range(n):\r\n\tname,status=input().split()\r\n\tv.append((name,status_to_rate[status],c))\r\n\r\nv.sort(key=lambda x:(x[1],x[2]))\r\nfor c in v:\r\n\tprint(c[0])", "# import sys\r\n# sys.stdin = open(\"test.in\",\"r\")\r\n# sys.stdout = open(\"test.out.py\",\"w\")\r\na,b,c,d=[],[],[],[]\r\nfor i in range(int(input())):\r\n\te,f=map(str,input().split())\r\n\tg=f[0]\r\n\tif g=='r':\r\n\t\ta.append(e)\r\n\telif g=='w' or (g=='c' and f[1]=='h'):\r\n\t\tb.append(e)\r\n\telif g=='m':\r\n\t\tc.append(e)\r\n\telse:\r\n\t\td.append(e)\r\nfor i in a:\r\n\tprint(i)\r\nfor i in b:\r\n\tprint(i)\r\nfor i in c:\r\n\tprint(i)\t\t\r\nfor i in d:\r\n\tprint(i)", "N = int(input())\r\n\r\npeople = []\r\n\r\nfor i in range(N):\r\n person = input().split()\r\n people.append(person)\r\n \r\nfor person in people:\r\n if person[1] == \"rat\":\r\n print(person[0]) \r\n \r\nfor person in people:\r\n if person[1] == \"child\" or person[1] == \"woman\":\r\n print(person[0]) \r\n \r\nfor person in people:\r\n if person[1] == \"man\":\r\n print(person[0]) \r\n \r\nfor person in people:\r\n if person[1] == \"captain\":\r\n print(person[0]) \r\n \r\n ", "p = []\no = []\ntotal = int(input())\n\nfor i in range(total):\n\te = input()\n\to.append(e)\n\nfor li in o:\n\tif((\" rat\" in li) == True):\n\t\tp.append(li)\n\nfor u in o:\n\tif((\" woman\" in u ) == True):\n\t\tp.append(u)\n\n\telif((\" child\" in u) == True):\n\t\tp.append(u)\n\nfor y in o:\n\tif((\" man\" in y) == True):\n\t\tp.append(y)\nfor l in o:\n\tif((\" captain\" in l) == True):\n\t\tp.append(l)\n\nfor j in p:\n\tpo = j.split()\n\tprint(po[0])\n", "from collections import defaultdict\ns=defaultdict(lambda:[])\nfor i in range(int(input())):\n c,d=map(str,input().split())\n if d==\"child\" or d==\"woman\":\n s[\"woman\"].append((i,c))\n else:\n s[d].append(c)\n \nfor item in s['rat']:\n print(item)\ny=sorted(s['woman'])\nfor item in y:\n print(item[1])\nfor item in s['man']:\n print(item)\nfor item in s['captain']:\n print(item)\n\t \t \t\t \t\t \t\t \t \t\t", "n = int(input())\r\ntype_name = []\r\nfor i in range(n):\r\n name_type = input()\r\n name = name_type.split(\" \")[0]\r\n type = name_type.split(\" \")[1]\r\n type_name.append((type, name))\r\n\r\nfor i in type_name: #Rats first\r\n if i[0]==\"rat\":\r\n print(i[1])\r\n \r\nfor i in type_name:\r\n if i[0]==\"woman\" or i[0]==\"child\": #Women and children\r\n print(i[1])\r\n \r\nfor i in type_name: #Man\r\n if i[0]==\"man\":\r\n print(i[1])\r\n \r\nfor i in type_name: #captain is left at the end\r\n if i[0] == \"captain\":\r\n print(i[1])\r\n\r\n", "n = int(input())\npriority = {\n \"rat\": 0,\n \"woman\": 1,\n \"child\": 1,\n \"man\": 2,\n \"captain\": 3,\n}\ncrew = [input().split() for _ in range(n)]\n\ndef rank(i):\n return (priority[crew[i][1]], i)\n\norder = sorted(range(n), key=rank)\nres = (crew[i][0] for i in order)\nprint(*res, sep=\"\\n\")\n", "n=int(input())\r\na=[\" \"]*n\r\nb=[\" \"]*n\r\nc=list()\r\nfor i in range(n):\r\n a[i],b[i]=map(str,input().split())\r\nfor i in range(len(b)):\r\n if(b[i]=='rat'):\r\n c.append(a[i])\r\nfor i in range(len(b)):\r\n if(b[i]=='woman' or b[i]=='child'):\r\n c.append(a[i])\r\nfor i in range(len(b)):\r\n if(b[i]=='man'):\r\n c.append(a[i])\r\nfor i in c:\r\n print(i)\r\nprint(a[b.index('captain')])", "n=int(input())\nl=[]\nfor _ in range(n):\n a=tuple(map(str,input().split()))\n l.append(a)\nd={\"rat\":1,\"woman\":2,\"child\":2,\"man\":3,\"captain\":5}\nl.sort(key=lambda x:d[x[1]])\nfor i in l:\n print(i[0])\n \t\t\t \t \t \t\t \t \t \t \t\t\t \t", "n=int(input())\nr=[]\nw=[]\nm=[]\nc=[]\nfor _ in range(n):\n a,b=input().split()\n if b==\"rat\":\n r.append(a)\n elif b==\"woman\" or b==\"child\":\n w.append(a)\n elif b==\"man\":\n m.append(a)\n elif b==\"captain\":\n c.append(a)\nif r!=[]:\n for i in r:\n print(i)\nif w!=[]:\n for i in w:\n print(i)\nif m!=[]:\n for i in m:\n print(i)\n\nif c!=[]:\n for i in c:\n print(i)\n\n\t\t\t\t\t \t\t \t \t\t\t \t \t\t \t \t", "n = int(input())\r\nstages = [[],[],[],[]]\r\nfor _ in range(n):\r\n x = input().split()\r\n if x[1] == 'rat':\r\n stages[0].append(x[0])\r\n elif x[1] in ['woman','child']:\r\n stages[1].append(x[0])\r\n elif x[1] == 'man':\r\n stages[2].append(x[0])\r\n else:\r\n stages[3].append(x[0])\r\nfor i in range(4):\r\n for item in stages[i]:\r\n print(item)", "z=[]\nfor i in range(int(input())):\n\tx=list(input().split(\" \"))\n\tz.append(x)\n\tfor j in z:\n\t\tif j[1]==\"woman\" or j[1]==\"child\":\n\t\t\tj[1]=\"woman\"\nd=['rat', 'woman','man', 'captain'] \nz.sort(key = lambda i: d.index(i[1]))\nfor i in z:\n\tprint(i[0])\n\t \t\t\t \t\t\t \t\t \t\t \t\t\t \t \t\t\t", "n1=[]\nn2=[]\nn3=[]\nfor i in range(int(input())):\n\ta,b=input().split()\n\tif(b==\"rat\"):\n\t\tn1.append(a)\n\telif(b==\"man\"):\n\t\tn3.append(a)\n\telif(b==\"woman\" or b==\"child\"):\n\t\tn2.append(a)\n\telif(b==\"captain\"):\n\t\tc=a\nfor i in range(len(n1)):\n\tprint(n1[i])\nfor j in range(len(n2)):\n\tprint(n2[j])\nfor k in range(len(n3)):\n\tprint(n3[k])\nprint(c)\n \t\t \t\t \t \t\t \t\t\t\t\t\t\t \t \t", "n = int(input()) \r\nl = []\r\ncaptain = None \r\nfor i in range(n):\r\n x = input()\r\n if x.split()[1] == \"captain\" :\r\n captain = x.split()[0]\r\n else : \r\n l.append(x) \r\nres = [] \r\ncount = 0\r\nrat_count =0 \r\nfor i in l : \r\n if i.split()[1] == \"rat\" :\r\n res.insert(rat_count , i.split()[0])\r\n rat_count += 1\r\n count += 1 \r\n elif i.split()[1] == \"man\" : \r\n res.insert(n-1, i.split()[0]) \r\n else : \r\n res.insert(count ,i.split()[0]) \r\n count += 1 \r\nfor i in res : \r\n print(i)\r\nprint(captain)", "crew_members=int(input())\r\nlist1=[]\r\nlist2=[]\r\nlist3=[]\r\nlist4=[]\r\nfor i in range(crew_members):\r\n s=input()\r\n k=s.index(\" \")\r\n s1=s[k+1:]\r\n if(s1==\"rat\"):\r\n list1.append(s[:k])\r\n elif(s1==\"woman\" or s1==\"child\"):\r\n list2.append(s[:k])\r\n elif(s1==\"man\"):\r\n list3.append(s[:k])\r\n else:\r\n list4.append(s[:k]) \r\nlist_final=list1+list2+list3+list4 \r\nfor x in list_final:\r\n print(x) ", "n = int(input())\r\na,b,c,d = [],[],[],[]\r\n\r\nfor i in range(n):\r\n x = input().split()\r\n \r\n if x[1]==\"rat\":\r\n a.append(x[0])\r\n elif x[1]==\"child\" or x[1]==\"woman\":\r\n b.append(x[0])\r\n elif x[1]==\"man\":\r\n c.append(x[0])\r\n elif x[1]==\"captain\":\r\n d.append(x[0])\r\n \r\n[print(i) for i in a]\r\n[print(i) for i in b]\r\n[print(i) for i in c]\r\n[print(i) for i in d]\r\n ", "n = int(input())\r\nna = []\r\nra = []\r\nfor i in range(n):\r\n name, rang = map(str, input().split())\r\n na.append(name)\r\n ra.append(rang)\r\nfor i in range(n):\r\n if ra[i] == 'rat':\r\n print(na[i])\r\nfor i in range(n):\r\n if ra[i] == 'child' or ra[i] == 'woman':\r\n print(na[i])\r\nfor i in range(n):\r\n if ra[i] == 'man':\r\n print(na[i])\r\nfor i in range(n):\r\n if ra[i] == 'captain':\r\n print (na[i])", "n=int(input())\ns=[]\nfor i in range(n):\n s.append(input().split()) \n\nfor i in range(n):\n if(s[i][1]=='rat'):\n print(s[i][0])\nfor i in range(n):\n if(s[i][1]=='child' or s[i][1]=='woman'):\n print(s[i][0])\nfor i in range(n):\n if(s[i][1]=='man'):\n print(s[i][0])\nfor i in range(n):\n if(s[i][1]=='captain'):\n print(s[i][0])\n \t \t\t\t\t \t \t \t\t \t\t \t\t \t\t \t", "n = int(input())\r\nchln = []\r\nchln2 = []\r\nfor i in range(n):\r\n name, zv = map(str, input().split())\r\n chln.extend([name, zv])\r\nfor i in range(0, len(chln), 2):\r\n if chln[i+1] == \"rat\":\r\n chln2.append(chln[i])\r\nfor i in range(0, len(chln), 2):\r\n if chln[i+1] == \"woman\" or chln[i+1] == \"child\":\r\n chln2.append(chln[i])\r\nfor i in range(0, len(chln), 2):\r\n if chln[i+1] == \"man\":\r\n chln2.append(chln[i])\r\nfor i in range(0, len(chln), 2):\r\n if chln[i+1] == \"captain\":\r\n chln2.append(chln[i])\r\nfor i in range(len(chln2)):\r\n print(chln2[i])", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Fri Apr 24 23:43:42 2020\r\n\r\n@author: DELL\r\n\"\"\"\r\nn=int(input())\r\nr=[]\r\nw=[]\r\nc=[]\r\nm=[]\r\nfor i in range(n):\r\n u,y=list(input().split())\r\n if y=='rat':\r\n r+=[u]\r\n elif y=='woman' or y=='child':\r\n w+=[u]\r\n elif y=='man':\r\n m+=[u]\r\n elif y=='captain':\r\n c+=[u]\r\nx=[]\r\nfor i in r:\r\n x+=[i]\r\nfor i in w:\r\n x+=[i]\r\nfor i in m:\r\n x+=[i]\r\nfor i in c:\r\n x+=[i]\r\nfor i in x:\r\n print(i)", "people = int(input())\n\nrats = []\nwoman_child = []\nmen = []\nfor person in range(people):\n\tdesc = input().split()\n\tif desc[1] =='woman' or desc[1] =='child':\n\t\twoman_child.append(desc[0])\n\telif desc[1] =='rat':\n\t\trats.append(desc[0])\n\telif desc[1] =='man':\n\t\tmen.append(desc[0])\n\telse:\n\t\tcaptain = desc[0]\n\t\t\nfor name in rats:\n\tprint(name)\nfor name in woman_child:\n\tprint(name)\nfor name in men:\n\tprint(name)\nprint(captain)", "n = int(input())\r\nl = []\r\nfor i in range(n):\r\n\tl.append(input().split())\r\na = []\r\nfor i in range(n):\r\n\tif l[i][1] == 'rat':\r\n\t\ta.append(l[i][0])\r\nfor i in range(n):\r\n\tif l[i][1] == 'woman' or l[i][1] == 'child':\r\n\t\ta.append(l[i][0])\r\nfor i in range(n):\r\n\tif l[i][1] == 'man':\r\n\t\ta.append(l[i][0])\r\nfor i in range(n):\r\n\tif l[i][1] == 'captain':\r\n\t\ta.append(l[i][0])\r\nfor i in a:\r\n\tprint(i)\r\n", "\r\nchild = []\r\nrat = []\r\ncap = ''\r\nman = []\r\nt = int(input())\r\n \r\nfor _ in range(t):\r\n \r\n s = input()\r\n p = s.split(\" \")\r\n test = p[1]\r\n if p[1] == \"woman\" or p[1] == \"child\":\r\n child.append(p[0])\r\n elif p[1] == \"rat\":\r\n rat.append(p[0])\r\n elif p[1] == \"man\":\r\n man.append(p[0])\r\n else:\r\n cap = p[0]\r\n \r\nfor x in rat:\r\n print(x)\r\nfor x in child:\r\n print(x)\r\nfor x in man:\r\n print(x)\r\nprint(cap)", "cases = int(input())\r\nrats = []\r\nwom_chil = []\r\nman = []\r\ncap = []\r\nwhile cases:\r\n cases -= 1\r\n a, b = input().split()\r\n if b == \"rat\":\r\n rats.append(a)\r\n elif b == \"man\":\r\n man.append(a)\r\n elif b == \"captain\":\r\n cap.append(a)\r\n else:\r\n wom_chil.append(a)\r\n\r\nfor name in rats+wom_chil+man + cap:\r\n print(name)\r\n\r\n\r\n\r\n", "import operator\r\n\r\nclass object:\r\n s1 = \"\"\r\n s2 = \"\"\r\n lamda = -1\r\n\r\nn = int(input())\r\n\r\nlist = []\r\n\r\nfor i in range(n):\r\n ob = object()\r\n string = input().split()\r\n ob.s1 = string[0]\r\n ob.s2 = string[1]\r\n if ob.s2 == \"rat\":\r\n ob.lamda = 1\r\n elif ob.s2 == \"woman\" or ob.s2 == \"child\":\r\n ob.lamda = 2\r\n elif ob.s2 == \"man\":\r\n ob.lamda = 3\r\n elif ob.s2 == \"captain\":\r\n ob.lamda = 4\r\n\r\n list.append(ob)\r\n\r\nlist.sort(key=operator.attrgetter('lamda'))\r\nfor i in range(n):\r\n print(list[i].s1)\r\n", "f=int(input())\ncap=[]\nrat=[]\nwoman=[]\nman=[]\nwhile f:\n name,role=input().split()\n if role == 'captain':\n cap.append(name)\n elif role == 'rat':\n rat.append(name)\n elif role == 'woman' or role == 'child':\n woman.append(name)\n elif role == 'man':\n man.append(name)\n f-=1\nfor i in rat:\n print(i)\nfor i in woman:\n print(i)\nfor i in man:\n print(i)\nfor i in cap:\n print(i)\n \t \t \t \t \t \t\t \t \t\t\t", "# Long Contest 1, Problem K\r\ndef print_list(items):\r\n\tfor item in items:\r\n\t\tprint(item)\r\n\t\r\nn = int(input())\r\nrats = []\r\nwomen_children = []\r\nmen = []\r\ncaptains = []\r\nwhile n > 0:\r\n\tn -= 1\r\n\tname, status = input().split()\r\n\tif status == 'rat':\r\n\t\trats.append(name)\r\n\telif status == 'woman' or status == 'child':\r\n\t\twomen_children.append(name)\r\n\telif status == 'man':\r\n\t\tmen.append(name)\r\n\telif status == 'captain':\r\n\t\tcaptains.append(name)\r\nprint_list(rats)\r\nprint_list(women_children)\r\nprint_list(men)\r\nprint_list(captains)", "def main():\n def clear(t):\n nonlocal n, q\n for i in range(n):\n if q[i] == None:\n continue\n if q[i][1] in t:\n print(q[i][0])\n q[i] = None\n n = int(input())\n q = []\n for i in range(n):\n q.append(input().split(' '))\n clear(set([\"rat\"]))\n clear(set([\"woman\", \"child\"]))\n clear(set([\"man\"]))\n clear(set([\"captain\"]))\nmain()\n\n", "n=int(input())\nd=dict()\nfor i in range(0,n):\n\tx=input()\n\tx1=x.split()\n\td[x1[0]]=x1[1]\nfor k,v in d.items():\n\tif v=='rat':\n\t\tprint(k)\nfor k,v in d.items():\n\tif v=='woman':\n\t\tprint(k)\n\telif v=='child':\n\t\tprint(k)\t\nfor k,v in d.items():\n\tif v=='man':\n\t\tprint(k)\nfor k,v in d.items():\n\tif v=='captain':\n\t\tprint(k)\n \t \t \t \t\t \t \t \t \t\t\t \t \t", "import math , itertools , fractions , heapq , sys\r\n# from queue import PriorityQueue\r\nsi = 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\n'''\r\n⠀⠀⠀⠀⠀⠀⠀⢀⣤⣴⣶⣶⣶⣶⣶⣦⣄⠀⠀⠀⠀⠀⠀⠀⠀⠀\r\n⠀⠀⠀⠀⠀⠀⢀⣾⠟⠛⢿⣿⣿⣿⣿⣿⣿⣷⠀⠀⠀⠀⠀⠀⠀⠀\r\n⠀⠀⠀⠀⠀⠀⢸⣿⣄⣀⣼⣿⣿⣿⣿⣿⣿⣿⠀⢀⣀⣀⣀⡀⠀⠀\r\n⠀⠀⠀⠀⠀⠀⠈⠉⠉⠉⠉⠉⠉⣿⣿⣿⣿⣿⠀⢸⣿⣿⣿⣿⣦⠀\r\n⠀⣠⣾⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⠀⢸⣿⣿⣿⣿⣿⡇\r\n⢰⣿⣿⣿⣿⣿⣿⣿⣿⠿⠿⠿⠿⠿⠿⠿⠿⠋⠀⣼⣿⣿⣿⣿⣿⡇\r\n⢸⣿⣿⣿⣿⣿⡿⠉⢀⣠⣤⣤⣤⣤⣤⣤⣤⣴⣾⣿⣿⣿⣿⣿⣿⡇\r\n'''\r\n#sys.stdin = open(\"popcorn.in\",\"r\")\r\nn = int(input())\r\np = {\"rat\": 1, \"woman\": 2, \"child\": 2, \"man\": 3, \"captain\": 4}\r\narr = [si().split() for _ in range(n)]\r\narr.sort(key=lambda x: p[x[1]])\r\nfor i in arr:\r\n print(i[0])\r\n'''\r\n⢸⣿⣿⣿⣿⣿⡇⠀⣾⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⡿⠀\r\n⠘⣿⣿⣿⣿⣿⡇⠀⣿⣿⣿⣿⣿⠛⠛⠛⠛⠛⠛⠛⠛⠛⠋⠁⠀⠀ \r\n⠀⠈⠛⠻⠿⠿⠇⠀⣿⣿⣿⣿⣿⣿⣿⣿⠿⠿⣿⡇⠀⠀⠀⠀⠀⠀\r\n⠀⠀⠀⠀⠀⠀⠀⠀⣿⣿⣿⣿⣿⣿⣿⣧⣀⣀⣿⠇⠀⠀⠀⠀⠀⠀\r\n⠀⠀⠀⠀⠀⠀⠀⠀⠘⢿⣿⣿⣿⣿⣿⣿⣿⡿⠋⠀⠀⠀⠀⠀⠀⠀\r\n'''", "n = int(input())\r\n\r\nnames = []\r\nstatuses = []\r\nfor i in range(n):\r\n\tname, status = input().split()\r\n\tnames.append(name)\r\n\tstatuses.append(status)\r\n\r\nind = [i for i, x in enumerate(statuses) if x=='rat']\r\nfor i in ind:\r\n\tprint(names[i])\r\n\r\nind = [i for i, x in enumerate(statuses) if x=='woman' or x=='child']\r\nfor i in ind:\r\n\tprint(names[i])\r\n\t\r\nind = [i for i, x in enumerate(statuses) if x=='man']\r\nfor i in ind:\r\n\tprint(names[i])\r\n\t\r\nind = [i for i, x in enumerate(statuses) if x=='captain']\r\nfor i in ind:\r\n\tprint(names[i])", "n = int(input())\r\nl1=[]\r\nl2=[]\r\nfor i in range(n):\r\n a,b = input().split()\r\n l1.append(a)\r\n l2.append(b)\r\nfor i in range(len(l2)):\r\n if(l2[i]==\"rat\"):\r\n print(l1[i])\r\n \r\nfor i in range(len(l2)):\r\n if(l2[i]==\"woman\" or l2[i]==\"child\"):\r\n print(l1[i])\r\nfor i in range(len(l2)):\r\n if(l2[i]==\"man\"):\r\n print(l1[i])\r\nfor i in range(len(l2)):\r\n if(l2[i]==\"captain\"):\r\n print(l1[i])", "n = int(input())\r\nr = []\r\nw = []\r\nm = []\r\nfor i in range(n):\r\n a = ''\r\n a = input()\r\n if (a.split())[1] == 'rat':\r\n r.append(a.split()[0])\r\n elif (a.split())[1] == 'woman' or (a.split())[1] == 'child':\r\n w.append(a.split()[0])\r\n elif (a.split())[1] == 'man':\r\n m.append(a.split()[0])\r\n else:\r\n cap = a.split()[0]\r\n \r\n \r\ndef mdf(x, y, z):\r\n for i in x:\r\n print(i)\r\n for j in y:\r\n print(j)\r\n for k in z:\r\n print(k)\r\n \r\n \r\nmdf(r, w, m)\r\nprint(cap)", "n = int(input())\r\na = []\r\nfor i in range(n):\r\n a.append(input())\r\n a[i] = a[i].split()\r\n a[i] = a[i][::-1]\r\n if a[i][0] == 'rat':\r\n a[i][0] = 0\r\n if a[i][0] == 'woman' or a[i][0] == 'child':\r\n a[i][0] = 1\r\n if a[i][0] == 'man':\r\n a[i][0] = 2\r\n if a[i][0] == 'captain':\r\n a[i][0] = 3\r\nfor i in range(4):\r\n for j in a:\r\n if j[0] == i:\r\n print(j[1])", "n = int(input())\r\ncrew = []\r\nfor i in range(n):\r\n name, status = input().split()\r\n if status == 'rat':\r\n crew.append((name, 0))\r\n elif status == 'woman' or status == 'child':\r\n crew.append((name, 1))\r\n elif status == 'man':\r\n crew.append((name, 2))\r\n else:\r\n crew.append((name, 3))\r\ncrew.sort(key=lambda x: x[1])\r\nfor name, _ in crew:\r\n print(name)", "n=int(input())\nname=[]\nwc=[]\nm=[]\nc=[]\nfor _ in range(n):\n x,y=map(str,input().split())\n if y=='rat':\n name.append(x)\n elif y=='woman' or y=='child':\n wc.append(x)\n elif y=='man':\n m.append(x)\n else:\n c.append(x)\nfor i in name:\n print(i)\nfor j in wc:\n print(j)\nfor k in m:\n print(k)\nfor l in c:\n print(l)\n \t \t\t \t \t\t\t\t \t \t\t\t\t \t \t", "# LUOGU_RID: 104745101\nn = int(input())\r\no = dict(zip('tminp', [0, 1, 1, 2, 3]))\r\na = sorted(enumerate([input().split()for _ in range(n)]),\r\n key=lambda x: (o[x[1][1][2]], x[0]))\r\nfor x in a:\r\n print(x[1][0])\r\n", "n = int(input())\n\npeople = []\n\nfor i in range(n):\n people.append(input().split())\n\norder = {'rat': 0, 'child': 1, 'woman': 1, 'man': 2, 'captain': 3}\n\nfor i in range(n-1):\n for j in range(n-1-i):\n if order[people[j][1]] > order[people[j+1][1]]:\n temp = people[j]\n people[j] = people[j+1]\n people[j+1] = temp\n\nfor i in range(n):\n print(people[i][0])\n\n\t \t \t \t\t\t \t\t \t \t", "# your code goes here\n# your code goes here\nl1 = []\nn = int(input())\nfor _ in range(n):\n l2 = []\n name, cato = input().split()\n #print(name, cato)\n l2.append(name)\n l2.append(cato)\n l1.append(l2)\n\n \nrat = []\nwc = []\nman = []\ncap = []\n\nfor i in range(n):\n\n #print(\"for\", i, l1[i][1], l1[i][0])\n \n if(l1[i][1] == \"rat\"):\n rat.append(l1[i][0])\n #print(\"rat\", l1[i][0])\n \n elif((l1[i][1] == \"woman\") or (l1[i][1] == \"child\")):\n wc.append(l1[i][0])\n #print(\"wc\", l1[i][0])\n \n elif(l1[i][1] == \"man\"):\n man.append(l1[i][0])\n #print(\"man\", l1[i][0])\n \n elif(l1[i][1] == \"captain\"):\n cap.append(l1[i][0])\n #print(\"cap\", l1[i][0])\n\n#print(rat)\n##print(wc)\n#print(man)\n#print(cap)\n\nfor i in rat:\n print(i)\n \nfor i in wc:\n print(i)\n \nfor i in man:\n print(i)\n \nfor i in cap:\n print(i)\n\t \t\t \t\t\t \t\t \t \t \t \t \t \t", "n = int(input())\r\na = []\r\nfor i in range(n):\r\n\ta.append(input().split())\r\nfor i in range(n):\r\n\tif (a[i][1] == \"rat\"):\r\n\t\tprint(a[i][0])\r\nfor i in range(n):\r\n\tif (a[i][1] == \"woman\" or a[i][1] == \"child\"):\r\n\t\tprint(a[i][0])\r\nfor i in range(n):\r\n\tif (a[i][1] == \"man\"):\r\n\t\tprint(a[i][0])\r\nfor i in range(n):\r\n\tif (a[i][1] == \"captain\"):\r\n\t\tprint(a[i][0])\r\n", "n = int(input())\r\nrat = []\r\nchild = []\r\nman = []\r\ncap = []\r\nfor i in range(n):\r\n\tt = input().split()\r\n\tif t[1] == \"rat\":\r\n\t\trat.append(t)\r\n\tif t[1] == \"child\" or t[1] == \"woman\":\r\n\t\tchild.append(t)\r\n\tif t[1] == \"man\":\r\n\t\tman.append(t)\r\n\tif t[1] == \"captain\":\r\n\t\tcap.append(t)\r\nfor i in rat:\r\n\tprint(i[0])\r\nfor i in child:\r\n\tprint(i[0])\r\nfor i in man:\r\n\tprint(i[0])\r\nfor i in cap:\r\n\tprint(i[0])", "q=[]\nw=[]\ne=[]\nr=[]\nfor _ in range(int(input())):\n a,b=input().split()\n if b==\"rat\":r+=[a]\n elif b==\"man\":w+=[a]\n elif b==\"captain\":q+=[a]\n else: e+=[a]\nprint('\\n'.join(r+e+w+q))\n \t \t \t\t \t\t \t \t\t \t\t", "n=int(input())\r\ncap=[]\r\nra=[]\r\nwo=[]\r\nma=[]\r\nfor i in range(n):\r\n a,b=map(str,input().split(\" \"))\r\n if(b==\"captain\"):\r\n cap.append(a)\r\n elif(b==\"rat\"):\r\n ra.append(a)\r\n elif(b==\"man\"):\r\n ma.append(a)\r\n else:\r\n wo.append(a)\r\n \r\nfor r in ra:\r\n print(r)\r\nfor r in wo:\r\n print(r)\r\nfor r in ma:\r\n print(r)\r\nfor r in cap:\r\n print(r)", "n=int(input())\nr=[]\nwc=[]\nmn=[]\nca=[]\nwhile n:\n\tn-=1\n\tm,t=input().split()\n\tif(t==\"rat\"):\n\t\tr.append(m)\n\telif(t==\"woman\"or t==\"child\" ):\n\t\twc.append(m)\n\telif(t==\"man\"):\n\t\tmn.append(m)\n\telif(t==\"captain\"):\n\t\tca.append(m)\nfor i in r:\n\tprint(i,end=\"\\n\")\nfor i in wc:\n\tprint(i,end=\"\\n\")\nfor i in mn:\n\tprint(i,end=\"\\n\")\nfor i in ca:\n\tprint(i,end=\"\\n\")\n\t\n\t\t \t\t \t\t \t\t \t \t \t \t\t\t\t \t", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input().rstrip())\r\ndata = []\r\n\r\nfor i in range(n):\r\n data.append(input().rstrip().split() + [i])\r\ndata.sort(key=lambda x: (4 if x[1]=='captain' else 3 if x[1]=='man' else 2 if x[1]=='child' or x[1]=='woman' else 1, x[2]))\r\n\r\nfor d in data:\r\n print(d[0])", "n = int(input())\r\nmembers = []\r\nfor i in range(n):\r\n members.append(input().split())\r\n\r\ntier = {'rat':1, 'woman':2, 'child':2, 'man':3, 'captain':4}\r\n\r\nfor i in range(1, 5):\r\n for j in range(len(members)):\r\n if (tier[members[j][1]] == i):\r\n print(members[j][0])", "n = int(input(\"\"))\ncrew = []\nprios = {\"rat\":[], \"womenNchildren\":[], \"man\":[], \"captain\":[]}\nfor x in range(n):\n crew.append(input(\"\").split())\nfor y in crew:\n try:\n prios[y[1]].append(y[0])\n except:\n prios[\"womenNchildren\"].append(y[0])\nfor z in prios:\n if prios[z] == []:\n continue\n print(*prios[z], sep=\"\\n\", end=\"\\n\")\n \t\t \t \t\t\t\t \t\t \t \t \t \t\t\t \t", "a = []\r\nd = {'rat': 1, 'woman': 2, 'child': 2, 'man': 3, 'captain': 4}\r\n\r\nfor _ in range(int(input())):\r\n name, rank = input().split()\r\n rank = d[rank]\r\n a.append((name, rank))\r\n\r\nfor i in range(1, 5):\r\n for x in a:\r\n if x[1] == i:\r\n print(x[0])", "n=int(input())\r\nd={\r\n 'captain':3,\r\n 'rat':0,\r\n 'woman':1,\r\n 'child':1,\r\n 'man':2,\r\n}\r\ng=[]\r\nfor i in range(n):\r\n a,b=map(str,input().split())\r\n g.append((a,b))\r\ng.sort(key=lambda x:d[x[1]])\r\nprint(*(i[0] for i in g),sep='\\n')", "'''input\r\n6\r\nJack captain\r\nAlice woman\r\nCharlie man\r\nTeddy rat\r\nBob child\r\nJulia woman\r\n'''\r\ncap = \"\"\r\nman = []\r\nwc = []\r\nrat = []\r\n\r\nfor _ in range(int(input())):\r\n name,crew = map(str,input().split())\r\n if crew == \"captain\":\r\n cap = name\r\n elif crew == \"man\":\r\n man.append(name)\r\n elif crew == \"woman\" or crew == \"child\":\r\n wc.append(name)\r\n elif crew == \"rat\":\r\n rat.append(name)\r\nprint(\"\\n\".join(rat+wc+man+[cap]))", "l=[]\r\nfor x in range(int(input())):\r\n\tnl=list(input().split())\r\n\tl+=[nl]\r\nfor x in l:\r\n\tif x[1]==\"rat\":\r\n\t\tx.append(0)\r\n\telif x[1]==\"woman\" or x[1]==\"child\":\r\n\t\tx.append(1)\r\n\telif x[1]==\"man\":\r\n\t\tx.append(2)\r\n\telse:\r\n\t\tx.append(3)\r\nl.sort(key=lambda x:x[2])\r\nfor x in l:\r\n\tprint(x[0])", "n = int(input())\r\npriority = {\"rat\": 1, \"woman\": 2, \"child\": 2, \"man\": 3, \"captain\": 4}\r\na = [input().split() for _ in range(n)]\r\na.sort(key=lambda x: priority[x[1]])\r\nfor name in a: print(name[0])", "n = int(input())\nrat = []\nwoc = []\nman = []\n\nfor i in range(n):\n name, info = input().split()\n if info == \"rat\":\n rat.append(name)\n elif info == \"woman\" or info == \"child\":\n woc.append(name)\n elif info == \"man\":\n man.append(name)\n elif info == \"captain\":\n captain = name\n\noutput = rat + woc + man\noutput.append(captain)\n\nfor j in range(n):\n print(output[j])\n", "rat, womanchild, man, captain = [],[],[],[]\r\nfor i in range(int(input())):\r\n a, b = input().split()\r\n if b == 'rat':rat.append(a)\r\n elif b == 'woman' or b == 'child': womanchild.append(a)\r\n elif b == 'man':man.append(a)\r\n else: captain.append(a)\r\nfor i in rat: print(i)\r\nfor i in womanchild: print(i)\r\nfor i in man: print(i)\r\nfor i in captain: print(i)", "lst=[]\r\nw=[]\r\nz=[['rat'],['woman','child'],['man'],['captain']]\r\nfor i in range(int(input())):\r\n x=list(map(str,input().split()))\r\n lst.append(x)\r\nfor i in range(4):\r\n## print('iii=',i)\r\n for j in lst:\r\n## print('j=',j)\r\n## print('j[1]=%s z[i]=%s'%(j[1],z[i]))\r\n if j[1]in z[i]:\r\n print(j[0])\r\n w.append(j)\r\n \r\n## print('lst=',lst)\r\n## print('\\n')\r\n for t in w:\r\n lst.remove(t)\r\n w=[]\r\n", "n= int (input())\r\nx=[]\r\nd={'captain':4,'woman':2,'man':3,'rat':1,'child':2}\r\n\r\n\r\nfor i in range(n):\r\n name, type_= input().split()\r\n x.append([ name, d[type_]])\r\n \r\nz=sorted(x,key=lambda x:x[1])\r\nfor i in z:\r\n print(i[0])", "n = int(input())\r\nl = []\r\nfor i in range(n):\r\n\tname, title = input().split()\r\n\tif title == \"rat\": title = 0\r\n\telif title == \"woman\" or title == \"child\": title = 1\r\n\telif title == \"man\": title = 2\r\n\telse: title = 3\r\n\tl.append([title, i, name])\r\nl.sort()\r\nfor i, j, x in l:\r\n\tprint(x)", "# cook your dish here\n\nn=int(input())\nv=[]\nfor i in range(n):\n a=list(map(str,input().split()))\n v.append(a)\n \n# print(v)\nrat=[]\nchild=[]\nman=[]\ncaptain=[]\nfor i in range(n):\n if v[i][1]=='rat':\n rat.append(v[i][0])\n \n \n elif v[i][1]=='child' or v[i][1]=='woman':\n child.append(v[i][0])\n \n elif v[i][1]=='man':\n man.append(v[i][0])\n \n elif v[i][1]=='captain':\n captain.append(v[i][0])\n \nfor i in rat:\n print(i)\n \nfor i in child:\n print(i)\n \nfor i in man:\n print(i)\n \nfor i in captain:\n print(i)\n \n \n \n\t \t \t \t \t \t\t \t\t \t\t\t\t", "z=[]\r\nfor i in range(int(input())):\r\n\tx=list(input().split(\" \"))\r\n\tz.append(x)\r\n\tfor j in z:\r\n\t\tif j[1]==\"woman\" or j[1]==\"child\":\r\n\t\t\tj[1]=\"woman\"\r\nd=['rat', 'woman','man', 'captain'] \r\nz.sort(key = lambda i: d.index(i[1]))\r\nfor i in z:\r\n\tprint(i[0])", "n=int(input())\r\nr=[]\r\nc=[]\r\nm=[]\r\nh=[]\r\nfor i in range(n):\r\n a,b=map(str,input().split())\r\n if b==\"rat\":\r\n r.append(a)\r\n elif b==\"woman\" or b==\"child\":\r\n c.append(a)\r\n elif b==\"man\":\r\n m.append(a)\r\n elif b==\"captain\":\r\n h.append(a)\r\nt=r+c+m+h\r\nfor i in t:\r\n print(i)", "n, a = int(input()), []\r\n\r\nfor i in range(n):\r\n a.append(input().split())\r\n\r\nroles = [['rat'], ['child', 'woman'], ['man'], ['captain']]\r\n\r\nfor role in roles:\r\n for x in a:\r\n if (x[-1] in role):\r\n print(x[0])\r\n", "n=int(input())\na=[]\nfor i in range(n):\n\tx=input().split()\n\tc=[]\n\tfor j in range(2):\n\t\tc.append(x[j])\n\ta.append(c)\nfor i in range(n):\n\tif(a[i][1]=='rat'):\n\t\tprint(a[i][0])\nfor i in range(n):\n\tif(a[i][1]=='woman' or a[i][1]=='child'):\n\t\tprint(a[i][0])\nfor i in range(n):\n\tif(a[i][1]=='man'):\n\t\tprint(a[i][0])\nfor i in range(n):\n\tif(a[i][1]=='captain'):\n\t\tprint(a[i][0])\n\t \t \t \t\t \t\t\t \t \t\t \t \t \t\t", "peoples_count = int(input())\r\ntitles = {'rat':1, 'child':2, 'woman':2, 'man':3, 'captain':4}\r\ncrew = []\r\ni = 0\r\nwhile i < peoples_count:\r\n\tname, title = (x for x in input().split())\r\n\tcrew.append([name, titles[title]])\r\n\ti += 1\r\ncrew.sort(key= lambda x: x[1])\r\nfor human in crew:\r\n\tprint(human[0])", "n=int(input())\r\npeople = {\"wc\":[],\"man\":[],\"captain\":[]}\r\nfor i in range(0,n):\r\n name,ocp = input().split(\" \")\r\n if(ocp==\"rat\"):\r\n print(name)\r\n continue\r\n elif(ocp==\"woman\" or ocp==\"child\"):\r\n people[\"wc\"].append(name)\r\n else:\r\n people[ocp].append(name)\r\n\r\nfor i in people.keys():\r\n for j in people[i]:\r\n print(j)\r\n\r\n\r\n \r\n\r\n\r\n", "def f(x):\r\n tmp = 'rat woman child man captain'.split().index(x[1])\r\n if tmp == 1:\r\n tmp = 2\r\n return tmp\r\n\r\n\r\nfor i in sorted([input().split() for i in range(int(input()))], key=f):\r\n print(i[0])", "dit = {'rat':[],'woman':[],'man':[],'captain':[]}\r\nfor _ in range(int(input())):\r\n n,s = input().split()\r\n if s=='child':\r\n dit['woman'].append(n)\r\n else:\r\n dit[s].append(n)\r\n\r\nfor e in dit['rat']:\r\n print(e)\r\nfor e in dit['woman']:\r\n print(e)\r\nfor e in dit['man']:\r\n print(e)\r\nfor e in dit['captain']:\r\n print(e)\r\n ", "# http://codeforces.com/problemset/problem/63/A\n\ndef print_list(list):\n for e in list:\n print(e)\n\nn = int(input())\n\nrats = []\nwomen_and_children = []\nmen = []\ncaptain = ''\n\nfor i in range(n):\n name, status = input().split()\n if status == 'rat':\n rats.append(name)\n elif status == 'woman' or status == 'child':\n women_and_children.append(name)\n elif status == 'man':\n men.append(name)\n elif status == 'captain':\n captain = name\n\nprint_list(rats)\nprint_list(women_and_children)\nprint_list(men)\nprint(captain)\n", "n = int(input())\r\nmember = {'rat':[],'k':[],'man':[],'captain':[]}\r\nfor i in range(n):\r\n name,clas = input().split()\r\n if clas=='woman' or clas=='child':\r\n clas = 'k'\r\n member[clas].append(name)\r\nfor i in member:\r\n for j in member[i]:\r\n print(j)", "r = []\r\nw = []\r\nm = []\r\nc = []\r\nfor i in range(int(input())):\r\n a ,b = input().split()\r\n if b == 'rat':\r\n r +=[a]\r\n elif b == 'woman' or b == 'child':\r\n w +=[a]\r\n elif b == 'man':\r\n m += [a]\r\n else:\r\n c +=[a]\r\n\r\nfor i in r :\r\n print(i)\r\nfor i in w :\r\n print(i)\r\nfor i in m :\r\n print(i)\r\nfor i in c :\r\n print(i)\r\n\r\n", "def fn(e):\r\n return e[1]\r\nb=[]\r\nn=int(input())\r\nfor i in range(n):\r\n a= list(map(str, input().split()))\r\n if a[1]=='rat':a[1]=0\r\n elif a[1]=='child' or a[1]=='woman':a[1]=1\r\n elif a[1]=='man':a[1]=2\r\n else:a[1]=3\r\n b.append(a)\r\nb.sort(key=fn)\r\nfor i in range(n):print(b[i][0])\r\n", "n = int(input())\r\nname_list = []\r\nl = []\r\nd = {}\r\n\r\nfor i in range(n):\r\n s = input()\r\n name_list.append(s)\r\n\r\nfor name in name_list:\r\n k = name.split()\r\n d[k[0]] = k[1]\r\n\r\n\r\nfor key in d:\r\n if d[key] == \"rat\":\r\n l.append(key)\r\n\r\nfor key in d:\r\n if d[key] == \"woman\" or d[key] == \"child\":\r\n l.append(key)\r\n\r\nfor key in d:\r\n if d[key] == \"man\":\r\n l.append(key)\r\n\r\nfor key in d:\r\n if d[key] == \"captain\":\r\n l.append(key)\r\n\r\n\r\nfor w in l:\r\n print(w)", "a=[]\nb=[]\nc=[]\nfor i in range(int(input())):\n m,n=map(str,input().split())\n #print(m,n)\n a.append(m)\n b.append(n)\n#print(a)\n#print(b)\nfor i in range(len(b)):\n if b[i]=='rat':\n c.append(a[i])\nfor i in range(len(b)):\n if b[i]=='woman' or b[i]=='child':\n c.append(a[i])\nfor i in range(len(b)):\n if b[i]=='man':\n c.append(a[i])\nfor i in range(len(b)):\n if b[i]=='captain':\n c.append(a[i])\nfor i in range(len(c)):\n print(c[i])\n\t \t \t\t\t \t\t \t\t\t\t\t\t \t\t\t\t", "n=int(input())\r\nL=[0,100,200,300]\r\nd={}\r\ndef au(s):\r\n if(s==\"rat\"):\r\n return 0\r\n if(s==\"woman\" or s==\"child\"):\r\n return 1\r\n if(s==\"man\"):\r\n return 2\r\n else:\r\n return 3\r\nL1=[]\r\nfor k in range(n):\r\n c=input()\r\n c=c.split(\" \")\r\n a=c[0]\r\n b=c[1]\r\n r=au(b)\r\n d[L[r]]=a\r\n L1+=[L[r]]\r\n L[r]+=1\r\nL1=sorted(L1)\r\nfor k in L1:\r\n print(d[k])\r\n \r\n", "words = [\"ra\",\"woch\",\"ma\",\"ca\"]\r\ndef order(st):\r\n for i in range(len(words)):\r\n if st[1][:2] in words[i]:\r\n return i * 101 + st[2]\r\nn = int(input())\r\ncrue = [input().split() + [i] for i in range(n)]\r\ncrue.sort(key=order)\r\nans = [crue[i][0] for i in range(n)]\r\nprint(\"\\n\".join(ans))\r\n", "n=int(input())\narr1=[]\narr2=[]\nfor i in range(n):\n s1,s2=map(str,input().split())\n arr1.append(s1)\n arr2.append(s2)\nfor i in range(n):\n if arr2[i]==\"rat\":\n print(arr1[i])\nfor i in range(n):\n if arr2[i]==\"child\" or arr2[i]==\"woman\":\n print(arr1[i])\nfor i in range(n):\n if arr2[i]==\"man\":\n print(arr1[i])\nfor i in range(n):\n if arr2[i]==\"captain\":\n print(arr1[i])\n \t\t \t \t \t\t \t \t \t \t \t", "d = {\r\n 'rat': [],\r\n 'woman/children': [],\r\n 'man': [],\r\n 'captain': []\r\n }\r\n\r\nfor _ in range(int(input())):\r\n name, status = map(str, input().split())\r\n if status == 'woman' or status == 'child':\r\n d['woman/children'].append(name)\r\n else:\r\n d[status].append(name)\r\n\r\nn = []\r\n\r\nfor key in d.keys():\r\n n.extend(d[key])\r\n\r\nfor name in n:\r\n print(name)\r\n", "priority = {\n \"rat\": 1,\n \"woman\": 2,\n \"child\": 2,\n \"man\": 3,\n \"captain\": 4,\n}\n\nn = int(input())\n\nevacuate = []\nfor _ in range(n):\n name, role = input().split()\n evacuate.append((name, priority[role]))\nevacuate.sort(key=lambda x: x[1])\n\nfor person in evacuate:\n print(person[0])\n", "t=int(input())\r\nrats=[]\r\nw=[]\r\nm=[]\r\nk=[]\r\na=[]\r\nfor x in range(t):\r\n n,c=input().split()\r\n if c=='rat':\r\n rats.append(n)\r\n elif c=='woman' or c=='child':\r\n w.append(n)\r\n elif c=='man':\r\n m.append(n)\r\n else:\r\n k.append(n)\r\na.append(rats)\r\na.append(w)\r\na.append(m)\r\nfor x in range(3):\r\n for y in range(len(a[x])):\r\n print(a[x][y])\r\nprint(*k)\r\n", "n=int(input())\r\nr=[]\r\nw=[]\r\nm=[]\r\nc=[]\r\nfor i in range(n):\r\n\ta=list(input().split())\r\n\tif a[1]=='rat':\r\n\t\tr.append(a[0])\r\n\telif a[1]=='woman' or a[1]=='child':\r\n\t\tw.append(a[0])\r\n\telif a[1]=='man':\r\n\t\tm.append(a[0])\r\n\telse:\r\n\t\tc.append(a[0])\r\nfor j in r:\r\n\tprint(j)\r\nfor j in w:\r\n\tprint(j)\r\nfor j in m:\r\n\tprint(j)\r\nfor j in c:\r\n\tprint(j)", "a=int(input())\r\nb=[]\r\nd=[]\r\nfor k in range (a):\r\n c=input()\r\n c=c.split()\r\n b.append(c)\r\n#ratas\r\nfor r in range(a):\r\n if b[r][1]==\"rat\":\r\n d.append(b[r][0])\r\n#mujeres y niños\r\nfor c in range(a):\r\n if b[c][1]==\"woman\" or b[c][1]==\"child\":\r\n d.append(b[c][0])\r\n#hombres\r\nfor h in range(a):\r\n if b[h][1]==\"man\":\r\n d.append(b[h][0])\r\nfor n in range(a):\r\n if b[n][1]==\"captain\":\r\n d.append(b[n][0])\r\nfor i in range(a):\r\n print(d[i])", "n = int(input())\r\n\r\n# Assign priority to each crew member\r\npriority = {'rat': 1, 'woman': 2, 'child': 2, 'man': 3, 'captain': 4}\r\n\r\n# Read in the crew members and sort them\r\ncrew = []\r\nfor i in range(n):\r\n name, status = input().split()\r\n crew.append((name, priority[status], i)) # Add position to handle ties\r\ncrew.sort(key=lambda x: (x[1], x[2]))\r\n\r\n# Output the sorted crew members\r\nfor name, _, _ in crew:\r\n print(name)\r\n", "def main():\r\n order=[[],[],[],[]]\r\n for _ in range(int(input())):\r\n n, r = input().split()\r\n if r == 'rat':\r\n order[0].append(n)\r\n elif r == 'woman' or r == 'child':\r\n order[1].append(n)\r\n elif r == 'man':\r\n order[2].append(n)\r\n else:\r\n order[3].append(n)\r\n for i in order:\r\n for j in i:\r\n print(j)\r\n\r\nmain() \r\n", "from collections import defaultdict\r\n\r\n\r\ndef main():\r\n n = int(input())\r\n hash_map = defaultdict(list)\r\n for _ in range(n):\r\n s = input().split()\r\n if s[-1] == 'rat':\r\n hash_map[0].append(s[0])\r\n elif s[-1] == 'woman' or s[-1] == 'child':\r\n hash_map[1].append(s[0])\r\n elif s[-1] == 'man':\r\n hash_map[2].append(s[0])\r\n elif s[-1] == 'captain':\r\n hash_map[3].append(s[0])\r\n\r\n for i in range(0, 4):\r\n if i in hash_map:\r\n names = hash_map[i]\r\n for x in names:\r\n print(x)\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "n = int(input())\nd = {'rat' : [],'woman' : [],'man': [],'captain' : []}\nfor i in range(n):\n temp = input()\n name,type_ = temp.split(' ')\n if type_ == 'child':\n type_ = 'woman'\n d[type_].append(name)\nfor i in d.values():\n for j in i:\n print(j)", "n = int(input())\r\nl = []\r\nfor i in range(n):\r\n l.append(input().split(\" \"))\r\nqueue = [] \r\nfor i in range(n):\r\n if l[i][1] == \"rat\":\r\n queue.append(l[i][0])\r\nfor i in range(n):\r\n if l[i][1] == \"woman\" or l[i][1] == \"child\":\r\n queue.append(l[i][0])\r\nfor i in range(n):\r\n if l[i][1] == \"man\":\r\n queue.append(l[i][0])\r\nfor i in range(n):\r\n if l[i][1] == \"captain\":\r\n queue.append(l[i][0])\r\n\r\nfor i in queue:\r\n print(i)", "captain=\"\"\nwomen_child=[]\nrats=[]\nmen=[]\nn=int(input())\nfor i in range(n):\n name,status=input().split()\n if status==\"captain\":\n captain=name\n if status==\"woman\" or status==\"child\":\n women_child.append(name)\n if status==\"man\":\n men.append(name)\n if status==\"rat\":\n rats.append(name)\nfor i in rats:\n print(i)\nfor i in women_child:\n print(i)\nfor i in men:\n print(i)\nprint(captain)\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\nlst=[]\r\nfor i in range(n):\r\n s=[x for x in input().split()]\r\n lst.append(s)\r\nfor i in lst:\r\n if i[1]=='rat':\r\n print(i[0])\r\nfor i in lst:\r\n if i[1]=='woman' or i[1]=='child':\r\n print(i[0])\r\nfor i in lst:\r\n if i[1]=='man':\r\n print(i[0])\r\nfor i in lst:\r\n if i[1]=='captain':\r\n print(i[0])\r\n break", "l,r,s,res=[],[],[],[]\r\nt=int(input())\r\nfor i in range(t):\r\n a,b=map(str,input().split())\r\n l.append(a)\r\n l.append(b)\r\nfor i in range(len(l)):\r\n if i%2==0:\r\n r.append(l[i])\r\n else:\r\n s.append(l[i])\r\nfor i in range(len(s)):\r\n if 'rat' in s[i]:\r\n res.append(r[i])\r\nfor i in range(len(s)):\r\n if 'woman' in s[i]:\r\n res.append(r[i])\r\n if 'child' in s[i]:\r\n res.append(r[i])\r\nfor i in range(len(s)):\r\n if 'man' in s[i] :\r\n if s[i]!='woman':\r\n res.append(r[i])\r\nfor i in range(len(s)):\r\n if 'captain' in s[i]:\r\n res.append(r[i])\r\nfor i in res:\r\n print(i)", "n=int(input())\r\ncomplete=[]\r\nrat=[]\r\nmen=[]\r\nwomen_child=[]\r\ncaptain=[]\r\nfor i in range(n):\r\n word=input().split()\r\n complete.append(word)\r\nfor i in range(n):\r\n if complete[i][1]=='rat':\r\n rat.append(complete[i][0])\r\n elif complete[i][1]=='woman' or complete[i][1]=='child':\r\n women_child.append(complete[i][0])\r\n elif complete[i][1]=='man':\r\n men.append(complete[i][0])\r\n else:\r\n captain.append(complete[i][0])\r\nfinal=rat+women_child+men+captain\r\nfor i in final:\r\n print(i)", "n = int(input())\r\na = []\r\nb = []\r\nc = []\r\nd = []\r\n\r\nfor i in range(n):\r\n x , y = input().split()\r\n if y == 'rat': a += [x]\r\n elif y == 'man': b +=[x]\r\n elif y == 'captain' : c +=[x]\r\n else: d += [x]\r\n\r\nprint('\\n'.join(a+d+b+c))\r\n\r\n", "crew_list = []\r\nn = int(input())\r\ncapt = -1\r\n\r\nfor _ in range(n):\r\n crew_list.append(input().split())\r\n\r\nfor i in range(n):\r\n if crew_list[i][1] == 'rat':\r\n print(crew_list[i][0])\r\n if crew_list[i][1] == 'captain':\r\n capt = i\r\n\r\nfor i in range(n):\r\n if crew_list[i][1] == 'woman' or crew_list[i][1] == 'child':\r\n print(crew_list[i][0])\r\n\r\nfor i in range(n):\r\n if crew_list[i][1] == 'man':\r\n print(crew_list[i][0])\r\n\r\nprint(crew_list[capt][0])\r\n", "s = [list(map(str, input().split())) for i in range(int(input()))]\nfor i in range(len(s)):\n for j in range(1):\n if (s[i][1] == \"rat\"):\n print(s[i][0])\nfor i in range(len(s)):\n for j in range(1):\n if (s[i][1] == \"woman\"):\n print(s[i][0])\n if (s[i][1] == \"child\"):\n print(s[i][0])\nfor i in range(len(s)):\n for j in range(1):\n if (s[i][1] == \"man\"):\n print(s[i][0])\nfor i in range(len(s)):\n for j in range(1):\n if (s[i][1] == \"captain\"):\n print(s[i][0])\n\n", "n = int(input())\r\nb = []\r\nrats = []\r\nsecond = []\r\nthird = []\r\nfor i in range(n):\r\n a = input().split()\r\n b.append(a)\r\nfor i in b:\r\n if i[1] == 'rat':\r\n rats.append(i[0])\r\n elif i[1] in ['woman','child']:\r\n second.append(i[0])\r\n elif i[1] == 'man':\r\n third.append(i[0])\r\n else:\r\n cap = i[0]\r\nfor i in rats:\r\n print(i)\r\nfor i in second:\r\n print(i)\r\nfor i in third:\r\n print(i)\r\nprint(cap)", "class Member:\n def __init__(self, position, name, status):\n self.position = position\n self.name = name\n self.status = status\n\n def key(self):\n if self.status == 'rat':\n return (0, self.position)\n if self.status == 'woman' or self.status == 'child':\n return (1, self.position)\n if self.status == 'man':\n return (2, self.position)\n return (3, self.position)\n\nn = int(input())\ncrew = n * [None]\nfor i in range(n):\n parts = input().split()\n crew[i] = Member(i, parts[0], parts[1])\n\ncrew.sort(key = lambda member: member.key())\n\nfor member in crew:\n print(member.name)\n", "# coding: utf-8\nn = int(input())\nd = {'rat':0, 'woman':1, 'child':1, 'man':2, 'captain':3}\npeople = []\nfor i in range(n):\n tmp = input().split()\n people.append([d[tmp[1]], i, tmp[0]])\npeople.sort()\nfor i in people:\n print(i[2])\n", "n=int(input())\r\nrats,womenANDchild,men,captain=[],[],[],[]\r\nfor i in range(n):\r\n name,type=input().split()\r\n if type=='rat':rats.append(name)\r\n if type=='woman' or type=='child':womenANDchild.append(name)\r\n if type=='man':men.append(name)\r\n if type=='captain':captain.append(name)\r\nfor i in rats:print(i)\r\nfor i in womenANDchild:print(i)\r\nfor i in men:print(i)\r\nfor i in captain:print(i)", "c = int(input())\nt = c\ntotal = []\nwhile(t):\n member = list(input().split(\" \"))\n total.append(member)\n t -= 1\n\n\nfor i in range(c):\n if total[i][1] == \"rat\":\n print(total[i][0])\n \nfor i in range(c):\n if total[i][1] == \"woman\":\n print(total[i][0])\n elif total[i][1] == \"child\":\n print(total[i][0])\n \nfor i in range(c):\n if total[i][1] == \"man\":\n print(total[i][0])\n\nfor i in range(c):\n if total[i][1] == \"captain\":\n print(total[i][0])\n \n \t\t\t \t \t\t\t\t \t\t \t \t\t \t \t \t\t", "l=[]\r\nfor i in range(int(input())):\r\n a,b=input().split()\r\n k={a:b}\r\n l.append(k)\r\nfor i in range(4):\r\n if i==0:\r\n a='rat'\r\n b=' '\r\n elif i==1:\r\n a='woman'\r\n b='child'\r\n elif i==2:\r\n a='man'\r\n b=' '\r\n else:\r\n a='captain'\r\n b=' '\r\n for p in l:\r\n for k,v in p.items():\r\n if a ==v or b ==v:\r\n print(k)", "n = int(int(input()))\r\ncaptain = []\r\nkudi_bcha = []\r\ntrash = []\r\nchuha = []\r\nfor i in range(n):\r\n \r\n name,patani = input().split()\r\n if patani==\"captain\":\r\n captain.append(name)\r\n elif patani==\"woman\" or patani==\"child\":\r\n kudi_bcha.append(name)\r\n elif patani==\"man\":\r\n trash.append(name)\r\n elif patani==\"rat\":\r\n chuha.append(name)\r\n\r\nfinal_arr = chuha+kudi_bcha+trash+captain\r\n\r\nfor i in range(n):\r\n print(final_arr[i])\r\n", "\n# inp = lambda :list(map(int, input().split()))\n\nPR = {\n 'rat': 0,\n 'child': 1,\n 'woman': 1,\n 'man': 2,\n 'captain': 3\n}\n\npeople = []\nt = int(input())\nfor _ in range(t):\n people.append(input().split())\n\npeople.sort(key=lambda x:PR[x[1]])\nfor a in people:\n print(a[0])\n", "n = int(input())\r\nrats = []\r\nwomen_and_children = []\r\nmen = []\r\ncaptain = ''\r\n\r\nfor _ in range(n):\r\n name, status = input().split()\r\n if status == \"rat\":\r\n rats.append(name)\r\n elif status == \"woman\" or status == \"child\":\r\n women_and_children.append(name)\r\n elif status == \"man\":\r\n men.append(name)\r\n else:\r\n captain = name\r\n\r\nfor name in rats:\r\n print(name)\r\nfor name in women_and_children:\r\n print(name)\r\nfor name in men:\r\n print(name)\r\nprint(captain)\r\n", "n=int(input())\nl=[]\nfor i in range(n):\n\ta=tuple(map(str,input().split()))\n\tl.append(a)\nd = {\"rat\":1,\"woman\":2,\"child\":2,\"man\":3,\"captain\":5}\nl.sort(key = lambda x:d[x[1]])\nfor i in l:\n\tprint(i[0])\n\n\n\n \t \t\t \t \t \t \t \t\t\t \t \t", "n=int(input())\r\nlistw=[]\r\nlistr=[]\r\nlistm=[]\r\ncap=''\r\nfor i in range(n):\r\n a,b=map(str,input().split())\r\n if b=='rat':\r\n listr.append(a)\r\n elif b=='child' or b=='woman':\r\n listw.append(a)\r\n elif b=='man':\r\n listm.append(a)\r\n else:\r\n cap=a\r\nlistf=listr+listw+listm\r\nfor i in range(n-1):\r\n print(listf[i])\r\nprint(cap)\r\n \r\n \r\n ", "n = int(input())\na = []\nfor i in range(n):\n s = input()\n a+=[s.split()]\nfor i in range(n):\n if a[i][1]=='rat':\n print(a[i][0])\nfor i in range(n):\n if (a[i][1]=='woman') or (a[i][1]=='child'):\n print(a[i][0])\nfor i in range(n):\n if a[i][1]=='man':\n print(a[i][0])\nfor i in range(n):\n if a[i][1]=='captain':\n print(a[i][0])\n", "n = int(input())\r\narray = {'rat':0, 'woman':1, 'child':1, 'man':2, 'captain':3}\r\nelement = []\r\nfor i in range(n):\r\n a = input().split()\r\n element.append([array[a[1]], i, a[0]])\r\nelement.sort()\r\nfor i in element:\r\n print(i[2])", "n = int(input())\n\nline = []\n\nfor i in range(n):\n line.append(input().split())\n\ndef evacuate(people, line):\n for person in line:\n if person[1] in people:\n print(person[0])\n\nevacuate(['rat'], line)\nevacuate(['child', 'woman'], line)\nevacuate(['man'], line)\nevacuate(['captain'], line)\n", "n=int(input())\r\nca,cr,wch,ma='',[],[],[]\r\nfor i in range(n):\r\n x, y = str(input()).split()\r\n if y == 'captain':\r\n ca=x\r\n elif y == 'rat':\r\n cr.append(x)\r\n elif y in ['child','woman']:\r\n wch.append(x)\r\n else:\r\n ma.append(x)\r\nfor s in cr:\r\n print(s)\r\nfor s in wch:\r\n print(s)\r\nfor s in ma:\r\n print(s)\r\nprint(ca)", "tt=int(input())\r\nidif=[]\r\nname=[]\r\nwhile tt>0:\r\n w=input()\r\n w=w.split()\r\n idif.append(w[1])\r\n name.append(w[0])\r\n tt-=1\r\nif idif.count('rat')>0:\r\n b=idif.count('rat')\r\n for i in range(b):\r\n c=idif.index('rat')\r\n print(name[c])\r\n name.pop(c)\r\n idif.pop(c)\r\nif idif.count('woman')+idif.count('child')>0:\r\n b=idif.count('child')\r\n d=idif.count('woman')\r\n for i in range(b+d):\r\n if idif.count('child')>0 and idif.count('woman')>0:\r\n c=idif.index('child')\r\n n=idif.index('woman')\r\n if c<n:\r\n print(name[c])\r\n name.pop(c)\r\n idif.pop(c)\r\n else:\r\n print(name[n])\r\n name.pop(n)\r\n idif.pop(n)\r\n elif idif.count('child')>0:\r\n c=idif.index('child')\r\n print(name[c])\r\n name.pop(c)\r\n idif.pop(c)\r\n else:\r\n c=idif.index('woman')\r\n print(name[c])\r\n name.pop(c)\r\n idif.pop(c)\r\nif idif.count('man')>0:\r\n b=idif.count('man')\r\n for i in range(b):\r\n c=idif.index('man')\r\n print(name[c])\r\n name.pop(c)\r\n idif.pop(c)\r\nif idif.count('captain')>0:\r\n b=idif.count('captain')\r\n for i in range(b):\r\n c=idif.index('captain')\r\n print(name[c])\r\n name.pop(c)\r\n idif.pop(c)", "n = int(input())\r\np = []\r\nfor i in range(n):\r\n p.append(input())\r\nout = []\r\nnames = []\r\njobs = []\r\nfor i in range(n):\r\n person = p[i]\r\n j = 0\r\n s = ''\r\n while person[j] != \" \":\r\n s += person[j]\r\n j += 1\r\n names.append(s)\r\n t = ''\r\n for k in range(j+1,len(person)):\r\n t += person[k]\r\n jobs.append(t)\r\n#print(names)\r\n#print(jobs)\r\nfor i in range(n):\r\n if jobs[i] == \"rat\":\r\n out.append(names[i])\r\n\r\nfor i in range(n):\r\n if jobs[i] == \"woman\" or jobs[i] == \"child\":\r\n out.append(names[i])\r\nfor i in range(n):\r\n if jobs[i] == \"man\":\r\n out.append(names[i])\r\nfor i in range(n):\r\n if jobs[i] == \"captain\":\r\n out.append(names[i])\r\nfor i in range(n):\r\n print(out[i])\r\n \r\n\r\n \r\n", "n=int(input())\r\nl=[list(input().split()) for _ in range(n)]\r\nans=[]\r\nfor x,y in l:\r\n if y=='rat': ans+=[x]\r\nfor x,y in l:\r\n if y=='woman' or y=='child': ans+=[x]\r\nfor x,y in l:\r\n if y=='man': ans+=[x]\r\nfor x,y in l:\r\n if y=='captain': ans+=[x]; break\r\nprint('\\n'.join(ans))", "n=int(input())\r\nx=[]\r\nfor i in range(n):\r\n a,b=map(str,input().split())\r\n x.append([a,b])\r\nfor i in x:\r\n if i[1]==\"rat\":\r\n print(i[0])\r\nfor i in x:\r\n if i[1]==\"woman\" or i[1]==\"child\":\r\n print(i[0])\r\nfor i in x:\r\n if i[1]==\"man\":\r\n print(i[0])\r\nfor i in x:\r\n if i[1]==\"captain\":\r\n print(i[0])", "# import CppHeaderParser.CppHeaderParser as Parser\r\n\r\n# import CppHeaderParser.doc\r\n# import CppHeaderParser.examples.readSampleClass as ExampleClass\r\n\r\nn=int(input())\r\nrats=[]\r\nwc=[]\r\nman=[]\r\ncaptain=[]\r\nfor i in range(n):\r\n s=input().split()\r\n if s[1]==\"rat\":rats.append(s[0])\r\n elif s[1]==\"woman\":wc.append(s[0])\r\n elif s[1]==\"child\":wc.append(s[0])\r\n elif s[1]==\"man\":man.append(s[0])\r\n else: captain.append(s[0])\r\n\r\nfor x in rats:\r\n print(x)\r\n\r\n\r\nfor x in wc:\r\n print(x)\r\n\r\n\r\nfor x in man:\r\n print(x)\r\n\r\nfor x in captain:\r\n print(x)\r\n\r\n", "t = int(input())\r\ns= {}\r\nfor i in range(t):\r\n name, status = input().split()\r\n s[name] = status\r\nfor i in s:\r\n if s[i]==\"rat\":\r\n print(i)\r\nfor i in s:\r\n if s[i]==\"woman\" or s[i]=='child':\r\n print(i)\r\nfor i in s:\r\n if s[i]=='man':\r\n print(i)\r\nfor i in s:\r\n if s[i]=='captain':\r\n print(i)", "N = int(input())\r\n\r\nR = []\r\nC = []\r\nM = []\r\nK = []\r\n\r\nfor n in range(N):\r\n a, b = input().split()\r\n if b == 'rat':\r\n R += [a]\r\n elif b == 'child' or b == 'woman':\r\n C += [a]\r\n elif b == 'man':\r\n M += [a]\r\n else:\r\n K += [a]\r\n \r\nfor r in R:\r\n print(r)\r\nfor c in C:\r\n print(c)\r\nfor m in M:\r\n print(m)\r\nfor k in K:\r\n print(k) ", "n = int(input()) \r\nnames = []\r\nct = []\r\nfor i in range(n):\r\n name, s = input().split()\r\n names.append(name)\r\n ct.append(s)\r\nfor i in range(n):\r\n if ct[i] == \"rat\":\r\n print(names[i])\r\nfor i in range(n):\r\n if ct[i] == \"woman\" or ct[i] == \"child\":\r\n print(names[i])\r\nfor i in range(n):\r\n if ct[i] == \"man\":\r\n print(names[i])\r\n \r\n\r\nprint(names[ct.index(\"captain\")])\r\n# мой пример\r\n#7\r\n#капитан_джо captain \r\n#тётя_зина woman\r\n#дядя_ваня man\r\n#огурец child\r\n#утка woman\r\n#крыска_ириска rat\r\n#крыс_по_имени_борис rat\r\n\r\n\r\n\r\n", "t=int(input())\r\na1=[]\r\na2=[]\r\nfor i in range(t):\r\n a,b=input().split()\r\n a1.append(a)\r\n a2.append(b)\r\nfor i in range(t):\r\n if(a2[i]==\"rat\"):\r\n print(a1[i])\r\nfor i in range(t): \r\n if(a2[i]==\"woman\" or a2[i]==\"child\"):\r\n print(a1[i])\r\nfor i in range(t):\r\n if(a2[i]==\"man\"):\r\n print(a1[i])\r\nfor i in range(t):\r\n if(a2[i]==\"captain\"):\r\n print(a1[i])", "from collections import defaultdict\r\n\r\nn = int(input())\r\nhash_map = defaultdict(list)\r\nfor _ in range(n):\r\n s = input().split()\r\n if s[-1] == 'rat':\r\n hash_map[0].append(s[0])\r\n elif s[-1] == 'woman' or s[-1] == 'child':\r\n hash_map[1].append(s[0])\r\n elif s[-1] == 'man':\r\n hash_map[2].append(s[0])\r\n elif s[-1] == 'captain':\r\n hash_map[3].append(s[0])\r\n\r\nif 0 in hash_map:\r\n names = hash_map[0]\r\n for x in names:\r\n print(x)\r\n\r\nif 1 in hash_map:\r\n names = hash_map[1]\r\n for x in names:\r\n print(x)\r\nif 2 in hash_map:\r\n names = hash_map[2]\r\n for x in names:\r\n print(x)\r\nif 3 in hash_map:\r\n names = hash_map[3]\r\n for x in names:\r\n print(x)\r\n", "#!/bin/python3\r\n\r\nimport math\r\nimport os\r\nimport random\r\nimport re\r\nimport sys\r\n\r\nlis = []\r\nn = int(input())\r\nfor i in range(n):\r\n \r\n s = input()\r\n \r\n lis.append(s)\r\n\r\nans = []\r\nfor i in lis:\r\n for j in range(len(i)-1,-1,-1):\r\n if i[j] == ' ' and i[j+1] == 'r':\r\n ans.append(i)\r\nfor i in lis:\r\n for j in range(len(i)-1,-1,-1):\r\n if i[j] == ' ' and i[j+1] == 'w':\r\n ans.append(i)\r\n if i[j] == ' ' and i[j+1] == 'c' and i[j+2] == 'h':\r\n ans.append(i)\r\n# for i in lis:\r\n# for j in range(len(i)-1,-1,-1):\r\n# if i[j] == ' ' and i[j+1] == 'c' and i[j+2] == 'h':\r\n# ans.append(i)\r\n\r\nfor i in lis:\r\n for j in range(len(i)-1,-1,-1):\r\n if i[j] == ' ' and i[j+1] == 'm':\r\n ans.append(i)\r\n\r\nfor i in lis:\r\n for j in range(len(i)-1,-1,-1):\r\n if i[j] == ' ' and i[j+1] == 'c' and i[j+2] == 'a':\r\n ans.append(i)\r\nfor i in ans:\r\n for j in range(len(i)):\r\n if i[j] == ' ':\r\n i = i[:j]+i[len(i):]\r\n print(i)\r\n break\r\n", "q=int(input())\nr,wc,m,c=[],[],[],[]\nfor i in range(q):\n s,t=input().split()\n if t=='rat':\n r.append(s)\n if t=='woman' or t=='child':\n wc.append(s)\n if t=='man':\n m.append(s)\n if t=='captain':\n c.append(s)\nfor i in r:\n print(i)\nfor i in wc:\n print(i)\nfor i in m:\n print(i)\nfor i in c:\n print(i)\n \t\t\t\t\t\t \t \t\t\t \t \t \t \t \t\t\t", "#L2 HW2 \"Sinking Ship\"\r\n\r\nn = int(input())\r\n\r\nname=[]\r\nstatus=[]\r\nrat=[]\r\nwomenchild=[]\r\nman=[]\r\ncaptain=[]\r\n\r\nfor i in range(n):\r\n line = input().split()\r\n name.append(line[0])\r\n status.append(line[1])\r\n if status[i]=='rat':\r\n rat.append(name[i])\r\n elif status[i]=='woman' or status[i]=='child':\r\n womenchild.append(name[i])\r\n elif status[i]=='man':\r\n man.append(name[i])\r\n elif status[i]=='captain':\r\n captain.append(name[i])\r\n\r\nboard=rat+womenchild+man+captain\r\n\r\nfor i in range(n):\r\n print(board[i])\r\n", "n=int(input())\r\na=[]\r\nb=[]\r\nc=[]\r\nfor i in range(n):\r\n v,w=input().split()\r\n a.append(v)\r\n b.append(w)\r\nfor i in range(n):\r\n if b[i]=='rat':\r\n c.append(a[i])\r\nfor i in range(n):\r\n if b[i]=='woman' or b[i]=='child':\r\n c.append(a[i]) \r\nfor i in range(n):\r\n if b[i]=='man':\r\n c.append(a[i])\r\nfor i in range(n):\r\n if b[i]=='captain':\r\n c.append(a[i])\r\n break\r\nfor i in range(n):\r\n print(c[i])", "n=int(input())\r\nl1=[]\r\nfor i in range(n):\r\n l2=[]\r\n a,b=map(str,input().split())\r\n l2.append(a)\r\n l2.append(b)\r\n l1.append(l2)\r\nfor i in range(n):\r\n if l1[i][1]==\"rat\":\r\n print(l1[i][0])\r\nfor i in range(n):\r\n if l1[i][1]==\"woman\" or l1[i][1]==\"child\":\r\n print(l1[i][0])\r\nfor i in range(n):\r\n if l1[i][1]==\"man\":\r\n print(l1[i][0])\r\nfor i in range(n):\r\n if l1[i][1]==\"captain\":\r\n print(l1[i][0])", "a, b, c, d = [], [], [], []\r\nfor u in range(int(input())):\r\n s1, s2 = map(str, input().split())\r\n if s2 == \"rat\": a.append(s1)\r\n elif s2 in [\"child\", \"woman\"]: b.append(s1)\r\n elif s2 == \"man\": c.append(s1)\r\n else: d.append(s1)\r\nfor x in a: print(x)\r\nfor x in b: print(x)\r\nfor x in c: print(x)\r\nfor x in d: print(x)", "# bsdk idhar kya dekhne ko aaya hai, khud kr!!!\r\n# import math\r\n# from itertools import *\r\n# import random\r\n# import calendar\r\nimport datetime\r\n# import webbrowser\r\n\r\nn = int(input())\r\ncap = []\r\nwomen = []\r\nmen = []\r\nrat = []\r\nfor i in range(n):\r\n s = input().split(\" \")\r\n if s[-1] == \"captain\":\r\n cap.append(s[0])\r\n elif s[-1] == \"woman\" or s[-1] == \"child\":\r\n women.append(s[0])\r\n elif s[-1] == \"man\":\r\n men.append(s[0])\r\n elif s[-1] == \"rat\":\r\n rat.append(s[0])\r\nfor i in rat:\r\n print(i)\r\nfor i in women:\r\n print(i)\r\nfor i in men:\r\n print(i)\r\nfor i in cap:\r\n print(i)\r\n", "n = int(input())\r\ndict = {\r\n \"rat\" : [],\r\n \"both\" : [],\r\n \"man\" : [],\r\n \"captain\" : []\r\n}\r\n\r\nfor i in range(0, n):\r\n a,b = input().split()\r\n if b == \"woman\" or b == \"child\":\r\n b = \"both\"\r\n dict[b].append(a)\r\n \r\nfor i in dict[\"rat\"]:\r\n print(i)\r\nfor i in dict[\"both\"]:\r\n print(i)\r\nfor i in dict[\"man\"]:\r\n print(i)\r\nfor i in dict[\"captain\"]:\r\n print(i)", "n = int(input())\r\nrats = []\r\nwoman_children = []\r\nman = []\r\ncaptain = []\r\n\r\nfor _ in range(n):\r\n name, group = input().split()\r\n if group == 'rat':\r\n rats.append(name)\r\n elif group == 'woman' or group == 'child':\r\n woman_children.append(name)\r\n elif group == 'man':\r\n man.append(name)\r\n else:\r\n captain.append(name)\r\n\r\nfor e in rats:\r\n print(e)\r\n\r\nfor e in woman_children:\r\n print(e)\r\n\r\nfor e in man:\r\n print(e)\r\n\r\nfor e in captain:\r\n print(e)\r\n ", "n = int(input())\r\nCaptain = []\r\nwomen_children = []\r\nmen = []\r\nrats = []\r\nfor i in range(n):\r\n I = input().split()\r\n if I[1] == \"captain\":\r\n Captain.append(I[0])\r\n elif I[1] == \"woman\":\r\n women_children.append(I[0])\r\n elif I[1] == \"child\":\r\n women_children.append(I[0])\r\n elif I[1] == \"man\":\r\n men.append(I[0])\r\n elif I[1] == \"rat\":\r\n rats.append(I[0])\r\n\r\nfor i in rats:\r\n print(i)\r\nfor i in women_children:\r\n print(i)\r\nfor i in men:\r\n print(i)\r\nfor i in Captain:\r\n print(i)", "m1=[]\nw=[]\nc=0\nr=[]\nfor _ in range(int(input())):\n n,m=(input().split())\n if m==\"woman\" or m==\"child\":\n w.append(n)\n elif m==\"rat\":\n r.append(n)\n elif m==\"captain\":\n c=n\n elif m==\"man\":\n m1.append(n)\nfor i in r:\n print(i)\nfor i in w:\n print(i)\nfor i in m1:\n print(i)\nprint(c)\n \t\t\t \t \t \t\t\t \t\t\t \t", "c=[]\r\nr=[]\r\nwc=[]\r\nm=[]\r\nfor q in range(int(input())):\r\n i,j=map(str,input().split())\r\n if j ==\"rat\":\r\n r.append(i)\r\n elif j==\"woman\" or j==\"child\":\r\n wc.append(i)\r\n elif j ==\"man\":\r\n m.append(i)\r\n else:\r\n c.append(i)\r\nlst=r+wc+m+c\r\nfor n in lst:\r\n print(n)\r\n", "num = int(input())\r\nwomenchildren = []\r\nratlist = []\r\nmanlist = []\r\nnamelist = []\r\ncaptain = ''\r\nfor i in range(num):\r\n name, type = input().split()\r\n if type==\"rat\":\r\n ratlist.append(name)\r\n elif type ==\"woman\" or type == \"child\":\r\n womenchildren.append(name)\r\n elif type == \"man\":\r\n manlist.append(name)\r\n else:\r\n captain = name\r\n\r\nfor j in range(len(ratlist)):\r\n print(ratlist[j])\r\nfor k in range(len(womenchildren)):\r\n print(womenchildren[k])\r\nfor l in range(len(manlist)):\r\n print(manlist[l])\r\nprint(captain)", "\r\nprioridades = []\r\ntipos = []\r\n\r\nnombres = []\r\n\r\nn = int(input())\r\nfor i in range(n):\r\n nombre, tipo = input().split()\r\n prioridad = 5\r\n if tipo == 'rat':\r\n prioridad = 1\r\n elif tipo == 'woman' or tipo == 'child':\r\n prioridad = 2\r\n elif tipo == 'man':\r\n prioridad = 3\r\n else:\r\n prioridad = 4\r\n j = 0\r\n while j < len(prioridades):\r\n if prioridad < prioridades[j]:\r\n break\r\n j = j+1\r\n prioridades.insert(j, prioridad)\r\n nombres.insert(j, nombre)\r\n \r\nfor k in range(n):\r\n print(nombres[k])", "n = int(input())\r\nwomen_children = []\r\nmen = []\r\nrats = []\r\ncaptain = []\r\nfor i in range (n):\r\n name, status = map(str, input().split())\r\n if status == \"rat\":\r\n rats.append(name)\r\n elif status == \"man\":\r\n men.append(name)\r\n elif status == \"captain\":\r\n captain.append(name)\r\n else:\r\n women_children.append(name)\r\nresult = rats + women_children + men + captain\r\nfor j in range(n):\r\n print(result[j])\r\n", "n=int(input())\r\nl=[]\r\nfor i in range(n):\r\n l.append(list(map(str,input().split())))\r\nl1=[i[0] for i in l if i[1]=='rat']\r\nl2=[i[0] for i in l if i[1]=='child' or i[1]=='woman']\r\nl3=[i[0] for i in l if i[1]=='man']\r\nl4=[i[0] for i in l if i[1]=='captain']\r\nfor i in range(len(l1)):\r\n print(l1[i])\r\nfor i in range(len(l2)):\r\n print(l2[i])\r\nfor i in range(len(l3)):\r\n print(l3[i])\r\nprint(l4[0])\r\n", "n = int(input())\r\na = []\r\nfor i in range(n):\r\n a.append(input().split())\r\nans = []\r\nfor i in range(n):\r\n if a[i][1] == 'rat':\r\n ans.append(a[i][0])\r\nfor i in range(n):\r\n if a[i][1] == 'child' or a[i][1] == 'woman':\r\n ans.append(a[i][0])\r\nfor i in range(n):\r\n if a[i][1] == 'man':\r\n ans.append(a[i][0])\r\nfor i in range(n):\r\n if a[i][1] == 'captain':\r\n ans.append(a[i][0])\r\nprint(*ans, sep='\\n')", "def sinking_ship(a):\r\n rat=[]\r\n wom_and_child=[]\r\n man=[]\r\n captain=[]\r\n\r\n for i in range(len(a)):\r\n arr=a[i]\r\n if arr[1]=='rat':\r\n rat.append(arr[0])\r\n elif arr[1]=='woman' or arr[1]=='child':\r\n wom_and_child.append(arr[0])\r\n elif arr[1]=='man':\r\n man.append(arr[0])\r\n else:\r\n captain.append(arr[0])\r\n\r\n for i in rat:\r\n print(i)\r\n for i in wom_and_child:\r\n print(i)\r\n for i in man:\r\n print(i)\r\n for i in captain:\r\n print(i)\r\n\r\n\r\n\r\n\r\n\r\n\r\nn=int(input(''))\r\na=[]\r\nfor i in range(n):\r\n b=list(map(str,input('').split()))\r\n a.append(b)\r\n\r\nsinking_ship(a)\r\n", "n=int(input())\r\no=dict(zip('tminp',[0,1,1,2,3]))\r\na=sorted(enumerate([input().split()for _ in[0]*n]),key=lambda x:(o[x[1][1][2]],x[0]))\r\nfor x in a:print(x[1][0])\r\n", "n=int(input())\nc=[]\nw=[]\nm=[]\nr=[]\nfor i in range(1,n+1):\n a,b=input().split()\n if b=='rat':\n r.append(a)\n if b=='woman' or b=='child':\n w.append(a)\n if b=='man':\n m.append(a)\n if b=='captain':\n c.append(a)\nfor i in r:\n print(i)\nfor i in w:\n print(i)\nfor i in m:\n print(i)\nfor i in c:\n print(i)\n \n \t \t\t\t \t\t \t \t \t\t \t\t\t\t", "a=[]\r\nfor i in range (int(input())):\r\n\tx,y=map(str,input().split())\r\n\ta.append(x)\r\n\ta.append(y)\r\nfor j in range (1,len(a),2):\r\n\tif a[j]==\"rat\":\r\n\t\tprint(a[j-1])\r\nfor j in range (1,len(a),2):\r\n\tif a[j]==\"woman\" or a[j]==\"child\":\r\n\t\tprint(a[j-1])\r\nfor j in range (1,len(a),2):\r\n\tif a[j]==\"man\":\r\n\t\tprint(a[j-1])\r\nfor j in range (1,len(a),2):\r\n\tif a[j]==\"captain\":\r\n\t\tprint(a[j-1])\r\n\t\tbreak\r\n\t\t\t\t", "n = int(input())\r\nls = []\r\ntitle_order = {\"rat\": 0, \"woman\": 1, \"child\": 1, \"man\": 2, \"captain\": 3}\r\nfor i in range(n):\r\n name, title = input().split()\r\n ls.append((name, title_order[title]))\r\nls.sort(key=lambda x: x[1])\r\nfor i in range(n):\r\n print(ls[i][0])\r\n", "n = int(input())\n\norder = []\nppl = []\n\nfor i in range(n):\n s = input()\n ppl.append(s)\n\nfor i in ppl:\n s_type = i.split(\" \")[1]\n\n if s_type == 'rat':\n order.append(i.split(\" \")[0])\n\nfor i in ppl:\n s_type = i.split(\" \")[1]\n\n if s_type == 'woman' or s_type == 'child':\n order.append(i.split(\" \")[0])\n\n\nfor i in ppl:\n s_type = i.split(\" \")[1]\n\n if s_type == 'man':\n order.append(i.split(\" \")[0])\n\n\nfor i in ppl:\n s_type = i.split(\" \")[1]\n\n if s_type != 'man' and s_type != 'woman' and s_type != 'child' and s_type != 'rat':\n order.append(i.split(\" \")[0])\n\n\nfor i in order:\n print(i)\n\n\t \t \t \t\t\t\t\t\t \t \t\t\t \t\t\t\t", "n = int(input())\r\nrats = []\r\nwomen_child = []\r\nmen = []\r\ncap = []\r\n\r\nfor _ in range(n):\r\n s, stat = input().split()\r\n if stat == \"rat\":\r\n rats.append(s)\r\n elif stat == \"woman\" or stat == \"child\":\r\n women_child.append(s)\r\n elif stat == \"man\":\r\n men.append(s)\r\n else:\r\n cap = s\r\n\r\nfor i in rats:\r\n print(i)\r\n \r\nfor i in women_child:\r\n print(i)\r\n\r\nfor i in men:\r\n print(i)\r\n\r\nprint(cap)\r\n", "n=int(input())\r\nd=dict()\r\nwhile n:\r\n name,cat=input().split(\" \")\r\n #print(cat[0])\r\n if(cat==\"woman\" or cat==\"child\"):\r\n if(\"woman\" not in d.keys()):\r\n d[\"woman\"]=[]\r\n d[\"woman\"].append(name)\r\n else:\r\n if(cat not in d.keys()):\r\n d[cat]=[]\r\n d[cat].append(name)\r\n n-=1\r\nif(\"rat\" in d.keys()):\r\n for i in d[\"rat\"]:\r\n print(i)\r\nif(\"woman\" in d.keys()):\r\n for i in d[\"woman\"]:\r\n print(i)\r\nif(\"man\" in d.keys()):\r\n for i in d[\"man\"]:\r\n print(i)\r\nif(\"captain\" in d.keys()):\r\n for i in d[\"captain\"]:\r\n print(i)\r\n ", "n = int(input())\nrat = list()\nchild = list()\nman = list()\n\nfor i in range(n):\n nam,pos = map(str,input().split())\n if pos=='rat':\n rat.append(nam)\n \n elif pos=='woman' or pos=='child':\n child.append(nam)\n elif pos=='man':\n man.append(nam)\n else:\n cap = nam\nfor i in rat:\n print(i)\nfor i in child:\n print(i)\nfor i in man:\n print(i)\nprint(cap)\n\n\t\t\t \t\t \t\t \t\t \t \t\t\t \t", "n = int(input())\nname=[0]*n\nfunc = [0]*n\nrat = []\nwomchild = []\nmen = []\ncap = []\n\nfor i in range(n):\n name[i],func[i] = input().split(\" \")\n\nfor j in range(n):\n if func[j][0] == 'r':\n rat.append(name[j])\n elif func[j][0] == 'w' or func[j][1] == 'h':\n womchild.append(name[j])\n elif func[j][0] == 'm':\n men.append(name[j])\n elif func[j][0] == 'c':\n cap.append(name[j])\n\nfinal = rat+womchild+men+cap\nfor k in range(n):\n print(final[k])", "r,wc,m,cap = [],[],[],[]\r\nfor _ in range(int(input())):\r\n s,k = input().split()\r\n k.strip()\r\n\r\n if 'rat' in k:\r\n r.append(s)\r\n elif 'woman' in k or 'child' in k:\r\n wc.append(s)\r\n elif 'man' in k:\r\n m.append(s)\r\n elif 'captain' in k:\r\n cap.append(s)\r\n\r\nfor i in r:\r\n print(i)\r\nfor i in wc:\r\n print(i)\r\nfor i in m:\r\n print(i)\r\nfor i in cap:\r\n print(i)\r\n#print(r,wc,m,cap,sep = '\\n')", "t = int(input())\r\n\r\ndct = {}\r\n\r\nfor i in range(t):\r\n inp = input().split()\r\n dct[inp[0]] = inp[1]\r\n\r\nfor k in dct.keys():\r\n if(dct[k] == \"rat\"):\r\n print(k)\r\n\r\nfor k in dct.keys():\r\n if(dct[k] == \"woman\" or dct[k] == \"child\"):\r\n print(k)\r\n\r\nfor k in dct.keys():\r\n if(dct[k] == \"man\"):\r\n print(k)\r\n\r\nfor k in dct.keys():\r\n if(dct[k] == \"captain\"):\r\n print(k)", "n=int(input())\r\nl=[]\r\nfor i in range(n):\r\n l.append(input().split())\r\n\r\nfor i,j in l:\r\n if j=='rat':\r\n print(i)\r\n\r\nfor i,j in l:\r\n if j=='woman':\r\n print(i)\r\n if j=='child':\r\n print(i) \r\n\r\nfor i,j in l:\r\n if j=='man':\r\n print(i)\r\n\r\nfor i,j in l:\r\n if j=='captain':\r\n print(i)", "n = int(input())\r\nl1 = []\r\nl2 = []\r\nl3 = []\r\nl4 = []\r\n\r\nfor i in range(n):\r\n s = input().split()\r\n\r\n if s[1] == 'woman' or s[1] == 'child':\r\n l1.append(s[0])\r\n elif s[1] == 'man':\r\n l2.append(s[0])\r\n elif s[1] == 'captain':\r\n l3.append(s[0])\r\n else:\r\n l4.append(s[0])\r\nl5 = l4 + l1 + l2 + l3\r\n\r\nfor i in range(n):\r\n print(l5[i])", "from sys import stdin\n\nd={}\nfor _ in range(int(stdin.readline())):\n n,k=stdin.readline().split()\n if k=='woman' or k=='child': k='common'\n d[k]=d.get(k,\"\")+n+\"\\n\"\n\nprint(str(d.get('rat',\"\"))+str(d.get('common',\"\"))+str(d.get('man',\"\"))+str(d.get('captain',\"\")),end=\"\")\n\t \t\t \t\t \t \t\t \t \t \t\t\t\t \t\t", "a = []\r\nrat = []\r\nwmn = []\r\nman = []\r\ncap = []\r\nfor j in range(int(input())):\r\n s = input()\r\n a.append(s)\r\nfor j in a:\r\n s = j[j.find(' ')+1:len(j)]\r\n if(s == str(\"rat\")):\r\n rat.append(j)\r\n elif(s== \"woman\" or s== \"child\" ):\r\n wmn.append(j)\r\n elif(s == \"man\"):\r\n man.append(j)\r\n elif(s== \"captain\"):\r\n cap.append(j)\r\n else:\r\n continue\r\nlist1 = rat+wmn+man+cap\r\nfor j in list1:\r\n print(j[0:j.find(' ')])\r\n", "n=int(input())\r\nrat=[]\r\nwc=[]\r\nman=[]\r\ncap=[]\r\nfor i in range(n):\r\n s=input().split()\r\n if(s[1]==\"rat\"):\r\n rat.append(s[0])\r\n elif(s[1]==\"woman\" or s[1]==\"child\"):\r\n wc.append(s[0])\r\n elif(s[1]==\"man\"):\r\n man.append(s[0])\r\n else:\r\n cap.append(s[0])\r\nfor i in rat:\r\n print(i)\r\nfor i in wc:\r\n print(i)\r\nfor i in man:\r\n print(i)\r\nfor i in cap:\r\n print(i)", "t = int(input())\r\nanimals = []\r\nwomen_child = []\r\nmen = []\r\ncaptain = []\r\nfor i in range(t):\r\n name, categ = input().split()\r\n if categ == \"rat\":\r\n animals.append(name)\r\n elif categ == \"woman\" or categ == \"child\":\r\n women_child.append(name)\r\n elif categ == \"man\":\r\n men.append(name)\r\n elif categ == \"captain\":\r\n captain.append(name)\r\n\r\nk = animals + women_child + men + captain\r\nfor i in k:\r\n print(i)", "n = int(input())\r\nrat = []\r\nchildwoman = []\r\nman = []\r\ncaptain = []\r\nfor i in range(n):\r\n str = input()\r\n if str[-1:] == 't':\r\n rat.append(str[:-4])\r\n elif str[-1:] == 'd':\r\n childwoman.append(str[:-6])\r\n elif str[-5:] == 'woman':\r\n childwoman.append(str[:-6])\r\n elif str[-3:] == 'man':\r\n man.append(str[:-4])\r\n else:\r\n captain.append(str[:-8])\r\nfor i in rat:\r\n print(i)\r\nfor i in childwoman:\r\n print(i)\r\nfor i in man:\r\n print(i)\r\nfor i in captain:\r\n print(i)", "n = int(input())\r\n\r\nin_list = []\r\ncap = \"\"\r\n\r\nrats = []\r\nkd_w = []\r\nm = []\r\n\r\nfor i in range(n):\r\n curr = input()\r\n mark = curr.split(\" \")[1]\r\n name = curr.split(\" \")[0]\r\n if mark == \"rat\":\r\n rats.append(name)\r\n elif mark == \"woman\" or mark == \"child\":\r\n kd_w.append(name)\r\n elif mark == \"man\":\r\n m.append(name)\r\n else:\r\n cap = name\r\n\r\nfor i in rats:\r\n print(i)\r\n\r\nfor i in kd_w:\r\n print(i)\r\n\r\nfor i in m:\r\n print(i)\r\n\r\nprint(cap)\r\n", "n=int(input())\r\nd={}\r\nk=[]\r\nfor i in range(n):\r\n a,b=input().split()\r\n d[a]=b\r\n k.append(a)\r\nfor i in k:\r\n if d[i]=='rat':\r\n print(i)\r\nfor i in k:\r\n if d[i]=='woman' or d[i]=='child':\r\n print(i)\r\nfor i in k:\r\n if d[i]=='man':\r\n print(i)\r\nfor i in k:\r\n if d[i]=='captain':\r\n print(i)\r\n", "n = int(input())\r\npriority = []\r\n\r\nfor i in range(n):\r\n\r\n person = list(map(str, input().split()))\r\n\r\n if person[1] == \"rat\":\r\n priority.append(1)\r\n priority.append(person[0])\r\n elif person[1] == \"child\" or person[1] == \"woman\":\r\n priority.append(2)\r\n priority.append(person[0])\r\n elif person[1] == \"man\":\r\n priority.append(3)\r\n priority.append(person[0])\r\n elif person[1] == \"captain\":\r\n priority.append(4)\r\n priority.append(person[0])\r\nnew_priority = []\r\n\r\nfor i in range(len(priority)):\r\n if priority[i] == 1:\r\n new_priority.append(priority[i + 1])\r\nfor i in range(len(priority)):\r\n if priority[i] == 2:\r\n new_priority.append(priority[i + 1])\r\nfor i in range(len(priority)):\r\n if priority[i] == 3:\r\n new_priority.append(priority[i + 1])\r\nfor i in range(len(priority)):\r\n if priority[i] == 4:\r\n new_priority.append(priority[i + 1])\r\nfor i in new_priority:\r\n print(i)", "def main():\n n = int(input())\n people = dict()\n for _ in range(n):\n name, status = map(str, input().split())\n people.update({name: status})\n leave_sequence = sorted([(n, s) for n, s in people.items()], key=cmp, reverse=True)\n print('\\n'.join([i[0] for i in leave_sequence]))\n\ndef cmp(people):\n status = people[1]\n if status == 'rat':\n return 3\n elif status == 'woman' or status == 'child':\n return 2\n elif status == 'man':\n return 1\n else:\n return 0\n\nif __name__ == '__main__':\n main()\n", "# your code goes here\nn=int(input())\nl=[]\nfor i in range(n):\n\tx=input().split()\n\tc=[]\n\tfor j in range(2):\n\t\tc.append(x[j])\n\tl.append(c)\nfor i in range(n):\n\tif(l[i][1]=='rat'):\n\t\tprint(l[i][0])\nfor i in range(n):\n\tif(l[i][1]=='woman' or l[i][1]=='child'):\n\t\tprint(l[i][0])\nfor i in range(n):\n\tif(l[i][1]=='man'):\n\t\tprint(l[i][0])\nfor i in range(n):\n\tif(l[i][1]=='captain'):\n\t\tprint(l[i][0])\n \t \t\t \t \t\t\t \t \t \t\t\t\t", "def solve():\r\n n = int(input())\r\n a = []\r\n for i in range(n):\r\n d = input()\r\n a.append(d)\r\n z = []\r\n for i in range(4):\r\n if i == 0:\r\n for j in range(n):\r\n if a[j].endswith(\"rat\"):\r\n z.append(a[j].split()[0])\r\n elif i == 1:\r\n for j in range(n):\r\n if (a[j].endswith(\"child\") or a[j].endswith(\"woman\")):\r\n z.append(a[j].split()[0])\r\n elif i == 2:\r\n for j in range(n):\r\n if a[j].split()[1] == \"man\":\r\n z.append(a[j].split()[0])\r\n elif i == 3:\r\n for j in range(n):\r\n if a[j].endswith(\"captain\"):\r\n z.append(a[j].split()[0])\r\n for i in z:\r\n print(i)\r\n return\r\ntry:\r\n solve()\r\nexcept:\r\n pass", "import math\nfrom collections import defaultdict\nml=lambda:map(int,input().split())\nll=lambda:list(map(int,input().split()))\nii=lambda:int(input())\nip=lambda:list(input())\nips=lambda:input().split()\n\n\"\"\"========main code===============\"\"\"\n\nt=ii()\nw_c=[]\nmen=[]\nrats=[]\ncaptain=\"\"\nfor _ in range(t):\n a,b=ips()\n if(b=='woman' or b=='child'):\n w_c.append(a)\n elif(b=='captain'):\n captain=a\n elif(b=='man'):\n men.append(a)\n else:\n rats.append(a)\nfor i in rats:\n print(i)\nfor i in w_c:\n print(i)\nfor i in men:\n print(i)\nprint(captain) \n \t\t \t\t\t\t \t \t\t \t\t\t\t \t \t \t\t", "t=int(input())\r\ndi=dict()\r\nwhile t:\r\n p,s=input().split(\" \")\r\n if s==\"woman\" or s==\"child\":\r\n if \"woman\" not in di.keys():\r\n di[\"woman\"]=[]\r\n di[\"woman\"].append(p)\r\n else:\r\n if s not in di.keys():\r\n di[s]=[]\r\n di[s].append(p)\r\n t-=1\r\nif \"rat\" in di.keys():\r\n for i in di[\"rat\"]:\r\n print(i)\r\n\r\nif \"woman\" in di.keys():\r\n for i in di[\"woman\"]:\r\n print(i)\r\n \r\nif \"man\" in di.keys():\r\n for i in di[\"man\"]:\r\n print(i)\r\nif \"captain\" in di.keys():\r\n for i in di[\"captain\"]:\r\n print(i)", "data = []\r\nfor _ in range(int(input())):\r\n data.append(list(input().split()))\r\n\r\ndic = {'rat':0, 'woman':1, 'child':1, 'man':2, 'captain':3}\r\ndata.sort(key=lambda x:(dic[x[1]]))\r\n\r\nfor i in data:\r\n print(i[0])", "num=int(input())\nli=[]\nfor i in range(num):\n\ta=tuple(map(str,input().split()))\n\tli.append(a)\nd = {\"rat\":1,\"woman\":2,\"child\":2,\"man\":3,\"captain\":5}\nli.sort(key = lambda x:d[x[1]])\nfor i in li:\n\tprint(i[0])\n\t \t\t \t \t\t\t \t\t \t \t", "t=int(input())\r\nwc=[]\r\ncap=[]\r\nrats=[]\r\nman=[]\r\n\r\nfor i in range(t):\r\n name,desig=list(map(str,input().split()))\r\n if desig==\"woman\" or desig==\"child\":\r\n wc.append(name)\r\n elif desig==\"captain\":\r\n cap.append(name)\r\n elif desig==\"rat\":\r\n rats.append(name)\r\n elif desig==\"man\":\r\n man.append(name);\r\nrats+=wc+man+cap\r\nfor i in rats:\r\n print(i)\r\n\r\n \r\n", "n=int(input())\nls=[]\nfor i in range(n):\n\ta=tuple(map(str,input().split()))\n\tls.append(a)\nd = {\"rat\":1,\"woman\":2,\"child\":2,\"man\":3,\"captain\":5}\nls.sort(key = lambda x:d[x[1]])\nfor i in ls:\n\tprint(i[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\narr = []\r\nd = {\"rat\":1,\"woman\":2,\"child\":2,\"man\":3,\"captain\":5}\r\nfor i in range(n):\r\n arr.append(tuple(input().split()))\r\n\r\narr.sort(key = lambda x:d[x[1]])\r\nfor data in arr:\r\n print(data[0])", "rat,wom,men=[],[],[]\r\nfor _ in range(int(input())):\r\n\tk=input().strip().split()\r\n\tz=k[len(k)-1]\r\n\tif z=='captain':p=k[0]\r\n\telif z=='rat':rat.append(k[0])\r\n\telif z=='woman'or z=='child':wom.append(k[0])\r\n\telse:men.append(k[0])\r\nk=rat+wom+men+[p]\r\nfor x in k:print(x)", "sze = int(input())\r\ndiction = {}\r\nfor i in range(sze):\r\n line = input().split()\r\n tempKey = line[0]\r\n tempValue = line[1]\r\n diction[tempKey] = tempValue\r\n\r\nfor tempKey, tempValue in diction.items():\r\n if(tempValue == \"rat\"):\r\n print(tempKey)\r\nfor tempKey, tempValue in diction.items():\r\n if(tempValue == \"woman\"):\r\n print(tempKey)\r\n elif(tempValue == \"child\"):\r\n print(tempKey)\r\nfor tempKey, tempValue in diction.items():\r\n if(tempValue == \"man\"):\r\n print(tempKey)\r\nfor tempKey, tempValue in diction.items():\r\n if(tempValue == \"captain\"):\r\n print(tempKey)\r\n break\r\n ", "n = int(input())\r\ncaptain, rat, man, track = [], [], [], []\r\nc1, c2 = -1, -1\r\nfor t in range(n):\r\n s = input().split()\r\n if s[1] == 'captain':\r\n captain.append(s[0])\r\n if s[1] == 'rat':\r\n rat.append(s[0])\r\n if s[1] == 'man':\r\n man.append(s[0])\r\n if s[1] == 'child' or s[1] == 'woman':\r\n track.append(s[0])\r\nans = rat + track + man + captain\r\nfor i in ans:\r\n print(i)\r\n\r\n\r\n", "import sys\r\n\r\ndef input(): return sys.stdin.readline().strip()\r\ndef iinput(): return int(input())\r\ndef rinput(): return map(sys.stdin.readline().strip().split()) \r\ndef get_list(): return list(map(int, sys.stdin.readline().strip().split())) \r\n\r\n\r\nn=iinput()\r\nrat=[]\r\nwc=[]\r\nman=[]\r\ncaptain=[]\r\n\r\nfor i in range(n):\r\n a,b=input().split()\r\n if(b=='rat'):\r\n rat.append(a)\r\n elif(b=='woman' or b=='child'):\r\n wc.append(a)\r\n elif(b=='man'):\r\n man.append(a)\r\n elif(b=='captain'):\r\n captain.append(a)\r\n\r\nfor i in range(len(rat)):\r\n print(rat[i])\r\n\r\nfor i in range(len(wc)):\r\n print(wc[i])\r\n\r\nfor i in range(len(man)):\r\n print(man[i])\r\n\r\nfor i in range(len(captain)):\r\n print(captain[i])\r\n", "d={\r\n 'captain':4,\r\n 'man':3,\r\n 'woman':2,\r\n 'child':2,\r\n 'rat':1\r\n}\r\nr=[input().split() for _ in [0]*int(input())]\r\nfor i in r:i[1]=d[i[1]]\r\nr.sort(key=lambda x:x[1])\r\nfor i in r:print(i[0])", "#sinking\r\nl1 = []\r\nn = int(input())\r\nfor _ in range(n):\r\n l2 = []\r\n name, cato = input().split()\r\n l2.append(name)\r\n l2.append(cato)\r\n l1.append(l2)\r\nrat = []\r\nwc = []\r\nman = []\r\ncap = []\r\nfor i in range(n):\r\n if(l1[i][1] == \"rat\"):\r\n rat.append(l1[i][0])\r\n elif((l1[i][1] == \"woman\") or (l1[i][1] == \"child\")):\r\n wc.append(l1[i][0])\r\n elif(l1[i][1] == \"man\"):\r\n man.append(l1[i][0])\r\n elif(l1[i][1] == \"captain\"):\r\n cap.append(l1[i][0])\r\nfor i in rat:\r\n print(i)\r\nfor i in wc:\r\n print(i)\r\nfor i in man:\r\n print(i)\r\nfor i in cap:\r\n print(i)", "T=int(input())\nr=[]\nwc=[]\nm=[]\nc=[]\nfor i in range(T):\n N,P=map(str,input().split())\n if(P==\"rat\"):\n r.append(N)\n elif(P==\"woman\" or P==\"child\"):\n wc.append(N)\n elif(P==\"man\"):\n m.append(N)\n elif(P==\"captain\"):\n c.append(N)\n if(i==T-1):\n #print(r,wc,m,c)\n for i in r:\n print(i)\n for j in wc:\n print(j)\n for k in m:\n print(k)\n for l in c:\n print(l)\n \n \t \t\t\t\t\t \t\t\t\t\t \t\t \t\t", "n=int(input())\r\nm=[]\r\nr=[]\r\nwc=[]\r\nc=[]\r\nfor i in range(n):\r\n x=input()\r\n l=list(x.split())\r\n if l[1]==\"man\":\r\n m.append(l[0])\r\n elif l[1]==\"captain\":\r\n c.append(l[0])\r\n elif l[1]==\"rat\":\r\n r.append(l[0])\r\n else:\r\n wc.append(l[0])\r\nif r!=[]:\r\n for i in r:\r\n print(i)\r\nif wc!=[]:\r\n for i in wc:\r\n print(i)\r\nif m!=[]:\r\n for i in m:\r\n print(i)\r\nif c!=[]:\r\n for i in c:\r\n print(i)\r\n", "t=int(input())\nc=0\nr=[]\nw=[]\nm=[]\nfor i in range(t):\n\tn,p=map(str,input().split())\n\tif(p=='captain'):\n\t\tc=n\n\telif(p=='woman' or p=='child'):\n\t\tw.append(n)\n\telif(p=='man'):\n\t\tm.append(n)\n\telif(p=='rat'):\n\t\tr.append(n)\nfor i in r:\n\tprint(i)\nfor i in w:\n\tprint(i)\nfor i in m:\n\tprint(i)\nprint(c)\n\t \t\t\t \t \t \t \t \t\t\t\t\t\t", "n=int(input())\na=[]\nb=[]\nc=[]\nd=[]\nr=0\nw=0\nm=0\ng=0\nfor i in range(n):\n\tx,y=input().split()\n\tif y=='rat':\n\t\ta.append(x)\n\t\tr+=1\n\telif y=='woman' or y=='child':\n\t\tb.append(x)\n\t\tw+=1\n\telif y=='man':\n\t\tc.append(x)\n\t\tm+=1\n\telif y=='captain':\n\t\td.append(x)\n\t\tg+=1\n\t\t\nfor i in range(r):\n\tprint(a[i])\nfor i in range(w):\n\tprint(b[i])\nfor i in range(m):\n\tprint(c[i])\nfor i in range(g):\n\tprint(d[i])\t\n\t\t \t\t \t \t \t \t \t\t\t\t \t", "n = int(input())\r\nx=list()\r\nx1=list()\r\nfor i in range(n):\r\n s = input().split()\r\n x.append(s)\r\nfor i in range(n):\r\n if x[i][1]==\"rat\":\r\n x1.append(x[i][0])\r\nfor i in range(n):\r\n if x[i][1]==\"woman\" or x[i][1]=='child':\r\n x1.append(x[i][0])\r\nfor i in range(n):\r\n if x[i][1]==\"man\":\r\n x1.append(x[i][0])\r\nfor i in range(n):\r\n if x[i][1]=='captain':\r\n x1.append(x[i][0])\r\nfor i in x1:\r\n print(i)", "n = int(input())\nrats, men, captain = [], [], []\nchildren_women = []\nfor i in range(n):\n x = input()\n if x.count(' rat') != 0:\n rats.append(x[:x.index('rat') - 1])\n elif x.count(' child') != 0:\n children_women.append(x[:x.index('child') - 1])\n elif x.count(' woman') != 0:\n children_women.append(x[:x.index('woman') - 1])\n elif x.count(' man') != 0:\n men.append(x[:x.index('man') - 1])\n elif x.count(' captain') != 0:\n captain.append(x[:x.index('captain') - 1])\nprint(*(rats + children_women + men + captain), sep='\\n')\n", "def sinkingship(alist):\r\n rat,womanchild,man,captain=[],[],[],[]\r\n # rat woman & child man captain\r\n for i in alist:\r\n if i[1]==\"rat\":\r\n rat.append(i[0])\r\n if i[1]==\"woman\" or i[1]==\"child\":\r\n womanchild.append(i[0])\r\n if i[1]==\"man\" :\r\n man.append(i[0])\r\n\r\n if i[1]==\"captain\" :\r\n captain.append(i[0]) \r\n totallist=rat+womanchild+man+captain\r\n #print(totallist)\r\n for i in totallist:\r\n print(i) \r\n\r\n\r\nn=int(input())\r\nalist=[]\r\nfor i in range(n):\r\n name=list(map(str,input().split()))\r\n alist.append(name)\r\n\r\nsinkingship(alist)", "r, wc, m, c = [], [], [], []\r\nfor _ in range(int(input())):\r\n a, b = input().split()\r\n if b == \"rat\": r.append(a)\r\n elif b == \"captain\": c.append(a)\r\n elif b == \"man\": m.append(a)\r\n else: wc.append(a)\r\nfor L in [r, wc, m, c]:\r\n if len(L) > 0:\r\n print(\"\\n\".join(L))", "n = int(input())\nl = []\nfor i in range(n):\n\tl.append(input().split() + [i])\nl.sort(key = lambda a: (4 if a[1] == 'captain' else 3 if a[1] == 'man' else 2 if a[1] == 'child' or a[1] == 'woman' else 1) * 100 + a[2])\nfor a, b, c in l:\n\tprint(a)\n", "n = int(input())\n\narr = []\nfor _ in range(n):\n name, role = input().split()\n arr.append((name, role))\n\nfor i in range(n):\n if arr[i][1] == 'rat':\n print(arr[i][0])\n\nfor i in range(n):\n if arr[i][1] == 'woman' or arr[i][1] == 'child':\n print(arr[i][0])\n\nfor i in range(n):\n if arr[i][1] == 'man':\n print(arr[i][0])\n\nfor i in range(n):\n if arr[i][1] == 'captain':\n print(arr[i][0])\n", "member = {'rat':[],'k':[],'man':[],'captain':[]}\r\nfor i in range(int(input())):\r\n a = list(input().split())\r\n if a[1]=='woman' or a[1]=='child':\r\n a[1] = 'k'\r\n member[a[1]].append(a[0])\r\nfor i in member:\r\n for j in member[i]:\r\n print(j)", "n = int(input())\narr = [input().split() for i in range(n)]\n \nfor i in [['rat'], ['woman', 'child'], ['man'], ['captain']]:\n for j in arr:\n if j[1] in i:\n print(j[0])\n\t \t\t \t \t\t\t\t \t \t\t \t\t \t \t\t", "if __name__ == '__main__':\r\n n = int(input())\r\n line0 = list()\r\n line1 = list()\r\n line2 = list()\r\n line3 = list()\r\n for i in range(n):\r\n name, status = str(input()).split()\r\n if status in ['rat']:\r\n line0.append(name)\r\n elif status in ['woman', 'child']:\r\n line1.append(name)\r\n elif status in ['man']:\r\n line2.append(name)\r\n elif status in ['captain']:\r\n line3.append(name)\r\n for it in line0 + line1 + line2 + line3:\r\n print(it)\r\n", "d={}\nfor _ in range(int(input())):\n\ta,b=input().split()\n\tif b=='child':\n\t\tb='woman'\n\tif b not in d:\n\t\td[b]=[a]\n\telse:\n\t\td[b].append(a)\nif 'rat' in d:\n\tprint(*d['rat'],sep='\\n')\nif 'woman' in d:\n\tprint(*d['woman'],sep='\\n')\nif 'man' in d:\n\tprint(*d['man'],sep='\\n')\nif 'captain' in d:\n\tprint(*d['captain'],sep='\\n')\n \t \t\t\t\t \t\t \t\t\t\t\t\t \t\t\t", "\r\nn = int(input())\r\nl = [[] for _ in range(4)]\r\nfor _ in range(n):\r\n\tname, code = input().split()\r\n\tif code == 'rat':\r\n\t\tl[0].append(name)\r\n\telif code == 'woman' or code == 'child':\r\n\t\tl[1].append(name)\r\n\telif code == 'man':\r\n\t\tl[2].append(name)\r\n\telse:\r\n\t\tl[3].append(name)\r\n\r\nfor i in l:\r\n\tfor j in i:\r\n\t\tprint(j)", "t=int(input())\nl1=[]\nl2=[]\nl3=[]\nl4=[]\nwhile(t>0):\n s=input()\n l=list(s.split(\" \"))\n if(l[1]==\"rat\"):\n l1.append(l[0])\n elif(l[1]==\"child\" or l[1]==\"woman\"):\n l2.append(l[0])\n elif(l[1]==\"man\"):\n l3.append(l[0])\n elif(l[1]==\"captain\"):\n l4.append(l[0])\n t=t-1\nfor i in range(0,len(l1)):\n print(l1[i])\nfor i in range(0,len(l2)):\n print(l2[i])\nfor i in range(0,len(l3)):\n print(l3[i])\nfor i in range(0,len(l4)):\n print(l4[i])\n\t \t \t \t \t \t\t \t\t\t \t \t \t", "n=int(input())\r\nl=[]\r\nfor i in range(n):\r\n ladd=list(map(str,input().split()))[:2]\r\n if ladd[1]=='rat':\r\n ladd.append(0)\r\n elif ladd[1]=='woman' or ladd[1]=='child':\r\n ladd.append(1)\r\n elif ladd[1]=='man':\r\n ladd.append(2)\r\n elif ladd[1]=='captain':\r\n ladd.append(3)\r\n l.append(ladd)\r\nfor i in range(4):\r\n for j in l:\r\n if j[2]==i:\r\n print(j[0])", "ratt=[]\nwochi=[]\nmann=[]\ncapi=[]\nfor _ in range(int(input())):\n name,id=input().split()\n if id=='rat':\n ratt.append(name)\n elif id=='woman' or id=='child':\n wochi.append(name)\n elif id=='man':\n mann.append(name)\n elif id==\"captain\":\n capi.append(name)\nfor i in ratt:\n print(i)\nfor i in wochi:\n print(i)\nfor i in mann:\n print(i)\nfor i in capi:\n print(i)\n \n \t \t\t\t \t\t \t \t\t\t \t\t\t \t\t \t", "# your code goes here\nt=int(input())\nn={}\np={}\nd=[]\nfor i in range(t):\n\tx,y=input().split()\n\tn[i]=x\n\tp[n[i]]=y\nfor i in range(t):\n\tif p[n[i]]=='rat':\n\t\tprint(n[i])\nfor i in range(t):\n\tif p[n[i]]=='woman' or p[n[i]]=='child':\n\t\tprint(n[i])\nfor i in range(t):\n\tif p[n[i]]=='man':\n\t\tprint(n[i])\nfor i in range(t):\n\tif p[n[i]]=='captain':\n\t\tprint(n[i])\n\t\tbreak\n\t \t\t \t\t\t \t\t \t\t\t\t \t\t\t\t", "a=[]\r\nfor _ in range(int(input())):\r\n x,y=map(str,input().split())\r\n if y==\"rat\":\r\n y=0\r\n else:\r\n if y==\"man\":\r\n y=2\r\n else:\r\n if y==\"captain\":\r\n y=3\r\n else:\r\n y=1\r\n a.append([x,y])\r\na.sort(key=lambda x:x[1])\r\na=[i[0] for i in a]\r\nprint(*a,sep=\"\\n\")", "rank = {'rat': 0,\r\n 'woman': 1,\r\n 'child': 1,\r\n 'man': 2,\r\n 'captain': 3}\r\nlist_name = list()\r\nn = int(input())\r\ndaf = list()\r\n\r\nfor i in range(n):\r\n name, job = map(str, input().split())\r\n list_name.append(name)\r\n job = rank[job]\r\n daf.append((job, i))\r\n\r\ndaf.sort()\r\n\r\nfor i in range(n):\r\n print(list_name[daf[i][1]])\r\n", "a = []\r\ncategories = {\"rat\": 1, \"child\": 2, \"woman\": 2, \"man\": 3, \"captain\": 4}\r\n\r\nfor _ in range(int(input())):\r\n member = input().split()\r\n id = categories[member[1]]\r\n a.append((id, member[0]))\r\n\r\n\r\na = sorted(a, key=lambda x: x[0])\r\nfor i in a:\r\n print(i[1])", "t=[]\r\n\r\n\r\n\r\n\r\nra=[]\r\n\r\nwc=[]\r\n\r\nman=[]\r\n\r\ncap=[]\r\n\r\nfor i in range(int(input())):\r\n a=input().split()\r\n\r\n t.append(a)\r\n\r\n if a[-1]=='rat':\r\n ra.append(a[0])\r\n elif a[-1]=='child' or a[-1]=='woman':\r\n wc.append(a[0])\r\n elif a[-1]=='man':\r\n man.append(a[0])\r\n else:\r\n cap.append(a[0])\r\n\r\nif len(ra)==0:\r\n for k in (wc+man+cap):\r\n print(k)\r\nelse:\r\n for j in (ra+wc+man+cap):\r\n print(j)\r\n", "t=int(input())\r\nr=[]\r\nwc=[]\r\nm=[]\r\nc=[]\r\nfor i in range(t):\r\n x=list(map(str,input().split()))\r\n if x[1]=='rat':\r\n r.append(x[0])\r\n elif x[1]=='woman' or x[1]=='child':\r\n wc.append(x[0])\r\n elif x[1]=='man':\r\n m.append(x[0])\r\n else:\r\n c.append(x[0])\r\nl=[]\r\nl.extend(r)\r\nl.extend(wc)\r\nl.extend(m)\r\nl.extend(c)\r\nfor i in l:\r\n print(i)", "'''input\n1\nA captain\n'''\nn = int(input())\nc, r, w, m = \"\", [], [], []\nfor _ in range(n):\n\tx, y = input().split()\n\tif y == \"captain\":\n\t\tc = x\n\telif y == \"rat\":\n\t\tr.append(x)\n\telif y in [\"child\", \"woman\"]:\n\t\tw.append(x)\n\telse:\n\t\tm.append(x)\nfor p in [r, w, m]:\n\tif p:\n\t\tprint(\"\\n\".join(p))\nprint(c)\n\n\n\n\n\n\n\n\n\n\n", "a = []\r\nd = {'rat': 1, 'woman': 2, 'child': 2, 'man': 3, 'captain': 4}\r\n\r\nfor _ in range(int(input())):\r\n name, rank = input().split()\r\n a.append((name, rank))\r\n\r\nl = sorted(a, key=lambda x: d[x[1]])\r\nfor i in l:\r\n print(i[0])" ]

[ "s=input()\r\nl=['H','Q','9']\r\nflag=0\r\nfor i in l:\r\n if i in s:\r\n flag=1\r\nif flag:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a=input()\r\nc=[]\r\nfor i in a:\r\n if i==\"H\":\r\n c.append(\"yes\")\r\n \r\n elif i==\"Q\":\r\n c.append(\"yes\")\r\n \r\n elif i==\"+\":\r\n c.append(\"no\")\r\n \r\n elif i==\"9\":\r\n c.append(\"yes\")\r\n \r\n else:\r\n c.append(\"no\")\r\nif \"yes\" in c:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "x=str(input())\r\nif \"H\" in x or \"Q\" in x or \"9\" in x:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "code = input()\r\n\r\nanswer = False\r\nfor i in range(len(code)):\r\n if code[i] == \"H\" or code[i] == \"9\" or code[i] == \"Q\":\r\n answer = True\r\n break\r\nif answer == True:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n", "import sys\r\nimport math\r\nimport statistics\r\nimport operator\r\ninput = lambda :sys.stdin.readline().rstrip()\r\noutput =lambda:sys.stdout()\r\n\r\ndef isPrime(n):\r\n for i in range(2,int(n**0.5)+1):\r\n if n%i==0:\r\n return False\r\n return True\r\n\r\nfArray=[0,1]\r\ndef fibonacci(n):\r\n if n<=len(fArray):\r\n return fArray[n-1]\r\n else:\r\n temp = fibonacci(n-1)+fibonacci(n-2)\r\n fArray.append(temp)\r\n return temp\r\n\r\ndef isInt(n):\r\n if (n*10)%10==0:\r\n return True\r\n else:\r\n return False\r\n\r\ndef find_gcd(x, y):\r\n while(y):\r\n x, y = y, x % y\r\n return x\r\n\r\ndef gcd(l):\r\n num1=l[0]\r\n num2=l[1]\r\n gcd=find_gcd(num1,num2)\r\n for i in range(2,len(l)):\r\n gcd=find_gcd(gcd,l[i])\r\n return gcd\r\n\r\n \r\n\r\n# for _ in range(int(input())):\r\nn=input()\r\nif \"H\" in n:\r\n print(\"YES\")\r\nelif 'Q' in n:\r\n print(\"YES\")\r\nelif '9' in n:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "str = input()\r\nflag = False\r\n\r\nfor c in str:\r\n if ord(c) >= 33 and ord(c) <= 126:\r\n if c == 'H' or c == 'Q' or c == '9':\r\n flag = True\r\n break\r\n\r\nif flag:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "str_input = input()\r\nflag = False\r\n\r\nfor char in str_input:\r\n if 33 <= ord(char) <= 126:\r\n if char in ['H', 'Q', '9']:\r\n flag = True\r\n break\r\n\r\nif flag:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "t=input()\r\nm=[\"H\",\"Q\",\"9\"]\r\nfor j in m:\r\n\tif j in t:\r\n\t\tprint(\"YES\")\r\n\t\tbreak\r\nelse:print(\"NO\")", "new_str = input()\r\nif new_str.find('H') > -1 or new_str.find('Q') > -1 or new_str.find('9') > -1:\r\n print('YES')\r\nelse:\r\n print('NO')", "j=list(input())\r\nmp=0\r\nfor h in j:\r\n if h=='H' or h=='Q' or h=='9':\r\n mp=1\r\n break\r\nif mp==1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "st=input()\nif('H' in st or 'Q' in st or '9' in st):\n print(\"YES\")\nelse:\n print(\"NO\")\n \t\t \t\t \t\t \t\t \t \t \t\t \t", "m=list(input())\r\ntemp=0\r\nfor sv in m:\r\n if sv=='H' or sv=='Q' or sv=='9':\r\n temp=1\r\n break\r\nif temp==1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s = input()\r\nflag = False\r\n\r\nfor c in s:\r\n if c == 'H' or c == 'Q' or c == '9':\r\n flag = True\r\n break\r\n\r\nif flag:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "def execute_hq9_plus(program):\r\n for char in program:\r\n if char == 'H' or char == 'Q' or char == '9':\r\n return \"YES\"\r\n return \"NO\"\r\n\r\nprogram = input()\r\n\r\nresult = execute_hq9_plus(program)\r\nprint(result)\r\n", "i=input()\nprint(\"YES\" if any([x in i for x in ['H','Q','9']]) else \"NO\")\n", "s = input()\r\nl = ['H', 'Q', '9']\r\nflag = False\r\nfor c in s:\r\n if c in l:\r\n flag = True\r\nif flag:\r\n print('YES')\r\nelse:\r\n print('NO')", "\r\ns = input()\r\nl = ['H', 'Q', '9']\r\nfor i in s:\r\n if i in l:\r\n print('YES')\r\n break\r\nelse:\r\n print('NO')", "p = input()\r\n\r\n# Проверяем, содержит ли строка 'H', 'Q' или '9'\r\nif 'H' in p or 'Q' in p or '9' in p:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "program = input()\r\n\r\n# Check if the program contains any instruction that produces output\r\nif 'H' in program or 'Q' in program or '9' in program:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s = input()\r\nst = 'HQ9'\r\ncount = 0\r\nfor i in s:\r\n if (i in st):\r\n count += 1\r\nif (count > 0):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "value = input()\r\nif value.count(\"H\") > 0 or value.count(\"Q\") > 0 or value.count(\"9\") > 0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "program = input()\r\n\r\nif \"H\" in program or \"Q\" in program or \"9\" in program:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n = input()\r\nHQ = [\"H\",\"Q\",\"9\"]\r\nret = \"NO\"\r\nfor letter in n:\r\n if letter in HQ:\r\n ret = \"YES\"\r\n break\r\nprint(ret)\r\n", "a = input()\r\nb = ['H','Q','9']\r\nm = 'NO'\r\nfor i in a:\r\n if (i in b):\r\n m = 'YES'\r\nprint(m)", "s=input(\"\")\r\nflag=0\r\nif 'H' in s or 'Q' in s or '9' in s:\r\n flag=flag+1\r\nelse:\r\n flag=flag\r\n\r\nif flag>0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "P=input()\r\nAns=False\r\nfor i in P:\r\n if i=='H' or i=='Q' or i=='9':\r\n Ans=True\r\n break\r\nif Ans:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a=input()\r\nj=0\r\nfor i in range(len(a)):\r\n\tif a[i]=='H' or a[i]=='Q' or a[i]=='9':\r\n\t\tj=1\r\nif j==1:\r\n\tprint (\"YES\")\r\nelse :\r\n\tprint (\"NO\")", "p = input()\r\nif \"9\" in p:\r\n print(\"YES\")\r\nelse:\r\n if \"H\" in p:\r\n print(\"YES\")\r\n else:\r\n if \"Q\" in p:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "p = input()\r\nhas_output = False\r\nfor char in p:\r\n if char == \"H\" or char == \"Q\" or char == \"9\":\r\n has_output = True\r\n break \r\nif has_output:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "input_string = input()\r\nif any(character in input_string for character in \"HQ9\"):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "command = input()\r\nif('H' in command or 'Q' in command or '9' in command):print('YES')\r\nelse:print('NO')", "#https://codeforces.com/problemset/problem/133/A\r\n\r\ndef get_restrictionList():\r\n restrictionList = [\"H\", \"Q\", \"9\"]\r\n return restrictionList\r\n\r\ninput_text = input()\r\nanswer = \"NO\"\r\nfor letter in input_text:\r\n if(letter in get_restrictionList()):\r\n answer = \"YES\"\r\n break\r\nprint(answer)\r\n", "s = input()\r\nan = ['H','Q','9']\r\nfor i in an:\r\n if i in s:\r\n print('YES')\r\n break\r\nelse:\r\n print('NO')\r\n", "word = input()\r\nflag = 0\r\nfor i in range(len(word)):\r\n if word[i] == 'H' or word[i] == 'Q' or word[i] == '9':\r\n flag = 1\r\n break\r\nif flag:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s = input()\r\nm = 0\r\nfor x in s:\r\n if x == 'H' or x == 'Q' or x == '9':\r\n m = 1\r\n break\r\nif m==1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "from sys import stdin\r\n\r\ns = list(str(i) for i in stdin.readline().rstrip())\r\n\r\nif s.count('H') or s.count('Q') or s.count('9'):\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "s=input()\r\nif(s.find('H')!=-1 or s.find('Q')!=-1 or s.find('9')!=-1):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "def output(program):\r\n for char in program:\r\n if char in \"HQ9\":\r\n return \"YES\"\r\n return \"NO\"\r\n\r\n\r\nprogram = input()\r\n\r\n\r\nprint(output(program))\r\n", "def has_output(program):\r\n for char in program:\r\n if char in \"HQ9\":\r\n return \"YES\"\r\n return \"NO\"\r\nprogram = input()\r\nresult = has_output(program)\r\nprint(result)", "# Решение задач проекта CODEFORSES, Задача 133A\r\n#\r\n# (C) 2023 Артур Ще, Москва, Россия\r\n# Released under GNU Public License (GPL)\r\n# email [email protected]\r\n# -----------------------------------------------------------\r\n\r\n'''\r\nA. HQ9+\r\nограничение по времени на тест2 seconds\r\nограничение по памяти на тест256 megabytes\r\nвводстандартный ввод\r\nвыводстандартный вывод\r\nHQ9+ — шуточный язык программирования, состоящий всего из четырех односимвольных команд:\r\n\r\n«H» печатает «Hello, World!»,\r\n«Q» печатает исходный код самой программы,\r\n«9» печатает текст песни «99 бутылок пива»,\r\n«+» увеличивает на единицу значение внутреннего счетчика.\r\nКоманды «H» и «Q» воспринимаются только в верхнем регистре. Все символы программы, не являющиеся командами, игнорируются.\r\n\r\nВам дана программа на HQ9+. Определите, будет ли что-то напечатано в результате ее выполнения.\r\n\r\nВходные данные\r\nВ единственной строке входных данных задана строка p — программа на языке HQ9+. Строка p содержит от 1 до 100 символов, включительно. ASCII-код каждого символа будет от 33 (восклицательный знак) до 126 (тильда), включительно.\r\n\r\nВыходные данные\r\nВыведите «YES», если в результате выполнения программы будет напечатано какое-то сообщение, и «NO» в противном случае.\r\n'''\r\n\r\nfrom datetime import datetime\r\nimport time\r\nstart_time = datetime.now()\r\nimport functools\r\nfrom itertools import *\r\nfrom collections import Counter\r\nimport random\r\nimport math\r\n\r\na1=input()\r\ns=['H','Q','9']\r\nfor item in a1:\r\n if item in s:\r\n print('YES')\r\n break\r\nelse: print('NO')", "\r\na = input()\r\n\r\n\r\nc = 0\r\n\r\n\r\nfor i in a:\r\n\r\n if i == 'H' or i == 'Q' or i == '9':\r\n \r\n c += 1\r\n\r\n\r\nif c > 0:\r\n \r\n print(\"YES\")\r\nelse:\r\n \r\n print(\"NO\")\r\n", "n=input()\r\nc=0\r\nfor i in range(len(n)):\r\n if n[i]=='H' or n[i]=='Q' or n[i]=='9':\r\n c+=1\r\nif c!=0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def will_produce_output(program):\r\n for char in program:\r\n if char in \"HQ9\":\r\n return \"YES\"\r\n return \"NO\"\r\n\r\n# Read the input program\r\nprogram = input().strip()\r\n\r\n# Check if the program will produce any output\r\noutput = will_produce_output(program)\r\nprint(output)\r\n", "s = input()\r\nc = 0\r\nd = 0\r\nfor i in s:\r\n if i in \"HQ9\":\r\n c+=1\r\n else:\r\n d+=1\r\nif c>=1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def has_output(N):\r\n for char in N:\r\n if char in \"HQ9\":\r\n return True\r\n return False\r\n\r\n\r\nN = input()\r\n\r\n\r\nif has_output(N):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "code = input()\r\nif \"H\" in code or \"Q\" in code or \"9\" in code:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "# n = int(input())\r\nn = input()\r\nout= False\r\nfor char in n:\r\n if char =='H' or char ==\"Q\" or char =='9':\r\n out = True\r\n break\r\nif out:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "p = list(input())\r\ntruth = False\r\nfor i in range(len(p)):\r\n if p[i] == \"H\" or p[i] == \"Q\" or p[i] == \"9\":\r\n print(\"YES\")\r\n truth = True\r\n break\r\nif truth == False:\r\n print(\"NO\")\r\n", "def is_output_produced(program):\r\n for instruction in program:\r\n if instruction in ['H', 'Q', '9']:\r\n return \"YES\"\r\n return \"NO\"\r\n\r\nprogram = input()\r\n\r\nresult = is_output_produced(program)\r\n\r\n\r\nprint(result)\r\n", "word = input()\nanswer = \"YES\" if 'H' in word or 'Q' in word or '9' in word else \"NO\" \nprint(answer)", "testcases=1\n\nfor t in range (testcases):\n\tstring=input()\n\tx=string.find(\"H\")\n\ty=string.find(\"Q\")\n\tz=string.find(\"9\")\n\tif x!=-1 or y!=-1 or z!=-1:\n\t\tprint(\"YES\")\n\telse:\n\t\tprint(\"NO\")\n\n\t\n", "def check(n) :\r\n for i in range(len(n)) :\r\n if n[i] == 'Q' or n[i] == 'H' or n[i] == '9' :\r\n return True\r\n return False\r\nn = input()\r\nif check(n) :\r\n print(\"YES\")\r\nelse :\r\n print(\"NO\")", "string = input()\r\n\r\ndont_print = True\r\nfor x in string:\r\n\tif x == 'H' or x == 'Q' or x == '9':\r\n\t\tprint('YES')\r\n\t\tdont_print = False\r\n\t\tbreak\r\nif dont_print:\r\n\tprint('NO')\r\n", "s=input()\r\nflag=0\r\nfor i in s:\r\n if i in [\"H\",\"Q\",\"9\"]:\r\n flag=1\r\n break\r\n else:\r\n flag=0\r\nif flag==1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n=str(input())\r\ncounter=0\r\nfor i in range(len(n)):\r\n if n[i]==\"H\" or n[i]==\"Q\" or n[i]==\"9\":\r\n counter=counter+1\r\nif counter>=1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a=input()\r\nif (a.find('H'))>=0:\r\n print(\"YES\")\r\n exit()\r\nelif a.find('Q')>=0:\r\n print(\"YES\")\r\n exit()\r\nelif a.find('9')>=0:\r\n print(\"YES\")\r\n exit()\r\nelse:\r\n print(\"NO\")", " # Read the input program\r\nprogram = input()\r\n\r\n# Iterate over each character in the program\r\nfor char in program:\r\n # Check if the character matches any of the instructions\r\n if char in ['H', 'Q', '9']:\r\n # Output \"YES\" and terminate the program\r\n print(\"YES\")\r\n exit()\r\n\r\n# If no match is found, output \"NO\"\r\nprint(\"NO\")\r\n", "program = input()\r\n\r\noutput_produced = False\r\n\r\nfor instruction in program:\r\n if instruction == 'H' or instruction == 'Q' or instruction == '9':\r\n output_produced = True\r\n break\r\n\r\nif output_produced:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "instructions=input()\r\nfor instruction in instructions:\r\n if instruction in {'H','Q','9'}:\r\n print(\"YES\")\r\n break\r\n\r\nelse:\r\n print(\"NO\")", "program = input()\r\n\r\noutput = \"NO\" # Initialize output as \"NO\"\r\n\r\nif 'H' in program or 'Q' in program or '9' in program:\r\n output = \"YES\" # If any of the output instructions are present, update output to \"YES\"\r\n\r\nprint(output)\r\n", "def has_output_in(p):\r\n for char in p:\r\n if char in \"HQ9\":\r\n return \"YES\"\r\n return \"NO\"\r\n\r\n# Read the input string from standard input\r\nprogram = input().strip()\r\n\r\n# Check if the program will produce any output and print the result\r\nprint(has_output_in(program))\r\n", "def fun(s):\r\n for i in range(len(s)):\r\n if s[i]=='H' or s[i]=='Q' or s[i]=='9':\r\n return 'YES'\r\n \r\n return 'NO'\r\n \r\n\r\ns=input()\r\nprint(fun(s))", "def main():\n string = input()\n valid = {\"H\", \"9\", \"Q\"}\n for char in string:\n if char in valid:\n print(\"YES\")\n return\n print(\"NO\")\n \nif __name__ == \"__main__\":\n main()", "def main(p):\r\n arr = [\"H\", \"Q\", \"9\"]\r\n\r\n for i in range(len(p)):\r\n if p[i] in arr:\r\n return \"YES\"\r\n\r\n return \"NO\"\r\n\r\nif __name__ == \"__main__\":\r\n p = input()\r\n\r\n print(main(p))", "s=input()\r\nc=0\r\nfor i in s:\r\n if i in 'HQ9':\r\n c+=1\r\nif c>0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n ", "a=input()\r\nf=0\r\nb='HQ9'\r\nfor x in a:\r\n for i in b:\r\n if x==i:\r\n f=1\r\nif f==1:\r\n print('YES')\r\nelse:\r\n print('NO')", "print(set(\"HQ9\") & set(input()) and \"YES\" or \"NO\")", "bruh=input()\r\nnyek='NO'\r\ncharacters=list(set(bruh))\r\ngoodset=['H', 'Q', '9']\r\nfor i in range(len(characters)):\r\n if characters[i] in goodset:\r\n nyek='YES'\r\n break\r\n else:\r\n continue\r\nprint(nyek)", "S = input()\r\nif S.find('H') == -1 and S.find('Q') == -1 and S.find('9') == -1 : \r\n print(\"NO\")\r\nelse : print(\"YES\")", "program = input()\r\noutput_possible = False\r\nfor char in program:\r\n if char in \"HQ9\":\r\n output_possible = True\r\n break\r\nif output_possible:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "s = input()\r\nflag = False\r\nfor i in s:\r\n if i in set('HQ9'):\r\n flag = True\r\nif flag:\r\n print('YES')\r\nelse:\r\n print('NO')", "def solve():\r\n s = input()\r\n if 'H' in s or 'Q' in s or '9' in s:\r\n print('YES')\r\n else:\r\n print('NO')\r\n\r\n\r\n# t = int(input())\r\nt = 1\r\nwhile t:\r\n solve()\r\n t -= 1\r\n", "p=str(input())\r\n\r\nh=\"H\"\r\nq= \"Q\"\r\nnine= \"9\"\r\n\r\n\r\n\r\nyes=\"YES\"\r\nno=\"NO\"\r\n\r\n\r\nif q in p or h in p or nine in p :\r\n print(yes)\r\nelse:\r\n print(no)\r\n\r\n\r\n", "Eingabe = input()\r\nliste = []\r\nliste = list(Eingabe)\r\n#print(liste)\r\n\r\nif ('H' in liste) or ('Q' in liste) or ('9' in liste):\r\n print('YES')\r\nelse:\r\n print('NO')", "s1=input()\nif('H' in s1 or 'Q' in s1 or '9' in s1):\n print(\"YES\")\nelse:\n print(\"NO\")\n\t\t \t \t \t \t \t\t \t \t\t \t\t\t \t", "a=list(input())\r\nt=0\r\nfor i in a:\r\n if i=='H' or i=='Q' or i=='9':\r\n t=1\r\n break\r\nif t==1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "s = input()\r\nfor c in s:\r\n if c == 'H' or c == 'Q' or c == '9':\r\n print(\"YES\")\r\n exit(0)\r\n\r\nprint(\"NO\")\r\n", "s=input()\r\np=\"HQ9\"\r\nflag=0\r\nfor i in p:\r\n if i in s:\r\n flag=1\r\n break\r\nif flag==1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s = input()\r\no = { 'H', 'Q', '9' }\r\nfound = False\r\n\r\nfor c in s:\r\n if c in o:\r\n found = True\r\n break\r\n\r\nprint('YES' if found else 'NO')", "def main():\n p=input()\n if(\"9\" in p or 'H' in p or \"Q\" in p):\n print('YES')\n else:\n print('NO')\nmain()\n", "p = input()\r\na = False\r\nfor i in p:\r\n if i == \"H\":\r\n a = True\r\n break\r\n if i == \"Q\":\r\n a = True\r\n break\r\n if i == \"9\":\r\n a = True\r\n break\r\n\r\nif a == True:\r\n print(\"YES\")\r\nelif a == False:\r\n print (\"NO\")", "p = input()\r\n\r\n# Check if the program contains any of the instructions\r\nif 'H' in p or 'Q' in p or '9' in p:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "def will_produce_output(program):\n instructions = set(\"HQ9\")\n \n for char in program:\n if char in instructions:\n return \"YES\"\n \n return \"NO\"\n\n# Input\nprogram = input()\n\n# Determine if it will produce output\noutput = will_produce_output(program)\n\n# Output the result\nprint(output)\n\n \t \t\t \t \t\t\t\t\t\t\t\t \t \t\t\t \t\t", "a=input()\r\nb=0\r\nfor i in a:\r\n if i=='H' or i=='Q' or i=='9':\r\n b+=1\r\nif b>0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a = input()\r\ncount = 0\r\nfor i in range(len(a)):\r\n if a[i] == \"H\" or a[i] == \"Q\" or a[i] == \"9\":\r\n count += 1 \r\nif count >= 1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def HQ(string):\r\n for s in string:\r\n if s in [\"H\", \"Q\", \"9\"]:\r\n print(\"YES\")\r\n return 0\r\n print(\"NO\")\r\ns = input()\r\nHQ(s)\r\n", "user = str(input())\r\nfor i in user:\r\n if any([i == 'H', i == 'Q', i == '9']):\r\n print(\"YES\")\r\n break\r\nelse:\r\n print(\"NO\")", "a=input()\r\nif a.count('H')+a.count('Q')+a.count('9')>0:print('YES')\r\nelse:print('NO')\r\n", "def main() :\r\n print(yes_No(is_Print_Any(input_HQ9_Command())))\r\n\r\n\r\ndef is_Print_Any(hq9_command) :\r\n return is_Contains_Any(hq9_command, [\"H\", \"Q\", \"9\"])\r\n\r\ndef is_Contains_Any(string, chars) :\r\n for char in chars :\r\n if char in string : return True\r\n return False\r\n\r\n\r\ndef input_HQ9_Command() :\r\n return input()\r\n\r\n\r\ndef yes_No(bool) :\r\n return [\"NO\", \"YES\"][bool]\r\n\r\n\r\nmain()", "string=input()\r\nflag=0\r\nfor char in string:\r\n if char=='H' or char=='Q' or char=='9':\r\n print(\"YES\")\r\n flag=1\r\n break\r\nif(flag==0):\r\n print(\"NO\")\r\n", "print('YES' if len(set('HQ9') - set(input())) < 3 else 'NO')", "a = input() \r\not = \"NO\"\r\nif 'H' in a or 'Q' in a or '9' in a:\r\n ot = \"YES\"\r\nprint(ot) \r\n", "line = input()\r\nif 'H' in line or 'Q' in line or '9' in line:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "l = [\"H\", \"Q\", \"9\"]\n\ns = input()\nflag = False\nfor i in l:\n if i in s:\n flag = True\nif flag:\n print(\"YES\")\nelse:\n print(\"NO\")\n \t\t\t\t\t \t \t\t\t \t\t\t \t\t \t\t\t \t\t\t", "def hq9(pro):\r\n if 'H' in pro or'Q' in pro or '9' in pro :\r\n return \"YES\"\r\n else:\r\n return \"NO\"\r\npro=input()\r\nres=hq9(pro)\r\nprint(res)", "a = input()\r\np = [\"H\",\"Q\",\"9\"]\r\ncount = 0\r\nfor i in a:\r\n if i in p:\r\n count +=1\r\nif count:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def hq9_plus_output(s):\r\n\r\n for char in s:\r\n \r\n if char in \"H Q 9 \":\r\n return \"YES\"\r\n\r\n return \"NO\"\r\n\r\ns = input()\r\n\r\noutput = hq9_plus_output(s)\r\nprint(output)", "w = [c for c in input()]\r\n\r\np = False\r\n\r\nfor i in range(len(w)):\r\n\r\n if w[i] == 'H' or w[i] == 'Q' or w[i] == '9':\r\n\r\n p = True\r\n break\r\n\r\nif p:\r\n\r\n print('YES')\r\n\r\nelse:\r\n\r\n print('NO')", "St=input()\r\nif('H' in St or 'Q' in St or '9' in St):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "print(set(\"HQ9\")&set(input())and\"YES\"or\"NO\")", "a=set(\"HQ9\")\r\nx=input()\r\nb=set(x)\r\nif a&b:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\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 p = input()\n print(\"YES\" if \"H\" in p or \"Q\" in p or \"9\" in p else \"NO\")\n\n\nif __name__ == \"__main__\":\n main()\n", "from sys import stdin,stdout\r\n# from bisect import bisect_left,bisect\r\n# from heapq import heapify,heappop,heappush\r\n# from sys import setrecursionlimit\r\n# from collections import defaultdict,Counter\r\n# from itertools import permutations\r\n# from math import gcd,ceil,sqrt,factorial\r\n# setrecursionlimit(int(1e5))\r\ninput,print = stdin.readline,stdout.write\r\n\r\ns = input().strip()\r\nans = \"NO\"\r\nif 'H' in s or 'Q' in s or '9' in s:\r\n ans = \"YES\"\r\n\r\nprint(str(ans)+\"\\n\")\r\n", "s = input()\r\nif any(char in s for char in \"HQ9\"):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "program = input()\r\n\r\noutput = \"NO\"\r\nif 'H' in program or 'Q' in program or '9' in program:\r\n output = \"YES\"\r\n\r\nprint(output)\r\n", "a=input()\r\nb=list(a)\r\ncount=0\r\nq=list(\"HQ9\")\r\nfor i in b:\r\n if i in q:\r\n count=count+1\r\nif(count>=1):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "import sys\r\n\r\nstr = sys.stdin.readline()\r\nflag = False\r\nfor i in str:\r\n if i == 'H' or i == 'Q' or i == '9':\r\n flag = True\r\nif flag:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "new = \"HQ9\" \r\ns = input()\r\nfor i in new:\r\n if i in s:\r\n out = \"YES\"\r\n break\r\n else:\r\n out = \"NO\" \r\nprint(out)", "string = input()\r\nif 'H' in string or 'Q' in string or '9' in string:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a=str(input())\r\nb=[\"H\",\"Q\",\"9\"]\r\nf=0\r\nfor i in a:\r\n if i in b:\r\n print(\"YES\")\r\n f=1\r\n break\r\nif(f==0):\r\n print(\"NO\")", "for i in input():\r\n if i in 'HQ9':\r\n print('YES')\r\n break\r\nelse: print('NO')", "x=input()\r\na=list(x)\r\nc=0\r\np=list(\"HQ9\")\r\nfor i in a:\r\n if i in p:\r\n c=c+1\r\nif(c>=1):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s = 'HQ9+'\r\np = input()\r\nresult = 'NO'\r\nfor i in p:\r\n if i in s[0:-1]:\r\n result = 'YES'\r\n break\r\nprint(result)", "def hq9_plus_output(hrq):\r\n\r\n for char in hrq:\r\n \r\n if char in \"H Q 9 \":\r\n return \"YES\"\r\n\r\n return \"NO\"\r\n\r\nhrq = input()\r\n\r\noutput = hq9_plus_output(hrq)\r\nprint(output)", "p = input()\r\noutput = False\r\n\r\nfor ch in p:\r\n if ch in [\"H\", \"Q\", \"9\"]:\r\n output = True\r\n break\r\n\r\nif output:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "s=input()\r\nf=False\r\nif s.__contains__('H') or s.__contains__('Q') or s.__contains__('9'):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "x=input()\r\nfor i in x :\r\n if i ==\"H\":\r\n print(\"YES\")\r\n break\r\n elif i == \"Q\" :\r\n print(\"YES\")\r\n break\r\n elif i == \"9\" :\r\n print(\"YES\")\r\n break\r\nelse:\r\n print(\"NO\")\r\n", "l=input()\r\ntemp=\"NO\"\r\nfor i in l:\r\n if i==\"H\" or i==\"Q\" or i==\"9\":\r\n temp=\"YES\"\r\n break\r\nprint(temp)", "x=list(input())\r\ntemp=0\r\nfor z in x:\r\n if z=='H' or z=='Q' or z=='9':\r\n temp=1\r\n break\r\nif temp==1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def hq9_plus_output(y):\r\n\r\n for char in y:\r\n \r\n if char in \"H Q 9 \":\r\n return \"YES\"\r\n\r\n return \"NO\"\r\n\r\ny = input()\r\n\r\noutput = hq9_plus_output(y)\r\nprint(output)", "t=input()\r\na=list(t)\r\nc=0\r\nq=list(\"HQ9\")\r\nfor i in a:\r\n if i in q:\r\n c=c+1\r\nif(c>=1):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "program = input()\r\n\r\nis_valid = program.count('H') > 0 or program.count(\r\n 'Q') > 0 or program.count('9') > 0\r\nprint('YES' if is_valid else 'NO')\r\n", "a = str(input())\r\nif('H' in a):\r\n\tprint (\"YES\")\r\nelif('Q' in a):\r\n\tprint (\"YES\")\r\nelif('9' in a):\r\n\tprint (\"YES\")\r\nelse:\r\n\tprint (\"NO\")", "s=input()\r\ndef ismatch(s):\r\n map={'H':1,'Q':1,'9':1}\r\n for i in s:\r\n if i in map:\r\n return 'YES'\r\n return 'NO'\r\nprint(ismatch(s))\r\n", "r=(input())\r\nif (\"H\" in r )or (\"Q\" in r) or ('9' in r):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "inp=input()\r\nif 'H' in inp or 'Q' in inp or '9' in inp:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n = input()\r\n \r\nif n.find(\"H\") != -1 or n.find(\"Q\") != -1 or n.find(\"9\") != -1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "k = input()\r\nif 'H' in k or 'Q' in k or '9' in k:\r\n print (\"YES\")\r\nelse:\r\n print (\"NO\")\r\n", "s = input()\r\n\r\nflag=False\r\nfor char in s:\r\n if char==\"H\" or char==\"Q\" or char==\"9\":\r\n flag=True\r\n\r\nif flag:\r\n print(\"YES\")\r\nelse: print(\"NO\")", "program_code = input()\r\n\r\nif program_code.find('H') == -1 and program_code.find('Q') == -1 and program_code.find('9') == -1:\r\n print('NO')\r\nelse:\r\n print('YES')", "def solve(s):\r\n for c in \"HQ9\":\r\n if c in s:\r\n return True\r\n return False\r\n\r\n\r\nprint([\"NO\", \"YES\"][solve(input())])\r\n", "#!/usr/bin/env python3\r\n\r\nimport sys\r\nimport math\r\n\r\nMOD = int(1e9) + 7\r\nINF = int(1e9)\r\nEPS = 1e-9\r\n\r\nsys.setrecursionlimit(10**6)\r\n\r\ndef read_int():\r\n return int(sys.stdin.readline().strip())\r\ndef read_ints():\r\n return list(map(int, sys.stdin.readline().split()))\r\ndef read_float():\r\n return float(input().strip())\r\ndef read_floats():\r\n return map(float, input().split())\r\ndef read_str():\r\n return sys.stdin.readline().strip()\r\ndef write(data):\r\n sys.stdout.write(str(data) + \"\\n\")\r\n sys.stdout.flush()\r\ndef write_array(arr:list, sep=\" \"):\r\n\tfor i in arr:\r\n\t\tsys.stdout.write(str(i) + sep)\r\n\tsys.stdout.write(\"\\n\")\r\n\tsys.stdout.flush()\r\n\r\n# >_____________3arvay_python3_template______________<\r\n\r\nn=read_str()\r\nt=[\"H\",\"Q\",\"9\"]\r\nans = False\r\nfor i in n:\r\n if i in t:\r\n ans = True\r\n break\r\n\r\nif ans: print(\"YES\")\r\nelse: print(\"NO\")", "a=input()\r\narr=['H','Q','9']\r\nflag=0\r\nfor i in arr:\r\n if i in a:\r\n flag=1 \r\nif flag:\r\n print('YES')\r\nelse:\r\n print('NO')", "n = input()\r\n\r\nfor ch in n:\r\n if ch == 'H' or ch == 'Q' or ch == '9':\r\n print(\"YES\")\r\n exit()\r\n\r\nprint(\"NO\")\r\n", "x = input()\n\ncount = x.count('H') + x.count('Q') + x.count('9')\n\nprint('YES') if count>0 else print('NO')\n \t \t \t \t \t\t\t\t \t\t \t \t \t\t", "n=input()\r\nprogram=False\r\nfor i in n:\r\n if i in ['H', 'Q', '9']:\r\n program= True\r\n break\r\nif program:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n", "line = input()\r\n\r\nhas_output = False\r\n\r\nfor c in line:\r\n if c == \"H\" or c == \"Q\" or c == \"9\":\r\n has_output = True\r\n break\r\n\r\n\r\nif has_output:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "s=input()\r\nif('H' in s) or ('Q' in s) or('9'in s):\r\n print('YES')\r\nelse:\r\n print('NO')", "l=['H','Q','9']\r\ns=0\r\nl1=list(input())\r\nfor i in l1:\r\n if i in l:\r\n s+=1\r\nif s == 0 :\r\n print(\"NO\")\r\nelse:\r\n print('YES')", "n = input()\r\nif len(n) >= 1 and len(n) <= 100:\r\n c = True\r\n for i in n:\r\n if ord(i) < 33 or ord(i) > 126:\r\n c = False\r\n break\r\n else:\r\n continue\r\n if c == True:\r\n if \"H\" in n or \"Q\" in n or \"9\" in n:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n", "str = input()\r\nflag = 0\r\nfor i in range(len(str)):\r\n if ord(str[i]) >= 33 and ord(str[i]) <= 126:\r\n if str[i] == \"H\" or str[i] == \"Q\" or str[i] == \"9\":\r\n flag = 1\r\n\r\nif flag: print(\"YES\")\r\nelse: print(\"NO\")", "p=input()\r\na=len(p)\r\nfor i in range(len(p)):\r\n if p[i]=='H' or p[i]=='Q' or p[i]=='9':\r\n print(\"YES\")\r\n break\r\n else:\r\n a=a-1\r\nif a==0:\r\n print(\"NO\")\r\n ", "p = input()\r\ncount = 0\r\nfor i in p:\r\n if i in 'HQ9':\r\n count += 1\r\n elif i == '+' and count > 0:\r\n count += 1\r\nif count > 0:\r\n print('YES')\r\nelse:\r\n print('NO') ", "# your code goes here\r\ndef main():\r\n produces_output = False\r\n program = input()\r\n\r\n for char in program:\r\n if char in ['H', 'Q', '9']:\r\n produces_output = True\r\n break\r\n\r\n print(\"YES\" if produces_output else \"NO\")\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "s = input()\r\nprint(\"YES\" if any(i in s for i in \"HQ9\") else \"NO\")", "t=input()\r\nif ('H' in t or'Q' in t or'9' in t):\r\n print(\"YES\")\r\nelse :\r\n print(\"NO\")", "def HQ9(string):\r\n list_of_instruction = [\"H\" , \"Q\" , \"9\"]\r\n for i in string :\r\n if i in list_of_instruction:\r\n return True\r\n\r\nif __name__ == \"__main__\":\r\n string = input()\r\n if HQ9(string):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "def ques(p):\r\n for w in p:\r\n if w in \"HQ9\":\r\n return \"YES\"\r\n return \"NO\"\r\n \r\np = input()\r\nprint(ques(p))", "def is_output_generated(p):\r\n for char in p:\r\n if char in \"HQ9\":\r\n return \"YES\"\r\n return \"NO\"\r\np = input()\r\nprint(is_output_generated(p))", "s = input()\r\nfor i in s:\r\n if i in 'HQ9':\r\n print('YES')\r\n exit()\r\nprint('NO')", "def hq9_plus_output(t):\r\n\r\n for char in t:\r\n \r\n if char in \"H Q 9 \":\r\n return \"YES\"\r\n\r\n return \"NO\"\r\n\r\nt = input()\r\n\r\noutput = hq9_plus_output(t)\r\nprint(output)", "# https://codeforces.com/problemset/problem/133/A\r\n\r\nprogram_input = input()\r\n\r\nprogram_set = ('H', 'Q', '9')\r\nhas_output = False\r\n\r\nfor char in program_input:\r\n if char in program_set:\r\n print('YES')\r\n has_output = True\r\n break\r\n\r\nif not has_output:\r\n print('NO')\r\n", "def HQ9_plus_output(a):\r\n for char in a:\r\n if char in \"H Q 9 \":\r\n return \"YES\"\r\n return \"NO\"\r\na = input()\r\noutput = HQ9_plus_output(a)\r\nprint(output)", "def will_produce_output(program):\r\n # Check if program contains any of the instructions \"H\", \"Q\", or \"9\"\r\n for char in program:\r\n if char in \"HQ9\":\r\n return \"YES\"\r\n return \"NO\"\r\n\r\n# Read the input program\r\nprogram = input()\r\n\r\n# Check if the program will produce output and print the result\r\nprint(will_produce_output(program))", "def is_will_product(program):\r\n instruction = 'HQ9'\r\n for char in program:\r\n if char in instruction:\r\n return True\r\n\r\n return False\r\n\r\n\r\nprogram = input()\r\nif is_will_product(program):\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "p = input().strip()\r\nfor char in p:\r\n if ord(char) in {72, 81, 57}:\r\n print('YES')\r\n break\r\nelse:\r\n print('NO')", "thing = input()\nyep = False\n\nif \"H\" in thing:\n yep = True\nif \"Q\" in thing:\n yep = True\nif \"9\" in thing:\n yep = True\n\nif yep == True:\n print(\"YES\")\nelse:\n print(\"NO\")\n\t\t\t \t\t\t\t \t\t \t \t\t \t \t\t\t \t\t \t\t", "program = input()\r\noutput = False \r\nfor char in program:\r\n if char in ['H','Q','9']:\r\n output = True\r\n break\r\nif output:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "print(\"YES\" if len(set(input()).intersection(set(\"HQ9\"))) > 0 else \"NO\")", "string=list(input())\nif \"H\" in string:\n print(\"YES\")\nelif \"Q\" in string:\n print(\"YES\")\nelif \"9\" in string:\n print(\"YES\")\nelse:\n print(\"NO\")", "st=str(input())\r\nprint('YES' if 'H' in st or 'Q' in st or '9' in st else 'NO')\r\n", "n = input()\r\nprint('YES' if 'H' in n or 'Q' in n or '9' in n else 'NO')\r\n", "hq9 = input()\r\nresult = \"NO\"\r\n\r\nfor char in hq9:\r\n\r\n if char in (\"H\", \"Q\", \"9\"):\r\n result = \"YES\"\r\n break\r\n \r\nprint(result)", "s=set(input())\r\nr=set('HQ9')\r\nif s&r:\r\n print('YES')\r\nelse:\r\n print('NO')", "letters = [\"H\" , \"Q\" , \"9\"]\r\ntext = input()\r\nfor letter in text :\r\n if letter in letters :\r\n exit(print(\"YES\"))\r\nprint(\"NO\")", "s = str(input())\r\ncheck = False\r\nfor i in s:\r\n if i in \"HQ9\":\r\n print(\"YES\")\r\n check = True\r\n break\r\nif check == False:\r\n print(\"NO\")", "def hq9_plus(program):\r\n if 'H' in program or 'Q' in program or '9' in program:\r\n return \"YES\"\r\n return \"NO\"\r\n\r\nprogram = input()\r\nresult = hq9_plus(program)\r\nprint(result)\r\n", "s=input()\r\nword=\"HQ9\"\r\nfor i in s :\r\n if i in word :\r\n print(\"YES\")\r\n break\r\nelse:\r\n print(\"NO\")", "script = input()\r\nstatement = False\r\nfor char in script:\r\n if char == 'H' or char =='Q' or char =='9':\r\n statement = True\r\n break\r\nif statement:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Thu Sep 7 08:44:40 2023\r\n\r\n@author: HyFlu\r\n\"\"\"\r\n\r\nstring=input()\r\nif 'H' in string or 'Q' in string or '9' in string:\r\n print('YES')\r\nelse:\r\n print('NO')", "s = input()\r\n\r\nprint('YES' if any(x in s for x in ['H', \"Q\", '9']) else 'NO')", "a=(input())\nlist1=[\"H\",\"Q\",\"9\",9]\nflag=0\nfor i in a:\n # print(i)\n if i in list1:\n flag=1\n break\nif flag==1:\n print(\"YES\")\nelse:\n print(\"NO\")\n", "\r\nprogram = input().strip()\r\n\r\n\r\ncontains_output = any(instruction in program for instruction in [\"H\", \"Q\", \"9\"])\r\n\r\nif contains_output:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "p=input()\r\ncounter=0\r\nfor i in range(len(p)):\r\n if p[i]=='H' or p[i]=='Q' or p[i]=='9':\r\n counter+=1\r\n break\r\n else:\r\n continue\r\nif counter==0:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "def is_output_produced(program):\r\n for char in program:\r\n if char in \"HQ9\":\r\n return \"YES\"\r\n return \"NO\"\r\n\r\n\r\nprogram = input().strip()\r\nresult = is_output_produced(program)\r\nprint(result)\r\n", "s = input()\r\nif \"H\" in s or \"Q\" in s or \"9\" in s:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "x = input()\r\ns = 0\r\nfor i in range(len(x)):\r\n if x[i] == 'H' or x[i] == 'Q' or x[i] == '9':\r\n s += 1\r\nif s > 0:\r\n print(f'YES')\r\nelse:\r\n print(f'NO')", "p = str(input())\r\nn = 0\r\nfor i in range(len(p)):\r\n if (p[i]) == \"H\":\r\n n = 1\r\n elif (p[i]) == \"Q\":\r\n n = 1\r\n elif (p[i]) == \"9\":\r\n n = 1\r\n \r\nif n == 1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "x=input()\r\nif 'H' in x or \"Q\" in x or '9' in x:print(\"YES\")\r\nelse:print(\"NO\")", "a=list(input())\r\nc=0\r\nfor i in a:\r\n if i=='H' or i=='Q' or i=='9':\r\n c=1\r\n break\r\nif c==1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "#CodeForce Round 133a HQ9+\r\n\r\ninstruction = [*\"HQ9\"]\r\ncode = input()\r\n# i = 0\r\n# for each in instruction:\r\n# if each in code:\r\n# i += 1\r\n# if i != 1:\r\n# print(\"NO\")\r\n# else:\r\n# print(\"YES\")\r\n\r\nif any(c in code for c in instruction):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s = input()\r\nok = \"NO\"\r\nfor i in s:\r\n if i == 'H' or i == '9' or i == 'Q':\r\n ok = \"YES\"\r\n break\r\nprint(ok)", "# 133A - HQ9+\r\nli = list(input())\r\nres = 0\r\nfor i in li:\r\n if i == 'H' or i == 'Q' or i == '9':\r\n res = 1\r\n break\r\nif res == 1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "from collections import deque\r\nimport math\r\nfrom random import randint as rand\r\nfrom functools import lru_cache\r\nimport string\r\nalph_l = string.ascii_lowercase\r\nalph_u = string.ascii_uppercase\r\n\r\n\r\nsimp = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47]\r\ndef main():\r\n s = input()\r\n if s.count('H') == 0 and s.count('Q') == 0 and s.count('9') == 0:\r\n print('NO')\r\n else:\r\n print('YES')\r\nif __name__ == \"__main__\":\r\n main()", "def execute_hq9(program):\r\n for char in program:\r\n if char in \"HQ9\":\r\n return \"YES\"\r\n return \"NO\"\r\n\r\nprogram = input()\r\nresult = execute_hq9(program)\r\nprint(result)\r\n", "program = input()\r\n\r\nproduces_output = False\r\nfor char in program:\r\n if char in \"HQ9\":\r\n produces_output = True\r\n break\r\n\r\nif produces_output:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s = input()\r\nif set(s).intersection({'H', 'Q', '9'}):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s=input()\r\nisout=False\r\nfor i in range(len(s)):\r\n if s[i] == 'H' or s[i]=='Q' or s[i] == '9' :\r\n isout=True\r\n \r\nif isout==True:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "def ejecuta_programa_HQ9(programa):\r\n for val in programa:\r\n if val in \"HQ9\":\r\n return \"YES\"\r\n return \"NO\"\r\n\r\n\r\nprograma = input()\r\nresultado = ejecuta_programa_HQ9(programa)\r\nprint(resultado)", "a=set('HQ9')\nb=set(input())\nif a & b:\n print('YES')\nelse:\n print('NO')", "x = input()\r\n\r\ncond = True\r\nfor c in x :\r\n if c in \"HQ9\" :\r\n cond = False\r\n break\r\n\r\nif cond == False :\r\n print(\"YES\")\r\nelse :\r\n print(\"NO\")", "print('YES' if set(input())&set('HQ9') else 'NO')\n", "def que(n):\r\n for x in n:\r\n if x in \"HQ9\":\r\n return \"YES\"\r\n return \"NO\"\r\n \r\nn = input()\r\nprint(que(n))", "i = str(input(\"\"))\r\n\r\nh = (i.find(\"H\"))\r\nQ = (i.find(\"Q\"))\r\nnine = (i.find(\"9\"))\r\nif h >= 0 or Q >= 0 or nine >= 0 : \r\n print(\"YES\")\r\nelse :\r\n print(\"NO\")", "program = input()\r\noutput_instructions = ['H' , 'Q' , '9']\r\nfor instruction in program :\r\n if instruction in output_instructions:\r\n print(\"YES\")\r\n break\r\nelse:\r\n print(\"NO\")", "e=input()\r\nif 'H' in e or 'Q' in e or '9' in e:\r\n\tprint (\"YES\")\r\nelse:\r\n\tprint (\"NO\")", "text=[\"H\",\"Q\",\"9\"]\r\ntt=input()\r\nflag='NO'\r\nfor x in text:\r\n if x in tt:\r\n flag='YES'\r\n break\r\nprint(flag)", "def lang():\r\n p=input()\r\n ref=\"HQ9\"\r\n for i in ref:\r\n if i in p:\r\n return \"YES\"\r\n return \"NO\"\r\nprint(lang())", "x = input()\r\nprint(\"YES\" if \"H\" in x or \"Q\" in x or \"9\" in x else \"NO\")", "chir = 0\r\nfor ris in input().strip():\r\n if(ris=='H' or ris=='Q' or ris=='9'):\r\n chir = 1\r\n \r\nif(chir):\r\n print(\"YES\")\r\n \r\nelse:\r\n print(\"NO\")", "num=input()\r\nif 'H' in num or 'Q' in num or '9' in num:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "# your code goes here\r\nj=input()\r\nif 'H' in j or 'Q' in j or '9' in j:\r\n\tprint (\"YES\")\r\nelse:\r\n\tprint (\"NO\")", "s=input()\r\nc=0\r\nfor i in s:\r\n if i in \"HQ9\":\r\n c =1\r\n break\r\nif c==1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "a=input()\r\nh=a.count(\"H\")\r\nq=a.count(\"Q\")\r\np=a.count(\"9\")\r\nif h>=1 or q>=1 or p>=1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "x = input()\ninstructions = \"HQ9\"\n\nfor char in x:\n if char in instructions:\n print(\"YES\")\n break\n\nelse:\n print(\"NO\")\n\n \t \t\t\t \t \t\t \t \t \t\t\t\t", "s = input()\r\nres='NO'\r\nfor i in s:\r\n if i=='H' or i=='Q' or i=='9' :\r\n res='YES'\r\nprint(res)\r\n", "p=input()\r\nt=0\r\nfor i in p:\r\n if \"H\" in p or \"Q\" in p or \"9\" in p:\r\n print(\"YES\")\r\n break\r\n else:\r\n t+=1\r\n continue\r\nif t==len(p):\r\n print(\"NO\")", "s = input()\n\nt = [\"H\", \"Q\", \"9\"]\n\nfor c in s:\n if c in t:\n print(\"YES\")\n break\nelse:\n print(\"NO\")\n", "from os import path\r\nimport sys\r\nif(path.exists('input.txt')):\r\n sys.stdin=open(\"input.txt\",\"r\")\r\n sys.stdout=open(\"output.txt\",\"w\")\r\n\r\n\r\n\r\n# for _ in range(int(input())):\r\n# n = int(input())\r\n# l = [[j for j in input()] for i in range(n)]\r\n# print(l)\r\n# n,k = map(int,input().split())\r\n# n = int(input())\r\n# l = list(map(int,input().split()))\r\ns = input()\r\nh = {\"H\",\"Q\",\"9\"}\r\nf = 1\r\nfor i in s:\r\n if i in h:\r\n print(\"YES\")\r\n f = 0\r\n break\r\n \r\nif f:\r\n print(\"NO\")\r\n\r\n\r\n\r\n\r\n\r\n", "def hq9_plus(code):\r\n if 'H' in code or 'Q' in code or '9' in code:\r\n return \"YES\"\r\n else:\r\n return \"NO\"\r\n\r\n\r\nif __name__ == \"__main__\":\r\n code = input()\r\n print(hq9_plus(code))\r\n", "l=input()\r\nif ('H') in l:\r\n print('YES')\r\nelif 'Q' in l:\r\n print('YES')\r\nelif '9' in l:\r\n print('YES')\r\nelse:print('NO')", "characters_list = list(input())\r\nhas_special_character = False\r\n\r\nfor char in characters_list:\r\n if char == 'H' or char == 'Q' or char == '9':\r\n has_special_character = True\r\n break\r\n\r\nif has_special_character:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "# Read the input program as a string\r\nprogram = input()\r\n\r\n# Initialize a flag to check if there will be any output\r\noutput_flag = False\r\n\r\n# Check each character in the program\r\nfor char in program:\r\n if char in \"HQ9\":\r\n # If any of the valid instructions is found, set the flag and break\r\n output_flag = True\r\n break\r\n\r\n# Output \"YES\" if there is any output, otherwise \"NO\"\r\nif output_flag:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "value=input()\r\nif('H' in value or 'Q' in value or '9' in value):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a = input()\n\njoke = 'HQ9'\nexist = False\nfor i in joke:\n\tif i in a:\n\t\t\n\t\tprint('YES') \n\t\texist = True\n\t\tbreak\nif not exist:\n\tprint('NO')\n", "ss=input()\nif('H' in ss or 'Q' in ss or '9' in ss):\n print(\"YES\")\nelse:\n print(\"NO\")\n \t\t \t \t \t\t \t \t\t\t \t\t\t\t \t \t\t", "def check(st):\r\n for char in st:\r\n if char in \"HQ9\":\r\n return True\r\n return False\r\n \r\nst = input()\r\n\r\nif check(st):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "source = input()\r\n\r\nif \"H\" in source or \"Q\" in source or \"9\" in source:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "str_input = input()\r\nflag = 0\r\n\r\nfor char in str_input:\r\n if 33 <= ord(char) <= 126:\r\n if char == 'H' or char == 'Q' or char == '9':\r\n flag = 1\r\n\r\nif flag:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "# HQ9+\r\na = set(map(str, input()))\r\nb = ('H', 'Q', '9')\r\nif len(a.intersection(b))>=1:\r\n print('YES')\r\nelse:\r\n print('NO')", "def will_produce_output(program):\r\n for char in program:\r\n if char in \"HQ9\":\r\n return \"YES\"\r\n return \"NO\"\r\n\r\n# Read input\r\nprogram = input()\r\n\r\n# Determine and print the result\r\nresult = will_produce_output(program)\r\nprint(result)\r\n", "print(\"YES\") if any(i in 'HQ9' for i in input()) else print(\"NO\")", "def checkWord(word):\r\n for i in word:\r\n if i == \"H\" or i == \"Q\" or i == \"9\":\r\n return print(\"YES\")\r\n\r\n return print(\"NO\")\r\n\r\nword = str(input())\r\ncheckWord(word)\r\n", "word = input()\r\nres = \"NO\"\r\nfor i in word:\r\n if i == 'H' or i == 'Q' or i == '9':\r\n res = \"YES\"\r\n break;\r\nprint (res)\r\n", "s = input()\r\nprinted_before = False\r\nfor chr in s:\r\n if chr in ('H', '9', 'Q'):\r\n printed_before = True\r\nif printed_before:\r\n print('YES')\r\nelse:\r\n print('NO')", "p=list(input())\r\nres=0\r\nfor i in p:\r\n if i=='H' or i=='Q' or i=='9':\r\n res=1\r\n break\r\nif res==1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "program = input()\r\nfor char in program:\r\n if char == \"H\" or char == \"Q\" or char == \"9\":\r\n print(\"YES\")\r\n break\r\nelse:\r\n print(\"NO\")", "p=input()\r\na=list(p)\r\nk=0\r\nq=list(\"HQ9\")\r\nfor i in a:\r\n if i in q:\r\n k=k+1\r\nif(k>=1):\r\n print(\"YES\") \r\nelse:\r\n print(\"NO\")", "a = list('HQ9')\r\nfor i in input():\r\n if i in a:\r\n print('YES')\r\n break\r\nelse:\r\n print('NO')", "def main():\n p = input()\n if('Q' in p or '9' in p or 'H' in p):\n print(\"YES\")\n else:\n print(\"NO\")\nmain()", "str=input()\r\n\r\ndef check(str):\r\n for char in str:\r\n if char in \"HQ9\":\r\n return \"YES\"\r\n return \"NO\"\r\nresult=check(str)\r\nprint(result)", "val = input()\n\nif val.find(\"H\")!=-1 or val.find(\"Q\")!=-1 or val.find(\"9\")!=-1:\n print(\"YES\")\nelse:\n print(\"NO\")", "def execute_HQ9_plus(program):\r\n for command in program:\r\n if command in 'HQ9':\r\n return 'YES'\r\n return 'NO'\r\n\r\nprogram = input()\r\nprint(execute_HQ9_plus(program))\r\n", "p = input()\r\n\r\nres = False\r\n\r\nif p.count('H') != 0 or p.count('Q') != 0 or p.count('9') != 0:\r\n print('YES')\r\nelse:\r\n print('NO')", "program = input().strip()\r\nvalid_instructions = set(\"HQ9\")\r\nfor char in program:\r\n if char in valid_instructions:\r\n print(\"YES\")\r\n break\r\nelse:\r\n print(\"NO\")\r\n", "# Read the input program as a string\r\nprogram = input()\r\n\r\n# Initialize a flag to check if there's any output\r\nhas_output = False\r\n\r\n# Iterate through each character in the program\r\nfor char in program:\r\n if char in \"HQ9\":\r\n has_output = True\r\n break\r\n\r\n# Check if there's any output and print the result\r\nif has_output:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "# URL: https://codeforces.com/problemset/problem/133/A\nprint(\"YES\" if set(input()).intersection({\"Q\", \"H\", \"9\"}) else \"NO\")\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Sun Oct 1 20:49:06 2023\r\n\r\n@author: user\r\n\"\"\"\r\nn=input()\r\nif 'H' in n:\r\n print('YES')\r\nelif 'Q' in n:\r\n print('YES')\r\nelif '9' in n:\r\n print('YES')\r\nelse:\r\n print('NO')", "p=input()\r\na=0\r\nfor k in p:\r\n if k=='H' or k=='Q' or k=='9':\r\n a+=1\r\nif a>0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a = input()\r\nb = False\r\nc = 0\r\nfor i in range( len(a)):\r\n if a[i] == \"H\" or a[i] == \"Q\" or a[i] == \"9\":\r\n b = True\r\n if a[i] == \"+\" :\r\n c += 1\r\nif b :\r\n print(\"YES\")\r\nelse :\r\n print(\"NO\")\r\n", "def sol(N):\r\n for X in N:\r\n if X in \"HQ9\":\r\n return \"YES\"\r\n return \"NO\"\r\nN=input()\r\nprint(sol(N))", "s = input()\n\nh = s.count('H')\nq = s.count('Q')\nn = s.count('9')\n\nif h != 0 or q != 0 or n != 0:\n print('YES')\nelse:\n print('NO')\n ", "# Read the input string\r\ns = input()\r\n\r\n# Check if 'H', 'Q', or '9' is present in the string\r\nif 'H' in s or 'Q' in s or '9' in s:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "a=input()\r\nif((\"H\" in a) or (\"Q\" in a) or (\"9\" in a)):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "string=list(input())\r\nif \"H\" in string:\r\n print(\"YES\")\r\nelif \"Q\" in string:\r\n print(\"YES\")\r\nelif \"9\" in string:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "ans = input()\r\nif \"H\" in ans or \"Q\" in ans or \"9\" in ans:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def main(): \r\n s = input() \r\n if 'H' in s or 'Q' in s or '9' in s: \r\n print('YES') \r\n else: \r\n print('NO') \r\n\r\nif __name__ == '__main__': \r\n main() ", "word = (input())\r\naranan = [\"H\", \"Q\", \"9\"]\r\nlastrng = len(word)\r\ncon = 0\r\nfor i in range(0,lastrng):\r\n if word[i] in aranan:\r\n con = 1\r\n break\r\n else:\r\n con = 0\r\n\r\nif con == 1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "a=input()\r\nfor i in range(len(a)):\r\n if a[i]=='H' or a[i]=='9' or a[i]=='Q':\r\n print(\"YES\")\r\n quit()\r\nprint(\"NO\")", "def check(string):\r\n for t in string:\r\n if t in \"HQ9\":\r\n return \"YES\"\r\n return \"NO\"\r\n\r\nstring = input()\r\n\r\nprint(check(string))", "code = input()\r\ncode_list = []\r\naccept = False\r\nfor x in code:\r\n code_list.append(x)\r\nfor x in range(len(code_list)):\r\n if code_list[x] == \"H\" or code_list[x] == \"Q\" or code_list[x] == \"9\":\r\n accept = True\r\n break\r\n else:\r\n accept = False\r\n\r\nif accept == True:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "print([\"NO\", \"YES\"][bool(set(\"HQ9\") & set(input()))])\r\n", "a = input()\r\nif any(i in 'HQ9' for i in a):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "a=input()\r\nl=['H','Q','9']\r\ns=0\r\nfor i in a:\r\n if i in l:\r\n print(\"YES\")\r\n s+=1\r\n break\r\nif(s==0):\r\n print(\"NO\")", "p=input()\r\nl=['H','Q','9']\r\nflag=0\r\nfor i in p:\r\n if i in l:\r\n flag=1\r\n break\r\nif flag==1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n ", "p = input()\r\n\r\ninstructions = set(\"HQ9\")\r\nfor char in p:\r\n if char in instructions:\r\n print(\"YES\")\r\n break\r\nelse:\r\n print(\"NO\")\r\n", "program = input()[:100]\r\n\r\nif ('H' in program) or ('Q' in program) or ('9' in program):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "# Read the input program\r\nprogram = input()\r\n\r\n# Initialize a flag to check if any valid instruction is found\r\nhas_output = False\r\n\r\n# Check each character in the program\r\nfor char in program:\r\n if char in \"HQ9\":\r\n has_output = True\r\n break\r\n\r\n# Determine the output based on the flag\r\nif has_output:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "a=input()\r\nc=0\r\nfor i in a:\r\n if i=='H' or i=='Q' or i=='9':\r\n c+=1\r\nif c>0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def check_output(program):\r\n for char in program:\r\n if char in \"HQ9\":\r\n return \"YES\"\r\n return \"NO\"\r\nprogram = input()\r\noutput = check_output(program)\r\nprint(output)", "a, o = input(), \"NO\"\r\nfor i in a:\r\n if i == \"H\" or i == \"Q\" or i == \"9\":\r\n o = \"YES\"\r\n break\r\nprint(o)\r\n", "s = input()\r\nfor c in s:\r\n if c in ['H', 'Q', '9']:\r\n print('YES')\r\n break\r\nelse: print('NO')", "p = input()\r\n\r\noutput = \"NO\"\r\n\r\nfor char in p:\r\n if char in \"HQ9\":\r\n output = \"YES\"\r\n break\r\n\r\nprint(output)", "\r\nimport math as mth\r\nimport sys\r\n#input=sys.stdin.readline\r\n\r\n\r\n\r\ndef solve():\r\n \r\n n=str(input())\r\n ##a=list(map(int,input().split()))\r\n arr=['H','Q','9']\r\n for smb in n:\r\n if smb in arr:\r\n print(\"YES\")\r\n return\r\n print(\"NO\")\r\n return\r\n\r\ndef main():\r\n #for _ in range(int(input())):\r\n solve()\r\n return\r\n\r\n\r\nif __name__ == '__main__':\r\n main()", "p = input()\nprint('YES') if ('H' in p) or ('Q' in p) or ('9' in p) else print('NO')\n", "p=(str)(input(\"\"))\r\nc=0\r\nfor i in p[0:]:\r\n if(i==\"H\" or i==\"Q\" or i==\"9\"):\r\n print(\"YES\")\r\n break\r\n c+=1\r\nif(c==len(p)):\r\n print(\"NO\")\r\n", "\r\ndef main():\r\n print_commands = [\"H\", \"Q\", \"9\"]\r\n \r\n in_str = input()\r\n \r\n for character in in_str:\r\n for print_command in print_commands:\r\n if character == print_command:\r\n print(\"YES\")\r\n quit()\r\n \r\n print(\"NO\")\r\n \r\n \r\nif __name__ == \"__main__\":\r\n main()", "c ='HQ9'\r\ns =input()\r\nfor x in c :\r\n if x in s :\r\n print('YES')\r\n break \r\nelse :\r\n print('NO')", "def solve():\r\n string = input()\r\n characters = {\"H\", \"Q\", \"9\"}\r\n for char in string:\r\n if char in characters:\r\n print(\"YES\")\r\n return\r\n print(\"NO\")\r\n\r\n\r\ndef main():\r\n # t = int(input())\r\n t = 1\r\n for _ in range(t):\r\n solve()\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "test = input()\r\n\r\ncommands = [\"H\", \"Q\", \"9\"]\r\nexecs = 0\r\n\r\nfor com in commands:\r\n if com in test:\r\n print(\"YES\")\r\n execs = 1\r\n break\r\nif not execs:\r\n print(\"NO\")\r\n", "# Read the HQ9+ program from input\r\nprogram = input()\r\n\r\n# Define the set of allowed commands that produce output\r\nallowed_commands = set(\"HQ9\")\r\n\r\n# Check if the program contains any of the allowed commands\r\nfor char in program:\r\n if char in allowed_commands:\r\n print(\"YES\")\r\n break\r\nelse:\r\n print(\"NO\")\r\n", "def hq9_plus_output(x):\r\n\r\n for char in x:\r\n \r\n if char in \"H Q 9 \":\r\n return \"YES\"\r\n\r\n return \"NO\"\r\n\r\nx = input()\r\n\r\noutput = hq9_plus_output(x)\r\nprint(output)", "code = input()\r\nans = \"NO\"\r\nfor c in code:\r\n # if c==\"H\" or c==\"Q\" or c==\"9\" or c==\"+\":\r\n if c in \"HQ9\" :\r\n ans = \"YES\"\r\n break\r\nprint(ans)\r\n", "string = [*input()]\r\nfor i in range(len(string)):\r\n if (string[i]==\"H\" or string[i] == \"Q\" or string[i] == \"9\"):\r\n print(\"YES\")\r\n exit(0)\r\nprint(\"NO\")", "str = input()\nif any([x in ['H','Q','9'] for x in str]):\n print('YES')\nelse:\n print('NO')", "def main():\r\n s=input()\r\n d=['H','Q','9']\r\n for i in s:\r\n if i in d:\r\n print('YES')\r\n return\r\n print('NO')\r\nmain()", "raw=input()\r\nif 'H' in raw or 'Q' in raw or '9' in raw:\r\n print('YES')\r\nelse:\r\n print('NO')", "valueList = input()\r\nstringList = list(valueList)\r\nif 'H' in stringList:\r\n print(\"YES\")\r\nelif 'Q' in stringList:\r\n print(\"YES\")\r\nelif '9' in stringList:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "###################Hasan Ismail Saleh (DashX) ###########################################\r\nimport sys\r\nfrom collections import *\r\nfrom math import *\r\nfrom string import *\r\nfrom itertools import *\r\nfrom statistics import *\r\nfrom fractions import *\r\nfrom functools import reduce\r\nfrom heapq import *\r\ninput=sys.stdin.readline\r\n#subsets here (;\r\ndef f(s,n):\r\n return list(combinations(s,n))\r\ndef subsets(s):\r\n x=[]\r\n for i in range(0,len(s)+1):\r\n x.extend(f(s,i))\r\n return x\r\n#different permutations (;\r\ndef difp(x):#x can be either list or string\r\n p=permutations(x)\r\n s=set()\r\n for j in list(p):\r\n s.add(j)\r\n return (s)\r\n#Prime Factorization\r\ndef pf(x):\r\n f=[]\r\n for i in range(2,x+1):\r\n s=0\r\n if(x%i==0):\r\n while(x%i==0):\r\n x=x//i\r\n s=s+1\r\n if(s!=0):\r\n f.append([i,s])\r\n return f\r\n#number of factors\r\ndef nf(p):\r\n f=1\r\n for i in range(len(p)):\r\n f*=(p[i][1]+1)\r\n return f\r\ndef isprime(n):\r\n if(int(n)!=n):\r\n return False\r\n if n <= 1:\r\n return False\r\n for i in range(2, int(n**0.5)+1):\r\n if n % i == 0:\r\n return False\r\n return True\r\ndef tprime(x):\r\n if(isprime(sqrt(x))):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\ndef cbrt(x):\r\n if(ceil(pow(x,1/3))-pow(x,1/3)<pow(10,-12)):\r\n return ceil(pow(x,1/3))\r\n else:\r\n return pow(x,1/3)\r\n######################################Solution#############################\r\ndef solve():\r\n s=input()\r\n if('H' in s or 'Q' in s or '9' in s):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\nsolve()\r\n", "k=input()\r\nif\"H\" in k or \"Q\" in k or \"9\" in k :\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "p = input()\r\n\r\npl = \"HQ9+\"\r\n\r\ndef will_print_output(p):\r\n if ('H' in p or 'Q' in p or '9' in p):\r\n return \"YES\"\r\n else:\r\n return \"NO\"\r\n \r\nprint(will_print_output(p))" ]

[ "from functools import lru_cache\r\n\r\nmod = 10**9+7\r\nmaxc = 16\r\n\r\ndef solve(n, k, abc):\r\n v = [0]*maxc\r\n v[0] = 1\r\n for a,b,c in abc:\r\n b = min(b,k)\r\n d = b-a\r\n p2 = 0\r\n while d:\r\n d,r = divmod(d,2)\r\n if r:\r\n v = vecmul(matpow2(c, p2), v)\r\n p2 += 1\r\n if b==k:\r\n break\r\n return v[0]\r\n\r\ndef vecmul(m, v):\r\n return [sum(vi*mij for vi,mij in zip(v,mj))%mod for mj in m]\r\n\r\n@lru_cache(maxsize=None)\r\ndef matpow2(c, k):\r\n if k==0:\r\n return [[int(i <= c and i-1 <= j <= min(c, i+1)) for i in range(maxc)] for j in range(maxc)]\r\n m = matpow2(c, k-1)\r\n return [[sum(m[i][r]*m[r][j] for r in range(maxc)) % mod for i in range(maxc)] for j in range(maxc)]\r\n\r\nn, k = map(int, input().split())\r\nabc = [list(map(int, input().split())) for _ in range(n)]\r\nr = solve(n, k, abc)\r\nprint(r)", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\ndef f(u, v):\r\n return u * m + v\r\n\r\ndef matmul(a, b):\r\n c = []\r\n for i in range(m):\r\n for j in range(m):\r\n x = 0\r\n for l in range(m):\r\n x += a[f(i, l)] * b[f(l, j)] % mod\r\n c.append(x % mod)\r\n return c\r\n\r\nn, k = map(int, input().split())\r\nmod = pow(10, 9) + 7\r\nm = 16\r\nm2 = m * m\r\ndp = [0] * m\r\ndp[0] = 1\r\nfor _ in range(n):\r\n a, b, c = map(int, input().split())\r\n u, v = [0] * m2, [0] * m2\r\n for i in range(c + 1):\r\n for j in range(max(0, i - 1), min(c + 1, i + 2)):\r\n u[f(i, j)] = 1\r\n for i in range(0, m2, m + 1):\r\n v[i] = 1\r\n d, p = min(b, k) - a, 1\r\n while d:\r\n if d & p:\r\n v = matmul(u, v)\r\n d ^= p\r\n u = matmul(u, u)\r\n p <<= 1\r\n dp0 = [0] * m\r\n for i in range(c + 1):\r\n dpi = 0\r\n for j in range(c + 1):\r\n dpi += v[f(i, j)] * dp[j] % mod\r\n dp0[i] = dpi % mod\r\n dp = dp0\r\nans = dp[0]\r\nprint(ans)" ]

[ "n=int(input())\r\nl=[]\r\ns=0\r\nif n%2:\r\n l=[1]\r\n s=1\r\nwhile s<n:\r\n l.append(s+2)\r\n l.append(s+1)\r\n s+=2\r\nprint(*l)", "a = int(input())\nfor x in range(2, a+1):\n print(x, end=\" \")\nprint(1)\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\nprint(*([n] + list(range(1, n))))\r\n", "n = int(input())\r\nlst = []\r\nif n % 2:\r\n lst.append(1)\r\n for i in range(2, n, 2):\r\n lst.append(i+1)\r\n lst.append(i)\r\nelse:\r\n for i in range(1, n, 2):\r\n lst.append(i+1)\r\n lst.append(i)\r\n \r\nprint(' '.join(map(str,lst)))\r\n", "print(*range(2, int(input())+1), end=' ')\nprint(1)\n", "n=int(input())\r\nans=[i for i in range(2,n+1)]+[1]\r\nprint(*ans)", "n=eval(input())\r\nfor i in range(2,n+1):\r\n\tprint(\"{} \".format(i),end=\"\")\r\nprint(1)", "'''\r\nBeezMinh\r\n14:54 UTC+7\r\n24/07/2023\r\n'''\r\nn = int(input()) \r\narr = [i + 2 for i in range(n - 1)] \r\narr.append(1) \r\nprint(*arr)", "n, ans, be = int(input()), [], 1\r\nif n & 1:\r\n ans.append(1)\r\n be += 1\r\n\r\nfor i in range(be, n + 1, 2):\r\n ans.extend([i + 1, i])\r\n\r\nprint(*ans)\r\n", "n = int(input())\r\nA = []\r\nfor i in range(2, n + 1):\r\n A.append(i)\r\nA.append(1)\r\n\r\nprint(' '.join(str(x) for x in A))", "print(*range(2,int(input())+1),1)", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\nans = [(i - 1) % n + 1 for i in range(n)]\r\nsys.stdout.write(\" \".join(map(str, ans)))", "n= int(input()) ; arr=[i+2 for i in range(n-1)] ;arr.append(1) ; print(*arr)\r\n", "print(\" \".join([str(x) for x in range(2,int(input())+1)]+[\"1\"]))", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\nprint(str(n) + ' ' + ' '.join([str(i) for i in range(1, n)]))", "# can't believe\r\ndef out(a):\r\n for i in range(a, n, 2):\r\n print(i+2, i+1, end=' ')\r\n\r\n\r\nn = int(input())\r\nif n & 1:\r\n print(1, end=' ')\r\n out(1)\r\nelse:\r\n out(0)\r\n", "n = int(input())\r\nif n%2 :\r\n print(1,end=\" \")\r\n for i in range(1,n,2):\r\n print(i+2,i+1,end=\" \")\r\nelse :\r\n for i in range(0,n,2) :\r\n print(i+2,i+1,end=\" \")" ]

[ "n, k1, k2 = map(int, input().split())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\nc = [0]*n\r\nfor i in range(n):\r\n c[i] = abs(a[i] - b[i])\r\nk = k1 + k2\r\nwhile k != 0:\r\n max_value = c[0]\r\n max_index = 0\r\n for i, v in enumerate(c):\r\n if v > max_value:\r\n max_value = v\r\n max_index = i\r\n if max_value == 0:\r\n break\r\n else:\r\n c[max_index] -= 1\r\n k -= 1\r\nif k == 0:\r\n sum = 0\r\n for i in range(n):\r\n sum += c[i]*c[i]\r\n print(sum)\r\nelse:\r\n if k % 2 == 0:\r\n print(0)\r\n else:\r\n print(1)", "n, k1, k2 = map(int, input().split())\narr1 = list(map(int, input().split()))\narr2 = list(map(int, input().split()))\na = []\nk = 0\nfor i in range(n):\n\ta.append(abs(arr1[i]-arr2[i]))\n\tk += a[i]\nif k<=(k1+k2):\n\tprint((k-k1-k2)%2)\nelse:\n\tfor j in range(k1+k2):\n\t\tm = 0\n\t\tfor x in range(n):\n\t\t\tif a[x]>m:\n\t\t\t\ti = x\n\t\t\t\tm = a[x]\n\t\ta[i] -= 1\n\tans = 0\n\tfor i in range(n):\n\t\tans += (a[i]*a[i])\n\tprint(ans)\n", "n, x, y=[int(k) for k in input().split()]\r\nw=[int(k) for k in input().split()]\r\nz=[int(k) for k in input().split()]\r\nq=[abs(w[k]-z[k]) for k in range(n)]\r\nlength=2**len(bin(len(q))[2:])\r\neta=[0 for k in range(2*length-1)]\r\nfor j in range(n):\r\n eta[length-1+j]=q[j]\r\n\r\ndef upward(u, k):\r\n if k>length-1:\r\n return u[k-1]\r\n else:\r\n u[k-1]=max(upward(u, 2*k), upward(u, 2*k+1))\r\n return u[k-1]\r\n \r\ndef findmax(u, k):\r\n if k>length-1:\r\n u[k-1]-=1\r\n return k-1\r\n else:\r\n if u[2*k-1]>=u[2*k]:\r\n return findmax(u, 2*k)\r\n else:\r\n return findmax(u, 2*k+1)\r\n \r\ndef update(u, k):\r\n while k>1:\r\n k//=2\r\n u[k-1]=max(u[2*k-1], u[2*k])\r\n \r\n#upward(eta, 1)\r\n\r\n#print(eta)\r\n\r\n#zxc=findmax(eta, 1)\r\n\r\n#print(eta)\r\n\r\n#update(eta, zxc+1)\r\n\r\n#print(eta)\r\n\r\nupward(eta, 1)\r\n\r\nfor j in range(x+y):\r\n if eta[0]==0:\r\n print((x+y-j)%2)\r\n break\r\n else:\r\n zxc=findmax(eta, 1)\r\n update(eta, zxc+1)\r\nelse:\r\n res=0\r\n for k in eta[length-1:]:\r\n res+=k**2\r\n print(res)\r\n#print(eta)", "from math import *\r\nn,k1,k2=map(int,input().split())\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\nm=0\r\nc=[]\r\ns=k1+k2\r\nfor i in range(n):\r\n c.append((a[i]-b[i])*(a[i]-b[i]))\r\nm=sum(c)\r\nwhile((s)):\r\n s-=1\r\n ma=c.index(max(c))\r\n c[ma]= (sqrt(c[ma])-1)*(sqrt(c[ma])-1)\r\nprint(int(sum(c)))\r\n", "import sys\r\ninpu = sys.stdin.buffer.readline\r\nprin = sys.stdout.write\r\nfrom heapq import *\r\nn, k1, k2 = map(int, inpu().split())\r\na = list(map(int, inpu().split()))\r\nb = list(map(int, inpu().split()))\r\nop = k1 + k2\r\nh = []\r\nfor i in range(n) :\r\n heappush(h, -abs(a[i] - b[i]))\r\nwhile op > 0 :\r\n if h[0] == 0 and op > 1 :\r\n op &= 1\r\n continue\r\n x = heappop(h)\r\n new = x + 1\r\n if x == 0:\r\n new = -1\r\n op -= 1\r\n heappush(h, new)\r\nans = 0\r\nfor i in h:\r\n ans += pow(i, 2)\r\nprin(str(ans) + '\\n')", "import heapq\r\nn,k1,k2=list(map(int,input().split()))\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\nc=[]\r\nfor i in range(n):\r\n c.append(-1*abs(a[i]-b[i]))\r\nheapq.heapify(c)\r\ne=1\r\nfor i in range(k1+k2):\r\n if c[0]<0:\r\n heapq.heapreplace(c,(c[0]+1))\r\n e=1\r\n elif c[0]==0:\r\n print(((k1+k2)-i)%2)\r\n e=0\r\n break\r\nif e==1: \r\n s=0\r\n for i in range(n):\r\n s=s+c[i]**2\r\n print(s)", "R = lambda: map(int, input().split())\r\n\r\nn, k1, k2 = R()\r\nk = k1 + k2\r\nA = list(R())\r\nB = tuple(R())\r\nfor i in range(n): A[i] = abs(A[i] - B[i])\r\nfor _ in range(k):\r\n idx = A.index(max(A))\r\n A[idx] = abs(A[idx] - 1)\r\ns = 0\r\nfor a in A: s += a*a\r\nprint(s)\r\n", "n, p1, p2 = map(int, input().split())\r\nA = list(map(int, input().split()))\r\nB = list(map(int, input().split()))\r\nw = [0] * (n + 1)\r\n\r\nfor i in range(1, n + 1):\r\n w[i] = abs(A[i - 1] - B[i - 1])\r\n\r\ns = sum(w)\r\n\r\nif s < p1 + p2:\r\n print((p1 + p2 + s) % 2)\r\nelse:\r\n for i in range(1, p1 + p2 + 1):\r\n M = -1\r\n pv = -1\r\n for j in range(1, n + 1):\r\n if M < w[j]:\r\n M = w[j]\r\n pv = j\r\n w[pv] -= 1\r\n\r\n s = 0\r\n for i in range(1, n + 1):\r\n s += w[i] * w[i]\r\n\r\n print(s)# 1698074694.87353", "n, k1, k2 = [int(x) for x in input().split()]\r\narrA = [int(x) for x in input().split()]\r\narrB = [int(x) for x in input().split()]\r\ndiffs = [abs(a-b) for a, b in zip(arrA, arrB)]\r\nfor i in range(k1 + k2):\r\n diffs = sorted(diffs)\r\n diffs[-1] = abs(diffs[-1] - 1)\r\nprint(sum([a*a for a in diffs]))", "n, k1, k2 = map(int, input().split())\na = list(map(int, input().split()))\nb = list(map(int, input().split()))\n\nans = [abs(x-y) for x, y in zip(a, b)]\nans.sort()\nfor i in range(k1+k2):\n ans[-1] = abs(ans[-1] - 1)\n j = -1\n while j > -n and ans[j] < ans[j-1]:\n ans[j], ans[j-1] = ans[j-1], ans[j]\n j -= 1\n\nans = sum(map(lambda x: x*x, ans))\nprint (ans)\n", "R = lambda: map(int,input().split())\nn,k,l = R()\na = [abs(x-y) for x,y in zip(R(),R())]\nfor _ in range(k+l):\n a.sort()\n a[-1]=abs(a[-1]-1)\nprint(sum(i*i for i in a))\n", "import heapq\r\nn,k1,k2 = map(int,input().split())\r\na=list(map(int,input().split()))[:n]\r\nb=list(map(int,input().split()))[:n]\r\ntotal=k1+k2\r\narr=[]\r\nfor i in range(n):\r\n arr.append((-1)*abs(a[i]-b[i]))\r\nheapq.heapify(arr)\r\nwhile(total>0):\r\n item=(-1)*(heapq.heappop(arr))\r\n heapq.heappush(arr,(-1)*abs(item-1))\r\n total-=1\r\nans=0\r\nfor i in range(len(arr)):\r\n ans+=(arr[i])**2\r\nprint(ans)", "p= lambda: map(int, input().split())\r\nn,k,l=p();a=[abs(x-y) for x,y in zip(list(p()),list(p()))]\r\nfor _ in range(k+l):\r\n d=a.index(max(a));a[d]=abs(a[d]-1)\r\nprint(sum(i*i for i in a ))", "n, k1, k2 = map(int, input().strip().split())\r\na = list(map(int, input().strip().split()))\r\nb = list(map(int, input().strip().split()))\r\n\r\ndef process(s, t, k):\r\n while k > 0:\r\n dmax = 0\r\n maxi = -1\r\n for i in range(n):\r\n if abs(s[i] - t[i]) >= dmax:\r\n dmax = abs(s[i] - t[i])\r\n maxi = i\r\n if s[maxi] >= t[maxi]:\r\n s[maxi] -= 1\r\n else:\r\n s[maxi] += 1\r\n k -= 1\r\n\r\nprocess(a, b, k1)\r\nprocess(b, a, k2)\r\nres = 0\r\nfor i in range(n):\r\n res += (a[i] - b[i])**2\r\nprint(res)", "n,k1,k2 = map(int,input().split())\r\nA = list(map(int,input().split()))\r\nB = list(map(int,input().split()))\r\nZ = []\r\na = k1 + k2 \r\nfor i in range(n):\r\n Z.append(abs(A[i]-B[i]))\r\nZ.sort()\r\nfor i in range(a):\r\n Z[-1] = abs(Z[-1]-1)\r\n Z.sort()\r\nans = 0 \r\nfor i in range(n):\r\n ans += Z[i]*Z[i]\r\nprint(ans)", "\"\"\"\r\nCode of Ayush Tiwari\r\nCodeforces: servermonk\r\nCodechef: ayush572000\r\n\r\n\"\"\"\r\nimport sys\r\ninput = sys.stdin.buffer.readline\r\n\r\ndef solution():\r\n n,x,y=map(int,input().split())\r\n a=list(map(int,input().split()))\r\n b=list(map(int,input().split()))\r\n c=[]\r\n for i in range(n):\r\n z=abs(a[i]-b[i])\r\n c.append(z)\r\n i=0\r\n z=x+y\r\n for i in range(z):\r\n c.sort(reverse=True)\r\n c[0]=abs(c[0]-1)\r\n for i in range(n):\r\n c[i]*=c[i]\r\n print(sum(c))\r\n\r\n\r\n\r\nsolution()", "inp= lambda: map(int, input().split())\r\nn,k1,k2=inp()\r\na=[abs(x-y) for x,y in zip(list(inp()),list(inp()))]\r\nfor i in range(k1+k2):\r\n id=a.index(max(a))\r\n a[id]=abs(a[id]-1)\r\nprint(sum(i**2 for i in a ))", "R=lambda:map(int, input().split())\r\nn,k,l=R();a=list(R());b=list(R());k+=l\r\ne=[abs(a[i]-b[i]) for i in range(n)]\r\nfor i in range(k):e.sort();e[-1]=abs(e[-1]-1) \r\nprint(sum([x*x for x in e]))", "# n=int(input())\r\n# n,k=map(int,input().split())\r\n# arr=list(map(int,input().split()))\r\n#for i in range(m):\r\nn,k1,k2=map(int,input().split())\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\ndiff=[abs(a[i]-b[i]) for i in range(n)]\r\nmoves=k1+k2\r\ndiff.sort()\r\nwhile moves>0 and diff!=[0]*n:\r\n diff[-1]-=1\r\n moves-=1\r\n diff.sort()\r\nif moves:\r\n if moves%2==0:\r\n print(0)\r\n else:\r\n print(1)\r\nelse:\r\n ans=0\r\n for i in range(n):\r\n ans+=diff[i]**2\r\n print(ans)\r\n\r\n print()", "n,oa,ob = map(int,input().split())\r\na = list(map(int,input().split()))\r\nb = list(map(int,input().split()))\r\ndiff = []\r\nfor i,j in zip(a,b):\r\n\tdiff.append(abs(i-j))\r\nk = oa+ob\r\nwhile k >0:\r\n\tdiff.sort()\r\n\tif diff[len(diff)-1] == 0:\r\n\t\tbreak\r\n\tdiff[len(diff)-1] = diff[len(diff)-1] - 1\r\n\tk = k-1\r\nif k&1 == 1:\r\n\tprint(1)\r\nelse:\r\n\tans = [i**2 for i in diff]\r\n\tprint(sum(ans))\r\n", "n, k1, k2 = map(int, input().split())\r\na1 = list(map(int, input().split()))\r\na2 = list(map(int, input().split()))\r\n\r\ngap = [abs(a1[i] - a2[i]) for i in range(n)]\r\n\r\nfor k in range(k1 + k2):\r\n gap[gap.index(max(gap))] = abs(max(gap) - 1)\r\n\r\nprint(sum(i * i for i in gap))", "import heapq\r\nimport sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\nn, k1, k2 = map(int, input().split())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\nk = k1 + k2\r\nh = []\r\nfor i, j in zip(a, b):\r\n heapq.heappush(h, -abs(i - j))\r\nwhile k and h[0]:\r\n k -= 1\r\n x = heapq.heappop(h)\r\n heapq.heappush(h, x + 1)\r\nans = 0\r\nfor i in h:\r\n ans += i * i\r\nif k % 2:\r\n ans += 1\r\nprint(ans)", "from math import *\r\nn,k,k1=map(int,input().split())\r\nA=list(map(int,input().split()))\r\nB=list(map(int,input().split()))\r\nm=0\r\nd=[]\r\ns=k1+k\r\n\"\"\"append\"\"\"\r\nfor i in range(n):\r\n d.append((A[i]-B[i])**2)\r\nm=sum(d)\r\nwhile((s)):\r\n s-=1\r\n ind=d.index(max(d))\r\n d[ind]= (sqrt(d[ind])-1)**2\r\nprint(int(sum(d)))", "R=lambda:map(int,input().split())\r\nn,k,l=R()\r\na=[abs(x-y)for x,y in zip(R(),R())]\r\nfor _ in[0]*(k+l):\r\n a.sort();a[-1]=abs(a[-1]-1)\r\nprint(sum(i*i for i in a))", "from collections import defaultdict as dd, deque\n\nn,k1,k2 = map(int,input().split())\nk = k1+k2\n\nA = [int(x) for x in input().split()]\nB = [int(x) for x in input().split()]\n\nD = dd(int)\n\nfor i in range(n):\n D[abs(A[i]-B[i])] += 1\n\nx = sorted([[k,v] for k,v in D.items()], reverse=True)\n\nops = 0\ni = 0\nwhile x[i][0]>0:\n if i<len(x)-1:\n if x[i][0]==x[i+1][0]:\n x[i+1][1] += x[i][1]\n x[i][1] = 0 # oops\n i += 1\n diff,cnt = x[i]\n if k - ops >= cnt:\n x[i][0] -= 1\n ops += cnt\n else:\n x.append((diff-1,k-ops))\n x[i][1] -= k-ops\n ops += k-ops\n break\n\nif ops!=k:\n print(1 if (k-ops)%2 else 0)\nelse:\n ans = 0\n for diff,cnt in x:\n ans += cnt*(diff)**2\n print(ans)\n", "import heapq\n\n\ndef read():\n return [int(v) for v in input().split()]\n\n\ndef main():\n n, k1, k2 = read()\n k = k1 + k2\n a = read()\n b = read()\n c = [-abs(a - b) for (a, b) in zip(a, b)]\n heapq.heapify(c)\n while k:\n top = heapq.heappop(c)\n if top < 0:\n top += 1\n heapq.heappush(c, top)\n else:\n break\n k -= 1\n if k > 0:\n print(k%2)\n return\n print(sum(a*a for a in c))\n\n\nif __name__ == '__main__':\n main()\n", "from heapq import heappop,heapify,heappush\r\nn,c1,c2=[int(n) for n in input().split()]\r\narr=[int(item) for item in input().split()]\r\nbrr=[int(item) for item in input().split()]\r\nc=c1+c2\r\ncrr=[]\r\nfor i in range(n):\r\n crr.append(abs(arr[i]-brr[i]))\r\ncount=0\r\nfor i in range(c):\r\n r=crr.index(max(crr))\r\n crr[r]=abs(crr[r]-1)\r\nfor j in crr:\r\n count=count+j*j\r\nprint(count) \r\n\r\n \r\n \r\n \r\n \r\n", "n,k1,k2=[int(i) for i in input().split()]\r\na=[int(i) for i in input().split()]\r\nb=[int(i) for i in input().split()]\r\nx=[abs(a[i]-b[i]) for i in range(n)]\r\n\r\nfor i in range(k1+k2):\r\n x.sort()\r\n # print(x)\r\n x[n-1]=abs(x[n-1]-1)\r\nz=0\r\nfor i in x: z+=(i*i)\r\nprint(z)", "n, k1, k2 = map(int, input().split())\na1 = list(map(int, input().split()))\na2 = list(map(int, input().split()))\n\ne = []\nfor i in range(n):\n e.append(abs(a1[i]-a2[i]))\n#print(e)\n\nfor k in range(k1+k2):\n e[e.index(max(e))] = abs(max(e) - 1)\n\nprint(sum(i * i for i in e))", "N,K1,K2=map(int,input().split())\r\nA,B=[*map(int,input().split())],[*map(int,input().split())]\r\n\r\nfor i in range(K1):\r\n max_pos,max_diff=-1,0\r\n for j in range(N):\r\n if abs(A[j]-B[j])>=max_diff:\r\n max_pos,max_diff=j,abs(A[j]-B[j])\r\n if A[max_pos]>=B[max_pos]: A[max_pos]-=1\r\n else: A[max_pos]+=1\r\n\r\nfor i in range(K2):\r\n max_pos,max_diff=-1,0\r\n for j in range(N):\r\n if abs(A[j]-B[j])>=max_diff:\r\n max_pos,max_diff=j,abs(A[j]-B[j])\r\n if B[max_pos]>=A[max_pos]: B[max_pos]-=1\r\n else: B[max_pos]+=1\r\n\r\nans=0\r\nfor i in range(N):\r\n ans+=(A[i]-B[i])**2\r\nprint(ans)", "n,k1,k2=[int(x) for x in input().split()]\r\nk=k1+k2\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\narr=list()\r\nfor i in range(n):\r\n arr.append(abs(a[i]-b[i]))\r\nfor i in range(k):\r\n idx=arr.index(max(arr))\r\n arr[idx]=abs(arr[idx]-1)\r\nans=0\r\nfor i in arr:\r\n ans+=(i**2)\r\nprint(ans)", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Mon Oct 19 22:22:28 2020\r\n\r\n@author: Dark Soul\r\n\"\"\"\r\nfrom queue import PriorityQueue\r\n[n,k1,k2]=list(map(int,input().split()))\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\n\r\ndiff=PriorityQueue()\r\nfor i in range(n):\r\n diff.put(-1*abs(a[i]-b[i]))\r\nwhile k1:\r\n x=diff.get()\r\n if x==0:\r\n diff.put(0)\r\n break\r\n diff.put(x+1)\r\n k1-=1\r\nwhile k2:\r\n x=diff.get()\r\n if x==0:\r\n diff.put(0)\r\n break\r\n diff.put(1+x)\r\n k2-=1\r\nans=0\r\nflag=0\r\nif (k1+k2)%2:\r\n flag=1\r\nfor i in range(n):\r\n x=diff.get()\r\n if i==n-1 and flag:\r\n x+=1\r\n ans+=x*x\r\nprint(ans)\r\n \r\n \r\n \r\n \r\n \r\n ", "\r\nn,k1,k2=map(int,input().split())\r\nl=[]\r\nk=k1+k2\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\nfor i in range(n):\r\n\tl.append(abs(a[i]-b[i]))\r\nans=0\r\nfor i in range(k):\r\n\tl.sort()\r\n\tif l[-1]>0:\r\n\t\tl[-1]-=1\r\n\telse:\r\n\t\tl[-1]+=1\r\nfor i in l:\r\n\tans+=(i)**2\r\nprint(ans)", "import math\r\n\r\nn, k1, k2 = map(int, input().split())\r\nA = list(map(int, input().split()))\r\nB = list(map(int, input().split()))\r\nC = [int(math.fabs(A[i] - B[i])) for i in range(n)]\r\n\r\nfor _ in range(k1):\r\n\ti = C.index(max(C))\r\n\tif A[i] > B[i]:\r\n\t\tA[i] -= 1\r\n\t\tC[i] -= 1\r\n\telif A[i] < B[i]:\r\n\t\tA[i] += 1\r\n\t\tC[i] -= 1\r\n\telse:\r\n\t\tA[i] += 1\r\n\t\tC[i] += 1\r\n\t\r\nfor _ in range(k2):\r\n\ti = C.index(max(C))\r\n\tif A[i] > B[i]:\r\n\t\tB[i] += 1\r\n\t\tC[i] -= 1\r\n\telif A[i] < B[i]:\r\n\t\tB[i] -= 1\r\n\t\tC[i] -= 1\r\n\telse:\r\n\t\tB[i] += 1\r\n\t\tC[i] += 1\r\n\r\nsoma = 0\r\nfor i in range(n):\r\n\tsoma += (A[i] - B[i])**2\r\nprint(soma)", "n,a,b=map(int,input().split())\r\nw=a+b\r\nl=list(map(int,input().split()))\r\nl1=list(map(int,input().split()))\r\nL=[]\r\nfor i in range(n) :\r\n L.append([abs(l[i]-l1[i]),i])\r\nfor i in range(w) :\r\n q=max(L,key=lambda x :x[0])\r\n if q[0]==0 :\r\n if (w-i)%2==0 :\r\n print(0)\r\n else :\r\n print(1)\r\n exit()\r\n L[q[1]]=[q[0]-1,q[1]]\r\nans=0\r\nfor i in range(n) :\r\n ans+=L[i][0]*L[i][0]\r\nprint(ans)\r\n \r\n \r\n \r\n", "n,m,k = [int(i) for i in input().split()]\r\nk=k+m\r\na = [int(i) for i in input().split()]\r\nb = [int(i) for i in input().split()]\r\nc = [abs(a[i]-b[i]) for i in range(n)]\r\nwhile k != 0:\r\n\tc.sort()\r\n\tc[-1] = abs(c[-1]-1)\r\n\tk-=1\t\r\nt = 0\r\nfor i in range(n):\r\n\tt+=c[i]*c[i]\r\nprint(t)\r\n", "R=lambda:map(int,input().split())\nn,k,l=R()\na=[abs(x-y)for x,y in zip(R(),R())]\nfor _ in[0]*(k+l):\n a.sort();a[-1]=abs(a[-1]-1)\nprint(sum(i*i for i in a))\n\t\t \t\t \t \t \t\t \t \t \t\t", "n, k1, k2 = map(int, input().split())\nA = [int(x) for x in input().split()]\nB = [int(x) for x in input().split()]\n\nda = []\nfor i in range(len(A)):\n da.append(abs(A[i]-B[i]))\n\nda.sort(reverse=1)\nop = k1 + k2\n\nwhile op:\n if all(x == 0 for x in da):\n if op % 2 == 0:\n print(0)\n exit()\n else:\n print(1)\n exit()\n \n da[da.index(max(da))] -= 1\n op -= 1\n\nprint(sum(x ** 2 for x in da))\n", "n, k1, k2 = map(int, input().split())\r\nA = list(map(int, input().split()))\r\nB = list(map(int, input().split()))\r\n\r\ndiff = [abs(i-j) for i, j in zip(A, B)]\r\nfor i in range(k1):\r\n pos = diff.index(max(diff))\r\n if(diff[pos]!=0):\r\n diff[pos]-=1\r\n if(A[pos]>B[pos]):\r\n A[pos]-=1\r\n else:\r\n A[pos]+=1\r\n else:\r\n if((k1-i)%2==1):\r\n diff[pos]+=1\r\n A[pos]+=1\r\n break\r\n\r\nfor i in range(k2):\r\n pos = diff.index(max(diff))\r\n if(diff[pos]!=0):\r\n diff[pos]-=1\r\n if(B[pos]>A[pos]):\r\n B[pos]-=1\r\n else:\r\n B[pos]+=1\r\n else:\r\n if((k2-i)%2==1):\r\n diff[pos]+=1\r\n B[pos]+=1\r\n break\r\n\r\nprint(sum(map(lambda x: x*x, diff)))", "n, k1, k2 = [int(x) for x in input().split()]\na = [int(x) for x in input().split()]\nb = [int(x) for x in input().split()]\nd = [abs(a[i] - b[i]) for i in range(n)]\nfor i in range(k1):\n ind = d.index(max(d))\n d[ind] = abs(d[ind] - 1)\nfor i in range(k2):\n ind = d.index(max(d))\n d[ind] = abs(d[ind] - 1)\ns = 0\nfor i in range(n):\n s += d[i] ** 2\nprint(s)", "import operator\r\n\r\nn,k1,k2=map(int, input().split())\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\ndiff=list(map(operator.sub,a,b))\r\ndiff=list(map(abs,diff))\r\nn=len(diff)-1\r\ndiff.sort()\r\n\r\nop=k1+k2\r\nwhile op>0:\r\n if diff[n]>0:\r\n diff[n]-=1\r\n else:\r\n diff[n]+=1\r\n if diff[n]<diff[n-1]:\r\n diff.sort()\r\n op-=1\r\nerror_sum=0\r\nfor i in range(len(diff)):\r\n error_sum+=diff[i]*diff[i]\r\nprint(error_sum)\r\n", "def decrease_max(C, D):\n mx = (-1, -1)\n for i, e in enumerate(abs(c - d) for c, d in zip(C, D)):\n if e > mx[1]:\n mx = (i, e)\n i = mx[0]\n if C[i] > D[i]:\n C[i] -= 1\n else:\n C[i] += 1\n\ndef solution(k1, k2, A, B):\n for _ in range(k1):\n decrease_max(A, B)\n for _ in range(k2):\n decrease_max(B, A)\n return sum((a - b)**2 for a, b in zip(A, B))\n\nn, k1, k2 = map(int, input().split())\nA = list(map(int, input().split()))\nB = list(map(int, input().split()))\nprint(solution(k1, k2, A, B), end=\"\")\n", "n, k1, k2 = map(int, input().split())\na = list(map(int, input().split()))\nb = list(map(int, input().split()))\n\ne = []\n\nfor ai, bi in zip(a, b):\n\te.append(pow(ai - bi, 2))\n\nfor i in range(k1):\n\t pos = e.index(max(e))\n\t if a[pos] <= b[pos]:\n\t \ta[pos] += 1\n\t else:\n\t \ta[pos] -= 1\n\t e[pos] = (pow(a[pos] - b[pos], 2))\n\nfor i in range(k2):\n\t pos = e.index(max(e))\n\t if b[pos] <= a[pos]:\n\t \tb[pos] += 1\n\t else:\n\t \tb[pos] -= 1\n\t e[pos] = (pow(a[pos] - b[pos], 2))\n\nprint(sum(e))\n", "n,k1,k2=[int(i) for i in input().split()]\r\na=[int(i) for i in input().split()]\r\nb=[int(i) for i in input().split()]\r\nx=[abs(a[i]-b[i]) for i in range(n)]\r\n\r\nfor i in range(k1+k2):\r\n x.sort(reverse=True)\r\n # print(x)\r\n x[0]=abs(x[0]-1)\r\nz=0\r\nfor i in x: z+=(i*i)\r\nprint(z)", "n, k1, k2 = map(int, input().split())\r\nA = list(map(int, input().split()))\r\nB = list(map(int, input().split()))\r\nimport heapq\r\nq = []\r\nheapq.heapify(q)\r\nfor a, b in zip(A, B):\r\n c = abs(a-b)\r\n heapq.heappush(q, -c)\r\nk = k1+k2\r\nfor i in range(k):\r\n cur = heapq.heappop(q)\r\n cur *= (-1)\r\n heapq.heappush(q, -abs(cur-1))\r\nans = 0\r\nwhile q:\r\n cur = heapq.heappop(q)\r\n cur *= (-1)\r\n ans += cur**2\r\nprint(ans)\r\n", "import heapq\n\nn, k1, k2 = list(map(int, input().strip().split()))\na = list(map(int, input().strip().split()))\nb = list(map(int, input().strip().split()))\n\nerr = [abs(x-y) for x,y in zip(a,b)]\n\nif k1+k2 >= sum(err):\n print((k1+k2-sum(err))%2)\n\nelse:\n\n moves = k1+k2\n err = [-a for a in err]\n heapq.heapify(err)\n\n while moves:\n x = heapq.heappop(err)\n x += 1\n heapq.heappush(err, x)\n moves -= 1\n\n print(sum([x**2 for x in err]))\n", "#!/usr/bin/env python3\n\nimport sys\n\n[n, k1, k2] = map(int, sys.stdin.readline().strip().split())\nais = list(map(int, sys.stdin.readline().strip().split()))\nbis = list(map(int, sys.stdin.readline().strip().split()))\n\nk = k1 + k2\ncis = [abs(ai - bi) for ai, bi in zip(ais, bis)]\ncis.sort(reverse=True)\ncis.append(0)\n\ns = 0\ni = 1\ndone = False\nwhile i < n + 1: # 0 at the end appended\n\ts += i * (cis[i - 1] - cis[i])\n\tif s >= k:\n\t\tdone = True\n\t\tbreak\n\ti += 1\n\nif not done:\n\tif (k - s) % 2 == 0:\n\t\tprint (0)\n\telse:\n\t\tprint (1)\nelse:\n\td = s - k\n\th = d // i\n\tn1 = d % i\n\tn0 = i - n1\n\tprint (sum(ci**2 for ci in cis[i:]) + n0 * (cis[i] + h)**2 + n1 * (cis[i] + h + 1)**2)\n\n", "n, k1, k2 = map(int, input().split())\narr1 = list(map(int, input().split()))\narr2 = list(map(int, input().split()))\na = []\nfor i in range(n):\n\ta.append(abs(arr1[i]-arr2[i]))\n\nfor j in range(k1+k2):\n\tm = 0\n\tfor x in range(n):\n\t\tif a[x]>m:\n\t\t\ti = x\n\t\t\tm = a[x]\n\ta[i] = abs(a[i]-1)\nans = 0\nfor i in range(n):\n\tans += (a[i]*a[i])\nprint(ans)\n", "import heapq\r\nn, k1, k2 = map(int, input().split())\r\nlist1 = list(map(int, input().split()))\r\nlist2 = list(map(int, input().split()))\r\ndis = []\r\n\r\nfor i in range(n):\r\n dis.append(0 - abs(list1[i]-list2[i]))\r\n\r\nheapq.heapify(dis)\r\n\r\n# print(dis)\r\nnum = k1 + k2\r\n\r\nwhile num > 0 :\r\n tmp = heapq.heappop(dis)\r\n if(tmp == 0):\r\n break\r\n tmp += 1\r\n heapq.heappush(dis, tmp)\r\n num -= 1\r\n\r\nif(num > 0):\r\n if(num % 2 == 1):\r\n print(1)\r\n else:\r\n print(0)\r\nelse:\r\n num = 0\r\n for i in dis:\r\n num += i**2\r\n print(num)\r\n\r\n\r\n\r\n", "n, k, l = map(int, input().split())\na = list(map(int, input().split()))\nb = list(map(int, input().split()))\n\nd = [abs(x - y) for x, y in zip(a, b)]\n\nmoves = k + l\n\nd.sort()\nd.reverse()\n\nwhile moves > 0:\n if d[0] == 0:\n print(moves%2)\n break\n\n d[0] -= 1\n\n c = 0\n\n while c < n - 1 and d[c] < d[c + 1]:\n d[c], d[c + 1] = d[c + 1], d[c]\n c += 1\n\n moves -= 1\nelse:\n print(sum([x**2 for x in d]))", "n,k1,k2=map(int,input().split())\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\nc=[]\r\nfor i in range(n):\r\n\tc.append(abs(a[i]-b[i]))\r\nfor i in range(k1+k2):\r\n\tk=-1\r\n\tmax1=0\r\n\tfor j in range(n):\r\n\t\tif(c[j]>max1):\r\n\t\t\tmax1=c[j]\r\n\t\t\tk=j\r\n\tc[k]=abs(c[k]-1)\r\nsumx=0\r\nfor i in range(n):\r\n\tsumx+=c[i]**2\r\nprint(sumx)\r\n", "import operator\n\nn,k1,k2 = map(int,input().split(\" \"))\narrayA = list(map(int,input().split(\" \")))\narrayB = list(map(int,input().split(\" \")))\n\narraydiff = list(map(operator.sub,arrayA,arrayB))\narraydiff = list(map(abs,arraydiff))\n\nfor i in range(k1+k2):\n\tindex = arraydiff.index(max(arraydiff))\n\tif arraydiff[index] == 0:\n\t\tarraydiff[index] += 1\n\telse:\n\t\tarraydiff[index] -= 1\nprint(sum(map(lambda x:x*x,arraydiff)))\n\n\n", "R = lambda: map(int, input().split())\r\n\r\nn, k1, k2 = R()\r\na = [abs(x-y) for x,y in zip(R(), R())]\r\nfor _ in range(k1+k2):\r\n idx = a.index(max(a))\r\n a[idx] = abs(a[idx] - 1)\r\nprint(sum(x*x for x in a))\r\n", "n, k1, k2 = [int(x) for x in input().split()]\r\na = [int(x) for x in input().split()]\r\nb = [int(x) for x in input().split()]\r\n\r\nd = [-abs(x-y) for x, y in zip(a, b)]\r\n\r\nk = k1+k2\r\n\r\n# d.sort()\r\n\r\nimport heapq as hq\r\n\r\nhq.heapify(d)\r\n\r\nchained = 1\r\nans = -1\r\n\r\nwhile len(d) > 0:\r\n curr = -hq.heappop(d)\r\n next = -d[0] if len(d) > 0 else 0\r\n\r\n if k >= (curr-next) * chained:\r\n k -= (curr-next) * chained\r\n chained+=1\r\n continue\r\n\r\n # k is over:\r\n dd, m = k // chained, k % chained\r\n ans = (curr - dd - 1)**2 * m + (curr - dd)**2 * (chained - m)\r\n\r\n for x in d:\r\n ans += x**2\r\n break\r\nelse:\r\n ans = k % 2\r\nprint(ans)\r\n", "'''\r\nAuthor : Shubhanshu Jain;\r\n'''\r\n\r\nimport math\r\nimport random;\r\nmod =1000000007\r\nr1 = lambda : int(input());\r\nrm = lambda : map(int,input().split());\r\nrls = lambda : list(rm())\r\n\r\ndef maxi(ls):\r\n ans = 0;\r\n ind= 0;\r\n for i in range(len(ls)):\r\n if ls[i] >ans:\r\n ind = i;\r\n ans = ls[i];\r\n return ind;\r\n\r\nn,k1,k2= rm();\r\nls1 = rls();\r\nls2 = rls();\r\nans=[];\r\nfor i in range(n):\r\n ans.append(abs(ls1[i]-ls2[i]));\r\nfor i in range(k1+k2):\r\n x = maxi(ans);\r\n \r\n ans[x] = abs(ans[x]-1);\r\nret = 0;\r\n# print(ans)\r\nfor i in ans:\r\n ret+=i**2;\r\nprint(ret)", "from math import *\r\nn,k1,k2=map(int,input().split())\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\ndif=[]\r\nfor i in range(n):\r\n dif.append(abs(a[i]-b[i]))\r\ntot=k1+k2\r\ndif.sort(reverse=True)\r\nwhile tot>0 and dif[0]>0:\r\n dif[0]-=1\r\n tot-=1\r\n dif.sort(reverse=True)\r\nans=tot%2\r\nfor i in range(n):\r\n ans+=dif[i]**2\r\nprint(ans)\r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Wed Apr 29 08:47:00 2020\r\n\r\n@author: crisj\r\n\"\"\"\r\n\r\ndef minimo_error(n, movimientosA, movimientosB, A, B):\r\n \r\n distancias = []\r\n \r\n for pos in range(n):\r\n distancias.append(abs(A[pos] - B[pos]))\r\n \r\n while(movimientosA > 0 or movimientosB > 0):\r\n pos_max_dist = distancias.index(max(distancias))\r\n A_max = A[pos_max_dist]\r\n B_max = B[pos_max_dist]\r\n\r\n if abs(A_max) >= abs(B_max):\r\n if movimientosA > 0:\r\n if A_max > 0:\r\n A_max -= 1\r\n else:\r\n A_max += 1\r\n A[pos_max_dist] = A_max\r\n movimientosA -= 1\r\n else:\r\n if A_max > 0:\r\n B_max += 1\r\n else:\r\n B_max -= 1\r\n B[pos_max_dist] = B_max\r\n movimientosB -= 1\r\n \r\n distancias[pos_max_dist] = abs(A_max - B_max)\r\n continue\r\n \r\n elif abs(B_max) >= abs(A_max):\r\n if movimientosB > 0:\r\n if B_max > 0:\r\n B_max -= 1\r\n else:\r\n B_max += 1\r\n B[pos_max_dist] = B_max\r\n movimientosB -= 1\r\n else:\r\n if B_max > 0:\r\n A_max += 1\r\n else:\r\n A_max -= 1\r\n A[pos_max_dist] = A_max\r\n movimientosA -= 1\r\n \r\n distancias[pos_max_dist] = abs(A_max - B_max)\r\n \r\n error = 0\r\n for pos in range(n):\r\n error += (A[pos] - B[pos])**2\r\n return error\r\n \r\n\r\ndatos_matrices = list(map(lambda x: int(x), input().split(\" \")))\r\nA = list(map(lambda x: int(x), input().split(\" \")))\r\nB = list(map(lambda x: int(x), input().split(\" \")))\r\nprint(minimo_error(*datos_matrices, A, B))", "def solve(k1, k2, a, b):\n d = [abs(i - j) for i, j in zip(a, b)]\n e = sum(d)\n ops = (k1 + k2)\n diff = e - (ops)\n if diff <= 0:\n return abs(diff) % 2\n d.sort(reverse=True)\n while ops > 0:\n maxx = d[0]\n for i in range(len(d)):\n if d[i] == maxx:\n d[i] -= 1\n ops -= 1\n if ops == 0:\n break\n return sum(x**2 for x in d)\n\n\nif __name__ == '__main__':\n _, k1, k2 = map(int, input().split())\n a = list(map(int, input().split()))\n b = list(map(int, input().split()))\n print(solve(k1, k2, a, b))\n", "s = input().split()\r\nn, k1, k2 = int(s[0]), int(s[1]), int(s[2])\r\nk = k1+k2\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\ncl = []\r\nfor i in range(n):\r\n cl.append(abs(a[i]-b[i]))\r\nfor i in range(k):\r\n cl[cl.index(max(cl))] = abs(max(cl)-1)\r\n\r\nres = 0\r\nfor x in range(n):\r\n res+=cl[x]**2\r\n\r\nprint(res)", "f=lambda: map(int,input().split())\r\nn,k1,k2=f()\r\na,b=list(f()),list(f())\r\nc=[]\r\nk=k1+k2\r\nfor i in range(n):\r\n c.append(abs(a[i]-b[i]))\r\nfor i in range(k):\r\n c.sort()\r\n c[-1]=abs(c[-1]-1)\r\nprint( sum(x*x for x in c) )\r\n \r\n", "import os\r\nimport sys\r\nfrom io import BytesIO, IOBase\r\n\r\nBUFSIZE = 8192\r\n\r\n\r\nclass FastIO(IOBase):\r\n newlines = 0\r\n\r\n def __init__(self, file):\r\n self._fd = file.fileno()\r\n self.buffer = BytesIO()\r\n self.writable = 'x' in file.mode or 'r' not in file.mode\r\n self.write = self.buffer.write if self.writable else None\r\n\r\n def read(self):\r\n while True:\r\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\r\n if not b:\r\n break\r\n ptr = self.buffer.tell()\r\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\r\n self.newlines = 0\r\n return self.buffer.read()\r\n\r\n def readline(self):\r\n while self.newlines == 0:\r\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\r\n self.newlines = b.count(b'\\n') + (not b)\r\n ptr = self.buffer.tell()\r\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\r\n self.newlines -= 1\r\n return self.buffer.readline()\r\n\r\n def flush(self):\r\n if self.writable:\r\n os.write(self._fd, self.buffer.getvalue())\r\n self.buffer.truncate(0), self.buffer.seek(0)\r\n\r\n\r\nclass IOWrapper(IOBase):\r\n def __init__(self, file):\r\n self.buffer = FastIO(file)\r\n self.flush = self.buffer.flush\r\n self.writable = self.buffer.writable\r\n self.write = lambda s: self.buffer.write(s.encode('ascii'))\r\n self.read = lambda: self.buffer.read().decode('ascii')\r\n self.readline = lambda: self.buffer.readline().decode('ascii')\r\n\r\n\r\ndef inp():\r\n return sys.stdin.readline().rstrip()\r\n\r\n\r\ndef mpint():\r\n return map(int, inp().split(' '))\r\n\r\n\r\ndef itg():\r\n return int(inp())\r\n\r\n\r\n# ############################## import\r\nclass MaxHeapTransform(int):\r\n def __lt__(self, other):\r\n return self >= other\r\n\r\n\r\n# ############################## main\r\nfrom heapq import *\r\n\r\n\r\ndef main():\r\n n, k1, k2 = mpint()\r\n aa = list(mpint())\r\n bb = list(mpint())\r\n hp = [(MaxHeapTransform(abs(aa[i] - bb[i])), i) for i in range(n)]\r\n heapify(hp)\r\n\r\n for _ in range(k1):\r\n mx = heappop(hp)\r\n num, i = mx\r\n num = MaxHeapTransform(abs(num - 1))\r\n if aa[i] < bb[i]:\r\n aa[i] += 1\r\n else:\r\n aa[i] -= 1\r\n heappush(hp, (num, i))\r\n\r\n hp = [(MaxHeapTransform(abs(aa[i] - bb[i])), i) for i in range(n)]\r\n heapify(hp)\r\n\r\n for _ in range(k2):\r\n mx = heappop(hp)\r\n num, i = mx\r\n num = MaxHeapTransform(abs(num - 1))\r\n if bb[i] < aa[i]:\r\n bb[i] += 1\r\n else:\r\n bb[i] -= 1\r\n heappush(hp, (num, i))\r\n\r\n print(sum(((a - b) ** 2 for a, b in zip(aa, bb))))\r\n\r\n\r\nDEBUG = 0\r\nURL = ''\r\n\r\nif __name__ == '__main__':\r\n # 0: normal, 1: runner, 2: interactive, 3: debug\r\n if DEBUG == 1:\r\n import requests\r\n from ACgenerator.Y_Test_Case_Runner import TestCaseRunner\r\n\r\n runner = TestCaseRunner(main, URL)\r\n inp = runner.input_stream\r\n print = runner.output_stream\r\n runner.checking()\r\n else:\r\n if DEBUG != 3:\r\n sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)\r\n if DEBUG:\r\n _print = print\r\n\r\n\r\n def print(*args, **kwargs):\r\n _print(*args, **kwargs)\r\n sys.stdout.flush()\r\n main()\r\n# Please check!\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,k1,k2 = map(int,input().split())\r\n k = k1+k2\r\n a = list(map(int,input().split()))\r\n b = list(map(int,input().split()))\r\n diff = []\r\n for i in range(n):\r\n diff.append(abs(a[i]-b[i]))\r\n diff.sort(reverse = True)\r\n while k:\r\n val = diff.pop(0)\r\n diff.append(abs(val-1))\r\n diff.sort(reverse = True)\r\n k-=1\r\n ans = sum([x*x for x in diff])\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\r\n \r\n", "# Anuneet Anand\r\n \r\nn,a,b = map(int,input().split())\r\nA = list(map(int,input().split()))\r\nB = list(map(int,input().split()))\r\n \r\nS = [abs(A[i]-B[i]) for i in range(n)]\r\n \r\nfor i in range(a+b):\r\n\tS.sort()\r\n\tS[-1]=abs(S[-1]-1)\r\n \r\nx = [i*i for i in S]\r\nprint(sum(x))", "R = lambda: map(int, input().split())\r\nn, k1, k2 = R()\r\n\r\ndiff = [abs(x1 - x2) for x1, x2 in zip(R(), R())]\r\n\r\nfor _ in range(k1+k2):\r\n diff.sort()\r\n diff[-1] = abs(diff[-1] - 1)\r\n\r\nprint(sum(i ** 2 for i in diff))\r\n", "a,b,c=map(int,input().split())\r\nk=b+c\r\nx=list(map(int,input().split()))\r\ny=list(map(int,input().split()))\r\ni=0\r\nz=[]\r\nwhile i<len(x):\r\n z=z+[max(x[i],y[i])-min(x[i],y[i])]\r\n i=i+1\r\nz.sort()\r\ni=0\r\nwhile i<k:\r\n if z[len(z)-1]!=0:\r\n z[len(z)-1]=z[len(z)-1]-1\r\n else:\r\n if (k-i)%2==1:\r\n z=[1]\r\n break\r\n z.sort()\r\n i=i+1\r\ns=0\r\nfor elem in z:\r\n s=s+elem**2\r\nprint (s)", "from math import *\r\nimport sys\r\nimport random\r\nn,k1,k2=map(int,input().split())\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\narr=[]\r\nk=k2+k1\r\nfor i in range(n):\r\n arr.append((a[i]-b[i])*(a[i]-b[i]))\r\nwhile(k):\r\n maxi=arr.index(max(arr))\r\n #print((sum(d))) \r\n arr[maxi]= (sqrt(arr[maxi])-1)*(sqrt(arr[maxi])-1)\r\n k-=1\r\nprint(int(sum(arr)))", "import sys\ninput = sys.stdin.readline\nn,k1,k2 = map(int,input().split())\na = list(map(int,input().split()))\nb = list(map(int,input().split()))\nc = [abs(a[i]-b[i]) for i in range(n)]\nk = k1 + k2\nwhile k!=0:\n\tmaxx = 0\n\tfor i in c:\n\t\tmaxx = max(i,maxx)\n\tif maxx==0:\n\t\tbreak\n\tfor i in range(n):\n\t\tif c[i]==maxx:\n\t\t\tc[i] -= 1\n\t\t\tk -= 1\n\t\tif k==0:\n\t\t\tbreak\nans = 0\nfor i in c:\n\tans += i**2\nprint (ans+k%2)", "n, k1, k2 = map(int, input().split())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\nwhile k1 + k2 > 0:\r\n max_dif = -10000000000000\r\n ind = -1 \r\n for i in range(n):\r\n if (a[i] - b[i]) ** 2 > max_dif:\r\n max_dif = (a[i] - b[i]) ** 2\r\n ind = i\r\n if k1 != 0:\r\n k1 -= 1\r\n if a[ind] > b[ind]:\r\n a[ind] -= 1\r\n else:\r\n a[ind] += 1\r\n elif k2 != 0:\r\n k2 -= 1\r\n if b[ind] > a[ind]:\r\n b[ind] -= 1\r\n else:\r\n b[ind] += 1\r\nans = 0\r\nfor i in range(n):\r\n ans += (a[i] - b[i]) ** 2\r\nprint(ans)", "n, k1, k2 = map(int, input().split())\nA = list(map(int, input().split()))\nB = list(map(int, input().split()))\n\n\ndef just_relax():\n global gruz\n mam = 0\n ind = -1\n for i in range(n):\n if abs(A[i] - B[i]) > mam:\n mam = abs(A[i] - B[i])\n ind = i\n if ind != -1:\n if A[ind] < B[ind]:\n A[ind] += 1\n else:\n A[ind] -= 1\n else:\n gruz = 1\n\n\ngruz = 0\nans = 0\nfor iq in range(k1 + k2):\n just_relax()\n if gruz:\n if (k1 + k2 - iq) % 2 == 0:\n print(0)\n else:\n print(1)\n exit(0)\nfor i in range(n):\n ans += abs(A[i] - B[i]) ** 2\nprint(ans)\n", "n, k1, k2 = map(int, input().split(' '))\na = list(map(int, input().split(' ')))\nb = list(map(int, input().split(' ')))\n\nassert n == len(a)\nassert n == len(b)\n\nc = []\n\nfor i in range(n):\n c.append(abs(a[i] - b[i]))\n\nc.sort(reverse=True)\n\nk = k1 + k2\n\nwhile k:\n c[0] = c[0] - 1 if c[0] > 0 else c[0] + 1\n k -= 1\n c.sort(reverse=True)\n\n\nans = sum(l ** 2 for l in c)\nprint(ans)", "n, k1, k2 = map(int, input().split())\na = list(map(int, input().split()))\nb = list(map(int, input().split()))\nk = k1+k2\nc = list()\nfor i in range(n):\n c.append(abs(a[i]-b[i]))\nc.sort()\nfor i in range(n-1, 0, -1):\n if c[i] == c[i-1]:\n continue\n if (n-i)*(c[i]-c[i-1]) <= k:\n k = k-(n-i)*(c[i]-c[i-1])\n for j in range(i, n):\n c[j] = c[i-1]\n else:\n while k > 0:\n for j in range(n-1, i-1, -1):\n c[j] = c[j]-1\n k = k-1\n if k == 0:\n break\nwhile k > 0 and c[0] > 0:\n for i in range(n):\n c[i] = c[i]-1\n k = k-1\n if k == 0:\n break\nif k > 0:\n if k&1:\n sum = 1\n else:\n sum = 0\nelse:\n sum = 0\n for i in range(n):\n sum = sum+c[i]*c[i]\nprint(sum)\n", "import sys\ninput = lambda: sys.stdin.readline().rstrip()\nfrom collections import deque,defaultdict,Counter\nfrom itertools import permutations,combinations\nfrom bisect import *\nfrom heapq import *\nfrom math import ceil,gcd,lcm,floor\n\nN,M,K = map(int,input().split())\nA = list(map(int,input().split()))\nB = list(map(int,input().split()))\n\nl = []\nfor i in range(N):\n l.append(abs(A[i]-B[i]))\nnum = M+K\n\nfor _ in range(num):\n l.sort(reverse=True)\n if l[0]>=1:\n l[0]-=1\n num-=1\n\nans = num%2\nfor i in l:\n ans+=i**2\nprint(ans)", "from sys import stdin,stdout\r\nfrom itertools import* \r\ninp=lambda :(int(i) for i in stdin.readline().split())\r\nn,k1,k2=inp()\r\na=[abs(x-y) for x,y in zip(list(inp()),list(inp()))]\r\nfor i in range(k1+k2):\r\n id=a.index(max(a))\r\n a[id]=abs(a[id]-1)\r\nstdout.write(str(sum(i**2 for i in a ))) ", "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\n# I love Heap <3\r\n# It is cheating...\r\n\r\ndef solve():\r\n n, k1, k2 = map(int, input().split())\r\n a = list(map(int, input().split()))\r\n b = list(map(int, input().split()))\r\n\r\n h = []\r\n for i in range(n):\r\n heappush(h, -abs(a[i] - b[i]))\r\n\r\n for i in range(k1 + k2):\r\n diff = -heappop(h)\r\n new_diff = abs(diff - 1)\r\n\r\n heappush(h, -new_diff)\r\n\r\n print(sum([h[i] ** 2 for i in range(len(h))]))\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", "n, k1, k2 = [int(elem) for elem in input().split(\" \")]\n\nlist1 = [int(elem) for elem in input().split(\" \")]\nlist2 = [int(elem) for elem in input().split(\" \")]\n\nlst = list1.copy()\n\nfor i in range(len(lst)):\n lst[i] = abs(list1[i]-list2[i])\n\nk = k1 + k2\n\nwhile k > 0:\n lst.sort(reverse=True)\n lst[0] = abs(lst[0]-1)\n k -= 1\nresult = 0\nfor num in lst:\n result += num**2\nprint(result)\n\n\n\n\n \n\n\n\n \n", "n, k1, k2 = [int(elem) for elem in input().split(\" \")]\n\nlist1 = [int(elem) for elem in input().split(\" \")]\nlist2 = [int(elem) for elem in input().split(\" \")]\n\nlst = list1.copy()\n# num_zero = 0\n# sum = 0\nfor i in range(len(lst)):\n lst[i] = abs(list1[i]-list2[i])\n # if lst[i] == 0:\n # num_zero += 1\n # sum += (list1[i]-list2[i])**2\n\n# lst.sort(reverse=True)\nk = k1 + k2\n# change = 0\n\n# i = 0\n# while num_zero != len(lst) and k != 0:\n# if k >= (len(lst) - num_zero):\n# k -= len(lst)-num_zero\n# for i in range(len(lst) - num_zero):\n# change += abs(lst[i])*2 - 1\n# if lst[i] > 0:\n# lst[i] -= 1\n# else:\n# lst[i] += 1\n# if lst[i] == 0:\n# num_zero += 1\n \n# else: \n# for i in range(k):\n# change += (abs(lst[i])*2 - 1)\n# if lst[i] > 0:\n# lst[i] -= 1\n# else:\n# lst[i] += 1\n# if lst[i] == 0:\n# num_zero += 1 \n# k = 0\n\nwhile k > 0:\n lst.sort(reverse=True)\n lst[0] = abs(lst[0]-1)\n k -= 1\nresult = 0\nfor num in lst:\n result += num**2\n\n\n\n\n \n\nprint(result)\n\n\n\n\n \n\n\n\n \n", "n, k1, k2 = map (int, input ().split ())\r\na = list (map (int, input ().split ()))\r\nb = list (map (int, input ().split ()))\r\nc = list ()\r\nfor i in range (n) : c.append (abs (a[i] - b[i]))\r\nc.sort (reverse = True)\r\nfor i in range (k1 + k2) :\r\n if c[0] <= 0 : c[0] += 1\r\n else : c[0] -= 1\r\n i = 1\r\n while i < n and c[i] > c[0] : i += 1\r\n if i == 1 : continue\r\n else : c = c[1 : i] + [c[0]] + c[i :]\r\nans = 0\r\nfor i in c : ans = (ans + i * i)\r\nprint (ans)\r\n \r\n", "from heapq import heapify, heappop, heappush\r\ndef solve():\r\n n, k1, k2 = map(int, input().split())\r\n a = list(map(int, input().split()))\r\n b = list(map(int, input().split()))\r\n d = [-abs(a[i] - b[i]) for i in range(n)]\r\n heapify(d)\r\n for i in range(k1+k2):\r\n # print(d)\r\n item = heappop(d)\r\n item = -abs(item + 1)\r\n heappush(d, item)\r\n \r\n # print(d)\r\n print(sum([di**2 for di in d]))\r\n\r\nsolve()\r\n\r\n\r\n", "from sys import stdin,stdout\r\nfrom itertools import* \r\ninp=lambda :(int(i) for i in stdin.readline().split())\r\nn,k1,k2=inp()\r\na=list(inp())\r\nb=list(inp())\r\nfor i in range(n):\r\n a[i]=abs(a[i]-b[i])\r\nfor i in range(k1+k2):\r\n c=a.index(max(a))\r\n a[c]=abs(a[c]-1)\r\nsu=0\r\nfor i in a:\r\n su+=(i*i)\r\nprint(su) ", "\r\n\r\n\r\n\r\nimport 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 copy\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, count, filterfalse\r\nfrom operator import itemgetter\r\n\r\nfor _ in range(1):\r\n n,k1,k2 = LI()\r\n l1 = LI()\r\n l2 = LI()\r\n lst = [abs(l1[i]-l2[i])for i in range(n)]\r\n for i in range(k1):\r\n lst.sort()\r\n lst[-1] = abs(lst[-1]-1)\r\n for i in range(k2):\r\n lst.sort()\r\n lst[-1] = abs(lst[-1]-1)\r\n s = 0\r\n for i in range(n):\r\n s = s+(lst[i]**2)\r\n print(s)\r\n\r\n\r\n\r\n\r\n", "n, k1, k2 = map(int, input().split())\na = list(map(int, input().split()))\nb = list(map(int, input().split()))\nd = [abs(a[i]-b[i]) for i in range(n)]\nk = k1 + k2\nfor _ in range(k):\n mx = max(d)\n id = d.index(mx)\n if mx == 0:\n d[id] += 1\n else:\n d[id] -= 1\nprint (sum(map(lambda x: x ** 2, d)))\n", "n,k1,k2=map(int,input().split())\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\n\r\narr=[]\r\nfor i in range(n):\r\n arr.append(abs(a[i]-b[i]))\r\n\r\narr=sorted(arr,reverse=True)\r\n\r\nfor i in range(k1+k2):\r\n arr[0]=abs(arr[0]-1)\r\n j=0\r\n while(j<(n-1) and arr[j]<arr[j+1]):\r\n arr[j],arr[j+1]=arr[j+1],arr[j]\r\n j+=1\r\n\r\nans=0\r\nfor i in range(n):\r\n ans=ans+(arr[i]*arr[i])\r\n\r\nprint(ans)\r\n", "n, k1, k2 = map(int, input().split())\na = list(map(int, input().split()))\nb = list(map(int, input().split()))\nr = sorted([abs(a[i] - b[i]) for i in range(n)], reverse=True)\nfor it in range(k1 + k2):\n if r[0] == 0:\n r[0] = 1\n else:\n r[0] -= 1\n for i in range(n - 1):\n if r[i] < r[i + 1]:\n r[i], r[i + 1] = r[i + 1], r[i]\nprint(sum(x**2 for x in r))\n", "import sys\r\nn,k1,k2=map(int,input().split())\r\na=[int(i) for i in sys.stdin.readline().split()]\r\nb=[int(i) for i in sys.stdin.readline().split()]\r\nfor i in range(n):\r\n a[i]=abs(a[i]-b[i])\r\nfor i in range(k1+k2):\r\n c=a.index(max(a))\r\n a[c]=abs(a[c]-1)\r\nsu=0\r\nfor i in a:\r\n su+=(i*i)\r\nprint(su)", "# -*- coding: UTF-8 -*-\n\nimport math\n\nn, k1, k2 = map(int, input().split())\na = list(map(int, input().split()))\nb = list(map(int, input().split()))\n\nx = []\nfor i in range(n):\n x.append(int(math.fabs(a[i] - b[i])))\n\nk = k1 + k2\nwhile k > 0:\n max_num = 0\n idx = -1\n for i in range(n):\n if x[i] > max_num:\n max_num = x[i]\n idx = i\n if idx == -1:\n break\n x[idx] -= 1\n k -= 1\n\nret = 0\nfor i in range(n):\n ret += x[i] * x[i]\nif k % 2 == 1:\n ret += 1\nprint(ret)", "def rl():\r\n return list(map(int,input().split()))\r\ndef ri():\r\n return int(input())\r\ndef rs():\r\n return input()\r\ndef rm():\r\n return map(int,input().split())\r\n\r\ndef main():\r\n n,p,q=rm()\r\n k=p+q\r\n a=rl()\r\n b=rl()\r\n c=[0]+[abs(a[i]-b[i]) for i in range(n)]\r\n c.sort()\r\n rs=0\r\n d=[0 for i in range(n+1)]\r\n for i in range(1,n+1):\r\n d[i]=c[i]*c[i]+d[i-1]\r\n for i in range(n,0,-1):\r\n tp=(c[i]-c[i-1])*(n+1-i)\r\n # print(tp,k)\r\n if tp<=k: k-=tp\r\n else: \r\n m,r=divmod(k,n+1-i)\r\n rs+=(n+1-i-r)*(c[i]-m)*(c[i]-m)+r*(c[i]-m-1)*(c[i]-m-1)\r\n # print(rs,d[i-1],i)\r\n return rs+d[i-1]\r\n return k%2\r\nprint(main())\r\n\r\n\r\n", "import heapq\n\nn,k1,k2 = map(int,input().split())\nA = list(map(int,input().split()))\nB = list(map(int,input().split()))\nh = []\nheapq.heapify(h)\nfor i in range(n):\n heapq.heappush(h,-1*(A[i]-B[i])**2)\nfor _ in range(k1+k2):\n t = (-1*heapq.heappop(h))**(1/2)\n heapq.heappush(h,-1*int((t-1)**2))\nans = 0\nwhile(len(h)>0):\n ans+=-1*int(heapq.heappop(h))\n\nprint(ans)\n" ]

[ "a = input()\r\nmassiv=[]\r\nmassiv+=a\r\nans = 0\r\nfor i in range(len(massiv)):\r\n if massiv[i] == \">\":\r\n massiv[i] = \"1000\"\r\n elif massiv[i] == \"<\":\r\n massiv[i] = \"1001\"\r\n elif massiv[i] == \"+\":\r\n massiv[i] = \"1010\"\r\n elif massiv[i] == \"-\":\r\n massiv[i] = \"1011\"\r\n elif massiv[i] == \".\":\r\n massiv[i] = \"1100\"\r\n elif massiv[i] == \",\":\r\n massiv[i] = \"1101\"\r\n elif massiv[i] == \"[\":\r\n massiv[i] = \"1110\"\r\n else:\r\n massiv[i] = \"1111\"\r\nans = ''.join(massiv)\r\nprint(int(ans, 2)%1000003)\r\n", "s = input()\r\nconv = \"\"\r\nfor i in s:\r\n if(i == '>'):\r\n conv += \"1000\"\r\n elif(i == '<'):\r\n conv += \"1001\"\r\n elif(i == '+'):\r\n conv += \"1010\"\r\n elif(i == '-'):\r\n conv += \"1011\"\r\n elif(i == '.'):\r\n conv += \"1100\"\r\n elif(i == ','):\r\n conv += \"1101\"\r\n elif(i == '['):\r\n conv += \"1110\"\r\n else:\r\n conv += \"1111\"\r\nn = 0\r\nfor i in range(len(conv)):\r\n if(conv[i] == '1'):\r\n n += pow(2,len(conv)-i-1)\r\nprint(n%1000003)\r\n", "program = input()\r\nresult = 0\r\n\r\nfor char in program:\r\n result *= 16\r\n if char == '>':\r\n result += 8\r\n elif char == '<':\r\n result += 9\r\n elif char == '+':\r\n result += 10\r\n elif char == '-':\r\n result += 11\r\n elif char == '.':\r\n result += 12\r\n elif char == ',':\r\n result += 13\r\n elif char == '[':\r\n result += 14\r\n elif char == ']':\r\n result += 15\r\n\r\n result %= 1000003\r\n\r\nprint(result)\r\n", "s = input()\r\nanswer = 0\r\nR = list(\"><+-.,[]\")\r\nfor i in s:\r\n D = R.index(i)\r\n answer*=16\r\n answer+=(8 + D)\r\nprint(answer%(1000003))# 1689248557.1572993", "def binarytonumber(s):\r\n l= list(s)\r\n l.reverse()\r\n sum=0\r\n for i in range(len(l)):\r\n if l[i]==\"1\":sum+= pow(2,i)\r\n return sum\r\ncodes,values=list(\"><+-.,[]\"),[\"1000\",\"1001\",\"1010\",\"1011\",\"1100\",\"1101\",\"1110\",\"1111\"]\r\ns,bn= list(input()),\"\"\r\nfor e in s:bn+= values[codes.index(e)]\r\nprint(binarytonumber(bn)%1000003)\r\n\r\n", "st = input()\r\ns = '0b'\r\nfor x in st:\r\n if x == '>': s+= \"1000\"\r\n if x == '<': s+= \"1001\"\r\n if x == '+': s+= \"1010\"\r\n if x == '-': s+= \"1011\"\r\n if x == '.': s+= \"1100\"\r\n if x == ',': s+= \"1101\"\r\n if x == '[': s+= \"1110\"\r\n if x == ']': s+= \"1111\"\r\n\r\na = int(s,2)\r\nprint(a%(10**6 + 3))\r\n\r\n ", "dic = {'>': 1000, '<': 1001, '+': 1010, '-': 1011, '.': 1100, ',': 1101, '[': 1110, ']': 1111}\r\n\r\nbrainfuck = ''.join([str(dic[i]) for i in list(input())])\r\n\r\nprint(int(brainfuck, 2)%(10**6+3))\r\n", "if __name__ == \"__main__\":\r\n s = input()\r\n x = \"\"\r\n a = {'>': \"1000\", '<': \"1001\", '+': \"1010\", '-': \"1011\", '.': \"1100\", ',': \"1101\", '[': \"1110\", ']': \"1111\"}\r\n for i in range(len(s)):\r\n x += a[s[i]]\r\n print(int(x, 2) % 1000003)\r\n", "d = dict(zip('><+-.,[]', '1000 1001 1010 1011 1100 1101 1110 1111'.split()))\n\nprint(int(''.join(map(d.get,input())), 2) % 1000003)\n\t\t\t\t\t \t \t \t \t \t \t\t \t \t", "# UNARY 133B\r\np = input()\r\nsize = 0\r\nfor i in range(len(p)):\r\n size *= 16\r\n if p[i] == '>':\r\n size += 8\r\n elif p[i] == '<':\r\n size += 9\r\n elif p[i] == '+':\r\n size += 10\r\n elif p[i] == '-':\r\n size += 11\r\n elif p[i] == '.':\r\n size += 12\r\n elif p[i] == ',':\r\n size += 13\r\n elif p[i] == '[':\r\n size += 14\r\n elif p[i] == ']':\r\n size += 15\r\n size %= 1000003\r\nprint(size)", "lst=list(input())\r\n\r\n\r\nfor i in range(len(lst)):\r\n if(lst[i]=='>'):\r\n lst[i]='1000'\r\n if(lst[i]=='<'):\r\n lst[i]='1001'\r\n if(lst[i]=='+'):\r\n lst[i]='1010'\r\n if(lst[i]=='-'):\r\n lst[i]='1011'\r\n if(lst[i]=='.'):\r\n lst[i]='1100'\r\n if(lst[i]==','):\r\n lst[i]='1101'\r\n if(lst[i]=='['):\r\n lst[i]='1110'\r\n if(lst[i]==']'):\r\n lst[i]='1111'\r\n\r\na=''.join(map(str,lst))\r\nbinary=list(a)\r\nsum=0\r\nfor i in range(len(binary)-1,-1,-1):\r\n sum += int(binary[i])*(2**((len(binary)-1)-i))\r\nprint(sum%1000003)\r\n\r\n", "def m(x):\r\n return x % 1000003 \r\n\r\n\r\ndef dec(n):\r\n return int(n,2)\r\n\r\ndic={\">\":1000,\r\n\"<\":1001,\r\n\"+\":1010,\r\n\"-\":1011,\r\n\".\":1100,\r\n\",\":1101,\r\n\"[\":1110,\r\n\"]\":1111}\r\n\r\ns=''\r\nn=input()\r\nfor i in n:\r\n s=s+str(dic[i])\r\n\r\nprint(m(dec(s)))\r\n\r\n\r\n", "binary_codes = {'>': '1000', '<': '1001', '+': '1010', '-': '1011', '.': '1100', ',': '1101', '[': '1110', ']': '1111'}\r\nBra=input()\r\nuna=\"\"\r\nfor i in Bra:\r\n una+=str(binary_codes[i])\r\nprint(int(una,2)%(10**6+3))", "def main():\r\n p = input()\r\n size = 0\r\n for char in p:\r\n size = size * 16\r\n if char == '>':\r\n size += 8\r\n elif char == '<':\r\n size += 9\r\n elif char == '+':\r\n size += 10\r\n elif char == '-':\r\n size += 11\r\n elif char == '.':\r\n size += 12\r\n elif char == ',':\r\n size += 13\r\n elif char == '[':\r\n size += 14\r\n elif char == ']':\r\n size += 15\r\n size %= 1000003\r\n print(size)\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "s = input()\r\ns = s.replace('>','1000')\r\ns = s.replace('<','1001')\r\ns = s.replace('+','1010')\r\ns = s.replace('-','1011')\r\ns = s.replace('.','1100')\r\ns = s.replace(',','1101')\r\ns = s.replace('[','1110')\r\ns = s.replace(']','1111')\r\nans = int(s,2)\r\nprint(ans % 1000003)", "t = 0\r\na = input()\r\nfor i in a:\r\n t = 16 * t + 8 + \"><+-.,[]\".index(i)\r\nprint(t % 1000003)", "dict1={\">\":\"1000\",\"<\":\"1001\",\"+\":\"1010\",\"-\":\"1011\",\".\":\"1100\",\",\":\"1101\",\"[\":\"1110\",\"]\":\"1111\"}\r\ns=input()\r\nn=\"\"\r\nfor i in s:\r\n n+=dict1[i]\r\nr,k=0,len(n)-1\r\nfor i in n:\r\n if i==\"1\":\r\n r+=2**k\r\n k-=1\r\nprint(r%1000003)" ]

[ "n,k=map(int,input().split())\r\na=[]\r\nfor i in range(n):\r\n l=list(map(int,input().split()))\r\n a.append(l)\r\na=list(set(tuple(i) for i in a))\r\nfor i in range(len(a)):\r\n flag=False\r\n for j in range(len(a)):\r\n cnt=0\r\n for x in range(k):\r\n if a[i][x]==1 and a[j][x]!=0:\r\n continue\r\n else:\r\n cnt+=1\r\n if cnt==k:\r\n flag=True\r\n break\r\n if flag:\r\n break\r\nif flag:print(\"Yes\")\r\nelse:print(\"No\")\r\n ", "# def qual(arr:list[list[int]]):\r\n# hashmap={}\r\n# for i in range(len(arr)):\r\n# hashmap[i]=[]\r\n# for j in range(len(arr[i])):\r\n# if arr[i][j]==0:\r\n#\r\n# hashmap[i].append(j)\r\n#\r\n\r\nn,k=map(int,input().split())\r\ns=set()\r\nfor i in range(n):\r\n s.add(int(\"\".join(map(str,input().split())),2))\r\n\r\nfor i in s:\r\n for j in s:\r\n \r\n if i&j==0:\r\n print(\"YES\")\r\n exit()\r\nprint(\"NO\")\r\n\r\n", "n, k = map(int,input().split())\r\na = set()\r\nyes = False\r\nfor i in range(n):\r\n a.add(input())\r\nfor w1 in a:\r\n for w2 in a:\r\n x = list(map(int, w1.split()))\r\n y = list(map(int, w2.split()))\r\n count = 0\r\n for i in range(k):\r\n if x[i] + y[i] != 2:\r\n count += 1\r\n if count == k:\r\n yes = True\r\nif yes:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def clc(m, k):\r\n opts = ['']\r\n for i in range(k):\r\n if m[i] == 1:\r\n opts = [o+'0' for o in opts]\r\n else:\r\n opts = [o+'0' for o in opts] + [o+'1' for o in opts]\r\n return opts\r\n\r\nn, k = map(int, input().split())\r\ns = set()\r\nfor _ in range(n):\r\n m = list(map(int, input().split()))\r\n if k - sum(m) == k:\r\n print('YES')\r\n exit()\r\n break\r\n else:\r\n opts = clc(m, k)\r\n for o in opts:\r\n if o in s:\r\n print('YES')\r\n exit()\r\n break\r\n s.add(''.join([str(i) for i in m]))\r\n \r\nprint('NO')\r\n ", "def solve():\r\n n, k = map(int, input().split())\r\n a = []\r\n c = set()\r\n hasZeroSetPb = [0] * k\r\n hasOneSetPb = [0] * k\r\n\r\n for _ in range(n):\r\n b = list(map(int, input().split()))\r\n j = 1\r\n s = 0\r\n idx = 0\r\n for kk in b:\r\n s += kk * j\r\n if kk:\r\n hasOneSetPb[idx] = 1\r\n else:\r\n hasZeroSetPb[idx] = 1\r\n j *= 2\r\n idx += 1\r\n a.append(s)\r\n c.add(s)\r\n\r\n for i in a:\r\n for j in range(k):\r\n if i & (2 ** j):\r\n f = 1\r\n for kk in range(k):\r\n if kk == j:\r\n continue\r\n if i & (2 ** kk):\r\n f = 0\r\n break\r\n if f and hasZeroSetPb[j]:\r\n print('YES')\r\n return\r\n elif i == 0:\r\n print('YES')\r\n return\r\n else:\r\n j = (2 ** k - 1) ^ i\r\n if j in c:\r\n print('YES')\r\n return\r\n print('NO')\r\n return\r\n\r\nif __name__ == '__main__':\r\n t = 1\r\n # t = int(input())\r\n while t > 0:\r\n t -= 1\r\n solve()", "vis = [0] * ((1 << 4) + 5)\r\nline = input().split()\r\nn = int(line[0])\r\nk = int(line[1])\r\nfor i in range(n):\r\n line = input().split()\r\n st = 0\r\n for j in range(k):\r\n x = int(line[j])\r\n st += (1 << j) * x\r\n vis[st] = 1\r\nflag = False\r\nfor i in range(16):\r\n for j in range(16):\r\n if vis[i] == 0 or vis[j] == 0:\r\n continue\r\n if (i & j) == 0:\r\n flag = True\r\n break\r\n if flag:\r\n break\r\nif flag:\r\n print('YES')\r\nelse:\r\n print('NO')", "n,k=map(int, input().split())\r\nvis = [0] * 17\r\nfor _ in range(n):\r\n\ta = list(map(int, input().split()))\r\n\tvis[sum(a[i]*(1<<i) for i in range(k))] = 1\r\nflag=0\r\nfor i in range(16):\r\n\tfor j in range(16):\r\n\t\tif i&j==0 and vis[i] and vis[j]: flag=1\r\nprint(\"YES\" if flag else \"NO\")", "##a = list(map(int, input().split()))\r\n##print(' '.join(map(str, res)))\r\n\r\n[n, k] = list(map(int, input().split()))\r\nprob = list()\r\nfor _ in range(n):\r\n prob.append(list(map(int, input().split())))\r\n\r\nmask = list()\r\nfor p in prob:\r\n x = 0\r\n y = 0\r\n for i in range(k):\r\n if p[i] == 1:\r\n x |= 1<<i\r\n mask.append(x)\r\nmask.sort()\r\n\r\nfor x in mask:\r\n if x == 0:\r\n print('YES')\r\n exit(0)\r\n\r\nimport bisect\r\nfor x in mask:\r\n for y in range(1<<k):\r\n if (x&y) == 0:\r\n idx = bisect.bisect_left(mask, y)\r\n if idx < n and mask[idx] == y:\r\n print('YES')\r\n exit(0)\r\nprint('NO')\r\n\r\n", "### Problem:\n\"\"\"\nSnark and Philip are preparing the problemset for the upcoming pre-qualification round for semi-quarter-finals. They have a bank of n problems, and they want to select any non-empty subset of it as a problemset.\nk experienced teams are participating in the contest. Some of these teams already know some of the problems. To make the contest interesting for them, each of the teams should know at most half of the selected problems.\nDetermine if Snark and Philip can make an interesting problemset!\n\n#Input\nThe first line contains two integers n, k (1 ≤ n ≤ 105, 1 ≤ k ≤ 4) — the number of problems and the number of experienced teams.\nEach of the next n lines contains k integers, each equal to 0 or 1. The j-th number in the i-th line is 1 if j-th team knows i-th problem and 0 otherwise.\n\n#Output\nPrint \"YES\" (quotes for clarity), if it is possible to make an interesting problemset, and \"NO\" otherwise.\nYou can print each character either upper- or lowercase (\"YeS\" and \"yes\" are valid when the answer is \"YES\").\n\"\"\"\n\n### SOLUTION:\n\"\"\"\n every row has (2^k) possibilities from 0 - (2^k - 1)\n\n to have at least 2 problems in the problemset:\n - if an input row is all zeros, i.e. there is a problem that nobody knows\n - an input row containing 1's and there is a previous input row in which for every 1 in the input row, there is a zero in the adjacent position. i.e. for every known problem there is a problem that this group doesn't know\n -- Fast solution: if we have a row x and the complement of x, for ex: 101 and 010\n\n SOLUTION STEPS:\n 1- get n, k\n 2- create twoPkList: a list of 2^k - 2 rows, (the tow missing rows are the ones containing all 0's and all 1's and there is no need to check against them),\n a (k+1) columns and initialize the values = 0 i.e. FALSE, the (k+1) column is to check if a specific row is already inputted (1:TRUE) or not yes (0:FALSE)\n -- for every row in n input rows:\n 3- convert the input elements to binary\n -- if it is a 1:\n -- add its position in the input string to the onesList\n -- convert it to its decimal value and add it to the summation\n 4- #FAST CASE# if the input is all 0's, make result = YES and break\n 5- #FAST CASE# if the input is all 1's, no need to do more check, continue\n 6- #FAST CASE# if the complement of summation already exists in the list by i.e. if twoPkList[2**k -2 - summation][k] is set\n 7- for each row in twoPkList:\n 8- create adjacentZeros to count the number of 0's in the row that are adjacent to the 1's in the input\n 9- #FAST CASE# check if the row is already set and it is not the same row as the input:\n 10- for every position containing 1 in the input: check if the same position in the row has a 1:\n 11- if it has, increase adjacentZeros by 1,\n 12- if the total number of adjacentZeros == length of the 1's positions list (onesList) i.e. for every 1 in the iput there is an adjacent zero in the row, set the result = \"YES\"\n then a problemset can be created\n 13- if the result is set to \"YES\", break\n 14- if the twoPkList[summation - 1][k] is not set\n 15- add the binary list of the input to twoPkList[summation - 1]\n 16- set the twoPkList[summation - 1][k]\n\n\"\"\"\nn, k = input().split()\nn = int(n) # no. of problems\nk = int(k) # no. of teams\n\ninputList = [] # input\ntwoPkList = [] # array to save status for each 2 pow k values\nkList = [] # array to save status for each k values in every (2 pow k) row\nresult = 'NO'\n\nfor j in range(k + 1):\n kList.append(0)# initialize elements = FALSE + another column to check the whole number\n # case k = 3 :\n # 0 0 1 (1)\n # 0 1 0 (2)\n # 0 1 1 (3)\n # 1 0 0 (4)\n # ........\n\n #for every value btn. parentheses we put a boolean value indicating whether it's already found (TRUE) or not (FALSE)\n\nfor i in range(2**k - 2): # all cases except when all 0's and all 1's\n twoPkList.append(list(kList))#initialize elements = FALSE\n\nfor i in range(n):\n onesList = [] # to save the positions of 1's in the input string\n\n inputList = input().split()# split the input string\n\n summation = 0 #initialize summation\n for j in range(k):\n #convert to binary\n inputList[j] = int(inputList[j])# a list of ones and zeros\n\n if (inputList[j]):# if it is a 1\n onesList.append(j)# keep the position of that 1\n summation += inputList[j] * (2**(k-1-j))\n\n if (summation == 0): # input is all 0's\n result = \"YES\"\n break\n\n if (summation == (2**k - 1)): # all ones, no need to check\n continue\n\n if (twoPkList[2**k - 2 - summation][k]): # if the complement exists\n result = \"YES\"\n break\n\n for index, row in enumerate(twoPkList):# for every row in twoPkList\n adjacentZeros = 0\n\n if ( row[k] and (not( index == (summation - 1) )) ):# if the row is already set and it isn't the same element #### to not pointlessly check a row\n for position in onesList:# for every position of 1\n if (row[position] == 0):# if the position of a 1 in the input has an adjacent 0\n adjacentZeros += 1 # increase number of adjacent zeros by 1\n\n if (adjacentZeros == len(onesList)):# if number of zeros in the row == number of ones in the input in the same positions\n # we can form an interesting problemset\n result = \"YES\"\n break\n\n if (result == \"YES\"):\n break\n\n if (not twoPkList[summation - 1][k]):#if it is not set\n twoPkList[summation - 1] = list(inputList)\n twoPkList[summation - 1].append(1)\n\nprint(result)\n", "n,k=map(int,input().split())\r\nsp=[0]*(2**k)\r\nfor i in range(n):\r\n ci=list(map(int,input().split()))\r\n c=0\r\n for j in range(k-1,-1,-1):\r\n c+=(1-ci[j])*(2**j)\r\n sp[c]+=1\r\ned=[False]*k\r\nfor i in range(2**k-1,-1,-1):\r\n ci=[]\r\n t=i\r\n for j in range(k-1,-1,-1):\r\n ci.append(t//(2**j))\r\n t%=2**j\r\n if sp[i]>0:\r\n for j in range(k):\r\n if ci[j]==1:\r\n ed[j]=True\r\n break\r\np=i-1\r\nfor i in range(p,-1,-1):\r\n ci=[]\r\n t=i\r\n for j in range(k-1,-1,-1):\r\n ci.append(t//(2**j))\r\n t%=2**j\r\n if sp[i]>0:\r\n for j in range(k):\r\n if not(ci[j]==1 or ed[j]):\r\n break\r\n else:\r\n print('YES')\r\n exit()\r\nif sp[2**k-1]>0:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n \r\n \r\n", "n, k = map(int, input().split())\r\nz = [0]*(2**k)\r\nfor i in range(n):\r\n\tx = list(map(int, input().split()))\r\n\ts = \"\"\r\n\tfor i in x:\r\n\t\ts+=str(i)\r\n\tnum = int(s, 2)\r\n\tz[num]+=1\r\nif z[0]:\r\n\tprint(\"YES\")\r\n\texit()\r\nfor i in range(2**k):\r\n\tfor j in range(2**k):\r\n\t\tif i&j == 0:\r\n\t\t\tif z[i] and z[j]:\r\n\t\t\t\tprint(\"YES\")\r\n\t\t\t\texit()\r\nprint(\"NO\")", "def bel(mask, bit):\r\n return (mask & (1 << bit)) != 0\r\nread = lambda: map(int, input().split())\r\nn, k = read()\r\nf = [0] * 100\r\nfor i in range(n):\r\n cur = int(''.join(input().split()), 2)\r\n cur ^= (1 << k) - 1\r\n f[cur] = 1\r\nans = 'NO'\r\nif k == 1:\r\n if f[1]:\r\n ans = 'YES'\r\nif k == 2:\r\n f1 = f2 = 0\r\n for i in range(4):\r\n if f[i]:\r\n if bel(i, 0): f1 = 1\r\n if bel(i, 1): f2 = 1\r\n if f1 and f2:\r\n ans = 'YES'\r\nif k == 3:\r\n p = [0] * 3\r\n for i in range(8):\r\n if f[i]:\r\n for j in range(3):\r\n if bel(i, j): p[j] = 1\r\n for i in range(8):\r\n if f[i]:\r\n if bel(i, 0) and bel(i, 1) and p[2]: ans = 'YES'\r\n if bel(i, 0) and p[1] and bel(i, 2): ans = 'YES'\r\n if p[0] and bel(i, 1) and bel(i, 2): ans = 'YES'\r\nif k == 4:\r\n for i in range(16):\r\n if f[i]:\r\n for j in range(16):\r\n if f[j]:\r\n if (i | j) == 15:\r\n ans = 'YES'\r\nprint(ans)", "from itertools import accumulate, permutations, combinations\r\nfrom sys import stdout\r\n\r\nR = lambda: map(int, input().split())\r\nn, k = R()\r\ns = set(tuple(R()) for x in range(n))\r\nres = False\r\nfor l in range(1, len(s) + 1):\r\n for x in combinations(s, l):\r\n res = res or all(2 * sum(t) <= l for t in zip(*x))\r\nprint('YES' if res else 'NO')", "\r\ninp = input().split(\" \")\r\nn = int(inp[0])\r\nk = int(inp[1])\r\n\r\ns = set()\r\nfor i in range(n):\r\n a = input().split(' ')\r\n x = 0\r\n for j in range(k):\r\n x = 2 * x + int(a[j])\r\n s.add(x)\r\n\r\nfor i in range(16):\r\n if i in s:\r\n for j in range(16):\r\n if j in s:\r\n if i & j == 0:\r\n print(\"YES\")\r\n exit(0)\r\n\r\n\r\nprint(\"NO\")\r\n", "n,k1=tuple(map(int,input().split()))\r\nl=[]\r\nans=0\r\nfor i in range(n):\r\n l.append(list(map(int,input().split())))\r\n#l=sorted(l)\r\nd1=[[[0],[0]],[[0],[1]]]\r\nd2=[[[0,0],[0,1]],[[0,0],[1,0]],[[0,0],[0,0]],[[0,0],[1,1]],[[0,1],[1,0]]]\r\nd3=[]\r\nd4=[]\r\nfor i in range(1):\r\n for j in range(2):\r\n for k in range(2):\r\n for x in range(2):\r\n for y in range(2):\r\n for z in range(2):\r\n if(i+x<2 and j+y<2 and k+z<2):\r\n d3.append([[i,j,k],[x,y,z]])\r\nfor i in range(1):\r\n for j in range(2):\r\n for k in range(2):\r\n for t in range(2):\r\n for x in range(2):\r\n for y in range(2):\r\n for z in range(2):\r\n for w in range(2):\r\n if(i+x<2 and j+y<2 and k+z<2 and t+w<2):\r\n d4.append([[i,j,k,t],[x,y,z,w]])\r\n\r\nif(k1==1):\r\n d=d1 \r\nelif(k1==2):\r\n d=d2\r\n #print(d)\r\nelif(k1==3):\r\n d=d3 \r\nelse:\r\n d=d4\r\n\r\nfor i in range(len(d)):\r\n if(d[i][0] in l and d[i][1] in l):\r\n ans=1 \r\n break\r\n #print(d[i],d[i][1])\r\n\r\nif(ans==1):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n#print(d1)\r\n#print(d2)\r\n#print(d3)\r\n#print(d4)\r\n#print(d==d1)\r\n#print(d==d2)\r\n#print(d==d3)\r\n#print(d==d4)", "n, k = map(int, input().split())\r\ntemp = {}\r\nfor i in range(n):\r\n c = int(''.join(input().split()), 2)\r\n temp[c] = 1\r\n\r\nf = 0\r\nfor i in range((1 << k) + 1):\r\n for j in range((1 << k) + 1):\r\n if temp.get(i, 0) and temp.get(j, 0) and not (i & j):\r\n f = 1\r\n\r\nif f:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "from sys import exit\r\nn, k = [int(i) for i in input().split()]\r\ns = set([int(\"\".join(input().split()), base=2) for j in range(n)])\r\nfor t in s:\r\n for m in range(1 << k):\r\n if m in s:\r\n for i in range(k):\r\n if ((t >> i) & 1) and ((m >> i) & 1):\r\n break\r\n else:\r\n print(\"YES\")\r\n exit(0)\r\nprint(\"NO\")\r\n \r\n", "import sys\nN,K= map( int,input().split() )\n\nstates=set([(0,0)])\n\nfor _ in range(N):\n\tcan_solve=list( map(int,input().split()) )\n\n\tnext_states=set()\n\tfor (selected,bm) in states:\n\t\tcnts =[(bm>>i)&1 for i in range(K)][::-1]\n\n\t\tnext_cnts=[cnts[i]+can_solve[i] for i in range(K)]\n\t\tnext_selected=selected+1\n\n\t\tif max(next_cnts)<=next_selected/2 and next_selected>0:\n\t\t\tprint(\"YES\")\n\n\t\t\tsys.exit(0)\n\t\t\n\t\tif max(next_cnts)<=1 and next_selected<=4:\n\t\t\tbin_num= int(''.join( map(str,next_cnts) ) ,2)\n\t\t\tnext_states.add( (next_selected,bin_num) )\n\t\t\t\n\tstates|=next_states\n\nprint(\"NO\")\n\n", "# -*- coding: utf-8 -*-\r\n\r\nimport math\r\nimport collections\r\nimport bisect\r\nimport heapq\r\nimport time\r\nimport random\r\n\r\n\"\"\"\r\ncreated by shhuan at 2017/10/5 15:00\r\n\r\n\"\"\"\r\n\r\nN, K = map(int, input().split())\r\n\r\nproblems = collections.defaultdict(set)\r\nfor i in range(N):\r\n row = tuple([int(x) for x in input().split()])\r\n k = sum(row)\r\n if k == 0:\r\n print('YES')\r\n exit(0)\r\n elif k < K:\r\n for i in range(K):\r\n if row[i] == 0:\r\n problems[i].add(row)\r\n\r\nif not problems:\r\n print('NO')\r\n exit(0)\r\n\r\n\r\nfor p1 in problems[0]:\r\n\r\n idx = [i for i in range(K) if p1[i] == 1]\r\n if not idx:\r\n print(\"YES\")\r\n exit(0)\r\n\r\n p2s = problems[idx[0]]\r\n\r\n for p2 in p2s:\r\n if all(p2[i] == 0 for i in idx):\r\n print(\"YES\")\r\n exit(0)\r\n\r\n\r\nprint(\"NO\")\r\n\r\n\r\n\r\n", "import sys\r\nreadline=sys.stdin.readline\r\n\r\nN,K=map(int,readline().split())\r\ncnt=[0]*(1<<K)\r\nlst=[]\r\nfor n in range(N):\r\n bit=0\r\n for i,b in enumerate(list(map(int,readline().split()))):\r\n if b:\r\n bit|=1<<i\r\n cnt[bit]+=1\r\n if cnt[bit]<=2:\r\n lst.append(bit)\r\nle=len(lst)\r\nans=\"NO\"\r\nif 0 in lst:\r\n ans=\"YES\"\r\nfor i in range(le):\r\n for j in range(i+1,le):\r\n if lst[i]&lst[j]==0:\r\n ans=\"YES\"\r\nprint(ans)", "n,m=map(int,input().split())\r\nl=set()\r\nz=\"NO\"\r\nfor i in range(n):\r\n l.add((\"\".join(input().split())))\r\nl=list(l)\r\nr=len(l)\r\nfor i in range(1,(1<<r)):#subset\r\n freq=[0]*m\r\n y=0\r\n for j in range(r):#chack sub\r\n if i&(1<<j):\r\n y+=1\r\n for k in range(m):\r\n freq[k]+=int(l[j][k])\r\n\r\n for u in freq:\r\n if u>y//2:\r\n break\r\n else:\r\n z=\"YES\"\r\n break\r\nprint(z)\r\n", "def flip(x):\r\n return any(bin(i)[2:] in s for i in range(2 << k) if not (i & x))\r\nn, k = map(int, input().split())\r\ns = set()\r\nfor _ in range(n):\r\n x = input().replace(' ', '')\r\n if flip(int(x, 2)) or x == '0' * k:\r\n exit(print('YES'))\r\n s.add(x.lstrip('0'))\r\nprint('NO')", "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()\n\ndef main():\n n,k = LI()\n s = set()\n for _ in range(n):\n t = LI()\n c = sum(t)\n if c == 0:\n return 'YES'\n s.add(tuple(t))\n\n l = list(s)\n ll = len(s)\n for i in range(ll):\n for j in range(i+1,ll):\n f = True\n for li in range(k):\n if l[i][li] == 1 and l[j][li] == 1:\n f = False\n break\n if f:\n return 'YES'\n\n return 'NO'\n\n\nprint(main())\n\n\n", "import sys\r\ninput = lambda :sys.stdin.readline()[:-1]\r\nni = lambda :int(input())\r\nna = lambda :list(map(int,input().split()))\r\nyes = lambda :print(\"yes\");Yes = lambda :print(\"Yes\");YES = lambda : print(\"YES\")\r\nno = lambda :print(\"no\");No = lambda :print(\"No\");NO = lambda : print(\"NO\")\r\n#######################################################################\r\nn,K = na()\r\nfrom collections import defaultdict\r\n\r\nd = defaultdict(int)\r\nfor i in range(n):\r\n d[input()] += 1\r\n\r\ns = []\r\nfor i in d:\r\n x = list(map(int,i.split()))\r\n if d[i] >= 2:\r\n s.append(x)\r\n s.append(x)\r\n else:\r\n s.append(x)\r\n\r\nm = len(s)\r\nans = 0\r\nfor i in range(m):\r\n for j in range(i+1,m):\r\n for k in range(j+1,m):\r\n for l in range(k+1,m):\r\n z = [0]*K\r\n for t in range(K):\r\n z[t] += s[i][t]\r\n z[t] += s[j][t]\r\n z[t] += s[k][t]\r\n z[t] += s[l][t]\r\n f = 1\r\n for t in range(K):\r\n if z[t] > 2:\r\n f = 0\r\n break\r\n if f:\r\n ans = 1\r\n break\r\n if ans:\r\n break\r\n if ans:\r\n break\r\n if ans:\r\n break\r\nfor i in range(m):\r\n for j in range(i+1,m):\r\n for k in range(j+1,m):\r\n z = [0]*K\r\n for t in range(K):\r\n z[t] += s[i][t]\r\n z[t] += s[j][t]\r\n z[t] += s[k][t]\r\n f = 1\r\n for t in range(K):\r\n if z[t] > 1:\r\n f = 0\r\n break\r\n if f:\r\n ans = 1\r\n break\r\n if ans:\r\n break\r\n if ans:\r\n break\r\nfor i in range(m):\r\n for j in range(i+1,m):\r\n z = [0]*K\r\n for t in range(K):\r\n z[t] += s[i][t]\r\n z[t] += s[j][t]\r\n f = 1\r\n for t in range(K):\r\n if z[t] > 1:\r\n f = 0\r\n break\r\n if f:\r\n ans = 1\r\n break\r\n if ans:\r\n break\r\nfor i in range(m):\r\n z = [0]*K\r\n for t in range(K):\r\n z[t] += s[i][t]\r\n f = 1\r\n for t in range(K):\r\n if z[t] > 0:\r\n f = 0\r\n break\r\n if f:\r\n ans = 1\r\n break\r\nif ans:\r\n YES()\r\nelse:\r\n NO()\r\n", "import sys\r\n\r\ndef ReadInput():\r\n return sys.stdin.read().splitlines()\r\n\r\ndef GetIA(s, delim=' '):\r\n return [int(x) for x in s.split(delim)]\r\n\r\ndef GetKey(flags):\r\n key = 0\r\n for a in flags:\r\n key <<= 1\r\n key += a\r\n # print(flags)\r\n # print(key)\r\n return key\r\n\r\ndef main():\r\n input = ReadInput()\r\n seen = dict()\r\n for s in input[1:]:\r\n seen[GetKey(GetIA(s))] = True\r\n\r\n for a in seen.keys():\r\n for b in seen.keys():\r\n if (a & b) == 0:\r\n print('YES')\r\n return\r\n\r\n print('NO')\r\n\r\nmain()", "n,k=map(int,input().split())\r\nl=set()\r\nfor i in range(n):\r\n l.add(int(\"\".join(map(str,input().split())),2))\r\nfor x in l:\r\n for y in l:\r\n if x&y==0:\r\n print(\"YES\")\r\n exit()\r\nprint(\"NO\")", "n, k = map(int, input().split())\r\ndic = {}\r\nfor i in range(2 ** k):\r\n dic[i] = False\r\nfor _ in range(n):\r\n arr = list(map(int, input().split()))\r\n num = 0\r\n fac = 1\r\n for i in arr:\r\n num += i * fac\r\n fac *= 2\r\n dic[num] = True\r\nflag = False\r\nfor i in range(2 ** k):\r\n if dic[i] == True:\r\n for j in range (2 ** k):\r\n if (i & j) == 0 and dic[j] == True:\r\n flag = True\r\nif flag:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n, k = [int(x) for x in input().split()]\r\nbit_array = set()\r\n\r\nfor i in range(n):\r\n temp = input()\r\n temp2 = \"\"\r\n for c in temp:\r\n if c != \" \":\r\n temp2 += c \r\n bit_array.add(temp2)\r\n\r\n# print(bit_array)\r\nls = list(bit_array)\r\nans = \"no\"\r\nfor x in ls:\r\n for y in ls:\r\n temp = \"\"\r\n for i in range(k):\r\n temp += str(int(x[i]) & int(y[i]))\r\n if temp == \"0\" * k:\r\n ans = \"yes\"\r\n break\r\n\r\nprint(ans)", "n, k = map(int, input().split())\r\narr = [list(map(int, input().split())) for _ in range(n)]\r\nvis = [0] * (1 << k)\r\nfor i in arr:\r\n x = 0\r\n for j in i:\r\n x = 2*x + j\r\n if x == 0:\r\n print('YES')\r\n exit()\r\n for j in range(len(vis)):\r\n if j & x == 0 and vis[j]:\r\n print('YES')\r\n exit()\r\n vis[x] = 1\r\nprint('NO')\r\n", "def test(masks, wanted):\n for w in wanted:\n if w not in masks:\n return False\n return True\n\ndef any_test(masks, tests):\n for t in tests:\n if test(masks, t):\n return True\n return False\n\ndef inflate(perm):\n count = max(perm)\n masks = [[0 for i in range(len(perm))] for j in range(count)]\n\n for i in range(len(perm)):\n if perm[i] == 0:\n continue\n masks[perm[i] - 1][i] = 1\n return [tuple(m) for m in masks]\n\ndef gen(st, lev, teams, tests):\n if lev >= teams:\n if max(st) > 1:\n tests.append(inflate(st))\n return\n\n for i in range(teams + 1):\n st[lev] = i\n gen(st, lev + 1, teams, tests)\n\ndef gen_tests(teams):\n tests = []\n st = [0 for i in range(teams)]\n\n gen(st, 0, teams, tests)\n return tests\n\ndef back(masks, teams):\n tests = gen_tests(teams)\n return any_test(masks, tests)\n\ndef main():\n probs, teams = map(int, input().split())\n masks = set()\n \n for i in range(probs):\n conf = tuple(list(map(int, input().split())))\n if 1 not in conf:\n print('YES')\n return\n masks.add(conf)\n\n if teams == 1:\n print('NO')\n return\n\n if teams == 2:\n good = test(masks, [(0, 1), (1, 0)])\n else:\n good = back(masks, teams)\n\n print('YES' if good else 'NO')\n\nmain()\n", "n,k = map(int, input().split())\r\nB = [0]*16\r\nfor i in range(n):\r\n A = list(map(int, input().split()))\r\n b = 0\r\n for j, a in enumerate(A):\r\n b += a*(1<<j)\r\n B[b] += 1\r\nfor i in range(16):\r\n for j in range(16):\r\n if i&j == 0 and B[i] and B[j]:\r\n print('YES')\r\n exit()\r\nprint('NO')", "n, k = [int(z) for z in input().split()]\r\nans = [0] * 16\r\nfor i in range(n):\r\n problem = [int(z) for z in input().split()]\r\n s = 0\r\n for j in range(k):\r\n s = s * 2 + problem[j]\r\n ans[s] += 1\r\n#print(ans)\r\nfor i in range(16):\r\n for j in range(16):\r\n if ans[i] > 0 and ans[j] > 0 and (i & j) == 0:\r\n print(\"YES\")\r\n exit(0)\r\nprint(\"NO\")", "\r\nn,k=map(int,input().split())\r\ndic={}\r\nfor i in range(2**k):\r\n dic[i]=False\r\nfor _ in range(n):\r\n arr=list(map(int,input().split()))\r\n num=0\r\n fac=1\r\n for i in arr:\r\n num+=i*fac\r\n fac*=2\r\n dic[num]=True\r\nflag=False\r\nfor i in range(2**k):\r\n if dic[i]:\r\n for j in range(2**k):\r\n if (i&j)==0 and dic[j]:\r\n flag=True\r\nif flag:\r\n print(\"YES\")\r\nelse :\r\n print(\"NO\")", "def fun(l):\r\n s=0\r\n for i in range(len(l)):\r\n s+=l[i]<<(i)\r\n return s\r\nla=[0 for i in range(16)]\r\nn,k=[int(i) for i in input().split()]\r\nfor i in range(n):\r\n la[fun([int(j) for j in input().split()])]+=1\r\nf=0\r\nfor i in range(16):\r\n if la[i]>0:\r\n for j in range(i+1,16):\r\n if la[j]>0:\r\n if i&j==0:\r\n f=1\r\nif f==1 or la[0]>0:\r\n print(\"yes\")\r\nelse:\r\n print(\"no\")\r\n \r\n", "n,k = list(map(int, input().split()))\r\nsq_k = 2**k\r\nrec = [0]*sq_k\r\nfor _ in range(n):\r\n ind = int(''.join(input().split()), 2)\r\n rec[ind] += 1\r\nans = 'YES'\r\nif rec[0] > 0:\r\n print(ans)\r\n exit()\r\nfor i in range(sq_k):\r\n for j in range(sq_k):\r\n if rec[i] > 0 and rec[j] > 0:\r\n if i&j == 0:\r\n print(ans)\r\n exit()\r\nprint('NO')", "n, k = map(int,input().split())\r\nfreq = { mask:0 for mask in range(1<<k) }\r\nfor i in range(n):\r\n\tfreq[int(''.join([x for x in input().split()]),2)] += 1\r\ndef solve(freq,k):\r\n\tif freq[0] >= 1:\r\n\t\treturn True\r\n\tfor mask1 in range(1<<k):\r\n\t\tfor mask2 in range(1<<k):\r\n\t\t\tif mask1&mask2==0 and freq[mask1] >= 1 and freq[mask2] >= 1:\r\n\t\t\t\treturn True\r\n\treturn False\r\n\r\nprint(\"YES\" if solve(freq,k) else \"NO\")", "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,M = map(int,input().split())\ns = set()\nfor _ in range(N):\n S = input().split()[::-1]\n num = 0\n for i in range(M):\n num+=2**i*int(S[i])\n s.add(num)\n\nif 0 in s:exit(print(\"YES\"))\n\nfor i in s:\n for j in s:\n if i&j==0:exit(print(\"YES\"))\nprint(\"NO\")\n", "import os\r\nimport sys\r\nfrom io import BytesIO, IOBase\r\nBUFSIZE = 8192\r\nclass FastIO(IOBase):\r\n newlines = 0\r\n def __init__(self, file):\r\n self._fd = file.fileno()\r\n self.buffer = BytesIO()\r\n self.writable = \"x\" in file.mode or \"r\" not in file.mode\r\n self.write = self.buffer.write if self.writable else None\r\n def read(self):\r\n while True:\r\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\r\n if not b:\r\n break\r\n ptr = self.buffer.tell()\r\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\r\n self.newlines = 0\r\n return self.buffer.read()\r\n def readline(self):\r\n while self.newlines == 0:\r\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\r\n self.newlines = b.count(b\"\\n\") + (not b)\r\n ptr = self.buffer.tell()\r\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\r\n self.newlines -= 1\r\n return self.buffer.readline()\r\n def flush(self):\r\n if self.writable:\r\n os.write(self._fd, self.buffer.getvalue())\r\n self.buffer.truncate(0), self.buffer.seek(0)\r\nclass IOWrapper(IOBase):\r\n def __init__(self, file):\r\n self.buffer = FastIO(file)\r\n self.flush = self.buffer.flush\r\n self.writable = self.buffer.writable\r\n self.write = lambda s: self.buffer.write(s.encode(\"ascii\"))\r\n self.read = lambda: self.buffer.read().decode(\"ascii\")\r\n self.readline = lambda: self.buffer.readline().decode(\"ascii\")\r\nsys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)\r\ninput = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\r\ndef is_valid(curr,tmp):\r\n curr=curr[::-1]\r\n tmp=tmp[::-1]\r\n pos=0\r\n while True:\r\n if pos==len(curr) or pos==len(tmp):\r\n break\r\n if curr[pos]=='1':\r\n if tmp[pos]=='1':\r\n return False\r\n pos+=1\r\n return True\r\nn,k=map(int,input().split())\r\na=[]\r\nver=False\r\ndict={}\r\nfor i in range(n):\r\n tmp=list(map(int,input().split()))\r\n zero=tmp.count(0)\r\n s=\"\"\r\n for j in range(len(tmp)):\r\n s+=str(tmp[j])\r\n val=int(s,2)\r\n if val in dict:\r\n dict[val]+=1\r\n else:\r\n dict[val]=1\r\n if zero==len(tmp):\r\n ver=True\r\nif ver:\r\n print(\"YES\")\r\nelse:\r\n ver=False\r\n for i in dict:\r\n b=bin(i)[2:]\r\n for j in range(int(2**k)):\r\n d=[0]*k\r\n c=bin(j)[2:]\r\n x=-1\r\n y=len(c)-1\r\n for ll in range(len(c)):\r\n if c[y]=='1':\r\n d[x]=1\r\n y-=1\r\n x-=1\r\n tmp=\"\"\r\n for binary in d:\r\n tmp+=str(binary)\r\n val=int(tmp,2)\r\n if is_valid(bin(i)[2:],tmp):\r\n if val==i:\r\n if dict[val]>1:\r\n ver=True\r\n break\r\n else:\r\n if val in dict:\r\n ver=True\r\n break\r\n if ver:\r\n break\r\n if ver:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "from bisect import bisect_left as bl, bisect_right as br, insort\r\nimport sys\r\nimport heapq\r\nfrom math import *\r\nfrom collections import defaultdict as dd, deque\r\ndef data(): return sys.stdin.readline().strip()\r\ndef mdata(): return map(int, data().split())\r\n#sys.setrecursionlimit(100000)\r\n\r\nn,k=mdata()\r\ns=set()\r\nfor i in range(n):\r\n s.add(int(''.join(input().split()),2))\r\nfor i in s:\r\n for j in s:\r\n if i&j==0:\r\n print(\"YES\")\r\n exit()\r\nprint(\"NO\")", "problems,teams=[int(x) for x in input().split()]\r\nteams1=[0 for x in range(teams)]\r\nknown=set()\r\nfor i in range(problems):\r\n\tquestions=\"\".join(input().split())\r\n\tknown.add(int(questions,2))\r\nknown=sorted(known)\r\nz=len(known)\r\nfor i in range(z):\r\n\tfor j in range(i,z):\r\n\t\tif known[i]&known[j]==0:\r\n\t\t\tprint(\"YES\")\r\n\t\t\texit()\r\nprint(\"NO\")\r\n#print(known)\r\n", "n,k=map(int,input().split()) \r\ncount=[0]*(2**k)\r\nfor _ in range(n):\r\n s=\"\".join(input().split()) \r\n cur=0\r\n for i in range(k):\r\n if s[i]=='1':\r\n cur=cur|(1<<i) \r\n count[cur]+=1 \r\n\r\nflag=False \r\nfor i in range(len(count)):\r\n for j in range(len(count)):\r\n if i&j==0 and count[i]>0 and count[j]>0:\r\n flag=True \r\n break\r\n if flag:\r\n break\r\nif flag:\r\n print(\"yes\")\r\nelse:\r\n print(\"no\")\r\n ", "n, k = map(int, input().split())\r\nk21 = (1 << k) - 1\r\ninn = [0] * (1 << k)\r\nfor i in range(n):\r\n inn[int(\"\".join(input().split()), 2)] = 1\r\nif inn[0]:\r\n print(\"YES\")\r\n exit()\r\na = []\r\nfor i, x in enumerate(inn):\r\n if x:\r\n a.append(i)\r\nfor i in range(1, len(a)):\r\n for j in range(i):\r\n if a[i] & a[j] == 0:\r\n print(\"YES\")\r\n exit()\r\nprint(\"NO\")", "import 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():\r\n return sys.stdin.readline().strip()\r\n\r\n def read_int(self):\r\n return int(self._read())\r\n\r\n def read_float(self):\r\n return float(self._read())\r\n\r\n def read_ints(self):\r\n return map(int, self._read().split())\r\n\r\n def read_floats(self):\r\n return map(float, self._read().split())\r\n\r\n def read_ints_minus_one(self):\r\n return map(lambda x: int(x) - 1, self._read().split())\r\n\r\n def read_list_ints(self):\r\n return list(map(int, self._read().split()))\r\n\r\n def read_list_floats(self):\r\n return list(map(float, self._read().split()))\r\n\r\n def read_list_ints_minus_one(self):\r\n return list(map(lambda x: int(x) - 1, self._read().split()))\r\n\r\n def read_str(self):\r\n return self._read()\r\n\r\n def read_list_strs(self):\r\n return self._read().split()\r\n\r\n def read_list_str(self):\r\n return list(self._read())\r\n\r\n @staticmethod\r\n def st(x):\r\n return sys.stdout.write(str(x) + '\\n')\r\n\r\n @staticmethod\r\n def lst(x):\r\n return sys.stdout.write(\" \".join(str(w) for w in x) + '\\n')\r\n\r\n @staticmethod\r\n def round_5(f):\r\n res = int(f)\r\n if f - res >= 0.5:\r\n res += 1\r\n return res\r\n\r\n @staticmethod\r\n def max(a, b):\r\n return a if a > b else b\r\n\r\n @staticmethod\r\n def min(a, b):\r\n return a if a < b else b\r\n\r\n\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 dct = set()\r\n for _ in range(n):\r\n lst = ac.read_list_ints()\r\n num = 0\r\n for x in lst:\r\n num *= 2\r\n num += x\r\n dct.add(num)\r\n if 0 in dct:\r\n ac.st(\"Yes\")\r\n return\r\n lst = list(dct)\r\n m = len(lst)\r\n for i in range(m):\r\n for j in range(i + 1, m):\r\n if lst[i] & lst[j] == 0:\r\n ac.st(\"Yes\")\r\n return\r\n ac.st(\"NO\")\r\n return\r\n\r\n\r\nSolution().main()\r\n", "'''input\r\n2 3\r\n0 0 1\r\n1 0 0\r\n'''\r\nfrom sys import stdin\r\ninput = stdin.readline\r\nimport math\r\nimport sys\r\nfrom collections import defaultdict\r\nsys.setrecursionlimit(10 ** 4)\r\n\r\n\r\ndef get_all(string, index, temp, aux):\r\n\tif index == len(string):\r\n\t\treturn aux.append(\"\".join(temp))\r\n\r\n\tif string[index] == '1':\r\n\t\ttemp.append('1')\r\n\t\tget_all(string, index + 1, temp, aux)\r\n\t\ttemp.pop()\r\n\t\ttemp.append('0')\r\n\t\tget_all(string, index + 1, temp, aux)\r\n\t\ttemp.pop()\r\n\telse:\r\n\t\ttemp.append('0')\r\n\t\tget_all(string, index + 1, temp, aux)\r\n\t\ttemp.pop()\r\n\r\n\r\ndef counter(string):\r\n\ttemp = []\r\n\tfor i in string:\r\n\t\tif i == '0':\r\n\t\t\ttemp.append('1')\r\n\t\telse:\r\n\t\t\ttemp.append('0')\r\n\taux = []\r\n\tget_all(temp, 0, [], aux)\r\n\treturn aux\r\n\r\n\r\n# main starts\r\nn, k = list(map(int, input().split()))\r\nnum = set()\r\nfor _ in range(n):\r\n\ttemp = list(input().split())\r\n\tnum.add(\"\".join(temp))\r\n\r\nif '0'*k in num:\r\n\tprint(\"YES\")\r\n\texit()\r\n\r\n# print(num)\r\n\r\nfor i in num:\r\n\ta = counter(i)\r\n\tfor j in a:\r\n\t\tif j in num:\r\n\t\t\tprint(\"YES\")\r\n\t\t\texit()\r\nelse:\r\n\tprint(\"NO\")", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Thu Oct 5 13:30:23 2017\r\n\r\n@author: savit\r\n\"\"\"\r\n\r\nn,k=map(int,input().split())\r\ns=[]\r\nA=[]\r\nfor i in range(16):\r\n A.append(False)\r\nfor i in range(n):\r\n s.append(input())\r\n s[i]=s[i].replace(' ','')\r\n s[i]=s[i] + '0'*(4-k)\r\n s[i]=int(s[i],2)\r\n A[s[i]]=True\r\nfl=False\r\nif(A[0]):\r\n fl=True\r\nif(A[1]):\r\n for i in range(2,16,2):\r\n if(A[i]):\r\n fl=True\r\nif(A[2] and (A[4] or A[5] or A[8] or A[9] or A[12] or A[13] or A[1])):\r\n fl=True\r\nif(A[4] and (A[8] or A[9] or A[10] or A[11] or A[3] or A[1] or A[2])):\r\n fl=True\r\nif(A[8]):\r\n for i in range(8):\r\n if(A[i]):\r\n fl=True\r\nif(A[3] and A[12]):\r\n fl=True\r\nif(A[6] and A[9]):\r\n fl=True\r\nif(A[5] and A[10]):\r\n fl=True\r\nif(fl):\r\n print('YES')\r\nelse:\r\n print('NO')\r\n\r\n\r\n", "n, k=map(int, input().split())\ns=set()\nfor x in range(n):\n\ts.add(int(''.join(map(str,input().split())),2))\n\t\nfound=False\nfor i in s:\n\tfor j in s:\n\t\tif i&j==0 and not found:\n\t\t\tprint(\"YES\")\n\t\t\tfound=True\n\t\t\tbreak\n\t\t\nif not found:\n\tprint(\"NO\")\n", "from math import inf\r\nfrom collections import *\r\nimport math, os, sys, heapq, bisect, random\r\nfrom functools import lru_cache\r\nfrom itertools import *\r\ndef inp(): return sys.stdin.readline().rstrip(\"\\r\\n\")\r\ndef out(var): sys.stdout.write(str(var)) # for fast output, always take string\r\ndef inpu(): return int(inp())\r\ndef lis(): return list(map(int, inp().split()))\r\ndef stringlis(): return list(map(str, inp().split()))\r\ndef sep(): return map(int, inp().split())\r\ndef strsep(): return map(str, inp().split())\r\ndef fsep(): return map(float, inp().split())\r\nM,M1=1000000007,998244353\r\n\r\ndef main():\r\n how_much_noob_I_am = 1\r\n #how_much_noob_I_am = inpu()\r\n for __ in range(how_much_noob_I_am):\r\n n,k = sep()\r\n l=[lis() for i in range(n)]\r\n for i in range(n):\r\n ans=\"\"\r\n for j in l[i]:\r\n ans+=str(j)\r\n l[i]=int(ans,2)\r\n p=set(l)\r\n for i in p:\r\n for j in p:\r\n if i&j==0:\r\n print(\"YES\")\r\n exit()\r\n else:\r\n print(\"NO\")\r\n \r\nif __name__ == '__main__':\r\n main()\r\n", "n,k = map(int,input().split())\nl = [0]*100\nfor i in range(n):\n l[int(''.join(input().split()),2)] =1\nfor i in range(16):\n for j in range(16):\n if(l[i] and l[j] and i&j == 0):\n print(\"YES\")\n exit(0)\nprint(\"NO\")\n\n \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(m):\r\n\ta,b=map(int,input().split())\r\n\tl.append([b,a])\r\nl.sort(reverse=True)\r\ni=c=0\r\nwhile n>0 and i<len(l):\r\n\tif l[i][1]<n:\r\n\t\tn-=l[i][1]\r\n\t\tc+=l[i][0]*l[i][1]\r\n\t\ti+=1\r\n\telse:\r\n\t\t# print(n)\r\n\t\td=n\r\n\t\tn-=d\r\n\t\tc+=l[i][0]*d\r\nprint(c)", "x, y = list(map(int, input().split()))\r\nl = []\r\nfor i in range(y):\r\n l.append(list(map(int, input().split())))\r\n\r\nl.sort(key=lambda x: x[1] , reverse=True)\r\n\r\nans = 0\r\nfor i in range(len(l)):\r\n if x > l[i][0]:\r\n ans += l[i][0] * l[i][1]\r\n x -= l[i][0]\r\n else:\r\n ans += l[i][1] * x\r\n break\r\n\r\nprint(ans)", "import sys\r\ninput = sys.stdin.readline\r\nread_tuple = lambda _type: map(_type, input().split(' '))\r\n \r\n \r\ndef solve():\r\n n, m = read_tuple(int)\r\n c = {}\r\n for _ in range(m):\r\n a, b = read_tuple(int)\r\n c[b] = c.get(b, 0) + a\r\n ans = 0\r\n for b_i in sorted(c, reverse=True):\r\n if n and c[b_i] <= n:\r\n ans += b_i * c[b_i]\r\n n -= c[b_i]\r\n elif n and c[b_i] > n:\r\n ans += b_i * n\r\n n = 0\r\n print(ans)\r\n \r\nif __name__ == '__main__':\r\n solve()", "l = list(map(int,input().split(\" \")))\r\na = []\r\nb = []\r\nfor i in range(l[1]):\r\n x = (list(map(int,input().split(\" \"))))\r\n a.append(x[0])\r\n b.append(x[1])\r\n\r\nz = l[0]\r\n# print(b)\r\ncount = 0\r\nif len(b)!=1:\r\n while(z!=0 and len(b)>0):\r\n maxVal = max(b)\r\n index = b.index(maxVal)\r\n if z-a[index]>=0:\r\n count+= a[index]*maxVal\r\n z-=a[index]\r\n else:\r\n count+= z*maxVal\r\n z-=z\r\n \r\n b.pop(index)\r\n a.pop(index)\r\nelse:\r\n if z<a[0]:\r\n count+= z*b[0]\r\n else:\r\n count+= a[0]*b[0]\r\n\r\nprint(count)", "n, m = map(int, input().split())\r\nadict = {}\r\nalist = sorted(list(map(int, input().split()))[::-1] for _ in range(m))\r\ncount = 0\r\n\r\nwhile n > 0 and m > 0:\r\n taken = min(n, alist[m - 1][1])\r\n count += taken*alist[m - 1][0]\r\n n -= taken\r\n m -= 1\r\n \r\nprint(count)", "n,m=map(int,input().split())\r\nz=0\r\nl1=[]\r\nl2=[]\r\nwhile(z<m):\r\n a,b=map(int,input().split())\r\n l1.append(a)\r\n l2.append(b)\r\n z+=1 \r\ne=0\r\nwhile(n>0 and m>0):\r\n if(l1[l2.index(max(l2))]>n):\r\n e+=l2[l2.index(max(l2))]*n\r\n n=0\r\n else:\r\n e+=(max(l2)*(l1[l2.index(max(l2))]))\r\n n-=l1[l2.index(max(l2))]\r\n l2[l2.index(max(l2))]=-1\r\n m-=1 \r\nprint(e) \r\n\r\n\r\n\r\n", "n, m = map(int, input().split())\r\n\r\na = []\r\n\r\nfor i in range(m):\r\n c,c_2 = map(int,input().split())\r\n a.append((c, c_2))\r\na = sorted(a, key = lambda x: x[1], reverse = True)\r\n#print(a)\r\nans = 0\r\ni = 0\r\nwhile n != 0 and i < m:\r\n if n > a[i][0]:\r\n ans += a[i][0]*a[i][1]\r\n n -= a[i][0]\r\n else:\r\n ans += a[i][1]*n\r\n break\r\n i += 1\r\nprint(ans)\r\n\r\n \r\n", "n,m=map(int,input().split())\r\nw=[]\r\nfor i in range(m):\r\n\tg=list(map(int,input().split()))\r\n\tw.append(g)\r\n\r\nl=sorted(w,key=lambda x: x[1])[::-1]\r\n\r\ntot=0\r\nfor i in range(len(l)):\r\n\tn=n-l[i][0]\r\n\tif n>=0:\r\n\t\ttot+=l[i][0]*l[i][1]\r\n\telse:\r\n\t\ttot+=(n+l[i][0])*l[i][1]\r\n\t\tbreak\r\nprint(tot)\r\n\r\n", "m,n=map(int,input().split())\narr=[]\nfor _ in range(n):\n arr.append(list(map(int,input().split())))\n\nlarr=sorted(arr,key=lambda x:x[1],reverse=True)\nans=0\nfor i in range(n):\n if(larr[i][0]<=m):\n ans=ans+larr[i][1]*larr[i][0]\n m=m-larr[i][0]\n else:\n ans=ans+m*larr[i][1]\n break\n\nprint(ans)\n\n", "n, m = [int(x) for x in input().split()]\n\nabz = []\n\nfor _ in range(m):\n a, b = [int(x) for x in input().split()]\n abz.append([a,b])\n\n# sort by box capacity\nabz.sort(key=lambda x: x[1], reverse=True)\n\nres = 0\ni = 0\nstop = False\nwhile n:\n # iterate till find non-empty containter\n while abz[i][0] == 0:\n if i == len(abz) - 1:\n stop = True\n break\n i += 1\n\n if stop:\n break\n\n max_n = min(n, abz[i][0])\n res += max_n * abz[i][1]\n n -= max_n\n abz[i][0] -= max_n\n\n\nprint(res)\n\n\n\n", "N, M = list(map(int, input().split()))\r\nX = {}\r\nfor _ in range(M):\r\n Y = list(map(int, input().split()))\r\n X[Y[1]] = X.get(Y[1],0)+Y[0]\r\nK = 0\r\nfor i in sorted(X,reverse=1):\r\n K += i*min(N,X[i])\r\n N -= min(N,X[i])\r\nprint(K)", "n, m = [int(x) for x in input().split()]\r\ncontainer = []\r\n\r\nfor i in range(m):\r\n ai, bi = [int(x) for x in input().split()]\r\n container.append((bi,ai))\r\n\r\ncontainer.sort()\r\ncontainer = container[::-1]\r\n\r\nans = 0\r\nfor i in container:\r\n amt = min(i[1],n)\r\n ans += i[0] * amt\r\n n -= amt\r\n\r\n if n<=0:\r\n break\r\n\r\nprint(ans)\r\n\r\n", "n,m = map(int,input().split())\r\na,b,countm,countMbox,p,x = [],[],0,0,0,0\r\nfor i in range(m):\r\n c,d = map(int,input().split())\r\n a.append(c)\r\n b.append(d)\r\n countMbox += c\r\n countm += c*d\r\n\r\nif countMbox <= n:\r\n print(countm)\r\n n = 0\r\nwhile n:\r\n x = b.index(max(b))\r\n if n <= a[x]:\r\n p += n*b[x]\r\n print(p)\r\n break\r\n else:\r\n p += a[x]*b[x]\r\n n = n - a[x]\r\n b[x] = 0\r\n ", "from operator import itemgetter\n\nn,m = map(int,input().split())\nlf = []\nfor i in range(m):\n ll = list(map(int,input().split()))\n lf.append(ll)\n\nlf = sorted(lf, key=itemgetter(1), reverse=True)\n\nsum = 0\n\nfor i in range(m):\n if(lf[i][0]<=n):\n n-=lf[i][0]\n sum+=(lf[i][1]*lf[i][0])\n else:\n sum+=(lf[i][1]*n)\n n=0\n if(not n):break\nprint(sum)\n", "l1 = [int(x) for x in input().split()]\r\nn,m = l1[0],l1[1]\r\nl2=[]\r\nfor x in range(m):\r\n l2.append([int(x) for x in input().split()])\r\ndef myfunc(l1):\r\n return l1[1]\r\nl2.sort(key=myfunc,reverse=True)\r\ni=0\r\nans=0\r\n#print(l2)\r\nwhile i<len(l2):\r\n if l2[i][0]>=n:\r\n ans+=n*l2[i][1]\r\n break\r\n else:\r\n n-=l2[i][0]\r\n ans+=l2[i][0]*l2[i][1]\r\n i+=1\r\nprint(ans)\r\n\r\n \r\n\r\n\r\n", "n,m = map(int,input().split())\r\nd={}\r\nk=0\r\nfor i in range(m):\r\n\r\n a,b = map(int,input().split())\r\n\r\n if b in d:\r\n d[b]+=a\r\n else:\r\n d[b] = a\r\nl = sorted(d.keys())[::-1]\r\nfor i in l:\r\n if n==0:\r\n break\r\n if n>d[i]:\r\n\r\n k+=i*d[i]\r\n n-=d[i]\r\n d[i]=0\r\n else:\r\n\r\n k+=i*(n)\r\n d[i]=0\r\n n=0\r\n\r\nprint(k)", "from operator import itemgetter\r\nn,m = map(int,input().split())\r\narr = [ list(map(int,input().split())) for _ in range(m)]\r\narr = list(reversed(sorted(arr,key=itemgetter(1))))\r\ncnt = 0;sum = 0;i=0\r\nwhile (True):\r\n if arr[i][0] >= n: sum+=(n)*arr[i][1]; n-=arr[i][0];\r\n else : n-=arr[i][0]; sum+=arr[i][0]*arr[i][1]\r\n i+=1\r\n if (n <= 0 or i == m): break\r\nprint(sum)\r\n", "from sys import stdin, stdout\r\ndef get_int(): return int(stdin.readline().strip())\r\ndef get_ints(): return map(int,stdin.readline().strip().split()) \r\ndef get_array(): return list(map(int,stdin.readline().strip().split()))\r\ndef get_string(): return stdin.readline().strip()\r\ndef op(c): return stdout.write(c)\r\nfrom collections import defaultdict \r\nn,m=get_ints()\r\na=[]\r\nfor i in range(m):\r\n a.append(tuple(get_ints()))\r\na.sort(key =lambda x: x[1],reverse=True)\r\nc=0\r\nfor i,j in a:\r\n if i<n:\r\n c+=(i*j)\r\n n=n-i\r\n else:\r\n c+=(n*j)\r\n break\r\nprint(c)\r\n \r\n\r\n", "n,m=map(int,input().split())\r\nli=[]\r\nfor i in range(m):\r\n a,b=map(int,input().split())\r\n li.append([b,a])\r\nli=sorted(li,reverse=True)\r\nsum=0\r\nfor i in li:\r\n if n>=i[1]:\r\n sum=sum+(i[0]*i[1])\r\n n=n-i[1]\r\n else:\r\n sum=sum+(i[0]*n)\r\n n=0\r\n break\r\nprint(sum)\r\n", "import math\r\nimport queue\r\n\r\nfrom itertools import permutations\r\n\r\nclass Container:\r\n def __init__(self, a,b):\r\n self.a=a\r\n self.b=b\r\n \r\nn,m=map(int,input().split())\r\nmatch=0\r\nanswer=0\r\nc=[]\r\n\r\nfor i in range(0,m):\r\n a,b=map(int,input().split())\r\n c.append(Container(a,b))\r\n\r\nc.sort(key=lambda x:x.b,reverse=True)\r\n\r\nfor i in range(0,m):\r\n a=c[i].a\r\n b=c[i].b\r\n \r\n if match+a<=n:\r\n match+=a\r\n answer+=a*b\r\n else:\r\n answer+=(n-match)*b\r\n break\r\n\r\nprint(answer)", "def solve():\r\n max_hold , containers = map(int, input().split())\r\n pos = []\r\n for i in range(containers):\r\n boxes , matches = map(int, input().split())\r\n pos.append((boxes,matches))\r\n\r\n pos.sort(key= lambda a : a[1] , reverse = True)\r\n \r\n ans = 0\r\n for i in pos:\r\n if max_hold != 0:\r\n ans += i[1] * min(max_hold,i[0])\r\n max_hold -= min(max_hold,i[0])\r\n \r\n\r\n return ans\r\n \r\n\r\n\r\n\r\nprint(solve())", "def main():\r\n\r\n def solve(n, h):\r\n ret = 0\r\n h.sort(key=lambda x: x[1], reverse=True)\r\n\r\n for a in h:\r\n mn = min(n, a[0])\r\n ret += mn * a[1]\r\n n -= mn\r\n if n == 0:\r\n return ret\r\n \r\n return ret\r\n\r\n n, m = [int(x) for x in input().split()]\r\n h = []\r\n\r\n for _ in range(m):\r\n ab = [int(x) for x in input().split()]\r\n h.append(ab)\r\n \r\n print(solve(n, h))\r\n\r\n\r\nif __name__ == \"__main__\":\r\n import sys, threading\r\n input = sys.stdin.readline\r\n thread = threading.Thread(target=main)\r\n thread.start()\r\n thread.join()", "from sys import stdin, stdout # only need for big input\n\ndef read_int_from_line():\n return list(map(int, input().split()))\n\ndef solve():\n n, m = read_int_from_line()\n matches = []\n for _ in range(m):\n a, b = read_int_from_line()\n matches.append((a,b))\n matches.sort(key= lambda x : x[1], reverse=True)\n # print(matches)\n cur_holding = 0\n ans = 0\n for m in matches:\n pick = min(m[0], n - cur_holding)\n ans += m[1] * pick \n cur_holding += pick\n print(ans)\n\n\ndef main():\n solve()\n\n\nif __name__ == \"__main__\":\n main()", "n, m = map(int, input().split())\nc = []\nfor i in range(m):\n xy = tuple(map(int, input().split()))\n c.append(xy)\n\nc.sort(key=lambda x: x[1], reverse=True)\nmatches = 0\nboxes = 0\nfor a, b in c:\n avail_boxes = min(a, n - boxes)\n matches += avail_boxes * b\n boxes += avail_boxes\n if boxes == n:\n break\n\nprint(matches)\n", "n,m=map(int,input().split())\r\nar=[]\r\nfor i in range(m):\r\n a,b=map(int,input().split())\r\n ar.append([b,a])\r\nar=sorted(ar)[::-1]\r\nans=0\r\nfor e in ar:\r\n c=min(e[1],n)\r\n n-=c\r\n ans+=c*e[0]\r\nprint(ans)", "from itertools import accumulate\r\n\r\ndef main():\r\n\tn, m = map(int, input().split())\r\n\tli = []\r\n\tfor _ in range(m):\r\n\t\ta, b = map(int, input().split())\r\n\t\tli.append([a, b])\r\n\r\n\tli.sort(key = lambda x: x[1], reverse = True)\r\n\r\n\tbox = [li[i][0] for i in range(m)]\r\n\tbox = list(accumulate(box))\r\n\tto_take = float('inf')\r\n\tfor i in range(m):\r\n\t\tif box[i] > n:\r\n\t\t\tto_take = i\r\n\t\t\tbreak\r\n\r\n\tans = 0\r\n\tif to_take == -1:\r\n\t\tans += n * li[0][1]\r\n\telif to_take == float('inf'):\r\n\t\tfor i in range(m):\r\n\t\t\tans += li[i][0] * li[i][1]\r\n\telse:\r\n\t\ttaken = 0\r\n\t\tfor i in range(to_take):\r\n\t\t\tans += li[i][0] * li[i][1]\r\n\t\t\ttaken += li[i][0]\r\n\t\tans += (n - taken) * li[to_take][1]\r\n\r\n\tprint(ans)\r\n\r\n\r\n\r\nif __name__ == '__main__':\r\n\tmain()", "import sys\r\n\r\ninput = sys.stdin.buffer.readline\r\n\r\n\r\nn, m = map(int, input().split())\r\na = [list(map(int, input().split())) for j in range(m)]\r\na.sort(key=lambda x: x[1], reverse=True)\r\n\r\nans = 0\r\nfor i in range(m):\r\n n -= a[i][0]\r\n if n > 0:\r\n ans += a[i][0] * a[i][1]\r\n elif n <= 0:\r\n ans += (n + a[i][0]) * a[i][1]\r\n break\r\nprint(ans)", "n,m = map(int,input().split())\r\nl = []\r\nfor i in range(m):\r\n a,b = map(int,input().split())\r\n l.append((a,b))\r\nd = sorted(l,key = lambda x: x[1] ,reverse = True)\r\ncount = 0\r\n# print(d)\r\nfor i in d:\r\n if n>0:\r\n if n-i[0] >=0:\r\n count +=(i[0])*i[1]\r\n n -=i[0]\r\n else:\r\n count += (n)*i[1]\r\n n = 0\r\nprint(count)\r\n", "n, m = map(int, input().split())\r\nmat = []\r\nsti = []\r\nans = 0\r\nfor i in range(m):\r\n a, b = map(int, input().split())\r\n mat.append(a)\r\n sti.append(b)\r\nzipped_lists = zip(sti, mat)\r\nsorted_pairs = sorted(zipped_lists, reverse=True)\r\ntuples = zip(*sorted_pairs)\r\nsti, mat = [ list(tuple) for tuple in tuples]\r\n\r\nfor i in range(m):\r\n if n <= mat[i]:\r\n ans += (n*sti[i])\r\n n = 0\r\n else:\r\n ans += (mat[i]*sti[i])\r\n n-=mat[i]\r\n if(n<=0):\r\n break\r\nprint(ans)\r\n", "n,m=[int(s) for s in input().split()]\r\na=[]\r\nfor i in range(m):\r\n p,q=[int(s) for s in input().split()]\r\n a+=[[q,p]]\r\na.sort()\r\na.reverse()\r\ns=0\r\ni=0\r\nwhile n>0 and i<len(a):\r\n k=min(n,a[i][1])\r\n s+=a[i][0]*k\r\n n-=k\r\n i+=1\r\nprint(s)", "n, m = map(int, input().split())\r\nl, ans = [], 0\r\nfor i in range(m):\r\n a, b = map(int, input().split())\r\n l.append([b,a])\r\nl = sorted(l)[::-1]\r\nfor a in l:\r\n b = min(a[1],n)\r\n n = n-b\r\n ans += b*a[0]\r\nprint(ans)", "I = lambda: map(int, input().split())\r\nn, m = I()\r\na = []\r\nfor _ in range(m):\r\n a.append(list(I()))\r\na.sort(key=lambda x: x[1], reverse=True)\r\nans = 0\r\nfor x in a:\r\n d = min(n, x[0])\r\n ans += d * x[1]\r\n n -= d\r\n if n <= 0:\r\n break\r\nprint(ans)\r\n", "(m,n),*a=[[*map(int,s.split())][::-1]for s in open(0)]\r\nv=0\r\nfor y,x in sorted(a)[::-1]:\r\n t=min(x,n)\r\n n-=t\r\n v+=t*y\r\nprint(v)", "n,m = map(int,input().split())\r\nmatches = []\r\nfor i in range(m):\r\n matches.append(list(map(int,input().split())))\r\n \r\nmatches.sort(reverse = True,key=lambda x:x[1])\r\nsum_ = 0\r\nfor i in range(m):\r\n if n == 0:\r\n break\r\n val = min(n,matches[i][0])\r\n n = n - val\r\n sum_ += val * matches[i][1]\r\n \r\nprint(sum_)", "def function(x):\r\n return [x[1],x[0]]\r\nlist1=[]\r\nn,m=map(int,input().split())\r\nfor i in range(m):\r\n datax,datay=map(int,input().split())\r\n list1.append([datax,datay])\r\n\r\n\r\n\r\nlist1.sort(key=function,reverse=True)\r\nsum1=0\r\nfor qty,val in list1:\r\n if qty>n:\r\n sum1+=n*val\r\n break\r\n \r\n sum1+=qty*val\r\n n-=qty\r\n\r\nprint(sum1)\r\n", "n,m=map(int,input().split())\r\ns=[]\r\nfor i in range(m):\r\n a,b=map(int,input().split())\r\n s.append([b,a])\r\ns.sort(reverse=True)\r\nss=0\r\nfor k in range(len(s)):\r\n if n<=0:\r\n break\r\n else:\r\n ss+=min(n,s[k][1])*s[k][0]\r\n n-=s[k][1]\r\nprint(ss)", "inputs=input().split()\r\nn=int(inputs[0]);m=int(inputs[1])\r\nmatches=[]\r\nfor i in range(m):\r\n match=list(map(int,input().split()))\r\n matches.append(match)\r\nmatches.sort(key=lambda s:s[1],reverse=True)\r\nmat=0\r\nfor i in range(m):\r\n x=min(matches[i][0],n)\r\n n-=x\r\n mat+=matches[i][1]*x\r\nprint(mat)", "from operator import itemgetter\r\nn,m = map(int, input().split())\r\nmat = []\r\nr = 0\r\nfor i in range(m):\r\n mat.append([int(i) for i in input().split()])\r\nfor i in sorted(mat, key=itemgetter(1), reverse=True):\r\n if n >= i[0]:\r\n n -= i[0]\r\n r += i[0] * i[1]\r\n elif n == 0:\r\n break\r\n else:\r\n r += n*i[1]\r\n break\r\nprint(r)\r\n ", "t,n=input().split()\r\nt=int(t)\r\nn=int(n)\r\n\r\nlister=[0 for i in range(10)]\r\n\r\nwhile(n):\r\n x,y=input().split()\r\n x=int(x)\r\n y=int(y)\r\n \r\n lister[y-1]+=x\r\n n-=1\r\n\r\ncounter=0\r\ni=9\r\n#print(lister)\r\nwhile(t>0):\r\n if(t-lister[i]>0):\r\n counter+=(lister[i]*(i+1))\r\n else:\r\n counter+=(t*(i+1))\r\n \r\n t=t-lister[i]\r\n i-=1\r\n if(i==-1):\r\n break\r\n \r\nprint(counter)", "n,m = list(map(int,input().split()))\r\n\r\nsu = 0\r\nout = []\r\nfor _ in range(m):\r\n t = list(map(int,input().split()))\r\n out.append([t[0],t[1]])\r\n \r\nout = sorted(out,key = lambda x : x[1],reverse = True)\r\nfor v in out:\r\n if(v[0] <= n):\r\n su += v[0]*v[1]\r\n n -= v[0]\r\n continue\r\n else:\r\n su += n*v[1]\r\n break\r\n\r\nprint(su)\r\n \r\n", "n,m = map(int, input().split(\" \"))\r\na = []\r\nfor i in range(m):\r\n a.append(list(map(int,input().split(\" \"))))\r\na.sort(key = lambda x : x[1],reverse = True)\r\nsum = 0\r\nfor x in a:\r\n if n >= x[0]:\r\n sum = sum + x[0]*x[1]\r\n n = n - x[0]\r\n else:\r\n sum = sum + n*x[1]\r\n break\r\nprint(sum)", "I=lambda:map(int,input().split())\r\nn,m=I()\r\nr=0\r\nfor x in sorted([[*I()]for _ in[0]*m],key=lambda x:x[1])[::-1]:\r\n v=min(n,x[0])\r\n r+=v*x[1]\r\n n-=v\r\n if n<1:break\r\nprint(r)", "# B 16 - Burglar and Matches - Codeforces\r\n# Link : https://codeforces.com/contest/16/problem/B\r\n\r\n\r\nrucksack, numberOfContainers = list(map(int, input().split()))\r\n\r\nnumberOfMatches = 0\r\n\r\ndata = [0]*numberOfContainers\r\n\r\nfor i in range(numberOfContainers):\r\n userInput = list(map(int, input().split()))\r\n data[i] = (userInput[0], userInput[1])\r\n\r\ndata = sorted(data, key=lambda l: l[1], reverse=True)\r\n\r\nfor key, value in data:\r\n if (rucksack < 1):\r\n break\r\n if (rucksack >= key):\r\n rucksack -= key\r\n numberOfMatches += key * value\r\n else:\r\n numberOfMatches += rucksack * value\r\n rucksack = 0\r\n\r\nprint(numberOfMatches)\r\n", "import math\r\nimport os\r\nimport random\r\nimport re\r\nimport sys\r\nimport functools\r\nfrom operator import itemgetter, attrgetter\r\nfrom collections import Counter\r\n\r\nif __name__ == '__main__':\r\n Y = lambda: list(map(int, input().split()))\r\n N = lambda: int(input())\r\n\r\n n, m = Y()\r\n a, r = list(), 0\r\n\r\n for i in range(m):\r\n a.append(Y())\r\n a.sort(key=itemgetter(1), reverse=True)\r\n\r\n for i in a:\r\n if n <= 0:\r\n break\r\n h = n - i[0]\r\n r += i[0] * i[1] if h > 0 else n * i[1]\r\n n -= i[0]\r\n\r\n print(r)\r\n", "import bisect\r\nfrom itertools import accumulate\r\nn,m=list(map(int,input().split()))\r\na=[]\r\nfor i in range(m):\r\n l,b=list(map(int,input().split()))\r\n a.append((l,b))\r\na.sort(key=lambda x:x[1],reverse=True)\r\nsum1=0\r\ntotalmatch=0\r\n\r\n\r\nfor i in a:\r\n\tif totalmatch+i[0]==n:\r\n\t\tsum1+=i[0]*i[1]\r\n\t\tbreak\r\n\telif totalmatch+i[0]<n:\r\n\t\ttotalmatch+=i[0]\r\n\t\tsum1+=i[0]*i[1]\r\n\telse:\r\n\t\tremaining=n-totalmatch\r\n\t\tsum1+=remaining*i[1]\r\n\t\tbreak\r\nprint(sum1)\r\n\t\t\r\n\t\t\r\n\t\r\n\t\r\n\t\r\n\t\r\n\t\r\n\t\t\r\n#fst,l=*zip(a)\r\n#print(fst)\r\n", "n,m=map(int,input().split())\r\nmatch=[]\r\nfor i in range(m):\r\n a,b=map(int,input().split())\r\n match.append((a,b))\r\n\r\nmatch=sorted(match,reverse=True,key=lambda x:x[1])\r\n\r\ns=0\r\n\r\nfor i in match:\r\n mn=min(n,i[0])\r\n s+=mn*i[1]\r\n n-=mn\r\n if not(n):\r\n break\r\n\r\nprint(s)", "n,a = map(int ,input().split())\r\nar = []\r\nfor i in range(a):ar.append((tuple(map(int,input().split()))))\r\nar.sort(key=lambda x : x[1] , reverse=True)\r\nans =0\r\nfor i in ar:\r\n if n <=0:break\r\n if(i[0] <= n):ans += (i[1] * i[0]);n-=i[0]\r\n else :ans+= (i[1] * n);n=0\r\nprint(ans)", "n,m = map(int,input().split())\r\na = [list(map(int,input().split())) for _ in range(m)]\r\na.sort(lambda x:x[1])\r\nans = 0\r\nfor e in a[::-1]:\r\n q = min(n,e[0])\r\n ans+=q*e[1]\r\n n-=q\r\n if n<1:\r\n break\r\nprint(ans)", "n, m = map(int, input().split())\r\nmatches = []\r\nres = 0\r\n\r\nfor i in range (m):\r\n a, b = map(int, input().split())\r\n matches.append((a, b))\r\n\r\nsorted_matches = sorted(matches, key=lambda x: x[1], reverse=True)\r\n\r\nfor i in range (m):\r\n res += (min(n, sorted_matches[i][0]) * sorted_matches[i][1])\r\n n -= min(n, sorted_matches[i][0])\r\n if n == 0:\r\n break\r\n\r\nprint(res)", "num=list(map(int,input().split()))\r\nm,n=num\r\ntotal=[]\r\nsecond=[]\r\nfirst=[]\r\nmatches=0\r\ntempm=0\r\nfor i in range(n):\r\n num = list(map(int, input().split()))\r\n total.append(num)\r\n second.append(num[1])\r\n first.append(num[0])\r\nsecond.sort()\r\nf=n\r\nsums=sum(first)\r\nif sums<=m:\r\n while len(total)!=0:\r\n matches+=(total[0][0]*total[0][1])\r\n total.remove([total[0][0],total[0][1]])\r\nelse:\r\n while m>0:\r\n max = second[-1]\r\n second.remove(second[-1])\r\n while f!=0:\r\n if total[-f][-1]==max:\r\n match_max=total[-f][0]\r\n n-=1\r\n f=n\r\n total.remove([match_max,max])\r\n break\r\n else:\r\n f-=1\r\n if m>=match_max:\r\n m-=match_max\r\n matches+=(match_max*max)\r\n else:\r\n matches+=(m*max)\r\n m=0\r\nprint(matches)", "n,m=map(int,input().split())\narr=[]\nfor i in range(0,m):\n j,k=map(int,input().split())\n p1=(j,k)\n arr.append(p1)\narr=sorted(arr, key=lambda x: x[1])\n# print(arr)\np=0\nfor i in range(m-1,-1,-1):\n if n>0 and arr[i][0]<=n:\n n=n-arr[i][0]\n p=p+arr[i][1]*arr[i][0]\n # print(n,p)\n elif n>0 and arr[i][0]>n:\n p=p+n*arr[i][1]\n break\n # print(p)\nprint(p)\n", "n, m = map(int, input().split())\na = []\nresult = 0\nfor i in range(m):\n a.append(list(map(int, input().split())))\nfor i in range(len(a)):\n for j in range(len(a)):\n if a[i][1] > a[j][1]:\n a[i], a[j] = a[j], a[i]\nfor i in range(m):\n if n > a[i][0]:\n n -= a[i][0]\n result += a[i][0] * a[i][1]\n else:\n result += (n * a[i][1])\n break\n\nprint(result)\n\n\t\t \t\t\t \t \t \t\t \t \t \t \t \t \t", "import sys\n\ndef main(n, containers):\n containers.sort(key=lambda x: x[1], reverse=True)\n s = 0\n for e, cont in enumerate(containers):\n num, per_num = cont\n if num < n:\n n -= num\n s += num * per_num\n else:\n # Can't take all, but can take sum.\n s += n * per_num\n\n # No more n left.\n break\n print(s)\n\n\nif __name__ == \"__main__\":\n cases = []\n for e, line in enumerate(sys.stdin.readlines()):\n if e == 0:\n n, _ = map(int, line.strip().split())\n continue\n cases.append(list(map(int, line.strip().split())))\n main(n, cases)\n", "n, m = map(int, input().split())\r\n\r\nliste = []\r\ndict = {}\r\nmatches = 0\r\nfor i in range(m):\r\n a, b = map(int, input().split())\r\n if(b not in liste):\r\n dict[b] = a\r\n else:\r\n dict[b] += a\r\n liste.append(b)\r\n\r\nliste2 = sorted(liste, reverse=True)\r\n\r\nfor i in liste2:\r\n if(n >= dict[i]):\r\n matches += i * dict[i]\r\n n -= dict[i]\r\n dict[i] = 0\r\n\r\n else:\r\n matches += n * i\r\n break\r\nprint(matches)\r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Mon Jun 8 10:55:25 2020\r\n\r\n@author: Nada Adel\r\n\"\"\"\r\nimport sys\r\nline = input()\r\nline = line.split(' ')\r\nn=int(line[0])\r\nm=int(line[1])\r\na=[]\r\nb=[]\r\nmydic={}\r\ni=0\r\n\r\nwhile m>0:\r\n line = input()\r\n line = line.split(' ')\r\n ai=int(line[0])\r\n bi=int(line[1])\r\n a.append(ai)\r\n b.append(bi)\r\n mydic[i]=bi\r\n i+=1\r\n m-=1\r\n \r\nsortdic={k: v for k, v in sorted(mydic.items(), key=lambda item: item[1],reverse=True)}\r\n\r\ni=0\r\nsum1=0\r\nres=0\r\nfor key in sortdic:\r\n nn=a[key]\r\n sum1+=nn\r\n if sum1>n:\r\n sum1-=nn \r\n res+=(n-sum1)*b[key]\r\n sum1+=n-sum1\r\n break\r\n else : \r\n res+=nn*b[key]\r\n \r\nprint(res)", "n,m = map(int,input().split())\r\nt = []\r\nfor _ in range(m):\r\n t.append([int(i) for i in reversed(input().split())])\r\nt.sort()\r\nd=0\r\nfor i in range(len(t)-1,-1,-1):\r\n\tx = min(t[i][1],n)\r\n\tn = n - x\r\n\td += x*t[i][0]\r\nprint(d)", "z = []\r\nz[0:] = map(int,input().split())\r\nw = []\r\nq = []\r\nfor i in range(z[1]):\r\n w[0:] = map(int,input().split())\r\n q.append(w[:])\r\n\r\nq.sort(key= lambda lst:lst[1],reverse=True)\r\ncount = z[0]\r\ncounter = 0\r\nfor i in range(z[1]):\r\n count -= q[i][0]\r\n counter += q[i][0] * q[i][1]\r\n if count <= 0:\r\n counter += (count * q[i][1])\r\n break\r\n\r\nprint(counter)", "n,m = [int(i) for i in input().split()]\r\narr = []\r\nr = 0\r\nfor i in range(0,m):\r\n a,b = [int(i) for i in input().split()]\r\n arr.append((a,b))\r\ns_arr = sorted(arr, key=lambda tup: tup[1],reverse=True)\r\nfor e in s_arr:\r\n if e[0]<= n:\r\n n-=e[0]\r\n r+=(e[0]*e[1])\r\n elif e[0]>n:\r\n r+=(n*e[1])\r\n n=0\r\n if n==0:\r\n break\r\nprint(r)", "n, m = list(map(int, input().split()))\r\narr = []\r\nt = m\r\nwhile t > 0:\r\n t -= 1\r\n arr.append(list(map(int, input().split())))\r\n\r\n\r\narr = sorted(arr, key=lambda x: x[1], reverse=True)\r\n\r\nres = 0\r\nfor ma in arr:\r\n if ma[0] <= n:\r\n res += ma[1] * ma[0]\r\n n -= ma[0]\r\n else:\r\n res += n * ma[1]\r\n break\r\n\r\nprint(res)", "n, m = map(int, input().split())\r\ntemp = []\r\nfor i in range(m):\r\n temp.append(list(map(int, input().split())))\r\ntemp = sorted(temp, key=lambda x: x[1], reverse=True)\r\n#print(temp)\r\ns = 0\r\nfor i in temp:\r\n if n >= i[0]:\r\n n -= i[0]\r\n s += i[1] * i[0]\r\n #print(s)\r\n #print(n)\r\n elif n < i[0]:\r\n s += n * i[1]\r\n break\r\nprint(s)\r\n", "def B_Burglar_and_Matches(n,AB):\r\n AB.sort(key = lambda x: x[1] , reverse = True)\r\n ans = 0\r\n for ele in AB:\r\n if ele[0] <= n:\r\n ans += ele[0]*ele[1]\r\n n -= ele[0]\r\n else:\r\n ans += n*ele[1]\r\n break\r\n return ans\r\n\r\nn,m = input().split()\r\nn,m = int(n),int(m)\r\nAB = []\r\nfor i in range(m):\r\n ab = [int(x) for x in input().split()]\r\n AB.append(ab)\r\nres = B_Burglar_and_Matches(n,AB)\r\nprint(res)", "from typing import NamedTuple\r\nclass item(NamedTuple):\r\n a: int\r\n b: int\r\n\r\nn, m = list(map(int, input().split()))\r\nitems = []\r\ntot = 0\r\n\r\nfor line in range(m):\r\n a, b = list(map(int, input().split()))\r\n items.append(item(a, b))\r\n\r\nitems.sort(key=lambda x: x.b-0, reverse=True)\r\nfor i in items:\r\n temp = (n if n<i.a else i.a )\r\n tot += i.b * temp\r\n n -= temp\r\n\r\nprint(tot)", "n, m = map(int, input().split())\r\n\r\ndef getKey(item):\r\n return item[1]\r\n\r\nl = []\r\nfor i in range(m):\r\n l.append(list(map(int, input().split())))\r\n\r\nl = sorted(l, key=getKey, reverse=True)\r\n\r\ntotal = 0\r\nfor i in l:\r\n\r\n if n == 0:\r\n break\r\n elif n >= i[0]:\r\n n-=i[0]\r\n total+= i[1]*i[0]\r\n else:\r\n total+= n * i[1]\r\n n = 0\r\nprint(total)", "n,m = [int(x) for x in input().split()]\r\narray = []\r\nfor i in range(m):\r\n a,b = [int(x) for x in input().split()]\r\n array.append([a,b])\r\narray = sorted(array,key = lambda x:x[1],reverse = True)\r\nans = 0\r\ni =0\r\nwhile n>0 and i<m:\r\n val = min(n,array[i][0])\r\n n -= val \r\n ans += array[i][1]*val\r\n i+=1\r\nprint(ans)", "import sys\nlines = sys.stdin.readlines()\n(n,m) = map(int, lines[0].strip().split(\" \"))\nmatches = {}\nfor i in range(1, m+1):\n (a, b) = map(int, lines[i].strip().split(\" \"))\n if b not in matches: matches[b] = 0\n matches[b] += a\nkey = list(matches.keys())\nkey.sort(reverse = True)\n\ncount = 0\nres = 0\nfor k in key:\n if count + matches[k] <= n:\n res += k * matches[k]\n count += matches[k]\n else:\n res += (n - count) * k\n break\n\nprint(res)\n", "n,m = map(int,input().split())\narr = []\nfor i in range(m):\n a = list(map(int,input().split()))[::-1]\n arr.append(a)\nans = 0\narr.sort()\narr = arr[::-1]\ni=0\nwhile i<m and n>0:\n if arr[i][1]<=n:\n ans+=arr[i][0]*arr[i][1]\n n-= arr[i][1] \n else:\n ans+=arr[i][0]*n\n break\n i+=1\n \nprint(ans) \n \n ", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn, m = map(int, input().split())\r\ng = sorted([list(map(int, input().split()[::-1])) for _ in range(m)], reverse=True)\r\n\r\nc = 0\r\nfor i in g:\r\n c += min(i[1], n) * i[0]\r\n n -= min(i[1], n)\r\n if n == 0:\r\n break\r\nprint(c)", "n, m = map(int, input().split())\r\nrooms = []\r\nfor i in range(m):\r\n t1, t2 = map(int, input().split())\r\n rooms.append([t1, t2])\r\nrooms.sort(key = lambda x: -x[1])\r\n# print(rooms)\r\n\r\nans = 0\r\n\r\nfor i in range(len(rooms)):\r\n takeable = min(n, rooms[i][0])\r\n ans += takeable*rooms[i][1]\r\n n -= takeable\r\n\r\nprint(ans)", "n,m=map(int,input().split())\r\nmatch=[]\r\nans=0\r\nfor i in range(m):\r\n a,b=map(int,input().split())\r\n match.append([a,b])\r\nmatch.sort(key=lambda x:x[1],reverse=True)\r\nfor i in range(m):\r\n a=match[i][0]\r\n b=match[i][1]\r\n if n>=a:\r\n ans+=a*b \r\n n-=a \r\n elif n<a:\r\n ans+=n*b \r\n break \r\nprint(ans)", "n,m=map(int,input().split())\r\nl=[]\r\nfor i in range(m):\r\n a,b=map(int,input().split())\r\n t=[]\r\n t.append(b)\r\n t.append(a)\r\n l.append(t)\r\nl.sort(reverse=True)\r\ns=0\r\nr=n\r\nfor i in range(len(l)):\r\n if r>=l[i][1]:\r\n s+=(l[i][0]*l[i][1])\r\n r-=l[i][1]\r\n else:\r\n s+=(l[i][0]*(r))\r\n break\r\nprint(s)", "n,m=map(int,input().split())\r\nans=0\r\nd=[]\r\nfor x in range(m):\r\n\ta,b=map(int,input().split())\r\n\td.append([b,a])\r\nd.sort(key=lambda index: index[0],reverse=True)\r\nfor x in d:\r\n\tans+=x[0]*(x[1] if x[1]<=n else n)\r\n\tn-=(x[1] if x[1]<=n else n)\r\nprint(ans)", "data = [int(x) for x in input().split()]\r\nanswer = dict()\r\nfor _ in range(data[1]):\r\n temp = [int(x) for x in input().split()]\r\n try:\r\n answer[temp[1]] += temp[0]\r\n except:\r\n answer[temp[1]] = temp[0]\r\nanswer2 = sorted(answer.keys(),reverse=True)\r\nanswer3 =0\r\nfor i in answer2:\r\n if data[0] - answer[i] < 0:\r\n answer3 += (data[0] * i)\r\n break\r\n if data[0] - answer[i] == 0:\r\n answer3 += (answer[i] * i)\r\n break\r\n answer3 += (answer[i] * i)\r\n data[0] -= answer[i]\r\nprint(answer3)", "n, m = [int(y) for y in input().split()]\r\na=[]\r\nfor _ in range(m):\r\n p, q = [int(y) for y in input().split()]\r\n a.append((p,q))\r\na = sorted(a, key=lambda item: item[1], reverse=True)\r\nnm=0\r\nres=0\r\nfor k, v in a:\r\n if nm+k<=n:\r\n nm+=k\r\n res+=(k*v)\r\n else:\r\n res+=(n-nm)*v\r\n nm+=(n-nm)\r\n break\r\nprint(res)", "from sys import stdin, setrecursionlimit, stdout\n#from collections import deque\n#from math import sqrt, floor, ceil, log, log2, log10, pi, gcd, sin, cos, asin\n#from heapq import heapify, heappop, heappush, heapreplace, heappushpop\n#from bisect import bisect_right, bisect_left\n\n#setrecursionlimit(100000) #use \"python\" instead of \"pypy\" to avoid MLE\n\ndef ii(): return int(stdin.readline())\ndef fi(): return float(stdin.readline())\ndef mi(): return map(int, stdin.readline().split())\ndef fmi(): return map(float, stdin.readline().split())\ndef li(): return list(mi())\ndef si(): return stdin.readline().rstrip()\ndef lsi(): return list(si())\nmod=1000000007\nres=['NO', 'YES']\n\n#######################################################################################\n########################### M Y F U N C T I O N S ###########################\n#######################################################################################\n\n\n\n#######################################################################################\n########################### M A I N P R O G R A M ###########################\n#######################################################################################\n\n\ntest, test_case=0, 1\n#test_case=ii()\nwhile test<test_case:\n test+=1\n\n #print('Case #', test, ':', sep='')\n\n n, m= mi()\n a=[]\n while m:\n m-=1\n x, y=mi()\n a.append([x, y])\n a.sort(key= lambda x:-x[1])\n ans=0\n for x, y in a:\n p=min(x, n)\n ans+=p*y\n n-=p\n if not n:\n break\n print(ans)\n\t \t\t \t \t \t \t \t \t\t \t\t\t \t \t\t\t", "n, m = [int(i) for i in input().split()]\n\na = [0] * m\nb = [0] * m\nfor i in range(m):\n\ta[i], b[i] = [int(j) for j in input().split()]\n\t\na = [x for _, x in sorted(zip(b, a))][::-1]\nb = sorted(b)[::-1]\n\ncnt = 0\nfor i in range(m):\n\tj = min(a[i], n)\n\tcnt += j * b[i]\n\tn -= j\n\nprint(cnt)\n\t\t\t\t\t \t \t\t\t \t\t\t\t \t\t \t \t", "n, m = map(int, input().split())\nv = 0\nfor b in sorted((list(map(int, input().split()))[::-1] for i in range(m)), reverse=True):\n c = min(b[1], n)\n n -= c\n v += c * b[0]\nprint(v)\n", "n,m = map(int,input().split())\r\n\r\n\r\nf=[]\r\n\r\n\r\nfor k in range(m):\r\n f.append(list(map(int,input().split()))[::-1])\r\n\r\nf.sort()\r\n\r\n\r\n\r\n\r\ng=f[::-1]\r\np=0\r\nc=0\r\nwhile n:\r\n for u in g:\r\n if u[1]<=n:\r\n p+=u[1]*(u[0])\r\n n-=u[1]\r\n elif u[1]>n:\r\n p+= u[0]*n\r\n n=0\r\n c+=1\r\n if c==m:\r\n break\r\n\r\nprint(p)\r\n \r\n", "from collections import deque\n\n# Take input as tuples\nn, m = map(int, input().split())\nwarehouse = []\nfor _ in range(m):\n entry = tuple(map(int, input().split()))\n warehouse.append(entry)\n\n# Sort tuples by second element in descending order\nwarehouse = deque(sorted(warehouse, key=lambda x: x[1], reverse=True))\n\nmatches = 0\nwhile n > 0:\n if len(warehouse) == 0:\n break\n\n if warehouse[0][0] >= n:\n matches += n * warehouse[0][1]\n break\n else:\n matches += warehouse[0][0] * warehouse[0][1]\n n -= warehouse[0][0]\n warehouse.popleft()\n\nprint(matches)\n", "n,m=map(int,input().split())\r\nl=[]\r\nfor i in range(m):\r\n\ta,b=map(int,input().split())\r\n\tl.append([b,a])\r\nc=0\r\nl.sort(reverse=True)\r\ni=0\r\n# print(l)\r\nwhile n>0 and i<len(l):\r\n\tif l[i][1]<n:\r\n\t\tn-=l[i][1]\r\n\t\td=l[i][1]\r\n\t\tc+=l[i][0]*d\r\n\t\ti+=1\r\n\telse:\r\n\t\td=n\r\n\t\tn-=d\r\n\t\tc+=l[i][0]*d\r\nprint(c)", "import operator\r\n\r\ncheela_n, test_cases = map(int, input().strip().split())\r\nmatch_box = []\r\nfor t in range(test_cases):\r\n index, val = map(int, input().strip().split())\r\n match_box.append((index, val))\r\n\r\nsorted_x = sorted(match_box, key=operator.itemgetter(1), reverse=True)\r\n\r\ns = 0\r\n\r\nfor i in sorted_x:\r\n key, val = i\r\n if cheela_n <= 0:\r\n break\r\n elif key <= cheela_n:\r\n s += key * val\r\n cheela_n -= key\r\n else:\r\n s += cheela_n * val\r\n break\r\n \r\nprint(s)", "import sys\r\ninput = sys.stdin.readline\r\nsys.setrecursionlimit(10**6)\r\n\r\n\r\n############ ---- Input Functions ---- ############\r\ndef in_int():\r\n return (int(input()))\r\n\r\n\r\ndef in_list():\r\n return (list(map(int, input().split())))\r\n\r\n\r\ndef in_str():\r\n s = input()\r\n return (list(s[:len(s) - 1]))\r\n\r\n\r\ndef in_ints():\r\n return (map(int, input().split()))\r\n\r\n\r\n\r\nn,m = in_ints()\r\n\r\na = []\r\n\r\nfor mm in range(m):\r\n a.append(in_list())\r\n\r\n\r\nfrom operator import itemgetter\r\n\r\na = sorted(a, key=itemgetter(1))\r\n\r\na = a[::-1]\r\nans =0\r\nfor x,y in a:\r\n if n == 0:\r\n break\r\n if n > x:\r\n ans += x*y\r\n n-=x\r\n else:\r\n ans += (n)*y\r\n break\r\n\r\nprint(ans)\r\n", "l = []\r\nres = 0\r\nn, m = map(int, input().strip().split())\r\nfor i in range(0, m):\r\n a, b = map(int, input().strip().split())\r\n l.append([a, b]);\r\nl.sort(key = lambda el: el[1], reverse=True)\r\nfor matchbox, matches in l:\r\n if n <= matchbox:\r\n res += n * matches\r\n break\r\n elif n > matchbox:\r\n res += matchbox * matches\r\n n -= matchbox\r\nprint(res) ", "a,b = list(map(int,input().split(\" \")))\r\nc = []\r\nfor i in range(b):\r\n d,e = list(map(int, input().split()))\r\n c.append((e,d))\r\nc.sort()\r\nf= 0\r\nfor g in reversed(c):\r\n if g[1] >= a:\r\n f+=a*g[0]\r\n break\r\n else:\r\n f+=g[1]*g[0]\r\n a-=g[1]\r\nprint(f)", "t = input().split()\r\nn = int(t[0])\r\nm = int(t[1])\r\ntotal = []\r\ncounter = 0\r\n\r\nfor i in range(m):\r\n c = input().split()\r\n ins = [int(c[1]),int(c[0])]\r\n total.append(ins)\r\ntotal.sort()\r\nfor i in range(1,m+1):\r\n if n > 0 :\r\n if n - total[-i][1]>0:\r\n n -= total[-i][1]\r\n counter += total[-i][1]*total[-i][0]\r\n else:\r\n counter += n*total[-i][0]\r\n n = 0\r\n else:\r\n break\r\nprint(counter)", "n,m=[*map(int,input().split())]\r\na=[0]*11\r\ncount=0\r\nfor _ in range(m):\r\n x,y=[*map(int,input().split())]\r\n a[y]+=x\r\n# print(a)\r\nfor i in range(10,0,-1):\r\n if a[i]!=0:\r\n # print(a[i],i)\r\n if n-a[i]>=0:\r\n count+=i*(a[i])\r\n n-=a[i]\r\n else:\r\n count+=i*(n)\r\n # print(count)\r\n break\r\n # print(count)\r\nprint(count)", "n,m=map(int,input().split());\r\n\r\nmatches=[];\r\nfor i in range(m):\r\n a,b=map(int,input().split());\r\n matches.append([b,a]);\r\n\r\nmatches.sort(reverse=True);\r\n\r\ni=0;\r\nboxnum=0;\r\nans=0;\r\nwhile i<m:\r\n if boxnum+matches[i][1]>n:\r\n break;\r\n ans+=matches[i][0]*matches[i][1];\r\n boxnum+=matches[i][1];\r\n i+=1;\r\n\r\nif i<m:\r\n ans+=(n-boxnum)*matches[i][0];\r\n\r\nprint(ans);\r\n", "n, m = map(int, input().split())\r\nmatch = []\r\nfor _ in range(m) :\r\n a, b = map(int, input().split())\r\n match.append((b, a))\r\nmatch.sort(reverse = True)\r\nans = 0\r\nfor i , j in match :\r\n if n > 0 :\r\n ans += min(n, j) * i\r\n n -= min(n, j)\r\nprint(ans)\r\n\r\n\r\n ", "n, m = map(int, input().split())\na = []\nfor i in range(m):\n a.append(list(map(int, input().split())))\n\na.sort(key = lambda x: x[1], reverse = True)\ns = 0\nfor x in a:\n if n >= x[0]:\n s += x[0]*x[1]\n n -= x[0]\n else:\n s += n*x[1]\n break\n\nprint(s)\n", "n,m=map(int,input().split())\r\narr=[]\r\nfor i in range(m):\r\n a,b=map(int,input().split())\r\n arr.append([b,a])\r\narr.sort(reverse=True)\r\nx=0\r\ni=0\r\n#print(arr)\r\nwhile i<m and n>0:\r\n if arr[i][1]>n:\r\n x+=n*arr[i][0]\r\n break\r\n else:\r\n x+=arr[i][1]*arr[i][0]\r\n n-=arr[i][1]\r\n i+=1\r\nprint(x)", "n,m=list(map(int,input().split()))\r\n# number of match boxes to be taken # number of containers\r\n\r\ncontainers=[]\r\nfor i in range(m):\r\n containers.append(list(map(int,input().split())))\r\n\r\nsorted_containers=sorted(containers,key=lambda x:x[1],reverse=True)\r\nmatches=0\r\nfor a,b in sorted_containers:\r\n if a>=n:\r\n matches+=n*b\r\n break\r\n matches+=a*b\r\n n-=a\r\n\r\nprint(matches)\r\n \r\n", "n, m = list(map(int, input().split()))\r\ns = []\r\nfor i in range(m):\r\n a, b = list(map(int, input().split()))\r\n s.append([b, a])\r\ns.sort(reverse=True)\r\nans = 0\r\ni = 0\r\nwhile n > 0 and i < m:\r\n if s[i][1] >= n:\r\n ans += n * s[i][0]\r\n n = 0\r\n else:\r\n n -= s[i][1]\r\n ans += s[i][1] * s[i][0]\r\n i += 1\r\nprint(ans)", "n , m = map(int,input().split())\r\nls = {}\r\nl = []\r\nchecked = []\r\nans = 0\r\nfor i in range(m):\r\n\ta , b = map(int,input().split())\r\n\tif b in checked:\r\n\t\tls[b] += a\r\n\t\tcontinue\r\n\tchecked.append(b)\r\n\tls[b] = a\r\n\tl.append(b)\r\nl = sorted(l,reverse = True)\r\nls = dict(sorted(ls.items(),reverse = True))\r\nfor el in l:\r\n\tif n>=ls[el]:\r\n\t\tans += el*ls[el]\r\n\t\tn -= ls[el]\r\n\telse:\r\n\t\tans += el*n\r\n\t\tbreak\r\nprint(ans)\r\n", "m,n=map(int,input().split())\r\nl=[]\r\nv=0\r\nfor i in range(n):\r\n a,b=map(int,input().split())\r\n l.append([a,b])\r\nl.sort(key=lambda x:-x[1])\r\n#print(l)\r\nfor i in range(n):\r\n if(m==0):\r\n #print(1)\r\n break\r\n else:\r\n #print(2)\r\n if(m>=l[i][0]):\r\n #print(3)\r\n v=v+(l[i][0]*l[i][1])\r\n m=m-l[i][0]\r\n elif(m<l[i][0]):\r\n #print(4)\r\n v=v+m*l[i][1]\r\n break\r\n #print(v,m)\r\nprint(v) \r\n \r\n", "he = [0, 0, 0, 0, 0, 0, 0, 0, 0, 0] # 从0，到9的索引控制火柴盒\r\nhuochai = 0\r\nbeitou = 0\r\nn, m = map(int, input().split())\r\na = [] # 第i个容器的火柴盒有多少\r\nb = [] # 第i个火柴和里面的火柴数量\r\nfor l in range(m): # 一共m组数据，分别装入a，b两个列表（数据处理作用）\r\n list222 = list(map(int, input().split()))\r\n a.append(list222[0])\r\n b.append(list222[1])\r\nfor i in range(1, 11):\r\n for j in range(m):\r\n if b[j] == i:\r\n he[i - 1] += a[j]\r\njisuan = lambda x, e: x * e\r\no = 9\r\nif sum(he) < n:\r\n while o >= 0:\r\n beitou += he[o]\r\n huochai += jisuan((o + 1), he[o])\r\n o -= 1\r\nelse:\r\n while o >= 0:\r\n beitou += he[o]\r\n huochai += jisuan((o + 1), he[o])\r\n if beitou >= n:\r\n break\r\n o -= 1\r\n huochai -= jisuan((o + 1), (beitou - n))\r\nprint(huochai)\r\n", "# http://codeforces.com/contest/16/problem/B\nn, cs = [int(n) for n in input().split()]\ncontainers, matchboxes = [], []\nfor i in range(cs):\n\tc, m = [int(n) for n in input().split()]\n\tcontainers.append(c)\n\tmatchboxes.append(m)\npriority = list(reversed(sorted(zip(containers, matchboxes), key=lambda a: a[1])))\n# print(priority)\n\nc_gathered = 0\nm_gathered = 0\ni = 0\nwhile( i<len(priority) and c_gathered < n):\n\tm_gathered += min(priority[i][0], n-c_gathered) *priority[i][1]\n\tc_gathered += priority[i][0]\n\ti+=1\n\nprint(m_gathered)", "n, m = map(int, input().split())\r\nl = []\r\nfor _ in range(m):\r\n l.append(list(map(int, input().split())))\r\n\r\nl.sort(reverse = True, key = lambda x: x[1])\r\ntotal = 0;\r\nwhile(len(l)):\r\n if n > l[0][0]:\r\n total += l[0][0] * l[0][1]\r\n n -= l[0][0]\r\n l.pop(0)\r\n else:\r\n total += n * l[0][1]\r\n break\r\n\r\nprint(total)", "ans = 0\r\nn , m= map(int,input().split())\r\nmatches=[]\r\nfor i in range(m):\r\n a , b= map(int,input().split())\r\n matches.append([a,b])\r\nmatches.sort(key= lambda x : x[1] , reverse = True)\r\nwhile(n>0):\r\n if len(matches)<=0:\r\n break\r\n candidate = matches.pop(0)\r\n if n >= candidate[0]:\r\n n-= candidate[0]\r\n ans += candidate[0]*candidate[1]\r\n else:\r\n ans += n*candidate[1]\r\n n=0\r\nprint(ans)", "class A:\n\n def solve(self):\n [n, m] = [int(x) for x in input().split(\" \")]\n flag = []\n for i in range(n):\n flag.append(input())\n\n if any([len(set(x)) != 1 for x in flag]):\n print(\"NO\")\n return\n\n first_colors = [x[0] for x in flag]\n if any([x == y for x, y in zip(first_colors, first_colors[1:])]):\n print(\"NO\")\n return\n\n print(\"YES\")\n\nclass B:\n\n def solve(self):\n [n, m] = [int(x) for x in input().split(\" \")]\n matches = []\n for i in range(m):\n matches.append([int(x) for x in input().split(\" \")])\n\n matches = sorted(matches, key=lambda x: x[1], reverse=True)\n\n total_matches = 0\n\n for (nums, matchsticks) in matches:\n if nums < n:\n n -= nums\n total_matches += nums * matchsticks\n else:\n total_matches += n * matchsticks\n n = 0\n\n print(total_matches)\n\nB().solve()\n", "n, m = map(int, input().split())\r\narr = []\r\nwhile m:\r\n\tm -= 1 \r\n\ta, b = map(int, input().split())\r\n\tarr.append([b, a])\r\narr.sort(reverse = True)\r\n#print(arr)\r\nsum_ = 0 \r\nfor i in arr:\r\n\tif i[1] == n:\r\n\t\tsum_+= (i[0]*i[1])\r\n\t\tn = 0\r\n\telif i[1] > n:\r\n\t\tsum_ += (n*i[0])\r\n\t\tn = 0\r\n\telse:\r\n\t\tsum_ += i[0]*i[1]\r\n\t\tn -= i[1]\r\nprint(sum_)\r\n\r\n", "max_box, rows = list(map(int, input().split()))\r\n\r\nvalues = {}\r\nfor _ in range(rows):\r\n nb_of_box, nb_of_matches = list(map(int, input().split()))\r\n n = values.get(nb_of_matches, 0)\r\n values[nb_of_matches] = n + nb_of_box\r\n\r\nnb_matches_sorted = sorted(values.keys(), reverse = True)\r\n\r\ntotal = 0\r\nfor matches in nb_matches_sorted:\r\n nb_of_box = values[matches]\r\n\r\n if nb_of_box >= max_box:\r\n total += max_box * matches\r\n break\r\n else:\r\n max_box -= nb_of_box\r\n total += nb_of_box * matches\r\n\r\nprint(total)\r\n", "L=lambda:map(int,input().split())\nn,m=L()\nr=0\nfor x in sorted([[*L()]for _ in[0]*m],key=lambda x:x[1])[::-1]:\n v=min(n,x[0])\n r+=v*x[1]\n n-=v\n if n<1:break\nprint(r)\n \t\t \t\t\t \t \t \t\t\t \t \t\t\t", "n,m = list(map(int, input().split()))\r\n\r\nconts = []\r\nfor _ in range(m):\r\n conts.append(list(map(int,input().split())))\r\n \r\nconts = sorted(conts, key=lambda x: x[1],reverse=True)\r\n\r\ntaken_boxes = 0\r\nnum_all = 0\r\ncur_idx = 0\r\nwhile taken_boxes <= n and cur_idx < len(conts):\r\n new_boxes = conts[cur_idx][0]\r\n possible = min(n-taken_boxes, new_boxes)\r\n\r\n\r\n taken_boxes += possible\r\n num_all += conts[cur_idx][1] * possible\r\n \r\n cur_idx += 1 \r\n \r\nprint(num_all)", "R = lambda: map(int,input().split())\r\nn,m=R()\r\nl=[]\r\nfor _ in range(m):\r\n a,b=R()\r\n l.append([b,a])\r\nl.sort()\r\nans=0\r\nwhile n>0 and l:\r\n if n>=l[-1][1]: \r\n n-=l[-1][1]\r\n ans+=(l[-1][1]*l[-1][0])\r\n else:\r\n ans+=(l[-1][0]*n)\r\n break\r\n l.pop()\r\nprint(ans)\r\n ", "n , k = list(map(int,input().split()))\r\nls=[]\r\nres=0\r\nfor i in range(k):\r\n t = tuple(map(int,input().split()))\r\n ls.append(t)\r\n\r\nsorted = sorted(ls,key = lambda t:t[1] , reverse =True)\r\n\r\nfor x,y in sorted:\r\n if n>=x:\r\n res+=(x*y)\r\n n-=x\r\n else:\r\n res+=(n*y)\r\n n=0\r\n if n==0:\r\n break\r\nprint(res)\r\n ", "n, m = map(int, input().split())\nar = []\nfor _ in range(m):\n a, b = map(int, input().split())\n ar.append((b, a))\nar.sort()\nar.reverse()\nans = 0\nfor i in range(m):\n ans += min(n, ar[i][1]) * ar[i][0]\n n -= min(n, ar[i][1])\nprint(ans)\n", "#\r\n# Author: eloyhz\r\n# Date: Sep/11/2020\r\n#\r\n\r\n\r\nif __name__ == '__main__':\r\n n, m = [int(x) for x in input().split()]\r\n containers = []\r\n for _ in range(m):\r\n a, b = [int(x) for x in input().split()]\r\n containers.append((b, a))\r\n containers.sort(reverse=True)\r\n amount = 0\r\n i = 0\r\n while i < m and n > 0:\r\n a = containers[i][1]\r\n b = containers[i][0]\r\n t = a if a < n else n\r\n n -= t\r\n amount += t * b\r\n i += 1\r\n print(amount)\r\n\r\n\r\n", "n,m = map(int,input().split())\r\nl1 = []\r\nfor i in range(m):\r\n l1.append(tuple(map(int,input().split())))\r\nl1.sort(key = lambda x: x[1],reverse = True)\r\nans = 0\r\nfor i in l1:\r\n if n-i[0]>0:\r\n ans+= i[0]*i[1]\r\n n-=i[0]\r\n elif n-i[0]==0:\r\n ans+=i[0]*i[1]\r\n break\r\n else:\r\n ans+=n*i[1]\r\n break\r\nprint(ans)\r\n \r\n ", "n, c = map(int, input().split())\na = []\nb = []\ncounter = 0\nfor _ in range(c):\n i = input().split()\n a.append(int(i[0]))\n b.append(int(i[1]))\n\nwhile n and a:\n max_value = max(b)\n max_index = b.index(max_value)\n if n > a[max_index]:\n n -= a[max_index]\n counter += a[max_index] * b[max_index]\n else:\n counter += n * b[max_index]\n n = 0\n del a[max_index]\n del b[max_index]\nprint(counter)", "\nn, m = input().split(\" \")\nn = int(n)\nm = int(m)\nrow = []\nnum = 0\nsom = 0\nfor i in range(m):\n x, y = input().split(\" \")\n x = int(x)\n y = int(y)\n row.append((x, y))\n num += x\n som += x*y\nif num <= n:\n print(som)\nelse:\n row.sort(key=lambda tup: tup[1],reverse=True)\n som = 0\n num = 0\n for elt, value in row:\n num += elt\n if num <= n:\n som += value*elt\n else:\n num -= elt\n som += (n - num)*value\n break\n print(som)", "import sys\r\n\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\nn, m = in_int_space() \r\nbox_ms = []\r\n\r\nfor _ in range(m):\r\n ai,bi = in_int_space() \r\n box_ms.append((bi,ai))\r\n\r\nbox_ms.sort(reverse = True, ) \r\ntotal = 0 \r\nfor m,a in box_ms: \r\n if a >= n: \r\n total += (n * m)\r\n break\r\n elif a < n:\r\n total += (a * m) \r\n n -= a \r\n if n == 0:\r\n break \r\nprint(total)\r\n\r\n\r\n\r\n\r\n", "x,y=map(int,input().split())\r\ncnt=0;a=[]\r\nfor i in range(y):\r\n a.append(list(map(int, input().split())))\r\n\r\nfor i in range(y):\r\n a[i].reverse()\r\na.sort(reverse=True)\r\n\r\n\r\nfor i in range(y):\r\n\r\n if a[i][1]>x:\r\n cnt+=a[i][0]*x\r\n break\r\n elif a[i][1]<=x:\r\n cnt+=a[i][0]*a[i][1]\r\n \r\n x-=a[i][1]\r\n \r\nprint(cnt)\r\n", "n, m = map(int, input().split())\nvs = []\nfor i in range(m):\n a, b = map(int, input().split())\n vs.append((b, a))\nvs.sort()\nans = 0\nfor b, a in reversed(vs):\n k = min(n, a)\n ans += k*b\n n-=k\nprint(ans)\n\n \t \t \t \t \t \t\t\t\t \t\t\t \t \t\t\t \t\t", "\r\nR = lambda:map(int,input().split())\r\n\r\nn, m = R()\r\narr = sorted([[*R()] for i in range(m)], key=lambda x: x[1], reverse=True)\r\nans = 0\r\nfor i in arr:\r\n v = min(n, i[0])\r\n ans += v*i[1]\r\n n -= v\r\n if n < 1:\r\n break\r\nprint(ans)\r\n\r\n", "n, m = map(int, input().split())\r\n\r\nboxes = []\r\nmatches = []\r\n\r\nfor _ in range(m):\r\n a, b = map(int, input().split())\r\n boxes.append(a)\r\n matches.append(b)\r\n\r\npairs = list(zip(boxes, matches))\r\npairs.sort(key=lambda x: -x[1])\r\n\r\n\r\ntotal_matches = 0\r\nfor box, match in pairs:\r\n if n >= box:\r\n total_matches += box * match\r\n n -= box\r\n else:\r\n total_matches += n * match\r\n break\r\n\r\nprint(total_matches)\r\n", "from operator import itemgetter\n\nn, m = map(int, input().split())\npair = []\n\n\nfor i in range(0,m):\n pair.append(list(map(int, input().split())))\n\npair = sorted(pair, key=itemgetter(1), reverse=True)\nnumbers = []\ntemp = 0\nfor i in range(0,m):\n if (temp + pair[i][0] <= n):\n # print(\"before adding, \" + str(temp) + \" boxes chosen, adding \" + str(pair[i][0]))\n numbers.append(pair[i][0])\n temp += pair[i][0]\n else:\n if (temp < n):\n # print(\"chose \" + str(temp) + \" boxes already, adding \" + str(n-temp) + \" more\")\n numbers.append(n-temp)\n break\n\n# print(\"number of matchboxes from each = \" + str(numbers))\n\nans = 0\nfor i in range(0,len(numbers)):\n ans += numbers[i]*pair[i][1]\n\nprint(ans)\n \n# j = 0\n# num = 0\n# for i in range(0,m):\n# while(pair[i][0] != 0):\n# pair[i][0] -= 1\n# num += pair[i][1]\n# j += 1\n# if (j == n):\n# break\n# if (j == n):\n# break\n\n# print(num)", "n , m = map(int , input().split())\r\nl = [[int(a), int(b)] for _ in range(m) for a, b in [input().split()]]\r\nsorted_data = sorted(l, key=lambda x: x[1] , reverse=True)\r\nelements = 0\r\nfor i in range (m):\r\n if(n==0):\r\n break\r\n if sorted_data[i][0] >= n:\r\n elements+= sorted_data[i][1]*n\r\n n=0\r\n else:\r\n elements += sorted_data[i][1] * sorted_data[i][0]\r\n n -= sorted_data[i][0]\r\nprint(elements)\r\n\r\n", "free_capacity, containers_count = map(int, input().split())\r\n\r\ncontainers = []\r\nfor _ in range(containers_count):\r\n containers.append(list(map(int, input().split())))\r\n\r\ncontainers = sorted(containers, key=lambda l: l[1], reverse=True)\r\n\r\ntotal_matches = 0\r\nfor boxes_count, amount in containers:\r\n if free_capacity >= boxes_count:\r\n total_matches += boxes_count * amount\r\n free_capacity -= boxes_count\r\n else:\r\n total_matches += free_capacity * amount\r\n break\r\n\r\nprint(total_matches)\r\n", "n,m=map(int,input().split())\r\nL=[list(map(int,input().split())) for i in range(m)]\r\nans=0\r\nL=sorted(L,key=lambda x :-x[1])\r\nfor x in L :\r\n v=min(x[0],n)\r\n ans+=v*x[1]\r\n n-=v\r\nprint(ans)\r\n \r\n \r\n \r\n", "n, m = input().split()\nn = int(n); m = int(m)\n\na = []\nfor i in range(m):\n\tb = [int(j) for j in input().split()]\t\n\ta.append(b)\n\na.sort(key = lambda x: x[1], reverse=True)\ncount = 0\nl = 0\n# print(a)\nfor i in range(m):\n\tif a[i][0] > n-l:\n\t\tcount += (n-l)*a[i][1]\n\t\tbreak\n\telse:\n\t\tl += a[i][0]\n\t\tcount += a[i][0]*a[i][1]\n\nprint(count)", "n,m = input().split()\nn,m = int(n),int(m)\n\nlistaUtil = []\n \nfor i in range(m):\n ai, bi = input().split()\n ai, bi = int(ai),int(bi)\n \n listaUtil.append((bi,ai))\n \n\nlistaUtil = sorted(listaUtil)\nlistaUtil = listaUtil[::-1]\n \ncount = 0\nlista=[]\n\nfor i in listaUtil:\n amt = min(i[1],n)\n calculo=amt*i[0]\n lista.append(calculo)\n n -= amt\n \n if n <= 0:\n break\n \nprint(sum(lista))\n\n\t\t \t\t \t \t \t \t\t\t\t \t \t\t\t\t\t\t", "qu = []\r\nn , m = list(map(int,input().split()))\r\nfor i in range(m):\r\n arr = list(map(int,input().split()))\r\n qu.append(arr)\r\n\r\nqu.sort(key = lambda x: x[1],reverse=True)\r\ntotal = 0\r\nfor q in qu:\r\n if q[0] > n:\r\n total += (n * q[1])\r\n break\r\n else:\r\n total += (q[0] * q[1])\r\n n -= q[0]\r\nprint(total)", "n, a = [int(a) for a in input().split(\" \")]\r\narr = []\r\nfor i in range(0, a):\r\n ai, bi = [ int(a) for a in input().split(\" \") ]\r\n arr.append((ai, bi))\r\n\r\nsorted_arr = sorted(arr, key=lambda x: x[1], reverse=True)\r\n\r\nsum_arr = 0 \r\ni = 0\r\nwhile n != 0:\r\n if i == a:\r\n break\r\n if n <= sorted_arr[i][0]:\r\n sum_arr = sum_arr + n*sorted_arr[i][1]\r\n n = 0\r\n else :\r\n sum_arr = sum_arr + sorted_arr[i][0] * sorted_arr[i][1]\r\n n = n - sorted_arr[i][0]\r\n\r\n i = i + 1\r\n \r\nprint(sum_arr)", "import heapq\r\n\r\ndef main():\r\n\r\n def solve(n, h):\r\n ret = 0\r\n\r\n while h and n:\r\n c = heapq.heappop(h)\r\n mn = min(n, c[1])\r\n ret -= mn * c[0]\r\n n -= mn\r\n \r\n return ret\r\n\r\n n, m = [int(x) for x in input().split()]\r\n h = []\r\n\r\n for _ in range(m):\r\n ab = [int(x) for x in input().split()]\r\n heapq.heappush(h, [-ab[1], ab[0]])\r\n \r\n print(solve(n, h))\r\n\r\n\r\nif __name__ == \"__main__\":\r\n import sys, threading\r\n input = sys.stdin.readline\r\n thread = threading.Thread(target=main)\r\n thread.start()\r\n thread.join()", "n,m=list(map(int,input().split()))\r\narr=[]\r\nfor i in range(m):\r\n x=list(map(int,input().split()))\r\n y=x[::-1]\r\n arr.append(y)\r\narr.sort(reverse=True)\r\nc=0\r\nfor i in range(m):\r\n if n<=0:\r\n break\r\n if n>=arr[0][1]:\r\n c+=arr[0][0]*arr[0][1]\r\n n-=arr[0][1]\r\n arr.pop(0)\r\n elif n<arr[0][1]:\r\n c+=arr[0][0]*n\r\n n=0\r\nprint(c)", "from operator import itemgetter\r\n\r\nL0 = input().split()\r\nn = int(L0[0]) # the rucksack con hold n matchboxes\r\nm = int(L0[1]) # there are m containers\r\nL = list()\r\nfor i in range(m):\r\n L.append(input().split())\r\nfor i in range(m):\r\n for j in range(2):\r\n L[i][j] = int(L[i][j])\r\n# L[i][0]= number of matchboxes\r\n# L[i][1]= number of matches in these matchboxes\r\nL1 = sorted(L, reverse=True, key=itemgetter(1))\r\nif sum(L1[k][0] for k in range(m)) < n:\r\n print(sum(L1[k][0] * L1[k][1] for k in range(m)))\r\n exit(0)\r\ns = 0\r\nk = 0\r\nwhile n > 0 and k <= m - 1:\r\n if L1[k][0] <= n: # we can take the entiere container\r\n s += L1[k][0] * L1[k][1]\r\n n -= L1[k][0]\r\n else:\r\n s += n * L1[k][1]\r\n n = 0\r\n k += 1\r\nprint(s)\r\n", "space, n = list(map(int, input().split()))\r\nboxes = []\r\nmpb = []\r\ntotal = 0\r\nfor _ in range(n):\r\n temp = list(map(int, input().split()))\r\n boxes.append(temp[0])\r\n mpb.append(temp[1])\r\n\r\nwhile space != 0:\r\n if not boxes:\r\n break\r\n elif boxes[mpb.index(max(mpb))] > space:\r\n total += space * max(mpb)\r\n break\r\n max_mpb_i = mpb.index(max(mpb)) \r\n total += boxes[max_mpb_i] * mpb[max_mpb_i]\r\n space -= boxes[max_mpb_i]\r\n boxes.pop(max_mpb_i)\r\n mpb.pop(max_mpb_i)\r\n\r\nprint(total)", "n , m = map(int , input().split())\r\nl=[]\r\nfor i in range(int(m)):\r\n t = list(map(int, input().split() ))\r\n t= t[::-1]\r\n l.append(t)\r\nl.sort(reverse = True)\r\nans = 0\r\ni=0\r\nwhile n>0 and i<len(l):\r\n temp = min(n , l[i][1])\r\n ans = ans + temp*l[i][0]\r\n n = n - temp\r\n i = i+1\r\nprint(ans)", "n,m = map(int,input().split())\r\narr = []\r\nfor i in range(m):\r\n ab = [int(x) for x in input().split()]\r\n arr.append(ab)\r\n\r\narr.sort(key=lambda row: (row[1]),reverse=True)\r\nanswer = 0\r\nfor a in arr:\r\n diff = n - a[0]\r\n if diff > 0:\r\n n -= a[0]\r\n answer += a[0]*a[1]\r\n elif diff == 0:\r\n answer += a[0]*a[1]\r\n break\r\n else:\r\n answer += n*a[1]\r\n break\r\n\r\nprint(answer)", "n,m=map(int,input().split())\r\nl=[]\r\nfor i in range(m):\r\n k=[]\r\n a,b=map(int,input().split())\r\n k.append(b)\r\n k.append(a)\r\n l.append(k)\r\nl.sort(reverse=True)\r\ns=0\r\nfor i in range(m):\r\n \r\n if n>=l[i][1]:\r\n s+=l[i][1]*l[i][0]\r\n n=n-l[i][1]\r\n else:\r\n s+=n*l[i][0]\r\n n=0\r\n \r\nprint(s)\r\n\r\n", "#lista=list(map(int,input().split()))\r\n#x=lista[0]\r\n#n=lista[0]\r\n#k=int(input())\r\n#suma=0\r\n\r\nk=1\r\n#vector=list(map(int,input().split()))\r\n#for i in vector:\r\n #suma=suma+i\r\nans=\"\"\r\n#alfabet = {'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\nwhile k > 0:\r\n \r\n #n=int(input())\r\n \r\n# n=int(input())\r\n n, m = map(int, input().split())\r\n vector_pachet=[0]*m\r\n vector_numar=[0]*m\r\n vector_val=[0]*m\r\n \r\n for i in range(0,m):\r\n lista=list(map(int,input().split()))\r\n vector_pachet[i]=lista[0]\r\n vector_numar[i]=lista[1]\r\n vector_val[i]=vector_numar[i]/vector_pachet[i]\r\n \r\n for i in range(0,m-1):\r\n for j in range(i+1,m):\r\n if vector_numar[i]<vector_numar[j]:\r\n c=vector_val[i]\r\n vector_val[i]=vector_val[j]\r\n vector_val[j]=c\r\n \r\n c=vector_numar[i]\r\n vector_numar[i]=vector_numar[j]\r\n vector_numar[j]=c\r\n \r\n c=vector_pachet[i]\r\n vector_pachet[i]=vector_pachet[j]\r\n vector_pachet[j]=c\r\n \r\n \r\n rasp=0\r\n for i in range(0,m):\r\n if n>0:\r\n cate=min(n, vector_pachet[i])\r\n rasp+=cate*vector_numar[i]\r\n n-=cate\r\n \r\n \r\n print(rasp) \r\n \r\n \r\n \r\n k=k-1 \r\n\r\n ", "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\nn, m = inlt()\r\nmatches2 = []\r\ntotal_matches = 0\r\ndef highest(matches2):\r\n return matches2[1]\r\n \r\nfor i in range(m):\r\n matches = inlt()\r\n matches2.append(matches)\r\n\r\nwhile n != 0:\r\n if len(matches2) == 0:\r\n break\r\n x = max(matches2, key = highest)\r\n if n < x[0]:\r\n total_matches += n * x[1]\r\n n -= n\r\n else:\r\n total_matches += x[0] * x[1]\r\n n -= x[0]\r\n matches2.remove(x)\r\nprint(total_matches)", "n,m=map(int,input().split())\r\na=[]\r\nfor i in range(m):\r\n b,c=map(int,input().split())\r\n a.append((b,c))\r\n\r\na.sort(key=lambda x:x[1],reverse=True)\r\n\r\nres=0\r\n\r\nfor item in a:\r\n if n <= item[0]:\r\n res+=item[1]*n\r\n n=0\r\n break\r\n else:\r\n res+=item[1]*item[0]\r\n n-=item[0]\r\n\r\nprint(res)\r\n \r\n", "n, m = map(int, input().split())\r\nw=[]\r\np=[]\r\nf=0\r\nfor i in range(m):\r\n x,v =map(int,input().split())\r\n w.append(x)\r\n p.append(v)\r\nwhile n>0:\r\n d=max(p) \r\n r=p.index(d) \r\n if n>=w[r]:\r\n f+=(w[r]*d)\r\n else:f+=(n*d) \r\n n=(n-w[r])\r\n p.pop(r)\r\n w.pop(r)\r\n if w ==[]:\r\n break\r\nprint(f) ", "import sys\r\nimport re\r\nimport math\r\ninput = sys.stdin.readline\r\n\r\n############ ---- Input Functions ---- ############\r\ndef inp():\r\n return(int(input()))\r\n \r\ndef inlt():\r\n return(list(map(int,input().split())))\r\ndef insr():\r\n s = input()\r\n return(list(s[:len(s) - 1]))\r\ndef invr():\r\n return(map(int,input().split()))\r\n############ ---- Solution ---- ############\r\nn,m = invr()\r\nwrh = []\r\nx=m\r\nwhile(m):\r\n m-=1\r\n nb,size = invr()\r\n wrh.append((size,nb))\r\nsorted_wrh = sorted(wrh, key=lambda x: x[0],reverse=True)\r\ncount =0\r\nfor i in range(x):\r\n size = sorted_wrh[i][0]\r\n nb = sorted_wrh[i][1]\r\n if(n<=nb):\r\n count += n * size\r\n break\r\n else:\r\n count += nb*size\r\n n -=nb\r\nprint(count)\r\n \r\n \r\n \r\n ", "n, m = map(int, input().split())\r\nb = 0\r\nfor i in sorted( (list(map(int, input().split()))[::-1] for j in range(m)), reverse=True):\r\n c = min(i[1], n)\r\n n -= c\r\n b += c * i[0]\r\nprint(b)", "import abc\r\nimport itertools\r\nimport math\r\nfrom math import gcd as gcd\r\nimport sys\r\nimport queue\r\nimport itertools\r\nfrom heapq import heappop, heappush\r\nimport random\r\n\r\n\r\ndef solve():\r\n n, m = map(int, input().split())\r\n\r\n f = []\r\n for i in range(m):\r\n a, b = map(int, input().split())\r\n f.append([b, a])\r\n\r\n f.sort(key=lambda x: (-x[0], x[1]))\r\n res = 0\r\n for b, a in f:\r\n if a >= n:\r\n res += b * n\r\n break\r\n else:\r\n n -= a\r\n res += b * a\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", "n, m = map(int, input().split())\na = []\nfor i in range(m):\n num = list(map(int, input().split()))\n a.append(num)\nfor i in range(m - 1):\n for j in range(m - i - 1):\n if a[j][1] < a[j+1][1]:\n a[j+1],a[j] = a[j],a[j+1]\nsum0 = 0\n\nfor i in range(m):\n if n > a[i][0]:\n sum0 = (a[i][0] * a[i][1]) + sum0\n n = n - a[i][0]\n else:\n sum0 = (a[i][1] * n) + sum0\n break\nprint(sum0)\n##########\n\n \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, m = map(int, input().split())\r\ndata = sorted([list(map(int, input().split())) for _ in range(m)], key=lambda x: -x[1])\r\n\r\ncnt = n\r\nans = 0\r\nfor a, b in data:\r\n tmp = min(cnt, a)\r\n ans += tmp * b\r\n\r\n cnt -= tmp\r\n\r\n if cnt <= 0:\r\n break\r\n\r\nprint(ans)\r\n", "n,m=map(int,input().split())\r\nl=[]\r\nk=[]\r\nc=0\r\nu=0\r\nfor i in range(m):\r\n r,t=map(int,input().split())\r\n l.append(r)\r\n k.append(t)\r\nwhile l!=[] and k!=[] and u<n:\r\n max_value = max(k) \r\n max_index = k.index(max_value)\r\n if l[max_index]<=n-u:\r\n u+=l[max_index]\r\n c+=l[max_index]*max_value\r\n \r\n \r\n else:\r\n c+=(n-u)*max_value\r\n u+=(n-u)\r\n del l[max_index]\r\n k.remove(max(k))\r\nprint(c)", "size,lines = list(map(int,input().split(\" \")))\nboxes = []\nfor line in range(lines):\n\tboxnr,match = list(map(int, input().split(\" \")))\n\tboxes.append((match,boxnr))\nboxes.sort()\nmatches = 0\nfor box in reversed(boxes):\n\tif box[1] >= size:\n\t\tmatches+=size*box[0]\n\t\tbreak\n\telse: \n\t\tmatches +=box[1]*box[0]\n\t\tsize -=box[1]\nprint(matches)", "n,m = map(int,input().split())\r\na=[]\r\nb=[]\r\nans=0\r\nfor i in range(m):\r\n p,q = map(int,input().split())\r\n a.append(p)\r\n b.append(q)\r\n \r\nfor i in range (m):\r\n for j in range (i+1,m):\r\n #print(i,j)\r\n if(b[j]>b[i]):\r\n a[i],a[j] = a[j],a[i]\r\n b[i],b[j] = b[j],b[i]\r\n \r\nfor i in range(0,m):\r\n q = min(n,a[i])\r\n ans+=b[i]*q\r\n n-=q\r\nprint(ans)\r\n\r\n", "if __name__ == \"__main__\":\r\n n,m = list(map(int,input().split()))\r\n list_ = []\r\n while m:\r\n a,b = list(map(int,input().split()))\r\n list_.append([b,a])\r\n m = m - 1\r\n list_.sort()\r\n list_ = list_[::-1]\r\n matches = 0\r\n for value in list_:\r\n if n==0:\r\n break\r\n elif n >= value[1]:\r\n n = n - value[1]\r\n matches = matches + (value[1] * value[0])\r\n else:\r\n value[1] = n\r\n matches = matches + (value[1] * value[0])\r\n n = 0\r\n break\r\n print(matches) \r\n \r\n", "import sys\r\n\r\ninput = sys.stdin.readline\r\n\r\nn, x = map(int, input().split())\r\nans = 0\r\n\r\nl = sorted([list(map(int, input().split())) for _ in range(x)], key=lambda x: x[-1], reverse=True)\r\n\r\nfor i in l:\r\n if n - i[0] <= 0:\r\n ans += min(i[0], n)*i[-1]\r\n n -= i[0]\r\n break\r\n else:\r\n ans += min(i[0], n)*i[-1]\r\n n -= i[0]\r\nprint(ans)", "line = list(map(int,input().split()))\r\ndic = {}\r\nnumbers = []\r\nfor i in range(line[1]):\r\n match = list(map(int,input().split()))\r\n numbers.append(match)\r\nnumbers.sort(key=lambda x:x[1],reverse=True)\r\ncount = line[0]\r\nout = 0\r\nfor i in range(line[1]):\r\n if numbers[i][0] < count:\r\n out += numbers[i][1]*numbers[i][0]\r\n count -= numbers[i][0]\r\n else:\r\n out += numbers[i][1]*count\r\n break\r\nprint(out)", "n, m = map(int, input().split())\r\narr = []\r\nsum = 0\r\nfor i in range(m):\r\n a, b = map(int, input().split())\r\n arr.append([b, a])\r\narr = sorted(arr, reverse=True)\r\nfor i in arr:\r\n if n>=i[1]:\r\n sum += (i[0]*i[1])\r\n n -= i[1]\r\n else:\r\n sum += (i[0]*n)\r\n n = 0\r\n break\r\nprint(sum)\r\n", "#16B (35No. Problem A)\r\n\r\nn,m = map(int,input().split())\r\nboxes = []\r\nfor i in range(m):\r\n a,b = map(int,input().split())\r\n boxes.append([b,a])\r\nboxes.sort(reverse=True)\r\n# print(boxes)\r\nfinal = temp = 0\r\n\r\nfor i in range(m):\r\n temp+= boxes[i][1]\r\n # print(temp)\r\n if (temp <= n):\r\n final+= (boxes[i][1] * boxes[i][0])\r\n # print(final)\r\n else:\r\n x = temp - n\r\n final+= (boxes[i][1] - x) * boxes[i][0]\r\n # print(final)\r\n break \r\nprint(final)", "s = input()\r\na = s.split()\r\nn = int(a[0])\r\nm = int(a[1])\r\na = []\r\nb = []\r\nfor i in range(m):\r\n\ts = input()\r\n\tc = s.split()\r\n\ta.append(int(c[0]))\r\n\tb.append(int(c[1]))\r\n\r\nfor i in range(m-1):\r\n\tfor j in range(i+1,m):\r\n\t\tif b[i]<b[j]:\r\n\t\t\tmid = b[j]\r\n\t\t\tb[j] = b[i]\r\n\t\t\tb[i] = mid\r\n\t\t\tmid = a[j]\r\n\t\t\ta[j] = a[i]\r\n\t\t\ta[i] = mid\r\n\r\nsum = 0\r\nwhile (n>0) and (m>0):\r\n\tif n >= a[0]:\r\n\t\tsum += a[0]*b[0]\r\n\t\tn -= a[0]\r\n\t\ta.remove(a[0])\r\n\t\tb.remove(b[0])\r\n\t\tm -= 1\r\n\telse:\r\n\t\tsum += n*b[0]\r\n\t\ta[0] -= n\r\n\t\tn -= n\r\n\r\nprint(sum)", "[n,m]=list(map(int,input().split(\" \")))\r\na=[]\r\nb=[]\r\ncount=0\r\ni=0\r\nwhile i<m:\r\n [x,y]=list(map(int,input().split(\" \")))\r\n a.append(x)\r\n b.append(y)\r\n i=i+1\r\nwhile n>0 and b:\r\n temp=max(b)\r\n i=b.index(temp)\r\n if n>=a[i]:\r\n n=n-a[i]\r\n count=count+a[i]*temp\r\n b.pop(i)\r\n a.pop(i)\r\n else:\r\n count=count+n*temp\r\n n=0\r\nprint(count)", "n, m = map(int,input().split())\nc = [None]*m\nfor i in range(m):\n\ta, b = map(int,input().split())\n\tc[i] = (b,a)\nc.sort(reverse=True)\nmb = 0\ni = 0\nwhile i<m and n>0:\n\tb, a = c[i]\n\tif n>=a:\n\t\tmb += a*b\n\t\tn -= a\n\telse:\n\t\tmb +=n*b\n\t\tn = 0\n\ti += 1\nprint(mb)\n \t\t \t\t \t\t \t \t\t \t \t \t\t", "n, m = map(int, input().split())\r\narr1 = []\r\narr2 = []\r\nfor i in range(m):\r\n x, y = map(int, input().split())\r\n arr1.append(x)\r\n arr2.append(y)\r\nsuma = 0\r\nwhile n > 0:\r\n if len(arr2) == 0:\r\n break\r\n x = max(arr2)\r\n index = 0\r\n for i in range(len(arr2)):\r\n if arr2[i] == x:\r\n index = i\r\n if n - arr1[index] < 0:\r\n suma += n * arr2[index]\r\n n = 0\r\n else:\r\n n -= arr1[index]\r\n suma += arr1[index] * arr2[index]\r\n arr1.pop(index)\r\n arr2.pop(index)\r\nprint(suma)", "n, m = map(int, input().split())\r\narr = [list(map(int, input().split())) for _ in range(m)]\r\narr.sort(key=lambda x: x[-1], reverse=True)\r\ncount = 0\r\nfor i in range(m):\r\n if n >= arr[i][0]:\r\n count += (arr[i][0] * arr[i][-1])\r\n n -= arr[i][0]\r\n else:\r\n temp = arr[i][0] - n\r\n count += ((arr[i][0] - temp) * arr[i][-1])\r\n n -= arr[i][0] - temp\r\n if n == 0:\r\n break\r\nprint(count)", "n,m = map(int,input().split())\r\nl=[]\r\nl2=[]\r\nfor x in range(m) :\r\n a,b=map(int,input().split())\r\n l.append([a,b])\r\n l2.append(b)\r\nl2.sort()\r\nl2.reverse()\r\nl3=[]\r\nfor x in l2 : \r\n for i in l : \r\n if i[1]==x :\r\n l3.append(i)\r\n l.remove(i )\r\n \r\n break\r\nres=0\r\nfor i in range(len(l3)): \r\n if n-l3[i][0] >= 0 : \r\n res+=l3[i][0]*l3[i][1]\r\n n-=l3[i][0]\r\n else :\r\n res+=n*l3[i][1]\r\n break\r\nprint(res)\r\n", "n,m=map(int,input().split())\r\nl=[]\r\nfor _ in range(m):\r\n p=list(map(int,input().split()))\r\n l.append(p)\r\nl.sort(key=lambda x:(x[1],x[0]),reverse=True)\r\nans=0\r\ns=0\r\nval=0\r\nfor i in l:\r\n if n>=i[0]:\r\n n-=i[0]\r\n ans+=i[1]*i[0]\r\n elif n<i[0]:\r\n ans+=n*i[1]\r\n break\r\nprint(ans)\r\n", "# Read input values\r\nn, m = map(int, input().split())\r\n\r\n# Initialize a list to store container data\r\ncontainers = []\r\n\r\n# Read data for each container and calculate the total matches\r\nfor i in range(m):\r\n a, b = map(int, input().split())\r\n containers.append((a, b))\r\n\r\n# Sort containers by the number of matches per matchbox in descending order\r\ncontainers.sort(key=lambda x: -x[1])\r\n\r\n# Initialize variables for the result and matchboxes taken\r\nmatches_taken = 0\r\nmatchboxes_taken = 0\r\n\r\n# Iterate through containers and take matchboxes until the rucksack is full\r\nfor a, b in containers:\r\n if matchboxes_taken + a <= n:\r\n matches_taken += a * b\r\n matchboxes_taken += a\r\n else:\r\n matches_taken += (n - matchboxes_taken) * b\r\n break\r\n\r\n# Print the maximum number of matches taken\r\nprint(matches_taken)\r\n", "n,m=map(int,input().split())\r\nv=[]\r\nfor i in range(m):\r\n x,y=map(int,input().split())\r\n v+=[[y,x]]\r\nv.sort(reverse=True)\r\nc=0\r\nfor j in v:\r\n if j[1] <= n:\r\n n-=j[1]\r\n c+=j[0]*j[1]\r\n elif j[1] > n:\r\n c+=j[0]*n\r\n break\r\nprint(c)\r\n", "n,m = map(int,input().split())\r\nmatchesdict = {}\r\nfor _ in range(m):\r\n v,k = map(int,input().split())\r\n if (k in matchesdict):\r\n matchesdict[k] += v\r\n else:\r\n matchesdict[k] = v\r\n\r\nsorted_match = sorted(matchesdict.keys(),reverse=True)\r\nans,boxes,i = 0,0,0\r\nlim = len(sorted_match)\r\n\r\nwhile ((boxes < n) and (i < lim)):\r\n matches = sorted_match[i]\r\n matchboxes = matchesdict[sorted_match[i]]\r\n if (matchboxes > n-boxes):\r\n ans += ((n-boxes)*matches)\r\n boxes = n\r\n else:\r\n boxes += matchboxes\r\n ans += matches*matchboxes\r\n i += 1\r\n\r\nprint(ans)", "nm = input().strip().split(' ')\r\nn = int(nm[0])\r\nm = int(nm[1])\r\nmatches = {}\r\nfor i in range(m):\r\n ab = input().strip().split(' ')\r\n a = int(ab[0])\r\n b = int(ab[1])\r\n if b in matches:\r\n matches[b] += a\r\n else:\r\n matches[b] = a\r\n\r\nvals = list(matches.keys())\r\nvals.sort(reverse=True)\r\ncount = 0\r\nfor v in vals:\r\n if matches[v]>=n:\r\n count += n*v\r\n break\r\n else:\r\n count += matches[v]*v\r\n n -= matches[v]\r\n \r\nprint(count)\r\n \r\n \r\n \r\n ", "\n\ndef read_int():\n return int(input().strip())\n\n\ndef read_ints():\n return list(map(int, input().strip().split(' ')))\n\n\ndef rev(lst):\n lst.reverse()\n return lst\n\n\ndef solve():\n \"\"\"\n m containers\n i-th container has a[i] matchboxes, each matchbox has b[i] matches\n rucksack holds n matchboxes exactly\n \"\"\"\n n, m = read_ints()\n containers = [rev(read_ints()) for _ in range(m)]\n containers.sort()\n answer = 0\n while containers:\n matches, boxes = containers.pop()\n if n <= boxes:\n answer += n*matches\n break\n else:\n answer += boxes*matches\n n -= boxes\n return answer\n\n\nif __name__ == '__main__':\n print(solve())\n", "# https://codeforces.com/contest/16/problem/B\r\n\r\n\r\ndef single_integer():\r\n return int(input())\r\n\r\n\r\ndef multi_integer():\r\n return map(int, input().split())\r\n\r\n\r\ndef string():\r\n return input()\r\n\r\n\r\ndef multi_string():\r\n return input().split()\r\n\r\n\r\nn, m = multi_integer()\r\n\r\nmatches = list()\r\nfor i in range(m):\r\n matches.append(tuple(multi_integer()))\r\n\r\nmatches.sort(key=lambda x: x[1], reverse=True)\r\nans = 0\r\n\r\nfor i in matches:\r\n if n > i[0]:\r\n n -= i[0]\r\n ans += (i[1] * i[0])\r\n else:\r\n ans += (i[1] * n)\r\n n = 0\r\n if n == 0:\r\n break\r\n\r\nprint(ans)\r\n", "from sys import stdin\r\n\r\nfrom random import randint\r\n\r\n\r\ndef quickSort(L, ascending=False):\r\n if len(L) <= 1:\r\n return L\r\n smaller, equal, larger = [], [], []\r\n pivot = L[randint(0, len(L) - 1)][1]\r\n\r\n for x in L:\r\n if x[1] < pivot:\r\n smaller.append(x)\r\n elif x[1] == pivot:\r\n equal.append(x)\r\n else:\r\n larger.append(x)\r\n\r\n larger = quickSort(larger, ascending=ascending)\r\n smaller = quickSort(smaller, ascending=ascending)\r\n\r\n if ascending:\r\n final = smaller + equal + larger\r\n else:\r\n final = larger + equal + smaller\r\n return final\r\n\r\n\r\ndef get_data(n,m,containers):\r\n organizado = quickSort(containers, ascending=False)\r\n maletas_cargadas = 0\r\n matches = 0\r\n for b in organizado:\r\n if maletas_cargadas == n:\r\n break\r\n if maletas_cargadas + b[0] < n:\r\n maletas_cargadas += b[0]\r\n matches += b[0] * b[1]\r\n else:\r\n matches += (n - maletas_cargadas) * b[1]\r\n maletas_cargadas = n\r\n return matches\r\n\r\ndef main():\r\n containers = []\r\n [n,m] = [int (x) for x in stdin.readline().split()]\r\n for cont in range(m):\r\n containers.append([int (x) for x in stdin.readline().split()])\r\n print(get_data(n,m,containers))\r\n\r\nmain()\r\n \r\n", "n, m = map(int, input().split())\n\narr = list()\n\nfor _ in range(m):\n a, b = map(int, input().split())\n arr.append((b, a))\n\narr.sort(reverse=True)\n\nans = 0\n\nfor i in range(len(arr)):\n can_take = min(n, arr[i][1])\n n -= can_take\n ans += can_take * arr[i][0]\n\nprint(ans)\n", "\r\nn, m = list(map(int, input().split()))\r\n\r\nmatch = []\r\n\r\nfor _ in range(m):\r\n Ai, Bi = list(map(int, input().split()))\r\n \r\n match.append( (Ai, Bi) )\r\n\r\n\r\n\r\nmatch.sort(key= lambda tup:tup[1],reverse=True)\r\n\r\n\r\nans = 0\r\nfor k, v in match:\r\n if k <= n:\r\n ans += k * v\r\n n -= k\r\n elif n < k:\r\n ans += n * v\r\n break\r\n\r\nprint(ans)", "\r\nn,m = list(map(int, input().split()))\r\n\r\nl = []\r\nfor i in range(m):\r\n a,b = list(map(int, input().split()))\r\n l.append((a, b))\r\n\r\nl.sort(key = lambda x: (-x[1], -x[0]))\r\n\r\nans = 0\r\n\r\nfor i in l:\r\n if i[0] >= n:\r\n ans += i[1]*n\r\n break\r\n else:\r\n ans += i[0]*i[1]\r\n n -= i[0]\r\nprint(ans)", "n, m = map(int, input().split())\r\ncontainer = []\r\nfor i in range(m):\r\n item = list(map(int, input().split()))\r\n container.append(item)\r\ncontainer.sort(key=lambda x: x[1], reverse=True)\r\nans = 0\r\ncurr_w=0\r\nfor i in container:\r\n w, v = i[0], i[1]\r\n mul = min(n-curr_w, w)\r\n curr_w += mul\r\n ans+=mul*v\r\n w-=mul\r\nprint(ans)\r\n", "# توكلت على الله\r\n\r\nimport sys \r\ninput = sys.stdin.readline \r\n\r\ndef solve():\r\n n,m = map(int,input().split())\r\n ans = []\r\n res = 0\r\n x = 0 \r\n for i in range(m):\r\n a,b = map(int,input().split())\r\n ans.append((b,a))\r\n ans.sort()\r\n ans = ans[::-1]\r\n \r\n for i in ans:\r\n \r\n if x+i[1] < n:\r\n x+=i[1]\r\n res+=i[1]*i[0]\r\n \r\n else:\r\n c = n-x\r\n res+=(i[0]*c)\r\n break\r\n print(res) \r\n#for i in range(int(input())):\r\nsolve()", "n,m=map(int,input().split())\r\nbox=[]\r\nfor i in range (m):\r\n a,b=map(int,input().split())\r\n box.append((a,b))\r\nbox.sort(reverse=True,key=lambda x: x[1])\r\nsteal =0\r\nfor bx in box:\r\n if bx[0] <= n:\r\n steal += bx[0]*bx[1]\r\n n -= bx[0]\r\n else:\r\n steal += n*bx[1]\r\n break\r\n \r\n \r\nprint(steal)\r\n \r\n", "n , m = map(int,input().split())\r\na = []\r\nfor i in range(m):\r\n a.append(list(map(int,input().split())))\r\na.sort( key = lambda x : x[1] , reverse = True)\r\nans = 0\r\nfor i in a:\r\n if(n > i[0]):\r\n n -= i[0]\r\n ans += i[0] * i[1]\r\n else:\r\n ans += n * i[1]\r\n break;\r\nprint (ans)\r\n", "from bisect import bisect_right as br\r\nimport sys\r\nfrom collections import *\r\nfrom math import *\r\nimport re\r\ndef sieve(n):\r\n prime=[True for i in range(n+1)]\r\n p=2\r\n while p*p<=n:\r\n if prime[p]==True:\r\n for i in range(p*p,n+1,p):\r\n prime[i]=False\r\n p+=1\r\n c=0\r\n for i in range(2,n):\r\n if prime[i]:\r\n #print(i)\r\n c+=1\r\n return c\r\ndef totient(n):\r\n res,p=n,2\r\n while p*p<=n:\r\n if n%p==0:\r\n while n%p==0:\r\n n=n//p\r\n res-=int(res/p)\r\n p+=1\r\n if n>1:res-=int(res/n)\r\n return res\r\n \r\n\r\ndef iseven(n):return[False,True][0 if n%2 else 1]\r\ndef inp_matrix(n):return list([input().split()] for i in range(n))\r\ndef inp_arr():return list(map(int,input().split()))\r\ndef inp_integers():return map(int,input().split())\r\ndef inp_strings():return input().split()\r\ndef lcm(a,b):return (a*b)/gcd(a,b)\r\nmax_int = sys.maxsize\r\nmod = 10**9+7\r\nflag1=False\r\nflag2=False\r\n\r\nn,m=inp_integers()\r\nL=[list(map(int,input().split())) for i in range(m)]\r\nL.sort(key=lambda x:x[1],reverse=True)\r\n#print(L)\r\nans=0\r\nfor i in range(m):\r\n ans+=min(L[0][0],n)*L[0][1]\r\n n-=min(L[0][0],n)\r\n L.pop(0)\r\nprint(ans)", "n, m = map(int, input().split())\r\nlst = []\r\nfor i in range(m):\r\n a, b = map(int, input().split())\r\n lst.append((a, b))\r\nl = sorted(lst, key=lambda x: x[1], reverse=True)\r\nans = 0\r\nfor i in l:\r\n if i[0]<=n:\r\n ans += i[0]*i[1]\r\n n -= i[0]\r\n else:\r\n ans += n*i[1]\r\n break\r\n \r\nprint(ans)", "n,m = map(int,input().split())\r\nl = list()\r\nfor i in range(m):\r\n a,b = map(int,input().split())\r\n l.append((b,a))\r\n\r\nl.sort(reverse = True)\r\nans = 0\r\nfor i in l:\r\n if n == 0:\r\n break\r\n if n >= i[1]:\r\n n-=i[1]\r\n ans += i[1] * i[0]\r\n else:\r\n ans+= n * i[0]\r\n n = 0\r\nprint(ans)", "n, m = [int(i) for i in input().split()]\r\na = sorted([[int(j) for j in input().split()] for i in range(m)], key=lambda x: - x[1])\r\nk = s = 0\r\nwhile n > 0 and k < m:\r\n t = min(a[k][0], n)\r\n s += t * a[k][1]\r\n n -= t\r\n k += 1\r\nprint(s)\r\n", "n,m=[int(i) for i in input().split()]\r\ncand=[]\r\nfor i in range(m):\r\n cand.append([int(i) for i in input().split()])\r\n\r\ncand.sort(key=lambda x:x[1],reverse=True)\r\nres=0\r\nfor i in range(m):\r\n temp=min(n,cand[i][0])\r\n res+=cand[i][1]*temp\r\n n-=temp\r\n if temp<=0:\r\n break\r\nprint(res)", "import heapq\r\ndesired, n = map(int, input().split())\r\nmaxHeap = []\r\nfor i in range(n):\r\n num, weight = map(int, input().split())\r\n heapq.heappush(maxHeap, (-weight, num))\r\ntotal = 0\r\nwhile desired > 0 and maxHeap:\r\n weight, num = maxHeap[0]\r\n weight = -weight\r\n heapq.heappop(maxHeap)\r\n if num <= desired:\r\n total += (weight * num)\r\n desired -= num\r\n continue\r\n else:\r\n total += weight * desired\r\n num -= desired\r\n desired = 0\r\nprint(total)\r\n", "n , m = map(int,input().split())\nmatrix = []\nfor i in range(m):\n a = list(map(int,input().split()))\n matrix.append(a)\nmatrix.sort(key=lambda x:x[1])\nans =0 \nj = m-1\nwhile(j>=0):\n if(matrix[j][0]>=n):\n ans +=(n*matrix[j][1])\n break\n else:\n ans+=(matrix[j][0]*matrix[j][1])\n n-=matrix[j][0]\n j-=1\nprint(ans)\n", "n,m = map(int,input().split())\r\nfrq = [0]*11 ## = b.i in problem\r\n\r\nfor i in range(m):\r\n a,b=map(int,input().split())\r\n frq[b]+=a\r\ntotal = 0\r\nfor i in range(10,-1,-1):\r\n total += min(n,frq[i])*i\r\n n-=min(n,frq[i])\r\n if n<=0:\r\n break\r\nprint(total)\r\n \r\n", "n,m=map(int,input().split())\r\nl=[]\r\nfor i in range(m):\r\n\ty=[]\r\n\ta,b=map(int,input().split())\r\n\ty=[b,a]\r\n\tl.append(y)\r\nl.sort(reverse=True)\r\n# print(l)\r\ns=0\r\nc=0\r\nfor j in range(m):\r\n\tif((n-(s+l[j][1]))>0):\r\n\t\tc=c+l[j][0]*l[j][1]\r\n\t\ts=s+l[j][1]\r\n\t\t# print(s,c)\r\n\telse:\r\n\t\tr=n-s\r\n\t\t# print(r)\r\n\t\tc=c+r*l[j][0]\r\n\t\tbreak\r\nprint(c)", "n,m=list(map(int,str.split(input())))\r\n\r\nmatch_boxs=[]\r\n\r\nfor _ in range(m): \r\n count,val=(tuple(map(int,str.split(input()))))\r\n match_boxs.append((val,count))\r\nmatch_boxs=sorted(match_boxs,reverse=True)\r\n\r\nrslt=0\r\nfor box in match_boxs:\r\n if n==0:\r\n break\r\n else:\r\n take = min(n,box[1])\r\n rslt+=take*box[0]\r\n n-=take\r\nprint(rslt)", "n, m = map(int, input().split())\r\n\r\nmatches = []\r\nfor _ in range(m):\r\n match = list(map(int, input().split()))\r\n matches.append(match)\r\n\r\nres = 0\r\nmatches = sorted(matches, key = lambda x: x[1], reverse = True)\r\n\r\nfor x in matches:\r\n if x[0] >= n:\r\n res += x[1] * n\r\n n -= n\r\n elif x[0] < n:\r\n res += x[1] * x[0]\r\n n -= x[0]\r\n if n == 0:\r\n break\r\nprint(res)\r\n", "# fin = open('input.txt')\n\n# def input():\n# \treturn fin.readline()\n\nn, m = tuple([int(x) for x in input().strip().split(' ')])\n\nmatches = []\n\nfor _ in range(m):\n\tab = tuple([int(x) for x in input().strip().split(' ')])\n\tmatches.append(ab)\n\nmatches = sorted(matches, key=lambda ab : ab[1], reverse=True)\n\nremaining = n\nresult = 0\n\nfor box in matches:\n\ta, b = box\n\tchosen = min(a, remaining)\n\tresult += chosen * b\n\tremaining -= chosen\n\n\tif remaining == 0:\n\t\tbreak\n\nprint(result)\n\n\n\n\n\n\n\n\n\n\t\n\n\n\n\t\t\n\n\t\t\n\n", "n,m=map(int,input().split())\r\nd=dict()\r\nfor _ in range(m):\r\n a,b=map(int,input().split())\r\n if b in d.keys():\r\n d[b]+=a\r\n else:\r\n d[b]=a\r\nco=0\r\nwhile n>0 and len(d.keys())>0:\r\n if d[max(d.keys())]<=n:\r\n co+=max(d.keys())*d[max(d.keys())]\r\n n-=d[max(d.keys())]\r\n d[max(d.keys())]=0\r\n elif d[max(d.keys())]>n:\r\n co+=max(d.keys())*n\r\n n=0\r\n d[max(d.keys())]-=n\r\n if d[max(d.keys())]==0:\r\n del d[max(d.keys())]\r\nprint(co)\r\n", "n, m = list( map(int, input().split()) )\r\nlst = []\r\n\r\nfor _ in range(m):\r\n a, b = list( map(int, input().split()) )\r\n lst.append( (b, a) )\r\n\r\nlst.sort( reverse = True )\r\n\r\ntot = 0\r\nfor x in lst:\r\n if n == 0:\r\n break\r\n\r\n if n >= x[1]:\r\n n -= x[1]\r\n tot += x[1]*x[0]\r\n else:\r\n tot += n*x[0]\r\n n = 0\r\n\r\nprint(tot)\r\n", "n, m = map(int, input().split())\r\nAB = []\r\nfor i in range(m):\r\n a, b = map(int, input().split())\r\n AB.append((a, b))\r\nAB.sort(key=lambda x: -x[1])\r\nans = 0\r\ncnt = 0\r\nfor a, b in AB:\r\n if cnt+a <= n:\r\n ans += a*b\r\n cnt += a\r\n else:\r\n ans += b*(n-cnt)\r\n break\r\nprint(ans)\r\n", "numbers = list(map (int , input().split()))\r\ndate = []\r\nfor i in range (0 , numbers[1]) :\r\n x =list(map (int , input().split()))\r\n info = {\r\n 'cap' : x[1] ,\r\n 'number' : x[0]\r\n }\r\n date.append(info)\r\ndef num(date):\r\n return date['cap']\r\ndate.sort(key=num , reverse=True)\r\ncounter = 0\r\nsum = 0\r\nfor i in range (0 , len(date)) :\r\n if counter < numbers[0] :\r\n if counter + date[i]['number'] <= numbers[0] :\r\n counter += date[i]['number']\r\n sum += date[i]['number'] * date[i]['cap']\r\n else :\r\n sum += (numbers[0] - counter ) * date[i]['cap']\r\n counter += (numbers[0] - counter)\r\nprint(sum)", "# Wadea #\r\n\r\nn,m = map(int,input().split())\r\nd = dict()\r\narr = []\r\nfor i in range(m):\r\n a,b = map(int,input().split())\r\n if b in d: \r\n d[b] += a\r\n else:\r\n d[b] = a\r\n arr.append(b)\r\n\r\narr.sort()\r\nmax_amount = 0\r\n\r\nfor j in range(len(arr)-1,-1,-1):\r\n if n >= d[arr[j]]:\r\n max_amount += (arr[j] * d[arr[j]])\r\n n -= d[arr[j]]\r\n else:\r\n max_amount += (arr[j] * n)\r\n break\r\nprint(max_amount)\r\n", "n,m = map(int,input().split())\na = []\nfor i in range(m):\n d = list(map(int,input().split()))\n a.append(d)\nfor i in range(m-1):\n for j in range(m-i-1):\n if a[j][1] < a[j+1][1]:\n a[j+1],a[j] = a[j],a[j+1]\nq = 0\nfor i in range(m):\n if n > a[i][0]:\n q = q+(a[i][0]*a[i][1])\n n = n-a[i][0]\n else:\n q = (a[i][1]*n)+q\n break\nprint(q)\n\n\n\t \t\t\t \t \t \t \t \t\t \t\t\t\t \t", "n,m = list(map(int,input().split()))\r\n\r\ncontainers = []\r\n\r\nres = 0\r\n\r\nfor _ in range(m): \r\n containers.append(list(map(int,input().split())))\r\n\r\ncontainers = sorted(containers,key= lambda x: x[1],reverse=True)\r\n\r\nfor i in range(len(containers)):\r\n if containers[i][0] < n:\r\n res += containers[i][0]*containers[i][1]\r\n n -= containers[i][0]\r\n else :\r\n res += n*containers[i][1]\r\n break\r\n \r\n\r\nprint(res)\r\n\r\n", "s = input()\r\nn = int(s.split(\" \")[0])\r\nm = int(s.split(\" \")[1])\r\narr= []\r\nfor i in range(m):\r\n line = input()\r\n a = int(line.split(' ')[0])\r\n b = int(line.split(' ')[1])\r\n arr.append((a,b))\r\n\r\narr.sort(key= lambda tup:tup[1],reverse=True)\r\nmatches = 0\r\nleft = n\r\nfor i in arr:\r\n if left is not 0:\r\n if i[0]<= left and left > 0:\r\n matches += i[0]*i[1]\r\n left -= i[0]\r\n else:\r\n matches += (left)*i[1]\r\n left = 0\r\n\r\nprint(matches)", "n, m = map(int, input().split())\r\nmatch = []\r\nfor i in range(m):\r\n a, b = map(int, input().split())\r\n match.append([b, a])\r\n\r\nmatch.sort(reverse=True)\r\nmatches = 0\r\n\r\nfor each in match:\r\n if n >= each[1]:\r\n matches += each[0] * each[1]\r\n n -= each[1]\r\n else:\r\n matches += n * each[0]\r\n break\r\n\r\nprint(matches)\r\n", "n,m = map(int, input().split())\nA = []\nfor _ in range(m):\n a,b = map(int, input().split())\n A.append((b,a))\n\nA.sort(reverse=True)\n\ncount = 0\nfor b,a in A:\n num = min(n, a)\n n -= num\n count += num * b\n\nprint(count)\n\n\n\n", "n,m=map(int,input().split())\r\na=[]\r\nfor i in range(m):\r\n x,y=map(int,input().split())\r\n a.append([x,y])\r\na.sort(key = lambda x: x[1])\r\na=a[::-1]\r\ni=0\r\nres=0\r\nwhile n and i-len(a):\r\n if n>=a[i][0]:\r\n res+=a[i][0]*a[i][1]\r\n n-=a[i][0]\r\n else:\r\n res+=n*a[i][1]\r\n n=0\r\n i+=1\r\nprint(res)", "import sys\r\nimport math\r\nfrom typing import Callable\r\n\r\n\r\n\r\ndef main() -> None:\r\n read: Callable[[], str] = sys.stdin.readline\r\n n, m = (int(i) for i in read().split())\r\n values: list[tuple[int, int]] = []\r\n\r\n for _ in range(m):\r\n boxes, matches = (int(i) for i in read().split())\r\n values.append((matches, boxes))\r\n values.sort(reverse=True)\r\n\r\n total= 0\r\n for val in values:\r\n if n == 0:\r\n break\r\n matches, boxes = val\r\n if boxes < n:\r\n n -= boxes\r\n total += matches * boxes\r\n elif boxes >= n:\r\n total += n * matches\r\n n = 0\r\n print(total)\r\n\r\n\r\n\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "\"\"\"\r\nread: 1:01\r\nthink: 2:46\r\ncode: 10:48\r\ndebug: --:--\r\nstatus: TL\r\n\"\"\"\r\nn, m = map(int, input().split())\r\n\r\nc = [list(map(int, input().split())) for i in range(m)]\r\nc.sort(key=lambda x: x[1], reverse=True)\r\n\r\nmx = 0\r\ni = 0\r\nwhile n > 0 and i < m:\r\n add = min(n, c[i][0])\r\n mx += add * c[i][1]\r\n n -= add\r\n i += 1\r\n\r\n\r\nprint(mx)", "n, m = map(int, input().split())\r\narr = []\r\nfor _ in range(m):\r\n a, b = map(int, input().split())\r\n arr.append([a, b])\r\narr.sort(key=lambda x: -x[1])\r\nans = 0\r\nwhile n and arr:\r\n a, b = arr.pop(0)\r\n ma = min(n, a)\r\n ans += ma * b\r\n n -= ma\r\nprint(ans)", "n, m = [int(x) for x in input().split()]\ninp = []\nfor _ in range(m):\n inp.append([int(x) for x in input().split()])\n\nres = 0\ninp.sort(key=lambda x: x[1], reverse=True)\nfor boxes, matches in inp:\n if not n:\n break\n take = min(boxes, n)\n res += take * matches\n n -= take \n\nprint(res)\n", "import sys\r\ninput = sys.stdin.readline\r\nn,m = map(int,input().split())\r\nl = []\r\nfor i in range(m):\r\n a,b = map(int,input().split())\r\n l.append((b,a))\r\n\r\nl.sort()\r\nans = 0\r\nwhile len(l) > 0:\r\n x = l.pop()\r\n if n >= x[1]:\r\n n -= x[1]\r\n ans = ans+(x[0]*x[1])\r\n\r\n else:\r\n ans = ans+(x[0]*n)\r\n break\r\n\r\nprint(ans)", "n, m = map(int, input().split())\nmatch = [0] * m\nfor i in range(m):\n match[i] = list(map(int, input().split()))\nmatch.sort(key=lambda x: -x[1])\ni = 0\nans = 0\nwhile i < m and n >= 0:\n totake = min(n, match[i][0])\n n -= totake\n ans += match[i][1] * totake\n match[i][0] -= totake\n i += 1\nprint(ans)\n ", "from sys import stdin,stdout,exit\r\nimport math\r\nfrom fractions import gcd\r\ndef sin(): \r\n\treturn stdin.readline().rstrip()\r\ndef listInput():\r\n\treturn list(map(int,sin().split()))\r\ndef printBS(li):\r\n\tif not li: return\r\n\tfor i in range(len(li)-1):\r\n\t\tstdout.write(\"%d \"%(li[i]))\r\n\tstdout.write(\"%d\\n\"%(li[-1]))\r\nn,m=listInput()\r\nli=[]\r\nfor _ in range(m):\r\n\ta,b=listInput()\r\n\tli.append((b,a))\r\nans=0\r\nli.sort(reverse=True)\r\ni=0\r\nwhile n>=0 and i<m:\r\n\tans+=min(n,li[i][1])*li[i][0]\r\n\t#print(n,li[i][1],li[i][0],min(n,li[i][1])*li[i][0])\r\n\tn=n-min(n,li[i][1])\r\n\ti+=1\r\nprint(ans)", "n,m=map(int,input().split())\r\nl=[]\r\nfor i in range(m):\r\n a,b=map(int,input().split())\r\n l.append((a,b))\r\nl.sort(key=lambda x: x[1],reverse=True)\r\nans=0\r\nfor i in range(m):\r\n if n==0:\r\n break\r\n x=min(l[i][0],n)\r\n ans+=x*l[i][1]\r\n n-=x\r\nprint(ans)", "\r\nn, m = list(map(int, input().split()))\r\n\r\npresent = []\r\n\r\nwhile m:\r\n\r\n present.append(tuple(map(int, input().split())))\r\n\r\n m -= 1\r\n\r\npresent = sorted(present, reverse=True, key=lambda x: x[1])\r\n\r\ntotal_matches = 0\r\n\r\nfor item in present:\r\n\r\n ct = min(n, item[0])\r\n\r\n total_matches += (item[1]*ct)\r\n\r\n n -= ct\r\n\r\n if not n:\r\n break\r\n\r\nprint(total_matches)", "a,b=map(int,input().split())\r\ns=0\r\nl=[]\r\nfor i in range(b):\r\n c=list(map(int,input().split()))\r\n l.append(c)\r\nl=sorted(l,key=lambda l:l[1],reverse=True)\r\nfor i in range(len(l)):\r\n if a<=0:\r\n break\r\n elif a>=l[i][0]:\r\n s=s+l[i][0]*l[i][1]\r\n a=a-l[i][0]\r\n #print(a)\r\n #print(s)\r\n else:\r\n s=s+a*l[i][1]\r\n a=a-l[i][0]\r\n #print(s)\r\nprint(s) ", "n, m = map(int, input().split())\r\nv = 0\r\nfor j in sorted( (list(map(int, input().split()))[::-1] for i in range(m)), reverse=True):\r\n c = min(j[1], n)\r\n n -= c\r\n v += c * j[0]\r\nprint(v)", "n, m = map(int, input().split())\nboxes = []\nfor x in range(m): \n boxes.append(list(map(int, input().split())))\n\nboxes = sorted(boxes, key= lambda boxes: boxes[1], reverse=True)\ntotal = 0\nfor x in boxes:\n if n - x[0] <= 0: \n total += n * x[1]\n break\n \n total += x[0] * x[1]\n n -= x[0]\nprint(total)", "n, m = list(map(int, input().split()))\r\nw = {}\r\n\r\nfor i in range(m):\r\n b, a = list(map(int, input().split()))\r\n w[i] = (b, a) \r\n\r\nw = {k: v for k, v in sorted(w.items(), key = lambda i: i[1][1], reverse=True)}\r\nans = 0\r\nfor i in w:\r\n m = w.get(i)[0]\r\n if m >= n:\r\n ans += n * w.get(i)[1]\r\n break;\r\n else:\r\n ans += m * w.get(i)[1]\r\n n -= m \r\nprint(ans)\r\n\r\n", "from operator import itemgetter\r\nn,m = map(int,input().split())\r\nabi = [list(map(int,input().split())) for i in range(m)]\r\nabi.sort(key=itemgetter(1))\r\nans = 0\r\nfor i in range(m-1,-1,-1):\r\n if n <= 0:\r\n break\r\n ans += min(abi[i][0],n) * abi[i][1]\r\n n -= abi[i][0]\r\n \r\nprint(ans)\r\n", "import sys\ninput = sys.stdin.readline\n\n############ ---- Input Functions ---- ############\ndef inp(): # int\n return(int(input()))\ndef inlt(): # list\n return(list(map(int,input().split())))\ndef insr(): # string as char list\n s = input()\n return(list(s[:len(s) - 1]))\ndef instr(): # string\n return input()\ndef invr(): # spaced ints\n return(map(int,input().split()))\n\nn, m = list(invr())\nlst = []\nfor i in range(m):\n ai, bi = list(invr())\n lst.append((ai, bi))\n\nlst = sorted(lst, key=lambda x: x[1], reverse=True)\n# print(lst)\nnum = 0\nfor i in range(m):\n ai, bi = lst[i]\n num_take = min(n, ai)\n num += bi * num_take\n n -= num_take\n if n <= 0:\n break\nprint(num)", "import sys\r\nimport math\r\nimport collections\r\nimport bisect\r\ndef get_ints(): return map(int, sys.stdin.readline().strip().split())\r\ndef get_list(): return list(map(int, sys.stdin.readline().strip().split()))\r\ndef get_string(): return sys.stdin.readline().strip()\r\nfor t in range(1):\r\n n,k=get_ints()\r\n arr=[]\r\n for j in range(k):\r\n a,b=map(int,input().split())\r\n row=[b,a]\r\n arr.append(row)\r\n arr.sort(reverse=True)\r\n ans=0\r\n for i in range(k):\r\n val=min(arr[i][1],n)\r\n n-=val\r\n ans+=val*arr[i][0]\r\n print(ans)", "n, m = map(int, input().split())\r\n\r\ncontainers = []\r\nfor i in range(m):\r\n a, b = map(int, input().split())\r\n containers.append((a, b))\r\n\r\n# sort the containers in decreasing order of bi\r\ncontainers.sort(key=lambda x: -x[1])\r\n\r\nmatches = 0\r\nfor a, b in containers:\r\n # take the minimum of a and n, because we can take at most n matchboxes\r\n matches += min(a, n) * b\r\n n -= min(a, n)\r\n if n == 0:\r\n break\r\n\r\nprint(matches)\r\n", "a,b=input().strip().split(\" \")\r\na,b=[int(a),int(b)]\r\nx=[]\r\nfor i in range(b):\r\n c,d=input().strip().split(\" \")\r\n c,d=[int(c),int(d)]\r\n x.append([d,c])\r\nx.sort(reverse=True)\r\ns1=0\r\ns2=0\r\nfor i in range(b):\r\n if s1+x[i][1]>a:\r\n s2+=(a-s1)*x[i][0]\r\n break\r\n else:\r\n s2+=x[i][0]*x[i][1]\r\n s1+=x[i][1]\r\nprint(s2)\r\n", "N= list(map(int,input().split()))\r\na =[0]*N[1]\r\nb =[0]*N[1]\r\n\r\nfor i in range(0,N[1]):\r\n a[i],b[i] = map(int,input().split())\r\n\r\nn=0\r\nmaxx=0\r\nstart = max(b)\r\nfi = b.index(max(b))\r\nif (int(a[fi]) >= N[0]):\r\n maxx = int(b[fi]) * N[0]\r\n n = N[0]\r\nwhile(n<N[0] and len(b) !=0):\r\n start = max(b)\r\n fi = b.index(max(b))\r\n remain= N[0]-n\r\n\r\n if(remain>=int(a[fi])):\r\n maxx+= int(b[fi])*int(a[fi])\r\n n+=int(a[fi])\r\n b.pop(fi)\r\n a.pop(fi)\r\n else:\r\n maxx += int(b[fi]) * (remain)\r\n n += remain\r\n # b.remove(max(b))\r\n a[fi]=a[fi]-remain\r\n\r\n\r\nprint(maxx)\r\n", "import math\r\n\r\n\r\ndef main_function():\r\n n, m = [int(i) for i in input().split(\" \")]\r\n matches = 0\r\n collector = []\r\n for i in range(m):\r\n collector.append([int(i) for i in input().split(\" \")])\r\n collector = sorted(collector, key=lambda x:x[1], reverse=True)\r\n for i in collector:\r\n a, b = i\r\n if n >= a:\r\n matches += a * b\r\n n -= a\r\n elif n < a:\r\n matches += b * n\r\n n = 0\r\n if n == 0:\r\n break\r\n return matches\r\n\r\n\r\nprint(main_function())", "n, m = [int(i) for i in input().split()]\r\nboxes = []\r\nfor _ in range(m):\r\n a, b = [int(i) for i in input().split()]\r\n boxes.append([a, b])\r\nboxes = sorted(boxes, key=lambda x: x[1], reverse=True)\r\nans = 0\r\nfor i in boxes:\r\n if i[0] >= n:\r\n ans += n*i[1]\r\n break\r\n else:\r\n n -= i[0]\r\n ans += i[0]*i[1]\r\nprint(ans)", "n, m = map(int, input().split())\r\nc = list()\r\nresult = 0\r\nfor i in range(m):\r\n\ta, b = map(int, input().split())\r\n\tc.append([b, a])\r\nc = sorted(c)[::-1]\r\nfor i in range(m):\r\n\tresult+=(min(c[i][1],n)*c[i][0])\r\n\tn-=c[i][1]\r\n\tif n<=0:\r\n\t\tbreak\r\nprint(result)", "n, m = map(int, input().split())\r\nmatches = []\r\nfor i in range(m):\r\n matches.append(list(map(int, input().split())))\r\nmatches.sort(key=lambda container: container[1], reverse=True)\r\n\r\ncount = 0\r\ni = 0\r\nj = 0\r\nwhile i <= n and j < m:\r\n if matches[j][0] < n - i:\r\n i += matches[j][0]\r\n count += matches[j][0] * matches[j][1]\r\n else:\r\n count += (n - i) * matches[j][1]\r\n i = n\r\n j += 1\r\nprint(count)\r\n", "m,n = map(int,input().split())\nnum = []\nfor i in range(n):\n num1 = list(map(int,input().split()))\n num.append(num1)\nd = 0\nk = 0\nwhile m > 0:\n max = 0\n x = 0\n y = 0\n for j in range(len(num)):\n if num[j][1] >max:\n max = num[j][1]\n y = num[j][0]\n x = j\n k = k + 1\n if max == 0:\n break\n if m > y:\n m = m - y\n d = d + y * num[x][1]\n num[x][1] = 0\n elif m == y:\n m = m - y\n d = d + y * num[x][1]\n num[x][1] = 0\n break\n else:\n d = d + m * num[x][1]\n m = 0\n break\nprint(d)\n \t\t \t\t \t \t \t \t \t \t \t", "n, m = map(int, input().split())\r\ninfo = []\r\nfor _ in range(m):\r\n info.append(list(map(int, input().split())))\r\n \r\ninfo_sorted = info.copy()\r\nfor i in range(m-1):\r\n for j in range(m)[i+1:]:\r\n if info_sorted[i][1]<info_sorted[j][1]:\r\n info_sorted[j],info_sorted[i] = info_sorted[i],info_sorted[j]\r\n\r\nsum = 0\r\ncnt = 0\r\nfor a,b in info_sorted:\r\n sum=sum+a\r\n if sum<=n:\r\n cnt = cnt + a*b\r\n else:\r\n cnt = cnt + (n-(sum-a))*b \r\n break\r\n\r\nprint(cnt)", "n, m = input().split()\r\nn = int(n)\r\nm = int(m)\r\ndec = {}\r\nlis = []\r\nfor i in range(int(m)):\r\n a, b = input().split()\r\n a = int(a)\r\n b = int(b)\r\n pr = (a, b)\r\n lis.append(pr)\r\nlis.sort(key=lambda x: x[1], reverse=True)\r\nmax_count = 0\r\nfor i in range(len(lis)):\r\n if lis[i][0] <= n:\r\n n = n-lis[i][0]\r\n max_count += lis[i][0]*lis[i][1]\r\n else:\r\n max_count += n*lis[i][1]\r\n n = 0\r\n if n == 0:\r\n break\r\nprint(max_count)", "\r\nn,m=map(int,input().split())\r\nl=[]\r\nfor i in range(m):\r\n\tx,y=map(int,input().split())\r\n\tl.append((x,y))\r\nl.sort(key=lambda x:x[1],reverse=True)\r\nans=0\r\nfor i in range(m):\r\n\tif l[i][0]>=n:\r\n\t\tx=n\r\n\telse:\r\n\t\tx=l[i][0]\r\n\tn-=x\r\n\tans+=x*l[i][1]\r\nprint(ans)", "n,m = [int(i) for i in input().split()]\nl=[]\nfor i in range(m):\n a,b = [int(i) for i in input().split()]\n l.append((b,a))\nl.sort(reverse=True)\ni = 0\nj = 0\nnb = 0\nwhile j < n and i < len(l):\n nb+=l[i][1]*l[i][0]\n j+=l[i][1]\n i+=1\nif j > n:\n nb -= (j-n)*l[i-1][0]\nprint(nb)\n", "def maximum_matches(n, m, containers):\r\n containers.sort(key=lambda x: x[1], reverse=True)\r\n \r\n total_matches = 0\r\n remaining_boxes = n\r\n \r\n for i in range(m):\r\n matchboxes, matches_per_box = containers[i]\r\n \r\n if remaining_boxes >= matchboxes:\r\n total_matches += matchboxes * matches_per_box\r\n remaining_boxes -= matchboxes\r\n else:\r\n total_matches += remaining_boxes * matches_per_box\r\n break\r\n \r\n return total_matches\r\n\r\nn, m = map(int, input().split())\r\ncontainers = []\r\nfor _ in range(m):\r\n a, b = map(int, input().split())\r\n containers.append((a, b))\r\n\r\nprint(maximum_matches(n, m, containers))\r\n", "n,m = map(int,input().split())\r\nmatchboxes = {}\r\nfor _ in range(m):\r\n a,b = map(int,input().split()) #a refers to number of matchboxes holding b matches\r\n matchboxes[b] = a if b not in matchboxes else matchboxes[b] + a\r\nhighest = 0\r\nfor key,value in sorted(matchboxes.items(),key = lambda x: x[0],reverse = True):\r\n if value <= n:\r\n highest += key*value\r\n n -= value\r\n else:\r\n highest += key*n\r\n n = 0\r\n if n == 0:\r\n break\r\nprint(highest)\r\n\r\n\r\n\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn, m = map(int, input().split())\r\nx = []\r\nfor _ in range(m):\r\n a, b = map(int, input().split())\r\n x.append((b, a))\r\nx.sort(reverse = True)\r\nans = 0\r\nfor b, a in x:\r\n c = min(n, a)\r\n ans += c * b\r\n n -= c\r\nprint(ans)", "n, m = map(int, input().split())\r\nl = []\r\nfor _ in range(m):\r\n l.append(list(map(int, input().split()))[::-1])\r\nl.sort(reverse=True)\r\nans = 0\r\n\r\nfor x in l:\r\n if n >= x[1]:\r\n ans += x[0] * x[1]\r\n n -= x[1]\r\n else:\r\n ans += x[0] * n\r\n break\r\n\r\nprint(ans)", "n,m = map(int, input().split())\r\nmatchBoxes= []\r\n\r\nfor i in range(m):\r\n\ta,b = map(int, input().split())\r\n\tmatchBoxes.append((a,b))\r\n\r\nsortedMatchBoxes = sorted(matchBoxes, key=lambda x: x[1], reverse=True)\r\ntotal = 0\r\ni = 0\r\nwhile(n > 0 and i < m):\r\n\tif sortedMatchBoxes[i][0] > n:\r\n\t\ttotal+= n * sortedMatchBoxes[i][1]\r\n\t\tbreak\r\n\telse:\r\n\t\tn -= sortedMatchBoxes[i][0]\r\n\t\ttotal+= sortedMatchBoxes[i][0] * sortedMatchBoxes[i][1]\r\n\t\ti+=1\r\n\r\nprint(total)", "from collections import defaultdict as dd\nfrom collections import deque\nimport bisect\nimport heapq\n \ndef ri():\n return int(input())\n \ndef rl():\n return list(map(int, input().split()))\n \nn, m =rl()\nmatchboxes = []\n\nfor i in range(m):\n\ta, b = rl()\n\tmatchboxes.append((b, a))\nmatchboxes.sort(reverse =True)\n\nans = 0\ni = -1\ntaken = 0\nwhile i + 1 < m and taken <= n:\n\ti += 1\n\tb, a = matchboxes[i]\n\tif taken + a > n:\n\t\tans += (n -taken) * b\n\t\ttaken = n\n\t\tbreak\n\telse:\n\t\ttaken += a\n\t\tans += a*b\n\t\nprint(ans)\n\n", "nums = [int(i) for i in input().split()]\r\nboxes = []\r\nmatches = []\r\nout = 0\r\nb_out = 0\r\nfor i in range(nums[1]):\r\n container = [int(i) for i in input().split()]\r\n boxes.append(container[0])\r\n matches.append(container[1])\r\nif nums[0] > sum(boxes):\r\n for i in range(nums[1]):\r\n out += boxes[i] * matches[i]\r\nelse:\r\n if nums[0] - boxes[matches.index(max(matches))] <= 0:\r\n out += nums[0] * max(matches)\r\n b_out += nums[0]\r\n matches[matches.index(max(matches))] = 0\r\n else:\r\n out += boxes[matches.index(max(matches))] * max(matches)\r\n b_out += boxes[matches.index(max(matches))]\r\n matches[matches.index(max(matches))] = 0\r\n while b_out != nums[0]:\r\n if nums[0] - b_out - boxes[matches.index(max(matches))] <= 0:\r\n out += (nums[0] - b_out) * max(matches)\r\n b_out += nums[0] - b_out\r\n matches[matches.index(max(matches))] = 0\r\n else:\r\n out += boxes[matches.index(max(matches))] * max(matches)\r\n b_out += boxes[matches.index(max(matches))]\r\n matches[matches.index(max(matches))] = 0\r\n i += 1\r\nprint(out)", "n,m=map(int,input().split(\" \"))\r\nmatches=[]\r\nfor _ in range(m):\r\n x,y=map(int,input().split(\" \"))\r\n matches.append([y,x])\r\nprofit=0\r\nmatches.sort(reverse=True)\r\n#print(matches)\r\n##(10,5),(6,2),(5,2)\r\nfor i in range(0,len(matches)):\r\n if matches[i][1]<=n:\r\n profit+=matches[i][1]*matches[i][0]\r\n n-=matches[i][1]\r\n else:\r\n profit+=matches[i][0]*n\r\n break\r\nprint(profit)\r\n\r\n\r\n\r\n", "n,m = map(int,input().split())\r\narr = []\r\narr2 = []\r\nfor _ in range(m):\r\n x,y = map(int,input().split())\r\n arr.append(x)\r\n arr2.append(y)\r\n\r\narr2,arr = list(zip(*sorted(zip(arr2,arr))))\r\nlst = list(arr)[::-1]\r\nlst2 = list(arr2)[::-1]\r\nans = 0\r\nfor i in range(m):\r\n if n >= lst[i]:\r\n ans += (lst2[i]*lst[i])\r\n n -= lst[i]\r\n else:\r\n ans += (lst2[i]*n)\r\n break\r\nprint(ans)\r\n ", "def main():\r\n\r\n size, container_num = list(map(int, input().split()))\r\n containers = []\r\n for i in range(container_num):\r\n containers.append(list(map(int, input().split())))\r\n\r\n containers = sorted(containers, key=lambda x: x[1], reverse=True)\r\n prog = 0\r\n for container in containers:\r\n\r\n if container[0] >= size:\r\n prog += size * container[1]\r\n break\r\n\r\n else:\r\n prog += container[0] * container[1]\r\n size -= container[0]\r\n\r\n print(prog)\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "n, m = map(int, input().split())\r\narr = []\r\n\r\nfor _ in range(m):\r\n a, b = map(int, input().split())\r\n arr.append([b, a])\r\n\r\narr = sorted(arr)[::-1]\r\nans = 0\r\n\r\nfor i in arr:\r\n c = min(i[1], n) \r\n n -= c\r\n ans += c * i[0]\r\n\r\nprint(ans)", "n,m = map(int, input().split())\r\narr = []\r\nfor i in range(m):\r\n a,b = map(int, input().split())\r\n arr.append((a,b))\r\narr.sort(key=lambda x:x[1], reverse=True)\r\nrem = n\r\nres = 0\r\nfor i,j in arr:\r\n if rem<1:\r\n break\r\n if i>=rem:\r\n res+= rem*j\r\n rem -= n\r\n else:\r\n res += i*j\r\n rem -= i\r\nprint(res)\r\n", "if __name__ == \"__main__\":\r\n n, m = list(map(int,input().split()))\r\n box = [0 for _ in range(11)]\r\n num_matches = 0\r\n for _ in range(m):\r\n a,b = list(map(int,input().split()))\r\n box[b] += a\r\n for i in range(10 , 0 , -1):\r\n if box[i] != 0 :\r\n if box[i] < n:\r\n n -= box[i]\r\n num_matches += box[i]* i\r\n else:\r\n num_matches += i*n\r\n break\r\n\r\n print(num_matches) \r\n ", "import sys\ninput = lambda: sys.stdin.readline().strip()\n\na,b=map(int,input().split())\nr=[list(map(int,input().split())) for _ in range(b)]\nr.sort(key=lambda t:t[1],reverse=True)\ns=0\nif sum(t[0] for t in r)<=a:\n\tprint(sum(t[0]*t[1] for t in r))\nelse:\n\twhile a>0:\n\t\tif a>=r[0][0]:\n\t\t\ts+=r[0][0]*r[0][1]\n\t\t\ta-=r[0][0]\n\t\t\tdel r[0]\n\t\telse:\n\t\t\ts+=a*r[0][1]\n\t\t\tbreak\n\tprint(s)", "n,m=map(int,input().split())\r\nX=[]\r\nfor i in range(m):\r\n X.append(list(map(int,input().split()))[::-1])\r\nX.sort(reverse=True)\r\nBox=0\r\nfor i in X:\r\n if n==0:\r\n break\r\n if i[1]>n:\r\n Box+=i[0]*n\r\n n=0\r\n else:\r\n Box+=i[0]*i[1]\r\n n-=i[1]\r\n \r\nprint(Box)", "n, m = map(int, input().split()) \r\n\r\nmatchboxes = []\r\nfor i in range(m):\r\n # boxes and matches\r\n a, b = map(int, input().split()) \r\n\r\n #for i in range(a):\r\n # matchboxes.append((1, b))\r\n\r\n matchboxes.append((a, b))\r\n\r\nmatchboxes = sorted(matchboxes, key=lambda x: x[1], reverse=True)\r\n\r\nans = 0\r\nfor box in matchboxes:\r\n if n > box[0]:\r\n n -= box[0]\r\n ans += box[0] * box[1]\r\n else:\r\n ans += n * box[1]\r\n break\r\n\r\nprint(ans)", "n , m = map(int,input().split())\r\nlst = []\r\nfor i in range(m):\r\n lst.append(list(map(int,input().split())))\r\nlst.sort(key = lambda x: x[1])\r\nlst.reverse()\r\ncount = 0\r\nfor i in lst:\r\n if n <= i[0]:\r\n count+= (n*i[1])\r\n break\r\n else: \r\n count+= (i[0]*i[1])\r\n n -= i[0]\r\n if n == 0:\r\n break\r\n \r\nprint(count)", "n, m = map(int, input().split())\r\narr = []\r\n\r\nf = 0\r\nfor k in range(m):\r\n a, b = map(int, input().split())\r\n arr.append((b, a))\r\n\r\narr.sort()\r\n\r\nfor i in range(m-1, -1, -1):\r\n ar = arr[i]\r\n if n > ar[1]:\r\n n-= ar[1]\r\n f += ar[1] * ar[0]\r\n else:\r\n f += n * ar[0]\r\n n = 0\r\nprint(f)\r\n", "# import collections\r\nd={}\r\ntot=0\r\nn,m=map(int,input().split())\r\nfor i in range(m):\r\n a,b=map(int,input().split())\r\n if b not in list(d.keys()):\r\n d[b]=a\r\n else:\r\n d[b]+=a\r\nds=dict(sorted(d.items()).__reversed__())\r\nk=list(ds.keys())\r\ni=0\r\n# print(d[k[i]]) ``\r\n# print(n)\r\nwhile(n>0 and i<len(k)):\r\n if n>= ds[k[i]]:\r\n n-=ds[k[i]]\r\n\r\n tot+=k[i]*ds[k[i]]\r\n \r\n else:\r\n tot+=k[i]*n\r\n\r\n n=0\r\n i+=1\r\nprint(tot)", "n, m = map(int, input().split())\r\n\r\ntemp = [[' ',0]]*20\r\ntt = list(map(int, input().split()))\r\ntemp.insert(0, tt)\r\n\r\nfor _ in range(m-1):\r\n \r\n tt = list(map(int, input().split()))\r\n\r\n for i in range(1+_):\r\n if tt[1]<=temp[i][1] and tt[1]>=temp[i+1][1]:\r\n temp.insert(i+1, tt)\r\n break\r\n if tt[1]>=temp[i][1]:\r\n temp.insert(i, tt)\r\n break\r\n\r\n#print(temp)\r\n\r\ntotal = 0\r\nans = 0\r\nmis = 0\r\n\r\nfor j in range(m):\r\n total+=temp[j][0]\r\n ans+=(temp[j][1]*temp[j][0])\r\n #print(total, ans)\r\n if total>=n:\r\n mis = temp[j][1]\r\n break\r\nprint(ans-abs(n-total)*mis)", "n, m = [int(x) for x in input().split(' ')]\r\nmbs = {i: 0 for i in range(1, 11)}\r\nfor i in range(m):\r\n a, b = [int(x) for x in input().split(' ')]\r\n mbs[b] += a\r\n matches = 0\r\n matchboxes = 0\r\n i = 10\r\n while matchboxes < n and i > 0:\r\n x = min(n - matchboxes, mbs[i])\r\n matches += x * i\r\n matchboxes += x\r\n i -= 1\r\nprint(matches)", "from sys import stdin\r\nfrom bisect import bisect_left as bl\r\nfrom collections import defaultdict\r\n\r\ninput = stdin.readline\r\nread = lambda: map(int, input().strip().split())\r\n\r\nn, m = read()\r\nlst = sorted([tuple(read()) for i in range(m)], key=lambda s: s[1], reverse=True)\r\n# print(lst)\r\nans = i = 0\r\nwhile i < m and n > 0:\r\n ans += min(n, lst[i][0]) * lst[i][1]\r\n n -= min(n, lst[i][0])\r\n i += 1\r\nprint(ans)\r\n", "n, m = map(int, input().split())\r\nmatches = []\r\nfor _ in range(m):\r\n a, b = map(int, input().split())\r\n matches.append((a, b))\r\nmatches.sort(key=lambda x: x[1], reverse=True)\r\nresult = 0\r\nfor match in matches:\r\n if n >= match[0]:\r\n result += match[0] * match[1]\r\n n -= match[0]\r\n else:\r\n result += n * match[1]\r\n break\r\nprint(result)\r\n", "n,m=map(int,input().split())\r\nl=[]\r\nfor _ in range(m):\r\n arr=[int(ele) for ele in input().split()]\r\n arr.reverse()\r\n l.append(arr)\r\nl.sort()\r\nl.reverse()\r\nans,sum=0,0\r\nfor i in range(len(l)):\r\n temp=l[i][1]\r\n sum+=temp\r\n if sum>=n:\r\n temp=temp-(sum-n)\r\n ans=ans+(temp*l[i][0])\r\n if sum>=n:break\r\nprint(ans)", "# key not available \"\"\r\nn, m = [int(i) for i in input().split()]\r\narr = []\r\nfor _ in range(m):\r\n a, b = [int(i) for i in input().split()]\r\n arr.append([b,a])\r\narr.sort(reverse=True)\r\nans = 0\r\nfor i in range(m):\r\n temp = min(n, arr[i][1])\r\n ans += (temp*arr[i][0])\r\n n -= temp\r\n if n == 0:\r\n break\r\nprint(ans)\r\n", "n,m=map( int ,input().split())\r\nc=[]\r\nfor i in range(0,m):\r\n l=[int(i) for i in input().split(\" \")]\r\n c.append(l)\r\nc.sort(key=lambda x:x[1],reverse=True)\r\ny=0\r\ni=0\r\nwhile n>0 and i<m:\r\n if c[i][0] < n:\r\n n=n-c[i][0]\r\n y=y+c[i][0]*c[i][1]\r\n else :\r\n y+=n*c[i][1]\r\n n=0\r\n i+=1\r\nprint(y)\r\n" ]

[ "n, m = map(int, input().split())\r\na = [[0] * (n + 1) for _ in range(n + 1)]\r\n\r\nfor _ in range(m):\r\n u, v = map(int, input().split())\r\n a[u][v] = 1\r\n a[v][u] = 1\r\n\r\n\r\ndef bfs(x):\r\n fila = [(1, 0)]\r\n visitados = [0] * (n + 1)\r\n\r\n while fila:\r\n u, v = fila.pop(0)\r\n for i in range(1, n + 1):\r\n if not visitados[i] and a[u][i] == x:\r\n if i == n:\r\n return v + 1\r\n fila.append((i, v + 1))\r\n visitados[i] = 1\r\n\r\n return -1\r\n\r\n\r\nif a[1][n]:\r\n print(bfs(0))\r\nelse:\r\n print(bfs(1))\r\n", "n,m=map(int,input().split())\n\ngraph=[[0]*(n+1) for _ in range(n+1)]\n\nfor i in range(m):\n x,y=map(int,input().split())\n graph[x][y]=graph[y][x]=1\n \nvis=[-1]*(n+1) \nvis[1]=0\nq=[1]\n\nwhile q:\n x=q.pop(0)\n\n for y in range(1,n+1):\n\n if graph[x][y]!=graph[1][n] and vis[y]==-1:\n vis[y]=vis[x]+1\n q.append(y)\n\n \nprint(vis[-1])\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\nx = [0] * n\r\nfor i in range(n):\r\n\tx[i] = [0] * n\r\nfor i in range(m):\r\n\ta,b = map(int, input().split())\r\n\tx[a-1][b-1] = 1\r\n\tx[b-1][a-1] = 1\r\nvisited = set()\r\nvisited |= set([0])\r\nstack = []\r\nstack.append((0,0))\t\r\nwhile stack != []:\t\r\n\tcur = stack.pop(0)\r\n\t#print( \"%d %d\" % cur)\t\t\r\n\tt = 0\r\n\tfor i in range(n):\r\n\t\tif i not in visited:\r\n\t\t\tif x[cur[0]][i] == 1:\r\n\t\t\t\tstack.append(( i,cur[1]+1))\r\n\t\t\t\tvisited |= set ( [ i ] )\r\n\t\t\t\t#print( \"add %d\" % i)\t\t\r\n\t\t\t\tt += 1\r\n\tif (n-1) in visited:\r\n\t\tbreak\r\n\r\nfirst = -1\r\nfor i in range(len(stack)):\r\n\tif ( stack[i][0] == (n-1) ):\r\n\t\tfirst = stack[i][1]\r\n\r\n#print(first)\r\n\r\nvisited = set()\r\nvisited |= set([0])\r\nstack = []\r\nstack.append((0,0))\t\r\nwhile stack != []:\t\r\n\tcur = stack.pop(0)\r\n\t#print( \"%d %d\" % cur)\t\t\r\n\tt = 0\r\n\tfor i in range(n):\r\n\t\tif i not in visited:\r\n\t\t\tif x[cur[0]][i] == 0:\r\n\t\t\t\tstack.append(( i,cur[1]+1))\r\n\t\t\t\tvisited |= set ( [ i ] )\r\n\t\t\t\t#print( \"add %d\" % i)\t\t\r\n\t\t\t\tt += 1\r\n\tif (n-1) in visited:\r\n\t\tbreak\r\n\r\nsecond = -1\r\nfor i in range(len(stack)):\r\n\tif ( stack[i][0] == (n-1) ):\r\n\t\tsecond = stack[i][1]\r\n\r\n#print(second)\r\n\r\nif ( first == -1 or second == -1 ):\r\n\tprint(\"-1\")\r\nelse:\r\n\tprint ( max ( first, second) )\r\n", "import collections\r\nn,r=map(int,input().split())\r\ntrain={i:[] for i in range(1,n+1)}\r\nbus={i:[j for j in range(1,n+1) if j!=i] for i in range(1,n+1)}\r\nfor i in range(r):\r\n a,b=map(int,input().split())\r\n train[a].append(b)\r\n train[b].append(a)\r\n bus[a].remove(b)\r\n bus[b].remove(a)\r\ndef bfs(s,dic):\r\n q=collections.deque([[s,0]])\r\n vis=set([s])\r\n t=-1\r\n while q:\r\n a,b=q.popleft()\r\n if a==n:\r\n t=b\r\n break\r\n for i in dic[a]:\r\n if i not in vis:\r\n vis.add(i)\r\n q.append([i,b+1])\r\n return t\r\n\r\na=(bfs(1,train))\r\nb=(bfs(1,bus))\r\nif a<0 or b<0:\r\n print(-1)\r\nelse:\r\n print(max(a,b))", "from collections import deque\r\n\r\ndef bfs(adj, n):\r\n vis = [0] * (n + 1)\r\n q = deque()\r\n q.append(1)\r\n vis[1] = 1\r\n dis = 0\r\n while q:\r\n size = len(q)\r\n while size > 0:\r\n node = q.popleft()\r\n size -= 1\r\n if node == n:\r\n return dis\r\n for i in adj[node]:\r\n if not vis[i]:\r\n vis[i] = 1\r\n q.append(i)\r\n dis += 1\r\n return -1\r\n\r\ndef main():\r\n n, m = map(int, input().split())\r\n adj1 = [[] for _ in range(n + 1)]\r\n edge = {}\r\n flag = 0\r\n for _ in range(m):\r\n u, v = map(int, input().split())\r\n if (u == 1 and v == n) or (u == n and v == 1):\r\n flag = 1\r\n if (u, v) not in edge:\r\n edge[(u, v)] = 0\r\n if (v, u) not in edge:\r\n edge[(v, u)] = 0\r\n edge[(u, v)] += 1\r\n edge[(v, u)] += 1\r\n adj1[u].append(v)\r\n adj1[v].append(u)\r\n \r\n if not flag:\r\n print(bfs(adj1, n))\r\n else:\r\n adj2 = [[] for _ in range(n + 1)]\r\n for i in range(1, n + 1):\r\n for j in range(i + 1, n + 1):\r\n if (i, j) not in edge:\r\n adj2[i].append(j)\r\n adj2[j].append(i)\r\n \r\n print(bfs(adj2, n))\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "def BFS(G, n):\n Q = [(1, 0)]\n M = [False for _ in G]\n M[1] = True\n while Q:\n v, d = Q.pop(0)\n if v == n: return d\n for u in G[v]:\n if not M[u]:\n M[u] = True\n Q.append((u, d + 1))\n return None\n\nn, m = map(int, input().split())\nG = [[] for _ in range(n + 1)]\nfor _ in range(m):\n v, u = map(int, input().split())\n G[v].append(u)\n G[u].append(v)\nif G[1].count(n) == 1:\n Z = [_ for _ in range(1, n + 1)]\n GG = [[] for _ in G]\n v = 0\n for adj in G[1:]:\n v += 1\n for z in Z:\n if z in adj: continue\n GG[v].append(z)\n d = BFS(GG, n)\nelse: d = BFS(G, n)\nif d: print(d)\nelse: print(-1)", "from collections import defaultdict as dfdict\r\n\r\ndef bfs(G,rail_connected=False) :\r\n level=[1]\r\n visited=set([1])\r\n cnt=0\r\n while len(level)>0 :\r\n nxtlevel=[]\r\n for i in level :\r\n nxt=G[i] if not rail_connected else all_vertice-G[i]\r\n for j in nxt :\r\n if j not in visited :\r\n if j==n :\r\n cnt+=1\r\n return cnt\r\n else :\r\n nxtlevel.append(j)\r\n visited.add(j)\r\n level=nxtlevel\r\n cnt+=1\r\n return -1 \r\n\r\nn,m=[int(i) for i in input().split()]\r\nrails=dfdict(set)\r\nall_vertice=set([i+1 for i in range(n)])\r\nfor _ in range(m) :\r\n xt,yt=[int(i) for i in input().split()]\r\n rails[xt].add(yt)\r\n rails[yt].add(xt)\r\n\r\nR=False\r\nif n in rails[1] :\r\n R=True\r\nelse :\r\n R=False\r\n\r\nprint(bfs(rails,R))", "\r\n\r\ndef ss(n,train,road):\r\n \r\n t=[0]\r\n r=[0]\r\n v1=[0 for _ in range(n)]\r\n v2=[0 for _ in range(n)]\r\n v1[0]=1\r\n v2[0]=1\r\n\r\n \r\n x1=0\r\n x2=0\r\n f1=0\r\n f2=0\r\n \r\n while t:\r\n # print(t)\r\n t1=[]\r\n if n-1 in t:\r\n f1=1\r\n break \r\n for node in t:\r\n \r\n for i in range(n):\r\n if train[node][i]==1 and v1[i]==0:\r\n v1[i]=1\r\n t1.append(i)\r\n \r\n \r\n t=t1\r\n x1+=1\r\n \r\n \r\n while r:\r\n r1=[]\r\n if n-1 in r:\r\n f2=1\r\n break \r\n \r\n for node in r:\r\n for i in range(n):\r\n if road[node][i]==1 and v2[i]==0:\r\n v2[i]=1\r\n r1.append(i)\r\n \r\n r=r1 \r\n x2+=1\r\n \r\n \r\n # print(f1,f2)\r\n if not f1 or not f2:\r\n return -1\r\n return max(x1,x2)\r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n\r\n\r\nn,m=map(int, input().split())\r\ntrain=[[0 for _ in range(n)] for _ in range(n)]\r\nroad=[[0 for _ in range(n)] for _ in range(n)]\r\nfor i in range(m):\r\n a,b=map(int, input().split())\r\n train[a-1][b-1]=1\r\n train[b-1][a-1]=1\r\n\r\nfor i in range(n):\r\n for j in range(n):\r\n if i!=j and train[i][j]!=1:\r\n road[i][j]=1\r\n\r\n# print(train)\r\n# print(road)\r\n\r\nprint(ss(n, train, road))", "import sys\r\ninput=sys.stdin.readline\r\nfrom collections import defaultdict,deque\r\nn,m=map(int,input().split())\r\ng=defaultdict(list)\r\ns1=set()\r\nfor _ in range(m):\r\n x,y=map(int,input().split())\r\n g[x].append(y)\r\n g[y].append(x)\r\n s1.add((x,y))\r\ng2=defaultdict(list)\r\nfor i in range(1,n+1):\r\n for j in range(i+1,n+1):\r\n if (i,j) not in s1 and (j,i) not in s1:\r\n g2[i].append(j)\r\n g2[j].append(i)\r\ntime={}\r\ndef bfs(src):\r\n visited=set()\r\n q=deque()\r\n parent=[-1]*(n+1)\r\n q.append([src])\r\n visited.add(src)\r\n c=0\r\n time[src]=0\r\n while len(q)>0:\r\n f=q.popleft()\r\n l=[]\r\n for node in f:\r\n for nbr in g[node]:\r\n if nbr not in visited:\r\n visited.add(nbr)\r\n l.append(nbr)\r\n parent[nbr]=node\r\n time[nbr]=c+1\r\n if len(l)==0:break\r\n c+=1\r\n q.append(l)\r\n if n in visited:break\r\n if n not in visited:return -1\r\n s=set()\r\n cur=n\r\n while parent[cur]!=1:\r\n s.add(cur)\r\n cur=parent[cur]\r\n s.add(1)\r\n for x in time:\r\n if x not in s:time[x]=-1\r\n return c\r\nrail=bfs(1)\r\ndef bfs2(src):\r\n visited=set()\r\n q=deque()\r\n q.append([src])\r\n visited.add(src)\r\n c=0\r\n while len(q)>0:\r\n f=q.popleft()\r\n l=[]\r\n for node in f:\r\n for nbr in g2[node]:\r\n if nbr not in visited:\r\n if nbr in time:\r\n if time[nbr]==c+1:\r\n if nbr!=n:pass\r\n else:\r\n visited.add(nbr)\r\n l.append(nbr)\r\n else:\r\n visited.add(nbr)\r\n l.append(nbr)\r\n else:\r\n visited.add(nbr)\r\n l.append(nbr)\r\n if len(l)==0:break\r\n c+=1\r\n q.append(l)\r\n if n in visited:return c\r\n if n not in visited:return -1\r\nroad=bfs2(1)\r\nif road==-1 or rail==-1:print(-1)\r\nelse:print(max(rail,road))", "from collections import deque\n\nn, m = [int(x) for x in input().split()]\na = [set() for _ in range(n + 1)]\nfor i in range(m):\n x, y = map(int, input().split())\n a[x].add(y)\n a[y].add(x)\n\nif n not in a[1]:\n t = True\nelse:\n t = False\n\nq = deque()\nq.append(1)\nz = [-1 for _ in range(n + 1)]\nz[1] = 0\n\nwhile len(q) > 0:\n v = q.popleft()\n\n for i in range(1, n + 1):\n if t ^ (i in a[v]):\n continue\n\n if z[i] == -1:\n z[i] = z[v] + 1\n q.append(i)\n\n if i == n:\n print(z[i])\n exit()\n\nprint(-1)\n\n\t \t\t\t \t \t \t\t \t \t\t\t \t\t", "def calcula_distancia(matriz, n):\n distancias = [-1 for i in range(n)]\n distancias[0] = 0\n pilha = [0]\n\n while pilha:\n aux = pilha.pop(0)\n for i in range(n):\n if distancias[i] == -1 and matriz[i][aux] != matriz[0][n - 1]:\n distancias[i] = distancias[aux] + 1\n pilha.append(i)\n\n return distancias[n - 1]\n\n\nn, m = map(int, input().split())\nmatriz = [[0] * n for i in range(n)]\n\nfor i in range(m):\n u, v = map(int, input().split())\n matriz[u - 1][v - 1] = 1\n matriz[v - 1][u - 1] = 1\n\nprint(calcula_distancia(matriz, n))\n\n\t \t \t \t \t \t \t\t\t \t \t\t\t\t", "def bsf(graph, n):\r\n queue = [0]\r\n visited = [False] * n\r\n visited[0] = True\r\n dist = [0] * n\r\n\r\n while len(queue):\r\n current = queue.pop(0)\r\n for i in graph[current]:\r\n if not visited[i]:\r\n queue.append(i)\r\n visited[i] = True\r\n dist[i] = dist[current] + 1\r\n \r\n if (dist[n - 1] != 0):\r\n return dist[n - 1]\r\n return -1\r\n\r\nn, m = map(int, input().split())\r\ngraph = {}\r\n\r\nfor i in range(n):\r\n graph[i] = []\r\n\r\nfor i in range(m):\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\n \r\nif (n - 1 in graph[0]):\r\n for i in range(n):\r\n tmp_i = []\r\n for j in range(n):\r\n if (j not in graph[i] and j != i):\r\n tmp_i.append(j)\r\n \r\n graph[i] = tmp_i\r\n\r\nprint(bsf(graph, n))", "n, m = map(int,input().split())\r\n \r\nlista = []\r\nfor i in range(n):\r\n lista.append([0]*n)\r\n \r\nfor i in range(m):\r\n u, v = map(int,input().split())\r\n lista[u-1][v-1] = lista[v-1][u-1] = 1\r\n \r\nb = [-1] * n\r\nb[0] = 0\r\nq = [0]\r\n \r\nwhile q:\r\n aux = q.pop(0)\r\n for i in range(n):\r\n if lista[aux][i] != lista[0][n-1] and b[i] ==-1:\r\n b[i] = b[aux]+1\r\n q.append(i)\r\n \r\nprint(b[n-1])", "import sys\r\nimport math\r\nimport heapq as hp\r\n#hp.heapify hp.heappush hp.heappop\r\ninput=sys.stdin.readline\r\nm=1000000007\r\n\r\ndef minp():\r\n return map(int,input().split())\r\n\r\ndef lst():\r\n return list(map(int,input().split()))\r\n#------------------------------------#\r\nn,m=minp()\r\nL=[[0]*n for _ in range(n)]\r\nfor i in range(m):\r\n u,v=minp()\r\n L[u-1][v-1]=1\r\n L[v-1][u-1]=1\r\n#inversion\r\nif L[0][n-1]==0:\r\n queue=[]\r\n queue.append(0)\r\n queue.append('#')\r\n cost=1\r\n visited=[-1]*n\r\n visited[0]=0\r\n while(queue):\r\n vertex=queue.pop(0)\r\n if vertex==\"#\":\r\n if (not queue):\r\n break\r\n queue.append('#') \r\n cost+=1\r\n else:\r\n for i in range(n):\r\n if L[vertex][i]==1 and visited[i]==-1:\r\n queue.append(i)\r\n visited[i]=cost\r\n print(visited[n-1])\r\nelse:\r\n queue=[]\r\n queue.append(0)\r\n queue.append('#')\r\n cost=1\r\n visited=[-1]*n\r\n visited[0]=0\r\n while(queue):\r\n vertex=queue.pop(0)\r\n if vertex==\"#\":\r\n if (not queue):\r\n break\r\n queue.append('#') \r\n cost+=1\r\n else:\r\n for i in range(n):\r\n if L[vertex][i]==0 and visited[i]==-1:\r\n queue.append(i)\r\n visited[i]=cost\r\n print(visited[n-1])\r\n\r\n\r\n\r\n", "n, m = tuple(map(int, input().split()))\ng = [[n * n] * (n + 1) for i in range(n + 1)]\nfor i in range(m):\n u, v = tuple(map(int, input().split()))\n g[u][v] = g[v][u] = 1\nif g[1][n] == 1:\n for i in range(1, n + 1):\n for j in range(1, n + 1):\n g[i][j] = n * n + 1 - g[i][j]\nfor k in range(1, n + 1):\n for i in range(1, n + 1):\n for j in range(1, n + 1):\n g[i][j] = min(g[i][j], g[i][k] + g[k][j])\nprint(-1 if g[1][n] == n * n else g[1][n])\n\n \t\t\t \t\t \t\t\t \t \t \t \t\t\t", "def aux_lambda(): return map(int, input().split())\r\n\r\n\r\nn, m = aux_lambda()\r\nk = n + 1\r\n\r\nposicao = [[0] * k for i in range(k)]\r\n\r\nfor j in range(m):\r\n u, v = aux_lambda()\r\n posicao[u][v] = posicao[v][u] = 1\r\n\r\ndistancia = [-1] * k\r\ndistancia[1] = 0\r\naux = [1]\r\n\r\nwhile aux:\r\n u = aux.pop(0)\r\n\r\n for v in range(1, k):\r\n\r\n if posicao[u][v] != posicao[1][n] and distancia[v] == -1:\r\n distancia[v] = distancia[u] + 1\r\n aux.append(v)\r\n\r\nprint(distancia[n])", "import sys\r\nfrom collections import deque\r\nfrom math import inf\r\n\r\n\r\nclass FastIO:\r\n def __init__(self):\r\n return\r\n\r\n @staticmethod\r\n def read_str():\r\n return sys.stdin.readline().rstrip()\r\n\r\n @staticmethod\r\n def read_int():\r\n return int(sys.stdin.readline().rstrip())\r\n\r\n @staticmethod\r\n def read_float():\r\n return float(sys.stdin.readline().rstrip())\r\n\r\n @staticmethod\r\n def read_ints():\r\n return map(int, sys.stdin.readline().rstrip().split())\r\n\r\n @staticmethod\r\n def read_floats():\r\n return map(float, sys.stdin.readline().rstrip().split())\r\n\r\n @staticmethod\r\n def read_ints_minus_one():\r\n return map(lambda x: int(x) - 1, sys.stdin.readline().rstrip().split())\r\n\r\n @staticmethod\r\n def read_list_ints():\r\n return list(map(int, sys.stdin.readline().rstrip().split()))\r\n\r\n @staticmethod\r\n def read_list_floats():\r\n return list(map(float, sys.stdin.readline().rstrip().split()))\r\n\r\n @staticmethod\r\n def read_list_ints_minus_one():\r\n return list(map(lambda x: int(x) - 1,\r\n sys.stdin.readline().rstrip().split()))\r\n\r\n @staticmethod\r\n def read_list_strs():\r\n return sys.stdin.readline().rstrip().split()\r\n\r\n @staticmethod\r\n def read_list_str():\r\n return list(sys.stdin.readline().rstrip())\r\n\r\n @staticmethod\r\n def st(x):\r\n return print(x)\r\n\r\n @staticmethod\r\n def lst(x):\r\n return print(*x)\r\n\r\n @staticmethod\r\n def round_5(f):\r\n res = int(f)\r\n if f - res >= 0.5:\r\n res += 1\r\n return res\r\n\r\n @staticmethod\r\n def max(a, b):\r\n return a if a > b else b\r\n\r\n @staticmethod\r\n def min(a, b):\r\n return a if a < b else b\r\n\r\n @staticmethod\r\n def accumulate(nums):\r\n n = len(nums)\r\n pre = [0] * (n + 1)\r\n for i in range(n):\r\n pre[i + 1] = pre[i] + nums[i]\r\n return pre\r\n\r\n\r\nclass Solution:\r\n def __init__(self):\r\n return\r\n\r\n @staticmethod\r\n def main(ac=FastIO()):\r\n n, m = ac.read_ints()\r\n dct = [[0]*n for _ in range(n)]\r\n for _ in range(m):\r\n i, j = ac.read_ints_minus_one()\r\n dct[i][j] = dct[j][i] = 1\r\n x = dct[0][n-1]\r\n ans = 1\r\n visit = [inf]*n\r\n visit[0] = 0\r\n stack = deque([0])\r\n while stack:\r\n i = stack.popleft()\r\n for j in range(n):\r\n if dct[i][j] == 1 - x and visit[j] > visit[i]+1:\r\n stack.append(j)\r\n visit[j] = visit[i]+1\r\n ans = ac.max(ans, visit[n-1])\r\n ac.st(ans if ans < inf else -1)\r\n return\r\n\r\n\r\nSolution().main()\r\n", "f = lambda: map(int, input().split())\r\nn, m = f()\r\nw = [[] for i in range(n)]\r\nw1 = [[] for i in range(n)]\r\nl = False\r\nfor i in range(m):\r\n a, b = f()\r\n w[a - 1].append(b - 1)\r\n w[b - 1].append(a - 1)\r\n if a == 1 and b == n or a == n and b == 1:\r\n l = True\r\nif l:\r\n for i in range(n):\r\n for j in range(n):\r\n if j != i and j not in w[i]:\r\n w1[i].append(j)\r\nINF = 10 ** 9\r\ndist = [INF] * n\r\ndist[0] = 0\r\nused = [False] * n\r\nmin_dist = 0\r\nmin_vertex = 0\r\nif not l:\r\n while min_dist < INF:\r\n i = min_vertex\r\n used[i] = True\r\n for j in w[i]:\r\n if dist[i] + 1 < dist[j]:\r\n dist[j] = dist[i] + 1\r\n min_dist = INF\r\n for i in range(n):\r\n if not used[i] and dist[i] < min_dist:\r\n min_dist = dist[i]\r\n min_vertex = i\r\nelse:\r\n while min_dist < INF:\r\n i = min_vertex\r\n used[i] = True\r\n for j in w1[i]:\r\n if dist[i] + 1 < dist[j]:\r\n dist[j] = dist[i] + 1\r\n min_dist = INF\r\n for i in range(n):\r\n if not used[i] and dist[i] < min_dist:\r\n min_dist = dist[i]\r\n min_vertex = i\r\nprint(dist[-1] if dist[-1] != INF else -1)\r\n", "n, m = map(int, input().split())\r\n\r\ng = [[0] * (n + 1) for i in range(n + 1)]\r\n\r\nfor i in range(m):\r\n x, y = map(int, input().split())\r\n g[x][y] = g[y][x] = 1\r\n\r\nvis = [-1] * (n + 1)\r\nvis[1] = 0\r\nq = [1]\r\n\r\nwhile q:\r\n i = q.pop(0)\r\n \r\n for j in range(1, n + 1):\r\n if g[i][j] != g[1][n] and vis[j] == -1:\r\n vis[j] = vis[i] + 1\r\n q.append(j)\r\n\r\nprint(vis[-1])", "n, m = map(int, input().split())\r\ndist = [[1 for col in range(n + 1)] for row in range(n + 1)]\r\nfor i in range(m):\r\n a, b = map(int, input().split())\r\n dist[a][b] = 2\r\n dist[b][a] = 2\r\n \r\nx = 3 - dist[1][n]\r\nres, i = 0, 1\r\nvis = [0] * (n + 1)\r\nd = [n + 1] * (n + 1)\r\nd[1] = 0\r\n \r\nwhile i != n:\r\n vis[i] = 1\r\n for j in range(1, n + 1):\r\n if vis[j] == 0 and dist[i][j] == x and d[j] > d[i] + 1:\r\n d[j] = d[i] + 1\r\n mine = n + 1\r\n for j in range(1, n + 1):\r\n if vis[j] == 0 and d[j] < mine:\r\n mine = d[j]\r\n i = j\r\n if mine == n + 1:\r\n res = -1\r\n break\r\n if i == n:\r\n res = d[n]\r\n break\r\nprint(res)", "n, m = map(int, input().split())\r\n\r\nMX = 402\r\nadj = []\r\nmark = [0] * MX\r\ninverted_adj = []\r\ninverted_mark = [0] * MX\r\ndepth = {}\r\ninverted_depth = {}\r\nfor i in range(n+1):\r\n adj.append([])\r\n inverted_adj.append([])\r\n\r\nfor i in range(1, n+1):\r\n temp = [j for j in range(1, n+1)]\r\n temp.remove(i)\r\n inverted_adj[i] = temp\r\n\r\nfor i in range(m):\r\n u, v = map(int, input().split())\r\n adj[u].append(v)\r\n adj[v].append(u)\r\n inverted_adj[u].remove(v)\r\n inverted_adj[v].remove(u)\r\n\r\n\r\ndef BFS(u, target):\r\n a = [u]\r\n mark[u] = 1\r\n depth[u] = 0\r\n while len(a) > 0:\r\n v = a.pop(0)\r\n if v == target:\r\n return 1\r\n for i in adj[v]:\r\n if mark[i] == 0:\r\n depth[i] = depth[v] + 1\r\n a.append(i)\r\n mark[i] = 1\r\n return 0\r\n\r\n\r\ndef inverted_BFS(u, target):\r\n a = [u]\r\n inverted_mark[u] = 1\r\n inverted_depth[u] = 0\r\n while len(a) > 0:\r\n v = a.pop(0)\r\n if v == target:\r\n return 1\r\n for i in inverted_adj[v]:\r\n if inverted_mark[i] == 0:\r\n inverted_depth[i] = inverted_depth[v] + 1\r\n a.append(i)\r\n inverted_mark[i] = 1\r\n return 0\r\n\r\n\r\nBFS(1, n)\r\ninverted_BFS(1, n)\r\ntry:\r\n print(max(depth[n], inverted_depth[n]))\r\nexcept KeyError:\r\n print(-1)\r\n\r\n", "cidade_x, cidade_y = map(int, input().split())\r\n \r\ncruzamento = [0] * (cidade_x + 1)\r\n\r\nfor l in range(cidade_x + 1):\r\n cruzamento[l] = [1] * (cidade_x + 1)\r\n \r\nfor i in range(cidade_y):\r\n a, b = map(int, input().split())\r\n cruzamento[a][b] = cruzamento[b][a] = 2\r\n \r\nx, veiculo, indice = 3 - cruzamento[1][cidade_x], [0] * (cidade_x + 1), 1\r\nd = [cidade_x + 1] * (cidade_x + 1)\r\ntempo_ultimo = d[1] = 0\r\n \r\nwhile indice != cidade_x:\r\n veiculo[indice] = 1\r\n for j in range(1, cidade_x + 1):\r\n if veiculo[j] == 0 and cruzamento[indice][j] == x and d[j] > d[indice] + 1:\r\n d[j] = d[indice] + 1\r\n menor = cidade_x + 1\r\n \r\n for j in range(1, cidade_x + 1):\r\n if veiculo[j] == 0 and d[j] < menor:\r\n menor = d[j]\r\n indice = j\r\n \r\n if menor == cidade_x + 1:\r\n tempo_ultimo = -1\r\n break\r\n \r\n elif indice == cidade_x:\r\n tempo_ultimo = d[cidade_x]\r\n break\r\n \r\nprint(tempo_ultimo)", "def bbfs(n,edges):\r\n\tvisnot=set(range(1,n+1))\r\n\tdis=[float('inf') for i in range(n+1)]\r\n\tdis[1]=0\r\n\tq=[]\r\n\tq.append(1)\r\n\twhile visnot!=set() and q!=[]:\r\n\t\tcurr=q[0]\r\n\t\tq.pop(0)\r\n\t\tvisnot.remove(curr)\r\n\t\tactedges=[i for i in visnot if i not in edges[curr]]\r\n\t\tfor x in actedges:\r\n\t\t\tif dis[x]>dis[curr]+1:\r\n\t\t\t\tdis[x]=dis[curr]+1\r\n\t\t\t\tq.append(x)\r\n\treturn dis[n]\r\ndef tbfs(n,edges):\r\n\tvisnot=set(range(1,n+1))\r\n\tdis=[float('inf') for i in range(n+1)]\r\n\tdis[1]=0\r\n\tq=[]\r\n\tq.append(1)\r\n\twhile visnot!=set() and q!=[]:\r\n\t\tcurr=q[0]\r\n\t\tq.pop(0)\r\n\t\tvisnot.remove(curr)\r\n\t\tactedges=[i for i in visnot if i in edges[curr]]\r\n\t\tfor x in actedges:\r\n\t\t\tif dis[x]>dis[curr]+1:\r\n\t\t\t\tdis[x]=dis[curr]+1\r\n\t\t\t\tq.append(x)\r\n\treturn dis[n]\r\nn,m=map(int,input().split())\r\nedges={}\r\nfor i in range(1,n+1):\r\n\tedges[i]=[]\r\nfor i in range(m):\r\n\tx,y=map(int,input().split())\r\n\tedges[x].append(y)\r\n\tedges[y].append(x)\r\nbt=bbfs(n,edges)\r\ntt=tbfs(n,edges)\r\na=max(bt,tt)\r\nif a==float('inf'):\r\n print(-1)\r\nelse:\r\n print(a)", "# @author Nayara Souza\n# UFCG - Universidade Federal de Campina Grande\n# AA - Basico\n\nn, m = list(map(int,input().split()))\n\nl =[[0]*n for i in range(n)]\n\nfor i in range(m):\n x, y = list(map(int,input().split()))\n l[x-1][y-1] = 1\n l[y-1][x-1] = 1;\n\np = [-1]*n\np[0] = 0\nq = [0]\n\nwhile q:\n i = q.pop(0)\n \n for j in range(n):\n if (l[i][j] != l[0][n-1]) and (p[j] == -1):\n p[j] = p[i]+1\n q.append(j)\nprint(p[n-1])\n \t\t \t \t\t \t \t \t\t\t\t\t \t", "import sys\r\nfrom bisect import bisect_left,bisect_right\r\nfrom collections import defaultdict as dd\r\nfrom collections import deque\r\nfrom heapq import heappop,heappush,heapify,merge\r\nfrom itertools import permutations, accumulate, product\r\nfrom math import lcm,gcd,sqrt,ceil,comb\r\ntoBin=lambda x:bin(x).replace(\"0b\",\"\")\r\ninf=float(\"inf\");DIRS=[[1,0],[-1,0],[0,1],[0,-1]];CHARS=\"abcdefghijklmnopqrstuvwxyz\"\r\nMOD=10**9+7;N=300010;fac=[1]*N;invfac=[1]*N #Fill out N to calculate combinations\r\nfor i in range(2,N):fac[i]=fac[i-1]*i%MOD\r\ninvfac[N-1]=pow(fac[N-1],MOD-2,MOD)\r\nfor i in range(N-1)[::-1]:invfac[i]=invfac[i+1]*(i+1)%MOD\r\ndef c(i,j):return 0 if i<j else fac[i]*invfac[j]*invfac[i-j]\r\ninput=sys.stdin.readline\r\n\r\nfrom types import GeneratorType\r\ndef cache(f,queue=[]):\r\n def wrappedfunc(*args,**kwargs):\r\n if queue:return f(*args, **kwargs)\r\n else:\r\n to = f(*args,**kwargs)\r\n while True:\r\n if isinstance(to,GeneratorType):queue.append(to);to = next(to)\r\n else:\r\n queue.pop()\r\n if not queue:break\r\n to=queue[-1].send(to)\r\n return to\r\n return wrappedfunc\r\n\r\ndef query(x,y):\r\n print(\"?\",x,y,flush=True)\r\n return int(input())\r\n\r\ndef solve():\r\n n,m=map(int,input().split());G={u:[0]*n for u in range(n)};A=[inf]*n;B=[inf]*n;res=0\r\n for _ in range(m):\r\n u,v=map(int,input().split());u-=1;v-=1\r\n G[u][v]=1;G[v][u]=1\r\n A[0]=0;B[0]=0\r\n h=[(0,0,\"T\"),(0,0,\"B\")]#dist,node,type\r\n while h:\r\n d,node,t=heappop(h)\r\n if (t==\"T\" and A[node]<d) or (t==\"B\" and B[node]<d):continue\r\n neighs=G[node]\r\n for neigh,road in enumerate(neighs):\r\n if t==\"T\" and road==1:\r\n if d+1<A[neigh]:\r\n heappush(h,(d+1,neigh,t));A[neigh]=d+1\r\n if t==\"B\" and road==0:\r\n if d+1<B[neigh]:\r\n heappush(h,(d+1,neigh,t));B[neigh]=d+1\r\n res=max(A[-1],B[-1])\r\n print(res if res!=inf else -1)\r\n\r\nif __name__==\"__main__\":\r\n solve()\r\n", "from queue import Queue\r\n\r\nn,m=map(int,input().split())\r\ng=[[]for i in range(n)]\r\ng1=[[]for i in range(n)]\r\nfor i in range(m):\r\n a,b=map(int,input().split())\r\n g[a-1].append(b-1)\r\n g[b-1].append(a-1)\r\nfor i in range(n-1):\r\n for j in range(i+1,n):\r\n if j not in g[i]:\r\n g1[i].append(j)\r\n g1[j].append(i)\r\nun=float('inf')\r\ndef bfs(g):\r\n q=Queue(maxsize = n)\r\n q.put(0)\r\n dist=[0]+[un]*(n-1)\r\n while not q.empty():\r\n curr=q.queue[0]\r\n q.get()\r\n for j in g[curr]:\r\n if dist[j]==un:\r\n dist[j]=dist[curr]+1\r\n q.put(j)\r\n return dist[n-1]\r\ndist=(bfs(g),bfs(g1))\r\nif un in dist:\r\n print(-1)\r\nelse:\r\n print(max(dist))\r\n \r\n ", "BUS_STEP = 0\nRAIL_STEP = 1\nINFINITY = 40000\n\n\ndef is_allowed(forbidden_path, town_index, step_index):\n if len(forbidden_path) < step_index + 1:\n return True\n if forbidden_path[step_index] != town_index:\n return True\n else:\n return False\n\n\ndef calculate_path(trace_back, start, end):\n if trace_back[end] is None:\n return None\n\n path = []\n current_step = end\n while True:\n path.append(current_step)\n current_step = trace_back[current_step]\n if current_step == start:\n path.append(current_step)\n break\n\n return path[::-1]\n\n\ndef shortest_path(matrix, foot_step, start, end, n, forbidden):\n town_costs = [INFINITY] * n\n trace_back = [None] * n\n town_costs[start] = 0\n\n next_queue = [start]\n while len(next_queue) != 0:\n path_queue = next_queue\n next_queue = []\n for u in path_queue:\n for v in range(n):\n if v == u:\n continue\n\n if matrix[u][v] == foot_step:\n\n if is_allowed(forbidden_path=forbidden, town_index=v, step_index=town_costs[u] + 1):\n if town_costs[v] > town_costs[u] + 1:\n town_costs[v] = town_costs[u] + 1\n trace_back[v] = u\n\n next_queue.append(v)\n\n if v == end:\n break\n\n return calculate_path(trace_back=trace_back, start=start, end=end)\n\n\ndef get_max_path_length(matrix, first_step, second_step, start, end, n):\n first_path = shortest_path(matrix, first_step, start, end, n, forbidden=[])\n if first_path is None:\n return INFINITY\n second_path = shortest_path(matrix, second_step, start, end, n, forbidden=first_path)\n if second_path is None:\n return INFINITY\n return max(len(first_path), len(second_path))\n\n\ndef main():\n n, m = [int(t) for t in input().split()]\n\n matrix = []\n for _ in range(n):\n matrix.append([BUS_STEP] * n)\n\n for _ in range(m):\n u, v = [int(t) - 1 for t in input().split()]\n matrix[u][v] = matrix[v][u] = RAIL_STEP\n\n bus_first = get_max_path_length(matrix, first_step=BUS_STEP, second_step=RAIL_STEP, start=0, end=n - 1, n=n)\n rail_first = get_max_path_length(matrix, first_step=RAIL_STEP, second_step=BUS_STEP, start=0, end=n - 1, n=n)\n\n optimal_path_length = min(bus_first, rail_first)\n\n if optimal_path_length >= INFINITY:\n print(-1)\n else:\n print(optimal_path_length - 1)\n\n\nif __name__ == '__main__':\n main()\n", "import sys, threading\r\ninput = sys.stdin.readline\r\n \r\ndef solve():\r\n n, m = map(int, input().split())\r\n \r\n e1 = [[] for i in range(n+1)]\r\n b = [[False] * (n+1) for i in range(n+1)]\r\n for i in range(m):\r\n u, v = list(map(int, input().split()))\r\n u, v = max(u, v), min(u, v)\r\n e1[u].append(v)\r\n e1[v].append(u)\r\n b[u][v] = True\r\n \r\n e2 = [[] for i in range(n+1)]\r\n for i in range(1, n+1):\r\n for j in range(1, i):\r\n if b[i][j] == False:\r\n e2[i].append(j)\r\n e2[j].append(i)\r\n \r\n def bfs(s, e):\r\n from collections import deque\r\n q = deque()\r\n vis = [False] * (n+1)\r\n q.append((s, 0))\r\n vis[s] = 1\r\n while q:\r\n r, d = q.popleft()\r\n if r == n:\r\n return d\r\n d += 1\r\n \r\n for i in e[r]:\r\n if not vis[i]:\r\n vis[i] = 1\r\n q.append((i, d))\r\n return -1\r\n \r\n \r\n x = bfs(1, e1)\r\n y = bfs(1, e2)\r\n if x == -1 or y == -1:\r\n print(-1)\r\n return\r\n print(max(x, y))\r\n \r\nsolve()", "n, m = map(int, input().split())\na = [[] for i in range(n)]\nr = False\nfor i in range(m):\n\tx, y = map(int, input().split())\n\tif (x, y) == (1, n) or (x, y) == (n, 1):\n\t\tr = True\n\ta[x-1].append(y-1)\n\ta[y-1].append(x-1)\nif r:\n\tfor i in range(n):\n\t\ts = set(a[i])\n\t\ta[i] = [j for j in range(n) if i != j and not j in s]\nq = [(0, 0)]\nv = set([0])\nl = 0\nwhile l < len(q):\n\tx, d = q[l]\n\tl += 1\n\tfor y in a[x]:\n\t\tif not y in v:\n\t\t\tif y == n-1:\n\t\t\t\tprint(d+1)\n\t\t\t\tquit()\n\t\t\tq.append((y, d+1))\n\t\t\tv.add(y)\nprint(-1)\n", "n, m = map(int, input(). split())\r\ntrain = set()\r\nfrom collections import defaultdict\r\ntracks = defaultdict(list)\r\nroads = defaultdict(list)\r\nfor i in range(m):\r\n u, v = map(int, input(). split())\r\n tracks[u].append(v) ; tracks[v].append(u)\r\n train.add((u, v))\r\nfor i in range(1, n + 1):\r\n for j in range(i + 1, n + 1):\r\n if (i, j) not in train and (j, i) not in train:\r\n roads[i].append(j) ; roads[j].append(i)\r\nimport queue\r\nq = queue.Queue()\r\nq.put(1) ; vis = [False for i in range(n + 1)] ; vis[1] = True ; time = defaultdict(int)\r\nif (1, n) in train or (n, 1) in train:\r\n # find for roads\r\n while not q.empty():\r\n cur = q.get()\r\n for neigh in roads[cur]:\r\n if not vis[neigh] :\r\n time[neigh] = time[cur] + 1\r\n vis[neigh] = True\r\n q.put(neigh)\r\n if vis[n] == False: print(-1) ; exit()\r\n print(time[n])\r\nelse:\r\n #find for tracks\r\n while not q.empty():\r\n cur = q.get()\r\n for neigh in tracks[cur]:\r\n if not vis[neigh] :\r\n time[neigh] = time[cur] + 1\r\n vis[neigh] = True\r\n q.put(neigh)\r\n if vis[n] == False: print(-1) ; exit()\r\n print(time[n])", "from queue import Queue\r\n \r\nn, m = map(int, input().split())\r\n \r\nmaxn = 407\r\n \r\nedges = [[False for j in range(maxn)] for i in range(maxn)]\r\n \r\nfor i in range(m):\r\n u, v = map(int, input().split())\r\n edges[u][v] = True\r\n edges[v][u] = True\r\n \r\nif edges[1][n]:\r\n for i in range(1,n+1):\r\n for j in range(1, n+1):\r\n edges[i][j] ^= 1\r\n \r\nqueue = Queue(0)\r\ndist = [-1] * maxn\r\ndist[1] = 0\r\nqueue.put(1)\r\n \r\nwhile not queue.empty():\r\n u = queue.get()\r\n \r\n for i in range(1,n+1):\r\n if edges[u][i] and dist[i] == -1:\r\n dist[i] = dist[u] + 1\r\n queue.put(i)\r\n \r\nprint(dist[n])", "import queue\r\n\r\n\r\nn, m = [int(x) for x in input().split()]\r\nladja = [set() for _ in range(n+1)]\r\nfor i in range(1, n+1):\r\n for k in range(1, n+1):\r\n if i != k:\r\n ladja[i].add(k)\r\n\r\n\r\nladjb = [set() for _ in range(n+1)]\r\n\r\nfor _ in range(m):\r\n q, w = [int(x) for x in input().split()]\r\n ladjb[q].add(w)\r\n ladjb[w].add(q)\r\n ladja[q].remove(w)\r\n ladja[w].remove(q)\r\n\r\ndef bfs(ladj):\r\n dist = [-1 for _ in range(n+1)]\r\n fila = queue.Queue()\r\n fila.put(1)\r\n dist[1] = 0\r\n while not fila.empty():\r\n topo = fila.get()\r\n for viz in ladj[topo]:\r\n if dist[viz] == -1:\r\n dist[viz] = dist[topo]+1\r\n fila.put(viz)\r\n return dist[n]\r\n\r\ndista = bfs(ladja)\r\ndistb = bfs(ladjb)\r\nif min(dista, distb) == -1:\r\n print(-1)\r\nelse:\r\n print(max(dista, distb))\r\n", "from collections import deque\r\n\r\nt, r = [int(i) for i in input().split()]\r\nrails = set()\r\n\r\nfor _ in range(r):\r\n rails.add(tuple(int(i) for i in input().split()))\r\n \r\nroad = [set() for _ in range(t + 1)]\r\nrail = [set() for _ in range(t + 1)]\r\n\r\nfor n1 in range(1, t + 1):\r\n for n2 in range(n1 + 1, t + 1):\r\n if (n1, n2) in rails or (n2, n1) in rails:\r\n rail[n1].add(n2)\r\n rail[n2].add(n1)\r\n else:\r\n road[n1].add(n2)\r\n road[n2].add(n1)\r\n\r\ndef trainTime():\r\n q = deque([(1, 0)])\r\n seen = {1}\r\n \r\n while q:\r\n node, time = q.popleft()\r\n \r\n if node == t:\r\n return time\r\n \r\n for ngh in rail[node]:\r\n if ngh not in seen:\r\n seen.add(ngh)\r\n q.append((ngh, time + 1))\r\n \r\n return float('inf')\r\n\r\ndef busTime():\r\n q = deque([(1, 0)])\r\n seen = {1}\r\n \r\n while q:\r\n node, time = q.popleft()\r\n \r\n if node == t:\r\n return time\r\n \r\n for ngh in road[node]:\r\n if ngh not in seen:\r\n seen.add(ngh)\r\n q.append((ngh, time + 1))\r\n \r\n return float('inf')\r\n\r\nbus = busTime()\r\ntrain = trainTime()\r\nans = max(bus, train)\r\nprint(ans if ans != float('inf') else -1)\r\n", "from collections import defaultdict, deque\nfrom functools import lru_cache\nfrom heapq import heappush, heappop\n\n #int(input())\n #list(map(int, input().split()))\n #map(int, input().split())\n #n,m = map(int, input().split())\n #graph = defaultdict(list)\n\n #a,b = map(int, input().split())\n #graph[a].append(b)\n #graph[b].append(a)\ndef solution():\n n,m = map(int, input().split())\n graph = defaultdict(set)\n for _ in range(m):\n a,b = map(int, input().split())\n graph[a].add(b)\n graph[b].add(a)\n \n def bfs(train,visited=set([1])):\n que = deque([1])\n distance = 0\n while que:\n for _ in range(len(que)):\n cur = que.popleft()\n if cur == n:\n return distance\n nbrs = graph[cur] if train else set(range(1,n+1)) - graph[cur]\n for nbr in nbrs:\n if nbr in visited:\n continue\n que.append(nbr)\n visited.add(nbr)\n distance += 1\n return -1 \n if n in graph[1]:\n print(bfs(False)) # raod \n return\n print(bfs(True)) # train\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", "__author__ = 'Utena'\r\nfrom collections import defaultdict\r\nfrom heapq import *\r\nM=99999999\r\ndef dijkstra_raw(edges, from_node, to_node):\r\n g = defaultdict(list)\r\n for l,r,c in edges:\r\n g[l].append((c,r))\r\n q, seen = [(0,from_node,())], set()\r\n while q:\r\n (cost,v1,path) = heappop(q)\r\n if v1 not in seen:\r\n seen.add(v1)\r\n path = (v1, path)\r\n if v1 == to_node:\r\n return cost,path\r\n for c, v2 in g.get(v1, ()):\r\n if v2 not in seen:\r\n heappush(q, (cost+c, v2, path))\r\n return float(\"inf\"),[]\r\n\r\ndef dijkstra(edges, from_node, to_node):\r\n len_shortest_path = -1\r\n ret_path=[]\r\n length,path_queue = dijkstra_raw(edges, from_node, to_node)\r\n if len(path_queue)>0:\r\n len_shortest_path = length ## 1. Get the length firstly;\r\n ## 2. Decompose the path_queue, to get the passing nodes in the shortest path.\r\n left = path_queue[0]\r\n ret_path.append(left) ## 2.1 Record the destination node firstly;\r\n right = path_queue[1]\r\n while len(right)>0:\r\n left = right[0]\r\n ret_path.append(left) ## 2.2 Record other nodes, till the source-node.\r\n right = right[1]\r\n ret_path.reverse() ## 3. Reverse the list finally, to make it be normal sequence.\r\n return len_shortest_path,ret_path\r\nn,m=map(int,input().split())\r\nconn=[set()for i in range(n+2)]\r\nrail=[]\r\nroad=[]\r\nfor i in range(m):\r\n a,b=map(int,input().split())\r\n conn[a].add(b)\r\n conn[b].add(a)\r\nfor i in range(1,n+1):\r\n for j in range(1,n+1):\r\n if j in conn[i]:\r\n rail.append((i,j,1))\r\n else:road.append((i,j,1))\r\na=dijkstra(rail,1,n)[0]\r\nb=dijkstra(road,1,n)[0]\r\nif a*b<0:print(-1)\r\nelse:print(max(a,b))", "def min_distance(matriz_adj, num_vertices):\n distance = [-1 for i in range(num_vertices)]\n distance[0] = 0\n queue = [0]\n\n while queue:\n vertice_atual = queue.pop(0)\n\n for i in range(num_vertices):\n\n if distance[i] == -1 and matriz_adj[i][vertice_atual] != matriz_adj[0][num_vertices - 1]:\n distance[i] = distance[vertice_atual] + 1\n queue.append(i)\n\n return distance[num_vertices - 1]\n\n\nnum_edges, num_aresta = map(int, input().split())\nmatriz_adj = [[0] * num_edges for i in range(num_edges)]\n\nfor i in range(num_aresta):\n edge1, edge2 = map(int, input().split())\n\n matriz_adj[edge1 - 1][edge2 - 1] = 1\n\n matriz_adj[edge2 - 1][edge1 - 1] = 1\n\nprint(min_distance(matriz_adj, num_edges))\n \t \t\t\t \t\t\t \t \t\t \t\t \t \t \t\t", "n, m = map(int, input().split())\r\ns = [[0] * n for i in range(n)]\r\nfor i in range(m):\r\n a, b = map(int, input().split())\r\n s[a - 1][b - 1] = 1\r\n s[b - 1][a - 1] = 1\r\nk = 0\r\na = [0]\r\nvzyali = [False] * n\r\nvzyali[0] = True\r\nans1 = 0\r\nprev = [0] * n\r\nwhile len(a) > k and ans1 == 0:\r\n for i in range(n):\r\n if s[a[k]][i] == 1 and not vzyali[i]:\r\n a.append(i)\r\n prev[i] = prev[a[k]] + 1\r\n vzyali[i] = True\r\n if i == n - 1:\r\n ans1 = prev[i]\r\n break\r\n k += 1\r\nvzyali = [False] * n\r\nvzyali[0] = True\r\nans2 = 0\r\nk = 0\r\na = [0]\r\nprev = [0] * n\r\nwhile len(a) > k and ans2 == 0:\r\n for i in range(n):\r\n if s[a[k]][i] == 0 and not vzyali[i]:\r\n a.append(i)\r\n prev[i] = prev[a[k]] + 1\r\n vzyali[i] = True\r\n if i == n - 1:\r\n ans2 = prev[i] \r\n break\r\n k += 1\r\nif ans1 > 0 and ans2 > 0:\r\n print(max(ans1, ans2))\r\nelse:\r\n print(-1)", "n, m = map(int, input().split())\r\np = []\r\nfor i in range(n):\r\n p.append([])\r\nfor i in range(m):\r\n a, b = map(int, input().split())\r\n p[a - 1].append(b - 1)\r\n p[b - 1].append(a - 1)\r\npos = [-1] * n\r\nk = [0]\r\npos[0] = 0\r\nans = -1\r\nif (n - 1) in p[0]:\r\n pos = [-1] * n\r\n k = [0]\r\n pos[0] = 0\r\n ans = -1\r\n while len(k) != 0:\r\n q = k.pop(0)\r\n if (n - 1) not in p[q]:\r\n ans = pos[q] + 1\r\n break\r\n else:\r\n for i in range(n):\r\n if i not in p[q] and pos[i] == -1:\r\n k.append(i)\r\n pos[i] = pos[q] + 1\r\nelse:\r\n while len(k) != 0:\r\n q = k.pop(0)\r\n if (n - 1) in p[q]:\r\n ans = pos[q] + 1\r\n break\r\n else:\r\n for i in range(len(p[q])):\r\n if pos[p[q][i]] == -1:\r\n k.append(p[q][i])\r\n pos[p[q][i]] = pos[q] + 1\r\nprint(ans)\r\n \r\n\r\n\r\n \r\n", "n,m=map(int,input().split())\r\nL=[[] for i in range(n+1)]\r\nfor i in range(m) :\r\n a,b=map(int,input().split())\r\n L[a].append(b)\r\n L[b].append(a)\r\nif n not in L[1] :\r\n l=[1]\r\n D=[-1 for i in range(n+1)]\r\n D[1]=0\r\n while len(l)>=1 :\r\n t=l[0]\r\n del(l[0])\r\n for x in L[t] :\r\n if D[x]==-1 or D[x]>D[t]+1 :\r\n l.append(x)\r\n D[x]=D[t]+1\r\n print(D[n])\r\nelse :\r\n M=[[] for i in range(n+1)]\r\n for i in range(1,n+1) :\r\n L[i].append(0)\r\n L[i].append(n+1)\r\n T=sorted(L[i])\r\n for j in range(len(T)-1) :\r\n for v in range(T[j]+1,T[j+1]) :\r\n if v!=i :\r\n M[i].append(v)\r\n \r\n \r\n l=[1]\r\n D=[-1 for i in range(n+1)]\r\n D[1]=0\r\n while len(l)>=1 :\r\n t=l[0]\r\n del(l[0])\r\n for x in M[t] :\r\n if D[x]==-1 or D[x]>D[t]+1 :\r\n l.append(x)\r\n D[x]=D[t]+1\r\n print(D[n])\r\n \r\n \r\n \r\n", "from sys import stdin\r\n\r\ninput = stdin.readline\r\nn,m = map(int,input().split())\r\ng = [[0] * n for i in range(n)]\r\nfor i in range(m):\r\n u, v = map(int, input().split())\r\n g[u-1][v-1] = 1\r\n g[v-1][u-1] = 1\r\n\r\nq = [0]\r\nr = 0\r\nu = [-1] * n\r\nu[0] = 0\r\n\r\nwhile r < len(q):\r\n v = q[r]\r\n r += 1\r\n for i in range(n):\r\n if u[i] == -1 and g[v][i] != g[0][n-1]:\r\n u[i] = u[v]+1\r\n q.append(i)\r\n\r\nprint(u[n-1])", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Fri Jun 19 09:42:19 2020\r\n\r\n@author: Harshal\r\n\"\"\"\r\n\r\nn,m=map(int,input().split())\r\ngraph=[[0]*(n+1) for _ in range(n+1)]\r\nfor i in range(m):\r\n u,v=map(int,input().split())\r\n graph[u][v]=graph[v][u]=1\r\n\r\nvis=[-1]*(n+1) \r\nvis[1]=0\r\nq=[1]\r\nwhile q:\r\n u=q.pop(0)\r\n for v in range(1,n+1):\r\n if graph[u][v]!=graph[1][n] and vis[v]==-1:\r\n vis[v]=vis[u]+1\r\n q.append(v)\r\nprint(vis[-1])\r\n\r\n", "from collections import defaultdict\r\n\r\nn,m = list(map(int,input().split()))\r\ntemp = set()\r\nfor i in range(n):\r\n temp.add(i)\r\ngraph = defaultdict(list)\r\nfor i in range(m):\r\n u,v = list(map(int,input().split()))\r\n u-=1\r\n v-=1\r\n graph[u].append(v)\r\n graph[v].append(u)\r\nroad = defaultdict(list)\r\n\r\nfor i in range(n):\r\n arr = set(graph[i])\r\n arr = temp.difference(arr)\r\n arr.remove(i)\r\n road[i] = list(arr)\r\n\r\nq = [[0,0]]\r\nans = -1\r\nvisited = [False for i in range(n)]\r\nvisited[0] = True\r\nwhile q!=[]:\r\n node,dist = q[0][0],q[0][1]\r\n q.pop(0)\r\n if node==n-1:\r\n ans = dist\r\n break\r\n for v in graph[node]:\r\n if visited[v]==False:\r\n visited[v]=True\r\n q.append([v,dist+1])\r\ntemp = -1\r\nq = [[0,0]]\r\nvisited = [False for i in range(n)]\r\nvisited[0] = True\r\nwhile q!=[]:\r\n node,dist = q[0][0],q[0][1]\r\n q.pop(0)\r\n if node==n-1:\r\n temp = dist\r\n break\r\n for v in road[node]:\r\n if visited[v]==False:\r\n visited[v]=True\r\n q.append([v,dist+1])\r\nif ans==-1 or temp==-1:\r\n print(-1)\r\nelse:\r\n print(max(1,ans,temp))\r\n", "from _collections import deque\r\n\r\n\r\nn, m = map(int, input().split())\r\ngr = [[] for _ in range(n)]\r\nst = set()\r\nmt = [[0] * n for _ in range(n)]\r\nfor i in range(m):\r\n u, v = map(int, input().split())\r\n u -= 1\r\n v -= 1\r\n mt[u][v] = 1\r\n mt[v][u] = 1\r\ntmp = 1\r\nif mt[0][-1]:\r\n tmp = 0\r\nfor i in range(n):\r\n for j in range(n):\r\n if mt[i][j] == tmp:\r\n gr[i].append(j)\r\ndepth = [-1] * n\r\nq = deque()\r\ndepth[0] = 0\r\nq.append(0)\r\nwhile q:\r\n v = q.popleft()\r\n for u in gr[v]:\r\n if depth[u] == -1:\r\n depth[u] = depth[v] + 1\r\n q.append(u)\r\nif depth[-1] == -1:\r\n print(-1)\r\nelse:\r\n print(depth[-1])\r\n", "n, m = map(int, input().split())\n \ndist = [0] * (n + 1)\nfor row in range(n + 1):\n dist[row] = [1] * (n + 1)\n \nfor i in range(m):\n a, b = map(int, input().split())\n dist[a][b] = dist[b][a] = 2\n \nx, v, i = 3 - dist[1][n], [0] * (n + 1), 1\nd = [n + 1] * (n + 1)\nres = d[1] = 0\n \nwhile i != n:\n v[i] = 1\n for j in range(1, n + 1):\n if v[j] == 0 and dist[i][j] == x and d[j] > d[i] + 1:\n d[j] = d[i] + 1\n meu = n + 1\n \n for j in range(1, n + 1):\n if v[j] == 0 and d[j] < meu:\n meu = d[j]\n i = j\n \n if meu == n + 1:\n res = -1\n break\n \n elif i == n:\n res = d[n]\n break\n \nprint(res)\n \t \t\t\t \t \t\t\t \t \t\t \t \t\t\t", "(n, m) = map(int, input().split())\r\nd = [[0 for i in range(n)] for i in range(n)]\r\nw = [[10*n for i in range(n)] for i in range(n)]\r\nfor i in range(m):\r\n (a,b) = map(int,input().split())\r\n a -= 1\r\n b -= 1\r\n d[a][b] = 1\r\n d[b][a] = 1\r\n\r\nif d[0][n-1] == 1:\r\n for i in range(n):\r\n for j in range(n):\r\n d[i][j] = (d[i][j] + 1) % 2\r\nw[0][0] = 0\r\ng = 1\r\n\r\nsosed = set()\r\nsosed.add(0)\r\nwhile len(sosed) > 0:\r\n sosed2 = set()\r\n for j in sosed:\r\n for i in range(n):\r\n if d[j][i] == 1:\r\n if w[j][i] > g:\r\n w[j][i] = g\r\n w[i][j] = g\r\n sosed2.add(i)\r\n sosed = sosed2.copy()\r\n g += 1\r\nans = min(w[n-1])\r\nif ans >=2*n:\r\n print(-1)\r\nelse:\r\n print(ans)\r\n", "n, m = map(int,input().split())\r\n\r\nl = []\r\nfor i in range(n):\r\n l.append([0]*n)\r\n\r\nfor i in range(m):\r\n u, v = map(int,input().split())\r\n l[u-1][v-1] = l[v-1][u-1] = 1\r\n\r\nb = [-1]*n\r\nb[0] = 0\r\nq = [0]\r\n\r\nwhile q:\r\n aux = q.pop(0)\r\n for i in range(n):\r\n if l[aux][i] != l[0][n-1] and b[i] ==-1:\r\n b[i] = b[aux]+1\r\n q.append(i)\r\n\r\nprint(b[n-1])", "ex, ey = map(int, input().split())\n\nc = [0] * (ex + 1)\n\nfor l in range(ex + 1):\n c[l] = [1] * (ex + 1)\n\nfor i in range(ey):\n a, b = map(int, input().split())\n c[a][b] = c[b][a] = 2\n\n\nx, v, i = 3 - c[1][ex], [0] * (ex + 1), 1\nd = [ex + 1] * (ex + 1)\ntime = d[1] = 0\n \nwhile i != ex:\n\n v[i] = 1\n\n for j in range(1, ex + 1):\n if v[j] == 0 and c[i][j] == x and d[j] > d[i] + 1:\n d[j] = d[i] + 1\n\n m = ex + 1\n\n for j in range(1, ex + 1):\n if v[j] == 0 and d[j] < m:\n m = d[j]\n i = j\n\n if m == ex + 1:\n time = -1\n break\n\n elif i == ex:\n time = d[ex]\n break\n \nprint(time)", "n, m = map(int, input().split())\r\n\r\nA = [[0 for i in range(n)] for i in range(n)]\r\n\r\nfor i in range(m):\r\n u, v = map(int, input().split())\r\n u -= 1\r\n v -= 1\r\n A[u][v] = 1\r\n A[v][u] = 1\r\n \r\n\r\ndist = [-1 for i in range(n)]\r\ndist[0] = 0\r\n\r\nQ = [0]\r\n\r\nwhile len(Q) != 0:\r\n u = Q.pop(0)\r\n \r\n for v in range(n):\r\n \r\n if dist[v] == -1 and A[v][u] != A[0][n-1]:\r\n dist[v] = dist[u] + 1\r\n Q.append(v)\r\n \r\nprint(dist[n-1])\r\n", "n, m = map(int, input().split())\r\n \r\nff = [[1e10 for _ in range(n)] for i in range(n)]\r\ngg = [[1 for _ in range(n)] for i in range(n)]\r\n\r\nfor i in range(n):\r\n gg[i][i] = 0\r\n ff[i][i] = 0\r\n \r\nfor _ in range(m):\r\n i, j = map(int, input().split())\r\n ff[i - 1][j - 1] = 1\r\n ff[j - 1][i - 1] = 1\r\n gg[i - 1][j - 1] = 1e10\r\n gg[j - 1][i - 1] = 1e10\r\n \r\nif gg[0][n - 1] == 1:\r\n for k in range(n):\r\n for i in range(n):\r\n for j in range(i, n):\r\n ff[i][j] = min(ff[min(i, k)][max(i, k)] + ff[min(j, k)][max(j, k)], ff[i][j])\r\nelse:\r\n for k in range(n):\r\n for i in range(n):\r\n for j in range(i,n):\r\n gg[i][j] = min(gg[min(i, k)][max(i, k)] + gg[min(j, k)][max(j, k)], gg[i][j])\r\n \r\nans = max(ff[0][n - 1], gg[0][n - 1])\r\n\r\nif ans < 1e10:\r\n print(ans)\r\nelse:\r\n print(-1)\n# Tue Jul 12 2022 06:39:41 GMT+0000 (Coordinated Universal Time)\n", "n, m = map(int,input().split())\r\nl = [[0]*(n) for i in range(n)]\r\nfor i in range(m):\r\n u,v = map(int,input().split())\r\n l[u-1][v-1] = l[v-1][u-1] = 1\r\nvis = [-1]*n\r\nvis[0] = 0\r\nq = [0]\r\nwhile q:\r\n u = q.pop(0)\r\n for i in range(n):\r\n if l[u][i] != l[0][n-1] and vis[i] == -1:\r\n vis[i] = vis[u] + 1\r\n q.append(i)\r\nprint(vis[n-1])\r\n", "x,y=map(int,input().split())\r\na=[[0]*x for i in range(x)]\r\nfor i in range(y):\r\n b,c = map(int,input().split())\r\n a[b-1][c-1]=a[c-1][b-1]=1\r\nu=[-1]*x\r\nu[0]=0\r\nq=[0]\r\nwhile q:\r\n z=q.pop(0)\r\n for i in range(x):\r\n if(a[z][i]!=a[0][x-1]) and (u[i]==-1):\r\n u[i]=u[z]+1\r\n q.append(i)\r\nprint(u[x-1])", "from heapq import *\n\nn,m = map(int, input().split())\nL = [list(map(int, input().split())) for _ in range(m)]\n\nG = [[] for _ in range(n)]\nR = [[] for _ in range(n)]\nfor k in range(m):\n G[L[k][0]-1] += [L[k][1]-1]\n G[L[k][1]-1] += [L[k][0]-1]\n\nfor i in range(n-1):\n for j in range(i+1,n):\n if j not in G[i]:\n R[i] += [j]\n R[j] += [i]\n\nweightG = [[1 for _ in range(n)] for k in range(n)]\nweightR = [[1 for _ in range(n)] for k in range(n)]\n\ndef aux(graph, weight):\n source = 0\n n = len(graph)\n dist = [float('inf')] * n\n prec = [None] * n\n marked = [False] * n\n dist[source] = 0\n heap = [(0, source)]\n while heap:\n _, node = heappop(heap) # Le sommet le plus proche\n if not marked[node]:\n marked[node] = True\n for neighbor in graph[node]:\n my_dist_neighbor = dist[node] + weight[node][neighbor]\n if my_dist_neighbor < dist[neighbor]:\n dist[neighbor] = my_dist_neighbor\n prec[neighbor] = node\n heappush(heap, (my_dist_neighbor, neighbor))\n return dist, prec\n\ndef pred(L):\n R = [n-1]\n s = n-1\n while s > 0:\n s = L[s]\n R = [s] + R\n return R\n\n\ndef resolution(G,R,weightG,weightR):\n dG,pG = aux(G,weightG)\n dR,pR = aux(R,weightR)\n if pG[n-1] == None or pR[n-1] == None:\n return -1\n else:\n LG = pred(pG)\n LR = pred(pR)\n k = 1\n lm = min([len(LG),len(LR)])\n while k<lm and LG[k] != LR[k]:\n k+=1\n if k==lm:\n return max([dG[n-1],dR[n-1]])\n else:\n weightG[pG[LG[k]]][LG[k]] = 3\n sol1 = resolution(G,R,weightG,weightR)\n if sol1 == -1:\n sol1 = 1337\n weightR[pR[LR[k]]][LR[k]] = 3\n weightG[pG[LG[k]]][LG[k]] = 1\n sol2 = resolution(G,R,weightG,weightR)\n if sol2 == -1:\n sol2 = 1337\n sol = max([sol1,sol2])\n if sol == 1337:\n return -1\n else:\n return sol\n \nprint(resolution(G,R,weightG,weightR)) \n\n", "number1, number2 = map(int, input().split())\r\n \r\naux = [0] * (number1 + 1)\r\nfor i in range(number1 + 1):\r\n aux[i] = [1] * (number1 + 1)\r\n \r\nfor i in range(number2):\r\n x, y = map(int, input().split())\r\n aux[x][y] = aux[y][x] = 2\r\n \r\na, b, i = 3 - aux[1][number1], [0] * (number1 + 1), 1\r\nd = [number1 + 1] * (number1 + 1)\r\nresult = d[1] = 0\r\n \r\nwhile i != number1:\r\n b[i] = 1\r\n for j in range(1, number1 + 1):\r\n if b[j] == 0 and aux[i][j] == a and d[j] > d[i] + 1:\r\n d[j] = d[i] + 1\r\n meu = number1 + 1\r\n \r\n for k in range(1, number1 + 1):\r\n if b[k] == 0 and d[k] < meu:\r\n meu = d[k]\r\n i = k\r\n \r\n if meu == number1 + 1:\r\n result = -1\r\n break\r\n elif i == number1:\r\n result = d[number1]\r\n break\r\n \r\nprint(result)", "import math\nfrom collections import deque\n\n\nd = {}\nINF = 1000\n\n\ndef dijkstra(g):\n n = len(g)\n d = [INF] * n\n source = 0\n d[source] = 0\n used = [False] * n\n for _ in range(n):\n u = -1\n for v in range(n):\n if not used[v] and (u == -1 or d[v] < d[u]):\n u = v\n used[u] = True\n for v in g[u]:\n d[v] = min(d[v], d[u] + 1)\n if d[n - 1] == INF:\n return -1\n return d[n-1]\n\n\ndef main():\n n, m = map(int, input().split())\n g = []\n gg = []\n for _ in range(n):\n g.append([])\n gg.append([])\n for _ in range(m):\n u, v = map(lambda x: int(x) - 1, input().split())\n g[u].append(v)\n g[v].append(u)\n for i in range(n):\n for j in range(n):\n if i != j and j not in g[i]:\n gg[i].append(j)\n a1 = dijkstra(g)\n a2 = dijkstra(gg)\n if a1 < 0 or a2 < 0:\n print(-1)\n else:\n print(max(a1, a2))\n\n\nmain()", "import os\r\nimport sys\r\nfrom io import BytesIO, IOBase\r\nimport heapq as h \r\nfrom types import GeneratorType\r\nBUFSIZE = 8192\r\nclass FastIO(IOBase):\r\n newlines = 0\r\n \r\n def __init__(self, file):\r\n import os\r\n self.os = os\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 = self.os.read(self._fd, max(self.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 = self.os.read(self._fd, max(self.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 self.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\nimport time\r\nstart_time = time.time()\r\n\r\nimport collections as col\r\nimport math\r\nfrom functools import reduce\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\n\r\n\r\n\"\"\"\r\nConstruct a network of roads and a network of rails\r\nNote that it is always possible to go directly from 1 to N by road or rail, so as a starter we have that as an option, and the answer will be\r\nthe result of a BFS starting at 1 on the other network.\r\n\r\nIt is not possible to better this, since there is no shorter route on either service, and neither will clash.\r\n\"\"\"\r\n\r\ndef solve():\r\n rail = col.defaultdict(set)\r\n road = col.defaultdict(set)\r\n N, M = getInts()\r\n nodes = set()\r\n for i in range(1,N+1):\r\n for j in range(i+1,N+1):\r\n nodes.add((i,j))\r\n for m in range(M):\r\n U, V = getInts()\r\n if U > V:\r\n U, V = V, U\r\n nodes.remove((U,V))\r\n rail[U].add(V)\r\n rail[V].add(U)\r\n for U, V in nodes:\r\n road[U].add(V)\r\n road[V].add(U)\r\n \r\n def bfs(graph,start,end):\r\n visited = set()\r\n visited.add(start)\r\n queue = [(start,0)]\r\n queue = col.deque(queue)\r\n while queue:\r\n node, level = queue.popleft()\r\n for neighbour in graph[node]:\r\n if neighbour not in visited:\r\n visited.add(neighbour)\r\n queue.append((neighbour,level+1))\r\n if neighbour == N:\r\n return level+1\r\n return -1\r\n if N in road[1]:\r\n return bfs(rail,1,N)\r\n return bfs(road,1,N)\r\n#for _ in range(getInt()): \r\nprint(solve())\r\n", "def bfs(x):\n fila = [(1, 0)]\n visitados = [0] * (n + 1)\n \n while fila:\n u, v = fila.pop(0)\n for i in range(1, n + 1):\n if not visitados[i] and grafo[u][i] == x:\n if i == n:\n return v + 1\n fila.append((i, v + 1))\n visitados[i] = 1\n return -1\n \n \nn, m = map(int, input().split())\ngrafo = [[0] * (n + 1) for _ in range(n + 1)]\n \nfor _ in range(m):\n u, v = map(int, input().split())\n grafo[u][v] = 1\n grafo[v][u] = 1\n \nsaida = bfs(0) if grafo[1][n] else bfs(1)\nprint(saida)\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\nn,m=map(int,input().split())\r\ng=[[0]*n for i in range(n)]\r\nfor _ in range(m):\r\n u,v=map(int,input().split())\r\n g[u-1][v-1]=1\r\n g[v-1][u-1]=1\r\nq=[0]\r\nr=0\r\nu=[-1]*n\r\nu[0]=0\r\nwhile r<len(q):\r\n v=q[r]\r\n r+=1\r\n for i in range(n):\r\n if u[i]==-1 and g[v][i]!=g[0][n-1]:\r\n u[i]=u[v]+1\r\n q.append(i)\r\nprint(u[n-1])", "def bsf(grafo):\n fila = [0]\n visitado = [False] * n\n visitado[0] = True\n dists = [0] * n\n while len(fila):\n current = fila.pop(0)\n for i in grafo[current]:\n if not visitado[i]:\n fila.append(i)\n visitado[i] = True\n dists[i] = dists[current] + 1\n return dists[n - 1] if dists[n - 1] != 0 else -1\n\n\nn, m = map(int, input().split())\ngrafo = [[] for i in range(n)]\nfor i in range(m):\n u, v = map(int, input().split())\n grafo[u - 1] += [v - 1]\n grafo[v - 1] += [u - 1]\n\nif n - 1 in grafo[0]:\n for i in range(n):\n grafo[i] = [j for j in range(n) if j not in grafo[i] and j != i]\n\nprint(bsf(grafo))", "from collections import defaultdict\r\ndef bfs(graph, m):\r\n v, q= [], [(0, 0)]\r\n while(len(q)):\r\n value, d = q.pop(0)\r\n if(value in v):continue\r\n v.append(value)\r\n if(value == m):return d\r\n for ad in graph[value]:\r\n if(not ad in v):q.append((ad, d + 1))\r\n return -1\r\nn, m = map(int, input().split())\r\ng1, g2 = defaultdict(list),defaultdict(list)\r\nfor i in range(m):\r\n b, b1 = map(int, input().split())\r\n g1[b-1].append(b1-1)\r\n g1[b1-1].append(b-1)\r\nfor i in range(n):\r\n for j in range(n):\r\n if(i != j):\r\n if j not in g1[i]:g2[i].append(j)\r\nd1, d2 = bfs(g1, n-1), bfs(g2, n-1)\r\nresult = max(d1, d2) if (d2 != -1 and d1 != -1) else -1;print(result)", "from collections import deque\n\n\ndef min_route(n, edge_fn):\n t = 0\n s = {1}\n seen = set()\n unseen = set(range(1, n+1))\n while s:\n seen |= s\n unseen -= s\n ns = set()\n for u in s:\n if u == n:\n return t\n ns |= {v for v in unseen if edge_fn(u, v)}\n t += 1\n s = ns\n\n\ndef time(n, r):\n def train(u, v):\n return ((u, v) in r) or ((v, u) in r)\n\n def road(u, v):\n return not train(u, v)\n\n tt = min_route(n, train)\n tb = min_route(n, road)\n if tt is not None and tb is not None:\n return max(tt, tb)\n\n\ndef pair(i):\n u, v = i\n return u, v\n\n\nif __name__ == '__main__':\n n, m = map(int, input().split())\n r = {pair(map(int, input().split())) for _ in range(m)}\n t = time(n, r)\n print(-1 if t is None else t)\n", "towns, no_railways = map(int, input().split())\r\n\r\nrailways = { x:[] for x in range(towns) }\r\nroads = { x:[] for x in range(towns) }\r\n\r\ndef shortest_path(graph, start, goal):\r\n explored = []\r\n queue = [[start]]\r\n \r\n if start == goal:\r\n return\r\n \r\n while queue:\r\n path = queue.pop(0)\r\n node = path[-1]\r\n \r\n if node not in explored:\r\n neighbours = graph[node]\r\n \r\n for neighbour in neighbours:\r\n new_path = list(path)\r\n new_path.append(neighbour)\r\n queue.append(new_path)\r\n \r\n if neighbour == goal:\r\n return len(new_path) - 1\r\n explored.append(node)\r\n\r\n return -1\r\n\r\nfor _ in range(no_railways):\r\n u, v = map(int, input().split())\r\n u -= 1\r\n v -= 1\r\n railways[u].append(v)\r\n railways[v].append(u)\r\nfor u in range(towns):\r\n for v in range(towns):\r\n if u != v:\r\n if v not in railways[u]:\r\n roads[u].append(v)\r\n\r\nif towns-1 in railways[0]:\r\n print(shortest_path(roads, 0, towns-1))\r\nelse:\r\n print(shortest_path(railways, 0, towns-1))", "import heapq\r\n\r\nmx = 401\r\n\r\nrail = [[] for _ in range(mx)]\r\nbus = [[] for _ in range(mx)]\r\ns = set()\r\ndist_rail = [float('inf')] * mx\r\ndist_bus = [float('inf')] * mx\r\nvis = [False] * mx\r\n\r\ndef dijkstra(adj, dist):\r\n pq = [(0, 1)]\r\n dist[1] = 0\r\n while pq:\r\n d, u = heapq.heappop(pq)\r\n if vis[u]:\r\n continue\r\n vis[u] = True\r\n for v, weight in adj[u]:\r\n if dist[v] > dist[u] + weight:\r\n dist[v] = dist[u] + weight\r\n heapq.heappush(pq, (dist[v], v))\r\n\r\nn, m = map(int, input().split())\r\nfor _ in range(m):\r\n a, b = map(int, input().split())\r\n rail[a].append((b, 1))\r\n rail[b].append((a, 1))\r\n s.add((min(a, b), max(a, b)))\r\n\r\nfor i in range(1, n + 1):\r\n dist_rail[i] = float('inf')\r\n dist_bus[i] = float('inf')\r\n vis[i] = False\r\n\r\ndijkstra(rail, dist_rail)\r\n\r\nfor i in range(1, n + 1):\r\n vis[i] = False\r\n\r\nfor i in range(1, n + 1):\r\n for j in range(i + 1, n + 1):\r\n p = (i, j)\r\n if p not in s:\r\n bus[i].append((j, 1))\r\n bus[j].append((i, 1))\r\n\r\ndijkstra(bus, dist_bus)\r\n\r\nif dist_bus[n] == float('inf') or dist_rail[n] == float('inf'):\r\n print(\"-1\")\r\nelse:\r\n print(max(dist_bus[n], dist_rail[n]))\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn, m = map(int, input().split())\r\nd = [set() for i in range(n)]\r\nfor i in range(m):\r\n a, b = map(lambda x:int(x)-1, input().split())\r\n d[a].add(b)\r\n d[b].add(a)\r\nif n-1 in d[0]:\r\n q = []\r\n for i in range(n):\r\n x = [0]*n\r\n x[i] = 1\r\n for j in d[i]:\r\n x[j] = 1\r\n x1 = {j for j, k in enumerate(x) if k == 0}\r\n q.append(x1)\r\n d = q.copy()\r\nq = {0}\r\nx = [0]*n\r\new = 0\r\nc = 0\r\nwhile q:\r\n c += 1\r\n s = set()\r\n for i in q:\r\n x[i] = 1\r\n for i in q:\r\n for j in d[i]:\r\n if j == n-1:\r\n ew = 1\r\n break\r\n if x[j] == 0:\r\n s.add(j)\r\n if ew == 1:\r\n break\r\n q = s.copy()\r\nprint(-1 if ew == 0 else c)\r\n", "from collections import defaultdict\r\nfrom collections import deque\r\nn,m=map(int,input().split())\r\nr=[]\r\nfor i in range(n):\r\n r.append([0]*(n))\r\nfor i in range(m):\r\n x,y=map(int,input().split())\r\n r[x-1][y-1]=1\r\n r[y-1][x-1]=1\r\nd=defaultdict(list)\r\nfor i in range(n):\r\n for j in range(n):\r\n if r[i][j]!=r[0][n-1]:\r\n d[i].append(j)\r\nvisited={}\r\nq=deque()\r\nq.append(0)\r\ndistance={}\r\ndistance[0]=0\r\nvisited[0]=1\r\nwhile q:\r\n x=q.popleft()\r\n for j in d[x]:\r\n if visited.get(j,0)==0:\r\n visited[j]=1\r\n q.append(j)\r\n distance[j]=distance[x]+1\r\nif distance.get(n-1,0)==0:\r\n print(-1)\r\nelse:\r\n print(distance[n-1])", "from collections import deque\r\nn,m=map(int,input().split())\r\na=[set() for i in range(n+1)]\r\nfor i in range(m):\r\n x,y=map(int,input().split()) \r\n a[x].add(y)\r\n a[y].add(x)\r\nif n not in a[1]:\r\n t=True\r\nelse:\r\n t=False\r\nq=deque()\r\nq.append(1)\r\nz = [-1 for i in range(n+1)]\r\nz[1] = 0\r\nwhile len(q) > 0:\r\n v = q.popleft()\r\n for i in range(1, n+1):\r\n if t ^ (i in a[v]):\r\n continue\r\n if z[i]==-1:\r\n z[i]=z[v]+1\r\n q.append(i)\r\n if i == n:\r\n print(z[i])\r\n exit(0)\r\nprint(-1) ", "from collections import deque\r\nn, m = tuple(map(int, input().split()))\r\nli = deque([0])\r\ns = set()\r\nfor i in range(m):\r\n a, b = map(int, input().split())\r\n a -= 1\r\n b -= 1\r\n s.add((a, b))\r\n s.add((b, a))\r\nreach = (0, n-1) in s\r\nd = [0]+([-1] * (n-1))\r\nwhile li:\r\n a = li.popleft()\r\n for b in range(n):\r\n if (not(reach and ((a, b) in s))) and (reach or ((a, b) in s)):\r\n if d[b] == -1 or d[b] > d[a] + 1:\r\n d[b] = d[a] + 1\r\n li.append(b)\r\nprint(d[n-1])\r\n", "def menorTempo(array, n):\r\n var1 = 3 - array[1][n]\r\n array_aux = [0] * (n + 1)\r\n d = [n + 1] * (n + 1)\r\n resultado = d[1] = 0\r\n \r\n i = 1\r\n while i != n:\r\n array_aux[i] = 1\r\n for j in range(1, n + 1):\r\n if array_aux[j] == 0:\r\n if array[i][j] == var1:\r\n if d[j] > d[i] + 1:\r\n d[j] = d[i] + 1\r\n\r\n aux = n + 1\r\n for j in range(1, n + 1):\r\n if array_aux[j] == 0 and d[j] < aux:\r\n aux = d[j]\r\n i = j\r\n\r\n if aux == n + 1:\r\n return -1\r\n elif i == n:\r\n return d[n] \r\n return resultado\r\n\r\ndef main():\r\n entrada = input().split()\r\n n = int(entrada[0])\r\n m = int(entrada[1])\r\n\r\n array = [0] * (n + 1)\r\n for i in range(n + 1):\r\n array[i] = [1] * (n + 1)\r\n\r\n for i in range(m):\r\n entrada = input().split()\r\n a = int(entrada[0])\r\n b = int(entrada[1])\r\n array[a][b] = 2\r\n array[b][a] = 2\r\n\r\n print(menorTempo(array, n))\r\n\r\nif __name__ == '__main__':\r\n main()", "n, m = map(int, input().split())\n\na = [[0]*(n+1) for i in range(n+1)]\n\nfor i in range(m):\n u, v = map(int, input().split())\n u -= 1\n v -= 1\n a[u][v] = a[v][u] = 1\n \nd = [-1] * (n+1)\nd[0] = 0\nq = [0]\n\nwhile len(q) != 0:\n u = q.pop(0)\n for v in range(n):\n if d[v] == -1 and a[v][u] != a[0][n-1]:\n d[v] = d[u] +1\n q.append(v)\nprint(d[n-1])\n\t\t \t \t\t \t \t\t\t \t \t\t \t", "cidade_x, cidade_y = map(int, input().split())\n \ncruzamento = [0] * (cidade_x + 1)\n\nfor l in range(cidade_x + 1):\n cruzamento[l] = [1] * (cidade_x + 1)\n \nfor i in range(cidade_y):\n x, y = map(int, input().split())\n cruzamento[x][y] = cruzamento[y][x] = 2\n \nx, veiculo, indice = 3 - cruzamento[1][cidade_x], [0] * (cidade_x + 1), 1\nd = [cidade_x + 1] * (cidade_x + 1)\ntempo_ultimo = d[1] = 0\n \nwhile indice != cidade_x:\n veiculo[indice] = 1\n for j in range(1, cidade_x + 1):\n if veiculo[j] == 0 and cruzamento[indice][j] == x and d[j] > d[indice] + 1:\n d[j] = d[indice] + 1\n menor = cidade_x + 1\n \n for j in range(1, cidade_x + 1):\n if veiculo[j] == 0 and d[j] < menor:\n menor = d[j]\n indice = j\n \n if menor == cidade_x + 1:\n tempo_ultimo = -1\n break\n \n elif indice == cidade_x:\n tempo_ultimo = d[cidade_x]\n break\n \nprint(tempo_ultimo)", "'''\r\n@sksshivam007 - Template 1.0\r\n'''\r\nimport sys, re, math\r\nfrom collections import deque, defaultdict, Counter, OrderedDict\r\nfrom math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians\r\nfrom queue import Queue\r\nfrom heapq import heappush, heappop, heapify, nlargest, nsmallest\r\ndef STR(): return list(input())\r\ndef INT(): return int(input())\r\ndef MAP(): return map(int, input().split())\r\ndef LIST(): return list(map(int, input().split()))\r\ndef list2d(a, b, c): return [[c] * b for i in range(a)]\r\ndef sortListWithIndex(listOfTuples, idx): return (sorted(listOfTuples, key=lambda x: x[idx]))\r\ndef sortDictWithVal(passedDic):\r\n temp = sorted(passedDic.items(), key=lambda kv: (kv[1], kv[0]))[::-1]\r\n toret = {}\r\n for tup in temp:\r\n toret[tup[0]] = tup[1]\r\n return toret\r\ndef sortDictWithKey(passedDic):\r\n return dict(OrderedDict(sorted(passedDic.items())))\r\n\r\nINF = float('inf')\r\nmod = 10 ** 9 + 7\r\n\r\nif __name__ == \"__main__\":\r\n def bfs(graph, veh):\r\n used = [False] * (n+1)\r\n used[1] = True\r\n q = deque([(1, 0)])\r\n\r\n while(len(q)>0):\r\n popped = q.popleft()\r\n v = popped[0]\r\n dis = popped[1]\r\n\r\n if(v==n):\r\n return dis\r\n\r\n\r\n if(veh==1):\r\n for w in graph[v]:\r\n if not used[w]:\r\n used[w] = True\r\n q.append((w, dis+1))\r\n else:\r\n for w in range(1, n+1):\r\n if((not used[w]) and (w not in graph[v])):\r\n used[w] = True\r\n q.append((w, dis+1))\r\n return -1\r\n\r\n n,m = MAP()\r\n\r\n graph = defaultdict(set)\r\n\r\n for _ in range(m):\r\n x,y = MAP()\r\n graph[x].add(y)\r\n graph[y].add(x)\r\n\r\n dst1 = bfs(graph, 1)\r\n dst2 = bfs(graph, 0)\r\n\r\n if(dst1==-1 or dst2==-1):\r\n print(-1)\r\n else:\r\n print(max(dst1, dst2))", "from collections import deque\r\n\r\nn, m = list(map(int, input().split()))\r\ngraph_railway = {}\r\nused_roads = set()\r\nis_clothest = False\r\n\r\nfor i in range(m):\r\n u, v = list(map(int, input().split()))\r\n if u > v:\r\n u, v = v, u\r\n used_roads.add((u, v))\r\n if u == 1 and v == n:\r\n is_clothest = True\r\n if u not in graph_railway:\r\n graph_railway[u] = [v]\r\n else:\r\n graph_railway[u].append(v)\r\n if v not in graph_railway:\r\n graph_railway[v] = [u]\r\n else:\r\n graph_railway[v].append(u)\r\n\r\ngraph_road = {}\r\nif is_clothest:\r\n for i in range(1, n+1):\r\n for j in range(i+1, n+1):\r\n if (i, j) not in used_roads:\r\n if i not in graph_road:\r\n graph_road[i] = [j]\r\n else:\r\n graph_road[i].append(j)\r\n if j not in graph_road:\r\n graph_road[j] = [i]\r\n else:\r\n graph_road[j].append(i)\r\n\r\ntimes = [float(\"inf\") for i in range(n+1)]\r\nq = deque()\r\nq.append(1)\r\ntimes[1] = 0\r\nres = -1\r\nwhile len(q) > 0 and res == -1:\r\n el = q.popleft()\r\n t = times[el]\r\n graph = graph_road if is_clothest else graph_railway\r\n if el not in graph:\r\n continue\r\n for child in graph[el]:\r\n if times[child] == float('inf'):\r\n times[child] = t + 1\r\n q.append(child)\r\n if child == n:\r\n res = t+1\r\n break\r\n\r\nprint(res)\r\n", "n,m = map(int, input().split())\r\n\r\nrailway = [[] for i in range(n+1)]\r\nroads = [[] for i in range(n+1)]\r\n\r\nrailway_direct = False \r\nfor i in range(m):\r\n u,v = map(int,input().split())\r\n if((u == 1 and v == n) or (u == n and v == 1)):\r\n railway_direct = True\r\n railway[u].append(v)\r\n railway[v].append(u)\r\n\r\nfor i in range(1,n+1):\r\n for k in range(i+1, n+1):\r\n if(k not in railway[i]):\r\n roads[i].append(k)\r\n roads[k].append(i)\r\n\r\ndef shortest_path(graph, start, goal):\r\n explored = []\r\n queue = [[start]]\r\n \r\n if start == goal:\r\n return\r\n \r\n while queue:\r\n path = queue.pop(0)\r\n node = path[-1]\r\n \r\n if node not in explored:\r\n neighbours = graph[node]\r\n \r\n for neighbour in neighbours:\r\n new_path = list(path)\r\n new_path.append(neighbour)\r\n queue.append(new_path)\r\n \r\n if neighbour == goal:\r\n return len(new_path) - 1\r\n explored.append(node)\r\n\r\n return -1\r\n\r\nif(railway_direct):\r\n print(shortest_path(roads,1,n))\r\nelse:\r\n print(shortest_path(railway,1,n))", "from queue import Queue\r\n\r\ndef solve( net1 , net2 , n ):\r\n\r\n # for net1\r\n res = [400*400]*n\r\n visited = [False]*n\r\n q = Queue(400*400)\r\n\r\n q.put( (0,0) )\r\n visited[0] = True\r\n res[0] = 0\r\n while not q.empty():\r\n town , t = q.get()\r\n for next_town in net1[town]:\r\n if not visited[next_town]:\r\n res[next_town] = t+1\r\n visited[next_town] = True\r\n q.put( ( next_town , t+1 ) )\r\n\r\n #print(res)\r\n\r\n # for net2\\\r\n res2 = [400*400]*n\r\n visited = [False]*n\r\n q = Queue(400*400)\r\n\r\n q.put( (0,0) )\r\n visited[0] = True\r\n res2[0] = 0\r\n while not q.empty():\r\n town , t = q.get()\r\n if res[town] != 400*400 and t > res[town]:\r\n continue\r\n\r\n for next_town in net2[town]:\r\n if next_town == n - 1:\r\n return max( t+1 , res[n-1] )\r\n if not visited[next_town]:\r\n if res[next_town] == t + 1:\r\n q.put( (next_town,t+3) )\r\n res2[next_town] = t+3\r\n else:\r\n q.put( (next_town,t+1) )\r\n visited[next_town] = True\r\n res2[next_town] = t+1\r\n\r\n return 400*400\r\n\r\nif __name__ == \"__main__\":\r\n\r\n n , m = [ int(x) for x in input().split() ]\r\n\r\n roads = [ set( [x for x in range(n)] ) for y in range(n) ]\r\n for u in range(n):\r\n roads[u].remove(u)\r\n\r\n #for road in roads:\r\n # print( road )\r\n rails = [ set() for x in range(n) ]\r\n\r\n for _ in range(m):\r\n u , v = [int(x)-1 for x in input().split()]\r\n roads[u].remove(v)\r\n roads[v].remove(u)\r\n rails[u].add(v)\r\n rails[v].add(u)\r\n\r\n #for road in roads:\r\n # print( road )\r\n #print()\r\n #for rail in rails:\r\n # print( rail )\r\n\r\n res = min( solve( rails , roads , n ) , solve( roads , rails , n ) )\r\n print( res if res != 400*400 else -1 )", "# maa chudaaye duniya\r\nfrom collections import defaultdict\r\n\r\nn, m = map(int, input().split())\r\ntemp = set([i for i in range(1, n+1)])\r\nrailway = defaultdict(list)\r\nfor _ in range(m):\r\n u, v = map(int, input().split())\r\n railway[u].append(v)\r\n railway[v].append(u)\r\n\r\nroads = defaultdict(list)\r\nfor i in range(1, n+1):\r\n curr = set(railway[i])\r\n curr = temp.difference(curr)\r\n curr.remove(i)\r\n roads[i] = list(curr)\r\n\r\nrailway_trav = -1\r\nqueue = [[1, 0]]\r\nvisited = [False for i in range(n+1)]\r\nvisited[1] = True\r\n\r\nwhile(queue != []) :\r\n node, dist = queue[0]\r\n queue.pop(0)\r\n if node == n:\r\n railway_trav = dist\r\n break\r\n for child in railway[node]:\r\n if not visited[child]:\r\n visited[child] = True\r\n queue.append([child, dist+1])\r\n\r\nroads_trav = -1\r\nqueue = [[1, 0]]\r\nvisited = [False for i in range(n+1)]\r\nvisited[1] = True\r\nwhile (queue != []):\r\n node, dist = queue[0]\r\n queue.pop(0)\r\n if node == n:\r\n roads_trav = dist\r\n break\r\n for child in roads[node]:\r\n if not visited[child]:\r\n visited[child] = True\r\n queue.append([child, dist+1])\r\n\r\nif roads_trav == -1 or railway_trav == -1:\r\n print(-1)\r\nelse:\r\n print(max(1, roads_trav, railway_trav))", "from collections import defaultdict\r\nimport heapq\r\nn,m=list(map(int,input().split()))\r\nroads=defaultdict(list)\r\nrailways=defaultdict(list)\r\nfor _ in range(m):\r\n u,v=list(map(int,input().split()))\r\n railways[u].append(v)\r\n railways[v].append(u)\r\nfor i in range(1,n+1):\r\n roads[i]=[j for j in range(1,n+1) if j not in railways[i] and j!=i]\r\ndef shortest(grpah,n):\r\n distances=[float(\"inf\")]*(n+1)\r\n heap=[(0,1)]\r\n distances[1]=0\r\n while heap:\r\n dist,node=heapq.heappop(heap)\r\n for new_node in grpah[node]:\r\n if dist+1 < distances[new_node]:\r\n distances[new_node]=dist+1\r\n heapq.heappush(heap,(dist+1,new_node))\r\n\r\n return distances[n] \r\nans=max(shortest(roads,n),shortest(railways,n))\r\nif ans==float('inf'):\r\n print(-1)\r\nelse:\r\n print(ans) ", "from collections import defaultdict\ndef bfs(g,n):\n d=[float(\"inf\")]*n\n d[0]=0\n q=[0]\n while q:\n t=q.pop(0)\n for val in g[t]:\n if d[val]==float(\"inf\"):\n d[val]=d[t]+1\n q.append(val)\n\n return d[-1]\nn,m=map(int,input().strip().split())\ng=defaultdict(list)\nfor i in range(m):\n x,y=map(lambda s:int(s)-1,input().strip().split())\n g[x].append(y)\n g[y].append(x)\ng2=defaultdict(list)\nfor i in range(n):\n for j in range(n):\n if j not in g[i] and j!=i:\n g2[i].append(j)\nans=max(bfs(g,n),bfs(g2,n))\nprint([ans,-1][ans==float(\"inf\")])\n\n\t \t\t\t\t \t \t\t\t \t \t \t\t \t\t\t", "from collections import deque\r\n\r\ndef BFS(source, graph, n):\r\n # print(graph)\r\n dist = -1\r\n visited = []\r\n for _ in range(n):\r\n visited.append(False)\r\n q = deque()\r\n q.append(source)\r\n visited[source] = True\r\n # farthestNode = node\r\n while not len(q) == 0:\r\n k = len(q)\r\n dist+=1\r\n for i in range(k):\r\n top = q.popleft()\r\n # print(top)\r\n for neighbour in graph[top]:\r\n # print(neighbour)\r\n if neighbour == n-1:\r\n return dist+1\r\n if visited[neighbour] == False:\r\n visited[neighbour] = True\r\n q.append(neighbour)\r\n return -1\r\n\r\n\r\n\r\ndef main():\r\n inp = input().split()\r\n inp = [int(i) for i in inp]\r\n n,m = inp\r\n ans = 0\r\n allNodes = set()\r\n graphRail = []\r\n graphRoad = []\r\n evaluateRail = True\r\n for i in range(n):\r\n graphRail.append([])\r\n graphRoad.append([])\r\n allNodes.add(i)\r\n for _ in range(m):\r\n inp = input().split()\r\n inp = [int(i) for i in inp]\r\n u,v = inp\r\n if((u==1 and v==n) or (v==1 and u==n)):\r\n # if((u,v == 1,n) or (v,u == 1,n)):\r\n evaluateRail = False\r\n u-=1;v-=1\r\n graphRail[u].append(v)\r\n graphRail[v].append(u)\r\n for i in range(n):\r\n allL = allNodes.copy()\r\n # print(allL)\r\n # print(allNodes)\r\n neighbours = set()\r\n for neighbour in graphRail[i]:\r\n neighbours.add(neighbour)\r\n allL.discard(i)\r\n # print(allL)\r\n roadNeighbours = allL-neighbours\r\n # print(roadNeighbours)\r\n for roadNeighbour in roadNeighbours:\r\n graphRoad[i].append(roadNeighbour)\r\n\r\n # print(graphRail)\r\n # print(graphRoad)\r\n if evaluateRail == True:\r\n ans = BFS(0,graphRail, n)\r\n else:\r\n ans = BFS(0,graphRoad, n)\r\n print(ans)\r\n return\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()", "import math\r\nfrom collections import deque, defaultdict\r\nfrom math import sqrt, ceil, factorial, floor, inf, gcd\r\nimport bisect\r\nimport sys\r\nimport random\r\nimport heapq\r\n\r\ndef get_array(): return list(map(int, sys.stdin.readline().strip().split()))\r\n\r\n\r\ndef get_ints(): return map(int, sys.stdin.readline().strip().split())\r\n\r\n\r\ndef input(): return sys.stdin.readline().strip()\r\n\r\n\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\ndef main():\r\n (n,m) = get_ints()\r\n bus = defaultdict(set)\r\n train = defaultdict(set)\r\n s = set([i for i in range(n)])\r\n for i in range(m):\r\n (u,v) = get_ints()\r\n train[u-1].add(v-1)\r\n train[v-1].add(u-1)\r\n\r\n for i in range(n):\r\n bus[i] = s-train[i]\r\n\r\n if n-1 in train[0]:\r\n # bfs for bus\r\n vis = [False]*n\r\n dist = [inf]*n\r\n vis[0] = True\r\n dist[0] = 0\r\n ans = [[0,0]]\r\n heapq.heapify(ans)\r\n while ans:\r\n u = heapq.heappop(ans)[1]\r\n for v in bus[u]:\r\n if not vis[v]:\r\n vis[v] = True\r\n if dist[v] > dist[u]+1:\r\n dist[v] = dist[u]+1\r\n heapq.heappush(ans,[dist[v],v])\r\n if dist[n-1] == inf:\r\n print(-1)\r\n else:\r\n print(dist[n-1])\r\n else:\r\n vis = [False] * n\r\n dist = [inf] * n\r\n vis[0] = True\r\n dist[0] = 0\r\n ans = [[0, 0]]\r\n heapq.heapify(ans)\r\n while ans:\r\n u = heapq.heappop(ans)[1]\r\n for v in train[u]:\r\n if not vis[v]:\r\n vis[v] = True\r\n if dist[v] > dist[u] + 1:\r\n dist[v] = dist[u] + 1\r\n heapq.heappush(ans, [dist[v], v])\r\n if dist[n - 1] == inf:\r\n print(-1)\r\n else:\r\n print(dist[n - 1])\r\n\r\n\r\nif __name__ == '__main__':\r\n main()", "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\ndef dijakstra(weight,k):\r\n heap = [(0,k)]\r\n heapify(heap)\r\n dist = defaultdict(tuple)\r\n while heap:\r\n cost,u = heappop(heap)\r\n if u not in dist:\r\n dist[u] = cost\r\n for v in weight[u]:\r\n heappush(heap,(dist[u]+weight[u][v],v))\r\n return dist \r\n\r\nn,m = Neo()\r\nG1,G2 = defaultdict(dict),defaultdict(dict)\r\ns = set()\r\nfor i in range(m):\r\n u,v = Neo()\r\n G1[u][v] = 1\r\n G1[v][u] = 1\r\n s.add((u,v))\r\n s.add((v,u))\r\nfor i in range(1,n+1):\r\n for j in range(i+1,n+1):\r\n if (i,j) not in s:\r\n G2[i][j] = 1\r\n G2[j][i] = 1\r\nif (1,n) in s:\r\n dist = dijakstra(G2,1)\r\n if n not in dist:\r\n print(-1)\r\n else: \r\n print(dist[n])\r\nelse: \r\n dist = dijakstra(G1,1)\r\n if n not in dist:\r\n print(-1)\r\n else: \r\n print(dist[n])", "import sys\r\ninput = sys.stdin.buffer.readline \r\n\r\n\r\ndef process(n, G):\r\n g1 = [set([])for i in range(n+1)]\r\n m = len(G)\r\n for i in range(m):\r\n u, v = G[i]\r\n g1[u].add(v)\r\n g1[v].add(u)\r\n if n in g1[1]:\r\n g2 = [[] for i in range(n+1)]\r\n for i in range(1, n+1):\r\n for j in range(1, n+1):\r\n if i != j and j not in g1[i]:\r\n g2[i].append(j)\r\n g = g2\r\n else:\r\n g = g1\r\n distances = [None for i in range(n+1)]\r\n start = [1]\r\n distances[1] = 0\r\n while len(start) > 0:\r\n next_s = []\r\n for x in start:\r\n for y in g[x]:\r\n if distances[y] is None:\r\n distances[y] = 1+distances[x]\r\n next_s.append(y)\r\n start = next_s\r\n if distances[n] is None:\r\n return -1\r\n return distances[n]\r\n\r\nn, m = [int(x) for x in input().split()]\r\nG = []\r\nfor i in range(m):\r\n u, v = [int(x) for x in input().split()]\r\n G.append([u, v])\r\nprint(process(n, G))\r\n \r\n ", "import heapq\n\n\nn, m = list(map(int, input().split()))\n\nadj = [[] for _ in range(n)]\nfor _ in range(m):\n u, v = list(map(int, input().split()))\n adj[u - 1].append((v - 1, 1))\n adj[v - 1].append((u - 1, 1))\n\n\ndef dijkstra(s, graph):\n dist = [float(\"inf\")] * n\n dist[s] = 0\n q = [(0, s)]\n while q:\n d, u = heapq.heappop(q)\n if d > dist[u]:\n continue\n for v, w in graph[u]:\n if dist[u] + w < dist[v]:\n dist[v] = dist[u] + w\n heapq.heappush(q, (dist[v], v))\n return dist\n\n\n# dist 1 is the shortest path from 1 to n in graph adj\ndist1 = dijkstra(0, adj)\n\n# an adj graph 2 has all connections that are not in adj graph 1\nadj2 = [[] for _ in range(n)]\nfor u in range(n):\n for v in range(n):\n if (v, 1) not in adj[u] and u != v:\n adj2[u].append((v, 1))\n# print(adj)\n# print(adj2)\n\n# calcualtes the shortest path from 1 to n in adj2\ndist2 = dijkstra(0, adj2)\n\n\nif dist1[n - 1] == float(\"inf\") or dist2[n - 1] == float(\"inf\"):\n print(-1)\nelse:\n # prints the longest between dist 1 and dist 2\n print(max(dist1[n - 1], dist2[n - 1]))\n\n \t\t \t\t \t\t\t\t \t\t\t \t\t \t \t \t \t \t\t", "from queue import PriorityQueue\nLIMIT = 1000000001\ndef dijkstra(graph, distances, visited):\n queue = PriorityQueue()\n queue.put((0, 1))\n distances[1] = 0\n while(not queue.empty()):\n _, node = queue.get()\n if visited[node]:\n continue\n \n visited[node] = True\n for i in range(len(graph[node])):\n n, weight = graph[node][i]\n if (distances[n] > distances[node] + weight):\n distances[n] = distances[node] + weight\n queue.put((distances[n], n))\n\nn, m = map(int, input().split())\ngraph = [[] for i in range(n+1)]\nd = {}\n\nfor i in range(m):\n u, v = map(int, input().split())\n graph[u].append((v, 1))\n graph[v].append((u, 1))\n d[(min(u, v), max(u, v))] = True\n\nvisited = [False] * (n + 1)\ndistance_r = [LIMIT] * (n + 1)\ndistance_b = [LIMIT] * (n + 1)\ndijkstra(graph, distance_r, visited)\n\nvisited = [False] * (n + 1)\ngraph = [[] for i in range(n+1)]\nfor i in range(1, n+1):\n for j in range(i + 1, n + 1):\n if ((i, j) not in d):\n graph[i].append((j, 1))\n graph[j].append((i, 1))\ndijkstra(graph, distance_b, visited)\n\nif (distance_b[n] == LIMIT or distance_r[n] == LIMIT):\n print(-1)\nelse:\n print(max(distance_b[n], distance_r[n]))\n", "N, M = [ int(x) for x in input().split() ]\r\n \r\ntrain = [ [ False for b in range(N) ] for a in range(N) ]\r\nfor m in range(M):\r\n a, b = [ int(x)-1 for x in input().split() ]\r\n train[a][b] = train[b][a] = True\r\nif train[0][N-1]: train = [ [ not train[a][b] for b in range(N) ] for a in range(N) ]\r\n \r\ndist = [ N+1 for n in range(N) ]\r\ndist[0] = 0\r\nfrom queue import Queue\r\nQ = Queue()\r\nQ.put(0)\r\nwhile not Q.empty():\r\n kde = Q.get()\r\n for kam in range(N):\r\n if train[kde][kam]:\r\n if dist[kam] > dist[kde]+1:\r\n dist[kam] = dist[kde]+1\r\n Q.put(kam)\r\n \r\nprint( -1 if dist[N-1]==N+1 else dist[N-1] )", "from collections import deque\r\ndef answer(n,g):\r\n vis=[0]*(n+1)\r\n q=deque([(0,1)])\r\n vis[1]=1\r\n while q:\r\n item=q.popleft()\r\n node=item[1]\r\n wt=item[0]\r\n if node==n:\r\n return wt\r\n for v in range(1,n+1):\r\n if g[node][v]>0 and vis[v]==0:\r\n vis[v]=1\r\n q.append((wt+1,v))\r\n \r\n return -1\r\n\r\nn,m=map(int,input().split())\r\ng=[[0 for i in range(n+1)] for j in range(n+1)]\r\nfor i in range(m):\r\n u,v=map(int,input().split())\r\n g[u][v]=1\r\n g[v][u]=1 \r\n \r\nif g[1][n]==1:\r\n for i in range(1,n+1):\r\n for j in range(1,n+1):\r\n if g[i][j]==1:\r\n g[i][j]=0\r\n elif i!=j:\r\n g[i][j]=1\r\n\r\n \r\nx=answer(n,g)\r\nif x==-1:\r\n print(-1)\r\nelse:\r\n print(max(1,x))", "def bsf(g):\n f = [0]\n v = [False] * n\n v[0] = True\n d = [0] * n\n while len(f):\n current = f.pop(0)\n for i in g[current]:\n if not v[i]:\n f.append(i)\n v[i] = True\n d[i] = d[current] + 1\n return d[n - 1] if d[n - 1] != 0 else -1\n\n\nn, m = map(int, input().split())\ng = [[] for i in range(n)]\nfor i in range(m):\n u, v = map(int, input().split())\n g[u - 1] += [v - 1]\n g[v - 1] += [u - 1]\n\nif n - 1 in g[0]:\n for i in range(n):\n g[i] = [j for j in range(n) if j not in g[i] and j != i]\n\nprint(bsf(g))\n\t\t\t\t \t\t \t\t \t\t\t \t \t\t \t \t\t", "def initialize_matrix(n):\r\n return [[0] * (n + 1) for _ in range(n + 1)]\r\n\r\n\r\ndef bfs(x):\r\n queue = [(1, 0)]\r\n visited = [0] * (n + 1)\r\n\r\n while queue:\r\n u, v = queue.pop(0)\r\n for i in range(1, n + 1):\r\n if not visited[i] and a[u][i] == x:\r\n if i == n:\r\n return v + 1\r\n queue.append((i, v + 1))\r\n visited[i] = 1\r\n\r\n return -1\r\n\r\n\r\nn, m = map(int, input().split())\r\na = initialize_matrix(n)\r\n\r\nfor _ in range(m):\r\n x, y = map(int, input().split())\r\n a[x][y] = a[y][x] = 1\r\n\r\nif a[1][n]:\r\n ans = bfs(0)\r\nelse:\r\n ans = bfs(1)\r\n\r\nprint(ans)\r\n", "import math\r\nimport random\r\nfrom collections import Counter, deque\r\nfrom sys import stdout\r\nimport time\r\nfrom math import factorial, log, gcd\r\nimport sys\r\nfrom decimal import Decimal\r\nimport heapq\r\n\r\n\r\ndef S():\r\n return sys.stdin.readline().split()\r\n\r\n\r\ndef I():\r\n return [int(i) for i in sys.stdin.readline().split()]\r\n\r\n\r\ndef II():\r\n return int(sys.stdin.readline())\r\n\r\n\r\ndef IS():\r\n return sys.stdin.readline().replace('\\n', '')\r\n\r\n\r\ndef z(left, right):\r\n print('?', left + 1, right + 1, flush=True)\r\n return II()\r\n\r\n\r\ndef main():\r\n n, m = I()\r\n graph_train = [set() for _ in range(n)]\r\n range_ = set(range(n))\r\n graph_bus = [range_ - {i} for i in range(n)]\r\n for i in range(m):\r\n u, v = I()\r\n u -= 1\r\n v -= 1\r\n graph_train[u].add(v)\r\n graph_train[v].add(u)\r\n graph_bus[u] -= {v}\r\n graph_bus[v] -= {u}\r\n\r\n target = graph_train\r\n if n - 1 in graph_train[0]:\r\n target = graph_bus\r\n\r\n visited = [float('inf')] * n\r\n visited[0] = 0\r\n queue = deque([0])\r\n while queue:\r\n v = queue.pop()\r\n _time_v = visited[v]\r\n for u in target[v]:\r\n _time_u = visited[u]\r\n if _time_v + 1 < _time_u:\r\n visited[u] = _time_v + 1\r\n queue.append(u)\r\n\r\n print(visited[-1] if visited[-1] < float('inf') else -1)\r\n\r\n\r\nif __name__ == '__main__':\r\n # for _ in range(II()):\r\n # main()\r\n main()", "num_cidades, num_ferrovias = map(int, input().split())\ngrafo = [[0] * num_cidades for _ in range(num_cidades)]\n\nfor i in range(num_ferrovias):\n ferrovia_inicio, ferrovia_fim = map(int, input().split())\n grafo[ferrovia_inicio-1][ferrovia_fim-1] = 1\n grafo[ferrovia_fim-1][ferrovia_inicio-1] = 1\n\n\naux = [0]\ni = 0\ncidade_u = [-1] * num_cidades\ncidade_u[0] = 0\nwhile i < len(aux):\n cidade_v = aux[i]\n i += 1\n for j in range(num_cidades):\n if cidade_u[j] == -1 and grafo[cidade_v][j] != grafo[0][num_cidades-1]:\n cidade_u[j]=cidade_u[cidade_v]+1\n aux.append(j)\n\nprint(cidade_u[num_cidades-1])\n\n\t\t \t \t\t \t \t\t\t\t\t \t\t\t\t\t \t\t\t", "def bfs_shortest_path(graph, start, goal):\r\n explored = []\r\n queue = [[start]]\r\n while queue:\r\n path = queue.pop(0)\r\n node = path[-1]\r\n if node not in explored:\r\n neighbours = graph[node]\r\n for neighbour in neighbours:\r\n new_path = list(path)\r\n new_path.append(neighbour)\r\n queue.append(new_path)\r\n if neighbour == goal:\r\n return len(new_path)-1\r\n explored.append(node)\r\n return -1\r\n\r\n\r\ntown_rail = input().split(\" \")\r\ntown = int(town_rail[0])\r\nrail = int(town_rail[1])\r\nrailways = []\r\ngraph = {}\r\nfor j in range(1,town+1):\r\n graph[j] = []\r\n\r\nfor i in range(rail):\r\n railways.append(input().split(\" \"))\r\n\r\nif [\"1\", str(town)] in railways or [str(town),\"1\"] in railways:\r\n for key in graph:\r\n for k in range(1,town+1):\r\n if k != key:\r\n graph[key].append(k)\r\n for pair in railways:\r\n graph[int(pair[0])].remove(int(pair[1]))\r\n graph[int(pair[1])].remove(int(pair[0]))\r\nelse:\r\n for pair in railways:\r\n graph[int(pair[0])].append(int(pair[1]))\r\n graph[int(pair[1])].append(int(pair[0]))\r\nprint(bfs_shortest_path(graph, 1, town))", "CONST_MAX = 999999999\r\n\r\nadj_matrix = []\r\nsource_dist = []\r\n\r\ndef BFS(t):\r\n visited = []\r\n for i in range(500):\r\n source_dist.append(CONST_MAX)\r\n visited.append(False)\r\n queue = []\r\n queue.append(1)\r\n visited[1] = True\r\n source_dist[1] = 0\r\n while len(queue) > 0:\r\n current = queue[0]\r\n del queue[0]\r\n for i in range(1, n+1):\r\n if t == True:\r\n if adj_matrix[current][i]==1 and visited[i] == False:\r\n queue.append(i)\r\n visited[i] = True\r\n source_dist[i] = source_dist[current]+1\r\n if i==n: return\r\n else:\r\n if adj_matrix[current][i]==0 and visited[i] == False:\r\n queue.append(i)\r\n visited[i] = True\r\n source_dist[i] = source_dist[current]+1\r\n if i==n: return\r\n\r\nn, m = map(int, input().split()) # town amount & railway amount\r\nt = 0 #toggle train mode (if false -> bus mode); also be used as time with train\r\nb = 0 # train with bus\r\n\r\nfor i in range(500):\r\n adj_matrix.append([])\r\n for j in range(500):\r\n adj_matrix[i].append(0)\r\n\r\nfor i in range(m):\r\n u, v = map(int, input().split()) # town source & town destination\r\n adj_matrix[u][v] = 1\r\n adj_matrix[v][u] = 1\r\n\r\nif adj_matrix[1][n]==1: t = True\r\n\r\nif t:\r\n BFS(False)\r\n b = source_dist[n]\r\nelse:\r\n BFS(True)\r\n t = source_dist[n]\r\n\r\nif max(b,t)==CONST_MAX: print(-1)\r\nelse: print(max(b,t))", "import queue\n\nconnect = [[0 for i in range(401)] for j in range(401)]\n\n\ndef bfs(val):\n q = queue.Queue()\n dis = [-1 for i in range(401)]\n dis[1] = 0\n q.put(1)\n while(not q.empty()):\n x = q.get()\n\n for i in range(1, n+1):\n if connect[x][i] == val and dis[i] == -1:\n dis[i] = dis[x]+1\n q.put(i)\n return dis[n]\n\ntemp = input().split()\nn = int(temp[0])\nm = int(temp[1])\n\ndis = [[[0 for i in range(401)] for j in range(401)] for k in range(2)]\n\nfor i in range(m):\n temp = input().split()\n u = int(temp[0])\n v = int(temp[1])\n connect[u][v] = connect[v][u] = 1\n\nprint(bfs(1-connect[1][n]))\n", "from collections import deque\n\ndef bfs(x):\n \n q = deque()\n q.append((1, 0))\n \n while q:\n u, v = q.popleft()\n \n for i in range(1, n + 1):\n if not vis[i] and graph[u][i] == x:\n \n if i == n:\n return v + 1\n \n q.append((i, v + 1))\n vis[i] = 1\n return -1\n\n\nn, m = map(int, input().split())\nvis = [0] * (n + 1)\nqueue = deque()\n\ngraph = {}\nfor i in range(1, n + 1):\n graph[i] = [0] * (n + 1)\n\nfor _ in range(m):\n u, v = map(int, input().split())\n graph[u][v] = graph[v][u] = 1\n\nif graph[1][n]:\n res = bfs(0)\nelse:\n res = bfs(1)\n\nprint(res)\n\n\t \t \t \t\t \t \t \t\t\t \t\t \t \t\t\t", "def bfs(g,n):\n q = [1]\n vis = [1 for x in range(n+1)]\n dis = [0 for x in range(n+1)]\n while len(q):\n curr = q[0]\n q.remove(curr)\n for i in g[curr]:\n if vis[i]:\n q.append(i)\n vis[i] = 0\n dis[i] = dis[curr]+1\n if i == n:\n return dis[n]\n return -1\n \n[n, m] = [int(x) for x in input().split()]\nrailway = [[] for x in range(n + 1)]\nroad = [[] for x in range(n + 1)]\n\nfor i in range(m):\n [a,b] = [int(x) for x in input().split()]\n railway[a].append(b)\n railway[b].append(a)\n\nfor i in range(1, n + 1):\n for j in range(i + 1, n + 1):\n if j not in railway[i]:\n road[i].append(j)\n road[j].append(i)\nif n in railway[1]:\n print(bfs(road, n))\nelse:\n print(bfs(railway, n))", "n,m = map(int,input().split())\narr =[[0] * n for i in range(n)]\narr2 = [-1] * n\narr2[0] = 0 \narr3 = []\n\nfor i in range(m):\n a, b = map(int,input().split())\n arr[b-1][a-1] = 1\n arr[a-1][b-1] = 1\n\narr3.append(0)\nwhile(arr3):\n i = arr3.pop(0) \n for j in range(n):\n if (arr[i][j] != arr[0][n-1]) and (arr2[j] == -1):\n arr2[j] = arr2[i]+1\n arr3.append(j)\n\nprint(arr2[n-1])\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\r\nclass Graph:\r\n to=[]\r\n n=0\r\n def __init__(self,_n):\r\n self.to=[[False]*(_n+1)for i in range(_n+1)]\r\n self.n=_n\r\n def add_edge(self,s,t):\r\n self.to[s][t]=True\r\n self.to[t][s]=True\r\n def dijkstra(self):\r\n flag=self.to[1][self.n]==False\r\n ans=1\r\n dis=[-1]*(self.n+1)\r\n q=PriorityQueue()\r\n q.put((0,1))\r\n while q.qsize()>0:\r\n d1,pos=q.get()\r\n # print(pos,d1\r\n if dis[pos]!=-1:\r\n continue\r\n dis[pos]=d1\r\n\r\n for i in range(1,self.n+1):\r\n if self.to[pos][i]!=flag:\r\n continue\r\n nx=i\r\n if nx==pos:\r\n continue\r\n if dis[nx]==-1:\r\n q.put((d1+1,nx))\r\n return dis[self.n]\r\n\r\n\r\ngph=Graph(0)\r\nN,M=[0]*2\r\n\r\ndef read_in():\r\n # file = open(\"input.txt\")\r\n global N,M,gph\r\n N,M=[int(i) for i in input().split()]\r\n\r\n gph=Graph(N)\r\n for i in range(M):\r\n # line=file.readline()\r\n s,t=[int(i) for i in input().split()]\r\n\r\n gph.add_edge(s,t)\r\n # print(s,t,l)\r\n\r\nread_in()\r\n\r\nprint(gph.dijkstra())", "cx, cy = map(int, input().split())\r\n \r\ncross = [0] * (cx + 1)\r\nfor l in range(cx + 1):\r\n cross[l] = [1] * (cx + 1)\r\nfor i in range(cy):\r\n a, b = map(int, input().split())\r\n cross[a][b] = cross[b][a] = 2\r\nx, v, i = 3 - cross[1][cx], [0] * (cx + 1), 1\r\nd = [cx + 1] * (cx + 1)\r\nt = d[1] = 0\r\n \r\nwhile i != cx:\r\n v[i] = 1\r\n for j in range(1, cx + 1):\r\n if v[j] == 0 and cross[i][j] == x and d[j] > d[i] + 1:\r\n d[j] = d[i] + 1\r\n m = cx + 1\r\n for j in range(1, cx + 1):\r\n if v[j] == 0 and d[j] < m:\r\n m = d[j]\r\n i = j\r\n if m == cx + 1:\r\n t = -1\r\n break\r\n elif i == cx:\r\n t = d[cx]\r\n break\r\n \r\nprint(t)\r\n", "n = m = None\r\ndistance = None\r\n\r\ndef entrypoint():\r\n global n, m, distance\r\n n, m = map(int, input().split())\r\n distance = [[1 for col in range(n + 1)] for row in range(n + 1)]\r\n for i in range(m):\r\n a, b = map(int, input().split())\r\n distance[a][b] = 2\r\n distance[b][a] = 2\r\n \r\ndef process():\r\n x = 3 - distance[1][n]\r\n res, i = 0, 1\r\n vis = [0] * (n + 1)\r\n d = [n + 1] * (n + 1)\r\n d[1] = 0\r\n \r\n while i != n:\r\n vis[i] = 1\r\n for j in range(1, n + 1):\r\n if vis[j] == 0 and distance[i][j] == x and d[j] > d[i] + 1:\r\n d[j] = d[i] + 1\r\n mine = n + 1\r\n for j in range(1, n + 1):\r\n if vis[j] == 0 and d[j] < mine:\r\n mine = d[j]\r\n i = j\r\n if mine == n + 1:\r\n res = -1\r\n break\r\n if i == n:\r\n res = d[n]\r\n break\r\n return res\r\n \r\ndef main():\r\n entrypoint()\r\n print(process())\r\n\r\nif __name__ == '__main__':\r\n main()", "from collections import defaultdict\r\nimport heapq\r\nn, m = map(int, input(\"\").split())\r\nrail_list = defaultdict(list)\r\n\r\nfor i in range(m):\r\n start, end = map(int, input(\"\").split())\r\n rail_list[start].append(end)\r\n rail_list[end].append(start)\r\n\r\ndef dijkstra_on_road():\r\n dist_road = {i: float('inf') for i in range(1, n + 1)}\r\n towns = set(range(1, n + 1))\r\n H_road = [(0, 1)]\r\n while len(H_road) != 0:\r\n curr_road_dist, curr_road_id = heapq.heappop(H_road)\r\n if curr_road_dist <= dist_road[curr_road_id]:\r\n road_neighbours = towns - set(rail_list[curr_road_id] + [curr_road_id])\r\n for road_neigbour_id in road_neighbours:\r\n new_road_distance = curr_road_dist + 1\r\n if new_road_distance < dist_road[road_neigbour_id]:\r\n dist_road[road_neigbour_id] = new_road_distance\r\n heapq.heappush(H_road, (new_road_distance, road_neigbour_id))\r\n\r\n return dist_road[n]\r\n\r\ndef dijkstra_on_rail():\r\n dist_rail = {i: float('inf') for i in range(1, n + 1)}\r\n H_rail = [(0, 1)]\r\n while len(H_rail) != 0:\r\n curr_rail_dist, curr_rail_id = heapq.heappop(H_rail)\r\n if curr_rail_dist <= dist_rail[curr_rail_id]:\r\n for rail_neighbour_id in rail_list[curr_rail_id]:\r\n new_rail_distance = curr_rail_dist + 1\r\n if new_rail_distance < dist_rail[rail_neighbour_id]:\r\n dist_rail[rail_neighbour_id] = new_rail_distance\r\n heapq.heappush(H_rail, (new_rail_distance, rail_neighbour_id))\r\n\r\n return dist_rail[n]\r\n\r\nif n in rail_list[1]:\r\n road_time = dijkstra_on_road()\r\n if road_time != float('inf'):\r\n print(road_time)\r\n else:\r\n print('-1')\r\nelse:\r\n rail_time = dijkstra_on_rail()\r\n if rail_time != float('inf'):\r\n print(rail_time)\r\n else:\r\n print('-1')\r\n\r\n\r\n\r\n\r\n", "def bfs(g,n):\r\n q=[1]\r\n vis=[1 for x in range(n+1)]\r\n dis=[0 for x in range(n+1)]\r\n while len(q):\r\n cur=q[0]\r\n q.remove(cur)\r\n for i in g[cur]:\r\n if vis[i]:\r\n q.append(i)\r\n vis[i]=0\r\n dis[i]=dis[cur]+1\r\n if i==n:\r\n return dis[n]\r\n return -1\r\n\r\n[n,m]=[int(x) for x in input().split()]\r\nrailway=[[] for x in range(n+1)]\r\nroad=[[] for x in range(n+1)]\r\nfor i in range(m):\r\n [a,b]=[int(x) for x in input().split()]\r\n railway[a].append(b)\r\n railway[b].append(a)\r\nfor i in range(1,n+1):\r\n for j in range(i+1,n+1):\r\n if j not in railway[i]:\r\n road[i].append(j)\r\n road[j].append(i)\r\nif n in railway[1]:\r\n print(bfs(road,n))\r\nelse:\r\n print(bfs(railway,n))", "import sys \r\nfrom collections import defaultdict\r\nfrom math import inf\r\ninput = sys.stdin.readline \r\n\r\ndef short(d, n):\r\n v = [0] * (n + 1)\r\n dist = [0] * (n + 1)\r\n v[1] = 1\r\n q = [1]\r\n while(q != []):\r\n a = q.pop(0)\r\n for i in d[a]:\r\n if(not v[i]):\r\n v[i] = 1 \r\n q.append(i)\r\n dist[i] = 1 + dist[a]\r\n if(dist[n] == 0):\r\n return -1 \r\n else:\r\n return dist[n]\r\n \r\n\r\nn, m = map(int, input().split())\r\ndt = defaultdict(list)\r\ndb = defaultdict(list)\r\nfor i in range(m):\r\n u, v = map(int, input().split()) \r\n dt[u].append(v)\r\n dt[v].append(u)\r\nfor i in range(1, n):\r\n for j in range(i + 1, n + 1):\r\n if(j not in dt[i]):\r\n db[i].append(j)\r\n db[j].append(i)\r\n# print(db, dt)\r\nd1 = short(dt, n)\r\nd2 = short(db, n)\r\nif(d1 == -1 or d2 == -1):\r\n print(-1)\r\nelse:\r\n print(max(d1, d2))\r\n", "import sys\r\ninput = lambda: sys.stdin.readline().rstrip()\r\nfrom collections import deque\r\n\r\nN,M = map(int, input().split())\r\nP = [[0]*N for _ in range(N)]\r\n\r\nfor _ in range(M):\r\n u,v = map(int, input().split())\r\n u-=1;v-=1\r\n P[u][v] = 1\r\n P[v][u] = 1\r\n\r\nfor i in range(N):\r\n P[i][i] = -1\r\n\r\nseen = [-1]*N\r\nif P[0][N-1]==1:\r\n # road\r\n v = deque([(0,0)])\r\n while v:\r\n i,d = v.popleft()\r\n if seen[i]>=0:continue\r\n \r\n seen[i] = d\r\n for j in range(N):\r\n if P[i][j]==0 and seen[j]==-1:\r\n v.append((j,d+1))\r\nelse:\r\n v = deque([(0,0)])\r\n while v:\r\n i,d = v.popleft()\r\n if seen[i]>=0:continue\r\n \r\n seen[i] = d\r\n for j in range(N):\r\n if P[i][j]==1 and seen[j]==-1:\r\n v.append((j,d+1))\r\n \r\nprint(seen[-1])\r\n", "n, m = map(int, input().split())\n\nlen = n + 1\n\nlist_s = [[0] * len for i in range(len)]\n\nfor _ in range(m):\n u, v = map(int, input().split())\n list_s[u][v] = list_s[v][u] = 1\n \nd_town = [-1] * len\nd_town[1] = 0\nlist_pop = [1]\nwhile list_pop:\n u = list_pop.pop(0)\n for v in range(1, len):\n if list_s[u][v] != list_s[1][n] and d_town[v] == -1:\n d_town[v] = d_town[u] + 1\n list_pop.append(v)\nprint(d_town[n])\n \n \n \t\t\t \t \t \t \t\t\t\t\t \t\t", "from collections import deque\r\n\r\nfrom collections import deque\r\n\r\ndef bfs(grafo, start, end):\r\n fila = deque()\r\n fila.append(start)\r\n dis = 0\r\n visitados = set() # Para evitar visitar o mesmo nó mais de uma vez\r\n\r\n while fila:\r\n tamanho_fila = len(fila)\r\n for _ in range(tamanho_fila):\r\n no = fila.popleft()\r\n\r\n if no == end:\r\n return dis\r\n\r\n for viz in grafo[no]:\r\n if viz not in visitados:\r\n visitados.add(viz)\r\n fila.append(viz)\r\n\r\n dis += 1\r\n\r\n return -1\r\n\r\nn_vert, n_ares = map(int,input().split())\r\n\r\ngrafo_trem = []\r\ngrafo_onibus = []\r\nfor i in range(n_vert):\r\n grafo_trem.append([])\r\n grafo_onibus.append([])\r\n\r\n\r\n\r\nfor _ in range(n_ares):\r\n v1,v2 = map(int,input().split())\r\n grafo_trem[v1 - 1].append(v2 - 1)\r\n grafo_trem[v2 - 1].append(v1 - 1)\r\n\r\nfor i in range(n_vert):\r\n for j in range(n_vert):\r\n if i != j and j not in grafo_trem[i]:\r\n grafo_onibus[i].append(j)\r\n\r\n\r\n# print(grafo_trem)\r\n# print(grafo_onibus)\r\n\r\nshortest_distances = bfs(grafo_trem,0, n_vert-1)\r\ns = bfs(grafo_onibus,0, n_vert-1)\r\nif shortest_distances == -1 or s == -1:\r\n print(-1)\r\nelse:\r\n print(max(s,shortest_distances))", "n, m = map(int,input().split())\r\n \r\ngraph_matrix = []\r\n\r\nfor i in range(n):\r\n graph_matrix.append([0] * n)\r\n \r\nfor i in range(m):\r\n u, v = map(int,input().split())\r\n graph_matrix[u-1][v-1] = graph_matrix[v-1][u-1] = 1\r\n \r\ndistances = [-1] * n\r\ndistances[0] = 0\r\nqueue = [0]\r\n \r\nwhile queue:\r\n aux = queue.pop(0)\r\n\r\n for i in range(n):\r\n if graph_matrix[aux][i] != graph_matrix[0][n-1] and distances[i] == -1:\r\n distances[i] = distances[aux]+1\r\n queue.append(i)\r\n \r\nprint(distances[n-1])", "from collections import deque\r\n\r\nn, r = [int(i) for i in input().split()]\r\nrails = set()\r\n\r\nfor _ in range(r):\r\n rails.add(tuple(int(i) for i in input().split()))\r\n \r\nroad = [set() for _ in range(n + 1)]\r\nrail = [set() for _ in range(n + 1)]\r\n\r\nfor n1 in range(1, n + 1):\r\n for n2 in range(n1 + 1, n + 1):\r\n if (n1, n2) in rails or (n2, n1) in rails:\r\n rail[n1].add(n2)\r\n rail[n2].add(n1)\r\n else:\r\n road[n1].add(n2)\r\n road[n2].add(n1)\r\n\r\ndef getTime(graph):\r\n q = deque([(1, 0)])\r\n seen = {1}\r\n \r\n while q:\r\n node, time = q.popleft()\r\n \r\n if node == n:\r\n return time\r\n \r\n for ngh in graph[node]:\r\n if ngh not in seen:\r\n q.append((ngh, time + 1))\r\n seen.add(ngh)\r\n \r\n return -1\r\n\r\nif n in road[1]:\r\n print(getTime(rail))\r\n\r\nelse:\r\n print(getTime(road))\r\n", "def main():\n n, m = map(int, input().split())\n vrtxs = [[False] * n for _ in range(n)]\n for _ in range(m):\n u, v = map(int, input().split())\n u -= 1\n v -= 1\n vrtxs[u][v] = vrtxs[v][u] = True\n if vrtxs[0][n - 1]:\n for u, l in enumerate(vrtxs):\n for v, f in enumerate(l):\n l[v] = not f\n l[u] = False\n avail, nxt, t = [True] * n, [n - 1], 0\n while nxt:\n cur, nxt = nxt, []\n t += 1\n for u in cur:\n for v, f, a in zip(range(n), vrtxs[u], avail):\n if f and a:\n if not v:\n print(t)\n return\n avail[v] = False\n nxt.append(v)\n print(-1)\n\n\nif __name__ == '__main__':\n main()\n", "from collections import defaultdict,deque\r\nn , m = [int(x) for x in input().split()]\r\n\r\ndef bfs(graph,n):\r\n \r\n level = deque([])\r\n \r\n level.append(1)\r\n visited = set()\r\n \r\n count =0\r\n while level:\r\n length = len(level)\r\n for _ in range(length):\r\n value = level.popleft()\r\n for val in graph[value]:\r\n if val ==n:\r\n return count+1\r\n if val not in visited:\r\n visited.add(val)\r\n level.append(val)\r\n count +=1\r\n return -1\r\ngraph1 = defaultdict(set)\r\n\r\ngraph2 = defaultdict(set)\r\n\r\nfor _ in range(m):\r\n x,y = [int(x) for x in input().split()]\r\n \r\n graph1[y].add(x)\r\n graph1[x].add(y)\r\nfor i in range(1,n+1):\r\n for j in range(1,n+1):\r\n if i!=j and i not in graph1[j]:\r\n graph2[i].add(j)\r\n graph2[j].add(i)\r\n# print(graph2)\r\n# print(graph1)\r\n\r\nvalue = bfs(graph1,n)\r\n\r\nvalue2 =bfs(graph2,n)\r\n\r\nif value2==-1 or value==-1:\r\n print(-1)\r\nelse:\r\n print(max(value,value2))", "from collections import deque\r\n\r\nUNDEF = float('inf')\r\n\r\nnV, nE = map(int, input().split())\r\ng = [[] for _ in range(nV)]\r\nfor _ in range(nE):\r\n u, v = map(lambda x: int(x) - 1, input().split())\r\n g[u].append(v)\r\n g[v].append(u)\r\ng1 = [[] for _ in range(nV)]\r\nfor v in range(nV):\r\n for u in range(v + 1, nV):\r\n if u not in g[v]:\r\n g1[u].append(v)\r\n g1[v].append(u)\r\n\r\ndef bfs(g):\r\n q = deque([0])\r\n dist = [0] + [UNDEF] * (nV - 1)\r\n while q:\r\n v = q.pop()\r\n for to in g[v]:\r\n if dist[to] == UNDEF:\r\n dist[to] = dist[v] + 1\r\n q.appendleft(to)\r\n return dist[nV - 1]\r\n\r\ndist = (bfs(g), bfs(g1))\r\nif UNDEF in dist:\r\n print(-1)\r\nelse:\r\n print(max(dist))", "import sys\r\ninput = lambda: sys.stdin.readline().strip()\r\nimport heapq\r\ndef dijekstra_(l):\r\n pq=[(0,0)]\r\n heapq.heapify(pq)\r\n wei=[0]+[float(\"inf\")]*(n-1)\r\n while pq:\r\n d,u=heapq.heappop(pq)\r\n for node,weight in l[u]:\r\n if wei[node]>d+weight:\r\n wei[node]=d+weight\r\n heapq.heappush(pq, (wei[node], node))\r\n return wei[-1]\r\nn,m=map(int,input().split())\r\nc=0\r\nl=[[] for i in range(n)]\r\nfor _ in range(m):\r\n u,v=map(int,input().split())\r\n if (u,v)==(1,n) or (u,v)==(n,1):\r\n c=1 \r\n l[u-1].append((v-1,1))\r\n l[v-1].append((u-1,1))\r\nif c==1: \r\n q=[[] for i in range(n)]\r\n for i in range(n): \r\n for ii in range(n):\r\n if ii!=i:\r\n if (ii,1) not in l[i]:\r\n q[i].append((ii,1))\r\n z=dijekstra_(q)\r\nelse:\r\n z=dijekstra_(l)\r\nif z==float(\"inf\"): print(-1)\r\nelse: print(max(z,1))", "import collections\r\ndef bfs(graph, root):\r\n global n\r\n visited, queue = set(), collections.deque([root])\r\n visited.add(root)\r\n while queue: \r\n vertex = queue.popleft()\r\n for neighbour in graph[vertex]: \r\n if neighbour not in visited:\r\n visited.add(neighbour)\r\n p[neighbour]=p[vertex]+1\r\n queue.append(neighbour)\r\nn,m=map(int,input().split())\r\np=[0]*(n)\r\nlis=[[] for i in range (n)]\r\nfor i in range (m):\r\n x,y=map(int,input().split())\r\n lis[x-1].append(y-1)\r\n lis[y-1].append(x-1)\r\nlis1=[[] for i in range (n)]\r\nfor i in range (n):\r\n for j in range (n):\r\n if j not in lis[i] and j!=i:\r\n lis1[i].append(j)\r\nbfs(lis, 0)\r\ns=p[-1]\r\np=[0]*(n)\r\nbfs(lis1, 0)\r\nif min(p[-1],s)==0:\r\n print (-1)\r\nelse:\r\n print (max(p[-1],s))\r\n", "n, m = list(map(int,input().split()))\r\ncar = {}\r\ntrain = {}\r\nfor i in range(n):\r\n train[i + 1] = []\r\n mass = []\r\n for j in range(n):\r\n if i != j:\r\n mass.append(j + 1)\r\n car[i + 1] = mass\r\nfor i in range(m):\r\n a, b = list(map(int,input().split()))\r\n train[a].append(b)\r\n train[b].append(a)\r\n car[a].remove(b)\r\n car[b].remove(a)\r\ndl1 = [0 for _ in range(n + 1)]\r\nused1 = [False for _ in range(n + 1)]\r\nused1[1] = True\r\nq1 = [1]\r\n\r\ndl2 = [0 for _ in range(n + 1)]\r\nused2 = [False for _ in range(n + 1)]\r\nused2[1] = True\r\nq2 = [1]\r\nwhile len(q1) > 0 or len(q2) > 0:\r\n if len(q1) > 0 and len(q2) > 0:\r\n v1 = q1[0]\r\n v2 = q2[0]\r\n q1.pop(0)\r\n q2.pop(0)\r\n tr = []\r\n for u in train[v1]:\r\n if used1[u] == False:\r\n used1[u] = True\r\n dl1[u] = dl1[v1] + 1\r\n q1.append(u)\r\n tr.append(u)\r\n for u in car[v2]:\r\n if used2[u] == False:\r\n used2[u] = True\r\n dl2[u] = dl2[v2] + 1\r\n q2.append(u)\r\n if u in tr :\r\n if dl2[u] % 2 != 0:\r\n dl2[u] += 1\r\n else:\r\n dl1[u] += 1\r\n elif len(q1) > 0:\r\n v1 = q1[0]\r\n q1.pop(0)\r\n for u in train[v1]:\r\n if used1[u] == False:\r\n used1[u] = True\r\n dl1[u] = dl1[v1] + 1\r\n q1.append(u)\r\n elif len(q2) > 0:\r\n v2 = q2[0]\r\n q2.pop(0)\r\n for u in car[v2]:\r\n if used2[u] == False:\r\n used2[u] = True\r\n dl2[u] = dl2[v2] + 1\r\n q2.append(u)\r\n\r\nif dl1[-1] == 0 or dl2[-1] == 0:\r\n print(-1)\r\nelse:\r\n print(max(dl1[-1], dl2[-1]))\r\n\r\n", "from heapq import *\r\nmaxn=10**3\r\nn,m=map(int,input().split())\r\ndef dijkstra(ed):\r\n\tpq=[]\r\n\tpq.append([0,1])\r\n\tdist=[10**12]*maxn\r\n\tpre=[0]*maxn\r\n\tdist[1]=0\r\n\tpre[1]=-1\r\n\twhile (len(pq)):\r\n\t\ts=pq[0][1]\r\n\t\theappop(pq)\r\n\t\tfor j in ed[s]:\r\n\t\t\tif dist[j[0]]>dist[s]+j[1]:\r\n\t\t\t\tdist[j[0]]=dist[s]+j[1]\r\n\t\t\t\tpre[j[0]]=s\r\n\t\t\t\theappush(pq,(dist[j[0]],j[0]))\r\n\tif (dist[n]==10**12):\r\n\t\tprint(-1)\r\n\t\texit()\r\n\treturn dist[n]\r\nedges=[[]for i in range(maxn)]\r\nedges1=[[]for i in range(maxn)]\r\ndit={}\r\nfor i in range(m):\r\n\tu,v=map(int,input().split())\r\n\tedges[u].append((v,1))\r\n\tedges[v].append((u,1))\r\n\tdit[(u,v)]=1\r\n\tdit[(v,u)]=1\r\nfor i in range(1,n+1):\r\n\tfor j in range(i+1,n+1):\r\n\t\tif (i,j) not in dit:\r\n\t\t\tedges1[i].append((j,1))\r\n\t\t\tedges1[j].append((i,1))\r\nans=dijkstra(edges)\r\nans=max(ans,dijkstra(edges1))\r\nprint(ans)", "n, m = map(int, input().split())\r\nadjacency_matrix = [[0] * n for _ in range(n)]\r\nfor _ in range(m):\r\n u, v = map(int, input().split())\r\n adjacency_matrix[u - 1][v - 1] = adjacency_matrix[v - 1][u - 1] = 1\r\nvisited = [-1] * n\r\nvisited[0] = 0\r\nqueue = [0]\r\nwhile queue:\r\n current_city = queue.pop(0)\r\n for city in range(n):\r\n if adjacency_matrix[current_city][city] != adjacency_matrix[0][n - 1] and visited[city] == -1:\r\n visited[city] = visited[current_city] + 1\r\n queue.append(city)\r\nprint(visited[n - 1])# 1698133910.1029449", "from queue import Queue\nimport sys\n\nif __name__ == \"__main__\":\n\n def bfs(flag):\n vis = set()\n vis |= {1}\n q = Queue()\n q.put((1, 0))\n\n while not q.empty():\n u, dis = q.get()\n for v in range(1, n+1):\n if (v not in vis) and (((u, v) in h) == flag):\n vis |= {v}\n q.put((v, dis+1))\n if v == n:\n return dis+1\n return -1\n\n n, m = map(int, input().split())\n\n h = set()\n for _ in range(0, m):\n x, y = map(int, input().split())\n h |= {(x, y)}\n h |= {(y, x)}\n dist1 = bfs(True)\n dist2 = bfs(False)\n # print(dist1, dist2)\n if dist1 == -1 or dist2 == -1:\n print(-1)\n else:\n print(max(dist1, dist2))\n\t\t\t\t \t \t\t\t \t\t \t\t\t\t \t", "import sys\r\nfrom collections import defaultdict, deque\r\ninput = sys.stdin.readline\r\ndf = defaultdict(set)\r\nn, m = list(map(int, input().split()))\r\n\r\nfor _ in range(m):\r\n u, v = list(map(int, input().split()))\r\n df[u].add(v)\r\n df[v].add(u)\r\n\r\nuniversal = set(range(1, n+1))\r\n# 1 bus\r\n# 0 train\r\nq = deque([(1, 0, 0), (1, 1, 0)])\r\nvehicles = [float('inf'), float('inf')]\r\nbusVisited = set([1])\r\ntrainVisited = set([1])\r\n\r\nwhile q:\r\n u, vehicle, distance = q.popleft()\r\n if u == n:\r\n vehicles[vehicle] = min(vehicles[vehicle],distance)\r\n continue\r\n if vehicle == 0:\r\n for v in df[u]:\r\n if v not in trainVisited:\r\n q.append((v, vehicle, distance+1))\r\n trainVisited.add(v)\r\n else:\r\n for v in universal.difference(df[u]):\r\n if v not in busVisited:\r\n q.append((v, vehicle, distance+1))\r\n busVisited.add(v)\r\nif float('inf') in vehicles:\r\n print(-1)\r\nelse:\r\n print(max(vehicles))\r\n", "def BFS(n, V, start):\r\n D = [None] * (n + 1)\r\n D[start] = 0\r\n Q = [start]\r\n Qstart = 0\r\n while Qstart < len(Q):\r\n u = Q[Qstart]\r\n Qstart += 1\r\n for v in V[u] :\r\n if D[v] is None :\r\n D[v] = D[u] + 1\r\n Q.append(v)\r\n return D\r\n\r\nn, m = map(int, input().split())\r\nZd = [list() for i in range(n+1)]\r\nzhd = 0\r\navto = 0\r\nfor i in range(m):\r\n u, v = map(int, input().split())\r\n Zd[u].append(v)\r\n Zd[v].append(u)\r\n# for row in V:\r\n# print(*row)\r\nAv = [list() for i in range(n+1)]\r\nfor i in range(len(Zd)):\r\n for j in range(1, n+1):\r\n if j not in Zd[i]:\r\n Av[i].append(j)\r\n# print(BFS(n, Av, 1)[n], BFS(n, Zd, 1)[n])\r\nif n in Zd[1]:\r\n zhd = 1\r\n avto = BFS(n, Av, 1)[n]\r\nelse:\r\n avto = 1\r\n zhd = BFS(n, Zd, 1)[n]\r\nif zhd is None or avto is None:\r\n print(-1)\r\nelse:\r\n print(max(zhd, avto))\r\n\r\n\r\n\r\n\n# Tue Jul 12 2022 20:26:14 GMT+0000 (Coordinated Universal Time)\n", "n, m = map(int,input().split())\r\nrails = [set() for u in range(n+1)]\r\nfor i in range(m):\r\n\tu, v = map(int,input().split())\r\n\trails[u].add(v)\r\n\trails[v].add(u)\r\n\r\nroads = [set() for u in range(n+1)]\r\nfor u in range(1,n+1):\r\n\tfor v in range(u+1,n+1):\r\n\t\tif u not in rails[v]:\r\n\t\t\troads[u].add(v)\r\n\t\t\troads[v].add(u)\r\n\r\ndef bfs(n,adj):\r\n\t# returns shortest dist from 1 to n\r\n\tdist = [-1 for i in range(n+1)]\r\n\tvis = [False for i in range(n+1)]\r\n\r\n\tfrontier = [1]\r\n\tdist[1] = 0\r\n\tptr = 0\r\n\r\n\twhile ptr < len(frontier):\r\n\t\tu = frontier[ptr]\r\n\t\tif u==n:\r\n\t\t\treturn dist[u]\r\n\r\n\t\tif not vis[u]:\r\n\t\t\tvis[u] = True\r\n\t\t\tfor v in adj[u]:\r\n\t\t\t\tif dist[v]==-1:\r\n\t\t\t\t\tdist[v] = dist[u] + 1\r\n\t\t\t\t\tfrontier.append(v)\r\n\t\tptr += 1\r\n\r\n\t# we never reached n\r\n\treturn -1\r\n\r\nans1, ans2 = bfs(n,rails), bfs(n,roads)\r\nif ans1==-1 or ans2==-1:\r\n\tprint(-1)\r\nelse:\r\n\tprint(max(ans1,ans2))\r\n", "from collections import deque\r\nn,m=map(int,input().split())\r\nd={}\r\nfor i in range(m):\r\n u,v=map(int,input().split())\r\n u-=1\r\n v-=1\r\n d[str(u)+\" \"+str(v)]=1\r\n d[str(v) + \" \" + str(u)] = 1\r\nbus=[]\r\ntrain=[]\r\nfor i in range(n):\r\n bus.append([i,500])\r\n train.append([i,500])\r\nbus[-1][1]=0\r\ntrain[-1][1]=0\r\nq=deque()\r\nq.append(n-1)\r\nvis=[False]*n\r\nwhile q:\r\n if bus[0][0]!=0:\r\n break\r\n s=q.popleft()\r\n vis[s]=True\r\n for i in range(n):\r\n if str(i)+\" \"+str(s) not in d and vis[i]==False:\r\n q.append(i)\r\n bus[i][0]=n-1\r\n bus[i][1]=min(bus[i][1],1+bus[s][1])\r\nvis=[False]*n\r\nq=deque()\r\nq.append(n-1)\r\nwhile q:\r\n if train[0][0]!=0:\r\n break\r\n s=q.popleft()\r\n vis[s]=True\r\n for i in range(n):\r\n if str(i)+\" \"+str(s) in d and vis[i]==False:\r\n q.append(i)\r\n train[i][0]=n-1\r\n train[i][1]=min(train[i][1],1+train[s][1])\r\nif train[0][0]==0 or bus[0][0]==0:\r\n print(-1)\r\nelse:\r\n print(max(train[0][1],bus[0][1]))", "from heapq import *\r\n\r\ndef short(v, g, u, d):\r\n heap = []\r\n u[v] = True\r\n d[0] = 0\r\n heappush(heap, (0, v))\r\n while heap:\r\n w, v = heappop(heap)\r\n u[v] = True\r\n heap.clear()\r\n for i in g[v]:\r\n if not u[i[0]]:\r\n if w + i[1] < d[i[0]]:\r\n d[i[0]] = w + i[1]\r\n heappush(heap, (d[i[0]], i[0]))\r\n\r\ndef bfs(v, g, u, d):\r\n l = 0\r\n u[v] = True\r\n q = [(v, 0)]\r\n while q:\r\n v, l = q.pop(0)\r\n for i in g[v]:\r\n if not u[i]:\r\n q.append((i, l+1))\r\n u[i] = True\r\n d[i] = l + 1\r\n\r\nif __name__ == \"__main__\":\r\n n, m = map(int, input().split())\r\n a = {}\r\n b = {}\r\n for i in range(n):\r\n a[i] = [int(x) for x in range(n)]\r\n b[i] = []\r\n for i in range(m):\r\n u, v = map(int, input().split())\r\n b[u - 1].append(v - 1)\r\n b[v - 1].append(u - 1)\r\n a[u - 1].remove(v - 1)\r\n a[v - 1].remove(u - 1)\r\n u_a = [False] * n\r\n u_b = [False] * n\r\n d_a = [500000] * n\r\n d_b = [500000] * n\r\n bfs(0, a, u_a, d_a)\r\n bfs(0, b, u_b, d_b)\r\n if (d_a[n - 1] == 500000 or d_b[n - 1] == 500000):\r\n print(-1)\r\n else:\r\n print(max(d_a[n - 1], d_b[n - 1]))", "from collections import deque\n\ndef initialize():\n g = {}\n for i in range(1,n+1):\n g[i] = {}\n return g\n\ndef bfs(u,n,graph):\n q = deque()\n visited = set()\n parent = {}\n q.append(u)\n foundEndNode = False\n while len(q) > 0:\n v = q.popleft()\n visited.add(v)\n if v == n: \n foundEndNode = True\n break\n for neighbor in graph[v]:\n if neighbor not in visited:\n q.append(neighbor)\n visited.add(neighbor)\n parent[neighbor] = v \n if foundEndNode:\n path = []\n currentNode = n\n while currentNode != u:\n path.append(currentNode)\n currentNode = parent[currentNode]\n path.append(u)\n return path \n else:\n return []\n\nn,m = map(int,input().split())\ntrainGraph = initialize()\nbusGraph = initialize()\nfor _ in range(m):\n a,b = map(int,input().split())\n trainGraph[a][b] = 1\n trainGraph[b][a] = 1\nfor i in range(1,n+1):\n for j in range(1,n+1):\n if i!=j and j not in trainGraph[i]:\n busGraph[i][j] = 1\n busGraph[j][i] = 1\nbfsTrain = bfs(1,n,trainGraph)\nbfsBus = bfs(1,n,busGraph)\nif len(bfsTrain) == 0 or len(bfsBus) == 0:\n print(-1)\nelse:\n distA,distB = len(bfsTrain) -1 , len(bfsBus) - 1\n print(max(distA,distB))\n\t \t \t \t \t\t \t\t \t \t\t \t\t \t\t", "\r\nn,m = map(int,input().split())\r\n\r\ngraphrail = [[] for i in range(n)]\r\ngraphroad = [[] for i in range(n)]\r\n\r\ndic = [[0]*(n) for i in range(n)]\r\n\r\ndef bfs(graph,s):\r\n level = {s+1:0}\r\n front = [s+1]\r\n i = 1\r\n while front:\r\n next = []\r\n for u in front:\r\n for v in graph[u-1]:\r\n if v not in level:\r\n level[v] = i\r\n next.append(v)\r\n front = next\r\n i+=1\r\n #print(level)\r\n if n in level:\r\n return level[n]\r\n else:\r\n return -1\r\n\r\nfor i in range(m):\r\n x,y = map(int,input().strip().split())\r\n dic[x-1][y-1] = 1\r\n dic[y-1][x-1] = 1\r\n graphrail[x-1].append(y)\r\n graphrail[y-1].append(x)\r\n\r\n\r\nfor i in range(n):\r\n for j in range(n):\r\n if dic[i][j] == 0 and i!=j:\r\n graphroad[i].append(j+1)\r\n\r\n\r\n#print(graphroad)\r\n#print(graphrail)\r\nx = bfs(graphroad,0)\r\ny = bfs(graphrail,0)\r\n\r\nif x == -1 or y == -1:\r\n print(-1)\r\nelse:\r\n print(max(x,y))\r\n", "from collections import deque\r\ndef put():\r\n return map(int, input().split())\r\n\r\ndef bfs(c):\r\n q = deque()\r\n q.append(1)\r\n vis[1]=0\r\n while q:\r\n i = q.popleft()\r\n for j in range(1, n+1):\r\n if graph[i][j]==c and vis[j]==-1:\r\n q.append(j)\r\n vis[j]=vis[i]+1\r\n print(vis[n])\r\n\r\n\r\n\r\nn,m = put()\r\ngraph = [ [0]*(n+1) for _ in range(n+1)]\r\nvis = [-1]*(n+1)\r\nfor _ in range(m):\r\n x,y = put()\r\n graph[x][y]=1\r\n graph[y][x]=1\r\n\r\nc = 1-graph[1][n]\r\nbfs(c)", "from collections import defaultdict\r\nclass graph_maker:\r\n def __init__(self,n):\r\n self.matrix = [[0 for _ in range(n)] for i in range(n)]\r\n \r\n def add_edge (self,u,v):\r\n self.matrix[u][v] = 1\r\n self.matrix[v][u] = 1\r\n \r\n \r\ndef dijkstra(n,graph):\r\n for i in range(n):\r\n graph[i][i] = -1 #removing all the self loops\r\n \r\n path = defaultdict(int) \r\n infinite = float('inf') \r\n visited = [True]*n\r\n dist = [infinite]*(n-1)\r\n dist = [0] + dist\r\n \r\n if graph[n-1][0] == 1: #checking that is train is connected to Town n\r\n while True:\r\n min_dist = min(dist)\r\n ind = dist.index(min_dist)\r\n #checking for path of bus\r\n if min_dist != infinite:\r\n if visited[ind]:\r\n visited[ind] = False\r\n for i in range(n):\r\n if visited[i]:\r\n if graph[ind][i] == 0:\r\n mi = min_dist + 1\r\n if mi<dist[i]:\r\n dist[i] = mi\r\n path[i] = mi\r\n dist[ind] = infinite\r\n else:\r\n break\r\n if visited[n-1]:\r\n return -1\r\n return path[n-1] \r\n else:\r\n while True:\r\n min_dist = min(dist)\r\n ind = dist.index(min_dist) #checking for path of train\r\n \r\n if min_dist != infinite:\r\n if visited[ind]:\r\n visited[ind] = False\r\n for i in range(n):\r\n if visited[i]:\r\n if graph[ind][i] != 0:\r\n mi = min_dist + 1\r\n if mi<dist[i]:\r\n dist[i] = mi\r\n path[i] = mi\r\n dist[ind] = infinite\r\n else:\r\n break\r\n if visited[n-1]:\r\n return -1\r\n return path[n-1]\r\n \r\n \r\nif __name__ == \"__main__\":\r\n n,m = map(int,input().split())\r\n graph = graph_maker(n)\r\n for _ in range(m):\r\n u,v = map(int,input().split())\r\n graph.add_edge(u-1,v-1)\r\n pa = dijkstra(n,graph.matrix)\r\n print(pa)", "n, m = map(int, input().split())\r\nk = n + 1\r\n \r\npos = [[0] * k for _ in range(k)]\r\n\r\ndis = [-1] * k\r\ndis[1] = 0\r\naux = [1]\r\n\r\nfor _ in range(m):\r\n u, v = map(int, input().split())\r\n pos[u][v] = pos[v][u] = 1\r\n \r\nwhile aux:\r\n u = aux.pop(0)\r\n \r\n for v in range(1, k):\r\n \r\n if pos[u][v] != pos[1][n] and dis[v] == -1:\r\n dis[v] = dis[u] + 1\r\n aux.append(v)\r\n\r\nres = dis[n]\r\nprint(res)", "from collections import deque\n[n,m]=[int(i) for i in input().split()]\nroutes=[set() for i in range(n+1)]\nfor i in range(m):\n [x,y]=[int(j) for j in input().split()]\n routes[x].add(y)\n routes[y].add(x)\nif n not in routes[1]:\n a=True\nelse:\n a=False\nway=deque()\nway.append(1)\nb=[-1 for i in range(n+1)]\nb[1]=0\nwhile len(way)>0:\n c=way.popleft()\n for i in range(1,n+1):\n if a^(i in routes[c]):\n continue\n if b[i]==-1:\n b[i]=b[c]+1\n way.append(i)\n if i==n:\n print(b[i])\n exit(0)\nprint(-1)", "n, m=map(int,input().split())\r\ng=[[] for i in range(n+1)]\r\nfor i in range(m):\r\n a, b=map(int,input().split())\r\n g[a].append(b)\r\n g[b].append(a)\r\n\r\nif n not in g[1]:\r\n l=[1]\r\n df=[-1 for i in range(n+1)]\r\n df[1]=0\r\n while len(l)>=1:\r\n t=l[0]\r\n del(l[0])\r\n for i in g[t]:\r\n if df[i]==-1 or df[i]>df[t]+1:\r\n df[i]=df[t]+1\r\n l.append(i)\r\n print(df[n])\r\n exit()\r\nelse:\r\n arr=[[] for i in range(n+1)]\r\n for i in range(1,n+1):\r\n g[i].append(0)\r\n g[i].append(n+1)\r\n ttt=sorted(g[i])\r\n for j in range(len(ttt)-1):\r\n for v in range(ttt[j]+1,ttt[j+1]):\r\n if v!=i:\r\n arr[i].append(v)\r\n l=[1]\r\n df=[-1 for i in range(n+1)]\r\n df[1]=0\r\n while len(l)>=1:\r\n t=l[0]\r\n del(l[0])\r\n for i in arr[t]:\r\n if df[i]==-1 or df[i]>df[t]+1:\r\n df[i]=df[t]+1\r\n l.append(i)\r\n print(df[n])\r\n exit()\n# Tue Jul 12 2022 06:44:58 GMT+0000 (Coordinated Universal Time)\n", "from collections import deque\r\n\r\n\r\nn, m = map(int, input().split())\r\ne = [[0] * (n + 1) for i in range(n + 1)]\r\nfor i in range(m):\r\n\tu, v = map(int, input().split())\r\n\te[u][v] = 1\r\n\te[v][u] = 1\r\n\r\n\r\nvis = [0] * (n + 1)\r\nvis[1] = 1\r\ndis = [0] * (n + 1)\r\nq = deque([1])\r\nwhile q:\r\n\tcur = q.popleft()\r\n\tfor to in filter(lambda x: e[cur][x], range(1, n + 1)):\r\n\t\tif not vis[to]:\r\n\t\t\tvis[to] = 1\r\n\t\t\tdis[to] = dis[cur] + 1\r\n\t\t\tq.append(to)\r\n\t\t\tif to == n:\r\n\t\t\t\tq.clear()\r\n\t\t\t\tbreak\r\nd1 = dis[n]\r\n\r\nvis = [0] * (n + 1)\r\nvis[1] = 1\r\ndis = [0] * (n + 1)\r\nq = deque([1])\r\nwhile q:\r\n\tcur = q.popleft()\r\n\tfor to in filter(lambda x: not e[cur][x], range(1, n + 1)):\r\n\t\tif not vis[to] and to != cur:\r\n\t\t\tvis[to] = 1\r\n\t\t\tdis[to] = dis[cur] + 1\r\n\t\t\tq.append(to)\r\n\t\t\tif to == n:\r\n\t\t\t\tq.clear()\r\n\t\t\t\tbreak\r\nd2 = dis[n]\r\nif d1 == 0 or d2 == 0:\r\n\tprint(-1)\r\nelse:\r\n\tprint(max(d1, d2))\r\n", "import math\nfrom collections import deque\n\n\nd = {}\n\n\ndef dfs(g, u, step):\n d[u] = step\n for v in g[u]:\n if v not in d or d[v] > step + 1:\n dfs(g, v, step + 1)\n\n\ndef main():\n n, m = map(int, input().split())\n g = []\n gg = []\n for _ in range(n):\n g.append([])\n gg.append([])\n for _ in range(m):\n u, v = map(lambda x: int(x) - 1, input().split())\n g[u].append(v)\n g[v].append(u)\n for i in range(n):\n for j in range(n):\n if i != j and j not in g[i]:\n gg[i].append(j)\n dfs(g, 0, 0)\n global d\n a1 = -1\n if n-1 in d:\n a1 = d[n-1]\n d = {}\n dfs(gg, 0, 0)\n a2 = -1\n if n-1 in d:\n a2 = d[n-1]\n if a1 < 0 or a2 < 0:\n print(-1)\n else:\n print(max(a1, a2))\n\n\nmain()", "from collections import deque\n\ndef bfs(v,aux):\n q = deque()\n visited[v] = True\n q.append(v)\n while q:\n v = q.popleft()\n if v == n:\n break\n\n for u in range(1,len(graph)):\n if not visited[u] and graph[v][u] == aux:\n visited[u] = True\n q.append(u)\n dist[u] = dist[v] + 1\n \n\nn,m = map(int,input().split())\n\ngraph = [[-1]*(n+1) for _ in range(n+1)]\ndist = [0] * (n+1)\nvisited = [False] * (n+1)\n\nfor _ in range(m):\n u,v = map(int,input().split())\n graph[u][v] = 1\n graph[v][u] = 1\n\nif graph[1][n] == -1: \n aux = 1\nelse:\n aux = -1 \n\nbfs(1,aux)\nif dist[n] == 0:\n print(-1)\nelse:\n print(dist[n])\n\n\n\t\t \t \t\t\t \t \t\t\t \t", "from sys import stdin\r\ninput = stdin.readline\r\n\r\nn, m = map(int, input().split())\r\nadj = [[0 for j in range(n+1)] for i in range(n+1)]\r\nedges = [tuple(map(int, input().split())) for _ in range(m)]\r\nfor u, v in edges:\r\n adj[u][v], adj[v][u] = 1, 1\r\n\r\ndef bfs(i, j):\r\n marked = [0 for t in range(n+1)]\r\n dist = [-1 for t in range(n+1)]\r\n que = []\r\n que.append(i)\r\n marked[i] = 1\r\n dist[i] = 0\r\n while que:\r\n v = que[0]\r\n que.pop(0)\r\n for k in range(1, n+1):\r\n if adj[v][k] == 1 and marked[k] == 0:\r\n que.append(k)\r\n marked[k] = 1\r\n dist[k] = dist[v] + 1\r\n return dist[j]\r\n \r\nif adj[1][n] == 0:\r\n print(bfs(1, n))\r\n exit()\r\nfor i in range(1, n+1):\r\n for j in range(1, n+1):\r\n if i != j:\r\n adj[i][j] = 1 - adj[i][j]\r\nprint (bfs(1, n))\r\n", "from sys import stdin\nfrom collections import deque\n\n\ndef readints():\n return [int(i) for i in stdin.readline().split()]\n\n\ndef BFS(G, s):\n n = len(G)\n\n q = deque()\n d = [0] * (n + 1)\n used = [0] * (n + 1)\n\n q.append(s)\n d[s] = 0\n used[s] = 1\n\n while q:\n \n u = q.popleft()\n\n for v in G[u]:\n if not used[v]:\n q.append(v)\n used[v] = 1\n d[v] = d[u] + 1\n\n return used[n], d[n]\n\n\ndef main():\n n, m = readints()\n \n has_edge = [[0] * (n + 1) for i in range(n + 1)] \n adj = {u : [] for u in range(1, n + 1)}\n\n for _ in range(m):\n u, v = readints()\n\n adj[u].append(v)\n adj[v].append(u)\n has_edge[u][v] = has_edge[v][u] = 1\n\n comp_adj = {u : [] for u in range(1, n + 1)}\n\n for i in range(1, n + 1):\n for j in range(1, n + 1):\n if not has_edge[i][j]:\n comp_adj[i].append(j)\n comp_adj[j].append(i)\n\n ok1, d = BFS(adj, 1)\n ok2, comp_d = BFS(comp_adj, 1)\n \n print(max(d, comp_d) if ok1 and ok2 else -1)\n\n\nif __name__ == \"__main__\":\n main()\n\n \t \t \t\t \t\t \t\t \t \t \t \t \t\t\t", "from math import inf\r\nfrom collections import Counter as cntr\r\nn, m = map(int, input().split(' '))\r\nroad = [[1 for i in range(n)]for i in range(n)]\r\nrailway = [[0 for i in range(n)]for i in range(n)]\r\nfor i in range(m):\r\n\tu, v = map(int, input().split(' '))\r\n\tu -= 1\r\n\tv -= 1\r\n\troad[u][v] = 0\r\n\troad[v][u] = 0\r\n\trailway[u][v] = 1\r\n\trailway[v][u] = 1\r\n\r\ndef bfs(graph, source, n):\r\n\tvisited = [False for i in range(n)]\r\n\td = [inf for i in range(n)]\r\n\tq = [source]\r\n\tvisited[source] = True\r\n\td[source] = 0\r\n\twhile(q):\r\n\t\tidx = q.pop(0)\r\n\r\n\t\tfor i in range(n):\r\n\t\t\tif graph[idx][i] == 1 and visited[i] == False:\r\n\t\t\t\tvisited[i] = True\r\n\t\t\t\td[i] = d[idx] + 1\r\n\t\t\t\tq.append(i)\r\n\treturn d\r\nl1 = bfs(road, 0, n)\r\nl2 = bfs(railway, 0, n)\r\nans = max(l1[-1],l2[-1])\r\nprint(-1) if ans == inf else print(ans)\r\n", "def breadth_search_first(g, n):\n q = [1]\n visited = [1 for x in range(n+1)]\n dist = [0 for x in range(n+1)]\n\n while len(q):\n current = q[0]\n q.remove(current)\n for i in g[current]:\n if visited[i]:\n q.append(i)\n visited[i] = 0\n dist[i] = dist[current] + 1\n if i==n:\n return dist[n]\n\n return -1\n\n[n, m] = [int(x) for x in input().split()]\nrailway = [[] for x in range(n+1)]\nroad = [[] for x in range(n+1)]\n\nfor i in range(m):\n [a,b] = [int(x) for x in input().split()]\n railway[a].append(b)\n railway[b].append(a)\n\nfor i in range(1, n+1):\n for j in range(i+1, n+1):\n if j not in railway[i]:\n road[i].append(j)\n road[j].append(i)\n\nif n in railway[1]:\n print(breadth_search_first(road, n))\nelse:\n print(breadth_search_first(railway, n))\n\t\t \t \t \t\t \t \t \t \t\t \t\t\t", "from queue import Queue\r\nfrom math import inf\r\n\r\n\r\ndef BFS(G, j):\r\n\r\n transport = [1, 2]\r\n n = len(G)\r\n visited = [False]*n\r\n dist = [-1]*n\r\n queue = Queue()\r\n queue.put(0)\r\n dist[0] = 0\r\n\r\n while not queue.empty():\r\n u = queue.get()\r\n\r\n for v in range(n):\r\n if G[u][v] != transport[j] and G[u][v] != 0 and not visited[v]:\r\n queue.put(v)\r\n dist[v] = dist[u]+1\r\n visited[v] = True\r\n return dist[n-1]\r\n\r\n\r\n\r\n\r\n\r\nif __name__ == '__main__':\r\n n, m = map(int, input().split())\r\n G = [[0]*n for _ in range(n)]\r\n for i in range(n):\r\n for j in range(n):\r\n if i != j:\r\n G[i][j] = 2\r\n\r\n for _ in range(m):\r\n u, v = map(int, input().split())\r\n u -= 1\r\n v -= 1\r\n G[u][v] = 1\r\n G[v][u] = 1\r\n # for el in G:\r\n # print(el)\r\n\r\n a = BFS(G, 0)\r\n b = BFS(G, 1)\r\n\r\n if a == -1:\r\n print(-1)\r\n elif b == -1:\r\n print(-1)\r\n else:\r\n print(max(a, b))\r\n", "n, m = map(int, input().split())\r\na = []\r\nfor i in range(n):\r\n a.append([0] * n)\r\n\r\nfor i in range(m):\r\n x, y = map(int, input().split())\r\n x -= 1\r\n y -= 1\r\n a[x][y] = 1\r\n a[y][x] = 1\r\nq = []\r\nr = 0\r\nq.append(0)\r\nu = [-1] * n\r\nu[0] = 0\r\nwhile r < len(q):\r\n v = q[r]\r\n r += 1\r\n for i in range(n):\r\n if u[i] == -1 and a[v][i] != a[0][n-1]:\r\n u[i] = u[v] + 1\r\n q.append(i)\r\nprint(u[n-1])", "from sys import stdin, stdout\n\nn, m = map(int, stdin.readline().split())\nadj = [[False for i in range(n + 1)] for j in range(n + 1)]\nfor i in range(m):\n a, b = map(int, stdin.readline().split())\n adj[a][b] = True\n adj[b][a] = True\n\n# bfs to find the shortest path\ndef train(start):\n visited = [False for i in range(n + 1)]\n queue = [start]\n visited[start] = True\n dist = [0 for i in range(n + 1)]\n dist[start] = 0\n while queue:\n cur = queue.pop(0)\n for i in range(1, n + 1):\n if adj[cur][i] and not visited[i]:\n visited[i] = True\n dist[i] = dist[cur] + 1\n queue.append(i)\n return dist\n\ndef bus(start):\n visited = [False for i in range(n + 1)]\n queue = [start]\n visited[start] = True\n dist = [0 for i in range(n + 1)]\n dist[start] = 0\n while queue:\n cur = queue.pop(0)\n for i in range(1, n + 1):\n if not adj[cur][i] and not visited[i]:\n visited[i] = True\n dist[i] = dist[cur] + 1\n queue.append(i)\n return dist\n\nbustime = bus(1)\ntraintime = train(1)\n# print(bustime, traintime)\nif bustime[n] == 0 or traintime[n] == 0:\n stdout.write('-1\\n')\nelse:\n stdout.write(str(max(bustime[n],traintime[n])) + '\\n')\n\n\n\n\n", "n, m = map(int, input().split())\r\n\r\ngraphrail = [[] for i in range(n)]\r\ngraphroad = [[] for i in range(n)]\r\n\r\ndic = [[0] * n for i in range(n)]\r\n\r\n\r\ndef bfs(graph, s):\r\n level = {s + 1: 0}\r\n front = [s + 1]\r\n i = 1\r\n while front:\r\n next = []\r\n for u in front:\r\n for v in graph[u - 1]:\r\n if v not in level:\r\n level[v] = i\r\n next.append(v)\r\n front = next\r\n i += 1\r\n # print(level)\r\n if n in level:\r\n return level[n]\r\n else:\r\n return -1\r\n\r\n\r\nfor i in range(m):\r\n x, y = map(int, input(). strip().split())\r\n dic[x-1][y-1] = 1\r\n dic[y-1][x-1] = 1\r\n graphrail[x-1].append(y)\r\n graphrail[y-1].append(x)\r\n\r\nfor i in range(n):\r\n for j in range(n):\r\n if dic[i][j] == 0 and i != j:\r\n graphroad[i].append(j+1)\r\n\r\nx = bfs(graphroad, 0)\r\ny = bfs(graphrail, 0)\r\n\r\nif x == -1 or y == -1:\r\n print(-1)\r\nelse:\r\n print(max(x, y))", "from queue import Queue\r\n\r\nn, m = map(int, input().split())\r\ngraph = [[0] * n for _ in range(n)]\r\nfor i in range(m):\r\n u, v = map(int, input().split())\r\n graph[u - 1][v - 1] = graph[v - 1][u - 1] = 1\r\nqueue = Queue()\r\nvisited = [False] * n\r\nvisited[0] = True\r\ntime = [-1] * n\r\ntime[0] = 0\r\nqueue.put(0)\r\nif graph[0][-1] == 1:\r\n for i in range(n):\r\n for j in range(n):\r\n graph[i][j] = 1 - graph[i][j]\r\nwhile not queue.empty():\r\n u = queue.get()\r\n for v in range(len(graph)):\r\n if not visited[v] and graph[u][v] == 1:\r\n time[v] = time[u] + 1\r\n visited[v] = True\r\n queue.put(v)\r\nprint(time[-1])", "class CodeforcesTask601ASolution:\n def __init__(self):\n self.result = ''\n self.n_m = []\n self.railways = []\n\n def read_input(self):\n self.n_m = [int(x) for x in input().split(\" \")]\n for x in range(self.n_m[1]):\n self.railways.append([int(y) for y in input().split(\" \")])\n\n def process_task(self):\n training = True\n for railway in self.railways:\n if railway == [self.n_m[0], 1] or railway == [1, self.n_m[0]]:\n training = False\n break\n visits = {}\n to_visit = [(1, 0)]\n if training:\n graph = [[] for x in range(self.n_m[0])]\n for railway in self.railways:\n graph[railway[0] - 1].append(railway[1])\n graph[railway[1] - 1].append(railway[0])\n else:\n graph = [[] for x in range(self.n_m[0])]\n for railway in self.railways:\n graph[railway[0] - 1].append(railway[1])\n graph[railway[1] - 1].append(railway[0])\n for x in range(self.n_m[0]):\n graph[x] = list(set([y for y in range(1, self.n_m[0] + 1)]).difference(set(graph[x])))\n while to_visit:\n visiting = to_visit.pop(-1)\n if visiting[0] in visits:\n if visiting[1] < visits[visiting[0]]:\n visits[visiting[0]] = visiting[1]\n for adj in graph[visiting[0] - 1]:\n to_visit.append((adj, visiting[1] + 1))\n else:\n visits[visiting[0]] = visiting[1]\n for adj in graph[visiting[0] - 1]:\n to_visit.append((adj, visiting[1] + 1))\n if self.n_m[0] in visits:\n self.result = str(visits[self.n_m[0]])\n else:\n self.result = \"-1\"\n\n def get_result(self):\n return self.result\n\n\nif __name__ == \"__main__\":\n Solution = CodeforcesTask601ASolution()\n Solution.read_input()\n Solution.process_task()\n print(Solution.get_result())\n", "n,m=map(int,input().split())\r\nrail = [ [False for v in range(n) ] for u in range(n) ]\r\nroad= [ [True for v in range(n) ] for u in range(n) ]\r\n\r\nfor i in range(m):\r\n u,v = map(lambda x:x-1,map(int,input().split()))\r\n rail[u][v]=rail[v][u]=True\r\n road[u][v]=road[v][u]=False\r\n\r\nsource,target=0,n-1\r\n\r\nif rail[source][target]:\r\n g = road\r\nelse:\r\n g = rail\r\n\r\nseen = [ False for v in range(n) ]\r\n\r\nqueue=[ (source,0) ]\r\n\r\ntail = 0\r\n\r\nwhile tail < len(queue):\r\n (u,steps) = queue[tail]\r\n tail+=1\r\n for v in range(n):\r\n if g[u][v] and not seen[v]:\r\n if v == target:\r\n print(steps+1)\r\n import sys; sys.exit()\r\n seen[v]=True\r\n queue.append((v,steps+1))\r\n\r\nprint(-1)\r\n\r\n", "n,m=map(int,input().split())\n\ngraph=[[0]*(n+1) for i in range(n+1)] #van de 1 a n, nos saltamos el 0\n\nfor k in range(m): #conexiones de railways\n x,y=map(int,input().split())\n graph[x][y]=graph[y][x]=1 #conexion entre ambas ciudades por tren\n \nvis=[-1]*(n+1) #si no se visita, va -1\nvis[1]=0 #partimos en 1\nq=[1]\n\nwhile q:\n i=q.pop(0)\n for j in range(1,n+1): #n ciudades, de 1 a n.\n\n if graph[i][j]!=graph[1][n] and vis[j]==-1: #si no pasa el tren \n vis[j]=vis[i]+1 #sumamos una parada de bus a las paradas totales\n q.append(j) #lsiguiente parada es ciudad j\n\n\nprint(vis[-1]) #ultima posición del array, si no se visitó, sale un -1.\n\t \t \t \t\t\t\t \t \t", "def bfs(V, start):\r\n D = [None] * (n + 1)\r\n D[start] = 0\r\n Q = [start]\r\n Qstart = 0\r\n while Qstart < len(Q):\r\n u = Q[Qstart]\r\n Qstart += 1 \r\n for v in V[u]: \r\n if D[v] is None: \r\n D[v] = D[u] + 1 \r\n Q.append(v) \r\n return D[n]\r\n\r\nn, m = tuple(map(int, input().split()))\r\nl1 = [set() for i in range(n + 1)]\r\nl = [set() for i in range(n + 1)]\r\nfor i in range(m):\r\n edge = list(map(int, input().split()))\r\n l[edge[0]].add(edge[1])\r\n l[edge[1]].add(edge[0])\r\n\r\nif n not in l[1]:\r\n print(bfs(l, 1) if bfs(l, 1) != None else -1)\r\nelse:\r\n \r\n for i in range(1, n + 1):\r\n for j in range(1, n + 1):\r\n if j not in l[i]:\r\n l1[i].add(j)\r\n print(bfs(l1, 1) if bfs(l1, 1) != None else -1)\r\n ", "from collections import deque\r\n\r\nn, m = map(int, input().split())\r\n\r\nrail_network=[[0]*(n+1) for _ in range(n+1)]\r\n\r\nfor _ in range(m):\r\n\tu, v = map(int, input().split())\r\n\trail_network[u][v]=rail_network[v][u]=1\r\n\r\nque=deque()\r\n\r\ndis=[-1]*(n+1)\r\ndis[1]=0\r\n\r\nque.append(1)\r\n\r\nwhile que:\r\n\ttemp=que.popleft()\r\n\r\n\tfor i in range(1, n+1):\r\n\t\tif rail_network[temp][i]!=rail_network[1][n] and dis[i]==-1:\r\n\t\t\tdis[i]=dis[temp]+1\r\n\t\t\tque.append(i)\r\n\r\nprint(dis[-1])", "from math import inf\r\nfrom collections import *\r\nimport math, os, sys, heapq, bisect, random,threading\r\nfrom functools import lru_cache\r\nfrom itertools import *\r\ndef inp(): return sys.stdin.readline().rstrip(\"\\r\\n\")\r\ndef out(var): sys.stdout.write(str(var)) # for fast output, always take string\r\ndef inpu(): return int(inp())\r\ndef lis(): return list(map(int, inp().split()))\r\ndef stringlis(): return list(map(str, inp().split()))\r\ndef sep(): return map(int, inp().split())\r\ndef strsep(): return map(str, inp().split())\r\ndef fsep(): return map(float, inp().split())\r\nM,M1=1000000007,998244353\r\ndef main():\r\n how_much_noob_I_am=1\r\n #how_much_noob_I_am=inpu()\r\n for _ in range(how_much_noob_I_am):\r\n n,m = sep()\r\n d=defaultdict(list)\r\n p=defaultdict(list)\r\n s=set()\r\n for i in range(m):\r\n u,v = sep()\r\n d[u].append(v)\r\n d[v].append(u)\r\n s.add((u,v))\r\n for i in range(1,n+1):\r\n for j in range(1,n+1):\r\n if (i,j) not in s and (j,i) not in s:\r\n p[i].append(j)\r\n p[j].append(i)\r\n train = deque()\r\n train.append(1)\r\n dist = [inf]*(n+1)\r\n dist[1] = 0\r\n while(train):\r\n s = train.popleft()\r\n for i in d[s]:\r\n if dist[i]>dist[s]+1:\r\n dist[i] = dist[s]+1\r\n train.append(i)\r\n bus = deque()\r\n bus.append(1)\r\n dist2 = [inf]*(n+1)\r\n dist2[1] = 0\r\n while(bus):\r\n s=bus.popleft()\r\n for i in p[s]:\r\n if dist2[i]>dist2[s]+1:\r\n dist2[i] = dist2[s]+1\r\n bus.append(i)\r\n ans = max(dist[n],dist2[n])\r\n #print(dist,dist2)\r\n if ans==inf:\r\n print(\"-1\")\r\n else:\r\n print(ans)\r\nif __name__ == '__main__':\r\n main()\r\n", "n, m = map(int, input().split())\ndp = [[0 for i in range(n + 1)] for j in range(n + 1)]\nlevel = [-1 for i in range(n + 1)]\nstack = []\n\ndef bfs(src, lvl, flag):\n\tlevel[src] = lvl\n\tstack.append(src)\n\tp = 0\n\twhile True:\n\t\tfor i in range(1, n + 1):\n\t\t\tif dp[src][i] == flag:\n\t\t\t\t#print (i, i)\n\t\t\t\tif level[i] == -1:\n\t\t\t\t#\tprint (i, i)\n\t\t\t\t\tstack.append(i)\n\t\t\t\t\tlevel[i] = level[src] + 1\n\t\tif len(stack) <= p + 1:\n\t\t\tbreak\n\t\tp += 1\n\t\t#print (stack)\n\t\tsrc = stack[p]\n\t\tif src == n:\n\t\t\treturn level[src]\n\t\t\tbreak\n\treturn -1\n\nfor i in range(m):\n\ta, b = map(int, input().split())\n\tdp[a][b] = 1\n\tdp[b][a] = 1\n\t\nif dp[1][n]:\n\tprint (bfs(1, 0, 0))\n\t\nelse:\n\tprint (bfs(1, 0, 1))\n", "\r\n\r\nn, m = map(int, input().split())\r\ng1, g2 = {}, {}\r\ne = [[False for i in range(n)] for j in range(n)]\r\nlevel = [-1]*n\r\n\r\n\r\ndef bfs(t, u):\r\n queue = [u]\r\n level[u] = 0\r\n while len(queue) != 0:\r\n u = queue.pop(0)\r\n if u == n-1:\r\n return level[u]\r\n\r\n if t == 1:\r\n for v in g1[u]:\r\n if level[v] == -1:\r\n level[v] = level[u]+1\r\n queue.append(v)\r\n elif t == 2:\r\n for v in g2[u]:\r\n if level[v] == -1:\r\n level[v] = level[u]+1\r\n queue.append(v)\r\n return -1\r\n\r\n\r\nif __name__ == \"__main__\":\r\n for i in range(n):\r\n g1[i] = []\r\n g2[i] = []\r\n while m:\r\n a, b = map(int, input().split())\r\n a -= 1\r\n b -= 1\r\n g1[a].append(b)\r\n g1[b].append(a)\r\n e[a][b] = True\r\n e[b][a] = True\r\n m -= 1\r\n\r\n for i in range(n):\r\n for j in range(i+1, n):\r\n if not e[i][j]:\r\n g2[i].append(j)\r\n g2[j].append(i)\r\n\r\n if e[0][n-1]:\r\n print(bfs(2, 0))\r\n else:\r\n print(bfs(1, 0))", "\nfrom __future__ import print_function\nimport sys\nfrom collections import *\nfrom heapq import *\nfrom functools import *\nimport re\nfrom itertools import *\n\nINF=float(\"inf\")\nNINF=float(\"-inf\")\n\ntry:\n input=raw_input\nexcept:\n pass\n\ndef read_string():\n return input()\n\ndef read_string_line():\n return [x for x in input().split(\" \")]\n\ndef read_int_line():\n return [int(x) for x in input().split(\" \")]\n\ndef read_int():\n return int(input())\n\nn,m=read_int_line()\na=[[0]*n for _ in range(n)]\nfor _ in range(m):\n frm,to=read_int_line()\n frm-=1\n to-=1\n a[frm][to]=a[to][frm]=1\n\n\ndef calc():\n dist=[-1]*n\n dist[0]=0\n q=deque([0])\n while q:\n cur=q.popleft()\n for nxt in range(n):\n if a[cur][nxt] != a[0][n-1] and dist[nxt]==-1:\n dist[nxt]=dist[cur]+1\n q.append(nxt)\n return dist[-1]\n\nprint(\"%d\"%calc())\n", "def distancia_minima(matriz_adj, num_vertices):\n \n distancias = [-1 for i in range(num_vertices)]\n distancias[0] = 0\n fila = [0]\n\n\n while fila:\n vertice_atual = fila.pop(0)\n\n for i in range(num_vertices):\n\n if distancias[i] == -1 and matriz_adj[i][vertice_atual] != matriz_adj[0][num_vertices-1]:\n distancias[i] = distancias[vertice_atual] + 1\n fila.append(i)\n\n return distancias[num_vertices-1]\n\nnum_vertices, num_arestas = map(int, input().split())\nmatriz_adj = [[0] * num_vertices for i in range(num_vertices)]\n\nfor i in range(num_arestas):\n vertice_1, vertice_2 = map(int, input().split())\n\n matriz_adj[vertice_1 - 1][vertice_2 - 1] = 1\n\n matriz_adj[vertice_2 - 1][vertice_1 - 1] = 1\n\nprint(distancia_minima(matriz_adj, num_vertices))\n\t \t \t\t\t\t\t\t \t \t \t\t\t \t", "def theTwoRoutes(cidadeX, cidadeY):\r\n cruzamento = [0] * (cidadeX + 1)\r\n\r\n for l in range(cidadeX + 1):\r\n cruzamento[l] = [1] * (cidadeX + 1)\r\n \r\n for i in range(cidadeY):\r\n a, b = map(int, input().split())\r\n cruzamento[a][b] = cruzamento[b][a] = 2\r\n \r\n x = 3 - cruzamento[1][cidadeX]\r\n veiculo = [0] * (cidadeX + 1)\r\n indice = 1\r\n d = [cidadeX + 1] * (cidadeX + 1)\r\n tempo = d[1] = 0\r\n \r\n while indice != cidadeX:\r\n veiculo[indice] = 1\r\n for j in range(1, cidadeX + 1):\r\n if(veiculo[j] == 0 and cruzamento[indice][j] == x and d[j] > d[indice] + 1):\r\n d[j] = d[indice] + 1\r\n menor = cidadeX + 1\r\n \r\n for j in range(1, cidadeX + 1):\r\n if(veiculo[j] == 0 and d[j] < menor):\r\n menor = d[j]\r\n indice = j\r\n \r\n if(menor == cidadeX + 1):\r\n tempo = -1\r\n break\r\n \r\n elif(indice == cidadeX):\r\n tempo = d[cidadeX]\r\n break\r\n \r\n print(tempo)\r\n\r\ncidadeX, cidadeY = map(int, input().split())\r\ntheTwoRoutes(cidadeX, cidadeY)", "def BFS(s,Adj):\r\n level = {s:0}\r\n parent = {s:None}\r\n i=1\r\n frontier = [s]\r\n while frontier:\r\n next1 = []\r\n for u in frontier:\r\n for v in Adj[u]:\r\n if v not in level:\r\n level[v] = i\r\n parent[v] = u\r\n next1.append(v)\r\n frontier = next1\r\n i += 1\r\n return level\r\nn,m = map(int, input().split())\r\nadj_list = [[] for j in range(n+1)]\r\ncase = 0\r\nfor i in range(m):\r\n u,v = map(int, input().split())\r\n adj_list[u].append(v)\r\n adj_list[v].append(u)\r\n if (u == 1 and v == n) or (u == n and v == 1):\r\n case = 1\r\nif case == 0:\r\n ans = BFS(1, adj_list)\r\n if n in ans:\r\n print(ans[n])\r\n else:\r\n print(-1)\r\nelse:\r\n opp_adj_list = [[] for j in range(n+1)]\r\n for i in range(1, n+1):\r\n for j in range(1, n+1):\r\n if j != i:\r\n if j not in adj_list[i]:\r\n opp_adj_list[i].append(j)\r\n ans = BFS(1, opp_adj_list)\r\n if n in ans:\r\n print(ans[n])\r\n else:\r\n print(-1)", "#http://codeforces.com/contest/601/problem/A\nimport sys\nfrom collections import deque\n\nn, m = map(int, input().split())\ng = set()\nfor i in range(m):\n x, y = map(int, input().split())\n x -= 1\n y -= 1\n g |= {(x, y), (y, x)}\n\ncut = (0, n-1) in g\n\nq = deque()\nq.append(0)\n\nd = [-1] * n\nd[0] = 0\nwhile len(q):\n x = q.popleft()\n for y in range(n):\n if cut ^ ((x, y) in g) and (d[y] == -1 or d[y] > d[x] + 1):\n d[y] = d[x] + 1\n q.append(y)\n\nprint(d[n-1])\n", "# import sys\r\n# sys.stdin = open('cf602c.in')\r\n\r\nfrom collections import deque\r\n\r\nn, m = map(int, input().split())\r\ng_trn = [[] for _ in range(n)]\r\n\r\nfor _ in range(m):\r\n\tu, v = map(int, input().split())\r\n\tg_trn[u - 1].append(v - 1)\r\n\tg_trn[v - 1].append(u - 1)\r\n\r\ng_bus = [list(set(range(n)) - set(g_trn[i])) for i in range(n)]\r\n\r\nqueue_bus = deque()\r\nqueue_bus.appendleft(0)\r\ndist_bus = [-1 for _ in range(n)]\r\ndist_bus[0] = 0\r\n\r\nwhile queue_bus:\r\n\tnode = queue_bus.pop()\r\n\tfor neigh in g_bus[node]:\r\n\t\tif dist_bus[neigh] == -1:\r\n\t\t\tdist_bus[neigh] = dist_bus[node] + 1\r\n\t\t\tqueue_bus.appendleft(neigh)\r\n\r\nif dist_bus[-1] == -1:\r\n\tprint(-1)\r\n\texit()\r\n\r\nqueue_trn = deque()\r\nqueue_trn.appendleft(0)\r\ndist_trn = [-1 for _ in range(n)]\r\ndist_trn[0] = 0\r\n\r\nwhile queue_trn:\r\n\tnode = queue_trn.pop()\r\n\tfor neigh in g_trn[node]:\r\n\t\tnew_dist = dist_trn[node] + 1\r\n\t\tif dist_trn[neigh] == -1:\r\n\t\t\tdist_trn[neigh] = new_dist\r\n\t\t\tqueue_trn.appendleft(neigh)\r\n\r\nif dist_trn[-1] == -1:\r\n\tprint(-1)\r\n\texit()\r\n\r\ndef solve_onedir(g, dist_1, dist_orig):\r\n\t# g yields to dist_1\r\n\r\n\tqueue_2 = deque()\r\n\tqueue_2.appendleft(0)\r\n\tdist_2 = [-1 for _ in range(n)]\r\n\tdist_2[0] = 0\r\n\r\n\twhile queue_2:\r\n\t\tnode = queue_2.pop()\r\n\t\tfor neigh in g[node]:\r\n\t\t\tnew_dist = dist_2[node] + 1\r\n\t\t\tif dist_2[neigh] == -1 and new_dist != dist_1[neigh]:\r\n\t\t\t\tdist_2[neigh] = new_dist\r\n\t\t\t\tqueue_2.appendleft(neigh)\r\n\r\n\tif dist_2[-1] == -1:\r\n\t\tdist_2[-1] = dist_orig[-1] + 2\r\n\r\n\treturn max(dist_1[-1], dist_2[-1])\r\n\r\nans = min(solve_onedir(g_trn, dist_bus, dist_trn), solve_onedir(g_bus, dist_trn, dist_bus))\r\nprint(ans)", "import heapq as hq\r\nn,m = map(int,input().split())\r\n\r\ngraph = [[0]*n for i in range(n)]\r\nvertex = [i for i in range(0,n)]\r\ntotal = []\r\n\r\nfor i in range(n):\r\n graph[i][i] = -1\r\n\r\ndef connect_vertex(u,v):\r\n if u!=v:\r\n u = u-1\r\n v = v-1\r\n graph[u][v] = 1\r\n graph[v][u] = 1\r\n\r\n \r\ndef Dijkastra(u,v,sel):\r\n distance = [(0,u)]\r\n l=[u]\r\n d = {}\r\n while len(distance)!=0:\r\n a,v1 = hq.heappop(distance)\r\n hq.heappop(l)\r\n d.update({v1:a})\r\n ind = vertex.index(v1)\r\n if v1 == v:\r\n return a\r\n for i in range(n):\r\n if graph[ind][i] == sel:\r\n if vertex[i] not in d:\r\n if vertex[i] not in l:\r\n hq.heappush(distance,(a+1,vertex[i]))\r\n l.append(vertex[i])\r\n else:\r\n total_cost = a+1\r\n for j in distance:\r\n if j[1] == vertex[i]:\r\n if j[0]>total_cost:\r\n j[0] = total_cost\r\n break\r\n \r\n if n-1 not in d:\r\n return -1\r\n else:\r\n a = d[n-1]\r\n return a[0]\r\n \r\nfor _ in range(m):\r\n u,v = map(int,input().split())\r\n connect_vertex(u,v)\r\n\r\nif graph[0][-1] == 0:\r\n print(Dijkastra(0,n-1,1))\r\nelse:\r\n print(Dijkastra(0,n-1,0))", "# two routs\r\nimport heapq\r\nN,M=map(int,input().split())\r\nused={(i,j):False for i in range(1,N+1) for j in range(1,N+1)}\r\ngraph={i:[] for i in range(1,N+1)}\r\ngraph_r={i:[] for i in range(1,N+1)}\r\nfor _ in range(M):\r\n u,v=map(int,input().split())\r\n graph[u].append((1,v))\r\n graph[v].append((1,u))\r\n used[(u,v)]=True\r\n used[(v,u)]=True\r\nfor i in range(1,N+1):\r\n for j in range(1,N+1):\r\n if used[(i,j)]==False:\r\n graph_r[i].append((1,j))\r\ndef dijkstra(s,graph,n):\r\n dist=[float(\"inf\") for i in range(n+1)]\r\n dist[s]=0\r\n pq=[]\r\n heapq.heapify(pq)\r\n heapq.heappush(pq,(0,s))\r\n while pq:\r\n mini_dis,node=heapq.heappop(pq)\r\n if dist[node]<mini_dis: continue\r\n for w,point in graph[node]:\r\n if dist[point]<w:continue\r\n newlen=dist[node]+w\r\n if newlen<dist[point]:\r\n heapq.heappush(pq,(newlen,point))\r\n dist[point]=newlen\r\n return dist\r\nA=dijkstra(1,graph,N)[N]\r\nB=dijkstra(1,graph_r,N)[N]\r\nans=max(A,B)\r\nif ans==float(\"inf\"):\r\n print(-1)\r\nelse:\r\n print(ans)", "n, m = map(int, input().split())\nrail = [ [ False for v in range(n) ] for u in range(n) ]\nroad = [ [ True for v in range(n) ] for u in range(n) ]\nfor i in range(m):\n u, v = map(lambda x: x - 1, map(int, input().split()))\n rail[u][v] = rail[v][u] = True\n road[u][v] = road[v][u] = False\nsource, target = 0, n - 1\n\nif rail[source][target]:\n g = road\nelse:\n g = rail\n\nseen = [ False for u in range(n) ]\nseen[0] = True\nqueue = [ (source, 0) ]\ntail = 0\nwhile tail < len(queue):\n (u, steps) = queue[tail]\n tail += 1\n for v in range(n):\n if g[u][v] and not seen[v]:\n if v == target:\n print(steps + 1)\n import sys; sys.exit()\n seen[v] = True\n queue.append((v, steps + 1))\n\nprint(-1)\n", "def routes(n, m):\r\n distance = [0] * (n + 1)\r\n \r\n for i in range(n + 1):\r\n distance[i] = [1] * (n + 1)\r\n \r\n for x in range(m):\r\n a, b = map(int, input().split())\r\n distance[a][b] = distance[b][a] = 2\r\n \r\n x = 3 - distance[1][n]\r\n y = [0] * (n + 1)\r\n i = 1\r\n d = [n + 1] * (n + 1)\r\n result = d[1] = 0\r\n \r\n while (i != n):\r\n y[i] = 1\r\n \r\n for j in range(1, n + 1):\r\n if (y[j] == 0 and distance[i][j] == x and d[j] > d[i] + 1):\r\n d[j] = d[i] + 1\r\n \r\n end = n + 1\r\n \r\n for j in range(1, n + 1):\r\n if (y[j] == 0 and d[j] < end):\r\n end = d[j]\r\n i = j\r\n \r\n if (end == n + 1):\r\n result = -1\r\n break\r\n \r\n elif (i == n):\r\n result = d[n]\r\n break\r\n \r\n return result\r\n\r\nn, m = map(int, input().split())\r\nprint(routes(n, m))\r\n", "n, m = map(int, input().split())\nk = n + 1\ns = [[0] * k for i in range(k)]\n \nfor j in range(m):\n u, v = map(int, input().split())\n s[u][v] = s[v][u] = 1\nd = [-1] * k\nd[1] = 0\nq = [1]\n \nwhile len(q) > 0:\n u = q.pop(0)\n for v in range(1, k):\n if s[u][v] != s[1][n] and d[v] == -1:\n d[v] = d[u] + 1\n q.append(v)\nprint(d[n])\n", "n, m = map(int,input().split())\r\n \r\ngraph = []\r\nfor i in range(n):\r\n graph.append([0]*n)\r\n \r\nfor i in range(m):\r\n u, v = map(int,input().split())\r\n graph[u-1][v-1] = graph[v-1][u-1] = 1\r\n \r\nrailway = [-1] * n\r\nrailway[0] = 0\r\nq = [0]\r\n \r\nwhile q:\r\n tmp = q.pop(0)\r\n for i in range(n):\r\n if graph[tmp][i] != graph[0][n-1] and railway[i] == -1:\r\n railway[i] = railway[tmp]+1\r\n q.append(i)\r\n\r\nres = railway[n-1]\r\nprint(res)", "n, m = map(int,input().split())\r\nl = [[0]*(n) for i in range(n)]\r\n\r\nj = [-1]*n\r\nj[0] = 0\r\nk = [0]\r\n\r\n\r\nfor i in range(m):\r\n u,v = map(int,input().split())\r\n l[u-1][v-1] = l[v-1][u-1] = 1\r\nwhile k:\r\n u = k.pop(0)\r\n for i in range(n):\r\n if l[u][i] != l[0][n-1] and j[i] == -1:\r\n j[i] = j[u] + 1\r\n k.append(i)\r\nprint(j[n-1])\r\n", "import math\nfrom queue import Queue\n\nnum_de_cidades, num_de_ferrovias = map(int, input().split())\n\nestradas = [None] * num_de_cidades\naux = [None] * num_de_cidades\nfor i in range(num_de_cidades):\n fila = [None] * num_de_cidades\n for j in range(num_de_cidades):\n fila[j] = 1\n estradas[i] = fila\n aux[i] = math.inf\n\nfor i in range(num_de_ferrovias):\n\tcidade_u, cidade_v = map(int, input().split())\n\tcidade_u -= 1\n\tcidade_v -= 1\n\testradas[cidade_u][cidade_v] = 2\n\testradas[cidade_v][cidade_u] = 2\n\nfila = Queue()\nfila.put(0)\naux[0] = 0\nwhile(not fila.empty()):\n topo = fila.get()\n valor = estradas[0][num_de_cidades-1]\n for i in range(len(estradas[0])):\n vertice = estradas[topo][i]\n if (vertice != valor) and ((aux[topo] +1) < aux[i]): \n fila.put(i)\n aux[i] = aux[topo] + 1\n\ntempo_min = aux[num_de_cidades - 1]\nif(aux[num_de_cidades-1] != math.inf):\n print(tempo_min)\nelse:\n print('-1')\n \t \t\t \t\t\t \t\t \t \t\t\t \t\t \t\t", "n, m = map(int,input().split())\r\nq = [0]\r\n \r\ngraph = [[0] * n for i in range(n)]\r\ndist = [-1] * n\r\ndist[0] = 0\r\n \r\nfor i in range(m):\r\n u, v = map(int,input().split())\r\n graph[u-1][v-1] = 1\r\n graph[v-1][u-1] = 1\r\n \r\nwhile q:\r\n temp = q.pop(0)\r\n\r\n for i in range(n):\r\n if graph[temp][i] != graph[0][n-1] and dist[i] == -1:\r\n dist[i] = dist[temp]+1\r\n q.append(i)\r\n \r\nprint(dist[n-1])", "x_city, y_city = map(int, input().split())\n\ncrossing = [0] * (x_city + 1)\n\nfor l in range(x_city + 1): crossing[l] = [1] * (x_city + 1)\n\nfor i in range(y_city):\n x, y = map(int, input().split())\n crossing[x][y] = crossing[y][x] = 2\n\nx, car, i = 3 - crossing[1][x_city], [0] * (x_city + 1), 1\nd = [x_city + 1] * (x_city + 1)\ntime = d[1] = 0\n\nwhile i != x_city:\n car[i] = 1\n for j in range(1, x_city + 1):\n if car[j] == 0 and crossing[i][j] == x and d[j] > d[i] + 1: d[j] = d[i] + 1\n \n minimum = x_city + 1\n\n for j in range(1, x_city + 1):\n if car[j] == 0 and d[j] < minimum:\n minimum = d[j]\n i = j\n\n if i == x_city:\n time = d[x_city]\n break\n \n elif minimum == x_city + 1:\n time = -1\n break\n \nprint(time)\n\n\t \t \t \t \t\t \t\t\t\t\t \t\t \t \t", "n, m = map(int, input().split())\r\n\r\nd = [[0 for col in range(500)] for lin in range(500)]\r\nvet = [0] * 500\r\n\r\nfor i in range(m):\r\n x, y = map(int, input().split())\r\n x -= 1\r\n y -= 1\r\n d[x][y] = 1\r\n d[y][x] = 1\r\nq = [0]\r\nl = 0\r\n\r\nwhile l < len(q):\r\n for i in range(1, n):\r\n if d[0][n-1] != d[q[l]][i] and vet[i] == 0 :\r\n vet[i] = vet[q[l]] + 1\r\n q.append(i)\r\n l += 1\r\n\r\nif vet[n-1] == 0:\r\n print(\"-1\")\r\nelse:\r\n print(vet[n-1])\r\n", "import sys\n \nd=[[0 for col in range(500)] for row in range(500)]\nv=[0]*500\nn, m=map(int, input().split())\nfor i in range(m):\n x, y=map(int, input().split())\n x -= 1\n y -= 1\n d[x][y] = d[y][x]=1\nq = [0]\nl = 0\n \nwhile l < len(q):\n for i in range(1,n):\n if d[0][n-1] != d[q[l]][i] and v[i] == 0 :\n v[i] = v[q[l]] + 1\n q.append(i)\n l += 1\n \nif v[n-1] == 0:\n print(-1)\nelse:\n print(v[n-1])\n \n \t\t \t\t \t\t \t\t\t \t\t\t \t \t\t\t\t\t\t" ]

[ "w,m=map(int,input().split())\r\nfor i in range(33): m=min(m,abs(w**(32-i)-m))\r\nprint(\"NO\" if m else \"YES\")", "import sys\r\ninput=sys.stdin.readline\r\nw,m=map(int,input().split())\r\nfor i in range(33):\r\n m=min(m,abs(m-w**(32-i)))\r\nif m==0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "w, m = map(int, input().split())\nfor i in range(100, -1, -1):\n if abs(m - w**i) < m:\n m = abs(m - w**i)\nprint('YES' if m == 0 else 'NO')\n", "n,m=map(int,input().split())\r\nflag=0\r\nwhile m >0:\r\n if (m-1) % n ==0:\r\n m-=1\r\n elif (m+1) % n==0:\r\n m+=1\r\n if m % n!=0:\r\n flag=-1\r\n break\r\n m//=n\r\nif flag==0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "base, massa = map(int, input().split())\r\nfor i in range(100, -1, -1):\r\n\tif abs(massa - base**i) < massa:\r\n\t\tmassa = abs(massa - base**i)\r\n \r\nif massa == 0:\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")", "#552C\r\n\r\nfrom math import *\r\n\r\nw,m = map(int, input().split())\r\narr =[]\r\np=1\r\nfor i in range(101):\r\n\tarr.append(p)\r\n\tp*=w\r\narr.reverse()\r\nfor i in range(101):\r\n\tval1 = m+arr[i]\r\n\tval2 = abs(m-arr[i])\r\n\tm = min(m, min(val1,val2))\r\nprint (\"NO\" if m else \"YES\")", "#n = int(input())\r\nw,m = map(int,input().split())\r\no = []\r\nwhile m > 0:\r\n o.append(m%w)\r\n m //= w\r\no.append(0)\r\nf = 0\r\nfor i in range(len(o)-1):\r\n o[i+1] += o[i]//w\r\n o[i] %= w\r\n if o[i] == 0:\r\n continue\r\n if o[i] == 1:\r\n continue\r\n elif o[i] < w-1:\r\n f = 1\r\n else:\r\n o[i+1] += 1\r\nprint('YES' if f == 0 else 'NO')\r\n", "def check(n,m):\r\n if n==2:\r\n return 1\r\n while(m):\r\n if m%n<n-1 and m%n>1:\r\n return 0\r\n elif m%n==n-1:\r\n m+=1\r\n m//=n\r\n return 1\r\nn,m=map(int,input().split())\r\nprint('YES' if check(n,m) else 'NO')", "w, x = map(int, input().split())\r\na = []\r\ncur = w ** 50\r\nwhile cur:\r\n if x >= cur:\r\n a.append(x // cur)\r\n x %= cur\r\n else:\r\n a.append(0)\r\n cur //= w\r\nfor i in range(50, 1, -1):\r\n if a[i] > 1:\r\n a[i] -= w\r\n a[i - 1] += 1\r\n if a[i] not in {-1, 0, 1}:\r\n print(\"NO\")\r\n exit(0)\r\nprint(\"YES\")", "n,m=map(int,input().split())\nfor i in range(33): m=min(m,abs(n**(32-i)-m))\nprint(\"NO\" if m else \"YES\")\n\n\t \t\t\t\t\t \t \t\t\t \t \t\t \t\t\t\t \t", "def main():\n w, m = map(int, input().split())\n ww = 1\n while ww < m:\n ww *= w\n while m and ww:\n m = min(m, m - ww, m + ww, key=abs)\n ww //= w\n print((\"YES\", \"NO\")[bool(m)])\n\n\nif __name__ == '__main__':\n main()\n", "def rl():\r\n return list(map(int,input().split()))\r\ndef ri():\r\n return int(input())\r\ndef rs():\r\n return input()\r\ndef rm():\r\n return map(int,input().split())\r\n\r\ndef main():\r\n w,m=rm()\r\n if w==2 or w==3 or m==1: return 'YES'\r\n c=m\r\n while 1:\r\n e=0\r\n for i in range(30):\r\n if w**i>c: e=i;break\r\n elif w**i==c: return 'YES'\r\n if c<w**(i-1)+(w**(i-1))//3+1:\r\n c-=(w**(i-1))\r\n else:\r\n c=(w**i)-c\r\n if c>w**(i-1)+(w**(i-1))//3: return 'NO'\r\n \r\n \r\n return 'NO'\r\n\r\n\r\nprint(main())\r\n", "w, m = tuple(map(int, input().split()))\r\n\r\nf = True\r\nwhile m > 0:\r\n if m % w == 0:\r\n m //= w\r\n elif m % w == 1:\r\n m //= w\r\n elif m % w == w - 1:\r\n m = m // w + 1\r\n else:\r\n f = False\r\n break\r\n \r\nprint('YES' if f else 'NO')", "w, m = map(int, input().split())\np = 1\nfor i in range(100):\n if m == 0: break\n if (m - p) % (p*w) == 0: m -= p\n elif (m + p) % (p*w) == 0: m += p\n p *= w\nif m == 0:\n print(\"YES\")\nelse:\n print(\"NO\")\n", "n,m=map(int,input().split())\r\nfor k in range(33):\r\n m=min(m,abs(n**(32-k)-m))\r\nprint([\"NO\",\"YES\"][m==0])\r\n", "#blue \r\nw,m=map(int,input().split())\r\n\r\nfor i in reversed(range(30)):\r\n\tadd=m+w**i\r\n\tsub=abs(m-w**i)\r\n\tm=min(m,add,sub)\r\n\r\nprint('NO' if m else 'YES')", "w, m = [int(x) for x in input().split()]\r\n\r\na = [w ** i for i in range(101)]\r\ntotal = sum(a) + m\r\n\r\nfor i in reversed(a):\r\n cnt = 0\r\n while total >= i and cnt < 2:\r\n cnt += 1\r\n total -= i\r\n\r\nif total == 0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "w, m = map(int, input().split())\r\nfor i in range(33)[::-1]: m = min(m, abs(m - w ** i))\r\nprint(\"NO\" if m else \"YES\")", "def powmod(x, p, m):\r\n\tif p <= 0:\r\n\t\treturn 1\r\n\tif p <= 1:\r\n\t\treturn x%m\r\n\treturn powmod(x*x%m, p//2, m) * (x%m)**(p%2) % m\r\n\r\n###\r\n\r\ndef to_basex(num, x):\r\n\twhile num > 0:\r\n\t\tyield num % x\r\n\t\tnum //= x\r\n\r\ndef from_basex(it, x):\r\n\tret = 0\r\n\tp = 1\r\n\tfor d in it:\r\n\t\tret += d*p\r\n\t\tp *= x\r\n\treturn ret\r\n\r\n###\r\n\r\nw, m = (int(x) for x in input().split())\r\n#print(w, m)\r\n\r\nmbx = list(to_basex(m, w))\r\nfor i in range(len(mbx)):\r\n\tmbx[i] += 1\r\nm = from_basex(mbx, w)\r\nmbx = list(to_basex(m, w))\r\n\r\nans = \"YES\" if max(mbx) < 3 else \"NO\"\r\nprint(ans)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "w,m = map(int,input().split())\r\n\r\nA = []\r\n\r\nwhile m:\r\n A.append(m%w)\r\n m //= w\r\n\r\nsz = len(A)\r\nA.append(0)\r\nfor i in range(sz):\r\n x = A[i]\r\n if x != 0 and x != 1 and x != w-1 and x != w:\r\n print(\"NO\")\r\n exit()\r\n \r\n if x == w-1 or x == w:\r\n A[i+1] += 1\r\n\r\nprint(\"YES\")\r\n", "base, massa = map(int, input().split())\nfor i in range(100, -1, -1):\n\tif abs(massa - base**i) < massa:\n\t\tmassa = abs(massa - base**i)\n\nif massa == 0:\n\tprint(\"YES\")\nelse:\n\tprint(\"NO\")", "w,m=map(int,input().split());P=print\r\n\r\n# for i in range(33):m=min(m,abs(w**(32-i)-m))\r\n# print(['YES','NO'][m>0])\r\n\r\na=[0]*40;siz=0\r\nwhile m:\r\n a[siz]=m%w;siz+=1;m//=w\r\nfor i in range(siz+1):\r\n if a[i] not in (0,1,w-1,w):exit(P('NO'))\r\n elif a[i] in (w-1,w):a[i+1]+=1\r\nP('YES')", "import sys\r\nimport math\r\nimport collections\r\nimport heapq\r\nimport decimal\r\ninput=sys.stdin.readline\r\nw,m=(int(i) for i in input().split())\r\nl=[]\r\nwhile(m>0):\r\n l.append(m%w)\r\n m//=w\r\nc=1\r\nn=len(l)\r\nfor i in range(n):\r\n if(l[i]!=0 and l[i]!=1 and l[i]!=w-1 and l[i]!=w):\r\n c=0\r\n break\r\n else:\r\n if((l[i]==w-1 or l[i]==w) and i<n-1):\r\n l[i+1]+=1\r\nif(c==1):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "w, m = map(int, input().split())\nwhile m > 1:\n\n # m debe ser congruente con 0,\n # 1 o w-1 módulo w\n if m % w not in (0, 1, w - 1):\n print('NO'); exit()\n \n # si m cumple lo anterior\n # su cociente debe cumpplirlo o\n # su cociente más uno en el\n # caso de que m sea congurente w-1\n m = m // w + int(m % w == w - 1)\nprint('YES')", "def can_weigh(w, m):\r\n while m > 0:\r\n if (m - 1) % w == 0:\r\n m -= 1\r\n elif (m + 1) % w == 0:\r\n m += 1\r\n elif m % w != 0:\r\n return 'NO'\r\n m //= w\r\n \r\n return 'YES'\r\n\r\n\r\nif __name__ == '__main__':\r\n w, m = map(int, input().split())\r\n result = can_weigh(w, m)\r\n print(result)", "#552C\r\n\r\nfrom math import *\r\n\r\nw,m = map(int, input().split())\r\narr =[]\r\np=1\r\nfor i in range(101):\r\n\tarr.append(p)\r\n\tp*=w\r\narr.reverse()\r\nfor i in range(101):\r\n\tval = abs(m-arr[i])\r\n\tm = min(m,val)\r\nprint (\"NO\" if m else \"YES\")", "w, m = map(int, input().split())\r\na = []\r\nk = 0\r\nwhile m > 0:\r\n k += 1\r\n a.append(m % w)\r\n m //= w\r\na.append(0)\r\nflag = 'YES'\r\nfor i in range(len(a) - 1):\r\n if a[i] == 0 or a[i] == 1:\r\n continue\r\n if a[i] - w < -1 or a[i] - w > 1:\r\n flag = 'NO'\r\n break\r\n a[i + 1] += 1\r\nprint(flag)\r\n\r\n", "w, m = [int(i) for i in input().split()]\n\n\nk = 0\nwhile k <= 100:\n if(m == 0):\n print('YES')\n exit(0)\n d = m % (w)\n if d == 0:\n m = m/w\n k += 1\n elif d == 1:\n k+=1\n m = (m-1)/w\n elif d == w-1:\n m = (m+1)/w\n k+=1\n else:\n print('NO')\n exit(0)\nprint('NO')\n", "y, x = map(int, input().split())\r\ns = []\r\nwhile x > 0:\r\n d = x % y\r\n s.append(d)\r\n x //= y\r\ns.append(x)\r\ncry = 0\r\nfor n in range(len(s)):\r\n s[n] += cry\r\n if s[n] == y:\r\n cry = 1\r\n continue\r\n if 1 < s[n] < y - 1:\r\n print('NO')\r\n exit()\r\n cry = 0\r\n if s[n] == y - 1:\r\n cry = 1\r\nprint('YES')\r\n", "w, m = [int(i) for i in input().split()]\r\nlast = -1\r\nwhile m > 0 and w > 3:\r\n rem = m % w\r\n if rem != w - 1 and rem != 1 and rem != w - 2 and rem != 0:\r\n print(\"NO\")\r\n break\r\n if rem == w - 2 and last == -1:\r\n print(\"NO\")\r\n break\r\n if rem == w - 2 and last == 0:\r\n print(\"NO\")\r\n break\r\n if rem == 1 and last == w - 1:\r\n print(\"NO\")\r\n break\r\n if rem == w - 1 and last == w - 2:\r\n print(\"NO\")\r\n break\r\n if rem == 1 and last == w - 2:\r\n print(\"NO\")\r\n break\r\n last = rem\r\n m //= w\r\nelse:\r\n print(\"YES\")\r\n", "import sys\r\n\r\nn,m=map(int,input().split())\r\nif n<=3:\r\n print(\"YES\")\r\nelse:\r\n carry=0\r\n f=0\r\n while(m>0):\r\n bit=m%n\r\n bit+=carry\r\n carry=0\r\n if bit==n:\r\n carry=1\r\n bit=0\r\n if bit<=1:\r\n pass\r\n elif bit==n-1:\r\n carry=1\r\n else:\r\n f=1\r\n break\r\n m//=n\r\n if f==1:\r\n print(\"NO\")\r\n else:\r\n print(\"YES\")", "w,m=map(int,input().split())\r\nfor i in range(33):\r\n if m>abs(w**(32-i)-m):\r\n m=abs(w**(32-i)-m)\r\nif m==0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s=input().split()\r\nw=int(s[0]);m=int(s[1])\r\nif w<=3:\r\n print(\"YES\")\r\n exit(0)\r\nelse :\r\n while m>0:\r\n if (m+1)%w==0: \r\n m=(m+1)/w\r\n elif m%w==0:\r\n m=m/w\r\n elif (m-1)%w==0:\r\n m=(m-1)/w\r\n else:\r\n print(\"NO\")\r\n exit(0)\r\nprint(\"YES\")", "def solve(num, p):\n return True if num == 0 else False if num >= p * 2 else solve(min(num, abs(p - num)), p // m)\nm, num = map(int, input().split())\np = 1\nwhile p < num: p *= m\nprint(\"YES\" if solve(num, p) else \"NO\")\n", "w, m = [int(i) for i in input().split()]\r\nif (w == 0):\r\n if (m <= 101):\r\n print('YES')\r\n else:\r\n print('NO')\r\n exit(0)\r\na = []\r\nm1 = m\r\nwhile (m1 > 0):\r\n a.append(m1 % w)\r\n m1 //= w\r\nif (len(a) > 101):\r\n print('NO')\r\n exit(0)\r\ns = True\r\nfor i in range(len(a)):\r\n if a[i] != 0 and a[i] != 1:\r\n s = False\r\nif s:\r\n print('YES')\r\n exit(0)\r\ns = True\r\nfor i in range(len(a) - 1):\r\n if a[i] != 0 and a[i] != 1:\r\n a[i] -= w\r\n a[i + 1] += 1\r\n if a[i] != -1 and a[i] != 0:\r\n print('NO')\r\n exit(0)\r\nif a[-1] > 1:\r\n if (len(a) > 100):\r\n print('NO')\r\n exit(0)\r\n a[-1] -= w\r\n if a[-1] != 0 and a[-1] != -1:\r\n print('NO')\r\n exit(0)\r\nprint('YES')", "n,m=map(int,input().split())\nfor i in range(33):\n m=min(m,abs(n**(32-i)-m))\nprint(\"YES\" if m==0 else \"NO\")", "numbers = list(map(int, input().split()))\n\nw = numbers[0]\nm = numbers[1]\n\nno = False\n\nif w <= 3:\n m = 0\n\nwhile m:\n x = m % w\n \n if x <= 1:\n m = m // w\n elif x == w - 1:\n m = m // w + 1\n else:\n no = True\n break\n\nif no is False:\n print('YES')\nelse:\n print('NO')", "import sys\r\nimport math\r\n#from queue import *\r\n#import random\r\n#sys.setrecursionlimit(int(1e6))\r\ninput = sys.stdin.readline\r\n \r\n############ ---- USER DEFINED INPUT FUNCTIONS ---- ############\r\ndef inp():\r\n return(int(input()))\r\ndef inara():\r\n return(list(map(int,input().split())))\r\ndef insr():\r\n s = input()\r\n return(list(s[:len(s) - 1]))\r\ndef invr():\r\n return(map(int,input().split()))\r\n################################################################\r\n############ ---- THE ACTUAL CODE STARTS BELOW ---- ############\r\n\r\nw,m=invr()\r\n\r\nbits=[0]*40\r\nbit=0\r\n\r\nwhile m:\r\n\tbits[bit]=m%w\r\n\tbit+=1\r\n\tm//=w\r\n\r\nfor i in range(bit):\r\n\tif bits[i]!=1 and bits[i]!=0 and bits[i]!=w and bits[i]!=w-1:\r\n\t\tprint(\"NO\")\r\n\t\texit(0)\r\n\telif bits[i]==w or bits[i]==w-1:\r\n\t\tbits[i+1]+=1\r\n\r\nprint(\"YES\")\r\n", "mod = 10**9 + 7\r\n\r\ndef solve():\r\n w, m = map(int, input().split())\r\n\r\n while m > 0:\r\n if m % w == 1:\r\n m -= 1\r\n elif m % w == w - 1:\r\n m += 1\r\n elif m % w != 0:\r\n print(\"NO\")\r\n return\r\n\r\n m //= w\r\n\r\n print(\"YES\")\r\n\r\nt = 1\r\n# t = int(input())\r\nfor _ in range(t):\r\n solve()\r\n", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\nw, m = map(int, input().split())\r\nif w <= 3:\r\n ans = \"YES\"\r\nelse:\r\n dp = [0]\r\n inf = pow(10, 9) + 1\r\n x = 1\r\n while x < inf:\r\n l = len(dp)\r\n for i in range(l):\r\n dp.append(dp[i] - x)\r\n dp.append(dp[i] + x)\r\n x *= w\r\n ans = \"NO\"\r\n for i in [-x, 0, x]:\r\n if m - i in dp:\r\n ans = \"YES\"\r\n break\r\nprint(ans)" ]

[ "#!/usr/bin/python3\n\ndef readln(): return tuple(map(int, input().split()))\n\nprint([0,4,4,4,4,4,4,4,4,4,15,4,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0][readln()[0] - 10])\n", "def main():\n original_points = 10\n needed = int(input())\n dict = {1: 4, 11: 4, 10: 15, 2: 4, 3: 4, 4: 4, 5: 4, 6: 4, 7: 4, 8: 4, 9: 4}\n to_find = needed - original_points\n if to_find not in dict:\n print(0)\n else:\n print(dict[to_find])\nmain()\n", "n=int(input())\r\nn-=10\r\nif n>11: print(0)\r\nelif n==11: print(4)\r\nelif n==10: print(15)\r\nelif n<10 and n>=1: print(4)\r\nelif n<=0: print(0)", "n=int(input())\r\nx=n-10\r\nif x==10 : print(15)\r\nelif 1<=x and x<=11: print(4)\r\nelse : print(0)", "n = int(input())\nw = (n-10) # points needed\nif w == 11 or w == 1:\n print (4)\nelif 2 <= w <= 9:\n print (4)\nelif w == 10:\n print (15)\nelse:\n print (0)\n", "n=int(input())\r\nif n<=10 or n>21:\r\n print(0)\r\nelse:\r\n if n-10 ==10:\r\n print(15)\r\n else:\r\n print(4)", "x = int(input())\r\nif x>21 or x<=10:\r\n\tprint(0)\r\nelif x == 20:\r\n\tprint(15)\r\nelif x <=19 or x == 21:\r\n\tprint(4)", "n = int(input())\r\ncnt = 0;\r\nl = [1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 10, 10, 11]\r\n\r\nfor i in range(0, len(l)):\r\n if l[i] + 10 == n:\r\n cnt = cnt + 4\r\n\r\nif n == 20:\r\n cnt = cnt + 3\r\n\r\nprint(cnt)\r\n", "n = int(input())\r\nif n<11:\r\n s=0\r\nelif n<20 or n==21:\r\n s=4\r\nelif n==20:\r\n s=15\r\nelse:\r\n s=0\r\nprint(s)\r\n", "n=int(input())\r\nif n<=10:\r\n print(0)\r\nelse:\r\n n=n-10\r\n if n>11:\r\n print(0)\r\n else:\r\n if n==10:\r\n print(15)\r\n else:\r\n print(4)", "n = int(input())\r\n\r\nleft = n - 10\r\n\r\nif left < 1:\r\n print(0)\r\nelif left <= 9:\r\n print(4)\r\nelif left == 10:\r\n print(15)\r\nelif left == 11:\r\n print(4)\r\nelse:\r\n print(0)", "n = int(input())\r\nmissing = n - 10\r\nans = 0\r\nif missing > 0 and missing <= 11:\r\n if missing == 10: ans = 15\r\n else: ans = 4\r\nprint(ans)", "n=int(input())\r\n\r\nif n==20:\r\n print(\"15\")\r\nelif n<=10 or n>21:\r\n \r\n \r\n print(\"0\")\r\nelse:\r\n \r\n print(\"4\")", "import sys\r\n\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\n\r\nif n == 20:\r\n print(15)\r\nelif 11 <= n <= 21:\r\n print(4)\r\nelse:\r\n print(0)", "integer = int\r\nstring = str\r\nlength = len\r\n\r\ndef main():\r\n n=integer(input())\r\n left=n-10\r\n if left>11 or left<1:\r\n print(0)\r\n else:\r\n if left==10:\r\n print(15)\r\n else:\r\n print(4)\r\n \r\n\r\n\r\nmain()", "a=int(input())-10\r\nprint((1<=a<=11)*4+(a==10)*11)", "n = int(input())\r\nif n > 21 or n< 11:\r\n print(\"0\")\r\nelif n==20:\r\n print(\"15\")\r\nelse:\r\n print(\"4\")", "i = int(input()) -10\r\n\r\nif i < 1:\r\n print(\"0\")\r\nelif i < 10:\r\n print(\"4\")\r\nelif i == 10:\r\n print(\"15\")\r\nelif i == 11:\r\n print(\"4\")\r\nelse:\r\n print(\"0\")", "n=int(input())\r\nif n<=10 or n>21:\r\n print(0)\r\nelse:\r\n need=n-10\r\n if need == 1:\r\n print(4)\r\n elif need==10:\r\n print(15)\r\n else:\r\n print(4)", "n = int(input())\r\n\r\nif(n>=11 and n<=19):\r\n print(4)\r\nelif(n<=10):\r\n print(0)\r\nelif(n==20):\r\n print(15)\r\nelif(n==21):\r\n print(4)\r\nelse:\r\n print(0)", "n=int(input())-10\r\nif n<1 or n>11:\r\n print(0)\r\nelif(n==10):\r\n print(15)\r\nelse:\r\n print(4)\r\n ", "I = lambda: int(input())\r\nIL = lambda: list(map(int, input().split()))\r\n\r\nn = I()\r\nprint(4 if 11<=n<=19 else 15 if n==20 else 4 if n==21 else 0)", "n=int(input())\r\nk=[1,2,3,4,5,6,7,8,9,11]\r\nif (n-10) in k:\r\n print(4)\r\nelif n-10 == 10:\r\n print(15)\r\nelse:\r\n print(0)", "n = int(input())\r\nif n == 20:\r\n print (15)\r\nelif n < 11:\r\n print(0)\r\nelif n>21:\r\n print(0)\r\nelse:\r\n print(4)\r\n ", "import itertools\nfrom collections import defaultdict\n\ncards = defaultdict(int)\nn = int(input()) - 10\n\ncards = {i:j for i,j in zip(range(2,10), itertools.repeat(4))}\ncards[10] = 15;\ncards[11] = 4;\ncards[1] = 4;\n\nif n <= 0: print(0)\nelif n > 11: print(0)\nelse: print(cards[n])\n", "n = int(input())\r\nc = n - 10\r\n\r\nif c < 1:\r\n print(0)\r\nelse:\r\n if 0 < c < 10 or c == 11:\r\n print(4)\r\n elif c == 10:\r\n print(15)\r\n else:\r\n print(0)", "#!/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 if n >= 11 and n <= 19 or n == 21:\r\n print(4)\r\n elif n == 20:\r\n print(15)\r\n else:\r\n print(0)\r\n", "n = int(input())\n\nres = None\nn -= 10 # queen of spades\nif n in range(1, 10) or n == 11:\n\tres = 4\nelif n == 10:\n\tres = 15\nelse:\n\tres = 0\n\nprint(res)\n", "n=int(input())\r\nd=n-10\r\nif d<=0:\r\n\tprint(0)\r\nelse:\r\n\tif d>11:\r\n\t\tprint(0)\r\n\telif d==10:\r\n\t\tprint(15)\r\n\telse:\r\n\t\tprint(4)\r\n", "kartu=int(input())\r\nif(kartu==10):\r\n print(0)\r\nelif(kartu>21):\r\n print(0)\r\nelif(kartu<10):\r\n print(0)\r\nelse:\r\n kartu=kartu%10\r\n if(kartu==0):\r\n print(15)\r\n else:\r\n print(4)\r\n", "### https://codeforces.com/problemset/problem/104/A\r\ns=int(input())\r\na=10 #queen of spades\r\nb=s-a\r\n\r\nif ((b>=1) & (b<=9)) or (b==11):\r\n print(4)\r\nelif b==10:\r\n print(\"15\")\r\nelse:\r\n print('0')", "n = int(input())\r\nif 11 <= n <= 21:\r\n if n== 20:\r\n print(15)\r\n else:\r\n print(4)\r\nelse:\r\n print(0)", "n = int(input())\r\n\r\nt = n-10\r\n\r\nif(t==2 or t==4 or t==3 or t==5 or t==6 or t==7 or t==8 or t==9):\r\n print(\"4\")\r\n\r\nelif (t==10):\r\n print(\"15\")\r\n \r\nelif(t==1 or t==11):\r\n print(\"4\")\r\n \r\nelse:\r\n print(\"0\")", "n=int(input(\"\"))\r\nif(n<=10 or n>=22):\r\n print(\"0\")\r\nelif((n-10)<=11):\r\n if(n==20):\r\n print(\"15\")\r\n else:\r\n print(\"4\")\r\n", "n=int(input())-10\r\nif(n>1 and n<10) or n==1 or n==11:\r\n print(4)\r\nelif(n==10):\r\n print(15)\r\nelse:\r\n print(0)\r\n", "n = int(input())\r\nn = n - 10\r\nif n > 11 or n < 0 or n == 0:\r\n print (0)\r\nelif n == 11 or n >= 2 and n <= 9 or n == 1:\r\n print (4)\r\nelif n == 10:\r\n print (15)", "deck = [i for i in range(1, 12)] * 4 + [10, 10, 10] * 4\r\ndeck.remove(10) # removing the queen of spade\r\nn = int(input()) - 10\r\nprint(deck.count(n))\r\n", "# -*- coding: utf-8 -*-\n\n\n\ndef solve():\n n = int(input())\n\n if n <= 10 or n >= 22: print(0)\n elif n == 20: print(15)\n else: print(4)\n \ndef main():\n t = 1\n # t = int(input())\n for i in range(t):\n solve()\n\nif __name__ == \"__main__\":\n main()\n\t\t \t\t\t\t\t \t \t \t \t \t \t", "def main():\r\n \r\n def solve(n):\r\n n -= 10\r\n # ways to get n\r\n if n in [2,3,4,5,6,7,8,9]:\r\n return 4\r\n elif n in [1,11]:\r\n return 4\r\n elif n == 10:\r\n return 15\r\n else:\r\n return 0\r\n \r\n n = int(input())\r\n print(solve(n))\r\n \r\npy2 = round(0.5)\r\nif py2:\r\n from future_builtins import ascii, filter, hex, map, oct, zip\r\n range = xrange\r\n \r\nimport os, sys, math\r\nfrom io import IOBase, BytesIO\r\nfrom collections import Counter, deque, defaultdict\r\n \r\nBUFSIZE = 8192\r\nclass FastIO(BytesIO):\r\n newlines = 0\r\n \r\n def __init__(self, file):\r\n self._file = file\r\n self._fd = file.fileno()\r\n self.writable = \"x\" in file.mode or \"w\" in file.mode\r\n self.write = super(FastIO, self).write if self.writable else None\r\n \r\n def _fill(self):\r\n s = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\r\n self.seek((self.tell(), self.seek(0,2), super(FastIO, self).write(s))[0])\r\n return s\r\n \r\n def read(self):\r\n while self._fill(): pass\r\n return super(FastIO,self).read()\r\n \r\n def readline(self):\r\n while self.newlines == 0:\r\n s = self._fill(); self.newlines = s.count(b\"\\n\") + (not s)\r\n self.newlines -= 1\r\n return super(FastIO, self).readline()\r\n \r\n def flush(self):\r\n if self.writable:\r\n os.write(self._fd, self.getvalue())\r\n self.truncate(0), self.seek(0)\r\n \r\nclass IOWrapper(IOBase):\r\n def __init__(self, file):\r\n self.buffer = FastIO(file)\r\n self.flush = self.buffer.flush\r\n self.writable = self.buffer.writable\r\n if py2:\r\n self.write = self.buffer.write\r\n self.read = self.buffer.read\r\n self.readline = self.buffer.readline\r\n else:\r\n self.write = lambda s:self.buffer.write(s.encode('ascii'))\r\n self.read = lambda:self.buffer.read().decode('ascii')\r\n self.readline = lambda:self.buffer.readline().decode('ascii')\r\n \r\n \r\nsys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)\r\ninput = lambda: sys.stdin.readline().rstrip('\\r\\n')\r\n \r\n# My magical way of doing recursion in python. This\r\n# isn't the fastest, but at least it works.\r\nfrom types import GeneratorType\r\ndef bootstrap(func, stack=[]):\r\n def wrapped_function(*args, **kwargs):\r\n if stack:\r\n return func(*args, **kwargs)\r\n else:\r\n call = func(*args, **kwargs)\r\n while True:\r\n if type(call) is GeneratorType:\r\n stack.append(call)\r\n call = next(call)\r\n else:\r\n stack.pop()\r\n if not stack:\r\n break\r\n call = stack[-1].send(call)\r\n return call\r\n \r\n return wrapped_function\r\n \r\nif __name__== \"__main__\":\r\n main()", "n = int(input())\r\nif(n<=10 or n>21):\r\n print(0)\r\n exit(0)\r\nx = n-10\r\nif(x==10):\r\n print(15)\r\nelse:\r\n print(4)", "q = int(input())\r\nif q <= 10 or q > 21:\r\n print(0)\r\nelif q == 20:\r\n print(15)\r\nelse:\r\n print(4)", "n = int(input())\r\n\r\nif n <= 10:\r\n print(\"0\")\r\n\r\nelse:\r\n t = n - 10\r\n if t > 11:\r\n print(\"0\")\r\n elif t == 10:\r\n print(\"15\")\r\n else:\r\n print(\"4\")", "n = int(input())\r\nn -= 10\r\nif (n < 10 or n == 11) and n >= 1:\r\n print(4)\r\nelif n < 1 or n > 11:\r\n print(0)\r\nelse:\r\n print(15)\r\n", "\r\nn = int(input())\r\nlp = []\r\nl = [2, 3, 4, 5, 6, 7, 8, 9, 10, 10, 10, 10, 11, 1]\r\nfor i in l:\r\n\tfor _ in range(4):\r\n\t\tlp.append(i)\r\n\r\nlp.remove(10)\r\nd = n - 10\r\nprint(lp.count(d))\r\n", "import sys\r\nimport math\r\nimport bisect\r\nimport itertools\r\nimport random\r\n\r\n\r\ndef main():\r\n n = int(input())\r\n d = n - 10\r\n if d == 10:\r\n ans = 15\r\n elif d == 11:\r\n ans = 4\r\n elif d >= 1 and d <= 9:\r\n ans = 4\r\n else:\r\n ans = 0\r\n print(ans)\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n = int(input())\n\nif n <= 10:\n print(0)\nelif n <= 19:\n print(4)\nelif n == 20:\n print(15)\nelif n == 21:\n print(4)\nelif n <= 25:\n print(0)\n", "n = int(input())\nn = n-10\nif n == 0: \n print(\"0\")\nelif n>0 and n < 10:\n print(\"4\")\nelif n == 10:\n print(\"15\")\nelif n == 11: \n print(\"4\")\nelse:\n print(\"0\")\n", "from sys import stdout\r\n \r\nn = int(input())\r\n \r\nif n < 11 or n > 21:\r\n stdout.write('0')\r\nelif n == 20:\r\n stdout.write('15')\r\nelse:\r\n stdout.write('4')", "inp = int(input()) - 10\n\nif (inp >= 1) and (inp <= 9):\n print(4)\nelif inp == 10:\n print(15)\nelif inp == 11:\n print(4)\nelse:\n print(0)\n", "#!/usr/bin/env python3\r\n\r\ntarget = int(input().rstrip())\r\nneed = target - 10\r\n\r\nif (need > 0 and need < 10) or need == 11:\r\n print(4)\r\nelif need == 10:\r\n print(15)\r\nelse:\r\n print(0)\r\n", "n = int(input())\n\nif n <= 10:\n print('0')\nelif n > 10 and n < 20 or n==21:\n print('4')\nelif n == 20:\n print(15)\nelse: \n print(0)", "n = int ( input () )\nif n >= 1 and n <= 25: \n b = int ( n - 10 )\nif b < 10 and b > 0:\n print ( 4 )\nelif b == 10 :\n print ( 15 )\nelif b == 11 :\n print ( 4 )\nelse : \n print ( 0 )\n", "from sys import stdin, stdout\r\nimport math,sys\r\nfrom itertools import permutations, combinations\r\nfrom collections import defaultdict,deque,OrderedDict\r\nimport bisect as bi\r\nimport heapq \r\n\r\n'''\r\n#------------------PYPY FAst I/o--------------------------------#\r\n \r\ndef I():return (int(stdin.readline()))\r\ndef In():return(map(int,stdin.readline().split()))\r\n'''\r\n#------------------Sublime--------------------------------------#\r\n \r\n#sys.stdin=open('input.txt','r');sys.stdout=open('output.txt','w');\r\ndef I():return (int(input()))\r\ndef In():return(map(int,input().split()))\r\n\r\n\r\n\r\ndef main():\r\n try:\r\n n=I()-10\r\n if n==0:\r\n print(0)\r\n elif n>=2 and n<=9:\r\n print(4)\r\n elif n==10:\r\n print(15)\r\n elif n==11 or n==1:\r\n print(4)\r\n else:\r\n print(0) \r\n except:\r\n pass\r\n \r\nM = 998244353\r\nP = 1000000007\r\n \r\nif __name__ == '__main__':\r\n for _ in range(1):\r\n main()", "n=int(input())\nk=n-10\nif k==0 or k<0 or k>11:\n print(0)\nelif k==10:\n print(15)\nelse:\n print(4)", "n=int(input())\r\nq=10\r\n# l=[1,2,3,4,5,6,7,8,9,10,11]\r\n\r\nsu=n-10\r\nif su>0 and su<12:\r\n\tif su==10:\r\n\t\tprint(15)\r\n\telse:\r\n\t\tprint(4)\r\nelse:\r\n\tprint(0)", "a = [0,0,0,0,0,0,0,0,0,0,0,4,4,4,4,4,4,4,4,4,15,4,0,0,0,0]\r\nprint(a[int(input())])\r\n", "n = int(input()) - 10\r\nk = 0\r\nfor i in range(1, 12):\r\n if n - i == 0:\r\n if i == 10:\r\n k += 15\r\n else:\r\n k += 4\r\nprint(k)", "n = int(input())\r\nif n <= 10 or n >= 22:\r\n print(0)\r\nelif (n >= 11 and n <= 19) or n == 21:\r\n print(4)\r\nelif n == 20:\r\n print(15)\r\n", "n=int(input())-10\r\nif n==10:\r\n print(15)\r\nelif 0<n<12:\r\n print(4)\r\nelse:\r\n print(0)", "n=int(input())\r\nn=n-10\r\nif(n<=0 or n>11):\r\n print(0)\r\nelif(n==10):\r\n print(15)\r\nelse:\r\n print(4)", "n=int(input())\r\nif n>-1 and n<=10:\r\n print(0)\r\nelif n==11:\r\n print(4)\r\nelif n>11 and n<=19: \r\n print(4)\r\nelif n==20:\r\n print(15)\r\nelif n==21:\r\n print(4)\r\nelif n>=22 and n<=25:\r\n print(0)\r\n ", "n=int(input())\r\nif 11<=n<=19 or n==21:print(4)\r\nelif n==20:print(15)\r\nelse:print(0)", "n=int(input())\r\nif 10<n<=21:\r\n if n==20:\r\n print(15)\r\n else:\r\n print(4)\r\nelse:\r\n print(0)\r\n \r\n \r\n", "n=int(input())\r\nif n<=10 or n>21 :\r\n print(0)\r\nelif n<20 or n==21:\r\n print(4)\r\nelse :\r\n print(15)", "t = int(input())\r\nif t < 11 or t > 21:\r\n print(0)\r\nelif t == 20:\r\n print(15)\r\nelse:\r\n print(4)\r\n", "n = int(input())\r\nn -= 10\r\nif n ==10:\r\n\tprint(15)\r\nelif 1<=n<=11:\r\n\tprint(4)\r\nelse:\r\n\tprint(0)\r\n", "def mogucnosti(zbir):\r\n if 10 >= zbir or zbir - 10 > 11:\r\n return 0\r\n elif zbir - 10 == 10:\r\n return 15\r\n else:\r\n return 4\r\n\r\n\r\nn = int(input())\r\nprint(mogucnosti(n))", "n = int(input())\r\nt = n - 10\r\nK = 0\r\nif t in [1,2,3,4,5,6,7,8,9,11]:\r\n K+=4\r\nelif t == 10:\r\n K+=15\r\nprint(K)\r\n", "import sys\r\nfrom os import path\r\nif(path.exists('input.txt')):\r\n sys.stdin = open(\"input.txt\",\"r\")\r\n sys.stdout = open(\"output.txt\",\"w\")\r\n\r\nimport math\r\n \r\nn = int(input())\r\nn -= 10\r\n\r\nlst = [1,2,3,4,5,6,7,8,9,10,11]\r\n\r\nif n <= 0 or n not in lst:\r\n print(0)\r\nelif n == 10:\r\n print(15)\r\nelse:\r\n if n in lst:\r\n print(4)", "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<=10:\r\n ans = 0\r\nelif n<20:\r\n ans = 4\r\nelif n==20:\r\n ans = 15\r\nelif n==21:\r\n ans = 4\r\nelse:\r\n ans = 0\r\n\r\nprint(str(ans)+\"\\n\")\r\n", "x=int(input())\r\nif x<=10:\r\n print(0)\r\n exit()\r\nx-=10\r\np=[2,3,4,5,6,7,8,9,10,11,1,10,10,10]\r\nk=p.count(x)\r\nif x==10:\r\n k-=1\r\n print((k*4)+3)\r\nelse:print(k*4)", "\nn = int(input())-10\n\nif n <= 0 or n > 11:\n print('0')\nelif 1 <= n < 10 or n == 11:\n print('4')\nelif n == 10:\n print('15')\n", "n = int(input())\r\npoints = [1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 10, 10, 10, 11]\r\npoints2 = [1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 10, 10, 11]\r\na = 0\r\nfor i in range(3):\r\n for i in points:\r\n if i+10 == n:\r\n a+=1\r\nfor i in points2:\r\n if i+10 == n:\r\n a+=1\r\nprint(a)", "n=int(input())\r\nif n>10 and n<20:\r\n print(4)\r\nelif n==20:\r\n print(15)\r\nelif n==21:\r\n print(4)\r\nelse:\r\n print(0)", "Main = int(input())\r\nNum = 10\r\nCount = 0\r\n\r\nCard1 = [[1,11],2,3,4,5,6,7,8,9,10,10,10,10]\r\nCard2 = [[1,11],2,3,4,5,6,7,8,9,10,10,10,10]\r\nCard3 = [[1,11],2,3,4,5,6,7,8,9,10,10,10,10]\r\nCard4 = [[1,11],2,3,4,5,6,7,8,9,10,10,10]\r\n\r\nfor i in range(len(Card1)):\r\n if(i==0):\r\n for j in range(len(Card1[i])):\r\n if(Num+int(Card1[i][j])==Main):\r\n Count+=1\r\n else:\r\n if(Num+int(Card1[i])==Main):\r\n Count+=1\r\n\r\nfor i in range(len(Card2)):\r\n if(i==0):\r\n for j in range(len(Card2[i])):\r\n if(Num+int(Card2[i][j])==Main):\r\n Count+=1\r\n else:\r\n if(Num+int(Card2[i])==Main):\r\n Count+=1\r\n\r\nfor i in range(len(Card3)):\r\n if(i==0):\r\n for j in range(len(Card3[i])):\r\n if(Num+int(Card3[i][j])==Main):\r\n Count+=1\r\n else:\r\n if(Num+int(Card3[i])==Main):\r\n Count+=1\r\n\r\nfor i in range(len(Card4)):\r\n if(i==0):\r\n for j in range(len(Card4[i])):\r\n if(Num+int(Card4[i][j])==Main):\r\n Count+=1\r\n else:\r\n if(Num+int(Card4[i])==Main):\r\n Count+=1\r\n\r\nprint(Count)", "n=int(input())\r\nm=n-10\r\nif m>0 and m<10:\r\n print(\"4\")\r\nelif m==11:\r\n print(\"4\")\r\nelif m==10:\r\n print(\"15\")\r\nelse:\r\n print(\"0\")", "n = input()\r\nn = int(n) - 10\r\n\r\nif n < 1:\r\n print(0)\r\n exit()\r\nelif n == 10:\r\n print(4*3+3)\r\n exit()\r\nelif n == 1 or n == 11:\r\n print(4)\r\n exit()\r\n\r\nnumberCards = [2, 3, 4, 5, 6, 7, 8, 9]\r\nwinWays = 0\r\n\r\nfor x in numberCards:\r\n for i in range(4):\r\n if x == n:\r\n winWays+=1\r\nprint(winWays)", "import sys\r\ninput = sys.stdin.readline\r\n\r\n############ ---- Input Functions ---- ############\r\ndef inp():\r\n return(int(input()))\r\ndef inlt():\r\n return(list(map(int,input().split())))\r\ndef insr():\r\n s = input()\r\n return(list(s[:len(s) - 1]))\r\ndef invr():\r\n return(map(int,input().split()))\r\n############ ---- Input Functions ---- ############\r\n\r\ndef Blackjack():\r\n n = inp()\r\n possiblePoints = [x for x in range(1,12)]\r\n possiblePoints.remove(10)\r\n\r\n remainingPoints = n - 10\r\n\r\n if remainingPoints in possiblePoints:\r\n print(4)\r\n elif remainingPoints == 10:\r\n print(15)\r\n else:\r\n print(0)\r\n return \r\n\r\nBlackjack()", "n = int(input())\r\na = 0\r\nif n-10<=0 or n-10>11:\r\n print(0)\r\nelse:\r\n a = n-10\r\n if 1<=a<=9:\r\n print(4)\r\n elif a==10:\r\n print(15)\r\n elif a==11:\r\n print(4)\r\n ", "n=int(input())\r\nn-=10\r\nA=[1,2, 3, 4, 5, 6, 7, 8, 9,10,10,10,10,11,1,2, 3, 4, 5, 6, 7, 8, 9, 10,10,10,10,11,1,2, 3, 4, 5, 6, 7, 8, 9, 10,10 ,10 ,11, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10,10,10,10,11]\r\nprint(A.count(n))", "n = int(input())\r\nif n in range(0,11) or n in range(22,26):\r\n print(0)\r\nelif n == 20:\r\n print(15)\r\nelse:\r\n print(4)", "n=int(input())\r\nm=n-10\r\nif m<=11 and m>=1:\r\n if (m<=9 and m>=1) or m==11:\r\n print( 4)\r\n else:\r\n print(15)\r\nelse:\r\n print(0)", "n = int(input()) - 10\r\n\r\nif n == 10:\r\n print(15)\r\nelif 1 <= n <= 11:\r\n print(4)\r\nelse:\r\n print(0)\r\n", "def func():\n n = int(input())\n # x = n-10\n if n<=10 or n>21:\n print(0)\n elif n<20:\n print(4)\n elif n==20:\n print(15)\n else:\n print(4)\n\n\nif __name__ == \"__main__\":\n func()\n\t\t \t\t\t \t\t\t\t \t\t\t\t\t\t \t\t \t \t\t\t", "t=int(input())\r\nx=t-10\r\n\r\nif x==1:\r\n print(4)\r\nelif x>=2 and x<=9:\r\n print(4)\r\nelif x==10:\r\n print(15)\r\nelif x==11:\r\n print(4)\r\nelse:\r\n print(0)\r\n", "\n\n\ndef run():\n x = int(input())\n\n arr = []\n for i in range(2, 10):\n for _ in range(4):\n arr.append(i)\n for _ in range(15):\n arr.append(10)\n\n x -= 10\n\n if x in [1, 11]:\n print(4)\n else:\n print(arr.count(x))\n\n\n\n\n\n\nif __name__=='__main__':\n run()\n\n\n", "m=int(input())\r\nprint((10<m<22)*4+(m==20)*11) ", "from collections import Counter\r\ncardsCounter = Counter(\"123456789\"*4)\r\ncardsCounter[\"10\"] = 4+9+2\r\n\r\nn = int(input())\r\nif n<=10:\r\n print(0)\r\nelse:\r\n rem = n-10 #for queen of spades\r\n if rem==11:\r\n rem=1\r\n print(cardsCounter[str(rem)])\r\n", "import sys,os,io,time,copy,math\r\nfrom collections import deque\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\ndef main():\r\n n=int(input())\r\n dic={1:1,2:1,3:1,4:1,5:1,6:1,7:1,8:1,9:1,10:4,11:1}\r\n req=n-10\r\n count=0\r\n for d in dic:\r\n if d==req:\r\n count+=dic[d]\r\n count*=4\r\n if req==10:\r\n count-=1\r\n print(count)\r\n\r\n\r\nmain()\r\n", "n=int(input())\r\nn=n-10\r\nif n<=0 or n>11:\r\n print(\"0\")\r\nelif n==1 or n==11:\r\n print(\"4\")\r\nelif n>=2 and n<=9:\r\n print(\"4\")\r\nelif n==10:\r\n print(\"15\")\r\n ", "l=int(input())\r\nval=l-10\r\nif 1<=val<10:\r\n print(4)\r\nelif val==10:\r\n print(15)\r\nelif val==11:\r\n print(4)\r\nelse:\r\n print(0)", "l=[4,4,4,4,4,4,4,4,4,15,4]\r\nn=int(input())\r\nif n-10-1<0 or n-10-1>10:\r\n print(0)\r\nelse:\r\n print(l[n-10-1])\r\n", "n = int(input())\ntarget = n - 10\nif(target < 1):\n\tprint('0')\nelif(target > 11):\n\tprint('0')\nelif(target == 10):\n\tprint('15')\nelse:\n\tprint('4')", "n = int(input())-10\r\nif n <=0 or n>11:print(0)\r\nelif n ==11 or n <10:print(4)\r\nelif n==10:print(15)", "x = int(input())\r\nx-=10\r\nif 1<=x<=9:\r\n print(4)\r\nelif x==10:\r\n print(15)\r\nelif x==11:\r\n print(4)\r\nelse:print(0)", "n=int(input())\r\nc=n-10\r\nif c<=0:\r\n print(0)\r\nelif c>11:\r\n print(0)\r\nelse:\r\n if c==10:\r\n print(15)\r\n else:\r\n print(4)", "n = int(input())\r\nif 11 <= n <= 19 or n == 21 : print(4)\r\nelif n == 20 : print(15)\r\nelse : print(0)", "n=int(input())\r\nif n == 21:\r\n print(4)\r\nelse:\r\n n=n-10\r\n if n==0:\r\n print(0)\r\n elif n>0 and n<10:\r\n print(4)\r\n elif n==10:\r\n print(15)\r\n else:\r\n print(0)", "a = int(input())\r\nif (a >= 0 and a <11) or (a>21 and a<26):\r\n print(\"0\")\r\nelif (a>10 and a<20) or (a == 21):\r\n print(\"4\")\r\nelif (a == 20):\r\n print(\"15\")", "n=int(input())\r\nif n<=10 or n>=22:\r\n ans=0 \r\nelif n==20:\r\n ans=15\r\nelse:\r\n ans=4\r\nprint (ans)", "# coding: utf-8\nn = int(input())\nif n <= 10:\n print(0)\nelif n <= 19:\n print(4)\nelif n == 20:\n print(15)\nelif n == 21:\n print(4)\nelse:\n print(0)\n", "n = int(input())\r\nif (n - 10 == 0 or n - 10 > 10 or n - 10 < 0) and n - 10 != 11:\r\n print(0)\r\nelif n - 10 == 10:\r\n print(15)\r\nelse:\r\n print(4)", "n = int(input())\n\nif n < 11 :\n print(0)\nelif n < 20 :\n print(4)\nelif n < 21 :\n print(15)\nelif n < 22 :\n print(4)\nelse:\n print(0)\n", "\r\n\r\ndef main():\r\n n = int(input())\r\n cards = [1, 1, 1, 1, 2, 2, 2, 2, 3, 3, 3, 3, 4, 4, 4, 4, 5, 5, 5, 5, 6, 6, 6, 6, 7, 7, 7, 7, 8, 8, 8, 8, 9, 9, 9, 9, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10,10,10, 11, 11, 11, 11]\r\n ans = 0\r\n start = 10\r\n for i in range(len(cards)):\r\n if (cards[i] + start) == n:\r\n ans += 1\r\n\r\n print(ans)\r\n\r\nmain()\r\n", "n=int(input())\r\nd={0:0,1:4,2:4,3:4,4:4,5:4,6:4,7:4,8:4,9:4,10:15,11:4}\r\nif n>=10:\r\n n-=10\r\n if n<=11:\r\n print(d[n])\r\n else:\r\n print(0)\r\nelse:\r\n print(0)", "n = int(input())\n\nif n - 10 <= 0 or n - 10 >= 12:\n print(0)\n quit()\n\nif n - 10 == 10:\n print(4*4 - 1)\nelif n - 10 == 11:\n print(4)\nelse:\n print(4)\n", "n = int(input())\r\n\r\nr = n - 10\r\n\r\nif r <= 0:\r\n print(0)\r\nelif r == 10:\r\n print(15)\r\nelif r > 11:\r\n print(0)\r\nelse:\r\n print(4)", "n = int(input())\n\nif n > 21 or n < 11:\n print(\"0\")\n \nelif n == 20:\n print(\"15\")\n \nelse:\n print(\"4\")", "x=int(input())\r\nprint(0 if x<=10 or x>21 else 15 if x==20 else 4)", "n = int(input()) - 10\r\nt = [2, 3, 4, 5, 6, 7, 8, 9, 10]\r\nif n < 1 or n > 11: print(0)\r\nelif n < 10: print(4)\r\nelif n == 11: print(4)\r\nelse: print(15)", "n = int(input())\r\nif (n-10)<=0 or (n-10)>=12:\r\n print(0)\r\nelif (n-10) != 10:\r\n print(4)\r\nelse:\r\n print(15)", "n=int(input())\r\nif(n==11):\r\n print(4)\r\nelif(12<=n<20):\r\n print(4)\r\nelif(n==20):\r\n print(15)\r\nelif(n==21):\r\n print(4)\r\nelse:\r\n print(0)", "# Author: πα\r\n\r\ndef out(n):\r\n if n < 1 or n > 11:\r\n return 0\r\n if n == 10:\r\n return 15\r\n return 4\r\n\r\nprint(out(int(input()) - 10))", "cards = {1: 4, 2: 4, 3: 4, 4: 4, 5: 4, 6: 4, 7: 4, 8: 4, 9: 4, 10: 15, 11: 4, 12: 0, 13: 0, 14: 0, 15: 0}\nn = int(input())\nprint(0 if n <= 10 else cards[n - 10])\n", "n=int(input())-10\r\n\r\n\r\n\r\nif n==0:\r\n print(0)\r\nelif n>=1 and n<=11 and n!=10:\r\n print(4)\r\nelif n==10:\r\n print(15)\r\nelse :\r\n print(0)", "a=int(input())\r\nb = a-10\r\nif b>=1 and b<10:\r\n\tprint(4)\r\nelif b==10:\r\n\tprint(15)\r\nelif b==11:\r\n\tprint(4)\r\nelse:\r\n\tprint(0)\r\n\r\n\r\n", "n = int(input())\r\n\r\nn-=10\r\nans=0\r\nif (n<10 and n>0) or n==11:\r\n\tans=4\r\nelif n==10:\r\n\tans=15\r\nprint(ans)\r\n", "n=int(input())-10\r\nif 2<=n<=9:\r\n print(4)\r\n exit(0)\r\nelif n==10:\r\n print(15)\r\n exit(0)\r\nelif n==11:\r\n print(4)\r\nelif n==1:\r\n print(4)\r\nelse:\r\n print(0)", "a = int(input())\r\n\r\nif a < 11:\r\n print(0)\r\nelif a in range(11, 22):\r\n if a == 20:\r\n print(15)\r\n else:\r\n print(4)\r\nelif a in range(22, 26):\r\n print(0)\r\n", "n=int(input())\r\nif (n <= 10 or n > 21):\r\n\r\n print(0)\r\n\r\nelif (n == 20):\r\n\r\n print(15)\r\n\r\nelse:\r\n\r\n print(4)\r\n\r\n", "n=int(input())\nif(n<=10 or n>21):\n\tprint(0)\nelse:\n\tdiff=n-10\n\tif(diff==10):\n\t\tprint(15)\n\telse:\n\t\tprint(4)", "n = int(input())\nif n <= 10 or n > 21:\n print(0)\nelse:\n if n == 20:\n print(15)\n else:\n print(4)\n", "def solve(n):\r\n if n <= 10 or n >= 22:\r\n return 0\r\n if n == 20:\r\n return 15\r\n return 4\r\nn = int(input())\r\nprint(solve(n))", "n = int(input())\r\n'''\r\n1 - 9 = 4\r\n\r\n10\r\n 4 Value\r\n king 4\r\n queen 3\r\n jack 4\r\n11\r\n 4\r\n\r\n'''\r\n\r\nn-=10\r\n\r\nif (n>=1 and n<=9) or n==11:\r\n print(4)\r\nelif n==10:\r\n print(15)\r\nelse:\r\n print(0)", "dic = {1:4,11:4,2:4,3:4,4:4,5:4,6:4,7:4,8:4,9:4,10:15}\r\nn = int(input())\r\nif n<=10 or n>=22:\r\n print(0)\r\n exit()\r\nprint(dic[n-10])", "n = int(input())\r\nif n-10 < 1 or n-10 > 11:\r\n print(0)\r\nelse:\r\n if n-10 == 10:\r\n print(15)\r\n else:\r\n print(4)", "from collections import defaultdict\r\n\r\ndic = defaultdict(int, {1: 4, 2: 4, 3: 4, 4: 4, 5: 4, 6: 4, 7: 4, 8: 4, 9: 4, 10: 15, 11: 4})\r\nn = int(input())\r\nprint(dic[n - 10])\r\n", "n = int(input())\nn-=10\nans=0\nif (n<10 and n>0) or n==11:\n\tans=4\nelif n==10:\n\tans=15\nprint(ans)\n", "n=int(input());\r\nif n < 11: print(0)\r\nelif n < 20: print(4)\r\nelif n == 20: print(15)\r\nelif n == 21: print(4)\r\nelse: print(0)", "n = int(input())\r\n\r\nif n <= 10 :\r\n print(0)\r\nelse:\r\n if n <= 19:\r\n print(4)\r\n elif n == 20:\r\n print(15)\r\n elif n == 21:\r\n print(4)\r\n else:\r\n print(0)", "import sys\r\n\r\ndef main():\r\n n = int(sys.stdin.read().strip())\r\n if n < 11: return 0\r\n return n == 20 and 15 or n < 22 and 4 or 0\r\n\r\nprint(main())\r\n", "n = int(input())\r\nif n<11 or n>21:\r\n print(0)\r\nelse:\r\n if n == 20:\r\n print(15)\r\n else:\r\n print(4)", "n = int(input())\r\nif n < 11:\r\n print(0)\r\nelif n < 20:\r\n print(4)\r\nelif n == 20:\r\n print(15)\r\nelif n == 21:\r\n print(4)\r\nelse:\r\n print(0)", "# import sys \r\n# sys.stdin=open(\"input.in\",'r')\r\n# sys.stdout=open(\"out.out\",'w')\r\nn=int(input())-10\r\nif n<=0:\r\n\tprint(0)\r\nelif n==10:\r\n\tprint(15)\r\nelif n<12:\r\n\tprint(4)\r\nelse:\r\n\tprint(0)", "a=int(input())\nprint((10<a<22)*4+(a==20)*11)", "n = int(input())\nif (1 <= n <= 10 or 22 <= n):\n print(\"0\")\nelif (11 <= n <= 19 or n == 21):\n print(\"4\")\nelif n == 20:\n print(\"15\")\n\n\n", "n = int (input())\n\nr = n - 10\n\nif r <= 0:\n print (0)\nelif r == 10:\n print (15)\nelif r > 11:\n print (0)\nelse:\n print (4)", "n = int(input())\r\n\r\nif n > 10 and n <= 19:\r\n print(4)\r\nelif n == 20:\r\n print(15)\r\nelif n == 21:\r\n print(4)\r\nelse:\r\n print(0)", "n = int(input())\r\n\r\nif (11 <= n <= 21) and n != 20:\r\n print(4)\r\n \r\nelif n == 20:\r\n print(15)\r\n \r\nelse:\r\n print(0)", "from collections import defaultdict, deque\nfrom functools import lru_cache\nfrom heapq import heappush, heappop\nfrom typing import Counter\nimport math\n #int(input())\n #arr = list(map(int, input().split()))\n #n,m = map(int, input().split())\n #graph = defaultdict(list)\n \n #a,b = map(int, input().split())\n #graph[a].append(b)\n #graph[b].append(a)\n #MOD = 10**9 + 7\n\ndef solution():\n n = int(input())\n n -= 10\n\n res = 4\n if n < 1 or n > 11:\n res = 0\n if n == 10:\n res += 2*4 + 3\n\n print(res)\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", "n = int(input())\n\nn -= 10\ncnt = 0\nif n > 0:\n if n > 11 or n == 0:\n cnt = 0\n elif n == 10:\n cnt = 15\n else:\n cnt = 4\n\nprint(cnt)\n\n", "n = int(input())\r\nif n>=0 and n<=10:print(0)\r\nelif (n>=12 and n<=19) or n==11 or n==21:print(4)\r\nelif n==20:print(15)\r\nelse: print(0)", "x = int(input())\r\n\r\nif x in range(11, 20) or x == 21:\r\n print(4)\r\nelif x == 20:\r\n print(15)\r\nelse:\r\n print(0)", "n = int(input())\r\nls1 = [2, 3]\r\nls = [1, 1, 1, 1, 2, 2, 2, 2, 3, 3, 3, 3, 4, 4,4 ,4 ,5 ,5 ,5, 5, 10, 10, 10, 6, 6, 6, 6,7 ,7, 7, 7, 8 ,8, 8, 8, 9 ,9, 9,9 ,10, 10,10, 10,10, 10,10, 10,10, 10,10, 10, 11, 11, 11, 11]\r\n#print(len(ls))\r\ncount = 0\r\nfor card in ls:\r\n if card+10 == n:\r\n count += 1\r\nprint(count)\r\n", "n = int(input())\n\nif n == 20:\n print(15)\nelif 1 <= n - 10 <= 9 or n - 10 == 11:\n print(4)\nelse:\n print(0)\n", "n=int(input())\r\nif n<=10 or n>21:\r\n print(0)\r\nelse:\r\n if n==20:\r\n print(15)\r\n else:\r\n print(4)", "n=int(input())\r\nif n<=10:\r\n\tprint(0)\r\nelse:\r\n\tif n>10 and n<20:\r\n\t\tprint(4)\r\n\telse:\r\n\t\tif n==20:\r\n\t\t\tprint(15)\r\n\t\telif n==21:\r\n\t\t\tprint(4)\r\n\t\telse:\r\n\t\t\tprint(0)\r\n\t\t\r\n", "\r\nn = int(input())\r\n \r\nif n <= 10:\r\n print('0')\r\nelif n > 10 and n < 20 or n==21:\r\n print('4')\r\nelif n == 20:\r\n print(15)\r\nelse: \r\n print(0)", "n = int(input())\r\nif 11<=n<=19 or n==21:\r\n print(4)\r\nelif n==20:\r\n print(15)\r\nelse:\r\n print(0)", "n=int(input())\r\nif(1<=n<=10 or 22<=n<=25):\r\n print(0)\r\nelif(11<=n<=19 or n==21):\r\n print(4)\r\nelif(n==20):\r\n print(15)", "n = int(input())\r\na = n - 10\r\nnumb = [i for i in range(1, 10)] + [11]\r\nif a in numb:\r\n\tprint(4)\r\nelif a == 10:\r\n\tprint(15)\r\nelse:\r\n\tprint(0)", "n=int(input())\r\ns=n-10\r\nif s>=1 and s<=9:\r\n\tprint(\"4\")\r\nelif s==10:\r\n\tprint(\"15\")\r\nelif s==11:\r\n\tprint(\"4\")\r\nelse:\r\n\tprint(\"0\")", "n=int(input())-10\r\na=[1,11]*4+[2,3,4,5,6,7,8,9]*4+[10]*15\r\nprint(a.count(n))", "sm = int(input()) - 10;req = {0:0,1:4,2:4,3:4,4:4,5:4,6:4,7:4,8:4,9:4,10:15,11:4}\r\nreq.setdefault(sm,0)\r\nprint(req[sm])", "n=int(input())\r\n\r\nif n <= 10 or n > 21:\r\n print(0)\r\n\r\nelif n <= 19:\r\n print(4)\r\nelif n == 20:\r\n print(15)\r\nelif n == 21:\r\n print(4)\r\n ", "n = int(input())\ntarget = n - 10\nif target >= 1 and target <= 9 or target == 11:\n print(4)\nelif target == 10:\n print(15)\nelse:\n print(0)", "n = (int)(input())\r\nif n <= 10 : print(0)\r\nelif n <= 19 or n == 21 : print(4)\r\nelif n == 20 : print(15)\r\nelse : print(0)", "a=int(input())\na-=10\nif a in [1,2,3,4,5,6,7,8,9,11]:\n print(4)\nelif a==10:\n print(15)\nelse:\n print(0)", "n=int(input())-10\r\nif n>0 and n<12 and n!=10:\r\n\tprint(4)\r\nelif n==10:\r\n\tprint(15)\r\nelse:\r\n\tprint(0)", "n = int(input())-10\r\nif n == 10:\r\n\tprint(15)\r\nelse:\r\n\tprint([0,4][n in range(1,12)])", "n=int(input())\r\ns=[1,2,3,4,5,6,7,8,9,10,11]*4+([10]*11)\r\nprint(s.count(n-10))", "n = int(input())\r\nif n<=10:\r\n print(0)\r\nelif n==20:\r\n print(15)\r\nelif n>10 and n<22:\r\n print(4)\r\nelse:\r\n print(0)", "n = int(input())\r\n\r\nif (n-10)<=0:\r\n\tprint(0)\r\nelif (n-10)>0 and (n-10)<=11:\r\n\tif (n-10)==10:\r\n\t\tprint(15)\r\n\telse:\r\n\t\tprint(4)\r\nelse:\r\n\tprint(0)", "n = int(input())\r\nn -= 10\r\nans = 0\r\n\r\nif (1 <= n <= 9) or n == 11:\r\n ans = 4\r\nelif n == 10:\r\n ans = 15\r\n \r\nprint(ans)", "n = int(input())\r\nif(n>=1 and n<= 10):\r\n print(0)\r\nelif((n>=11 and n<=19) or n == 21):\r\n print(4)\r\nelif(n == 20):\r\n print(15)\r\nelse:\r\n print(0) ", "n=int(input())-10\r\nprint(0if n<1 or n>11 else 4 if n!=10 else 15)", "n=int(input())\r\nvalue=n-10\r\nif value<1 or value>11:\r\n print (\"0\")\r\nelif value==10:\r\n print(\"15\")\r\nelse:\r\n print(\"4\")", "n = int(input())\r\nif n <= 10 or n> 21:\r\n print(0)\r\nelif n == 11 or n == 21 or 12 <= n <= 19:\r\n print(4)\r\nelif n == 20:\r\n print(15)\r\n", "n=int(input())\r\nif 10<n<20 or n==21:print(4)\r\nelif n==20:print(15)\r\nelse:print(0)\r\n", "def lets_do_it():\n n = int(input()) - 10\n if n <= 0 or n > 11:\n print(0)\n return\n\n print(15 if n == 10 else 4)\n\n\ndef main():\n # test_cases = int(input())\n test_cases = 1\n while test_cases:\n lets_do_it()\n test_cases -= 1\n\n\nmain()\n", "n = int(input())\r\nx = n-10\r\nif x >= 12:\r\n print(0)\r\nelif x == 11:\r\n print(4)\r\nelif x == 10:\r\n print(15)\r\nelif 1 <= x <= 9:\r\n print(4)\r\nelse:\r\n print(0)\r\n", "n = int(input())\r\nif n <= 10 or n > 21:x = 0\r\nelif n == 20: x=15\r\nelse:x=4\r\nprint(x)\r\n", "n = int(input())\r\nways=0\r\nnumbers = [10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,2,2,2,2,3,3,3,3,4,4,4,4,5,5,5,5,6,6,6,6,7,7,7,7,8,8,8,8,9,9,9,9,1,1,1,1,11,11,11,11]\r\nif n >=1 and n<=25 :\r\n for i in numbers :\r\n if i +10 == n :\r\n ways +=1\r\n print(ways)", "x=int(input())\r\nif x == 10 or x<10:\r\n print(\"0\")\r\nelif x==20:\r\n print(\"15\")\r\nelif x == 11:\r\n print(\"4\")\r\nelif 11<x<20 or x == 21:\r\n print(\"4\")\r\nelif 21<x<26:\r\n print(\"0\") \r\n \r\n \r\n ", "from sys import stdin, stdout\r\n\r\ndef print(inp):\r\n return stdout.write(str(inp))\r\n\r\nn = int(stdin.readline())\r\nn -= 10\r\n\r\nif n == 10:\r\n print(str(15))\r\nelif 1 <= n <= 11:\r\n print(str(4))\r\nelse:\r\n print(str(0))", "n = int(input())\r\nif(n<10 or n > 21):\r\n print (0)\r\nelse:\r\n mp = dict()\r\n for i in range(12):\r\n if(i == 0):\r\n mp[i] = 0\r\n elif(i == 10):\r\n mp[i] = 15\r\n else:\r\n mp[i]= 4\r\n \r\n print (mp[n-10])", "a=input()\r\nif a=='20':\r\n print(\"15\")\r\nelif int(a)<=10 or int(a)>21:\r\n print(\"0\")\r\nelse:\r\n print(\"4\")", "card_count = {i : 4 for i in range(1,10)}\ncard_count[10] = 15\ncard_count[11] = 4\nnum = int(input())\nprint(card_count.get(num-10, 0))\n\n", "# Copyright (c) Huawei Technologies Co., Ltd. 2021-2021. All rights reserved.\n# -*- coding:utf-8 -*-\n# @Date: 2022/9/8\n\nx = 10\n\n\ndef get(n: int) -> int:\n if n <= x:\n return 0\n\n sub = n - x\n if sub == 10:\n return 4*4 -1\n if sub == 11:\n return 4\n if 1 <= sub <= 9:\n return 4\n\n return 0\n\n\nif __name__ == '__main__':\n n = int(input())\n print(get(n))\n\n \t\t\t \t \t \t\t \t \t \t\t\t \t\t \t", "a=int(input())\r\nb=a-10\r\n \r\nif(b>=1 and b<=9):\r\n print('4')\r\nelif(b==10):\r\n print('15')\r\nelif(b==11):\r\n print('4')\r\nelse:\r\n print('0')", "a = int(input())\r\nif a - 10 <= 0 or a - 10 > 11:\r\n print(0)\r\nelif a - 10 <= 9 or a - 10 == 11:\r\n print(4)\r\nelif a - 10 == 10:\r\n print(15)\r\n", "n = int(input())\r\nprint(15 if n == 20 else 4 if 10 < n < 22 else 0)\r\n", "a=int(input())\r\nprint((10<a<22)*4+(a is 20)*11)", "n = int(input())\n\nif 10 < n <= 21:\n print(4 if n != 20 and n != 21 else (4*4-1 if n == 20 else 4))\nelse:\n print(0)", "x=int(input())-10\r\nif 1<=x<=9:\r\n print(4)\r\nelif x==10:\r\n print(15)\r\nelif x==11:\r\n print(4)\r\nelse:\r\n print(0)\r\n ", "l = [1,1,1,1,2,2,2,2,3,3,3,3,4,4,4,4,5,5,5,5,6,6,6,6,7,7,7,7,8,8,8,8,9,9,9,9,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,11,11,11,11]\r\na = 10\r\nn = int(input())\r\nc = n - a\r\ns = 0\r\nfor i in l:\r\n if i == c:\r\n s+=1\r\nprint(s)", "n = int(input())\nn -= 10 # we have a queen of spades\nif 0 < n < 10 or n == 11:\n res = 4 # 4x(2-9, A)\nelif n == 10:\n res = 15 # 4x10, 4xJ, 3xQ, 4xK\nelse:\n res = 0\nprint(res)\n", "if __name__ == '__main__':\n n = int(input())\n if n <= 10 or n > 21:\n print(0)\n elif 11 <= n < 20 or n == 21:\n print(4)\n else:\n print(15)", "class CodeforcesTask104ASolution:\r\n def __init__(self):\r\n self.result = ''\r\n self.n = 0\r\n\r\n def read_input(self):\r\n self.n = int(input())\r\n\r\n def process_task(self):\r\n deck = [[x, x, x, x] for x in range(1, 12)]\r\n deck.append([10 for x in range(11)])\r\n mdeck = []\r\n for d in deck:\r\n mdeck += d\r\n self.result = str(mdeck.count(self.n - 10))\r\n\r\n def get_result(self):\r\n return self.result\r\n\r\n\r\nif __name__ == \"__main__\":\r\n Solution = CodeforcesTask104ASolution()\r\n Solution.read_input()\r\n Solution.process_task()\r\n print(Solution.get_result())\r\n", "def main():\n n=int(input())\n if(n>=0 and n<=10):\n print(0)\n elif(n>=22 and n<=25):\n print(0)\n elif(n==11):\n print(4)\n elif(n>=12 and n<=19):\n print(4)\n elif(n==20):\n print(15)\n elif(n==21):\n print(4)\n\n\n\nif __name__ == '__main__':\n main()\n", "n=int(input())\r\nif n < 11 or n > 21:\r\n print(\"0\")\r\nelif 10<n<20 or n==21:\r\n print(\"4\")\r\nelif n==20:\r\n print(\"15\")", "a=int(input())\r\nlisti=[2,3,4,5,6,7,8,9,1,11]\r\n\r\nif(a<=10):\r\n print(\"0\")\r\nelse:\r\n if((a-10)in listi):\r\n print(\"4\")\r\n elif(a-10==10):\r\n print(\"15\")\r\n else:\r\n print(\"0\")\r\n\r\n\r\n \r\n\r\n", "print([*([0] * 11), *([4] * 9), 15, 4, *([0] * 4)][int(input())])\r\n", "#104A\r\n\r\nsum = int(input())\r\n\r\nif sum <= 10 or sum > 21:\r\n print(0)\r\nelif sum == 20:\r\n print(15) \r\nelse:\r\n print(4)", "required_sum_of_points = int(input()) - 10\r\nif required_sum_of_points <= 0:\r\n print(0)\r\nelif required_sum_of_points < 10:\r\n print(4)\r\nelif required_sum_of_points == 10:\r\n print(15)\r\nelif required_sum_of_points == 11:\r\n print(4)\r\nelse:\r\n print(0)\r\n", "d={1:0,2:0,3:0,4:0,5:0,6:0,7:0,8:0,9:0,10:0,11:4,12:4,13:4,14:4,15:4,16:4,17:4,18:4,19:4,20:15,21:4,22:0,23:0,24:0,25:0}\r\nprint(d[int(input())])", "n = int(input())\r\nn = n-10\r\nif n in [1,2,3,4,5,6,7,8,9,11]:\r\n print(4)\r\nelif n == 10:\r\n print(15)\r\nelse:\r\n print(0)", "n = int(input())\r\nif (n-10)>1 and (n-10)<10:\r\n print(4)\r\nelif (n-10) == 10:\r\n print(15)\r\nelif (n-10) == 1 or (n-10) == 11:\r\n print(4)\r\nelse:\r\n print(0)\r\n", "n=int(input())\r\nif(n-10>=1 and n-10<10):\r\n print(4)\r\nelif(n-10==11):\r\n print(4)\r\nelif(n-10==10):\r\n print(15)\r\nelse:\r\n print(0)", "# LUOGU_RID: 126294857\nn=int(input())\nif n<=10:\n print(0)\nelif n<=19:\n print(4)\nelif n==20:\n print(15)\nelif n==21:\n print(4)\nelse:\n print(0)", "a=int(input())\r\nif a<=10:\r\n print(\"0\")\r\nelif a>21:\r\n print(\"0\")\r\nelif a==20:\r\n print(\"15\")\r\nelse:\r\n print(\"4\")", "\r\n\r\nn = int(input())\r\nn -= 10\r\nif (n >= 1 and n <= 9) or n == 11:\r\n print(4)\r\nelif n == 10:\r\n print(15)\r\nelse:\r\n print(0);\r\n ", "from sys import stdin, stdout\r\n\r\nprint = stdout.write\r\ninput = stdin.readline\r\n\r\na=int(input())\r\n\r\nscore = 0\r\nif a > 10 and a < 22:\r\n a -= 10\r\n score += 4\r\n if a == 10:\r\n score += 11\r\nprint(f\"{score}\\n\")", "import collections \ndef solve(n):\n\tif n <= 10:\n\t\treturn 0\n\telif n > 21:\n\t\treturn 0\n\tif n == 20:\n\t\treturn 15\n\treturn 4\nn=int(input())\nprint(solve(n))\n# for i in ans:\n# \tprint(i)\n", "n=int(input())\r\na=n-10\r\nif a<=0:\r\n print(0)\r\nelif a<=9 or a==11:\r\n print(4) \r\nelif a==10:\r\n print(15)\r\nelse:\r\n print(0) ", "import sys\r\nimport math\r\nimport bisect\r\nimport heapq\r\nimport string\r\nfrom collections import defaultdict,Counter,deque\r\n \r\ndef I():\r\n return input()\r\n \r\ndef II():\r\n return int(input())\r\n \r\ndef MII():\r\n return map(int, input().split())\r\n \r\ndef LI():\r\n return list(input().split())\r\n \r\ndef LII():\r\n return list(map(int, input().split()))\r\n \r\ndef GMI():\r\n return map(lambda x: int(x) - 1, input().split())\r\n \r\ndef LGMI():\r\n return list(map(lambda x: int(x) - 1, input().split()))\r\n \r\ndef WRITE(out):\r\n return print('\\n'.join(map(str, out)))\r\n \r\ndef WS(out):\r\n return print(' '.join(map(str, out)))\r\n \r\ndef WNS(out):\r\n return print(''.join(map(str, out)))\r\n\r\n'''\r\n\r\n1\r\n1 2 | 2 1\r\n1 2 3 | \r\n\r\n1 2 3 4 | 1 3 2 4\r\n\r\n1 2 3 4\r\n2 3 4 4\r\n4 5 6 4\r\n7 8 9 4\r\n11 12 13 4\r\n11 17 18 9\r\n\r\n1 2 3\r\n2 3 3\r\n4 5 3\r\n7 8 3\r\n7 12 7\r\n12 12 12\r\n\r\n4 4 4 4 1 2 3\r\n\r\n1 2 3 4\r\n2 3 4 4\r\n4 5 6 4\r\n7 5 9 7\r\n\r\n1 1 1 1\r\n2 2 2 2\r\n3 3 3 3\r\n4 4 4 4\r\n5 5 5 5\r\n\r\n0 1 1 1\r\n2 0 2 2\r\n3 3 0 3\r\n4 4 4 0\r\n\r\n9 8 7 6\r\n1 2 3 4\r\n\r\n1 2\r\n0 1\r\n2 0\r\n\r\n\r\n'''\r\n\r\n# sys.stdin = open(\"backforth.in\", \"r\")\r\n# sys.stdout = open(\"backforth.out\", \"w\")\r\ninput = sys.stdin.readline\r\n\r\ndef dist(c1, c2):\r\n return abs(c1[0] - c2[0]) + abs(c1[1] - c2[1])\r\n\r\ndef isPrime(n):\r\n i = 2\r\n while i*i <= n:\r\n if n%i == 0:\r\n return False\r\n i += 1\r\n return True\r\n\r\ndef solve():\r\n n = II()\r\n if n == 20:\r\n print(15)\r\n elif n <= 10 or n >= 22:\r\n print(0)\r\n else:\r\n print(4)\r\n\r\nsolve()", "n = int(input()) - 10\nif n >= 1 and n <= 11:\n if n == 10:\n print(\"15\")\n else:\n print(\"4\")\nelse:\n print(\"0\")\n", "n = int(input())\r\nn -= 10 \r\nlis = [1,2,3,4,5,6,7,8,9,10]\r\nace = [1,11]\r\nface = [10]\r\nif n == 0:\r\n\tprint(0)\r\nelif n == 10:\r\n\tprint(15)\r\nelif n in lis or n in ace:\r\n\tprint(4)\r\nelse:\r\n\tprint(0)", "#!/usr/bin/env python3\r\n# -*- coding: utf-8 -*-\r\nf=dict(zip([1,2,3,4,5,6,7,8,9,10,11],[4,4,4,4,4,4,4,4,4,15,4]))\r\ntry:\r\n print(f[int(input())-10])\r\nexcept:\r\n print(0)", "n = int(input())\r\n\r\nif 11 <= n <= 21:\r\n if n != 20:\r\n print('4')\r\n else:\r\n print('15')\r\nelse:\r\n print('0')", "n = int(input())\r\nif (n <= 10):\r\n print(0)\r\nelif (n < 20):\r\n print(4)\r\nelif (n == 20):\r\n print(15)\r\nelif (n == 21):\r\n print(4)\r\nelse:\r\n print(0)\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\r\n return [n]\r\n\r\n\r\ndef sol(n):\r\n if n <= 10:\r\n return [\"0\"]\r\n if n == 11:\r\n return [\"4\"]\r\n if 12 <= n <= 19:\r\n return [\"4\"]\r\n if n == 20:\r\n return [\"15\"]\r\n if n == 21:\r\n return [\"4\"]\r\n\r\n return [\"0\"]\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", "n=int(input())\r\nn-=10\r\nif n>=1 and n<=9:\r\n print(4)\r\nelif n==11:\r\n print(4)\r\nelif n==10:\r\n print(15)\r\nelse:\r\n print(0)", "s=int(input())\r\nans=10\r\nif s<=10:\r\n print(0)\r\nelif s>10 and s<20 or s==21:\r\n print(4)\r\nelif s==20:\r\n print(15)\r\nelse:\r\n print(0)", "l=[1,2,3,4,5,6,7,8,9,10,11,10,10,10]\r\nl=l*4\r\na=int(input())\r\nl.remove(10)\r\nif(a==11):\r\n l.remove(11)\r\nelse:\r\n l.remove(1)\r\ne=0\r\nfor i in range(0,len(l)):\r\n if(10+l[i]==a):\r\n e=e+1\r\nprint(e) ", "\n\nn = int(input())\nn -= 10\n\nif 0 < n < 10 or n == 11:\n print(4)\nelif n == 10:\n print(4 * 4 - 1)\nelse:\n print(0)\n", "n=int(input())\r\nif n<=10 or n>21:\r\n print(0)\r\nelse:\r\n target=n-10\r\n if 1<=target<=9 or target==11:\r\n print(4)\r\n elif target==10:\r\n print(15)", "\r\na=int(input())\r\nb=a-10\r\nif 0<b<=11:\r\n if b==10:\r\n print(15)\r\n else:\r\n print(4)\r\nelse:\r\n print(0)", "n = int(input())\r\nmissing = n - 10\r\nprint(15 if missing == 10 else 4 if (1 <= missing <= 9 or missing == 11) else 0)\r\n\r\n", "m=int(input())\r\nhave=10\r\nneed=m-have\r\nif(need<=0):\r\n print(0)\r\nelif (need<10 or need==11):\r\n print(4)\r\nelif(need==10):\r\n print(15)\r\nelif (need>11):\r\n print(0)\r\n", "#Blackjack\nnum = int(input(\"\"))\nif num>10:\n if num == 20:\n print(\"15\")\n elif num < 20 or num == 21:\n print(\"4\") \n elif num>21:\n print(\"0\") \nelse:\n print(\"0\") ", "a=[1,1,1,1,2,2,2,2,3,3,3,3,4,4,4,4,5,5,5,5,6,6,6,6,7,7,7,7,8,8,8,8,9,9,9,9,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,11,11,11,11]\r\nn=int(input())\r\nprint(a.count(n-10))", "x = int(input())-10\r\nif 1<=x<=9 or x == 11:\r\n print(4)\r\nelif x==10 or x==20:\r\n print(15)\r\nelse:\r\n print(0)", "n=int(input())-10;print(0if n<1 or n>11 else 4 if n!=10 else 15)", "n = int(input())\r\nb = n - 10\r\nif b == 10:\r\n print(15)\r\nelif b <= 0 or b > 11:\r\n print(0)\r\nelse:\r\n print(4)", "n = int(input())\r\n\r\nif(n-10 == 0):\r\n\tprint(0)\r\n\r\nelif(n -10 == 10):\r\n\tprint(15)\r\nelif ((n-10 <= 9 and n-10 > 0 ) or n-10 == 11):\r\n\tprint(4)\r\n\r\nelse:\r\n\tprint(0)", "from sys import stdin; inp = stdin.readline\r\nfrom math import dist, ceil, floor, sqrt, log\r\nfrom collections import defaultdict, Counter\r\ndef IA(sep=' '): return list(map(int, inp().split(sep)))\r\ndef FA(): return list(map(float, inp().split()))\r\ndef SA(): return inp().split()\r\ndef I(): return int(inp())\r\ndef F(): return float(inp())\r\ndef S(): return input()\r\ndef O(l:list): return ' '.join(map(str, l))\r\nfrom string import digits\r\n\r\ndef main():\r\n n = I() \r\n d = {1:4, 2:4, 3:4, 4:4, 5:4, 6:4, 7:4, 8:4, 9:4, 10:15, 11:4}\r\n diff = n-10\r\n if diff <= 0 or diff > 11:\r\n return 0 \r\n else:\r\n return d[diff]\r\n\r\nif __name__ == '__main__':\r\n print(main())", "n = int(input())\r\n\r\ncards = {1: 4, 2: 4, 3: 4, 4: 4, 5: 4, 6: 4, 7: 4, 8: 4, 9: 4, 10: 15, 11: 4}\r\n\r\nprint(cards.get(n-10, 0))", "def blackjack(d,n,queen_spades):\r\n if(queen_spades==n):\r\n return(0)\r\n count=0\r\n for i,j in d.items():\r\n for k in j:\r\n if(queen_spades+k==n):\r\n count=count+1\r\n return(count)\r\n\r\n\r\nn=int(input())\r\nqueen_spades=10\r\ncards_range=range(2,11)\r\nd={'king_hea':[10],'queen_hea':[10],'jack_hea':[10],'4_hea':[4],'2_hea':[2],'3_hea':[3],\r\n'5_hea':[5],'6_hea':[6],'7_hea':[7],\r\n'8':[8],'9':[9],'10':[10],'ace':[1,11],\r\n'king_dia':[10],'queen_dia':[10],'jack_dia':[10],'4_dia':[4],'2_dia':[2],'3_dia':[3],\r\n'5_dia':[5],'6_dia':[6],'7_dia':[7],\r\n'8_dia':[8],'9_dia':[9],'10_dia':[10],'ace_dia':[1,11],\r\n'king_club':[10],'queen_club':[10],'jack_club':[10],'4_club':[4],'2_club':[2],'3_club':[3],\r\n'5_club':[5],'6_club':[6],'7_club':[7],\r\n'8_club':[8],'9_club':[9],'10_club':[10],'ace_club':[1,11],\r\n'king_spa':[10],'jack_spa':[10],'4_spa':[4],'2_spa':[2],'3_spa':[3],\r\n'5_spa':[5],'6_spa':[6],'7_spa':[7],\r\n'8_spa':[8],'9_spa':[9],'10_spa':[10],'ace_spa':[1,11]}\r\nresult=blackjack(d,n,queen_spades)\r\nprint(result)", "num = int(input())\r\nif num <= 10 or num > 21:\r\n print(0)\r\nelif num == 20:\r\n print(15)\r\nelse:\r\n print(4)", "re=int(input())-10\r\nif re<=0 or re>11:\r\n print(0)\r\nelif re==10:\r\n print(15)\r\nelse:\r\n print(4)\r\n", "n = int(input())\r\nif n <= 10 or n >= 22:\r\n print(0)\r\n exit(0)\r\nif 19 >= n >= 11 or n == 21:\r\n print(4)\r\n exit(0)\r\nprint(15)", "n=int(input())\r\na=n-10\r\nif a>=2 and a<=9:\r\n print(\"4\")\r\nelif a==10:\r\n print(\"15\")\r\nelif a==1:\r\n print(\"4\")\r\nelif a==11:\r\n print(\"4\")\r\nelse:\r\n print(\"0\")", "from collections import deque\r\n\r\ndef main():\r\n n = int(input())\r\n to_get = n - 10\r\n if to_get <= 0:\r\n print(0)\r\n elif to_get == 1 or to_get == 11:\r\n print(4)\r\n elif to_get > 11:\r\n print(0)\r\n elif 2<=to_get<=9:\r\n print(4)\r\n elif to_get == 10:\r\n print(15)\r\n\r\n\r\n\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()", "n=int(input())\r\nr=n-10;\r\nif ((r>=1 and r<=9) or r==11) :\r\n\tprint(\"4\");\r\nelif r==10:\r\n\tprint(\"15\")\r\nelse :\r\n\tprint(\"0\")", "n = int( input( ) )\r\nif n <= 10 or n > 21 :\r\n print( 0 )\r\nelif n == 20 :\r\n print( 15 )\r\nelse :\r\n print( 4 )", "from dataclasses import dataclass\r\n\r\nn = int(input())\r\n\r\n@dataclass\r\nclass Card:\r\n \"\"\"\r\n 0 - spade\r\n 1 - heart\r\n 2 - clubs\r\n 3 - diamond\r\n \"\"\"\r\n suit: int\r\n num: int\r\n\r\n def scores(self):\r\n if self.num == 1:\r\n yield 1\r\n yield 11\r\n elif self.num in (11,12,13):\r\n yield 10\r\n else:\r\n yield self.num\r\n\r\n\r\ncards = []\r\nfor s in ['S', 'H', 'C', 'D']:\r\n for num in range(1,14):\r\n c = Card(s, num)\r\n cards.append(c)\r\n\r\ncards = [c for c in cards if not (c.num == 12 and c.suit == 'S')]\r\n# print(cards)\r\n\r\ntotal = 0\r\nfor c in cards:\r\n for score in c.scores():\r\n if 10 + score == n:\r\n total += 1\r\n\r\nprint(total)", "import time\r\nimport math\r\nfrom sys import stdin, stdout\r\ndef I():\r\n return int(stdin.readline()) # For single input\r\ndef In():\r\n return map(int, stdin.readline().split()) # For multiple input\r\ndef L():\r\n return list(map(int, stdin.readline().split())) # For array input\r\ndef Si():\r\n return sorted(list(map(int, stdin.readline().split()))) # For sorted array\r\ndef Si():\r\n # For sorted array(in reverse order)\r\n return sorted(list(map(int, stdin.readline().split())), reverse=True)\r\ndef P(x):\r\n return stdout.write(str(x)+\"\\n\") # print without newline\r\ndef Pi(x, y):\r\n return stdout.write(str(x)+\" \"+str(y))\r\n\r\ndef solve():\r\n n = I()\r\n if(n-10 == 10):\r\n P(\"15\")\r\n elif(n-10 >= 1 and n-10<=11):\r\n P(\"4\")\r\n else:\r\n P(\"0\")\r\n\r\n\r\nif __name__ == \"__main__\":\r\n solve()\r\n", "def testcase():\n x = int(input().strip()) - 10\n\n a = {\n '1': 4,\n '2': 4,\n '3': 4,\n '4': 4,\n '5': 4,\n '6': 4,\n '7': 4,\n '8': 4,\n '9': 4,\n '10': 15,\n '11': 4,\n }\n\n print(a[str(x)] if 0 < x < 12 else 0)\n\n\nif __name__ == '__main__':\n t = 1\n \n for _ in range(t):\n testcase()", "cards = [[2], [3], [4], [5], [6], [7], [8], [9], [10], [10], [10], [10], [1, 11]]\r\n\r\nn = int(input())\r\n\r\nif n == 10:\r\n print(0)\r\n exit()\r\n\r\nn -= 10\r\n\r\nways = 0\r\n\r\nfor i, card in enumerate(cards):\r\n for point in card:\r\n if n == point:\r\n if i == 8:\r\n ways += 3\r\n else:\r\n ways += 4\r\n\r\nprint(ways)\r\n", "n = int(input())\r\nprint((10<n<22)*4+(n==20)*11)", "mydict = {\n 2: 4,\n 3: 4,\n 4: 4,\n 5: 4,\n 6: 4,\n 7: 4,\n 8: 4,\n 9: 4,\n 10: 15,\n 11: 4,\n 1: 4,\n}\n\nn = int(input())\nif n <= 10:\n print(0)\nelse:\n for key in mydict:\n if n - 10 in mydict:\n print(mydict[n - 10])\n break\n else:\n print(0)\n break\n", "def solution(n):\r\n need=n-10\r\n if need<0:\r\n return 0\r\n else:\r\n a = []\r\n i=1\r\n while i<=9:\r\n a.append(i)\r\n a.append(i)\r\n a.append(i)\r\n a.append(i)\r\n i+=1\r\n while i==10:\r\n j=1\r\n while j<=15:\r\n a.append(10)\r\n j+=1\r\n i+=1\r\n while i==11:\r\n j=1\r\n while j<=4:\r\n a.append(11)\r\n j+=1\r\n i+=1\r\n ans=0\r\n while need in a:\r\n ans+=1\r\n a.remove(need)\r\n return ans\r\n \r\ndef answer():\r\n n=int(input())\r\n print(solution(n))\r\nanswer()\r\n", "n = int(input())\r\nprint((10<n<22)*4 + (n==20)*11)", "n = int(input())\ns = n - 10\nif s <= 0:\n print(0)\nelif s == 10:\n print(15)\nelif s >11:\n print(0)\nelse:\n print(4)\n\t \t \t\t \t\t \t \t\t\t\t\t\t \t\t\t\t\t \t", "n = int(input().strip())\n\ndef calc(n):\n card = n - 10\n if n < 10:\n return 0\n if 2 <= card < 10 or card == 11 or card == 1:\n return 4\n if card > 11 or card < 1:\n return 0\n if card == 10:\n return 15\n\nprint(calc(n))", "diff = int(input())\r\n\r\nif diff<=10 or diff>21:\r\n print(0)\r\nelif (diff>10 and diff<20) or (diff==21):\r\n print(4)\r\nelif diff==20:\r\n print(15)", "a=int(input())\r\nif a<=10:\r\n print(\"0\")\r\nelse :\r\n if a==11:\r\n print(\"4\")\r\n elif a<=19:\r\n print(\"4\")\r\n elif a==20:\r\n print(\"15\")\r\n elif a==21:\r\n print(\"4\")\r\n else :\r\n print(\"0\")\r\n ", "n = int(input())\n\n# if n is less than 10, print 0\n# if n == 20, print 15\nif n <= 10:\n print('0')\nelif n == 20:\n print('15')\nelif (n >= 11 and n <= 19) or n == 21:\n print('4')\nelse:\n print('0')\n", "import sys\r\nimport collections\r\nimport itertools\r\n\r\nn = int(input())\r\nif n <= 10:\r\n print('0')\r\nelif n > 21:\r\n print('0')\r\nelif n < 20:\r\n print('4')\r\nelif n == 20:\r\n print('15')\r\nelse:\r\n print('4')\r\n", "#the required sum of points\r\nn = int(input())\r\n\r\ndiff = n - 10\r\n\r\nif diff>=1 and diff<=9 or diff == 11:\r\n print(4)\r\nelif diff == 10:\r\n print(4+4+4+3)\r\nelse:\r\n print(0)", "\ncards = [2,3,4,5,6,7,8,9,10,10,10,10,2,3,4,5,6,7,8,9,10,10,10,10,2,3,4,5,6,7,8,9,10,10,10,10,2,3,4,5,6,7,8,9,10,10,10,10]\n\nf = 10\n\nn = int(input())\n\nif f in cards:\n cards.remove(f)\n\nc = 0\n\nfor i in cards:\n if i+f==n:\n c+=1\n\nif n-f==1:\n if f!=1:\n c+=4\n else:\n c+=3\n\n \nelif n-f==11:\n if f!=11:\n c+=4\n else:\n c+=3\nprint(c)\n", "n = int(input())\r\nnum = [1, 2, 3, 4, 5, 6, 7, 8, 9, 11]\r\nreq = n - 10\r\nans = 0\r\nif req == 10:\r\n ans = 15\r\nelif req in num:\r\n ans = 4\r\nprint(ans)", "dic = dict()\nfor i in range(1,10):\n dic[i]=4\ndic[10]=15\ndic[11]=4\ndif = int(input())-10\nprint(dic.get(dif,0))", "n = int(input())\r\nx = n - 10\r\nif x <= 0 or x > 11:\r\n print(\"0\")\r\nelif x == 10:\r\n print(\"15\")\r\nelse:\r\n print(\"4\")", "import sys\n#f = sys.stdin\n#f = open(\"input.txt\", \"r\")\nn = int(input())\nn -= 10\nif n <= 0 or n > 11:\n print(0)\nelif n == 11:\n print(4)\nelif n == 10:\n print(15)\nelse:\n print(4)", "a= int(input()) -10\r\nif 1<=a<=11:\r\n if a== 10:\r\n print(15)\r\n else:\r\n print(4)\r\nelse:\r\n print(0)\r\n\r\n", "n = int(input())\r\nn = n -10\r\nif n==10:\r\n print(15)\r\nelif n<1 or n>11:\r\n print(0)\r\nelse:\r\n print(4)", "#blackjack\r\nn = int(input())\r\nif ( n < 11 or n > 21):\r\n print(0)\r\nelif n == 20:\r\n print(15)\r\nelse:\r\n print(4)", "n = int(input())\n\ninit_num = 10\n\nrequired_num = n-init_num\navailable = range(1, 12)\nif required_num not in available:\n print(0)\nelif required_num != init_num:\n if required_num == 10:\n print(16)\n else:\n print(4)\nelse:\n if required_num == 10:\n print(15)\n else:\n print(3)\n", "carta=10\r\nvalor=int(input())\r\nif valor<=10:\r\n print(\"0\")\r\nelif valor>=22:\r\n print(\"0\")\r\nelif valor==20:\r\n print(\"15\")\r\nelse:\r\n print(\"4\")\r\n \r\n", "dict = {0:0,1:4,2:4,3:4,4:4,5:4,6:4,7:4,8:4,9:4,10:15,11:4}\r\nn = int(input())\r\ns=n-10\r\nif s in dict:\r\n print(dict[s])\r\nelse:\r\n print('0')\r\n ", "n=int(input());print(0if not(n>10and n<22)else 15if n==20else 4)", "a = int(input())\r\nif a <=10 or a>=22:\r\n print(0)\r\n exit()\r\nif a==20:\r\n print(15)\r\nelse:\r\n print(4)", "n = input()\r\nif n == \"20\":\r\n print(15)\r\nelif int(n) > 10 and int(n) <22:\r\n print(4)\r\nelse:\r\n print(0)\r\n", "\nn = int(input()) - 10\n\nif n<=0 or n>11:\n\tprint(0)\nelif n>=2 and n<=9:\n\tprint(4)\nelif n==10:\n\tprint(15)\nelif n==11 or n==1:\n\tprint(4)\n", "n=int(input())\r\nc=n-10\r\nd=0\r\nhearts=[1,11,2,3,4,5,6,7,8,9,10,10,10,10]\r\ndiamonds=[1,11,2,3,4,5,6,7,8,9,10,10,10,10]\r\nclubs=[1,11,2,3,4,5,6,7,8,9,10,10,10,10]\r\nspades=[1,11,2,3,4,5,6,7,8,9,10,10,10]\r\nfor i in range(len(hearts)):\r\n if hearts[i]==c:\r\n d+=1\r\nfor i in range(len(diamonds)):\r\n if diamonds[i]==c:\r\n d+=1\r\nfor i in range(len(clubs)):\r\n if clubs[i]==c:\r\n d+=1\r\nfor i in range(len(spades)):\r\n if spades[i]==c:\r\n d+=1\r\nprint(d)", "n=int(input())-10\r\ni=1\r\nwhile i<12:\r\n\tif i==n:\r\n\t\tif(i==10):\r\n\t\t\tprint(15)\r\n\t\telse:\r\n\t\t print('4')\r\n\t\tquit()\r\n\ti+=1\r\nprint('0')\r\n\r\n", "n = int(input())\r\nif n<=10:\r\n print(0)\r\nelif n<=19 or n==21:\r\n print(4)\r\nelif n==20:\r\n print(15)\r\nelse: # n >= 22\r\n print(0)", "#rOkY\r\n#FuCk\r\n\r\n################################## kOpAl #####################################\r\n\r\nt=int(input())\r\nt-=10\r\nif(t<1 or t>11):\r\n print(0)\r\nelif(t!=10):\r\n print(4)\r\nelse:\r\n print(15)\r\n", "n=int(input())\r\nt=n-10\r\nif t>=1 and t<=9:\r\n print(4)\r\nelif t==11:\r\n print(4)\r\nelif t==10:\r\n print(15)\r\nelse:\r\n print(0)\r\n", "n = int(input())\r\n\r\ndef solve(n) :\r\n curr = n - 10 \r\n\r\n if curr > 11 or curr <= 0 : return 0 \r\n\r\n res = 4\r\n\r\n if curr == 10 : res = res * 4 - 1\r\n\r\n return res \r\n\r\nprint(solve(n))", "n=int(input())\r\nans=n-10\r\neven=[2,4,6,8,3,5,7,9,1,11]\r\nif ans in even:\r\n print (4)\r\nelif ans==10:\r\n print (15)\r\nelse:\r\n print (0)", "# LUOGU_RID: 113735013\nprint([\"pjy is so cute\",0,0,0,0,0,0,0,0,0,0,4,4,4,4,4,4,4,4,4,15,4,0,0,0,0,\"i love pjy very much\"][int(input())])", "x=int(input())\r\nprint((10<x<22)*4+(x==20)*11)", "#!/usr/bin/env python3\n\ndef main():\n n = int(input())\n\n if (n <= 10 or n > 21):\n print(0)\n elif n == 20:\n print(15)\n else:\n print(4)\n \nif __name__ == \"__main__\":\n main()\n\n", "n=int(input())-10\r\nif(n<=0):\r\n print(0)\r\nelif(n<10):\r\n print(4)\r\nelif(n==10):\r\n print(15)\r\nelif(n==11):\r\n print(4)\r\nelse:\r\n print(0)\r\n \r\n", "n = int(input()) -10\r\nif n <= 0 or n > 11:\r\n print(0)\r\nelse:\r\n if n <= 9 or n == 11:\r\n print(4)\r\n else:\r\n print(15)\r\n", "l = [1,2,3,4,5,6,7,8,9,10,10,10,10]\r\n#required sum\r\nn = int(input())\r\n#deducting score of queen\r\nn -= 10\r\nglobal c\r\nc = 0\r\nif n<=10:\r\n if n == 10:\r\n c = 4*l.count(n)-1\r\n else:\r\n c = 4*l.count(n)\r\nelif n == 11:\r\n c = 4\r\nprint(c)\r\n", "b=int(input())\r\nprint((10<b<22)*4+(b==20)*11)", "import sys\r\nimport os\r\nfrom collections import Counter, defaultdict, deque\r\nfrom heapq import heapify, heappush, heappop\r\nfrom functools import lru_cache\r\nfrom math import floor, ceil, sqrt, gcd\r\nfrom string import ascii_lowercase\r\nfrom bisect import bisect_left, bisect, bisect_right\r\n\r\n\r\ndef __perform_setup__():\r\n INPUT_FILE_PATH = \"./code/input.txt\"\r\n OUTPUT_FILE_PATH = \"./code/output.txt\"\r\n\r\n sys.stdin = open(INPUT_FILE_PATH, 'r')\r\n sys.stdout = open(OUTPUT_FILE_PATH, 'w')\r\n\r\n\r\nif \"MY_COMPETITIVE_PROGRAMMING_VARIABLE\" in os.environ:\r\n __perform_setup__()\r\n\r\n\r\ndef read():\r\n return input().strip()\r\n\r\n\r\ndef read_int():\r\n return int(read())\r\n\r\n\r\ndef read_str_list():\r\n return read().split()\r\n\r\n\r\ndef read_numeric_list():\r\n return list(map(int, read_str_list()))\r\n\r\n\r\ndef solve(N):\r\n s = 10\r\n p_arr = [[i, i] for i in range(1, 11)]\r\n p_arr.extend([[10, \"Q\"], [10, \"K\"], [10, \"J\"]])\r\n p_arr.append([11, 11])\r\n\r\n ways = 0\r\n\r\n for v, typ in p_arr:\r\n if v + s == N:\r\n if typ != \"Q\":\r\n ways += 4\r\n else:\r\n ways += 3\r\n\r\n return ways\r\n\r\n\r\nprint(solve(read_int()))\r\n", "n = int(input())\nif n <= 10 or n >= 22:\n print(0)\nelif n == 20:\n print(15)\nelse :\n print(4)", "n = int(input())\n\nif n <= 10 or n >= 22:\n ans = 0\nelif 11 <= n <= 19 or n == 21:\n ans = 4\nelif n == 20:\n ans = 15\nprint(ans)\n", "n=int(input())\r\nn-=10\r\ncards=[2,3,4,5,6,7,8,9,10,10,10,1,11]\r\nif(n==0):\r\n print('0')\r\nelse:\r\n cnt=0\r\n for x in cards:\r\n if(x==n):\r\n cnt+=4\r\n if(n==10):\r\n cnt+=3\r\n print(cnt)", "n = int(input())\r\nprint((10 < n < 22)*4+(n == 20)*11)", "# Blackjack\r\ndef solution(n):\r\n if n <= 10 or n > 21:\r\n return 0\r\n\r\n n -= 10\r\n if n != 10:\r\n return 4\r\n else:\r\n return 15\r\n\r\nn = int(input())\r\n\r\nres = solution(n)\r\nprint(res)", "cards = [(i + j) for i in (('S', 'H', 'D', 'C')) for j in (tuple('23456789jqka') + ('10',))]\r\ncards.remove('Sq')\r\n\r\ncards_points = {}\r\nfor card in cards:\r\n if card[-1] in ('j', 'q', 'k', '0'):\r\n cards_points[card] = 10\r\n elif card[-1] == 'a':\r\n cards_points[card] = [1, 11]\r\n else:\r\n cards_points[card] = int(str(card[-1]))\r\n \r\nn = int(input())\r\nif n <= 10 or n > 21:\r\n print(0)\r\nelse:\r\n count = 0\r\n for card in cards_points:\r\n if isinstance(cards_points[card], list):\r\n if (n - 10) in cards_points[card]:\r\n count += 1\r\n elif (n - 10) == cards_points[card]:\r\n count += 1\r\n print(count)", "n = int(input())\r\n\r\nreqNumber = n - 10\r\nif reqNumber in [2,3,4,5,6,7,8,9] :\r\n print(4) \r\nelif reqNumber == 10:\r\n print(15)\r\nelif reqNumber == 11:\r\n print(4)\r\nelif reqNumber == 1 :\r\n print(4)\r\nelse :\r\n print(0)", "c = int(input())\nc = c-10\nif (c >= 1 and c < 10) or (c is 11):\n print(4)\nelif c is 10:\n print(15)\nelse:\n print(0)\n", "n = int(input())\r\nsm = 0\r\nx = 10\r\n\r\nl = [2 , 3 , 4 ,5 ,6 , 7 , 8 ,9 , 10 ]\r\nl2 = [10 , 10 , 10]\r\nl3 = [1 , 11]\r\n\r\ny = n - x\r\n\r\nfor i in l :\r\n if i == y:\r\n sm += 4\r\n\r\nfor i in l2 :\r\n if i == y :\r\n sm += 4\r\n\r\nif y == 10 :\r\n sm -=1\r\n\r\nfor i in l3 :\r\n if i == y :\r\n sm += 4\r\n\r\nprint(sm)\r\n", "n = int(input())\n\nif n <= 10 or n > 21:\n print(0)\nelse:\n req = n - 10\n if req == 10:\n print(15)\n else:\n print(4)\n", "import sys\r\nimport math\r\n \r\nn = int(sys.stdin.readline()) \r\n\r\nif(n - 10 == 10):\r\n print(15)\r\nelif(n - 10 >= 1 and n - 10 <= 11):\r\n print(4)\r\nelse:\r\n print(0)", "n=int(input())\r\nif n>10 and n<22:\r\n if n==20:\r\n print(15)\r\n else:\r\n print(4)\r\nelse:\r\n print(0)", "n=int(input())-10\r\nif(n>=1 and n<10 or n==11):\r\n print(4)\r\nelif(n==10):\r\n print(15)\r\nelse:\r\n print(0)", "n=int(input())\r\nif n==20:\r\n print(15)\r\nelif n>21 or n<=10 :\r\n print(0)\r\nelse:\r\n print(4)\r\n", "n = int(input ())\r\nx = n%10\r\nif n <= 10 or n > 21:\r\n print (0)\r\n\r\nelif x!=0:\r\n print (4)\r\n \r\nelse:\r\n print (15)", "import io\r\nimport os\r\n#input = io.BytesIO(os.read(0,os.fstat(0).st_size)).readline\r\nn = int(input())\r\nif n < 11 or n > 21:\r\n print(0)\r\nelse:\r\n print(15) if (n-10) == 10 else print(4)\r\n ", "n = int(input())\r\nif n<=10 or n>21:\r\n print(0)\r\nelif 11<=n<=19 or n==21:\r\n print(4)\r\nelse:\r\n print(15)", "n = int(input())\r\n\r\nreq_num = n - 10\r\n\r\nif 0<req_num <10:\r\n print(4)\r\nelif req_num == 11:\r\n print(4)\r\nelif req_num == 10:\r\n print(15)\r\nelse:\r\n print(0)\r\n\r\n", "while True:\r\n try:\r\n n=int(input())\r\n if n <= 10 or n > 21:\r\n print(0)\r\n elif n == 20:\r\n print(15)\r\n else:\r\n print(4)\r\n except:\r\n break", "arr=[0,4]\narr+=[4]*8\narr+=[15,4]\nn=int(input())\nprint(int(n>10 and n<22)*arr[min(n-10,len(arr)-1)])", "n = int(input())\nif ((n < 11) or (n > 21)):\n print(0)\nelif n == 20:\n print(15)\nelse:\n print(4)\n", "n = int(input())\r\n\r\nif n == 20:\r\n print(15)\r\nelif 10 < n <= 21:\r\n print(4)\r\nelse:\r\n print(0)\r\n", "cards=[1,1,1,1,2,2,2,2,3,3,3,3,4,4,4,4,5,5,5,5,6,6,6,6,7,7,7,7,8,8,8,8,9,9,9,9,10,10,10,10,10,10,10,10,10,10,10,11,11,11,11,10,10,10,10]\r\ncount=0\r\nm=int(input())\r\nfor i in cards:\r\n if (i+10)==m:\r\n count+=1\r\nprint(count)", "n, = map(int,input().split())\r\n\r\nans = [0,0,0,0,0,0,0,0,0,0,0,4,4,4,4,4,4,4,4,4,15,4,0,0,0,0,0,0,0]\r\nprint(ans[n])", "n=int(input())\r\nrem=n-10\r\n\r\nif(rem>=1 and rem<10):\r\n print(\"4\")\r\nelif(rem==10):\r\n print(\"15\")\r\nelif(rem==11):\r\n print(\"4\")\r\nelse:\r\n print(\"0\")\r\n ", "n = int(input())\r\npoints = 10\r\ngoal = n-10\r\n\r\nif(goal <=0): # no existe una carta que reste puntos o que sume cero\r\n print(0)\r\nelif(goal<=9 or goal==11):\r\n print(4)\r\nelif(goal==10):\r\n print(15)\r\nelse:\r\n print(0)\r\n", "n=int(input())\r\nx=n-10\r\nif x<=0:\r\n print(0)\r\nelif x>11:\r\n print(0)\r\nelse:\r\n if x==10:\r\n print(15)\r\n else:\r\n print(4)", "#!/usr/bin/env python3\r\n\r\ndef inp(*, cf=lambda x: x): return cf(input())\r\ndef inpint(): return inp(cf=int)\r\ndef inp_line(*, cf=lambda x: x, s=' '): return list(map(cf, input().split(s)))\r\ndef inpints(): return inp_line(cf=int)\r\ndef intstostr(l): return ' '.join([str(x) for x in l])\r\ndef listtostr(l): return ' '.join(l)\r\n\r\ndef test_case(case):\r\n x = inpint() - 10\r\n if x == 1:\r\n return 4\r\n if 2 <= x <= 9:\r\n return 4\r\n if x == 10:\r\n return 15\r\n if x == 11:\r\n return 4\r\n return 0\r\n\r\n\r\ndef main():\r\n print(test_case(0))\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "n = int(input()) - 10\r\nif (2 <= n and n < 10) or n == 1 or n == 11:\r\n print(4)\r\nelif n == 10:\r\n print(15)\r\nelse:\r\n print(0)", "a = int(input())\r\na-=10\r\nif a <= 0:print(0)\r\nelif a == 1 or a == 11:print(4)\r\nelif a >= 2 and a < 10:print(4)\r\nelif a == 10:print(15)\r\nelse:print(0)", "n=int(input())\nif(n<=10):\n\tprint(\"0\")\nelif(n<20):\n\tprint(\"4\")\nelif(n==20):\n\tprint(\"15\")\nelif(n==21):\n\tprint(\"4\")\nelse:\n\tprint(\"0\")", "from functools import reduce\r\nfrom operator import le\r\nimport sys, os\r\nimport math\r\nfrom collections import Counter\r\n\r\nTC = False\r\n\r\ndef lexiographic_sort_array(arr):\r\n return sorted(arr, key=lambda x: str(x))\r\n\r\ndef solve():\r\n n = int(input())\r\n if n==20:\r\n print(15)\r\n elif n>10 and n<=21:\r\n print(4)\r\n else:\r\n print(0)\r\n\r\nif os.path.exists('input.txt'):\r\n debug = True\r\n sys.stdin = open(\"input.txt\",\"r\")\r\n #sys.stdout = open(\"output.txt\",\"w\")\r\n\r\nif TC:\r\n for _ in range(int(input())):\r\n solve()\r\nelse:\r\n solve()", "n = int(input())\r\nif n-10 == 10:\r\n print(15)\r\nelif n-10 <= 0 or n-10 >11:\r\n print(0)\r\nelse:\r\n print(4)", "sum = int(input())\r\n\r\nsum -= 10\r\nif sum > 11 or sum < 1:\r\n\tprint('0')\r\nelif sum == 10:\r\n\tprint('15')\r\nelse:\r\n\tprint('4')", "n = int(input())\r\n\r\naccount = 10\r\ncount = 0\r\ncards = []\r\nfor i in range(1,5):\r\n for j in range(2,10):\r\n cards.append(j)\r\n if i < 4:\r\n cards.append(10)\r\n for j in range(3):\r\n cards.append(10)\r\nfor i in cards:\r\n if account + i == n:\r\n count += 1\r\nif 1 + account == n or 11 + account == n:\r\n count += 4\r\nprint(count)", "n = int(input())\r\n\r\nstore = {i:4 for i in range(1,12)}\r\nstore[10] = 15\r\n\r\nif n <= 10 or n >21:\r\n print(0)\r\nelse:\r\n print(store[n-10])", "n=int(input())\nd=abs(10-n)\nif n<=10:\n print(0)\nelif d==10 :\n print(15)\nelif 1<=d<=9 or d==11:\n print(4)\nelse:\n print(0)", "n = int(input())-10; L = [x for x in range(1, 12)]\r\nif n not in L: print(0)\r\nelif n in L and n != 10: print(4)\r\nelse: print(15)\r\n", "def points(n):\r\n if (n <= 10) or (n >= 22):\r\n return 0\r\n if (n <= 19) or (n == 21):\r\n return 4\r\n if (n == 20):\r\n return 15\r\nn = int(input())\r\nprint(points(n))", "a = int(input())\r\n\r\nif(a<=10 or a>21):\r\n\tprint(\"0\")\r\nelif(a<20 or a==21):\r\n\tprint(\"4\")\r\nelse:\r\n\tprint(\"15\")", "n = int(input())\r\n\r\nif n < 11 or n > 21 :\r\n print(0)\r\n\r\nelif n == 20 :\r\n print(15)\r\n\r\nelse : # n >= 11 and n <= 21\r\n print(4)\r\n", "a = int(input()) - 10\r\nprint((4 if 1 <= a <= 9 or a == 11 else 15 ) if 0 < a < 12 else 0)\r\n\r\n", "l1=int(input())\r\nl1-=10\r\nif l1==10:\r\n print(15)\r\nelif (l1>=1 and l1<=9) or l1==11:\r\n print(4)\r\nelse:\r\n print(0)", "#104A\r\nn=int(input())\r\nif n <= 10 or n > 21:print(0)\r\nelif n > 10 and n < 20:print(4)\r\nelif n == 20:print(15)\r\nelif n == 21:print(4)\r\n", "n = int(input())\nif n - 10 <=0 or n - 10 > 11:\n print(0)\nelif n - 10 == 1:\n print(4)\nelif n - 10 == 2:\n print(4)\nelif n - 10 == 3:\n print(4)\nelif n - 10 == 4:\n print(4)\nelif n - 10 == 5:\n print(4)\nelif n - 10 == 6:\n print(4)\nelif n - 10 == 7:\n print(4)\nelif n - 10 == 8:\n print(4)\nelif n - 10 == 9:\n print(4)\nelif n - 10 == 10:\n print(15)\nelif n - 10 == 11:\n print(4)\n\n \t\t \t\t \t \t \t\t\t\t \t \t\t\t \t\t \t \t", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\nif n <= 10:\r\n ans = 0\r\nelif n <= 19:\r\n ans = 4\r\nelif n == 20:\r\n ans = 15\r\nelif n == 21:\r\n ans = 4\r\nelse:\r\n ans = 0\r\nprint(ans)", "def value(n):\r\n if n >= 2 and n < 10:\r\n return 4\r\n elif n == 10:\r\n return 15\r\n elif n == 11 or n == 1:\r\n return 4\r\n else:\r\n return 0\r\n \r\nif __name__ == \"__main__\":\r\n n = int(input())\r\n print (value(n - 10))\r\n", "#!/usr/bin/python3\r\nn = int(input())\r\nways = [0]*26\r\nfor lol in range(11, 22):\r\n ways[lol] = 4\r\n\r\nways[20] = 15\r\nprint(ways[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\ndef get_root(s):\r\n v = []\r\n while not s == root[s]:\r\n v.append(s)\r\n s = root[s]\r\n for i in v:\r\n root[i] = s\r\n return s\r\n\r\ndef unite(s, t):\r\n rs, rt = get_root(s), get_root(t)\r\n if not rs ^ rt:\r\n return\r\n if rank[s] == rank[t]:\r\n rank[rs] += 1\r\n if rank[s] >= rank[t]:\r\n root[rt] = rs\r\n size[rs] += size[rt]\r\n else:\r\n root[rs] = rt\r\n size[rt] += size[rs]\r\n return\r\n\r\ndef same(s, t):\r\n return True if get_root(s) == get_root(t) else False\r\n\r\ndef get_size(s):\r\n return size[get_root(s)]\r\n\r\ndef bfs(u):\r\n q, k = [u], 0\r\n visit[u] = 1\r\n while len(q) ^ k:\r\n i = q[k]\r\n for j in G[i]:\r\n if not visit[j]:\r\n q.append(j)\r\n visit[j] = 1\r\n parent[j] = i\r\n k += 1\r\n return q\r\n\r\nn = int(input())\r\nd = defaultdict(lambda : [])\r\nfor i in range(1, n):\r\n a, b, c = map(int, input().split())\r\n d[c].append((a, b, i))\r\nroot = [i for i in range(n + 1)]\r\nrank = [1 for _ in range(n + 1)]\r\nsize = [1 for _ in range(n + 1)]\r\nx = [0] * (n + 1)\r\ny = [0] * (n + 1)\r\ncolor = [0] * (n + 1)\r\nz = [0] * n\r\nfor c in sorted(d.keys()):\r\n l = 0\r\n s = [0]\r\n for a, b, _ in d[c]:\r\n u, v = get_root(a), get_root(b)\r\n if color[u] ^ c:\r\n color[u], x[u], y[l + 1] = c, l + 1, a\r\n s.append(get_size(u))\r\n l += 1\r\n if color[v] ^ c:\r\n color[v], x[v], y[l + 1] = c, l + 1, b\r\n s.append(get_size(v))\r\n l += 1\r\n G = [[] for _ in range(l + 1)]\r\n e = dict()\r\n for a, b, i in d[c]:\r\n u, v = x[get_root(a)], x[get_root(b)]\r\n e[(u, v)], e[(v, u)] = i, i\r\n G[u].append(v)\r\n G[v].append(u)\r\n visit, parent = [0] * (l + 1), [-1] * (l + 1)\r\n for i in range(1, l + 1):\r\n if visit[i]:\r\n continue\r\n p = bfs(i)\r\n cnt = 0\r\n for j in p:\r\n cnt += s[j]\r\n for j in p[::-1][:-1]:\r\n k = parent[j]\r\n s[k] += s[j]\r\n z[e[(j, k)]] = s[j] * (cnt - s[j])\r\n for a, b, _ in d[c]:\r\n unite(a, b)\r\nm = max(z)\r\nans = []\r\nfor i in range(1, n):\r\n if z[i] == m:\r\n ans.append(i)\r\nm *= 2\r\nc = len(ans)\r\nprint(m, c)\r\nsys.stdout.write(\" \".join(map(str, ans)))" ]

[ "n, p, k = map(int, input().split())\r\nstring = ''\r\nif p != 1 and p != n:\r\n if p - k <= 1:\r\n string += ' '.join(map(str, [i for i in range(1, p)]))\r\n string += ' ({}) '.format(p)\r\n else:\r\n string += '<< '\r\n string += ' '.join(map(str, [i for i in range(p - k, p)]))\r\n string += ' ({}) '.format(p)\r\n if p + k >= n:\r\n string += ' '.join(map(str, [i for i in range(p + 1, n + 1)]))\r\n else:\r\n string += ' '.join(map(str, [i for i in range(p + 1, p + k + 1)]))\r\n string += ' >>'\r\nelif p == 1:\r\n string += '(1) '\r\n if p + k >= n:\r\n string += ' '.join(map(str, [i for i in range(p + 1, n + 1)]))\r\n else:\r\n string += ' '.join(map(str, [i for i in range(p + 1, p + k + 1)]))\r\n string += ' >>'\r\nelse:\r\n if p - k <= 1:\r\n string += ' '.join(map(str, [i for i in range(1, p)]))\r\n else:\r\n string += '<< '\r\n string += ' '.join(map(str, [i for i in range(p - k, p)]))\r\n string += ' ({})'.format(n)\r\nprint(string)\r\n", "n,p,k=map(int,input().split())\r\ns=''\r\nfor i in range(max(1,p-k),min(p+k+1,n+1)):\r\n if i==p:\r\n s=s+'('+str(i)+')'+' '\r\n else:\r\n s=s+str(i)+' '\r\n\r\nif p-k>1:\r\n s='<< '+s\r\nif p+k<n:\r\n s=s+'>>'\r\nprint(s)\r\n", "nums = list(input().split())\r\nn, p, k = int(nums[0]), int(nums[1]), int(nums[2])\r\n\r\nif p > k+1:\r\n print(\"<< \", end=\"\")\r\n\r\nfor i in range(k):\r\n if ((p-k)+i) > 0:\r\n print(f\"{(p-k)+i} \", end=\"\")\r\n\r\nprint(f\"({p}) \", end=\"\")\r\n\r\nfor i in range(1, k+1):\r\n if (p+i) <= n:\r\n print(f\"{p+i} \", end=\"\")\r\n\r\nif n > p+k:\r\n print(\">>\")", "# cook your dish here\r\nn,p,k = map(int,(input()).split())\r\nresult_list = ['({p})'.format(p=p)]\r\nend=beg=p\r\nif p<n:\r\n for i in range(k):\r\n if end>=n:\r\n break\r\n end+=1\r\n result_list.append(end)\r\n if end<n:\r\n result_list.append('>>')\r\nif p>1:\r\n for i in range(k):\r\n if beg<=1:\r\n break\r\n beg-=1\r\n result_list.insert(0,beg)\r\n if beg>1:\r\n result_list.insert(0,'<<')\r\nfor i in result_list:\r\n print(i,end=' ')", "n, p, k = map(int, input().split())\r\nif p - k > 1:\r\n\tprint(\"<<\", end = ' ')\r\nfor i in range(k, 0, -1):\r\n\tif p - i <= 0:\r\n\t\tcontinue\r\n\tprint(p - i, end = ' ')\r\nprint('(' + str(p) + ')', end = ' ')\r\nfor i in range(1, k + 1):\r\n\tif p + i > n:\r\n\t\tbreak\r\n\tprint(p + i, end = ' ')\r\nif p + k < n:\r\n\tprint(\">>\")", "n,p,k=map(int,input().split(' '))\r\nif p-k<=1 and p+k>=n:\r\n for i in range(1,n+1):\r\n if i!=p:\r\n print(i,end=' ')\r\n else:\r\n print('('+str(i)+')',end=' ')\r\nelif p-k<=1:\r\n for i in range(1,p+k+1):\r\n if i!=p:\r\n print(i,end=' ')\r\n else:\r\n print('('+str(i)+')',end=' ')\r\n print('>>')\r\nelif p+k>=n:\r\n print('<<',end=' ')\r\n for i in range(p-k,n+1):\r\n if i!=p:\r\n print(i,end=' ')\r\n else:\r\n print('('+str(i)+')',end=' ')\r\nelse:\r\n print('<<',end=' ')\r\n for i in range(p-k,p+k+1):\r\n if i!=p:\r\n print(i,end=' ')\r\n else:\r\n print('('+str(i)+')',end=' ')\r\n print('>>',end=' ')\r\n \r\n \r\n \r\n \r\n", "n, p, k = map(int, input().split())\n\nans = \"\"\n\nif max(p-k, 1) > 1:\n\tans = ans + \"<< \"\n\nfor i in range(max(p-k, 1), min(p+k, n) + 1):\n\tif i == p:\n\t\tans = ans + \"(\" + str(i) + \") \"\n\telse:\n\t\tans = ans + str(i) + \" \"\n\nif min(p+k, n) < n:\n\tans = ans + \">> \"\n\nprint(ans)\n\n#8 5 4\n\n", "n, p, k = map(int, input().split(' '))\r\n\r\ns = '({})'.format(str(p))\r\n\r\nfor i in range(1, k + 1):\r\n if p - i > 0:\r\n s = str(p - i) + ' ' + s\r\n if p + i <= n:\r\n s += ' ' + str(p + i)\r\n\r\nif s[0] != '(' and int(s.split(' ')[0]) > 1:\r\n s = '<< ' + s\r\nif s[-1] != ')' and int(s.split(' ')[-1]) < n:\r\n s += ' >>'\r\n\r\nprint(s)", "n,p,k=map(int,input().split(\" \"))\r\nans=\"\"\r\nif p-k>1:\r\n ans+='<< '\r\nfor i in range(p-k, p+k+1):\r\n if i>0 and i<=n:\r\n if i==p:\r\n ans+='('+str(p)+') '\r\n else:\r\n ans+=str(i)+' '\r\nif p+k<n:\r\n ans+='>>'\r\nif ans[len(ans)-1]==\" \":\r\n print(ans[0:len(ans)-1])\r\nelse:\r\n print(ans)\r\n", "\r\n\r\ndef range_of_input(n,p,k):\r\n if p-k>1:\r\n print(\"<< \",end=\" \")\r\n for i in range(1,n+1):\r\n if i in range(p-k,p+k+1):\r\n if(i==p):\r\n print(\"(%d) \"%i,end=\" \")\r\n else:\r\n print(\"%d \"%i,end=\" \")\r\n if p+k<n:\r\n print(\">>\")\r\n \r\nfrom array import array \r\narr=array('i',[])\r\nx=[int(x) for x in input().split()]\r\narr.extend(x)\r\nn=arr[0]\r\np=arr[1]\r\nk=arr[2]\r\nrange_of_input(n,p,k)", "#Codeforces Pages\r\ninp = input()\r\n\r\nx = list(inp.split(\" \"))\r\nn = int(x[0])\r\np = int(x[1])\r\nk = int(x[2])\r\n\r\nb = 1 if p-k<1 else p-k\r\ne = n if p+k>n else p+k\r\n\r\nif b !=1:\r\n print(\"<<\",end=\" \")\r\n \r\nfor i in range(b,e+1):\r\n if i==p:\r\n print(\"(\"+str(i)+\")\",end=\" \")\r\n else:\r\n print(i,end=\" \")\r\nif e !=n:\r\n print(\">>\",end=\"\")", "from sys import stdout\nwrite = stdout.write\n\nn, p, k = map(int,input().split())\nif p-k > 1:\n write('<< ')\nfor i in range(p-k,p+k+1):\n if 1 <= i <= n:\n write(f'{i} ' if i != p else f'({i}) ')\nif p+k < n:\n print('>>')\nelse:\n print()\n", "n,p,k=map(int,input().split())\r\ns=''\r\nt=p\r\nstart=end=0\r\nfor x in range(p-k,p+k+1):\r\n if 1<=x<=n:\r\n if x==1:\r\n start=1\r\n if x==n:\r\n end=1\r\n\r\n s+=' '+('(%d)'%x if x==p else str(x))\r\n\r\nif not start:\r\n s='<<'+s\r\nif not end:\r\n s+=' >>'\r\n\r\nprint(s.strip())\r\n\r\n", "n, p, k = map(int, input().split(\" \"))\n\nleftmost = max(p - k, 1)\nrightmost = min(p + k, n)\n\nprint(\"\".join([\n \"<< \" if leftmost > 1 else \"\",\n \" \".join(map(str, range(leftmost, p))),\n f\" ({p}) \",\n \" \".join(map(str, range(p + 1, rightmost + 1))),\n \" >>\" if rightmost < n else \"\"\n]))", "def printer(n, p, k):\r\n ch_left = \"\"\r\n ch_right = \"\"\r\n t1 = True\r\n t2 = True\r\n\r\n for i in (range(p - 1, p - k - 1, -1)):\r\n if i == 0:\r\n t1 = False\r\n break\r\n\r\n ch_left = str(i) + \" \" + ch_left\r\n\r\n if i == 1:\r\n t1 = False\r\n break\r\n\r\n ch_left = \"<< \" * t1 + ch_left\r\n\r\n for i in (range(p + 1, p + k + 1)):\r\n if i == n+1:\r\n t2 = False\r\n break\r\n ch_right += str(i) + \" \"\r\n if i == n:\r\n t2 = False\r\n break\r\n ch_right += \">>\" * t2\r\n print(ch_left + \"(\" + str(p) + \")\", ch_right)\r\n\r\n\r\ndef main():\r\n n, p, k = input().split()\r\n printer(int(n), int(p), int(k))\r\n\r\n\r\n# main\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n, p, k = list(map(int, input().split(' ')))\r\n\r\n#print '<<'\r\nif(p-k > 1):\r\n print('<<', end=\" \")\r\n \r\nfor i in range(max(p-k, 1), p):\r\n print(i, end=\" \")\r\n \r\nprint(f'({p})', end=\" \")\r\n \r\nfor i in range(p+1, min(p + k + 1, n+1)):\r\n print(i, end=\" \")\r\n \r\n#print '>>'\r\nif(n > p+k):\r\n print('>>')", "# cook your dish here\r\np,n,k=map(int,input().split())\r\nu=1\r\nd=p+1\r\nif n-k<=1:\r\n ans=[]\r\nelse:\r\n ans=[\"<<\"]\r\nif n+k+1<=p:\r\n d=n+k+1\r\nif n-k>0:\r\n u=n-k\r\nfor i in range(u,d):\r\n if i==n:\r\n ans.append(\"(\"+str(n)+\")\")\r\n else:\r\n ans.append(i)\r\nif n<p-k:\r\n ans.append(\">>\")\r\nans=str(ans).replace(\",\",\" \")\r\nans=ans.replace(\"'\",\"\")\r\nprint(ans[1:-1])", "#!/usr/bin/env python3\r\n# -*- coding: utf-8 -*-\r\n\r\n\"\"\"\r\nhttp://codeforces.com/contest/399/problem/A\r\nA. Pages\r\ntime limit per test1 second\r\nmemory limit per test256 megabytes\r\ninputstandard input\r\noutputstandard output\r\nUser ainta is making a web site. This time he is going to make a navigation of the pages. In his site, there are n pages numbered by integers from 1 to n. Assume that somebody is on the p-th page now. The navigation will look like this:\r\n\r\n<< p - k p - k + 1 ... p - 1 (p) p + 1 ... p + k - 1 p + k >>\r\nWhen someone clicks the button \"<<\" he is redirected to page 1, and when someone clicks the button \">>\" he is redirected to page n. Of course if someone clicks on a number, he is redirected to the corresponding page.\r\n\r\nThere are some conditions in the navigation:\r\n\r\nIf page 1 is in the navigation, the button \"<<\" must not be printed.\r\nIf page n is in the navigation, the button \">>\" must not be printed.\r\nIf the page number is smaller than 1 or greater than n, it must not be printed.\r\n \r\nYou can see some examples of the navigations. Make a program that prints the navigation.\r\n\r\nInput\r\nThe first and the only line contains three integers n, p, k (3 ≤ n ≤ 100; 1 ≤ p ≤ n; 1 ≤ k ≤ n)\r\n\r\nOutput\r\nPrint the proper navigation. Follow the format of the output from the test samples.\r\n\r\nExamples\r\ninputCopy\r\n17 5 2\r\noutputCopy\r\n<< 3 4 (5) 6 7 >> \r\ninputCopy\r\n6 5 2\r\noutputCopy\r\n<< 3 4 (5) 6 \r\ninputCopy\r\n6 1 2\r\noutputCopy\r\n(1) 2 3 >> \r\ninputCopy\r\n6 2 2\r\noutputCopy\r\n1 (2) 3 4 >>\r\ninputCopy\r\n9 6 3\r\noutputCopy\r\n<< 3 4 5 (6) 7 8 9\r\ninputCopy\r\n10 6 3\r\noutputCopy\r\n<< 3 4 5 (6) 7 8 9 >>\r\ninputCopy\r\n8 5 4\r\noutputCopy\r\n1 2 3 4 (5) 6 7 8 \r\n\r\n\r\n\r\n\"\"\"\r\n\r\nn, p, k = map(int, input().split(' '))\r\n\r\ns = '({})'.format(str(p))\r\n\r\nfor i in range(1, k + 1):\r\n if p - i > 0:\r\n s = str(p - i) + ' ' + s\r\n if p + i <= n:\r\n s += ' ' + str(p + i)\r\n\r\nif s[0] != '(' and int(s.split(' ')[0]) > 1:\r\n s = '<< ' + s\r\nif s[-1] != ')' and int(s.split(' ')[-1]) < n:\r\n s += ' >>'\r\n\r\nprint(s)\r\n", "nums = input().split(' ')\r\nn, p, k = [int(i) for i in nums]\r\n\r\nfront = last = ''\r\nif p - k > 1:\r\n front = '<< '\r\nif p + k < n:\r\n last = ' >>'\r\n\r\nf, l = [], []\r\nfor i in range(max(1, p - k), p):\r\n f.append(str(i))\r\nfor i in range(p + 1, 1 + min(n, p + k)):\r\n l.append(str(i))\r\nres = front + ' '.join(f + ['(' + str(p) + ')'] + l) + last\r\nprint(res)\r\n# class Solution(object):\r\n# def countSquares(self, matrix):\r\n# \"\"\"\r\n# :type matrix: List[List[int]]\r\n# :rtype: int\r\n# \"\"\"\r\n# res = 0\r\n# row, col = len(matrix), len(matrix[0])\r\n# for i in range(1, row):\r\n# for j in range(1, col):\r\n# if matrix[i][j] != 0:\r\n# matrix[i][j] += min(matrix[i - 1][j - 1], matrix[i][j - 1], matrix[i - 1][j])\r\n# # if matrix[i - 1][j - 1] and matrix[i][j - 1] and matrix[i - 1][j]:\r\n# # res += 1\r\n# for i in range(row):\r\n# for j in range(col):\r\n# if matrix[i][j]:\r\n# res += matrix[i][j]\r\n# print(matrix)\r\n# return res\r\n \r\n \r\n\r\n# matrix = [\r\n# [0,1,1,1],\r\n# [1,1,1,1],\r\n# [0,1,1,1]\r\n# ]\r\n\r\n# a = Solution().countSquares(matrix)\r\n# print(a)", "# https://codeforces.com/problemset/problem/399/A\n# A. Pages\n\nn, p, k = map(int, input().split())\nlower, upper = max(1, p - k), min(n, p + k)\nif lower != 1:\n result = '<<'\nelse:\n result = ''\nfor i in range(lower, upper + 1):\n if i == p:\n result += ' (' + str(i) + ')'\n else:\n result += ' ' + str(i)\nif upper != n:\n result += ' >>'\nprint(result)\n", "\r\nnpk = list(map(int, input().rstrip().split()))\r\n\r\nn = npk[0]\r\np = npk[1]\r\nk = npk[2]\r\n\r\nif p-k > 1:\r\n print('<<',end=\" \")\r\nfor i in range(p-k,p+k+1):\r\n if i in range(1,n+1):\r\n if i == p:\r\n print('({})'.format(i),end=\" \")\r\n else:\r\n print(i,end=\" \")\r\nif p+k < n:\r\n print('>>')\r\n \r\n", "ins = input()\n\ninputs = ins.split(\" \")\n\nn = int(inputs[0])\np = int(inputs[1])\nk = int(inputs[2])\n\nstring = \"\"\n\nif p - k <= 1:\n\tl = 1\nelse:\n\tl = p - k\n\nif p + k >= n:\n\tr = n\nelse:\n\tr = p + k\n\nif l != 1:\n\tstring = string + \"<< \"\n\nfor i in range(l,r + 1,1):\n\tif i == p:\n\t\tstring = string + \"(\" + str(i) + \") \"\n\telif i == r:\n\t\tstring = string + str(i)\n\telse:\n\t\tstring = string + str(i) + \" \"\n\nif r != n:\n\tstring = string + \" >>\"\n\nprint(string)", "m = input().split()\r\nn = int(m[0])\r\np = int(m[1])\r\nk = int(m[2])\r\n\r\nsup = min(p+k,n)\r\ninf = max(p-k,1)\r\n\r\nprint_list = []\r\n\r\nprint_list.append('<<'*(inf != 1))\r\nfor i in range(inf,sup+1):\r\n if i == p:\r\n print_list.append('('+str(i)+')')\r\n else:\r\n print_list.append(str(i))\r\nprint_list.append('>>'*(sup != n))\r\n\r\nprint((' '.join(print_list)).strip())", "n, p, k = map(int, input().split())\np1, p2 = max(1, p - k), min(n, p + k)\nif p1 > 1:\n print('<< ', end='')\nfor i in range(p1, p2 + 1):\n print(i if i != p else '(' + str(p) + ')', end=' ')\nprint('>>' if p2 < n else '')\n", "'''\r\n\tCodeForces 399A\r\n\tPages\r\n\r\n\tTag: Simulation\r\n'''\r\nn, p, k = list(map(int, input().split()))\r\n\r\nL = max(p - k, 1)\r\nR = min(p + k + 1, n + 1)\r\n\r\nLarrow = ['<<'] if L is not 1 else list()\r\nRarrow = ['>>'] if R is not n + 1 else list()\r\nmiddle = list(range(L, p)) + [f'({p})'] + list(range(p + 1, R))\r\n\r\nres = Larrow + middle + Rarrow\r\n\r\nprint(*res)", "a,b,c = input().split()\na = int(a)\nb = int(b)\nc = int(c)\nli = []\nfor i in range(b-c,b+c+1):\n if i>0:\n li.append(i)\n\nif li[0]!=1:\n print(\"<<\",end=\" \")\n\nfor i in li:\n \n if i==b:\n print('('+str(i)+')',end=\" \")\n else:\n print(i,end=\" \")\n\n if i==a:\n break\n\nif a not in li:\n print(\">>\")\n", "n, p, k = map(int, input().split())\r\na = []\r\nfor i in range(p-k, p+k+1):\r\n a.append(i)\r\nwhile a[0]<1:\r\n a.pop(0)\r\nwhile a[len(a)-1]>n:\r\n a.pop()\r\nif a[0]!=1:\r\n print(\"<<\",end=\" \")\r\nfor i in a:\r\n v = i\r\n if v==p:\r\n v = '('+str(v)+')'\r\n print(v, end=\" \")\r\nif a[len(a)-1]!=n:\r\n print(\">>\")\r\n", "arr = list(map(int, input().split()))\r\nn=arr[0]\r\np=arr[1]\r\nk=arr[2]\r\nstring=\"\"\r\nstart=p-k\r\nif p-k > 1:\r\n string+=\"<<\"\r\n while start!= p:\r\n string+=str(\" \"+str(start))\r\n start+=1\r\nelse:\r\n start=1\r\n for i in range(1,p):\r\n string+=str(\" \"+str(start))\r\n start+=1\r\n start=p\r\nstring+=str(\" (\"+str(p)+\")\")\r\nstart+=1\r\nif p+k >= n:\r\n for i in range(p,n):\r\n string+=str(\" \"+str(start))\r\n start+=1\r\nelse:\r\n end=p+k+1\r\n while start != end:\r\n string+=str(\" \"+str(start))\r\n start+=1\r\n string+=\" >>\"\r\nprint(string)", "n, p, k = map(int, input().split())\r\ns = \"\"\r\nif p - k - 1 > 0:\r\n s += \"<< \"\r\nfor i in range(p - k, p):\r\n if i > 0:\r\n s += str(i)\r\n s += \" \"\r\ns += \"(\"\r\ns += str(p)\r\ns += \") \"\r\nfor i in range(p + 1, p + k + 1):\r\n if i <= n:\r\n s += str(i)\r\n s += \" \"\r\nif p + k < n:\r\n s += \">>\"\r\nprint(s)\r\n", "n, p, k = input().split()\r\nn, p, k = int(n), int(p), int(k)\r\nq = str(p)\r\nq = '('+q+')'\r\n\r\na = [p]\r\nfor i in range (k):\r\n if (p-i-1)<1:\r\n break\r\n else:\r\n a = [p-i-1]+a\r\nfor i in range (p+1,p+k+1):\r\n if (i)>n:\r\n break\r\n else:\r\n a = a+[i]\r\n\r\nif a[0]>1:\r\n a = ['<<']+a\r\nif a[len(a)-1]<n:\r\n a = a+['>>']\r\nfor i in range(len(a)):\r\n if a[i]==p:\r\n a[i]=q\r\n break\r\n \r\nprint(*a, sep = ' ')", "n,p,k=map(int,input().split())\r\nif(p<1 or p>n):\r\n print(None)\r\nelse:\r\n if(p-k>1 and p+k<n):\r\n print(\"<<\",\" \".join(\"(%d)\"%(i) if i==int(((p-k)+(p+k))/2) else str(i) for i in range(p-k,p+k+1)),\">>\")\r\n elif(p-k<=1 and p+k>=n):\r\n print(\" \".join(\"(%d)\"%(i) if i==int(((p-k)+(p+k))/2) else str(i) for i in range(1,n+1)))\r\n elif(p-k>1):\r\n print(\"<<\",\" \".join(\"(%d)\"%(i) if i==int(((p-k)+(p+k))/2) else str(i) for i in range(p-k,n+1)))\r\n elif(p+k<n):\r\n print(\" \".join(\"(%d)\"%(i) if i==int(((p-k)+(p+k))/2) else str(i) for i in range(1,p+k+1)),\">>\")", "n, p, k = map(int, input().split())\r\n\r\nnavigation = \"\"\r\n\r\n# If page 1 is in the navigation, the button \"<<\" must not be printed.\r\nif p - k > 1:\r\n navigation += \"<< \"\r\n \r\nfor i in range(max(1, p - k), min(n + 1, p + k + 1)):\r\n # If the page number is smaller than 1 or greater than n, it must not be printed.\r\n if i < 1 or i > n:\r\n continue\r\n # If someone clicks on a number, he is redirected to the corresponding page.\r\n if i == p:\r\n navigation += \"(\" + str(i) + \") \"\r\n else:\r\n navigation += str(i) + \" \"\r\n\r\n# If page n is in the navigation, the button \">>\" must not be printed.\r\nif p + k < n:\r\n navigation += \">>\"\r\n\r\nprint(navigation)\r\n", "n,x,k=map(int,input().split())\r\ns=''\r\nif x>k+1:\r\n s+='<< '\r\nfor i in range(max(1,x-k),min(n,x+k)+1):\r\n if i==x:\r\n s+=\"(\"+str(i)+\") \"\r\n else:\r\n s+=str(i)+' '\r\nif x+k<n:\r\n s+='>>'\r\nprint(s)\r\n", "import math,string,itertools,fractions,heapq,collections,re,array,bisect\nfrom itertools import chain, dropwhile, permutations, combinations\nfrom collections import defaultdict\n\n\ndef main(n,p,k):\n x = range(p-k,p+k+1)\n x = [j for j in x if j >=1 and j <= n]\n if 1 not in x:\n print(\"<< \",end=\"\")\n for j in range(max(1,p-k),p):\n print(str(j),end=\" \")\n print(\"(\"+str(p)+\") \",end=\"\")\n for j in range(p+1,min(p+k,n)+1):\n print(str(j),end=\" \")\n if n not in x:\n print(\">>\")\n\n\ndef main_input(info=0):\n n,p,k = map(int,input().split())\n #t = [(int(x)-1,i+1) for i,x in enumerate(input().split())]\n #l,r = list(range(n)), list(range(n))\n #for i in range(n):\n # l[i],r[i] = map(int,input().split())\n# t = [map(int,input().split()) for x in range(n)]\n main(n,p,k)\n\nif __name__ == \"__main__\":\n main_input()\n", "n,p,k=map(int,input().split(' '))\r\n\r\nv=[x for x in range(p-k,p+k+1)]\r\n\r\nnv=list()\r\n\r\nfor c in v:\r\n if c>0 and c<=n:\r\n nv.append(c)\r\n\r\nv=nv\r\n\r\nif v[0]!=1:\r\n v.insert(0,'<<')\r\nif v[len(v)-1]!=n:\r\n v.append('>>')\r\n\r\npin=v.index(p)\r\nv[pin]='('+str(p)+')'\r\n\r\nfor c in v:\r\n print(c,end=' ')\r\n", "n, p, k = map(int, input().split())\r\ns = ''\r\nl = max(p-k, 1)\r\nr = min(p+k, n)\r\nfor i in range(l, r+1):\r\n if i == p:\r\n s += '(' + str(i) + ')'\r\n else:\r\n s += str(i)\r\n s += ' '\r\n\r\nif l != 1:\r\n s = '<< ' + s\r\n\r\nif r != n:\r\n s += '>>'\r\n\r\nprint(s)", "# LUOGU_RID: 101541844\nn, p, k = map(int, input().split())\r\nans = []\r\nif p - k > 1:\r\n ans += '<<',\r\nfor i in range(p - k, p + k + 1):\r\n if 1 <= i <= n:\r\n ans += (f'({i})' if i == p else str(i)),\r\nif p + k < n:\r\n ans += '>>',\r\nprint(*ans)", "n,p,k=map(int,input().split())\nlo=max(p-k,1)\nhi=min(n,p+k)\nans=\"\"\nif lo>1: ans=\"<<\"\nfor i in range(lo,p):\n ans+=\" \"+str(i)\nif p>1: ans+=\" \"\nans+=\"({0:d})\".format(p)\nfor i in range(p+1,hi+1):\n ans+=\" \"+str(i)\nif hi<n: ans+=\" >>\"\nprint(ans)", "n, p, k = [int(s) for s in input().split()]\n\nlnums = list(range(max(1, p-k), p))\nrnums = list(range(p+1, min(n+1, p+k+1)))\nlbit = '<< ' if 1 not in lnums and len(lnums) != 0 else ''\nrbit = ' >>' if n not in rnums and len(rnums) != 0 else ''\n\nprint(lbit + ' '.join(str(n) for n in lnums) + ' ({}) '.format(p) + ' '.join(str(n) for n in rnums) + rbit)", "pages, current, k = [int(x) for x in input().split(' ')]\r\n\r\nstring = ''\r\n\r\nif current - k > 1:\r\n string += '<< '\r\n\r\nfor extra in range(current-k, current):\r\n if extra >= 1:\r\n string += str(extra) + ' '\r\n\r\nstring += '(' + str(current) + ') '\r\n\r\nfor extra in range(current + 1, current + (k + 1)):\r\n if extra <= pages:\r\n string += str(extra) + ' '\r\n\r\nif current + k < pages:\r\n string += '>>'\r\n\r\nprint(string)", "def solution(n, p, k):\n if p - k > 1:\n result = ['<<']\n else:\n result = []\n for i in range(max(1, p-k), min(n, p+k)+1):\n if i == p:\n result.append('({})'.format(i))\n else:\n result.append(str(i))\n if p + k < n:\n result.append('>>')\n return ' '.join(result)\n\n\ndef tester():\n tests = [((17, 5, 2), '<< 3 4 (5) 6 7 >>'),\n ((6, 5, 2), '<< 3 4 (5) 6'),\n ((6, 1, 2), '(1) 2 3 >>'),\n ((6, 2, 2), '1 (2) 3 4 >>'),\n ((9, 6, 3), '<< 3 4 5 (6) 7 8 9'),\n ((10, 6, 3), '<< 3 4 5 (6) 7 8 9 >>'),\n ((8, 5, 4), '1 2 3 4 (5) 6 7 8')]\n for test in tests:\n n, p, k = test[0]\n try:\n assert solution(n, p, k) == test[1]\n except:\n print('Test:', test[0])\n print('Answer:', test[1])\n print('Solution:', solution(n, p, k))\n raise\n\n\nif __name__ == '__main__':\n tester()\n n, p, k = tuple(map(int, input().split()))\n print(solution(n, p, k))", "def pages():\r\n num = input()\r\n n = int(num.split(' ')[0])\r\n p = int(num.split(' ')[1])\r\n k = int(num.split(' ')[2])\r\n pk1 = p - k\r\n pk2 = p + k\r\n if pk1 < 1:\r\n pk1 = 1\r\n if pk1 != 1:\r\n print('<<', end=' ')\r\n for i in range(pk1,p+k+1):\r\n if i == p:\r\n print('(%i)'%i,end=' ')\r\n elif i <= p + k and i <= n:\r\n # print(i,p+k)\r\n print('%i'%i,end=' ')\r\n if p + k < n:\r\n print('>>',end='')\r\npages()", "n, p, k = map(int, input().split())\ns = []\ns += [p - k + i for i in range(2*k + 1) if p - k + i > 0 and p - k + i <= n]\nif 1 not in s:\n s = ['<<'] + s\nif n not in s:\n s.append('>>')\ndef f(i, p):\n if i == p:\n return '(' + str(i) + ')'\n return str(i)\nprint(' '.join([f(i, p) for i in s]))\n\n", "n, p, k = list(map(int, input().split()))\n\ns = '({})'.format(p)\nfor i in range(1,k + 1):\n # if p - i == 0:\n # s = '<< ' + s\n if p - i > 0:\n s = str(p - i) + ' ' + s\n # if p + i == n + 1:\n # s = s + ' >>'\n if p + i <= n:\n s = s + ' ' + str(p + i)\nif p - k > 1:\n s = '<< ' + s\nif p + k < n:\n s = s + ' >>'\nprint(s)", "s = input()\ns = [int(x) for x in s.split(\" \")]\nn,p,k = s[0],s[1],s[2]\n\nif p-k > 1:\n print(\"<< \",end=\"\")\nfor i in range(-k,k+1):\n if i+p < 1:\n continue\n if i+p <= n:\n if i == 0:\n print(\"(\",i+p,\") \",sep=\"\",end=\"\")\n else:\n print(i+p,end=\" \")\nif i+p < n:\n print(\">>\")\n", "test = list(map(int, input().split(\" \")))\r\nn = test[0]\r\np = test[1]\r\nk = test[2]\r\nstart = p - k\r\nend = p + k\r\nstart = max(1, start)\r\nend = min(n, end)\r\nif start!=1:\r\n print(\"<<\", end=\" \")\r\nfor i in range(start, end+1):\r\n if i==p:\r\n print(\"(%d)\"%(i), end=\" \")\r\n continue\r\n print(i, end=\" \")\r\nif end!=n:\r\n print(\">>\")", "n, p, k = list(map(int, input().split()))\r\npages = range(max(1, p-k), min(p+k+1,n+1))\r\npre, suf = \"<< \", \" >>\"\r\nif pages[0] == 1:\r\n pre = \"\"\r\nif pages[-1] == n:\r\n suf = \"\"\r\npages = list(map(str, pages))\r\nfor i in range(len(pages)):\r\n if pages[i] == str(p):\r\n pages[i] = \"(\" + pages[i] + \")\"\r\nprint(pre + \" \".join(map(str, pages)) + suf)\r\n\r\n ", "\r\nclass Solution:\r\n def navigation(self, n, p, k):\r\n start = max(1, p-k)\r\n end = min(p+k, n)\r\n\r\n pagination = \"\"\r\n\r\n if start > 1:\r\n pagination += \"<< \"\r\n\r\n while start <= end:\r\n if start == p:\r\n pagination += \"(\" + str(start) + \") \"\r\n else:\r\n pagination += str(start) + \" \"\r\n\r\n start += 1\r\n\r\n if end < n:\r\n pagination += \">>\"\r\n\r\n return pagination\r\n\r\n\r\nsol = Solution()\r\n\r\n# array = [11, 12, 1, 2, 13, 14, 3, 4]\r\n# print(sol.thanosSort(array))\r\n\r\n[n, p, k] = list(map(int, input().strip().split()))\r\n\r\nprint(sol.navigation(n, p, k))\r\n", "def pr(x,n,p):\r\n s=''\r\n if x[0]!=1:\r\n s+='<< '\r\n for i in range(len(x)):\r\n if x[i]==p:\r\n s+='('+str(x[i])+') '\r\n else: \r\n s+=str(x[i])\r\n s+=' '\r\n if x[len(x)-1]!=n:\r\n s+='>>'\r\n print(s)\r\n\r\n\r\n\r\n# x[0]=n, x[1]=p, x[2]=k\r\nx=[int(x) for x in input().split()]\r\nl=[x[1]]\r\n\r\nfor i in range(1,x[2]+1):\r\n a = x[1]+i\r\n b = x[1]-i\r\n if a<=x[0]:\r\n l.append(a)\r\n if b>0:\r\n l.insert(0,b)\r\npr(l,x[0],x[1])\r\n\r\n \r\n", "n,p,k=[int(i) for i in input().split()]\r\nl=max(p-k,1);\r\nr=min(p+k,n)\r\ns=[];\r\nif l>1:\r\n\ts.append('<<')\r\nfor i in range(l,r+1):\r\n\tt=''\r\n\tif i==p:\r\n\t\tt+='('\r\n\tt+=str(i)\r\n\tif i==p:\r\n\t\tt+=')'\r\n\ts.append(t)\r\nif r<n:\r\n\ts.append('>>')\r\nprint(' '.join(s))\r\n\t\r\n", "import sys\r\nfrom math import *\r\n\r\ndef minp():\r\n\treturn sys.stdin.readline().strip()\r\n\r\ndef mint():\r\n\treturn int(minp())\r\n\r\ndef mints():\r\n\treturn map(int, minp().split())\r\n\r\nn, p, k = mints()\r\na = []\r\nif p-k-1 > 0:\r\n\ta.append(\"<<\")\r\nfor i in range(max(p-k,1),p):\r\n\ta.append(str(i))\r\na.append('('+str(p)+')')\r\nfor i in range(p+1,min(p+k+1,n+1)):\r\n\ta.append(str(i))\r\nif p+k+1 <= n:\r\n\ta.append(\">>\")\r\nprint(*a)\r\n\t", "from sys import stdin, stdout\r\n\r\n\r\nn, p, k = map(int, stdin.readline().split())\r\n\r\nar = list()\r\n\r\nfor i in range(p - k, p + k + 1):\r\n ar.append(i)\r\n\r\nf = 0\r\n\r\nif 1 not in ar:\r\n stdout.write(\"<<\")\r\n f = 1\r\n\r\n\r\nfor i in ar:\r\n if i < 1 or i > n:\r\n continue\r\n if f == 1:\r\n stdout.write(' ')\r\n f = 1\r\n if i == p:\r\n stdout.write(\"(\" + str(i) + \")\")\r\n else:\r\n stdout.write(str(i))\r\n\r\nif n not in ar:\r\n stdout.write(\" >>\")\r\n\r\nstdout.write('\\n')", "n,p,k=map(int,input().split(\" \")); \r\nl=[]\r\nl.append(p)\r\nfor i in range(1,k+1):\r\n if (i+p) > n:\r\n break;\r\n else:\r\n l.append(p+i)\r\nfor i in range(1,k+1):\r\n if p-i==0:\r\n break;\r\n else:\r\n l.append(p-i)\r\nl.sort()\r\nfor i in range(len(l)):\r\n if i==0 and l[i]!=p :\r\n if l[0]!=1:\r\n print(\"<<\",end=\" \")\r\n print(l[0],end=\" \")\r\n else:\r\n print(l[0],end=\" \")\r\n elif i==(len(l)-1) and l[i]!=p:\r\n if l[i]!=n:\r\n print(l[i],end=\" \")\r\n print(\">>\")\r\n else:\r\n print(l[i])\r\n elif l[i]==p:\r\n print(\"(\",end=\"\")\r\n print(l[i],end=\"\")\r\n print(\")\",end=\" \")\r\n else:\r\n print(l[i],end=\" \")\r\n \r\n \r\n \r\n", "\r\ndef npages(n, p, k):\r\n ran_left = p-k\r\n ran_right = p+k\r\n page = [] \r\n\r\n if(ran_left <= 0 or ran_left == 1):\r\n for i in range(1, p+1):\r\n page.append(i)\r\n else:\r\n page.append(\"<<\")\r\n for i in range(ran_left, p+1):\r\n page.append(i) \r\n \r\n if(ran_right >= n):\r\n for i in range(p+1, n+1):\r\n page.append(i)\r\n else:\r\n for i in range(p+1, ran_right+1):\r\n page.append(i)\r\n page.append(\">>\")\r\n \r\n ind = page.index(p)\r\n page[ind] = \"(\" + str(p) + \")\" \r\n return page\r\n\r\nif __name__ == \"__main__\":\r\n\r\n output = list(map(int, input().split()))\r\n n = output[0]\r\n p = output[1]\r\n k = output[2]\r\n \r\n pagination = npages(n, p, k) \r\n\r\n for i in pagination:\r\n print(i, end=\" \")\r\n \r\n", "n, p, k = list(map(int, input().split(' ')))\n\nnavigation = '(' + str(p) + ')'\nfor i in range(1, k + 2):\n if p + i <= n and i <= k:\n navigation += ' ' + str(p + i)\n elif p + i > n:\n break\n else:\n navigation += ' >>'\n\nfor i in range(1, k + 2):\n if p - i >= 1 and i <= k:\n navigation = str(p - i) + ' ' + navigation\n elif p - i < 1:\n break\n else:\n navigation = '<< ' + navigation\n\nprint(navigation)\n\t \t \t \t \t \t \t\t \t\t", "def main():\r\n\r\n\r\n\ts = list(map(int,input().split()))\r\n\tn,p,k = [s[0],s[1],s[2]]\r\n\ty,z = 0,0\r\n\tprefix = ''\r\n\tsuffix = ''\r\n\t\r\n\tif p-k > 1:\r\n\t\tprefix = \"<< \"\r\n\tif p+k < n:\r\n\t\tsuffix = \">>\"\r\n\r\n\tprint(prefix,end=\"\")\r\n\t\r\n\tz = n if p+k > n else p+k\r\n\ty=1 if p-k < 1 else p-k\r\n\r\n\tfor i in range(y,z+1):\r\n\t\tif i == p:\r\n\t\t\tprint(\"({})\".format(p),end=' ')\r\n\t\telse:\r\n\t\t\tprint(i,end=\" \")\r\n\tprint(suffix)\r\n\r\n\r\n\r\nif __name__ == '__main__':\r\n\tmain()", "n,p,k=input().split()\nn=int(n)\np=int(p)\nk=int(k)\ns=p+k\nt=p-k\nif s>=n and t<=1:\n\tfor i in range(1,p,1):\n\t\tprint(i,end=' ')\n\tprint('(',end='')\n\tprint(p,end='')\n\tprint(')',end=' ')\n\tfor i in range(p+1,n+1,1):\n\t\tprint(i,end=' ')\nif s>=n and t>1:\n\tprint('<<',end=' ')\n\tfor i in range(t,p,1):\n\t\tprint(i,end=' ')\n\tprint('(',end='')\n\tprint(p,end='')\n\tprint(')',end=' ')\n\tfor i in range(p+1,n+1,1):\n\t\tprint(i,end=' ')\nif s<n and t<=1:\n\tfor i in range(1,p,1):\n\t\tprint(i,end=' ')\n\tprint('(',end='')\n\tprint(p,end='')\n\tprint(')',end=' ')\n\tfor i in range(p+1,s+1,1):\n\t\tprint(i,end=' ')\n\tprint('>>',end=' ')\nif s<n and t>1:\n\tprint('<<',end=' ')\n\tfor i in range(p-k,p,1):\n\t\tprint(i,end=' ')\n\tprint('(',end='')\n\tprint(p,end='')\n\tprint(')',end=' ')\n\tfor i in range(p+1,s+1,1):\n\t\tprint(i,end=' ')\n\tprint('>>',end=' ')", "import math\r\nimport cmath\r\n\r\nn, s, m = map(int, input().split())\r\nleft = max(1, s - m)\r\nright = min(n, s + m)\r\nif left != 1:\r\n print(\"<<\", end = ' ')\r\nfor x in range(left, s):\r\n print(x, end = ' ')\r\nprint('(', end ='')\r\nprint(s, end = '')\r\nprint(')', end = ' ')\r\nfor x in range(s + 1, right+1):\r\n print(x, end = ' ')\r\nif right != n:\r\n print(\">>\")\r\n\r\n\r\n", "n, p, k = map(lambda x: int(x), input().split())\r\nL = []\r\n\r\nif p - k > 1: L.append('<<')\r\n\r\nfor i in range(k):\r\n\tif p + (i - k) >= 1:\r\n\t\tL.append(str(p + (i - k)))\r\n\r\nL.append('(' + str(p) + ')')\r\n\r\nfor i in range(1, k + 1):\r\n\tif p + i > n: break\r\n\tL.append(str(p + i))\r\n\r\nif p + k < n: L.append('>>')\r\nprint(' '.join(L))", "n,p,k=list(map(int,input().split()))\r\ns=''\r\nif p-k>1:\r\n s=\"<< \"\r\n for i in range(p-k,p):\r\n s+=str(i)+' '\r\nelse:\r\n for i in range(1,p):\r\n s+=str(i)+' '\r\ns+='('+str(p)+') '\r\nif p+k<=n:\r\n for i in range(p+1,p+k+1):\r\n s+=str(i)+' '\r\n if p+k!=n:\r\n s+=\">>\"\r\nelse:\r\n for i in range(p+1,n+1):\r\n s+=str(i)+' '\r\nprint(s) \r\n", "strI = input().split(' ')\n\nn, p, k = [int(i) for i in strI]\n\ni = 1\nend = p+k\n\nch1 = p-k\nch2 = p+k\n\nif ch2 >= n:\n ch2 = n\n\nif ch1 <= 1:\n i = 1\nelse:\n i = ch1\n\nout = ''\n\nwhile i <= ch2:\n\n if i == 1 and p == 1:\n out += '(' + str(i) + ') '\n elif i == 1:\n out += str(i) + ' '\n elif i == ch1 and p == ch1:\n out += '<< (' + str(i) + ') '\n elif i == ch1:\n out += '<< ' + str(i) + ' '\n elif i == n and p == n:\n out += '(' + str(i) + ') '\n elif i == n:\n out += str(i) + ' '\n elif i == ch2 and p == ch2:\n out += '(' + str(i) + ') >>'\n elif i == ch2:\n out += str(i) + ' >>'\n elif i == p:\n out += '(' + str(i) + ') '\n else:\n out += str(i) + ' '\n\n i += 1\n\nprint(out)", "def pages_cf():\r\n n, p, k = list(map(int, input().split()))\r\n res = []\r\n if p - k <= 1:\r\n [res.append(str(i)) for i in range(1, p)]\r\n else:\r\n res.append('<<')\r\n [res.append(str(i)) for i in range(p-k, p)]\r\n res.append('({})'.format(str(p)))\r\n if p + k >= n:\r\n [res.append(str(i)) for i in range(p+1, n+1)]\r\n else:\r\n [res.append(str(i)) for i in range(p+1, p+k+1)]\r\n res.append('>>')\r\n return ' '.join(res)\r\n\r\n\r\nprint(pages_cf())", "from sys import stdin\r\ndef main():\r\n h=[]\r\n c=[]\r\n j=[]\r\n x=stdin.readline().split()\r\n i=0\r\n while int(x[1])+1+i<=int(x[0]) and (i<int(x[2])):\r\n h.append(int(x[1])+i+1)\r\n i=i+1\r\n i=0\r\n while int(x[1])-1-i>=1 and (i<int(x[2])):\r\n c.append(int(x[1])-i-1)\r\n c.sort()\r\n i=i+1\r\n if len(c)>=1:\r\n if c[0]>1:\r\n c.insert(0,(\"<<\"))\r\n if len(h)>=1:\r\n if int(x[0])>(h[len(h)-1]):\r\n h.append(str(\">>\"))\r\n g=str('('+x[1]+')').split()\r\n j=c+g+h\r\n for i in range (len(j)):\r\n j[i]=str(j[i])\r\n d=\" \".join(j)\r\n print (d) \r\n \r\nmain()", "n, p, k = map(int, input().split())\r\nif p - k > 1: print('<<' , end = ' ')\r\nfor i in range(max(1, p - k), p): print(i, end = ' ')\r\nprint('(' + str(p) + ')', end = ' ')\r\nfor i in range(p + 1, min(n, p + k) + 1): print(i, end = ' ')\r\nif p + k < n: print('>>')\r\n", "n, p, k = [int(i) for i in input().split()]\r\n\r\nif p - k > 1:\r\n print('<< ', end='')\r\n\r\nfor i in range(p-k, p):\r\n if i >= 1:\r\n print('{} '.format(i), end='')\r\n\r\nprint('({})'.format(p), end='')\r\n\r\nfor i in range(p+1, p+k+1):\r\n if i <= n:\r\n print(' {}'.format(i), end='')\r\n \r\nif p + k < n:\r\n print(' >>', end='')\r\n", "n, p, k = [int(v) for v in input().split()]\r\npages = [num for num in range(p-k, p+k+1) if 0 < num <= n]\r\nresult = '' if 1 in pages else '<<'\r\nfor page in pages:\r\n if page != p:\r\n temp = ' {}'\r\n else:\r\n temp = ' ({})'\r\n result += temp.format(page)\r\n\r\nresult += '' if n in pages else ' >>'\r\nprint(result.strip())", "t = 1#int(input())\r\n\r\nfor tt in range(t):\r\n n,p,k = map(int,input().split())\r\n start = p - k\r\n if start <= 0:\r\n start = 1\r\n \r\n if start > 1:\r\n print('<<',end = ' ')\r\n \r\n for i in range(start,p):\r\n print(i,end = ' ')\r\n\r\n end = p + k\r\n if end > n:\r\n end = n\r\n print('({0})'.format(p),end = ' ')\r\n for i in range(p+1,end+1):\r\n print(i,end = ' ')\r\n \r\n if end != n:\r\n print('>>',end = ' ')\r\n print('')\r\n", "n,p,k=[int(x) for x in input().split()]\r\nres=str()\r\nif p-k>1:res+='<< '\r\nfor i in range(p-k,p):\r\n if i>0:res+=str(i)+' '\r\nres+='('+str(p)+')'+' '\r\nfor i in range(p+1,p+k+1):\r\n if i<=n:res+=str(i)+' '\r\nif p+k<n:res+='>>'\r\nelse:res=res[:-1]\r\nprint(res)\r\n", "n, p, k = map(int, input().split())\r\n\r\nans = [i for i in range(p - k, p + k + 1)]\r\n\r\nwhile ans[0] < 1:\r\n ans.pop(0)\r\nwhile ans[-1] > n:\r\n ans.pop()\r\n\r\nif ans[0] > 1:\r\n ans = ['<<'] + ans\r\nif ans[-1] < n:\r\n ans.append('>>')\r\nfor i in range(len(ans)):\r\n if ans[i] == p:\r\n ans[i] = f'({p})'\r\nprint(*ans)\r\n", "n,p,k=map(int,input().split())\nli=[]\nif p-k>1:\n li+=['<<']\nfor i in range(max(1,p-k),min(p+k,n)+1):\n li+=['('*int(i==p)+str(i)+')'*int(i==p)]\nli+=['>>'*int(p+k<n)]\nprint( *li )\n", "n,p,k=map(int,input().split())\r\nb=p-k\r\nif(b<=1):\r\n for i in range(1,p):\r\n print(i,end=' ')\r\nelse:\r\n print('<<',end=' ')\r\n for i in range(b,p):\r\n print(i,end=' ')\r\nprint('(',end='')\r\nprint(p,end='')\r\nprint(')',end=' ')\r\nb=p+k\r\nif(b>=n):\r\n for i in range(p+1,n+1):\r\n print(i,end=' ')\r\nelse:\r\n for i in range(p+1,p+k+1):\r\n print(i,end=' ')\r\n print('>>')\r\n", "n,p,k=map(int,input().split())\narr=[]\narr.append(\"<<\")\nfor i in range(p-k,p+k+1):\n\tif i<=n and i>=1:\n\t\tif i==p:\n\t\t\tarr.append(\"(\"+str(p)+\")\")\n\t\telse:\n\t\t\tarr.append(i)\narr.append(\">>\")\nif p-k<=1:\n\tif p+k>=n:\n\t\tx=arr[1:]\n\t\tprint(*x[:-1])\n\telse:\n\t\tprint(*(arr[1:]))\nelif p+k>=n:\n\tprint(*(arr[:-1]))\nelse:\n\tprint(*(arr))", "list1=list()\r\nx=input()\r\nn,p,k=x.split()\r\nn=int(n)\r\np=int(p)\r\nk=int(k)\r\nfor i in range(n+1):\r\n list1.append(i)\r\nif p-k>1:\r\n print('<<',end=\" \")\r\nfor i in range(2*k+1):\r\n if p-k+i==p:\r\n print('('+str(p)+')',end=\" \")\r\n if p-k+i>0 and p-k+i<=n and p-k+i!=p:\r\n print(list1[p-k+i],end=\" \")\r\nif p+k<n:\r\n print('>>')\r\n", "def main():\n data: list = list(map(int, input().split()))\n # x = [6, 1, 2]\n n: int = data[0]\n p: int = data[1]\n k: int = data[2]\n tmp: list = list()\n nav: list = list()\n\n for i in range(k + 1):\n x = p - i\n if 0 < x:\n if x is not p:\n tmp.append(str(x))\n\n tmp.reverse()\n nav = tmp.copy()\n tmp.clear()\n\n for i in range(k + 1):\n x = p + i\n if x <= n:\n if x is not p:\n tmp.append(str(x))\n\n nav.append('(%d)' % p)\n nav = nav + tmp\n tmp.clear()\n\n if nav[0].strip('(').strip(')') != '1':\n print('<<', end=' ')\n\n if nav[len(nav) - 1].strip('(').strip(')') != str(n):\n print(' '.join(nav), end=' >>\\n')\n else:\n print(' '.join(nav))\n\n\nif __name__ == '__main__':\n main()\n", "n,p,k=map(int,input().split())\r\ns=[i for i in range(p-k,p) if i>0]\r\nt=[i for i in range(p+1,p+k+1) if i <=n]\r\nx=''\r\nif s!=[] and s[0]!=1:\r\n x='<< '\r\nif s!=[]:\r\n x+=' '.join(map(str,s))\r\nx+=' ({0})'.format(p)\r\nif t!=[]:\r\n x+=' '+' '.join(map(str,t))\r\nif t!=[] and t[len(t)-1]!=n:\r\n x+=' >>'\r\nprint(x)", "n, p, k = map(int, input().split())\r\nres = []\r\nif p - k > 1:\r\n res.append('<< ')\r\nfor i in range(max(1, p - k), p):\r\n res.append(f'{i} ')\r\nres.append(f'({p}) ')\r\nfor i in range(p + 1, min(n + 1, p + k + 1)):\r\n res.append(f'{i} ')\r\nif p + k < n:\r\n res.append('>>')\r\nprint(''.join(res))\r\n", "from collections import deque\r\ndef pages(n, p, k):\r\n ans = deque([\"(\"+str(p)+\")\"])\r\n for i in range(1,k+1):\r\n if p-i >= 1:\r\n ans.appendleft(str(p-i))\r\n if p+i <= n: \r\n ans.append(str(p+i))\r\n\r\n if p-k > 1:\r\n ans.appendleft(\"<<\")\r\n if p+k < n:\r\n ans.append(\">>\")\r\n\r\n return \" \".join(ans)\r\n\r\narr = list(map(int, input().split()))\r\nprint(pages(arr[0], arr[1], arr[2])) \r\n \r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Tue Feb 4 15:36:36 2020\r\n\r\n@author: DeLL\r\n\"\"\"\r\n\r\nn,p,k=[int(x) for x in input().split()]\r\nL=[]\r\nif p-k>1:\r\n L.append(\"<<\")\r\n i=p-k\r\nelse:\r\n i = 1\r\nwhile(i<=p+k and i<=n):\r\n if(i!=p):\r\n L.append(str(i))\r\n else:\r\n L.append('('+str(p)+')')\r\n i+=1\r\nif p+k<n:\r\n L.append(\">>\")\r\n\r\nprint(' '.join(L))", "\"\"\"Pages\"\"\"\r\ndef main():\r\n n, p, k = map(int, input().split())\r\n if p - k > 1:\r\n print(\"<<\", end=\" \")\r\n for i in range(p-k, p+k+1):\r\n if i in range(1, n+1):\r\n if i == p:\r\n print(f\"({i})\",end=\" \")\r\n else:\r\n print(i,end=\" \")\r\n if p + k < n:\r\n print(\">>\")\r\n\r\n\r\nif __name__ == '__main__':\r\n main()", "n, p, k = map(int, input().split())\r\n\r\noutput = []\r\nstart = max(1, p - k)\r\nend = min(n, p + k)\r\nif start != 1:\r\n output.append(\"<<\")\r\nfor i in range(start, end + 1):\r\n if i == p:\r\n output.append(\"(\" + str(i) + \")\")\r\n else:\r\n output.append(str(i))\r\nif end != n:\r\n output.append(\">>\")\r\n\r\nprint(\" \".join(output))\r\n\r\n", "wew= input().split()\r\nn=int(wew[0])\r\np=int(wew[1])\r\nk=int(wew[2])\r\nf=[]\r\nfor a in range(1,int(n)+1):\r\n f.append(str(a))\r\n\r\nif p+k>=n and p-k<=1:\r\n print(' '.join(f[:p-1])+' ('+str(p)+') '+' '.join(f[p:]))\r\n\r\nelif p+k>=n:\r\n print('<< '+' '.join(f[p-k-1:p-1])+' ('+str(p)+') '+' '.join(f[p:]))\r\n\r\nelif p-k<=1:\r\n print(' '.join(f[:p-1])+' ('+str(p)+') '+' '.join(f[p:p+k])+' >>')\r\n\r\nelse:\r\n print('<< '+' '.join(f[p-k-1:p-1])+' ('+str(p)+') '+' '.join(f[p:p+k])+' >>')", "n,p,k=map(int,input().split())\nif p-k>1:print(\"<<\",end=\" \")\nfor _ in range(max(1,p-k),min(n,p+k)+1):print(_ if _!=p else\"(\"+str(_)+\")\",end=\" \")\nif p+k<n:print(\">>\")\n\t \t \t\t \t \t\t \t \t \t\t \t\t", "n,p,k=map(int,input().split())\r\nif p-k>1:print(\"<<\",end=\" \")\r\nfor f in range(max(1,p-k),min(n,p+k)+1):print(f if f!=p else\"(\"+str(f)+\")\",end=\" \")\r\nif p+k<n:print(\">>\")", "def stringofnumbers(start, end):\r\n string = ''\r\n for x in range(start, end):\r\n string += '%i ' % x\r\n return string\r\n\r\n\r\ninput = list(map(int, input().split(' ')))\r\nstring = ''\r\nif input[1]-input[2] > 1:\r\n string += '<< '\r\n startingnum = input[1]-input[2]\r\nelse:\r\n startingnum = 1\r\nstring += stringofnumbers(startingnum, input[1])\r\nstring += '(%i) ' % input[1]\r\nstring += stringofnumbers(input[1] + 1,\r\n min([input[0], input[1] + input[2]]) + 1)\r\nif input[1] + input[2] < input[0]:\r\n string += '>> '\r\nprint(string)\r\n", "def solve(n, p, k):\r\n res = []\r\n if 1 <= p <= n:\r\n arr = [p + x for x in range(-k, k + 1, 1) if 1 <= (p + x) <= n]\r\n if arr[0] != 1:\r\n res.append(\"<<\")\r\n for a in arr:\r\n if a == p:\r\n res.append(\"(%d)\" % a)\r\n else:\r\n res.append(\"%d\" % a)\r\n if arr[-1] != n:\r\n res.append(\">>\")\r\n return \" \".join(res)\r\n\r\n\r\ndef main():\r\n n, p, k = list(map(int, input().split()))\r\n print(solve(n, p, k))\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "n,p,k = [int(i) for i in input().split()]\na = max(1,p-k)\nb = min(n,p+k)\nl = list(range(a,p)) + list(range(p,b+1))\nif(l[0] != 1):\n print(\"<< \",end='')\nfor i in l:\n if(i == p):\n print(\"(\"+str(i)+\")\",end=' ')\n else:\n print(i,end=' ')\nif(l[-1] != n):\n print(\">>\",end='')\nprint()", "n,p,k=input().split()\r\nn,p,k=int(n),int(p),int(k)\r\nif(p-k>1):\r\n print('<<',end=' ')\r\n p1=p-k\r\nelse:\r\n p1=1\r\nq=min(n,p+k)\r\nwhile(p1<=q):\r\n if(p1==p):\r\n print('(',p,')',sep='',end=' ')\r\n else:\r\n print(p1,end=' ')\r\n p1+=1\r\nif(q<n):\r\n print('>>',end='')", "n,p,k = map(int,input().split())\r\ns = \"\"\r\nif p-k > 1 :\r\n s = s + \"<<\"\r\n\r\nfor i in range(p-k,p+k+1):\r\n if i > 0 and i <= n:\r\n s = s+ \" \"\r\n if i == p:\r\n s = s + \"(\"+str(i) + \")\"\r\n continue\r\n \r\n s = s +str(i)\r\nif p+k < n:\r\n s= s + \" >>\"\r\n \r\nprint(s)", "n, current_page, k = input().split()\r\nn, current_page, k = int(n), int(current_page), int(k)\r\ns = \"\"\r\n\r\ni = current_page - k\r\njump = 2*k+1\r\n\r\nif i <=0:\r\n jump -= abs(i)+1\r\n i = 1\r\n\r\nif current_page == 1:\r\n jump = k+1\r\n\r\nif i != 1:\r\n s += \"<< \"\r\n\r\nfor j in range(i, i+jump):\r\n if j == current_page:\r\n s += \"(\" + str(j) + \")\"\r\n else:\r\n s += str(j)\r\n\r\n if j == n:\r\n break\r\n\r\n if j != i+jump-1:\r\n s+=\" \"\r\n\r\n\r\nif j < n:\r\n s += \" >>\"\r\n\r\nprint(s)", "n, p, k = map(int, input().split())\r\nif not (p - k <= 1):\r\n print(\"<<\", end=' ')\r\nfor i in range(p - k, p):\r\n if i >= 1:\r\n print(i, end=' ')\r\nprint(f'({p})', end=' ')\r\nfor i in range(p + 1, p + k + 1):\r\n if i <= n:\r\n print(i, end=' ')\r\n \r\nif not (p + k >= n):\r\n print(\">>\", end='')\r\nprint()", "n,p,k=map(int,input().split())\r\na='('+str(p)+')'\r\ni=p+1\r\nwhile (i<=p+k) and (i<=n):\r\n a+=' '+str(i)\r\n i+=1\r\nif i-1!=n:\r\n a+=' >>'\r\ni=p-1\r\nwhile (p-k<=i) and (1<=i):\r\n a=str(i)+' '+a\r\n i-=1\r\nif i+1!=1:\r\n a='<< '+a\r\nprint(a)", "n, p, k = list(map(int, input().split()))\r\n\r\nl = [\"(\" + str(p) + \")\"]\r\ni = 1\r\nfor _ in range(k):\r\n if p - i > 0:\r\n l = [p - i] + l\r\n if p + i <= n:\r\n l.append(p + i)\r\n i += 1\r\n\r\nif p - k > 1:\r\n l = [\"<<\"] + l\r\nif n - p > k:\r\n l.append(\">>\")\r\nprint(*l)\r\n", "n,p,k = map(int,input().split())\nstart = True\nend = True\nif p - k <= 1:\n\tstart = False\n\nif p + k >= n:\n\tend = False\nif start:\n\tprint(\"<< \",end='')\n\nfor i in range(p-k,p):\n\tif i >=1:\n\t\tprint(str(i)+\" \",end='')\n\nprint(\"(\"+str(p)+\") \",end='')\n\nfor j in range(p+1,p+k+1):\n\tif j > n:\n\t\tbreak\n\tprint(str(j)+\" \",end='')\n\nif end:\n\tprint(\">>\",end='')", "a = list(map(int,input().split()))\r\npages,current,wide = a[0],a[1],a[2]\r\nmid = '('+str(current)+')'\r\nstart,end= current-wide,current+wide\r\nprefix,suffix = '',''\r\nif start < 2:\r\n prefix = (\" \".join([str(i) for i in range(1,current)])).rstrip()\r\nelse:\r\n prefix = (\"<< \" +\" \".join([str(i) for i in range(start,current)])).rstrip()\r\nif end >= pages:\r\n suffix = (\" \".join([str(i) for i in range(current+1,pages+1)])).rstrip()\r\nelse:\r\n suffix = (\" \".join([str(i) for i in range(current+1,end+1)])+\" >>\").rstrip()\r\nif prefix == '' and suffix=='':\r\n print(mid)\r\nelif prefix == '':\r\n print(mid,suffix)\r\nelif suffix == '':\r\n print(prefix,mid)\r\nelse:\r\n print(prefix,mid,suffix)", "n , p , k = map(int , input().split())\r\nx = p - k\r\ny = p + k\r\ns = \"\"\r\nif x < 1:\r\n x = 1\r\nif y > n:\r\n y = n\r\nif x != 1:\r\n s += \"<< \"\r\nfor i in range(x , y + 1):\r\n if i == p:\r\n s += \"(\" + str(i) + \") \"\r\n elif i == y:\r\n s += str(i)\r\n else:\r\n s+= str(i) + \" \"\r\nif y != n:\r\n s += \" >>\"\r\nprint(s)\r\n", "n,p,k=map(int,input().split())\r\n\r\ns=p-k\r\ne=p+k\r\n\r\nif s<1:\r\n s=1\r\nif e>n:\r\n e=n\r\n\r\nif s!=1:\r\n print('<<',end=' ',sep=' ')\r\n\r\nfor x in range(s,e+1):\r\n if p==x:\r\n print('('+str(p)+')',end=' ',sep=' ')\r\n continue\r\n print(x,end=' ',sep=' ')\r\n\r\nif e!=n:\r\n print('>>',end=' ',sep=' ')\r\n", "s = str(input())\r\nnpk = list(s.split(' '))\r\n\r\n\r\nn = int(npk[0])\r\np = int(npk[1])\r\nk = int(npk[2])\r\n\r\nif(n>=p):\r\n if((p-k)>1):\r\n print(\"<< \", end = \"\")\r\n \r\n for i in range(max(1, p-k), min(n, p+k) + 1):\r\n if(i==p):\r\n print(\"(\" + str(p) + \") \", end = \"\")\r\n else:\r\n print(str(i) + \" \", end = \"\")\r\n \r\n if((p+k)<n):\r\n print(\">>\", end = \"\")", "import math\r\nn,p,k=map(int,input().split())\r\nif p-k>1:\r\n\tprint(\"<<\",end=\" \")\r\nif p-k>1:\r\n\ta=p-k\r\nelse:\r\n\ta=1\t\r\nfor i in range(a,p):\r\n\tprint(i,end=\" \")\r\nprint(\"(\"+str(p)+\")\",end=\" \")\r\nif p+k>n:\r\n\ta=n+1\r\nelse:\r\n\ta=p+k+1\r\nfor i in range(p+1,a):\r\n\tprint(i,end=\" \")\r\nif p+k<n:\r\n\tprint(\">>\")", "a=[int(i) for i in input().split(\" \")]\r\nn=a[0]\r\np=a[1]\r\nk=a[2]\r\ns=[]\r\na=range(max(1,p-k),min(n+1,p+k+1))\r\nfor i in a:\r\n if(i!=p):\r\n s.append(str(i))\r\n else:\r\n s.append('('+str(i)+')')\r\nif(s[0]!='1' and s[0]!='(1)'):\r\n s[0]='<< '+s[0]\r\nif(s[-1]!=str(n) and s[-1]!='('+str(n)+')'):\r\n s[-1]=s[-1]+' >>'\r\nprint(\" \".join(s))", "entrada=input()\r\nnumbers=entrada.split()\r\nn=int(numbers[0])\r\np=int(numbers[1])\r\nk=int(numbers[2])\r\nif p+k>=n and p-k<=1:\r\n for i in range (1, n+1):\r\n if i==p:\r\n print(\"(\" + str(p) + \")\", end=\" \")\r\n else:\r\n print(i,end=\" \")\r\nif p+k>=n and p-k>1:\r\n print(\"<<\", end=\" \")\r\n for i in range (p-k, n+1):\r\n if i==p:\r\n print(\"(\" + str(p) + \")\", end=\" \")\r\n else:\r\n print(i,end=\" \")\r\nif p+k<n and p-k<=1:\r\n for i in range (1, p+k+1):\r\n if i==p:\r\n print(\"(\" + str(p) + \")\", end=\" \")\r\n else:\r\n print(i,end=\" \")\r\n print(\">>\")\r\nif p+k<n and p-k>1:\r\n print(\"<<\", end=\" \")\r\n for i in range (p-k, p+k+1):\r\n if i==p:\r\n print(\"(\" + str(p) + \")\", end=\" \")\r\n else:\r\n print(i,end=\" \")\r\n print(\">>\")", "n, p, k = map(int, input().split())\n\nif p-k > 1:\n print(\"<< \", end=\"\")\n\nfor i in range(p-k, p + k + 1):\n if i < 1 or i > n:\n continue\n if i == p:\n print(\"(\", p, \") \", sep=\"\", end=\"\")\n else:\n print(i, \"\", end=\"\")\n\nif p+k < n:\n print(\">>\")\nelse:\n print()\n", "n,p,k = map(int,input().split())\r\nout = []\r\nif p==1 and p+k<n:\r\n out.append('(1)')\r\n for i in range(1,k+1):\r\n out.append(str(1+i))\r\n out.append(\">>\")\r\n\r\nelif p==1 and p+k>=n:\r\n out.append(\"(1)\")\r\n for i in range(1,n):\r\n out.append(str(i+1))\r\n\r\nelif p==n and p-k>1:\r\n out.append('<<')\r\n for i in range(k,0,-1):\r\n out.append(str(n-i))\r\n out.append('('+str(n)+')')\r\n\r\nelif p==n and p-k<=1:\r\n for i in range(1,n):\r\n out.append(str(i))\r\n out.append('('+str(n)+')')\r\n\r\nelse:\r\n if p+k<n and p-k>1:\r\n out.append('<<')\r\n for i in range(p-k,p):\r\n out.append(str(i))\r\n out.append('('+str(p)+')')\r\n for i in range(p+1,p+k+1):\r\n out.append(str(i))\r\n out.append('>>')\r\n\r\n elif p+k<n and p-k<=1:\r\n for i in range(1,p):\r\n out.append(str(i))\r\n out.append('('+str(p)+')')\r\n for i in range(p+1,p+k+1):\r\n out.append(str(i))\r\n out.append('>>')\r\n\r\n elif p+k>=n and p-k>1:\r\n out.append('<<')\r\n for i in range(p-k,p):\r\n out.append(str(i))\r\n out.append('('+str(p)+')')\r\n for i in range(p+1,n+1):\r\n out.append(str(i))\r\n\r\n else:\r\n for i in range(1,p):\r\n out.append(str(i))\r\n out.append('('+str(p)+')')\r\n for i in range(p+1,n+1):\r\n out.append(str(i))\r\n\r\nprint(*out)", "x = list(map(int,input().split()))\nn = int(x[0])\np = int(x[1])\nk = int(x[2])\nst = \"\"\nif(p-k >= 1):\n if(p-k != 1):\n st += \"<<\"+\" \"\n for i in range(p-k,p):\n st += str(i)+\" \"\nelse:\n for i in range(1,p):\n st += str(i)+\" \"\nst += \"(\"+str(p)+\")\"+\" \"\nif(p+k >= n):\n for i in range(p+1,n+1):\n st += str(i)+\" \"\nelse:\n for i in range(p+1,p+k+1):\n st += str(i) +\" \"\n st += \">>\"\nprint(st)\n", "n, p, k = map(int, input().split())\r\nprint(\"{} {} ({}) {} {}\".format(\"<<\" if p - k > 1 else \"\", \\\r\n \" \".join(map(str, range(max(1, p - k), p))), p,\r\n \" \".join(map(str, range(p + 1, min(n, p + k) + 1))),\r\n \">>\" if p + k < n else \"\").strip())", "n,p,k=map(int,input().split())\r\nleft,right=False,False\r\nminn,maxx=None,None\r\nif p-k<1:\r\n left=True\r\n minn=1\r\nelse:\r\n minn=p-k\r\nif p+k>n:\r\n right=True\r\n maxx=n\r\nelse:\r\n maxx=p+k\r\nif left==False and minn!=1:\r\n print(\"<<\",end=\" \")\r\nfor i in range(minn,maxx+1):\r\n if i!=p:\r\n print(i,end=\" \")\r\n else:\r\n print(\"(\",end=\"\")\r\n print(i,end=\"\")\r\n print(\")\",end=\" \")\r\nif right==False and maxx!=n:\r\n print(\">>\")\r\n", "n,p,k=[int(y) for y in input().split()]\n\nif p+k>=n:\n er=n+1\nelse:\n er=p+k+1\n\nif p-k<=1:\n sr=1\nelse:\n sr=p-k\nif p+k>=n and p-k<=1:\n for z in range(sr,er):\n if z==p:\n print(\"(\"+str(p)+\")\",end=' ')\n else:\n print(z,end=' ')\nif p+k>=n and p-k>1:\n print(\"<<\",end=' ')\n for z in range(sr,er):\n if z==p:\n print(\"(\"+str(p)+\")\",end=' ')\n else:\n print(z,end=' ')\nif p+k<n and p-k<=1:\n for z in range(sr,er):\n if z==p:\n print(\"(\"+str(p)+\")\",end=' ')\n else:\n print(z,end=' ')\n print(\">>\",' ')\nif p+k<n and p-k>1:\n print(\"<<\",end=' ')\n for z in range(sr,er):\n if z==p:\n print(\"(\"+str(p)+\")\",end=' ')\n else:\n print(z,end=' ')\n print(\">>\",' ')\n", "n, p, k = map(int, input().split())\r\nnums = [num for num in range(p - k, p + k + 1)]\r\nans = \"\"\r\nfor i in range(len(nums)):\r\n if n >= nums[i] > 0:\r\n if nums[i] == p:\r\n ans += \"(\" + str(nums[i]) + \")\"\r\n else:\r\n ans += str(nums[i])\r\n if i != len(nums) - 1:\r\n ans += \" \"\r\n# print(ans)\r\nif nums[0] > 1:\r\n ans = \"<< \" + ans\r\nif nums[-1] < n:\r\n ans += \" >>\"\r\nprint(ans)\r\n", "n, p, k = map(int, input().split())\r\nback = []\r\nfor i in range(p - 1, max(p - k - 1, 0), -1):\r\n back.append(i)\r\nif len(back) > 0 and back[-1] > 1:\r\n back.append(\"<<\")\r\nback = back[::-1]\r\nforward = []\r\nfor i in range(p + 1, min(p + k + 1, n + 1)):\r\n forward.append(i)\r\nif len(forward) > 0 and forward[-1] < n:\r\n forward.append(\">>\")\r\nprint(\"%s (%d) %s\" % (\" \".join(map(str, back)), p, \" \".join(map(str, forward))))\r\n", "n,p,k = map(int, input().split())\r\n\r\nif p-k > 1 :\r\n first = p - k\r\nelse :\r\n first = 1\r\n\r\nif p+k <= n :\r\n last = p + k\r\nelse :\r\n last = n\r\n \r\nif not first == 1:\r\n print(\"<<\", end=\" \")\r\n \r\nfor i in range(first, last+1):\r\n if i == p:\r\n print(\"(\"+str(p)+\")\", end=\" \")\r\n else:\r\n print(i, end=\" \")\r\n\r\nif not last == n:\r\n print(\" >>\")", "\r\n\r\nn, p, k = list(map(int, input().split(' ')))\r\n\r\nans = ''\r\nif p - k > 1:\r\n ans += '<< '\r\n for i in range(p - k, p):\r\n ans += str(i)\r\n ans += ' '\r\nelse: \r\n for i in range(1, p):\r\n ans += str(i)\r\n ans += ' '\r\nans += '(' + str(p) + ') '\r\n\r\nfor i in range(p + 1, p+ k + 1):\r\n if (i <= n):\r\n ans += str(i) + ' ' \r\n else:\r\n break\r\n\r\nif (p + k < n):\r\n ans += '>>'\r\n\r\nprint(ans)\r\n", "#!/usr/bin/env python\r\n# -*- coding: utf-8 -*-\r\nn, p, k = [int(i) for i in input().strip().split()]\r\nresult = range(p-k, p+k+1)\r\n\r\nresult = [i for i in result if i in range(1, n+1)]\r\n\r\nfor i in result:\r\n\tif (0 < i <= n):\r\n\t\tcontinue\r\nif(1 not in result):\r\n\tresult.insert(0, \"<<\")\r\nif(n not in result):\r\n\tresult.append(\">>\")\t\r\nresult[result.index(p)] = \"(\" + str(p) + \")\"\r\nfor i in result:\r\n\tprint(i ,\"\", end = \"\")\r\n", "n, p, k = list(int(a) for a in input().split())\nl = max(p-k, 1)\nr = min(p+k, n)\nif l != 1:\n print(\"<< \", end='')\nwhile l < p:\n print(l, end=' ')\n l += 1\nprint('(', p, ')', sep='', end=' ')\nl += 1\nwhile l <= r:\n print(l, end=' ')\n l += 1\nif r != n:\n print(\">>\", end='')\nprint()", "n, p, k = tuple(map(int, input().split()))[:]\r\n\r\nif p < 1 or p > n:\r\n exit()\r\nnavigation_bar = [i for i in range(max(1, p - k), min(p + k, n) + 1)]\r\n\r\nif 1 not in navigation_bar:\r\n navigation_bar.insert(0, '<<')\r\n\r\nif n not in navigation_bar:\r\n navigation_bar.append('>>')\r\n\r\nfor i in navigation_bar:\r\n if i == p:\r\n print('(', end='')\r\n print(i, end='')\r\n print(')', end=' ')\r\n elif i == navigation_bar[-1]:\r\n print(i)\r\n else:\r\n print(i, end=' ')\r\n", "no_page, present_page, display_range = map(int, input().split())\r\nif(present_page - display_range <= 1):\r\n starting_page = 1\r\nelse:\r\n starting_page = present_page - display_range\r\nif(present_page + display_range >= no_page):\r\n ending_page = no_page\r\nelse:\r\n ending_page = present_page + display_range\r\nfor i in range(starting_page, ending_page + 1, +1):\r\n if(i == present_page):\r\n print(\"(\"+str(i)+\")\", end = \" \"),\r\n elif(i == 1):\r\n print(i, end = \" \"),\r\n elif(i == starting_page and starting_page > 1):\r\n print(\"<<\", i, end = \" \"),\r\n elif(i == ending_page and ending_page == no_page):\r\n print(i),\r\n elif(i == ending_page and ending_page != no_page):\r\n print(i, \">>\", end = \" \"),\r\n else:\r\n print(i, end = \" \"),", "n, p, k = map(int, input().split())\r\ntext = \"\"\r\nif p - k > 1:\r\n text = \"<< \"\r\n start = p - k\r\nelse:\r\n start = 1\r\n\r\nif p + k < n:\r\n end = p + k\r\nelse:\r\n end = n\r\n\r\nfor i in range(start, p):\r\n text += str(i) + \" \"\r\n\r\ntext += \"(\" + str(p) + \")\"\r\n\r\nfor i in range(p + 1, end + 1):\r\n text += \" \" + str(i)\r\n\r\nif end != n:\r\n text += \" >>\"\r\n\r\nprint(text)", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Tue Dec 3 11:21:28 2019\r\n\r\n@author: CronuS\r\n\"\"\"\r\n\r\ns = list(map(int, input().split()))\r\nn = s[0]; p = s[1]; k = s[2]\r\ns = '(' + str(p) + ')'\r\nfor i in range(min(k, p - 1)):\r\n s = str(p - 1 - i) + ' ' + s\r\nfor i in range(min(k, n - p)):\r\n s = s + ' ' + str(p + 1 + i)\r\nif (p - 1 > k):\r\n s = '<< ' + s\r\nif (n - p > k):\r\n s = s + ' >>'\r\nprint(s)", "n, p, k = map(int, input().split())\r\n\r\ns = ''\r\nl = p - k\r\nr = p + k\r\nif l > 1:\r\n s += '<< '\r\nelse:\r\n l = 1\r\nif r >= n:\r\n r = n\r\nfor i in range(l, r + 1):\r\n if i == p:\r\n s +='(' + str(p) + ') '\r\n else:\r\n s += str(i) + ' '\r\nif p + k < n:\r\n s += '>>'\r\nprint(s)", "q=lambda:map(int,input().split())\r\nn,p,k=q()\r\na=[int(i) for i in range(p-k,p+k+1) if n>=int(i)>0]\r\n\r\nif a[0]!=1: print('<< ',end='')\r\nfor i in a:\r\n if i==p: print('('+str(i)+') ',end='')\r\n else: print(str(i)+' ',end='') \r\nif a[-1]!=n: print('>>',end='')", "string = input()\r\nl = string.split(\" \")\r\nn1,n2,n3 = int(l[0]),int(l[1]),int(l[2])\r\nl = []\r\nfor i in range(n2-n3,n2+n3+1):\r\n\tif i>0 and i<=n1:\r\n\t\tl.append(i)\r\n\r\nstring = \"\"\r\nfor i in l:\r\n\tif i==n2:\r\n\t\tstring += \"(\"+str(i)+\") \"\r\n\telse:\r\n\t\tstring += str(i)+\" \"\r\n\r\nstring = string[:-1]\r\nif l[0]!=1:\r\n\tstring = \"<< \"+string\r\nif l[-1]!=n1:\r\n\tstring = string + \" >>\"\r\nprint(string)", "a=input().split()\r\nn=int(a[0])\r\np=int(a[1])\r\nk=int(a[2])\r\ns=''\r\nif (p-k)>1:\r\n s='<<'\r\nfor i in reversed(range(1,k+1)):\r\n if (p-i)>=1:\r\n s=s+f' {p-i}'\r\ns=s+f' ({p})'\r\nfor i in range(1, k+1):\r\n if (p+i)<=n:\r\n s=s+f' {p+i}'\r\nif n-(p+k)>0:\r\n s=s+f' >>'\r\nprint(s)", "n, p, k = map(int, input().split())\r\nif (p-k)<=1:\r\n start=1\r\nelse:\r\n start=p-k\r\nif (p+k)>=n:\r\n end=n\r\nelse:\r\n end=p+k\r\nif start>1:\r\n print('<<', end=' ')\r\nfor i in range(start, end+1):\r\n if i==p:\r\n print('('+str(p)+')', end=' ')\r\n else:\r\n print(i, end=' ')\r\nif end<n:\r\n print('>>')\r\n", "string_input = input()\r\nstring_input = list(map(int,string_input.split(' ')))\r\nn = string_input[0]\r\np = string_input[1]\r\nk = string_input[2]\r\nleft = True\r\nright = True\r\nif p - k <= 1:\r\n left = False\r\nif p + k >= n:\r\n right = False\r\noutput = [str(x) if x!=p else '('+str(x)+')' for x in range(p-k,p+k+1) if (x >= 1 and x <=n)]\r\noutput = ' '.join(output)\r\nif left:\r\n output = '<< '+ output\r\nif right:\r\n output = output + ' >>'\r\nprint(output)\r\n", "n, p, k = map(int, input().strip().split())\n\ni = max(1, p - k)\n\nanswer = []\nif i != 1:\n answer.append('<<')\n\nwhile i <= min(p + k, n):\n if i == p:\n answer.append(f'({p})')\n else:\n answer.append(i)\n i += 1\n\nif p + k < n:\n answer.append('>>')\n\nprint(*answer)\n", "all, current, distance = [int(i) for i in input().split()]\r\nif current > 1 + distance:\r\n print(\"<<\", end=\" \")\r\nfor i in range(current - distance, current + distance + 1):\r\n if i == current:\r\n print(f\"({i})\", end=\" \")\r\n elif i > 0 and i <= all:\r\n print(i, end=\" \")\r\nif current < all - distance:\r\n print(\">>\")", "def funny(n,p,k):\n a=p-k if p-k > 0 else 1\n b=p+k if p+k < n else n\n s=\"\"\n if a!=1:\n s=\"<< \"\n for i in range(a,b+1):\n #print(s, b+1, i)\n if i==p:\n s+=\"(\"+str(p)+\")\"\n else :\n s+=str(i)\n s+=\" \"\n if b!=n :\n s+=\" >>\"\n return s\n\nx=list(map(int, input().split()))\nprint(funny(x[0],x[1],x[2]))", "\ndef create_navigation(n, p, k):\n res = [str(x) for x in range(p-k,p+k+1,1) if x <= n and x >= 1]\n\n if res[-1] != str(n):\n res.append('>>')\n\n if res[0] != \"1\":\n res[res.index(str(p))] = \"(\" + str(p) + \")\"\n return \"<< \"+ \" \".join(res)\n else:\n res[res.index(str(p))] = \"(\" + str(p) + \")\"\n return \" \".join(res)\n\n\nn,p,k = input().split()\nprint(create_navigation(int(n),int(p),int(k)))", "n, p, k = map(int, input().split())\r\n\r\nif p - k > 1:\r\n print(\"<<\", end=\" \")\r\n\r\nfor i in range(max(1, p-k), min(p+k+1, n+1)):\r\n if i == p:\r\n print(\"({})\".format(i), end=\" \")\r\n else:\r\n print(i, end=\" \")\r\n\r\nif p + k < n:\r\n print(\">>\", end=\" \")\r\n", "n, p, k = map(int, input().split())\n\nif p == 1:\n if p + k <= n:\n print('(1)', end=\" \")\n for i in range(1, k + 1):\n if (i + 1 <= n):\n print(i + 1, end=\" \")\n if (p + k < n):\n print('>>')\n else:\n print('(1)', end=\" \")\n for i in range(1, n):\n if (i + 1 <= n):\n print(i + 1, end=\" \")\nelif p == n:\n if (p - k > 1):\n print('<<', end=\" \")\n for i in range(p - k, p):\n if (i >= 1):\n print(i, end=\" \")\n print('(', n, ')', sep=\"\") \nelse:\n if (p - k > 1):\n print('<<', end=\" \")\n for i in range(p - k, p):\n if (i >= 1):\n print(i, end=\" \")\n print('(', p, ')', sep=\"\", end=\" \")\n for i in range(p, p + k):\n if (i + 1 <= n):\n print(i + 1, end=\" \")\n if (p + k < n):\n print('>>')\n", "\ndef Print(num, n):\n\tif num > 0 and num <= n:\n\t\tprint(num, end=' ')\n\ndef main():\n\t_input = list(map(int, input().split()))\n\tn, p, k = _input[0], _input[1], _input[2]\n\tif p - k > 1:\n\t\tprint('<< ', end=' ')\n\tfor page in range(p - k, p):\n\t\tPrint(page, n)\n\tprint('('+str(p)+') ', end='')\n\tfor page in range(p+1, p+k+1):\n\t\tPrint(page, n)\n\tif p + k < n:\n\t\tprint('>> ')\n\n\nif __name__ == '__main__':\n\tmain()", "n,p,k=map(int,input().split())\r\ns=''\r\nif p-k>1:\r\n s+='<< '\r\n for i in range(p-k,p):\r\n s=s+str(i)+' '\r\n s=s+'('+str(p)+') '\r\nelse:\r\n \r\n for i in range(1,p+1):\r\n if i==p:\r\n s=s+'('+str(p)+') '\r\n else:\r\n s=s+str(i)+' '\r\nif p+k<n:\r\n \r\n for i in range(p+1,p+k+1):\r\n s=s+str(i)+' '\r\n s+='>>'\r\nelse:\r\n for i in range(p+1,n+1):\r\n s=s+str(i)+' '\r\nprint(s)\r\n ", "n, p, k = list(map(int, input().split()))\r\nstart, end = max(1, p-k), min(n, p+k)\r\nif start != 1:\r\n print(\"<<\", end=\" \")\r\nfor i in range(start, p):\r\n print(i, end=\" \")\r\nprint(f\"({p})\", end=\" \")\r\nfor i in range(p+1, end + 1):\r\n print(i, end=\" \")\r\nif end != n:\r\n print(\">>\", end=\" \")\r\n ", "pages,curpage,nav= [int(x) for x in input().split(' ')]\r\nanswer=f'({curpage})'\r\nfor i in range(1,nav+1):\r\n if curpage - i > 0:\r\n answer =f'{curpage-i} {answer}'\r\n if curpage + i <=pages:\r\n answer=f'{answer} {curpage+i}'\r\nif curpage-nav > 1:\r\n answer = f'<< {answer}'\r\nif curpage+nav < pages:\r\n answer = f'{answer} >>'\r\nprint(answer)", "(n, p, k) = map(int, input().split())\n\nrightArrow = \">>\"\nleftArrow = \"<< \"\n\ns = \"\"\nstartingIndex = 0\nendingIndex = 0\n\nif(p - k <= 1):\n startingIndex = 1\nelse:\n startingIndex = p-k\n s += leftArrow\n\nif(p+k >= n):\n endingIndex = n\nelse:\n endingIndex = p+k\n\nfor i in range(startingIndex, endingIndex + 1):\n if(i is p):\n s += \"(\"+str(i)+\") \"\n else: \n s += str(i) + \" \"\nif(p+k < n):\n s += rightArrow\nprint(s)", "n,p,k = (map(lambda x: int(x),input().split()))\r\nif p-k > 1:\r\n a = '<<'\r\nelse:\r\n a=''\r\nb = ' '.join(map(lambda x: str(x),[i for i in range(p-k,p) if i>=1]))\r\nd = ' '.join(map(lambda x: str(x),[i for i in range(p+1,p+k+1) if i<=n]))\r\nif p+k < n:\r\n e = '>>'\r\nelse:\r\n e = ''\r\np = str(p)\r\n\r\nprint('{0} {1} ({2}) {3} {4}'.format(a,b,p,d,e))", "def pages(n,p,k):\r\n output = \"\"\r\n\r\n if p<1 or p>n :\r\n return output\r\n if p-k > 1 :\r\n output += \"<< \"\r\n for i in range(p-k, p+k+1):\r\n if i <= n and i >= 1:\r\n if i == p:\r\n output += \"(\" + str(i) + \") \"\r\n else:\r\n output += str(i) + \" \"\r\n\r\n if p+k < n:\r\n output += \">>\"\r\n\r\n return output\r\n\r\nn,p,k = map(int, input().split())\r\nprint(pages(n, p, k))", "array = input().split()\r\narray = list(map(lambda x: int(x) if x.isdigit() else 0, array))\r\nl = 0\r\nh = 0\r\nif(array[1]+array[2]>=array[0]):\r\n h = array[0]\r\nelse:\r\n h=array[1]+array[2]\r\nif(array[1]-array[2]<=1):\r\n l=1\r\nelse:\r\n l=array[1]-array[2]\r\nif(array[1]-array[2] > 1 ):\r\n print(\"<<\",end=' ')\r\nfor i in range(l,h+1):\r\n if(i==array[1]):\r\n print('(',end='')\r\n print(i,end='')\r\n print(')',end = ' ')\r\n else:\r\n print(i,end=' ')\r\nif(array[1]+array[2]<array[0]):\r\n print(\">>\",end=' ')", "n,p,k=map(int,input().split())\ns=\"\"\nq=0\nfor i in range(p-k,p+k+1,1):\n if(i<1 or i>n):\n continue\n if(i==1):\n if i==p:\n s+=\"(1)\"+\" \"\n continue\n else:\n s+=\"1\"+\" \"\n continue\n elif(i==n):\n if i==p:\n s+=\"(\"+str(n)+\")\"\n break\n else:\n s+=str(n)\n break\n if i==(p-k):\n s+=\"<< \"\n\n if(i==p):\n s += \"(\" + str(i) + \") \"\n else:\n s += str(i)+\" \"\n if i == (p + k):\n s += \">>\"\nprint(s)\n \t\t\t\t \t\t \t \t \t\t \t\t\t\t\t\t \t \t", "n, p, k = [int(x) for x in input().split()]\nleft = p - k\nright = p + k\nleft = max(left, 1)\nif left != 1:\n print(\"<< \", end=\"\")\nright = min(right, n)\nfor i in range(left, p):\n print(i, end=\" \")\nprint('({0})'.format(p), end=\" \")\nfor i in range(p+1, right+1):\n print(i, end=\" \")\nif right != n:\n print(\">>\")\n\n", "def main():\r\n n, p, k = map(int, input().split())\r\n start = 1\r\n end = 0 + n\r\n addEnd = False\r\n f, e, o = '<<', '>>', f'({p})'\r\n r = []\r\n if p - k > start:\r\n start = p - k\r\n r.append(f)\r\n if p + k < end:\r\n end = p+k\r\n addEnd = True\r\n for i in range(start, end+1):\r\n if i == p:\r\n r.append(o)\r\n else:\r\n r.append(str(i))\r\n if addEnd:\r\n r.append(e)\r\n return ' '.join(r)\r\n\r\nprint(main())\r\n", "n, c, e = map(int, input().split())\n\nprefix = \" \".join(map(str, range(max(1, c - e), c)))\nsuffix = \" \".join(map(str, range(c + 1, min(n + 1, c + e + 1))))\n\nprint(\"{}{}({}){}{}\".format(\"<< \" if c - e > 1 else \"\",\n prefix + \" \" if prefix != \"\" else \"\", c, \" \" + suffix if suffix != \"\" else \"\", \" >>\" if c + e < n else \"\"))\n", "(n,p,k) = [int(i) for i in input().strip().split(' ')]\r\nif p-k > 1:\r\n print('<<', end=' ')\r\nfor i in range(p-k, p+k+1):\r\n if i < 1: continue\r\n if i > n: continue\r\n if i == p:\r\n print('(' + str(i) + ')', end=' ')\r\n else:\r\n print(i, end=' ')\r\nif p+k < n:\r\n print('>>', end=' ')\r\nprint('')\r\n", "n=list(map(int, input().strip().split()))\r\nif(n[1]-n[2]>1):\r\n print(\"<<\",end=' ')\r\nfor i in range(n[1]-n[2],n[1]+n[2]+1):\r\n if(i<1):\r\n continue\r\n if(i>n[0]):\r\n break\r\n else:\r\n if(i==n[1]):\r\n \r\n print(\"(\"+str(i)+\")\", end='')\r\n print(end=' ')\r\n continue\r\n print(i,end=' ')\r\nif(n[1]+n[2]<n[0]):\r\n print(\">>\", end=' ')\r\n", "s = list(map(int, input().split(' ')))\r\nar = []\r\nif s[1] - s[2] > 1:\r\n ar.append('<<')\r\n for i in range(0, s[2]):\r\n ar.append(s[1]-s[2]+i)\r\n ar.append('({})'.format(s[1]))\r\n if s[0]-s[1] > s[2]:\r\n for i in range(0, s[2]):\r\n ar.append(s[1]+i+1)\r\n ar.append(('>>'))\r\n else:\r\n for i in range(0, s[0] - s[1]):\r\n ar.append(s[1]+i+1)\r\nelif s[1] - s[2] == 1:\r\n for i in range(0, s[2]):\r\n ar.append(s[1]-s[2]+i)\r\n ar.append('({})'.format(s[1]))\r\n if s[0]-s[1] > s[2]:\r\n for i in range(0, s[2]):\r\n ar.append(s[1]+i+1)\r\n ar.append(('>>'))\r\n else:\r\n for i in range(0, s[0]-s[1]):\r\n ar.append(s[1]+i+1)\r\nelse:\r\n for i in range(0, s[2]):\r\n if s[1] - s[2] + i > 0:\r\n ar.append(s[1]-s[2]+i)\r\n ar.append('({})'.format(s[1]))\r\n if s[0]-s[1] > s[2]:\r\n for i in range(0, s[2]):\r\n ar.append(s[1]+i+1)\r\n ar.append(('>>'))\r\n else:\r\n for i in range(0, s[0]-s[1]):\r\n ar.append(s[1]+i+1)\r\nprint(*ar, sep=' ')\r\n", "#2/4/19\r\n#399A\r\n#BlueyNeilo\r\n\r\n[n,p,k]=list(map(int,input().split()))\r\n\r\nnav = []\r\n\r\nlow = 1 if (p-k<1) else p-k\r\nhigh = n if (p+k>n) else p+k\r\n\r\nif p>k+1:\r\n nav+=['<<']\r\n\r\nnav+=[*list(range(low,p))]\r\nnav+=['('+str(p)+')']\r\nnav+=[*list(range(p+1,high+1))]\r\n\r\nif p<n-k:\r\n nav+=['>>']\r\n\r\nprint(*nav)", "n, p, k = map(int, input().split())\r\n\r\n\r\ndef selectPages():\r\n menuNums = []\r\n for i in range(k + 1):\r\n if p - i < 1:\r\n break\r\n menuNums.insert(0, p - i)\r\n for i in range(p + 1, k + p + 1):\r\n if i > n:\r\n break\r\n menuNums.append(i)\r\n return menuNums\r\n\r\n\r\ndef navigate(array):\r\n menu = \"\"\r\n if p - k > 1:\r\n menu += \"<<\"\r\n for x in array:\r\n if x == p:\r\n menu += \" (\" + str(x) + \")\"\r\n else:\r\n menu += \" \" + str(x)\r\n if p + k < n:\r\n menu += \" >>\"\r\n return menu.lstrip()\r\n\r\n\r\nprint(navigate(selectPages()))\r\n", "def pn(s): print(s,end='')\r\n\r\ndef main():\r\n n,p,k = map(int ,input().split())\r\n if p - k < 1:\r\n r = range(1, p)\r\n else:\r\n r = range(p-k,p)\r\n if p - k - 1 >= 1:\r\n pn('<< ')\r\n for i in r:\r\n pn(str(i) + ' ')\r\n pn('('+str(p)+')')\r\n if p + k > n:\r\n r = range(p+1, n+1)\r\n else:\r\n r = range(p+1,p+k+1)\r\n for i in r:\r\n pn(' ' + str(i))\r\n if p + k + 1 <= n:\r\n pn(' >>')\r\n pn('\\n')\r\n\r\nif __name__ == '__main__':\r\n # while True:\r\n main()\r\n\r\n\r\n\r\n\r\n\r\n", "# Input Operation\r\nn, p, k = list(map(int, input().split()))\r\n\r\n# OutPut Operation\r\npage = []\r\nif p-k > 1:\r\n page.append(\"<<\")\r\nfor i in range(max((p-k), 1), min((p+k), n)+1):\r\n if i == p:\r\n page.append(\"(\"+str(p)+\")\")\r\n else:\r\n page.append(str(i))\r\n\r\nif p+k < n:\r\n page.append(\">>\")\r\n\r\nprint(\" \".join(page))\r\n", "n,p,k=map(int,input().split())\nif p - k > 1:\n\tprint('<< ', end = '')\nprint(' '.join('('+str(p)+')' if i == p else str(i) for i in filter(lambda x: 0 < x <= n, range(p - k, p + k + 1))), end = '')\nprint(' >>' if p + k < n else '')", "n, p, k = map(int, input().split())\r\ns = [i for i in range(p - k, p + k + 1) if (i > 0 and i <= n)]\r\nans = ''\r\nfor x in s:\r\n if x == p:\r\n ans += ' (' + str(x) + ')'\r\n else:\r\n ans += ' ' + str(x)\r\nans = ans.lstrip()\r\nif s[0] != 1:\r\n ans = ans[::-1]\r\n ans += ' <<'\r\n ans = ans[::-1]\r\nif s[-1] != n:\r\n ans += ' >>'\r\nprint(ans)\r\n", "n,p,k = map(int,input().split())\r\n\r\nif p-k>1:\r\n print (\"<<\",end = \" \")\r\n\r\nfor i in range(p-k,p):\r\n if i<=0: \r\n continue\r\n print(i,end = \" \")\r\n\r\nprint (\"(\",end = \"\")\r\nprint (p,end = \"\")\r\nprint (\")\",end = \" \")\r\n\r\nfor i in range(p+1,p+k+1):\r\n if i>n:\r\n continue\r\n print (i,end = \" \")\r\n\r\nif p+k<n:\r\n print (\">>\",end = \" \")", "n, p, k = [int(x) for x in input().split()]\nstart = p-k if p-k > 0 else 1\nend = p+k if p+k < n else n\nif start != 1:\n print('<< ', end='')\nfor i in range(start, end+1):\n if i == p:\n print(f'({p}) ', end='')\n else:\n print(f'{i} ', end='')\nif end != n:\n print('>>', end='')\n", "n, p, k = [int(x) for x in input().split()]\r\ns = ''\r\nif p > k + 1:\r\n s += \"<< \"\r\nfor i in range(max(1, p-k), p):\r\n s += str(i) + ' '\r\ns += '('+str(p)+') '\r\nfor i in range(p + 1, min(n, p+k)+1):\r\n s += str(i) + ' '\r\nif p + k < n:\r\n s += '>>'\r\nprint(s)", "def calc(cond, string):\r\n global res\r\n res += string if cond else \"\"\r\n\r\nn, p, k = list(map(int, input().split()))\r\nres = \"\"\r\n\r\ncalc(p-k > 1, \"<< \")\r\nfor x in range(k, 0, -1):\r\n calc(p-x >= 1, str(p-x)+\" \")\r\ncalc(1<=p and p<=n, \"(\"+str(p)+\")\")\r\nfor x in range(1, k+1):\r\n calc(p+x <= n, \" \"+str(p+x))\r\ncalc(p+k < n, \" >>\")\r\n\r\nprint(res)\r\n \r\n", "n ,p ,k = map(int,input().split())\r\nans = str()\r\n\r\nfirst = p-k\r\nlast = p+k+1\r\n\r\nif first > 1:\r\n ans += ('<< ')\r\nelse:\r\n first = 1\r\n\r\nif p+k <= n:\r\n last = p+k+1\r\nelse:\r\n last = n+1\r\n\r\nfor i in range (first,last):\r\n if i == p:\r\n ans += ('(%d) '%(i) )\r\n else:\r\n ans += ( str(i)+' ')\r\n \r\nif p+k < n:\r\n ans += (' >>')\r\n\r\nprint(ans)\r\n\r\n", "\nstrs = input().split(' ')\nn = int(strs[0])\np = int(strs[1])\nk = int(strs[2])\nstart = max(1, p - k)\nend = min (p + k, n)\nstring = ''\nif start != 1:\n\tstring += '<< '\nfor i in range(start,end+1,1):\n\tif i == p:\n\t\tstring+= '('+str(i)+') '\n\telse:\n\t\tstring+= str(i) + ' '\n\nif end != n:\n\tstring += '>>'\n\nprint(string)\n\n\n\t \t \t \t \t\t\t \t\t \t", "n, p, k = [int(x) for x in input().split()]\n\nl = \"\"\nif p - k > 1:\n l = \"<<\"\n\nr = \"\"\nif p + k < n:\n r = \">>\"\n\no = []\nfor i in range(max(1, p-k), p):\n o.append(str(i))\n\no.append(\"({x})\".format(x=p))\n\nfor i in range(p+1, min(p+k, n) + 1):\n o.append(str(i))\n\n\nprint(\" \".join([l, *o, r]).strip())\n", "s = input().split()\r\n[n, p, k] = [int(i) for i in s]\r\npages = []\r\nfor k_i in range(-k, 1):\r\n if p + k_i >= 1:\r\n pages.append(str(p + k_i))\r\nfor k_i in range(1, k + 1):\r\n if p + k_i <= n:\r\n pages.append(str(p + k_i))\r\nif pages[-1] != str(n):\r\n pages.append('>>')\r\nif pages[0] != str(1):\r\n pages = ['<<'] + pages\r\npages[pages.index(str(p))] = '(' + pages[pages.index(str(p))] + ')'\r\nprint(' '.join(pages))\r\n\r\n\r\n\r\n\r\n", "def read_int():\r\n\treturn int(input().strip())\r\n\r\ndef read_int_list():\r\n\treturn list(map(int,input().strip().split()))\r\n\r\ndef read_string():\r\n\treturn input().strip()\r\n\r\ndef read_string_list(delim=\" \"):\r\n\treturn input().strip().split(delim)\r\n\r\n###### Author : Samir Vyas #######\r\n###### Write Code Below #######\r\n\r\n[n,p,k] = read_int_list()\r\n\r\nout = \"\"\r\n\r\nif p-k > 1:\r\n\tout += \"<< \"\r\n\r\nfor i in range(p-k,p+k+1):\r\n\tif i<1 or i>n:\r\n\t\tcontinue\r\n\tif i == p:\r\n\t\tout += \"(\"+str(p)+\") \"\r\n\telse:\r\n\t\tout += str(i)+\" \"\r\n\r\nif p+k < n:\r\n\tout += \">>\"\r\n\r\nprint(out)", "n,p,k=map(int,input().split())\r\ns=\"\"\r\nk1=0\r\nk2=0\r\nfor i in range(p-k,p+k+1):\r\n if i>0 and i<=n:\r\n if k1==0:\r\n if i>1:\r\n s=s+\"<< \"\r\n k1=1\r\n k2=i\r\n if i==p:\r\n s=s+\"(\"+str(p)+\")\"+\" \"\r\n else:\r\n s=s+str(i)+\" \"\r\n\r\nif k2<n:\r\n s=s+\">>\"\r\nprint(s)\r\n", "n,p,k = map(int,input().split())\r\nh = []\r\nfor i in range(max(1,p-k),min(n,k+p)+1):\r\n\tif i==p: h.append('('+str(i)+')')\r\n\telse:h.append(str(i))\r\nl = ['1','(1)','({})'.format(n),'{}'.format(n)]\r\nif h[0] not in l:h.insert(0,'<<')\r\nif h[-1] not in l:h.append('>>')\r\nprint(*h)", "n,p,k=input().split()\r\nn,p,k=int(n),int(p),int(k)\r\nx=p-k\r\ny=p+k\r\nf=0\r\nh=0\r\nif x<=1:\r\n\tx=1\r\n\tf=1\r\nif y>=n:\r\n\ty=n\r\n\th=1\r\nlst=[]\r\nfor i in range(x,y+1):\r\n\tif i==p:\r\n\t\tlst.append('('+str(p)+')')\r\n\telse:\r\n\t\tlst.append(str(i))\r\n\r\nif f==1 and h==0:\r\n\tprint(' '.join(lst),'>>')\r\nelif f==0 and h==1:\r\n\tprint('<<',' '.join(lst))\r\nelif f==1 and h==1:\r\n\tprint(' '.join(lst))\r\nelse:\r\n\tprint('<<',' '.join(lst),'>>')\r\n\r\n", "n,p,k=map(int,input().split())\r\na=[]\r\nif(p>k):\r\n\tfor i in range(2*k+1):\r\n\t\tif((p-k+i)>n):\r\n\t\t\tbreak\r\n\t\ta.append(p-k+i)\r\nelif(p<=k):\r\n\tfor i in range(1,p):\r\n\t\ta.append(i)\r\n\ta.append(p)\r\n\tfor i in range(k):\r\n\t\tif((p+i+1)>n):\r\n\t\t\tbreak\r\n\t\ta.append(p+i+1)\r\ns=\"\"\r\nif(a[0]!=1):\r\n\ts+=\"<< \"\r\nfor i in a:\r\n\tif(i==p):\r\n\t\ts+=\"(\"+str(i)+\")\"+\" \"\r\n\telse:\r\n\t\ts+=str(i)+\" \"\r\nif(a[len(a)-1]!=n):\r\n\ts+=\">>\"\r\nprint(s.strip())", "n, p, k = map(int, input().split())\nres = \"\"\ninf, sup = p - k, p + k\nif inf <= 1:\n inf = 1\nelse:\n res += \"<< \"\nfor i in range(inf, p):\n res += \"%d \" % i\nres += \"(%d) \" % p\nfor i in range(p+1, min(sup, n) + 1):\n res += \"%d \" % i\nif sup < n:\n res += \">>\"\nprint(res)\n", "pages , current, gaps = [int(x) for x in input().split()]\r\nans = []\r\nif current - gaps > 1: ans.append(\"<<\")\r\nans += list(range(1, pages+1))[max(0, current - gaps - 1) : min(pages, current + gaps)]\r\n#print(ans)\r\nif ans[-1] != pages: ans.append(\">>\")\r\nans[ans.index(current)] = \"(\" + str(current) + \")\"\r\nprint(*ans)", "n, p, k = map(int, input().split())\r\n\r\nstart = max(p - k, 1)\r\nend = min(p + k, n)\r\n\r\nif start > 1:\r\n print(\"<<\", end=' ')\r\nfor i in range(start, p):\r\n print(i, end=' ')\r\nprint(f\"({p})\", end=' ')\r\n\r\nfor i in range(p + 1, end + 1):\r\n print(i, end=' ')\r\n\r\nif end < n:\r\n print(\">>\")\r\n", "n, p, k = [int(c) for c in input().split()]\nlst = []\n\ni = 0\nwhile i <= k:\n if p + i == p:\n lst.append('('+str(p)+')')\n else:\n if p + i <= n and p + i <= p + k:\n lst.append(str(p + i))\n if p - i > 0 and p - i >= p - k:\n lst.insert(0, str(p - i))\n i += 1\n\nif p - k > 1:\n lst.insert(0, '<<')\nif p + k < n:\n lst.append('>>')\nprint(' '.join(lst))", "Max,This,Range = map(int, input().split(' '))\r\n\r\nResult = ''\r\n\r\nMinRange = This - Range\r\n\r\nif This - Range > 1:\r\n Result += '<< '\r\nelse:\r\n MinRange = 1 \r\n\r\nMaxRange = This + Range\r\n\r\nif This + Range > Max:\r\n MaxRange = Max\r\n\r\nMinMaxRange = This - 1\r\nMaxMinRange = This + 1\r\n\r\nif MinMaxRange >= MinRange:\r\n for i in range(MinRange,MinMaxRange+1):\r\n Result += str(i) + ' '\r\n\r\nResult += '(' + str(This) + ')'\r\n\r\nif MaxMinRange <= MaxRange:\r\n Result += ' '\r\n for i in range(MaxMinRange,MaxRange+1):\r\n Result += str(i) + ' '\r\n Result = Result[:-1]\r\n\r\nif This + Range < Max:\r\n Result += ' >>'\r\n\r\nprint(Result)\r\n", "(n,p,k)=[int(x) for x in input().split()]\r\n\r\nif p-k>1:\r\n print(\"<<\",end=' ')\r\nfor i in range(-k,k+1,1):\r\n if p+i<1 or p+i>n:\r\n continue\r\n else:\r\n if p+i==p:\r\n print(\"(\"+str(p)+\")\",end=' ')\r\n else:\r\n print(p+i,end=' ')\r\nif p+k<n:\r\n print(\">>\")", "#! /usr/bin/env python\r\n# -*- coding: utf-8 -*-\r\nn, p, k = map(int, input().split())\r\nout = [str(i) for i in range(max(1, p-k), p)]+['(%d)' % p]+[str(i) for i in range(p+1, min(p+k+1, n+1))]\r\nif p-k > 1:\r\n out.insert(0, '<<')\r\nif p+k < n:\r\n out.append('>>')\r\nprint(' '.join(out))\r\n", "n,p,k=[int(x) for x in input().split()]\r\nL=[]\r\nL.append(\"(\"+str(p)+\")\")\r\ni=1\r\nwhile (p-i>=1) and (i<=k):\r\n L.insert(0,(str(p-i)))\r\n i=i+1\r\nif p-i+1!=1:\r\n L.insert(0,\"<<\")\r\n \r\nj=1\r\nwhile (p+j<=n) and (j<=k):\r\n L.append(str(p+j))\r\n j=j+1\r\nif p+j-1!=n:\r\n L.append(\">>\")\r\nfor i in range (len(L)-1):\r\n print(L[i],end=\" \")\r\nprint(L[len(L)-1])", "def f(i):\r\n return str(i) if i != p else \"(\" + str(i) + \")\"\r\n\r\ns = input()\r\nn, p, k = map(int, s.split())\r\n\r\nl, r = max(1, p-k), min(n, p+k)\r\nans = \"<< \" if l != 1 else \"\"\r\nfor i in range(l, r):\r\n ans += (f(i) + \" \")\r\nans += f(r) \r\n\r\nif r != n:\r\n ans += \" >>\"\r\n \r\nprint(ans)", "import sys\r\n\r\ndef input():\r\n return sys.stdin.readline().strip()\r\n\r\ndef int_input():\r\n return int(input())\r\n\r\ndef input_in_line():\r\n return map(int, input().split())\r\n\r\ndef main():\r\n n, s, k = input_in_line()\r\n a = []\r\n if s - k > 1:\r\n a += ['<<']\r\n for i in range(max(1, s - k), min(s + k, n) + 1):\r\n a += ['(' * int(i == s) + str(i) + ')' * int(i == s)]\r\n a += ['>>' * int(s + k < n)]\r\n print( *a )\r\nmain()", "n , p , k = map(int,input().split())\r\ns = \"(\"+str(p)+\")\"\r\ncheck_1 = 0 + (1 if p==n else 0)\r\ncheck_2 = 0 + (1 if p==1 else 0)\r\ni = 1\r\nwhile i<=k and p+i <=n:\r\n if p+i == n:\r\n check_1 = 1\r\n s = s + \" \" + str(p+i)\r\n i+=1\r\ni = 1\r\nwhile i<=k and p-i>=1:\r\n if p-i == 1:\r\n check_2 = 1\r\n s = str(p-i) + \" \" + s\r\n i+=1\r\nif check_1 == 0:\r\n s = s + \" >> \"\r\nif check_2 == 0:\r\n s = \"<< \" + s\r\nprint(s)\r\n", "n,p,k=map(int,input().split())\r\ns=str()\r\nif p-k>1:s+=\"<< \"\r\nfor _ in range(max(1,p-k),min(n,p+k)+1):s+=(str(_) if _!=p else\"(\"+str(_)+\")\")+\" \"\r\nif p+k<n:s+=\">>\"\r\nprint(s)", "n, p, k = map(int, input().split())\r\nif p - k > 1:\r\n print('<<', end=' ')\r\nfor i in range(max(1, p - k), p):\r\n print(i, end=' ')\r\nprint('(', p, ')', sep='', end='')\r\nfor i in range(p + 1, min(n, p + k) + 1):\r\n print(' ' + str(i), end='')\r\nif p + k < n:\r\n print(' >>', end='')", "n, p, k = input().split(' ')\r\nn,p,k = int(n), int(p), int(k)\r\n\r\npages = []\r\nfor i in range(p-k, p+k+1):\r\n\tif i > 0 and i <= n:\r\n\t\tpages.append(i)\r\n\r\nstring = ''\r\nif pages[0] != 1:\r\n\tstring+='<< '\r\nfor i in pages:\r\n\tif i == p:\r\n\t\tstring+= \"({0}) \".format(i)\r\n\telse:\r\n\t\tstring+= '{0} '.format(i)\r\n\r\nif pages[-1]!= n:\r\n\tstring+='>>'\r\n\r\nprint(string)\r\n\r\n", "(b, p, f) = [int(a) for a in input().split(' ')]\r\nt = ''\r\nl = p - f\r\nm = p + f\r\nif l <= 1:\r\n l = 1\r\nelse:\r\n t = t + '<<' + ' '\r\nif m > b:\r\n m = b\r\nfor g in range (l, m + 1):\r\n if g == p:\r\n t = t + '(' + str(p) + ')' + ' '\r\n else:\r\n t = t + str(g) + ' '\r\nif m < b:\r\n t = t + '>>'\r\nprint (t)\r\n", "x=input()\r\nxx=x.split( )\r\nn=int(xx[0])\r\np=int(xx[1])\r\nk=int(xx[2])\r\nif p-k<=1:\r\n kk=p-1\r\n while kk!=0:\r\n print(p-kk,end=' ')\r\n kk-=1\r\nelse:\r\n kk=k\r\n print('<<',end=' ')\r\n while kk!=0:\r\n print(p-kk,end=' ')\r\n kk-=1\r\nprint('(',end='')\r\nprint(p,end='')\r\nprint(')',end=' ')\r\n \r\nif p+k>=n:\r\n kk=n-p\r\n for i in range(1,kk+1):\r\n print(p+i,end=' ')\r\nelse:\r\n kk=k\r\n for i in range(1,kk+1):\r\n print(p+i,end=' ')\r\n print('>>')\r\n", "if __name__ == '__main__':\n [n, p, k] = [int(x) for x in input().split()]\n navigation = []\n\n if (p - k) > 1:\n navigation.append('<<')\n\n navigation += [str(x) for x in range(max(p - k, 1), p)]\n navigation.append('(%i)' % p)\n navigation += [str(x) for x in range(p + 1, min(p + k + 1, n + 1))]\n\n if (p + k) < n:\n navigation.append('>>')\n\n print(' '.join(navigation))\n", "x=list(map(int,input().split()))\r\nf=\"\"\r\nf=\" \"+f+\"(\"+str(x[1])+\")\"+\" \"\r\ny=x[2]\r\ni=1\r\nzs=x[1]\r\nzm=x[1]\r\nwhile(y>0):\r\n if(zm<x[0]):\r\n zm+=1\r\n f=f+str(x[1]+i)+\" \"\r\n if(zs>1):\r\n zs-=1\r\n f=\" \"+str(x[1]-i)+f\r\n i+=1\r\n y-=1\r\nff=f[1:len(f)]\r\nif(zs>1):\r\n ff=\"<<\"+\" \"+ff\r\nif(zm<x[0]):\r\n ff=ff+\" \"+\">>\"\r\nprint(ff)\r\n ", "n, p, k = map(int, input().split())\r\nfirst = p-k\r\nlast = p+k\r\nif first<1:\r\n\tfirst = 1\r\nif last>n:\r\n\tlast = n\r\nif first!=1:\r\n\tprint('<<', end='')\r\nfor i in range(first, last+1):\r\n\tprint(('%s ' if p==1 or first==1 else ' %s ')%('(%d)'%i if i==p else i), end='')\r\nif last<n:\r\n\tprint('>>', end='')", "n, p, k = list(map(int, input().split()))\r\nl = []\r\ni = 0\r\ne = 0\r\nwhile (i <= k*2 and e<n):\r\n e = p-k+i\r\n if e > 0: \r\n l.append(e)\r\n i = i+1\r\n\r\nif l[0] > 1:\r\n print('<<', end = ' ')\r\n \r\nfor i in l:\r\n if i == p:\r\n i = '('+str(i)+')'\r\n print(i, end = ' ')\r\n \r\nif l[len(l)-1] < n:\r\n print('>>')\r\n\r\n", "\ndef do():\n n, p, k = map(int, input().split(\" \"))\n res = []\n if p - k > 1:\n res.append(\"<<\")\n for i in range(max(1, p-k), min(n, p+k)+1):\n if i == p:\n res.append(\"(\" + str(i) + \")\")\n else:\n res.append(str(i))\n if p + k < n:\n res.append(\">>\")\n return \" \".join(res)\n\nprint(do())\n", "s = list(map(int, input().split(' ')))\nn = s[0]\np = s[1]\nk = s[2]\ns = ''\nif p - k >1:\n\ts += '<< '\nfor i in range(p - k, p):\n\tif i > 0:\n\t\ts += str(i) + \" \"\ns += '(' + str(p) + ') '\nfor i in range(p + 1, p + k + 1):\n\tif i <= n:\n\t\ts += str(i) + ' '\nif p + k < n:\n\ts += '>>'\nprint(s)\n\t\t\t \t\t\t\t \t \t \t\t\t \t \t \t\t\t\t", "x= list(map(int,input().split()))\nlista=[]\nfor i in range(-x[2],x[2]+1):\n if x[1]+i>x[0] or (x[1]+i)<=0:\n continue\n else:\n lista.append(x[1]+i)\nn= lista[:]\nn[n.index(x[1])]=\"(\"+str(x[1])+\")\"\nn= list(map(str,n))\nn= \" \".join(n)\nif lista[0]>1 and lista[-1]<x[0]:\n print(\"<<\",n,\">>\")\nelif lista[0]>1:\n print(\"<<\",n)\nelif lista[-1]<x[0]:\n print(n,\">>\")\nelse:\n print(n)", "def function(n, p, k):\n builder = ''\n if p-k > 1:\n builder += '<< '\n if p-k > 0:\n start = p-k\n else:\n start = 1\n if p+k >= n:\n end = n+1\n else:\n end = p+k+1\n for i in range(start,end):\n if i == p:\n builder += '('+str(i)+') '\n else:\n builder += str(i) + ' '\n if p+k < n:\n builder += '>>'\n return builder\n\ndef main():\n inp = list(map(int, input().strip().split()))\n out = function(*inp)\n print(out.strip())\n\n\nif __name__ == '__main__':\n main()\n", "def stringofnumbers(start,end):\r\n string = ''\r\n for x in range(start,end):\r\n string += '%i ' % x\r\n return string\r\ninput = list(map(int,input().split(' ')))\r\nstring = ''\r\nif input[1]-input[2]>1 :\r\n string +='<< '\r\n startingnum = input[1]-input[2]\r\nelse:\r\n startingnum = 1\r\nstring += stringofnumbers(startingnum,input[1])\r\nstring += '(%i) ' % input[1]\r\nstring += stringofnumbers(input[1]+1,min([input[0],input[1]+input[2]])+1)\r\nif input[1]+input[2]<input[0]:\r\n string +='>> '\r\nprint(string)\r\n", "n, p, k = map(int, input().split())\r\nst = max(p-k, 1)\r\nla = min(p+k+1, n+1)\r\nif st > 1:\r\n print(\"<<\", end = \" \")\r\nfor i in range(st, la):\r\n if i == p:\r\n print(\"({0})\".format(i), end = \" \")\r\n else:\r\n print(i, end = \" \")\r\nif la-1 != n:\r\n print(\">>\")\r\n", "n, p, k = map(int, input().split())\r\n\r\nans = list()\r\n\r\nif p - k > 1:\r\n ans.append('<< ')\r\n\r\n###\r\n\r\nfor i in range(max(1, p - k), p):\r\n ans.append(f'{i} ')\r\n\r\nans.append(f'({p}) ')\r\n\r\nfor i in range(p + 1, min(n + 1, p + k + 1)):\r\n ans.append(f'{i} ')\r\n\r\n###\r\n\r\nif p + k < n:\r\n ans.append('>>')\r\n\r\nprint(''.join(ans))\r\n", "N, P, K = map(int, input().split())\r\nlb = max(P - K, 1)\r\nrb = min(P + K, N)\r\nif lb > 1:\r\n\tprint(end = '<< ')\r\nfor i in range(lb, P):\r\n\tprint(i, end = ' ')\r\nprint('(' + str(P) + ') ', end = '')\r\nfor i in range(P + 1, rb + 1):\r\n\tprint(i, end = ' ')\r\nif rb < N:\r\n\tprint(end = '>>\\n')", "n, p, k = input().split()\r\nn, p, k = int(n), int(p), int(k)\r\n\r\nl = []\r\n\r\nif (p-k)>1 and (p+k)<n:\r\n l.append('<<')\r\n for i in range((p-k),p):\r\n l.append(i)\r\n l.append('('+str(p)+')')\r\n for i in range((p+1),(p+k+1)):\r\n l.append(i)\r\n l.append('>>')\r\nelif (p-k)<=1 and (p+k)<n:\r\n for i in range(1, p):\r\n l.append(i)\r\n l.append('('+str(p)+')')\r\n for i in range((p+1), (p+k+1)):\r\n l.append(i)\r\n l.append('>>')\r\nelif (p-k)>1 and (p+k)>=n:\r\n l.append('<<')\r\n for i in range((p-k), p):\r\n l.append(i)\r\n l.append('('+str(p)+')')\r\n for i in range((p+1),(n+1)):\r\n l.append(i)\r\nelse:\r\n for i in range(1, p):\r\n l.append(i)\r\n l.append('('+str(p)+')')\r\n for i in range((p+1),(n+1)):\r\n l.append(i)\r\nprint(*l)\r\n\r\n", "def pages():\r\n n, p, k = map(int, input().split())\r\n \r\n if p - k > 1:\r\n print(\"<<\", end=(\" \"))\r\n \r\n for i in range(-k, k + 1):\r\n if p + i < 1:\r\n continue\r\n elif p + i > n:\r\n break\r\n \r\n if i == 0:\r\n print(f\"({p})\", end=(\" \"))\r\n \r\n else:\r\n print(p + i, end=(\" \"))\r\n \r\n if p + k < n:\r\n print(\">>\")\r\n \r\n\r\npages()", "n, p, k = map(int, input().split())\r\nm = [i + 1 for i in range(n)]\r\nif p - k > 1:\r\n print('<<', end=' ')\r\nfor i in range(max(0, p - k - 1), min(p + k, n)):\r\n if i + 1 == p:\r\n print(f'({i + 1})', end=' ')\r\n else:\r\n print(i + 1, end=' ')\r\nif p + k < n:\r\n print('>>')\r\n", "inputList = input().split()\r\nn = int(inputList[0])\r\np = int(inputList[1])\r\nk = int(inputList[2])\r\n\r\nresult = []\r\nif p-k > 1:\r\n result.append(\"<< \")\r\n for i in range(p-k, p):\r\n result.append(f\"{i} \")\r\nelif p-k <= 1:\r\n for i in range(1, p):\r\n result.append(f\"{i} \")\r\nresult.append(f\"({p}) \")\r\n\r\nif p+k < n:\r\n for i in range(p+1, p+k+1):\r\n result.append(f\"{i} \")\r\n result.append(\">> \")\r\nelif p+k >= n:\r\n for i in range(p+1, n+1):\r\n result.append(f\"{i} \")\r\n\r\nprint(\"\".join(result))\r\n", "def pages(n: int, p: int, k: int) -> str:\n res = []\n\n if 1 < p - k:\n res.append('<<')\n\n for i in range(max(1, p-k), p):\n res.append(str(i))\n\n res.append('({})'.format(p))\n\n for i in range(p+1, min(n, p+k)+1):\n res.append(str(i))\n\n if p + k < n:\n res.append('>>')\n\n return ' '.join(res)\n\n\nif __name__ == \"__main__\":\n n, p, k = map(int, input().split())\n\n ans = pages(n, p, k)\n print(ans)\n", "#!/usr/bin/env python\n# coding: utf-8\n\n# In[31]:\n\n\nimport sys, math, random\ninp = sys.stdin.read().split()\ninp = [int(i) for i in inp]\na = '<<'\nb = '>>'\nc = '('\nd = ')'\nn = inp[0]\np = inp[1]\nk = inp[2]\nr = list(range(p-k, p+k+1))\nend = b\nstart = a\nmid = []\nfor i in r:\n if i >= n:\n end = n\n continue\n elif i <= 1:\n start = 1\n continue\n else:\n mid.append(i)\nnote = []\nnote.append(start)\nnote.extend(mid)\nnote.append(end)\nfor i in note:\n if i == p:\n print(c + str(i) + d, end = ' ')\n else:\n print(i, end = ' ')\n\n" ]

[ "from sys import stdout\r\ndef Q(r1, c1, r2, c2):\r\n print('?', r1, c1, r2, c2)\r\n stdout.flush()\r\n return input() == \"YES\"\r\n\r\nn = int(input())\r\nans = [' '] * (2 * n - 2)\r\nr = c = 1\r\nfor i in range(n - 1):\r\n if Q(r + 1, c, n, n):\r\n ans[i] = 'D'\r\n r += 1\r\n else:\r\n ans[i] = 'R'\r\n c += 1\r\nr = c = n\r\nfor i in range(n - 1):\r\n if Q(1, 1, r, c - 1):\r\n ans[-i - 1] = 'R'\r\n c -= 1\r\n else:\r\n ans[-i - 1] = 'D'\r\n r -= 1\r\nprint(\"!\", ''.join(ans))\r\n" ]

[ "def polynomials(n, k, A):\n L = [0]\n s = 0\n for i in range(n):\n s += A[i]\n if s & 1:\n break\n s >>= 1\n L.append(s)\n\n R = [0]\n s = 0\n for i in reversed(range(1, n+1)):\n s += A[i]\n if abs(s) > k:\n break\n s *= 2\n R.append(s)\n\n t = 0\n for i in range(n + 1 - len(R), len(L)):\n s = L[i] + R[n - i]\n if abs(s) <= k and not (i == n and s == 0):\n t += 1\n return t\n\n\ndef main():\n n, k = readinti()\n A = readintl()\n print(polynomials(n, k, A))\n\n##########\n\nimport sys\n\n\ndef readint():\n return int(input())\n\n\ndef readinti():\n return map(int, input().split())\n\n\ndef readintt():\n return tuple(readinti())\n\n\ndef readintl():\n return list(readinti())\n\n\ndef readinttl(k):\n return [readintt() for _ in range(k)]\n\n\ndef readintll(k):\n return [readintl() for _ in range(k)]\n\n\ndef log(*args, **kwargs):\n print(*args, **kwargs, file=sys.stderr)\n\n\nif __name__ == '__main__':\n main()\n" ]

[ "cont = 0\r\nc = 0\r\nn,b,d = [int(i) for i in input().split()]\r\nlis = [int(i) for i in input().split()]\r\nfor x in range(len(lis)):\r\n if lis[x] <= b:\r\n cont += lis[x]\r\n if cont > d:\r\n cont = 0\r\n c+=1\r\nprint(c)", "def getNumOfTimes(b, d, oranges):\r\n num = 0\r\n waste = 0\r\n for orange in oranges:\r\n if orange > b:\r\n continue\r\n if waste + orange > d:\r\n num += 1\r\n waste = 0\r\n else:\r\n waste += orange\r\n return num\r\n\r\n\r\nif __name__ == \"__main__\":\r\n _, b, d = map(int, input().split())\r\n oranges = map(int, input().split())\r\n print(getNumOfTimes(b, d, oranges))\r\n", "def main():\r\n n,b,d = input().split()\r\n n = int(n)\r\n b = int(b)\r\n d = int(d)\r\n arr = list(map(int, input().split()))\r\n total = 0\r\n count = 0\r\n for j in arr:\r\n if j <= b:\r\n total += j\r\n if total > d:\r\n count += 1\r\n total = 0\r\n print(count)\r\nmain()", "n,b,d=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nx,c=0,0\r\nfor i in range(n):\r\n if l[i]<=b:\r\n x+=l[i]\r\n if x>d:\r\n c+=1\r\n x=0\r\nprint(c)", "n, b, d = [int(i) for i in input().split()]\r\nhow_many = 0\r\nstorage = 0\r\na = [int(i) for i in input().split()]\r\nfor i in a:\r\n if i <= b:\r\n storage += i\r\n if storage>d:\r\n storage=0\r\n how_many += 1\r\nprint(how_many)", "n, b, d = map(int, input().split())\r\nsize = list(map(int, input().split()))\r\nt = 0\r\ntotal = 0\r\nfor i in range(n):\r\n if size[i] > b:\r\n size[i] = 0\r\n total += size[i]\r\n if total > d:\r\n t += 1\r\n total = 0\r\nprint(t)\r\n", "n, b, d = map(int, input().split())\r\nA = list(map(int,input().split()))\r\nsumm = 0\r\nanswer = 0\r\nfor i in A:\r\n if i<=b:\r\n summ+=i\r\n if summ>d:\r\n summ = 0\r\n answer +=1\r\nprint (answer)\r\n\r\n\r\n\r\n \r\n \r\n\r\n\r\n\r\n\r\n \r\n\r\n\r\n\r\n\r\n\r\n \r\n\r\n\r\n \r\n\r\n\r\n\r\n\r\n\r\n\r\n", "n, b, d = map(int, input().split())\r\nsps = list(map(int, input().split()))\r\ntt = 0\r\namn = 0\r\n\r\nfor j in sps:\r\n if j > b:\r\n continue\r\n tt += j\r\n if tt > d:\r\n tt = 0\r\n amn += 1\r\n\r\nprint (amn)\r\n ", "a , b ,c =map(int, input().split()) \r\nl =list (map(int, input().split()) )\r\np=0\r\nr=0\r\nfor i in range(len(l)):\r\n if(l[i] <= b):\r\n p+=l[i] \r\n if p > c :\r\n r+=1\r\n p=0\r\nprint(r) ", "n,b,d = list(map(int,input().split()))\r\na = list(map(int,input().split()))\r\ncounter, ans = 0, 0\r\nfor i in a:\r\n counter += i if i <= b else 0\r\n if counter > d:\r\n counter, ans = 0, ans+1\r\nprint(ans)", "x, y, z = input().split()\nx = int (x)\ny = int(y)\nz = int(z)\nw = 0\ne = 0\nfor o in input().split():\n o = int(o)\n if o <= (y):\n w += o\n if w > z:\n e += 1\n w = 0\nprint (e)\n\n \t \t \t \t\t\t\t \t\t \t \t \t\t \t", "n, b, d = map(int, input().split())\r\nlst = list(map(int, input().split()))\r\n\r\nres = 0\r\nwaste_count = 0\r\nfor i in lst:\r\n if i > b:\r\n continue\r\n else:\r\n waste_count += i\r\n if waste_count > d:\r\n waste_count = 0\r\n res += 1\r\nprint(res)", "def main(list):\r\n n = list[0]\r\n b = list[1]\r\n d = list[2]\r\n inputer = [int(i) for i in input().split()]\r\n res = 0\r\n trash = 0\r\n for i in range(n):\r\n if inputer[i]<=b:\r\n trash+=inputer[i]\r\n if trash>d:\r\n trash = 0\r\n res+=1\r\n return res\r\n\r\nprint(main([int(i) for i in input().split()]))", "a,b,c=input().split()\na=int(a)\nb=int(b)\nc=int(c)\nd=input()\nx=d.split()\ncnt=0\nm=0\nfor i in range(len(x)):\n x[i]=int(x[i])\n if x[i]<=b:\n cnt+=x[i]\n if cnt>c:\n m+=1\n cnt=0\nprint(m)\n\t\t \t\t\t\t \t\t \t\t\t\t \t\t \t \t", "#!/usr/bin/env python3\ndef solve():\n\twaste = 0\n\tempty = 0\n\tfor orange in eins:\n\t\tif orange <= b:\n\t\t\twaste += orange\n\t\t\tif waste > d:\n\t\t\t\tempty += 1\n\t\t\t\twaste = 0\n\tprint(empty)\n\nn,b,d = list(map(int,input().split()))\neins = list(map(int,input().split()))\nsolve()", "sum = 0\r\ncnt = 0\r\nn,b,d = map(int,input().split())\r\nlst = list(input().split())\r\nfor x in lst :\r\n if (int(x) <= b ):\r\n if((sum+int(x))> d):\r\n sum = 0\r\n cnt+=1\r\n else :\r\n sum+=int(x)\r\nprint(cnt)", "#!/usr/bin/python3\n\nimport sys\n\nclass Input:\n \"\"\" Integer inputs \"\"\"\n @staticmethod\n def inp():\n return(int(input()))\n\n \"\"\" List inputs \"\"\"\n @staticmethod\n def inlt():\n return(list(map(int, input().split())))\n\n \"\"\" String inputs \"\"\"\n @staticmethod\n def ins():\n return(input())\n\n \"\"\" List of characters \"\"\"\n @staticmethod\n def insr():\n return(list(input()))\n\n \"\"\" Integer variable inputs \"\"\"\n @staticmethod\n def invr():\n return(map(int, input().split()))\n\nclass Juicer:\n def solve(self, n, b, d, a):\n waste = 0\n emptied = 0\n for an in a:\n if an > b:\n continue\n waste += an\n if waste > d:\n waste = 0\n emptied += 1\n print(emptied)\n\n\nif __name__ == \"__main__\":\n n, b, d = Input.invr()\n a = Input.inlt()\n juicer = Juicer()\n juicer.solve(n, b, d, a)\n", "n, b, d = map(int, input().split())\r\noranges = list(map(int, input().split()))\r\nsum = 0\r\nn_times = 0\r\nfor orange in oranges:\r\n if orange <= b:\r\n sum += orange\r\n if sum > d:\r\n sum = 0\r\n n_times += 1\r\nprint(n_times)", "n,b,d = map(int,input().split())\r\norage = list(map(int,input().split()))\r\ncount = 0\r\nres = 0\r\nfor i in orage :\r\n if i <= b:\r\n count+=i\r\n if count > d :\r\n res+=1\r\n count = 0\r\nprint(res)", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Sat Jul 23 13:44:33 2022\r\n\r\n@author: Conor\r\n\r\nCFSheet A Problem 22 - CF709-DIV2A\r\n\"\"\"\r\n\r\nnumorange, maxSize, oflow = map(int,input().split())\r\n\r\noranges = list(map(int,input().split()))\r\n\r\nrunSize = 0\r\nans = 0\r\n\r\nfor i in range(numorange):\r\n if oranges[i] <= maxSize:\r\n runSize += oranges[i]\r\n if runSize > oflow:\r\n ans += 1\r\n runSize = 0\r\n\r\nprint(ans)", "n,lmt,sqz = map(int,input().split())\r\noranges = list(map(int, input().split()))\r\ntot = 0\r\nct = 0\r\nfor r in oranges:\r\n if r <= lmt:\r\n tot+=r\r\n if tot > sqz:\r\n ct+=1\r\n tot = 0\r\n \r\nprint(ct)", "r=lambda :map(int,input().split())\r\na,b,c=r()\r\ncounter=0\r\ntrash=0\r\nfor i in r():\r\n if i<=b:\r\n trash+=i\r\n if trash>c:\r\n trash=0\r\n counter+=1\r\nprint(counter) ", "n,b,d = input().split()\r\nn = int(n)\r\nb = int(b)\r\nd = int(d)\r\na = list(map(int,input().strip().split()))\r\nsum = 0\r\ncnt = 0\r\nfor i in a:\r\n if i > b:\r\n continue\r\n else:\r\n sum += i\r\n if sum > d:\r\n sum = 0\r\n cnt += 1\r\nprint(cnt)", "\r\n\r\n\r\ndef main_function():\r\n n, b, d = [int(i) for i in input().split(\" \")]\r\n a = [int(i) for i in input().split(\" \")]\r\n counter = 0\r\n cup = 0\r\n for i in a:\r\n if i <= b:\r\n if cup + i <= d:\r\n cup += i\r\n else:\r\n counter += 1\r\n cup = 0\r\n return counter\r\n\r\n\r\n\r\n\r\n\r\nprint(main_function())\r\n\r\n\r\n\r\n\r\n", "import sys\r\n\r\ninput = sys.stdin.readline\r\n\r\nn, b, d = map(int, input().split())\r\ndata = list(map(int, input().split()))\r\n\r\nmemo = [i for i in data if i <= b]\r\n\r\ncnt = 0\r\ntot = 0\r\nfor i in memo:\r\n tot += i\r\n if tot > d:\r\n cnt += 1\r\n tot = 0\r\n\r\nprint(cnt)\r\n", "n, b, d = map(int, input().split())\r\na = [int(i) for i in input().split()]\r\ncnt = 0\r\nd_cur = 0\r\nfor el in a:\r\n\tif el <= b:\r\n\t\td_cur += el\r\n\t\tif d_cur > d:\r\n\t\t\tcnt += 1\r\n\t\t\td_cur = 0\r\nprint(cnt)", "# Read n, b, d\r\nn, b, d = map(int, input().split())\r\n\r\n# Read the list of sizes of oranges\r\nsizes = list(map(int, input().split()))\r\n\r\n# Initialize variables\r\nwaste_count = 0 # Count of wasted oranges\r\ncurrent_sum = 0 # Current sum of orange sizes\r\n\r\n# Iterate through the list of sizes\r\nfor size in sizes:\r\n if size > b:\r\n continue # Skip this orange as it's too large\r\n \r\n current_sum += size # Add the size of the orange to the current sum\r\n \r\n if current_sum > d:\r\n waste_count += 1 # Increment the waste count\r\n current_sum = 0 # Reset the current sum\r\n\r\nprint(waste_count)\r\n", "# from sys import stdin, stdout\r\n\r\n# import re\r\n\r\nimport math\r\n# import statistics\r\nimport itertools\r\n# import collections\r\n# import cmath\r\n\r\n# import calendar\r\n# import datetime\r\n\r\n# import operator\r\n\r\n#----------Profiling----------\r\n# import cProfile\r\n# import pstats\r\n\r\n\r\nn, b, d = map(int, input().split())\r\narr = list(i for i in map(int, input().split()) if i <= b)\r\ndumped = 0\r\nin_waste = 0\r\nfor i in arr:\r\n in_waste += i\r\n if in_waste > d:\r\n in_waste = 0\r\n dumped += 1\r\nprint(dumped) \r\n", "number_of_oranges, max_size, d = map(int, input().split())\r\norder = list(map(int, input().split()))\r\n\r\ntotalSize = 0\r\nemptyCounter = 0\r\nfor i in range(number_of_oranges):\r\n if order[i] <= max_size:\r\n totalSize += order[i]\r\n if totalSize > d:\r\n emptyCounter += 1\r\n totalSize = 0\r\n\r\nprint(emptyCounter)", "n, b, d = [int(x) for x in input().split()]\r\noranges = [int(x) for x in input().split()]\r\ni = 0\r\nwaste = 0\r\nfor o in oranges:\r\n if o <= b:\r\n waste += o\r\n if waste > d:\r\n waste = 0\r\n i += 1\r\n\r\nprint(i)", "n_, b, d = input().split()\r\nb = int(b)\r\nd = int(d)\r\nn = input().split()\r\nfor i in range(int(n_)):\r\n n[i] = int(n[i])\r\ntotal = 0\r\nt = 0\r\nwhile n != []:\r\n if n[0] <= b:\r\n t += n[0]\r\n if t > d:\r\n t = 0\r\n total += 1\r\n del n[0]\r\nprint(total)\r\n", "def solve(n, b, d, orange_sizes):\r\n\tempty = 0\r\n\twastage = 0\r\n\tfor size in orange_sizes:\r\n\t\tif size > b:\r\n\t\t\tcontinue\r\n\t\twastage += size\r\n\t\tif wastage > d:\r\n\t\t\twastage = 0\r\n\t\t\tempty += 1\r\n\treturn empty\r\n\r\n\t\t\t\t\r\n\t\t\t\t\r\nn, b, d = list(map(int, input().split()))\r\norange_sizes = [int(x) for x in input().split()]\r\nprint(solve(n, b, d, orange_sizes))", "from sys import stdin, stdout\r\nfrom bisect import bisect_left, bisect_right\r\nfrom collections import Counter, deque\r\nimport heapq\r\nimport math\r\nfrom itertools import permutations, combinations, islice\r\n\r\nn, b ,d = map(int, stdin.readline().strip().split())\r\na = [*map(int, stdin.readline().strip().split())]\r\ndispose = 0 \r\nans = 0\r\nfor i in range(len(a)):\r\n if a[i] > b: continue\r\n else: dispose += a[i]\r\n\r\n if dispose > d: ans += 1; dispose = 0\r\n\r\nstdout.write(f\"{ans}\")", "n, b, d = map(int, input().split())\r\nl = list(map(int, input().split()))\r\ni=0\r\ncount = 0\r\nm = 0\r\nwhile i<n:\r\n if l[i]<=b:\r\n m = m + l[i]\r\n if m>d:\r\n count+=1\r\n m=0\r\n i+=1\r\nprint(count)", "n,b,d=input().split()\nn,b,d=int(n),int(b),int(d)\nl=input().split()\nl1=[]\nfor i in range(n):\n\tl1.append(int(l[i]))\ns=0\nc=0\nfor j in l1:\n\tif j<=b:\n\t\ts+=j\n\tif s>d:\n\t\ts=0\n\t\tc+=1\nprint(c)\n\n\n\n\n\n\n\n\n\n\n\t\n\t\t\t", "n, b, d = map(int, input().split())\r\nsizes = input()\r\nsizes = sizes.split()\r\nc = 0\r\nadd = 0\r\nfor i in sizes:\r\n if int(i) <= b:\r\n add = add + int(i)\r\n if add > d:\r\n c = c + 1\r\n add = 0\r\n else:\r\n continue\r\n \r\nprint(c)", "x, y, z = [int(item) for item in input().split()]\r\nn = [int(item) for item in input().split()]\r\ntemp = 0\r\na = 0\r\nfor i in range(x):\r\n if n[i] <= y:\r\n temp += n[i]\r\n if temp > z:\r\n a += 1\r\n temp = 0\r\n # print(i, temp, a)\r\nprint(a)", "constr=list(map(int,input().split()))\r\nnum=list(map(int,input().split()))\r\nlis=[]\r\ncnt=0\r\nsumi=0\r\nfor i in num:\r\n if i <=constr[1]:\r\n lis.append(i)\r\nfor j in range(len(lis)):\r\n sumi+=lis[j]\r\n if sumi>constr[2]:\r\n cnt+=1\r\n sumi=0\r\nprint(cnt)", "I=lambda:map(int,input().split())\r\nn,b,d=I()\r\nt,r=0,0\r\nfor i in filter(lambda x:x<=b,I()):t+=i;r+=t>d;t*=t<=d\r\nprint(r)", "n,b,d=map(int,input().split())\r\nthe_list=list(map(int,input().split()))\r\nsum=empty=0\r\nfor i in the_list:\r\n if i>b:\r\n continue\r\n sum+=i\r\n if sum>d:\r\n empty+=1\r\n sum=0\r\nprint(empty)", "n,b,d=map(int,input().split())\r\na=list(map(int,input().split()))\r\nk=0\r\nm=0\r\nfor i in range(n):\r\n if a[i]>b:\r\n continue\r\n else:\r\n k+=a[i]\r\n if k>d:\r\n m+=1\r\n k=0\r\nprint(m)\r\n", "n, b, d = [int(x) for x in input().split()]\narr = [int(x) for x in input().split()][:n]\ns, cnt = 0, 0\nfor i in range(n):\n if arr[i] <= b:\n s += arr[i]\n if s <= d:\n pass\n else:\n cnt += 1\n s = 0\nprint(cnt)\n \t\t \t\t\t\t\t \t\t\t\t\t \t \t \t", "n,b,d=map(int,input().split())\r\nlis=list(map(int,input().split()))\r\nempty=0\r\nt1=0\r\nt2=0\r\nfor i in lis:\r\n if i>b:\r\n continue\r\n t1+=i\r\n if t1>d:\r\n empty+=1\r\n t1=0\r\nprint(empty)", "from sys import stdin, stdout\r\ndef read():\r\n\treturn stdin.readline().rstrip()\r\n\r\ndef read_int():\r\n\treturn int(read())\r\n \r\ndef read_ints():\r\n\treturn list(map(int, read().split()))\r\n \r\ndef solve():\r\n\tn,b,d=read_ints()\r\n\ta=read_ints()\r\n\tret=0\r\n\ttot=0\r\n\tfor x in a:\r\n\t\tif x>b:\r\n\t\t\tcontinue\r\n\t\ttot+=x\r\n\t\tif tot>d:\r\n\t\t\ttot=0\r\n\t\t\tret+=1\r\n\tprint(ret)\r\n\r\nsolve()\r\n", "# Bismillah\r\n# In the name of GOD\r\n\r\n\r\nn, b, d = map(int, input().split())\r\na = list(map(int, input().split()))\r\nt_size = 0\r\ntotal = 0\r\n\r\nfor orange in a:\r\n\tif orange > b:\r\n\t\tcontinue\r\n\tt_size += orange\r\n\tif t_size > d:\r\n\t\ttotal += 1\r\n\t\tt_size = 0\r\nprint(total)\r\n", "n,b,d=map(int,input().split())\r\nlst=list(map(int,input().split()))\r\ncurrent=0\r\nclean=0\r\nfor ele in lst:\r\n if ele>b:\r\n continue\r\n else:\r\n current+=ele\r\n if current>d:\r\n clean+=1\r\n current=0\r\nprint(clean)", "\n\n\n\nn, b, d = map(int, input().split())\nnums = list(map(int, input().split()))\n\n\n\ntotal = 0\ncount = 0\n\nfor num in nums :\n if num > b :\n continue\n \n total += num\n if total > d :\n count += 1\n total = 0\n\nprint(count)\n\t\t\t \t \t \t \t\t \t \t\t\t \t\t\t\t \t \t", "n, b, d = map(int, input().split())\r\na = list(map(int, input().split()))\r\n\r\nans = 0\r\ncur = 0\r\nfor x in a:\r\n if x > b:\r\n continue\r\n cur += x\r\n if cur > d:\r\n ans += 1\r\n cur = 0\r\nprint(ans)", "n,b,d=map(int,input().split())\r\na=list(map(int,input().split()))\r\nsum,ans=0,0\r\nfor i in a:\r\n if(i<=b):\r\n sum=sum+i\r\n if(sum>d):\r\n ans=ans+1\r\n sum=0\r\nprint(ans)\r\n", "import sys\r\ninput=sys.stdin.readline\r\nimport math\r\nimport bisect\r\n\r\n\r\nn,b,d=[int(i) for i in input().split(\" \")]\r\nl=[int(i) for i in input().split(\" \")]\r\nc=0\r\nans=0\r\nfor i in l:\r\n if i<=b:\r\n c+=i\r\n if c>d:\r\n c=0\r\n ans+=1\r\nif c>d:\r\n c=0\r\n ans+=1\r\nprint(ans)\r\n\r\n\r\n\r\n \r\n \r\n\r\n \r\n \r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n \r\n \r\n\r\n\r\n\r\n \r\n\r\n\r\n\r\n\r\n\r\n \r\n \r\n \r\n\r\n\r\n\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,b,d = map(int,input().split())\r\na = [int(x) for x in input().split()]\r\ns=cnt=0\r\nfor i in a:\r\n if i<=b:\r\n s+=i \r\n if s>d:cnt+=1;s=0\r\n\r\nprint(cnt)\r\n", "_, orange_size, collector_size = map(int, input().split())\nappropirate_sized_oranges = [x for x in map(int, input().split()) if x <= orange_size ]\n\nwaste_size = 0\ncnt = 0\nfor orange in appropirate_sized_oranges:\n waste_size += orange\n if waste_size > collector_size:\n waste_size = 0\n cnt += 1\n\nprint(cnt)\n\n\t\t\t\t \t \t\t\t\t \t\t\t\t\t \t \t\t \t\t", "n,b,d=map(int,input().split())\r\na=list(map(int,input().split()))\r\nsum=0\r\ncount=0\r\nfor i in a:\r\n if i<=b:\r\n sum+=i\r\n if sum>d:\r\n count+=1\r\n sum=0\r\nprint(count) ", "# Wadea #\r\ninput1 = input().strip().split()\r\nnumberofOrange = int(input1[0])\r\nsizeofJucier = int(input1[1])\r\nsizeofwaste = int(input1[2])\r\ninput2 = input().strip().split()\r\nlst = []\r\n\r\nfor i in input2:\r\n i = int(i)\r\n lst.append(i)\r\nn = 0\r\nl = 0\r\nw = 0\r\nfor s in lst:\r\n if s > sizeofJucier:\r\n n += 0\r\n if s <= sizeofJucier:\r\n l += s\r\n if l > sizeofwaste:\r\n w += 1\r\n l = 0\r\nprint(w)\r\n", "def Juicer(numberOfOranges,CapacityofJuicer,CapacityOfWasteCollector):\r\n numberOfWasteCollections=0\r\n oranges=list(map(int,input().split()))\r\n currentWasteCollectorCapacity=0\r\n for i in oranges:\r\n if i<=CapacityofJuicer:\r\n currentWasteCollectorCapacity+=i\r\n if currentWasteCollectorCapacity>CapacityOfWasteCollector:\r\n currentWasteCollectorCapacity=0\r\n numberOfWasteCollections+=1\r\n return numberOfWasteCollections\r\nn,b,d=map(int,input().split())\r\nprint(Juicer(n,b,d))", "n, b, j = map(int, input().split())\r\nk = input().split()\r\ns = []\r\nd = []\r\nfor i in range(n):\r\n s.append(int(k[i]))\r\nfor i in range(len(s)):\r\n if s[i] <= b:\r\n d.append(s[i])\r\ns = 0\r\nsum_ = 0\r\nfor el in d:\r\n s += el\r\n if s > j:\r\n sum_ += 1\r\n s = 0\r\nprint(sum_)", "n,b,d=map(int, input().split())\r\na=list(map(int, input().split()))\r\nx=0\r\nm=0\r\nfor i in a:\r\n if i<=b:\r\n m+=i\r\n if m>d:\r\n x+=1\r\n m=0\r\nprint(x)", "_,b,d=map(int,input().split())\r\nr,c=0,d\r\nfor x in map(int,input().split()):\r\n if x>b:continue\r\n c-=x\r\n if c<0:r+=1;c=d\r\nprint(r)\r\n", "def juicer(n,arr,b,d):\r\n\tclean=0\r\n\tfill=0\r\n\tfor i in range(n):\r\n\t\tif arr[i]>b:\r\n\t\t\tcontinue\r\n\r\n\t\telse:\r\n\t\t\tfill+=arr[i]\r\n\r\n\t\tif fill>d:\r\n\t\t\tclean+=1\r\n\t\t\tfill=0\r\n\r\n\r\n\tprint(clean)\r\n\treturn\r\n\r\n\r\nn,b,d=map(int,input().split())\r\narr=[int(arr) for arr in input().split()]\r\njuicer(n,arr,b,d)\r\n\r\n\r\n\r\n\r\n", "n,b ,d = (map(int , input().split()))\r\n\r\noranges = list(map(int , input().split()))\r\nwaste = 0\r\nres = 0\r\n\r\nfor i in oranges:\r\n if i <= b :\r\n waste += i\r\n if waste > d :\r\n waste =0\r\n res +=1\r\nprint(res)", "n, b, d = map(int, input().split())\noranges = list(map(int, input().split()))\nfiltered_oranges = list(filter(lambda orange_size: orange_size <= b, oranges))\n\nans = 0\ntot = 0\n\nfor orange in filtered_oranges:\n tot += orange\n if tot > d:\n ans += 1\n tot = 0\n\nprint(ans)", "import sys\r\nn,b,d=[int(i) for i in input().split()]\r\na=[int(i) for i in sys.stdin.readline().split() if int(i)<=b]\r\nw,em=0,0\r\nfor el in a:\r\n w+=el\r\n if w>d:\r\n em+=1\r\n w=0\r\nif w>d: em+=1\r\nprint(em)", "n,b,d = map(int, input().split())\n\ncount = 0\njuice = 0\nfor a in map(int, input().split()):\n if a > b:\n continue\n juice += a\n if juice > d:\n juice = 0\n count += 1\n\nprint(count)\n\n", "_, max_size, max_waste = map(int, input().split())\noranges = map(int, input().split())\nempties = 0\nwaster = 0\nfor orange in oranges:\n if orange > max_size:\n continue\n if waster > max_waste:\n empties += 1\n waster = 0\n waster += orange\nif waster > max_waste:\n empties += 1\nprint(empties)\n", "n, b, d = map(int, input().split())\r\nlst = [int(i) for i in input().split()]\r\nc, h = 0, 0\r\nfor i in lst:\r\n if i <= b:\r\n c += i\r\n if c > d:\r\n h += 1\r\n c = 0\r\nprint(h)", "import math\r\nn,b,d=map(int,input().split())\r\na=list(map(int,input().split()))\r\nans=0\r\nc=0\r\nfor i in a:\r\n if i<=b and ans+i<=d:\r\n ans+=i\r\n elif i<=b and ans+i>d:\r\n c+=1\r\n ans=0\r\nprint(c)\r\n", "n,b,d=map(int,input().split())\nans,siz=0,0\nlst=list(map(int,input().split()))\nfor i in lst:\n if(i>b):\n continue\n siz+=i\n if(siz>d):\n siz=0\n ans+=1\nprint(ans)\n\n \t \t\t \t \t \t\t \t \t\t\t \t \t\t\t", "n, b, d = map(int, input().split())\r\noranges = list(map(int, input().split()))\r\ncount = 0\r\ntotal = 0\r\n\r\nfor orange in oranges:\r\n if orange <= b:\r\n total += orange\r\n if total > d:\r\n count += 1\r\n total = 0\r\n \r\nprint(count)", "# 709A\r\nspecs = list(map(int, input().split()))\r\noranges = list(map(int, input().split()))\r\n\r\nb = specs[1]; d = specs[2]\r\nwaste = 0; emp = 0\r\n\r\nfor o in oranges:\r\n if o > b:\r\n continue\r\n waste += o\r\n\r\n if waste > d:\r\n emp += 1\r\n waste = 0\r\n\r\nprint(emp)\r\n", "from itertools import product\r\nfrom math import ceil\r\nfrom fractions import Fraction\r\n\r\ndef binary_table(string_with_all_characters, length_to_make):\r\n return [''.join(x) for x in product(string_with_all_characters, repeat=length_to_make)]\r\n\r\n\r\ndef all_possible_substrings(string):\r\n return [int(string[i: j]) for i in range(len(string)) for j in range(i + 1, len(string) + 1)]\r\n\r\n\r\ndef number_of_substrings(length):\r\n return int(length * (length + 1) / 2)\r\n\r\n\r\ndef is_prime(num):\r\n for i in range(2, num):\r\n if num / i == int(num / i) and num != i:\r\n return False\r\n\r\n return True\r\n\r\n\r\n\"\"\"for enumeration in range(int(input())):\r\n\"\"\"\r\n\r\nnum_of_oranges, maximum_that_fits_in, trash_capacity = map(int, input().split())\r\n\r\noranges = list(map(int, input().split()))\r\ncurrent_cap = 0\r\ntotal = 0\r\n\r\nfor i in oranges:\r\n if i > maximum_that_fits_in:\r\n continue\r\n current_cap += i\r\n if current_cap > trash_capacity:\r\n total += 1\r\n current_cap = 0\r\nprint(total)", "x = list(map(int, input().split()))\r\ny = list(map(int, input().split()))\r\nz = 0\r\nw = 0\r\nfor i in range(len(y)):\r\n if y[i] <= x[1]:\r\n z = z + y[i]\r\n if z > x[2]:\r\n w = w+1\r\n z = 0\r\nprint(w)", "n, b, d = [int(i) for i in input().split()]\r\ns = [int(i) for i in input().split()]\r\nc = 0\r\np = 0\r\nfor i in s:\r\n if i > b:\r\n continue\r\n p += i\r\n if p > d:\r\n c += 1\r\n p = 0\r\nprint(c)\r\n", "q=input(\"\")\r\ns=q.split()\r\nn=int(s[0])\r\nb=int(s[1])\r\nd=int(s[2])\r\nsum=0\r\nq=0\r\na=input(\"\")\r\nw=a.split()\r\nfor i in range(0,n):\r\n p=int(w[i])\r\n if p>b:\r\n continue\r\n sum+=p\r\n if sum>d:\r\n q+=1\r\n sum=0\r\nprint(q)\r\n", "[_, maxSize, maxWaste] = [int(i) for i in input().split(\" \")]\noranges = [int(i) for i in input().split(\" \")]\n\nbin = 0\nwaste = 0\n\nfor o in oranges:\n if o <= maxSize:\n waste += o\n if waste > maxWaste:\n waste = 0\n bin += 1\n\nprint(bin)\n\n\n", "n, b, d = [int(i) for i in input().split()]\r\n\r\ncnt = 0\r\noranges = list(map(int, input().split()))\r\nd1 = 0\r\n\r\nfor i in range(n):\r\n if oranges[i] <= b:\r\n d1 += oranges[i] \r\n if d1 > d:\r\n cnt += 1\r\n d1 = 0\r\nprint(cnt)", "def main():\r\n l=list()\r\n l=input()\r\n l=l.split()\r\n n=int(l[0])\r\n b=int(l[1])\r\n d=int(l[2])\r\n tmp=list()\r\n tmp=input()\r\n waste=0\r\n count=0\r\n tmp=tmp.split()\r\n for i in range(n):\r\n tmp[i]=int(tmp[i])\r\n if tmp[i] <= b:\r\n if waste+tmp[i] > d:\r\n count+=1\r\n waste=0\r\n else:\r\n waste+=tmp[i]\r\n\r\n print(count)\r\nif __name__ == \"__main__\":\r\n main()", "n, b, d = map(int, input().split())\r\na = list(map(int, input().split(\" \")))\r\nres = 0 \r\ny = 0\r\nfor i in a:\r\n if i <= b:\r\n res += i\r\n if res > d:\r\n res = 0\r\n y += 1\r\nprint(y)\r\n", "import sys\r\ninput = sys.stdin.readline\r\nn, b, d = map(int, input().split())\r\noranges = list(map(int, input().split()))\r\nwaste = 0\r\nans = 0\r\nfor i in oranges:\r\n if i <= b:\r\n waste += i\r\n if waste > d:\r\n ans += 1\r\n waste = 0\r\nprint(ans)", "n,b,d=map(int,input().split())\r\nlst=list(map(int,input().split()))\r\nsumm,cnt=0,0\r\nfor ele in lst:\r\n if ele<=b:\r\n summ+=ele\r\n if summ>d:\r\n cnt+=1\r\n summ=0\r\nprint(cnt)", "from math import*\r\nn,b,d=list(map(int,input().split()))\r\nj=list(filter(lambda x:x<=b,list(map(int,input().split()))))\r\nc=0\r\nu=0\r\nfor i in range(len(j)):\r\n u+=j[i]\r\n if u>d:\r\n u=0\r\n c+=1\r\nprint(c)", "n, b, d = [int(i) for i in input().split()]\r\nx = [int(i) for i in input().split()]\r\nsize = 0\r\nans = 0\r\n\r\nfor i in range(n):\r\n if x[i] <= b:\r\n size += x[i]\r\n\r\n if size > d:\r\n ans += 1\r\n size = 0\r\n\r\nprint(ans)\r\n", "n, b, d = map(int, input().split())\r\nl = [int(i) for i in input().split()]\r\nk = 0\r\ns = 0\r\nfor i in l:\r\n if i > b:\r\n continue\r\n if s + i > d:\r\n k += 1 \r\n s = 0\r\n else:\r\n s += i\r\nprint(k)", "n,b,d= map(int,input().split())\r\nc =input().split()\r\nl=[]\r\nfor i in c : \r\n if int(i) > b: \r\n continue\r\n else : \r\n l.append(int(i))\r\n \r\ncol = 0 \r\nres = 0 \r\nfor x in l : \r\n col +=x \r\n if col > d : \r\n res+=1\r\n col = 0\r\nprint(res)", "n,b,d=map(int,input().split())\r\na=list(map(int,input().split()))\r\ncount=0\r\ntotal=0\r\nfor elem in a:\r\n if elem<=b:\r\n total+=elem\r\n if total>d:\r\n total=0\r\n count+=1\r\nprint(count)\r\n", "n, b, d = list(map(int,input().split()))\r\na = list(map(int,input().split()))\r\ncount = ans = 0\r\nfor orange in a:\r\n if orange>b:continue;\r\n count += orange\r\n if count>d:ans+=1;count = 0;\r\nprint(ans)", "import math\r\n\r\ndef no_of_waste_operations(parameters,orange_sizes):\r\n orange_used=[]\r\n index=0\r\n sum=0\r\n for i in range(parameters[0]):\r\n if(orange_sizes[i]<=parameters[1]):\r\n orange_used.insert(index,orange_sizes[i])\r\n index+=1\r\n count=0\r\n for i in orange_used:\r\n sum+=i\r\n if(sum>parameters[2]):\r\n count+=1\r\n sum=0\r\n return(count)\r\n\r\ndef main():\r\n parameters=list(map(int,input().strip().split()))\r\n orange_sizes=list(map(int,input().strip().split()))\r\n print(no_of_waste_operations(parameters,orange_sizes))\r\n\r\nif __name__==\"__main__\":\r\n main()\r\n", "n , b, d = input().split()\nn = int(n) ; b = int(b) ; d = int(d)\na = input()\nl = a.split()\ntemp = d\nans = 0\nfor i in range(len(l)):\n l[i] = int(l[i])\n if l[i] > b:\n continue\n if l[i] <= temp:\n temp -= l[i]\n else:\n ans+=1\n temp = d\nprint(ans)\n\n\t\t\t \t \t\t \t \t \t \t \t \t\t\t\t\t\t\t", "txt=input()\nn,b,d=txt.split()\nn=int(n)\nb=int(b)\nd=int(d)\n\nwaste=0\ncount=0\ntxt2=input()\na=txt2.split()\nfor i in range(n):\n if int(a[i])<=b:\n waste=waste+int(a[i])\n\n if(waste>d):\n count=count+1\n waste=0\n\n\n\nprint(count)\n\n\n \t\t \t \t \t \t\t\t\t\t \t\t\t \t\t \t", "n, b, d = map(int ,input().split())\r\nA = [int(x) for x in input().split()]\r\n \r\nw, ans = 0, 0\r\nfor i in A:\r\n if(i <= b):\r\n w += i\r\n if(w > d):\r\n ans+=1\r\n w = 0\r\nprint(ans)\r\n ", "n,b,d = map(int,input().split())\r\na = [int(i) for i in input().split()]\r\nc = 0\r\nres = 0\r\nfor i in range(n):\r\n if a[i] <= b:\r\n c += a[i]\r\n if c > d:\r\n res += 1\r\n c = 0\r\nprint(res)", "n, b, d = map(int,input().split())\nlst= list(map(int,input().split()))\nemp, joicer = 0, 0\nfor i in range(n):\n if lst[i] <= b:\n joicer += lst[i]\n if joicer > d:\n emp += 1\n joicer = 0\nprint(emp)\n\n\n\t\t\t\t\t \t \t \t\t\t\t\t \t \t \t\t \t\t", "if __name__ == '__main__':\r\n n, b, d = list(map(int, input().strip().split()))\r\n a = list(map(int, input().strip().split()))\r\n curSum, res = 0, 0\r\n for i in range(n):\r\n if a[i] > b:\r\n continue\r\n curSum += a[i]\r\n if curSum > d:\r\n curSum = 0\r\n res += 1\r\n print(res)", "# -*- coding:utf-8 -*-\nfrom typing import List\n\n\ndef Juicer(A:List[int], b:int, d:int)->int:\n # write code here\n feiliao=0\n qingxi=0\n for i in range(len(A)):\n if(A[i]>b):\n continue\n else:\n feiliao+=A[i]\n if(feiliao>d):\n feiliao=0\n qingxi+=1\n # print(qingxi)\n return qingxi\n\n\nif __name__ == '__main__':\n n,b,d = map(int, input().split())\n L = list(map(int, input().split()))\n print(Juicer(L, b, d))\n \t\t\t \t \t\t \t\t \t \t\t\t\t \t \t\t", "n,b,d=map(int,input().split())\r\na=list(map(int,input().split()))\r\ns=t=0\r\nfor i in range(n):\r\n\tif(a[i]<=b):\r\n\t\tt+=a[i]\r\n\t\tif(t>d):\r\n\t\t\ts+=1\r\n\t\t\tt=0\r\nprint(s)\r\n\r\n\r\n# n,q=map(int,input().split())\r\n# s=input()\r\n# for i in range(q):\r\n# l,r=map(int,input().split())\r\n# l-=1\r\n# k=s[l:r]\r\n# cnt=0\r\n# for i in k:\r\n# m=ord(i)-97\r\n# m+=1\r\n# cnt+=m\r\n# print(cnt)\r\n\r\n\r\n\r\n", "n, b, d = map(int,input().split())\na = list(map(int, input().split()))\njuicer = 0\nwaste = 0\nfor i in range(n):\n if a[i] <= b:\n juicer += a[i]\n if juicer > d:\n juicer = 0\n waste += 1\nprint(waste)\n\n \t \t\t \t\t \t \t\t\t\t\t\t\t \t \t\t", "def oRaNgEs(a,b,d):\r\n waste_basket=0\r\n empting=0\r\n for i in a:\r\n if i<=b:\r\n waste_basket+=i\r\n if waste_basket>d:\r\n waste_basket=0\r\n empting+=1\r\n return empting\r\nn,b,d=map(int,input().split())\r\na=[int(i) for i in input().split()]\r\nprint(oRaNgEs(a,b,d))", "# LUOGU_RID: 101608303\nn, b, d, *a = map(int, open(0).read().split())\r\nt = ans = 0\r\nfor x in a:\r\n if x <= b:\r\n t += x\r\n if t > d:\r\n ans += 1\r\n t = 0\r\nprint(ans)\r\n", "n,b,d = map(int,input().split())\r\na = list(map(int,input().split()))\r\n\r\nans = 0\r\nwaste = 0\r\nfor i in a:\r\n if i<=b:\r\n waste += i\r\n if waste>d:\r\n ans+=1\r\n waste=0\r\nprint(ans)\r\n", "n, b, d = [int(i) for i in input().split()]\r\na = [int(i) for i in input().split()]\r\nwaste = 0\r\nempty = 0\r\n\r\nfor i in a:\r\n if i <= b:\r\n waste = waste + i\r\n if waste > d:\r\n empty = empty + 1\r\n waste = 0\r\n\r\nprint(empty)", "def juicer(oranges,juicerSize,wasteSize):\r\n wasteCollected=0\r\n cleaned=0\r\n for orange in oranges:\r\n if orange <= juicerSize:\r\n wasteCollected+=orange\r\n if wasteCollected>wasteSize:\r\n cleaned+=1\r\n wasteCollected=0\r\n return cleaned\r\n\r\ninputs=list(map (int,input().split()) )\r\noranges=list(map (int,input().split()) )\r\nprint(juicer(oranges,inputs[1],inputs[2]))\r\n", "n, b, d = map(int, input().split())\r\noranges = list(map(int, input().split()))\r\n\r\ntotal_size = 0\r\nwaste = 0\r\n\r\nfor orange in oranges:\r\n if orange > b:\r\n continue\r\n total_size += orange\r\n if total_size > d:\r\n waste += 1\r\n total_size = 0\r\n\r\nprint(waste)\r\n", "n, b, d = map(int, input().split())\r\ncont, answ = 0, 0\r\noranges = input().split()\r\nfor orange in oranges: \r\n if int(orange) <= b:\r\n cont += int(orange)\r\n if cont > d:\r\n answ += 1\r\n cont = 0\r\nprint(answ)", "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\ndef juicer(num, max_size, value, oranges):\r\n count = 0\r\n value_tracker = 0\r\n for i in range(num):\r\n if oranges[i] > max_size:\r\n continue\r\n value_tracker += oranges[i]\r\n if value_tracker > value:\r\n value_tracker = 0\r\n count += 1\r\n return count\r\n\r\ndef main():\r\n n, b, d = inlt()\r\n oranges = inlt()\r\n result = juicer(n, b, d, oranges)\r\n print(result)\r\n return\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "l = 0\r\nam = 0\r\nn,b,d = [int(i) for(i) in input().split()]\r\na = [int(i) for(i) in input().split()]\r\nfor i in a:\r\n if i<=b:\r\n l = l + i\r\n if l>d:\r\n l = 0\r\n am = am+1\r\nprint(am)", "n,b,d=map(int,input().split()) \r\nl=list(map(int,input().split())) \r\ns=0\r\nc=0\r\nfor i in l:\r\n if b>=i:\r\n s+=i\r\n if s>d:\r\n c+=1\r\n s=0\r\nprint(c) ", "n, b, d = list(map(int, input().split()))\r\narr = list(map(int, input().split()))\r\ns = 0\r\nx = 0\r\nfor i in arr:\r\n if i <= b:\r\n s = s+i\r\n if s > d:\r\n s = 0\r\n x += 1\r\n\r\nprint(x)\r\n", "n,a,b = [int(x) for x in input().split(\" \")]\r\narray = [int(x) for x in input().split(\" \")]\r\nans = 0\r\ncurrentSum =0\r\nfor i in array:\r\n if i<=a:\r\n currentSum+=i\r\n if currentSum>b:\r\n ans+=1\r\n currentSum=0\r\nprint(ans)\r\n", "n, b, d = map(int, input().split())\r\na = list(map(int, input().split()))\r\ntotal = 0\r\ncount = 0\r\nfor i in range(n):\r\n if a[i] <= b:\r\n total += a[i]\r\n if total > d:\r\n total = 0\r\n count += 1\r\n\r\nprint(count)", "c=0\r\nn,b,d=map(int,input().split())\r\nl=list(map(int,input().split()))\r\ns=0\r\nfor i in l:\r\n\tif i>b:\r\n\t\tcontinue\r\n\ts+=i\r\n\tif s>d:\r\n\t\ts=0\r\n\t\tc+=1\r\nprint(c)", "n,b,d = map(int, input().split())\r\ninp = list(map(int, input().split()))\r\nans = 0\r\nfill = 0\r\nfor i in inp:\r\n if i > b:\r\n continue\r\n else:\r\n fill += i\r\n if fill > d:\r\n fill = 0\r\n ans += 1\r\n\r\nprint(ans)\r\n\r\n", "n, juicer, wastelimit = input().split()\nn = int(n)\njuicer = int(juicer)\nwastelimit = int(wastelimit)\n\noranges = list(map(int, input().split()))\n\nbasket = 0 \ncounter = 0\n\nfor i in range(n):\n if oranges[i] <= juicer:\n basket += oranges[i]\n \n if basket > wastelimit:\n basket = 0\n counter += 1\n \nprint(counter)\n\t\t \t \t \t \t\t\t \t\t \t\t\t", "a1 ,a2,a3 = map(int,input().split(' ')) \r\nl = list(map(int,input().split(' '))) \r\ns = 0 \r\nc = 0 \r\nfor i in range(0,len(l)) : \r\n if l[i] <= a2 : \r\n s += l[i] \r\n if s > a3 : \r\n s=0 \r\n c += 1 \r\nprint(c)", "n,b,d = map(int,input().split())\r\na = list(map(int,input().split()))\r\ncur = 0\r\nans = 0\r\nfor i in a:\r\n if i>b:\r\n continue\r\n cur += i\r\n if cur>d:\r\n ans += 1\r\n cur = 0\r\nprint(ans)", "y=list(map(int,input().split()))\r\nm=list(map(int,input().split())) \r\nsum=0\r\nc=0\r\nans=\"No\"\r\nfor i in m:\r\n if (y[0]==1):\r\n if (i<=y[1] and i>y[2]):\r\n print(1)\r\n ans=\"Yes\"\r\n else:\r\n print(0)\r\n ans=\"Yes\" \r\n else:\r\n if (i>y[1]):\r\n continue\r\n else:\r\n sum+=i\r\n if (sum>y[2]):\r\n sum=0\r\n c+=1 \r\nif (ans!=\"Yes\"): \r\n print(c) ", "\r\nn, b, d = map(int, input().split())\r\norange_sizes = list(map(int, input().split()))\r\n\r\n\r\ntotal_size = 0\r\nemptied_count = 0\r\n\r\n\r\nfor orange_size in orange_sizes:\r\n \r\n if orange_size <= b:\r\n total_size += orange_size\r\n \r\n if total_size > d:\r\n emptied_count += 1\r\n total_size = 0\r\n\r\nprint(emptied_count)\r\n", "n, b, d = list(map(int, input().split()))\r\na = list(map(int, input().split()))\r\ncur = 0\r\nres = 0\r\nfor i in a:\r\n if i <= b:\r\n cur += i\r\n if cur > d:\r\n res += 1\r\n cur = 0\r\nprint(res)\r\n", "n, b, d = map(int, input().split())\na = map(int, input().split())\nsm = 0\nans = 0\nfor i in a:\n if i <= b:\n sm += i\n if sm > d:\n ans += 1\n sm = 0\nprint(ans)\n", "n , d , max_a = input().split()\r\na = input().split()\r\nx = 0\r\nsum = 0\r\nfor i in a :\r\n \r\n if int(i) > int(d) :\r\n continue\r\n sum = sum + int(i)\r\n if sum > int(max_a) :\r\n sum = 0\r\n x += 1\r\n continue\r\n\r\nprint(x)", "n, b, d = map(int, input().split())\r\narr = list(map(int, input().split()))\r\nx = 0\r\ny = 0\r\nfor i in arr:\r\n if i <= b:\r\n x += i\r\n if x > d:\r\n x = 0\r\n y += 1\r\nprint(y)", "n = list(map(int, input().split()))\r\norange = list(map(int, input().split()))\r\njuicer = 0\r\nwaste = 0\r\nsum = 0\r\nfor i in range (len(orange)):\r\n if(orange[i] <= n[1]):\r\n juicer += orange[i]\r\n if(orange[i] <= n[2]):\r\n sum += orange[i]\r\n if(sum > n[2]):\r\n waste += 1\r\n sum = 0\r\n else: continue\r\nprint(waste)", "(n, b, d) = input().split()\nn = int(n)\nb = int(b)\nd = int(d)\noranges = input().split()\nfor i in range(n):\n oranges[i] = int(oranges[i])\ntotal_d = 0\noverflow = 0\nfor orange in oranges:\n if orange > b:\n continue\n total_d += orange\n if total_d > d:\n total_d = 0\n overflow += 1\nprint(overflow)\n", "import sys\r\n\r\ndef main():\r\n n, b, d, *l = map(int, sys.stdin.read().strip().split())\r\n c, s = 0, 0\r\n for i in l:\r\n if i <= b:\r\n s += i\r\n if s > d:\r\n c += 1\r\n s = 0\r\n return c\r\n\r\nprint(main())", "n,b,d = [int(l) for l in input().split(' ')]\r\nsizes = [int(k) for k in input().split(' ')]\r\nwaste = []\r\nempty = 0\r\nfor orange in sizes :\r\n if orange <= b :\r\n waste.append(orange)\r\n if sum(waste)>d:\r\n empty +=1\r\n waste = []\r\nprint(empty)", "number_of_oranges, max_orange_size, waste_limit = map(int, input().split())\ntimes_waste_was_cleaned = 0\ntotal_size_squeezed = 0\nfor orange_size in input().split():\n orange_size = int(orange_size)\n if orange_size > max_orange_size:\n continue\n total_size_squeezed += orange_size\n if total_size_squeezed > waste_limit:\n times_waste_was_cleaned += 1\n total_size_squeezed = 0\nprint(times_waste_was_cleaned)\n", "n, b, d = map(int, input().split())\ncounter = 0\ntotal = 0\na = [int(x) for x in input().split()]\nfor orange in a:\n if orange <= b:\n total += orange\n if total > d:\n counter += 1\n total = 0\nprint(counter)", "# -*- coding:utf-8 -*-\nfrom typing import List\n\n\ndef Juicer(A:List[int], b:int, d:int)->int:\n # write code here\n tmp_A = []\n for item in A:\n if item <= b:\n tmp_A.append(item)\n count = 0\n _sum = 0\n for item in tmp_A:\n _sum += item\n if _sum > d:\n _sum = 0\n count += 1\n return count\n\n\nif __name__ == '__main__':\n n,b,d = map(int, input().split())\n L = list(map(int, input().split()))\n print(Juicer(L, b, d))\n \t\t\t\t \t \t \t\t \t\t \t \t\t\t \t", "n, b, d = map(int, input().split())\r\ncount = 0\r\nk = 0\r\ns = input().split()\r\nfor a in s:\r\n if int(a) <= b:\r\n k += int(a)\r\n if k > d:\r\n k = 0\r\n count += 1\r\nprint(count)\r\n", "_ , b , d = list( map(int , input().split()) )\r\noranges = list( map(int , input().split()) )\r\nthrow = 0\r\ncur_juice = 0\r\nfor orange in oranges:\r\n \r\n if orange > b:\r\n continue\r\n cur_juice += orange\r\n if cur_juice > d:\r\n throw+= 1\r\n cur_juice = 0\r\n\r\nprint(throw)", "n,b,d = map(int,input().split(' '))\r\narr = list(map(int,input().split(' ')))\r\n\r\ntotal = 0 \r\ncount = 0\r\nfor i in arr:\r\n if i < b+1:\r\n total+=i\r\n if total > d:\r\n count+=1\r\n total = 0\r\n\r\nprint(count)\r\n", "n, b, d = list( map(int, input().split()) )\r\na = list( map(int, input().split()) )\r\n\r\nwaste = 0\r\nnum = 0\r\nfor i in a:\r\n if i <= b:\r\n waste += i\r\n if waste > d:\r\n num += 1\r\n waste = 0\r\n\r\nprint(num)\r\n", "n,b,d=map(int,input().split())\r\na=list(map(int,input().split()))\r\nc=0\r\ne=0\r\nfor i in a:\r\n if i<=b:\r\n c+=i\r\n if c>d:\r\n e+=1\r\n c=0\r\nprint(e)", "from time import sleep as sle\r\nfrom math import *\r\nfrom random import randint as ri\r\n \r\ndef gcd(a,b):\r\n\tif a == b:\r\n\t\treturn a\r\n\telif a > b:\r\n\t\treturn gcd(a-b,b)\r\n\telse:\r\n\t\treturn gcd(b,a)\r\n\r\ndef solve():\r\n\tn,b,d = map(int,input().split())\r\n\tans,w = 0,0\r\n\tfor ai in map(int,input().split()):\r\n\t\tif ai <= b:\r\n\t\t\tw += ai\r\n\t\t\tif w > d:\r\n\t\t\t\tans += 1\r\n\t\t\t\tw = 0\r\n\tprint(ans)\r\n\r\nsolve()", "first_line = input()\r\nb = int(first_line.split()[1])\r\nd = int(first_line.split()[2])\r\n\r\noranges = input().split()\r\n\r\nans = 0\r\ntotal_size = 0\r\nfor orange in oranges:\r\n size = int(orange)\r\n if size > b:\r\n continue\r\n else:\r\n total_size += size\r\n \r\n if total_size > d:\r\n ans += 1\r\n total_size = 0\r\nprint(ans)\r\n ", "num_of_oranges , max_capacity , waste_thresh = [int(x) for x in input().split()]\r\n\r\norange_sizes = [int(x) for x in input().split()]\r\n\r\ncounter = 0\r\nwaste = 0\r\n\r\nfor orange in orange_sizes:\r\n \r\n if orange > max_capacity:\r\n continue\r\n \r\n waste += orange\r\n \r\n if waste > waste_thresh:\r\n counter += 1\r\n waste = 0\r\n \r\n \r\nprint(counter)\r\n", "n, b, d = map(int, input().split())\r\na = [int(x) for x in input().split()]\r\ncount = 0\r\ntotal_size = 0 \r\n\r\nfor i in range(len(a)):\r\n if a[i] > b:\r\n continue\r\n\r\n total_size += a[i]\r\n\r\n if total_size > d:\r\n count += 1\r\n total_size = 0 \r\n\r\nprint(count)\r\n", "n, b, d = map(int, input().split())\r\na = list(map(int, input().split()))\r\nc = 0\r\nans = 0\r\nfor e in a:\r\n if e > b:\r\n continue\r\n c += e\r\n if c > d:\r\n c = 0\r\n ans += 1\r\nprint(ans)\r\n", "n,b,d = list(map(int,input().split()))\r\na = list(map(int,input().split()))\r\nans = 0\r\ncounter = 0\r\nfor i in a:\r\n counter += i if i <= b else 0\r\n if counter > d:\r\n counter = 0\r\n ans += 1\r\nprint(ans)", "import enum\r\nimport sys\r\n\r\n#---------------------------------\r\ndef get_ints(): return list(map(int, sys.stdin.readline().strip().split()))\r\ndef get_string(): return sys.stdin.readline().strip()\r\n\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,b,d = get_ints()\r\nls = get_ints()\r\nres=0\r\nsum=0\r\nfor i in ls:\r\n \r\n if i <=b:\r\n sum+=i\r\n if sum>d:\r\n res+=1\r\n sum=0\r\nprint(res)\r\n\r\n \r\n", "n, b, d = [int(i) for i in input().split()]\r\na = [int(i) for i in input().split() if int(i) <= b]\r\nford = 0\r\ntimes = 0\r\nfor i in a:\r\n ford += i\r\n if ford > d:\r\n times += 1\r\n ford = 0\r\n\r\nprint(times)\r\n ", "n, b, d = map(int, input().split())\r\nalist = [int(x) for x in input().split()]\r\namount = 0\r\nempty = 0\r\nfor i in range(n):\r\n if alist[i] <= b:\r\n if amount + alist[i] <= d:\r\n amount += alist[i]\r\n else:\r\n amount = 0\r\n empty += 1\r\nprint(empty)", "n,b,d = [int(j) for j in input().split()]\r\nlist_of_oranges = [int(i) for i in input().split()]\r\nnew_list_of_oranges = [z for z in list_of_oranges if z<=b]\r\n\r\nwaste = 0\r\ntotal = 0\r\nfor i in new_list_of_oranges:\r\n total += i\r\n if total > d:\r\n waste+=1\r\n total = 0\r\nprint(waste)\r\n", "n,b,d= map(int,input().split())\r\narr=list(map(int,input().split()))\r\ns=c=0\r\nfor i in range(n):\r\n if arr[i]>b:\r\n continue\r\n s+=arr[i]\r\n if s>d:\r\n s=0\r\n c+=1\r\n\r\nprint(c)", "num,min_size,store=map(int,input().split())\r\narray=list(map(int,input().split()))\r\ntotal=0\r\nclean=0\r\nfor i in array:\r\n if i<=min_size:\r\n total+=i\r\n if total>store:\r\n total=0\r\n clean+=1\r\nprint(clean)\r\n", "n,b,d=map(int,input().split())\r\nc,s=0,0\r\na=[int(x) for x in input().split()]\r\nfor i in range(n):\r\n if a[i]<=b:\r\n s+=a[i]\r\n if s>d:\r\n c+=1\r\n s=0\r\nprint(c)", "# -*- coding:utf-8 -*-\nfrom typing import List\n\n\ndef Juicer(A:List[int], b:int, d:int)->int:\n # write code here\n s=0\n times=0\n for x in A:\n if x<=b:\n s+=x\n if s>d:\n times+=1\n s=0\n return times\n\n\n\nif __name__ == '__main__':\n n,b,d = map(int, input().split())\n L = list(map(int, input().split()))\n print(Juicer(L, b, d))\n\t\t \t\t\t\t \t\t \t\t\t\t \t\t\t \t\t \t\t", "### Strings always win!\r\nY = input().split()\r\nQ = list(map(int, input().split())) # The list of sizes of oranges\r\n(n, b, d) = (int(Y[0]), int(Y[1]), int(Y[2]))\r\n\r\n# Let's remove oranges that have a size > b\r\nk =[]\r\nfor i in range(n):\r\n if Q[i] > b:\r\n k.append(i)\r\nfor q in range(len(k)):\r\n Q.pop(k[q]-q)\r\n\r\nM = 0\r\nA = 0\r\nfor c in Q:\r\n A += c\r\n if A > d:\r\n A = 0\r\n M += 1\r\n\r\nprint(M)", "n, b, d = map(int, input().split())\r\n\r\na = list(map(int, input().split()))\r\n\r\njuicer = count = 0\r\n\r\nfor i in a:\r\n if i <= b:\r\n juicer += i\r\n\r\n if juicer > d:\r\n juicer = 0\r\n count += 1\r\n\r\nprint(count)\r\n", "n, b, d = [int(v) for v in input().split()]\na = [int(v) for v in input().split()]\nacc, ans = 0, 0\nfor ai in a:\n if ai > b:\n continue\n elif ai + acc > d:\n ans += 1\n acc = 0\n else:\n acc += ai\nprint(ans)\n", "n,b,d=[int(i1) for i1 in input().split()]\r\na=[int(i2) for i2 in input().split()]\r\ncnt=0\r\nwaste=0\r\nfor z in a:\r\n if z<=b:\r\n waste+=z\r\n if waste>d:\r\n waste=0\r\n cnt+=1\r\nprint(cnt)", "n,b,d=map(int,input().split())\r\ninput_stream=[int(i) for i in input().split()]\r\ns=0\r\nres=0\r\nfor i in range(n):\r\n if input_stream[i]<=b:\r\n s=s+input_stream[i]\r\n if s>d:\r\n s=0\r\n res+=1\r\nprint(res)", "n,h,d = input().split()\nn = int(n) ; h = int(h) ; d = int(d)\no = input()\nx = o.split()\ncnt = 0 \nsum = 0 \nfor i in range(len(x)): \n x[i] = int(x[i])\n if x[i] <= h : \n sum+= x[i]\n if sum > d : \n cnt+=1 \n sum = 0 \n\nprint(cnt)\n\n\n\t\t\t \t\t\t\t \t \t\t\t\t \t \t \t \t \t", "n,b,d=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nsum=0\r\ncount=0\r\nfor i in l:\r\n if i<=b:\r\n sum+=i\r\n if sum>d:\r\n count+=1\r\n sum=0\r\nprint(count)\r\n", "def main():\r\n n,b,d = [int(x) for x in input().split(\" \")]\r\n oranges = [int(x) for x in input().split(\" \")]\r\n res = 0\r\n size = 0\r\n for i in range(n):\r\n if oranges[i] <= b:\r\n size += oranges[i]\r\n if size > d:\r\n res += 1\r\n size = 0\r\n print(res)\r\n\r\n\r\n\r\n\r\nif __name__ == '__main__':\r\n main()", "n, b, d = map(int, input().split())\r\na = list(map(int, input().split()))\r\ntotal = 0\r\ncount = 0\r\nfor i in a:\r\n if i <= b:\r\n total += i\r\n if total > d:\r\n count += 1\r\n total = 0\r\nprint(count)", "n, b, d = map(int, input().split())\r\noranges = list(map(int, input().split()))\r\nstore = 0\r\ncounter = 0\r\nfor i in oranges:\r\n if i <= b:\r\n store += i\r\n if store > d:\r\n counter += 1\r\n store = 0\r\nprint(counter)\r\n", "n, b, d = map(int, input().split())\r\noranges = [int(x) for x in input().split()]\r\nwaste = 0\r\nans = 0\r\n\r\nfor i in range(n):\r\n if oranges[i] > b:\r\n continue\r\n else:\r\n waste += oranges[i]\r\n\r\n if waste > d:\r\n ans += 1\r\n waste = 0\r\n\r\nprint(ans)", "n,b,d=input().split()\nn=int(n)\nb=int(b)\nd=int(d)\noranges=input()\nx=oranges.split()\ncnt=0\nsum=0\nfor i in range(len(x)):\n x[i]=int(x[i])\n if(x[i]<=b):\n sum+=x[i]\n if sum>d:\n cnt+=1\n sum=0\nprint(cnt)\n \t \t \t\t\t\t\t\t\t\t \t\t\t \t \t\t \t \t \t", "x,y,z=input().split()\nx=int(x)\ny=int(y)\nz=int(z)\nc=input()\nd=c.split()\ncnt=0\nm=0\nfor i in range(len(d)):\n d[i]=int(d[i])\n if d[i]<=y:\n cnt+=d[i]\n if cnt>z:\n m+=1\n cnt=0\nprint(m)\n \t \t\t \t \t\t\t\t \t\t\t\t\t\t\t \t \t\t\t\t\t", "n, sz, waste_max = map(int, input().split())\r\nls = list(map(int, input().split()))\r\n\r\nwaste = 0\r\nct = 0\r\n\r\nfor i in ls :\r\n if i <= sz : \r\n waste += i\r\n if waste > waste_max : \r\n waste = 0\r\n ct += 1\r\n\r\n\r\nprint(ct)", "n, b, d = map(int, input().split())\r\noranges = list(map(int, input().split()))\r\nvol = 0\r\ncl = 0\r\nfor orange in oranges:\r\n if orange > b:\r\n continue\r\n else:\r\n vol += orange\r\n if vol > d:\r\n cl += 1\r\n vol = 0\r\nprint(cl)", "n,b,d = map(int,input().split())\r\nl = list(map(int,input().split()))\r\ncollect = 0\r\nempty = 0\r\nfor i in range(n):\r\n if l[i] <= b:\r\n collect += l[i]\r\n if collect > d:\r\n empty += 1\r\n collect = 0\r\nprint(empty)", "oranges_number,juicer_size,box_condition = list(map(int,input().split()))\r\n\r\ns = list(map(int,input().split()))\r\nn = 0\r\nc = 0\r\nf = 0\r\nfor i in s:\r\n if s[c] <= int(juicer_size):\r\n f += s[c] # 2 \r\n if f > box_condition: #0 + 1\r\n n+=1\r\n f = 0\r\n c+= 1 #1 1\r\nprint(n) \r\n\r\n", "n,b,d=list(map(int ,input().split()))\r\narray=list(map(int ,input().split()))\r\nsample=0\r\ncount=0\r\nfor j in range(0,len(array)):\r\n\tif(1==1 and array[j]<=b):\r\n\t\tsample+=array[j]\r\n\telse:\r\n\t\tcontinue \r\n\t# print(sample)\r\n\tif(sample>d):\r\n\t\tcount+=1\r\n\t\tsample=0\r\n\telse:\r\n\t\tcount+=0\r\n\r\nprint(count)", "\n\n\n\n# Press the green button in the gutter to run the script.\nimport math\nfrom builtins import input, print\nimport collections\nfrom fractions import Fraction\nfrom math import gcd\nimport math\n\nif __name__ == '__main__':\n n, b, d = [int(x) for x in input().split(\" \")]\n oranges = [int(x) for x in input().split(\" \")]\n res = 0\n size = 0\n for i in range(n):\n if oranges[i] <= b:\n size += oranges[i]\n if size > d:\n res += 1\n size = 0\n print(res)\n\n # no_orange, size, tank = [int(x) for x in input().split(\" \")]\n # orange = [int(x) for x in input().split(\" \")]\n # counter = 0\n # empty = 0\n #\n # for i in range(no_orange):\n # if (orange[i] <= size):\n # counter += orange[i]\n # if counter > size:\n # empty += 1\n # counter = 0\n # print(empty)\n #\n\n\n\n\n\n# See PyCharm help at https://www.jetbrains.com/help/pycharm/\n", "#!/usr/local/bin/python3\r\n\r\nn, b, d = tuple(map(int, input().split(' ')))\r\nres = 0\r\ncurrent_volume = 0\r\n\r\nfor x in map(int, input().split(' ')):\r\n if x > b:\r\n continue\r\n current_volume += x\r\n if current_volume > d:\r\n current_volume = 0\r\n res += 1\r\nprint(res)\r\n \r\n", "n, b, d = map(int, input().split())\r\norange_sizes = list(map(int, input().split()))\r\n\r\ncount = 0 \r\nwaste_section = 0 \r\n\r\nfor orange_size in orange_sizes:\r\n if orange_size <= b:\r\n waste_section += orange_size \r\n if waste_section > d:\r\n count += 1\r\n waste_section = 0 \r\n\r\nprint(count)\r\n", "n,b,d = map(int,input().split())\r\na = list(map(int,input().split()))\r\nvolume = times = 0\r\nfor i in a:\r\n if i<=b:\r\n volume += i\r\n if volume>d:\r\n volume = 0\r\n times += 1\r\nprint(times)", "n, b, d = (int(i) for i in input().split())\na = (int(i) for i in input().split())\nres = cur = 0\nfor i in a:\n if i > b:\n continue\n cur += i\n if cur > d:\n res += 1\n cur = 0\nprint(res)\n", "inputs = list(map(int, input().split()))\r\n\r\nn, b, d = inputs[0], inputs[1], inputs[2]\r\n\r\n\r\ndo_empty = 0\r\nin_jucier = 0\r\n\r\na = list(map(int, input().split()))\r\nfor i in a:\r\n if i <= b:\r\n in_jucier += i\r\n if in_jucier > d:\r\n in_jucier = 0\r\n do_empty += 1\r\n \r\nprint(do_empty)", "n,b,d=map(int, input().split())\r\nl=list(map(int, input().split()))\r\nc=0\r\ns=0\r\nfor i in range(n):\r\n if l[i]<=b:\r\n s+=l[i]\r\n if s>d:\r\n c+=1\r\n s=0\r\nprint(c)", "n, b, d = map(int, input().split())\r\nl = list(map(int, input().split()))\r\nc, s = 0,0\r\nfor i in l:\r\n if i <= b:\r\n c += i\r\n if c > d:\r\n c = 0\r\n s += 1\r\nprint(s)", "n, b, d = map(int, input().split())\r\noranges = list(map(int, input().split()))\r\nsum = 0\r\nwaste = 0\r\nfor i in range(n):\r\n\tif oranges[i] <= b:\r\n\t\tsum += oranges[i]\r\n\t\tif sum > d:\r\n\t\t\tsum = 0\r\n\t\t\twaste += 1\r\n\r\nprint(waste)", "#https://codeforces.com/contest/709/problem/A\r\n\r\n\r\nn,b,d = input().split(' ')\r\n\r\nsize=int(b)\r\nrefill=int(d)\r\n\r\nsecond = [int(i) for i in input().split(' ')]\r\nsum1=0\r\nsum2=0\r\ncount=0\r\nfor i in second:\r\n if(i<=size):\r\n sum1+=i\r\n sum2+=i\r\n\r\n if(sum2>refill):\r\n sum2=0\r\n count+=1\r\n\r\n'''if(sum1>0):\r\n if(sum1%refill==0):\r\n print(sum1//refill-1)\r\n else:\r\n print(sum1//refill)'''\r\n\r\n\r\nprint(count)", "n,b,d=[int(i) for i in input().split()]\r\nl=[int(i) for i in input().split()]\r\nc=0\r\ns=0\r\nfor i in range(len(l)):\r\n if l[i]<=b and s<=d:\r\n s+=l[i]\r\n if s>d:\r\n c+=1\r\n s=0\r\nprint(c)", "n, b, d = map(int, input().split())\r\noranges = list(map(int, input().split()))\r\ntotal = 0\r\ncount = 0\r\nfor i in range(n):\r\n if oranges[i] <= b:\r\n total += oranges[i]\r\n if total > d:\r\n total = 0\r\n count += 1\r\n\r\nprint(count)", "n, b, d = map(int, input().split())\r\na = map(int, input().split())\r\nappropriate_oranges = filter(lambda x: x <= b, a)\r\nresult = waste = 0\r\n\r\nfor orange in appropriate_oranges:\r\n waste += orange\r\n if waste > d:\r\n result += 1\r\n waste = 0\r\n\r\nprint(result)\r\n", "n,b,d = map(int, input().split())\r\na = []\r\na = list(map(int, input().split()))\r\n\r\nsolan = 0\r\ntong = 0\r\nfor i in range(0,n):\r\n if a[i] <= b:\r\n tong += a[i]\r\n if tong > d:\r\n solan += 1\r\n tong = 0\r\n\r\nprint(solan)", "n, b, d = input().split()\r\na = list(map(int, input().split()))\r\ni = 0\r\nc = 0\r\ns = 0\r\nfor i in range(len(a)):\r\n if a[i] > int(b):\r\n pass\r\n else:\r\n s += a[i]\r\n if s > int(d):\r\n c += 1\r\n s = 0\r\nprint(c)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "# 709A - Juicer\r\n[n, b, d], l, c, a = list(map(int, input().split())), list(\r\n map(int, input().split())), 0, 0\r\nfor i in l:\r\n if i <= b:\r\n c += i\r\n if c > d:\r\n a += 1\r\n c = 0\r\nprint(a)\r\n", "n, b, d = map(int, input().split()) # Read input values as integers\r\noranges = list(map(int, input().split())) # Read the list of orange sizes\r\n\r\nto_be_emptied = 0 # Initialize the count of times to empty the waste section\r\ncurrent_size = 0 # Initialize the total size of oranges processed\r\n\r\nfor orange in oranges:\r\n if orange <= b: # Check if the orange can be put in the juicer\r\n current_size += orange # Add the orange size to the total size\r\n if current_size > d: # Check if the waste section needs to be emptied\r\n to_be_emptied += 1\r\n current_size = 0 # Reset the total size\r\n\r\nprint(to_be_emptied)\r\n", "n, b, d = list(map(int, input().split()))\noranges = list(map(int, input().split()))\ns = total = 0\nfor i in oranges:\n if i <= b:\n total += i\n if total > d:\n s += 1\n total = 0\nprint(s)\n\n", "n,b,d=map(int,input().split())\r\nli=list(map(int,input().split()))\r\ncount=0\r\nw=0\r\nfor x in range(n):\r\n if(li[x]<=b):\r\n w=w+li[x]\r\n if(d<w):\r\n count=count+1\r\n w=0\r\nprint(count)", "#\nimport sys\n\n###########\n\ndef solve():\n n, b, d = map(int, input().split())\n arr = list(map(int, input().split()))\n ans = 0; record = 0\n for i in range(n):\n if arr[i] <= b:\n record += arr[i]\n if record > d:\n ans += 1\n record = 0\n print(ans)\n\n########################################################################################################################\ndef main():\n t = 1# int(input())\n for _ in range(t):\n solve()\n\n\nif __name__ == \"__main__\":\n main()\n\n\t\t \t \t \t\t\t \t \t \t \t \t \t\t", "n,b,d=map(int,input().split())\r\narr=[int(c) for c in input().split()]\r\ntmp,res=0,0\r\nfor i in range(n):\r\n if arr[i]<=b:\r\n tmp+=arr[i]\r\n if tmp>d:\r\n tmp=0\r\n res+=1\r\nprint(res)", "n,b,d=map(int,input().split())\r\nm=list(map(int,input().split()))\r\nc=0\r\nk=0\r\nfor i in m:\r\n if i > b:\r\n continue\r\n elif i<=b:\r\n c+=i\r\n if c>d:\r\n k+=1\r\n c=0\r\n\r\nprint(k)", "# -*- coding:utf-8 -*-\nfrom typing import List\n\n\ndef Juicer(A:List[int], b:int, d:int)->int:\n ha = 0\n waste = 0\n ans = 0\n for i in A:\n if i > b:\n continue\n else:\n waste += i\n if waste > d:\n ans += 1\n waste = 0\n # write code here\n return ans\n\n\n\nif __name__ == '__main__':\n n,b,d = map(int, input().split())\n L = list(map(int, input().split()))\n print(Juicer(L, b, d))\n\t \t \t\t \t \t\t\t\t\t\t \t\t\t\t \t\t\t\t", "n, max_orange_size, max_total_size = map(int, input().split())\r\norange_sizes = list(map(int, input().split()))\r\ntotal_size = 0\r\ncount = 0\r\nfor orange in orange_sizes:\r\n if orange <= max_orange_size:\r\n total_size += orange\r\n if total_size > max_total_size:\r\n count += 1\r\n total_size = 0\r\n\r\nprint(count)", "\r\nres = list(input().split())\r\nres2 = list(input().split())\r\n\r\nres=list(map(int,res))\r\nres2=list(map(int,res2))\r\nsum=0\r\nv=0\r\n#if(res[2]>=res[0]):\r\nfor i in range(res[0]):\r\n if(res2[i]<=res[1]):\r\n sum+=res2[i]\r\n if(sum>res[2]):\r\n sum=0\r\n v+=1\r\n\r\nprint(v)\r\n\r\n#l=list(map(int, input().split()))\r\n#l.sort()\r\n#print(min(sum_n1_1,sum_n1_0)+min(sum_n2_1,sum_n2_0))'''\r\n", "# Author : //- kibrom Hailu -\\\\\r\n\r\nfrom sys import stdin,stdout\r\nfrom collections import Counter,defaultdict , deque \r\nfrom bisect import bisect , bisect_left ,bisect_right \r\nfrom itertools import accumulate \r\nfrom heapq import heapify , heappop , heappush , heappushpop , heapreplace\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\ndef solve():\r\n \r\n # write your code here \r\n n,b,d = II()\r\n oranges = IL() \r\n squeeze = 0\r\n sumval = 0\r\n for orange in oranges:\r\n if orange <= b:\r\n sumval += orange\r\n if sumval > d:\r\n squeeze += 1 \r\n sumval = 0 \r\n \r\n print(squeeze)\r\n \r\nsolve()\r\n", "n, b, d = list(map(int, input().split()))\r\nl = list(map(int, input().split()))\r\nempty = 0 # current waste section size\r\ntimes = 0 # how many times waste section has been emptied\r\nfor i in l:\r\n if i > b: # check orange size\r\n continue\r\n empty += i\r\n if empty > d: # check empty section\r\n empty = 0\r\n times += 1\r\nprint(times)", "n,b,d=map(int,input().split())\r\nv=list(map(int,input().split()))\r\ndd=0\r\nc=0\r\nfor i in v:\r\n if i > b:\r\n continue\r\n if dd > d:\r\n dd=0\r\n c+=1\r\n dd+=i\r\nelse:\r\n if dd > d:\r\n c+=1\r\nprint(c)\r\n", "n , b , d = input().split(' ')\r\nn , b , d = int(n) , int(b) , int(d)\r\noranges = list(filter(lambda x: x<=b,map(int,input().split())))\r\ntotal_sizes = sum(oranges)\r\nif total_sizes==0 or total_sizes<=d:\r\n print(0)\r\nelse:\r\n i = 0\r\n count = 0\r\n sum=0\r\n while i < len(oranges):\r\n sum+=oranges[i]\r\n if sum>d:\r\n count+=1\r\n sum=0\r\n i+=1\r\n print(count)", "n, b, d = list(map(int, input().split()))\r\na = list(map(int, input().split()))\r\n\r\nwaste = 0\r\ncurrent_waste_size = 0\r\n\r\nfor i in range(n):\r\n if a[i] <= b:\r\n current_waste_size += a[i]\r\n if current_waste_size > d:\r\n waste += 1\r\n current_waste_size = 0\r\n\r\nprint(waste)", "n, b, d = tuple([int(num) for num in input().split()])\narr = [int(num) for num in input().split()]\ncounter = 0\nwaste_level = 0\nfor orange in arr:\n\tif(orange <= b):\n\t\twaste_level += orange\n\t\tif(waste_level > d):\n\t\t\tcounter += 1\n\t\t\twaste_level = 0\nprint(counter)", "def checkSize(max_size, size):\n if max_size < size:\n return False\n return True\n\n\nn, max_size, d = [int(i) for i in input().split()]\ninJucier = 0\nresult = 0\nsizeList = input().split()\nfor i in range(n):\n size = int(sizeList[i])\n if checkSize(max_size, size):\n if inJucier + size > d:\n inJucier = 0\n result += 1\n else:\n inJucier += size\n\nprint(result)\n\n \t \t\t\t\t \t \t \t \t \t\t \t \t\t\t", "n,b,d=map(int,input().split())\r\na=map(int,input().split())\r\nc=0\r\nm=0\r\nfor i in a:\r\n if i > b:\r\n c+=0\r\n else :\r\n c+=i\r\n if c> d:\r\n m+=1\r\n c*=0\r\n \r\nprint(m) ", "messi=input()\nn,b,d=messi.split()\nn=int(n)\nb=int(b)\nd=int(d)\nwaste=0\ncount=0\nronaldo=input()\na=ronaldo.split()\nfor i in range(n):\n if int(a[i])<=b:\n waste=waste+int(a[i])\n if (waste>d):\n count=count+1\n waste=0\nprint(count)\n\t\t \t\t\t \t \t\t \t\t\t \t\t \t \t", "n,b,d=map(int,input().split())\r\nli=[int(x) for x in input().split()]\r\nsm=0\r\ncnt=0\r\nfor i in li:\r\n if i>b:\r\n continue\r\n else:\r\n sm+=i\r\n if sm>d:\r\n cnt+=1\r\n sm=0\r\nprint(cnt)", "\r\norange_number,juicer,waste = list(map(int, input().split()))\r\nls = list(map(int, input().split()))\r\ntemp = 0\r\nnum=0\r\n\r\nfor i in ls :\r\n if i <= juicer:\r\n temp+= i\r\n if temp> waste:\r\n temp = 0\r\n num+=1\r\n \r\nprint(num)\r\n", "nOranges, sizeOfJuicer, maxWasteSection = list(map(int,input().split()))\r\nsizeOfWasteSection = nTimes = 0\r\nsOrange = list(map(int,input().split()))\r\nfor i in range(nOranges):\r\n if sOrange[i] <= sizeOfJuicer:\r\n sizeOfWasteSection += sOrange[i]\r\n if sizeOfWasteSection > maxWasteSection:\r\n sizeOfWasteSection = 0\r\n nTimes += 1\r\nprint(nTimes)", "n, b, d = map(int, input().split())\r\na = list(map(int, input().split()))[:n]\r\ncontainer = 0\r\ncount = 0\r\nfor i in a:\r\n if i > b:\r\n continue\r\n else:\r\n container += i\r\n if container > d:\r\n count += 1\r\n container = 0\r\nprint(count)\r\n", "n, b, d = [int(i) for i in input().split()]\r\noranges = [int(i) for i in input().split()]\r\n\r\ntrash = 0\r\ntrashed = 0\r\n\r\nfor i in oranges:\r\n if i <= b:\r\n trash += i\r\n if trash > d:\r\n trashed += 1\r\n trash = 0\r\n\r\nprint(trashed)\r\n", "n,b,d = input().split()\r\nn,b,d = [int(n),int(b),int(d)]\r\na=input().split()\r\na = [int(i) for i in a]\r\nemptyones = 0\r\nsum = 0\r\nfor i in a:\r\n if i <=b:\r\n sum+=i\r\n if sum >d:\r\n emptyones+=1\r\n sum=0\r\n else:continue\r\nprint(emptyones)\r\n\r\n\r\n", "a,b,c = [int(i) for i in input().split()]\r\nres ,ans= 0,0\r\nv = [int(i) for i in input().split()]\r\nfor i in v:\r\n if i <= b : res+=i\r\n if res > c: res = 0; ans+=1\r\nprint(ans) ", "num, maxS, cap = map(int, input().split())\nornz = [int(x) for x in input().split()][:num]\nwasteSec, cleanse = 0, 0\nfor i in range(num):\n\tif ornz[i] <= maxS:\n\t\twasteSec += ornz[i]\n\telse:\n\t\tcontinue\n\tif wasteSec > cap:\n\t\tcleanse += 1\n\t\twasteSec = 0\nprint(cleanse)\n\t\t \t\t\t \t \t\t \t \t\t \t\t \t", "n, b, d = map(int, input().split())\r\nc = 0\r\ns = 0\r\nfor num in map(int, input().split()):\r\n if num <= b:\r\n s+=num\r\n if s > d:\r\n s = 0\r\n c += 1\r\nprint(c)", "n, b, d = (map(int, input().split()))\r\nli = list(map(int, input().split()))\r\ns = 0\r\nc = 0\r\nfor i in range(n):\r\n if li[i] <= b:\r\n s += li[i]\r\n if s > d:\r\n c += 1\r\n s = 0\r\n \r\nprint(c)", "if __name__ == \"__main__\":\n n, b, d = [int(n) for n in input().split()]\n a = [int(n) for n in input().split()]\n curr_amount_juiced = 0\n num_empties = 0\n for o in a:\n if o > b:\n continue\n else:\n curr_amount_juiced += o\n if curr_amount_juiced > d:\n num_empties += 1\n curr_amount_juiced = 0\n print(num_empties)\n", "n, b, d = map(int, input().split())\r\n\r\nors = list(map(int, input().split()))\r\n\r\nwaste = 0\r\n\r\ncnt = 0\r\n\r\nfor i in range(n):\r\n if ors[i] <= b:\r\n waste += ors[i]\r\n \r\n if waste > d:\r\n cnt += 1\r\n waste = 0\r\n \r\nprint(cnt)", "# A. Juicer\r\n\r\nfrom collections import Counter\r\n\r\nn, b, d = map(int, input().split())\r\na = list(map(int, input().split()))\r\n\r\nans = 0\r\n\r\nsm = 0\r\nfor orange in a:\r\n if orange <= b:\r\n sm += orange\r\n if sm > d:\r\n ans += 1\r\n sm = 0\r\n\r\nprint(ans)\r\n", "n,b,d = map(int,input().split())\r\na = list(map(int,input().split()))\r\nans = 0\r\nws = 0\r\n\r\nfor i in range(n):\r\n if a[i] <= b:\r\n ws += a[i] \r\n if ws > d :\r\n ws = 0\r\n ans += 1\r\n \r\nprint(ans)\r\n ", "n, b, d = map(int, input().split())\r\ns = list(map(int, input().split()))\r\ne = 0\r\nl = 0\r\nfor i in range(n):\r\n if s[i] <= b:\r\n l += s[i]\r\n if l > d:\r\n l = 0\r\n e += 1\r\nprint(e)", "NUM= list(map(int,input().split()))\r\nOrange= list(map(int,input().split()))\r\n\r\nn=0\r\nWaste =0\r\n\r\n\r\nfor i in range(0,NUM[0]):\r\n if(Orange[i]<=NUM[1]):\r\n Waste+=Orange[i]\r\n if(Waste>NUM[2]):\r\n n+=1\r\n Waste=0\r\n\r\nprint(n)", "a = [int(x) for x in input().split()]\r\nb = [int(x) for x in input().split()]\r\ncounter = 0\r\nwaste = 0\r\nfor i in range(a[0]):\r\n if b[i] <= a[1]:\r\n counter += b[i]\r\n if counter > a[2]:\r\n waste += 1\r\n counter = 0\r\nprint(waste)", "n , b, d = [int(x) for x in input().split(\" \")]\r\norangs = [int(x) for x in input().split(\" \") if int(x) <= b]\r\n\r\nsize = empty = 0\r\nfor x in orangs :\r\n\tsize += x\r\n\tif size > d :\r\n\t \tsize = 0\r\n\t \tempty += 1\r\n \t\r\nprint(empty)", "n,b,d=input().split()\nans=0\nsize=0\nn=int(n)\nb=int(b)\nd=int(d)\na = list(map(int,input().strip().split()))[:n]\nfor i in a:\n if(i>b):\n continue\n else:\n size=size+i\n if(size>d):\n ans=ans+1\n size=0\nprint(ans)\n\t \t \t\t \t \t\t \t \t \t\t", "n, b, d = [int(i) for i in input().split()]\r\na = [int(i) for i in input().split()]\r\nsum=0\r\ncl=0\r\nfor i in range(n):\r\n\r\n if a[i]<=b:\r\n sum+=a[i]\r\n if sum>d:\r\n cl+=1\r\n sum=0\r\nprint(cl)", "import sys\r\ndef input():\r\n return sys.stdin.readline()\r\nn, b, d = list(map(int, input().split()))\r\narr = list(map(int, input().split()))\r\n\r\ncounter = 0\r\nsumm = 0\r\nfor i in arr:\r\n if i <= b: summ += i\r\n if summ > d: summ = 0; counter += 1\r\nprint(counter)", "n, b, d = map(int, input().split())\r\narray = list(map(int, input().split()))\r\nc = 0\r\ntotal = 0\r\nfor x in array:\r\n if x <= b:\r\n total += x\r\n if total > d:\r\n total = 0\r\n c += 1\r\nprint(c)\r\n", "n, b, d = [int(i) for i in input().split()]\r\n\r\nsizes = [int(i) for i in input().split()]\r\n\r\nover = 0\r\ncntr = 0\r\nfor a in range(len(sizes)):\r\n if sizes[a] <= b:\r\n cntr += sizes[a]\r\n if cntr > d:\r\n cntr = 0\r\n over += 1\r\n\r\nprint(over)\r\n\r\n", "n, b, d = map(int, input().split())\r\na = list(map(int, input().split()))\r\nwaste = 0\r\nempty = 0\r\n\r\nfor i in range(len(a)):\r\n if a[i] <= b:\r\n waste += a[i]\r\n if waste > d:\r\n empty += 1\r\n waste = 0\r\n\r\nprint(empty)", "n, b, d = map(int, input().split())\na = map(int, input().split())\nres = x = 0\nfor o in a:\n if o <= b:\n x += o\n if x > d:\n res += 1\n x = 0\nprint(res)\n", "n, b, d = [int(i) for i in input().split()]\na = [int(i) for i in input().split()]\n\ncount = 0\nsumi = 0\nfor i in range(n):\n if a[i] > b:\n continue\n sumi += a[i]\n if sumi > d:\n sumi = 0\n count += 1\nprint(count)", "n, b, d = list(map(int, input().split()))\r\na = list(map(int, input().split()))\r\no = 0\r\nt = 0\r\nfor item in a:\r\n if item > b:\r\n continue\r\n elif item <= b:\r\n o += item\r\n if o > d:\r\n t += 1\r\n o = 0\r\nprint(t)\r\n", "n, b, d = map(int, input().split())\r\n\r\nnums = list(map(int, input().split()))\r\n\r\n\r\n\r\n\r\nwaste = 0\r\njuicer = 0\r\n\r\nfor num in nums:\r\n if num > b:\r\n continue\r\n waste += num\r\n if waste > d:\r\n juicer += 1\r\n waste = 0\r\n\r\nprint(juicer)", "n, juicer, wasteLimit = input().split()\nn = int(n)\njuicer = int(juicer)\nwasteLimit = int(wasteLimit)\n\noranges = list(map(int, input().split()))\n\nbasket = 0\ncounter = 0\n\nfor i in range(n):\n if oranges[i] <= juicer:\n basket += oranges[i] \n if basket > wasteLimit:\n basket = 0\n counter += 1 \nprint(counter)\n\t\t \t\t \t\t \t \t \t\t \t \t\t \t\t", "import sys\n\nn, b, d = map(lambda x: int(x), input().split(\" \"))\n\nj = 0\nans = 0\noranges = map(lambda x: int(x), input().split(\" \"))\n\nfor o in oranges:\n if o > b:\n continue\n j += o\n if j > d:\n ans += 1\n j = 0\n\nprint(ans)\n", "n,b,d=map(int,input().split())\r\nsize=list(map(int,input().split()))\r\nin_=0\r\ncounter=0\r\nfor i in size:\r\n if i>b:\r\n continue\r\n else:\r\n in_+=i\r\n if in_>d:\r\n counter+=1\r\n in_=0\r\nprint(counter) ", "n,b,d=map(int,input().split());c,s=0,0\r\nfor i in map(int,input().split()):\r\n\tif i<=b:s+=i\r\n\tif s>d:c+=1;s=0\r\nprint(c)", "s = list(map(int , input().split()))\r\nk = list(map(int , input().split()))\r\nn = 0\r\ncount = 0\r\nfor i in range(len(k)):\r\n if k[i] <= s[1] :\r\n n += k[i]\r\n\r\n if n > s[2] :\r\n count += 1\r\n n = 0\r\nprint(count)", "n, b, d = [int(x) for x in input().split()]\r\na = [int(x) for x in input().split()]\r\n\r\nans = 0\r\nc = 0\r\n\r\nfor x in a:\r\n if x <= b:\r\n c += x\r\n if c > d:\r\n ans += 1\r\n c = 0\r\n\r\nprint(ans)", "# -*- coding:utf-8 -*-\r\nfrom typing import List\r\ndef Juicer(A:List[int], b:int, d:int)->int:\r\n # write code here\r\n ans = 0\r\n sum = 0\r\n for a in A:\r\n if a <= b:\r\n sum += a\r\n if sum > d:\r\n ans += 1\r\n sum = 0\r\n return ans\r\n\r\n\r\ndef main():\r\n examples = [\r\n ([5, 6], 7, 10),\r\n ([7], 5, 3),\r\n ([5,7,7], 10, 10),\r\n ([1], 1, 1)\r\n ]\r\n for example in examples:\r\n out = Juicer(*example)\r\n print(out)\r\n\r\n\r\nif __name__ == '__main__':\r\n # main()\r\n n,b,d = map(int, input().split())\r\n L = list(map(int, input().split()))\r\n print(Juicer(L, b, d))", "_, max_size, max_waste = map(int, input().split())\noranges = map(int, input().split())\nempties = 0\nwaster = 0\nfor orange in oranges:\n if orange > max_size:\n continue\n waster += orange\n if waster > max_waste:\n empties += 1\n waster = 0\nprint(empties)\n", "number = input().split(\" \")\r\nN,B,D = int(number[0]),int(number[1]),int(number[2])\r\nlist_number = [int(i) for i in input().split(\" \")]\r\ntotal = count = 0\r\nfor num in list_number:\r\n if num <= B:\r\n total+=num\r\n if total > D:\r\n count+=1\r\n total = 0\r\nprint(count)", "u = list(map(int,input().split()))\r\nm = list(map(int,input().split()))\r\n\r\nx = 0 \r\ny = 0 \r\nsum = 0 \r\nfor i in range(u[0]):\r\n if u[1] >= m[i]:\r\n x = m[i]\r\n y += x \r\n if y > u[2]:\r\n sum += 1\r\n y = 0\r\n\r\n x = 0 \r\nprint(sum)", "n, b, d = map(int, input().split())\r\na = [int(i) for i in input().split()]\r\nk=0\r\nf=0\r\n\r\nfor i in a:\r\n if i<=b:\r\n f+=i\r\n if f>d:\r\n k+=1\r\n f=0\r\nprint(k)", "count_time=False\r\nif count_time:\r\n import time\r\n start_time = time.time()\r\n#-----------------------------------------\r\nn,b,d=map(int,input().split())\r\na=list(map(int,input().split()))\r\ne=0\r\nt=0\r\nfor i in a:\r\n if i<=b:\r\n if e>d:\r\n t+=1\r\n e=0\r\n e+=i\r\nif e>d:\r\n t+=1\r\n e=0\r\nprint(t)\r\n#------------------------------------------\r\nif count_time:\r\n end_time = time.time()\r\n print('----------------\\nRunning time: {} s'\r\n .format(end_time - start_time))\r\n", "import sys\r\nfrom os import path\r\nif(path.exists('input.txt')):\r\n sys.stdin = open(\"input.txt\",\"r\")\r\n sys.stdout = open(\"output.txt\",\"w\")\r\n\r\nn,b,d=map(int, input().split())\r\nl=list(map(int, input().split()))\r\nd1=0\r\nc=0\r\nfor i in range(n):\r\n if l[i]<=b:\r\n d1+=l[i]\r\n if (d1>d):\r\n c+=1\r\n d1=0\r\nprint(c)", "n, b, d = map(int, input().split())\r\nr = d\r\na = list(map(int, input().split()))\r\n\r\ni = 0\r\ncount = 0\r\nwhile i < len(a):\r\n\r\n if a[i] <= b:\r\n d= d - a[i]\r\n\r\n if d < 0:\r\n d = r\r\n\r\n count += 1\r\n i += 1\r\nprint(count)\r\n", "n,b,d = map(int, input().split())\noranges = list(map(int, input().split()))\n\njuiceCapacity = 0\nemptys = 0\n\nfor i in range(n):\n o = oranges[i]\n if o > b:\n continue\n elif juiceCapacity + o > d:\n emptys += 1\n juiceCapacity = 0\n else:\n juiceCapacity += o\nprint(emptys)\n \n", "n , b , d = map(int , input().split())\na =list(input().split())\nfor i in range(len(a)):\n a[i]=int(a[i])\ncount =0\nx=0\nfor i in a:\n if i<=b:\n x+=i\n if x>d:\n count+=1\n x=0\nprint(count) ", "number_of_oranges, orange_limit_size, waste_limit = map(int, input().split())\n\namount_waste = 0\ntimes_cleaning = 0\noranges = map(int, input().split())\n\nfor orange in oranges:\n if orange <= orange_limit_size:\n amount_waste += orange\n \n if amount_waste > waste_limit:\n times_cleaning += 1\n amount_waste = 0\n\nprint(times_cleaning)", "n, b, d = map(int, input().split()) \r\na = [int(i) for i in input().split()]\r\ncontainer = 0 \r\nk = 0\r\n\r\nfor i in range(n): \r\n if a[i] <= b:\r\n container += a[i]\r\n if container > d: \r\n container = 0\r\n k += 1\r\n\r\nprint(k)", "n,b,d=(int(x) for x in input().split())\r\ncount=0\r\ncountf=0\r\nl=[int(x) for x in input().split()]\r\nfor i in l:\r\n if(i<=b):\r\n count=count+i\r\n if(count>d):\r\n countf=countf+1\r\n count=0\r\nprint(countf)\r\n", "arr = input().split(' ')\r\nn = int(arr[0])\r\nb = int(arr[1])\r\nd = int(arr[2])\r\n\r\narr = input().split(' ')\r\nwaste = 0\r\ncount = 0\r\nfor o in arr:\r\n oo = int(o)\r\n if oo > b:\r\n continue\r\n waste += oo\r\n if waste > d:\r\n count +=1\r\n waste = 0\r\nprint(count)", "n, b, d = map(int, input().split())\r\na = list(map(int, input().split()))\r\ncount = 0; e = 0\r\nfor i in a:\r\n if i <= b:\r\n count += i\r\n if count > d:\r\n e += 1\r\n count = 0\r\nprint(e)\r\n\r\n\r\n\r\n", "params = input().split()\r\nn, b, d = int(params[0]), int(params[1]), int(params[2])\r\n\r\nsizes = input().split()\r\nsizes = [int(n) for n in sizes]\r\n\r\ntimes = int()\r\nwest_size = int()\r\nfor orange_size in sizes:\r\n if orange_size <= b:\r\n west_size += orange_size\r\n if west_size > d:\r\n west_size = 0\r\n times += 1\r\n\r\nprint(times)", "n,a,d=map(int, input().split())\r\nl=list(map(int, input().split()))\r\nc=0\r\nb=0\r\nfor i in (l):\r\n if i<=a:\r\n c+=i\r\n \r\n if c>d:\r\n b+=1\r\n c=0\r\nprint(b)", "n,b,d = map(int,input().split(' '))\r\na = list(map(int,input().split(\" \")))\r\nsumm = 0\r\nwastes = 0\r\nfor i in range(0,len(a)):\r\n if(a[i]<=b):\r\n summ += a[i]\r\n if(summ>d):\r\n wastes += 1\r\n summ = 0\r\n else:\r\n continue\r\nprint(wastes)", "import sys\r\n\r\ninput = lambda: sys.stdin.readline().rstrip()\r\n\r\ndef main():\r\n m,b,d = [int(item) for item in input().split()]\r\n arr = [int(item) for item in input().split()]\r\n sum =0\r\n count=0\r\n for i in arr:\r\n if(i<=b):\r\n sum+=i\r\n if(sum>d):\r\n count+=1\r\n sum=0\r\n print(count)\r\nif __name__ == '__main__':\r\n main()", "inputt = input()\r\nn = int(inputt.split(' ')[0])\r\nb = int(inputt.split(' ')[1])\r\nd = int(inputt.split(' ')[2])\r\ninputt2 = input().split(' ')\r\njuicer=0\r\nwaste=0\r\nempty=0\r\nfor i in range(n):\r\n a = int(inputt2[i])\r\n if a <= b:\r\n juicer+=a\r\n waste+=a\r\n if waste>d:\r\n waste=0\r\n empty+=1\r\nprint(empty)", "n, b, d = map(int, input().split())\r\noranges_str = input().split()\r\noranges = [int(orange) for orange in oranges_str]\r\ncurrent_sum = 0\r\ncounter = 0\r\nfor i in range(n):\r\n if oranges[i] <= b:\r\n current_sum += oranges[i]\r\n if current_sum > d:\r\n counter += 1\r\n current_sum = 0\r\n\r\nprint(counter)", "n,b,d = map(int,input().split())\r\nl = [*filter(lambda x: x<=b,map(int,input().split()))]\r\nm = k = 0\r\nfor x in l:\r\n m += x\r\n if(m>d): k += 1;m = 0\r\nprint(k)", "n, b, d = map(int,input().split())\noranges = list(map(int,input().split()))\nsumation = 0\ncount=0\nresult = [i for i in oranges if i<=b]\nfor i in range(len(result)):\n sumation+=result[i]\n if sumation > d:\n sumation=0\n count+=1\nprint(count)", "from sys import stdin\r\n\r\nn,b,d = map(int,stdin.readline().split())\r\nl = list(map(int,stdin.readline().split()))\r\ntotal = 0\r\ncount = 0\r\nfor i in l:\r\n\tif i>b:\r\n\t\tcontinue\r\n\ttotal+=i\r\n\tif total>d:\r\n\t\tcount+=1\r\n\t\ttotal = 0\r\nprint(count)", "n,b,d = map(int, input().split())\r\na = list(map(int, input().split()))\r\nc,res = 0,0\r\nfor num in a:\r\n\tif num<=b:\r\n\t\tc += num\r\n\tif c > d:\r\n\t\tres += 1\r\n\t\tc = 0\r\n\r\nprint(res)\r\n ", "n,b,d=input().split()\r\na=input().split()\r\ncounter=0\r\nrealone=0\r\nfor i in range(int(n)):\r\n if int(a[i])<=int(b):\r\n counter+=int(a[i])\r\n if counter>int(d):\r\n realone+=1\r\n counter=0\r\n \r\nprint(realone)", "n,b,d=map(int,input().split(' '))\r\n\r\nl=list(map(int,input().split(' ')))\r\nres=0\r\nsize=0\r\nfor i in l:\r\n if i>b:\r\n continue\r\n size+=i \r\n if(size>d): \r\n res+=1\r\n size=0\r\nprint(res) ", "n,b,d = map(int, input().split())\r\narr = list(map(int, input().split()[:n]))\r\n\r\ncounter = 0\r\nk = 0\r\n\r\nfor i in range(len(arr)):\r\n if arr[i] <= b and counter <= d:\r\n counter += arr[i]\r\n if counter > d:\r\n counter = 0\r\n k += 1\r\n\r\nprint(k)", "n, b ,d = map(int, input().split())\r\na = [int(i) for i in input().split()]\r\nc = 0\r\ne = 0\r\nfor i in range(n):\r\n if a[i] <= b:\r\n c = a[i] + c\r\n if c > d:\r\n c = 0\r\n e =e + 1\r\nprint (e)", "n,b,d=map(int,input().split())\r\na=list(map(int,input().split()))\r\nempty=0\r\nwaste=0\r\nfor i in a:\r\n if i<=b:\r\n waste+=i\r\n if waste>d:\r\n empty+=1\r\n waste=0\r\n else:\r\n continue\r\n else:\r\n continue\r\nprint(empty)", "n,b,d=map(int,input().split())\r\na = list(map(int,input().split()))\r\ns=t=0\r\nfor i in range(0,n):\r\n if a[i]<=b:\r\n t+=a[i]\r\n if t>d:\r\n s+=1\r\n t=0\r\nprint(s) ", "n, b, d = map(int, input().split())\r\nl_o = list(map(int, input().split()))\r\n\r\nt = 0\r\nt_o = 0\r\nfor i in l_o:\r\n if i <= b:\r\n t += i\r\n if t > d:\r\n t_o += 1\r\n t = 0\r\nprint(t_o)", "n,b,d=map(int,input().split())\r\napelcins=input().split()\r\ncol_opr=0\r\ncol_oranges=0\r\nfor i in apelcins:\r\n if int(i)<=b:\r\n col_oranges+=int(i)\r\n\r\n if col_oranges>d:\r\n col_opr+=1\r\n col_oranges=0\r\nprint(col_opr)", "n,b,d = map(int,input().split())\r\ns = list(map(int,input().split()))\r\nv = 0\r\not = 0\r\nfor i in range(n):\r\n if s[i] <= b:\r\n v += s[i]\r\n if v > d:\r\n ot += 1\r\n v = 0\r\nif v > d:\r\n ot += 1\r\nprint(ot)", "n, b, d = map(int, input().split())\r\narr = list(map(int, input().split()))\r\nsum1 = 0\r\nans = 0\r\nfor i in range(len(arr)):\r\n if arr[i] <= b:\r\n sum1 += arr[i]\r\n if sum1 > d:\r\n ans += 1\r\n sum1 = 0\r\nprint(ans)\r\n\r\n", "l1=[]\r\nl1.append([int(x) for x in input().split()])\r\nl2=[]\r\nl2.append([int(x) for x in input().split()])\r\nl3=l1[0]\r\nl4=l2[0]\r\na=0\r\nb=0\r\n\r\nfor i in range(l3[0]):\r\n if l4[i]<=l3[1]:\r\n a=a+l4[i]\r\n if a>l3[2]:\r\n a=0\r\n b=b+1\r\nprint(b)", "import math, heapq\r\nfrom sys import stdin\t\r\nfrom collections import Counter, defaultdict, deque, namedtuple\r\nfrom bisect import bisect_right, bisect_left\r\nfrom typing import List, DefaultDict\r\nfrom itertools import permutations\r\n \r\n \r\n \r\ndef readarray(typ):\r\n return list(map(typ, stdin.readline().split()))\r\n\r\n\r\ndef readint():\r\n return int(input())\r\n\r\n\r\nn, b, d = readarray(int)\r\n\r\na = readarray(int)\r\n\r\n\r\nans = 0\r\n\r\ncurr = 0\r\nfor orange in a:\r\n if orange <= b:\r\n curr += orange\r\n \r\n if curr > d:\r\n ans += 1\r\n curr = 0\r\n\r\nprint(ans)", "n,b,d = map(int,input().split())\r\norg = list(map(int,input().split()))\r\nc,s = 0,0\r\nfor i in range(n) :\r\n if org[i] <= b :\r\n s += org[i]\r\n\r\n if s > d :\r\n c += 1\r\n s = 0\r\n\r\nprint(c)\r\n", "n, b, d = map(int, input().split())\r\na = list(map(int, input().split()))\r\nsup = 0\r\nopr = 0\r\nfor i in range(n):\r\n if a[i] <= b:\r\n sup += a[i]\r\n if sup > d:\r\n sup = 0\r\n opr += 1\r\nprint(opr)", "x = input()\r\ny = input()\r\nx = x.split(' ')\r\nms = int(x[1])\r\nc = int(x[2])\r\narr = y.split(' ')\r\ncounter = 0\r\nval = 0\r\nfor i in arr :\r\n if int(i) > ms :\r\n continue\r\n val = val + int(i)\r\n if val > c :\r\n val = 0\r\n counter = counter + 1\r\nprint(counter)", "n,b,d=map(int,input().split())\nlst=list(map(int,input().split()))\njoicer=0\ncnt=0\nfor i in range(n):\n if lst[i] <=b:\n joicer += lst[i]\n if joicer >d:\n joicer = 0\n cnt +=1\nprint(cnt)\n\n\n\n\n\n\n \n\n\t \t \t\t \t\t \t\t\t\t \t \t \t", "number_of_oranges, max_size, limit = map(int, input().split())\r\nsize_of_oranges = list(map(int, input().split()))\r\nthrowing_waste = 0\r\njuicer = 0\r\nfor size in size_of_oranges:\r\n if size <= max_size:\r\n juicer += size\r\n if juicer > limit:\r\n throwing_waste += 1\r\n juicer = 0\r\nprint(throwing_waste)\r\n", "txt=input()\nn,b,d=txt.split()\nn=int(n)\nb=int(b)\nd=int(d)\nres=0\nsum=0\na=input().split()\nfor i in range(n):\n if(int(a[i])<=b):\n sum=sum+int(a[i])\n\n if sum>d:\n sum=0\n res=res+1\n\n\n\nprint(res)\n\n\t\t \t \t\t \t\t \t \t\t\t \t\t \t\t \t\t\t\t", "n,b,d=[int(i) for i in input().split()]\r\na=[int(i) for i in input().split()]\r\nv=0\r\nf=0\r\nc=[]\r\nc=a\r\nfor i in range(len(c)):\r\n if c[i]<=b:\r\n v+=int(c[i])\r\n if v>d:\r\n v=0\r\n f+=1\r\nprint(f)\r\n", "n,b,d = map(int, input().split())\r\nar = list(map(int, input().split()))\r\nt=0\r\nc=0\r\nfor i in range(n):\r\n if ar[i]>b:\r\n continue\r\n t+= ar[i]\r\n if t>d:\r\n c+=1\r\n t=0\r\nprint(c)", "arr = [int(x) for x in input().split()]\r\nsize_orange = [int(x) for x in input().split()]\r\nc=0\r\njucier_waste = []\r\nfor i in range(arr[0]):\r\n\tif size_orange[i] <= arr[1] :\r\n\t\tjucier_waste.append(size_orange[i])\r\n\tif sum(jucier_waste) > arr[2]:\r\n\t\tc+=1\r\n\t\tjucier_waste = []\r\nprint(c)", "n, b, d = [int(i) for i in input().split()]\r\nos = list(map(int,input().split()))\r\ncur = 0; ans = 0\r\nfor i in os:\r\n if i > b:\r\n continue;\r\n else:\r\n cur += i\r\n if cur > d:\r\n ans += 1\r\n cur = 0\r\nprint(ans)\r\n", "n, b, d = [int(i) for i in input().split()]\r\na = [int(i) for i in input().split()]\r\ntrash = 0\r\nanswer = 0\r\nfor i in a:\r\n if i <= b:\r\n trash += i\r\n if trash > d:\r\n answer += 1\r\n trash = 0\r\nprint(answer)", "n,b,c=map(int, input().split())\r\na=list(map(int, input().split()))\r\ncnt=0\r\nsm=0\r\nfor i in a:\r\n if i<=b:\r\n sm+=i\r\n if sm>c:\r\n cnt+=1\r\n sm=0\r\nprint(cnt)", "a1=input().split()\r\nn=int(a1[0])\r\nb=int(a1[1])\r\nc=int(a1[2])\r\ns=0;x=0\r\na2=input().split()\r\nx=0\r\nfor i in a2:\r\n if int(i)>b:\r\n continue\r\n x+=int(i)\r\n if x>c:\r\n x=0\r\n s+=1\r\n \r\nprint(s)", "n, b, d = map(int, input().split())\r\na = list(map(int, input().split()))\r\nco = 0\r\nr = 0\r\nfor i in a:\r\n if i <= b:\r\n co += i\r\n if co > d:\r\n co = 0\r\n r += 1\r\nprint(r)", "def ints():\r\n return [int(_) for _ in input().split()]\r\n\r\n\r\ndef main():\r\n rb = 0\r\n e = 0\r\n n, x, b = ints()\r\n for d in ints():\r\n if d > x:\r\n continue\r\n rb += d\r\n if rb > b:\r\n e += 1\r\n rb = 0\r\n print(e)\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n\r\n", "n, b, d = map(int, input().split())\r\ndaf = list(map(int, input().split()))\r\njum = 0\r\nwas = 0\r\n\r\nfor j in daf:\r\n if j > b:\r\n continue\r\n was += j\r\n if was > d:\r\n jum += 1\r\n was = 0\r\n\r\nprint(jum)\r\n", "\r\nn ,b,d = map(int, input().split())\r\n\r\noranges_sizes = list(map(int , input().split()))\r\n\r\nsums, ans = 0, 0\r\nfor x in oranges_sizes:\r\n if x <= b:\r\n sums += x\r\n \r\n if sums > d:\r\n ans +=1 \r\n sums = 0\r\n\r\nprint(ans)", "n,b,d = map(int,input().split())\r\noranges = [x for x in map(int,input().split())]\r\nprocessed = 0\r\ni = 0\r\nfor item in oranges:\r\n if item <= b:\r\n processed += item\r\n if processed > d:\r\n i += 1\r\n processed = 0\r\nprint(i)", "n, b, d = map(int, input().split())\r\na = [int(i) for i in input().split()]\r\nq = 0\r\nw = 0\r\nfor i in a:\r\n if i <= b:\r\n q += i\r\n if q > d:\r\n w += 1\r\n q = 0\r\nprint(w)", "def solve(l, b,d):\n total = 0 \n ret =0 \n for e in l:\n if e > b:\n continue\n total += e\n if total > d:\n total = 0\n ret += 1\n return ret\n\nn,b,d=map(int, input().split(\" \"))\nl = list(map(int, input().split(\" \")))\nprint (solve(l, b, d))\n", "n,b,d = map(int,input().split())\r\na = list(map(int,input().split()))\r\ns = 0\r\ne = 0\r\nfor i in range( len(a)):\r\n if a[i] > b:\r\n continue\r\n s += a[i]\r\n if s > d:\r\n e += 1\r\n s = 0\r\nprint(e )", "n, b, d = [int(x) for x in input().split()]\r\norange = [int(x) for x in input().split()]\r\ntotal=t=0\r\nfor o in orange:\r\n if o<=b: total += o\r\n if total>d:\r\n t+=1\r\n total=0\r\nprint(t)", "n, b, d = map(int, input().split())\r\na = list(map(int, input().split()))\r\ntotal = 0\r\nwaste = 0\r\nfor _ in range(n):\r\n if a[_] > b:\r\n continue\r\n total += a[_]\r\n if total > d:\r\n waste += 1\r\n total = 0\r\nprint(waste)\r\n", "n,b,d= map(int, input().split())\r\na=list(map(int,input().split()))\r\nm=0\r\nx=0\r\nfor i in range (n):\r\n if a[i]<=b:\r\n m+=a[i]\r\n if m>d:\r\n x+=1\r\n m=0\r\nprint(x)", "def solution(b, d, a):\r\n s = 0\r\n c = 0\r\n for i in a:\r\n if i <= b:\r\n s = s + i\r\n if s > d:\r\n s = 0\r\n c = c+1\r\n print(c)\r\n\r\n\r\nn, b, d = [int(x) for x in input().split()]\r\na = [int(x) for x in input().split()]\r\nsolution(b, d, a)", "n, b, d = map(int, input().split())\r\narr = list(map(int, input().split()))\r\nwaste = 0\r\ntimes = 0\r\nfor i in arr:\r\n if i <= b:\r\n waste += i\r\n if waste > d:\r\n times += 1\r\n waste = 0\r\nprint(times)", "n, b, d = map(int, input().split())\noranges = list(map(int, input().split()))\n\ncount, total = 0, 0\n\nfor orange in oranges:\n if orange <= b:\n total += orange\n if total > d:\n count+=1\n total=0\nprint(count)", "n,b,d = map(int,input().split())\r\na = [int(x) for x in input().split()]\r\nc = 0\r\ncounter = 0\r\nfor i in a:\r\n if i<=b:\r\n counter+=i\r\n if counter>d:\r\n c+=1\r\n counter=0\r\nprint(c)", "# -*- coding:utf-8 -*-\nfrom typing import List\n\n\ndef Juicer(A:List[int], b:int, d:int)->int:\n n = 0\n all = 0\n for a in A:\n if a > b :\n continue\n all += a\n if all > d :\n n += 1\n all = 0\n return n\n\n\n\nif __name__ == '__main__':\n n,b,d = map(int, input().split())\n L = list(map(int, input().split()))\n print(Juicer(L, b, d))\n\t \t\t \t \t\t\t \t \t \t \t \t\t", "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\nn, b, d = map(int, input().split())\n\nrunning = 0\nres = 0\n\nfor x in map(int, split(input())):\n if x > b:\n continue\n\n running += x\n\n if running > d:\n running = 0\n res += 1\n\nprint(res)\n", "n,b,d = map(int, input().split())\r\na = list(map(int, input().split()))\r\ns = 0\r\nk = 0\r\nfor i in a:\r\n if i <= b:\r\n s += i\r\n if s>d:\r\n s = 0\r\n k += 1\r\nprint(k)", "a, b, c = [int(i) for i in input().split()]\r\ne = [int(i) for i in input().split()]\r\nr = 0\r\nt = 0\r\n\r\nfor i in e:\r\n if i<=b:\r\n r+=i\r\n if r>c:\r\n t+=1\r\n r=0\r\nprint(t)\r\n", "n = list(map(int, input().split()))\r\norange = list(map(int, input().split()))\r\nwaste = 0\r\nsum = 0\r\nfor i in range (len(orange)):\r\n if orange[i] <= n[1]:\r\n sum += orange[i]\r\n if sum > n[2]:\r\n waste += 1\r\n sum = 0\r\nprint(waste)", "stuff = input().split()\nfor i in range(3):\n stuff[i] = int(stuff[i])\n\n\njuice = 0\nwaste = 0\nsizes = input().split()\nfor i in range(len(sizes)):\n sizes[i] = int(sizes[i])\n if sizes[i] <= stuff[1]:\n juice += sizes[i]\n if juice > stuff[2]:\n waste += 1\n juice = 0\n \nprint(waste)\n\n \t \t \t\t\t \t \t \t\t \t\t\t", "n, b, d = map(int, input().split())\r\nsizes = list(map(int, input().split()))\r\n\r\ncontainer = 0\r\nemptied = 0\r\n\r\nfor size in sizes:\r\n if size <= b:\r\n container += size\r\n if container > d:\r\n container = 0\r\n emptied += 1\r\n\r\nprint(emptied)", "orange_cnt, orange_size_threshold, overflow = map(int, input().split())\njuice_sum = 0\nres = 0\nfor orange in map(int, input().split()):\n if orange > orange_size_threshold:\n continue\n juice_sum += orange\n if juice_sum > overflow:\n res += 1\n juice_sum = 0\nprint(res)\n# 50 100 129\n# 55 130 91 19 116 3 63 52 104 76 75 27 151 99 149 147 39 148 84 9 132 49 40 112 124 141 144 93 36 32 146 74 48 38 150 55 94 32 107 69 77 81 33 57 62 98 78 127 154 126\n", "n, b, d = list(map(int, input().split(\" \")))\r\no = list(filter(lambda x: x <= b, list(map(int, input().split(\" \")))))\r\nif not o:\r\n print(0)\r\nelse:\r\n c = 0\r\n t = 0\r\n for i in o:\r\n t += i\r\n if t > d:\r\n c += 1\r\n t = 0\r\n print(c)\r\n", "n,m,w=map(int,input().split())\r\nlst=list(map(int,input().split()))\r\nc,t=0,0\r\nfor i in lst:\r\n if i > m:\r\n continue\r\n elif i <= m:\r\n c+=i\r\n if c > w:\r\n t+=1\r\n c=0\r\nprint(t)", "from sys import stdin, stdout\r\nn, b, d = map(int, stdin.readline().strip().split())\r\narray = list(map(int, stdin.readline().strip().split()))\r\n# array.sort()\r\nsum_x = 0 \r\ncount = 0 \r\nfor j in array:\r\n if j>b:\r\n pass \r\n else:\r\n sum_x+=j \r\n if sum_x>d:\r\n count+=1 \r\n sum_x = 0 \r\n# if sum_x>d:\r\n# count+=1\r\nstdout.write(f\"{count}\\n\")", "n,b,d=map(int,input().split())\r\nl=list(map(int,input().split()))\r\ns=0\r\nc=0\r\nfor i in range(len(l)):\r\n if l[i]<=b:s+=l[i]\r\n if s>d:c+=1;s=0\r\nprint(c)\r\n \r\n \r\n \r\n", "n, b, d = map(int, input().split())\r\nsizes = list(map(int, input().split()))\r\n\r\nwaste_section = 0 # Initialize the waste section size\r\nempty_count = 0 # Initialize the number of times waste section is emptied\r\n\r\nfor size in sizes:\r\n if size > b:\r\n continue # Skip oranges that are too big for the juicer\r\n waste_section += size # Add the size of the orange to the waste section\r\n\r\n if waste_section > d:\r\n empty_count += 1 # Empty the waste section\r\n waste_section = 0 # Reset the waste section size\r\n\r\nprint(empty_count)\r\n", "n, b, d = [int(i) for i in input().split()]\r\nll = [int(i) for i in input().split()]\r\nsum1 = 0\r\ncount = 0\r\nfor i in ll:\r\n if i > b:\r\n continue\r\n else:\r\n sum1 += i\r\n if sum1 > d:\r\n sum1 = 0\r\n count += 1\r\nprint(count)\r\n", "def count_waste_empties(n, b, d, oranges):\r\n total_size = 0\r\n waste_empties = 0\r\n\r\n for orange in oranges:\r\n if orange <= b:\r\n total_size += orange\r\n\r\n if total_size > d:\r\n waste_empties += 1\r\n total_size = 0\r\n\r\n return waste_empties\r\n\r\n# Read input\r\nn, b, d = map(int, input().split())\r\noranges = list(map(int, input().split()))\r\n\r\n# Calculate and print the result\r\nresult = count_waste_empties(n, b, d, oranges)\r\nprint(result)", "o=0\r\nn,b,d=map(int,input().split())\r\nd1=d\r\na=list(map(int,input().split()))\r\nfor i in range(n):\r\n\tif a[i]<=b:\r\n\t\td-=a[i]\r\n\tif d<0:\r\n\t\to+=1\r\n\t\td=d1\r\nprint(o)", "n,b,d = map(int,input().split())\r\nx=list(map(int,input().split()))\r\n\r\nc=0\r\ndd=0\r\n\r\nfor i in x:\r\n if i<=b:\r\n if dd<=d and dd+i>d:\r\n c+=1\r\n dd=0\r\n else:\r\n dd+=i\r\n\r\nprint(c)", "n, b, d = map(int, input().split())\nA = list(map(int, input().split()))\n\namt = 0\ncnt = 0\nfor a in A:\n if a <= b: \n amt += a\n if amt > d:\n cnt += 1\n amt = 0\n\nprint(cnt)\n \n", "nn, bb, dd = map(int, input().split())\r\narray = list(map(int,input().strip().split()))[:nn]\r\n \r\ncur_sum, count = 0,0\r\nfor i in array:\r\n if i > bb:\r\n continue\r\n cur_sum += i\r\n if cur_sum > dd:\r\n cur_sum = 0\r\n count += 1\r\n\r\nprint(count)\r\n\r\n\r\n ", "# -*- coding:utf-8 -*-\nfrom typing import List\n\n\ndef Juicer(A:List[int], b:int, d:int)->int:\n # write code here\n flag=0;res=0\n for i in A:\n if i<=b:\n res=res+i\n if res>d:\n flag=flag+1\n res=0\n return flag\n\n\nif __name__ == '__main__':\n n,b,d = map(int, input().split())\n L = list(map(int, input().split()))\n print(Juicer(L, b, d))\n\t\t \t \t \t \t\t \t \t", "n,o,d = map(int,input().split())\r\noranges = input().split()\r\noranges =[int(x) for x in oranges]\r\ncount =0\r\ntotal =0\r\nfor oran in oranges:\r\n if oran > o:\r\n continue\r\n total += oran\r\n if total > d:\r\n total =0\r\n count +=1\r\nprint(count)\r\n", "num=input().split()\r\nn,b,d=int(num[0]),int(num[1]),int(num[2])\r\ntime=0\r\nover=0\r\na=list(map(int,input().split()))\r\nfor i in range(n):\r\n if a[i]<=b:\r\n over+=a[i]\r\n if over>d:\r\n time+=1\r\n over=0\r\nprint(time)", "n ,b , d = map(int,input().split())\r\na = map(int,input().split())\r\nw =0\r\nans =0\r\nfor i in a:\r\n if (i<=b):\r\n w+=i\r\n if(w>d):\r\n ans+=1\r\n w=0\r\nprint(ans)", "n,b,d=map(int,input().split())\r\nl=list(map(int,input().split()))\r\ns=0\r\na=0\r\nfor x in l:\r\n\tif x<=b:\r\n\t\ts+=x\r\n\tif s>d:\r\n\t\ts=0\r\n\t\ta+=1\r\nprint(a)", "n,b,d=input().split()\nn = int(n)\nb = int(b)\nd = int(d)\norangesSize= input()\nx=orangesSize.split()\n#print(x,len(x))\ncnt = 0\nsum = 0\nfor i in range(n):\n x[i]=int(x[i])\n if x[i] <= b:\n sum+=x[i]\n if sum>d:\n cnt+=1\n sum=0\nprint(cnt)\n \t \t\t\t \t\t \t\t\t\t\t \t\t\t\t\t\t\t", "n,b,d = map(int,input().split())\r\nlis = list(map(int,input().split()))\r\nsum = 0\r\nw = 0\r\nfor i in lis:\r\n if i<=b:\r\n sum += i\r\n if sum>d:\r\n w += 1\r\n sum = 0\r\nprint(w)\r\n", "n, b, d = [int(word) for word in input().split()]\noranges = [int(word) for word in input().split() if int(word) <= b]\ncounter = 0\nsum = 0\nfor i in oranges:\n sum += i\n if sum > d:\n counter += 1\n sum = 0\nprint(counter)\n\n\n", "a,b,c=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nreap,size=0,0\r\nfor i in l :\r\n if b >= i :\r\n size += i\r\n if size > c:\r\n reap+=1\r\n size=0\r\nprint(reap)\r\n", "n,b,d=map(int,input().split())\r\na=list(map(int,input().split()))\r\nk=0\r\ns=0\r\nfor i in a:\r\n if i<=b:\r\n s+=i\r\n if s>d:\r\n s=0\r\n k+=1\r\nprint(k)\r\n", "oranges, juice_limit, waste_limit = map(int, input().split())\n\nsizes = list(map(int, input().split()))\n\nempty, waste = 0, 0\n\nfor o in sizes:\n if o <= juice_limit:\n waste += o\n\n if waste > waste_limit:\n waste = 0\n empty += 1\n\nprint(empty)\n ", "n, b, d = map(int, input().split())\nv = [i for i in map(int, input().split()) if i <= b]\ns = 0\na = 0\nfor i in v:\n s += i\n if s > d:\n a += 1\n s = 0\nprint(a)\n", "n,b,d=map(int,input().split())\r\nl=list(map(int,input().split()))\r\ncount=0\r\njuice=0\r\nfor i in l:\r\n\tif(i<=b):\r\n\t\tjuice+=i\r\n\t\tif(juice>d):\r\n\t\t\tcount+=1\r\n\t\t\tjuice=0\r\n\r\n\r\n\r\n# if(juice>0):\r\n# \tcount+=1\r\n\r\n\r\n\r\n\r\nprint(count)\r\n\r\n\r\n\r\n\r\n", "# -*- coding:utf-8 -*-\nfrom typing import List\ndef Juicer(A: List[int], b: int, d: int) -> int:\n # write code here\n remains = 0\n wash_times = 0\n for size in A:\n if size > b:\n continue\n remains += size\n if remains > d:\n wash_times += 1\n remains = 0\n return wash_times\n\nif __name__ == '__main__':\n n,b,d = map(int, input().split())\n L = list(map(int, input().split()))\n print(Juicer(L, b, d))\n \t\t\t \t\t \t\t \t\t \t\t\t \t\t \t \t", "\nnum,max_size,max_total = map(int,input().split())\n\nsizes=list(map(int,input().split()))\ntotal=0\ncount=0\nfor x in range(num):\n if sizes[x]<=max_size:\n total+=sizes[x]\n if total > max_total:\n count+=1\n total=0\n\nprint(count) ", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\nn, b, d = list(map(int, input().decode(\"utf-8\").split()))\r\no = list(map(int, input().decode(\"utf-8\").split()))\r\nwaste = 0\r\ncount = 0\r\nfor i in o:\r\n if i <= b:\r\n waste += i\r\n if waste > d:\r\n count += 1\r\n waste = 0\r\nsys.stdout.write(str(count) + '\\n')\r\n\r\n", "\"\"\"\r\nKolya is going to make fresh orange juice. He has n oranges of sizes a1, a2, ..., an. Kolya will put them in the juicer in the fixed order, starting with orange of size a1, then orange of size a2 and so on. To be put in the juicer the orange must have size not exceeding b, so if Kolya sees an orange that is strictly greater he throws it away and continues with the next one.\r\n\r\nThe juicer has a special section to collect waste. It overflows if Kolya squeezes oranges of the total size strictly greater than d. When it happens Kolya empties the waste section (even if there are no more oranges) and continues to squeeze the juice. How many times will he have to empty the waste section?\r\n\r\nInput\r\nThe first line of the input contains three integers n, b and d (1 ≤ n ≤ 100 000, 1 ≤ b ≤ d ≤ 1 000 000) — the number of oranges, the maximum size of the orange that fits in the juicer and the value d, which determines the condition when the waste section should be emptied.\r\n\r\nThe second line contains n integers a1, a2, ..., an (1 ≤ ai ≤ 1 000 000) — sizes of the oranges listed in the order Kolya is going to try to put them in the juicer.\r\n\r\nOutput\r\nPrint one integer — the number of times Kolya will have to empty the waste section.\r\n\"\"\"\r\n\r\nn, b, d = map(int, input().split())\r\na = list(map(int, input().split()))\r\n\r\ntimes_emptied = 0\r\nwaste = 0\r\n\r\nfor orange_size in a:\r\n if orange_size <= b:\r\n waste += orange_size\r\n if waste > d:\r\n waste = 0\r\n times_emptied += 1\r\n\r\nprint(times_emptied)", "n, b, d = list(map(int, input().split()))\noranges = list(map(int, input().split()))\ntimesEmptied = 0\nwasteMeter = 0\nfor orange in oranges:\n if orange <= b:\n wasteMeter += orange\n if wasteMeter > d:\n wasteMeter = 0\n timesEmptied += 1\nprint(timesEmptied)\n", "n, msize, mtotal = map(int, input().split())\r\noranges = (int(o) for o in input().split() if int(o) <= msize)\r\n\r\ns = 0\r\nwaste = 0\r\nfor orange in oranges:\r\n waste += orange\r\n if waste > mtotal:\r\n waste = 0\r\n s += 1\r\n\r\nprint(s)\r\n", "number_of_orange ,size_squeezer, size_waster = map(int, input().split()) \r\nlist_of_orange = list(map(int,input().split()))[::-1]\r\nsize_waster_copy = size_waster\r\ncount = 0\r\nwhile number_of_orange :\r\n if list_of_orange[number_of_orange-1] > size_squeezer: \r\n number_of_orange -= 1\r\n else : \r\n size_waster_copy -= list_of_orange[number_of_orange-1]\r\n if size_waster_copy < 0 : \r\n count += 1 \r\n size_waster_copy = size_waster\r\n number_of_orange -= 1 \r\nprint(count)", "n, b, d = map(int, input().split())\narr = list(map(int, input().split()))\ncount = 0\ndtimes = 0\nfor item in arr:\n if item <= b:\n count += item\n if count > d:\n dtimes += 1\n count = 0\n\nprint(dtimes)\n", "a,b,d = [int(i)for i in input().split()]\noranges = [int(i)for i in input().split()]\nsumm = 0\nanswer = 0\nfor i in range(a):\n if oranges[i] <= b:\n summ += oranges[i]\n if summ > d:\n answer += 1\n summ = 0\nprint(answer)\n\n\n", "n , b , d = [int(i) for i in input().split()]\r\no = [int(i) for i in input().split()]\r\n\r\ns = 0\r\nans = 0\r\nfor i in range(n):\r\n if o[i] > b:\r\n continue\r\n \r\n s += o[i]\r\n if (s) > d:\r\n ans += 1\r\n s = 0\r\n\r\nprint(ans)", "n, b, d = [int(i) for i in input().split()]\r\nsizes = list(input().split(' '))\r\ntotal = 0\r\nemptied = 0\r\ni = 0\r\nfor i in range(n):\r\n if int(sizes[i]) <= b:\r\n total += int(sizes[i])\r\n if total > d:\r\n total = 0\r\n emptied += 1\r\n\r\nprint(emptied)", "# -*- coding:utf-8 -*-\nfrom typing import List\n\n\ndef Juicer(A:List[int], b:int, d:int)->int:\n # write code here\n sum = 0\n cnt = 0\n for i in range(len(A)):\n if A[i] > b:\n continue\n else:\n sum += A[i]\n if sum > d:\n cnt += 1\n sum = 0\n return cnt\n\n\nif __name__ == '__main__':\n n,b,d = map(int, input().split())\n L = list(map(int, input().split()))\n print(Juicer(L, b, d))\n \t \t \t\t \t\t\t \t \t \t\t\t \t\t", "n, b, d = map(int, input().split())\r\nlst = [*map(int, input().split())]\r\ncontainer = 0\r\nans = 0\r\n\r\nfor i in lst:\r\n if i <= b:\r\n container += i\r\n if container > d:\r\n ans += 1\r\n container = 0\r\nif container > d:\r\n print(ans + 1)\r\nelse:\r\n print(ans)\r\n", "n,b,d=input().split()\nn=int(n)#number of oranges\nb=int(b)#maximum size of fitting the orange in the juicer\nd=int(d)#value determine us to empty the special section\noranges=input() #5 7 7 (string)\nx=oranges.split() #x = [5,7,7] (string)\ncnt=0 #counter how many times did we empty special section\nsum=0 #sumtion of sizes of oranges\nfor i in range (len(x)):#0 -> 3\n x[i] = int(x[i])\n if x[i]<=b :#5<=10\n sum+=x[i]#sum = 5\n if sum>d:\n cnt+=1\n sum=0\n\nprint(cnt)\n\n \t\t\t\t \t\t \t \t \t\t \t \t \t\t \t\t \t", "inp = input(\"\")\r\nn, b, d = [int(i) for i in inp.split()]\r\nn_inp = input(\"\")\r\nn_lst = [int(i) for i in n_inp.split()]\r\nttl_juice = 0\r\nempty = 0\r\n\r\nfor i in n_lst:\r\n if i <= b:\r\n ttl_juice += i\r\n if ttl_juice > d:\r\n empty += 1\r\n ttl_juice = 0\r\nprint(empty)", "n, b, d = map(int, input().split())\nlst = list(map(int, input().split()))\njoicer = 0\ncnt = 0\nfor i in range(n):\n if lst[i] <= b:\n joicer += lst[i]\n if joicer > d:\n joicer = 0\n cnt += 1\nprint(cnt)\n\t \t\t \t\t\t \t \t\t\t \t \t \t\t\t\t", "import sys\r\ninput = sys.stdin.readline\r\n\r\n(n, b, d) = tuple(map(int, input().split()))\r\nlst = list(map(int, input().split()))\r\n\r\ns = 0\r\nc = 0\r\n\r\nfor i in range(n):\r\n \r\n if lst[i] > b:\r\n continue\r\n \r\n s += lst[i]\r\n\r\n if s > d:\r\n s = 0\r\n c += 1\r\n\r\nprint(c) ", "def main():\r\n [_, b, d] = list(map(int, input().split()))\r\n os = list(map(int, input().split()))\r\n\r\n c = 0\r\n w = 0\r\n for o in os:\r\n if o <= b:\r\n w += o\r\n if w > d:\r\n c += 1\r\n w = 0\r\n\r\n print(c)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n, b, d = map(int, input().split())\r\nsum = 0\r\ncount = 0\r\n\r\noranges = [int(i) for i in input().split()]\r\n\r\nfor i in range(n):\r\n if oranges[i] <= b:\r\n sum += oranges[i]\r\n if sum > d:\r\n count += 1\r\n sum = 0\r\nprint(count)\r\n", "n,b,d=map(int,input().split());w=0;t=0;o=map(int,input().split())\nfor f in o:\n if f<=b:w+=f\n if w>d:t+=1;w=0\nprint(t)", "n,b,d = input().split()\r\nwaste=0\r\nc=0\r\nx =list(map(int,input().split()))\r\nn=int(n)\r\nb=int(b)\r\nd=int(d)\r\nfor i in range (n) :\r\n if x[i]<=b :\r\n waste=waste+x[i]\r\n if waste>d :\r\n c=c+1\r\n waste=0\r\nprint(c)\r\n ", "n,b,d=map(int,input().split())\r\nz=list(map(int,input().split()))\r\nl=0\r\nn=0\r\nfor i in z:\r\n if i<=b:\r\n l+=i\r\n if l>d:\r\n n+=1\r\n l=0 \r\nprint(n)\r\n\r\n", "n, b, d = [int(i) for i in input().split()]\r\noranges = [int(i) for i in input().split()]\r\n\r\ncollector_emptied = 0\r\ncollector_amount = 0\r\n\r\nfor orange in oranges:\r\n if orange > b:\r\n continue\r\n\r\n collector_amount += orange\r\n if collector_amount > d:\r\n collector_emptied += 1\r\n collector_amount = 0\r\n\r\nprint(collector_emptied)", "a = input().split()\r\nn, b, d = int(a[0]), int(a[1]), int(a[2])\r\naps = input().split()\r\nsumma = 0\r\nnum = 0\r\nfor i in range(len(aps)):\r\n if int(aps[i]) > b:\r\n continue\r\n else:\r\n summa += int(aps[i])\r\n if summa > d:\r\n summa = 0\r\n num += 1\r\nprint(num)\r\n", "n, b, d = map(int, input().split())\r\n\r\norg = list(map(int, input().split()))\r\nc = 0\r\nr = 0\r\nfor v in org:\r\n if v > b:\r\n continue\r\n c += v\r\n if c > d:\r\n r += 1\r\n c = 0\r\n\r\nprint(r)", "n, b ,d = map(int, input().split())\r\nres = 0\r\ny=0\r\na = list(map(int,input().split()))\r\nfor x in a:\r\n if(x <= b):\r\n res += x\r\n if(res>d):\r\n res = 0\r\n y+= 1\r\nprint(y)\r\n \r\n ", "amount_oranges, max_orange, max_juice = [int(x) for x in input().split()]\r\nsizes = input().split()\r\nrefills = 0\r\njuice = 0\r\nfor i in range(amount_oranges):\r\n if int(sizes[i]) <= max_orange:\r\n juice += int(sizes[i])\r\n if juice > max_juice:\r\n juice = 0\r\n refills += 1\r\nprint(refills)", "n, b, d=map(int,input().split())\r\narr = [int(c) for c in input().split()]\r\ntmp, res = 0, 0\r\nfor i in range(n):\r\n if arr[i]<=b:\r\n tmp += arr[i]\r\n if tmp > d:\r\n tmp = 0\r\n res += 1\r\nprint(res)", "a, b, d = map(int, input().split())\r\narr = list(map(int, input().split()))\r\n\r\nans = 0\r\nbin = 0\r\nfor n in arr:\r\n if n <= b:\r\n bin += n\r\n if bin > d:\r\n ans += 1\r\n bin = 0\r\n\r\nprint(ans)\r\n", "n,b,d=map(int,input().split())\r\noranges=list(map(int,input().split()))\r\nc=0\r\ntotal=0\r\nfor orange in oranges:\r\n if orange>b:\r\n continue\r\n else:\r\n total+=orange\r\n if total>d:\r\n total=0\r\n c+=1\r\nprint(c)\r\n", "s1 = input().split(' ')\ns2 = input().split(' ')\n\nacc = 0\nn = 0\n\nfor i in range(int(s1[0])):\n\n if int(s2[i]) <= int(s1[1]):\n acc += int(s2[i])\n if (acc > int(s1[2])):\n n += 1\n acc = 0\n\nprint( n )\n \t \t \t \t \t \t \t\t\t \t\t\t\t\t \t", "n, b, d = map(int, input().split())\nlst = list(map(int, input().split()))\njuicer = 0\ncnt = 0\nfor i in range(n):\n if lst[i] <= b:\n juicer += lst[i]\n if juicer > d:\n juicer = 0\n cnt += 1\nprint(cnt)\n\n\t\t\t\t\t\t \t\t\t \t\t\t\t \t\t\t\t\t\t \t\t", "n,b,d=list(map(int,input().split()))\r\nl=list(map(int,input().split()))\r\ns=0\r\nct=0\r\nfor i in l:\r\n if i<=b:\r\n s+=i\r\n if s>d:\r\n s=0\r\n ct+=1\r\nprint(ct)", "n,b,d = list(map(int,input().split()))\r\noranges = list(map(int,input().split()))\r\ncounter,waste = 0,0\r\nfor i in oranges:\r\n if i <= b:\r\n waste += i\r\n if waste > d:\r\n counter += 1\r\n waste = 0\r\nprint(counter)", "n, b, d = map(int, input().split())\r\narr = [int(x) for x in input().split()]\r\nwaste = 0\r\nc = 0\r\nfor i in range(n):\r\n if arr[i] > b:\r\n pass\r\n else:\r\n waste += arr[i]\r\n\r\n if waste > d:\r\n c += 1\r\n waste = 0\r\n\r\nprint(c)", "n,b,d=map(int,input().split())\nlst=list(map(int,input().split()))\n\nfree=0\njoicerSize=0\nfor i in range(n):\n siz=lst[i]\n if(siz<=b):\n joicerSize+=siz\n if(joicerSize>d):\n joicerSize=0\n free+=1\n\nprint(free)\n \t\t\t \t \t\t \t\t \t \t \t\t", "N,MaxSize,WasteSize = [int(x) for x in input().split()]\nOranges = [int(x) for x in input().split()]\nCurrWaste = 0\nTimesEmptied = 0\nfor i in Oranges:\n if CurrWaste > WasteSize:\n TimesEmptied += 1\n CurrWaste = 0\n if i <= MaxSize:\n CurrWaste += i\nif CurrWaste > WasteSize:\n TimesEmptied += 1\nprint(TimesEmptied)\n\t\t\t \t \t \t\t\t \t \t\t\t\t\t\t\t\t\t", "n,b,d=map(int,input().split())\r\na=list(map(int,input().split()))\r\nx,y=0,0\r\nfor i in a:\r\n if i<=b:\r\n x+=i\r\n if x>d:\r\n y+=1\r\n x=0\r\nprint(y)", "n, b, d = map(int, input().split())\na = list(map(int, input().split()))\n\nw = 0\ncounter = 0\n\nfor s in a:\n if s <= b:\n w = w + s\n if w > d:\n counter += 1\n w = 0\n else:\n pass\n else:\n pass\n\nprint(counter)", "n, b, d = map(int, input().split())\r\nsizes = list(map(int, input().split()))\r\nwaste = 0\r\n\r\n# Create a new list with only the sizes that are less than or equal to 'b'\r\nfiltered_sizes = [size for size in sizes if size <= b]\r\n\r\n# Calculate waste\r\ncurrent_waste = 0\r\nfor size in filtered_sizes:\r\n current_waste += size\r\n if current_waste > d:\r\n waste += 1\r\n current_waste = 0\r\n\r\nprint(waste)\r\n", "def main():\r\n constraints=input()\r\n listOfConstraints=constraints.split()\r\n numberOranges=int(listOfConstraints[0])\r\n maxSize=int(listOfConstraints[1])\r\n capacity=int(listOfConstraints[2])\r\n oranges=input()\r\n listOfOranges=oranges.split()\r\n flow=0\r\n counter=0\r\n for i in range (numberOranges):\r\n if(int(listOfOranges[i])>maxSize):\r\n continue\r\n else:\r\n flow=flow+int(listOfOranges[i])\r\n if(flow>capacity):\r\n counter+=1\r\n flow=0\r\n print(counter) \r\nif __name__ == \"__main__\":\r\n main()\r\n", "def main():\r\n n, b, d = list(map(int, input().split()))\r\n arr = list(map(int, input().split()))\r\n\r\n s, counter = 0, 0\r\n for element in arr:\r\n if element <= b:\r\n s += element\r\n if s > d:\r\n counter += 1\r\n s = 0\r\n print(counter)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Fri Jun 23 06:20:28 2023\r\n\r\n@author: RadmediX\r\n\"\"\"\r\n\r\n(n,b,d) = tuple(map(int, input().split()))\r\noranges = list(map(int, input().split()))\r\n\r\nwaste = 0\r\nemptyNum = 0\r\n\r\nfor orange in oranges:\r\n waste += orange if orange <= b else 0\r\n if waste > d:\r\n emptyNum+=1\r\n waste=0\r\n \r\nprint(emptyNum)\r\n ", "n,b,d = map(int,input().split())\r\nai = [int(x) for x in input().split()]\r\nempty = section = 0\r\nfor a in ai:\r\n if a <= b:\r\n section += a\r\n if section > d:\r\n section = 0\r\n empty += 1\r\n\r\nprint(empty)", "n,b,d=map(int,input().split())\r\nlst=list(map(int,input().split()))\r\nsum=0\r\ncount=0\r\nfor i in range(len(lst)):\r\n if lst[i]<=b:\r\n sum+=lst[i]\r\n if sum>d:\r\n count+=1\r\n sum=0\r\n\r\nprint(count)\r\n\r\n", "\r\nn,b,d=list(map(int,input().split()))\r\na=list(map(int,input().split()))\r\nx=0\r\nsum=0\r\nfor i in range(n):\r\n if a[i]>b:\r\n continue\r\n else:\r\n sum+=a[i]\r\n if sum<=d:\r\n continue\r\n else:\r\n x+=1\r\n sum=0\r\n \r\nprint(x)\r\n", "n, b, d = map(int, input().strip().split())\r\ncounter = 0\r\noranges = 0\r\na = map(int, input().strip().split())\r\nfor i in a:\r\n if i<=b:\r\n oranges += i\r\n if oranges > d:\r\n counter += 1\r\n oranges = 0\r\nprint(counter)", "n,b,d = map(int,input().split())\r\nmy_list = map(int,input().split())\r\nc1 = 0\r\nsum = 0\r\nfor i in my_list:\r\n if i <=b:\r\n sum += i\r\n if sum>d:\r\n c1 +=1\r\n sum = 0\r\nprint(int(c1))\r\n", "n, b, d = map(int, input().split())\r\nl = list(map(int, input().split()))\r\ni=0\r\nwhile i<n:\r\n if l[i]>b:\r\n l.pop(i)\r\n n-=1\r\n continue\r\n i+=1\r\ncount = 0\r\nm = 0\r\nfor i in range(n):\r\n m = m + l[i]\r\n if m>d:\r\n count+=1\r\n m=0\r\nprint(count)", "a,b,c=map(int,input().split())\r\nss=0\r\ncon=0\r\ny=list(map(int,input().split()))\r\nfor j in range(a):\r\n if y[j]<=b:\r\n con+=y[j]\r\n if con>c:\r\n con=0\r\n ss+=1\r\n \r\n \r\nprint(ss)\r\n", "n , b , d = list(map(int, input().split()))\r\nl = list(map(int, input().split()))\r\nc=0\r\nanswer = 0\r\nfor i in l:\r\n if i > b:\r\n continue\r\n else:\r\n c+=i\r\n\r\n if c > d:\r\n answer+=1\r\n c =0\r\n\r\nprint(answer)", "from sys import stdin\r\nn, maxsize, limit = [int(x) for x in stdin.readline().strip().split(\" \")]\r\nsizes = [int(x) for x in stdin.readline().strip().split(\" \")]\r\ncont = 0\r\njuice = 0\r\nfor i in sizes:\r\n if i <= maxsize:\r\n juice += i\r\n if juice > limit:\r\n cont += 1\r\n juice = 0\r\nprint(cont)", "from random import randrange\r\n\r\n\r\nn, b, d = map(int, input().split())\r\nsizes = list(map(int, input().split()))\r\n\r\nfor i in range(n):\r\n if sizes[i] > b:\r\n sizes[i] = 0\r\n \r\n\r\nans = 0\r\ncur_sum = 0\r\n\r\nfor i in sizes:\r\n cur_sum += i\r\n\r\n if cur_sum > d:\r\n cur_sum = 0\r\n ans += 1\r\n\r\nprint(ans)", "\r\nn, d, a = map(int, input().split())\r\nl = [i for i in map(int, input().split())]\r\nwasted = 0\r\nsqueezed = 0\r\nfor i in range(n):\r\n if l[i] <= d:\r\n squeezed += l[i]\r\n if squeezed > a:\r\n squeezed = 0\r\n wasted += 1\r\nprint(wasted)", "# n, b, d = map(int, input().split())\r\n# a = list(map(int, input().split()))\r\n# a_new = []\r\n# for i in range(len(a)):\r\n# count = 0\r\n# if a[i] < b:\r\n# a_new.append(a[i])\r\n# if len(a_new) == 0:\r\n# print('0')\r\n# continue\r\n# elif sum(a_new) < d:\r\n# print('0')\r\n# continue\r\n# elif sum(a_new) > d:\r\n# kek = sum(a_new)\r\n# while kek > d:\r\n# kek -= d\r\n# count += 1\r\n\r\n# print(count)\r\n# continue\r\nn, b, d = map(int, input().split())\r\nsizes = list(map(int, input().split()))\r\n\r\ntotal_size = 0\r\nwaste_empty_count = 0\r\n\r\nfor size in sizes:\r\n if size <= b:\r\n total_size += size\r\n if total_size > d:\r\n waste_empty_count += 1\r\n total_size = 0\r\n\r\nprint(waste_empty_count)\r\n\r\n\r\n\r\n\r\n", "n, b, d = map(int, input().split()) # Read n, b, d\r\na = list(map(int, input().split())) # Read the list of orange sizes\r\n\r\nwaste_count = 0 # Initialize the waste section count\r\ncurrent_waste = 0 # Initialize the current waste size\r\n\r\nfor size in a:\r\n if size > b:\r\n continue # Skip oranges that are too large for the juicer\r\n\r\n current_waste += size # Add the orange size to current waste\r\n\r\n if current_waste > d:\r\n waste_count += 1\r\n current_waste = 0 # Empty the waste section\r\n\r\nprint(waste_count)", "n, b, d = map(int, input().split())\r\noranges = [*map(int, input().split())]\r\nwaste = 0\r\nemptied = 0\r\nfor orange in oranges:\r\n if orange <= b:\r\n waste += orange\r\n if waste > d:\r\n emptied += 1\r\n waste = 0\r\nprint(emptied)", "n,b,d=map(int,input().split())\r\na=list(map(int,input().split()))\r\ns=0;k=0\r\nfor i in range(n):\r\n if a[i]<=b:\r\n s+=a[i]\r\n if s>d:\r\n k+=1\r\n s=0\r\nprint(k)\r\n \r\n", "\r\nn, b, d = list(map(int, input().split(\" \")))\r\narr = list(map(int, input().split(\" \")))\r\n\r\ncount = 0\r\nsums = 0\r\n\r\nfor x in arr:\r\n if x > b:\r\n continue\r\n sums += x\r\n\r\n if sums > d:\r\n count += 1\r\n sums = 0\r\n\r\nprint(count)\r\n\r\n", "n = list(map(int, input().split()))\r\nm = list(map(int, input().split()))\r\n\r\nsum = 0\r\ncount = 0\r\n\r\nfor i in m:\r\n\r\n if i <= n[1]:\r\n sum += i\r\n\r\n if sum > n[2]:\r\n count+=1\r\n sum = 0\r\n\r\nprint(count)", "import sys\r\nfrom collections import deque\r\ndef rs(): return sys.stdin.readline().rstrip()\r\ndef ri(): return int(sys.stdin.readline())\r\ndef ria(): return deque(map(int, sys.stdin.readline().split()))\r\ndef ws(s): sys.stdout.write(s)\r\ndef wi(n): sys.stdout.write(str(n) + '\\n')\r\ndef wia(a): sys.stdout.write('\\n'.join([str(x) for x in a]) + '\\n')\r\n #--------------------Solution------------------------\r\nn,b,d=ria()\r\nlst=ria()\r\ncnt,nigga=0,0\r\nfor i in lst:\r\n if i>b:continue\r\n else:\r\n cnt+=i\r\n if cnt>d:\r\n nigga+=1\r\n cnt=0\r\nwi(nigga)", "for _ in range(1):\r\n n,b,d=map(int,input().split())\r\n a=list(map(int,input().split()))\r\n c,ans=0,0\r\n for i in range(len(a)):\r\n if a[i]>b:\r\n continue\r\n c+=a[i]\r\n if c>d:\r\n c=0\r\n ans+=1\r\n print(ans)", "n , b , d = map(int,input().split())\r\nlst = list(map(int,input().split()))\r\nt = 0\r\ncount = 0 \r\nfor i in lst:\r\n if i <= b :\r\n if i > d-t:\r\n count+=1\r\n t = 0\r\n else:\r\n t+=i\r\nprint(count)", "n, b, d = map(int, input().split())\r\na = [int(x) for x in input().split()]\r\n\r\nt = 0\r\ncontainer = 0\r\nfor i, x in enumerate(a):\r\n if x > b:\r\n continue\r\n container += x\r\n if container > d:\r\n container = 0\r\n t += 1\r\nprint(t)\r\n", "n, b, d = map(int, input().split())\r\na = list(map(int, input().split()))\r\n\r\nsumi = 0\r\ncounter = 0\r\n\r\nfor orange in a:\r\n if orange <= b:\r\n sumi += orange\r\n if sumi > d:\r\n counter += 1\r\n sumi = 0\r\n\r\nprint(counter)", "\r\ninfo = list(map(int, input().split()))\r\noranges = list(map(int, input().split()))\r\n\r\nsolution = 0 \r\nwaste = 0\r\nfor i in oranges :\r\n if(waste > info[2]):\r\n waste = 0\r\n solution += 1\r\n if(i > info[1]) :\r\n continue\r\n waste += i\r\n if(waste > info[2]):\r\n waste = 0\r\n solution += 1\r\n\r\n\r\nprint(solution)", "n,b,d = map(int,input().split())\r\na = list(map(int,input().split()))\r\ncount=0\r\ns = 0\r\nfor i in range(n):\r\n if a[i]>b: continue\r\n s+=a[i]\r\n if s>d:\r\n count+=1\r\n s=0\r\nprint(count)", "n, b, d = list(map(int, input().split()))\r\noranges = list(map(int, input().split()))\r\n\r\nwaste = 0\r\ncount = 0\r\nfor o in oranges:\r\n if o <= b:\r\n waste += o\r\n if waste > d:\r\n count += 1\r\n waste = 0\r\n\r\nprint(count)\r\n", "n,mx,zi = map (int, input().split(' ')) \r\narr = list (map (int, input().split(' '))) \r\nwast = 0 \r\nans = 0 \r\nfor x in arr:\r\n if (x <= mx ) :\r\n wast += x \r\n if wast > zi :\r\n wast = 0 \r\n ans +=1 \r\nprint (ans)\r\n", "# import sys\r\n# sys.stdin = open('./input.txt', 'r')\r\n# sys.stdout = open('./output.txt', 'w')\r\n\r\nnum, max_size, overflow_size = map(int, input().split())\r\noranges = list(map(int, input().split()))\r\noranges = [x for x in oranges if x <= max_size]\r\ncurrent_sum = 0\r\nans = 0\r\nfor orange in oranges:\r\n current_sum += orange\r\n if current_sum > overflow_size:\r\n current_sum = 0\r\n ans += 1\r\nprint(ans)", "n,b,d = map(int, input().split())\ncur_waste = 0\n\noranges = list(map(int, input().split()))\n\nempty = 0\n\nfor i in oranges:\n if cur_waste > d:\n empty += 1\n cur_waste = 0\n \n if i <= b:\n cur_waste += i \n \nif cur_waste > d:\n empty += 1\n cur_waste = 0\n \nprint(empty) ", "n,a,b=map(int,input().split())\r\nx=list(map(int,input().split()))\r\ns=0\r\nif min(x)>a:\r\n print(\"0\")\r\nelse:\r\n m=0\r\n for i in x:\r\n if i<=a:\r\n m+=i\r\n if m>b:\r\n s+=1\r\n m=0\r\n print(s)\r\n", "n, b, d = map(int, input().split())\r\narr = [int(i) for i in input().split()]\r\narr.append(0)\r\n\r\nans = 0\r\nx = 0\r\nfor i in arr:\r\n if i > b:\r\n continue\r\n x += i\r\n if x > d:\r\n ans += 1\r\n x = 0\r\n\r\nprint(ans)", "def read_inputs():\r\n n, b, d= [int(c) for c in input().split()]\r\n sizes= [int(c) for c in input().split()]\r\n return n, b, d, sizes\r\ndef juicer(n, b, d, sizes):\r\n waste = 0\r\n iters = 0\r\n for orange in range(n):\r\n if sizes[orange] <= b :\r\n waste += sizes[orange]\r\n if waste > d :\r\n iters+=1\r\n waste=0\r\n return iters\r\nif __name__ == '__main__':\r\n n, b, d, sizes= read_inputs()\r\n print(juicer(n, b, d, sizes))", "n, b, d = [int(i) for i in input().split()]\r\na = input().split()\r\n\r\nc = 0\r\nm = 0\r\nfor i in a:\r\n i = int(i)\r\n if i > b:\r\n continue\r\n m += i\r\n if m > d:\r\n c += 1\r\n m = 0\r\n\r\nprint(c)\r\n", "n, b, d = map(int, input().split())\na = list(map(int, input().split()))\nt = 0\nc = 0\n\nfor i in range(n):\n if a[i] <= b:\n t += a[i]\n if t > d:\n t = 0\n c += 1\n \nprint(c)", "import sys\r\n\r\ninput = sys.stdin.readline\r\n\r\n\r\n############ ---- Input Functions ---- ############\r\ndef inp():\r\n return (int(input()))\r\n\r\n\r\ndef inlt():\r\n return (list(map(int, input().split())))\r\n\r\n\r\ndef insr():\r\n s = input()\r\n return (list(s[:len(s) - 1]))\r\n\r\n\r\ndef invr():\r\n return (map(int, input().split()))\r\n\r\n\r\nlt = inlt()\r\noranges = inlt()\r\nans = 0\r\nwaste = 0\r\nfor orange in oranges:\r\n if orange <= lt[1]:\r\n waste += orange\r\n if waste > lt[2]:\r\n ans += 1\r\n waste = 0\r\nprint(ans)\r\n\r\n", "ip = list(input().split(\" \"))\r\nsizes = list(input().split(\" \"))\r\nsz = int(ip[0])\r\nmx = int(ip[1])\r\nwaste = int(ip[2])\r\ntrash = 0\r\ncounter = 0\r\nfor i in range(sz):\r\n if int(sizes[i]) <= mx:\r\n trash += int(sizes[i])\r\n if trash > waste:\r\n trash = 0\r\n counter += 1\r\nprint(counter)\r\n", "import math\r\nn , b , d = [int(x) for x in input().split(\" \")]\r\nnums = [int(x) for x in input().split(\" \") if int(x) <= b]\r\n\r\ncounter = 0\r\nsumm = 0\r\nfor i in nums:\r\n summ += i\r\n if(summ > d):\r\n summ = 0\r\n counter += 1\r\nprint(counter) ", "a,b,c=input().split()\na=int(a)\nb=int(b)\nc=int(c)\nd=input()\nx=d.split()\nr=0\nn=0\nfor i in range(len(x)):\n x[i]=int(x[i])\n if x[i]<=b:\n r+=x[i]\n if r>c:\n n+=1 \n r=0\nprint(n)\n \t \t\t \t\t\t \t\t\t\t\t \t", "\r\nn,b,d = [int(x) for x in input().split(\" \")]\r\n\r\nlist_of_sizes = [int(y) for y in input().split(\" \")]\r\n\r\nnumber_of_empty_times = 0\r\ncurrent_situation = 0\r\n\r\nfor i in list_of_sizes:\r\n if i > b:\r\n continue\r\n else:\r\n current_situation += i\r\n if current_situation > d:\r\n number_of_empty_times +=1\r\n current_situation = 0\r\n\r\nprint(number_of_empty_times)\r\n", "# t = int(input())\n\n# import math\n\n# n, m = map(int, input().split())\n# a = list(map(int, input().split()))\n\n# a.sort()\n\nt = 1\nwhile t != 0:\n # n = int(input())\n n, b, d = map(int, input().split())\n a = list(map(int, input().split()))\n k = 0\n ans = 0\n for i in a:\n if i <= b:\n k += i\n if k > d:\n k = 0\n ans += 1\n print(ans)\n t -= 1\n", "n, b, d = map(int, input().split())\r\norange_sizes = list(map(int, input().split()))\r\n\r\ntotal_size = 0\r\nempty_count = 0\r\n\r\nfor size in orange_sizes:\r\n if size <= b:\r\n total_size += size\r\n if total_size > d:\r\n empty_count += 1\r\n total_size = 0\r\n\r\nprint(empty_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 ", "a,b,c=map(int,input().split())\r\nx=[int(i) for i in input().split()]\r\nd=0\r\ne=0\r\nfor i in x: \r\n if i<=b:\r\n d+=i\r\n if d>c:\r\n d=0\r\n e+=1\r\nprint(e)", "n, b, d = map(int, input().split())\r\na = list(map(int, input().split()))\r\ntotal_size = 0\r\nwaste_count = 0\r\nfor ai in a:\r\n if ai <= b:\r\n total_size += ai\r\n if total_size > d:\r\n waste_count += 1\r\n total_size = 0\r\nprint(waste_count)\r\n", "n,b,d=map(int,input().split())\r\nli=list(map(int,input().split()))\r\nju=0\r\nemp=0\r\nfor i in li:\r\n if i<=b:\r\n ju+=i\r\n if ju>d:\r\n ju=0\r\n emp+=1\r\n\r\nprint(emp) ", "n,b,d = list(map(int,input().split()))\r\n\r\na = list(map(int,input().split()))\r\n\r\ncount = 0\r\nsum1 = 0\r\n\r\nfor i in range(n):\r\n if a[i]<=b:\r\n sum1 = sum1 + a[i]\r\n\r\n if sum1 > d:\r\n count+=1\r\n sum1 = 0\r\n\r\nprint(count)\r\n", "n, b, d = map(int, input().split())\r\na = list(map(int, input().split()))\r\n\r\nsum = 0\r\nw = 0\r\nfor i in range(len(a)):\r\n if a[i] <= b:\r\n sum += a[i]\r\n if sum > d:\r\n w += 1\r\n sum = 0\r\n\r\nprint(w)\r\n", "n, b, d = map(int, input().split())\r\nc, s = 0, 0\r\nfor i in map(int, input().split()):\r\n if i <= b:\r\n s += i\r\n if s > d:\r\n c += 1\r\n s = 0\r\nprint(c)\r\n", "n, b, d = [int(s) for s in input().split()]\r\na = [int(s) for s in input().split()]\r\ntrash = 0\r\ncount = 0\r\nfor i in range(len(a)):\r\n if a[i] <= b:\r\n trash += a[i]\r\n if trash > d:\r\n count += 1\r\n trash = 0\r\nprint(count)", "n,b,d=map(int,input().split(' '))\r\ns=list(map(int,input().split(' ')))\r\noth=0\r\nk=0\r\nfor i in range(len(s)):\r\n\tif s[i]<=b:\r\n\t\toth+=s[i]\r\n\t\tif oth>d:\r\n\t\t\tk+=1\r\n\t\t\toth=0\r\nprint(k)" ]

[ "import sys\r\n\r\ndef input():\r\n return sys.stdin.readline()[:-1]\r\n\r\nN,M = list(map(int,input().split()))\r\ne_list = [[] for i in range(N)]\r\n\r\nX,Y = list(map(int,input().split()))\r\nX-=1\r\nY-=1\r\n\r\nfor i in range(M):\r\n u,v,w = list(map(int,input().split()))\r\n u-=1\r\n v-=1\r\n e_list[u].append((v,w))\r\n e_list[v].append((u,w))\r\n\r\nDP = [0]*N\r\n\r\nfrom heapq import heappop, heappush\r\n\r\ndef dijkstra(vi):\r\n for i in range(N):\r\n DP[i] = 10**18\r\n DP[vi] = 0\r\n q = []\r\n heappush(q, vi)\r\n while q:\r\n p = heappop(q)\r\n d = p>>10\r\n v = p&((1<<10)-1)\r\n if DP[v]<d:\r\n continue\r\n for v1,d1 in e_list[v]:\r\n if d+d1<DP[v1]:\r\n DP[v1] = d+d1\r\n heappush(q, ((d+d1)<<10)+v1)\r\n\r\nnew_edges = [[] for i in range(N)]\r\nfor i in range(N):\r\n t,c = list(map(int,input().split()))\r\n dijkstra(i)\r\n for j,d in enumerate(DP):\r\n if i!=j and d<=t:\r\n new_edges[i].append((j,c))\r\n\r\ne_list = new_edges\r\ndijkstra(X)\r\n\r\nif DP[Y]<10**18:\r\n print(DP[Y])\r\nelse:\r\n print(-1)", "import os, sys\r\nfrom io import IOBase, BytesIO\r\n\r\nBUFSIZE = 8192\r\n \r\n \r\nclass FastIO(BytesIO):\r\n newlines = 0\r\n \r\n def __init__(self, file):\r\n self._file = file\r\n self._fd = file.fileno()\r\n self.writable = \"x\" in file.mode or \"w\" in file.mode\r\n self.write = super(FastIO, self).write if self.writable else None\r\n \r\n def _fill(self):\r\n s = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\r\n self.seek((self.tell(), self.seek(0, 2), super(FastIO, self).write(s))[0])\r\n return s\r\n \r\n def read(self):\r\n while self._fill():\r\n pass\r\n return super(FastIO, self).read()\r\n \r\n def readline(self):\r\n while self.newlines == 0:\r\n s = self._fill()\r\n self.newlines = s.count(b\"\\n\") + (not s)\r\n self.newlines -= 1\r\n return super(FastIO, self).readline()\r\n \r\n def flush(self):\r\n if self.writable:\r\n os.write(self._fd, self.getvalue())\r\n self.truncate(0), self.seek(0)\r\n \r\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# Cout implemented in Python\r\nimport sys\r\n \r\n \r\nclass ostream:\r\n def __lshift__(self, a):\r\n sys.stdout.write(str(a))\r\n return self\r\n \r\n \r\ncout = ostream()\r\nendl = \"\\n\"\r\n\r\nInf = float(\"inf\")\r\n\r\nfrom heapq import *\r\n\r\ndef dij(root):\r\n global n, taxis, graph, y\r\n BC = {root : 0} ; BD = {root : 0}\r\n pq = [[0, root, 0, 1]]\r\n while pq:\r\n cost, u, d, use = heappop(pq)\r\n if u==y:\r\n cout<< cost\r\n exit()\r\n dd, cc = taxis[u]\r\n if d < dd and use: heappush(pq, [cost + cc, u, dd, 0])\r\n for v, l in graph[u].items():\r\n xd = d - l\r\n if xd >= 0:\r\n if cost < BC.get(v, Inf) or xd > BD.get(v, -1):\r\n BC[v], BD[v] = cost, xd\r\n heappush(pq, [cost, v, xd, 1])\r\n \r\n cout<< -1\r\n\r\ndef Solve():\r\n global n, taxis, graph, y\r\n n, m = list(map(int, input().split()))\r\n graph = {x: {} for x in range(1, n+1)}\r\n x, y = list(map(int, input().split()))\r\n for _ in range(m):\r\n u, v, w = list(map(int, input().split()))\r\n if v not in graph[u]: graph[u][v] = Inf\r\n if u not in graph[v]: graph[v][u] = Inf\r\n graph[u][v] = min(graph[u][v], w) ; graph[v][u] = min(graph[v][u], w)\r\n \r\n taxis = [[0, 0]] * (n+1)\r\n for i in range(1, n+1):\r\n taxis[i] = list(map(int, input().split()))\r\n \r\n dij(x)\r\n\r\nif __name__ == \"__main__\":\r\n Solve()", "\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\nfrom heapq import *\r\n\r\nf = lambda: map(int, input().split())\r\ninf = 1e13\r\n\r\nn, m = f()\r\nx, y = f()\r\np = [[] for i in range(n + 1)]\r\nfor j in range(m):\r\n u, v, w = f()\r\n p[u].append((v, w))\r\n p[v].append((u, w))\r\nd = [(0, 0)] + [tuple(f()) for k in range(n)]\r\n\r\nC, T = {x: 0}, {x: 0}\r\nh = [(0, x, 0, 1)]\r\nwhile h:\r\n c, u, t, q = heappop(h)\r\n if u == y: exit(print(c))\r\n dt, dc = d[u]\r\n if t < dt and q: heappush(h, (c + dc, u, dt, 0))\r\n for v, w in p[u]:\r\n dt = t - w\r\n if dt >= 0:\r\n if c < C.get(v, inf) or dt > T.get(v, -1):\r\n C[v], T[v] = c, dt\r\n heappush(h, (c, v, dt, 1))\r\nprint(-1)\t\t \t", "import heapq\r\nimport sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\ndef dijkstra(s):\r\n dist = [inf] * (n + 1)\r\n dist[s] = 0\r\n p = []\r\n heapq.heappush(p, (dist[s], s))\r\n while p:\r\n d, u = heapq.heappop(p)\r\n if dist[u] < d:\r\n continue\r\n for v, c in G[u]:\r\n nd = dist[u] + c\r\n if nd < dist[v]:\r\n dist[v] = nd\r\n heapq.heappush(p, (dist[v], v))\r\n return dist\r\n\r\nn, m = map(int, input().split())\r\nx, y = map(int, input().split())\r\nG = [[] for _ in range(n + 1)]\r\nfor _ in range(m):\r\n u, v, w = map(int, input().split())\r\n G[u].append((v, w))\r\n G[v].append((u, w))\r\ntc = [[0, 0]] + [list(map(int, input().split())) for _ in range(n)]\r\nh = []\r\nvisit = [0] * (n + 1)\r\nheapq.heappush(h, (0, x))\r\ninf = pow(10, 15) + 1\r\ndist = [inf] * (n + 1)\r\nwhile h:\r\n d, s = heapq.heappop(h)\r\n if visit[s]:\r\n continue\r\n dist[s] = d\r\n visit[s] = 1\r\n dist0 = dijkstra(s)\r\n t, c = tc[s]\r\n for i in range(1, n + 1):\r\n if not visit[i] and 0 < dist0[i] <= t:\r\n heapq.heappush(h, (d + c, i))\r\nans = (dist[y] + 1) % (inf + 1) - 1\r\nprint(ans)", "from heapq import *\r\n\r\n\r\ndef read_integers():\r\n return map(int, input().split())\r\n\r\n\r\ninf = 1e13\r\nn, m = read_integers()\r\nx, y = read_integers()\r\nroads = [[] for i in range(n + 1)]\r\n\r\nfor j in range(m):\r\n u, v, w = read_integers()\r\n roads[u].append((v, w))\r\n roads[v].append((u, w))\r\n\r\ndrivers = [(0, 0)] + [tuple(read_integers()) for k in range(n)]\r\nC, T = {x: 0}, {x: 0}\r\nheap = [(0, x, 0, 1)]\r\n\r\nwhile heap:\r\n cost, junction, time, query = heappop(heap)\r\n\r\n if junction == y:\r\n exit(print(cost))\r\n \r\n driver_time, driver_cost = drivers[junction]\r\n\r\n if time < driver_time and query:\r\n heappush(heap, (cost + driver_cost, junction, driver_time, 0))\r\n \r\n for neighbor, road_length in roads[junction]:\r\n new_time = time - road_length\r\n if new_time >= 0:\r\n if cost < C.get(neighbor, inf) or new_time > T.get(neighbor, -1):\r\n C[neighbor], T[neighbor] = cost, new_time\r\n heappush(heap, (cost, neighbor, new_time, 1))\r\n\r\nprint(-1)# 1698324509.0968862", "'''\r\n# Submitted By M7moud Ala3rj\r\nDon't Copy This Code, CopyRight . [email protected] © 2022-2023 :)\r\n'''\r\n# Problem Name = \"Volleyball\"\r\n# Class: C\r\n\r\nimport sys\r\nfrom heapq import *\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\n\r\nInf = float(\"inf\")\r\n\r\ndef dij(root):\r\n global n, taxis, graph, y\r\n BC = {root : 0} ; BD = {root : 0}\r\n pq = [[0, root, 0, 1]]\r\n while pq:\r\n cost, u, d, use = heappop(pq)\r\n if u==y:\r\n print(cost)\r\n exit()\r\n dd, cc = taxis[u]\r\n if d < dd and use: heappush(pq, [cost + cc, u, dd, 0])\r\n for v, l in graph[u]:\r\n xd = d - l\r\n if xd >= 0:\r\n if cost < BC.get(v, Inf) or xd > BD.get(v, -1):\r\n BC[v], BD[v] = cost, xd\r\n heappush(pq, [cost, v, xd, 1])\r\n \r\n print(-1)\r\n\r\ndef Solve():\r\n global n, taxis, graph, y\r\n n, m = list(map(int, input().split()))\r\n graph = {x: set() for x in range(1, n+1)}\r\n x, y = list(map(int, input().split()))\r\n for _ in range(m):\r\n u, v, w = list(map(int, input().split()))\r\n graph[u].add((v, w)) ; graph[v].add((u, w))\r\n \r\n taxis = [[0, 0]] * (n+1)\r\n for i in range(1, n+1):\r\n taxis[i] = list(map(int, input().split()))\r\n \r\n dij(x)\r\n\r\nif __name__ == \"__main__\":\r\n Solve()" ]

[ "# LUOGU_RID: 99814317\nans=0x3f3f3f3f\r\nn=int(input())\r\na=list(map(int,input().split()))#输入n个点的位置坐标\r\nb=n//2\r\na.sort()#给n个点的位置坐标从小到大排序\r\nfor i in range(b):#找出最后剩下的两个点的位置坐标的最小值\r\n ans=min(ans,a[b+i]-a[i])#a[b+i]为剩下右侧的点的位置坐标，a[i]为剩下左侧的点的位置坐标\r\nprint(ans)", "# LUOGU_RID: 99814222\nans=0x3f3f3f3f\r\nn=int(input())\r\na=list(map(int,input().split()))\r\nb=n//2\r\na.sort()\r\nfor i in range(b):\r\n ans=min(ans,a[b+i]-a[i])\r\nprint(ans)\r\n", "n = int(input())\nv = sorted([int(i) for i in input().split()])\nans = 2 ** 40\nfor i in range(n//2):\n ans = min(ans, v[i + n//2] - v[i])\nprint(ans)\n\n \t \t \t \t\t\t\t \t\t\t\t\t\t\t\t \t \t \t", "n = int(input())\r\nx = sorted(list(map(int, input().split())))\r\n\r\nans = int(2e9)\r\nfor i in range(n // 2):\r\n ans = min(ans, x[i + (n // 2)] - x[i])\r\nprint(ans)", "n = int(input())\r\nxs = list(map(int, input().split()))\r\nxs.sort()\r\nm = n//2\r\nprint(min(a - b for a, b in zip(xs[m:], xs)))\r\n", "def main():\n n = int(input())\n l = sorted(map(int, input().split()))\n print(min(b - a for a, b in zip(l, l[n // 2:])))\n\n\nif __name__ == '__main__':\n main()\n", "n = int(input())\nn = n>>1\na = list(map(int, input().split()))\na.sort()\nans = float('inf')\n\nfor i in range(n):\n j = i+n\n ans = min(ans, a[j]-a[i])\n\nprint(ans)", "n = int(input())\r\nx = list(map(int, input().split()))\r\nx.sort()\r\nmini = int(1e9)\r\nfor i in range(n // 2):\r\n if x[i + n // 2] - x[i] < mini: mini = x[i + n // 2] - x[i]\r\n \r\nprint(mini)\r\n", "R = lambda : map(int,input().split())\n\nn = int(input())\np = sorted(list(R()))\nm = 10**19\n\nfor i in range(n//2):\n m = min(m, p[i+n//2]-p[i])\n\nprint(m)\n\n", "def boxer_sniper(lst):\r\n lst.sort()\r\n ln=len(lst)\r\n ans=10000000000000\r\n for i in range(ln//2):\r\n ans=min(ans,lst[i+ln//2]-lst[i])\r\n return ans\r\n\r\nn=int(input())\r\nlst=list(map(int,input().split()))\r\nprint(boxer_sniper(lst))\r\n", "from itertools import accumulate\nm = int(input())//2\nX = [int(x) for x in input().split()]\nX.sort()\nZ = [X[i+m] - X[i] for i in range(m)]\nprint(min(Z))\n\n", "def distance(xi):\n xi = sorted(xi)\n k = len(xi) // 2\n return min(xi[i+k]-xi[i] for i in range(k))\n\n\nif __name__ == '__main__':\n n = int(input())\n xi = map(int, input().split())\n print(distance(xi)) \n", "#!/usr/bin/env python3\n\nn = int(input())\nn_2 = n // 2\nx = sorted([int(tok) for tok in input().split()])\nres = min((x[j] - x[j-n_2] for j in range(n_2, n)))\nprint(res)\n", "n=int(input())\r\na=sorted(list(map(int,input().split())))\r\nans,s=2147483647,n>>1\r\nfor i in range(s):\r\n ans=min(ans,a[i+s]-a[i])\r\nprint(ans)", "n = int(input())\r\nx = sorted(list(map(int, input().split())))\r\nprint(min([x[i + n // 2] - x[i] for i in range(n // 2)]))\r\n" ]

[ "pages = int(input())\r\ndays = list(map(int, input().split()))\r\ncurrent = -1\r\nwhile pages > 0:\r\n current += 1\r\n if current == 7:\r\n current = 0\r\n pages -= days[current]\r\n \r\nprint(current + 1)\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\ni = 0\r\nwhile n>a[i]:\r\n n-=a[i]\r\n i = (i+1)%7\r\nprint(i+1)", "n=int(input())\r\na=list(map(int,input().split()))\r\nk=0\r\nt=0\r\ni=0\r\nwhile t<n:\r\n if i==7:\r\n i=0\r\n t+=a[i]\r\n i+=1\r\nprint(i)", "n=int(input())\r\narray=list(map(int,input().split()))\r\nidx=0\r\nwhile n>0:\r\n\tif array[idx]>=n:\r\n\t\tprint(idx+1)\r\n\t\tbreak\r\n\tn-=array[idx]\r\n\tidx+=1\r\n\tif idx==7:\r\n\t\tidx=0\r\n", "pages_count = int(input())\r\nread_per_day = [int(x) for x in input().split()]\r\ni = 0\r\nwhile True:\r\n\tpages_count -= read_per_day[i]\r\n\tif pages_count <= 0:\r\n\t\tbreak\r\n\ti += 1\r\n\tif i > 6:\r\n\t\ti = 0\r\nprint(i + 1)", "n=int(input())\r\na=[int(x) for x in input().split()]\r\ni=0\r\nwhile n>0:\r\n n-=a[i]\r\n i+=1\r\n i%=7\r\n \r\nprint(7) if i==0 else print(i) ", "n=int(input())\r\na=list(map(int,input().split()))\r\nwhile(True):\r\n if n<=0:\r\n break\r\n else:\r\n for i in range(0,7):\r\n n=n-a[i]\r\n if n<=0:\r\n break\r\nprint(i+1) \r\n", "n = int(input())\r\nday = list(map(int, input().split()))\r\ncnt = 0\r\np = day[0]\r\n\r\nwhile (p < n):\r\n cnt += 1\r\n cnt %= 7\r\n p += day[cnt]\r\nprint(cnt + 1)", "n = int(input())\nday = list(map(int, input().split()))\ncnt = 0\np = day[0]\n\nwhile (p < n):\n cnt += 1\n cnt %= 7\n p += day[cnt]\nprint(cnt + 1)\n \t\t\t \t \t\t\t \t \t\t\t \t\t \t", "def main():\r\n pages = int(input())\r\n a,b,c,d,e,f,g = map(int,input().split())\r\n week = [a,b,c,d,e,f,g]\r\n if 1 <= pages <= 1000:\r\n day = 1\r\n while True:\r\n if day > 7 : day = 1\r\n pages -= week[day-1]\r\n if pages <= 0:\r\n print(day)\r\n break\r\n day += 1\r\n\r\nmain()", "n=int(input())\r\ndays=input().split()\r\nsum=0\r\ni=0\r\nwhile True:\r\n sum+=int(days[i])\r\n if sum>=n:\r\n print(i+1)\r\n break\r\n elif i==6:\r\n i=0\r\n else:\r\n i+=1", "n=int(input())\r\nl=list(map(int,input().split()))\r\nsum=0\r\ncount=0\r\nwhile(True):\r\n sum=sum+l[count]\r\n if sum >= n:\r\n print(count+1)\r\n break\r\n if count<6:\r\n count+=1\r\n else:\r\n count=0\r\n", "d = 0\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\nif sum(a) > n:\r\n for index, i in enumerate(a):\r\n d += i\r\n if d >= n:\r\n c = index\r\n break\r\nelse:\r\n while d < n:\r\n for index, i in enumerate(a):\r\n d += i\r\n if d >= n:\r\n c = index\r\n break\r\n\r\nprint(c + 1)\r\n", "t = int(input())\n\nweeks = list(map(int,input().split()))\n\npages_read = 0\nweek = 0\nwhile pages_read < t :\n if week == 6:\n pages_read += weeks[week]\n week = 0\n else:\n pages_read += weeks[week]\n week += 1\n\nprint(week if week > 0 else 7)", "n=int(input())\r\nl=list(map(int, input().split()))\r\ni=0\r\nwhile True:\r\n n-=l[i]\r\n if(n<=0): \r\n print(i+1)\r\n break\r\n i+=1\r\n if(i==7): i=0", "pages=int(input())\nschedule=list(map(int,input().split()))\nwhile pages>0:\n for x in range (0,7):\n if pages<=0:\n break\n day=x\n pages-=schedule[x]\n\nprint(day+1)", "n = int(input())\na = [int(x) for x in input().split()]\nans = 0\nwhile(n > 0):\n if ans == 7:\n ans = 0\n n -= a[ans]\n ans += 1\nprint(ans)\n", "n = int(input())\r\na = list(map(int, input().split()))\r\ni = 0\r\nwhile n - a[i] > 0:\r\n n -= a[i]\r\n i += 1\r\n if i==7:\r\n i = 0\r\nprint(i+1)\r\n", "tot_pages = int(input())\r\nli = dict(zip(range(1,8), list(map(int,input().split())))) \r\ncount=0\r\nwhile(count<tot_pages):\r\n for key in range(1,8):\r\n if count<tot_pages:\r\n count += li[key]\r\n last_day = key\r\nprint(last_day)", "n=int(input())\r\nm,t,w,th,fr,sat,sun=map(int,input().split())\r\n\r\nnum=0\r\nwhile True:\r\n \r\n n-=m\r\n if n<=0:\r\n num=1\r\n break\r\n n-=t\r\n if n<=0:\r\n num=2\r\n break\r\n \r\n n-=w\r\n if n<=0:\r\n num=3\r\n break\r\n n-=th\r\n if n<=0:\r\n num=4\r\n break\r\n n-=fr\r\n if n<=0:\r\n num=5\r\n break\r\n n-=sat\r\n if n<=0:\r\n num=6\r\n break\r\n n-=sun\r\n if n<=0:\r\n num=7\r\n break\r\nprint(num)\r\n \r\n \r\n \r\n", "page = int(input())\r\ns = list(map(int,input().split()))\r\nwhile page > 0:\r\n\tfor day in range(len(s)):\r\n\t\tpage = page - s[day]\r\n\t\tif page <= 0:\r\n\t\t\tbreak\r\nprint(day + 1)", "n=int(input())\r\nl=list(map(int,input().split()))\r\n\r\nc=0\r\n\r\nfor i in range(10000):\r\n x=i%7\r\n c+=l[x]\r\n if c>=n:\r\n \r\n break\r\nprint(x+1)", "\n\ndef main():\n n = int(input())\n arr = [int(x) for x in input().split()]\n sum = 0\n i = 0\n while sum < n:\n if i == 7:\n i = 0\n sum+=arr[i]\n i+=1\n print(i)\n\n return\n\nmain()", "def finished(str, arr):\r\n while 1:\r\n for i in range(7):\r\n str -= arr[i]\r\n if str <= 0:\r\n return i + 1\r\n\r\nif __name__ == '__main__':\r\n str = int(input())\r\n arr = [int(i) for i in input().split()]\r\n\r\n print(finished(str, arr))\r\n", "c=0\r\nd=0\r\nn=int(input())\r\nm=list(map(int,input().split()))\r\ni=0\r\nwhile c<n:\r\n\tc+=m[i]\r\n\ti+=1\r\n\td+=1\r\n\tif d==7:\r\n\t\ti=0\r\n\tif d==8:\r\n\t\td=1\r\nprint(d)\t\t\t\r\n", "z=input\r\n\r\nn=int(z())\r\nl=(list(map(int,z().split())))\r\ns=0\r\nc=0\r\nwhile True:\r\n c=0\r\n for i in l:\r\n c+=1\r\n s+=i\r\n if s>=n:\r\n print(c)\r\n exit(0)\r\n \r\n \r\n \r\n \r\n\r\n \r\n \r\n \r\n \r\n", "def low(n):\r\n i=0\r\n while i<len(a) and n>0:\r\n n-=a[i]\r\n if n<=0:\r\n print(i+1)\r\n break\r\n i+=1\r\ndef high(n):\r\n i=0\r\n while i<len(a) and n>0:\r\n n-=a[i]\r\n if n<=0:\r\n print(i+1)\r\n break\r\n i+=1\r\n\r\n\r\n\r\nn=int(input())\r\na=list(map(int,input().split()))\r\nd=0\r\nfor i in range (len(a)):\r\n d+=a[i]\r\ns=n%d\r\nif s==0:\r\n n=d\r\n low(n)\r\nelse:\r\n n=s\r\n high(n)", "n = int(input())\r\n\r\npage = list(map(int, input().split()))\r\n\r\nsum = 0\r\nday = -1\r\n\r\nwhile sum < n:\r\n if sum < n:\r\n for i in range(len(page)):\r\n day = i + 1\r\n sum += page[i]\r\n if sum >= n:\r\n break\r\n\r\nprint(day)\r\n", "n = int(input())\r\nl = list(map(int, input().split()))\r\nc = 0\r\ni = 0\r\nwhile n > 0:\r\n\tif i == 7:\r\n\t\tc = 0\r\n\t\ti = 0\r\n\tn = n - l[i]\r\n\tc = c + 1\r\n\ti = i + 1\r\n\t#print(\"n\", str(n))\r\n\t#print(\"c\", str(c))\r\n\r\n\r\nprint(c)\r\n", "item = 0\nn = int(input())\nx = [int(x) for x in input().split(maxsplit=7)[:7]]\n\nwhile True:\n\tif item == 7:\n\t\titem = 0;\n\tn -= x[item]\n\n\tif n <= 0:\n\t\tprint(item + 1)\n\t\tbreak\n\titem += 1\n\n\t \t\t \t\t \t\t\t \t \t\t\t \t\t\t\t \t\t \t", "n = int(input())\r\nd = list(map(int, input().split()))\r\nday = 0\r\nr = d[0]\r\nwhile r<n:\r\n day += 1\r\n day %= 7\r\n r += d[day]\r\nprint(day+1)", "a = int(input())\r\nb = list(map(int,input().split(\" \")))\r\nsum = 0\r\ncount = 0\r\nwhile sum < a:\r\n for i in range(len(b)):\r\n if sum >= a:\r\n break\r\n sum += b[i]\r\n count = i + 1 \r\n \r\nprint(count)", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Sat Mar 11 19:42:53 2023\r\n\r\n@author: rohan\r\n\"\"\"\r\n\r\nn = int(input())\r\nnums = list(map(int, input().split()))\r\n\r\nans = 1\r\ni = 0\r\nwhile n > 0:\r\n if nums[i % 7]:\r\n n -= nums[i % 7]\r\n ans = (i % 7) + 1\r\n\r\n i += 1\r\nprint(ans)", "n=int(input())\r\nuser_list=input().split()\r\nl=[]\r\nfor i in user_list:\r\n l.append(int(i))\r\nflag = True\r\ni=0\r\nans=0\r\nwhile n>0:\r\n i = 0 \r\n while n>0 and i<7:\r\n n-=l[i]\r\n i+=1 \r\nprint(i)", "n = int(input())\r\na = list(map(int, input().split()))\r\n\r\ncount = 0\r\n\r\nwhile n > 0:\r\n n -= a[count]\r\n if n <= 0:\r\n break\r\n \r\n count = (count + 1) % 7\r\n \r\n\r\nprint(count + 1)", "n=int(input())\r\nar=list(map(int, input().split()))\r\ni=0\r\nflag=0\r\nwhile(n>0):\r\n if n>=ar[i]:\r\n n=n-ar[i]\r\n if n==0:\r\n break\r\n else:\r\n break\r\n i+=1\r\n if i>6:\r\n i=0\r\nprint(i+1)\r\n\r\n", "from sys import stdin; inp = stdin.readline\r\nfrom math import dist, ceil, floor, sqrt, log\r\ndef IA(): return list(map(int, inp().split()))\r\ndef FA(): return list(map(float, inp().split()))\r\ndef SA(): return inp().split()\r\ndef I(): return int(inp())\r\ndef F(): return float(inp())\r\ndef S(): return inp()\r\n\r\ndef main():\r\n n = I()\r\n a = IA()\r\n d = {}\r\n for i in range(1, len(a)+1):\r\n d[i] = a[i-1]\r\n c = 1 \r\n while True:\r\n n-=d[c]\r\n if n <= 0:\r\n return c \r\n else:\r\n c = 1 if c==7 else c+1\r\n\r\nif __name__ == '__main__':\r\n print(main())", "n = int(input())\r\nvals = list(map(int,input().split()))\r\nread = 0\r\nwhile read < n:\r\n for x in range(len(vals)):\r\n read += vals[x]\r\n if read >= n:\r\n day = x+1\r\n break\r\nprint(day)\r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\ns=0\r\nfor i in range(10000001):\r\n s+=a[i%7]\r\n if s>=n:\r\n j=i\r\n break\r\nif j+1<=7:\r\n print(j+1)\r\nelse:\r\n k=j%7\r\n print(k+1)", "pq=int(input())\r\ndays=[int(x) for x in input().split()]\r\ni=0\r\nsum=0\r\nwhile(i<7):\r\n sum+=days[i]\r\n if(sum>=pq):\r\n print(i+1)\r\n break\r\n if(i==6):\r\n i=-1\r\n i+=1\r\n ", "n = int(input())\r\np1, p2, p3, p4, p5, p6, p7 = map(int, input().split())\r\nd = [p1, p2, p3, p4, p5, p6, p7]\r\n\r\ncn = n\r\nflag = 1\r\nwhile cn > 0 and flag == 1:\r\n for i in range(7):\r\n if cn - d[i] <= 0:\r\n print(i+1)\r\n flag = 0\r\n break\r\n else:\r\n cn -= d[i]", "n = int(input())\nm = list(map(int, input().split()))\n\ns = 0\nf = False\n\nwhile s < n:\n if f:\n break\n for i in range(len(m)):\n if (s >= n):\n f = True\n break\n\n s += m[i]\n\n if (s >= n):\n print(i + 1)\n f = True\n break\n \t\t \t\t \t \t\t\t \t \t \t \t\t", "# http://codeforces.com/problemset/problem/139/A\r\n\r\nn = int(input())\r\ndays = list(map(int, input().split()))\r\ncurr_day = 1\r\nwhile n > 0:\r\n n -= days[curr_day - 1]\r\n if n <= 0:\r\n break\r\n curr_day = (curr_day % 7) + 1\r\n\r\nprint(curr_day)\r\n", "a, b, i = int(input()), [int(i) for i in input().split()], -1\r\nwhile a > 0:\r\n i += 1\r\n if i == 7:\r\n i = 0\r\n a -= b[i]\r\nprint(i + 1)", "n=int(input())\r\nl=list(map(int,input().split()))\r\ni=0\r\nwhile(n>0):\r\n if i==7:\r\n i=0\r\n n -= l[i]\r\n if n>0:\r\n i+=1\r\nprint(i+1)\r\n\r\n", "def fun(n,z):\r\n while(1):\r\n for i in range(7):\r\n if(n-z[i]<=0):\r\n p=i+1\r\n return p\r\n else:\r\n n=n-z[i]\r\n\r\n\r\nn = int(input())\r\nz = list(map(int, input().split()))\r\nk=fun(n,z)\r\nprint(k)", "n = int(input())\nweek = list(map(int, input().split(\" \")))\nremains = n\nday = 0\nwhile remains > 0:\n remains -= week[day]\n day = day + 1 if day < 6 else 0\nprint(day if day > 0 else 7)\n", "n = int(input())\r\npages = list(map(int, input().split()))\r\npagesperweek = sum(pages)\r\nif n <= pagesperweek:\r\n new_n = n\r\nelse:\r\n if n % pagesperweek == 0:\r\n new_n = (n % pagesperweek) + pagesperweek\r\n else:\r\n new_n = n % pagesperweek\r\nfor i in range(7):\r\n if new_n <= pages[i]:\r\n print(i + 1)\r\n break\r\n else:\r\n new_n -= pages[i]", "n=int(input())\r\nlstpgs=[int(k) for k in input().split()]\r\nsumpg=0\r\nans=False\r\nwhile sumpg<n:\r\n if ans:\r\n break\r\n for i in range(len(lstpgs)):\r\n if(sumpg>=n):\r\n ans=True\r\n break\r\n sumpg+=lstpgs[i]\r\n if(sumpg>=n):\r\n print(i+1)\r\n ans=False\r\n break", "n = int(input());\r\narr = list(map(int,input().split(\" \")));\r\nans=-1;\r\nwhile n>0:\r\n for i in range(7):\r\n n-=arr[i];\r\n if n<=0:\r\n ans=i+1;\r\n break;\r\n \r\nprint(ans);", "n=int(input())\r\ns=list(map(int,input().split()))\r\ni=-1\r\nwhile n>0:\r\n i=(i+1)%7\r\n n-=s[i]\r\nprint(i+1)\r\n ", "class solution:\r\n # def support(self,n,m,count):\r\n \r\n \r\n def solve(self):\r\n n=int(input())\r\n week=list(map(int,input().split(' ')))\r\n i=0\r\n while n>0:\r\n n-=week[i%7]\r\n #print(i,n)\r\n if n<=0:\r\n print((i%7)+1)\r\n i+=1\r\n \r\nsol=solution()\r\nsol.solve()\r\n\r\n", "n = int(input())\r\ndata = list(map(int, input().split()))\r\n\r\ncnt = -1\r\nwhile n > 0:\r\n cnt += 1\r\n n -= data[cnt % 7]\r\n\r\nprint(cnt % 7 + 1)", "n = int(input())\r\nnums = [int(j) for j in input().split()]\r\np = 0\r\nwhile n > 0:\r\n n -= nums[p]\r\n if n <= 0:\r\n break\r\n p += 1\r\n p %= 7\r\nprint(p + 1)\r\n", "n=int(input())\r\ns=0\r\na = list(map(int,input().strip().split()))[:7]\r\nwhile(s<n):\r\n for i in range(0,7):\r\n \r\n s+=a[i]\r\n if(s>=n):\r\n break\r\n \r\n\r\n \r\n \r\nprint(i+1)", "n = int(input())\r\na = list(map(int, input().split()))\r\nf = True\r\nwhile f:\r\n\tfor i in range(1, 8):\r\n\t\tif (n - a[i-1]) < 1:\r\n\t\t\tprint(i)\r\n\t\t\tf = False\r\n\t\t\tbreak\r\n\t\telse:\r\n\t\t\tn -= a[i-1]", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Thu Dec 22 12:40:21 2022\r\n\r\n@author: Lenovo\r\n\"\"\"\r\n\r\nn = int(input())\r\nx = input()\r\nx = x.split()\r\np = []\r\nfor i in x:\r\n p.append(int(i))\r\n\r\nsoma = 0\r\ni=0\r\nj=0\r\nwhile soma<n:\r\n soma+=p[i]\r\n if i==6:\r\n i=0\r\n j=1\r\n else:\r\n i+=1\r\n j=0\r\nif j==1:\r\n print(7)\r\nelse:\r\n print(i)\r\n \r\n\r\n", "n = int(input())\r\n\r\ndata = []\r\ndata = list(map(int, input().split(' ')))\r\n\r\nx = 0\r\n\r\nres = 0\r\n\r\nwhile x < n: \r\n for i in range(0, len(data)):\r\n x = x + data[i]\r\n if x >= n:\r\n res = i\r\n break\r\n\r\nprint(res + 1)", "d = int(input())\r\narray = []\r\nfor a in input().split():\r\n array.append(int(a))\r\na = 0\r\nwhile d > 0:\r\n for a in range(7):\r\n d = d - array[a]\r\n if d <= 0:\r\n break\r\nprint(str(int(a) + 1))\r\n\r\n'''\r\nПример из задания 1:\r\nВвод:\r\n100\r\n15 20 20 15 10 30 45\r\nВывод:\r\n6\r\n\r\nПример из задания 2:\r\nВвод:\r\n2\r\n1 0 0 0 0 0 0\r\nВывод:\r\n1\r\n'''", "n = int(input())\r\nls = list(map(int, input().split()))\r\ni = -1\r\nwhile n > 0:\r\n i += 1\r\n if i == 7:\r\n i = 0\r\n n -= ls[i]\r\n \r\nprint(i + 1)", "n = int(input())\r\na = [int(i) for i in input().split()]\r\nwhile n > 0:\r\n\tfor i in range(1, 8):\r\n\t\tn -= a[i-1]\r\n\t\tif(n <= 0):\r\n\t\t\tprint(i)\r\n\t\t\texit(0)", "n=int(input())\r\nl=list(map(int,input().split(\" \")))\r\nc=0\r\nwhile(n>0):\r\n for i in range(len(l)):\r\n if(n>0):\r\n n=n-l[i]\r\n c=i\r\n else:\r\n break\r\nprint(c+1)\r\n", "pages = int(input())\r\nperday = [int(x) for x in input().split()]\r\n\r\nwhile pages > 0:\r\n for i in range(7):\r\n pages = pages - perday[i]\r\n\r\n if pages <= 0:break\r\n\r\nprint(i + 1)\r\n \r\n", "n = int(input())\nls = list(map(int, input().split()))\ni = 0\ns = 0\nwhile i<=len(ls):\n if i == len(ls):\n i=0\n s += ls[i]\n if s>= n:\n print(i+1)\n break\n i += 1\n", "n = int(input())\r\na = list(map(int, input().split()))\r\nt = a[0]\r\ni = 0\r\nwhile t < n:\r\n i += 1\r\n i %= 7\r\n t += a[i]\r\nprint(i + 1)", "def solve(n, daily):\r\n\r\n i = 0\r\n while n - daily[i] > 0:\r\n\r\n n -= daily[i]\r\n i = (i+1) % 7\r\n\r\n return i+1 #+1 since array index start from 0, but the weekday start from 1\r\n\r\n\r\nif __name__ == \"__main__\":\r\n n = int(input())\r\n daily = list(map(int,input().split(\" \")))\r\n print(solve(n, daily))", "n = int(input())\r\n\r\nt = [int(pqrs) for pqrs in input().split()]\r\nk = sum(t)\r\nn = n%sum(t)+ sum(t)\r\nfor i, j in enumerate(t):\r\n n -= j\r\n if n <= 0:\r\n print (i + 1)\r\n break\r\nif n > 0:\r\n for i, j in enumerate(t):\r\n n -= j\r\n if n <= 0:\r\n print (i + 1)\r\n break\r\n \r\n# https://a2oj.herokuapp.com/?handle=aryan1113&rating=1&div=0", "n = int(input())\r\nlst = list(map(int, input().split()))\r\ncnt = 0\r\nx = True\r\nwhile x == True:\r\n for i in range(7):\r\n cnt += lst[i]\r\n if cnt >= n:\r\n print(i+1)\r\n x = False\r\n break", "n = int(input())\r\nnums = [int(i) for i in input().split()]\r\nn = n%sum(nums)\r\nif not n:\r\n i = len(nums)-1\r\n while nums[i] == 0: i -= 1\r\n print(i+1)\r\nelse:\r\n for i in range(len(nums)):\r\n if nums[i] >= n: \r\n print(i+1)\r\n break\r\n n -= nums[i]", "col_page=int(input())\r\ncan_read=list(map(int,input().split()))\r\ncol_read=0\r\nday_of_week=0\r\ni=0\r\nwhile col_read<col_page:\r\n if day_of_week>=7:\r\n day_of_week=1\r\n else:\r\n day_of_week+=1\r\n \r\n if i==len(can_read):\r\n i=0\r\n\r\n col_read+=can_read[i]\r\n i+=1\r\n\r\nprint(day_of_week)\r\n", "n=int(input())\r\nd=list(map(int,input().split()))\r\nc=0\r\ndei=0\r\nwhile n>0:\r\n n-=d[dei]\r\n c+=1\r\n if dei==6:\r\n dei=0\r\n else:\r\n dei+=1\r\nif c%7==0:\r\n print(7)\r\nelse:\r\n print(c%7)", "n = int(input())\r\narr = [int(i) for i in input().split()]\r\ni = 0\r\nwhile n > 0:\r\n if i >= len(arr):\r\n i = 0\r\n n -= arr[i]\r\n i += 1\r\n\r\nprint(i)\r\n", "from collections import deque\r\nimport math\r\nfrom random import randint as rand\r\nfrom functools import lru_cache\r\nimport string\r\nalph_l = string.ascii_lowercase\r\nalph_u = string.ascii_uppercase\r\n\r\n\r\n\r\n\r\ndef main():\r\n n = int(input())\r\n a = list(map(int, input().split()))\r\n n = (n % sum(a)) + sum(a)\r\n while n > 0:\r\n for i in range(7):\r\n n-=a[i]\r\n if n <= 0:\r\n print(i+1)\r\n break\r\n\r\nif __name__ == \"__main__\":\r\n main()", "n=int(input())\r\nmatrix=list(map(int,input().split()))\r\nwhile n>0:\r\n for i in range(len(matrix)):\r\n if n>0:\r\n n=n-matrix[i]\r\n temp=i\r\nprint(temp+1) ", "def result(p,lis):\n\ti=0\n\tsum=0\n\twhile i<=len(lis)-1: \n\t\tsum=sum+lis[i]\n\t\tif sum>=p:\n\t\t\tprint(i+1)\n\t\t\tbreak \n\t\tif i==len(lis)-1:\n\t\t\ti=0\n\t\telse:\t \n\t\t\ti=i+1\t\t\t\n\n\n\n\n\n\np=int(input())\nlis=list(map(int,input().split()))\nresult(p,lis)\n", "p=int(input());l=list(map(int,input().split()));s=0;i=0\r\nwhile s+l[i]<p:\r\n\ts+=l[i]\r\n\ti+=1\r\n\tif i>6:i=0\r\nprint(i+1)", "n=int(input())\r\na=list(map(int,input().split()))\r\nd=0\r\nwhile (n-a[d])>max(0,n-sum(a)):\r\n n-=a[d]\r\n d+=1\r\n if d==7:\r\n d=0\r\nprint(d+1)\r\n", "n=int(input())\r\nlimit = list(map(int,input().split()))\r\ni=1\r\nwhile n>0:\r\n if i>7:\r\n i=1\r\n n-=limit[i-1]\r\n i=i+1\r\nprint(i-1)", "n = int(input())\r\na = list(map(int,input().split()))\r\nn %= sum(a)\r\nn += sum(a)\r\nf=0\r\nfor j in range(2):\r\n for i in range(7):\r\n n-=a[i]\r\n if n<=0:\r\n print(i+1)\r\n f=1\r\n break\r\n if f: break", "def Peter(n,l):\r\n s=0\r\n while True:\r\n for i in range(len(l)):\r\n s+=l[i]\r\n if s>=n:\r\n return i+1\r\n\r\nn=int(input())\r\nl=[int(i) for i in input().split()]\r\nresult=Peter(n,l)\r\nprint(result)\r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\nl=0\r\nwhile l<n:\r\n for i in range(7):\r\n l=l+a[i]\r\n if l>=n:\r\n break\r\nprint(i+1)", "n = int(input())\nargs = tuple(map(int, input().split()))\n\nj = 0\nwhile True:\n n -= args[j]\n\n if n <= 0:\n break\n\n if j == len(args) - 1:\n j = 0\n else:\n j += 1\n\nprint(j + 1)", "a=int(input())\r\nlis=list(map(int,input().split()))\r\ni=0\r\npages=a\r\nwhile pages > 0:\r\n pages=pages-lis[i%7]\r\n i+=1\r\nif i%7==0:\r\n print(7)\r\nelse: print(i%7)\r\n\r\n\r\n", "n = int(input())\r\narr = list(map(int, input().rstrip().split()))\r\n\r\ni = 0\r\nc = arr[0]\r\nwhile c < n:\r\n\r\n i += 1\r\n i = i % 7\r\n c += arr[i]\r\nprint(i+1)\r\n", "def solve():\r\n n = int(input())\r\n day = list(map(int, input().split()))\r\n i = 0\r\n while n > day[i]:\r\n n -= day[i]\r\n i = (i + 1) % 7\r\n print(i + 1)\r\n\r\n\r\nfor _ in range(1):\r\n solve()\r\n", "\r\nn=int(input())\r\na=list(map(int,input().split()))\r\nm=0\r\ntot=0\r\n# for i in range(0,len(a)):\r\n# tot=tot+a[i]\r\n# if tot>=n:\r\n# m=i\r\n# # print(\"*\")\r\n# break\r\n# if tot==1:\r\n# for i in range(0,len(a)):\r\n# if a[i]==1:\r\n# print(i+1)\r\n# break\r\n# else:\r\n# print(m+1)\r\n\r\ni=0\r\nwhile tot<n:\r\n # print(i)\r\n if i==8:\r\n i=0\r\n i=i%len(a)\r\n tot=tot+a[i]\r\n if tot>=n:\r\n m=i\r\n break\r\n i+=1\r\n \r\nprint(m+1)", "## solution for a2oj_34 \r\nn=int(input())\r\ns=input().split()\r\na=[int(e) for e in s]\r\ncount=0\r\nsum=0\r\nfor i in range(n*len(a)):\r\n if sum>=n:\r\n break\r\n else :\r\n y=i%7\r\n sum=sum+a[y]\r\n count=count+1\r\nresult=count%7\r\nresult=result if result!=0 else 7\r\nprint(result)\r\n\r\n\r\n", "pages = int(input())\npages_read = list(map(int, input().split()))\n\nday_tracker = -1\nwhile pages > 0:\n day_tracker += 1\n day_tracker %= 7\n pages -= pages_read[day_tracker]\nprint(day_tracker+1)", "n = int(input())\r\nk = [int(i) for i in input().split()]\r\ns = sum(k)\r\nif s >= n:\r\n c = 0\r\n while n > 0:\r\n n -= k[c]\r\n c += 1\r\n print(c)\r\nelse:\r\n while s < n:\r\n n -= s\r\n if n == 0:\r\n print(7)\r\n else:\r\n c = 0\r\n while n > 0:\r\n n -= k[c]\r\n c += 1\r\n print(c)", "n=int(input())\r\na=list(map(int,input().split()))\r\ns=0\r\nflag=0\r\nwhile flag==0:\r\n for i in range(len(a)):\r\n s+=a[i]\r\n if s>=n:\r\n print(i+1,end=' ')\r\n flag=1\r\n break\r\n #print(s)\r\n if s<n:\r\n flag=0\r\n", "if __name__ == '__main__':\r\n n = int(input())\r\n days = list(map(int, input().split()))\r\n count = 0\r\n i = 0\r\n while count < n:\r\n count += days[i % 7]\r\n i += 1\r\n print(1 + ((i-1) % 7))\r\n", "n=int(input())\r\narr=list(map(int,input().split()))\r\nc=0\r\nwhile(1):\r\n\tfor i in range(7):\r\n\t\tif(n>arr[i]):\r\n\t\t\tn=n-arr[i]\r\n\t\telse:\r\n\t\t\tprint(i+1)\r\n\t\t\tc=1\r\n\t\t\tbreak\r\n\tif(c==1):\r\n\t\tbreak\r\n\r\n", "def solve():\r\n n = int(input())\r\n a = list(map(int, input().split()))\r\n pages = 0\r\n while True:\r\n for i in range(7):\r\n pages += a[i]\r\n if pages >= n:\r\n return i + 1\r\n\r\nprint(solve())", "import re\r\nimport sys\r\nfrom bisect import bisect, bisect_left, insort, insort_left\r\nfrom collections import Counter, defaultdict, deque\r\nfrom copy import deepcopy\r\nfrom decimal import Decimal\r\nfrom itertools import (\r\n accumulate, combinations, combinations_with_replacement, groupby,\r\n permutations, product)\r\nfrom math import (acos, asin, atan, ceil, cos, degrees, factorial, gcd, hypot,\r\n log2, pi, radians, sin, sqrt, tan)\r\nfrom operator import itemgetter, mul\r\nfrom string import ascii_lowercase, ascii_uppercase, digits\r\n\r\n\r\ndef inp():\r\n return(int(input()))\r\n\r\n\r\ndef inlist():\r\n return(list(map(int, input().split())))\r\n\r\n\r\ndef instr():\r\n s = input()\r\n return(list(s[:len(s)]))\r\n\r\n\r\ndef invr():\r\n return(map(int, input().split()))\r\n\r\n\r\nn = inp()\r\n\r\na = inlist()\r\n\r\nsum = 0\r\ni = 0\r\nwhile True:\r\n ind = i % 7\r\n sum += a[ind]\r\n if sum >= n:\r\n print((i % 7) + 1)\r\n break\r\n i += 1\r\n", "n = int(input())\r\ndays = [int(i) for i in input().split()]\r\nd = days.copy()\r\ns = sum(days)\r\nadd = 0\r\nfor i in range(n):\r\n add += 1\r\n if n > s:\r\n d.extend(days)\r\n s = sum(d)\r\n else:\r\n break\r\ncount = 0\r\nfor i in range(n):\r\n if d[count] == 0:\r\n for j in range(count,7*add):\r\n if d[j] == 0:\r\n count += 1\r\n else:\r\n count = j\r\n break\r\n d[count] -= 1\r\nprint((count%7)+1)", "n=int(input())\r\na=list(map(int,input().split()))\r\ni=0\r\ns=0\r\nwhile 1:\r\n\tif s+a[i%len(a)]>=n:\r\n\t\tprint(i%len(a)+1)\r\n\t\tbreak\r\n\telse:\r\n\t\ts+=a[i%len(a)]\r\n\t\ti+=1\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\nc=0\r\nwhile True:\r\n for i in range(7):\r\n n-=l[i]\r\n if n<=0 :\r\n c=i+1\r\n break\r\n if n<=0 :\r\n break\r\nprint(c)", "n= int(input())\r\nl = list(map(int,input().split()))\r\ndef solve(n,l):\r\n sum=0\r\n while sum<= n:\r\n for i in range(len(l)):\r\n sum+=(l[i])\r\n if sum>=n:\r\n return i+1\r\nprint(solve(n,l))\r\n \r\n \r\n \r\n \r\n ", "n = int(input())\r\na = list(map(int,input().split()))\r\ns= 0\r\ni =0\r\nwhile s<n:\r\n i += 1 \r\n if(i>7):\r\n i%=7\r\n s+= a[i-1]\r\nprint(i)\r\n ", "n = int(input())\r\narr = list(map(int, input().split()))\r\n\r\ncurrent_pages = arr[0]\r\ni = 0\r\nwhile current_pages < n:\r\n i = (i+1) % 7\r\n current_pages += arr[i]\r\n\r\nprint(i+1)\r\n", "pages = int(input())\r\ncapacity = list(map(int,input().split()))\r\nindex = 0\r\nwhile True:\r\n if capacity[index]:\r\n pages -= capacity[index]\r\n if pages<1:\r\n break\r\n index += 1\r\n index = index%7\r\nprint(index+1)", "\r\ndef main():\r\n n = int(input())\r\n days = [int(x) for x in input().split()]\r\n\r\n current = 0\r\n i = -1\r\n while current < n:\r\n if i+1 > 6:\r\n i = -1\r\n else:\r\n i += 1\r\n current += days[i]\r\n \r\n print(i+1)\r\n\r\nmain()", "pages=int(input())\r\ndays=list(map(int,(input().split())))\r\n\r\nd={}\r\nfor i in range(7):\r\n if days[i]>0:\r\n d[i+1]=days[i]\r\n\r\nday=0\r\nwhile pages>0:\r\n for i in d.keys():\r\n if pages<=0:break\r\n day=i\r\n pages-=d[i]\r\n\r\nprint(day)", "n = int(input())\r\na = list(map(int,input().split()))\r\n\r\nfor i in range(n*7):\r\n n -= a[i%7]\r\n if n <= 0: print(i%7+1); break\r\n \r\n", "n = int(input())\r\nd = list(map(int, input().split()))\r\ns = sum(d)\r\nif s > n:\r\n n = s + (n % s)\r\nwhile n > 0:\r\n for i, x in enumerate(d):\r\n n -= x\r\n if n <= 0:\r\n print(i+1)\r\n break \r\n if n <= 0:\r\n break", "n = int(input())\r\n\r\ndays = list(map(int,input().split()))\r\nj = 0\r\nwhile(n>0):\r\n n -= days[j]\r\n j += 1\r\n if j==7:\r\n j =0\r\n\r\nif j==0:\r\n print(7)\r\nelse:\r\n print(j)", "n=int(input())\r\na=list(map(int,input().split(\" \")))\r\nc=0\r\nwhile(c<n):\r\n for i in range(7):\r\n c+=a[i]\r\n if c>=n:\r\n print(i+1)\r\n break\r\n\r\n \r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\ni = 0\r\nb = a[0]\r\nwhile(b < n):\r\n i+=1\r\n i%=7\r\n b+=a[i]\r\n \r\nprint(i+1)", "a=int(input())\r\narr = list(map(int, input().split()))\r\nk=sum(arr)\r\nc=a%k\r\nsumm=0\r\ni=1\r\nif c>0:\r\n while summ< c:\r\n summ+=arr[i-1]\r\n i+=1\r\n print(i-1)\r\nelse:\r\n while summ< k:\r\n summ+=arr[i-1]\r\n i+=1\r\n print(i-1)", "n = int(input())\r\na = [int(x) for x in input().split()]\r\ni=0\r\nwhile n>0:\r\n if i==7:\r\n i=0\r\n n-=a[i]\r\n i+=1\r\nprint(i)\r\n", "n = int(input())\r\na = [int(x) for x in input().split()]\r\ni = 0\r\nwhile n > 0:\r\n if i == 7:\r\n i = 0\r\n n -= a[i]\r\n i += 1\r\nprint(i)\r\n", "n=int(input())\r\nalist=(input().split())\r\na=[int(x) for x in alist]\r\ni=0;\r\nsum=0;\r\nwhile True:\r\n sum+=a[i]\r\n if sum>=n:\r\n print(i+1)\r\n break\r\n\r\n i+=1\r\n if i==7:\r\n i=0", "n=int(input())\r\ns=[int(i) for i in input().split()]\r\ni=0\r\nwhile n>0:\r\n if i==7:\r\n i=0\r\n n-=s[i]\r\n i+=1\r\nprint(i)", "n = int(input())\r\na = list(map(int,input().split()))\r\ni = 0\r\nwhile n > 0: \r\n i %= 7\r\n n -= a[i]\r\n i += 1\r\nprint(i)", "def solve(suma,l):\n day=0\n while(True):\n suma=suma-l[day]\n if(suma<=0):\n return (day+1)\n day=(day+1)%7\n\nprint(solve(int(input()),list(map(int,input().split()))))\n\n", "import math\r\nn = int(input())\r\npages = [int(x) for x in input().split()]\r\nsumofpages = sum(pages)\r\ntotalweeks = math.ceil(n/sumofpages)\r\nremainingpages = sumofpages- ((sumofpages*totalweeks)-n)\r\nsumm= pages[0]\r\ni=0\r\nwhile summ<remainingpages:\r\n i+=1\r\n i%=7\r\n summ+=pages[i]\r\n \r\nprint(i+1)", "n = int(input())\r\narr = list(map(int, input().split()))\r\nday = 0\r\nwhile n>0:\r\n n-=arr[day]\r\n day+=1\r\n if day==7:\r\n day=0\r\nif day==0:\r\n print(7)\r\nelse:\r\n print(day)", "n = int(input())\r\npage_days = list(map(int, input().split()))\r\ni = 0\r\nwhile n > 0:\r\n i = i % 7\r\n n -= page_days[i]\r\n i += 1\r\nprint(i)\r\n", "n=int(input())\r\nread=[int(i) for i in input().split()]\r\ni=1\r\nwhile(n>0):\r\n n=n-read[i-1]\r\n if n<=0:\r\n break\r\n if n>0 and i==7:\r\n i=1\r\n continue\r\n i+=1\r\nprint(i)\r\n ", "n = int(input())\r\narr = list(map(int,input().split()))\r\ni=0\r\nwhile n>=0:\r\n n-=arr[i]\r\n i+=1\r\n if n<=0:\r\n ans = i\r\n break\r\n if i==7:\r\n i=0\r\n\r\nprint(ans)", "n = int(input())\r\npage = list(map(int,input().split()))\r\ni = 0\r\nwhile n > 0:\r\n if i == 7:\r\n i = 0\r\n n -= page[i]\r\n i += 1\r\nprint(i)\r\n", "n = int(input())\r\npages = [int(p) for p in input().split(\" \", 6)]\r\nt = 0\r\nwhile True:\r\n if t>=n:\r\n break\r\n for i in range(0, 7):\r\n t += pages[i]\r\n if t>=n:\r\n print(i+1)\r\n break", "numberofpages = int(input())\r\ndays = list(map(int, input().split()))\r\ncurrPages = 0\r\ncurrDay = 0\r\nwhile numberofpages > currPages:\r\n currPages += days[currDay]\r\n if currPages >= numberofpages:\r\n break\r\n currDay = (currDay + 1) % 7\r\nprint(currDay+1)\r\n", "n=int(input())\r\nlst=list(map(int,input().split()))\r\ns=0\r\nwhile(n>0):\r\n if(s==7):\r\n s=0\r\n n=n-lst[s]\r\n s=s+1\r\nprint(s)", "a=int(input())\r\nb=list(map(int,input().split()))\r\ni=0\r\nwhile True :\r\n if i>6:\r\n i=0\r\n a-=b[i]\r\n if a<=0:\r\n break\r\n i+=1\r\nprint(i+1)", "n=int(input())\r\na=[*map(int,input().split())]\r\ns=n\r\nwhile s>0:\r\n for i in range(7):\r\n s-=a[i] \r\n if s<=0:\r\n ind=i\r\n print(ind+1)\r\n break\r\n", "n = int(input())\r\nl = list(map(int, input().split()))\r\nm = len(l)\r\ns = 0\r\ni = -1\r\nwhile s < n:\r\n i += 1\r\n i = i % m\r\n s += l[i]\r\n \r\n\r\nprint(i+1)\r\n ", "n=int(input())\r\na=[int(x) for x in input().split()]\r\ni=0\r\n# cnt=0\r\nwhile(True):\r\n n-=a[i]\r\n if(n<=0):\r\n print(i+1)\r\n break\r\n i=(i+1)%7\r\n# print(i)\r\n", "n = int(input())\r\nd = {}\r\nweek = list(map(int, input().split()))\r\ni = 0 \r\nct = 0\r\nwhile n> 0: \r\n n -= week[i]\r\n ct += 1\r\n i += 1\r\n if ct == 8: \r\n ct = 1\r\n if i == 7: \r\n i = 0\r\nprint(ct)", "n=int(input())\r\nlst=list(map(int,input().rstrip().split()))\r\nind=0\r\nwhile n>0:\r\n n-=lst[ind]\r\n ind=(ind+1)%7\r\nif ind==0:\r\n print(7)\r\nelse:\r\n print(ind)\r\n", "a=int(input())\r\nm=input().split()\r\nfor i in range(len(m)):\r\n m[i]=int(m[i]) \r\nsdf=0\r\nwhile True:\r\n for i in range(len(m)):\r\n sdf+=m[i]\r\n if sdf>=a:\r\n print(i+1)\r\n exit()", "i=lambda:map(int,input().split())\nn = int(input())\nl=list(i())\n\nc = 0\n\nwhile True:\n if n<=0:\n break\n j = 0\n for j in range(7):\n if n<=0:\n c = j\n break\n else:\n n = n - l[j]\nif c==0:\n print(7)\nelse:\n print(c)\n \t\t\t \t\t\t \t \t \t\t\t \t\t\t \t", "n = int(input())\r\n\r\nweeks = list(map(int, input().split()))\r\nl = 7\r\npages = 0\r\ni = 0\r\nans = -1\r\nwhile pages < n:\r\n if i == 7:\r\n i = 1\r\n else:\r\n i += 1\r\n pages += weeks[i-1]\r\nans = i\r\nprint(ans)", "n = int(input())\r\na = [int(i) for i in input().strip().split()]\r\nn = n%sum(a)\r\nday = 7\r\nif n==0:\r\n for i in range(6,-1,-1):\r\n if a[i]!=0:\r\n print(i+1)\r\n break\r\nelse:\r\n for i in range(7):\r\n n-=a[i]\r\n if n<=0:\r\n print(i+1)\r\n break", "n = int(input())\nnumbers = list(map(int, input().split()))\nday = 0\nwhile n > 0:\n day += 1\n if day > 7:\n day = 1\n n -= numbers[day - 1]\nprint(day)\n", "n = int(input())\r\npages = list(map(int, input().split()))\r\nwhile n > 0:\r\n for x in range(7):\r\n n -= pages[x]\r\n if n <= 0:\r\n print(x+1)\r\n break", "s=int(input())\r\nned=input().split()\r\nwhile s>0:\r\n i=0\r\n while i<7:\r\n s=s-int(ned[i])\r\n if s<=0:\r\n break\r\n else:\r\n i=i+1\r\nprint (i+1)", "n= int(input())\r\nl=[int(x) for x in input().split()]\r\nres=0\r\nwhile True:\r\n for x in l:\r\n if n>0:\r\n n-=x\r\n res+=1\r\n else:\r\n break\r\n if n<=0:\r\n break\r\nprint(res%7 if res%7!=0 else 7)", "n = int(input())\r\nreadPerDay = list(map(int,input().split()))\r\ncnt=0\r\ncurrentPage=i=0\r\nwhile currentPage<n: \r\n if i>6:\r\n i=0\r\n currentPage+=readPerDay[i]\r\n cnt+=1\r\n i+=1\r\n if cnt>7:\r\n cnt=1\r\nprint(cnt)", "n=int(input())\r\nm=list(map(int,input().split()))\r\nt=m[0]\r\ni=0\r\nwhile(t<n):\r\n i+=1\r\n i=i%len(m)\r\n t=t+m[i]\r\nprint(i+1)\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "totalPage = int(input())\r\npages = [int(x) for x in input().split()]\r\n\r\nfor i in range(1, 7):\r\n pages[i] += pages[i - 1]\r\ntotalPage %= pages[6]\r\nif totalPage == 0:\r\n totalPage = pages[6]\r\nfor i in range(7):\r\n if pages[i] >= totalPage:\r\n print(i + 1)\r\n break\r\n\r\n", "import sys,math\r\nfrom collections import deque,defaultdict\r\nimport operator as op\r\nfrom functools import reduce\r\n\r\n#sys.setrecursionlimit(10**6) \r\n\r\nI=sys.stdin.readline\r\n\r\n #s=\"abcdefghijklmnopqrstuvwxyz\"\r\n\r\n\"\"\"\r\nx_move=[-1,0,1,0,-1,1,1,-1]\r\ny_move=[0,1,0,-1,1,1,-1,-1]\r\n\"\"\"\r\ndef ii():\r\n\treturn int(I().strip())\r\ndef li():\r\n\treturn list(map(int,I().strip().split()))\r\ndef mi():\r\n\treturn map(int,I().strip().split())\r\n\r\n\"\"\"def ncr(n, r):\r\n r = min(r, n-r)\r\n numer = (reduce(op.mul, range(n, n-r, -1), 1))%(10**9+7)\r\n denom = (reduce(op.mul, range(1, r+1), 1))%(10**9+7)\r\n return (numer // denom)%(10**9+7)\"\"\"\r\ndef ncr(n, r, p):\r\n # initialize numerator\r\n # and denominator\r\n num = den = 1\r\n for i in range(r):\r\n num = (num * (n - i)) % p\r\n den = (den * (i + 1)) % p\r\n return (num * pow(den, \r\n p - 2, p)) % p\r\n \r\n\r\ndef gcd(x, y):\r\n while y:\r\n x, y = y, x % y\r\n return x\r\n\r\ndef valid(row,col,rows,cols,rcross,lcross):\r\n \treturn rows[row]==0 and cols[col]==0 and rcross[col+row]==0 and lcross[col-row]==0\r\n\r\n\r\ndef div(n):\r\n\ttmp=[]\r\n\tfor i in range(2,int(n**.5)+1):\r\n\t\tif n%i==0:\r\n\t\t\tcnt=0\r\n\t\t\twhile(n%i==0):\r\n\t\t\t\tn=n//i \r\n\t\t\t\tcnt+=1\r\n\t\t\ttmp.append((i,cnt))\r\n\tif n>1:\r\n\t\ttmp.append((n,1))\r\n\treturn tmp\r\n\r\ndef isPrime(n):\r\n\tif n<=1:\r\n\t\treturn False\r\n\telif n<=2:\r\n\t\treturn True\r\n\telse:\r\n\t\tflag=True\r\n\t\tfor i in range(2,int(n**.5)+1):\r\n\t\t\tif n%i==0:\r\n\t\t\t\tflag=False\r\n\t\t\t\tbreak\r\n\t\treturn flag\r\n\r\ndef s(b):\r\n\tans=[]\r\n\twhile b>0:\r\n\t\ttmp=b%10\r\n\t\tans.append(tmp)\r\n\t\tb=b//10\r\n\treturn ans\r\n\r\n\r\ndef main():\r\n\tn=ii()\r\n\tarr=li()\r\n\tsum_=sum(arr)\r\n\tn-=(math.ceil(n/sum_)-1)*sum_\r\n\tcnt=0\r\n\r\n\tfor i in range(7):\r\n\t\tcnt+=arr[i]\r\n\t\t\r\n\t\tif cnt>=n:\r\n\t\t\tprint(i+1)\r\n\t\t\tbreak\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\t\r\n\r\n\r\n\r\n\t\r\n\t\t\r\n\r\n\r\n\r\n\r\n\t\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\t\r\n\r\n\r\n\t\r\n\r\n\t\r\n\r\n\t\t\r\n\r\n\r\n\r\n\t\t\r\n\r\n\t\t\r\n\t\t\r\n\r\n\r\n\t\r\n\t\r\n\r\n\t\t\r\n\t\r\n\r\n\t\t\r\n\r\n\r\n\r\n\r\n\t\t\r\n\r\n\r\n\r\n\r\n\t\t\t\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\t\t\t\r\n\t\t\r\n\t\t\t\r\n\r\n\r\n\r\n\t\t\r\n\r\n\r\n\t\r\n\t\t\t\r\n\t\t\t\t\t\t\r\n\t\t\t\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\t\r\n\r\n\r\n\r\n\r\n\r\n\t\t\t\r\n\t\t\r\n\r\n\r\n\r\n\t\r\n\t\t\t\r\n\r\n\r\n\r\n\r\n\r\n\t\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\t\r\n\t\r\n\t\r\n\r\n\r\n\r\n\r\n\r\nif __name__ == '__main__':\r\n\tmain()", "def main():\r\n # input\r\n n = int(input())\r\n days = list(map(int, input().split()))\r\n\r\n # soln\r\n i = 0\r\n while n > days[i%7]:\r\n n = n - days[i%7]\r\n i += 1\r\n print((i%7) + 1)\r\n\r\nif __name__ == \"__main__\":\r\n main()", "num = int(input())\r\narr = list(map(int, input().split()))\r\n\r\nwhile num:\r\n for i, n in enumerate(arr, start=1):\r\n num -= n\r\n if num <= 0:\r\n print(i)\r\n exit()\r\n", "import sys\ninput = sys.stdin.readline\n\nn = int(input())\nA = list(map(int, input().split()))\n\npd = 0\nwhile n > 0 :\n n -= A[pd%7]\n pd += 1\nprint((pd-1)%7+1)\n", "n = int(input())\r\nday = list(map(int,input().split()))\r\n \r\ni = 0\r\nwhile n>0:\r\n i=i%7\r\n n -= day[i]\r\n i+=1\r\n\r\n\r\nprint(i)", "#import accepted\r\ndef check_day(n,l1):\r\n x=0\r\n for i in range(7):\r\n x+=l1[i]\r\n if x>=n:\r\n return i+1\r\n break\r\nn=int(input())\r\nl1=list(map(int,input().split()))\r\nsum=0\r\nfor i in range(7):\r\n sum+=l1[i]\r\nif n>sum:\r\n if n%sum==0:\r\n n=sum\r\n else:\r\n n=n%sum \r\nprint(check_day(n,l1))\r\n", "n=int(input())\r\ndays=list(map(int,input().split()))\r\ntotal=sum(days)\r\n\r\nif total<n:\r\n if n%total==0:\r\n n=total\r\n else:\r\n n=n%total\r\nsum=0\r\nans=0\r\ni=0\r\nwhile(i<=6):\r\n sum+=days[i]\r\n if sum>=n:\r\n ans=i\r\n break\r\n i+=1 \r\nprint(ans+1)\r\n\r\n\r\n", "n = int(input())\r\npages = list(map(int, input().split()))\r\n\r\ncol_pages = n\r\n\r\nok = True\r\nfor _ in range(n):\r\n if ok:\r\n for i in range(len(pages)):\r\n col_pages -= pages[i]\r\n\r\n if col_pages <= 0:\r\n print(i+1)\r\n ok = False\r\n break", "n=int(input())\r\nl=list(map(int,input().split()))\r\n\r\ni=0\r\nwhile i<7:\r\n if n-l[i]>0:\r\n n=n-l[i]\r\n i+=1\r\n \r\n \r\n else:\r\n print(i+1)\r\n break\r\n if i==7:\r\n i=0", "n = int(input())\r\n\r\nw = list(map(int,input().split()))\r\n\r\nq = sum(w)\r\ntemp = 0\r\nif q < n:\r\n temp = n%q\r\n if temp == 0:\r\n l = 0\r\n for i in range(7):\r\n if w[i]!=0:\r\n l = i\r\n print(l+1)\r\n else:\r\n i = 0\r\n while (temp > 0):\r\n temp -= w[i]\r\n i += 1\r\n print(i)\r\nelse:\r\n i = 0\r\n while (n > 0):\r\n n -= w[i]\r\n i += 1\r\n print(i)\r\n", "n = int(input())\r\n\r\npages = list(int(i) for i in input().split())\r\n\r\nsum = 0\r\n\r\nwhile True:\r\n if sum<n:\r\n for p in range(len(pages)):\r\n sum += pages[p]\r\n if sum>=n:\r\n day = p + 1\r\n break\r\n else:\r\n day = p + 1\r\n elif sum>=n:\r\n break\r\n\r\nprint(day)", "n = int(input())\r\na = list(map(int,input().split()))\r\nd = 0\r\nwhile n>0:\r\n for i in range(7):\r\n n -= a[i]\r\n d += 1\r\n if n<=0:\r\n break\r\n\r\nif d%7==0:\r\n print(7)\r\nelse:\r\n print(d%7)\r\n", "n, wps = int(input()), list(map(int, input().split()))\ni, sm = 0, 0\nwhile sm < n:\n if i == 7:\n i = 1\n else:\n i += 1\n sm += wps[i - 1]\nprint(i)\n\t\t \t\t\t\t \t \t \t\t \t\t \t \t\t \t\t \t", "n = int(input())\r\ndays = [int(day) for day in input().split(' ')]\r\ni = -1\r\nwhile n > 0:\r\n i = (i + 1) % 7\r\n n -= days[i]\r\nprint(i + 1)", "import math\r\nn=int(input())\r\nl=list(map(int,input().split()))\r\nm=math.ceil(n/sum(l))\r\nl2=l*m\r\nc=0\r\ns=0\r\nfor i in l2:\r\n s=s+i\r\n c=c+1\r\n if s>=n:\r\n break\r\nres=c%7\r\nif res==0:\r\n print(7)\r\nelse:\r\n print(res)", "n = int(input())\r\nL = list(map(int, input().split()))\r\ns = 0\r\ni = 0\r\nwhile n > s:\r\n s += L[i]\r\n if s >= n:\r\n print(i+1)\r\n break\r\n if i == 6:\r\n i = 0\r\n else:\r\n i += 1", "n = int(input())\npetr_schedule = list(map(int, input().split()))\n\ni = -1\nwhile n > 0:\n i += 1\n n -= petr_schedule[i % 7]\n \nprint(i % 7 + 1)\n", "a=int(input())\r\nb=list(map(int,input().split()))\r\ndef ok():\r\n ans=0\r\n while True:\r\n for i in range(len(b)):\r\n ans=ans+b[i]\r\n if ans>=a:\r\n return i+1\r\nprint(ok())", "t = int(input())\r\nl = list(map(int, input().split()))\r\nsm = 0\r\ni = 0\r\nwhile(True):\r\n sm += l[i]\r\n \r\n \r\n if sm >= t:\r\n print(i+1)\r\n break\r\n \r\n if(i == 6):\r\n i = 0\r\n else:\r\n i += 1", "n = int(input())\narr = [int(x) for x in input().split()]\nresult = None\nwhile True:\n for i in range(7):\n n -= arr[i]\n if n <= 0:\n result = i+1\n break\n if result != None:\n break\nprint(result)\n\t \t \t \t \t\t\t\t \t\t \t \t \t \t", "n = int(input())\r\nline = input().split()\r\ns = sum(map(int, line))\r\n\r\nif n <= s:\r\n sn = 0\r\n j = 0\r\n for i in range(7):\r\n if sn < n:\r\n sn += int(line[i])\r\n j += 1\r\n \r\nelse:\r\n sn = 0\r\n j = 0\r\n while sn < n:\r\n for i in range(7):\r\n if sn < n:\r\n sn += int(line[i])\r\n j += 1\r\n j = j % 7\r\n if j == 0:\r\n j = 7\r\n\r\nprint(j)\r\n", "n=int(input())\r\nlst=list(map(int,input().split()))\r\nsum=0\r\ni=0\r\nwhile n>0:\r\n n-=lst[i]\r\n i+=1\r\n sum+=1\r\n if i==7:\r\n i=0\r\nif sum%7==0:\r\n print(7)\r\nelse:\r\n print((sum%7)) ", "n=int(input())\r\nx=list(map(int,input().split()))\r\ns=sum(x)\r\nif s<n:\r\n mod=n%s\r\n if mod==0:\r\n mod=s\r\n val=0\r\n for i in range(7):\r\n val+=x[i]\r\n if val>=mod:\r\n print(i+1)\r\n break\r\nelse:\r\n val=0\r\n for i in range(7):\r\n val+=x[i]\r\n if val>=n:\r\n print(i+1)\r\n break", "test = int(input())\r\ni = 0\r\n\r\nlist = [int(x) for x in input().split()]\r\n\r\nwhile test > 0 :\r\n test = test - list[i]\r\n if i ==6 :\r\n i = 0\r\n else:\r\n i +=1\r\n\r\n\r\nif i == 0 : print(7 )\r\nelse : print(i )", "n = int(input())\r\nl = [int(i) for i in input().split()]\r\nwhile True:\r\n n = n - l[0]\r\n if n <=0:\r\n print(1)\r\n break\r\n n = n - l[1]\r\n if n <=0:\r\n print(2)\r\n break\r\n n = n-l[2]\r\n if n <=0:\r\n print(3)\r\n break\r\n n = n-l[3]\r\n if n <=0:\r\n print(4)\r\n break\r\n n = n-l[4]\r\n if n <=0:\r\n print(5)\r\n break\r\n n = n-l[5]\r\n if n <=0:\r\n print(6)\r\n break\r\n n = n-l[6]\r\n if n <=0:\r\n print(7)\r\n break\r\n \r\n ", "t = int(input())\r\ns = list(map(int,input().split()))\r\nm = sum(s)\r\nf = t%m\r\ng=t\r\nif f==0 :\r\n i=0\r\n while True:\r\n g-=s[i]\r\n if g<=0:\r\n print(i+1)\r\n break\r\n i+=1\r\n if i>=7:\r\n i%=7\r\nelse:\r\n for i in range(7):\r\n f-=s[i]\r\n if f<=0:\r\n print(i+1)\r\n break", "n=int(input())\narr=list(map(int, input().split()))\ni=0\nwhile n>0:\n n-=arr[i]\n if n<=0:\n break\n i=(i+1)%7\nprint(i+1)\n", "n = int(input())\r\nweek = [int(x) for x in input().split()]\r\ns = sum(week)\r\nn = n%s\r\n\r\nif n==0:\r\n n = s\r\n\r\nfor day, p in enumerate(week):\r\n n-= p\r\n if (n < 1):\r\n print(day + 1)\r\n exit()", "n=int(input())\r\na=list(map(int,input().split()))\r\ns=sum(a)\r\nwhile(n>s):\r\n n-=s\r\na1=[0]\r\ns1=0\r\nfor j in a:\r\n s1+=j\r\n a1.append(s1)\r\nfor i in range(1,len(a1)):\r\n if(n>a1[i-1] and n<=a1[i]):\r\n break\r\nprint(i)", "n = int(input())\r\np = list(map(int, input().split()))\r\nt = 0\r\nwhile n > p[t]:\r\n n -= p[t]\r\n t = (t + 1) % 7\r\nprint(t + 1)", "pages = int(input())\r\ndays = input().split(' ')\r\nschedule = dict(zip(list(range(1, 8)), days))\r\nwhile pages > 0:\r\n for d, p in schedule.items():\r\n pages-=int(p)\r\n if pages <= 0:\r\n print(d)\r\n output = d\r\n break\r\n\r\n\r\n\r\n", "pages = int(input())\r\nperday = input()\r\nperday = perday.split(' ')\r\nperday = [int(i) for i in perday]\r\n\r\ncurday = -1\r\nday = 0\r\nwhile True:\r\n if pages <= 0:\r\n break\r\n pages -= perday[day]\r\n day += 1\r\n day = day % 7\r\n curday += 1\r\n\r\nprint(curday % 7 + 1)\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\nsum=0\r\ni=0\r\nwhile i<len(a):\r\n sum=a[i]+sum\r\n if sum>=n:\r\n print(i+1)\r\n break\r\n if i==len(a)-1 and (sum!=n or sum>n):\r\n i=-1\r\n i+=1", "n = int(input())\r\ne = input().split()\r\ne = [int(i) for i in e]\r\n\r\ndef read():\r\n global n\r\n for i in range(len(e)):\r\n n -= e[i]\r\n if n <= 0:\r\n print(i+1)\r\n quit()\r\n\r\nwhile n > 0:\r\n read()", "p = int(input())\r\nd = list(map(int, input().split()))\r\nwhile p>sum(d):\r\n p -= sum(d)\r\ni = 0\r\nwhile(p>0):\r\n p -= d[i]\r\n i += 1\r\nprint(i)", "n = int(input())\r\narr = input().split(' ')\r\nsrr = [int(i) for i in arr]\r\nwhile n>0:\r\n\tfor i in range(7):\r\n\t\tn -= srr[i]\r\n\t\tif n<=0:\r\n\t\t\tprint(i+1)\r\n\t\t\tbreak", "n=int(input())\r\nlst = list(map(int, input().split()))\r\nk=0\r\nl=0\r\ni=0\r\nwhile k<n:\r\n i%=7\r\n k = k + lst[i]\r\n i+=1\r\nprint(i)\r\n \r\n \r\n\r\n\r\n", "n = int(input())\r\ni = 0\r\na = [int(x) for x in input().split()]\r\nt = a[0]\r\n\r\nwhile t < n:\r\n i += 1\r\n i %= 7\r\n t += a[i]\r\n\r\nprint(i + 1)", "\"\"\"https://codeforces.com/contest/139/problem/A\"\"\"\r\ndef v(n):\r\n day = 1\r\n for i in reading:\r\n n -= i\r\n if n <= 0:\r\n print(day)\r\n break\r\n day+=1\r\n return n\r\nn = int(input())\r\nreading = list(map(int,input().split()))\r\nwhile n > 0 :\r\n n=v(n)\r\n", "ll=lambda:map(int,input().split())\r\nt=lambda:int(input())\r\nss=lambda:input()\r\nlx=lambda x:map(int,input().split(x))\r\nfrom math import log10 ,log2,ceil,factorial as fac,gcd\r\n#from itertools import combinations_with_replacement as cs \r\n#from functools import reduce\r\n#from bisect import bisect_right as br,bisect_left as bl\r\n#from collections import Counter\r\n#from math import inf\r\n\r\n\r\n \r\n\r\n\r\n#for _ in range(t()):\r\ndef f():\r\n \r\n \r\n n=t()\r\n l=list(ll())\r\n\r\n s=sum(l)\r\n\r\n n=n%s\r\n if n==0:\r\n n=s\r\n if n<=l[0]:\r\n print(1)\r\n return\r\n p=0\r\n i=0\r\n while p<n:\r\n \r\n p+=l[i]\r\n i+=1\r\n \r\n print(i)\r\n \r\n \r\n \r\n\r\n \r\n\r\n \r\n \r\n \r\nf()\r\n\r\n'''\r\n2 2 2 2 2 2 2\r\n5\r\n\r\n\r\n\r\n5 5 5 \r\n \r\n'''\r\n", "n = int(input())\r\npages_per_day = list(map(int, input().split()))\r\nday = 0\r\n\r\nwhile n > pages_per_day[day]:\r\n n -= pages_per_day[day]\r\n day = (day + 1) % 7\r\n\r\nprint(day + 1)\r\n", "n = int(input())\r\na = list(map(int,input().split()))\r\nvar = 0\r\nwhile(n>0):\r\n var = (var%7)+1\r\n n = n-a[var-1]\r\nprint(var)", "num_pages = int(input())\r\npage_counts = [0] * 8\r\n\r\npage_counts[1:8] = map(int, input().split())\r\nfor day in range(1, 8):\r\n page_counts[day] += page_counts[day - 1]\r\n\r\nnum_pages = (num_pages - 1) % page_counts[7] + 1\r\nfor day in range(1, 8):\r\n if page_counts[day] >= num_pages:\r\n print(day)\r\n break\r\n", "pages = int(input())\r\ndays = list(map(int,input().split()))\r\ntotal = 0\r\ni = 0\r\nwhile total!=pages:\r\n if i!=len(days):\r\n total = total + days[i]\r\n if total>=pages:\r\n print(i+1)\r\n break\r\n i+=1\r\n\r\n else:\r\n i = 0\r\n \r\n", "n=int(input());z=0\r\na=[]\r\nfor i in input().split():\r\n z+=int(i)\r\n a.append(z)\r\nif(n%a[-1]!=0):n%=a[-1]\r\nelse:n=a[-1]\r\nfor i in range(7):\r\n if(a[i]>=n):\r\n ans=i+1\r\n break\r\n \r\nprint(ans)", "n=int(input())\r\ns=input()\r\ns=s.split(\" \")\r\na=[]\r\ntot=0\r\nfor x in s:\r\n a.append(int(x))\r\n tot+=int(x)\r\nfor x in range(-7,0):\r\n if a[x]>0:\r\n l=8+x\r\nn=n%tot\r\nif n==0:\r\n print(l)\r\nelse:\r\n for x in range(7):\r\n if n<=a[x]:\r\n print(x+1)\r\n break\r\n else:\r\n n=n-a[x]", "n=int(input())\r\nA=list(map(int,input().split()))\r\nt=A[0]\r\ni=0\r\nwhile t<n:\r\n i+=1\r\n i%=7\r\n t+=A[i]\r\nprint(i+1)", "def petrAndBook():\r\n n=int(input())\r\n s=[int(x) for x in input().split()]\r\n i=0\r\n while True:\r\n if n-s[i]>0:\r\n n=n-s[i]\r\n elif n-s[i]<=0:\r\n print(i+1)\r\n break\r\n if i==6:\r\n i=0\r\n else:\r\n i=i+1\r\n\r\npetrAndBook()\r\n\r\n\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=int(input())\r\nb=list(map(int,input().split()))\r\ntemp=0\r\nwhile(a>0):\r\n for i in range(7):\r\n if(a-b[i]<1):\r\n print(i+1)\r\n# print(a)\r\n temp=1\r\n break\r\n a=a-b[i]\r\n #a=a-b[i]\r\n if(temp==1):\r\n a=a-b[i]\r\n else:\r\n pass\r\n", "\r\nn = int(input())\r\n\r\narr = list(map(int,input().split()))\r\n\r\n\r\npagesCompleted = 0\r\n\r\ncount = 0\r\n\r\nwhile (pagesCompleted<n):\r\n\r\n if count<7:\r\n pagesCompleted+=arr[count]\r\n count+=1\r\n\r\n else:\r\n count = count%7\r\n pagesCompleted+=arr[count]\r\n count+=1\r\n\r\n\r\nprint(count)\r\n", "from math import ceil\r\n\r\ndef calc(n, arr):\r\n while n > 0:\r\n for i in range(len(arr)):\r\n n -= arr[i]\r\n if n <= 0:\r\n break\r\n return i+1\r\n# get inputs\r\nn = int(input())\r\narr = list(map(int, input().split()))\r\nprint(calc(n, arr))\r\n\r\n\r\n", "pgs = int(input())\r\npg_day = list(map(int,input().split()))\r\ni=0\r\nwhile pgs>pg_day[i]:\r\n pgs-=pg_day[i]\r\n i=(i+1)%7\r\nprint(i+1)", "n=int(input())\na,b,c,d,e,f,g=map(int,input().split())\nsum=0\nfor i in range(n):\n sum=sum+a\n if(sum>=n):\n print(\"1\")\n break\n sum=sum+b\n if(sum>=n):\n print(\"2\")\n break\n sum=sum+c\n if(sum>=n):\n print(\"3\")\n break\n sum=sum+d\n if(sum>=n):\n print(\"4\")\n break\n sum=sum+e\n if(sum>=n):\n print(\"5\")\n break\n sum=sum+f\n if(sum>=n):\n print(\"6\")\n break\n sum=sum+g\n if(sum>=n):\n print(\"7\")\n break\n\n\n \t \t \t \t\t\t \t\t \t \t \t\t", "n = int(input())\r\nlst = [int(i) for i in input().split()]\r\ni = 1\r\nflag = False\r\nwhile(n > 0):\r\n flag = False\r\n n = n-lst[i-1]\r\n i += 1\r\n if(i == 8):\r\n i = 1\r\n flag = True\r\nif(flag):\r\n print(7)\r\nelse:\r\n print(i-1)\r\n\r\n", "from itertools import cycle\nn = int(input())\npages = [int(i) for i in input().split()]\nindexes = [i for i in range(1, 8)]\n\nfor p, i in zip(cycle(pages), cycle(indexes)):\n n -= p\n if n <= 0:\n print(i)\n break\n", "n=int(input())\r\nl=input().split()\r\na=[int(l[i]) for i in range(len(l)) ]\r\nz=0\r\nwhile(n>0):\r\n if(z==7):\r\n z=0\r\n n=n-a[z]\r\n z=z+1\r\n \r\nprint(z) ", "n=input()\r\n\r\nn=int(n)\r\n\r\narr=list(map(int,input().rstrip().split()))\r\nSum=0\r\nd=sum(arr)\r\nc=n/d\r\n\r\nif c.is_integer():\r\n \r\n dd=(c-1)*d\r\n\r\n for j in range(len(arr)):\r\n dd=dd+arr[j]\r\n \r\n if dd>=n:\r\n print(j+1)\r\n break\r\n\r\n \r\n \r\nelse:\r\n c=int(c)\r\n dd=c*d\r\n \r\n for i in range(len(arr)):\r\n dd=dd+arr[i]\r\n \r\n if dd>=n:\r\n print(i+1)\r\n break\r\n \r\n", "n = int(input())\r\narr = list(map(int, input(). split()))\r\ns = 0\r\nwhile n > 0:\r\n if s == 7:\r\n s = 0\r\n n -= arr[s]\r\n s += 1\r\nprint(s)\r\n", "n = int(input())\nv = list(map(int, input().split()))\ni = 0\nwhile n > 0:\n n -= v[i % 7]\n i += 1\nprint((i - 1) % 7 + 1)\n", "n=int(input())\np=[int(n) for n in input().split()]\nc,i=p[0],0\nwhile c<n:\n i+=1\n i%=7\n c+=p[i]\nprint(i+1)\n\t \t \t \t\t \t \t \t \t \t\t\t \t\t\t \t \t\t", "n=int(input())\r\nl=list(map(int,input().split()))\r\ni=0\r\ns=l[0]\r\nwhile s<n:\r\n i+=1\r\n i%=7\r\n s+=l[i]\r\nprint(i+1)\r\n ", "def solve():\r\n total = int(input())\r\n i = 0\r\n pages = {}\r\n for k in map(int, input().split()):\r\n pages[i] = k\r\n i+=1\r\n while True:\r\n for page in pages:\r\n # print(page)\r\n total -= pages[page]\r\n if total <= 0:\r\n print(page+1)\r\n return page\r\n\r\nsolve()", "pg=int(input())\r\na=list(map(int, input().split()))\r\n\r\ncnt = 0\r\nwhile True:\r\n pg -= a[cnt]\r\n if pg <= 0:\r\n break\r\n cnt = (cnt+1)%7\r\nprint(cnt+1)", "m1 = int(input())\r\na = list(map(int,input().split()))\r\ni = 0\r\nm2 = 0\r\nwhile(m2 < m1):\r\n\tm2 = m2 + a[i]\r\n\ti = i+1\r\n\tif(i==7):\r\n\t\ti = 0\r\nif(i==0):\r\n\tprint('7')\r\n\texit()\r\nprint(i)", "n=int(input())\r\narr=list(map(int,input().split()))\r\ni=0\r\nwhile n>0:\r\n\tn=n-arr[i]\r\n\ti+=1\r\n\tif i==7:\r\n\t\ti=0\r\nif i==0:\r\n\tprint(7)\r\nelse:\r\n\tprint(i)", "from collections import deque\r\n\r\n\r\nn=int(input())\r\ndays=(list(map(int,input().split())))\r\nmain=deque([(days[x],x) for x in range(len(days))])\r\ntotal=n\r\nans=0\r\nwhile total>0:\r\n a,b=main.popleft()\r\n total-=a\r\n ans=b\r\n main.append((a,b))\r\nprint(ans+1)\r\n\r\n\r\n\r\n\r\n", "n = int(input())\r\nl = list(map(int,input().split()))\r\ns = 0\r\ni = 0\r\nwhile(s<n):\r\n i = (i%7)\r\n s += l[i]\r\n if(s>=n):\r\n break\r\n i += 1\r\nprint(i+1)", "a=int(input())\r\nb=list(map(int,input().split()))\r\nn=0\r\nk=0\r\ns=sum(b)\r\nfor i in b:\r\n if n<a%s :\r\n n+=i\r\n k+=1\r\n else:\r\n break\r\nif a%s==0:\r\n if sum==1:\r\n k=b.index(1)+1\r\n else:\r\n for o in range(0,len(b)):\r\n if b[o]!=0:\r\n k=o+1\r\nprint(k)", "n = int(input())\r\n\r\na, b, c, d, e, f, g = map(int, input().split())\r\nx=n\r\nwhile(True):\r\n x = x - a\r\n if x <= 0:\r\n print(1)\r\n break\r\n x = x - b\r\n if x <= 0:\r\n print(2)\r\n break\r\n\r\n x = x - c\r\n if x <= 0:\r\n print(3)\r\n break\r\n x = x - d\r\n if x <= 0:\r\n print(4)\r\n break\r\n x = x - e\r\n if x <= 0:\r\n print(5)\r\n break\r\n x = x - f\r\n if x <= 0:\r\n print(6)\r\n break\r\n x = x - g\r\n if x <= 0:\r\n print(7)\r\n break", "n = int(input())\r\na=list(map(int,input().split()))\r\ni=0\r\nwhile n>0:\r\n if i==7:\r\n i=0\r\n n-=a[i]\r\n i+=1\r\nprint(i)\r\n\r\n", "n=int(input())\r\ndays_of_the_week=[int(i) for i in input().split()]\r\ndotw=1\r\nwhile n>0:\r\n if dotw==8:\r\n dotw=1\r\n n-=days_of_the_week[dotw-1]\r\n dotw+=1\r\nprint(dotw-1)", "'''One Sunday Petr went to a bookshop and bought a new book on sports programming. The book had exactly n pages.\r\n\r\nPetr decided to start reading it starting from the next day, that is, from Monday. Petr's got a very tight schedule and for each day of the week he knows how many pages he will be able to read on that day. Some days are so busy that Petr will have no time to read whatsoever. However, we know that he will be able to read at least one page a week.\r\n\r\nAssuming that Petr will not skip days and will read as much as he can every day, determine on which day of the week he will read the last page of the book.\r\n\r\nInput\r\nThe first input line contains the single integer n (1 ≤ n ≤ 1000) — the number of pages in the book.\r\n\r\nThe second line contains seven non-negative space-separated integers that do not exceed 1000 — those integers represent how many pages Petr can read on Monday, Tuesday, Wednesday, Thursday, Friday, Saturday and Sunday correspondingly. It is guaranteed that at least one of those numbers is larger than zero.\r\n\r\nOutput\r\nPrint a single number — the number of the day of the week, when Petr will finish reading the book. The days of the week are numbered starting with one in the natural order: Monday, Tuesday, Wednesday, Thursday, Friday, Saturday, Sunday.'''\r\n\r\nn = int(input())\r\nnums = list(map(int,input().split()))\r\nc = 0\r\nwhile n>0:\r\n if c==7:\r\n c = 0\r\n n = n-nums[c]\r\n c = c+1\r\nprint(c)", "n = int(input())\r\ndays = list(map(int, input().split()))\r\ntot = [days[0]]\r\nfor i in range(1,7):\r\n tot.append(tot[-1]+days[i])\r\n\r\ncount = (n//tot[-1])-1\r\nif count>1:\r\n n -= tot[-1]*count\r\n\r\ni = 7\r\nwhile n>0:\r\n if i==7:\r\n i=0\r\n n-=days[i]\r\n i+=1\r\nprint(i)\r\n", "n=int(input())\r\nl=list(map(int,input().split(' ')))\r\na=sum(l)\r\nd=0\r\nif n%a==0:\r\n b=n//a\r\nelse:\r\n b=(n//a)+1\r\nfor i in range (b):\r\n for i in range (0,7):\r\n d+=l[i]\r\n if d>=n:\r\n print(i+1)\r\n break\r\n\r\n\r\n", "n = int(input())\r\n\r\nweek = list(map(int,input().split()))\r\n\r\nsum = 0\r\ni = 0\r\n\r\nwhile sum < n:\r\n sum+=week[i]\r\n \r\n if sum >= n:\r\n print(i+1)\r\n break\r\n\r\n else:\r\n i+=1\r\n if i == 7:\r\n i = 0; ", "N = int(input())\r\nday = list(map(int,input().split()))\r\nt = day[0]\r\ni=0\r\n\r\nwhile (t < N):\r\n i+=1\r\n i %= 7\r\n t += day[i]\r\n\r\nprint(i+1)\r\n ", "def pab(l,n):\r\n c=0\r\n i=0\r\n while(n>0):\r\n \r\n n=n-l[i]\r\n c=c+1\r\n \r\n if(i==6):\r\n i=0\r\n else:\r\n i=i+1\r\n z=c%7\r\n if(z==0):\r\n print(7)\r\n else:\r\n print(z)\r\n return\r\nn=int(input())\r\nt=input()\r\nl=list(map(int,t.split(' ')))\r\npab(l,n)", "n = int(input())\r\nl = list(map(int, input().split()))\r\ns, i = 0, 0\r\nwhile s < n:\r\n if i == 7:\r\n i = 0\r\n s += l[i]\r\n i += 1\r\nprint(i)", "n = int(input())\r\nx = list(map(int, input().split()))\r\ni=0\r\nwhile n>x[i]:\r\n n-=x[i]\r\n i=(i+1)%7\r\nprint(i+1)\r\n", "n = int(input())\r\n\r\np = list(map(int,input().split()))\r\n\r\ncount = 0\r\n\r\ni = 0\r\nwhile True:\r\n if p[i] + count >= n:\r\n print(i+1)\r\n break\r\n elif i == 6:\r\n count+=p[i]\r\n i = 0\r\n else:\r\n count+=p[i]\r\n i+=1", "n=int(input())\r\nl=list(map(int,input().split()))\r\nwhile(n>0):\r\n for i in range(7):\r\n if(n-l[i]<=0):\r\n print(i+1)\r\n exit(0)\r\n else:\r\n n=n-l[i]", "Formula_N = ''\r\n# n,m = map(int,input().split())\r\n# l = [i for i in range(1,n+1)]\r\n# for i in range(m):\r\n# x,y = map(int,input().split())\r\n# x_index = l.index(x)\r\n# y_index = l.index(y)\r\n# l[x_index] = y\r\n# l[y_index] = x\r\n# l = map(str,l)\r\n# print(' '.join(l))\r\n\r\nn = int(input())\r\nl = list(map(int,input().split()))\r\nd = 0\r\nflag = False\r\nwhile n > 0:\r\n if flag:\r\n break\r\n for i in range(7):\r\n n-=l[i]\r\n if n <= 0:\r\n print(i+1)\r\n flag = True\r\n break\r\n", "n=int(input()) \r\na=list(map(int, input().split()))\r\ni=0\r\nans=0\r\nwhile ans<n:\r\n\tif i==7:\r\n\t\ti=0\r\n\tans+=a[i]\r\n\ti+=1\r\nprint(i)", "a = {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\nn = int(input())\r\nl = list(map(int,input().split()))\r\ni = 1\r\nwhile n > 0:\r\n\tif i > 7:\r\n\t\ti = 1\r\n\tn -= l[i - 1]\r\n\ti += 1\r\nprint(i - 1)", "n = int(input())\nL = list(map(int, input().split()))\ni = 0\nwhile True:\n if n<=L[i]:\n print(i+1)\n break\n else:\n n-=L[i]\n if i==6:\n i = 0\n else:\n i+=1\n \t \t\t\t \t\t \t\t \t\t \t", "n = int(input())\r\ndays = [int(x) for x in input().split()]\r\n\r\ni = 0\r\nwhile n >= 0:\r\n n -= days[i % len(days)]\r\n if n <= 0:\r\n break\r\n i += 1\r\n\r\nprint(i % 7 + 1)\r\n", "def read(n,x):\r\n pages = n\r\n while pages > 0:\r\n for i in range(0,len(x)):\r\n pages -= x[i]\r\n if pages <= 0:\r\n return i+1\r\n\r\n\r\nif __name__ == \"__main__\":\r\n n = int(input())\r\n x = list(map(int,input().split()))\r\n print(read(n,x))", "n=int(input())\r\narr=list(map(int,input().split()))\r\nc=0\r\nsum=arr[0]\r\nwhile sum<n:\r\n c=c+1\r\n if c==7:\r\n c=0\r\n sum=sum+arr[c]\r\nprint(c+1) \r\n \r\n", "tp = int(input())\r\npg = [int(i) for i in input().split()]\r\n\r\nwhile tp > 0:\r\n for i in range(7):\r\n tp -= pg[i]\r\n\r\n if tp <= 0:\r\n di = i+1\r\n break\r\n\r\nprint(di)\r\n", "from math import floor\r\ndef accumu(lis):\r\n total = 0\r\n for x in lis:\r\n total += x\r\n yield total\r\n\r\nbook_pages = int(input())\r\n\r\nls = list(map(int, input().split(\" \")))\r\n\r\nt = 0\r\ni = 0\r\n\r\nwhile t < book_pages:\r\n t += ls[i]\r\n i += 1\r\n i %= 7\r\n\r\nif i==0:\r\n print(\"7\")\r\nelse:\r\n print(i)", "n = int(input())\r\na = list(map(int, input().split()))\r\nwhile True:\r\n for i,v in enumerate(a):\r\n n -= v\r\n if n <= 0:\r\n print(i+1)\r\n break\r\n if n <= 0:\r\n break\r\n", "n = int(input())\r\nA = list(map(int, input().split()))\r\nsoma = 0\r\ni = 0\r\nwhile True:\r\n soma += A[i]\r\n if soma >= n:\r\n break\r\n i = (i + 1) % 7\r\nprint(i + 1)\r\n", "from bisect import bisect_left as bl\r\nfrom itertools import accumulate\r\nn=int(input());a=list(accumulate(map(int,input().split())))\r\nprint(bl(a,a[-1])+1if n%a[-1]==0 else bl(a,n%a[-1])+1)", "n=int(input())\r\na=list(map(int,input().split(maxsplit=6)))\r\ni=0\r\nwhile n>0:\r\n if i==7:\r\n i=0\r\n n=n-a[i]\r\n i=i+1\r\nprint(i)", "n=int(input())\r\np=list(map(int,input().split()))\r\nd={}\r\nfor i in range(1,8):\r\n\td[i]=p[i-1]\r\n\r\nx=1\r\ns=0\r\nwhile s<n:\r\n\ts+=d[x]\r\n\tif s>=n:\r\n\t\tprint(x)\r\n\t\tbreak\r\n\tx+=1\r\n\tif x==8:\r\n\t\tx=1", "n = int(input())\r\nl = input().split()\r\nfor i in range(7):\r\n l[i] = int(l[i])\r\nflag = True\r\nwhile flag:\r\n if flag:\r\n if n - l[0] <=0:\r\n print(1)\r\n flag = False\r\n else:\r\n n -= l[0]\r\n if flag:\r\n if n - l[1] <=0:\r\n print(2)\r\n flag = False\r\n else:\r\n n -= l[1]\r\n if flag:\r\n if n - l[2] <=0:\r\n print(3)\r\n flag = False\r\n else:\r\n n -= l[2]\r\n if flag:\r\n if n - l[3] <=0:\r\n print(4)\r\n flag = False\r\n else:\r\n n -= l[3]\r\n if flag:\r\n if n - l[4] <=0:\r\n print(5)\r\n flag = False\r\n else:\r\n n -= l[4]\r\n if flag:\r\n if n - l[5] <=0:\r\n print(6)\r\n flag = False\r\n else:\r\n n -= l[5]\r\n if flag:\r\n if n - l[6] <=0:\r\n print(7)\r\n flag = False\r\n else:\r\n n -= l[6]\r\n ", "a = int(input())\r\nb = list(map(int,input().split()))\r\nsum = 0\r\ni = 0\r\nwhile(sum < a):\r\n if i == 7:\r\n i = 1\r\n else:\r\n i += 1\r\n sum += b[i-1]\r\n\r\nprint(i)\r\n \r\n", "n=int(input())\r\nsvn_days=list(map(int,input().split()))\r\ncount=0\r\nwhile count<n:\r\n for i in range(7):\r\n count +=svn_days[i]\r\n # print(count)\r\n if count >=n:\r\n print(i+1)\r\n break\r\n", "n=int(input())\narray=list(map(int,input().split()))\nidx=0\nwhile n>0:\n\tif array[idx]>=n:\n\t\tprint(idx+1)\n\t\tbreak\n\tn-=array[idx]\n\tidx+=1\n\tif idx==7:\n\t\tidx=0\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Sat Oct 9 01:07:10 2021\r\n\r\n@author: dell\r\n\"\"\"\r\nn = int(input())\r\narr = [int(i) for i in input().split(\" \")]\r\ni = 0\r\nwhile(True):\r\n i = i%7\r\n n -= arr[i]\r\n n = max(0, n)\r\n if(n == 0):\r\n break\r\n i+=1\r\nprint(i+1)\r\n", "n = int(input())\r\nl = [int(i) for i in input().split()]\r\ni = 0\r\nwhile(True):\r\n n -=l[i]\r\n if(n<=0):\r\n break\r\n i=(i+1)%7\r\nprint(i+1)", "pages = int(input())\r\nreading = list(map(int, input().split()))\r\n\r\ncurRead = 0\r\ncurDay = 1\r\nwhile (curRead < pages):\r\n pagesToAdd = reading[curDay - 1]\r\n curRead += pagesToAdd\r\n if (curRead >= pages):\r\n break \r\n else:\r\n curDay += 1\r\n if (curDay == 8):\r\n curDay = 1 \r\nprint(curDay)\r\n", "p = int(input())\r\n\r\nl_n = list(map(int, input().split()))\r\nn_s = sum(l_n)\r\n\r\nwhile p > n_s:\r\n p -= n_s\r\n\r\nwhile p > 0:\r\n for i in range(len(l_n)):\r\n if l_n[i] >= p:\r\n print(i + 1)\r\n quit()\r\n p -= l_n[i]", "x=int(input())\r\nl=list(map(int,input().split()))\r\nt=l[0]\r\ni=0\r\nwhile t<x:\r\n i+=1\r\n i%=7\r\n t+=l[i]\r\nprint(i+1)", "n = int(input())\r\narr = [int(i) for i in input().split()]\r\ni = 0\r\nprev = i\r\nwhile n>0:\r\n n -= arr[i]\r\n prev = i\r\n i += 1\r\n if i == 7:\r\n i = 0\r\nprint(prev+1)", "n = int(input())\r\nweek = list(map(int, input().split()))\r\nfinished = False\r\n\r\nwhile not finished:\r\n for idx, pages in enumerate(week):\r\n n -= pages\r\n if n <= 0:\r\n finished = True\r\n break\r\n\r\nprint(idx + 1)", "n = int(input())\r\ndays = list(map(int, input().split()))\r\n\r\nday = 1\r\npages_read = 0\r\nwhile pages_read + days[day - 1] < n:\r\n pages_read += days[day - 1]\r\n day = (day % 7) + 1\r\n\r\nprint(day)\r\n\r\n", "n = int(input())\r\npages = list(map(int,input().split()))\r\ntotal = 0\r\ni = 0\r\nwhile total < n:\r\n total += pages[i]\r\n i = (i+1)%7\r\nprint(7 if i == 0 else i)", "def main():\n n = int(input())\n week = list(map(int, input().split(\" \")))\n\n cur_day = 0\n while True:\n n -= week[cur_day]\n if n <= 0:\n break\n cur_day += 1\n cur_day = cur_day % 7\n\n print(cur_day + 1)\n \n\nif __name__ == \"__main__\":\n main()\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\narr=get_array()\r\ni=1\r\nwhile(n>0):\r\n n=n-arr[i-1]\r\n # print(n)\r\n if(n<=0):\r\n print(i)\r\n break\r\n if(i+1>7):\r\n i=1\r\n else:\r\n i=i+1", "n = int(input())\r\narr = list(map(int, input().split()))\r\nday = 1\r\nwhile n > 0:\r\n for i in range(len(arr)):\r\n if n > 0:\r\n n -= arr[i]\r\n if n > 0:\r\n day += 1\r\n if day > 7:\r\n day = 1\r\n else:\r\n break\r\nprint(day)\r\n\r\n", "n = int(input())\r\ndays = list(map(int,input().split(' ')))\r\n\r\ni = 0\r\nwhile n > 0:\r\n if i <= 6:\r\n n -= days[i]\r\n else:\r\n i = -1\r\n i += 1\r\n\r\nprint(i)", "class Solution:\r\n\tdef __init__(self):\r\n\t\tpass\r\n\r\n\tdef solve(self):\r\n\t\tn = int(input())\r\n\t\tarr = list(map(int, input().split()))\r\n\t\tarr2 = []\r\n\t\ts = 0\r\n\t\tday = 0\r\n\r\n\t\tfor x in arr:\r\n\t\t\ts += x\r\n\t\t\tarr2.append(s)\r\n\r\n\t\tremain = n - (n//s)*s\r\n\r\n\t\tif remain == 0:\r\n\t\t\ti = 6\r\n\t\t\twhile i >= 0:\r\n\t\t\t\tif arr[i] != 0:\r\n\t\t\t\t\tbreak\r\n\t\t\t\ti -= 1\r\n\t\t\tday = i + 1\r\n\t\telse:\r\n\t\t\ti = 0\r\n\t\t\twhile i <= 6:\r\n\t\t\t\tif arr2[i] >= remain:\r\n\t\t\t\t\tbreak\r\n\t\t\t\ti += 1\r\n\t\t\tday = i + 1\r\n\r\n\t\tprint(day)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n\tsol = Solution()\r\n\tsol.solve()\r\n", "import math\r\ndef Petr_and_Book():\r\n total_pages_to_read = int(input())\r\n pages_on_day = list(map(int,input().split()))\r\n day = 0\r\n while total_pages_to_read > 0:\r\n total_pages_to_read -= pages_on_day[day]\r\n if total_pages_to_read <= 0:\r\n return day + 1 \r\n day += 1 \r\n if day == 7:\r\n day = 0 \r\n \r\n \r\n \r\nremained_test_cases = 1 \r\n# remained_test_cases = int(input())\r\nwhile remained_test_cases > 0:\r\n print(Petr_and_Book())\r\n remained_test_cases -= 1 ", "pages = int(input())\r\ndays = list(map(int, input().split()))\r\nday = 0\r\nwhile pages > 0:\r\n pages -= days[day]\r\n if pages <= 0:\r\n break\r\n day = (day + 1) % 7\r\nprint(day + 1)", "n=int(input())\r\ndays=list(map(int,input().split()))\r\n\r\ntotal=0\r\nwhile total<n:\r\n x=0\r\n for i in days:\r\n x+=1\r\n total+=i\r\n #print(total)\r\n if total>=n:\r\n break\r\n \r\n \r\nprint(x)\r\n \r\n \r\n \r\n", "n=int(input())\r\nx = list(map(lambda q:int(q), input().split(\" \")))\r\nt=0\r\ni=0\r\nwhile i<len(x):\r\n t=t+x[i]\r\n if t>=n:\r\n print(i+1)\r\n break\r\n i+=1\r\n if i==len(x):\r\n i=0", "import math\r\n\r\nn=int(input())\r\nl1=[]\r\nl1.append(([int(x) for x in input().split()]))\r\nl2=l1[0]\r\na=sum(l2)\r\nl2=l2*(math.ceil(n/a))\r\nsu=0\r\ndef ans():\r\n global su\r\n for i in range(len(l2)):\r\n su=su+l2[i]\r\n if su>=n:\r\n if (i+1)%7!=0:\r\n return (i+1)%7\r\n else:\r\n return 7\r\nprint(ans())", "n=int(input())\r\narr=[int(x) for x in input().split()]\r\npre_arr=[arr[0]]\r\nfor i in range(1,7):\r\n pre_arr.append(arr[i]+pre_arr[i-1])\r\n\r\nwhile pre_arr[6]<n:\r\n n-=pre_arr[6]\r\n\r\nfor i in range(7):\r\n if pre_arr[i]>=n:\r\n break\r\nprint(i+1)\r\n", "n=int(input())\r\nc=0\r\na=[int(i) for i in input().split()]\r\nwhile n>0:\r\n n=n-a[c]\r\n if c==6 and n>0:\r\n c=-1\r\n c+=1\r\nprint(c)", "n=int(input())\r\nls=list(map(int, input().split()))\r\ni=-1\r\nwhile n>0:\r\n i+=1\r\n if i==7:\r\n i=0\r\n n-=ls[i]\r\nprint(i+1)", "n=int(input())\r\nweek=list(map(int,input().split()))\r\ndays=0\r\nif sum(week[0:7])<n:\r\n k=n/sum(week[0:7])\r\n days+=7*int(k)\r\n if int(k)==k:\r\n n=n-sum(week[0:7])*(int(k)-1)\r\n else:\r\n n=n-sum(week[0:7])*(int(k))\r\n#print(n)\r\nif n!=0:\r\n for i in range(1,8):\r\n if sum(week[0:i])>=n:\r\n days+=i\r\n break\r\nday=days%7\r\nif day==0:\r\n print(7)\r\nelse:\r\n print(day)", "n=int(input())\narr=list(map(int, input().split()))\nsum=0\ni=0\nwhile(True):\n sum=sum+arr[i]\n if sum>=n:\n print(i+1)\n break\n elif sum<n and i==6:\n i=0\n continue\n else:\n i=i+1\n \t \t\t \t \t \t \t \t \t\t \t \t \t", "n=int(input())\r\n\r\nL=list(map(int,input().split()))\r\n\r\ni=0\r\nwhile(n>0):\r\n if(i==7):\r\n i=0\r\n n-=L[i]\r\n i+=1\r\nprint(i)", "import sys\n# sys.stdin = open(\"input.txt\", \"r\")\n# sys.stdout = open(\"output.txt\", \"w\")\n# sys.stderr = open(\"error.txt\", \"w\")\n\n\n'''\nbaabbbeeee\ni=0 b\ni =1 a\n\n'''\nt = int(input())\n\narr = list(map(int,input().split()))\n\nn = len(arr)\n\ni = 0\n\nwhile t > 0 :\n\tif i >= n:\n\t\ti=0\n\tt-=arr[i]\n\ti+=1\n\nprint(i)\n\n\n\n\n\n\n\n\n\n\n\t\n\n\n\n\n\n\n\n\n\n\t\n", "n = int(input())\narr = list(map(int,input().split()))\ni = 0\nwhile True:\n n = n - arr[i]\n if n<=0:\n break\n if i==6:\n i=-1\n i+=1\nprint(i+1)", "n= int(input())\r\nweek_list= list(map(int, input().split()))\r\ndict_week= {}\r\n\r\nfor i,j in enumerate(week_list):\r\n dict_week[i+1]= j\r\n\r\nwhile n>=1:\r\n for k, v in dict_week.items():\r\n n-= v\r\n if n<= 0:\r\n print(k)\r\n break", "#from sys import stdin,stdout\r\n#input = stdin.readline\r\n \r\ndef main():\r\n #t = int(input())\r\n t = 1\r\n for z in range(t):\r\n n = int(input())\r\n #n,k = map(int,input().split())\r\n ai = list(map(int,input().split()))\r\n num = sum(ai)\r\n if n % num == 0:\r\n n = num\r\n else:\r\n n %= num \r\n for i in range(7):\r\n n -= ai[i]\r\n if n <= 0:\r\n print(i+1)\r\n break\r\nmain()\r\n", "d = int(input())\r\n\r\nl = list(map(int,input().split()))\r\n\r\npre=[l[0]]\r\n\r\nfor i in range(1,len(l)):\r\n pre.append(pre[-1]+l[i])\r\nwhile(True):\r\n for i in range(len(pre)):\r\n if pre[i]>=d:\r\n print(i+1)\r\n exit(0)\r\n d-=pre[-1]", "import math\r\nimport os\r\nimport random\r\nimport re\r\nimport sys\r\nimport functools\r\nfrom operator import itemgetter, attrgetter\r\nfrom collections import Counter\r\n\r\nif __name__ == '__main__':\r\n Y = lambda: list(map(int, input().split()))\r\n N = lambda: int(input())\r\n\r\n n = N()\r\n a = Y()\r\n i = 0\r\n\r\n while n - a[i] > 0:\r\n n -= a[i]\r\n i = 0 if i == 6 else i + 1\r\n print(i + 1)", "n=int(input())\r\nlst=list(map(int,input().split()))\r\n\r\nind=0\r\nwhile(n>0):\r\n curr_ind=ind%7\r\n n-=lst[curr_ind]\r\n ind+=1\r\nprint(curr_ind+1)", "pages = int(input())\nreads = list(map(int, input().split()))\n\ncurrent = 0\nday = -1\nwhile current < pages:\n day += 1\n current += reads[day%7]\nprint(day%7 + 1)\n\n", "def ii(): return int(input())\r\ndef si(): return input()\r\ndef mi(): return map(int,input().split())\r\ndef msi(): return map(str,input().split())\r\ndef li(): return list(mi())\r\n\r\nn=ii()\r\na=li()\r\nday=[]\r\n\r\nfor i in range(7):\r\n day.append((a[i],i+1))\r\n\r\nres=day.copy() \r\n\r\nwhile n>0:\r\n if not res:\r\n res=day.copy()\r\n \r\n rem,da = res.pop(0)\r\n \r\n if n>rem:\r\n n-=rem\r\n \r\n else:\r\n ans=da\r\n break\r\n \r\nprint(ans)\r\n \r\n ", "#ashu@gate22\r\nn=int(input())\r\nl=list(map(int,input().split()))\r\ns=0\r\npos=0\r\nwhile s<n:\r\n for i in range(len(l)):\r\n s+=l[i]\r\n pos=i\r\n if s>=n:\r\n break\r\nprint(pos+1)\r\n\r\n ", "n=int(input())\r\nlst=list(map(int,input().split()))\r\ndef solve(n,lst):\r\n days=0\r\n i=0\r\n rem=n%sum(lst)\r\n comp=n//sum(lst)\r\n n-=(comp-1)*sum(lst)\r\n while n>0:\r\n if days==7:days=0\r\n if i==7:i=0\r\n n-=lst[i]\r\n days+=1\r\n i+=1\r\n return days\r\nprint(solve(n,lst))", "n = int(input())\r\na = list(map(int,input().split()))\r\ni=0\r\nwhile(n>0):\r\n i = i%7\r\n n -= a[i]\r\n i +=1\r\nprint(i)", "import math\r\n\r\n\r\n#for i in range(int(input())):\r\nn = int(input())\r\n\r\nweek = list(map(int, input().split()))\r\ni = 0\r\nwhile(n>0):\r\n i = i % 7\r\n n -= week[i]\r\n i += 1\r\n\r\nprint(i)", "n=int(input())\r\na=[int(i) for i in input().split()]\r\nwhile sum(a)<n:\r\n n-=sum(a)\r\ni=0\r\nwhile n>0:\r\n n-=a[i]\r\n i+=1\r\nprint(i)\r\n", "n = int(input())\r\nr = list(map(int, input().split()))\r\ni = 1\r\nsum = 0\r\nwhile(i<8):\r\n sum += r[i-1]\r\n if(sum >= n):\r\n print(i)\r\n break\r\n else:\r\n i += 1\r\n if(i == 8):\r\n i -= 7", "n=int(input())\r\nd=list(map(int,input().split(\" \")))\r\nj=0\r\nwhile(n>0):\r\n if(j==7):\r\n j=0\r\n n=n-d[j]\r\n j+=1\r\nprint(j)\r\n", "\"\"\"\r\n7\r\n1 1 1 1 1 1 1\r\n\"\"\"\r\nnum_of_pages = int(input())\r\npages = [int(a) for a in input().split(' ')]\r\n\r\npages_per_week = sum(pages)\r\n\r\npages_read = 0\r\ni=0\r\nwhile pages_read < num_of_pages:\r\n pages_read += pages[i]\r\n if(pages_read >= num_of_pages):\r\n break\r\n i+=1\r\n if i == 7:\r\n i=0\r\nprint(i+1)", "n= int(input())\r\n\r\nweek= list(map(int,input().split()))\r\n\r\nd=1\r\n\r\nwhile n>0:\r\n n=n-week[d-1]\r\n \r\n if n>0:\r\n d+=1 \r\n if d>7:\r\n d=1\r\n \r\nprint(d)", "n = int(input())\r\na = [int(i) for i in input().split()]\r\ni = 6\r\nwhile n > 0:\r\n i += 1\r\n i %= 7\r\n n -= a[i]\r\n if i == 7:\r\n i = 0\r\nprint(i + 1)", "n = int(input())\r\npages = input().split(' ')\r\ntmp = 0\r\nc = 0 \r\nwhile tmp < n :\r\n for i in range(len(pages)):\r\n if tmp < n : \r\n tmp+=int(pages[i])\r\n c= i+1\r\n else :\r\n break\r\nprint(c)", "n = int(input())\r\nlst = list(map(int, input().split()))\r\n\r\nfor i in range(1000000):\r\n j = i % 7\r\n n-=lst[j]\r\n # if i == 224:\r\n # print(n)\r\n # break\r\n if n <= 0:\r\n print(j+1)\r\n break\r\n", "pages = int(input())\r\narr = list(map(int,input().split()))\r\ni = 0\r\n\r\nwhile pages > 0:\r\n i = i%7\r\n pages -= arr[i]\r\n i += 1\r\nprint(i)\r\n", "n=int(input())\r\na=list(map(int, input().split()))\r\ntotal=0\r\ni=0\r\nwhile(1):\r\n total+=a[i]\r\n if total>=n:\r\n break\r\n i+=1\r\n if i==7:\r\n i=0\r\nprint(i+1)", "n=int(input())\r\nr=list(map(int,input().split()))\r\ni=0;\r\nwhile(n-r[i]>0):\r\n n=n-r[i]\r\n i=(i+1)%7\r\nprint(i+1) ", "n = int(input())\r\na = list(map(int,input().split()))\r\n\r\nwhile n>0:\r\n for i,d in enumerate(a):\r\n if n-d>0:\r\n n-=d\r\n else:\r\n n-=d\r\n print(i+1)\r\n break", "n=int(input())\r\nv=list(map(int,input().split()))\r\nsum=0\r\nfor i in range(10000):\r\n sum=sum+v[i%7]\r\n if sum>=n:\r\n print(i%7+1)\r\n break", "sayfa_sayisi=int(input())\r\ngunluk_sayfa=[int(i) for i in input().split()]\r\nwhile(sayfa_sayisi>0):\r\n for i in range(7):\r\n sayfa_sayisi-=gunluk_sayfa[i]\r\n if(sayfa_sayisi<1):\r\n break\r\nprint(i+1)", "pages = int(input())\r\ndays = list(map(int, input().split()))\r\ni = 0\r\nwhile pages > 0:\r\n pages -= days[i%7]\r\n if pages <= 0:\r\n print(i%7 +1)\r\n break\r\n else:\r\n i += 1", "n=int(input())\r\nno=list(map(int,input().split()))\r\nans=0\r\nwhile n> no[ans]:\r\n n-=no[ans]\r\n ans=(ans+1)%7\r\nprint(ans+1)\r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\ni=0\r\nwhile True:\r\n n-=a[i]\r\n if n<=0:\r\n print(i+1)\r\n break\r\n if i==6:\r\n i=0\r\n else:\r\n i+=1\r\n", "n=int(input())\r\ndays=list(map(int,input().split()))\r\ncount=0\r\nf=0\r\nwhile(True):\r\n day=0\r\n if(count>=n):\r\n break\r\n for i in range(7):\r\n count+=days[i]\r\n if(count>=n):\r\n f=1\r\n break\r\n else:\r\n day+=1\r\n if(f==1):\r\n break\r\nprint(day+1)\r\n", "n = int(input())\r\na= list(map(int,input().split()))\r\nans = 0\r\nwhile n > 0:\r\n for i in range(len(a)):\r\n if n <= 0:\r\n break\r\n n -= a[i]\r\n ans = i\r\nprint(ans+1)", "n = int(input())\r\nl = list(map(int,input().split()))\r\ni = 0\r\nwhile n > 0 :\r\n n -= l[i]\r\n if n <= 0 : break\r\n i += 1\r\n i = i % 7\r\nprint(i+1)\r\n", "n = int(input())\r\npages_per_day = list(map(int, input().split()))\r\n\r\ntotal_pages = 0\r\nday = 0\r\n\r\nwhile total_pages < n:\r\n total_pages += pages_per_day[day]\r\n day = (day + 1) % 7\r\n\r\nprint(day if day != 0 else 7)\r\n", "n=int(input())\r\nk=list(map(int,input().split()))\r\nstch=0\r\nwhile n>0:\r\n n=n-k[stch%7]\r\n stch+=1\r\nstch-=1\r\nprint(stch%7+1)", "n=int(input())\r\npages=list(map(int,input().split()))\r\nsum=0\r\ni=0\r\nwhile(True):\r\n i=i%7\r\n sum=sum+pages[i]\r\n if(sum>=n and sum>=1):\r\n day=i\r\n break\r\n i=i+1\r\nprint(day+1)", "p=int(input())\r\nn=list(map(int,input().split()))\r\ndays=1\r\ndup_p=p \r\ni=0\r\nwhile(i<7):\r\n dup_p=dup_p-n[i]\r\n if(dup_p<=0):\r\n print(i+1)\r\n break\r\n elif(dup_p>0 and i+1==7):\r\n i=0\r\n else:\r\n i+=1", "n = int(input())\r\nlst = [int(x) for x in input().split()]\r\ni = 0\r\nwhile n-lst[i]>0:\r\n n-=lst[i]\r\n i = (i+1)%7\r\n\r\nprint(i+1)", "p = int(input())\nl = list(map(int, input().split(' ')))\nr = 0\ni = 1\nwhile True:\n if i == 8:\n i = 1\n pr = l[i-1]\n r+=pr\n if r >= p:\n break\n i+=1\n\nprint(i)\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\ng = 0\r\nwhile n > 0:\r\n g += 1\r\n n -= l[(g%7)-1]\r\np =g%7\r\nif p == 0 and g >0:\r\n print(7)\r\nelse:\r\n print(g%7)", "a=int(input())\r\nb=list(map(int,input().split()))\r\nc=0\r\ni=0\r\nwhile(c<a):\r\n c+=b[i]\r\n i=(i+1)%7\r\nprint(i if i != 0 else 7)\r\n\r\n ", "n = int(input())\r\nM, Tu, W, Th, Fr, Sa, Su = map(int, input().split())\r\nweek = [M, Tu, W, Th, Fr, Sa, Su]\r\nt = week[0]\r\ni = 0\r\nwhile t<n:\r\n i += 1\r\n i %= 7\r\n t += week[i]\r\nprint(i+1)", "'''\n R E X\n\n Date - 17th May 2021\n\n Platform - Practice\n\n @author:\n CodeForces -> kunalverma19\n CodeChef -> kunalverma_19\n AtCoder -> TLKunalVermaRX\n'''\nimport sys\nimport math\nMOD = 1000000007\n# sys.stdin=open(\"input.txt\",\"r\")\nn=int(input())\na=list(map(int,input().split(' ')))\npos=0\nwhile(n>0):\n\tsm=0;\n\tfor i in range(len(a)):\n\t\tsm+=a[i];\n\t\tif(sm>=n):\n\t\t\tpos=i+1\n\t\t\tn=0\n\t\t\tbreak;\n\tn-=sm;\n\tpos+=1\nprint(pos-1)", "n = int(input())\r\nl = list(map(int,input().split()))\r\nx = 0\r\nsm = 0\r\nwhile n > sm:\r\n sm+=l[x%7]\r\n x+=1\r\n \r\nif x % 7 == 0:\r\n print(7)\r\nelse:\r\n print(x%7)\r\n \r\n\r\n\r\n \r\n \r\n \r\n\r\n \r\n\r\n\r\n\r\n\r\n\r\n\r\n \r\n\r\n\r\n ", "required_pages = int(input())\r\nquantity_pages = list(map(int, input().split()))\r\nday = 0\r\nrequired_pages -= quantity_pages[day]\r\nwhile required_pages > 0:\r\n day = (day + 1) if day != 6 else 0\r\n required_pages -= quantity_pages[day]\r\nprint(day + 1)", "n = int(input())\r\na = list(map(int, input().split(\" \")))\r\nz = 0\r\ni = 0\r\nwhile True:\r\n z += a[i]\r\n if z>=n:\r\n break\r\n i += 1\r\n if i>6:\r\n i = 0\r\nprint(i+1)\r\n\r\n\r\n\r\n", "def solve(n, values):\r\n total = 0\r\n i = 0\r\n while n > total:\r\n if i == 7:\r\n i = 0\r\n total += values[i]\r\n i += 1\r\n return i\r\n\r\ndef main():\r\n n = int(input())\r\n values = [int(a) for a in input().strip().split()]\r\n print(solve(n, values))\r\n\r\nif __name__ == \"__main__\":\r\n main()", "n = int(input())\nlis = list(map(int,input().split()))\nj = 0\nflag = True\nwhile n>0:\n if lis[j]!=0:\n n-=lis[j]\n n = max(0,n)\n j = (j+1)%7\n if n==0 and j==0:\n print(7)\n flag = False\nif flag:\n print(j)", "n = int(input().strip())\r\npages = list(map(int,input().strip().split()))[:7]\r\ni = 1\r\nwhile True:\r\n if i == 8:\r\n i = 1\r\n n -=pages[i-1]\r\n if n <=0 :\r\n print(i)\r\n break\r\n i +=1\r\n\r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\nwhile n!=0:\r\n for i in range(7):\r\n if a[i]>=n:\r\n print(i+1)\r\n n=0\r\n break\r\n else:\r\n n-=a[i]", "from array import *\r\n\r\nif __name__=='__main__':\r\n a = int(input())\r\n# arr = []\r\n arr = input()\r\n arr = arr.split(' ')\r\n arr = [int(x) for x in arr]\r\n day = 1;\r\n while(a>0):\r\n a = a-arr[day-1]\r\n day = day+1\r\n if(day==8):\r\n day = 1\r\n if(day==1):\r\n print(7)\r\n else :\r\n print(day-1)", "# http://codeforces.com/problemset/problem/139/A\r\n\r\n\"\"\"\r\nPetr wants to read a book which has n pages\r\nNumber of pages he will read for a given day of the week is fixed\r\nHe starts reading on Monday\r\nFind the day he finishes\r\n\r\nDays of the week are represented with 1,7 where 1 is Monday and 7 is Sunday\r\n\"\"\"\r\n\r\nimport sys\r\n\r\nn = int(sys.stdin.readline())\r\ndays = list(map(int, sys.stdin.readline().split()))\r\n\r\npages = n\r\nday = -1\r\nwhile pages > 0:\r\n day = (day + 1) % 7\r\n pages -= days[day]\r\n\r\nsys.stdout.write(str(day+1))", "sayfa=int(input())\nnumero=list(map(int,input().split()))\ndiem=-1\nwhile sayfa > 0:\n if diem > 5:\n diem=-1\n diem+=1\n sayfa-=numero[diem]\nprint(diem+1)\n\t \t\t \t \t \t\t\t \t \t\t\t \t \t", "pages = int(input())\r\ndays = list(map(int , input().split())) \r\ndays_counter = 1\r\nwhile pages >0 :\r\n if days_counter > 7 : \r\n days_counter = 1 \r\n pages -= days[days_counter-1] \r\n days_counter += 1 \r\nprint(days_counter-1)", "n = int(input())\r\na = list(map(int, input().strip().split()))\r\nb = 0\r\ntotal = 0\r\nif sum(a) < n:\r\n if n % sum(a) == 0:\r\n total = sum(a)\r\n else:\r\n total = n % sum(a)\r\nelse:\r\n total = n\r\nwhile b <= len(a):\r\n if sum(a[0:b]) >= total:\r\n if b == 0:\r\n print(\"1\")\r\n break\r\n print(b)\r\n break\r\n b += 1\r\n", "n=int(input())\r\narr=list(map(int,input().split()))\r\ns=0\r\nwhile s<n:\r\n for i in range(7):\r\n s=s+arr[i]\r\n if s>=n:\r\n print(i+1)\r\n break\r\n else:\r\n continue", "n = int(input())\r\nweek = list(map(int, input().split()))\r\ni = 0\r\nwhile n > 0:\r\n n -= week[i%7]\r\n i += 1\r\nif i%7 == 0:\r\n print(7)\r\nelse:\r\n print(i%7)\r\n", "n = int(input())\r\narr = [int(i) for i in input().split()]\r\nday = 0\r\nwhile(n > 0):\r\n if(n <= arr[day]):\r\n print(day + 1)\r\n break\r\n else:\r\n n -= arr[day]\r\n day = (day + 1) % 7", "n=int(input())\r\nl=list(map(int,input().split()))\r\npos=0\r\ns=0\r\ni=0\r\nwhile(1):\r\n i=i%7\r\n s=s+l[i]\r\n if(s>=n and s>=1):\r\n pos=i\r\n break\r\n i+=1\r\n\r\nprint(pos+1)\r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\ns=0\r\nwhile s<=n:\r\n for i in range(len(a)):\r\n s=s+a[i]\r\n if s>=n:\r\n print(i+1)\r\n exit()", "def solve(n,lst):\r\n sum = 0\r\n i = 0\r\n while i < len(lst)+1:\r\n if i == len(lst):\r\n i = 0\r\n sum += lst[i]\r\n # print(sum,end=\" \")\r\n # print(i,end=\" \")\r\n if sum >= n:\r\n return i+1\r\n i += 1\r\n\r\n\r\n\r\nn = int(input())\r\nlst = [int(x) for x in input().split()]\r\nprint(solve(n,lst))", "n=int(input())\r\npages = input().split()\r\ni=0\r\nwhile True:\r\n pages[i] = int(pages[i])\r\n n-= pages[i]\r\n \r\n if n<=0:\r\n print(i+1)\r\n break\r\n \r\n i+=1\r\n if i==7:\r\n i=0\r\n ", "from itertools import product\r\nfrom math import ceil\r\n\r\ndef binary_table(string_with_all_characters, length_to_make):\r\n return [''.join(x) for x in product(string_with_all_characters, repeat=length_to_make)]\r\n\r\n\r\ndef all_possible_substrings(string):\r\n return [string[i: j] for i in range(len(string)) for j in range(i + 1, len(string) + 1)]\r\n\r\n\r\ndef number_of_substrings(length):\r\n return int(length * (length + 1) / 2)\r\n\r\n\r\ndef is_prime(num):\r\n for i in range(2, num):\r\n if num / i == int(num / i) and num != i:\r\n return False\r\n\r\n return True\r\n\r\n\r\n\"\"\"for enumeration in range(int(input())):\r\n\"\"\"\r\nnum_of_pages = int(input())\r\narray = list(map(int, input().split()))\r\nday = 1\r\nnum = 0\r\nwhile True:\r\n num += array[day - 1]\r\n if num >= num_of_pages:\r\n broke = True\r\n break\r\n if day == 7:\r\n day = 1\r\n else:\r\n day += 1\r\nprint(day)", "n = int(input())\r\ndays = list(map(int, input().split()))\r\n\r\nweek = sum(days)\r\nwhile n>week:\r\n n-=week\r\n\r\nfor e in range(7):\r\n n-=days[e]\r\n if n<=0:\r\n print(e+1)\r\n break\r\n", "#文字列入力はするな！！\r\n#carpe diem\r\n\r\n'''\r\n ██╗ ██╗ ███╗ ███╗ ██╗ ████████╗\r\n ██║ ██║ ████╗ ████║ ██║ ╚══██╔══╝\r\n═════════██╠════════██╠═══██╔████╔██╠═══██╠══════██╠══════════\r\n ██║ ██║ ██║╚██╔╝██║ ██║ ██║\r\n ███████╗ ██║ ██║ ╚═╝ ██║ ██║ ██║\r\n ╚══════╝ ╚═╝ ╚═╝ ╚═╝ ╚═╝ ╚═╝\r\n'''\r\n\r\n#文字列入力はするな！！\r\n#carpe diem\r\n\r\ntotal=int(input())\r\nL=list(map(int,input().split()))\r\nfor i in range(100000):\r\n total-=L[i%7]\r\n if total<=0:\r\n print((i%7)+1)\r\n break\r\n \r\n\r\n#carpe diem \r\n#carpe diem", "x=int(input())\r\nl=list(map(int,input().split()))\r\n\r\nc=0\r\ns=0\r\n\r\nwhile True:\r\n s+=l[c]\r\n if s>=x:\r\n break\r\n else:\r\n c+=1\r\n if c>6:\r\n c=0\r\n\r\nprint(c+1) \r\n \r\n \r\n\r\n \r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\nres = 1\r\ni = 0\r\nwhile n - a[res - 1] > 0:\r\n n -= a[res - 1]\r\n res = (res % 7) + 1\r\nprint(res)\r\n\r\n\r\n\r\n\r\n", "n = int(input())\r\nd = list(map(int, input().split()))\r\nk = 0\r\nwhile n > 0:\r\n n -= d[k % 7]\r\n k += 1\r\ntemp = k % 7\r\nif temp == 0:\r\n temp = 7\r\nprint(temp)\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\nc=0\r\nwhile True:\r\n\tfor i in range(7):\r\n\t\tc+=l[i]\r\n\t\tif c//n>=1:\r\n\t\t\tprint(i+1)\r\n\t\t\texit()", "n = int(input())\r\npagesRead = list(map(int, input().split()))\r\ntotal = 0\r\nwhile total < n:\r\n count = 0\r\n for x in range(len(pagesRead)):\r\n if total < n:\r\n total = total + pagesRead[x]\r\n count = count + 1\r\n else:\r\n break\r\n\r\nprint(count)\r\n", "n = int(input())\r\nd = list(map(int, input().split()))\r\n\r\nwhile n > 0:\r\n for i in range(7):\r\n n -= d[i]\r\n if n <= 0:\r\n print(i+1)\r\n break", "n, ls, c, day = int(input()), list(map(int, input().split())), 0, 0\r\nwhile c < n:\r\n for i in range(7): \r\n if c < n: c += ls[i]; day = i\r\n else: break\r\nprint(day + 1)", "n = int(input())\r\nread = list(map(int, input().split()))\r\ni = 0;\r\nwhile (n - read[i] > 0) :\r\n n = n - read[i]\r\n i = (i + 1) % 7\r\nprint(i + 1) ", "# *\n# * *\n# * *\n# * * * Author:Aditya Joshi\n# * *\n# * *\n# for _ in range(int(input())):\nn = int(input())\nl = list(map(int, input().split()))\nx = n\ni = 0\nwhile True:\n x -= l[i]\n if x <= 0:\n print(i+1)\n break\n i += 1\n i = i % 7\n", "n = int(input())\r\na = list(map(int, input().split()))\r\nadd = 0\r\ni = 0\r\nwhile add < n:\r\n add += a[i % 7]\r\n if add >= n:\r\n break\r\n i += 1\r\nprint((i % 7) + 1)", "# https://codeforces.com/problemset/problem/139/A\n\ndef handle():\n pages = int(input())\n pages_per_day = input().split(\" \")\n pages_per_day = [int(i) for i in pages_per_day]\n index = 0\n\n while pages > 0:\n pages -= pages_per_day[index]\n if pages <= 0:\n return index + 1\n index += 1\n if index == len(pages_per_day):\n index = 0\n\nprint(handle())", "# pages = int(input())\n# days = [int(d) for d in input().split(' ')]\n# for i in range(7100):\n# pages -= days[i % 7] \n# if pages <= 0:\n# print((i % 7) + 1)\n# break\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\npages = int(input())\ndays = [int(d) for d in input().split(' ')]\n\n\n\n\n# first attempt\nsumm = 0\ncurrent_day = 1\nwhile True:\n summ += days[current_day - 1]\n\n if summ < pages:\n # posun dna\n if current_day < 7:\n current_day += 1\n else:\n current_day = 1\n else:\n break\n\nprint(current_day)\n\n\n\n\n\n\n\n\n\n\n\n\n\n", "n = int(input())\r\nlis= [int(x) for x in input().split()]\r\npos = 0\r\nwhile(n>0):\r\n n -=lis[pos%7] \r\n pos+=1\r\nif(pos%7==0):\r\n print(7)\r\nelse:\r\n print(pos%7)", "n = int(input())\nwk = [int(_) for _ in input().split()]\nn, i = n%sum(wk), 6\nif n == 0:\n n = sum(wk)\nwhile n > 0:\n i = (i+1)%7\n n -= wk[i]\nprint(i+1)\n", "n = int(input())\r\n\r\na = [int(x) for x in input().split()]\r\nsm = 0\r\nfor i in a:\r\n\tsm += i\r\n\r\nif sm < n:\r\n\twhile(sm < n):\r\n\t\tn -= sm\r\n\t#print(n)\r\n\ttemp = 0\r\n\tfor i in range(7):\r\n\t\ttemp += a[i]\r\n\t#\tprint(temp)\r\n\t\tif temp >= n:\r\n\t\t\tprint(i+1)\r\n\t\t\tbreak\r\nelse:\r\n\ttemp = 0\r\n\tfor i in range(7):\r\n\t\ttemp += a[i]\r\n\t\tif temp >= n:\r\n\t\t\tprint(i+1)\r\n\t\t\tbreak", "n = int(input())\r\nday = -1\r\nl = list(map(int,input().split()))\r\nwhile n>0:\r\n\tday = (day+1)%7\r\n\tn-=l[day]\r\nprint(day+1)", "n = int(input())\r\nlst = list(map(int, input().split()))\r\nday=0\r\nflag=0\r\n\r\nwhile True:\r\n day=0\r\n for i in range(len(lst)):\r\n if n<=lst[i]:\r\n print(day+1)\r\n flag=1\r\n break\r\n else:\r\n n-=lst[i]\r\n day+=1\r\n \r\n if flag==1:\r\n break", "n = int(input())\r\nd = list(map(int, input().split()))\r\ns = 0; ns=1\r\n\r\nwhile ns:\r\n for i in range(1,8):\r\n s = s+d[i-1]\r\n\r\n if s >= n:\r\n print(i)\r\n ns = 0\r\n break;\r\n\r\n\r\n", "import math\r\n\r\np = int(input())\r\n\r\nppd = list(map(int, input().split()))\r\n\r\nday = 0\r\nwhile True:\r\n if day > 6:\r\n day = 0\r\n p -= ppd[day]\r\n if p <= 0:\r\n break\r\n day += 1\r\n\r\nprint(day + 1)", "# https://codeforces.com/problemset/problem/139/A\r\nimport sys\r\n#-----------------------------------------------------------------------------#\r\n\r\ninput = sys.stdin.readline\r\nprint = sys.stdout.write\r\n \r\n#-----------------------------------------------------------------------------#\r\n \r\nn = int(input())\r\npages = list(map(int, input().split()))\r\nweekly_pages = sum(pages)\r\n \r\nremaining = n % weekly_pages\r\n \r\nif remaining == 0:\r\n remaining = n - weekly_pages * (n // weekly_pages - 1)\r\n \r\nfor j, i in enumerate(pages):\r\n remaining -= i\r\n if remaining <= 0:\r\n print(str(j + 1))\r\n break", "n=int(input())\r\nx=list(map(int,input().split()))\r\ni=0\r\nwhile n>x[i]:\r\n n-=x[i]\r\n i=(i+1)%7\r\nprint(i+1)", "n = int(input())\r\narr = list(map(int, input().split()))\r\ni=0\r\nwhile(n>0):\r\n n=n-arr[i]\r\n \r\n i = (i+1) % 7\r\nif(i==0):\r\n print(len(arr))\r\nelse:\r\n print(i)", "t=int(input())\r\nl=list(map(int,input().split()))\r\ncheck=0\r\nx=0\r\nwhile check<t:\r\n for i in range(len(l)):\r\n if check<t:\r\n check+=l[i]\r\n x=i\r\n\r\nprint(x+1)\r\n\r\n\r\n\r\n", "# LUOGU_RID: 101469290\nn, *a = map(int, open(0).read().split())\r\ns = p = 0\r\nwhile s < n:\r\n s += a[p]\r\n p = (p + 1) % 7\r\nprint((p - 1) % 7 + 1)", "n=int(input())\r\nl=list(map(int,input().split()))\r\nc=True\r\nwhile c:\r\n for i in range(len(l)):\r\n n=n-l[i]\r\n if n<=0:\r\n print(i+1)\r\n c=False\r\n break\r\n ", "n=int(input())\r\nli=input().split()\r\ngi=[int(i) for i in li]\r\ni=0\r\nwhile n>0:\r\n if(i>len(gi)-1):\r\n i=0\r\n n=n-gi[i]\r\n i=i+1\r\n \r\n\r\nprint(i)", "n = int(input())\r\ndays = list(map(int, input().split()))\r\nday = 0\r\nwhile days[day] < n:\r\n\tn -= days[day]\r\n\tday += 1\r\n\tif day == 7:\r\n\t\tday = 0\r\nprint(day + 1)", "n = int(input())\r\nx = [int(i) for i in input().split()]\r\nwhile n > 0:\r\n if n > 0:\r\n for i in range(7):\r\n n -= x[i]\r\n if n <= 0:\r\n break\r\nprint(i+1)", "n=int(input())\r\nl=list(map(int, input().split()))\r\ni=0\r\nc=0\r\nwhile(n>0):\r\n if(l[i]>0):\r\n n=n-l[i]\r\n c+=1\r\n if(n<=0):\r\n print(i+1)\r\n break\r\n i=i+1\r\n i=i%len(l)\r\n \r\n", "\r\nn = int(input())\r\n\r\nper = list(map(int,input().split()))\r\n\r\nsumm = 0\r\n\r\nk = 0\r\n\r\nwhile(n>0) :\r\n \r\n n = n - per[k]\r\n \r\n k = k + 1\r\n \r\n if k==7 :\r\n \r\n k = 0\r\n \r\nif k ==0 :\r\n k =7\r\n \r\nprint(k)\r\n\r\n\r\n\r\n\r\n", "n = int(input())\r\nweek = list(map(int, input().split()))\r\nread = 0\r\nfound = False\r\nwhile(True):\r\n if(found):\r\n break\r\n for i in range(len(week)):\r\n read += week[i]\r\n if(read >= n):\r\n found = True\r\n print(i + 1)\r\n break", "pages = int(input())\r\ndaily_read = list(map(int, input().split()))\r\nindex = 1\r\n\r\nwhile pages > 0:\r\n pages -= daily_read[index - 1]\r\n\r\n if pages <= 0: break\r\n elif index == 7 : index = 1\r\n else: index += 1\r\n \r\nprint(index)", "try:\r\n n = int(input())\r\n a = list(map(int, input().split()))\r\n x=0\r\n i=0\r\n while x<n:\r\n if i>6:\r\n i=0\r\n x = x + a[i]\r\n i+=1\r\n print(i)\r\nexcept:\r\n pass", "n=int(input())\r\nl=list(map(int,input().split()))\r\nt=l[0]\r\ni=0\r\nwhile t<n:\r\n i=i+1\r\n i=i%7\r\n t=t+l[i]\r\nprint(i+1)", "n=int(input())\r\ncol=input().split()\r\nwhile n>0:\r\n i=0\r\n while i<7:\r\n n=n-int(col[i])\r\n if n<=0:\r\n break\r\n else:\r\n i=i+1\r\nprint (i+1)", "from sys import stdin, stdout\r\nn = int(stdin.readline().strip())\r\n\r\npages = list(map(int, stdin.readline().strip().split()))\r\nread = 0\r\ncnt = 0\r\nread_on = 0\r\n\r\nfor i in pages:\r\n if i != 0:\r\n read_on += 1\r\n\r\nwhile read < n:\r\n for i in pages:\r\n read += i\r\n cnt += 1\r\n if read >= n:\r\n break\r\nmoded = cnt % 7\r\nif moded == 0:\r\n stdout.write(f\"{7}\")\r\nelse:\r\n stdout.write(f\"{moded}\")\r\n", "n=int(input())\nli=list(map(int,input().split()))\ni=0\nwhile(n>0):\n i=(i%7)+1\n n=n-li[i-1]\nprint(i)\n", "n=int(input())\r\nar=list(map(int,input().split()))\r\ni=0\r\nwhile(n>0):\r\n i = i%7\r\n n -= ar[i]\r\n i +=1\r\nprint(i)", "n=int(input())\r\narr=list(map(int,input().split()))\r\nsummation=sum(arr)\r\nrem=n%summation\r\nquo=n/summation\r\n\r\nif rem==0:\r\n i=7\r\n while i>0:\r\n if arr[i-1]!=0:\r\n print(i)\r\n break\r\n i-=1\r\nelse:\r\n for i in range(7):\r\n rem-=arr[i]\r\n if rem<=0:\r\n print(i+1)\r\n break\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\n\r\nday = 0\r\ni = 0\r\nwhile n>0:\r\n day += 1\r\n n -= a[i]\r\n if i==6:\r\n i=0\r\n else:\r\n i += 1\r\nprint((day-1)%7+1)", "n=int(input())\r\ni=0\r\nlst=list(map(int, input().split()))\r\nwhile n>0:\r\n n-=lst[i]\r\n i+=1\r\n if i>6:\r\n i=0\r\nif i!=0:\r\n print(i)\r\nelse:\r\n print(\"7\")", "def solve(n, a):\r\n p = 0\r\n i = 0\r\n while True:\r\n p += a[i%7]\r\n if p >= n:\r\n return i % 7 + 1\r\n i += 1\r\n\r\n\r\nprint(solve(int(input()), [int(x) for x in input().split(' ')]))", "a=int(input())\r\nb=list(map(int,input().split()))\r\nsum=0\r\ni=0\r\n\r\nwhile i<7:\r\n sum=sum+b[i]\r\n if sum>=a:\r\n print(i+1)\r\n break\r\n if i == len(b)-1:\r\n i = i-7\r\n i+=1", "n=int(input())\r\na=list(map(int,input().split()))\r\nt = a[0]\r\ni=0\r\n\r\nwhile (t < n):\r\n i+=1;\r\n i %= 7;\r\n t += a[i];\r\nprint(i+1)", "p = int(input())\r\n\r\nln = list(map(int, input().split()))\r\nns = sum(ln)\r\n\r\nwhile p > ns:\r\n p -= ns\r\n\r\nwhile p > 0:\r\n for i in range(len(ln)):\r\n if ln[i] >= p:\r\n print(i + 1)\r\n quit()\r\n p -= ln[i]", "pages = int(input())\r\neach_day_read = list(map(int,input().split()))\r\ni,total_read = 0,0\r\nwhile i < 7:\r\n total_read += each_day_read[i]\r\n if total_read >= pages:\r\n print(i+1);exit()\r\n i+=1\r\n if i == 7:i=0\r\n \r\n", "pages = int(input())\r\nweek = list(map(int, input().split()))\r\npointer = -1\r\n\r\nwhile pages>0:\r\n pointer = (pointer + 1) % 7\r\n pages -= week[pointer]\r\n\r\nprint(pointer + 1)", "n=int(input())\r\narr=list(map(int,input().split()))\r\ntotal=0\r\ni=0\r\nwhile(total<n):\r\n\ttotal+=arr[i]\r\n\tif i>=6:\r\n\t\ti=0\r\n\telse:\r\n\t\ti+=1\r\nif i==0:\r\n\tprint(7)\r\nelse:\r\n\tprint(i)", "n=int(input())\r\nday=list(map(int,input().split()))\r\nsum=0\r\ni=0\r\nwhile True:\r\n sum+=day[i]\r\n if sum>=n:\r\n break\r\n # print(sum)\r\n i=(i+8)%7\r\nprint(i+1)\r\n", "n=int(input())\r\narr=list(map(int,input().split()))\r\nc=0\r\na=0\r\nfor i in range(len(arr)):\r\n c+=arr[i]\r\n if(arr[i]>0):\r\n a=i+1\r\nk=n//c\r\nc=c*k \r\nfor i in range(len(arr)):\r\n if(c>=n):\r\n break \r\n c+=arr[i]\r\n a=i+1\r\nprint(a)", "n = int(input())\r\narr = list(map(int, input().split()))\r\nsum = 0\r\nfound = False\r\nwhile True:\r\n for i in range(7):\r\n sum += arr[i]\r\n if sum >= n:\r\n found = True\r\n break\r\n if found:\r\n break\r\nprint(i + 1)", "n=int(input())\narr=list(map(int,input().split()))\ncumsum=[arr[0]]\nfor i in range(1,7):\n cumsum.append(cumsum[i-1]+arr[i])\nlast=0\nfor i in range(7):\n if arr[i]>0:\n last=i\nr=n%cumsum[-1]\nfor i in range(7):\n if cumsum[i]>=r:\n break\nprint(int(r>0)*(i+1)+int(r==0)*(last+1))", "from time import sleep as sle\r\nfrom math import *\r\nfrom random import randint as ri\r\n \r\ndef gcd(a,b):\r\n\tif a == b:\r\n\t\treturn a\r\n\telif a > b:\r\n\t\treturn gcd(a-b,b)\r\n\telse:\r\n\t\treturn gcd(b,a)\r\n\r\ndef pr(x):\r\n\tprint()\r\n\tfor s in x:\r\n\t\tprint(s)\r\n\r\ndef solve():\r\n\tn = int(input())\r\n\ta = [int(q) for q in input().split()]\r\n\tx = 0\r\n\tdon = False\r\n\twhile not don:\r\n\t\tL = []\r\n\t\tfor i in range(len(a)):\r\n\t\t\tp = x+sum(a[:i])+1\r\n\t\t\tq = p+a[i]-1\r\n\t\t\tif p <= n <= q:\r\n\t\t\t\tprint(i+1)\r\n\t\t\t\tdon = True\r\n\t\t\t\tbreak\r\n\t\tx += sum(a)\r\n\r\nsolve()", "n = int(input())\r\na = list(map(int, input().split()))\r\nc = 0\r\ni= 0\r\nwhile n > c:\r\n if i ==7:\r\n i = 0\r\n\r\n c += a[i]\r\n i += 1\r\nprint(i)", "n=int(input())\r\n\r\na=list(map(int,input().split()))\r\n\r\ns=sum(a)\r\n\r\nflag=0\r\nind=0\r\n\r\nfor i in range(7):\r\n if(s==a[i]):\r\n flag=1\r\n ind=i\r\n break\r\n \r\nif flag==1:\r\n print(ind+1)\r\n \r\nelse:\r\n i=0\r\n l=7\r\n while(i<l):\r\n n-=a[i]\r\n if(n<=0):\r\n print(i+1)\r\n break\r\n i+=1\r\n if(i==l):\r\n i=0\r\n \r\n \r\n \r\n ", "n = int(input())\r\nlst = [int (x) for x in input().split()]\r\ns=0\r\ni=0\r\nwhile(1):\r\n s=s+lst[i]\r\n if(s>=n):\r\n print(i+1)\r\n break\r\n else:\r\n i=int((i+1)%7)", "n = int(input())\r\na = list(map(int, input().split(\" \")[:7]))\r\nx=0\r\nwhile n>0:\r\n for i in range(len(a)):\r\n n-=a[i]\r\n x+=1\r\n if n<=0:\r\n print(x)\r\n break\r\n x=0", "import math\r\n\r\npages = int(input())\r\nd = list(map(int, input().split(\" \")))\r\n\r\nval = sum(d)\r\nreps = int(pages/val)\r\nsum_val = reps*val\r\nday = 0\r\n\r\nif(sum_val==pages):\r\n max_non_zero_pos = 0\r\n for i in range(len(d)):\r\n if(d[i]!=0):\r\n max_non_zero_pos = i\r\n \r\n print(max_non_zero_pos+1)\r\n \r\nelse:\r\n for i in range(len(d)):\r\n sum_val+=d[i]\r\n day+=1\r\n if(sum_val>=pages):\r\n print(day)\r\n break", "n = int(input())\r\ninp = input().split()\r\ni = 0\r\n\r\nwhile (True):\r\n\r\n if i == 7:\r\n i = 0\r\n\r\n n = n - int(inp[i])\r\n\r\n if n <= 0:\r\n break\r\n i += 1\r\n\r\nprint(i + 1)", "a = int(input())\r\nmas=[int(s) for s in input().split()]\r\nk = sum(mas)\r\nn = a%k\r\nif n ==0:\r\n n = k\r\n for i in range(0,7):\r\n n -=mas[i]\r\n if n==0:\r\n print(i+1)\r\n break\r\nelse:\r\n for i in range(0,7):\r\n n -=mas[i]\r\n if n<=0:\r\n print(i+1)\r\n break\r\n", "n = int(input())\ndays = list(map(int, input().split()))\nn = (n - 1) % sum(days) + 1\nfor day, pages in enumerate(days, 1):\n if pages >= n:\n print(day)\n break\n n -= pages\n", "n = int(input())\r\np = list(map(int,input().split()))\r\nans = []\r\nre = 0\r\nwhile True:\r\n if n > 0:\r\n for i in range(1,8):\r\n if p[i-1] > 0 and n > 0:\r\n n -= p[i-1]\r\n re = i\r\n else:\r\n print(re)\r\n break", "n= int(input())\r\nA=list(map(int,input().split()))\r\ns=sum(A)\r\nif n//s!=0:\r\n if n%s==0:\r\n n=s \r\n else:\r\n n=n%s\r\ncnt=0\r\nwhile True:\r\n n-=A[cnt]\r\n if n<=0:\r\n print(cnt+1)\r\n break \r\n cnt+=1 ", "# Har har mahadev\r\n# author : @ harsh kanani\r\n\r\nfrom collections import deque\r\nn = int(input())\r\nl = list(map(int, input().split()))\r\ns = 0\r\ni = 0\r\nwhile n > 0:\r\n i = (i%7)+1\r\n n = n-l[i-1]\r\n #print(i)\r\nprint(i)", "n = int(input())\r\nl = list(map(int, input().split()))\r\ni = -1\r\n\r\nwhile n > 0:\r\n i += 1\r\n # print(n, l[i%7], i)\r\n n -= l[i%7]\r\n\r\nprint(i%7+1)", "n = int(input())\r\npages = list(map(int, input().split()))\r\n\r\ni = 0\r\nwhile True:\r\n n -= pages[i]\r\n if n <= 0:\r\n print(i + 1)\r\n break\r\n\r\n i += 1\r\n if i == 7:\r\n i = 0\r\n ", "\r\nx= int(input())\r\na= input().split()\r\na= [int(i) for i in a]\r\nz=0\r\nsum=0\r\nans=0\r\nwhile True:\r\n y=z%7\r\n sum+=a[y]\r\n if sum >=x:\r\n ans=y+1\r\n break\r\n z+=1\r\nprint(ans)", "n = n = int(input())\r\ndays = list(map(int, input().split()))\r\n\r\ndef days_taken(n, days):\r\n read = 0\r\n while True:\r\n for i in range(7):\r\n read += days[i]\r\n if read >= n:\r\n return i+1\r\n\r\nprint(days_taken(n, days))", "n = int(input())\narr = list(map(int, input().split()))\n\nwhile True:\n for i in range(7):\n n -= arr[i]\n if n <= 0:\n print(i+1)\n break\n else:\n continue\n break\n\n", "n=int(input())\r\ns=input().split()\r\nl=[str(i)+\" \"+s[i-1] for i in range(1,8)]\r\nq,i=0,0\r\nwhile q+int(l[i][2:])<n:\r\n q+=int(l[i][2:])\r\n if i==6:\r\n i=0\r\n else:\r\n i+=1\r\nelse:\r\n print(l[i][0])\r\n", "#problem solving base file\r\n#the following lines are reserved for imports\r\n#\r\n#\r\n#\r\n\r\n#main declaration\r\n\r\nif __name__ == '__main__':\r\n n = int(input())\r\n c = 0\r\n day = 0\r\n pages = [int(x) for x in input().split(' ')]\r\n while n > 0:\r\n n -= pages[c % 7]\r\n if n <= 0:\r\n day = c % 7\r\n c += 1\r\n\r\n print(day + 1)", "pages=int(input())\n\nn=[int(x) for x in input().split()]\ni=0\nsum=0\nwhile 1:\n sum = sum + n[i]\n if(sum>=pages):\n break\n i=i+1\n if i==7:\n i=0\n \nprint(i+1)\n \n\n\t \t \t\t \t \t\t\t \t \t" ]

[ "from sys import stdin\r\n\r\nn, m, k = [int(i) for i in input().split()]\r\ns = stdin.read().splitlines()\r\nresult = 0\r\nif k == 1:\r\n result = sum(elem.count('.') for elem in s)\r\n print(result)\r\n exit()\r\ns += map(''.join, zip(*s))\r\nfor elem in s:\r\n for i in map(len, filter(None, elem.split(\"*\"))):\r\n result += max(0, i - k + 1)\r\nprint(result)", "\r\nn, m, k= map(int,input().split())\r\nmatrix = [input() for _ in range(n)]\r\n\r\nways = 0\r\n\r\n# count adjacent horizontal seats\r\nfor row in range(n):\r\n left = 0\r\n for right in range(m):\r\n if matrix[row][right] == '*':\r\n left = right + 1\r\n elif right - left + 1 >= k:\r\n ways += 1 \r\n \r\n# count adjacent vertical seats\r\nfor col in range(m):\r\n left = 0\r\n for right in range(n):\r\n if matrix[right][col] == '*':\r\n left = right + 1\r\n elif right - left + 1 >= k:\r\n ways += 1\r\n \r\nif k == 1:\r\n ways //= 2\r\n \r\nprint(ways)", "[n, m, k] = list(map(int, input().split()))\r\narr =[]\r\ndef f (x):\r\n if x == '.':\r\n return 1\r\n return 0\r\nfor i in range(n):\r\n l = list(input())\r\n l = list(map(f, l))\r\n arr.append(l)\r\n \r\n# print(arr)\r\nans = 0\r\nfor i in range(n):\r\n temp = 0\r\n for j in range(m):\r\n if arr[i][j] :\r\n temp += 1\r\n if temp >= k :\r\n ans += 1\r\n else:\r\n temp = 0\r\nfor j in range(m):\r\n temp = 0\r\n for i in range(n):\r\n if arr[i][j] :\r\n temp += 1\r\n if temp >= k:\r\n ans += 1\r\n else:\r\n temp = 0\r\nif k == 1:\r\n print(ans//2)\r\nelse:\r\n print(ans)\r\n\r\n", "n,m,k=map(int,input().split())\ns=list()\nsl=0\nif(n==m and n==1):\n zcw=input()\n if(zcw[0]=='.' and k==1): print(1)\n else: print(0)\nelse:\n for i in range(0,n):\n zcw=input()\n s.append(zcw)\n zc=0\n for j in range(0,m):\n if(zcw[j]=='.' and j<m-1): zc+=1\n else:\n if(j==m-1 and zcw[j]=='.'): zc+=1\n sl+=max(0,zc-k+1)\n zc=0\n #print('%d---%d---%d' %(i,j,zc))\n for j in range(0,m):\n if(k==1): break\n zc=0\n for i in range(0,n):\n if(s[i][j]=='.' and i<n-1): zc+=1\n else:\n if(i==n-1 and s[i][j]=='.'): zc+=1\n sl+=max(0,zc-k+1)\n zc=0\n #print('%d---%d---%d' %(i,j,zc))\n print(sl)\n\t\t\t\t\t \t \t \t\t \t\t \t\t \t \t \t", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn, m, k = map(int, input().split())\r\ng = [input()[:-1] for _ in range(n)]\r\nx = '.'*k\r\nd = []\r\nw = list(map(lambda x: ''.join(x), zip(*g)))\r\nfor i in range(n):\r\n c = 0\r\n for j in range(m):\r\n if g[i][j] == '.':\r\n c += 1\r\n else:\r\n if c >= k:\r\n d.append(c-k+1)\r\n c = 0\r\n if c >= k:\r\n d.append(c-k+1)\r\n\r\nfor i in range(m):\r\n c = 0\r\n for j in range(n):\r\n if w[i][j] == '.':\r\n c += 1\r\n else:\r\n if c >= k:\r\n d.append(c-k+1)\r\n c = 0\r\n if c >= k:\r\n d.append(c-k+1)\r\nprint(sum(d) if k != 1 else sum(d)//2)", "n, m, k = map(int, input().split())\r\ns = [input() for _ in range(n)]\r\nif k > 1:\r\n s += [''.join(t) for t in zip(*s)]\r\n \r\nsumm = 0\r\nfor i in range(len(s)):\r\n summ += sum([len(t) - k + 1 for t in s[i].split('*') if len(t) >= k])\r\n \r\nprint(summ)", "def main():\r\n ROWS, COLS, k = map(int, input().split())\r\n \r\n seats = []\r\n for i in range(ROWS):\r\n seats.append(input())\r\n \r\n #find number of ways to arrange seats in each row \r\n num_ways = 0\r\n for row in range(ROWS):\r\n empty_slots = 0\r\n \r\n for col in range(COLS):\r\n if seats[row][col] == '.':\r\n empty_slots += 1\r\n else:\r\n empty_slots = 0\r\n \r\n if empty_slots >= k:\r\n num_ways += 1\r\n \r\n #find number of ways to arrange seats in each column\r\n for col in range(COLS):\r\n empty_slots = 0\r\n \r\n for row in range(ROWS):\r\n if seats[row][col] == '.':\r\n empty_slots += 1\r\n else:\r\n empty_slots = 0\r\n \r\n if empty_slots >= k:\r\n num_ways += 1\r\n \r\n #handle k = 1 case\r\n if k == 1:\r\n num_ways //= 2\r\n \r\n print(num_ways)\r\n \r\nmain()", "n, m, k = map(int, input().split())\r\nmat = []\r\n\r\nfor _ in range(n):\r\n mat.append(input())\r\n\r\narrange = 0\r\n\r\nfor row in mat:\r\n count = 0\r\n for seat in row:\r\n if seat == '.':\r\n count += 1\r\n if count >= k:\r\n arrange += 1\r\n else:\r\n count = 0\r\nif k > 1:\r\n for col in zip(*mat):\r\n count = 0\r\n for seat in col:\r\n if seat == '.':\r\n count += 1\r\n if count >= k:\r\n arrange += 1\r\n else:\r\n count = 0\r\n\r\nprint(arrange)" ]

[ "n, k = [int(i) for i in input().split()]\r\n\r\nmas = []\r\n\r\nfor i in range(n):\r\n mas.append([j for j in input()])\r\n#print(mas)\r\n#print(k)\r\n\r\nif k != 0:\r\n for i in range(n):\r\n for j in range(12):\r\n if mas[i][j] == '.':\r\n if j > 0 and j < 11:\r\n if mas[i][j+1] != 'S' and mas[i][j-1] != 'S':\r\n mas[i][j] = 'x'\r\n k -= 1\r\n elif j == 0:\r\n if mas[i][j+1] != 'S':\r\n mas[i][j] = 'x'\r\n k -= 1\r\n elif j == 11:\r\n if mas[i][j-1] != 'S':\r\n mas[i][j] = 'x'\r\n k -= 1\r\n if k == 0:\r\n break\r\n if k == 0:\r\n break\r\n\r\n#print(k)\r\n\r\nif k != 0:\r\n for i in range(n):\r\n for j in range(12):\r\n if mas[i][j] == '.':\r\n if j > 0 and j < 11:\r\n if (mas[i][j+1] == 'S' and mas[i][j-1] != 'S') or (mas[i][j-1] == 'S' and mas[i][j+1] != 'S'):\r\n mas[i][j] = 'x'\r\n k -= 1\r\n else:\r\n mas[i][j] = 'x'\r\n k -= 1\r\n if k == 0:\r\n break\r\n if k == 0:\r\n break\r\n\r\n#print(k)\r\n\r\nif k != 0:\r\n for i in range(n):\r\n for j in range(12):\r\n if mas[i][j] == '.':\r\n mas[i][j] = 'x'\r\n k -= 1\r\n if k == 0:\r\n break\r\n if k == 0:\r\n break\r\n#print(k)\r\nres = 0\r\nfor i in range(n):\r\n for j in range(12):\r\n if mas[i][j] == 'S':\r\n if j == 0:\r\n if mas[i][j + 1] == 'S' or mas[i][j + 1] == 'P' or mas[i][j + 1] == 'x': res += 1\r\n elif j == 11:\r\n if mas[i][j - 1] == 'S' or mas[i][j - 1] == 'P' or mas[i][j - 1] == 'x': res += 1\r\n else:\r\n if mas[i][j + 1] == 'S' or mas[i][j + 1] == 'P' or mas[i][j + 1] == 'x': res += 1\r\n if mas[i][j - 1] == 'S' or mas[i][j - 1] == 'P' or mas[i][j - 1] == 'x': res += 1\r\n\r\nprint(res)\r\nfor i in range(n):\r\n for j in mas[i]:\r\n print(j, end='')\r\n print()", "n, k = map(int, input().split())\r\nqq = []\r\nfor i in range(n):\r\n qq.append(list(input()))\r\nfor i in range(n):\r\n for j in range(12):\r\n if qq[i][j] == '.' and (j == 0 or qq[i][j - 1] != 'S') and (j == 11 or qq[i][j + 1] != 'S') and k > 0:\r\n qq[i][j] = 'x'\r\n k -= 1\r\n if k == 0:\r\n break\r\nif k > 0:\r\n for i in range(n):\r\n for j in range(12):\r\n if qq[i][j] == '.' and (j == 0 and qq[i][1] == 'S' or j == 11 and qq[i][10] == 'S' or qq[i][j - 1] == 'S' and qq[i][j + 1] != 'S' or qq[i][j - 1] != 'S' and qq[i][j + 1] == 'S') and k > 0:\r\n qq[i][j] = 'x'\r\n k -= 1\r\n if k == 0:\r\n break \r\nif k > 0:\r\n for i in range(n):\r\n for j in range(1, 11):\r\n if qq[i][j] == '.' and qq[i][j - 1] == 'S' and qq[i][j + 1] == 'S' and k > 0:\r\n qq[i][j] = 'x'\r\n k -= 1\r\ndd = 0\r\nfor i in range(n):\r\n for j in range(12):\r\n if qq[i][j] == 'S':\r\n if j > 0 and qq[i][j - 1] not in '.-':\r\n dd += 1\r\n if j < 11 and qq[i][j + 1] not in '.-':\r\n dd += 1 \r\nprint(dd)\r\nfor i in range(n):\r\n print(''.join(qq[i]))", "n, k = map(int, input().split())\r\nlines = [[ch for ch in input()]+['\\n'] for i in range(n)]\r\nqueue = [[], [], []]\r\ncount = 0\r\n\r\nfor i in range(n):\r\n for seat in range(12):\r\n if lines[i][seat]=='.':\r\n queue[(lines[i][seat-1]=='S')+(lines[i][seat+1]=='S')].append([i, seat])\r\n elif lines[i][seat]=='S':\r\n count+=(lines[i][seat-1]>'A')+(lines[i][seat+1]>'A')\r\n\r\nwhile k:\r\n if queue[0]: seat = queue[0].pop()\r\n elif queue[1]:\r\n seat = queue[1].pop()\r\n count+=1\r\n else:\r\n seat = queue[2].pop()\r\n count+=2\r\n\r\n lines[seat[0]][seat[1]] = 'x'\r\n k-=1\r\n\r\nprint(count)\r\nprint(''.join([''.join(line) for line in lines]))\r\n", "n, z = map(int, input().split())\r\ns = 0\r\na = []\r\nx = []\r\nfor j in range(n):\r\n c = list(input())\r\n x.append(c)\r\n for i in range(12):\r\n if c[i] == '.':\r\n if i == 0:\r\n if c[1] == 'S':\r\n a.append([1, (j,0)])\r\n else:\r\n a.append([0, (j,0)])\r\n elif i == 11:\r\n if c[10] == 'S':\r\n a.append([1, (j,11)])\r\n else:\r\n a.append([0, (j,11)])\r\n else:\r\n k = 0\r\n if c[i - 1] == 'S':\r\n k += 1\r\n if c[i + 1] == 'S':\r\n k += 1\r\n a.append([k, (j,i)])\r\n if c[i] == 'S':\r\n if i == 0:\r\n if c[1] not in '.-':\r\n s += 1\r\n elif i == 11:\r\n if c[10] not in '.-':\r\n s += 1\r\n else:\r\n if c[i - 1] not in '.-':\r\n s += 1\r\n if c[i + 1] not in '.-':\r\n s += 1\r\na.sort()\r\nb = []\r\nc = []\r\nfor i in range(z):\r\n b.append(a[i][0])\r\n c.append(a[i][1])\r\nfor i in range(z):\r\n x[c[i][0]][c[i][1]] = 'x'\r\nprint(s + sum(b))\r\nfor i in range(n):\r\n print(''.join(x[i]))", "s = input().split()\r\nn = int(s[0])\r\nk = int(s[1])\r\nseats = []\r\n\r\ndef _replace_sym(conf, index, char):\r\n return conf[:index] + char + conf[index+1:]\r\n\r\ndef _new_pass_1(conf):\r\n global k\r\n if (conf[0] == \".\") and (conf[1] != \"S\") and k>0:\r\n conf = _replace_sym(conf, 0, \"x\")\r\n k -= 1\r\n if (conf[len(conf)-1] == \".\") and (conf[len(conf)-2] != \"S\") and k>0:\r\n conf = _replace_sym(conf, len(conf)-1, \"x\")\r\n k -= 1\r\n for i in range(1,len(conf)-1):\r\n if conf[i] == \".\" and conf[i-1] != \"S\" and conf[i+1] != \"S\" and k > 0:\r\n conf = _replace_sym(conf, i, \"x\")\r\n k -= 1\r\n return conf\r\n\r\ndef _new_pass_2(conf):\r\n global k\r\n if (conf[0] == \".\") and k>0:\r\n conf = _replace_sym(conf, 0, \"x\")\r\n k -= 1\r\n if (conf[len(conf)-1] == \".\")and k>0:\r\n conf = _replace_sym(conf, len(conf)-1, \"x\")\r\n k -= 1\r\n for i in range(1,len(conf)-1):\r\n if conf[i] == \".\" and conf[i-1] == \"S\" and conf[i+1] != \"S\" and k > 0:\r\n conf = _replace_sym(conf, i, \"x\")\r\n k -= 1\r\n if conf[i] == \".\" and conf[i-1] != \"S\" and conf[i+1] == \"S\" and k > 0:\r\n conf = _replace_sym(conf, i, \"x\")\r\n k -= 1\r\n return conf\r\n\r\ndef _new_pass_3(conf):\r\n global k\r\n for i in range(1,len(conf)-1):\r\n if conf[i] == \".\" and k > 0:\r\n conf = _replace_sym(conf, i, \"x\")\r\n k -= 1\r\n return conf\r\n\r\ndef _check_pass(pass_list):\r\n count = 0\r\n for line in pass_list:\r\n if line[0] == \"S\" and (line[1] == \"P\" or line[1] == \"x\"\r\n or line[1] == \"S\"):\r\n count += 1\r\n if line[len(line)-1] == \"S\" and (line[len(line)-2] == \"P\"\r\n or line[len(line)-2] == \"x\" or line[len(line)-2] == \"S\"):\r\n count += 1\r\n\r\n for i in range(1, len(line)-1):\r\n if line[i] == \"S\" and (line[i-1] == \"P\" or line[i-1] == \"x\"\r\n or line[i-1] == \"S\"):\r\n count += 1\r\n if line[i] == \"S\" and (line[i+1] == \"P\" or line[i+1] == \"x\"\r\n or line[i+1] == \"S\"):\r\n count += 1\r\n return count\r\n\r\nfor i in range(n):\r\n seats.append(input().split('-'))\r\n\r\n for j in range(len(seats[i])):\r\n seats[i][j] = _new_pass_1(seats[i][j])\r\n\r\n\r\nif k > 0:\r\n for i in range(len(seats)):\r\n for j in range(len(seats[i])):\r\n seats[i][j] = _new_pass_2(seats[i][j])\r\n\r\nif k > 0:\r\n for i in range(len(seats)):\r\n for j in range(len(seats[i])):\r\n seats[i][j] = _new_pass_3(seats[i][j])\r\n\r\nfor i in range(len(seats)):\r\n seats[i] = seats[i][0] + '-' + seats[i][1] + '-' + seats[i][2]\r\n\r\ncount = _check_pass(seats)\r\n\r\nprint(count)\r\nfor i in seats:\r\n print(i)", "n,k=map(int,input().split(' '))\r\nsamolet=[]\r\nfor i in range(n):\r\n samolet.append(input())\r\n\r\ndef prioretet(samolet,n):\r\n for i in range(n):\r\n while samolet[i].count('.')!=0:\r\n place=samolet[i].find('.')\r\n number=0\r\n if place !=0:\r\n if samolet[i][place-1]=='S':\r\n number+=1\r\n if place !=11:\r\n if samolet[i][place+1]=='S':\r\n number+=1\r\n samolet[i]=samolet[i][:place]+str(number)+samolet[i][place+1:]\r\n return samolet\r\n\r\nprioretet(samolet,n)\r\nsamolet='/'.join(samolet)\r\nwhile k!=0:\r\n q=samolet.find('0')\r\n w=samolet.find('1')\r\n e=samolet.find('2')\r\n if samolet.find('0')!=-1:\r\n samolet=samolet[:q]+'x'+samolet[q+1:]\r\n k=k-1\r\n else:\r\n if samolet.find('1')!=-1:\r\n samolet=samolet[:w]+'x'+samolet[w+1:]\r\n k=k-1\r\n else:\r\n if samolet.find('2')!=-1:\r\n samolet=samolet[:e]+'x'+samolet[e+1:]\r\n k=k-1\r\nwhile samolet.find('0')!= -1:\r\n q=samolet.find('0')\r\n samolet=samolet[:q]+'.'+samolet[q+1:]\r\n\r\nwhile samolet.find('1') != -1:\r\n w=samolet.find('1')\r\n samolet=samolet[:w]+'.'+samolet[w+1:]\r\n \r\nwhile samolet.find('2') != -1:\r\n e=samolet.find('2')\r\n samolet=samolet[:e]+'.'+samolet[e+1:]\r\ny=0\r\nnumber=0\r\nfor i in range(samolet.count('S')):\r\n \r\n q=samolet.index('S',y)\r\n y=q+1\r\n if q==0:\r\n if samolet[q+1]=='P' or samolet[q+1]=='S' or samolet[q+1]=='x':\r\n number+=1\r\n elif q == len(samolet)-1:\r\n if samolet[q-1]=='P' or samolet[q-1]=='S' or samolet[q-1]=='x':\r\n number+=1\r\n else:\r\n if samolet[q+1]=='P' or samolet[q+1]=='S' or samolet[q+1]=='x':\r\n number+=1\r\n \r\n if samolet[q-1]=='P' or samolet[q-1]=='S' or samolet[q-1]=='x':\r\n number+=1\r\n \r\n\r\n\r\n\r\n\r\nprint(number)\r\nsamolet=samolet.split('/')\r\nfor i in samolet:\r\n print(i)\r\n \r\n\r\n \r\n", "#!/usr/bin/env python3\nimport bisect\nSTATUS = 'S'\nPROSTOI = 'P'\nEMPTY = '.'\nNOTHING = None\n\nstatus_neighbors = 0\n\nclass Place:\n\n def __init__(self, l, r):\n self.left_neighbor = l\n self.right_neighbor = r\n self.rich_neighbors = int(l == STATUS) + int(r == STATUS)\n self.occupied = False\n \n def place(self):\n global status_neighbors\n self.occupied = True\n status_neighbors += self.rich_neighbors\n\nn, k = list(map(int, input().strip().split(' ')))\nplaces = []\nrich_places = []\nplane_map = []\nfor _ in range(n):\n coloumn_map = []\n for coloumn in input().strip().split('-'):\n to_append = [coloumn.replace('.','{}'), []]\n for i in range(len(coloumn)):\n left, right = NOTHING, NOTHING\n if i + 1 < len(coloumn):\n right = coloumn[i+1]\n if i > 0:\n left = coloumn[i-1]\n place = Place(left, right)\n if coloumn[i] == EMPTY:\n insertion_point = bisect.bisect(rich_places, place.rich_neighbors)\n rich_places.insert(insertion_point, place.rich_neighbors)\n places.insert(insertion_point, place)\n to_append[1].append(place)\n else:\n status_neighbors += place.rich_neighbors\n coloumn_map.append(to_append)\n plane_map.append(coloumn_map)\ndel rich_places\nfor i in range(k):\n places[i].place()\nprint(status_neighbors)\nfor row in plane_map:\n print('-'.join([x[0].format(*['x' if item.occupied else '.' for item in x[1]]) for x in row]))", "n, k = map(int, input().split())\r\nmas = []\r\nfor a in range(n):\r\n s = list(input())\r\n s.insert(0, '-')\r\n s.append('-')\r\n for i in range(14):\r\n if k != 0:\r\n if s[i] == '.':\r\n if s[i - 1] != 'S' and s[i + 1] != 'S':\r\n s[i] = 'x'\r\n k -= 1\r\n if k == 0:\r\n break\r\n mas.append(s)\r\nfor a in range(n):\r\n s = mas[a]\r\n if k != 0:\r\n for i in range(14):\r\n if s[i] == '.':\r\n if s[i + 1] == 'S' and s[i - 1] in ['x', '.', 'P', '-']:\r\n s[i] = 'x'\r\n k -= 1\r\n elif s[i - 1] == 'S' and s[i + 1] in ['x', '.', 'P', '-']:\r\n s[i] = 'x'\r\n k -= 1\r\n if k == 0:\r\n break\r\n mas[a] = s\r\ncount = 0\r\nfor a in range(n):\r\n s = mas[a]\r\n if k != 0:\r\n for i in range(14):\r\n if s[i] == '.':\r\n s[i] = 'x'\r\n k -= 1\r\n if k == 0:\r\n break\r\n\r\n for i in range(14):\r\n if s[i] == 'S':\r\n if s[i + 1] in 'SxP':\r\n count += 1\r\n if s[i - 1] in 'SxP':\r\n count += 1\r\n mas[a] = ''.join(s)[1:-1]\r\n\r\nprint(count)\r\nprint('\\n'.join(mas))", "def main():\r\n n, k = map(int, input().split())\r\n lines = list()\r\n m = [0, 0, 0]\r\n v = 0\r\n for i in range(n):\r\n lines.append(input() + ' ')\r\n for j in range(12):\r\n if lines[i][j] == '.':\r\n c = 0\r\n if lines[i][j - 1] == 'S':\r\n c += 1\r\n if lines[i][j + 1] == 'S':\r\n c += 1\r\n m[c] += 1\r\n elif lines[i][j] == 'S':\r\n if lines[i][j - 1] == 'S' or lines[i][j - 1] == 'P':\r\n v += 1\r\n if lines[i][j + 1] == 'S' or lines[i][j + 1] == 'P':\r\n v += 1\r\n m[0] = min(m[0], k)\r\n k -= m[0]\r\n m[1] = min(m[1], k)\r\n k -= m[1]\r\n m[2] = min(m[2], k)\r\n v += m[1] + 2 * m[2]\r\n print(v)\r\n for elem in lines:\r\n for j in range(12):\r\n if elem[j] == '.':\r\n c = 0\r\n if elem[j - 1] == 'S':\r\n c += 1\r\n if elem[j + 1] == 'S':\r\n c += 1\r\n if m[c] > 0:\r\n print('x', end='')\r\n m[c] -= 1\r\n else:\r\n print('.', end='')\r\n else:\r\n print(elem[j], end='')\r\n print()\r\n\r\nmain()", "n, k = [int(i) for i in input().split()]\nrows = ['P' + input() + 'P' for i in range(n)]\n\ndef try_good(rows):\n\tfor j in range(len(rows)):\n\t\tfor i in range(1, len(rows[j]) - 1):\n\t\t\tif rows[j][i] == '.':\n\t\t\t\tif rows[j][i - 1] != 'S' and rows[j][i + 1] != 'S':\n\t\t\t\t\trows[j] = rows[j][:i] + 'x' + rows[j][i + 1:]\n\t\t\t\t\treturn True\n\treturn False\n\ndef try_medium(rows):\n\tfor j in range(len(rows)):\n\t\tfor i in range(1, len(rows[j]) - 1):\n\t\t\tif rows[j][i] == '.':\n\t\t\t\tif rows[j][i - 1] != 'S' or rows[j][i + 1] != 'S':\n\t\t\t\t\trows[j] = rows[j][:i] + 'x' + rows[j][i + 1:]\n\t\t\t\t\treturn True\n\treturn False\n\ndef try_bad(rows):\n\tfor j in range(len(rows)):\n\t\tfor i in range(1, len(rows[j]) - 1):\n\t\t\tif rows[j][i] == '.':\n\t\t\t\trows[j] = rows[j][:i] + 'x' + rows[j][i + 1:]\n\t\t\t\treturn True\n\treturn False\n\nfor i in range(k):\n\tif try_good(rows) == True:\n\t\tcontinue\n\tif try_medium(rows) == True:\n\t\tcontinue\n\ttry_bad(rows)\n\nans = 0\nfor r in rows:\n\tfor i in range(len(r)):\n\t\tif r[i] == 'S':\n\t\t\tif i > 1 and r[i - 1] != '.' and r[i - 1] != '-':\n\t\t\t\tans += 1\n\t\t\tif i < len(r) - 2 and r[i + 1] != '.' and r[i + 1] != '-':\n\t\t\t\tans += 1\n\nprint(ans)\nfor r in rows:\n\tprint(r[1:-1])\t\n", "def insertp():\r\n x,y = 0,0\r\n min = 3\r\n for i in range(n):\r\n for j in range(12):\r\n if a[i][j] == '.':\r\n if j != 0 and j != 11:\r\n if a[i][j-1] != 'S':\r\n if a[i][j+1] != 'S':\r\n a[i][j] = 'x'\r\n return 0\r\n else:\r\n if min > 1:\r\n min = 1\r\n x, y = i, j\r\n else:\r\n if a[i][j+1] != 'S':\r\n if min > 1:\r\n min = 1\r\n x, y = i, j\r\n else:\r\n if min > 2:\r\n min = 2\r\n x,y = i, j\r\n elif j == 0:\r\n if a[i][j+1] != 'S':\r\n a[i][j] = 'x'\r\n return 0\r\n else:\r\n if min > 1:\r\n min = 1\r\n x, y = i, j\r\n else:\r\n if a[i][j-1] != 'S':\r\n a[i][j] = 'x'\r\n return 0\r\n else:\r\n if min > 1:\r\n min = 1\r\n x, y = i, j\r\n a[x][y] = 'x'\r\n return min\r\n\r\nn, k = map(int, input().split())\r\na = [list(input()) for i in range(n)]\r\nans = 0\r\n\r\nfor i in range(n):\r\n for j in range(12):\r\n if a[i][j] == 'S':\r\n if j != 0 and j != 11:\r\n if a[i][j-1] == 'P' or a[i][j-1] == 'S':\r\n ans += 1\r\n if a[i][j+1] == 'P' or a[i][j+1] == 'S':\r\n ans += 1\r\n elif j == 0:\r\n if a[i][j+1] == 'P' or a[i][j+1] == 'S':\r\n ans += 1\r\n else:\r\n if a[i][j-1] == 'P' or a[i][j-1] == 'S':\r\n ans += 1\r\n \r\nfor i in range(k):\r\n ans += insertp()\r\n\r\nprint(ans)\r\nfor i in range(n):\r\n for j in range(12):\r\n print(a[i][j], end = '')\r\n print()\r\n", "a = input().split()\r\nn, k = int(a[0]), int(a[1])\r\nzero = []\r\none = []\r\ntwo = []\r\nplain = []\r\nneighbours = 0\r\nnotS = ['P', '-', '.']\r\nfor i in range(n):\r\n row = input()\r\n plain.append(list(row))\r\n for e in range(len(row)):\r\n if row[e] == '.':\r\n if e == 0:\r\n if row[e + 1] in notS:\r\n zero.append((i, e))\r\n elif row[e + 1] == 'S':\r\n one.append((i, e))\r\n else:\r\n if e != len(row) - 1:\r\n if row[e + 1] in notS and row[e - 1] in notS:\r\n zero.append((i, e))\r\n elif (row[e + 1] in notS and row[e - 1] not in notS) or (row[e - 1] in notS and row[e + 1] not in notS):\r\n one.append((i, e))\r\n else:\r\n two.append((i, e))\r\n else:\r\n if row[e - 1] in notS:\r\n zero.append((i, e))\r\n else:\r\n one.append((i, e))\r\n elif row[e] == 'P':\r\n if e == 0:\r\n if row[e + 1] == 'S':\r\n neighbours += 1\r\n else:\r\n if e == len(row) - 1:\r\n if row[e - 1] == 'S':\r\n neighbours += 1\r\n else:\r\n if row[e - 1] == 'S':\r\n neighbours += 1\r\n if row[e + 1] == 'S':\r\n neighbours += 1\r\n elif row[e] == 'S':\r\n if e == 0:\r\n if row[e + 1] == 'S':\r\n neighbours += 1\r\n else:\r\n if e == len(row) - 1:\r\n if row[e - 1] == 'S':\r\n neighbours += 1\r\n else:\r\n if row[e - 1] == 'S':\r\n neighbours += 1\r\n if row[e + 1] == 'S':\r\n neighbours += 1\r\nfor i in range(len(zero)):\r\n if k != 0:\r\n k -= 1\r\n plain[zero[i][0]][zero[i][1]] = 'x'\r\n else:\r\n break\r\nif k != 0:\r\n for i in range(len(one)):\r\n if k != 0:\r\n k -= 1\r\n plain[one[i][0]][one[i][1]] = 'x'\r\n neighbours += 1\r\n else:\r\n break\r\n if k != 0:\r\n for i in range(len(two)):\r\n if k != 0:\r\n k -= 1\r\n plain[two[i][0]][two[i][1]] = 'x'\r\n neighbours += 2\r\n else:\r\n break\r\nprint(neighbours)\r\nfor i in range(n):\r\n print(''.join(plain[i]))\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "global busy, VIP\r\nbusy = ['S','P','x']\r\nVIP = ['S']\r\n\r\ndef neighbor (A,n):\r\n neigh=0\r\n for i in range(n):\r\n for j in range(len(A[i])):\r\n if(A[i][j] == 'S'):\r\n if(j!=0):\r\n if(A[i][j-1] in busy):\r\n neigh = neigh + 1\r\n if(j!= len(A[i])-1):\r\n if(A[i][j+1] in busy):\r\n neigh = neigh + 1\r\n\r\n return(neigh)\r\n\r\n\r\n\r\n[n,k] = input().split()\r\nn = int(n)\r\nk = int(k)\r\n\r\n\r\nA = []\r\nfor i in range(n):\r\n A.append(input())\r\n\r\n\r\n#k=9\r\n#A = ['SP.-SS.S-S.S']\r\n#A = ['PP.-PPPS-S.S', 'PSP-PPSP-.S.', '.S.-S..P-SS.' ,'P.S-P.PP-PSP']\r\n#n = len(A)\r\n\r\nfirst = []\r\nsecond = []\r\nthird =[]\r\n\r\nfor i in range(n):\r\n for j in range(len(A[i])):\r\n if(A[i][j] == '.'):\r\n if (j != 0 and (j != len(A[i])-1)):\r\n if (A[i][j-1] not in VIP and A[i][j+1] not in VIP):\r\n first.append([i,j])\r\n elif ((A[i][j-1] not in VIP and A[i][j+1] in VIP) or (A[i][j-1] in VIP and A[i][j+1] not in VIP)):\r\n second.append([i,j])\r\n else:\r\n third.append([i,j])\r\n elif (j == 0):\r\n if (A[i][j + 1] not in VIP):\r\n first.append([i, j])\r\n else:\r\n second.append([i, j])\r\n elif (j == len(A[i])-1):\r\n if(A[i][j - 1] not in VIP):\r\n first.append([i, j])\r\n else:\r\n second.append([i, j])\r\n\r\n\r\n\r\nf=len(first)\r\ns=len(second)\r\nt=len(third)\r\n\r\n\r\nA_copy = []\r\nA_copy_display = []\r\nfor i in range(n):\r\n A_copy.append([])\r\n A_copy_display.append([])\r\n for j in range(len(A[i])):\r\n A_copy[i].append([])\r\n\r\n\r\n\r\nfor i in range(len(first)):\r\n if(k>0):\r\n A_copy[first[i][0]][first[i][1]] = 'x'\r\n k-=1\r\n\r\nfor i in range(len(second)):\r\n if(k>0):\r\n A_copy[second[i][0]][second[i][1]] = 'x'\r\n k-=1\r\n\r\nfor i in range(len(third)):\r\n if(k>0):\r\n A_copy[third[i][0]][third[i][1]] = 'x'\r\n k-=1\r\n\r\nfor i in range(n):\r\n for j in range(len(A_copy[i])):\r\n if(A_copy[i][j]!='x'):\r\n A_copy[i][j]=A[i][j]\r\n\r\n\r\n#print('f= ' + str(f))\r\n#print('s= ' + str(s))\r\n#print('t= ' + str(t))\r\n\r\n\r\nprint(neighbor(A_copy, n))\r\nfor i in range(n):\r\n A_copy_display[i] = ''.join(A_copy[i])\r\n print(A_copy_display[i])\r\n\r\n\r\n#print(first)\r\n#print(second)\r\n#print(third)", "#!/usr/bin/python\n# -*- coding: UTF-8 -*-\n\nn, k = list(map(int, input().split()))\nrows = []\n\ndef isForS(r, n):\n if (n < 0) or (n >= len(r)):\n return False\n return (r[n] != '.')\n\ndef isForD(r, n):\n if (n < 0) or (n >= len(r)):\n return True\n return (r[n] != 'S')\n\ndef isFor1S(r, n):\n if (n < 0) or (n >= len(r)):\n return False\n return (r[n] == 'S')\n\ndef countPlaces(row):\n count = 0\n for r in row:\n for pi in range(len(r)):\n if r[pi] == 'S' and isForS(r, pi-1):\n count += 1\n if r[pi] == 'S' and isForS(r, pi+1):\n count += 1\n return count\n\nbest = []\ngood = []\nbad = []\n\nfor i in range(n):\n rows.append(input().split('-'))\n for ri in range(len(rows[i])):\n r = rows[i][ri]\n for pi in range(len(r)):\n if r[pi] == '.' and isForD(r, pi-1) and isForD(r, pi+1):\n best.append([i, ri, pi])\n continue\n if r[pi] == '.' and (isFor1S(r, pi-1) ^ isFor1S(r, pi+1)):\n good.append([i, ri, pi])\n continue\n if r[pi] == '.':\n bad.append([i, ri, pi])\n\ncount = 0\nfor i in range(n):\n count += countPlaces(rows[i])\n\nfor i in range(len(best)):\n if k == 0:\n break\n k -= 1\n r = best[i][0]\n ri = best[i][1]\n pi = best[i][2]\n rows[r][ri] = rows[r][ri][:pi] + 'x' + rows[r][ri][pi+1:]\n\nfor i in range(len(good)):\n if k == 0:\n break\n k -= 1\n count += 1\n r = good[i][0]\n ri = good[i][1]\n pi = good[i][2]\n rows[r][ri] = rows[r][ri][:pi] + 'x' + rows[r][ri][pi+1:]\n\nfor i in range(len(bad)):\n if k == 0:\n break\n k -= 1\n count += 2\n r = bad[i][0]\n ri = bad[i][1]\n pi = bad[i][2]\n rows[r][ri] = rows[r][ri][:pi] + 'x' + rows[r][ri][pi+1:]\n\nprint(count)\nfor row in rows:\n print('-'.join(row))\n", "salon = input().split()\r\nn = int(salon[0])\r\nk = int(salon[1])\r\nmp = [0, 0]\r\nm = 0\r\na = [0,0]\r\nemp = [[],[]]\r\nsalon = []\r\n#emp.append([])\r\n#emp.append([])\r\nsum = 0\r\nfor i in range(0, n):\r\n salon.append(list(input()))\r\n #print(salon[i])\r\n for j in range(0, 12):\r\n #print(salon[i], j)\r\n if salon[i][j] == '.' and k > 0:\r\n if (j > 0 and salon[i][j-1] == 'S'):\r\n m += 1\r\n if (j < 11 and salon[i][j+1] == 'S'):\r\n m += 1\r\n if m == 0:\r\n salon[i][j] = 'x'\r\n k -= 1;\r\n #print(0, i, j)\r\n else:\r\n #print(m, i, j)\r\n a[0] = i\r\n a[1] = j\r\n # print(a, emp)\r\n emp[m-1] += [list(a)]\r\n mp[m-1] += 1\r\n if salon[i][j] == 'S':\r\n if j > 0 and (salon[i][j-1] == 'P' or salon[i][j-1] == 'S'):\r\n m += 1\r\n if j < 11 and (salon[i][j+1] == 'P' or salon[i][j+1] == 'S'):\r\n m += 1\r\n sum += m\r\n m = 0\r\n#print (emp)\r\nwhile k > 0 and mp[0] > 0:\r\n sum += 1\r\n salon[emp[0][mp[0]-1][0]][emp[0][mp[0]-1][1]] = 'x'\r\n #print(k, mp[0], 1, emp[0][mp[0]-1][0],emp[0][mp[0]-1][1] )\r\n k -= 1\r\n mp[0] -= 1\r\nwhile k > 0 and mp[1] > 0:\r\n sum += 2\r\n salon[emp[1][mp[1]-1][0]][emp[1][mp[1]-1][1]] = 'x'\r\n #print(k, mp[1], 2)\r\n k -= 1\r\n mp[1] -= 1\r\nprint(sum)\r\nfor i in range (0,n): print(''.join(salon[i]), sep = '')\r\n\r\n \r\n ", "n, k = map(int, input().split())\r\n\r\nplane = [[list(x) for x in input().split('-')] for _ in range(n)]\r\n\r\ndef get(part, pos):\r\n if pos < 0 or pos >= len(part):\r\n return 0\r\n return part[pos] == 'S'\r\n \r\ndef check(part, pos):\r\n if pos < 0 or pos >= len(part) or part[pos] == '.':\r\n return 0\r\n return 1\r\n\r\ndef fill(m):\r\n global k\r\n for row in range(n):\r\n for part in plane[row]:\r\n for i in range(len(part)):\r\n if part[i] == '.' and get(part, i-1)+get(part, i+1) <= m and k > 0:\r\n k -= 1\r\n part[i] = 'x'\r\n \r\n\r\nfor i in range(3):\r\n for _ in range(3):\r\n fill(i)\r\n \r\ncnt = 0\r\nfor row in plane:\r\n for part in row:\r\n #print(part)\r\n for pos in range(len(part)):\r\n if part[pos] == 'S':\r\n cnt += check(part, pos-1)+check(part, pos+1)\r\n\r\nprint(cnt)\r\n\r\nfor row in plane:\r\n print('-'.join(map(lambda x: ''.join(x), row)))", "n, k = list(map(int, input().split()))\r\n\r\ncount = 0\r\nmaycounts = [[] for i in range(3)]\r\nmemory = []\r\nfor j in range(n):\r\n\tr = list(input())\r\n\tmemory.append(r)\r\n\tfor i in range(12):\r\n\t\tcur = r[i]\r\n\t\tif cur=='-': continue\r\n\t\tif i==0:\r\n\t\t\tprev = '-'\r\n\t\telse:\r\n\t\t\tprev = r[i-1]\r\n\t\ttry:\r\n\t\t\tnxt = r[i+1]\r\n\t\texcept IndexError: \r\n\t\t\tnxt = '-'\r\n\r\n\r\n\t\tif cur=='.':\r\n\t\t\tmaycounts[(prev=='S')+(nxt=='S')].append([j, i])\r\n\t\telif cur=='S':\r\n\t\t\tcount+=prev.isalpha()+nxt.isalpha()\r\n\r\nfor i in range(3):\r\n\tc = min(k, len(maycounts[i]))\r\n\tk-=c;\r\n\tcount += c*i;\r\n\tfor j in range(c):\r\n\t\treplace = maycounts[i][j]\r\n\t\tmemory[replace[0]][replace[1]] = 'x'\r\n\tif k==0: \r\n\t\tbreak\r\nprint(count)\r\nfor r in memory:\r\n\tfor p in r:\r\n\t\tprint(p, end='')\r\n\tprint()", "n, k = map(int, input().split())\r\na = [0] * n\r\ncnt = [0] * 3\r\nans = 0\r\nfor i in range(n):\r\n\ta[i] = list(input()) + [0]\r\n\tfor j in range(12):\r\n\t\tif a[i][j] == '.':\r\n\t\t\ta[i][j] = 0\r\n\t\t\tif a[i][j - 1] == 'S':\r\n\t\t\t\ta[i][j] += 1\r\n\t\t\tif a[i][j + 1] == 'S':\r\n\t\t\t\ta[i][j] += 1\r\n\t\t\tcnt[a[i][j]] += 1\r\n\t\telif a[i][j] == 'S':\r\n\t\t\tif a[i][j - 1] == 'P' or a[i][j - 1] == 'S':\r\n\t\t\t\tans += 1\r\n\t\t\tif a[i][j + 1] == 'P' or a[i][j + 1] == 'S':\r\n\t\t\t\tans += 1\r\nfor i in range(3):\r\n\tc = min(cnt[i], k)\r\n\tk -= c\r\n\tans += i * c\r\n\tcnt[i] = c\r\nprint(ans)\r\nfor i in range(n):\r\n\tfor j in range(12):\r\n\t\tif type(a[i][j]) == int:\r\n\t\t\tif cnt[a[i][j]] > 0:\r\n\t\t\t\tcnt[a[i][j]] -= 1\r\n\t\t\t\ta[i][j] = 'x'\r\n\t\t\telse:\r\n\t\t\t\ta[i][j] = '.'\r\n\tprint(''.join(a[i][:-1]))", "inp = input()\r\nr = inp.split(' ')\r\nn = r[0]\r\nk = int(r[1])\r\n\r\nseats = []\r\n\r\nnums = [0, 0, 0]\r\ncoords = [list(), list(), list()]\r\nnum_neighboor = 0\r\nfor i in range(0, int(n)):\r\n inp = input()\r\n tmp = list(inp)\r\n seats.append(tmp)\r\n\r\n for j in range(0, 12):\r\n if seats[i][j] == '.':\r\n tmp_indef = 0\r\n if j != 0 and j != 11:\r\n if seats[i][j - 1] == 'S':\r\n tmp_indef += 1\r\n if seats[i][j + 1] == 'S':\r\n tmp_indef += 1\r\n elif j == 0:\r\n if seats[i][1] == 'S':\r\n tmp_indef += 1\r\n else:\r\n if seats[i][10] == 'S':\r\n tmp_indef += 1\r\n nums[tmp_indef] += 1\r\n coords[tmp_indef].append([i, j])\r\n elif seats[i][j] == 'S':\r\n if j != 0 and j != 11:\r\n if seats[i][j - 1] != '-' and seats[i][j - 1] != '.':\r\n num_neighboor += 1\r\n if seats[i][j + 1] != '-' and seats[i][j + 1] != '.':\r\n num_neighboor += 1\r\n elif j == 0:\r\n if seats[i][1] != '-' and seats[i][1] != '.':\r\n num_neighboor += 1\r\n else:\r\n if seats[i][10] != '-' and seats[i][10] != '.':\r\n num_neighboor += 1\r\n\r\ner = False\r\nwhile int(k) > 0:\r\n if int(nums[0]) > 0:\r\n last_ind = len(coords[0]) - 1\r\n seats[int(coords[0][last_ind][0])][int(coords[0][last_ind][1])] = 'x'\r\n coords[0].pop()\r\n nums[0] -= 1\r\n k -= 1\r\n elif int(nums[1]) > 0:\r\n last_ind = len(coords[1]) - 1\r\n seats[int(coords[1][last_ind][0])][int(coords[1][last_ind][1])] = 'x'\r\n coords[1].pop()\r\n nums[1] -= 1\r\n k -= 1\r\n num_neighboor += 1\r\n elif int(nums[2]) > 0:\r\n last_ind = len(coords[2]) - 1\r\n seats[int(coords[2][last_ind][0])][int(coords[2][last_ind][1])] = 'x'\r\n coords[2].pop()\r\n nums[2] -= 1\r\n k -= 1\r\n num_neighboor += 2\r\n else:\r\n er = True\r\n break\r\n\r\nif er:\r\n print(-1)\r\nelse:\r\n print(num_neighboor)\r\n for i in range(0, int(n)):\r\n print(''.join(seats[i]))\r\n", "n, k = map(int, input().split())\r\nseats, m = [], 0\r\nz, o, t = [], [], []\r\nA = ['P', 'S', 'x']\r\n\r\nfor _ in range(n):\r\n seats.append(list(input()))\r\n\r\nfor i in range(n):\r\n for j in range(12):\r\n if seats[i][j] == '.':\r\n l = 0\r\n if j > 0:\r\n if seats[i][j - 1] == 'S':\r\n l += 1\r\n if j < 11:\r\n if seats[i][j + 1] == 'S':\r\n l += 1\r\n if l == 0:\r\n z.append((i, j))\r\n\r\n elif l == 1:\r\n o.append((i, j))\r\n else:\r\n t.append((i, j))\r\n if len(z) >= k:\r\n break\r\n\r\nwhile k and z:\r\n k -= 1\r\n i, j = z.pop()\r\n seats[i][j] = 'x'\r\n\r\nwhile k and o:\r\n k -= 1\r\n i, j = o.pop()\r\n seats[i][j] = 'x'\r\n\r\nwhile k and t:\r\n k -= 1\r\n i, j = t.pop()\r\n seats[i][j] = 'x'\r\n\r\n\r\nfor i in range(n):\r\n for j in range(12):\r\n if seats[i][j] == 'S':\r\n if j > 0:\r\n if seats[i][j - 1] in A:\r\n m += 1\r\n if j < 11:\r\n if seats[i][j + 1] in A:\r\n m += 1\r\n\r\nprint(m)\r\nfor s in seats:\r\n print(''.join(s))\r\n", "n, k = map(int, input().split())\r\nplaces = [list(input()) for i in range(n)]\r\ncount = 0\r\n# searching for the 0 neighbors places\r\nfor i in range(n):\r\n for j in range(12):\r\n if count == k:\r\n break\r\n elif j == 0:\r\n if places[i][j] == '.' and places[i][j+1] != 'S':\r\n places[i][j] = 'x'\r\n count = count + 1\r\n elif j == 11:\r\n if places[i][j] == '.' and places[i][j-1] != 'S':\r\n places[i][j] = 'x'\r\n count = count + 1\r\n else:\r\n if places[i][j] == '.' and places[i][j-1] != 'S' and places[i][j+1] != 'S':\r\n places[i][j] = 'x'\r\n count = count + 1\r\n if count == k:\r\n break\r\n# searching for the 1 neighbor places\r\nif count < k:\r\n for i in range(n):\r\n for j in range(12):\r\n if count == k:\r\n break\r\n elif j == 0:\r\n if places[i][j] == '.' and places[i][j+1] == 'S':\r\n places[i][j] = 'x'\r\n count = count + 1\r\n elif j == 11:\r\n if places[i][j] == '.' and places[i][j-1] == 'S':\r\n places[i][j] = 'x'\r\n count = count + 1\r\n else:\r\n if places[i][j] == '.' and ((places[i][j-1] == 'S') != (places[i][j+1] == 'S')):\r\n places[i][j] = 'x'\r\n count = count + 1\r\n if count == k:\r\n break\r\n# searching for the 2 neighbor places\r\nif count < k:\r\n for i in range(n):\r\n for j in range(12):\r\n if count == k:\r\n break\r\n else:\r\n if places[i][j] == '.' and places[i][j-1] == 'S' and places[i][j+1] == 'S':\r\n places[i][j] = 'x'\r\n count = count + 1\r\n if count == k:\r\n break\r\ncount = 0\r\nfor i in range(n):\r\n for j in range(12):\r\n if places[i][j] == 'S':\r\n if j == 0 and (places[i][j+1] == 'P' or places[i][j+1] == 'x' or places[i][j+1] == 'S'):\r\n count = count + 1\r\n elif j == 11 and (places[i][j-1] == 'P' or places[i][j-1] == 'x' or places[i][j-1] == 'S'):\r\n count = count + 1\r\n elif j != 0 and j != 11:\r\n if (places[i][j-1] == 'P' or places[i][j-1] == 'x' or places[i][j-1] == 'S') != \\\r\n (places[i][j+1] == 'P' or places[i][j+1] == 'x' or places[i][j+1] == 'S'):\r\n count = count + 1\r\n elif (places[i][j-1] == 'P' or places[i][j-1] == 'x' or places[i][j-1] == 'S') and \\\r\n (places[i][j+1] == 'P' or places[i][j+1] == 'x' or places[i][j+1] == 'S'):\r\n count = count + 2\r\nprint(count)\r\nfor row in places:\r\n print(''.join(row))\r\n\r\n\r\n\r\n", "\"\"\"\nООО \"Чистый код\"\n\"\"\"\n\n# in\nn, k = map(int, input().split())\n\n# create good array\n\ndef first(line):\n\tnew_line = ''\n\tif line[0] == '.':\n\t\tif line[1] == 'S':\n\t\t\tnew_line += '1'\n\t\telse:\n\t\t\tnew_line += '0'\n\telse:\n\t\tnew_line += line[0]\n\treturn new_line\n\ndef body(line):\n\tnew_line = ''\n\tfor i in range(1, len(line) - 1):\n\t\tif line[i] == '.':\n\t\t\tif line[i-1] != 'S' and line[i+1] != 'S':\n\t\t\t\tnew_line += '0'\n\t\t\telif line[i-1] == 'S' and line[i+1] != 'S' or line[i-1] != 'S' and line[i+1] == 'S':\n\t\t\t\tnew_line += '1'\n\t\t\telse:\n\t\t\t\tnew_line += '2'\n\t\telse:\n\t\t\tnew_line += line[i]\n\treturn new_line\n\ndef last(line):\n\tnew_line = ''\n\tif line[11] == '.':\n\t\tif line[10] == 'S':\n\t\t\tnew_line += '1'\n\t\telse:\n\t\t\tnew_line += '0'\n\telse:\n\t\tnew_line += line[11]\n\treturn new_line\n\nmas = []\nfor i in range(n):\n\tline = input()\n\tmas.append(first(line) + body(line) + last(line))\n\n# filling array with 'P'\n\nfor line in range(len(mas)):\n\tnew_line = ''\n\tfor i in mas[line]:\n\t\tif i == '0' and k > 0:\n\t\t\tnew_line += 'x'\n\t\t\tk -= 1\n\t\telse:\n\t\t\tnew_line += i\n\tmas[line] = new_line\n\nfor line in range(len(mas)):\n\tnew_line = ''\n\tfor i in mas[line]:\n\t\tif i == '1' and k > 0:\n\t\t\tnew_line += 'x'\n\t\t\tk -= 1\n\t\telse:\n\t\t\tnew_line += i\n\tmas[line] = new_line\n\nfor line in range(len(mas)):\n\tnew_line = ''\n\tfor i in mas[line]:\n\t\tif i == '2' and k > 0:\n\t\t\tnew_line += 'x'\n\t\t\tk -= 1\n\t\telse:\n\t\t\tnew_line += i\n\tmas[line] = new_line\n\n# replace 0, 1, 2\n\nfor line in range(len(mas)):\n\tmas[line] = mas[line].replace('0', '.')\n\tmas[line] = mas[line].replace('1', '.')\n\tmas[line] = mas[line].replace('2', '.')\n\n# calculate answer\n\ndef check(line):\n\tret = 0\n\tif line[0] == 'S' and line[1] != '.':\n\t\tret += 1\n\tif line[11] == 'S' and line[10] != '.':\n\t\tret += 1\n\tfor i in range(1, len(line) - 1):\n\t\tif line[i] == 'S' and (line[i-1] == 'P' or line[i-1] == 'S' or line[i-1] == 'x'):\n\t\t\tret += 1\n\t\tif line[i] == 'S' and (line[i+1] == 'S' or line[i+1] == 'P' or line[i+1] == 'x'):\n\t\t\tret += 1\n\treturn ret\n\nanswer = 0\nfor line in mas:\n\tanswer += check(line)\n\n# print\n\nprint(answer)\nfor line in mas:\n\tprint(line)", "def count_neighbor(seats):\r\n count = 0\r\n passenger = ['P', 'x']\r\n for i in range(len(seats) - 1):\r\n if seats[i] == 'S' and seats[i+1] == 'S':\r\n count += 2\r\n if seats[i] == 'S' and seats[i+1] in passenger:\r\n count += 1\r\n if seats[i] in passenger and seats[i+1] == 'S':\r\n count += 1\r\n return count\r\n \r\ndef delta_neighbor(i):\r\n minimum = 100\r\n if '.' in plane[i]:\r\n old_neighbor = count_neighbor(plane[i])\r\n for j in range(len(plane[i])):\r\n if plane[i][j] == '.':\r\n temp_seat = plane[i]\r\n temp_seat = temp_seat[:j]+'P'+temp_seat[j+1:]\r\n temp_delta = count_neighbor(temp_seat) - old_neighbor\r\n if minimum > temp_delta:\r\n minimum = temp_delta\r\n min_pos[i] = j\r\n return minimum\r\n\r\nn, k = [int(i) for i in input().split()]\r\nplane = []\r\nfor i in range(n):\r\n for j in input().split('-'):\r\n plane.append(j)\r\n\r\nmin_neighbors = [100] * len(plane)\r\nmin_pos = [0] * len(plane)\r\nfor i in range(len(plane)):\r\n min_neighbors[i] = delta_neighbor(i) \r\n\r\nfor i in range(k):\r\n minimum = min_neighbors.index(min(min_neighbors))\r\n temp = plane[minimum]\r\n plane[minimum] = temp[:min_pos[minimum]] + 'x' + temp[min_pos[minimum]+1:]\r\n min_neighbors[minimum] = delta_neighbor(minimum)\r\n\r\ncount = 0\r\nfor i in plane:\r\n count += count_neighbor(i)\r\nprint(count)\r\nfor i in range(0, 3*n, 3):\r\n print(plane[i] + '-' + plane[i + 1] + '-' + plane[i + 2])", "n, k = map(int, input().split())\r\npasse = [input().replace('.', '0') for i in range(n)]\r\n\r\nfor i in range(n):\r\n for j in range(12):\r\n if passe[i][j] == '0':\r\n if (j - 1 >= 0) and (passe[i][j - 1] == 'S'):\r\n passe[i] = passe[i][:j] + str(int(passe[i][j]) + 1) + passe[i][j + 1:]\r\n if (j + 1 <= 11) and (passe[i][j + 1] == 'S'):\r\n passe[i] = passe[i][:j] + str(int(passe[i][j]) + 1) + passe[i][j + 1:]\r\n\r\ncount = 0\r\n\r\nfor p in range(3):\r\n for i in range(n):\r\n for j in range(12):\r\n if passe[i][j] == str(p) and count < k:\r\n passe[i] = passe[i][:j] + 'x' + passe[i][j + 1:]\r\n count += 1\r\ncount = 0\r\n\r\npasse = [passe[i].replace('1', '.').replace('2', '.').replace('0', '.') for i in range(n)]\r\n\r\nfor i in range(n):\r\n for j in range(12):\r\n if passe[i][j] == 'S':\r\n if j - 1 >= 0:\r\n if passe[i][j - 1] not in '.-': count += 1\r\n if j + 1 <= 11:\r\n if passe[i][j + 1] not in '.-': count += 1\r\n\r\nprint(count)\r\n[print(passe[i]) for i in range(n)]", "n, k = map(int, input().split())\nplain = list()\n\nfor i in range(n):\n plain.append(list(input()))\n\nfr = {\n \"0\": list(),\n \"1\": list(),\n \"2\": list(),\n}\nfor i in range(n):\n for j in range(12):\n if plain[i][j] != \".\":\n continue\n\n st = 0\n if j > 0 and plain[i][j - 1] == \"S\":\n st += 1\n if j < 11 and plain[i][j + 1] == \"S\":\n st += 1\n\n fr[str(st)].append((i, j))\n\nfor i in range(k):\n if len(fr[\"0\"]):\n x, y = fr[\"0\"].pop()\n elif len(fr[\"1\"]):\n x, y = fr[\"1\"].pop()\n else:\n x, y = fr[\"2\"].pop()\n plain[x][y] = \"x\"\n\n\nresult = 0\nfor i in range(n):\n for j in range(12):\n if plain[i][j] != \"S\":\n continue\n if j > 0 and plain[i][j - 1] in (\"S\", \"x\", \"P\"):\n result += 1\n if j < 11 and plain[i][j + 1] in (\"S\", \"x\", \"P\"):\n result += 1\n\nprint(result)\nfor i in range(n):\n print(\"\".join(plain[i]))\n", "import operator\r\n\r\nn, k = [int(i) for i in input().split()]\r\n\r\ns = []\r\n\r\nfor i in range(n):\r\n\ts.append(input())\r\n\r\nbefore = 0\r\ndeltas = []\r\n\r\nfor i in range(n):\r\n\tfor j in range(12):\r\n\t\tif s[i][j] == 'S':\r\n\t\t\tif j != 11:\r\n\t\t\t\tif (s[i][j + 1] == 'S' or s[i][j + 1] == 'P'):\r\n\t\t\t\t\tbefore += 1\r\n\t\t\tif j != 0:\r\n\t\t\t\tif (s[i][j - 1] == 'S' or s[i][j - 1] == 'P'):\r\n\t\t\t\t\tbefore += 1\r\n\t\telif s[i][j] == '.':\r\n\t\t\tdelta = 0\r\n\t\t\tif j != 11:\r\n\t\t\t\tif (s[i][j + 1] == 'S'):\r\n\t\t\t\t\tdelta += 1\r\n\t\t\tif j != 0:\r\n\t\t\t\tif (s[i][j - 1] == 'S'):\r\n\t\t\t\t\tdelta += 1\r\n\t\t\tdeltas.append( ((i, j), delta) )\r\n\r\ndeltas.sort(key=operator.itemgetter(1))\r\n\r\ngood = []\r\nafter = before\r\n\r\nfor i in range(min(k, len(deltas))):\r\n\tgood.append(deltas[i][0])\r\n\tafter += deltas[i][1]\r\n\r\ngood = sorted(good, key=lambda k: [k[0], k[1]])\r\n\r\n# Минимальное количество соседей у статусных пассажиров\r\nprint(after)\r\n\r\n# Оптимальное расположение\r\ncur = 0\r\nfor i in range(n):\r\n\tfor j in range(12):\r\n\t\tif (cur < len(good) and i == good[cur][0] and j == good[cur][1]):\r\n\t\t\t\tcur += 1\r\n\t\t\t\tprint('x', end='')\r\n\t\telse:\r\n\t\t\tprint(s[i][j], end='')\r\n\tprint()", "def main():\r\n n, k = map(int, input().split())\r\n count = 0\r\n rows_raw = []\r\n table = []\r\n for i in range(n):\r\n s = input()\r\n rows_raw.append(s)\r\n for j in range(len(s)):\r\n if s[j] == '.':\r\n coef = 0\r\n if j > 0 and s[j - 1] == 'S':\r\n coef += 1\r\n if j < len(s) - 1 and s[j + 1] == 'S':\r\n coef += 1\r\n table.append((i, j, coef))\r\n if s[j] == 'S':\r\n if j > 0:\r\n if s[j - 1] != '-' and s[j - 1] != '.':\r\n count += 1\r\n if j < len(s) - 1:\r\n if s[j + 1] != '-' and s[j + 1] != '.':\r\n count += 1\r\n table.sort(key=lambda x: x[2])\r\n\r\n for i in range(k):\r\n set_passenger(rows_raw, table[i][0], table[i][1])\r\n count += table[i][2]\r\n print(count)\r\n for row in rows_raw:\r\n print(row)\r\n\r\n\r\ndef set_passenger(rows_raw, i, j):\r\n rows_raw[i] = rows_raw[i][:j] + 'x' + rows_raw[i][j + 1:]\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n, k = map(int,input().split())\r\ndef profeet(s, i):\r\n uspeh = 2\r\n if len(s) - 1 >= i + 1 >= 0:\r\n if s[i + 1] == 'S':\r\n uspeh -= 1\r\n if len(s) - 1 >= i - 1 >= 0:\r\n if s[i - 1] == 'S':\r\n uspeh -= 1\r\n return uspeh \r\na = []\r\nfor i in range(n):\r\n s = input()\r\n a.append(s.split('-'))\r\namount = 0\r\nfor i in range(n):\r\n for j in range(3):\r\n s = a[i][j]\r\n for p in range(len(s)):\r\n if amount >= k:\r\n break\r\n if s[p] == '.' and profeet(s,p) == 2 :\r\n s = s[:p] + 'x' + s[p + 1:]\r\n amount += 1\r\n a[i][j] = s\r\nfor i in range(n):\r\n for j in range(3):\r\n s = a[i][j]\r\n for p in range(len(s)):\r\n if amount >= k:\r\n break\r\n if s[p] == '.' and profeet(s,p) == 1 :\r\n s = s[:p] + 'x' + s[p + 1:]\r\n amount += 1\r\n a[i][j] = s\r\nfor i in range(n):\r\n for j in range(3):\r\n s = a[i][j]\r\n for p in range(len(s)):\r\n if amount >= k:\r\n break\r\n if s[p] == '.' and profeet(s,p) == 0 :\r\n s = s[:p] + 'x' + s[p + 1:]\r\n amount += 1\r\n a[i][j] = s\r\n if amount >= k:\r\n break\r\ndef proverka(s, i):\r\n uspeh = 0\r\n if len(s) - 1 >= i + 1 >= 0:\r\n if s[i + 1] != '-' and s[i + 1] != '.':\r\n uspeh += 1\r\n if len(s) - 1 >= i - 1 >= 0:\r\n if s[i -+ 1] != '-' and s[i - 1] != '.':\r\n uspeh += 1\r\n return uspeh\r\nb = []\r\nfor i in a:\r\n q = '-'.join(i)\r\n b.append(q)\r\nkol = 0\r\nfor i in range(n):\r\n for j in range(12):\r\n if b[i][j] == 'S':\r\n kol += proverka(b[i],j)\r\nprint(kol)\r\nfor i in b:\r\n print(i)\r\n\r\n \r\n \r\n \r\n ", "n, k = (int(x) for x in input().split())\r\nplane = []\r\nneig = [[0] * 12 for x in range(n)]\r\ncount = [0, 0, 0]\r\ncount_all = 0\r\nfor i in range(n):\r\n s = input()\r\n plane.append(s)\r\n for j in range(12):\r\n if s[j] == 'S':\r\n if j > 0 and (s[j - 1] == 'S' or s[j - 1] == 'P'):\r\n count_all += 1\r\n if j < 11 and (s[j + 1] == 'S' or s[j + 1] == 'P'):\r\n count_all += 1\r\n if s[j] == '.':\r\n c = 2\r\n if (j > 0 and s[j - 1] != 'S') or j == 0:\r\n c -= 1\r\n if (j < 11 and s[j + 1] != 'S') or j == 11:\r\n c -= 1\r\n count[c] += 1\r\n neig[i][j] = c\r\n# print(count)\r\nk1 = k\r\nfor i in range(3):\r\n if k1 >= count[i]:\r\n k1, count[i] = k1 - count[i], count[i]\r\n else:\r\n k1, count[i] = 0, k1\r\n# print(count_all, count)\r\nprint(count_all + count[1] + 2 * count[2])\r\n# print(plane[12])\r\nfor i in range(n):\r\n for j in range(12):\r\n if plane[i][j] == '.':\r\n if k > 0:\r\n if count[0] > 0 and neig[i][j] == 0:\r\n plane[i] = plane[i][:j] + 'x' + plane[i][j + 1:]\r\n count[0] -= 1\r\n k -= 1\r\n elif count[1] > 0 and neig[i][j] == 1:\r\n plane[i] = plane[i][:j] + 'x' + plane[i][j + 1:]\r\n count[1] -= 1\r\n k -= 1\r\n elif count[2] > 0 and neig[i][j] == 2:\r\n plane[i] = plane[i][:j] + 'x' + plane[i][j + 1:]\r\n count[2] -= 1\r\n k -= 1\r\n else:\r\n break\r\n print(plane[i])\r\n\r\n\r\n\r\n\r\n", "n, k = map(int, input().split())\nrows = list()\n# здесь и далее nb - neighbors\nnb = 0\n# места с соответствующим количеством соедей (0,1,2)\nplaces_by_nb = [list(), list(), list()]\nfor i in range(n):\n # считываем строку и добавляем как массив\n line = input()\n rows.append(list(line))\n # вставляем символы-ограничители в начало и конец и идем по строке\n row = '-%s-' % line\n for j in range(1, 13):\n # вычисляем первоначальное количество соседей\n if row[j] == 'S':\n if row[j-1] == 'S' or row[j-1] == 'P':\n nb += 1\n if row[j+1] == 'S' or row[j+1] == 'P':\n nb += 1\n # вычисляем количество соседей у каждого свободного места\n # и записываем координату места (с учетом ограничителей) в соответствующий массив (по числу соседей)\n elif row[j] == '.':\n t = 0\n if row[j-1] == 'S':\n t += 1\n if row[j+1] == 'S':\n t += 1\n places_by_nb[t].append((i, j-1))\n# до тех пор пока есть непосаженные пассажиры:\n# берем место, садим пассажира, увеличиваем количество соседей, уменьшаем количество пассажиров\nfor m in range(0,3):\n while k > 0 and len(places_by_nb[m]) > 0:\n place = places_by_nb[m].pop(-1)\n rows[place[0]][place[1]] = 'x'\n nb += m\n k -= 1\n if k == 0:\n break\n# и наконец выводим результат\nprint(nb)\nfor row in rows:\n print(''.join(row))\n", "\r\ndef Neigh(g,i,typ):\r\n neigh=0\r\n if(i>0 and X[g][i-1]==typ):neigh+=1\r\n if(i<11 and X[g][i+1]==typ):neigh+=1\r\n return neigh\r\nn,pas = map(int,input().split())\r\nX=[]\r\nfor i in range(n):\r\n X.append(list(input()))\r\nfor i in range(n):\r\n for g in range(12):\r\n if(X[i][g]=='.'):\r\n X[i][g]=Neigh(i,g,'S')\r\nm=0 \r\nwhile (pas>0):\r\n for i in range(n):\r\n for g in range(12):\r\n if(X[i][g]==m):\r\n X[i][g]='x'\r\n pas-=1\r\n if(pas==0):break\r\n if(pas==0):break\r\n if(pas==0):break \r\n m+=1\r\nsosedy=0 \r\nfor i in range(n):\r\n for g in range(12):\r\n if(X[i][g]=='S'):\r\n sosedy+=Neigh(i,g,'S')\r\n sosedy+=Neigh(i,g,'P')\r\n sosedy+=Neigh(i,g,'x')\r\n if(type(X[i][g])==type(1)):\r\n X[i][g]='.'\r\nprint(sosedy) \r\nfor i in range(len(X)):\r\n print(''.join(X[i])) \r\n\r\n \r\n", "n,k = map(int, input().split())\ng = []\nq = []\nfor i in range(n):\n v = input()\n p = []\n for i in v:\n p.append(i)\n v = p\n g.append(v)\n for x in range(len(v)):\n if v[x] != '.': continue\n num = 0\n if x != 0 and v[x-1] == 'S':\n num += 1\n if x+1 < len(v) and v[x+1] == 'S':\n num += 1\n q.append((num, len(g)-1, x))\nq = sorted(q)\nfor i in range(k):\n g[q[i][1]][q[i][2]] = 'x'\nan = 0\nfor s in g:\n for j in range(len(s)):\n if s[j] != 'S': continue\n if j != 0 and ( s[j-1] != '.' and s[j-1] != '-' ):\n an += 1\n if j+1 < len(s) and ( s[j+1] != '.' and s[j+1] != '-' ):\n an += 1\nprint(an)\n \nfor s in g:\n print(\"\".join(s))\n \n", "rows, count = list(map(int, input().split(' ')))\ncriteria = 0\nmin_value = 0\n\nmatrix = []\n\nwhile rows > 0:\n\tmatrix.append(list(input()))\n\trows -= 1\n\nrows = len(matrix)\n\ndef get_neighbours(row, index, mask = 'S'):\n\tleft = '-'\n\tright = '-'\n\ttry:\n\t\tif index:\n\t\t\tleft = row[index - 1]\n\texcept: \n\t\tpass\n\n\ttry:\n\t\tright = row[index + 1]\n\texcept: \n\t\tpass\n\n\tif right in mask and left in mask:\n\t\treturn 2\n\telif right in mask or left in mask:\n\t\treturn 1\n\telse:\n\t\treturn 0\n\n\ndef printm(matrix):\n\tprint('\\n'.join(list(map(lambda r: ''.join(r), matrix))))\n\ndef place(row):\n\tglobal count\n\tglobal min_value\n\tif count == 0:\n\t\treturn\n\n\ti = 0\n\twhile i < 12:\n\t\tif count == 0:\n\t\t\tbreak\n\n\t\titem = row[i]\n\n\t\tif item == '.':\n\t\t\tn = get_neighbours(row, i)\n\t\t\tif n <= criteria:\n\t\t\t\trow[i] = 'x'\n\t\t\t\tcount -= 1\n\t\t\t\tmin_value += criteria\n\t\ti += 1\n\ndef printt(matrix):\n\tn = 0\n\n\tfor row in matrix:\n\t\ti = 0\n\t\twhile i < 12:\n\t\t\ts = row[i]\n\t\t\tif s == 'S':\n\t\t\t\tn += get_neighbours(row, i, 'SPx')\n\t\t\ti += 1\n\n\tprint(n)\n\nwhile count > 0:\n\tfor row in matrix:\n\t\tplace(row)\n\tcriteria += 1\n\nprintt(matrix)\nprintm(matrix)\n", "n, k = map(int, input().split(\" \"))\n\n# encode plane from string\nplane = []\nfor i in range(n):\n row = input()\n row_code = []\n for s in row:\n if s == \"S\":\n row_code.append(2)\n elif s == \"P\":\n row_code.append(1)\n elif s == \".\":\n row_code.append(0)\n else:\n row_code.append(-1)\n plane.append(row_code)\n\n# place k passangers\nrow_len = len(plane[0])\nfor _ in range(k):\n best_place = None\n best_score = None\n for i, row in enumerate(plane):\n for j, place in enumerate(row):\n score = 0\n if place == 0 and j - 1 >= 0 and row[j - 1] == 2:\n score += 1\n if place == 0 and j + 1 < row_len and row[j + 1] == 2:\n score += 1\n if place == 0 and (best_score is None or score < best_score):\n best_score = score\n best_place = (i, j)\n plane[best_place[0]][best_place[1]] = 3\n\n# compute total number of neighbors for S\ntotal = 0\nfor i, row in enumerate(plane):\n for j, place in enumerate(row):\n if place == 2 and j - 1 >= 0 and row[j - 1] > 0:\n total += 1\n if place == 2 and j + 1 < row_len and row[j + 1] > 0:\n total += 1\n\n# print total and decode plane for output\nprint(total)\nfor row_code in plane:\n row = \"\"\n for place in row_code:\n if place == 2:\n row += \"S\"\n elif place == 1:\n row += \"P\"\n elif place == 0:\n row += \".\"\n elif place == 3:\n row += \"x\"\n else:\n row += \"-\"\n print(row)", "n, k = map(lambda i: int(i), input().split())\nrows = []\nseats = [0 for _ in range(3)]\nrequired_seats = []\nneighbors = 0\nfor _ in range(n):\n row = []\n prev = None\n for seat in list(input()):\n if seat == 'S' and (prev == 0 or prev == 1):\n row[-1] += 1\n seats[prev] -= 1\n seats[prev + 1] += 1\n elif seat == 'S' and (prev == 'S' or prev == 'P'):\n neighbors += 1\n if (seat == 'S' or seat == 'P') and prev == 'S':\n neighbors += 1\n if seat == '.' and prev == 'S':\n seat = 1\n seats[1] += 1\n elif seat == '.' and prev != 'S':\n seat = 0\n seats[0] += 1\n row.append(seat)\n prev = seat\n rows.append(row)\n\nfor s in seats:\n if k < 0:\n k = 0\n required_seats.append(min(k, s))\n k = k - s\n\nprint(neighbors + required_seats[1] + required_seats[2] * 2)\nfor row in rows:\n for c in row:\n if type(c) == int and required_seats[c] > 0:\n required_seats[c] -= 1\n c = 'x'\n elif type(c) == int:\n c = '.'\n print(c, end='')\n print()\n", "n, k = list(map(int, input().split()))\nplane = [[0] * 12 for i in range (n)]\nfor i in range(n):\n\ta = str(input())\n\tfor j in range (12):\n\t\tif a[j] == \"S\":\n\t\t\tplane[i][j] = 2\n\t\telif a[j] == \"P\":\n\t\t\tplane[i][j] = 1\n\t\telif a[j] == \"-\":\n\t\t\tplane[i][j] = 3\n\nfor i in range (n):\n\tfor j in range (12):\n\t\tif k != 0 and plane[i][j] == 0 and (j - 1 < 0 or plane[i][j - 1] != 2) and (j + 1 >= 12 or plane[i][j + 1] != 2):\n\t\t\tk -= 1\n\t\t\tplane[i][j] = 5\n\nfor i in range (n):\n\tfor j in range (12):\n\t\tif k != 0 and plane[i][j] == 0 and ((j - 1 < 0 or plane[i][j - 1] != 2) or (j + 1 >= 12 or plane[i][j + 1] != 2)):\n\t\t\tk -= 1\n\t\t\tplane[i][j] = 5\n\nfor i in range (n):\n\tfor j in range (12):\n\t\tif k != 0 and plane[i][j] == 0:\n\t\t\tk -= 1\n\t\t\tplane[i][j] = 5\n\nbad = 0\nanswer = []\nfor i in range(n):\n\ta = ''\n\tfor j in range (12):\n\t\tif plane[i][j] == 2:\n\t\t\tif j - 1 >= 0 and (plane[i][j - 1] == 2 or plane[i][j - 1] == 1 or plane[i][j - 1] == 5): \n\t\t\t\tbad += 1\n\t\t\tif j + 1 < 12 and (plane[i][j + 1] == 2 or plane[i][j + 1] == 1 or plane[i][j + 1] == 5): \n\t\t\t\tbad += 1\n\t\t\ta += \"S\"\n\t\telif plane[i][j] == 1:\n\t\t\ta += \"P\"\n\t\telif plane[i][j] == 3:\n\t\t\ta += \"-\"\n\t\telif plane[i][j] == 5:\n\t\t\ta += \"x\"\n\t\telse:\n\t\t\ta += \".\"\n\tanswer += [a]\n\t\nprint(bad)\nfor i in answer:\n\tprint(i)", "n, k = [int(_) for _ in input().split()]\r\n\r\ns0 = []\r\ns1 = []\r\ns2 = []\r\nans = 0\r\nrows = []\r\n\r\nfor i in range(n):\r\n row = input()\r\n for j in range(len(row)):\r\n if row[j] in ('-', 'P'):\r\n continue\r\n elif row[j] == 'S':\r\n if j > 0 and row[j - 1] in ('P', 'S'):\r\n ans += 1\r\n if j < len(row) - 1 and row[j + 1] in ('P', 'S'):\r\n ans += 1\r\n elif row[j] == '.':\r\n s_neighbours = 0\r\n if j > 0 and row[j - 1] == 'S':\r\n s_neighbours += 1\r\n if j < len(row) - 1 and row[j + 1] == 'S':\r\n s_neighbours += 1\r\n\r\n if s_neighbours == 0:\r\n s0.append((i, j))\r\n elif s_neighbours == 1:\r\n s1.append((i, j))\r\n elif s_neighbours == 2:\r\n s2.append((i, j))\r\n else:\r\n raise AssertionError()\r\n else:\r\n raise AssertionError()\r\n rows.append(list(row))\r\n\r\nfor (i, j) in s0:\r\n if k > 0:\r\n rows[i][j] = 'x'\r\n k -= 1\r\n else:\r\n break\r\n\r\nfor (i, j) in s1:\r\n if k > 0:\r\n rows[i][j] = 'x'\r\n k -= 1\r\n ans += 1\r\n else:\r\n break\r\n\r\nfor (i, j) in s2:\r\n if k > 0:\r\n rows[i][j] = 'x'\r\n k -= 1\r\n ans += 2\r\n else:\r\n break\r\n\r\nprint(ans)\r\nprint('\\n'.join(''.join(r for r in row) for row in rows))\r\n", "#python 3.5.2\r\n\r\nn,k = map(int, input().split())\r\nA = []\r\nB = []\r\nans=0\r\na = [[''] *12 for i in range(n)]\r\nfor i in range (n):\r\n a[i] = input()\r\n for j in range(12):\r\n if (a[i][j]==\".\"):\r\n nsoo=0\r\n if(j>0):\r\n if(a[i][j-1]==\"S\"):\r\n nsoo+=1\r\n if(j<11):\r\n if(a[i][j+1]==\"S\"):\r\n nsoo+=1\r\n A.append(nsoo)\r\n B.append([i,j])\r\n if(a[i][j]==\"S\"):\r\n if(j>0):\r\n if(a[i][j-1]==\"S\" or a[i][j-1]==\"P\"):\r\n ans+=1\r\n if(j<11):\r\n if(a[i][j+1]==\"S\" or a[i][j+1]==\"P\"):\r\n ans+=1\r\ncnt0=cnt1=cnt2=0\r\n\r\niin = [0]*len(A)\r\nfor i in range (len(A)):\r\n if(A[i]==0):\r\n iin[i]=cnt0+1\r\n cnt0+=1\r\ncnt1=cnt0\r\nfor i in range (len(A)):\r\n if(A[i]==1):\r\n iin[i]=cnt1+1\r\n cnt1+=1\r\ncnt2=cnt1\r\nfor i in range (len(A)):\r\n if(A[i]==2):\r\n iin[i]=cnt2+1\r\n cnt2+=1\r\ncnt=1\r\nfor j in range(len(A)):\r\n if(cnt-1==cnt0):\r\n break\r\n if(cnt-1==k):\r\n break\r\n if(iin[j]==cnt):\r\n c = a[B[j][0]][0:B[j][1]] + 'x' \r\n c = c+a[B[j][0]][B[j][1]+1:]\r\n a[B[j][0]]=c\r\n ans+=A[j]\r\n cnt+=1\r\nfor j in range(len(A)):\r\n if (cnt-1==k):\r\n break\r\n if(cnt-1==cnt1):\r\n break\r\n if(iin[j]==cnt):\r\n c = a[B[j][0]][0:B[j][1]] + 'x' \r\n c = c+a[B[j][0]][B[j][1]+1:]\r\n a[B[j][0]]=c\r\n ans+=A[j]\r\n cnt+=1\r\nfor j in range(len(A)):\r\n if(cnt-1==cnt2):\r\n break\r\n if(cnt-1==k):\r\n break\r\n if(iin[j]==cnt):\r\n c = a[B[j][0]][0:B[j][1]] + 'x' \r\n c = c+a[B[j][0]][B[j][1]+1:]\r\n a[B[j][0]]=c\r\n ans+=A[j]\r\n cnt+=1\r\nprint(ans)\r\nfor i in range(n):\r\n print(a[i])\r\n \r\n \r\n \r\n \r\n ", "n, k = map(int, input().split())\r\nans = 0\r\narr = []\r\nqwer = []\r\nrem = k\r\n\r\nonce = []\r\nsec = []\r\nfor i in range(n):\r\n s = input()\r\n arr.append(s)\r\n s = '-' + s + '-'\r\n new = ''\r\n for j in range(1, 13):\r\n if s[j] == 'S':\r\n if s[j - 1] == 'P' or s[j - 1] == 'S':\r\n ans += 1\r\n if s[j + 1] == 'P' or s[j + 1] == 'S':\r\n ans += 1\r\n if s[j] == '.' and rem > 0 and s[j - 1] != 'S' and s[j + 1] != 'S':\r\n new += 'x'\r\n rem -= 1\r\n else:\r\n new += s[j]\r\n if s[j] == '.' and rem > 0:\r\n if s[j - 1] != 'S' or s[j + 1] != 'S':\r\n once.append((i, j - 1))\r\n \r\n else:\r\n sec.append((i, j - 1))\r\n s = s[1:9]\r\n qwer.append(new)\r\n \r\n#print(*once)\r\n#print(*sec)\r\n#print(ans)\r\nfor i in range(len(once)):\r\n if rem <= 0:\r\n break\r\n lit = qwer[once[i][0]]\r\n help = lit[:once[i][1]] + 'x' + lit[once[i][1] + 1:]\r\n qwer[once[i][0]] = help\r\n ans += 1\r\n rem -= 1\r\nfor i in range(len(sec)):\r\n if rem <= 0:\r\n break\r\n lit = qwer[sec[i][0]]\r\n help = lit[:sec[i][1]] + 'x' + lit[sec[i][1] + 1:]\r\n qwer[sec[i][0]] = help\r\n ans += 2\r\n rem -= 1\r\nprint(ans)\r\nfor i in range(n):\r\n print(qwer[i])", "n,k=map(int,str(input()).split())\r\nc=0\r\npot=[[],[],[]]\r\nb=[]\r\nfor jojo in range(n):\r\n b.append(list(str(input())))\r\n a=b[jojo]\r\n for i in range(12):\r\n if a[i]=='S':\r\n if i>0:\r\n if (a[i-1]!='.')and(a[i-1]!='-'):\r\n c+=1\r\n if i<11:\r\n if (a[i+1]!='.')and(a[i+1]!='-'):\r\n c+=1\r\n elif a[i]=='.':\r\n loc_c=0\r\n if i>0:\r\n if (a[i-1]=='S'):\r\n loc_c+=1\r\n if i<11:\r\n if (a[i+1]=='S'):\r\n loc_c+=1\r\n pot[loc_c].append([i,jojo])\r\nfor j in range(3):\r\n i=0\r\n while (k>0) and (i!=len(pot[j])):\r\n x,y=pot[j][i]\r\n b[y][x]='x'\r\n c+=j\r\n i+=1\r\n k-=1\r\nprint (c)\r\nk = ''\r\nfor i in b:\r\n k += str(''.join(i)) + '\\n'\r\nprint (k)\r\n \r\n \r\n \r\n", "n, k = (int(s) for s in input().split())\r\nrows = []\r\nfor i in range(n):\r\n rows.append([c for c in input()])\r\n\r\ndef nbcnt(row, col):\r\n res = 0\r\n if col != 0 and rows[row][col - 1] == 'S':\r\n res += 1\r\n if col != 11 and rows[row][col + 1] == 'S':\r\n res += 1\r\n return res\r\n\r\nfor c in range(3):\r\n for i in range(n):\r\n for j in range(12):\r\n if k != 0 and rows[i][j] == '.' and nbcnt(i, j) == c:\r\n rows[i][j] = 'x'\r\n k -= 1\r\n\r\nres = 0\r\nfor i in range(n):\r\n for j in range(12):\r\n if rows[i][j] != '.' and rows[i][j] != '-':\r\n res += nbcnt(i, j)\r\n\r\nprint(res)\r\n\r\nfor i in range(n):\r\n print(\"\".join(rows[i]))\r\n", "__author__ = 'RaldenProg'\r\nfrom pprint import pprint\r\nn, k = [_ for _ in map(int, input().split())]\r\ntop = ['.', 'P', '-', 'x']\r\ntop1 = ['S', '-', 'p', '.']\r\npas = ['P', 'x', 'S']\r\ny = []\r\nfor i in range(n):\r\n x = ['-']\r\n x.extend(list(input()))\r\n x.append('-')\r\n y.append(x)\r\n\r\nchet = 0\r\n\r\nfor i in range(n):\r\n for j in range(len(y[i])):\r\n if y[i][j] == '.':\r\n if y[i][j-1] in top and y[i][j+1] in top and chet != k:\r\n #print(y[i][j-1], y[i][j], y[i][j+1])\r\n y[i][j] = 'x'\r\n chet += 1\r\nwhile chet != k:\r\n flag = 0\r\n for i in range(n):\r\n for j in range(len(y[i])):\r\n if y[i][j] == '.':\r\n if y[i][j - 1] in top1 and y[i][j + 1] in top and chet != k:\r\n #print(y[i][j - 1], y[i][j], y[i][j + 1])\r\n y[i][j] = 'x'\r\n chet += 1\r\n flag = 1\r\n\r\n if y[i][j - 1] in top and y[i][j + 1] in top1 and chet != k:\r\n #print(y[i][j - 1], y[i][j], y[i][j + 1])\r\n y[i][j] = 'x'\r\n chet += 1\r\n flag = 1\r\n\r\n if flag == 0 and chet != k:\r\n for i in range(n):\r\n for j in range(len(y[i])):\r\n if y[i][j] == '.' and chet != k:\r\n y[i][j] = 'x'\r\n chet += 1\r\n flag = 1\r\n\r\nkol = 0\r\nfor i in range(n):\r\n for j in range(len(y[i])):\r\n if y[i][j] == 'S':\r\n if y[i][j - 1] in pas:\r\n kol += 1\r\n if y[i][j + 1] in pas:\r\n kol += 1\r\nprint(kol)\r\nfor i in range(n):\r\n for j in range(1, len(y[i])-1):\r\n print(y[i][j], end='')\r\n print()\r\n", "def pr():\r\n print(ans)\r\n print('\\n'.join(['-'.join([''.join(pas[i][j]) for j in range(3)]) for i in range(n)]))\r\n\r\n\r\ndef sit_down(neig):\r\n global c, ans\r\n global pas\r\n\r\n for i in range(n):\r\n for j in range(3):\r\n El = pas[i][j]\r\n ln = len(El)\r\n for k in range(ln):\r\n if El[k] == '.':\r\n t = 0\r\n\r\n if k > 0 and El[k - 1] == 'S':\r\n t += 1\r\n if k + 1 < ln and El[k + 1] == 'S':\r\n t += 1\r\n\r\n if t == neig:\r\n pas[i][j][k] = 'x'\r\n c += 1\r\n ans += neig\r\n\r\n if c == K:\r\n pr()\r\n exit()\r\n\r\n\r\nn, K = map(int, input().split())\r\npas = list([list(x) for x in input().split('-')] for i in range(n))\r\n\r\nans = 0\r\nfor i in range(n):\r\n for j in range(3):\r\n El = pas[i][j]\r\n for k, el in enumerate(El[1:]):\r\n temp = [el, El[k]]\r\n if temp.count('.') == 0:\r\n ans += temp.count('S')\r\n\r\nc = 0\r\n\r\nsit_down(0)\r\nsit_down(1)\r\nsit_down(2)\r\n", "def count(flight):\r\n\tcnt = 0\r\n\tfor i in range(len(flight)):\r\n\t\tfor j in range(14):\r\n\t\t\tif flight[i][j] == 'S':\r\n\t\t\t\tf = [flight[i][j-1], flight[i][j+1]]\r\n\t\t\t\tcnt += 2 - f.count('-') - f.count('.')\r\n\treturn cnt\r\n\r\ndef main():\r\n\t# f = open('B_input.txt', 'rt')\r\n\tn, k = map(int, input().split(' '))\r\n\t# n, k = map(int, f.readline().split(' '))\r\n\tflight = []\r\n\tfor i in range(n):\r\n\t\t# flight.append(['-'] + list(f.readline().replace('\\n', '')) + ['-'])\r\n\t\tflight.append(['-'] + list(input()) + ['-'])\r\n\t# f.close()\r\n\r\n\tfor c in range(3):\r\n\t\tfor i in range(n):\r\n\t\t\tfor j in range(14):\r\n\t\t\t\tif flight[i][j] == '.' and [flight[i][j-1], flight[i][j+1]].count('S') == c:\r\n\t\t\t\t\tk -= 1\r\n\t\t\t\t\tflight[i][j] = 'x'\r\n\t\t\t\t\tif k == 0:\r\n\t\t\t\t\t\treturn count(flight), '\\n'.join([''.join(i[1:-1]) for i in flight]) \r\n\r\nprint(*main(), sep = '\\n')\r\n", "n, k = map(int, input().split())\nrows = [['-'] + list(input()) + ['-'] for i in range(n)]\npositions_by_cost = [[] for cost in (0, 1, 2)]\ntotal_cost = 0\nfor row_idx, r in enumerate(rows):\n for col_idx, (l, m, r) in enumerate(zip(r, r[1:], r[2:])):\n if m == '.':\n cost = int(l == 'S') + int(r == 'S')\n positions_by_cost[cost].append((row_idx, col_idx))\n elif m == 'S':\n total_cost += int(l == 'P') + int(r == 'P')\n total_cost += int(l == 'S') + int(r == 'S')\n\ncost = 0\nfor passenger in range(k):\n while len(positions_by_cost[cost]) == 0:\n cost += 1\n row_idx, col_idx = positions_by_cost[cost].pop()\n rows[row_idx][1 + col_idx] = 'x'\n total_cost += cost\n\nprint(total_cost)\nfor r in rows:\n print(\"\".join(r[1:-1]))\n", "#!/usr/bin/env python3\n\na, num = list(map(int, input().split()))\n\nrows = {}\ns = 0\n\nfor i in range(a):\n row = input()\n places = []\n best = []\n average = []\n\n for j, x in enumerate(row):\n if x == '.':\n row_ = ' ' + row + ' '\n if row_[j] != 'S' and row_[j + 2] != 'S':\n if num > 0:\n row = row[:j] + 'x' + row[j+1:]\n num -= 1\n elif row_[j] != 'S' or row_[j + 2] != 'S':\n average.append(j)\n else:\n places.append(j)\n\n rows[i] = {\n 'average': average,\n 'places': places,\n 'row': row,\n }\n\nfor i in range(a):\n if rows[i]['average']:\n for j in rows[i]['average']:\n if num > 0:\n row = rows[i]['row']\n row = row[:j] + 'x' + row[j+1:]\n rows[i]['row'] = row\n num -= 1\n\nfor i in range(a):\n if rows[i]['places']:\n for j in rows[i]['places']:\n if num > 0:\n row = rows[i]['row']\n row = row[:j] + 'x' + row[j+1:]\n rows[i]['row'] = row\n num -= 1\n\nfor i in range(a):\n row = rows[i]['row']\n for j, x in enumerate(row):\n if x == 'S':\n row_ = ' ' + row + ' '\n if row_[j] in 'PSx':\n s += 1\n if row_[j + 2] in 'PSx':\n s += 1\n\nprint(s)\n\nfor i in range(a):\n print(rows[i]['row'])\n", "n, k = map(int, input().split())\r\nL = []\r\nfor i in range(n):\r\n L.append(list(input()))\r\n\r\n#--1\r\nfor i in range(len(L)):\r\n for j in range(12):\r\n if k > 0:\r\n if (j == 0 or j == 4 or j == 9) and L[i][j] == '.' and L[i][j + 1] != 'S':\r\n k -= 1\r\n L[i][j] = 'x'\r\n if (j == 1 or j == 5 or j == 6 or j == 10) and L[i][j] == '.' and L[i][j + 1] != 'S'and L[i][j - 1] != 'S':\r\n k -= 1\r\n L[i][j] = 'x'\r\n if (j == 2 or j == 7 or j == 11) and L[i][j] == '.' and L[i][j - 1] != 'S':\r\n k -= 1\r\n L[i][j] = 'x'\r\n\r\n#for i in range(len(L)):\r\n #print(''.join(j for j in L[i]))\r\n#print()\r\n\r\n#--2\r\nfor i in range(len(L)):\r\n for j in range(12):\r\n if k > 0:\r\n if (j == 0 or j == 4 or j == 9) and L[i][j] == '.' and L[i][j + 1] == 'S':\r\n k -= 1\r\n L[i][j] = 'x'\r\n if (j == 1 or j == 5 or j == 6 or j == 10) and L[i][j] == '.' and (L[i][j + 1] == 'S' or L[i][j - 1] == 'S') and not (L[i][j + 1] == 'S' and L[i][j - 1] == 'S'):\r\n k -= 1\r\n L[i][j] = 'x'\r\n if (j == 2 or j == 7 or j == 11) and L[i][j] == '.' and L[i][j - 1] == 'S':\r\n k -= 1\r\n L[i][j] = 'x'\r\n\r\n#for i in range(len(L)):\r\n #print(''.join(j for j in L[i]))\r\n#print()\r\n#--3\r\nfor i in range(len(L)):\r\n for j in range(12):\r\n if k > 0:\r\n if L[i][j] == '.':\r\n k -= 1\r\n L[i][j] = 'x'\r\n\r\nans = 0\r\nfor i in range(len(L)):\r\n for j in range(12):\r\n if (j == 0 or j == 4 or j == 9) and L[i][j] == 'S' and L[i][j + 1] != '.':\r\n ans += 1\r\n if (j == 1 or j == 5 or j == 6 or j == 10) and L[i][j] == 'S' and L[i][j + 1] != '.' and L[i][j - 1] != '.':\r\n ans += 2\r\n elif (j == 1 or j == 5 or j == 6 or j == 10) and L[i][j] == 'S' and (L[i][j + 1] != '.' or L[i][j - 1] != '.'):\r\n ans += 1 \r\n if (j == 2 or j == 7 or j == 11) and L[i][j] == 'S' and L[i][j - 1] != '.':\r\n ans += 1\r\nprint(ans)\r\nfor i in range(len(L)):\r\n print(''.join(j for j in L[i]))", "def calc(row, j):\r\n cur = 0\r\n if j != 0 and row[j - 1] == 'S':\r\n cur += 1\r\n if j != len(row) - 1 and row[j + 1] == 'S':\r\n cur += 1\r\n return cur\r\n\r\ndef put_next():\r\n global rows\r\n best_row_i = -1\r\n best_i = -1\r\n cnt = 3\r\n for i, row in enumerate(rows):\r\n for j, c in enumerate(row):\r\n if c == '.':\r\n cur = calc(row, j)\r\n if cur < cnt:\r\n cnt = cur\r\n best_row_i = i\r\n best_i = j\r\n old = rows[best_row_i]\r\n rows[best_row_i] = old[:best_i] + 'x' + old[best_i + 1:]\r\n \r\n\r\ndef calc_ans():\r\n global rows\r\n ans = 0\r\n for row in rows:\r\n for i, c in enumerate(row):\r\n if c != '.' and c != '-':\r\n ans += calc(row, i)\r\n return ans\r\n \r\n\r\nn, k = map(int, input().split())\r\nrows = [input() for i in range(n)]\r\nfor i in range(k):\r\n put_next()\r\nprint(calc_ans())\r\nfor row in rows:\r\n print(row)\r\n", "n, k = map(int, input().split())\r\nplane = []\r\nfree_seats = dict()\r\ns_seats = dict()\r\n# free_seats = [[-1 for _ in range(12)] for __ in range(n)]\r\n# s_seats = [[-1 for _ in range(12)] for __ in range(n)]\r\n\r\nfor i in range(n):\r\n row = input()\r\n new_row = []\r\n for num, p in enumerate(row):\r\n if p == 'P':\r\n new_row.append('P')\r\n if num != 0 and new_row[num - 1] == 'S':\r\n s_seats[i, num - 1] += 1\r\n\r\n elif num != 0 and new_row[num - 1] == '.':\r\n free_seats[i, num - 1][1] += 1\r\n\r\n elif p == '-':\r\n new_row.append('-')\r\n\r\n elif p == '.':\r\n new_row.append('.')\r\n if num != 0 and new_row[num - 1] == 'S':\r\n free_seats[i, num] = [1, 0]\r\n elif num != 0 and new_row[num - 1] == 'P':\r\n free_seats[i, num] =[0,1]\r\n else:\r\n free_seats[i, num] = [0,0]\r\n\r\n elif p == 'S':\r\n new_row.append('S')\r\n if num != 0 and new_row[num - 1] in 'SP':\r\n s_seats[i, num] = 1\r\n else:\r\n s_seats[i, num] = 0\r\n\r\n if num != 0 and new_row[num - 1] == 'S':\r\n s_seats[i, num - 1] += 1\r\n elif num != 0 and new_row[num - 1] == '.':\r\n free_seats[i, num - 1][0] += 1\r\n plane.append(new_row)\r\n# print(s_seats)\r\n# print(free_seats)\r\n # print(new_row)\r\nfor i in range(k):\r\n l = list(sorted(free_seats.items(), key=lambda x: (x[1][0], x[1][1])))\r\n # print(l)\r\n r, s = l[0][0]\r\n # print(free_seats)\r\n if s != 0:\r\n if plane[r][s - 1] == 'S':\r\n s_seats[r, s - 1] += 1\r\n elif plane[r][s-1] == '.':\r\n free_seats[r, s-1][1] += 1\r\n if s != 11:\r\n if plane[r][s + 1] == 'S':\r\n s_seats[r, s + 1] += 1\r\n elif plane[r][s+1] == '.':\r\n free_seats[r, s+1][1] +=1\r\n\r\n plane[r][s] = 'x'\r\n del free_seats[r, s]\r\n\r\n\r\ntotal = sum(list(s_seats.values()))\r\nprint(total)\r\nfor i in plane:\r\n print(''.join(i))\r\n\r\n# print(s_seats)\r\n# print(free_seats)\r\n", "n,k = [int(i) for i in input().split()]\nall_rows = []\ninfo = []\ncount = 0\nfor j in range(n):\n row = input()\n all_rows.append(row)\n for i,place in enumerate(row):\n if place == 'S':\n if i !=0:\n if row[i-1] == 'S':\n count+=1\n if i !=len(row)-1:\n if row[i+1] == 'S':\n count+=1\n if place == 'P':\n if i !=0:\n if row[i-1] == 'S':\n count+=1\n if i !=len(row)-1:\n if row[i+1] == 'S':\n count+=1\n elif place == '.':\n small_count = 0\n if i !=0:\n if row[i-1] == 'S':\n small_count+=1\n if i !=len(row)-1:\n if row[i+1] == 'S':\n small_count+=1\n info.append([small_count,j,i])\n\ninfo.sort(key=lambda x:x[0])\n# print(info)\nfor i in range(k):\n count+=info[i][0]\n all_rows[info[i][1]] = all_rows[info[i][1]][:info[i][2]]+'x'+all_rows[info[i][1]][1+info[i][2]:]\n\nprint(count)\nprint('\\n'.join(all_rows))", "\ndef answer(seats):\n ans = 0\n for row in seats:\n t = 0\n for i in range(len(row)):\n if row[i] == 'S':\n if i > 0 and row[i - 1] not in '-.':\n t += 1\n if i < len(row) - 1 and row[i + 1] not in '-.':\n t += 1\n ans += t\n return ans\n\n\ndef place_first(seats, k):\n for row in seats:\n for i in range(len(row)):\n if row[i] == '.':\n place = True\n if i > 0 and row[i - 1] == 'S':\n place = False\n if i < len(row) - 1 and row[i + 1] == 'S':\n place = False\n if place and k > 0:\n row[i] = 'x'\n k -= 1\n return k\n\n\ndef place_second(seats, k):\n for row in seats:\n for i in range(len(row)):\n if row[i] == '.':\n place = True\n if i > 0 and row[i - 1] == 'S':\n if i < len(row) - 1 and row[i + 1] == 'S':\n place = False\n if place and k > 0:\n row[i] = 'x'\n k -= 1\n return k\n\n\ndef place_third(seats, k):\n for row in seats:\n for i in range(len(row)):\n if row[i] == '.':\n if k > 0:\n row[i] = 'x'\n k -= 1\n return k\n\n\ndef main():\n n, k = list(map(int, input().strip().split()))\n seats = []\n for i in range(n):\n seats.append(list(input().strip()))\n\n k = place_first(seats, k)\n k = place_second(seats, k)\n place_third(seats, k)\n\n print(answer(seats))\n for row in seats:\n print(''.join(row))\n\nmain()\n", "n, k = map(int, input().split())\n\nm = []\nempty = []\nans = 0\n\nfor i in range(n):\n s = input()\n\n for j in range(len(s)):\n if s[j] == '.':\n t = 0\n if j > 0:\n t += s[j-1] == 'S'\n if j < 11:\n t += s[j+1] == 'S'\n empty.append((t, i, j))\n if s[j] == 'S':\n if j > 0:\n ans += s[j-1] in ['P', 'S']\n if j < 11:\n ans += s[j+1] in ['P', 'S']\n\n m.append(list(s))\n\nempty.sort(key=lambda x: x[0])\n\n\nfor i in range(k):\n t, x, y = empty[i]\n m[x][y] = 'x'\n ans += t\n\nprint(ans)\n\nfor i in m:\n print(''.join(i))\n\n", "n, k = list(map(int, input().split()))\nrows = [['-'] + list(input()) + ['-'] for _ in range(n)]\n\nseats = [1, 2, 3, 5, 6, 7, 8, 10, 11, 12]\nfree_seats = []\ntotal_value = 0\n\nfor row_index in range(n):\n\tfor seat_index in seats:\n\t\tif rows[row_index][seat_index] == '.':\n\t\t\tvalue = int(rows[row_index][seat_index - 1] == 'S') + int(rows[row_index][seat_index + 1] == 'S')\n\t\t\tfree_seats.append((row_index, seat_index, value))\n\t\tif rows[row_index][seat_index] == 'S':\n\t\t\ttotal_value += int(rows[row_index][seat_index - 1] in ['S', 'P']) + int(rows[row_index][seat_index + 1] in ['S', 'P'])\n\nfree_seats.sort(key=lambda x: x[2])\n\n# print(free_seats, sep='\\n')\n\nfor seated in free_seats[:k]:\n\trows[seated[0]][seated[1]] = 'x'\n\ttotal_value += seated[2]\n\nprint(total_value)\n\nfor row in rows:\n\tprint(*row[1:-1], sep='')", "def sajatel(data, k, sos):\r\n\tfor x in range(len(data)):\r\n\t\tif data[x] == '.':\r\n\t\t\tsosc = 0\r\n\t\t\tif x-1>=0 and data[x-1] == \"S\":\r\n\t\t\t\tsosc += 1\r\n\t\t\tif x+1<=len(data)-1 and data[x+1] == \"S\":\r\n\t\t\t\tsosc += 1\r\n\t\t\tif(sosc == sos):\r\n\t\t\t\tk -= 1\r\n\t\t\t\tdata[x] = 'x'\r\n\t\t\t\tif (k == 0):\r\n\t\t\t\t\treturn data\r\n\treturn sajatel(data, k, sos+1)\r\n\t\t\r\n\t\r\n\r\ndata = input().split()\r\nn = int(data[0])\r\nk = int(data[1])\r\ndata = input()\r\nsos = 0\r\nfor i in range(n-1):\r\n\tdata += '|' + input()\r\ndata = list(data)\r\na = sajatel(data, k, sos)\r\n\r\ncounty = 0\r\nfor x in range(len(data)):\r\n\tif data[x] == 'S':\r\n\t\tif x-1>=0 and (data[x-1] != '.' and data[x-1] != '-' and data[x-1] != '|'):\r\n\t\t\tcounty += 1\r\n\t\tif x+1<=len(data)-1 and (data[x+1] != \".\" and data[x+1] != \"-\" and data[x+1] != \"|\"):\r\n\t\t\tcounty += 1\r\n\r\nansw = \"\".join(a).split(\"|\")\r\nprint(county)\r\nfor x in answ:\r\n\tprint(x)", "l=input().split()\r\nn=int(l[0])\r\nk=int(l[1])\r\na=[[]*12 for i in range(n)]\r\nfree=0\r\ncount=0\r\nflag=0\r\nfor i in range(n):\r\n\tl=input()\r\n\ta[i]=list(l)\r\n\tfor j in range(12):\r\n\t\tif a[i][j]=='.':\r\n\t\t\tfree=free+1\r\nfor i in range(n):\r\n\tfor j in range(1,11):\r\n\t\tif free==k:\r\n\t\t\tflag=1\r\n\t\t\tbreak\r\n\t\tif a[i][j]=='.':\r\n\t\t\tif a[i][j-1]=='S' and a[i][j+1]=='S':\r\n\t\t\t\tif free-k>0:\r\n\t\t\t\t\ta[i][j]='z'\r\n\t\t\t\t\tfree=free-1\r\nif flag==0:\r\n\tfor i in range(n):\r\n\t\tfor j in range(0,12):\r\n\t\t\tif free==k:\r\n\t\t\t\tflag=1\r\n\t\t\t\tbreak\r\n\t\t\tif a[i][j]=='.':\r\n\t\t\t\tif (j<11 and a[i][j+1]=='S') or (j>0 and a[i][j-1]=='S'):\r\n\t\t\t\t\tif free-k>0:\r\n\t\t\t\t\t\ta[i][j]='z'\r\n\t\t\t\t\t\tfree=free-1\r\nfor i in range(n):\r\n\tfor j in range(12):\r\n\t\tif k<=0:\r\n\t\t\tbreak\r\n\t\tif a[i][j]=='.':\r\n\t\t\ta[i][j]='x'\r\n\t\t\tk=k-1\r\nfor i in range (n):\r\n\tfor j in range(12):\r\n\t\tif a[i][j]=='z':\r\n\t\t\ta[i][j]='.'\r\nfor i in range(n):\r\n\tfor j in range(12):\r\n\t\tif a[i][j]=='S':\r\n\t\t\tif(j==0):\r\n\t\t\t\tif a[i][j+1]!='.' and a[i][j+1]!='-':\r\n\t\t\t\t\tcount=count+1\r\n\t\t\t\t\t\r\n\t\t\telif (j==11):\r\n\t\t\t\tif a[i][j-1]!='.' and a[i][j-1]!='-':\r\n\t\t\t\t\tcount=count+1\r\n\t\t\t\t\t\r\n\t\t\telse :\r\n\t\t\t\tif a[i][j-1]!='.' and a[i][j-1]!='-':\r\n\t\t\t\t\tcount=count+1\r\n\t\t\t\t\r\n\t\t\t\tif a[i][j+1]!='.' and a[i][j+1]!='-':\r\n\t\t\t\t\tcount=count+1\r\n\t\t\t\t\r\nprint(count)\r\nfor i in range(n):\r\n\tfor j in range(12):\r\n\t\t\r\n\t\tprint(a[i][j],end='')\r\n\tif i<n-1:print()", "\r\n\r\n\r\ndef count_status_neibours(n_row, place, rows):\r\n # place can be either 0, 1, 2, 4, 5, 6, 7, 9, 10, 11\r\n ans = 0\r\n if place in [0, 4, 9]:\r\n if rows[n_row][place + 1] == \"S\":\r\n ans += 1\r\n elif place in [2, 7, 11]:\r\n if rows[n_row][place - 1] == \"S\":\r\n ans += 1\r\n else:\r\n if rows[n_row][place + 1] == \"S\":\r\n ans += 1\r\n\r\n if rows[n_row][place - 1] == \"S\":\r\n ans += 1\r\n\r\n return ans\r\n\r\n\r\n\r\ndef count_any_neibours(n_row, place, rows):\r\n # place can be either 0, 1, 2, 4, 5, 6, 7, 9, 10, 11\r\n ans = 0\r\n if place in [0, 4, 9]:\r\n if rows[n_row][place + 1] != \".\":\r\n ans += 1\r\n elif place in [2, 7, 11]:\r\n if rows[n_row][place - 1] != \".\":\r\n ans += 1\r\n else:\r\n if rows[n_row][place + 1] != \".\":\r\n ans += 1\r\n\r\n if rows[n_row][place - 1] != \".\":\r\n ans += 1\r\n\r\n return ans\r\n\r\ndef fill_k_of_j_in_rows(k, j, rows, rows_info):\r\n i = 0\r\n for row_n in range(len(rows)):\r\n for place in range(12):\r\n if rows_info[row_n][place] == j:\r\n i +=1\r\n rows[row_n][place] = \"x\"\r\n if i == k:\r\n return rows\r\n\r\n return rows\r\n\r\n\r\nn, k = tuple(map(int, input().split()))\r\n\r\nrows = []\r\nfor i in range(n):\r\n rows.append(list(input()))\r\n\r\nalready_have = 0\r\nrows_free_info = []\r\nno_harm = 0\r\nplus_one = 0\r\nplus_two = 0\r\n\r\nfor row_n in range(len(rows)):\r\n row_info = []\r\n for place in range(12):\r\n if rows[row_n][place] in \"P-\":\r\n row_info.append(-1)\r\n\r\n elif rows[row_n][place] in \"S\":\r\n row_info.append(-1)\r\n already_have += count_any_neibours(row_n, place, rows)\r\n else:\r\n st_neib = count_status_neibours(row_n, place, rows)\r\n if st_neib == 0:\r\n no_harm += 1\r\n row_info.append(0)\r\n elif st_neib == 1:\r\n plus_one += 1\r\n row_info.append(1)\r\n else:\r\n plus_two += 1\r\n row_info.append(2)\r\n\r\n rows_free_info.append(row_info)\r\n\r\n\r\nif no_harm>=k:\r\n rows = fill_k_of_j_in_rows(k, 0, rows, rows_free_info)\r\nelif no_harm+plus_one >= k:\r\n already_have += k-no_harm\r\n rows = fill_k_of_j_in_rows(no_harm, 0, rows, rows_free_info)\r\n rows = fill_k_of_j_in_rows(k-no_harm, 1, rows, rows_free_info)\r\n\r\nelse:\r\n already_have += plus_one + 2*(k-no_harm-plus_one)\r\n rows = fill_k_of_j_in_rows(no_harm, 0, rows, rows_free_info)\r\n rows = fill_k_of_j_in_rows(plus_one, 1, rows, rows_free_info)\r\n rows = fill_k_of_j_in_rows(k-no_harm - plus_one, 2, rows, rows_free_info)\r\n\r\n\r\nprint(already_have)\r\n\r\nfor row in rows:\r\n print(''.join(row))\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\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\na = [0]*n\r\ns = 0\r\nx = []\r\nfor i in range(n):\r\n a[i]=input()\r\n for j in range(12):\r\n if a[i][j]=='S':\r\n if j > 0 and (a[i][j-1] == 'S' or a[i][j-1] == 'P'):\r\n s += 1\r\n if j < 11 and (a[i][j+1] == 'S' or a[i][j+1] == 'P'):\r\n s += 1\r\n if a[i][j]=='.':\r\n tx=0\r\n if j > 0 and a[i][j-1] == 'S':\r\n tx += 1\r\n if j < 11 and a[i][j+1] == 'S':\r\n tx += 1\r\n x += [(tx,i,j)]\r\n \r\nx.sort()\r\nfor i in range(k):\r\n a[x[i][1]]=a[x[i][1]][:x[i][2]]+'x'+a[x[i][1]][x[i][2]+1:]\r\n s += x[i][0]\r\n \r\nprint (s)\r\nfor i in a:\r\n print(i) ", "size, passengers = list(map(int, input().split(' ')))\n\n\ndef parsePlane(plane):\n d = {0: [], 1: [], 2: []}\n for col in range(len(plane)):\n for row in range(len(plane[col])):\n for place in range(len(plane[col][row])):\n if plane[col][row][place] == '.':\n if place == 0:\n if plane[col][row][place + 1] == 'S': d[1].append([col, row, place])\n else: d[0].append([col, row, place])\n elif place == len(plane[col][row]) - 1:\n if plane[col][row][place - 1] == 'S': d[1].append([col, row, place])\n else: d[0].append([col, row, place])\n else:\n n = 0\n if plane[col][row][place + 1] == 'S': n += 1\n if plane[col][row][place - 1] == 'S': n += 1\n d[n].append([col, row, place])\n\n return d\n\nplane = []\nfor i in range(size): plane.append([list(x) for x in input().split('-')])\n\nplane = list(map(list, zip(*plane)))\nd = parsePlane(plane)\n\nfor best in d.values():\n if passengers == 0: break\n for place in best:\n if passengers == 0: break\n plane[place[0]][place[1]][place[2]] = 'x'\n passengers -= 1\n\nres = ''\nfor rows in list(zip(*plane)):\n for row in range(0, len(rows)): res += ''.join(rows[row]) + ('-', '')[row == len(rows) - 1]\n res += '\\n'\n\ntotal = 0\nfor i in range(len(res)):\n if res[i] == 'S':\n try: total += (0, 1)[res[i - 1] != '.' and res[i - 1] != '-' and res[i - 1] != '\\n']\n except: pass\n try: total += (0, 1)[res[i + 1] != '.' and res[i + 1] != '-' and res[i + 1] != '\\n']\n except: pass\n\nprint(total)\nprint(res, end='')", "n, k = list(map(int, input().split()))\r\nrows = []\r\nresult = []\r\ncount = 0\r\nfor i in range(n):\r\n row = input()\r\n result_row = \"\"\r\n for j in range(len(row)):\r\n if k > 0 and row[j] == '.' and (j == 0 or row[j - 1] != 'S') and (j == len(row) - 1 or row[j + 1] != 'S'):\r\n result_row += \"x\"\r\n k -= 1\r\n else:\r\n result_row += row[j]\r\n if row[j] == 'S' and j > 0 and (row[j - 1] == 'S' or row[j - 1] == 'P'):\r\n count += 1\r\n if row[j] == 'S' and j < len(row) - 1 and (row[j + 1] == 'S' or row[j + 1] == 'P'):\r\n count += 1\r\n rows.append(result_row)\r\n\r\nif k > 0:\r\n for i in range(n):\r\n row = rows[i]\r\n result_row = \"\"\r\n\r\n for j in range(len(row)):\r\n if k > 0 and row[j] == '.' and ((j == 0 or row[j - 1] != 'S') or (j == len(row) - 1 or row[j + 1] != 'S')):\r\n result_row += \"x\"\r\n k -= 1\r\n count += 1\r\n else:\r\n result_row += row[j]\r\n rows[i] = result_row\r\n if k == 0:\r\n break\r\n\r\nif k > 0:\r\n for i in range(n):\r\n row = rows[i]\r\n result_row = \"\"\r\n\r\n for j in range(len(row)):\r\n if k > 0 and row[j] == '.':\r\n result_row += \"x\"\r\n k -= 1\r\n count += 2\r\n else:\r\n result_row += row[j]\r\n rows[i] = result_row\r\n if k == 0:\r\n break\r\n\r\nprint(count)\r\nfor row in rows:\r\n print(row)\r\n", "n,k = [int(i) for i in input().split()]\r\na = [input() for i in range(n)]\r\nans = 0\r\n\r\ndef countM():\r\n m = 0\r\n for i in range(len(a)):\r\n for j in range(len(a[i])):\r\n if a[i][j] == 'S':\r\n if j > 0 and a[i][j-1] in \"SP\":m+=1\r\n if j < len(a[i])-1 and a[i][j+1] in \"SP\":m+=1\r\n return m\r\ndef go1(a,k):\r\n for i in range(len(a)):\r\n for j in range(len(a[i])):\r\n if a[i][j] == '.':\r\n if j > 0 and a[i][j-1] == 'S':continue\r\n if j < len(a[i])-1 and a[i][j+1] == 'S':continue\r\n k-=1\r\n a[i] = a[i][:j] + 'x' + a[i][j+1:]\r\n if k == 0:return 0\r\n return k\r\n \r\ndef go2(a,k): \r\n global ans\r\n for i in range(len(a)):\r\n for j in range(len(a[i])):\r\n if a[i][j] == '.':\r\n c = 0\r\n if j > 0 and a[i][j-1] == 'S':c+=1\r\n if j < len(a[i])-1 and a[i][j+1] == 'S':c+=1\r\n if c == 2:continue\r\n ans+=1\r\n k-=1\r\n a[i] = a[i][:j] + 'x' + a[i][j+1:]\r\n if k == 0:return 0\r\n return k\r\n \r\ndef go3(a,k):\r\n global ans\r\n for i in range(len(a)):\r\n for j in range(len(a[i])):\r\n if a[i][j] == '.':\r\n ans+=2\r\n k-=1\r\n a[i] = a[i][:j] + 'x' + a[i][j+1:] \r\n if k == 0 : return 0\r\n\r\nm = countM() \r\nif k!= 0:k = go1(a,k)\r\nif k != 0:k = go2(a,k)\r\nif k != 0:go3(a,k)\r\nprint(ans + m)\r\nfor s in a:\r\n print(s)", "n, k = map(int, input().split())\r\nrow = '-'\r\nrow += input()\r\nfor i in range(n-1):\r\n row = row + '-' + input()\r\nrow += '-'\r\n\r\np0 = []\r\np1 = []\r\np2 = []\r\n\r\ncount = 0\r\nlc = ['P', 'x', 'S']\r\nfor i in range(1, (len(row)-1)):\r\n if row[i] == '.':\r\n usl1 = (row[i - 1] == '-' or row[i - 1] == 'P' or row[i - 1] == '.')\r\n usl2 = (row[i + 1] == '.' or row[i + 1] == '-' or row[i + 1] == 'P')\r\n if usl1 and usl2:\r\n p0.append(i)\r\n\r\n elif (usl1 and (row[i+1] == 'S')) or (usl2 and (row[i-1] == 'S')):\r\n p1.append(i)\r\n elif (row[i-1] == 'S') and (row[i+1] == 'S'):\r\n p2.append(i)\r\n\r\nfor i in p0:\r\n if k == 0:\r\n break\r\n row = row[:i]+'x'+row[(i+1):len(row)]\r\n k -= 1\r\nfor i in p1:\r\n if k == 0:\r\n break\r\n row = row[:i] + 'x' + row[(i + 1):len(row)]\r\n k -= 1\r\nfor i in p2:\r\n if k == 0:\r\n break\r\n row = row[:i] + 'x' + row[(i + 1):len(row)]\r\n k -= 1\r\n\r\nsc = row.count('S')\r\nrf = row.find('S')\r\nfor i in range(sc):\r\n if row[rf-1] in lc:\r\n count += 1\r\n if row[rf+1] in lc:\r\n count += 1\r\n\r\n rf = rf+1 + row[rf+1:len(row)].find('S')\r\n\r\nprint(count)\r\nj = 1\r\nfor i in range(n):\r\n print(row[j:j+12])\r\n j += 13", "n, k = (int(i) for i in input().split())\r\nz = [[i for i in input()] for i in range(n)]\r\na1 = []\r\na2 = []\r\na3 = []\r\nr = 0\r\nfor i in range(n):\r\n for j in range(12):\r\n t = 0\r\n t = (j != 0 and z[i][j-1] == 'S') + (j != 11 and z[i][j+1] == 'S')\r\n if z[i][j] == 'P' or z[i][j] == 'S':\r\n r += t\r\n elif z[i][j] == '.':\r\n if t == 0:\r\n a1.append((i, j))\r\n elif t == 1:\r\n a2.append((i, j))\r\n else:\r\n a3.append((i, j))\r\nfor i in a1:\r\n if k != 0:\r\n z[i[0]][i[1]] = 'x'\r\n k -= 1\r\n else:\r\n break\r\nfor i in a2:\r\n if k != 0:\r\n z[i[0]][i[1]] = 'x'\r\n k -= 1\r\n r += 1\r\n else:\r\n break\r\nfor i in a3:\r\n if k != 0:\r\n z[i[0]][i[1]] = 'x'\r\n k -= 1\r\n r += 2\r\n else:\r\n break\r\nprint(r)\r\nfor i in z:\r\n print(*i, sep='')", "def fast(k, a):\r\n ns = [0, 0, 0]\r\n for s in a: #Count max numbers of places with different \"inconveniences\"\r\n s = \"_\"+s+\"_\"\r\n for pr, cur, nxt in zip(s[:-2], s[1:-1], s[2:]):\r\n if cur == '.':\r\n ns[(1 if pr==\"S\" else 0)+(1 if nxt==\"S\" else 0)] += 1\r\n## print(ns)\r\n\r\n for i in range(3): #Calculate plan of inconveniences =)\r\n if k < ns[i]:\r\n ns[i] = k\r\n k -= ns[i]\r\n## print(ns)\r\n \r\n new_a = []\r\n res = 0\r\n for s in a:\r\n new_s = ''\r\n pr = \"_\"\r\n s += \"_\"\r\n for cur, nxt in zip(s[:-1], s[1:]):\r\n if cur == '.':\r\n count = (1 if pr==\"S\" else 0)+(1 if nxt==\"S\" else 0)\r\n if ns[count] > 0:\r\n cur = \"x\"\r\n ns[count]-=1\r\n## print(pr, cur, nxt, res)\r\n if pr==\"S\" and cur in \"PSx\":\r\n res += 1\r\n if pr in \"PSx\" and cur == \"S\":\r\n res += 1\r\n## print(res)\r\n new_s += cur\r\n pr = cur\r\n new_a.append(new_s) \r\n return res, new_a\r\n \r\n## \r\n##\r\n##\r\n##def slow(n, k, a):\r\n## #n, k = [int(x) for x in input().split()] # n - количество рядов, k - количество человек которых нужно рассадить\r\n##\r\n## import itertools as it\r\n## from copy import deepcopy\r\n## bigString = deepcopy(a)\r\n##\r\n## p, m = countN(bigString)\r\n## # print('количество точке ', m)\r\n##\r\n## bestSol = 10000000\r\n## bestCombination = []\r\n## bestText = ''\r\n## for y in it.combinations(range(m), k):\r\n## # print(y)\r\n## curBigString = deepcopy(bigString)\r\n## # print(y)\r\n## # Сформировать новый входной текст\r\n## j = 0\r\n## for s_i, s in enumerate(curBigString):\r\n## for i in range(0, len(s)):\r\n## if s[i] == '.' and j in y:\r\n## s = s[:i] + 'x' + s[i + 1:]\r\n## j += 1\r\n## if s[i] == '.':\r\n## j += 1\r\n## # print(s, j)\r\n## curBigString[s_i] = s\r\n## # print(curBigString)\r\n## cur = countN(curBigString)\r\n## if cur[0] < bestSol:\r\n## bestSol = cur[0]\r\n## bestCombination = y\r\n## bestText = curBigString\r\n## #print(bestSol)\r\n## # print(bestCombination)\r\n## #for s in bestText:\r\n## # print(s)\r\n## return bestSol, bestText\r\n##\r\n##def countN(allStrings):\r\n## # code goes here\r\n## # combinations(range(4), 3) -> (0, 1, 2); (0, 2, 3); (1, 2, 3)) itertools\r\n## n = 0 # количетсво соседей\r\n## numberOfDots = 0\r\n## for s in allStrings: # для каждой строки в тексте\r\n## for i in range(1, len(s) - 1): # для каждого символа в строке со второго до предпоследнего включая концы\r\n## if s[i] == 'S':\r\n## if s[i + 1] in ('P', 'S', 'x'):\r\n## n += 1 # есть сосед справа\r\n## if s[i - 1] in ('P', 'S', 'x'):\r\n## n += 1 # есть сосед слева\r\n## if s[i] == '.':\r\n## numberOfDots += 1\r\n## if s[0] == 'S' and s[1] in ('P', 'S', 'x'):\r\n## n += 1 # в начале сидит крутой и справа есть сосед\r\n## # print('в начале сидит крутой и справа есть сосед')\r\n## if s[len(s) - 1] == 'S' and s[len(s) - 2] in ('P', 'S', 'x'):\r\n## n += 1 # в конце сидит крутой и слева есть сосед\r\n## # print('в конце сидит крутой и слева есть сосед')\r\n## if s[0] == '.':\r\n## numberOfDots += 1\r\n## if s[len(s) - 1] == '.':\r\n## numberOfDots += 1\r\n## return n, numberOfDots\r\n## ### SEREGA, PUT YOUR CODE HERE ###\r\n##\r\n##from random import randint, random\r\n##from itertools import product\r\n##from copy import deepcopy\r\n##while True:\r\n## n = randint(1, 10)\r\n## k = randint(1, 10)\r\n## n_points = min(k+randint(0, 5), n*10)\r\n## n_S = randint(0, n*10-n_points)\r\n## n_P = n*10 - n_points - n_S\r\n## pssgrs = '.'*n_points + 'S'*n_S + 'P'*n_P\r\n## a = []\r\n## for _ in range(n):\r\n## s = ''\r\n## for __ in range(10):\r\n## i = randint(0, len(pssgrs)-1)\r\n## s += pssgrs[i]\r\n## pssgrs = pssgrs[:i] + pssgrs[i+1:]\r\n## a.append(s[:3]+\"-\"+s[3:7]+\"-\"+s[7:])\r\n##\r\n## print(n, k, n_points, n_S, n_P)\r\n## fs, fsa = fast(k, deepcopy(a))\r\n## sl, sla = slow(n, k, deepcopy(a))\r\n## if fs != sl:\r\n## print(fs, sl)\r\n## if fsa != sla:\r\n## print(fsa)\r\n## print(sla)\r\n## assert fs == sl\r\n## print()\r\n## \r\n##\r\n\r\nn, k = [int(x) for x in input().split()]\r\na = [input() for x in range(n)]\r\nc, na = fast(k, a)\r\nprint(c)\r\nfor ns in na:\r\n print(ns)\r\n", "import getpass\r\nimport sys\r\nimport math\r\nimport itertools\r\nimport bisect\r\n\r\n\r\ndef lcm(a, b):\r\n return a * b // math.gcd(a, b)\r\n\r\n\r\ndef ria():\r\n return [int(i) for i in input().split()]\r\n\r\n\r\ndef dr(v):\r\n sm = sum([int(i) for i in str(v)])\r\n return sm if sm < 10 else dr(sm)\r\n\r\n\r\ndef range_sum(a, b):\r\n ass = (((b - a + 1) // 2) * (a + b))\r\n if (a - b) % 2 == 0:\r\n ass += (b - a + 2) // 2\r\n return ass\r\n\r\n\r\ndef comba(n, x):\r\n return (math.factorial(n) // math.factorial(n - x)) // math.factorial(x)\r\n\r\n\r\nfiles = True\r\ndebug = False\r\n\r\nif getpass.getuser() == 'frohenk' and files:\r\n debug = True\r\n sys.stdin = open(\"test.in\")\r\n # sys.stdout = open('test.out', 'w')\r\n pass\r\n\r\nn, k = ria()\r\nar = []\r\nfor i in range(n):\r\n ar.append(list(input().strip()))\r\narar = []\r\nfor nn, row in enumerate(ar):\r\n\r\n for n, i in enumerate(row):\r\n if i != '.':\r\n continue\r\n # print(nn,n)\r\n suma = 0\r\n if n != 0:\r\n suma += 1 if row[n - 1] == 'S' else 0\r\n if n != len(row) - 1:\r\n suma += 1 if row[n + 1] == 'S' else 0\r\n arar.append((suma, nn, n))\r\n\r\narar.sort()\r\nfor i in range(k):\r\n ar[arar[i][1]][arar[i][2]] = 'x'\r\n\r\nsuma = 0\r\n\r\nfor nn, row in enumerate(ar):\r\n\r\n for n, i in enumerate(row):\r\n if i != 'S' and i != 'P' and i != 'x':\r\n continue\r\n if n != 0:\r\n suma += 1 if row[n - 1] == 'S' else 0\r\n if n != len(row) - 1:\r\n suma += 1 if row[n + 1] == 'S' else 0\r\nprint(suma)\r\nfor row in ar:\r\n print(''.join(row))\r\n", "n, k = tuple(map(int, input().split(' ')))\r\ncabin = []\r\nfor i in range(n):\r\n\tcabin.append(list(map(list, input().split('-'))))\r\n\r\nfor line in cabin:\r\n\tfor space in line:\r\n\t\tfor sitnum in range(0, len(space)):\r\n\t\t\tallowed_right = False if sitnum + 1 > len(space)-1 else True\r\n\t\t\tallowed_left = False if sitnum - 1 < 0 else True\r\n\t\t\tif space[sitnum] == 'S':\r\n\t\t\t\tif allowed_left:\r\n\t\t\t\t\tif space[sitnum - 1] == '.':\r\n\t\t\t\t\t\tspace[sitnum - 1] = 'Z'\r\n\t\t\t\t\telif space[sitnum - 1] == 'Z':\r\n\t\t\t\t\t\tspace[sitnum - 1] += 'Z'\r\n\t\t\t\tif allowed_right:\r\n\t\t\t\t\tif space[sitnum + 1] == '.':\r\n\t\t\t\t\t\tspace[sitnum + 1] = 'Z'\r\n\t\t\t\t\telif space[sitnum + 1] == 'Z':\r\n\t\t\t\t\t\tspace[sitnum + 1] += 'Z'\r\n\r\n\r\nfor line in cabin:\r\n\tfor space in line:\r\n\t\tfor sitnum in range(0, len(space)):\r\n\t\t\tif k == 0:\r\n\t\t\t\tbreak\r\n\t\t\tif space[sitnum] == '.':\r\n\t\t\t\t\tspace[sitnum] = 'x'\r\n\t\t\t\t\tk -= 1\r\n\r\nfor line in cabin:\r\n\tfor space in line:\r\n\t\tfor sitnum in range(0, len(space)):\r\n\t\t\tif k == 0:\r\n\t\t\t\tbreak\r\n\t\t\tif space[sitnum] == \"Z\":\r\n\t\t\t\t\tspace[sitnum] = 'x'\r\n\t\t\t\t\tk -= 1\r\n\t\tif k == 0:\r\n\t\t\tbreak\r\nfor line in cabin:\r\n\tfor space in line:\r\n\t\tfor sitnum in range(0, len(space)):\r\n\t\t\tif k == 0:\r\n\t\t\t\tbreak\r\n\t\t\tif space[sitnum] == \"ZZ\":\r\n\t\t\t\t\tspace[sitnum] = 'x'\r\n\t\t\t\t\tk -= 1\r\n\t\tif k == 0:\r\n\t\t\tbreak\r\nfor line in cabin:\r\n\tfor space in line:\r\n\t\tfor sitnum in range(0, len(space)):\r\n\t\t\tif space[sitnum] == 'Z' or space[sitnum] == 'ZZ':\r\n\t\t\t\tspace[sitnum] = '.'\r\n\r\n\r\nsoseds = 0\r\n\r\nfor line in cabin:\r\n\tfor space in line:\r\n\t\tfor sitnum in range(0, len(space)):\r\n\t\t\tallowed_right = False if sitnum + 1 > len(space)-1 else True\r\n\t\t\tallowed_left = False if sitnum - 1 < 0 else True\r\n\t\t\tif space[sitnum] == \"S\":\r\n\t\t\t\tif allowed_left:\r\n\t\t\t\t\tif space[sitnum - 1] != '.':\r\n\t\t\t\t\t\tsoseds += 1\r\n\t\t\t\tif allowed_right:\r\n\t\t\t\t\tif space[sitnum + 1] != '.':\r\n\t\t\t\t\t\tsoseds += 1\r\n\r\nprint(soseds)\r\n\r\nprint('\\n'.join(list(map(lambda y: '-'.join(list(map(lambda x: ''.join(x), y))), cabin))))", "from collections import Counter\r\nn,k=list(map(int,input().split()))\r\n#n,k=1,2\r\na=set()\r\nc=[set() for i in range(3)]\r\nb=set()\r\nz=0\r\nfor i in range(n):\r\n s=input()\r\n for i0 in range(len(s)):\r\n if s[i0]=='.':\r\n a.add(tuple([i,i0]))\r\n elif s[i0]=='S':\r\n b.add(tuple([i,i0]))\r\n for i0 in range(len(s)):\r\n if s[i0]=='.':\r\n zz=0\r\n if tuple([i,i0+1]) in b:\r\n zz=zz+1\r\n if tuple([i,i0-1]) in b:\r\n zz=zz+1\r\n c[zz].add(tuple([i,i0]))\r\nc=list(c[0])+list(c[1])+list(c[2])\r\nfor i in range(k):\r\n a.remove(c[i])\r\nfor i in b:\r\n if (i[1]!=2)and(i[1]!=7)and(i[1]!=11):\r\n if not(tuple([i[0],i[1]+1])in a):\r\n z=z+1\r\n if (i[1]!=4)and(i[1]!=9)and(i[1]!=0):\r\n if not(tuple([i[0],i[1]-1])in a):\r\n z=z+1\r\nc=set(c)\r\n\r\nprint(z)\r\nfor i in range(n):\r\n s=''\r\n for i0 in range(12):\r\n if i0==3 or i0==8:\r\n s=s+'-'\r\n elif tuple([i,i0])in a:\r\n s=s+'.'\r\n elif tuple([i,i0])in b:\r\n s=s+'S'\r\n elif tuple([i,i0])in c:\r\n s=s+'x'\r\n else:\r\n s=s+'P'\r\n print(s)", "FREE, STATUS, COMMON, ADDED, WALL = '.', 'S', 'P', 'x', '#'\nROW_SEATS = 14 # wall, 3, gangway, 4, gangway, 3, wall\n\nn, k = list(map(int, input().split()))\nseats = [list(WALL + input() + WALL) for i in range(n)]\n\nstatus_neis = 0\nfree_seats = []\nfor i, row in enumerate(seats):\n for j in range(1, ROW_SEATS - 1):\n if row[j] == STATUS:\n status_neis += sum(row[j + c] in [STATUS, COMMON]\n for c in [-1, 1])\n elif row[j] == FREE:\n cnt = sum(row[j + c] == STATUS for c in [-1, 1])\n free_seats.append((cnt, (i, j)))\n\nfor cnt, (row, col) in sorted(free_seats)[:k]:\n status_neis += cnt\n seats[row][col] = ADDED\nprint(status_neis)\nfor row in seats:\n print(''.join(row[1:-1]))\n \n\n", "n, x = map(int, input().split())\nk = []\nsans = []\nfor i in range(n):\n s = input()\n sans.append(list(s))\n k.append([0 for i in range(12)])\n if (s[0] in '-PS'):\n k[-1][0] = -1\n else:\n k[-1][0] = int(s[1] == 'S')\n for j in range(1, 11):\n if (s[j] in '-PS'):\n k[-1][j] = -1\n else:\n k[-1][j] = int(s[j - 1] == 'S') + int(s[j + 1] == 'S')\n if (s[11] in '-PS'):\n k[-1][11] = -1\n else:\n k[-1][11] = int(s[10] == 'S')\n#print(*k, sep='\\n')\nfor w in range(3):\n for i in range(n):\n for j in range(12):\n if (x > 0 and k[i][j] == w):\n x -= 1\n sans[i][j] = 'x'\n k[i][j] = -3\nans = 0\nfor i in sans:\n ans += int(i[0] == 'S' and i[1] not in '.-')\n for j in range(1, 11):\n ans += int(i[j] == 'S' and i[j + 1] not in '.-')\n ans += int(i[j] == 'S' and i[j - 1] not in '.-')\n ans += int((i[11] == 'S' and (i[10] not in '.-')))\nprint(ans)\n\nfor i in sans:\n print(''.join(i))\n\n", "# одиночные места\r\ndef place_free(kill):\r\n\tfor i in range(len(place)):\r\n\t\tfor j in range(len(place[i])):\r\n\t\t\tif (kill > 0) and (place[i][j] == '.'):\r\n\t\t\t\tif (place[i][j-1] != 'S') and (place[i][j+1] != 'S'):\r\n\t\t\t\t\tplace[i][j] = 'x'\r\n\t\t\t\t\tkill -= 1\r\n\tif kill > 0:\r\n\t\tplace_one(kill)\r\n\r\n# места с одним статусным\r\ndef place_one(kill):\r\n\tfor i in range(len(place)):\r\n\t\tfor j in range(len(place[i])):\r\n\t\t\tif (kill > 0) and (place[i][j] == '.'):\r\n\t\t\t\tif (( (place[i][j-1] == 'S') or (place[i][j+1] == 'S') ) and not( (place[i][j-1] == 'S') and (place[i][j+1] == 'S') )):\r\n\t\t\t\t\tplace[i][j] = 'x'\r\n\t\t\t\t\tkill -= 1\r\n\tif kill > 0:\r\n\t\tplace_two(kill)\r\n\r\n# места с двумя статусными\r\ndef place_two(kill):\r\n\tfor i in range(len(place)):\r\n\t\tfor j in range(len(place[i])):\r\n\t\t\tif (kill > 0) and (place[i][j] == '.'):\r\n\t\t\t\tplace[i][j] = 'x'\r\n\t\t\t\tkill -= 1\r\n\r\n# посчёт соседей у статусных\r\ndef score_S():\r\n\tcount = 0\r\n\tfor i in range(len(place)):\r\n\t\tfor j in range(len(place[i])):\r\n\t\t\tif (place[i][j] == 'S'):\r\n\t\t\t\tif (place[i][j-1] == 'x') or (place[i][j-1] == 'P') or (place[i][j-1] == 'S'):\r\n\t\t\t\t\tcount += 1\r\n\t\t\t\tif (place[i][j+1] == 'x') or (place[i][j+1] == 'P') or (place[i][j+1] == 'S'):\r\n\t\t\t\t\tcount += 1\r\n\treturn count\r\n\r\n\r\n# входные данные\r\nn, k = map(int, input().split())\r\nplace = []\r\nfor i in range(n):\r\n\tplace.append(list('-'+input()+'-'))\r\n\r\n# понеслась жара\r\nplace_free(k)\r\n\r\n# вывод\r\nprint(score_S())\r\nfor i in range(n):\r\n\tstr_place = ''\r\n\tfor j in place[i]:\r\n\t\tstr_place += j\r\n\tprint(str_place[1:-1])", "n, k = list(map(int, input().split(' ')))\nmatrix = []\n\nvip_ctriterea = 0\n\nwhile n > 0:\n\tmatrix.append(list(input()))\n\tn -= 1\n\n\ndef find_neighbours(row, index, mask = 'S'):\n\tleft = '-'\n\tright = '-'\n\n\tif index:\n\t\tleft = row[index-1]\n\n\ttry:\n\t\tright = row[index+1]\n\texcept:\n\t\tpass\n\n\tif left in mask and right in mask:\n\t\treturn 2\n\n\tif left in mask or right in mask:\n\t\treturn 1\n\n\telse:\n\t\treturn 0\n\n\ndef find_seat(row):\n\tglobal vip_ctriterea\n\tglobal k\n\n\tfor seat in range(len(row)):\n\t\tif k == 0:\n\t\t\treturn\n\t\tif row[seat] == '.':\n\t\t\tif find_neighbours(row, seat) == vip_ctriterea:\n\t\t\t\trow[seat] = 'x'\n\t\t\t\tk -= 1\n\ndef display(matrix):\n\tfor row in matrix:\n\t\tprint(''.join(row))\n\n\ndef itter_matrix(matrix):\n\tglobal k\n\tglobal vip_ctriterea\n\n\twhile k != 0:\n\t\tfor row in matrix:\n\t\t\tfind_seat(row)\n\t\tvip_ctriterea += 1\n\n\tneighbours = 0\n\tfor row in matrix:\n\t\ti = 0\n\t\twhile i < len(row):\n\t\t\tif row[i] == 'S':\n\t\t\t\tneighbours += find_neighbours(row, i, 'SPx')\n\t\t\ti += 1\n\n\tprint(neighbours)\n\tdisplay(matrix)\n\n\nitter_matrix(matrix)", "line_1 = input()\n\nn = int(line_1.split(\" \")[0])\nk = int(line_1.split(\" \")[1])\nx = list()\n\nk_copy = k\nline_size = 14\n\n\nfor i in range(n):\n x.append('-' + input() + '-')\n\nlink_number = 2\nflag = False\nfor links in range(link_number + 1):\n for i in range(n):\n for j in range(line_size):\n if x[i][j] != '.':\n continue\n\n else:\n if k_copy == 0:\n flag = True\n break\n\n temp = 0\n temp1 = x[i][j - 1]\n temp2 = x[i][j + 1]\n\n if x[i][j - 1] == 'S':\n temp += 1\n\n if x[i][j + 1] == 'S':\n temp += 1\n\n if temp == links:\n # x[i][j] = 'x'\n new = list(x[i])\n new[j] = 'x'\n x[i] = ''.join(new)\n\n k_copy -= 1\n\n if flag:\n break\n\n if flag:\n break\n\ncount = 0\nfor i in range(n):\n for j in range(line_size):\n if x[i][j] != 'S':\n continue\n\n if x[i][j - 1] != '-' and x[i][j - 1] != '.':\n count += 1\n\n if x[i][j + 1] != '-' and x[i][j + 1] != '.':\n count += 1\n\n\nprint(count)\nfor i in range(n):\n print(x[i][1:-1])\n", "n, k = map(int, input().split())\n\nss = []\n\nr = [0, 0, 0]\n\nt = 0\n\nPASSENGERS = ('x', 'P', 'S')\n\n# - is 0\n# . is 1\n# P is 10\n# S is 11\n\nfor i in range(n):\n s = input()\n for c in s:\n ss.append(c)\n ss.append('\\n')\n\nfor i in range(len(ss)):\n if ss[i] == '.':\n rank = 0\n if i > 0 and ss[i-1] == 'S': rank += 1\n if i+1 < len(ss) and ss[i+1] == 'S': rank += 1\n ss[i] = str(rank)\n r[rank] += 1\n\nif k > r[0]:\n k -= r[0]\n if k > r[1]:\n k -= r[1]\n r[2] = k\n else:\n r[1] = k\n r[2] = 0\nelse:\n r[0] = k\n r[1] = 0\n r[2] = 0\n\ni = 0\nwhile r[0] > 0:\n while ss[i] != '0':\n i += 1\n ss[i] = 'x'\n r[0] -= 1\n\ni = 0\nwhile r[1] > 0:\n while ss[i] != '1':\n i += 1\n ss[i] = 'x'\n r[1] -= 1\n\ni = 0\nwhile r[2] > 0:\n while ss[i] != '2':\n i += 1\n ss[i] = 'x'\n r[2] -= 1\n\nfor i in range(len(ss)):\n if ss[i] in ('0', '1', '2'):\n ss[i] = '.'\n\nfor i in range(len(ss)):\n if ss[i] == 'S':\n if i > 0 and (ss[i-1] in PASSENGERS):\n t += 1\n if i+1 < len(ss) and (ss[i+1] in PASSENGERS):\n t += 1\n\nprint(t)\nprint(''.join(ss))", "def is_letter(char):\r\n return (\r\n ord('a') <= ord(char) <= ord('z') or\r\n ord('A') <= ord(char) <= ord('Z')\r\n )\r\n\r\nn, kk = map(int, input().split())\r\nplacement = [\r\n [i for i in input()] for j in range(n)\r\n]\r\n\r\n\r\nkc = 0 \r\n\r\nfor row in placement:\r\n for i in range(len(row)):\r\n if (row[i] == '.'):\r\n count = 0\r\n if (i > 0 and row[i - 1] == 'S'):\r\n count += 1\r\n if (i < len(row) - 1 and row[i + 1] == 'S'):\r\n count += 1\r\n row[i] = count\r\n if (row[i] == 'S'):\r\n if (i > 0 and is_letter(str(row[i - 1]))):\r\n kc += 1\r\n if (i < len(row) - 1 and is_letter(str(row[i + 1]))):\r\n kc += 1\r\n \r\nfor i in range(3):\r\n for j in range(len(placement)):\r\n if (kk == 0):\r\n # print(f'broken here {i}, {j}') \r\n break\r\n for k in range(len(placement[j])):\r\n if placement[j][k] == i:\r\n placement[j][k] = 'x'\r\n kc += i\r\n kk -= 1\r\n if (kk == 0):\r\n # print(\"broken\") \r\n break\r\n\r\nkkk = 0\r\n\r\nfor i in range(len(placement)):\r\n for j in range(len(placement[i])):\r\n if type(placement[i][j]) == type(1):\r\n placement[i][j] = '.'\r\n\r\nprint(kc)\r\nfor row in placement:\r\n print(''.join(row))", "n, k = map(int, input().split())\r\na = b = sits = \"\"\r\n\r\nfor _ in range(n):\r\n sits += \"+\"+input()+\"+\"\r\n\r\nsits = list(sits)\r\n\r\nlength = len(sits)\r\n\r\nperfect = []\r\nok = []\r\nbad = []\r\n\r\nneighbors = 0\r\n\r\nfor i in range(length):\r\n\r\n if sits[i] == \"S\":\r\n a, b = sits[i - 1], sits[i + 1]\r\n a, b = sits[i - 1], sits[i + 1]\r\n st = \"\".join([a, b])\r\n neighbors += st.count(\"S\")\r\n neighbors += st.count(\"P\")\r\n continue\r\n\r\n if sits[i] != \".\":\r\n continue\r\n\r\n a, b = sits[i - 1], sits[i + 1]\r\n s = \"\".join([a, b]).count(\"S\")\r\n if s == 0:\r\n perfect.append(i)\r\n elif s == 1:\r\n ok.append(i)\r\n else:\r\n bad.append(i)\r\n\r\nfor index in perfect:\r\n if k <= 0:\r\n break\r\n sits[index] = \"x\"\r\n k -= 1\r\n\r\nfor index in ok:\r\n if k <= 0:\r\n break\r\n sits[index] = \"x\"\r\n k -= 1\r\n neighbors += 1\r\n\r\nfor index in bad:\r\n if k <= 0:\r\n break\r\n sits[index] = \"x\"\r\n k -= 1\r\n neighbors += 2\r\n\r\nanswer = \"\".join(sits).split(\"+\")\r\n\r\nprint(neighbors)\r\nfor item in answer:\r\n if item != \"\":\r\n print(item)\r\n", "n,k=map(int,input().split())\r\ns=[]\r\nans=0\r\np=[]\r\nfor i in range(n):\r\n s.append(['-']+list(input())+['-'])\r\n for j in range(1,13):\r\n if s[i][j]=='S':\r\n if s[i][j+1] in 'SP': ans+=1\r\n if s[i][j-1] in 'SP': ans+=1\r\n elif s[i][j]=='.':\r\n p.append([0,i,j])\r\n if s[i][j+1] =='S': p[-1][0]+=1\r\n if s[i][j-1] == 'S': p[-1][0]+=1\r\np.sort()\r\nfor x in range(k):\r\n pl,i,j=p[x]\r\n ans+=pl\r\n s[i][j]='x'\r\nprint(ans)\r\n[print(''.join(i[1:-1])) for i in s]", "s = []\r\nindxs = []\r\nn, k = map(int, input().split())\r\nt = 0\r\nfor i in range(n):\r\n row = list(input().upper())\r\n ind = []\r\n for j in range(len(row)):\r\n if row[j] == '.':\r\n ind.append(j)\r\n elif row[j] == 'S':\r\n if j > 0 and (row[j - 1] == 'P' or row[j - 1] == 'S'): t += 1\r\n if j < 11 and (row[j + 1] == 'P' or row[j + 1] == 'S'): t += 1\r\n row[3] = 'P'\r\n row[8] = 'P'\r\n indxs.append(ind)\r\n s.append(row)\r\n\r\nfor i in range(n):\r\n j = 0\r\n while True:\r\n if k == 0 or j == len(indxs[i]): break\r\n if indxs[i][j] > 0:\r\n if s[i][indxs[i][j] - 1] == 'S':\r\n j += 1\r\n continue\r\n if indxs[i][j] < 11:\r\n if s[i][indxs[i][j] + 1] == 'S':\r\n j += 1\r\n continue\r\n s[i][indxs[i][j]] = 'x'\r\n indxs[i].pop(j)\r\n k -= 1\r\n\r\nfor i in range(n):\r\n j = 0\r\n while True:\r\n if k == 0 or j == len(indxs[i]): break\r\n if indxs[i][j] > 0 and indxs[i][j] < 11:\r\n if (s[i][indxs[i][j] - 1] == 'S' and s[i][indxs[i][j] + 1] == 'S'):\r\n j += 1\r\n continue\r\n t += 1\r\n k -= 1\r\n s[i][indxs[i][j]] = 'x'\r\n indxs[i].pop(j)\r\n\r\nfor i in range(n):\r\n for j in indxs[i]:\r\n if k == 0: break\r\n s[i][j] = 'x'\r\n t += 2\r\n k -= 1\r\n\r\nprint(t)\r\nfor row in s:\r\n row[3] = '-'\r\n row[8] = '-'\r\n for i in row:\r\n print(i, end='')\r\n print()", "n, k = map(int, input().split())\r\nr = list()\r\nfor i in range(n):\r\n r.append(['-'] + list(input()) + ['-'])\r\nfor i in range(n):\r\n if k == 0:\r\n break\r\n for j in range(1, 13):\r\n if r[i][j] == '.':\r\n if (r[i][j - 1] != 'S') and (r[i][j + 1] != 'S'):\r\n r[i][j] = \"x\"\r\n k -= 1\r\n if k == 0:\r\n break\r\nfor i in range(n):\r\n if k == 0:\r\n break\r\n for j in range(1, 13):\r\n if r[i][j] == '.':\r\n if ((r[i][j - 1] == 'S') or (r[i][j + 1] == 'S')) and (r[i][j - 1] != r[i][j + 1]):\r\n r[i][j] = 'x'\r\n k -= 1\r\n if k == 0:\r\n break\r\nfor i in range(n):\r\n if k == 0:\r\n break\r\n for j in range(1, 13):\r\n if r[i][j] == '.':\r\n r[i][j] = 'x'\r\n k -= 1\r\n if k == 0:\r\n break\r\n\r\ncount1 = 0\r\nfor i in range(n):\r\n for j in range(1, 13):\r\n if r[i][j] == 'S':\r\n if (r[i][j - 1] == 'P') or (r[i][j - 1] == 'x') or (r[i][j - 1] == 'S'):\r\n count1 += 1\r\n if (r[i][j + 1] == 'P') or (r[i][j + 1] == 'x') or (r[i][j + 1] == 'S'):\r\n count1 += 1\r\nprint(count1)\r\nfor i in range(n):\r\n for j in range(1, 13):\r\n print(r[i][j], end='')\r\n print(\"\")", "def xor(a,b):\r\n return a!=b\r\nq=('P','S')\r\nn,k=map(int,input().split())\r\nc0=c1=c2=0\r\nans=0\r\na=[]\r\nfor i in range(n):\r\n s=input()\r\n for j in range(1,11):\r\n if s[j]=='.':\r\n if s[j-1]=='S' and s[j+1]=='S':\r\n c2+=1\r\n elif xor(s[j-1]=='S',s[j+1]=='S'):\r\n c1+=1\r\n else:\r\n c0+=1\r\n if s[j]=='S':\r\n ans+=(s[j-1] in q) + (s[j+1] in q)\r\n if s[0]=='S' and s[1] in q:\r\n ans+=1\r\n if s[11]=='S' and s[10] in q:\r\n ans+=1\r\n if s[0]=='.':\r\n if s[1]=='S':\r\n c1+=1\r\n else:\r\n c0+=1\r\n if s[11]=='.':\r\n if s[10]=='S':\r\n c1+=1\r\n else:\r\n c0+=1\r\n a.append(s)\r\nif k>c0:\r\n k-=c0\r\n if k>c1:\r\n k-=c1\r\n c2=k\r\n else:\r\n c1=k\r\n c2=0\r\nelse:\r\n c0=k\r\n c1=0\r\n c2=0\r\nprint(ans+c1*1+c2*2)\r\nfor i in range(n):\r\n s=a[i]\r\n for j in range(1,11):\r\n if s[j]=='.':\r\n if c2 and s[j-1]=='S' and s[j+1]=='S':\r\n s=s[:j]+'x'+s[j+1:]\r\n c2-=1\r\n elif c1 and xor(s[j-1]=='S',s[j+1]=='S'):\r\n s=s[:j]+'x'+s[j+1:]\r\n c1-=1\r\n elif c0 and s[j-1]!='S' and s[j+1]!='S':\r\n s=s[:j]+'x'+s[j+1:]\r\n c0-=1\r\n if s[0]=='.':\r\n if c1 and s[1]=='S':\r\n s='x'+s[1:]\r\n c1-=1\r\n elif c0 and s[1]!='S':\r\n s='x'+s[1:]\r\n c0-=1\r\n if s[11]=='.':\r\n if c1 and s[10]=='S':\r\n s=s[:11]+'x'\r\n c1-=1\r\n elif c0 and s[10]!='S':\r\n s=s[:11]+'x'\r\n c0-=1\r\n a[i]=s\r\nfor i in a:\r\n print(i)\r\n", "n, k = map(int, input().split())\r\njet = [list(map(str, input())) for i in range(n)]\r\n\r\nhigh_priority_place = 0\r\nmedium_priority_place = 0\r\nlow_priority_place = 0\r\n\r\npriority = [[0] * 12 for i in range(n)]\r\n\r\nfor i in range(n):\r\n for j in range(12):\r\n if jet[i][j] == '.':\r\n s = 0\r\n if j > 0:\r\n if jet[i][j - 1] == 'S':\r\n s += 1\r\n if j < 11:\r\n if jet[i][j + 1] == 'S':\r\n s += 1\r\n\r\n if s == 0:\r\n high_priority_place += 1\r\n priority[i][j] = 3\r\n if s == 1:\r\n medium_priority_place += 1\r\n priority[i][j] = 2\r\n if s == 2:\r\n low_priority_place += 1\r\n priority[i][j] = 1\r\n\r\nneed_place = k\r\nneighbors = 0\r\n\r\nfor i in range(n):\r\n for j in range(12):\r\n if high_priority_place and need_place:\r\n if priority[i][j] == 3:\r\n priority[i][j] = 'yes'\r\n need_place -= 1\r\n high_priority_place -= 1\r\n else:\r\n break\r\n\r\nfor i in range(n):\r\n for j in range(12):\r\n if medium_priority_place and need_place:\r\n if priority[i][j] == 2:\r\n priority[i][j] = 'yes'\r\n need_place -= 1\r\n medium_priority_place -= 1\r\n else:\r\n break\r\n\r\nfor i in range(n):\r\n for j in range(12):\r\n if low_priority_place and need_place:\r\n if priority[i][j] == 1:\r\n priority[i][j] = 'yes'\r\n need_place -= 1\r\n low_priority_place -= 1\r\n else:\r\n break\r\n\r\nfor i in range(n):\r\n for j in range(12):\r\n if priority[i][j] == 'yes':\r\n jet[i][j] = 'x'\r\n\r\nfor i in range(n):\r\n for j in range(12):\r\n if jet[i][j] == 'S':\r\n if j > 0:\r\n if jet[i][j - 1] == 'P' or jet[i][j - 1] == 'x' or jet[i][j - 1] == 'S':\r\n neighbors += 1\r\n if j < 11:\r\n if jet[i][j + 1] == 'P' or jet[i][j + 1] == 'x' or jet[i][j + 1] == 'S':\r\n neighbors += 1\r\n\r\nprint(neighbors)\r\nfor i in range(n):\r\n print(''.join(jet[i]))\r\n", "n,k=map(int, input().split())\r\na = [input().split() for i in range(n)]\r\nb=[]\r\nfor i in range(n):\r\n row=str(a[i])\r\n q=[]\r\n q.append(6)\r\n for elem in row:\r\n if elem!=\"\\'\" and elem!=\"[\" and elem!=\"]\":\r\n if elem==\"S\":\r\n q.append(1)\r\n elif elem==\"P\":\r\n q.append(2)\r\n elif elem==\".\":\r\n q.append(3)\r\n elif elem==\"-\":\r\n q.append(4)\r\n q.append(6)\r\n b.append(q)\r\n\r\nfor i in range(n):\r\n row=b[i]\r\n for j in range(1,13):\r\n if row[j]==3 and row[j+1]!=1 and row[j-1]!=1:\r\n row[j]=5\r\n k-=1\r\n if k==0:\r\n break\r\n if k==0:\r\n break \r\nif k!=0:\r\n for i in range(n):\r\n row=b[i]\r\n for j in range(1,13):\r\n if row[j]==3 and row[j+1]!=1 and row[j-1]==1:\r\n row[j]=5\r\n k-=1\r\n if k==0:\r\n break\r\n if k==0:\r\n break\r\n \r\nif k!=0:\r\n for i in range(n):\r\n row=b[i]\r\n for j in range(1,13):\r\n if row[j]==3 and row[j+1]==1 and row[j-1]!=1:\r\n row[j]=5\r\n k-=1\r\n if k==0:\r\n break\r\n if k==0:\r\n break\r\n \r\nif k!=0:\r\n for i in range(n):\r\n row=b[i]\r\n for j in range(1,13):\r\n if row[j]==3 and row[j+1]==1 and row[j-1]==1:\r\n row[j]=5\r\n k-=1\r\n if k==0:\r\n break\r\n if k==0:\r\n break\r\n \r\nsosedi=0\r\nfor i in range(n):\r\n row=b[i]\r\n for j in range(1,13):\r\n if row[j]==1:\r\n if row[j-1]==5 or row[j-1]==2 or row[j-1]==1:\r\n sosedi+=1\r\n if row[j+1]==5 or row[j+1]==2 or row[j+1]==1:\r\n sosedi+=1\r\nprint(sosedi)\r\na=[]\r\nfor i in range(n):\r\n row=b[i]\r\n q=[]\r\n for j in range(1,13):\r\n if row[j]==1:\r\n q.append(\"S\")\r\n if row[j]==2:\r\n q.append(\"P\")\r\n if row[j]==3:\r\n q.append(\".\")\r\n if row[j]==4:\r\n q.append(\"-\")\r\n if row[j]==5:\r\n q.append(\"x\")\r\n a.append(q) \r\nfor row in a:\r\n print(''.join([str(elem) for elem in row]))", "def main():\n n, k = tuple(map(int, input().split()))\n plane = [list('-' + input() + '-') for __ in range(n)]\n\n cnt = [0] * 3\n\n for row in plane:\n for i in range(1, 13):\n if row[i] == '.':\n type = sum(a == 'S' for a in (row[i-1:i+2:2]))\n row[i] = str(type)\n cnt[type] += 1\n \n for i in range(3):\n if cnt[i] <= k:\n k -= cnt[i]\n else:\n cnt[i] = k\n k = 0\n\n answer = 0\n for row in plane:\n for i in range(1, 13):\n if row[i] in '012':\n type = int(row[i])\n if cnt[type]:\n cnt[type] -= 1\n row[i] = 'x'\n else:\n row[i] = '.'\n \n for (prev, curr, next) in zip(row, row[1:], row[2:]):\n if curr == 'S':\n answer += sum(a in 'PSx' for a in (prev, next))\n\n print(answer)\n for row in plane:\n print(\"\".join(row[1:-1]))\n\n\nmain()\n", "def main():\r\n min_uncomfortably = 0\r\n n, k = map(int, input().split())\r\n convenience = []\r\n line = ['-'] * n\r\n for i in range(n):\r\n line[i] = ['-'] + list(input()) + ['-']\r\n for j in range(1, 13):\r\n if line[i][j] == '.':\r\n convenience_add = 0\r\n if line[i][j - 1] == 'S':\r\n convenience_add += 1\r\n if line[i][j + 1] == 'S':\r\n convenience_add += 1\r\n convenience.append((convenience_add, i, j))\r\n if line[i][j] == 'S':\r\n if (line[i][j - 1] == 'P') or (line[i][j - 1] == 'S'):\r\n min_uncomfortably += 1\r\n if (line[i][j + 1] == 'P') or (line[i][j + 1] == 'S'):\r\n min_uncomfortably += 1 \r\n convenience.sort()\r\n for i in range(k):\r\n min_uncomfortably += convenience[i][0]\r\n line[convenience[i][1]][convenience[i][2]] = 'x'\r\n print(min_uncomfortably)\r\n for i in range(n):\r\n print(''.join(line[i][1:13]))\r\n\r\n\r\nmain()", "from collections import defaultdict\r\n\r\nrow_length = 3 + 1 + 4 + 1 + 3\r\n\r\ndef classify_seats(rows):\r\n by_score = defaultdict(set)\r\n for i, row in enumerate(rows):\r\n score = [0] * (1 + row_length + 1)\r\n for j, c in enumerate(row):\r\n if c == 'S':\r\n score[j] += 1\r\n score[j + 2] += 1\r\n for j, (c, s) in enumerate(zip(row, score[1:-1])):\r\n if c == '.':\r\n by_score[s].add((i, j))\r\n return by_score\r\n\r\ndef allocate_passengers(k, by_score):\r\n used = set()\r\n for _ in range(k):\r\n if by_score[0]:\r\n src = by_score[0]\r\n elif by_score[1]:\r\n src = by_score[1]\r\n else:\r\n src = by_score[2]\r\n elem = src.pop()\r\n used.add(elem)\r\n return used\r\n\r\ndef compute_neighbors(rows):\r\n cnt = 0\r\n for i, row in enumerate(rows):\r\n score = [0] * (1 + row_length + 1)\r\n for j, c in enumerate(row):\r\n if c == 'S':\r\n score[j] += 1\r\n score[j + 2] += 1\r\n for j, (c, s) in enumerate(zip(row, score[1:-1])):\r\n if c in 'PSx':\r\n cnt += s\r\n return cnt\r\n\r\nn, k = [int(v) for v in input().split()]\r\nrows = [input().strip() for _ in range(n)]\r\n\r\nused = allocate_passengers(k, classify_seats(rows))\r\nrows = [\r\n ''.join(\r\n ('x' if (i, j) in used else c) for j, c in enumerate(row)\r\n ) for i, row in enumerate(rows)\r\n]\r\ncnt = compute_neighbors(rows)\r\n\r\nprint(cnt)\r\nprint('\\n'.join(rows))\r\n", "k,n = map(int, input().split())\r\nans = []\r\nfor _ in range(3):\r\n ans.append([])\r\nplane = []\r\nc = 0\r\nfor i in range(k):\r\n s = input()\r\n plane.append(list(s))\r\n for j in range(len(s)):\r\n if s[j] == '.':\r\n if j == 0:\r\n if s[1] == 'S':\r\n ans[1].append([i,j])\r\n else:\r\n ans[0].append([i,j])\r\n elif j == 11:\r\n if s[10] == 'S':\r\n ans[1].append([i,j])\r\n else:\r\n ans[0].append([i,j])\r\n else:\r\n ans[s[j-1:j+2].count('S')].append([i,j])\r\n\r\nfor i in range(n):\r\n if len(ans[0]) > 0:\r\n plane[ans[0][0][0]][ans[0][0][1]] = 'x'\r\n ans[0].pop(0)\r\n elif len(ans[1]) > 0:\r\n plane[ans[1][0][0]][ans[1][0][1]] = 'x'\r\n ans[1].pop(0)\r\n else:\r\n plane[ans[2][0][0]][ans[2][0][1]] = 'x'\r\n ans[2].pop(0)\r\nc = 0\r\nfor i in plane:\r\n for j in range(len(i)):\r\n if i[j] == 'S':\r\n if j == 0:\r\n if i[1] in 'xSP':\r\n c+=1\r\n elif j == 11:\r\n if i[10] in 'xSP':\r\n c+=1\r\n else:\r\n if i[j-1] in 'xSP':\r\n c+=1\r\n if i[j+1] in 'xSP':\r\n c+=1\r\nprint(c)\r\nfor i in plane:\r\n print(''.join(i))\r\n", "n,k=input().split()\r\nn,k=int(n),int(k)\r\nS=[0]*n\r\nfor i in range(n):\r\n S[i]=['']*14\r\n Strin=str(input())\r\n for j in range(12):\r\n S[i][j+1]=Strin[j]\r\n S[i][0]='-'\r\n S[i][13]='-'\r\nnoneplace=0\r\noneplace=0\r\ntwoplace=0\r\nneydobstwo=0\r\nfor i in range(n):\r\n for j in range(14):\r\n if S[i][j]=='.':\r\n if S[i][j-1]=='S' and S[i][j+1]=='S':\r\n twoplace+=1\r\n elif S[i][j-1]=='S' or S[i][j+1]=='S':\r\n oneplace+=1\r\n else:\r\n noneplace+=1\r\n if S[i][j]=='S':\r\n if S[i][j-1]=='S' or S[i][j-1]=='P':\r\n neydobstwo+=1\r\n if S[i][j+1]=='S' or S[i][j+1]=='P':\r\n neydobstwo+=1\r\n \r\nk,noneplace=max(0,k-noneplace),min(k,noneplace)\r\nk,oneplace=max(0,k-oneplace),min(k,oneplace)\r\nk,twoplace=max(0,k-twoplace),min(k,twoplace)\r\n\r\nprint(neydobstwo+2*twoplace+oneplace)\r\n\r\nfor i in range(n):\r\n for j in range(1,13):\r\n if S[i][j]=='.':\r\n if S[i][j-1]=='S' and S[i][j+1]=='S':\r\n if twoplace>0:\r\n twoplace-=1\r\n S[i][j]='x'\r\n elif S[i][j-1]=='S' or S[i][j+1]=='S':\r\n if oneplace>0:\r\n oneplace-=1\r\n S[i][j]='x'\r\n else:\r\n if noneplace>0:\r\n noneplace-=1\r\n S[i][j]='x'\r\n print(S[i][j],end='')\r\n print('') \r\n \r\n \r\n" ]

[ "\r\nn = int(input())\r\nl = list(map(int,input().split()))\r\n\r\nl.sort()\r\nfor i in range(n-1):\r\n\tif i % 2 == 0:\r\n\t\tl.pop()\r\n\telse:\r\n\t\tl.pop(0)\r\n\r\nfor i in l:\r\n\tprint(i)", "t_moves=int(input())\r\nmoves=t_moves-1\r\n\r\na=list(map(int, input().split()))\r\na.sort()\r\n\r\ni=0;j=t_moves-1\r\nwhile moves:\r\n\tif moves==1:\r\n\t\tj-=1\r\n\t\tmoves-=1\r\n\telse:\r\n\t\tj-=1;i+=1\r\n\t\tmoves-=2\r\nprint(a[j])", "n=int(input())\r\nli=list(map(int,input().split()))\r\ni=1\r\nwhile i<n:\r\n k=max(li)\r\n li.remove(k)\r\n i+=1\r\n if i<n:\r\n k1=min(li)\r\n li.remove(k1)\r\n i+=1\r\nprint(*li)", "def a_game(n):\n a = len(n)\n i = 0\n\n while i < a - 1:\n if i % 2 == 0:\n n.remove(max(n))\n else:\n n.remove(min(n))\n\n i += 1\n\n print(n[0])\n\nif __name__ == \"__main__\":\n _ = input()\n n = list(map(int, input().split(' ')))\n a_game(n)\n", "n=int(input())\r\nli=[int(i) for i in input().split()]\r\ni=0\r\nwhile(len(li)!=1):\r\n if i%2==0:\r\n li.remove(max(li))\r\n else:\r\n li.remove(min(li))\r\n i+=1\r\nprint(*li)\r\n \r\n", "n = int(input())\r\nlst = sorted(list(map(int, input().split())))\r\n\r\nprint(lst[n // 2] if n % 2 != 0 else lst[n // 2 - 1])", "n = int(input())\r\na = list(map(int, input().split()))\r\nt = 1\r\nk = len(a)\r\nwhile t < k: \r\n if t%2 != 0:\r\n a.remove(max(a))\r\n\r\n elif t%2 == 0:\r\n a.remove(min(a))\r\n t = t+1\r\nprint(a[0])\r\n", "n = int(input())\r\nl = [int(i) for i in input().split()]\r\nl.sort()\r\nif n % 2 == 0:\r\n print(l[n//2-1])\r\nelse:\r\n print(l[n//2])\r\n ", "n = int(input())\r\nnums = list(map(int, input().split()))\r\nnums.sort(reverse=True)\r\nfor i in range(1,n):\r\n if i%2 !=0:\r\n nums.remove(nums[0])\r\n else:\r\n nums.remove(nums[-1])\r\nprint(nums[0])", "n = int(input())\r\nlst = sorted(list(map(int, input().split())))\r\n\r\nmid = (n-1)//2\r\n\r\nprint(lst[mid])\r\n", "n=int(input())\r\na=[int(x) for x in input().split()]\r\nflag=True\r\nfor i in range(n-1):\r\n if flag:\r\n flag=False\r\n a.remove(max(a))\r\n else:\r\n flag=True\r\n a.remove(min(a))\r\n\r\nfor i in range(len(a)):\r\n print(a[i])", "import math\n\nif __name__ == \"__main__\":\n n = int(input())\n numbers = sorted(map(int, input().split()))\n\n if n % 2 == 1:\n print(numbers[n // 2])\n else:\n print(numbers[n // 2 - 1])\n", "n=int(input())\narr = list(map(int, input().rstrip().split()))\narr.sort(reverse=True)\nif n%2 == 1 :\n print(arr[n//2])\nelse :\n print(arr[n//2])\n\n\n\n \t\t \t \t\t\t \t\t\t\t \t\t\t \t \t\t \t", "n = int(input())\r\nnums = list(map(int, input().split()))\r\n#nums = sorted(nums)\r\n\r\n\r\n\r\nwhile len(nums) != 1:\r\n nums = sorted(nums)[::-1]\r\n nums.remove(nums[0])\r\n #print(nums)\r\n if (len(nums) == 1):\r\n break\r\n nums = sorted(nums)\r\n nums.remove(nums[0])\r\n #print(nums)\r\nprint(*nums)", "n=int(input())\r\narr=[int(x) for x in input().split()]\r\narr.sort()\r\ni=0\r\nwhile len(arr)!=1:\r\n\r\n if i%2==0:\r\n arr.remove(max(arr))\r\n else:\r\n arr.remove(min(arr))\r\n i+=1\r\nprint(arr[0])", "n = int(input())\r\nx = list(map(int, input().split()))\r\nx = sorted(x)\r\nif n % 2 == 1:\r\n print(x[n//2])\r\nelif n % 2 == 0:\r\n print(x[n//2-1])", "n = int(input())\r\na = [int(i) for i in input().split()]\r\na.sort()\r\nprint(a[(n//2-1 if n % 2 == 0 else n//2)])", "n = int(input())\r\na = list(map(int, input().split()))\r\na.sort(reverse=True)\r\nif n % 2 == 0:\r\n b = (n//2)\r\n print(a[b])\r\nelse:\r\n c = ((n+1)//2) - 1\r\n print(a[c])\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\na.sort()\r\nif len(a) % 2 == 0:\r\n while len(a) > 2:\r\n del a[0]\r\n del a[-1]\r\n del a[1]\r\n print(*a)\r\nelse:\r\n while len(a) > 1:\r\n del a[0]\r\n del a[-1]\r\n print(*a)", "n=int(input())\r\na=list(map(int, input().split()))\r\na.sort()\r\nif int(n%2)==0:\r\n print(a[int(n/2)-1])\r\nelse:print(a[int(n/2)])", "def do():\r\n N=int(input())\r\n ch=sorted(map(int,input().split()))\r\n print(ch[(N-1)//2])\r\n \r\ndo()", "n=int(input())\r\nm=list(map(int,input().split()))\r\nm.sort()\r\nif n%2==0:\r\n\tprint(m[(n//2)-1])\r\nelse:\r\n\tprint(m[(n-1)//2])", "no_of_numbers = int(input())\r\nnumbers = [int(x) for x in input().split()]\r\nplayer1 = 1\r\nplayer2 = 0\r\nwhile(len(numbers)>1):\r\n if player1:\r\n numbers.remove(max(numbers))\r\n player2 = 1\r\n player1 = 0\r\n\r\n elif player2:\r\n numbers.remove(min(numbers))\r\n player1 = 1\r\n player2 = 0\r\n\r\nfor _ in numbers:\r\n print(_)", "n=int(input())\r\nprint(sorted(map(int,input().split()))[n - 1>>1])", "n=int(input())\r\nl1=list([int(x) for x in input().split()])\r\nl1.sort()\r\nprint(l1[(n-1)//2])\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\ni=0\r\nwhile len(l)!=1:\r\n if i%2:\r\n l.remove(min(l))\r\n else:\r\n l.remove(max(l))\r\n i+=1\r\nprint(l[0])", "n = int(input())\r\nlist = input().split()\r\nfor i in range(n):\r\n list[i] = int(list[i])\r\nlist.sort()\r\nif n % 2 != 0:\r\n answer = list[int((n + 1) / 2 - 1)]\r\n print(answer)\r\nelif n % 2 == 0:\r\n print(list[int((n / 2) - 1)])", "x = int(input())\r\ny = [int(i) for i in input().split()]\r\nz = 1\r\nwhile len(y) > 1:\r\n if z%2 == 1:\r\n y.pop(y.index(max(y)))\r\n else:\r\n y.pop(y.index(min(y)))\r\n z += 1\r\nprint(y[0])\r\n", "import time\r\nn = int(input())\r\nnu = input().strip().split()\r\nnum = [int(i) for i in nu]\r\nfor i in range(n-1):\r\n\tif i % 2 == 0:\r\n\t\tnum.remove(max(num))\r\n\telse:\r\n\t\tnum.remove(min(num))\t\t\r\nprint(num[0])\r\n", "N = int(input())\na = [int(i) for i in input().split()]\nsort = sorted(a)\n\nif N%2 == 1:\n print(sort[N//2])\nelse:\n print(sort[N // 2 - 1])", "n = int(input())\r\narray = sorted(list(map(int, input().split())))\r\n\r\n\r\nif n % 2 != 0:\r\n mid = int(n//2)\r\n print(array[mid])\r\nelse:\r\n mid = int(n//2) - 1\r\n print(array[mid])\r\n\r\n", "a = int(input())\r\nl=list(map(int,input().split(\" \")))\r\nfor i in range(len(l)-1):\r\n maxi=max(l)\r\n mini=min(l)\r\n if i%2==0:\r\n l.remove(maxi)\r\n else:\r\n l.remove(mini)\r\nprint(l[0]) ", "n=int(input())\nx=list(map(int,input().split(\" \")))\nfor i in range(0,n-1,1):\n for j in range(i+1,n,1):\n if x[i]>x[j]:\n t=x[i]\n x[i]=x[j]\n x[j]=t\nif n%2==0:\n print(x[n//2-1])\nelse:\n print(x[(n-1)//2])\n\t \t \t\t \t \t\t \t \t\t \t \t\t\t \t \t", "q=int(input())\r\nw=[int(e)for e in input().split()]\r\nwhile True:\r\n if len(w)==1:\r\n break\r\n del w[w.index(max(w))]\r\n if len(w)==1:\r\n break\r\n del w[w.index(min(w))]\r\nprint(*w)", "# link : \r\n# sorting\r\n\r\nn = int(input())\r\n\r\nnums = [int(x) for x in input().split()]\r\nnums.sort()\r\n\r\nflag = True\r\nwhile len(nums)>1:\r\n if flag:\r\n nums.pop(-1)\r\n flag=False\r\n else:\r\n nums.pop(0)\r\n flag=True\r\n\r\nprint(nums[0])\r\n \r\n", "n = int(input())\r\narray = list(map(int, input().split()))\r\n\r\narray = sorted(array)\r\ni = 0\r\n\r\nif n % 2 != 0:\r\n mid = int(n//2)\r\nelse:\r\n mid = int(n//2) - 1\r\nprint(array[mid])\r\n", "n=int(input())\r\narr=list(map(int,input().split()))\r\narr=sorted(arr)\r\nprint(arr[(n-1)//2])", "n=int(input())\nz=list(map(int,input().split()))\n\nz.sort()\n\nif n%2==0 :\n print(z[n//2-1])\nelse :\n print(z[n//2])\n\t\t\t\t\t\t \t \t\t \t \t \t\t\t \t\t", "R=lambda:int(input());S=lambda:[int(a) for a in input().split()];\r\nn=R()\r\na=S()\r\na=sorted(a)\r\nprint([a[n//2],a[(n//2)-1]][n%2==0])", "n=int(input())\r\narr=list(map(int,input().split()))\r\narr.sort()\r\nc=len(arr)//2\r\nif n%2==0:\r\n c-=1\r\nprint(arr[c])", "n = int(input())\r\na = [int(i) for i in input().split()[:n]]\r\nfor i in range(n-1):\r\n if(i%2==0):\r\n a.remove(max(a))\r\n else:\r\n a.remove(min(a))\r\nprint(a[0])", "n = int(input())\r\nl = sorted(list(map(int, input().split())))\r\n\r\nfor i in range(n-1):\r\n if i % 2 == 0:\r\n l.pop()\r\n else:\r\n l.pop(0)\r\n\r\nprint(*l)", "n=int(input()) \nm=list(map(int,input().split())) \nfor i in range (n-1): \n for j in range (n-1): \n if m[j]>m[j+1]: \n temp=m[j] \n m[j]=m[j+1] \n m[j+1]=temp \nprint(m[int((n-1)/2)])\n \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\nx.sort(reverse=True)\r\nprint(x[n//2])", "n=int(input())\r\nlst1 = list(map(int,input().split()))\r\nlst1=sorted(lst1)\r\nif n%2==0:\r\n print(lst1[(n-1)//2])\r\nelse:\r\n print(lst1[n//2])", "a = int(input())\r\nb = list(map(int,input().split()))\r\nc = sorted(b)\r\nif len(c) % 2 != 0:\r\n\tprint(c[(len(c)+1)//2-1])\r\nelse:\r\n\tprint(c[len(c)//2-1])", "d=int(input())\nn=list(map(int,input().split()))\n\n\nfor i in range(d-1):\n if i%2==0:\n n.sort()\n n.pop()\n \n else:\n n.reverse()\n n.pop()\n \nprint(n[0])\n\t\t \t\t \t\t\t \t\t\t \t \t\t\t \t\t", "def middle_element(A):\r\n if (len(A) == 1):\r\n return A[0]\r\n A.sort()\r\n if len(A) % 2 == 0:\r\n return A[len(A)//2 - 1]\r\n else:\r\n return A[len(A)//2]\r\n \r\nn = int(input())\r\nnumbers = list(map(int, input().split()))\r\n\r\nprint(middle_element(numbers))", "n = int(input())\r\na = sorted(list(map(int,input().split())))\r\nif n%2!=0:print(a[n//2])\r\nelse:print(a[(n//2)-1])", "n=int(input())\r\nm=list(map(int,input().strip().split()[:n]))\r\nm.sort()\r\nif n%2!=0:\r\n\tprint(m[(n//2)])\r\nelse:\r\n\tprint(m[(n//2)-1])", "n=int(input())\na=[int(i) for i in input().split()]\na.sort()\nif(n%2==1):\n print(a[n//2])\nelse:\n print(a[n//2-1])\n \t\t\t \t \t\t \t\t \t \t \t \t\t", "import math\r\n\r\nn = int(input())\r\nnums = [int(i) for i in input().split()]\r\nnums = sorted(nums)\r\n\r\n#print(nums)\r\nif len(nums) % 2 == 0:\r\n print(nums[math.ceil(len(nums)//2)-1])\r\nelse:\r\n print(nums[math.ceil(len(nums)//2)])", "input()\r\nls=sorted([*map(int,input().split())])\r\nprint(ls[(len(ls)-1)//2])", "#for _ in range(int(input())):\r\nn=int(input())\r\n# x,y=map(int,input().split())\r\na=list(map(int,input().split()))\r\na.sort()\r\nprint(a[(n-1)//2])", "n = int(input())\r\ns = sorted(list(map(int,input().split())))\r\nprint(s[(n - 1)//2])\r\n", "n = int(input())\r\nai = list(map(int,input().split()))\r\nif n > 2:\r\n while len(ai) > 1:\r\n ai.pop(ai.index(max(ai)))\r\n ai.pop(ai.index(min(ai)))\r\n if n%2 == 0:\r\n if len(ai) == 2:\r\n print(min(ai))\r\n else:\r\n if len(ai) == 1:\r\n print(*ai)\r\nelse:\r\n print(min(ai))", "n=int(input())\r\nnumbers=list(map(int,input().split()))\r\nnumbers.sort()\r\nif n%2==0:\r\n print(numbers[(n//2)-1])\r\nelse:\r\n print(numbers[((n+1)//2)-1])", "def sort(n,a):\r\n list = a\r\n for i in range(0,n):\r\n for j in range(0,n):\r\n if(list[i]>list[j]):\r\n t = list[i]\r\n list[i] = list[j]\r\n list[j] = t\r\n return list\r\ndef erase(n,a):\r\n temp=1\r\n list = sort(n,a)\r\n t=0\r\n print(a[(n)//2])\r\nn = int(input())\r\na = [int(i) for i in input().split()]\r\nerase(n,a)\r\n \r\n \r\n ", "n = int(input())\r\nd = list(map(int, input().split()))\r\nwhile len(d) != 1:\r\n d.remove(max(d))\r\n if len(d) == 1:\r\n break\r\n d.remove(min(d))\r\nprint(d[0])\r\n", "n=int(input())\r\na=[int(i) for i in input().split()][:n]\r\na=sorted(a)\r\nfor i in range(n-1):\r\n if(i%2==1):\r\n a.remove(a[0])\r\n elif(i%2==0):\r\n a.remove(a[-1])\r\nprint(a[0])", "n = int(input())\ns = list(map(int,(input().split())))\nfor i in range(n-1):\n if i % 2 == 0:\n s.remove(max(s))\n else:\n s.remove(min(s))\nprint(s[0])\n \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\ns.sort()\r\n \r\nif n % 2 != 0:\r\n print(s[n//2])\r\nelse:\r\n print(s[n//2-1])\r\n\r\n", "n=int(input());print(sorted(list(map(int,input().split())))[(n-1)//2] if n%2==0 else sorted(list(map(int,input().split())))[n//2])", "n=int(input())\r\na=[int(x) for x in input().split()]\r\na.sort()\r\nprint(a[(n-1)//2])", "n=int(input())\r\ns=map(int,input().split())\r\ns=sorted(s)\r\nif n%2==0:\r\n min=n//2\r\n print(s[min-1])\r\nelse:\r\n min = n//2\r\n print(s[min])", "n = int(input())\r\nls = list(map(int, input().split(\" \")))\r\ni = 0\r\nwhile len(ls) != 1:\r\n if i % 2 == 0:\r\n ls.remove(max(ls))\r\n else:\r\n ls.remove(min(ls))\r\n i += 1\r\nprint(ls[0])", "_ = int(input())\nl = list(map(int, input().split(' ')))\nl.sort()\nprint(l[int((_ -1 )/2)])\n", "n=int(input())\r\nlst=[]\r\nlst1=[]\r\nlst=input().split(\" \")\r\n#logic\r\n# 44 53 51 80 5 27 74 79 94\r\n# 8 //del max number then min number & likewise until n-1\r\n# 44 53 51 80 5 27 74 79 \r\n# 44 53 51 80 27 74 79 \r\n# 44 53 51 27 74 79 \r\n# 44 53 51 74 79 \r\n# 44 53 51 74 \r\n# 53 51 74 \r\n# 53 51 \r\n# 53 \r\nfor i in lst:\r\n # print(i)\r\n lst1.append(int(i))\r\n# print(lst1)\r\n\r\ndef minimum(list1):\r\n return(min(lst1))\r\n\r\nif(n%2== 0):\r\n\ttest = (n/2)-1\r\nelse:\r\n\ttest = (n-1)//2\r\n\r\nwhile(test):\r\n max_ele=max(lst1)\r\n #print(max_ele)\r\n lst1.remove(max_ele)\r\n\r\n min_ele= minimum(lst1)\r\n #print(min_ele)\r\n lst1.remove(min_ele) \r\n test-=1\r\n\r\nprint(min(lst1))\r\n\r\n \r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\n\r\ncurrent_el, current_el_i, move = 0, 0, 0\r\n\r\nwhile move < n - 1:\r\n if move % 2 == 0:\r\n for i in range(n):\r\n if a[i] != -1 and current_el < a[i]:\r\n current_el = a[i]\r\n current_el_i = i\r\n else:\r\n for i in range(n):\r\n if a[i] != -1 and current_el > a[i]:\r\n current_el = a[i]\r\n current_el_i = i\r\n\r\n a[current_el_i] = -1\r\n move += 1\r\n\r\nfor i in range(n):\r\n if a[i] != -1:\r\n print(a[i])\r\n break", "n = int(input())\r\narr = list(map(int, input().split()))\r\n\r\nstep = 1\r\n\r\nfor el in range(n-1):\r\n if step % 2 != 0:\r\n arr.remove(max(arr))\r\n step += 1\r\n else:\r\n arr.remove(min(arr))\r\n step += 1\r\n \r\nprint(arr[0])", "n = int(input())\r\nL = list(map(int,input().split()))\r\nL.sort()\r\nif n%2==0:\r\n print(L[int((n/2)-1)])\r\nelse:\r\n print(L[int((n-1)/2)])", "n=int(input())\r\nk=input()\r\nk=k.split(sep=' ')\r\nfor i in range (len(k)):\r\n k[i]=int(k[i])\r\nk=sorted(k)\r\nif len(k)%2==0:\r\n print(k[(len(k) // 2)-1])\r\nelse:\r\n print(k[len(k)//2])", "n=int(input())\r\na=sorted([int(x) for x in input().split()])[::-1]\r\nprint(a[n//2])", "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 = ini()\r\na = sorted(inl())\r\nprint(a[n//2] if n % 2 else a[n//2 - 1])", "n, a = int(input()), sorted(int(i) for i in input().split())\nres = a[(len(a) - 1) // 2]\nprint(res)\n", "n = int(input())\n\ntemp = input()\nlist_nums = [int(i) for i in temp.split(' ')]\nlist_nums.sort()\n\nfor i in range(n-1):\n if i%2==0:\n list_nums.pop()\n else:\n list_nums.pop(0)\n\nprint(list_nums[0])", "\r\nn=int(input())\r\nline=input()\r\na=[int(i)for i in line.split()] \r\na.sort()\r\npos=int((n+1)/2)-1\r\nprint(a[pos]) ", "n = int(input())\r\na = list(map(int,input().split()))\r\na.sort()\r\nprint(a[n//2-1] if n%2==0 else a[n//2])", "a=int(input())\r\nb=sorted(list(map(int,input().split())))\r\nprint(b[(a//2)-1+a%2])\r\n", "n = int(input())\r\nk = list(map(int, input().split()))\r\nk = list(k)\r\nk.sort()\r\nwhile len(k) != 1:\r\n if k[0]==k[-1]:\r\n break\r\n k.pop()\r\n if k[0]==k[-1]:\r\n break\r\n k.pop(0)\r\n if k[0]==k[-1]:\r\n break\r\nprint(k[0])\r\n", "n = int(input())\r\ns = list(map(int, input().split()))\r\nmiddle = sum(s) / len(s)\r\ns.sort()\r\nprint(s[int((n-1)/2)])", "n = int(input())\r\na = list(map(int, input().split()))\r\n\r\na.sort()\r\n\r\nfor i in range(n - 1):\r\n if i % 2 == 0:\r\n del a[-1]\r\n elif i % 2 == 1:\r\n del a[0]\r\n\r\nprint(a[0])", "n=int(input())\r\nx=list(map(int,input().split()))\r\nwhile len(x)>1:\r\n x.remove(max(x))\r\n if len(x)>1:\r\n x.remove(min(x))\r\nprint(x[0])", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Sun Jun 20 11:48:05 2021\r\n\r\n@author: nagan\r\n\"\"\"\r\n\r\nn = int(input())\r\ns = input().split()\r\ns = [int(i) for i in s]\r\ns.sort()\r\nfor i in range(n - 1):\r\n if i % 2 == 0:\r\n s.pop(-1)\r\n else:\r\n s.pop(0)\r\nprint(s[0])", "n=int(input())\r\nlst=list(map(int,input().split()))\r\nfor i in range(n-1):\r\n if i%2==0:\r\n lst.remove(max(lst))\r\n else:\r\n lst.remove(min(lst))\r\nprint(lst[0])", "n=int(input())\r\nls=input().split()\r\nls=[int(num) for num in ls]\r\nls.sort()\r\nif n%2==0:\r\n print(ls[n//2-1])\r\nelse:\r\n print(ls[(n+1)//2-1])", "c=int(input())\r\nx = list(map(int, input().split()))\r\nx.sort()\r\nfor i in range(c-1):\r\n if i%2==0:\r\n x.pop()\r\n else:\r\n x.pop(0)\r\nprint(x[0])", "n=int(input())\r\na=sorted(list(map(int,input().split())))\r\nif(n&1):\r\n print(a[n//2])\r\nelse:\r\n print(a[n//2-1])", "n = int(input())\r\nl = sorted(list(map(int , input().split())))\r\nif n % 2 != 0 : \r\n print(l[(n//2 )])\r\nelse:\r\n print(l[(n // 2) - 1 ])", "n=int(input())\r\nl=list(map(int,input().split()))\r\nfor i in range(n-1):\r\n if i%2==0:\r\n l.pop(l.index(max(l)))\r\n else:\r\n l.pop(l.index(min(l)))\r\nprint(l[0])", "a = int(input())\r\ns = [int(x) for x in input().split()]\r\nslen = a\r\nkey = True\r\nfor i in range((a - 1) // 2):\r\n s.remove(max(s))\r\n s.remove(min(s))\r\nif a % 2 == 0:\r\n print(min(s))\r\nelse:\r\n print(s[0])", "n = int(input())\na = [int(i) for i in input().split()]\nsort_a = sorted(a)\ncount = 0\nfor i in range(n-1):\n if count % 2 == 0:\n sort_a.remove(sort_a[-1])\n else:\n sort_a.remove(sort_a[0])\n count += 1\n\nprint(sort_a[0])", "n = int(input())\r\nlst = list(map(int,input().split()))\r\nlst.sort()\r\nprint(lst[(n-1)//2])", "import statistics\r\nn = int(input())\r\na = map(int, input().split())\r\nl = list(a)\r\nl.sort()\r\nl.reverse()\r\nif n%2 == 1:\r\n print(statistics.median(l))\r\nelse:\r\n l.remove(l[0])\r\n print(statistics.median(l))\r\n", "n=int(input())\r\nx=list(map(int,input().split()))\r\nx=sorted(x)\r\nif n%2==0:\r\n print(x[n//2-1])\r\nelse:\r\n print(x[n//2])\r\n", "if __name__ == '__main__':\n n = int(input())\n intergers = list(map(int, input().split()))\n intergers.sort()\n if n % 2 == 0:\n print(intergers[(n // 2) - 1])\n else:\n print(intergers[((n + 1) // 2) - 1])\n", "num = int(input())\r\n\r\narr = sorted(map(int, input().split()))\r\nind = (num-1) // 2\r\n\r\nprint(arr[ind])\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "n = int(input())\r\nw = sorted([int(i) for i in input().split()])\r\nprint(w[n//2 - (n+1)%2])", "t = int(input())\r\na = sorted(list(map(int,input().split())))\r\nif t%2 == 0:print(a[t//2 -1])\r\nelse:print(a[t//2])", "n=int(input())\r\nlst=list(map(int,input().split()))\r\nlst.sort(reverse=True)\r\nprint(lst[n//2])", "n = int(input())\r\na = input()\r\na = list(map(int,a.split(' ')))\r\n\r\nplayer = 1\r\n\r\nwhile len(a)>1:\r\n if player==1:\r\n target = max(a)\r\n else:\r\n target = min(a)\r\n a.remove(target)\r\n if player==1:\r\n player = 0\r\n else:\r\n player = 1\r\n\r\nprint(a[0])", "n=int(input())\r\nl=list(map(int,input().split()))\r\nl.sort()\r\np=len(l)-1\r\nm=int(p/2)\r\nprint(l[m])", "import math\r\n\r\ninput()\r\na = list(map(int, input().split()))\r\nfor i in range(math.ceil(len(a) / 2) - 1):\r\n a.remove(max(a))\r\n a.remove(min(a))\r\nif len(a) > 1: a.remove(max(a))\r\nprint(*a)", "def solve():\r\n size = input()\r\n numbers = sorted(map(int, input().split()))\r\n \r\n while len(numbers) > 1:\r\n del numbers[-1]\r\n \r\n if len(numbers) > 1:\r\n del numbers[0]\r\n \r\n print(numbers[0])\r\n \r\n \r\nif __name__ == \"__main__\":\r\n solve()\r\n ", "n = int(input())\r\nd = sorted([x for x in map(int, input().split())])\r\nprint(d[int((n-1)/2)])", "n=int(input())\r\na=[]\r\na+=map(int,input().split())\r\na.sort()\r\nprint(a[n//2-(n+1)%2])\r\n", "if __name__ == '__main__':\n n = int(input())\n nums = list(map(int, input().split()))\n length = len(nums)\n nums = sorted(nums)\n if length % 2 == 0:\n print(nums[length // 2 - 1])\n else:\n print(nums[length // 2])\n\n \t \t\t\t\t\t\t \t \t\t\t\t\t\t \t \t", "a=int(input())\r\nb=sorted(map(int,input().split()))\r\nif a%2!=0:\r\n print(b[int((a-1)/2)])\r\nelse:\r\n print(b[int(a/2-1)])", "n = int(input())\r\nA = map(int, input().split())\r\nA = sorted(A)[::-1]\r\nprint(A[n//2])", "n = int(input())\r\nli = sorted(map(int, input().split()))\r\nprint(li[(n-1)// 2])\r\n", "n = int(input())\r\narr = list(map(int, input().split()))\r\narr.sort()\r\nif len(arr) % 2 == 1:\r\n print(arr[n // 2])\r\nelse:\r\n print(arr[n // 2 - 1])", "n = int(input())\r\narr = [int(x) for x in input().split()]\r\n\r\narr.sort()\r\n\r\na = n//2 - (1 if n%2 == 0 else 0)\r\n\r\nprint(arr[a])", "t = int(input())\r\na = list(map(int, input().split()))\r\nfor i in range(t - 1):\r\n if i % 2 == 0:\r\n a.pop(a.index(max(a)))\r\n else:\r\n a.pop(a.index(min(a)))\r\nprint(' '.join(map(str, a)))\r\n", "n = int(input())\r\na = map(int, input().split())\r\na = list(a)\r\na.sort()\r\ntag = True\r\nfor i in range(n - 1):\r\n if tag:\r\n del a[-1]\r\n tag = False\r\n else:\r\n del a[0]\r\n tag = True\r\nprint(a[0])\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\nl.sort()\r\nflag=0\r\nfor i in range(n-1):\r\n if(flag==0):\r\n l.pop(-1)\r\n flag=1\r\n else:\r\n l.pop(0)\r\n flag=0\r\nprint(l[0])\r\n ", "n = int(input())\r\na = [int(i) for i in input().split()]\r\nm = 0\r\nwhile len(a) != 1:\r\n if m % 2 == 0:\r\n a.remove(max(a))\r\n else:\r\n a.remove(min(a))\r\n m = m + 1\r\nprint(*a)", "import math\r\nn = int(input());print(sorted(list(map(int,input().split())))[math.ceil(n/2)-1])\r\n", "x = int(input())\r\nl = [int(n) for n in input().split()]\r\nl.sort()\r\ni = 0\r\nwhile len(l) > 1:\r\n if i % 2 == 0:\r\n l = l[0:len(l) - 1]\r\n else:\r\n l = l[1:len(l)]\r\n i = i + 1\r\nprint(l[0])\r\n ", "n=int(input())\na= list(map(int, input().split()))\nk=0\nfor i in range(0,len(a)-1):\n if k==0:\n a.remove(max(a))\n k=1\n else:\n a.remove(min(a))\n k=0\n \nprint(a[0])\n\n\t \t\t \t\t\t \t\t\t\t \t\t\t\t\t \t\t", "n = int(input())\ns = [int(x) for x in input().split()]\n\ns.sort()\n\nif n % 2 == 0:\n print(s[n//2 - 1])\nelse:\n print(s[(n-1)//2])\n", "n=int(input())\r\ns=list(map(int,input().split()))\r\ns.sort()\r\nif(n%2!=0):\r\n print(s[n//2])\r\nelse:\r\n print(s[n//2-1])", "random_usless_number=int(input())\nnums=[int(i) for i in input().split()]\nnums.sort()\nif len(nums) % 2 != 0:\n print(nums[len(nums)//2])\nelse:\n print(nums[len(nums)//2-1 ])\n", "c=int(input())\r\narr=map(int,input().split())\r\narr_sorted=sorted(arr)\r\nprint(arr_sorted[(c-1)//2])", "n=int(input())\r\na=list(map(int,input().split()))\r\na.sort()\r\nif len(a)%2==0:\r\n print(a[(len(a)//2)-1])\r\nelse:\r\n print(a[len(a)//2])\r\n", "# import sys\r\n# sys.stdin=open(\"input.in\",\"r\")\r\nn=int(input())\r\nl=sorted(map(int,input().split()))\r\nprint(l[(n-1)//2])", "n = int(input())\r\na = list(map(int, input().split()))\r\na.sort()\r\nwhile len(a)>1:\r\n a.pop(-1)\r\n if len(a)<=1:\r\n break\r\n a.pop(0)\r\n if len(a)<=1:\r\n break\r\nprint(a[0])", "a=int(input())\r\nb=sorted(list(map(int,input().split())))\r\nif a%2==0:\r\n print(b[a//2-1])\r\nelse:\r\n print(b[a//2])", "n = int(input())\r\na = [int(i) for i in input().split()]\r\n\r\n\r\ndef first_player(x):\r\n x.remove(max(x))\r\n\r\n\r\ndef second_player(x):\r\n x.remove(min(x))\r\n\r\n\r\ndef players_generator():\r\n while True:\r\n yield first_player\r\n yield second_player\r\n\r\nplayers = players_generator()\r\n\r\nfor _ in range(n-1):\r\n next(players)(a)\r\n\r\nprint(a[0])\r\n", "n = int(input())\ne = list(map(int,input().split()))\ne.sort()\nif len(e)%2==1:\n print(e[len(e)//2])\nelse:\n print(e[len(e)//2-1])", "n = int(input())\ni = (n // 2) - (n % 2 == 0)\nprint(list(sorted(map(int, input().split())))[i])\n", "n = int(input())\na = input().split(' ')\nfor i in range(n):\n a[i] = int(a[i])\n\nif n % 2 == 1:\n while n > 1:\n n -= 1\n a.remove(max(a))\n n -= 1\n a.remove(min(a))\n print(*a)\nelse:\n while n > 2:\n n -= 1\n a.remove(max(a))\n n -= 1\n a.remove(min(a))\n print(min(a))\n\n", "n = int(input())\r\na = [int(i) for i in input().split()]\r\na.sort()\r\n\r\nif n%2 == 0:\r\n print(a[(n-1)//2])\r\nelse:\r\n print(a[n//2])\r\n", "s = int(input())\r\nl = list(map(int, input().split(' ')))\r\nl.sort()\r\nprint(l[(s-1)//2])\r\n", "a = input()\nv= []\nb = input()\n#b = b.split()\nb=[int(i) for i in b.split()]\nb.sort()\nc = len(b) // 2\nif len(b)%2==1:\n print (b[c])\nelse:\n print (b[c-1])\n\n\t \t \t \t\t \t \t\t \t\t", "n = int(input())\nx = list(map(int,input().split()))\nfor i in range(n-1):\n\tif len(x)>1:\n\t\tif i%2==0:\n\t\t\tx.remove(max(x))\n\t\telse:\n\t\t\tx.remove(min(x))\nprint(x[0])\n\n\t \t \t\t \t \t\t \t\t \t\t\t\t\t\t \t\t\t \t", "n=int(input())\r\n#don't hack me lel or u can't hack me lol \r\nl=list(map(int,input().split()))\r\nl.sort()\r\nif(n%2!=0):\r\n print(l[n//2])\r\nelse:\r\n print(l[n//2 -1])", "n=int(input())\r\nl=input()\r\nl=l.split()\r\nl1=[]\r\nfor i in range(len(l)):\r\n l1.append(int(l[i]))\r\nfor i in range(len(l1)-1):\r\n if i%2==0:\r\n l1.remove(max(l1))\r\n else:\r\n l1.remove(min(l1))\r\nprint(l1[0])", "n = int(input())\r\na = [int(i) for i in input().split()]\r\n\r\nfor i in range (len(a)):\r\n for j in range (i+1, len(a)):\r\n if(a[i] <= a[j]):\r\n a[i], a[j] = a[j], a[i]\r\nprint (a[n//2])\r\n", "n = int(input())\r\nnums = list(map(int,input().split()))\r\nnums.sort()\r\nmid = n//2\r\nif(n%2==0):\r\n print(nums[mid-1])\r\nelse:\r\n print(nums[mid])", "from sys import stdin, setrecursionlimit, stdout\r\n#setrecursionlimit(1000000)\r\nfrom collections import deque\r\nfrom math import sqrt, floor, ceil, log, log2, log10, pi, gcd, sin, cos, asin\r\ndef ii(): return int(stdin.readline())\r\ndef fi(): return float(stdin.readline())\r\ndef mi(): return map(int, stdin.readline().split())\r\ndef fmi(): return map(float, stdin.readline().split())\r\ndef li(): return list(mi())\r\ndef si(): return stdin.readline().rstrip()\r\ndef lsi(): return list(si())\r\n#mod=1000000007\r\nres=['Yes', 'No']\r\n############# CODE STARTS HERE #############\r\n\r\ntest_case=1\r\nwhile test_case:\r\n test_case-=1\r\n\r\n\r\n\r\n n=ii()\r\n a=li()\r\n a.sort(reverse=True)\r\n print(a[n//2])", "n=int(input())\r\nnums=list(map(int,input().strip().split()))\r\nnums.sort()\r\nmid=len(nums)//2\r\nif(len(nums)%2==0):\r\n print(nums[mid-1])\r\n\r\nelse:\r\n print(nums[mid])\r\n", "n = int(input())\r\nj = [int(i) for i in input().split()]\r\n\r\nj.sort()\r\nprint(j[n//2+n%2-1])\r\n", "n = int(input().strip())\narr = list(map(int, input().split()))\n\narr.sort()\n\nif n % 2 == 0:\n print(arr[int((n / 2) - 1)])\nelse:\n print(arr[int((n - 1) / 2)])\n\n\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\nwhile(n>1):\r\n\tif(n>2):\r\n\t\tl.remove(l[-1])\r\n\t\tl.remove(l[0])\r\n\telse:\r\n\t\tl.remove(l[-1])\r\n\tn-=2\r\nprint(l[0])", "n = int (input ())\r\ns = list(map(int,input().split()))\r\nwhile len (s) > 1:\r\n a = max (s)\r\n b = min (s)\r\n s.remove (a)\r\n if len (s) == 1:\r\n break\r\n s.remove (b)\r\nprint (s[0])", "n=int(input())\r\nls=list(map(int,input().rstrip().split()))\r\nls.sort()\r\nif(n%2!=0):\r\n print(ls[int(n/2)])\r\nelse:\r\n print(ls[int(n/2)-1])", "def main():\r\n n = int(input())\r\n a = list(map(int,input().split()))\r\n turn = \"A\"\r\n for i in range (n-1):\r\n if turn == \"A\":\r\n n1 = max(a)\r\n a.remove(n1)\r\n turn = \"B\"\r\n else:\r\n n2 = min(a)\r\n a.remove(n2)\r\n turn = \"A\"\r\n print(a[0])\r\n\r\nmain()\r\n", "n=int(input())\r\nlst=sorted(map(int,input().split()),reverse=True)\r\nprint(lst[n//2])\r\n", "n = int(input())\r\ns = list(map(int,input().split()))\r\ns.sort()\r\nif n%2==0:\r\n print(s[(n//2)-1])\r\nelse:\r\n print(s[n//2])", "n = int(input())\r\n\r\nnums = [ int(x) for x in input().split() ]\r\n\r\nfirst = True\r\n\r\nwhile(len(nums) != 1):\r\n if(first):\r\n nums.remove(max(nums))\r\n else:\r\n nums.remove(min(nums))\r\n first = not first\r\n\r\nprint(f'{nums[0]}')", "import math\r\nn = int(input())\r\nl = sorted(list(map(int, input().split())))\r\nprint(l[math.ceil(n/2)-1])\r\n", "n=int(input())\r\n\r\narr=list(map(int,input().split()))\r\ns=sorted(arr)\r\n\r\nprint(s[(n-1)//2])", "n=int(input())\r\nar=list(map(int,input().split()))\r\nar.sort()\r\nif(n&1):\r\n print(ar[n//2])\r\nelse:\r\n print(ar[(n-1)//2])", "n = int(input())\na = list(map(int,input().split()))\nfor i in range(1,n):\n if i%2==0:\n a.remove(min(a))\n else:\n a.remove(max(a))\nprint(a[0])\n \t \t\t\t \t \t\t\t\t \t \t \t", "n = int(input())\na = [int(x) for x in input().split(' ')]\nfor i in range(len(a) - 1):\n if i % 2 == 0:\n a.remove(max(a))\n else:\n a.remove(min(a))\nprint(a[0])\n", "from math import floor\r\nn=int(input())\r\na=[int(v) for v in input().split()]\r\na.sort()\r\nprint(a[floor((n-1)/2)])", "# https://codeforces.com/problemset/problem/984/A\r\nfrom random import randint\r\narr_len = int(input())\r\narr = list(map(int, input().strip().split()))\r\n\r\n\r\ndef quicksort(array):\r\n if len(array) < 2:\r\n return array\r\n low, same, high = [], [], []\r\n pivot = array[randint(0, len(array) - 1)]\r\n for item in array:\r\n if item < pivot:\r\n low.append(item)\r\n elif item == pivot:\r\n same.append(item)\r\n elif item > pivot:\r\n high.append(item)\r\n return quicksort(low) + same + quicksort(high)\r\n\r\n\r\ndef insertion_sort(array):\r\n for i in range(1, len(array)):\r\n key_item = array[i]\r\n\r\n j = i - 1\r\n while j >= 0 and array[j] > key_item:\r\n array[j + 1] = array[j]\r\n j -= 1\r\n array[j + 1] = key_item\r\n\r\n return array\r\n\r\n\r\ndef merge(left, right):\r\n if len(left) == 0:\r\n return right\r\n if len(right) == 0:\r\n return left\r\n\r\n result = []\r\n index_left = index_right = 0\r\n\r\n while len(result) < len(left) + len(right):\r\n if left[index_left] <= right[index_right]:\r\n result.append(left[index_left])\r\n index_left += 1\r\n else:\r\n result.append(right[index_right])\r\n index_right += 1\r\n if index_right == len(right):\r\n result += left[index_left:]\r\n break\r\n\r\n if index_left == len(left):\r\n result += right[index_right:]\r\n break\r\n\r\n return result\r\n\r\n\r\ndef merge_sort(array):\r\n if len(array) < 2:\r\n return array\r\n\r\n midpoint = len(array) // 2\r\n\r\n return merge(\r\n left=merge_sort(array[:midpoint]),\r\n right=merge_sort(array[midpoint:]))\r\n\r\n\r\narr = merge_sort(arr)\r\nif arr_len % 2 == 0:\r\n print(arr[(arr_len // 2) - 1])\r\nelse:\r\n print(arr[arr_len // 2])\r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\n#b=sorted(a)\r\nfor i in range(n-1):\r\n if i%2==0:\r\n a.remove(max(a))\r\n else:\r\n a.remove(min(a))\r\nprint(a[0])\r\n\r\n \r\n", "import heapq\r\n\r\nn = int(input())\r\n\r\na = [int(x) for x in input().split()]\r\n\r\nprint(heapq.nsmallest((n + 1) >> 1, a)[-1])", "_ = int(input())\narr = list(map(int, input().split()))\nlen_arr = len(arr)\n\nprint(sorted(arr)[ (len_arr // 2)-1 if len_arr % 2 == 0 else len_arr // 2 ])\n\t \t\t\t\t \t \t\t\t\t \t \t\t \t\t \t", "line0 = int(input())\nline1 = [int(i) for i in input().split()]\nline1 = sorted(line1)\nif line0 % 2 == 0:\n\tind = len(line1) / 2 - 1\nelse:\n\tind = (len(line1) - 1) * 0.5\nind = int(ind)\nprint(line1[ind])", "n = int(input())\r\nlst = list(map(int, input().split(\" \")))\r\nturn = 1\r\nfor i in range(1, n):\r\n if turn == 1:\r\n maxT = max(lst)\r\n lst.remove(maxT)\r\n turn = 2\r\n else:\r\n minT = min(lst)\r\n lst.remove(minT)\r\n turn = 1\r\nprint(lst[0])", "n = int(input())\r\nnums = [int(i) for i in input().split()]\r\n\r\nnums = sorted(nums)\r\nL = len(nums)\r\nif L % 2 == 0:\r\n print(nums[(L - 1) // 2])\r\nelse:\r\n print(nums[L // 2])\r\n", "def main():\n n = int(input())\n a = [int(x) for x in input().split()]\n a.sort()\n if n%2 == 0:\n print(a[n//2 -1])\n else:\n print(a[n//2])\nif __name__ == '__main__':\n main()\n", "#Codeforce 984A\r\nn=int(input())\r\nlist1=[int(v) for v in input().split()]\r\nlist1.sort()\r\nif n%2==0:\r\n print(list1[n//2 -1])\r\nelse:\r\n print(list1[(n-1)//2])", "n=int(input())\r\nl=list(map(int,input().split()))\r\nfor i in range(n-1):\r\n if i%2==0:\r\n l.remove(max(l))\r\n else:\r\n l.remove(min(l))\r\nprint(*l)\r\n", "input()\r\nn = list(map(int, input().split()))\r\nfor i in range(len(n) - 1):\r\n if i % 2 == 0:\r\n n.pop(n.index(max(n)))\r\n else:\r\n n.pop(n.index(min(n)))\r\nprint(n[0])", "n = int(input())\r\na = list(map(int,input().split()))\r\na.sort()\r\n##beg = 0\r\n##end = n-1\r\nprint(a[(n-1)//2])", "n = int(input())\r\nnumber_list = sorted(map(int, input().split()))\r\nlast = number_list[n//2 - (n % 2 == 0)] \r\n\r\nprint(last)", "n=int(input())\r\nln=list(map(int,input().split()))\r\nln.sort(reverse=True)\r\nfor i in range (n):\r\n if len(ln)>2:\r\n o1h=ln.sort(reverse=True)\r\n o1=ln.pop(0)\r\n o2h=ln.sort(reverse=False)\r\n o2=ln.pop(0)\r\nif len(ln)==2:\r\n o1h=ln.sort(reverse=True)\r\n o1=ln.pop(0)\r\n\r\nprint(ln[0])\r\n ", "n=int(input())\r\nl1=list(map(int,input().split()))\r\nl1.sort()\r\nif(len(l1)%2!=0):\r\n print(l1[int(len(l1)/2)])\r\nelse:\r\n print(l1[int(len(l1)/2)-1])\r\n", "n = int(input())\r\na = list(map(int , input().split()))\r\n\r\nb = sorted(a)\r\n\r\nmidIndex = 0\r\n\r\nif(n%2 != 0):\r\n midIndex = int(n/2)+1;\r\nelse:\r\n midIndex = int(n/2)\r\n\r\nprint(b[midIndex - 1]) \r\n", "line=input('')\r\nliste=input('').split()\r\nliste1 = []\r\nfor i in liste:\r\n liste1.append(int(i))\r\nwhile len(liste1)!=1:\r\n liste1.remove(max(liste1))\r\n if len(liste1)>1:\r\n liste1.remove(min(liste1))\r\nprint(liste1[0])", "n = int(input())\r\nk = [int(i) for i in input().split()]\r\nk.sort()\r\nprint(k[n//2-(n%2==0)])", "n=int(input())\r\nl=[int(x) for x in input().split()]\r\nfor i in range(n-1):\r\n if i%2==0:\r\n l.remove(max(l))\r\n else:\r\n l.remove(min(l))\r\nprint(l[0])", "n = int(input())\r\nl = list(map(int,input().split()))\r\n\r\ninc = sorted(l.copy())\r\ndec = sorted(l.copy(),reverse=True)\r\n\r\nc = True\r\nfor i in range(1,len(l)):\r\n if c:\r\n x = dec.pop(0)\r\n inc.pop(-1)\r\n l.remove(x)\r\n c = False\r\n else:\r\n y = inc.pop(0)\r\n dec.pop(-1)\r\n l.remove(y)\r\n c = True\r\n\r\nprint(l[0])\r\n ", "inp = int(input())-1\r\ninp_2 = sorted(map(int,input().split()))\r\n\r\nprint(inp_2[inp//2])", "n=int(input())\r\nl1=list(map(int,input().split()))[:n]\r\nl1=sorted(l1)\r\n#print(l1)\r\nif n%2==0:\r\n print(l1[(n-1)//2])\r\nelse:\r\n print(l1[n//2])\r\n", "# A. Game\n\nn, a = int(input()), list(map(int, input().split()))\na.sort()\nprint(a[(n-1)//2])\n", "\r\ndef sort(a):\r\n if len(a) < 1:\r\n return None\r\n barrier = a[0]\r\n left = []\r\n middle = []\r\n right = []\r\n for x in a:\r\n if x < barrier:\r\n left.append(x)\r\n elif x == barrier:\r\n middle.append(x)\r\n else: right.append(x)\r\n sort(left)\r\n sort(right) \r\n k = 0\r\n for x in left + middle + right:\r\n a[k] = x\r\n k += 1\r\n return a\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\nlenght = len(a)\r\nif lenght == 1:\r\n print(a[0])\r\nelif lenght == 2:\r\n print(min(a[0], a[1]))\r\nelse:\r\n sort(a)\r\n if lenght % 2 == 0:\r\n print(a[int(lenght/2 -1)])\r\n else: print(a[int(lenght//2)])", "n = int(input())\r\nl = list(map(int, input().split()))\r\nwhile True:\r\n if len(l) == 1:\r\n break\r\n del l[l.index(max(l))]\r\n if len(l) == 1:\r\n break\r\n del l[l.index(min(l))]\r\nprint(*l)", "n = int(input())\r\na = [int(i) for i in input().split()]\r\nwhile len(a) != 1 and len(a) != 2:\r\n del a[a.index(max(a))]\r\n del a[a.index(min(a))]\r\nif len(a) == 2:\r\n del a[a.index(max(a))]\r\nprint(a[0])", "n=int(input())\r\n\r\nf=[]\r\ns=list(map(int,input().split()))\r\n'''\r\nABOVE AND THIS 's' WORKS \r\ns = [int(x) for x in input().split()]\r\n'''\r\ns.sort()\r\n\r\nfor _ in range(1):\r\n if(len(s)%2==1):\r\n y=len(s)//2\r\n f.append(s[y])\r\n else:\r\n z=(len(s)//2)-1\r\n f.append(s[z])\r\nprint(*f)\r\n\r\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 n = nextInt()\r\n arr = nextInts()\r\n\r\n arr.sort()\r\n\r\n print(arr[(n-1)//2])\r\n \r\n \r\nif __name__ == '__main__':\r\n exit(main())\r\n\r\n", "n = int(input())\r\narr = [int(x) for x in input().split()]\r\n\r\narr.sort()\r\n\r\nif n % 2 == 1: print(arr[n//2])\r\nelse: print(arr[n//2 - 1])", "n=int(input())\r\na=list(map(int,input().split()))\r\nif(len(a)%2!=0):\r\n a.sort()\r\n x=len(a)//2\r\n print(a[x])\r\nelse:\r\n a.sort()\r\n x=len(a)//2\r\n x=x-1\r\n print(a[x])\r\n", "n = int(input())\r\nlst = list(map(int, input().split()))\r\nlst.sort()\r\nif n % 2 == 1:\r\n print(lst[n//2])\r\nelse:\r\n print(lst[n//2 - 1])", "n = int(input())\r\nd = list(map(int, input().split()))\r\nd.sort()\r\nif n%2 != 0:\r\n print(d[(n//2+1)-1])\r\nelse:\r\n print(d[(n // 2 + 1)-2])", "n=int(input())\r\narr=list(map(int,input().split()))\r\narr.sort()\r\nans=arr[(n-1)//2]\r\nprint(ans)\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\nl.sort()\r\nif(n%2==0):\r\n\tn-=1\r\nprint(l[n//2])", "n = int(input())\r\na = sorted(map(int, input().split()))\r\n\r\nif n % 2:\r\n print(a[n//2])\r\nelse:\r\n print(a[n//2 - 1])\r\n\r\n\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\r\n/////////////////////////////////////////\r\n// //\r\n// Coded by brownfox2k6 //\r\n// //\r\n/////////////////////////////////////////\r\n\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\r\n\r\n# indice 0 1 2\r\n# array 1 2 3\r\n# turns s f ", "n=int(input())\r\nz=list(map(int,input().split()))\r\n\r\nz.sort()\r\n\r\nif (n%2==0) :\r\n print(z[(n//2)-1])\r\nelse:\r\n print(z[n//2])", "n=int(input())\r\ns=[int(i) for i in input().split()]\r\nfor i in range(n-1):\r\n if i%2==0:\r\n x=max(s)\r\n else:\r\n x=min(s)\r\n y=s.index(x)\r\n s.pop(y)\r\nprint(s[0])", "n=int(input())\r\nli=list(map(int,input().split()))\r\ni=1\r\nwhile len(li)>1:\r\n if i==1:\r\n li.remove(max(li))\r\n i=0\r\n else:\r\n li.remove(min(li))\r\n i=1\r\nprint(*li) ", "from math import ceil\nn = int(input())\na = list(map(int, input().split()))\na.sort()\nprint(a[ceil(n/2)-1])\n", "n=int(input())\r\nl1=list(map(int, input().strip().split()))[:n]\r\nl1.sort()\r\nm=int(n/2)\r\nif n%2!=0:\r\n \r\n print(l1[m])\r\nelse:\r\n mm=m-1\r\n print(l1[mm])\r\n", "a =int(input())\r\nb =sorted(map(int,input().split()))\r\nprint(b[(a-1)//2])\r\n\r\n\r\n'''\r\ndic={'purple':'Power','red':'Reality','green':'Time','blue':'Space','yellow':'Mind','orange':'Soul'}\r\nn=int(input())\r\nprint(6-n)\r\nfor i in range(0,n):\r\n s=input()\r\n del dic[s]\r\nfor i in dic:\r\n print(dic[i])\r\n '''\r\n'''a = int(input())\r\nfor i in range(a):\r\n b = input()\r\n #print(b[:-10])\r\n print(\"YES\" if '8' in input()[:-10] else \"NO\")\r\n '''\r\n'''''''''\r\n1 1 1 1 1 2 2 2 2 3 3 3 4 4\r\n1 5 3 2\r\ns=5/v1=1/v2=2/t1=1/t2=2/\r\na = 5+2\r\nb = 10+4\r\nb>a\r\n\r\n11221\r\n1[0]-5[1]-3[2]-2[3]\r\n1+1+2+\r\n11x4i\r\nxxiixxiixx\r\n\r\na = int(input())\r\nfor i in range(a):\r\n b = int(input())\r\n c = list(map(int, input().split()))\r\n if b*max(c)-sum(c) == 0:\r\n print(max(c))\r\n else:print(b*max(c)-sum(c)-b)'''''''''", "t = int(input())\r\nl = list(map(int, input().split()))\r\ncount = 0\r\nwhile len(l) != 1:\r\n if count % 2 == 0:\r\n l.remove(max(l))\r\n else:\r\n l.remove(min(l))\r\n count += 1\r\nprint(l[0])", "n = int(input())\r\nnums = input().split()\r\nnums = [int(c) for c in nums]\r\nnums = sorted(nums)\r\n\r\ni = 0\r\nif n % 2 != 0:\r\n print(nums[n//2])\r\nelse:\r\n print(nums[n//2 -1])", "n=int(input())\r\nm=sorted(list(map(int,input().split())))\r\nif(n%2!=0):\r\n\tprint(m[n//2 ])\r\nelse:\r\n\tprint(m[n//2 -1])", "n=int(input())\r\nA=[int(x)for x in input().split()]\r\nA.sort()\r\nif n%2==1:\r\n print(A[(n-1)//2])\r\nelse:\r\n print(A[n//2-1])\r\n\r\n", "n = int(input())\r\narr = [int(i) for i in input().split()]\r\narr.sort()\r\nidx = (n-1)//2\r\nprint(arr[idx])\r\n#print(median(arr))", "n=int(input())\nl=list(map(int,input().split()))\nwhile len(l)!=1:\n if len(l)==2:\n l.remove(max(l))\n else:\n l.remove(max(l))\n l.remove(min(l))\nfor i in l:\n print(i)\n", "n=int(input())\r\nl=sorted(list(map(int,input().split())))\r\nprint(l[(n-1)//2])", "t=int(input())\r\nb=[int(s) for s in input().split()]\r\nb.sort()\r\nif t%2==1:\r\n print(b[t//2])\r\nelse:\r\n print(b[t//2-1])", "a = int(input())\r\nb = [int(i) for i in input().split()]\r\nb.sort()\r\ne = (a-1)//2\r\nprint(b[e])\r\n\r\n", "n = int(input())\r\na = map(int, input().split())\r\na = list(a)\r\na.sort()\r\nif n % 2 == 0:\r\n n = int(n / 2 - 1)\r\nelse:\r\n n = int(n / 2)\r\nprint(a[n])\r\n", "total_numbers = int(input())\r\nnumbers = sorted([int(x) for x in input().split()])\r\n\r\nif total_numbers % 2 == 0:\r\n middle_index = (total_numbers // 2) - 1\r\nelse:\r\n middle_index = (total_numbers // 2)\r\n\r\nprint(numbers[middle_index])\r\n", "n = int(input())\r\nc = list(map(int, input().split()))\r\nc.sort()\r\nif n % 2 == 1:\r\n ans = c[(n - 1) // 2]\r\nelse:\r\n ans = c[(n // 2) - 1]\r\nprint(ans)", "n = int(input())\r\na = input().split()\r\nfor i in range(n):\r\n a[i]=int(a[i])\r\na.sort()\r\nprint(a[int((n - 1) / 2)])", "n = int(input())\r\n\r\nif n > 0:\r\n\tval = (input().split(\" \"))\r\n\tmat = [int(x) for x in val]\r\n\r\n\ti = 0\r\n\twhile i != n-1:\r\n\t\t\r\n\t\tmat.remove(max(mat))\r\n\t\ti +=1\r\n\t\tif i == n-1:\r\n\t\t\tbreak\r\n\t\tmat.remove(min(mat))\r\n\t\ti +=1\r\n\r\n\tprint(mat[0])", "n = int( input() )\nnumbers = input().split()\nnumbers = list(map(int, numbers))\nnumbers.sort(reverse = True)\nprint(numbers[n//2])\n\t\t \t \t \t\t\t \t\t\t \t \t\t\t \t\t", "a = int(input())\r\nb = sorted([int(i) for i in input().split()])\r\nfor i in range(a-1):\r\n if i % 2 == 0:\r\n del b[-1]\r\n else:\r\n del b[0]\r\nprint(*b)", "def main():\n\tn = int(input())\n\tx = list(map(int,input().split()))\n\tx.sort()\n\t\n\tif n%2 ==0:\n\t\tprint(x[(n//2) -1])\n\telse:\n\t\tprint(x[(n+1)//2 -1])\n\nmain()\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Tue Sep 8 09:41:40 2020\r\n\r\n@author: Rohan\r\n\"\"\"\r\n\r\nn=int(input())\r\na=[]\r\na=input().split()\r\nz=[int(i) for i in a]\r\nz=z[:n]\r\nfor i in range(n-1):\r\n if(i%2==0):\r\n z.remove(max(z))\r\n else:\r\n z.remove(min(z))\r\nprint(z[0])\r\n ", "x=int(input())\r\nl=list(map(int,input().split()))\r\nl.sort()\r\nwhile len(l)>1:\r\n l.pop()\r\n if len(l)==1:\r\n break\r\n l.pop(0)\r\nprint(*l)", "# https://codeforces.com/problemset/problem/984/A\r\nfrom random import randint\r\narr_len = int(input())\r\narr = list(map(int, input().strip().split()))\r\n\r\n\r\ndef quicksort(array):\r\n if len(array) < 2:\r\n return array\r\n low, same, high = [], [], []\r\n pivot = array[randint(0, len(array) - 1)]\r\n for item in array:\r\n if item < pivot:\r\n low.append(item)\r\n elif item == pivot:\r\n same.append(item)\r\n elif item > pivot:\r\n high.append(item)\r\n return quicksort(low) + same + quicksort(high)\r\n\r\n\r\narr = quicksort(arr)\r\nif arr_len % 2 == 0:\r\n print(arr[(arr_len // 2) - 1])\r\nelse:\r\n print(arr[arr_len // 2])\r\n", "n = int(input())\r\nl = list(input().split())\r\nl = [int(i) for i in l]\r\nfor i in range(n - 1):\r\n if i % 2 == 0:\r\n l.remove(max(l))\r\n else:\r\n l.remove(min(l))\r\nprint(l[0])", "n=int(input())\r\nx=sorted(list(map(int, input().split())))\r\nprint(x[(n-1)//2])", "n,ar=int(input()),list(map(int,input().split()))\r\nar_1=sorted(ar)\r\nif(n%2==0):\r\n print(ar_1[(n//2)-1])\r\nelse:\r\n print(ar_1[(n//2)])", "n = int(input())\nls = [eval(x) for x in input().split(\" \")]\nls.sort(reverse=True)\ni = 0\nwhile len(ls) != 1:\n\ti = i + 1\n\tif (i % 2 == 0):\n\t\tdel ls[len(ls)-1]\n\telse:\n\t\tdel ls[0]\nprint(ls[0])\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\nif n%2==1:\r\n print(A[n//2])\r\nelse:\r\n print(A[(n//2)-1])", "\nn = int(input())\na = sorted(map(int, input().split()))\n\nif len(a) % 2 == 0:\n r = a[len(a) // 2 - 1]\nelse:\n r = a[len(a) // 2]\n\nprint(r)", "n = int(input())\r\nl = [int(x) for x in input().split()]\r\nl.sort()\r\nif(len(set(l)) == 1):\r\n print(l[0])\r\nelif(n % 2 != 0):\r\n print(l[n//2])\r\nelse:\r\n print(l[n//2-1])\r\n", "import math\r\ninput()\r\na=sorted(list(map(int,input().split())))\r\nr=((len(a)//2)-1) if len(a)%2==0 else ((len(a)//2))\r\nprint(str(a[r]),end=\"\")", "n = int(input())\nl = [int(x) for x in input().split()]\nl.sort()\nif n % 2 == 0:\n print(l[n // 2 - 1])\nelse:\n print(l[n // 2])", "n = int(input())\r\nlst = sorted(list(map(int,input().split())))\r\n\r\nl = len(lst)\r\nif l%2==0:\r\n print(lst[l//2 - 1])\r\nelse:\r\n print(lst[l//2])", "n = int(input())\r\nx = sorted([int(i) for i in input().split()])\r\nif n % 2 == 1:\r\n print(x[int(n/2)])\r\nelse:\r\n print(x[int(n/2-1)])\r\n", "def solve():\r\n\tn = int(input())\r\n\tls = sorted(map(int, input().split()))\r\n\treturn ls[((n + (n & 1)) // 2) - 1]\r\n\r\n\r\nprint(solve())", "n=int(input())\na=map(int,input().split())\nb=sorted(list(a))\nif n%2!=0:\n\tprint(b[n//2])\nelse:\n\tprint(b[n//2-1])\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\nb=0\r\nwhile n>1:\r\n if b%2==0:\r\n a.remove(max(a))\r\n else:\r\n a.remove(min(a))\r\n n-=1\r\n b+=1\r\nprint(a[0])", "n=int(input())\r\nl=[int(x) for x in input().split(\" \")]\r\nl.sort()\r\nif(n%2==0):\r\n print(l[(n//2)-1])\r\nelse:\r\n print(l[n//2])", "a=int(input())\r\nb=list(map(int,input().split()))\r\nif a%2!=0:\r\n for i in range(a//2):\r\n b.remove(min(b))\r\n b.remove(max(b))\r\nelse:\r\n for i in range((a//2)-1):\r\n b.remove(min(b))\r\n b.remove(max(b))\r\n b.remove(max(b))\r\nfor i in b:\r\n print(i)", "a=int(input())\r\nb=list(map(int,input().split()))\r\nb.sort(reverse=True)\r\nprint(b[a//2],end='')", "n = int(input())-1\r\nA = sorted(list(map(int, input().split())))\r\nprint(A[n//2])", "n = int(input())\r\nns = sorted(list(map(int, input().split())))\r\nprint(ns[n//2-1] if n%2 == 0 else ns[n//2])", "\"\"\"\r\ns = input()\r\nl=[]\r\ni=0\r\nlens = len(s)\r\nwhile(i<len(s)):\r\n l.append(s[i:i+2])\r\n i+=2\r\nlen1 = len(l)\r\nif len1==1:\r\n print(\"NO\")\r\nelse:\r\n if lens%2==0:\r\n if \"AB\" in l and \"BA\" in l:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n else:\r\n\r\n if \"AB\" in l and \"BA\" in l:\r\n print(\"YES\")\r\n else:\r\n # print(l)\r\n if \"AB\" in l and \"BA\" not in l:\r\n if s.find(\"AB\")!=lens-3:\r\n s=\"\"\r\n s+=l[len1-2][1]+l[len1-1]\r\n if s==\"BA\":\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n else:\r\n print(\"NO\")\r\n elif \"BA\" in l and \"AB\" not in l:\r\n if s.find(\"BA\")!=lens-3:\r\n s=\"\"\r\n s+=l[len1-2][1]+l[len1-1]\r\n if s==\"AB\":\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n else:\r\n print(\"NO\")\r\n else:\r\n print(\"NO\")\r\n\"\"\"\r\n\"\"\"\r\ns = input()\r\nab=s.find(\"AB\")\r\nba = s.find(\"BA\")\r\nif s.find(\"BA\",ab+2)!=-1 and ab!=-1:\r\n print(\"YES\")\r\nelif s.find(\"AB\",ba+2)!=-1 and ba!=-1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\"\"\"\r\n\r\n\"\"\"\r\nn,m = map(int,input().split())\r\nif m%2!=0:\r\n l=[(m+1)//2]\r\n for i in range(1,(m+1)//2):\r\n l.append((m+1)//2 - i)\r\n l.append((m+1)//2 + i)\r\nelse:\r\n if m==2:\r\n l=[1,2]\r\n else:\r\n l=[m//2]\r\n for i in range(1,m//2):\r\n l.append(m//2+i)\r\n l.append(m//2-i)\r\n l.append(m)\r\nans = l*(n//len(l))\r\nans+=l[0:n%len(l)]\r\nfor i in range(n):\r\n print(ans[i])\r\n\"\"\"\r\n\"\"\"\r\ndef main():\r\n t = int(input())\r\n for _ in range(t):\r\n n = int(input())\r\n n = str(n)\r\n n= list(n)[::-1]\r\n i=0\r\n while(i<len(n)):\r\n if n[i]==\"0\":\r\n n.remove(n[i])\r\n else:\r\n break\r\n print(\"\".join(n))\r\nif __name__ == '__main__':\r\n main()\r\n\"\"\"\r\n\"\"\"\r\nt = int(input())\r\nfor _ in range(t):\r\n s = input()\r\n if len(s)%2==0:\r\n q = s[:len(s)//2]\r\n t = s[len(s)//2:]\r\n q = sorted(list(q))\r\n t = sorted((list(t)))\r\n if q==t:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n else:\r\n q = s[0:len(s) // 2]\r\n t = s[len(s) // 2 +1:]\r\n q = sorted(list(q))\r\n t = sorted((list(t)))\r\n if q == t:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n\"\"\"\r\nimport sys\r\ninput = sys.stdin.readline\r\n\"\"\"\r\nn= int(input())\r\nl=[]\r\nfor _ in range(n):\r\n p = int(input())\r\n l.append(p)\r\nl.sort()\r\ns=[]\r\nfor i in range(n):\r\n s.append(l[i]*(n-i))\r\n#print(s)\r\nprint(max(s))\r\n\"\"\"\r\n\"\"\"\r\nt = int(input())\r\nfor _ in range(t):\r\n n = int(input())\r\n s = list(map(int,input().split()))\r\n cnt=1\r\n for i in range(len(s)-1):\r\n #print(s[i])\r\n if s[i]>=s[i+1]:\r\n cnt+=1\r\n else:\r\n s[i+1]=s[i]\r\n print(cnt)\r\n\"\"\"\r\n\r\n\r\n# Python3 program to\r\n# count trailing 0s\r\n# in n!\r\n\r\n# Function to return\r\n# trailing 0s in\r\n# factorial of n\r\n\r\n\r\ndef findTrailingZeros(n):\r\n # Initialize result\r\n count = 0\r\n\r\n # Keep dividing n by\r\n # 5 & update Count\r\n while (n >= 5):\r\n n //= 5\r\n count += n\r\n\r\n return count\r\nn = int(input())\r\narr = list(map(int,input().split()))\r\narr = sorted(arr)\r\nprint(arr[(n+1)//2 - 1])\r\n\r\n", "n=(int)(input())\r\nl=list(map(int, input().split()))\r\nl.sort()\r\nif(n%2==1):\r\n print(l[n//2])\r\nelse:\r\n print(l[(n//2) -1])", "a = input()\r\nk = list(input().split())\r\ns = []\r\nfor i in k:\r\n s.append(int(i))\r\nt = 0\r\nwhile 1:\r\n t += 1\r\n if len(s) == 1:\r\n print(s[0])\r\n break\r\n else:\r\n if t % 2 == 1:\r\n s.remove(max(s))\r\n else:\r\n s.remove(min(s))", "from bisect import bisect_left, bisect_right\r\n\r\ndef tuple_input(type):\r\n return map(type, input().strip().split())\r\n\r\nn = int(input())\r\na = list(tuple_input(int))\r\na.sort()\r\nif n % 2 == 0:\r\n print(a[n // 2 - 1])\r\nelse:\r\n print(a[n // 2])\r\n", "n = int(input())\na = list(map(int, input().split()))\na.sort()\nif n %2 == 0:\n w = a[n//2-1]\nelse:\n w = a[n//2]\nprint(w)\n\t \t \t \t\t \t \t", "n=(int(input()))\r\nl1=list(map(int,input().split()))\r\nl1.sort()\r\nprint(l1[int((n-1)/2)])", "import math\r\nn=int(input())\r\ns=list(map(int,input().split(' ')))\r\ns=sorted(s)\r\nprint(s[math.ceil(len(s)/2)-1])\r\n", "import sys\n\n\nn = int(input())\nan = list(map(int, sys.stdin.readline().split()))\nan.sort()\nprint(an[(n-1) // 2])\n", "input()\r\nl = list(map(int,input().split()))\r\nflag = True\r\nwhile len(l) > 1:\r\n if flag:\r\n l.remove(max(l))\r\n else:\r\n l.remove(min(l))\r\n flag = not flag\r\nprint(l[0])", "n = int(input())\r\nnums = list(map(int,input().split()))\r\nnums.sort()\r\nprint(nums[(len(nums)-1)//2])", "n = int(input())\narr = list(map(int, input().split()))\n\narr = sorted(arr)\n\nprint(arr[(n-1)//2])", "def pop_back(l):\r\n l.pop(len(l)-1)\r\ndef pop_front(l):\r\n l.pop(0)\r\n\r\nn = int(input())\r\nls = list(map(int, input().strip().split()))\r\nls.sort()\r\nfor i in range(1, n):\r\n if i % 2 == 0:\r\n pop_front(ls)\r\n else:\r\n pop_back(ls)\r\nprint(*ls, sep=\"\")\r\n\r\n# C O M F O R T A B L Y N U M B\r\n", "n=int(input())\r\nb=list(map(int,input().split()))\r\nb.sort()\r\n\r\nprint(b[(n-1)//2])\r\n", "n, lst = int(input()), list(map(int, input().split()))\r\nlst.sort()\r\nif n % 2 == 0: print(lst[n // 2 - 1])\r\nelse: print(lst[n // 2])", "def answer():\r\n n = int(input())\r\n l = [int(x) for x in input().split()]\r\n l.sort()\r\n print(l[(int(n/2))-(n%2==0)])\r\nanswer()", "#!/usr/bin/env python\n# coding=utf-8\n'''\nAuthor: Deean\nDate: 2021-11-17 23:04:16\nLastEditTime: 2021-11-17 23:07:36\nDescription: Game\nFilePath: CF984A.py\n'''\n\n\ndef func():\n n = int(input())\n lst = list(sorted(map(int, input().strip().split())))\n\n if len(lst) % 2 == 0:\n print(lst[len(lst) // 2 - 1])\n else:\n print(lst[len(lst) // 2])\n\n\nif __name__ == '__main__':\n func()\n", "x = int(input())\r\narr = [int(q) for q in input().split()]\r\narr = sorted(arr)\r\nwhile len(arr) != 1:\r\n arr.pop(len(arr)-1)\r\n if len(arr) != 1:\r\n arr.pop(0)\r\nprint(arr[0])", "n=int(input())\na=list(map(int,input().split()))\nk=(n-1)//2\na.sort()\nprint(a[k])", "n = int(input())\r\np = list(map(int,input().split()))\r\np.sort()\r\na = (n-1)//2\r\nprint(p[a])", "#984A in codeforces\r\nn = int(input())\r\nboard = list(map(int,input().split()))\r\nfor i in range(n-1):\r\n\tif i%2 == 0:\r\n\t\tx = max(board)\r\n\t\tboard.remove(x)\r\n\telse:\r\n\t\tx = min(board)\r\n\t\tboard.remove(x)\r\nprint(board[0])", "number = int(input())\ndata = list(map(int, input().split()))\ncount = 1\nwhile count < number:\n if count % 2 == 1:\n data.remove(max(data))\n count += 1\n else:\n data.remove(min(data))\n count += 1\nprint(data[0])\n", "n = int(input())\nl = sorted([int(i) for i in input().split()])\nl[n//2]\nif n%2!= 0 :\n print(l[n//2])\nelse:\n print(l[(n//2)-1])", "n=int(input())\r\na=sorted(map(int,input().split()))\r\nprint(a[n//2] if n%2 else a[n//2-1])", "t = int(input())\r\na = [int(x) for x in input().split()]\r\na.sort()\r\nprint(a[(t+1)//2 - 1])", "#Game\r\nn=int(input())\r\ns=map(int,input().split())\r\nx=(n-1)//2\r\nst=sorted(s)\r\nprint(st[x])", "cantidad = int(input())\r\nnumeros = list(map(int, input().split()))\r\nnumeros.sort()\r\nfor _ in range(cantidad-1):\r\n numeros.reverse()\r\n numeros.pop(0)\r\nprint(numeros[0])", "d=int(input())\nn=list(map(int,input().split()))\n\nfor i in range(d-1):\n if i%2==0:\n n.remove(max(n))\n \n else:\n n.remove(min(n))\n \nprint(n[0])\n \t\t \t \t\t\t\t \t \t\t\t \t \t", "n = int(input())\r\narr = list(map(int, input().split()))\r\n\r\nfor i in range(n-1):\r\n if i % 2 == 0:\r\n arr.remove(max(arr))\r\n else:\r\n arr.remove(min(arr))\r\nprint(arr[0])", "n=int(input())\r\na=[int(i) for i in input().split()]\r\nif(len(a)==1):\r\n print(a[0])\r\nelse:\r\n a=sorted(a)\r\n if(len(a)%2!=0):\r\n print(a[len(a)//2])\r\n else:\r\n print(a[(len(a)//2)-1])", "\na = int(input())\nb = list(map(int, input().split()))\nb = sorted(b)\nif(a%2 == 0):\n ind = int(a/2)-1\nelse:\n ind = int((a+1)/2)-1\nprint(b[ind])\n \t \t\t \t \t\t \t\t\t \t\t\t \t\t\t \t \t", "import math\r\n\r\nn = int(input())\r\narr = [int(s) for s in input().split()]\r\n\r\narr.sort()\r\nindex = math.ceil(n / 2) - 1\r\n\r\nprint(arr[index])", "n = int(input())\na = sorted(list(map(int, input().split())))\nif len(a) % 2 == 1:\n print(a[len(a) // 2])\nelse:\n print(a[len(a) // 2 - 1])", "n = int(input())\r\nli = list(map(int,input().split()))\r\ni = 1\r\nwhile i<n:\r\n if i%2==1:\r\n li.remove(max(li))\r\n elif i%2==0:\r\n li.remove(min(li))\r\n i+=1\r\nprint(li[0])", "n=int(input())\r\na=sorted(list(map(int,input().split())))\r\nx=(len(a)-1)//2\r\nprint(a[x])", "n = int(input())\r\na = map(int, input().split())\r\na = sorted(a)\r\nprint(a[(n-1)//2])", "n = int(input())\r\n\r\nnums = list(map(int, input().split()))\r\n\r\n# will have n-1 turns\r\n# p1 wants to min\r\n# p2 wants to max\r\n# what will be the final num on the board?\r\n\r\n\r\nnums.sort()\r\n\r\nif n % 2 == 0:\r\n mid_num = n//2 - 1\r\nelse:\r\n mid_num = n//2\r\n\r\nprint(nums[mid_num])\r\n", "n = int(input())\nx = list(map(int, input().split()))\nx.sort()\nif n % 2 == 0:\n print(x[n // 2 - 1])\nelse:\n print(x[n // 2])\n", "import sys\r\n\r\ndef main():\r\n _, *q = map(int, sys.stdin.read().strip().split())\r\n return sorted(q)[len(q)//2 - (not len(q)%2)]\r\n \r\nprint(main())\r\n", "n = int(input())\nline = input()\na = [int(i) for i in line.split()]\na.sort()\npos = int((n+1)/2)-1 \nprint(a[pos])\n\t\t \t \t\t\t \t \t\t\t \t\t\t\t \t \t", "n = int(input())\n\nnl = list(map(int, input().split()))\n\nnl.sort()\n\nif n%2 == 0:\n\tprint(nl[int(n/2)-1])\nelse:\n\tprint(nl[int(n/2)])", "n=int(input())\r\na=[int(x) for x in input().strip().split(' ')]\r\na.sort()\r\nc=1\r\nfor i in range(n-1):\r\n if c==1:\r\n a.pop(-1)\r\n else:\r\n a.pop(0)\r\n c^=1\r\nprint(a[0])", "n=int(input())\nl=list(map(int,input().split()))\nl.sort()\ni=1\nwhile len(l)>1:\n if i%2!=0:\n l.pop(-1)\n i+=1\n else:\n l.pop(0)\n i+=1\nprint(l[0])\n", "n=int(input())\r\ns=0\r\nj=k=0\r\np=input().split()\r\nl=list(map(int,p))\r\nl.sort()\r\nif(n%2!=0):\r\n print(l[n//2])\r\nelse:\r\n print(l[n//2-1])", "x = int(input())\r\narray = list(map(int , input().split()))\r\narray.sort()\r\nprint(array[(x-1)//2])", "n = int(input())\r\nnumbers = list(map(int, input().split(\" \")))\r\nplayer_1=1\r\nplayer_2=0\r\nfor i in range(n-1):\r\n if player_1==1:\r\n numbers.remove(max(numbers))\r\n else:\r\n numbers.remove(min(numbers))\r\n player_1, player_2 = player_2, player_1\r\nprint(numbers[0])", "n=int(input())\r\nar=sorted(map(int,input().split()))\r\nif n%2==0:\r\n print(ar[n//2-1])\r\nelse:\r\n print(ar[n//2])\r\n ", "n=int(input())\r\nl=list(map(int,input().split()))\r\ni=0\r\nwhile(n>1):\r\n n-=1\r\n i+=1\r\n if(i%2!=0):\r\n l.remove(max(l))\r\n else:\r\n l.remove(min(l))\r\nfor i in l:\r\n print(i)", "\r\n\r\nn=int(input())\r\nx=[int(w) for w in input().split()]\r\nx.sort()\r\nprint(x[n//2] if n%2!=0 else x[n//2-1])\r\n \r\n \r\n \r\n \r\n \r\n ", "_ = input()\r\nnums = sorted(list(map(int,input().split())))\r\nprint(nums[-1*(-len(nums)//2)-1])", "n =int(input())\r\nboard = sorted(list(map(int,input().split())))\r\nprint(board[(n-1)//2])", "n = int(input()) \nli = [int(x) for x in input().split()] \nli.sort() \ni = int((n-1)/2) \t\nprint(li[i])", "n = int(input())\r\n \r\narr = [int(i) for i in input().split()]\r\n \r\nn -= 1\r\nq = True\r\nwhile n:\r\n if q:\r\n arr.remove(max(arr))\r\n else:\r\n arr.remove(min(arr))\r\n q = not q\r\n n -= 1\r\n \r\nprint(arr[0])", "n = int(input())\r\na = list(map(int, input().split()))\r\n# [38, 82, 23, 37, 96, 4, 81, 60, 67, 86]\r\na.sort()\r\n# print(a)\r\nprint(a[(n-1)//2])", "n=int(input())\na=list(map(int,input().split()))\nn//=2\na.sort()\na=a[::-1]\nprint (a[n])\n", "n=int(input())\r\nf=[int(i) for i in input().split()]\r\nwhile len(f)>1:\r\n g=max(f)\r\n f.remove(g)\r\n if len(f)>1:\r\n g=min(f)\r\n f.remove(g)\r\nprint(*f)\r\n", "a=int(input())\nx = [int(i) for i in input().split()]\nif(len(x)%2!=0):\n while(len(x)!=1):\n b=max(x)\n x.remove(b)\n c=min(x)\n x.remove(c)\nelse:\n while(len(x)!=2):\n b=max(x)\n x.remove(b)\n c=min(x)\n x.remove(c)\n b=max(x)\n x.remove(b)\nprint(x[0])\n \t \t \t\t \t\t \t\t\t\t\t\t \t", "n = int(input())\r\n\r\nlst = [int(i) for i in input().split()]\r\n\r\nlst = sorted(lst)\r\n\r\nprint(lst[n // 2 - 1]) if n % 2 == 0 else print(lst[n // 2])\r\n", "import heapq\r\nimport random\r\n\r\ndef select(data, n):\r\n \"Find the nth rank ordered element (the least value has rank 0).\"\r\n data = list(data)\r\n if not 0 <= n < len(data):\r\n raise ValueError('not enough elements for the given rank')\r\n while True:\r\n pivot = random.choice(data)\r\n pcount = 0\r\n under, over = [], []\r\n uappend, oappend = under.append, over.append\r\n for elem in data:\r\n if elem < pivot:\r\n uappend(elem)\r\n elif elem > pivot:\r\n oappend(elem)\r\n else:\r\n pcount += 1\r\n if n < len(under):\r\n data = under\r\n elif n < len(under) + pcount:\r\n return pivot\r\n else:\r\n data = over\r\n n -= len(under) + pcount\r\n\r\nn = int(input())\r\n\r\na = [int(x) for x in input().split()]\r\n\r\nprint(select(a, (n - 1) >> 1))", "n = int(input())\ngeneral = list(map(int, input().split()))\n\nfor i in range(1, n):\n if i % 2 != 0:\n general.remove(max(general))\n elif i % 2 == 0:\n general.remove(min(general))\n\nprint(general[0])\n", "# cf 984 A (700)\nn = int(input())\nA = list(map(int, input().split()))\n# first = minimize last, second = maximize last\n# first = take largest, second = take smallest\nA.sort()\n\nif len(A) % 2 == 1:\n print(A[len(A) // 2])\nelse:\n print(A[len(A) // 2 - 1])\n\n#i, j = 0, len(A) - 1\n#while j - i > 1:\n# i += 1\n# j -= 1\n#print(A[i])\n", "w=int(input())\r\nl=list(map(int,input().split()))\r\nl.sort()\r\nprint(l[(len(l)-1)//2])", "m=int(input())\r\nn=input()\r\nr=n.split(' ')\r\ns=[]\r\nfor i in r:\r\n s.append(int(i))\r\ns.sort()\r\nif m%2==0:\r\n a=int(m/2)-1\r\n print(int(s[int(a)]))\r\nelse:\r\n print(int(s[int(m/2)]))\r\n \r\n", "n = int(input())\r\na = [int(i) for i in input().split()]\r\nturns = 1\r\n\r\nwhile len(a) != 1:\r\n if turns % 2 == 0:\r\n x = min(a)\r\n\r\n else:\r\n x = max(a)\r\n\r\n a.remove(x)\r\n turns = turns + 1\r\n\r\nprint(a[0])", "n=int(input())\r\n\r\nl=list(map(int,input().split()))\r\ncnt=0\r\nwhile(len(l)>1):\r\n if(cnt==0):\r\n l.remove(max(l))\r\n cnt=1\r\n else:\r\n l.remove(min(l))\r\n cnt=0\r\n\r\nprint(l[0])", "n=int(input())\r\nnum=list(map(int,input().split()))\r\nnum.sort()\r\nif n%2!=0:\r\n v=n//2\r\nelse:\r\n v=(n//2)-1\r\nprint(num[v])", "n = int(input())\r\nL = sorted([int(x) for x in input().split()])\r\nprint(L[len(L)//2 - 1] if len(L)%2 == 0 else L[len(L)//2])\r\n", "n=int(input())\r\nd=list(map(int,input().split()))\r\nd.sort()\r\nif n % 2 == 0:\r\n print(d[(n-1)//2])\r\nelse:\r\n print(d[n//2])", "n = int(input())\r\na = [int(i) for i in input().split()]\r\n\r\na.sort()\r\nif n%2 == 0:\r\n print(a[n//2-1])\r\nelse:\r\n print(a[n//2])", "n = int(input())\r\nl = sorted(map(int,input().split()))\r\nprint([l[(n//2)-1],l[n//2]][n%2])", "t=int(input())\r\nl=(list(map(int,input().split())))\r\nl.sort(reverse=True)\r\n\r\n\r\na=int(t/2)\r\nprint(l[a])", "n=int(input())\r\ns=map(int,input().split())\r\ns_sorted=sorted(s)\r\nif n%2==0:\r\n min=n//2\r\n print(s_sorted[min-1])\r\nelse:\r\n min = n//2\r\n print(s_sorted[min])", "import sys\r\nimport math\r\nimport bisect\r\n\r\ndef main():\r\n n = int(input())\r\n A = list(map(int, input().split()))\r\n A.sort()\r\n print(A[(n-1)//2])\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "\nif __name__ == \"__main__\":\n n = int(input())\n numbers = list(map(int,input().split()))\n numbers.sort()\n while len(numbers) > 1:\n numbers.pop()\n if len(numbers)>1:\n numbers.pop(0)\n print(numbers[0])\n \t \t\t \t\t\t \t\t \t\t \t\t\t \t\t\t \t\t", "n = int(input())\r\nli = list(map(int, input().split()))\r\nli.sort()\r\na = (n - 1)//2\r\nprint(li[a])", "n = int(input())\r\na = list(map(int, input().split()[:n]))\r\nturn = 0\r\n\r\nwhile len(a) > 1:\r\n if turn % 2 == 0:\r\n a.remove(max(a))\r\n else:\r\n a.remove(min(a))\r\n turn += 1\r\n\r\nprint(''.join(str(x) for x in a))\r\n\r\n", "import math\r\n\r\nn = int(input())\r\nx= [ int(n) for n in input().split(\" \") ] #no to be inserted in arrays\r\nx = sorted( x )\r\nt= math.ceil( len(x) / 2 ) \r\n\r\n\r\n\r\nprint( x[t-1] )", "def main():\r\n n = int(input())\r\n a = list(map(int, input().split()))\r\n a = sorted(a)\r\n for i in range(n-1):\r\n if (i+1) % 2 == 0:\r\n a.pop(0)\r\n continue\r\n a.pop(len(a)-1)\r\n print(a[0])\r\n\r\nif __name__ == '__main__':\r\n main()", "n = int(input())\r\na = [int(elem) for elem in input().split()]\r\na.sort()\r\nif len(a) % 2 == 0:\r\n print(a[len(a) // 2 - 1])\r\nelse:\r\n print(a[len(a) // 2])", "import math\r\nn=int(input())\r\nl=list(map(int,input().split()))\r\nl.sort()\r\nif n&1:\r\n print(l[n//2])\r\nelse:\r\n print(l[math.floor(n/2)-1])", "n=int(input())\r\nprint(sorted(map(int,input().split()))[n-1>>1])", "def min_max_game(n, a):\r\n a.sort()\r\n k = n // 2\r\n if n % 2 == 0:\r\n k -= 1\r\n return a[k]\r\n\r\nprint(min_max_game(n=int(input()), a=[int(item) for item in input().split()]))", "n = int(input())\nl = list(map(int,input().split()))\nl.sort()\nif n%2 !=0:\n print(l[n//2])\nelse:\n print(l[(n-1)//2])\n\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()\nfrom collections import deque\nq = deque(A)\nfor i in range(n-1):\n if i%2 == 0:\n q.pop()\n else:\n q.popleft()\nprint(q[0])\n", "d=int(input())\nn=list(map(int,input().split()))\nc=0\n\nfor i in range(d-1):\n if c%2==0:\n n.sort()\n n.pop()\n \n else:\n n.reverse()\n n.pop()\n c+=1\nprint(n[0])\n \t\t \t \t \t \t \t \t \t\t \t\t\t", "import math\r\nn1 = int(input())\r\nx = input().split()\r\nlist1 = []\r\nfor i in x:\r\n list1.append(int(i))\r\nlist1.sort()\r\n\r\nprint(list1[math.ceil(n1/2)-1])\r\n", "n=int(input())\r\nl=list(map(int,input().split()))[:n]\r\nl.sort()\r\nif n%2==1:\r\n k=l[len(l)//2]\r\n print(k)\r\nelse:\r\n k=l[(len(l)//2)-1]\r\n print(k)", "n = int(input())\r\nnum = list(map(int, input().split(' ')))\r\n\r\ni=0\r\nwhile len(num) >1:\r\n if i%2 ==0 : #first player\r\n num.remove(max(num))\r\n else: #second player\r\n num.remove(min(num))\r\n i+=1\r\n\r\nprint(num[0])", "n=int(input())\r\na=list(map(int,input().split()))\r\ni=0\r\na.sort()\r\nwhile len(a)!=1:\r\n if i==0:\r\n del(a[len(a)-1])\r\n i=1\r\n else:\r\n del(a[0])\r\n i=0\r\nprint(a[0])\r\n", "N=int(input())\r\na=list(map(int,input().strip().split()))\r\nwhile(len(a)>1):\r\n mx=max(a)\r\n a.remove(mx)\r\n if(len(a)>1):\r\n m=min(a)\r\n a.remove(m)\r\n else:break \r\nprint(*a) \r\n\r\n\r\n ", "input()\r\n\r\nls = list(map(int,input().split()))\r\nls.sort()\r\n\r\nprint(ls[(len(ls)-1)//2])", "n = int(input())\r\n\r\nl=[int(i) for i in input().split()]\r\nl.sort()\r\nwhile len(l)>1:\r\n if len(l)==2:\r\n del l[-1]\r\n \r\n else:\r\n del l[-1]\r\n del l[0]\r\nprint(l[0])", "n = int(input())\nA = [int(j) for j in input().split()]\nA.sort()\nif n % 2 == 0:\n print(A[n // 2 - 1])\nelse:\n print(A[n // 2])", "n = int(input())\r\nL = list(map(int, input().split()))\r\nL.sort()\r\nprint(L[n // 2 if n % 2 else n // 2 - 1])", "n = int(input())\n\nnumbers = list(map(int, input().split(\" \")))\n\ni=1\n\nwhile len(numbers) != 1 :\n if i % 2 == 0 :\n numbers.remove(min(numbers))\n else :\n numbers.remove(max(numbers))\n i += 1\n\nprint(numbers[0])\n\n\n", "n,a=int(input()),list(map(int,input().split()))\r\na.sort()\r\nprint(a[int(n/2)] if n%2!=0 else a[int(n/2-1)])\r\n", "maxTurn=True\r\nn=int(input())\r\narr=list(map(int,input().split()))\r\nn-=1\r\nfor _ in range(n):\r\n if maxTurn:\r\n arr.remove(max(arr))\r\n maxTurn=False\r\n else:\r\n arr.remove(min(arr))\r\n maxTurn=True\r\nprint(arr[0])", "n=int(input())\r\nli=[int(x) for x in input().split()]\r\nli.sort()\r\nif n%2==0:\r\n print(li[n//2-1])\r\nelse:\r\n print(li[n//2])\r\n", "n = int(input())\r\nb = list(map(int, input().split()))\r\nb = sorted(b)\r\nif n%2 == 0:\r\n for i in range(n//2-1):\r\n del(b[-1])\r\n del(b[0])\r\n print(min(b)) \r\nif n%2 == 1:\r\n print(b[n//2])\r\n", "import sys\r\n\r\nn=int(sys.stdin.readline().split()[0])\r\nnumbers=sys.stdin.readline().split()\r\nfor i in range(n):\r\n numbers[i]=int(numbers[i])\r\na=list(numbers)\r\nwhile len(a)>1:\r\n maximum=0\r\n minimum=1000001\r\n for i in range(len(a)):\r\n if a[i]>maximum:\r\n maximum=a[i]\r\n if a[i]<minimum:\r\n minimum=a[i]\r\n if len(a)>1:\r\n a.remove(maximum)\r\n if len(a)>1:\r\n a.remove(minimum)\r\nsys.stdout.write(str(a[0]))\r\n\r\n", "n = int(input())\r\nl = list(map(int,input().split(' ')))\r\nl.sort()\r\nk = len(l)//2\r\nif n%2==0:\r\n k=k-1\r\nprint(l[k])", "n = int(input())\r\nlst = sorted([int(i) for i in input().split()])\r\nprint(lst[(n+1)//2 - 1])\r\n", "\r\ntry :\r\n n = int(input()) \r\n sequence = list(map(int,input().split()))\r\n sequence.sort() \r\n count=2\r\n for each in range (0 , n-1): \r\n if(count%2 == 0):\r\n sequence.remove(sequence[-1]) \r\n else:\r\n sequence.remove(sequence[0])\r\n count+=1\r\n print(sequence[0])\r\n \r\n \r\nexcept :\r\n pass", "from posixpath import split\r\n\r\n\r\nn = int(input())\r\nl = sorted(list(map(int, input().split())))\r\nr = -1\r\nwhile n>1:\r\n l.pop(r)\r\n r = -1 if r==0 else 0\r\n n-=1\r\nprint(l[0])\r\n", "n = int(input())\r\nl1=list(map(int,input().split()))\r\n\r\nfor i in range(n-1):\r\n while len(l1)!=1:\r\n if len(l1) !=1:\r\n l1.remove(max(l1))\r\n if len(l1) !=1:\r\n l1.remove(min(l1))\r\nprint(*l1)", "n = int(input())\r\na = list(map(int,input().split(\" \")))\r\na.sort()\r\nif(len(a)%2 != 0):\r\n print(a[len(a)//2])\r\nelif(len(a)%2==0):\r\n print(a[len(a)//2 - 1])", "amount = int(input())\r\nnumbers = [int(x) for x in input().split()]\r\n\r\nnumbers.sort()\r\n\r\nif amount % 2 != 0:\r\n print(numbers[amount // 2])\r\nelse:\r\n print(numbers[amount // 2 - 1])", "probs = int(input())\r\n\r\nnumbers = list(map(int, input().split(' ')))\r\nnumbers.sort()\r\nout = 0\r\nlength = len(numbers)\r\nif length % 2 == 0:\r\n out = numbers[(length//2)-1]\r\nelse:\r\n out = numbers[(length//2)]\r\nprint(out)", "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 string = input()\r\n lst = list(map(int, string.split()))\r\n lst.sort()\r\n ans = 0\r\n if( n%2 == 0):\r\n ans = lst[int((n/2)) - 1]\r\n else:\r\n ans = lst[int((n-1)/2)]\r\n print(ans)\r\n\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", "t = int(input())\r\na = list(map(int,input().split(\" \")))\r\na.sort()\r\nif len(a) % 2 == 1:\r\n print(a[t//2])\r\nelse:\r\n print(a[t//2 - 1])", "n=int(input())\r\nnum=input().split()\r\nnum=[int(num[i]) for i in range(n)]\r\nwhile len(num)!=1:\r\n\tnum.remove(max(num))\r\n\tif len(num)>1:\r\n\t\tnum.remove(min(num))\r\nnum[0]=str(num[0])\r\nnum=\"\".join(num)\r\nprint(num)", "a = int(input())\nb = list(map(int, input().split()))\nfor i in range(a -1):\n if i % 2 == 0:\n b.remove(max(b))\n else: b.remove(min(b))\nprint(b[0])", "# import sys\r\n# sys.stdin=open(\"input.in\",'r')\r\n# sys.stdout=open(\"ou.out\",'w')\r\nn=int(input())\r\na=list(map(int,input().split()))\r\na.sort()\r\nif n%2==0:\r\n\tx=n//2-1\r\nelse:\r\n\tx=n//2\r\nprint(a[x])\r\n", "n=int(input())\r\nintlist=list(map(int,input().split()))\r\nfor i in range(1,n):\r\n if(i%2!=0):\r\n intlist.remove(max(intlist))\r\n else:\r\n intlist.remove(min(intlist))\r\nprint(intlist[0]) ", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Fri May 31 01:16:13 2019\r\n\r\n@author: avina\r\n\"\"\"\r\nn = int(input())\r\nl = list(map(int,input().split()))\r\nl.sort()\r\nif n%2 == 0:\r\n print(l[n//2 - 1])\r\nelse:\r\n print(l[n//2])", "n=int(input())\r\nlist=[int(i) for i in input().split()]\r\nlist.sort()\r\nif(n%2):\r\n print(list[int(n/2)])\r\nelse:\r\n print(list[int(n/2)-1])", "m = int(input())\r\na = list(map(int, input().strip().split()))[:m]\r\nfor i in range(0, m-1):\r\n if i % 2 == 0:\r\n k = max(a)\r\n a.remove(k)\r\n else:\r\n k = min(a)\r\n a.remove(k)\r\nprint(a[0])\r\n", "a =int(input())\r\nb = sorted(list(map(int,input().split())))\r\nif a%2 == 0:\r\n print(b[a//2-1])\r\nelse:\r\n print(b[a//2])", "k = int(input())\r\nj = input().split()\r\ns = []\r\nfor g in j:\r\n s.append(int(g))\r\nwhile len(s) != 1:\r\n s.remove(max(s))\r\n if len(s) == 1:\r\n break\r\n s.remove(min(s))\r\nprint(s[0])", "import sys\r\nimport math\r\ndef input(): return sys.stdin.readline().strip()\r\ndef iinput(): return int(input())\r\ndef minput(): return map(int, sys.stdin.readline().strip().split()) \r\ndef listinput(): return list(map(int, sys.stdin.readline().strip().split())) \r\nn=iinput()\r\na=listinput()\r\nfor i in range(n-1):\r\n if i%2==0:\r\n a.remove(max(a))\r\n else:\r\n a.remove(min(a))\r\nprint(*a)", "n=int(input())\r\narr=[0]*n\r\narr=list(map(int, input().split()))\r\narr.sort(reverse=True)\r\n\r\nprint(arr[int(n/2)])\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\nstep = 1\r\na.sort()\r\nwhile len(a) > 1:\r\n\tif step % 2 == 1:\r\n\t\ta.pop()\r\n\telse:\r\n\t\ta.pop(0)\r\n\tstep += 1\r\nprint(*a)", "from collections import deque, defaultdict\r\nfrom math import sqrt, ceil, factorial, floor, inf, gcd, log\r\nimport bisect\r\nimport sys\r\nimport copy\r\ndef get_array(): return list(map(int, sys.stdin.readline().strip().split()))\r\ndef get_ints(): return map(int, sys.stdin.readline().strip().split())\r\ndef input(): return sys.stdin.readline().strip()\r\n\r\nn = int(input())\r\na = get_array()\r\na.sort()\r\nif n%2 == 0:\r\n print(a[n//2-1])\r\nelse:\r\n print(a[n//2])", "n=int(input())\r\nl=list(map(int,input().split()))\r\nl.sort()\r\nimport collections\r\nde=collections.deque(l)\r\nfor i in range(len(de)-1):\r\n\tif i%2==0:\r\n\t\tde.pop()\r\n\telse:\r\n\t\tde.popleft()\r\nprint(*de)", "n=int(input())\r\nl=list(map(int,input().split()))\r\nc=0\r\nfor i in range(n-1):\r\n if c==0:\r\n l.remove(max(l))\r\n c=1\r\n elif c==1:\r\n l.remove(min(l))\r\n c=0\r\nprint(l[0])", "import math\r\nfrom collections import defaultdict\r\nt=int(input())\r\nlis=list(map(int,input().split()))\r\nlis.sort()\r\nif t%2==0:\r\n print(lis[t//2 - 1])\r\nelse:\r\n print(lis[(t-1)//2])", "n = int(input())\r\na = sorted([int(x) for x in input().split()])\r\nif n%2==0:\r\n\tprint(a[n//2-1])\r\nelse:\r\n\tprint(a[n//2])", "n = int(input())\r\narr = list(map(int,input().split()))\r\narr.sort()\r\nif(n%2==1):\r\n print(arr[(n//2)])\r\nelse:\r\n print(arr[n//2-1])", "list=[]\nn = int(input())\nlist_p = input()\nlist = list_p.split(' ')\nlist= [int(x) for x in list]\nlist.sort()\nif n%2==0:\n n = int(n/2-1)\nelse:\n n = int((n-1)/2)\nprint (list[n])\n\t \t \t \t \t \t \t \t", "n = int(input())\r\nListOf_n = list(map(int, input().split()))\r\ndel ListOf_n[n:]\r\n# print(ListOf_n)\r\nfor i in range(n - 1):\r\n if i%2 == 0:\r\n max_num1 = max(ListOf_n)\r\n try:\r\n ListOf_n.remove(max_num1)\r\n except Exception as e:\r\n print(e)\r\n else:\r\n min_num1 = min(ListOf_n)\r\n try:\r\n ListOf_n.remove(min_num1)\r\n except Exception as e:\r\n print(e)\r\n\r\nprint(ListOf_n[0])\r\n", "n=int(input())\nl=list(map(int,input().split()))\nl.sort()\nif(n%2==0):\n x=n//2\n print(l[x-1])\nelse:\n x=n//2\n print(l[x])", "n=int(input())\r\nl1=[int(i) for i in input().split()]\r\nl1.sort()\r\nif n%2!=0:\r\n print(l1[int((n-1)/2)])\r\nelse :\r\n print(l1[int((n-2)/2)])", "n = int(input())\r\na = list(map(int,input().split()))\r\na = sorted(a)\r\ni = len(a)\r\nprint(a[int((i-1)/2)])\r\n#print(a)", "a = int(input())\r\nprint(sorted([int(i) for i in input().split()], reverse=True)[a//2])", "n=int(input())\r\nj=input().split(\" \")\r\nl=[]\r\nfor i in j:\r\n l.append(int(i))\r\n\r\nl.sort()\r\nif n%2==1:\r\n while len(l)>1:\r\n l.remove(max(l))\r\n l.remove(min(l))\r\nelif n%2==0:\r\n l.remove(max(l))\r\n while len(l)>1:\r\n l.remove(min(l))\r\n l.remove(max(l))\r\nprint(l[0])", "import sys\r\n# sys.stdin = open(\"IO/input.txt\", \"r\")\r\n\r\nn = int(input())\r\nl = list(map(int, input().split(\" \")))\r\nl.sort()\r\n\r\nif n % 2 == 0:\r\n l.pop(-1)\r\n n = len(l)\r\nprint(l[n // 2])\r\n", "N = int(input())\r\nA = list(map(int,input().split()))\r\nA.sort()\r\nif N%2 == 1:\r\n print(A[N//2])\r\nelse:\r\n print(A[N//2-1])", "# Problem Name : Game\r\n# problem Link : https://codeforces.com/problemset/problem/984/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\narr.sort()\r\nif n%2==0:\r\n print(arr[int(n/2-1)])\r\nelse :\r\n print(arr[int(n/2)])", "import sys\r\n\r\ndef solve(s, n):\r\n print(s[int((n - 1)/2)])\r\n\r\ndef main():\r\n n = int(input())\r\n s = list(map(int, sys.stdin.readline().split()))\r\n s.sort()\r\n solve(s, n)\r\n\r\nmain()\r\n", "n = int(input())\r\nprint(sorted([int(i) for i in input().split()])[(n - 1) // 2])", "n = int(input())\r\nli = [int(i) for i in input().split()]\r\nli.sort()\r\ncounter = li.count(li[0])\r\nif counter == len(li):\r\n print(li[0])\r\nelse:\r\n if n%2 == 0:\r\n print(li[(n//2)-1])\r\n else:\r\n print(li[n//2])", "n = int(input())\narr = sorted([int(_) for _ in input().split()])\n\nif n % 2 == 0:\n print(arr[(n//2) - 1])\n\nelse:\n print(arr[n//2])\n\n", "\r\nn = int(input())\r\na = list(map(int,input().split()))\r\n\r\na.sort()\r\n\r\nif n% 2 == 1:\r\n\tprint(a[n//2])\r\nelse:\r\n\tprint(a[n//2 - 1])\r\n\r\n'''\r\n10\r\n38 82 23 37 96 4 81 60 67 86\r\n\r\n'''", "a = int(input())\r\nb = [int(x) for x in input().split()]\r\ni = 1\r\nwhile(i<a):\r\n if(i%2 == 1):\r\n b.remove(max(b))\r\n else:\r\n b.remove(min(b))\r\n i += 1\r\n \r\nprint(b.pop())\r\n ", "n=int(input())\r\na=sorted(list(map(int,input().split())))\r\n# print(a)\r\nif n%2!=0:\r\n\tprint(a[n//2])\r\nelse:\r\n\tprint(a[n//2-1])", "n=int(input())\r\nl=[int(t) for t in input().split()]\r\nl.sort()\r\nprint(l[(n-1)//2])\r\n", "n = int(input())\r\na = [int(x) for x in input().split()]\r\na = sorted(a)\r\nif n%2 == 0:\r\n print(a[n//2 - 1])\r\nelse:\r\n print(a[n//2])\r\n", "import time\r\n\r\n\r\ndef calculateLastNumber(nums, numsList):\r\n numsList.sort()\r\n pos = 0\r\n\r\n if nums % 2== 0:\r\n pos = nums // 2 - 1\r\n else:\r\n pos = nums // 2\r\n\r\n return numsList[pos]\r\n\r\n\r\n\r\n\r\ndef solve():\r\n nums = int(input())\r\n \r\n numsList = list(map(int, input().split()))\r\n\r\n print(calculateLastNumber(nums, numsList))\r\n\r\n # print(\"%fs\" % (time.time() - start_time))\r\n\r\n\r\nsolve()\r\n", "n=int(input())\r\nnum=list(map(int,input().split()))\r\nturn=0\r\nwhile len(num)>1:\r\n if turn%2==0:\r\n m=max(num)\r\n else:\r\n m=min(num)\r\n num.remove(m)\r\n turn=(turn+1)%2\r\n\r\nprint(num[0])", "'''\r\n\tCodeForces 984A\r\n\tGame\r\n\r\n\tTags: Sorting\r\n'''\r\ninput()\r\nres = sorted(map(int, input().split()))\r\nprint(res[(len(res) - 1) // 2])", "import math\r\nn = int(input())\r\nseq = [int(i) for i in input().split()]\r\n\r\nseq.sort()\r\nprint(seq[math.ceil(n / 2) - 1])", "t = int(input())\r\nlis = [int(i) for i in input().split()][:t]\r\nfor i in range(0, t-1):\r\n if i % 2 == 0:\r\n lis.remove(max(lis))\r\n else:\r\n lis.remove(min(lis))\r\nprint(*lis, end='\\n')\r\n", "n=int(input())\r\nA=list(map(int,input().split()))\r\ndef game(A):\r\n for i in range(len(A)):\r\n if A[i]==max(A):\r\n A.pop(i)\r\n break\r\n if len(A)==1:\r\n k=A[0]\r\n else:\r\n for i in range(len(A)):\r\n if A[i]==min(A):\r\n A.pop(i)\r\n break\r\nfor i in range(n//2):\r\n game(A)\r\nprint(A[0])", "n=int(input())\r\nL=list(map(int,input().split()))\r\nL.sort()\r\nif(n%2):\r\n print(L[n//2])\r\nelse:\r\n print(L[n//2-1])", "# def sol():\r\n# for i in range(len(lst)):\r\n# for j in range(i+1, len(lst)):\r\n# if lst[i][1] > lst[j][1]:\r\n# return True\r\n# return False\r\n#\r\n#\r\n# n = int(input())\r\n# lst = []\r\n# lstb = []\r\n# for i in range(n):\r\n# p, q = [int(i) for i in input().split()]\r\n# lst.append((p, q))\r\n# lstb.append(q)\r\n# lst.sort(key=lambda x: x[0])\r\n# lstb.sort()\r\n# if sol():\r\n# print(\"Happy Alex\")\r\n# else:\r\n# print(\"Poor Alex\")\r\n\r\nn = int(input())\r\nlst = [int(i) for i in input().split()]\r\nlst.sort()\r\nmid = len(lst)//2\r\nif n%2 == 1:\r\n print(lst[mid])\r\nelse:\r\n print(lst[mid-1])", "n = int(input())\r\na = list(map(int, input().split()))\r\na = sorted(a)\r\nif n % 2 == 1:\r\n print(a[len(a)//2])\r\nelse:\r\n print(a[len(a) // 2 - 1])" ]

[ "from itertools import *\r\n\r\ndef read(fn=int):\r\n\treturn map(fn,input().split())\r\n\r\nn,k,A = read()\r\nbl = [[*read()] for _ in range(n)]\r\nb,l = map(list,zip(*bl))\r\n\r\nans = 0\r\nfor p in combinations_with_replacement(range(n),k):\r\n\tfor i in p:\r\n\t\tl[i] += 10\r\n\r\n\ts = 0\r\n\tfor p2 in product(range(2),repeat=n):\r\n\t\tv = 1\r\n\t\tB = 0\r\n\t\tfor i,x in enumerate(p2):\r\n\t\t\tif x:\r\n\t\t\t\tv *= min(l[i],100)/100\r\n\t\t\telse:\r\n\t\t\t\tv *= 1-(min(l[i],100)/100)\r\n\t\t\t\tB += b[i]\r\n\t\t\r\n\t\tif sum(p2) > n//2:\r\n\t\t\ts += v\r\n\t\telse:\r\n\t\t\ts += (v)*(A/(A+B))\r\n\tans = max(ans,s)\r\n\r\n\tfor i in p:\r\n\t\tl[i] -= 10\r\nprint(ans)" ]

[ "d, time = map(int, input().split())\r\nminTime = []\r\nmaxTime = []\r\nfor i in range(d):\r\n mn, mx = map(int, input().split())\r\n minTime.append(mn)\r\n maxTime.append(mx)\r\nminSum = sum(minTime)\r\nmaxSum = sum(maxTime)\r\nif minSum <= time <= maxSum:\r\n print(\"YES\")\r\n for i in range(d):\r\n temp = min(minTime[i] + time - minSum, maxTime[i])\r\n print(temp, end = \" \" if i < d - 1 else \"\\n\")\r\n time -= (temp - minTime[i])\r\nelse:\r\n print(\"NO\")", "d,sumtime=map(int,input().split())\r\nminmax=[]\r\nfor i in range(d):\r\n minmax.append(list(map(int,input().split())))\r\n\r\nschedule=[]\r\nflag=True\r\nfor i in range(d):\r\n if(minmax[i][0]<=sumtime):\r\n schedule.append(minmax[i][0])\r\n sumtime -= minmax[i][0]\r\n else:\r\n flag=False\r\n break\r\n\r\nif(flag==False):\r\n print('NO')\r\nelse:\r\n for i in range(d):\r\n if(minmax[i][1]-minmax[i][0] <= sumtime):\r\n schedule[i] += minmax[i][1]-minmax[i][0]\r\n sumtime -= minmax[i][1]-minmax[i][0]\r\n else:\r\n if(sumtime !=0):\r\n schedule[i] += sumtime\r\n sumtime = 0\r\n if(sumtime !=0):\r\n print('NO')\r\n else:\r\n print('YES')\r\n for i in range(len(schedule)):\r\n print(schedule[i],end=' ')\r\n ", "import sys\r\n\r\nR = lambda:map(int, sys.stdin.readline().rstrip().split())\r\n\r\ndef solve():\r\n d, sumtime = R()\r\n arr = []\r\n minsum = maxsum = 0\r\n \r\n for i in range(d):\r\n mint, maxt = R()\r\n minsum += mint\r\n maxsum += maxt\r\n arr.append([mint, maxt])\r\n if sumtime < minsum or sumtime > maxsum:\r\n print('NO')\r\n return\r\n summ = 0\r\n ans = []\r\n for i in range(d):\r\n now = arr[i][0]\r\n summ += now\r\n ans.append(now)\r\n i = 0\r\n while i < d and summ != sumtime:\r\n dif = arr[i][1] - ans[i]\r\n if dif + summ < sumtime:\r\n summ += dif\r\n ans[i] = arr[i][1]\r\n else:\r\n temp = sumtime - summ\r\n ans[i] += temp\r\n print('YES')\r\n print(*ans)\r\n return\r\n i += 1\r\n if sum(ans) == sumtime:\r\n print('YES')\r\n print(*ans)\r\n\r\nsolve()\r\n", "d, sumTime = map(int, input().split())\r\ntimeLimits = [tuple(map(int, input().split())) for _ in range(d)]\r\n\r\nminTotal = sum(minTime for minTime, _ in timeLimits)\r\nmaxTotal = sum(maxTime for _, maxTime in timeLimits)\r\n\r\nif minTotal <= sumTime <= maxTotal:\r\n \r\n schedule = []\r\n remainingTime = sumTime - minTotal\r\n for minTime, maxTime in timeLimits:\r\n scheduledTime = min(minTime + remainingTime, maxTime)\r\n schedule.append(scheduledTime)\r\n remainingTime -= (scheduledTime - minTime)\r\n \r\n \r\n print(\"YES\")\r\n print(*schedule)\r\nelse:\r\n print(\"NO\")\r\n", "dsum = input().split(\" \")\r\nd = int(dsum[0])\r\nsumTime = int(dsum[1])\r\nminTime = []\r\nmaxTime = []\r\nfor i in range(d):\r\n plchd = input().split(\" \")\r\n minTime.append(int(plchd[0]))\r\n maxTime.append(int(plchd[1]))\r\n \r\nif sumTime < sum(minTime) or sumTime > sum(maxTime):\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n i = d - 1\r\n totalminmax = minTime.copy()\r\n while sum(totalminmax) < sumTime:\r\n totalminmax[i] = maxTime[i]\r\n i -= 1\r\n if sum(totalminmax) > sumTime:\r\n totalminmax[i + 1] += sumTime - sum(totalminmax)\r\n for i in range(d):\r\n totalminmax[i] = str(totalminmax[i])\r\n print(\" \".join(totalminmax))\r\n", "# This is a sample Python script.\r\n\r\n# Press ⌃R to execute it or replace it with your code.\r\n# Press Double ⇧ to search everywhere for classes, files, tool windows, actions, and settings.\r\n\r\n\r\ndays, sum = map(int, input().split())\r\n\r\nmin = 0\r\nmax = 0\r\nlist = []\r\nremaining = []\r\n\r\nrunningSum = 0\r\nfor n in range(days):\r\n a, b = map(int, input().split())\r\n min = min + a\r\n max = max + b\r\n list.append(a)\r\n remaining.append(b - a)\r\n\r\nif min <= sum and max >= sum:\r\n print(\"YES\")\r\n leftOver = sum - min\r\n for i, x in enumerate(list):\r\n left = 0\r\n if (remaining[i] > leftOver):\r\n left = leftOver\r\n else:\r\n left = remaining[i]\r\n leftOver = leftOver - left\r\n print(list[i] + left)\r\n\r\nelse:\r\n print(\"NO\")\r\n\r\n\r\n\r\n\r\n\r\n# See PyCharm help at https://www.jetbrains.com/help/pycharm/\r\n\r\n", "import bisect\r\nimport sys\r\nfrom collections import deque\r\nfrom math import gcd, isqrt\r\nfrom collections import Counter\r\n\r\n\r\ndef find_gcd(numbers):\r\n result = numbers[0]\r\n for number in numbers[1:]:\r\n result = gcd(result, number)\r\n return result\r\n\r\n\r\ndef is_prime(n):\r\n if n <= 1:\r\n return False\r\n if n == 2:\r\n return True\r\n if n % 2 == 0:\r\n return False\r\n sqrt_n = isqrt(n)\r\n for i in range(3, sqrt_n + 1, 2):\r\n if n % i == 0:\r\n return False\r\n return True\r\n\r\n\r\ninput = sys.stdin.readline\r\n\r\n\r\ndef readList():\r\n return list(map(int, input().split()))\r\n\r\n\r\ndef readInt():\r\n return int(input())\r\n\r\n\r\ndef readInts():\r\n return map(int, input().split())\r\n\r\n\r\ndef readStr():\r\n return input().strip()\r\n\r\n\r\n# BF, EC, DB, CC, CL\r\ndef solve():\r\n pass\r\n\r\n\r\nd, sumTime = readInts()\r\nsumMin, sumMax = 0, 0\r\narr = []\r\nfor _ in range(d):\r\n minTime, maxTime = readInts()\r\n arr.append((minTime, maxTime))\r\n sumMin += minTime\r\n sumMax += maxTime\r\n\r\n\r\nif not sumMin <= sumTime <= sumMax:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n ans = []\r\n tmpSum = 0\r\n for x, y in arr:\r\n ans.append(x)\r\n tmpSum += x\r\n\r\n if tmpSum == sumTime:\r\n print(*ans)\r\n elif tmpSum < sumTime:\r\n diff = sumTime - tmpSum\r\n\r\n for i in range(len(arr)):\r\n x, y = arr[i]\r\n if diff <= abs(y - x):\r\n ans[i] += diff\r\n print(*ans)\r\n break\r\n else:\r\n ans[i] += abs(y - x)\r\n diff -= abs(y - x)\r\n\r\n\r\n\r\n\r\n", "d,sumtime=map(int,input().split())\r\nl=[]\r\nmini,maxi=0,0\r\nfor i in range(d):\r\n a,b=map(int,input().split())\r\n mini+=a;maxi+=b\r\n l.append((a,b))\r\nif sumtime<mini or sumtime>maxi:print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n ans=[]\r\n sumtime=sumtime-mini\r\n for a,b in l:\r\n c=min(sumtime,b-a)\r\n ans.append(a+c)\r\n sumtime-=c\r\n print(*ans)\r\n \r\n", "readtuple = lambda s: tuple(map(int, map(str.strip, s.strip().split(\" \"))))\n\ndef main():\n s = input()\n d, sumTime = readtuple(s)\n sumOfMins, sumOfMaxes = 0.0, 0.0\n mins = [None] * d\n maxs = [None] * d\n for i in range(d):\n s = input()\n mins[i], maxs[i] = readtuple(s)\n sumOfMins += mins[i]\n sumOfMaxes += maxs[i]\n if sumTime > sumOfMaxes or sumTime < sumOfMins:\n print(\"NO\")\n else:\n amounts = [None] * d\n remaining = sumTime\n for i in range(d):\n assert sumOfMins <= remaining and remaining <= sumOfMaxes\n remainingSumOfMins = sumOfMins - mins[i]\n remainingSumOfMaxs = sumOfMaxes - maxs[i]\n\n # See how much we'd have left if we took the minimum possible\n remainingRemaining = remaining - mins[i]\n\n # Look at the clearance (how far above the maximal we should stay under is)\n clearance = remainingSumOfMaxs - remainingRemaining\n minTake = mins[i] if clearance > 0 else mins[i] - clearance\n minTake = int(minTake)\n # print(f\"min take is {minTake} with clearance {clearance}, should be between {mins[i]} and {maxs[i]}\")\n assert mins[i] <= minTake and minTake <= maxs[i]\n\n take = min(max(mins[i], minTake), maxs[i])\n amounts[i] = take\n remaining -= take\n \n sumOfMins = remainingSumOfMins\n sumOfMaxes = remainingSumOfMaxs\n assert sumOfMins <= remaining and remaining <= sumOfMaxes\n\n print(f\"YES\\n{' '.join(map(str, amounts))}\")\n \n\nif __name__ == \"__main__\":\n main()", "def solve(d, sumTime, tasks):\r\n minSum = sum(task[0] for task in tasks)\r\n maxSum = sum(task[1] for task in tasks)\r\n \r\n if minSum <= sumTime <= maxSum:\r\n timetable = [task[0] for task in tasks]\r\n remaining_time = sumTime - minSum\r\n for i in range(d):\r\n if remaining_time > 0:\r\n extra_time = min(remaining_time, tasks[i][1] - tasks[i][0])\r\n timetable[i] += extra_time\r\n remaining_time -= extra_time\r\n return timetable\r\n else:\r\n return None\r\nd, sumTime = map(int, input().split())\r\ntasks = [list(map(int, input().split())) for _ in range(d)]\r\ntimetable = solve(d, sumTime, tasks)\r\nif timetable:\r\n print(\"YES\")\r\n print(\" \".join(map(str, timetable)))\r\nelse:\r\n print(\"NO\")\r\n", "days, hour = map(int, input().split())\nmin_max_list = []\nfor i in range(0, days):\n min, max = map(int, input().split())\n min_max_list.append([min, max])\n\nminimum = sum([i[0] for i in min_max_list])\nmaximum = sum([i[1] for i in min_max_list])\n\ndiff = hour - minimum\nif minimum <= hour <= maximum:\n print(\"YES\")\n max_selected = days - 1\n while diff > 0 <= max_selected:\n if diff > 0:\n diff += (min_max_list[max_selected][0] - min_max_list[max_selected][1])\n max_selected -= 1\n\n for i in range(0, days):\n if i <= max_selected:\n print(min_max_list[i][0], end=' ')\n elif i > max_selected + 1:\n print(min_max_list[i][1], end=' ')\n else:\n print(min_max_list[i][1] - abs(diff), end=' ')\n\n\nelse:\n print(\"NO\")\n", "d, sumTime = map(int, input().split())\r\nans = \"\"\r\nm0 = []\r\nm1 = []\r\nfor _ in range(d):\r\n minTime, maxTime = map(int, input().split())\r\n m0.append(minTime)\r\n m1.append(maxTime)\r\nif sum(m0) <= sumTime <= sum(m1) :\r\n print(\"YES\")\r\n answer = m0\r\n spare = sumTime - sum(m0)\r\n for _ in range(d):\r\n if (m1[_] - m0[_]) <= spare:\r\n spare -= (m1[_] - m0[_])\r\n answer[_] = m1[_]\r\n else:\r\n answer[_] += spare\r\n spare = 0\r\n for _ in answer:\r\n print(_, end=' ')\r\nelse: print(\"NO\")", "d, sumTime = map(int, input().split())\r\nminTime = []\r\nmaxTime = []\r\ntimeList = []\r\nmaxSum = 0\r\nminSum = 0\r\n\r\nfor i in range(d):\r\n minTime.append(0)\r\n maxTime.append(0)\r\n minTime[i], maxTime[i] = map(int, input().split())\r\n maxSum += maxTime[i]\r\n minSum += minTime[i]\r\n\r\nif maxSum >= sumTime >= minSum:\r\n timeList = minTime\r\n i = 0\r\n while minSum != sumTime:\r\n if minTime[i] != maxTime[i]:\r\n minSum += 1\r\n timeList[i] += 1\r\n if timeList[i] == maxTime[i]:\r\n i += 1\r\n else:\r\n continue\r\n else:\r\n i += 1\r\n print(\"YES\")\r\n print(*timeList)\r\nelse:\r\n print(\"NO\")", "d, sumTime = map(int, input().split())\r\n\r\nall_min = []\r\nall_max = []\r\nfor _ in range(d):\r\n minTime, maxTime = map(int, input().split())\r\n all_min.append(minTime)\r\n all_max.append(maxTime)\r\n\r\nlower = sum(all_min)\r\nupper = sum(all_max)\r\nif (sumTime < lower) or (sumTime > upper):\r\n print('NO')\r\nelse:\r\n print('YES')\r\n\r\n res = []\r\n\r\n delta = sumTime - lower\r\n\r\n for l,u in zip(all_min, all_max):\r\n if delta == 0:\r\n res.append(l)\r\n else:\r\n d = min(u-l,delta)\r\n delta -=d\r\n res.append(l+d)\r\n\r\n print(' '.join(map(str,res)))\r\n\r\n\r\n", "d, sum = input().split(); d = int(d); sum = int(sum)\r\ntime_list = []\r\ntime_min = 0; time_max = 0\r\nfor i in range(d):\r\n a, b = input().split(); a = int(a); b = int(b)\r\n time_list.append((a, b)); time_min += a; time_max += b\r\nif sum < time_min or sum > time_max: \r\n print(\"NO\")\r\nelse:\r\n ans = []\r\n for entry in time_list:\r\n ans.append(entry[0])\r\n sum -= time_min\r\n cnt = 0\r\n while sum > 0:\r\n ans[cnt] += min(sum, time_list[cnt][1] - time_list[cnt][0])\r\n sum -= min(sum, time_list[cnt][1] - time_list[cnt][0])\r\n cnt += 1\r\n print(\"YES\")\r\n for day in ans: print(day, end = ' ')", "f = list(map(int, input().split()))\r\ntot = f[0]\r\nhoras = f[1]\r\nmini = []\r\nmaxi = []\r\nfor _ in range(tot):\r\n extremos = list(map(int, input().split()))\r\n mini.append(extremos[0])\r\n maxi.append(extremos[1])\r\n\r\nminh = sum(mini)\r\nmaxh = sum(maxi)\r\n\r\nif minh > horas or maxh < horas:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n hdif = horas - minh\r\n for i in range(len(mini)):\r\n dif = maxi[i] - mini[i]\r\n if hdif - dif >= 0:\r\n mini[i] += dif\r\n hdif -= dif\r\n elif hdif - dif <= 0:\r\n mini[i] += hdif\r\n hdif = 0\r\n print(*mini)\r\n", "import sys\r\nd,sumtime = map(int,sys.stdin.readline().split())\r\ntime = [list(map(int,sys.stdin.readline().split())) for _ in range(d)]\r\ntime0 = 0\r\ntime1 = 0\r\nfor i in time:\r\n time1 += i[1]\r\n time0 += i[0]\r\nif time0 <= sumtime <= time1:\r\n d = sumtime - time0\r\n l = []\r\n for i,j in time:\r\n if d > 0:\r\n m = min(d,j-i)\r\n d -= m\r\n i += m\r\n l += [i]\r\n print(\"YES\")\r\n print(*l)\r\nelse:\r\n print(\"NO\")", "lst = [w.rstrip() for w in open(0).readlines()]\r\nd, sumTime = map(int, lst[0].split())\r\nlst = lst[1:]\r\nminMaxTime = [tuple(map(int, x.split())) for x in lst]\r\n\r\nmi = sum(tpl[0] for tpl in minMaxTime)\r\nma = sum(tpl[1] for tpl in minMaxTime)\r\nif mi <= sumTime <= ma:\r\n rest = sumTime - mi\r\n res = []\r\n for tpl in minMaxTime:\r\n a, b = tpl\r\n v = min(rest, b - a)\r\n res.append(a+v)\r\n rest -= v\r\n print(\"YES\")\r\n print(\" \".join(str(z) for z in res))\r\nelse:\r\n print(\"NO\")", "d, sumTime = map(int, input().split())\r\ns = 0\r\nmaxArr = [0]*d\r\nminArr = [0]*d\r\nsumArr = [0]*d\r\n\r\nfor i in range(d):\r\n min, max = map(int, input().split())\r\n maxArr[i] = max\r\n minArr[i] = min\r\n sumArr[i] = min\r\n s += min\r\n\r\n if s > sumTime:\r\n break\r\n\r\nif s < sumTime:\r\n for i in range(d):\r\n x = sumTime - s\r\n a = maxArr[i] - minArr[i]\r\n\r\n if a < x:\r\n s += a\r\n sumArr[i] += a\r\n elif a == x:\r\n s += a\r\n sumArr[i] += a\r\n break\r\n elif a > x:\r\n s += x\r\n sumArr[i] += x\r\n break\r\n\r\nif s == sumTime:\r\n print(\"YES\")\r\n print(*sumArr)\r\n\r\nelse:\r\n print(\"NO\")", "d,sumtime = map(int,input().split())\r\nlmin = []\r\nlmax = []\r\nfor i in range(d):\r\n a,b = map(int,input().split())\r\n lmin.append(a)\r\n lmax.append(b)\r\nsummin = sum(lmin)\r\nsummax = sum(lmax)\r\nif summin <= sumtime <= summax:\r\n t = sumtime - summin\r\n for i in range(d):\r\n if t > lmax[i] -lmin[i]:\r\n t -= lmax[i] -lmin[i]\r\n lmin[i] = lmax[i]\r\n else:\r\n lmin[i] += t\r\n break\r\n print(\"YES\")\r\n print(*lmin)\r\nelse:\r\n print(\"NO\")", "\r\n\r\nd,sumTime = map(int,input().split())\r\ntest_time = []\r\n\r\nfor _ in range(d):\r\n minTime,maxTime = map(int,input().split())\r\n test_time.append((minTime,maxTime))\r\n\r\nlow_sum,high_sum = sum(map(lambda x: x[0], test_time)),sum(map(lambda x: x[1], test_time))\r\n\r\nres = 0\r\nif sumTime<=high_sum and sumTime>=low_sum:\r\n print(\"YES\")\r\n res=1\r\nelse:\r\n print(\"NO\")\r\n\r\ndef diff(x:list):\r\n return x[0] - (sum(x[1:]) if len(x)>1 else 0)\r\n\r\n\r\nif res:\r\n\r\n delta = abs(sumTime-high_sum)\r\n hmardict = {k:(v[1]-v[0]) for k,v in enumerate(test_time)} \r\n\r\n c=0\r\n while delta!=0:\r\n if hmardict[c]<=delta:\r\n delta-=hmardict[c]\r\n hmardict[c]=0\r\n\r\n else:\r\n hmardict[c]-=delta\r\n delta=0\r\n\r\n c+=1\r\n\r\n fg = [items[1] for items in hmardict.items()]\r\n finale=[]\r\n for i,(a,b) in enumerate(test_time):\r\n finale.append(a+fg[i])\r\n\r\n print(\" \".join(map(str,finale)))\r\n", "inp = [*open(0)]\r\n\r\ndef sol():\r\n d,sum_hrs = [int(x) for x in inp[0].split()]\r\n mins,maxs = zip(*[x.split() for x in inp[1::]])\r\n #lines = [int(x) for x in lines.split()]\r\n mins = [*map(int,mins)]\r\n maxs = [*map(int,maxs)]\r\n if sum(maxs) <sum_hrs or sum(mins)>sum_hrs:\r\n return []\r\n start = list(mins)\r\n sum_us = sum(start)\r\n if sum_us==sum_hrs:\r\n return start\r\n for day in range(len(start)):\r\n while start[day]<maxs[day]:\r\n start[day]+=1\r\n sum_us+=1\r\n if sum_us==sum_hrs:\r\n return start\r\n return []\r\n \r\nans = sol()\r\nif len(ans)>0:\r\n print('YES')\r\n print(f'{\" \".join([str(x) for x in ans])}')\r\nelse:\r\n print('NO')\r\n", "from typing import List\r\nimport sys \r\ninput = sys.stdin.readline\r\n\r\ndef inp() -> int:\r\n return(int(input()))\r\ndef inlt() -> List[int]:\r\n return(list(map(int,input().split())))\r\ndef insr() -> List[str]:\r\n s = input()\r\n return(list(s[:len(s) - 1]))\r\n \r\ndef beforeExam(totalTime: int, eachDayLimit: List[List[int]]) -> List[int]:\r\n minimalSumTime = sum(map(lambda x: x[0], eachDayLimit))\r\n if minimalSumTime > totalTime:\r\n return []\r\n if sum(map(lambda x: x[1], eachDayLimit)) < totalTime:\r\n return []\r\n needTime = totalTime - minimalSumTime\r\n ret = [day[0] for day in eachDayLimit]\r\n for dayIndex, limit in enumerate(eachDayLimit):\r\n minTime, maxTime = limit\r\n addTime = min(maxTime - minTime, needTime)\r\n needTime -= addTime\r\n ret[dayIndex] += addTime\r\n if needTime == 0:\r\n break\r\n return ret\r\n\r\ndayCount, totalTime = inlt()\r\ndayLimit = []\r\nfor _ in range(dayCount):\r\n dayLimit.append(inlt())\r\nresult = beforeExam(totalTime, dayLimit)\r\n\r\nif len(result) == 0:\r\n print(\"NO\")\r\nelse:\r\n print(f\"YES\\n{' '.join(map(str, result))}\")", "d, s = map(int, input().split())\nsumamin = 0\nsumamax = 0\nans = 'YES'\nhorasmin = []\nhorasmax = []\n\nfor i in range(d):\n minim, maxim = map(int, input().split())\n horasmin.append(minim)\n horasmax.append(maxim)\n sumamin += minim\n sumamax += maxim\n\nif s < sumamin or s > sumamax:\n ans = 'NO'\n\nif ans == 'YES':\n i = 0\n while sumamin < s:\n dif = horasmax[i] - horasmin[i]\n if dif < s - sumamin:\n sumamin += dif\n horasmin[i] += dif\n else:\n horasmin[i] += (s - sumamin)\n sumamin = s\n\n i+=1\n\n print(ans)\n print(*horasmin)\n\nelse:\n print(ans)\n \t \t\t \t \t \t \t \t\t \t \t \t", "def solve():\n\n iters = [int(x) for x in input().split(\" \")]\n days = iters[0]\n hrs = iters[1]\n\n final_range = []\n high_range = []\n\n for i in range(days):\n\n low, high = [int(x) for x in input().split(\" \")]\n\n final_range.append(low)\n high_range.append(high)\n\n if sum(final_range) > hrs:\n return False\n elif sum(final_range) == hrs:\n return \" \".join([str(x) for x in final_range])\n \n iter = 0\n while True:\n\n if iter >= days:\n return False\n\n final_range[iter] = high_range[iter]\n\n if sum(final_range) >= hrs:\n final_range[iter] = final_range[iter] + (hrs - sum(final_range))\n\n return \" \".join([str(x) for x in final_range])\n \n iter += 1\n\nresult = solve()\n\nif result:\n print(\"YES\")\n print(result)\nelse:\n print(\"NO\")\n \t \t \t \t \t \t\t \t \t \t\t", "dst = input().split()\r\nnum_days = int(dst[0])\r\nsum_time = int(dst[1])\r\n\r\nmin_max = []\r\nfor i in range(num_days):\r\n x = input().split()\r\n min_max.append((int(x[0]), int(x[1])))\r\n\r\n# if sum of all mins <= sum_time <= sum of all maxes, we can find a sol\r\nif sum(x[0] for x in min_max) <= sum_time <= sum(x[1] for x in min_max):\r\n # we can find a solution\r\n print(\"YES\")\r\n # use the mins, then increase the first till it reaches the max\r\n sol = [x[0] for x in min_max]\r\n tot = sum(sol)\r\n i = 0\r\n while tot < sum_time:\r\n # increase i to the max\r\n delta = min(min_max[i][1] - min_max[i][0], sum_time - tot)\r\n sol[i] += delta\r\n tot += delta\r\n i += 1\r\n\r\n print(\" \".join([str(x) for x in sol]))\r\nelse:\r\n print(\"NO\")\r\n", "def solve(d, sumTime, minTime, maxTime):\r\n minSum = sum(minTime)\r\n maxSum = sum(maxTime)\r\n \r\n if sumTime < minSum or sumTime > maxSum:\r\n return \"NO\"\r\n \r\n result = [minTime[i] for i in range(d)]\r\n currentSum = sum(minTime)\r\n for i in range(d):\r\n while currentSum < sumTime and result[i] < maxTime[i]:\r\n result[i] += 1\r\n currentSum += 1\r\n \r\n return \"YES\\n\" + \" \".join(map(str, result))\r\n\r\nd, sumTime = map(int, input().split())\r\nminTime = []\r\nmaxTime = []\r\n\r\nfor _ in range(d):\r\n a, b = map(int, input().split())\r\n minTime.append(a)\r\n maxTime.append(b)\r\n\r\nprint(solve(d, sumTime, minTime, maxTime))\r\n" ]

[ "import bisect\r\nimport sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\ndef update(i, x, tree):\r\n i += l1\r\n tree[i] = x\r\n i //= 2\r\n while i:\r\n tree[i] = max(tree[2 * i], tree[2 * i + 1])\r\n i //= 2\r\n return\r\n\r\ndef get_max(s, t, tree):\r\n s += l1\r\n t += l1\r\n ans = -inf\r\n while s <= t:\r\n if s % 2 == 0:\r\n s //= 2\r\n else:\r\n ans = max(ans, tree[s])\r\n s = (s + 1) // 2\r\n if t % 2 == 1:\r\n t //= 2\r\n else:\r\n ans = max(ans, tree[t])\r\n t = (t - 1) // 2\r\n return ans\r\n\r\nn = int(input())\r\nd = dict()\r\nfor i in range(n):\r\n x, h = map(int, input().split())\r\n d[x] = (i, h)\r\nu = list(d.keys())\r\nu.sort()\r\ninf = pow(10, 9) + 1\r\nl1 = pow(2, n.bit_length())\r\nl2 = 2 * l1\r\nma = [-inf] * l2\r\nfor i in range(n):\r\n ma[i + l1] = i + 1\r\nfor i in range(l1 - 1, 0, -1):\r\n ma[i] = max(ma[2 * i], ma[2 * i + 1])\r\nans = [0] * n\r\nfor i in range(n - 1, -1, -1):\r\n x = u[i]\r\n j, h = d[x]\r\n r = bisect.bisect_left(u, x + h) - 1\r\n l = i\r\n m = get_max(l, r, ma)\r\n ans[j] = m - i\r\n update(i, m, ma)\r\nsys.stdout.write(\" \".join(map(str, ans)))", "from collections import deque\r\nn = int(input())\r\narr = []\r\nqueue = deque()\r\nans = [0 for _ in range(n)]\r\nfor i in range(n):\r\n arr.append([int(i) for i in input().split()])\r\n arr[i].append(i)\r\narr.sort(key=lambda x: x[0])\r\narr.reverse()\r\n\r\nfor i in range(n):\r\n cur = arr[i]\r\n if not queue:\r\n queue.append(cur)\r\n ans[cur[2]] = 1\r\n else:\r\n cnt = 1\r\n\r\n while cur[0]+cur[1] > queue[-1][0]:\r\n cnt += ans[queue[-1][2]]\r\n queue.pop()\r\n if not queue:\r\n break\r\n\r\n queue.append(cur)\r\n ans[cur[2]] = cnt\r\n\r\nprint(*ans)", "def solve():\n N=int(input())\n adat=[]\n for i in range(N):\n d,h=[int(v) for v in input().split()]\n adat.append((d,h,i))\n \n adat.sort()\n\n ret=[0]*N\n eler=[0]*N; eler[N-1]=N-1\n ret[adat[N-1][2]]=1\n for i in range(N-1,-1,-1):\n dh=adat[i][0]+adat[i][1]\n j=i+1\n while j<N:\n if adat[j][0]>=dh: break\n j=eler[j]+1\n \n eler[i]=j-1\n ret[adat[i][2]]=j-i\n \n print(\" \".join(str(v) for v in ret))\n\n\nsolve()\n\n", "\nimport sys\n\nreadline = sys.stdin.readline\n\ndominoes = []\n\ndef read_input():\n n = int(readline().strip())\n for i in range(n):\n x, h = [int(w) for w in readline().split()]\n dominoes.append([x, h, i])\n dominoes.sort()\n\ndef solve() -> list:\n result = [1] * len(dominoes)\n stk = []\n for i in range(len(dominoes) - 1, -1, -1):\n x, h, j = dominoes[i]\n while stk and stk[-1][0] < x + h:\n result[j] += result[stk[-1][1]]\n stk.pop()\n stk.append([x, j])\n return result\n\ndef write_output(result: list):\n for r in result:\n print(r)\n\nread_input()\nwrite_output(solve())" ]

[ "num = []\r\nfor i in range(10):\r\n print(str(i) * 4)\r\n n, m = map(int, input().split())\r\n for j in range(n):\r\n num.append(i)\r\npas = False\r\nfor i1 in range(4):\r\n for i2 in range(4):\r\n for i3 in range(4):\r\n for i4 in range(4):\r\n if i1 != i2 and i1 != i3 and i1 != i4 and i2 != i3 and i2 != i4 and i3 != i4 and not pas:\r\n print(num[i1], num[i2], num[i3], num[i4], sep='')\r\n n, m = map(int, input().split())\r\n if n == 4 and m == 0:\r\n pas = True", "from itertools import permutations\r\n\r\nif __name__ == '__main__':\r\n p = []\r\n for i in range(10):\r\n print(str(i) * 4)\r\n bull, _ = map(int, input().split())\r\n for _ in range(bull):\r\n p.append(str(i))\r\n for l in permutations(p, 4):\r\n print(''.join(l))", "digs = []\n\nfor i in range(0, 10):\n s = str(i) * 4\n print(s, flush=True)\n bulls, cows = [int(x) for x in input().split()]\n if bulls > 0:\n digs.append(str(i))\n\nimport itertools\n\nfor perm in itertools.permutations(digs):\n s = \"\".join(perm)\n print(s)\n bulls, cows = [int(x) for x in input().split()]\n if bulls == 4:\n break\n", "ans=[]\nfor i in range(10):\n print(str(i)*4)\n A=input()\n if A!='0 0':ans.append(i)\nimport itertools\nA=list(itertools.permutations(ans))\nfor i in A:\n print(''.join(map(str,list(i))))\n a=input()\n if a=='4 0':break\n\n", "from random import choice\r\n#//////////////////////////////////////////////////////////////////\r\n#//////////////////////////////////////////////////////////////////\r\nvalidation_memory = {\r\n 'dp1': [0, 1, 2, 3, 4, 5, 6, 7, 8, 9],\r\n 'dp2': [0, 1, 2, 3, 4, 5, 6, 7, 8, 9],\r\n 'dp3': [0, 1, 2, 3, 4, 5, 6, 7, 8, 9],\r\n 'dp4': [0, 1, 2, 3, 4, 5, 6, 7, 8, 9],\r\n\r\n 'bulls1': [],\r\n 'bulls2': [],\r\n 'bulls3': []\r\n}\r\n#//////////////////////////////////////////////////////////////////\r\n#//////////////////////////////////////////////////////////////////\r\nsurep1, surep2, surep3, surep4 = False, False, False, False\r\nall_guesses = []\r\ncurrent_guess = []\r\np1, p2, p3, p4 = 0, 0, 0, 0\r\nS = ''\r\n#//////////////////////////////////////////////////////////////////\r\n#//////////////////////////////////////////////////////////////////\r\ndef generate_new_guess():\r\n global current_guess, S, p1, p2, p3, p4\r\n\r\n p1 = choice(validation_memory['dp1'])\r\n p2 = choice(validation_memory['dp2'])\r\n p3 = choice(validation_memory['dp3'])\r\n p4 = choice(validation_memory['dp4'])\r\n \r\n current_guess = [p1, p2, p3, p4]\r\n \r\n if current_guess in all_guesses:\r\n generate_new_guess()\r\n else:\r\n all_guesses.append(current_guess)\r\n S = str(p1)+str(p2)+str(p3)+str(p4)\r\n\r\ngenerate_new_guess()\r\n#//////////////////////////////////////////////////////////////////\r\n#//////////////////////////////////////////////////////////////////\r\ndef find_patterns():\r\n \r\n for i in range(0,len(validation_memory['bulls1'])):\r\n fp1, fp2, fp3, fp4 = validation_memory['bulls1'][i]\r\n \r\n if (fp1 in validation_memory['dp1']\r\n and fp2 not in validation_memory['dp2']\r\n and fp3 not in validation_memory['dp3']\r\n and fp4 not in validation_memory['dp4']\r\n ):\r\n validation_memory['dp1'] = [fp1]\r\n\r\n if (fp2 in validation_memory['dp2']\r\n and fp1 not in validation_memory['dp1']\r\n and fp3 not in validation_memory['dp3']\r\n and fp4 not in validation_memory['dp4']\r\n ):\r\n validation_memory['dp2'] = [fp2]\r\n\r\n if (fp3 in validation_memory['dp3']\r\n and fp1 not in validation_memory['dp1']\r\n and fp2 not in validation_memory['dp2']\r\n and fp4 not in validation_memory['dp4']\r\n ):\r\n validation_memory['dp3'] = [fp3]\r\n\r\n if (fp4 in validation_memory['dp4']\r\n and fp1 not in validation_memory['dp1']\r\n and fp2 not in validation_memory['dp2']\r\n and fp3 not in validation_memory['dp3']\r\n ):\r\n validation_memory['dp4'] = [fp4]\r\n#---------------------------------------------------------------\r\n for i in range(0, len(validation_memory['bulls2'])):\r\n fp1, fp2, fp3, fp4 = validation_memory['bulls2'][i]\r\n\r\n if (fp1 in validation_memory['dp1']\r\n and fp2 in validation_memory['dp2']\r\n and fp3 not in validation_memory['dp3']\r\n and fp4 not in validation_memory['dp4']\r\n ):\r\n validation_memory['dp1'] = [fp1]\r\n validation_memory['dp2'] = [fp2]\r\n#---------------------------------------------------\r\n if (fp1 in validation_memory['dp1']\r\n and fp3 in validation_memory['dp3']\r\n and fp2 not in validation_memory['dp2']\r\n and fp4 not in validation_memory['dp4']\r\n ):\r\n validation_memory['dp1'] = [fp1]\r\n validation_memory['dp3'] = [fp3]\r\n#---------------------------------------------------\r\n if (fp1 in validation_memory['dp1']\r\n and fp4 in validation_memory['dp4']\r\n and fp2 not in validation_memory['dp2']\r\n and fp3 not in validation_memory['dp3']\r\n ):\r\n validation_memory['dp1'] = [fp1]\r\n validation_memory['dp4'] = [fp4]\r\n#---------------------------------------------------\r\n if (fp2 in validation_memory['dp2']\r\n and fp3 in validation_memory['dp3']\r\n and fp1 not in validation_memory['dp1']\r\n and fp4 not in validation_memory['dp4']\r\n ):\r\n validation_memory['dp2'] = [fp2]\r\n validation_memory['dp3'] = [fp3]\r\n#---------------------------------------------------\r\n if (fp2 in validation_memory['dp2']\r\n and fp4 in validation_memory['dp4']\r\n and fp1 not in validation_memory['dp1']\r\n and fp3 not in validation_memory['dp3']\r\n ):\r\n validation_memory['dp2'] = [fp2]\r\n validation_memory['dp4'] = [fp4]\r\n#---------------------------------------------------\r\n if (fp3 in validation_memory['dp3']\r\n and fp4 in validation_memory['dp4']\r\n and fp1 not in validation_memory['dp1']\r\n and fp2 not in validation_memory['dp2']\r\n ):\r\n validation_memory['dp3'] = [fp3]\r\n validation_memory['dp4'] = [fp4]\r\n#---------------------------------------------------------------\r\n for i in range(0, len(validation_memory['bulls3'])):\r\n fp1, fp2, fp3, fp4 = validation_memory['bulls3'][i]\r\n\r\n if (fp1 not in validation_memory['dp1']\r\n and fp2 in validation_memory['dp2']\r\n and fp3 in validation_memory['dp3']\r\n and fp4 in validation_memory['dp4']\r\n ):\r\n validation_memory['dp2'] = [fp2]\r\n validation_memory['dp3'] = [fp3]\r\n validation_memory['dp4'] = [fp4]\r\n\r\n if (fp2 not in validation_memory['dp2']\r\n and fp1 in validation_memory['dp1']\r\n and fp3 in validation_memory['dp3']\r\n and fp4 in validation_memory['dp4']\r\n ):\r\n validation_memory['dp1'] = [fp1]\r\n validation_memory['dp3'] = [fp3]\r\n validation_memory['dp4'] = [fp4]\r\n\r\n if (fp3 not in validation_memory['dp3']\r\n and fp1 in validation_memory['dp1']\r\n and fp2 in validation_memory['dp2']\r\n and fp4 in validation_memory['dp4']\r\n ):\r\n validation_memory['dp1'] = [fp1]\r\n validation_memory['dp2'] = [fp2]\r\n validation_memory['dp4'] = [fp4]\r\n\r\n if (fp4 not in validation_memory['dp4']\r\n and fp1 in validation_memory['dp1']\r\n and fp2 in validation_memory['dp2']\r\n and fp3 in validation_memory['dp3']\r\n ):\r\n validation_memory['dp1'] = [fp1]\r\n validation_memory['dp2'] = [fp2]\r\n validation_memory['dp3'] = [fp3]\r\n#//////////////////////////////////////////////////////////////////\r\n#//////////////////////////////////////////////////////////////////\r\nfor i in range(0,50):\r\n#-----------------------------------------------------------------\r\n print(S)\r\n#-----------------------------------------------------------------\r\n try:\r\n bulls, cows = map(int, input().split(' '))\r\n except:\r\n break\r\n#-----------------------------------------------------------------\r\n if bulls + cows > 4:\r\n break\r\n if bulls == 4 and cows == 0:\r\n break\r\n#-----------------------------------------------------------------\r\n if bulls == 0:\r\n validation_memory['dp1'].remove(p1)\r\n validation_memory['dp2'].remove(p2)\r\n validation_memory['dp3'].remove(p3)\r\n validation_memory['dp4'].remove(p4)\r\n\r\n if cows == 0 and bulls == 0:\r\n validation_memory['dp1'] = [\r\n n for n in validation_memory['dp1'] if n not in current_guess]\r\n validation_memory['dp2'] = [\r\n n for n in validation_memory['dp2'] if n not in current_guess]\r\n validation_memory['dp3'] = [\r\n n for n in validation_memory['dp3'] if n not in current_guess]\r\n validation_memory['dp4'] = [\r\n n for n in validation_memory['dp4'] if n not in current_guess]\r\n\r\n if (cows+bulls) == 4:\r\n validation_memory['dp1'] = [\r\n n for n in validation_memory['dp1'] if n in current_guess]\r\n validation_memory['dp2'] = [\r\n n for n in validation_memory['dp2'] if n in current_guess]\r\n validation_memory['dp3'] = [\r\n n for n in validation_memory['dp3'] if n in current_guess]\r\n validation_memory['dp4'] = [\r\n n for n in validation_memory['dp4'] if n in current_guess]\r\n#-----------------------------------------------------------------\r\n if bulls == 1:\r\n validation_memory['bulls1'].append(current_guess)\r\n if bulls == 2:\r\n validation_memory['bulls2'].append(current_guess)\r\n if bulls == 3:\r\n validation_memory['bulls3'].append(current_guess)\r\n#-----------------------------------------------------------------\r\n find_patterns()\r\n#-----------------------------------------------------------------\r\n if len(validation_memory['dp1']) == 1:\r\n surep1 = True\r\n if len(validation_memory['dp2']) == 1:\r\n surep2 = True\r\n if len(validation_memory['dp3']) == 1:\r\n surep3 = True\r\n if len(validation_memory['dp4']) == 1:\r\n surep4 = True\r\n#-----------------------------------------------------------------\r\n if surep1 and bulls == 1 and cows == 0:\r\n if p2 in validation_memory['dp2']:validation_memory['dp2'].remove(p2)\r\n if p3 in validation_memory['dp3']:validation_memory['dp3'].remove(p3)\r\n if p4 in validation_memory['dp4']:validation_memory['dp4'].remove(p4)\r\n if surep2 and bulls == 1 and cows == 0:\r\n if p1 in validation_memory['dp1']:validation_memory['dp1'].remove(p1)\r\n if p3 in validation_memory['dp3']:validation_memory['dp3'].remove(p3)\r\n if p4 in validation_memory['dp4']:validation_memory['dp4'].remove(p4)\r\n if surep3 and bulls == 1 and cows == 0:\r\n if p1 in validation_memory['dp1']:validation_memory['dp1'].remove(p1)\r\n if p2 in validation_memory['dp2']:validation_memory['dp2'].remove(p2)\r\n if p4 in validation_memory['dp4']:validation_memory['dp4'].remove(p4)\r\n if surep4 and bulls == 1 and cows == 0:\r\n if p1 in validation_memory['dp1']:validation_memory['dp1'].remove(p1)\r\n if p2 in validation_memory['dp2']:validation_memory['dp2'].remove(p2)\r\n if p3 in validation_memory['dp3']:validation_memory['dp3'].remove(p3)\r\n#-----------------------------------------------------------------\r\n if surep1 and surep2 and bulls == 2 and cows == 0:\r\n if p3 in validation_memory['dp3']:validation_memory['dp3'].remove(p3)\r\n if p4 in validation_memory['dp4']:validation_memory['dp4'].remove(p4)\r\n if surep1 and surep3 and bulls == 2 and cows == 0:\r\n if p2 in validation_memory['dp2']:validation_memory['dp2'].remove(p2)\r\n if p4 in validation_memory['dp4']:validation_memory['dp4'].remove(p4)\r\n if surep1 and surep4 and bulls == 2 and cows == 0:\r\n if p2 in validation_memory['dp2']:validation_memory['dp2'].remove(p2)\r\n if p3 in validation_memory['dp3']:validation_memory['dp3'].remove(p3)\r\n if surep2 and surep3 and bulls == 2 and cows == 0:\r\n if p1 in validation_memory['dp1']:validation_memory['dp1'].remove(p1)\r\n if p4 in validation_memory['dp4']:validation_memory['dp4'].remove(p4)\r\n if surep2 and surep4 and bulls == 2 and cows == 0:\r\n if p1 in validation_memory['dp1']:validation_memory['dp1'].remove(p1)\r\n if p3 in validation_memory['dp3']:validation_memory['dp3'].remove(p3)\r\n if surep3 and surep4 and bulls == 2 and cows == 0:\r\n if p2 in validation_memory['dp2']:validation_memory['dp2'].remove(p2)\r\n if p1 in validation_memory['dp1']:validation_memory['dp1'].remove(p1)\r\n#-----------------------------------------------------------------\r\n if surep1 and surep2 and surep3 and bulls == 3 and cows == 0:\r\n if p4 in validation_memory['dp4']:validation_memory['dp4'].remove(p4)\r\n if surep1 and surep2 and surep4 and bulls == 3 and cows == 0:\r\n if p3 in validation_memory['dp3']:validation_memory['dp3'].remove(p3)\r\n if surep1 and surep3 and surep4 and bulls == 3 and cows == 0:\r\n if p2 in validation_memory['dp2']:validation_memory['dp2'].remove(p2)\r\n if surep2 and surep3 and surep4 and bulls == 3 and cows == 0:\r\n if p1 in validation_memory['dp1']:validation_memory['dp1'].remove(p1)\r\n#-----------------------------------------------------------------\r\n generate_new_guess()", "import sys\r\n\r\ndef req(a,b,c,d):\r\n print(a,b,c,d, sep = \"\")\r\n sys.stdout.flush()\r\n return list(map(int, input().split()))\r\n\r\nno = 9\r\nlst = [] \r\nres = []\r\n\r\nfor i in range(10):\r\n q = [i] * 4\r\n u,v = req(*q)\r\n if u:\r\n lst.append(i)\r\n else:\r\n no = i\r\n if len(lst) == 4:\r\n break\r\n\r\nfor i in range(4):\r\n for k in lst:\r\n q = [no] * 4\r\n q[i] = k\r\n u,v = req(*q)\r\n if u:\r\n lst.remove(k)\r\n res.append(k)\r\n break\r\n\r\nreq(*res) \r\n ", "import sys\n\n\ndef perm(l):\n\tif len(l) <= 1:\n\t\treturn [l]\n\tr = []\n\tfor i in range(len(l)):\n\t\ts = l[: i] + l[i + 1:]\n\t\tp = perm(s)\n\t\tfor x in p:\n\t\t\tr.append(l[i: i + 1] + x)\n\treturn r\n\n\narr = []\n\nfor i in range(0, 10):\n\tprint(str(i) * 4)\n\tsys.stdout.flush()\n\tb, c = map(int, input().split())\n\tif b or c:\n\t\tarr.append(i)\n\n\nperm_of_ans = perm(arr)\n\nfor el in perm_of_ans:\n\tprint(*el, sep='')\n\tsys.stdout.flush()\n\tb, c = map(int, input().split())\n\tif b == 4:\n\t\tbreak\n\n", "a = []\n\nfor i in range(10):\n\ts = str(i)*4\n\n\tprint(s)\n\tx = input().split()\n\tx = [int(i) for i in x]\n\tif x.count(0) != 2:\n\t\ta.append(str(i))\n\nimport itertools\np = list(itertools.permutations(a))\n\nfor i in p:\n\tprint(''.join(i))\n\n\tx = input()\n\tif x == \"4 0\":\n\t\tbreak", "import random\r\nimport sys\r\n\r\ndef valid(st) :\r\n return len(set(x for x in st)) == 4\r\n\r\ndef comp(guess, secret) :\r\n b, c = 0, 0\r\n for i in range(4) : \r\n if secret[i] == guess[i] : \r\n b += 1\r\n elif secret[i] in guess :\r\n c += 1\r\n return (b, c)\r\n\r\ndef check(guess, secret, bulls, cows) :\r\n b, c = comp(guess, secret)\r\n return bulls == b and cows == c\r\n\r\ndef filtered(candidates, history) :\r\n ret = []\r\n for c in candidates :\r\n good = True\r\n for query, res in history :\r\n if not check(c, query, res[0], res[1]) :\r\n good = False\r\n if good :\r\n ret.append(c)\r\n return ret\r\n\r\ndef next_guess(candidates, step) :\r\n if step < 2 :\r\n return candidates[random.randint(0, len(candidates)-1)]\r\n # Can get an accuracy of 99% if go random each step\r\n best = 5040\r\n if len(candidates) == 1 :\r\n return candidates[0]\r\n now = candidates[0]\r\n for g in candidates :\r\n poss = [ [0] * 5 for x in range(5)]\r\n for s in candidates :\r\n b, c = comp(g, s)\r\n poss[b][c] += 1\r\n penalty = max( max(arr) for arr in poss )\r\n if penalty < best :\r\n best = penalty\r\n now = g\r\n return now\r\n\r\ndef generate_all_initial() :\r\n ret = list(filter(valid, map( lambda x : \"%04d\" % x, range(9999))))\r\n return ret\r\n\r\neveryone = generate_all_initial()\r\ndef test(true_secret) :\r\n global everyone\r\n choices, history = everyone[:], []\r\n for step in range(6) :\r\n take_guess = next_guess(choices, step)\r\n if not valid(take_guess) :\r\n print(\"Crashed\", true_secret)\r\n break\r\n result = comp(take_guess, true_secret)\r\n history.append((take_guess,result))\r\n choices = filtered(choices, history)\r\n if len(choices) != 1 :\r\n print(\"Failed\", true_secret)\r\n print(len(choices),history)\r\n return False\r\n else :\r\n print(\"Pass\", true_secret)\r\n return True\r\n\r\ndef run() :\r\n global everyone\r\n choices, history = everyone[:], []\r\n for step in range(7) :\r\n take_guess = next_guess(choices, step)\r\n print(take_guess)\r\n sys.stdout.flush()\r\n b, c = map(int, input().split())\r\n if b == 4 and c == 0 :\r\n return\r\n history.append((take_guess,(b,c)))\r\n choices = filtered(choices, history)\r\n\r\n#### Main ####\r\n#true_secret = start[random.randint(0,5039)]\r\n\"\"\"\r\ncount = 0\r\nfor true_secret in everyone :\r\n if not test(true_secret) :\r\n count += 1\r\nprint(count, count / 5040.0)\r\n\"\"\"\r\n\r\nrun()\r\n", "from sys import exit\n\nguess = \"1234\"\n\ndef change(orig, ind, dig):\n\tif ind == 0:\n\t\treturn dig + orig[1:]\n\telif ind == 3:\n\t\treturn orig[:3] + dig\n\telse:\n\t\treturn orig[:ind] + dig + orig[ind+1:]\n\n\nfor digit in range(0, 4):\n\tmax_bulls = 0\n\tmax_bulls_dig = -1\n\tfor totest in range(0, 10):\n\t\tguess = change(guess, digit, str(totest))\n\t\tprint(guess)\n\t\tres = input()\n\t\tif res == \"4 0\":\n\t\t\texit()\n\t\tbulls = int(res[0])\n\t\tif bulls > max_bulls:\n\t\t\tmax_bulls = bulls\n\t\t\tmax_bulls_dig = totest\n\tguess = change(guess, digit, str(max_bulls_dig))\n\n\n\n\n", "def getin():\r\n inp=str(input()).split()\r\n return int(inp[0]), int(inp[1])\r\n\r\nlin=[]\r\nlout=[i for i in range(10)]\r\nfor i in range(10):\r\n print(4*str(i), flush=True)\r\n a, b = getin()\r\n print(flush=True)\r\n if a==1:\r\n lin.append(i)\r\n lout.remove(i)\r\n if len(lin)==4:\r\n break;\r\n\r\nsol=[lout[0] for i in range(4)]\r\n\r\nfor i in range(4):\r\n for num in lin:\r\n sol[i]=num\r\n if num!=lin[-1]:\r\n print(sol[0], sol[1], sol[2], sol[3], sep='', flush=True)\r\n a, b = getin()\r\n print(flush=True)\r\n else:\r\n a=i+1\r\n if a==i+1:\r\n sol[i]=num\r\n lin.remove(num)\r\n break;\r\n\r\nprint(sol[0], sol[1], sol[2], sol[3], sep='', flush=True)\r\na, b= getin()", "import sys\nans = \"\"\nfor i in range(4):\n bst, bsta = 0, -1\n for j in range(10):\n tans = \"\"\n for k in range(4):\n if i == k:\n tans += str(j)\n else:\n tans += \"0\"\n print(tans)\n sys.stdout.flush()\n a, b = list(map(int,input().split()))\n if a == 4 and b == 0:\n exit(0)\n if a > bsta:\n bst, bsta = j, a\n ans += str(bst)\nprint(ans)\nsys.stdout.flush()\n", "import sys\n\nSecret = \"7321\"\ntesting = False\n\n\ndef get_response(query):\n if testing:\n print(query)\n bulls = 0\n cows = 0\n for x in range(len(query)):\n if query[x] == Secret[x]:\n bulls += 1\n elif query[x] in Secret:\n cows += 1\n return [bulls, cows]\n else:\n print(query)\n sys.stdout.flush()\n return [int(x) for x in input().split(\" \")]\n\n\nclass CodeforcesTask753BSolution:\n def __init__(self):\n self.result = ''\n\n def read_input(self):\n pass\n\n def process_task(self):\n l = -1\n digi_cnt = [0 for x in range(10)]\n mak = False\n while True:\n #print(digi_cnt, sum(digi_cnt))\n l += 1\n if sum(digi_cnt) < 4:\n query = str(l) * 4\n elif not mak:\n nums = []\n for x in range(10):\n for i in range(digi_cnt[x]):\n nums.append(x)\n new_queries = []\n for x in range(4):\n for y in range(4):\n for z in range(4):\n for v in range(4):\n if len(list(set([x, y, z, v]))) == 4:\n new_queries.append(\"{0}{1}{2}{3}\".format(nums[x], nums[y], nums[z], nums[v]))\n mak = True\n query = new_queries.pop(0)\n else:\n query = new_queries.pop(0)\n query_result = get_response(query)\n if query_result[0] == 4:\n break\n if sum(digi_cnt) < 4:\n digi_cnt[l] += query_result[0]\n\n def get_result(self):\n return self.result\n\n\nif __name__ == \"__main__\":\n Solution = CodeforcesTask753BSolution()\n Solution.read_input()\n Solution.process_task()\n print(Solution.get_result())\n", "from sys import stdout\r\nfrom itertools import permutations\r\n\r\nvar = []\r\n\r\nfor i in range(10):\r\n print(str(i) * 4)\r\n stdout.flush()\r\n\r\n a, b = map(int, input().split())\r\n\r\n if a:\r\n var.append(str(i))\r\n\r\nfor t in permutations(var):\r\n print(''.join(t))\r\n stdout.flush()\r\n\r\n a, b = map(int, input().split())\r\n\r\n if a == 4:\r\n break", "import itertools\r\nimport sys\r\n\r\nfinished = False\r\nnumbers = []\r\nfor i in range(10):\r\n trial = str(i) * 4\r\n print(trial)\r\n sys.stdout.flush()\r\n reply = input()\r\n if reply == '4 0':\r\n finished = True\r\n break\r\n for j in range(int(reply[0])):\r\n numbers.append(str(i))\r\n\r\nif not finished:\r\n for number in set(itertools.permutations(numbers)):\r\n print(''.join(number))\r\n sys.stdout.flush()\r\n reply = input()\r\n if reply == '4 0':\r\n break" ]

[ "def g(x):\r\n if x == t[x]: return x\r\n t[x] = g(t[x])\r\n return t[x]\r\n\r\nf = lambda: map(int, input().split())\r\nhoses, pairOfFriends, weight = f()\r\nweightsAndBeauties = [(0, 0)] + list(zip(f(), f()))\r\nt = list(range(hoses + 1))\r\n\r\n\r\nfor i in range(pairOfFriends):\r\n f1, f2 = f()\r\n f1, f2 = g(f1), g(f2)\r\n if f1 != f2:\r\n t[f2] = f1\r\n\r\np = [[] for j in range(hoses + 1)]\r\nfor i in range(1, hoses + 1):\r\n p[g(i)].append(i)\r\n\r\nbeauties = [1] + [0] * weight\r\nfor q in p:\r\n if len(q) > 1:\r\n t = [weightsAndBeauties[i] for i in q]\r\n t.append((sum(f1[0] for f1 in t), sum(f1[1] for f1 in t)))\r\n t.sort(key=lambda f1: f1[0])\r\n\r\n for j in range(weight, -1, -1):\r\n if beauties[j]:\r\n for w, b in t:\r\n if j + w > weight:\r\n break\r\n else:\r\n beauties[j + w] = max(beauties[j + w], beauties[j] + b)\r\n elif len(q) == 1:\r\n w, b = weightsAndBeauties[q[0]]\r\n for j in range(weight - w, -1, -1):\r\n if beauties[j]:\r\n beauties[j + w] = max(beauties[j + w], beauties[j] + b)\r\n\r\nmaxBeauty = max(beauties) - 1\r\nprint(maxBeauty)", "def ler():\n return [int(x) for x in input().split()]\n \n\ndef dfs(u, adj, visited, s, Pesos, Belezas):\n visited[u] = True\n total_p = Pesos[u]\n total_b = Belezas[u]\n s.append(u)\n for v in adj[u]:\n if not visited[v]:\n w, b = dfs(v, adj, visited, s, Pesos, Belezas)\n total_p += w\n total_b += b\n return total_p, total_b\n \n \nn, m, w = ler()\nPesos = ler()\nBelezas = ler()\nadj = [[] for _ in range(n)]\nfor _ in range(m):\n x, y = ler()\n x -= 1\n y -= 1\n adj[x].append(y)\n adj[y].append(x)\nvisited = [False] * n\nf = [0] * (w + 1)\nfor i in range(n):\n if visited[i]:\n continue\n\n s = []\n total_p, total_b = dfs(i, adj, visited, s, Pesos, Belezas)\n for j in range(w, -1, -1):\n jw = j + total_p\n if jw <= w:\n f[jw] = max(f[jw], f[j] + total_b)\n for v in s:\n jw = j + Pesos[v]\n if jw <= w:\n f[jw] = max(f[jw], f[j] + Belezas[v])\nprint(f[w])\n\n", "import sys\r\ninput = sys.stdin.buffer.readline \r\n\r\ndef find_root(root_dict, x):\r\n L = []\r\n while x != root_dict[x]:\r\n L.append(x)\r\n x = root_dict[x]\r\n for y in L:\r\n root_dict[y] = x \r\n return x \r\n\r\ndef process(W, B, G, w):\r\n n = len(W)\r\n root_dict = [i for i in range(n+1)]\r\n for x, y in G:\r\n x1 = find_root(root_dict, x)\r\n y1 = find_root(root_dict, y)\r\n root_dict[x1] = y1 \r\n roots = [[[0, 0]] for i in range(n+1)]\r\n for i in range(1, n+1):\r\n wi = W[i-1]\r\n bi = B[i-1]\r\n i1 = find_root(root_dict, i)\r\n roots[i1][0][0]+=wi \r\n roots[i1][0][1]+=bi\r\n roots[i1].append([wi, bi])\r\n d = [0 for i in range(w+1)]\r\n for i in range(1, n+1):\r\n d2 = [x for x in d]\r\n for wi, bi in roots[i]:\r\n for j in range(w+1):\r\n if j+wi <= w:\r\n d2[j+wi] = max(d2[j+wi], d[j]+bi)\r\n d = d2\r\n answer = max(d)\r\n sys.stdout.write(f'{answer}\\n')\r\n return\r\n\r\nn, m, w = [int(x) for x in input().split()]\r\nW = [int(x) for x in input().split()]\r\nB = [int(x) for x in input().split()]\r\nG = []\r\nfor i in range(m):\r\n xi, yi = [int(x) for x in input().split()]\r\n G.append([xi, yi])\r\nprocess(W, B, G, w)", "n, m, o = map(int, input().split())\r\n\r\nwn = map(int, input().split())\r\nbn = map(int, input().split())\r\nwb = [(0, 0)] + list(zip(wn, bn))\r\n\r\nl = list(range(n + 1))\r\ndef f(x):\r\n if x == l[x]:\r\n return x\r\n \r\n l[x] = f(l[x])\r\n return l[x]\r\n\r\nfor i in range(m):\r\n x, y = map(int, input().split())\r\n x, y = f(x), f(y)\r\n\r\n if x != y:\r\n l[y] = x\r\n \r\np = [[] for j in range(n + 1)]\r\n\r\nfor i in range(1, n + 1):\r\n p[f(i)].append(i)\r\n \r\nr = (o+1) * [0]\r\nr[0] = 1\r\n\r\nfor i in p:\r\n if len(i) > 1:\r\n l = [wb[x] for x in i]\r\n x0 = sum(x[0] for x in l)\r\n x1 = sum(x[1] for x in l)\r\n l.append((x0, x1))\r\n l.sort()\r\n \r\n for j in range(o, -1, -1):\r\n if r[j]:\r\n for w, b in l:\r\n if j + w > o:\r\n break\r\n r[j + w] = max(r[j + w], r[j] + b)\r\n \r\n elif len(i) == 1:\r\n w, b = wb[i[0]]\r\n for j in range(o - w, -1, -1):\r\n if r[j]:\r\n r[j + w] = max(r[j + w], r[j] + b)\r\n \r\nres = max(r) - 1 \r\nprint(res)", "f = lambda: map(int, input().split())\nn, m, s = f()\nwb = [(0, 0)] + list(zip(f(), f()))\nt = list(range(n + 1)) \ndef g(x):\n if x == t[x]: return x\n t[x] = g(t[x])\n return t[x] \nfor i in range(m):\n x, y = f()\n x, y = g(x), g(y)\n if x != y: t[y] = x\np = [[] for j in range(n + 1)]\nfor i in range(1, n + 1): p[g(i)].append(i) \nd = [1] + [0] * s\nfor q in p:\n if len(q) > 1:\n t = [wb[i] for i in q]\n t.append((sum(x[0] for x in t), sum(x[1] for x in t)))\n t.sort(key=lambda x: x[0]) \n for j in range(s, -1, -1):\n if d[j]:\n for w, b in t:\n if j + w > s: break\n d[j + w] = max(d[j + w], d[j] + b) \n elif len(q) == 1:\n w, b = wb[q[0]]\n for j in range(s - w, -1, -1):\n if d[j]: d[j + w] = max(d[j + w], d[j] + b)\n \nprint(max(d) - 1)\n\n\t\t\t \t\t \t \t \t \t\t\t \t \t \t\t\t\t", "# Aluno Rafael Pontes\r\n\r\nmaxn = 1002\r\n \r\ndef criar_lista_com_zeros(n):\r\n l = []\r\n for i in range(n):\r\n l.append(0)\r\n return l\r\n\r\ndef criar_lista_de_listas(n):\r\n l = []\r\n for i in range(n):\r\n l.append([])\r\n return l\r\n\r\nmemoria = criar_lista_com_zeros(maxn)\r\npesos = criar_lista_com_zeros(maxn)\r\nbelezas = criar_lista_com_zeros(maxn)\r\nsomas_pesos = criar_lista_com_zeros(maxn)\r\nsomas_belezas = criar_lista_com_zeros(maxn)\r\nvt = criar_lista_de_listas(maxn)\r\npr = criar_lista_com_zeros(maxn)\r\nn, m, w = 0, 0, 0\r\n\r\ndef encontrar(x):\r\n global pr\r\n if pr[x] == x:\r\n return x\r\n pr[x] = encontrar(pr[x])\r\n return pr[x]\r\n\r\ndef juntar(x, y):\r\n f1 = encontrar(x)\r\n f2 = encontrar(y)\r\n if (f1 != f2):\r\n pr[f1] = f2\r\n\r\n# Inicio do programa\r\n\r\n# Leitura parametros iniciais\r\nn, m, w = [int(x) for x in input().split()]\r\n\r\n# Inicizalizacao das principais variaveis\r\nfor i in range(maxn):\r\n memoria[i] = 0\r\n pr[i] = i\r\n somas_pesos[i] = 0\r\n somas_belezas[i] = 0\r\n\r\n# Leitura dos pesos e belezas\r\n# Adiciono um elemento para o indice começar em 1\r\npesos = [0] + [int(x) for x in input().split()]\r\nbelezas = [0] + [int(x) for x in input().split()]\r\n\r\nfor i in range(1, m + 1):\r\n x, y = [int(x) for x in input().split()]\r\n juntar(x,y)\r\n\r\nfor i in range(1, n + 1):\r\n x = encontrar(i)\r\n vt[x].append((pesos[i],belezas[i]))\r\n somas_pesos[x] += pesos[i]\r\n somas_belezas[x] += belezas[i]\r\n\r\nfor i in range(1, n + 1):\r\n if (len(vt[i]) == 0): continue\r\n vt[i].append((somas_pesos[i],somas_belezas[i]))\r\n\r\nfor i in range(1, n + 1):\r\n if (len(vt[i]) == 0): continue\r\n for j in range(w, -1, -1):\r\n for k in range(0, len(vt[i])):\r\n W = vt[i][k][0]\r\n B = vt[i][k][1]\r\n if (j - W >= 0):\r\n memoria[j] = max(memoria[j], memoria[j-W] + B)\r\n\r\nprint(\"%d\" % memoria[w])\r\n", "class UnionFind():\r\n def __init__(self, n: int) -> None:\r\n self.n = n\r\n self.par = list(range(self.n))\r\n self.rank = [1] * self.n\r\n self.count = self.n\r\n\r\n def find(self, x: int) -> int:\r\n if self.par[x] == x:\r\n return x\r\n else:\r\n self.par[x] = self.find(self.par[x])\r\n return self.par[x]\r\n\r\n def unite(self, x: int, y: int) -> None:\r\n p = self.find(x)\r\n q = self.find(y)\r\n if p == q:\r\n return None\r\n if p > q:\r\n p, q = q, p\r\n self.rank[p] += self.rank[q]\r\n self.par[q] = p\r\n self.count -= 1\r\n\r\n def same(self, x: int, y: int) -> bool:\r\n return self.find(x) == self.find(y)\r\n\r\n def size(self, x: int) -> int:\r\n return self.rank[x]\r\n\r\n def count(self) -> int:\r\n return self.count\r\n\r\nn, m, W = map(int, input().split())\r\nw = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\n\r\nUF = UnionFind(n)\r\n\r\nfor _ in range(m):\r\n x, y = map(int, input().split())\r\n UF.unite(x - 1, y - 1)\r\n\r\nC = [[] for i in range(n)]\r\nfor i in range(n): C[UF.find(i)].append(i)\r\ndp = [[0] * (W + 1) for _ in range(n + 1)]\r\nfor i in range(n):\r\n sw, sb = 0, 0\r\n for c in C[i]:\r\n sw += w[c]; sb += b[c]\r\n for j in range(W + 1):\r\n if j >= w[c]: dp[i + 1][j] = max([dp[i][j - w[c]] + b[c], dp[i][j], dp[i + 1][j]])\r\n else: dp[i + 1][j] = max(dp[i + 1][j], dp[i][j])\r\n for j in range(W + 1):\r\n if j >= sw: dp[i + 1][j] = max([dp[i][j - sw] + sb, dp[i][j], dp[i + 1][j]])\r\n else: dp[i + 1][j] = max(dp[i + 1][j], dp[i][j])\r\nprint(dp[n][W])", "n, m, k = map(int, input().split())\n \na = map(int, input().split())\nb = map(int, input().split())\nab = [(0, 0)] + list(zip(a, b))\n \nl = list(range(n + 1))\n\ndef f(x):\n if x == l[x]:\n return x\n \n l[x] = f(l[x])\n return l[x]\n \nfor i in range(m):\n x, y = map(int, input().split())\n x, y = f(x), f(y)\n \n if x != y:\n l[y] = x\n \np = [[] for j in range(n + 1)]\n \nfor i in range(1, n + 1):\n p[f(i)].append(i)\n \nr = (k+1) * [0]\nr[0] = 1\n \nfor i in p:\n if len(i) > 1:\n l = [ab[x] for x in i]\n x0 = sum(x[0] for x in l)\n x1 = sum(x[1] for x in l)\n l.append((x0, x1))\n l.sort()\n \n for j in range(k, -1, -1):\n if r[j]:\n for w, b in l:\n if j + w > k:\n break\n r[j + w] = max(r[j + w], r[j] + b)\n \n elif len(i) == 1:\n w, b = ab[i[0]]\n for j in range(k - w, -1, -1):\n if r[j]:\n r[j + w] = max(r[j + w], r[j] + b)\n \nres = max(r) - 1 \nprint(res)", "n, m, W = map(int, input().split())\r\nw = [0] + list(map(int, input().split()))\r\nb = [0] + list(map(int, input().split()))\r\ng = [[] for _ in range(n + 1)]\r\nfor _ in range(m):\r\n v1, v2 = map(int, input().split())\r\n g[v1].append(v2)\r\n g[v2].append(v1)\r\ndp = [0] * (W + 1)\r\ndef dfs(v):\r\n all = []\r\n all.append((w[v], b[v]))\r\n used[v] = False\r\n for i in range(len(g[v])):\r\n next = g[v][i]\r\n if used[next] == False:\r\n continue\r\n all.extend(dfs(next))\r\n return all\r\nused = [True] * (n + 1)\r\nfor i in range(1, n + 1):\r\n if not used[i]:\r\n continue\r\n all = dfs(i)\r\n sumAll = sum(val[1] for val in all)\r\n weightAll = sum(val[0] for val in all)\r\n for _W in range(W - 1, -1, -1):\r\n if _W + weightAll <= W:\r\n dp[_W + weightAll] = max(dp[_W + weightAll], dp[_W] + sumAll)\r\n for elem in range(len(all)):\r\n if _W + all[elem][0] <= W:\r\n dp[_W + all[elem][0]] = max(dp[_W + all[elem][0]], dp[_W] + all[elem][1])\r\nanswer = max(dp)\r\nprint(answer)# 1698082694.218741", "def inp():\n return [int(x) for x in input().split()]\n\n\ndef dfs(u, adj, visited, s, W, B):\n visited[u] = True\n total_w = W[u]\n total_b = B[u]\n s.append(u)\n for v in adj[u]:\n if not visited[v]:\n w, b = dfs(v, adj, visited, s, W, B)\n total_w += w\n total_b += b\n return total_w, total_b\n\n\ndef main():\n n, m, w = inp()\n W = inp()\n B = inp()\n adj = [[] for _ in range(n)]\n for _ in range(m):\n x, y = inp()\n x -= 1\n y -= 1\n adj[x].append(y)\n adj[y].append(x)\n visited = [False] * n\n f = [0] * (w + 1)\n for i in range(n):\n if visited[i]:\n continue\n s = []\n total_w, total_b = dfs(i, adj, visited, s, W, B)\n for j in range(w, -1, -1):\n jw = j + total_w\n if jw <= w:\n f[jw] = max(f[jw], f[j] + total_b)\n for v in s:\n jw = j + W[v]\n if jw <= w:\n f[jw] = max(f[jw], f[j] + B[v])\n print(f[w])\n\n\nif __name__ == \"__main__\":\n main()\n\n", "R = lambda: map(int, input().split())\r\nn, m, w = R()\r\nws = [0] + list(R())\r\nbs = [0] + list(R())\r\ng = [[] for x in range(n + 1)]\r\nfor i in range(m):\r\n x, y = R()\r\n g[x].append(y)\r\n g[y].append(x)\r\ncs = [0] * (n + 1)\r\ncnt = 1\r\nfor i in range(1, n + 1):\r\n if not cs[i]:\r\n cs[i] = cnt\r\n q = []\r\n q.append(i)\r\n while q:\r\n nxt = q.pop()\r\n for x in g[nxt]:\r\n if not cs[x]:\r\n cs[x] = cnt\r\n q.append(x)\r\n cnt += 1\r\ngs = [[] for i in range(cnt)]\r\nfor i in range(1, n + 1):\r\n gs[cs[i]].append(i)\r\ndp = [[0] * (w + 1) for i in range(cnt)]\r\nfor i in range(1, cnt):\r\n tw = sum(ws[k] for k in gs[i])\r\n tb = sum(bs[k] for k in gs[i])\r\n for j in range(1, w + 1):\r\n dp[i][j] = max(dp[i][j], dp[i - 1][j], (dp[i - 1][j - tw] + tb if j >= tw else 0))\r\n for k in gs[i]:\r\n dp[i][j] = max(dp[i][j], dp[i - 1][j], (dp[i - 1][j - ws[k]] + bs[k] if j >= ws[k] else 0))\r\nprint(dp[-1][w])", "'''\r\nknapsack dp\r\n'''\r\n\r\n\r\nclass dsu():\r\n def __init__(self, n):\r\n self.parent = [0] * (n)\r\n self.sz = [0] * (n)\r\n\r\n def make_set(self, v):\r\n self.parent[v] = v\r\n self.sz[v] = 1\r\n\r\n def find_set(self, v):\r\n if v == self.parent[v]:\r\n return v\r\n self.parent[v] = self.find_set(self.parent[v])\r\n return self.parent[v]\r\n\r\n def union(self, a, b):\r\n a = self.find_set(a)\r\n b = self.find_set(b)\r\n if a == b:\r\n return\r\n if self.sz[a] < self.sz[b]:\r\n a, b = b, a\r\n self.parent[b] = a\r\n self.sz[a] += self.sz[b]\r\n\r\n def getsize(self, v):\r\n return self.sz[self.find_set(v)]\r\n\r\nfrom collections import defaultdict\r\nn,m,k=map(int,input().strip().split())\r\nwt=[*map(int,input().strip().split())]\r\nb=[*map(int,input().strip().split())]\r\nds=dsu(n)\r\nfor i in range(n):\r\n ds.make_set(i)\r\nfor i in range(m):\r\n x,y=map(lambda s:int(s)-1,input().strip().split())\r\n ds.union(x,y)\r\n\r\nd=defaultdict(list)\r\nsb=defaultdict(lambda :[0,0])\r\nfor i in range(n):\r\n d[ds.find_set(i)].append((b[i],wt[i]))\r\n sb[ds.find_set(i)][0]+=b[i]\r\n sb[ds.find_set(i)][1]+=wt[i]\r\nfor i in d:\r\n d[i].append((sb[i][0],sb[i][1]))\r\ndp=[-float(\"inf\") for i in range(k+1)] #0 for grp 1 for\r\ndp[0]=0\r\nfor l in d.values():\r\n dpt=dp.copy()\r\n for bi,wi in l:\r\n for w in range(k+1):\r\n if w-wi>=0:\r\n dpt[w]=max(dp[w-wi]+bi,dpt[w])\r\n dp=dpt\r\nprint(max(dp))\r\n", "import sys\r\ninput = sys.stdin.buffer.readline\r\n\r\n\r\nclass UnionFind:\r\n def __init__(self, n):\r\n self.parent = [-1] * n\r\n self.n = n\r\n self.cnt = n\r\n\r\n def root(self, x):\r\n if self.parent[x] < 0:\r\n return x\r\n else:\r\n self.parent[x] = self.root(self.parent[x])\r\n return self.parent[x]\r\n\r\n def merge(self, x, y):\r\n x = self.root(x)\r\n y = self.root(y)\r\n if x == y:\r\n return False\r\n if self.parent[x] > self.parent[y]:\r\n x, y = y, x\r\n self.parent[x] += self.parent[y]\r\n self.parent[y] = x\r\n self.cnt -= 1\r\n return True\r\n\r\n def same(self, x, y):\r\n return self.root(x) == self.root(y)\r\n\r\n def size(self, x):\r\n return -self.parent[self.root(x)]\r\n\r\n def count(self):\r\n return self.cnt\r\n\r\n def groups(self):\r\n res = [[] for _ in range(self.n)]\r\n for i in range(self.n):\r\n res[self.root(i)].append(i)\r\n return [group for group in res if group]\r\n\r\n\r\ndef knapsack_01(w, items):\r\n n = len(items)\r\n dp = [0] * (w + 1)\r\n\r\n for group in items:\r\n dq = [0] * (w + 1)\r\n for value, weight in group:\r\n for j in range(w + 1):\r\n dq[j] = max(dq[j], dp[j])\r\n if j - weight >= 0:\r\n dq[j] = max(dq[j], dp[j - weight] + value)\r\n dp, dq = dq, dp\r\n return dp\r\n\r\n\r\nn, m, w = map(int, input().split())\r\nws = list(map(int, input().split()))\r\nbs = list(map(int, input().split()))\r\npairs = [list(map(int, input().split())) for i in range(m)]\r\n\r\n\r\nuf = UnionFind(n)\r\nfor u, v in pairs:\r\n u -= 1\r\n v -= 1\r\n uf.merge(u, v)\r\n\r\n\r\nitems = []\r\nfor gps in uf.groups():\r\n wei, bea = 0, 0\r\n tmp = []\r\n for i in gps:\r\n wei += ws[i]\r\n bea += bs[i]\r\n tmp.append((bs[i], ws[i]))\r\n tmp.append((bea, wei))\r\n items.append(tmp)\r\n\r\nres = knapsack_01(w, items)\r\nprint(max(res))", "n, m, wn = map(int, input().split())\nWi = [(0, 0)] + list(zip(map(int, input().split()), map(int, input().split())))\nlistaux3 = list(range(n + 1))\n \ndef aux(x):\n if x == listaux3[x]: \n return x\n listaux3[x] = aux(listaux3[x])\n return listaux3[x]\n \nfor i in range(m):\n x, y = map(int, input().split())\n x, y = aux(x), aux(y)\n if x != y: \n listaux3[y] = x\n \nlistaux1 = [[] for _ in range(n + 1)]\n\nfor i in range(1, n + 1): \n listaux1[aux(i)].append(i)\n \nlistaux2 = [1] + [0] * wn\n\nfor k in listaux1:\n if len(k) > 1:\n listaux3 = [Wi[i] for i in k]\n listaux3.append((sum(x[0] for x in listaux3), sum(x[1] for x in listaux3)))\n listaux3.sort(key=lambda x: x[0])\n \n for j in range(wn, -1, -1):\n if listaux2[j]:\n for w, b in listaux3:\n if j + w > wn: \n break\n listaux2[j + w] = max(listaux2[j + w], listaux2[j] + b)\n \n elif len(k) == 1:\n w, b = Wi[k[0]]\n for j in range(wn - w, -1, -1):\n if listaux2[j]: \n listaux2[j + w] = max(listaux2[j + w], listaux2[j] + b)\n \nprint(max(listaux2) - 1)" ]

[ "n = int(input())\nl = [int(x) for x in input().split()]\ndistinct = []\ncur = 0\nfor i in l:\n cur = max(cur, i + 1)\n distinct.append(cur)\n\nfor i in range(n - 1, 0, -1):\n distinct[i - 1] = max(distinct[i - 1], distinct[i] - 1)\n\nans = sum([a - b - 1 for a, b in zip(distinct, l)])\nprint(ans)", "import sys\r\nn = int(input())\r\na = [int(x) for x in input().split(' ')]\r\nmaxm = 0\r\nidx=0\r\nans=0\r\nb=[0]*n\r\nfor i in range(n):\r\n if a[i]>=maxm:\r\n maxm=a[i]\r\n idx=i\r\nfor i in range(idx,n):\r\n b[i]=maxm+1\r\ni=idx-1\r\nwhile i>=0:\r\n b[i]=max(a[i]+1,b[i+1]-1)\r\n i-=1\r\nfor i in range(1,n):\r\n if b[i]<b[i-1]:\r\n b[i]=b[i-1]\r\n ans+=(b[i]-1-a[i])\r\nprint(ans)", "n = int(input())\nm = list(map(int, input().split()))\na = [0] * n\nk = 0\nfor i in range(n):\n k = max(k, m[i]+1)\n a[i] = k\nfor i in range(n-1, 0, -1):\n a[i-1] = max(a[i]-1, a[i-1])\nans = 0\nfor i in range(n):\n ans += a[i]-m[i]-1\nprint(ans)\n", "#include <GOD>\r\n#Pato Boride Azin Khone , Vase Hamine Delet Khune\r\n\r\nimport sys\r\nimport math\r\n\r\n\r\nn = int(input())\r\narr = [int(i) for i in input().split()]\r\ntt = [0]*n\r\nfor i in range(n):\r\n if(i != 0):\r\n tt[i]=max(tt[i-1] , arr[i]+1)\r\n else:\r\n tt[i]=arr[i]+1\r\nss = 0\r\n\r\nfor i in range(n-1 , -1 , -1):\r\n if(i != n-1):\r\n tt[i]=max(tt[i+1]-1 , tt[i])\r\n ss+=(tt[i]-arr[i]-1)\r\n else:\r\n ss+=(tt[i]-arr[i]-1)\r\nprint(ss)\r\n \r\n \r\n\r\n", "n = int(input())\r\nm = list(map(int, input().split()))\r\nnum = [0 for _ in range(n)]\r\ncur = 0\r\nfor i in range(n-1, -1, -1):\r\n\tcur -= 1\r\n\talt = m[i]+1\r\n\tif cur < alt:\r\n\t\tcur = alt\r\n\t\tj = i\r\n\t\twhile (j < n) and (num[j] < cur):\r\n\t\t\tnum[j] = cur\r\n\t\t\tj += 1\r\n\telse:\r\n\t\tnum[i] = cur\r\n# print(*num)\r\nprint(sum(num)-n-sum(m))\r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\nb=[]\r\nmaxi=0\r\nfor i in range(n):\r\n maxi=max(maxi,a[i]+1)\r\n b.append(maxi)\r\nc=[]\r\ncount=b[-1]\r\nfor i in range(n-1,-1,-1):\r\n if count-1>=b[i]:\r\n count-=1\r\n c.append(count)\r\n else:\r\n c.append(count)\r\nc=c[::-1]\r\nans=0\r\nfor i in range(n):\r\n ans+=(c[i]-a[i]-1)\r\nprint(ans)", "import math,sys,bisect,heapq\r\nfrom collections import defaultdict,Counter,deque\r\nfrom itertools import groupby,accumulate\r\n#sys.setrecursionlimit(200000000)\r\ninput = iter(sys.stdin.buffer.read().decode().splitlines()).__next__\r\nilele = lambda: map(int,input().split())\r\nalele = lambda: list(map(int, input().split()))\r\ndef list2d(a, b, c): return [[c] * b for i in range(a)]\r\ndef list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)]\r\n#MOD = 1000000000 + 7\r\ndef Y(c): print([\"NO\",\"YES\"][c])\r\ndef y(c): print([\"no\",\"yes\"][c])\r\ndef Yy(c): print([\"No\",\"Yes\"][c])\r\n \r\nN = int(input())\r\nA = alele()\r\nB=[]\r\nmaxi = 0\r\nfor i in A:\r\n maxi = max(maxi,i)\r\n B.append(maxi)\r\nfor i in range(N-2,-1,-1):\r\n if B[i+1] - B[i] > 1:\r\n B[i] = B[i+1] - 1\r\n#print(B)\r\nAns= 0\r\nfor i in range(N):\r\n Ans += B[i]-A[i]\r\nprint(Ans)\r\n ", "# -*- coding: utf-8 -*-\n\"\"\"\nCreated on Fri Sep 22 22:16:27 2023\n\n@author: hambu\n\"\"\"\n\n# %% Taking inputs\nn = int(input())\nm = list(map(int,input().split()))\n\n# %% Forward pass\ncur_max = -1\nflatList = []\nfor i in m:\n cur_max = max(cur_max, i)\n flatList.append(cur_max)\n\n# %% Backward pass\nflatList.reverse()\ncur_max2 = -1\nminMarks = []\nslope = 0\nfor j in flatList:\n if j >= cur_max2-slope:\n slope = 0\n cur_max2 = j\n minMarks.append(j+1)\n else:\n slope += 1\n minMarks.append(cur_max2-slope+1)\n\n# %% Finishing it off\ncul_sum = 0\nfor i in range(n):\n cul_sum += minMarks[i] - 1 - m[i]\n\nprint(cul_sum)\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\na = [0] * n\r\nk = 0\r\nfor i in range(n):\r\n k = max(k, m[i] + 1)\r\n a[i] = k\r\nfor i in range(n - 1, 0, -1):\r\n a[i - 1] = max(a[i] - 1, a[i - 1])\r\nans = 0\r\nfor i in range(n):\r\n ans += a[i] - m[i] - 1\r\nprint(ans)", "import sys\nfrom collections import deque\n\ndata = sys.stdin.read().split()\ndata_ptr = 0\n\ndef data_next():\n global data_ptr, data\n data_ptr += 1\n return data[data_ptr - 1]\n\nN = int(data_next())\ntot_lines = 0\nans = 0\nst = deque()\nfor i in range(N):\n n = int(data_next())\n if n >= tot_lines:\n for j in range(n - tot_lines):\n prev_repeat = st.pop()\n ans += i - prev_repeat\n tot_lines = n + 1\n else:\n ans += tot_lines - n - 1\n st.append(i)\nprint(ans)\n", "def read_data():\r\n n = int(input().strip())\r\n a = list(map(int, list(input().strip().split())))\r\n return n, a\r\n\r\ndef solve():\r\n under = [0 for i in range(n)]\r\n under[-1] = a[-1] + 1\r\n for i in range(n-2,-1,-1):\r\n under[i] = max(a[i]+1,a[i+1],under[i+1]-1)\r\n for i in range(1,n):\r\n under[i] = max(under[i], under[i-1])\r\n return sum(under[i] - 1 - a[i] for i in range(n))\r\n\r\nn, a = read_data()\r\nprint(solve())", "n = int(input())\r\nAb = input().split()\r\nUn = []\r\nAl = [0]\r\nr = 0\r\nfor i in range(n):\r\n Ab[i] = int(Ab[i])\r\n Al.append(max(Ab[i]+1,Al[i]))\r\nfor i in range(n,-1,-1):\r\n if Al[i-1] < Al[i] - 1:\r\n Al[i-1] = Al[i] - 1\r\nfor i in range(n):\r\n Un.append(Al[i+1]-Ab[i]-1)\r\n r += Un[-1]\r\nprint(r)\r\n", "n = int (input ())\r\nm = [0] + list (map (int, input ().split ())) + [0]\r\ncnt = 0; ans = 0; mn = [0] * (n + 5)\r\nfor i in range (n, 0, -1) : mn[i] = max (m[i] + 1, m[i + 1], mn[i + 1] - 1)\r\n#print (mn)\r\nfor i in range (1, n + 1) :\r\n if cnt < mn[i] :\r\n ans += cnt - m[i]\r\n cnt += 1\r\n else :\r\n ans += cnt - m[i] - 1\r\n #print (i, cnt, ans)\r\nprint (ans)\r\n", "N = int(input())\r\nabove = list(map(int, input().split()))\r\n\r\nif N == 1:\r\n print(0)\r\n quit()\r\n\r\nrequired_mark = [0] * N\r\nrequired_mark[N-2] = above[N-1]\r\nfor i in reversed(range(N-2)):\r\n required_mark[i] = max(above[i+1], required_mark[i+1] - 1)\r\n\r\nd = 0\r\nmark = 1\r\nfor i in range(1, N):\r\n if mark == above[i]:\r\n mark += 1\r\n elif mark >= required_mark[i]:\r\n d += mark - above[i] - 1\r\n else:\r\n d += mark - above[i]\r\n mark += 1\r\n\r\nprint(d)", "n = int(input())\r\na = list(map(int,input().split()))\r\nne = n*[0]\r\nned = 1\r\nfor i in range(n-1,-1,-1):\r\n if a[i]+1 > ned:\r\n ned = a[i]+1\r\n ne[i] = ned\r\n ned -= 1\r\n#print(ne)\r\nne.append(0) \r\nle = 1\r\no = 0\r\nfor i in range(n):\r\n o += le-a[i]-1\r\n #print(le)\r\n if le < ne[i+1]:\r\n le += 1\r\n #o = le-a[i]-1\r\n \r\nprint(o)\r\n", "n = int(input())\r\na = list(map(int,input().strip().split()))\r\ns = [0] * n\r\nunder = 0\r\nfor i in range(n):\r\n s[i] = a[i]\r\nfor i in range(1,n):\r\n s[i] = max(s[i],s[i-1])\r\nfor i in range(n-2,0,-1):\r\n if s[i+1] - s[i] > 1:\r\n s[i] = s[i+1] - 1\r\nfor i in range(n):\r\n under += max(0,s[i] - a[i])\r\nprint(under)", "# python3\ndef readline(): return map(int, input().split())\n\n\ndef main():\n n = int(input())\n m = tuple(readline())\n\n md = [None] * n\n\n prev = 0\n for i in range(n):\n prev = md[i] = max(prev, m[i])\n\n prev = 0\n for i in range(n - 1, -1, -1):\n prev -= 1\n prev = md[i] = max(prev, md[i])\n\n print(sum(md) - sum(m))\n\n\nmain()\n", "n = int(input())\n\na = list(map(int, input().split()))\n\nma = [1] * n\n\nfor i in range(1, n):\n\n ma[i] = max(ma[i - 1], a[i] + 1)\n\nfor i in range(n - 2, -1, -1):\n\n ma[i] = max(ma[i + 1] - 1, ma[i]) \n\nprint(sum(ma) - sum(a) - n)\n\n\n\n# Made By Mostafa_Khaled", "n = int(input())\r\na = list(map(int , input().split()))\r\n\r\nmin_toptal = a.copy()\r\nfor i in range(1, n):\r\n min_toptal[i] = max(min_toptal[i-1], a[i]+1)\r\n\r\nmin_toptal[0] = 1\r\nfor i in range(n-1, 0, -1):\r\n min_toptal[i-1] = max(min_toptal[i]-1, min_toptal[i-1])\r\n\r\nmin_under = []\r\n\r\n# print(*a)\r\n# print(*min_toptal)\r\n# print(*min_under)\r\n\r\nunderwater = sum((max(0, min_toptal[i] - a[i]- 1) for i in range(n)))\r\nprint(underwater)\r\n\r\n", "def main():\r\n n = int(input())\r\n arr = list(map(int, input().split()))\r\n b = []\r\n b.append(1)\r\n for i in range(1, n):\r\n if arr[i] >= b[i - 1]:\r\n b.append(arr[i] + 1)\r\n else:\r\n b.append(b[i - 1])\r\n\r\n for i in range(n - 2, 0, -1):\r\n if b[i] < b[i + 1] - 1:\r\n b[i] = b[i + 1] - 1\r\n\r\n ans = 0\r\n for i in range(0, n):\r\n ans += b[i] - arr[i] - 1\r\n\r\n print(ans)\r\nmain()\r\n", "n = int(input())\r\nl = list(map(int,input().split()))\r\ndp = [1 for i in range(n)]\r\nm=0\r\nfor i in range(1,n):\r\n dp[i] = max(dp[i-1],l[i]+1)\r\nfor i in range(n-2,-1,-1):\r\n dp[i] = max(dp[i],dp[i+1]-1)\r\nans=0\r\nfor i in range(n):\r\n ans+=dp[i]-l[i]-1\r\nprint(ans)", "n = int(input())\nm = list(map(int, input().split()))\nstarts = sorted([(i - m[i], i) for i in range(n)], reverse = True)\ncur = answer = 0\nfor i in range(n):\n while starts[-1][1] < i:\n starts.pop()\n cur = max(cur, i - starts[-1][0])\n answer += cur - m[i]\nprint(answer)\n ", "n=int(input())\r\nmi=list(map(int,input().split()))\r\ndp=[0]*n\r\ndp[0]=1\r\nans=0\r\nfor i in range(1,n):\r\n dp[i]=max(dp[i-1],mi[i]+1)\r\nfor i in range(n-2,-1,-1):\r\n dp[i] = max(dp[i],dp[i+1]-1)\r\nfor i in range(n):\r\n ans+=dp[i]-mi[i]-1\r\nprint(ans)", "n = int(input())\r\nm = list(map(int, input().split()))\r\n\r\nt = [1] * n\r\n\r\nfor i in range(1, n):\r\n t[i] = max(t[i - 1], m[i] + 1)\r\n\r\n\r\nfor i in range(n - 2, -1, -1):\r\n t[i] = max(t[i], t[i + 1] - 1)\r\n\r\nsumm = 0\r\nfor i in range(n):\r\n summ += t[i] - m[i] - 1\r\n\r\nprint(summ)", "n=int(input())\r\narr=list(map(int,input().split()))\r\ni=n-1\r\ncurr=0\r\nt=[0]*(n)\r\nwhile i>=0:\r\n curr=max(curr-1,0)\r\n curr=max(curr,arr[i]+1)\r\n t[i]=curr\r\n i-=1\r\ncurr=0\r\nans=0\r\nfor i in t:\r\n curr=max(curr,i)\r\n ans+=curr\r\nfor el in arr:\r\n ans-=el+1\r\nprint(ans)", "#!/usr/bin/env python3\nfrom sys import stdin, stdout\n\ndef rint():\n return map(int, stdin.readline().split())\n#lines = stdin.readlines()\nn = int(input())\n\nu = list(rint())\nu = [0] + u\nmark = 0\nb = [0]\nfor i in range(1,n+1):\n uu = u[i]\n b.append(i)\n if uu >= mark:\n inc = uu - mark + 1\n l = len(b)\n for i in range(inc):\n b.pop()\n mark += inc\n \ntot = [1 for i in range(n+1)]\nfor bb in b:\n tot[bb] = 0\nfor i in range(1, n+1):\n tot[i] = tot[i-1] + tot[i]\nans = 0\nfor i in range(1, n+1):\n ans += tot[i] - u[i] - 1\n\nprint(ans)", "n = int(input())\r\nm = input().split()\r\nt = []\r\nfor i in range(n):\r\n m[i] = int(m[i])\r\n if i == 0:\r\n t.append(m[i]+1)\r\n else:\r\n t.append(max(t[i-1], m[i]+1))\r\ns = t[n-1] - m[n-1] - 1\r\nfor i in range(n-2, -1, -1):\r\n if t[i] < t[i+1]-1:\r\n t[i] = t[i+1]-1\r\n s += t[i] - m[i] - 1\r\nprint(s)", "n = int(input())\r\n\r\nabove = list(map(int, input().split()))\r\ntotal = [x + 1 for x in above]\r\n\r\n# ensure at most increase by one\r\nfor i in range(0,n-1)[::-1]:\r\n total[i] = max(total[i], total[i+1] - 1)\r\n\r\n# ensure nondecreasing\r\nfor i in range(1,n): \r\n total[i] = max(total[i], total[i-1])\r\n\r\nbelow = [t - a - 1 for t, a in zip(total, above)]\r\n\r\n#print(\"total =\", total)\r\n#print(\"above =\", above)\r\n#print(\"below =\", below)\r\n\r\nprint(sum(below))\r\n" ]

[ "import queue\n\nn = int(input())\n\nsR = list(map(int, input().split()[1:]))\nsM = list(map(int, input().split()[1:]))\ns = [sR, sM]\n\nUNK = -1\nWIN = 2\nLOSE = 3\n\nA = [[UNK] * n for i in range(2)]\nCNT = [[0] * n for i in range(2)]\nV = [[False] * n for i in range(2)]\n# ricky turn 0\n# morty turn 1\nA[0][0] = LOSE\nA[1][0] = LOSE\n\nQ = queue.Queue()\nQ.put((0, 0))\nQ.put((1, 0))\n\nwhile not Q.empty():\n turn, planet = Q.get()\n\n prev_turn = 1 - turn\n for diff in s[prev_turn]:\n prev_planet = (n + planet - diff) % n\n if prev_planet == 0:\n continue\n if A[turn][planet] == LOSE:\n A[prev_turn][prev_planet] = WIN\n elif A[turn][planet] == WIN:\n CNT[prev_turn][prev_planet] += 1\n if CNT[prev_turn][prev_planet] == len(s[prev_turn]):\n A[prev_turn][prev_planet] = LOSE\n\n if A[prev_turn][prev_planet] != UNK and not V[prev_turn][prev_planet]:\n Q.put((prev_turn, prev_planet))\n V[prev_turn][prev_planet] = True\n\nprint(' '.join([\"Win\" if A[0][i] == WIN else \"Lose\" if A[0][i] == LOSE else \"Loop\" for i in range(1, n)]))\nprint(' '.join([\"Win\" if A[1][i] == WIN else \"Lose\" if A[1][i] == LOSE else \"Loop\" for i in range(1, n)]))\n\n", "f = lambda: list(map(int, input().split()))[1:]\r\nn = int(input())\r\ns, p, q = [], [], []\r\nfor x in [0, 1]:\r\n r = f()\r\n s.append(r)\r\n t = [len(r)] * n\r\n t[0] = 0\r\n p.append(t)\r\n q.append((x, 0))\r\nwhile q:\r\n x, i = q.pop()\r\n y = 1 - x\r\n for d in s[y]:\r\n j = (i - d) % n\r\n if p[y][j] < 1: continue\r\n p[y][j] = -1\r\n for d in s[x]:\r\n k = (j - d) % n\r\n if p[x][k] < 1: continue\r\n p[x][k] -= 1\r\n if p[x][k] == 0: q.append((x, k))\r\nfor x in [0, 1]:\r\n print(*[['Lose', 'Loop', 'Win'][min(q, 1)] for q in p[x][1:]])", "import sys\r\n#range = xrange\r\n#input = raw_input\r\n\r\nn = int(input())\r\nk1,*A = [int(x) for x in input().split()]\r\nk2,*B = [int(x) for x in input().split()]\r\n\r\nDPA = [None]*n\r\nDPA[0] = False\r\ncounterA = [k1]*n\r\ncounterA[0] = -1\r\n\r\nDPB = [None]*n\r\nDPB[0] = False\r\ncounterB = [k2]*n\r\ncounterB[0] = -1\r\n\r\n\r\nQA = [0]\r\nQB = [0]\r\nwhile QA or QB:\r\n while QA:\r\n i = QA.pop() \r\n if DPA[i] == False:\r\n for b in B:\r\n if i!=b:\r\n if not DPB[i-b]:\r\n QB.append((i-b)%n)\r\n DPB[i-b] = True\r\n elif DPA[i]:\r\n for b in B:\r\n counterB[i-b] -= 1\r\n if not counterB[i-b]:\r\n #assert(DPB[i-b]==None)\r\n DPB[i-b] = False\r\n QB.append((i-b)%n)\r\n \r\n while QB:\r\n i = QB.pop() \r\n if DPB[i] == False:\r\n for a in A:\r\n if i!=a:\r\n if not DPA[i-a]:\r\n QA.append((i-a)%n)\r\n DPA[i-a] = True\r\n elif DPB[i]:\r\n for a in A:\r\n counterA[i-a] -= 1 \r\n if not counterA[i-a]:\r\n #assert(DPA[i-a]==None)\r\n DPA[i-a] = False\r\n QA.append((i-a)%n)\r\n\r\ndef f(x):\r\n if x==None:\r\n return 'Loop'\r\n if x:\r\n return 'Win'\r\n return 'Lose'\r\n\r\nprint(*[f(x) for x in DPA[1:]])\r\nprint(*[f(x) for x in DPB[1:]])" ]

[ "from math import sqrt\r\n\r\n\r\ndef prime(n):\r\n for d in range(3, int(sqrt(n)) + 1, 2):\r\n if n % d == 0:\r\n return 0\r\n return 1\r\n\r\n\r\nn = int(input())\r\nif n == 2:\r\n print(1)\r\nelif n % 2 == 0:\r\n print(2)\r\nelif prime(n):\r\n print(1)\r\nelif prime(n - 2):\r\n print(2)\r\nelse:\r\n print(3)\r\n", "n = int(input())\n\ndef isPrime(n):\n if (n==0 or n==1):\n return False\n i = 2\n while (i*i<=n):\n if (n%i==0):\n return False\n i += 1\n return True\n\nif (n%2==0):\n if (n==2):\n print(1)\n else:\n print(2)\nelse:\n if (isPrime(n)):\n print(1)\n elif (isPrime(n-2)):\n print(2)\n else:\n print(3)\n", "import math\r\nn=int(input())\r\nif n<=3:\r\n print(1)\r\nif n>3 and n%2==0:\r\n print(2)\r\nif n>3 and n%2!=0:\r\n con1=True\r\n for i in range(2, int(math.sqrt(n))+1):\r\n if n%i==0:\r\n con1=False\r\n break\r\n if con1:\r\n print(1)\r\n if not con1:\r\n n1=n-2\r\n con2=True\r\n for i in range(2, int(math.sqrt(n1))+1):\r\n if n1%i==0:\r\n con2=False\r\n break\r\n if con2:\r\n print(2)\r\n if not con2:\r\n print(3)", "def isPrime(n):\r\n i = 2\r\n while i * i <= n:\r\n \r\n if n % i == 0:\r\n return False\r\n \r\n i += 1\r\n return True\r\n\r\n\r\ndef main():\r\n \r\n n = int(input())\r\n \r\n if isPrime(n) or n == 2:\r\n print(1)\r\n elif isPrime(n - 2) or n % 2 == 0 :\r\n print(2)\r\n else:\r\n print(3)\r\n \r\n \r\nmain()", "def Prime(x):\r\n if x<2: return True\r\n for i in range(2,int(x**0.5)+1):\r\n if x%i==0: return False\r\n return True\r\nn=int(input())\r\nif Prime(n): print(1)\r\nelif n%2==0 or Prime(n-2): print(2)\r\nelse: print(3)", "from sys import stdin\r\ninput=lambda : stdin.readline().strip()\r\nfrom math import ceil,sqrt,factorial\r\nfrom collections import deque\r\ndef isprime(x):\r\n\ti=2\r\n\twhile i*i<=x:\r\n\t\tif x%i==0:\r\n\t\t\treturn False\r\n\t\ti+=1\r\n\treturn True\r\nn=int(input())\r\nif n==2 or n==3:\r\n\tprint(1)\r\nelse:\r\n\tif n%2==0:\r\n\t\tprint(2)\r\n\telse:\r\n\t\tif isprime(n):\r\n\t\t\tprint(1)\r\n\t\telse:\r\n\t\t\tif isprime(n-2):\r\n\t\t\t\tprint(2)\r\n\t\t\telse:\r\n\t\t\t\tprint(3)", "def isPrime(n):\n if n==2 or n==3:\n return True\n if n%2==0 or n%3==0:\n return False\n for i in range(5,1+int(n**0.5))[::2]:\n if n%i==0:\n return False\n return True\n\nn = int(input())\n\na = []\ni = n\n\nif isPrime(n):\n print(1)\nelse:\n if n%2==0:\n print(2)\n else:\n if isPrime(n-2):\n print(2)\n else:\n print(3)\n", "n = int(input())\n\nimport math\ndef isPrime(x):\n for i in range(2, min(x, 10 ** 5)):\n if x % i == 0:\n return False\n \n return True\n\nif isPrime(n):\n print(1)\nelif isPrime(n - 2):\n print(2)\nelif n & 1:\n print(3)\nelse:\n print(2)\n", "def isPrime(n):\r\n for i in range(2,int(n**0.5)+1):\r\n if n%i==0:\r\n return False\r\n return True\r\n \r\nn = int(input())\r\n\r\nif isPrime(n):\r\n print(1)\r\nelif not n&1 or isPrime(n-2):\r\n print(2)\r\nelse:\r\n print(3)", "import sys\r\nI = sys.stdin.readline\r\nIM = lambda : map(int, I().split())\r\n\r\ndef isprime(n):\r\n if n == 1: return False\r\n i = 2\r\n while(i*i <= n):\r\n if n % i == 0:\r\n return False\r\n i += 1\r\n\r\n return True\r\n\r\nn = int(I())\r\n\r\nif isprime(n):\r\n print(1)\r\nelif n & 1 == 0 or isprime(n - 2):\r\n print(2)\r\nelse:\r\n print(3)", "def is_prime(x):\n if x == 2:\n return True\n if x % 2 == 0:\n return False\n for i in range(3, x, 2):\n if i * i > x:\n break\n if x % i == 0:\n return False\n\n return True\n\ndef main():\n n = int(input())\n if is_prime(n):\n print(1)\n elif n % 2 == 0:\n print(2)\n else:\n print(2 if is_prime(n - 2) else 3)\n\nmain()\n", "def task(n):\r\n for i in range(2, int(n**0.5) + 1):\r\n if n % i == 0:\r\n return False\r\n return True\r\n\r\n\r\nn = int(input())\r\n\r\nif task(n):\r\n print(1)\r\nelif n % 2 == 0 or task(n - 2):\r\n print(2)\r\nelse:\r\n print(3)", "def prime(n):\r\n f = 1\r\n for i in range(2,int(n**0.5)+1):\r\n if n%i == 0:\r\n f = 0\r\n break\r\n\r\n return f\r\n\r\nn = int(input())\r\nif n == 2:\r\n print(1)\r\n exit()\r\n\r\nif n%2 == 0:\r\n print(2)\r\n exit()\r\n\r\ns = prime(n)\r\nif s == 1:\r\n print(1)\r\n exit()\r\n\r\nelse:\r\n n = n-2\r\n s = prime(n)\r\n if s == 1:\r\n print(2)\r\n exit()\r\n\r\n else:\r\n print(3)\r\n exit()", "'''input\n4\n'''\ndef is_prime(n):\n\tif n < 2: return False\n\telif n == 2: return True\n\telif n % 2 == 0: return False\n\telif all(n % i != 0 for i in range(3, int(n**0.5)+1, 2)): return True\n\treturn False\n\nn = int(input())\nprint(1 if is_prime(n) else 2 if n % 2 == 0 or is_prime(n-2) else 3)\n\n\n", "def isprime(n):\r\n n = abs(int(n))\r\n if n < 2:\r\n return False\r\n if n == 2: \r\n return True \r\n if not n & 1: \r\n return False\r\n for x in range(3, int(n**0.5) + 1, 2):\r\n if n % x == 0:\r\n return False\r\n return True\r\n\r\nn = int(input())\r\nif isprime(n):\r\n\tprint(1)\r\nelif isprime(n-2):\r\n\tprint(2)\r\nelif n%2 == 0:\r\n\tprint(2)\r\nelse:\r\n\tprint(3)", "def isPrime(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\nx = int(input())\r\nif isPrime(x):\r\n print(1)\r\nelif x % 2 == 0:\r\n print(2)\r\nelif isPrime(x - 2):\r\n print(2)\r\nelse:\r\n print(3)\r\n", "def isPrime(x):\r\n n=x\r\n if(x>=2):\r\n i=2\r\n while(i*i<=n):\r\n if(x%i==0):\r\n return False\r\n i+=1\r\n return True\r\n else:\r\n return False\r\ncin=input().split()\r\nfor k in cin:\r\n n=int(k)\r\n count=0\r\n if(isPrime(n)):\r\n count=1\r\n elif(isPrime(n-2)or n%2==0):\r\n count=2\r\n else:\r\n count=3\r\n print(count)\r\n \r\n \r\n", "import math\r\n \r\n \r\ndef is_prime(n):\r\n\tif n == 2: \r\n\t\treturn True\r\n\tfor i in range(2, int(math.sqrt(n)) + 2):\r\n\t\tif n % i == 0:\r\n\t\t\treturn False\r\n\treturn True\r\n \r\ndef solve(n):\r\n\tif is_prime(n): \r\n\t\treturn 1\r\n\tif n % 2 == 0: \r\n\t\treturn 2\r\n\tif is_prime(n - 2): \r\n\t\treturn 2\r\n\treturn 3\r\n \r\nprint(solve(int(input())))", "def prime(n):\r\n for i in range(2,int(n**.5)+1):\r\n if n%i==0:return 0\r\n \r\n return 1\r\n \r\nn=int(input())\r\nif prime(n)==1:print(1)\r\nelif n%2==0 or prime(n-2)==1:print(2)\r\nelse:print(3)", "def isPrime(n):\r\n if n < 2:\r\n return False\r\n i = 2\r\n while i*i <= n:\r\n if n % i == 0:\r\n return False\r\n i += 1\r\n return True\r\n\r\n\r\ndef solve(n):\r\n if isPrime(n):\r\n print(1)\r\n elif n % 2 == 0 or isPrime(n-2):\r\n print(2)\r\n else:\r\n print(3)\r\n\r\nsolve(int(input()))\r\n", "import os, sys\r\nfrom io import BytesIO, IOBase\r\nmod=10**9+7\r\n\r\ninput = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\r\n\r\ndef isprime(n):\r\n for i in range(2,int(n**(1/2))+1):\r\n if n%i==0:\r\n return False\r\n return True\r\n\r\n\r\nn=int(input())\r\nif isprime(n):\r\n print(1)\r\nelif n%2==0:\r\n print(2)\r\nelif isprime(n-2):\r\n print(2)\r\nelse:\r\n print(3)", "def is_prime(x):\r\n for i in range(2, int(x**0.5) + 1):\r\n if x % i == 0:\r\n return False\r\n return True\r\n\r\n\r\nn = int(input())\r\nif is_prime(n):\r\n print(1)\r\nelif n % 2 == 0 or is_prime(n - 2):\r\n print(2)\r\nelse:\r\n print(3)\r\n", "def judge(d):\n return all([d % i for i in range(2, int(d**0.5)+1)])\n\n\nn = int(input())\nif n in [2, 3, 4, 5]:\n print([0, 0, 1, 1, 2, 1][n])\nelse:\n if n % 2:\n if judge(n):\n print(1)\n else:\n if judge(n-2):\n print(2)\n else:\n print(3)\n else:\n print(2)\n \t \t\t \t\t\t \t\t\t \t\t\t\t \t \t \t\t\t \t", "import math\r\n\r\ndef getFactors(n): \r\n factors = []\r\n i = 1\r\n while i <= math.sqrt(n): \r\n if (n % i == 0) : \r\n if (n // i == i) : \r\n factors.append(i)\r\n else : \r\n factors.append(i)\r\n factors.append(n//i)\r\n i = i + 1\r\n return factors\r\n\r\nn = int(input())\r\n\r\nif n == 2:\r\n print(1)\r\nelif not n%2:\r\n print(2)\r\nelse:\r\n if len(getFactors(n)) == 2:\r\n print(1)\r\n elif len(getFactors((n-2))) == 2:\r\n print(2)\r\n else:\r\n print(3)", "def isPrime(n):\r\n for i in range(2,int(n**0.5)+1):\r\n if n%i==0:\r\n return False\r\n return True\r\n\r\na=int(input())\r\n\r\nif a==2:\r\n print(1)\r\nelif a%2==0:\r\n print(2)\r\nelif isPrime(a):\r\n print(1)\r\nelif isPrime(a-2):\r\n print(2)\r\nelse:\r\n print(3)\r\n", "def check_easy(n):\r\n flag = True\r\n for j in range(2, int(n ** 0.5) + 1):\r\n if n % j == 0:\r\n flag = False\r\n break\r\n return flag\r\n\r\n\r\ndef main():\r\n n = int(input())\r\n if check_easy(n):\r\n print(1)\r\n elif n % 2 == 0:\r\n print(2)\r\n elif check_easy(n - 2):\r\n print(2)\r\n else:\r\n print(3)\r\n\r\n\r\nmain()", "def isprime(n):\n\tif(n==1):\n\t\treturn 0\n\tif(n==2 or n==3):\n\t\treturn 1\n\ti=2\n\twhile(i*i<=n):\n\t\tif(n%i==0):\n\t\t\tbreak\n\t\ti+=1\n\tif(i*i>n):\n\t\treturn 1\n\telse:\n\t\treturn 0\nn=int(input())\nif(isprime(n)==1):\n\tprint(1)\nelif(isprime(n-2)==1 or n%2==0):\n\tprint(2)\nelse:\n\tprint(3)\n", "from math import sqrt\r\n\r\ndef is_prime(x):\r\n y = int(sqrt(x))\r\n for i in range(2, y + 1):\r\n if x % i == 0:\r\n return False\r\n return True\r\n\r\n\r\ndef main():\r\n n = int(input())\r\n if is_prime(n):\r\n return 1\r\n if n % 2 == 0:\r\n return 2\r\n if is_prime(n - 2):\r\n return 2\r\n return 3\r\n\r\nprint(main())", "def is_prime(num):\n i = 2\n while i * i <= num:\n if num % i == 0:\n return False\n i += 1\n return True\n\nn = int(input())\nif n == 2:\n print(1)\nelif n % 2 == 1:\n if is_prime(n):\n print(1)\n elif is_prime(n-2):\n print(2)\n else:\n print(3)\nelse:\n print(2)\n\n \t\t\t \t\t\t \t \t\t\t \t\t\t \t", "from math import sqrt\r\n\r\n\r\ndef prime(number):\r\n for i in range(2, int(sqrt(number)) + 1):\r\n if number % i == 0:\r\n return False\r\n return True\r\n\r\n\r\ndef taxes(n):\r\n if n < 4:\r\n return 1\r\n elif n % 2 == 0:\r\n return 2\r\n elif prime(n):\r\n return 1\r\n else:\r\n if prime(n - 2):\r\n return 2\r\n else:\r\n return 3\r\n\r\n\r\nprint(taxes(int(input())))\r\n", "def f(n) :\r\n prime=True\r\n for i in range(2,50000) :\r\n if i!=n and n%i==0 :\r\n prime=False\r\n return prime\r\n\r\nn = int(input())\r\n\r\nif f(n)==True :\r\n print(1)\r\nelse :\r\n if n%2==0 :\r\n print(2)\r\n elif f(n-2)==True :\r\n print(2)\r\n else :\r\n print(3)", "from math import *\r\nfrom sys import stdin\r\ninput = stdin.readline\r\n\r\nn = int(input())\r\n\r\ndef p(x):\r\n d = 2\r\n while d*d <= x:\r\n if x%d == 0: return False\r\n d += 1\r\n return True\r\n\r\nprint(1 if p(n) else 2 if n%2==0 or p(n-2) else 3)\r\n\r\n# https://blog.csdn.net/h1021456873/article/details/53699070", "import math\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\n\r\nif n == 2:\r\n print(1)\r\nelif n % 2 == 0:\r\n print(2)\r\nelif is_prime(n):\r\n print(1)\r\nelse:\r\n if is_prime(n-2):\r\n print(2)\r\n else:\r\n print(3)", "# template begins\n#####################################\n \n# import libraries for input/ output handling\n# on generic level\nimport atexit, io, sys, math, heapq, collections\n\n#input handling\n#input of single integer\ndef get_int(): return int(sys.stdin.readline().strip())\n#input of multiple integers\ndef get_ints(): return map(int, sys.stdin.readline().strip().split())\n#input of list\ndef get_list(): return list(map(int, sys.stdin.readline().strip().split()))\n#input of string\ndef get_string(): return sys.stdin.readline().strip()\n\n#output handling\n#writing int output\ndef write_int(a): sys.stdout.write(str(a)+\"\\n\")\n#writing String\ndef write_str(a): sys.stdout.write(a+\"\\n\")\n#writing Array\ndef write_list(arr): sys.stdout.write(\" \".join(map(str, arr)) + \"\\n\")\n\n#general functions\n#swap\ndef swap(arr, a, b):\n arr[a]^=arr[b]\n arr[b]^=arr[a]\n arr[a]^=arr[b]\n\n#NumberOfDigits\ndef int_len(a): return math.floor(math.log(a,10))+1\n\n#Powerof2\ndef isPowerOfTwo(x): return x and (not(x & (x-1)))\n\n#Sieve\ndef Sieve(n):\n prime = [True for i in range(n+1)]\n p = 2\n while (p * p <= n):\n if (prime[p] == True):\n for i in range(p * p, n+1, p):\n prime[i] = False\n p += 1\n res = []\n for i in range(2,len(prime)):\n if (prime[i]):\n res.append(i)\n return res\n\n#binarySearch\ndef binarySearch (arr, l, r, x):\n if r >= l:\n \n mid = l + (r - l) // 2\n if arr[mid] == x:\n return mid\n elif arr[mid] > x:\n return binarySearch(arr, l, mid-1, x)\n else:\n return binarySearch(arr, mid + 1, r, x)\n else:\n return -1\ndef search(arr,x): return binarySearch(arr,0,len(arr)-1,x)\n\n#Array to String\ndef toString(A): return''.join(A)\n\n# String to array\ndef toArray(str): return str.split()\n\n#ArraySum\ndef arrSum(Arr):\n Sum =0\n for i in range (len(Arr)):\n Sum+=Arr[i]\n return Sum\n\ndef computeXOR(n) :\n \n # Modulus operator are expensive\n # on most of the computers. n & 3\n # will be equivalent to n % 4.\n \n # if n is multiple of 4\n if n % 4 == 0 :\n return n\n \n # If n % 4 gives remainder 1\n if n % 4 == 1 :\n return 1\n \n # If n%4 gives remainder 2\n if n % 4 == 2 :\n return n + 1\n \n # If n%4 gives remainder 3\n return 0\n \n\ndef find_gcd(x, y):\n \n while(y):\n x, y = y, x % y\n \n return x\n \ndef isSubSequence(string1, string2, m, n):\n # Base Cases\n if m == 0:\n return True\n if n == 0:\n return False\n \n # If last characters of two\n # strings are matching\n if string1[m-1] == string2[n-1]:\n return isSubSequence(string1, string2, m-1, n-1)\n \n # If last characters are not matching\n return isSubSequence(string1, string2, m, n-1)\n\ndef sum(a,b):\n if (b.find('-')!=-1):\n return \"-1\"\n L1= len(a)\n L2= len(b)\n res =\"\"\n if (L1<L2):\n a='0'*(L2-L1)+a\n elif (L2<L1):\n b='0'*(L1-L2)+b\n for i in range(0,max(L1,L2)):\n s=a[i]\n t=b[i]\n p=int(a[i])+int(b[i])\n res+=str(p)\n return res\n\ndef isPalin(s):\n return s == s[::-1]\n\n \ndef nextPermutation( nums):\n i=len(nums)-1\n flag=True\n while (i>=1):\n if nums[i]>nums[i-1]:\n i-=1\n flag=False\n break\n i-=1\n\n if i==0 and flag:\n nums.reverse()\n else:\n diff=10000000\n index=i\n j=i\n while(j<len(nums)):\n if (nums[j]>nums[i] and diff>=nums[j]-nums[i]):\n index=j\n diff=nums[j]-nums[i]\n j+=1\n temp=nums[index]\n nums[index]=nums[i]\n nums[i]=temp\n nums[i+1:]=reversed(nums[i+1:]) \n return nums\n\ndef pairs(arr, size, n):\n \n mpp = {}\n \n for i in range(size):\n if arr[i] in mpp.keys():\n mpp[arr[i]] += 1\n else:\n mpp[arr[i]] = 1\n \n for i in range(size):\n if n + arr[i] in mpp.keys():\n #print(\"Pair Found: (\" + str(arr[i]) + \", \" + str(n + arr[i]) + \")\")\n return True\n \n #print(\"No Pair found\")\n return False\n\n\ndef isPrime(n):\n\n k = int(n**(1/2)) +1\n for i in range(2,k):\n if n%i==0:\n return False\n return True\n#####################################\n# template ends\n\n# Code begins\n#####################################\n\n\ndef lps( s):\n a = s[-1]\n if len(s)==1:\n return 0\n elif len(s)==2:\n if s[0]==s[1]: return 1\n return 0\n \n k = len(s)-2\n while (k>=0):\n if s[k]==s[-1]:\n if s[:k+1]==s[len(s)-k-1:]:\n return k+1\n k-=1\n return 0\n \ndef check(arr):\n i=0\n for i in range(len(arr)-1):\n if arr[i]%2!=arr[i+1]%2:\n return False\n return True\n\n\nn = get_int()\nif n%2==0:\n if n==2:\n print(1)\n else:\n print(2)\nelse:\n if isPrime(n):\n print(1)\n elif isPrime(n-2):\n print(2)\n else:\n print(3)\n\n\n \n#####################################\n# Code ends\n\n\n# Creating 2D array sol = [[0 for i in range(N)] for j in range(N)]\n\n\n", "from sys import stdin\r\ninput = stdin.readline\r\nn = int(input())\r\nif n == 2:\r\n\tprint(1)\r\n\texit()\r\nif n % 2 == 0:\r\n\tprint(2)\r\n\texit()\r\nisPrime = True\r\nisP = True\r\nfor i in range(3, int(n ** 0.5) + 2):\r\n\tif isPrime and n % i == 0:\r\n\t\tisPrime = False\r\n\t\tif not isP:\r\n\t\t\tbreak\r\n\tif isP and (n - 2) % i == 0:\r\n\t\tisP = False\r\n\t\tif not isPrime:\r\n\t\t\tbreak\r\nif isPrime:\r\n\tprint(1)\r\nelif isP:\r\n\tprint(2)\r\nelse:\r\n\tprint(3)\r\n", "def isPrime(n):\r\n p = 2\r\n while p * p <= n:\r\n if n % p == 0:\r\n return False\r\n p += 1\r\n return True\r\n\r\nn = int(input())\r\n\r\nif n == 2:\r\n print(1)\r\nelif n == 3:\r\n print(1)\r\nelif n == 4:\r\n print(2)\r\nelif n == 5:\r\n print(1)\r\nelif isPrime(n):\r\n print(1)\r\nelif isPrime(n - 2):\r\n print(2)\r\nelif n % 2 == 0:\r\n print(2)\r\nelse:\r\n print(3)\r\n", "def isPrime(n):\r\n if n<=1: return False\r\n if n==2: return True\r\n for i in range(2,int(n**0.5)+1):\r\n if n%i==0: return False\r\n return True\r\ndef solve(n):\r\n if isPrime(n): return 1\r\n elif isPrime(n-2) or n%2==0: return 2\r\n else: return 3\r\nprint(solve(int(input())))", "import sys\r\nimport math \r\n\r\ndef isprime(n):\r\n if n == 1:\r\n return False\r\n if n == 2:\r\n return True\r\n if n == 3:\r\n return True\r\n if (n % 2 == 0) or (n % 3 == 0):\r\n return False\r\n for i in range(5, int(math.sqrt(n))+1, 6):\r\n if (n % i == 0) or (n % (i + 2)) == 0:\r\n return False\r\n return True\r\n\r\ndef answer(n):\r\n if isprime(n):\r\n return 1\r\n if n % 2 == 0:\r\n return 2\r\n if isprime(n-2):\r\n return 2\r\n else:\r\n return 3\r\n\r\ndef main():\r\n n = int(sys.stdin.readline())\r\n print(answer(n))\r\n return\r\nmain()", "def zhishu(m):\n i=2\n while i*i<=m :\n if m%i==0 :\n return False\n else :\n i=i+1\n return True\nn=int(input())\np=1\nif n!=2 and n%2==0 :\n p=2\nelif zhishu(n)==False :\n if zhishu(n-2) :\n p=2\n else :\n p=3\nprint(p)\n \n", "def TSV(n):\n i=2\n flg=0\n fg=1\n while (i<=(n/i)) :\n if n%i==0 : \n return flg\n i+=1\n return fg\n\nn=int(input())\nif n==2 :\n print(1)\nelif n%2==0 :\n print(2)\nelif TSV(n) :\n print(1)\nelif TSV(n-2) :\n print(2)\nelse :\n print(3)\n \t\t \t \t\t\t \t \t \t\t\t \t \t\t \t", "import math\nn=int(input())\ndef prime(n):\n for i in range(2,int(math.sqrt(n))+1):\n if n%i==0:\n return False\n return True\nif n==2:\n print(1)\nelif n%2==0 and n>2:\n print(2)\nelse:\n if prime(n):\n print(1)\n elif prime(n-2):\n print(2)\n else:\n print(3)", "n=int(input())\r\ndef prime(x):\r\n for i in range(2,int(x**(0.5))+1):\r\n if not x%i:\r\n return False\r\n break\r\n return True\r\n\r\n\r\nif prime(n):\r\n print(1)\r\nelif prime(n-2)==True:\r\n print(2)\r\nelif n%2:\r\n print(3)\r\nelse:\r\n print(2)\r\n", "from math import *\r\n\r\ndef isprime(x):\r\n f= True\r\n s=int(sqrt(x))\r\n for i in range(3,s+1,2):\r\n if (x%i)==0:\r\n f=False\r\n break;\r\n if f:\r\n return f\r\n else:\r\n return f\r\n\r\n\r\nn=int(input())\r\nif n==2:\r\n print(\"1\")\r\nelif n%2==0:\r\n print(\"2\")\r\nelif isprime(n):\r\n print(\"1\")\r\nelif isprime(n-2):\r\n print(\"2\")\r\nelse:\r\n print(\"3\")\r\n\r\n", "from heapq import heapify, heappop, heappush, nlargest\r\nfrom collections import Counter, defaultdict\r\nfrom sys import stdin, stdout\r\nfrom math import ceil, floor, sqrt\r\nfrom functools import reduce,lru_cache\r\n# n,m = map(int,stdin.readline().split())\r\n# stdout.write(str(arr[x-y]-arr[x])+'\\n')\r\n# reps = int(stdin.readline())\r\n\r\n# for _ in range(reps):\r\n # n, x, y = map(int,stdin.readline().split())\r\n # s1,s2 = stdin.readline().strip().split()\r\n # s2 = stdin.readline().strip()\r\n # n = int(stdin.readline())\r\n # arr = list(map(int,stdin.readline().split()))\r\ndef isprime(n):\r\n if (n <= 1):\r\n return False\r\n\r\n for i in range(2, int(sqrt(n))+1):\r\n if (n % i == 0):\r\n return False\r\n\r\n return True\r\n\r\n\r\nn = int(stdin.readline())\r\nif n==2: print(1)\r\nelif n%2==0: print(2)\r\nelif isprime(n): print(1)\r\nelif isprime(n-2): print(2)\r\nelse: print(3)\r\n\r\n", "import sys\r\n\r\ninput = lambda: sys.stdin.readline().rstrip()\r\n\r\n\r\ndef miller_rabin(p):\r\n if p <= 4:\r\n return p in (2, 3)\r\n pow_2, tmp = 0, p - 1\r\n while tmp % 2 == 0:\r\n tmp //= 2\r\n pow_2 += 1\r\n for с in (2, 3, 5, 7, 11):\r\n basic = pow(с, tmp, p)\r\n if basic in (0, 1, p - 1):\r\n continue\r\n for _ in range(1, pow_2):\r\n basic = basic ** 2 % p\r\n if basic == 1:\r\n return False\r\n if basic == p - 1:\r\n break\r\n if basic != p - 1:\r\n return False\r\n return True\r\n\r\n\r\ndef solution(n):\r\n if n % 2 == 0:\r\n return 2 if n > 2 else 1\r\n\r\n if miller_rabin(n):\r\n return 1\r\n\r\n return 2 if miller_rabin(n - 2) else 3\r\n\r\n\r\nn = int(input())\r\nprint(solution(n))\r\n", "from math import sqrt\r\ndef isPrime(n):\r\n if n==2:\r\n return True\r\n en = int(sqrt(n)+1)+1\r\n for i in range(2,en):\r\n if n%i==0:\r\n return False\r\n return True\r\n\r\nn = int(input())\r\nif isPrime(n):\r\n print(1)\r\nelif n%2==0:\r\n print(2)\r\nelif isPrime(n-2):\r\n print(2)\r\nelse:\r\n print(3)", "import math\n\n\ndef isPrim(num):\n for i in range(2, int(math.sqrt(num))+1):\n if num % i == 0:\n return False\n return True\n\nnum = input()\nnum = int(num)\n\nif num == 2:\n print(1)\nelif num % 2 == 1:\n if isPrim(num):\n print('1')\n else:\n if isPrim(num-2):\n print('2')\n else:\n print('3')\nelse:\n print('2')\n\n \t\t \t\t \t \t \t \t \t \t \t\t \t", "n = int(input())\npredef = {2: 1, 3: 1, 4: 2, 5: 1, 6: 2}\nif n in predef:\n print(predef[n])\nelse:\n j = 2\n while j * j <= n:\n if n % j == 0:\n if n % 2:\n k = 2\n while k * k <= n - 2:\n if (n - 2) % k == 0:\n print(3)\n break\n k += 1\n else:\n print(2)\n else:\n print(2)\n break\n j += 1\n else:\n print(1)", "def is_prime(n):\r\n if n==2 or n==3:\r\n return True\r\n if n%2==0 or n%3==0:\r\n return False \r\n 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\n\r\nif is_prime(n):\r\n print(1)\r\nelif n%2==0 or is_prime(n-2):\r\n print(2)\r\nelse:\r\n print(3)", "def prime(x):\r\n p=int(n**.5)\r\n p+=2\r\n for i in range(3,p,2):\r\n if x%i==0:\r\n return False\r\n return True\r\n\r\ndef func(n):\r\n if n%2==0:\r\n if n==2:\r\n return 1\r\n return 2\r\n\r\n if n==1 or n==3 or n==5:\r\n return 1\r\n \r\n if prime(n):\r\n return 1\r\n if prime(n-2):\r\n return 2\r\n return 3\r\n\r\nn=int(input())\r\nans=func(n)\r\nprint(ans)", "n=int(input())\r\nimport math\r\ndef is_prime(n):\r\n\tif n <= 1:\r\n\t\treturn False\r\n\tif n == 2 or n == 3:\r\n\t\treturn True\r\n\tif n % 2 == 0 or n % 3 == 0:\r\n\t\treturn False\r\n\tfor i in range(5, int(math.sqrt(n))+1, 6):\r\n\t\tif n % i == 0 or n % (i + 2) == 0:\r\n\t\t\treturn False\r\n\treturn True\r\nif(is_prime(n)):\r\n print(1)\r\nelif(n%2==0):\r\n print(2)\r\nelif(is_prime(n-2)):\r\n print(2) \r\nelse:\r\n print(3)", "from collections import Counter\r\n\r\n\r\ndef gcd(x, y):\r\n \"\"\"greatest common divisor of x and y\"\"\"\r\n while y:\r\n x, y = y, x % y\r\n return x\r\n\r\n\r\ndef memodict(f):\r\n \"\"\"memoization decorator for a function taking a single argument\"\"\"\r\n class memodict(dict):\r\n def __missing__(self, key):\r\n ret = self[key] = f(key)\r\n return ret\r\n\r\n return memodict().__getitem__\r\n\r\n\r\ndef pollard_rho(n):\r\n \"\"\"returns a random factor of n\"\"\"\r\n if n & 1 == 0:\r\n return 2\r\n if n % 3 == 0:\r\n return 3\r\n\r\n s = ((n - 1) & (1 - n)).bit_length() - 1\r\n d = n >> s\r\n for a in [2, 325, 9375, 28178, 450775, 9780504, 1795265022]:\r\n p = pow(a, d, n)\r\n if p == 1 or p == n - 1 or a % n == 0:\r\n continue\r\n for _ in range(s):\r\n prev = p\r\n p = (p * p) % n\r\n if p == 1:\r\n return gcd(prev - 1, n)\r\n if p == n - 1:\r\n break\r\n else:\r\n for i in range(2, n):\r\n x, y = i, (i * i + 1) % n\r\n f = gcd(abs(x - y), n)\r\n while f == 1:\r\n x, y = (x * x + 1) % n, (y * y + 1) % n\r\n y = (y * y + 1) % n\r\n f = gcd(abs(x - y), n)\r\n if f != n:\r\n return f\r\n return n\r\n\r\n\r\n@memodict\r\ndef prime_factors(n):\r\n \"\"\"returns a Counter of the prime factorization of n\"\"\"\r\n if n <= 1:\r\n return Counter()\r\n f = pollard_rho(n)\r\n return Counter([n]) if f == n else prime_factors(f) + prime_factors(n // f)\r\n\r\n\r\ndef distinct_factors(n):\r\n \"\"\"returns a list of all distinct factors of n\"\"\"\r\n factors = [1]\r\n for p, exp in prime_factors(n).items():\r\n factors += [p**i * factor for factor in factors for i in range(1, exp + 1)]\r\n return factors\r\n\r\n\r\ndef all_factors(n):\r\n \"\"\"returns a sorted list of all distinct factors of n\"\"\"\r\n small, large = [], []\r\n for i in range(1, int(n**0.5) + 1, 2 if n & 1 else 1):\r\n if not n % i:\r\n small.append(i)\r\n large.append(n // i)\r\n if small[-1] == large[-1]:\r\n large.pop()\r\n large.reverse()\r\n small.extend(large)\r\n return small\r\n\r\ndef isprime(n):\r\n d = prime_factors(n)\r\n if len(d) > 1:\r\n return False\r\n x = list(d)[0]\r\n if d[x]==1:\r\n return True\r\n return False\r\n\r\ndef process(n):\r\n if isprime(n):\r\n return 1\r\n if n % 2==0:\r\n return 2\r\n if isprime(n-2):\r\n return 2\r\n return 3\r\n\r\nn = int(input())\r\nprint(process(n))", "from math import sqrt\r\n\r\ndef is_prime(p):\r\n for i in range(2, int(sqrt(p) + 1)):\r\n if p % i == 0:\r\n return False\r\n return True\r\n\r\nn = int(input())\r\n\r\nif is_prime(n):\r\n print(1)\r\nelse:\r\n if n % 2 == 0:\r\n print(2)\r\n else:\r\n if is_prime(n - 2):\r\n print(2)\r\n else:\r\n print(3)\r\n", "def is_prime(x):\r\n for i in range(2, int(x**0.5)+1):\r\n if x%i==0:\r\n return False\r\n return x!=1\r\n\r\nn = int(input())\r\n\r\nif is_prime(n):\r\n print(1)\r\nelse:\r\n if n%2==0:\r\n print(2)\r\n else:\r\n if is_prime(n-2):\r\n print(2)\r\n else:\r\n print(3)", "import math\r\n\r\nn = eval(input())\r\ndef isP(n):\r\n lim = int(math.sqrt(n + 0.5))\r\n for i in range(2,lim+1):\r\n if(n%i==0):\r\n return False\r\n return True\r\nans = 0\r\nif(isP(n)):\r\n ans = 1\r\nelif(n%2==0):\r\n ans = 2\r\nelif(isP(n-2)):\r\n ans = 2\r\nelse:\r\n ans = 3\r\nprint(ans)", "def isprime(n):\n for i in range(2, int(n ** 0.5) + 1):\n if n % i == 0: return False\n return True\n\n\nn = int(input())\nif isprime(n): print(1)\nelif n % 2 == 0 or isprime(n - 2): print(2)\nelse: print(3)\n", "from math import ceil\r\nn = int(input())\r\n\r\ndef prime(x):\r\n for d in range(2, int(ceil(x**0.5) + 1)):\r\n if d < x and x % d == 0:\r\n return False\r\n return True\r\n\r\nif prime(n):\r\n print(1)\r\nelif prime(n-2) or n % 2 == 0:\r\n print(2)\r\nelse:\r\n print(3)", "def isPrime(n):\r\n for i in range(2, int(n**0.5)+1):\r\n if n%i == 0:\r\n return False\r\n return True\r\nn = int(input())\r\nif isPrime(n):\r\n print (1)\r\nelif n%2 == 0:\r\n print (2)\r\nelif isPrime(n-2):\r\n print (2)\r\nelse:\r\n print (3)\r\n", "\r\ndef isPrime(n):\r\n\r\n if (n <= 1):\r\n return False\r\n if (n <= 3):\r\n return True\r\n\r\n if (n % 2 == 0 or n % 3 == 0):\r\n return False\r\n\r\n i = 5\r\n while(i * i <= n):\r\n if (n % i == 0 or n % (i + 2) == 0):\r\n return False\r\n i = i + 6\r\n\r\n return True\r\nn=int(input())\r\nif n==2:\r\n print(1)\r\nelif n%2==0:\r\n print(2)\r\nelif n==5 or n==7 or n==11 or n==3:\r\n print(1)\r\nelif isPrime(n)==True:\r\n print(1)\r\nelse:\r\n if n%2!=0:\r\n if isPrime(n-2)==True:\r\n print(2)\r\n else:\r\n print(3)\r\n \r\n", "def isPrime(num):\r\n for i in range(2,int(num**0.5)+1):\r\n if(num%i==0):\r\n return False\r\n return True\r\n \r\na=int(input())\r\nx=a\r\nif(isPrime(x)==True):\r\n print(1)\r\nelif(x%2==0):\r\n print(2)\r\nelse:\r\n if(isPrime(x-2)==True):\r\n print(2)\r\n else:\r\n print(3)", "from math import *\r\n\r\ndef prime(x):\r\n s = sqrt(x)\r\n i = 2\r\n while i <= s:\r\n if x % i == 0:\r\n return False\r\n i += 1\r\n return True\r\n\r\nn = int(input())\r\n\r\nif (prime(n)):\r\n print(1)\r\nelif n % 2 == 0:\r\n print(2)\r\nelse:\r\n if prime(n - 2):\r\n print(2)\r\n else:\r\n print(3)\r\n", "import math\r\ndef is_prime(n):\r\n prime = True\r\n for x in range(2, int(math.sqrt(n))+1):\r\n if n%x == 0: prime = False\r\n return prime\r\n\r\nN = int(input())\r\nif is_prime(N):\r\n ans = 1\r\nelif N % 2 == 0:\r\n ans = 2\r\nelif is_prime(N-2):\r\n ans = 2\r\nelse:\r\n ans = 3\r\nprint(ans)", "def snt(n):\r\n for i in range(2, int(n**0.5) + 1):\r\n if n%i == 0: return False\r\n return True\r\nn = int(input())\r\nif n%2 == 0:\r\n if n == 2 : print(1)\r\n else: print(2)\r\nelse: \r\n if snt(n):\r\n print('1')\r\n else: \r\n if snt(n-2):\r\n print('2')\r\n else: \r\n print('3')\r\n", "from math import *\r\nn = int(input())\r\nif(n == 2):\r\n print(1)\r\nelif(n%2 == 0):\r\n print(2)\r\nelse:\r\n isprime = True\r\n is2prime = True\r\n for i in range(2,int(sqrt(n)+1)):\r\n if(n%i==0):\r\n isprime = False\r\n break\r\n for i in range(2,int(sqrt(n-2)+1)):\r\n if((n-2)%i==0):\r\n is2prime = False\r\n break \r\n\r\n if(isprime):\r\n print(1)\r\n elif(is2prime):\r\n print(2)\r\n else:\r\n print(3) \r\n\r\n", "\r\nimport sys\r\n#sys.stdin=open(\"data.txt\")\r\n#sys.stdout=open(\"data.txt\",\"w\")\r\ninput=sys.stdin.readline\r\n\r\ndef isprime(a):\r\n for i in range(2,a):\r\n if a%i==0: return 0\r\n if i*i>a: return 1\r\n return 1\r\n\r\nn=int(input())\r\n\r\nif n%2==0:\r\n if n==2: print(1)\r\n else: print(2) # goldbach's conjecture\r\nelif isprime(n): print(1)\r\nelif isprime(n-2): print(2)\r\nelse: print(3) # weaker goldbach's conjecture", "def p(x):\r\n i=2\r\n while i*i<=x:\r\n if x%i==0:return False\r\n i+=1\r\n return True\r\n\r\nn=int(input())\r\nif p(n):print(1)\r\nelif p(n-2) or n%2==0:print(2)\r\nelse:print(3)", "\r\nprime = []\r\nl = [0 for i in range(int(1e5+2))]\r\nfor i in range(2, int(1e5)):\r\n if l[i] == 0:\r\n prime.append(i)\r\n j = 1\r\n while(i * j < int(1e5)):\r\n l[i*j] = 1\r\n j += 1\r\n\r\ndef isPrime(val):\r\n for i in prime:\r\n if val % i == 0 and i != val:\r\n return 0\r\n return 1\r\nn = int(input())\r\nans = 0\r\nif isPrime(n):\r\n ans = 1\r\nelif n % 2 == 0:\r\n ans = 2\r\nelse:\r\n if isPrime(n - 2):\r\n ans = 2\r\n else:\r\n ans = 3\r\nprint(ans)\r\n\r\n", "import collections\r\nimport heapq\r\nimport sys\r\nimport math\r\nimport itertools\r\nimport bisect\r\nimport os\r\nfrom io import BytesIO, IOBase\r\ninput = sys.stdin.readline\r\ndef is_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\ndef solve():\r\n n = int(input())\r\n\r\n if is_prime(n):return 1\r\n if n%2==0:return 2\r\n elif is_prime(n-2):return 2\r\n else:return 3\r\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 print(solve())\r\n", "import math\r\n\r\n\r\ndef prime(n):\r\n c=0\r\n sq = int(math.sqrt(n))\r\n for i in range(2,sq+1):\r\n if n%i==0:\r\n c=1\r\n break\r\n if c==0:\r\n return True\r\n return False\r\n\r\nn = int(input())\r\nans=0\r\nc=0\r\n \r\nif prime(n):\r\n print(1)\r\nelif n%2==0 or prime(n-2):\r\n print(2)\r\nelse:\r\n print(3)", "n=int(input())\r\nif n==2 or n==3:\r\n exit(print(1))\r\nelif n%2==0:\r\n exit(print(2))\r\nfor i in range(n,n-3,-1):\r\n if i!=n-1:\r\n for j in range(2,int(i**0.5)+2):\r\n if i%j==0:\r\n break\r\n elif j==int(i**0.5) +1:\r\n if i==n:\r\n exit(print(1))\r\n else:\r\n exit(print(2))\r\nexit(print(3))\r\n ", "def isPrime(n):\r\n c = 0 \r\n for i in range(2, int(n ** 0.5) + 1):\r\n if(n % i == 0):\r\n c += 1 \r\n if(c):\r\n return 0 \r\n else:\r\n return 1\r\n\r\nn = int(input())\r\nif(isPrime(n)):\r\n print(1)\r\nelif(n % 2 and isPrime(n - 2) or not n % 2):\r\n print(2)\r\nelse:\r\n print(3)", "n = int(input())\r\n\r\n\r\ndef isprime(sn):\r\n for c in range(2, int(sn**0.5 + 1)):\r\n if sn % c == 0:\r\n return False\r\n return True\r\n\r\n\r\nif isprime(n):\r\n print(1)\r\nelif (n & 1) == 0:\r\n print(2)\r\nelif isprime(n - 2):\r\n print(2)\r\nelse:\r\n print(3)", "'''\nFuad Ashraful Mehmet \nUniversity of Asia Pacific\nDate:05th march 2020\n'''\n\n\n \nimport math\nclass Taxes:\n def __init__(self,n):\n self.__n=n\n \n\n def IsPrime(self,x):\n\n for i in range(2,int(math.sqrt(x))+1):\n if not x%i:\n return False\n return True\n\n def Solve(self):\n \n if self.IsPrime(self.__n):\n print(1)\n elif not self.__n%2:\n print(2)\n elif self.IsPrime(self.__n-2):\n print(2)\n else:\n print(3)\n \n\nO__O=Taxes(int(input()))\nO__O.Solve()\n", "import math\r\ndef isPrime(n):\r\n a=math.sqrt(n)\r\n i=2\r\n while i<=a:\r\n if n%i==0:\r\n return False\r\n i+=1\r\n return True\r\nn=int(input())\r\nif isPrime(n):\r\n print(1)\r\nelse:\r\n if n%2==0:\r\n print(2)\r\n else:\r\n if isPrime(n-2):\r\n print(2)\r\n else:\r\n print(3)", "from math import sqrt\r\nn=int(input(\"\"))\r\ns=int(sqrt(n))\r\ndef prime(n):\r\n c=0\r\n for i in range(2, s + 1):\r\n if (n % i == 0):\r\n c = 1\r\n break\r\n if c==1:\r\n return False\r\n else:\r\n return True\r\nif prime(n)==True:\r\n print(\"1\")\r\nelse:\r\n if n==2:\r\n print(\"1\")\r\n if n%2==0:\r\n print(\"2\")\r\n else:\r\n a=n-2\r\n if prime(a)==True:\r\n print(\"2\")\r\n else:\r\n print(\"3\")", "def isPrime(n):\r\n for i in range(2,int(n**0.5)+1):\r\n if n%i==0:\r\n return False\r\n \r\n return True\r\nn = int(input())\r\nif isPrime(n):print(1)\r\nelif not n&1 or isPrime(n-2):print(2)#even or n-2 prime\r\nelse:print(3)\r\n", "import math\r\n\r\ndef prime(x):\r\n if x <= 1:\r\n return 0\r\n for i in range(2, int(math.sqrt(x)) + 1):\r\n if x % i == 0:\r\n return 0\r\n return 1\r\n\r\nn = int(input())\r\n\r\nif prime(n):\r\n print(1)\r\nelif n % 2 == 0:\r\n print(2)\r\nelif prime(n - 2):\r\n print(2)\r\nelse:\r\n print(3)", "def is_prime(n):\r\n if n == 2 or n == 3: return True\r\n if n < 2 or n % 2 == 0: return False\r\n if n < 9: return True\r\n if n % 3 == 0: return False\r\n r = int(n ** 0.5)\r\n f = 5\r\n while f <= r:\r\n if n % f == 0: return False\r\n if n % (f + 2) == 0: return False\r\n f += 6\r\n return True\r\n\r\n\r\nif __name__ == '__main__':\r\n n = int(input().strip())\r\n if n == 4:\r\n print(2)\r\n else:\r\n if is_prime(n):\r\n print(1)\r\n elif n & 1:\r\n if is_prime(n - 2):\r\n print(2)\r\n else:\r\n print(3)\r\n else:\r\n print(2)\r\n", "def isPrime(n):\n global primes\n for p in primes:\n if p*p>n: return True\n if n%p==0: return False\n return True\n\n\nerath = [True] * 1000001\nerath[0] = False\nerath[1] = False\nfor p in range(2, 1000+1):\n if erath[p]==False: continue\n for m in range(p*p, 1000000+1, p):\n erath[m] = False\n\nprimes = [n for n in range(1000000) if erath[n]==True]\n\nmoney = int(input())\n#print(\"Money: \", i, \"Tax: \", end=\"\")\n#print(\"INPUT:\", money)\ntax = 0\n\nif isPrime(money):\n print(1)\nelif money%2==0:\n print(2)\nelif isPrime(money-2):\n print(2)\nelse:\n print(3)\n\n\t\t\t\t\t\t\t \t \t\t\t\t \t \t \t\t\t\t \t\t\t", "from itertools import *\r\nfrom math import *\r\ndef isPrime(n):\r\n return n>1and all(n%i for i in islice(count(2),int(sqrt(n)-1)))\r\nb=int(input())\r\nm=isPrime(b)\r\n\r\nif m==True:\r\n print(1)\r\nelif b%2==0:\r\n print(2)\r\nelif isPrime(b-2)==True:\r\n print(2)\r\nelse:\r\n print(3)", "def prime(r):\r\n i = 2\r\n while i * i <= r:\r\n if r % i == 0:\r\n return False\r\n i += 1\r\n return True\r\nn = int(input())\r\nif prime(n):\r\n print(1)\r\nelif n%2==0 or prime(n-2):\r\n print(2)\r\nelse:\r\n print(3)\r\n", "import math\r\n\r\ndef prime(n):\r\n\tfor i in range(2,int(math.sqrt(n))+1):\r\n \tif n%i==0:\r\n \t\treturn False\r\n\treturn True\r\n\r\nn=int(input())\r\n\r\nif prime(n):\r\n\tprint(1)\r\nelif n%2==0:\r\n\tprint(2)\r\nelif prime(n-2):\r\n\tprint(2)\r\nelse:\r\n\tprint(3)\r\n", "def check_prime(x):\r\n i = 2\r\n while i*i<=x:\r\n if x%i == 0:\r\n break\r\n i+=1\r\n else:\r\n return True\r\n return False\r\nn = int(input())\r\nif check_prime(n) == True:\r\n print(1)\r\nelif n%2 == 0:\r\n print(2)\r\nelif check_prime(n-2) == True:\r\n print(2)\r\nelse:\r\n print(3)\r\n", "from math import isqrt\r\nimport sys\r\ninput = sys.stdin.buffer.readline\r\n\r\ndef isPrime(num):\r\n for i in range(2, isqrt(num)+1):\r\n if not num % i:\r\n return False\r\n return True\r\n\r\nn = int(input())\r\nif isPrime(n):\r\n print(1);exit()\r\nif n%2 == 0 or isPrime(n-2):\r\n print(2);exit()\r\nif n&1:\r\n print(3);exit()\r\n", "import random\n\n\ndef probablyPrime(n):\n if n % 2 == 0:\n return False\n s = 0\n d = n - 1\n while True:\n quotient, remainder = divmod(d, 2)\n if remainder == 1:\n break\n s += 1\n d = quotient\n\n def test(r):\n if pow(r, d, n) == 1:\n return False\n for i in range(s):\n if pow(r, 2**i * d, n) == n - 1:\n return False\n return True\n\n for i in range(8):\n r = random.randrange(2, n)\n if test(r):\n return False\n return True\n\n\ni = int(input())\n\nif i == 2:\n\tprint(1)\nelif probablyPrime(i):\n\tprint(1)\nelif i % 2 == 0 or probablyPrime(i - 2):\n\tprint(2)\nelse:\n\tprint(3)", "# // #include <bits/stdc++.h>\r\n# // using namespace std; \r\n# // bool check(int n){\r\n# // for(int i=2;i<=n/2;i++){\r\n# // if(n%i==0)return 0;\r\n# // }\r\n# // return 1;\r\n# // }\r\n# // int main(){\r\n# // long n;\r\n# // cin>>n;\r\n# // if(check(n))cout<<1;\r\n# // else if(n%2==0)cout<<2;\r\n# // else if(check(n-2))cout<<2;\r\n# // else cout<<3;\r\n# // }\r\nimport math\r\nn, = [int(x) for x in input().split()]\r\ndef check(n):\r\n \r\n for i in range(2,int(math.sqrt(n))+1):\r\n if n%i==0:\r\n return 0\r\n return 1\r\nif check(n)==1:\r\n print(1)\r\nelif n%2==0:\r\n print(2)\r\nelif check(n-2)==1:\r\n print(2)\r\nelse: print(3)\r\n ", "def check_witness(a, n, d, s):\n x = pow(a, d, n)\n if x == 1 or x == n-1:\n return True\n for r in range(s-1):\n x = pow(x, 2, n)\n if x == n-1:\n return True\n return False\n\n\n\ndef miller_rabin(n):\n wittnesses = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37]\n if n < 38:\n return n in wittnesses\n\n d = n - 1\n s = 0\n while d % 2 == 0:\n s += 1\n d //= 2\n\n for a in wittnesses:\n if not check_witness(a, n, d, s):\n return False\n return True\n\n\nn = int(input())\n\nif miller_rabin(n):\n print(1)\nelif n%2==0:\n print(2)\nelif miller_rabin(n-2):\n print(2)\nelse:\n print(3)\n", "import math\n\nn=int(input())\n \nk = int(math.sqrt(n))\nflag = False\n\nfor i in range(2, k+1):\n if n % i == 0:\n flag = True\n break\n\nif not flag:\n print(1)\nelse:\n if n % 2 == 0:\n print(2)\n else:\n t = n - 2\n kk = int(math.sqrt(t))\n flag = False\n for i in range(2, kk+1):\n if t % i == 0:\n flag = True\n break\n if flag:\n print(3)\n else:\n print(2)\n\t\t \t \t \t \t \t\t \t \t", "n = int(input())\r\n\r\ndef isPrime(n):\r\n if n == 1:\r\n return False\r\n if n == 2:\r\n return True\r\n if n % 2 == 0:\r\n return False\r\n d = 3\r\n while n % d != 0 and d * d <= n:\r\n d += 2\r\n return d * d > n\r\n\r\nif isPrime(n):\r\n print(1)\r\nelif n & 1 == 0 or isPrime(n - 2):\r\n print(2)\r\nelse:\r\n print(3)", "import math\r\n\r\n\r\ndef is_prime(n):\r\n\tif n == 2: return True\r\n\tfor i in range(2, int(math.sqrt(n)) + 2):\r\n\t\tif n % i == 0:\r\n\t\t\treturn False\r\n\treturn True\r\n\r\ndef tax(n):\r\n\tif is_prime(n): return 1\r\n\tif n % 2 == 0: return 2\r\n\tif is_prime(n - 2): return 2\r\n\treturn 3\r\n\r\nprint(tax(int(input())))\r\n", "def isprime(n):\r\n return all(n % i for i in range(2, int(n ** .5) + 1))\r\nn = int(input())\r\nif n == 2:\r\n print(1)\r\nelif n & 1 == 0:\r\n print(2)\r\nelif isprime(n):\r\n print(1)\r\nelif isprime(n - 2):\r\n print(2)\r\nelse:\r\n print(3)", "import sys\r\ninput = sys.stdin.readline\r\n\r\n\r\ndef f(x):\r\n for i in range(2, int(x**0.5)+1):\r\n if x % i == 0:\r\n return 1\r\n return 0\r\n\r\n\r\nn = int(input())\r\nif n == 2:\r\n print(1)\r\nelif n % 2 == 0:\r\n print(2)\r\nelse:\r\n if f(n) == 0:\r\n print(1)\r\n elif f(n-2) == 0:\r\n print(2)\r\n else:\r\n print(3)", "n=int(input())\r\nif (n%2==0) and (2 != n):\r\n print(2)\r\n exit(0)\r\nm=0\r\nfor i in range(2,n,+1):\r\n #print(i,n)\r\n if i*i>n:\r\n break\r\n if n%i==0:\r\n m=i\r\n break\r\n\r\n\r\nif m==0:\r\n print(1)\r\n exit(0)\r\nn-=2\r\nm=0\r\nfor i in range(2,n,+1):\r\n if i*i>n:\r\n break\r\n if n%i==0:\r\n m=i\r\n break\r\n \r\nif m>0:\r\n print(3)\r\nelse :\r\n print(2)\r\n \r\n", "def prime(x):\r\n\ti = 2\r\n\twhile i * i <= x:\r\n\t\tif x % i == 0:\r\n\t\t\treturn False\r\n\t\ti += 1\r\n\treturn True\r\nn = int(input())\r\nif prime(n):\r\n print(1)\r\nelif n % 2 == 0 or prime(n - 2):\r\n print(2)\r\nelse: \r\n print(3)", "from math import isqrt\r\ndef isPrime(num):\r\n for i in range(2, isqrt(num)+1):\r\n if not num%i:\r\n return False\r\n return True\r\n\r\ndef solve():\r\n n = int(input())\r\n if isPrime(n):\r\n print(1)\r\n return\r\n if not n&1 or isPrime(n-2):\r\n print(2)\r\n return\r\n if n&1:\r\n print(3)\r\n return\r\n\r\n\r\nsolve()", "import math\r\ndef isPrime(x):\r\n for i in range(2,int(math.sqrt(x)+1)):\r\n if x%i==0:\r\n return 0\r\n return 1\r\n\r\nn = int(input())\r\nif isPrime(n):\r\n print(1)\r\nelif n%2==0 & n!=2:\r\n print(2)\r\nelse:\r\n for i in range(2,math.ceil(math.sqrt(n))+1):\r\n if isPrime(i) & isPrime(n-i):\r\n print(2)\r\n break\r\n else:\r\n print(3)\r\n", "def isPrime(n):\r\n i=2\r\n while i*i <= n:\r\n if n%i==0:\r\n return False\r\n i+=1\r\n return True\r\nn= int(input())\r\nif isPrime(n):\r\n print(1)\r\nelif n%2==0 or isPrime(n-2):\r\n print(2)\r\nelif n%2==1:\r\n print(3)", "def prime(m):\r\n i=2\r\n while i*i<=m:\r\n if m%i==0:\r\n return 0\r\n i+=1\r\n return 1\r\nn=int(input())\r\nif prime(n):print(1)\r\nelif n%2==0 or prime(n-2):print(2)\r\nelse:print(3)\r\n", "from sys import stdin,stdout\r\ndef prime(n):\r\n\ti=2\r\n\twhile i*i<=n:\r\n\t\tif n%i==0:\r\n\t\t\treturn False\r\n\t\ti+=1\r\n\treturn True\r\nn=int(input())\r\nif prime(n)==True:\r\n\tprint(\"1\")\r\n\texit()\r\nif n==2:\r\n\tprint(\"2\")\r\n\texit()\r\nif n==4:\r\n\tprint('2')\r\n\texit()\r\nif n%2==0:\r\n\tprint('2')\r\nelse :\r\n\tif prime(n-2)==True:\r\n\t\tprint('2')\r\n\telse:\r\n\t\tprint('3')\r\n\t ", "from math import sqrt\r\ndef isPrime(x):\r\n for v in range(2,int(sqrt(x))+1):\r\n if x%v==0:return False\r\n return True\r\nn=int(input())\r\nf=1\r\nfor el in range(2,int(sqrt(n))+1):\r\n if n%el==0:\r\n f=n//el\r\nif f==1:\r\n print(1)\r\nelse :\r\n if n%2==0:\r\n print(2)\r\n elif isPrime(n-2):\r\n print(2)\r\n else :\r\n print(3)\r\n ", "t=int(int(input()))\r\ny=int(t**0.5)\r\ndef isprime(x):\r\n for i in range(2,y+2):\r\n if x%i ==0:\r\n return False\r\n return True\r\nif t==2:\r\n print(1)\r\nelif t%2==0:\r\n print(2)\r\nelse:\r\n if isprime(t):\r\n print(1)\r\n elif isprime(t-2):\r\n print(2)\r\n else:\r\n print(3)" ]

[ "def readGen(trans):\r\n\twhile 1:\r\n\t\tfor x in input().split():\r\n\t\t\tyield(trans(x))\r\n\t\r\nreadint=readGen(int)\r\n\r\n[N,x,M,y]=(next(readint) for i in range(4))\r\n\r\nd=abs(y-x)\r\n\r\ndef interval(a,b): return range(a,b+1)\r\n\r\ndef case1(N,M,d): # d>=N\r\n\tans=0\r\n\tfor r in interval(1, min(M,d-N)):\r\n\t\tans+=1\r\n\tif (M<=d-N):\r\n\t\treturn ans\r\n\tfor r in interval(d-N+1, min(M,d)):\r\n\t\tans+=2*(N+r-d)\r\n\tif (M<=d):\r\n\t\treturn ans\r\n\tfor r in interval(d+1,min(M,d+N)):\r\n\t\tans+=2*(d+N-r+1)\r\n\tif (M<=d+N):\r\n\t\treturn ans\r\n\tfor r in interval(d+N+1,M):\r\n\t\tans+=1\r\n\treturn ans\r\n\r\ndef partA(N,M,d):\r\n\tans=0\r\n\tfor r in interval(1,min(M,d)):\r\n\t\tans+=2*r-1\r\n\tif (M<d+1):\r\n\t\treturn ans\r\n\tfor r in interval(d+1,min(M,2*d)):\r\n\t\tans+=2*(2*d-r)+1\r\n\treturn ans\r\n\r\ndef partB(N,M,d):\r\n\tans=0\r\n\tbound1=min(2*d,N-d)\r\n\tfor r in interval(1,min(M,bound1)):\r\n\t\tans+=2*(r-1)+1\r\n\tif (M<=bound1):\r\n\t\treturn ans\r\n\tif (2*d<=N-d):\r\n\t\tfor r in interval(bound1+1,min(M,N-d)):\r\n\t\t\tans+=4*d\r\n\t\tif (M<=N-d):\r\n\t\t\treturn ans\r\n\tif (2*d>N-d):\r\n\t\tfor r in interval(bound1+1,min(M,2*d)):\r\n\t\t\tans+=2*(N-d)+1\r\n\t\tif (M<=2*d):\r\n\t\t\treturn ans\r\n\tbound2=max(2*d,N-d)\r\n\tfor r in interval(bound2+1,min(M,d+N)):\r\n\t\tans+=2*(d+N-r)+2\r\n\tif (M<=d+N):\r\n\t\treturn ans\r\n\tfor r in interval(d+N+1,M):\r\n\t\tans+=1\r\n\treturn ans\r\n\t\r\ndef case2(N,M,d): # d<N\r\n\treturn partA(N,M,d)+partB(N,M,d)\r\n\r\ndef remain(N,M,d):\r\n\tif (M>=d+N):\r\n\t\treturn 1\r\n\tif (M>d):\r\n\t\treturn d+N-M+1\r\n\tif (M<=d):\r\n\t\treturn N+1\r\n\t\r\ndef calc(N,M,d):\r\n\tif (N<=d): return remain(N,M,d)+case1(N,M,d)\r\n\telse: return remain(N,M,d)+case2(N,M,d)\r\n\r\nprint(calc(N,M,d))\r\n" ]

[ "def f(s):\r\n return int(s)-1\r\n\r\nn = int(input())\r\nmod = 10**9+7\r\narr = list(map(f,input().split()))\r\ndp=[0]*(n+1)\r\nfor i in range(n):\r\n dp[i+1] = dp[i]+2+dp[i]-dp[arr[i]]\r\n dp[i+1]%=mod\r\nprint(dp[-1])\r\n", "n = int(input())\r\np = [0]+list(map(int,input().split()))\r\ndp= [0 for _ in range(n+2)]\r\ndp[1] = 0\r\nMOD = int(1e9 + 7)\r\nfor i in range(2 , n + 2):\r\n dp[i] = 2 + 2*dp[i - 1] - dp[p[i-1]]\r\n dp[i] %= MOD\r\nprint(dp[n + 1])\r\n", "#! python3\r\nnumRooms = int(input())\r\nlinks = [0]+[int(x) for x in input().split()]\r\nportalPaths = [0]*(numRooms+2)\r\nfor index in range(1, numRooms + 1):\r\n\tportalPaths[index + 1] = (2*portalPaths[index] - portalPaths[links[index]] + 2) % 1000000007\r\nprint(portalPaths[numRooms+1] % 1000000007)\r\n\r\n# print(numRooms)\r\n# print(links)\r\n\r\n\r\n# This implementation is too slow\r\n# numRooms = int(input())\r\n# links = [-1]+[int(x) for x in input().split()]\r\n# crosses = [0]+[0]*(numRooms + 1)\r\n# current = 1\r\n# while current <= numRooms:\r\n# \tif crosses[current] % 2 == 0:\r\n# \t\tcrosses[current] += 1\r\n# \t\tprint(current, crosses[current], \"portal\")\r\n# \t\tcurrent = links[current]\r\n# \telse:\r\n# \t\tcrosses[current] += 1\r\n# \t\tprint(current, crosses[current], \"plus 1\")\r\n# \t\tcurrent += 1\r\n\r\n# print(sum(crosses) % 1000000007)", "# https://codeforces.com/contest/408\n\nimport sys\n\ninput = lambda: sys.stdin.readline().rstrip() # faster!\n\nMOD = 10 ** 9 + 7\n\nn = int(input()) # 1 <= n <= 1000\np = list(map(lambda x: int(x) - 1, input().split())) # 0 <= p[i] <= i\n\nf = [-1] * (n + 1)\nf[0], f[1] = 0, 2\nfor i in range(2, n + 1):\n f[i] = f[i - 1] + (f[i - 1] - f[p[i - 1]]) + 2\n f[i] %= MOD\nprint(f[-1])\n", "no_rooms = int(input())\r\nlinks = [None] + [int(x) for x in input().split()]\r\npaths = [0] * (no_rooms + 2) # last is total\r\n\r\nfor i in range(1, no_rooms + 1):\r\n\tpaths[i + 1] = (2 * paths[i] - paths[links[i]] + 2) % 1000000007\r\n\r\nprint(paths[no_rooms + 1] % 1000000007)", "n=int(input())\r\nl=[*map(int,input().split())]\r\na=[0]\r\nfor i in range(1,n+1):a+=[(2+a[i-1]*2-a[l[i-1]-1])%(10**9+7)]\r\nprint(a[-1])", "n = int(input())\r\na = list(map(int, input().split()))\r\ndp = [0 for i in range(n+1)]\r\nfor i in range(n+1):\r\n if i > 0 : dp[i] = (2*dp[i-1]+2-dp[a[i-1]-1])%1000000007\r\nprint((dp[n]+1000000007)%1000000007)", "R = lambda: map(int, input().split())\r\nn = int(input())\r\nmod = 1000000007\r\narr = [x - 1 for x in R()]\r\ndp = [0] * (n + 1)\r\nsdp = [0] * (n + 1)\r\ndp[0] = sdp[0] = 2\r\nfor i in range(1, len(arr)):\r\n dp[i] = (2 + sdp[i - 1] - sdp[arr[i] - 1]) % mod\r\n sdp[i] = (sdp[i - 1] + dp[i]) % mod\r\nprint(sdp[n - 1])", "n = int(input()) + 1\r\nmas = [int(x) for x in input().split()]\r\ndp = [0] * n\r\nmod = 1000000007\r\nfor i in range(1, n):\r\n dp[i] = (sum(dp[mas[i - 1]:i]) + 2) % mod\r\nprint(sum(dp) % mod)", "n = int(input())\r\nP = [0]\r\nP[1:] = map(int, input().split())\r\nMod = 1000000007\r\nf = [0] * (n + 2)\r\nfor i in range(2, n + 2):\r\n f[i] = (2 + 2 * f[i - 1] - f[P[i - 1]]) % Mod\r\nprint(f[n + 1])\r\n", "n = int(input())\r\nA = [int(i) for i in input().split()]\r\n\r\ndp = [[[10**10 for i in range(n+1)] for j in range(2)] for k in range(n+1)]\r\n\r\nimport sys\r\n\r\nsys.setrecursionlimit(10**7)\r\n\r\nfor i in range(n+1):\r\n for j in range(2):\r\n dp[i][j][i] = 1\r\n\r\nMOD = 10**9 + 7\r\n\r\ndef f(i, j, x):\r\n \r\n if dp[i][j][x] != 10**10:\r\n return dp[i][j][x]\r\n if i==x:\r\n return 1\r\n else:\r\n if j==0:\r\n dp[i][j][x] = (1 + f(i+1, 1, x))%MOD\r\n else:\r\n dp[i][j][x] = (1 + (f(A[i]-1, 1, i))%MOD + (f(i+1, 1, x))%MOD)%MOD\r\n\r\n dp[i][j][x] %= MOD\r\n\r\n return dp[i][j][x]\r\n\r\nprint((f(0, 1, n) - 1)%MOD)\r\n\r\n\r\n", "n = int(input())\r\n\r\nmod = 10**9 + 7\r\n\r\na = [int(_) - 1 for _ in input().split()]\r\nb = [0]\r\n\r\nfor i in range(1, n + 1):\r\n\tv = 2 * b[i - 1] + 2 - b[a[i - 1]]\r\n\tb.append(v % mod)\r\nprint(b[-1])\r\n", "#!/usr/bin/env python3\n# -*- coding: utf-8 -*-\n\nn = int(input())\n\na_list = list(map(int, input().split()))\n\ntime = [-1] * (n+1)\n#marks = [0] * (n+1)\n\ncnt = 0;\npos = 0;\nwhile 1:\n if pos == n: break;\n\n if time[pos] == -1:\n time[pos] = cnt\n cnt += 1\n back_pos = a_list[pos]-1\n cnt += cnt - time[back_pos]\n pos += 1\n else:\n pos += 1\n cnt += 1\n #print(\"pos,cnt = \",pos,cnt, \". time=\", time)\n\n\nprint(cnt % 1000000007)\n\n", "mod=1000000007\r\nn=int(input())\r\nx=list(map(int,input().split()))\r\ndp=[0]*(n+1)\r\nfor i in range(n):\r\n dp[i+1]=(2*dp[i]+2-dp[x[i]-1])%mod\r\nprint(dp[n])", "#t=int(input())\r\nt=1\r\nmod=10**9+7\r\nfor _ in range(t):\r\n n=int(input())\r\n l=list(map(int,input().split()))\r\n dp= [0 for i in range(n+1)]\r\n dp[0]=2\r\n parity=[0]*(n+1)\r\n parity[0]=0\r\n for i in range(1,n):\r\n \r\n for j in range(l[i]-1,i):\r\n dp[i]=(dp[i]%mod+dp[j]%mod)%mod\r\n \r\n dp[i]=(dp[i]%mod+2)%mod\r\n suma=0\r\n for i in range(n):\r\n suma=(suma%mod+dp[i]%mod)%mod\r\n print(suma) ", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\na = list(map(int,input().split()))\r\nd = [0]*(n+1)\r\nMOD = int(1e9+7)\r\n\r\nfor i in range(0,n):\r\n d[i+1] = ( d[i] + (d[i] - d[a[i]-1]) + 2 + MOD)%MOD\r\n \r\nprint(d[n]);", "n=int(input())\r\nmod=10**(9)+7\r\na=[0]+list(map(int,input().split()))\r\ns=[0]*(n+1)\r\ndp=[0]*(n+1)\r\nfor i in range(1,n+1):\r\n j = a[i]\r\n dp[i]=((s[i-1]%mod-s[j-1]%mod)%mod+2%mod)%mod\r\n s[i]= (s[i-1]%mod + dp[i]%mod)%mod\r\nprint(s[n])", "n = int(input())\r\npt = [0] + list(map(int, input().split(\" \")))\r\ndp = [0 for i in range(1005)]\r\nMOD = int(1e9+7)\r\nfor i in range(1, n+1):\r\n dp[i+1] = (2*dp[i] + 2 - dp[pt[i]])%MOD\r\nprint(dp[n+1]%MOD)\r\n", "# #include <bits/stdc++.h>\r\n#\r\n# using namespace std;\r\n#\r\n# const int MOD = 1e9 + 7;\r\n#\r\n# signed main() {\r\n# int n;\r\n# cin >> n;\r\n# int p[n];\r\n# for (int i = 0; i < n; ++i) cin >> p[i];\r\n# unsigned long long dp[n + 1];\r\n# for (int i = 0; i < n + 1; ++i) dp[i] = 0;\r\n# dp[0] = 0;\r\n# for (int i = 1; i <= n; ++i) {\r\n# dp[i] = (2 * dp[i - 1] % MOD + 2 - dp[p[i - 1] - 1] % MOD) % MOD;\r\n# }\r\n# cout << dp[n] % MOD;\r\n# return 0;\r\n# }\r\n\r\nMOD = 10 ** 9 + 7\r\n\r\n\r\ndef solve():\r\n n = int(input())\r\n p = list(map(int, input().split()))\r\n dp = [0] * (n + 1)\r\n dp[0] = 0\r\n for i in range(1, n + 1):\r\n dp[i] = (2 * dp[i - 1] + 2 - dp[p[i - 1] - 1]) % MOD\r\n print(dp[n] % MOD)\r\n\r\n\r\ndef main():\r\n solve()\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n = int(input())\r\nA = [int(i) for i in input().split()]\r\n\r\ndp = [[10**10 for i in range(n+1)] for k in range(n+1)]\r\n\r\nimport sys\r\n\r\nsys.setrecursionlimit(10**7)\r\n\r\nfor i in range(n+1):\r\n dp[i][i] = 1\r\n\r\nMOD = 10**9 + 7\r\n\r\ndef f(i, x):\r\n if dp[i][x] != 10**10:\r\n return dp[i][x]\r\n dp[i][x] = (1 + (f(A[i]-1, i))%MOD + (f(i+1, x))%MOD)%MOD\r\n return dp[i][x]\r\n\r\nprint((f(0, n) - 1)%MOD)\r\n\r\n\r\n", "n = int(input())\np = list(map(int, input().split()))\nq = [0]*(n+1)\nq[0] = 0\nq[1] = 2\nans = 2\nmod = 10**9 + 7\nfor i in range(1,n):\n\tans = (ans + q[i] - q[p[i]-1] + 2)%mod\n\tq[i+1] = ans\nprint(ans)\n \t\t \t\t\t \t\t \t\t\t\t\t\t\t \t \t", "n = int(input())\n\np = list(map(int, input().strip().split()))\np = [0] + p\nval = [0 for _ in range(1, n+2)]\ncurr, moves = 1, 0\n\nfor i in range(1, n+1):\n if p[i] == i:\n val[i] = 2\n else:\n cnt = 0\n for j in range(p[i], i):\n cnt += val[j]\n val[i] = cnt + 2\n\nmod = 10**9 + 7\nprint(sum(val) % mod)\n\t \t \t\t \t \t\t\t\t\t\t\t \t\t \t", "import sys\r\nMOD = 10 ** 9 + 7\r\nN = int(input())\r\nbs = [int(b) - 1 for b in input().split()]\r\nfs = [0]\r\nfor i in range(1,N+1):\r\n f = 2 * fs[i - 1] + 2 - fs[bs[i - 1]]\r\n fs.append(f % MOD)\r\nprint(fs[-1])", "import sys\r\ninput = lambda: sys.stdin.readline().rstrip()\r\n\r\nMOD=1000000007\r\nN = int(input())\r\nA = list(map(int, input().split()))\r\nans = [1]*N\r\nfor i in range(N-1,-1,-1):\r\n a = A[i]\r\n for j in range(a-1,i):\r\n ans[j]+=ans[i]\r\n ans[j]%=MOD\r\nprint(2*sum(ans)%MOD)\r\n\r\n\r\n", "import sys\r\ninput=sys.stdin.readline\r\nn=int(input())\r\nz=list(map(int,input().split()))\r\n\r\npri=10**9+7\r\n\r\n#1 1 1\r\ndp=[0 for i in range(len(z))]\r\nsu=[0 for i in range(len(z))]\r\ndp[0]=1\r\n#dp stores the cost of entering second time into a room\r\nfor i in range(len(z)):\r\n if(z[i]==i+1):\r\n if(i==0):\r\n su[i]=2\r\n else:\r\n su[i]=su[i-1]+2\r\n dp[i]=2\r\n \r\n else:\r\n total=0\r\n for j in range(z[i]-1,i):\r\n total+=dp[j]\r\n \r\n \r\n su[i]=su[i-1]+total+2\r\n dp[i]=total+2\r\n dp[i]%=pri\r\n su[i]%=pri\r\n \r\nprint(su[-1])\r\n", "input()\r\ndp = [0] \r\n[dp.append((2 * dp[-1] + 2 - dp[u - 1]) % 1000000007) for u in map(int, input().split())]\r\nprint (dp[-1])", "n=int(input())\r\nm= 1000000007\r\np=list(map(int,input().split()))\r\narr=[0]*(n+1)\r\nfor i in range(n):\r\n arr[i+1]=(2*arr[i]%m+2-arr[p[i]-1]%m)%m\r\nprint(arr[-1])", "n = int(input())\ndp = [0] * (n + 1)\ns = list(map(int, input().split()))\ndp[0], dp[1] = 0, 2\nfor i in range(1, n):\n dp[i + 1] = 2 + dp[i] - dp[s[i] - 1] + dp[i]\nprint(dp[n] % 1000000007)\n\n\t \t\t \t\t \t\t \t \t \t \t \t", "n=int(input())\r\nl=list(map(int,input().split()))\r\nL=[[0,1]]\r\nfor i in range(1,n) :\r\n v=L[i-1][1]+1\r\n L.append([v,0])\r\n y=L[l[i]-1][0]\r\n L[i][1]=v+v-y+1\r\n \r\nprint((L[-1][1]+1)%1000000007)\r\n", "import sys\r\nsys.setrecursionlimit(1000000)\r\n\r\nmod = 10 ** 9 + 7\r\n\r\n\r\ndef solve(idx, prev):\r\n if dp[idx][prev] != 10 ** 10:\r\n return dp[idx][prev]\r\n dp[idx][prev] = ((1 + solve(a[idx], idx)) % mod + (solve(idx + 1, prev)) % mod) % mod\r\n return dp[idx][prev]\r\n\r\nn = int(input())\r\na = [0]\r\na += [int(x) for x in input().split()]\r\n\r\ndp = [[10 ** 10 for i in range(n + 2)] for j in range(n + 2)]\r\nfor i in range(n + 2):\r\n dp[i][i] = 1\r\n \r\nans = solve(1, n + 1)\r\n\r\nprint(ans - 1)\r\n", "from __future__ import division, print_function\r\nimport sys\r\nif sys.version_info[0] < 3:\r\n from __builtin__ import xrange as range\r\n from future_builtins import ascii, filter, hex, map, oct, zip\r\nimport os, sys, bisect, copy\r\nfrom collections import defaultdict, Counter, deque\r\n#from functools import lru_cache #use @lru_cache(None)\r\nif os.path.exists('in.txt'): sys.stdin=open('in.txt','r')\r\nif os.path.exists('out.txt'): sys.stdout=open('out.txt', 'w')\r\n#\r\ndef input(): return sys.stdin.readline()\r\ndef mapi(arg=0): return map(int if arg==0 else str,input().split())\r\n#------------------------------------------------------------------\r\n\r\nn = int(input())\r\na = list(mapi())\r\nfor i in range(n):\r\n a[i]-=1\r\nmod = int(1e9+7)\r\n\r\ndp = [2]*(n)\r\nfor i in range(n):\r\n for j in range(a[i],i):\r\n dp[i]+=dp[j]%mod\r\n dp[i]%=mod\r\nprint(sum(dp)%mod)\r\n\r\n", "import sys\r\nfrom math import gcd\r\ninput = sys.stdin.readline \r\n\r\nn = int(input()) \r\na = list(map(int, input().split())) \r\n\r\nM = 10 ** 9 + 7\r\ndp = [0] * (n + 1) \r\nfor i in range(1, n + 1):\r\n dp[i] = (2 * dp[i - 1] + 2 - dp[a[i - 1] - 1] + M) % M\r\nprint(dp[-1])", "Mod=1000000007\nn=int(input())\np=list( map(int, input().split()) )\ns=[0,2]\nfor i in range(2,n+1):\n s.append( ( 2*s[i-1]-s[p[i-1]-1] + 2 + Mod ) % Mod )\nprint(s[n])\n\n\n\n\n# Made By Mostafa_Khaled", "n = int(input())\np = list(map(int, input().split()))\nm = int(1e9 + 7)\n\ndp = [0] * (n + 1)\ndp[0] = 0\nfor i in range(1, n + 1):\n dp[i] = (2 * dp[i - 1] - dp[p[i - 1] - 1] + 2) % m\n\nprint(dp[n])\n", "n = int(input())\r\nls = list(map(int,input().split()))\r\nls1 = list([0]*n)\r\nsum = 2\r\nls1[0] = 2 \r\nmod = 1000000007\r\nfor i in range(1,n):\r\n ls1[i] = 2\r\n k = ls[i]\r\n k -= 1\r\n for j in range(k,i):\r\n ls1[i] += ls1[j]\r\n ls1[i] %= mod\r\n sum += ls1[i]\r\n sum %= mod\r\n # print(ls1[i])\r\nprint(sum)", "#!/usr/bin/env python3\n\nn = int(input())\njmp = list(map(lambda x: x - 1, map(int, input().split())))\n\ncache = { }\n\ndef DP(i,j):\n if (i,j) not in cache:\n if i == j:\n cache[i,j] = 0\n elif i + 1 == j:\n cache[i,j] = DP(jmp[i], i) + 2\n else:\n cache[i,j] = sum(DP(k, k+1) for k in range(i,j))\n\n return cache[i,j]\n\nprint(DP(0, n) % (10**9 + 7))\n", "n = int(input())\r\np = [0] + list(map(int, input().split()))\r\nmod = 10 ** 9 + 7\r\ndp = [0] * (n + 2)\r\nfor i in range(2, n + 2):\r\n dp[i] = (2 * dp[i - 1] + 2 - dp[p[i - 1]]) % mod\r\nprint(dp[n + 1])\r\n", "n=int(input())\r\np=list(map(int,input().split()))\r\nmod=10**9+7\r\ndp=[0]*(n+1)\r\ncum_dp=[0]*(n+1)\r\nfor i in range(n):\r\n dp[i+1]=(1+cum_dp[i]-cum_dp[p[i]-1])%mod\r\n cum_dp[i+1]=(cum_dp[i]+dp[i+1]+1)%mod\r\nprint(cum_dp[n])", "'''input\n4\n1 1 2 3\n'''\nfrom sys import stdin, stdout\nimport sys\n\n\nsys.setrecursionlimit(15000)\n\n\n# main starts\nn = int(stdin.readline().strip())\narr = list(map(int, stdin.readline().split()))\ndp = [-1] * (n + 1)\ndp[1] = 2\nmod = 10 ** 9 + 7\nfor i in range(2, n + 1):\n\tdp[i] = (sum(dp[arr[i - 1] : i]) + 2) % mod\nprint(sum(dp[1:]) % (10 ** 9 + 7))\n", "#\n# Joseph Matsushita\n# Problem V\n#\n\nn = int(input())\n\nrooms = list(map(int, input().split()))\nsteps = list()\nsteps.append(2) #first room always takes 2 steps to get out of\n\nfor i in range(1, n):\n if(rooms[i]-1 == i):\n steps.append(steps[i-1]+2)\n elif(rooms[i] == 1):\n steps.append(steps[i-1] * 2 + 2)\n else:\n steps.append(steps[i-1] * 2 - steps[rooms[i]-2] + 2)\n\nprint(steps[n-1] % 1000000007)\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\ndp, ans, mod = [2] * n, 0, 1000000007\r\nfor i in range(n):\r\n for j in range(a[i] - 1, i):\r\n dp[i] = (dp[i] + dp[j]) % mod\r\n ans = (ans + dp[i]) % mod\r\nprint(ans)", "MOD = 10 ** 9 + 7\r\n \r\n \r\ndef solve():\r\n n = int(input())\r\n p = list(map(int, input().split()))\r\n dp = [0] * (n + 1)\r\n dp[0] = 0\r\n for i in range(1, n + 1):\r\n dp[i] = (2 * dp[i - 1] + 2 - dp[p[i - 1] - 1]) % MOD\r\n print(dp[n] % MOD)\r\n \r\n \r\ndef main():\r\n solve()\r\n \r\n \r\nif __name__ == \"__main__\":\r\n main()", "n=int(input())\r\np=list(map(int,input().split()))\r\ndp=[0]*(n+1)\r\ndp[1]=2\r\nfor i in range(2,n+1):\r\n\tc=0\r\n\tfor j in range(p[i-1],i):\r\n\t\tc+=dp[j]\r\n\tdp[i]=c+2\r\nprint(sum(dp)%(10**9+7))", " ###### ### ####### ####### ## # ##### ### ##### \r\n # # # # # # # # # # # # # ### \r\n # # # # # # # # # # # # # ### \r\n ###### ######### # # # # # # ######### # \r\n ###### ######### # # # # # # ######### # \r\n # # # # # # # # # # #### # # # \r\n # # # # # # # ## # # # # # \r\n ###### # # ####### ####### # # ##### # # # # \r\n \r\nfrom __future__ import print_function # for PyPy2\r\n# from itertools import permutations\r\n# from functools import cmp_to_key # for adding custom comparator\r\n# from fractions import Fraction\r\nfrom collections import *\r\nfrom sys import stdin\r\n# from bisect import *\r\nfrom heapq import *\r\nfrom math import *\r\n \r\ng = lambda : stdin.readline().strip()\r\ngl = lambda : g().split()\r\ngil = lambda : [int(var) for var in gl()]\r\ngfl = lambda : [float(var) for var in gl()]\r\ngcl = lambda : list(g())\r\ngbs = lambda : [int(var) for var in g()]\r\nrr = lambda x : reversed(range(x)) \r\nmod = int(1e9)+7\r\ninf = float(\"inf\")\r\n\r\nn, = gil()\r\nprev = [0] + gil()\r\ndp = [0]*(n+1)\r\ndp[1] = 2\r\nans = 2\r\n\r\nfor i in range(2, n+1):\r\n dp[i] = 2\r\n for j in range(prev[i], i):\r\n dp[i] += dp[j]\r\n if dp[i] >= mod:dp[i]%mod\r\n ans += dp[i]\r\n if ans >= mod:ans %= mod\r\n\r\nprint(ans)", "n,a= int(input()),list(map(int,input().split()))\nf,m= [0]*(n+1),10**9+7\nfor i in range(n):\n\tif a[i]==i+1:\n\t\tf[i+1]=f[i]+2\n\telse:\n\t\tf[i+1]=(2+f[i]*2-f[a[i]-1])%m\nprint(f[n]%m)\n", "mod = 10**9+7\nn = int(input())\na = list(map(int,input().split()))\nif n==1:\n\tprint (2)\n\texit()\ndp = [0 for i in range(n)]\ndp[1] = 2\nfor i in range(2,n):\n\tdp[i] = (2*dp[i-1]+2-dp[a[i-1]-1])%mod\nans = (2*dp[-1]+2-dp[a[-1]-1])%mod\n# print (dp)\nprint (ans)\n\n", "inf = 0x3F3F3F3F\r\nmaxn = 10 ** 3 + 10\r\nmod = 10 ** 9 + 7\r\ndp = [0] * maxn\r\n\r\nn = int(input())\r\np = [0] + [int(x) for x in input().split()]\r\nfor i in range(1, n + 1):\r\n dp[i + 1] = (2 * dp[i] - dp[p[i]] + 2 + mod) % mod\r\nprint((dp[n + 1] + mod) % mod)", "n=int(input())\r\np=list(map(int,input().split()))\r\nv=[]\r\nfor i in range(0,n+1):\r\n v.insert(i,0)\r\nv[0]=0\r\nv[1]=2\r\nfor i in range(2,n+1):\r\n v[i]=v[i-1]+1\r\n v[i]=2*v[i]-v[p[i-1]-1]\r\nprint((v[n]%1000000007))\r\n\r\n \r\n", "# Author : nitish420 --------------------------------------------------------------------\r\n\r\nmod=10**9+7\r\n\r\nn=int(input())\r\np=[0]+list(map(int,input().split()))\r\n\r\ndp=[0]*(n+1)\r\n\r\nans=0\r\n\r\nfor i in range(1,n+1):\r\n\tans+=(ans-dp[p[i]-1]+1+mod)%mod\r\n\tdp[i]=ans\r\n\r\nprint((ans<<1)%mod)", "n = int(input())\r\np = list(map(int, input().split()))\r\nq = [0]*(n+1)\r\nq[0] = 0\r\nq[1] = 2\r\nans = 2\r\nmod = 10**9 + 7\r\nfor i in range(1,n):\r\n\tans = (ans + q[i] - q[p[i]-1] + 2)%mod\r\n\tq[i+1] = ans\r\nprint(ans)", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\nw = [0] + list(map(int, input().split()))\r\nd = [0] * (n+1)\r\nc = 0\r\nM = 10**9 + 7\r\nx = 1\r\nwhile x != n+1:\r\n a, b = 1, x\r\n while w[x] > x:\r\n a += 1\r\n x = w[x]\r\n y = sum(d[w[x]:b+1]) + a + 1\r\n d[b] = y\r\n c += y\r\n x = b+1\r\nprint(c%M)\r\n\r\n", "n = int(input())\nP = list(map(int, input().split()))\ndp = [0] * (n + 2)\ndp[1] = 0\nM = 10 ** 9 + 7\nfor i in range(2, n + 2):\n dp[i] = 2 * dp[i - 1] + 2 - dp[P[i - 2]]\n dp[i] %= M\nprint(dp[-1])", "import sys\nMOD = 10**9+7\nN = int(sys.stdin.readline())\nbs = [int(b)-1 for b in sys.stdin.readline().split()]\nfs = [0]\nfor i in range(1,N+1):\n f = 2*fs[i-1] + 2 - fs[bs[i-1]]\n fs.append(f % MOD)\nprint(fs[-1])\n", "n=int(input())\r\np=list(map(int,input().split()))\r\ndp=[0]*(n+1)\r\nw=10**9+7\r\nj=1\r\nwhile(j<=n):\r\n dp[j]=(2*(1+dp[j-1])-dp[p[j-1]-1])%w\r\n j+=1\r\nprint(dp[n])" ]

[ "import io, os, sys\r\n\r\nfrom heapq import heappush, heappop\r\nfrom operator import itemgetter\r\n\r\n\r\nclass UnionSet:\r\n def __init__(self, n: int):\r\n self.parent = [*range(n)]\r\n self.rank = [1] * n\r\n self.is_circle = [False] * n\r\n\r\n def __len__(self):\r\n return sum([x == self.parent[x] for x in range(len(self.parent))])\r\n\r\n def find(self, x):\r\n while x != self.parent[x]:\r\n self.parent[x] = self.parent[self.parent[x]]\r\n x = self.parent[x]\r\n return x\r\n\r\n def check(self, x: int, y: int) -> bool:\r\n return self.find(x) == self.find(y)\r\n\r\n def check_circle(self, x: int) -> bool:\r\n return self.is_circle[self.find(x)]\r\n\r\n def union(self, x, y):\r\n x_0 = self.find(x)\r\n y_0 = self.find(y)\r\n if self.is_circle[x_0] and self.is_circle[y_0]:\r\n return False\r\n\r\n if x_0 != y_0:\r\n if self.rank[x_0] < self.rank[y_0]:\r\n self.parent[x_0] = y_0\r\n elif self.rank[x_0] > self.rank[y_0]:\r\n self.parent[y_0] = x_0\r\n else:\r\n self.rank[x_0] += 1\r\n self.parent[y_0] = x_0\r\n self.is_circle[x_0] = self.is_circle[y_0] = self.is_circle[x_0] or self.is_circle[y_0]\r\n else:\r\n self.is_circle[x_0] = True\r\n\r\n\r\n return True\r\n\r\ndef main():\r\n\r\n n, m = read_int_tuple()\r\n edges = [read_int_tuple() for _ in range(m)]\r\n us = UnionSet(n + 1)\r\n edges.sort(key=itemgetter(2), reverse=True)\r\n\r\n res = 0\r\n for u, v, w in edges:\r\n if us.union(u, v):\r\n res += w\r\n print(res)\r\n\r\n\r\nBUFSIZE = 8192\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\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\nsys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)\r\ninput = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\r\n\r\n# def input(): return stdin.readline().strip()\r\ndef read_int_list(): return list(map(int, input().split()))\r\ndef read_int_tuple(): return tuple(map(int, input().split()))\r\ndef read_int(): return int(input())\r\n\r\n\r\n\r\nif __name__ == '__main__':\r\n main()" ]

[ "n=int(input())\nl=list(map(int,input().split()))\na=[]\nfor q in range(n):\n a.append([l[q],q])\na.sort()\nfor q in range(n//2):\n print(a[q][1]+1,a[n-q-1][1]+1)", "n = int(input())\na = list(map(int, input().split()))\nb = [0]*n\nk = sum(a)/n*2\nfor j in range(len(a)):\n for i in range(j+1, len(a)):\n if a[j]+a[i]==k and b[j]==0 and b[i]==0:\n print(j+1, i+1)\n b[j]=1\n b[i]=1\n break", "n = int(input())\r\n\r\nstring = input().split(' ')\r\nfor i in range(n):\r\n string[i] = int(string[i])\r\n\r\ntarget = int(sum(string)/(n/2))\r\n\r\nresult = []\r\n\r\nfor i in range(n):\r\n if not i in result:\r\n result.append(i)\r\n remaining = target - string[i]\r\n for j in range(n):\r\n if string[j] == remaining:\r\n if not j in result:\r\n result.append(j)\r\n break\r\n\r\nfor i in range(n//2):\r\n stringToPrint = str(result[2*i]+1) + \" \"\r\n stringToPrint += str(result[2*i + 1]+1)\r\n print(stringToPrint)\r\n\r\n\r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\nl=[]\r\nl.extend(a)\r\nl.sort()\r\nfor i in range(n//2):\r\n \r\n m=a.index(l[i])\r\n a[m]=0\r\n \r\n p=a.index(l[n-i-1])\r\n a[p]=0\r\n \r\n print(m+1,p+1)\r\n \r\n", "def swap(seq,i,j):\r\n\ttemp=seq[i]\r\n\tseq[i]=seq[j]\r\n\tseq[j]=temp\r\n\r\ndef argsort(n,seq):\r\n\ti=1\r\n\tindices=[]\r\n\twhile i<=n:\r\n\t\tindices.append(i)\r\n\t\ti+=1\r\n\ti=0\r\n\twhile i<n-1:\r\n\t\tj=i+1\r\n\t\twhile j<n:\r\n\t\t\tif(seq[j]<seq[i]):\r\n\t\t\t\tswap(seq,i,j)\r\n\t\t\t\tswap(indices,i,j)\r\n\t\t\tj+=1\r\n\t\ti+=1\r\n\r\n\treturn indices\r\n\r\ndef Cards(n, seq):\r\n\targSorted= argsort(n,seq)\r\n\ti=1\r\n\tj=n\r\n\twhile(i<=n/2):\r\n\t\tprint(str(argSorted[i-1])+\" \"+str(argSorted[j-1]))\r\n\t\ti+=1\r\n\t\tj-=1\r\n\r\nn = int(input())\r\nseq = [int(x) for x in input().split()]\r\n\r\nCards(n,seq)\r\n", "# 6\r\n# 1 5 7 4 4 3\r\nimport math\r\n\r\nnumber = int(input())\r\narr = list(map(int , input().split()))\r\ninfo = {\r\n \"max\" : {\r\n 'num' : 0 ,\r\n \"rebeat\" : 0 ,\r\n }\r\n}\r\nnumbers = {}\r\ndef comapre(number):\r\n if number == info['max']['num'] :\r\n info['max']['rebeat'] += 1\r\n else :\r\n if info[number] > info['max']['rebeat'] :\r\n info['max']['num'] = number\r\n info['max']['rebeat'] = info[number]\r\nfor i in range(0 , len(arr)) :\r\n operation = {}\r\n if not arr[i] in numbers.keys() :\r\n numbers[arr[i]] = {\r\n 'index' : [] ,\r\n 'rebeat': 0\r\n }\r\n numbers[arr[i]]['rebeat'] += 1\r\n numbers[arr[i]]['index'].append(i)\r\n for j in range(i+1 , len(arr)) :\r\n if f\"[{arr[i]} , {arr[j]}]\" in operation :\r\n continue\r\n operation[f\"[{arr[i]} , {arr[j]}]\"] = 1\r\n x = arr[i] + arr[j]\r\n if not x in info :\r\n info[x] = 0\r\n info[x] += 1\r\n comapre(x)\r\nwhile len(numbers) != 0 :\r\n delete = []\r\n for i in numbers.keys():\r\n if numbers[i]['rebeat'] == 0 :\r\n continue\r\n if numbers[info['max']['num'] - i]['rebeat'] == 0 :\r\n continue\r\n x = numbers[i]['index'][0]\r\n numbers[i]['rebeat'] -= 1\r\n numbers[i]['index'].pop(0)\r\n if numbers[i]['rebeat'] == 0 :\r\n delete.append(i)\r\n y = numbers[info['max']['num'] - i ]['index'][0]\r\n numbers[info['max']['num'] - i]['rebeat'] -= 1\r\n numbers[info['max']['num'] - i]['index'].pop(0)\r\n if numbers[info['max']['num'] - i]['rebeat'] == 0 :\r\n delete.append(info['max']['num'] - i)\r\n print(f'{x+1} {y+1}')\r\n for i in delete :\r\n if i in numbers.keys() :\r\n numbers.pop(i)", "n = int(input())\r\ninfo = list(map(int, input().split()))\r\ninfo = [[info[i], i] for i in range(n)]\r\ninfo.sort()\r\nstart = 0\r\nend = n - 1\r\nwhile start < end:\r\n print(info[start][1] + 1, info[end][1] + 1)\r\n start += 1\r\n end -= 1 ", "import sys\n\ninput=sys.stdin.readline()\nn= int(input)\ninput=sys.stdin.readline()\narr = list(map(int, input.split()))\nar=[]\nfor i in range(n):\n\tar.append([arr[i], i+1])\nar.sort()\nfor i in range(n//2):\n\tprint(ar[i][1], ar[n-1-i][1] )", "# Read the input\nn = int(input())\ncards = list(map(int, input().split()))\n\n# Calculate the target sum\ntarget_sum = sum(cards) // (n // 2)\n\n# Create a list to track visited cards\nvisited = [False] * n\n\n# Find pairs of cards\nfor i in range(n):\n if visited[i]:\n continue\n for j in range(i + 1, n):\n if not visited[j] and cards[i] + cards[j] == target_sum:\n visited[i] = True\n visited[j] = True\n print(i + 1, j + 1)\n break\n", "n = int(input())\r\na = list(map(int, input().split(\" \")))\r\nm = dict()\r\nfor i in range(n):\r\n if(a[i] not in m.keys()):\r\n m[a[i]] = [i + 1]\r\n else:\r\n m[a[i]].append(i + 1)\r\na.sort()\r\nfor i in range(n//2):\r\n print(m[a[i]].pop(),m[a[n - 1 - i]].pop() )\r\n", "n = int(input())\r\narr = [int(i) for i in input().split()]\r\n\r\nfor i in range(n):\r\n arr[i] = (arr[i], i+1)\r\n\r\narr.sort(key=lambda x: x[0])\r\n\r\nfor i in range(n//2):\r\n print(arr[i][1], arr[n-i-1][1])", "def main():\r\n n = int(input())\r\n nums = list(map(int,input().split()))\r\n\r\n cards = []\r\n\r\n for i in range(n):\r\n cards.append((nums[i],i+1))\r\n\r\n cards = sorted(cards,key = lambda x: x[0])\r\n ans = []\r\n #print (cards)\r\n\r\n for i in range(int(n/2)):\r\n ans.append((cards[i][1],cards[n-i-1][1]))\r\n\r\n for i in ans:\r\n print (i[0],i[1])\r\n\r\nmain()\r\n", "n=int(input())\r\na=map(int,input().split())\r\nb=sorted([[x,i+1] for i,x in enumerate(a)])\r\nfor i in range(n//2):print(b[i][1],b[n-i-1][1])", "n = int(input())\r\nl = list(map(int,input().split()))\r\na = []\r\nfor i in range(n):\r\n a.append([l[i] , i+1])\r\na.sort()\r\nfor i in range(n//2):\r\n print(a[i][1] , a[-i - 1][1])\r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\nr=[]\r\nfor i in range(n):\r\n\tr.append([a[i],i+1])\r\nr.sort()\r\nfor i in range(n//2):\r\n\tprint(r[i][1],r[n-i-1][1])\r\n \t", "n = int(input())\r\nl = list(map(int,input().split()))\r\nmin1 = min(l)+max(l)\r\nfor i in range(n):\r\n\tfor j in range(n):\r\n\t\tif l[i]+l[j]==min1 and i!=j:\r\n\t\t\tprint(i+1,j+1)\r\n\t\t\tl[i] = 0\r\n\t\t\tl[j] = 0", "n = int(input())\r\na = list(map(int,input().split()))\r\nsuma = sum(a)\r\ntarget = (suma*2)//n\r\nm = {}\r\nfor i, j in enumerate(a):\r\n\tif j in m:\r\n\t\tm[j].append(i)\r\n\telse:\r\n\t\tm[j] = [i]\r\n\r\na.sort()\r\nfor i in range(len(a)//2):\r\n\tival = m[a[i]].pop()\r\n\tval = m[target-a[i]].pop()\r\n\tprint(ival+1,val+1)", "n = int(input())\r\nseq = [int(j) for j in input().split(\" \")]\r\n\r\nk = sum(seq) / (n//2)\r\nresults = []\r\nfirst_index = 0\r\nfor i in range(n//2):\r\n res = str(first_index+1)\r\n first_number = seq[first_index]\r\n j = first_index+1\r\n while seq[j] != k-first_number:\r\n j += 1\r\n res += \" \" + str(j+1)\r\n (seq[first_index], seq[j]) = (0, 0)\r\n first_index += 1\r\n while seq[first_index] == 0 and i != (n//2)-1:\r\n first_index += 1\r\n results.append(res)\r\n\r\nfor i in results:\r\n print(i)\r\n", "n=int(input())\r\nl=[int(y) for y in input().split()]\r\nx=sum(l)//(n//2)\r\nl_copy=[]\r\nfor i in range(n):\r\n l_copy.append(l[i])\r\nvisited=[]\r\nfor i in range(n):\r\n visited.append(0)\r\nfor i in range(n):\r\n if visited[i]==0:\r\n visited[i]=1 \r\n for j in range(n):\r\n if l_copy[j]==x-l[i] and i!=j and visited[j]==0:\r\n if l[i]<l[j]:\r\n print(i+1,j+1)\r\n else:\r\n print(j+1,i+1)\r\n visited[j]=1 \r\n break\r\n # print(visited)\r\n ", "n = int(input())\r\nlst = list(map(int, input().split()))\r\ndic = {val:[] for val in lst}\r\nfor i, val in enumerate(lst):\r\n dic[val].append(i)\r\nlst.sort()\r\nfor i in range(n//2):\r\n print(dic[lst[i]].pop(0) + 1, dic[lst[n-i-1]].pop(0) + 1, sep=\" \")", "from collections import deque\r\nn = int(input())\r\nli = list(map(int, input().split()))\r\nnew = {}\r\nfor i in range(n):\r\n if li[i] in new:\r\n new[li[i]] += [i+1]\r\n else:\r\n new[li[i]] = [i+1]\r\n\r\nlic = deque(sorted(li))\r\nwhile lic:\r\n print(new[lic.popleft()].pop(), new[lic.pop()].pop())\r\n\r\n", "n = int(input())\r\na = list(map(int,input().split()))\r\nb = sorted(a)\r\nfor i in range(n//2):\r\n p = a.index(b[i])\r\n a[p] = -1\r\n q = a.index(b[n-i-1])\r\n a[q] = -1\r\n print(p+1,q+1)", "n = int (input())\r\na = list (map(int , input().split()))\r\n\r\n\r\nd = {}\r\nfor x in range ( len(a)): \r\n d[x+1] = a[x]\r\nt = []\r\nfor k, v in sorted (d.items(), key = lambda x : x[1]) : \r\n t.append(k)\r\nfor i in range (n//2):\r\n print(t[i], t [-(i+1)]) ", "import math\r\nn = int(input())\r\na = list(map(int,input().split()))\r\nsu = sum(a)/(n//2)\r\n\r\nfor i in range(n):\r\n if a[i]!=-1:\r\n t = a[i]\r\n a[i] = -1\r\n idx = a.index(su-t)\r\n print(\"{0} {1}\".format((i+1),idx+1))\r\n a[idx] = -1\r\n", "n = int(input())\r\n\r\nnums = list(map(int, input().split()))\r\nfor i in range(n):\r\n\tnums[i] = (nums[i], i+1)\r\n\r\nnums.sort()\r\nfor i in range(n//2):\r\n\tprint(nums[i][1] , nums[n-i-1][1])", "n = int(input())\r\nls = list(map(int,input().split()))\r\nsl = ls.copy()\r\nsl.sort()\r\nj=n-1\r\n#print(ls)\r\n#print(sl)\r\nfor i in range(int(n/2)):\r\n if ls.index(sl[i]) != -1:\r\n print(ls.index(sl[i])+1,end=' ')\r\n ls[ls.index(sl[i])] = -1\r\n if ls.index(sl[j]) != -1:\r\n print(ls.index(sl[j])+1)\r\n ls[ls.index(sl[j])] = -1\r\n j=j-1", "from operator import itemgetter\n\n\ndef read_number_line():\n return [int(i) for i in input().split()]\n\n\ndef read_number():\n return int(input())\n\n\nn = read_number()\na = read_number_line()\nindices_values = enumerate(a, start=1)\nindices_values = sorted(indices_values, key=itemgetter(1))\nfor i in range(n // 2):\n print(indices_values[i][0], indices_values[n - 1 - i][0])\n", "n = int(input())\n\nfood = [int(i) for i in input().split(\" \")]\n\nevery = int(sum(food)/(n/2))\n\nfor i in range(n):\n if(food[i]):\n a = every - food[i]\n food[i] = 0\n print(str(i+1) + \" \" + str(food.index(a) + 1))\n food[food.index(a)] = 0\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=list(map(int,input().split()))\r\na=max(l)+min(l)\r\nd=0\r\np=[]\r\nfor i in range(n):\r\n\tif(l[i]==0):\r\n\t\tcontinue\r\n\tq=l[i]\r\n\tl[i]=0\r\n\tc=l.index(a-q)\r\n\tl[c]=0\r\n\tif(i not in p and c not in p):\r\n\t\tp.append(i)\r\n\t\tp.append(c)\r\nfor i in range(1,len(p)+1):\r\n\tif(i%2!=0):\r\n\t\tprint(p[i-1]+1,p[i]+1)\r\n\t\td+=1\r\n\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\nb = a[::]\r\nb.sort()\r\n\r\nfor i in range(n // 2):\r\n MX = a.index(b[-1])\r\n a[MX] = 's'\r\n MN = a.index(b[0])\r\n a[MN] = 's'\r\n print(MN + 1, MX + 1)\r\n b.pop(-1)\r\n b.pop(0)\r\n ", "x = int(input())\ny = list(map(int,input().split()))\nn = int(x/2)\np = sum(y)/n\nfor i in range(0,x):\n for j in range(i,x):\n if p == y[j]+y[i] and i != j:\n print(i+1 , j+1)\n y[j],y[i]=0,0\n break\n \n\n\t \t\t\t \t\t\t \t \t \t", "n=int(input())\r\na=list(map(int, input().split()))\r\np=[]\r\nfor i,j in enumerate(a):\r\n\tp.append([i+1,j])\r\np.sort(key=lambda x: x[1])\r\n\r\nfor j in range(n//2):\r\n\tprint(p[j][0], p[(n-1)-j][0])", "from operator import itemgetter\r\n\r\nn = int(input())\r\nl1 = [int(i) for i in input().split()]\r\nl2 = [i for i in range(1, n + 1)]\r\nl = list(zip(l1, l2))\r\nl.sort(key=itemgetter(0))\r\nfor i in range(n//2):\r\n print(l[i][1], l[n-(i + 1)][1])\r\n\r\n", "input()\r\na = list(map(int, input().split()))\r\nx = []\r\nfor i in range(0, len(a)):\r\n for j in range(i+1, len(a)):\r\n if a[i] + a[j] == max(a) + min(a) and i+1 not in x and j+1 not in x:\r\n print(i+1, j+1, sep=\" \")\r\n x.append(i+1)\r\n x.append((j+1))\r\n break", "n=int(input())\r\nl=list(map(int,input().split()))\r\nm=max(l)+min(l)\r\nfor i in range(n):\r\n for j in range(n):\r\n if(l[i]+l[j]==m and i!=j):\r\n print(i+1,j+1)\r\n l[i]=369\r\n l[j]=369", "def division():\r\n\tn = int(input())\r\n\ta = [(int(num), i) for i, num in enumerate(input().split(), 1)]\r\n\r\n\ta.sort()\r\n\tfor i in range(n // 2):\r\n\t\tprint(a[i][1], a[n - 1 - i][1])\r\n\r\ndivision()", "numbers = []\r\nn = int(input())\r\ni = 1\r\nfor x in input().split():\r\n numbers.append((int(x), i))\r\n i += 1\r\nnumbers = sorted(numbers)\r\nfor x in range(n//2):\r\n print(numbers[x][1], numbers[n - x - 1][1])", "n = int(input())\r\nl = list(map(int, input().rstrip().split()))\r\nl = sorted([[j,i+1] for i,j in enumerate(l)])\r\nfor i in range(n//2):\r\n print(l[i][1], l[-(i+1)][1])", "\r\ndef solve(n, m):\r\n\r\n test = sorted(m.copy())\r\n for i in range(int(n/2)):\r\n place = m.index(test[i])\r\n m[place] = 0\r\n place2 = m.index(test[n - i - 1])\r\n m[place2] = 0\r\n print(str(place + 1) + \" \" + str(place2 + 1))\r\n\r\n\r\nif __name__ == \"__main__\":\r\n n, m = int(input()), list(map(int, input().split()))\r\n solve(n, m)", "# https://codeforces.com/contest/701/problem/A\r\n\r\nn = int(input())\r\n\r\ncards = map(int, input().split())\r\nvector_list = list()\r\nfor i, j in enumerate(cards, start=1):\r\n vector_list.append((i, j))\r\n\r\nvector_list.sort(key= lambda x : x[1])\r\ni, j = 0, n-1\r\nwhile i <=j:\r\n print(vector_list[i][0], vector_list[j][0])\r\n i += 1\r\n j -= 1\r\n\r\n", "n = int(input())\r\nm = list(map(int, input().split()))\r\na = []\r\nfor i in range(n):\r\n if i+1 in a:\r\n continue\r\n for j in range(n):\r\n if j+1 in a:\r\n continue\r\n if i==j:\r\n continue\r\n if m[i] + m[j] == sum(m) // (n // 2):\r\n print(i+1, j+1)\r\n a.append(i+1)\r\n a.append(j+1)\r\n break\r\n", "n = int(input())\r\ncards = list(map(int, input().split()))\r\nhalf = sum(cards) * 2 // n\r\nfor i in range(n- 1):\r\n for j in range(i + 1, n):\r\n if cards[i] + cards[j] == half:\r\n print(i + 1, j + 1)\r\n cards[i] = cards[j] = 0\r\n", "import sys\r\nfrom collections import defaultdict\r\n\r\ndef main():\r\n _, *inp = map(int, sys.stdin.read().strip().split())\r\n d = defaultdict(set)\r\n for i,j in enumerate(inp, 1):\r\n d[j].add(i)\r\n out = []\r\n n = max(inp) + min(inp)\r\n for i in inp:\r\n if d[i]: \r\n x, y = d[i].pop(), d[n-i].pop()\r\n out.append(f'{x} {y}')\r\n return out\r\n\r\nprint(*main(), sep='\\n')", "cards = int(input())\r\ndigits = list(map(int, input().split()))\r\na = sorted((x, i) for i, x in enumerate(digits, 1))\r\nfor i in range(int(cards / 2)):\r\n print(a[i][1], a[cards - i - 1][1])", "n = int(input())\r\na = list(map(int,input().split()))\r\ntemp = (sum(a)*2)//n\r\nvisited = []\r\nfor i in range(len(a)):\r\n for j in range(len(a)):\r\n if i==j or j in visited or i in visited:\r\n continue\r\n if a[i]+a[j]==temp:\r\n print(i+1,j+1)\r\n visited.append(j)\r\n visited.append(i)\r\n break", "n=int(input())\r\na=list(map(int,input().split()))\r\na=list(enumerate(a))\r\na.sort(reverse=True,key=lambda x:x[1])\r\nfor i in range(n//2):\r\n print(a[i][0]+1,a[n-i-1][0]+1)", "n = int(input() )\na = list(map(int, input().split() ) )\nfor i in range(n): a[i] = [a[i], i+1]\na.sort()\nfor i in range(n//2):\n print(a[i][1], a[n-1-i][1] )\n\n", "sze = int(input())\r\nunsorted_list = list(map(int, input().split()))\r\nsorted_list = sorted(unsorted_list)\r\nvalue_to_indices = {}\r\nfor index, value in enumerate(unsorted_list):\r\n if value not in value_to_indices:\r\n value_to_indices[value] = []\r\n value_to_indices[value].append(index)\r\n\r\nfor i in range(len(sorted_list) // 2):\r\n print(value_to_indices[sorted_list[i]].pop(0) + 1, value_to_indices[sorted_list[-(i+1)]].pop() + 1)", "s=int(input())\r\nt=input()\r\na=t.split(\" \")\r\nx=[]\r\nfor i in a:\r\n x.append(int(i))\r\nz=sum(x)//(s//2)\r\nfor i in range(len(x)):\r\n if (x[i]!=-1):\r\n new=x[i]\r\n x[i]=-1\r\n find=z-new\r\n pailam=x.index(find)\r\n x[pailam]=-1\r\n print(i+1,pailam+1)\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 solve():\n n = int_input()\n a = int_lst_input()\n\n target = sum(a) // (n // 2)\n\n idx_used = set()\n\n for i in range(0, n):\n for j in range(0, n):\n if (\n i not in idx_used\n and j not in idx_used\n and a[i] + a[j] == target\n and i != j\n ):\n idx_used.add(i)\n idx_used.add(j)\n print(f'{i+1} {j+1}')\n\nif __name__ == '__main__':\n solve()\n", "cards = []\r\nn = int(input())\r\na = list(map(int, input().split()))\r\n\r\ns = sum(a)//(n//2)\r\n\r\nfor person in range(n//2):\r\n\tfirstCard = 0\r\n\tindex1 = 0\r\n\tindex2 = 0\r\n\tfor card in range(n-1, -1, -1):\r\n\t\tif a[card] != 0 and firstCard == 0:\r\n\t\t\tfirstCard = a[card]\r\n\t\t\tindex1 = card+1\r\n\t\t\ta[card] = 0\r\n\t\telif a[card] != 0:\r\n\t\t\tif firstCard + a[card] == s:\r\n\t\t\t\tindex2 = card+1\r\n\t\t\t\ta[card] = 0\r\n\t\t\t\tbreak\r\n\tcards.append([index1, index2])\r\nfor pair in cards:\r\n\tprint(\" \".join(str(num) for num in pair))", "from statistics import mean\r\n\r\nn = int(input())\r\nc = list(map(int, input().split()))\r\nt = mean(c) * 2\r\nfor i in range(len(c)):\r\n if c[i] == 0:\r\n continue\r\n for j in range(len(c)):\r\n if i == j:\r\n continue\r\n if c[j] == 0:\r\n continue\r\n if c[i] + c[j] == t:\r\n print(i + 1, j + 1)\r\n c[i] = 0\r\n c[j] = 0\r\n", "n = int(input())\r\na = [int(i) for i in input().split()]\r\nd = sorted([[a[i], i + 1] for i in range(n)])\r\nfor i in range(n // 2):\r\n print(d[i][1], d[n - 1 - i][1])", "n=int(input())\r\nl=list(map(int,input().split()))\r\nl1=l.copy()\r\nl1.sort()\r\nfor i in range(0,n>>1):\r\n if l1[i]==l1[n-1-i]:\r\n print(l.index(l1[i])+1,n-l[::-1].index(l1[n-1-i]))\r\n l[l.index(l1[i])]=0\r\n l[n-1-l[::-1].index(l1[n-1-i])]=0\r\n else:\r\n print(l.index(l1[i])+1,l.index(l1[n-1-i])+1)\r\n l[l.index(l1[i])]=0\r\n l[l.index(l1[n-1-i])]=0", "if __name__ == '__main__':\r\n n = int(input())\r\n a = list(map(int, input().split()))\r\n s = sum(a)\r\n pair_sum = s / (n / 2)\r\n mark = [None] * n\r\n for i in range(n - 1):\r\n for j in range(i + 1, n):\r\n if mark[i] == None and a[i] + a[j] == pair_sum and mark[j] == None:\r\n print(i + 1, end=' ')\r\n print(j + 1)\r\n mark[j] = 1\r\n mark[i] = 1\r\n", "n=int(input())\nL = [int(x) for x in input().split()]\nA = [0]*101\nd = {}\nfor j in range(n):\n i = L[j]\n A[i] +=1\n if i not in d:\n d[i] = []\n d[i].append(j)\nreq = (2*sum(L))//n\nfor i in range(101):\n while A[i]:\n print(d[i].pop()+1, d[req-i].pop()+1)\n A[i] -= 1\n A[req-i] -= 1\n", "n=int(input())\r\nm=list(map(int,input().split()))\r\nl=[]\r\nfor i in range(n):\r\n\tl.append([m[i],i])\r\nl.sort()\r\nfor i in range(n//2):\r\n\tprint(l[i][1]+1,l[n-i-1][1]+1)\r\n", "n = int(input())\r\ny = list(map(int, input() .split())) \r\nx=[0]*n\r\nfor i in range(n):\r\n x[i] = y[i]\r\ny.sort()\r\nj = n-1\r\nk,t = 0,0\r\nwhile True:\r\n print(x.index(y[j])+1,end=' ') \r\n x[x.index(y[j])] = 0\r\n print(x.index(y[k])+1)\r\n x[x.index(y[k])] = 0\r\n j-=1\r\n k+=1\r\n t+=1\r\n if t == n//2:\r\n break", "n=int(input())\r\ncards = list(map(int, input().split()))\r\n\r\nval_of_each = 2*sum(cards)/n \r\n\r\ni=0 \r\nwhile i<n:\r\n if cards[i]!=0:\r\n print(i+1, end=\" \")\r\n\r\n for j in range(i+1,n):\r\n if cards[j]!=0:\r\n if cards[i]+cards[j]==val_of_each:\r\n print(j+1)\r\n break \r\n cards[i]=0 \r\n cards[j]=0 \r\n i+=1 \r\n", "n = int(input())\r\nl = list(map(int, input().split()))\r\nd = []\r\nfor i in range(n):\r\n d.append([l[i], i + 1])\r\nd.sort()\r\nfor i in range(n // 2):\r\n print(d[i][1], d[n - i - 1][1])", "n = int(input())\r\narr = list(map(int, input().split()))\r\nmean = sum(arr) / len(arr)\r\n\r\nr = []\r\nfor i, x in enumerate(arr, 1):\r\n r.append((x, i))\r\nr.sort()\r\n\r\nfor i in range(len(arr) // 2):\r\n print(r[i][1], r[-i-1][1])\r\n", "n = int(input())\ncards = list(map(int, input().split()))\nindecies = sorted(range(1, n + 1), key=lambda x: cards[x - 1])\nfor i in range(n // 2):\n print(indecies[i], indecies[n - 1 - i])\n", "n=int(input())\r\na=sorted(zip(map(int,input().split()),range(1,n+1)))\r\nfor i in range(n//2): print(a[i][1],a[-i-1][1])", "n = int(input())\r\nlst_s = input().split()\r\nlst = []\r\nindex_lst = []\r\ntotal = 0\r\nfor i in range(len(lst_s)):\r\n lst.append(int(lst_s[i]))\r\n total += int((lst_s[i]))\r\nx = 2 * total / n\r\nfor j in range(len(lst_s)):\r\n if j not in index_lst:\r\n y = x - lst[j]\r\n index_lst.append(j)\r\n while True:\r\n ind = lst.index(y)\r\n if ind in index_lst:\r\n lst.insert(ind,'a')\r\n lst.remove(y)\r\n continue\r\n break\r\n index_lst.append(ind)\r\nb = 0\r\nfor i in range(int(len(lst_s)/2)):\r\n print(index_lst[b] + 1,end=' ')\r\n print((index_lst[b+1]+1))\r\n b += 2", "n = int(input())\r\na = [int(i) for i in input().split()]\r\nb = []\r\nfor i in range(n):\r\n c = (a[i], i + 1)\r\n b.append(c)\r\nb.sort()\r\nfor i in range(n // 2):\r\n print(b[i][1], b[n - 1 - i][1])", "# import sys\r\n# sys.stdin = open(\"#input.txt\", \"r\")\r\n\r\nn = int(input())\r\nls = list(map(int, input().split()))\r\nm = sum(ls) // (n // 2)\r\n\r\nfor i in range(n):\r\n\tif ls[i] == -1: continue\r\n\tfor j in range(i+1,n):\r\n\t\tif ls[i] + ls[j] == m:\r\n\t\t\tprint(i+1,j+1)\r\n\t\t\tls[i] = ls[j] = -1\r\n\t\t\tbreak", "n=int(input())\r\na=list(map(int,input().split()))\r\nsum=0\r\nflag=[]\r\nfor i in range(0,n+1):\r\n\tflag.append(0)\r\nlag=flag\r\nfor i in a:\r\n\tsum=sum+ i\t\r\nsum=sum//(n/2)\r\nfor i in range(n+1):\r\n\tfor j in range (i,n):\r\n\t\tif a[i]+a[j]==sum and i!=j and flag[i]==0 and lag[j]==0:\r\n\t\t\tflag[i]=1\r\n\t\t\tlag[j]=1\r\n\t\t\tprint(i+1,j+1)", "def main():\r\n n = int(input())\r\n vals = [(int(v),i) for i, v in enumerate(input().split())]\r\n vals.sort()\r\n for i in range(n//2):\r\n print(vals[i][1]+1, vals[n-i-1][1]+1)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\nb=[]\r\nfor i in a:\r\n b.append(i)\r\na.sort()\r\nc=[]\r\nwhile len(a)!=0:\r\n x=b.index(a[0])\r\n b[b.index(a[0])]=0\r\n y=b.index(a[len(a)-1])\r\n b[b.index(a[len(a) - 1])] = 0\r\n c.append([1+x,1+y])\r\n del(a[0])\r\n del(a[len(a)-1])\r\nfor i in range(len(c)):\r\n print(c[i][0],c[i][1])", "n=int(input())\r\nl=list(map(int,input().split()))\r\nm=sorted(l)\r\ns=m[0]+m[n-1]\r\nc=0\r\nfor i in range(n):\r\n for j in range(i+1,n):\r\n if(l[i]+l[j]==s):\r\n print(i+1,j+1)\r\n l[i]=0\r\n l[j]=0", "n = int(input())\r\ncards = [int(x) for x in input().split()]\r\n\r\nnew_l = []\r\nfor i in range(n):\r\n new_l.append((cards[i], i+1))\r\nlst = sorted(new_l, key=lambda x: x[0])\r\n\r\nfor i in range(n // 2):\r\n print(lst[i][1], lst[n - i -1][1])", "n = int(input())\r\nl=list(map(int,input().split()))\r\nl1=[]\r\nfor i in range(1,n+1):\r\n\tl1.append((i,l[i-1]))\r\nl1.sort(key=lambda l1:l1[1])\r\n# print(l1)\r\nfor i in range((n//2)):\r\n\tprint(l1[i][0],l1[n-1-i][0])", "import sys,math,string\ninput=sys.stdin.readline\n\nL=lambda : list(map(int,input().split()))\nLs=lambda : list(input().split())\nM=lambda : map(int,input().split())\nn=int(input())\nl=L()\nf=[]\nfor i in range(n):\n f.append([l[i],i])\nf.sort(key=lambda x: x[0])\n\nfor i in range(n//2):\n print(f[i][1]+1,f[n-1-i][1]+1)\n \n", "#!/usr/bin/env python\r\nimport math\r\nimport sys\r\nimport itertools\r\nimport fractions\r\n\r\nif __name__ == '__main__':\r\n wtf = sys.stdin.read()\r\n wtf = wtf.strip().split('\\n')\r\n n = int(wtf[0])\r\n A = list(map(int, wtf[1].split()))\r\n Ak = sorted(range(n),key=lambda k: A[k])\r\n for i in range(n//2):\r\n print(Ak[i]+1, Ak[n-i-1]+1)\r\n", "def print_pairs(numbers):\r\n target = sum(numbers)//(len(numbers)/2)\r\n value_to_indices = {}\r\n for i in range(len(numbers)):\r\n if (target - numbers[i]) in value_to_indices and len(value_to_indices[target - numbers[i]]) > 0:\r\n index = value_to_indices[target - numbers[i]].pop()\r\n print(str(index + 1) + \" \" + str(i + 1))\r\n else:\r\n if numbers[i] in value_to_indices:\r\n value_to_indices[numbers[i]].append(i)\r\n else:\r\n value_to_indices[numbers[i]] = [i]\r\n\r\nn = int(input())\r\nnumbers = list(map(int, input().split()))\r\nprint_pairs(numbers)", "def I(): return map(int, input().split())\r\n\r\n\r\nn = int(input())\r\na = list(I())\r\nt = []\r\nfor i in range(n):\r\n t.append([a[i], i])\r\nx = 2*sum(t[i][0] for i in range(n))//n\r\nfor i in range(n//2):\r\n for ii in range(i+1, n):\r\n if t[i][0]+t[ii][0] == x:\r\n print(t[i][1]+1, t[ii][1]+1)\r\n t.pop(ii)\r\n break\r\n", "n=int(input())\na= [int(i) for i in input().split()]\na_position =[(a[i],i+1) for i in range(n)]\na_position.sort()\n\nleft=0\nright=n-1\nfor i in range(n//2):\n print(a_position[left][1],a_position[right][1])\n left+=1\n right-=1\n \t \t \t\t\t\t\t\t \t\t \t \t \t \t \t", "n = int(input())\r\na = input().split()\r\na = sorted([(int(a[i]), i + 1) for i in range(n)])\r\nfor i in range(n//2):\r\n print(a[i][1], a[-1-i][1])", "n = int(input())\r\na = []\r\na = list(map(int,input().split()))\r\nx = sum(a)/n*2\r\nfor i in range(n):\r\n for j in range(n):\r\n if a[i]+a[j] == x and i != j:\r\n a[i]=0\r\n a[j] = 0\r\n print((i+1),(j+1))\r\n\r\n # break\r\n\r\n\r\n", "from collections import defaultdict\n\ndef solve(n, c):\n x = c[:]\n d = defaultdict(list)\n for i, v in enumerate(c):\n d[v].append(i)\n x.sort()\n for i in range(n//2):\n a = d[x[i]].pop()\n b = d[x[n-1-i]].pop()\n print(a+1, b+1) \n\n\ndef main():\n n = int(input())\n c = list(map(int, input().split()))\n solve(n, c)\n\n\nmain()\n", "n = int(input())\ncards = list(map(int, input().split()))\n\nsummary = sum(cards) / n * 2\n\nfor i in range(n):\n for j in range(n):\n if cards[i] + cards[j] == summary and i != j:\n print(i + 1, j + 1)\n cards[i] = 0\n cards[j] = 0\n", "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 = ini()\r\na = sorted(enumerate(inl()), key=lambda x: x[1])\r\nfor i in range(n//2):\r\n print(a[i][0] + 1, a[-i-1][0] + 1)", "from functools import reduce\r\ndef sum(a, b):\r\n return a + b\r\n\r\nn = int(input())\r\nlis = list(map(int, input().split(' ')))\r\ntotal = reduce(sum, lis)\r\ntotal /= (n / 2)\r\ntotal = int(total)\r\nlenth = len(lis)\r\nfor i in range(lenth):\r\n for j in range(i + 1, lenth):\r\n if lis[i] + lis[j] == total:\r\n print(i + 1, j + 1)\r\n lis[j] = total + 1\r\n break", "n = int(input())\r\na = list(map(int, input().split()))\r\n \r\nindexes = list(range(n))\r\nindexes.sort(key=a.__getitem__)\r\n \r\nfor i in range(n//2):\r\n\tprint(indexes[i]+1, indexes[-i-1]+1)", "def li():\r\n return list(map(int,input().split()))\r\ndef gi(n):\r\n return [list(map(int,input().split())) for _ in range(n)]\r\n\r\n# File input\r\n\r\n# import sys\r\n# sys.stdin = open('user.txt','r')\r\n\r\nn = int(input())\r\nl = li()\r\nx = list(enumerate(l,1))\r\nx.sort(key=lambda x: x[1])\r\n\r\nfor i in range(n//2):\r\n print(x[i][0],x[n-i-1][0])\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\nx = max(a) + min(a)\r\nused = list()\r\nfor i in range(n):\r\n for j in range(i, n):\r\n if j not in used and a[i] + a[j] == x and j != i and i not in used:\r\n print(i + 1, j + 1)\r\n used.append(j)\r\n used.append(i)\r\n", "if __name__ == '__main__':\r\n n = int(input())\r\n aa = map(int, input().split())\r\n aa = sorted(enumerate(aa), key=lambda x: x[1])\r\n for i in range(n // 2):\r\n print(f'{aa[i][0] + 1} {aa[n - i - 1][0] + 1}')\r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\ns=0\r\nfor i in a:\r\n\ts=s+i\r\ntotal=int((s/n)*2)\r\nfor i in range(0,len(a)):\r\n\tif(a[i]!=0):\r\n\t\tfor j in range(0,len(a)):\r\n\t\t\tif(a[i]+a[j]==total and i!=j):\r\n\t\t\t\tprint(i+1,j+1)\r\n\t\t\t\ta[i]=0\r\n\t\t\t\ta[j]=0", "n = int(input())\r\n\r\na = [int(x) for x in input().split()]\r\n\r\npair = []\r\n\r\nne = max(a)+min(a)\r\n\r\nfor i in range(n):\r\n for ii in range(i+1, n):\r\n if a[i] != 0 and a[ii] != 0 and a[i]+a[ii] == ne:\r\n pair.append([i+1, ii+1])\r\n a[i] = 0\r\n a[ii] = 0\r\nfor i in pair:\r\n print(*i)\r\n", "n = int(input())\r\na = [int(x) for x in input().split()]\r\ns = sum(a)//(n//2)\r\nchecked = []\r\nfor i in range(n):\r\n if i not in checked:\r\n for j in range(i+1, n):\r\n if a[i] + a[j] == s and j not in checked:\r\n print(i+1, j+1)\r\n checked.append(i)\r\n checked.append(j)\r\n break\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\nul=[]\r\nfor i in range(1,n+1):\r\n ul.append(i)\r\n \r\nd=sorted(zip(l,ul))\r\n#print(d)\r\nl.sort()\r\nfor i in range(n//2):\r\n print(d[i][1],d[-i-1][1])", "#-------------Program-------------\r\n#----KuzlyaevNikita-Codeforces----\r\n#\r\n\r\nn=int(input())\r\na=list(map(int,input().split()))\r\nd=[]\r\nfor i in range(n):\r\n d.append([a[i],i+1])\r\nd.sort(key=lambda x:(x[0]))\r\nfor i in range(n//2):\r\n print(d[i][1],d[-i-1][1])", "lng = int(input())\r\narr = input().split(' ')\r\narr = [int(i)for i in arr]\r\n\r\nsor = sorted(arr)\r\nindex_val = []\r\n\r\nfor i in sor:\r\n\tindex_val.append(arr.index(i)+1)\r\n\tarr[arr.index(i)] = -1\r\n\r\nfor i in range(int(lng/2)):\r\n\tprint(index_val[i], index_val[-(i+1)])", "n=int(input())\r\nx=list(map(int,input().split()))\r\ntemp=sum(x)//(n//2)\r\nfor i in range(0,n):\r\n for j in range(0,n):\r\n if(i!=j and x[i]+x[j]==temp):\r\n print(i+1,j+1)\r\n x[i]=0\r\n x[j]=0\r\n ", "import sys\nfrom time import perf_counter\n_DEBUG=False \nif _DEBUG:\n fd = open(\"input.txt\",\"r\")\n sys.stdin = fd\n\n# input\nn = int(input())\narr = list(map(int, input().split()))\n\n# sum value\ns = max(arr) + min(arr)\nfor i in range(n):\n for j in range(n):\n if arr[i] + arr[j] == s and not i == j:\n print(i+1, j+1)\n arr[i] = arr[j] = -1", "n = int(input())\r\ncards = [int(i) for i in input().split(\" \")]\r\nplayercount = n // 2\r\neachplayer = sum(cards)//playercount\r\nfor i in range(n):\r\n if cards[i] != 0:\r\n x = cards[i]\r\n cards.pop(i)\r\n cards.insert(i, 0)\r\n y = cards.index(eachplayer - x)\r\n cards.pop(y)\r\n cards.insert(y, 0)\r\n print(i + 1, y + 1)\r\n ", "n = int(input())\n\ncards = list(map(int, input().split()))\n\ntarget = int(sum(cards)/2)\n\ncards2 = []\nfor i in range(n): \n cards2.append((cards[i], i+1))\n\ncards2.sort(key = lambda row: row[0])\n\nfor i in range(n//2): \n print(cards2[i][1], cards2[n-i-1][1])\n", "n, a = int(input()), [int(i) for i in input().split()]\n# s, v = {}, -1\n# for i in range(n):\n# if v >= 0:\n# break\n# for j in range(n):\n# if i != j:\n# k = a[i] + a[j]\n# s[k] = s.get(k, 0) + 1\n# if s[k] == n // 2:\n# v = k\n# break\nk = sorted(range(n), key=lambda i: a[i])\nlo, hi = 0, n - 1\nwhile lo < hi:\n res = k[lo] + 1, k[hi] + 1\n lo += 1\n hi -= 1\n print(*res)\n", "n=int(input())\r\nl=[int(x) for x in input().split()]\r\nv=(sum(l)*2)//n\r\nwas=[]\r\nfor i in range(n):\r\n if not i in was:\r\n tmp=v-l[i]\r\n for j in range(i+1,n):\r\n if l[j]==tmp and not j in was:\r\n was.append(j)\r\n print(i+1,j+1)\r\n break\r\n \r\n", "x = int(input())\r\narr = [*map(int, input().split())]\r\nind = sorted([(count, value) for count, value in enumerate(arr)], key=lambda k: k[1])\r\nfor i in range(x//2):\r\n print(f'{ind[i][0]+1} {ind[x-i-1][0]+1}')\r\n ", "def main(number, n_list):\r\n\r\n n_list = [int(x) for x in n_list.split()]\r\n \r\n sorted_list = sorted(n_list)\r\n\r\n pairs = []\r\n\r\n for i in range(len(sorted_list)//2):\r\n pairs.append((sorted_list[i], sorted_list[-(i+1)]))\r\n\r\n output = []\r\n for x, y in pairs:\r\n x_idx = n_list.index((x))\r\n n_list[x_idx] = None\r\n y_idx = n_list.index((y))\r\n output.append((x_idx+1, y_idx+1))\r\n n_list[y_idx] = None\r\n\r\n for x,y in output:\r\n print(x,y)\r\n\r\n\r\n\r\n\r\n\r\nif __name__ == '__main__':\r\n number = '6'\r\n n_list = '1 5 7 4 4 3'\r\n\r\n number = input()\r\n n_list = input()\r\n\r\n main(number,n_list)\r\n\r\n'''\r\nIn this task I create a template. With function main. To decide this task\r\nI have to create list number, sorted it. And in the end appand pair of this id in list\r\nand print it\r\n\r\nAt first I create function main and with list comprahantion create numbers list from string\r\n\r\nNext I create new sorted list. And with it create new list 'pairs' with pairs of tuple of values\r\n\r\nNext I create finaly list 'output'. And with for i get valus from n_list and append their id into output\r\n\r\nIn the end with for I print data\r\n\r\nNow start sample test \r\nInput: 6\r\n 1 5 7 4 4 3\r\nOutput: 1 3\r\n 6 2\r\n 4 5\r\n\r\nInput: 4\r\n 10 10 10 10\r\nOutput: 1 2\r\n 3 4\r\n \r\nSample test was complete.\r\nNow let's check if all the values are the same. It is need that program dont broken with deferent id but the same values\r\nSince they will all be the same, I expect the result in the usual way: 1 2, 3 4\r\n\r\nInput: 4\r\n 1 1 1 1\r\nOutput: 1 2\r\n 3 4\r\n\r\nResult is greate. Because 1+1 always == 1+1\r\nNow lets chek with big numbers. I expect the simple result without diferents: 3 2, 1 4\r\nInput: 4\r\n 12000 13000 14000 15000\r\nOutput: 3 2\r\n 1 4\r\n\r\nResult is wright because 12000+15000 == 13000+14000 == 27000\r\nReady to submit\r\n \r\n'''\r\n\r\n", "card_number = int(input())\r\ncard_values = list(map(int, input().split() ))\r\nsorted_card_values = sorted(card_values)\r\nanswer_list = []\r\nfor i in range(card_number//2):\r\n answer_list.append(str(card_values.index(sorted_card_values[i])+1))\r\n card_values[card_values.index(sorted_card_values[i])] = 0\r\n answer_list.append(str(card_values.index(sorted_card_values[-(i+1)])+1))\r\n card_values[card_values.index(sorted_card_values[-(i+1)])] = 0\r\n print(\" \".join(answer_list))\r\n answer_list.clear()", "n=int(input())\r\na=list(map(int,input().split()))\r\nm=[]\r\nfor k in range (1,n+1):\r\n aux=[a[k-1]]+[k]\r\n m.append(aux)\r\nnn=n//2\r\nm.sort()\r\naux2=n-1\r\nfor j in range(nn):\r\n print(m[j][1],m[aux2][1])\r\n aux2-=1\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\nb = []\r\nfor i in range(n):\r\n\tif i in b:\r\n\t\tcontinue\r\n\telse:\r\n\t\tprint(i+1, end = ' ')\r\n\t\tb.append(i)\r\n\t\tfor j in range(i+1, n):\r\n\t\t\tif a[j]+a[i]==sum(a)//(n//2) and j not in b:\r\n\t\t\t\tprint(j+1)\r\n\t\t\t\tb.append(j)\r\n\t\t\t\tbreak", "n = int(input())\r\na = list(map(int,input().split()))\r\nz = max(a) + min(a)\r\nfor i in range(len(a)):\r\n\tif a[i]>0:\r\n\t\tfor j in range(i+1,len(a)):\r\n\t\t\t\tif a[j] == z-a[i]:\r\n\t\t\t\t\tprint(i+1,j+1)\r\n\t\t\t\t\ta[i] = 0\r\n\t\t\t\t\ta[j] = 0\r\n\t\t\t\t\tbreak", "import sys\r\nn=int(input())\r\na=list(map(int, sys.stdin.readline().strip().split()))\r\nr=[(a[i],i+1) for i in range(n) ]\r\n# print(r)\r\nr.sort(key=lambda x : x[0])\r\n# print(r[0][0])\r\nfor i in range(n//2):\r\n print (r[i][1],r[-i-1][1])\r\n# print (r)", "l = int(input())\na = [int(i) for i in input().split(\" \")]\nb = a.copy()\nfor i in range(l // 2):\n minA = min(a)\n n = b.index(minA)\n a.remove(minA)\n b[n] = -1\n\n maxA = max(a)\n m = b.index(maxA)\n a.remove(maxA)\n b[m] = -1\n\n print(n+1, m+1)\n\n \t \t\t \t\t\t \t\t\t\t \t\t\t\t\t\t \t\t", "n=int(input())\r\nl=list(map(int,input().split()))\r\np=(sum(l)*2)//n\r\nfor i in range(n):\r\n if l[i]!=0:\r\n for j in range(i+1,n):\r\n if l[j]==p-l[i]:\r\n print(i+1,end=\" \")\r\n print(j+1)\r\n l[i]=0\r\n l[j]=0\r\n ", "n=int(input())\r\nl=[int(x) for x in input().split()]\r\nl1=[]\r\nfor i in range(len(l)):\r\n l1.append([l[i],i+1])\r\nl1.sort()\r\nfor i in range (len(l1)//2):\r\n print(l1[i][1],l1[len(l1)-i-1][1],sep=\" \")", "n = int(input())\r\nt = list(map(int, input().split()))\r\na = []\r\nfor i in range(n): a.append([t[i],i+1])\r\na.sort()\r\nfor i in range(n // 2): print(a[i][1], a[-i - 1][1])", "\r\n\r\n\r\nn=int(input())\r\nd=sorted(zip(map(int,input().split()),range(1,n+1)))\r\nfor i in range(n//2):\r\n print(d[i][1],d[-i-1][1])", "n=int(input())\r\nl=list(map(int,input().split()))\r\na=sum(l)//(n/2)\r\nl1=[]\r\nfor i in range(n):\r\n\tfor j in range(i+1,n):\r\n\t\tif l[i]+l[j]==a:\r\n\t\t\tif i+1 not in l1 and j+1 not in l1:\r\n\t\t\t\tl1.append(i+1)\r\n\t\t\t\tl1.append(j+1)\r\n\t\t\t\tbreak\r\nfor i in range(0,n-1,2):\r\n\tprint(l1[i],l1[i+1])", "#for _ in range(int(input())):\r\nn=int(input())\r\n #a,b,c,d,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\nb=[]\r\nfor i in range(n):\r\n c=[]\r\n for j in range(n):\r\n c.append(a[i]+a[j])\r\n b.append(c)\r\n#print(b)\r\nk=set(b[0])\r\nfor i in range(1,n):\r\n k=k.intersection(set(b[i]))\r\nk=list(k)\r\ni=0\r\nwhile(i<len(a)):\r\n j=i+1\r\n while(j<len(a)):\r\n if(a[i]!=0 and a[j]!=0 and a[i]+a[j]==k[0]):\r\n print(i+1,j+1)\r\n a[i]=0\r\n a[j]=0\r\n j+=1\r\n i+=1\r\n", "# cook your dish here\r\nn=int(input())\r\nA=list(map(int,input().split()))\r\nA=sorted(range(len(A)), key=lambda k: A[k])\r\ni=0\r\nj=len(A)-1\r\nwhile(i<j):\r\n print(A[i]+1,A[j]+1)\r\n i+=1\r\n j-=1\r\n\r\n", "n=int(input())\r\nx=input()\r\nxx=x.split( )\r\ns=[]\r\np=[]\r\nm=n\r\nfor i in range(0,n):\r\n xx[i]=int(xx[i])\r\na=xx[:]\r\nxx.sort()\r\nk=1\r\nfor hjdf in range(0,m):\r\n if k%2==1:\r\n o=[]\r\n h=xx[0]\r\n for i in range(0,n):\r\n if a[i]==h and i not in p:\r\n o.append(i)\r\n p.append(i)\r\n del(xx[0])\r\n m-=1\r\n break\r\n else:\r\n h=xx[m-1]\r\n for i in range(0,n):\r\n if a[i]==h and i not in p:\r\n o.append(i)\r\n p.append(i)\r\n del(xx[m-1])\r\n m-=1\r\n break\r\n if k%2==0:\r\n s.append(o)\r\n k+=1\r\nfor i in s:\r\n print(i[0]+1,end=' ')\r\n print(i[1]+1)\r\n", "n=int(input())\r\nA=list(map(int,input().split()))\r\nl=list(sorted(A))\r\nfor i in range(0,n//2):\r\n k=A.index(l[i])\r\n A[k]=None\r\n m=A.index(l[n-1-i])\r\n A[m]=None\r\n print(k+1,m+1)\r\n \r\n \r\n \r\n", "num = int(input())\r\narr = list(map(int, input().split()))\r\n\r\nres = []\r\nindices = []\r\ntarget = sum(arr)//(num//2)\r\n\r\nfor i, val in enumerate(arr, start=1):\r\n for j, val2 in enumerate(arr, start=1):\r\n if val + val2 == target and i != j and i not in indices and j not in indices:\r\n res.append([i,j])\r\n indices.append(i)\r\n indices.append(j)\r\n\r\nfor i in res:\r\n print(*i)\r\n\r\n\r\n", "i=int(input())\r\nl=list(map(int,input().split()))\r\na=sum(l)//(i//2)\r\nfor x in range(len(l)):\r\n\tif l[x]!='*':\r\n\t\tb=l[x]\r\n\t\tfor y in range(x+1,len(l)):\r\n\t\t\tc=a-b\r\n\t\t\tif l[y]==c:\r\n\t\t\t\tprint(x+1,y+1)\r\n\t\t\t\tl[y]=\"*\"\r\n\t\t\t\tbreak", "# Cards\ndef cards(arr):\n ans = []\n di = {}\n for i, j in enumerate(arr):\n if j in di:\n di[j].append(i+1)\n else:\n di[j] = [i+1]\n while arr:\n smol = min(arr)\n big = max(arr)\n val = [di[smol].pop(), di[big].pop()]\n arr.remove(smol)\n arr.remove(big)\n ans.append(val)\n for i in ans:\n for j in i:\n print(j, \"\", end = \"\")\n print()\nn = int(input())\narr = list(map(int, input().rstrip().split()))\ncards(arr)", "from sys import stdin\r\nfrom math import sqrt, gcd, log10, log, ceil, floor\r\ndef ii(): return int(stdin.readline())\r\ndef mi(): return map(int, stdin.readline().split())\r\ndef li(): return list(mi())\r\ndef si(): return stdin.readline()\r\nn=ii()-1\r\na=li()\r\nb=[i for i in range(1, n+2)]\r\na=list(zip(a, b))\r\na.sort()\r\ni=0\r\nwhile i<n:\r\n print(a[i][1], a[n][1])\r\n i+=1\r\n n-=1", "k=int(input())\r\na=list(map(int,input().split()))\r\nd=(sum(a)*2)//k\r\nfor i in range(len(a)-1):\r\n for j in range(i+1,len(a)):\r\n if(a[i]+a[j]==d):\r\n print(i+1,j+1)\r\n a[i]=0\r\n a[j]=0\r\n break", "n = int(input()) \r\nl = list(map(int , input().split())) \r\ntarget = min(l) +max(l) \r\nfor i in range (n) : \r\n if l[i] < 0 : \r\n continue \r\n else : \r\n element1 = l[i] \r\n l[i] = -1 \r\n element2 = l.index(target - element1) +1 \r\n print(i+1 , element2) \r\n l[element2-1] = -1 \r\n", "def answer():\r\n targ = int(input())\r\n a = [int(x) for x in input().split()]\r\n targ=sum(a)/len(a)*2\r\n \r\n i=0\r\n paired=[]\r\n while i<len(a):\r\n #print(paired)\r\n if i not in paired:\r\n j=i+1\r\n while j<len(a) and j!=i:\r\n if j not in paired:\r\n #print(a[i],a[j],sum([a[i],a[j]]),targ)\r\n if a[i]+a[j]==targ:\r\n paired.append(i)\r\n paired.append(j)\r\n print(i+1,j+1)\r\n break\r\n j+=1\r\n \r\n i+=1\r\nanswer()\r\n", "def solve():\r\n n = int(input())\r\n l = list(map(int,input().split()))\r\n i = j = 0\r\n d = {}\r\n s = sum(l) // (n/2)\r\n for i in range(n):\r\n if l[i] != -1:\r\n x = l[i]\r\n l[i] = -1\r\n temp = l.index(s - x)\r\n d[i] = temp\r\n l[temp] = -1\r\n for i,j in d.items():\r\n print(i+1,j+1)\r\n# n,c = map(int,input().split())\r\n# a = int(input())\r\n# b = int(input())\r\n# c = int(input())\r\n# l = list(map(int,input().split()))\r\n# s = input()\r\n# print(solve(n,c,l))\r\nsolve()\r\n\r\n\r\n\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\na = [0] + a\r\nhh = []\r\ng = []\r\nnumber = sum(a) // (n // 2)\r\nfor i in range(1, n + 1):\r\n for j in range(i, n + 1):\r\n if i != j:\r\n if a[i] + a[j] == number and i not in g and j not in g:\r\n hh += [[i] + [j]]\r\n g += [i] + [j]\r\nfor i in hh:\r\n for j in i:\r\n print(j, end=' ')\r\n print()\r\n", "import math\r\n#q=int(input())\r\nq=1\r\nfor _ in range(q):\r\n n=int(input())\r\n l=list(map(int,input().split()))\r\n req=sum(l)//(n//2)\r\n for i in range(len(l)-1):\r\n for j in range(i+1,len(l)):\r\n if l[i]+l[j]==req:\r\n print(i+1,j+1)\r\n l[j]=0\r\n break \r\n \r\n \r\n ", "n = int(input())\ns = list(map(int, input().split()))\nsum2 = int(sum(s) / (n/2))\ns1 = s[:]\nd = []\nq = []\nfor i in range(n):\n for j in range(i+1, n):\n if s[i] + s[j] == sum2 and i+1 not in q and j+1 not in q:\n d.append([i+1, j+1])\n q.append(i+1)\n q.append(j+1)\n break\nfor i in d:\n print(*i)\n\n", "n=int(input())\r\na=[int(i) for i in input().split()]\r\ns=0\r\nfor i in a:\r\n s+=i\r\ns//=(n//2)\r\nfor i in range(n):\r\n for j in range(n):\r\n if a[i]+a[j]==s and i!=j and a[i]!=-1 and a[j]!=-1:\r\n print(i+1, j+1)\r\n a[i], a[j]=-1, -1", "n = int(input())\r\nl = list(map(int,input().split()));s = []\r\nfor i in range(n):\r\n s.append([l[i],i+1])\r\ns.sort()\r\nfor i in range(n//2):\r\n print(s[i][1], s[-i-1][1])", "n = int(input())\r\narr = list(map(int, input().split()))\r\nidx = sorted(list(zip(arr, list(range(1,n+1)))))\r\ni=0; j=n-1\r\nwhile i<j:\r\n print(idx[i][1], idx[j][1])\r\n i+=1; j-=1\r\n", "n = int(input())\r\na = [int(x) for x in input().split()]\r\nb = sorted(a)\r\nj = -1\r\n\r\nfor i in range(len(a)//2):\r\n k = a.index(b[i])+1\r\n a[a.index(b[i])] = 0\r\n l = a.index(b[j])+1\r\n a[a.index(b[j])] = 0\r\n j-=1\r\n print(k,l)\r\n", "n = int(input())\r\nm = list(map(int, input().split()))\r\na = list(m)\r\na.sort(reverse = True)\r\nfor i in range(n // 2):\r\n\tb = m.index(a[0])\r\n\tm[b] = None\r\n\tc = m.index(a[-1])\r\n\tm[c] = None\n\tprint(b + 1, c + 1)\r\n\ta = a[1:-1]\r\n", "n=int(input())\r\nx=[int(w) for w in input().split()]\r\na=n//2\r\ny=sum(x)//a\r\nm=[]\r\nfor i in range(n):\r\n\tfor j in range(n):\r\n\t\tif i!=j and x[i]+x[j]==y and i not in m and j not in m:\r\n\t\t\tprint(i+1,j+1)\r\n\t\t\tm.append(i)\r\n\t\t\tm.append(j)", "n=int(input())\nl=[*map(int,input().split())]\nindex=[]\nfor i in range(n):\n index.append(i+1)\nfor i in range(n-1,0,-1):\n for j in range(i):\n if l[j]>l[j+1]:\n l[j],l[j+1]=l[j+1],l[j]\n index[j],index[j+1]=index[j+1],index[j]\nfor i in range(n//2):\n print(index[i],index[n-i-1])", "\n\ndef give_cards(n, cards):\n result = []\n\n cards_copy = cards[:]\n\n for i in range(1, n):\n sum = cards_copy[0][1] + cards_copy[i][1]\n\n if cards_copy[0][1] >= cards_copy[i][1]:\n result.append([1, i+1])\n else:\n result.append([i + 1, 1])\n\n cards_copy.pop(0)\n cards_copy.pop(i-1)\n\n j = 1\n while cards_copy and j <= len(cards_copy)-1:\n\n if cards_copy[0][1] + cards_copy[j][1] == sum:\n\n if cards_copy[0][1] >= cards_copy[j][1]:\n result.append([cards_copy[0][0], cards_copy[j][0]])\n\n elif cards_copy[0][1] < cards_copy[j][1]:\n result.append([cards_copy[j][0], cards_copy[0][0]])\n\n cards_copy.pop(0)\n cards_copy.pop(j-1)\n j = 1\n\n else:\n j += 1\n\n if cards_copy:\n result = []\n cards_copy = cards[:]\n else:\n break\n\n return result\n\n\nif __name__ == '__main__':\n\n n = int(input())\n cards = list([int(i) for i in input().split(' ')])\n\n enum_cards = []\n for i in range(1, n+1):\n enum_cards.append([i, cards[i-1]])\n # n = 6\n # cards = [[1, 1], [2, 2], [3, 3], [4, 4], [5, 3], [6, 5]]\n\n for first, second in give_cards(n, enum_cards):\n print(first, second)\n", "n=int(input())\r\na=[int(x) for x in input().split()]\r\nk=sum(a)//(n//2)\r\ncheck=[0]*(n)\r\nfor i in range(0,n):\r\n if check[i]==0:\r\n for j in range(i+1,n):\r\n if check[j]==0 and check[i]==0:\r\n if a[i]+a[j]==k:\r\n check[i]=1\r\n check[j]=1\r\n print(i+1,j+1)", "n = int(input())\r\nlis = tuple(map(int,input().split()))\r\na = list(lis)\r\n\r\nnew = list(lis) \r\nnew.sort()\r\n\r\nfor x in range(n//2):\r\n ind1 = a.index(new[x])\r\n a[ind1] = 0\r\n ind2 = a.index(new[n-x-1])\r\n a[ind2] = 0\r\n print(ind1+1 ,ind2+1)", "a=int(input())\r\nb=list(map(int, input().split()))\r\nc=[]\r\nfor i in range(a):\r\n c.append([b[i],i])\r\nc. sort()\r\nfor i in range(a//2):\r\n print(str(c[i][1]+1)+\" \"+str(c[a-1-i][1]+1))\r\n \r\n \r\n \r\n ", "n = int(input())\r\nnum = list(map(int,input().split(\" \")))\r\nnums = num.copy()\r\nl=[]\r\nfor i in range(n//2):\r\n l.append((min(nums),max(nums)))\r\n del nums[nums.index(min(nums))]\r\n del nums[nums.index(max(nums))]\r\n\r\nfor i in range(n//2):\r\n print(num.index(l[i][0])+1,end=\" \")\r\n num[num.index(l[i][0])] = 0\r\n print(num.index(l[i][1])+1)\r\n num[num.index(l[i][1])] = 0\r\n\r\n ", "a = int(input())\r\ns = [int(x) for x in input().split()]\r\ns1 = sorted(s)\r\nfor i in range(a // 2):\r\n print(s.index(s1[i]) + 1, end=\" \")\r\n s[s.index(s1[i])] = 0\r\n print(s.index(s1[a - i - 1]) + 1)\r\n s[s.index(s1[a - i - 1])] = 0", "n=int(input())\r\na=list(map(int,input().split()))\r\ns=(sum(a)/n)*2\r\nfor i in range(n):\r\n\tfor j in range (i+1,n):\r\n\t\tif a[i]+a[j]==s:\r\n\t\t\tprint(i+1,j+1)\r\n\t\t\ta[i]=0\r\n\t\t\ta[j]=0\r\n\t\t\tbreak", "n = int(input())\r\na = list(map(int, input().split()))\r\n# \"Прикрепляем\" к каждой карте её номер\r\nfor i in range (len(a)):\r\n a[i]=(a[i],i+1)\r\n# Сортируем\r\na.sort(reverse=True)\r\n# Печатаем попарно индекс первого и последнего элемента\r\nfor i in range(n // 2):\r\n print (a[i][1], a[(-i-1)][1])", "\r\n\r\ndef main():\r\n n = int(input())\r\n cards = list(map(int, input().split()))\r\n total_sum = sum(cards)\r\n per_person_sum = int(total_sum*2/n)\r\n\r\n for i in range(n):\r\n if cards[i]!=0:\r\n for j in range(i+1,n):\r\n if cards[i]+cards[j] ==per_person_sum:\r\n print(i+1,j+1)\r\n cards[j] = 0\r\n break\r\n\r\nif __name__ == \"__main__\":\r\n main()", "# Wadea #\r\n\r\nimport copy\r\n\r\ns = int(input())\r\nm = list(map(int, input().split()))\r\nl = m.copy()\r\nl.sort()\r\nlst = []\r\na = 0\r\nb = -1\r\nfor j in range(int(s/2)):\r\n aa = m.index(l[a])\r\n m[m.index(l[a])] = \"\"\r\n bb = m.index(l[b])\r\n m[m.index(l[b])] = \"\"\r\n lst.append(str(aa+1)+\" \"+str(bb+1))\r\n a += 1\r\n b -= 1\r\nprint(*lst)", "n=int(input())\r\nnum=list(map(int,input().split()))\r\nfor i,e in enumerate(num):\r\n num[i]=(i+1,e)\r\nnum.sort(key=lambda x:x[1])\r\ni=0\r\nj=len(num)-1\r\nwhile i<j:\r\n print(num[i][0],num[j][0])\r\n i+=1\r\n j-=1", "n=int(input())\r\nl=list(map(int,input().split(\" \")))\r\ns=sum(l)//(n/2)\r\nfor i in range(n):\r\n for j in range(i+1,n):\r\n if l[j]!=0:\r\n if l[i]+l[j]==s:\r\n print(i+1,j+1)\r\n l[i]=0\r\n l[j]=0", "# IT-programmer\nn = int(input())\nv = n\nN = n // 2\nx = list(map(int, input().split()))\navg = sum(x) // N\nfor i in range(len(x)):\n\tfor j in range(v):\n\t\tif sum([i + 1, j + 1]) > 0 and i != j:\n\t\t\tif x[i] + x[j] == avg:\n\t\t\t\tprint(i + 1, j + 1)\n\t\t\t\tx[i] = 0\n\t\t\t\tx[j] = 0\n\t\t\t\tbreak\n", "n=int(input())\r\ncards=list(map(int,input().split()))\r\nx=int(sum(cards)/(n/2))\r\nvisited=[False]*n\r\nfor i in range(len(cards)-1):\r\n for j in range(i+1,len(cards)):\r\n if x==cards[i]+cards[j] and visited[j]==False and visited[i]==False:\r\n ipair=j\r\n visited[i] = True\r\n visited[ipair] = True\r\n print(i + 1, ipair + 1)\r\n break", "n = int(input())\r\na = list(map(int, input().split()))\r\nt = list(zip(a, list(range(1, len(a) + 1))))\r\nt.sort(key=lambda x: x[0])\r\nfor i in range(n // 2):\r\n print(t[i][1], t[-i - 1][1])", "n=int(input())\r\na=list(map(int,input().split()))\r\nb=[]\r\nfor i in range(n):\r\n a1=[a[i],i]\r\n b.append(a1)\r\nb.sort()\r\nfor i in range(n//2):\r\n print(b[i][1]+1,end=\" \")\r\n print(b[n-i-1][1]+1)", "'''input\r\n6\r\n1 5 7 4 4 3\r\n'''\r\n\r\nfrom collections import defaultdict\r\n \r\nn = int(input())\r\ncards = [int(c) for c in input().split()]\r\n \r\n_sum = sum(cards) // (len(cards) // 2)\r\n \r\npos = defaultdict(list)\r\nfor i, e in enumerate(cards, 1):\r\n pos[e].append(i)\r\n \r\nfor k, v in pos.items():\r\n while pos[k]:\r\n print(pos[k].pop(), pos[_sum - k].pop())\r\n", "z=int(input())\r\nx=list(map(int,input().split()))\r\nf=sorted(x)\r\na=-1\r\nfor c in range(z//2):\r\n q=x.index(f[c])+1\r\n x[x.index(f[c])]=0\r\n w=x.index(f[a])+1\r\n x[x.index(f[a])]=0\r\n \r\n print(q,w)\r\n a-=1", "n=int(input())\r\nl=list(map(int,input().split()))\r\n\r\na = sorted([l[i], i+1] for i in range(n))\r\nfor i in range(n//2):\r\n print(a[i][1],a[-i-1][1])\r\n ", "n = int(input())\r\nl = list(map(int, input().split()))\r\ns = sum(l) // (n // 2)\r\n\r\nfor i in range(n):\r\n if l[i] != 0:\r\n for j in range(i+1, n):\r\n if l[i] + l [j] == s:\r\n print(i + 1,j + 1)\r\n l[i] = 0\r\n l[j] = 0\r\n\r\n", "n = int(input())\r\na = list(map(int, input().split(' ')))\r\na = [(i + 1, j) for i, j in enumerate(a)]\r\na = sorted(a, key=lambda t: t[1])\r\nfor i in range(n // 2):\r\n print(a[i][0], a[-i - 1][0])", "# import math\nfrom collections import Counter, deque, defaultdict\nfrom math import *\n\nfrom bisect import bisect_right\nmod = 1000000007\n\n\n# from functools import reduce\n# from itertools import permutations\n# import queue\n\n\n\ndef solve():\n n=int(input())\n l=list(map(int,input().split()))\n l1=[[ l[i], i+1] for i in range(n)]\n l1.sort()\n # print(l1)\n for i in range(n//2):\n print(l1[i][1],l1[~i][1])\n\n\n\n\n\n\n\n\n\n\n# t = int(input())\nt = 1\nfor num in range(t):\n # print(\"Case #{}: \".format(num + 1), end=\"\")\n solve()\n \t\t\t \t \t\t\t \t \t \t\t\t \t \t\t \t \t", "inp=int(input())\r\ncards=list(map(int, input().split()))\r\navrg=0\r\ncardsc=[]\r\ncord1=[]\r\ncord2=[]\r\n\r\ncardsc=cards.copy()\r\ncards.sort()\r\ncounter=0\r\nj=inp-1\r\n\r\nwhile counter<=inp//2+1 and j>=inp//2:\r\n cord1.append(cards[counter])\r\n cord2.append(cards[j])\r\n counter+=1\r\n j-=1\r\n\r\nanswer1=[]\r\nfor k in range (len(cord1)):\r\n for l in range (inp):\r\n if len(cord1)==len(answer1):\r\n break\r\n if cord1[k]==cardsc[l]:\r\n answer1.append(l+1)\r\n cardsc[l]=-1\r\nanswer2=[]\r\nfor k in range (len(cord2)):\r\n for l in range (inp):\r\n if cord2[k]==cardsc[l]:\r\n answer2.append(l+1)\r\n cardsc[l]=-1\r\n\r\nfor u in range (len(answer1)):\r\n print(answer1[u],answer2[u])\r\n\r\n\r\n", "num=int(input())\r\n\r\narr=[int(x) for x in input().split()][:num]\r\n\r\ns=sum(arr)\r\ns_n=int(s/(num/2))\r\n# print(s_n)\r\n\r\nfor i in range(0,len(arr)):\r\n if(arr[i]==-1):\r\n # print('skipped')\r\n continue\r\n else:\r\n a=arr[i]\r\n arr[i]=-1\r\n b=arr.index(s_n-a)\r\n arr[b]=-1\r\n print(i+1,b+1)\r\n # print(arr)\r\n a=0\r\n b=0", "n = int(input())\r\ncards = list(map(int, input().split()))\r\ntotal = sum(cards)\r\ntarget = 2 * total / n\r\npair_indexes = set()\r\n\r\nfor i in range(n):\r\n for j in range(i + 1, n): # Updated range\r\n if cards[i] + cards[j] == target and i+1 not in pair_indexes and j+1 not in pair_indexes:\r\n pair_indexes.add(i+1)\r\n pair_indexes.add(j+1)\r\n print(i+1, j+1)\r\n break\r\n", "n=int(input())\r\nl=sorted(zip(map(int,input().split()),range(1,1+n)))\r\nfor i in range(n>>1):\r\n print(l[i][1],l[-1-i][1])", "n=int(input())\r\nl=list(map(int,input().split()))\r\nm=n//2\r\ns=sum(l)//m\r\nfor i in range(n):\r\n for j in range(n):\r\n if(i!=j):\r\n if(l[i]+l[j]==s):\r\n print(i+1,j+1)\r\n l[i]=0\r\n l[j]=0\r\n", "# Author: S Mahesh Raju\r\n# Username: maheshraju2020\r\n# Date: 30/04/2020\r\n\r\nfrom sys import stdin,stdout\r\nfrom math import gcd, ceil, sqrt\r\nii1 = lambda: int(stdin.readline().strip())\r\nis1 = lambda: stdin.readline().strip()\r\niia = lambda: list(map(int, stdin.readline().strip().split()))\r\nisa = lambda: stdin.readline().strip().split()\r\nmod = 1000000007\r\n\r\nn = ii1()\r\narr = iia()\r\na = []\r\nfor i in range(n):\r\n a.append([arr[i], i + 1])\r\na.sort()\r\nfor i in range(n // 2):\r\n print(a[i][1], a[-(i + 1)][1])\r\n\r\n", "def main(number, n_list):\r\n\r\n n_list = [int(x) for x in n_list.split()]\r\n\r\n sorted_list = sorted(n_list)\r\n\r\n pairs = []\r\n\r\n for i in range(len(sorted_list)//2):\r\n pairs.append((sorted_list[i], sorted_list[-(i+1)]))\r\n \r\n output = []\r\n for x, y in pairs:\r\n x_idx = n_list.index((x))\r\n n_list[x_idx] = None\r\n y_idx = n_list.index((y))\r\n output.append((x_idx+1, y_idx+1))\r\n n_list[y_idx] = None\r\n \r\n for x,y in output:\r\n print(x,y)\r\n\r\n\r\nif __name__ == '__main__':\r\n number = input()\r\n n_list = input()\r\n\r\n main(number,n_list)# 1691151223.4137754", "a = int(input())\r\nl=sorted(zip(map(int,input().split()),range(1,a+1)))\r\nfor i in range(0,a//2):\r\n print(l[i][1],l[-1-i][1])", "\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\nn = int(input())\r\nl = list(map(int,input().split()))\r\na = []\r\nfor i in range(n):\r\n a.append([l[i],i+1])\r\na.sort()\r\nfor i in range(n//2):\r\n print(a[i][1],a[n-1-i][1])", "n = int(input())\r\ncards = [int(i) for i in input().split()]\r\nflag = [False for i in range(n)]\r\nval = 2*sum(cards)//n\r\n\r\nfor i in range(n):\r\n if not flag[i]:\r\n for j in range(i+1, n):\r\n if not flag[j] and cards[i] + cards[j] == val:\r\n print(i+1, j+1)\r\n flag[i], flag[j] = True, True\r\n break\r\n", "n=int(input())\r\na=list(map(int, input().split()))\r\nl=[]\r\nfor i in range(n):\r\n l.append(i+1)\r\nfor i in range(n):\r\n for j in range(i+1,n):\r\n if a[i]>a[j]:\r\n temp = a[i]\r\n a[i] = a[j]\r\n a[j] = temp\r\n tem=l[i]\r\n l[i]=l[j]\r\n l[j]=tem\r\nfor i in range(int(n/2)):\r\n print(l[i],end=\" \")\r\n print(l[n-1-i])", "N=int(input())\r\nl=input().split()\r\ns=sorted([(int(l[i]),i+1) for i in range(N)])\r\nfor i in range(N//2):\r\n print(s[i][1],s[-1-i][1])", "n = int(input())\r\ndata = sorted([(v, i) for i, v in enumerate(map(int, input().split()))])\r\nfor i in range(n // 2):\r\n print(data[i][1] + 1, data[-i - 1][1] + 1)\r\n", "def cards():\r\n a=int(input())\r\n b=list(map(int,input().split()))\r\n c=b.copy()\r\n c.sort()\r\n for i in range(len(b)//2):\r\n ans1=b.index(c[i])\r\n b[ans1]='a'\r\n ans2=b.index(c[-i-1])\r\n b[ans2]='a'\r\n print(ans1+1,ans2+1)\r\ncards()", "from typing import DefaultDict\r\n\r\n\r\nn = int(input())\r\na = [int(x) for x in input().split()]\r\nd = DefaultDict(list)\r\nmn = 1001\r\nmx = -1\r\nfor i in range(n):\r\n v = a[i]\r\n d[v].append(i + 1)\r\n if v > mx:\r\n mx = v\r\n if v < mn:\r\n mn = v\r\ns = mn + mx\r\nfor k in d:\r\n if d[k][0] != -1:\r\n lk = len(d[k])\r\n kn = lk - 1\r\n for i in range(lk >> ((k << 1) == s)):\r\n print(d[k][i], d[s - k][kn - i])\r\n d[k][0] = -1\r\n d[s - k][0] = -1", "#701A (57No. Problem A)\r\n\r\nn = int(input())\r\ncards = list(map(int,input().split()))\r\ntotal = min(cards) + max(cards)\r\npairs = []\r\n\r\nfor i in range(len(cards)):\r\n if (i in pairs):\r\n continue\r\n else:\r\n pairs.append(i) \r\n for j in range(i+1,len(cards)):\r\n if j in pairs:\r\n continue\r\n elif (cards[i] + cards[j] == total):\r\n pairs.append(j) \r\n print(i+1,j+1)\r\n break\r\n ", "n = int(input())\r\nl = list(map(int,input().split()))\r\ns = sum(l)\r\nans = s//(n//2)\r\nfor i in range(n):\r\n if l[i]!=-1:\r\n for j in range(i+1,n):\r\n if l[j]==ans-l[i]:\r\n print(i+1,j+1)\r\n l[i],l[j]=-1,-1\r\n break\r\n ", "n=int(input());r=[*map(int,input().split())];d=[]\r\nfor i,e in enumerate(r):d.append([e,i+1])\r\nd.sort()\r\nfor j in range(n//2):print(d[j][1],d[n-j-1][1])\r\n", "x = int(input())\r\nlst = list(map(int,input().split()))\r\nls1 = sorted(lst)\r\nfor i in range(len(lst)//2):\r\n q1 = lst.index(ls1[i])\r\n lst[q1]=\"N\"\r\n q2 = lst.index(ls1[-i-1])\r\n lst[q2]=\"N\"\r\n print(q1+1,q2+1)\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 operator\r\nimport sys\r\n\r\ninput = sys.stdin.readline\r\n\r\ndef solve():\r\n n = int(input())\r\n A = list(map(int, input().split()))\r\n B = deque(sorted(range(1, n + 1), key=lambda i: A[i - 1]))\r\n\r\n for _ in range(n // 2):\r\n print(B.popleft(), B.pop())\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()", "n=int(input())\r\n# a=[]\r\n# for i in range(1):\r\na=[(list(map(int,input().split())))]\r\n# for i in (a):\r\n# print(i)\r\nb=[]\r\nc=0\r\nd=0\r\ne=[]\r\nf=[]\r\nfor i in range(1):\r\n for j in range(n):\r\n for k in range(n):\r\n # print(a[i][j],a[i][k])\r\n b.append(a[i][j]+a[i][k])\r\n # print((a[i][j]+a[i][k]),b.count(a[i][j]+a[i][k]))\r\n if b.count(a[i][j]+a[i][k])>=c:\r\n c=b.count(a[i][j]+a[i][k])\r\n d=(a[i][j]+a[i][k])\r\n # print(c,d)\r\nfor i in range(1):\r\n for j in range(n):\r\n for k in range(j+1,n):\r\n if a[i][j]+a[i][k]==(d)and j not in e and k not in e:\r\n e.append(j)\r\n e.append(k)\r\n print(j+1,k+1)\r\n# print(d)", "n=int(input())\r\nl=[int(i) for i in input().split()]\r\ns=sum(l)//(n//2)\r\nfor i in range(n):\r\n for j in range(i+1,n):\r\n if l[i]+l[j]==s:\r\n l[i]=l[j]=0\r\n print(i+1,j+1)\r\n break", "# import sys\r\n# sys.stdin=open(\"input.in\",\"r\")\r\n# sys.stdout=open(\"output.out\",\"w\")\r\n\r\nn=int(input())\r\nl=[[int(i),0] for i in input().split()]\r\nfor i in range(n):\r\n l[i][1]=i+1\r\nl.sort()\r\nfor i in range(n//2):\r\n print(l[i][1],l[n-i-1][1])\t\t\t\t\t\r\n", "n = int(input())\r\nl = input().split()\r\nb = sorted([(int(l[i]),i+1) for i in range(n)])\r\n# print(b)\r\n\r\nfor i in range(n // 2):\r\n print(b[i][1], b[-1-i][1])", "n = int(input())\na = list(map(int, input().split()))\nx = []\n\nfor i in range(n):\n x.append([a[i],i])\n\nx = sorted(x, key = lambda x: x[0])\n\nfor i in range(n//2):\n print(x[i][1]+1,x[n-i-1][1]+1, sep = \" \")", "n=int(input())\na=list(map(int,input().split()))\nt=int((sum(a)/n)*2)\ne=[]\ns=0\n\nfor i in range(n-1):\n if i not in e:\n print (i+1,end=' ')\n s=i+1\n e.append(i)\n while True:\n if a[i]+a[s]==t and (s not in e) :\n e.append(s)\n print(s+1)\n break\n else:\n s+=1\n \n\n \n\n\n\n \n", "n = int(input())\r\nx = list(map(int, input().split()))[:n]\r\nsum_matrix = 0\r\nmiddle = sum(x) // (n // 2)\r\nfor i in range(n):\r\n if type(x[i]) is int:\r\n for j in range(n):\r\n if x[j] == middle - x[i] and i != j:\r\n print(i + 1, j + 1)\r\n x[i] = '*'\r\n x[j] = '*'\r\n break\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 operator\r\nimport sys\r\n\r\ninput = sys.stdin.readline\r\n\r\ndef solve():\r\n n = int(input())\r\n A = list(map(int, input().split()))\r\n\r\n players = n // 2\r\n target = sum(A) // players\r\n locs = defaultdict(list)\r\n for i, x in enumerate(A, 1):\r\n locs[x].append(i)\r\n\r\n ans = []\r\n for x in locs:\r\n while len(locs[x]) > 0:\r\n y = target - x\r\n ans.append([locs[x].pop(), locs[y].pop()])\r\n\r\n for pair in ans:\r\n print(*pair)\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()", "n=int(input())\r\na=list(map(int,input().split()))\r\nx=sum(a)*2//n\r\nfor i in range(n):\r\n\tfor j in range(n):\r\n\t\tif a[i]+a[j]==x and i!=j:\r\n\t\t\tprint(i+1,j+1)\r\n\t\t\ta[i]=0\r\n\t\t\ta[j]=0", "n=int(input())\r\nl=list(map(int,input().split()))\r\nl1=[]\r\nfor i in range(n):\r\n\tl1.append((l[i],i))\r\nl1.sort()\r\nfor i in range(n//2):\r\n\tprint(l1[i][1]+1,l1[-1-i][1]+1)", "n=int(input())\r\na=list(map(int,input().split()))\r\nli=[]\r\nfor i in range(n):\r\n li.append([a[i],i+1])\r\nli.sort()\r\nleft=0\r\nright=n-1\r\nwhile right>left:\r\n print(li[left][1],li[right][1])\r\n right-=1\r\n left+=1\r\n\r\n", "def main():\n\tn = int(input())\n\tx = list(map(int,input().split()))\n\teach_sum = sum(x)/(n//2)\n\tfor i in range(len(x)):\n\t\tfor j in range(i+1,len(x)):\n\t\t\tif x[i] +x[j] == each_sum and x[j] !=0:\n\t\t\t\tprint(i+1,j+1)\n\t\t\t\tx[j] =0\n\t\t\t\tbreak\nmain()\n", "n = int(input())\r\na = list(map(int,input().split()))\r\np = n // 2\r\ns = max(a)+min(a)\r\nfor i in range(n):\r\n for j in range(n-1, -1, -1):\r\n if a[i] + a[j] == s:\r\n print(i+1, j+1)\r\n a[i] = 0\r\n a[j] = 0\r\n elif a[i] == 0 or a[j] == 0:\r\n continue", "from copy import deepcopy\r\nn=int(input())\r\na=(list(map(int,input().split())))\r\nb=[]\r\ns=sum(a)/(n/2)\r\nfor i in a:\r\n for j in a:\r\n if i+j==s:\r\n print(a.index(i)+1,end=\" \")\r\n a.insert(a.index(i), 0)\r\n a.pop(a.index(i))\r\n print(a.index(j)+1)\r\n a.insert(a.index(j), 0)\r\n a.pop(a.index(j))\r\n", "# 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\nss = max(ll)+min(ll)\r\ndone = []\r\nwhile len(done)<n:\r\n for i in range(n):\r\n for j in range(i+1, n):\r\n if ll[i]+ll[j]==ss and j not in done and i not in done:\r\n done.append(j)\r\n done.append(i)\r\n print(i+1,j+1)\r\n break", "n=int(input())\r\narr=list(map(int,input().split()))\r\nlis=arr[:]\r\nlis.sort()\r\np1=0\r\np2=-1\r\nfor i in range(n//2):\r\n if arr.index(lis[p1])==arr.index(lis[p2]):\r\n x=arr.index(lis[p1])\r\n z=arr.index(lis[p2],x+1)\r\n else:\r\n x=arr.index(lis[p1])\r\n z=arr.index(lis[p2])\r\n print(x+1,z+1)\r\n arr.pop(x)\r\n arr.insert(x,\"?\")\r\n arr.pop(z)\r\n arr.insert(z,\"?\")\r\n p1+=1\r\n p2-=1", "# cf 701 A 800\nn = int(input())\nA = [*zip(map(int, input().split()), range(1, n + 1))]\nA.sort(key=lambda x: x[0])\ni, j = 0, len(A) - 1\nwhile i < j:\n print(A[i][1], A[j][1])\n i += 1\n j -= 1\n", "n = int(input())\r\nl = list(map(int, input().split()))\r\ns = int(sum(l) / (n/2))\r\nd=[]\r\nfor i in range(n):\r\n if l[i]<0:\r\n continue\r\n for j in range(n):\r\n if l[j]<0:\r\n continue\r\n if l[i]+l[j]==s and i!=j:\r\n d.append((i+1, j+1))\r\n l.pop(i)\r\n l.insert(i,-100)\r\n l.pop(j)\r\n l.insert(j,-100)\r\n break\r\nfor i in d:\r\n print(*i)\r\n", "import sys\r\nimport math\r\n\r\ninput = sys.stdin.readline\r\n\r\n\r\n############ ---- Input Functions ---- ############\r\ndef inp():\r\n return (int (input ()))\r\n\r\n\r\ndef inlt():\r\n return (list (map (int, input ().split ())))\r\n\r\n\r\ndef insr():\r\n s = input ()\r\n return list (s[:len (s) - 1])\r\n\r\n\r\ndef invr():\r\n return (map (int, input ().split ()))\r\n\r\n\r\nn = inp()\r\nli = inlt()\r\nli2 = li.copy()\r\nli2.sort()\r\nans = li2[0] + li2[n - 1]\r\nfor i in range(len(li)):\r\n for j in range(i + 1, len(li)):\r\n if (li[i] + li[j]) == ans:\r\n print(i+1, j+1)\r\n li[j] = ans + 10000\r\n break\r\n", "n, a = int(input()), list(map(int, input().split()))\r\n\r\nx = (2 * sum(a)) // n\r\n\r\nfor i in range(n // 2):\r\n\twhile not a[-1]:\r\n\t\ta.pop()\r\n\tal = a[-1]\r\n\tp2 = a.index(x - al)\r\n\tprint(len(a), p2 + 1)\r\n\ta.pop()\r\n\ta[p2] = 0\r\n", "from math import *\r\nfor _ in range(1):\r\n n=int(input())\r\n a=list(map(int,input().split()))\r\n b=[]\r\n for i in range(n):\r\n b.append([a[i],i+1])\r\n b.sort()\r\n i=0\r\n j=n-1\r\n while(i<j):\r\n print(b[i][1],b[j][1])\r\n i+=1\r\n j-=1\r\n", "n, a = int(input()),sorted((int(x), i + 1) for i, x in enumerate(input().split()))\r\nfor i in range(n//2):print(a[i][1],a[n-i-1][1])", "a=int(input())\r\nb=list(map(int,input().split()))\r\nsum=min(b)+max(b)\r\nfor i in range(len(b)):\r\n\tfor j in range(i,len(b)-1):\r\n\t\tif b[i]+b[j+1]==sum:\r\n\t\t\tprint(i+1,j+2,sep=' ')\r\n\t\t\tb[i],b[j+1]=0,0\r\n\t\t\tbreak", "n = int(input())\nls = [int(i) for i in input().split()]\n\nlscopy = ls.copy()\n\nlscopy.sort()\n\ni = 0\nwhile(i<n//2):\n print(ls.index(lscopy[i])+1,end=\" \")\n ls[ls.index(lscopy[i])] = -999\n print(ls.index(lscopy[n-i-1])+1)\n ls[ls.index(lscopy[n-i-1])] = -999\n i+=1", "n = int(input())\r\na = input()\r\narr1 = a.split()\r\narr = []\r\navg = 0\r\nfor i in arr1:\r\n arr.append(int(i))\r\n avg += int(i)\r\nppl = n // 2\r\navg = avg // ppl \r\n\r\ndicts = {}\r\ncounts = {}\r\nindex = 0\r\nfor i in arr:\r\n index += 1 \r\n if i not in dicts:\r\n dicts[i] = []\r\n dicts[i].append(index)\r\n counts[i] = []\r\n counts[i].append(index)\r\n else:\r\n dicts[i].append(index)\r\n counts[i].append(index)\r\n\r\nans = []\r\nfor key, value in dicts.items():\r\n arrt = counts[key]\r\n if len(arrt) == 0:\r\n continue \r\n diff = avg - key\r\n ar = len(counts[key])\r\n at = counts[key]\r\n while ar >0 :\r\n diff = avg - key\r\n if diff == key:\r\n g = at[0]\r\n ty = at[1]\r\n ans.append((g,ty))\r\n at = at[2:]\r\n ar = len(at)\r\n else:\r\n g = at[0]\r\n at = at[1:]\r\n ar = len(at)\r\n ty1 = counts[diff]\r\n ty = ty1[0]\r\n counts[diff] = ty1[1:]\r\n ans.append((g,ty))\r\n\r\nstrs = \"\" \r\nfor i in ans:\r\n strs += str(i[0]) + \" \" + str(i[1]) \r\n print(strs)\r\n strs = \"\"\r\n\r\n ", "n = int(input())\r\nc = [int(i) for i in input().split()]\r\ng = 0\r\nfor i in c:\r\n g += i\r\ng = g // (n//2)\r\nfor i in range(n):\r\n for j in range(i+1, n):\r\n if c[i] + c[j] == g:\r\n print(i+1, j+1)\r\n c[i] = -1\r\n c[j] = -1\r\n break\r\n", "n = int(input())\r\na = list(map(int,input().split()))\r\neq = sum(a)//(n//2)\r\nfor i in range(n-1):\r\n\tl = a[i]\r\n\tfor k in range(i+1,n):\r\n\t\tr = a[k]\r\n\t\tif r != 0 and r + l == eq:\r\n\t\t\ta[k] = 0\r\n\t\t\tprint(i+1,k+1)\r\n\t\t\tbreak", "n=int(input())\r\nnum=list(map(int,input().split()))\r\nj=1\r\ntotal=[]\r\nfor i in num:\r\n total.append([i,j])\r\n j+=1\r\ntotal=sorted(total,key= lambda x:x[0])\r\nf=int(n/2)\r\nfor i in range(f):\r\n print(total[i][1],total[n-1-i][1])", "n = int(input())\r\ncards = list(map(int, input().split()))\r\na = []\r\nfor i in range(n):\r\n a.append([cards[i], i])\r\na.sort(key=lambda x: x[0])\r\nfor i in range(n // 2):\r\n x, y = a[i][1], a[n - i - 1][1]\r\n print(str(x + 1) + ' ' + str(y + 1))\r\n", "n=int(input())\r\nb=list(map(int,input().split()))\r\nL=sorted([[b[i],str(i+1)] for i in range(n)])\r\nfor i in range(n//2):print(L[i][1],L[-i-1][1])", "n=int(input())\r\nl=sorted(zip(map(int, input().split()), range(1,n+1)))\r\nfor i in range(n//2):\r\n print(l[i][1], l[-1-i][1])", "n = int(input())\r\narr = list(map(int, input().split()))\r\ntarget = sum(arr) // (n // 2)\r\ntrack = []\r\nans = []\r\nfor i in range(len(arr)):\r\n base = []\r\n count = 0\r\n if i + 1 not in track and i + 1 not in base:\r\n diff = abs(target - arr[i])\r\n base.append(i + 1)\r\n track.append(i + 1)\r\n count += 1\r\n for e in range(len(arr)):\r\n if arr[e] == diff and e + 1 not in track and e + 1 not in base:\r\n base.append(e + 1)\r\n track.append(e + 1)\r\n count += 1\r\n if count == 2:\r\n ans.append(base)\r\n break\r\nfor i in ans:\r\n print(*i)\r\n\r\n\r\n\r\n", "n=int(input())\r\nA=tuple(enumerate(map(int,input().split()),1))\r\nA=tuple(sorted(A,key=lambda A:A[1]))\r\nfor i in range(n//2):\r\n print(A[i][0],A[n-1-i][0])\r\n \r\n \r\n \r\n", "def check(lis, j):\r\n for yu in lis:\r\n \r\n if j == yu:\r\n return 0\r\n return 1\r\n\r\nn = int(input())\r\nli = list(map(int, input().split()))\r\nsu = int(sum(li)/(n/2))\r\nlis = []\r\ni = 0\r\nwhile len(li)>0:\r\n \r\n j = len(li)\r\n \r\n while j>i:\r\n j = j-1\r\n \r\n if li[i] + li[j] == su:\r\n \r\n if len(lis) == 0:\r\n \r\n lis.append(i+1)\r\n lis.append(j+1)\r\n break\r\n if check(lis, j+1):\r\n \r\n lis.append(i+1)\r\n lis.append(j+1)\r\n break\r\n \r\n i = i+1\r\n if len(lis) == n:\r\n \r\n break\r\n\r\nfor ig in range(0, n, 2):\r\n print(lis[ig], lis[ig+1])\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\na=sorted(l)\r\nfor i in range(n//2):\r\n c=l.index(a[i])\r\n l[c]=-1\r\n d=l.index(a[n-1-i])\r\n l[d]=-1\r\n print(c+1,d+1)", "n = int(input())\r\ns = list(map(int, input().split()))\r\ndif = 2 * sum(s) // n\r\nt = []\r\nfor i in range(n):\r\n for j in range(n):\r\n if s[i] + s[j] == dif and i not in t and j not in t and i != j:\r\n print(i + 1, j + 1)\r\n t.append(i)\r\n t.append(j)\r\n \r\n", "q=[]\r\ndef findIndex(w,dic):\r\n index=-1\r\n while(index==-1):\r\n for i in dic.keys():\r\n if dic[i]==w and i not in q:\r\n index=i\r\n q.append(i)\r\n break\r\n return index\r\ninput()\r\nq=[]\r\ns=list(map(int,input().split()))\r\ndic={}\r\nfor i in range(len(s)):\r\n dic[i+1]=s[i]\r\n\r\nw=sorted(s)\r\nans=[]\r\ni=0\r\nj=len(s)-1\r\n\r\nwhile i<=j:\r\n index1=findIndex(w[i],dic)\r\n index2=findIndex(w[j],dic)\r\n ans.append([index1,index2])\r\n i+=1\r\n j-=1\r\n\r\nfor i in ans:\r\n print(str(i[0])+\" \"+str(i[1]))\r\n\r\n\r\n\r\n", "n = int(input())\r\na = list(map(int,input().split()))\r\nsym = 0\r\nfor i in a:\r\n sym+=i\r\nsym = sym//(n//2)\r\nfor i in range(n):\r\n for j in range(n):\r\n if i!=j:\r\n if a[j]==sym-a[i]:\r\n a[j]=-1\r\n a[i]=-1\r\n print(i+1,j+1,sep=' ')\r\n break", "n = int(input())\na = list(map(int, input().split(\" \")))\nb = [{ \"index\": 0, \"value\": 0}]*n\nfor i in range(n):\n b[i] = { \"index\": i+1, \"value\": a[i]}\n\nb.sort(key=lambda k: k['value'])\nfor i in range(n//2):\n print(b[i]['index'], b[n-i-1]['index'])\n", "v=int(input());v1=list(map(int,input().split()));w=sum(v1);w1=w//(v//2);c=0\r\nfor i in v1:\r\n for j in v1:\r\n if c<v//2:\r\n if i+j ==w1:\r\n print(v1.index((i))+1,end=\" \");v1[v1.index((i))]=0;print(v1.index((j))+1);v1[v1.index(j)]=0;c+=1;break\r\n\r\n\r\n", "n = int(input())\r\nlst = list(map(int, input().split()))\r\ndc = {i+1: x for i, x in enumerate(lst)}\r\nlst = [(k,v) for k, v in dc.items()]\r\nlst.sort(key=lambda x: x[1])\r\nres = [f'{lst[k][0]} {lst[n-1-k][0]}' for k in range(n//2)]\r\nprint(\"\\n\".join(res))\r\n", "def solve(test):\r\n n = int(input())\r\n a = list(map(int, input().split()))\r\n s = sum(a) * 2 // n\r\n for i in range(n):\r\n for j in range(i + 1, n):\r\n if a[i] + a[j] == s:\r\n print(i + 1, j + 1)\r\n a[j] = 10 ** 10\r\n break\r\nt = 1\r\n#t = int(input())\r\nfor _ in range(t):\r\n solve(_ + 1)", "n=int(input())\r\nar=list(map(int,input().split()))\r\nt=max(ar)+min(ar)\r\nfor i in range(len(ar)-1):\r\n for j in range(i+1,len(ar)):\r\n if ar[i]+ar[j]==t:\r\n print(i+1,j+1)\r\n ar[i]=0\r\n ar[j]=0\r\n ", "n = int(input())\r\na = list(map(int,input().split()))\r\n\r\nb = a.copy()\r\nb.sort()\r\n\r\nfor i in range(int(n/2)):\r\n cc = a.index(b[i])+1\r\n a[a.index(b[i])] = 0\r\n bb = a.index(b[-1])+1\r\n a[a.index(b[-1])] = 0\r\n b.remove(b[-1])\r\n print(cc,bb)\r\n\r\n\r\n\r\n\r\n\r\n\r\n# В колоде карт есть n карт (n — чётное число). На каждой карте написано целое положительное число.\r\n# В новую карточную игру будут играть n / 2 человек. Каждому из игроков перед началом игры будет роздано ровно по две\r\n# карты, причём каждая карта из колоды будет роздана ровно одному игроку.\r\n\r\n# Перед вами стоит задача найти такой способ раздачи карт, чтобы у каждого из игроков сумма чисел,\r\n# написанных на полученных им картах, совпадала. Гарантируется, что входные данные таковы, что это всегда возможно.\r\n#\r\n# Входные данные:\r\n# В первой строке входных данных записано целое положительное число n (2 ≤ n ≤ 100) — количество карт.\r\n# Гарантируется, что n чётно.#\r\n\r\n# Во второй строке следует последовательность из n целых положительных чисел a1, a2, ..., an (1 ≤ ai ≤ 100),\r\n# где ai равно числу, написанному на i-й карте.\r\n#\r\n# Выходные данные:\r\n# Выведите n / 2 пар целых чисел, по одной паре в строке — номера карт, которые нужно отдать каждому игроку.\r\n# Каждая карта должна быть роздана ровно одному игроку. Карты нумеруются в том же порядке,\r\n# в котором описываются во входных данных, начиная с единицы. Гарантируется, что входные данные таковы,\r\n# что ответ всегда существует. Если возможных правильных ответов несколько, разрешается вывести любой из них.\r\n\r\n# Примеры:\r\n\r\n# входные данные:\r\n# 6\r\n# 1 5 7 4 4 3\r\n\r\n# выходные данные:\r\n# 1 3\r\n# 6 2\r\n# 4 5\r\n# ----------------------\r\n# входные данные:\r\n# 4\r\n# 10 10 10 10\r\n\r\n# выходные данные:\r\n# 1 2\r\n# 3 4\r\n\r\n# Примечание:\r\n# В первом примере карты распределены таким образом, что у каждого из игроков сумма чисел равна 8.\r\n#\r\n# Во втором примере все значения ai равны между собой. Следовательно, любое разбиение на пары является\r\n# правильным ответом.", "n = int(input())\r\na = input().split()\r\nb = sorted([(int(a[i]), i + 1) for i in range (n)])\r\nfor i in range (int(n / 2)):\r\n print (b[i][1], b[-i - 1][1])", "n = int(input())\r\na = list(map(int, input().split()))\r\na = list(zip(a, range(1, n + 1)))\r\na.sort()\r\nfor i in range(n>>1):\r\n print(\"{0} {1}\".format(a[i][1], a[-i-1][1]))", "#!/usr/bin/python3\nimport sys\ninput = lambda: sys.stdin.readline().strip()\nn = int(input())\na = sorted([(int(x), i) for i, x in enumerate(input().split(), start=1)])\nfor i in range(n // 2):\n print(a[i][1], a[-i-1][1])\n", "n = int(input())\r\na = list(map(int, input().split()))\r\n\r\ntmp = sorted(a)\r\nfor mini, maxi in zip(tmp[:n//2], reversed(tmp[n//2:])):\r\n id_min = a.index(mini)\r\n a[id_min] = \".\"\r\n id_max = a.index(maxi)\r\n a[id_max] = \".\"\r\n\r\n print(id_min+1, id_max+1)\r\n\r\n\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\r\n/////////////////////////////////////////\r\n// //\r\n// Coded by brownfox2k6 //\r\n// //\r\n/////////////////////////////////////////\r\n\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"", "n=int(input())\r\nlist1=list(map(int,input().split()))\r\nlist2=list1+[]\r\nlist2.sort()\r\nfor i in range(0,n//2):\r\n p=list1.index(list2[i])\r\n list1[p]=-1\r\n q=list1.index(list2[n-i-1])\r\n list1[q]=-1\r\n print(p+1,q+1)\r\n \r\n ", "n = int(input())\r\nM = list(map(int,input().split()))\r\nfor i in range(n):\r\n M[i] = [M[i], i + 1]\r\nM.sort()\r\nfor i in range(n//2):\r\n print(M[i][1], M[n - i - 1][1])", "n=input()\r\nn=int(n)\r\nx=[int(x) for x in input().split()]\r\nf=int(sum(x)/(n/2))\r\nsl=[0 for x in range(n)]\r\nfor y in range(n):\r\n if sl[y]==1:\r\n continue\r\n sl[y]=1\r\n for k in range(n):\r\n if x[y]+ x[k]==f and sl[k]==0 :\r\n sl[k]=1\r\n print(y+1,end=\" \")\r\n print(k+1)\r\n break\r\n\r\n", "n = int(input())\r\nl = sorted(list(enumerate(input().split())), key=lambda x: int(x[1]))\r\nleft = 0\r\nright = n-1\r\nwhile left < right:\r\n print(l[left][0]+1, l[right][0]+1) \r\n left+=1 \r\n right-=1", "n = int(input())\r\na = []\r\nj = 1\r\nfor i in input().split():\r\n a.append([int(i), j])\r\n j+=1\r\na.sort()\r\n#print(*a)\r\nfor i in range(n//2):\r\n print(a[i][1], a[-i-1][1])", "n=int(input())\r\nl=list(map(int,input().split()))\r\na=sum(l)//(n//2)\r\nfor i in range(n):\r\n if l[i]==\"*\":\r\n continue\r\n for j in range(i+1,n):\r\n if l[j]=='*':\r\n continue\r\n elif l[i]+l[j]==a:\r\n print(i+1,j+1)\r\n l[i]='*'\r\n l[j]='*'\r\n break\r\n \r\n \r\n ", "n=int(input())\r\nl=list(map(int,input().split()))\r\nx,y,ans=[],[],[]\r\ny.append(0)\r\ny.append(0)\r\nx.append(y)\r\ny=[]\r\nfor i in range(n):\r\n y.append(l[i])\r\n y.append(i+1)\r\n x.append(y)\r\n y=[]\r\nx.sort()\r\nfor i in range(1,n//2+1):\r\n y.append(x[i][1])\r\n y.append(x[-i][1])\r\n ans.append(y)\r\n y=[]\r\nfor i in range(n//2): \r\n print(*ans[i])", "n = int(input())\r\na = list(map(int, input().split()))\r\ntarget = sum(a) // (n // 2)\r\nvisited = [False] * n\r\nfor i in range(n):\r\n if not visited[i]:\r\n for j in range(i + 1, n):\r\n if not visited[j] and a[i] + a[j] == target:\r\n print(i + 1, j + 1)\r\n visited[i] = True\r\n visited[j] = True\r\n break\r\n", "from collections import defaultdict\r\nn = int(input())\r\narr = list(map(int, input().split()))\r\nidx = defaultdict(lambda : [])\r\n\r\nfor i in range(n):\r\n idx[arr[i]].append(i+1)\r\n\r\ntarget = max(arr)+min(arr)\r\n\r\nfor num in idx:\r\n while idx[num]:\r\n print(idx[num].pop(0), idx[target-num].pop(0))\r\n", "n = int(input())\r\ncards = list(map(int, input().split(\" \")))\r\n\r\nhand = min(cards) + max(cards)\r\nfound = {}\r\npairs = []\r\nfor i in range(n):\r\n\tif found.get(i, 0) == 1:\r\n\t\tcontinue\r\n\tfor j in range(i+1,n):\r\n\t\tif found.get(j, 0) == 1:\r\n\t\t\tcontinue\r\n\t\tif cards[i] + cards[j] == hand:\r\n\t\t\tfound[i] = 1\r\n\t\t\tfound[j] = 1\r\n\t\t\tpairs.append((i+1,j+1,))\r\n\t\t\tbreak\r\nfor pair in pairs:\r\n\tprint(str(pair[0]) + \" \" + str(pair[1]) )", "n=int(input())\r\nlist1=list(map(int,input().split(\" \")))\r\nw=sum(list1)//(n>>1)\r\nfor j in range(n):\r\n if list1[j]!=None:\r\n q=list1[j]\r\n list1[j]=None\r\n p=list1.index(w-q)+1\r\n print(j+1,p)\r\n list1[p-1]=None\r\n \r\n ", "num = int(input())\r\nlist = [int(x) for x in input().split(\" \")]\r\nlist_1 = list.copy()\r\nlist_1.sort()\r\nsum = list_1[-1]+list_1[-2]\r\nwhile sum>0:\r\n dic = {}\r\n count = 0\r\n for i in range(num):\r\n test = sum-list[i]\r\n if test not in list:\r\n break\r\n else:\r\n for m in range(num):\r\n if list[m]==test and (m+1 not in dic.keys() and m!= i and i+1 not in dic.values() and m+1 not in dic.values() and i+1 not in dic.keys()):\r\n dic[i+1] = m+1\r\n count+=1\r\n break\r\n\r\n if count==int(num/2):\r\n break\r\n sum-=1\r\nfor key, value in dic.items():\r\n print(key, value)\r\n\r\n", "n = int(input())\r\na = zip(list(map(int,input().split())), range(1, n + 1))\r\na = sorted(a, key = lambda x : x[0])\r\nfor i in range(n//2):\r\n print(a[i][1], a[n - 1 - i][1])", "n = int(input())\r\na = list(map(int,input().split()))\r\nsa = sum(a)/(n/2)\r\nb = []\r\nfor i in range(len(a)):\r\n for j in range(len(a)):\r\n if i != j:\r\n if a[i] + a[j] == sa:\r\n print(i+1,j+1)\r\n a[i] = 0\r\n a[j] = 0", "n=int(input())\r\nlist=[int(i) for i in input().split()]\r\ntemp=list.copy()\r\ntemp.sort()\r\nfor i in range(int(n/2)):\r\n for j in range(0,n):\r\n if(temp[i]==list[j]):\r\n list[j]=-1\r\n break\r\n print(j+1,end=\" \")\r\n for j in range(0,n):\r\n if(temp[n-1-i]==list[j]):\r\n list[j]=-1\r\n break\r\n print(j+1) ", "n=int(input())\r\na=[int(i) for i in input().split()]\r\nd,b=dict(),[]\r\nfor i in range(n):\r\n d[a[i]]=i+1 \r\nfor i in a:\r\n b.append(i)\r\nb.sort() \r\n#print(b)\r\n#print(a[n-0])\r\nfor i in range(n//2):\r\n p=a.index(b[i])\r\n a[p]=-1\r\n q=a.index(b[n-i-1])\r\n a[q]=-1\r\n print(p+1,q+1)\r\n \r\n ", "n = int(input())\ncards_number = [i + 1 for i in range(n)]\ncards = input().split(' ')\nfor i in range(n):\n cards[i] = int(cards[i])\nfor i in range(n // 2):\n mx = cards_number[cards.index(max(cards))]\n cards_number.remove(cards_number[cards.index(max(cards))])\n cards.pop(cards.index(max(cards)))\n mn = cards_number[cards.index(min(cards))]\n cards_number.remove(cards_number[cards.index(min(cards))])\n cards.pop(cards.index(min(cards)))\n print(str(mx) + ' ' + str(mn))", "n = int(input())\r\ncards = [int(i) for i in input().split()]\r\ncards2 = []\r\nfor i in cards:\r\n cards2.append(i)\r\ncards2.sort()\r\nfor i in range((n//2)):\r\n ans = \"\"\r\n ans += str(cards.index(cards2[i]) + 1)\r\n cards[cards.index(cards2[i])] = 0\r\n ans += \" \" + str(cards.index(cards2[n - i - 1]) + 1)\r\n cards[cards.index(cards2[n - i - 1])] = 0\r\n print(ans)\r\n \r\n", "from collections import deque\n\ndq = deque(maxlen=int(input()))\na = enumerate(map(int, input().split()))\ndq.extend(sorted(a, key=lambda x:x[1]))\nwhile dq:\n\tprint(dq.pop()[0]+1,end=' ')\n\tprint(dq.popleft()[0]+1)\n", "n = int(input()) \r\ncards = [[int(j),i] for i,j in enumerate(input().split())]\r\ncards.sort(key = lambda item : item[0])\r\nend = n - 1\r\nfor i in range(n//2) :\r\n print(cards[i][1]+1,cards[end][1]+1)\r\n end -= 1", "import sys\r\n\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\ndata = sorted(zip(list(range(n)), list(map(int, input().split()))), key=lambda x: x[1])\r\n\r\nfor i in range(n // 2):\r\n print(data[i][0] + 1, data[-(i + 1)][0] + 1)", "n = int(input())\r\na = list(map(int, input().split()))\r\ntmp = (sum(a) // (n // 2))\r\nm = []\r\nif n == 2:\r\n print(1, 2)\r\n exit()\r\nfor i in range(0, n):\r\n if i in m:\r\n continue\r\n else:\r\n for j in range(i + 1, n):\r\n if j in m:\r\n continue\r\n if a[i] + a[j] == tmp:\r\n print(i + 1, j + 1, sep=' ')\r\n m.append(i)\r\n m.append(j)\r\n break\r\n", "n = int(input())\r\na = input().split()\r\nx = 0\r\nb = []\r\nfor i in range(n):\r\n a[i] = int(a[i])\r\n x += a[i]\r\n b += [i + 1]\r\nx //= n // 2\r\nz = 0\r\nfor i in range(n // 2):\r\n z = a[0]\r\n for j in range(1 , n - 2 * i):\r\n if a[j] + z == x:\r\n print(b[0] , b[j])\r\n c = j\r\n break\r\n a = a[1:c] + a[c + 1:]\r\n b = b[1:c] + b[c + 1:]\r\n \r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\np=[]\r\ns=sum(l)//(n//2)\r\nfor i in range(n):\r\n t=1\r\n for j in range(len(p)):\r\n if l[i]+p[j][0]==s:\r\n print(i+1,p[j][1]+1)\r\n t=0\r\n p.remove(p[j])\r\n break\r\n if t:\r\n p.append([l[i],i])\r\n", "y=int(input())\r\nlst=list(map(int,input().split()))\r\nc=sum(lst)//(y//2)\r\ni=0\r\nmst=[]\r\nwhile lst.count(0)!=y:\r\n if(lst[i]!=0):\r\n d=c-lst[i]\r\n lst[i]=0\r\n e=lst.index(d)\r\n lst[e]=0\r\n mst.append((i+1,e+1))\r\n i+=1\r\nfor i in mst:\r\n print(*i,sep=' ')", "\r\nn = int(input())\r\nl = list(map(int, input().split()))\r\nlp = []\r\nsu = sum(l) \r\nto = su // (n // 2)\r\n\r\nfor i in range(n):\r\n\tfor j in range(i + 1, n):\r\n\t\tif l[i] + l[j] == to:\r\n\t\t\tprint(i + 1, j + 1)\r\n\t\t\tl[i] = 0\r\n\t\t\tl[j] = 0\r\n\t\t\t", "n=int(input())\r\na=list(map(int,input().split()))\r\nmx=max(a)\r\nlst=[]\r\nfor i in range(n):\r\n ind=a.index(min(a))\r\n lst.append(ind+1)\r\n a[ind]=mx+1\r\nfor i in range(n//2):\r\n print(lst[i],lst[n-i-1])\r\n", "n = int(input())\na = list(map(int, input().split()))\nb = a.copy()\nb.sort()\nfor i in range(n//2):\n i1 = a.index(b[i])\n a[i1] = -1\n i2 = a.index(b[n-i-1])\n a[i2] = -1\n print(i1+1,i2+1)", "n=int(input())\na=[int(i) for i in input().split()]\nb=[]\nfor i in range(n):\n b.append([a[i],i+1])\nb.sort()\nfor i in range(n//2):\n print(b[i][1],b[n-1-i][1])", "n=int(input())\r\nl=list(map(int,input().split()))\r\ns=list(l)\r\ns.sort(reverse=True)\r\ns1=s[0]+s[len(s)-1]\r\nfor i in range(0,n):\r\n for j in range(0,n):\r\n if i!=j and l[i]!=0:\r\n if l[i]+l[j]==s1:\r\n print(i+1,j+1)\r\n l[i]=0\r\n l[j]=0", "n = int(input())\r\nl = list(map(int, input().split()))\r\nl_sum = sum(l)\r\np_sum = 2*l_sum//n\r\nd = [None]*101\r\nfor i in range(n):\r\n c_diff = p_sum-l[i]\r\n if d[c_diff] == None or len(d[c_diff]) == 0:\r\n if d[l[i]] == None:\r\n d[l[i]] = [i]\r\n else:\r\n d[l[i]].append(i)\r\n else:\r\n idx = d[c_diff].pop()\r\n print(i+1, idx+1)\r\n", "def main():\r\n n = int(input())\r\n a = [int(i) for i in input().split()]\r\n card_sum = sum(a)//(n//2)\r\n counter = 0\r\n for i in range(len(a)):\r\n for j in range(i+1, len(a)):\r\n if a[i] + a[j] == card_sum:\r\n print(i+1, j+1)\r\n a[i] = 0\r\n a[j] = 0\r\n break\r\n\r\n\r\nmain()", "n=int(input())\r\nl=input().split()\r\ns=sorted([(int(l[i]),i+1) for i in range(n)])\r\nfor i in range(n//2):\r\n print(s[i][1],s[-1-i][1])", "import operator\r\nn = int(input())\r\narr = [int(x) for x in input().split()]\r\nd = {}\r\nfor i in range(n): d[i+1] = arr[i]\r\ndn = sorted(d.items(), key=operator.itemgetter(1))\r\nfor i in range(n//2): print(dn[i][0], dn[n-i-1][0])\r\n", "a = int(input())\r\nl = list(map(int,input().split()))\r\nav = sum(l) // (a//2)\r\nres = []\r\nfor i in range(len(l)):\r\n for j in range(i+1,len(l)):\r\n if l[i] + l[j] == av and i not in res and j not in res:\r\n print(i+1,j+1)\r\n res.append(i)\r\n res.append(j)", "import sys\r\ninput = sys.stdin.readline\r\n\r\n############ ---- Input Functions ---- ############\r\ndef inp():\r\n return(int(input()))\r\ndef inlt():\r\n return(list(map(int,input().split())))\r\ndef insr():\r\n s = input()\r\n return(list(s[:len(s) - 1]))\r\ndef invr():\r\n return(map(int,input().split()))\r\n\r\n\r\ndef solve(n, a):\r\n som = sum(a) * 2//n\r\n for _ in range(n//2):\r\n i = 0\r\n while a[i] == 0:\r\n i += 1\r\n for j in range(1, n):\r\n if i != j and a[i] + a[j] == som:\r\n print(str(i + 1) + \" \" + str(j + 1))\r\n a[i] = 0\r\n a[j] = 0\r\n break\r\n\r\n\r\ndef output():\r\n n = inp()\r\n a = inlt()\r\n solve(n, a)\r\n\r\n\r\n\r\n\r\n\r\noutput()", "n = int(input())\r\ns = list(map(int,input().split()))\r\nc=0\r\np=[s[0]]\r\nfor j in range(1,n):\r\n if(s[j] not in p):\r\n p.append(s[j])\r\n else:\r\n c+=0.00001\r\n p.append(s[j]+c)\r\n \r\nb = sorted(p)\r\n\r\nfor i in range(n//2):\r\n print((p.index(b[i])+1),(p.index(b[n-1-i])+1))\r\n", "n=int(int(input()));l=list(map(int,input().split()))\r\nb=sorted([(l[i],i+1) for i in range(n)])\r\nfor i in range(n//2):print(b[i][1],b[n-i-1][1])", "n = int(input())\r\ncl = list(map(int,input().split()))\r\navb = {i for i in range(n)}\r\na = []\r\nfor i in range(n):\r\n for j in range(n):\r\n if i != j and cl[i] + cl[j] == 2*sum(cl)//n and i in avb and j in avb:\r\n avb.discard(i)\r\n avb.discard(j)\r\n a.append(f'{i+1} {j+1}')\r\nprint('\\n'.join(a))", "n = int(input())\r\nlst = list(map(int, input().split()))\r\nfor i in range(n):\r\n lst[i] = [lst[i], i+1]\r\nlst.sort()\r\n\r\nfor i in range(n//2):\r\n print(lst[i][1], lst[n-i-1][1])", "n=int(input())\r\nList=list(map(int,input().split(' ')))\r\nnumDict={}\r\nfor index,value in enumerate(List):\r\n numDict[index]=value\r\nnumList=sorted(numDict.items(),key=lambda x:x[1])\r\nfor i in range(int(n/2)):\r\n a=numList[i][0]\r\n b=numList[-(i+1)][0]\r\n print(str(a+1)+' '+str(b+1))\r\n", "n = int(input())\r\ncards = list(map(int, input().split()))\r\nindexes = [i for i in range(1,n+1)]\r\n\r\n# Sorting the cards array\r\nfor i in range(n):\r\n for j in range(i, n):\r\n if cards[i] > cards[j]:\r\n temp = cards[i] \r\n cards[i] = cards[j]\r\n cards[j] = temp \r\n\r\n temp2 = indexes[i]\r\n indexes[i] = indexes[j]\r\n indexes[j] = temp2\r\n\r\nfor i in range(n//2):\r\n print(\"%d %d\"%(indexes[i], indexes[-(i+1)]))\r\n", "n=int(input())\r\nt=[int(x) for x in input().split()]\r\na=sorted([t[i], i+1] for i in range(n))\r\nfor i in range(n//2):print(a[i][1],a[-i-1][1])", "n = int(input())\r\nl = list(map(int, input().split()))\r\nl1 = []\r\nfor i in l:\r\n l1.append(i)\r\nl1.sort()\r\nisk = sum(l1) // (n // 2)\r\nb = []\r\nwhile len(l1) > 0:\r\n x = l1.pop()\r\n y = isk - x\r\n l1.remove(y)\r\n b.append(x)\r\n b.append(y)\r\nd = []\r\nfor i in range(n):\r\n for j in range(len(l)):\r\n if b[i] == l[j]:\r\n if not j in d:\r\n d.append(j)\r\n break\r\nwhile len(d) > 0:\r\n x = d.pop(0)\r\n y = d.pop(0)\r\n print(x+1, y+1)\r\n# print(d)\r\n# print(l.sort())\r\n# print(l)\r\n# print(b)\r\n", "b=[]\r\nn=int(input())\r\na=[int(i) for i in input().split()]\r\nfor i in range(n):\r\n b.append([a[i],i+1])\r\nb=sorted(b)\r\nfor i in range(int(n/2)):\r\n print(b[i][1],b[len(b)-1-i][1])", "n = int(input())\r\narray = list(map(int, input().split()))\r\nl_i = list()\r\nfor i in range(n):\r\n l_i.append(i + 1)\r\narrayi = sorted(zip(array, l_i))\r\n\r\nfor i in range(n // 2):\r\n print(\"%d %d\" % (arrayi[i][1], arrayi[len(arrayi) - 1 - i][1]))", "n = int(input())\r\nb=n//2\r\na = list(map(int, input().split()))\r\nc=sum(a)//b\r\nfor i in range(n):\r\n for j in range(n):\r\n if a[i]+a[j]==c and i!=j:\r\n print(i+1,j+1,end=\" \")\r\n a[i]=0\r\n a[j]=0\r\n break", "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\r\nn = int(input())\r\n\r\narr=get_array()\r\n\r\nma = max(arr)\r\nmi = min(arr)\r\n\r\ns = ma+mi\r\ncheck= [False]*n\r\n\r\n\r\nfor i in range(0,n):\r\n \r\n if(check[i]==False):\r\n check[i] = True\r\n k=s-arr[i] \r\n for j in range(0,n):\r\n if(k==arr[j] and i!=j and check[j]==False):\r\n check[j] = True\r\n print(1+i,j+1)\r\n break\r\n \r\n \r\n", "n = int(input())\r\ncards = list(map(int, input().split()))\r\nindex = list(range(1, n + 1))\r\n\r\nfor i in range(n // 2):\r\n min_index = cards.index(min(cards))\r\n cards.pop(min_index)\r\n print(index.pop(min_index), end=' ')\r\n\r\n max_index = cards.index(max(cards))\r\n cards.pop(max_index)\r\n print(index.pop(max_index))\r\n", "import sys\r\nfrom math import sqrt, floor, factorial\r\nfrom collections import deque\r\ninp = sys.stdin.readline\r\nread = lambda: list(map(int, inp().strip().split()))\r\n\r\ndef solve():\r\n\tn = int(inp()); ans = \"\"\r\n\tarr = sorted(zip(read(), range(n)))\r\n\tfor i in range(n//2):\r\n\t\tans += str(arr[i][1]+1) + \" \" + str(arr[n-i-1][1]+1)+\"\\n\"\r\n\tprint(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\nif __name__ == \"__main__\":\r\n\tsolve()", "n=int(input())\r\n#n,k= map(int, input().split())\r\n#arr=sorted([i,j for i,j in enumerate(input().split())])\r\narr=list(map(int, input().split()))\r\nls=[]\r\nfor i in range(n):\r\n ls.append([arr[i],i+1])\r\n\r\nls=sorted(ls)\r\ni=0\r\nj=n-1\r\nwhile i<j:\r\n print(ls[i][1] ,ls[j][1])\r\n i+=1\r\n j-=1", "n = int(input()) // 2\nv = sorted([[x, i] for i, x in enumerate((map(int, input().split())), 1)])\nfor v1, v2 in zip(v[:n], v[:n - 1:-1]):\n print(v1[1], v2[1])\n", "n = int(input())\r\na = list(enumerate(map(int, input().split())))\r\na.sort(key=lambda x: x[1])\r\nfor i in range(n // 2):\r\n p = a[i]\r\n q = a[-i - 1]\r\n print(p[0] + 1, q[0] + 1)\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input().strip())\r\n\r\narr = map(int, input().split())\r\n\r\nsArr = sorted([(x, i+1) for i, x in enumerate(arr)])\r\noffset = 0\r\nfor person in range(n//2):\r\n print(sArr[n-1-offset][1], sArr[offset][1])\r\n offset += 1\r\n", "# import os\r\n\r\nn = int(input())\r\n\r\na = list(map(int, input().split()))\r\n \r\naa = sorted(a)\r\ns = aa[0] + aa[-1]\r\n\r\nindex = []\r\n\r\ni = 0\r\nwhile a:\r\n if a[i] == -1:\r\n i += 1\r\n else:\r\n to_find = s - a[i]\r\n ind = a.index(a[i])\r\n index.append(ind+1)\r\n a[i] = -1\r\n ind2 = a.index(to_find)\r\n index.append(ind2+1)\r\n a[ind2] = -1\r\n i += 1\r\n if list(set(a))[0] == -1:\r\n break\r\n\r\nfor i in range(0, len(index), 2):\r\n print(\"{} {}\".format(index[i],index[i+1]))\r\n\r\n\r\n# 04/01 - 21\r\n# 05/01 - 27\r\n# 06/01 - 28\r\n\r\n\r\n\r\n\r\n ", "n=int(input())\r\nY=sorted(zip(map(int,input().split()),range(1,1+n)))\r\nfor i in range(n>>1):print(Y[i][1],Y[-1-i][1])", "k = int(input())\r\narr = list(map(int, input().split()))\r\ni = 0\r\nrez = sum(arr) / k * 2\r\nzdez = {}\r\nfor i in range(k):\r\n if arr[i] not in zdez:\r\n zdez[arr[i]] = []\r\n zdez[arr[i]].append(i + 1)\r\nfor i in zdez:\r\n for j in zdez[i]:\r\n print(j, zdez[rez - i].pop())", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Wed Jun 3 07:47:28 2020\r\n\r\n@author: Harshal\r\n\"\"\"\r\n\r\n\r\nn=int(input())\r\nl=input().split() \r\n\r\ns=sorted([(int(l[i]),i+1) for i in range(n)])\r\nfor i in range(n//2):\r\n print(s[i][1],s[-1-i][1])", "#import sys\r\n#sys.stdin = open(\"input.in\",\"r\")\r\n#sys.stdout = open(\"test.out\",\"w\")\r\nn=int(input())\r\nl1= list(map(int,input().split()))\r\nl2 = sorted(l1)\r\nfor i in range(len(l1)//2):\r\n q1 = l1.index(l2[i])\r\n l1[q1]=\"N\"\r\n q2 = l1.index(l2[-i-1])\r\n l1[q2]=\"N\"\r\n print(q1+1,q2+1)", "n = int(input())\r\na = list(map(int, input().split()))\r\nb = sum(a)//(n//2)\r\nc = sorted(a)\r\nd = [0 for i in range(n)]\r\nfor i in range(n//2):\r\n\tx = b-c[i]\r\n\tfor j in range(n):\r\n\t\tif a[j] == x and d[j] == 0:\r\n\t\t\tz = j\r\n\t\t\td[j] = 1\r\n\t\t\tbreak\r\n\tfor j in range(n):\r\n\t\tif a[j] == c[i] and d[j] == 0:\r\n\t\t\ty = j\r\n\t\t\td[j] = 1\r\n\t\t\tbreak\r\n\tprint (z+1,y+1)", "a = int(input())\nn = [int(i) for i in input().split()][:a]\nr = sum(n)\ny = a/2\nt = r/y\nfor l in range(len(n)):\n\tif n[l]>0:\n\t\tfor k in range (l+1,len(n)+1):\n\t\t\tif n[l] + n[k]==t:\n\t\t\t\tn[l] = 0\n\t\t\t\tn[k] = 0\n\t\t\t\tprint(f\"{l+1} {k+1}\")\n\t\t\t\tbreak\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()))\nv = [(a[i], i + 1) for i in range(n)]\nv.sort()\nfor i in range(n // 2):\n print(v[i][1], v[n - i - 1][1])\n", "n = int(input())\r\nc = list(map(int,input().split()))\r\ntot = sum(c) // (n//2)\r\nb = [0]*len(c) \r\nfor i in range(n):\r\n if b[i] == 0:\r\n p = i + 1 + c[i+1:].index(tot - c[i])\r\n b[p] = 1\r\n b[i] = 1\r\n if c[i] <= c[p]:\r\n print(i+1, p+1) \r\n else:\r\n print(p+1, i+1)\r\n c[i] = -1\r\n c[p] = -1", "n = int(input())\r\nnumbers = list(map(int,input().split()))\r\nanswer = []\r\n\r\naverage = int(sum(numbers)/(n/2))\r\n\r\nfor i in range(n):\r\n for j in range(n):\r\n if numbers[i] + numbers[j] == average and i != j:\r\n print(i + 1, j + 1)\r\n numbers[i] = numbers[j] = 0\r\n break\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\na = list(map(int, input().split()))\r\nl = 105\r\nx = [[] for _ in range(l)]\r\nfor i in range(n):\r\n x[a[i]].append(i + 1)\r\ns = sum(a) // (n // 2)\r\nans = []\r\nfor i in range(l):\r\n while x[i]:\r\n u, v = x[i].pop(), x[s - i].pop()\r\n ans.append(\" \".join(map(str, (u, v))))\r\nsys.stdout.write(\"\\n\".join(ans))", "n = int(input())\narr = [int(_) for _ in input().split()]\nb = min(arr) + max(arr)\nl = []\n\nfor i in range(n):\n if arr[i] != 0:\n print(i+1, end=' ')\n v = arr[i]\n arr[i] = 0\n print(arr.index(b - v)+1, end='\\n')\n arr[arr.index(b - v)] = 0\n\n\n\n\n\n\n", "n = int(input())\r\nl = [int(i) for i in input().split()]\r\n\r\nfor i in range(n):\r\n l[i] = (l[i], i + 1)\r\nl.sort()\r\nfor i in range(n // 2):\r\n print(l[i][1], l[n - i - 1][1])", "n = int(input())\r\na = [int(i) for i in input().split()]\r\nb = []\r\nc = []\r\nx = 0\r\nmx = max(a)\r\nmn = min(a)\r\ns = mx + mn\r\nfor i in range(n):\r\n for j in range(i + 1, n):\r\n if a[i] + a[j] == s:\r\n if i + 1 not in b and j + 1 not in b:\r\n b.append(i + 1)\r\n b.append(j + 1)\r\nfor i in range(0, len(b), 2):\r\n c.append([])\r\n c[x].append(b[i])\r\n c[x].append(b[i + 1])\r\n x += 1\r\nfor i in range(len(c)):\r\n print(*c[i])\r\n", "n = int(input(''))\nnumbers = list(map(int, input('').split()))\nasarray = []\n\nfor i in range(len(numbers)):\n asarray.append([numbers[i], i+1])\n\nasarray = sorted(asarray)\nj = -1\nfor i in range(0, n//2):\n print(asarray[i][1], asarray[j][1])\n i = i+1\n j = j-1\n", "from sys import stdin, stdout\ndef read():\n\treturn stdin.readline().rstrip()\n\ndef read_int():\n\treturn int(read())\n \ndef read_ints():\n\treturn list(map(int, read().split()))\n \ndef solve():\n\tn=read_int()\n\ta=read_ints()\n\tb=sorted(zip(a, range(1, n+1)))\n\tfor i in range(n//2):\n\t\tprint(b[i][1], b[n-1-i][1])\n\nsolve()\n", "n = int(input())\r\n*a, = map(int, input().split(' '))\r\ns = []\r\nfor i in range(n):\r\n s.append([a[i], i + 1])\r\ns.sort()\r\nfor i in range(n // 2):\r\n print(s[i][1], s[n - i - 1][1])\r\n", "n = int(input())\ns = input().split()\nl = []\n\nd = {}\n\nfor i in s:\n l.append(int(i))\n\nfor i in range(len(l)):\n d[i] = l[i]\n\nl.sort()\nfor i in range(n//2):\n a = l[i]\n b = l[-1-i]\n for key in d:\n if d[key] == a:\n p = key\n d.pop(key)\n break\n\n for key in d:\n if d[key] == b:\n q = key\n d.pop(key)\n break\n\n print(p+1, q+1)\n\n\n\n\n\n\t\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\na2=[int(x) for x in range(1,n+1)]\r\n\r\nnew_a=list(map(lambda x,y:(x,y),a,a2))\r\nnew_a.sort()\r\n\r\nfor i in range(n//2):\r\n print(new_a[i][1],new_a[n-1-i][1],sep=' ')", "# Author : Ghulam Junaid\r\nlength = int(input())\r\nlist1 = list(map(int,input().split()))\r\nlist2 = []\r\nsumm = 0\r\nfor i in list1:\r\n summ+=i\r\navg = summ//(length//2)\r\nfor i in range(length):\r\n if i in list2:\r\n continue\r\n for j in range(i+1,length):\r\n if i in list2 or j in list2:\r\n continue\r\n if list1[i]+list1[j]==avg:\r\n print(i+1,j+1)\r\n list2.append(i)\r\n list2.append(j)\r\n continue", "n=int(input())\r\nl=list(map(int,input().split()))\r\nt=int(sum(l)/(n/2))\r\nw=[]\r\nfor i in range(n):\r\n\tfor j in range(i+1,len(l)):\r\n\t\tif i not in w:\r\n\t\t\tif j not in w:\r\n\t\t\t\tif l[i]+l[j]==t:\r\n\t\t\t\t\tw.append(i)\r\n\t\t\t\t\tw.append(j)\r\n\t\t\t\t\tprint(i+1,end=' ')\r\n\t\t\t\t\tprint(j+1)\r\n", "n=int(input())\r\nc=list(map(int,input().split()))\r\ns=sum(c)/(n/2)\r\nnp=[]\r\nfor i in range(int(n/2)):\r\n for j in range(n-1):\r\n for k in range(j+1,n):\r\n if c[j]+c[k]==s and j not in np and k not in np:\r\n np.append(j)\r\n np.append(k)\r\n print(j+1,k+1)\r\n", "a=int(input())\r\nl=list(map(int,input().split()))\r\nq=sum(l)/(a/2)\r\nfor i in range(a):\r\n for j in range(1,a):\r\n if l[i]+l[j]==q and i!=j:\r\n print(i+1,j+1)\r\n l[i]=0\r\n l[j]=0\r\n", "n=int(input())\r\na=list(map(int,input().strip().split(' ')))\r\nc=sum(a)//(n//2)\r\nans=[]\r\nfor i in range(n):\r\n for j in range(n):\r\n if i!=j and a[i]>0 and a[j]>0:\r\n if a[i]+a[j]==c:\r\n ans+=[[i+1,j+1]]\r\n a[i]=0\r\n a[j]=0\r\n\r\nfor x in ans:\r\n print(x[0],x[1])\r\n \r\n \r\n\r\n\r\n\r\n\r\n\r\n\r\n \r\n", "n=int(input())\na=[int(x) for x in input().split()]\na_i=[[a[x],x+1] for x in range(n)]\na_i.sort()\na_i[int(n/2):].sort(reverse=True)\nfor b in range(int(n/2)):\n\tprint(a_i[b][1],a_i[n-b-1][1])", "n = int(input())\r\nl = tuple(map(int, input().split()))\r\nl1 = [0] * n\r\nm = sum(l) // (n // 2)\r\nflag = True\r\nfor i in range(n):\r\n if l1[i] == 0:\r\n for j in range(i+1, n):\r\n if (l[i] + l[j]) == m and l1[j] == 0:\r\n print(i+1, j+1)\r\n l1[j] = 1\r\n break\r\n", "def solve(arr,n):\n arr_1 = list(range(n))\n for i in range(len(arr)):\n for j in range(i+1,len(arr)):\n if arr[i] >= arr[j]:\n arr[i], arr[j] = arr[j], arr[i]\n arr_1[i], arr_1[j] = arr_1[j],arr_1[i]\n for i in range(len(arr_1)//2):\n print(arr_1[i]+1, arr_1[n-1-i]+1)\n\ndef main():\n n = int(input())\n arr = list(map(int, input().split(' ')))\n solve(arr,n)\n\nmain()\n", "n = int(input())\r\na = input()\r\na = a.split(\" \")\r\nfor i in range(len(a)):\r\n\ta[i] = [ int(a[i]),i+1 ]\r\n#defaultly sorts by 1st element\r\na.sort()\r\n#print(type(len(a)))\r\nfor i in range( n//2 ):\r\n\tprint(a[i][-1],a[n-i-1][-1] )", "n = int(input())\r\na = list(map(int, input().split()))\r\nA = []\r\nfor i,c in enumerate(a):\r\n A.append((c,i+1))\r\nA.sort()\r\nfor i in range(n//2):\r\n print(A[i][1], A[n-1-i][1])\r\n", "n = int(input())\na = list(map(int, input().split()))\nfor i, j in enumerate(a):\n a[i] = (i, j)\na = sorted(a, key = lambda x: x[1])\nfor i in range(n // 2):\n print(a[i][0] + 1, a[n - 1 - i][0] + 1)", "n1 = int(input()) /2\r\nx = input().split()\r\nlist1 = []\r\nfor i in x:\r\n list1.append(int(i))\r\n\r\neach = sum(list1) / n1\r\n\r\nb1 = False\r\ncount = 0\r\nk1 = 0\r\nnot_tocheck = []\r\nwhile b1==False:\r\n remainder = each - list1[k1]\r\n index_next = 0\r\n for i in range(len(list1)):\r\n if list1[i] == remainder and i != k1:\r\n if i not in not_tocheck:\r\n index_next = i\r\n not_tocheck.append(k1)\r\n not_tocheck.append(i)\r\n break\r\n c1 = False\r\n print(k1+1,index_next+1)\r\n while c1==False:\r\n k1+=1\r\n if k1 not in not_tocheck:\r\n break\r\n if k1>=len(list1):\r\n break\r\n \r\n \r\n\r\n\r\n \r\n ", "n = int(input())\r\na = list(map(int, input().split()))\r\nb = max(a) + min(a)\r\nfor i in range(n):\r\n for j in range(n):\r\n if a[i] + a[j] == b and i != j:\r\n print(i + 1, j + 1)\r\n a.remove(a[i])\r\n a.insert(i, 0)\r\n a.remove(a[j])\r\n a.insert(j, 0)\r\n", "n=int(input())\r\nt=list(map(int, input().split()))\r\na=sorted([t[i], i+1] for i in range(n))\r\nfor i in range(n//2):print(a[i][1],a[-i-1][1])", "n = int(input())\r\nl_c = list(map(int, input().split()))\r\nl_i = list()\r\nfor i in range(n):\r\n l_i.append(i + 1)\r\nl_ci = sorted(zip(l_c, l_i))\r\n\r\nfor i in range(n // 2):\r\n print(\"%d %d\" % (l_ci[i][1], l_ci[len(l_ci) - 1 - i][1]))", "def solve():\r\n size = int(input())\r\n numbers = []\r\n i = 1\r\n \r\n for num in input().split():\r\n num = int(num)\r\n \r\n numbers.append((num, i))\r\n \r\n i += 1\r\n \r\n numbers.sort(key=lambda x: x[0])\r\n \r\n i = 0\r\n j = size - 1\r\n \r\n while i < j:\r\n print(numbers[i][1], numbers[j][1])\r\n i += 1\r\n j -= 1\r\n \r\n \r\nif __name__ == \"__main__\":\r\n solve()", "import sys\r\nimport math\r\nimport heapq\r\nfrom collections import defaultdict,Counter,deque\r\n \r\ninput = sys.stdin.readline\r\n \r\ndef I():\r\n return input()\r\n \r\ndef II():\r\n return int(input())\r\n \r\ndef MII():\r\n return map(int, input().split())\r\n \r\ndef LI():\r\n return list(input().split())\r\n \r\ndef LII():\r\n return list(map(int, input().split()))\r\n \r\ndef GMI():\r\n return map(lambda x: int(x) - 1, input().split())\r\n \r\ndef LGMI():\r\n return list(map(lambda x: int(x) - 1, input().split()))\r\n \r\ndef WRITE(out):\r\n return print('\\n'.join(map(str, out)))\r\n \r\ndef WS(out):\r\n return print(' '.join(map(str, out)))\r\n \r\ndef WNS(out):\r\n return print(''.join(map(str, out)))\r\n\r\n'''\r\nsort\r\nleft right\r\n\r\ncreate array with tuples (val,idx)\r\nsort by val\r\n\r\nfor i in range(len(cards)//2):\r\n print(cards[i][1], cards[n-1-i][1])\r\n\r\n'''\r\ndef solve():\r\n t = II()\r\n cards = LII()\r\n for i in range(t):\r\n cards[i] = (cards[i], i+1)\r\n cards.sort()\r\n for i in range(t//2):\r\n print(cards[i][1], cards[t-1-i][1])\r\n\r\nsolve()\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\ns = sum(a) * 2 // n\r\nb = []\r\nfor i in range(len(a)):\r\n for j in range(len(a)):\r\n if i != j and a[i] + a[j] == s and i not in b and j not in b:\r\n b.append(i)\r\n b.append(j)\r\n print(i + 1, j + 1)", "n=int(input())\r\na=list(map(int,input().split()))\r\ns=sum(a)\r\ns=s*2\r\nk=s//n\r\nans=[]\r\nfor i in range(0,n):\r\n\tif (i+1) not in ans:\r\n\t\tj=a[i]\r\n\t\ta[i]=\"op\"\r\n\t\tans.append(i+1)\r\n\t\tll=k-j\r\n\t\tind=a.index(ll)\r\n\t\tans.append(ind+1)\r\n\t\ta[ind]=\"op\"\r\ni=0\r\nwhile i<n:\r\n\tprint(ans[i],ans[i+1])\r\n\ti+=2", "def sort_key(x):\r\n return x[1]\r\n\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\na = list(enumerate(a, 1))\r\na = sorted(a, key=sort_key)\r\nfor i in range(n // 2):\r\n print(a[i][0], a[(-i - 1)][0])", "n = int(input())\r\na = list(map(int, input().split()))\r\na = [[a[i], i+1] for i in range(n)]\r\na.sort()\r\nfor i in range(n//2):\r\n print(a[i][1], a[n-i-1][1])", "n=int(input())\r\nz=list(map(int,input().split()))\r\nk=sum(z)//(n//2)\r\nl=[]\r\nvis=[0]*n\r\nfor i in range(n):\r\n for j in range(i+1,n):\r\n if(i!=j and z[i]+z[j]==k and vis[i]==0 and vis[j]==0):\r\n l.append([i+1,j+1])\r\n vis[i]=1\r\n vis[j]=1\r\nfor i in range(n//2):\r\n print(*(sorted(l[i])))", "import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,queue,copy\n\nsys.setrecursionlimit(10**7)\ninf=10**20\nmod=10**9+7\ndd=[(-1,0),(0,1),(1,0),(0,-1)]\nddn=[(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]\n\ndef LI(): return [int(x) for x in sys.stdin.readline().split()]\ndef LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]\ndef I(): return int(sys.stdin.readline())\ndef LS(): return sys.stdin.readline().split()\ndef S(): return input()\n\ndef main():\n n=I()\n l=LI()\n l2=[]\n\n for i,x in enumerate(l):\n l2.append([i,x])\n\n l2=sorted(l2,key=lambda x:x[1])\n\n for i in range(n//2):\n print(l2[i][0]+1,l2[n-i-1][0]+1)\n\nmain()\n# print(main())\n", "n=int(input())\r\nx=list(map(int, input().split()))\r\na=sorted([[x[i], i + 1] for i in range(n)])\r\nfor i in range(n//2):\r\n print(a[i][1], a[-i - 1][1])", "a = int(input())\r\nl = list(map(int, input().split()))\r\nx = sum(l)//(a//2)\r\ng = []\r\nfor i in range(a):\r\n k = []\r\n if l[i] != 0:\r\n k.append(i+1)\r\n t = l[i]\r\n l[i] = 0\r\n k.append(l.index(x-t)+1)\r\n l[l.index(x-t)] = 0\r\n g.append(k)\r\nfor j in range(len(g)):\r\n print(g[j][0], g[j][1])\r\n \r\n \r\n", "n=int(input())\r\ns=[int(i) for i in input().split()]\r\nans=[]\r\nt=min(s)+max(s)\r\nfor i in range(n):\r\n if (i+1) not in ans:\r\n print(i+1,end=' ')\r\n ans.append(i+1)\r\n for j in range(n):\r\n if s[j]==(t-s[i]) and (j+1) not in ans:\r\n print(j+1)\r\n ans.append(j + 1)\r\n break\r\n", "n=int(input())\r\na=[int(i) for i in input().split()]\r\nd=sum(a)\r\ne=d//(len(a)//2)\r\nm=[]\r\nc=0\r\nfor i in range(0,len(a)):\r\n for j in range(0,len(a)):\r\n if(a[i]+a[j]==e and j!=i and (i+1 not in m) and (j+1 not in m)):\r\n print(i+1,j+1)\r\n m.append(i+1)\r\n m.append(j+1)\r\n c=c+2\r\n# print(m)\r\n if(c==len(a)):\r\n break\r\n else:\r\n pass", "n = int(input())\r\narr = list(map(int, input().split()))\r\nc = []\r\nfor i in range(n):\r\n\tc.append(arr[i])\r\n\r\nc.sort()\r\nfor i in range(n // 2):\r\n\ta = arr.index(c[i])\r\n\tarr[a] = -1\r\n\tb = arr.index(c[n - i - 1])\r\n\t#print(a, b)\r\n\tprint(a + 1, b + 1)\r\n\tarr[b] = -1", "N=int(input())\r\nL=list(map(int,input().split()))\r\ny=sum(L)\r\ny=int(y/(N/2))\r\nfor i in range(N):\r\n\tfor j in range(i+1,N):\r\n\t\tif(L[i]+L[j]==y):\r\n\t\t\tL[i]=-10000\r\n\t\t\tL[j]=-10000\r\n\t\t\tprint(i+1,j+1)\r\n\t\t\tbreak", "n = int(input())\r\nt = list(map(int, input().split()))\r\nlist = []\r\nfor i in range(n):\r\n list.append((i+1,t[i]))\r\nlist.sort(key = lambda x:x[1])\r\nfor i in range(n//2):\r\n print(list[i][0], list[-i-1][0])", "class Carta:\n def __init__(self, valor, index):\n self.valor = valor\n self.index = index\n def __repr__(self):\n return '({}, {})'.format(self.valor, self.index)\n def __lt__(self, other):\n if self.valor == other.valor:\n return self.index < other.index\n else:\n return self.valor < other.valor\n\n\nn = int(input())\ncartas = list(map(int, input().split()))\nsoma_jogador = sum(cartas)//n\n\ncartas = [Carta(valor, index+1) for index, valor in enumerate(cartas)]\ncartas.sort()\n\nfor i in range(n//2):\n print(cartas[i].index, cartas[-i-1].index)\n", "n = int(input())\r\na = list(enumerate(map(int, input().split()), 1))\r\na.sort(key=lambda x: x[1])\r\n\r\nfor i in range(n//2):\r\n print(a[i][0], a[n-1-i][0])\r\n", "def main():\r\n n = input().split()\r\n data = list(map(int, input().split()))\r\n data = [(data[i], i+1) for i in range(len(data))]\r\n data.sort()\r\n for i in range(len(data)//2):\r\n print(data[i][1], data[len(data)-i-1][1])\r\nmain() \r\n", "n = int(input())\r\nw = [int(i) for i in input().split()]\r\na, w = list(zip(*sorted(zip(w, [i for i in range(1,n+1)]))))\r\n\r\nfor i in range(n//2):\r\n print(w[i], w[n-1-i])", "n=int(input())\r\nl=list(map(int,input().split()))\r\nm=max(l)+min(l)\r\na=[]\r\nfor i in range(n):\r\n\tif l[i]!=0:\r\n\t\tfor j in range(i+1,n):\r\n\t\t\tif l[i]+l[j]==m:\r\n\t\t\t\ta.append(i+1)\r\n\t\t\t\ta.append(j+1)\r\n\t\t\t\tl[i]=0\r\n\t\t\t\tl[j]=0\r\nfor i in range(0,n,2):\r\n\tprint(a[i],a[i+1])\t\t\t\t", "def main():\r\n n = int(input())\r\n temp_arr = list(map(int, input().split()))\r\n arr = []\r\n for i in range(n):\r\n element = temp_arr[i]\r\n arr.append((i + 1, element))\r\n arr.sort(key=lambda x: x[1])\r\n\r\n for i in range(n // 2):\r\n print(arr[i][0], arr[n - i - 1][0])\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "import math\n\nn = int(input())\na = input().split(\" \")\na = [int(i) for i in a]\nfor i in range(len(a)):\n a[i] = (a[i],i)\na.sort()\n# print(a)\nfor i in range(math.floor(len(a)/2)):\n print(a[i][1]+1,a[n-i-1][1]+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 = list(map(int, input().split()))\r\nl = []\r\nfor i in range(n):\r\n l.append((a[i], i + 1))\r\nl.sort()\r\nfor i in range(n // 2):\r\n print(l[i][1], l[n - 1 - i][1])\r\n", "n = int(input())\r\nk = [int(i) for i in input().split()]\r\np = []\r\nfor i in range(n):\r\n p.append([k[i], i])\r\np.sort()\r\nfor i in range(n//2):\r\n print(p[i][1]+1, p[-i-1][1]+1)\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\nb = sorted([a[i], i + 1] for i in range(n))\r\nfor i in range(n // 2):\r\n print(b[i][1], b[-i - 1][1])\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\nd = sum(a) // (n // 2)\r\nused = [True] * n\r\nans = []\r\nfor i in range(n):\r\n for j in range(i + 1, n):\r\n if used[i] and used[j] and a[i] + a[j] == d:\r\n used[i] = False\r\n used[j] = False\r\n ans.append((i + 1, j + 1))\r\n\r\nfor i in ans:\r\n print(i[0], i[1])\r\n", "n=int(input())\r\na=input()\r\na=a.split()\r\nfor i in range(n):\r\n a[i]=int(a[i])\r\nminn=101\r\nmaxx=0\r\nans=[]\r\nfor i in range(int(n/2)):\r\n ans=ans+[-1, -1]\r\n minn=101\r\n maxx=0\r\n for j in range(n):\r\n if(a[j]>maxx):\r\n maxx=a[j]\r\n ans[2*i]=j\r\n a[ans[2*i]]=int(-1)\r\n for j in range(n):\r\n if(a[j]<minn and a[j]!=(-1)):\r\n minn=a[j]\r\n ans[2*i+1]=j\r\n a[ans[2*i+1]]=int(-1)\r\nfor i in range(int(n/2)):\r\n print(ans[2*i]+1, \" \", ans[2*i+1]+1)", "n=int(input())\r\nl=list(map(int,input().split()))\r\na=max(l)+min(l)\r\nl2=l.copy()\r\nl2.sort()\r\n# print(l)\r\n# print(l2)\r\nfor i in range(n//2):\r\n\t# print(l)\r\n\tx=l.index(l2[i])\r\n\tl[x]=0\r\n\ty=l.index(abs(a-l2[i]))\r\n\tl[y]=0\r\n\tprint(x+1,y+1)", "n = int(input())\r\na = []\r\nind = 1\r\nfor i in input().split():\r\n\ti = int(i)\r\n\ta.append([i, ind])\r\n\tind += 1\r\na.sort(key = lambda el: el[0])\r\ncurA = 0\r\ncurB = n - 1\r\nfor x in range(n // 2):\r\n\tprint(a[curA][1], a[curB][1])\r\n\tcurA += 1\r\n\tcurB -= 1", "n = int(input())\nA = list(map(int, input().split()))\nfor i in range(n):\n A[i] = [A[i], i + 1]\nA.sort()\nfor i in range(n // 2):\n print(A[i][1], A[-i-1][1])", "n = int(input())\r\nl = list(map( int , input().split() ))\r\narr = l.copy()\r\narr.sort()\r\nj=0\r\nk=n-1\r\nfor i in range(n//2):\r\n x = l.index(arr[j])\r\n l.remove(arr[j])\r\n l.insert(x,0)\r\n y = l.index(arr[k])\r\n l.remove(arr[k])\r\n l.insert(y,0)\r\n print(x+1, y+1 )\r\n j = j+1\r\n k = k-1", "n=int(input(\"\"))\r\na=list(map(int,input().split(\" \")))\r\nav=(sum(a)/n)*2\r\nfor i in range(n):\r\n if (a[i] != 0):\r\n for j in range(n):\r\n if (a[i]+a[j]==av and i!=j):\r\n print(i+1,j+1,end=\"\\n\")\r\n a[i] = 0\r\n a[j] = 0", "class Help:\r\n\tdef __init__(self, index, value):\r\n\t\tself.index = index\r\n\t\tself.value = value\r\n\tdef __lt__(self, next):\r\n\t\treturn self.value < next.value\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\n\r\nhelp = [Help(i, a[i]) for i in range(n)]\r\nhelp.sort()\r\nfor _ in range(n//2):\r\n\tfirst = help.pop(0)\r\n\tlast = help.pop()\r\n\tprint(first.index + 1, last.index + 1)\r\n\t\r\n", "# I am confused about the problem. The editorial suggests solution in a way that looks like will include a lot of loops. I am intent on trying to watch how others solved it. Until then, the solution is not complete.\r\nimport sys\r\ndef get_list ():\r\n return list (map (int, sys.stdin.readline ().strip (). split ()))\r\nn = int (input ())\r\nli = get_list ()\r\nenum = []\r\nfor i in range (1, n + 1):\r\n enum.append (i)\r\nzipped = zip (li, enum)\r\nsorted_zipped = sorted (zipped, key = lambda t: t [0])\r\nfor j in range (n//2):\r\n print (sorted_zipped [j] [1], sorted_zipped [~j] [1])\r\n", "n = int (input ())\r\na = list (map (int, input ().split ()))\r\nsumma = sum (a)\r\notv = []\r\n\r\nfor i in range (n):\r\n x = 1\r\n if a[i] == 0:\r\n continue\r\n while a[i] + a[x] != summa / (n/2):\r\n x += 1\r\n else:\r\n if x == i:\r\n x += 1\r\n continue\r\n else:\r\n otv.append ([i+1, x+1])\r\n a[i] = 0\r\n a[x] = 0\r\n\r\nfor row in range (len (otv)):\r\n for grow in range (n // len (otv)):\r\n print (otv[row][grow], end = ' ')\r\n print ()\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "n = int(input())\r\na = []\r\nl = list(map(int, input().split()))\r\nfor i in range(len(l)-1):\r\n for j in range(i+1, len(l)):\r\n if l[i] + l[j] == sum(l)//(n//2):\r\n if i+1 not in a and j+1 not in a:\r\n a.append(i+1)\r\n a.append(j+1)\r\n break\r\ni = 0\r\nwhile i<len(a):\r\n print(a[i], a[i+1])\r\n i += 2", "n = int(input())\r\narr = list(map(int,input().split()))\r\narr2 = sorted(arr,reverse=True)\r\np1=[]\r\np2=[]\r\nfor i in range(n//2):\r\n ind = arr.index(arr2[i])\r\n p1.append(ind+1)\r\n arr[ind]=0\r\narr2.reverse()\r\nfor i in range(n//2):\r\n ind = arr.index(arr2[i])\r\n p2.append(ind+1)\r\n arr[ind]=0\r\nfor i in range(n//2):\r\n print(p1[i],p2[i])\r\n\r\n\r\n\r\n\r\n", "n = int(input())\na = [int(x) for x in input().split()]\nb = [[a[i], i] for i in range(n)]\nb.sort()\nfor i in range(n // 2):\n print(b[i][1] + 1, b[n - i - 1][1] + 1)\n", "n = int(input())\na = n * [0]\ni = 0\nx = list(map(int, input().split()))\nwhile i != n:\n for j in range(i + 1, n):\n if x[i] + x[j] == 2 * sum(x) // n and a[i] == 0 and a[j] == 0:\n a[i] = x[i]\n a[j] = x[j]\n print(i + 1, j + 1)\n break\n i += 1\n", "n = int(input())\r\nt = list(map(int, input().split()))\r\na = sorted([t[i], i+1] for i in range(n))\r\nfor i in range(n//2):\r\n print(a[i][1],a[-i-1][1])", "n=int(input())\r\nt=list(map(int,input().split()))\r\nminl=1000000000\r\nmaxl=-1\r\nfor i in t :\r\n\tminl=min(minl,i)\r\n\tmaxl=max(maxl,i)\r\nadd=minl+maxl\r\nli=[[]for i in range(105)]\r\nfor i in range(n) :\r\n\tif len(li[add-t[i]])>0 :\r\n\t\tprint(li[add-t[i]][-1],i+1)\r\n\t\tli[add-t[i]].pop()\r\n\telse :\r\n\t\tli[t[i]].append(i+1)\r\n", "n = int(input())\r\nls = list(map(int, input().split()))\r\nsum = 2*sum(ls)//n\r\nvisited = {}\r\nfor i in range(1, n+1):\r\n visited[i] = False\r\nfor i in range(1, n+1):\r\n for j in range(1, n+1):\r\n if visited[i] or visited[j] or i==j: pass\r\n elif ls[i-1]+ls[j-1]==sum:\r\n print(i, j)\r\n visited[i] = True\r\n visited[j] = True\r\n" ]

[ "# https://codeforces.com/problemset/problem/373/A\n# 900\n\nn = int(input())\nn2 = n * 2\n\n\nx = {}\no = \"YES\"\nfor _ in range(4):\n r = input()\n\n for c in r:\n if c == \".\":\n continue\n\n x.setdefault(c, 0)\n x[c] += 1\n\n if x[c] > n2:\n o = \"NO\"\n break\nprint(o)\n", "'''input\n1\n....\n12.1\n.2..\n.2..\n'''\nk = int(input())\nx = input() + input() + input() + input()\nprint(\"NO\" if any(x.count(i) > 2*k for i in set(x) if i != \".\") else \"YES\")\n", "import sys\r\npanels_per_hand = int(input())\r\npanels = []\r\nfor x in range(4):\r\n panels.append(input())\r\npanel_string = ''\r\nfor x in panels:\r\n panel_string += x\r\nfreq = None\r\nfor x in panel_string:\r\n if x == '.':\r\n continue\r\n freq = 0\r\n for y in panel_string:\r\n if x == y:\r\n freq += 1\r\n if freq > 2 * panels_per_hand:\r\n print('NO')\r\n sys.exit(0)\r\nprint('YES')\r\n ", "k=int(input())\r\na=''.join([input()for _ in[0]*4])\r\nprint('YNEOS'[max((a.count(str(x))for x in range(10)),default=0)>2*k::2])", "k = int(input())\r\n\r\nt = [\"\" for i in range(4)]\r\nfor i in range(4):\r\n\tt[i] = input()\r\n\r\ncnt = [0 for i in range(10)]\r\n\r\nfor i in range(4):\r\n\tfor j in range(4):\r\n\t\tif t[i][j] != '.':\r\n\t\t\tcnt[int(t[i][j])] += 1\r\n\r\nif max(cnt) <= k * 2:\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")\r\n", "import sys\r\nk = 2*int(input())\r\nstring = \"\"\r\ndic = {}\r\nfor i in range(4):\r\n string += input()\r\nstring = string.replace(\".\", \"\")\r\nfor i in string:\r\n if i not in dic:\r\n dic[i] = 1\r\n else:\r\n dic[i] += 1\r\nfor i in dic:\r\n if dic[i] > k:\r\n print(\"NO\")\r\n sys.exit()\r\nprint(\"YES\")\r\n", "k= int(input())\r\na=[]\r\nfor i in range(4):\r\n a.extend([str(X) for X in input()])\r\n\r\nf=0\r\nfor i in range(1,10) :\r\n i=str(i)\r\n if a.count(i)>2*k:\r\n print('NO')\r\n f=1\r\n break\r\nif f==0:\r\n print('YES')\r\n\r\n\r\n", "k = int(input())\r\nmax_press = k*2\r\n\r\nmat = [0, 0, 0, 0, 0, 0, 0, 0, 0]\r\nfor i in range(4):\r\n row = input()\r\n for val in row:\r\n if val == '.':\r\n continue\r\n else:\r\n mat[int(val)-1] += 1\r\n\r\nans = 'YES'\r\nfor val in mat:\r\n if val > max_press:\r\n ans = 'NO'\r\n\r\nprint(ans)\r\n\r\n", "import sys\r\nk=int(input())\r\nnum=[]\r\nfor i in range(4):\r\n n=input();\r\n for j in n:\r\n if j!='.':\r\n num.append(j)\r\nfor i in set(num):\r\n if num.count(i)>2*k:\r\n print(\"NO\")\r\n sys.exit(0)\r\nprint(\"YES\")", "k = int(input())\r\npanels = []\r\nfor i in range(4):\r\n row = input().strip()\r\n panels.append(row)\r\n\r\n# Count the number of occurrences of each number\r\ncounts = [0] * 10\r\nfor row in panels:\r\n for char in row:\r\n if char.isdigit():\r\n counts[int(char)] += 1\r\n\r\n# Check if we can press all panels in perfect timing\r\nperfect_timing = all(counts[i] <= 2 * k for i in range(1, 10))\r\nif perfect_timing:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "from collections import Counter\n\nnumber_of_panels_Cucumber_can_press_with_one_hand = int(input())\ntables_panels_need_to_press = []\n\nfor i in range(4):\n table_of_panels = input()\n for panel in table_of_panels:\n if panel != '.':\n tables_panels_need_to_press.append(panel)\n\ncounts = Counter(tables_panels_need_to_press)\nfor panels in counts.values():\n if panels > number_of_panels_Cucumber_can_press_with_one_hand * 2:\n print('NO')\n break\nelse:\n print('YES')\n", "k=int(input())\nz=[]\nx1=input()\nfor i in range (0,len(x1)):\n if (x1[i] != '.'):\n z.append(int(x1[i]))\n else:\n continue\n\nx2=input()\nfor l in range (0,len(x2)):\n if (x2[l] != '.'):\n z.append(int(x2[l]))\n else:\n continue\n\n\nx3=input()\nfor y in range (0,len(x3)):\n if (x3[y] != '.'):\n z.append(int(x3[y]))\n else:\n continue\n\nx4=input()\nfor s in range (0,len(x4)):\n if (x4[s] != '.'):\n z.append(int(x4[s]))\n else:\n continue\n\n\nkey=len(set(z))\n\ncopy=list(set(z))\ncount=0\nfor j in range (0,len(copy)):\n if (z.count(copy[j])<= 2*k):\n count+=1\n else:\n count=count\n\n\nif (count==key):\n print (\"YES\")\nelse:\n print (\"NO\")\n \n", "a = int(input())\nl1 = []\nfor x in range(4):\n ff = input()\n l1.append(ff)\nl2 = []\n\nfor x in range(1,10):\n res = 0\n for y in l1:\n res +=y.count(str(x))\n l2.append(res)\n\nif max(l2)<=2*a:\n print(\"YES\")\nelse:\n print(\"NO\")\n", "b = [0] * 10\r\nk = int(input())\r\n\r\nfor i in range(4):\r\n for j in input():\r\n if j != '.':\r\n b[int(j)] += 1\r\n\r\nprint (\"YES\" if max(b) <= k*2 else \"NO\")\r\n", "from collections import Counter\r\n\r\nk = int(input())\r\n\r\npanels = [int(v) for i in range(4) for v in input() if v != '.']\r\n\r\ncounts = Counter(panels)\r\n\r\nflag = True\r\nfor key in counts:\r\n if counts[key] > k * 2:\r\n print('NO')\r\n flag= False\r\n break\r\n\r\nif flag:\r\n print('YES')\r\n\r\n", "k = int(input())\r\n\r\nl = [0] * 10\r\nfor i in range(4):\r\n for j in input():\r\n if j != '.':\r\n l[int(j)] += 1\r\n\r\nma = max(l)\r\nif ma <= k * 2:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "\r\n\r\n\"\"\"k = []\r\nfor i in range(5):\r\n k.append([int(x) for x in (sys.stdin.readline()).split()])\r\n \r\nvmax = 0 \r\ntt = []\r\nfor i in range(5):\r\n for j in range(i, 5):\r\n if(i != j):\r\n k[i][j] = k[j][i] = k[i][j] + k[j][i]\r\n \r\n\r\nfor i in range(5):\r\n print(k[i])\"\"\"\r\n \r\n \r\nimport sys\r\nimport math\r\n \r\nn = int(sys.stdin.readline())\r\n\r\nk = [0] * 9\r\n\r\nfor i in range(4):\r\n tt = sys.stdin.readline()\r\n for j in range(4):\r\n if(tt[j] != '.'):\r\n ind = ord(tt[j]) - ord('0') - 1\r\n k[ind] += 1\r\n if(k[ind] > n * 2):\r\n print(\"NO\")\r\n exit()\r\n \r\nprint(\"YES\")\r\n\r\n ", "n=int(input())\r\narr=\"\"\r\nfor i in range(4):\r\n arr=arr+input()\r\nfor i in range(1,10):\r\n if arr.count(str(i))>2*n:\r\n print(\"NO\")\r\n exit()\r\nprint(\"YES\")\r\n ", "k = int(input())\r\nflag = False\r\ns = input() + input() + input() + input()\r\nfor _ in range(1, 10):\r\n if s.count(str(_)) > 2 * k:\r\n flag = True\r\nprint('YES' if not flag else 'NO')", "k = int(input())\r\n\r\nd = {}\r\nfor i in range(4):\r\n l = input()\r\n \r\n for char in l:\r\n if char!='.':\r\n if char not in d:\r\n d[char] = 1\r\n else:\r\n d[char]+=1\r\n \r\n\r\nflag = 0\r\n\r\nfor el in d.values():\r\n if el > 2*k:\r\n flag = 1\r\n break\r\n\r\nif flag == 1:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "k = int(input()) * 2\r\ns = []\r\nd = []\r\nfor i in range(16):\r\n d.append(0)\r\nfor i in range(4):\r\n s = input().split()[0]\r\n for j in s:\r\n if j != '.':\r\n d[int(j)] += 1\r\n if d[int(j)] > k:\r\n print(\"NO\")\r\n exit()\r\nprint(\"YES\")\r\n \r\n", " \r\n # static boolean visited[][]=new boolean[7][7];\r\n # static int ans=0;\r\n # public static void helper(int i, int j, int index, String s,int count) {\r\n \r\n # if(i<0 || j<0 || i>6 || j>6)\r\n # return ;\r\n \r\n # if(i==6 && j==0) {\r\n # if(count==48)\r\n # ans+=1;\r\n # return;\r\n # }\r\n # if(visited[i][j])\r\n # return;\r\n \r\n # visited[i][j]=true;\r\n # if(s.charAt(index)=='?') {\r\n # helper(i,j-1,index+1,s,count+1);\r\n # helper(i,j+1,index+1,s,count+1);\r\n # helper(i-1,j,index+1,s,count+1);\r\n # helper(i+1,j,index+1,s,count+1);\r\n \r\n # }\r\n # else if(s.charAt(index)=='L')\r\n # helper(i,j-1,index+1,s,count+1);\r\n # else if(s.charAt(index)=='R')\r\n # helper(i,j+1,index+1,s,count+1);\r\n # else if(s.charAt(index)=='U')\r\n # helper(i-1,j,index+1,s,count+1);\r\n # else\r\n # helper(i+1,j,index+1,s,count+1);\r\n # visited[i][j]=false;\r\n \r\n \r\n \r\n # }\r\n\r\nk=int(input())\r\narr=[0]*10\r\n\r\nfor i in range(4):\r\n s=input()\r\n for j in s:\r\n if(j=='.'):\r\n continue\r\n else:\r\n arr[int(j)]+=1\r\nm=0\r\nfor i in arr:\r\n m=max(m,i)\r\n\r\nif(m>2*k):\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n\r\n\r\n\r\n", "k = int(input())\r\npanel1 = input()\r\npanel2 = input()\r\npanel3 = input()\r\npanel4 = input()\r\ncan = True\r\n\r\nfor i in range(1,10):\r\n counter = panel1.count(str(i)) + panel2.count(str(i)) + panel3.count(str(i)) + panel4.count(str(i))\r\n if counter > k*2 :\r\n can = False\r\n break\r\nif can :\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "def collecting_beats_is_fun():\r\n status = True\r\n k = int(input())\r\n lst =[]\r\n for i in range(4):\r\n s = input()\r\n for ch in s:\r\n if ch =='.':\r\n continue\r\n else:\r\n lst.append(int(ch))\r\n \r\n new_lst = [0 for i in range(10)]\r\n for ele in lst:\r\n new_lst[ele-1] = new_lst[ele-1] +1\r\n for ele in new_lst:\r\n if ele >2*k:\r\n status = False\r\n break\r\n if status:\r\n print('YES')\r\n else:\r\n print('NO')\r\n \r\n \r\ncollecting_beats_is_fun()\r\n \r\n ", "k = int(input())\r\na = [0] * 10\r\nfor i in range(4):\r\n s = input()\r\n for j in range(4):\r\n if s[j] != '.':\r\n a[int(s[j])] += 1\r\nfor ai in a:\r\n if ai > k * 2:\r\n print(\"NO\")\r\n break\r\nelse:\r\n print(\"YES\")\r\n", "k=int(input())\r\ns=\"\"\r\nfor i in range(4):\r\n s+=input()\r\nfor i in range(1,10):\r\n a=s.count(str(i))\r\n if a>2*k:\r\n print(\"NO\")\r\n break\r\nelse:\r\n print(\"YES\")\r\n#print(\"123\".count(\"4\"))\r\n", "from sys import stdin; inp = stdin.readline\r\nfrom math import dist, ceil, floor, sqrt, log\r\ndef IA(): return list(map(int, inp().split()))\r\ndef FA(): return list(map(float, inp().split()))\r\ndef SA(): return inp().split()\r\ndef I(): return int(inp())\r\ndef F(): return float(inp())\r\ndef S(): return inp()\r\nfrom collections import Counter\r\n\r\ndef main():\r\n k = I()\r\n p = '' \r\n for i in range(4):\r\n s = input()\r\n p = p+s \r\n c = Counter(p)\r\n for key, v in c.items():\r\n if key != '.' and v > 2*k:\r\n return 'NO'\r\n return 'YES'\r\n\r\nif __name__ == '__main__':\r\n print(main())", "from collections import Counter\r\nk=int(input())\r\na=\"\"\r\nfor i in range(4):\r\n s=input()\r\n s=s.replace(\".\",\"\")\r\n a=a+s\r\nd=Counter(a)\r\nflag=0\r\nfor i in d:\r\n if(d[i]>2*k):\r\n flag=1\r\n break\r\nif(flag==0):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def solve(arr,n):\n d = {}\n for i in arr:\n for j in i:\n if j == '.':\n continue\n if not d.get(j):\n d[j] = 1\n else:\n d[j]+=1\n for i in d:\n if d[i] > 2*n:\n return \"NO\"\n return \"YES\"\n\n \n\n \ndef main() :\n n = int(input())\n # arr = list(map(int, input().split(' ')))\n arr = []\n for _ in range(4):\n i = input()\n arr.append(i)\n print(solve(arr, n))\nmain()\n", "k = int(input())\ns = [list(input()) for i in range(4)]\nlst = []\nok = False\nfor i in range(4):\n for j in range(4):\n if s[i][j].isdigit():\n lst.append(s[i][j])\n\nfor i in lst:\n if (lst.count(i) > k*2):\n ok = True\n break\nif ok:\n print(\"NO\")\nelse:\n print(\"YES\")\n", "\npanels = [0 for x in range(10)]\n\nk = int(input ())\n\ntabuleiro = []\n\nfor i in range(4):\n entrada = input ()\n linha = []\n for j in entrada:\n if j != '.':\n linha.append(int(j))\n else:\n linha.append(-1)\n tabuleiro.append (linha)\n\nfor i in range(4):\n for j in range(4):\n casa = tabuleiro[i][j]\n if casa != -1:\n panels[casa] += 1\n\npossivel = True\nfor i in panels:\n if i > 2*k:\n possivel = False\n break\nif possivel:\n print ('YES')\nelse:\n print ('NO')\n \n", "n=int(input())\r\nli=[]\r\nli1=[]\r\nflag=0\r\nfor i in range(4):\r\n ki=list(input())\r\n li.extend(ki)\r\nli=filter(lambda x:x!=\".\" ,li)\r\nfor i1 in li:\r\n li1.append(int(i1))\r\nfor i2 in set(li1):\r\n if li1.count(i2)>n*2:\r\n flag=1\r\nif flag==1:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "k = int(input()) * 2\r\ncnt = [0] * 10\r\nfor i in range(4):\r\n s = input()\r\n for j in s:\r\n if j != '.':\r\n cnt[ord(j) - ord('0')] += 1\r\n if cnt[ord(j) - ord('0')] > k:\r\n print(\"NO\")\r\n exit()\r\nprint(\"YES\")\r\n", "k = 2 * int(input())\r\ntable = []\r\nfor i in range(4):\r\n\ttable += input().strip()\r\n#print(table)\r\nt = dict()\r\nfor c in table:\r\n if c in t:\r\n t[c] += 1\r\n else:\r\n t[c] = 1\r\nt['.'] = 0\r\nans = True\r\nfor kk in t:\r\n v = t[kk]\r\n if v > k:\r\n ans = False\r\nprint(\"YES\" if ans else \"NO\")", "k = int(input())\ncount = {i:0 for i in \"123456789.\"}\n\nfor i in range(4):\n for string in input():\n count[string] += 1;\n\ncount[\".\"] = 0\n\nif max(count.values()) > 2*k:\n print(\"NO\")\nelse:\n print(\"YES\")\n", "# import sys\r\n# sys.stdin= (open('input.txt','r'))\r\n# sys.stdout = (open('output.txt','w'))\r\n\r\nfrom collections import Counter\r\nk = int(input())\r\nl = list()\r\nfor _ in range(4) :\r\n s = input()\r\n for i in s:\r\n if i != '.' : l.append(int(i))\r\nlc = Counter(l)\r\nfor i in lc.values() :\r\n if i> 2*k : \r\n print(\"NO\")\r\n exit()\r\nprint(\"YES\")", "k=int(input())*2\r\nl=[list(input()) for _ in range(4)]\r\nll=[0 for _ in range(10)]\r\nfor i in l:\r\n for x in i:\r\n if x!='.':\r\n ll[int(x)]+=1\r\nfor x in ll:\r\n if x>k:\r\n print(\"NO\")\r\n break\r\nelse: print(\"YES\")", "def func(dic,k):\r\n for i in dic:\r\n if dic[i]>2*k:\r\n return False\r\n return True\r\ndic = {}\r\nk = int(input())\r\nfor i in range(4):\r\n for j in list(input()):\r\n if j!='.':\r\n if j not in dic:\r\n dic[j] = 1\r\n else:\r\n dic[j] += 1\r\nif func(dic,k):\r\n print('YES')\r\nelse:\r\n print('NO')", "k=int(input())\r\nk*=2\r\nlst=[0]*10\r\na=[]\r\nfor i in range(4):\r\n s=input()\r\n for i in s:\r\n if i.isdigit():\r\n lst[int(i)]+=1\r\ncheck=1\r\nfor i in lst:\r\n if i>k:\r\n check=0\r\n break\r\nif check==1:\r\n print('YES')\r\nelse:\r\n print('NO')", "n=int(input())\r\nl=[]\r\nctr=0\r\nfor i in range(4):\r\n k=input()\r\n k=list(k)\r\n for i in k:\r\n l.append(i)\r\n\r\nfor i in range(len(l)):\r\n if l.count(l[i])>2*n and l[i]!='.':\r\n ctr=ctr+100\r\n else:\r\n ctr=ctr+0\r\n\r\nif ctr==0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "flatten = lambda x: [i for row in x for i in row]\r\n\r\nn = int(input())\r\np = []\r\n\r\nfor _ in range(4):\r\n p.append(input())\r\np = flatten(p)\r\n\r\ncount_list = []\r\nfor i in range(1, 10):\r\n count_list.append(p.count(str(i)))\r\n\r\nflag = True\r\nfor i in range(9):\r\n if count_list[i] > 2*n:\r\n flag = False\r\n break\r\n\r\nprint('YES' if flag else 'NO')\r\n", "k = int(input())\r\nn = k * 2\r\nRange = [0 for i in range(10)]\r\n\r\nfor i in range(4):\r\n lst = map(int, input().replace(\".\",\"\"))\r\n\r\n for ii in lst:\r\n Range[ii] += 1\r\nif max(Range) <= n:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "k = 2 * int(input())\nstore = {}\nfor i in range(4):\n\trow = input()\n\tfor j in range(4):\n\t\tif row[j] == \".\":\n\t\t\tcontinue\n\t\tif int(row[j]) in store:\n\t\t\tstore[int(row[j])] += 1\n\t\telse:\n\t\t\tstore[int(row[j])] = 1\n\nfor i in list(store.values()):\n\tif(i > k):\n\t\tprint(\"NO\")\n\t\tbreak\nelse:\n\tprint(\"YES\")", "k = int(input())\r\nfreq= [0] * 10\r\nfor _ in range(4):\r\n for x in input():\r\n if x != '.':\r\n freq[int(x)] += 1\r\nif max(freq) <= k * 2:\r\n print('YES')\r\nelse:\r\n print('NO')", "k = int(input())\r\nl = []\r\nans = [[], [], [], [], [], [], [], [], [], [], []]\r\nfor i in range(4):\r\n s = input()\r\n for j in range(4):\r\n if s[j] != '.':\r\n ans[int(s[j])].append(s[j])\r\nkk = k * 2\r\nif len(ans[1]) > kk or len(ans[2]) > kk or len(ans[3]) > kk or len(ans[4]) > kk or len(ans[5]) > kk or len(ans[6]) > kk or len(ans[7]) > kk or len(ans[8]) > kk or len(ans[9]) > kk:\r\n print('NO')\r\nelse:\r\n print('YES')", "import collections\r\n\r\nk = int(input())\r\nd = collections.defaultdict(int)\r\n\r\nans = \"YES\"\r\nfor i in range(4):\r\n s = input()\r\n for ch in s:\r\n if ch != '.':\r\n d[ch] += 1\r\n if d[ch] > 2*k:\r\n ans = 'NO'\r\nprint(ans)", "k = int(input())\r\n\r\npanel = \"\"\r\nfor i in range(4):\r\n\tline = input()\r\n\tpanel+=line\r\n\r\nkeys = ['1', '2', '3', '4', '5', '6', '7', '8', '9']\r\nfor key in keys:\r\n\tif panel.count(key) > k*2:\r\n\t\tprint(\"NO\")\r\n\t\texit()\r\n\r\nprint(\"YES\")", "k = int(input())\r\nb = [0]*10\r\nfor i in range(4):\r\n\ts = input()\r\n\tfor j in s:\r\n\t\tif j=='.':\r\n\t\t\tcontinue\r\n\t\telse:\r\n\t\t\tb[int(j)]+=1\r\nfor i in b:\r\n\tif i>k*2:\r\n\t\tprint(\"NO\")\r\n\t\tbreak\r\nelse:\r\n\tprint(\"YES\")", "k = int(input())\r\ncnt = [0] * 10\r\nfor _ in range(4):\r\n s = input()\r\n for i in s:\r\n if i.isdigit():\r\n cnt[int(i)] += 1\r\nif any(cnt[i] > k * 2 for i in range(10)):\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n", "k=int(input())\r\na=[0]*9\r\nfor i in range(4):\r\n l1=list(input())\r\n for item in l1:\r\n if item!='.':\r\n a[int(item)-1]+=1\r\nif max(a)<=2*k:\r\n print(\"YES\")\r\nelse :\r\n print(\"NO\")", "from collections import Counter\r\ns = ''\r\nh = int(input())\r\nfor _ in range(4):\r\n s += input()\r\ns = s.replace('.', '')\r\ntemp = Counter(s)\r\nf = 1\r\nfor i in range(1, 10):\r\n if temp[str(i)] > 2*h:\r\n f = 0\r\n break\r\nif f == 1:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "buttons_for_hand = int(input())\r\ni = 0\r\ndata = {1:0, 2:0, 3:0, 4:0, 5:0, 6:0, 7:0, 8:0, 9:0}\r\ngame_map = []\r\nwhile i < 4:\r\n\tgame_map.append([int(x) if x.isdigit() == True else x for x in input()])\r\n\ti += 1\r\ni = 0\r\nwhile i < 4:\r\n\tj = 0\r\n\twhile j < 4:\r\n\t\tcur_step = game_map[i][j]\r\n\t\tif cur_step != '.':\r\n\t\t\tdata[cur_step] += 1\r\n\t\tj += 1\r\n\ti += 1\r\nif max(data.values()) > buttons_for_hand*2:\r\n\tprint('NO')\r\nelse:\r\n\tprint('YES')", "k=int(input())\r\nl=[]\r\nfor i in range(4):\r\n l.append(input())\r\nf=[]\r\nfor i in range(4):\r\n for j in range(4):\r\n if l[i][j]!='.':\r\n f.append(int(l[i][j]))\r\nc=0\r\nk=2*k\r\nx=len(f)\r\ni=1\r\nwhile x>0 and i<=9:\r\n if f.count(i)<=k:\r\n x=x-f.count(i)\r\n i=i+1\r\n else:\r\n c=1\r\n break\r\nif c==1:\r\n print('NO')\r\nelse:\r\n print('YES')", "__author__ = 'asmn'\r\n\r\nk=int(input())\r\ncnt=dict((i,0) for i in range(1,10))\r\nfor i in range(4):\r\n for j in input():\r\n if ord('1')<=ord(j)<=ord('9'):\r\n cnt[ord(j)-ord('0')]+=1\r\nprint('YES' if len(list(filter(lambda x:x[1]>2*k,cnt.items())))==0 else 'NO')\r\n", "n=int(input())\r\nlist1=[]\r\nfor i in range(4):\r\n ll=list(map(int,input().replace(\".\",\"\")))\r\n list1=list1+ll\r\nf=0\r\nfor i in range(1,10):\r\n x=list1.count(i)\r\n if(x>n*2):\r\n f=1\r\n break\r\nif(f==0):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "from collections import Counter\nn = int(input()) * 2\nv = \"\"\nfor i in range(0, 4):\n v += input()\nd = Counter(v)\nd['.'] = 0\nprint([\"NO\", \"YES\"][n >= max(d.values())])\n", "k = int(input())\r\nl = \"\"\r\nfor _ in range(4):\r\n s = input()\r\n l+=s\r\ny = []\r\nfor i in l:\r\n if i != '.' and i not in y:\r\n y.append(i)\r\nfor i in y:\r\n if l.count(i) > 2*k:\r\n print('NO')\r\n break\r\nelse:\r\n print('YES')\r\n\r\n\r\n \r\n \r\n \r\n \r\n \r\n \r\n\r\n", "import collections\r\nimport itertools\r\nimport sys\r\n\r\ninput = sys.stdin.readline\r\n\r\nk = int(input())\r\n\r\ndata = [list(input().rstrip()) for _ in range(4)]\r\ncntr = collections.Counter(itertools.chain(*data))\r\n\r\nmv = -1\r\nfor i in cntr:\r\n mv = max(mv, cntr[i]) if i != '.' else mv\r\n\r\nprint(\"NO\" if mv > 2 * k else \"YES\")", "k = 2 * int(input())\n\nA = [0 for i in range(10)]\n\nfor i in range(4):\n\ts = input().replace(\".\", \"\")\n\n\ts = map(int, list(s))\n\n\tfor t in s:\n\t\tA[t] += 1\n\nif max(A) <= k:\n\tprint(\"YES\")\nelse:\n\tprint(\"NO\")", "a=int(input())\r\nallp=\"\"\r\nfor i in range(4):\r\n allp+=input()\r\nokay=\"YES\"\r\nfor i in range(9):\r\n if allp.count(str(i+1))>a*2:\r\n okay=\"NO\"\r\n break\r\nprint(okay)", "n = int(input())\r\nl = []\r\nst = ''\r\nfor _ in range(4):\r\n s = input()\r\n st+=s\r\n l.append(s)\r\narr = []\r\nfor i in range(1,10):\r\n arr.append(st.count(str(i)))\r\nf = 0\r\nfor i in arr:\r\n if i>2*n:\r\n f=1\r\n break\r\nif f==0:\r\n print('YES')\r\nelse:\r\n print('NO')", "while True:\r\n try:\r\n k = int(input())\r\n except EOFError:\r\n break\r\n \r\n S = [list(input().strip()) for _ in range(4)]\r\n count = [0] * 10\r\n ans = True\r\n\r\n for i in range(4):\r\n for j in range(4):\r\n if S[i][j] != '.':\r\n count[int(S[i][j])] += 1\r\n\r\n for i in range(1, 10):\r\n if count[i] > k * 2:\r\n ans = False\r\n\r\n if ans:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n", "k = int(input())\r\ns = ''\r\nfor i in range(4):\r\n s += input()\r\nm = max([s.count(str(i)) for i in range(1, 10)])\r\nif m > 2 * k:\r\n print('NO')\r\nelse:\r\n print('YES')", "import math\r\nfrom fractions import Fraction as frac\r\n\r\ndef solve(case_no):\r\n # implementation\r\n n = int(input())\r\n a = []\r\n for i in range(4):\r\n temp = str(input())\r\n a.append(temp)\r\n cnt = [0 for i in range(100)]\r\n for i in range(4):\r\n for j in range(4):\r\n if 48 <= ord(a[i][j]) & ord(a[i][j]) <= 57:\r\n cnt[ord(a[i][j]) - 48] += 1\r\n for i in range(10):\r\n if cnt[i] > n * 2:\r\n print(\"NO\")\r\n return\r\n print(\"YES\")\r\n\r\nt = 1\r\n# t = int(input())\r\nfor i in range(1, t + 1):\r\n solve(i)\r\n", "from collections import Counter\n\nk = int(input())\ncnt = Counter()\nfor _ in range(4):\n cnt.update(input())\ndel cnt[\".\"]\nres = \"YES\" if all(v <= 2 * k for _, v in cnt.most_common()) else \"NO\"\nprint(res)\n", "freq = {}\r\nk = int(input()) << 1\r\n\r\nfor _ in range(4):\r\n for digit in input(): \r\n if digit != \".\": freq[digit] = freq.get(digit, 0) + 1\r\n\r\nfor value in freq.values():\r\n if value > k:\r\n print(\"NO\")\r\n exit(0)\r\n\r\nprint(\"YES\")", "from collections import Counter\r\ndef solve():\r\n n=int(input());n*=2;f=''\r\n for i in range(4):s=input();f+=s\r\n v=(Counter(f));del v[\".\"]\r\n for i in v:\r\n if v.get(i)>n:print(\"NO\");return\r\n print(\"YES\")\r\nsolve()", "k = int(input())\r\nl =[]\r\nfor i in range(4):\r\n row = input()\r\n for j in row : \r\n l.append(j)\r\nflag = \"YES\"\r\nfor i in l: \r\n if i.isdigit() and l.count(i) > (k*2) : \r\n flag= \"NO\" \r\n break\r\nprint(flag) \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\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\nk = INT()\r\nx = []\r\nfor i in range(4):\r\n s = input()\r\n for j in s :\r\n if j != '.':\r\n x.append(int(j))\r\n\r\ny = Counter(x)\r\nz =y.values()\r\nf = 2 * k\r\nflag = True\r\nfor i in z :\r\n if i > f :\r\n flag = False\r\n break\r\n\r\nif flag:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n\r\n\r\n\r\n", "\r\nk = int(input())\r\nhs = [0 for i in range(10)]\r\nfor i in range(4):\r\n s = input()\r\n for j in range(4):\r\n if s[j]!='.':\r\n hs[int(s[j])]+=1\r\n\r\nres = True\r\nfor i in range(len(hs)):\r\n if hs[i] > 2*k:\r\n res = False\r\nif res :\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "k = int(input())\r\nA = []\r\nB = [0]*16\r\np = 0\r\nfor i in range(4):\r\n A.extend(list(input()))\r\nfor j in A:\r\n if(j == \".\"):\r\n continue\r\n B[int(j)] += 1\r\nfor m in B:\r\n if(m>2*k):\r\n print(\"NO\")\r\n p = 1\r\n break\r\nif(p == 0):\r\n print(\"YES\")\r\n", "k=int(input())\r\nc=[0]*9\r\nfor i in range(4):\r\n a=input().strip()\r\n for i in a:\r\n if i!='.':\r\n c[int(i)-1]+=1\r\nif max(c)<=2*k:\r\n print('YES')\r\nelse:\r\n print('NO')", "def main():\r\n k = int(input()) * 2\r\n cnt = [0] * 9\r\n for _ in range(4):\r\n for e in [int(c) for c in input() if c != '.']:\r\n cnt[e-1] += 1\r\n if cnt[e-1] > k:\r\n print('NO')\r\n return\r\n \r\n print('YES')\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "k=int(input())\r\nb={}\r\nfor i in range(4):\r\n s=input()\r\n for i in s:\r\n if i in b:b[i]+=1\r\n else:b[i]=1\r\ndef fn(b):\r\n for i in b:\r\n if i!='.' and b[i]>2*k:return 'NO'\r\n return 'YES'\r\nprint(fn(b))\r\n", "k = int(input())\r\nk *= 2\r\n\r\npanels = ''\r\n\r\nfor i in range(4):\r\n panels += input()\r\n\r\nif panels.count('1') <= k and panels.count('2') <= k and panels.count('3') <= k and panels.count('4') <= k and panels.count('5') <= k and panels.count('6') <= k and panels.count('7') <= k and panels.count('8') <= k and panels.count('9') <= k:\r\n print('YES')\r\nelse:\r\n print('NO')", "k=int(input())\r\nx=[0 for i in range(9)]\r\ny=[]\r\nfor i in range(4):\r\n y.append(list(input()))\r\nfor i in range(4):\r\n for j in range(4):\r\n if y[i][j]!=\".\":\r\n x[int(y[i][j])-1]+=1\r\nif max(x)>2*k:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n", "n=int(input())\r\na=[input() for i in range(4)]\r\nd={'1':0,'2':0,'3':0,'4':0,'5':0,'6':0,'7':0,'8':0,'9':0}\r\nfor i in range(4):\r\n\tfor j in range(4):\r\n\t\tif (a[i][j]).isnumeric():\r\n\t\t\tx=str(a[i][j])\r\n\t\t\td[x]+=1\r\nflag=1\r\nfor i in range(1,10):\r\n\tif d[str(i)]>(2*n):\r\n\t\tprint(\"NO\")\r\n\t\tflag=0\r\n\t\tbreak\r\n\r\nif flag==1:\r\n\tprint(\"YES\")", "def main():\n k = int(input())\n quantidades = [0]*10\n for i in range(4):\n linha = input()\n for valor in linha:\n if valor == \".\":\n quantidades[0] += 1\n else:\n quantidades[int(valor)] += 1\n epossivel = True\n i = 1\n while i<10 and epossivel == True:\n if quantidades[i] > 2*k:\n epossivel = False\n i += 1\n if epossivel == True:\n print(\"YES\")\n else:\n print(\"NO\")\n\nmain()", "k = int(input())\r\n\r\nmat=[]\r\nfor i in range(4):\r\n s=input()\r\n mat.append(s)\r\ndic={}\r\nfor s in mat:\r\n for j in s:\r\n if(j=='.'):\r\n pass\r\n else:\r\n if(j in dic):\r\n dic[j]+=1\r\n else:\r\n dic[j]=1\r\n\r\n#print(dic)\r\n\r\nfor i in dic:\r\n dic[i]/=2\r\n\r\n\r\nflag=0\r\n\r\nfor i in dic:\r\n if(dic[i]>k):\r\n flag=1\r\n\r\nif(flag==1):\r\n print('NO')\r\nelse:\r\n print('YES')", "#!/usr/bin/python3\n\ndef readln(): return tuple(map(int, input().split()))\n\nk, = readln()\ncnt = {}\nfor c in list(''.join([input() for _ in range(4)])):\n if c != '.':\n cnt[c] = cnt.get(c, 0) + 1\nprint('YES' if len([1 for v in cnt.values() if v <= 2 * k]) == len(cnt) else 'NO')\n", "hit = int(input())\r\n\r\ntimes = [0]*9\r\nfor i in range(4):\r\n gained = input()\r\n for j in range(4):\r\n if gained[j] != '.': times[int(gained[j]) - 1] +=1\r\n\r\n\r\nyes = True\r\nfor i in times:\r\n if i > hit*2 :\r\n yes = False\r\n break\r\n\r\nif yes:print('YES')\r\nelse: print('NO')", "k = int(input())\r\n\r\ndaf = dict()\r\nfor i in range(9):\r\n daf[i+1] = 0\r\n\r\nfor i in range(4):\r\n daf2 = list(input())\r\n for j in range(4):\r\n if daf2[j] == '.':\r\n continue\r\n daf[int(daf2[j])] += 1\r\n\r\nmax_value = max(daf.values())\r\nif max_value > 2*k:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n \r\n", "k = int(input())\nmas = []\nfor i in range(4):\n s = input()\n for el in s:\n if el != '.':\n mas.append(int(el))\nisin = True\nfor j in range(1, 10):\n if mas.count(j) > k*2:\n isin = False\nif not isin:\n print('NO')\nelse:\n print('YES')", "k = int(input().strip())\r\nlst = []\r\nvalid = True\r\nfor i in range(4):\r\n row = list(input().strip())\r\n for j in range(4):\r\n if row[j] != '.':\r\n lst.append(int(row[j]))\r\nlst.sort()\r\ni = 0\r\nwhile i < len(lst):\r\n count = lst.count(lst[i])\r\n if count > 2 * k:\r\n valid = False\r\n break\r\n i += count\r\n\r\nif valid:\r\n print('YES')\r\nelse:\r\n print('NO')", "x = int(input())\r\n\r\ns = ''\r\nfor i in range(4) : \r\n ip = input()\r\n s += ip\r\ns = s.replace('.', '')\r\nans = \"YES\"\r\nfor i in s : \r\n if s.count(i) > x * 2 : \r\n ans = \"NO\"\r\n\r\nprint(ans)", "from collections import defaultdict\r\nk=int(input())\r\np=defaultdict(int)\r\nfor i in range(4):\r\n s=input()\r\n for j in s:\r\n if j!=\".\":p[j]+=1\r\nfor i in p.keys():\r\n if p[i]>k*2:\r\n print(\"NO\")\r\n exit()\r\nprint(\"YES\")", "k = int(input())\r\ntimings = [0] * 10\r\n\r\nfor _ in range(4):\r\n panels = input()\r\n for panel in panels:\r\n if panel != '.':\r\n timings[int(panel)] += 1\r\n\r\nfor timing in timings:\r\n if timing > k * 2:\r\n print(\"NO\")\r\n exit(0)\r\n\r\nprint(\"YES\")\r\n", "k = int(input())\r\np = {i: 0 for i in '123456789.'}\r\nfor i in range(4):\r\n for j in input(): p[j] += 1\r\np['.'] = 0\r\nprint('YNEOS'[max(p.values()) > 2 * k :: 2])", "k = int(input())\r\ns = ''.join(input().replace('.', '') for i in range(4))\r\nprint(\"NO\" if len(s) > 0 and max(s.count(c) for c in set(s)) > 2 * k else \"YES\")", "presedWithOnHand = int(input())\r\ntotal = presedWithOnHand * 2\r\ndiction = {}\r\nfor i in range(4):\r\n temp = list(input())\r\n for ch in temp:\r\n tempValue = diction.setdefault(ch, 0)\r\n tempValue += 1\r\n diction[ch] = tempValue\r\nok = True\r\nfor num in diction:\r\n tempKey = num\r\n tempValue = diction[num]\r\n if(tempValue > total and tempKey != \".\"):\r\n ok = False\r\n break\r\n\r\nprint(\"YES\" if ok else \"NO\")", "\r\nn = int(input())\r\nl = []\r\nflag = 0\r\nfor i in range(4):\r\n\tl1 = input()\r\n\tl.append(l1)\r\n\r\nfor i in range(1,17):\r\n\tcount = 0\r\n\tfor j in l:\r\n\t\tcount = count +\tj.count(str(i))\r\n\tif count > 2*n:\r\n\t\tflag = 1\r\n\t\tbreak\r\nif flag == 1:\r\n\tprint(\"NO\")\r\nelse:\r\n\tprint(\"YES\")", "import string\r\n\r\ndef main_funtion():\r\n k = 2 * int(input())\r\n table = [input() for i in range(4)]\r\n d = [0 for i in range(17)]\r\n for i in range(len(table)):\r\n for j in range(len(table[i])):\r\n if not table[i][j] == \".\":\r\n d[int(table[i][j])] += 1\r\n for i in d:\r\n if i > k:\r\n return \"NO\"\r\n return \"YES\"\r\n\r\n\r\n\r\n\r\n\r\n\r\nprint(main_funtion())", "k = int(input())\r\npanels = input().strip()\r\npanels2 = input().strip()\r\npanels3 = input().strip()\r\npanels4 = input().strip()\r\npanels += panels2 + panels3 + panels4\r\nflag = True\r\nfor i in range(1, 10):\r\n if (panels.count(str(i)) > (k * 2)):\r\n print('NO')\r\n exit()\r\nprint('YES')", "k = int(input())\r\nl = ''\r\nfor i in range(4):\r\n l += input()\r\nn = 0\r\nfor j in map(str,range(1,10)):\r\n if l.count(j) > k*2:\r\n n+=1\r\nprint(\"YNEOS\"[n>0::2])\r\n", "k = int(input())\nres = 0\nnum = {chr(i):0 for i in range(49,58)}\n\nfor i in range(4):\n s = input()\n for j in s:\n if j != '.':num[j]+=1\nfor i in num.values():\n if i > k*2:\n res = 1\n break\nprint('YNEOS'[res::2])\n", "k=int(input())\r\nL={}\r\ns=\".123456789\"\r\nfor i in s:\r\n L[i]=0\r\nfor j in range(4):\r\n s=input()\r\n for i in s:\r\n L[i]+=1\r\ns=\"123456789\"\r\ndone=True\r\nfor i in s:\r\n if(L[i]>2*k):\r\n print(\"NO\")\r\n done=False\r\n break\r\nif(done):\r\n print(\"YES\")\r\n", "# Problem Link: https://codeforces.com/problemset/problem/373/A\r\n# Author: Raunak Sett\r\nimport sys\r\nreader = (s.rstrip() for s in sys.stdin)\r\ninput = reader.__next__\r\n\r\n# do magic here\r\n\r\nk = int(input())\r\n\r\npanels = []\r\nfor i in range(4):\r\n panels.append(input())\r\n\r\ntimeMap = {}\r\n\r\nposs = True\r\nfor row in panels:\r\n for char in row:\r\n if char == '.':\r\n continue\r\n timeMap[char] = timeMap.get(char, 0) + 1\r\n if timeMap[char] > k*2:\r\n poss = False\r\n\r\nif poss:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "k = int(input())\r\nl1 = {}\r\nfor i in range(4):\r\n a = input()\r\n for i in a:\r\n if i != \".\":\r\n if i not in l1.keys():\r\n l1.update({i: 1})\r\n else:\r\n s = int(l1.get(i))+1\r\n l1.update({i: s})\r\nfor i in l1.values():\r\n if i>2*k:\r\n print(\"NO\")\r\n exit()\r\nprint(\"YES\")", "# -*- coding: utf-8 -*-\r\n\r\nk = int(input())\r\n\r\ncounter = [0] * 10\r\ns = ''.join([input().strip() for i in range(4)])\r\n\r\nfor c in s:\r\n if c == '.':\r\n continue\r\n counter[int(c)] += 1\r\n\r\nm = max(counter)\r\nprint('NO' if m > 2*k else 'YES')", "c = int(input())\r\narr = []\r\nfor i in range(4):\r\n arr.append(list(input()))\r\ncount = dict()\r\nfor x in arr:\r\n for y in x:\r\n if y!=\".\":\r\n if y not in count:\r\n count[y] = 1\r\n else:\r\n count[y] += 1\r\nc*=2\r\ndec = False\r\nfor x in count:\r\n if count[x]>c:\r\n dec = True\r\n break\r\nif dec:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "n=int(input())\r\nl=[]\r\nfor i in range(4):\r\n t=input()\r\n l.append(t)\r\nd={}\r\nfor i in range(4):\r\n for j in range(4):\r\n if l[i][j]!='.':\r\n if d.get(l[i][j]):\r\n d[l[i][j]]+=1\r\n else:\r\n d[l[i][j]]=1\r\nmx=0\r\nfor i in d.keys():\r\n if mx<d[i]:\r\n mx=d[i]\r\nif n*2<mx:\r\n print('NO')\r\nelse:\r\n print('YES')\r\n ", "def main():\n\tk = 2*int(input())\n\n\tcounts = {}\n\tfor ch in \".1234567890\":\n\t\tcounts[ch] = 0\n\n\tfor i in range(4):\n\t\ts = input()\n\t\tfor ch in s:\n\t\t\tcounts[ch] += 1\n\t\t\tif counts[ch]>k and ch!='.':\n\t\t\t\tprint(\"NO\")\n\t\t\t\treturn\n\tprint(\"YES\")\n\nif __name__==\"__main__\":\n\tmain()", "k=int(input())\r\npossible=True\r\nnums={'1':0,'2':0,'3':0,'4':0,'5':0,'6':0,'7':0,'8':0,'9':0}\r\nfor _ in range(4):\r\n\tlinha = input()\r\n\tfor num in range(len(linha)):\r\n\t\tif(linha[num]!='.'):\r\n\t\t\tnums[linha[num]]+=1\r\nif(max(nums.values())>2*k):\r\n\tpossible=False\r\nprint(\"YES\" if possible else \"NO\")", "k = int(input())\nmy_dict = {}\nfor _ in range(4):\n\ts = input()\n\tfor i in s:\n\t\tif i.isdigit():\n\t\t\tif i not in my_dict:\n\t\t\t\tmy_dict[i] = 0\n\t\t\tmy_dict[i] += 1\n\ncan = True\nfor key, value in my_dict.items():\n\tif value > k*2:\n\t\tcan = False\n\t\tbreak\n\nif can:\n\tprint(\"YES\")\nelse:\n\tprint(\"NO\")\n", "k = int(input())\r\nl = ''\r\nfor i in range(4):\r\n l += input()\r\nn = 0\r\nfor j in map(str,range(1,10)):\r\n if l.count(j) > k*2:\r\n n+=1\r\n\r\nif n > 0:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\") \r\n\r\n ", "k = int(input())\r\nli = []\r\nfor i in range(4):\r\n l = input()\r\n for j in l:\r\n if j !=\".\":\r\n li.append(j)\r\n\r\nli = [int(i) for i in li]\r\ncount = 0\r\nicount = 0\r\nfor i in range(1,10):\r\n icount = 0\r\n while i in li:\r\n icount +=1\r\n li.remove(i)\r\n if icount > count: count = icount\r\nif count > 2*k: print(\"NO\")\r\nelse: print(\"YES\")", "k = int(input())\n\nd = {}\n\nfor i in range(4):\n s = input()\n for char in s:\n if char in d:\n d[char] += 1\n else:\n d[char] = 1\n\nfor key, value in d.items():\n if key == '.':\n continue\n if value > 2*k:\n print('NO')\n exit()\n\nprint('YES')\n", "k = int(input())\r\nk *=2\r\n\r\nm = \"\"\r\n\r\nfor _ in range(0,4):\r\n m += input()\r\n\r\n\r\n\r\nfor i in range(1,10):\r\n if(m.count(str(i)) > k):\r\n print(\"NO\")\r\n exit(0)\r\n\r\nprint(\"YES\")", "k=2*(int(input()))\r\ns=''\r\nfor _ in range(4):\r\n s+=input()\r\ns=s.replace('.','')\r\nfor x in set(s):\r\n if s.count(x)>k:\r\n print('NO')\r\n break\r\nelse:\r\n print('YES')", "a = [0, 0, 0, 0, 0, 0, 0, 0, 0, 0]\r\nk = int(input())\r\nfor i in range(0, 4):\r\n b = input()\r\n for j in range(0, 4):\r\n if b[j] != '.':\r\n a[int(b[j])] += 1\r\nfor i in range(0, 10):\r\n if a[i] > k * 2:\r\n print (\"NO\")\r\n exit()\r\nprint(\"YES\")", "class CodeforcesTask373ASolution:\r\n def __init__(self):\r\n self.result = ''\r\n self.k = 0\r\n self.panels = ''\r\n\r\n def read_input(self):\r\n self.k = int(input())\r\n for x in range(4):\r\n self.panels += input()\r\n\r\n def process_task(self):\r\n times = [str(x) for x in range(1, 10)]\r\n can = True\r\n for time in times:\r\n if self.panels.count(time) > self.k * 2:\r\n can = False\r\n break\r\n if can:\r\n self.result = \"YES\"\r\n else:\r\n self.result = \"NO\"\r\n\r\n def get_result(self):\r\n return self.result\r\n\r\n\r\nif __name__ == \"__main__\":\r\n Solution = CodeforcesTask373ASolution()\r\n Solution.read_input()\r\n Solution.process_task()\r\n print(Solution.get_result())\r\n", "x = int(input())\r\nstring = \"\"\r\nteste = True\r\nfor i in range(4):\r\n string+= input(\"\")\r\nfor i in string:\r\n if(x*2 < string.count(i) and i != '.'):\r\n teste = False\r\n break\r\nif(teste):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "k = int(input())\r\ndt={'1':0, '2':0, '3':0, '4':0, '5':0, '6':0, '7':0, '8':0, '9':0}\r\nflag=1\r\n\r\nfor i in range(4):\r\n s = list(input())\r\n for j in range(len(s)):\r\n if s[j]=='.':\r\n continue\r\n else:\r\n dt[s[j]]+=1\r\n \r\nfor i in dt.keys():\r\n if dt[i] > 2*k:\r\n flag=0\r\n break\r\n \r\nprint(\"YES\") if flag==1 else print(\"NO\")", "n = int(input())\r\nccount=[0 for i in range(10)]\r\ntemp = str()\r\nfor i in range(4):\r\n temp += input()\r\n\r\ntile = list(temp)\r\n\r\nfor i in tile:\r\n if i=='.':\r\n pass\r\n else:\r\n ccount[int(i)] +=1\r\n\r\nif max(ccount) > 2*n:\r\n print('NO')\r\nelse:\r\n print(\"YES\")", "WWW = int(input())*2\ntudo = \"\"\nfor i in range(4):\n tudo += input()\n\nnums = {}\n\nfor k in tudo:\n if k != \".\":\n if not k in nums.keys():\n nums[k] = 0\n nums[k] += 1\n\ndeu = True\n\nfor j in nums.values():\n if j > WWW: deu = False \n\n\nif deu: print(\"YES\")\nelse: print(\"NO\")\n\n", "k = int(input())\na = [list(input()) for i in range(4)]\nx = [0 for i in range(10)]\nfor i in range(4):\n\tfor j in range(4):\n\t\tif a[i][j] == '.': continue\n\t\tn = int(a[i][j])\n\t\tx[n]+=1\nok = True\nfor i in range(10):\n\tif x[i] > 2*k:\n\t\tok = False\nif (ok):\n\tprint(\"YES\")\nelse:\n\tprint(\"NO\")\n", "n=int(input())\r\nl=[]\r\nfor i in range(4):\r\n a=input()\r\n l.append(a)\r\ncount=[0,0,0,0,0,0,0,0,0]\r\nfor i in range(4):\r\n for j in range(4):\r\n if ord(l[i][j])>=49 and ord(l[i][j])<=57:\r\n count[int(l[i][j])-1]+=1\r\nif max(count)>2*n:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "def solve() :\n d={}\n for i in range(4):\n for j in range(4) :\n d[arr[i][j]]=d.get(arr[i][j],0)+1\n for i in d :\n if d[i]>2*n and i!='.' :\n return 'NO'\n return 'YES'\n\n \n \n \n\n \n\nfrom sys import stdin\ninput = stdin.readline \n \nn=int(input())\narr=[]\nfor i in range(4):\n arr.append([x for x in input().strip()])\nprint(solve())\n \n\n\n\n\n'''\n\nt=int(input())\nfor i in range(t) :\n print(solve())\n\n\nn=int(input())\n\nx=input().strip()\n\n\nn,m= [int(x) for x in input().split()]\n\n\n\nn,m= [int(x) for x in input().split()]\narr=[]\nfor i in range(n):\n arr.append([int(x) for x in input().split()])\n\nn,m= [int(x) for x in input().split()]\narr=[]\nfor i in range(n):\n arr.append([x for x in input().strip()])\n\n\nn=int(input())\narr=[]\nfor i in range(n):\n arr.append([int(x) for x in input().split()])\n\n\n\nn=int(input())\narr=[int(x) for x in input().split()]\n'''", "n = int(input())\r\nl=[]\r\nmaxy=-1\r\n\r\nfor i in range(4):\r\n l.extend(input())\r\nfor i in l:\r\n if i=='.':\r\n continue\r\n else :\r\n maxy=max(l.count(i),maxy)\r\n\r\nif maxy>n*2:\r\n print('NO')\r\nelse:\r\n print('YES')", "k=int(input())*2\r\nl=[0]*10\r\nfor i in range(4):\r\n s=input()\r\n for j in s:\r\n if j!='.':\r\n l[int(j)]+=1\r\n\r\nprint('NO' if max(l)>k else 'YES')\r\n \r\n\r\n", "h = int(input())\n\narr = []\n\nfor i in range(4):\n arr.append(list(input()))\n\ntimes = [0,0,0,0,0,0,0,0,0,0]\n\nfor i in arr:\n for j in i:\n if j=='1':\n times[int(j)]+=1\n if j=='2':\n times[int(j)]+=1\n if j=='3':\n times[int(j)]+=1\n if j=='4':\n times[int(j)]+=1\n if j=='5':\n times[int(j)]+=1\n if j=='6':\n times[int(j)]+=1\n if j=='7':\n times[int(j)]+=1\n if j=='8':\n times[int(j)]+=1\n if j=='9':\n times[int(j)]+=1\n\nfor i in times:\n if i>h*2:\n print(\"NO\")\n break\nelse:\n print(\"YES\")\n", "b = dict.fromkeys(\".123456789\", 0)\r\n\r\nk = int(input()) * 2\r\n\r\nfor i in range(4):\r\n for j in input():\r\n b[j] += 1\r\n\r\nb.pop('.')\r\nprint (\"YES\" if max(b.values()) <= k else \"NO\")", "k = int(input())\r\na = [0] * 10\r\nfor i in range(4):\r\n s = input()\r\n for j in range(4):\r\n if s[j] != '.':\r\n a[int(s[j])]+=1\r\nans = 'YES'\r\nfor i in range(10):\r\n if 2 * k < a[i]:\r\n ans = 'NO'\r\nprint(ans)", "n=int(input())\r\nl=[]\r\nfor _ in range(4):\r\n l.append(list(input()))\r\nk=[]\r\npress=n*2\r\nfor i in l:\r\n for j in i:\r\n if j!='.':\r\n k.append(int(j))\r\nknew=k\r\nknew=list(set(knew))\r\nfor xx in knew:\r\n if k.count(xx)>press:\r\n print('NO')\r\n break\r\nelse:\r\n print('YES')\r\n \r\n ", "k = int(input())\r\nlst = []\r\nfor i in range(4):\r\n lst.extend([x for x in input()])\r\n\r\nfor i in range(1, 10):\r\n if lst.count(str(i)) > k*2:\r\n print(\"NO\")\r\n break\r\nelse:\r\n print(\"YES\")\r\n", "a=int(input())\r\nb1=list(input())\r\nb2=list(input())\r\nb3=list(input())\r\nb4=list(input())\r\nb=[]\r\nb=b+b1+b2+b3+b4\r\nif(b.count('1')<=2*a and b.count('2')<=2*a and b.count('3')<=2*a and b.count('4')<=2*a and b.count('5')<=2*a and b.count('6')<=2*a and b.count('7')<=2*a and b.count('8')<=2*a and b.count('9')<=2*a ):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "k=int(input())\r\n\r\n\r\n\r\n\r\nt=''\r\n\r\n\r\n\r\n\r\n\r\nfor i in range(4):\r\n t+=str(input())\r\n\r\n\r\np=list(t)\r\n\r\ns=list(set(p))\r\nm=0\r\nfor j in s:\r\n if j!='.':\r\n if p.count(j)<= 2*k:\r\n pass\r\n else:\r\n print('NO')\r\n m+=1\r\n break\r\n\r\nif m==0:\r\n print('YES')\r\n", "import sys,math\r\ndef get_ints(): return map(int, sys.stdin.readline().strip().split())\r\ndef get_list(): return list(map(int, sys.stdin.readline().strip().split()))\r\ndef get_string(): return sys.stdin.readline().strip()\r\nk = int(input())\r\nar = [0]*10\r\nfor i in range(4):\r\n s = get_string()\r\n for x in s:\r\n if ord(x)<=57 and ord(x)>=49:\r\n ar[eval(x)] += 1\r\nfound = True\r\nfor x in ar:\r\n if x>2*k:\r\n print(\"NO\")\r\n found = False\r\n break\r\nif found:\r\n print(\"YES\")", "k = int(input()) * 2\r\nkyubeat = []\r\n[[kyubeat.append(i) for i in input() if i != '.'] for _ in range(4)]\r\nkyubeat = tuple(kyubeat)\r\nflag = True\r\ni = 0\r\n\r\nwhile flag and i < len(kyubeat):\r\n if kyubeat.count(kyubeat[i]) > k:\r\n flag = False\r\n i += 1\r\n \r\nprint(('NO', 'YES')[flag])\r\n", "mao = int(input())\n\nmao *= 2\n\nvet = [0]*10\n\nflag = True\n\nfor i in range(4):\n string = input()\n for letra in string:\n try:\n vet[int(letra)] += 1\n except:\n continue\n\nfor i in range(1,10):\n if vet[i] > mao:\n flag = False\n\nif flag:\n print(\"YES\")\n\nelse:\n print(\"NO\")", "fingers = int(input())*2\r\n\r\nvalue = [0 for i in range(0, 9)]\r\nresult = 'YES'\r\nfor i in range(4):\r\n for j in input().replace('.', ''):\r\n value[int(j) - 1] += 1\r\n \r\nfor i in value:\r\n if(i > fingers):\r\n result = 'NO'\r\n break\r\n\r\nprint(result)\r\n", "k = int(input())*2\r\nm = dict()\r\n\r\nfor _ in range(4):\r\n d = [c for c in input()]\r\n for c in d:\r\n if c != '.':\r\n m[c] = m.get(c, 0) + 1\r\n\r\nprint('YES' if all(v <= k for v in m.values()) else 'NO')\r\n", "multi = int(input())\r\ns = [0 for x in range(9)]\r\nfor x in range(4):\r\n l1 = list(input())\r\n for x in l1:\r\n if x!=\".\":\r\n s[int(x)-1]+=1\r\nif max(s)>2*multi:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n\r\n", "k = int(input())\nli = [0] * 10\nfor _ in range(4):\n a = input()\n for x in a:\n if x != \".\":\n li[int(x)] += 1\n\nmaxm = max(li)\nif maxm <= 2 * k:\n print(\"YES\")\nelse:\n print(\"NO\")", "k = int(input())\r\nm=[int(c) for row in range(4) for c in input().strip() if c != '.']\r\nprint(\"YES\" if all(m.count(t) <= 2 * k for t in set(m)) else \"NO\")", "k = 2 * int(input())\r\n\r\na = [0]*9\r\n\r\nfor i in range(4):\r\n l = [d for d in input()]\r\n for j in l:\r\n if j != \".\":\r\n a[int(j)-1] += 1\r\n\r\nif k >= max(a):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "I=input\r\nk=int(I())*2\r\ns=''\r\nfor _ in'0'*4:s+=I()\r\nprint('YNEOS'[any(s.count(str(i))>k for i in range(10))::2])", "k = int(input())\r\nl = []\r\nfor i in range(4):\r\n s = input()\r\n for j in s:\r\n l.append(j)\r\nb = 'YES'\r\nfor num in l:\r\n if l.count(num) > 2*k and num != '.':\r\n b = 'NO'\r\n break\r\nprint(b)", "k = int(input())\r\nnew_k = 2*k\r\nmat = []\r\nfor i in range(4):\r\n mat.append(input())\r\nrec = dict()\r\nfor i in range(4):\r\n for j in mat[i]:\r\n if j.isnumeric():\r\n if j in rec:\r\n rec[j] += 1\r\n else:\r\n rec[j] = 1\r\nflag = True\r\nfor k,v in rec.items():\r\n if v>new_k:\r\n flag = False\r\n break\r\nif flag:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "from math import *\r\nfrom collections import *\r\nfrom sys import *\r\nimport string\r\nimport re\r\nt=stdin.readline\r\np=stdout.write\r\ndef GI(): return map(int, input().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\nk=int(t())\r\na=[SL() for i in [0]*4]\r\nf=1\r\nfor i in range(1,10):\r\n c=sum([a[j][0].count(str(i)) for j in range(4)])\r\n if c>2*k: p('NO\\n');f=0;break\r\nif f: p('YES\\n')", "k = int(input())*2\r\ns = \"\"\r\nfor i in range(4):\r\n s+=input()\r\nls = []\r\nfor c in \"0123456789\":\r\n ls.append(s.count(c))\r\nif max(ls)>k:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "k, cnt = int(input())*2, [0]*10\nfor i in range(4):\n for ch in input():\n if ch != \".\":\n cnt[int(ch)] += 1\nprint(\"NO\" if max(cnt) > k else \"YES\")\n", "from collections import Counter\r\n\r\nI = input\r\n\r\nk = int(I())\r\nc = Counter(I()+I()+I()+I())\r\n\r\nprint('NO' if any(t!='.' and c[t]>2*k for t in c) else 'YES')", "k = int(input()) * 2\r\ncases = 4\r\nss = \"\"\r\nwhile cases:\r\n cases -= 1\r\n s = input()\r\n ss += s\r\n\r\nfor i in range(1, 10):\r\n if ss.count(str(i)) > k:\r\n print(\"NO\")\r\n exit()\r\nprint(\"YES\")\r\n\r\n", "k = int(input())\r\nk=2*k\r\nL=[0 for i in range(10)]\r\nfor i in range(4):\r\n l=list(input())\r\n for j in range(4):\r\n if l[j]!=\".\":\r\n L[int(l[j])]+=1\r\n\r\nco=True\r\nfor i in range(1,10):\r\n if L[i]>k:\r\n print(\"NO\")\r\n co=False\r\n break\r\nif(co):\r\n print(\"YES\")\r\n \r\n", "nums = [0 for i in range(10)]\nk = int(input())\n\nfor i in range(4):\n\ts = input()\n\tfor c in s:\n\t\tif c != '.':\n\t\t\tnums[int(c)] += 1\n\nif all(nums[i] <= 2*k for i in range(10)):\n\tprint('YES')\nelse:\n\tprint('NO')\n", "k = int(input())\r\ndigs = [input() for i in range(4)]\r\ndigs = \"\".join(digs)\r\nans = [digs.count(str(i)) for i in range(10)]\r\nif max(ans) > k * 2:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n", "from collections import Counter\nn = int(input())\ncnt = Counter()\nfor i in range(4):\n\tcnt += Counter(input())\nfor (a, b) in cnt.items():\n\tif a != '.' and b > 2 * n:\n\t\tprint('NO')\n\t\tbreak\nelse:\n\tprint('YES')\n", "from collections import Counter\r\nk=int(input())*2\r\nx=[]\r\nfor i in range(4):\r\n x.extend(list(input()))\r\nc=Counter(x)\r\nv=0\r\ndel c['.']\r\nfor i in c:\r\n if c[i]>k:\r\n v=1\r\n break\r\nif v==1:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "n = int(input())*2\r\nd = {1: 0, 2:0, 3:0, 4:0, 5:0, 6:0, 7:0, 8:0, 9:0}\r\n\r\nfor i in range(4):\r\n s = list(input())\r\n for j in s:\r\n if j != '.':\r\n d[int(j)] += 1\r\nflag = True\r\nfor i,v in d.items():\r\n if v > n:\r\n flag = False\r\n break\r\nif flag:\r\n print('YES')\r\nelse:\r\n print('NO')", "k = 2*int(input())\r\nl1 = input()\r\nl2 = input()\r\nl3 = input()\r\nl4 = input()\r\ntimes = [0,0,0,0,0,0,0,0,0]\r\nfor cont in range(0,4):\r\n for tmp in range(1,10):\r\n if l1[cont] == str(tmp):\r\n times[tmp-1] += 1\r\n if l2[cont] == str(tmp):\r\n times[tmp-1] += 1\r\n if l3[cont] == str(tmp):\r\n times[tmp-1] += 1\r\n if l4[cont] == str(tmp):\r\n times[tmp-1] += 1\r\n\r\nl = True\r\nfor tmp in times:\r\n if tmp > k:\r\n l = False\r\n\r\nif l == True:\r\n print('YES')\r\nelse:\r\n print('NO')", "n=int(input())\r\nl=[0]*12\r\nfor u in range(4):\r\n s=list(input())\r\n for i in s:\r\n if(i.isdigit()):\r\n l[int(i)]+=1\r\nfor i in l:\r\n if(i>2*n):\r\n print(\"NO\")\r\n break\r\nelse:\r\n print(\"YES\")\r\n", "n=int(input())\r\n\r\np=[]\r\nflag=0\r\nfor i in range(0,4):\r\n p.append(input())\r\nfor i in range(1,10):\r\n count=0\r\n for j in range(0,4):\r\n for k in range(0,4):\r\n if p[j][k]!='.':\r\n x=int(p[j][k])\r\n if x==i:\r\n count=count+1\r\n if count>(2*n):\r\n flag=1\r\nif flag==1:\r\n print('NO')\r\nelse:\r\n print('YES')\r\n", "k=int(input())\n\nL={}\ns=\".123456789\"\nfor item in s:\n L[item]=0\nfor i in range(4):\n s=input()\n for item in s:\n L[item]+=1\n\ns=\"123456789\"\ndone=True\nfor item in s:\n if(L[item]>2*k):\n print(\"NO\")\n done=False\n break\nif(done):\n print(\"YES\")\n", "k = int(input())\r\ndata = [0]*10\r\nfor _ in range(4):\r\n s = input()\r\n for i in s:\r\n if i != '.':\r\n data[int(i)] += 1\r\nans = True\r\nfor i in range(1, 10):\r\n if data[i] > 2*k:\r\n ans = False\r\nprint('YES' if ans else 'NO')\r\n\n# Mon Aug 12 2019 15:08:31 GMT+0300 (MSK)\n", "n = int(input())\r\ntempo = {}\r\npainel = []\r\nboolean = True\r\nfor i in range(4):\r\n painel.append([int(i) for i in input() if i != \".\"])\r\n for k in painel[i]:\r\n if not (k in tempo):\r\n tempo[k] = 1\r\n else:\r\n tempo[k] += 1\r\n\r\nfor i in tempo:\r\n if tempo[i] > 2*n:\r\n boolean = False\r\n\r\nif boolean == False:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n\r\n", "n = int(input())\r\narr = [0]*10\r\nfor _ in range(4):\r\n for i in list(input()):\r\n if i.isdigit():\r\n arr[int(i)] += 1\r\nfor i in arr:\r\n if i > (2 * n):\r\n print(\"NO\")\r\n break\r\nelse:\r\n print(\"YES\")\r\n", "k = int(input())\r\nd = {}\r\nfor _ in range(4):\r\n for j in input():\r\n if j=='.': continue\r\n if j not in d: d[j] = 1\r\n else: d[j]+=1\r\n if d[j]>2*k: print('NO'); exit()\r\n\r\nprint('YES')", "k = int(input())\r\na = []\r\nfor i in range(4):\r\n s = input()\r\n for j in s:\r\n if j.isdigit():\r\n a.append(int(j))\r\nfor i in range(1, 10):\r\n if a.count(i) > k * 2:\r\n print(\"NO\")\r\n break\r\nelse:\r\n print(\"YES\")", "k=int(input())\r\nv=[[j for j in input() if(j.isdigit())] for i in range(4)]\r\nm={}\r\nfor x in v:\r\n for y in x:\r\n m[y]=m.get(y,0)+1\r\nb=True\r\nfor i in m: \r\n if(m[i]>2*k):b=False\r\nprint(\"YES\" if b else \"NO\")\r\n", "n=int(input())*2\r\na=[0]*10\r\nfor i in range(4):\r\n s=input()\r\n for j in s:\r\n if j!='.':\r\n a[int(j)]+=1\r\n\r\nprint('NO' if max(a)>n else 'YES')\r\n \r\n\r\n", "k=int(input())*2\nd={}\nimpossible=False\nv=[input() for i in range(4)]\nfor i in range(4):\n\tfor j in v[i]:\n\t\tif j in d:\n\t\t\td[j]+=1\n\t\t\tif(j!='.'):\n\t\t\t\tif d[j]>k:\n\t\t\t\t\timpossible=True\n\t\telse:\n\t\t\td[j]=1\nif(impossible):\n\tprint(\"NO\")\nelse:\n\tprint(\"YES\")\n\t \t\t \t \t \t\t \t\t\t \t \t\t\t \t", "k=int(input())\r\npanels=list(input())\r\nfor _ in range(3):\r\n panels.extend(list(input()))\r\nans='YES'\r\nfor i in range(1,10):\r\n num=0\r\n for j in range(16):\r\n if panels[j]!='.':\r\n if int(panels[j])==i:\r\n num+=1\r\n if num>k*2:\r\n ans='NO'\r\nprint(ans)", "k = int(input())\r\ns = \"\"\r\nfor _ in range(4):\r\n s = s + input()\r\nfor i in range(1,10):\r\n if str(i) in s:\r\n if s.count(str(i)) > (2 * k):\r\n print(\"NO\")\r\n break\r\n else:\r\n pass\r\n else:\r\n pass\r\nelse:\r\n print(\"YES\")", "k=int(input())\r\nb=[]\r\nfor i in range(4):\r\n c=input()\r\n b.append(c)\r\na=\"\".join(b)\r\nif a.count('1')>(2*k):\r\n print('NO')\r\nelif a.count('2')>(2*k):\r\n print('NO')\r\nelif a.count('3')>(2*k):\r\n print('NO')\r\nelif a.count('4')>(2*k):\r\n print('NO')\r\nelif a.count('5')>(2*k):\r\n print('NO')\r\nelif a.count('6')>(2*k):\r\n print('NO')\r\nelif a.count('7')>(2*k):\r\n print('NO')\r\nelif a.count('8')>(2*k):\r\n print('NO')\r\nelif a.count('9')>(2*k):\r\n print('NO')\r\nelse:\r\n print('YES')\r\n ", "k=int(input())\r\nd={}\r\nfor i in range(4):\r\n s=input()\r\n for i in s:\r\n if i!=\".\":\r\n if i not in d.keys():\r\n d[i]=1\r\n else:\r\n d[i]+=1\r\n\r\n\r\nif len(d.keys())==0:\r\n print(\"YES\")\r\nelse:\r\n if max(d.values())>2*k:\r\n print(\"NO\")\r\n else:\r\n print(\"YES\")", "from collections import defaultdict\r\n\r\nPanels = defaultdict(int)\r\nSize = int(input())\r\nfor i in range(4):\r\n X = input()\r\n for i in X:\r\n Panels[i] += 1\r\nif '.' in Panels.keys():\r\n Panels.__delitem__('.')\r\nfor i in Panels.keys():\r\n if Panels[i] > 2 * Size:\r\n print(\"NO\")\r\n exit()\r\nprint(\"YES\")\r\n", "k=int(input())\r\nstring=\"\"\r\nd={}\r\nfor i in range(4):\r\n string+=input()\r\n\r\nfor i in string:\r\n if i==\".\":\r\n continue\r\n if i not in d :\r\n d[i]=1\r\n else:\r\n d[i]+=1\r\n if d[i]>2*k:\r\n print(\"NO\")\r\n exit()\r\nprint(\"YES\")", "n = int(input())\r\npanels = [y for x in [list(map(int, filter(lambda x: x != \".\", list(input())))) for x in range(4)] for y in x]\r\ntimes = set(panels)\r\nfor x in times:\r\n if n * 2 < panels.count(x):\r\n print(\"NO\")\r\n break\r\nelse:\r\n print(\"YES\")", "k=int(input())\r\ng=''\r\nfor i in range(4):\r\n g = g+input()\r\n#print(g)\r\nvalid=True\r\nfor i in range(1,10):\r\n if g.count(str(i))>2*k:\r\n valid=False\r\n break\r\nif valid:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "def main():\r\n k = int(input())\r\n ncount = [0, 0, 0, 0, 0, 0, 0, 0, 0]\r\n for _ in range(4):\r\n for char in input():\r\n if char == \".\":\r\n continue\r\n ncount[int(char)-1] += 1\r\n result = True\r\n\r\n for i in range(9):\r\n if ncount[i] > 2*k:\r\n result = False\r\n break\r\n if result: print(\"YES\")\r\n else: print(\"NO\")\r\n\r\n\r\nmain()", "k = int(input()) * 2\r\nc = [0] * 9\r\nfor i in range(4):\r\n s = input()\r\n c[0] += s.count('1')\r\n c[1] += s.count('2')\r\n c[2] += s.count('3')\r\n c[3] += s.count('4')\r\n c[4] += s.count('5')\r\n c[5] += s.count('6')\r\n c[6] += s.count('7')\r\n c[7] += s.count('8')\r\n c[8] += s.count('9')\r\nif max(c) > k:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "k=int(input())\r\na=[]\r\nfor i in range(4):\r\n s=str(input())\r\n for j in s:\r\n if j!='.':\r\n a.append(int(j))\r\nflag=0\r\nfor i in range(1,10):\r\n if a.count(i)>2*k:\r\n flag=1\r\nif flag==0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n \r\n ", "k = int(input())\r\npanels = [input() for _ in range(4)]\r\ncounts = [0] * 10\r\n\r\nfor row in panels:\r\n for panel in row:\r\n if panel != '.':\r\n counts[int(panel)] += 1\r\n\r\nif max(counts) > k * 2:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "n = int(input())\r\nstring = \"\"\r\nfor _ in range(4):\r\n string = string + input()\r\nstring = string.replace('.', '')\r\ncheck_string = list(set(string))\r\nfor i in check_string:\r\n if(string.count(i) > 2*n):\r\n print(\"NO\")\r\n break;\r\nelse:\r\n print(\"YES\")", "k=int(input())\ns=[]\n\nfor i in range(4):\n a=list(input())\n s = s + a\n\nc=[0 for i in range(9)]\nfor j in s:\n if j != \".\":\n c[int(j)-1]+=1\n\nfor f in c:\n if f > 2 * k:\n print(\"NO\")\n exit()\nprint(\"YES\")\n", "\ndef collecting(k):\n\tn = [k*2]*9\n\tfor t in range(4):\n\t\tfor c in input():\n\t\t\tif c != '.':\n\t\t\t\ti = int(c)-1\n\t\t\t\tn[i] -= 1\n\t\t\t\tif n[i] < 0:\n\t\t\t\t\tprint('NO')\n\t\t\t\t\treturn\n\tprint('YES')\n\treturn\n\ndef main():\n\tk = int(input())\n\tcollecting(k)\n\nif __name__ == '__main__':\n\tmain()", "k = int(input())\n\nl = [0] * 10\n\nfor i in range(4):\n for j in input():\n if (j != '.'):\n l[int(j)] += 1\nfor i in range(10):\n if l[i] > k*2:\n print(\"NO\")\n exit()\nprint(\"YES\")\n\n", "n=int(input())\r\na=[]\r\nc=0\r\nfor i in range(4):\r\n for j in input():\r\n if j!='.':\r\n a.append(j)\r\nfor i in range(len(a)):\r\n a[i]=int(a[i])\r\nfor i in a:\r\n if a.count(i)<=2*n:\r\n continue\r\n else:c+=1\r\nif c==0:print(\"YES\")\r\nelse:print(\"NO\")", "from sys import stdin,stdout\r\nLI=lambda:list(map(int,input().split()))\r\nMAP=lambda:map(int,input().split())\r\nIN=lambda:int(input())\r\nS=lambda:input()\r\nimport math\r\nfrom collections import Counter\r\n\r\ndef solve():\r\n k=IN()*2\r\n ans=\"YES\"\r\n d=[0 for i in range(10)]\r\n for i in range(4):\r\n s=S()\r\n for i in s:\r\n if i!=\".\":\r\n d[int(i)]+=1\r\n if d[int(i)]>k:ans=\"NO\"\r\n print(ans)\r\nfor i in range(1):\r\n solve()\r\n\r\n", "\r\nn = int(input())\r\nbase, track, ans = [], {}, 'YES'\r\nfor t in range(4):\r\n s = input()\r\n base.append(s)\r\nfor i in range(len(base)):\r\n for e in range(len(base[i])):\r\n if base[i][e] != '.':\r\n if base[i][e] not in track:\r\n track[base[i][e]] = 0\r\n if base[i][e] in track:\r\n track[base[i][e]] += 1\r\nls = list(track.values())\r\nfor i in range(len(ls)):\r\n if ls[i] > n * 2:\r\n ans = 'NO'\r\n break\r\nprint(ans)\r\n", "n = int(input())\nn *=2\nc = [0]*11\nk=[]\nfor i in range(4):\n\tk.append(input())\nfor i in k:\n\tfor t in i:\n\t\tif t!='.':\n\t\t\tc[ord(t)-ord('0')]+=1\nif max(c)>n:\n\tprint(\"NO\")\nelse:\n\tprint(\"YES\")\n", "k = int(input())\r\ntable = [0] * 10\r\nfor i in range(4):\r\n for j in input(): \r\n try: \r\n table[int(j)] +=1 \r\n except:\r\n pass\r\n\r\nif max(table) <= k*2:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n ", "k=int(input())*2\r\nstring=''.join(input() for _ in range(4))\r\nif max(string.count(char) for char in '0123456789')>k:\r\n print ('NO')\r\nelse:\r\n print('YES')", "d=[0]*10\nk = int(input())\nch = True\nfor i in range(4):\n for c in input():\n if c != '.':\n d[int(c)] += 1\n if d[int(c)] > 2 * k:\n ch = False\n \nprint(\"YES\" if ch else \"NO\")\n", "from collections import Counter as C\r\ndef miis():\r\n return map(int, input().split())\r\n\r\nn = int(input())\r\na = [input() for i in range(4)]\r\nc = C(a[0])+C(a[1])+C(a[2])+C(a[3])\r\nif '.' in c:\r\n c.pop('.')\r\nfor i in c:\r\n if c[i] > 2*n:\r\n print(\"NO\")\r\n break\r\nelse:\r\n print(\"YES\")\r\n", "k = int(input())\r\nv = []\r\n\r\nfor i in range(4):\r\n row = list(input()) \r\n v.append(row)\r\n\r\noccurrences = [0] * 10 \r\n\r\nfor i in range(4):\r\n for j in range(4):\r\n if v[i][j].isdigit():\r\n occurrences[int(v[i][j])] += 1\r\n\r\nperfect_timing = all(count <= 2 * k for count in occurrences[1:]) \r\n\r\nif perfect_timing:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "def main():\r\n k = int(input())\r\n p = []\r\n for _ in range(4):\r\n p.append(list(input()))\r\n\r\n d = dict([(i, 0) for i in range(10)])\r\n for i in range(4):\r\n for j in range(4):\r\n if p[i][j] == '.':\r\n continue\r\n\r\n d[ord(p[i][j])- ord('0')] += 1\r\n if d[ord(p[i][j])- ord('0')] > 2 * k:\r\n print(\"NO\")\r\n return\r\n\r\n print(\"YES\")\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n\r\n\r\n", "\r\nn = int(input())\r\nptimes = {}\r\n\r\nfor i in range(4):\r\n a = list(map(str,input()))\r\n for j in a:\r\n if j not in '.':\r\n if int(j) not in ptimes.keys():\r\n ptimes[int(j)] = 1\r\n else:\r\n ptimes[int(j)] += 1\r\nans='YES' \r\nfor key,item in ptimes.items():\r\n if item > 2*n:\r\n ans='NO'\r\n break\r\n\r\nprint(ans)\r\n", "n=int(input())*2\r\nl=[0]*10\r\nfor i in range(4):\r\n a=input()\r\n for j in a:\r\n if j!='.':\r\n l[int(j)]+=1\r\n\r\nprint('NO' if max(l)>n else 'YES')\r\n \r\n\r\n", "from collections import Counter\r\nn = int(input())\r\ns = input() + input() + input() + input()\r\nc = Counter(s)\r\nif '.' in c: del c['.']\r\nif len(c) == 0:\r\n print(\"YES\")\r\nelse:\r\n print([\"NO\",\"YES\"][max(c.values()) <= 2* n])", "k = int(input())\r\ns = ''\r\nfor i in range(4):\r\n s = s + input()\r\n\r\nfor i in range(1, 10):\r\n if s.count(str(i)) > k * 2:\r\n print('NO')\r\n break\r\nelse:\r\n print('YES')\r\n", "k = 2 * int(input())\r\nc = \"\"\r\nd = 0\r\nfor i in range(4):\r\n c += input()\r\nfor i in range(1,10):\r\n if c.count(str(i)) > k:\r\n print(\"NO\")\r\n d = 1\r\nif d == 0:\r\n print(\"YES\")\r\n ", "k = int(input())\r\na = []\r\nfor i in range(4):\r\n for j in input():\r\n if j=='.':\r\n continue\r\n else:\r\n a.append(j)\r\nfor i in a:\r\n if a.count(i)<=2*k:\r\n continue\r\n else:\r\n print('NO')\r\n exit()\r\nprint('YES') \r\n", "k = int(input())\r\nresult = True\r\ndp = dict()\r\nfor i in range(4):\r\n s = list(input())\r\n for j in s:\r\n if j in dp.keys():\r\n dp[j] += 1\r\n continue\r\n dp[j] = 1\r\nfor i in dp.keys():\r\n if dp[i] > k*2 and i != '.':\r\n result = False\r\n break\r\nif result:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "k=int(input())\r\na=True\r\narr=[0]*10\r\nfor _ in range(0,4):\r\n b=list(input())\r\n for i in range(0,4):\r\n if(b[i]!='.'):\r\n arr[int(b[i])]+=1\r\nfor i in range(0,10):\r\n if(arr[i]>2*k):\r\n a=False \r\nif(a):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "k = int(input())\r\nans = ''\r\nfor _ in range(4):\r\n ans += input()\r\na = [0 for _ in range(9)]\r\nfor i in range(16):\r\n if ans[i] != '.':\r\n a[int(ans[i])-1] += 1\r\nif max(a) <= k*2:\r\n print('YES')\r\nelse:\r\n print('NO')", "\r\nn = int(input())\r\n\r\nl = []\r\nfor _ in range(4):\r\n\tl.extend(list(input()))\r\n\r\ndots = l.count('.')\r\nfor _ in range(dots):\r\n\tl.remove('.')\r\n\r\n\r\nfor i in set(l):\r\n\tif l.count(i) > 2 * n:\r\n\t\tprint('NO')\r\n\t\texit()\r\n\r\nprint('YES')", "k = int(input())\r\nboard = {\"1\": 0, \"2\": 0, \"3\": 0, \"4\": 0,\r\n \"5\": 0, \"6\": 0, \"7\": 0, \"8\": 0, \"9\": 0}\r\nfor i in range(4):\r\n row = input()\r\n for j in range(4):\r\n if row[j] != '.':\r\n board[row[j]] = board[row[j]]+1\r\nif max(board.values()) <= 2*k:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "k=int(input())\r\nl=[0]*10\r\nfor i in range(4):\r\n for j in input():\r\n if (j != '.'):\r\n l[int(j)] += 1\r\nfor i in range(10):\r\n if l[i] > k*2:\r\n print(\"NO\")\r\n exit()\r\nprint(\"YES\")", "def solve(l, k):\r\n for i in l:\r\n if i > 2*k:\r\n return \"NO\"\r\n return \"YES\"\r\n\r\nk = int(input())\r\ncount = [0 for x in range(10)]\r\nfor _ in range(4):\r\n\ts = input()\r\n\tfor i in range(4):\r\n\t\tif s[i] != '.':\r\n\t\t\tcount[int(s[i])] += 1\r\nprint(solve(count,k))\r\n", "import sys\r\n \r\ninp = sys.stdin.readline\r\n \r\ncnt = [0] * 15\r\nk = int(inp())\r\nfor i in range(4):\r\n line = inp().strip()\r\n for c in line:\r\n if c != '.':\r\n cnt[ord(c) - ord('0')] += 1\r\nfor x in cnt:\r\n if x > k * 2:\r\n print('NO')\r\n exit(0)\r\nprint('YES')", "# Made By Mostafa_Khaled \nbot = True \nk=int(input())*2\n\ns=''.join(input() for _ in range(4))\n\nif max(s.count(c) for c in '0123456789')>k:\n\n print ('NO')\n\nelse:\n\n print('YES')\n\n# Made By Mostafa_Khaled", "n = int(input())\r\nd = [0]*9\r\nfor i in range(0,4):\r\n s = input()\r\n for x in s:\r\n if x != '.':\r\n d[int(x)-1] +=1\r\nif max(d) > 2*n: print(\"NO\")\r\nelse: print(\"YES\")", "n = int(input())\r\na = [0]*10\r\nfor i in range(4):\r\n s = input()\r\n for t in s:\r\n if t !='.':\r\n a[int(t)] +=1\r\nrs = 0\r\nfor i in a:\r\n rs = max (rs , i)\r\nif rs <= n*2:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "k,s=int(input()),''\r\nfor i in range(4):\r\n s=s+input()\r\n \r\nfor i in range(1,10):\r\n if(s.count(str(i))>k*2):\r\n exit(print('NO'))\r\nprint('YES')", "k =int(input())\r\na = {}\r\nflag = 0\r\nfor i in range(4):\r\n\ts = input()\r\n\tfor j in range(4):\r\n\t\tif(s[j] != '.'):\r\n\t\t\tif(s[j] not in a.keys()):\r\n\t\t\t\ta[s[j]] = 1\r\n\t\t\telse:\r\n\t\t\t\ta[s[j]] += 1\r\n\t\t\t\tif(a[s[j]] > 2*k):\r\n\t\t\t\t\tflag = 1\r\n\r\n\r\nif(flag == 0):\r\n\tprint('YES')\r\nelse:\r\n\tprint('NO')", "k=int(input());d=dict()\r\nfor _ in range(4):\r\n s=input()\r\n for i in s:\r\n if i!='.':\r\n try:d[i]+=1\r\n except:d[i]=1\r\ncon=True\r\nfor j in d:\r\n if d[j]>2*k:print('NO');con=False;break\r\nif con:print('YES')", "beats = 2 * int(input())\r\nans = \"YES\"\r\narray = []\r\nrow1, row2, row3, row4 = input(),input(),input(),input()\r\nfor i in range(4):\r\n array\r\narray = row1 + row2 + row3 + row4\r\nfor i in range(1, 10):\r\n if array.count(str(i)) > beats:\r\n ans = \"NO\"\r\nprint(ans)", "K = int(input())\n\npanels = [None] * 4\nfor i in range(4):\n panels[i] = input()\n\n\nall_hands = K * 2\n\ndigits_lis = [0] * 9\n\nfor i in range(4):\n digits_lis[0] += panels[i].count('1')\n digits_lis[1] += panels[i].count('2')\n digits_lis[2] += panels[i].count('3')\n digits_lis[3] += panels[i].count('4')\n digits_lis[4] += panels[i].count('5')\n digits_lis[5] += panels[i].count('6')\n digits_lis[6] += panels[i].count('7')\n digits_lis[7] += panels[i].count('8')\n digits_lis[8] += panels[i].count('9')\n\nif max(digits_lis) > all_hands:\n print('NO')\nelse:\n print('YES')\n", "from collections import Counter\r\nk=int(input())\r\nstring=\"\"\r\nstring+=input();string+=input();string+=input();string+=input()\r\nstring=list(string)\r\nstring=[i for i in string if i!='.']\r\nstring=Counter(string)\r\ncount=string.most_common(1)\r\ntry:\r\n cnt=count[0][1]\r\n if cnt<=2*k:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\nexcept:\r\n print(\"YES\")", "if __name__ == \"__main__\":\n k = int(input())\n painel = []\n for i in range(4):\n linha = input()\n painel.append(linha)\n \n quantidade_tempo = [0 for _ in range(9)]\n for i in range(4):\n for j in range(4):\n tempo = painel[i][j] \n if tempo != '.':\n quantidade_tempo[int(tempo) - 1] += 1\n \n maior = 0\n for q in quantidade_tempo:\n if q > maior:\n maior = q\n if k * 2 >= maior:\n print('YES')\n else:\n print('NO')\n ", "k = 2 * int(input())\r\nins = [x for i in range(4) for x in input() if 47 < ord(x) < 58]\r\n\r\ncountDict = {}\r\nfor elemnt in ins:\r\n try:\r\n countDict[elemnt] += 1\r\n except:\r\n countDict[elemnt] = 1\r\nvar = True\r\nfor count in countDict:\r\n if countDict[count] > k:\r\n var = False\r\n print(\"NO\")\r\n break\r\nif var:\r\n print(\"YES\") ", "def main():\n k = int(input()) * 2\n l = [0] * 10\n for _ in range(4):\n for c in input():\n if c != '.':\n l[int(c)] += 1\n print(('NO', 'YES')[max(l) <= k])\n\n\nif __name__ == '__main__':\n main()\n", "from collections import Counter\r\nk = int(input())\r\ns = ''\r\nfor i in range(4):\r\n s += input()\r\ns = Counter(s)\r\nif '.' in s.keys():\r\n s.pop('.')\r\nwhile s:\r\n if s.popitem()[1]>2*k:\r\n print('NO')\r\n break\r\nelse:\r\n print('YES')\r\n", "k = int(input())*2\r\ns = \"\"\r\nfor i in range(4):\r\n s += input()\r\n\r\nd = {}\r\nfor button in s:\r\n d[button] = d.get(button, 0) + 1\r\n\r\nflg = 1\r\nfor b in d:\r\n if b==\".\":\r\n continue\r\n if d[b]>k:\r\n flg = 0\r\n break\r\nif flg:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "from sys import exit\r\nthings = int(input())\r\n\r\nlist = []\r\n\r\nfor i in range(4):\r\n list.append([char for char in input()])\r\n\r\nfor i in range(9):\r\n count = 0\r\n for j in range(4):\r\n count += list[j].count(str(i+1))\r\n if count > things*2:\r\n print('NO')\r\n exit(0)\r\nprint('YES')\r\n", "k=int(input())\r\nl=[]\r\nc=[]\r\nfor i in range(4):\r\n l.append(input())\r\nfor i in range(10):\r\n c.append(l[0].count(str(i))+l[1].count(str(i))+l[2].count(str(i))+l[3].count(str(i)))\r\nprint(\"YES\") if(max(c)<=2*k) else print(\"NO\")", "def check(dic, k):\r\n \r\n for ele in dic:\r\n if dic[ele]>2*k:\r\n return 'NO'\r\n return 'YES'\r\n \r\n \r\nk= int(input())\r\n\r\nmat=[]\r\ndic={0:1}\r\nfor i in range(4):\r\n temp= list(input())\r\n mat.append(temp)\r\n\r\nfor i in range(4):\r\n for j in range(4):\r\n if mat[i][j] not in dic and mat[i][j]!='.':\r\n dic[mat[i][j]]=1\r\n elif mat[i][j] in dic and mat[i][j]!='.':\r\n dic[mat[i][j]]+=1\r\n else:\r\n dic[mat[i][j]]=1\r\nprint(check(dic,k))", "x = int(input())\r\nz = []\r\nw = []\r\nq = [0,0,0,0,0,0,0,0,0,0,0]\r\ns = []\r\nfor i in range(4):\r\n z[0:] = map(str,input())\r\n w.append(z[:])\r\nfor i in range(4):\r\n for j in range(4):\r\n if w[i][j] != '.':\r\n #q.insert(int(w[i][j]),q[int(w[i][j])]+1)\r\n q[int(w[i][j])] = q[int(w[i][j])] + 1\r\n\r\nif max(q) > 2 * x:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "num = lambda: int(input())\nnums = lambda: map(int, input().split(' '))\nstring = lambda: input()\nyes = lambda: print(\"YES\")\nno = lambda: print(\"NO\")\n\nk = num()\ns = string() + string() + string() + string()\nm = {}\nfor n in s:\n if(n != '.'):\n x = int(n)\n m[x] = m.get(x, 0) + 1\n\nok = True\n\nfor val in m.values():\n if(val > k*2):\n ok = False\n break\n\nif ok:\n yes()\nelse:\n no()", "k = int(input())\r\nd = {1:0,2:0,3:0,4:0,5:0,6:0,7:0,8:0,9:0}\r\nflag = True\r\nfor i in range(4):\r\n s = input()\r\n for i in s:\r\n if i == \".\":\r\n continue\r\n else:\r\n \r\n i = int(i)\r\n d[i]+=1\r\n\r\nfor s,v in d.items():\r\n\r\n if v > (2*k):\r\n print(\"NO\")\r\n flag = False\r\n break\r\nif flag:\r\n print(\"YES\")", "k = int(input())\r\ns = ''\r\nn = list()\r\nfor i in range(4):\r\n a = input()\r\n s = s + a\r\nfor i in range(1,10):\r\n n.append(s.count(str(i)))\r\nif max(n)> 2*k:\r\n print ('NO')\r\nelse:\r\n print ('YES')", "from collections import Counter\r\nn=int(input())*2\r\nc=Counter()\r\nfor i in' '*4:\r\n for i in input():\r\n if i!='.':c[i]+=1\r\nprint(['NO','YES'][all(c[i]<=n for i in c)])\r\n" ]

[ "import sys\r\ninput = sys.stdin.readline\r\nn, m = map(int, input().split())\r\na, pos = [], []\r\nfor i in range(n):\r\n a.append(input().rstrip())\r\n for j in range(m):\r\n if a[i][j] != '.' and a[i][j] != '#':\r\n pos.append((i, j))\r\nW = [[0]*(m+3) for i in range(n+3)]\r\nfor i in range(n):\r\n for j in range(m):\r\n if a[i][j] != '#':\r\n W[i][j] = W[i][j-1] + 1\r\nE = [[0]*(m+3) for i in range(n+3)]\r\nfor i in range(n):\r\n for j in range(m-1, -1, -1):\r\n if a[i][j] != '#':\r\n E[i][j] = E[i][j+1] + 1\r\nN = [[0]*(m+3) for i in range(n+3)]\r\nfor j in range(m):\r\n for i in range(n):\r\n if a[i][j] != '#':\r\n N[i][j] = N[i-1][j] + 1\r\nS = [[0]*(m+3) for i in range(n+3)]\r\nfor j in range(m):\r\n for i in range(n-1, -1, -1):\r\n if a[i][j] != '#':\r\n S[i][j] = S[i+1][j] + 1\r\nk = int(input())\r\nd, l = [0]*k, [0]*k\r\nfor i in range(k):\r\n di, li = input().split()\r\n d[i], l[i] = di, int(li)\r\n\r\nkq = []\r\nfor x, y in pos:\r\n ok, dut = 1, a[x][y]\r\n for i in range(k):\r\n if d[i] == 'E':\r\n if E[x][y] - 1 < l[i]:\r\n ok = 0\r\n break\r\n else:\r\n y += l[i]\r\n\r\n if d[i] == 'W':\r\n if W[x][y] - 1 < l[i]:\r\n ok = 0\r\n break\r\n else:\r\n y -= l[i]\r\n\r\n if d[i] == 'N':\r\n if N[x][y] - 1 < l[i]:\r\n ok = 0\r\n break\r\n else:\r\n x -= l[i]\r\n continue\r\n\r\n if d[i] == 'S':\r\n if S[x][y] - 1 < l[i]:\r\n ok = 0\r\n break\r\n else:\r\n x += l[i]\r\n if ok == 1:\r\n kq.append(dut)\r\n \r\nif len(kq) == 0:\r\n print('no solution')\r\nelse:\r\n kq.sort()\r\n print(''.join(kq))" ]

[ "n = int(input())\r\narr = []\r\nfor i in range(n):\r\n arr.append(list(map(int, input().split())))\r\narr.sort(key=lambda x: x[1])\r\nt = int(input())\r\np = list(map(int, input().split()))\r\np.insert(0, 0)\r\np.append(1e12+1)\r\nrate = 1\r\nret = 0\r\nfor i in range(1, len(p)):\r\n diff = p[i]-p[i-1]\r\n a = 0\r\n while arr and a < diff:\r\n cnt, score = arr.pop(0)\r\n if cnt+a <= diff:\r\n ret += cnt*score*rate\r\n a += cnt\r\n cnt = 0\r\n else:\r\n ret += (diff-a)*score*rate\r\n cnt -= (diff-a)\r\n a = diff\r\n if cnt != 0:\r\n arr.insert(0,[cnt,score])\r\n rate += 1\r\nprint(ret)\r\n", "if __name__ == '__main__':\n n = int(input())\n pieces = [input() for _ in range(n)]\n pieces = [_.split() for _ in pieces]\n pieces = [tuple(_) for _ in pieces]\n pieces = [[int(k), int(c)] for k, c in pieces]\n t = int(input())\n p = input().split()\n p = [int(_) for _ in p]\n\n pieces = sorted(pieces, key=lambda x: x[1])\n\n values = []\n count = 0\n i = 0\n j = 0\n while i < n and j < t:\n if count + pieces[i][0] < p[j]:\n values.append((pieces[i][0], pieces[i][1], j + 1))\n count += pieces[i][0]\n i += 1\n elif count + pieces[i][0] == p[j]:\n values.append((pieces[i][0], pieces[i][1], j + 1))\n count += pieces[i][0]\n i += 1\n j += 1\n else:\n diff = p[j] - count\n values.append((diff, pieces[i][1], j + 1))\n count = p[j]\n j += 1\n pieces[i][0] -= diff\n while i < n:\n values.append((pieces[i][0], pieces[i][1], j + 1))\n i += 1\n score = 0\n for a, b, c in values:\n score += a * b * c \n print(score)\n", "from cmath import inf\r\nfrom operator import itemgetter\r\nfrom typing import *\r\nfrom collections import deque, Counter, defaultdict\r\nfrom bisect import *\r\nimport heapq, math\r\nfrom functools import cmp_to_key, reduce\r\nfrom itertools import groupby, islice, zip_longest\r\n\r\n# from sortedcontainers import SortedSet, SortedList\r\n\r\n\r\ndef main():\r\n n = int(input())\r\n num, val = zip(*(map(int, input().split()) for _ in range(n)))\r\n T = int(input())\r\n p = list(map(int, input().split()))\r\n tmp = sum(num)\r\n while len(p) > 0 and p[-1] > tmp:\r\n p.pop(-1)\r\n p.append(tmp)\r\n num, val = zip(*sorted(zip(num, val), key=itemgetter(1)))\r\n count, ans, factor = 0, 0, 1\r\n for x, y in zip(num, val):\r\n while x != 0:\r\n tmp = min(x, p[0] - count)\r\n x -= tmp\r\n count += tmp\r\n ans += tmp * factor * y\r\n if p[0] == count:\r\n p.pop(0)\r\n factor += 1\r\n print(ans)\r\n\r\n\r\nmain()", "n=int(input())\r\na=[list(map(int,input().split()))[::-1] for i in range(n)]\r\nt=int(input())\r\np=list(map(int,input().split()))\r\nb=0\r\ni=0\r\na.sort()\r\nc=0\r\nfor j in range(n):\r\n while i<t and p[i]-b<=a[j][1]:\r\n c+=(p[i]-b)*(i+1)*a[j][0]\r\n a[j][1]-=p[i]-b\r\n b=p[i]\r\n i+=1\r\n c+=a[j][1]*(i+1)*a[j][0]\r\n b+=a[j][1]\r\nprint(c)", "'''\\https://codeforces.com/contest/175/problem/C\r\n\r\n输入 n(≤100) 表示 n 种怪物，然后输入 n 行，每行两个数字表示怪物的数量 (≤1e9)，和怪物的分数(≤1000)。\r\n然后输入 t(≤100) 和一个长为 t 的数组 p，下标从 1 开始，1≤p[1]<p[2]<...<p[t]≤1e12，\r\n表示在你累计击败 p[i] 个怪物之后，得分系数将变为 i+1（初始得分系数为 1）。\r\n击败一只怪物的得分 = 怪物的分数 * 当前得分系数。\r\n你可以按照任意顺序打怪，输出击败所有怪物后的最大得分。\r\n输入\r\n1\r\n5 10\r\n2\r\n3 6\r\n输出 70\r\n解释 前三只怪物得分系数为 1，后两只怪物得分系数为 2，总分=3*10*1+2*10*2=70\r\n\r\n输入\r\n2\r\n3 8\r\n5 10\r\n1\r\n20\r\n输出 74\r\n解释 所有怪物的得分系数均为 1，总分=3*8*1+5*10*1=74\r\n'''\r\nn = int(input())\r\narr = []\r\nfor _ in range(n):\r\n a, b = map(int, input().split())\r\n arr.append((a, b))\r\n\r\narr.sort(key=lambda x: x[1])\r\nt = int(input())\r\nnums = list(map(int, input().split()))\r\n\r\nj = 0\r\npre = 0\r\nres = 0\r\nfor i, (a, b) in enumerate(arr, start=1):\r\n\r\n while j < t and pre + a >= nums[j]:\r\n res += (nums[j] - pre) * (j+1) * b\r\n a -= nums[j] - pre\r\n pre = nums[j]\r\n j += 1\r\n\r\n res += a * (j+1) * b\r\n pre += a\r\n\r\nprint(res)\r\n", "import collections\r\nimport os\r\nimport sys\r\nfrom collections import Counter\r\n\r\nif os.getenv('LOCALCFTEST'):\r\n sys.stdin = open('cfinput.txt')\r\nelse:\r\n input = sys.stdin.readline\r\nMOD = 10 ** 9 + 7\r\n\r\n\r\ndef solve(n, kc, t, p):\r\n kc.sort(key=lambda x: x[1])\r\n p.append(10 ** 18)\r\n q = [p[0]] * t\r\n for i in range(1, t):\r\n q[i] = p[i] - p[i - 1]\r\n ans = 0\r\n s = 0\r\n j = 0\r\n for k, c in kc:\r\n while s + k >= p[j]: # 如果k能覆盖这一组就计算这一组消耗k，步进总数\r\n ans += (p[j] - s) * c * (j + 1)\r\n k -= p[j] - s\r\n s = p[j]\r\n j += 1\r\n ans += k * c * (j + 1) # k无法覆盖，则消耗完k，步进总数\r\n s += k\r\n print(ans)\r\n\r\n\r\nif __name__ == '__main__':\r\n n = int(input())\r\n kc = []\r\n for _ in range(n):\r\n kc.append(list(map(int, input().split())))\r\n t = int(input())\r\n p = list(map(int, input().split()))\r\n solve(n, kc, t, p)\r\n", "n = int(input())\r\nfig = [tuple(map(int, input().split()))[::-1] for _ in range(n)]\r\nfig.sort() \r\nt = int(input())\r\na = list(map(int, input().split()))\r\nres, curr = 0, 0\r\ni, j = 0, 0\r\nwhile i < n:\r\n if j < t and curr + fig[i][1] >= a[j]:\r\n take = a[j] - curr\r\n curr += take\r\n fig[i] = (fig[i][0], fig[i][1] - take)\r\n res += take * (j + 1) * fig[i][0]\r\n j += 1\r\n else:\r\n take = fig[i][1]\r\n curr += take\r\n res += take * (j + 1) * fig[i][0]\r\n i += 1\r\nprint(res)\r\n", "import sys\r\ninput = sys.stdin.readline\r\nn = int(input())\r\nf = [None] * n\r\nfor i in range(n):\r\n k, c = map(int, input().split())\r\n f[i] = [c, k]\r\nt = int(input())\r\np = list(map(int, input().split()))\r\nf.sort()\r\nres, count, factor = 0, 0, 1\r\ni, j = 0, 0\r\nwhile i < n and j < t:\r\n if count + f[i][1] <= p[j]:\r\n res += f[i][0] * f[i][1] * factor\r\n count += f[i][1]\r\n i += 1\r\n else:\r\n res += f[i][0] * (p[j] - count) * factor\r\n f[i][1] -= p[j] - count\r\n factor += 1\r\n count = p[j]\r\n j += 1\r\nif j == t:\r\n while i < n:\r\n res += f[i][0] * f[i][1] * factor\r\n i += 1\r\nprint(res)" ]

[ "def cc(res):\r\n l = 1\r\n r = res\r\n while l<=r:\r\n mid = l+r >>1\r\n if mid*mid==res:\r\n return mid\r\n elif mid*mid>res:\r\n r = mid-1\r\n else:\r\n l = mid+1\r\n return -1\r\n\r\n\r\ndef solve(a,b,c):\r\n if b*b-4*a*c<0:\r\n return -1\r\n r = cc(b*b-4*a*c)\r\n \r\n if r*r!=b*b-4*a*c:\r\n return -1\r\n \r\n r = -b+r\r\n if r%(2*a)!=0:\r\n return -1\r\n return int(r/2/a)\r\n\r\n\r\nn = int(input())\r\ntmp = []\r\nfor i in range(0,100):\r\n now = 1<<(i+1)\r\n ans = solve(1,now-3,-2*n)\r\n if ans!=-1 and ans%2==1:\r\n tmp.append( int(ans*now/2) )\r\n\r\ntmp.sort()\r\npre = -1\r\nfor i in tmp:\r\n if i!=pre:\r\n print(i)\r\n pre = i\r\nif pre ==-1:\r\n print(-1)\r\n\r\n", "def calc(n):\n res = 0\n while n % 2 == 0:\n n //= 2\n res += n\n return res + n * (n - 1) // 2\n\ndef check(n, q):\n if 2 ** q - 1 > n:\n return None\n left = 0\n right = 10 ** 10\n f = lambda k : k * (k - 1) // 2 + k * (2 ** q - 1)\n while left + 1 < right:\n mid = (left + right) // 2\n if f(mid) <= n:\n left = mid\n else:\n right = mid\n count = left * 2**q\n if calc(count) == n:\n return count\n else:\n return None\n\nn = int(input())\n\nans = set()\n\n# We want n=k*(k-1)/2 + k*(2^q-1)\nfor q in range(0, 64):\n k = check(n, q)\n if k:\n ans.add(k)\n\nif ans:\n for i in sorted(ans):\n assert calc(i) == n, \"n=%d, i=%d\"%(n, i)\n print(i)\nelse:\n print(-1)\n", "f=n=int(input())\nN=1\nwhile N<=n*2:\n l,h=0,n\n while h>=l:\n m=(l+h)//2\n r=(m*2+1)*(m+N-1)\n if r>n:h=m-1\n elif r<n:l=m+1\n else:\n print(m*2*N+N)\n f=0\n break\n N*=2\nif f:print(-1)", "n = int(input())\r\nf = 0\r\n\r\nfor p in range(63):\r\n N = 1 << (p+1)\r\n l = 0\r\n h = n\r\n while h >= l:\r\n m = (l+h)//2\r\n x = m*2+1\r\n res = x*(x+N-3)\r\n if res == n*2:\r\n print(x*(1 << p))\r\n f = 1\r\n break\r\n elif res > n*2:\r\n h = m-1\r\n else:\r\n l = m+1\r\n\r\nif f==0:\r\n print(-1)\r\n", "n = int(input())*2\ndef calc(d):\n mi, ma = 1, n\n md = 0\n while mi != ma:\n md = (mi + ma) // 2\n if md * (md + d) < n:\n mi = md+1\n else:\n ma = md\n return ma if ma*(ma+d) == n and ma%2 else -1\n\n\nd = 1\nli = []\nwhile d <= n:\n d *= 2\n u = calc(d-3)\n if u != -1:\n li.append(u*d//2)\nli.sort()\nif (len(li)):\n for d in li:\n print(d)\nelse:\n print(-1)", "n = int(input())\r\nx=1\r\nres=[]\r\nfor i in range(64):\r\n\tlo, hi =0, int(1e15)\r\n\tf=0\r\n\tans=0\r\n\twhile lo+1<hi:\r\n\t\tmid=(lo+hi)//2\r\n\t\tv = (x-1)*mid+ (mid*mid-mid)//2\r\n\t\tif(v==n):\r\n\t\t\tf=1;\r\n\t\t\tans=mid\r\n\t\t\tbreak;\r\n\t\tif(v>n):\r\n\t\t\thi=mid\r\n\t\telse:\r\n\t\t\tlo=mid\r\n\tif(f and ans%2==1):\r\n\t\tres.append(ans*x)\r\n\tx=x*2\r\nif(len(res)==0):\r\n\tprint(-1);\r\n\texit(0)\r\nfor x in res:\r\n\tprint(int(x))", "import sys\r\n\r\n\r\ndef isqrt(n):\r\n l = -1\r\n h = n\r\n while l + 1 < h:\r\n m = (l + h) // 2\r\n if m * m <= n:\r\n l = m\r\n else:\r\n h = m\r\n return l\r\n\r\n\r\nwith sys.stdin as fin, sys.stdout as fout:\r\n n = int(next(fin))\r\n\r\n ans = []\r\n for i in range(64 + 1):\r\n a = 2 ** i - 1\r\n q = 1 - 4 * a + 4 * a ** 2 + 8 * n\r\n rt = isqrt(q)\r\n if rt ** 2 != q:\r\n continue\r\n res = 1 - 2 * a + rt\r\n if res % 2 != 0 or res % 4 == 0:\r\n continue\r\n ans.append(res // 2 * 2 ** i)\r\n\r\n if not ans:\r\n print(-1, file=fout)\r\n else:\r\n for i in ans:\r\n print(i, file=fout)\r\n", "import math\r\n\r\nn = int(input())\r\nc = 1\r\n#print(c)\r\nfl = False\r\na = []\r\nwhile c <= 8 * n:\r\n c *= 2\r\n #print(D)\r\n #print(c)\r\n D = (c - 3) * (c - 3) + 8 * n\r\n x = int(math.sqrt(D))\r\n #print(x, D, (c + 1) * (c + 1))\r\n for i in range(-5, 5):\r\n if(x + i < 0): continue\r\n #print(x + i, (x + i) * (x + i))\r\n if((x + i) * (x + i) == D):\r\n x = x + i\r\n if(x * x != D):\r\n continue\r\n y = -(c - 3) + x\r\n #print(c, y, D)\r\n if(y % 2 == 1):\r\n continue\r\n y //= 2\r\n if(y % 2 == 0):\r\n continue\r\n k = c // 2 * y\r\n fl = True\r\n a.append(k)\r\na.sort()\r\nfor i in a:\r\n print(i)\r\nif not fl:\r\n print(-1)\r\n ", "n = int(input())\r\n\r\ndef f(t, k):\r\n\treturn t*(t-1)//2 + t*((1<<k)-1)\r\n\r\nans = set()\r\nfor k in range(60):\r\n\tl = 0\r\n\tr = n\r\n\tp = 0\r\n\twhile l <= r:\r\n\t\tt = (l+r)//2\r\n\t\tif f(t, k) <= n:\r\n\t\t\tp = t\r\n\t\t\tl = t+1\r\n\t\telse:\r\n\t\t\tr = t-1\r\n\tif p % 2 == 1 and f(p, k) == n:\r\n\t\tans.add(p * (1<<k))\r\n\r\nfor x in sorted(ans):\r\n\tprint(x)\r\n\r\nif not ans:\r\n\tprint(-1)", "f=n=int(input())\r\nN=1\r\nwhile N<=n*2:\r\n l,h=0,n\r\n while h>=l:\r\n m=(l+h)//2\r\n r=(m*2+1)*(m+N-1)\r\n if r>n:h=m-1\r\n elif r<n:l=m+1\r\n else:\r\n print(m*2*N+N)\r\n f=0\r\n break\r\n N*=2\r\nif f:print(-1)", "match = int(input())\r\narr = []\r\nfor k in range(0, 65):\r\n pw = 2**k\r\n l = -1\r\n r = 10**18\r\n while (l + 1 < r):\r\n m = (l + r) // 2\r\n x = 2 * m + 1\r\n res = x * (pw - 1) + x * (x - 1) // 2\r\n if (res >= match): r = m\r\n else: l = m\r\n x = 2 * r + 1\r\n res = x * (pw - 1) + x * (x - 1) // 2\r\n if (res == match): arr.append(x * pw)\r\nif (len(arr) == 0):\r\n print(-1)\r\nelse:\r\n arr.sort()\r\n for i in arr:\r\n print(i, end = \" \")", "n = int(input())\r\nans = []\r\nfor i in range(0, 64):\r\n\ty = 2 ** i\r\n\tdeter = (y - 3) ** 2 + (4 * 2 * n)\r\n\tif deter >= 0:\r\n\t\tsqrt = int(pow(deter, .5))\r\n\t\twhile(sqrt * sqrt < deter):\r\n\t\t\tsqrt += 1\r\n\t\twhile(sqrt * sqrt > deter):\r\n\t\t\tsqrt -= 1\r\n\t\tif(sqrt * sqrt == deter):\r\n\t\t\tev1 = 3 - y + sqrt\r\n\t\t\tif(ev1 % 2 == 0):\r\n\t\t\t\tev1 /= 2\r\n\t\t\t\tif(ev1 > 0 and ev1 % 2 == 1):\r\n\t\t\t\t\tfor j in range(0, i):\r\n\t\t\t\t\t\tev1 *= 2\r\n\t\t\t\t\tans.append(ev1 / 2);\r\n\r\n\t\t\tev1 = 3 - y - sqrt\r\n\t\t\tif(ev1 % 2 == 0):\r\n\t\t\t\tev1 /= 2\r\n\t\t\t\tif(ev1 > 0 and ev1 % 2 == 1):\r\n\t\t\t\t\tfor j in range(0, i):\r\n\t\t\t\t\t\tev1 *= 2\r\n\t\t\t\t\tans.append(ev1 / 2);\r\nfor i in sorted(ans):\r\n\tprint(int(i))\r\nif not len(ans):\r\n\tprint(-1)", "import math\r\ndef solve(n,b):\r\n\tans = []\r\n\tA = 1\r\n\tB = (2*(1<<b)) - 3\r\n\tC = -2*n\r\n\t# print(A,B,C)\r\n\tif(B*B - 4*A*C>=0):\r\n\t\tdm = int(math.sqrt(B*B - 4*A*C))\r\n\t\t# print(B*B,-4*A*C)\r\n\t\t# if(dm*dm == B*B - 4*A*C):\r\n\t\t\t# print(dm)\r\n\t\t# if((-1*B + dm)%2==0 and (-1*B + dm)//2>0):\r\n\t\tans.append(((-1*B + dm)//2)*(1<<b));\r\n\t\t# if((-1*B - dm)%2==0 and (-1*B - dm)//2>0):\r\n\t\tans.append(((-1*B - dm)//2)*(1<<b));\r\n\treturn ans\r\nn=int(input())\r\n\r\ndef check(n,x):\r\n\tif(x<=0):\r\n\t\treturn 0;\r\n\ts = 0\r\n\twhile(x%2==0):\r\n\t\ts+=x//2\r\n\t\tx//=2\r\n\ts += (x*(x-1))//2;\r\n\tif(s==n):\r\n\t\treturn 1;\r\n\treturn 0;\r\nfin = []\r\nfor i in range(64):\r\n\ttmp = solve(n,i)\r\n\tfor j in tmp:\r\n\t\tif(check(n,j)):\r\n\t\t\tfin.append(j)\r\n# print(solve(n,59))\r\nfin =set(fin)\r\n# print((1<<3) -1)\r\nif(len(fin)==0):\r\n\tprint(-1)\r\nelse:\r\n\tfor i in fin:\r\n\t\tprint(i)", "import sys\r\nfrom math import sqrt\r\n\r\ndef solve(b, c):\r\n\tD = b * b - 4 * c\r\n\tif D < 0:\r\n\t\treturn []\r\n\tkek = int(sqrt(D))\r\n\td = -1\r\n\tfor i in range(-10, 10, 1):\r\n\t\tif kek + i < 0:\r\n\t\t\tcontinue\r\n\t\tif (kek + i) ** 2 == D:\r\n\t\t\td = kek + i\r\n\t\t\tbreak\r\n\tif d < 0:\r\n\t\treturn []\r\n\tif (b + d) % 2:\r\n\t\treturn []\r\n\tres = []\r\n\tif - b - d > 0 and ((- b - d) // 2) % 2:\r\n\t\tres.append((- b - d) // 2)\r\n\tif - b + d > 0 and ((- b + d) // 2) % 2:\r\n\t\tres.append((- b + d) // 2)\r\n\treturn res\r\n\r\n\r\ndef Solve():\r\n\tn = int(input())\r\n\tans = set()\r\n\tkek = solve(-1, -2 * n)\r\n\tfor i in kek:\r\n\t\tans.add(i)\r\n\tfor t in range(60):\r\n\t\tb = (2 ** (t + 2)) - 3\r\n\t\tc = -2 * n\r\n\t\tkek = solve(b, c)\r\n\t\tfor i in kek:\r\n\t\t\tans.add(i * (2 ** (t + 1)))\r\n\tif not ans:\r\n\t\tprint('-1')\r\n\t\treturn\r\n\tfor i in ans:\r\n\t\tprint(i)\r\n\t\r\n\t\r\nif __name__ == '__main__':\r\n\t#sys.stdin = open('input.txt', 'r')\r\n\tSolve()", "from sys import *\r\nimport math\r\n\r\ndef sqr(x):\r\n return x * x\r\n\r\ndef Sqrt(x):\r\n l = 0\r\n r = 2 ** 150\r\n while (r - l > 1):\r\n m = (l + r) // 2\r\n if (m * m < x): l = m\r\n else: r = m\r\n if (r * r <= x): return r\r\n else: return l\r\n\r\nfi = stdin\r\nfo = stdout\r\n\r\nn = int(fi.readline())\r\n\r\nans = []\r\no = 1\r\nwhile (o <= 2 ** 100):\r\n d = sqr(2 * o - 3) + 8 * n\r\n if (d >= 0):\r\n sd = Sqrt(d)\r\n #fo.write(str(d) + \" \" + str(sd) + \" \" + str(sd * sd) + \"\\n\")\r\n #fo.write(str(abs(sd * sd - d)) + \"\\n\")\r\n if (d == sd * sd):\r\n if (-(2 * o - 3) + sd) % 2 == 0:\r\n x1 = (-(2 * o - 3) + sd) // 2\r\n x2 = (-(2 * o - 3) - sd) // 2\r\n if (x1 > 0) and (x1 % 2 == 1): ans.append(o * x1)\r\n if (x2 > 0) and (x2 % 2 == 1): ans.append(o * x2)\r\n o = o * 2 \r\n \r\n\r\nf = 0\r\nfor x in sorted(ans):\r\n fo.write(str(x) + \"\\n\")\r\n f = 1\r\n \r\nif (f == 0):\r\n fo.write(\"-1\\n\")", "n = int(input())\r\n\r\nans = []\r\n\r\nfor k in range(0, 61):\r\n\tkth = (1 << k) - 1\r\n\tl = 0\r\n\tr = int(1e18)\r\n\twhile r - l > 1:\r\n\t\tm = (l + r) // 2\r\n\t\tqm = 2 * m + 1\r\n\t\trs = qm * ((qm - 1) // 2 + kth)\r\n\t\tif rs > n:\r\n\t\t\tr = m\r\n\t\telse:\r\n\t\t\tl = m\r\n\tql = l * 2 + 1\r\n\tif ql * ((ql - 1) // 2 + kth) == n:\r\n\t\tans.append(ql * (kth + 1))\r\n\r\nif not len(ans):\r\n\tprint(-1)\r\n\texit(0)\r\nfor el in ans:\r\n\tprint(el)", "N =int(input())\n\ne =1\nB =False\nwhile True:\n\ta =1\n\tb =N+1\n\tif a*(a-3)//2+e*a > N: break\n\twhile b-a > 1:\n\t\tc =(b+a)//2\n\t\tif e*c+c*(c-3)//2 <= N: a =c\n\t\telse: b =c\n#\tprint(a)\n\tif (a%2 != 0) & (e*a+a*(a-3)//2 == N): \n\t\tB =True\n\t\tprint(a*e)\n\te *=2\nif B == False: print(-1)\n", "import math\n# import sys\n# old_stdin = sys.stdin\n# sys.stdin = open('in.txt')\ndef root(n):\n\tl, r = int(0), int(10**20)\n\twhile l <= r:\n\t\tm = (l+r)//2\n\t\tif m*m == n:\n\t\t\treturn m\n\t\telif m*m > n:\n\t\t\tr = m-1\n\t\telse:\n\t\t\tl = m+1\n\treturn int(l)\n\nn = int(input())\nans = []\na = 0\nfor i in range(63):\n\tdisc = int((2*a-1)*(2*a-1) + 8*n)\n\tr = root(disc)\n\t# print(i, a, int(disc), r)\n\tif r*r == disc and r%2 == 1:\n\t\tx = (1-2*a+r)//2\n\t\ty = (1-2*a-r)//2\n\t\tif x%2 == 1 and x > 0:\n\t\t\tans.append(int(x*(a+1)))\n\t\tif y%2 == 1 and y > 0:\n\t\t\tans.append(int(y*(a+1)))\n\ta = 2*a + 1\nif len(ans) == 0:\n\tprint(-1)\nelse:\n\tans = list(set(ans))\n\tfor x in ans:\n\t\tprint(int(x))\n", "import sys\nn = int(input())\nans = 1\nt = True\nwhile ans // 2 <= n:\n left = 0\n right = n\n while left <= right:\n x = (left + right) // 2\n a = (2 * x + 1) * (x + ans - 1)\n if a == n:\n print(ans * (2 * x + 1))\n t = False\n break\n elif a < n:\n left = x + 1\n else:\n right = x - 1\n ans *= 2\nif t == True:\n print(-1)\n \n\n# Sat Oct 17 2020 00:09:29 GMT+0300 (Москва, стандартное время)\n", "ans=[]\r\nn=1\r\ndef f(r,k):\r\n a=2**k\r\n a-=1\r\n a*=r\r\n b=r*(r-1)//2\r\n return a+b\r\n\r\ndef ff(r,k):\r\n a=2**k\r\n return a*r\r\n\r\ndef tr(k):\r\n if(f(1,k)>n):\r\n return\r\n l=1\r\n r=2**60\r\n while(r-l>1):\r\n mid=(l+r)//2\r\n if(f(mid,k)<n):l=mid+1\r\n else:r=mid\r\n while(f(l,k)<n):l+=1\r\n if(f(l,k)==n and l&1):ans.append(ff(l,k))\r\n\r\n\r\nn=eval(input())\r\nfor i in range(60,-1,-1):\r\n tr(i)\r\nans.sort()\r\nif len(ans)==0:\r\n print(-1)\r\n import sys\r\n sys.exit(0)\r\nfor i in ans:\r\n print(i,end=' ')", "def sqrt(num):\r\n\tl=0\r\n\tr=10**20+9\r\n\twhile l<r:\r\n\t\tm=l+r>>1\r\n\t\tif m*m>num:r=m\r\n\t\telse:l=m+1\r\n\tl-=1\r\n\treturn l\r\nn=int(input())\r\np=0\r\ncp=1\r\nans=[]\r\nwhile p<=n:\r\n\tsq=8*n+(1-2*p)**2\r\n\tq=sqrt(sq)\r\n\tif q*q==sq:\r\n\t\txtimes2=q-2*p+1\r\n\t\tif xtimes2%2==0:\r\n\t\t\tx=xtimes2//2\r\n\t\t\tif x%2 and p*x+x*(x-1)//2==n:\r\n\t\t\t\tans.append(x*cp)\r\n\tp+=cp\r\n\tcp*=2\r\nprint(*sorted(set(ans)if ans else [-1]),sep='\\n')\r\n'''\r\nn=p*x+x*(x-1)//2\r\n\r\nx=(sqrt(8*n + (1-2p)^2 ) - 2p + 1)/2\r\n'''", "def get(x):\n\tlow = 1\n\thigh = x\n\tans = -1\n\twhile low <= high:\n\t\tmid = (low + high) // 2\n\t\tif mid * mid <= x:\n\t\t\tlow = mid + 1\n\t\t\tans = mid\n\t\telse:\n\t\t\thigh = mid - 1\n\treturn ans\n\nn = int(input())\nf = 0\nfor i in range(0, 64):\n\ta = 1\n\tb = (2 ** (i + 1)) - 3\n\tc = - 2 * n\n\td = b * b - 4 * a * c\n\tsq = get(d)\n\tif sq ** 2 == d:\n\t\tx = - b + sq\n\t\tif ((x & 1) == 0 and ((x // 2) & 1) and (x // 2) > 0):\n\t\t\tf = 1;\n\t\t\tans = (x >> 1) * (1 << i);\n\t\t\tprint(ans)\nif f == 0:\n\tprint(-1)", "n = int(input())\nres = set()\nfor r in range(100):\n a = 1\n b = 2**(r + 1) - 3\n c = -2 * n\n d = b * b - 4 * a * c\n if d < 0:\n continue\n le = 0\n ri = d\n while le < ri:\n c = (le + ri) // 2\n if c * c < d:\n le = c + 1\n else:\n ri = c\n if le * le == d:\n if (-b - le) % 4 == 2 and -b - le > 0:\n res.add((-b - le) // 2 * 2**r)\n if (-b + le) % 4 == 2 and -b + le > 0:\n res.add((-b + le) // 2 * 2**r)\nfor i in sorted(list(res)):\n print(i)\nif not list(res):\n print(-1)\n" ]

[ "import sys\r\ninput = lambda: sys.stdin.readline().rstrip()\r\n\r\nMOD = 10**9+7\r\nN = int(input())\r\ndp = [[0,0] for _ in range(N+1)]\r\n\r\nfor i in range(N):\r\n dp[i+1][0]=dp[i][0]\r\n dp[i+1][1]=dp[i][1]\r\n if i%2:\r\n dp[i+1][1]+=dp[i][0]+1\r\n else:\r\n dp[i+1][0]+=dp[i][1]+1\r\n dp[i+1][0]%=MOD\r\n dp[i+1][1]%=MOD\r\n \r\nprint(sum(dp[-1])%MOD)", "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 input().strip().split()\n\n\nn, = ii()\narr = [0] * max(3, n+1)\narr[1], arr[2] = 1, 3\nfor k in range(3, n+1):\n arr[k] = (arr[k-1] * 2 - arr[k-3]) % MOD\nprint(arr[n])\n", "'''\r\nBeezMinh\r\n16:15 UTC+7\r\n02/08/2023\r\n'''\r\nimport sys\r\ninput = sys.stdin.readline\r\nn = int(input())\r\na, b = 0, 1\r\nfor i in range(n - 1):\r\n a, b = b, (a + b + 2) % 1000000007\r\nprint(b)", "n = int(input())\r\nm = int(1e9 + 7)\r\nu, v = 0, 1\r\nfor _ in range(n - 1):\r\n u, v = v, (u + v + 2) % m\r\nprint(v)", "def num_zebroid(n):\r\n\r\n modulus = 1000000007\r\n nums = [(0, 0), (1, 0)]\r\n for k in range(2, n + 1):\r\n if k % 2 == 0:\r\n r_k = nums[k - 1][0] % modulus\r\n b_k = (nums[k - 1][0] + nums[k - 1][1] + 1) % modulus\r\n nums.append((r_k, b_k))\r\n else:\r\n r_k = (nums[k - 1][0] + nums[k - 1][1] + 1) % modulus\r\n b_k = nums[k - 1][1] % modulus\r\n nums.append((r_k, b_k))\r\n\r\n return (nums[n][0] + nums[n][1]) % modulus\r\n\r\n\r\nfrom sys import stdin\r\nn = int(stdin.readline())\r\nprint(num_zebroid(n))\r\n", "n = int(input())\r\nmod = 10**9 + 7\r\n\r\ndp = {}\r\n\r\nfor i in range(n):\r\n \r\n dp[i] = {}\r\n \r\n if i == 0: dp[i][0], dp[i][1] = 1, 0\r\n else:\r\n dp[i][i%2] = (1 + dp[i -1][i%2] + dp[i - 1][1 - i%2])%mod\r\n dp[i][1 - i%2] = dp[i - 1][1 - i%2]\r\n \r\nprint((dp[n - 1][0] + dp[n - 1][1])%mod)", "n, mod, fib, su = int(input()), 10 ** 9 + 7, [1, 1], 1\r\nfor i in range(2, n + 1):\r\n cur = (fib[0] + fib[1]) % mod\r\n fib = [fib[1], cur]\r\n su = (su + fib[1]) % mod\r\nprint(su)\r\n", "p = 10**9+7\r\ndef process(n):\r\n r = 0\r\n b = 0\r\n for i in range(n):\r\n if i % 2==0:\r\n r, b = (r+b+1) % p, b\r\n else:\r\n r, b = r, (r+b+1) % p\r\n return (r+b) % p\r\n\r\nn = int(input())\r\nprint(process(n))", "n = int(input())\r\nmod = 1000000007\r\nred, blue = 0, 0\r\nfor i in range(n):\r\n if i % 2 == 0:\r\n red += blue + 1\r\n red %= mod\r\n else:\r\n blue += red + 1\r\n blue %= mod\r\nprint((red + blue) % mod)\r\n", "n=int(input())\r\ndp=[1]*(n)\r\nsb=0\r\nsr=0\r\nj=0\r\nans=0\r\nwhile(j<n):\r\n if j%2==0:\r\n dp[j]+=(sb)\r\n dp[j]=dp[j]%1000000007\r\n sr+=dp[j]\r\n else:\r\n dp[j] += (sr)\r\n dp[j]=dp[j]%1000000007\r\n sb += dp[j]\r\n ans+=dp[j]\r\n ans=ans%1000000007\r\n j+=1\r\nprint(ans)\r\n", "MOD = 10**9 + 7\r\nn = int(input())\r\nr, b = 0, 0\r\nfor i in range(n):\r\n\tif i & 1: b = (b + r + 1) % (MOD)\r\n\telse: r = (r + b + 1) % MOD\r\nprint((b + r) % MOD)", "n=int(input())\r\na=[1,1]\r\nfor i in range(n):\r\n a[i%2]+=a[1-i%2]%1000000007\r\nprint((sum(a)-2)%1000000007)", "l = [0,1,3]\nfor i in range(10 ** 6):\n l.append((l[-1] * 2 - l[-3]) % (10 ** 9 + 7))\nprint(l[int(input())])\n\t \t\t\t \t \t\t\t\t \t\t\t \t \t\t\t \t\t\t", "n = int(input()) \r\ndp = [1,3] \r\nif (n==1):\r\n print(dp[0]) \r\nelif (n==2):\r\n print(dp[1]) \r\nelse:\r\n for i in range(n-2):\r\n dp.append((dp[-1]+dp[-2]+2)%(10**9+7)) \r\n print(dp[-1]) ", "n=int(input())\r\na,b=0,0\r\nfor i in range(n):\r\n if i%2==0:a+=b+1\r\n else:b+=a+1\r\n a,b=a%1000000007,b%1000000007\r\nprint((a+b)%1000000007)", "n = int(input())\r\nmod = int(1e9+7)\r\ndp = []\r\ncnt = [0,0]\r\nfor i in range(n):\r\n x = i%2==0\r\n y = (cnt[1-x]+1)%mod\r\n dp.append(y)\r\n cnt[x]+= y\r\nans = 0\r\nfor i in dp:\r\n ans+=i\r\n ans%=mod\r\n\r\nprint(ans)" ]

[ "a, b = list(input().split())\n\nif a == b:\n\tprint(a)\nelse:\n\tprint(\"1\")\n\t \t \t\t \t \t\t \t \t\t \t", "a, b = input().split()\r\nprint(a if a == b else 1)\r\n", "a ,b = list(map(int , input().split()))\r\n\r\n\r\ndef GCD(a , b):\r\n\r\n if b == 0 :\r\n return a\r\n return GCD(b , a % b)\r\n\r\nif b - a >= 1:\r\n print(1)\r\nelse:\r\n print(GCD(a , b))", "# import sys\r\n# sys.stdin=open(\"input.in\",\"r\")\r\na,b=map(int,input().split())\r\nprint(a if a==b else \"1\")", "def gcd(a, b):\r\n while b != 0:\r\n c = a % b\r\n a = b\r\n b = c\r\n return a\r\nx, y = map(int, input().split())\r\nans = set()\r\nif y - x >= 1:\r\n print(1)\r\nelse:\r\n print(gcd(x, y))\r\n\r\n", "import math\r\n\r\ndef inp():\r\n return(int(input()))\r\ndef invr():\r\n return(input())\r\ndef inlt():\r\n return(list(map(int,input().split())))\r\ndef two():\r\n return([int(a) for a in input().split()])\r\ndef insr():\r\n s = input()\r\n return(list(s[:len(s) - 1]))\r\n\r\na, b = two()\r\nif a == b:\r\n print(a)\r\n\r\nelse:\r\n print(1)\r\n\r\n", "a,b=input().split()\r\nif a==b:print(a)\r\nelse:print(1)", "def List():\r\n return list(map(int,input().split()))\r\ndef Lst():\r\n return list(input())\r\ndef Int():\r\n return int(input())\r\ndef two():\r\n return map(int,input().split())\r\n\r\na , b = two()\r\nprint(a) if a == b else print(1)", "def gcd(num1,num2):\r\n if num2 - num1 == 0:\r\n print (num1)\r\n else:\r\n print(1)\r\n\r\nleft, right = map(int, input().split())\r\ngcd(left,right)", "\r\nimport sys\r\ndef get_single_int ():\r\n return int (sys.stdin.readline ().strip ())\r\ndef get_string ():\r\n return sys.stdin.readline ().strip ()\r\ndef get_ints ():\r\n return map (int, sys.stdin.readline ().strip ().split ())\r\ndef get_list ():\r\n return list (map (int, sys.stdin.readline ().strip ().split ()))\r\n\r\n#code starts here\r\na, b = (get_ints ())\r\na, b = str (a), str (b)\r\nif a == b:\r\n print (a)\r\nelse:\r\n print (1)\r\n", "s1,s2=map(str,input().split())\r\nprint(s1 if s1==s2 else 1)", "list1=list(map(str,input().split()))\r\ns1=list1[0]\r\ns2=list1[1]\r\nif(s1==s2): print(s1)\r\nelse: print(\"1\")", "k,s=map(str,input().split())\r\nif k==s:\r\n print(k)\r\nelse:\r\n print('1')", "def gcd(a,b):\n\tif a==b:\n\t\tprint(str(a))\n\telse:\n\t\tprint(1)\n\na,b = map(int,input().split(\" \"))\n\ngcd(a,b)", "n = list(map(int, input().split()))\r\nif n[0] != n[1]:\r\n print(1)\r\nelse:\r\n print(n[0])\r\n", "a, b = list(map(int, input().split()))\n\n\nif b > a:\n print(1)\n\nelse:\n print(a)\n\n", "n=list(map(int,input().split()))\r\nif n[0]==n[1]: print(n[0])\r\nelse: print(1)", "P, Q = map(int, input().split())\r\nif P==Q:\r\n print(P)\r\nelse:\r\n print(1)\r\n\r\n\r\n", "import math\r\ndef gcd(num1, num2):\r\n if(num1 == num2):\r\n return num1\r\n \r\n return 1\r\n \r\n\r\ndef reader():\r\n n = input().rstrip()\r\n m = n.split()\r\n print(gcd(m[0],m[1]))\r\n\r\nreader()", "def nod(a,b):\r\n if a==0:\r\n return b\r\n return nod(b%a,a)\r\nd=input().split()\r\na=int(d[0])\r\nb=int(d[1])\r\ns=b\r\nwhile a<b:\r\n s=nod(s,a)\r\n if s==1:\r\n break\r\n a=a+1\r\nprint(s)", "a,b = input().split()\r\nprint(a) if a==b else print(1)", "#-------------Program--------------\r\n#----Kuzlyaev-Nikita-Codeforces----\r\n#-------------Training-------------\r\n#----------------------------------\r\n\r\ns1,s2=map(str,input().split())\r\nif s1==s2:print(s1)\r\nelse:\r\n print(1)", "import math\r\n\r\n\r\ndef I(): return int(input())\r\ndef II(): return map(int, input().split())\r\ndef IL(): return list(map(int, input().split()))\r\ndef SIL(): return sorted(map(int, input().split()))\r\nfrom collections import defaultdict\r\nfrom collections import Counter\r\nimport math\r\n\r\ndef solve():\r\n a, b = map(str, input().split())\r\n if a == b:\r\n print(a)\r\n else:\r\n print(1)\r\n\r\n\r\n\r\n\r\nT = 1\r\nfor ___ in range(T):\r\n solve()\r\n", "\r\ndef main():\r\n ss = str(input()).split()\r\n for i in range(len(ss) - 1):\r\n if ss[i] != ss[i + 1]:\r\n print(1)\r\n return\r\n \r\n print(ss[0])\r\n\r\nmain()", "def sol():\r\n a,b = [int(x) for x in input().split()]\r\n return a if a==b else 1\r\nprint(sol())", "x, y = map(int, input().split())\nif x == y:\n\tprint(x)\nelse:\n\tprint(1)\n \t \t\t\t\t\t \t\t\t\t \t \t \t \t \t \t", "def gcd(a: int, b: int) -> int:\n if (a == b):\n return a\n \n return 1\n\n# Inputs\na, b = map(int, input().split())\nprint(gcd(a, b))\n\n\t \t \t\t \t\t \t \t\t\t \t \t", "a,b = map(int,input().split())\r\nif (a-b)==0:\r\n print(a)\r\nelse:\r\n print(1) \r\n", "import math\r\nn, m = [int(v) for v in input().split()]\r\nif (n == m):\r\n print(n)\r\nelse:\r\n print(1)\r\n", "def gc(a, b):\n while b > 0:\n a, b = b, a % b\n return a\n\na, b = map(int, input().split())\nresult = a\nfor i in range(a, b+1):\n result = gc(result, i)\n if(result == 1): break\nprint(result)\n \t \t\t \t\t\t \t\t\t\t \t \t \t", "a, b = list(map(int, input().split()))\r\nflag = False\r\n\r\ndef gcd(a, b):\r\n if b == 0:\r\n return a\r\n\r\n return gcd(b, a % b)\r\n\r\nval = gcd(a, b)\r\nif val == 1:\r\n flag = True\r\n print(1)\r\n\r\nif not flag:\r\n for i in range(a + 1, b):\r\n if val > i:\r\n val = gcd(val, i)\r\n\r\n else:\r\n val = gcd(i, val)\r\n\r\n if val == 1:\r\n break\r\n\r\n print(val)", "import sys\r\nsys.setrecursionlimit(1000000)\r\n\r\ndef recur(a,b):\r\n if b == 0:\r\n return a\r\n return recur(b, a % b)\r\n\r\ndef main():\r\n a, b = input().split()\r\n a, b = int(a), int(b)\r\n if a != b: \r\n print(1)\r\n return\r\n print(recur(a,b))\r\n \r\nmain()", "a,b = map(int, input().split())\r\nif a==b or (b%a ==0 and a%b == 0):\r\n print(a)\r\nelse:\r\n print(1)", "string = input().split(\" \")\r\nif len(string) == 2 and string[0] == string[1]:\r\n print(int(string[0]))\r\nelse:\r\n print(1)", "a,b = input().split()\r\nif int(a) == int(b):\r\n print(a)\r\nelse:\r\n print(\"1\")", "def GDC(num1, num2):\r\n if num2 == 0:\r\n return num1\r\n return GDC(num2, num1 % num2)\r\n\r\na, b = list(map(int, input().split()))\r\n\r\nif a == b:\r\n print(a)\r\nelse:\r\n divider = GDC(a, a + 1)\r\n ans = divider\r\n for i in (a + 2, b + 1):\r\n if i % divider != 0:\r\n ans = 1\r\n break\r\n print(divider)\r\n \r\n", "import math\nN, M = input().split()\nN = int(N)\nM = int(M)\nif(M == N):\n print(M)\n\nelse:\n print(\"1\")\n\n \t\t\t \t \t\t\t\t\t \t\t\t \t\t\t \t", "x,y = map(int, input().split())\r\nif x != y: print(1)\r\nelse: print(x)\r\n#", "a,b = input().split(' ')\na,b = int(a), int(b)\nif a == b:\n print(a)\nelse:\n print(1)\n \t \t\t\t\t \t\t\t \t \t\t \t \t \t", "n, m = map(int,input().split())\r\n\r\nif n==m:\r\n print(n)\r\n\r\nelse:\r\n print(1)", "n1,n2 = map(int,input().split())\r\nif n1 == n2:\r\n print(n1)\r\nelse:\r\n print(1)", "num1, num2 = list(map(int, input().split()))\r\nif num2 - num1 == 0:\r\n print(num1)\r\nelse:\r\n print(1)", "num1, num2 = list(map(int, input().split()))\r\n\r\nif num1 == num2:\r\n print(num2)\r\nelse:\r\n print(1)\r\n\r\n\r\n ", "astr = input()\r\nlst = astr.split()\r\nif lst[0] == lst[1]:\r\n print(lst[0])\r\nelse:\r\n print(1)\r\n", "def Complicated_gcd():\r\n a,b=input().split()\r\n if int(a) == int(b):\r\n print(a)\r\n else:\r\n print(1)\r\nComplicated_gcd()", "n, k = [int(ele) for ele in input().split()]\r\nif n == k:\r\n print(n)\r\nelse:\r\n print(1)", "from sys import stdin\r\ndef main():\r\n a, b = map(int, stdin.readline().strip().split())\r\n if a == b:\r\n print(a)\r\n else:\r\n print(1)\r\nmain()", "m, n = map(int, input().split())\n\nif m == n:\n print(m)\nelse:\n print(1)", "a, b = [int(p) for p in input().split()]\r\nif b - a > 0:\r\n print(1)\r\nelse:\r\n print(a)", "def main():\n\n v = input().split(\" \")\n for i in range (len(v)):\n v[i] = int(v[i])\n\n if (v[0] == v[1]):\n print(v[0])\n else:\n print(1)\n \n return\n\n\nif __name__ == \"__main__\":\n main()\n\t\t \t \t\t\t\t\t \t \t \t \t\t\t\t\t", "n,t=input().split()\r\nif n==t:\r\n print(n)\r\nelse:\r\n print(1)", "x = input().split()\r\na = int(x[0])\r\nb = int(x[1])\r\n\r\nif a==b:\r\n print(a)\r\nelse:\r\n print(1)", "import math\r\na,b = map(int,input().split())\r\nif a==b:\r\n print(math.gcd(a,b))\r\nelif b-a>=1:\r\n print(1)", "intInput = lambda : int(input())\r\ntupInput = lambda : map(int, input().strip().split())\r\nlistInput = lambda : list(map(int, input().strip().split()))\r\nstrInput = lambda : list(input().strip())\r\n\r\ndef run():\r\n a, b = tupInput()\r\n if abs(a - b) > 0:\r\n print(1)\r\n else:\r\n print(a)\r\n \r\n \r\nrep = 1\r\nfor _ in range(rep):\r\n run()", "#664A\r\nm,n=map(int,input().split())\r\nif m==n:\r\n print(m)\r\nelse:\r\n print(1)\r\n", "nums = list(input().split())\r\nimport math\r\na , b = int(nums[0]) , int(nums[1])\r\n\r\nif b - a <= 1:\r\n print(math.gcd(a,b))\r\nelse:\r\n print(1)", "def gcd(a, b):\n while y:\n x, y = y, x % y\n return x\n\n\ndef cGcd(l, r):\n if l == r:\n return l\n return 1\n\n\nl, r = list(map(int, input().split()))\nprint(cGcd(l, r))\n", "s,z = map(int,input().split())\r\nif s != z: print(1)\r\nelse: print(s)", "nums = list(map(int, input().split()))\r\nif nums[0] == nums[1]:\r\n print(nums[0])\r\nelse:\r\n print(1)", "# cook your dish here\r\n\r\ndef main():\r\n a,b = list(map(int, input().strip().split()))\r\n if a==b:\r\n print(a)\r\n else:\r\n print(1)\r\n \r\nmain()\r\n", "def gcd(a, b):\n if (a == b):\n return a\n else:\n return 1\n \n\nentrada = input().split()\na = int(entrada[0])\nb = int(entrada[1])\n\nprint (gcd(a,b))\n\t \t \t\t\t \t\t\t\t \t\t\t \t \t \t\t", "a,b= map(int, input().split())\r\nif a==b:\r\n print(a)\r\nelse: print('1')", "a, b = input().split()\r\nprint(1 if a != b else a)", "a, b = map(int, input().split())\r\n\r\nif abs(a-b) == 0:\r\n print(a)\r\nelse:\r\n print(1)", "m,n=input().split()\r\nif(m==n):\r\n print (m)\r\nelse:\r\n print (1)", "x, y = input().split()\nprint(1 if x != y else x)", "import sys\r\n\r\n\r\n\r\nx,y=[int(i) for i in input().split()]\r\nk=0\r\nif x==y:\r\n k=x;\r\nelse:\r\n k=1\r\nsys.stdout.write(str(k))\r\n", "input1 = input().split()\r\nn = input1[0]\r\nk =input1[1]\r\nif k == n:\r\n print(n)\r\nelse :\r\n print(1)", "words = input().split()\r\na = int(words[0])\r\nb = int(words[1])\r\nif a == b:\r\n print(a)\r\nelse:\r\n print(1)", "def solve(a,b):\r\n if(a == b):\r\n return a\r\n else:\r\n return 1\r\n\r\na,b = input().split(' ')\r\nprint(solve(a,b))\r\n", "x,y=map(int,input().split());print(x if x==y else 1)", "from math import gcd\r\na,b=map(int,input().split())\r\nif a<b:\r\n print(1)\r\nelse:\r\n print(a)\r\n\r\n", "a = input()\nn , m = a.split(' ')\nn = int(n)\nm = int(m)\nif abs(n - m) == 0 :\n\tprint(min(n, m))\nelse :\n\tprint(1)\n", "n, m = [int(i) for i in input().split()]\r\n\r\nprint(n if n==m else 1)", "a,b=input().split();print([b,1][b!=a])", "st = str(input()).split()\r\na = int(st[0])\r\nb = int(st[1])\r\nif a == b:\r\n print(a)\r\nelse:\r\n print(1)", "a,b=input().split()\r\na=int(a)\r\nb=int(b)\r\nif a==b:print(a)\r\nelse:print(1)", "a, b = map(int, input().split())\r\nres = a if a == b else 1\r\nprint(res)", "from sys import stdin\r\n\r\nn, m = map(int, stdin.readline().rstrip().split(\" \"))\r\nif n == m:\r\n print(n)\r\nelse:\r\n print(1)", "x, y = input().split()\n\nif x == y:\n print(x)\nelse:\n print('1')\n\n\n\n\t\t \t \t\t\t\t \t\t \t \t\t\t \t \t \t\t", "a, b = map(int, input().split())\r\ndef gcd(a, b):\r\n if b == 0:\r\n return a\r\n return gcd(b, a % b)\r\nx = a\r\nfor i in range(a + 1, b + 1):\r\n x = gcd(x, i)\r\n if x == 1:\r\n break\r\nprint(x)", "n = input().split(\" \")\r\n\r\ndef complicated_gcd(n1,n2):\r\n if n1 == n2:\r\n return n1\r\n else:\r\n return 1\r\nnum1 = int(n[0])\r\nnum2 = int(n[1])\r\nprint(complicated_gcd(num1,num2))", "def solve():\n print(1 if abs(a - b) >= 1 else a)\n\n\ndef main():\n global a, b\n a, b = list(map(int, input().split()))\n solve()\n\n\nmain()\n", "from math import log\r\ndef gcd(a,b):\r\n if b == 0:\r\n return a\r\n return gcd(b,a % b)\r\n\r\na , b = input().split()\r\n\r\na = int(a)\r\nb = int(b)\r\nif a == b:\r\n print(a)\r\nelse:\r\n print(1)", "from math import gcd\n\nA, B = map(int, input().split())\n\nif A == B:\n print(gcd(A, B))\nelse:\n print(1)\n \t\t \t\t \t \t \t\t \t\t\t \t\t \t", "a, b=map(str, input().split())\r\nif a==b:print(b)\r\nelse:print(\"1\")", "#print(\"muri\")\r\na, b = map(str, input().split())\r\nif a==b:print(a)\r\nelse: print(\"1\")", "\"\"\"\n\thttps://codeforces.com/problemset/problem/664/A\n\"\"\"\n\na, b = map(int, input().split())\n\nif a == b:\n\tprint(a)\nelse:\n\tprint(1)", "import sys\r\nimport math\r\nimport heapq\r\nfrom functools import lru_cache\r\nfrom collections import Counter\r\nfrom collections import defaultdict\r\nfrom collections import deque\r\ninput = sys.stdin.readline\r\n\r\n\r\n\r\n############ ---- Input Functions ---- ############\r\ndef inp():\r\n return(int(input()))\r\ndef inlt():\r\n return(list(map(int,input().split())))\r\ndef insr():\r\n s = input()\r\n return(list(s[:len(s)-1]))\r\ndef invr():\r\n return(map(int,input().split()))\r\n\r\n\r\ndef main():\r\n a, b = inlt()\r\n \r\n if a == b:\r\n print(a)\r\n else:\r\n print(1)\r\n \r\n \r\n \r\nif __name__ == \"__main__\":\r\n main()\r\n \r\n \r\n \r\n \r\n \r\n\r\n\r\n\r\n\r\n", "n1,n2=input().split()\r\nn1,n2 = int(n1),int(n2)\r\nif n1 == n2:\r\n print(n1)\r\nelse:\r\n print(1)", "n1,n2 = list(map(int,input().split()))\nif n1==n2:\n print(n1)\nelse:\n print(1)\n", "from collections import Counter \r\nfrom collections import defaultdict\r\nfrom bisect import bisect_left,bisect_right\r\ndef testcase(): return int(input())\r\ndef maps(): return map(int, input().split())\r\ndef lists(): return list(map(int, input().split()))\r\ndef sorts(): return sorted(map(int, input().split()))\r\ndef solve():\r\n l,r = maps()\r\n print(l) if l == r else print(1)\r\nT = 1\r\nfor ___ in range(T):\r\n solve()", "def solve(num1, num2):\r\n return (1, num1)[num1 == num2]\r\n\r\nif __name__ == \"__main__\":\r\n a, b = input().split()\r\n print(solve(a, b))", "a,b=map(int,input().split())\r\nif a==b:print(a)\r\nelse:print(1)", "ab = input().split()\nnum1 = ab[0]\nnum2 = ab[1]\ndef GCD(a, b):\n print(a) if a == b else print(1)\n\nGCD(num1, num2)", "def main():\r\n a,b = map(int,input().split())\r\n\r\n if a!=b > 0:\r\n return 1\r\n \r\n return a\r\n\r\nprint(main())", "a,b=input().split();print([a,1][a!=b])", "a,b=input().split()\na=int(a)\nb=int(b)\nif a<b:\n print(1)\nelse :\n print(a)", "a, b = map(int, input().split())\r\nif a == b: print(a)\r\nelse: print(1)", "from math import gcd\r\na,b = map(int,input().split())\r\nif a == b:print(a)\r\nelse:print(1)", "a,b = input().split()\r\nprint([1,a][a == b])", "from itertools import accumulate\r\nfrom collections import defaultdict\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\nnum1,num2 = IL()\r\n\r\nif num1 == num2:\r\n print(num1)\r\nelse:\r\n print(1)", "a,b = (int(i) for i in input().split())\r\nres = 1\r\nif a==b:\r\n res = a\r\nprint(res)", "num1,num2=map(int,input().split())\r\nif num1==num2:\r\n print(num1)\r\nelse:\r\n print(1)", "def nod(a, b):\r\n if a == b:\r\n return a\r\n return 1\r\n\r\n\r\nA, B = [int(i) for i in input().split()]\r\nprint(nod(A, B))\r\n", "def findGCD(a, b):\n if a == b:\n return a\n return 1\n\ndef main():\n curr_input = input()\n curr_input = curr_input.split()\n res = findGCD(curr_input[0], curr_input[1])\n print(res)\n\nif __name__ == \"__main__\":\n main()\n\n\n", "n1, n2 = input().split()\r\nprint(n1 if n1 == n2 else 1)\r\n", "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 solve(a, b):\r\n cur_gcd = a\r\n for i in range(a+1, b+1):\r\n cur_gcd = gcd(i, cur_gcd)\r\n if cur_gcd == 1:\r\n return 1\r\n return cur_gcd\r\n\r\n\r\nif __name__ == \"__main__\":\r\n a, b = map(int, input().split(\" \"))\r\n print(solve(a,b))", "a,b=map(int, input().split())\r\nprint(a if a==b else 1)", "a,b = map(int,input().split())\r\nif a!=b:print(1)\r\nelse:print(a)\r\n", "s = input().split()\r\nif(int(s[0])==int(s[1])):print(s[0])\r\nelse:print(1)", "import math\n\na, b = map(int, input().split())\nr = a\nfor i in range(a+1, b+1):\n if r == 1:\n break\n r = math.gcd(r, i)\nprint(r)\n", "def gcd_complicated(a, b):\r\n if a == b:\r\n return a\r\n else:\r\n return 1\r\n\r\n\r\nn, k = map(int, input().split())\r\nprint(gcd_complicated(n, k))\r\n", "#import sys\r\n#from collections import defaultdict\r\n\r\ndef inp():\r\n return(int(input()))\r\ndef inlt():\r\n return(list(map(int,input().split())))\r\n\r\ndef insr():\r\n s = input()\r\n return(list(s[:len(s)]))\r\n\r\ndef invr():\r\n return(map(int,input().split()))\r\n\r\na, b = invr()\r\nif a % b == 0:\r\n print(a)\r\nelse:\r\n print(1)\r\n\r\n", "n, m = map(int, input().split())\r\nif (n==m):\r\n print (n)\r\nelse:\r\n print (\"1\")", "def GCD(a ,b):\r\n\tif b==a:\r\n\t\treturn a\r\n\treturn 1\r\nif __name__ == '__main__':\r\n\ti, y = map(int,input().split())\r\n\tprint(GCD(i, y))", "import sys\r\nimport threading\r\nfrom functools import lru_cache\r\nfrom bisect import bisect_left\r\nimport math\r\nfrom collections import defaultdict, deque, Counter\r\nfrom heapq import *\r\n\r\ndef main():\r\n def gcd(a, b):\r\n if not b:\r\n return a\r\n return gcd(b, a%b)\r\n \r\n \r\n a, b = [int(i) for i in input().split()]\r\n if a == b:\r\n print(a)\r\n else:\r\n print(1)\r\n \r\n \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()\r\n ", "a, b = map(int,input().split())\r\n\r\nif abs(a-b) == 0:\r\n print(a)\r\nelse:\r\n print(1)", "x = list(map(int,input().split(' ')))\nresult = 1 if x[0] != x[1] else x[0]\nprint(result)\n\n\n\n\n", "num1,num2 = map(int,input().split(' '))\r\nif num1 == num2:\r\n print(num1)\r\n\r\nelse:\r\n print(1)", "val = input().split()\r\nnum1 = int(val[0])\r\nnum2 = int(val[1])\r\nif num1 == num2:\r\n print(num1)\r\nelse:\r\n print(1)", "a = input().split()\nprint(a[0] if a[0] == a[1] else 1)\n# Fri Dec 13 2019 14:02:34 GMT+0300 (MSK)\n", "A,B=map(int,input().split())\n\nif(A==B):\n print(A)\n \nelse:\n print(1)\n \t\t\t \t \t \t \t\t \t\t\t\t \t\t\t \t", "a, b = ((input()).split())\r\na = int(a)\r\nb = int(b)\r\nif a == b:\r\n print(a)\r\nelse:\r\n print('1')", "def GCD(a, b):\r\n\r\n if b == 0:\r\n return a\r\n return GCD(b, a%b)\r\n\r\na, b = map(int, input().split())\r\n\r\ng =a\r\nfor i in range(a, b+1):\r\n g = GCD(i, g)\r\n if g == 1:\r\n break\r\n \r\nprint(g) ", "def MCD_nNumeros(a,b):\r\n\tif(a != b):\r\n\t\treturn 1\r\n\telse:\r\n\t\treturn a\r\n\r\na,b = [int(i) for i in input().split()]\r\n\r\nprint(MCD_nNumeros(a,b))\r\n", "num1, num2 = list(map(str, input().split()))\nclass Solution: \n \n def calcGCD(self, num1, num2):\n if num1 == num2:\n return num1\n else:\n return 1\n\nsol = Solution()\nprint(sol.calcGCD(num1, num2))", "from math import gcd\r\na, b = map(int, input().split())\r\nANS = a\r\nfor x in range(a, b + 1):\r\n ANS = gcd(ANS, x)\r\n if ANS == 1:\r\n break\r\nprint(ANS)\r\n", "n, m = input().split()\r\nn = int(n)\r\nm = int(m)\r\n\r\nif n == m:\r\n print(n)\r\nelse:\r\n print(1)\r\n \r\n ", "s1, s2 = input().split()\r\nif s1 == s2:\r\n print(s1)\r\nelse:\r\n print(1)", "import sys\r\n\r\ndef main():\r\n a, b = sys.stdin.read().strip().split()\r\n return a == b and a or 1\r\n\r\nprint(main())\r\n", "from sys import stdin,stdout\r\ninput=lambda:stdin.readline().strip()\r\na,b=input().split()\r\nif a==b:\r\n print(a)\r\nelse:\r\n print(1)\r\n", "import fileinput\r\n\r\nlines = []\r\nfor line in fileinput.input():\r\n lines.append([int(x) for x in line.split()])\r\n\r\ndef sign(x):\r\n if x >= 0 :\r\n return 1\r\n else:\r\n return -1\r\n\r\nfor l in range(0, len(lines), 1):\r\n a,b = lines[l]\r\n if a == b:\r\n print(a)\r\n else:\r\n print(1)", "a,b=input().split();print([1,a][a==b])", "a, b = map(int, input().split())\nprint(a if a==b else 1)\n \t \t \t \t\t\t \t \t \t\t\t \t\t", "def 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\n# def gcd(num1, num2):\r\n# if num2 == 0:\r\n# return num1\r\n \r\n# return gcd(min(num1, num2), max(num1, num2) % min(num1, num2))\r\n \r\n \r\n \r\n \r\n \r\nnum1,num2 = MI()\r\n \r\nif num1 == num2:\r\n print(num1)\r\nelse:\r\n print(1)\r\n\r\n \r\n \r\n \r\n ", "l,st=map(int,input().split())\r\nif(l==st):\r\n print(l)\r\nelse:\r\n print(1)\r\n ", "\r\na, b = list(map(int, input().split(' ')))\r\n\r\n\r\ndef ecl(a, b):\r\n while b != 0: \r\n temp = a\r\n a = b\r\n b = temp%b \r\n # a, b = b, a%b \r\n return a\r\n\r\ncur = a\r\nfor i in range(a+1, b+1):\r\n cur = ecl(cur, i)\r\n if cur == 1:\r\n break\r\nprint(cur)", "## J - Complicated GCD\n\n## gcd baseado no algoritmo da aula\ndef gcd(a, b):\n return a if b == 0 else gcd(b, a % b)\n\nint_a, int_b = [int(n) for n in input().split(\" \")]\n\nif int_a == int_b:\n print(int_a)\nelse:\n # ptr1 = int_a\n # ptr2 = int_a + 1\n # while ptr2 <= int_b:\n # ptr1 = gcd(ptr1, ptr2)\n # ptr2 += 1\n # print(ptr1)\n\n # g(a, a + 1) => g(a + 1, 1) => g(1, a + 1) ... => 1 portanto gcd(1, n) => 1, logo: g(a, a + 1, ..., b) => 1\n print(1)\n \t \t\t\t \t \t\t \t \t\t\t \t \t\t \t\t\t", "def main():\r\n inpt = input().split()\r\n if inpt[0] == inpt[1]:\r\n print(inpt[0])\r\n else:\r\n print(1)\r\n\r\nmain()", "# ██╗ ██╗ █████╗ ██╗ ██████╗ ███████╗ ████████╗ ██╗ ██╗ \r\n# ██║ ██╔╝██╔══██╗██║ ██╔══██╗ ██╔════╝ ██ ╔════╝ ██║ ██║ \r\n# █████╔╝ ███████║██║ ██║ ██║ █████╗ ████████║ ███████║ \r\n# ██╔═██╗ ██╔══██║██║ ██║ ██║ ██╔══╝ ╔════╝██║ ██╔══██║ \r\n# ██║ ██╗██║ ██║███████╗██████╔╝ ███████╗ ████████║ ██║ ██║ \r\n# ╚═╝ ╚═╝╚═╝ ╚═╝╚══════╝╚═════╝ ╚══════╝ ╚══════╝╚ ═╝ ╚═╝ \r\n\r\nMOD = int(1e9)+7\r\nMOD = int(1e9)+7\r\nfrom math import sqrt,ceil,log,log2,\\\r\nfloor,gcd,pi,factorial,lcm\r\nfrom collections import deque\r\nfrom itertools import permutations\r\n\r\ndef solve():\r\n print(a if a==b else 1)\r\n\r\nif __name__=='__main__':\r\n a,b = input().split()\r\n solve()", "import sys, threading\r\nimport math\r\nfrom math import log2,floor\r\nimport heapq\r\nfrom collections import defaultdict,deque\r\ninput = sys.stdin.readline\r\n \r\n############ ---- Input Functions ---- ############\r\ndef inp():\r\n return(int(input()))\r\ndef inlt():\r\n return(list(map(int,input().split())))\r\ndef insr():\r\n s = input()\r\n return(list(s[:len(s) - 1]))\r\ndef invr():\r\n return(map(int,input().split()))\r\nl,r = invr()\r\nif l==r:\r\n print(l)\r\nelse:\r\n print(1)\r\n# def main():\r\n \r\n\r\n# threading.stack_size(1 << 27)\r\n# sys.setrecursionlimit(1 << 30)\r\n# main_thread = threading.Thread(target=main)\r\n# main_thread.start()\r\n# main_thread.join()", "n,m = list(input().split())\r\nif n==m:\r\n print(m)\r\nelse:\r\n print(1)\r\n", "x,y = map(int, input().split())\nif x != y:\n\tprint(1)\nelse:\n\tprint(x)", "a, b = list(map(str, input().split()))\r\n#print(type(a), b)\r\n\r\nif a == b:\r\n print(int(a))\r\nelse:\r\n print(1)", "from sys import stdin\r\na,b=map(int,stdin.readline().strip().split())\r\nif a==b:\r\n print(a)\r\nelse:\r\n print(1)", "s1, s2 = input().split()\r\nif(s1==s2):\r\n print(s1)\r\nelse:\r\n print(\"1\")", "def rangegcd(a, b):\r\n return a if a == b else 1\r\n\r\nc, d = map(int, input().split())\r\nans = rangegcd(c, d)\r\nprint(ans)", "from collections import defaultdict, Counter, deque\r\nimport sys\r\nimport threading\r\nfrom sys import stdin, stdout\r\n\r\nsys.setrecursionlimit(1 << 30)\r\nthreading.stack_size(1 << 27)\r\ndef main():\r\n first, second = map(int, input().split())\r\n \r\n if first == second:\r\n print(first)\r\n else:\r\n print(1)\r\n \r\nthread = threading.Thread(target = main)\r\nthread.start()\r\nthread.join()", "a,b = input().split(' ')\r\nif(a==b):print(a)\r\nelse:print(1)", "def gcd_range(a,b):\r\n\tif a!=b:\r\n\t\treturn 1\r\n\telse:\r\n\t\treturn a\r\na=input().split()\r\n\r\nprint(gcd_range(int(a[0]),int(a[1])))", "def solution(l1):\r\n if l1[0]==l1[1]:\r\n return l1[0]\r\n else:\r\n return 1\r\ndef answer():\r\n l1 = [int(x) for x in input().split()]\r\n print(solution(l1))\r\nanswer()", "def main():\r\n a, b = map(int,input().split())\r\n if a == b:\r\n print(a)\r\n else:\r\n print(1)\r\nmain()", "n,m = list(map(str,input().split()))\r\n\r\nif(n == m):\r\n print(n)\r\nelse:\r\n print('1')", "A, B = input().split()\r\nif A == B:\r\n print(A)\r\nelse:\r\n print(1)", "a, b = [ int(x) for x in input().split() ]\n\nif b - a > 0:\n print(1)\nelse:\n print(a)", "a, b = input().split()\r\nif(a == b):\r\n r = a\r\nelse:\r\n r = 1\r\nprint(r)\r\n", "try:\r\n\ta, b = [int(x) for x in input().split()]\r\nexcept Exception:\r\n a = int(input())\r\n b = int(input())\r\n\r\nif a == b:\r\n\tprint(a)\r\nelse:\r\n\tprint(1)", "a, b = (int(i) for i in input().split())\nres = a if a == b else 1\nprint(res)\n", "a = input().split()\r\nprint(a[0] * int(a[0] == a[1]) + \"1\" * int(a[0] != a[1]))", "def gcd(a, b):\r\n if b==0:\r\n return a\r\n a, b = b, a%b\r\n return gcd(a, b)\r\n\r\na,b = [int(x) for x in input().split()]\r\n\r\ng=0\r\nfor i in range(a, b+1):\r\n g=gcd(g, i)\r\n if g==1:\r\n break\r\n \r\nprint(g)", "n = input()\r\nn = n.split(\" \")\r\nif (n[0]==n[1]):\r\n print(n[0])\r\nelse:\r\n print(\"1\")", "x,y=map(int, input().split())\nif x==y:\n print(x)\nelse:\n print(1)", "x,y = map(int,input().split())\nif x == y:print(x)\nelse: print(1)\n \t\t \t \t\t\t\t\t \t \t\t\t \t\t", "lista = input(). split(\" \")\na = int(lista[0])\nb = int(lista[1])\n\nif(a == b):\n print(a)\nelse:\n print(\"1\")\n\n\t \t\t \t \t\t\t\t\t \t\t \t \t \t\t \t", "#nums = list(map(int, input().split()))\r\n\r\n\r\nnum1,num2 = map(int, input().split())\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\n \r\nif num1 == num2:\r\n print(num1)\r\nelse:\r\n print(1)", "from sys import stdin\r\na, b = [int(i) for i in stdin.readline().strip().split()]\r\nif a == b:\r\n print(a)\r\nelse:\r\n print(1)\r\n ", "def answer(a,b):\r\n if a!=b:\r\n return 1\r\n return a\r\n \r\ndef main():\r\n inputs = list(map(int, input().split()))\r\n a, b = inputs[0], inputs[1]\r\n print(answer(a, b))\r\n \r\n \r\nif __name__ == \"__main__\":\r\n main()", "n,m=map(int,input().split())\r\nif n<m:\r\n print(1)\r\nelif n==m:\r\n print(n)\r\n", "def confusingGCD(a, b):\r\n if a == b:\r\n return a\r\n \r\n return 1\r\n\r\nfirst_num, second_num = list(map(int, input().split()))\r\nprint(confusingGCD(first_num, second_num))", "a, b = list(input().split())\r\n\r\nlen1 = len(a)\r\nlen2 = len(b)\r\n\r\nif len1 < len2:\r\n print(\"1\")\r\nelse:\r\n for i in range(len1):\r\n if a[i] != b[i]:\r\n print(\"1\")\r\n break\r\n else:\r\n print(a)\r\n", "z = input().split(\" \")\n\nfirst = int(z[0])\nsecond = int(z[1])\n\n\nif first == second:\n\tprint(str(first))\nelse: \n\tprint(str(1))", "a,b = [int(i) for i in input().split()]\n\nif(a == b): print(a)\nelse: print(1)", "import sys\r\n\r\ninput = sys.stdin.readline\r\na, b = tuple(list(map(int, input().split())))\r\n\r\ndef complicatedGCD(a, b):\r\n if a != b:\r\n return 1\r\n else:\r\n return a\r\n\r\nprint(complicatedGCD(a, b))", "def complicated():\r\n a,b = map(int,input().split())\r\n if a == b:\r\n return a\r\n return 1\r\nprint(complicated())", "o,l=map(int,input().split())\r\nif o==l:\r\n print(o)\r\nelse:\r\n print(1)", "a,b=map(int,input().split());print([1,a][a==b])\r\n", "import math\nn = input()\nns = list(map(int, n.split(' ')))\nx = 0\nif(ns[1] - ns[0] > 1):\n x = 1\nelse:\n x = math.gcd(ns[0],ns[1])\n\nprint(x)\n \t\t \t \t \t\t\t\t \t\t \t\t\t\t\t", "# cf 664 A 900\nn, m = input().split()\nif n == m:\n print(n)\nelse:\n print(1)\n\n \n", "c, d = map(int, input().split())\r\n\r\na = max(c, d)\r\nb = min(c, d)\r\n\r\nif a - b > 0:\r\n print(1)\r\nelse:\r\n\r\n print(a)", "a, b = input().split(\" \")\n\nn1 = list(a)\nn2 = list(b)\n\nx= False\nif len(a) < len(b):\n x = True\nelse:\n for i in range(0, len(a)):\n if n1[i] != n2[i]:\n x = True\n break\n \nif x:\n print(1)\nelse:\n print(a)\n\t \t\t\t\t\t \t\t\t\t\t \t\t \t\t", "A,B=input().split()\nif(A==B):\n print(A)\nelse:\n print(1)", "a, b = input().split()\nif a != b:\n print(1)\nelse:\n print(a)\n \t \t \t \t\t \t \t\t\t\t \t\t\t \t\t \t\t", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\na, b = input().rstrip().decode().split()\r\nans = \"1\" if not a == b else a\r\nprint(ans)", "first, second = list(map(int, input().split()))\r\nif first==second:\r\n print(first)\r\nelse:\r\n print(1)", "#Mian_Talha_G\r\na,b = map(int,input().split())\r\nif int(a)== int(b):\r\n print(a)\r\nelse:\r\n print('1')", "def gcd(a,b):\r\n if a==b:\r\n return a\r\n else:\r\n return 1\r\n \r\n \r\na,b=[int(x) for x in input().split()]\r\nprint(gcd(a,b))\r\n", "start,end = map(int,input().split()) \r\n\r\nif start == end:\r\n print(start)\r\nelse:\r\n print(1)\r\n\r\n", "a,b = map(int,input().split())\r\nif b - a == 0:\r\n print(b)\r\nelse:\r\n print(1)", "from collections import *\nimport sys\nfrom functools import reduce\nfrom itertools import *\n\ndef _input(): return sys.stdin.readline().rstrip(\"\\r\\n\") \ndef I(): return int(_input())\ndef II(): return _input()\ndef III(): return map(int, _input().split())\ndef IV(): return list(map(int, _input().split()))\ndef V(): return sorted(list(map(int, _input().split())))\ndef out(var): sys.stdout.write(str(var) + \"\\n\")\n\n\ndef Solve():\n A, B = III()\n if A == B:\n print(A)\n else:\n print(1)\nT = 1\nfor ___ in range(T):\n Solve()\n", "a,b = input().split()\r\na,b = int(a),int(b)\r\nif a == b:\r\n print(a)\r\nelse:\r\n print(1)", "x = [int(num) for num in input().split()]\r\na = x[0]\r\nb = x[1]\r\nif a != b:\r\n print(1)\r\nelse:\r\n print(a)", "i, j = map(int, input().split())\r\nif i == j:\r\n print(i)\r\nelse:\r\n print(1)", "import sys\r\nfrom heapq import heappush, heappop, heapify\r\nfrom collections import Counter, deque, defaultdict\r\nimport bisect\r\nimport math\r\nimport re\r\nfrom functools import lru_cache\r\nsys.setrecursionlimit(200001)\r\ndef getIntegerInputs():\r\n return map(int, input().split())\r\n \r\ndef inbound(r, c, n, m):\r\n return 0 <= r < n and 0 <= c < m\r\nDIR = [(0,1),(0,-1),(-1,0),(1,0)]\r\n# def bfs(queue, visited, grid):\r\n# n, m = len(grid), len(grid[0])\r\n# while queue:\r\n# r, c = queue.popleft()\r\n# for x, y in DIR:\r\n# nr, nc = r + x, c + y\r\n# if (nr, nc) == (1, m-1) and grid[nr][nc] == 0:\r\n# return True\r\n# if not inbound(nr, nc, n, m) or visited[nr][nc] or grid[nr][nc]:\r\n# continue\r\n# queue.append((nr, nc))\r\n# visited[nr][nc] = 1\r\n# return False\r\ndef findGcm(x, y):\r\n if not y:\r\n return x\r\n return findGcm(y, x % y)\r\n \r\ndef solve():\r\n x, y = getIntegerInputs()\r\n gcm = x\r\n if x == y:\r\n print(x)\r\n return\r\n for i in range(x, x+11):\r\n gcm = findGcm(i, gcm)\r\n print(gcm)\r\n \r\nif __name__ == \"__main__\":\r\n solve()\r\n", "n,m = map(int,input().split())\r\nif n == m: print(n)\r\nelse: print(1)", "a=str(input()).split()\r\nx=max(int(a[0]),int(a[1]))\r\ny=min(int(a[0]),int(a[1]))\r\nif x>y:\r\n print(1)\r\nelse:\r\n print(x)", "a, b = map(str, input().split())\r\nprint(1 if a != b else a)", "import math\nimport sys\n\ninput = sys.stdin.readline\n\na, b = map(int, input().split())\n\nif a < b:\n print(1)\nelse:\n print(a)\n", "import sys\ninput = sys.stdin.readline\n\na, b = [int(i) for i in input().split()]\nprint(a if a == b else 1)\n", "def gcd(a,b):\r\n if a<b:\r\n return 1\r\n else:\r\n return a\r\n\r\nif __name__=='__main__':\r\n a,b = map(int,input().split())\r\n x=gcd(a,b)\r\n print(x)\r\n", "num1, num2 = map(int, input().split())\r\nif num1 == num2:\r\n print(num1)\r\nelse:\r\n print(1)", "from math import gcd\r\n\r\na, b = (el for el in input().split())\r\n\r\nif a == b:\r\n print(a)\r\nelse:\r\n print(1)", "n,m=map(int,input().split());print([n,1][n!=m])", "\r\n\r\na, b = map(int, input().split())\r\nprint(a if a == b else 1)\r\n\r\n# UBCF\r\n# CodeForcesian\r\n# ♥\r\n# شبی باز از آن کوچه", "def solve():\n a, b = input().split()\n if a == b:\n return a\n else:\n return 1\n\nprint(solve())", "x,y = map(int, input().split())\nif x != y: print(1)\nelse: print(x)", "\r\ndef GCD(x, y):\r\n if y == 0:\r\n return x\r\n return GCD(y, x % y)\r\n\r\na, b = map(int, input().split())\r\n\r\nif a == 1 or b - a >= 1:\r\n print(1)\r\nelif b - a == 0:\r\n print(a)\r\nelse:\r\n complicatedGCD = a\r\n for i in range(a + 1, b + 1):\r\n complicatedGCD = GCD(complicatedGCD, i)\r\n\r\n print(complicatedGCD)\r\n", "def gcd(a,b):\r\n if(a == b):\r\n return a\r\n else:\r\n return 1\r\na,b = [int(i) for i in input().split()]\r\nprint(gcd(a,b))\r\n", "#Este código é para achar o mdc\n\nm,n=input().split()\n\nprint(m if m==n else 1)\n \t\t\t\t\t\t \t\t \t \t \t\t \t\t\t", "def helper(pw,k):\r\n if k == 0:\r\n return pw\r\n return helper(k,pw%k)\r\n \r\npw, k = map(int,input().split())\r\nif pw != k:\r\n print(1)\r\nelse:\r\n print(helper(k,pw))", "def find_gcd(num1, num2):\r\n a,b = num1, num2\r\n\r\n while num2:\r\n num1, num2 = num2, num1 % num2\r\n\r\n return (num1) if (num1 == 1 or b-a==0 ) else 1\r\n\r\na, b = tuple(map(int, input().split()))\r\nprint(find_gcd(a, b))\r\n", "n , k = input().split()\nif n==k : \n print(n)\nelse :\n print(\"1\") \n \t \t \t \t \t\t\t\t\t \t \t\t\t", "n,m=input().split();print([1,n][n==m])", "a,b =input().split(\" \")\na=int(a)\nb=int(b)\nif a==b:\n print(a)\nelse:\n print(1)\n\n \t\t\t\t\t\t\t \t\t \t\t\t\t \t\t \t \t", "maximum, minimum = map(int,input().split())\r\nif minimum == maximum:\r\n print(minimum)\r\nelse:\r\n print(1)", "def main():\r\n a,b=map(str,input().split())\r\n if a==b:\r\n print(a)\r\n else:\r\n print(1)\r\nif __name__=='__main__':\r\n main()", "a,b=map(int,input().split())\r\nif a<b:\r\n print(1)\r\nelse:\r\n print(a)", "a=[int(x) for x in input().split()]\r\nif a[0]==a[1]:\r\n print(a[0])\r\nelse:\r\n print(1)", "\n\ndef main():\n entrada = input()\n entrada = entrada.split();\n if (entrada[0] == entrada[1]):\n print(int(entrada[0]))\n else:\n print(1)\nmain()\n \n\t\t\t\t\t\t\t\t \t\t \t\t \t\t\t\t\t \t", "lista = list(map(int, input().split()))\r\na = lista[0]\r\nb = lista[1]\r\nif a == b:\r\n\tprint(a)\r\nelse:\r\n\tprint(1)", "x,y = input().split(\" \")\r\nx,y = int(x),int(y)\r\n\r\nif x==y:print(x)\r\nelse:print(1)", "#rOkY\r\n#FuCk\r\n\r\n################################ kOpAl ############################################\r\n\r\na,b=map(str,input().split())\r\nif(a==b):\r\n print(a)\r\nelse:\r\n print('1')\r\n", "# Templates for the inputs:\r\nfrom typing import List\r\n# from collections import Counter, defaultdict\r\n# import sys\r\n# import itertools\r\n# import bisect\r\n\r\ndef stringInput() -> str:\r\n return sys.stdin.readline()\r\n \r\ndef listInput() -> List[int]:\r\n return list(map(int, input().split()))\r\n \r\ndef string_list() -> List[int]:\r\n return list(input())\r\ndef intInput() -> int:\r\n return int(input())\r\n\r\n \r\ndef solve():\r\n tt = 1\r\n # tt = intInput()\r\n for _ in range(tt):\r\n a, b = listInput()\r\n print(a if a== b else 1)\r\n \r\n\r\n# Driver code... \r\nif __name__ == '__main__':\r\n solve()\r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n ", "a, b = map(int, input().split())\n\nif a == b:\n\tprint(a)\nelse:\n\tprint(1)\n \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, m = map(int, input().split())\r\nif n == m:\r\n print(n)\r\nelse:\r\n print(1)", "import math\r\ntemp = input().split()\r\n\r\na = int(temp[0])\r\nb = int(temp[1])\r\n\r\nif a == b:\r\n print(a)\r\nelse:\r\n print(1)", "nums = list(map(str, input().split(' ')))\r\n\r\nif (nums[0] == nums[1]):\r\n print(nums[0])\r\nelse:\r\n print(\"1\")\r\n", "import sys\nsys.stderr = sys.stdout\n\n\ndef complicated(a, b):\n if a == b:\n return a\n else:\n return '1'\n\n\ndef main():\n a, b = input().split()\n print(complicated(a, b))\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", "def complicated_gcd(small, big):\r\n return small if big == small else 1\r\n\r\ninp = input().split()\r\nresult = complicated_gcd(inp[0], inp[1])\r\nprint(result)", "a = list(set(input().split()))\r\nif len(a)==1:\r\n print(a[0])\r\nelse:\r\n print(1)", "#never give up\r\ni,j=map(int,input().split())\r\nif i!=j:\r\n print('1')\r\nelse:\r\n print(i)\r\n", "def MCD(a,b):\r\n if(a!=b):\r\n return 1\r\n else:\r\n return a\r\na,b=[i for i in input().split()]\r\nprint(MCD(a,b))\r\n", "a, b = map(int, input().split())\r\n\r\nans = 0\r\n\r\nif a == b:\r\n ans = a\r\nelse:\r\n ans = 1\r\n\r\nprint(ans)\r\n", "a, b = [int(x) for x in input().split()]\r\nprint(a if a == b else '1')", "import sys, copy, threading, math\r\n# sys.setrecursionlimit(8000)\r\n# sys.setrecursionlimit(1 << 30)\r\nfrom collections import Counter, defaultdict, deque\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)]))\r\n\r\nnum1, num2 = inlt()\r\ndef main(num1, num2):\r\n if num1 == num2:\r\n return num1\r\n return 1\r\n\r\nprint(main(num1, num2))\r\n\r\n\r\n# if __name__ == \"__main__\":\r\n# sys.setrecursionlimit(1 << 30)\r\n# threading.stack_size(1 << 27)\r\n# thread = threading.Thread(target=main)\r\n# thread.start()\r\n# thread.join()", "s=str(input())\r\nl=\"\"\r\nst=\"\"\r\nfor i in range(len(s)):\r\n if(s[i]!=\" \"):\r\n l+=s[i]\r\n else:\r\n k=i\r\n break\r\nfor j in range(k+1,len(s)):\r\n st+=s[j]\r\nif(l==st):\r\n print(l)\r\nelse:\r\n print(1)\r\n ", "# It's clearly impossible to compute all the gcds of all numbers at\n#the worst interval case in the given time limit, so the trick is\n#understanding that two consecutives integers are always coprime.\n# So in any sequence longer than 1, the gcd will be 1.\na, b = map(int, input().split())\n\nif a != b:\n print(1)\nelse:\n print(a)\n \t \t\t\t\t \t \t \t \t\t \t \t", "a,b = map(str,input().split())\r\nif a == b:\r\n print(a)\r\nelse:\r\n print(1)", "a = input().split()\nprint(1 if a[0] != a[1] else a[0])", "def solve(num1, num2):\r\n if num1 == num2:\r\n print(num1)\r\n else:\r\n print(1)\r\n\r\ndef main():\r\n num1, num2 = input().split()\r\n solve(num1, num2)\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "num1, num2 = input().split()\n\nif (num1 == num2):\n print(num2)\nelse:\n print(1)", "def my_gcd(x, y):\r\n temp = x % y\r\n if temp == 0:\r\n return y\r\n return my_gcd(y, temp)\r\n\r\n\r\nm, n = map(int, input().split())\r\nif m == n:\r\n print(m)\r\nelse:\r\n if m < n:\r\n s = m\r\n l = n\r\n else:\r\n s = n\r\n l = m\r\n gcd = 0\r\n for i in range(s, l):\r\n for j in range(i+1, l+1):\r\n gcd = my_gcd(i, j)\r\n if gcd == 1:\r\n break\r\n if gcd == 1:\r\n break\r\n print(gcd)", "a, b = tuple(map(int,input().split()))\r\nif a !=b:\r\n print(1)\r\nif a == b:\r\n print(a)\r\n ", "def solve(n,m):\r\n if n==m :return(m)\r\n return(1)\r\nn,m = input().split(\" \")\r\nprint(solve(n,m))", "s1, s2 = map(str, input().split())\r\nif s1 == s2:\r\n print(s1)\r\nelse:\r\n print(1)\r\n", "def getGCD(numbers):\r\n if numbers[1] - numbers[0] == 0:\r\n return numbers[0]\r\n return 1\r\n\r\nnumbers = list(map( int,input().split(' ')))\r\nprint(getGCD(numbers))\r\n", "import math\r\nn,m=[int(x) for x in input().split()]\r\nif(n==m):\r\n print(n)\r\nelse:\r\n print('1')\r\n", "def inp():\r\n n, m = input().split()\r\n print(1 if n != m else n)\r\n\r\ninp()", "n,m = [int(x) for x in input().split()]\nif n==m:\n print(n)\nelse:\n print(1)\n", "bruh = input().split()\na = int(bruh[0])\nb = int(bruh[1])\nif a == b:\n print(a)\nelse:\n print(1)\n\t \t\t\t\t \t \t\t\t\t \t \t \t\t\t\t \t\t\t\t\t\t", "a, b = list(map(int, input().split()))\n\nprint(1 if a != b else a)", "a, b = map(int, input().split())\r\nprint(a if a == b else 1)", "a, b = map(int, input().split())\n\nif a == b:\n print(\"{}\".format(a))\nelse:\n print(\"{}\".format(1))\n", "a,b=map(int,input().split())\r\nprint(a) if a==b else print(1)", "n1, n2 = list(map(int, input().split()))\r\n\r\nif n1 == n2:\r\n print(n1)\r\nelse:\r\n print(1)", "l=list(map(str,input().split()))\r\na=l[0]\r\nb=l[1]\r\nif(a == b):\r\n print(a)\r\nelse:\r\n print(1)\r\n", "a,b=map(int,input().split())\r\nprint(a if a==b else '1')\r\n", "'''input\r\n61803398874989484820458683436563811772030917980576 61803398874989484820458683436563811772030917980576\r\n\r\n'''\r\nfrom collections import deque, defaultdict\r\n\r\ndef solve():\r\n\tx, y = input().split()\r\n\tif x == y:\r\n\t\tprint(x)\r\n\telse:\r\n\t\tprint(1)\r\n\r\ndef main():\r\n\tt = 1\r\n\t#t = int(input())\r\n\tfor _ in range(t):\r\n\t\tsolve()\r\nmain()", "s=input().split();a,b=int(s[0]),int(s[1])\nif a==b:\n print(a)\nelse:\n print(1)", "a,b = map(int,input().split())\r\n\r\nif abs(a-b)>0:\r\n print(1)\r\nelse:\r\n print(a)\r\n ", "import sys,math,string\ninput=sys.stdin.readline\nfrom collections import deque\nL=lambda : list(map(int,input().split()))\nLs=lambda : list(input().split())\nM=lambda : map(int,input().split())\nn,m=M()\nif(n==m):\n print(n)\nelse:\n print(1)\n", "import sys\r\ninput = sys.stdin.readline\r\nfrom collections import Counter\r\nimport itertools\r\nfrom math import ceil, floor, log\r\nfrom collections import defaultdict\r\n# ---- Input Functions ---- #\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\n\r\ndef solve():\r\n x , y = inlt()\r\n if x == y:\r\n return x\r\n return 1\r\n\r\nif __name__ == \"__main__\":\r\n print(solve())", "a,b=map(int,input().split())\nif a == b :\n print(a)\nelse: print(1)\n\n\n\n", "\r\na,b=[int(i) for i in input().split()]\r\nif a==b:print(a)\r\nelse:print(1)\r\n", "arr = list(map(int, input().split()))\nif abs(arr[0]-arr[1]) > 0:\n print(1)\nelse:\n print(arr[0])\n \t\t\t\t\t \t \t\t\t\t\t \t \t\t\t", "from math import gcd, lcm\n\n\na, b = map(int, input().split())\n\nxgcd = gcd(a, b)//lcm(a, b)\nif xgcd == 0:\n print(1)\n exit()\nprint(gcd(a, b))\n", "temp = list(map(int,input().split()))\r\na,b = temp[0],temp[1]\r\nif a==b:\r\n print(a)\r\nelse:\r\n print(1)", "def main():\n \n nums = input().split(\" \")\n \n if nums[0] == nums[1]: print(nums[0])\n else : print('1')\n \n \nmain()", "c,b=list(map(int,input().split()))\r\nif c==b:\r\n print(c)\r\nelse:\r\n print('1')", "a, b = input().split()\r\nif a == b : print(a)\r\nelse: print(1)", "\r\nfrom collections import defaultdict, deque\r\nimport collections\r\nfrom concurrent.futures import thread\r\nimport heapq\r\nfrom operator import indexOf\r\nimport sys, threading\r\nmod = 1000000007\r\nimport math\r\n\r\ndef get_ints(): return map(int, sys.stdin.readline().strip().split())\r\ndef get_list(): return list(map(int, sys.stdin.readline().strip().split()))\r\ndef get_string(): return sys.stdin.readline().strip()\r\ndef get_int(): return int(sys.stdin.readline().strip())\r\ndef get_list_strings(): return list(map(str, sys.stdin.readline().strip().split()))\r\n\r\ndef run():\r\n a, b = get_ints()\r\n if b - a > 0:\r\n print(1)\r\n else:\r\n print(a)\r\nif __name__ == '__main__':\r\n threading.stack_size(1 << 27)\r\n sys.setrecursionlimit(1 << 30)\r\n main_thread = threading.Thread(target=run)\r\n main_thread.start()\r\n main_thread.join()", "n=input().split(\" \")\r\n\r\ndef gcd(a,b):\r\n if a==b:\r\n print(a)\r\n else:\r\n print(1) \r\ngcd(int(n[0]),int(n[1]))\r\n\r\n", "from math import gcd\n\n(start, end) = [int(i) for i in input().split()]\n\ncurrent_gcd = start\nfor number in range(start+1, end+1):\n\tcurrent_gcd = gcd(current_gcd, number)\n\tif current_gcd == 1:\n\t\tbreak\n\nprint(current_gcd)\n \t \t\t \t \t \t\t\t \t\t\t \t \t\t", "def complicate_gcd(small, big):\r\n return small if big == small else 1\r\n\r\n\r\ndef solution(inp1, inp2):\r\n return complicate_gcd(inp1, inp2)\r\n\r\n\r\ndef main():\r\n inp = input().split()\r\n result = solution(inp[0], inp[1])\r\n print(result)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n , m = map(int,input().strip().split())\r\nif n == m:\r\n ans = n\r\nelse:\r\n ans = 1\r\nprint(ans)", "import math\r\na,b = map(int,input().split())\r\nif b != a:\r\n print(\"1\")\r\nelse:\r\n print(a)", "def main():\n a114514 = input().split()\n a = int(a114514[0]); b = int(a114514[1])\n if (a == b):\n print(a)\n else:\n print(1)\n\nif __name__ == \"__main__\":\n main()", "s, t = input().split(\" \")\r\nif s == t :\r\n print(s)\r\nelse :\r\n print(1)", "a,b = map(int,input().split())\r\nS = a-b\r\nif S == 0:\r\n print(a)\r\nelse:\r\n print('1')", "a,b = map(int,input().split())\r\nprint([a,1][abs(a-b)>0])", "import math\n\n\na,b = [int(x) for x in input().split()] \n\nif(a != b):\n print(\"1\")\n \nelse:\n print(math.gcd(a,b))\n\t\t\t \t\t \t\t\t\t\t\t\t\t \t \t\t\t\t \t \t", "import sys\n#sys.stdin, sys.stdout = open(\"input.txt\", \"r\"), open(\"output.txt\", \"w\")\n\ndef main():\n\ta,b = map(int,input().split())\n\tprint(a) if a==b else print(1)\nif __name__ == \"__main__\":\n\tmain()", "def main():\r\n first, second = input().split()\r\n return first if first==second else 1\r\nprint(main())", "x,y=map(int,input().split())\r\nif x==y:print(x)\r\nelse:print(1)", "entrada = input().split(\" \")\na = int(entrada[0])\nb = int(entrada[1])\n\nif(a == b):\n\tprint(a)\nelse:\n\tprint(1)\n\t\t\t \t\t \t\t\t\t \t\t \t\t \t\t\t \t\t\t", "first, second = input().split()\r\n\r\nif first == second:\r\n print(first)\r\nelse:\r\n print(1)", "x,y = input().split()\r\nif x==y:\r\n print(x)\r\nelse:\r\n print(1)\r\n", "def GCD(a,b):\r\n if b == 0:\r\n return a\r\n \r\n return GCD(b,a%b)\r\n\r\ndef main():\r\n a,b = map(int,input().split())\r\n\r\n if abs(a-b) > 0:\r\n return 1\r\n \r\n return GCD(a,b)\r\n\r\nprint(main())", "a,b=map(int,input().strip().split())\nif a==b:\n\tprint(a)\nelse:\n\tprint(1)\n \t \t\t\t\t \t\t \t\t \t\t\t \t\t\t\t\t", "s = input().split()\r\nprint(s[0] if s[0] == s[1] else '1')\r\n", "m,s=input().split()\r\nif m==s:\r\n print(m)\r\nelse:\r\n print(1)", "a,b=list(map(int,input().split()))\r\nif a==b:\r\n print(b)\r\nelse:\r\n print(1)", "def gcd(num1, num2):\r\n if num1 == num2:\r\n return int(num2)\r\n return 1\r\n \r\ninp = input().split(\" \")\r\nprint(gcd(inp[0], inp[1]))\r\n \r\n", "a,b = list(map(int, input().strip().split(' ')))\r\nmmin=a\r\n\r\nif a==b :\r\n\tprint(a)\r\nelse :\r\n\tprint(1)\r\n", "import math\r\nimport sys\r\ninput = sys.stdin.readline\r\na, b = map(int, input().split())\r\nprint(1) if a != b else print(a)", "# @author Matheus Alves dos Santos\n\nvalues = input().split()\n\nif (values[0] == values[1]):\n print(values[0])\nelse:\n print('1')", "a = input(\"\")\r\na,b = a.split(\" \")\r\nif( a == b):\r\n print(a)\r\nelse: \r\n print(1)", "def runner():\r\n values=input()\r\n values=values.split(\" \")\r\n if values[0]==values[1]:\r\n print(values[0])\r\n else:print(\"1\")\r\nrunner()", "def complexGCD(num1, num2):\r\n if num1 == num2:\r\n return(int(num1))\r\n return 1\r\n\r\ninp = input().rstrip().split()\r\nprint(complexGCD(inp[0], inp[1]))", "n,m=input().split()\r\nprint(n if n == m else 1)\r\n", "n1, n2 = input().split()\r\n\r\nif n1 != n2:\r\n print(1)\r\nelse:\r\n print(n1)", "a, b = [int(num) for num in input().split()]\r\nprint(1 if a != b else a) ", "from collections import defaultdict, deque\r\nfrom functools import lru_cache\r\nfrom heapq import heappush, heappop\r\nfrom bisect import bisect_right, bisect_left\r\nimport math\r\nhpop = heappop\r\nhpush = heappush\r\nMOD = 10**9 + 7\r\n\r\ndef solution():\r\n a,b = list(input().strip().split(\" \"))\r\n \r\n if a == b:\r\n print(a)\r\n else:\r\n print(1)\r\n \r\n \r\n \r\n \r\n\r\n \r\n \r\n \r\n \r\n \r\n\r\n\r\n \r\ndef main():\r\n t = 1\r\n #t = int(input())\r\n for _ in range(t):\r\n solution() \r\n \r\nimport sys\r\nimport threading\r\nsys.setrecursionlimit(1 << 30)\r\nthreading.stack_size(1 << 27)\r\nthread = threading.Thread(target=main)\r\nthread.start(); thread.join()\r\n# main()", "P,Q = map(int, input().split())\r\nif P == Q:\r\n print(P)\r\nelse:\r\n print(1)", "s, e = tuple(map(int, input().split()))\r\nif s == e:\r\n print(s)\r\nelse:\r\n print(1)", "import sys\r\ndef get_array(): return list(map(int, sys.stdin.readline().strip().split()))\r\ndef get_ints(): return map(int, sys.stdin.readline().strip().split())\r\ndef input(): return sys.stdin.readline().strip()\r\n# ///==========MAIN=============///\r\na,b=get_ints()\r\nif a==b:\r\n print(a)\r\nelse:\r\n print(1)", "a,b=input().split();print([a,1][b!=a])", "s=input().split()\nif s[0]==s[1]:\n print(s[0])\nelse:\n print(1)\n\n\t \t\t\t \t\t \t \t \t\t\t\t \t\t", "#Made by FazeCT\r\n\r\na,b=input().split()\r\na = int(a)\r\nb = int(b)\r\nif a<b: print(1)\r\nelse: print(a)", "import sys\r\nimport math\r\nimport bisect\r\nimport heapq\r\nimport string\r\nfrom collections import defaultdict,Counter,deque\r\n \r\ndef I():\r\n return input()\r\n \r\ndef II():\r\n return int(input())\r\n \r\ndef MII():\r\n return map(int, input().split())\r\n \r\ndef LI():\r\n return list(input().split())\r\n \r\ndef LII():\r\n return list(map(int, input().split()))\r\n \r\ndef GMI():\r\n return map(lambda x: int(x) - 1, input().split())\r\n \r\ndef LGMI():\r\n return list(map(lambda x: int(x) - 1, input().split()))\r\n \r\ndef WRITE(out):\r\n return print('\\n'.join(map(str, out)))\r\n \r\ndef WS(out):\r\n return print(' '.join(map(str, out)))\r\n \r\ndef WNS(out):\r\n return print(''.join(map(str, out)))\r\n\r\n'''\r\nAB\r\nAABB\r\nABAB\r\n\r\nBBAA X\r\nAABBA\r\n\r\n010101\r\n\r\nx+y = n\r\nx = n - y\r\nx*y vs (n-y)^2\r\n\r\n0 = 1\r\n1 = 1\r\n01 = max(1*1) = 1\r\n10 = 1\r\n00 = 4\r\n11 = 4\r\n11110 = 16\r\n\r\ncompare biggest group of 1's 0's and num1's * num0's\r\n\r\n5 -1 -2\r\n'''\r\n\r\n# sys.stdin = open(\"backforth.in\", \"r\")\r\n# sys.stdout = open(\"backforth.out\", \"w\")\r\ninput = sys.stdin.readline\r\n\r\ndef dist(c1, c2):\r\n return abs(c1[0] - c2[0]) + abs(c1[1] - c2[1])\r\n\r\ndef solve():\r\n a, b = I().split()\r\n print(a if a == b else 1)\r\n\r\nsolve()", "from sys import stdin, stdout\r\nfrom math import gcd\r\n\r\na, b = map(int, stdin.readline().split())\r\nif a == b:\r\n print(a)\r\nelse:\r\n print(1)\r\n", "\r\na, b = list(map(int, input().split()))\r\n\r\nif a == b:\r\n print( min(a, b) )\r\nelse:\r\n print(1)", "def solve():\r\n a, b = input().split()\r\n \r\n print((1, a)[a == b])\r\n \r\n \r\nif __name__ == \"__main__\":\r\n solve()\r\n ", "def gcd(num1, num2):\r\n if num1 == num2:\r\n return num1\r\n\r\n return 1\r\n\r\n\r\nif __name__ == \"__main__\":\r\n n1, n2 = input().split()\r\n print(gcd(n1, n2))\r\n", "a,b = input().split()\r\nprint(1 if a !=b else a)", "# LUOGU_RID: 97809184\na, b = input().split()\r\nif (a == b):\r\n print(b)\r\nelse:\r\n print('1')\r\n", "\r\na, b = list(map(str, input().split()))\r\n\r\nif a == b:print(a)\r\nelse:print(1)", "a,b = input().split()\nc=1\nif a==b:\n\tprint(a)\nelse:\n\tprint(c)\n\n \t\t \t \t\t\t \t \t \t \t\t\t\t \t \t", "\nab = input().strip().split()\n\nif ab[0] == ab[1]:\n print(int(ab[0]))\nelse:\n print(1)\n", "from sys import stdin\r\ninFile = stdin\r\ntokens = []\r\ntokens_next = 0\r\n \r\ndef next_str():\r\n global tokens, tokens_next\r\n while tokens_next >= len(tokens):\r\n tokens = inFile.readline().split()\r\n tokens_next = 0\r\n tokens_next += 1\r\n return tokens[tokens_next - 1]\r\n \r\ndef nextInt():\r\n return int(next_str())\r\n \r\na = nextInt()\r\nb = nextInt()\r\n \r\nprint(1 if a != b else a)", "import math\r\nf,s =map(int,input().split())\r\nif f ==s:\r\n print(f)\r\nelse:\r\n print(1)\r\n", "a,b=input().split()\r\n\r\nif b != a:\r\n print(1)\r\nelse:\r\n print(a)", "a, b = (int(_) for _ in input().split())\r\nprint(a if a ==b else 1)", "import math\r\nx, y=map(int, input().split())\r\nif x==y:\r\n print(x)\r\nelse:\r\n print(\"1\")\r\n", "# https://codeforces.com/problemset/problem/664/A\r\n\r\na, b = input().split()\r\n\r\nif a == b:\r\n print(a)\r\nelse:\r\n print(1)", "############ ---- By RealGemechis (Black Tourist) ---- ############\r\nimport sys\r\ninput = sys.stdin.readline\r\nimport math\r\nimport bisect\r\nfrom collections import Counter\r\nfrom sys import stdin,stdout\r\nfrom math import gcd,floor,sqrt,log\r\nfrom collections import defaultdict as dd\r\nfrom bisect import bisect_left as bl,bisect_right as br\r\nmod = 1000000007\r\n\r\ndef inp():\r\n return(int(input()))\r\ndef inplist():\r\n return(list(map(int,input().split())))\r\ndef TotalBits(num):\r\n binary = bin(num)[2:]\r\n return len(binary)\r\ndef binary_val(num):\r\n binary = bin(num)[2:]\r\n return binary\r\ndef bin_to_int(x):\r\n return int(x, 2)\r\ndef count_occurrences(arr):\r\n return Counter(arr)\r\ndef max_subarray_sum(arr):\r\n max_so_far = max_ending_here = 0\r\n for x in arr:\r\n max_ending_here = max(x, max_ending_here + x)\r\n max_so_far = max(max_so_far, max_ending_here)\r\n return max_so_far \r\ndef bitmask_operation(bits, k, op):\r\n mask = 1 << k\r\n if op == 'test_kth':\r\n return bool(int(bits, 2) & mask)\r\n if op == 'set_kth':\r\n return bin(int(bits, 2) | mask)[2:] \r\n if op == 'turn_off':\r\n return bin(int(bits, 2) & ~mask)[2:] \r\n if op == 'toggle_bits':\r\n return bin(int(bits, 2) ^ mask)[2:]\r\n raise ValueError(f\"Invalid operation: {op}\")\r\ndef inpstr():\r\n s = input() \r\n return(list(s[:len(s) - 1]))\r\ndef invr():\r\n return(map(int, input().split()))\r\ndef str_int(x):\r\n return(int(x)) \r\ndef TEST():\r\n print(\"Everything is OK\")\r\n# -----------------------------------------------------------------------------------\r\n\r\n \r\ndef main():\r\n num1, num2 = inplist()\r\n\r\n if num1 == num2:\r\n print(num2)\r\n else:\r\n print(1)\r\n\r\n\r\n \r\n \r\n \r\n\r\n\r\nif __name__ == '__main__':\r\n main()", "first = input()\nfirst, second = first.split(' ')\n\nif first == second:\n print(first)\nelse:\n print(1)", "if __name__ == '__main__':\n numA, numB = input().split()\n\n if numA == numB:\n print(numA)\n else:\n print(\"1\")\n\t \t \t \t \t\t \t \t\t \t \t", "[a, b] = [int(i) for i in input().split(\" \")]\n\nif (a == b):\n print(a)\nelse:\n print(1)\n\t\t \t \t \t\t\t\t \t\t \t\t\t\t \t\t \t \t \t", "x,y = map(str, input().split())\r\nif x==y:\r\n print(int(x))\r\nelse:\r\n print(\"1\")", "a, b = input().split()\r\nprint((1, a)[a == b])", "a,b=input().split()\nif a==b:\n print(a)\nelse:\n print(1)\n\n \t\t\t \t \t \t \t \t\t\t", "dados = input().split()\n\nnum1 = int(dados[0])\nnum2 = int(dados[1])\n\nres = num2 - num1\n\nif res == 0:\n print(num1)\n\nelif res > 2 or res == 1:\n print(1)\n\nelif res == 2:\n if num1 % 2 == 0:\n print(2)\n else:\n print(1)\n", "a,b = input().split()\r\nif (a==b):\r\n print(a)\r\nelse:\r\n print(1)", "a_b = input()\na = int(a_b.split(\" \")[0])\nb = int(a_b.split(\" \")[1])\n\ndef gcd(p, q):\n small = min(p,q)\n large = max(p,q)\n while (large % small != 0):\n t = small\n small = large % small\n large = t\n return small\n\nif (a == b):\n print(a)\nelse:\n print(1)", "a, b = map(int, input().split())\r\nprint(a) if a == b else print(1)", "ab=input().split()\r\na=int(ab[0])\r\nb=int(ab[1])\r\nif(a==b):\r\n\tprint(a)\r\nelse:\r\n\tprint(1)", "import math\n\nA, B = map(int, input().split())\n\nif A == B:\n print(A)\nelse:\n print(1)\n\n\n\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 = list(map(int,input().split()))\r\n\r\nif a == b:\r\n print(a)\r\nelse:\r\n print(1)", "a, b = list(map(int, input().split()))\r\nb = min(b, a + 1000)\r\nfrom fractions import gcd\r\nans = 0\r\nfor i in range(a, b + 1):\r\n ans = gcd(ans, i)\r\n \r\nprint(ans)", "left, right = list(map(int, input().split()))\r\nif left == right:\r\n print(left)\r\nelse:\r\n print(1)", "# Complicated GCD\n\na, b = input().split()\nprint(1 if a != b else a)\n", "t=input().split()\r\nx=int(t[0])\r\ny=int(t[1])\r\nif x==y:\r\n print(x)\r\nelse:\r\n print(1)", "a, b = input().split()\r\nif a == b:print(a)\r\nelse:print(1)\r\n", "arr = input().split();\na = int(arr[0]);\nb = int(arr[1]);\n \nif a==b:\n print(str(a));\nelse:\n print(str(1));", "def main():\r\n arr = input().split()\r\n\r\n if arr[0] == arr[1]:\r\n print(arr[0])\r\n else:\r\n print(1)\r\nmain()", "a,b=input().split()\r\n(m,n)=(len(a),len(b))\r\nif m!=n:\r\n\tprint(1)\r\nelse:\r\n\tc=1\r\n\tfor i in range(m):\r\n\t\tif a[i]!=b[i]:\r\n\t\t\tc=0\r\n\t\t\tprint(1)\r\n\t\t\tbreak\r\n\tif c:\r\n\t\tprint(a)", "def GCD(a,b):\r\n if (a==b):\r\n return a\r\n else:\r\n return 1\r\nA = input()\r\na,b = A.split()\r\nprint(GCD(a,b))", "import sys \r\n\r\nnum1, num2 = list(sys.stdin.readline().split())\r\nif num1 == num2:\r\n print(num2)\r\nelse:\r\n print(1)", "def gcd(a,b):\r\n if a==0:\r\n return b\r\n if b==0:\r\n return a\r\n if a % 2 == 0 and b % 2 == 0:\r\n return 2 * gcd(a>>1,b>>1)\r\n elif a % 2 == 0:\r\n return gcd(a>>1,b)\r\n elif b % 2 ==0:\r\n return gcd(a,b>>1)\r\n else:\r\n return gcd(abs(a-b),min(a,b))\r\n\r\n\r\na,b = map(int,input().split())\r\n\r\nif a==b:\r\n print(a)\r\nelse:\r\n print(gcd(a,a+1))", "# import sys\r\n# sys.stdin = open(\"test.in\",\"r\")\r\n# sys.stdout = open(\"test.out\",\"w\")\r\na,b=map(int,input().split())\r\nif a==b:\r\n\tprint(a)\r\nelse:\r\n\tprint('1')\t", "import sys\r\n\r\ninput = sys.stdin.readline\r\n\r\na, b = input().strip().split()\r\n\r\nif a == b:\r\n print(a)\r\nelse:\r\n print(1)", "x,y=map(int,input().split(' '))\r\nif x==y:\r\n print(x)\r\nelse:\r\n print(1) ", "from collections import Counter\r\ndef func():\r\n x,y=map(int,input().split())\r\n if x==y:\r\n print(x)\r\n else:\r\n print('1')\r\nt=1\r\n#t=int(input())\r\nfor i in range(t):\r\n func()", "nums1, nums2 = map(int, input().split())\r\n\r\nif nums1 == nums2:\r\n print(nums1)\r\nelse:\r\n print(1)", "from math import gcd, lcm\n\n\na, b = map(int, input().split())\n\nxgcd = gcd(a, b)\nmax_ = xgcd//lcm(a, b)\nif max_ == 0:\n print(1)\n exit()\nprint(xgcd)\n", "a,b=map(int,input().split())\r\nif a==b: print(a)\r\nelse: print(1)\r\n", "\r\n#modulo GCD\r\ndef GCD(a,b):\r\n if a==b:\r\n return a\r\n else:\r\n return 1\r\n \r\n#entrada\r\na,b=[int(n) for n in input().split()]\r\nprint(GCD(a,b))\r\n", "def LI():\r\n return list(map(int, input().split(\" \")))\r\ndef LS():\r\n return input().split(\" \")\r\ndef LC():\r\n return input().split()\r\ndef I():\r\n return int(input())\r\ndef S():\r\n return input()\r\n\r\na, b = LI()\r\n\r\ndef gcd(a,b):\r\n if b==0:\r\n return a\r\n return gcd(b,a%b)\r\ng_cd= gcd(a,b)\r\nfor num in range(a+1,b):\r\n g_cd= gcd(num,num-1)\r\n if g_cd==1:\r\n break\r\nprint(g_cd)\r\n\r\n\r\n# def euclid(x, y):\r\n# if x % y == 0:\r\n# return y\r\n# return euclid(y, x%y)\r\n\r\n# x = a\r\n# for i in range(a+1, b+1):\r\n# x = euclid(i, x)\r\n\r\n# print(x)", "# @author Matheus Alves dos Santos\r\n\r\nvalues = input().split()\r\n\r\nif (values[0] == values[1]):\r\n print(values[0])\r\nelse:\r\n print(1)", "n1, n2 = map(int, input().split())\nif n1 == n2:\n print(n1)\nelse:\n print(1)\n \t\t\t\t \t \t \t\t \t \t\t \t\t\t\t\t\t \t\t\t", "a, b = map(str, input().split())\r\nif a == b: print(a)\r\nelse: print(1)", "import math\r\na,b=map(str,input().split())\r\nif a==b:\r\n print(math.gcd(int(a),int(b)))\r\nelse:\r\n print(1)", "# import sys\r\n# sys.stdin=open(\"input.in\",\"r\")\r\n# sys.stdout=open(\"output.out\",\"w\")\r\n\r\na,b=map(int,input().split())\r\nif(a==b):\r\n\tprint(a)\r\nelse:\r\n\tprint(1)\t\r\n", "n,m=map(int,input().split())\r\nprint(n if n==m else 1)", "nums = input().strip().split()\r\n\r\nif nums[0] == nums[1]:\r\n print(nums[0])\r\nelse:\r\n print(\"1\")", "s , s1 = map(str , input().split())\r\nprint(s if s == s1 else 1)\r\n", "s = input().split(\" \")\r\nif(s[0] != s[1]):\r\n print(1)\r\nelse:\r\n print(s[0])\r\n", "a,b=input().split()\r\na=int(a)\r\nb=int(b)\r\nif a<b:\r\n print(1)\r\nelse :\r\n print(a)", "a = input().split()\r\nif a[0] == a[1]:\r\n print(a[0])\r\nelse:\r\n print(1)", "a, b = input().split()\r\nif b != a:\r\n print(1)\r\nelse:\r\n print(a)", "number1, number2 = map(int, input().split())\r\n\r\nif number1 == number2:\r\n print(number1)\r\nelse:\r\n print(1)\r\n", "x, y = input().split()\nif x == y:\n print(x)\nelse:\n print(1)\n", "def GCD(Nro1,nro2):\r\n\tif(Nro1 != nro2):\r\n\t\treturn 1\r\n\telse:\r\n\t\treturn Nro1\r\n\r\na,b = [int(i) for i in input().split()]\r\nprint(GCD(a,b))\r\n" ]

[ "MOD = 10 ** 9 + 7\nn, m = input().split(' ')\nn = int(n)\nm = int(m)\nans = pow(2 * (n + 1), m, MOD)\nans = (ans * (n + 1 - m)) % MOD\nans = (ans * pow(n + 1, MOD - 2, MOD)) % MOD\nprint(ans)\n", "mod = 1000000007\r\ndef power(a, p):\r\n res = 1\r\n while p > 0:\r\n if p % 2 == 1:\r\n res = (res * a) % mod\r\n a = (a * a) % mod\r\n p //= 2\r\n return res\r\nn, m = map(int, input().split())\r\nn += 1\r\nres = (power(n * 2, m - 1)) * (n - m) * 2\r\nprint((res % mod)) \r\n", "n,m=[int(i) for i in input().split()]\r\nprint(pow(2*n+2,m-1,1000000007)*2*(n+1-m)%1000000007)\r\n" ]

[ "import heapq\nimport sys\n\nlim = 1000\n\na = int(input())\n\ndef gen_pow():\n ans = {}\n pw_x = 1\n x = 0\n while pw_x <= a:\n ans[pw_x] = x\n pw_x *= 12\n x += 1\n return ans\n\npow_map = gen_pow()\n\nyear_list = set()\n \nfor pw_x, x in pow_map.items():\n pw_y = a - pw_x\n if pw_y not in pow_map:\n continue\n y = pow_map[pw_y]\n year_list.add(x + y)\n \nif len(year_list) == 0:\n print('NO')\n sys.exit(0)\n\nprint('YES')\n\ndef elm(x, y):\n return (12 ** x + 12 ** y, x, y)\n\nh = []\nfor year in year_list:\n y = year // 2\n x = year - y\n h.append(elm(x, y))\nheapq.heapify(h)\n \nvariants = set()\nwhile len(h) and len(variants) < lim:\n (v, x, y) = heapq.heappop(h)\n if v != a:\n variants.add(v)\n if y == 0:\n continue\n new_elm = elm(x + 1, y - 1)\n heapq.heappush(h, new_elm)\n \n\nk = min(len(year_list), lim)\nprint(k)\nprint(*sorted(map(lambda x: x + 1, year_list))[:k])\nprint(len(variants))\nprint(*sorted(variants), sep='\\n')\n", "from fractions import Fraction\r\nimport sys\r\n\r\ndef calculate_powers(limit):\r\n powers = [1]\r\n current_power = 1\r\n for _ in range(limit):\r\n current_power *= 12\r\n powers.append(current_power)\r\n return powers\r\n\r\ndef find_possible_sums(powers, target_sum):\r\n results = []\r\n for i in range(len(powers)):\r\n for j in range(i + 1):\r\n if powers[j] + powers[i - j] == target_sum:\r\n results.append(i + 1)\r\n break\r\n return results\r\n\r\ndef find_distinct_sums(powers, result_indices, target_sum):\r\n distinct_sums = set()\r\n for i in result_indices:\r\n for j in range(i):\r\n current_sum = powers[j] + powers[i - 1 - j]\r\n if current_sum != target_sum:\r\n distinct_sums.add(current_sum)\r\n return distinct_sums\r\n\r\ndef main():\r\n sys.setrecursionlimit(1000 * 100)\r\n A = int(input())\r\n \r\n powers = calculate_powers(600)\r\n \r\n result_indices = find_possible_sums(powers, A)\r\n \r\n distinct_sums = find_distinct_sums(powers, result_indices, A)\r\n \r\n if len(result_indices) == 0:\r\n print('NO')\r\n else:\r\n print('YES')\r\n print(min(len(result_indices), 1000))\r\n print(' '.join(map(str, result_indices[:1000])))\r\n print(min(len(distinct_sums), 1000))\r\n if len(distinct_sums) > 0:\r\n print(' '.join(map(str, sorted(distinct_sums)[:1000])))\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "A=int(input())\r\nres=[]\r\nfor i in range(300):\r\n for j in range(300):\r\n if(pow(12,i)+pow(12,j)==A):\r\n res.append([i,j])\r\nif(len(res)==0):\r\n print(\"NO\")\r\n quit()\r\nprint(\"YES\")\r\nprint(1)\r\nsm=sum(res[0])\r\nprint(sm+1)\r\nprint(sm//2)\r\nfor i in range(sm//2,-1,-1):\r\n V=pow(12,i)+pow(12,sm-i)\r\n if(V!=A):\r\n print(V)\r\n", "A = int(input())\r\n\r\npw = 0\r\n\r\nwhile A % 12 == 0 :\r\n A //= 12\r\n pw += 1\r\n\r\nx, y = 2, 13\r\np = 1\r\n\r\npos = -1\r\n\r\nwhile x <= A :\r\n if x == A :\r\n pos = p\r\n x, y = y, 13 * y - 12 * x\r\n p += 1\r\n\r\nif pos == -1 :\r\n print('NO')\r\n exit()\r\n\r\nprint('YES')\r\nprint(1)\r\nprint(pos + 2 * pw)\r\n\r\nx, y = 2, 13\r\np = 1\r\n\r\noth = []\r\n\r\nwhile p <= pos + 2 * pw :\r\n if (pos - p) % 2 == 0 and pos != p :\r\n oth.append(x * 12 ** ((pos + 2 * pw - p) // 2))\r\n x, y = y, 13 * y - 12 * x\r\n p += 1\r\nprint(len(oth))\r\nprint(' '.join(map(str, oth)))", "a = int(input())\r\nans = set()\r\ndef work(i, z, y):\r\n z.add(y)\r\n # print(\">>\", i, y)\r\n if y == a:\r\n ans.add(i)\r\n if len(z) > 1000:\r\n z.remove(max(z))\r\n\r\npos = [set(), set([2])]\r\nfor i in range(2):\r\n for x in pos[i]:\r\n if x == a:\r\n ans.add(i)\r\n\r\ndef dfs(i, last, cur):\r\n if i > 988:\r\n return\r\n while len(pos) - 1 < i:\r\n pos.append(set())\r\n if len(pos[i]) == 0 and cur > a:\r\n return\r\n if cur in pos[i]:\r\n return\r\n work(i, pos[i], cur)\r\n dfs(i + 1, cur, last * 12)\r\n dfs(i + 1, cur, cur * 13 - last * 12)\r\n\r\ndfs(2, 2, 13)\r\n\r\nif len(ans) == 0:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n count = 0\r\n print(min(1000, len(ans)))\r\n z = set()\r\n for i in sorted(ans):\r\n if count < 1000:\r\n print(i)\r\n count += 1\r\n for y in pos[i]:\r\n if y != a:\r\n z.add(y)\r\n if len(z) > 1000:\r\n z.remove(max(z))\r\n count = 0\r\n print(min(1000, len(z)))\r\n for i in sorted(z):\r\n print(i)\r\n count += 1\r\n if count >= 1000:\r\n break" ]

[ "from sys import stdin, stdout\ndef read():\n\treturn stdin.readline().rstrip()\n\ndef read_int():\n\treturn int(read())\n\ndef read_ints():\n\treturn list(map(int, read().split()))\n\ndef solve():\n\ta=read()\n\tc=0\n\tif a[0]=='a' or a[0]=='h':\n\t\tc+=1\n\tif a[1]=='1' or a[1]=='8':\n\t\tc+=1\n\tif c==0:\n\t\tprint(8)\n\telif c==1:\n\t\tprint(5)\n\telse:\n\t\tprint(3)\n\nsolve()\n", "s=input()\nif s in {\"a8\", \"a1\", \"h1\", \"h8\"}:\n\tprint(3)\nelif s[0] in {'a', 'h'} or s[1] in {'1', '8'}:\n\tprint(5)\nelse:\n\tprint(8)\n", "n=list(input())\r\nl=[\"a\",\"h\",\"1\",\"8\"]\r\nif(n[0] in l or n[1] in l):\r\n\tif(n[0] in l and n[1] in l):\r\n\t\tprint(3)\r\n\telse:\r\n\t\tprint(5)\r\nelse:\r\n\tprint(8)", "s = input()\r\nc = s[0]\r\nr = s[1]\r\ntotal = 8\r\nif c in 'ah' and r in '18':\r\n total -= 5\r\nelif c in 'ah':\r\n total -=3\r\nelif r in '18':\r\n total -=3\r\nprint (total)", "s=str(input())\r\na=s[0]\r\nb=s[1]\r\nif s==\"a8\" or s==\"a1\" or s==\"h1\" or s==\"h8\":\r\n print(3)\r\nelif a=='a' or a=='h' or b=='1' or b=='8':\r\n print(5)\r\nelse:\r\n print(8)", "c = input()\r\nif \"a8\" == c or \"a1\" == c or \"h8\" == c or \"h1\" == c:\r\n print(3)\r\nelif \"a\" in c or \"1\" in c or \"8\" in c or \"h\" in c:\r\n print(5)\r\nelse:\r\n print(8)", "cd = input().strip()\nc = cd[0]\nd = cd[1]\nans = 0\nif c == 'a' or c == 'h':\n ans += 1\nif d == '1' or d == '8':\n ans += 1\nif ans == 2:\n print(3)\nelif ans == 1:\n print(5)\nelse:\n print(8)\n", "wight, height = input()\r\nhod = [[-1, -1], [0, -1], [1, -1], [1, 0] , [-1, 0], [1, 1], [0, 1], [-1, 1] ] #1,a\r\nstring_b = 'abcdefgh'\r\nstring_n = '12345678'\r\nind_height = int(height) - 1\r\nind_wight = string_b.index(wight)\r\nans = 0\r\nfor i in range(8):\r\n try:\r\n now_hod = hod[i]\r\n if ind_height + now_hod[0] < 0 or ind_wight + now_hod[1] < 0:\r\n continue\r\n el = [string_n[ind_height + now_hod[0]], string_b[ind_wight + now_hod[1]]]\r\n ans += 1\r\n except IndexError:\r\n pass\r\nprint(ans)\r\n", "x, y = input()\nn = 8\nif x in ('a', 'h'):\n n -= 3\nif y in ('1', '8'):\n n -= 3\nif (x, y) in (('a', '8'), ('a', '1'), ('h', '8'), ('h', '1')):\n n += 1\nprint(n)\n\t \t\t \t\t \t\t\t \t\t\t", "s=input()\r\nx=(ord(s[0])-97)%7\r\ny=(int(s[1])-1)%7\r\nprint(8-3*(x*y==0)-2*(x+y==0))\r\n", "def main():\r\n c, d = input()\r\n ans = 0\r\n if c > 'a' and c < 'h' and d > '1' and d < '8':\r\n ans = 8\r\n elif c > 'a' and c < 'h' and (d == '1' or d == '8'):\r\n ans = 5\r\n elif (c == 'a' or c == 'h') and d > '1' and d < '8':\r\n ans = 5\r\n elif (c == 'a' or c == 'h') and (d == '1' or d == '8'):\r\n ans = 3\r\n\r\n print(ans)\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "s = input()\r\nans = 5\r\nif s[0] in 'ah' and s[1] in '18':\r\n ans = 3\r\nif s[0] not in 'ah' and s[1] not in '18':\r\n ans = 8\r\n\r\nprint(ans)\r\n", "t = input()\r\ncol = t[0]\r\nrow = int(t[1])\r\n\r\nu = row == 8\r\nd = row == 1\r\nr = col == \"h\"\r\nl = col == \"a\"\r\n\r\na1 = l or u\r\n\r\na3 = u or r\r\n\r\na5 = r or d\r\n\r\na7 = d or l\r\n\r\nsum = 8 - a1-a3-a5-a7-u-d-r-l\r\n\r\nprint(sum)", "#!/usr/bin/python\r\n# -*- coding: utf-8 -*-\r\n\r\nb = input()\r\nif b == \"h1\" or b == \"h8\" or b == \"a1\" or b == \"a8\":\r\n print(\"3\")\r\nelif b[0] in ['b', 'c', 'd', 'e', 'f', 'g'] and 2 <= int(b[1]) <= 7:\r\n print(\"8\")\r\nelse:\r\n print(\"5\")", "a = list(input())\r\nx = False\r\ny = False\r\n\r\nif a[0] == 'a' or a[0]=='h':\r\n x = True\r\nif a[1] == '1' or a[1] == '8':\r\n y = True\r\n\r\nif x and y:\r\n ans = 3\r\nelif x or y:\r\n ans = 5\r\nelse:\r\n ans = 8\r\nprint(ans)", "s=input()\r\nc=s[0]\r\nn=int(s[1])\r\n\r\nif (n==1 or n==8) and (c==\"a\" or c==\"h\"):\r\n print(3)\r\nelif (n==1 or n==8) and (c!=\"a\" or c!=\"h\"):\r\n print(5)\r\nelif (n!=1 or n!=8) and (c==\"a\" or c==\"h\"):\r\n print(5)\r\nelse:\r\n print(8)", "s = input()\r\nans = 8\r\n\r\nif s[0] == 'a' or s[0] == 'h':\r\n if s[1] == '1' or s[1] == '8':\r\n ans -= 2\r\n ans -= 3\r\nelse:\r\n if s[1] == '1' or s[1] == '8':\r\n ans -= 3\r\n\r\nprint(ans)", "from sys import stdin\n\ncoord = stdin.readline()\nposs = [1 for i in range(8)]\nif coord[0] == 'h':\n poss[4], poss[5], poss[6] = 0, 0, 0\nelif coord[0] == 'a':\n poss[0], poss[1], poss[2] = 0, 0, 0\nif coord[1] == '8':\n poss[2], poss[3], poss[4] = 0, 0, 0\nelif coord[1] == '1':\n poss[6], poss[7], poss[0] = 0, 0, 0\nsum = 0\nfor i in range(len(poss)):\n if poss[i] == 1:\n sum += 1\n\nprint(sum)", "s = input()\r\nif s == 'a1' or s == 'a8' or s == 'h1' or s == 'h8':\r\n print(3)\r\nelif ((s[1] == '1' or s[1] == '8') and (s[0] != 'a' and s[0] != 'h') or (s[0] == 'a' or s[0] == 'h') and s[1] != '1' and s[1] != '8'):\r\n print(5)\r\nelse:\r\n print(8)", "n=input()\r\nV=False\r\nH=False\r\nif n[0]==\"a\" or n[0]==\"h\":\r\n V=True\r\nif n[1]==\"1\" or n[1]==\"8\":\r\n H=True\r\nif V and H:\r\n print(3)\r\nelif V or H:\r\n print(5)\r\nelse:\r\n print(8)", "s=input()\r\nc=s[0]\r\nr=int(s[-1])\r\nif c==\"a\" or c==\"h\":\r\n if r==1 or r==8:\r\n print(3)\r\n else :\r\n print(5)\r\nelse :\r\n if r==1 or r==8:\r\n print(5)\r\n else :\r\n print(8)", "n = str(input())\r\n\r\nif(n==\"a1\" or n==\"a8\" or n==\"h1\" or n==\"h8\"):\r\n print(3)\r\nelif n[0]== \"a\" or n[0]==\"h\" or n[1]==\"1\" or n[1]==\"8\" :\r\n print(5)\r\nelse:\r\n print(8)\r\n\r\n\r\n \r\n", "pos = input()\nc, d = pos[0], pos[1]\n\ndef move_numbers(c, d) :\n moves = 8\n if ( c == 'a' or c == 'h' ) and ( d == '1' or d == '8' ) :\n moves = 3\n elif ( c == 'a' or c == 'h' ) and ( d != '1' and d != '8' ) :\n moves = 5\n elif ( d == '1' or d == '8' ) :\n moves = 5\n\n return moves\n\nout = move_numbers(c, d)\nprint(out)\n", "s=input()\r\na=s[0]\r\nn=int(s[1])\r\nc=8\r\nif a==\"h\" or a==\"a\":\r\n\tc-=3\r\nif n==1 or n==8:\r\n\tc-=3\r\nif (a==\"h\" or a==\"a\") and (n==1 or n==8):\r\n\tc+=1\r\nprint(c)", "# Hydro submission #64d5efdd38608da1af95fabe@1691742173799\na, b = input()\r\nb = int(b)\r\nif a == \"a\" and b == 8 or a == \"a\" and b == 1 or a == \"h\" and b == 8 or a == \"h\" and b == 1:\r\n\tprint(\"3\")\r\nelif a == \"a\"or a == \"h\" or b == 1 or b == 8:\r\n\tprint(\"5\")\r\nelse:\r\n\tprint(\"8\")", "n = input()\r\nif 2<=int(n[1])<=7 and 'b'<=n[0]<='g':\r\n print(8)\r\nelif (int(n[1])==1 or int(n[1]) ==8) and (n[0]=='a' or n[0] =='h'):\r\n print(3)\r\nelse:\r\n print(5)", "bean = input()\r\nif bean == \"h2\" or bean == \"h3\" or bean == \"h4\" or bean == \"h5\" or bean == \"h6\" or bean == \"h7\" or bean == \"a2\" or bean == \"a3\" or bean == \"a4\" or bean == \"a5\" or bean == \"a6\" or bean == \"a7\" or bean == \"b8\" or bean == \"c8\" or bean == \"d8\" or bean == \"e8\" or bean == \"f8\" or bean == \"g8\" or bean == \"b1\" or bean == \"c1\" or bean == \"d1\" or bean == \"e1\" or bean == \"f1\" or bean == \"g1\":\r\n print(\"5\")\r\nelif bean == \"a8\" or bean == \"h8\" or bean == \"a1\" or bean == \"h1\":\r\n print(\"3\")\r\nelse: \r\n print(\"8\")", "c,r = list(input())\r\nc = ord(c)-ord('a')+1\r\nr = int(r)\r\nif (r==1 or 9-r==1) and (c==1 or 9-c==1):\r\n print(3)\r\nelif r==1 or 9-r==1 or (c==1 or 9-c==1):\r\n print(5)\r\nelse:\r\n print(8)\r\n", "a = str(input())\r\nif (a[1] == '8'or a[1] == '1') and (a[0] == 'a' or a[0] == 'h'):\r\n print(3)\r\nelif a[0] == 'a' or a[0] == 'h'or a[1] == '1' or a[1] == '8':\r\n print(5)\r\nelse:\r\n print(8)\r\n", "x=input()\r\nprint(3 if x in ['a8','a1','h8','h1'] else 5 if x[0] in ['a','h'] or x[1] in ['8','1'] else 8)", "[c, d] = input()\nc = ord(c) - 96\nd = int(d)\nm = 8\nif c == 1 or c == 8: m-=3\nif d == 1 or d == 8: m-=3\nif m == 2: m+=1\nprint(m)\n \t\t\t\t\t\t\t \t \t\t \t\t\t\t\t\t", "import sys\r\ninput = sys.stdin.readline\r\n\r\nx = list(input().rstrip())\r\nc = 0\r\nif x[0] == \"a\" or x[0] == \"h\":\r\n c += 1\r\nif x[1] == \"1\" or x[1] == \"8\":\r\n c += 1\r\nif c == 0:\r\n ans = 8\r\nelif c == 1:\r\n ans = 5\r\nelse:\r\n ans = 3\r\nprint(ans)", "s = input()\r\nn = ord(s[0])-96\r\nm = int(s[1])\r\n\r\n\r\nif (n==1 or n==8) and (m>1 and m<8):\r\n print(5) \r\nelif (n==1 or n==8) and (m==1 or m==8):\r\n print(3)\r\nelif (n>1 and n<8) and (m==1 or m==8):\r\n print(5) \r\nelse:\r\n print(8)", "s=input()\nc,d=ord(s[0])-96,int(s[1])\ni=0\nfor x in range(-1,2):\n for y in range(-1,2):\n if x!=0 or y!=0:\n if 1<= c+x <= 8 and 1 <= d+y<=8:i+=1\nprint(i)", "n = input()\r\nif n[0] in ['a', 'h'] and n[1] in ['1', '8']:\r\n exit(print(3))\r\nif n[0] in ['h', 'a'] or n[1] in ['1', '8']:\r\n exit(print(5))\r\nprint(8)\r\n", "'''Author: Abdurasul !!!'''\r\na=list(input())\r\nk=a[0]\r\nk1=int(a[1])\r\nif k=='a' and k1==8:print(3)\r\nelif k=='a' and k1==1:print(3)\r\nelif k=='h' and k1==8:print(3)\r\nelif k=='h' and k1==1:print(3)\r\nelif k=='a' or k=='h' or k1==8 or k1==1:print(5)\r\nelse:print(8)\r\n", "s = str(input())\r\nex = ['a8', 'a1', 'h8', 'h1']\r\nans = 8\r\nif s[0]=='a' or s[0]=='h':\r\n ans = ans-3\r\nif s[1]== '1' or s[1]=='8':\r\n ans = ans-3\r\nif s in ex:\r\n ans = 3\r\nprint(ans)", "s = input()\r\nc = s[0];n = int(s[1])\r\nif((n==1 or n==8) and (c=='a' or c=='h')) :\r\n print(3)\r\nelif((n>=2 and n<=7) and (c!='a' and c!='h')):\r\n print(8)\r\nelse :\r\n print(5)\r\n \r\n \r\n\r\n \r\n ", "c, d = list(input())\r\nd = int(d)\r\n\r\nif (2 <= d <= 7 and c in ['b', 'c', 'd', 'e', 'f', 'g']):\r\n print(8)\r\nelif (c + str(d) in ['a1', 'h1', 'a8', 'h8']):\r\n print(3)\r\nelse:\r\n print(5)\r\n", "leter = {\"a\":0, \"b\":1, \"c\":2, \"d\":3, \"e\":4, \"f\":5, \"g\":6, \"h\":7}\r\ncords = input()\r\nx = leter[cords[0]]\r\ny = int(cords[1]) - 1\r\nne = 1 \r\nnw = 1 \r\nse = 1 \r\nsw = 1 \r\ns = 1 \r\nn = 1 \r\ne = 1 \r\nw = 1\r\nif x == 7:\r\n e = 0\r\n ne = 0\r\n se=0\r\nif y == 7:\r\n n = 0\r\n ne = 0\r\n nw=0\r\nif x == 0:\r\n w = 0\r\n nw = 0\r\n sw=0\r\nif y == 0:\r\n s = 0\r\n se = 0\r\n sw=0\r\nprint(se+sw+ne+nw+s+n+w+e)", "pos = str(input())\r\nif pos == 'a1' or pos == 'h1' or pos == 'a8' or pos == 'h8':\r\n print(3)\r\nelif pos[0] == 'a' or pos[0] == 'h' or pos[1] == '1' or pos[1] == '8':\r\n print(5)\r\nelse:\r\n print(8)\r\n", "pos = input()\ncol = ord(pos[0])-ord('a')\nrow = int(pos[1])-1\ndc = [-1, 0, 1, 1, 1, 0, -1, -1]\ndr = [1, 1, 1, 0, -1, -1, -1, 0]\nres = 0\nfor i in range(8):\n if col+dc[i] >= 0 and col+dc[i] <= 7 and \\\n row+dr[i] >= 0 and row+dr[i] <= 7:\n res += 1\nprint(res)\n", "s=input()\r\nif((s[1]=='1') or (s[1]=='8')):\r\n if(s[0]=='a' or s[0]=='h'):\r\n print(3)\r\n else:\r\n print(5)\r\nelse:\r\n if((s[0]=='a') or (s[0]=='h')):\r\n print(5)\r\n else:\r\n print(8)\r\n", "xy = input()\r\nx, y = xy[0], xy[1]\r\n\r\nif x in 'ah' and y in '18': print(3)\r\nelif x in 'ah' or y in '18': print(5)\r\nelse: print(8)", "s = input()\r\nc,d = list(s)\r\nif s == 'a1' or s == 'h1' or s == 'a8' or s == 'h8':\r\n print(3)\r\nelif c == 'a' or c == 'h' or d == '1' or d == '8':\r\n print(5)\r\nelse:\r\n print(8)", "val = list(input())\nletter = val[0]\nnumber = int(val[1])\nresult = 8\nif(letter == \"a\" or letter == \"h\"):\n result -= 3\nif(number == 1 or number == 8):\n result -= 3\n\nif(letter == \"a\" and number == 8):\n result += 1\nif(letter == \"h\" and number == 8):\n result += 1\nif(letter == \"a\" and number == 1):\n result += 1\nif(letter == \"h\" and number == 1):\n result += 1\n\nprint(result)\n \t\t \t \t \t\t\t\t \t\t\t", "string = input()\nx = string[0]\ni = int(string[1])\n\nif (x == 'a' and (i == 8 or i == 1)) or (x == 'h' and (i == 8 or i == 1)):\n print(3)\nelif x == 'a' or x == 'h' or i == 1 or i == 8:\n print(5)\nelse:\n print(8)\n\n", "pos=input()\r\nc=pos[0]\r\nr=pos[1]\r\nif(c in 'bcdefg' and r in '234567'):\r\n print(8)\r\nelif(c in 'ah' and r in '18'):\r\n print(3)\r\nelse:\r\n print(5)", "n=input()\r\n\r\nif n in ['a1','a8','h1','h8']:\r\n print('3')\r\nelif n[0] in ['a','h'] or n[1] in ['1','8']:\r\n print('5')\r\nelse:\r\n print('8')\r\n\r\n", "s = input()\r\n\r\nc = s[0]\r\nr = s[1]\r\n\r\ncor = [\r\n 'a8',\r\n 'h8',\r\n 'a1',\r\n 'h1'\r\n]\r\n\r\nif s in cor:\r\n print(3)\r\nelif c=='a' or c=='h':\r\n print(5)\r\nelif r=='1' or r=='8':\r\n print(5)\r\nelse:\r\n print(8)", "# Time Complexity: O(1)\n# Space Complexity: O(1)\n# The program checks if the King is at the borders or corners.\nx = input().strip()\nc, d = x[0], int(x[1])\nans = 8\na, b = False, False\nif d == 1 or d == 8:\n ans -= 3\n a = True\nif c == 'a' or c == 'h':\n ans -= 3\n b = True\nif a and b:\n ans += 1\nprint(ans)\n \t\t\t\t \t \t \t\t \t \t \t\t \t \t\t", "a = input()\r\nif a == \"h1\" or a == \"h8\" or a == \"a1\" or a == \"a8\":\r\n print(3)\r\nelif \"h\" in a or \"a\" in a or \"1\" in a or \"8\" in a:\r\n print(5)\r\nelse:\r\n print(8)", "s=input()\r\ns.split()\r\n\r\nlist=['2','3','4','5','6','7']\r\n\r\nif s[1]=='1' or s[1]=='8':\r\n if s[0]=='a' or s[0]=='h':\r\n print(3)\r\n else:\r\n print(5)\r\n\r\n\r\n\r\nelif s[1] in list and (s[0]=='a' or s[0]=='h'):\r\n print(5)\r\n\r\nelse:\r\n print(8)\r\n", "com2=input()\r\ncom=[]\r\nfor i in com2:\r\n com.append(i)\r\nif com[0]=='a' and (com[1]=='1' or com[1]=='8'):\r\n print(3)\r\nelif com[0]=='h' and (com[1]=='1' or com[1]=='8'):\r\n print(3)\r\nelif com[0]=='a' and (int(com[1])>1 and int(com[1])<8):\r\n print(5)\r\nelif com[1]=='1' or com[1]=='8':\r\n print(5) \r\nelif com[0]=='h' and (int(com[1])>1 and int(com[1])<8):\r\n print(5)\r\nelse:\r\n print(8)", "n,cnt=input(),0\nnmoves=[8,5,3,5]\nif n[0]=='a' or n[0]=='h':cnt+=1;\nif n[1]=='1' or n[1]=='8':cnt+=1;\nprint(nmoves[cnt])", "move=input()\n\nif move[0] == 'a' or move[0] == 'h':\n if move[1] == '8' or move[1] == '1':\n print(3)\n else:\n print(5)\nelse:\n if move[1] == '8' or move[1] == '1':\n print(5)\n else:\n print(8)\n\n", "def solve(i, j):\n if 0 < i < 7 and 0 < j < 7:\n return 8\n if (i in (0, 7)) is not (j in (0, 7)):\n return 5\n return 3\n\n\nif __name__ == '__main__':\n (i, j) = input()\n i, j = ord(i)-ord('a'), int(j)-1\n print(solve(i, j))\n", "s = input()\r\n\r\nletter = \"\"\r\nif s[0] in \"ah\":\r\n if s[1] not in \"18\":\r\n print(5)\r\n \r\n else:\r\n print(3)\r\n \r\nelif s[1] in \"18\":\r\n if s[0] not in \"ah\":\r\n print(5)\r\n \r\n else:\r\n print(3)\r\n \r\nelse:\r\n print(8) ", "k=input()\r\nmove=0\r\nif (k[0]=='a' and k[1]=='1') or (k[0]=='a' and k[1]=='8') or (k[0]=='h' and k[1]=='1') or (k[0]=='h' and k[1]=='8'):\r\n move=3\r\nelif 'a'<k[0]<'h' and 1<int(k[1])<8:\r\n move=8\r\nelse:\r\n move = 5\r\nprint(move)", "c = ['a','b','c','d','e','f','g','h']\nposition = input()\np1 = c.index(position[0])+1\np2 = int(position[1])\nmaxmov = [8,5,3]\ni = 0\nif p1 == 8 or p1 == 1:\n i= i + 1\nif p2 == 1 or p2 == 8:\n i= i + 1\nprint(maxmov[i])\n\t\t \t\t\t\t \t \t \t\t\t \t \t \t\t\t\t \t", "print([8,5,3][sum(c in'ah18'for c in input())])\r\n", "cd = input()\n\nif cd[0] == 'a' or cd[0] == 'h':\n\tif cd[1] == '1' or cd[1] == '8':\n\t\tprint(\"3\")\n\telse:\n\t\tprint(\"5\")\nelse:\n\tif cd[1] == '1' or cd[1] == '8':\n\t\tprint(\"5\")\n\telse:\n\t\tprint(\"8\")", "a = input()\nif a[0] in 'ah' and a[1] in '18':\n ans = 3\nelif a[0] in 'ah' or a[1] in '18':\n ans = 5\nelse: ans = 8\nprint(ans)", "k=input()\nmove=0\n# w={'a':2,'b':6,'c':6,'d':6,'e':6,'f':6,'g':6,'h':2}\n# n={1:2,2:6,3:6,4:6,5:6,6:6,7:6,8:2}\n# move=w[k[0]] + n[int(k[1])]\nif (k[0]=='a' and k[1]=='1') or (k[0]=='a' and k[1]=='8') or (k[0]=='h' and k[1]=='1') or (k[0]=='h' and k[1]=='8'):\n move=3\nelif 'a'<k[0]<'h' and 1<int(k[1])<8:\n move=8\nelse:\n move = 5\nprint(move)\n \t \t\t\t \t\t \t\t\t\t\t\t\t\t \t", "s=input()\r\na=s[0]\r\nb=s[1]\r\nb=int(b)\r\nif b in [2,3,4,5,6,7] and a in \"bcdefg\":\r\n print(8)\r\n exit()\r\nif a==\"a\":\r\n if b==1 or b==8:\r\n print(3)\r\n exit()\r\n else:\r\n print(5)\r\n exit()\r\nif b==1:\r\n if a==\"a\" or a==\"h\":\r\n print(3)\r\n exit()\r\n else:\r\n print(5)\r\n exit()\r\nif a==\"h\":\r\n if b==1 or b==8:\r\n print(3)\r\n exit()\r\n else:\r\n print(5)\r\n exit()\r\nif b==8:\r\n if a==\"a\" or a==\"h\":\r\n print(3)\r\n exit()\r\n else:\r\n print(5)\r\n exit()", "m=input()\r\nif((m[0]=='a' or m[0]=='h')and (m[1]=='1' or m[1]=='8')):\r\n print(3)\r\nelif(m[0]=='a' or m[0]=='h' or m[1]=='1' or m[1]=='8'):\r\n print(5)\r\nelse:\r\n print(8)", "s = input().split()[0]\r\nch = s[0]\r\nnum = s[1]\r\nif ch != 'a' and ch != 'h':\r\n if num != '1' and num != '8':\r\n print (8)\r\n else:\r\n print (5)\r\nelse:\r\n if num != '1' and num != '8':\r\n print (5)\r\n else:\r\n print (3)", "ch=input()\r\nx=8\r\nif ch[0]=='a' or ch[0]=='h':\r\n if ch[1]=='1' or ch[1]=='8':\r\n x-=5\r\n else:\r\n x-=3\r\nelif ch[1]=='1' or ch[1]=='8':\r\n x-=3\r\nprint(x)\r\n \r\n\r\n \r\n\r\n \r\n \r\n \r\n \r\n \r\n \r\n", "a,b=input()\nn=8\nif b in ('1','8'):n-=3\nif a in ('a', 'h'):n-=3\nif (a,b) in (('a','8'),('a','1'),('h','8'),('h','1')):n+=1\nprint(n)", "#A. King Moves--do case\r\nk= input() \r\nif k==\"a1\" or k==\"a8\" or k==\"h8\" or k==\"h1\":\r\n print(3)\r\nelif k[0] in \"ah\" or k[1] in \"18\":\r\n print(5)\r\nelse: \r\n print(8)", "a=input()\r\nb=int(a[1])\r\na=a[0]\r\nif (a=='h' or a=='a') and (b==1 or b==8):\r\n print('3')\r\nelif a=='h' or a=='a' or b==1 or b==8:\r\n print('5')\r\nelse:\r\n print('8')", "s=input()\r\na=s[0]\r\nb=s[1]\r\nif a in ['a','h'] and b in ['1','8']:\r\n print(3)\r\nelif a in ['a','h'] or b in ['1','8']:\r\n print(5)\r\nelse:\r\n print(8)", "k = input()\n\nif k[0] in ['a', 'h'] and k[1] in ['1', '8']:\n print(\"3\")\nelif k[0] in ['a', 'h'] or k[1] in ['1', '8']:\n print(\"5\")\nelse:\n print(\"8\")\n", "x=list(input())\r\nif (x[0]=='a' and x[1]=='1') or (x[0]=='a' and x[1]=='8') or (x[0]=='h' and x[1]=='1') or (x[0]=='h' and x[1]=='8'):\r\n print(3)\r\nelif (x[0]=='a' and x[1]!='1') or (x[0]!='a' and x[1]=='1') or (x[0]=='h' and x[1]!='1') or (x[0]!='h' and x[1]=='8'):\r\n print(5)\r\nelse:\r\n print(8)", "c, d = input()\r\n\r\nif c in 'ah':\r\n print(3 if d in '18' else 5)\r\nelse:\r\n print(5 if d in '18' else 8)", "x=input()\r\nif (x[0] in ['a','h']) and (x[1]=='1' or x[1]=='8'):\r\n print(3)\r\nelif (x[0] in ['a','h']) and (x[1] not in ['1','8']):\r\n print(5)\r\nelif (x[0] in ['b','c','d','e','f','g','h']) and (x[1]=='1' or x[1]=='8'):\r\n print(5)\r\nelse:\r\n print(8)\r\n", "# LUOGU_RID: 127787291\na = str(input())\r\nb = a[1]\r\na = a[0]\r\nif (a == 'a' and b == '8') or (a == 'h' and b == '8') or (a == 'a' and b == '1') or (a == 'h' and b == '1'):\r\n print(3)\r\nelif a == 'a' or a == 'h' or b == '1' or b == '8':\r\n print(5)\r\nelse:\r\n print(8)", "p=input()\r\nif p==\"h1\" or p==\"h8\" or p==\"a1\" or p==\"a8\":\r\n\tprint(3)\r\nelse:\r\n\tif p[0]==\"a\" or p[0]==\"h\" or p[1]==\"1\" or p[1]==\"8\":\r\n\t\tprint(5)\r\n\telse:\r\n\t\tprint(8)", "s=input()\r\na,b=s[0],int(s[1])\r\nif a in ['h','a'] and b in [1,8]:\r\n\tprint(3)\r\nelif (a not in ['h','a'] and b in [1,8]) or (a in ['h','a'] and b not in ['1','8']):\r\n\tprint(5)\r\nelse:\r\n\tprint(8)", "s = input()\r\nif s in \"a1a8h1h8\":\r\n print(3)\r\nelif s[0] in \"ah\" or s[1] in \"18\":\r\n print(5)\r\nelse:\r\n print(8)\r\n", "s = input()\r\nltr,num = s[0],int(s[1])\r\nres=8\r\nif ltr==\"a\" or ltr==\"h\":\r\n res-=3\r\nif num==1 or num==8:\r\n res-=3\r\nprint(max(3,res))\r\n", "s=input()\r\na=s[0]\r\nb=s[1]\r\nif a=='a' or a=='h':\r\n if b=='1' or b=='8':\r\n print(3)\r\n else:\r\n print(5)\r\nelse:\r\n if b=='1' or b=='8':\r\n print(5)\r\n else:\r\n print(8)\r\n", "x=input()\r\nif x=='a8' or x=='a1' or x=='h1' or x=='h8':\r\n print(3)\r\nelif 'a'in x or '1'in x or '8'in x or 'h'in x:\r\n print(5)\r\nelse:\r\n print(8)", "s=input()\r\nc=['b','c','d','e','f','g']\r\nn=['2','3','4','5','6','7']\r\nif s[0] in c and s[1] in n:\r\n print(8)\r\nelif s[0] in c or s[1] in n:\r\n print(5)\r\nelse:\r\n print(3)", "# King Moves\n[c,d] = input()\nif 'b' <= c <= 'g' and '2' <= d <= '7':\n print(8)\nelif 'b' <= c <= 'g' or '2' <= d <= '7':\n print(5)\nelse:\n print(3)\n", "S=input()\r\nx=S[0]\r\ny=S[1]\r\nif((x=='a' and y=='1') or (x=='h' and y=='1') or (x=='h' and y=='8') or (x=='a' and y=='8')):\r\n print(\"3\")\r\nelif((x=='a') or (x=='h') or (y=='1') or (y=='8')):\r\n print(\"5\")\r\nelse:\r\n print(\"8\")\r\n \r\n", "k = input()\r\nr, c = k\r\nif r == 'a' or r == 'h':\r\n if c == '8' or c == '1':\r\n print(3)\r\n else:\r\n print(5)\r\nelse:\r\n if c == '8' or c == '1':\r\n print(5)\r\n else:\r\n print(8)", "pos = input()\r\ncol = ord(pos[0]) - ord('a')\r\nrow = int(pos[1]) - 1\r\ncount = 0\r\nfor i in range(-1, 2):\r\n for j in range(-1, 2):\r\n if i == 0 and j == 0:\r\n continue\r\n new_col = col + j\r\n new_row = row + i\r\n if new_col < 0 or new_col > 7 or new_row < 0 or new_row > 7:\r\n continue\r\n count += 1\r\nprint(count)", "pos_king= input()\r\ncol= pos_king[0]\r\nfil= int(pos_king[1])\r\nmoves=0\r\n\r\nif fil==8 or fil==1:\r\n if col==\"a\" or col==\"h\":\r\n moves=3\r\n else:\r\n moves=5\r\nelif 1<fil<8:\r\n if col==\"a\" or col==\"h\":\r\n moves=5\r\n else:\r\n moves=8\r\nprint(moves)\r\n", "tab={'a':1,'b':2,'c':3,'d':4,'e':5,'f':6,'g':7,'h':8}\r\nans=list(input())\r\na=tab[ans[0]]\r\nb=int(ans[1])\r\nif(tab[ans[0]]>=2 and tab[ans[0]]<=7 and int(ans[1])>=2 and int(ans[1])<=7):\r\n print(8)\r\nelif((a==1 and (b==8 or b==1)) or (a==8 and (b==8 or b==1))):\r\n print(3)\r\nelse:\r\n print(5)\r\n\r\n", "pos = input().strip() \r\ncol = ord(pos[0]) - ord('a') + 1 \r\nrow = int(pos[1]) \r\n\r\ncount = 0\r\nfor i in range(-1, 2):\r\n for j in range(-1, 2):\r\n if i == 0 and j == 0:\r\n continue \r\n if 1 <= col+i <= 8 and 1 <= row+j <= 8:\r\n count += 1 \r\n\r\nprint(count) ", "x = input()\nk = 8\nif x[0] == 'h':\n\tk -= 3\n\tif x[1] == '1' or x[1] == '8':\n\t\tk -= 2\nelif x[0] == 'a':\n\tk -= 3\n\tif x[1] == '1' or x[1] == '8':\n\t\tk -= 2\nelif x[1] == '1' or x[1] == '8':\n\tk -= 3\nprint (k)\n\n# 1496338245437\n", "#!/usr/bin/env python3\r\n# -*- coding: utf-8 -*-\r\nn=0\r\ns=input()\r\nif ((s[0]=='a')or(s[0]=='h')) and ((s[1]=='1')or(s[1]=='8')):\r\n n=3\r\nelif ((s[0]=='a')or(s[0]=='h')) or ((s[1]=='1')or(s[1]=='8')):\r\n n=5\r\nelif ((s[0]!='a')or(s[0]!='h')) and ((s[1]!='1')or(s[1]!='8')):\r\n n=8\r\nprint(n)", "import string\nplace = input('')\nthree_move = ['a1', 'a8', 'h8', 'h1']\nt = string.ascii_lowercase[:8]\nif place in three_move:\n print(3)\nelif (place[0] in t and int(place[1]) in [1,8]) or (place[0] in ['a','h'] and int(place[1]) in range(2,8)):\n print(5)\nelse:\n print(8)\n", "d = input()\r\na = d[0]\r\nb = d[1]\r\ns = 'ah18'\r\nif a in s and b in s:\r\n print(3)\r\nelif a in s or b in s:\r\n print(5)\r\nelse:\r\n print(8)", "s=input()\r\ny=int(s[1])\r\nx=s[0]\r\nmoves=8\r\nif y==8 or y==1:\r\n moves=moves-3\r\nif x==\"a\" or x==\"h\":\r\n if y==8 or y==1:\r\n moves=moves-2\r\n else:\r\n moves=moves-3\r\nprint(moves)", "import math\r\ns= input()\r\nif s[0] == 'a' or s[0] == 'h':\r\n if s[1] == '1' or s[1] == '8':\r\n print(3)\r\n else:\r\n print(5)\r\nelif s[1] == '1' or s[1] == '8':\r\n if s[0] == 'a' or s[0] == 'h':\r\n print(3)\r\n else:\r\n print(5)\r\nelse:\r\n print(8)\r\n", "n=input()\r\nif (n=='a8')or(n=='a1')or(n=='h8')or(n=='h1'):\r\n print(3)\r\nelif (n[0]in('a','h'))or(n[1]in('1','8')):\r\n print(5)\r\nelse:\r\n print(8)\r\n", "s = input()\r\nc, r = s[0], int(s[1])\r\n\r\nif c in 'ah':\r\n if r>1 and r<8:\r\n print(5)\r\n else:\r\n print(3)\r\nelse:\r\n if r>1 and r<8:\r\n print(8)\r\n else:\r\n print(5)", "a=input()\nd=int(a[0] == 'a' or a[0] == 'h') + int(a[1] == '1' or a[1] == '8')\nif d == 0 :\n\tprint(8)\nelif d == 1 :\n\tprint(5)\nelse :\n\tprint(3)\n", "c=\"abcdefgh\"\r\nd=\"12345678\"\r\n\r\nf=str(input())\r\nc=c.index(f[0])\r\nd=d.index(f[1])\r\n\r\nif (c==0 or c==7) and (d==0 or d==7):\r\n print(3)\r\nelif c%7 * d%7==0 :\r\n print(5)\r\nelse:\r\n print(8)\r\n\r\n", "import sys, math\r\ninput=sys.stdin.readline\r\nINF=int(1e9)+7\r\n\r\ndef solve(): \r\n n=0\r\n s=input().rstrip()\r\n if s[0]=='a' or s[0]=='h': n+=1\r\n if s[1]=='1' or s[1]=='8': n+=1\r\n if n==0:\r\n print(8)\r\n if n==1: print(5)\r\n if n==2: print(3)\r\n \r\nt=1\r\nwhile t:\r\n t-=1\r\n solve()\r\n", "position = str(input())\r\n\r\ncolumn = position[0]\r\nrow = position[1]\r\n\r\nif (column is 'a' or column is 'h') and (row is '1' or row is '8'):\r\n print(3)\r\nelif (column is 'a' or column is 'h') or (row is '1' or row is '8'):\r\n print(5)\r\nelse:\r\n print(8)\r\n\r\n", "x,y = input()\r\nif x in 'ah' and y in '18':\r\n print(3)\r\nelif (x in 'bcdefg') != (y in '234567'):\r\n print(5)\r\nelse:\r\n print(8)", "import sys\r\n\r\ndef main():\r\n s = sys.stdin.read().strip()\r\n if s in {'a1', 'a8', 'h1', 'h8'}: return 3\r\n if any(i in s for i in '18ah'): return 5\r\n return 8\r\n\r\nprint(main())\r\n", "a = input()\r\n\r\nif a[0] == \"a\" or a[0] == \"h\":\r\n if a[1] == \"1\" or a[1] == \"8\":\r\n print(\"3\")\r\n else: print(\"5\")\r\n \r\nelif (a[0] in \"bcdefg\"):\r\n if a[1] == \"1\" or a[1] == \"8\":\r\n print(\"5\")\r\n else: print(\"8\")\r\n \r\nelse: print(\"error\")\r\n", "p = input()\nif p==\"a1\" or p==\"a8\" or p==\"h1\" or p==\"h8\":\n print(3)\nelif p[0] in \"ah\" or p[1] in \"18\":\n print(5)\nelse:\n print(8)", "\r\nimport os\r\nimport sys\r\nfrom io import BytesIO, IOBase\r\n\r\nfrom collections import defaultdict, Counter\r\n\r\ninput = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\r\nimport math\r\n\r\ndef I():\r\n return(int(input()))\r\ndef lint():\r\n return(list(map(int,input().split())))\r\ndef insr():\r\n s = input().strip()\r\n return(list(s[:len(s)]))\r\ndef invr():\r\n return(map(int,input().split()))\r\n# Python program to print all\r\n# primes smaller than or equal to\r\n# n using Sieve of Eratosthenes\r\n\r\nimport heapq\r\n\r\ndef ask(a,b,c):\r\n print(f\"? {a} {b} {c}\")\r\n sys.stdout.flush()\r\n res=int(input())\r\n sys.stdout.flush()\r\n return res\r\n\r\n\r\n\r\n\r\ns= input()\r\n\r\nc,r=ord(s[0])-96,int(s[1])\r\nans=8\r\nif c==1 or c==8:\r\n ans-=3\r\nif r==1 or r==8:\r\n ans-=3\r\nprint(max(ans,3))\r\n\r\n", "s=input()\r\nc=0\r\nif (s[0]=='a' or s[0]=='h'):\r\n c+=1\r\nif (s[1]=='1' or s[1]=='8'):\r\n c+=1\r\nif c==0:\r\n print(8)\r\nelif c==1:\r\n print(5)\r\nelse:\r\n print(3)", "x = input()\r\n\r\nif x == \"a8\" or x == \"h8\" or x == \"a1\" or x == \"h1\":\r\n print(3)\r\nelse:\r\n if x[1] == \"1\" or x[1] == \"8\" or x[0] == \"a\" or x[0] == \"h\":\r\n print(5)\r\n else:\r\n print(8)", "from math import *\r\nsInt = lambda: int(input())\r\nmInt = lambda: map(int, input().split())\r\nlInt = lambda: list(map(int, input().split()))\r\n\r\nn = input()\r\nn = list(n)\r\nans = 8\r\nif n[0]=='a' or n[0]=='h':\r\n ans = ans//2+1\r\nif n[1]=='1' or n[1]=='8':\r\n ans = ans//2+1\r\nprint(ans)\r\n\r\n\r\n\r\n\r\n\r\n", "W = input()\r\nr = W[0]\r\nc = int(W[1])\r\nans = 0\r\nif (r == 'a' and (c == 1 or c == 8)) or (r == 'h' and (c == 1 or c == 8)):\r\n\tans = 3\r\nelif r == 'a' or r == 'h' or c == 1 or c == 8:\r\n\tans = 5\r\nelse:\r\n\tans = 8\r\n\r\nprint(ans)\r\n", "c = input()\r\n\r\na = int(c[1:])\r\nc = c[:1]\r\n\r\ncnt = 8\r\n\r\nif c == 'a' or c == 'h':\r\n cnt -= 3\r\nif a == 1 or a == 8:\r\n cnt -= 3\r\n \r\nif c == 'a' and a == 1 or c == 'a' and a == 8 or c == 'h' and a == 1 or c == 'h' and a == 8:\r\n cnt += 1\r\n \r\nprint(cnt)", "s = input()\r\nr = ord(s[0]) - 96\r\nc = ord(s[1]) - 48\r\nt = 0\r\ndx = [-1,-1,-1,0,0,1,1,1]\r\ndy = [0,1,-1,1,-1,1,-1,0]\r\nfor i in range(8):\r\n x = r + dx[i]\r\n y = c + dy[i]\r\n if(1<=x<=8 and 1<=y<=8):\r\n t += 1\r\nprint(t)\r\n\r\n\r\n \r\n \r\n\r\n\r\n \r\n", "k = input()\r\nif k[0] in 'ah' and k[1] in '18':print(3)\r\nelif k[0] in 'ah18' or k[1] in 'ah18':print(5)\r\nelse:print(8)", "s = input()\r\nx = ord(s[0]) - ord('a')\r\ny = int(s[1]) - 1\r\nmoves = [\r\n [-1, -1],\r\n [-1, 0],\r\n [-1, 1],\r\n [0, -1],\r\n [0, 1],\r\n [1, -1],\r\n [1, 0],\r\n [1, 1]\r\n]\r\nres = 0\r\nfor move in moves:\r\n if 0 <= x + move[0] < 8 and 0 <= y + move[1] < 8:\r\n res += 1\r\nprint(res)", "c, d = input()\r\n\r\ngran1 = ['a', 'h']\r\ngran2 = ['1', '8']\r\n\r\nif c in gran1 and d in gran2:\r\n print(3)\r\nelif c in gran1 and d not in gran2:\r\n print(5)\r\nelif c not in gran1 and d in gran2:\r\n print(5)\r\nelse:\r\n print(8)\r\n", "# print (\"Input the square\")\nn = input()\nif n == \"a1\" or n == \"a8\" or n == \"h8\" or n == \"h1\":\n print (3)\nelif n[0] == \"a\" or n[0] == \"h\" or n[1] == \"1\" or n[1] == \"8\":\n print(5)\nelse:\n print(8)\n", "import sys\r\nfrom math import *\r\n\r\ndef minp():\r\n\treturn sys.stdin.readline().strip()\r\n\r\ndef mint():\r\n\treturn int(minp())\r\n\r\ndef mints():\r\n\treturn map(int, minp().split())\r\n\r\na = minp()\r\nx = ord(a[0])-ord('a')\r\ny = ord(a[1])-ord('1')\r\nr = 0\r\nfor i in range(-1,2):\r\n\tfor j in range(-1,2):\r\n\t\tif (i != 0 or j != 0) and x+i >= 0 and x+i < 8 and y+j >= 0 and y+j < 8:\r\n\t\t\tr += 1\r\nprint(r)", "pos = input()\r\n\r\nif (pos[0] == 'a' or pos[0] == 'h') and (pos[1] == '1' or pos[1] == '8'):\r\n print(3)\r\nelif (pos[0] == 'a' or pos[0] == 'h') or (pos[1] == '1' or pos[1] == '8'):\r\n print(5)\r\nelse:\r\n print(8)\r\n", "s = input()\r\nmove = 8\r\nif s=='a1' or s=='h1' or s=='a8' or s=='h8':\r\n\tmove = 3\r\nelse:\r\n\tif s[0]=='a' or s[0]=='h':\r\n\t\tmove-=3\r\n\tif s[1]=='1' or s[1]=='8':\r\n\t\tmove-=3\r\nprint(move)", "rc = input()\n\ncolumns = { 'a': 0, 'b': 1, 'c': 2, 'd': 3, 'e': 4, 'f': 5, 'g': 6, 'h': 7 }\n\nrow = 8 - int(rc[1])\ncolumn = columns[rc[0]]\n\nking_moves = [(-1, -1), (-1, 0), (-1, 1), (0, -1), (0, 1), (1, -1), (1, 0), (1, 1)]\n\nallowed_moves = 0\n\ndef is_allowed_move(move: tuple, row: int, column: int):\n return move[0] + row < 8 and move[0] + row >= 0 and move[1] + column < 8 and move[1] + column >= 0\n\nfor move in king_moves:\n if is_allowed_move(move, row, column):\n allowed_moves += 1\n\nprint(allowed_moves)\n \t\t \t \t\t\t\t \t\t\t\t \t\t\t", "qq = 'abcdefgh'\r\nq = '12345678'\r\nn = input()\r\nans = 0\r\nw = qq .index(n[0]) + 1\r\ne = int(n[1])\r\nfor i in range(1 ,9):\r\n if w == i and str(e - 1) in q:\r\n ans += 1\r\n if w == i and str(e + 1) in q:\r\n ans += 1\r\n if w == i - 1 and str(e - 1) in q:\r\n ans += 1\r\n if w == i - 1 and str(e) in q:\r\n ans += 1\r\n if w == i - 1 and str(e + 1) in q:\r\n ans += 1\r\n if w == i + 1 and str(e - 1) in q:\r\n ans += 1\r\n if w == i + 1 and str(e) in q:\r\n ans += 1\r\n if w == i + 1 and str(e + 1) in q:\r\n ans += 1\r\nprint(ans)\r\n", "def main():\r\n temp_string = input()\r\n p1, p2 = temp_string[0], temp_string[1]\r\n\r\n flag1, flag2 = p1 in (\"a\", \"h\"), p2 in (\"1\", \"8\")\r\n if flag1 and flag2:\r\n print(3)\r\n elif (flag1, flag2) in [(True, False), (False, True)]:\r\n print(5)\r\n else:\r\n print(8)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "position = input()\nif position =='a8' or position == 'h8' or position == 'a1' or position == 'h1':\n print(3)\nelif position[0] == 'a' or position[0] == 'h' or position[1] == '1' or position[1] =='8':\n print(5)\nelse:\n print(8)", "n = input()\r\nif n in ['a8', 'h8', 'h1', 'a1']:\r\n print(3)\r\nelif n[0] > \"a\" and n[0] < 'h' and n[1] > '1' and n[1] < '8':\r\n print(8)\r\nelse:\r\n print(5)", "l=[char for char in input()]\r\n\r\nsum=8\r\nif l[0]=='a'or l[0]=='h':\r\n sum-=3\r\n if l[1]=='1' or l[1]=='8':\r\n sum-=2\r\n\r\nelif l[1]=='1' or l[1]=='8':\r\n sum-=3\r\n\r\nprint(sum)", "s = input()\r\nif s=='a1' or s=='a8' or s=='h1' or s=='h8':\r\n print(3)\r\nelif s[0] in ['a','h'] and s[1] in ['2','3','4','5','6','7']:\r\n print(5)\r\nelif s[0] in ['b','c','d','e','f','g'] and s[1] in ['1','8']:\r\n print(5)\r\nelse:\r\n print(8)", "s = input()\r\nflag = 0\r\nif(s[0] == 'a' or s[0] == 'h' ):\r\n flag += 1\r\nif(s[1] == '1' or s[1] == '8' ):\r\n flag += 1\r\nif(flag==0):\r\n print(8)\r\nelif(flag==1):\r\n print(5)\r\nelse:\r\n print(3)", "s = input()\r\nif s in {'a1', 'a8', 'h1', 'h8'}:\r\n print(3)\r\nelif s[0] in {'a', 'h'} or s[1] in {'1', '8'}:\r\n print(5)\r\nelse:\r\n print(8)", "# LUOGU_RID: 101608353\ns = set(input())\r\nx = 3\r\nif set('ah') & s:\r\n x -= 1\r\ny = 3\r\nif set('18') & s:\r\n y -= 1\r\nprint(x * y - 1)", "import math\r\nimport string\r\n\r\ndef main():\r\n\ts = input()\r\n\tprint([8, 5, 3]['ah'.count(s[0]) + '18'.count(s[1])])\r\n\r\nif __name__ == '__main__':\r\n\tmain()", "s=input();print(8-3*(s[0] in 'ah' or s[1] in '18')-2*(s[0] in 'ah' and s[1] in '18'))", "s = input()\r\nif s == 'a8' or s == 'a1' or s == 'h1'or s == 'h8':\r\n print(3)\r\nelif s[0] == 'a' or s[0] == 'h' or s[1] == '1' or s[1] == '8':\r\n print(5)\r\nelse:\r\n print(8)", "stroke = input()\r\nx = str(stroke[0])\r\ny = int(stroke[1])\r\ntransformation = dict(zip('abcdefgh', list(range(8))))\r\nx = transformation[x]+1\r\nif x == 8:\r\n x = 1\r\nif x == 7:\r\n x = 2\r\nif x == 6:\r\n x = 3\r\nif y == 8:\r\n y = 1\r\nif y == 7:\r\n y = 2\r\nif y == 6:\r\n y = 3\r\nif x == 1 and y == 1:\r\n print(3)\r\nelif x == 1 or y == 1:\r\n print(5)\r\nelse:\r\n print(8)\r\n", "a, b = [_ in 'ah18' for _ in input()]\nprint(8 - 3 * (a + b) + (a and b))\n", "__author__ = 'Think'\r\ndata=input()\r\ncol=data[0] in [\"a\", \"h\"]\r\nrow=data[1] in [\"1\", \"8\"]\r\nif row:\r\n\tif col:\r\n\t\tprint(3)\r\n\telse:\r\n\t\tprint(5)\r\nelse:\r\n\tif col:\r\n\t\tprint(5)\r\n\telse:\r\n\t\tprint(8)\r\n", "s=input()\r\nif (s[0] in 'ah') and (s[1]=='1' or s[1]=='8'):\r\n print(3)\r\nelif (s[0] in 'bcdefgh') and (s[1]=='1' or s[1]=='8'):\r\n print(5)\r\nelif (s[0] in 'ah') and (s[1] not in '18'):\r\n print(5)\r\nelse:\r\n print(8)", "s = input()\r\nx = (ord(s[0]) - ord('a')) % 7\r\ny = (int(s[1]) - 1) % 7\r\nprint(8 - 3 * (x * y == 0) - 2 * (x + y == 0))", "import sys\r\n\r\ninput = sys.stdin.readline\r\n\r\nx = input().rstrip()\r\nif x[0] ==\"a\" or x[0] == \"h\" or x[1] == \"1\" or x[1] == \"8\":\r\n if x == \"a1\" or x == \"a8\" or x == \"h1\" or x == \"h8\":\r\n print(3)\r\n else:\r\n print(5)\r\nelse:\r\n print(8)", "p = input()\nr = ord(p[0]) - ord('a') + 1\n\nif p in ['a8', 'h8', 'a1', 'h1']:\n print(3)\nelif r in [1, 8] or int(p[1]) in [1, 8]:\n print(5)\nelse:\n print(8)", "# bsdk idhar kya dekhne ko aaya hai, khud kr!!!\r\n# from math import *\r\n# from itertools import *\r\n# import random\r\ncd = input()\r\ncol = cd[0]\r\nrow = int(cd[-1])\r\nif col == \"a\" or col == \"h\":\r\n if row == 1 or row == 8:\r\n print(3)\r\n else:\r\n print(5)\r\nelif col == \"b\" or col == \"c\" or col == \"d\" or col == \"e\" or col == \"f\" or col == \"g\":\r\n if row == 1 or row == 8:\r\n print(5)\r\n else:\r\n print(8)\r\n", "a,b=*input(),\r\nx=a in'ah'\r\ny=b in'18'\r\nprint(8-x*3-y*3+x*y)", "pos = input().strip()\r\ncol, row = pos[0], int(pos[1])\r\n\r\n# Count the number of valid cells in each direction\r\nvalid_moves = 0\r\nfor dc in [-1, 0, 1]:\r\n for dr in [-1, 0, 1]:\r\n if dc == 0 and dr == 0:\r\n continue\r\n new_col = chr(ord(col) + dc)\r\n new_row = row + dr\r\n if new_col < 'a' or new_col > 'h' or new_row < 1 or new_row > 8:\r\n continue\r\n valid_moves += 1\r\n\r\nprint(valid_moves)\r\n", "s,d=input()\r\ncount=0\r\nif s==\"a\" or s==\"h\":\r\n\tcount+=1\r\nif d==\"1\" or d==\"8\":\r\n\tcount+=1\r\nif count==0:\r\n\tprint(8)\r\nelif count==1:\r\n\tprint(5)\r\nelif count==2:\r\n\tprint(3)", "s=input()\r\nd={'a':1,'b':2,'c':3,'d':4,'e':5,'f':6,'g':7,'h':8}\r\nc=0\r\nif(d[s[0]]!=1 and d[s[0]]!=8):\r\n a=2\r\n c+=a\r\nelse:\r\n a=1\r\n c+=a\r\nif(s[1]!='1'):\r\n c+=a+1\r\nif(s[1]!='8'):\r\n c+=a+1\r\nprint(c)\r\n \r\n", "a = input()\r\nb = a[0]\r\nc = a[1]\r\ncoun = 0\r\n\r\nif b == \"a\" or b == \"h\":\r\n coun += 1\r\n\r\nif c == \"1\" or c == \"8\":\r\n coun += 1\r\n\r\nif coun == 0:\r\n print (\"8\")\r\n\r\nelif coun == 2:\r\n print (\"3\")\r\n\r\nelse:\r\n print (\"5\")", "d = {}\r\nfor i in range(8):\r\n d[chr(i + ord('a'))] = i\r\ns = input()\r\nh, w = d[s[0]], int(s[1]) - 1\r\n\r\nnum = 0\r\nfor dx, dy in [(0, 1), (1, 0), (-1, 0), (0, -1), (1, 1), (-1, 1), (1, -1), (-1, -1)]:\r\n x, y = h + dx, w + dy\r\n if 0 <= x < 8 and 0 <= y < 8:\r\n num += 1\r\n\r\nprint(num)", "posicion = input(\"\")\r\n\r\nposibles = 8\r\nif posicion[0] == 'a' or posicion[0] == 'h':\r\n if posicion[1] == '1' or posicion[1] == '8':\r\n posibles = 3\r\n else:\r\n posibles = 5\r\nelif posicion[1] == '1' or posicion[1] == '8':\r\n posibles = 5\r\nprint(posibles)\r\n", "d = input()\r\na = d[0]\r\nb = d[1]\r\nif a == 'a' and b == '1' or a == 'h' and b == '1' or a == 'h' and b == '8' or a == 'a' and b == '8':\r\n print(3)\r\nelif a == 'a' or b == '1' or a == 'h' or b == '8':\r\n print(5)\r\nelse:\r\n print(8)", "pos = input()\n\nif 'a' in pos or 'h' in pos or '1' in pos or '8' in pos:\n if pos == 'a8' or pos == 'h8' or pos == 'a1' or pos == 'h1':\n print(3)\n else:\n print(5)\nelse:\n print(8)\n", "import sys\r\nline=sys.stdin.readline().strip('\\n')\r\nl=line[0]\r\nn=int(line[1])\r\n\r\nif((l!='a'and l!='h')and(n!=1 and n!=8)):\r\n output=8\r\nelif((l=='a' or l=='h')and(n!=1 and n!=8)):\r\n output=5\r\nelif((l!='a' and l!='h')and(n==1 or n==8)):\r\n output=5\r\nelif((l=='a' or l=='h')and(n==1 or n==8)):\r\n output=3\r\nsys.stdout.write(str(output))\r\n", "a = input()\r\nif a[0] == 'a' or a[0] == 'h':\r\n if a[1] == '1' or a[1] == '8':\r\n print(3)\r\n else:\r\n print(5)\r\nelse:\r\n if a[1] == '1' or a[1] == '8':\r\n print(5)\r\n else:\r\n print(8)\r\n", "s=input()\r\nh=8\r\nif s[0]=='h' or s[0]=='a':\r\n\th-=3\r\n\tif s[1]=='1' or s[1]=='8':\r\n\t\th-=2\r\nelif s[1]=='1' or s[1]=='8':\r\n\th-=3\r\nprint(h)", "s=str(input())\r\ne=int(s[1])\r\nf=s[0]\r\nif(e>=2 and e<=7 and f>='b' and f<='g'):\r\n print(8)\r\nelif(s=='a8' or s=='h1' or s=='a1' or s=='h8'):\r\n print(3)\r\nelse:\r\n print(5)", "tablero=[]\r\nfor i in range(8):\r\n tablero.append([\".\",\".\",\".\",\".\",\".\",\".\",\".\",\".\"])\r\nn=input()\r\n(a,b)=\"abcdefgh\".find(n[0]),int(n[1])-1\r\nk=0\r\nif a+1<=7:\r\n k+=1\r\nif b+1<=7:\r\n k+=1\r\n\r\nif b-1>=0:\r\n k+=1\r\n\r\nif a-1>=0:\r\n k+=1\r\n\r\nif a-1>=0 and b+1<=7:\r\n k+=1\r\nif b-1>=0 and a+1<=7:\r\n k+=1\r\nif a-1>=0 and b-1>=0:\r\n k+=1\r\n\r\nif a+1<=7 and b+1<=7:\r\n k+=1\r\n\r\nprint(k)\r\n", "pos = input()\r\nc, d = pos[0], pos[1]\r\nif (c == 'a' or c == 'h') and (d == '1' or d == '8'):\r\n print(3)\r\nelif 'a' < c < 'h' and 1 < int(d) < 8:\r\n print(8)\r\nelse:\r\n print(5)", "st = input()\r\n\r\nl3 = ['a1','h1','a8','h8']\r\n\r\nif st in l3:\r\n print(3)\r\nelse:\r\n li = [x for x in str(st)]\r\n\r\n if li[0] in ['a','h'] and not li[1] in ['1','8']:\r\n print(5)\r\n elif not li[0] in ['a','h'] and li[1] in ['1','8']:\r\n print(5)\r\n else:\r\n print(8)", "s=input()\ncol=s[0]\nrow=int(s[1])\nif (col=='a' or col=='h') and (row==1 or row==8):\n\tprint(\"3\")\nelif col=='a' or col=='h' or row==1 or row==8:\n\tprint(\"5\")\nelse:\n\tprint(\"8\")", "Line = list(input())\r\nLine[1] = int(Line[1])\r\nLines = \"abcdefgh\"\r\n\r\nif Line[1] != 1 and Line[1] != 8:\r\n if Lines.find(Line[0]) != 0 and Lines.find(Line[0]) != 7:\r\n print(8)\r\n else:\r\n print(5)\r\nelse:\r\n if Lines.find(Line[0]) != 0 and Lines.find(Line[0]) != 7:\r\n print(5)\r\n else:\r\n print(3)\r\n", "s=input()\r\nans=8\r\nf=0\r\nif s[0]=='a' or s[0]=='h':\r\n ans-=3\r\n f+=1\r\nif s[1]=='1' or s[1]=='8':\r\n ans-=3\r\n f+=1\r\nif f==2:\r\n ans+=1\r\nprint(ans)", "k = input()\r\nx = 8\r\nif 'a' in k or 'h' in k:\r\n x = x - 3\r\nif '1' in k or '8' in k:\r\n x = x - 3\r\nif x==2:\r\n x = 3\r\nprint(x)", "s=input()\na=s[0]\nb=s[1]\nif (s[0]==\"a\" or s[0]==\"h\") and (s[1]==\"1\" or s[1]==\"8\"):\n print(3)\nelif (s[0]==\"a\" or s[0]==\"h\" or s[1]==\"1\" or s[1]==\"8\"):\n print(5)\nelse:\n print(8)", "chess_position = input()\r\n\r\nif len(chess_position) == 2 and chess_position[0] in \"ah\" and chess_position[1] in \"18\":\r\n print(3)\r\nelif len(chess_position) == 2 and chess_position[0] in \"ah\":\r\n print(5)\r\nelif len(chess_position) == 2 and chess_position[1] in \"18\":\r\n print(5)\r\nelse:\r\n print(8)", "a=input()\r\nb=a[1]\r\na=a[0]\r\nif a is \"a\" or a is \"h\":\r\n if b is \"1\" or b is \"8\":\r\n print(3)\r\n exit(0)\r\n else:\r\n print(5)\r\n exit(0)\r\nif b is \"1\" or b is \"8\":\r\n print(5)\r\n exit(0)\r\nprint(8)", "c, r = list(input())\r\n\r\nm = 8\r\n\r\ncon = c == 'a' or c == 'h'\r\n\r\nif con:\r\n m -= 3\r\nif r == '8' or r == '1':\r\n if con:\r\n m -= 2\r\n else:\r\n m -= 3\r\n\r\nprint(m)\r\n", "n1 = input()\r\nstr1 = \"abcdefghijklmnopqrstuvwxyz\"\r\ni = int(n1[1])-1\r\nj = [i for i, x in enumerate(str1) if x == n1[0]][0]\r\n\r\ndef check(i,j):\r\n count = 0\r\n for k in range(i-1,i+2):\r\n for z in range(j-1,j+2):\r\n if k < 0 or z < 0 or k >= 8 or z >= 8:\r\n continue\r\n else:\r\n count+=1\r\n count-=1\r\n return count\r\n \r\nprint(check(i,j))\r\n\r\n ", "cd = input() \r\nif cd == \"a8\" or cd == \"h8\" or cd == \"a1\" or cd == \"h1\":\r\n print (\"3\")\r\nelif cd == \"a2\" or cd == \"a3\" or cd == \"a4\" or cd == \"a5\" or cd == \"a6\" or cd == \"a7\" or cd == \"h2\" or cd == \"h3\" or cd == \"h4\" or cd == \"h5\" or cd == \"h6\" or cd == \"h7\" or cd == \"b1\" or cd == \"c1\" or cd == \"d1\" or cd == \"e1\" or cd == \"f1\" or cd == \"g1\" or cd == \"b8\" or cd == \"c8\" or cd == \"d8\" or cd == \"e8\" or cd == \"f8\" or cd == \"g8\":\r\n print (\"5\")\r\nelse:\r\n print (\"8\")", "a=input()\r\nb=a[0]\r\nc=int(a[1])\r\nif (b==\"a\" or b==\"h\") and (c==1 or c==8):\r\n print(3)\r\nelif b==\"a\" or b==\"h\" or c==1 or c==8:\r\n print(5)\r\nelse:\r\n print(8)", "from sys import stdin, stdout\r\n\r\ndef main():\r\n s = stdin.readline()[:-1]\r\n x = int(s[1])\r\n if ord(s[0]) > ord('a') and ord(s[0]) < ord('h'):\r\n if x > 1 and x < 8:\r\n stdout.write('8\\n')\r\n else:\r\n stdout.write('5\\n')\r\n else:\r\n if x > 1 and x < 8:\r\n stdout.write('5\\n')\r\n else:\r\n stdout.write('3\\n')\r\n\r\nif __name__ == \"__main__\":\r\n main()", "m = input()\r\nn = m[0:1]\r\n\r\ncounter = 0\r\nif (n in ('a','h')):\r\n counter += 1\r\nn = m[1:2]\r\n\r\nif (n in ('1','8')):\r\n counter += 1\r\nif counter == 1:\r\n print(5)\r\nif counter == 2:\r\n print(3)\r\nif counter == 0:\r\n print(8)\r\n\r\n", "s = input()\r\nc = len([char for char in s if char in {'1', '8', 'a', 'h'}])\r\nx = [8, 5, 3]\r\nprint(x[c])", "s=input()\r\nch1=s[0]\r\nch2=s[1]\r\nif(ch1=='a'):\r\n if(ch2=='1' or ch2=='8'):\r\n print (3)\r\n else:\r\n print(5)\r\nelif(ch1=='h'):\r\n if(ch2=='1' or ch2=='8'):\r\n print(3)\r\n else:\r\n print(5)\r\nelse:\r\n if(ch2=='1' or ch2=='8'):\r\n print(5)\r\n else:\r\n print(8)\r\n ", "row, column=input()\r\n\r\nrow=ord(row)-96\r\ncolumn=int(column)\r\n\r\n\r\nx0=row-1;x1=row+1\r\nmx=min(x0-1,8-x1)\r\n\r\ny0=column-1;y1=column+1\r\nmy=min(y0-1, 8-y1)\r\n\r\nif mx>=0 and my>=0:\r\n\tprint(8)\r\nelif mx<0 and my<0:\r\n\tprint(3)\r\nelse:\r\n\tprint(5)", "I = lambda :map(int, input().split())\r\nc,d = input()\r\nprint((3,5,8)[('a'<c<'h')+('1'<d<'8')])", "n = input()\r\nif n[0] == \"a\" and n[1] == \"8\":\r\n print(3)\r\nelif n[0] == \"a\" and n[1] == \"1\":\r\n print(3)\r\nelif n[0] == \"h\" and n[1] == \"1\":\r\n print(3)\r\nelif n[0] == \"h\" and n[1] == \"8\":\r\n print(3)\r\nelif n[1] == \"1\":\r\n print(5)\r\nelif n[1] == \"8\":\r\n print(5)\r\nelif n[0] == \"a\" or n[0] == \"h\":\r\n print(5)\r\nelse:\r\n print(8)", "s,n=input()[:]\r\nn=int(n)\r\nif n==1:n=8\r\ns={'a':8,'b':2,'c':3,'d':4,'e':5,'f':6,'g':7,'h':8}[s]\r\nprint(8-[s,n].count(8)*3+[0,1][[s,n].count(8)==2])\r\n\r\n", "n=input();a=n[0];b=(n[1])\nif a=='a' or b=='1' or a=='h' or b=='8':\n if (a=='a'and (b=='1' or b=='8' ))or(a=='h'and (b=='1' or b=='8' )):\n print(3)\n else:\n print(5)\nelse:\n print(8)", "n=input()\r\n\r\nif (n[1]=='1' or n[1]=='8') and (n[0]=='a' or n[0]=='h'):\r\n print(\"3\")\r\nelif n[1]=='1' or n[1]=='8' or n[0]=='a' or n[0]=='h':\r\n print(\"5\")\r\nelse:\r\n print(\"8\")", "z='abcdefgh'\r\na=input()\r\nb=z.find(a[0])+1\r\nc=int(a[1])\r\nif b==1 or b==8:\r\n if c==1 or c==8:\r\n print(3)\r\n else:\r\n print(5)\r\nelse:\r\n if c==1 or c==8:\r\n print(5)\r\n else:\r\n print(8)", "a=str(input())\r\ncol=a[0]\r\nfil=a[1]\r\n\r\nif (col==\"a\" or col==\"h\") and (int(fil)==1 or int(fil)==8):\r\n print(3)\r\nelif (col==\"b\" or col==\"c\" or col==\"d\" or col==\"e\" or col==\"f\" or col==\"g\") and (1<int(fil)<8):\r\n print(8)\r\nelse:\r\n print(5)\r\n", "\r\n\r\ns=input()\r\nif s==\"a1\" or s==\"h1\" or s==\"a8\" or s==\"h8\":\r\n print(\"3\")\r\nelif s[1]==\"1\" or s[1]==\"8\" or s[0]==\"a\" or s[0]==\"h\":\r\n print(\"5\")\r\nelse:\r\n print(\"8\")\r\n\r\n", "a=input()\r\nif a=='a1':\r\n print('3')\r\nelif a=='a2':\r\n print('5')\r\nelif a=='a3':\r\n print('5')\r\nelif a=='a4':\r\n print('5')\r\nelif a=='a5':\r\n print('5')\r\nelif a=='a6':\r\n print('5')\r\nelif a=='a7':\r\n print('5')\r\nelif a=='a8':\r\n print('3')\r\nelif a=='b1':\r\n print('5')\r\nelif a=='b2':\r\n print('8')\r\nelif a=='b3':\r\n print('8')\r\nelif a=='b4':\r\n print('8')\r\nelif a=='b5':\r\n print('8')\r\nelif a=='b6':\r\n print('8')\r\nelif a=='b7':\r\n print('8')\r\nelif a=='b8':\r\n print('5')\r\nelif a=='c1':\r\n print('5')\r\nelif a=='c2':\r\n print('8')\r\nelif a=='c3':\r\n print('8')\r\nelif a=='c4':\r\n print('8')\r\nelif a=='c5':\r\n print('8')\r\nelif a=='c6':\r\n print('8')\r\nelif a=='c7':\r\n print('8')\r\nelif a=='c8':\r\n print('5')\r\nelif a=='d1':\r\n print('5')\r\nelif a=='d2':\r\n print('8')\r\nelif a=='d3':\r\n print('8')\r\nelif a=='d4':\r\n print('8')\r\nelif a=='d5':\r\n print('8')\r\nelif a=='d6':\r\n print('8')\r\nelif a=='d7':\r\n print('8')\r\nelif a=='d8':\r\n print('5')\r\nelif a=='e1':\r\n print('5')\r\nelif a=='e2':\r\n print('8')\r\nelif a=='e3':\r\n print('8')\r\nelif a=='e4':\r\n print('8')\r\nelif a=='e5':\r\n print('8')\r\nelif a=='e6':\r\n print('8')\r\n \r\nelif a=='e7':\r\n print('8')\r\nelif a=='e8':\r\n print('5')\r\nelif a=='f1':\r\n print('5')\r\nelif a=='f2':\r\n print('8')\r\nelif a=='f3':\r\n print('8')\r\nelif a=='f4':\r\n print('8')\r\nelif a=='f5':\r\n print('8')\r\nelif a=='f6':\r\n print('8')\r\nelif a=='f7':\r\n print('8')\r\nelif a=='f8':\r\n print('5')\r\nelif a=='g1':\r\n print('5')\r\nelif a=='g2':\r\n print('8')\r\nelif a=='g3':\r\n print('8')\r\nelif a=='g4':\r\n print('8')\r\nelif a=='g5':\r\n print('8')\r\nelif a=='g6':\r\n print('8')\r\nelif a=='g7':\r\n print('8')\r\nelif a=='g8':\r\n print('5')\r\nelif a=='h1':\r\n print('3')\r\nelif a=='h2':\r\n print('5')\r\nelif a=='h3':\r\n print('5')\r\nelif a=='h4':\r\n print('5')\r\nelif a=='h5':\r\n print('5')\r\nelif a=='h6':\r\n print('5')\r\nelif a=='h7':\r\n print('5')\r\nelif a=='h8':\r\n print('3')\r\n", "c,d=list(input())\r\nl=['b','c','d','e','f','g']\r\nx=['2','3','4','5','6','7']\r\nif c in ['a','h'] and d in ['1','8']:\r\n\tprint(3)\r\nelif c in l and d in ['1','8']:\r\n\tprint(5)\r\nelif c in [\"h\",\"a\"] and d in x:\r\n\tprint(5)\r\nelse:\r\n\tprint(8)\r\n", "cd=input()\nif list(cd) in [[i,str(j)] for i in ['b','c','d','e','f','g'] for j in range(2,8)] :\n\tprint(8)\nelif cd in ('a8','h8','a1','h1'):\n\tprint(3)\nelse:\n\tprint(5)\n", "ch=input()\r\nl=list(ch)\r\nc,d=l[0],int(l[1])\r\nif c=='a' or c=='h' or d==1 or d==8:\r\n if (c=='a' and d==8) or (c=='h' and d==1) or (d==1 and c=='a') or (d==8 and c=='h'):\r\n print(3)\r\n else:\r\n print(5)\r\nelse:\r\n print(8)\r\n \r\n \r\n", "a = input()\nc = a[0]\nd = int(a[1])\ns = 8\nif d == 1 or d == 8:\n s = s-3\nif c == \"a\" or c == \"h\":\n s = s-3\nif s == 2:\n s=s+1\nprint(s)", "n = str(input())\r\n\r\na = ['1','8']\r\nb = ['a','h']\r\n\r\nif n[1] in a and n[0] in b :\r\n print(3)\r\nelif n[0] in b or n[1] in a :\r\n print(5)\r\nelse:\r\n print(8)\r\n\r\n\r\n \r\n", "#!/usr/bin/env python\r\n\r\nimport math\r\nimport sys\r\nimport itertools\r\nimport fractions\r\n\r\nif __name__ == '__main__':\r\n wtf = sys.stdin.read()\r\n wtf = wtf.strip().split('\\n')\r\n cd = wtf[0]\r\n if cd == 'a8' or cd == 'h8' or cd == 'a1' or cd == 'h1':\r\n print(3)\r\n elif cd[0] == 'a' or cd[0] == 'h' or cd[1] == '1' or cd[1] == '8':\r\n print(5)\r\n else:\r\n print(8)\r\n", "num = list(input())\r\nc = num[0]\r\nd = int(num[1])\r\nif d == 1 or d == 8:\r\n if c == 'a' or c == 'h': print(3)\r\n else: print(5)\r\nelse:\r\n if c == 'a' or c == 'h': print(5)\r\n else: print(8)", "c, d = list(input())\r\nif c in 'ah' and str(d) in '18': print(3)\r\nelif c in 'ah' or str(d) in '18': print(5)\r\nelse: print(8)", "s = input()\r\nr,c = 3,3\r\n\r\nif s[0]=='a' or s[0]=='h':\r\n r-=1\r\nif s[1]=='1' or s[1] == '8':\r\n c-=1\r\nprint(r*c-1)", "\n\npos = input()\n\nif pos in ['a8', 'h8', 'a1', 'h1']:\n print(3)\nelif pos[0] in ['a', 'h'] or pos[1] in ['1', '8']:\n print(5)\nelse:\n print(8)\n", "s=input()\nif s[0]==\"a\" and s[1]==\"1\":\n print(3)\nelif s[0]==\"h\" and s[1]==\"1\":\n print(3)\n\nelif s[0]==\"h\" and s[1]==\"8\":\n print(3)\n\nelif s[0]==\"a\" and s[1]==\"8\":\n print(3)\n\nelif s[0]==\"a\" or s[0]==\"h\":\n print(5)\n\nelif s[1]==\"1\" or s[1]==\"8\":\n print(5)\nelse:\n print(8)", "cd=input()\r\nif cd==\"a8\" or cd==\"a1\" or cd==\"h1\" or cd==\"h8\":\r\n print(3)\r\nelif cd[0]==\"a\" or cd[0]==\"h\" or cd[1]==\"8\" or cd[1]==\"1\":\r\n print(5)\r\nelse:\r\n print(8)", "s=str(input())\r\na=8\r\nif s[0]=='a' or s[0]=='h':\r\n a=5\r\nif s[1]=='1' or s[1]=='8':\r\n a=min(5,a-2)\r\nprint(a)", "cd=str(input())\r\nif cd==\"a8\" or cd==\"h8\" or cd==\"h1\" or cd==\"a1\": print(3)\r\nelse:\r\n if cd[0]==\"a\" or cd[0]==\"h\" or cd[1]==\"1\" or cd[1]==\"8\": print(5)\r\n else: print(8)\r\n", "import sys\r\nfrom math import *\r\n\r\na = input()\r\nif (a[0] == 'a' and (a[1] == '8' or a[1] == '1')) or (a[0] == 'h' and (a[1] == '8' or a[1] == '1')):\r\n\tprint(3)\r\nelse:\r\n\tif ('1' < a[1] and a[1] < '8') and ('a' < a[0] and a[0] < 'h'):\r\n\t\tprint(8)\r\n\telse: \r\n\t\tprint(5)", "n = input()\r\na,b = n[0],n[1]\r\nif n=='a8' or n=='a1' or n=='h1' or n=='h8':\r\n print(3)\r\nelif a=='h' or a=='a':\r\n print(5)\r\nelif b=='1' or b=='8':\r\n print(5)\r\nelse:\r\n print(8)", "position = input()\n\nrow = position[0]\ncolumn = int(position[1])\n\nif column == 1 or column == 8:\n if row == 'a' or row == 'h':\n print(3)\n else:\n print(5)\nelse:\n if row == 'a' or row == 'h':\n print(5)\n else:\n print(8)", "import sys\r\n\r\nposition = str(input())\r\n\r\nletter = position[0]\r\nnumber = int(position[1])\r\n\r\nif letter >= 'b' and letter <= 'g':\r\n if number >= 2 and number <= 7:\r\n print(\"8\")\r\n sys.exit()\r\n else:\r\n print(\"5\")\r\n sys.exit()\r\n\r\nelse:\r\n if number == 8 or number == 1:\r\n print(\"3\")\r\n sys.exit()\r\n else:\r\n print(\"5\")\r\n sys.exit()\r\n", "'''input\na4\n'''\np = input()\nif p in [\"a8\", \"h8\", \"a1\", \"h1\"]:\n\tprint(3)\nelif any(x in p for x in [\"a\", \"h\", \"1\", \"8\"]):\n\tprint(5)\nelse:\n\tprint(8)", "n=input()\r\nif ( n[0]>'a' and n[0]<'h') and (int(n[1])>1 and int(n[1])<8):\r\n print(\"8\")\r\nelif (n[0]>'a' and n[0]<'h') and (int(n[1])==1 or int(n[1])==8):\r\n print(\"5\")\r\nelif (n[0]=='a' or n[0]=='h') and (int(n[1])>1 and int(n[1])<8):\r\n print(\"5\")\r\nelif (n[0]=='a' or n[0]=='h') and (int(n[1])==1 or int(n[1])==8):\r\n print(\"3\")\r\n", "s = input()\na, b = s[0] in ('a', 'h'), s[1] in ('1', '8')\nprint(8 - 3 * (a + b) + (a and b))\n", "# cook your dish hereh\nt=input()\nif(t[0]=='a' or t[0]=='h'):\n if(t[1]=='1' or t[1]=='8'):\n print(3)\n else:\n print(5)\nelif(t[1]=='1' or t[1]=='8'):\n print(5)\nelse:\n print(8)", "coord=input()\r\nif (coord[0]!='a')and(coord[0]!='h')and(coord[1]!='1')and(coord[1]!='8'):\r\n print(8)\r\nelif (((coord[0]=='a')or(coord[0]=='h'))and(coord[1]!='1')and(coord[1]!='8'))or((coord[0]!='a')and(coord[0]!='h')and((coord[1]=='1')or(coord[1]=='8'))):\r\n print(5)\r\nelse:\r\n print(3)\r\n", "def main():\n\n\tposition = [coordinate for coordinate in input()]\n\tposition[0] = int(ord(position[0]) - 97)\n\tposition[1] = int(position[1]) - 1\n\n\tmoves = 8\n\n\tif position[0] == 0 or position[0] == 7:\n\n\t\tmoves -= 3\n\n\tif position[1] == 0 or position[1] == 7:\n\n\t\tmoves -= 3 if moves == 8 else 2\n\n\tprint(moves)\n\nmain()", "def king(s):\r\n letters = \"abcdefgh\"\r\n a, b = letters.find(s[0]) + 1, int(s[1])\r\n if (a, b) in [(1, 1), (8, 8), (1, 8), (8, 1)]:\r\n return 3\r\n elif a in [1, 8] or b in [1, 8]:\r\n return 5\r\n return 8\r\n\r\n\r\nprint(king(input()))\r\n", "c, d = list(input())\r\nis_letter = c == 'a' or c == 'h'\r\nis_digit = d == '1' or d == '8'\r\nprint(8 - (is_letter or is_digit) * 3 - (is_letter and is_digit) * 2)\r\n", "s = input()\r\nif s in ['h1', 'a1', 'h8', 'a8']:\r\n print(3)\r\nelif s[0] == 'h' or s[0] == 'a' or s[1] == '1' or s[1] == '8':\r\n print(5)\r\nelse:\r\n print(8)", "import sys\ninput = sys.stdin.readline\n\npozicia = input()\nif pozicia[0] == \"a\" or pozicia[0] == \"h\":\n if pozicia[1] == \"1\" or pozicia[1] == \"8\":\n print(3)\n else:\n print(5) \nelif pozicia[1] == \"1\" or pozicia[1] == \"8\":\n print(5)\nelse:\n print(8)\n", "p = input()\r\n\r\nif p == \"a1\" or p == \"a8\" or p == \"h1\" or p == \"h8\":\r\n print(3)\r\nelif p[0] == 'a' or p[0] == 'h' or p[1] == '1' or p[1] == '8':\r\n print(5)\r\nelse:\r\n print(8)", "n = input()\r\nb = n[0] == 'a' or n[0] == 'h'\r\nc = n[1] == '1' or n[1] == '8'\r\nif b and c:\r\n print(\"3\")\r\nelif b or c:\r\n print(\"5\")\r\nelse:\r\n print(\"8\")", "s=input()\r\na=s[0]\r\nb=int(s[1])\r\nif (a=='a' and (b==1 or b==8))or(a=='h' and (b==1 or b==8)):\r\n print(3)\r\nelif(a=='a' or a=='h' or b==1 or b==8):\r\n print(5)\r\nelse:\r\n print(8)\r\n ", "import sys\r\n\r\ns = input()\r\nx, y = ord(s[0])-96, int(s[1])\r\nans = 0\r\nfor i in range(x-1, x+2):\r\n for j in range(y-1, y+2):\r\n if 1 <= i <= 8 and 1 <= j <= 8:\r\n ans += 1\r\n\r\nprint(ans-1)\r\n", "S = input()\r\nif S in ['a8','h8','a1','h1']:\r\n print(3)\r\n exit()\r\nif S[0] in ['a','h'] or S[1] in ['8','1']:\r\n print(5)\r\n exit()\r\nprint(8)", "s = input()\r\nif (s==\"a1\" or s==\"a8\" or s==\"h1\" or s==\"h8\"):\r\n print (3)\r\nelif(s[0]=='h' or s[0]=='a'):\r\n print(5)\r\nelif(s[1]=='1' or s[1]=='8'):\r\n print(5)\r\nelse:\r\n print(8) \r\n", "#!/usr/bin/env/python\r\n# -*- coding: utf-8 -*-\r\ns = input()\r\nedg = 'ah18'\r\nres = 8\r\nfor c in s:\r\n if c in edg:\r\n res -= 3\r\nif res == 2:\r\n res += 1\r\nprint(res)\r\n", "\r\ndef main():\r\n s = input()\r\n if s[1] == '1' and s[0] == 'a' or s[1] == '1' and s[0] == 'h' or s[1] == '8' and s[0] == 'a' or s[1] == '8' and s[0] == 'h':\r\n print('3')\r\n elif s[1] == '8' and 'b' <= s[0] <= 'g' or s[1] == '1' and 'b' <= s[0] <= 'g' or s[0] == 'a' and 2 <= int(s[1]) <= 7 or s[0] == 'h' and 2 <= int(s[1]) <= 7:\r\n print('5')\r\n else:\r\n print('8')\r\n\r\n \r\nif __name__ == '__main__':\r\n main()\r\n", "a = input()\r\nc = a[0]\r\nd = int(a[1])\r\ns = 8\r\nif d == 1 or d == 8:\r\n s = s-3\r\nif c == \"a\" or c == \"h\":\r\n s = s-3\r\nif s == 2:\r\n s=s+1\r\nprint(s)\r\n", "if __name__ == '__main__':\r\n\ts = input()\r\n\tif s[0] in 'ah' or s[1] in '18':\r\n\t\tif s == 'a1' or s == 'a8' or s == 'h1' or s == 'h8':\r\n\t\t\tprint(3)\r\n\t\telse:\r\n\t\t\tprint(5)\r\n\telse:\r\n\t\tprint(8)", "s=input()\r\nans=8\r\nif s[0]=='a' or s[0]=='h':\r\n ans-=3\r\n if s[1]=='1' or s[1]=='8': ans-=2\r\nelif s[1]=='1' or s[1]=='8': ans-=3\r\nprint(ans)", "s=input()\r\nx=['a1','h1','a8','h8']\r\nif s in x:\r\n print(3)\r\nelif s[0]=='a' or s[0]=='h' or s[1]=='1' or s[1]=='8':\r\n print(5)\r\nelse: print(8)", "p = input()\r\nif p==\"a1\" or p==\"a8\" or p==\"h1\" or p==\"h8\":\r\n print(3)\r\nelif p[0] in \"ah\" or p[1] in \"18\":\r\n print(5)\r\nelse:\r\n print(8)", "import string\n\ndef moves_permitted(type):\n if type == 1:\n return 8\n elif type == 2:\n return 5\n else:\n return 3\n\nmove = input()\n\nc = string.ascii_lowercase.index(move[0]) + 1\nd = int(move[1])\n\ntype = 1\n\nif c == 1 or c == 8:\n type += 1\nif d == 1 or d == 8:\n type += 1\n\nprint(moves_permitted(type))", "# King Moves\ndef king(s):\n c = s[0]\n d = s[1]\n if c in ['a', 'h'] and d in ['1', '8']:\n return 3\n if c in ['a', 'h'] or d in ['1', '8']:\n return 5\n return 8\n\n\ns = input()\nprint(king(s))\n", "king = input()\nrow, col = int(king[1]) - 1, ord(king[0]) - ord(\"a\")\nres = 3 if row % 7 == 0 and col % 7 == 0 else 5 if row % 7 == 0 or col % 7 == 0 else 8\nprint(res)\n", "square = input()\n\nans = 8\n\nif square[0] == 'a' or square[0] == 'h':\n ans = 5\nif square[1] == '1' or square[1] == '8':\n ans = 5\nif square == 'a1' or square == 'a8' or square == 'h1' or square == 'h8':\n ans = 3\n\n\n\nprint(int(ans))\n\n\n\n", "def main_function():\r\n position = input()\r\n d = {\"a\": 1, \"b\": 2, \"c\": 3, \"d\": 4, \"e\": 5, \"f\": 6, \"g\": 7, \"h\": 8}\r\n position_1 = d[position[0]]\r\n position_2 = int(position[1])\r\n all_moves = 8\r\n if position_1 != 1 and position_1 != 8 and position_2 != 1 and position_2 != 8:\r\n return 8\r\n elif (position_1 == 1 or position_1 == 8) and (position_2 == 1 or position_2 == 8):\r\n return 3\r\n else: return 5\r\n\r\n\r\nprint(main_function())\r\n\r\n", "n=input()\r\nif n==\"a1\" or n==\"a8\" or n==\"h1\" or n==\"h8\":\r\n print(\"3\")\r\nelif n[0]==\"a\" or n[0]==\"h\" or n[1]==\"1\" or n[1]==\"8\":\r\n print(\"5\")\r\nelse:\r\n print(\"8\")", "c,d=input()\r\nd=int(d)\r\ndr=[[0,1],[0,-1],[1,1],[1,-1],[1,0],[-1,0],[-1,-1],[-1,1]]\r\ncnt=0\r\nfor i in range(8):\r\n a=chr(ord(c)+dr[i][0])\r\n b=d+dr[i][1]\r\n if 'a'<=a<='h' and 1<=b<=8:\r\n cnt+=1\r\nprint(cnt)", "#A. King Moves\r\ncd = input()\r\nmovespossible = 8\r\nyes = 0\r\nfor i in cd:\r\n if (i == \"a\" or i == \"h\"):\r\n movespossible = movespossible - 3 \r\n yes = True\r\n if (i == \"1\" or i == \"8\"):\r\n movespossible = movespossible - 3\r\n if (yes == True):\r\n movespossible = movespossible + 1\r\nprint (movespossible)", "pos = list(input())\r\nif pos[0] > 'a' and pos[0] < 'h' and int(pos[1]) > 1 and int(pos[1]) < 8:\r\n print(8)\r\nelif ((pos[0] == 'a' or pos[0] == 'h') and (int(pos[1]) == 1 or int(pos[1]) == 8)):\r\n print(3)\r\nelse:\r\n print(5)", "s = input()\nprint(3 if s in \"a1a8h1h8\" else 5 if s in \"a2a3a4a5a6a7b1b8c1c8d1d8e1e8f1f8g1g8h2h3h4h5h6h7\" else 8)", "b,c=input()\r\ncount=0\r\nif b==\"a\" or b==\"h\":\r\n if c==\"1\" or c==\"8\":\r\n count=3\r\n else:\r\n count=5\r\nelse:\r\n if c==\"1\" or c==\"8\" :\r\n count=5\r\n else:\r\n count=8\r\nprint(count) \r\n", "b=input()\r\nc=b[:1]\r\nd=b[1:]\r\nif((c=='a' or c=='h') and (d=='1' or d=='8')):\r\n print(int('3'))\r\nelif(((c=='a' or c=='h') and (d<'8' or d>'1')) or ((d=='1' or d=='8') and (c>'a' or c<'h'))):\r\n print(int('5'))\r\nelse:\r\n print(int('8'))\r\n", "x, y = input()\r\nx = ord(x) - ord('a')\r\ny = ord(y) - ord('1')\r\ncnt = 0\r\nfor dx in [-1, 0, 1]:\r\n for dy in [-1, 0, 1]:\r\n if dx == dy == 0:\r\n continue\r\n if 0 <= x + dx <= 7 and 0 <= y + dy <= 7:\r\n cnt += 1\r\n\r\nprint(cnt)\r\n ", "a = input()\r\nif a[0] == \"a\" or a[0] == \"h\":\r\n if a[1] == \"1\" or a[1] == \"8\":print(3)\r\n else:print(5)\r\nelif a[1] == \"1\" or a[1] == \"8\":print(5)\r\nelse:print(8)", "l=input()\r\nif(l==\"a8\" or l==\"h8\" or l==\"a1\" or l==\"h1\"):\r\n print(\"3\")\r\nelif(l[0]==\"a\" or l[0]==\"h\" or l[1]==\"8\" or l[1]==\"1\"):\r\n print(\"5\")\r\nelse:\r\n print(\"8\")\r\n", "m = input()\r\ner, ec = m[0] in 'ah', m[1] in '18'\r\nprint((er - 3) * (ec - 3) - 1)", "def solve(location):\r\n SIZE = 8\r\n R_OFFSETS = [-1, -1, 0, 1, 1, 1, 0, -1]\r\n C_OFFSETS = [0, 1, 1, 1, 0, -1, -1, -1]\r\n\r\n r = ord(location[0]) - ord('a')\r\n c = int(location[1]) - 1\r\n\r\n return sum(1 for i in range(len(R_OFFSETS)) if 0 <= r + R_OFFSETS[i] < SIZE and 0 <= c + C_OFFSETS[i] < SIZE)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n location = input().strip()\r\n print(solve(location))", "def Moves():\n vs = input()\n if (vs == \"a1\") or (vs == \"a8\") or (vs == \"h1\") or (vs == \"h8\"):\n return 3\n if (vs[0] == \"a\") or (vs[0] == \"h\"):\n return 5\n if (vs[1] == \"1\") or (vs[1] == \"8\"):\n return 5\n else:\n return 8\nprint(\"%d\"% Moves())\n", "a=input()\r\nif (a[0]==\"a\" or a[0]==\"h\") and (a[1]==\"1\" or a[1]==\"8\"):\r\n print(3)\r\nelif (a[0]==\"a\" or a[0]==\"h\") and (a[1]!=\"1\" and a[1]!=\"8\"):\r\n print(5)\r\nelif (a[0]!=\"a\" and a[0]!=\"h\") and (a[1]==\"1\" or a[1]==\"8\"):\r\n print(5)\r\nelse:\r\n print(8)", "from functools import lru_cache, wraps\nfrom sys import stderr\n\nimport time\n\nINF = 10 ** 18 + 3\nEPS = 1e-10\n\n\ndef main():\n c, r = input()\n c = ord(c) - ord('a') + 1\n r = int(r)\n print(fields_of_king(c, r, 8))\n\n\ndef fields_of_king(x, y, n):\n number_of_moves = 8\n moves = ((1, 0), (1, -1),\n (0, -1), (-1, -1),\n (-1, 0), (-1, 1),\n (0, 1), (1, 1))\n for move in moves:\n new_x, new_y = move\n new_x, new_y = x + new_x, y + new_y\n if new_x not in range(1, n + 1) or new_y not in range(1, n + 1):\n number_of_moves -= 1\n return number_of_moves\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# Decorators\ndef res_to_stderr(function):\n def wrapped(*args, **kwargs):\n res = function(*args, **kwargs)\n print(res, file=stderr)\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# Auxiliary functions\n@res_to_stderr\ndef range_of_len(start, length, step=1):\n return range(start, start + length * step, step)\n\n\ndef set_input(file):\n global input\n input = lambda: file.readline().strip()\n\n\ndef set_output(file):\n global print\n 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 time_it(main)()\n", "c,d=input()\r\n\r\nif c in 'ah' and d in '18':\r\n\tprint(3)\r\nelif c not in 'ah' and d in '18':\r\n\tprint(5)\r\nelif c in 'ah' and d not in '18':\r\n\tprint(5)\r\nelse:\r\n\tprint(8)", "n = input()\r\nif n == 'a2' or n == 'a3' or n == 'a4' or n == 'a5' or n == 'a6' or n == 'a7' or n == 'h2' or n == 'h3' or n == 'h4' or n == 'h5' or n == 'h6' or n == 'h7' or n == 'b1' or n == 'c1' or n == 'd1' or n == 'e1' or n == 'f1' or n == 'g1' or n == 'b8' or n == 'c8' or n == 'd8' or n == 'e8' or n == 'f8' or n == 'g8':\r\n print(5)\r\nelif n == 'a1' or n == 'a8' or n == 'h1' or n == 'h8':\r\n print(3)\r\nelse:\r\n print(8)", "from itertools import combinations\r\ns = input()\r\nl0 = ['a1','a8','h1','h8']\r\nl1 = ['a2','a3','a4','a5','a6','a7','b1','b8','c1','c8','d1','d8','e1','e8','f1','f8','g1','g8','h1','h2','h3','h4','h5','h6','h7','h8']\r\nif s in l0:\r\n print(3)\r\nelif s in l1:\r\n print(5)\r\nelse:\r\n print(8)\r\n", "# import sys \r\n# sys.stdin=open(\"input.in\",'r')\r\n# sys.stdout=open(\"out.out\",'w')\r\ns=input()\r\na=ord(s[0])-96\r\nb=int(s[1])\r\nc=[1,8]\r\nif a in c and b in c:\r\n\tprint(3)\r\nelif (a in c)^(b in c):\r\n\tprint(5)\r\nelse:\r\n\tprint(8) ", "pos = input()\r\nrow = int(pos[1])\r\ncol = pos[0]\r\nmoves=8\r\nif 'a'<col<'h':\r\n if not 1<row<8:\r\n moves-=3\r\nelse:\r\n moves-=3\r\n if not 1<row<8:\r\n moves-=2\r\n\r\nprint(moves)\r\n\r\n \r\n \r\n", "a=input()\r\nif a==\"a8\" or a==\"a1\" or a==\"h8\" or a==\"h1\":\r\n\tprint(3)\r\nelif ((a[0]>='b' and a[0]<='g') and (a[1]=='8' or a[1]=='1')) or ((a[1]>='2' and a[1]<='7') and (a[0]=='a' or a[0]=='h')):\r\n\tprint(5)\r\nelse:\r\n\tprint(8)", "s = input()\r\nif s in [\"a1\", \"h1\", \"a8\", \"h8\"]: print(3)\r\nelif s[1] in ['1', '8'] or s[0] in ['a', 'h']: print(5)\r\nelse: print(8)", "p=input()\r\ns=list(p)\r\na=s[0]\r\nb=s[1]\r\nif b==\"1\" or b==\"8\":\r\n if a==\"h\" or a==\"a\":\r\n print(\"3\")\r\n else:\r\n print(\"5\")\r\nelif a==\"a\" or a==\"h\":\r\n if b==\"1\" or b==\"8\":\r\n print(\"3\")\r\n else:\r\n print(\"5\")\r\n \r\nelse:\r\n print(\"8\")", "position = input()\r\nmoves = 8\r\nif (position[0] == 'a' or position[0] == 'h') and (position[1] == '1' or position[1] == '8'):\r\n moves -= 5\r\nelif position[0] == 'a' or position[0] == 'h':\r\n moves -= 3\r\nelif position[1] == '1' or position[1] == '8':\r\n moves -= 3\r\n \r\nprint(moves)\r\n", "a,m,s=input(),0,0\nc=a[0]\nr=a[1]\nif c=='a' or c=='h':\n\ts+=1\nif r=='1' or r=='8':\n\ts+=1\nif s==2:\n\tm=3\nelif s==1:\n\tm=5\nelse:\n\tm=8\nprint(m)\n\t \t \t \t \t\t \t \t \t\t \t \t \t", "c, d = input()\r\nif c in 'ah' and d in '18':\r\n print(3)\r\nelif c in 'ah' or d in '18':\r\n print(5)\r\nelse:\r\n print(8)\r\n", "\r\n\r\nm = input()\r\n\r\nc, d = m[0], m[1]\r\n\r\n\r\nmoves = [1, 1, 1, 1, 1, 1, 1, 1]\r\n\r\nif c == 'a':\r\n moves[0] = 0\r\n moves[1] = 0\r\n moves[2] = 0\r\nelif c == 'h':\r\n moves[5] = 0\r\n moves[6] = 0\r\n moves[7] = 0\r\n\r\n\r\nif d == '1':\r\n moves[2] = 0\r\n moves[4] = 0\r\n moves[7] = 0\r\nelif d == '8':\r\n moves[0] = 0\r\n moves[3] = 0\r\n moves[5] = 0\r\n\r\nprint(moves.count(1))", "cd = input()\r\n\r\na = 'abcdefgh'\r\n\r\nc = a.find(cd[0])\r\nd = int(cd[1]) - 1\r\n\r\nl = 0\r\nif c - 1 >= 0 and d - 1 >= 0:\r\n l += 1\r\n\r\nif d - 1 >= 0:\r\n l += 1\r\n\r\nif c + 1 < 8 and d - 1 >= 0:\r\n l += 1\r\n\r\nif c - 1 >= 0:\r\n l += 1\r\n \r\nif c + 1 < 8:\r\n l += 1\r\n\r\nif c - 1 >= 0 and d + 1 < 8:\r\n l += 1\r\n \r\nif d + 1 < 8:\r\n l += 1\r\n \r\nif c + 1 < 8 and d + 1 < 8:\r\n l += 1\r\n \r\nprint(l)", "i = input()\n\ny, x = i[0], i[1]\n\nborders = 0\n\nif y in 'ah':\n borders += 1\nif x in '18':\n borders += 1\n\nif borders == 1:\n print('5')\nelif borders == 2:\n print('3')\nelse:\n print('8')\n", "ch=input()\r\nif ch in ['a1','a8','h8','h1']:\r\n print(3)\r\nelif(ch[0] in ['a','h']) or (ch[1] in ['8','1']):\r\n print(5)\r\nelse:\r\n print(8)\r\n", "n = input()\nif (n[0]=='a' or n[0] == 'h'):\n if (n[1]=='1' or n[1]=='8'):\n print(3)\n else:\n print(5)\nelif (n[1]=='1' or n[1]=='8'):\n print(5)\nelse:\n print(8)", "a = input()\r\nif a[0] == \"a\" or a[0] == \"h\":\r\n if int(a[1]) == 1 or int(a[1]) == 8:\r\n print(3)\r\n else:\r\n print(5)\r\nelif int(a[1]) == 1 or int(a[1]) == 8:\r\n print(5)\r\nelse:\r\n print(8)", "W = input()\r\nr = W[0]\r\nc = int(W[1])\r\nans = 0\r\nif (r == 'a' and (c == 1 or c == 8)) or (r == 'h' and (c == 1 or c == 8)):\r\n\tans = 3\r\nelse:\r\n\tif r == 'a' or r == 'h' or c == 1 or c == 8:\r\n\t\tans = 5\r\n\telse:\r\n\t\tans = 8\r\n\r\nprint(ans)\r\n", "def main():\n position = input()\n (col, row) = (position[0], position[1])\n\n print(\n 3 if col in ['a', 'h'] and row in ['1', '8'] else\n 5 if col in ['a', 'h'] or row in ['1', '8'] else\n 8\n )\n\n\nif __name__ == '__main__':\n main()\n", "pos = input()\r\nc = pos[0]\r\nr = pos[1]\r\nn = 0\r\n\r\nif (c == 'a' or c == 'h') and (r == '1' or r == '8'):\r\n print(3)\r\nelif (c == 'a' or c == 'h') or (r == '1' or r == '8'):\r\n print(5)\r\nelse:\r\n print(8)\r\n", "def bounds(r, c):\n if(r<0 or c<0 or r>=8 or c>=8):\n return False\n return True\n\ns = input()\nc = ord(s[0])-97\nr = int(s[1])-1\n\n\ncc = 0\nfor k in range(3):\n for j in range(3):\n \n if(bounds(r-1+k,c-1+j)):\n if(k!=1 or j!=1):\n cc+=1\nprint(cc)\n \n\n\n\n", "cd = input()\r\n\r\nif (cd[0] == 'a' or cd[0] == 'h') and (cd[1] == '1' or cd[1] == '8'):\r\n x = 3\r\nelif (cd[0] == 'a' or cd[0] == 'h') and (cd[1] != '1' or cd[1] != '8'):\r\n x = 5\r\nelif (cd[0] != 'a' or cd[0] != 'h') and (cd[1] == '1' or cd[1] == '8'):\r\n x = 5\r\nelse:\r\n x = 8\r\nprint(x)\r\n", "a = input()\r\nb = [\"a1\",\"h1\",\"a8\",\"h8\"]\r\nc = [\"1\",\"8\",\"a\",\"h\"]\r\nif a in b: print(3)\r\nelif a[0] in c or a[1] in c: print(5)\r\nelse: print(8)", "x=input()\r\nif x[1]=='1' or x[1]=='8':\r\n print( 3 if x[0]=='a' or x[0]=='h' else 5)\r\nelse:\r\n print(5 if x[0]=='a' or x[0]=='h' else 8)", "a1 = input()\r\n\r\na = a1[0]\r\nb = a1[1]\r\n\r\nif a1 == \"a1\" or a1 == \"a8\" or a1 == \"h1\" or a1 == \"h8\":\r\n print(3)\r\nelif a1 == \"b1\" or a1 == \"c1\" or a1 == \"d1\" or a1 == \"e1\" or a1 == \"f1\" or a1 == \"g1\" or a1 == \"b8\" or a1 == \"c8\" or a1 == \"d8\" or a1 == \"e8\" or a1 == \"f8\" or a1 == \"g8\":\r\n print(5)\r\nelif a1 == \"a2\" or a1 == \"a3\" or a1 == \"a4\" or a1 == \"a5\" or a1 == \"a6\" or a1 == \"a7\" or a1 == \"h2\" or a1 == \"h3\" or a1 == \"h4\" or a1 == \"h5\" or a1 == \"h6\" or a1 == \"h7\":\r\n print(5)\r\nelse:\r\n print(8)", "s = input()\r\n\r\nbuk = s[0]\r\n\r\ncf = int(s[1])\r\n\r\n\r\nif(buk in ('a','h') and cf in (1, 8)):\r\n print(3)\r\nelif(buk in ('a','h') or cf in (1, 8)):\r\n print(5)\r\nelse:\r\n print(8)\r\n", "x=str(input())\r\na = str(x[0])\r\nb = int(x[1])\r\nif ((a == \"a\") or (a == \"h\")) and ((b==1) or (b==8)):\r\n w = 3\r\nelif ((b==1) or (b==8)):\r\n w =5\r\nelif ((a == \"a\") or (a == \"h\")):\r\n w=5 \r\nelse:\r\n w =8\r\nprint (w)\r\n", "pos = input()\r\nrow = 2 if pos[0] == \"a\" or pos[0] == \"h\" else 3\r\ncol = 2 if pos[-1] == \"1\" or pos[-1] == \"8\" else 3\r\nprint(row * col - 1)\r\n", "#!/usr/bin/env python\n# coding=utf-8\n'''\nAuthor: Deean\nDate: 2021-11-07 17:15:32\nLastEditTime: 2021-11-07 17:21:54\nDescription: King Moves\nFilePath: CF710A.py\n'''\n\n\ndef func():\n position = input().strip()\n if position in [\"a1\", \"h1\", \"a8\", \"h8\"]:\n print(3)\n elif position[0] in [\"a\", \"h\"] or position[1] in [\"1\", \"8\"]:\n print(5)\n else:\n print(8)\n\n\nif __name__ == '__main__':\n func()\n", "s=input()\r\nx=s[0]\r\ny=s[1]\r\nx=ord(x)-97\r\ny=int(y)-1\r\nans=0\r\nfor dx in range(-1,2):\r\n for dy in range(-1,2):\r\n if dx!=0 or dy!=0:\r\n nx,ny=x+dx,y+dy\r\n if 0<=nx<8 and 0<=ny<8:\r\n ans+=1\r\nprint(ans)", "import sys\ninp = sys.stdin.readline().replace('\\n','')\nc = ord(inp[0]) - 97\nd = ord(inp[1]) - 49\nprint((min(7,d+1)-max(0,d-1)+1)*(min(7,c+1)-max(0,c-1)+1)-1)\n\t\t \t\t\t \t\t\t \t\t\t\t \t \t \t\t", "n=input()\r\nif n[0]=='a' and n[1]=='1' or n[0]=='h' and n[1]=='1' or n[0]=='a' and n[1]=='8' or n[0]=='h' and n[1]=='8':\r\n print(3)\r\nelif n[0]=='a' or n[1]=='1' or n[0]=='h' or n[1]=='8':\r\n print(5)\r\nelse:\r\n print(8)", "s=input()\r\nif s[0] in ['a','h'] and s[1] in ['8','1']:\r\n print(3)\r\nelif s[1] in ['8','1'] or s[0] in ['a','h']: print(5)\r\nelse:print(8)", "# Hydro submission #64d5f0e438608da1af95fb80@1691742436896\na, b = input()\r\nb = int(b)\r\nif (a == \"a\" or a == \"h\") and (b == 8 or b == 1):\r\n\tprint(\"3\")\r\nelif a == \"a\"or a == \"h\" or b == 1 or b == 8:\r\n\tprint(\"5\")\r\nelse:\r\n\tprint(\"8\")", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Thu Feb 13 22:43:54 2020\r\n\r\n@author: jared\r\n\"\"\"\r\n\r\ncolumn, row = input()\r\ncolumn_edge, row_edge = column in ['a', 'h'], row in ['1', '8']\r\nif column_edge and row_edge:\r\n print(3)\r\nelif column_edge or row_edge:\r\n print(5)\r\nelse:\r\n print(8)", "if __name__ == '__main__':\r\n cd = str(input())\r\n if cd in ['a8', 'h8', 'a1', 'h1']:\r\n print(3)\r\n elif cd[0] in ['a', 'h'] or cd[1] in ['1', '8']:\r\n print(5)\r\n else:\r\n print(8)\r\n", "s = input()\r\na = s[0]\r\nn = int(s[1])\r\nif (a =='a' or a == 'h') and (n==1 or n==8):\r\n print(3)\r\nelif (a =='a' or a == 'h') and n!=1 and n!=8:\r\n print(5)\r\nelif a!='a' and a != 'h' and (n==1 or n==8):\r\n print(5)\r\nelse:\r\n print(8)", "cd = input()\nif cd[0] in \"ah\" and cd[1] in \"18\":\n print(3)\nelif cd[0] in \"ah\" or cd[1] in \"18\":\n print(5)\nelse:\n print(8)\n\t\t \t \t\t\t \t\t\t\t\t\t\t \t\t\t \t \t", "s = input()\nx, y = s[0], s[1]\n\nif x in \"ah\" and y in \"18\":\n print(3)\nelif x in \"ah\" or y in \"18\":\n print(5)\nelse:\n print(8)\n", "a = input()\nx = a[0]\ny = a[1]\nif a == 'a1' or a=='a8' or a=='h1' or a=='h8':\n print(3)\n\nelif x =='a' or x == 'h' or y == '1' or y=='8':\n print(5)\nelse:\n print(8)", "position = input()\r\nturns = 0\r\nif position[0] == 'a':\r\n\tturns = 2\r\nelif position[0] == 'h':\r\n\tturns = 2\r\nelse:\r\n\tturns = 3\r\nif position[1] == '1':\r\n\tprint(turns*2-1)\r\nelif position[1] == '8':\r\n\tprint(turns*2-1)\r\nelse:\r\n\tprint(turns*3-1)", "move = input()\r\nc = move[0]\r\nd = int(move[1])\r\n\r\nmoves = 0\r\nif c=='a' or c=='h':\r\n moves = 3\r\n if 1<d<8:\r\n moves += 2\r\n\r\nelse:\r\n moves = 8\r\n if d==1 or d==8:\r\n moves -=3\r\nprint(moves)\r\n", "s = input()\r\nif(s == 'a1'):\r\n print(3)\r\nelif(s == 'a8'):\r\n print(3)\r\nelif(s == 'h1'):\r\n print(3)\r\nelif(s == 'h8'):\r\n print(3)\r\nelif(s[0] == 'a'):\r\n print(5)\r\nelif(s[0] == 'h'):\r\n print(5)\r\nelif(s[1] == '1'):\r\n print(5)\r\nelif(s[1] == '8'):\r\n print(5)\r\nelse:\r\n print(8)", "x=input()\r\nc=x[0]\r\nd=int(x[1])\r\nif c=='h' and d==8 or c=='h' and d==1 or c=='a' and d==8 or c=='a' and d==1:\r\n print(3)\r\nelif c=='a' or c=='b' and d==8 or c=='c' and d==8 or c=='d' and d==8 or c=='e' and d==8 or c=='f' and d==8 or c=='g' and d==8 or c=='h':\r\n print(5)\r\nelif c=='b' and d==1 or c=='c' and d==1 or c=='d' and d==1 or c=='e' and d==1 or c=='f' and d==1 or c=='g' and d==1:\r\n print(5)\r\nelse:\r\n print(8)", "pos = input()\r\nx, y = pos[0], pos[1]\r\ndef nexmove(x,y) :\r\n mvs = 8\r\n if ( x=='a' or x=='h' ) and ( y=='1' or y=='8' ) :\r\n mvs = 3\r\n elif ( x=='a' or x=='h' ) and ( y!='1' and y!='8' ) :\r\n mvs = 5\r\n elif ( y=='1' or y=='8' ) :\r\n mvs = 5\r\n return mvs\r\nans = nexmove(x,y)\r\nprint(ans)", "cd = input()\r\ncolumn = ord(cd[0]) - 96\r\nrow = int(cd[1])\r\n\r\nif column == 1 and row == 1:\r\n x = 3\r\nelif column == 8 and row == 8:\r\n x = 3\r\nelif column == 8 and row == 1:\r\n x = 3\r\nelif column == 1 and row == 8:\r\n x = 3\r\nelif column == 1 or column == 8 or row == 1 or row == 8:\r\n x = 5\r\nelse:\r\n x = 8\r\n\r\nprint(x)\r\n", "n = input()\r\nif n[0]==\"h\" or n[0]==\"a\":\r\n\tif n[1]==\"1\" or n[1]==\"8\":print(3)\r\n\telse:print(5)\r\nelse:\r\n\tif n[1]==\"1\" or n[1]==\"8\":print(5)\r\n\telse:print(8)", "c,d = map(str, input())\r\nt = 8\r\nif c == 'a' or c == 'h':\r\n t = 5\r\nif d == '1' or d == '8':\r\n t = 5\r\n if c == 'a' or c == 'h':\r\n t = 3\r\nprint(t)", "def solution(l1):\r\n if l1[0] in \"bcdefg\":\r\n if l1[1] in \"234567\":\r\n return 8\r\n else: \r\n return 5\r\n else:\r\n if l1[1] in '234567':\r\n return 5\r\n else:\r\n return 3\r\n\r\ndef answer():\r\n l1 = list(input())\r\n print(solution(l1))\r\nanswer()\r\n", "a = list(input())\ncol = ord(a[0]) - 96\nrow = int(a[1])\nmoves = 0\nfor pCol in range(col - 1, col + 2):\n for pRow in range(row - 1, row + 2):\n if not(pCol > 8 or pCol < 1 or pRow > 8 or pRow < 1):\n moves += 1\n\n\nprint(moves - 1)", "n=input()\r\nc=0\r\nif(n[0]>'a' and n[0]<'h' and int(n[1])>1 and int(n[1])<8):\r\n c=8\r\nelse:\r\n if((n[0]=='a' or n[0]=='h') and (int(n[1])==1 or int(n[1])==8)):\r\n c=3\r\n else:\r\n c=5\r\nprint(c)\r\n \r\n \r\n", "s = str(input())\r\na = s[0]\r\nb = s[1]\r\n\r\nif a in ['a', 'h'] and b in ['1', '8']:\r\n print(3)\r\nelif a in ['a', 'h'] or b in ['1', '8']:\r\n print(5)\r\nelse:\r\n print(8)", "s =input()\r\nc, r = s[0], s[1]\r\nif (c == \"a\" or c == \"h\") and (r == \"1\" or r == \"8\"):\r\n print(3)\r\nelif (c == \"a\" or c == \"h\") and (r != \"1\" or r != \"8\"):\r\n print(5)\r\nelif (c != \"a\" or c != \"h\") and (r == \"1\" or r == \"8\"):\r\n print(5)\r\nelse:\r\n print(8)\r\n", "s=input()\na,b=(ord(s[0])-ord('a')),int(s[1])\nif(a>0 and a<7):\n\tif(b>1 and b<8):\n\t\tprint(\"8\")\n\telse:\n\t\tprint(\"5\")\nelse:\n\tif(b>1 and b<8):\n\t\tprint(\"5\")\n\telse:\n\t\tprint(\"3\")\n", "s = str(input(''))\nt = list(s)\na = str(t[0])\ny = int(t[1])\nc1 = ['a', 'b', 'c', 'd', 'e', 'f', 'g', 'h']\nfor i in range(0,8):\n\tif c1[i] == a:\n\t\tx = i + 1\n\t\tbreak\nif(x==1 or x==8) and (y==1 or y==8):\n\tprint(3)\nelif x==1 or x==8 and 2<=y<=7:\n\tprint(5)\nelif y==1 or y==8 and 2<=x<=7:\n\tprint(5)\nelse:\n\tprint(8)", "movimientos=8\r\nvertical=False\r\nhorizontal=False\r\nposicion=input()\r\nif (posicion[0]==\"a\" or posicion[0]==\"h\"):\r\n vertical=True\r\nif (posicion[1]==\"1\" or posicion[1]==\"8\"):\r\n horizontal=True\r\nif(vertical and horizontal):\r\n movimientos-=5\r\nelif(vertical or horizontal):\r\n movimientos-=3\r\nprint(movimientos)", "s = input()\r\n\r\nif s[0] in 'ah' and s[1] in '18':\r\n print('3')\r\nelif s[0] in 'ah' or s[1] in '18':\r\n print('5')\r\nelse:\r\n print('8')\r\n", "s = list(input().strip())\n\nif(ord(s[0]) > 97 and ord(s[0]) < 104 and int(s[1]) > 1 and int(s[1]) < 8):\n print(8)\nelif((ord(s[0]) == 97 or ord(s[0]) == 104) and (int(s[1]) == 1 or int(s[1]) == 8)):\n print(3)\nelse:\n print(5)\n", "a=list(input())\r\nn=a[0]\r\nm=a[1]\r\nif n in ['a','h']:\r\n if m in ['1','8']:\r\n print(3)\r\n else:\r\n print(5)\r\nelif m in ['1','8']:\r\n print(5)\r\nelse:\r\n print(8)\r\n ", "p = input()\r\nmoo = p[0]\r\npor = p[1]\r\nif moo == \"a\" or moo == \"h\":\r\n if por == \"1\" or por == \"8\":\r\n print(3)\r\n else:\r\n print(5)\r\nelse:\r\n if por == \"1\" or por == \"8\":\r\n print(5)\r\n else:\r\n print(8)", "s = input()\r\nif s in ['a1','a8','h1','h8']:\r\n print('3')\r\nelif s[0] in ['a','h'] or s[1] in ['1','8']:\r\n print('5')\r\nelse:\r\n print('8')", "def isv(x,y):\n\tif x>0 and x<9 and y>0 and y<9:\n\t\treturn True\n\treturn False\n\n\ndef move(a):\n\tc=ord(a[0])-ord('a')+1\n\tr=int(a[1])\n\tm=0\n\tif isv(r,c+1):\n\t\tm+=1\n\tif isv(r,c-1):\n\t\tm+=1\n\tif isv(r+1,c):\n\t\tm+=1\n\tif isv(r-1,c):\n\t\tm+=1\n\tif isv(r+1,c+1):\n\t\tm+=1\n\tif isv(r-1,c-1):\n\t\tm+=1\n\tif isv(r+1,c-1):\n\t\tm+=1\n\tif isv(r-1,c+1):\n\t\tm+=1\n\treturn m\n\t\nprint(move(input()))\n\t", "x = str(input())\r\nc = str(x[0])\r\nf = int(x[1])\r\nif (c == \"a\") or (c == \"h\"):\r\n if (f == 1) or (f == 8):\r\n w = 3\r\n else :\r\n w = 5\r\nelif (f == 1) or (f == 8):\r\n if (c == \"a\") or (c == \"h\"):\r\n w = 3\r\n else:\r\n w = 5\r\nelse:\r\n w = 8\r\nprint (w)", "cb = input()\r\nc = cb[0]\r\nb = cb[1]\r\n\r\nmoves = 8\r\nif b == '1' or b == '8':\r\n moves -= 3\r\nif c == 'a' or c == 'h':\r\n moves -= 3\r\nif moves == 2:\r\n moves = 3\r\n\r\nprint(moves)", "cd = input().strip()\r\nif cd[0] in ['a','h'] and cd[1] in ['1','8']:\r\n print(3)\r\nelif cd[0] in ['a','h'] or cd[1] in ['1','8']:\r\n print(5)\r\nelse:\r\n print(8)", "a = input()\r\nh, g = 0, 0\r\nif a[0] == 'a' or a[0] == 'h':\r\n h = 1\r\nif a[1] == '1' or a[1] == '8':\r\n g = 1\r\nif h + g == 0:\r\n print(8)\r\nelif h + g == 1:\r\n print(5)\r\nelse:\r\n print(3)", "class CodeforcesTask710ASolution:\n def __init__(self):\n self.result = ''\n self.position = ''\n\n def read_input(self):\n self.position = input()\n\n def process_task(self):\n if self.position in ['a8', 'a1', 'h8', 'h1']:\n self.result = \"3\"\n elif self.position[0] in 'ah' or self.position[1] in '18':\n self.result = \"5\"\n else:\n self.result = \"8\"\n\n def get_result(self):\n return self.result\n\n\nif __name__ == \"__main__\":\n Solution = CodeforcesTask710ASolution()\n Solution.read_input()\n Solution.process_task()\n print(Solution.get_result())\n", "s = list(input())\r\nb = int(str(ord(s[0]) - 96))\r\na = int(s[1])\r\nans = 0\r\nif(a-1 >= 1 and b+1 <= 8): ans += 1\r\nif(b+1 <= 8): ans += 1\r\nif(a+1 <= 8 and b+1 <= 8): ans += 1\r\nif(a+1 <= 8): ans += 1\r\nif(a-1 >= 1): ans += 1\r\nif(a-1 >= 1 and b-1 >= 1): ans += 1\r\nif(b-1 >= 1): ans += 1\r\nif(a+1 <= 8 and b-1 >= 1): ans += 1\r\nprint(ans)", "a = input()\r\nif a[0] == 'h' or a[0] == 'a' or a[1] == '1' or a[1] == '8':\r\n if a == 'a1' or a == 'h1' or a == 'h8' or a == 'a8': print(3)\r\n else: print(5) \r\nelse: print(8)\r\n", "_in = input()\r\na = _in[0]\r\nb = int(_in[1])\r\nflag1=flag2=0\r\nif a == 'h' or a == 'a':\r\n flag1=1 \r\nif b == 1 or b == 8:\r\n flag2=1\r\n \r\nif flag1 and flag2 :\r\n\tprint(\"3\")\r\nelif flag1 and not flag2 :\r\n\tprint(\"5\")\r\nelif not flag1 and flag2 :\r\n\tprint(\"5\")\r\nelse :\r\n\tprint(\"8\")", "s = input()\nc = s[0]\nd = int(s[1])\n\nif (c == \"a\" or c == \"h\"):\n if (d == 1 or d == 8):\n print(3)\n else:\n print(5)\nelif (d == 1 or d == 8):\n print(5)\nelse:\n print(8)\n", "p=input()\r\ns=0\r\nif p[0]=='a' or p[0]=='h':\r\n s+=1\r\nif p[1]=='1' or p[1]=='8':\r\n s+=1\r\nif s==0:\r\n print(8)\r\nelif s==1:\r\n print(5)\r\nelse:\r\n print(3)", "cd = input()\r\n\r\ndic1 = {'a2', 'a3', 'a4', 'a5', 'a6', 'a7', 'b1', 'c1', 'd1', 'e1', 'f1', 'g1', 'b8', 'c8', 'd8', 'e8', 'f8', 'g8',\r\n 'h2', 'h3', 'h4', 'h5', 'h6', 'h7',\r\n }\r\n\r\ndic2 = {'a1', 'a8', 'h8', 'h1'}\r\n\r\nwhile True:\r\n if cd in dic1:\r\n print(5)\r\n break\r\n elif cd in dic2:\r\n print(3)\r\n break\r\n else:\r\n print(8)\r\n break\r\n", "import re\r\nfive=re.compile(r'^[a|h][2-7]$')\r\nfive2=re.compile(r'^[b-g][1|8]$')\r\nthree=re.compile(r'[a8|h8|a1|h1]')\r\nx=input()\r\nif five.match(x):print(5)\r\nelif five2.match(x):print(5)\r\nelif three.match(x):print(3)\r\nelse:print(8)\r\n", "position = input()\r\ncol = (int(position[0], 18) - 10) % 7\r\nrow = (int(position[1]) - 1) % 7\r\nif not col and not row:\r\n print(3)\r\nelif not col or not row:\r\n print(5)\r\nelse:\r\n print(8)\r\n", "def moves(s):\r\n if (s == 'a8') or (s == 'h8') or (s == 'a1') or (s == 'h1'):\r\n return 3\r\n if (s[0] == 'a') or (s[0] == 'h') or (s[1] == '1') or (s[1] == '8'):\r\n return 5\r\n return 8\r\ns = str(input())\r\nprint(moves(s))", "def main():\r\n king_position = input().strip()\r\n column = ord(king_position[0]) - ord('a') + 1\r\n row = int(king_position[1])\r\n\r\n moves = 0\r\n for i in [-1, 0, 1]:\r\n for j in [-1, 0, 1]:\r\n if 0 < column + i <= 8 and 0 < row + j <= 8:\r\n moves += 1\r\n\r\n print(moves - 1)\r\n\r\nif __name__ == '__main__':\r\n main()", "s = input()\r\nif s[0] == 'a' and s[1] == '1' or s[0] == 'a' and s[1] == '8' or s[0] == 'h' and s[1] == '1' or s[0] == 'h' and s[1] == '8':\r\n print(3)\r\nelif s[0] == 'a' and 1 < int(s[1]) and int(s[1]) < 8 or s[0] == 'h' and 1 < int(s[1]) and int(s[1]) < 8 or s[1] == '1' and s[0] != 'a' and s[0] != 'h' or s[1] == '8' and s[0] != 'a' and s[0] != 'h':\r\n print(5)\r\nelse:\r\n print(8)\r\n", "# LUOGU_RID: 112484858\na=input()\nx=y=b=0\nif a[0]=='h' or a[0]=='a': x=1\nif a[1]=='8' or a[1]=='1': y=1\nif x==y and x==1: b+=1\nif x==1: b-=3\nif y==1: b-=3\nprint(b+8)", "s = input()\r\nk = s[0]\r\ni = int(s[1])\r\n\r\nif (s in ('a1', 'a8', 'h1', 'h8')):\r\n print(3)\r\nelif (k == 'a' or k == 'h' or i == 1 or i == 8):\r\n print(5)\r\nelse:\r\n print(8)\r\n" ]

[ "n, m, k = map(int, input().split())\r\n\r\nif n % 2 == 0:\r\n print('Marsel')\r\nelse:\r\n divisors = set()\r\n i = 1\r\n while i * i <= m:\r\n if m % i == 0:\r\n divisors.add(i)\r\n divisors.add(m // i)\r\n i += 1\r\n ans = 10 ** 18\r\n for x in divisors:\r\n if x >= k and x != m:\r\n ans = min(ans, x)\r\n if ans < 10 ** 18:\r\n print('Timur')\r\n else:\r\n print('Marsel') ", "from math import sqrt\r\nn, m, k = map(int, input().split())\r\n\r\nif n % 2 == 0:\r\n print('Marsel')\r\n\r\nelse:\r\n a = int(sqrt(m)+1)\r\n flag = 1\r\n for i in range(1, a+1):\r\n if m % i != 0:\r\n continue\r\n if i >= k and m//i > 1:\r\n flag = 0\r\n break\r\n elif i > 1 and m//i >= k:\r\n flag = 0\r\n break\r\n \r\n if flag:\r\n print('Marsel')\r\n else:\r\n print('Timur')\r\n ", "import math\r\n\r\nn, m, k = map(int, input().split())\r\n\r\nif n % 2 == 0:\r\n print(\"Marsel\")\r\nelse:\r\n pos = False\r\n for p in range(1, int(math.sqrt(m)) + 1):\r\n if m % p != 0:\r\n continue\r\n if (k <= (m // p) and p > 1) or (k <= p and m // p > 1):\r\n pos = True\r\n break\r\n \r\n print(\"Timur\" if pos else \"Marsel\")", "n, m, k = map(int, input().split())\n\ndef can_move(m, k):\n if k == 1 and m > 1:\n return True\n\n for i in range(2, int(m ** 0.5) + 1):\n if m % i == 0 and m / i >= k:\n return True\n\n return False\n\n\ndef answer(n, m, k):\n # if n is even, Marsel wins. he just symmetrically repeats moves of Timur\n if n % 2 == 0:\n return \"Marsel\"\n\n # now consider a case of odd n\n assert n % 2 == 1\n\n # if Timur cannot move - he is losing automatically\n if not can_move(m, k):\n return \"Marsel\"\n\n # if he can do a move, he always can split one log into few parts that this\n # parts cannot be splitted again\n return \"Timur\"\n\n\nprint(answer(n, m, k))\n", "def check(a, b, c):\n return (b <= a and a < c)\ndef can(n, m, k):\n if n % 2 == 0:\n return False\n d = 1\n while d*d <= m:\n if m % d == 0 and (check(d, k, m) or check(m/d, k, m)):\n return True\n d += 1\n return False\n\nn, m, k = map(int, input().split(' '))\nprint ('Timur' if can(n, m, k) else 'Marsel')\n", "from math import sqrt\n\ndef winner_beavergame(n, m, k):\n if m == 1: # imposible to play, beacause the length of the logs can't be divided in an integer length\n return \"Marsel\" # then the first player looses and the second one wins\n \n if smallest_divisor_bigger_than_k(m, k) == m: # when the first player can only divide into one part, it's invalid\n return \"Marsel\" # so he looses, and the second one wins\n \n if n % 2 == 0: # view .pdf\n return \"Marsel\"\n \n return \"Timur\"\n\ndef smallest_divisor_bigger_than_k(m, k): # finds the smallest divisor of m bigger than k\n smallest = m\n for i in range(1, int(sqrt(m)) + 1):\n if m % i == 0:\n if i >= k:\n return min(smallest, i) \n elif m / i >= k:\n smallest = min(smallest, m / i)\n return smallest\n \nvariables = input()\nn, m, k = variables.split()\nprint(winner_beavergame(int(n), int(m), int(k)))", "#!/usr/bin/env python3\n\n\ndef main():\n n, m, k = (int(t) for t in input().split())\n\n if n % 2 == 0:\n print(\"Marsel\")\n return\n\n if k == 1 and m > k:\n print(\"Timur\")\n return\n\n t = 2\n while t * t <= m:\n if m % t == 0:\n if m // t >= k:\n print(\"Timur\")\n return\n print(\"Marsel\")\n return\n t += 1\n print(\"Marsel\")\n return\n\nmain()\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, m, k = map(int, input().split())\r\na = [tuple(map(lambda c: c == '*', input().rstrip())) for _ in range(n)]\r\ncnt = [0] * 400\r\n\r\nfor i in range(1, n - 1):\r\n for j in range(1, m - 1):\r\n if not a[i][j]:\r\n continue\r\n for rad, ui, di, lj, rj in zip(range(1, 400), range(i - 1, -1, -1), range(i + 1, n), range(j - 1, -1, -1), range(j + 1, m)):\r\n if all((a[ui][j], a[di][j], a[i][lj], a[i][rj])):\r\n cnt[rad] += 1\r\n\r\nrad = -1\r\nfor i in range(300):\r\n cnt[i + 1] += cnt[i]\r\n if cnt[i] >= k:\r\n rad = i\r\n k -= cnt[i - 1]\r\n break\r\nelse:\r\n print(-1)\r\n exit()\r\n\r\nfor i in range(rad, n - rad):\r\n for j in range(rad, m - rad):\r\n if all((a[i][j], a[i - rad][j], a[i + rad][j], a[i][j - rad], a[i][j + rad])):\r\n k -= 1\r\n if k == 0:\r\n print(f'{i+1} {j+1}\\n{i-rad+1} {j+1}\\n{i+rad+1} {j+1}\\n{i+1} {j-rad+1}\\n{i+1} {j+rad+1}')\r\n exit()\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn, m, k = map(int, input().split())\r\ns = [list(input().rstrip()) for _ in range(n)]\r\nc = 0\r\nfor k0 in range(1, min(n, m)):\r\n for i in range(k0, n - k0):\r\n l0 = min(i, n - i - 1)\r\n si = s[i]\r\n for j in range(k0, m - k0):\r\n if si[j] == \".\":\r\n continue\r\n if si[j - k0] == si[j + k0] == \"*\":\r\n if s[i - k0][j] == s[i + k0][j] == \"*\":\r\n c += 1\r\n if c == k:\r\n ans = [(i + 1, j + 1)]\r\n ans.append((i + 1 - k0, j + 1))\r\n ans.append((i + 1 + k0, j + 1))\r\n ans.append((i + 1, j + 1 - k0))\r\n ans.append((i + 1, j + 1 + k0))\r\n for i in range(5):\r\n ans[i] = \" \".join(map(str, ans[i]))\r\n sys.stdout.write(\"\\n\".join(ans))\r\n exit()\r\nprint(-1)", "n, m, k = map(int, input().split())\r\n\r\nf = [str(input()) for i in range(n)]\r\n\r\nres = []\r\nfor r in range(1, min(n, m)):\r\n for i in range(r, n - r):\r\n for j in range(r, m - r):\r\n if f[i][j] == \"*\":\r\n if f[i - r][j] == \"*\":\r\n if f[i + r][j] == \"*\":\r\n if f[i][j - r] == \"*\":\r\n if f[i][j + r] == \"*\":\r\n k -= 1\r\n if k == 0:\r\n res = [[i, j], [i - r, j], [i + r, j], [i, j - r], [i, j + r]]\r\n for i in res:\r\n print(i[0] + 1, i[1] + 1)\r\n quit()\r\n\r\nprint(-1)\r\n" ]

[ "c=0\r\nv=[2,3,4,5,7,9,11,13,17,19,23,25,29,31,37,41,43,47,49]\r\nfor j in v:\r\n print(j,flush=True)\r\n if input()==\"yes\":\r\n c+=1\r\n if c>=2:\r\n break\r\n\r\nif c >=2:\r\n print(\"composite\")\r\nelse:\r\n print(\"prime\")\r\n\r\n", "print(\"composite\" if sum(input()=='yes' for i in [2,3,4,5,7,9,11,13,17,19,23,25,29,31,37,41,43,47,49] if not print(i))>1 else \"prime\")\n\n\n\n\n\n# Made By Mostafa_Khaled", "m = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 4, 9, 25, 49]\r\nans = 0;\r\nfor i in m:\r\n\tprint(i)\r\n\tif input() == 'yes': \r\n\t\tans += 1\r\n\t\tif ans > 1: \r\n\t\t\tprint('composite')\r\n\t\t\texit()\r\nprint('prime')", "def isprime(n):\r\n if n == 2:\r\n return True\r\n elif n%2 == 0:\r\n return False\r\n else:\r\n return all(n%i for i in range(3,int(n**0.5+1),2))\r\npr = []\r\npr2 = []\r\nfor i in range(2,50):\r\n if isprime(i):\r\n pr.append(i)\r\n pr2.append(i**2)\r\npr2 = (pr2[:4])\r\nkk = False\r\nfor i in range(0,len(pr2)):\r\n print(pr2[i])\r\n s = input()\r\n if s == 'yes':\r\n print('composite')\r\n kk = True\r\n break\r\nif not kk:\r\n cc = 0\r\n for i in range(0,len(pr)):\r\n print(pr[i])\r\n s = input()\r\n if s == 'yes':\r\n cc += 1\r\n else:\r\n pass\r\n if cc > 1:\r\n break\r\n if cc < 2:\r\n print('prime')\r\n else:\r\n print('composite')\r\n", "#This code is contributed by Siddharth\r\nfrom sys import *\r\nfrom bisect import *\r\nfrom math import *\r\nfrom collections import *\r\nfrom heapq import *\r\nfrom itertools import *\r\ninf=10**18\r\nmod=10**9+7\r\n\r\n\r\n\r\n\r\n\r\n# ==========================================> Code Starts Here <=====================================================================\r\n\r\n\r\ndef check(n):\r\n i=2\r\n while i*i<=n:\r\n if n%i==0:\r\n return False\r\n i+=1\r\n return True\r\nsq=[i*i for i in range(2,11)]\r\nprime=[4,9,25,49]\r\nfor i in range(2,51):\r\n if check(i):\r\n prime.append(i)\r\nl=[]\r\n\r\nfor i in range(19):\r\n print(prime[i])\r\n stdout.flush()\r\n s=input()\r\n if s=='yes':\r\n l.append(1)\r\nif len(l)>1:\r\n print(\"composite\")\r\nelse:\r\n print(\"prime\")\r\nstdout.flush()\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n# [4,8,16,32,64 9,27,81 25 49 ]\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\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\nt,c = [4,9,25,49,2,3,5,7,11,13,17,19,23,29,31,37,41,43,47],0\r\nfor x in t:\r\n print(x)\r\n sys.stdout.flush()\r\n c+=input()=='yes'\r\n if c==2:\r\n print('composite')\r\n break\r\nelse: print('prime')", "def SieveOfEratosthenes(n): \r\n \r\n prime = [True for i in range(n+1)] \r\n primes=[]\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 * p, n+1, p): \r\n prime[i] = False\r\n p += 1\r\n \r\n \r\n for p in range(2, n+1): \r\n if prime[p]:\r\n primes.append(p)\r\n return primes\r\ns=SieveOfEratosthenes(102)\r\n\r\nc=0\r\nsq=[j*j for j in s[0:4]]\r\nfor x in sq:\r\n print(x,flush=True)\r\n ans=input()\r\n if ans==\"yes\":\r\n print(\"composite\")\r\n exit()\r\nfor i in s[0:15]:\r\n print(i,flush=True)\r\n ans=input()\r\n if ans==\"yes\":\r\n c+=1\r\nif c>1:\r\n print(\"composite\")\r\n exit()\r\nelse:\r\n print(\"prime\")\r\n exit()\r\n \r\n", "from subprocess import STDOUT\n\n\nx=[2,3,5,7,11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47]\ncount=0\n\nval=-1\nfor i in range(2,11):\n print(i,flush=True)\n# stdout.flush()\n ans=input()\n if ans==\"yes\":\n val=i;\n count+=1\nif count>1:\n print(\"composite\",flush=True)\nelif count==1:\n for i in range(len(x)):\n if x[i]*val<100:\n if x[i]*val>20:\n print(x[i]*val)\n if input()==\"yes\":\n count+=1\n break\n else:\n break\n\n if count>=2:\n print(\"composite\",flush=True)\n else:\n print(\"prime\",flush=True)\nelse:\n print(\"prime\",flush=True)\n\n \t\t \t\t\t\t\t \t \t \t \t \t \t", "import sys;\r\ncc=[2, 3, 5, 7,11,13,17,19,23,29,31,37,41,43,47]\r\nccc={}\r\nt=0\r\nfor x in cc:\r\n print(x)\r\n if input()==\"yes\":\r\n ccc[x]=1\r\n t+=1\r\n st=1\r\n bool=True\r\n if x**2<101:\r\n print(x**2)\r\n if input()==\"yes\":\r\n t+=1\r\n break\r\n \r\nif t>1:\r\n print(\"composite\")\r\n sys.stdout.flush()\r\n exit()\r\nelse:\r\n print(\"prime\")\r\n sys.stdout.flush()\r\n exit()\r\n \r\n", "import sys\r\n\r\nprimes = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47]\r\nf = 0\r\nfor i in primes:\r\n print(i)\r\n if input() == \"yes\":\r\n f += 1\r\n if i * i <= 100:\r\n print(i*i)\r\n if input() == \"yes\":\r\n f += 1\r\n\r\nprint(\"composite\" if f >= 2 else \"prime\")", "def sieve(n):\r\n prime = [False, False] + [True] * (n - 1)\r\n i = 2\r\n while i * i <= n:\r\n if prime[i]:\r\n for j in range(i * i, n + 1, i):\r\n prime[j] = False\r\n i += 1\r\n return [i for i in range(2, n + 1) if prime[i]]\r\n\r\ndef isDiv(n):\r\n print(n)\r\n return int(input()[0] == 'y')\r\n\r\nfor d in (4, 9, 25, 49):\r\n if isDiv(d):\r\n print('composite')\r\n break\r\nelse:\r\n cnt = 0\r\n for p in sieve(50):\r\n cnt += isDiv(p)\r\n print('composite' if cnt > 1 else 'prime')", "import sys\ndef main():\n div = [2, 3, 5, 7, 11, 13, 17, 19, \n 23, 29, 31, 37, 41, 43, 47,\n 4, 9, 25, 49]\n n_div = 0\n for p in div:\n print(p)\n sys.stdout.flush()\n answer = input()\n if answer == \"yes\":\n n_div += 1\n if n_div == 2:\n break\n\n if n_div < 2:\n print(\"prime\")\n else:\n print(\"composite\")\n\nif __name__ == \"__main__\":\n main()\n", "print('cpormipmoes i t e'[sum(input()=='yes'for r in map(print,[2,3,4,5,7,9,11,13,17,19,23,25,29,31,37,41,43,47,49]))<2::2])", "from sys import stdout\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\nPRIMES = [x for x in range(2, 100) if is_prime(x)]\r\n\r\nNORMAL = PRIMES[:15]\r\nSQUARES = [x * x for x in PRIMES[:4]]\r\n\r\nfor ele in SQUARES:\r\n print(ele)\r\n stdout.flush()\r\n x = input()\r\n if x == \"yes\":\r\n print(\"composite\")\r\n exit(0)\r\n\r\nyes = 0\r\nfor ele in NORMAL:\r\n print(ele)\r\n stdout.flush()\r\n x = input()\r\n if x == \"yes\":\r\n yes += 1\r\n\r\nprint(\"prime\" if yes < 2 else \"composite\")\r\n", "import math\r\nfrom collections import Counter,deque\r\nL=lambda:list(map(int,input().split()))\r\nM=lambda:map(int,input().split())\r\nI=lambda:int(input())\r\nIN=lambda:input()\r\nmod=10**9+7\r\ndef s(a):\r\n print(\" \".join(list(map(str,a))))\r\n#______________________-------------------------------_____________________#\r\nl=[2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,4,9,25,49]\r\ncount=0\r\nfor i in l:\r\n print(i)\r\n if input()==\"yes\":\r\n count+=1\r\n if count>1:\r\n print(\"composite\")\r\n exit()\r\nprint(\"prime\")", "import sys\nprimes = [2,3,5,7,11,13,17,19,23,29 \n,31,37,41,43,47]\ndiv = []\nfor p in primes:\n print(p)\n sys.stdout.flush()\n ans = input()\n if ans == \"yes\":\n div.append(p)\n \nif len(div)>1:\n print(\"composite\") # Of atleast two different primes\nelif len(div)==0:\n print(\"prime\") # Never found a divisor<50, therefore it is prime\nelse:\n if div[0]**2>100:\n print('prime')\n else:\n print(div[0]**2)\n sys.stdout.flush()\n ans = input()\n if ans == \"yes\":\n print(\"composite\")\n else:\n print(\"prime\")\n", "from sys import stdout\r\n\r\nprint(4)\r\nstdout.flush()\r\nx = input()\r\nif (x==\"yes\"):\r\n print(\"composite\")\r\n exit(0)\r\nprint(9)\r\nstdout.flush()\r\nx = input()\r\nif (x==\"yes\"):\r\n print(\"composite\")\r\n exit(0)\r\nprint(25)\r\nstdout.flush()\r\nx = input()\r\nif (x==\"yes\"):\r\n print(\"composite\")\r\n exit(0)\r\nprint(49)\r\nstdout.flush()\r\nx = input()\r\nif (x==\"yes\"):\r\n print(\"composite\")\r\n exit(0)\r\ncnt = 0\r\nfor i in [2,3,5,7,11,13,17,19,23,29,31,37,41,43,47]:\r\n print(i)\r\n stdout.flush()\r\n y=input()\r\n if (y==\"yes\"):\r\n cnt+=1\r\nprint(\"prime\" if cnt<2 else \"composite\")", "import sys\r\ndivs = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47]\r\nmax_divider = 50\r\ncnt = 0\r\n\r\ndef is_divider(n) -> bool:\r\n print(n)\r\n sys.stdout.flush()\r\n return input() == \"yes\"\r\n \r\nfor d in divs:\r\n if d > max_divider:\r\n break\r\n \r\n if is_divider(d):\r\n cnt += 1\r\n if cnt == 1:\r\n max_divider = 100 // d\r\n if d <= max_divider:\r\n cnt += is_divider(d*d)\r\n if cnt == 2:\r\n print(\"composite\")\r\n break\r\nif cnt < 2:\r\n print(\"prime\")", "import sys \r\n\r\ndef count(a):\r\n cnt = 0\r\n for x in a:\r\n print(x)\r\n sys.stdout.flush()\r\n s = input()\r\n if s==\"yes\":\r\n cnt += 1\r\n return cnt\r\n\r\na = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 4, 9, 25, 49]\r\nif count(a)>1:\r\n print(\"composite\")\r\n sys.stdout.flush()\r\nelse:\r\n print(\"prime\")\r\n sys.stdout.flush()\r\n", "from sys import stdout\n\nprimes = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53]\nans = 0\nyes = 0\n\nfor x in primes:\n print(x)\n if (input() == \"yes\"):\n yes += 1\n ans = x\n\nif yes > 1:\n print(\"composite\")\n\nif yes == 0:\n print(\"prime\")\n\nif yes == 1:\n if ans <= 10:\n print(ans*ans)\n if(input() == \"yes\"):\n print(\"composite\")\n else:\n print(\"prime\")\n else:\n print(\"prime\")\n", "def is_prime(n):\r\n if n <= 1:\r\n return False\r\n if n <= 3:\r\n return True\r\n if n % 2 == 0 or n % 3 == 0:\r\n return False\r\n i = 5\r\n while i * i <= n:\r\n if n % i == 0 or n % (i + 2) == 0:\r\n return False\r\n i += 6\r\n return True\r\n\r\n\r\n\r\ndef main():\r\n count = 0\r\n for i in range(2, 51):\r\n if is_prime(i):\r\n print(i)\r\n response = input().strip()\r\n if response == \"yes\":\r\n count += 1\r\n\r\n if i * i <= 50:\r\n print(i * i)\r\n response = input().strip()\r\n if response == \"yes\":\r\n count += 1\r\n\r\n if count >= 2:\r\n print(\"composite\")\r\n else:\r\n print(\"prime\")\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n\r\n \r\n", "p=[2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,4,9,25,49]\r\nans = 0\r\nflag = False\r\nfor i in p:\r\n print(i)\r\n k = input()\r\n if k == 'yes':\r\n ans += 1\r\n if ans > 1:\r\n print('composite')\r\n flag = True\r\n break\r\nif not flag:\r\n print('prime')", "check = True\r\nchisla = [2, 3, 4, 5, 7, 9, 11, 13, 17, 19, 23, 25, 29, 31, 37, 41, 43, 47, 49, 64]\r\ncount = 0\r\nfor i in range(len(chisla)):\r\n print(chisla[i])\r\n s = input()\r\n if s == 'yes':\r\n count += 1\r\n if count >= 2:\r\n print('composite', flush = True)\r\n break\r\nif count <= 1:\r\n print('prime', flush = True)", "import sys\r\np=[2,3,5,7,9,11,13,17,19,23,29,31,37,41,43,47,4,9,25,49]\r\nd=0\r\nfor i in range(20):\r\n print(p[i])\r\n sys.stdout.flush()\r\n f=str(input())\r\n if f=='yes':d+=1\r\nif d<=1:print('prime')\r\nelse:\r\n print('composite')\r\nsys.stdout.flush()", "import random, math\nfrom copy import deepcopy as dc\nfrom sys import stdout\n\n\nprimes = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47]\n\n\n\n# Function to take input\ndef input_test():\n\tt = 20\n\ti = 0\n\tc = 0\n\tdivi = -1\n\twhile t > 0 and i < 15:\n\t\tif c:\n\t\t\tif 2 <= primes[i] * divi <= 100:\t\t\t\t\n\t\t\t\tprint(primes[i]*divi)\n\t\t\t\tstdout.flush()\n\t\t\t\tt -= 1\n\t\t\t\tkt = input()\n\t\t\t\tif kt ==\"yes\":\n\t\t\t\t\tc += 1\n\t\t\t\t\tbreak\n\t\t\t\telse:\n\t\t\t\t\ti += 1\n\t\t\telse:\n\t\t\t\tbreak\n\t\telse:\n\t\t\tprint(primes[i])\n\t\t\tstdout.flush()\n\t\t\tt -= 1\n\t\t\tkt = input()\n\t\t\tif kt == \"yes\":\n\t\t\t\tc += 1\n\t\t\t\tdivi = primes[i]\n\t\t\t\ti = 0\n\t\t\telse:\n\t\t\t\ti += 1\n\t\t# print(\"Archit\")\n\tif c >= 2:\n\t\tprint(\"composite\")\n\telse:\n\t\tprint(\"prime\")\n\tstdout.flush()\n\n\n\n# Function to check test my code\ndef test():\n\tpass\n\n\ninput_test()\n# test()", "prime = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47]\r\ncnt = 0\r\nfor n in prime:\r\n print(n, flush=True)\r\n if(input() == \"yes\"):\r\n cnt += 1\r\n if cnt > 1:\r\n print(\"composite\", flush=True)\r\n quit()\r\n if n < 10:\r\n print(n**2, flush=True)\r\n if(input() == \"yes\"):\r\n cnt += 1\r\n if cnt > 1:\r\n print(\"composite\", flush=True)\r\n quit()\r\n\r\nprint(\"prime\")\r\n", "import sys\r\n\r\nresp = list()\r\n\r\nnum = [2,3,5,7,4,9,25,49,11,13,17,19,23,29,31,37,41,43,47,53]\r\n\r\nfor i in num:\r\n print(i)\r\n sys.stdout.flush()\r\n resp.append(input())\r\nif resp.count(\"yes\") <= 1:\r\n print(\"prime\")\r\n sys.stdout.flush()\r\nelse:\r\n print(\"composite\")\r\n sys.stdout.flush()", "c = 0\r\nfor x in [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 4, 9, 25, 36, 49]:\r\n print(x)\r\n if 'yes' == input():\r\n c += 1\r\n if c > 1:\r\n break\r\nprint('prime' if c <= 1 else 'composite', flush=True)", "from sys import stdout\r\np1 = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47]\r\ng = [4, 9, 25, 49]\r\n\r\nans = 0\r\nfor i in range(4):\r\n print(g[i])\r\n stdout.flush()\r\n x = input()\r\n if x==\"yes\":\r\n ans = \"c\"\r\n break\r\n\r\nif ans!=\"c\":\r\n count = 0\r\n for i in p1:\r\n print(i)\r\n stdout.flush()\r\n x=input()\r\n if x==\"yes\":\r\n count+=1\r\n if count==2:\r\n ans=\"c\"\r\n break\r\n\r\nif ans==\"c\":\r\n print(\"composite\")\r\nelse:\r\n print(\"prime\")\r\nstdout.flush()", "from sys import stdout\n\nprimes = [2, 3, 5, 7, 11, 13, 17, 19, 21, 23, 29, 31, 37, 41, 43, 47]\nno_prime = [4, 9, 25, 49]\nflag = True\ncounter = 0\nfor prime in primes:\n print(prime)\n stdout.flush()\n s = input().strip()\n if s == \"yes\":\n counter += 1\n if counter > 1:\n flag = False\n break\n if prime * prime <= 100:\n print(prime * prime)\n stdout.flush()\n s = input().strip()\n if s == \"yes\":\n flag = False\n break\n\nif flag:\n print(\"prime\")\nelse:\n print(\"composite\")\nstdout.flush()\n\n\t\t\t \t \t \t \t\t \t\t\t\t\t \t\t\t\t \t", "import sys\nS = [2, 3, 5, 7, 11, 13, 17, 19, 23,\n 29, 31, 37, 41, 43, 47, 4, 9, 25, 49]\ncnt = 0\nfor s in S:\n print(s)\n sys.stdout.flush()\n x = input()\n if x == \"yes\":\n cnt += 1\nprint(\"composite\" if cnt > 1 else \"prime\")\n", "import sys\r\nfrom math import sqrt\r\ndef pl():\r\n\tl=[]\r\n\tfor i in range(2,101):\r\n\t\tk=[]\r\n\t\tfor j in range(2,int(sqrt(i))+1):\r\n\t\t\tif i%j==0:\r\n\t\t\t\tk+=[j]\r\n\t\tif (k==[]):\r\n\t\t\tl+=[i]\r\n\treturn l\r\ndef main():\r\n\tk=pl()\r\n\tl=[]\r\n\ti=0\r\n\thmm=0\r\n\twhile i<20:\r\n\t\tif len(l)>1:\r\n\t\t\tbreak\r\n\t\tprint(k[hmm])\r\n\t\tsys.stdout.flush()\r\n\t\ts=input()\r\n\t\tif s=='yes' and k[hmm]==2:\r\n\t\t\tprint(4)\r\n\t\t\tsys.stdout.flush()\r\n\t\t\tj=input()\r\n\t\t\tif j=='yes':\r\n\t\t\t\tl+=[k[hmm],4]\r\n\t\t\telse:\r\n\t\t\t\tl+=[k[hmm]]\r\n\t\t\ti+=2\r\n\t\t\thmm+=1\r\n\t\telif s=='yes' and k[hmm]==3:\r\n\t\t\tprint(9)\r\n\t\t\tsys.stdout.flush()\r\n\t\t\tj=input()\r\n\t\t\tif j=='yes':\r\n\t\t\t\tl+=[k[hmm],9]\r\n\t\t\telse:\r\n\t\t\t\tl+=[k[hmm]]\r\n\t\t\ti+=2\r\n\t\t\thmm+=1\r\n\t\telif s=='yes' and k[hmm]==5:\r\n\t\t\tprint(25)\r\n\t\t\tsys.stdout.flush()\r\n\t\t\tj=input()\r\n\t\t\tif j=='yes':\r\n\t\t\t\tl+=[k[hmm],25]\r\n\t\t\telse:\r\n\t\t\t\tl+=[k[hmm]]\r\n\t\t\ti+=2\r\n\t\t\thmm+=1\r\n\t\telif s=='yes' and k[hmm]==7:\r\n\t\t\tprint(49)\r\n\t\t\tsys.stdout.flush()\r\n\t\t\tj=input()\r\n\t\t\tif j=='yes':\r\n\t\t\t\tl+=[k[hmm],49]\r\n\t\t\telse:\r\n\t\t\t\tl+=[k[hmm]]\r\n\t\t\ti+=2\r\n\t\t\thmm+=1\r\n\t\telif s=='yes':\r\n\t\t\tl+=[k[hmm]]\r\n\t\t\ti+=1\r\n\t\t\thmm+=1\r\n\t\telif s=='no':\r\n\t\t\ti+=1\r\n\t\t\thmm+=1\r\n\t\t\tcontinue\r\n\tif len(l)<=1:\r\n\t\tprint('prime')\r\n\t\tsys.stdout.flush()\r\n\telse:\r\n\t\tprint('composite')\r\n\t\tsys.stdout.flush\r\nif __name__=='__main__':\r\n\tmain()", "from sys import stdout\r\n\r\nPRIMES = [x for x in range(2,100) if 0 not in [x%i for i in range(2,x)]]\r\n\r\nNORMAL = PRIMES[:15]\r\nSQUARES = [x*x for x in PRIMES[:4]]\r\n\r\nfor ele in SQUARES:\r\n print(ele)\r\n stdout.flush()\r\n x = input()\r\n if x == \"yes\":\r\n print(\"composite\")\r\n exit(0)\r\n\r\nyes = 0\r\nfor ele in NORMAL:\r\n print(ele)\r\n stdout.flush()\r\n x = input()\r\n if x == \"yes\":\r\n yes += 1\r\n\r\nprint(\"prime\" if yes < 2 else \"composite\")", "l=[2,3,5,7,9,11,13,17,19,23,29,31,37,41,43,47,4,9,25,49]\r\ncnt=0\r\nfor i in range(len(l)):\r\n print(l[i])\r\n s=input()\r\n if (s==\"yes\"):\r\n cnt+=1\r\nif (cnt>=2):\r\n print(\"composite\")\r\nelse:\r\n print(\"prime\")", "import sys\r\n\r\n# Prime between 1 and 100\r\n\r\ndef print_flush(txt):\r\n print(txt)\r\n sys.stdout.flush()\r\n\r\ndef is_prime(x):\r\n\r\n if x == 1:\r\n return False\r\n \r\n if x == 2:\r\n return True\r\n \r\n for j in range(2, x):\r\n if x % j == 0:\r\n return False\r\n \r\n\r\n return True\r\n\r\n\r\n# 15\r\nfifty_primes = []\r\n\r\nfor i in range(1, 51):\r\n if is_prime(i):\r\n fifty_primes.append(i)\r\n\r\none_hundred = [1] * 101\r\n\r\n\r\nbeautiful_prime = 0\r\ncount = 0\r\n# Could optimize by popping but who cares\r\nfor prime in fifty_primes:\r\n print_flush(prime)\r\n\r\n is_divisor = (input() == \"yes\")\r\n\r\n if is_divisor:\r\n beautiful_prime = prime\r\n count += 1\r\n\r\n# One of the primes > 50\r\nif count == 0:\r\n print(\"prime\")\r\n exit()\r\n\r\n# The number is by definition composite\r\nif count > 1:\r\n print(\"composite\")\r\n exit()\r\n\r\n# Only 1 prime was counted\r\n\r\n# If the number is prime^n I would have only counted prime.\r\n\r\n# Powers of 2: 2^6= 32\r\n\r\n# I have 4 questions, let's use em!\r\n\r\npowers = [beautiful_prime**n for n in [2,3,5]]\r\n\r\nfor pow in powers:\r\n if pow > 100:\r\n break\r\n\r\n print_flush(pow)\r\n\r\n is_divisor = (input() == \"yes\")\r\n\r\n if is_divisor:\r\n print(\"composite\")\r\n exit()\r\n\r\nprint(\"prime\")\r\n\r\n\r\n\r\n\r\n\r\n", "m=[2,3,4,5,7,9,11,13,17,19,23,25,29,31,37,41,43,47,49]\nc={\"yes\":0,\"no\":0}\nfor p in m:c[input(f\"{p}\\n\")]+=1\nprint(\"cpormipmoes i t e\"[c[\"yes\"]<2::2])", "# author: ankan2526\r\n\r\nimport math, bisect, heapq\r\n\r\nprimes=[]\r\nfor i in range(2,50):\r\n x=0\r\n for j in range(2,int(i**0.5)+1):\r\n if i%j==0:\r\n x=1\r\n break\r\n if x==0:\r\n primes.append(i)\r\n\r\nfactors=[]\r\nfor i in primes:\r\n print(i,flush=True)\r\n if input()=='yes':\r\n factors.append(i)\r\nif len(factors)==0:\r\n ans='prime'\r\nelif len(factors)>1:\r\n ans='composite'\r\nelse:\r\n if factors[0]>10:\r\n ans='prime'\r\n else:\r\n print(factors[0]**2,flush=True)\r\n if input()=='yes':\r\n ans='composite'\r\n else:\r\n ans='prime'\r\nprint(ans,flush=True)\r\n", "from sys import stdout\r\n\r\n\r\nans = 0\r\nch = [2,4,3,9,5,25,7,49,11,13,17,19,23,29,31,37,41,43,47]\r\nfor i in ch:\r\n print(i)\r\n stdout.flush()\r\n s1 = input()\r\n if s1 == \"yes\":\r\n ans += 1\r\n\r\nif ans > 1:\r\n print(\"composite\")\r\nelse:\r\n print(\"prime\")", "from sys import stdout\r\na = [2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,4,9,25,49] \r\nn = len(a) \r\ny=0\r\nfor i in range(n):\r\n print(a[i])\r\n x = input() \r\n if (x=='yes'):\r\n y+=1 \r\n\r\nif (y==1 or y==0):\r\n print(\"prime\")\r\nelse:\r\n print('composite')\r\nstdout.flush()\r\n", "import math\r\n# test = int(input())\r\n# for t in range(test):\r\n# n,k = map(int, input().split())\r\n# n = int(input())\r\n# a = list(map(int, input().split()))\r\n# s = input()\r\np = [2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53]\r\na = 0\r\nfor i in range(len(p)):\r\n print(p[i], flush=True)\r\n x = input()\r\n if x==\"yes\":\r\n a+=1\r\n if i<4:\r\n print(p[i]*p[i], flush=True)\r\n y = input()\r\n if y==\"yes\":\r\n a+=1\r\n if a>=2:\r\n print(\"composite\")\r\n break\r\nelse:\r\n print(\"prime\")", "prime = [2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53]\nt = 0\nP = 0\nQQQ = 0\nfor i in range(len(prime)):\n print(prime[i],flush=True)\n s = input()\n if s == \"yes\":\n t = 1\n QQQ = i\n P = prime[i]\n break\nif t == 0:\n print(\"prime\",flush=True)\nelse:\n U = 0\n for i in range(QQQ,len(prime)):\n if P * prime[i] > 100:\n print(\"prime\",flush=True)\n exit()\n if i == QQQ:\n print(prime[QQQ]**2)\n s = input()\n if s == \"yes\":\n U = 1\n print(\"composite\",flush=True)\n exit()\n else:\n print(prime[i])\n s = input()\n if s == \"yes\":\n U = 1\n print(\"composite\",flush=True)\n exit()", "import sys\ninput = sys.stdin.readline\nflush = sys.stdout.flush\n\ndef query(x):\n print(x)\n flush()\n y = input()[:-1]\n return 1 if y == \"yes\" else 0\n \nA = [2, 3, 4, 5, 7, 9, 11, 13, 17, 19, 23, 25, 29, 31, 37, 41, 43, 47, 49]\ncnt = 0\nfor a in A:\n cnt += query(a)\nprint(\"composite\" if cnt >= 2 else \"prime\")", "from sys import stdout\r\nPRIMES = [x for x in range(2,100) if 0 not in [x%i for i in range(2,x)]]\r\nNORMAL=PRIMES[:15]\r\nSQUARES=[x**2 for x in PRIMES[:4]]\r\nfor ele in SQUARES:\r\n print(ele)\r\n stdout.flush()\r\n x=input()\r\n if x=='yes':\r\n print('composite')\r\n exit()\r\nyes=0\r\nfor ele in NORMAL:\r\n print(ele)\r\n stdout.flush()\r\n x=input()\r\n if x=='yes':\r\n yes+=1\r\n if yes==2:\r\n print('composite')\r\n exit()\r\nprint('prime')", "primes = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 4, 9, 25, 49]\r\ncnt = 0\r\nfor p in primes:\r\n print(p, flush = True)\r\n res = input()\r\n if res == \"yes\":\r\n cnt += 1\r\nif cnt > 1:\r\n print(\"composite\")\r\nelse:\r\n print(\"prime\")", "import sys\r\nl = []\r\nfor i in [2,3,5,7,11,13,17,19,23,29,31,37,41,43,47]:\r\n print(i)\r\n sys.stdout.flush()\r\n l.append(input())\r\nc = 0\r\nx = 0\r\nfor i in range(15):\r\n if l[i] == 'yes':\r\n c += 1\r\n x = [2,3,5,7,11,13,17,19,23,29,31,37,41,43,47][i]\r\nif c == 0:\r\n print('prime')\r\nelif c >= 2:\r\n print('composite')\r\nelif x < 10:\r\n for i in range(4):\r\n if l[i] == 'yes':\r\n print([2,3,5,7][i]**2)\r\n sys.stdout.flush()\r\n if input() == 'yes':\r\n print('composite')\r\n else:\r\n print('prime')\r\nelse:\r\n print('prime')\r\nsys.stdout.flush()", "p = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 4, 9, 25, 49]\r\n\r\ny = 0\r\n\r\nfor el in p:\r\n print(el)\r\n\r\n ans = input()\r\n\r\n if ans == 'yes':\r\n y += 1\r\n\r\n if y > 1:\r\n\r\n print('composite')\r\n\r\n exit(0)\r\n\r\nprint('prime')", "import sys\r\na = [0 for i in range(101)]\r\nfor i in range(2, 101):\r\n if a[i] == 0:\r\n for j in range(i * i, 101, i):\r\n a[j] = 1\r\ndividers = [_ for _ in range(2, 48) if a[_] == 0]\r\n\r\n\r\ndef req(arg):\r\n print(arg, flush=True)\r\n s = input()\r\n return s == \"yes\"\r\n\r\n\r\ncnt = 0\r\nfor i in dividers:\r\n if req(i):\r\n if i * i <= 100 and req(i * i):\r\n print(\"composite\", flush=True)\r\n sys.exit()\r\n else:\r\n cnt += 1\r\n if cnt == 2:\r\n print(\"composite\", flush=True)\r\n sys.exit()\r\nprint(\"prime\", flush=True)", "p = [2,3,4,5,7,9,11,13,17,19,23,25,29,31,37,41,43,47,49]\r\n\r\nk = 0\r\nfor i in p :\r\n print(i)\r\n if input() == \"yes\" :\r\n k += 1\r\n\r\nif k >= 2 :\r\n print(\"composite\")\r\nelse :\r\n print(\"prime\")\r\n", "import sys\ndef query(n):\n print(n)\n sys.stdout.flush()\n return input() == 'yes'\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 ]\ndivisors = []\ni = 0\nk = 1\nfor _ in range(18):\n n = pow(primes[i], k)\n if n <= 100 and query(n):\n divisors.append(n)\n k += 1\n else:\n k = 1\n i += 1\nprint('prime' if len(divisors) <= 1 else 'composite')\n\t \t \t\t\t\t\t \t\t\t\t \t\t\t\t \t\t\t\t", "from sys import stdout\r\nl = [2, 4, 3, 9, 5, 25, 7, 49, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53]\r\nq = [0] * 20 \r\nfor i in range(20):\r\n print(l[i])\r\n stdout.flush()\r\n if(input() == 'yes'):\r\n q[i] = 1 \r\n else:\r\n q[i] = 0 \r\nc = q.count(1)\r\nif(c <= 1):\r\n print(\"prime\")\r\nelse:\r\n print(\"composite\")\r\nstdout.flush()\r\n", "def prost(n):\r\n for i in range(2,int(n**0.5+1)):\r\n if n%i==0 and i!=n:\r\n return False\r\n return True\r\ndels=set()\r\nque=0\r\nfor i in range(2,60):\r\n if prost(i):\r\n print(i)\r\n if que>18:\r\n break\r\n an=input()\r\n que+=1\r\n if an=='yes':\r\n if i*i<100:\r\n print(i*i)\r\n que+=1\r\n if que > 18:\r\n break\r\n if input()=='yes':\r\n print('composite')\r\n exit()\r\n dels.add(i)\r\nif len(dels)<2:\r\n print('prime')\r\nelse:\r\n print('composite')", "print(\"composite\" if sum(input() == 'yes' for i in [\r\n 2, 3, 4, 5, 7, 9, 11, 13, 17, 19, 23, 25, 29, 31, 37, 41, 43, 47, 49] if not print(i)) > 1 else \"prime\")\r\n", "primes = [2, 3, 5, 7, 11, 13, 17, 19, 21, 23, 29, 31, 37, 41, 43, 47]\n\ndef is_divisible(n):\n print(n)\n str_input = input()\n return str_input == \"yes\"\n\n\ncont = 0\nfor i in primes:\n if is_divisible(i):\n cont += 1\n if cont >= 2:\n print(\"composite\")\n exit(0)\n if i <= 7 and is_divisible(i * i):\n cont += 1\n if cont >= 2:\n print(\"composite\")\n exit(0)\n\nprint(\"prime\")\n\n\t\t \t \t\t \t \t \t \t\t \t \t\t\t\t", "counter = 0;\r\nfor i in [2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,4,9,25,49]:\r\n print(i);\r\n counter += (input() == 'yes');\r\n if counter > 1:\r\n print(\"composite\");\r\n break;\r\nelse:\r\n print(\"prime\");", "import sys\r\n\r\nk = 0\r\n\r\n\r\ndef resheto(m):\r\n a = [int(i) for i in range(11, 100) if i % m == 0]\r\n for i in range(2, 10):\r\n if i == m:\r\n continue\r\n for j in range(len(a)):\r\n if a[j] != 0:\r\n if a[j] % i == 0:\r\n a[j] = 0\r\n a = [a[i] for i in range(len(a)) if a[i] != 0]\r\n return a\r\n\r\n\r\nfor i in range(2, 10):\r\n print(i)\r\n sys.stdout.flush()\r\n put = input()\r\n if put == 'yes':\r\n k += 1\r\n chislo = i\r\n\r\nif k == 0:\r\n print('prime')\r\n sys.stdout.flush()\r\nelif k >= 2:\r\n print('composite')\r\n sys.stdout.flush()\r\nelse:\r\n a = resheto(chislo)\r\n for i in range(len(a)):\r\n print(a[i])\r\n sys.stdout.flush()\r\n put = input()\r\n if put == 'yes':\r\n print('composite')\r\n sys.stdout.flush()\r\n exit(0)\r\n print('prime')\r\n sys.stdout.flush()", "def main():\r\n prime_numbers = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47]\r\n\r\n for el in (4, 9, 25, 49):\r\n print(el)\r\n if input() == \"yes\":\r\n print(\"composite\")\r\n return\r\n\r\n counter = 0\r\n for el in prime_numbers:\r\n print(el)\r\n if input() == \"yes\":\r\n counter += 1\r\n\r\n print(\"composite\") if counter > 1 else print(\"prime\")\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()", "prime=[1 for i in range(101)]\r\nprime[0]=0\r\nprime[1]=0\r\nfor i in range(2,101):\r\n if prime[i]==1:\r\n for j in range(i*i,101,i):\r\n prime[j]=0\r\nans=[]\r\nfor i in range(2,101):\r\n if prime[i]:\r\n ans.append(i)\r\nans=ans[:-9]\r\nans.append(4)\r\nans.append(9)\r\nans.append(25)\r\nans.append(49)\r\n#print(len(ans))\r\n#print(ans)\r\ncount=0\r\nfor i in ans:\r\n print(i,flush=True)\r\n s=input()\r\n if s==\"yes\":\r\n count+=1\r\nif count<=1:\r\n print(\"prime\",flush=True)\r\nelse:\r\n print(\"composite\",flush=True)\r\n\r\n", "from sys import *\r\nl=[2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,4,9,25,49]\r\ns=0\r\nfor i in range(len(l)):\r\n print(l[i])\r\n stdout.flush()\r\n a=input()\r\n if(a==\"yes\"):\r\n s+=1\r\n if(s>=2):\r\n print(\"composite\")\r\n exit(0)\r\nprint(\"prime\")\r\n\r\n", "import sys\r\nprimes=[2,3,5,7,11,13,17, 19, 23, 29, 31, 37, 41, 43, 47]\r\nprimes2=[2,3,5,7]\r\nkol=0\r\ni=0\r\nwhile i<len(primes):\r\n sys.stdout.write(str(primes[i])+'\\n')\r\n sys.stdout.flush()\r\n a=sys.stdin.readline()\r\n if a=='yes\\n':\r\n kol+=1\r\n i+=1\r\ni=0\r\nwhile i<len(primes2):\r\n sys.stdout.write(str(primes2[i]**2)+'\\n')\r\n sys.stdout.flush()\r\n a=sys.stdin.readline()\r\n if a=='yes\\n':\r\n kol+=1\r\n i+=1\r\nif kol>1:\r\n sys.stdout.write('composite'+'\\n')\r\n sys.stdout.flush()\r\nelse:\r\n sys.stdout.write('prime'+'\\n')\r\n sys.stdout.flush()\r\n \r\n\r\n\r\n", "import sys\n\np = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47]\n\ndef ask(x):\n\tprint(x)\n\tsys.stdout.flush()\n\n\treturn input()\t\n\ncnt = 0\nfor x in p:\n\n\tresp = ask(x)\n\tif resp == \"yes\":\n\t\tcnt += 1\n\n\t\tif x*x <= 100 and ask(x*x) == \"yes\":\n\t\t\tcnt += 1\n\nif cnt <= 1:\n\tprint(\"prime\")\nelse:\n\tprint(\"composite\")\n\nsys.stdout.flush()", "primes = [ 2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41,\n 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97]\n\nnormal = [x for x in primes[:15]]\nsquares = [x ** 2 for x in primes[:4]]\n# print(squares, normal)\n\nfor n in squares:\n print(n)\n ans = input()\n if \"yes\" in ans:\n exit(print(\"composite\"))\n\nans = 0\nfor n in normal:\n print(n)\n a = input()\n if a == \"yes\":\n ans += 1\nprint([\"composite\", \"prime\"][ans < 2])\n", "def is_prime(n):\r\n for i in range(2, int(n**.5)+1):\r\n if n % i == 0:\r\n return False\r\n return True\r\n\r\ndef query(n):\r\n if n > 100:\r\n return 0\r\n print(n)\r\n return 1 if input() == \"yes\" else 0\r\n\r\ncnt = 0\r\nfor n in range(2, 50):\r\n if not is_prime(n):\r\n continue\r\n if query(n) == 1:\r\n cnt += 1\r\n cnt += query(n*n)\r\n if cnt > 1:\r\n print(\"composite\")\r\n break\r\nelse:\r\n print(\"prime\")\r\n", "def f():\r\n\ta = [2, 4, 3, 9, 5, 25, 7, 49, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47]\r\n\tprint('\\n'.join(map(str,a)))\r\n\tres = 0\r\n\tfor i in a:\r\n\t\tres += input() == 'yes'\r\n\tprint('composite' if res > 1 else 'prime')\r\nf()", "def prsh(N):\r\n prime = [2]\r\n for L in range(3,N):\r\n for p in prime:\r\n if not L % p:\r\n break\r\n if p > L**(1/2):\r\n prime.append(L)\r\n break\r\n return prime\r\n\r\nPP = prsh(50)\r\nSQ = [4, 9, 25, 49]\r\nans = 'prime'\r\nfor sq in SQ:\r\n print(sq)\r\n if input() == 'yes':\r\n ans = 'composite'\r\ncnt = 0\r\nfor p in PP:\r\n print(p)\r\n if input() == 'yes':\r\n cnt += 1\r\nif cnt > 1:\r\n ans = 'composite'\r\nprint(ans)", "yes = 0\r\nfor i in [2,3,5,7]:\r\n print(i)\r\n ans = input()\r\n if ans[0] == \"y\":\r\n if(yes ==1):\r\n print(\"composite\")\r\n exit(0)\r\n print(i*i)\r\n yes+=1\r\n ans = input()\r\n if(ans[0] == \"y\"):\r\n print(\"composite\")\r\n exit(0)\r\nl = [11,13,17,19,23,29,31,37,41,43,47]\r\nif(yes== 1):\r\n for i in l:\r\n print(i)\r\n ans = input()\r\n if (ans[0] == \"y\"):\r\n print(\"composite\")\r\n exit(0)\r\nprint(\"prime\")" ]

[ "n=int(input())\r\nx=list(map(int, input().split()))\r\ny=set(x)\r\nmaxx=[]\r\nfor i in y:\r\n maxx.append(x.count(i))\r\nprint(max(maxx), len(y))", "n = int(input())\r\na = [int(a) for a in input().split()]\r\ncount = 1\r\nc = []\r\nm = []\r\n\r\nfor i in range(0,n):\r\n\tb = a.count(a[i])\r\n\tif a[i] not in m:\r\n\t\tm.append(a[i])\r\n\tc.append(b)\r\nprint(max(c), len(m))\t", "n=int(input())\r\nlst=list(map(int,input().split(' ')))\r\n\r\nlstc={}\r\nfor i in range(n):\r\n if(lst[i] in lstc.keys()):\r\n continue\r\n else:\r\n count=0\r\n for j in range(n):\r\n if(lst[i]==lst[j]):\r\n count+=1\r\n lstc[lst[i]]=count\r\n \r\nheight=max(lstc.values())\r\nprint(height,len(lstc.values()))", "from collections import Counter\r\nn=int(input())\r\ns=list(map(int,input().split()))\r\nlst=Counter(s)\r\nprint(max(lst.values()),len(lst))", "n = int(input())\r\n#n, m = map(int, input().split())\r\n#s = input()\r\nc = list(map(int, input().split()))\r\nc.sort()\r\nl = 0\r\nk = 0\r\np = set()\r\nfor i in c:\r\n if c.count(i) > l:\r\n l = c.count(i)\r\n if not i in p:\r\n k += 1\r\n p.add(i)\r\nprint(l, k)", "n = int(input())\r\narr = list(map(int, input().split()))\r\nMAX = 1024\r\ntowers = [0] * MAX\r\nfor e in arr:\r\n towers[e] += 1\r\n \r\n\r\nprint(max(towers), MAX - towers.count(0))", "nums = int(input())\r\nlist2 = []\r\nlist1 = [int(i) for i in input().split()]\r\nfor i in list1:\r\n list2.append(list1.count(i))\r\nprint(max(list2), len(set(list1)))\r\n", "N = int(input())\r\nl = [int(i) for i in input().split()]\r\nprint(max([l.count(i) for i in l]),len(set(l)))", "#\\\\\\\r\nn=int(input())\r\na=[int(i) for i in input().split()]\r\nr1=len(list(set(a)))\r\nr2=0\r\nfor i in range(len(a)):\r\n if a.count(a[i])>r2:\r\n r2=a.count(a[i])\r\nprint(r2,r1)\r\n#\\\\\\\r\n\r\n", "n = int(input())\nlengths = list(map(int, input().split()))\ntowers = {}\n\nfor length in lengths:\n if str(length) in towers.keys():\n towers[str(length)] += 1\n else:\n towers[str(length)] = 1\n\nmax_height = 0\nnum_towers = 0\nfor key in towers.keys():\n if towers[key] > max_height:\n max_height = towers[key]\n num_towers += 1\n\nprint(max_height, num_towers)\n", "input()\r\n*b, = map(int, input().split())#magic\r\n#print(b[1])\r\n#print(type(b))\r\na = sorted(b, key = b.count)\r\n#print(a)\r\nprint(a.count(a[-1]), len(set(a)))", "\r\nn = int(input())\r\nbarras = input().split()\r\n\r\ntotal_torres = 0\r\ntorre_maxima = 0\r\ntorres = dict()\r\n\r\nfor i in range(n):\r\n num = barras[i]\r\n torres[num] = torres.get(num,0) + 1\r\n if torres[num] == 1:\r\n total_torres = total_torres + 1\r\n if torres[num] > torre_maxima:\r\n torre_maxima = torres[num]\r\n \r\nrpta = str(torre_maxima) + ' ' + str(total_torres) \r\nprint(rpta)", "# -*- coding: utf-8 -*-\n\nn = int(input())\nl = list(map(int, input().split()))\nhas = [0 for i in range(1010)]\nlargest = 0\ntot = 0\n\nfor x in l:\n has[x] += 1\nfor i in range(1010):\n if has[i]:\n tot += 1\n largest = max(largest, has[i])\nprint(largest, tot, end=' ')\n", "n = int(input())\r\ns = list(map(int, input().split()))\r\nd = [0 for i in range(1001)]\r\n\r\nmaxh = 0\r\nfor i in range(n):\r\n d[s[i]] += 1\r\n maxh = max(maxh, d[s[i]])\r\n\r\nprint(maxh, 1001 - d.count(0))\r\n", "s = int(input())\r\na = input().split()\r\nb = []\r\nfor i in range(s):\r\n b.append(int(a[i]))\r\nc = set(b)\r\nn = len(c)\r\nq = 0\r\nfor i in c:\r\n p = 0\r\n for j in range(s):\r\n\r\n if i == b[j]:\r\n p += 1\r\n if p > q:\r\n q = p\r\nprint(q, n)", "n = int(input())\r\na = [int(i) for i in input().split()]\r\nb = dict()\r\nfor i in a:\r\n b[i] = b.get(i, 0) + 1\r\nprint(max(b.values()), len(b.keys()))", "n = int(input())\r\nline = [int(i) for i in input().split()]\r\nbars = {}\r\nfor i in line:\r\n if i not in bars:\r\n bars[i] = 1\r\n else:bars[i] += 1\r\nprint(max(bars.values()),end=' ')\r\nprint(len(bars.keys()))", "\r\nn = int(input())\r\nl = list(map(int, input().split()))\r\n\r\nse = len(set(l))\r\n\r\nh = []\r\nfor i in l:\r\n\tlt = l.count(i)\r\n\th.append(lt)\r\n\r\nprint(max(h), se)", "# Anuneet Anand\r\n \r\nn = int(input())\r\nA = list(map(int,input().split()))\r\nA.sort()\r\n \r\nD = [0 for i in range(1001)]\r\nfor i in A:\r\n\tD[i]+=1\r\n \r\nc=0\r\nfor i in D:\r\n\tif i>0:\r\n\t\tc=c+1\r\n \r\nprint(max(D),c)\r\n", "from collections import defaultdict\r\nN = int(input())\r\nsize = input()\r\nsize = size.split()\r\n\r\nukuran = defaultdict(list)\r\nfor i in size:\r\n\tukuran[i].append(1)\r\n\r\nmax = 0\r\nfor key in ukuran:\r\n\tif len(ukuran[key]) > max:\r\n\t\tmax = len(ukuran[key])\r\n\r\nprint(max,len(ukuran))", "n = int(input())\r\nl = list(map(int,input().split()))\r\ns = list(set(l))\r\nl = sorted(l)\r\na = []\r\nk = 0\r\nfor i in range(len(s)):\r\n for j in range(len(l)):\r\n if s[i] == l[j]:\r\n k += 1\r\n a.append(k)\r\n k = 0\r\nprint(max(a),len(s))", "n = int(input())\r\nl = list(map(int, input().split()))\r\ndic = {}\r\nfor i in l:\r\n dic[i] = dic.get(i, 0) + 1\r\nprint(max(dic.values()), len(set(l)))", "from collections import defaultdict\r\nn = int(input())\r\nbars = list(map(int,input().split()))\r\nmaps = defaultdict(int)\r\ncount = 0\r\nfor bar in bars:\r\n if bar not in maps:\r\n count += 1\r\n maps[bar] += 1\r\nm = max(maps.values())\r\nprint(m,count)\r\n", "import sys\nfrom collections import Counter\n\n\nn = sys.stdin.readline()\nbars = Counter(list(map(int, sys.stdin.readline().strip().split())))\n\nprint(bars.most_common()[0][1], len(bars.keys()))\n", "a = int(input())\nl = [int(i) for i in input().split()]\n\nans2 = len(set(l))\n\nl1 = {}\nmaxel = 0\nfor i in l:\n if i not in l1:\n l1[i] = 0\n l1[i] += 1\n if l1[i] > maxel:\n maxel = l1[i]\nprint(maxel, ans2)\n\n\n\n", "n, maxValue, dict = int(input()), 0, {}\r\n\r\nfor key in [int(item) for item in input().split(' ')]:\r\n if key in dict:\r\n dict[key] += 1\r\n else:\r\n dict[key] = 1\r\n\r\n if maxValue < dict[key]:\r\n maxValue = dict[key]\r\n\r\nprint(f'{maxValue} {len(dict)}')\r\n", "n = int(input ())\r\nans=0\r\nh=ans2=1\r\na = [int(x) for x in input().split()]\r\na.sort()\r\nprev=-1\r\nfor i in a:\r\n\tif prev!=i:\r\n\t\tans+=1\r\n\t\th=1\r\n\telse:\r\n\t\th+=1\r\n\t\tans2=max(h,ans2)\r\n\tprev=i\r\nprint(ans2,ans)", "n=int(input())\r\ns=[]\r\nk=[]\r\na=list(map(int,input().split()))\r\nfor i in a:\r\n if i not in s:\r\n s.append(i)\r\n k.append(a.count(i))\r\n l=max(k)\r\nprint(l,len(s))", "from collections import Counter as c\r\ninput(); l=list(map(int,input().split())); k=c(l).values(); print(max(k),len(k))", "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\n\r\ninput = lambda: sys.stdin.readline()\r\n\r\nx = int(input())\r\ny = sorted(list(map(int ,input().split())))\r\ns = Counter(y)\r\nmx = 0\r\nfor i in s :\r\n mx = max(mx , s[i])\r\n x -= s[i]-1\r\nprint(mx , x)", "#little vasya\nn=int(input())\nl=list(map(int,input().split(' ')))\nc=1\nd=[]\nfor x in l:\n k=l.count(x)\n d.append(k)\nj=max(d)\ng=[]\nfor x in l:\n if x not in g:\n g.append(x)\na=[j,len(g)]\nprint(*a)\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\nl = list(map(int,input().split()))\r\ns = set(l)\r\nmaxx_count = 0\r\nfor i in s:\r\n if l.count(i)>=maxx_count:\r\n maxx_count = l.count(i)\r\nprint(f\"{maxx_count} {len(s)}\")", "\r\nfrom collections import Counter\r\nn = int(input())\r\na = list(map(int,input().split()))\r\nx = Counter(a)\r\nprint(max(x.values()),len(x))\r\n", "n = int(input())\r\nL = [int(s) for s in input().split()]\r\nLen = {}\r\n\r\nfor elem in L:\r\n if elem in Len.keys():\r\n Len[elem] += 1\r\n else:\r\n Len[elem] = 1\r\nMAX = 0\r\nfor elem in Len.keys():\r\n if MAX < Len[elem]:\r\n MAX = Len[elem]\r\nprint(MAX, len(Len))\r\n", "n = int(input())\nlst = [int(i) for i in input().split()]\nset1 = set(lst)\nc = max(map(lst.count, set1))\n\nprint(c, len(set1))\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()[:n]))\r\nd = {}\r\nmax = 1\r\nfor i in arr:\r\n if i in d:\r\n d[i] += 1\r\n if max < d[i]:\r\n max = d[i]\r\n else:\r\n d[i] = 1\r\nprint('{0} {1}'.format(max, len(d)))", "from collections import Counter\r\nn=int(input())\r\n*a,=map(int,input().split())\r\nprint(max(Counter(a).values()),len(set(a)))", "n=int(input())\r\nlist1 = list(map(int,input().split()))\r\nk = l = b = 0\r\nfor i in list1:\r\n c = list1.count(i)\r\n if c > l:\r\n l = c\r\nb = len(set(list1))\r\nprint(l,b)", "inf = -10000000000001\n\ndef merge(n1, L, n2, R, a):\n L.append(inf)\n R.append(inf)\n i = j = k = 0\n\n while (i < n1 or j < n2):\n if L[i] > R[j]:\n a[k] = L[i]\n i += 1\n else:\n a[k] = R[j]\n j += 1\n k += 1\n\n\ndef mergeSort(n, a):\n if n > 1:\n n1 = n // 2\n n2 = n - n1\n L = a[:n1]\n R = a[n1:]\n\n mergeSort(n1,L)\n mergeSort(n2,R)\n merge(n1,L,n2,R,a)\n\nn = int(input())\na = list(map(int, input().split()))\nmergeSort(n, a)\n\nm = 1\ncnt = 1\ntmp = 0\ntowers = 0\nfor x in a:\n if (x == tmp):\n cnt += 1\n if (cnt > m):\n m = cnt\n else:\n cnt = 1\n tmp = x\n towers += 1\n\nprint(m, towers)\n\n", "input()\r\nbars = input()\r\ntowers = [0 for x in range(1000)]\r\nfor c in bars.split(\" \"):\r\n towers[int(c)-1] += 1\r\ntowersc = 0\r\nhighest = 0\r\nfor tower in towers:\r\n if tower > 0:\r\n towersc += 1\r\n if tower > highest:\r\n highest = tower\r\nprint(str(highest)+\" \"+str(towersc))", "n =int(input()) \r\nl = list(map(int , input().split())) \r\nmx= 0\r\nfor i in l : \r\n x= l.count(i)\r\n mx = max(x,mx)\r\nprint(mx , len(set(l)))", "n=int(input())\r\nyi=list(map(int,input().split()))\r\nd=dict()\r\na=n\r\nfor i in range(n):\r\n if(yi[i] in d.keys()):\r\n d[yi[i]]+=1\r\n a-=1\r\n else:\r\n d[yi[i]]=1\r\np=max(d.values())\r\nprint(p,\" \",a)", "from collections import Counter\r\nn=int(input())\r\nc=list(map(int,input().split()))\r\nd=set(c)\r\nm=Counter(c).most_common()\r\nprint(m[0][1],len(d))\r\n", "\r\nimport sys\r\nimport math\r\nfrom array import *\r\n\r\nsz = int(input())\r\nall_line = input()\r\nlist = [int(num) for num in all_line.split()]\r\n\r\nFreq = {}\r\nmx = 0\r\nfor num in list:\r\n if num in Freq:\r\n Freq[num] += 1\r\n else:\r\n Freq[num] = 1\r\n mx = max(mx,Freq[num])\r\nprint(mx, end = ' ') ; print(len(Freq))\r\n\r\nsys.exit()\r\n", "import sys\ninput = sys.stdin.readline\n#print = sys.stdout.write\ndef main():\n\tn = int(input())\n\tl = list(map(int,input().split()))\n\ttab = 1001*[0]\n\tfor i in l:\n\t\ttab[i] +=1\n\tm = tab[0]\n\tfor i in range(1001):\n\t\tif tab[i] > m:\n\t\t\tm = tab[i]\n\tprint(m,len(set(l)))\n\t\nmain()\n", "n = int(input())\r\nl = list(map(int,input().split()))\r\n\r\nhigh = 1\r\ntower = n\r\nmaximum = 1\r\n\r\nl.sort()\r\n\r\nfor i in range(1,n):\r\n\tif l[i]==l[i-1]:\r\n\t\ttower-=1\r\n\t\thigh+=1\r\n\telse:\r\n\t\tif high>maximum:\r\n\t\t\tmaximum=high\r\n\t\thigh=1\r\nif high>maximum:\r\n\tmaximum=high\r\n\r\nprint(maximum,tower)", "'''\r\nCreated on Apr 29, 2016\r\nGmail: [email protected]\r\n@author: Md. Rezwanul Haque\r\n'''\r\nn = int(input())\r\nl = [int(i)for i in input().split()]\r\n#l = list(map(int,input().split()))\r\n\r\n_max = 0\r\nfor i in set(l):\r\n #print(l.count(i))\r\n _max = max(_max,l.count(i))\r\nnum = len(set(l))\r\nprint(_max,num)\r\n", "bars = int(input())\r\nstring = input()\r\nlengths = string.split(\" \")\r\nfor x in range(bars):\r\n lengths[x] = int(lengths[x])\r\nunique = set(lengths)\r\nheights = []\r\nfor x in unique:\r\n heights.append(lengths.count(x))\r\nprint(\"%d %d\" % (max(heights), len(unique)))", "a = {}\r\nn = int(input())\r\nd = list(map(int, input().split()))\r\nfor i in d:\r\n try:\r\n a[i] += 1\r\n except :\r\n a[i] = 1\r\nk = [a[i] for i in list(a)]\r\nprint(max(k), len(a))\r\n", "n = int(input())\r\nnum = list(map(int, input().split()))\r\nd = {}\r\nfor i in num:\r\n if i not in d:\r\n d[i] = 1\r\n else:\r\n d[i] += 1\r\nprint(max(d.values()), len(d))", "import math, os, sys\r\nimport string, re\r\n\r\nfrom itertools import *\r\nfrom collections import Counter\r\nfrom operator import mul\r\n\r\ndef inputint():\r\n return int(input())\r\n\r\ndef inputarray(func=int):\r\n return map(func, input().split())\r\n\r\ndef inputarray2(n, func=int):\r\n for _ in range(n):\r\n yield func(input())\r\n\r\nn = inputint()\r\nA = groupby(sorted(inputarray()))\r\n\r\nnum, height = 0, 0\r\nfor key, group in A:\r\n num = num + 1\r\n xheight = sum(map(lambda x: 1, group))\r\n height = max(height, xheight)\r\n\r\nprint('%d %d' % (height, num))\r\n\r\n", "amt = int(input())\n\n\n\nnums = [int(i) for i in input().split()]\n\namtoftowers = len(set(nums))\ndct = {}\nfor i in nums:\n try:\n dct[i] += 1\n except:\n dct[i] = 1\n\nprint(max(dct.values()))\nprint(amtoftowers)", "import collections\r\n\r\nn = int(input())\r\n\r\ndata = list(map(int, input().split()))\r\nmemo = dict(collections.Counter(data))\r\nprint(max(memo.values()), len(memo.keys()))", "import statistics\r\nfrom statistics import mode\r\nb=int(input())\r\na=list(map(int,input().split()))\r\nc=a.count(mode(a))\r\nd=set(a)\r\nprint(f'{c} {len(d)}')", "n=int(input());c=0;d=0\r\nx=[int(x) for x in input().split()]\r\np=list(set(x))\r\nfor i in range(len(p)):\r\n c=x.count(p[i])\r\n if(c>d):\r\n d=c\r\nprint(d,len(p))\r\n", "a = int(input())\r\nb = list(map(int, input().split()))\r\ns = []\r\nr = []\r\nfor n in b:\r\n if n not in s:\r\n r.append(b.count(n))\r\n s.append(n)\r\nprint(max(r), end=\" \")\r\nprint(len(r))\r\n", "n = int(input())\r\nlistTowers = list(map(int, input().split(' ')))\r\nlistTemp = list(set(listTowers))\r\nif(len(listTemp)== n):\r\n print(str(1)+ ' '+ str(n))\r\nelse:\r\n maxCount = 0\r\n for index in listTemp:\r\n maxCount = max(maxCount,listTowers.count(index))\r\n print(str(maxCount)+' '+ str(len(listTemp)))\r\n\r\n\r\n", "x = int(input())\r\nbarl = list(map(int, input().split()))\r\ndic = {}\r\nmaxbar = \"A\"\r\nfor i in barl:\r\n if i not in dic:\r\n if maxbar==\"A\":\r\n maxbar = barl.count(i)\r\n elif barl.count(i)>maxbar:\r\n maxbar = barl.count(i)\r\n dic.update({i:barl.count(i)})\r\nprint(maxbar, len(dic))", "input()\r\nkeys = []\r\nvalues = []\r\nmaxValue = 0\r\nfor item in input().split(' '):\r\n ind = 0\r\n if item in keys:\r\n ind = keys.index(item)\r\n values[ind] += 1\r\n else:\r\n keys.append(item)\r\n values.append(1)\r\n ind = len(values) - 1\r\n if maxValue < values[ind]:\r\n maxValue = values[ind]\r\n\r\nprint(\"{} {}\".format(maxValue, len(keys)))\r\n\r\n'''input()\r\nmaxLen = 0\r\nDict = {}\r\nfor item in input().split(' '):\r\n if item in Dict:\r\n Dict[item] += 1\r\n else:\r\n Dict[item] = 1\r\n if maxLen < Dict[item]:\r\n maxLen = Dict[item]\r\n\r\nprint(\"{} {}\".format(maxLen, len(Dict)))'''\r\n", "n=int(input())\r\nlengths=[int(x) for x in input().split()]\r\nh=0\r\nlengths.sort()\r\ncnt=0\r\ni=0\r\nl=set(lengths)\r\nwhile(i<n):\r\n h=max(h,lengths.count(lengths[i]))\r\n i+=1\r\nprint(\"{} {}\".format(h,len(l)))", "n , l = int(input()) , list(map(int , input().split()))\nmost_frequent = max(set(l) , key=l.count)\nprint( l.count(most_frequent) , len(set(l)))\n \t\t \t\t \t \t\t \t\t \t\t\t \t \t \t", "cnt = [0 for i in range (1001)]\r\nn = int(input())\r\na = list(map(int, input().split()))\r\n\r\nfor i in a:\r\n cnt[i] += 1\r\nmaxHeight = 0\r\ntotal = 0\r\nfor i in cnt:\r\n if i != 0:\r\n maxHeight = max(maxHeight, i)\r\n total += 1\r\n\r\nprint(maxHeight, total)", "import sys\n\nn_towers = int(sys.stdin.readline())\nlengths = [int(x) for x in sys.stdin.readline().split()]\ncounts = {}\n\nfor length in lengths:\n if length not in counts:\n counts[length] = 0\n counts[length] += 1\n\nn_keys, max_value = 0, 0\nfor key, value in counts.items():\n max_value = max(max_value, value)\n n_keys += 1\n\nprint(max_value, n_keys)\n", "n = int(input())\r\ndict = {}\r\nmaxval = 0\r\nfor item in map(int, input().split(' ')):\r\n if item in dict:\r\n dict[item] += 1\r\n else:\r\n dict[item] = 1\r\n if maxval < dict[item]:\r\n maxval = dict[item]\r\nprint('{0} {1}'.format(maxval, len(dict)))\r\n", "n=int(input());l=list(map(int,input().split()));m=0\r\nfor i in list(set(l)):\r\n\tm=max(m,l.count(i))\r\nprint(m,len(set(l)))", "inp=int(input())\r\narr=input().split()\r\nlist1=[]\r\nfor i in arr:\r\n list1.append(arr.count(i))\r\nprint((max(list1)),len(set(arr)))", "def main():\r\n n=int(input())\r\n a=list(map(int,input().split()))\r\n d={}\r\n for i in range(len(a)):\r\n if a[i] in d:\r\n d[a[i]]+=1\r\n else:\r\n d[a[i]]=1\r\n print(max(d.values()),len(set(a)))\r\nmain()", "t = int(input())\nbars = input().split()\ncount_map = {}\nmax_height = -1\nfor bar in bars:\n if bar in count_map:\n count_map[bar] += 1\n else:\n count_map[bar] = 1\n max_height = max(max_height, count_map[bar])\nprint(f\"{max_height} {len(count_map)}\")\n \t\t\t \t \t\t\t\t \t \t\t \t\t \t", "t=int(input())\r\nx=list(map(int,input().split()))\r\ny=set(x)\r\na=[]\r\nfor i in y:\r\n a.append(x.count(i))\r\nprint(max(a),len(set(x)))\r\n", "n = int (input ())\r\nbox = list (map (int, input ().split ()))\r\nheight = []\r\notv = []\r\n\r\nfor i in box:\r\n height.append (box.count (i))\r\n if i not in otv:\r\n otv.append (i)\r\n\r\nprint (max (height), len (otv))\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "import sys\n\nn = int(input())\nln = list(map(int, sys.stdin.readline().split()))\n\nhn = [0] * (1001)\nfor l in ln:\n hn[l] += 1\n\nmh = 0\nnum = 0\nfor i in range(1001):\n if hn[i] != 0:\n num += 1\n if mh < hn[i]:\n mh = hn[i]\n\nprint(mh, num)\n", "n = int(input())\r\na = sorted([int(i) for i in input().split()])\r\nb = set(a)\r\nh = 0\r\nfor i in b:\r\n x = a.count(i)\r\n if x > h: h = x\r\nprint(h, len(b))", "N = int(input())\r\ni = list(map(int,input().split()))\r\nx = []\r\nz = []\r\nfor a in i: \r\n if a not in x:\r\n x.append(a)\r\n if a in x:\r\n z.append((i.count(a)))\r\nprint(max(z), len(z))", "counter = [0 for _ in range(1000)]\ninput()\nfor i in map(int, input().split()):\n\tcounter[i - 1] += 1\n\nc = m = 0\nfor i in counter:\n\tif i != 0: c += 1\n\tif i > m: m = i\n\nprint(m, c) ", "n = int(input())\r\n*l, = map(int, input().split())\r\n*st, = set(l)\r\ncnt = 0\r\nfor i in st:\r\n cnt = max(cnt, l.count(i))\r\nprint(cnt, len(st))", "import math\r\n\r\nn=int(input())\r\na=list(map(int,input().split()))\r\nd=[0]*1000\r\nr=0\r\n\r\nfor i in range(n):\r\n if d[a[i]-1]==0:\r\n r+=1\r\n d[a[i]-1]+=1\r\n \r\nprint(max(d),r)", "n=int(input())\r\nd=dict()\r\nfor i in map(int,input().split()):\r\n if(i in d):\r\n d[i]+=1\r\n else:\r\n d[i]=1\r\nl=list()\r\nnb=len(d)\r\nfor i in (d.values()):\r\n l.append(i)\r\nmaxi=max(l)\r\nprint(maxi,nb)\r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\nb=[]\r\nh=0\r\ng=0\r\ncol=0\r\n\r\nfor i in a:\r\n if not i in b:\r\n b.append(i)\r\n col+=1\r\n h=a.count(i)\r\n if h>g:\r\n g=h\r\n \r\nprint(g,col)\r\n", "a = int(input())\r\nb = list(map(int,input().split()))\r\nc = b.count(max(b , key =b.count))\r\nd = len(set(b))\r\nprint(c,d)", "\r\n#Sort the Array\r\n# n = int(input())\r\n# a = list(map(int, input().split()))\r\n# l = -1\r\n# r = -1\r\n# b = sorted(a)\r\n# for i in range(n - 1):\r\n# if a[i] > a[i+1]:\r\n# l = i\r\n# break\r\n\r\n# for i in range(n-1, 0, -1):\r\n# if a[i] < a[i-1]:\r\n# r = i\r\n# break\r\n# if l == -1 or r == -1:\r\n# print(\"yes\")\r\n# print(1, 1)\r\n# else:\r\n# a[l: r + 1] = reversed(a[l: r + 1])\r\n# if len([i for i in range(n) if a[i] != b[i]]) == 0: \r\n# print(\"yes\")\r\n# print(l + 1, r + 1) \r\n# else:\r\n# print(\"no\")\r\n\r\n#GukiZ and Contest\r\n# n = int(input())\r\n# a = list(map(int, input().split()))\r\n# b = sorted(a, reverse=True)\r\n# rank = 1\r\n# res = []\r\n# flag = -1\r\n# rankDict = dict()\r\n# for i in range(n):\r\n# if flag != b[i]:\r\n# rankDict[b[i]] = rank\r\n# flag = b[i]\r\n# rank += 1\r\n# res = [rankDict[a[it]] for it in range(n)]\r\n# print(\" \".join([str(it) for it in res]))\r\n\r\n#Towers\r\nn = int(input())\r\na = sorted(list(map(int, input().split())))\r\ncount = dict()\r\nfor i in range(n):\r\n if a[i] not in count:\r\n count[a[i]] = 0\r\n count[a[i]] += 1\r\nprint(max(count.values()), len(count))", "input()\r\nbars = list(map(int, input().split()))\r\ntowers = {}\r\n\r\nfor b in bars:\r\n towers[b] = towers.get(b, 0) + 1\r\n\r\nprint(max(towers.values()), len(towers))", "n = int(input())\r\na = list(map(int, input().split()))\r\na.sort()\r\ncount = maxi = 1\r\ntowers = 1\r\nfor i in range(1, n):\r\n count+=1\r\n if i==1:\r\n if a[1]!=a[0]:\r\n count=1\r\n else:\r\n towers-=1\r\n if i==n-1 or a[i]!=a[i+1]:\r\n maxi=max(maxi, count)\r\n count=0\r\n towers+=1\r\n\r\nprint(maxi, towers)\r\n", "N = int(input())\r\n\r\nA = list(map(int, input().split()))\r\n\r\nmaps = {}\r\ncurH = 0\r\n\r\nfor a in A:\r\n if a not in maps:\r\n maps[a] = 1\r\n else:\r\n maps[a] += 1\r\n curH = max(curH, maps[a])\r\nprint(curH, end=' ')\r\nprint(len(maps)) ", "d={}\r\nn=int(input())\r\nmax=1\r\na=list(map(int, input().split()))\r\nfor i in a:\r\n if i in d:\r\n d[i]+=1\r\n if d[i]>max:\r\n max=d[i]\r\n else:\r\n d[i] = 1\r\nb=len(d)\r\nprint(max, b)", "n = int(input())\r\ns = list(map(int, input().split()))\r\nt = list(dict.fromkeys(s))\r\n\r\nmaxt = -1\r\nfor i in t:\r\n\ttt = s.count(i)\r\n\tif tt > maxt: maxt = tt\r\n\r\nprint(maxt, len(t))", "n=int(input())\r\n\r\nt=list(map(int,input().split()))\r\nt.sort()\r\n\r\np = list(set(t))\r\ns=[]\r\nfor k in p:\r\n s.append(t.count(k))\r\n\r\nprint(max(s),len(s))\r\n", "n = int(input())\r\na = [int(i) for i in input().split()]\r\ncnt = [a.count(i) for i in range(1, 1001)]\r\nprint(max(cnt), len(set(a)))", "x = int(input())\r\ny = list(map(int,input().split()))\r\n\r\n\r\nz = max(y,key=y.count)\r\na = y.count(z)\r\n\r\nb = len(set(y))\r\n\r\nprint(a,b)\r\n", "n = (int)(input())\r\nl = list(map(int, input().split()))\r\nd = dict()\r\nfor i in range(n):\r\n if(l[i] in d):\r\n d[l[i]] += 1\r\n else: d[l[i]] = 1\r\nmx = 0\r\ncnt = 0\r\nfor key in d:\r\n cnt += 1\r\n mx = max(mx, d[key])\r\nprint(mx, cnt)", "from collections import Counter\r\nn = int(input())\r\nl = list(map(int,input().split()))\r\ns = set(l)\r\nmaxi = max(list(dict(Counter(l)).values()))\r\nprint(maxi,len(s))", "# c,m = [int(i) for i in input().strip().split()]\r\n# cost = [int(i) for i in input().strip().split()]\r\n# bills = [int(i) for i in input().strip().split()]\r\na = int(input())\r\nh = [int(i) for i in input().strip().split()]\r\nans = dict()\r\nmxval = -9999\r\nfor i in h:\r\n if str(i) in ans:\r\n ans[str(i)]+=1\r\n else:\r\n ans[str(i)] = 1\r\n if ans[str(i)] > mxval:\r\n mxval = ans[str(i)]\r\nprint(mxval,len(ans))\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "n = int(input())\r\narr = list(map(int, input().split()))\r\nprint(max({x: arr.count(x) for x in set(arr)}.values()), len({x: arr.count(x) for x in set(arr)}))", "n = input()\r\ng = list(map(int,input().split()))\r\ns = []\r\nk = []\r\nfor i in g :\r\n if i in s :\r\n continue\r\n else:\r\n s1 = g.count(i)\r\n s.append(i)\r\n k.append(s1)\r\nprint(max(k),len(k))", "n = int(input())\r\na = [int(i) for i in input().split()]\r\ncol = len(set(a))\r\n\r\nb = []\r\nfor i in list(set(a)):\r\n b.append(a.count(i))\r\n\r\nprint(max(b), col)\r\n\r\n", "import collections\r\nN = int(input())\r\nl = list(map(int,input().split()))\r\nmax = collections.Counter(l).most_common()[0][1]\r\nprint(max,len(set(l)))\r\n", "def bar(s):\n b=input().split()\n lis=[]\n if len(b)>s:\n return\n for x in range(len(b)):\n lis.append(int(b[x]))\n elem=list(set(lis))\n used=[]\n occur=[]\n for y in range(len(b)):\n if b[y] not in used:\n occur.append(b.count(b[y]))\n used.append(b[y])\n print(max(occur),'',len(elem))\n \n \n \n\ns=int(input())\nbar(s)\n \t \t \t \t\t\t\t\t \t \t \t\t\t\t\t\t \t\t", "'''\r\n @Author: Pham T. Nhan\r\n @Date: 2/11/2018\r\n @Name: Towers\r\n @Link: http://codeforces.com/problemset/problem/37/A\r\n'''\r\n\r\n\r\ndef main():\r\n n = int(input())\r\n length = list(map(int, input().split()))\r\n\r\n length.append(1001)\r\n length.sort()\r\n\r\n highest = 0\r\n total = 0\r\n i = 0\r\n\r\n while i < n:\r\n height = 0\r\n for j in range(i, n + 1):\r\n if length[i] == length[j]:\r\n height += 1\r\n else:\r\n total += 1\r\n highest = max(height, highest)\r\n i = j\r\n break\r\n\r\n print(\"{} {}\".format(highest, total))\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "n= int(input())\r\nl=list(map(int,input().split()))\r\nma=1\r\nfor i in set(l):\r\n ma=max(ma,l.count(i))\r\nprint(ma,len(set(l)))", "n = int(input())\r\nlst = list(map(int, input().split()))\r\nDIC = {}\r\nfor i in lst:\r\n DIC[i] = DIC.get(i, 0) + 1\r\n\r\nmx = 0\r\nfor i in DIC:\r\n if DIC[i] > mx:\r\n mx = DIC[i]\r\nprint(mx, len(DIC))", "def func(l):\r\n d = {}\r\n for elem in l:\r\n if elem not in d:\r\n d[elem] = 0\r\n d[elem] += 1\r\n h = -10000\r\n for val in d:\r\n if d[val] > h:\r\n h = d[val]\r\n return len(d), h\r\n\r\n\r\n\r\n\r\ndef main():\r\n n = int(input())\r\n l = list(map(int, input().split()))\r\n var = func(l)\r\n print( var[1], var[0])\r\n\r\nmain()", "input()\r\nb = input().split()\r\na = sorted(b, key = b.count)\r\nprint(a.count(a[-1]), len(set(a)))\r\n", "n = int(input())\r\ntowers=[int(item) for item in input().split()]\r\nnumQuantities={}\r\n\r\nfor i in range(n):\r\n if towers[i] not in numQuantities.keys():\r\n numQuantities[towers[i]]=towers.count(towers[i])\r\n\r\nMaxValue=max(numQuantities.values())\r\nprint(MaxValue,len(numQuantities))", "#n, m, k =map(int,input().split())\r\n\r\nn = int(input())\r\n\r\nmass = list(map(int,input().split()))\r\n\r\nmass.sort()\r\nmax = 1\r\ni = 0\r\nk = 1\r\nwhile(i<len(mass)-1):\r\n size = 1\r\n while(mass[i]==mass[i+1]):\r\n size += 1\r\n if(max<size):\r\n max = size\r\n i +=1\r\n if(i >= len(mass)-1):\r\n k -= 1\r\n break\r\n k += 1\r\n i += 1\r\nprint(max, k)\r\n\r\n\r\n\r\n\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\ny=list(set(l))\r\nans=[]\r\nfor i in range(len(y)):\r\n ans.append(l.count(y[i])) \r\nprint(max(ans),len(y))", "n=int(input())\r\nl=list(map(int,input().split()))\r\ndic={}\r\nfor i in l:\r\n if i in dic:\r\n dic[i]+=1\r\n else:\r\n dic[i]=1\r\nv=list(dic.values())\r\nk=list(dic.keys())\r\nprint(max(v),len(k))", "d = {}\r\nmaxi = 0\r\nn = input()\r\nn = int(n)\r\nl = input()\r\nl = l.split()\r\nl = list(l)\r\nfor x in l:\r\n if x in d:\r\n d[x] = d[x] + 1\r\n else:\r\n d[x] = 1\r\nfor gar in d:\r\n if d[gar] > maxi:\r\n maxi = d[gar]\r\nprint(maxi, len(d))", "from collections import Counter\r\nn=int(input())\r\nl=list(map(int,input().split()))\r\nc=Counter(l)\r\nma=1\r\nfor i in c:\r\n ma=max(ma,c[i])\r\nprint(\"{0} {1}\".format(ma,len(set(l))))", "def q37a():\n\tn = int(input())\n\tlengths_list = [int(num) for num in input().split()]\n\tcounts = dict()\n\tfor length in lengths_list:\n\t\tcounts[length] = counts.get(length, 0) + 1\n\tprint(\"%d %d\"%(max(counts.values()), len(counts.keys())))\n\nq37a()", "n = int(input().strip())\narr = list(map(int, input().strip().split()))\ntowers = [0]*1001\nfor i in arr:\n\ttowers[i] += 1\nc = 0\nfor i in towers:\n\tif i != 0:\n\t\tc += 1\nprint(max(towers), c)", "n=int(input())\r\nl=list(map(int,input().split()))\r\nd={}\r\nfor i in l:\r\n if i in d.keys():\r\n d[i]+=1\r\n else:\r\n d[i]=1\r\nmax=0\r\nfor i in l:\r\n if d[i]>max:\r\n max=d[i]\r\nprint(max,len(set(l)))", "count_of_bash = int(input())\r\nlist_of_bash = [i for i in map(int, input().split())]\r\nmax_bash = 0\r\nset_of_bash = set(list_of_bash)\r\nfor i in set_of_bash:\r\n if list_of_bash.count(i) > max_bash:\r\n max_bash = list_of_bash.count(i)\r\n\r\n\r\nprint(f'{max_bash} {len(set_of_bash)}')", "def read_input():\r\n n = int(input())\r\n l = [int(i) for i in input().split(\" \")]\r\n return n, l\r\n\r\n\r\ndef solve(n, l):\r\n res = {}\r\n for i in l:\r\n if i in res.keys():\r\n res[i] += 1\r\n else:\r\n res[i] = 1\r\n return (max(res.values()), len(res.keys()))\r\n\r\n\r\ndef main():\r\n n, l = read_input()\r\n answer = solve(n, l)\r\n print(answer[0], answer[1])\r\n\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()", "col = int(input())\r\nlength = input().split()\r\nresult_height = 1\r\nresult_tower = col\r\nif col == int(len(set(length))):\r\n result_tower = col\r\nelif col > int(len(set(length))):\r\n result_tower = result_tower - (int(result_tower) - int(len(set(length))))\r\nnum = 0\r\nfor i in length:\r\n kol = length.count(length[num])\r\n if kol > result_height:\r\n result_height = kol\r\n num += 1\r\n\r\nprint(result_height, end=' ')\r\nprint(result_tower)", "n = int(input())\r\narr = [int(i) for i in input().split()]\r\nfreq = {}\r\nfor i in arr:\r\n freq[i] = freq.setdefault(i, 0) + 1\r\nprint(max(freq.values()), len(freq))\r\n\r\n\r\n\r\n", "\r\n\r\n\r\nn = int(input())\r\n\r\nm = [int(x) for x in input().split()]\r\nm.sort()\r\nh=1\r\ni=0\r\nwhile i<len(m):\r\n c= m.count(m[i])\r\n if c>h:\r\n h=c\r\n if c>1:\r\n n-=c-1\r\n i+=c\r\n else:\r\n i+=1\r\n \r\nprint(h,n)\r\n", "from collections import Counter\r\nn=input()\r\na=Counter(list(input().split())).most_common()\r\nprint(a[0][1],len(a))", "input()\r\ntemp = list(map(int,input().split(' ')))\r\nmostFrequent = max(set(temp),key = temp.count)\r\nprint(temp.count(mostFrequent),len(set(temp)))", "input()\r\nres = {}\r\nfor x in input().split():\r\n if int(x) in res.keys():\r\n res[int(x)] += 1\r\n else:\r\n res[int(x)] = 1\r\n \r\nprint(max(res.values()), len(res.keys()))\r\n", "n = int(input())\r\n\r\na = list(map(int, input().split()))[:n]\r\n\r\ndict = {}\r\n\r\nfor i in range(n):\r\n cur = a[i]\r\n if(cur in dict):\r\n dict[cur] = dict[cur] + 1\r\n else:\r\n dict[cur] = 1\r\n\r\nhighestTower = 0\r\nmaxTower = 0\r\n\r\nfor key in dict:\r\n maxTower = maxTower + 1\r\n if(dict[key] > highestTower):\r\n highestTower = dict[key]\r\n\r\nprint(highestTower, maxTower)", "n=int(input())\r\nl=list(map(int,input().split()))\r\nm=[]\r\nq=set(l)\r\nfor i in l:\r\n a=l.count(i)\r\n m.append(a)\r\nprint(max(m),len(q))\r\n", "n = int(input())\r\nmat = [int(i) for i in input().split()]\r\ns = set(mat)\r\nmaxNum = 0\r\nfor i in s:\r\n if maxNum < mat.count(i):\r\n maxNum = mat.count(i)\r\nprint(maxNum, len(s))\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\nz=set(l)\r\nm=[]\r\nfor i in z:\r\n m.append(l.count(i))\r\nprint(max(m),len(m))", "input()\r\narr=input()\r\narr=[int(i) for i in arr.split()]\r\nu=[]\r\nfor i in arr:\r\n if i not in u:\r\n u.append(i)\r\nm=-1\r\nfor i in u:\r\n x=arr.count(i)\r\n if x >m:\r\n m=x\r\nprint(m,len(u)) \r\n", "n = int(input())\na = list(map(int, input().split(\" \")))\n\nprint(max(list(map(a.count, a))), len(set(a)))\n", "a = [0] * 1010\r\nn = input()\r\nl = list(map(int, input().split()))\r\nfor i in l:\r\n a[i] += 1\r\nprint(max(a), sum([1 for i in a if i != 0]))", "def check(n,i,S):\r\n le1=len(i)\r\n le2=len(S)\r\n m=''\r\n if le1==le2:\r\n m+=str(1)+' '\r\n m+=str(le1)\r\n else:\r\n t=tuple(i)\r\n v=0\r\n for x in S:\r\n c=t.count(x)\r\n if v<c:\r\n v=c\r\n m+=str(v)+' '\r\n m+=str(le2)\r\n return m\r\nn=int(input())\r\na=input().split()\r\ni=[]\r\nfor x in a:\r\n i.append(int(x))\r\nS=set(i)\r\nprint(check(n,i,S))", "from collections import Counter\n\nn = int(input())\nls = Counter(input().split())\n\nprint(max(ls.values()), len(ls))\n", "from collections import Counter\r\n\r\nn = int(input())\r\ndata = [int(i) for i in input().split()]\r\nd = Counter(data)\r\nprint(data.count(d.most_common(1)[0][0]), len(set(data)))", "numbers=int(input())\r\nsiz=[int(s) for s in input().split()]\r\nh,l,cn,mh=1,0,0,1\r\nsiz.sort()\r\nfor i in siz:\r\n if i==l:\r\n h+=1\r\n if mh<h:\r\n mh=h\r\n else:cn,h=cn+1,1\r\n l=i\r\nprint(mh,cn)", "if __name__ == \"__main__\":\r\n t = int(input())\r\n\r\n\r\n a = [int(x) for x in input().split()]\r\n\r\n c = {}\r\n\r\n for i in range(t):\r\n if a[i] in c:\r\n c[a[i]] +=1\r\n else:\r\n c[a[i]]= 1\r\n \r\n \r\n\r\n print(c[max(c, key=c.get)], len(c))\r\n ", "from sys import stdin\r\n\r\ndef opera(m,n):\r\n c= 0\r\n s= []\r\n for i in range(n):\r\n c= m.count(m[i])\r\n if c > 1:\r\n s.append(str(m[i])+' '+str(c))\r\n s= list(set(s))\r\n return s\r\ndef cont(s):\r\n x= []\r\n for i in range(len(s)):\r\n s[i]= s[i].split()\r\n x.append(int(s[i][1]))\r\n return x\r\ndef sumar(x):\r\n numero= 0\r\n altura= 0\r\n for i in range(len(x)):\r\n numero+= x[i]-1\r\n if x[i]> altura:\r\n altura= x[i]\r\n return numero,altura\r\ndef main():\r\n n= int(stdin.readline())\r\n m= [int(x) for x in stdin.readline().strip().split()]\r\n numero, altura= sumar(cont(opera(m,n)))\r\n if n-numero!= n:\r\n print(altura, n-numero)\r\n else:\r\n print(1, n-numero)\r\n \r\nmain()\r\n", "n = (int,input())\r\na = list(map(int,input().split()))\r\nbar = [0]*1001\r\n\r\nfor x in a:\r\n bar[x] += 1\r\n\r\ncnt = 0\r\nfor x in bar:\r\n if x != 0:\r\n cnt += 1\r\n\r\nprint(max(bar),cnt)", "n=int(input())\r\na=list(map(int,input().split()))\r\nb=[]\r\nc=[]\r\nt=0\r\ny=0\r\nz=0\r\nfor i in range (n):\r\n y=a.count(a[i])\r\n if not a[i] in b:\r\n b.append(a[i])\r\n elif y>1:\r\n c.append(y)\r\nif c==[]:\r\n z=1\r\nelse:\r\n z=max(c)\r\nx=len(b)\r\nprint(z,x)\r\n", "_ = input()\r\narr = map(int, input().split())\r\nd = {}\r\nfor x in arr:\r\n if x not in d:\r\n d[x] = 1\r\n else:\r\n d[x] += 1\r\n \r\nmax_height = 0\r\nfor k in d:\r\n max_height = max(max_height, d[k])\r\nprint(max_height, len(d))", "n=int(input())\r\na=list(map(int,input().split()))\r\nx=[1]\r\ndone=[]\r\nfor i in a:\r\n if a.count(i)>1 and i not in done:\r\n x.append(a.count(i))\r\n done.append(i)\r\na=list(set(a))\r\nprint(max(x),len(a))\r\n", "n=int(input())\r\nlis=list(map(int,input().split()))\r\ndict={}\r\nfor i in lis:\r\n if not i in dict:\r\n dict[i]=1\r\n else:\r\n dict[i]+=1\r\nmm=0\r\nfor i in range(len(lis)):\r\n if dict[lis[i]]>mm:\r\n mm=dict[lis[i]]\r\nprint(mm,len(dict),end=' ')", "a=int(input())\r\nb=sorted(list(map(int,input().split())))\r\nc=[0]*1002\r\nfor i in b:\r\n c[i]+=1;\r\nx=0\r\nfor j in range (1001):\r\n if c[j]>0:\r\n x=x+1\r\nk=max(c)\r\nprint(k, x)\r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\nf=[]\r\nfor i in range(len(a)):\r\n if i==a.index(a[i]):\r\n f.append(a.count(a[i]))\r\nprint(max(f),len(f))\r\n", "from collections import Counter\r\n\r\nn = int(input())\r\nlst = list(map(int, input().split()))\r\nc = Counter(lst)\r\nmaxH, total = max(c.values()), len(c.keys())\r\nprint(f'{maxH} {total}')", "n=int(input())\r\na=list(map(int,input().split()))\r\nl1=l2=l3=0\r\nfor i in a:\r\n if a.count(i)>l2:\r\n l2=a.count(i)\r\nb=set(a)\r\nprint(l2,len(b))", "k=int(input())\r\na=list(map(int,input().split()))\r\nb=len(set(a))\r\nc={}\r\nfor i in a:\r\n if i not in c:\r\n c[i]=1\r\n else:\r\n c[i]+=1\r\nd=0 \r\nfor i in c.values():\r\n if(d<i):\r\n d=i\r\nprint(d,b) \r\n ", "amount = int(input())\ndata = [int(i)for i in input().split()]\n_max = 0\nfor item in set(data):\n _max = max(_max,data.count(item))\nans = len(set(data))\nprint(_max,ans)\n\n\t \t\t\t \t \t \t \t \t\t\t \t \t\t", "n = int(input())\r\na = list(map(int, input().split()))\r\na.sort()\r\n\r\ntotal_number = 1\r\nhigh_current = 1\r\nhigh_tower = 1\r\nfor i in range(n-1):\r\n\tif (a[i] != a[i + 1]):\r\n\t\ttotal_number += 1\r\n\t\thigh_current = 1\r\n\telse:\r\n\t\thigh_current += 1\r\n\t\tif (high_current > high_tower):\r\n\t\t\thigh_tower = high_current\r\nprint(\"%d %d\" % (high_tower, total_number))", "\r\nfrom collections import Counter\r\nimport sys\r\nInput = sys.stdin.readline\r\ntmp = 0\r\nN = int(Input())\r\na = Counter(map(int, Input().split()))\r\nprint(max(a.values()), len(set(a)))\r\n", "from collections import Counter\r\nimport string\r\nimport math\r\nimport sys\r\ndef array_int():\r\n return [int(i) for i in sys.stdin.readline().split()]\r\ndef vary(number_of_variables):\r\n if number_of_variables==1:\r\n return int(sys.stdin.readline())\r\n if number_of_variables>=2:\r\n return map(int,sys.stdin.readline().split()) \r\ndef makedict(var):\r\n return dict(Counter(var))\r\nmod=100000007\r\nn=vary(1)\r\nnum=array_int()\r\ncout=makedict(num)\r\nmaxi=-1\r\nkeys=0\r\nmaxi=max(cout.values())\r\nfor i in cout:\r\n # print(cout[i])\r\n keys+=1\r\nprint(maxi,keys)\r\n\r\n\r\n\r\n\r\n\r\n\r\n \r\n \r\n\r\n\r\n \r\n\r\n\r\n\r\n\r\n\r\n\r\n \r\n\r\n \r\n \r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n \r\n\r\n\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\nn = int(input())\nalist = list(map(int, sys.stdin.readline().split()))\nadict = dict()\nfor a in alist:\n if a in adict:\n adict[a] += 1\n else:\n adict[a] = 1\nprint(max(adict.values()),len(adict))\n", "n = int(input())\r\narr = list(map(int, input().split()))\r\n\r\narr.sort()\r\ncount = 1\r\nheight = max_height = 1\r\nfor i in range(1, n):\r\n if arr[i] == arr[i - 1]:\r\n height += 1\r\n else:\r\n count += 1\r\n height = 1\r\n max_height = max(max_height, height)\r\n\r\nprint(max_height, count)\r\n\r\n", "n = int(input())\na = list(map(int, input().split()))\na.sort()\n\nx = y = 1\nt = 1\n\nfor i in range(1, n):\n if a[i] != a[i-1]:\n t = 1\n y += 1\n else:\n t += 1\n if t > x: x = t\n\nprint(str(x)+' '+str(y))\n", "N = int(input())\r\nl_l = list(map(int, input().split()))\r\n\r\nd_l = {}\r\nn = 0\r\nm = 0\r\n\r\nfor l in l_l:\r\n if l in d_l:\r\n d_l[l] += 1\r\n else:\r\n n += 1\r\n d_l[l] = 1\r\n m = max(d_l[l], m)\r\n \r\nprint(\"%d %d\" % (m, n))\r\n ", "n = int(input())\r\narray = list(map(int, input().split()))\r\nhash_map = {}\r\nfor x in array:\r\n if x in hash_map:\r\n hash_map[x] += 1\r\n else:\r\n hash_map[x] = 1\r\n\r\nmax_height = max(hash_map.values())\r\ntotal = len(hash_map.values())\r\nprint(max_height, total)\r\n", "#RAVENS #TEAM_2 #ESSI-DAYI_MOHSEN-LORENZO\nfrom collections import Counter\ninput()\na=list(map(int,input().split()))\nprint(Counter(a).most_common(1)[0][1], len(set(a)))", "n = int(input())\ntower = {}\nans = 0\nfor x in input().split():\n x = int(x)\n if x not in tower:\n tower[x] = 1\n else:\n tower[x] += 1\n ans = max(ans, tower[int(x)])\nprint('{} {}'.format(ans, len(tower)))\n", "num=int(input())\r\nlist_=list(map(int,input().split()))\r\nmax_=0\r\nfor i in list_:\r\n p=list_.count(i)\r\n max_=max(p,max_)\r\nprint(max_,len(set(list_)))", "n = int(input())\r\nl = list(map(int, input().split()))\r\n\r\ntemp = sorted(l)\r\n\r\nfre = [0] * 1001\r\n\r\nunique = 0\r\nfor i in range (n):\r\n if fre[temp[i]] == 0:\r\n unique += 1 \r\n fre[temp[i]] += 1\r\n\r\nprint(max(fre), unique)", "n = int(input())\ns = input()\ns = s.split()\n\nD = {}\n\nfor x in s:\n if int(x) in D.keys():\n D[int(x)] += 1\n else:\n D[int(x)] = 1\n\nmaxR = 0;\nmaxVal = 0\n\nfor k,v in D.items(): \n if (v > maxR):\n maxR = v \n maxVal = k\n\nprint(maxR,len(D))\n \t \t\t \t \t \t \t \t \t\t\t \t \t", "from statistics import *\r\nn=int(input())\r\nl=list(map(int,input().split()))\r\nm=0\r\nfor i in l:\r\n x=l.count(i)\r\n if(x>m):\r\n m=x\r\nprint(m,len(set(l)))\r\n", "input()\r\na = list(map(int,input().split()))\r\nx = list(0 for i in range(1000))\r\nfor i in a:\r\n x[i-1]+=1\r\ns = 0\r\nc = 0\r\nfor i in x:\r\n if i>0:\r\n c+=1\r\n s = max(s,i)\r\nprint(s,c)", "n=int(input())\r\na=list(map(int,input().split(' ')))\r\na.sort()\r\nar=[]\r\nc=[]\r\nfor i in range(n):\r\n if a[i] not in ar:\r\n ar.append(a[i])\r\n c.append(a.count(a[i]))\r\nprint(max(c),end=' ')\r\nprint(len(ar))\r\n \r\n", "n = int(input())\r\narr = sorted(list(map(int, input().split())))\r\ntowers = [0]*(1001) \r\nfor e in arr:\r\n towers[e] += 1\r\n \r\n\r\nprint(max(towers), 1001 - towers.count(0))", "n=int(input())\r\ns=list(map(int,input().split()))\r\ns.sort()\r\ns1=set(s)\r\na=0\r\nl=[]\r\nfor i in s1:\r\n\ta=s.count(i)\r\n\tb=(i,a)\r\n\tl.append(b)\r\nc=1\r\nfor i in range(len(l)):\r\n\tif l[i][1] > c:\r\n\t\tc=l[i][1]\r\nif c>1:\r\n\tprint(c,len(s1))\r\nelse:\r\n\tprint(c,len(s1))", "input()\r\nz=[]\r\nd=list(map(int,input().split()))\r\nk=0\r\nfor n in d:\r\n\tk=max(k,d.count(n))\r\n\tif n not in z:\r\n\t\tz.append(n)\r\nprint(k,len(z))", "n=int(input())\r\na=input().split()\r\nb=[int(i) for i in a]\r\nd={}\r\nfor i in b:\r\n if i in d:\r\n d[i]+=1\r\n else:\r\n d[i]=1\r\nmax1=0\r\nfor i in d:\r\n if d[i]>max1:\r\n max1=d[i]\r\nprint(max1,len(d))\r\n", "from collections import Counter\r\n\r\ninput()\r\ncounter = Counter(map(int, input().split()))\r\nval, freq = counter.most_common(1)[0]\r\nprint(freq, len(counter))\r\n", "from collections import Counter\r\nn=int(input())\r\nl=list(map(int,input().split()))\r\nn,m=Counter(l).most_common(1)[0]\r\nprint(m,len(set(l)))", "bars_no = int(input())\r\nbars_len = input()\r\nlistof_bars_len = list(map(int,bars_len.split()))\r\nfrequency = {}\r\n\r\nfor items in listof_bars_len:\r\n if items in frequency:\r\n frequency[items] += 1\r\n else:\r\n frequency[items] = 1\r\n\r\nmax_val = frequency.values()\r\nprint(max(max_val),len(frequency))", "n = int(input())\nq = [int(x) for x in input().split()]\nheight = max([int(q.count(x)) for x in set(q)])\n\nprint(height, len(set(q)))\n\n\n\t \t \t \t\t\t \t\t \t\t\t\t \t \t\t\t\t", "n=int(input())\r\narr=[int(x) for x in input().split()]\r\ndic={}\r\n[dic.setdefault(x,0) for x in arr]\r\nx=0\r\nfor i in arr:\r\n dic[i]+=1\r\n x=max(x,dic[i]) \r\nprint(x,len(dic)) ", "t = int(input())\r\nl1 = [int(x) for x in input().split()]\r\ns = set(l1)\r\nt=[]\r\nfor x in s:\r\n t.append(l1.count(x))\r\nprint(max(t),len(s))\r\n", "input()\r\nfrom collections import Counter\r\ndic = Counter()\r\nfor i in map(int, input().split()):\r\n dic[i] += 1\r\n\r\nprint(max(dic.values()), len(dic))", "from collections import Counter\ninput()\nd = Counter(input().split())\nprint(max(d.values()), len(d.keys()))\n", "n = int(input())\r\na = list(map(int, input().split()))\r\na.sort()\r\ntowers = []\r\nheights = []\r\nfor i in a:\r\n if i not in towers:\r\n towers.append(i)\r\n heights.append(1)\r\n else:\r\n index = towers.index(i)\r\n heights[index] += 1\r\nprint(max(heights), len(towers))", "n = int(input())\r\nl = [int(string) for string in input().split()]\r\ns = set(l)\r\n_max = 0\r\nfor u in set(l):\r\n _max = max(_max, l.count(u))\r\nprint('{0} {1}'.format(_max, len(s)))", "\r\nn = int(input())\r\n\r\nop = list(map(int, input().split()))\r\n\r\nlengths = set(op)\r\n\r\ntwrs = len(lengths)\r\n\r\nmax = 0\r\nfor l in lengths:\r\n if max < op.count(l):\r\n max = op.count(l)\r\n\r\n\r\nprint(max, twrs)\r\n", "'''\r\ndef main():\r\n from sys import stdin,stdout\r\nif __name__=='__main__':\r\n main()\r\n'''\r\n#1A\r\n'''\r\ndef main():\r\n from sys import stdin,stdout\r\n from math import ceil\r\n n,m,a=map(int,stdin.readline().split())\r\n stdout.write(str(ceil(n/a)*ceil(m/a)))\r\nif __name__=='__main__':\r\n main()\r\n'''\r\n#4A\r\n'''\r\ndef main():\r\n from sys import stdin,stdout\r\n i=int(stdin.readline())\r\n if i&1:\r\n stdout.write('NO\\n')\r\n else:\r\n if i//2 >1:\r\n stdout.write('YES\\n')\r\n else:\r\n stdout.write('NO\\n')\r\nif __name__=='__main__':\r\n main()\r\n'''\r\n#71A\r\n'''\r\ndef main():\r\n from sys import stdin,stdout\r\n for _ in range(int(stdin.readline())):\r\n s=stdin.readline().strip()\r\n if len(s) <=10:\r\n stdout.write(s+'\\n')\r\n else:\r\n stdout.write(s[0]+str(len(s[1:-1]))+s[-1]+'\\n')\r\nif __name__=='__main__':\r\n main()\r\n'''\r\n#158A\r\n'''\r\ndef main():\r\n from sys import stdin,stdout\r\n n,k=map(int,stdin.readline().split())\r\n a=list(map(int,stdin.readline().split()))\r\n count=0\r\n for i in range(n):\r\n if a[i] and a[i]>=a[k-1]:\r\n count+=1\r\n stdout.write(str(count))\r\nif __name__=='__main__':\r\n main()\r\n'''\r\n#188A\r\n'''\r\ndef main():\r\n from sys import stdin,stdout\r\n s=stdin.readline().strip()\r\n t=''\r\n s=s.lower()\r\n for i in s:\r\n if i not in 'aeiouy':\r\n t+='.'+i\r\n stdout.write(t)\r\nif __name__=='__main__':\r\n main()\r\n'''\r\n#50A\r\n'''\r\ndef main():\r\n from sys import stdin,stdout\r\n n,m=map(int,stdin.readline().split())\r\n stdout.write(str((n*m)//2))\r\nif __name__=='__main__':\r\n main()\r\n'''\r\n#231A\r\n'''\r\ndef main():\r\n from sys import stdin,stdout\r\n count=0\r\n for _ in range(int(stdin.readline())):\r\n if sum(list(map(int,stdin.readline().split())))>=2:\r\n count+=1\r\n stdout.write(str(count))\r\nif __name__=='__main__':\r\n main()\r\n'''\r\n#282A\r\n'''\r\ndef main():\r\n from sys import stdin,stdout\r\n x=0\r\n for _ in range(int(stdin.readline())):\r\n s=stdin.readline().strip()\r\n if '++' in s:\r\n x+=1\r\n elif '--' in s:\r\n x-=1\r\n stdout.write(str(x))\r\nif __name__=='__main__':\r\n main()\r\n'''\r\n#158B\r\n'''\r\ndef main():\r\n from sys import stdin,stdout\r\n n=int(stdin.readline())\r\n l=sorted(list(map(int,stdin.readline().split())))\r\n counter=l.count(4)\r\n l=l[:n-counter]\r\n i=0\r\n while len(l):\r\n if len(l)==1:\r\n counter+=1\r\n break\r\n \r\n stdout.write(str(counter))\r\nif __name__=='__main__':\r\n main()\r\n'''\r\n#96A\r\n'''\r\ndef main():\r\n from sys import stdin,stdout\r\n s=stdin.readline().strip()\r\n count=1\r\n flag=0\r\n for i in range(1,len(s)):\r\n if s[i]==s[i-1]:\r\n count+=1\r\n if count >=7:\r\n flag=1\r\n break\r\n else:\r\n count=1\r\n if flag:\r\n stdout.write('YES')\r\n else:\r\n stdout.write('NO')\r\nif __name__=='__main__':\r\n main()\r\n'''\r\n#116A\r\n'''\r\ndef main():\r\n from sys import stdin,stdout\r\n maxim=0\r\n total=0\r\n for _ in range(int(stdin.readline())):\r\n a,b=map(int,stdin.readline().split())\r\n total+=(b-a)\r\n if total >maxim:\r\n maxim=total\r\n stdout.write(str(maxim))\r\nif __name__=='__main__':\r\n main()\r\n'''\r\n#112A\r\n'''\r\ndef main():\r\n from sys import stdin,stdout\r\n s=stdin.readline().strip().lower()\r\n t=stdin.readline().strip().lower()\r\n if s==t:\r\n stdout.write('0')\r\n elif s < t:\r\n stdout.write('-1')\r\n else:\r\n stdout.write('1')\r\nif __name__=='__main__':\r\n main()\r\n'''\r\n#339A\r\n'''\r\ndef main():\r\n from sys import stdin,stdout\r\n l=list(map(str,stdin.readline().strip().split('+')))\r\n l.sort()\r\n stdout.write('+'.join(l))\r\nif __name__=='__main__':\r\n main()\r\n'''\r\n#131A\r\n'''\r\ndef main():\r\n from sys import stdin,stdout\r\n s=stdin.readline().strip()\r\n if s.isupper():\r\n stdout.write(s.lower())\r\n elif (s[0].islower() and s[1:].isupper()) or (len(s)==1 and s.islower()):\r\n stdout.write(s.title())\r\n else:\r\n stdout.write(s)\r\nif __name__=='__main__':\r\n main()\r\n'''\r\n#266A\r\n'''\r\ndef main():\r\n from sys import stdin,stdout\r\n n=int(stdin.readline())\r\n count=0\r\n s=stdin.readline().strip()\r\n for i in range(1,n):\r\n if s[i]==s[i-1]:\r\n count+=1\r\n stdout.write(str(count))\r\nif __name__=='__main__':\r\n main()\r\n'''\r\n#133A\r\n'''\r\ndef main():\r\n from sys import stdin,stdout\r\n s=stdin.readline().strip()\r\n if 'H' in s or 'Q' in s or '9' in s:\r\n stdout.write('YES')\r\n else:\r\n stdout.write('NO')\r\nif __name__=='__main__':\r\n main()\r\n'''\r\n#281A\r\n'''\r\ndef main():\r\n from sys import stdin,stdout\r\n s=stdin.readline().strip()\r\n stdout.write(s[0].upper()+s[1:])\r\nif __name__=='__main__':\r\n main()\r\n'''\r\n#58A\r\n'''\r\ndef main():\r\n from sys import stdin,stdout\r\n test='hello'\r\n s=stdin.readline().strip()\r\n while len(test) and len(s):\r\n if test[0]==s[0]:\r\n test=test[1:]\r\n s=s[1:]\r\n else:\r\n s=s[1:]\r\n if test=='':\r\n stdout.write('YES')\r\n else:\r\n stdout.write('NO')\r\nif __name__=='__main__':\r\n main()\r\n'''\r\n#236A\r\n'''\r\ndef main():\r\n from sys import stdin,stdout\r\n if len(set(stdin.readline().strip())) & 1:\r\n stdout.write('IGNORE HIM!')\r\n else:\r\n stdout.write('CHAT WITH HER!')\r\nif __name__=='__main__':\r\n main()\r\n'''\r\n#467A\r\n'''\r\ndef main():\r\n from sys import stdin,stdout\r\n count=0\r\n for _ in range(int(stdin.readline())):\r\n a,b=map(int,stdin.readline().split())\r\n if b-a>=2:\r\n count+=1\r\n stdout.write(str(count))\r\nif __name__=='__main__':\r\n main()\r\n'''\r\n#148A\r\n'''\r\ndef main():\r\n from sys import stdin,stdout\r\n k=int(stdin.readline())\r\n l=int(stdin.readline())\r\n m=int(stdin.readline())\r\n n=int(stdin.readline())\r\n d=int(stdin.readline())\r\n count=0\r\n for i in range(1,d+1):\r\n if i % k and i % l and i % m and i % n:\r\n count+=1\r\n stdout.write(str(d-count))\r\nif __name__=='__main__':\r\n main()\r\n'''\r\n#263A\r\n'''\r\ndef main():\r\n from sys import stdin,stdout\r\n for i in range(5):\r\n a=list(map(int,stdin.readline().split()))\r\n try:\r\n x=a.index(1)+1\r\n y=i+1\r\n except:\r\n g=''\r\n stdout.write(str(abs(x-3)+abs(y-3)))\r\nif __name__=='__main__':\r\n main()\r\n'''\r\n#546A\r\n'''\r\ndef main():\r\n from sys import stdin,stdout\r\n k,n,w=map(int,stdin.readline().split())\r\n m=(w*(w+1)*k)//2\r\n if m<=n:\r\n stdout.write('0')\r\n else:\r\n stdout.write(str(m-n))\r\nif __name__=='__main__':\r\n main()\r\n'''\r\n#136A\r\n'''\r\ndef main():\r\n from sys import stdin,stdout\r\n n=int(stdin.readline())\r\n l=list(map(int,stdin.readline().split()))\r\n p=[0 for _ in range(n)]\r\n for i in range(n):\r\n p[l[i]-1]=i+1\r\n stdout.write(' '.join(str(x) for x in p))\r\nif __name__=='__main__':\r\n main()\r\n'''\r\n#122A\r\n'''\r\ndef main():\r\n l=[]\r\n for i in range(4,1001):\r\n s=str(i)\r\n flag=1\r\n for element in s:\r\n if element !='4' and element !='7':\r\n flag=0\r\n break\r\n if flag:\r\n l.append(i)\r\n from sys import stdin,stdout\r\n n=int(stdin.readline())\r\n for i in l:\r\n if n%i==0:\r\n stdout.write('YES')\r\n return\r\n stdout.write('NO')\r\nif __name__=='__main__':\r\n main()\r\n'''\r\n#266B\r\n'''\r\ndef main():\r\n from sys import stdin,stdout\r\n n,x=map(int,stdin.readline().split())\r\n s=stdin.readline().strip()\r\n for _ in range(x):\r\n s=s.replace('BG','GB')\r\n stdout.write(s)\r\nif __name__=='__main__':\r\n main()\r\n'''\r\n#271A\r\n'''\r\ndef main():\r\n from sys import stdin,stdout\r\n n=int(stdin.readline())\r\n n+=1\r\n while True:\r\n if len(str(n))==len(set(str(n))):\r\n break\r\n else:\r\n n+=1\r\n stdout.write(str(n))\r\nif __name__=='__main__':\r\n main()\r\n'''\r\n#41A\r\n'''\r\ndef main():\r\n from sys import stdin,stdout\r\n a=stdin.readline().strip()\r\n b=stdin.readline().strip()\r\n if a==b[-1::-1]:\r\n stdout.write('YES')\r\n else:\r\n stdout.write('NO')\r\nif __name__=='__main__':\r\n main()\r\n'''\r\n#160A\r\n'''\r\ndef main():\r\n from sys import stdin,stdout\r\n n=int(stdin.readline())\r\n l=sorted(list(map(int,stdin.readline().split())))\r\n p=l[-1]\r\n lsum=sum(l[:-1])\r\n l=l[:-1]\r\n count=1\r\n while lsum >= p:\r\n p+=l[-1]\r\n lsum-=l[-1]\r\n l=l[:-1]\r\n count+=1\r\n stdout.write(str(count))\r\nif __name__=='__main__':\r\n main()\r\n'''\r\n#110A\r\n'''\r\ndef main():\r\n from sys import stdin,stdout\r\n s=stdin.readline().strip()\r\n k=s.count('4')+s.count('7')\r\n if k==4 or k==7:\r\n stdout.write('YES')\r\n else:\r\n stdout.write('NO')\r\nif __name__=='__main__':\r\n main()\r\n'''\r\n#100989A\r\n'''\r\ndef main():\r\n from sys import stdin,stdout\r\n stdout.write(str(int(stdin.readline())+1))\r\nif __name__=='__main__':\r\n main()\r\n'''\r\n#100989C\r\n'''\r\ndef main():\r\n from sys import stdin,stdout\r\n count=0\r\n for _ in range(int(stdin.readline())):\r\n a,b=map(int,stdin.readline().split())\r\n count+=(b-a)\r\n stdout.write(str(count))\r\nif __name__=='__main__':\r\n main()\r\n'''\r\n#100989D\r\n'''\r\ndef main():\r\n from sys import stdin,stdout\r\n n,q=map(int,stdin.readline().split())\r\n l=sorted(list(map(int,stdin.readline().split())))\r\n o=[]\r\n for i in range(n):\r\n o.append(0)\r\n while q:\r\n a,b=map(str,stdin.readline().split())\r\n if a =='in':\r\n b=int(b)\r\n flag=0\r\n for i in range(n):\r\n if b<=l[i] and o[i]==0:\r\n o[i]=1\r\n flag=1\r\n break\r\n if flag:\r\n stdout.write(str(i+1)+'\\n')\r\n else:\r\n stdout.write('-1\\n')\r\n else:\r\n b=int(b)-1\r\n o[b]=0\r\n q-=1\r\nif __name__=='__main__':\r\n main()\r\n'''\r\n#82A\r\n'''\r\ndef main():\r\n from sys import stdin, stdout\r\n n=int(stdin.readline())\r\n while n>5:\r\n if n&1:\r\n n-=5\r\n n//=2\r\n else:\r\n n-=4\r\n n//=2\r\n if n==1:\r\n stdout.write('Sheldon')\r\n elif n==2:\r\n stdout.write('Leonard')\r\n elif n==3:\r\n stdout.write('Penny')\r\n elif n==4:\r\n stdout.write('Rajesh')\r\n else:\r\n stdout.write('Howard')\r\nif __name__=='__main__':\r\n main()\r\n'''\r\n#460A\r\n'''\r\nWA\r\ndef main():\r\n from sys import stdin,stdout\r\n n,m=map(int,stdin.readline().split())\r\n counter=n\r\n while n>=m:\r\n counter+=n//m\r\n n//=m\r\n stdout.write(str(counter))\r\nif __name__=='__main__':\r\n main()\r\n'''\r\n#479A\r\n'''\r\ndef main():\r\n from sys import stdin,stdout\r\n a=int(stdin.readline())\r\n b=int(stdin.readline())\r\n c=int(stdin.readline())\r\n maxim=a*b*c\r\n if a+b+c > maxim:\r\n maxim=a+b+c\r\n if (a+b)*c >maxim:\r\n maxim=(a+b)*c\r\n if a*(b+c)>maxim:\r\n maxim=a*(b+c)\r\n if a+b*c > maxim:\r\n maxim=a+b*c\r\n stdout.write(str(maxim))\r\nif __name__=='__main__':\r\n main()\r\n'''\r\n#69A\r\n'''\r\ndef main():\r\n from sys import stdin,stdout\r\n a,b,c=0,0,0\r\n for _ in range(int(stdin.readline())):\r\n x,y,z=map(int,stdin.readline().split())\r\n a+=x\r\n b+=y\r\n c+=z\r\n if a or b or c:\r\n stdout.write('NO')\r\n else:\r\n stdout.write('YES')\r\nif __name__=='__main__':\r\n main()\r\n'''\r\n#580A\r\n'''\r\ndef main():\r\n from sys import stdin,stdout\r\n n=int(stdin.readline())\r\n l=list(map(int,stdin.readline().split()))\r\n max_so_far=1\r\n counter=1\r\n for i in range(1,n):\r\n if l[i]>=l[i-1]:\r\n counter+=1\r\n else:\r\n max_so_far=max(max_so_far,counter)\r\n counter=1\r\n stdout.write(str(max(max_so_far,counter)))\r\nif __name__=='__main__':\r\n main()\r\n'''\r\n#337A\r\n'''\r\ndef main():\r\n from sys import stdin,stdout\r\n n,m=map(int,stdin.readline().split())\r\n li=sorted(list(map(int,stdin.readline().split())))\r\n minim=100000\r\n for i in range(m-n+1):\r\n sub=li[i:i+n]\r\n d=0\r\n for i in range(1,len(sub)):\r\n d+=sub[i]-sub[i-1]\r\n minim=min(minim,d)\r\n stdout.write(str(minim))\r\nif __name__=='__main__':\r\n main()\r\n'''\r\n#472A\r\n'''\r\ndef main():\r\n from sys import stdin,stdout\r\n from math import floor,sqrt\r\n def check(n):\r\n if n==2:\r\n return True\r\n elif n & 1:\r\n for i in range(3,floor(sqrt(n))+1):\r\n if n % i==0:\r\n return False\r\n return True\r\n else:\r\n return False\r\n n=int(stdin.readline())\r\n i=4\r\n while True:\r\n #print(check(i),check(n-i))\r\n if check(n-i) or check(i):\r\n i+=1\r\n continue\r\n else:\r\n stdout.write(str(i)+' '+str(n-i))\r\n break\r\nif __name__=='__main__':\r\n main()\r\n'''\r\n#119A\r\n'''\r\ndef main():\r\n def gcd(a,b):\r\n if b:\r\n return gcd(b,a%b)\r\n else:\r\n return a\r\n from sys import stdin,stdout\r\n a,b,n=map(int,stdin.readline().split())\r\n flag=0\r\n while n > 0:\r\n if flag:\r\n n-=gcd(n,b)\r\n flag=0\r\n else:\r\n n-=gcd(n,a)\r\n flag=1\r\n if flag:\r\n stdout.write('0')\r\n else:\r\n stdout.write('1')\r\nif __name__=='__main__':\r\n main()\r\n'''\r\n#451A\r\n'''\r\ndef main():\r\n from sys import stdin,stdout\r\n a,b=map(int,stdin.readline().split())\r\n if a==1 or b==1:\r\n stdout.write('Akshat')\r\n elif min(a,b)**2 & 1:\r\n stdout.write('Akshat')\r\n else:\r\n stdout.write('Malvika')\r\nif __name__=='__main__':\r\n main()\r\n'''\r\n#379A\r\n'''\r\ndef main():\r\n from sys import stdin,stdout\r\n a,b=map(int,stdin.readline().split())\r\n counter=a\r\n while a:\r\n counter+=a//b\r\n if a > b:\r\n d=a%b\r\n else:\r\n d=0\r\n a=(a+d)//b\r\n stdout.write(str(counter))\r\nif __name__=='__main__':\r\n main()\r\n'''\r\n#208A\r\n'''\r\ndef main():\r\n from sys import stdin,stdout\r\n s=stdin.readline().strip()\r\n stdout.write(s.replace('WUB',' ').strip())\r\nif __name__=='__main__':\r\n main()\r\n'''\r\n#144A\r\n'''\r\ndef main():\r\n from sys import stdin,stdout\r\n n=int(stdin.readline())\r\n t=tuple(map(int,stdin.readline().split()))\r\n maxim=t[0]\r\n imaxim=0\r\n minim=t[0]\r\n iminim=0\r\n for i in range(1,n):\r\n if t[i] > maxim:\r\n maxim=t[i]\r\n imaxim=i\r\n if t[i] <=minim:\r\n minim=t[i]\r\n iminim=i\r\n if imaxim > iminim:\r\n stdout.write(str(imaxim+n-iminim-2))\r\n else:\r\n stdout.write(str(imaxim+n-iminim-1))\r\nif __name__=='__main__':\r\n main()\r\n'''\r\n#469A\r\n'''\r\ndef main():\r\n from sys import stdin,stdout\r\n a=set()\r\n n=set(range(1,int(stdin.readline())+1))\r\n for i in range(2):\r\n a.update(tuple(map(int,stdin.readline().split()))[1:])\r\n if a==n:\r\n stdout.write('I become the guy.')\r\n else:\r\n stdout.write('Oh, my keyboard!')\r\nif __name__=='__main__':\r\n main()\r\n'''\r\n#344A\r\n'''\r\ndef main():\r\n from sys import stdin,stdout\r\n state=''\r\n counter=0\r\n for _ in range(int(stdin.readline())):\r\n s=stdin.readline()\r\n if s!=state:\r\n counter+=1\r\n state=s\r\n stdout.write(str(counter))\r\nif __name__=='__main__':\r\n main()\r\n'''\r\n#443A\r\n'''\r\ndef main():\r\n from sys import stdin,stdout\r\n s=set(stdin.readline().strip()[1:-1].split(', '))\r\n if '' in s:\r\n stdout.write('0')\r\n else:\r\n stdout.write(str(len(s)))\r\nif __name__=='__main__':\r\n main()\r\n'''\r\n#228A\r\n'''\r\ndef main():\r\n from sys import stdin,stdout\r\n stdout.write(str(4-len(set(map(int,stdin.readline().split())))))\r\nif __name__=='__main__':\r\n main()\r\n'''\r\n#510A\r\n'''\r\ndef main():\r\n from sys import stdin,stdout\r\n n,m=map(int,stdin.readline().split())\r\n for i in range(n):\r\n if (i & 3) & 1 :\r\n if i & 3 == 1:\r\n stdout.write('.'*(m-1)+'#\\n')\r\n else:\r\n stdout.write('#'+'.'*(m-1)+'\\n')\r\n else:\r\n stdout.write('#'*m+'\\n')\r\nif __name__=='__main__':\r\n main()\r\n'''\r\n#61A\r\n'''\r\ndef main():\r\n from sys import stdin,stdout\r\n a=stdin.readline().strip()\r\n b=stdin.readline().strip()\r\n s=''\r\n for i in range(len(a)):\r\n if a[i]==b[i]:\r\n s+='0'\r\n else:\r\n s+='1'\r\n stdout.write(s)\r\nif __name__=='__main__':\r\n main()\r\n'''\r\n#492A\r\n'''\r\ndef main():\r\n from sys import stdin,stdout\r\n n=int(stdin.readline())\r\n s=0\r\n i=0\r\n while s<=n:\r\n #print(i,s,n)\r\n s+=((i+2)*(i+1))//2\r\n i+=1\r\n stdout.write(str(i-1))\r\nif __name__=='__main__':\r\n main()\r\n'''\r\n#617A\r\n'''\r\ndef main():\r\n from sys import stdin,stdout\r\n from math import ceil\r\n stdout.write(str(ceil(int(stdin.readline())/5)))\r\nif __name__=='__main__':\r\n main()\r\n'''\r\n#313A\r\n'''\r\ndef main():\r\n from sys import stdin,stdout\r\n n=int(stdin.readline())\r\n if n<0:\r\n n*=-1\r\n b=n//10\r\n a=(b//10)*10+n%10\r\n if a<b:\r\n if a:\r\n stdout.write('-'+str(a))\r\n else:\r\n stdout.write('0')\r\n else:\r\n if b:\r\n stdout.write('-'+str(b))\r\n else:\r\n stdout.write('0')\r\n else:\r\n stdout.write(str(n))\r\nif __name__=='__main__':\r\n main()\r\n'''\r\n#448A\r\n'''\r\ndef main():\r\n from sys import stdin,stdout\r\n from math import ceil\r\n a=sum(map(int,stdin.readline().split()))\r\n b=sum(map(int,stdin.readline().split()))\r\n c=int(stdin.readline())\r\n counter=0\r\n if a:\r\n counter+=1\r\n counter+=ceil(a/5)-1\r\n if b:\r\n counter+=1\r\n counter+=ceil(b/10)-1\r\n if counter <= c:\r\n stdout.write('YES')\r\n else:\r\n stdout.write('NO')\r\nif __name__=='__main__':\r\n main()\r\n'''\r\n#519A\r\n'''\r\ndef main():\r\n from sys import stdin,stdout\r\n score={'q':9,'r':5,'b':3,'n':3,'p':1,'k':0}\r\n white=0\r\n dark=0\r\n for _ in range(8):\r\n for i in stdin.readline().strip():\r\n if i=='.':\r\n continue\r\n else:\r\n if i in 'qrbnpk':\r\n dark+=score[i]\r\n else:\r\n white+=score[i.lower()]\r\n if white>dark:\r\n stdout.write('White')\r\n elif white==dark:\r\n stdout.write('Draw')\r\n else:\r\n stdout.write('Black')\r\nif __name__=='__main__':\r\n main()\r\n'''\r\n'''\r\nWA\r\n#556A\r\ndef main():\r\n from sys import stdin,stdout\r\n n=int(stdin.readline())\r\n s=stdin.readline().strip()\r\n if s.count('0')==n or s.count('1')==n:\r\n stdout.write(str(n))\r\n return\r\n c=0\r\n while c!=n:\r\n c=n\r\n s=s.replace('01','',len(s))\r\n s=s.replace('10','',len(s))\r\n n=len(s)\r\n stdout.write(str(len(s)))\r\nif __name__=='__main__':\r\n main()\r\n'''\r\n'''\r\n#486A\r\ndef main():\r\n from sys import stdin,stdout\r\n from math import ceil\r\n n=int(stdin.readline())\r\n result=ceil(n/2)\r\n n//=2\r\n stdout.write(str(n*(n+1)-result*result))\r\nif __name__=='__main__':\r\n main()\r\n'''\r\n'''\r\n#230A\r\ndef main():\r\n from sys import stdin,stdout\r\n dic={}\r\n s,n=map(int,stdin.readline().split())\r\n while n:\r\n a,b=map(int,stdin.readline().split())\r\n dic[a]=dic.get(a,0)+b\r\n n-=1\r\n flag=1\r\n for key in sorted(dic.keys()):\r\n if s<=key:\r\n flag=0\r\n break\r\n else:\r\n s+=dic[key]\r\n if flag:\r\n stdout.write('YES')\r\n else:\r\n stdout.write('NO')\r\nif __name__=='__main__':\r\n main()\r\n'''\r\n#339B\r\n'''\r\ndef main():\r\n from sys import stdin,stdout\r\n n,m=map(int,stdin.readline().split())\r\n tup=tuple(map(int,stdin.readline().split()))\r\n x=1\r\n w=0\r\n for i in range(m):\r\n if tup[i]>=x:\r\n w+=tup[i]-x\r\n x=tup[i]\r\n else:\r\n w+=(n-x)+tup[i]\r\n x=tup[i]\r\n stdout.write(str(w))\r\nif __name__=='__main__':\r\n main()\r\n'''\r\n#519B\r\n'''\r\ndef main():\r\n from sys import stdin,stdout\r\n n=int(stdin.readline())\r\n l=[]\r\n tup=sorted(list(map(int,stdin.readline().split())))\r\n for _ in range(2):\r\n t=sorted(list(map(int,stdin.readline().split())))\r\n for i in range(len(tup)):\r\n if i<len(t):\r\n if tup[i]!=t[i]:\r\n l.append(tup[i])\r\n break\r\n else:\r\n l.append(tup[i])\r\n tup=t.copy()\r\n for i in l:\r\n stdout.write(str(i)+'\\n')\r\nif __name__=='__main__':\r\n main()\r\n'''\r\n#570A\r\n'''\r\ndef main():\r\n from sys import stdin,stdout\r\n n,m=map(int,stdin.readline().split())\r\n l=[]\r\n for _ in range(n):\r\n l.append(0)\r\n for _ in range(m):\r\n line=tuple(map(int,stdin.readline().split()))\r\n l[line.index(max(line))]+=1\r\n stdout.write(str(l.index(max(l))+1))\r\nif __name__=='__main__':\r\n main()\r\n'''\r\n#427A\r\n'''\r\nWA\r\ndef main():\r\n from sys import stdin,stdout\r\n n=int(stdin.readline())\r\n counter=0\r\n pcount=0\r\n for i in stdin.readline().strip().split():\r\n if int(i)>0:\r\n if pcount>=10:\r\n continue\r\n else:\r\n if pcount + int(i)>10:\r\n pcount=10\r\n else:\r\n pcount+=int(i)\r\n else:\r\n if pcount>0:\r\n pcount-=1\r\n else:\r\n counter+=1\r\n stdout.write(str(counter))\r\nif __name__=='__main__':\r\n main()\r\n'''\r\n#702B\r\n'''\r\ndef main():\r\n from sys import stdin,stdout\r\n n=int(stdin.readline())\r\n t=tuple(map(int,stdin.readline().split()))\r\n dic={}\r\n asum=0\r\n for i in t:\r\n for j in range(32):\r\n x=(1<<j)-i\r\n if x in dic:\r\n asum+=dic[x]\r\n if i not in dic:\r\n dic[i]=1\r\n else:\r\n dic[i]+=1\r\n stdout.write(str(asum))\r\nif __name__=='__main__':\r\n main()\r\n'''\r\n'''\r\n#514A\r\ndef main():\r\n from sys import stdin,stdout\r\n n=stdin.readline().strip()\r\n s=''\r\n for i in range(len(n)):\r\n if int(i):\r\n j=min(int(n[i]),9-int(n[i]))\r\n s+=str(j)\r\n else:\r\n if int(n[i])==9:\r\n s+='9'\r\n else:\r\n j=min(int(n[i]),9-int(n[i]))\r\n s+=str(j)\r\n stdout.write(s)\r\nif __name__=='__main__':\r\n main()\r\n'''\r\n#4C\r\n'''\r\ndef main():\r\n from sys import stdin,stdout\r\n bits='1'\r\n for i in range(int(1e5+1)):\r\n bits+='0'\r\n dic={}\r\n for i in range(int(stdin.readline())):\r\n s=stdin.readline().strip()\r\n if s not in dic:\r\n dic[s]=bits\r\n stdout.write('OK\\n')\r\n else:\r\n t=dic[s]\r\n i=1\r\n while t[i]=='1':\r\n i+=1\r\n dic[s]=t.replace('0','1',1)\r\n stdout.write(s+str(i)+'\\n')\r\nif __name__=='__main__':\r\n main()\r\n'''\r\n#621A\r\n'''\r\ndef main():\r\n from sys import stdin,stdout\r\n stdin.readline()\r\n l=sorted(list(map(int,stdin.readline().split())))\r\n asum=sum(l)\r\n if asum & 1:\r\n for i in l:\r\n if i & 1:\r\n asum-=i\r\n break\r\n stdout.write(str(asum))\r\nif __name__=='__main__':\r\n main()\r\n'''\r\n#37A\r\ndef main():\r\n from sys import stdin,stdout\r\n stdin.readline()\r\n l=list(map(int,stdin.readline().split()))\r\n maxim=1\r\n s=set(l)\r\n for i in s:\r\n j=l.count(i)\r\n if j > maxim:\r\n maxim = j\r\n stdout.write(str(maxim)+' '+str(len(s)))\r\nif __name__=='__main__':\r\n main()\r\n", "n = int(input())\r\nl = list(map(int,input().split()))\r\na = [x for x in l if l.count(x) == 1]\r\nb = [x for x in l if l.count(x) != 1]\r\ntemp = 1\r\ncnt = 0\r\nfor x in b:\r\n if b.count(x) > temp:\r\n temp = b.count(x)\r\nfor i in range(1001):\r\n if i in b:\r\n cnt +=1\r\nprint(temp, len(a) + cnt)\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\n\r\na.sort()\r\nnum = [a[0]]\r\ncnt = [1]\r\n\r\nfor i in range (1, n):\r\n if a[i] != a[i-1]:\r\n num.append(a[i])\r\n cnt.append(1)\r\n else:\r\n cnt[-1] += 1\r\n\r\nflag = False\r\n\r\nfor i in range (len(cnt)):\r\n if cnt[i] != cnt[i-1]:\r\n flag = True\r\n break\r\n\r\nif flag:\r\n i = cnt.index(max(cnt))\r\n print(cnt[i], len(num))\r\nelse:\r\n print(cnt[-1], len(num))", "n = int(input())\r\na = [int(x) for x in input().split()]\r\ncnt_x_a = []\r\nfor x in set(a):\r\n cnt_x_a.append(a.count(x))\r\nprint(max(cnt_x_a), len(set(a)))", "n = int(input())\r\na = input().split()\r\nb = {}\r\nfor i in a:\r\n if i not in b:\r\n b[i] = 1\r\n else:\r\n b[i] += 1\r\nprint(max(b.values()), len(set(a)))", "n = int(input())\r\nl = list(map(int, input().split()))\r\nheight = 0\r\ntotal = []\r\nex = []\r\n\r\nfor i in range(n):\r\n ex.append(l.count(l[i]))\r\n\r\nfor i in range(n):\r\n if l[i] not in total:\r\n total.append(l[i])\r\n\r\nprint(max(ex), len(total))", "from collections import Counter\r\n\r\ndef main():\r\n N = int(input())\r\n L = [int(c) for c in input().split()]\r\n cnt = Counter(L)\r\n\r\n num_towers = len(cnt)\r\n max_height = max(list(cnt.values()))\r\n \r\n print(max_height, num_towers)\r\n\r\n \r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "from sys import stdin\r\n\r\ndef organizar(a):\r\n org=[]\r\n while len(a)>0:\r\n menor=a[0]\r\n for i in a:\r\n if menor>i:\r\n menor=i\r\n a.remove(menor)\r\n org.append(menor)\r\n return org\r\n\r\n\r\ndef torres(a,x):\r\n max_altura=1\r\n alt_actual=1\r\n pos_torre=1\r\n for i in range(x-1):\r\n if a[i]==a[i+1]:\r\n alt_actual+=1\r\n else:\r\n pos_torre+=1\r\n alt_actual=1\r\n\r\n if max_altura<alt_actual:\r\n max_altura=alt_actual\r\n \r\n return max_altura,pos_torre\r\n\r\n\r\n\r\ndef main():\r\n bar=int(stdin.readline().strip())\r\n lon_bar=list(map(int,stdin.readline().strip().split()))\r\n z=organizar(lon_bar)\r\n r=torres(z,bar)\r\n for i in r:\r\n print(i,end=\" \")\r\nmain()\r\n \r\n", "n = int(input())\r\nnums = list(map(int, input().split()))\r\n\r\n\r\ncount = {}\r\n\r\nfor num in nums:\r\n if num not in count:\r\n count[num] = 1\r\n else:\r\n count[num] +=1\r\n\r\nprint(max(count.values()), len(count))", "n = int(input())\r\nl = list(map(int, input().split()))\r\ny = len(set(l))\r\nif(y == n):\r\n print(\"%d %d\" % (1, y))\r\nelse:\r\n count = dict()\r\n for i in l:\r\n count[i] = 0\r\n for i in l:\r\n count[i] += 1\r\n large = 0\r\n for i in count:\r\n if(large < count[i]):\r\n large = count[i]\r\n print(\"%d %d\" % (large, y))", "if __name__ == \"__main__\":\r\n n = int (input ())\r\n\r\n arr = []\r\n count = [0] * 1001\r\n num = 0\r\n\r\n arr = list (map (int, input ().split ()))\r\n\r\n for i in range (len (arr)):\r\n count[arr[i]] += 1\r\n\r\n for i in range (len (count)):\r\n if count[i] > 0:\r\n num += 1\r\n\r\n print (f\"{max (count)} {num}\", end = \"\")", "n=int(input())\r\n\r\na = list(map(int,input().strip().split()))[:n]\r\nb=[]\r\nc=[]\r\n\r\nfor j in range(0,n):\r\n m=a[j]\r\n cnt=0\r\n if(a[j]!=-1):\r\n b.append(m)\r\n for i in range(0,n):\r\n if(a[i]==m):\r\n a[i]=-1\r\n cnt+=1\r\n c.append(cnt)\r\n \r\nprint(max(c),len(b))\r\n", "n = int(input())\nli = list(map(int,input().split()))\ncnt = [0]*1001\nmaxBuilt = 0\ncount = 0\nfor i in range(n):\n cnt[li[i]] += 1\n if cnt[li[i]] == 1:\n count += 1\n if maxBuilt < cnt[li[i]]:\n maxBuilt = cnt[li[i]]\nprint(maxBuilt,count)\n\n", "n = int(input())\r\nb = list(map(int, input().split()))\r\n\r\nprint(max(b.count(x) for x in set(b)), len(set(b)))", "input()\r\nb = input().split()\r\nprint(max(map(b.count, b)), len(set(b)))", "y = int(input())\r\nl =list( map(int,input().split()))\r\nse= set(l)\r\nco=[]\r\nfor i in se:\r\n\tco.append(l.count(i))\r\nma = max(co)\r\nleng =len(se)\r\nprint(ma,leng)\r\n", "n = int(input())\nb = list(map(int, input().split()))\n\nnum = len(set(b))\n\nmaxx = 0\n\nfor i in set(b):\n maxx = max(b.count(i), maxx)\n\nprint(maxx, num)\n", "n = int(input())\r\na = list(map(int, input().split()))\r\nb = list(set(a))\r\nc = 0\r\n\r\nfor i in b:\r\n x = a.count(i)\r\n if x > c:\r\n c = x\r\n\r\nprint(c, len(b))", "n=int(input())\r\nA=[int(i) for i in input().split()]\r\ndict={}\r\nmax=1\r\nfor i in A:\r\n if i not in dict:\r\n dict[i]=1\r\n else:\r\n dict[i]+=1\r\n if dict[i]>max:\r\n max=dict[i]\r\nprint(max,len(dict))", "def InsertionSort(a, n):\r\n for i in range(1, n):\r\n x = a[i]\r\n j = i - 1\r\n while j >= 0 and a[j] < x:\r\n a[j+1] = a[j]\r\n j -= 1\r\n a[j+1] = x\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\nh = [0]*1001\r\ncnt = 0\r\n\r\nfor i in range(n):\r\n if h[a[i]] == 0: cnt += 1\r\n h[a[i]] += 1\r\n\r\nInsertionSort(h, 1001)\r\nprint(h[0], cnt)", "n=int(input())\r\na=[int(i) for i in input().split()]\r\nd=dict()\r\n\r\nfor i in a:\r\n d[i]=0 \r\nfor i in a:\r\n d[i]+=1 \r\n \r\nleft=len(d)\r\nmax=0\r\nfor i in d:\r\n if(d[i]>max):\r\n max=d[i]\r\nright=max\r\nprint(right,left)\r\n \r\n ", "a = int(input())\r\nb = [int(i) for i in input().split()]\r\ns = set(b)\r\nn = []\r\nfor i in b:\r\n n += [b.count(i)]\r\nprint(max(n), len(s))", "if __name__ == \"__main__\":\n n_bars = int(input())\n bars = map(int, input().split())\n counts = {}\n for b in bars:\n if b not in counts:\n counts[b] = 1\n else:\n counts[b] += 1\n print(\"{} {}\".format(max(list(counts.values())), len(counts)))\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Mon Jun 8 10:39:42 2020\r\n\r\n@author: Harshal\r\n\"\"\"\r\n\r\nn=int(input())\r\ndic={}\r\narr=list(map(int,input().split()))\r\nfor i in arr:\r\n if i in dic:\r\n dic[i]+=1\r\n else:\r\n dic[i]=1\r\ncount=0\r\nmm=0\r\nfor x,y in dic.items():\r\n \r\n if y>mm:\r\n mm=y\r\n count+=1\r\nprint(mm,count)\r\n \r\n", "from collections import Counter\r\nn=int(input())\r\na=input().split(\" \")\r\na=list(map(int,a))\r\nc=Counter(a)\r\ns=set(a)\r\nprint (str(max(c.values()))+ \" \"+str(len(s)))\r\n\r\n\r\n", "input()\nL=list(map(int,input().split()))\nres={0:0}\nfor i in L:\n if i in res.keys():\n res[i]+=1\n else:\n res[i]=1\nprint(max(res.values()),len(set(L)))\n", "n = int(input())\r\ndata = list(map(int, input().split()))\r\n\r\nindexer, great, count = [0] * (max(data) + 1), 0, 0\r\n\r\nfor i in data:\r\n indexer[i] += 1\r\n\r\nfor i in range(len(indexer)):\r\n if indexer[i]:\r\n if indexer[i] > great:\r\n great = indexer[i]\r\n count += 1\r\n\r\nprint(great, count)\r\n\r\n\r\n", "n=int(input())\r\ncontainer=list(map(int, input().split()))\r\n\r\n'''temp=list()\r\nheight=1\r\nfor i in range(n):\r\n for j in range(i+1, n):\r\n if container[i]==container[j]:\r\n height+=1\r\n temp.append(height)\r\n height=1\r\n\r\nmySet=set(container)\r\nprint(max(temp), len(mySet))'''\r\n\r\nhm=dict()\r\nfor i in range(len(container)):\r\n item=container[i]\r\n if item not in hm.keys():\r\n hm.setdefault(item, container.count(item))\r\n\r\nmaxValue=0\r\nfor value in hm.values():\r\n if value>maxValue:\r\n maxValue=value\r\n\r\n\r\nprint(maxValue, len(hm))\r\n", "R = lambda: list(map(int, input().split()))\r\nn = R()\r\na = R()\r\n\r\nprint(max(a.count(i) for i in a) , len(set(a)))", "n=int(input())\r\nx=[int(x) for x in input().split()]\r\nl=[]\r\nnos=[1]\r\nfor i in x:\r\n if i not in l:\r\n l.append(i)\r\n else:\r\n nos.append(x.count(i))\r\nprint(max(nos),len(l))\r\n", "\r\n\r\nfrom collections import Counter\r\n\r\na = int(input())\r\n\r\nx = [int(x) for x in input().split()]\r\n\r\nm , n = Counter(x).most_common(1)[0]\r\n\r\n\r\nc = len(set(x))\r\nprint(n , c)", "from typing import List\n\ni : int; bar : int\n_ : int = input()\n\nbars : List = list(map(int, input().split()))\n\nbarFrq : List = [0 for i in range(max(bars)+1)]\n\nfor bar in bars:\n barFrq[bar] += 1\n\nprint(max(barFrq), len(set(bars)))\n \t\t\t \t \t \t \t \t \t\t \t \t", "n,ar=int(input()),list(map(int,input().split()))\r\nprint(max([ar.count(x) for x in ar]),len(set(ar)))\r\n", "N = int(input())\r\nn = list(map(int, input().split()))\r\nk = []\r\nc = []\r\nfor i in n:\r\n if i not in k:\r\n k += [i]\r\nfor i in n:\r\n a = n.count(i)\r\n c += [a]\r\nprint(max(c), len(k))\r\n", "import sys\r\ndef fun():\r\n n = int(sys.stdin.readline())\r\n lista = list(map(int,sys.stdin.readline().split()))\r\n lista1 = []\r\n for i in range(n):\r\n if lista[i] not in lista1:\r\n lista1.append(lista[i])\r\n \r\n torres = []\r\n for i in range(len(lista1)):\r\n cont = 0\r\n for j in range(n):\r\n if lista1[i] == lista[j]:\r\n \r\n cont += 1\r\n torres.append(cont)\r\n\r\n print(max(torres),len(torres))\r\n \r\nfun()\r\n", "def insertAsc(a, i, x):\r\n j = i\r\n while j > 0:\r\n if a[j-1] < x:\r\n break\r\n a[j] = a[j-1]\r\n j -= 1\r\n\r\n a[j] = x\r\n\r\n\r\ndef insertionSort(a, n):\r\n for i in range(1, n):\r\n x = a[i]\r\n insertAsc(a, i, x)\r\n\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\n\r\ninsertionSort(a, n)\r\n\r\ni = 0\r\ntotalTow = largestHeight = 0\r\n\r\nwhile i < n:\r\n totalTow += 1\r\n j = i + 1\r\n\r\n cur_height = 1\r\n\r\n while j < n and a[j] == a[i]:\r\n cur_height += 1\r\n j += 1\r\n\r\n largestHeight = max(largestHeight, cur_height)\r\n i = j\r\n\r\nprint(largestHeight, totalTow)\r\n", "# https://codeforces.com/problemset/problem/37/A\r\n\r\ndef func_sol(lines):\r\n f = [0] * 1001\r\n n = int(lines[0])\r\n a = list(map(int, lines[1].split(' ')))\r\n for e in a:\r\n f[e] += 1\r\n return str(max(f)) + ' ' + str(len([e for e in f if e != 0]))\r\n\r\n\r\ndef main():\r\n try:\r\n from codeforces.utilities import run_tests\r\n run_tests(func_sol)\r\n except ImportError:\r\n from sys import stdin\r\n print(func_sol(stdin.read().split('\\n')[:-1]))\r\n\r\n\r\nmain()\r\n", "from collections import Counter\n\nn, a = int(input()), (int(i) for i in input().split())\ncnt = Counter(a)\nres = cnt.most_common()[0][1], len(cnt)\nprint(*res)\n", "n = int(input())\r\nl = map(int, input().split())\r\n\r\ntmp = {}\r\nfor i in l:\r\n if i in tmp.keys():\r\n tmp[i] += 1\r\n else:\r\n tmp[i] = 1\r\n\r\nprint(max(tmp.values()),len(tmp))\r\n", "quantity = input() \r\nlength = input().split() \r\nprint(max(map(length.count, length)), len(set(length)))\r\n", "import collections\r\nn=int(input())\r\nm=0\r\na=list(map(int,input().split()))\r\nfreq=collections.Counter(a)\r\nfor key,val in freq.items():\r\n\tif val>m:\r\n\t\tm=val\r\nprint(m,len(set(a)))\r\n", "n = int(input())\r\n\r\ns = [int(i) for i in input().split()]\r\n\r\nres = {}\r\n\r\nfor i in s:\r\n if i in res:\r\n res[i] += 1\r\n else:\r\n res[i] = 1\r\nm = 1\r\n\r\nfor i in res.keys():\r\n if res[i] > m:\r\n m = res[i]\r\nprint(m, len(res))\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\na_set = set(a)\r\n\r\nprint(max(a.count(i) for i in a_set), len(a_set))\r\n", "from collections import Counter\r\nn=int(input())\r\nl=list(map(int,input().split()))\r\na=Counter(l)\r\ns=1\r\nfor i,j in a.most_common():\r\n if j>s:\r\n s=j\r\nprint(s,len(set(l)))", "is_debug = False\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\na = sorted(a)\r\nb = set(a)\r\n\r\nm = -1\r\nc = 1\r\nfor i in range(1, len(a)):\r\n if a[i-1] == a[i]:\r\n c += 1\r\n else:\r\n m = max(m, c)\r\n c = 1\r\nm = max(m, c)\r\n\r\nprint(f\"{m} {len(b)}\")\r\n", "n=int(input())\r\n\r\nx=list(map(int,input().split()))\r\nans=dict()\r\ny=set()\r\nm=0\r\nfor i in x:\r\n y.add(i)\r\n if i in ans:\r\n ans[i]+=1\r\n if ans[i]>m:\r\n m=ans[i]\r\n else:\r\n ans[i]=1\r\n if ans[i]>m:\r\n m=ans[i]\r\n \r\nprint(m)\r\n\r\nprint(len(y))\r\n", "n = int(input())\r\nh = [0] * 1001\r\n\r\nfor l in map(int, input().split()):\r\n h[l] += 1\r\n\r\nheight = max(h)\r\nnumber = sum(x != 0 for x in h)\r\n\r\nprint(height, number)\r\n", "number = int(input())\r\nlengths = [int(i) for i in input().split()]\r\nrepeated = []\r\n\r\nfor i in lengths:\r\n repeated.append(lengths.count(i))\r\nheight = max(repeated)\r\nlength1 = len(set(lengths))\r\nprint(height, length1)", "n = int(input())\nl = map(int, input().split())\n\nl = sorted(l)\n\ntowers = n\nheight = 1\nmax_height = 1\nfor i in range(1,n):\n if l[i] == l[i-1]:\n towers -= 1\n height += 1\n\n if height > max_height:\n max_height = height\n else:\n height = 1\n\nprint(max_height, towers)\n", "n = int(input())\r\nb = [int(i) for i in input().split()]\r\na = {}\r\nfor i in b:\r\n a[i] = 0\r\nfor i in b:\r\n a[i]+=1\r\nprint(max(a.values()), len(a))", "n= int(input())\r\nl=[int(x) for x in input().split()]\r\ns=list(set(l))\r\nres=[l.count(x) for x in s]\r\nprint(max(res), len(s))", "#we need to find the number that repeast the most then count how many times we have it in our array\n#we then print that count and also print the length of the arrays without repeating elements\n#there are no for or iterations\n\nn = int(input())\nsizes = list(map(int, input().split()))\n\nmost_frequent = max(set(sizes), key = sizes.count)\ncount = sizes.count(most_frequent)\n\nprint(count, len(list(dict.fromkeys(sizes))))\n \t \t \t \t \t\t\t \t \t", "input()\r\nbase = 0\r\nheight = 1\r\ncount = 1\r\nline = input().split()\r\nline = [int(i) for i in line]\r\nline.sort()\r\nnum = len(set(line))\r\nfor i in line:\r\n if i == base:\r\n count += 1\r\n height = max(height,count)\r\n else:\r\n base = i\r\n count = 1\r\nprint(height,num)\r\n", "from sys import stdin\r\ndef torres(l):\r\n d={}\r\n for i in l:\r\n if i in d:\r\n d[i]+=1\r\n else:\r\n d[i]=1\r\n return d\r\ndef main():\r\n n=int(stdin.readline().strip())\r\n l=stdin.readline().strip().split()\r\n d=torres(l)\r\n m=0\r\n for i in d:\r\n if d[i]>m:\r\n m=d[i]\r\n print(m,len(d))\r\nmain()\r\n", "input()\r\nd={}\r\nfor i in input().split(): d[i]=d.get(i,0)+1\r\nprint(max(d.values()),len(d))", "n=int(input())\r\nx=list(map(int,input().split()))\r\nfrom collections import Counter as cc\r\nz=cc(x)\r\nprint(z.most_common(1)[0][1],len(z))\r\n", "n=int(input())\r\nl=list(map(int,input().split()))[:n]\r\nl1=[]\r\nfor i in l:\r\n l1.append(l.count(i))\r\nprint(max(l1),end=' ')\r\nprint(len(set(l)))", "num = int(input())\r\nlist_ = list(map(int, input().split()))\r\nmax_ =0\r\nfor i in list_:\r\n p = list_.count(i)\r\n max_ = max(p,max_)\r\nprint(max_, len(set(list_)))", "n = int(input())\r\ntowers = []\r\ntowers = list(map(int,input().split()))\r\n# print(towers)\r\ntowers.sort()\r\nunique = list(set(towers))\r\n\r\nmax = 0\r\nfor u in unique:\r\n if towers.count(u) > max:\r\n max = towers.count(u)\r\n\r\nprint(max, len(unique))", "n = int(input())\r\n*a, = map(int, input().split())\r\nd = {}\r\nfor i in a:\r\n if not i in d: d[i] = 0\r\n d[i] += 1\r\nm = 0\r\nfor i in d:\r\n m = max(m, d[i])\r\nprint(m, len(d))", "n=int(input())\r\na=list(map(int,input().split()))\r\nd={}\r\nfor i in range(n):\r\n if(a[i] not in d):\r\n d[a[i]]=1\r\n else:\r\n d[a[i]]+=1\r\nprint(max(list(d.values())),len(d.keys()))", "input()\r\nl = list(map(int, input().split()))\r\n\r\nheightMax = []\r\nfor i in l:\r\n heightMax.append(l.count(i))\r\n\r\nprint(max(heightMax), len(set(l)))\r\n", "n = int(input())\r\n#lens = [int(i) for i in input().split()]\r\ntot = n\r\nhs = [0]*1005\r\nfor e in map(int, input().split()):\r\n hs[e] += 1\r\n if hs[e] > 1:\r\n tot -= 1\r\nprint(str(max(hs)) + ' ' + str(tot))\r\n", "N = int(input())\r\nkit = list(map(int,input().split()))\r\nhashmap = {}\r\nfor i in kit:\r\n if i not in hashmap:\r\n hashmap[i] = 1\r\n else:\r\n hashmap[i] += 1\r\nnumOf = 0\r\nmaxH = 1\r\nfor i in hashmap.values():\r\n numOf += 1\r\n maxH = max(maxH,i)\r\nprint(maxH,numOf)", "s=''\r\ndef func(l1):\r\n l2=[0 for _ in range(1000)]\r\n for i in l1:\r\n l2[i-1]+=1\r\n m,c=0,0\r\n for i in range(len(l2)):\r\n m=max(m,l2[i])\r\n if l2[i]!=0:\r\n c+=1\r\n\r\n return (str(m)+' '+str(c))\r\n\r\nn=int(input())\r\n#n,k=(map(int,input().split()))\r\nl1=list(map(int,input().split()))\r\nprint(func(l1))", "input()\r\na = input().split()\r\nprint(max(a.count(i) for i in set(a)), len(set(a)))", "t = int(input()) # количество брусков\r\nx = list(map(int, input().split()))\r\ny = set(x) # создаём множество из списка брусков\r\na = []\r\nfor i in y:\r\n a.append(x.count(i)) # добавляем количество подстрок i из y в списке x\r\nprint(max(a), len(set(x))) # выводим высоту наибольшей башни и их кол-во", "N = int(input())\r\nlength = [int(x) for x in input().split()]\r\ns = set(length)\r\ntower = []\r\nfor x in s:\r\n num = length.count(x)\r\n tower.append(num)\r\nprint(max(tower),len(tower))", "n = int(input())\r\na = sorted(list(map(int, input().split())))\r\nans = [1, 1]\r\ntemp = a[0]\r\nh = 1\r\nfor i in a[1:]:\r\n if i == temp:\r\n h += 1\r\n else:\r\n temp = i\r\n ans[0] = max(ans[0], h)\r\n h = 1\r\n ans[1] += 1\r\nans[0] = max(ans[0], h)\r\nprint(*ans)\r\n", "n = int(input())\r\na = list(map(int, input(). split()))\r\nb = a.copy()\r\ns = 0\r\nm_a_x = 0\r\nc = []\r\nfor i in range(len(a)):\r\n while a[i] in b:\r\n b.remove(a[i])\r\n m_a_x += 1\r\n if a[i] not in b:\r\n s += 1\r\n c.append(m_a_x)\r\n m_a_x = 0\r\nprint(max(c), s)\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\nlargest = 0\r\nd = {}\r\nfor i in a:\r\n if i not in d:\r\n d[i] = 1\r\n else:\r\n d[i] += 1\r\n if d[i] > largest:\r\n largest = d[i]\r\nprint(largest, len(d))", "count_details = int(input())\r\nlength_details = list(map(int, input().split()))\r\nlength = len(length_details)\r\nhigh_of_details = []\r\nlist_of_count_towers = []\r\nfor detail in range(length):\r\n if length_details[detail] in list_of_count_towers:\r\n list_of_count_towers.remove(length_details[detail])\r\n list_of_count_towers.append(length_details[detail])\r\n high_of_details.append(length_details.count(length_details[detail]))\r\nhigh = max(high_of_details)\r\nprint(high, len(list_of_count_towers))", "n=int(input())\r\nl=list(map(int,input().split()))\r\ndict={}\r\nfor i in l:\r\n if i in dict:\r\n dict[i]+=1\r\n else:\r\n dict[i]=1\r\ncnt=0\r\ntotal=0\r\nfor i in dict:\r\n total+=1\r\n if dict[i]>cnt:\r\n cnt=dict[i]\r\nprint(cnt,end=\" \")\r\nprint(total)", "n = int(input())\r\nlis = list(map(int,input().split()))\r\ns = set(lis)\r\nmax = 0\r\nfor i in s:\r\n if lis.count(i) > max:\r\n max = lis.count(i)\r\nprint(max,len(s))", "#37A\r\nfrom collections import Counter #字典\r\nn=int(input())\r\ns=list(map(int,input().split()))\r\n\r\nkind_s=len(set(s)) #找出不重複的list有幾個\r\n\r\nmax1=max(s,key=s.count) #重複最多的資料\r\nt=0\r\nfor i in range(0,len(s)): #重複最多的資料，重複的次數\r\n if str(s[i])==str(max1):\r\n t=t+1\r\nprint(t,kind_s)", "from collections import defaultdict\ndef get(f): return f(input().strip())\ndef gets(f): return [*map(f, input().split())]\n\n\nn = get(int)\nd = defaultdict(int)\nfor l in gets(int):\n d[l] += 1\nprint(max(d.values()), len(d))\n", "def merge(L, n1, R, n2, a):\r\n i = j = k = 0\r\n \r\n while (i < n1) and (j < n2):\r\n if L[i] > R[j]:\r\n a[k] = L[i]\r\n i += 1\r\n else:\r\n a[k] = R[j]\r\n j += 1\r\n k += 1\r\n \t\r\n while i < n1:\r\n a[k] = L[i]\r\n i += 1\r\n k += 1\r\n \r\n while j < n2:\r\n a[k] = R[j]\r\n j += 1\r\n k += 1\r\n \r\ndef mergeSort(a, n):\r\n if n > 1:\r\n n1 = n // 2\r\n n2 = n - n1\r\n L = a[:n1]\r\n R = a[n1:]\r\n \r\n mergeSort(L, n1)\r\n mergeSort(R, n2)\r\n merge(L, n1, R, n2, a)\r\n \r\nn = int(input())\r\na = list(map(int, input().split()))\r\nmergeSort(a, n)\r\n\r\nmax = 1\r\nheight = 1\r\ncount = 1\r\n\r\nfor i in range(1, n):\r\n if a[i] == a[i - 1]:\r\n height += 1\r\n if max < height:\r\n max = height\r\n else:\r\n height = 1\r\n count += 1\r\n flag = 0\r\n \r\nprint('{0} {1}'.format(max, count))\r\n", "N=int(input())\r\nsk=list(input().split())\r\na=0\r\nb=0\r\ndic = {}\r\nfor nr in sk:\r\n if nr in dic:\r\n dic[nr] += 1\r\n else:\r\n dic[nr] = 1\r\nmaxVal = 0\r\nfor key in dic:\r\n if dic[key] > maxVal:\r\n maxVal = dic[key]\r\nfor key in dic:\r\n if dic[key]==1:\r\n a+=1\r\n else:\r\n b=dic[key]\r\n b=b-b+1\r\n a+=1\r\nprint(maxVal, a)", "from collections import Counter\r\n\r\nk = int(input())\r\na = list(map(int,input().split()))\r\nl = dict(Counter(a))\r\nl = [v for i,v in l.items()]\r\np = max(l)\r\nprint(p,len(set(a)))", "a = []\nz = int(input())\nx = input()\ns1 = [int(n) for n in x.split(' ')]\ny = set(s1)\nfor i in y:\n a.append(s1.count(i))\nprint(max(a),len(y),end=' ')\n\t \t\t \t \t\t \t \t \t \t \t\t \t\t\t\t", "\r\nn = int(input())\r\nl = list(map(int, input().split()))\r\nd = []\r\ndubl = []\r\na = 0\r\nif 1 <= n <= 1000 and len(l) == n:\r\n for i in l:\r\n if not i in d:\r\n d.append(i)\r\n for i in range(len(l)):\r\n dubl.append(l.count(l[i]))\r\n a = max(dubl)\r\n print(a, len(d))", "from collections import Counter\r\nn=int(input())\r\nl=list(map(int,input().split()))\r\n\r\nc=Counter(l)\r\np=[]\r\nfor i in c:\r\n p.append(c[i])\r\n\r\nprint(max(p),end=\" \")\r\nprint(len(c))", "y = int(input())\nx = list(map(int, input().split(' ')))\np = []\nr = []\nfor i in x:\n s = x.count(i)\n if i not in p:\n r.append(s)\n p.append(i)\ntotal_tower = len(r)\nr.sort(reverse=True)\nmax_lenght = r[0]\nprint(f'{max_lenght} {total_tower}')\n\n\t \t\t\t \t\t \t \t\t\t\t \t\t \t \t\t", "# A. Towers\nimport collections\n\n_ = input()\nvalues = list(map(int, input().split()))\nheights = collections.defaultdict(int)\n\ntallest = 0\nfor value in values:\n heights[value] += 1\n tallest = max(heights[value], tallest)\n\nprint(str(tallest) + \" \" + str(len(heights)))", "n=int(input())\r\nbars=list(map(int,input().split()))\r\ntotal=[]\r\ndic={}\r\nfor i in bars:\r\n if i not in total:\r\n total.append(i)\r\n dic[i]=0\r\nfor j in bars:\r\n dic[j]+=1\r\nmax=0\r\nfor i in dic:\r\n if(dic[i]>max):\r\n max=dic[i]\r\nprint(str(max)+' '+str(len(total)))", "input()\r\na = list(map(int, input().split()))\r\nx = 1\r\nfor i in a:\r\n if a.count(i) > x:\r\n x = a.count(i)\r\nprint(x, len(set(a)), sep=' ')", "n = int(input())\r\nnums = [int(j) for j in input().split()]\r\nstream, freq = [], []\r\nfor j in range(n):\r\n if nums[j] in stream:\r\n freq[stream.index(nums[j])] += 1\r\n else:\r\n stream.append(nums[j])\r\n freq.append(1)\r\nprint(max(freq), len(stream))\r\n", "x=int(input())\r\nl=list(map(int,input().split()))\r\n\r\n\r\na=list(set(l))\r\nl.sort()\r\nmaxx=l.count(0)\r\nfor i in range(len(l)):\r\n if(l.count(l[i])>maxx):\r\n maxx=l.count(l[i])\r\nprint(maxx,len(a))\r\n", "# coding: utf-8\nn = int(input())\nli = {}\nfor i in input().split():\n if i in li.keys():\n li[i] += 1\n else:\n li[i] = 1\nprint(max(li.values()),len(li.keys()))\n", "l=[]\r\na = int(input())\r\nb = list(int(x) for x in input().split())\r\ns = set(b)\r\nfor i in s:\r\n l.append(b.count(i))\r\nprint(max(l),len(s))", "n = int(input() )\na = sorted(list(map(int, input().split() ) ) )\n\nmx, cnt = 1, 1\nfor i in range(1, n):\n cnt = 1 if a[i] != a[i-1] else cnt+1\n mx = max(mx, cnt)\nprint(mx, len(set(a) ) )\n\n\n", "n = int(input())\r\na = list(map(int,input().split()))\r\nappear = [0] * 1010\r\ndiff = 0\r\nmax_appear = 0\r\nfor i in range(n):\r\n if appear[a[i]] == 0: diff += 1\r\n appear[a[i]] += 1\r\n max_appear = max(max_appear, appear[a[i]])\r\n\r\nprint(max_appear, diff)\r\n", "n = int(input())\r\nl = list(map(int,input().split()))\r\nh = 0\r\ncount = 0\r\na = []\r\nfor i in range(n):\r\n if not l[i] in a:\r\n a.append(l[i])\r\n count += 1\r\nfor i in range(len(a)):\r\n if h < l.count(a[i]):\r\n h = l.count(a[i])\r\nprint(h,count)\r\n", "from collections import Counter\r\nn = int(input())\r\nc = Counter(map(int, input().split()))\r\nprint(max(c.values()), len(c))\r\n", "\r\nt=int(input())\r\narr=list(map(int,input().split()))\r\n# arr.sort()\r\nnew=[]\r\ns1=1\r\ns2=0\r\nfor i in arr:\r\n\tx=arr.count(i)\r\n\tnew.append(x)\r\narr=set(arr)\r\nprint(max(new),len(arr))\r\n\r\n", "num = int(input())\ntable = dict()\ntowers = [int(x) for x in input().split()]\nfor tow in towers:\n if not table.get(tow):\n table[tow] = 1\n else:\n table[tow] += 1\nprint(max(table.values()),len(table))\n", "def main():\r\n N = int(input())\r\n length = list(map(int, input().split()))\r\n\r\n length.sort()\r\n numTowers = 0\r\n currentLength = 0\r\n currentHeight = 1\r\n maxHeight = 1\r\n\r\n for k in range(N):\r\n if length[k] == currentLength:\r\n currentHeight += 1\r\n if currentHeight > maxHeight:\r\n maxHeight = currentHeight\r\n else:\r\n currentLength = length[k]\r\n currentHeight = 1\r\n numTowers += 1\r\n\r\n print(maxHeight, numTowers)\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n = int(input())\r\nnxt = input().split()\r\nnxt = [int(nxt[i]) for i in range(len(nxt))]\r\n\r\nMAX = float('-inf')\r\ncount = 0\r\nHASH = {}\r\n\r\nfor i in range(len(nxt)):\r\n if nxt[i] not in HASH: HASH[nxt[i]] = 0\r\n HASH[nxt[i]] += 1\r\n \r\nfor key, val in HASH.items():\r\n count += 1\r\n MAX = max(MAX, val)\r\n \r\n \r\nprint(MAX, count)", "import math\r\n# a, b, c = map(int,input().split()) => fixed number of inputs\r\n# list = [int(i) for i in input().split()] => adds elements to a listn\r\n# def most_frequent(List): => most frequent num\r\n# return max(set(List), key = List.count)\r\n# counter for total, total = 0 if condition isn't met in subsequence\r\n# @cache\r\n\r\n\r\ndef solve():\r\n n = int(input())\r\n l2 = []\r\n l1 = [int(i) for i in input().split()]\r\n s1 = set(l1)\r\n for i in range(n):\r\n if l1[i] in s1:\r\n l2.append(l1.count(l1[i]))\r\n s1.remove(l1[i])\r\n print(max(l2), len(l2))\r\n\r\nsolve()", "n = int(input())\r\ns = list(map(int, input().split()))\r\nkol = 0\r\nhei = 1\r\nmaxi = 1\r\nfor i in range(len(s)):\r\n for j in range(len(s)):\r\n if i != j and s[i] == s[j] and s[i] != 0 and s[j] != 0:\r\n hei += 1\r\n s[j] = 0\r\n if hei > maxi:\r\n maxi = hei\r\n hei = 1\r\nfor i in s:\r\n if i > 0:\r\n kol += 1\r\nprint(maxi, kol)", "import os,sys,io,math\r\nfrom array import array\r\nfrom math import *\r\nI=lambda:[*map(int,sys.stdin.readline().split())]\r\nIS=lambda:input()\r\nIN=lambda:int(input())\r\nIF=lambda:float(input())\r\n\r\nn=IN()\r\nl=I()\r\n# l.sort()\r\nr=0\r\nfor i in set(l):\r\n r=max(r,l.count(i))\r\nprint(r,len(set(l)))", "n=int(input())\r\nl=list(map(int,input().split()))\r\nm=[]\r\nc=0\r\nfor i in l:\r\n if l.count(i)>c:\r\n c=l.count(i)\r\nprint(c,len(set(l)))", "#En este codigo se tiene que saber de cuantos bloques es la torre mas alta y cuantos tamaños diferentes tiene de piezas\n#las piezas se pueden juntar si tienen el mismo tamaño \n#El primer número que pedimos en el input son los bloques que hay\n#Los segundos numeros que hay en el segundo input son sus tamaños\n#Para este codigo es haciendo un for donde este vaya viendo cada numero en los bloques, si encuentra mas de una vez el mismo numero lo guardaria en una variable llamada bloque mayor ya que haria alusion a que los esta apilando. Si no encuentra un numero repetido el valor que mandara sera 1 ya que la torre maxima solo se podria componer de 1 pieza\n#Esto se imprime junto con los tamaños que existen de los bloques\n#La instruccion len(set(---)) funciona para que se sepa la longitud de la lista pero tambien el set lo que hace es quitar los valores repetidos, por lo tanto si existen valores repetidos el set los omitirá y solo contará una vez el número repetido, esta instrucción la use porque es más facil conocer cuales son los valores de la lista sin necesidad de hacer algo más complejo. \n\n\nn_bloques = int(input())\nbloques = list(map(int, input().split()))\nmax = 0\nfor i in bloques:\n bloque_mayor = bloques.count(i)\n if bloque_mayor > max:\n max = bloque_mayor\nprint(max, len(set(bloques)))\n\t\t \t \t \t\t \t\t \t\t \t \t \t", "def conv(x):\r\n a=list()\r\n for i in x :\r\n a.append(int(i))\r\n return a\r\nx=dict()\r\ninput()\r\na=conv(input().split())\r\nfor i in a:\r\n try:\r\n x[i]+=1\r\n except:\r\n x[i]=1\r\nmax=0\r\nind=0\r\nfor i in a:\r\n if x[i]>max:\r\n max=x[i]\r\n ind=i\r\nprint(x[ind],len(x))", "\r\n\r\nn = int(input())\r\n\r\nl = list(map(int,input().split()))\r\n\r\ncnts = {}\r\n\r\nfor i in l :\r\n \r\n if i not in cnts :\r\n \r\n cnts[i] = 1 \r\n \r\n else :\r\n \r\n cnts[i] += 1 \r\n \r\nkey_max = max(cnts.keys(), key=(lambda k: cnts[k]))\r\n \r\nprint(*[cnts[key_max],len(cnts)])", "n = int(input())\r\nchaine = input()\r\nliste1 = chaine.split(\" \")\r\nens1= set()\r\nliste2 =[]\r\nliste3=[] \r\nfor i in liste1:\r\n ens1.add(i)\r\n liste2.append(liste1.count(i))\r\nliste3=liste2\r\nliste3.sort(reverse=True)\r\nprint(liste3[0],len(ens1))\r\n\r\n", "from collections import Counter\r\n\r\ninput()\r\ntowers = Counter(map(int, input().split()))\r\n\r\nprint(max(towers.values()), len(towers))", "n = int(input())\r\nl = [int(x) for x in input().split()]\r\na = [0]*1001\r\nfor x in l:\r\n a[x] += 1\r\nmaxi = 0\r\ncount = 0\r\nfor x in a:\r\n maxi = max(x,maxi)\r\n if x!=0:\r\n count += 1\r\nprint(maxi, count)\r\n", "n = int(input())\r\na = sorted(list(map(int, input().split())))\r\nh = 1\r\nk = 0\r\nhi = 1\r\nfor i in range(1, n):\r\n if a[i] == a[i - 1]:\r\n hi += 1\r\n else:\r\n h = max(h, hi)\r\n hi = 1\r\n k += 1\r\nh = max(h, hi)\r\nk += 1\r\nprint(h, k)\r\n", "'''\r\n-------------------------------------------------------\r\n\t\tCompetitive programing\r\n\t\tName: Đào Xuân Hoàng Tuấn (Salmon1)\r\nNothing is impossible, as you as you believe you can do it\r\n\t\t You can do it!!!\r\n-------------------------------------------------------\r\n'''\r\nn = int(input())\r\na = list(map(int, input().split()))\r\nb = set()\r\nfor i in range(len(a)):\r\n\tif a[i] not in b:\r\n\t\tb.add(a[i])\r\nma = 0\r\nfor i in range(len(a)):\r\n\ttemp = a.count(a[i])\r\n\tif temp >= ma:\r\n\t\tma = temp\r\nprint(str(ma) + \" \" + str(len(b)))\r\n\r\n\r\n\r\n\r\n", "n = int(input())\r\na = [int(_) for _ in input().split()]\r\nmt = 0\r\nfor i in set(a):\r\n mt = max(mt, a.count(i))\r\nprint(mt, len(set(a)))\r\n", "N = int(input())\nl = map(int, input().split())\nmaxH = n = 0\nd = {}\n\nfor i in l:\n\tif(d.get(i)):\n\t\td[i] += 1\n\telse:\n\t\td[i] = 1\n\nfor i in d:\n\tn += 1\n\tif (d[i] > maxH):\n\t\tmaxH = d[i]\n\nprint(maxH, n)", "n = int(input())\r\n\r\narr = sorted(list(map(int,input().strip().split(' '))))\r\n\r\nhs = {}\r\nfor v in arr :\r\n\tif v not in hs :\r\n\t\ths[v] = 1 \r\n\telse :\t\r\n\t\ths[v] += 1 \r\n# print()\r\nprint(\"%s %s\"%(max(hs.values()),len(hs)))\t\t \r\n\r\n", "from collections import Counter\ninput()\nc = Counter(map(int,input().split()))\nprint(\"{} {}\".format(c.most_common(1)[0][1], len(c)))", "\r\nfrom collections import Counter\r\n\r\ncnt = Counter()\r\n\r\ninput()\r\nfor v in map(int, input().split()):\r\n cnt[v] += 1\r\n\r\nprint(cnt.most_common(1)[0][1], len(cnt))\r\n\r\n", "n=int(input())\r\nk=list(map(int,input().split()))\r\nk1=k.copy()\r\ncounter=0\r\nlist1=[]\r\nfor x in k:\r\n list1.append(k.count(x))\r\n\r\ny=max(list1)\r\np=list(dict.fromkeys(k1))\r\nq=len(p)\r\nif y!=0:\r\n print(y,q)\r\nelse:\r\n print(1,q)", "x, l= int(input()), list(map(int,input().split())); print(max(l.count(i) for i in l ),len(set(l)))\n\t\t\t \t\t \t\t\t\t \t \t\t\t\t \t\t\t \t\t\t", "n=int(input())\r\na=[int(x) for x in input().split()]\r\nlst=[0]*1001\r\nfor i in a:\r\n lst[i]+=1\r\nprint(max(lst),1001-lst.count(0))", "# coding=utf-8\r\n\r\nif __name__ == '__main__':\r\n n = int(input())\r\n line = str(input()).split()\r\n line = [int(it) for it in line]\r\n line.sort()\r\n size = 0\r\n max_h = 1\r\n curr_h = 1\r\n for i in range(1, n):\r\n if line[i] > line[i - 1]:\r\n size += 1\r\n if curr_h > max_h:\r\n max_h = curr_h\r\n curr_h = 1\r\n else:\r\n curr_h += 1\r\n size += 1\r\n if curr_h > max_h:\r\n max_h = curr_h\r\n print(str(max_h) + ' ' + str(size))\r\n", "int(input())\r\nlst = list(map(int, input().split()))\r\ns = set(lst)\r\nmax = 0\r\nfor i in s:\r\n if lst.count(i) > max:\r\n max = lst.count(i)\r\nprint(max, len(s))", "from collections import Counter\r\nint(input())\r\narr = list(map(int, input().split()))\r\narr = Counter(arr)\r\nprint(max(arr.values()) , len(set(arr)))", "n = int(input())\r\nmas = [int(x) for x in input().split()]\r\ncount = [0]* 1001\r\nlen_n = []\r\nnummin = 0\r\n\r\nfor i in mas:\r\n count[i] += 1\r\n\r\nfor j in range(len(count)):\r\n if count[j] > 0:\r\n len_n.append(count[j])\r\n nummin += 1\r\n\r\nprint(max(len_n), nummin)\r\n\r\n\r\n", "n = int(input())\r\nbars = map(int,input().split())\r\npre = [0] * 1001\r\nfor b in bars:\r\n pre[b] += 1\r\nprint (max(pre), 1001 - sum(1 for x in pre if x == 0))", "n=int(input())\r\na=[int(i) for i in input().split()]\r\nc=[]\r\nb=1\r\nfor i in range(n):\r\n if a.count(a[i])>1 and a[i] not in c:\r\n n-=a.count(a[i])-1\r\n c.append(a[i])\r\n if a.count(a[i])>b:\r\n b=a.count(a[i])\r\nprint(b,n)\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\nd={}\r\nfor i in l:\r\n\tif i in d:\r\n\t\td[i]+=1\r\n\telse:\r\n\t\td[i]=1\r\nc=m=0\r\nfor i in d:\r\n\tm=max(m,d[i])\r\n\tc+=1\r\nprint(m,c)", "n=int(input())\r\na=list(map(int, input().split()))\r\nb=[]\r\nfreq = {}\r\nk=0\r\nf=[]\r\nfor item in a:\r\n if (item in freq):\r\n freq[item] += 1\r\n f.append(freq[item])\r\n if len(f)!=0:\r\n m=max(f)\r\n else:\r\n freq[item] = 1\r\n k=k+1\r\n \r\nif len(f)!=0:\r\n print(str(m) + \" \"+ str(k))\r\nelse:\r\n print(str(1) + \" \"+ str(k))", "from sys import stdin\r\n\r\ndef main():\r\n n= int(stdin.readline())\r\n x= [int(x) for x in stdin.readline().split()]\r\n cont= 0\r\n for i in range(n):\r\n c= x.count(x[i])\r\n if c > cont: cont= c\r\n torres= len(set(x))\r\n print(cont,torres)\r\nmain()\r\n \r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\nm = 0\r\nfor i in a:\r\n if a.count(i) > m:\r\n m = a.count(i)\r\nprint(m, len(set(a)))\r\n", "n = int(input())\r\nl = list(map(int, input().split()))\r\nans = {}\r\n\r\nfor i in l:\r\n if i in ans.keys():\r\n ans[i] += 1\r\n else:\r\n ans[i] = 1\r\n\r\nprint(max(ans.values()), len(ans))", "def tower(arr):\r\n arr = list(arr)\r\n s = set(arr)\r\n mx = 0\r\n total = len(s)\r\n for bar in s:\r\n t = arr.count(bar)\r\n mx = max(mx, t)\r\n\r\n return f'{mx} {total}'\r\n\r\nnum = input()\r\ntab = map(lambda x: int(x), input().split(\" \"))\r\nprint(tower(tab))\r\n\r\n\r\n\r\n", "n = int(input())\r\nl = [int(i) for i in input().split()]\r\n\r\nl.sort()\r\n\r\nd = dict()\r\n\r\nfor i in l:\r\n if i in d.keys():\r\n d[i] = d[i] + 1\r\n else:\r\n d[i] = 1\r\n\r\nk = d.keys()\r\nv = d.values()\r\n\r\nprint(max(v), ' ', len(k))", "n=int(input())\ns=[i for i in map(int,input().split())]\nt=set(s)\nt=list(t)\nmm=[]\nq=0\n\nfor a in t:\n c=s.count(a)\n if c>1:\n mm.append(c)\n q+=1\n else:\n mm.append(1)\n q+=1\ndd=max(mm)\nprint(dd,q)\n", "\"\"\"A solution to 37A Towers.\"\"\"\r\n\r\ndef solution():\r\n n = int(input())\r\n v = sorted([int(x) for x in input().split()])\r\n\r\n max_len = -1\r\n h = 1\r\n\r\n i = 0\r\n while i < n:\r\n j = i + 1\r\n while j < n:\r\n if v[i] != v[j]:\r\n h += 1\r\n break\r\n j += 1\r\n\r\n if j - i > max_len:\r\n max_len = j - i\r\n\r\n i = j\r\n\r\n print(\"%d %d\" % (max_len, h))\r\n\r\n\r\nif __name__ == \"__main__\":\r\n solution()", "k = int(input())\r\na = list(map(int, input().split()))\r\n\r\nb = {}\r\nn = 0\r\nm = 0\r\n\r\nfor l in a:\r\n if l in b:\r\n b[l] += 1\r\n else:\r\n n += 1\r\n b[l] = 1\r\n m = max(b[l], m)\r\n \r\nprint(m, n)", "N = int(input())\r\nL = list(map(int, input().split()))\r\n\r\ncount_length = [0] * 1001\r\nfor length in L: count_length[length] += 1\r\ncount, max_appears = 0, 0\r\nfor appear_times in count_length:\r\n if appear_times > 0:\r\n count += 1\r\n max_appears = max(max_appears, appear_times)\r\nprint(max_appears, count)", "n = int(input())\r\n\r\na = list(map(int,input().split()))\r\nb = a.count(max(set(a), key=a.count))\r\nc=[]\r\n\r\nfor i in range(n):\r\n if a[i] in c:\r\n n-=1\r\n else:\r\n c.append(a[i])\r\n\r\nprint(b,n)\r\n", "def solve(n,towers):\r\n towers = sorted(towers)\r\n count = 1\r\n maximum = 1\r\n cur = 1\r\n for i in range(1,len(towers)):\r\n if(towers[i]==towers[i-1]):\r\n cur += 1\r\n maximum = max(cur,maximum)\r\n else:\r\n cur = 1\r\n count += 1\r\n print(maximum,count)\r\nif __name__ == \"__main__\":\r\n n = int(input())\r\n towers = map(int,input().split(\" \"))\r\n solve(n,towers)", "from sys import stdin\r\nfrom collections import defaultdict\r\ninput=lambda:stdin.readline().strip()\r\nn=int(input())\r\nlst=list(map(int,input().split()))\r\ndict1=defaultdict(int)\r\nfor i in lst:\r\n dict1[i]+=1\r\nset1=set(lst)\r\nmax1=max(list(dict1.values()))\r\nprint(max1,len(set1))\r\n", "n = int(input())\r\na = list(map(int,input().split()))\r\n\r\nh = 0\r\nfor i in range(n):\r\n h = max(h, a.count(a[i]))\r\nprint(h,len(set(a))) ", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Sat Jul 13 10:58:56 2019\r\n\r\n@author: avina\r\n\"\"\"\r\n\r\nn = int(input())\r\nl = list(map(int, input().split()))\r\nw = 0\r\nq = set(l)\r\nfor i in q:\r\n w = max(w, l.count(i))\r\nprint(w, len(q))", "x=int(input())\r\nc=0\r\ny=input().split()\r\nl1=[]\r\nfor i in y:\r\n i=int(i)\r\n l1.append(i)\r\nlength=0\r\nfor i in l1:\r\n z=l1.count(i)\r\n if z>length:\r\n length=z\r\nset1=set(l1)\r\nll=len(set1)\r\nprint(length , ll)", "# -*- coding: utf-8 -*-\r\n\r\nimport math\r\nimport collections\r\nimport bisect\r\nimport heapq\r\nimport time\r\nimport random\r\nimport itertools\r\nimport sys\r\n\r\n\"\"\"\r\ncreated by shhuan at 2017/11/23 22:21\r\n\r\n\"\"\"\r\n\r\n\r\nN = int(input())\r\nA = [int(x) for x in input().split()]\r\n\r\nwc = collections.defaultdict(int)\r\n\r\nfor v in A:\r\n wc[v] += 1\r\n\r\n\r\nprint(max(wc.values()), len(wc))", "n = input()\r\nl = list(map(int,input().split()))\r\ns = set(l)\r\nm=-1\r\nfor i in s:\r\n m = max(m,l.count(i))\r\n \r\nprint(m,len(s))", "n=int(input())\r\n\r\nl=input().split()\r\nh=[]\r\nfor i in range(n):\r\n k=1\r\n j=i+1\r\n while(j<n and l[i]!=0):\r\n if(l[i]==l[j]):\r\n l[j]=0\r\n k+=1\r\n j+=1\r\n if(l[i]!=0):\r\n h.append(k)\r\n l[i]=0\r\nprint(max(h), len(h))\r\n", "n = int(input())\r\nlengths = [int(x) for x in input().split()]\r\nblock = []\r\nfor i in range (0, 1001):\r\n block.append(0)\r\nfor leng in lengths:\r\n block[leng] += 1\r\n\r\nmaxHeight = max(block)\r\ntotal = 0\r\nfor bl in block:\r\n if bl != 0:\r\n total += 1\r\nprint(maxHeight, total)", "import sys\r\n\r\nn = int(input())\r\nd = [int(i) for i in input().split()]\r\nmaxOcc = 0;\r\nlenSet = set(d);\r\nfor i in range(n):\r\n occ = d.count(d[i]);\r\n if occ > maxOcc:\r\n maxOcc = occ;\r\nprint(maxOcc, len(lenSet))\r\n", "notused, ints,seen,maxi = int(input()),list(map(int, input().split(\" \"))),dict(),0\nfor i in ints:\n\tseen[i] = seen[i]+1 if i in seen else 1\n\tif maxi < seen[i]: maxi = seen[i]\nprint(maxi, len(seen))", "#https://codeforces.com/problemset/problem/37/A\r\n'''\r\nComment\r\n'''\r\n\r\nif __name__ == \"__main__\":\r\n n = int(input())\r\n bars = list(map(int, input().split()))\r\n\r\n bars.sort()\r\n total_number = 1\r\n current_hight = 1\r\n higth_tower = 1\r\n\r\n for i in range(n - 1):\r\n if bars[i] != bars[i + 1]:\r\n total_number += 1\r\n current_hight = 1\r\n else:\r\n current_hight += 1\r\n higth_tower = max(higth_tower, current_hight)\r\n\r\n print(higth_tower, total_number)\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\nd={}\r\nfor i in l:\r\n if( i not in d):\r\n d[i]=1\r\n else:\r\n d[i]+=1\r\nm=0\r\nfor i in d:\r\n if(d[i]>m):\r\n m=d[i]\r\nprint(m,len(set(l)))\r\n \r\n", "n = int(input())\r\nlengths = list(map(int, input().split()))\r\n\r\nheights = {}\r\nfor length in lengths:\r\n if length in heights:\r\n heights[length] += 1\r\n else:\r\n heights[length] = 1\r\n\r\nmax_height = max(heights.values())\r\nnum_towers = len(heights)\r\n\r\nprint(max_height, num_towers)\r\n\r\n\r\n", "n=int(input())\r\nl=[int(i) for i in input().split()]\r\nprint(l.count(max(l,key =lambda x:l.count(x))),len(set(l)))", "def solve():\r\n n=int(input())\r\n lst=list(map(int,input().split(\" \")))\r\n l2=lst[::]\r\n s=set(l2);\r\n l1=list(s)\r\n m=0\r\n for i in range(len(l1)):\r\n if m<lst.count(l1[i]):\r\n m=lst.count(l1[i])\r\n \r\n print(m,len(l1))\r\n \r\n \r\n \r\n \r\n# t=int(input())\r\n# while(t>0):\r\n# t-=1\r\nsolve(); \r\n\r\n# # 100000000", "from collections import Counter\ninput()\ncnt = Counter(int(x) for x in input().split())\nprint(cnt.most_common(1)[0][1], len(cnt))\n", "bars = int(input())\r\nbar_lengths = [int(i) for i in input().split()]\r\n \r\nmax_height = 0 \r\nfor length in set(bar_lengths):\r\n if bar_lengths.count(length) > max_height:\r\n max_height = bar_lengths.count(length)\r\n \r\nprint(max_height)\r\nprint(len(set(bar_lengths)))\r\n ", "input()\r\nb = input().split()\r\nprint(max(b.count(i) for i in b), len(set(b)))\r\n", "a = int(input())\r\nmy_list = list(map(int, input().split()))\r\nans2 = len(set(my_list))\r\nsort_mylist = sorted(my_list)\r\nprint(max(map(my_list.count, my_list)), ans2)", "def count_max_height():\r\n c = {}\r\n for i in range(n):\r\n c[str(a[i])] = 0\r\n\r\n for i in range(n):\r\n c[str(a[i])] += 1\r\n\r\n return max(c.values())\r\n\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\na.sort()\r\nprint(count_max_height(), len(set(a)))\r\n", "A = [0 for i in range(0, 1000)]\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\n\r\nfor i in range(0, len(a)):\r\n A[a[i]-1] += 1\r\n\r\nmaxLength = 0\r\ncount = 0\r\nfor j in range(0, len(A)):\r\n if A[j] > maxLength:\r\n maxLength = A[j]\r\n if A[j] > 0:\r\n count += 1\r\n\r\nprint(\"{} {}\".format(maxLength, count))\r\n", "n = int(input())\r\nnums = list(map(int,input().split()))\r\ndiff = set(nums)\r\n\r\nres1 = max(nums.count(i) for i in diff)\r\nres2 = len(diff)\r\n\r\nprint(res1,res2)", "n = int(input())\nl = list(map(int, input().split()))\nl.sort()\n\nd = {}\nfor i, li in enumerate(l):\n d[li] = d.get(li, 0) + 1\nm = 0\nfor k,v in d.items():\n if m < v: m = v\n\nprint(m, len(d))\n\n\n", "# Towers\r\ndatain = True\r\n\r\nif datain:\r\n n = int(input())\r\n a = list(map(int, input().split()))\r\nelse:\r\n n = 4\r\n a = [6, 5, 6, 7]\r\n\r\n\r\n# Approach for practicing, not optimal\r\nclass Tower:\r\n\tdef __init__(self, length = 0, height = 0):\r\n\t\tself.length = length\r\n\t\tself.height = height\r\n\t\t\r\ntower = []\r\nlengt = []\r\n\r\nfor i in range(len(a)):\r\n\tif not (a[i] in lengt):\r\n\t\tlengt.append(a[i])\r\n\t\ttower.append(Tower(a[i],1))\r\n\telse:\r\n\t\tfor t in tower:\r\n\t\t\tif (t.length == a[i]):\r\n\t\t\t\tt.height += 1\r\n\t\t\t\t\r\ntower.sort(key = lambda s:(-s.height))\r\n\r\nprint(tower[0].height, len(tower))", "from collections import defaultdict\r\nmy_dict = defaultdict(lambda: 0)\r\n\r\nn = int(input())\r\nl = list(map(int, input().split()))\r\n\r\nfor num in l:\r\n\tmy_dict[num] += 1\r\n\t\r\nprint(my_dict[max(my_dict, key=my_dict.get)],len(my_dict)) ", "n=int(input())\r\nkm=0\r\nb=[]\r\na=[int(n) for n in input().split()]\r\nfor i in range(len(a)):\r\n if b.count(a[i])==0:\r\n b.append(a[i])\r\n if a.count(a[i])>km:\r\n m=i\r\n km=a.count(a[i])\r\nprint(km,len(b))\r\n", "n = int(input())\r\nx = list(map(int, input().split()))\r\n\r\ncount = [0] * 1001\r\nfor i in range(len(x)):\r\n count[x[i]] += 1\r\n\r\nmax_frequency = 0\r\nfor j in range(len(count)):\r\n if count[j] > max_frequency:\r\n max_frequency = count[j]\r\n\r\nunique = []\r\nfor k in range(len(x)):\r\n if x[k] not in unique:\r\n unique.append(x[k])\r\n\r\nprint(max_frequency, len(unique))", "x=int(input());\r\ny=list(map(str,input().split()));\r\nl=len(set(y))\r\nt=[]\r\nfor i in set(y):\r\n t.append(y.count(i))\r\nprint(max(t),l)", "from collections import Counter\r\nsa=input()\r\nsa2=input().split(' ')\r\nsa3=[int(x) for x in sa2]\r\nprint(Counter(sa3).most_common(1)[0][1], len(list(set(sa3))))\r\n", "# Problem 47A\n# Towers\n\nno_of_bars = int(input())\nbar_lengths = list(map(int, input().split()))\n\nno_of_towers, max_height = (0, 0)\nunique = set(bar_lengths)\n\nfor n in unique:\n count = bar_lengths.count(n)\n if count > max_height:\n max_height = count\n\nprint(str(max_height) + \" \" + str(len(unique)))\n", "n = int(input())\r\na = []\r\nL = [int(x) for x in input().split()]\r\nfor i in range(n):\r\n a.append(L.count(L[i]))\r\nprint(max(a), len(set(L)))", "n=int(input())\r\ncontainer=list(map(int, input().split()))\r\n\r\ntemp=list()\r\nheight=1\r\nfor i in range(n):\r\n for j in range(i+1, n):\r\n if container[i]==container[j]:\r\n height+=1\r\n temp.append(height)\r\n height=1\r\n\r\nmySet=set(container)\r\nprint(max(temp), len(mySet))", "import sys\r\nimport math\r\nimport bisect\r\n\r\ndef solve(A):\r\n n = len(A)\r\n d = dict()\r\n for a in A:\r\n if a not in d:\r\n d[a] = 0\r\n d[a] += 1\r\n max_val = max(list(d.values()))\r\n return (max_val, len(d))\r\n\r\ndef main():\r\n n = int(input())\r\n A = list(map(int, input().split()))\r\n ans = solve(A)\r\n print('%d %d' % (ans[0], ans[1]))\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n=int(input())\r\na=list(sorted(map(int,input().split())))\r\nz=set(a);s=[]\r\nfor i in a:\r\n b=a.count(i);s.append(b)\r\nprint(max(s),len(z))\r\n", "input()\r\narr = list(map(int, input().split()))\r\n\r\nduplicated = 0\r\nmaxHeight = 0\r\ntmp = -1\r\ncurrentHeight = 0\r\n\r\narr.sort()\r\n\r\nfor i in arr:\r\n if i != tmp:\r\n currentHeight = 1\r\n tmp = i\r\n else:\r\n currentHeight += 1\r\n duplicated += 1\r\n \r\n if currentHeight > maxHeight:\r\n maxHeight = currentHeight\r\n\r\n\r\nprint(maxHeight, len(arr) - duplicated)\r\n", "n=int(input())\r\nL=[]\r\nx=list(map(int,input().split()))\r\nc=1\r\nd=1\r\nz=set(x)\r\nfor i in x:\r\n e=x.count(i)\r\n L.append(e)\r\nprint(max(L),len(z))", "n = int(input())\r\na = list(map(int, input().split()))\r\nb = []\r\ncount, biggest = 0, 0\r\n\r\nfor i in a:\r\n if i not in b:\r\n count += 1\r\n b.append(i)\r\n\r\n if a.count(i) > biggest:\r\n biggest = a.count(i)\r\n\r\nprint(biggest, count)\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\na=[0]*1001\r\nfor i in range(n):\r\n a[l[i]]+=1\r\nmax=0\r\nt=0\r\nfor i in range(1001):\r\n if a[i]>max:\r\n max=a[i]\r\n#print(*a) \r\nfor i in range(1001):\r\n if a[i]!=0:\r\n t+=1\r\nprint(max,t)", "##nums = map(int, input().split())\r\n##s1 = list(map(int, input().split()))\r\n##s1 = list(map(int, ' '.join(input()).split()))\r\n\r\nn = int(input())\r\ns = list(map(int, input().split()))\r\nMax = 0\r\n\r\nr = []\r\nfor i in range(n):\r\n t = s.count(s[i])\r\n if Max < t:\r\n Max = t\r\n \r\n if s[i] not in r:\r\n r.append(s[i])\r\n\r\nprint(Max, len(r))\r\n", "import sys\r\n\r\ndef tower(numero,lista):\r\n \r\n q=[]\r\n num=0\r\n for i in range(numero):\r\n p=lista[i]\r\n if lista.count(p)>num:\r\n num=lista.count(p)\r\n \r\n if p not in q:\r\n q.append(lista[i])\r\n\r\n print(num,len(q))\r\n\r\ndef main():\r\n num=int(sys.stdin.readline())\r\n\r\n lista=list(map(int,sys.stdin.readline().split()))\r\n\r\n t=tower(num,lista)\r\nmain()\r\n", "\r\nn=int(input())\r\ns=sorted([int(x) for x in input().split()])\r\n#print(s)\r\narr={}\r\ncnt=0\r\nfor i in s:\r\n if(i in arr.keys()):\r\n arr[i]+=1\r\n else:\r\n arr[i]=1\r\nmx=max(arr.values())\r\nfor i in arr.keys():\r\n cnt+=1\r\nprint(mx,cnt)", "n = int(input())\r\ns = list(map(int,input().strip().split()))[:n]\r\ns.sort()\r\na = []\r\ni=0\r\nwhile i < n:\r\n if(s.count(s[i]) == 1):\r\n a.append(1)\r\n i= i+1\r\n else: \r\n a.append(s.count(s[i]))\r\n i += s.count(s[i])\r\n \r\nx = set(s)\r\nprint(max(a),len(x)) \r\n ", "x=int(input())\r\nm=list(map(int,input().split()))[:x]\r\nar=[]\r\nfor i in range(0,len(m)):\r\n p=m.count(m[i])\r\n ar.append(p)\r\nk=max(ar)\r\nn=set(m)\r\ng=len(n)\r\nprint(k,g)\r\n \r\n \r\n", "n = int(input())\r\nm = list(map(int, input().split()))\r\nmax = 0\r\nfor i in m:\r\n s = m.count(i)\r\n if s > max:\r\n max = s\r\nprint(max, len(set(m)))", "from itertools import groupby\n\n\nN = int(input())\nL = list(map(int, input().split()))\n\nL.sort()\ngroups = groupby(L)\nd = {}\nfor k, vals in groups:\n d[k] = len(list(vals))\nmaxv = max(d.values())\nprint(\"{} {}\".format(maxv, len(d)))\n", "n=int(input())\r\nd={}\r\ns=input()\r\ns=tuple(int(x) for x in s.split())\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\ntmp=0\r\nfor k,v in d.items():\r\n if v>tmp:\r\n tmp=v\r\n #print(tmp,v,'ABC')\r\n#print(d)\r\nprint(tmp,len(d))\r\n \r\n \r\n ", "from collections import Counter as co\r\nn=int(input())\r\na=list(map(int,input().split()))\r\nd=co(a)\r\nm=0\r\nfor i in d:\r\n m=max(m,d[i])\r\nprint(m,len(d))", "n=int(input())\r\narr=list(map(int,input().split()))\r\nmaxc=-1\r\nfor i in arr:\r\n maxc=max(maxc,arr.count(i))\r\nprint(maxc,len(set(arr)))", "from collections import defaultdict\r\n\r\nTower = defaultdict(int)\r\ninput()\r\nfor bar in list(map(int, input().split())):\r\n Tower[bar] += 1\r\nprint(max(Tower.values()), len(Tower))\r\n\r\n# UB_CodeForces\r\n# Advice: The best preparation for tomorrow is doing your best today\r\n# Location: On my ground desk\r\n# Caption: Before love time\r\n# CodeNumber: 472\r\n", "a=int(input())\r\na1= list(map(int, input().split()))\r\na2= len(a1)\r\na3= len(set(a1))\r\na4=a1.count(a1[0])\r\nfor i in range(1,len(a1)):\r\n if(a4<a1.count(a1[i])):\r\n a4=a1.count(a1[i])\r\nprint(a4,a3)", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Tue Dec 19 23:03:07 2017\r\n\r\n@author: admin\r\n\"\"\"\r\n\r\nN = int(input())\r\nlength = [int(x) for x in input().split()]\r\ns = set(length)\r\ntower = []\r\nfor x in s:\r\n num = length.count(x)\r\n tower.append(num)\r\n \r\nprint(max(tower),len(tower))\r\n", "bars = int(input())\nlengths_of_the_bars = list(map(int, input().split(' ')))\n\nheight_of_largest_tower = 1\n\nfor bar in lengths_of_the_bars:\n if lengths_of_the_bars.count(bar) > height_of_largest_tower:\n height_of_largest_tower = lengths_of_the_bars.count(bar)\n\ntotal_number_of_towers = len(set(lengths_of_the_bars))\n\nprint(height_of_largest_tower, total_number_of_towers)\n\n\n\n", "input()\r\nb=input().split()\r\nprint(max(b.count(i) for i in set(b)),len(set(b)))\r\n", "trash = str(input());\r\n\r\nfirstLine = [int(x) for x in input().split()];\r\n\r\nfirstLine.sort();\r\n\r\ntallest = 1;\r\ntotal = 1;\r\n\r\nfor i in range(1, len(firstLine)):\r\n if(firstLine[i]==firstLine[i-1]):\r\n total += 1;\r\n if(total > tallest):\r\n tallest = total;\r\n else:\r\n total = 1;\r\n \r\nfirstLine = set(firstLine);\r\nprint(tallest, len(firstLine));", "N = int(input())\r\na = map(int, input().split())\r\na = list(a)\r\nx = []\r\nfor i in a:\r\n if i != '.':\r\n x.append((a.count(i)))\r\n while i in a and i != '.':\r\n a.remove(i)\r\n a.insert(0, '.')\r\nprint(max(x), len(x))\r\n", "n=int(input())\r\nd=dict()\r\nch=input()\r\nl=list(map(int, ch.split(\" \")))\r\nfor i in l :\r\n if i in d.keys() :\r\n d[i]+=1\r\n else :\r\n d[i]=1\r\nm=0\r\nfor i in d.values() :\r\n if i>m :\r\n m=i\r\nprint(m,\" \",len(d))", "n = int(input())\r\nN = [int(i) for i in input().split()]\r\nlist1 = []\r\nlist2 = []\r\nh = 0\r\nfor i in N:\r\n if i not in list1:\r\n list1.append(i)\r\nfor k in list1:\r\n if N.count(k) > h:\r\n h = N.count(k)\r\nprint(f\"{h} {len(list1)}\")\r\n \r\n \r\n \r\n", "n=int(input())\r\nl=list(map(int, input().split()))\r\ns=set(l)\r\nl1=[]\r\nif len(l)== len(s): \r\n print(1)\r\n print(n)\r\nelse :\r\n for i in l:\r\n k=l.count(i)\r\n l1.append(k)\r\n print(max(l1))\r\n print(len(s))\r\n", "#http://codeforces.com/problemset/problem/37/A\r\n\r\ndef main():\r\n _=input()\r\n l_list=list(map(int,input().split()))\r\n new_list=[0]*1001\r\n for i in l_list:\r\n new_list[i]+=1\r\n print('{} {}'.format(max(new_list),1001-new_list.count(0)))\r\nif __name__==\"__main__\":\r\n main()\r\n", "n = input()\r\nm = [i for i in map(int, input().split())]\r\na = set(m)\r\nNfinal = len(a)\r\ns = 0\r\nfor i in a:\r\n p = m.count(i)\r\n if p > s:\r\n s = p\r\nprint(s)\r\nprint(Nfinal)", "def word_count(a):\r\n counts = dict()\r\n words = a\r\n for word in words:\r\n if word in counts:\r\n counts[word] += 1\r\n else:\r\n counts[word] = 1\r\n return counts\r\n\r\n\r\nn = int(input())\r\nlst = list(map(int,input().split()))\r\nsett = set(lst)\r\nk = word_count(lst)\r\nv = list(k.values())\r\nprint(max(v), len(sett))\r\n", "from sys import stdin\r\n\r\n\r\ndef main():\r\n a=int(stdin.readline().strip())\r\n numeros=[int(x) for x in stdin.readline().strip().split()]\r\n numeros.sort()\r\n rep=[]\r\n repetidos=1\r\n diferentes=1\r\n for i in range(a-1):\r\n if numeros[i]==numeros[i+1]:\r\n repetidos+=1\r\n elif numeros[i]!=numeros[i+1]:\r\n diferentes+=1\r\n rep.append(repetidos)\r\n repetidos=1\r\n rep.append(repetidos)\r\n print(max(rep),diferentes)\r\n \r\n \r\n\r\n\r\nmain()\r\n", "n=int(input())\r\na=[int(i) for i in input().split()]\r\ni=0\r\na=sorted(a)\r\nh,k,x=1,1,1\r\nfor i in range(n-1):\r\n if(a[i]==a[i+1]):\r\n h+=1\r\n if(x<h):\r\n x=h\r\n else:\r\n k+=1\r\n h=1\r\nprint(x,k)", "N = int(input())\r\nl = [int(i) for i in input().split()]\r\n\r\ntower = []\r\nheight = {}\r\nfor i in range(N):\r\n if l[i] in tower:\r\n height[l[i]] += 1\r\n else:\r\n tower.append(l[i])\r\n height[l[i]] = 1\r\n\r\nmaximum = 1\r\nfor j in range(len(tower)):\r\n maximum = max(maximum,height[tower[j]])\r\n \r\nprint(maximum,len(tower))\r\n", "def _input(): return map(int, input().split())\r\n\r\n\r\nn = int(input())\r\nlst = list(_input())\r\nb = set(lst)\r\nml = 0\r\nfor i in b:\r\n ml = max(ml, lst.count(i))\r\nprint(ml,len(b))", "n = int(input())\r\n# es arc mchirdeba mgoni\r\nmax_value = 0\r\nlist_cont = [int(item) for item in input().split()]\r\ncont = {}\r\n\r\nfor item in list_cont:\r\n key = item\r\n if cont.get(key)!= None:\r\n cont[key]+=1\r\n else:\r\n cont[key] = 1\r\n\r\n if max_value < cont[key]:\r\n max_value = cont[key]\r\n\r\n\r\nprint(f'{max_value} {len(cont)}')\r\n", "from collections import Counter\nn = int(input())\na = list(map(int, input().split()))\nh = Counter(a)\nprint(max(h.values()), len(h))\n\n", "import sys\r\ninput = sys.stdin.readline\r\n# x,y,z=map(int,input().split())\r\n# a = list(map(int,input().split()))\r\n\r\nn = int(input())\r\nbars = list(map(int,input().split()))\r\n\r\npiles = {}\r\n\r\nfor bar in bars:\r\n\tif piles.get(bar,False):\r\n\t\tpiles.update({bar:piles.get(bar)+1})\r\n\telse:\r\n\t\tpiles[bar] = 1\r\n\r\nprint (str(max(piles.values())) + \" \" + str(len(piles)))\r\n", "input()\r\nl=[0]*1001\r\nc=0\r\nfor k in map(int,input().split(\" \")):\r\n if(l[k]==0):\r\n c+=1\r\n l[k]+=1\r\nprint(max(l),c)", "n=int(input())\r\na=[int(i) for i in input().split()]\r\nb=frozenset(a)\r\nmax1=0\r\nfor i in b:\r\n if a.count(i)>max1:\r\n max1=a.count(i)\r\nprint(max1,end=' ')\r\nprint(len(b),end=' ')\r\n", "a=int(input())\r\nb=input().split()\r\nleng= len(set(b))\r\nprint(max(b.count(i) for i in b),leng)", "n=int(input())\r\nl=list(map(int, input().split()))\r\na=[0]*1001\r\nt=0\r\nmax=0\r\nfor i in range (len(l)):\r\n a[l[i]]+=1\r\nfor i in range (len(a)):\r\n if a[i]>=1:\r\n t+=1\r\n if a[i]>max:\r\n max=a[i]\r\nprint(max, t)", "n=int(input())\r\nl=list(map(int,input().split()))\r\nv=0\r\nfor i in range(n):\r\n v=max(l.count(l[i]),v)\r\nl=set(l)\r\nprint(v,len(l))", "t=int(input())\r\nl=list(map(int,input().split()))\r\ncount=0\r\ncountt=0\r\nx=[0]*1001\r\nfor i in l:\r\n\tif x[i]==0:\r\n\t countt+=1\r\n\tx[i]+=1\r\n\tif x[i]>count:\r\n\t\tcount=x[i]\r\nprint(count,countt)", "n = int(input())\r\n\r\nheights = list(map(int, input().split(' ')))\r\n\r\nheights.sort()\r\n\r\nuniqueList = []\r\n\r\nmax_height = -1\r\nfor i in range(n):\r\n if heights[i] not in uniqueList:\r\n uniqueList.append(heights[i])\r\n\r\n if heights.count(heights[i]) > max_height:\r\n max_height = heights.count(heights[i])\r\n\r\nprint(\"{height} {num_tow}\".format(height = max_height, num_tow = len(uniqueList)))\r\n\r\n", "N = int(input())\r\nl = list(map(int,input().split()))\r\ntowers = [0 for i in range(1001)]\r\nfor h in l:\r\n towers[h]+=1\r\nm = max(towers)\r\nc = len(set(l))\r\nprint(\"{} {}\".format(m,c))\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\n\r\na.sort()\r\ntotal_number, high_current, high_tower = 1, 1, 1\r\n\r\nfor i in range(n - 1):\r\n\tif a[i] != a[i + 1]:\r\n\t\ttotal_number += 1\r\n\t\thigh_current = 1\r\n\telse:\r\n\t\thigh_current += 1\r\n\t\thigh_tower = max(high_tower, high_current)\r\n\r\nprint(\"%d %d\" % (high_tower, total_number))", "n = input()\r\nbars = [eval(x) for x in input().split()]\r\nbar_set = set(bars)\r\n\r\nd = {x:bars.count(x) for x in bars}\r\nval = list(d.values())\r\n\r\nprint(f\"{max(val)} {len(bar_set)}\")", "z=int(input())\r\nx=list(map(int,input().split()))\r\ns=len(set(x))\r\nc=1\r\nfor i in range(z):\r\n cd=x.count(x[i])\r\n if cd>c:\r\n c=cd\r\nprint(c,s)", "n = int(input())\r\nkit = [int(x) for x in input().split()]\r\ntower = {}\r\nfor v in kit:\r\n tower[v] = tower.get(v, 0) + 1;\r\nprint(max(tower.values()), len(tower))", "n=int(input())\r\ns=input().split()\r\nk=set(s)\r\ncount=0\r\nmaxi=0\r\nfor i in k:\r\n count=s.count(i)\r\n if maxi<count:\r\n maxi=count\r\nprint(maxi,len(k))\r\n", "n=int(input())\r\na=[int(i) for i in input().split()]\r\ns=len(set(a))\r\nc=1\r\nfor i in range(n):\r\n if a.count(a[i])>c:\r\n c=a.count(a[i])\r\nprint(c,s)", "n = int(input ())\r\ncount={}\r\na = [int(x) for x in input().split()]\r\nfor i in a:\r\n\tif i in count:\r\n\t\tcount[i]+=1\r\n\telse:\r\n\t\tcount[i]=1\r\nprint (max(count[i] for i in count),len(count))", "input();b=input().split();print(max([b.count(i) for i in b]),len(set(b)))\r\n", "n = int(input())\r\nbars = list(map(int, input().split()))\r\n\r\nfreq = {}\r\nfor bar in bars:\r\n if bar in freq:\r\n freq[bar] += 1\r\n else:\r\n freq[bar] = 1\r\n\r\nmax_height = max(freq.values())\r\nnum_towers = len(freq)\r\n\r\nprint(max_height, num_towers)\r\n", "from sys import stdin\r\ndef result(): \r\n numero = int(stdin.readline().strip())\r\n lista1 = [int(x) for x in stdin.readline().split()]\r\n lista2 = []\r\n for a in range(numero):\r\n if lista1[a] not in lista2:\r\n lista2.append(lista1[a])\r\n\r\n towers = []\r\n\r\n for i in range(len(lista2)):\r\n cont = 0\r\n for j in range(numero):\r\n if lista2[i] == lista1[j]:\r\n cont = cont + 1\r\n towers.append(cont)\r\n\r\n print(max(towers),len(towers))\r\nresult()\r\n", "a = int(input())\r\nb = sorted(list(map(int, input().split())))\r\nc = [0] * len(b)\r\nfor i in range(len(b)):\r\n if i == 0:\r\n c[0] = 1\r\n for j in range(1, len(b)):\r\n if b[j] == b[0]:\r\n c[0] = c[0] + 1\r\n elif b[i] > b[i-1]:\r\n c[i] = 1\r\n for j in range(i + 1, len(b)):\r\n if b[j] == b[i]:\r\n c[i] = c[i] + 1\r\n else:\r\n continue\r\nd = [a for a in c if a != 0]\r\nprint(max(c), len(d))\r\n", "n = int(input())\r\ns = list(map(int, input().split()))\r\nm = set(s)\r\nq = 0\r\nfor i in m:\r\n q = max(q, s.count(i))\r\nprint(q, len(m))\r\n# print(m)", "from statistics import mode\n\nN = int(input())\nl = list(map(int, input().split()))\nprint(l.count(mode(l)), len(set(l)))", "n = int(input())\r\nl = list(map(int, input().split()))\r\nd = len(set(l))\r\n\r\nocc = dict()\r\n\r\nfor i in range(n):\r\n if l[i] not in occ.keys():\r\n occ.update({l[i] : 1})\r\n\r\n else:\r\n occ[l[i]] += 1\r\n\r\nprint(max(occ.values()), d)\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\nprint(max(map(a.count, a)), len(set(a)))", "n = int(input())\r\na = list(map(int, input().split()))\r\ns = set(a); l = []\r\nfor i in s:\r\n l.append(a.count(i))\r\nprint(max(l), len(s))\r\n\r\n \r\n", "n = int(input())\r\nbash = [int(i) for i in input().split()]\r\nmas = []\r\nmax = 0\r\nfor i in bash:\r\n if mas.count(i) == 0: mas.append(i)\r\n if bash.count(i) > max: max = bash.count(i)\r\nprint(max, len(mas))\r\n", "p = int(input())\r\na = 1\r\nb = 0\r\ny = input().split()\r\nx = set(y)\r\nx = len(x)\r\no = {i: 0 for i in set(y)}\r\nfor i in y:\r\n o[i] += 1\r\nfor i in o:\r\n if o[i] > b:\r\n b = o[i]\r\nprint(b, x)\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\n\r\nn = int(input())\r\narr = list(map(int, input().split()))\r\nnew = list(dict.fromkeys(arr))\r\ncounts = []\r\nfor i in new:\r\n counts.append(arr.count(i))\r\nprint(max(counts), len(new))\r\n", "n = int(input())\narr = [int(x) for x in input().split()]\n\n_max = 0\n\nfor i in arr:\n k = arr.count(i)\n if k > _max:\n _max = k\n\na_set = set(arr)\n\nprint(str(_max) + ' ' + str(len(a_set)))\n", "n = int(input())\ncubs = input().split()\n\nfor i in range(len(cubs)):\n cubs[i] = int(cubs[i])\n\nress = []\n\nfor i in range(len(cubs)):\n ress.append(cubs.count(cubs[i]))\n\nprint(max(ress), len(set(cubs)))", "N = int(input())\r\nl = list(map(int,input().split()))\r\ncheck = [0] * 1001\r\ncount = 0\r\nfor i in l:\r\n check[i] += 1\r\nfor i in range(len(check)):\r\n if check[i] > 0:\r\n count +=1\r\nprint(max(check),count)", "from sys import stdin, stdout\r\nn = int(stdin.readline())\r\narray = list(map(int, stdin.readline().strip().split()))\r\ncount_dict = dict()\r\nfor j in array:\r\n if j in count_dict:\r\n count_dict[j]+=1\r\n else:\r\n count_dict[j] = 1 \r\nmax_count = 0\r\ncount = 0\r\nfor j in count_dict:\r\n if count_dict[j]>max_count:\r\n max_count = count_dict[j]\r\n count+=1\r\nstdout.write(f\"{max_count} {count}\\n\")", "n=int(input())\r\nl=list(map(int,input().split()))[:n]\r\n\r\n\r\ng=[]\r\nfor a in range(n):\r\n x=0\r\n for b in range(n):\r\n if l[a]==l[b]:\r\n x+=1\r\n g.append(x)\r\nfor h in range(len(g)):\r\n for d in range(len(g)):\r\n if g[h]>g[d]:\r\n g[h],g[d]=g[d],g[h]\r\n\r\nprint(g[0],end=\" \")\r\ns=set()\r\nfor k in range(n):\r\n s.add(l[k])\r\nprint(len(s))", "n = int(input())\r\na = list(map(int, input().split()))\r\n\r\nb = max(a)\r\n\r\nnums = set(a)\r\n\r\nnums1 = []\r\n\r\n\r\nfor i in nums:\r\n nums1.append(a.count(i))\r\n \r\n\r\n\r\nprint(max(nums1), end = \" \")\r\nprint(len(nums))\r\n \r\n\r\n ", "n = int(input())\nl = [int(i) for i in input().split()]\n\nd = {}\n\nfor i in l:\n if not i in d:\n d[i] = 1\n continue\n d[i] += 1\n\nprint(sorted(d.items(), key=lambda x: x[1], reverse=True)[0][1], len(d))\n", "n = int(input())\r\ncounts = {}\r\nmx = 0\r\nfor e in input().split():\r\n e = int(e)\r\n counts[e] = counts.get(e , 0) + 1\r\n if counts[e] > mx:\r\n mx = counts[e]\r\n\r\nprint(mx , len(counts)) ", "n = int(input())\r\na = list(map(int, input().split()))\r\nset_a = set(a)\r\nans = []\r\nfor i in set_a:\r\n ans.append(a.count(i))\r\n\r\nprint(max(ans), len(ans))", "N = int(input())\r\ns = map(int,input().split())\r\ns = list(s)\r\na = set(s)\r\n\r\nss =[]\r\nfor i in a:\r\n ss.append(s.count(i))\r\n\r\nprint(max(ss),len(a))", "def main():\r\n n=int(input())\r\n l=[0]*1001\r\n for i in map(int,input().split()):\r\n l[i]+=1\r\n h=max(l)\r\n no=sum(x!=0 for x in l)\r\n print(h,no)\r\n \r\nmain()\r\n", "import collections\r\nn=int(input())\r\nl=list(map(int,input().split()))\r\nnt=len(set(l))\r\nmh=max(dict(collections.Counter(l)).values())\r\nprint(mh,nt)", "n = int(input())\r\nch = input()\r\nl = ch.split(\" \")\r\ns = set()\r\nl1 = list()\r\n \r\nfor i in l:\r\n s.add(i)\r\n l1.append(l.count(i))\r\n\r\nprint(max(l1),len(s))", "\"\"\"\n37A | Towers: sortings\n\"\"\"\n\ndef towers():\n n = int(input())\n l = list(map(int, input().split(' ')))\n m = 1\n for i in l:\n m = max(m, l.count(i))\n # print('m =', m)\n print(m, len(set(l)))\n\nif __name__ == '__main__':\n towers()", "n = int(input())\r\ncount = 0\r\nnew = []\r\nlength = list(map(int, input().split()[:n]))\r\nfor i in length:\r\n if not i in new:\r\n new.append(i)\r\n if length.count(i) > count:\r\n count = length.count(i)\r\nprint(count, len(new))\r\n", "a=int(input())\r\nl=list(map(int,input().split()))\r\ns=set(l)\r\nmax=l.count(l[0])\r\nfor i in range(a):\r\n if l.count(l[i])>max:\r\n max=l.count(l[i])\r\nprint(max,len(s))", "n = int(input())\na = list(map(int,input().split()))\n\na_dict = {i:0 for i in set(a)}\n\n\nfor i in a:\n if i in a_dict:\n a_dict[i] += 1\nprint(f'{max(a_dict.values())} {len(a_dict)}')\n", "from collections import Counter\r\nn = int(input())\r\na= list(map(int, input().split()))\r\nd = Counter(a)\r\nans = 0\r\nres = 0\r\nfor key in d:\r\n ans+=1\r\n res = max(res, d[key])\r\nprint(res, ans)", "\r\nn = int(input())\r\nl = list(map(int, input().split()))\r\n\r\nse =set(l)\r\n\r\nh = []\r\nfor i in set(l):\r\n\tlt = l.count(i)\r\n\th.append(lt)\r\n\r\nprint(max(h), len(se))", "n = int(input())\r\n\r\nheight = list(map(int, input().split()))\r\nheight.sort()\r\n\r\ndict = {}\r\nfor i in range(n):\r\n if height[i] not in dict:\r\n dict[height[i]] = 1\r\n else:\r\n dict[height[i]] += 1\r\n\r\nM = 0\r\ntotal_tower = 0\r\nfor key in dict:\r\n if dict[key] > M:\r\n M = dict[key]\r\n total_tower += 1\r\n\r\nprint(M, total_tower)", "t=int(input())\r\nx=input()\r\nx=x.split()\r\ny=set(x)\r\nl=0\r\nfor i in y :\r\n z=x.count(i)\r\n if z>l:\r\n l=z\r\nprint('{} {}'.format(l,len(y)))\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\n\r\nfre = [0] * 1005\r\n\r\nmax_h = 1\r\nmin_towers = 0\r\nfor i in range(n):\r\n if fre[a[i]] == 0:\r\n min_towers += 1\r\n fre[a[i]] += 1\r\n max_h = max(max_h, fre[a[i]])\r\n\r\nprint(max_h, min_towers)", "n = int(input())\r\na = list(map(int , input().split()))\r\nh = []\r\nres = []\r\n\r\ncount = 0 \r\nfor i in a : \r\n if(i in h):\r\n continue \r\n else:\r\n if(a.count(i) == 1):\r\n res.append(1)\r\n count += 1 \r\n else:\r\n res.append(a.count(i))\r\n count += 1 \r\n h.append(i)\r\n\r\nprint(str(max(res)) +' ' + str(count))", "a = int(input())\r\nlist = list(map(int, input().split()))\r\nans2 = len(set(list))\r\nsort_mylist = sorted(list)\r\nprint(max(map(list.count,list)), ans2)", "\ndef building(bars) :\n return max([bars.count(i) for i in set(bars)])\n\nno_of_bars = int(input())\n\nbars = list(map(int , input().split(\" \")))\nprint(building(bars), len(set(bars)))\n", "n=int(input())\r\na=list(map(int,input().split()))\r\nb=list(set(a))\r\ny=len(b)\r\nx=0\r\nfor i in range(y):\r\n x=max(x,a.count(b[i]))\r\nprint(x,y)", "import math\r\nimport sys\r\n\r\n\r\ndef scan():\r\n return list(map(int, sys.stdin.readline().strip().split()))\r\n\r\n\r\ndef solution():\r\n n = int(input())\r\n a = scan()\r\n b = {}\r\n for i in a:\r\n if i in b:\r\n b[i] += 1\r\n else:\r\n b[i] = 1\r\n b = [[b[i], i] for i in b]\r\n b = sorted(b, key=lambda x: x[0])\r\n print(b[-1][0], len(b))\r\n\r\n\r\nif __name__ == '__main__':\r\n solution()\r\n", "s=int(input())\r\nl=[0]*(s*20000)\r\nb=list(map(int,input().split()))\r\nc=0\r\nfor i in b:\r\n l[i]+=1\r\nfor j in l:\r\n if j>=1:\r\n c+=1\r\nprint(max(l),c)\r\n", "n = int(input())\r\nx = list(map(int, input().split()))\r\nt = {}\r\np = 0\r\nfor i in x:\r\n if i in t:\r\n t[i] += 1\r\n else:\r\n t[i] = 1\r\nfor k in t:\r\n p = max(t[k], p)\r\nprint(p, len(t))", "from collections import Counter\nn = int(input())\na = list(map(int,input().split()))\na2 = len(set(a))\nc = Counter(a)\na1 = 0\nfor i in c:\n\ta1 = max(a1,c[i])\nprint (a1,a2)", "from collections import Counter as c\r\nL=int(input())\r\nA=list(map(int,input().split()))\r\n\r\nvar=c(A)\r\nvals=list(var.values())\r\n\r\nleft=max(vals)\r\nright=len(set(A))\r\n\r\nprint(left,right)", "import math\r\nimport bisect\r\nimport sys\r\nfrom collections import OrderedDict\r\ninput = sys.stdin.readline\r\ndef inp():\r\n\treturn(int(input()))\r\ndef inlt():\r\n\treturn(list(map(int,input().split())))\r\ndef insr():\r\n\ts = input()\r\n\treturn(s[:len(s)-1])\r\ndef invr():\r\n\treturn(map(int,input().split()))\r\nT = inp()\r\n# for t in range(T):\r\n# N, M = invr()\r\nA = inlt()\r\n# S = insr()sdcdf\r\nA.sort()\r\nfl = False\r\nout = 0\r\nprev = 0\r\nmaxx = 1\r\nfor i in range(T-1):\r\n\tif fl:\r\n\t\tif A[i] != A[i+1]:\r\n\t\t\tfl = False\r\n\t\t\tout += 1\r\n\t\t\tmaxx = max(maxx,i-prev+1)\r\n\telse:\r\n\t\tif A[i] == A[i+1]:\r\n\t\t\tfl = True\r\n\t\t\tprev = i\r\n\t\telse:\r\n\t\t\tout += 1\r\nif T == 1:\r\n\tout = 1\r\nelif fl and T > 1:\r\n\tif A[i]==A[i+1]:\r\n\t\tout += 1\r\n\t\tmaxx = max(maxx, i-prev+2)\r\nelse:\r\n\tout += 1\r\nprint(maxx,out)", "input()\r\nl = list(map(int, input().split()))\r\nc = 0\r\nfor i in set(l):\r\n c = max(c, l.count(i))\r\nprint(c, len(set(l)))", "n = int(input())\r\nfrom collections import Counter\r\nl = list(map(int, input().split()))\r\nd = {i:l.count(i) for i in l}\r\nprint(max(d.values()), len(d))", "n = input()\r\na = [int(i) for i in input().split()]\r\ndictt={}\r\nfor i in a:\r\n dictt[i]=dictt.get(i,0)+1\r\n\r\nmaxx=0\r\nfor i in dictt:\r\n val = dictt[i]\r\n if val > maxx:\r\n maxx=val\r\nprint(maxx,len(dictt))\r\n", "def construct_towers(n, lengths):\r\n freq = {} # Hash table to store the frequency of each bar length\r\n for i in lengths:\r\n if i in freq:\r\n freq[i] += 1\r\n else:\r\n freq[i] = 1\r\n max_height = max(freq.values()) # Height of the largest tower is the maximum frequency\r\n num_towers = len(freq) # Total number of towers is the number of unique bar lengths\r\n return max_height, num_towers\r\n\r\n# Input\r\nn = int(input()) # Number of bars\r\nlengths = list(map(int, input().split())) # Lengths of the bars\r\n\r\n# Call the function to construct towers and print the result\r\nmax_height, num_towers = construct_towers(n, lengths)\r\nprint(max_height, num_towers)\r\n", "a=int(input())\r\nx=input().split()\r\nprint(max(map(x.count,x)),len(set(x)))", "from collections import Counter\r\nN=int(input())\r\nA=list(map(int,input().split()))\r\n\r\nC=Counter(A)\r\n\r\nMAX=max(C.values())\r\n\r\nprint(MAX,len(set(A)))\r\n", "class Solution:\n def towers(self, n, bars):\n total = len(set(bars))\n\n bars.sort(reverse=True)\n\n numFrequency = {}\n\n for i in range(n):\n if bars[i] not in numFrequency:\n numFrequency[bars[i]] = 0\n numFrequency[bars[i]] += 1\n\n maxValue = 0\n\n for key, value in numFrequency.items():\n if maxValue < value:\n maxValue = value\n\n return [maxValue, total]\n\n\n# n = 3\n# bars = [1,2,3]\n\n# n = 4\n# bars = [6,5,6,7]\n\nn = int(input())\nbars = list(map(int, input().split()))\n\nsolution = Solution()\nresult = solution.towers(n, bars)\nprint(*result)\n", "n=int(input())\r\nai = list(map(int, input().split()))\r\nd=dict()\r\nfor i in ai:\r\n if i not in d:\r\n d[i]=1\r\n else:\r\n d[i]+=1 \r\nmax=d[ai[0]]\r\nfor i in range (1,n):\r\n if d[ai[i]]> max:\r\n max=d[ai[i]]\r\nprint(max,len(d))", "def inp():\n return(int(input()))\ndef inlt():\n return(list(map(int,input().split())))\ndef insr():\n s = input()\n return(list(s[:len(s) - 1]))\ndef invr():\n return(map(int,input().split()))\n\n\nbars = inp()\nlengths = inlt()\n\nlengths = sorted(lengths)\n\nrst = {}\nfor i in lengths:\n try:\n rst[i]+=1 \n except:\n rst[i] = 1\n\nprint(max(rst.values()),len(rst.keys())) \n", "N = int(input())\r\nl = map(int, input().split())\r\n\r\nd = dict()\r\nfor x in l :\r\n if x in d :\r\n d[x] += 1\r\n else :\r\n d[x] = 1\r\n\r\nprint(max(d.values()), len(d))", "n = int(input())\r\nnums = list(map(int, input().split()))\r\nunik = []\r\nfor i in range(n):\r\n if nums[i] not in unik:\r\n unik.append(nums[i])\r\ncounts = []\r\nk = len(unik)\r\nfor i in range(k):\r\n counts.append(nums.count(unik[i]))\r\ncounts.sort()\r\nprint(counts[-1],k)", "from collections import defaultdict\n\nn = int(input())\n\nbars = list(map(int, input().split()))\nbar2count = defaultdict(int)\nmx = 0\nfor bar in bars:\n bar2count[bar] += 1\n mx = max(mx, bar2count[bar])\n\nprint(str(mx) + ' ' + str(len(bar2count)))\n", "n=int(input())\r\na=[int(x) for x in input().split()]\r\nl=list(set(a))\r\nif(len(l)==n):\r\n print(1,n)\r\nelif(len(l)==1):\r\n print(n,1)\r\nelse:\r\n mx=-1\r\n for i in range(len(l)):\r\n if(a.count(l[i])>mx):\r\n mx=a.count(l[i])\r\n print(mx,len(l))", "def PROBLEM():\r\n N=int(input())\r\n l=list(map(int,input().split()))\r\n x=FUNCTION(l,N)\r\n print(x,len(set(l)))\r\n \r\ndef FUNCTION(l,N):\r\n MaxC=l.count(l[0])\r\n C=l[0]\r\n for i in l:\r\n if i!=C:\r\n if l.count(i)>MaxC:\r\n MaxC=l.count(i)\r\n return MaxC\r\n \r\nPROBLEM()", "from collections import Counter\r\nn=int(input())\r\narr=list(map(int,input().split()))\r\nfreqDict=dict(Counter(arr))\r\nans1=max(list(freqDict.values()))\r\nans2=len(set(arr))\r\nprint(*[ans1,ans2])\r\n", "n = int ( input () )\r\nl = list ( map ( int, input ().split () ) )\r\nl = sorted ( l )\r\nf = 0\r\ncount = 0\r\nfor i in range ( 0, n - 1 ) :\r\n\tif l[i] == l[i+1] :\r\n\t\tf += 1\r\n\t\tn -= 1\r\n\t\tif count < f :\r\n\t\t\tcount = f\r\n\telse :\r\n\t\tf = 0\r\nprint ( count + 1, n )\t\t\r\n\r\n", "n = int(input())\r\nl = list(map(int, input().split()))\r\nprint(l.count(max(l, key=l.count)), len(set(l)))", "n = int(input())\r\na = list(map(int, input().split()))\r\nheight = {}\r\nfor x in a:\r\n height[x] = height.get(x, 0) + 1\r\nprint(max(height.values()), len(height))", "def tower():\n n = int(input())\n arr_str = input().split()\n arr = [int(i) for i in arr_str]\n\n arr = sorted(arr)\n freq = [0] * (max(arr) + 1)\n max_high, num_tower = 0,0\n\n for i in arr:\n if freq[i] == 0:\n num_tower += 1\n freq[i] += 1\n max_high = max_high if max_high >= freq[i] else freq[i]\n\n return max_high,num_tower\n\n\nres = tower()\nprint(res[0], res[1])", "# 37A => Towers\r\n# https://codeforces.com/problemset/problem/37/A\r\n\r\nfrom collections import Counter\r\n\r\nn = int(input())\r\nlengths = Counter(list(map(int, input().split())))\r\nprint(max(lengths.values()), len(lengths))\r\n", "N = int(input())\r\nt = list(map(int, input().split()))\r\nl = [0] * (1001)\r\nM = 1\r\nc = 0\r\nfor i in t:\r\n if l[i] == 0: c += 1\r\n l[i] += 1\r\n if l[i] > M: M = l[i]\r\nprint(M, c)", "n = int(input())\r\na = list(map(int, input().split()))\r\na.sort()\r\nnum_tower = 0\r\nheighest = 1\r\nleft = 0\r\nright = 0\r\nwhile left < n:\r\n right = left + 1\r\n if right < n and a[right] == a[left]:\r\n while right < n and a[right] == a[left]: \r\n right += 1\r\n heighest = max(heighest, right -left)\r\n num_tower += 1\r\n left = right \r\n\r\nprint(heighest, num_tower)", "n = int(input())\r\nl = list(map(int,input().split()))\r\nt = list(set(l))\r\nl.sort()\r\nmax1 = float(\"-inf\")\r\nfor i in l:\r\n\tmax1 = max(max1,l.count(i))\r\nprint(max1,len(t))", "n,Max=int(input()),0\r\nx = list(map(int, input().split(\" \")))\r\nfor i in set(x):\r\n Max=max(x.count(i),Max)\r\nprint(Max,len(set(x)),sep=\" \")", "from collections import Counter\r\n_ = input()\r\nvls = dict(Counter(map(int, input().split())))\r\nprint(max(vls.values()), len(vls))\r\n", "a,b,c=input(),input().split(),[]\r\nfor i in b: c.append(b.count(i))\r\nprint(max(c),len(set(b)))", "n = int(input())\r\nl = list(map(int,input().split()))\r\ns = set(l)\r\np=[]\r\nfor i in l:\r\n p.append(l.count(i))\r\nprint(max(list(set(p))),len(s))\r\n", "n = input()\r\nl = list(map(int,input().split()))\r\nprint(max(map(l.count, l)), len(set(l)))", "n=int(input())\r\nL=list(map(int,input().split()))\r\nb=[]\r\nc=0\r\nX=L*1\r\nfor i in L:\r\n if c<X.count(i):\r\n c=X.count(i)\r\n while i in X:\r\n X.remove(i)\r\n\r\n##print(X,'promej',c)\r\n\r\nfor i in range(n):\r\n\r\n if not L[i] in b:\r\n b.append(L[i])\r\n## print(b,'kolvo stolbov')\r\nprint(c,len(b))\r\n", "n=int(input())\r\nlst=list(map(int,input().split()))\r\nlst.sort()\r\nm=0\r\nfor i in range(n):\r\n count=0\r\n for j in range(n):\r\n if lst[i]==lst[j]:\r\n count+=1\r\n if count>m:\r\n m=count\r\nprint(m,len(set(lst)))", "n=int(input())\r\na = list(map(int, input().split()))\r\nc=0\r\nd=dict()\r\nfor i in a:\r\n if i not in d:\r\n d[i]=1\r\n else:\r\n d[i]+=1\r\n if(d[i]>c):\r\n c=d[i]\r\n\r\nprint(c,\" \",len(d))\r\n", "from collections import Counter\r\nx = int(input())\r\ns = Counter(list(map(int ,input().split())))\r\n\r\nmx = 0\r\nfor i in s :\r\n mx = max(mx , s[i])\r\n x -= s[i]-1\r\nprint(mx , x)", "inp = int(input())\r\nbars = [int(i) for i in input().split()]\r\ndiction = dict()\r\na = 0\r\n\r\nfor element in bars:\r\n diction[element] = diction.get(element, 0) + 1\r\n\r\na = max(diction.values())\r\n\r\nprint(a, len(diction))\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\nk=0\r\nfor i in range(n):\r\n if l.count(l[i])>k:\r\n k=l.count(l[i])\r\nprint(k, len(set(l)))", "import statistics\r\nN = int(input())\r\na = [int(x) for x in input().split()]\r\nb = set(a)\r\nres = len(b)\r\na = sorted(a)\r\nresult = statistics.mode(a)\r\nfinal = a.count(result)\r\nprint(final,res)\r\n \r\n", "n = int(input())\r\ntowers = [int(i) for i in input().split()]\r\n\r\ntowers.sort()\r\nbest = 0\r\ncount = {}\r\nfor i in towers:\r\n\tcount[i] = count.get(i, 0) + 1\r\nprint(\"%d %d\" %(max(list(count.values())), len(count)))", "# cook your dish here\r\nn = int(input())\r\na = list(map(int,input().split()))\r\ntemp = a.copy()\r\ntemp = set(temp)\r\ntemp = list(temp)\r\nmaxi = 0\r\nfor i in range(len(temp)):\r\n maxi = max(maxi,a.count(temp[i]))\r\nprint(maxi,len(temp))", "n=int(input())\r\nlst=list(map(int,input().split(' ')))\r\nlst2=list()\r\nfor i in lst:\r\n if i not in lst2:\r\n lst2.append(i)\r\ndct=dict()\r\nfor item in lst:\r\n if item not in dct:\r\n dct[item]=1\r\n else:\r\n dct[item]= dct[item]+1\r\nmx_lst=max(dct.values())\r\ntotal=len(lst2)\r\nprint(mx_lst,total)", "n = int(input())\r\nd = {}\r\nl = list(map(int,input().split()))\r\n\r\nfor x in l :\r\n if x not in d.keys():\r\n d[x] = 1\r\n else:\r\n d[x] += 1\r\n\r\nprint (max(d.values()) , len(d.keys()))\r\n \r\n", "n=int(input())\r\ns=[]\r\na=tuple(map(int,input().split()))\r\nb=set(a)\r\nb=list(b)\r\na=list(a)\r\nfor x in range(len(b)):\r\n s.append(a.count(b[x]))\r\nprint(max(s),end=\" \")\r\nprint(len(set(a)))\r\n\r\n\r\n \r\n", "N = int(input())\nbars = map(int, input().split())\n\n\nsize = {}\n\nfor bar in bars:\n if bar in size:\n size[bar] += 1\n else:\n size[bar] = 1\n\nprint(max(size.values()), len(size))\n", "input()\r\na=sorted(map(int,input().split()))\r\nb={}\r\nfor i in a:\r\n if i not in b:b[i]=1\r\n else:b[i]+=1\r\nprint(max(b.values()),len(b))\r\n", "n=int(input())\r\nd=list(map(int,input().split()))\r\ndi=dict()\r\nfor e in d:\r\n if e in di:\r\n di[e]+=1\r\n else:\r\n di[e]=1\r\nsdi=dict(sorted(di.items(),key=lambda x: -x[1]))\r\nprint(sdi[list(sdi)[0]],len(sdi))", "a = input(\"\")\r\nb = input(\"\").split(\" \")\r\nnumberofeach = []\r\nfor value in b:\r\n numberofeach.append(b.count(value))\r\nprint(str(max(numberofeach))+\" \" + str(len(set(b))))\r\n \r\n", "a=int(input())\r\nb=input().split()\r\nprint(max(map(b.count,b)),len(set(b)))", "N = int(input())\r\nallones = map(int,input().split())\r\n\r\nallones = list(allones)\r\nallones = sorted(allones)\r\n\r\nhowmanytowers = 1\r\nfor i in range(len(allones) - 1):\r\n if allones[i] != allones[i+1]:\r\n howmanytowers += 1\r\n\r\ntallest = 1\r\ntalllist = []\r\nfor i in range(len(allones) - 1):\r\n if allones[i] == allones[i+1]:\r\n tallest += 1\r\n else:\r\n talllist.append(tallest)\r\n tallest = 1\r\n\r\ntalllist.append(tallest)\r\nprint(max(talllist), howmanytowers)", "n = int(input())\r\n\r\na = list(map(int, input().split()))\r\n\r\nb = [0] * 1001\r\n\r\nfor i in range(n):\r\n b[a[i]] += 1\r\ncnt = 0\r\nfor i in range(len(b)):\r\n if b[i] != 0:\r\n cnt += 1\r\n \r\nprint(max(b), cnt)", "n = int(input())\r\nbars = list(map(int, input().split()))\r\nbars.sort()\r\n\r\nn_towers = max_height = cur_height = 1\r\n\r\nfor i in range(1, n):\r\n if bars[i] == bars[i - 1]:\r\n cur_height += 1\r\n max_height = max(max_height, cur_height)\r\n else:\r\n n_towers += 1\r\n cur_height = 1\r\n\r\nprint(max_height, n_towers)", "from collections import Counter\r\nn=int(input())\r\nl=list(input().split())\r\nz=Counter(l)\r\nprint(max(z.values()),len(z))", "n = int(input())\na = list(map(int, input().split()))\nd = {}\nfor i in a:\n if i not in d:\n d[i] = 0\n d[i] += 1\n\nmax_ht = -1\ncnt = 0\nfor i in d:\n max_ht = max(max_ht, d[i])\n cnt += 1\nprint(max_ht, cnt)\n", "n = int(input())\r\na = [int(x) for x in input().split(' ')]\r\n\r\na_dict = {}\r\nfor x in a:\r\n if x in a_dict:\r\n a_dict[x] += 1\r\n else:\r\n a_dict[x] = 1\r\n\r\nprint(max(a_dict.values()), len(a_dict))", "n=int(input())\r\nar=list(map(int,input().split()))\r\nd={}\r\nm=0\r\nfor i in ar:\r\n if i in d:\r\n d[i]+=1\r\n else:\r\n d[i]=1\r\nfor i in d.values():\r\n m=max(m,i)\r\nprint(m,len(set(ar))) ", "n=input()\r\na=list(map((lambda x: int(x)),input().split()))\r\na.sort()\r\nxx=-1\r\nans=0\r\ntek=0\r\nmm=0\r\nfor ii in a:\r\n if ii != xx:\r\n ans+=1\r\n tek=1\r\n xx=ii\r\n else: tek+=1\r\n if tek>mm: mm=tek\r\nprint(mm,ans)\r\n \r\n", "from collections import Counter\r\nn=int(input())\r\nl=list(input().split())\r\nz=Counter(l)\r\na=max(z.values())\r\nprint(a,len(z))", "# https://codeforces.com/problemset/problem/37/A\n\nfrom collections import Counter\n\ninput()\n\nvalues = Counter(input().split(\" \"))\n\nprint(f\"{max(values.values())} {len(values)}\")", "from collections import defaultdict\r\ndef construct_towers(bars):\r\n n = len(bars)\r\n bars.sort()\r\n towers = defaultdict(int)\r\n\r\n for bar in bars:\r\n towers[bar] += 1\r\n\r\n return max(towers.values()), len(set(bars))\r\n\r\nif __name__ == '__main__':\r\n n = int(input())\r\n bars = list(map(lambda x: int(x), input().split()))\r\n max_height, num_towers = construct_towers(bars)\r\n print(\"{} {}\".format(max_height, num_towers))", "n = int(input())\r\nL = [int(i) for i in input().split(' ')]\r\nl2 = [*set(L)]\r\nl3 = []\r\nfor e in l2:\r\n l3.append(L.count(e))\r\n\r\nprint(max(l3), len(l2))\r\n", "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\ninput()\r\nli=get_ints_lists()\r\nli1=[]\r\ns=set(li)\r\nfor i in s:\r\n p=li.count(i)\r\n li1.append(p)\r\nprint(max(li1),len(s))\r\n", "from sys import stdin\n\ndef main():\n n=int(stdin.readline())\n liste=[int(x) for x in stdin.readline().split()]\n cant=0\n alt=0\n new_list=[]\n repet=[]\n si=0\n for i in range(n):\n if new_list==[]:\n new_list.append(liste[i])\n cant+=1\n else:\n for j in new_list:\n if j==liste[i]:\n si=1\n if si==0:\n new_list.append(liste[i])\n cant+=1\n si=0\n a=[]\n for i in range(cant):\n a.append(0)\n \n for i in liste:\n for k in range(cant):\n if i ==new_list[k]:\n a[k]+=1\n alt=0\n for i in a:\n if alt<i:\n alt=i\n print(alt,cant)\n \n \n \nmain()\n", "N = int(input())\r\nA = list(map(int,input().split()))\r\nC = [0]*1001\r\nfor i in range(len(A)):\r\n C[A[i]] += 1\r\nk = 0\r\nfor j in range(len(C)):\r\n if C[j] != 0:\r\n k += 1\r\nC.sort()\r\nprint(C[-1], k, sep=' ')", "ln = int(input())\r\n\r\narr = [int(x) for x in input().split()]\r\nele = list(map(lambda x: arr.count(x),arr))\r\n\r\nheight = max(ele)\r\ntot = len(set(arr))\r\n\r\nprint(height,tot)", "from collections import Counter\r\nn = int(input())\r\narr = [int(i) for i in input().split()]\r\ncnt = Counter(arr)\r\n\r\nprint(max(cnt.values()),len(cnt))", "n = int(input())\r\na = list(map(int, input().split()))\r\ns = 0\r\nfor i in range(len(a)):\r\n if a.count(a[i]) > s: s= a.count(a[i])\r\nprint(s,len(set(a)))", "n=int(input())\r\na=list(map(int,input().split()))\r\nb=[]\r\nlast=0\r\nfor i in a:\r\n if a.count(i)>last:\r\n last=a.count(i)\r\n if not i in b:\r\n b.append(i)\r\nprint(last,len(b))\r\n", "t=int(input())\r\na=list(map(int,input().split()))\r\nd={}\r\nfor i in a:\r\n if i not in d.keys():\r\n d[i]=0\r\n d[i]+=1\r\nprint(max(d.values()),len(d.keys()))\r\n", "#!/usr/bin/python3\n\ndef towers(arr):\n tower = {}\n\n for i in arr:\n if i not in tower:\n tower[i] = 0\n\n tower[i] += 1\n\n print(max(tower.values()) , len(tower))\n\nn = int(input())\nnumbers = input().split(\" \")\nnumbers = list(map(int, numbers))\n\ntowers(numbers)\n", "_, bars = input(), sorted(list(map(int,input().strip().split(\" \"))))\nk = max([bars.count(i) for i in bars])\nl = len(set(bars))\nprint(k,l)\n", "n = int(input())\r\nlongitudes = [int(i) for i in input().split()]\r\nlongitudes.sort()\r\nl = 0\r\nt = 1\r\nk = 1\r\nfor i in range(1,n):\r\n if longitudes[i] != longitudes[i-1]:\r\n t += 1\r\n if k > l:\r\n l = k\r\n k = 1\r\n else:\r\n k += 1\r\nif k > l:\r\n l = k\r\nprint(str(l) + \" \" + str(t)) ", "# LUOGU_RID: 118345193\na,c,e,f=int(input()),0,0,[]\r\nb=input().split()\r\nfor d in range(a):\r\n g=b[d]\r\n if g not in f:\r\n if b.count(g)>c:\r\n c=b.count(g)\r\n e+=1\r\n f.append(g)\r\nprint(c,e)", "n = int(input())\r\na = list(input().split())\r\na = [int(i) for i in a]\r\nb = [0 for i in range(1001)]\r\nfor each in a:\r\n b[each] += 1\r\nMAX = 0\r\nans = 0\r\nfor i in range(1001):\r\n if(b[i] > 0):\r\n ans += 1\r\n if(b[i] > MAX):\r\n MAX = b[i]\r\n\r\nprint(MAX,ans)", "import operator\r\n\r\nnum_of_array = int(input())\r\narray = input()\r\n\r\narray = [int(x) for x in array.split()]\r\n\r\n#print(array)\r\n\r\nappear = {}\r\n\r\nfor i in range(num_of_array):\r\n appear[array[i]] = 0\r\n\r\nheight=1\r\nfor i in range(num_of_array):\r\n appear[array[i]] += 1\r\n\r\n#print(appear)\r\n\r\nheight = max(appear.items(), key=operator.itemgetter(1))[1]\r\nprint(str(height) + \" \" + str(len(appear.keys())))", "from collections import Counter\r\nn = int(input())\r\na = list(map(int,input().split()))\r\nb = list(Counter(a).values())\r\nprint(max(b),len(b))", "n=int(input())\r\nd=dict()\r\na=[]\r\na=list(map(int,input().split())) \r\nfor i in a:\r\n if (i in d):\r\n d[i]+=1\r\n else:\r\n d[i]=1\r\nm=0\r\nnb=0\r\nfor i in d.keys():\r\n nb=nb+1\r\n if(d[i]>m):\r\n m=d[i]\r\n\r\nprint(m,nb)\r\n", "from collections import Counter\r\nn = int(input())\r\nc = Counter([int(i) for i in input().split()])\r\nprint(c.most_common()[0][1], len(c))", "n = int(input())\r\nlengths = list(map(int, input().split()))\r\nmin_v = min(lengths)\r\nmax_v = max(lengths)\r\ncounts = [0] * (max_v - min_v + 1)\r\nfor l in lengths:\r\n counts[l - min_v] += 1\r\nmax_height, non_zero = 0, 0\r\nfor i in range(len(counts)):\r\n if counts[i] != 0:\r\n non_zero += 1\r\n if counts[i] > max_height:\r\n max_height = counts[i]\r\nprint(str(max_height) + ' ' + str(non_zero))\r\n", "from collections import Counter as c\r\n_=input()\r\na=c(list(map(int,input().split())))\r\nprint(a.most_common(1)[0][1], len(a))\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\nhmax = 1\r\nN = 1\r\nhtime = 1\r\na.sort()\r\nfor i in range(len(a)-1):\r\n if a[i] != a[i+1]:\r\n htime = 1\r\n N+=1\r\n if a[i] == a[i+1]:\r\n htime+=1\r\n if htime > hmax:\r\n hmax = htime\r\nprint(hmax, end = ' ')\r\nprint(N)\r\n", "#!/usr/bin/python3\n\ndef readln(): return tuple(map(int, input().split()))\n\nn, = readln()\ncnt = {}\nfor l in readln():\n cnt[l] = cnt.get(l, 0) + 1\nprint(max(cnt.values()), len(cnt))\n", "input()\r\nmyDict, maxValue = {}, 0\r\nfor item in [int(x) for x in input().split()]:\r\n if item in myDict:\r\n myDict[item] += 1\r\n else:\r\n myDict[item] = 1\r\n if maxValue < myDict[item]:\r\n maxValue = myDict[item]\r\n\r\nprint('{} {}'.format(maxValue, len(myDict)))", "\r\nn = int(input())\r\na = list(map(int, input().split()))\r\ncount = [0 for x in range(1001)]\r\nres = 0\r\nfor n in a:\r\n if count[n] == 0:\r\n res += 1\r\n count[n] += 1\r\nprint(max(count), res)\r\n\r\n", "n = int(input())\r\na = [0]*1001\r\nfor i in input().split():\r\n a[int(i)]+=1\r\na.sort()\r\ncount = 0\r\nfor i in a[::-1]:\r\n if(i==0):\r\n break\r\n count+=1\r\nprint(a[-1],count)", "from sys import stdin\r\n\r\nn=int(stdin.readline().strip())\r\na=list(map(int,stdin.readline().strip().split()))\r\n\r\nc=[0]*1024\r\ns=0\r\nfor i in a:\r\n s+=not c[i]\r\n c[i]+=1\r\nprint(max(c),s)\r\n\r\n", "from collections import Counter\r\n\r\ndef solve(arr):\r\n\td = Counter(arr)\r\n\tmax_val = max(d.values())\r\n\ttotal_towers = len(d)\r\n\treturn [max_val, len(d)]\r\n\r\nn = int(input())\r\narr = list(map(int, input().split()))\r\nx, y = solve(arr)\r\nprint(x, y)", "n = int(input())\r\nl = input().split()\r\nmaax = 0\r\nans = 0\r\nfor i in range(1 , 1001):\r\n x = l.count(str(i))\r\n if x > maax:\r\n maax = x\r\n if x > 0:\r\n ans = ans + 1\r\nprint(str(maax) + ' ' + str(ans))", "a=int(input())\r\nct=0\r\ntotal=0\r\nl=sorted(map(int,input().split()))\r\nfor i in range(a-1):\r\n if l[i] == l[i+1]:\r\n ct+=1\r\n if ct > total:\r\n total=ct\r\n else:\r\n ct=0\r\nprint(total+1,len(set(l)))", "n = int(input())\r\narr = list(map(int,input().split()))\r\nval = [0]*1001\r\nfor i in range(n):\r\n val[arr[i]]+=1\r\nprint(max(val),len(set(arr)))", "n = int(input())\r\nl = list(map(int, input().split()))\r\n\r\nnum_bars = {}\r\nfor i in range(n):\r\n if l[i] not in num_bars.keys():\r\n num_bars[l[i]] = 1\r\n else:\r\n num_bars[l[i]] += 1\r\n\r\nnum_bars = sorted(num_bars.items(), key=lambda x: -x[1])\r\nprint(num_bars[0][1], len(num_bars))", "n=int(input())\r\nm=list(map(int,input().split()))\r\nhigh=0\r\nx=[]\r\nfor i in range(n):\r\n if m[i] not in x:\r\n x.append(m[i])\r\n if m.count(m[i])>high:\r\n high=m.count(m[i])\r\nprint(high,len(x))\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\nS=set(l)\r\ns=[l.count(i) for i in S]\r\nprint(max(s),len(s))\r\n", "from collections import defaultdict\r\nn = int(input())\r\narr = [int(x) for x in input().split()]\r\nd = defaultdict(int)\r\nfor i in arr:\r\n d[i]+=1\r\nprint(max(d.values()), len(d.keys()))", "from collections import defaultdict\r\nn=int(input())\r\na=list(map(int,input().split()))\r\nd=defaultdict(int)\r\nfor i in a:\r\n d[i]+=1\r\nprint(max(d.values()),len(d))", "a = input()\nb = [int(i) for i in input().split()]\nprint(max([b.count(i) for i in b]), len(set(b)))", "from collections import Counter\r\nn = int(input())\r\nli = list(map(int, input().split()))\r\ncount = [v for v in Counter(li).values()]\r\nind = set(li)\r\nk = max(count)\r\nprint(k, len(ind))", "d = {}\r\nmaxi = 0\r\nn = int(input())\r\nl = list(map(int, input().split()))\r\nfor x in l:\r\n if x in d:\r\n d[x] += 1\r\n else:\r\n d[x] = 1\r\nfor k in d:\r\n maxi = max(d[k], maxi)\r\nprint(maxi, len(d))\r\n", "n = int(input())\r\nstring = input().split()\r\ncounter = 0\r\nhigh = 0\r\nextra_list = []\r\nfor i in string:\r\n if i not in extra_list:\r\n extra_list.append(i)\r\n if string.count(i) > high:\r\n high = string.count(i)\r\n counter += 1\r\nprint(high, counter)", "\r\nn = int(input())\r\na = list(map(int,input().split()))\r\nres1 = set(a)\r\nd =dict()\r\n\r\nfor i in a :\r\n if i not in d :\r\n d[i] = 1\r\n\r\n else:\r\n d[i] +=1\r\n\r\n\r\nmx = -1\r\nfor i in d.values():\r\n if i > mx :\r\n mx = i\r\n\r\nprint(mx , len(list(res1)))", "def most_common(lst):\n return max(set(lst), key=lst.count)\n\nn = int(input())\n\na = list(map(int,input().split()))\n\nb = set(a)\n\nprint(a.count(most_common(a)),len(b))", "# LUOGU_RID: 101448371\nfrom collections import Counter\r\nn, *a = map(int, open(0).read().split())\r\nprint(Counter(a).most_common()[0][1], len(set(a)))", "from collections import Counter\r\nn = int(input())\r\narr = list(map(int, input().split()))\r\nc = list(Counter(arr).values())\r\nprint(max(c), len(set(arr)))", "n=int(input())\r\na = list(map (int, input().split()))\r\nb=set(a)\r\nmaks=0\r\nfor i in range (n):\r\n sk = a.count(a[i])\r\n if sk > maks:\r\n maks=sk\r\n\r\nprint(maks, len(b))", "from collections import Counter\r\n\r\nn = input()\r\n\r\na = [int(x) for x in input().split()]\r\n\r\nl = Counter(a)\r\nl = sorted(l.items(), key = lambda x: x[1], reverse = True)\r\nprint(l[0][1], len(l))\r\n", "n = int(input())\nar = input().split(' ')\nfrom collections import Counter\n\nc = Counter(ar)\n#print(c)\nd = c.most_common(len(c))\nprint(d[0][1], len(d))", "n = int(input())\r\na = list(map(int, input().split()))\r\ntower = {}\r\nfor i in range(n):\r\n if a[i] in tower:\r\n tower[a[i]] +=1\r\n else:\r\n tower[a[i]] = 1\r\ncnt = len(tower)\r\nh = 0\r\nfor _, k in tower.items():\r\n h = max(k, h)\r\nprint(\"{} {}\".format(h, cnt))\r\n", "import math\r\n\r\ndef solve(l):\r\n\r\n l.sort()\r\n st = set(l)\r\n nl = list(st)\r\n\r\n li = []\r\n\r\n for i in nl:\r\n li.append(l.count(i))\r\n li.sort()\r\n\r\n print(li[-1], len(nl))\r\n\r\nt = int(input())\r\nl = list(map(int, input().split()))\r\nsolve(l)\r\n\r\n", "n=int(input())\r\na=[int(i) for i in input().split()]\r\nd=set(a)\r\nl=[]\r\nfor i in d:\r\n l.append(a.count(i)) \r\nprint(max(l),len(d))", "n=int(input())\r\nlist1=list(map(int,input().split(\" \")))\r\ncount=0\r\ncount1=0\r\nfor i in list1:\r\n count=list1.count(i)\r\n if (count>count1):\r\n count1=count\r\nlist1=set(list1)\r\nprint(count1,len(list1))", "n = int(input())\r\na = list(map(int, input().split()))\r\nl = [0] * 1001\r\n\r\ncnt = 0\r\n\r\nfor i in range(n):\r\n if l[a[i]] == 0:\r\n cnt += 1\r\n \r\n l[a[i]] += 1\r\n \r\nprint(max(l), cnt)\r\n\r\n", "n = int(input())\r\n\r\ntow = list(map(int, input().split()))\r\n\r\nfreq = [0] * (max(tow )+1)\r\n\r\nfor i in tow:\r\n freq[i] += 1\r\n\r\n\r\nprint(max(freq), (len(freq) - freq.count(0)), sep=' ')\r\n", "n = int(input())\r\nbars = list(map(int, input().split()))\r\ntowers = {}\r\nfor bar in bars:\r\n if bar not in towers:\r\n towers[bar] = 1\r\n else:\r\n towers[bar] += 1\r\nprint(f'{max(towers.values())} {len(towers)}')", "from collections import Counter as co\r\n\r\nb = int(input())\r\nx = input()\r\ng = list(x.split())\r\ng = list(map(int, g))\r\ng.sort()\r\nd = co(g)\r\nmaximum = max(d, key=d.get)\r\nprint(d[maximum], end=' ')\r\nc = list(dict.fromkeys(g))\r\nprint(len(c))\r\n", "n = int(input())\n\nbars = list(map(int, input().split()))\n\nbarCounter = {}\n\nfor b in bars:\n if b in barCounter: barCounter[b]+=1\n\n else: barCounter[b] = 1\n\ntotal = len(barCounter)\n\nmaxH = 0\n\nfor key in barCounter.keys():\n maxH = max(maxH, barCounter[key])\n\n\nprint(maxH, total)", "input()\r\ncont, maxVal = {}, 0\r\nfor key in input().split(' '):\r\n if key in cont:\r\n cont[key] += 1\r\n else:\r\n cont[key] = 1\r\n\r\n if maxVal < cont[key]:\r\n maxVal = cont[key]\r\n#print(cont)\r\nprint(f'{maxVal} {len(cont)}')", "import collections\r\n\r\ninput()\r\nl = collections.Counter(input().split())\r\nprint(max(l.values()), len(l))", "n = int(input())\r\nmas = list(map(int, input().split()))\r\n\r\nmas.sort()\r\n\r\nk = 0\r\nh = 0\r\n\r\nfor i in range(1,1001,1):\r\n a = mas.count(i)\r\n if a >= 1:\r\n k += 1\r\n if a > h:\r\n h = a\r\nprint(h,' ',k)", "def ktra(a,checked):\r\n max=0\r\n for i in a:\r\n if i not in checked:\r\n checked.append(i)\r\n if a.count(i)>max:\r\n max=a.count(i)\r\n return max,len(checked)\r\nn=int(input())\r\na=list(map(int,input().split()))\r\nchecked=[]\r\nans,ans1=ktra(a,checked)\r\nprint(ans,ans1)", "n = int(input())\r\nnums = [int(x) for x in input().split(\" \")]\r\n\r\nmap_b = {}\r\n\r\nmax_n = 1\r\ncnt_b = 0\r\nfor num in nums:\r\n if num in map_b:\r\n map_b[num] += 1\r\n if map_b[num] > max_n:\r\n max_n = map_b[num]\r\n else:\r\n map_b[num] = 1\r\n cnt_b += 1\r\n\r\nprint(max_n, cnt_b)\r\n", "n = int(input())\r\nT = list(map(int,input().split()))\r\nTowers = dict()\r\n\r\nfor i in T:\r\n if i in Towers:\r\n Towers[i] += 1\r\n else:\r\n Towers[i] = 1\r\n\r\nprint(max(Towers.values()),len(Towers))\r\n", "n = int(input())\r\ns = sorted(list(map(int, input().split())))\r\nkol = 0\r\nmax = 0\r\nnow = 0\r\nfor i in range(n):\r\n if i == 0:\r\n kol += 1\r\n max = 1\r\n now = 1\r\n else:\r\n if s[i] == s[i - 1]:\r\n now += 1\r\n if now > max:\r\n max = now\r\n else:\r\n now = 1\r\n kol += 1\r\nprint(max, kol)\r\n", "import functools as ft\r\n\r\nnumber_of_elements = int(input())\r\narray = list(map(int, input().split()))\r\n\r\ndistinct_elements = list(set(array))\r\n\r\ncount_elements = []\r\n\r\nfor element in distinct_elements:\r\n\tcount_elements.append(array.count(element))\r\n\t\r\nmax_height = ft.reduce(lambda maximum, x: maximum if maximum > x else x, count_elements)\r\n\r\nprint(max_height, len(distinct_elements))", "from collections import Counter\r\n\r\nn = int(input())\r\nl = Counter(input().split())\r\nprint(l.most_common(1)[0][1], len(l))\r\n", "import collections\r\n\r\nn = input()\r\narr = list(map(int, input().split(' ')))\r\n\r\nhm = collections.Counter(arr)\r\nmaxOcc = 1\r\nfor key in hm:\r\n maxOcc = max(maxOcc, hm[key])\r\nprint(maxOcc, len(hm))", "import collections\r\nnum = int(input())\r\narr = list(map(int, input().split()))\r\ncomm = collections.Counter(arr).most_common(1)[0][1]\r\n\r\n\r\nprint(comm,len(set(arr)))\r\n\r\n", "import collections\r\nn=int(input())\r\na=list(map(int,input().split()))\r\nb=collections.Counter(a)\r\nprint(max(b.values()),len(b))", "dem, res, n, lst, cnt = 0, 0, int(input()), list(map(int, input().split())), [0] * 1005\r\nfor x in lst: cnt[x] += 1\r\nfor x in cnt: \r\n if x > 0: dem, res = dem + 1, max(res, x)\r\nprint(res, dem)", "count = [0] * 1010\r\nn = int(input())\r\n\r\nLine = list(map(int,str(input()).split()))\r\nfor elem in Line:\r\n\tcount[elem] += 1\r\n\r\ntallest = 0\r\ntotal = 0\r\n\r\nfor i in range(0,1001):\r\n\ttallest = tallest if tallest > count[i] else count[i]\r\n\tif(count[i] != 0):\r\n\t\ttotal += 1\r\n\r\nprint('{0} {1}'.format(tallest, total))", "n = int(input())\r\na = list(map(int, input().split()))\r\ndict_bar = {}\r\nfor i in range(n):\r\n if a[i] not in dict_bar:\r\n dict_bar[a[i]] = 1\r\n else:\r\n dict_bar[a[i]]+=1\r\nprint(max(dict_bar.values()), end=' ')\r\nprint(len(dict_bar.keys()))", "n = int(input())\nls = [int(i) for i in input().split()]\n\nmaxi = 0\ntot = 0\nls.sort()\nwhile(len(ls)):\n tot+=1\n count = ls.count(ls[0])\n if maxi<count:\n maxi = count\n for i in range(count):\n ls.remove(ls[0])\n\n\nprint(maxi,tot)", "from collections import Counter\r\nn=input()\r\na=list(map(int,input().split()))\r\ndd=Counter(a).values()\r\nprint(max(dd),len(set(a)))", "import collections\r\nn = int(input())\r\nblocks = [int(x) for x in input().split()]\r\nblocks.sort(key=collections.Counter(blocks).get, reverse=True)\r\nprint(blocks.count(blocks[0]), len(set(blocks)))", "n = int(input())\r\na = sorted([int(i) for i in input().split()])\r\nu = set(a)\r\nh = 1\r\nfor i in u:\r\n if h<a.count(i):\r\n h = a.count(i)\r\n\r\nprint(h,len(u))", "x = 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] = 1\r\n else:\r\n dic[i] +=1\r\nprint(max(list(dic.values())),end=\" \")\r\nprint(len(set(l)))", "n = int(input())\r\na = list(map(int, input().split()))\r\n\r\nlength = 0\r\nheight = 1\r\ntowers = 0\r\nfor i in sorted(a):\r\n if i != length:\r\n length = i\r\n towers += 1\r\n elif a.count(i) > height:\r\n height = a.count(i)\r\nprint(height, towers)", "from collections import Counter\r\nn = int(input())\r\nl = list(map(int, input().split()))\r\nc = Counter(l).most_common()\r\nprint(c[0][1], len(set(l)))\r\n\r\n", "from collections import Counter\r\nn = int(input())\r\na = list(map(int, input().split()))\r\n\r\nhashMap = Counter(a)\r\nmax_height = max(hashMap.values())\r\nprint(max_height, len(hashMap))", "n=int(input())\r\nlst=[]\r\nn1=list(map(int,input().split()))\r\nfor i in n1:\r\n lst.append(n1.count(i))\r\ns=set(n1)\r\nprint(max(lst),len(s))\r\n\r\n", "N=int(input())\r\nl=sorted(map(int,input().split()))\r\n\r\nldict={\r\n l[0]:1\r\n}\r\nS=1\r\nfor i in range(1,N):\r\n S+=1\r\n if l[i]!=l[i-1]:\r\n S=1\r\n ldict[l[i]]=S\r\nprint(max(ldict.values()),len(ldict))", "n = int(input())\r\n#print(x)\r\nbars = [i for i in map(int, input().split())]\r\n#bars = sorted(bars)\r\n#print(bars)\r\n \r\nsum = 0\r\ni = 1\r\nd = {}\r\n\r\nfor num in bars:\r\n if num in d:\r\n d[num] += 1\r\n else:\r\n d[num] = 1\r\nprint(max(d.values()), len(d))", "dic = {}\r\n\r\nn = int(input())\r\nfor i in input().split():\r\n if dic.get(i):\r\n dic[i] += 1\r\n else:\r\n dic[i] = 1\r\n \r\nprint(max(dic.values()), len(dic))", "a=int(input())\r\nl=[0]*1005\r\no=[int(x) for x in input().split()]\r\nfor i in o:\r\n l[i]+=1\r\n#print(l)\r\nk=list(set(o))\r\nprint(max(l),end=' ')\r\nprint(len(k))", "n = int(input())\r\nv = [0]*1001\r\nm = list(map(int, input().split()))\r\nfor i in range(n):\r\n v[m[i]]+=1\r\nprint(max(v), 1001-v.count(0))\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\nans = [0]*1001\r\nfor i in range(n):\r\n ans[a[i]] += 1\r\nprint(max(ans), len(set(a)))\r\n", "n=int(input())\nl=list(map(int,input().split()))\nt=[0]*(1002)\nfor i in l:\n\tt[i]+=1\nmx,res=0,0\nfor i in t:\n\tif (i!=0):\n\t\tmx=max(mx,i)\n\t\tres+=1\nprint(mx,res)", "y=int(input())\r\nx=list(map(int,input().split()))\r\nz=[]\r\nfor i in x:\r\n if x.count(i)>1:\r\n z.append(x.count(i))\r\nif len(z)==0:\r\n print(\"1\",end=\" \")\r\n print(len(x))\r\nelse:\r\n print(max(z),end=\" \")\r\n print(len(set(x)))", "from collections import Counter\r\n\r\ninput()\r\nmyDict = dict(Counter([int(item) for item in input().split()]))\r\nmaxValue = max(myDict.values())\r\nprint('{} {}'.format(maxValue, len(myDict)))", "n=int(input())\r\nlis=list(map(int,input().split()))\r\ncount=[]\r\nfor i in range(n):\r\n count.append(lis.count(lis[i]))\r\nlis=set(lis)\r\nprint(max(count),len(lis),end=\" \")\r\n", "n=int(input())\r\na,m={},1\r\nfor x in list(input().split()):\r\n if x in a:\r\n a[x]+=1\r\n if m<a[x]:m=a[x]\r\n else:\r\n a[x]=1\r\nprint(m)\r\nprint(len(a))\r\n", "n=int(input())\r\ns=input()\r\na1=sorted([int(s) for s in s.split()])\r\nl=len(set(a1))\r\na2=set(a1)\r\nm=0\r\nfor i in a2:\r\n u=a1.count(i)\r\n if u>m:\r\n m=u\r\nprint(m,l)\r\n", "n = int(input())\r\nb = sorted(map(int,input().split()))\r\nc = set(b)\r\nif len(b)==len(c):print(1,n)\r\nelse:\r\n\tq=1\r\n\tfor i in c:\r\n\t\tq = max(q,b.count(i))\r\n\tprint(q,len(c))", "from collections import Counter\r\nn=int(input())\r\nl=[int(i) for i in input().split()]\r\nz=Counter(l)\r\nprint(max(z.values()),end=' ')\r\nprint(len(set(l)))", "n = int(input())\r\nnums = [int(x) for x in input().split()]\r\nfreq = dict()\r\n\r\nfor num in nums:\r\n if num not in freq:\r\n freq[num] = 1\r\n else:\r\n freq[num] += 1\r\n\r\nmax_tower = max(map(lambda x: x[1], freq.items()))\r\nnum_towers = len(freq)\r\n\r\nprint(max_tower, num_towers)\r\n", "n=int(input())\r\nl=[int(x) for x in input().split()]\r\nd={}\r\nfor i in range(n):\r\n d[i]=l.count(l[i])\r\nprint(max(d.values()),len(set(l)))", "'''\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\nl = int(input())\r\narr = list(map(int,input().split()))\r\nx = len(set(arr))\r\nc = 1\r\nfor i in arr:\r\n if arr.count(i)>c:\r\n c=arr.count(i)\r\nprint(c,x)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n \r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\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=list(map(int,input().split()))\r\na=[]\r\nz=[]\r\nx=[]\r\nfor i in s:\r\n if i not in a:\r\n a.append(i)\r\n else:\r\n z.append(i)\r\nfor j in z:\r\n v=s.count(j)\r\n x.append(v)\r\nif len(a)==n:\r\n m=1\r\nelse:\r\n m=max(x)\r\nprint(m,len(a))", "# Towers\ndef heights(arr):\n l = len(set(arr))\n di = {}\n for i in arr:\n if i in di:\n di[i] += 1\n else:\n di[i] = 1\n val = max(di.values())\n print(val, l)\n\n\nn = int(input())\narr = list(map(int, input().rstrip().split()))\nheights(arr)", "input()\r\nn = list(map(int, input().split(\" \")))\r\ns = set(n)\r\nmax = 1\r\nfor i in n:\r\n if max < n.count(i):\r\n max = n.count(i)\r\nprint(max, len(s))", "d={}\r\nn=input()\r\nfor t in map(int,input().split()):\r\n if t in d.keys():\r\n d[t]+=1\r\n else:\r\n d[t]=1\r\nprint(max(d.values()), len(d))", "n = int(input())\r\nL = list(map(int, input().split()))\r\nu = []\r\nt = 0\r\nh = 1\r\nfor i in L:\r\n if i in u:\r\n h = max(h, L.count(i))\r\n continue\r\n else:\r\n t += 1\r\n u += [i]\r\nprint(h, t)\r\n", "input()\r\nt = input().split()\r\nprint(max(t.count(j) for j in t), len(set(t)))", "a = int(input())\r\nb = [int(i) for i in input().split()]\r\n\r\nb.sort()\r\nle = len(b)\r\nb.append(0)\r\n\r\ntowers = 0\r\nhigh = 0\r\n\r\nfor i in range(le):\r\n if b[i] != b[i + 1]:\r\n towers += 1\r\n\r\ncount = 1\r\narray_2 = []\r\n\r\nfor i in range(le):\r\n if b[i] == b[i + 1]:\r\n count += 1\r\n else:\r\n array_2.append(count)\r\n count = 1\r\n\r\narray_2.sort()\r\n\r\nprint(array_2[-1], towers)\r\n", "import collections\r\nn = int(input())\r\na = list(map(int,input().split()))\r\nc = collections.Counter(a)\r\nb = c.most_common()[0][1]\r\nans = len(set(a))\r\nprint(b,ans)", "n=int(input())\na=list()\nb=list(map(int,input().split(\" \")))\nc=set(b)\nd=list()\nfor i in c:\n\td.append(b.count(i))\na.append(max(d))\na.append(len(c))\nprint(*a)", "def countTowers(bars, n):\r\n # insertion_sort(bars, n)\r\n dict = {}\r\n for i in bars:\r\n if i not in dict:\r\n dict[i] = 1\r\n else:\r\n dict[i] += 1\r\n return dict\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\ndict = countTowers(a,n)\r\nmax_value = max(dict.values())\r\nlength = len(dict)\r\ns = \"{} {}\".format(max_value, length)\r\nprint(s)", "n = int(input())\r\nL = list(map(int, input().split()))\r\n\r\nl_fre = {}\r\n\r\nfor l in L:\r\n if l not in l_fre:\r\n l_fre[l] = 1\r\n else:\r\n l_fre[l] += 1\r\n\r\nmax_h = 0\r\nnum_tower = 0\r\n\r\nfor l, fre in l_fre.items():\r\n max_h = max(max_h, fre)\r\n num_tower += 1\r\nprint(max_h, num_tower)", "#!/usr/bin/env python\n# coding=utf-8\n'''\nAuthor: Deean\nDate: 2021-11-03 23:56:19\nLastEditTime: 2021-11-04 00:05:01\nDescription: Towers\nFilePath: CF37A.py\n'''\n\n\ndef func():\n n = int(input())\n bars = list(map(int, input().strip().split()))\n height = max(map(lambda el: bars.count(el), list(set(bars))))\n total = len(set(bars))\n print(height, total)\n\n\nif __name__ == '__main__':\n func()\n", "\r\nn = int(input())\r\na = list(map(int, input().split()))\r\ncount = [0 for x in range(1001)]\r\nfor n in a:\r\n count[n] += 1\r\nprint(max(count), len(set(a)))\r\n", "from sys import stdin, stdout\r\nfrom collections import Counter\r\n\r\nintn = lambda : int(stdin.readline())\r\nstrs = lambda : stdin.readline()[:-1]\r\nlstr = lambda : list(stdin.readline()[:-1])\r\nmint = lambda : map(int, stdin.readline().split())\r\nlint = lambda : list(map(int, stdin.readline().split()))\r\nout = lambda x: stdout.write(str(x)+\"\\n\")\r\nout_ = lambda x: stdout.write(str(x)+' ')\r\n\r\ndef main():\r\n n = intn()\r\n c = Counter(lint())\r\n out_(c.most_common()[0][1])\r\n out(len(c.keys()))\r\n\r\nif __name__ == \"__main__\":\r\n main()", "\r\na = int(input())\r\nmaxValue = 0\r\nmy_dic = dict()\r\nfor item in [int(it) for it in input().split(' ')]:\r\n if item in my_dic:\r\n my_dic[item] += 1\r\n else:\r\n my_dic[item] = 1\r\n\r\n if maxValue < my_dic[item]:\r\n maxValue = my_dic[item]\r\n\r\nprint(maxValue, len(my_dic))", "from collections import Counter\r\na=int(input())\r\nb=list(map(int,input().split()))\r\ncount=Counter(b)\r\nmost_common,frequency=count.most_common(1)[0]\r\nc=[]\r\nfor j in range(len(b)):\r\n\tif b[j] not in c:\r\n\t\tc.append(b[j])\r\n\t\t\r\nprint(frequency,len(c))\r\n\t", "n=int(input())\r\nL=list(map(int,input().split()))\r\nx=max(set(L),key=L.count)\r\ny=L.count(x)\r\nprint(y,len(set(L)))", "n = int(input())\r\na = list(map(int,input().split()))\r\ndict={}\r\nmax=0\r\nfor i in a:\r\n try:\r\n dict[i]=dict.get(i)+1\r\n except:\r\n dict.update({i:1})\r\n if(dict.get(i)>max):\r\n max=dict.get(i)\r\ns = str(max)+\" \"+str(len(set(a)))\r\nprint(s)", "bars = int(input())\r\nbar_lengths = [int(i) for i in input().split()]\r\n\r\nheights = []\r\nfor length in set(bar_lengths):\r\n heights.append(bar_lengths.count(length))\r\n\r\nprint(max(heights))\r\nprint(len(set(bar_lengths)))\r\n\r\n", "num_bars = int(input())\nbar_count = {}\nfor bar in map(int, input().split()):\n\tbar_count[bar] = bar_count.setdefault(bar, 0) + 1\n\nmax_count = 0\nfor bar, count in bar_count.items():\n\tmax_count = max(max_count, count)\n\nprint(max_count, len(bar_count))\n\n", "import collections\r\n\r\n\r\nif __name__ == \"__main__\":\r\n n = int(input())\r\n towers = [int(i) for i in input().split()]\r\n count = collections.Counter(towers)\r\n print(count.most_common(1)[0][1], len(count))", "n=int(input())\r\nm=list(map(int,input().split()))\r\nl=set(m)\r\na=max(m,key=m.count)\r\nb=m.count(a)\r\nprint(b,len(l))\r\n", "input()\narr=input()\narr=[int(i) for i in arr.split()]\nu=[]\nfor i in arr:\n if i not in u:\n u.append(i)\nm=-1\nfor i in u:\n x=arr.count(i)\n if x >m:\n m=x\nprint(m,len(u)) \n\n \t \t\t\t \t \t \t\t \t\t \t", "var_numb = int(input())\r\nvars = input().split(\" \")\r\ndiccionario = dict()\r\nfor i in vars: diccionario[int(i)] = vars.count(i)\r\nprint(sorted(diccionario.values())[-1], \" \", len(list(diccionario))) ", "import statistics\r\nn = int(input())\r\narr = [int(i) for i in input().split(' ')]\r\narr.sort()\r\na = statistics.mode(arr)\r\nb = arr.count(a)\r\nc = len(set(arr))\r\nprint(b,c)", "n = int(input())\r\na = [int(x) for x in input().split()]\r\nv = max(a) + 1\r\nb = [0] * v\r\nc = []\r\nfor i in a:\r\n b[i] += 1\r\nfor i in range(v):\r\n if b[i] > 0:\r\n c.append(b[i])\r\nprint(max(c), len(c))", "input()\r\nb = input().split()\r\nprint(max([b.count(i) for i in b]),len(set(b)))", "n = int(input())\na = [int(i) for i in input().split()]\nl = set()\ns = 0\nmax = 0\nfor i in a:\n s = a.count(i)\n l.add(i)\n if (max < s):\n max = s\nprint(max,len(l))", "n = int(input())\r\narr = [int(i) for i in input().split(' ')]\r\narr.sort()\r\ncnt,diff = 0,0\r\n\r\nfor i in arr:\r\n cnt=max(cnt,arr.count(i))\r\n \r\nfor i in range(n-1):\r\n if(arr[i] != arr[i+1]):\r\n diff+=1\r\n\r\nprint(cnt,diff+1)", "n=int(input())\r\na=(input().split())\r\na.sort()\r\nmaxi=0\r\nb=0\r\nc=1\r\nd=-2\r\nfor i in a:\r\n if int(i)==d:\r\n c+=1\r\n if maxi<c:\r\n maxi=c\r\n else:\r\n c=1\r\n d=int(i)\r\n b+=1\r\n if maxi<c:\r\n maxi=c\r\nprint(maxi,b)\r\n \r\n \r\n \r\n\r\n", "from collections import Counter\n\nn = input()\nnums = input().split()\nnums = [int(x) for x in nums]\n\ncounted = Counter(nums)\n\nunique = list(counted.keys())\nmxfreq = max( counted.values() )\n\nprint(mxfreq, len(unique))\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", "class Drg:\r\n def __init__(self,x,y):\r\n self.x = x\r\n self.y = y\r\ninf = Drg(10001,10001)\r\ndef merge(n1,L,n2,R,a):\r\n L.append(inf)\r\n R.append(inf)\r\n i = j = k = 0\r\n while i < n1 or j < n2:\r\n if L[i].x < R[j].x:\r\n a[k] = L[i]\r\n i += 1\r\n else:\r\n a[k] = R[j]\r\n j += 1\r\n k += 1\r\ndef mergeSort(n,a):\r\n if n > 1:\r\n n1 = n // 2\r\n n2 = n - n1\r\n L = a[:n1]\r\n R = a[n1:]\r\n mergeSort(n1,L)\r\n mergeSort(n2,R)\r\n merge(n1,L,n2,R,a)\r\nn = int(input())\r\na = list(map(int,input().split()))\r\nb = set(a)\r\nprint(max(a.count(i) for i in b),end = ' ')\r\nprint(len(b))\r\n", "n = int(input().strip())\r\nll = list(map(int,input().split()))\r\nll = sorted(ll)\r\njav = [1]\r\nk = 1\r\nl = ll[0]\r\nfor i in ll[1:]:\r\n if l == i:\r\n k += 1\r\n else:\r\n l = i\r\n if k != 1:\r\n jav.append(k)\r\n k = 1\r\nif k != 1:\r\n jav.append(k)\r\nprint(max(jav), n - sum(jav)+len(jav))", "n = int(input())\r\nl = [int(i) for i in input().split()]\r\na = [0 for i in range(1001)]\r\n\r\nfor i in l:\r\n a[i]+=1\r\na.sort(reverse=True)\r\nfor i in range(len(a)):\r\n if(a[i]==0):\r\n break\r\nprint(max(a),i)", "# 37A => Towers\r\n# https://codeforces.com/problemset/problem/37/A\r\n\r\nfrom sys import stdin, stdout\r\nfrom collections import Counter\r\n\r\nn = int(stdin.readline())\r\nlengths = Counter(list(map(int, stdin.readline().split())))\r\nstdout.write(\"%d %d\\n\" % (max(lengths.values()), len(lengths)))\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\nmin = 1\r\nfor i in a:\r\n length = a.count(i)\r\n if length > min:\r\n min = length\r\nprint(min, len(set(a)))\r\n", "a = int(input())\r\nb = [int(s) for s in input().split()]\r\nc = list(set(b))\r\nma = 0\r\nfor i in c:\r\n s = b.count(i)\r\n if ma < s:\r\n ma = s\r\nprint(ma, len(c))", "n = int(input())\r\nl = list(map(int,input().split()))\r\n\r\nd = {}\r\nfor i in l:\r\n if i not in d:\r\n d[i] = 0\r\n d[i] += 1\r\nm = 0\r\nfor i in d:\r\n m = max(m, d[i])\r\nprint(m, len(d))\r\n", "n = int(input())\r\nr = lambda : list(map(int, input().split()))\r\narr = r()\r\n\r\nx = set(arr)\r\nans = 0\r\nfor i in x:\r\n ans = max(ans , arr.count(i))\r\nprint(ans , end = \" \")\r\nprint(len(x))\r\n", "w = int(input())\r\nd = [int(x) for x in input().split(' ')]\r\nd_c = set(d.copy())\r\nl = 0\r\nfor x in d_c:\r\n c = d.count(x)\r\n if(l<c):\r\n l=c\r\nprint(l, len(d_c))\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\nm=0\r\np=set(l)\r\nfor i in p:\r\n m=max(m,l.count(i))\r\nprint(m,len(p)) ", "n = int(input())\r\nb = list(map(int, input().split()))\r\nvus = []\r\nc=set(b)\r\nfor i in range(len(b)):\r\n if b.count(b[i]) > 1:\r\n vus.append(b.count(b[i]))\r\n else:\r\n vus.append(1)\r\nprint(max(vus),len(c) )\r\n", "nw = [int(x) for x in input().split()]\nn = nw[0]\narr =[int(x) for x in input().split()]\ntemp =[0]*1001\nfor e in arr:\n\ttemp[e]+=1\n\ntotal=0\nmax_height =0\nfor e in temp:\n\tif e!=0:\n\t\ttotal+=1\n\tmax_height =e if max_height<e else max_height\nprint(\"{0} {1}\".format(max_height,total))\t\t\t\t", "\r\ndef min_towers(N, bars_lengths):\r\n bars_count = {}\r\n for length in bars_lengths:\r\n bars_count[length] = bars_count.get(length, 0) + 1\r\n\r\n max_height = max(bars_count.values())\r\n towers_count = len(bars_count)\r\n\r\n return max_height, towers_count\r\n\r\ndef main():\r\n N = int(input())\r\n bars_lengths = list(map(int, input().split()))\r\n result = min_towers(N, bars_lengths)\r\n print(result[0], result[1])\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n=(int)(input())\r\nd=dict()\r\nmx=0\r\nmas=list(map(int,input().split()))\r\nfor i in mas:\r\n if i in d:\r\n d[i]+=1\r\n else:\r\n d[i]=1\r\n mx=max(mx,d[i])\r\nprint(mx,end=\" \")\r\nprint(len(d))", "n = int(input())\r\narray = list(map(int, input().split()))\r\n\r\nl = [0]*1001\r\n\r\nfor i in range(0, len(array)):\r\n\tl[array[i]]+=1\r\n\r\n\r\nmax = l[0]\r\ncount = 0\r\n\r\nfor i in range(0, len(l)):\r\n\tif l[i] > max:\r\n\t\tmax = l[i];\r\n\r\n\tif l[i] != 0:\r\n\t\tcount+=1\r\n\r\n\r\nprint(max, count)\r\n\r\n# print(l)", "from collections import Counter\r\n\r\ndef solve():\r\n n = int(input())\r\n arr = list(map(int,input().split()))\r\n c1 = Counter(arr)\r\n #print(c1)\r\n unique = set(arr)\r\n max_len = -1\r\n for elem in unique:\r\n max_len = max(max_len,c1[elem])\r\n print(max_len,' ',len(c1))\r\n\r\n\r\nsolve()", "a=int(input())\r\nb=[int(i) for i in input().split()]\r\nc=[]\r\nd=[]\r\nfor i in b:\r\n if (i in c)==False:\r\n c.append(i)\r\nfor i in b:\r\n d.append(b.count(i))\r\nprint(max(d),len(c))\r\n", "n=int(input())\r\nm=list(map(int,input().split()))\r\nd={}\r\nfor x in m: \r\n\tif x not in d:d[x]=1\r\n\telse:d[x]+=1\r\nc=-1\r\nfor x in d:\r\n\tif d[x]>c:\r\n\t\tc=d[x]\r\nprint(c,len(set(m)))", "n, l = int(input()), [0] * 1001\r\n\r\nfor i in map(int, input().split()):\r\n l[i] += 1\r\n \r\nprint(max(l), 1001 - l.count(0))", "# def sol():\r\n# for i in range(len(lst)):\r\n# for j in range(i+1, len(lst)):\r\n# if lst[i][1] > lst[j][1]:\r\n# return True\r\n# return False\r\n#\r\n#\r\n# n = int(input())\r\n# lst = []\r\n# lstb = []\r\n# for i in range(n):\r\n# p, q = [int(i) for i in input().split()]\r\n# lst.append((p, q))\r\n# lstb.append(q)\r\n# lst.sort(key=lambda x: x[0])\r\n# lstb.sort()\r\n# if sol():\r\n# print(\"Happy Alex\")\r\n# else:\r\n# print(\"Poor Alex\")\r\n\r\nn = int(input())\r\nlst = [int(i) for i in input().split()]\r\ns = set(lst)\r\nlst.sort()\r\nc = 1\r\nm = 1\r\nfor i in range(len(lst)-1):\r\n if lst[i] == lst[i+1]:\r\n c += 1\r\n if c > m:\r\n m = c\r\n else:\r\n c = 1\r\nprint(m, len(s))", "n, l = input(), list(map(int, input().split()))\r\nprint(max([l.count(e) for e in l]), len(set(l)))", "N = int(input())\r\nL = [int(i) for i in input().split()]\r\nh = [L.count(L[i]) for i in range(len(L))]\r\ntowers = []\r\nfor i in L:\r\n if i not in towers:\r\n towers.append(i)\r\nprint(max(h), len(towers))\r\n ", "# *\r\n# * *\r\n# * *\r\n# * * * Author:Aditya Joshi\r\n# * *\r\n# * *\r\nfrom collections import defaultdict\r\nn = int(input())\r\nl = list(map(int, input().split()))\r\nd = defaultdict(int)\r\nfor i in l:\r\n d[i] += 1\r\n\r\nprint(max(d.values()), len(d))\r\n", "def building(elements):\r\n\r\n elements_sort = dict()\r\n for ele in elements:\r\n _add_elemet(elements_sort, ele)\r\n\r\n hight = _hight_building(elements_sort)\r\n count_building = _count_building(elements_sort)\r\n return hight, count_building\r\n\r\n\r\ndef _hight_building(elements_sort):\r\n return max(elements_sort.values())\r\n\r\ndef _count_building(elements_sort):\r\n return len(elements_sort)\r\n\r\ndef _add_elemet(elements_sort, ele):\r\n if ele in elements_sort:\r\n elements_sort[ele] = elements_sort[ele] + 1\r\n else:\r\n elements_sort[ele] = 1\r\n return elements_sort\r\n\r\n\r\ndef main():\r\n _ = input()\r\n elements = list(map(int,input().split()))\r\n print(*building(elements))\r\n\r\n\r\nmain()", "t=int(input())\r\nlst=list(map(int,input().split()))\r\ndic={}\r\nlst.sort()\r\nfor i in lst:\r\n if i in dic:\r\n dic[i]+=1\r\n else:\r\n dic[i]=1\r\nprint(max(dic.values()),len(set(lst)))\r\n", "n=int(input())\r\nliste=list(map(int,input().split()))\r\ndico=dict()\r\nfor ele in liste :\r\n dico[ele]=0\r\nfor ele in liste :\r\n dico[ele]+=1 \r\nprint(max(dico.values()),len(dico))\r\n \r\n\r\n", "if __name__ == \"__main__\":\r\n n = int(input())\r\n res = list(map(int, input().split()))\r\n result2 = set(res)\r\n result1 = []\r\n for i in result2:\r\n result1.append(res.count(i))\r\n \r\n print(max(result1), len(result2))", "n=int(input())\r\na=list(map(int,input().split()))\r\n\r\na.sort()\r\ncount=1\r\nhigh=1\r\npill=1\r\nfor i in range(1,n) :\r\n if a[i]!=a[i-1] :\r\n count+=1\r\n pill=1\r\n if a[i]==a[i-1] :\r\n pill+=1\r\n if pill>high :\r\n high=pill\r\n\r\nprint(high,count)\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\ncounter = 0\r\nmas = [-1 for k in range(n)]\r\nfor i in range(0, n):\r\n for j in range(0, n-1):\r\n if a[j] > a[j+1]:\r\n a[j],a[j+1] = a[j+1],a[j]\r\ntemp = -1\r\nfor k in range(n):\r\n cnt = 0\r\n if a[k] == temp:\r\n continue\r\n for x in range(n):\r\n if a[k] == a[x]:\r\n cnt+=1\r\n mas[k] = cnt\r\n temp = a[k]\r\ncnt = 0\r\nmax = 1\r\nfor i in range(0, n):\r\n if mas[i] >= 1:\r\n cnt+=1\r\n if mas[i] > max:\r\n max = mas[i]\r\nprint(str(max) + \" \" + str(cnt))", "data = input()\r\ndata = [int(x) for x in input().split()]\r\ndup = []\r\ntowers = []\r\nfor d in data:\r\n if not d in dup:\r\n towers.append(data.count(d))\r\n dup.append(d)\r\ny = str(max(towers)) + \" \" + str(len(towers))\r\nprint(y)", "import sys\nfrom collections import Counter\ninput = sys.stdin.readline\n\nL = int(input())\nA = list(map(int, input().split()))\n\nC = Counter(A).most_common()\nprint(C[0][1], len(C))\n", "from sys import stdin\n\n\ndef main():\n n = int(stdin.readline().strip())\n l = [0] * 1001\n for x in map(int, stdin.readline().strip().split()):\n l[x] += 1\n return max(l), sum(map(bool, l))\n\n\nprint(*main())\n", "n = int(input())\r\na = list(map(int, input().split()))\r\na_count = [a.count(i) for i in a]\r\nprint(max(a_count), len(set(a)))", "\r\nn = int(input())\r\nt = list(map(int,input().split()))\r\np = {}\r\nfor i in t:\r\n p[i] = p.get(i, 0) + 1\r\nprint(max(p.values()), len(p))\r\n", "from sys import stdin,stdout\r\ndef main():\r\n n=stdin.readline()\r\n d={}\r\n l=[int(x) for x in stdin.readline().split()]\r\n for k in l:\r\n if k in d:\r\n d[k]+=1\r\n else:\r\n d[k]=1\r\n num=len(d)\r\n m=max(d.values())\r\n print(m,num)\r\nmain()\r\n", "import math\r\nn=int(input())\r\na=list(map(int,input().split()))\r\na.sort()\r\nans=[]\r\nsum=0\r\ni=0\r\nwhile i<n:\r\n j=i\r\n while j<n:\r\n if a[i]==a[j]:\r\n sum+=1\r\n else:\r\n break\r\n j+=1\r\n i=j\r\n ans.append(sum)\r\n sum=0\r\n\r\n#print(a,ans)\r\nans.sort()\r\nl=len(ans)\r\nprint(ans[l-1],l)\r\n", "n = int(input())\r\nl = sorted(list(map(int,input().split())))\r\nsetl = set(l)\r\nl1 = []\r\nif len(l)==len(setl):\r\n\tprint(1,n)\r\nelse:\r\n\tfor i in setl:\r\n\t\tl1.append(l.count(i))\t\r\n\tprint(max(l1),len(setl))\t", "n = int(input())\r\narr = list(map(int, input().split()))\r\nm = max(arr) + 1\r\ncounts = [0]*m\r\nfor i in arr:\r\n counts[i] += 1\r\n \r\nsub_list = []\r\nfor i in range(m):\r\n if i in arr:\r\n sub_list.append(counts[i])\r\nsub_list.sort()\r\n\r\nprint (sub_list[-1], len(sub_list))", "n=int(input())\r\na=list(map(int,input().split()))\r\nb=[]\r\nf=[]\r\nlast=0\r\nfor i in a:\r\n if not i in b:\r\n b.append(i)\r\n else:\r\n f.append(i)\r\n if f.count(i)>last:\r\n last=f.count(i)\r\nprint(last+1,len(b))\r\n", "n = int(input())\r\nl = list(map(int, input().split(' ')))\r\n\r\nt = 0\r\nc = 0\r\nd = {}\r\nfor i in l:\r\n if i in d:\r\n d[i] += 1\r\n else:\r\n d[i] = 1\r\n\r\nfor i in d.values():\r\n if i > t:\r\n t = i\r\n c += 1\r\n\r\nprint(t,c)", "n = int(input())\r\nl = list(map(int,input().split()))\r\ns = set(l)\r\np = 0\r\nfor num in s:\r\n c = l.count(num)\r\n if c > p:\r\n p = c\r\nprint(p,len(s))", "val = dict()\nn = int(input())\nvals = input()\nvals = vals.split(' ')\nmax = 0\ni = 0\nwhile i < n:\n att = vals[i]\n if att in val:\n val[att] += 1\n else:\n val[att] = 1\n i+=1\nfor x in val:\n if val[x] > max:\n max = val[x]\nprint(f\"{max} {len(val)}\")\n\t \t\t\t\t \t \t \t \t\t \t \t", "n=int(input())\r\nblocks=list(map(int,input().split()))\r\nheight=0\r\ncount=0\r\nk=0\r\nblocks.sort()\r\nfor i in blocks:\r\n## print('i',i)\r\n if i>k:\r\n m = blocks.count(i)\r\n k=i\r\n## print('m',m,'k',k)\r\n count+=1\r\n## print('count',count)\r\n if m > height:\r\n height = m\r\n## print('height',height)\r\nprint(height,count)\r\n\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\n\r\na.sort()\r\nmax_height = 0\r\nnum_tow = 0\r\ni = 0\r\nwhile (i < n):\r\n num_tow += 1\r\n j = i+1\r\n cur_height = 1\r\n while (j < n and a[j] == a[i]):\r\n cur_height += 1\r\n j += 1\r\n max_height = max(cur_height, max_height)\r\n i = j\r\n\r\nprint(max_height, num_tow)\r\n", "input()\r\nl = list(map(int, input().split()))\r\na = set(l)\r\nresult = max(l.count(i) for i in a)\r\nprint(result, len(a))", "n = int(input()) \r\na = list(map(int, input().split(\" \")))\r\n\r\nfor i in range(n - 1):\r\n\tfor j in range(i + 1, n): \r\n\t\tif a[i] > a[j]:\r\n\t\t\ttmp = a[i]\r\n\t\t\ta[i] = a[j]\r\n\t\t\ta[j] = tmp\r\n\r\nmaxLength = 1 \r\ncount = 1 \r\nd = 1 \r\nfor i in range(1, n): \r\n\tif a[i] == a[i - 1]: \r\n\t\td += 1\r\n\t\tif maxLength < d: \r\n\t\t\tmaxLength = d\r\n\telse:\r\n\t\td = 1\r\n\t\tcount += 1\r\n\r\nprint(maxLength, end = ' ')\r\nprint(count)", "n = int(input())\r\na = [int(i) for i in input().split()]\r\nk=1\r\nj=0\r\nl=[1 for i in range(0,n)] \r\na.sort()\r\no=a[0]\r\nfor i in range(1,n):\r\n if a[i]==a[i-1]:\r\n l[j]+=1\r\n else:\r\n j+=1\r\n k+=1\r\nprint(max(l),k)\r\n\r\n", "n=int(input())\nlst=list(map(int,input().split(' ')))\nlst2=list()\nfor i in lst:\n if i not in lst2:\n lst2.append(i)\ndct=dict()\nfor item in lst:\n if item not in dct:\n dct[item]=1\n else:\n dct[item]= dct[item]+1\nmx_lst=max(dct.values())\ntotal=len(lst2)\nprint(mx_lst,total)\n \t\t \t\t\t\t \t\t\t \t \t \t\t\t \t\t \t", "# d = int(input())\r\n# input()\r\n# bars = []\r\n# bars = [int(item) for item in input().split(' ')]\r\n#\r\n# array = []\r\n# for i in bars:\r\n# array.append(int(i))\r\n#\r\n# array.sort()\r\n#\r\n# length = len(array)\r\n# ans = 1\r\n# maxheight = 1\r\n#\r\n# for i in range(len(array) - 1):\r\n# if array[i] == array[i + 1]:\r\n# maxheight += 1\r\n# else:\r\n# ans += 1\r\n#\r\n# print(maxheight, ans)\r\n#\r\n\r\ninput()\r\nmaxVal, myDict = 0, dict()\r\n\r\nfor key in [int(it) for it in input().split(' ')]:\r\n if key in myDict:\r\n myDict[key] += 1\r\n else:\r\n myDict[key] = 1\r\n if maxVal < myDict[key]:\r\n maxVal = myDict[key]\r\n\r\nprint(maxVal, len(myDict))\r\n", "x=input()\r\nz=list(map(int,input().split()))\r\nv=[]\r\nk=[]\r\nfor i in z:\r\n v.append(z.count(i))\r\n if i not in k:\r\n k.append(i)\r\nprint(max(v), len(k))", "a=[0]*1001\r\nb=int(input())\r\ne=0\r\nh=0\r\nc=[int(i) for i in input().split()]\r\nfor i in range(b):\r\n a[c[i]]+=1\r\nfor i in range(1001):\r\n if a[i]>e:\r\n e=a[i]\r\n if a[i]!=0:\r\n h+=1\r\nprint(e,h,end=\" \")\r\n \r\n", "n = map(int, input().split())\r\nbars = list(map(int, input().split()))\r\n\r\n\r\narr = [0]*1001\r\n\r\nfor bar in bars:\r\n if (arr[bar] == 0):\r\n arr[bar] = 1\r\n else:\r\n arr[bar] += 1\r\n\r\n \r\nh = max(arr)\r\ntotal = len([x for x in arr if x > 0])\r\n\r\nprint(h, total)", "n = int(input())\r\nl = list(map(int, input().split()))\r\na = 0\r\nb = []\r\nd = []\r\nfor i in range(n):\r\n a = l.count(l[i])\r\n b.append(a)\r\n if l[i] not in d:\r\n d.append(l[i])\r\nprint(max(b), len(d))\r\n", "n = int(input())\r\na = list(map(int,input().split()))\r\nf = dict()\r\nfor i in a:\r\n try:\r\n f[i] += 1\r\n except KeyError:\r\n f[i] = 1\r\nprint(max(f.values()),len(f))", "_=int(input())\r\nok=[int(a) for a in input().split()]\r\ni=ok[0]\r\ncount=0\r\nfor thing in ok:\r\n freq=ok.count(thing)\r\n if freq>count:\r\n count=freq\r\n i=thing\r\n\r\nprint(ok.count(i),len(set(ok)))", "N = int(input())\r\nll = list(map(int, input().split()))\r\ndl ={}\r\nn = 0\r\nm = 0\r\nfor l in ll:\r\n if l in dl:\r\n dl[l] += 1\r\n else:\r\n n += 1\r\n dl[l] = 1\r\n m = max(dl[l], m)\r\nprint(\"%d %d\" % (m, n)) ", "def Insertion_sort(tower,n):\r\n for i in range(len(tower)):\r\n key=tower[i]\r\n j=i-1\r\n while j>-1 and tower[j]>key:\r\n tower[j+1]=tower[j]\r\n j-=1\r\n tower[j+1]=key\r\n return tower \r\n\r\n\r\ndef Count_tower(tower,n):\r\n tower_sorted=Insertion_sort(tower,n)\r\n set_tower,count=[],1\r\n for i in range(n):\r\n if tower_sorted[i] in set_tower:\r\n continue\r\n set_tower.append(tower_sorted[i])\r\n for i in range(len(set_tower)):\r\n temp=0\r\n for j in range(len(tower_sorted)):\r\n if set_tower[i]==tower_sorted[j]:\r\n temp+=1\r\n if temp>count:\r\n count=temp\r\n return \"{0} {1}\".format(count,len(set_tower))\r\n\r\n\r\nif __name__==\"__main__\":\r\n n=int(input())\r\n tower=list(map(int,input().split()))\r\n print(Count_tower(tower,n))", "n=int(input())\r\nvasya=dict()\r\na=list(map(int,input().split()))\r\nfor i in a:\r\n if i not in vasya:\r\n vasya[i]=1\r\n else:\r\n vasya[i]+=1\r\nk=0\r\nfor x in (vasya.keys()):\r\n if (k<vasya[x]):\r\n k=vasya[x]\r\nprint(k,len(vasya))\r\n", "import sys\nimport math\n\nclass Reader:\n def __init__(self):\n self.data = ''.join(sys.stdin.readlines()).split()\n self.idp = 0\n \n def get(self, t):\n value = t(self.data[self.idp])\n self.idp += 1\n return value\n \n def list(self, t, k):\n value = map(t, self.data[self.idp:self.idp+k])\n self.idp += k\n return list(value)\n\n\nr = Reader()\nn = r.get(int)\nh = r.list(int, n)\nh.sort()\nmk, m = 0, 0\nk = 0\nl = -1\nfor v in h:\n if v != l:\n mk = 0\n k += 1\n mk += 1\n if (m < mk):\n m = mk\n l = v\nprint(m, k)", "n = int(input())\r\na = input().split()\r\nk = 1\r\na.sort()\r\nlast = a[0]\r\no = 1\r\nl = 1\r\nfor i in range(1,n):\r\n if a[i] == last:\r\n o += 1\r\n\r\n else:\r\n if o > k:\r\n k = o\r\n o = 1\r\n l += 1\r\n last = a[i]\r\nif o > k:\r\n k = o\r\n'''b = []\r\nfor i in range(0,n):\r\n o = 1\r\n for j in a[i+1:]:\r\n if a[i] == j and a[i] not in b:\r\n o+=1\r\n n-= 1\r\n b.append(a[i])\r\n if o > k:\r\n k += 1'''\r\nprint(k, l)", "n = int( input())\r\ncl = [0]*1005\r\nll = list(map(int, input().split()))\r\nfor l in ll:\r\n cl[l]+=1\r\ncl.sort(reverse=True)\r\nprint(\"%d %d\" % (cl[0], len(set(ll))))", "n=int(input())\r\na=list(map(int,input().split()))\r\nb=[]\r\nfor i in a:\r\n b.append(a.count(i))\r\nprint(max(b), len(set(a)))", "n=int(input())\r\nbars=list(map(int,input().split()))\r\nhigh=max(list(map(lambda x:bars.count(x),bars)))\r\ntowers=len(set(bars))\r\nprint(high,towers)", "n = int(input())\r\nl = [int(i) for i in input().split()]\r\ns = len(set(l))\r\nl2 = list(set(l))\r\nm = 0\r\nfor i in l2:\r\n\tm = max(m,l.count(i))\r\nprint(m,s)\r\n", "n = int(input())\r\nlst = [0] * 1000;\r\nt = list(map(int, input().split(' ')));\r\nfor i in range(len(t)):\r\n lst[int(t[i] - 1)]+=1;\r\ncnt = 0;\r\nfor i in lst:\r\n if i:\r\n cnt+=1;\r\nprint(max(lst), cnt);", "n = input()\r\nl = [int(i) for i in input().split()]\r\n\r\nd = {}\r\n\r\nfor i in l:\r\n if d.get(i):\r\n d[i] += 1\r\n else:\r\n d[i] = 1\r\n\r\n\r\nheighest = max(d.values())\r\n\r\ntotal = len(d.keys())\r\n\r\nprint('%d %d' %(heighest, total))", "g = input()\r\ni = input().split()\r\nprint(max(map(i.count, i)), len(set(i)))", "n = int(input())\r\na = list(map(int, input().split()))\r\nm = []\r\nfor i in range(len(a)):\r\n kol = 0\r\n for j in range(len(a)):\r\n if a[i] == a[j]:\r\n kol += 1\r\n m.append(kol)\r\nprint(max(m), len(set(a)))\r\n", "from collections import Counter\r\nn=int(input())\r\nw=[int(k) for k in input().split()]\r\nc=Counter(w)\r\nres=0\r\nfor j in c.keys():\r\n res=max(res, c[j])\r\nprint(res, len(c))", "# coding=utf-8\n#4841: 用木棍搭塔\r\nn=int(input())\r\nla=list(map(int,input().split()))\r\nsa=set(la)\r\nm=len(sa)\r\nk=0\r\nfor item in sa:\r\n k=max(k,la.count(item))\r\nprint(k,m)\n\t\t \t\t\t\t\t\t\t\t \t\t\t\t \t\t \t \t", "#!/usr/bin/python\r\n\r\nm = int(input())\r\nlist=input().split()\r\nres={}\r\nfor i in list:\r\n t=int(i)\r\n if res.__contains__(t):\r\n res[t]+=1\r\n else:\r\n res[t]=0\r\n res[t]+=1\r\nmax = -1\r\nfor i in res:\r\n if res[i]>max:\r\n max=res[i]\r\nprint(max,len(res))\r\n", "def towers_2(n,l):\r\n sorted_l=sorted(l)\r\n sorted_l=sorted_l+[10000]\r\n values=[]\r\n keys=[]\r\n this_count=1\r\n for i in range(len(sorted_l)-1):\r\n if sorted_l[i+1]==sorted_l[i]:\r\n this_count+=1\r\n else:\r\n values.append(this_count)\r\n keys.append(sorted_l[i])\r\n this_count=1\r\n print (max(values),len(values))\r\nn=int(input())\r\nl=list(map(int, input().split()))\r\ntowers_2(n,l) \r\n\r\n ", "from collections import Counter\r\n\r\n\r\ninput()\r\nc = Counter(int(i) for i in input().split())\r\nprint(max(c.values()), len(c))\r\n", "z=int(input())\r\nx=list(map(int,input().split()))\r\nd=[]\r\nq=[]\r\nfor i in range(z):\r\n if q==[] or x[i] not in q:\r\n d.append(x.count(x[i]))\r\n q.append(x[i])\r\n \r\n \r\nprint(max(d),len(d))", "n = int(input())\ndic = {}\nline = input()\nitems = line.split()\nfor item in items:\n if item in dic:\n dic[item] += 1\n else:\n dic[item] = 1\nprint(max(dic.values()), len(dic.keys()))\n", "#Towers\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\n\r\na.sort()\r\n\r\ntemp = a[0]\r\nmax = 1\r\nh = 0\r\ncount = 1\r\nfor i in range(n):\r\n if temp == a[i]:\r\n h += 1\r\n if h > max:\r\n max = h\r\n else:\r\n count += 1\r\n temp = a[i]\r\n h = 1\r\n\r\nprint(\"{} {}\".format(max, count))", "madeiras_x = int(input())\n\nmadeiras = list(map(int, input().split()))\n\naux = 0\n\nfor madeira in madeiras:\n \n if madeiras.count(madeira) > aux:\n aux = madeiras.count(madeira)\n\nprint(aux, len(set(madeiras)))\n\n\n\t\t \t\t \t \t\t \t \t\t \t\t \t", "n = input()\r\na = list(map(int, input().split()))\r\nbrus = []\r\ncount = []\r\n\r\nfor i in range(len(a)):\r\n # if a[i] not in brus:\r\n brus.append(a.count(a[i]))\r\n\r\nfor i in a:\r\n if i not in count:\r\n count.append(i)\r\n\r\n# print(brus, count, sep='\\n')\r\nprint(max(brus), len(count))", "a = int(input())\r\nb = [int(i) for i in input().split()]\r\nc = set(b)\r\nd = list(c)\r\nmaxi = 0\r\n \r\nfor i in range(len(d)):\r\n cur = b.count(d[i])\r\n if cur > maxi:\r\n maxi = cur\r\nprint(maxi, len(c))\r\n", "n = int(input())\r\na = list(map(int, input().split(\" \")))\r\n\r\ncnt = [0] * 1001\r\n\r\ns = 0\r\nh = 0\r\nfor i in range(0, n):\r\n if cnt[a[i]] == 0:\r\n s += 1\r\n cnt[a[i]] += 1\r\n h = max(h, cnt[a[i]])\r\n\r\nprint(h, s)", "input()\r\nl = input().split()\r\nprint(max(l.count(i) for i in l), len(set(l)))\r\n", "input();d={};t=0\r\nfor i in input().split():\r\n if i in d:d[i]+=1\r\n else:d[i]=1\r\nprint(max(d.values()),len(d))", "x = int(input())\r\nbarl = list(map(int, input().split()))\r\nli = []\r\nmaxbar = \"A\"\r\nfor i in barl:\r\n if i not in li:\r\n if maxbar==\"A\":\r\n maxbar = barl.count(i)\r\n elif barl.count(i)>maxbar:\r\n maxbar = barl.count(i)\r\n li.append(i)\r\nprint(maxbar, len(li))", "n=int(input())\r\nmax_list=list()\r\n\r\nline=input()\r\nline_i=[int(s) for s in line.split()]\r\n\r\nline_i=sorted(line_i)\r\nsum=1\r\nfor i in range(n-1): \r\n if line_i[i]==line_i[i+1]:\r\n sum+=1\r\n else:\r\n max_list.append(sum)\r\n sum=1\r\nmax_list.append(sum)\r\n\r\nprint(str(max(max_list))+\" \"+str(len(max_list)))", "n = int(input())\r\nmax_len = 1\r\ncur_len = 1\r\nunique = 1\r\nseq = sorted(list(map(int, input().split())))\r\nfor i in range(n - 1):\r\n if seq[i] == seq[i + 1]:\r\n cur_len += 1\r\n if cur_len > max_len:\r\n max_len = cur_len\r\n else:\r\n unique += 1\r\n cur_len = 1\r\nprint(max_len, unique)\r\n", "n = int(input())\nb = input()\nb = b.split(' ')\nmdict={}\nl = []\nfor i in b:\n if i in mdict.keys():\n mdict[i] += 1\n else:\n mdict[i] =1\nm = 0\ncount = 0\nfor i in mdict.values():\n count +=1\n \n if i > m:\n m = i\n\nprint(m,count) \n\t\t\t \t \t \t \t\t \t \t \t\t", "from collections import Counter\r\n\r\nn = int(input())\r\nl = list(map(int,input().split()))\r\n\r\ncount = Counter(l)\r\n\r\n_max = 0\r\nfor i in count.keys():\r\n _max = max(_max,count[i])\r\n\r\nprint(_max, len(set(l)))", "n: int = int(input())\narr = list(map(int, input().split()))\nctn = {}\nfor i in arr:\n if i not in ctn:\n ctn[i] = 0\n ctn[i] += 1\nprint(max(ctn.values()), len(ctn))\n\n \t\t\t\t \t \t\t\t \t\t \t \t\t\t\t\t\t \t \t", "def string2list(x):\r\n x=x.split()\r\n i=0\r\n for i in range(len(x)):\r\n x[i]=int(x[i])\r\n return x\r\n\r\ndef towers(x):\r\n i=0\r\n num=0\r\n currentmult=1\r\n mult=0\r\n N=len(x)\r\n j=0\r\n while i<N:\r\n current=x[i]\r\n mult=0\r\n while x[i]==current and i<N:\r\n mult=mult+1\r\n i=i+1\r\n if i==N:\r\n break\r\n j=j+1\r\n currentmult=max(currentmult,mult)\r\n return (currentmult,j)\r\n\r\n\r\n\r\nN=input()\r\nx=input()\r\nx=string2list(x)\r\nx.sort()\r\na,b=towers(x)\r\nprint(a,b)", "n = int(input())\r\ndata = list(map(int, input().split()))\r\n\r\nuniqueness, great_l = [], 0\r\nfor i in data:\r\n if i not in uniqueness:\r\n uniqueness.append(i)\r\n if data.count(i) > great_l:\r\n great_l = data.count(i)\r\n\r\nprint(great_l, len(uniqueness))\r\n\r\n", "n=int(input())\r\na=[0]*1010\r\nl=list(map(int,input().split()))\r\nfor i in range(n):\r\n\ta[l[i]]+=1\r\ncnt=0\r\nfor p in a:\r\n\tif p>0:\r\n\t\tcnt+=1\r\nprint(max(a),cnt)", "n=int(input())\r\nlist1=sorted(list(map(int,input().split(\" \"))))\r\nhashi=[0]*1001\r\nfor j in list1:\r\n hashi[j]+=1\r\nprint(max(hashi),1001-hashi.count(0))\r\n", "m = []\r\nk = 0\r\nn = int(input())\r\nl = sorted([int(x) for x in input().split()])\r\ns = set(l)\r\nfor i in s:\r\n k = l.count(i)\r\n m.append(k)\r\nprint(max(m),len(s))", "\r\nn = int(input())\r\n\r\na = list(map(int, input().split()))\r\n\r\na = sorted(a)\r\n\r\npre = -1\r\nans = 0\r\nhighest = -1\r\n\r\nfor i in a:\r\n if i != pre:\r\n count = 1\r\n ans += 1\r\n pre = i\r\n else:\r\n count += 1\r\n highest = max(highest, count)\r\n\r\nprint(highest, ans, end=' ')", "a = int(input())\nb = list(map(int, input().split()))\nA = []\nB = []\nfor i in range(len(b)):\n if b.count(b[i])>1:\n A.append(b.count(b[i]))\n b[i] = 'a'\n else:\n A.append(1)\n B.append(b[i])\nprint(max(A), len(B))\n\t\t \t \t\t\t\t \t\t\t\t \t \t\t\t\t", "import math\r\nfrom collections import Counter,defaultdict\r\nI =lambda:int(input())\r\nM =lambda:map(int,input().split())\r\nLI=lambda:list(map(int,input().split()))\r\nn=I()\r\na=LI()\r\nd=Counter(a)\r\nprint(max(d.values()),len(d))", "n=int(input())\r\na=list(map(int,input().split()))\r\nc=0\r\ns=[]\r\nfor i in range(n):\r\n c=max(c,a.count(a[i]))\r\n count=0\r\n if a.count(a[i])==1:\r\n s.append(a[i])\r\n else:\r\n for j in range(i+1,n):\r\n if a[j]!=a[i]:\r\n count+=1\r\n if count==n-i-1:\r\n s.append(a[i])\r\n\r\nprint(c, int(len(s)))", "n = int(input())\r\na = list(map(int, input().split()))\r\ndict = {}\r\nfor i in range(len(a)):\r\n if not (a[i] in dict.keys()):\r\n dict[a[i]] = 1\r\n else:\r\n dict[a[i]] += 1\r\nx = max(dict.values())\r\nprint(x, len(dict))\r\n", "from collections import Counter\r\nn=int(input())\r\ninp=list(map(int,input().split()))\r\nc=Counter(inp)\r\nmaxx=0\r\nfor i in c:\r\n if c[i]>maxx:\r\n maxx=c[i]\r\nprint(maxx,len(c)) ", "from collections import Counter\r\ninput()\r\narr=list(map(int,input().split(\" \")))\r\nfre = Counter(arr)\r\n\r\nsortedFre = sorted(fre.items(),key= lambda x : -x[1])\r\n\r\nprint(sortedFre[0][1], len(fre))", "# author: violist\n# created: 09.07.2021 17:44:44\n\nimport sys\ninput = sys.stdin.readline\n\nn = int(input())\na = list(map(int, input().split()))\nb = []\nfor i in range(n):\n if (a[i] not in b):\n b.append(a[i])\nmaxi = [0] * len(b)\nfor i in range(len(b)):\n maxi[i] = a.count(b[i])\nprint(max(maxi), len(set(a)))\n", "n = int(input())\r\nl = list(map(int,input().split()))\r\nd = {}\r\nfor n in l:\r\n if n in d:\r\n d[n] += 1\r\n else:\r\n d[n] = 1\r\nprint(max(d.values()),len(d))", "n = int(input())\na = list(map(int,input().split()))\na.sort()\nb = 1\nh = 1\nhmax = 1\nfor i in range(n-1):\n if a[i] != a[i+1]:\n b+=1\n h = 1\n else:\n h+=1\n if h > hmax:\n hmax = h\n\nprint(hmax,b) \n\n \n \n \n \n \n\n\n \n\n", "d={}\r\ninput()\r\nfor i in map(int,input().split()):d[i]=1+d.get(i,0)\r\nprint(max(d.values()),len(d))", "import collections\r\nn = int(input())\r\na = [int(i) for i in input().split()]\r\nc = collections.Counter(a).most_common(n)\r\nprint(c[0][1],len(c))", "m = int(input())\r\np = list(map(int, input().split()))\r\na = [0] * 1001\r\nfor i in p:\r\n a[i] += 1\r\nprint(max(a), len(set(p)))\r\n", "from collections import Counter\r\na = int(input())\r\nb = list(map(int,input().split()))\r\nc = []\r\nfor i in range(len(b)):\r\n if b[i] not in c:\r\n c.append(b[i])\r\nelement_counts = Counter(b)\r\nmost_common_element, frequency = element_counts.most_common(1)[0]\r\nprint(frequency,len(c))", "n = int(input())\r\nlst = [int(i) for i in input().split()]\r\nset1 = set(lst)\r\nc = max(map(lst.count, set1))\r\n\r\nprint(c, len(set1))\r\n", "n=int(input())\nl=list(map(int,input().split()))\nl.sort()\nmaxa=0\nx=l[0]\ncount=0\ntowers=1\nfor i in l:\n if(i==x):\n count+=1\n if(count>maxa):\n maxa=count\n else:\n count=1\n towers+=1\n x=i\nprint(maxa,towers) \n", "n = int(input())\r\narr = list(map(int, input().split()))\r\ndic = {x: arr.count(x) for x in set(arr)}\r\nprint(max(dic.values()), len(dic))", "n = int(input())\r\na = list(map(int,input().split()))\r\nf =dict.fromkeys(a,0)\r\nmx = 1\r\nfor i in a:\r\n f[i]+=1\r\n mx = max(mx,f[i])\r\n\r\nprint(mx,len(f))", "n = int(input())\r\nl = list(map(int,input().split()))\r\nb = set(l)\r\na = [0]*1001\r\nfor i in range(n):\r\n a[l[i]] += 1\r\na.sort()\r\nprint(a[1000],len(b))", "n=int(input())\r\nbars=[int(x) for x in input().split()]\r\nbars_=set(bars)\r\nheight=[]\r\nfor i in bars_:\r\n s=0\r\n for j in bars:\r\n if i==j:\r\n s=s+1\r\n height.append(s)\r\nprint(max(height),len(bars_))\r\n", "def insertionSort(a):\r\n n = len(a)\r\n for i in range(1, n):\r\n cur = a[i]\r\n j = i\r\n while (j > 0) and (a[j - 1] > cur):\r\n a[j] = a[j - 1]\r\n j = j - 1\r\n a[j] = cur\r\n return a\r\nn = int(input())\r\na = list(map(int, input().split()))\r\ninsertionSort(a)\r\na.append(-1)\r\nmax = 1\r\ncnt = 1\r\ndiff = 0\r\nfor i in range(1, n + 1):\r\n if a[i] != a[i - 1]:\r\n diff += 1\r\n if cnt > max:\r\n max = cnt\r\n cnt = 1\r\n else:\r\n cnt += 1\r\n\r\nprint(str(max) + ' ' + str(diff))", "a=int(input())\r\nb=list(map(int,input().split()))\r\nc=set(b)\r\nans2=len(c)\r\nans1=0\r\nfor i in c:\r\n if(b.count(i)>ans1):\r\n ans1=b.count(i)\r\nprint(ans1,ans2)", "def solution():\n bar_count = int(input())\n bars = sorted(int(x) for x in input().split())\n\n length, max_length, max_value, height, i, j = -1, -1, -1, 1, 0, 0\n while i < bar_count:\n j = i + 1\n while j < bar_count:\n if bars[i] != bars[j]:\n height += 1\n break\n\n j += 1\n\n length = j - i\n if length > max_length:\n max_length = length\n max_value = bars[i]\n\n i = j\n\n print(max_length, height)\n\n\nif __name__ == '__main__':\n solution()", "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())).values()\r\nprint(max(w), len(w))", "n=int(input());a={}\nfor x in map(int,input().split()):\n\ta[x]=a.get(x)+1 if x in a else 1\nprint(max(a.values()),len(a))\n", "n = int(input())\r\ndic = dict()\r\nlis = list(map(int,input().split()))\r\nmax_t = 0\r\nl = 0\r\nfor x in lis:\r\n if x not in dic:\r\n dic[x] = 0\r\n l+=1\r\n dic[x] += 1\r\n if dic[x]>max_t:\r\n max_t = dic[x]\r\nprint(max_t,l)", "n = int(input())\r\na = input().split()\r\nfor i in range(0, len(a)):\r\n a[i] = int(a[i])\r\na.sort()\r\nans = 1\r\ndifer = 1\r\nmaxi = 1\r\nfor i in range(1, len(a)):\r\n if a[i] == a[i-1]:\r\n ans = ans + 1\r\n if ans > maxi:\r\n maxi = ans\r\n \r\n if a[i] != a[i-1]:\r\n ans = 1\r\n difer += 1\r\nprint(maxi, difer)\r\n", "n, a, b, c = int(input()), list(map(int, input().split())), [0 for i in range(1001)], [0 for i in range(1001)]\r\n\r\nh = 0\r\n\r\nfor i in a:\r\n b[i] += 1\r\n h = max(h, b[i])\r\n\r\nfor i in b:\r\n if i > 0:\r\n c[i] += 1\r\n\r\nprint(h, sum(c))\r\n", "\r\nc= int(input())\r\nt= list(map(int,input().split(' ')))\r\ncc={}\r\nfor i in t:\r\n if i not in cc:\r\n cc[i]=1\r\n else:\r\n cc[i]+=1\r\nmaxh=0\r\ncount=0\r\nfor i,j in cc.items():\r\n count+=1\r\n if j>maxh:maxh=j\r\nprint(maxh,count)\r\n\r\n\r\n", "n = int(input())\r\nl = list(map(int, input().split()))\r\nd = {}\r\nz = 0\r\nmax = 0\r\nfor i in range (0, n):\r\n if l[i] not in d:\r\n d[l[i]] = 1\r\n else:\r\n d[l[i]] += 1\r\nfor i in d.values():\r\n z += 1\r\n if i > max:\r\n max = i\r\nprint(max, z)", "n=int(input())\r\nd={}\r\nk=input()\r\nL=k.split()\r\nfor i in L:\r\n d[i]=0\r\nfor i in L:\r\n d[i]+=1\r\nprint(max(d.values()),len(d.keys()))\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\nans = 0\r\nfor i in set(a):\r\n ans = max(ans, a.count(i))\r\nprint(ans, len(set(a)))\r\n", "input()\r\na = input().split()\r\nb = set()\r\nfor x in a:\r\n b.add(x)\r\nprint(max(a.count(x) for x in a), len(b))", "d={}\r\nn=int(input())\r\nfor i in map(int,input().split()):\r\n\td[i]=d.get(i,0)+1\r\nprint(max(d.values()),len(d))\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\nx=set(l)\r\ny=[]\r\nfor i in range(n):\r\n y.append(l.count(l[i]))\r\nprint(max(y),len(x)) \r\n \r\n ", "def main():\r\n _ = int(input())\r\n\r\n foo = [0] * 1001\r\n for elem in input().split():\r\n length = int(elem)\r\n foo[length] += 1\r\n\r\n print(max(foo), len(foo) - foo.count(0))\r\n\r\nmain()\r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\nprint(max(a.count(i) for i in a),len(set(a)))", "n = int(input())\r\nl = list(map(int, input().split()))\r\nc = {}\r\nfor i in range(n):\r\n if (l[i] in c):\r\n c[l[i]] += 1\r\n else: \r\n c[l[i]] = 1\r\na = max(c.values())\r\nprint(str(a) + \" \" + str(len(c)))", "n=int(input())\r\nd={}\r\nl=[int(x) for x in input().split()]\r\nfor a in l:\r\n if a in d:\r\n d[a]+=1\r\n else:\r\n d[a]=1\r\nprint(max(d.values()),len(d.values()))", "n = int(input())\r\ntowers = input().split(' ')\r\n\r\ntowers_created = {}\r\n\r\nfor tower in towers:\r\n if tower in towers_created:\r\n towers_created[tower] += 1\r\n else:\r\n towers_created[tower] = 1\r\n\r\nmaxHeight = towers_created[towers[0]]\r\namount_towers = 0\r\nfor element in towers_created.items():\r\n height = element[1]\r\n if maxHeight <= height:\r\n maxHeight = height\r\n\r\n amount_towers += 1\r\n\r\nprint(maxHeight,amount_towers)", "n=int(input())\r\nh=list(map(int,input().split()))\r\ndh=list(set(h))\r\nht=[]\r\nfor i in dh:\r\n a=h.count(i)\r\n ht.append(a)\r\nprint(max(ht),end=\" \")\r\nprint(len(dh))", "from collections import Counter\r\nm=0\r\nn=int(input())\r\na=list(Counter(map(int,input().split())).items())\r\nb=[]\r\nfor i in range(len (a)):\r\n b.append(a[i][1])\r\nprint(max(b))\r\nprint(len(a))", "d = {}\r\nn = int(input())\r\nmax = 1\r\na = list(map(int, input().split()))\r\nfor i in a:\r\n if i in d:\r\n d[i] += 1\r\n if d[i] > max:\r\n max = d[i]\r\n else:\r\n d[i] = 1\r\nb = len(d)\r\nprint(max, b)", "class Block:\r\n def __init__(self, l, m):\r\n self.l = l\r\n self.m = m\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\n\r\nL = 0\r\nb = []\r\nfor x in a:\r\n f = False\r\n for y in b:\r\n if (y.l == x):\r\n y.m += 1\r\n f = True\r\n break\r\n if (f == False):\r\n b.append(Block(x, 1))\r\n L += 1\r\nM = 0\r\nfor y in b:\r\n if (y.m > M):\r\n M = y.m\r\nprint(M, L)\r\n\r\n", "# # insertion sort part\r\ndef insertAsc(a, n, x):\r\n j = n\r\n while j > 0:\r\n if a[j-1] > x:\r\n a[j] = a[j-1]\r\n j -= 1\r\n else:\r\n break\r\n a[j] = x\r\n\r\ndef insertion_sort(a, n):\r\n for i in range(1,n):\r\n x = a[i]\r\n insertAsc(a, i, x)\r\n return a\r\n\r\ndef countTowers(bars, n):\r\n insertion_sort(bars, n)\r\n prev = 0\r\n max_height = 0\r\n height = 0\r\n count = 0\r\n for i in bars:\r\n if i == prev:\r\n height += 1\r\n prev = i\r\n else:\r\n height = 1\r\n count += 1\r\n prev = i\r\n max_height = max(max_height, height)\r\n s = \"{} {}\".format(max_height, count)\r\n return s\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\nprint(countTowers(a,n))\r\n", "n = int(input())\na = [int(i) for i in input().split()]\ncnt = [a.count(i) for i in range(1, 1001)]\nprint(\"{0} {1}\".format(max(cnt), len(set(a))))\n", "t= int(input())\nl= list(map(int,input().split()))\n\nm=-1111111\nunq=0\nc=[]\nfor num in l:\n if num not in c:\n c+=[num]\n unq+=1\n if m<=l.count(num):\n m=l.count(num)\nprint(m,unq)\n\n\t\t\t\t \t\t \t\t\t\t\t\t \t \t\t \t\t \t\t", "import collections\r\n\r\nn = int(input())\r\nlengths = [int(x) for x in input().split(' ')]\r\n\r\nc = collections.Counter(lengths)\r\nprint(c.most_common()[0][1], len(c)) \r\n\r\n", "n = int(input())\r\nl = list(map(int, input().split()))\r\nL = list(set(l))\r\nans = 0\r\nfor i in L:\r\n c = l.count(i)\r\n if c > ans:\r\n ans = c\r\nprint(f'{ans} {len(L)}')\r\n", "if __name__ == '__main__':\r\n n = int(input())\r\n arr = list(map(int,input().split()))\r\n arr.sort()\r\n x=y=1\r\n t = 1\r\n for i in range(1,n):\r\n if arr[i] != arr[i-1]:\r\n t = 1\r\n y += 1\r\n else:\r\n t += 1\r\n if t > x:x = t\r\n print('{} {}'.format(x,y))", "n = input()\r\nl = input().split()\r\nprint(max(map(l.count, l)), len(set(l)))", "n=int(input())\r\nlis=input().split()\r\nfor i in range(n):\r\n lis[i]=int(lis[i])\r\nse=list(set(lis))\r\nk=len(se)\r\ncount=[0 for i in range(k)]\r\nfor i in range(n):\r\n for j in range(k):\r\n if lis[i]==se[j]:\r\n count[j]+=1\r\nprint(max(count),k)\r\n", "import math\r\n\r\ndef ost(a,b):\r\n if a%b!=0:\r\n return 1\r\n return 0\r\n\r\n\r\nn=int(input())\r\ndata=list(map(int,input().split()))\r\n\r\nMAX=0\r\n\r\na=set()\r\nfor i in range(n):\r\n a.add(data[i])\r\nfor i in a:\r\n if data.count(i)>MAX:\r\n MAX=data.count(i)\r\n\r\n\r\nprint(MAX,len(a))", "from collections import Counter\r\nn=input()\r\nl=list(map(int,input().split()))\r\nx=Counter(l)\r\nc=x.most_common(1)[0][1]\r\nprint(c,len(set(l)))", "n=int(input())\r\na=list(map(int,input().split()))\r\na1=list(set(list(a)))\r\nans=[]\r\nfor x in range(len(a1)):\r\n ans.append(a.count(a1[x]))\r\nprint(max(ans),len(a1))\r\n", "n=int(input())\r\nl=list(map(int, input().split()))\r\ns=list(set(l))\r\np=[]\r\nx=len(s)\r\nfor i in range(len(s)):\r\n p.append(l.count(s[i]))\r\nprint(max(p),x)\r\n", "n = int(input())\r\nh = list(map(int, input().split()))\r\n\r\npure_h = []\r\ntowers = 0\r\nfor i in range(n):\r\n if h[i] not in pure_h :\r\n pure_h.append(h[i])\r\n towers += 1\r\nmaax = h.count(pure_h[0])\r\nfor j in range(1,len(pure_h)):\r\n x = h.count(pure_h[j])\r\n if x > maax :\r\n maax = x\r\nprint(maax, towers)\r\n", "#El algoritmo se presta a parecer un poco Greedy debido a que se esta buscando la respuesta y beneficio inmediato mas rapido\n#Ninguno de los otros algoritmos queda con la definicion para solucionar este problema\nbarras = int(input())\nalturas = input().split()\n#The count() method returns the number of elements with the specified value\n#Aqui vemos cuantas veces se encuentra el numero de cierta barra en los valores introducidos sin necesidad de tomar en cuenta cuantas barras son\n#Para ver el numero de veces que esta cierto numero se utiliza count y esa sera la torre mas alta, para poder encontrarlo se itera en un for\n#for i in alturas:\n # veces = max(alturas.count(i))\n#veces = max(vec)\nveces = max(alturas.count(i) for i in alturas)#Se toma el numero mas alto con el max\n#Para calcular las torres que se van a hacer es la longitud de los datos que no estan erpetidos, si solo uso len salen todos\n#Set permita que no se repitan los numeros de un set, y los acomoda juntos\ncantidad = len(set(alturas))\n#Imprimir\nprint(veces, cantidad)\n\n \t\t\t \t\t\t\t\t \t\t \t \t \t\t\t \t \t\t", "a=int(input())\r\nl1=list(map(int,input().split()))\r\nl2=[]\r\nfor i in l1:\r\n if i not in l2:\r\n l2.append(i)\r\nb=len(l2)\r\nl3=[]\r\nfor i in l2:\r\n l3.append(l1.count(i))\r\nc=max(l3)\r\nprint(c,b)", "n, maxVal = int(input()), 0\r\narr = [int(item) for item in input().split()]\r\ncont = dict()\r\nfor item in arr:\r\n if item in cont:\r\n cont[item] += 1\r\n else:\r\n cont[item] = 1\r\n if maxVal < cont[item]:\r\n maxVal = cont[item]\r\n\r\n\r\n# print(cont)\r\n# print(f'maxval = {maxVal}')\r\nprint(maxVal,len(cont))\r\n\r\n'''\r\n17\r\n5 9 2 2 9 5 9 2 5 9 2 9 5 2 5 5 5 5\r\n\r\n\r\n\r\n\r\n -----\r\n -----\r\n -----\r\n -- ----- ---------\r\n -- ----- ---------\r\n -- ----- ---------\r\n -- ----- ---------\r\n -- ----- ---------\r\n\r\n (2 -> 5) (5 -> 8) (9 -> 5)\r\n\r\n 8 3\r\n'''\r\n", "input()\r\n*b, = map(int, input().split())\r\na = sorted(b, key = b.count)\r\nprint(a.count(a[-1]), len(set(a)))\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\ndi = {}\r\nfor i in range(n):\r\n di[a[i]] = di.get(a[i], 0) + 1\r\nprint(max(di.values()), len(di))", "import itertools\nimport math\n\nN = int(input())\ntowers = [int(x) for x in input().split()]\ntowers.sort()\nres = [len(list(group)) for k,group in itertools.groupby(towers)]\nprint(max(res), len(res))\n", "musor = int(input())\r\nspisok = list(map(int, input().split()))\r\nmax_count = 0\r\nfor j in range(musor):\r\n if max_count < spisok.count(spisok[j]):\r\n max_count = spisok.count(spisok[j])\r\nspisok = set(spisok)\r\nprint(max_count, len(spisok))\r\n", "n = int(input())\r\nmaximum = 0\r\nmy_dict = dict()\r\nfor item in [int(it) for it in input().split(' ')]:\r\n if item in my_dict:\r\n my_dict[item] += 1\r\n else:\r\n my_dict[item] = 1\r\n\r\n if(maximum < my_dict[item]):\r\n maximum = my_dict[item]\r\nprint(maximum, len(my_dict))\r\n", "total_bars=int(input())\r\nl=input().split()\r\n\r\ncount=[0 for i in range(1000)]\r\nnum_of_towers=0\r\nfor i in range(total_bars):\r\n count[int(l[i])-1] = count[int(l[i])-1]+1\r\nfor i in range(1000):\r\n if count[i]!=0:\r\n num_of_towers = num_of_towers + 1\r\nprint(max(count),num_of_towers)", "from collections import Counter\r\nn = int(input())\r\na = list(Counter(map(int,input().split())).items())\r\nc = []\r\nfor i in range(len(a)):\r\n c.append(a[i][1])\r\nprint(max(c),len(a))", "def tow(L):\r\n K=[]\r\n for i in L:\r\n H=set(L)\r\n C=L.count(i)\r\n K.append(C)\r\n return str(max(K))+\" \"+str(len(H))\r\n\r\nn=int(input())\r\nL=list(map(int,input().split()))\r\nprint(tow(L))", "from collections import Counter\r\ninput()\r\nls = Counter(map(int,input().split()))\r\nprint(ls.most_common(1)[0][1], len(ls))", "x=int(input())\r\ny=[int(i) for i in input().split()]\r\nz=len(set(y))\r\nw=y.count(1)\r\nfor j in range(1001):\r\n if w<y.count(j):\r\n w=y.count(j)\r\nprint(w,z)\r\n", "# m, n = map(lambda v: int(v), input().split())\r\n# n = int(input())\r\nimport collections\r\n\r\ninput()\r\nl = list(map(lambda v: int(v), input().split()))\r\ns = set(l)\r\n\r\nprint(collections.Counter(l).most_common(1)[0][1], len(s))\r\n", "num = int(input())\r\nnums = input().split()\r\ndic = {}\r\nans = \"\"\r\nfor i in range(num):\r\n if nums[i] in dic.keys():\r\n dic[nums[i]] += 1\r\n else:\r\n dic[nums[i]] = 1\r\nans += str(max(dic.values())) + \" \"\r\nans += str(len(dic.keys()))\r\nprint(ans)", "n,m=int(input()),list(map(int,input().split()))\r\nl=set(m)\r\na=len(l)\r\nmax=0\r\nfor i in m:\r\n x= m.count(i)\r\n if x>max:\r\n max=x\r\nprint(max,a)\r\n", "from collections import Counter\r\n\r\ninput()\r\na = Counter(input().split()).values()\r\n\r\nprint(max(a), len(a))\r\n\r\n#########################################\r\n## ##\r\n## Implemented by brownfox2k6 ##\r\n## ##\r\n#########################################", "n = int(input())\r\nblocks = list(map(int, input().split()))\r\nblocks.sort()\r\nmax_height, count = blocks.count(blocks[0]), 1\r\n\r\nfor i in range(len(blocks) - 1):\r\n if blocks[i] != blocks[i + 1]:\r\n count += 1\r\n max_height = max(blocks.count(blocks[i + 1]), max_height)\r\nprint(max_height, count)\r\n", "n = int(input())\r\na=list(map(int,input().split()))\r\nb=[]\r\nfor i in a:\r\n b.append(a.count(i))\r\naa=set(a)\r\nprint(max(b),len(aa))\r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\nb=list(set(a))\r\nc=[]\r\nfor i in range(len(b)):\r\n c.append(a.count(b[i]))\r\nprint(max(c),end=\" \")\r\nprint(len(b))\r\n" ]

[ "from collections import deque\r\n\r\n\r\nn, m = map(int, input().split())\r\n\r\nqueue = deque([(n, 0)])\r\n\r\nvisited = set()\r\n\r\n\r\nwhile queue:\r\n current, clicks = queue.popleft()\r\n if current == m:\r\n print(clicks)\r\n break\r\n\r\n if current * 2 not in visited and current * 2 <= 10**4:\r\n queue.append((current * 2, clicks + 1))\r\n visited.add(current * 2)\r\n\r\n if current - 1 > 0 and current - 1 not in visited:\r\n queue.append((current - 1, clicks + 1))\r\n visited.add(current - 1)\r\n", "def Two_Buttons(n, m):\n if n >= m:\n return n - m\n elif m % 2 == 0:\n return 1 + Two_Buttons(n, m // 2)\n else:\n return 1 + Two_Buttons(n, m + 1)\n\n\nn, m = map(int, input().split())\nprint(Two_Buttons(n, m))\n", "n,m=map(int,input().split())\r\ncount=0\r\nwhile n<m:\r\n if m%2==0:\r\n m//=2\r\n else:\r\n m+=1\r\n count+=1\r\ncount+= n-m\r\nprint(count)", "def solve():\r\n n, m = map(int, input().split())\r\n\r\n if m < n:\r\n print(n - m)\r\n else:\r\n res = 0\r\n while n < m:\r\n if m % 2 == 1:\r\n m += 1\r\n else:\r\n m //= 2\r\n res += 1\r\n print(res + (n - m))\r\n\r\nif __name__ == \"__main__\":\r\n q = 1\r\n # q = int(input())\r\n for _ in range(q):\r\n solve()\r\n", "n,m=map(int,input().split())\r\na=0\r\nwhile n<m:\r\n if m&1==0:\r\n m//=2\r\n else:\r\n m+=1\r\n a+=1\r\nprint(a+n-m)\r\n ", "magic = b\"X>D+Ca&#bbd2<S5Y+-YAAa8SYa%Ev{Itm~lARuIAW*}c*Y;$O7W^`X)D05|OW-K6KDLM)uARr(hARr)VW*}i8Jv|_0Ze(ma3LqdLARr(hARr(hAai+hE^~BbZ*_DocXDZTWhf$CZXziPARr(hARr(hARr(hb9r+vb97{Hb#yLfY;|*JC@BgcARr(hARr)RY;$Eg3LqdLARr(hARr(hAai+hE^~BbZ*_DocXDZTWhirWawuUbDGDGUARr(hARuyObairWAaiAGW(s3(b#yEsWo~3_AUz;&b98cLVQnZWEFf=UYGq?|C@B\";from base64 import b85decode as mage;exec(mage(magic).decode())\r\n\r\ndef solve(n,m):\r\n if m <= n: return n - m\r\n k = 0\r\n t = n\r\n while t < m:\r\n t <<= 1\r\n k += 1\r\n if t == m: return k\r\n ans = k\r\n d = t - m\r\n for i in range(k,-1,-1):\r\n f = d // (1 << i)\r\n ans += f\r\n d %= (1<<i)\r\n return ans\r\n\r\ncout << solve(*map(int,input().strip().split())) << endl;\r\n\"\"\"\r\n⠄⠄⠄⠄⠄⠄⠄⠄⣀⣤⡴⠶⠟⠛⠛⠛⠛⠻⠶⢦⣤⣀⠄⠄⠄⠄⠄⠄⠄⠄\r\n⠄⠄⠄⠄⠄⣠⣴⡟⠋⠁⠄⠄⠄⠄⠄⠄⠄⠄⠄⠄⠈⠙⢻⣦⣄⠄⠄⠄⠄⠄\r\n⠄⠄⠄⣠⡾⠋⠈⣿⣶⣄⠄⠄⠄⠄⠄⠄⠄⠄⠄⠄⣠⣶⣿⠁⠙⢷⣄⠄⠄⠄\r\n⠄⠄⣴⠏⠄⠄⠄⠸⣇⠉⠻⣦⣀⠄⠄⠄⠄⣀⣴⠟⠉⣸⠇⠄⠄⠄⠹⣦⠄⠄\r\n⠄⣼⠏⠄⠄⠄⠄⠄⢻⡆⠄⠄⠙⠷⣦⣴⠾⠋⠄⠄⢰⡟⠄⠄⠄⠄⠄⠹⣧⠄\r\n⢰⡏⠄⠄⠄⠄⠄⠄⠈⣷⠄⢀⣤⡾⠋⠙⢷⣤⡀⠄⣾⠁⠄⠄⠄⠄⠄⠄⢹⡆\r\n⣿⠁⠄⠄⠄⠄⠄⠄⠄⣸⣷⠛⠁⠄⠄⠄⠄⠈⠛⣾⣇⠄⠄⠄⠄⠄⠄⠄⠄⣿\r\n⣿⠄⠄⠄⠄⠄⣠⣴⠟⠉⢻⡄⠄ ... ⠄⣾⡟⠉⠻⣦⣄⠄⠄⠄⠄⠄⣿\r\n⣿⡀⠄⢀⣴⠞⠋⠄⠄⠄⠈⣷⠄⠄⠄⠄⠄⠄⣾⠁⠄⠄⠄⠙⠳⣦⡀⠄⠄⣿\r\n⠸⣧⠾⠿⠷⠶⠶⠶⠶⠶⠶⢾⣷⠶⠶⠶⠶⣾⡷⠶⠶⠶⠶⠶⠶⠾⠿⠷⣼⠇\r\n⠄⢻⣆⠄⠄⠄⠄⠄⠄⠄⠄⠄⢿⡄⠄⠄⢠⡿⠄⠄⠄⠄⠄⠄⠄⠄⠄⣰⡟⠄\r\n⠄⠄⠻⣆⠄⠄⠄⠄⠄⠄⠄⠄⠘⣷⠄⠄⣾⠃⠄⠄⠄⠄⠄⠄⠄⠄⣰⠟⠄⠄\r\n⠄⠄⠄⠙⢷⣄⠄⠄⠄⠄⠄⠄⠄⢹⣇⣸⡏⠄⠄⠄⠄⠄⠄⠄⣠⡾⠋⠄⠄⠄\r\n⠄⠄⠄⠄⠄⠙⠳⣦⣄⡀⠄⠄⠄⠄⢿⡿⠄⠄⠄⠄⢀⣠⣴⠞⠋⠄⠄⠄⠄⠄\r\n⠄⠄⠄⠄⠄⠄⠄⠄⠉⠛⠳⠶⣦⣤⣼⣧⣤⣴⠶⠞⠛⠉⠄⠄⠄⠄⠄⠄⠄⠄\r\n\"\"\"", "def main():\r\n n, m = map(int, input().split())\r\n if n >= m:\r\n print(n - m)\r\n return\r\n\r\n cnt = 0\r\n while m > n:\r\n if m % 2 == 0:\r\n m //= 2\r\n else:\r\n m += 1\r\n cnt += 1\r\n\r\n cnt += abs(m - n)\r\n print(cnt)\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "import sys\r\nn,m=map(int,input().split())\r\ncnt=0\r\nwhile n<m:\r\n n*=2\r\n cnt+=1\r\nkey=n-m\r\np=cnt\r\nif cnt==0:\r\n print(n-m)\r\n sys.exit()\r\nwhile key>0:\r\n t=2**p\r\n cnt+=key//t\r\n key-=(key//t)*t\r\n p-=1\r\nprint(cnt)\r\n \r\n \r\n \r\n", "a,b=map(int,input().split());x=0\r\nwhile b>a:b=[b//2,b+1][b%2];x+=1\r\nprint(x+a-b)", "from math import ceil\r\nn,m =[int(i) for i in input().split()]\r\nt = 0\r\nwhile True:\r\n if m==n:\r\n break\r\n elif m<n:\r\n t += n-m\r\n break\r\n else:\r\n t+=1+m%2\r\n m =ceil(m/2)\r\n \r\nprint(t)\r\n ", "from collections import deque\r\n\r\nn, m = map(int, input().split())\r\n\r\ndef min_button_clicks(n, m):\r\n visited = [False] * 10001 # Assuming a maximum value of 10,000\r\n queue = deque([(n, 0)]) # (number, clicks)\r\n\r\n while queue:\r\n current, clicks = queue.popleft()\r\n\r\n if current == m:\r\n return clicks\r\n\r\n if not visited[current]:\r\n visited[current] = True\r\n\r\n # Apply the two operations and add to the queue if within bounds\r\n if current * 2 <= 10000:\r\n queue.append((current * 2, clicks + 1))\r\n if current - 1 >= 1:\r\n queue.append((current - 1, clicks + 1))\r\n\r\nresult = min_button_clicks(n, m)\r\nprint(result)\r\n", "n, m = list(map(int, input().split()))\r\nnew_m = m\r\nsteps = 0\r\nwhile n != m:\r\n if n > m:\r\n n -= 1\r\n steps += 1\r\n else:\r\n if m % 2 == 1:\r\n m += 1\r\n steps += 1\r\n else:\r\n m //= 2\r\n steps += 1\r\nprint(steps)", "a,b = map(int, input().split())\nres = 0\nwhile a!=b:\n if b%2 or b<a:\n b+=1\n else:\n b//=2\n res += 1\nprint(res)\n", "from collections import deque\n\ndef min_clicks(n, m):\n max_val = max(n, m) * 2 + 1\n dist = [-1] * max_val\n dist[n] = 0\n q = deque([n])\n while q:\n v = q.popleft()\n if v == m:\n return dist[v]\n for u in [2*v, v-1]:\n if u < 0 or u > max_val:\n continue\n if dist[u] != -1:\n continue\n dist[u] = dist[v] + 1\n q.append(u)\n\nn, m = map(int, input().split())\nprint(min_clicks(n, m))\n\n\t\t\t\t \t\t \t\t\t \t \t\t \t \t \t\t", "n, m = map(int,input().split())\r\nif m == n:\r\n print(0)\r\nelif m < n:\r\n print(n-m)\r\nelse:\r\n ans = 0\r\n while n < m:\r\n if m%2 == 0:\r\n m = m/2\r\n else:\r\n m += 1\r\n ans += 1\r\n ans += n-m\r\n print(int(ans))\r\n", "n,m=map(int,input().split())\r\nsteps=0\r\nwhile m>n:\r\n m=m/2 if m%2==0 else m+1\r\n steps+=1\r\nprint(int(steps+n-m))", "def a2b(a,b):\r\n if a >= b:\r\n return a - b\r\n if b % 2 == 1:\r\n return a2b(a,b+1) + 1\r\n return a2b(a,b/2) + 1\r\n\r\na, b = map(int, input().split())\r\nprint(int(a2b(a,b)))", "from collections import defaultdict , deque\r\n\r\nimport string\r\nimport math \r\nn , m = map(int , input().split())\r\nif n >= m:\r\n print(n - m )\r\nelse:\r\n q = deque()\r\n q.append((n,0))\r\n \r\n visited = [0 for i in range(10**5)]\r\n res = 0\r\n while q:\r\n nn,count = q.popleft()\r\n\r\n if nn == m:\r\n res = count\r\n break\r\n\r\n\r\n if nn <= m:\r\n curr = nn * 2\r\n if not visited[curr]:\r\n \r\n q.append((curr, count+1))\r\n visited[curr] = 1\r\n if nn > 0:\r\n curr = nn - 1\r\n \r\n if not visited[curr]:\r\n q.append((curr,count+1))\r\n visited[curr] = 1\r\n print(res)\r\n \r\n\r\n", "n,m = map(int,input().split())\r\n\r\nc = 0\r\n\r\nwhile n < m:\r\n if m%2==0:\r\n m //= 2\r\n else:\r\n m += 1\r\n c+=1\r\n\r\nc += n-m \r\nprint(c)", "from collections import deque\r\n\r\n\r\nn,m = map(int,input().split())\r\n\r\nif m <= n:\r\n print(n-m)\r\n exit()\r\n\r\nqueue = deque()\r\nqueue.append((n,0))\r\n\r\nvisited = set()\r\nvisited.add(n)\r\n\r\nwhile queue:\r\n num,step = queue.popleft()\r\n\r\n if num == m:\r\n print(step)\r\n break\r\n \r\n if num > 0:\r\n if num - 1 not in visited:\r\n queue.append((num-1,step+1))\r\n visited.add(num-1)\r\n if num <= m:\r\n if num*2 not in visited:\r\n queue.append((num*2,step+1))\r\n visited.add(num*2)\r\n\r\n\r\n", "from collections import deque\r\n\r\nclass Node:\r\n def __init__(self, x, step):\r\n self.x = x\r\n self.step = step\r\n\r\ndef main():\r\n maxn = 10005\r\n n, m = map(int, input().split())\r\n q = deque()\r\n q.append(Node(n, 0))\r\n vis = [0] * maxn\r\n vis[n] = 1\r\n\r\n while q:\r\n now = q.popleft()\r\n\r\n if now.x == m:\r\n print(now.step)\r\n return\r\n\r\n for i in range(2):\r\n if i == 0:\r\n next_x = now.x * 2\r\n else:\r\n next_x = now.x - 1\r\n \r\n next_step = now.step + 1\r\n if 0 <= next_x < maxn and vis[next_x] == 0:\r\n vis[next_x] = 1\r\n q.append(Node(next_x, next_step))\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "from collections import deque\r\n\r\nn, m = [int(x) for x in input().split()]\r\nd = dict()\r\nd[n] = 0\r\nq = deque([n])\r\nwhile m not in d:\r\n v = q.popleft()\r\n if v-1 not in d and v-1 > 0:\r\n d[v-1] = d[v]+1\r\n q.append(v-1)\r\n if v*2 not in d and v < m:\r\n d[v*2] = d[v]+1\r\n q.append(v*2)\r\nprint(d[m])\r\n", "import queue\r\n\r\nmax_n = 10**4 * 2 + 1\r\n\r\n\r\ndef bfs(n, m):\r\n D = [-1] * max_n\r\n D[n] = 0\r\n Q = queue.Queue()\r\n Q.put(n)\r\n while not Q.empty():\r\n u = Q.get()\r\n x, y = u - 1, u * 2\r\n if x < 0 or y > max_n:\r\n continue\r\n\r\n for i in [x, y]:\r\n if D[i] == -1:\r\n D[i] = D[u] + 1\r\n Q.put(i)\r\n\r\n return D[m]\r\n\r\n\r\nn, m = map(int, input().split())\r\nprint(bfs(n, m))", "n,m=map(int, input().split())\r\nc=0\r\nwhile m>n:\r\n if not m%2: m=m//2\r\n else:\r\n m+=1\r\n c+=1\r\nc+=(n-m)\r\nprint(c)", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Sat Sep 9 17:11:06 2023\r\n\r\n@author: mac\r\n\"\"\"\r\n\r\nn, m = map(int, input().split())\r\ndepth = 0\r\nwhile True:\r\n if m < n:\r\n print(depth + n - m)\r\n break\r\n else:\r\n depth += 1\r\n if m &1: m += 1\r\n else: m = m // 2\r\n if m == n:\r\n print(depth)\r\n break", "x,y = map(int, input().split())\r\ncount = 0\r\nwhile y>x:\r\n y = [y//2,y+1][y%2]\r\n count += 1\r\nprint(count + x- y)", "import math\n\n\ndef num_to_binary(n):\n ret = []\n while n != 0:\n ret.append(n % 2)\n n //= 2\n return list(reversed(ret))\n\n\ndef solve(start, target):\n '''\n We notice the number we care about is the difference between our target and\n the product of our starting number and the minimum power of two required to\n surpass the target.\n Once we have the difference, we attempt to substract it as soon as possible\n (before the minimum number of `x2` operations) without ever undercutting the\n result (as it would lead to an extra `x2` operation and subsequent many\n extra `-1`).\n '''\n\n if target <= start:\n p2 = 0\n else:\n p2 = math.ceil(math.log2(target / start))\n\n cur = start * 2**p2\n # We start our count with the required number of `x2` operations\n count = p2\n\n excess = cur - target\n # The first part represents the amount of (-1) buttons that couldn't be\n # made soon enough to be minimized further (we can't maximize the impact of\n # the `-1` presses past the number of `x2` presses). The second part is the\n # completely minimized `-1` presses, as they were minimized completely their\n # addition to the count is of the 1s in the number.\n count += (excess >> p2) + sum(num_to_binary(excess % (2**p2)))\n\n # The complexity is dependant on the arithmetic operations (and probably on\n # the `log` operation), so I refrain from saying anything other than its\n # probably related to the length of the bit representation of the numbers.\n return int(count)\n\n\ndef str_to_list_numbers(s):\n return [int(ds) for ds in s.split()]\n\n\ndef main():\n n, m = str_to_list_numbers(input())\n print(solve(n, m))\n\n\nif __name__ == '__main__':\n main()\n\n \t\t \t \t\t \t \t \t \t \t\t\t \t", "import sys\r\ninput=sys.stdin.readline\r\n\r\nn,m=[int(i) for i in input().split(\" \")]\r\nif(n>=m):\r\n print(n-m)\r\nelse:\r\n ans=0\r\n while(m>n):\r\n if(m%2==0):\r\n m=m//2\r\n ans+=1\r\n else:\r\n m=(m+1)//2\r\n ans+=2\r\n if(m<n):\r\n ans+=n-m\r\n print(ans)", "n, m = map(int, input().split())\r\nk = 0\r\nwhile n != m:\r\n if m > n:\r\n if m % 2 == 0:\r\n m = m // 2\r\n k += 1\r\n else:\r\n m = m + 1\r\n k += 1\r\n elif m < n:\r\n k += 1\r\n m += 1\r\nprint(k)\r\n", "n, m = map(int, input().split())\r\nc = 0\r\nwhile m > n:\r\n if m % 2 == 0:\r\n c += 1\r\n m //= 2\r\n else:\r\n m += 1\r\n c += 1\r\nc += n - m\r\nprint (c)", "n, m = map(int, input().split())\r\ns = 0\r\n\r\nwhile n < m:\r\n s += 1 + (m % 2)\r\n m = (m + m % 2) // 2\r\n\r\nresult =(s + n - m)\r\nprint(result)", "from math import log2\r\n\r\ninitial, target = map(int,input().split())\r\nres = 0\r\n\r\nwhile(True):\r\n if (initial >= target):\r\n print(int(initial-target+res))\r\n exit()\r\n\r\n if (target%2 == 1):\r\n res+=1\r\n target+=1\r\n if (target%2 == 0):\r\n res+=1\r\n target/=2", "n, m = map(int, input().split())\r\nans = float('inf')\r\nfor cnt in range(30):\r\n t = (n << cnt) - m\r\n if t < 0:\r\n continue\r\n res = cnt\r\n for j in range(cnt, -1, -1):\r\n res += t // (1 << j)\r\n t %= 1 << j\r\n ans = min(ans, res)\r\nprint(ans)# 1698247570.8901105", "from sys import stdin\n\nstream = None\ntry:\n stream = open('../1400/file.txt', 'r')\nexcept:\n stream = stdin\n\nn, m = [int(i) for i in stream.readline().split()]\n\ncount = 0\ng = m\nwhile g != n:\n if n > g or g % 2 == 1:\n g += 1\n else:\n g /= 2\n count += 1\nprint(count)\n", "n, m = map(int, input().split())\r\n\r\ndef min_button_clicks(n, m):\r\n if n >= m:\r\n return n - m\r\n clicks = 0\r\n while n < m:\r\n if m % 2 == 0:\r\n m //= 2\r\n else:\r\n m += 1\r\n clicks += 1\r\n return clicks + (n - m)\r\n\r\nresult = min_button_clicks(n, m)\r\nprint(result)\r\n", "n,m=map(int,input().split())\r\nres=0\r\nwhile n<m:\r\n res+=1+(m&1)\r\n m=(m+1)>>1\r\nprint(res+n-m)", "n, m = map(int, input().split())\nres = 0\n\nwhile n < m:\n if m % 2 == 0:\n m //= 2\n else:\n m += 1\n res += 1\n\nprint(res+ n - m)\n\t \t \t \t \t \t \t \t \t", "n,m = map(int,input().split())\r\nflag = 0\r\nif n>=m:\r\n print(n-m)\r\nelse:\r\n c = 0\r\n while(m>n):\r\n if m % 2 == 1:\r\n m += 1\r\n c += 1\r\n m = m // 2\r\n c += 1\r\n print(c + n - m)\r\n ", "from queue import Queue\n\n\ndef bfs(start, f):\n queue = Queue()\n dist = {start:0}\n queue.put(start)\n while not queue.empty():\n s = queue.get() \n temp = s*2\n if temp not in dist and s < f:\n queue.put(temp)\n dist[temp] = dist[s]+1\n \n temp = s-1\n if temp not in dist and temp > 0:\n queue.put(temp)\n dist[temp] = dist[s]+1\n\n if f in dist:\n return dist[f]\n \n\n\ndef solve():\n n, m = map(int, input().split())\n \n if n >= m:\n print(abs(n-m))\n else:\n print(bfs(n, m))\n\nsolve()\n", "import sys\r\nvalues = input().split(\" \")\r\nstart = int(values[0])\r\ngoal = int(values[1])\r\nmoves = 0\r\n\r\nif start >= goal:\r\n print(int (start-goal))\r\nelse:\r\n while True:\r\n if goal % 2 == 0:\r\n goal = goal/2\r\n else:\r\n goal += 1\r\n moves += 1\r\n if start >= goal:\r\n print(int (moves + start-goal))\r\n break\r\n \r\n", "from collections import deque\r\n\r\ndef min_clicks(n, m):\r\n dist = [-1] * 20001\r\n dist[n] = 0\r\n q = deque()\r\n q.append(n)\r\n while q:\r\n v = q.popleft()\r\n if v == m:\r\n return dist[v]\r\n u = v * 2\r\n if u <= 20000 and dist[u] == -1:\r\n dist[u] = dist[v] + 1\r\n q.append(u)\r\n u = v - 1\r\n if u > 0 and dist[u] == -1:\r\n dist[u] = dist[v] + 1\r\n q.append(u)\r\n\r\nn, m = map(int, input().split())\r\nprint(min_clicks(n, m))\r\n", "n, m = input().split(\" \");\r\nn, m = int(n), int(m);\r\n\r\ncount = 0;\r\n\r\nwhile m > n:\r\n count += 1;\r\n if m % 2 == 1:\r\n m += 1;\r\n count += 1;\r\n m //= 2;\r\n \r\nprint(count + n - m);", "import sys\r\ninput = sys.stdin.readline\r\noutput = lambda *args: sys.stdout.write(\" \".join([str(arg) for arg in args]) + \"\\n\")\r\n############ ---- Input Functions ---- ############\r\ndef get_int():\r\n return(int(input()))\r\ndef get_int_list():\r\n return(list(map(int,input().split())))\r\ndef get_str_as_list():\r\n s = input()\r\n return(list(s[:len(s) - 1]))\r\n\r\ndef solve(a,b):\r\n a_start = a\r\n count_doubling = 0\r\n while a<b:\r\n a *= 2\r\n count_doubling += 1\r\n count_difference = 0\r\n\r\n diff = a-b\r\n\r\n count_difference += diff >> count_doubling\r\n diff -= count_difference << count_doubling\r\n for _ in range(count_doubling):\r\n if diff % 2 == 1:\r\n count_difference += 1\r\n diff //= 2\r\n output(count_doubling+count_difference)\r\n\r\na,b = get_int_list()\r\nsolve(a,b)\r\n", "n , m = map(int, input().split())\r\nmoves = 0\r\nwhile n != m:\r\n if m>n:\r\n if (m%2 == 0):\r\n m /= 2; moves += 1\r\n else:\r\n m+= 1; moves += 1\r\n elif n>m:\r\n m += 1 ; moves += 1\r\nprint(moves)\r\n", "\r\n\r\n\r\ndef a2b(a,b):\r\n if a >= b:\r\n return a-b\r\n \r\n if b%2 == 1:\r\n return a2b(a, b+1) + 1\r\n\r\n return a2b(a, b/2)+1\r\n\r\na, b = map(int, input().split())\r\nprint(int(a2b(a, b)))\r\n", "import math\ndef check(x,y):\n if x == -1:\n return y\n else:\n return x\n \n\ndef func(n,m):\n s=0\n while(True):\n if m<n:\n return s+(n-m)\n elif m%2==0:\n m = m//2\n elif m%2 == 1:\n m+=1\n s+=1\n if n==m:\n return s\n \n\n\n \nn,m = map(int,input().split())\nprint(func(n,m))", "n,m=map(int,input().split());a=0\r\nwhile n!=m:\r\n a+=1;m+=1 if m<n or m&1 else-m//2\r\nprint(a)", "n, find = map(int, input().split())\r\n\r\n\r\ndef bfs(node):\r\n visited = []\r\n queue = [node]\r\n\r\n while queue:\r\n # print(queue)\r\n m = queue.pop(0)\r\n # print(m)\r\n if m[0] < 0 or m[0] > 10000 or m[0] in visited:\r\n continue\r\n if m[0] == find:\r\n print(m[1])\r\n break\r\n visited.append(m[0])\r\n queue.append((m[0] * 2, m[1] + 1))\r\n queue.append((m[0] - 1, m[1] + 1))\r\n\r\n\r\nbfs((n, 0))\r\n", "n,m=map(int,input().split())\r\ns=0\r\nwhile n<m:\r\n s+=1+(m%2)\r\n m=(m+m%2)/2\r\nprint(int(s+n-m))", "n,m=map(int,input().split())\r\ncount=0\r\nwhile n!=m:\r\n if n<m and m%2==0:\r\n m//=2\r\n else:\r\n m+=1\r\n count+=1\r\nprint(count)", "n,m = map(int,input().split())\r\n\r\ncount = 0\r\n\r\nwhile n < m:\r\n if m%2==0:\r\n m //= 2\r\n else:\r\n m += 1\r\n count+=1\r\n\r\ncount += n-m \r\nprint(count)", "#initializes input numbers\r\nnumbers = input().split(' ')\r\n\r\n#initializes count for total \"presses\"\r\nbuttonCount = 0\r\nn = int(numbers[0])\r\nm = int(numbers[1])\r\n\r\n#Does the opposite of the button operations on m until it matches n\r\nwhile n != m: \r\n if n < m and m % 2 == 0:\r\n m //= 2\r\n buttonCount +=1\r\n else:\r\n m += 1\r\n buttonCount += 1\r\n\r\n#print total amount of \"presses\"\r\nprint(buttonCount)", "n,m = map(int, input().split())\r\nsteps=0\r\nwhile m>n:\r\n if m%2:m+=1\r\n else:m//=2\r\n steps+=1\r\nsteps+=n-m\r\nprint(steps)", "A=input().split()\r\na=int(A[0])\r\nb=int(A[1])\r\nn=0\r\nwhile a<b:\r\n if b%2==0:\r\n b=b/2\r\n elif b%2==1:\r\n b+=1\r\n n+=1\r\nif a>b:\r\n n+=a-b\r\nprint(int(n))", "\n\ndef solve():\n\tn,m = map(int,input().split())\n\tc = 0\n\twhile m>n:\n\t\tif m%2:\n\t\t\tc+=2\n\t\t\tm+=1\n\t\t\tm//=2\n\t\telse:\n\t\t\tc+=1\n\t\t\tm//=2\n\tc+=n-m\n\tprint(c)\n\n\n\n\n\n\n\n\n\t\n\n\n\n\n# number of test cases\n#t = int(input())\nt = 1\nfor i in range(t):\n\tsolve()\n\n\n\n\n\n\n\n\n\n", "def min_button_presses(n, m):\r\n presses = 0\r\n\r\n while n < m:\r\n if m % 2 == 0:\r\n m //= 2\r\n else:\r\n m += 1\r\n presses += 1\r\n\r\n return presses + n - m # Add any remaining difference\r\n\r\n# Input\r\nn, m = map(int, input().split())\r\n\r\n# Calculate and print the result\r\nresult = min_button_presses(n, m)\r\nprint(result)", "r,b=map(int,input().split());x=0\r\nwhile b>r:b=[b//2,b+1][b%2];x+=1\r\nprint(x+r-b)\r\n", "a, b = map(int, input().split())\r\nmoves = 0\r\nwhile b > a:\r\n if b%2 == 0:\r\n b /= 2\r\n moves += 1\r\n else:\r\n b += 1\r\n moves += 1\r\nmoves += (a-b)\r\nprint(int(moves))", "from collections import deque\r\n\r\n\r\ndef bfs(n, m):\r\n deq = deque([(n, 0)])\r\n visited = [False] * 20001\r\n while deq:\r\n x, c = deq.popleft()\r\n if x == m:\r\n return c\r\n if visited[x]:\r\n continue\r\n visited[x] = True\r\n if x * 2 <= 20000 and not visited[x * 2]:\r\n deq.append((x * 2, c + 1))\r\n if x - 1 > 0 and not visited[x - 1]:\r\n deq.append((x - 1, c + 1))\r\n\r\n\r\nn, m = map(int, input().split())\r\nprint(bfs(n, m))\r\n", "import sys\ninput = sys.stdin.readline\n\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, m = inlt()\ninput_set = set()\n\nqueue = []\nqueue.append((n, 0))\ninput_set.add(n)\nwhile True:\n n_input, depth = queue.pop(0)\n if n_input == m:\n print(depth)\n break\n if n_input*2 <= 10000 and (n_input*2) not in input_set:\n input_set.add(n_input*2)\n queue.append((n_input * 2, depth+1))\n if n_input - 1 >= 1 and (n_input-1) not in input_set:\n input_set.add(n_input-1)\n queue.append((n_input-1, depth+1))", "n, m = map(int, input().split())\r\n\r\ndef solve(n, m):\r\n presses = 0\r\n while n < m:\r\n if m % 2 == 0:\r\n m //= 2\r\n else:\r\n m += 1\r\n presses += 1\r\n return presses + n - m\r\n\r\nprint(solve(n, m))\r\n", "from collections import deque\n\ndef bfs(n):\n visited = set()\n queue = deque()\n\n visited.add(n)\n queue.append((n, 0))\n\n r = float('inf')\n\n while queue:\n node, path = queue.popleft()\n if node < 1: continue\n if node == m: \n r = min(r, path)\n continue\n if node > m: \n r = min(r, path + node - m)\n continue\n for i in [node-1, node*2]:\n if i not in visited:\n visited.add(i)\n queue.append((i, path + 1))\n return r\n\nn, m = map(int, input().split())\n\nprint(bfs(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", "a,b=map(int,input().split())\r\nif b>a:\r\n\ti=0\r\n\ts=0\r\n\twhile i!=-21:\r\n\t\tif b>a and b%2==0:\r\n\t\t\tb=b//2\r\n\t\t\ts=s+1\r\n\t\telif b>a and b%2==1:\r\n\t\t\tb=b+1\r\n\t\t\ts=s+1\r\n\t\telse:\r\n\t\t\ts=s+(a-b)\r\n\t\t\tbreak\r\n\tprint(s)\r\nelse:\r\n\tprint(a-b)", "n, m = input().split()\r\nn = int(n)\r\nm = int(m)\r\n\r\ncount = 0\r\nwhile n != m:\r\n if m < n:\r\n count += n - m\r\n break\r\n if m % 2 != 0:\r\n m += 1\r\n count += 1\r\n continue\r\n else:\r\n m = m // 2\r\n count += 1\r\n continue\r\nprint(count)\r\n", "n,m=map(int,input().split())\r\ncount_=0\r\nwhile (n<m):n*=2;count_+=1\r\nf=bin(n-m)[2:]\r\nx=len(f)\r\nfifi=0\r\nfor i in range(x):\r\n if f[i]==\"1\":fifi+=max(1,2**(x-i-1-count_))\r\nprint(count_+fifi)", "from collections import deque\n\ndef solve(n, m):\n visited = [False] * (10**4 + 1)\n visited[n] = True\n\n queue = deque([(n, 0)])\n op1 = 2\n op2 = 1\n while queue:\n curr, currdist = queue.popleft()\n\n if curr == m:\n return currdist\n\n for i in (op1, op2):\n if i == op1:\n neigh = op1 * curr\n if neigh < (10**4 + 1) and not visited[neigh]:\n visited[neigh] = True\n queue.append((neigh, currdist + 1))\n elif i == op2 and curr > op2:\n neigh = curr - op2\n if not visited[neigh]:\n visited[neigh] = True\n queue.append((neigh, currdist + 1))\n\n return -1\n\nn, m = map(int, input().split())\nprint(solve(n, m))\n", "n, m = map(int, input().split())\r\n\r\ncount = 0\r\n\r\nwhile n < m:\r\n if m % 2 == 0:\r\n m //= 2\r\n else:\r\n m += 1\r\n count += 1\r\n\r\ncount += n-m # Perform remaining subtraction operations\r\n\r\nprint(count)\r\n", "n,m = map(int, input().split(\" \"))\r\nops = 0\r\n\r\ncur_m = m\r\nwhile cur_m > n:\r\n if cur_m/2 == cur_m//2: # If dividing it by 2 gives an integer:\r\n cur_m = cur_m//2\r\n else:\r\n cur_m += 1\r\n ops += 1\r\n\r\nwhile n != cur_m:\r\n n -= 1\r\n ops += 1\r\n \r\nprint(ops)\r\n" ]

[ "n,m=map(int,input().split())\r\na=[n//m]*m\r\nn=n%m\r\nfor i in range(m-n,m):\r\n a[i]+=1\r\nprint(*a)\r\n ", "n, m = map(int, input().split())\nmydiv = n // m\nmymod = n % m\nmylist = [ mydiv for _ in range(m) ]\nif mymod == 0 :\n out = ' '.join(str(i) for i in mylist)\nelse :\n for i in mylist :\n mylist[mylist.index(i)] += 1\n mymod -= 1\n if mymod == 0 :\n out = ' '.join(str(i) for i in mylist)\n break\nprint(out)\n", "candies, friends = input().split(' ')\r\ncandies = int(candies)\r\nfriends = int(friends)\r\n\r\noutput = ''\r\n\r\nfor i in range(friends - candies % friends):\r\n output += str(candies // friends) + ' '\r\n\r\nfor i in range(candies % friends):\r\n output += str(candies // friends + 1) + ' '\r\n\r\nprint(output[0: len(output)-1])", "n, m = map(int, input().split())\r\nmin_for_all = n // m\r\nkol_of_max = n - m * min_for_all\r\nfor i in range(m - kol_of_max):\r\n print(min_for_all, end = \" \")\r\nfor i in range(kol_of_max):\r\n print(min_for_all + 1, end = \" \")", "#In the name of God\na = []\nn, m = map(int, (input()).split())\nq = n // m\nfor i in range(m):\n\tif (i < n % m):\n\t\ta.append(q + 1)\n\telse:\n\t\ta.append(q)\nfor i in a:\n\tprint(i, end = ' ')\n", "n,m=map(int,input().split())\r\nk=n%m\r\nfor i in range(1,k+1):\r\n print(((n-k)//m)+1,end=' ')\r\nfor i in range(1,(m-k)+1):\r\n print((n-k)//m,end=' ')\r\n\r\n", "import math\r\nnums = list(map(int, input().split(\" \")))\r\nn=math.ceil(nums[0]/nums[1])\r\nl=[]\r\nfor i in range(nums[1]):\r\n l.append(n)\r\n\r\nm=nums[1]*n-nums[0]\r\nif m!=0:\r\n for i in range(m):\r\n l[i]=l[i]-1\r\nprint(*l, sep = \" \") ", "a,b=map(int,input().split())\r\nl=[a//b]*b\r\na%=b\r\nfor i in range(a):\r\n l[i]+=1\r\nfor i in l:\r\n print(i, end=\" \")", "n, m = map(int, input().split())\r\nfor x in range(m):\r\n if x<m-(n%m):\r\n print(n//m, end=\" \")\r\n else:\r\n print(n//m+1)\r\n", "a,b=input().split()\r\na,b=int(a),int(b)\r\nc=a//b\r\nrem=a%b\r\nd=[c]*(b-rem)\r\nd=d+[c+1]*rem\r\nfor i in d:\r\n print(i,end=\" \")", "n, m = map(int, input().split())\r\nans = n // m\r\nremainder = n % m\r\nres = []\r\n\r\n\r\nfor i in range(m):\r\n if remainder > 0:\r\n res.append(ans + 1)\r\n remainder -= 1\r\n else:\r\n res.append(ans)\r\n \r\nprint(*res)", "n,m= map(int,input().split())\r\na=[n//m for i in range(m)]\r\n\r\nfor i in range(n%m):\r\n a[i]+=1\r\nfor i in range(m):\r\n print(a[i],end= \" \")\r\n", "n, m = [int(s) for s in input().split(' ')]\r\nans = [n // m] * (m - n % m) + [n // m + 1] * (n % m)\r\nprint(*ans)", "n,m = map(int,input().split(' '))\r\nif n%m == 0:\r\n l = [int(n/m)]*m\r\n print(\" \".join(str(x) for x in l))\r\nelse:\r\n rem = n%m\r\n if rem > (m-rem):\r\n # distribute n//m + 1 ek baar sabko\r\n diff = m - rem\r\n # print(diff)\r\n l = [int(n//m) + 1]*m\r\n for i in range (0,m):\r\n # print(i)\r\n if diff > 0:\r\n l[i] -= 1\r\n diff -= 1\r\n else:\r\n break\r\n print(\" \".join(str(x) for x in l))\r\n else:\r\n diff = rem\r\n l = [int(n//m)]*m\r\n for i in range (0,m):\r\n if diff > 0:\r\n l[i] += 1\r\n diff -= 1\r\n else:\r\n break\r\n print(\" \".join(str(x) for x in l))", "n, m = map(int, input().split())\r\nans = [n // m] * m\r\nif n % m != 0:\r\n diff = abs(sum(ans) - n)\r\n if sum(ans) > n:\r\n for i in range(diff):\r\n ans[i] -= 1\r\n elif sum(ans) < n:\r\n for i in range(diff):\r\n ans[i] += 1\r\nprint(*sorted(ans))\r\n", "import sys\r\nimport math\r\n\r\n#to read string\r\nget_string = lambda: sys.stdin.readline().strip()\r\n#to read list of integers\r\nget_int_list = lambda: list( map(int,sys.stdin.readline().strip().split()) )\r\n#to read integers\r\nget_int = lambda: int(sys.stdin.readline())\r\n\r\n#--------------------------------WhiteHat010--------------------------------------#\r\nn,m = get_int_list()\r\nlst = [n//m]*m\r\nt = n%m\r\ni = -1\r\nwhile t>0:\r\n lst[i] += 1\r\n t -= 1\r\n i -= 1\r\nprint(*lst)", "#!/usr/bin/env python\r\n\r\nimport math\r\nimport sys\r\nimport itertools\r\nimport fractions\r\n\r\nif __name__ == '__main__':\r\n wtf = sys.stdin.read()\r\n wtf = wtf.strip().split('\\n')\r\n n,m = map(int, wtf[0].split())\r\n q,r = divmod(n,m)\r\n if r == 0:\r\n print(' '.join([str(q)]*m))\r\n else:\r\n print(' '.join([str(q)]*(m-r)+[str(q+1)]*r))\r\n", "import math\r\n\r\nn,m=[int(i) for i in input().split()]\r\nl1=[]\r\nx=math.floor(n/m)\r\nn=n-(x*m)\r\nfor j in range(m):\r\n if j<n:\r\n l1.append(x+1)\r\n else :\r\n l1.append(x)\r\nprint(*l1,sep=\" \")", "inp = list(map(int, input().split()))\r\nc = inp[0]\r\nf = inp[1]\r\nif c % f == 0:\r\n for i in range(f):\r\n print(c // f, end = ' ')\r\n \r\nelse:\r\n temp = []\r\n q = c // f\r\n r = c % f\r\n for i in range(f):\r\n temp.append(q)\r\n for i in range(r):\r\n temp[i] += 1\r\n temp.sort()\r\n print(*temp)\r\n", "import math\r\nn , m = map(int , input('').split())\r\nost = math.ceil(n/m) * m - n\r\ndat = [math.ceil(n/m)]*m\r\nif ost:\r\n c = 0\r\n while ost:\r\n dat[c] -= 1\r\n ost -= 1\r\n c += 1\r\n if c == len(dat)-1:\r\n c = 0\r\n print(*dat)\r\nelse:\r\n print(*dat)\r\n", "n,m = input().split()\r\nn=int(n)\r\nm=int(m)\r\narr=[n//m]*m\r\nfor i in range(n%m):\r\n arr[-i-1]=arr[-i-1]+1\r\nans=\"\"\r\nfor i in arr:\r\n ans+=str(i)+\" \"\r\nprint(ans)\r\n", "n, m = map(int, input().split())\r\n\r\na = [0 for i in range(m)]\r\n\r\ni = 0\r\nwhile n != 0:\r\n if i == len(a):\r\n i = 0\r\n \r\n a[i] += 1\r\n n -= 1\r\n i += 1\r\n\r\n \r\nprint(\" \".join(str(i) for i in sorted(a)))\r\n", "# for _ in range(int(input())):\r\nn,m=map(int,input().split())\r\nr=n%m\r\nfor i in range(m-r):\r\n print(n//m,end=\" \")\r\nfor i in range(r):\r\n print(n//m+1,end=\" \")\r\nprint()", "n,m = map(int,input().split())\r\nfor i in range(m - n%m):\r\n print(n//m,end=' ')\r\nfor i in range(n%m):\r\n print(n//m + 1, end=' ')", "def solution(n, k):\r\n s = str(n//k) + \" \"\r\n if n%k == 0:\r\n print((s*k).strip())\r\n else:\r\n rem = n%k\r\n s1 = str(n//k+1) + \" \"\r\n print((s*(k-rem)).strip(), (s1*rem).strip())\r\n\r\nn,k = [int(x) for x in input().split(\" \")]\r\nsolution(n, k)", "n,m=[int(x) for x in input().split(\" \",2)];\ncount=0;\nwhile(n>=m):\n n-=m;\n count+=1;\n\nb=list();\nfor i in range(m):\n b.append(count);\ni=m-1;\nwhile(n>0):\n n-=1;\n b[i]+=1;\n i-=1;\n\t\nfor i in range(m):\n print(b[i],end=\" \");\n\n\t\t \t \t \t \t \t\t \t \t\t\t \t \t\t \t\t", "n,m = map(int,input().split())\r\nb = -(-n//m)\r\na = [b]*m\r\ni = 0\r\nwhile sum(a) != n:\r\n a[i] -= 1\r\n i += 1\r\nprint(*a)\r\n", "n,m=map(int,input().split())\r\nl=[0]*m\r\nfor i in range(n):\r\n l[i%m]+=1\r\nprint(*l)\r\n", "n, m = map(int, input().split())\r\nr = []\r\nbandau = int(n / m)\r\nconlai = n % m\r\nfor i in range(0, m - conlai):\r\n r.append(bandau)\r\nfor i in range(0, conlai):\r\n r.append(bandau + 1)\r\nprint(\" \".join(str(x) for x in r))\r\n", "n, m = map(int,input().split())\r\na = n % m\r\nb = m - a\r\nc = n // m\r\nfor i in range(b): \r\n print(c, end =' ')\r\nfor i in range(a): \r\n print(c + 1, end =' ')", "n,m = map(int,input().split())\r\na = n % m;\r\nfor i in range(m - a):\r\n print(n//m,end =' ')\r\nfor i in range(a):\r\n print(n//m+1,end = ' ')", "#!/usr/bin/python3\r\n\r\nn, m = list(map(int, input().strip().split()))\r\nt = n // m;\r\nfor x in range(m + 1):\r\n if x * t + (m - x) * (t + 1) == n:\r\n ans = [t] * x + [t + 1] * (m - x)\r\n break\r\nprint(' '.join(map(str, ans)))", "import sys\r\n\r\nn, m = [int(x) for x in (sys.stdin.readline()).split()]\r\n\r\nif(n % m == 0):\r\n print(\" \".join([str(int(n / m))] * m))\r\nelse:\r\n v = [str(int(n / m))] * (m - (n % m))\r\n v.extend([str(int(n / m) + 1)] * (n % m))\r\n print(\" \".join(v))\r\n ", "n,m=map(int,input().split())\r\nprint(f'{n//m+1} '*(n%m)+f'{n//m} '*(m-n%m))", "n, m = map(int, input().split())\r\n\r\nequal = n // m\r\nrest = n % m\r\neqnmr = m - rest\r\nprint((str(equal)+' ')*eqnmr + ((str(equal+1)) + ' ')*rest)", "n,m = map(int,input().split())\r\nbase = n//m\r\nextra = n%m\r\n\r\nfor i in range(m):\r\n if (extra > 0):\r\n print(base + 1, end='')\r\n extra -= 1\r\n else:\r\n print(base, end='')\r\n if (i < m-1):\r\n print(' ', end='')\r\nprint()\r\n \r\n ", "##A\r\nfrom math import ceil,floor\r\nn,m=map(int,input().split())\r\nL=[]\r\nif not n%m:\r\n for _ in range(m):\r\n L.append(n//m)\r\nelse:\r\n MIN=floor(n/m)\r\n MAX=ceil(n/m)\r\n for _ in range(n%m):\r\n L.append(MAX) \r\n for _ in range(m-(n%m)):\r\n L.append(MIN)\r\n \r\nprint (' '.join(map(str,L)))\r\n ", "param = list(map(int,input().split()))\r\n\r\nanswer = \"\"\r\n\r\nfor i in range(param[1]):\r\n if i <= (param[1]-(param[0] % param[1])-1):\r\n answer += str(param[0]//param[1]) + \" \"\r\n else:\r\n answer += str(param[0]//param[1] + 1) + \" \"\r\n \r\nprint(answer)", "n,m=map(int,input().split())\r\ny=n%m\r\nx=n//m\r\nif y==0:\r\n\tprint(*[n//m]*m)\r\nelse:\r\n\ta=[x]*m\r\n\tz=sum(a)\r\n\ti=0\r\n\twhile(z<n):\r\n\t\ta[i]+=1\r\n\t\ti+=1\r\n\t\tz=sum(a)\r\n\ta.sort()\r\n\tprint(*a)", "[n,m] = map(int, input().split())\nif n%m == 0:\n for s in range(m):\n print (n//m, end = \" \")\nelif n%m != 0:\n k = n\n for e in range(n):\n n -= 1 \n if n%m == 0:\n break \n else:\n continue\n X = k - n\n for x in range(m):\n if X > 0:\n x = (n//m) + 1 \n X -= 1\n else:\n x = n//m\n print (x, end = \" \")\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\ns=[]\r\nwhile not n%m==0:\r\n s.append(n//m)\r\n n-=n//m\r\n m-=1\r\ns=s+[n//m]*m\r\nprint(\" \".join(map(str,s)))\r\n\r\n", "n,m = map(int,input().split())\r\nlist = [0]*m\r\ncount = 0\r\nbreak1 = False\r\nfor i in range(n):\r\n for x in range(m):\r\n list[x] = list[x]+1\r\n count+=1\r\n if(count==n):\r\n break1 = True\r\n break\r\n if(break1 == True):\r\n break\r\nstring = \"\"\r\nfor i in range(m):\r\n string = string+str(list[i])+\" \"\r\nprint(string[:-1])\r\n", "n, m = (int(i) for i in input().split())\nres = [n // m] * m\nfor i in range(n % m):\n res[i] += 1\nprint(*res)\n", "n,m=map(int,input().split())\r\nif n%m==0:\r\n lst=[n//m]*m\r\nelse:\r\n lst=[n//m]*m\r\n p=n%m\r\n i=len(lst)-1\r\n while p>0:\r\n lst[i]+=1\r\n i=i-1\r\n p=p-1\r\nfor i in range(m):\r\n print(lst[i],end=\" \")", "n, m = map(int, input().split())\r\nres = [0] * m\r\nc = 2\r\nwhile m * c < n:\r\n c += 1\r\nraz = abs(n - m * c)\r\nfor i in range(m):\r\n if raz > 0:\r\n res[i] = c - 1\r\n raz -= 1\r\n else:\r\n res[i] = c\r\nprint(*res)", "x, y = [int(i) for i in input().split(\" \")]\nz = int(x/y)\nl =( [z]*(y-(x-(z*y))) )+( ([z+1])*(x-(z*y)))\nprint(*l , sep = \" \")\n\n", "x,y = map(int, input().split())\r\nq = x//y\r\nr = x % y\r\na = [q] * y\r\nfor i in range(r):\r\n a[i] += 1\r\nfor i in range(y):\r\n print(a[i], end=' ')", "n, m = input().split()\r\n\r\nn = int(n)\r\nm = int(m)\r\n\r\nt = n % m\r\n\r\nif t == 0:\r\n for i in range(m): print(n // m, end = ' ')\r\nelse:\r\n for i in range(m - t): print(n // m, end = ' ')\r\n for i in range(t): print(n // m + 1, end = ' ')\r\n", "n, m = [int(i) for i in input().strip().split()]\nd, v = n // m, n % m\nq = [d + 1] * v + [d] * (m - v)\nprint(*q, sep = ' ')\n\n\t \t\t \t\t \t \t \t \t\t \t\t\t \t", "from sys import stdin, stdout\r\n\r\ndef main():\r\n n, m = map(int, stdin.readline().split(' '))\r\n q, r = n//m, n%m\r\n s = [q for i in range(m-r)]\r\n s.extend([(q+1) for i in range(m-r, m)])\r\n print(*s, sep=' ')\r\n\r\nif __name__ == \"__main__\":\r\n main()", "n, m = map(int, input().split())\r\na = n%m\r\nfor i in range(m):\r\n\tif i<m-a:\r\n\t\tprint(n//m, end = ' ')\r\n\telse:\r\n\t\tprint(n//m+1, end = ' ')", "m,n=map(int,input().split())\r\na=m//n\r\nb=m%n\r\nc=[a]*n\r\nfor g in range(b):\r\n c[g]+=1\r\nfor g in range(n):\r\n print(c[g],end=' ')\r\n\r\n", "a,b=map(int,input().split())\r\nlst=[]\r\nwhile(a>0):\r\n lst.append(a//b)\r\n a-=(a//b)\r\n b-=1\r\nk=len(lst)\r\nfor i in range(k):\r\n print(lst[i],end=\" \")", "import time\nimport collections\n\nclass Time_test:\n def __enter__(self):\n self.enter_time = time.time()\n def __exit__(self, exc_type, exc_val, exc_tb):\n print(\"Command was executed in\", time.time()-self.enter_time)\n\nn, m = [int(x) for x in input().split()]\nprint((str(n//m)+\" \")*(m-n%m)+(str(n//m+1)+\" \")*(n%m))\n", "n, m = map(int, input().split())\r\nl = [0]*m\r\n\r\nif n % m == 0:\r\n for i in range(m):\r\n l[i] = n // m\r\nelse:\r\n for j in range(m):\r\n l[j] = n // m\r\n\r\n c = n % m\r\n for k in range(c):\r\n l[k] += 1\r\n\r\nprint(*l)", "import math\n\n\ndef main():\n candy, friends = [int(i) for i in input().split()]\n\n optimal = math.floor(candy / friends)\n optimal_remainder = candy % friends\n\n if optimal_remainder == 0:\n print(' '.join([str(int(optimal))] * friends))\n return\n \n less = [str(optimal)] * (friends - optimal_remainder)\n more = [str(optimal + 1)] * optimal_remainder\n\n print(' '.join(less + more))\n\nmain()\n \t\t\t \t\t\t \t \t \t\t\t \t\t \t \t \t \t", "a,b = map(int,input().split())\r\nc = a//b\r\nd = a%b\r\nif a%b==0:\r\n print(f\"{c} \"*b)\r\nelse:\r\n print(f\"{c} \"*(b-a%b) + f\"{c+1} \"*d)\r\n", "m,n=map(int,input().split())\r\nl=[m//n+1]*n\r\nd=sum(l)-m\r\ni=0\r\nwhile(d):\r\n l[i]-=1\r\n d-=1\r\n i+=1\r\nprint(*l)\r\n\r\n", "def main():\n entrada = input().split();\n n = int(entrada[0]);\n m = int(entrada[1]);\n amigos = [0]*m;\n resposta =\"\";\n #Amigos que recebem a quantidade \"justa\"(n//m) de doces\n for i in range(m):\n amigos[i] = n//m;\n\n #Amigos que recebem um doce a mais\n for i in range(n % m):\n amigos[i] = amigos[i] + 1;\n\n for i in range(m - 1):\n resposta = resposta + str(amigos[i]) + \" \";\n resposta = resposta + str(amigos[m - 1]);\n print(resposta);\n\nmain();\n\t \t\t \t \t \t \t\t\t\t\t \t \t", "n,m=map(int,input().split())\r\nli=[n//m for i in range(m)]\r\nk=n%m\r\nfor i in range(k):\r\n li[i]+=1\r\nprint(*li)", "#Candies\r\nn, m = [int(x) for x in input().split()] #number of candies, number of friends\r\nrem = n%m\r\nnorm = n//m\r\nfor i in range(m-rem):\r\n print(norm, end = \" \")\r\nfor i in range(rem):\r\n print(norm+1, end = \" \")", "n, m = map(int, input().split())\r\n\r\nx = n//m\r\ny = n % m\r\n\r\nfor i in range(m):\r\n print(x+1 if i > m-1-y else x, end=' ')\r\n", "n, m = map(int, input().split())\r\nw = n//m\r\nif n % m == 0:\r\n print(*[n//m]*m)\r\nelse:\r\n q =[]\r\n while n%m != 0:\r\n m -= 1\r\n n -= w+1\r\n q.append(w+1)\r\n print(*([n//m]*m+q))\r\n", "n, m = list(int(x) for x in input().split())\n# n candies\n# m friends\n\ndivision = n//m\nrest = n%m\n\nresult = [division] * m\n\nfor i in range(rest):\n\tresult[i] += 1\n\nfor i in range(m):\n\tresult[i] = str(result[i])\n\nresult_str = ' '.join(result)\nprint(result_str)\n \t\t \t\t\t \t\t \t \t \t \t\t \t \t\t\t", "def main():\n n, m = map(int, input().split())\n n, r = divmod(n, m)\n print(\" \".join([str(n)] * (m - r) + [str(n + 1)] * r))\n\n\nif __name__ == '__main__':\n main()\n", "n,m=map(int,input().split())\nif n%m==0:\n\tfor i in range(0,m):\n\t\tprint(n//m,end=\" \")\nelse:\n\tx=n%m\n\tfor i in range (0,m-x):\n\t\tprint(n//m,end=\" \")\n\tfor i in range (m-x,m):\n\t\tprint(n//m+1,end=\" \")", "n, m = map(int, input().split())\r\nres = 0\r\nfor i in range(m):\r\n res = n // m\r\n print(res, \"\", end='')\r\n n -= res\r\n m -= 1\r\n", "n,m = list(map(int,input().split()))\r\na = int(n/m)\r\nd = n-(m*a)\r\n\r\nfor i in range(m-d):\r\n\tprint(a,end=' ')\r\n\r\nfor i in range(m-d,m):\r\n\tprint(a+1,end=' ')", "\r\nn,m=map(int,input().split())\r\na=n%m\r\nc=[n//m for i in range(m)]\r\nfor i in range(a):\r\n\tc[i]=c[i]+1\r\nprint(*c)", "\r\n\r\ndef main_function():\r\n n, m = [int(i) for i in input().split(\" \")]\r\n ratio = n // m\r\n output_list = [str(ratio) for i in range(m)]\r\n left = n - ratio * m\r\n for i in range(left):\r\n output_list[i] = str(int(output_list[i]) + 1)\r\n return \" \".join(output_list)\r\n\r\n\r\nprint(main_function())", "n,m=map(int,input().split())\r\na=[]\r\ni=n//m\r\nfor q in range(m-n%m):\r\n print(i,end=\" \")\r\nfor q in range(n%m):\r\n print(i+1,end=\" \")", "\r\n\r\nn,m=list(map(int,input().split()))\r\n\r\n\r\np=n//m\r\n\r\ns=n%m\r\n\r\nt=[]\r\nfor k in range(m):\r\n if s>0:\r\n t.append(p+1)\r\n s-=1\r\n else:\r\n t.append(p)\r\n\r\nt.sort()\r\n\r\nprint(*t)\r\n", "n,m = map(int,input().split())\r\nK = n%m\r\nans = \"\"\r\nls = []\r\nif K == 0:\r\n L = n//m\r\n for i in range(m):\r\n ls.append(L)\r\n print(*ls)\r\nelse:\r\n L = n//m\r\n s = m-(n%m)\r\n for i in range(m):\r\n if i < s:\r\n ls.append(L)\r\n else:\r\n ls.append(L+1)\r\n print(*ls)", "n, m = [int(i) for i in input().split(\" \")]\r\n\r\nmin_candies = n // m\r\nmax_candies = min_candies + 1\r\nmax_candies_recievers = n % m\r\nmin_candies_recievers = m - max_candies_recievers\r\n\r\nfor i in range(m):\r\n\tif i < min_candies_recievers:\r\n\t\tprint(min_candies, end = \" \")\r\n\telse:\r\n\t\tprint(max_candies, end = \" \")\r\n", "n,m = map(int, input().split())\r\ncur = n;\r\nfor i in range(0,m):\r\n print( cur // (m - i),end = ' ')\r\n cur -= cur // (m - i)\r\n", "n,m=list(map(int,input().split()))\r\n\r\nif n%m==0:\r\n q=int(n/m)\r\n res=[q for i in range(m)]\r\n print(\" \".join(list(map(str ,res))))\r\nelse:\r\n q=int(n/m)\r\n res=[q for i in range(m)]\r\n mval=n%m\r\n for i in range(mval):\r\n res[i]+=1\r\n print(\" \".join(list(map(str,reversed(res)))))\r\n \r\n", "n, k = map(int,input().split())\r\nres = [n//k for i in range(k)]\r\nfor i in range(n%k):\r\n res[i] += 1\r\n\r\nfor x in sorted(res): print(x,end=' ')", "n, m = map(int, input().split())\r\nl=[]\r\nwhile m>0:\r\n l.append(n//m)\r\n n-=n//m\r\n m-=1\r\nprint(*l)", "[n, m] = map(int,input().split())\ncandies = []\ny = 0\nif n % m == 0:\n a = int(n / m)\n for x in range(0, m):\n candies.append(a)\nelse:\n a = n % m\n d = m - a\n b = int((n - a) / m)\n c = b + 1\n if a == 1:\n c = b + 1\n for x in range(0, (m - 1)):\n candies.append(b)\n candies.append(c)\n else:\n for x in range(0, (d)):\n candies.append(b)\n for x in range(0, a):\n candies.append(c)\nprint(*candies)", "import math\ndef solve(n,m):\n target = math.ceil(n/m)\n while m and n%m:\n print(target,end=' ')\n m-=1\n n-=target\n if m>0:\n target = math.ceil(n/m)\n while m:\n print(target,end=' ')\n m-=1\n print()\n\n\n\n\n\n\nif __name__ == '__main__':\n t = 1\n while t:\n n,m = list(map(int,input().split()))\n solve(n,m)\n t -= 1\n", "def list2str(l):\n s = \"\"\n for d in l:\n s = s + str(d) + ' '\n s = s.strip()\n return s\n\nif __name__ == '__main__':\n _input = input()\n data = list(map (int, _input.split() ) )\n n = data[0]\n m = data[1]\n\n avg = n // m\n plus = n - m * avg\n\n ans = list( [avg]*(m - plus) + [avg + 1]*plus )\n print( list2str(ans) )\n", "seker, kisi=map(int, input().split())\r\nkisiler=[seker//kisi for n in range(kisi)]\r\n\r\nfor n in range(seker%kisi):\r\n kisiler[n] += 1\r\n\r\nkisiler.sort()\r\nfor n in kisiler:\r\n print(n, end=\" \")", "no_of_candies,no_of_friends = map(int,input().split())\r\ncandy = no_of_candies % no_of_friends\r\ncandies=no_of_candies//no_of_friends\r\nfor i in range(no_of_friends):\r\n if i<no_of_friends-candy:\r\n print(candies,end=\" \")\r\n else:\r\n print(candies+1,end=\" \")", "n, m = [int(x) for x in input().split()]\r\n\r\nif n % m == 0:\r\n res = [n // m] * m\r\n\r\nelse:\r\n res = [n // m] * m\r\n \r\n for ii in range(0, n % m):\r\n res[len(res) - ii - 1] += 1\r\n\r\nfor ii in res:\r\n print(ii, end=\" \")\r\n\r\nprint()", "nm = input().split()\r\nn=int(nm[0])\r\nm=int(nm[1])\r\nb=n%m\r\nfor i in range(m):\r\n if b>i:\r\n print(n//m+1,end=' ')\r\n continue\r\n print(n//m,end=' ')\r\n", "m, n = map(int, input().split())\r\nrem = m % n\r\nfor i in range(n-rem):\r\n print(m//n, end=' ')\r\nfor i in range(rem):\r\n print(m//n + 1, end=' ')\r\nprint()\r\n", "n,m=map(int,input().split())\r\nl = []\r\nif(n%m == 0):\r\n for i in range(m):\r\n l.append(int(n/m))\r\n print(\" \".join(str(x) for x in l))\r\nelse:\r\n sum=n%m\r\n for i in range(m):\r\n l.append(int(n/m))\r\n t=m-1\r\n while(sum):\r\n sum=sum-1\r\n l[t]=l[t]+1\r\n t=t-1\r\n print(\" \".join(str(x) for x in l))\r\n \r\n \r\n \r\n", "n, m = list(map(int, input().split()))\r\nz = n//m\r\na = []\r\nfor i in range(m):\r\n a.append(z)\r\n dis = (i+1)*z\r\nrem = n - dis\r\nfor i in range(rem):\r\n a[(m-i)-1]+=1\r\n rem-=1\r\n if(rem<=0):break\r\nprint(*a)\r\n \r\n\r\n ", "n, m = map(int, input().split())\r\nequal = n // m\r\nextra = n % m\r\nresult = [equal + 1] * extra + [equal] * (m - extra)\r\nprint(*result)", "n, m = map(int,input().split())\r\na = []\r\nf = n // m\r\nfor i in range(m):\r\n a.append(f)\r\ni = 0\r\nwhile sum(a) < n:\r\n a[i] += 1\r\n i += 1\r\nr = ' '.join(str(item) for item in a)\r\nprint(r)", "n, m = map(int, input().split())\r\n\r\nq = n//m\r\nr = n % m\r\na = [q] * m\r\n\r\n\r\nfor i in range(r):\r\n a[i] += 1\r\n\r\nfor i in range(m):\r\n print(a[i], end=' ')", "n, m = [int(x) for x in input().split()]\r\n\r\nq, r = divmod(n, m)\r\n\r\na = [q] * (m - r) + [q + 1] * r\r\n\r\nprint(' '.join(map(str, a)))", "l=list(map(int,input().split()))\r\nif l[0]%l[-1]==0:\r\n for i in range(l[-1]):\r\n print(l[0]//l[-1],end=' ')\r\nelse:\r\n while(l[0]!=0):\r\n print(l[0]//l[-1],end=' ')\r\n l[0]-=l[0]//l[-1]\r\n l[1]-=1\r\n if l[0]%l[-1]==0:\r\n for i in range(l[-1]):\r\n print(l[0]//l[-1],end=' ')\r\n exit()", "n, m = map(int, input().split())\r\na = [0] * m\r\nfor x in range(n):\r\n a[x % m] += 1\r\nprint(*a)\r\n#\r\n#\r\n#\r\n#\r\n#", "def main():\r\n n, m = [int(i) for i in input().split()]\r\n a = [n//m] * m\r\n l = n - (n//m)*m\r\n for i in range(l):\r\n a[i] += 1\r\n print(' '.join(map(str, a)))\r\nmain()", "n, m = map(int, input().split(' '))\n\nminimum = n // m\nrest = n % m\n\ncandies = []\nfor i in range(m):\n if i >= m - rest:\n candies.append(minimum + 1)\n else:\n candies.append(minimum)\nprint(*candies)\n\n\t\t\t \t\t\t \t\t\t\t\t \t\t \t\t \t\t \t\t \t\t", "# Here I just need to distribute the candies until it ends\ncandies, friends = map(int, input().split())\nfriendsCandy = [0] * friends\nactualFriend = 0\nwhile(candies > 0):\n friendsCandy[actualFriend] = friendsCandy[actualFriend] + 1\n candies = candies - 1\n actualFriend = actualFriend + 1\n #return to the 1st friend\n if(actualFriend >= friends):\n actualFriend = 0 \n#print\nfor i, friend in enumerate(friendsCandy):\n if(i != friends-1):\n print(friend, end=' ')\n else:\n print(friend) \n\t \t \t \t \t\t \t \t \t \t \t \t\t \t \t\t", "n,m=[int(x) for x in input().split()]\r\na=[]\r\nif(n%m==0):\r\n\tfor i in range(m):\r\n\t\ta.append(int(n/m))\r\nelse:\r\n\tfor i in range(m):\r\n\t\ta.append(int(n//m))\r\n\tfor i in range(n%m):\r\n\t\ta[-(i+1)]+=1\r\nfor i in range(m):\r\n\tprint(a[i],end=\" \")", "import sys\r\n\r\ndef main():\r\n n, m = map(int, sys.stdin.read().strip().split())\r\n return [n//m]*(m - n%m) + [n//m + 1]*(n%m)\r\n \r\nprint(*main())\r\n", "\r\n\r\nn, m = input().split(\" \")\r\nn, m = int(n), int(m)\r\n\r\nL = []\r\nb = n // m\r\nq = n%m\r\nfor i in range(m-q):\r\n\tL.append(b)\r\nfor i in range(q):\r\n\tL.append(b+1)\r\nfor i in range(len(L)):\r\n\tprint(L[i], end = \" \")\r\n", "n,m=map(int,input().split())\r\nif n%m==0:\r\n for i in range(0,m):\r\n print(n//m,end=\" \")\r\n exit(0)\r\nres=(n+m-1)//m\r\nwhile True:\r\n print(res,end=\" \")\r\n n=n-res\r\n m=m-1\r\n if m==0:\r\n break\r\n if n%m==0:\r\n while m:\r\n print(res-1,end=\" \")\r\n m=m-1\r\n break", "a=list(input().split(' '))\r\nb=int(a[0])//int(a[1])\r\nc=int(a[0])%int(a[1])\r\nd=[]\r\nfor i in range (0,int(a[1])-c):\r\n d.append(b)\r\nfor i in range (0,c):\r\n d.append(b+1)\r\nprint(*d)", "n,m = input().split()\r\n\r\nif int(n)%int(m) == 0:\r\n can = str(int(n)//int(m)) + \" \"\r\n print (can*int(m))\r\nelse:\r\n can = [int(n)//int(m)]*int(m)\r\n remain = int(n)%int(m)\r\n for x in range(remain):\r\n can[x] += 1\r\n can = [str(y) for y in can]\r\n print (\" \".join(can))\r\n \r\n \r\n \r\n \r\n \r\n \r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n \r\n \r\n \r\n\r\n \r\n \r\n\r\n \r\n \r\n\r\n\r\n\r\n\r\n\r\n \r\n\r\n\r\n\r\n\r\n \r\n\r\n\r\n\r\n\r\n \r\n\r\n \r\n \r\n\r\n \r\n \r\n \r\n \r\n \r\n\r\n \r\n \r\n\r\n\r\n\r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n\r\n\r\n\r\n\r\n \r\n \r\n \r\n\r\n\r\n\r\n\r\n\r\n \r\n \r\n \r\n\r\n \r\n \r\n\r\n\r\n\r\n \r\n \r\n \r\n \r\n\r\n\r\n\r\n \r\n\r\n\r\n \r\n \r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n \r\n\r\n\r\n\r\n \r\n \r\n \r\n \r\n\r\n\r\n \r\n\r\n\r\n\r\n \r\n \r\n\r\n \r\n\r\n\r\n \r\n\r\n \r\n\r\n\r\n\r\n \r\n\r\n\r\n \r\n\r\n\r\n\r\n \r\n \r\n \r\n\r\n \r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n \r\n \r\n \r\n\r\n \r\n\r\n \r\n \r\n \r\n \r\n\r\n\r\n\r\n\r\n \r\n\r\n\r\n \r\n\r\n\r\n\r\n \r\n\r\n\r\n\r\n\r\n\r\n \r\n \r\n \r\n \r\n", "n,m=list(map(int,input().split()))\r\nprint(*([n//m]*(m-n%m)+[n//m+1]*(n%m)))", "n,m=map(int,input().split())\r\nr=n%m\r\nif(r==0):\r\n print('{} '.format(n//m)*m)\r\nelse:\r\n a=n//m\r\n print('{} '.format(a+1)*r+'{} '.format(a)*(m-r))\r\n \r\n", "n,m=list(map(int,input().split()))\r\nprint(((str(n//m)+\" \")*(m-n%m)+(str((n//m)+1)+\" \")*(n%m)).strip())", "n,k=map(int,input().split())\r\nif(n%k==0):\r\n p=n//k\r\n while(k>0):\r\n print(p,end=' ')\r\n k=k-1\r\nelse:\r\n p=(n//k)+1\r\n r=p*k-n\r\n k=k-r\r\n while(r>0):\r\n print(p-1,end=' ')\r\n r=r-1\r\n while(k>0):\r\n print(p,end=' ')\r\n k=k-1", "vetor = list(map(lambda x: int(x), input().split()))\r\n\r\nn = vetor[0]\r\nm = vetor[1]\r\nk = n % m\r\n\r\nfor i in range(m):\r\n\r\n\tif k == 0:\r\n\r\n\t\tx = n // m\r\n\r\n\telse:\r\n\r\n\t\tif k > 0:\r\n\t\t\t\r\n\t\t\tx = n // m + 1\r\n\t\t\tk -= 1\r\n\t\t\r\n\t\telse:\r\n\t\t\t\r\n\t\t\tx = n // m\r\n\r\n\tprint(x, end=\" \")", "def solve():\n b = [n // m + (1 if i < n % m else 0) for i in range(m)]\n return ' '.join(map(str, b))\n\n\ndef main():\n global n, m\n n, m = map(int, input().split())\n print(solve())\n\n\nmain()\n", "n,m=map(int, input().split())\r\nfor i in range(m):\r\n a=n//m\r\n print(a)\r\n n=n+1", "a, b = map(int, input().split())\r\nprint(*[a // b] * (b - a % b) + [a // b + 1] * (a % b))", "a , b = [int(x) for x in input().split()]\r\nprint(*[a//b + 1 if i < a%b else a//b for i in range(b)])\r\n", "n,m=map(int,input().split())\r\nk=n//m\r\nr=n%m\r\na=[k+1]*(r)+[k]*(m-r)\r\nprint(*a)\r\n\r\n", "candies, frnds = map(int, input().split())\r\n\r\nd=candies//frnds\r\nif not candies%frnds:\r\n\tprint(\" \".join(map(str, [d]*frnds)))\r\nelse:\r\n\tr=candies%frnds\r\n\ta=[d]*frnds\r\n\tfor i in range(frnds):\t#Adds one from remainder to all number in the index as least difference among max and min is 1...nothing is less than 1\r\n\t\tif i==(frnds-r):\r\n\t\t\ta[i]+=1;r-=1\r\n\tprint(\" \".join(map(str, a)))", "n, m = map(int, input().split())\r\nde=n//m\r\na=[de for x in range(m)]\r\nre=n%m\r\nfor i in range(m-re,m):\r\n a[i]+=1\r\nfor i in range(m):\r\n print(a[i],end=' ')\r\n", "n, m = map(int, input().split())\nu, v = divmod(n, m)\nprint(\" \".join(str(x) for x in [u] * (m - v) + [u + 1] * v))\n", "n,m = map(int,input().split())\r\nfor i in range(m - n % m):\r\n print(n//m, end=' ')\r\nfor i in range(n % m):\r\n print(n//m+1, end=' ')", "n,m = map(int,input().split(\" \"))\r\nl = [0]*m\r\nfor i in range(0,n):\r\n l[i%m] += 1\r\nprint(*l)", "n,m=map(int,input().split())\r\nk=n//m\r\nrem=n%m\r\nfor i in range(m-rem):\r\n print(k,'',end='')\r\nfor i in range(rem):\r\n print(k+1,'',end='')\r\n \r\n ", "#!/usr/bin/python3\n\nn, m = [int(x) for x in input().split()]\n\nmn = n//m;\na = [mn for i in range(m)]\nrem = n%m\nfor i in range(m-rem, m):\n\ta[i] += 1\n\nfor i in range(m):\n\tprint(a[i], end=' ')\nprint()\n", "def main():\r\n n, m = map(int, input().split())\r\n a = [(n//m)]*m\r\n if sum(a) < n:\r\n for i in range(n-sum(a)):\r\n a[i]+= 1\r\n print(*a)\r\n\r\nmain()", "n, m = map(int, input().split(\" \"))\r\nlst = [n//m]*(m - n % m) + [n//m + 1]*(n % m)\r\nfor i in range(len(lst)-1):\r\n print(lst[i], end=' ')\r\nprint(lst[-1])\r\n", "n,m=map(int,input().split())\r\nwhile m>0:\r\n print(n//m,end=\" \")\r\n n=n-(n//m)\r\n m=m-1", "n, m = map(int, input().split())\r\nxred = n % m \r\nr = int((n-xred)/m)\r\n#ls = []\r\nfor i in range (0, m):\r\n if i<m-xred:\r\n print(r, end =\" \")\r\n else:\r\n print(r+1, end =\" \")", "spinp = lambda : list(map(int,input().split()))\r\na , b = spinp()\r\nc = [a//b for i in range(b)]\r\nfor i in range(a%b) : \r\n c[i] = c[i] + 1\r\nc = [str(i) for i in c]\r\nprint(' '.join(c))", "lst=[]\r\ncp=list(map(int,input().strip().split()))\r\nc=cp[0]\r\np=cp[1]\r\nquotient=c//p\r\nremainder=c%p\r\nfor i in range(p):\r\n lst.append(quotient)\r\nfor i in range(remainder):\r\n lst[i]+=1\r\nfor i in lst:\r\n print(str(i),end=\" \")\r\n\r\n", "n,m=map(int,input().split())\r\nans=[0 for i in range(m)]\r\ni=0\r\nwhile i<n:\r\n for j in range(m):\r\n i+=1\r\n ans[j]+=1\r\n if i>=n:\r\n break\r\nans.reverse()\r\nprint(*ans)\r\n ", "from sys import stdin, stdout\r\nfrom math import ceil, floor\r\nn, m = [int(x) for x in stdin.readline().split()]\r\nif n % m == 0:\r\n print(f\"{n // m} \" * m)\r\nelse:\r\n f = floor(n / m)\r\n c = ceil(n / m)\r\n print(f\"{f} \" * (m * c - n), f\"{c} \" * (n - m * f), sep = '')", "x = list(map(int, input().split(\" \")))\r\nif x[0]%x[1]==0:\r\n print((str(x[0]//x[1])+\" \")*x[1])\r\n exit()\r\nprint((str(x[0]//x[1]+1)+\" \")*(x[0]%x[1]),(str(x[0]//x[1])+\" \")*(x[1]-(x[0]%x[1])),sep=\"\")", "a,b = map(int, input().split())\r\narr = []\r\n\r\nfor char in range(int(b)):\r\n arr.append(a//b + 1)\r\nif a%b == 0:\r\n string = str(a//b)\r\n print((string + ' ') * b)\r\nelse:\r\n count = 0\r\n count2 = 0\r\n while sum(arr) > a:\r\n arr[count] = arr[count] - 1\r\n count += 1\r\n\r\n while sum(arr) < a:\r\n arr[count2] = arr[count2] + 1\r\n count2 += 1\r\n joined_arr = ' '.join(map(str, arr))\r\n print(joined_arr)", "\nI = lambda: map(int,input().split())\n\nn,m =I()\nr = n % m\nt = n // m\nfor i in range(r):print(t+1,end=\" \")\nfor i in range(r,m):print(t,end=\" \")\n \n", "candies, friends = map(int, input().split())\r\n\r\nper_friend = candies//friends\r\n\r\nrem = candies - friends*per_friend\r\n\r\nans = [per_friend] * (friends-rem) + [per_friend+1]*rem\r\n\r\nprint(*ans)\r\n", "nm = input().split()\r\nn = int(nm[0])\r\nm = int(nm[1])\r\nk = n // m\r\nr = n % m\r\nans = ''\r\nfor i in range(m):\r\n if i+1 <= r:\r\n ans += str(k+1) + ' '\r\n else:\r\n ans += str(k) + ' '\r\nprint(ans)\r\n", "m,n = input().split()\r\na,b = int(m),int(n) \r\nk = a//b \r\nL = [k for i in range(b)]\r\nj = a-b*k \r\nfor w in range(j):\r\n L[w]+=1\r\nprint(*L)\r\n", "n,m=[int(x) for x in input().split()]\r\nif n%m==0:\r\n for i in range(m):\r\n print(n//m,end=' ')\r\nelse:\r\n for i in range(m-n%m):\r\n print(n//m,end=' ')\r\n for i in range(n%m):\r\n print(n//m+1,end=' ')", "n,m=map(int,input().split())\r\nif(n%m)==0:\r\n for i in range(m):\r\n print(n//m,end=\" \")\r\n print()\r\nelse:\r\n x=n%m\r\n y=n//m\r\n for i in range(x):\r\n print(y+1,end=\" \")\r\n for i in range(m-x):\r\n print(y,end=\" \")\r\n print()\r\n", "n, m = map(int, input().split())\r\na = n // m\r\nif n % m == 0:\r\n for i in range(m):\r\n print(a, end=' ')\r\nelse:\r\n while n % m != 0:\r\n n -= a\r\n m -= 1\r\n print(a, end=' ')\r\n new_a = n // m\r\n for i in range(m):\r\n print(new_a, end=' ')", "a,b=map(int,input().split())\r\nl=[a//b+1]*(a%b) + [a//b]*(b-a%b)\r\nprint(*l)", "n,m = map(int, input().split())\r\nif n%m==0:\r\n n //= m\r\n s = str(n) + ' '\r\n print(s*m)\r\nelse:\r\n t = n%m\r\n n //= m\r\n s = ''\r\n for i in range(t):\r\n s += str(n+1) + ' '\r\n for i in range(m-t):\r\n s += str(n) + ' '\r\n print(s)", "n, m = map(int, input().split())\n\nnumber = n//m\nif(n%m==0):\n for i in range(m):\n print(number, end=' ')\nelse:\n for i in range(m-(n%m)):\n print(number, end=' ')\n for i in range(n%m):\n print(number+1, end=' ')\n \t \t \t\t\t \t\t \t \t \t\t \t \t\t \t\t", "# https://codeforces.com/problemset/problem/306/A\r\n\r\nn, m = map(int, input().split())\r\n\r\na = n // m\r\nb = n % m\r\n\r\nwhile b > 0 and m > 0:\r\n print(a + 1, end=\" \")\r\n b -= 1\r\n m -= 1\r\n\r\nwhile m > 0:\r\n print(a, end=\" \")\r\n m -= 1\r\n\r\n\r\n", "s=input().split()\r\nn,m=int(s[0]),int(s[1])\r\nprint((n%m)*(str(n//m+1)+\" \")+(m-(n%m))*(str(n//m)+\" \"))", "n, m=input().split(\" \")\r\nn=int(n)\r\nm=int(m)\r\ns=[]\r\nfor i in range(m):\r\n s.append(n//m)\r\nfor j in range(n%m):\r\n s[j]+=1\r\nfor i in range(m):\r\n print(s[i], end=\" \")\r\n", "n, m = map(int, input().split())\r\nk, r = n // m, n % m\r\nres = \" \".join(str(k) for _ in range(0, m - r))\r\nif r != 0:\r\n res += \" \" + \" \".join(str(k+1) for _ in range(0, r))\r\nprint(res)", "def solve():\r\n n, m = map(int, input().split())\r\n ans=\"\"\r\n while m > 0:\r\n a = round(n/m)\r\n ans += str(a) + \" \"\r\n n -= a\r\n m -= 1\r\n print(ans)\r\nsolve()", "p = input()\r\np = p.split()\r\np = [int(x) for x in p]#; print(p)\r\nn = p[0]\r\nm = p[1]\r\na = n // m\r\nb = n % m\r\nfor i in range(m):\r\n if i < m - b:\r\n print(a, end=' ')\r\n else:\r\n print(a+1, end=' ')", "n,m = map(int, input().split())\r\nif n%m==0:\r\n x = str(n//m) + \" \"\r\n print(m*str(x))\r\nelse:\r\n extra = n%m\r\n x= str(n//m) + \" \"\r\n y = str(n//m +1) + \" \"\r\n print( extra *str(y) + (m-extra)*str(x) )", "lmp = lambda:list(map(int, input().split()))\r\nmp = lambda:map(int, input().split())\r\nintp = lambda:int(input())\r\ninp = lambda:input()\r\nfinp = lambda:float(input())\r\n\r\nn, m = mp()\r\na = [n // m for i in range(m)]\r\nn %= m\r\n\r\nfor i in range(m):\r\n if n == 0:\r\n break\r\n n -= 1\r\n a[i] += 1\r\n\r\nprint(*a)\r\n", "n, m = map(int,input().split())\r\n\r\nll = [n // m for _ in range(m)]\r\n\r\nfor i in range(n - sum(ll)):\r\n ll[i] += 1\r\nprint(* ll)", "n, m = map(int, input().split())\r\nx, y = divmod(n, m)\r\n\r\nprint(*[x+1]*y+[x]*(m-y))", "[n,m]=map(int,input() .split())\r\na=(m - n%m)\r\nfor x in range(0,a):\r\n print(n//m, end=\" \") \r\nfor x in range(0,n%m):\r\n print(n//m+1, end=\" \")", "n, m = map(int, input().split())\nq, r = divmod(n, m)\nprint(' '.join(map(str, [q] * (m - r) + [q + 1] * r)))\n", "# -*- coding: utf-8 -*-\r\n\r\ncan, frn = input().split()\r\ncan = int(can)\r\nfrn = int(frn)\r\npass1 = int(can/frn)\r\notpt = [pass1]*frn\r\ncan -= pass1 * frn\r\nfor i in range(can):\r\n otpt[i] += 1\r\nprint(*otpt)\r\n\r\n ", "n, m = map(int, input().split())\r\nr_min = n // m\r\nr_max = r_min + int(n % m != 0)\r\nn_min = m - n % m\r\nn_max = m - n_min\r\nfor i in range(n_min):\r\n print(r_min, end=\" \")\r\nfor i in range(n_max):\r\n print(r_max, end=\" \")\r\n", "n, m = map(int, input().split())\r\n\r\nq = n // m\r\nr = n % m\r\n\r\nfor i in range(m - r):\r\n print(q, end=\" \")\r\nfor i in range(r):\r\n print(q + 1, end=\" \")", "n, m = map(int, input().split())\nv = [n // m] * m\nv[:n % m] = [x + 1 for x in v[:n % m]]\nprint(*v)\n", "'''with open('C:/Users/polinmd/Downloads/28130_A.txt', 'r') as file:\r\n nums = [int(i.rstrip('\\n')) for i in file.readlines()]\r\n counter = 0\r\n for elem in nums:\r\n itert = nums.copy()\r\n del itert[itert.index(elem)]\r\n for selem in itert:\r\n if (elem + selem) % 80 == 0 and ((elem > 50) or (selem > 50)):\r\n counter += 1\r\n print(counter)\r\n'''\r\n'''\r\nfor x in range(0, 14):\r\n if(15 ** 4 + 2 * 15 ** 3 + 3 * 15 ** 2 + x * 15 + 5 + 1 * 15 ** 4 + x * 15 ** 3 + 2 * 15 ** 2 + 3 * 15 + 3) % 14 == 0:\r\n print(x)\r\na = (15 ** 4 + 2 * 15 ** 3 + 3 * 15 ** 2 + 4 * 15 + 5 + 1 * 15 ** 4 + 4 * 15 ** 3 + 2 * 15 ** 2 + 3 * 15 + 3) / 14\r\nprint(a)\r\n'''\r\nn, m = [int(i) for i in input().split()]\r\ncandies = []\r\nif n % m == 0:\r\n print(((str(n // m) + ' ') * m).rstrip(' '))\r\nelse:\r\n candies = [(n // m) for i in range(m)]\r\n last = n - sum(candies)\r\n while last:\r\n candies[-1] = candies[-1] + 1\r\n candies.insert(0, candies[-1])\r\n del candies[-1]\r\n last -= 1\r\n a = [str(i) for i in list(reversed(candies))]\r\n print((' '.join(a)).rstrip(' '))\r\n ", "n,m=map(int,input().split())\r\na=[n//m]*m\r\nfor b in range(n%m):\r\n a[b]=a[b]+1\r\nfor b in a:\r\n print(b,end=' ')", "n,m = map(int,input().split())\n\nif n%m ==0:\n\tx = n//m\n\tprint(*([x]*m))\nif n%m!=0:\n\tx = n//m\n\ty = n%m\n\tz =[x+1]*y\n\tz.extend([x]*(m-y))\n\tprint(*z)\n", "def main():\n [n, m] = [int(_) for _ in input().split()]\n a = n // m\n b = n % m\n s = [str(a)] * (m - b) + [str(a + 1)] * b\n print(' '.join(s))\n\n\nif __name__ == '__main__':\n main()\n", "\r\n\r\nn , m = map(int , input().split())\r\n\r\na = n // m\r\nb = n % m\r\nl = []\r\nfor i in range(m):\r\n if b > 0:\r\n l.append(a + 1)\r\n b -= 1\r\n else:\r\n l.append(a)\r\n \r\nl.sort()\r\n\r\nfor i in l:\r\n print(i , end = ' ')\r\n \r\n ", "entrada=input().split()\ndoces=int(entrada[0])\namigos=int(entrada[1])\nquociente=doces//amigos\nresto=doces%amigos\nfor i in range(amigos-1):\n if resto>0:\n print(quociente+1,end=\" \")\n resto-=1\n else:\n print(quociente,end=\" \")\n \nprint(quociente)\n \t \t\t \t\t\t \t \t \t \t \t\t \t\t", "[candy,people] = map(int, input() .split())\n\ndiv = int(candy//people)\nextra = int(candy%people)\nlistt = []\nfor x in range (0, people):\n listt.append(div)\nfor x in range (0, extra):\n listt[x] = div+1 \naddon = str(listt[0])\nfor x in range (1, people):\n addon = addon+ ' ' + str(listt[x])\nprint(addon)", "a,b = list(map(int,input().split()))\r\nd= a%b\r\ne=a//b\r\nl=[]\r\nfor i in range(b):\r\n l.append(e);\r\nfor i in range(len(l)-1,len(l)-d-1,-1):\r\n l[i]=l[i]+1\r\nprint(*l)\r\n", "n,f=map(int,input().split())\r\nfor i in range(f,0,-1):\r\n print(n//i,end=' ')\r\n n-=n//i", "\r\na,b=map(int,input().split())\r\nl=[]\r\nwhile(a>0):\r\n l.append(a//b)\r\n a=a-(a//b)\r\n b=b-1\r\nc=len(l)\r\nfor i in range(c):\r\n print(l[i],end=\" \")\r\n\r\n", "n, m = [int(i) for i in input().split()]\nr = [n//m] * m\n\nfor i in range(-1, -(n%m)-1, -1):\n r[i] += 1\n\nfor i in range(m):\n print(r[i], end=' ')\n", "n , m = map(int,input().split())\r\nl = []\r\nif n%m==0:\r\n\tfor k in range(m):\r\n\t\tl.append(n//m)\r\n\tprint(*l)\t\r\nelse:\r\n\tfor i in range(n%m):\r\n\t\tl.append((n//m)+1)\r\n\tsuml = sum(l)\r\n\ta = n - suml\r\n\tfor j in range(a//(n//m)):\r\n\t\tl.append(n//m)\r\n\tl.sort()\r\n\tprint(*l)\t", "n,m=list(map(int,input().split()))\r\nl = [n // m] * m\r\nfor i in range(n%m):\r\n l[~i]+=1\r\nprint(*l)", "a, b = input().split()\r\na = int(a)\r\nb = int(b)\r\nfor i in range(b):\r\n if(i < a % b):\r\n print(a // b + 1, end=\" \")\r\n else:\r\n print(a // b, end = \" \")", "from math import ceil\r\n\r\nX = list(map(int, input().split()))\r\nDifference = X[1] * ceil(X[0] / X[1]) - X[0]\r\nprint((X[1] - Difference) * (str(ceil(X[0] / X[1])) + \" \") + Difference * (str(X[0] // X[1]) + \" \"))\r\n\r\n# UB_CodeForces\r\n# Advice: Just remember this \" Your the most important person in the world \"\r\n# Location: Under the sunshine\r\n# Caption: Happy because of \"EXCITE\"\r\n", "n,m=map(int,input().split())\r\nk=0\r\nwhile n>0:\r\n k=n//m\r\n print(k,end=\" \")\r\n n-=k\r\n m-=1", "n,m=map(int,input().split())\r\nans=[n//m for i in range(m)]\r\nrem=n-(n//m)*m\r\nfor i in range(rem):\r\n ans[i]+=1\r\nprint(*ans)\r\n", "from math import floor\ndef candies():\n n, m = list(map(int,input().split()))\n qtdd = floor(n/m)\n resto = n%m\n result = (str(qtdd) + ' ')*(m-resto) + (str(qtdd + 1) + ' ')*(resto)\n print(result)\n\ncandies()\n\n\t\t\t\t \t\t\t \t\t \t \t \t \t \t\t", "import math\r\nn, m = list(map(int,input().split()))\r\nif n % m == 0:\r\n for i in range (m):\r\n print(n//m, end = \" \")\r\n \r\nelse:\r\n first = n%m\r\n for k in range (first):\r\n print(n//m + 1, end=\" \")\r\n for k in range(first, m):\r\n print(n//m, end=\" \")\r\n\r\n ", "n, m = map(int, input().split())\r\n\r\nnum_groups = n // m\r\nnum_extra = n % m\r\n\r\nsizes = [num_groups] * m\r\nfor i in range(num_extra):\r\n sizes[i] += 1\r\n\r\nprint(\" \".join(str(size) for size in sizes))", "[n,m]=map(int,input().split())\r\na=[]\r\ni=n//m\r\nfor x in range(m-n%m):\r\n print(i,end=\" \")\r\nfor x in range(n%m):\r\n print(i+1,end=\" \")", "m , n = map(int ,input().split()) \r\nl = [0] * n \r\nwhile m > n : \r\n for i in range(n) : \r\n l[i] += 1\r\n m -= n\r\nfor i in range(m) :\r\n l[i] += 1 \r\nprint(*l)", "n, m = map(int, input().split())\r\nq, r = divmod(n, m)\r\n\r\nprint(' '.join([str(q + 1)] * r + [str(q)] * (m - r)))\r\n", "n, m = map(int, input().split())\r\nif n % m == 0:\r\n for i in range(m):\r\n print(n//m, end=\" \")\r\nelse:\r\n ok = (n-1)//m+1\r\n boo = 1\r\n while boo:\r\n if m*(ok-1) == n:\r\n for i in range(m):\r\n print(ok - 1, end=' ')\r\n break\r\n else:\r\n n-=ok\r\n m-=1\r\n print(ok, end=\" \")", "n,m = input().split()\n\nn=int(n)\nm=int(m)\n\nL=[]\n\nleast=n//m\nremainder=n%m\n\nfor i in range(m):\n L.append(least)\n\nfor i in range(m):\n if(i==m-1):\n x=\"\"\n else:\n x=\" \"\n if(remainder>0):\n print(least+1,end=x)\n remainder-=1\n else:\n print(least,end=x)\n", "n,m=map(int,input().split(' ')); l=[]\r\nif n%m==0:\r\n\tfor i in range(m):\r\n\t\tprint(n//m,end=' ')\r\nelse:\r\n\tfor i in range(m):\r\n\t\tl.append(n//m)\r\n\tfor i in range(n%m):\r\n\t\tl.pop()\r\n\tfor i in range(n%m):\r\n\t\tl.append((n//m)+1)\r\n\tl.sort()\t\r\n\tfor i in l:\r\n\t\tprint(i,end=' ')\t\t\t\t", "n, m = map(int, input().split())\n\nrem = n % m \ncnt = n // m \nans = []\nfor i in range(m):\n if i < rem:\n ans.append(cnt+1)\n else:\n ans.append(cnt)\nans.sort()\n\nfor i in range(len(ans)):\n\tprint (ans[i], \"\")\n\n \t\t \t\t\t\t \t\t\t \t \t\t\t\t\t\t \t \t", "n,m=map(int,input().split())\r\nl=[]\r\nfor i in range(m):\r\n l.append(1)\r\nn-=len(l)\r\nwhile n>=len(l):\r\n for i in range(m):\r\n l[i]+=1\r\n n-=len(l)\r\nelse:\r\n for i in range(0,n):\r\n l[i]+=1\r\nprint(*l)\r\n", "fast=lambda:stdin.readline().strip()\r\nzzz=lambda:[int(i) for i in fast().split()]\r\nz,zz=input,lambda:list(map(int,z().split()))\r\nszz,graph,mod,szzz=lambda:sorted(zz()),{},10**9+7,lambda:sorted(zzz())\r\nfrom re import *\r\nfrom sys import *\r\nfrom math import *\r\nfrom heapq import *\r\nfrom queue import *\r\nfrom bisect import *\r\nfrom string import *\r\nfrom itertools import *\r\nfrom collections import *\r\nfrom math import factorial as f\r\nfrom bisect import bisect as bs\r\nfrom bisect import bisect_left as bsl\r\nfrom collections import Counter as cc\r\nfrom itertools import accumulate as ac\r\ndef lcd(xnum1,xnum2):return (xnum1*xnum2//gcd(xnum1,xnum2))\r\ndef output(answer):stdout.write(str(answer))\r\n###########################---Test-Case---#################################\r\n\"\"\"\r\n\r\n If you Know me , Then you probably don't know me !\r\n\r\n\r\n\"\"\"\r\n###########################---START-CODING---##############################\r\n\r\nn, m = zzz()\r\n\r\nif n%m==0:\r\n print((str(n//m)+' ')*m)\r\n\r\nelse:\r\n t=n%m\r\n arr=[n//m]*m\r\n i=0\r\n while t:\r\n arr[i]+=1\r\n t-=1\r\n i+=1\r\n if i%m==0:\r\n i=0\r\n print(*arr)\r\n \r\n\r\n\r\n", "n,m=[int(i) for i in input().split()]\r\nif n%m==0:\r\n print((str(n//m)+' ')*m)\r\nelse:\r\n k=n//m\r\n r=n%m\r\n for i in range(0,m):\r\n if r!=0:\r\n print(k+1,end=' ')\r\n r=r-1\r\n else:\r\n print(k,end=' ')\r\n", "n, m = input().split()\r\nn = int(n)\r\nm = int(m)\r\n\r\nd = n // m\r\nr = n % m\r\n\r\nf = [d] * (m - r)\r\ns = [d+1] * (r)\r\nprint(*f, *s)\r\n", "[n,m] = list(map(int,input().split(\" \")))\r\nl = [n//m]*m\r\nr = n % m\r\nfor i in range(r):\r\n l[i] += 1\r\nprint(' '.join([str(i) for i in l]))\r\n\r\n \r\n \r\n\r\n\r\n \r\n", "n,m=map(int,input().split())\r\narr=[0 for i in range (m)]\r\na=0\r\nfor i in range (n):\r\n arr[a] += 1\r\n a += 1\r\n if (a == m):\r\n a = 0\r\nfor i in range (m):\r\n print(arr[i], end = ' ')", "(n, m) = map(int, input().split(' '))\n\nlst = []\n\nwhile True:\n lst.append(n // m)\n if len(lst) == m:\n break\n\nif n % m != 0:\n remainder = n % m\n for i in range(remainder):\n lst[i] += 1\n\nlst.sort()\nprint(*lst)", "n, m = map(int, input().split())\r\na = [0] * m\r\ni = []\r\nnn = n\r\nc = 0\r\nwhile nn > 0:\r\n nn -= 1\r\n i.append(c)\r\n c += 1\r\n if c == m:\r\n c = 0\r\nfor x in i:\r\n a[x] += 1\r\nprint(*a)\r\n", "n, m = map(int, input().split())\r\na = [n // m]*(m-n%m) + [n//m+1]*(n%m)\r\nb = [str(i) for i in a]\r\nprint(\" \".join(b))", "# Candies\n[n,m] = map(int,input().split())\nfor i in range(m - n%m):\n print(n//m,end=' ')\nfor i in range(n%m):\n print(n//m+1,end=' ')\n", "n,m=(int(x) for x in input().split())\r\nmin=n//m\r\nr=n%m\r\nfor i in range(m):\r\n if i<r:\r\n print(min+1,end=\" \")\r\n else:\r\n print(min,end=\" \")", "k = input().split()\r\nk = [int(i) for i in k]\r\ncandies = []\r\nn, m = k[0], k[1]\r\nreminder = n % m\r\nfor i in range(m):\r\n candies.append(int(n//m))\r\nfor i in range(m):\r\n if reminder > 0:\r\n candies[i] += 1\r\n reminder -= 1\r\n else:\r\n break\r\nfor i in candies:\r\n print(i, end= ' ')", "import sys\r\ninput = sys.stdin.readline\r\ndef inp():\r\n return(int(input()))\r\ndef inlt():\r\n return(list(map(int,input().split())))\r\ndef insr():\r\n s = input()\r\n return(list(s[:len(s) - 1]))\r\ndef invr():\r\n return(map(int,input().split()))\r\nL=inlt()\r\nn=L[0]\r\nm=L[1]\r\na=int(n/m)\r\nb=n%m\r\nif b==0:\r\n for i in range(m):\r\n print(a,end=' ')\r\nelse:\r\n for i in range(m):\r\n if b!=0:\r\n print(a+1,end=' ')\r\n b=b-1\r\n else:\r\n print(a, end=' ')", "[n, m] = map(int, input().split())\n\nremainder = n % m\nnormal = (n - remainder) // m\n\nfor i in range(remainder):\n print(normal + 1, end = ' ')\nfor i in range(m - remainder):\n print(normal, end = ' ')", "[n,m]=map(int, input().split())\r\nfor j in range (0,n%m):\r\n print((n//m)+1, end=\" \")\r\nfor i in range(0,m-n%m):\r\n print(n//m, end=\" \")", "n,m=map(int,input().split())\r\nres=n//m\r\nn-=(res*m)\r\na=[res]*m\r\ni=0\r\nwhile(n>0):\r\n a[i]+=1\r\n i+=1\r\n n-=1\r\nprint(*a[::-1])", "[n,m] = map(int, input().split())\r\ncandies = []\r\nr = n%m\r\n\r\nfor x in range(m):\r\n candies.append(n//m)\r\n \r\nfor x in range(m):\r\n if r > 0:\r\n candies[x] += 1\r\n r -= 1\r\nfor candy in candies: \r\n print(candy)", "data = input(\"\")\ndata = data.split(\" \")\noutput = \"\"\n\nfor i in range(len(data)):\n data[i] = int(data[i])\n\nif data[0] % data[1] == 0:\n for i in range(data[1]):\n output = output + str((int(data[0]/data[1])))\n output = output + \" \"\n\nelse:\n modulo = data[0] % data[1]\n first_num = int(data[0]/data[1])\n second_num = data[1] - modulo\n third_num = first_num + 1\n fourth_num = modulo\n\n for j in range(second_num):\n output = output + str(first_num)\n output = output + \" \"\n for k in range(fourth_num):\n output = output + str(third_num)\n output = output + \" \"\n\nprint(output)", "n, m = map(int, input().split())\r\ns = []\r\nif n % m == 0:\r\n a = n // m\r\n for i in range(m):\r\n s.append(a)\r\n print(*s)\r\nelse:\r\n a = n//m\r\n a1 = n//m + 1\r\n \r\n for i in range(m):\r\n for j in range(m):\r\n if ((a * i + a1 * j) == n) and i + j == m:\r\n for h in range(i):\r\n s.append(a)\r\n for l in range(j):\r\n s.append(a1)\r\n break\r\n print(*s)", "n,m=map(int,input().split( ))\r\na=[]\r\nfor i in range(0,m):\r\n a.append(n//m)\r\nn=n%m\r\nfor i in range(0,n):\r\n a[i]+=1\r\nfor i in a:\r\n print(i,end=' ')\r\n", "n, k = list(map(int, input().split()))\r\nl = [n//k]*k\r\na = n%k\r\nfor i in range(k-a, k):\r\n l[i] += 1\r\nprint(*l)", "[n,m]=map(int,input() .split())\nx=(m - n%m)\nfor x in range(0,x):\n print(n//m, end=\" \") \nfor x in range(0,n%m):\n print(n//m+1, end=\" \")\n \n \n \n \n\n \n \n ", "n,m = list(map(int,input().split()))\r\nfor i in range(n%m):\r\n print(n//m+1,end=\" \")\r\nfor i in range(m-n%m):\r\n print(n//m,end=\" \")", "a, b = input().split()\r\n\r\na = int(a)\r\nb = int(b)\r\n\r\n#a candies, \r\n#b friends\r\n\r\nx = a - b*int(a/b)\r\n#x is the remaining amount of candies after i split it equally\r\n\r\npr = ''\r\nfor i in range(b-x):\r\n pr += str(int(a/b))+' '\r\nfor j in range(x):\r\n pr += str(int(a/b)+1)+' '\r\n\r\nprint(pr)", "n, m = map(int, input().split())\nq, r = divmod(n, m)\nprint((str(q+1)+' ') * r, (str(q)+' ') * (m - r))\n", "s = input().split()\r\nn, m = int(s[0]), int(s[1])\r\nval = n//m\r\nfor _ in range(m-(n%m)):\r\n print(val, end=' ')\r\nif n%m > 0:\r\n val += 1\r\nfor _ in range(n%m):\r\n print(val, end=' ')\r\nprint()\r\n", "n,m = map(int, input().split())\r\nans = n//m\r\nmy_list = []\r\nfor i in range(0, m):\r\n my_list.append(ans)\r\n\r\n\r\nfor i in range(0, n%m):\r\n my_list[i] += 1\r\n\r\nsorted_list = sorted(my_list)\r\n\r\nfor i in range(0, m):\r\n print(sorted_list[i], end=\" \")\r\n\r\n", "l = [int(x) for x in input().split()]\r\nmin = l[0] // l[1]\r\nex = l[0] % l[1]\r\nans = []\r\n\r\nfor i in range(ex):\r\n ans.append(min + 1)\r\n\r\nfor i in range(l[1] - ex):\r\n ans.append(min)\r\n\r\nfor i in ans:\r\n print(i, end = \" \")", "a,b=list(map(int,input().split()))\r\nq=a//b\r\nv=[q for aboba in range(b)]\r\no=0\r\nwhile sum(v)!=a:\r\n v[o]+=1\r\n o+=1\r\nprint(*v)", "def main():\n n, m = map(int, input().split())\n\n minValue = n // m\n candies = [minValue for i in range(m)]\n\n total = n - (minValue * m)\n index = 0\n\n while total > 0:\n candies[index] += 1\n total -= 1\n index += 1\n\n print(*candies)\n\nmain()\n\t \t\t\t\t \t\t\t \t\t \t \t \t", "y=input()\r\nx=y.split()\r\nn=int(x[0])\r\nm=int(x[1])\r\na=int(n/m)\r\nb=int(n%m)\r\nk=0\r\nwhile k<m-b:\r\n print(a)\r\n k+=1\r\nl=0\r\nwhile l<b:\r\n print(a+1)\r\n l+=1", "l1 = [int(x) for x in input().split()]\r\nn = l1[0]\r\nd = l1[1]\r\nst = n%d\r\nunit = int(n/d)\r\nc_out=\"\"\r\ni=0\r\nwhile i<st:\r\n c_out+=str(unit+1)\r\n c_out+=\" \"\r\n i+=1\r\nwhile i<d:\r\n c_out+=str(unit)\r\n c_out+=\" \"\r\n i+=1\r\nprint(c_out)\r\n\r\n\r\n", "n,m=map(int,input().split())\r\nminc=int(n/m)\r\npri=n%m\r\na=[]\r\nfor i in range(0,m-pri):\r\n\ta.append(minc)\r\nfor i in range(0,pri):\r\n\ta.append((minc+1))\r\nsta=''\r\nfor i in range(0,m):\r\n\tif i==m-1:\r\n\t\tsta=sta+str(a[i])\r\n\telse:\r\n\t\tsta=sta+str(a[i])+' '\r\nprint(sta)", "a, b=map(int, input().split())\r\nans=a//b\r\nrem= a%b\r\nlst=[]\r\nfor i in range(b):\r\n if i<b-rem:\r\n lst.append(ans)\r\n else:\r\n lst.append(ans+1)\r\nprint(*lst)\r\n", "n,m=map(int,input().split())\r\na=n//m\r\nb=n%m\r\nif b==0:\r\n print((str(a)+' ')*m)\r\nelse:\r\n print((str(a+1)+' ')*b,(str(a)+' ')*(m-b),sep='')\r\n", "x,y=map(int,input().split())\r\nz=x//y\r\na=x-z*y\r\nb=y-a\r\n\r\nprint(b*(str(z)+\" \"),a*(str(z+1)+\" \"),sep='')", "n, m = list(map(int, input().split()))\r\nl = [n//m] * m\r\nfor a in range(n%m):\r\n l[a] += 1\r\nl.sort()\r\nprint(' '.join([str(b) for b in l]))", "n, m = map(int, input().split())\r\ndiv = n // m\r\nmod = n % m\r\nlst = []\r\nk = 1\r\nfor i in range(m):\r\n lst.append(div)\r\nfor item in lst:\r\n if mod != 0 and mod > 0:\r\n lst[lst.index(item)] = lst[lst.index(item)] + 1\r\n mod = mod - 1\r\nlst.sort()\r\nfor item in lst:\r\n if k == len(lst)-1:\r\n print(item)\r\n print(item, end = ' ')\r\n \r\n", "n,m=map(int,input().split())\r\na=[]\r\nwhile n>0:\r\n a.append(n//m)\r\n n-=n//m\r\n m-=1\r\nprint(*a)\r\n", "n,m=map(int,input().split())\r\nlist1=[]\r\nif n%m==0:\r\n\tlist1=[n//m]*m\r\n\tfor i in list1:\r\n\t\tprint(i,end=' ')\r\nelse:\r\n\tfor i in range(m):\r\n\t\tleast=n//(m-i)\r\n\t\tlist1.append(least)\r\n\t\tn-=least\r\n\tfor i in list1:\r\n\t\tprint(i,end=' ')", "n,m = input().split()\r\nn = int(n)\r\nm = int(m)\r\nq = n//m\r\nr = n%m\r\nlst = []\r\nfor i in range(m):\r\n if(i<m-r):\r\n lst.append(q)\r\n else:\r\n lst.append(q+1)\r\nprint(*lst)", "import math\r\n[n, m] = map(int, input().split())\r\nc = (n/m)\r\ndiff = (math.ceil(c))*m-(c*m)\r\n#n candies, m friends\r\nfor i in range(m):\r\n if diff > 0:\r\n print(math.floor(c))\r\n diff = diff-1\r\n else:\r\n print(math.ceil(c))\r\n ", "# coding=utf-8\nn,m=map(int,input().split())\r\nt=n//m\r\nk=n-t*m\r\nfor i in range(m-k):\r\n print(t,end=' ')\r\nfor i in range(k):\r\n print(t+1,end=' ')\r\n\r\n\n\t \t\t\t \t \t \t \t\t \t\t\t\t\t", "def solve(n, m):\r\n if n%m == 0:\r\n num = n//m\r\n arr = []\r\n for i in range(m):\r\n arr.append(str(num))\r\n return \" \".join(arr)\r\n else:\r\n num = n//m\r\n rem = n - (num*m)\r\n i = 0\r\n arr = []\r\n while i < m:\r\n if i < m-rem:\r\n arr.append(str(num))\r\n else:\r\n arr.append(str(num+1))\r\n i += 1\r\n return \" \".join(arr)\r\n \r\n\r\na = list(map(int,input().strip().split()))[:2]\r\nn, m = a[0], a[1]\r\nprint(solve(n, m))\r\n", "a,b=map(int,input().split());c=[0]*b\r\nfor i in range(b) :\r\n c[i]=a//b\r\nfor i in range(a%b) :\r\n c[i]+=1\r\nprint(*c)\r\n", "n,m = map(int, input().split())\n[print(1 + (n // m), end = ' ') for i in range(n % m)]\n[print(n // m, end = ' ') for i in range(m - (n % m))]\n", "n,m=map(int,input().split())\r\nif(n%m==0):\r\n x=int(n/m)\r\n for i in range(m):\r\n print(x,end=\" \")\r\nelse:\r\n x=int(n/m)\r\n k=m*(x+1)-n\r\n for i in range(1,m+1):\r\n if(i<=k):\r\n print(x,end=\" \")\r\n else:\r\n print(x+1,end=\" \")", "a, b = [int(i) for i in input().split()]\r\nc =[a//b] * b\r\n\r\nk = a%b\r\nwhile k != 0:\r\n c[c.index(min(c))] +=1\r\n k-=1\r\nc.sort()\r\nprint(*c)", "n,m=map(int,input().split())\r\nk=[]\r\nif n%m==0:\r\n k=[n//m]*m\r\nelse:\r\n k=[n//m]*m\r\n for i in range(n%m):\r\n k[i]+=1\r\n k=sorted(k)\r\nprint(*k)\r\n", "# n = int(input())\r\nn, k = map(int, input().split())\r\n\r\nr = n // k\r\n\r\nresto = n % k\r\n\r\nres = []\r\nfor i in range(k):\r\n if resto > 0:\r\n resto -= 1\r\n res.append(r+1)\r\n else:\r\n res.append(r)\r\n\r\nres.sort()\r\nprint(*res)\r\n", "l=input()\r\nl=l.split()\r\nn=int(l[0])\r\nk=int(l[1])\r\ns=[]\r\na=0\r\nwhile k!=0:\r\n\ta=n//k\r\n\ts.append(str(a))\r\n\tk-=1\r\n\tn=n-a\r\nans=''\r\nfor i in range(len(s)):\r\n\tans+=s[i]+' '\r\nprint(ans)", "r = lambda: int(input())\r\nra = lambda: [*map(int, input().split())]\r\nn,m = ra()\r\na = [n//m for i in range(m)]\r\nfor i in range(n%m):\r\n a[i]+=1\r\nprint(*a)\r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Wed Jul 15 01:43:36 2020\r\n\r\n@author: thiva\r\n\"\"\"\r\n\r\n\r\n[n,m] = [int(s) for s in input().split(' ')]\r\nshare = n//m\r\nrem = n%m\r\nmaxi = share + 1\r\n\r\nans = (str(maxi) + ' ')*rem + (str(share) + ' ')*(m - rem - 1) + str(share)\r\nprint(ans)\r\n ", "n, m = [int(x) for x in input().split()]\n\nlista = []\nif n % m == 0:\n\tfor e in range(m):\n\t\tlista.append(str(n//m))\t\nelse:\n\tbiu = (n//m) + 1\n\tir = biu * m\n\taux = ir - n\n\tfor e in range(m):\n\t\tif e + 1 <= aux:\n\t\t\tlista.append(str(biu-1))\n\t\telse:\n\t\t\tlista.append(str(biu))\n\t\t\n\t\t\t\t\nprint(\" \".join(lista))\n", "a,b = map(int,input().split())\r\nz = a//b\r\nprint((str(z)+\" \")*(b-a%b) + (str(z+1 )+\" \")*(a%b))", "import sys\n\ndef solve():\n n, m = map(int, input().split())\n res = [0] * m\n for i in range(n):\n res[i % m] += 1\n return ' '.join(map(str, res))\n\nif sys.hexversion == 50594544 : sys.stdin = open(\"test.txt\")\nprint(solve())", "import math\r\n[num_candies, num_friends] = map(int, input().split())\r\n\r\ncandy_allocation = []\r\n# Give larger number math.ceil(num_candies/num_floors) candies to \r\n# num_candies%num_friends number of num_friends\r\n# Give smaller number math.floor(num_candies/num_floors) \r\n# candies to the rest of the friends\r\n\r\nsmaller_candies = math.floor(num_candies/num_friends)\r\nnum_friends_smaller = num_friends - num_candies%num_friends\r\nlarger_candies = math.ceil(num_candies/num_friends)\r\nnum_friends_larger = num_candies%num_friends\r\n\r\nequal_candies = num_candies//num_friends\r\n# Allocate smaller number of candies\r\nfor i in range(num_friends_smaller):\r\n candy_allocation.append(smaller_candies)\r\n# Allocate larger number of candies\r\nfor i in range(num_friends_larger):\r\n candy_allocation.append(larger_candies)\r\n \r\nfor i in range(num_friends):\r\n print(candy_allocation[i], end=' ')", "candy, frends = map(int, input().split())\r\n\r\ngarant = candy//frends\r\noctatok = candy % frends\r\nplus = garant + 1\r\nfor i in range(frends - octatok):\r\n print(garant, end = ' ')\r\n \r\nfor i in range(octatok):\r\n print(plus, end = ' ')", "n,m = map(int,input().split())\r\nprint(*[n//m+1 if i<n%m else n//m for i in range(m)])", "import sys\r\nii = lambda: sys.stdin.readline().strip()\r\nidata = lambda: [int(x) for x in ii().split()]\r\n\r\ndef solve():\r\n n, m = idata()\r\n d = n % m\r\n ans = n // m\r\n for i in range(m):\r\n if d:\r\n print(ans + 1, end=' ')\r\n else:\r\n print(ans, end=' ')\r\n d = max(d - 1, 0)\r\n return\r\n\r\nfor t in range(1):\r\n solve()", "[n,m] = map(int, input().split())\r\nr = n%m\r\ns = n//m\r\nfor x in range(r):\r\n print(s+1,end=' ')\r\nfor x in range(m-r):\r\n print(s,end=' ')\r\nprint()", "import sys\r\n\r\ninput = sys.stdin.readline\r\n\r\nn, m = map(int, input().split())\r\n\r\nfor i in range(m - n % m):\r\n print(n // m, end=' ')\r\n\r\nfor i in range(n % m):\r\n print((n // m) + 1, end=' ')\r\n", "a,b=map(int,input().split())\r\nh=a//b\r\nif a%b==0:\r\n for x in range(b):\r\n print(h,end=' ')\r\nelse:\r\n for x in range(b-a%b):\r\n print(h,end=' ')\r\n for x in range(a%b):\r\n print(h+1,end=' ')\r\n", "#n, k = map(int, input().split(\" \"))\r\n#LA = [int(x) for x in input().split()]\r\n\r\nn, m = map(int, input().split(\" \"))\r\n\r\nfor x in range(m) :\r\n if (x < (n % m)): print (n // m + 1, end=\" \")\r\n else : print(n // m, end=\" \")\r\n", "import sys\r\nsys.stdin.reconfigure(line_buffering=True)\r\na,b=map(int,input().split())\r\nfor i in range(b):\r\n if i<a%b:\r\n print(a//b+1,end=\" \")\r\n else:\r\n print(a//b,end=\" \")", "a,b=map(int,input().split())\nk=a//b\nl=a%b\nfor i in range(b-l):\n print(k,end=' ')\nfor i in range(l):\n print(k+1,end=' ')\n", "\r\nn,m = map(int,input().split())\r\na=[]\r\nif n%m==0:\r\n for i in range(m):\r\n a.append(n//m)\r\nelse:\r\n for i in range(n%m):\r\n a.append(n//m+1)\r\n for i in range(m-(n%m)):\r\n a.append(n//m)\r\nprint(*a)\r\n", "bada,divide=map(int,input().split())\r\nchotu=bada//divide\r\n\r\n\r\nbadathan_chotu=int(bada/divide)+1\r\nbadasum=badathan_chotu*divide\r\nextranum=badasum-bada\r\nif bada//divide==bada/divide:print((str(chotu)+' ') *divide)\r\nelse:\r\n print( (str(chotu)+' ')*extranum ,end='')\r\n print((str(badathan_chotu)+' ') *(divide-extranum))\r\n\r\n\r\n # wowow aaj breakfast kia gharpe after so long", "n, m = map(int, input().split())\r\nfor i in range(0, m):\r\n print(n // m + (n % m != 0 and i < n % m), end = ' ')", "[n, m] = map(int, input().split())\n\nsmall = n//m\nnum_big = n%m\nlist = [\n\n]\nfor i in range(0, m-num_big):\n list.append(small)\nfor i in range(0, num_big):\n list.append(small+1)\n\nfor i in range(m):\n print(str(list[i]), end = \" \")", "n, m = input().split()\r\nans: list = []\r\ny: int = 0\r\nwhile int(n) > 0:\r\n x = (int(n) // int(m))\r\n ans.append(x)\r\n n = int(n) - int(x)\r\n m = int(m) - 1\r\nprint(*ans)\r\n", "a= input()\r\nn = int(a.split( )[0])\r\nm = int(a.split( )[1])\r\na = []\r\nk = n % m\r\nfor i in range(m):\r\n if(k > 0):\r\n a.append(int(n/m+1))\r\n k -= 1\r\n else:\r\n a.append(int(n/m))\r\ns = \"\"\r\nfor i in range(m):\r\n s = s + str(a[i]) + \" \"\r\nprint(s)", "n, m = map(int, input().split())\r\nk, d = n // m, n % m\r\nprint((str(k) + ' ') * (m - d) + (str(k + 1) + ' ') * d)", "n, m = map(int, input().split())\r\nans = [(n // m) for i in range(m)]\r\nfor i in range(n % m):\r\n ans[i] += 1\r\nprint(\" \".join(str(i) for i in ans))", "#!/usr/bin/env python\r\n# -*- coding: utf-8 -*-\r\n#\r\n# candies.py\r\n# \r\n# Copyright 2020 grant <grant@DESKTOP-EBFFL3R>\r\n# \r\n# This program is free software; you can redistribute it and/or modify\r\n# it under the terms of the GNU General Public License as published by\r\n# the Free Software Foundation; either version 2 of the License, or\r\n# (at your option) any later version.\r\n# \r\n# This program is distributed in the hope that it will be useful,\r\n# but WITHOUT ANY WARRANTY; without even the implied warranty of\r\n# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\r\n# GNU General Public License for more details.\r\n# \r\n# You should have received a copy of the GNU General Public License\r\n# along with this program; if not, write to the Free Software\r\n# Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston,\r\n# MA 02110-1301, USA.\r\n# \r\n# \r\n\r\n\r\ndef main(args):\r\n\tl = input().split(' ');\r\n\tn = int(l[0]);\r\n\tm = int(l[1]);\r\n\tl = [n // m for x in range(m)];\r\n\t\r\n\tif n % m != 0:\r\n\t\tfor i in range(n%m):\r\n\t\t\tl[i] = l[i] + 1;\r\n\t\r\n\tprint(*l);\r\n\t\t\r\n\t\t\r\n\r\nif __name__ == '__main__':\r\n import sys\r\n sys.exit(main(sys.argv))\r\n", "n,m=map(int,input().split())\r\nli=[]\r\ni=0\r\nfor j in range(m):\r\n li.append(0)\r\nwhile True:\r\n if i>=m:\r\n i=0\r\n li[i]+=1\r\n i+=1\r\n n-=1\r\n if n==0:\r\n break\r\nfor i in li:\r\n print(i,end=' ')", "n, m = map(int,input().split())\ns = []\nk = n //m\nl = n - (k * m)\ni = \"\"\nfor x in range(m):\n\ts.append(k)\nfor x in range(1, l + 1):\n\ts[-x] = k + 1\nfor x in s:\n\ti += str(x) + \" \"\nprint(i)\n", "n, m = list(map(int, input().split()))\nd = n // m\n\nfor i in range(m + 1):\n if i * d + (m - i) * (d + 1) == n:\n res = [d] * i + [d + 1] * (m - i)\n print(' '.join(map(str, res)))\n raise SystemExit\n\n \t\t\t\t\t\t\t\t \t\t\t \t\t \t \t \t\t\t \t \t", "a = input().split(\" \")\r\nn, m = int(a[0]), int(a[1])\r\nb = m - n%m\r\nsol = ([])\r\nfor i in range(b):\r\n sol.append(int((n+b)/m-1))\r\nfor i in range(m - b):\r\n sol.append(int((n+b)/m))\r\nprint(*sol)", "n,m=map(int,input().split())\r\nl=[n//m for i in range(m)]\r\nfor i in range(n%m):\r\n l[i]+=1\r\nl.sort()\r\nprint(' '.join(map(str,l)))", "n, m = map(int, input().split())\r\nif n % m == 0:\r\n print(m * f\"{n//m} \")\r\nelse:\r\n x = n - m * (n // m)\r\n for i in range(m):\r\n moo = n // m\r\n if x > 0:\r\n moo += 1\r\n x -= 1\r\n print(moo, end=\" \")", "n, m = map(int, input().split())\n\nq = n // m\nr = n % m\na = [q] * m\n\nfor i in range(r):\n a[i] += 1\n\na.sort() # Sorting the list 'a' in ascending order\n\nfor i in range(m):\n print(a[i], end=' ')\n", "n, m = map(int, input().split())\r\nwhile m>0:\r\n print(n//m, end=' ')\r\n n-=n//m\r\n m-=1", "c,f = map(int, input().split())\r\n\r\ne = c//f\r\nx = c%f\r\n\r\nfor i in range(f-x):\r\n print(e, end = \" \")\r\n\r\nfor i in range(x):\r\n print(e+1, end = \" \")", "m,n=map(int,input().split())\r\nrem=m%n\r\nif not rem:\r\n result=[m//n]*n\r\n print(*result)\r\n \r\nelse:\r\n result=[m//n]*n\r\n for x in range(rem):\r\n result[x]+=1\r\n \r\n print(*result)", "n, m = map(int, input().split())\nans = []\nif int(n % m) == 0:\n for i in range(m):\n ans.append(int(n / m))\nelse:\n ans = [0] * m\n s = sum(ans, 0)\n while s != n:\n for i in range(m):\n ans[i] += 1\n s = sum(ans, 0)\n if s == n:\n break\nans = sorted(ans)\nfor i in ans:\n print(i, end=' ')\n\n", "import math\n\nn, m = map(int, input().split())\ndiv = n/m\nans = [math.floor(div)] * (m-n%m)\nans += [math.ceil(div)] * (n%m)\n\n\nprint(*ans, sep = \" \")", "\r\n# -*- coding: utf-8 -*-\r\n# @Date : 2019-01-24 11:58:54\r\n# @Author : raj lath ([email protected])\r\n# @Link : link\r\n# @Version : 1.0.0\r\n\r\nfrom sys import stdin\r\n\r\nmax_val=int(10e12)\r\nmin_val=int(-10e12)\r\n\r\ndef read_int() : return int(stdin.readline())\r\ndef read_ints() : return [int(x) for x in stdin.readline().split()]\r\ndef read_str() : return input()\r\ndef read_strs() : return [x for x in stdin.readline().split()]\r\n\r\n\r\nnb_candies, nb_friends = read_ints()\r\ndiv, mod = divmod(nb_candies, nb_friends)\r\ndistribute = [div] * nb_friends\r\nfor i in range(1, mod+1):\r\n distribute[-i] += 1\r\nprint(*distribute)", "n, m = list(map(int, input().split()))\n\na = [int(n/m) for _ in range(m)]\n\nfor i in range(m-(n%m), m):\n a[i] = a[i]+1\n \nfor u in a:\n print(u, end=' ')\n\t\t\t \t\t\t \t \t \t \t\t \t \t", "[n,m] = map(int, input().split())\r\ncount=0\r\nfor i in range(0,(n%m)):\r\n count=count+1\r\n print(n//m+1, end=\" \")\r\nfor i in range(0,(m-n%m)): \r\n count=count+1\r\n print(n//m, end=\" \")\r\n ", "if __name__ == '__main__':\r\n n, m = [int(x) for x in input().split()]\r\n resto = n%m\r\n print(\" \".join(map(str,(m-resto)*[n//m]+(resto*[n//m+1]))))\r\n", "n, m = map(int, input().split())\r\nfor i in range(m):\r\n print(n // m, end = ' ')\r\n n -= n // m\r\n m -= 1", "n, m = map(int, input().split())\n\nc = n // m\nrem = n % m\n\nans = [c] * m\n\ni = 0\nwhile rem > 0:\n ans[i] += 1\n rem -= 1\n i += 1\n\nfor i in range(m):\n print(ans[i], end=' ')\nprint()\n", "n, m = [int(i) for i in input().split()]\r\nprint(*[n // m + 1 if i < n % m else n // m for i in range(m)])\r\n", "#!/bin/env python3\ntmp = input().split(\" \")\nn = int(tmp[0])\nm = int(tmp[1])\nd = n // m\nr = n % m\nprint(*([d] * (m - r)), *([d + 1] * r))", "n, m = [int(j) for j in input().split()]\r\nwhile n > 0:\r\n res = int(n / m)\r\n print(res, end = ' ')\r\n n -= res\r\n m -= 1\r\n", "# -*- coding: utf-8 -*-\r\n# Автор: Некрасов Станислав\r\n\r\nn, m = map(int, input().split())\r\nc, d = n // m, n % m\r\nprint(*[c + 1] * d, *[c] * (m - d))\r\n", "n, m = map(int, input().split())\r\nx = [n // m for _ in range(m)]\r\nfor j in range(n - n // m * m):\r\n x[j] += 1\r\nprint(\" \".join(map(str, x)))\r\n", "n,m = map(int,input().split())\r\nfor i in range(n%m):\r\n print((n//m)+1)\r\nfor i in range(m-n%m):\r\n print(n//m)", "a, b= [int(x) for x in input().split()]\r\nrem = 0\r\nif (a%b ==0):\r\n for r in range (b):\r\n print(f'{(a/b):g}', end = ' ')\r\nelse:\r\n rem = a%b\r\n for i in range (b-rem):\r\n print(f'{(a//b):g}', end = \" \")\r\n for e in range (rem):\r\n print(f'{((a//b)+1):g}', end =\" \")", "n, m = [int(a) for a in input().split()]\r\nl = n//m\r\nq = n % m\r\nlist=[]\r\n\r\nfor i in range(m-q):\r\n list.append(l)\r\nfor i in range(q):\r\n list.append((n-((m-q)*l))//q)\r\n\r\nfor i in list:\r\n print(i, end=\" \")", "def main():\r\n n,m = [int(v) for v in input().split()]\r\n v = n//m\r\n v2 = n%m\r\n print(\" \".join([str(r) for r in [v]*(m-v2)+ [v+1]*v2]))\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "from math import ceil\r\na, b = map(int, input().split())\r\nprint((ceil(a / (a / b)) - (a % b)) * (str(a // b) + ' '), end='')\r\nprint((a % b) * (str((a // b) + 1) + ' '))", "(candies,friends)=map(int,input().split())\r\n\r\ni=candies//friends\r\nfor v in range(friends-candies%friends):\r\n print(i,end=\" \")\r\nfor v in range(candies%friends):\r\n print(i+1,end=\" \")", "a,b = map(int, input().split(\" \"))\r\nl=[a//b+1]*(a%b) + [a//b]*(b-a%b)\r\nprint(*l)", "n, m = map(int, input().split())\r\nlst = [n//m for i in range(m)]\r\nfor i in range(n % m):\r\n lst[i] += 1\r\nprint(*lst)\r\n", "x, y = input().split()\r\nx, y = int(x), int(y)\r\nres = [x//y]*y\r\nleft_candies = x%y\r\nfor i in range(left_candies):\r\n ind = y - left_candies + i\r\n res[ind] = res[ind] +1\r\n\r\nfor i in res:\r\n print(i, end=\" \")", "\"\"\"\r\ninput:\r\n12 3\r\n\r\noutput:\r\n4 4 4\r\n\"\"\"\r\n\r\ndef main():\r\n n, m = input().split()\r\n n, m = int(n), int(m)\r\n output = []\r\n\r\n if n % m != 0:\r\n for _ in range(m):\r\n a = m-(n%m)\r\n output.append(int((n-(n%m))/m))\r\n output = output[:a] + [x+1 for x in output[a:]]\r\n else:\r\n for _ in range(m):\r\n output.append(int(n/m))\r\n\r\n print(*output)\r\n\r\nif __name__ == \"__main__\":\r\n main()", "[a,b] = map(int, input().split())\r\n\r\nq = int(a / b) \r\nq1 = int(a/b + 1)\r\nq2 = int(a//b) \r\nx = int(a%b)\r\n\r\nif x == 0:\r\n print(f\"{q} \" * b)\r\nelse:\r\n print((f\"{q2} \" * (b-x)) + (f\"{q1} \" * x))", "n,m=map(int,input().split())\r\nk=n//m\r\nl=[]\r\nfor i in range(m):\r\n l.append(k)\r\n n-=k\r\ni=1\r\nwhile(n):\r\n l[m-i]+=1\r\n i+=1\r\n n-=1\r\nfor i in l:\r\n print(i,end=' ')", "n,m = map(int,input().split())\r\nif n%m == 0:\r\n\tprint(m*(str(n//m)+\" \"))\r\nelse:\r\n\tr = n%m\r\n\ti = r\r\n\twhile i:\r\n\t\tprint(n//m+1,end=\" \")\r\n\t\ti = i - 1\r\n\tfor i in range(m-r):\r\n\t\tprint(n//m,end=\" \")", "n,m=map(int,input().split())\r\nc=n//m\r\nd=n%m\r\nl=[c for i in range(m)]\r\nfor i in range(d):\r\n l[i]=l[i]+1\r\nl.sort()\r\nprint(' '.join(map(str,l)))\r\n", "n, m = input().split()\r\nn = int(n)\r\nm = int(m)\r\nresDiv = n // m\r\ntemp = resDiv * m\r\ntemp = n - temp\r\ntemp = m - temp \r\nfor i in range(m):\r\n if temp == 0:\r\n print(resDiv + 1, end=\" \")\r\n else:\r\n print(resDiv, end=\" \")\r\n temp = temp - 1", "a,b=map(int,input().split())\r\nc=a//b\r\nd=a%b\r\ne=c+1 \r\nl=[]\r\nfor i in range(0,(b-d)):\r\n l.append(c)\r\nfor j in range(0,d):\r\n l.append(e)\r\nl=[str(u) for u in l]\r\nprint(' '.join(l))", "n,m=map(int,input().split())\r\nlst=[]\r\nbase_num=n//m\r\nextra=n%m\r\nfor i in range(m):\r\n lst.append(base_num)\r\nfor j in range(extra):\r\n lst[j]+=1\r\nlst.sort()\r\nfor k in lst:\r\n print(k,end=' ')\r\nprint()\r\n\r\n \r\n", "import math\r\nn, m = map(int, input().split())\r\ndiv = math.floor(n / m)\r\narr = [div] * m\r\ntemp = div * m\r\ndiff = n - temp\r\nfor i in range(len(arr)):\r\n diff -= 1\r\n if(diff < 0):\r\n break\r\n arr[i] += 1\r\narr.sort()\r\nprint(*arr)", "n, m = map(int, input().split())\n\ncandies = [n // m] * m\nfor i in range(n % m):\n candies[i] += 1\nprint(\" \".join([str(c) for c in candies]))\n", "\r\nn, m = map(int, input().split())\r\nres = []\r\nwhile m:\r\n res.append(n // m)\r\n n -= (n // m)\r\n m -= 1\r\nprint(*res)\r\n", "n,m = map(int,input().split())\r\n\r\nfor i in range(m):\r\n print(n//m,end=\" \")\r\n n = n-n//m\r\n m = m -1\r\n ", "from collections import Counter\nimport math\n\n\ndef T(): return int(input())\ndef S(): return str(input())\ndef A(): return list(map(int, input().split(\" \")))\ndef M(): return map(int, input().split(\" \"))\n\ndef gcd(a, b):\n if (a == 0):\n return b\n if (b == 0):\n return a\n if (a == b):\n return a\n if (a > b):\n return gcd(a-b, b)\n return gcd(a, b-a)\n\ndef binarySearch(n, a):\n l = 0\n h = len(a)-1\n ans = 0\n while l <= h:\n mid = (l+h)//2\n if a[mid] == n:\n return 1\n elif a[mid] > n:\n h = mid - 1\n else:\n l = mid + 1\n return ans\n\ndef sumOfNumbers(n):\n n = str(n)\n su = 0\n for i in n:\n su += int(i)\n return su\n\ndef lofint(n): return math.floor(math.log10(n))+1\n\nn, m = M()\nif n % m == 0:\n for i in range(m):\n print(str(n//m), end=\" \")\nelse:\n ceil = int(n/m)+1\n ans = ceil * m\n rem = ans - n\n for i in range(rem):\n print(ceil-1, end = \" \")\n for i in range(m-rem):\n print(ceil, end=\" \")\nprint()\n", "def main():\r\n from sys import stdin, stdout\r\n n, m = [int(i) for i in stdin.readline().split()]\r\n ans = []\r\n for i in range(m):\r\n x = n // m\r\n if i < n % m: x += 1\r\n ans.append(str(x))\r\n stdout.write(\" \".join(ans))\r\n\r\nif __name__ == \"__main__\":\r\n main()", "b=input()\r\nb=b.split(' ')\r\nfor i in range(2):\r\n b[i]=int(b[i])\r\ndiv=b[0]/b[1]\r\ntms=b[1]\r\ndiv=int(div)\r\ntu=[]\r\nfor i in range(tms):\r\n tu.append(div)\r\nb[0]=b[0]-div*b[1]\r\nif b[0]==0:\r\n for i in tu:\r\n print(i,end=' ')\r\nelse:\r\n indx=len(tu)-1\r\n while b[0]>0:\r\n tu[indx]=tu[indx]+1\r\n indx=indx-1\r\n b[0]=b[0]-1\r\n for i in tu:\r\n print(i,end=' ')\r\n#encoded as python author https://www.luogu.com.cn/user/517637", "n, m = map(int,input().split())\r\n\r\nif n/m == int(n/m):\r\n print(*[int(n/m) for _ in range(m)])\r\nelse:\r\n \r\n res = [n//m for _ in range(m-n%m)]\r\n res += [(n//m)+1 for _ in range(n%m)]\r\n \r\n print(*res)", "a,b=map(int,input().split())\r\nl=[]\r\nwhile(a>0):\r\n l.append(a//b)\r\n a=a-(a//b)\r\n b=b-1\r\nk=len(l)\r\nfor i in range(k):\r\n print(l[i],end=\" \")", "#!/usr/bin/env/python\r\n# -*- coding: utf-8 -*-\r\na, b = list(map(int, input().split()))\r\nres = [a // b] * b\r\nfor i in range(a % b):\r\n res[-i - 1] += 1\r\nfor r in res:\r\n print(r, end=' ')\r\n", "n, m = map(int,input().split())\r\na = n//m\r\nb = n%m\r\nprint((str(a)+\" \")*(m-b)+(str(a+1)+\" \")*b)", "n=list(map(int,input().split()))\r\nif(n[0]%n[1]==0):\r\n print((str((n[0]//n[1]))+' ') *n[1])\r\nelse:\r\n s=n[0]//n[1]\r\n v=n[0]%n[1]\r\n b=v*(str(s+1)+' ')\r\n w=n[1]-v\r\n print(w*(str(s)+' ')+b)\r\n", "n,m = map(int, input().split() )\nlist1 = list()\neqdiv = n//m\nrem = n-m*eqdiv\nfor i in range(m):\n list1.append(eqdiv)\nif rem:\n for i in range(rem):\n list1[i]+=1\nfor i in list1:\n print(str(i),end=\" \")\n #string+=str(i)+\" \"\nprint(\"\")\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\nif n%m==0:\r\n for i in range(m):\r\n l.append(n//m)\r\n print(*l)\r\nelse:\r\n for i in range(n%m):\r\n l.append((n//m)+1)\r\n for i in range(m-n%m):\r\n l.append(n//m)\r\n print(*l)", "n,m=map(int,input().split())\r\nl=[n//m for i in range(m)]\r\nz=n%m\r\nfor j in range(z):\r\n\tl[j]+=1\r\nprint(*l)", "\r\ns = input()\r\ns2 = s.split(' ')\r\nn = int(s2[0])\r\nm = int(s2[1])\r\n\r\nlst = []\r\n\r\nf = n // m\r\n\r\nfor i in range(m):\r\n lst.append(f)\r\n\r\nk = 0\r\nfor i in lst:\r\n k += i\r\n\r\nwhile k < n:\r\n for j in range(len(lst)):\r\n lst[j] += 1\r\n k += 1\r\n if not k < n:\r\n break\r\n\r\nfor item in lst[::-1]:\r\n print(item, end = ' ')", "I=[int(i) for i in input().split()]\r\nconf, friend = I[0], I[1]\r\nanswer=[]\r\nans=\"\"\r\nmod=conf%friend\r\nfor i in range(friend): answer.append(int((conf-mod)/friend))\r\nfor i in range(mod): answer[i]+=1\r\nfor i in range(friend): ans+=str(answer[i])+\" \"\r\nprint(ans[:-1])", "[n,m]=map(int,input().split())\r\nl=[n//m]*m\r\nr=n%m\r\nfor i in range(m-r,m):\r\n l[i]=l[i]+1\r\nprint(*l)", "C, F = map(int, input().split())\r\n\r\nwhile F > 0:\r\n c = C // F\r\n print(c, end=' ')\r\n F -= 1\r\n C -= c\r\n \r\n", "n, m = map(int, input().split())\n\nd = n//m\nresto = n % m\n# print(d, resto)\nf = [d for i in range(m)]\nfor i in range(resto):\n f[i]+=1\nf = sorted(f)\nprint(*f)\n", "n,m = map(int, input().split())\r\nl = [n//m]*(m-n%m) + [n//m+1]*(n%m)\r\nprint(*l)\r\n", "n,m=map(int,input().split())\r\nx=n//m\r\ny=n%m\r\nprint(' '.join([str(x+1)]*y+[str(x)]*(m-y)))", "(n, m) = map(int,input().split())\r\nfor i in range (m):\r\n print(n//m, end = \" \")\r\n n = n-n//m\r\n m = m-1", "m,n=map(int,input().split())\r\nresult=[m//n]*n\r\nfor x in range(m%n):\r\n result[x]+=1\r\n \r\nprint(*result)", "n, m=list(map(int, input().split()))\r\n\r\nanswer = list()\r\n\r\nans = n/m\r\nif n % m == 0:\r\n answer = list([n//m] * m)\r\nelse:\r\n min = n //m\r\n max = n // m + 1\r\n minList = list([min] * m)\r\n maxList = list([max] * m)\r\n for i in range(1, m):\r\n listSums = minList[:i] + maxList[i:]\r\n if sum(listSums) == n:\r\n answer = listSums\r\n break\r\n\r\nout = \" \".join(map(str, answer))\r\nprint(out)", "n, m = map(int, input().split())\r\nwhile n != 0:\r\n print(n//m, end=' ')\r\n n -= (n // m)\r\n m -= 1", "n,k=map(int,input().split()) \r\nv=n//k \r\nr=n%k\r\nl=[v]*k \r\nif(r==0):\r\n print(*l,sep=\" \")\r\nelse:\r\n a=l[-r:]\r\n a=[v+1]*r\r\n l[-r:]=a \r\n print(*l,sep=\" \")", "n,m=map(int,input().split())\r\nk=n//m\r\nrem=n%m\r\nans=[k]*m\r\nfor i in range(rem):\r\n ans[i]+=1\r\nprint(*ans) ", "n,m=list(map(int,input().split()))\r\nr=n%m\r\nv=n//m\r\nfor i in range(m-r):\r\n print(v,end=\" \")\r\nfor i in range(r):\r\n print(v+1,end=\" \")\r\n", "n,k=map(int,input().split())\r\nt=n%k \r\nm=(n-t)//k\r\nfor i in range(k):\r\n if t>0:\r\n t-=1 \r\n print(m+1,end=\" \")\r\n else:\r\n print(m,end=\" \")", "list=input().split(' ')\r\nfor i in range(2):\r\n list[i]=int(list[i])\r\na=list[0]//list[1]\r\nb=list[0]%list[1]\r\nlist2=[]\r\nfor i in range(list[1]):\r\n if list[1]-b<=i: list2.append(a+1)\r\n else: list2.append(a)\r\nfor i in range(len(list2)):\r\n print(\"%d\"%(list2[i]),end=' ')\r\n\r\n\r\n\r\n", "a,b = [int(x) for x in input().split()]\r\nn = int(a/b)\r\nx = []\r\nfor i in range(b-int(a%b)):\r\n x.append(n) \r\nfor i in range(a%b):\r\n x.append(n+1)\r\nfor ele in x: print(ele,end=\" \")", "n, m = map(int, input().split())\n\ndef get_candies(n,m) :\n mydiv = n // m\n mymod = n % m\n mylist = [ mydiv for _ in range(m) ]\n if mymod == 0 :\n out = ' '.join(str(i) for i in mylist)\n else :\n for i in mylist :\n mylist[mylist.index(i)] += 1\n mymod -= 1\n if mymod == 0 :\n out = ' '.join(str(i) for i in mylist)\n break\n return out\nres = get_candies(n,m)\nprint(res)\n", "n,m = map(int, input().split())\r\n\r\nlst = [n//m]*m\r\n\r\nfor i in range(n%m):\r\n\tlst[i] += 1\r\n\r\nfor i in lst:\r\n\tprint(i, end=' ')", "a,b=map(int,input().split())\r\nif a//b==a/b:\r\n for i in range(b):\r\n print(a//b,end=' ')\r\nelse:\r\n for i in range(b-a%b):\r\n print(a//b, end=' ')\r\n for j in range(a%b):\r\n print(a//b+1, end=' ')", "n, m = map(int, input().split())\r\n\r\n# distribute candies evenly among friends as much as possible\r\nquotient, remainder = divmod(n, m)\r\nfair_share = [quotient] * m\r\n\r\n# distribute the remaining candies (if any)\r\nfor i in range(remainder):\r\n fair_share[i] += 1\r\n\r\n# print the fair shares for each friend\r\nprint(*fair_share)\r\n", "if __name__ == '__main__':\n n, m = map(int, input().split())\n base = n // m\n resto = n % m\n res = []\n\n for i in range(m):\n if resto > 0:\n resto -= 1\n res.append(base+1)\n else:\n res.append(base)\n\n for i in res:\n print(i, end=\" \")\n \t\t \t\t \t\t \t \t\t\t \t \t \t \t", "def solve():\n b = [n // m for _ in range(m)]\n x = n % m\n for i in range(x):\n b[i] += 1\n return ' '.join(map(str, b))\n\n\ndef main():\n global n, m\n n, m = map(int, input().split())\n print(solve())\n\n\nmain()\n", "[x,y] = map(int,input().split())\r\n\r\nz = x%y\r\nz1 = x//y\r\n\r\nif z == 0:\r\n \r\n print(f\"{int(x/y)} \" * y)\r\n \r\nelse:\r\n print((f\"{z1} \" * (y-z)) + (f\"{z1+1} \" * z))\r\n ", "from math import ceil\r\nn,m = map(int,input().split())\r\nif n%m==0:\r\n print(f\"{n//m} \"*m)\r\nelse:\r\n a = n//m\r\n b = ceil(n/m)\r\n for i in range(1,n):\r\n if (a*i+b*(m-i))== n:\r\n print(f\"{a} \"*i+f\"{b} \"*(m-i))\r\n break\r\n", "wejscie= str(input())\r\ntablica1=[]\r\ntablica1=[int(x) for x in wejscie.split()]\r\nwynik= int()\r\nwynik= int(tablica1[0]/tablica1[1])\r\ndodatkowe= int(tablica1[0])-(wynik*int(tablica1[1]))\r\npart1= (\"%d \" % (wynik) * (int(tablica1[1])-dodatkowe))\r\npart2= (\"%d \" % (wynik+1) * dodatkowe)\r\nprint (part1[:-1],part2)", "import sys\r\nimport math\r\nimport collections\r\nimport heapq\r\nimport decimal\r\ninput=sys.stdin.readline\r\nn,m=(int(i) for i in input().split())\r\nl=[n//m for i in range(m)]\r\nfor i in range(n%m):\r\n l[i]+=1\r\nprint(*l)", "n,m=map(int,input().split(' '))\r\nk=n//m\r\ns=[k]*m\r\np=n%m\r\nfor i in range(p):\r\n\ts[i]+=1\r\nprint(*s)", "n, m = map(int, input().split())\r\n\r\nimport math\r\n\r\ndivi=n/m\r\nans = [math.floor(divi)] * (m-n%m)\r\nans+=[math.ceil(divi)] * (n%m)\r\n\r\nfor i in ans:\r\n\tprint(i,end=\" \")", "n, m = map(int, input().split())\r\n\r\nd = n // m\r\nfor i in range(m - n % m):\r\n print(d, end=\" \")\r\nfor i in range(n % m):\r\n print(d + 1, end=\" \")\r\nprint()\r\n", "a,b = input().split()\r\nl = [int(a)//int(b)]*int(b)\r\nc = int(a)%int(b)\r\ni = 0\r\nwhile i<c:\r\n l[i] += 1\r\n i += 1\r\nprint(*l)", "c, f = map(int, input().split())\ndistribution_list = []\nfor i in range(f):\n distribution_list.append(c//f)\nfor i in range(c%f):\n distribution_list[i]+=1\nans = str()\nfor i in range(len(distribution_list)-1):\n ans = ans + str(distribution_list[i]) + \" \"\nans += str(distribution_list[-1])\nprint(ans)", "x,y=map(int,input().split())\r\nif x%y==0:\r\n d = x//y\r\n s= y*( str(d) + \" \")\r\n \r\nelse:\r\n a = x%y\r\n b = x//y\r\n c = y-a\r\n s= c*(str(b) + \" \") + a*( str(b+1) + \" \") \r\n\r\n \r\nprint(s[:-1]) ", "n,m = map(int,input().split())\n\nrem = n % m\nq = n // m\n\ni = 0\nwhile i < rem:\n print(q + 1,end = \" \")\n i += 1\ni = 0\nwhile i < (m-rem):\n print(q,end = \" \")\n i += 1\n", "n, m=[int(k) for k in input().split(\" \")]\r\nres=[n//m for j in range(m)]\r\nfor j in range(n%m):\r\n res[j]+=1\r\nprint(\" \".join([str(k) for k in res]))", "def candies():\n n, m = list(map(int, input().split(' ')))\n\n output = []\n aux = n % m\n for _ in range(0, m):\n output.append(int(n / m + (1 if aux > 0 else 0)))\n aux = aux - 1 if aux >= 0 else 0\n\n print(' '.join(map(str,output[::-1])))\n\nif __name__ == \"__main__\":\n candies()\n", "n, m = map(int, input().split())\r\n\r\nans = [n // m for i in range(m)]\r\n\r\nfor i in range(n % m):\r\n ans[i] += 1\r\n\r\nprint(' '.join(map(str, ans)))\r\n", "n,k = map(int,input().split())\r\nimport math\r\na=[]\r\nwhile n:\r\n r= math.ceil(n/k)\r\n n-=r\r\n k-=1\r\n a.append(r)\r\na.sort()\r\nprint(\" \".join(str(i) for i in a))", "m,n=input().split()\nm=int(m)\nn=int(n)\nwhile(n!=0):\n if m%n:\n print(int(m/n))\n m=m-int(m/n)\n n -= 1\n else:\n for i in range(n):\n print(int(m/n))\n exit()\n", "n, m = input().split(' ')\nn, m = int(n), int(m)\nif (n%m == 0):\n for i in range(m):\n print(int(n/m), end=' ')\n print()\n exit(0)\ndiv_int = n//m\nrest= n%m\nfor i in range(m):\n if rest:\n print(div_int+1, end=' ')\n rest-=1\n else:\n print(div_int, end=' ')\nprint()\n \t \t\t\t \t\t\t\t\t\t\t \t \t\t \t\t \t", "\r\nn, m = map(int, input().split())\r\nl = [n // m] * m\r\n\r\nfor i in range(n % m):\r\n\tl[i] += 1\r\n\r\nprint(*l)", "n,m=map(int,input().split())\r\nl1=[]\r\nfor i in range(m,0,-1):\r\n\tquo=n//i\r\n\tn-=quo\r\n\tl1.append(quo)\r\nfor i in range(len(l1)):\r\n\tprint(l1[i],end=' ')" ]

[ "def main():\r\n n, a, b = map(int, input().split())\r\n line = input()\r\n spaces = [len(e) for e in line.split('*') if e]\r\n ca, cb = a, b\r\n for e in spaces:\r\n if e % 2 != 0:\r\n if ca > cb:\r\n cb -= e // 2\r\n ca -= e - e // 2\r\n else:\r\n ca -= e // 2\r\n cb -= e - e // 2\r\n else:\r\n ca -= e // 2\r\n cb -= e // 2\r\n\r\n ca = max(0, ca)\r\n cb = max(0, cb)\r\n \r\n print(a - ca + b - cb)\r\n \r\n \r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "import sys\r\nfrom itertools import groupby\r\n\r\nn, a, b = map(int, input().split())\r\ntotal = a+b\r\nfor k, v in groupby(input()):\r\n if k == '*':\r\n continue\r\n m = len(list(v))\r\n if a > b:\r\n a -= (m+1) // 2\r\n b -= m // 2\r\n else:\r\n b -= (m+1) // 2\r\n a -= m // 2\r\n\r\na = max(a, 0)\r\nb = max(b, 0)\r\nprint(total - a - b)\r\n", "\r\ndef Slove():\r\n\r\n n,a,b=map(int,input().split())\r\n \r\n \r\n ept=[]\r\n\r\n for i in map(len,input().split('*')):\r\n if(i>0):\r\n ept.append(i)\r\n \r\n s=a+b\r\n for x in ept:\r\n if a< b:\r\n a,b=b,a\r\n b-=min(b, x//2)\r\n a-=min(a, x-x//2)\r\n return s-(a+b)\r\n\r\nprint(Slove())", "n,a,b=map(int,input().split())\r\ns=0 \r\nt=0 \r\nfor x in map(len,input().split('*')):\r\n s+=x//2 \r\n t+=x%2 \r\nm=min(s,a)+min(s,b)\r\nprint(m+min(a+b-m,t))\r\n", "n, a, b = map(int, input().split(' '))\ntot = a + b\nlens = [len(s) for s in input().split('*')]\n\nfor l in lens:\n if a > b:\n if l % 2 == 1:\n a -= min(a, (l+1)//2)\n else:\n a -= min(a, l//2)\n b -= min(b, l//2)\n else:\n a -= min(a, l//2)\n if l % 2 == 1:\n b -= min(b, (l+1)//2)\n else:\n b -= min(b, l//2)\n\nprint(tot - a - b)\n", "n, a, b = map(int, input().split())\r\ns = str(input())\r\nX = []\r\ncnt = 0\r\ncur =s[0]\r\nfor c in s:\r\n if c == cur:\r\n cnt += 1\r\n else:\r\n if cur == '.':\r\n X.append(cnt)\r\n cur = c\r\n cnt = 1\r\nelse:\r\n if cur == '.' and cnt:\r\n X.append(cnt)\r\n#print(X)\r\nans = 0\r\nfor x in X:\r\n m, l = x//2, x-x//2\r\n if a >= b:\r\n ans += min(l, a)\r\n a -= min(l, a)\r\n ans += min(m, b)\r\n b -= min(m, b)\r\n else:\r\n ans += min(m, a)\r\n a -= min(m, a)\r\n ans += min(l, b)\r\n b -= min(l, b)\r\n #print(a, b)\r\nprint(ans)\r\n", "n, a, b = map(int,input().split())\ns = []\ns = list(input())\nfor i in range(n):\n if s[i] == '.':\n if (a > b and s[i-1] != 'A' or s[i-1] == 'B') and a > 0:\n s[i] = 'A'\n a -= 1\n elif (b >= a and s[i-1] != 'B' or s[i-1] == 'A') and b > 0:\n s[i] = 'B'\n b -= 1\nsum = 0\nfor i in range(n):\n if s[i] == 'A' or s[i] =='B':\n sum += 1\nprint(sum)\n", "#!/usr/bin/env python3\nfrom typing import Dict, List, Tuple\n\n\ndef input_lst() -> List[int]:\n return [int(x) for x in input().split()]\n\ndef print_out(res: List[int]):\n print(' '.join([str(x) for x in res]))\n\ndef main():\n n, a, b = (int(x) for x in input().split())\n #x = int(input())\n #res = [0]\n #a = input_lst()\n s = list(input())\n\n places = []\n cur_place_count = 0\n for el in s:\n if el == '*':\n if cur_place_count > 0:\n places.append(cur_place_count)\n cur_place_count=0\n else:\n cur_place_count+=1\n\n if cur_place_count > 0:\n places.append(cur_place_count)\n\n places.sort(reverse=True)\n\n #print(places)\n sum_to_seat = 0\n last_place = 0\n for pl in places:\n\n people_to_seat_team = min(pl // 2, min(a, b))\n a-=people_to_seat_team\n b-=people_to_seat_team\n sum_to_seat += people_to_seat_team * 2\n pl -= people_to_seat_team * 2\n if pl == 1:\n if a > b:\n if a>0:\n a-=1\n sum_to_seat+=1\n else:\n if b > 0:\n b-=1\n sum_to_seat+=1\n else:\n if a == 0:\n people_to_seat_team = min(pl // 2 + (pl % 2), b)\n sum_to_seat += people_to_seat_team\n b-=people_to_seat_team\n elif b == 0:\n people_to_seat_team = min(pl // 2 + (pl % 2), a)\n sum_to_seat += people_to_seat_team\n a-=people_to_seat_team\n\n\n print(sum_to_seat)\n\n\n\n\n\n\n\n\n\n\n\n\n\n #print_out(res)\n\n\nif __name__ == '__main__':\n main()\n", "import sys \r\nimport math as mt\r\nimport bisect\r\n#input=sys.stdin.readline\r\n#t=int(input())\r\nt=1 \r\n \r\ndef solve(n,a,b):\r\n x=a+b\r\n if a<b:\r\n a,b=b,a\r\n for i in range(len(l)):\r\n if l[i]%2==0:\r\n a-=l[i]//2\r\n b-=l[i]//2\r\n else:\r\n a-=(l[i]//2+1)\r\n b-=(l[i]//2)\r\n if b>a:\r\n a,b=b,a\r\n if a>0:\r\n x-=a\r\n if b>0:\r\n x-=b\r\n return x \r\n \r\n \r\n \r\n \r\n \r\n \r\nfor _ in range(t):\r\n #n=int(input())\r\n #a=int(input())\r\n #b=int(input())\r\n n,a,b=map(int,input().split())\r\n #x,y,k=map(int,input().split())\r\n #n,h=(map(int,input().split()))\r\n #l=list(map(int,input().split()))\r\n #l2=list(map(int,input().split()))\r\n s=input()\r\n l=[]\r\n cnt=0\r\n for i in range(len(s)):\r\n if s[i]=='.':\r\n cnt+=1\r\n else:\r\n if cnt>0:\r\n l.append(cnt)\r\n cnt=0\r\n if cnt>0:\r\n l.append(cnt)\r\n print(solve(n,a,b))", "n, a, b = map(int, input().split())\r\nd = input()\r\nu = []\r\nk = 0\r\nfor i in range(n):\r\n if d[i] == '*':\r\n if k != 0:\r\n u.append(k)\r\n k = 0\r\n else:\r\n k += 1\r\nif k != 0:\r\n u.append(k)\r\n k = 0\r\nans = 0\r\nfor i in u:\r\n if a > b: a, b = b, a\r\n am = min(a, i // 2)\r\n bm = min(b, i - i // 2)\r\n ans += am + bm\r\n a -= am\r\n b -= bm\r\nprint(ans)\r\n", "n, a, p=[int(i) for i in input().split()]\r\nt=a+p\r\ng=[]\r\ne=[input()]\r\nfor i in range(n):\r\n g.append(e[0][i])\r\nfor i in range(n):\r\n if i > 0 and g[i]!=\"*\":\r\n if g[i]==\".\" and g[i-1]==\"*\" and a >= p and a > 0:\r\n a-=1\r\n g[i]=\"a\"\r\n elif g[i]==\".\" and g[i-1]==\"*\" and p > a and p > 0:\r\n p-=1\r\n g[i]=\"p\"\r\n elif g[i]==\".\" and g[i-1]!=\"p\" and p > 0 :\r\n p-=1\r\n g[i]=\"p\"\r\n elif g[i]==\".\" and g[i-1]!=\"a\" and a > 0 :\r\n a-=1\r\n g[i]=\"a\"\r\n elif i==0 and g[i]==\".\":\r\n if a >= p:\r\n a-=1\r\n g[i]=\"a\"\r\n else:\r\n if p > a:\r\n p-=1\r\n g[i]=\"p\"\r\nprint(t-(a+p))", "def solve():\r\n _, a, b = [int(elm) for elm in input().strip().split()]\r\n strips = [len(tok) for tok in input().strip().split('*') if len(tok) > 0]\r\n a_left, b_left = a, b\r\n for s in strips:\r\n if s % 2 == 0:\r\n a_hit = b_hit = s // 2\r\n else:\r\n smaller = s // 2\r\n a_hit = smaller if a_left < b_left else s - smaller\r\n b_hit = s - a_hit\r\n a_left = max(0, a_left - a_hit)\r\n b_left = max(0, b_left - b_hit)\r\n print(a + b - a_left - b_left)\r\n\r\n\r\n\r\n\r\nsolve()", "n, a, b = map(int, input().split())\ns, c, d, e, f = input() + '*', [], 0, 0, 0\nfor i in s:\n\tif i == '.':\n\t\td += 1\n\telse:\n\t\tif d > 0:\n\t\t\tc.append(d) \n\t\t\tf += d\n\t\t\tif d & 1:\n\t\t\t\te += 1\n\t\td = 0\nf -= e\nx = min(a, f // 2)\ny = min(b, f // 2)\nd += x + y\na -= x\nb -= y\nx = min(a, e)\nd += x\na -= x\ne -= x\ny = min(b, e)\nd += y\nprint(d)", "n ,a,b= map(int, input().split())\r\n\r\n\r\ndata = str(input())\r\n\r\n__len = 0\r\nans = 0\r\nprev = -1\r\n\r\nfor el in data:\r\n if el == '.':\r\n if prev == -1:\r\n if a >= b and a!=0:\r\n prev = 0\r\n ans+=1\r\n a -= 1\r\n \r\n else:\r\n if b >= a and b !=0:\r\n prev = 1\r\n ans+=1\r\n b -= 1\r\n\r\n continue\r\n \r\n if prev == 0:\r\n if b > 0:\r\n b -= 1\r\n ans += 1\r\n prev = 1\r\n else:\r\n prev = - 1\r\n continue\r\n\r\n if prev == 1:\r\n if a > 0:\r\n a -= 1\r\n ans += 1\r\n prev = 0\r\n\r\n else:\r\n prev = -1\r\n\r\n continue\r\n\r\n\r\n else:\r\n prev = -1\r\n\r\n\r\nprint(ans)\r\n \r\n", "n,a,b=map(int,input().split())\r\nt=a+b\r\nfor x in map(len,input().split('*')):\r\n if a<b:a,b=b,a\r\n b-=min(b,x//2);a-=min(a,x-x//2)\r\nprint(t-a-b)", "n, a, b = map(int, input().split())\r\ns = input().split(\"*\")\r\ns = sorted(s, key=lambda x: len(x), reverse=True)\r\ns = list(filter(lambda x: len(x) > 0, s))\r\nnum = 0\r\nfor i in range(len(s)):\r\n k = len(s[i])\r\n if k % 2 == 0:\r\n num += min(k // 2, a)\r\n a -= k // 2\r\n if a < 0:\r\n a = 0\r\n\r\n num += min(k // 2, b)\r\n b -= k // 2\r\n if b < 0:\r\n b = 0\r\n\r\n else:\r\n if a >= b:\r\n num += min(k // 2 + 1, a)\r\n a -= k // 2 + 1\r\n if a < 0:\r\n a = 0\r\n\r\n num += min(k // 2, b)\r\n b -= k // 2\r\n if b < 0:\r\n b = 0\r\n else:\r\n num += min(k // 2, a)\r\n a -= k // 2\r\n if a < 0:\r\n a = 0\r\n\r\n num += min(k // 2 + 1, b)\r\n b -= k // 2 + 1\r\n if b < 0:\r\n b = 0\r\n\r\n\r\nprint(num)\r\n", "n, a, b = [int(i) for i in input().split()]\r\npi3da = input()\r\nsum = a + b\r\nfor xu7 in map(len, pi3da.split(\"*\")):\r\n if b < a:\r\n a, b = b, a\r\n a -= min(a, xu7//2)\r\n b -= min(b, xu7 - xu7//2)\r\nprint(sum - a - b)", "n,a,b=[int(x) for x in input().split()]\r\ns=input()\r\nall=a+b\r\nl=0\r\nls=[]\r\nfor c in s:\r\n if c=='*': # you add when you meet a change , then you clear to 0\r\n if l!=0:\r\n ls.append(l)\r\n l=0\r\n else: # add\r\n l+=1\r\nif l!=0: # out bound is a change itself\r\n ls.append(l)\r\ndef rem(room,a,b):\r\n if room%2==0:\r\n return a-room//2,b-room//2\r\n if a>b:\r\n return a-(room-1)//2-1,b-(room-1)//2\r\n return a - (room - 1) // 2, b - (room - 1) // 2 - 1\r\nfor ll in ls:\r\n a,b=rem(ll,a,b)\r\nprint(all-max(a,0)-max(b,0))", "n,a,b = [int(i) for i in input().split()]\r\nss = a + b\r\nst = input()\r\nfor ez in st.split(\"*\"):\r\n\tif(a > b):\r\n\t\ta,b = b,a\r\n\ta -= min(a , len(ez)//2)\r\n\tb -= min(b , len(ez) - len(ez)//2)\r\nprint(ss - a - b)", "from math import *\n#t = int(input())\nm = []\ns = []\nfor i in range(1):\n x = list(map(int, input().split()))\n m.append(x)\n s.append(input())\nflag = -1\nfor i in range(1):\n a = m[i][1]\n b = m[i][2]\n t = s[i]\n l = 0\n count = 0\n for j in range(m[i][0]):\n countp = count\n if a >= b:\n flag = 1\n else:\n flag = 2\n if t[j] == '.' and l ==2 and a>=1:\n a = a - 1\n if a >= b:\n flag = 1\n else:\n flag = 2\n count = count + 1\n l = 1\n elif t[j] == '.' and l == 1 and b>=1:\n b = b - 1\n if a >= b:\n flag = 1\n else:\n flag = 2\n count = count + 1\n l = 2\n elif t[j] == '.' and l==0:\n if flag == 1 and a>=1:\n a = a - 1\n if a >= b:\n flag = 1\n else:\n flag = 2\n count = count + 1\n l = 1\n elif flag== 2 and b>=1:\n b = b - 1\n if a >= b:\n flag = 1\n else:\n flag = 2\n count = count + 1\n l = 2\n elif t[j] == '*':\n l = 0\n if countp == count:\n l = 0\n print(count)\n\n\n\n", "n,x,y=map(int,input().split())\r\na=list(map(len,input().split('*')))\r\nt=x+y\r\nfor i in a:\r\n if x>y:\r\n x,y=y,x\r\n x-=min(i//2,x)\r\n y-=min(i-i//2,y)\r\nprint(t-x-y)", "n, a, b = map(int, input().split())\r\ns = input()\r\nans = 0\r\ni = 0\r\nwhile i < n:\r\n if a < b:\r\n a, b = b, a\r\n while s[i] == '.' and i < n:\r\n if a > 0:\r\n ans += 1\r\n a -= 1\r\n a, b = b, a\r\n i += 1\r\n if i == n:\r\n break\r\n i += 1\r\n if i == n:\r\n break\r\nprint(ans)", "n,a,b = list(map(int,input().split(' ')))\r\ns = input()\r\nc = list()\r\nres = 0\r\nss = 0\r\nfor i in range(n):\r\n if s[i]=='*':\r\n if ss != 0:\r\n c.append(ss)\r\n ss = 0\r\n else:\r\n ss += 1\r\nif ss != 0:\r\n c.append(ss)\r\nc.sort()\r\nn = len(c)\r\n\r\nss1 = 0\r\nss2 = 0\r\nrrr = 0\r\nfor i in range(n):\r\n ss1 += c[i] // 2\r\n ss2 += c[i] // 2 \r\n if c[i]%2 != 0:\r\n rrr += 1\r\n##print(ss1,ss2,rrr)\r\n\r\na,b = min(a,b),max(a,b)\r\nrrr1 = a-ss1\r\nif rrr1 > 0:\r\n if rrr >= rrr1:\r\n ss1 += rrr1\r\n ss2 += rrr-rrr1\r\n else:\r\n ss1 += rrr\r\nelse:\r\n ss2 += rrr\r\n##ss1 += min(rrr1,rrr)\r\n##rrr -= rrr1\r\n##ss2 += min(0,rrr)\r\n\r\nres = min(ss1,a) + min(ss2,b)\r\nprint(res)\r\n", "\r\nn,a,b=list(map(int,input().split()))\r\nz=list(input())\r\nz.append('*')\r\ns=0\r\nk=0\r\nfor i in range(len(z)):\r\n if z[i]=='.':\r\n k+=1\r\n elif k>0:\r\n if (a > 0 or b > 0) and k % 2 == 0:\r\n for j in range(k // 2):\r\n if a > 0:\r\n s += 1\r\n a -= 1\r\n if b > 0:\r\n s += 1\r\n b -= 1\r\n elif a > 0 or b > 0:\r\n if a > 0 and a >= b:\r\n for j in range(k // 2):\r\n if a > 0:\r\n s += 1\r\n a -= 1\r\n if b > 0:\r\n s += 1\r\n b -= 1\r\n if a > 0:\r\n s += 1\r\n a -= 1\r\n elif b > 0:\r\n for j in range(k // 2):\r\n if b > 0:\r\n s += 1\r\n b -= 1\r\n if a > 0:\r\n s += 1\r\n a -= 1\r\n if b > 0:\r\n s += 1\r\n b -= 1\r\n k=0\r\n\r\nprint(s)\r\n", "n,a,b = [int(x) for x in input().split()]\r\ns = [i for i in input()]\r\nif a < b:\r\n a,b = b,a\r\npreva = False\r\nprevb = False\r\nans = 0\r\nfor i in range(n):\r\n if s[i] == '*':\r\n preva = False\r\n prevb = False\r\n else:\r\n if preva == False and a > 0:\r\n a -= 1\r\n ans += 1\r\n preva = True\r\n prevb = False\r\n elif prevb == False and b > 0:\r\n b -= 1\r\n ans += 1\r\n preva = False\r\n prevb = False\r\n else:\r\n preva = False\r\n preva = False\r\nprint(ans)\r\n \r\n", "x=input().split()\r\ny=input()\r\nn=int(x[0])\r\na=int(x[1])\r\nb=int(x[2])\r\neldoor=0\r\ni=0\r\nwhile i < n and a+b>0:\r\n if y[i]==\"*\":\r\n eldoor=0\r\n i=i+1\r\n else:\r\n if eldoor==1 :\r\n if a>=1:\r\n a=a-1\r\n eldoor=2\r\n i=i+1\r\n else:\r\n eldoor=2\r\n i=i+1\r\n elif eldoor==2:\r\n if b>=1:\r\n b=b-1\r\n eldoor=1\r\n i=i+1\r\n else:\r\n eldoor=1\r\n i=i+1\r\n else:\r\n if a > b :\r\n \r\n if a>=1:\r\n a=a-1\r\n eldoor=2\r\n i=i+1\r\n else:\r\n if b>=1:\r\n b=b-1\r\n eldoor=1\r\n i=i+1\r\nprint(int(x[1])+int(x[2])-a-b) ", "n,a,b=map(int,input().split())\r\nl=[]\r\ns=a+b\r\nch=input()\r\nc=0\r\nfor i in range(n):\r\n if ch[i]==\".\":\r\n c+=1\r\n if (ch[i]==\".\" and i==n-1) or ch[i]!=\".\":\r\n l.append(c)\r\n c=0\r\nl.sort()\r\nl.reverse()\r\ni=0\r\nle=len(l)\r\nwhile(i<le and a+b>0):\r\n if l[i]%2==0:\r\n a=max(a-(l[i]//2),0)\r\n b=max(b-(l[i]//2),0)\r\n else:\r\n if a>b:\r\n a=max(a-1-(l[i]//2),0)\r\n b=max(b-(l[i]//2),0)\r\n else:\r\n a=max(a-(l[i]//2),0)\r\n b=max(b-1-(l[i]//2),0)\r\n i+=1\r\nprint(s-a-b)\r\n \r\n", "n, a, b = map(int, input().split())\r\ns = input()\r\nans = 0\r\n\r\nprog = a\r\nath = b\r\no = list(map(len, s.split('*')))\r\n\r\nfor i in o:\r\n if i % 2 == 0:\r\n prog -= i // 2\r\n ath -= i // 2\r\n else:\r\n if prog > ath:\r\n prog -= i // 2 + 1\r\n ath -= i // 2\r\n else:\r\n prog -= i // 2\r\n ath -= i // 2 + 1\r\n\r\nprint(a - max(prog, 0) + b - max(ath, 0))\r\n", "zzz=input().split(' ')\r\nmas=list(input())\r\nx1=int(zzz[1]) # программисты\r\nx2=int(zzz[2]) # спортсмены\r\nn1=0\r\nn2=0\r\nfor i in range(len(mas)):\r\n if mas[i]!='*':\r\n if(n1==0 and x1>=x2 and x1>0) or (n1!=0 and mas[i-1]!=1 and x1>0):\r\n mas[i]=1\r\n x1-=1\r\n n2+=1\r\n elif(n1==0 and x2> x1 and x2>0) or (n1!=0 and mas[i-1]!=0 and x2>0):\r\n mas[i]=0\r\n x2-=1\r\n n2+=1\r\n n1+=1\r\n else:\r\n n1=0\r\nprint(n2)\r\n\r\n\"\"\"\r\nprint()\r\nprint(\"|\\////.....KISH\")\r\nprint(\"O----O.....OTSUDA\")\r\nprint(\"/ / .....BLET\")\r\ninput()\r\n\"\"\"\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn, a, b = map(int, input().split())\r\ns = list(input().rstrip())\r\nx = []\r\nc = 0\r\nfor i in s:\r\n if i == \"*\":\r\n if c:\r\n x.append(c)\r\n c = 0\r\n else:\r\n c += 1\r\nif c:\r\n x.append(c)\r\nans = 0\r\nfor i in x:\r\n if a >= b:\r\n a0, b0 = min((i + 1) // 2, a), min(i // 2, b)\r\n else:\r\n a0, b0 = min(i // 2, a), min((i + 1) // 2, b)\r\n ans += a0 + b0\r\n a -= a0\r\n b -= b0\r\nprint(ans)", "n, a, b = map(int, input().split())\r\ns = input()\r\nresult = a+b\r\nprevious = ''\r\nfor i in range(len(s)):\r\n if s[i] == '.':\r\n if previous == 'a':\r\n previous = 'b'\r\n b -= 1\r\n elif previous == 'b':\r\n previous = 'a'\r\n a -= 1\r\n elif a > b:\r\n previous = 'a'\r\n a -= 1\r\n else:\r\n previous = 'b'\r\n b -= 1\r\n else:\r\n previous = '*'\r\n\r\nprint(result - max(0, a) - max(0, b))\r\n\r\n", "s = [int (i) for i in input().split()];\r\n\r\nn = s[0];\r\n\r\na = s[1];\r\n\r\nb = s[2];\r\n\r\ns1 = input();\r\n\r\nflag1 = 0;\r\nflag2 = 0;\r\ntotal = 0;\r\nfor i in range(0, len(s1)):\r\n if(a >= b and a != 0):\r\n if(s1[i] == '.' and a > 0 and flag1 == 0):\r\n\r\n a -= 1;\r\n flag1 = 1;\r\n flag2 = 0;\r\n total += 1;\r\n elif(s1[i] == '.' and b > 0 and flag2 == 0):\r\n b -= 1;\r\n total += 1;\r\n flag2 = 1;\r\n flag1 = 0;\r\n elif(s1[i] == '*'):\r\n flag1 = 0;\r\n flag2 = 0;\r\n else:\r\n flag1 = 0;\r\n flag2 = 0;\r\n elif (b!= 0 and b > a):\r\n if (s1[i] == '.' and b > 0 and flag2 == 0):\r\n b -= 1;\r\n total += 1;\r\n flag2 = 1;\r\n flag1 = 0;\r\n elif (s1[i] == '.' and a > 0 and flag1 == 0):\r\n a -= 1;\r\n flag1 = 1;\r\n flag2 = 0;\r\n total += 1;\r\n elif (s1[i] == '*'):\r\n flag1 = 0;\r\n flag2 = 0;\r\n else:\r\n flag1 = 0;\r\n flag2 = 0;\r\n else:\r\n break;\r\nprint(total);\r\n", "_, m, n = map(int, input().split())\nt = m+n\na = [len(s) for s in input().split('*')]\nfor x in a:\n m -= x // 2\n n -= x // 2\n if m > n:\n m -= x % 2\n else:\n n -= x % 2\n m = max(m, 0)\n n = max(n, 0)\nprint(t - (m+n))\n", "n,a,b = map(int,input().split())\r\nS = input()\r\nA = list(S.split(\"*\"))\r\nA = [len(A[i]) for i in range(len(A))]\r\na,b = min(a,b),max(a,b)\r\nres = 0\r\n\r\ni = 0\r\nwhile (a+b>0 and i<len(A)):\r\n a,b = min(a,b),max(a,b)\r\n if A[i]%2 == 0:\r\n res += min(a,A[i]//2) + min(b,A[i]//2)\r\n a -= min(a,A[i]//2)\r\n b -= min(b,A[i]//2)\r\n else:\r\n res += min(a,A[i]//2) + min(b,A[i]//2 + 1)\r\n a -= min(a,A[i]//2)\r\n b -= min(b,A[i]//2 + 1)\r\n i += 1\r\nprint(res)\r\n \r\n", "n,a,b = map(int,input().split())\r\nlis = input()+'#'\r\nans=[]\r\nc=0\r\nfor i in range(n+1):\r\n if lis[i]=='.':\r\n c+=1\r\n else:\r\n if c>0:\r\n ans.append(c) \r\n c=0 \r\nan=0\r\nfor i in ans:\r\n a,b = max(a,b),min(a,b)\r\n if i%2==0:\r\n t=min(a,i//2)\r\n a-=t\r\n an+=(t+min(i//2,b))\r\n b-=min(t,b)\r\n else:\r\n t=min(a,i//2 + 1)\r\n a-=t\r\n an+=t+min(b,i//2)\r\n b-=min(i//2,b)\r\nprint(an) \r\n\r\n\r\n", "n,a,b=map(int,input().split())\r\ns=input()\r\nsegments=[]\r\nc=0\r\npre='.'\r\nfor i in range(len(s)):\r\n\tif pre==s[i]:\r\n\t\tc+=1\r\n\telse:\r\n\t\tif c>0:\r\n\t\t\tsegments.append(c)\r\n\t\t\tc=0\r\nif c>0:\r\n\tsegments.append(c)\r\nans=0\r\nsegments=sorted(segments,reverse=True)\r\nfor i in segments:\r\n\tif i%2==0:\r\n\t\txx=i//2\r\n\t\tif xx<=a:\r\n\t\t\ta-=xx\r\n\t\t\tans+=xx\r\n\t\telse:\r\n\t\t\tans+=a \r\n\t\t\ta=0\r\n\t\tif xx<=b:\r\n\t\t\tb-=xx \r\n\t\t\tans+=xx \r\n\t\telse:\r\n\t\t\tans+=b\r\n\t\t\tb=0\r\n\telse:\r\n\t\tif a>b:\r\n\t\t\txx=(i//2)+1\r\n\t\t\tif xx<=a:\r\n\t\t\t\ta-=xx\r\n\t\t\t\tans+=xx\r\n\t\t\telse:\r\n\t\t\t\tans+=a \r\n\t\t\t\ta=0\r\n\t\t\tyy=i-xx\r\n\t\t\tif yy<=b:\r\n\t\t\t\tb-=yy\r\n\t\t\t\tans+=yy\r\n\t\t\telse:\r\n\t\t\t\tans+=b\r\n\t\t\t\tb=0\r\n\t\telse:\r\n\t\t\txx=(i//2)+1\r\n\t\t\tif xx<=b:\r\n\t\t\t\tb-=xx\r\n\t\t\t\tans+=xx\r\n\t\t\telse:\r\n\t\t\t\tans+=b \r\n\t\t\t\tb=0\r\n\t\t\tyy=i-xx\r\n\t\t\tif yy<=a:\r\n\t\t\t\ta-=yy\r\n\t\t\t\tans+=yy\r\n\t\t\telse:\r\n\t\t\t\tans+=a\r\n\t\t\t\ta=0\r\nprint(ans)", "'''input\r\n3 2 3\r\n***\r\n'''\r\nn, a, b = [int(i) for i in input().split(\" \")]\r\ns = [i for i in input()]\r\n\r\nl = []\r\nfor i in range(n):\r\n\tif s[i] == '*':\r\n\t\tl.append(i)\r\n\t\tbreak\r\nj = i\r\nwhile(j < n - 1):\r\n\tj += 1\r\n\tif s[j] == \"*\":\r\n\t\tl.append(j - i - 1)\r\n\t\ti = j\r\n#print(l)\r\nif s[-1] == \".\":\r\n\tj = n - 1\r\n\tll = 0\r\n\twhile s[j] != '*' and j >= 0:\r\n\t\tj -= 1\r\n\t\tll += 1\r\n\tl.append(ll)\r\n#print(l)\r\nl.sort()\r\nans = 0\r\nfor p in l:\r\n\tif p % 2 == 0:\r\n\t\tna = min(a, p // 2)\r\n\t\tnb = min(b, p // 2)\r\n\t\tans += na + nb\r\n\t\ta -= na\r\n\t\tb -= nb\r\n\telse:\r\n\t\tif a > b:\r\n\t\t\tna = min(a, (p + 1) // 2)\r\n\t\t\tnb = min(b, p // 2)\r\n\t\t\tans += na + nb\r\n\t\t\ta -= na\r\n\t\t\tb -= nb\r\n\t\telse:\r\n\t\t\tna = min(a, p // 2)\r\n\t\t\tnb = min(b, (p + 1) // 2)\r\n\t\t\tans += na + nb\r\n\t\t\ta -= na\r\n\t\t\tb -= nb\r\nprint(ans)\r\n\r\n\r\n\r\n\r\n", "n, a, b = map(int, input().split())\r\ncarriages = input().split('*')\r\n\r\n\r\nstudents_number = 0\r\n\r\nfor carriage in carriages:\r\n seats_count = len(carriage)\r\n if seats_count % 2 == 0:\r\n a_students = min(a, seats_count // 2)\r\n b_students = min(b, seats_count // 2)\r\n a -= a_students\r\n b -= b_students\r\n students_number += a_students + b_students\r\n else:\r\n if a >= b:\r\n a_students = min(a, seats_count // 2 + 1)\r\n b_students = min(b, seats_count // 2)\r\n else:\r\n b_students = min(b, seats_count // 2 + 1)\r\n a_students = min(a, seats_count // 2)\r\n a -= a_students\r\n b -= b_students\r\n students_number += a_students + b_students\r\n\r\nprint(students_number)\r\n", "n,a,b=map(int,input().split())\r\ns=str(input())\r\nc=a+b\r\ni=0\r\nwhile(i<n):\r\n if(s[i]=='.'):\r\n j=0\r\n if(a>=b):\r\n while(i<n and s[i]!='*'):\r\n if(j%2==0):\r\n if(a>0):\r\n a-=1\r\n else:\r\n if(b>0):\r\n b-=1\r\n i+=1\r\n j+=1\r\n else:\r\n while(i<n and s[i]!='*'):\r\n if(j%2==0):\r\n if(b>0):\r\n b-=1\r\n else:\r\n if(a>0):\r\n a-=1\r\n i+=1\r\n j+=1\r\n i+=1\r\n if(a==0 and b==0):\r\n break\r\nprint(c-a-b)", "n, a, b = map(int, input().split())\r\ncnt = [a, b]\r\nmp = input()\r\nla = 2\r\nfor i in mp:\r\n if (i == '.'):\r\n pf = (cnt[0] < cnt[1])\r\n if (pf == la):\r\n pf ^= 1\r\n la = pf\r\n if (cnt[la]):\r\n cnt[la] -= 1\r\n else:\r\n la = 2\r\nprint(a + b - cnt[0] - cnt[1])", "def main():\r\n\tn, a, b = (int(x) for x in input().split())\r\n\ttotal = a + b\r\n\tstring = input().split(\"*\")\r\n\tfor i in string:\r\n\t\tif a > b:\r\n\t\t\ta, b = b, a\r\n\t\ta -= min(a, len(i)//2)\r\n\t\tb -= min(b, len(i)-len(i)//2)\r\n\tprint(total - a - b)\r\n\r\n\r\nif __name__ == '__main__':\r\n\tmain()", "\"\"\"Problem B - Students in Railway Carriage.\n\nhttp://codeforces.com/contest/962/problem/b\n\nThere are `n` consecutive seat places in a railway carriage. Each place is\neither empty or occupied by a passenger.\n\nThe university team for the Olympiad consists of `a` student-programmers and\n`b` student-athletes. Determine the largest number of students from all `a+b`\nstudents, which you can put in the railway carriage so that:\n\n- no student-programmer is sitting next to the student-programmer;\n\n- and no student-athlete is sitting next to the student-athlete.\n\nIn the other words, there should not be two consecutive (adjacent) places\nwhere two student-athletes or two student-programmers are sitting.\n\nConsider that initially occupied seat places are occupied by jury members (who\nobviously are not students at all).\n\nInput:\n\nThe first line contain three integers `n`, `a` and `b` (`1 <= n <=\n2\\cdot10^{5}`, `0 <= a, b <= 2\\cdot10^{5}`, `a + b > 0`) — total number of seat\nplaces in the railway carriage, the number of student-programmers and the\nnumber of student-athletes.\n\nThe second line contains a string with length `n`, consisting of characters\n\".\" and \"*\". The dot means that the corresponding place is empty. The asterisk\nmeans that the corresponding place is occupied by the jury member.\n\nOutput:\n\nPrint the largest number of students, which you can put in the railway\ncarriage so that no student-programmer is sitting next to a student-programmer\nand no student-athlete is sitting next to a student-athlete.\n\n\"\"\"\nimport logging\n\n\nfmt = '%(levelname)s - %(name)s (line:%(lineno)s) - %(message)s'\nformatter = logging.Formatter(fmt)\n\nch = logging.StreamHandler()\nch.setLevel(logging.ERROR)\nch.setFormatter(formatter)\n\nlogger = logging.getLogger('students_in_railway_carriage')\nlogger.setLevel(logging.ERROR)\nlogger.addHandler(ch)\n\n\ndef solve(a, b, s):\n if a < b:\n a, b = b, a\n \n count = 0\n ok = True\n for i, c in enumerate(s):\n if c == '*':\n logger.debug('Skipping *')\n if a < b:\n a, b = b, a\n ok = True\n continue\n if a > 0 and ok:\n logger.debug(f'Substracting from a originally, a={a}, b={b}')\n count += 1\n a -= 1\n if b == 0:\n ok = False\n else:\n a, b = b, a\n ok = True\n elif a > 0 and not ok:\n ok = True\n continue\n # elif b > 0 and not ok:\n # ok = True\n # continue\n # elif b > 0 and ok:\n # logger.debug('Not enough a, taking from b. originally a={a}, b={b}')\n # count += 1\n # b =-1\n if a == 0 and b == 0:\n logger.debug(f'Not a and b: {a} {b}')\n break\n #ok = False\n return count\n\n\ndef main():\n _, a, b = map(int, input().strip().split())\n s = input().strip()\n \n result = solve(a, b, s)\n print(result)\n \n\nif __name__ == '__main__':\n main()\n", "\nn, a, b = map(int, input().split())\n\nab_sum = a + b\n\ncabin = map(len, input().split('*'))\n\nfor seg in cabin:\n if a < b:\n b -= min([b, (seg + 1) // 2])\n a -= min([seg // 2, a])\n else:\n b -= min([b, seg // 2])\n a -= min([(seg + 1) // 2, a])\n\nprint(ab_sum - a - b)\n", "n, a, b = map(int, input().split())\r\n\r\narr = input().split('*')\r\n\r\ncount = 0\r\n\r\nfor seats in arr:\r\n if len(seats) % 2 == 0:\r\n diff_a = min(a, len(seats) // 2)\r\n diff_b = min(b, len(seats) // 2)\r\n a -= diff_a\r\n b -= diff_b\r\n count += diff_a + diff_b\r\n else:\r\n if a > b:\r\n diff_a = min(a, len(seats) // 2 + 1)\r\n diff_b = min(b, len(seats) // 2)\r\n a -= diff_a\r\n b -= diff_b\r\n count += diff_a + diff_b\r\n else:\r\n diff_a = min(a, len(seats) // 2)\r\n diff_b = min(b, len(seats) // 2 + 1)\r\n a -= diff_a\r\n b -= diff_b\r\n count += diff_a + diff_b\r\n\r\nprint(count)", "def get_list(func=None):\n if not func:\n return input().split()\n return list(map(func, input().split()))\n\nn, a, b = get_list(int)\naplusb = a + b\ns = input()\nedge = True\nlast = 'c'\n\nfor ch in s:\n if ch == '*':\n edge = True\n if ch == '.': # free\n if edge:\n if a < b:\n b -= 1\n last = 'b'\n else:\n a -= 1\n last = 'a'\n edge = False\n else:\n if last == 'a':\n b -= 1\n last = 'b'\n else:\n a -= 1\n last = 'a'\n\nprint(aplusb - max(a, 0) - max(b, 0))\n", "mod = 1000000007\r\nii = lambda : int(input())\r\nsi = lambda : input()\r\ndgl = lambda : list(map(int, input()))\r\nf = lambda : map(int, input().split())\r\nil = lambda : list(map(int, input().split()))\r\nls = lambda : list(input())\r\nfrom itertools import *\r\nn,a,b=f()\r\ns=si()\r\nl=[]\r\nst=0\r\nfor i,j in groupby(s):\r\n if i=='.':\r\n l.append(len(list(j)))\r\nfor i in l:\r\n a,b=max(a,b),min(a,b)\r\n if a>0 or b>0:\r\n if i&1:\r\n st+=min(a,(i+1)//2)\r\n a=max(0,a-(i+1)//2)\r\n st+=min(b,i//2)\r\n b=max(0,b-i//2)\r\n else:\r\n st+=min(a,i//2)\r\n a=max(0,a-i//2)\r\n st+=min(b,i//2)\r\n b=max(0,b-i//2)\r\nprint(st)", "n,a,b=map(int,input().split())\r\ns=t=0\r\nfor x in map(len,input().split('*')):\r\n s+=x//2;t+=x%2\r\nm=min(a,s)+min(b,s)\r\nprint(m+min(a+b-m,t))", "import sys\r\n\r\ninput = sys.stdin.readline\r\n\r\ndef solve():\r\n\tn, a, b = map(int,input().split())\r\n\te = 0\r\n\to = 0\r\n\tfor i in input().strip().split('*'):\r\n\t\tl = len(i)\r\n\t\te += l // 2\r\n\t\to += l % 2\r\n\tprint(min(o + e + min(e,a,b), b + a))\r\n\r\nsolve()\r\n", "#http://codeforces.com/problemset/problem/962/B\r\n\r\ndef main():\r\n _,bot,sport=list(map(int,input().split()))\r\n p=input()\r\n bot_sit=bot\r\n sport_sit=sport\r\n train=list(map(len,p.split('*')))\r\n for i in train:\r\n\r\n if i%2==0:\r\n bot_sit-=i//2\r\n sport_sit-=i//2\r\n else:\r\n if bot_sit>sport_sit:\r\n bot_sit-=i//2+1\r\n sport_sit-=i//2\r\n else:\r\n bot_sit-=i//2\r\n sport_sit-=i//2+1\r\n\r\n print(sum([bot-max(bot_sit,0),sport-max(sport_sit,0)]))\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\nif __name__==\"__main__\":\r\n main()\r\n", "N = int(1e5 + 7)\noo = int(1e10)\nM = int(1e9 + 7)\nMULTIPLE_TEST = 0\n\ndef ReadInt():\n return int(input())\n\ndef ReadInts():\n return map(int, input().split())\n\ndef ReadArr():\n return list(map(int, input().split()))\n\ndef main():\n n, a, b = ReadInts()\n s = input()\n\n seat_lenght = []\n length = 0\n for ch in s:\n if ch == '*' and length != 0:\n seat_lenght.append(length)\n length = 0\n elif ch == '.':\n length += 1\n\n ans = 0\n if length > 0:\n seat_lenght.append(length)\n\n for L in seat_lenght:\n if a < b:\n a, b = b, a\n\n more = L // 2 + L % 2\n less = L // 2\n\n ans += min(more, a)\n ans += min(less, b)\n\n a -= min(more, a)\n b -= min(less, b)\n\n print(ans)\n\nif __name__ == '__main__':\n \n t = 1\n if MULTIPLE_TEST : t = ReadInt()\n while t > 0:\n t -= 1\n main()", "i,a,b=map(int,input().split())\r\ns=list(input())\r\nt=c=0\r\nfor x in range(i):\r\n if s[x]=='.':\r\n if a!=0 or b!=0:\r\n if t==0:\r\n if a>b: a-=1;c+=1;t=1\r\n else: b-=1;c+=1;t=2\r\n elif t==1:\r\n if b>0: b-=1; c+=1;t=2\r\n else: t=0\r\n elif t==2:\r\n if a>0: a-=1; c+=1;t=1\r\n else: t=0\r\n else: break\r\n else: t=0\r\nprint(c)", "n,a,b = map(int,input().split())\ns=a+b\nans = 0\nfor t in map(len, input().split('*')):\n if a > b: a, b = b, a\n a -= min(a , (t//2))\n b -= min(b , (t - (t//2)))\nprint(s-a-b)\n\n", "class CodeforcesTask962BSolution:\n def __init__(self):\n self.result = ''\n self.n_a_b = []\n self.places = ''\n\n def read_input(self):\n self.n_a_b = [int(x) for x in input().split(\" \")]\n self.places = input()\n\n def process_task(self):\n placement = [len(x) for x in self.places.split(\"*\") if len(x) > 0]\n rema, remb = self.n_a_b[1], self.n_a_b[2]\n for p in placement:\n if not p % 2:\n rema -= p // 2\n remb -= p // 2\n else:\n if rema > remb:\n rema -= p // 2 + 1\n remb -= p // 2\n else:\n rema -= p // 2\n remb -= p // 2 + 1\n rema, remb = max(0, rema), max(0, remb)\n self.result = str(self.n_a_b[1] + self.n_a_b[2] - rema - remb)\n\n def get_result(self):\n return self.result\n\n\nif __name__ == \"__main__\":\n Solution = CodeforcesTask962BSolution()\n Solution.read_input()\n Solution.process_task()\n print(Solution.get_result())\n", "def solve(n,a,b,seq) :\r\n empty = 0\r\n ans = 0\r\n for index in range(n) :\r\n if seq[index] == '.' :\r\n empty += 1\r\n else :\r\n half = empty//2\r\n half2 = empty-half\r\n if a > b :\r\n if a >= half2 :\r\n a -= half2\r\n ans += half2\r\n else :\r\n ans += a\r\n a = 0\r\n \r\n if b >= half :\r\n b -= half\r\n ans += half\r\n else :\r\n ans += b\r\n b = 0\r\n else :\r\n if b >= half2 :\r\n b -= half2\r\n ans += half2\r\n else :\r\n ans += b\r\n b = 0\r\n if a >= half :\r\n a -= half\r\n ans += half\r\n else :\r\n ans += a\r\n a = 0\r\n empty = 0\r\n \r\n if a == 0 and b == 0 :\r\n break\r\n \r\n if (a > 0 or b > 0) and empty > 0 : \r\n half = empty//2\r\n half2 = empty-half\r\n if a > b :\r\n if a >= half2 :\r\n a -= half2\r\n ans += half2\r\n else :\r\n ans += a\r\n a = 0\r\n \r\n if b >= half :\r\n b -= half\r\n ans += half\r\n else :\r\n ans += b\r\n b = 0\r\n else :\r\n if b >= half2 :\r\n b -= half2\r\n ans += half2\r\n else :\r\n ans += b\r\n b = 0\r\n if a >= half :\r\n a -= half\r\n ans += half\r\n else :\r\n ans += a\r\n a = 0\r\n return ans \r\n \r\nn,a,b = list(map(int,input().split()))\r\nseq = list(input())\r\nprint (solve(n,a,b,seq))\r\n \r\n \r\n", "n, a, b = map(int, input().split())\r\ns = input()\r\ndot = s.count(\".\")\r\nary = s.split(\"*\")\r\nx = a+b\r\nfor i in ary:\r\n\ty = len(i)\r\n\tif y%2 == 1:\r\n\t\tif a > b:\r\n\t\t\ta -= 1\r\n\t\telse:\r\n\t\t\tb -= 1\r\n\t\ty -=1 \r\n\ta -= y//2\r\n\tb -= y//2\r\nprint (x-max(0,a)-max(0,b))", "def m(a, b):\r\n if a > b:\r\n return a, b\r\n return b, a\r\n\r\n\r\ndef main():\r\n n, a, b = map(int, input().split())\r\n arr = input().split('*')\r\n total = 0\r\n for i in arr:\r\n if not i:\r\n continue\r\n a, b = m(a, b)\r\n if len(i) % 2:\r\n total += min(a, len(i) // 2 + 1) + min(b, len(i) // 2)\r\n a -= min(a, len(i) // 2 + 1)\r\n b -= min(b, len(i) // 2)\r\n else:\r\n total += min(a, len(i) // 2) + min(b, len(i) // 2)\r\n a -= min(a, len(i) // 2 )\r\n b -= min(b, len(i) // 2)\r\n print(total)\r\n\r\n\r\n\r\nmain()", "def main():\r\n n,a,b = map(int,input().split())\r\n s = list(filter(lambda x:x>0, map(len, input().split('*'))))\r\n\r\n x = a+b\r\n for w in s:\r\n if a>b:\r\n a,b = b,a\r\n\r\n ma,mb = w//2,(w+1)//2\r\n a,b = max(0,a-ma), max(0,b-mb)\r\n\r\n print(x-a-b)\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n, a, b = map(int, input().split())\r\nempty_seat = list(input().split(\"*\"))\r\n\r\ntwin, alone = 0, 0\r\nfor i in range(len(empty_seat)):\r\n twin += len(empty_seat[i]) // 2\r\n alone += len(empty_seat[i]) % 2\r\n\r\ntwin_seat = min(a, twin) + min(b, twin)\r\nres = twin_seat + min(alone, a + b - twin_seat)\r\nprint(res)\r\n", "n,a,b=map(int,input().split())\r\ns=input()\r\ns=list(s)\r\nc=0\r\na1=a\r\nb1=b\r\na=max(a1,b1)\r\nb=min(a1,b1)\r\ni=0\r\nlast=0\r\nl=[]\r\nl.append(0)\r\nfor i in range(0,n):\r\n\tif(s[i]=='*'):\r\n\t\tl.append(i)\r\n\r\nl.append(n)\r\n#print(*l)\r\nfor i in range(1,len(l)):\r\n\r\n\tif(i==1):\r\n\t\tz=l[i]-l[i-1]\r\n\r\n\r\n\telse:\r\n\t\tz=l[i]-l[i-1]-1\r\n\t#print(l[i],l[i-1],z)\r\n\r\n\tif(z%2==0):\r\n\t\t\tc=c+min(a,z//2)\r\n\t\t\tc=c+min(b,z//2)\r\n\t\t\ta=a-min(a,z//2)\r\n\t\t\tb=b-min(b,z//2)\r\n\t\t\t\r\n\telse:\r\n\r\n\t\tx=(z+1)//2\r\n\t\ty=z//2\r\n\t\t#print(z,x,y,a,b)\r\n\t\t#print(\"pp\")\r\n\t\tif(a>b):\r\n\t\t\tc=c+min(a,x)\r\n\t\t\tc=c+min(b,y)\r\n\t\t\ta=a-min(a,x)\r\n\t\t\tb=b-min(b,y)\r\n\t\t\t\r\n\t\t\t#print(a,b,c)\r\n\t\t\t#print(\"ok\")\r\n\t\t\t#print(a,b,c)\r\n\t\telse:\r\n\t\t\tc=c+min(a,y)\r\n\t\t\tc=c+min(b,x)\r\n\t\t\ta=a-min(a,y)\r\n\t\t\tb=b-min(b,x)\r\n\t\t\t\r\n\t\t\t#print(\"yes\")\r\n\t\t\t#print(a,b,c)\r\n\r\n\t#print(l[i],l[i-1],z,c,a,b)\r\n\r\n\r\n\r\n\r\nprint(c)\r\n", "n, a, b = map(int, input().split())\r\naa = a\r\nbb = b\r\ns = [\"*\"] + list(input())\r\ncnt = 0\r\nfor i in range(1, n + 1):\r\n if a == 0 and b == 0:\r\n break\r\n elif s[i] == \".\" and s[i - 1] == \"*\":\r\n if b > a:\r\n b -= 1\r\n s[i] = \"B\"\r\n else:\r\n a -= 1\r\n s[i] = \"A\"\r\n elif s[i] == \".\" and s[i - 1] != \"*\":\r\n if s[i - 1] == \"B\":\r\n if a:\r\n a -= 1\r\n s[i] = \"A\"\r\n else:\r\n s[i] = \"*\"\r\n elif s[i - 1] == \"A\":\r\n if b:\r\n b -= 1\r\n s[i] = \"B\"\r\n else:\r\n s[i] = \"*\"\r\nn = len(s)\r\nfor i in range(n):\r\n if s[i] == \"A\" or s[i] == \"B\":\r\n cnt += 1\r\nprint(cnt)", "'''\n Educational Codeforces Round 42\n Problem B\n \"Students in Railway Carriage\"\n Solution: Jakub Ziółkowski ([email protected])\n'''\n\ninputs = input().split(\" \")\nnumberOfSeats, programmers, athletes = int(inputs[0]), int(inputs[1]), int(inputs[2])\nseats = input()\nresult = 0\nlastSit = ''\nfor c in seats:\n if(c == '.'):\n if(programmers > athletes and programmers > 0):\n if(lastSit != 'p'):\n programmers -= 1\n result += 1\n lastSit = 'p'\n elif(athletes > 0):\n athletes -= 1\n result += 1\n lastSit = 'a'\n else: lastSit = ''\n elif(athletes >= programmers and athletes > 0):\n if(lastSit != 'a'):\n athletes -= 1\n result += 1\n lastSit = 'a'\n elif(programmers > 0):\n programmers -= 1\n result += 1\n lastSit = 'p'\n else: lastSit = ''\n else:\n lastSit = ''\nprint(result)", "n,a,b=map(int,input().split())\ns=list(input())\nans=0\nfor i in range(n):\n\tif s[i]=='.':\n\t\tif i==0 or (s[i-1]!='a' and s[i-1]!='b'):\n\t\t\tif a>b and a>0:\n\t\t\t\ts[i]='a'\n\t\t\t\ta-=1\n\t\t\t\tans+=1\n\t\t\telif b>0:\n\t\t\t\ts[i]='b'\n\t\t\t\tb-=1\n\t\t\t\tans+=1\n\t\telif s[i-1]=='a':\n\t\t\tif b>0:\n\t\t\t\ts[i]='b'\n\t\t\t\tb-=1\n\t\t\t\tans+=1\n\t\telif s[i-1]=='b':\n\t\t\tif a>0:\n\t\t\t\ts[i]='a'\n\t\t\t\ta-=1\n\t\t\t\tans+=1\nprint(ans)\n", "x=input().split()\ny=input()\nn=int(x[0])\na=int(x[1])\nb=int(x[2])\neldoor=0\ni=0\nwhile i < n and a+b>0:\n if y[i]==\"*\":\n eldoor=0\n i=i+1\n else:\n if eldoor==1 :\n if a>=1:\n a=a-1\n eldoor=2\n i=i+1\n else:\n eldoor=2\n i=i+1\n elif eldoor==2:\n if b>=1:\n b=b-1\n eldoor=1\n i=i+1\n else:\n eldoor=1\n i=i+1\n else:\n if a > b :\n \n if a>=1:\n a=a-1\n eldoor=2\n i=i+1\n else:\n if b>=1:\n b=b-1\n eldoor=1\n i=i+1\nprint(int(x[1])+int(x[2])-a-b) ", "n,a,b= input().split()\r\nn,a,b=int(n),int(a),int(b)\r\nrc=list(map(len,input().split('*')))\r\nkaj=a+b\r\nfor i in rc:\r\n if b<a:\r\n b,a=a,b\r\n \r\n a-=min(i//2,a)\r\n b-= min(i-i//2,b)\r\n\r\nprint(kaj-a-b) ", "n, a, b = map(int, input().split())\nvagon = input() + '*'\nfree, ans = 0, 0\npr_a, pr_b = a, b\nfor i in range(n + 1):\n if a == 0 and b == 0:\n break\n if vagon[i] == '.':\n free += 1\n else:\n if a >= b:\n a, b = a - min(a, (free - 1) // 2 + 1), b - min(b, free // 2)\n else:\n b, a = b - min(b, (free - 1) // 2 + 1), a - min(a, free // 2)\n ans += (pr_a - a) + (pr_b - b)\n pr_a, pr_b = a, b\n free = 0\nprint(ans)", "n, a, b = map(int, input().split())\nt = a + b\ns = input()\ncurr = 0\narr = []\nfor c in s:\n if c == \".\":\n curr += 1\n else:\n arr.append(curr)\n curr = 0\n\nif curr > 0:\n arr.append(curr)\n\narr.sort()\narr.reverse()\n\nif a < b:\n a, b = b, a\n\nfor e in arr:\n if e % 2 == 1:\n b -= e//2\n a -= e//2+1\n if a < b:\n a, b = b, a\n else:\n b -= e//2\n a -= e//2\n\nif b > 0:\n t -= b\nif a > 0:\n t -= a \n\nprint(t)\n", "import math\nn, a, b = map(int, input().split())\nstring = input().split('*')\nbar = a+b\nfor i in string:\n\tif i!='':\n\t\tSum=i.count('.')\n\t\tif Sum%2==0:\n\t\t\tnum=Sum/2\n\t\t\tif a>num:\n\t\t\t\ta-=num\n\t\t\telse:\n\t\t\t\ta=0\n\t\t\tif b>num:\n\t\t\t\tb-=num\n\t\t\telse:\n\t\t\t\tb=0\n\t\t\t\n\t\telse:\n\t\t\tnum=math.ceil(Sum/2)\n\t\t\tnum2=math.floor(Sum/2)\n\t\t\t\n\t\t\tif a>=b:\n\t\t\t\tif a>num:\n\t\t\t\t\ta-=num\n\t\t\t\telse:\n\t\t\t\t\ta=0\n\t\t\t\tif b>num2:\n\t\t\t\t\tb-=num2\n\t\t\t\telse:\n\t\t\t\t\tb=0\n\t\t\t\tif a==0 and b==0:\n\t\t\t\t\tbreak\n\t\t\t\tcontinue\n\n\t\t\tif b>a:\n\t\t\t\tif a>num2:\n\t\t\t\t\ta-=num2\n\t\t\t\telse:\n\t\t\t\t\ta=0\n\t\t\t\tif b>num:\n\t\t\t\t\tb-=num\n\t\t\t\telse:\n\t\t\t\t\tb=0\n\t\t\t\n\tif a==0 and b==0:\n\t\tbreak\nprint(int(bar-(a+b)))", "def main():\n n, a, b = map(int, input().split())\n ab = a + b\n for v in map(len, filter(None, input().split('*'))):\n if v & 1:\n v //= 2\n if a > b:\n a -= v + 1\n b -= v\n else:\n b -= v + 1\n a -= v\n else:\n v //= 2\n a -= v\n b -= v\n print(ab - max(a, 0) - max(b, 0))\n\n\nif __name__ == '__main__':\n main()\n", "n, a, b = map(int, input().split())\nstring = input()\npos = [0] * n\nfor i in range(n):\n if string[i] == '*':\n pos[i] = -1\npos.insert(0, -1)\ntmp = a + b\nfor i in range(1, n + 1):\n if a + b == 0:\n break\n if pos[i] == 0:\n if pos[i - 1] <= 0:\n if a > b:\n a -= 1\n pos[i] = 1\n elif b > 0:\n b -= 1\n pos[i] = 2\n elif pos[i - 1] == 1 and b > 0:\n b -= 1\n pos[i] = 2\n elif pos[i - 1] == 2 and a > 0:\n a -= 1\n pos[i] = 1\n# print(\"a==\", a, \"b==\", b)\n# print(pos)\nprint(tmp - a - b)\n", "#Bhargey Mehta (Junior)\r\n#DA-IICT, Gandhinagar\r\nimport sys, math, queue\r\n#sys.stdin = open('input.txt', 'r')\r\nMOD = 998244353\r\nsys.setrecursionlimit(1000000)\r\n\r\nn, a, b = map(int, input().split())\r\ns = '*'+input()\r\nst = []\r\nfor i in range(n+1):\r\n if s[i] == '*':\r\n if len(st) == 0 or s[i-1] != '*':\r\n st.append(0)\r\n else:\r\n st[-1] += 1\r\nans = 0\r\nfor si in st:\r\n p = si//2\r\n q = si-p\r\n if a > b:\r\n ans += min(a, q)\r\n a -= min(a, q)\r\n ans += min(b, p)\r\n b -= min(b, p)\r\n else:\r\n ans += min(b, q)\r\n b -= min(b, q)\r\n ans += min(a, p)\r\n a -= min(a, p)\r\nprint(ans)", "n,a,b = map(int,input().split())\ns = list(input())\nfor i in range(0,len(s)) :\n if s[i] == '.' :\n if (a>b and s[i-1]!='A' or s[i-1]=='B') and a>0 :\n s[i]='A'\n a-=1\n elif (b>=a and s[i-1]!='B' or s[i-1]=='A') and b>0:\n s[i]='B'\n b-=1\n\nans = 0\nfor i in range(n):\n if s[i]=='A' or s[i]=='B' :\n ans +=1\nprint (ans)\n", "n, v, t = input().split()\r\nn = int(n)\r\na = int(v)\r\nb = int(t)\r\ns = [len(k) for k in input().split('*')]\r\na,b = max(a,b),min(a,b)\r\nfor i in range(len(s)):\r\n a -= (s[i]+1)//2\r\n b -= s[i]//2\r\n if a < 0:\r\n a, b = 0,0\r\n break\r\n elif b < 0:\r\n b = 0\r\n a, b = max(a,b), min(a,b)\r\nprint(int(v) + int(t) - a - b)\r\n \r\n\r\n", "n, a, b = map(int, input().split())\r\ns = [str(i) for i in input().split('*')]\r\nv = []\r\nfor i in s:\r\n x = len(i)\r\n if x:\r\n v.append(x)\r\nv.sort()\r\nans = 0\r\nfor x in v:\r\n if a > b:\r\n a, b = b, a\r\n p, q = 0, 0\r\n if x & 1:\r\n p, q = x // 2, (x // 2) + 1\r\n else:\r\n p, q = x // 2, x // 2\r\n d = min(a, p)\r\n ans += d\r\n a -= d\r\n d = min(b, q)\r\n ans += d\r\n b -= d\r\n\r\nprint(ans)\r\n", "n, a, b=map(int, input().split())\r\ns=a+b\r\nfor x in map(len, input().split('*')):\r\n\tif a>b:a, b=b, a\r\n\ta-=min(a, (x//2))\r\n\tb-=min(b, (x-x//2))\r\nprint(s-a-b);", "import math\r\n\r\ndef solve():\r\n n, a, b = [int(s) for s in input().split(' ')]\r\n s = input()\r\n gaps = []\r\n g = 0\r\n for c in s:\r\n if c == '.':\r\n g += 1\r\n elif g:\r\n gaps.append(g)\r\n g = 0\r\n if g:\r\n gaps.append(g)\r\n k = 0\r\n for gap in gaps:\r\n if a > b:\r\n a, b = b, a\r\n x = min(b, math.ceil(gap / 2))\r\n y = min(a, math.floor(gap / 2))\r\n b -= x\r\n a -= y\r\n k += (x + y)\r\n return k\r\n\r\nprint(solve())" ]

[ "n = int(input())\r\nans = (-10 ** 8, [\"Impossible\"])\r\ns = []\r\nd = {}\r\nfl = True\r\na = [list(map(int, input().split())) for i in range(n)]\r\ndef job(nom, l, m, w):\r\n\tglobal s, ans\t\r\n\tif nom == n // 2 and fl:\r\n\t\tsu, ss = d.get((m - l, w - l), (-10 ** 10, []))\r\n\t\tif l > su:\r\n\t\t\td[(m - l, w - l)] = (l, s[:])\r\n\t\treturn\r\n\tif nom == n:\r\n\t\tsu, ss = d.get((l - m, l - w), (-10 ** 9, []))\r\n\t\tif su + l > ans[0]:\r\n\t\t\tans = (su + l, ss[:] + s[:])\r\n\t\treturn\r\n\ts += [\"MW\"] \r\n\tjob(nom + 1, l, m + a[nom][1], w + a[nom][2])\r\n\ts[-1] = \"LW\"\r\n\tjob(nom + 1, l + a[nom][0], m, w + a[nom][2])\r\n\ts[-1] = \"LM\"\r\n\tjob(nom + 1, l + a[nom][0], m + a[nom][1], w)\r\n\ts.pop()\r\njob(0, 0, 0, 0)\r\nfl = False\r\nif n == 1:\r\n\td[(0, 0)] = (0, [])\r\njob(n // 2, 0, 0, 0)\r\nprint('\\n'.join(ans[1]))\r\n", "n=int(input())\r\nans=(-10**8,[\"Impossible\"])\r\ns=[];d={};fl=True;\r\na=[list(map(int,input().split())) for i in range(n)]\r\ndef job(nom,l,m,w):\r\n global s,ans \r\n if nom==n//2 and fl:\r\n su,ss=d.get((m-l,w-l),(-10**10,[]))\r\n if l>su: d[(m-l,w-l)]=(l,s[:])\r\n return\r\n if nom==n:\r\n su,ss=d.get((l-m,l-w),(-10**9,[]))\r\n if su+l>ans[0]: ans=(su+l,ss[:]+s[:])\r\n return\r\n s+=[\"MW\"] ;job(nom+1,l,m+a[nom][1],w+a[nom][2])\r\n s[-1]=\"LW\";job(nom+1,l+a[nom][0],m,w+a[nom][2])\r\n s[-1]=\"LM\";job(nom+1,l+a[nom][0],m+a[nom][1],w)\r\n s.pop()\r\njob(0,0,0,0);fl=False;\r\nif n==1: d[(0,0)]=(0,[])\r\njob(n//2,0,0,0)\r\nprint('\\n'.join(ans[1]))", "#!/usr/bin/env python3\n\nn = int(input())\na = [0] * n\nb = [0] * n\nc = [0] * n\nfor i in range(n):\n a[i], b[i], c[i] = map(int, input().split())\n\nmiddle = { }\nstack = [ ]\nresult = (-1e10, ())\nphase = 1\n\ndef search(pos, l, m, w):\n global result\n if (pos == n >> 1) if phase == 1 else (pos < n >> 1):\n if phase == 1:\n middle[(m - l, w - l)] = (stack[:], l)\n else:\n seq, first_l = middle.get((l - m, l - w), (None, None))\n if seq is not None and l + first_l > result[0]:\n result = (l + first_l, seq + stack[::-1])\n else:\n stack.append(\"LM\")\n search(pos + phase, l + a[pos], m + b[pos], w)\n stack[-1] = \"LW\"\n search(pos + phase, l + a[pos], m, w + c[pos])\n stack[-1] = \"MW\"\n search(pos + phase, l, m + b[pos], w + c[pos])\n stack.pop()\n\nsearch(0, 0, 0, 0)\nphase = -1\nsearch(n - 1, 0, 0, 0)\nif result[1]:\n print('\\n'.join(result[1]))\nelse:\n print(\"Impossible\")\n" ]

[ "from fractions import gcd\nn, m, x, y, a, b = map(int, input().split())\nk = gcd(a, b)\na //= k\nb //= k\ntimes = min(n // a, m // b)\na *= times\nb *= times\nx1 = x - (a + 1) // 2\ny1 = y - (b + 1) // 2\nif x1 < 0:\n x1 = 0\nif y1 < 0:\n y1 = 0\nif x1 + a > n:\n x1 -= (x1 + a - n)\nif y1 + b > m:\n y1 -= (y1 + b - m)\nprint(x1, y1, x1 + a, y1 + b)\n", "from fractions import gcd\n\nn, m, x, y, a, b = map(int, input().split())\ng = gcd(a, b)\na, b = a // g, b // g\nk = min(n // a, m // b)\na, b = k * a, k * b\n\nx1, x2 = x - (a - a // 2), x + a // 2\ny1, y2 = y - (b - b // 2), y + b // 2\nd = max(0, 0 - x1)\nx1, x2 = x1 + d, x2 + d\nd = max(0, x2 - n)\nx1, x2 = x1 - d, x2 - d\nd = max(0, 0 - y1)\ny1, y2 = y1 + d, y2 + d\nd = max(0, y2 - m)\ny1, y2 = y1 - d, y2 - d\nprint(\" \".join(map(str, [x1, y1, x2, y2])));\n", "#!/usr/bin/python3\r\n\r\ndef gcd(a, b):\r\n while a:\r\n a, b = b % a, a\r\n return b\r\n\r\nn, m, x, y, a, b = tuple(map(int, input().strip().split()))\r\ng = gcd(a, b)\r\na //= g\r\nb //= g\r\nk = min(n // a, m // b)\r\nw = k * a\r\nh = k * b\r\nans = [x - w + w // 2, y - h + h // 2, x + w // 2, y + h // 2]\r\nif ans[0] < 0:\r\n ans[2] -= ans[0]\r\n ans[0] = 0;\r\nif ans[1] < 0:\r\n ans[3] -= ans[1]\r\n ans[1] = 0\r\nif ans[2] > n:\r\n ans[0] -= ans[2] - n\r\n ans[2] = n\r\nif ans[3] > m:\r\n ans[1] -= ans[3] - m\r\n ans[3] = m\r\nprint('%d %d %d %d' % tuple(ans))", "import math\r\nn, m, x, y, a, b = map(int, input().split())\r\ngcd = math.gcd(a, b)\r\na //= gcd\r\nb //= gcd\r\nmax_ratio = min(n // a, m // b)\r\na *= max_ratio\r\nb *= max_ratio\r\nx1 = max(0, min(x - (a + 1) // 2, n - a))\r\ny1 = max(0, min(y - (b + 1) // 2, m - b))\r\nprint(x1, y1, x1 + a, y1 + b)", "from fractions import gcd\n\n\n\nn, m, x, y, a, b = map(int, input().split())\n\nr = gcd(a, b)\n\na, b = a // r, b // r\n\nr = min(n // a, m // b)\n\na, b = a * r, b * r\n\ncx, cy = (a + 1) // 2, (b + 1) // 2\n\ndx, dy = min(n - a, max(cx, x) - cx), min(m - b, max(cy, y) - cy)\n\nprint(dx, dy, a + dx, b + dy)\n\n\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.buffer.readline \r\n\r\np = 24738041398529 \r\n\r\ndef process(n, k, S, G):\r\n g = len(G)\r\n matrix = [[0 for j in range(k)] for i in range(g)]\r\n sums = [0 for i in range(k)]\r\n word_dict = {}\r\n for i in range(g):\r\n word = 0\r\n for j in range(k):\r\n si = ord(G[i][j])-ord('a')\r\n word = (26*word+si) % p\r\n word_dict[word] = i\r\n word = 0\r\n for i in range(k):\r\n si = ord(S[i])-ord('a')\r\n word = (26*word+si) % p\r\n for i in range(k, n*k+k):\r\n i2 = i % k\r\n if word in word_dict:\r\n i1 = word_dict[word]\r\n if matrix[i1][i2]==0:\r\n matrix[i1][i2] = i\r\n if sums[i2] != -1:\r\n sums[i2]+=1\r\n else:\r\n sums[i2] = -1\r\n else:\r\n sums[i2] = -1\r\n s1 = S[(i-k) % (n*k)]\r\n s2 = S[i % (n*k)]\r\n s1 = ord(s1)-ord('a')\r\n s2 = ord(s2)-ord('a')\r\n word = (word-pow(26, k-1, p)*s1) % p\r\n word = (26*word+s2) % p\r\n for i in range(k):\r\n if sums[i]==n:\r\n answer = []\r\n for j in range(g):\r\n j2 = matrix[j][i]\r\n \"\"\"\r\n j = index of the game in my list\r\n j2 = index of the game on the board.\r\n \"\"\"\r\n if j2 != 0:\r\n answer.append([j2, j+1])\r\n answer = sorted(answer)\r\n answer = [x[1] for x in answer]\r\n print(\"YES\")\r\n answer = ' '.join(map(str, answer))\r\n sys.stdout.write(f'{answer}\\n')\r\n return\r\n print('NO')\r\n \r\nn, k = [int(x) for x in input().split()]\r\nS = input().decode().strip()\r\ng = int(input())\r\nG = []\r\nfor i in range(g):\r\n word = input().decode().strip()\r\n G.append(word)\r\nprocess(n, k, S, G)\r\n " ]

[ "def main():\r\n n, m, k = map(int, input().split())\r\n a = [input().strip() for _ in range(n)]\r\n pp = [None] * 26\r\n di = [1, 0, -1, 0]\r\n dj = [0, 1, 0, -1]\r\n\r\n for i in range(n):\r\n for j in range(m):\r\n if 'a' <= a[i][j] <= 'z':\r\n pp[ord(a[i][j]) - ord('a')] = (i, j)\r\n \r\n b_i, b_j, s, e_i, e_j = map(str, input().split())\r\n b_i, b_j, e_i, e_j = map(int, [b_i, b_j, e_i, e_j])\r\n b_i -= 1\r\n b_j -= 1\r\n e_i -= 1\r\n e_j -= 1\r\n\r\n f = [[-1] * 26 for _ in range(26)]\r\n for i in range(26):\r\n f[i][i] = -1\r\n\r\n for o in range(26):\r\n if pp[o]:\r\n t = pp[o]\r\n for l in range(4):\r\n tt = (t[0] + di[l], t[1] + dj[l])\r\n if bad(tt, n, m):\r\n continue\r\n if a[tt[0]][tt[1]] == '#':\r\n continue\r\n z = 1\r\n while 'a' > a[tt[0]][tt[1]] or a[tt[0]][tt[1]] > 'z':\r\n z += int(a[tt[0]][tt[1]])\r\n tt = (tt[0] + di[l], tt[1] + dj[l])\r\n f[o][ord(a[tt[0]][tt[1]]) - ord('a')] = z\r\n \r\n for l in range(4):\r\n t = (b_i, b_j)\r\n while not bad(t, n, m) and t != pp[ord(s[0]) - ord('a')]:\r\n if bad(t, n, m):\r\n break\r\n t = (t[0] + di[l], t[1] + dj[l])\r\n\r\n if not bad(t, n, m):\r\n break \r\n \r\n t = (b_i, b_j)\r\n while k >= getlen(t, a):\r\n k -= getlen(t, a)\r\n t = (t[0] + di[l], t[1] + dj[l])\r\n if t == pp[ord(s[0]) - ord('a')]:\r\n break\r\n\r\n if t != pp[ord(s[0]) - ord('a')]:\r\n print(t[0] + 1, t[1] + 1)\r\n return\r\n\r\n for i in range(len(s) - 1):\r\n if f[ord(s[i]) - ord('a')][ord(s[i + 1]) - ord('a')] <= k:\r\n k -= f[ord(s[i]) - ord('a')][ord(s[i + 1]) - ord('a')]\r\n else:\r\n break\r\n\r\n if i < len(s) - 1:\r\n e = pp[ord(s[i + 1]) - ord('a')]\r\n b = pp[ord(s[i]) - ord('a')]\r\n\r\n for l in range(4):\r\n t = (b[0], b[1])\r\n while not bad(t, n, m) and t != e:\r\n if bad(t, n, m):\r\n break\r\n t = (t[0] + di[l], t[1] + dj[l])\r\n\r\n if not bad(t, n, m):\r\n break\r\n \r\n t = (b[0], b[1])\r\n while k >= getlen(t, a):\r\n k -= getlen(t, a)\r\n t = (t[0] + di[l], t[1] + dj[l])\r\n if t == e:\r\n break\r\n\r\n if t != e:\r\n print(t[0] + 1, t[1] + 1)\r\n return\r\n\r\n print(e_i + 1, e_j + 1)\r\n\r\ndef getlen(t, a):\r\n if '0' <= a[t[0]][t[1]] <= '9':\r\n return int(a[t[0]][t[1]])\r\n return 1\r\ndef bad(t, n, m):\r\n return t[0] < 0 or t[0] >= n or t[1] < 0 or t[1] >= m\r\n\r\nif __name__ == \"__main__\":\r\n main()# 1698088417.1879923" ]

[ "k,n1,n2,n3,t1,t2,t3 = map(int, input().split())\r\na = [0] * n1\r\nb = [0] * n2\r\nc = [0] * n3\r\nfor i in range(k):\r\n finish = max(a[i%n1] + t1 + t2 + t3, b[i%n2] + t2 + t3, c[i%n3] + t3)\r\n a[i%n1] = finish - t2 - t3\r\n b[i%n2] = finish - t3\r\n c[i%n3] = finish\r\nprint(finish)", "\r\nif __name__ == \"__main__\":\r\n k, n1, n2, n3, t1, t2, t3 = map(int, input().split())\r\n f1 = [0] * n1 \r\n f2 = [0] * n2\r\n f3 = [0] * n3\r\n\r\n for i in range(k):\r\n finish = max(f1[i%n1] + t1 + t2 + t3, f2[i%n2] + t2 + t3, f3[i%n3] + t3)\r\n f1[i%n1] = finish - t2 - t3\r\n f2[i%n2] = finish - t3 \r\n f3[i%n3] = finish \r\n print(finish)", "import random\r\nimport sys\r\nfrom math import gcd, lcm, sqrt, isqrt, perm, comb, factorial\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 k, n1, n2, n3, t1, t2, t3 = MII()\r\n f1, f2, f3 = [0]*n1, [0]*n2, [0]*n3\r\n for i in range(k):\r\n finish = max(f1[i%n1]+t1+t2+t3, f2[i%n2]+t2+t3, f3[i%n3]+t3)\r\n f1[i%n1] = finish-t2-t3\r\n f2[i%n2] = finish-t3\r\n f3[i%n3] = finish\r\n print(finish)\r\n return\r\n\r\nsolve()\r\n", "import os\r\nfrom itertools import *\r\nfrom functools import *\r\nfrom collections import *\r\nfrom heapq import *\r\nimport types\r\ninf=1<<63\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 bootstrap(f,stack=[]):\r\n def wrappedfunc(*args,**kwargs):\r\n if stack: return f(*args,**kwargs)\r\n else:\r\n to=f(*args,**kwargs)\r\n while True:\r\n if type(to) is types.GeneratorType:\r\n stack.append(to)\r\n to=next(to)\r\n else:\r\n stack.pop()\r\n if not stack: break\r\n to=stack[-1].send(to)\r\n return wrappedfunc\r\nMOD=10**9+7\r\ndef slove():\r\n k,n1,n2,n3,t1,t2,t3=readis()\r\n T=t1+t2+t3\r\n # t3=max(0,t3-t1-t2)\r\n # t2=max(0,t2-t1)\r\n # # h1=deque([(0,i) for i in range(n1)])\r\n # h1=deque([(0,i) for i in range(n1)])\r\n # h1=deque([(0,i) for i in range(n1)])\r\n h1=[0 for i in range(n1)]\r\n h2=[0 for i in range(n2)]\r\n h3=[0 for i in range(n3)]\r\n p1=p2=p3=0\r\n m=0\r\n for i in range(k):\r\n m1,m2,m3=h1[p1],h2[p2],h3[p3]\r\n m=max(m1,m2,m3)\r\n h1[p1],h2[p2],h3[p3]=m+t1,m+t2,m+t3\r\n p1=(p1+1)%n1\r\n p2=(p2+1)%n2\r\n p3=(p3+1)%n3\r\n # print(i)\r\n # print(h1)\r\n # print(h2)\r\n # print(h3)\r\n # m1,m2,m3=h1[p1],h2[p2],h3[p3]\r\n \r\n print(m+T)\r\n return \r\n \r\n \r\n \r\n \r\n return \r\n\r\n# t=int(input())\r\nt=1\r\nfor _ in range(t):\r\n slove()", "class step(object):\r\n timer = []\r\n def __init__(self, name, machin_num, step_time):\r\n self.machin_num = machin_num\r\n self.step_time = step_time\r\n self.name = name\r\n\r\n def step_input(self, cloth_num, t):\r\n '''\r\n if cloth_num + len(self.timer) > self.machin_num:\r\n excloth = cloth_num + len(self.timer) - self.machin_num\r\n print('%s error excloth is %d' %(self.name , excloth))\r\n return 'error'\r\n else:\r\n for new_cloth in range(cloth_num):\r\n self.timer.append(t)\r\n #print(self.timer)\r\n '''\r\n for new_cloth in range(cloth_num):\r\n self.timer.append(t)\r\n\r\n def step_run(self, t):\r\n tmptimer = [each_timer for each_timer in self.timer if t - each_timer < self.step_time]\r\n #next_num = len(self.timer) - len(tmptimer)\r\n self.timer = tmptimer\r\n #if len(self.timer) == 0:\r\n #print('%s in %d is empty' %(self.name, t))\r\n #pass\r\n #print('%d: %s timer:\\n%s \\n' %(t, self.name, self.timer))\r\n #print('%d: %s timer: %d \\n' %(t, self.name, next_num))\r\n #return next_num\r\n \r\n def checkstate(self, pre_t):\r\n running_machine = len(self.timer)\r\n #output = 0\r\n for each_timer in range(running_machine):\r\n if pre_t - self.timer[each_timer] >= self.step_time:\r\n running_machine -= 1\r\n #output += 1\r\n return self.machin_num - running_machine\r\n \r\n\r\ndef main():\r\n p, n1, n2, n3, t1, t2, t3 = map(int, input().split())\r\n '''\r\n p = 8\r\n n1 = 4\r\n n2 = 3\r\n n3 = 2\r\n t1 = 10\r\n t2 = 5\r\n t3 = 2\r\n '''\r\n step1 = step('step1', n1, t1)\r\n step2 = step('step2', n2, t2)\r\n step3 = step('step3', n3, t3)\r\n\r\n t = 0\r\n #cp = 0\r\n while True:\r\n pre_num1 = step1.checkstate(t)\r\n pre_num2 = step2.checkstate(t + t1)\r\n pre_num3 = step3.checkstate(t + t1 + t2) \r\n step1_input = min(pre_num1, pre_num2, pre_num3)\r\n p -= step1_input\r\n step1.step_run(t)\r\n step1.step_input(step1_input, t)\r\n step2.step_run(t + t1)\r\n step2.step_input(step1_input, t + t1)\r\n step3.step_run(t + t1 + t2)\r\n step3.step_input(step1_input, t + t1 + t2)\r\n if p <= 0:\r\n print(t + t1 + t2 + t3)\r\n break\r\n pre_t = []\r\n if len(step1.timer) == step1.machin_num:\r\n #print('step1 stun')\r\n pre_t.append(t1 - (t - step1.timer[0]))\r\n if len(step2.timer) == step2.machin_num:\r\n #print('step2 stun')\r\n pre_t.append(t2 - (t + t1 - step2.timer[0]))\r\n if len(step3.timer) == step3.machin_num:\r\n #print('step3 stun')\r\n pre_t.append(t3 - (t + t1 + t2 - step3.timer[0]))\r\n #print('pre_t: %s' %(pre_t))\r\n if len(pre_t) == 0:\r\n pre_t = 1\r\n else:\r\n pre_t = min(pre_t)\r\n '''\r\n print('%d minute input: %d' %(t, step1_input))\r\n print('step1 timer:\\n%s\\npre_num1: %d'%(step1.timer, pre_num1))\r\n print('step2 timer:\\n%s\\npre_num2: %d'%(step2.timer, pre_num2))\r\n print('step3 timer:\\n%s\\npre_num3: %d'%(step3.timer, pre_num3))\r\n print('pre_t: %d' %pre_t)\r\n \r\n input()\r\n '''\r\n t += pre_t\r\n\r\nif __name__ == '__main__': \r\n main()\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 k, n1, n2, n3, t1, t2, t3 = map(int, input().split())\r\n mid1 = 0\r\n mid2 = 0\r\n t = 0\r\n stack1 = []\r\n stack2 = []\r\n stack3 = []\r\n while k > 0 or len(stack1) > 0 or len(stack2) > 0 or len(stack3) > 0 or mid1 > 0 or mid2 > 0:\r\n nxt_t = float(\"inf\")\r\n if len(stack1) > 0:\r\n nxt_t = min(nxt_t, stack1[0])\r\n if len(stack2) > 0:\r\n nxt_t = min(nxt_t, stack2[0])\r\n if len(stack3) > 0:\r\n nxt_t = min(nxt_t, stack3[0])\r\n if nxt_t != float(\"inf\"):\r\n t = nxt_t\r\n\r\n # 考虑第一个机器\r\n count = 0\r\n while len(stack1) > 0 and stack1[0] <= t:\r\n heapq.heappop(stack1)\r\n count += 1\r\n mid1 += count\r\n while k > 0 and len(stack1) < n1:\r\n heapq.heappush(stack1, t + t1)\r\n k -= 1\r\n\r\n # 考虑第二个机器\r\n count = 0\r\n while len(stack2) > 0 and stack2[0] <= t:\r\n heapq.heappop(stack2)\r\n count += 1\r\n mid2 += count\r\n while mid1 > 0 and len(stack2) < n2:\r\n heapq.heappush(stack2, t + t2)\r\n mid1 -= 1\r\n\r\n # 考虑第三个机器\r\n count = 0\r\n while len(stack3) > 0 and stack3[0] <= t:\r\n heapq.heappop(stack3)\r\n count += 1\r\n while mid2 > 0 and len(stack3) < n3:\r\n heapq.heappush(stack3, t + t3)\r\n mid2 -= 1\r\n # print(k, mid1, mid2, stack1, stack2, stack3, t)\r\n print(t)\r\n\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "k, n1, n2, n3, t1, t2, t3 = map(int, input().split())\r\nx1 = x2 = x3 = 0\r\nT1, T2, T3 = [0] * n1, [0] * n2, [0] * n3\r\nfor i in range(k):\r\n T1[x1] += t1\r\n T2[x2] = max(T1[x1], T2[x2]) + t2\r\n T3[x3] = max(T2[x2], T3[x3]) + t3\r\n x1 += 1\r\n x2 += 1\r\n x3 += 1\r\n if x1 == n1: x1 = 0\r\n if x2 == n2: x2 = 0\r\n if x3 == n3: x3 = 0\r\nprint(T3[x3 - 1])\r\n", "# Problem: D. Washer, Dryer, Folder\r\n# Contest: Codeforces - MemSQL Start[c]UP 2.0 - Round 1\r\n# URL: https://codeforces.com/problemset/problem/452/D\r\n# Memory Limit: 256 MB\r\n# Time Limit: 1000 ms\r\n\r\nimport sys\r\nimport random\r\nfrom types import GeneratorType\r\nimport bisect\r\nimport io, os\r\nfrom bisect import *\r\nfrom collections import *\r\nfrom contextlib import redirect_stdout\r\nfrom itertools import *\r\nfrom array import *\r\nfrom functools import lru_cache, reduce\r\nfrom heapq import *\r\nfrom math import sqrt, gcd, inf\r\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/452/D\r\n\r\n输入 k (1≤k≤1e4) n1 n2 n3 t1 t2 t3 (1≤n1,n2,n3,t1,t2,t3≤1000)。\r\n有 k 件衣服，每件都需要按照洗净 -> 烘干 -> 熨烫的顺序处理。\r\n现在有 n1 个洗衣机，n2 个烘干机和 n3 个熨斗。\r\n每个机器同时只能处理一件衣服，分别花费 t1, t2, t3 时间。\r\n你必须将一件洗好的衣服立即烘干，烘干完毕后立即熨烫。\r\n输出处理完所有衣服的最短时间。\r\n输入 1 1 1 1 5 5 5\r\n输出 15\r\n\r\n输入 8 4 3 2 10 5 2\r\n输出 32\r\n\"\"\"\r\n\"\"\"https://codeforces.com/problemset/submission/452/210604954\r\n\r\n题解（欢迎点赞）\"\"\"\r\n\r\n\r\n# ms\r\ndef solve():\r\n k,n1,n2,n3,t1,t2,t3 = RI()\r\n f1 = [0]*n1\r\n f2 = [0]*n2\r\n f3 = [0]*n3\r\n for i in range(k):\r\n f = max(f1[i%n1]+t1+t2+t3,f2[i%n2]+t2+t3,f3[i%n3]+t3)\r\n f1[i%n1] = f - t2 - t3\r\n f2[i%n2] = f - t3\r\n f3[i%n3] = f\r\n print(f)\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", "k, na, nb, nc, ta, tb, tc = list(map(int, input().split()))\r\nfrom collections import deque\r\n\r\na = deque()\r\nb = deque()\r\nc = deque()\r\n\r\nfor i in range(na):\r\n a.append(0)\r\nfor i in range(nb):\r\n b.append(0)\r\nfor i in range(nc):\r\n c.append(0)\r\n\r\nt = 0\r\nfor i in range(k):\r\n vr = max(a[0], b[0] - ta, c[0] - (ta + tb))\r\n a.popleft()\r\n a.append(vr + ta)\r\n b.popleft()\r\n b.append(vr + tb + ta)\r\n c.popleft()\r\n c.append(vr + ta + tb + tc)\r\n t = vr + ta + tb + tc\r\nprint(t)\r\n" ]

[ "a = int(input())\nlocal = list(map(int, input().split()))\n\nans = 0\n\nfor i in range(1, a - 1):\n if local[i] > local[i - 1] and local[i] > local[i + 1]:\n ans += 1\n if local[i] < local[i - 1] and local[i] < local[i + 1]:\n ans += 1\n\n\n\n\n\n\n\nprint(ans)", "n = int(input())\r\na = list(map(int, input().split()))\r\nnum = 0\r\nfor i in range(1, n - 1):\r\n if (a[i - 1] < a[i] and a[i] > a[i + 1]) or (a[i - 1] > a[i] and a[i] < a[i + 1]):\r\n num += 1\r\nprint(num)", "import math\r\nfrom sys import stdin\r\nnumber=int(stdin.readline())\r\nstring=stdin.readline().strip().split()\r\noutput=0\r\nfor i in range(1, number-1):\r\n if int(string[i])<int(string[i-1]) and int(string[i])<int(string[i+1]):\r\n output+=1\r\n if int(string[i])>int(string[i-1]) and int(string[i])>int(string[i+1]):\r\n output+=1\r\nprint(output)\r\n", "n=int(input())\r\nl=list(map(int,input().split(' ')))\r\nss=0\r\nfor i in range(1,n-1):\r\n if((l[i]>l[i-1] and l[i]>l[i+1] ) or (l[i]<l[i-1] and l[i]<l[i+1] )) :\r\n ss=ss+1 \r\n \r\nprint(ss)\r\n \r\n \r\n\r\n \r\n \r\n \r\n ", "n = int(input());a = list(map(int, input().split()));count = 0\r\nfor i in range(1, n-1):\r\n if a[i] < a[i-1] and a[i] < a[i+1]:count += 1\r\n elif a[i] > a[i-1] and a[i] > a[i+1]:count += 1\r\nprint(count)", "n = int(input())\nx = list(map(int, input().split()))\ns = 0\nfor i in range(1, n-1):\n if x[i-1] < x[i] and x[i+1] < x[i] or x[i-1] > x[i] and x[i+1] > x[i]:\n s += 1\nprint(s)\n", "n=int(input())\r\na=list(map(int,input().split()))\r\ncount=0\r\ni=1\r\nwhile i<=n-2:\r\n if (a[i]<a[i-1] and a[i]<a[i+1]) or (a[i]>a[i-1] and a[i]>a[i+1]):\r\n count+=1\r\n i+=1\r\nprint(count)", "num = int(input())\na = input()\na = a.split()\nfor i in range(len(a)): a[i] = int(a[i])\nn=0\nfor i in range(1,len(a)-1):\n if a[i] < a[i-1] and a[i]<a[i+1]: n+=1\n elif a[i] > a[i-1] and a[i]> a[i+1]: n+=1\nprint (n\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\nc=0\r\nfor i in range(1,n-1):\r\n if((l[i]>l[i-1] and l[i]>l[i+1]) or (l[i]<l[i-1] and l[i]<l[i+1])):\r\n c+=1\r\nprint(c)", "#!/usr/bin/env python\n# coding=utf-8\n'''\nAuthor: Deean\nDate: 2021-11-19 23:18:57\nLastEditTime: 2021-11-19 23:22:21\nDescription: Local Extrema\nFilePath: CF888A.py\n'''\n\n\ndef func():\n n = int(input())\n lst = list(map(int, input().strip().split()))\n count = 0\n for i in range(1, n - 1):\n if lst[i] > lst[i - 1] and lst[i] > lst[i + 1]:\n count += 1\n elif lst[i] < lst[i - 1] and lst[i] < lst[i + 1]:\n count += 1\n print(count)\n\n\nif __name__ == '__main__':\n func()\n", "n = int(input())\nA = list(map(int, input().split()))\n\nif n <= 2:\n print(0)\n exit()\n\nans = 0\nfor i in range(1, n-1):\n if A[i] < A[i-1] and A[i] < A[i+1]:\n ans += 1\n if A[i] > A[i-1] and A[i] > A[i+1]:\n ans += 1\nprint(ans)\n", "c = 0\r\nn = int(input())\r\nli = input()\r\nli = list(map(int, li.split()))\r\nfor i in range(1,n-1):\r\n if ( li[i-1] > li[i] and li[i+1] > li[i] ) or ( li[i-1] < li[i] and li[i+1] < li[i] ):\r\n c += 1\r\nprint(c)\r\n", "n=int(input())\r\nn1=list(map(int,input().split()[:n]))\r\ns=0\r\nfor i in range(1,n-1):\r\n if(n1[i]<n1[i-1] and n1[i]<n1[i+1]):\r\n s=s+1\r\n elif(n1[i]>n1[i-1] and n1[i]>n1[i+1]):\r\n s=s+1\r\nprint(s)\r\n", "x=input()\r\nx=x.split()\r\nx=int(x[0])\r\ny=input()\r\ny=y.split()\r\nz=[]\r\nfor i in (y):\r\n z.append(int(i))\r\ni=1\r\nflag=0\r\nwhile i<x-1:\r\n if z[i]>z[i-1]and z[i]>z[i+1]:\r\n flag+=1\r\n i+=1\r\n elif z[i]<z[i-1] and z[i]<z[i+1]:\r\n flag+=1\r\n i+=1\r\n else:\r\n i+=1\r\n \r\n \r\nprint(flag) \r\n", "# LUOGU_RID: 101736901\nn, *a = map(int, open(0).read().split())\r\nprint(sum(a[i - 1] > a[i] < a[i + 1] or a[i - 1] < a[i] > a[i + 1] for i in range(1, n - 1)))", "n = int(input());l = [*map(int,input().split())]\r\nprint(sum((b-c)*(b-a)>0 for a,b,c in zip(l,l[1:],l[2:])))", "def count_local_extrema(arr):\r\n n = len(arr)\r\n count = 0\r\n for i in range(1, n - 1):\r\n if arr[i] > arr[i - 1] and arr[i] > arr[i + 1]:\r\n count += 1\r\n elif arr[i] < arr[i - 1] and arr[i] < arr[i + 1]:\r\n count += 1\r\n return count\r\n\r\nn = int(input())\r\narr = list(map(int, input().split()))\r\n\r\nresult = count_local_extrema(arr)\r\nprint(result)\r\n", "n = int(input())\nn_arr = list(map(int, input().split()))\nr = 0\nif (n > 2):\n for i in range(1, n-1):\n if ((n_arr[i] > n_arr[i-1] and n_arr[i] > n_arr[i+1]) or (n_arr[i] < n_arr[i-1] and n_arr[i] < n_arr[i+1])):\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\nline=list(input().split(' '))\r\nline=[int(i) for i in line]\r\ns=0\r\nfor i in range(1,n-1):\r\n if line[i-1]<line[i]>line[i+1]:\r\n s+=1\r\n elif line[i-1]>line[i]<line[i+1]:\r\n s+=1\r\nprint(s)\r\n", "n=int(input())\r\narr=[int(i) for i in input().split()]\r\nle=0\r\nfor i in range(1,n-1):\r\n\tif arr[i]>arr[i-1] and arr[i]>arr[i+1]:\r\n\t\tle+=1\r\n\telif arr[i]<arr[i-1] and arr[i]<arr[i+1]:\r\n\t\tle+=1\r\nprint(le)", "n = int(input())\r\na = list(map(int, input().split(\" \")))\r\nlocal_extremum = 0\r\nfor i in range(0, n):\r\n if i != 0 and i != n - 1:\r\n if (a[i] < a[i - 1] and a[i] < a[i + 1]) or (a[i] > a[i - 1] and a[i] > a[i + 1]):\r\n local_extremum += 1\r\nprint(local_extremum)", "a = int(input())\r\nb=list(map(int,input().split()))\r\nx=0\r\nfor i in range(1,a-1):\r\n if b[i]>b[i+1]>=b[i-1] or b[i]>b[i-1]>=b[i+1]:\r\n x+=1\r\n elif b[i]<b[i+1]<=b[i-1] or b[i]<b[i-1]<=b[i+1]:\r\n x+=1\r\nprint(x)", "n=int(input())\r\na=[int(a) for a in input().split()]\r\ncount=0\r\nfor i in range(1,n-1):\r\n if (a[i-1]<a[i] and a[i+1]<a[i]) or (a[i]<a[i-1] and a[i]<a[i+1]):\r\n count+=1\r\nprint(count)", "from sys import stdin\r\nfrom sys import stdout\r\n\r\nsprint = stdout.write\r\nsinput = stdin.readline\r\n\r\n\r\ndef func():\r\n sprint(\"F\")\r\n\r\n\r\nif __name__ == \"__main__\":\r\n t = int(sinput())\r\n t = 0\r\n arr = [int(x) for x in input().split()]\r\n for i in range(1,len(arr) - 1):\r\n if arr[i]<arr[i-1] and arr[i]<arr[i+1] or arr[i]>arr[i-1] and arr[i]>arr[i+1]:\r\n t += 1\r\n\r\n print(t)\r\n\r\n", "n = int(input())\r\n\r\nstr_numbers = input().split(\" \")\r\nnumbers = []\r\n\r\nfor i in range(len(str_numbers)):\r\n numbers.append(int(str_numbers[i]))\r\n\r\n extra = []\r\nfor i in range(1, len(numbers) - 1):\r\n if numbers[i-1] < numbers[i] > numbers[i + 1] or numbers[i-1] > numbers[i] < numbers[i + 1]:\r\n extra.append(numbers[i])\r\n\r\nprint(len(extra))", "def asd():\r\n xrange = int(input())\r\n x = list(map(int, input().split()))\r\n count = 0\r\n for i in range(xrange - 2):\r\n if x[i+1] > x[i] and x[i+1] > x[i+2]:\r\n count += 1\r\n elif x[i+1] < x[i] and x[i+1] < x[i+2]:\r\n count += 1\r\n return count\r\nprint(asd())", "n, lst, dem = int(input()), list(map(int, input().split())), 0\r\nfor x in range(1, n - 1):\r\n if (lst[x] > lst[x - 1] and lst[x] > lst[x + 1]) or (lst[x] < lst[x - 1] and lst[x] < lst[x + 1]): dem += 1\r\nprint(dem)", "nop=int(input())\r\npol= list(map(int, input().split()))\r\ncou= 0\r\nfor rat in range(1, nop- 1):\r\n if pol[rat] <pol[rat- 1] and pol[rat] <pol[rat+ 1]:\r\n cou+= 1\r\n elif pol[rat] >pol[rat- 1] and pol[rat] >pol[rat+ 1]:\r\n cou+= 1\r\nprint(cou)", "n = int(input())\r\na = input().split()\r\nt = 0\r\nfor i in range(1, n-1):\r\n x = int(a[i-1])\r\n y = int(a[i])\r\n z = int(a[i+1])\r\n if (y<x and y<z) or (y>x and y>z):\r\n t += 1\r\nprint(t)", "n=int(input())\r\na=[int(x) for x in input().split()]\r\nnum=0\r\nfor i in range(1,n-1):\r\n if a[i]>a[i-1] and a[i]>a[i+1]:\r\n num+=1\r\n elif a[i]<a[i-1] and a[i]<a[i+1]:\r\n num+=1\r\nprint(num)\r\n", "n = int(input())\r\narr = list(map(int,input().split()))\r\nans = 0\r\nfor i in range(1, len(arr)):\r\n if i - 1 >= 0 and i + 1 < len(arr):\r\n if (arr[i] < arr[i-1] and arr[i] < arr[i+1]) or (arr[i] > arr[i+1] and arr[i] > arr[i-1]):\r\n ans += 1\r\nprint(ans)", "n=int(input())\r\na=list(map(int,input().split()))\r\nans=0\r\nfor i in range(1,n-1):\r\n if (a[i]<a[i-1] and a[i]<a[i+1]) or (a[i]>a[i-1] and a[i]>a[i+1]):\r\n ans=ans+1\r\nprint(ans)\r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\nm=0\r\nfor i in range (1,n-1):\r\n if int(a[i])>int(a[i-1]) and int(a[i])>int(a[i+1]) or int(a[i])<int(a[i-1]) and int(a[i])<int(a[i+1]):\r\n m+=1\r\nprint(m)\r\n", "n = int(input())\r\na = [int(x) for x in input().split()]\r\nres = 0\r\nfor i in range(1, len(a)-1):\r\n if a[i-1] < a[i] > a[i+1] or a[i-1] > a[i] < a[i+1]:\r\n res += 1\r\nprint(res)", "n = input()\nm = input().split()\nk=[]\nfor j in range(0, len(m)):\n k.append(int(m[j]))\ncount = 0\n\nfor j in range(1,(len(m)-1)):\n if((k[j]<k[j+1]) and (k[j]<k[j-1])):\n count+=1\n elif((k[j]>k[j+1]) and (k[j]>k[j-1])):\n count+=1\nprint(count)\n \t\t\t \t\t\t\t\t\t\t\t \t\t\t \t\t\t\t \t\t\t\t", "n = int(input())\na = list(map(int, input().split()))\nans = 0\nfor i in range(1, n - 1):\n if a[i] > a[i - 1] and a[i] > a[i + 1]:\n ans += 1\n if a[i] < a[i - 1] and a[i] < a[i + 1]:\n ans += 1\nprint(ans)\n", "n = int(input())\r\na = list(map(int,input().split()))\r\nk = 0\r\nfor i in range (1,n-1):\r\n if a[i-1]>a[i]<a[i+1] or a[i-1]<a[i]>a[i+1]:\r\n k+=1\r\nprint(k)", "n = int(input())\r\nx = list(map(int, input().split()))\r\nans = 0\r\nfor i in range(1, n-1):\r\n if x[i] > x[i+1] and x[i] > x[i-1]: ans += 1\r\n elif x[i] < x[i+1] and x[i] < x[i-1]: ans += 1\r\nprint(ans)", "n=int(input())\r\nl=list(map(int,input().split()))\r\nans=0\r\nfor i in range(1,n-1):\r\n if (l[i]<l[i-1] and l[i]<l[i+1]) or (l[i]>l[i-1] and l[i]>l[i+1]):\r\n ans+=1\r\nprint(ans)\r\n", "n = int(input())\r\ncount = 0\r\na = [int(i) for i in input().split()]\r\nfor i in range(1, n - 1):\r\n if a[i] > a[i - 1] and a[i] > a[i + 1] or a[i] < a[i - 1] and a[i] < a[i + 1]:\r\n count += 1\r\nprint(count)", "a = int(input())\r\nb = list(map(int, input().split()))\r\ng = 0\r\nfor i in range(1, a-1):\r\n v = b[i]\r\n if b[i-1]<b[i]>b[i+1] or b[i-1]>b[i]<b[i+1]:\r\n g+=1\r\nprint(g)", "n=int(input())\r\nm=list(map(int,input().split()))\r\nc=0\r\nfor i in range(1,n-1):\r\n\tif (m[i]>m[i+1] and m[i]>m[i-1]) or (m[i]<m[i+1] and m[i]<m[i-1]):\r\n\t\tc+=1\r\nprint(c)\t\t\r\n\t\t", "n = int(input())\ns = list(map(int, input().split()))\ncnt = 0\nfor i in range(1, n-1):\n if (s[i] > s[i+1] and s[i] > s[i-1]) or (s[i] < s[i+1] and s[i] < s[i-1]):\n cnt += 1\nprint(cnt)\n\n\t \t\t\t \t \t \t\t\t\t \t\t \t \t\t\t\t\t\t\t", "n = int(input())\narr = [int(num) for num in input().split()]\ncount = 0\nfor i in range(1, len(arr)-1):\n\tif(arr[i-1] < arr[i] and arr[i+1] < arr[i] or arr[i-1] > arr[i] and arr[i+1] > arr[i]):\n\t\tcount += 1\nprint(count)", "n, a = int(input()), [int(i) for i in input().split()]\nres = sum(a[i - 1] < a[i] > a[i + 1] or a[i - 1] > a[i] < a[i + 1] for i in range(1, n - 1))\nprint(res)\n", "n =input()\narr =list(map(int,input().split()))\ncounter =0\nfor i in range(1,len(arr)-1):\n\tif ((arr[i] < arr[i-1] and arr[i] < arr[i+1]) or (arr[i] > arr[i-1] and arr[i] > arr[i+1])):\n\t\tcounter+=1\nprint (counter)", "n = int(input())\r\ndata = list(map(int, input().split()))\r\nans = 0\r\nif n > 2:\r\n for i in range(1, n - 1):\r\n if (data[i] > data[i + 1] and data[i] > data[i - 1]) or (data[i] < data[i + 1] and data[i] < data[i - 1]):\r\n ans += 1\r\n print(ans)\r\nelse:\r\n print(0)", "input()\r\na = list(map(int, input().split()))\r\nr = 0\r\nfor i in range(1, len(a) - 1):\r\n\tif a[i-1] > a[i] < a[i+1] or a[i-1] < a[i] > a[i+1]:\r\n\t\tr += 1\r\n\r\nprint(r)", "n=int(input())\r\na=list(map(int,input().split()))\r\ncnt=0\r\nfor i in range(1,n-1):\r\n if a[i-1]<a[i]>a[i+1] or a[i-1]>a[i]<a[i+1]:\r\n cnt+=1\r\nprint(cnt)", "n = int(input())\r\nextr = 0\r\nar = [int(i) for i in input().split()]\r\nfor i in range(1, n-1):\r\n if ar[i] > ar[i - 1] and ar[i] > ar[i + 1]:\r\n extr+=1\r\n elif ar[i] < ar[i - 1] and ar[i] < ar[i + 1]:\r\n extr+=1\r\nprint(extr)\r\n", "n=int(input())\r\nk=0\r\nl=list(map(int,input().split()))\r\nfor i in range(1,n-1):\r\n if (l[i]<l[i-1] and l[i]<l[i+1]) or (l[i]>l[i-1] and l[i]>l[i+1]):\r\n k+=1\r\nprint(k)", "n=int(input())\r\na=[int(x) for x in input().split()]\r\nc=0\r\nfor i in range(1,len(a)-1):\r\n\tif (a[i]<a[i-1] and a[i]<a[i+1]) or (a[i]>a[i-1] and a[i]>a[i+1]):\r\n\t\tc+=1\r\nprint(c)", "f = int(input())\r\ns = list(map(int, input().strip().split()))\r\nd = 1\r\neeznuts = 0\r\n\r\nwhile True:\r\n if f == 1 or f == 2 or f == 0:\r\n break\r\n else:\r\n if d == f-1:\r\n break\r\n if s[d] > s[d-1] and s[d] > s[d+1]:\r\n eeznuts = eeznuts + 1\r\n if s[d] < s[d-1] and s[d] < s[d+1]:\r\n eeznuts = eeznuts + 1\r\n d = d + 1\r\n \r\nprint(eeznuts)\r\n ", "# bsdk idhar kya dekhne ko aaya hai, khud kr!!!\r\n# from math import *\r\n# from itertools import *\r\n# import random\r\nn = int(input())\r\narr = list(map(int, input().split()))\r\ncount_ = 0\r\nfor i in range(1, n-1):\r\n if (arr[i] < arr[i-1] and arr[i] < arr[i+1]) or (arr[i] > arr[i-1] and arr[i] > arr[i+1]):\r\n count_ += 1\r\n else:\r\n continue\r\nprint(count_)\r\n", "# |\r\n# _` | __ \\ _` | __| _ \\ __ \\ _` | _` |\r\n# ( | | | ( | ( ( | | | ( | ( |\r\n# \\__,_| _| _| \\__,_| \\___| \\___/ _| _| \\__,_| \\__,_|\r\n\r\nimport sys\r\nimport math\r\nimport operator as op\r\nfrom functools import reduce\r\nfrom sys import maxsize \r\n\r\ndef read_line():\r\n\treturn sys.stdin.readline()[:-1]\r\n \r\ndef read_int():\r\n\treturn int(sys.stdin.readline())\r\n\t\r\ndef read_int_line():\r\n\treturn [int(v) for v in sys.stdin.readline().split()]\r\n\r\ndef read_float_line():\r\n\treturn [float(v) for v in sys.stdin.readline().split()]\r\n\r\ndef ncr(n, r):\r\n\tr = min(r, n-r)\r\n\tnumer = reduce(op.mul, range(n, n-r, -1), 1)\r\n\tdenom = reduce(op.mul, range(1, r+1), 1)\r\n\treturn numer / denom\r\n\r\ndef nc2(n):\r\n\treturn n*(n-1)//2\r\n\r\n# t = read_int()\r\nt = 1\r\nfor i in range(t):\r\n\tn = read_int()\r\n\ta = read_int_line()\r\n\tans = 0\r\n\r\n\tfor i in range(1,n-1):\r\n\t\tif (a[i-1]<a[i] and a[i]>a[i+1]) or (a[i-1]>a[i] and a[i]<a[i+1]):\r\n\t\t\tans +=1\r\n\r\n\tprint(ans)\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\nresult = 0\r\nif n<=2:\r\n\tprint(0)\r\nelse:\r\n\tfor i in range(1, n-1):\r\n\t\tif a[i+1]>a[i]<a[i-1] or a[i+1]<a[i]>a[i-1]:\r\n\t\t\tresult+=1\r\n\tprint(result)", "# Local Extrema\ndef extreme(arr):\n ans = 0\n for i in range(1, len(arr) - 1):\n if arr[i] < arr[i - 1] and arr[i] < arr[i + 1]: \n ans += 1\n elif arr[i] > arr[i - 1] and arr[i] > arr[i + 1]:\n ans += 1\n return ans\n\n\nn = int(input())\narr = list(map(int, input().split()))\nprint(extreme(arr))", "num_elements = int(input())\r\na = list(map(int,input().split()))\r\nans = 0\r\n#output: number of local extrema in the given array\r\nfor i in range(1,num_elements-1):\r\n if a[i-1]<a[i]>a[i+1] or a[i-1]>a[i]<a[i+1]:\r\n ans+=1\r\nprint(ans)", "n = input()\r\n\r\narr = list(map(int, input().split(' ')))\r\n\r\ncount = 0\r\nfor x in range(1, len(arr)-1):\r\n if arr[x] > arr[x-1] and arr[x] > arr[x+1]: count += 1\r\n\r\n if arr[x] < arr[x-1] and arr[x] < arr[x+1]: count += 1\r\n\r\nprint(count)", "n=int(input())\r\nlst=list(map(int,input().split()))\r\nc=0\r\nfor i in range(1,n-1):\r\n\tif (lst[i]>lst[i+1] and lst[i]>lst[i-1]) or (lst[i]<lst[i+1] and lst[i]<lst[i-1]):\r\n\t\tc+=1\r\nprint(c)", "n = int(input())\r\ncount = 0\r\na = list(map(int, input().split()))\r\nif len(a) == 1 or len(a) == 2:\r\n print(0)\r\nelse:\r\n for i in range(1, n-1):\r\n if a[i-1] < a[i] > a[i+1] or a[i-1] > a[i] < a[i+1]:\r\n count += 1\r\n print(count)", "def localextrema(arr1):\r\n n=len(arr1)\r\n count=0\r\n for i in range(1,n-1):\r\n if (arr1[i]<arr1[i-1] and arr1[i]<arr1[i+1]) or (arr1[i]>arr1[i-1] and arr1[i]>arr1[i+1]):\r\n count+=1\r\n return count\r\nn=int(input())\r\narr1=list(map(int,input().split()))\r\nprint(localextrema(arr1))\r\n", "n=int(input())\na = [int(x) for x in input().split()]\nx=0\ny=0\nfor i in range(1,n-1):\n if((a[i]>a[i+1]) and (a[i]>a[i-1])):\n x=x+1\n if((a[i]<a[i+1]) and (a[i]<a[i-1])):\n y=y+1\nprint(x+y)\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\ni = 1\r\nc = 0\r\nwhile i<n-1:\r\n if ((a[i]>a[i-1] and a[i]>a[i+1]) or (a[i]<a[i-1] and a[i]<a[i+1])):\r\n c=c+1\r\n i=i+1\r\nprint(c) ", "n=int(input())\r\nl=list(map(int,input().split()))\r\ne=0\r\nfor i in range(1,n-1):\r\n if (l[i]<l[i+1] and l[i]<l[i-1]) or (l[i]>l[i+1] and l[i]>l[i-1]):\r\n e=e+1\r\nprint(e)\r\n", "n = int(input())\r\nL = list(map(int, input().split()))\r\nans = 0\r\nfor i in range(1, n-1):\r\n if L[i] > L[i-1] and L[i] > L[i+1]:\r\n ans += 1\r\n if L[i] < L[i-1] and L[i] < L[i+1]:\r\n ans += 1\r\nprint(ans)", "n, a = int(input()), list(map(int, input().split()))\r\nprint(sum(a[i] > a[i - 1] and a[i] > a[i + 1] or a[i] < a[i - 1] and a[i] < a[i + 1] for i in range(1, n - 1)))", "n = int(input())\r\nl = list(map(int, input().split()))\r\n\r\nx = 0\r\n\r\nfor i in range(1, n - 1):\r\n\tif (l[i] > l[i - 1] and l[i] > l[i + 1]) or (l[i] < l[i - 1] and l[i] < l[i + 1]):\r\n\t\tx += 1\r\n\t\t\r\nprint(x)", "x = int(input())\r\ny = input().split()\r\nz = []\r\nk = 0\r\nfor i in range(x):\r\n y[i] = int(y[i])\r\n z.append(y[i])\r\nfor i in range(1, x-1):\r\n if z[i-1] > z[i] and z[i] < z[i+1]:\r\n k = k + 1\r\n elif z[i-1] < z[i] and z[i] > z[i+1]:\r\n k = k + 1\r\nprint(k)\r\n\r\n ", "if __name__ == '__main__':\r\n n = int(input().strip())\r\n arr = [int(__) for __ in input().strip().split()]\r\n if n <= 2:\r\n print(0)\r\n else:\r\n ans = 0\r\n for i in range(1, n - 1):\r\n if arr[i] > arr[i - 1] and arr[i] > arr[i + 1]:\r\n ans += 1\r\n elif arr[i] < arr[i - 1] and arr[i] < arr[i + 1]:\r\n ans += 1\r\n print(ans)\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\nc=0\r\nfor i in range(1,n-1):\r\n if((l[i-1]>l[i] and l[i]<l[i+1]) or (l[i]>l[i-1] and l[i]>l[i+1])):\r\n c=c+1\r\nprint(c)\r\n", "# from sys import stdin,stdout\r\n# input = stdin.readline\r\n# print=stdout.write\r\n\r\nn=int(input())\r\nar=list(map(int,input().split()))\r\nc=0\r\nfor i in range(1,n-1):\r\n\tif(ar[i-1]<ar[i]>ar[i+1] or ar[i-1]>ar[i]<ar[i+1]):\r\n\t\tc+=1\r\nprint(c)", "n = int(input());l = [*map(int,input().split())];cnt = 0\r\nfor i in range(1,n-1):\r\n if(l[i-1]<l[i]>l[i+1] or l[i-1]>l[i]<l[i+1]): cnt += 1\r\nprint(cnt)", "n = int(input())\r\nl = list(map(int,input().split()))\r\ncount = 0\r\nfor i in range(1,len(l)-1):\r\n if(l[i]>l[i-1] and l[i+1]<l[i]):\r\n count+=1\r\n if(l[i]<l[i-1] and l[i+1]>l[i]):\r\n count+=1\r\nprint(count)", "N = int(input())\r\nX = list(map(int, input().split()))\r\nprint(sum([1 for i in range(1, N - 1) if X[i - 1] < X[i] > X[i + 1] or X[i - 1] > X[i] < X[i + 1]]))\r\n\r\n# Hope the best for Ravens\r\n# Never give up\r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\ni=1\r\nc=0\r\nwhile i<n-1:\r\n if ((a[i]>a[i-1] and a[i]>a[i+1]) or (a[i]<a[i-1] and a[i]<a[i+1])):\r\n c=c+1\r\n i=i+1\r\nprint(c)", "n=int(input())\r\nc=0\r\nx=[int(y) for y in input().split(' ')]\r\nfor j in range(1,n-1):\r\n if((x[j]<x[j-1] and x[j]<x[j+1]) or (x[j]>x[j-1] and x[j]>x[j+1])):\r\n c=c+1\r\nprint(c)", "from sys import stdin, stdout\r\nn=int(stdin.readline())\r\nans=0\r\na=[int(i) for i in stdin.readline().split()]\r\nfor i in range(1,n-1):\r\n if (a[i-1]<a[i] and a[i+1]<a[i]) or (a[i-1]>a[i] and a[i+1]>a[i]):\r\n ans+=1\r\nstdout.write(str(ans))", "a = int(input())\r\nl = [int(i) for i in input().split()]\r\nans = 0\r\nfor i in range(1, a-1):\r\n if l[i] > l[i-1] and l[i] > l[i+1]:\r\n ans += 1\r\n elif l[i] < l[i-1] and l[i] < l[i+1]:\r\n ans += 1\r\nprint(ans)", "n = int(input())\r\na = [int(i) for i in input().split()]\r\nif n < 2:\r\n print(0)\r\nelse:\r\n ans = 0\r\n for i in range(1,n-1):\r\n if a[i-1] > a[i] < a[i+1]:\r\n ans += 1\r\n elif a[i-1] < a[i] > a[i+1]:\r\n ans += 1\r\n print(ans)", "n= int(input())\r\nA = list(map(int,input().split()))\r\nans = 0\r\nfor i in range(1,n-1):\r\n if(A[i]>A[i-1] and A[i]>A[i+1]) or (A[i]<A[i-1] and A[i]<A[i+1]):\r\n ans+=1\r\nprint(ans)\r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\nlocal_extremum=0\r\nfor i in range(1,n-1):\r\n if a[i]>a[i-1] and a[i]>a[i+1]:\r\n local_extremum+=1\r\n if a[i]<a[i-1] and a[i]<a[i+1]:\r\n local_extremum+=1\r\nprint(local_extremum)", "n = int(input())\r\n\r\nl = list(map(int,input().split()))\r\n\r\ncount = 0\r\n\r\nfor i in range(1,n-1):\r\n if l[i]<l[i-1] and l[i]<l[i+1]:\r\n count = count + 1\r\n elif l[i]>l[i-1] and l[i]>l[i+1]:\r\n count = count + 1\r\n \r\nprint(count)", "def solve():\r\n n = int(input())\r\n l = list(map(int,input().split()))\r\n ct = 0\r\n for i in range (1,n-1):\r\n if (l[i] < l[i-1] and l[i] < l[i+1]):\r\n ct += 1\r\n elif (l[i] > l[i-1] and l[i] > l[i+1]):\r\n ct += 1\r\n print(ct)\r\nsolve()", "n = int(input())\r\na = input().split(\" \")\r\nc = 1\r\ne = 0\r\nsum = 0\r\next = 0\r\n\r\nfor i in range(n):\r\n a[i] = int(a[i])\r\n\r\nif(n>=3):\r\n while(c < n-1):\r\n sum = a[c-1]+a[c+1]-a[c]\r\n Max = max(a[c-1],a[c],a[c+1])\r\n Min = min(a[c-1],a[c],a[c+1])\r\n if(sum < Min or sum > Max):\r\n e = e + 1\r\n c = c + 1\r\nprint(e)", "n = int(input())\r\na = [int(x) for x in input().split(\" \")]\r\nc = 0\r\nfor i in range(n-2):\r\n if (a[i] > a[i + 1] and a[i + 2] > a[i + 1]) or (a[i] < a[i + 1] and a[i + 2] < a[i + 1]):\r\n c += 1\r\nprint(c)\r\n", "n = int(input())\na = [int(elem) for elem in input().split()]\n\ns = 0\n\nfor i in range(1, n-1):\n if (a[i] > a[i+1] and a[i] > a[i-1]) or (a[i] < a[i+1] and a[i] < a[i-1]):\n s += 1\n\nprint(s)", "def extrema(arr):\r\n count=0\r\n for i in range(1,len(arr)-1):\r\n if arr[i]>arr[i-1] and arr[i]>arr[i+1]:\r\n count+=1\r\n elif arr[i]<arr[i-1] and arr[i]<arr[i+1]:\r\n count+=1\r\n\r\n return count\r\n\r\n\r\nt = int(input())\r\nprint(extrema(list(map(int, input().strip().split()))))", "a= int(input())\r\nt= list(map(int, input().split()))\r\ncount=0\r\nfor i in range(1,len(t)-1):\r\n if t[i]<t[i+1]and t[i]<t[i-1]:\r\n count+=1\r\n elif t[i]>t[i+1]and t[i]>t[i-1]:\r\n count+=1\r\nprint(count)\r\n\r\n \r\n", "n = int(input())\r\np = []\r\np = [int(x) for x in input().split()]\r\nextrema = 0\r\nfor i in range(1,n-1):\r\n if (p[i-1]>p[i]and p[i+1]>p[i]) or (p[i-1]<p[i]and p[i+1]<p[i]):\r\n extrema += 1\r\nprint(extrema)", "amount=int(input())\r\narray=[int(x) for x in input().split()]\r\ncounter=0\r\nfor i in range(1,amount-1):\r\n\tif array[i]<array[i-1] and array[i]<array[i+1] or array[i]>array[i-1] and array[i]>array[i+1]:\r\n\t\tcounter+=1\r\nprint(counter)", "n = int(input())\r\narr = list(map(int, input().split(' ')))\r\nextremacount = 0\r\n\r\ndef isextrema(arr, i):\r\n if len(arr) == 1:\r\n return False\r\n if i==0:\r\n return False\r\n if i==len(arr)-1:\r\n return False\r\n a, b, c = arr[i-1:i+2]\r\n return (b<a and b<c) or (b>a and b>c)\r\n\r\nextremacount = sum([isextrema(arr, j) for j in range(n)])\r\n\r\nprint(extremacount)", "n=int(input())\r\na=list(map(int, input().split()))\r\ns=0\r\n\r\nfor i in range(1, n-1):\r\n\tif a[i]<a[i-1]and a[i]<a[i+1]:\r\n\t\ts+=1\r\n\telif a[i]>a[i-1] and a[i]>a[i+1]:\r\n\t\ts+=1\r\nprint(s)", "n=int(input())\r\na=list(map(int,input().split()[:n]))\r\nprint(sum(1 for i in range(1,n-1) if ((a[i]>a[i-1] and a[i]>a[i+1]) or (a[i]<a[i-1] and a[i]<a[i+1]))))", "n = int(input())\r\nlst1 = list(map(int, input().split()))\r\nlst2, lst3 = lst1[1:], lst1[2:]\r\nres = sum(1 for a, b, c in zip(lst1, lst2, lst3) if (a < b > c or a > b < c))\r\nprint(res)", "n = int(input())\r\narr = list(map(int, input().split()))\r\ncount = 0\r\nfor i in range(1, n - 1):\r\n if arr[i] < arr[i - 1] and arr[i] < arr[i + 1]:\r\n count += 1\r\n elif arr[i] > arr[i - 1] and arr[i] > arr[i + 1]:\r\n count += 1\r\nprint(count)\r\n \t\t", "n = int(input())\r\na = list(map(int,input().split()))\r\nl = 0\r\nfor i in range(1,n-1):\r\n if a[i]<a[i-1] and a[i]<a[i+1]:\r\n l = l+1\r\n if a[i]>a[i-1] and a[i]>a[i+1]:\r\n l = l+1\r\nprint(l)\r\n", "n=int(input())\r\n\r\ns=input()\r\ns=s.split()\r\n\r\na=1\r\nnumber=0\r\nwhile a<n-1:\r\n if int(s[a])<int(s[a-1]) and int(s[a])<int(s[a+1]):\r\n number+=1\r\n elif int(s[a])>int(s[a-1]) and int(s[a])>int(s[a+1]):\r\n number+=1\r\n \r\n a+=1\r\n\r\nprint(number) \r\n \r\n", "n = int(input())\r\nls = list(map(int, input().split()))\r\n\r\ncnt = 0\r\nfor i in range(1, n-1):\r\n if ls[i] > ls[i-1] and ls[i] > ls[i+1]:\r\n cnt += 1\r\n if ls[i] < ls[i-1] and ls[i] < ls[i+1]:\r\n cnt += 1\r\nprint(cnt)\r\n\r\n", "n = int(input())\r\ns = input().split()\r\nfor i in range(len(s)):\r\n s[i] = int(s[i])\r\nret = 0\r\n\r\nfor i in range(1, len(s) - 1):\r\n if (s[i] < s[i - 1] and s[i] < s[i + 1]) or (s[i] > s[i - 1] and s[i] > s[i + 1]):\r\n ret += 1\r\n\r\nprint(ret)", "n = int(input())\r\na = input().split()\r\nx = 0\r\n\r\nfor i in range(len(a)):\r\n if i > 0 and i < len(a)-1:\r\n if int(a[i]) > int(a[i-1]) and int(a[i]) > int(a[i+1]):\r\n x+=1\r\n elif int(a[i]) < int(a[i-1]) and int(a[i]) < int(a[i+1]):\r\n x+=1\r\n\r\nprint(x)", "n=int(input())\r\nx=list(map(int,input().split()))\r\nif(n<=2):\r\n print(\"0\")\r\nelse:\r\n temp=0\r\n for i in range(1,n-1):\r\n if(x[i-1]<x[i]>x[i+1]):\r\n temp+=1\r\n elif(x[i-1]>x[i]<x[i+1]): \r\n temp+=1\r\n print(temp) ", "num=int(input())\r\n\r\nb=list(map(int,input().split()))\r\ncount=0\r\n\r\nif num>2:\r\n for i in range(1,num-1):\r\n if b[i]>b[i-1] and b[i+1]<b[i]:\r\n count+=1\r\n elif b[i]<b[i-1] and b[i+1]>b[i]:\r\n count+=1\r\n \r\n\r\nprint(count)", "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\nmemo = [i for i in range(1, n - 1) if data[i - 1] < data[i] and data[i + 1] < data[i] or data[i - 1] > data[i] and data[i + 1] > data[i]]\r\nprint(len(memo))", "n = int(input())\r\na = [int(i) for i in input().split()]\r\nt = 0\r\nfor i in range(1,n-1):\r\n\tif a[i-1]<a[i]>a[i+1] or a[i-1]>a[i]<a[i+1]:\r\n\t\tt+=1\r\nprint(t)\r\n", "n=int(input())\r\nx=list(map(int,input().split()))\r\nz=0\r\nfor i in range(1,n-1):\r\n\tif (x[i]<x[i+1] and x[i]<x[i-1]) or (x[i]>x[i+1] and x[i]>x[i-1]):\r\n\t\tz+=1\r\nprint(z)", "a=int(input())\r\nl=list(map(int,input().split()))\r\nans=0\r\nfor i in range(1,a-1):\r\n\tif(l[i+1]<l[i]>l[i-1] or l[i+1]>l[i]<l[i-1]):\r\n\t\tans+=1\r\nprint(ans)\r\n", "#****************************************************\r\n#***************Shariar Hasan************************\r\n#**************CSE CU Batch 18***********************\r\n#****************************************************\r\n\r\n#import os\r\n#import sys\r\nfrom math import *\r\n#import re\r\n#import random\r\n#sys.set_int_max_str_digits(int(1e9))\r\n\r\n\r\n\r\ndef solve():\r\n #for _ in range(int(input())):\r\n for _ in range(1):\r\n n = int(input())\r\n a = [int(x) for x in input().split()]\r\n if(n<3): print(0)\r\n else:\r\n extrima = 0\r\n for i in range(1, n-1):\r\n if(a[i-1] > a[i] < a[i+1] or a[i-1] < a[i] > a[i+1]): extrima += 1\r\n print(extrima)\r\n\r\n\r\n\r\n\r\nsolve()\r\n\r\n", "n = int(input())\r\nl = list(map(int,input().split()))\r\ncount = 0\r\nfor i in range(1,n-1):\r\n if l[i] < l[i+1]:\r\n if l[i] < l[i-1]:\r\n count += 1\r\n elif l[i] > l[i+1]:\r\n if l[i] > l[i-1]:\r\n count += 1\r\nprint(count)", "n=int(input())\r\ncount=0\r\ns=list(map(int, input().strip().split(\" \")))\r\nfor i in range(n-2):\r\n if(s[i+1]<s[i] and s[i+1]<s[i+2]) or (s[i+1]>s[i] and s[i+1]>s[i+2]):\r\n count+=1\r\nprint(count)", "x=input()\r\nx=int(x)\r\ny=input()\r\ny=y.split()\r\nmin1=0\r\nmax1=0\r\nfor i in range(1,x-1):\r\n \r\n if int(y[i]) < int(y[i-1]) and int(y[i])<int(y[i+1]):\r\n min1=min1+1\r\n if int(y[i])>int(y[i+1]) and int(y[i])>int(y[i-1]):\r\n max1=max1+1\r\nres=min1+max1 \r\nif x==2 or x==1:\r\n print(0)\r\nelse:\r\n print(res)\r\n \r\n \r\n", "n=int(input())\nls=input()\nls=ls.split(' ')\ni=1\nnum=0\nl=n-1\nwhile i<l:\n if (int(ls[i])>int(ls[i-1]) and int(ls[i])>int(ls[i+1])) or (int(ls[i])<int(ls[i-1]) and int(ls[i])<int(ls[i+1])):\n num+=1\n i+=1\nprint(str(num))\n \t \t\t\t\t \t\t \t \t\t \t\t \t\t\t \t \t \t", "n = int(input())\r\nlist1 = list(map(int , map(str , input().split())))\r\nextremum = 0\r\nif len(list1) == 1 or len(list1) == 2:\r\n print(0)\r\n exit()\r\nfor i in range(1 , len(list1) - 1):\r\n if list1[i] > list1[i+1] and list1[i] > list1[i-1]:\r\n extremum += 1\r\n elif list1[i] < list1[i+1] and list1[i] < list1[i-1]:\r\n extremum += 1\r\nprint(extremum)", "s = int(input())\r\nn = list(map(int,input().split()[:s]))\r\n\r\ncount = 0\r\nfor i in range(1,len(n)-1):\r\n\tif n[i]>n[i-1] and n[i]>n[i+1]:\r\n\t\tcount += 1\r\n\telif n[i]<n[i-1] and n[i]<n[i+1]:\r\n\t\tcount += 1\r\n\r\nprint(count)\r\n", "n = int(input())\r\n\r\nli = list(map(int,input().split()))\r\n\r\nk = 0\r\n\r\nfor i in range(1,n-1):\r\n if li[i]<li[i+1] and li[i]<li[i-1] or li[i]>li[i-1] and li[i]>li[i+1]:\r\n k= k+1\r\n\r\n\r\nprint(k)\r\n", "from sys import stdin, stdout\r\n\r\n\r\nN=int(stdin.readline())\r\narr=list(map(int,stdin.readline().split()))\r\ncount=0\r\nfor i in range(1,len(arr)-1):\r\n if(arr[i-1]>arr[i] and arr[i]<arr[i+1]):\r\n count+=1\r\n elif(arr[i-1]<arr[i] and arr[i]>arr[i+1]):\r\n count+=1\r\nstdout.write(str(count)+\"\\n\")", "n = int(input())\na = list(map(int, input().split()))\ncount = 0\nfor i in range(1, len(a)-1):\n if a[i] > a[i-1] and a[i] > a[i+1]:\n count += 1\n elif a[i] < a[i-1] and a[i] < a[i+1]:\n count += 1\nprint (count)\n \n\n\n \n \n\n\n\n\n\n", "def local_extrema(arr):\r\n count = 0\r\n for i in range(1, len(arr) - 1):\r\n if (arr[i] > arr[i - 1] and arr[i] > arr[i + 1]) or (arr[i] < arr[i - 1] and arr[i] < arr[i + 1]):\r\n count += 1\r\n return count\r\n \r\nn = int(input())\r\narr = list(map(int, input().split()))\r\nprint(local_extrema(arr))", "num = input()\r\narr = [int(i) for i in input().split(' ')]\r\ncount = 0\r\nfor j in range(len(arr)-2):\r\n i = j+1\r\n if (arr[i-1]-arr[i]) * (arr[i+1]-arr[i]) > 0:\r\n count += 1\r\nprint(count)\r\n", "n = int(input())\r\na = [i for i in map(int, input().split())]\r\ni, ans = 1, 0\r\nwhile i < n - 1:\r\n if (a[i] - a[i - 1]) * (a[i] - a[i + 1]) > 0:\r\n ans += 1\r\n i += 1\r\nprint(ans)", "n = int(input())\r\na = input().split(\" \")\r\nf = 0\r\nc = 0\r\ni = 1\r\nwhile i < n-1:\r\n if int(a[i-1]) > int(a[i]) < int(a[i+1]):\r\n c+=1\r\n if int(a[i-1]) < int(a[i]) > int(a[i+1]):\r\n c+=1\r\n i+=1\r\nprint(c)", "def solution(arr):\n res = 0\n for i in range(1, len(arr)-1, 1):\n if arr[i] > arr[i-1] and arr[i] > arr[i+1] or arr[i] < arr[i-1] and arr[i] < arr[i+1]:\n res += 1\n print(res)\n\n\n\nwhile True:\n try:\n n = int(input())\n arr = list(map(int, input().split()))\n solution(arr)\n except:\n break\n \t\t\t \t \t\t\t \t\t\t\t \t \t\t\t \t \t", "n=int(input())\r\nl=[int(x) for x in input().split()]\r\ncount = 0\r\nif n == 1 or n == 2:\r\n print(0)\r\nelse:\r\n for i in range(1,n-1):\r\n if l[i-1] < l[i] > l[i+1] or l[i-1] > l[i] < l[i+1]:\r\n count += 1\r\n print(count)", "input()\r\ni=[*map(int,input().split())]\r\nprint(sum(1 for x,y,z in zip(i,i[1:],i[2:]) if x>y and z>y or x<y and z<y))", "n = int(input())\r\nA = input().split()\r\nA = [int(i) for i in A]\r\ncount = 0\r\nif n ==1:\r\n print (0)\r\nelse:\r\n for i in range (1,n-1):\r\n if (A[i]-A[i-1])*(A[i]-A[i+1])>0:\r\n count += 1\r\n print (count)", "n= int(input())\r\na=[int(x) for x in input().split()]\r\ncount=0\r\nfor i in range(1,n-1):\r\n\tif a[i-1]>a[i]<a[i+1] or a[i-1]<a[i]>a[i+1] :\r\n\t\tcount=count+1\r\nprint(count)", "n = int(input())\r\na = list(map(int,input().split()))\r\ncnt = 0\r\nfor i in range(1,len(a)-1):\r\n if a[i] < a[i-1] and a[i] < a[i+1]:\r\n cnt += 1\r\n if a[i] > a[i-1] and a[i] > a[i+1]:\r\n cnt += 1\r\nprint(cnt)", "n = int(input())\nA = list(map(int, input().split()))\ncnt = 0\nfor i in range(1, n - 1):\n if (A[i] < A[i - 1] and A[i] < A[i + 1]) or (A[i] > A[i - 1] and A[i] > A[i + 1]):\n cnt += 1\nprint(cnt)", "n=int(input())\r\nl=list(map(int,input().split()))\r\nans=0\r\nfor i in range(1,n-1):\r\n if l[i]>l[i-1] and l[i]>l[i+1]:\r\n ans+=1 \r\n elif l[i]<l[i-1] and l[i]<l[i+1]:\r\n ans+=1 \r\nprint(ans) ", "input()\nv = list(map(int, input().split()))\ne = 0\nfor i, x in enumerate(v[1:-1], 1):\n if x < v[i - 1] and x < v[i + 1]:\n e += 1\n if x > v[i - 1] and x > v[i + 1]:\n e += 1\nprint(e)\n", "n = int(input())\r\na = [int(x) for x in input().split()]\r\nprint(sum([1 if (a[i] > a[i+1] and a[i] > a[i-1]) or (a[i] < a[i+1] and a[i] < a[i-1]) else 0 for i in range(1,n-1)]))", "input()\r\na = b = s = 0\r\nfor c in map(int, input().split()):\r\n if a and (a > b < c or a < b > c): s += 1\r\n a, b = b, c\r\nprint(s)\r\n", "def reversed_list(l, start, end):\r\n if start >= end:\r\n return l\r\n l[start], l[end] = l[end], l[start]\r\n return reversed_list(l, start + 1, end - 1)\r\n\r\n\r\n\r\ndef main_function():\r\n n = int(input())\r\n l = [int(i) for i in input().split(\" \")]\r\n count = 0\r\n for i in range(1, len(l) - 1):\r\n if (l[i] > l[i + 1] and l[i] > l[i - 1]) or (l[i] < l[i + 1] and l[i] < l[i - 1]):\r\n count += 1\r\n return count\r\n\r\n\r\nprint(main_function())", "n = int(input())\r\nnums = [eval(x) for x in input().split()]\r\nc = 0\r\nfor i in range(1, n-1):\r\n if (nums[i-1] < nums[i] and nums[i+1] < nums[i]) or (nums[i-1] > nums[i] and nums[i+1] > nums[i]):\r\n c += 1\r\nprint(c)", "n = int(input())\r\nlis = list(map(int,input().split()))\r\nc=0\r\nfor i in range(1,n-1):\r\n if lis[i]>lis[i-1] and lis[i]>lis[i+1]:\r\n c+=1\r\n elif lis[i]<lis[i-1] and lis[i]<lis[i+1]:\r\n c+=1\r\nprint(c) ", "import sys, os.path #=========================================================================\r\nif(os.path.exists('in.txt')):sys.stdin = open(\"in.txt\",\"r\");sys.stdout = open(\"out.txt\",\"w\")#=\r\n#=============================================================================================\r\nn = int(input())\r\nli = list(map(int, input().split()))\r\nans = 0\r\nfor i in range(1, n-1):\r\n if((li[i] < li[i+1] and li[i] < li[i-1]) or (li[i] > li[i+1] and li[i] > li[i-1])):\r\n ans += 1\r\nprint(ans)", "from collections import Counter,defaultdict,deque\r\nimport heapq as hq\r\n#alph = 'abcdefghijklmnopqrstuvwxyz'\r\n#from math import factorial as fact\r\nimport math\r\n#nl = '\\n'\r\nimport sys\r\ninput=sys.stdin.readline\r\n#print=sys.stdout.write\r\n#tt = int(input())\r\n#total=0\r\n#n = int(input())\r\n#n,m,k = [int(x) for x in input().split()]\r\n#n = int(input())\r\n#l,r = [int(x) for x in input().split()]\r\n\r\n\r\nn = int(input())\r\narr = [int(x) for x in input().split()]\r\ntotal = 0\r\nfor i in range(1,n-1):\r\n if arr[i-1] < arr[i] > arr[i+1] or arr[i-1] > arr[i] < arr[i+1]:\r\n total +=1\r\nprint(total)\r\n \r\n", "from sys import stdin\r\n\r\nn = int(input())\r\nnums = list(map(int, input().split()))\r\ncount = 0\r\nfor i in range(1, n-1):\r\n if nums[i] > nums[i-1] and nums[i] > nums[i+1]:\r\n count+=1\r\n elif nums[i] < nums[i-1] and nums[i] < nums[i+1]:\r\n count+=1\r\nprint(count)\r\n", "n = int(input())\r\narr = [int(c) for c in input().split()]\r\nres = 0\r\nfor i in range(1, n-1):\r\n if arr[i] < arr[i-1] and arr[i] < arr[i + 1]:\r\n res+=1\r\n if arr[i] > arr[i-1] and arr[i] > arr[i + 1]:\r\n res+=1\r\nprint(res)\r\n", "n = int(input().strip())\narr = [int(e) for e in input().strip().split()]\nnumber_extrema = 0\nfor i in range(1, len(arr) - 1):\n if (arr[i] > arr[i-1] and arr[i] > arr[i + 1]) or (arr[i]< arr[i+1] and (arr[i]<arr[i-1])):\n number_extrema += 1 \nprint(number_extrema) \n\n\t\t\t \t \t\t\t \t \t \t \t \t\t\t", "x=input()\nlis = [int(i) for i in input('').split()]\t\ncnt=0\nfor i in range(1,len(lis)-1):\n if (lis[i]>lis[i-1] and lis[i]>lis[i+1]) or (lis[i]<lis[i-1] and lis[i]<lis[i+1]):\n cnt+=1\nprint(cnt)\n \t\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\nret = 0\r\nfor i in range(1, n - 1):\r\n if (a[i - 1] < a[i] and a[i] > a[i + 1]) \\\r\n or (a[i - 1] > a[i] and a[i] < a[i + 1]):\r\n ret += 1\r\nprint(ret)", "\ndef list_output(n):\n print(' '.join(map(str, n)))\ndef list_input():\n return list(map(int, input().split()))\na= int(input())\nb= list_input()\nans= 0\nfor i in range(1, a-1):\n if (b[i-1] < b[i] and b[i] > b[i+1]) or (b[i-1] > b[i] and b[i] < b[i+1]):\n ans= ans+ 1\nprint(ans)\n\n", "n = int(input())\r\na = list(map(int,input().split(\" \")))\r\nc = 0\r\nfor i in range(1, n-1):\r\n if(a[i-1]<a[i]>a[i+1] or a[i-1]>a[i]<a[i+1]):\r\n c += 1 \r\nprint(c)\r\n \r\n \r\n \r\n", "n=int(input())\r\nlist=[int(i) for i in input().split()]\r\ncnt=0\r\nfor i in range(1,n-1):\r\n if(list[i]>list[i-1] and list[i]>list[i+1]):\r\n cnt+=1\r\n elif(list[i]<list[i-1] and list[i]<list[i+1]):\r\n cnt+=1\r\nprint(cnt)\r\n", "x=int(input())\r\ny=list(map(int,input().split()))\r\nc=[]\r\nfor i in range(1,x-1):\r\n if y[i]<y[i-1] and y[i]<y[i+1]:\r\n c=c+[1]\r\n elif y[i]>y[i-1] and y[i]>y[i+1]:\r\n c=c+[1]\r\nprint(len(c))\r\n", "n=input();\r\nz=list(map(int,input().split()))\r\nl=len(z)\r\ncnt=0\r\nfor i in range(1,l-1):\r\n if(z[i]>z[i-1] and z[i]>z[i+1]):\r\n cnt+=1\r\n elif(z[i]<z[i-1] and z[i]<z[i+1]):\r\n cnt+=1\r\n \r\n \r\nprint(cnt)\r\n", "n=int(input())\r\nl=[int(i) for i in input().split()]\r\nprint(sum((l[i]>l[i-1] and l[i]>l[i+1]) or (l[i]<l[i-1] and l[i]<l[i+1]) for i in range(1,n-1)))", "n = int(input()); a = [int(x) for x in input().split()]; ct = 0\r\nfor i in range(1, n - 1):\r\n if a[i] < a[i-1] and a[i] < a[i+1]: ct += 1\r\n if a[i] > a[i-1] and a[i] > a[i+1]: ct += 1\r\nprint(ct)\r\n", "\nresult = 0\n\nn = int(input())\ntab = [int(x) for x in input().split()]\n\nfor i in range(1, n - 1):\n result += 1 if (tab[i] > tab[i - 1] and \\\n tab[i] > tab[i + 1]) or \\\n (tab[i] < tab[i - 1] and \\\n tab[i] < tab[i + 1]) else 0 \n\nprint(result)\n", "n = int(input())\na = list(map(int, input().split()))\nans=0\nfor i in range(1, n-1):\n\tif (a[i] < a[i-1] and a[i] < a[i+1]) or (a[i] > a[i-1] and a[i] > a[i+1]):\n\t\tans+=1\nprint(ans)", "n = int(input())\r\n#n, m = map(int, input().split())\r\n#s = input()\r\nc = list(map(int, input().split()))\r\nl = 0\r\nfor i in range(1, n - 1):\r\n if c[i] > c[i + 1] and c[i] > c[i - 1] or c[i] < c[i + 1] and c[i] < c[i - 1]:\r\n l += 1\r\nprint(l)", "n=int(input())\r\nx=list(map(int,input().split()))\r\nk=0\r\nfor i in range(1,n-1):\r\n if(x[i]>x[i+1] and x[i]>x[i-1])or(x[i]<x[i+1] and x[i]<x[i-1]):\r\n k+=1\r\n\r\nprint(k)\r\n \r\n", "n=int(input())\r\nlst=list(map(int,input().split()))\r\nc=0\r\nfor i in range(1,len(lst)-1):\r\n if(lst[i-1]<lst[i]>lst[i+1] or lst[i-1]>lst[i]<lst[i+1]):\r\n c+=1\r\n \r\nprint(c)", "n=int(input())\r\nf=[int(i) for i in input().split()]\r\ngh=0\r\nb=0\r\nt=0\r\nfor i in range(1,n-1):\r\n b=f[i+1]\r\n gh=f[i-1]\r\n if(gh>f[i]<b or gh<f[i]>b):\r\n t=t+1\r\nprint(t)\r\n", "n = int(input())\r\na = list(map(int,input().split()))\r\n\r\nres = 0\r\n\r\nfor i in range(1,n-1):\r\n if a[i-1]<a[i]>a[i+1] or a[i-1]>a[i]<a[i+1]:\r\n res+=1\r\nprint(res)", "def main() -> None:\r\n n = int(input())\r\n a = list(map(int, input().split()))\r\n res = 0\r\n for i in range(1, n - 1):\r\n if a[i - 1] < a[i] > a[i + 1] or a[i - 1] > a[i] < a[i +1]:\r\n res += 1\r\n print(res)\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n\r\n\r\ndef ksm(a: int, k: int) -> int:\r\n res = 1\r\n while k > 0:\r\n if k & 1: res = res * a % mod\r\n a = a * a % mod\r\n k >>= 1\r\n return res\r\n", "\r\nnum = int(input())\r\narr = list(map(int, input().split()))\r\nct = 0\r\nfor i in range(len(arr)-2):\r\n if arr[i] <arr[i+1]> arr[i+2] or arr[i] > arr[i+1] < arr[i+2]:\r\n ct += 1\r\n\r\nprint(ct)\r\n\r\n\r\n\r\n\r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\nl=0\r\nfor i in range(1,len(a)-1):\r\n if(a[i+1]<a[i]>a[i-1]):\r\n l+=1\r\n elif(a[i-1]>a[i]<a[i+1]):\r\n l+=1\r\nprint(l)\r\n", "n = int(input(\"\"))\r\narr = list(map(int, input().split(\" \")))\r\ntong = 0\r\nfor i in range(0, n):\r\n if i == n - 1:\r\n break\r\n elif i == 0:\r\n continue\r\n else:\r\n if (arr[i] > arr[i - 1] and arr[i] > arr[i+1]) or (arr[i] < arr[i - 1] and arr[i] < arr[i+1]):\r\n tong += 1\r\nprint(tong)\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\nct = 0\r\n\r\nfor i in range(1,len(a)-1):\r\n if (a[i-1] > a[i] and a[i+1] > a[i] or\r\n a[i-1] < a[i] and a[i+1] < a[i]):\r\n ct += 1\r\n\r\nprint(ct)\r\n", "n = int(input())\r\nl = input()\r\nlist = list(l.split(\" \"))\r\ncount=0\r\nfor x in range(1,n-1):\r\n if((int(list[x]) > int(list[x-1]) and int(list[x]) > int(list[x+1])) or\r\n (int(list[x]) < int(list[x-1]) and int(list[x]) < int(list[x+1]) )):\r\n count+=1\r\n continue\r\nprint(count)", "n = int(input()); L = [int(x) for x in input().split()]; c = 0\r\nfor i in range(1, n-1):\r\n if (L[i] < L[i-1] and L[i] < L[i+1]) or (L[i] > L[i-1] and L[i] > L[i+1]): c+=1\r\nprint(c)\r\n", "n = int(input())\nA = list(map(int, input().split()))\nans = 0\nfor i in range(1, n-1):\n if A[i-1] < A[i] and A[i] > A[i+1]:\n ans += 1\n\n if A[i-1] > A[i] and A[i] < A[i+1]:\n ans += 1\n\nprint(ans)\n", "n = int(input())\r\nl = input().split()\r\nfor i in range(n):\r\n l[i] = int(l[i])\r\n\r\nc = 0\r\nfor i in range(1, n - 1):\r\n if ((l[i] > l[i - 1]) and (l[i] > l[i + 1])) or ((l[i] < l[i - 1]) and (l[i] < l[i + 1])):\r\n c = c + 1\r\nprint(c)", "# -*- coding: utf-8 -*-\n\n\n\ndef solve():\n n = int(input())\n a = list(map(int, input().split(' ')))\n\n ans = 0\n for i in range(1, n - 1): \n if a[i] < min(a[i - 1], a[i + 1]) or a[i] > max(a[i - 1], a[i + 1]): \n ans += 1\n print(ans)\n \ndef main():\n t = 1\n # t = int(input())\n for i in range(t):\n solve()\n\nif __name__ == \"__main__\":\n main()\n \t\t\t\t \t \t\t\t \t\t \t \t\t \t", "def find_extrema(n, lst):\r\n maxima = list()\r\n minima = list()\r\n if n >= 3:\r\n for i in range(1, n - 1):\r\n if lst[i] > lst[i - 1] and lst[i] > lst[i + 1]:\r\n maxima.append(lst[i])\r\n elif lst[i] < lst[i - 1] and lst[i] < lst[i + 1]:\r\n minima.append(lst[i])\r\n return len(minima) + len(maxima)\r\n return 0\r\n\r\n\r\nm = int(input())\r\na = [int(j) for j in input().split()]\r\nprint(find_extrema(m, a))\r\n", "n = int(input())\r\na = [int(x) for x in input().split()]\r\ncnt = 0\r\nfor i in range(1, n-1):\r\n if a[i-1]>a[i] and a[i]<a[i+1] or a[i-1]<a[i] and a[i]>a[i+1]:\r\n cnt += 1\r\nprint(cnt)\r\n", "n=int(input())\r\na=[int(i) for i in input().split()]\r\ne=0\r\nif(n>=3):\r\n for i in range(1,len(a)-1):\r\n if((a[i]<a[i-1] and a[i]<a[i+1]) or (a[i]>a[i+1] and a[i]>a[i-1])):\r\n e=e+1\r\n print(e)\r\nelse:\r\n print(0)", "n=int(input())\r\n#n,t=map(int,input().split())\r\nl=list(map(int, input().split()))\r\ns=0\r\nfor i in range(1,n-1):\r\n if l[i-1]<l[i]>l[i+1] or l[i-1]>l[i]<l[i+1]:\r\n s+=1\r\nprint(s)\r\n \r\n", "kl = int(input())\r\nedc = list(map(int, input().split()))\r\nfre = 0\r\nfor i in range(1, kl - 1):\r\n if edc[i] < edc[i - 1] and edc[i] < edc[i + 1]:\r\n fre += 1\r\n elif edc[i] > edc[i - 1] and edc[i] > edc[i + 1]:\r\n fre += 1\r\nprint(fre)\r\n", "n = int(input())\r\nli = list(map(int, input().split()))\r\ncnt = 0\r\nfor i in range(1, n-1):\r\n if li[i-1] > li[i] < li[i+1] or li[i-1] < li[i] > li[i+1]:\r\n cnt += 1\r\nprint(cnt)", "n, a = int(input()), list(map(int, input().split()))\ncnt = 0\nfor i in range(n - 2):\n\tif a[i + 1] > max(a[i + 2], a[i]) or a[i + 1] < min(a[i + 2], a[i]):\n\t\tcnt += 1\nprint(cnt)", "n = int(input())\r\ndata = [int(i) for i in input().split()]\r\n\r\nextr = 0\r\n\r\nfor i in range(1, n-1):\r\n if (data[i] > data[i+1] and data[i] > data[i-1]) or (data[i] < data[i-1] and data[i] < data[i+1]):\r\n extr += 1\r\n\r\nprint(extr)\r\n", "n=int(input())\r\nl1=[int(i) for i in input().split()]\r\ncount=0\r\nfor i in range(1,n-1):\r\n if l1[i-1]<l1[i]>l1[i+1] or l1[i-1]>l1[i]<l1[i+1]:\r\n count+=1\r\nprint(count)", "n = int(input())\r\nv = list(map(int, input().split()))\r\n\r\nans = 0\r\nfor i in range(1, n-1):\r\n\tans += (v[i-1] < v[i] > v[i+1]) or (v[i-1] > v[i] < v[i+1]) \r\n\r\nprint(ans)\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\nc=0\r\nfor i in range(1,n-1):\r\n if(l[i]>l[i-1] and l[i]>l[i+1]):\r\n c+=1\r\n elif(l[i]<l[i-1] and l[i]<l[i+1]):\r\n c+=1\r\nprint(c)\r\n", "n = int(input()) # Read integer n from input\r\ntab = list(map(int, input().split())) # Read skills of students as a list of integers\r\n\r\nb = 0\r\nfor a in range(1,n-1):\r\n if tab[a]>tab[a-1] and tab[a]>tab[a+1] or tab[a]<tab[a-1] and tab[a]<tab[a+1]:\r\n b+=1\r\nprint(b)\r\n", "n = int(input())\r\nl = list(map(int,input().split()))\r\n\r\nex = 0\r\nfor x in range(1,n-1):\r\n if (l[x]<l[x-1] and l[x]<l[x+1]) or (l[x]>l[x-1] and l[x]>l[x+1]):\r\n ex += 1\r\nprint (ex)\r\n", "n = int(input())\na = list(map(int, input().split()))\ncount = 0\nfor i in range (1, len(a) - 1):\n if (a[i] > a[i - 1] and a[i] > a[i + 1]):\n count += 1\n if (a[i] < a[i - 1] and a[i] < a[i + 1]):\n count += 1\nprint(count)\n", "import sys\r\n\r\ndef main():\r\n _, *l = map(int, sys.stdin.read().strip().split())\r\n c = 0\r\n for i, j, k in zip(l, l[1:], l[2:]):\r\n if i < j > k or i > j < k: c += 1\r\n return c\r\n \r\nprint(main())\r\n", "n=int(input())\r\na=[]\r\nfor x in input().split():\r\n a.append(int(x))\r\n\r\nk=0\r\nfor i in range(1,n-1):\r\n if a[i-1]<a[i] and a[i+1]<a[i]:\r\n k+=1\r\n if a[i-1]>a[i] and a[i+1]>a[i]:\r\n k+=1\r\nprint(k)\r\n\r\n \r\n \r\n \r\n \r\n \r\n", "n = int(input())\r\n\r\nL = [int(x) for x in input().split()]\r\n\r\nif n <= 2:\r\n print(0)\r\nelse:\r\n s = 0\r\n for i in range(1,n-1):\r\n if (L[i+1]-L[i])*(L[i-1]-L[i]) > 0:\r\n s += 1\r\n print(s)", "n=int(input())\r\nk=0\r\nl=list(map(int,input().split()))\r\nfor i in range(1,n-1):\r\n if l[i-1]<l[i]>l[i+1]:\r\n k=k+1\r\n elif l[i-1]>l[i]<l[i+1]:\r\n k=k+1\r\nprint(k)", "from cmath import *\r\nfrom dataclasses import dataclass\r\nfrom decimal import *\r\n\r\ndef solves():\r\n n=int(input())\r\n lst=list(map(int,input().split()))\r\n ans=0\r\n for i in range(1,n-1):\r\n if (lst[i]>lst[i-1] and lst[i]>lst[i+1]) or (lst[i]<lst[i-1] and lst[i]<lst[i+1]):\r\n ans+=1\r\n print(ans)\r\nt=1\r\n#t =int(input())\r\nfor _ in range(0,t):\r\n solves()\r\n", "from sys import stdin, stdout\ndef read():\n\treturn stdin.readline().rstrip()\n\ndef read_int():\n\treturn int(read())\n\ndef read_ints():\n\treturn list(map(int, read().split()))\n\ndef solve():\n\tn=read_int()\n\ta=read_ints()\n\tr=0\n\tfor i in range(1, n-1):\n\t\tif (a[i]-a[i-1])*(a[i]-a[i+1])>0:\n\t\t\tr+=1\n\tprint(r)\n\nsolve()\n", "# Wadea #\r\n\r\ns = int(input())\r\narr = list(map(int,input().split()))\r\nnum = 0\r\nfor i in range(1,s-1):\r\n if arr[i-1] < arr[i] > arr[i+1]:\r\n num += 1\r\n elif arr[i-1] > arr[i] <arr[i+1]:\r\n num += 1\r\nprint(num)", "# Local Extrema\nn = int(input())\na = list(map(int,input().split()))\nx = 0\nfor i in range(1,n-1):\n if a[i] < a[i+1] and a[i] < a[i-1] or a[i] > a[i+1] and a[i] > a[i-1]:\n x += 1\nprint(x)\n", "n = int(input())\r\nl = list(map(int, input().split()))\r\nlocal = 0\r\n\r\nfor i in range(1, n - 1):\r\n if (l[i] < l[i + 1] and l[i] < l[i - 1]) or (l[i] > l[i + 1] and l[i] > l[i - 1]):\r\n local += 1\r\nprint(local)", "n=int(input());r=[*map(int,input().split())]\r\nprint(len([i for i in range(1,n-1) if (r[i]-r[i-1])*(r[i]-r[i+1])>0]))", "n = int(input())\narr = [int(i) for i in input().split()]\n\nans = 0\n\nfor i in range(1, n - 1):\n ans += int((arr[i] > arr[i + 1] and arr[i] > arr[i - 1]) or arr[i] < arr[i + 1] and arr[i] < arr[i - 1])\n\nprint(ans)\n", "n=int(input())\r\nls=list(map(int,input().split()))\r\ncnt=0\r\nfor i in range(1,n-1):\r\n if (ls[i]>ls[i-1] and ls[i]>ls[i+1]) or (ls[i]<ls[i-1] and ls[i]<ls[i+1]):\r\n cnt+=1\r\nprint(cnt)", "input()\r\nl=list(map(int,input().split()))\r\na=0\r\nfor i in range(1,len(l)-1):\r\n if (l[i]-l[i-1])*(l[i]-l[i+1])>0:\r\n a+=1\r\nprint(a)", "n=int(input())\r\na=input().split()\r\ncount=0\r\nfor i in range(1,n-1):\r\n if(int(a[i])<int(a[i-1]) and int(a[i])<int(a[i+1])):\r\n count+=1\r\n elif(int(a[i])>int(a[i-1]) and int(a[i])>int(a[i+1])):\r\n count+=1\r\nprint(count) ", "n = int(input())\r\na = list(map(int, input().split()))\r\n\r\ncount = 0\r\n\r\nfor i in range(1,n-1):\r\n if (a[i] > a[i-1] and a[i] > a[i+1]) or (a[i] < a[i-1] and a[i] < a[i+1]):\r\n count += 1\r\n \r\nprint(count)", "import sys\r\n\r\nn = int(sys.stdin.readline())\r\na = sys.stdin.readline().split()\r\na = [int(x) for x in a]\r\nans = 0\r\nfor i in range(1,n-1):\r\n if (a[i]<a[i-1] and a[i]<a[i+1]) or (a[i]>a[i-1] and a[i]>a[i+1]):\r\n ans+=1\r\nprint(ans)\r\n#a = [int(x) for x in a]\r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\nc=0\r\nfor i in range(1,n-1):\r\n if (a[i]<a[i+1] and a[i]<a[i-1]):c+=1\r\n if (a[i] > a[i + 1] and a[i] > a[i - 1]): c += 1\r\nprint(c)", "n, = map(int,input().split())\r\narr = list(map(int,input().split()))\r\nans = 0\r\nfor i in range(1,n-1):\r\n if arr[i]>arr[i-1] and arr[i]>arr[i+1]:\r\n ans+=1\r\n if arr[i]<arr[i-1] and arr[i]<arr[i+1]:\r\n ans+=1\r\n\r\nprint(ans)", "#!/usr/bin/python\n\nn = int(input())\ndata = [int(tmp) for tmp in input().split()]\nanswer = 0\n\nfor i in range(1,n-1):\n if data[i-1] < data[i] and data[i+1] < data[i]:\n answer += 1\n elif data[i-1] > data[i] and data[i+1] > data[i]:\n answer += 1\n else:\n pass\nprint(answer)\n", "n = int(input())\r\narr = list(map(int,input().split(' ')))\r\ncnt = 0\r\nfor i in range(1,n-1):\r\n\tif(arr[i]>arr[i+1] and arr[i]>arr[i-1]):\r\n\t\tcnt+=1\r\n\telif(arr[i]<arr[i+1] and arr[i]<arr[i-1]):\r\n\t\tcnt+=1\r\nprint(cnt)", "n=int(input().strip())\na=list(map(int, input().strip().split()))\nans=0\nfor i in range(1, len(a)-1):\n if (a[i-1]<a[i] and a[i+1]<a[i]) or (a[i-1]>a[i] and a[i+1]>a[i]):\n ans+=1\nprint(ans)\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\ncount=0\r\nfor i in range(1, len(a)-1):\r\n if (a[i-1]<a[i] and a[i]>a[i+1]) or (a[i-1]>a[i] and a[i]<a[i+1]):\r\n\t count+=1 \r\nprint(count)\r\n", "from sys import stdin,stdout\r\nn=int(input())\r\na=[int(x) for x in input().split()]\r\ncnt=0\r\nfor i in range(1,n-1,1):\r\n\tif a[i]>a[i-1] and a[i]>a[i+1]:\r\n\t\tcnt+=1\r\n\telse :\r\n\t\tif a[i]<a[i-1] and a[i]<a[i+1]:\r\n\t\t\tcnt+=1\r\nprint(cnt)\r\n\t", "import sys\r\na0=[int(x) for x in sys.stdin.readline().split()]\r\na=[int(x) for x in sys.stdin.readline().split()]\r\nn=0\r\nfor i, x in enumerate(a[1:-1]):\r\n if x>a[i] and x>a[i+2]:\r\n n+=1\r\n elif x<a[i] and x<a[i+2]:\r\n n+=1\r\nprint(n)", "n=int(input())\r\nl=list(map(int,input().split()))\r\ns=0\r\nfor i in range(1,n-1):\r\n if l[i]>l[i+1] and l[i]>l[i-1]:\r\n s+=1\r\n elif l[i]<l[i+1] and l[i]<l[i-1]:\r\n s+=1\r\nprint(s)\r\n \r\n", "n = int(input())\r\nlist1 = list(map(int, input().split()))\r\nsum1 = 0\r\nfor i in range(1, n-1):\r\n if list1[i-1] < list1[i] > list1[i+1]:\r\n sum1 += 1\r\n elif list1[i-1] > list1[i] < list1[i+1]:\r\n sum1 += 1\r\nprint(sum1)", "n=int(input())\r\na=list(map(int,input().split()))\r\nif n<3:\r\n exit(print(0))\r\n\r\nans=n-2\r\nfor i in range(1,n-1):\r\n if a[i-1]<=a[i]<=a[i+1] or a[i-1]>=a[i]>=a[i+1]:\r\n ans-=1\r\nprint(ans)\r\n", "n_ = int(input())\r\nn = []\r\n[n.append(int(i)) for i in input().split()]\r\ntotal = 0\r\nfor i in range(1, n_ - 1):\r\n if n[i - 1] < n[i] > n[i + 1]:\r\n total += 1\r\n if n[i - 1] > n[i] < n[i + 1]:\r\n total += 1\r\nprint(total)", "n = int(input())\r\nl = list(map(int , input().split() ))\r\ncount = 0\r\ni = 1\r\nwhile i<len(l)-1:\r\n if l[i]<l[i+1] and l[i]<l[i-1]:\r\n count = count +1\r\n elif l[i]>l[i+1] and l[i]>l[i-1]:\r\n count = count +1\r\n i = i + 1\r\n\r\nprint(count)\r\n", "n = int(input())\r\nmas = list(map(int, input().split()))\r\nq = 0\r\nfor i in range(1, n-1):\r\n if (mas[i] < mas[i-1] and mas[i] < mas[i+1]) or (mas[i] > mas[i-1] and mas[i] > mas[i+1]):\r\n q += 1\r\nprint(q)", "n = int(input())\r\nl = list(map(int,input().split()))\r\ne = 0\r\nfor i in range(1, len(l)-1):\r\n if l[i-1] < l[i] > l[i+1] or l[i-1] > l[i] < l[i+1]:\r\n e += 1\r\nprint(e)", "buf=input()\r\na=buf.split()\r\nn=int(a[0])\r\nbuf=input()\r\na=buf.split()\r\nfor i in range(0,n):\r\n a[i]=int(a[i])\r\nk=0\r\nfor i in range(1,n-1):\r\n if (a[i]<a[i-1] and a[i]<a[i+1]) or (a[i]>a[i-1] and a[i]>a[i+1]):\r\n k=k+1\r\nprint(k)\r\n", "n = int(input())\r\nL = [0] * n\r\nl = input()\r\n\r\nx = 0\r\nlung = len(l)\r\n\r\nj = 0\r\nfor i in range(lung):\r\n if (l[i].isnumeric()):\r\n x = x * 10 + int(l[i])\r\n else:\r\n L[j] = x\r\n j = j + 1\r\n x = 0\r\nif x != 0:\r\n L[j] = x\r\n\r\nmare = mic = 0\r\nfor i in range(1, n - 1):\r\n if (L[i - 1] > L[i] and L[i + 1] > L[i]):\r\n mic = mic + 1\r\n elif (L[i - 1] < L[i] and L[i + 1] < L[i]):\r\n mare = mare + 1\r\n\r\nprint(mic + mare)\r\n", "IL = lambda: list(map(int, input().split()))\r\nI = lambda: int(input())\r\n\r\nn = I()\r\na = IL()\r\nprint(sum([a[i]<min(a[i-1], a[i+1]) or a[i]>max(a[i-1], a[i+1]) for i in range(1,n-1)]))", "n=int(input())\na=[int(x) for x in input().split()]\nif n<=2:\n\tprint(0)\n\texit(0)\nelse:\n\tans=0\n\tfor i in range(1,n-1):\n\t\tif (a[i]>a[i+1] and a[i]>a[i-1]) or (a[i]<a[i+1] and a[i]<a[i-1]):\n\t\t\tans+=1\nprint(ans)", "n = int(input(\"\"))\r\n\r\nL = list(map(int,input(\"\").strip().split()))[:n]\r\n\r\nans=0;\r\nfor i in range(1 , n-1):\r\n if((L[i-1] > L[i] and L[i+1] > L[i]) or (L[i-1] < L[i] and L[i+1] < L[i])):\r\n ans+=1;\r\n\r\nprint(ans)\r\n \r\n ", "x=int(input())\r\nz=list(map(int,input().split()))\r\nc=0\r\nfor i in range(1,x-1):\r\n if (z[i]>z[i+1] and z[i]>z[i-1]) or (z[i]<z[i+1] and z[i]<z[i-1]):\r\n c+=1\r\nprint(c)", "n = int(input())\r\narr = [int(i) for i in input().split()]\r\nc = 0\r\nfor i in range(1, n-1):\r\n if (arr[i] > arr[i-1] and arr[i] > arr[i+1]) or \\\r\n (arr[i] < arr[i-1] and arr[i] < arr[i+1]):\r\n c += 1\r\nprint(c)", "a=int(input())\r\nl=list(map(int,input().split()))\r\np=0\r\nfor k in range(1,a-1):\r\n if l[k-1]<l[k] and l[k]>l[k+1]:\r\n p+=1\r\n elif l[k-1]>l[k] and l[k]<l[k+1]:\r\n p+=1\r\nprint(p)\r\n \r\n ", "n = int(input())\r\nmoo = list(map(int, input().split()))\r\npor = 0\r\nfor i in range(1, len(moo)-1):\r\n if (moo[i] < moo[i-1] and moo[i] < moo[i+1]) or (moo[i] > moo[i-1] and moo[i] > moo[i+1]):\r\n por += 1\r\nprint(por)", "input()\r\na = [int(i) for i in input().split(' ')]\r\nextremas = 0\r\nfor j in range(len(a)-2):\r\n if (a[j+1] > a[j] and a[j+1] > a[j+2]) or (a[j+1] < a[j] and a[j+1] < a[j+2]):\r\n extremas += 1\r\nprint(extremas)", "n = input()\r\nn = int(n)\r\n\r\narray = input()\r\narray = [int(i) for i in array.split(' ')]\r\n\r\nc = 0\r\nfor i in range(1,n-1):\r\n \r\n if (array[i] < array[i-1] and array[i] < array[i+1]) or (array[i] > array[i-1] and array[i] > array[i+1]):\r\n c += 1\r\n\r\nprint(c)", "n = int(input())\na = map(int, input().split())\na = list(a)\nl, r = 0, 2\nans = 0\nwhile r < n :\n if a[l + 1] < a[l] and a[l + 1] < a[r] or (a[l + 1] > a[l] and a[l + 1] > a[r]) :\n ans += 1\n l += 1\n r += 1\nprint(ans)\n\n \t \t\t \t \t\t\t\t \t\t", "n = int(input())\r\n*a, = map(int, input().split())\r\ncnt = 0\r\nfor i in range(1, n - 1):\r\n if a[i - 1] > a[i] < a[i + 1] or a[i - 1] < a[i] > a[i + 1]:\r\n cnt += 1\r\nprint(cnt)\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\nct = 0\r\n\r\nfor x in range(1, n - 1) :\r\n if a[x-1] < a[x] > a[x+1] or a[x-1] > a[x] < a[x+1] :\r\n ct += 1\r\n \r\nprint(ct)", "n=int(input())\na=list(map(int,input().split()))\ncount=0\nfor i in range(1,len(a)-1):\n if (a[i]>a[i-1] and a[i]>a[i+1]):\n count +=1 \n elif (a[i]<a[i-1] and a[i]<a[i+1]):\n count += 1 \nprint (count)", "from array import array\n\ndef main():\n\tn, cnt = int(input()), 0\n\ta = array('h',map(int,input().split()))\n\tfor i in range(1,n-1):\n\t\tif a[i-1] > a[i] < a[i+1]:\n\t\t\tcnt += 1\n\t\telif a[i-1] < a[i] > a[i+1]:\n\t\t\tcnt += 1\n\tprint(cnt)\n\nmain()\n", "n=int(input())\r\nans=0\r\narr=list(map(int,input().split()))\r\nfor i in range(1,n-1):\r\n if arr[i]>max(arr[i-1],arr[i+1]):\r\n ans+=1\r\n if arr[i]<min(arr[i-1],arr[i+1]):\r\n ans+=1\r\nprint(ans)", "n=int(input())\r\na=list(map(int,input().split()))\r\ncount=0\r\nfor i in range(1,n-1):\r\n if a[i-1]<a[i] and a[i+1]<a[i]:\r\n count+=1\r\n elif a[i]<a[i-1] and a[i]<a[i+1]:\r\n count+=1\r\nprint(count)", "n = int(input())\r\na = [int(el) for el in input().split()]\r\n\r\nres = 0\r\nfor i in range(1, n - 1):\r\n if a[i] > a[i - 1] and a[i] > a[i + 1]:\r\n res += 1\r\n continue\r\n if a[i] < a[i - 1] and a[i] < a[i + 1]:\r\n res += 1\r\n continue\r\n \r\nprint(res)", "n = int(input())\r\nlst = list(map(int, input().split()))\r\n\r\nres = 0\r\n\r\nfor i in range(len(lst)):\r\n if i > 0 and i+1 < len(lst) and (lst[i-1] < lst[i] > lst[i+1] or lst[i-1] > lst[i] < lst[i+1]):\r\n res += 1\r\n\r\nprint(res)", "n = int(input())\r\nx = 0\r\ns = tuple(map(int, input().split()))\r\nfor i in range(1, n - 1):\r\n if s[i - 1] < s[i] > s[i + 1] or s[i - 1] > s[i] < s[i + 1]:\r\n x += 1\r\nprint(x)\r\n", "N = int(input())\r\nL = list(map(int,input().split()))\r\nlocalExtremum = sum((L[i-1]<L[i]>L[i+1] or L[i-1]>L[i]<L[i+1]) for i in range(1,N-1))\r\nprint(localExtremum)", "n=int(input());l=list(map(int,input().split()));a=0\r\nfor i in range(1,n-1):\r\n if l[i-1]<l[i]>l[i+1] or l[i-1]>l[i]<l[i+1]:\r\n a+=1\r\nprint(a)", "n = int(input())\r\nl = [int(x) for x in input().split()]\r\nlocal_ext = 0\r\nfor i in range(1,n-1):\r\n\tif (l[i-1] < l[i] > l[i+1]) or (l[i-1] > l[i] < l[i+1]):\r\n\t\tlocal_ext+=1\r\nprint(local_ext)\r\n", "class CodeforcesTask888ASolution:\n def __init__(self):\n self.result = ''\n self.n = 0\n self.array = []\n\n def read_input(self):\n self.n = int(input())\n self.array = [int(x) for x in input().split(\" \")]\n\n def process_task(self):\n extremas_cnt = 0\n for x in range(1, self.n - 1):\n if self.array[x - 1] > self.array[x] < self.array[x + 1]:\n extremas_cnt += 1\n elif self.array[x - 1] < self.array[x] > self.array[x + 1]:\n extremas_cnt += 1\n self.result = str(extremas_cnt)\n\n def get_result(self):\n return self.result\n\n\nif __name__ == \"__main__\":\n Solution = CodeforcesTask888ASolution()\n Solution.read_input()\n Solution.process_task()\n print(Solution.get_result())\n", "n = int(input())\r\na = [int(i) for i in input().split()]\r\nx = 0\r\nfor i in range(len(a)- 1):\r\n if i != 0 and i != len(a) and a[i] < a[i -1] and a[i] < a[i + 1]:\r\n x += 1\r\n if i != 0 and i != len(a) and a[i] > a[i -1] and a[i] > a[i + 1]:\r\n x += 1\r\nprint(x)\r\n ", "n = int(input());\r\narr = list(map(int, input().split()));\r\ncount = 0;\r\nfor x in range(1, n - 1):\r\n\tif arr[x] > arr[x-1] and arr[x] > arr[x+1]:\r\n\t\tcount += 1;\r\n\telse:\r\n\t\tif arr[x] < arr[x-1] and arr[x] < arr[x+1]:\r\n\t\t\tcount += 1;\r\nprint(count);", "n=int(input())\r\na=list(map(int,input().split()))\r\nk=0\r\nfor i in range (1,n-1):\r\n if a[i-1]>a[i]<a[i+1] or a[i-1]<a[i]>a[i+1]:\r\n k+=1\r\nprint(k)\r\n", "a=*map(int,[*open(0)][1].split()),\r\nprint(sum((y-x)*(y-z)>0 for x,y,z in zip(a,a[1:],a[2:])))", "def exsteme(n,a):\r\n if n<=2:\r\n return 0\r\n k=0\r\n for i in range(1,len(a)-1):\r\n if a[i-1]<a[i]>a[i+1] or a[i-1]>a[i]<a[i+1]:\r\n k+=1\r\n return k\r\nt=int(input())\r\nb=[int(i) for i in input().split()]\r\nprint(exsteme(t,b))", "n = int(input())\r\nlst = [*map(int, input().split())]\r\next = 0\r\nfor i in range(1, n - 1):\r\n if lst[i] > lst[i - 1] and lst[i] > lst[i + 1]:\r\n ext += 1\r\n if lst[i] < lst[i - 1] and lst[i] < lst[i + 1]:\r\n ext += 1\r\nprint(ext)\r\n", "n = int(input())\r\nisi = list(map(int, input().split()))\r\nnew = 0\r\nfor i in range (1,n-1):\r\n if (isi[i]<isi[i+1] and isi[i]<isi[i-1]) or (isi[i]>isi[i+1] and isi[i]>isi[i-1]):\r\n new+=1\r\n\r\nprint(new)\r\n\r\n \r\n", "n=int(input())\r\na=[int(x) for x in input().split()]\r\nan=0\r\nfor i in range(1,n-1):\r\n if a[i]>a[i-1] and a[i]>a[i+1] :\r\n an+=1\r\n elif a[i]<a[i-1] and a[i]<a[i+1]:\r\n an+=1\r\nprint(an)", "n=int(input())\r\nl=list(input().split(' '))\r\nc=0\r\nfor i in range(1,n-1):\r\n if (int(l[i])-int(l[i-1]))*(int(l[i])-int(l[i+1]))>0:\r\n c=c+1\r\nprint(c)", "\r\n\r\nn = int(input())\r\n\r\narr = list(map(int, input().split()))\r\n\r\nextreme = 0\r\n\r\nfor i, d in enumerate(arr[1:-1], start=1):\r\n\r\n if d < min(arr[i-1], arr[i+1]) or d > max(arr[i-1], arr[i+1]):\r\n extreme += 1\r\n\r\nprint(extreme)", "r=int(input())\r\nn=input().split()\r\nfor i in range(len(n)):\r\n n[i]=int(n[i])\r\n\r\ndef main(ns):\r\n es=0\r\n for i in range(1,len(ns)-1):\r\n if (ns[i]<ns[i-1] and ns[i]<ns[i+1]) or (ns[i]>ns[i-1] and ns[i]>ns[i+1]):\r\n es = es+1\r\n print(es)\r\n\r\nmain(n)\r\n", "a=int(input())\r\nb=list(map(int, input().split()))\r\ncnt=0\r\nfor i in range(1,a-1):\r\n if b[i]<b[i-1] and b[i]<b[i+1]:\r\n cnt+=1\r\n elif b[i]>b[i+1] and b[i]>b[i-1]:\r\n cnt+=1\r\nprint(cnt)", "n = int(input())\na = list(map(int, input().split()))\nans = 0\nfor i in range(1, n-1):\n if a [i-1]<a[i]>a[i+1] or a[i-1]>a[i]<a[i+1]:\n ans +=1\nprint(ans)", "a = int(input())\r\nb = list(map(int, input().split()))\r\nans_ = 0\r\n\r\nfor i in range(1, a-1):\r\n if (b[i-1] > b[i] and b[i] < b[i+1]) or (b[i-1] < b[i] and b[i] > b[i+1]):\r\n ans_ += 1\r\n\r\nprint(ans_)" ]

[ "n,m,k=map(int, input().split())\r\n\r\nl1=[]\r\nfirst={}\r\nsecond={}\r\n\r\nfor i in range(0,n):\r\n first[str(i+1)]=i\r\n\r\nfor i in range(0,m):\r\n second[str(i+1)]=i\r\n\r\nfor i in range(0,n):\r\n l1.append(input().split())\r\n\r\nfinal=[]\r\n\r\nfor i in range(0,k):\r\n q, row,col=input().split()\r\n\r\n if q=='g':\r\n final.append(l1[first[row]][second[col]])\r\n\r\n \r\n elif q=='r':\r\n a1=first[row]\r\n first[row]=first[col]\r\n first[col]=a1 \r\n # print (l1)\r\n else:\r\n a1=second[row]\r\n second[row]=second[col]\r\n second[col]=a1\r\n\r\n # print (l1)\r\n\r\nprint(\"\\n\".join(final))\r\n\r\n\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn, m, k = map(int, input().split())\r\ng = [list(map(int, input().split())) for _ in range(n)]\r\na = list(range(n+1))\r\nb = list(range(m+1))\r\nfor _ in range(k):\r\n s, x, y = input()[:-1].split()\r\n x, y = int(x), int(y)\r\n if s == 'r':\r\n a[x], a[y] = a[y], a[x]\r\n elif s == 'c':\r\n b[x], b[y] = b[y], b[x]\r\n else:\r\n print(g[a[x]-1][b[y]-1])", "'''def colchanger(l,x,y,n):\n\tfor i in range(n):\n\t\tl[i][x-1],l[i][y-1]=l[i][y-1], l[i][x-1]\n\ndef rowchanger(l,x,y,m):\n\tfor i in range(m):\n\t\tl[x-1][i],l[y-1][i]=l[y-1][i], l[x-1][i]'''\n\ndef main():\n\tn, m, k = map(int, input().split())\n\tR = {str(i): i - 1 for i in range(n+1)}\n\tC = {str(i): i - 1 for i in range(m+1)}\n\tans = []\n\tl = [input().split() for i in range(n)]\n\tfor i in range(k):\n\t\tq, x, y = input().split()\n\t\tif q == 'c':\n\t\t\tC[x], C[y] = C[y], C[x]\n\t\telif q == 'r':\n\t\t\tR[x], R[y] = R[y], R[x]\n\t\telse:\n\t\t\tans.append(l[R[x]][C[y]])\n\tprint('\\n'.join(ans))\n\t'''n,m,k = map(int, input().split())\n\tl=[]\n\tfor i in range(n):\n\t\tl.append(list(map(int, input().split())))\n\t#q=[]\n\tr=dict()\n\tc=dict()\n\t#for zzz in range(k):\n\t#\ts,x,y= [i for i in input().split()]\n\t#\tq.append([s, int(x),int(y)])\n\tfor j in range(k):\n\t\ts,x,y= input().split()\n\t\ta=int(x)-1\n\t\tb=int(y)-1\n\t\tif s=='g':\n\t\t\tprint(l[r.get(a,a)][c.get(b,b)])\n\t\telif s=='r':\n\t\t\tr[a],r[b]=r.get(b,b),r.get(a,a)\n\t\t\t#for i in range(n):\n\t\t\t\t#l[i][j[1]-1],l[i][j[2]-1]=l[i][j[2]-1], l[i][j[1]-1]\n\t\t\t#colchanger(l,i[1],i[2],n)\n\t\telse:\n\t\t\tc[a],c[b]=c.get(b,b),c.get(a,a)\n\t\t\t#for i in range(m):\n\t\t\t\t#l[j[1]-1][i],l[j[2]-1][i]=l[j[2]-1][i], l[j[1]-1][i]\n\t\t\t#rowchanger(l,i[1],i[2],m)\n\t\n\t\t\n\treturn 0'''\n\nif __name__ == '__main__':\n\tmain()\n", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\nn, m, k = map(int, input().split())\r\np = [list(map(int, input().split())) for _ in range(n)]\r\nu, v = [i for i in range(n)], [i for i in range(m)]\r\nans = []\r\nfor _ in range(k):\r\n s, x, y = input().rstrip().decode().split()\r\n x, y = int(x) - 1, int(y) - 1\r\n if s == \"r\":\r\n u[x], u[y] = u[y], u[x]\r\n elif s == \"c\":\r\n v[x], v[y] = v[y], v[x]\r\n else:\r\n ans0 = p[u[x]][v[y]]\r\n ans.append(ans0)\r\nsys.stdout.write(\"\\n\".join(map(str, ans)))", "n,m,k=map(int,input().split())\r\na=[input().split() for i in range(n)]\r\nr={str(i):i-1 for i in range(n+1)}\r\nd={str(i):i-1 for i in range(m+1)}\r\nans=[]\r\nfor i in range(k):\r\n c,x,y=input().split()\r\n if c=='r':\r\n r[y],r[x]=r[x],r[y]\r\n elif c=='c':\r\n d[y],d[x]=d[x],d[y]\r\n else: \r\n ans.append(a[r[x]][d[y]])\r\nprint('\\n'.join(ans))", "\"Template made by : https://codeforces.com/profile/c1729 , github repo : https://github.com/cheran-senthil/PyRival\"\r\nfrom __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,k=map(int,input().split())\r\n d1={}\r\n d2={}\r\n for i in range(1,n+1):\r\n d1[i]=i\r\n for i in range(1,m+1):\r\n d2[i]=i\r\n l1=[]\r\n l2=[]\r\n for i in range(0,n):\r\n l2=list(map(int,input().split()))\r\n l1.append(l2)\r\n for i in range(0,k):\r\n a,b,c=input().split()\r\n b=int(b)\r\n c=int(c)\r\n if a=='g':\r\n x=d1[b]\r\n y=d2[c]\r\n print(l1[x-1][y-1])\r\n if a=='c':\r\n temp=d2[b]\r\n d2[b]=d2[c]\r\n d2[c]=temp\r\n if a=='r':\r\n temp=d1[b]\r\n d1[b]=d1[c]\r\n d1[c]=temp\r\n \r\nif __name__ == '__main__':\r\n sync_with_stdio(False)\r\n main()", "n, m, k = map(int, input().split())\r\nR = {str(i): i - 1 for i in range(n+1)}\r\nC = {str(i): i - 1 for i in range(m+1)}\r\nans = []\r\nl = [input().split() for i in range(n)]\r\nfor i in range(k):\r\n q, x, y = input().split()\r\n if q == 'c':\r\n C[x], C[y] = C[y], C[x]\r\n elif q == 'r':\r\n R[x], R[y] = R[y], R[x]\r\n else:\r\n ans.append(l[R[x]][C[y]])\r\nprint('\\n'.join(ans))", "import sys\ninput = sys.stdin.readline\nn ,m ,k = map(int ,input().split())\nrow ,col ,Data,ans = [], [],[],[]\nfor i in range(n):\n row.append(i)\n a = list(input().split())\n Data.append(a)\nfor i in range(m):\n col.append(i)\nfor _ in range(k):\n s ,x ,y = input().split()\n x , y = int(x)-1 ,int(y)-1\n if s == 'g':\n ans.append(Data[row[x]][col[y]])\n elif s == 'r':\n tmp = row[x]\n row[x] = row[y]\n row[y] = tmp\n elif s == 'c' :\n tmp = col[x]\n col[x] = col[y]\n col[y] = tmp\nprint('\\n'.join(ans))", "n, m, k = map(int, input().split())\r\nt = [input().split() for i in range(n)]\r\nc = {str(i): i-1 for i in range(m+1)}\r\nr = {str(i): i-1 for i in range(n+1)}\r\nres = []\r\nfor i in range(k):\r\n s, x, y = input().split()\r\n if s == 'c': \r\n c[x], c[y] = c[y], c[x]\r\n elif s == 'r': \r\n r[x], r[y] = r[y], r[x]\r\n else:\r\n res.append(t[r[x]][c[y]])\r\nprint('\\n'.join(res))\r\n", "maps, ints, ranges, lists, strs, inputs = map, int, range, list, str, input\r\n\r\nrows, columns, commands = maps(ints, inputs().split())\r\ntable = []\r\nrowNum = [0]\r\ncolNum = [0]\r\nfprint = []\r\n\r\nfor i in ranges(1, rows + 1):\r\n\trowNum.append(i)\r\n\ttable.append(inputs().split())\r\n\r\nfor i in ranges(1, columns + 1):\r\n\tcolNum.append(i)\r\n\r\nfor i in ranges(commands):\r\n\tcommand, first, second = lists(inputs().split())\r\n\tfirst, second = ints(first), ints(second)\r\n\tif command == \"g\":\r\n\t\tfprint .append(table[rowNum[first] - 1][colNum[second] - 1] + \"\\n\")\r\n\telif command == \"r\":\r\n\t\trowNum[first], rowNum[second] = rowNum[second], rowNum[first]\r\n\telse:\r\n\t\tcolNum[first], colNum[second] = colNum[second], colNum[first]\r\n\r\nprint(\"\".join(fprint))", "from sys import stdin ,stdout \r\nfrom math import sqrt\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,m,k=list(map(int,input().split())) ; row=list(range(n+1)); col=list(range(m+1)) ; arr=[input().split() for i in range(n)] \r\n\r\nfor i in range(k):\r\n t,a,b=input().split() ; a=int(a) ; b=int(b)\r\n if t==\"c\":\r\n col[a],col[b]=col[b],col[a] \r\n elif t==\"r\":\r\n row[a],row[b]=row[b] , row[a]\r\n else: print(arr[int(row[a])-1][int(col[b])-1]) \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 n, m, k = [int(num) for num in input().split()]\r\n a = []\r\n rows = dict(enumerate(range(n)))\r\n cols = dict(enumerate(range(m)))\r\n for i in range(n):\r\n a.append([int(num) for num in input().split()])\r\n while k:\r\n s, x, y = input().split()\r\n x = int(x) - 1\r\n y = int(y) - 1\r\n if s == 'g':\r\n row = rows[x]\r\n col = cols[y]\r\n print(a[row][col])\r\n elif s == 'r':\r\n rows[x], rows[y] = rows[y], rows[x]\r\n else:\r\n cols[x], cols[y] = cols[y], cols[x]\r\n k -= 1\r\n\r\n\r\ndef main():\r\n t = 1\r\n while t:\r\n solution()\r\n t -= 1\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "X = list(map(int, input().split()))\r\nRow, Column = {str(i):i-1 for i in range(1, X[0]+1)}, {str(i):i-1 for i in range(1,X[1]+1)}\r\nAns = []\r\nCosmic = [input().split() for i in range(X[0])]\r\nfor _ in range(X[-1]):\r\n Temp = input().split()\r\n if Temp[0] == \"c\":\r\n Column[Temp[1]], Column[Temp[2]] = Column[Temp[2]], Column[Temp[1]]\r\n elif Temp[0] == \"r\":\r\n Row[Temp[1]], Row[Temp[2]] = Row[Temp[2]], Row[Temp[1]]\r\n else:\r\n Ans.append(Cosmic[Row[Temp[1]]][Column[Temp[2]]])\r\nprint('\\n'.join(Ans))\r\n# Hope the best for Ravens member", "n,m,k = map(int,input().split())\nt = [input().split() for i in range(n)]\nc = {str(i): i - 1 for i in range(m + 1)}\nr = {str(i): i - 1 for i in range(n + 1)}\nans = []\nfor i in range(k):\n s,x,y = input().split()\n if s == 'c': c[x],c[y] = c[y],c[x]\n elif s == 'r': r[x],r[y] = r[y],r[x]\n else: ans.append(t[r[x]][c[y]])\nprint('\\n'.join(ans))\n\t\t \t\t\t \t\t\t \t\t \t\t\t\t\t\t \t\t \t \t \t\t", "n, m, k = [int(i) for i in input().split()]\r\n\r\np = []\r\nfor i in range(n):\r\n\tp.append(input().split())\r\n\r\nrows = {str(i): i - 1 for i in range(1,n+1)}\r\ncols = {str(i): i - 1 for i in range(1,m+1)}\r\n\r\ng = []\r\nfor i in range(k):\r\n\ts, x, y = input().split()\r\n\t\r\n\tif s == \"c\":\r\n\t\tcols[x], cols[y] = cols[y], cols[x]\r\n\telif s == \"r\":\r\n\t\trows[x], rows[y] = rows[y], rows[x]\r\n\telif s == \"g\":\r\n\t\tg.append(p[rows[x]][cols[y]])\r\n\r\nprint('\\n'.join(g))", "n, m, k = map(int, input().split())\nmat = [input().split() for i in range(n)]\nrows = {str(i): i-1 for i in range(n + 1)}\ncols = {str(i): i - 1 for i in range(m + 1)}\nans = []\nfor i in range(k):\n s, x, y = input().split()\n if s == \"c\":\n cols[x], cols[y] = cols[y], cols[x]\n elif s == \"r\":\n rows[x], rows[y] = rows[y], rows[x]\n else:\n ans.append(mat[rows[x]][cols[y]])\nprint('\\n'.join(ans))\n", "\r\nfrom sys import stdin\r\n \r\ninp = stdin.readline\r\n \r\nn, m, k = map(int, inp().split())\r\ntable = []\r\n \r\nfor i in range(n):\r\n table.append(list(map(int, inp().split())))\r\n \r\nrow_status = [i for i in range(n)]\r\ncol_status = [i for i in range(m)]\r\nans = []\r\n \r\nwhile k:\r\n k -= 1\r\n op, x, y = inp().split()\r\n x = int(x) - 1\r\n y = int(y) - 1\r\n if op == \"r\":\r\n row_status[x], row_status[y] = row_status[y], row_status[x]\r\n elif op == \"c\":\r\n col_status[x], col_status[y] = col_status[y], col_status[x]\r\n else:\r\n ans.append(str(table[row_status[x]][col_status[y]]))\r\n \r\nprint(\"\\n\".join(ans))" ]

[ "n = int(input())\r\ns = input().split()\r\nmax_ = 0\r\nfor el in range(1,4):\r\n if s.count(str(el)) > max_:\r\n max_ = s.count(str(el))\r\nprint(len(s) - max_)", "from collections import Counter\n\nn, a = int(input()), (int(i) for i in input().split())\ncnt = Counter(a)\nres = min(cnt[1] + cnt[2], cnt[2] + cnt[3], cnt[1] + cnt[3])\nprint(res)\n", "n=int(input())\r\na=list(map(int,input().split()))[:n]\r\nx=0\r\ny=0\r\nz=0\r\nfor i in range(n):\r\n if a[i]==1:\r\n x+=1 \r\n elif a[i]==2:\r\n y+=1 \r\n else:\r\n z+=1\r\nif x==y and x==z:\r\n print(n-x)\r\nelse:\r\n if x>=y and x>=z:\r\n print(n-x)\r\n elif y>=x and y>=z:\r\n print(n-y)\r\n else:\r\n print(n-z)", "n = int(input())\r\n\r\ns = input()\r\nfrq = [0]*3\r\nfor i in s:\r\n if i==' ':continue\r\n frq[ord(i)-ord('1')] +=1\r\nprint(n-max(frq))\r\n\r\n \r\n", "num=int(input())\r\ncount1=0\r\ncount2=0\r\ncount3=0\r\nlist=list(map(int,input().split()))\r\nfor i in range(num):\r\n if list[i]==1:\r\n count1+=1\r\n if list[i]==2:\r\n count2+=1\r\n if list[i]==3:\r\n count3+=1\r\nmax=max(count1,count2,count3)\r\nprint(count1+count2+count3-max)", "#n, m = map(int, input().split())\r\not = 0\r\nn = int(input())\r\nf = list(map(int, input().split()))\r\np1 = f.count(1)\r\np2 = f.count(2)\r\np3 = f.count(3)\r\nif max(p1, p2, p3) == p1:\r\n ot = p2 +p3\r\nif max(p1, p2, p3) == p2:\r\n ot = p1+p3\r\nif max(p1, p2, p3) == p3:\r\n ot = p2+ p1\r\nprint(ot)", "n=int(input())\na=list(map(int,input().split()))\nc1=a.count(1)\nc2=a.count(2)\nc3=a.count(3)\nl=[c1,c2,c3]\nl.remove(max(l))\nprint(sum(l))\n\t\t\t\t \t\t \t\t \t\t\t \t\t \t\t\t \t \t\t\t", "length = int(input())\r\nsequence = input()\r\nprint(length - max(sequence.count(x) for x in \"123\"))\r\n", "n = int(input())\r\narr = list(map(int,input().split()))\r\nh = {}\r\nfor i in arr:\r\n if (i in h):\r\n h[i] += 1\r\n else:\r\n h[i] = 1\r\nprint(n-max(h.values()))\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\none_count = a.count(1)\r\ntwo_count = a.count(2)\r\nthree_count = a.count(3)\r\nmax_count = max(one_count, two_count, three_count)\r\nprint(n - max_count)", "from collections import Counter\r\n\r\nn=int(input())\r\nA=list(map(int,input().split()))\r\n\r\nC=Counter(A)\r\n\r\nMAX=0\r\nfor c in C:\r\n MAX=max(MAX,C[c])\r\n\r\nprint(n-MAX)\r\n\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\nprint(min((l.count(1)+l.count(3)),(l.count(1)+l.count(2)),(l.count(2)+l.count(3))))\r\n", "# cook your dish here\r\nn=int(input())\r\nl=input().split()\r\nc1=0\r\nc2=0\r\nc3=0\r\n#print(l)\r\nc1=l.count(\"1\")\r\nc2=l.count(\"2\")\r\nc3=l.count(\"3\")\r\nli=[c1,c2,c3]\r\n#print(li)\r\ns=max(li)\r\n#print(s)\r\nprint(n-s)", "length = int(input())\r\nnumbers = tuple(input().split())\r\na = numbers.count('1')\r\nb = numbers.count('2')\r\nc = numbers.count('3')\r\n\r\nprint(min((a + b), (a + c), (b + c)))\r\n ", "input()\ns = input().split()\nprint(len(s)-max(s.count(\"1\"),s.count(\"2\"),s.count(\"3\")))\n \t\t \t \t\t\t\t\t \t \t\t\t\t", "# n = int(input())\r\n# numbers = input()\r\n# ones, twos, threes, ans = 0, 0, 0, 0\r\n#\r\n# for i in range(len(numbers)):\r\n# if numbers[i] == '1':\r\n# ones += 1\r\n# elif numbers[i] == '2':\r\n# twos += 1\r\n# elif numbers[i] == '3':\r\n# threes += 1\r\n#\r\n# if ones > twos and ones > threes:\r\n# ans = twos + threes\r\n# elif twos > ones and twos > threes:\r\n# ans = ones + threes\r\n# else:\r\n# ans = ones + twos\r\n#\r\n# print(ans)\r\n\r\ninput()\r\narr = [0, 0, 0]\r\n\r\nfor item in [int(element) for element in input().split()]:\r\n arr[item - 1] += 1\r\n\r\narr.sort()\r\n\r\nprint(arr[0] + arr[1])\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\n\r\n# count the frequency of each number\r\ncounts = [0, 0, 0]\r\nfor num in a:\r\n counts[num-1] += 1\r\n\r\n# find the number with the highest frequency\r\nmost_common_num = counts.index(max(counts)) + 1\r\n\r\n# count the number of elements that need to be replaced\r\nnum_replacements = n - counts[most_common_num-1]\r\n\r\nprint(num_replacements)\r\n", "from collections import Counter\n\nn = int(input())\na = list(map(int, input().split()))\ncounts = Counter(a)\n\nprint(n - max(counts.values()))", "def f():\r\n n=int(input())\r\n a=list(map(int,input().split()))\r\n if(a.count(1)+a.count(2)<=a.count(1)+a.count(3) and a.count(1)+a.count(2)<=a.count(2)+a.count(3)):\r\n ans=n-a.count(3)\r\n elif(a.count(1)+a.count(3)<=a.count(1)+a.count(2) and a.count(1)+a.count(3)<=a.count(2)+a.count(3)):\r\n ans=n-a.count(2)\r\n elif(a.count(2)+a.count(3)<=a.count(1)+a.count(2) and a.count(2)+a.count(3)<=a.count(1)+a.count(3)):\r\n ans=n-a.count(1)\r\n \r\n print(ans)\r\nf()", "n=int(input())\nl=list(map(int,input().split()))\ns,t,r=0,0,0\nfor i in l:\n if i==1:\n s+=1\n elif i==2:\n t+=1\n else:\n r+=1\ns=n-s\nt=n-t\nr=n-r\ny=min(s,t,r)\nprint(int(y))\n\t \t\t \t \t \t \t\t\t \t\t \t\t \t", "n=int(input())\nz=list(map(int,input().split()))\n\none=0\ntwo=0\nthree=0\n\nfor i in z :\n if i==1 :\n one+=1\n elif i==2 :\n two+=1\n else :\n three+=1\n\nif one > two and one > three :\n print(n-one)\nelif two>one and two >three :\n print(n-two)\nelif three>one and three>two :\n print(n-three)\nelse :\n print(n-max(one,two,three))\n \t \t\t\t\t \t \t\t \t \t \t\t", "n = int(input())\r\narr = list(map(int, input().split()))\r\nmax_ = 0\r\nfor i in range(3):\r\n temp = arr.count(i + 1)\r\n if temp > max_:\r\n max_ = temp\r\nprint(n - max_)", "from statistics import mode\r\nn = int(input())\r\nlist_of_numbers = [int(x) for x in input().split()]\r\nm = mode(list_of_numbers)\r\nprint(n-list_of_numbers.count(m))\r\n", "from sys import stdin\n\ndef read_lines(sep=' ', input_type=None):\n #list of rows\n _lines = stdin.readlines()\n cast = input_type is not None\n lines = []\n for line in _lines:\n line = line[:-1].split(sep)\n if cast:\n line = [input_type(x) for x in line]\n lines.append(line)\n return lines\n\n\nimport collections\nif __name__ == '__main__':\n\n lines = read_lines(input_type=int)\n \n line = lines[1:][0]\n \n counter=[0]*4\n for x in line:\n counter[x]+=1\n \n a,b,c = counter[1:]\n \n print(min(a+b,b+c,a+c))", "n = int(input())\r\na = list(map(int, input().split()))\r\n\r\nfreq = {}\r\nfor x in a:\r\n freq[x] = freq.get(x, 0) + 1\r\n\r\nmost_frequent = max(freq, key=freq.get)\r\nreplacements = n - freq[most_frequent]\r\n\r\nprint(replacements)", "n = int(input())\r\na = list(map(int, input().split()))\r\n\r\none = n-a.count(1)\r\ntwo = n-a.count(2)\r\nth = n-a.count(3)\r\n\r\nprint(min(one, two, th))\r\n", "x = int(input())\nnum = input().split()\ncount1=0\ncount2=0\ncount3=0\nfor i in num:\n if i==\"1\":\n count1+=1\n elif i==\"2\":\n count2+=1\n else:\n count3+=1\nout =max([count1,count2,count3])\nreplacements = count1 + count2 + count3 - out\nprint(replacements)\n\t \t \t \t \t\t \t\t\t\t \t \t \t\t", "length = int(input())\r\nsequence = [int(x) for x in input().split()]\r\ncounts = {}\r\noccurrences = []\r\nfor i in sequence:\r\n if i not in counts:\r\n counts[i] = 1\r\n else:\r\n counts[i] += 1\r\n# print(counts)\r\nfor v in counts.values():\r\n occurrences.append(v)\r\noccurrences.sort()\r\nprint(sum(occurrences) - occurrences[-1])\r\n", "count = [0] * 4\r\n\r\nn = int(input())\r\nno = list(map(int, input().split()))\r\nfor temp in no:\r\n count[temp] += 1\r\n\r\ncount.sort()\r\nprint(count[1] + count[2])", "n = int(input())\r\narr = list(map(int,input().split()))\r\narr.sort()\r\n\r\na = arr.count(1)\r\nb = arr.count(2)\r\nc = arr.count(3)\r\n\r\n\r\nr1 = a + b\r\nr2 = b + c\r\nr3 = a + c\r\n\r\nprint(min(r1 , r2 , r3))\r\n\r\n", "import sys\r\nfrom array import array # noqa: F401\r\n\r\n\r\ndef input():\r\n return sys.stdin.buffer.readline().decode('utf-8')\r\n\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\nprint(n - max(a.count(i) for i in range(1, 4)))\r\n", "n = int(input())\r\n\r\nsequence = input().split()\r\ncount = 0\r\n\r\nif sequence.count(\"1\") >= sequence.count(\"2\") and sequence.count(\"1\") >= sequence.count(\"3\"):\r\n count += (sequence.count(\"2\") + sequence.count(\"3\"))\r\nelif sequence.count(\"2\") >= sequence.count(\"1\") and sequence.count(\"2\") >= sequence.count(\"3\"):\r\n count += (sequence.count(\"1\") + sequence.count(\"3\"))\r\nelif sequence.count(\"3\") >= sequence.count(\"1\") and sequence.count(\"3\") >= sequence.count(\"2\"):\r\n count += (sequence.count(\"1\") + sequence.count(\"2\"))\r\n\r\nprint(count)\r\n", "tc = 1\r\nwhile tc:\r\n tc-=1\r\n n = int(input())\r\n ls = list(map(int, input().split()))\r\n print(n-max(ls.count(1), ls.count(2), ls.count(3)))", "n=int(input())\na=list(map(int,input().split()))\np=a.count(1);p1=a.count(2);p2=a.count(3)\na=max(p,p1,p2);c=min(p,p1,p2);b=(p+p1+p2)-(a+c)\nprint(b+c)\n\n \t \t \t\t \t \t \t\t \t\t \t\t\t", "n=input()\r\nl=list(map(int,input().split()))\r\na=l.count(1)\r\nb=l.count(2)\r\nc=l.count(3)\r\nif(a>=b and a>=c):\r\n print(b+c)\r\nelif(b>=a and b>=c):\r\n print(a+c)\r\nelse:\r\n print(a+b)", "input()\r\nnums = input().split()\r\nprint(min([len(nums)-nums.count(\"1\"), len(nums)-nums.count(\"2\"), len(nums)-nums.count(\"3\")]))", "input()\r\np = list(map(int,input().split()))\r\np1=[len([i for i in p if i==1]),len([i for i in p if i==2]),len([i for i in p if i==3])]\r\np1.sort()\r\nprint(p1[0]+p1[1])", "def main():\r\n n = int(input())\r\n L = list(map(int, input().split()))\r\n a = [0] * 3\r\n for i in range(n):\r\n a[L[i] - 1] += 1\r\n \r\n print(n - max(a))\r\n \r\n \r\nmain()", "n = int(input())\r\narr = list(map(int,input().strip().split()))\r\nx = arr.count(1)\r\ny = arr.count(2)\r\nz = arr.count(3)\r\nans1 = max(x,y)\r\nans2 = max(ans1,z)\r\n\r\nprint(len(arr)-ans2)", "n=int(input())\na=input()\nprint(n-max(a.count(x)for x in '123'))\n \t\t \t \t \t\t\t\t \t\t \t\t \t\t\t", "count = input()\r\nallNums = input()\r\nprint( \r\n int(count) \r\n - max([\r\n [int(j) for j in allNums.split()].count(i)\r\n for i in [1,2,3]\r\n ]))", "n = int(input())\r\nseq = str(input())\r\n\r\ncount = max(seq.count(\"1\"), seq.count(\"2\"), seq.count(\"3\"))\r\nprint(len(seq.split(\" \"))-count)", "n=int(input())\narr=list(map(int,input().split()))\narr1=[]\narr1.append(arr.count(1))\narr1.append(arr.count(2))\narr1.append(arr.count(3))\narr1.sort()\nprint(arr1[0]+arr1[1])", "n=int(input())\r\ns=[int(i) for i in input().split()]\r\na=s.count(1)\r\nb=s.count(2)\r\nc=s.count(3)\r\nr=min(a+b,a+c,b+c)\r\nprint(r)", "n = int(input())\r\na = list(map(int ,input() .split()))\r\nq = a .count(3)\r\nw = a .count(2)\r\ne = a .count(1)\r\nans = max(q ,w ,e)\r\nif ans == q:\r\n print(w + e)\r\nelif ans == w:\r\n print(q + e)\r\nelse:\r\n print(q + w)", "__author__ = 'dwliv_000'\r\nn=int(input())\r\nc={}\r\nc[1]=0\r\nc[2]=0\r\nc[3]=0\r\ns=input().split()\r\nfor j in s:\r\n c[int(j)]+=1\r\n\r\nprint(n-max(c.values()))", "import sys\r\n\r\nn_nums = int(sys.stdin.readline())\r\nvalues = [int(x) for x in sys.stdin.readline().split()]\r\n\r\none, two, three = 0, 0, 0\r\nfor i in values:\r\n if i == 1:\r\n one += 1\r\n if i == 2:\r\n two += 1\r\n if i == 3:\r\n three += 1\r\n\r\nresult = one + two + three - max(one, two, three)\r\nprint(result)\r\n", "n = int(input())\r\ns = list(map(int, input().split()))\r\nprint(n-max(s.count(x) for x in [1, 2, 3]))", "n=int(input())\r\n# a=list(int(input()))\r\n\r\na=input()\r\n\r\na=a.split(' ')\r\n\r\nfor i in range(n):\r\n a[i]=int(a[i])\r\n \r\n# count_num=[0 0 0]\r\n# for i in range(n):\r\n# if a[i]==1:\r\n# count[0]+=1\r\n# elif a[i]==2:\r\n# count[1]+=1\r\n# elif a[i]==3:\r\n# count[2]+=1\r\n\r\ncount_123=[0,0,0]\r\nfor i in range(1,4):\r\n count_123[i-1]=a.count(i)\r\n\r\nmax_123=max(count_123)\r\nsum_123=sum(count_123)\r\n\r\noutput_123=sum_123-max_123\r\nprint(output_123)\r\n \r\n \r\n\r\n\r\n\r\n\r\n", "n=int(input())\r\nnum = input()\r\nl = [int(number) for number in num.split(' ')]\r\ncou = [ l.count(i) for i in range(1,4)]\r\nnum2 = 0\r\nfor i in range(3):\r\n if max(cou) == cou[i]:\r\n check = i+1\r\n for j,val in enumerate(l):\r\n if val != check:\r\n num2+=1\r\n break\r\nprint(num2)", "inp1 = int(input())\r\ninp2 = input().split()\r\na = inp2.count('1')\r\nb = inp2.count('2')\r\nc = inp2.count('3')\r\nmax1 = max(a,b,c)\r\nprint(abs(max1-inp1))\r\n\r\n", "n=int(input())\r\na=input().split()\r\ns1=s2=s3=0\r\nfor i in range(0,len(a)):\r\n if int(a[i])==1:\r\n s1+=1\r\n elif int(a[i])==2:\r\n s2+=1\r\n else:\r\n s3+=1\r\nif s1==max(s1,s2,s3):\r\n print(s2+s3)\r\nelif s2==max(s1,s2,s3):\r\n print(s1+s3)\r\nelse:\r\n print(s1+s2)", "from collections import Counter\r\nn=int(input())\r\nl=list(map(int,input().split()))\r\nc=list(Counter(l).values())\r\nc.sort(reverse=True)\r\nm=c[0]\r\nc.pop(0)\r\nprint(sum(c))", "\"\"\"\r\nЗадана последовательность целых чисел a1,a2,...,an, в которой каждое число от 1 до 3 включительно.\r\nТребуется заменить в ней наименьшее количество чисел так, чтобы все числа в последовательности оказались равны между собой.\r\n\r\nВходные данные\r\nВ первой строке задано целое число n (1≤n≤106). Вторая строка содержит последовательность целых чисел a1,a2,...,an (1≤ai≤3).\r\n\r\nВыходные данные\r\nВыведите наименьшее количество изменений, которое надо сделать, чтобы уравнять все числа в последовательности.\r\n\"\"\"\r\n\r\nn = int(input())\r\na = [int(i) for i in input().split()]\r\nprint(n - max(a.count(1), a.count(2), a.count(3)))", "# LUOGU_RID: 99753410\nn=int(input())\nx=input().split()\nk=[0,0,0]\nfor i in x:\n k[int(i)-1]+=1\nk.sort()\nprint(n-k[2])", "n = int(input())\r\ns = input()\r\nprint(n - max(s.count(i) for i in '123'))", "from collections import Counter\r\n\r\nn = int(input())\r\nxs = input().split()\r\n\r\nmaxfreq = Counter(xs).most_common(1)[0][1]\r\nprint(n - maxfreq)\r\n", "from collections import Counter\r\n\r\nn = int(input())\r\nlst = list(map(int, input().split()))\r\nc = Counter(lst)\r\nprint(n - max(c.values()))", "n=int(input())\r\na=list(map(int,input().split()))\r\n\r\nuno=0\r\ndos=0\r\ntres=0\r\n\r\nfor i in range(n):\r\n if a[i]==1:\r\n uno+=1\r\n elif a[i]==2:\r\n dos+=1\r\n else:\r\n tres+=1\r\n\r\nprint(uno+dos+tres-max(uno,dos,tres))\r\n", "n = int(input())\na = list(map(int, input().split()))\n\non = t = tr = 0\nfor i in a:\n if i == 1:\n on+=1\n elif i == 2:\n t+=1\n else:\n tr+=1\nprint(n-max(on, t, tr))\n \t\t \t \t \t \t \t\t \t \t \t \t \t", "n = int(input())\r\nC = [0]*4\r\n\r\nfor a in map(int, input().split()):\r\n C[a] += 1\r\n\r\nprint(n - max(C))", "n=int(input())\r\nm=list(map(int,input().split()))\r\nv1=0\r\nv2=0\r\nv3=0\r\n\r\nfor i in m:\r\n if i==1:\r\n v1+=1\r\n \r\n elif i==2:\r\n v2+=1\r\n \r\n else:\r\n v3+=1\r\n\r\ns=[v1,v2,v3]\r\ns=sorted(s)\r\nprint(s[0]+s[1])", "from collections import Counter as c\r\nL=int(input())\r\nA=list(map(int,input().split()))\r\n\r\n\r\nvar=c(A)\r\n\r\nmax_val=list(var.values())\r\nmax_val=max(max_val)\r\n\r\nprint(L-max_val)", "input()\r\narr = [int(x) for x in input().split()]\r\nvals = [arr.count(1), arr.count(2), arr.count(3)]\r\nvals.sort()\r\nprint(vals[0] + vals[1])\r\n", "from collections import Counter\r\n\r\nN = int(input())\r\nCounter = Counter(list(map(int, input().split())))\r\nprint(N - max(Counter.values()))\r\n\r\n# Hope the best for Ravens\r\n# Never give up\r\n", "n = int(input())\r\nA = list(map(int, input().split()))\r\nprint(n - max(A.count(1), A.count(2), A.count(3)))\r\n", "import sys\ninput = sys.stdin.buffer.readline\nt = int(input())\na = list(map(int, input().split()))\ncount = [0] * 4\nfor i in a:\n\tcount[i]+=1\nm = max(count)\ntotal = sum(count)-m\nprint(total)\n\n\t\n", "n=int(input())\r\na=[int(x) for x in input().split()]\r\nk=(a.count(1))\r\nl=(a.count(2))\r\nm=(a.count(3))\r\nc=max(k,l,m)\r\nprint(k+l+m-c)", "x=int(input())\r\nz=list( input().split())\r\ny=z.count(\"3\")\r\na=z.count(\"2\")\r\ns=z.count(\"1\")\r\nif (y>=a and y>s) or (y>a and y>=s):\r\n print(len(z)-y)\r\nelif (a>=y and a>s) or (a>y and a>=s):\r\n print(len(z)-a)\r\nelif (a==y and a==s) or (a==y and a==s):\r\n print(len(z)-a)\r\nelse:print(len(z)-s) \r\n", "import statistics\r\nn=int(input())\r\na=input()\r\na=a.split()\r\na=list(map(int, a))\r\nmode=statistics.mode(a)\r\nprint(n-a.count(mode))", "n = int(input())\r\na = list(map(int, input().split()))\r\n\r\nmost_frequent_num = max(set(a), key=a.count)\r\nnon_matching_count = sum(1 for num in a if num != most_frequent_num)\r\n\r\nprint(non_matching_count)", "n=int(input())\r\na=list(map(int, input().split()))\r\na1=a.count(1)\r\na2=a.count(2)\r\na3=a.count(3)\r\nprint(n-max(a1,a2,a3))\r\n", "n = int(input())\r\ndef process(A):\r\n d = [0, 0, 0]\r\n for x in A:\r\n d[x-1]+=1\r\n return sum(d)-max(d)\r\n \r\nA = [int(x) for x in input().split()]\r\nprint(process(A))", "n = int(input())\r\na = [int(x) for x in input().split()]\r\nprint(n - max([a.count(1), a.count(2), a.count(3)]))", "value=int(input())\r\nvalue2=list(map(int,input().split()))\r\nz=value2.count(1)\r\nx=value2.count(2)\r\ny=value2.count(3)\r\nlist=[x,y,z]\r\nlist.sort()\r\nprint(value-list[2])\r\n\r\n", "n=int(input())\n\na=list(map(int,input().split()))\nb=a.count(1)\nc=a.count(2)\nd=a.count(3)\nmaxx=max(b,c,d)\nprint(n-maxx)\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\n\r\n# Find the most frequent number\r\nmost_frequent_num = max(set(a), key = a.count)\r\n\r\n# Count the number of non-matching elements\r\nnon_matching_count = sum(1 for num in a if num != most_frequent_num)\r\n\r\nprint(non_matching_count)", "n = int(input())\r\nl = [int(i) for i in input().split()]\r\nn1 = l.count(1)\r\nn2 = l.count(2)\r\nn3 = n - n1 - n2\r\nprint(n - max(n1,n2,n3))\r\n", "n=int(input())\r\nl=[int(x) for x in input().split(' ')]\r\nd=[l.count(i) for i in set(l)]\r\nprint(n-max(d))", "\r\n\r\nfreq={}\r\nn=int(input())\r\na=list(map(int,input().split()))\r\nif len(set(a))==1:\r\n print(0)\r\nelse: \r\n freq=[0]*3\r\n for e in a:\r\n freq[e%3]+=1\r\n u=min(freq[1]+freq[2],freq[2]+freq[0],freq[1]+freq[0])\r\n print(u)\r\n\r\n \r\n \r\n ", "n=int(input())\r\narr=list(map(int,input().split()))\r\ns1=arr.count(1)\r\ns2=arr.count(2)\r\ns3=arr.count(3)\r\nprint(n-max(s1,s2,s3))", "d = {1: 0, 2: 0, 3: 0}\r\n\r\ninput()\r\nfor n in map(int, input().split()):\r\n d[n] += 1\r\n \r\nprint(sum(d.values()) - max(d.values()))", "n = int(input())\r\na = list(map(int, input().split()))\r\nprint(n-max(a.count(1),a.count(2),a.count(3)))", "#52A\r\nn=int(input())\r\ns=list(map(int,input().split()))\r\ns1=s2=s3=0\r\nfor i in range(n):\r\n if s[i]==1:\r\n s1+=1\r\n elif s[i]==2:\r\n s2+=1\r\n elif s[i]==3:\r\n s3+=1\r\nif max(s1,s2,s3)==s1:\r\n print(s2+s3)\r\nelif max(s1,s2,s3)==s2:\r\n print(s1+s3)\r\nelif max(s1,s2,s3)==s3:\r\n print(s1+s2)", "n = int(input())\r\ncont = [int(item) for item in input().split(' ')]\r\ncount1, count2, count3 = 0, 0, 0\r\n\r\nfor i in range(n):\r\n if cont[i] == 1:\r\n count1 += 1\r\n elif cont[i] == 2:\r\n count2 += 1\r\n else:\r\n count3 += 1\r\ntemp = max(count1,count2,count3)\r\n\r\nprint(count1+count2+count3-temp)\r\n", "from collections import Counter\r\n\r\ntotal_numbers = int(input())\r\nnumbers = [int(x) for x in input().split()]\r\n\r\ncounts = dict(Counter(numbers))\r\nmax_value, _ = max(zip(counts.values(), counts.keys()))\r\ntotal_replacements = total_numbers - max_value\r\n\r\nprint(total_replacements)\r\n", "size = int(input())\n\nsequence = list(map(int , input().split(\" \")))\n\nfreq = [sequence.count(i) for i in range(1 , 4)]\nfreq.sort()\nprint(size - freq[-1])\n\n\n", "length = int(input())\r\nnumbers = input().split()\r\na = numbers.count('1')\r\nb = numbers.count('2')\r\nc = numbers.count('3')\r\n\r\nif a == length or b == length or c == length:\r\n print(0)\r\nelse:\r\n print(min((a + b), (a + c), (b + c)))", "x=int(input())\r\ns=[int(n) for n in (input()).split()]\r\na=s.count(1)\r\nb=s.count(2)\r\nc=s.count(3)\r\nz=int((a+b+abs(a-b))/2)\r\nz=int((z+c+abs(z-c))/2)\r\nprint(x-z)", "n=int(input())\r\ns=input()\r\nx=n-max(s.count('1'),s.count('2'),s.count('3'));\r\nprint (x);", "n, t = int(input()), input()[:: 2]\r\na, b = t.count('1'), t.count('2')\r\nprint(n - max(a, b, n - a - b))", "n = int(input())\r\nst = input()\r\nalist = [int(a) for a in st.split()]\r\nc1 = c2 = c3 = 0\r\nfor i in range(n):\r\n x = alist[i]\r\n if (x == 1):\r\n c1 += 1\r\n elif (x == 2):\r\n c2 += 1\r\n else:\r\n c3 += 1\r\nprint(n - max(c1, c2, c3))\r\n", "n=int(input())\r\nstr1=input()\r\nprint(n-max(str1.count('1'),str1.count('2'),str1.count('3')))", "import sys\n\ndata = []\nfor line in sys.stdin:\n if line[-1] == \"\\n\":\n data.append(line[:-1])\n else:\n data.append(line)\n\n\nl = data[1].split(\" \")\n\nrecord = [0, 0, 0]\nfor i in l:\n if i == '1':\n record[0] += 1\n elif i == '2':\n record[1] += 1\n else:\n record[2] += 1\n\nsum = 0\nbigger = 0\nfor n in record:\n if n <= bigger:\n sum += n\n else:\n sum += bigger\n bigger = n\n\nassert(sum + bigger == int(data[0]))\nprint(sum)", "'''\r\n╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬\r\n╬╬ ▓▓ ▓▓ ╬╬\r\n╬╬ ▓▓ ▓▓ ╬╬\r\n╬╬ ▓▓█████▓▓ ╬╬\r\n╬╬ ▓▓ ▓▓ ╬╬\r\n╬╬ ▓▓ ▓▓ ╬╬\r\n╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬\r\n\r\n###########################\r\n\r\n// •︿• \\\\\r\n/\\\\ //\\\r\n /\\\\ //\\\r\n /\\\\//\\\r\n\r\n###########################\r\n'''\r\nimport sys\r\ninput = lambda : sys.stdin.readline().strip()\r\nimport math as mth\r\nfrom math import ceil as cl\r\nfrom math import log2 as l2\r\nfrom math import factorial as fct\r\nfrom collections import Counter as CNT\r\nmod = 10**9 + 7\r\ndef ii():\r\n return int(input())\r\ndef fi():\r\n return float(input())\r\ndef lii():\r\n return list(map(int, input().split()))\r\ndef ss():\r\n return input()\r\ndef lss():\r\n return input().split()\r\ndef yes():\r\n print(\"YES\")\r\ndef no():\r\n print(\"NO\")\r\n'''\r\n╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬\r\n'''\r\n\r\nn = ii()\r\nlis= lii()\r\nstr1 = str(lis)\r\na = str1.count(\"1\")\r\nb = str1.count(\"2\")\r\nc = str1.count(\"3\")\r\nmaximum = max(a,b,c)\r\nprint(len(lis)-maximum)\r\n\r\n\r\n\r\n\r\n \r\n \r\n \r\n", "n = int(input())\r\ninput_list = list(map(int, input().split()))\r\nmin_num = min(input_list)\r\nmax_num = max(input_list)\r\n\r\ncount = [0] * (max_num - min_num + 1)\r\nfor num in input_list:\r\n count[num - min_num] += 1\r\n\r\nmax_count = max(count)\r\n\r\nprint(n - max_count)", "a=int(input())\r\nv=input().split()\r\nx=v.count(\"1\")\r\ny=v.count('2')\r\nz=v.count('3')\r\ng=max(x,y,z)\r\nl=x+y+z-g\r\nprint(l)", "# n = int(input())\r\n# counterOfOne = 0\r\n# counterOfTwo = 0\r\n# counterOfThree = 0\r\n#\r\n# arr = [int(item) for item in input().split(' ')]\r\n#\r\n# for i in range(len(arr)):\r\n# if arr[i] == 1:\r\n# counterOfOne += 1\r\n# elif arr[i] == 2:\r\n# counterOfTwo += 1\r\n# elif arr[i] == 3:\r\n# counterOfThree += 1\r\n#\r\n# if counterOfOne == 0:\r\n# print(counterOfTwo if counterOfTwo < counterOfThree else counterOfThree)\r\n# elif counterOfTwo == 0:\r\n# print(counterOfOne if counterOfOne < counterOfThree else counterOfThree)\r\n# elif counterOfThree == 0:\r\n# print(counterOfTwo if counterOfTwo < counterOfOne else counterOfOne)\r\n#\r\n# elif counterOfOne + counterOfTwo < counterOfOne + counterOfThree and \\\r\n# counterOfOne + counterOfTwo < counterOfThree + counterOfTwo:\r\n# print(counterOfOne + counterOfTwo)\r\n# elif counterOfOne + counterOfThree < counterOfOne + counterOfTwo \\\r\n# and counterOfOne + counterOfThree < counterOfTwo + counterOfTwo:\r\n# print(counterOfOne + counterOfThree)\r\n# elif counterOfTwo + counterOfThree < counterOfTwo + counterOfOne \\\r\n# and counterOfTwo + counterOfThree < counterOfThree + counterOfTwo:\r\n# print(counterOfTwo + counterOfThree)\r\n\r\ninput()\r\n\r\narr = [0, 0, 0]\r\n\r\nfor item in input().split(' '):\r\n arr[int(item) - 1] += 1\r\n\r\narr.sort()\r\nprint(arr[0] + arr[1])\r\n\r\n", "n = int(input())\r\nl = list(map(int, input().split(\" \")))\r\nk = [l.count(1), l.count(2), l.count(3)]\r\nprint(n - max(k))", "n=int(input())\r\narr = [int(i) for i in input().split()]\r\na=arr.count(1)\r\nb=arr.count(2)\r\nc=arr.count(3)\r\n\r\nmin=b+c\r\nif min>(a+c):\r\n min=a+c\r\nif min>(a+b):\r\n min=a+b\r\nprint(min)\r\n\r\n", "n=input()\r\narr=input()\r\n\r\na=arr.count('1')\r\nb=arr.count('2')\r\nc=arr.count('3')\r\n\r\nif(a<b):a=b\r\nif(a<c):a=c\r\n\r\nprint(int(n)-a)", "\r\nfrom collections import Counter\r\nn = int(input())\r\nl = list(map(int, input().split()))\r\n\r\ncc = Counter(l)\r\nvals = list(cc.values())\r\n\r\nprint(n - max(vals))", "n=int(input())\r\nl=list(map(int, input().split()))[:n]\r\nx=[]\r\nx.append(l.count(1))\r\nx.append(l.count(2))\r\nx.append(l.count(3))\r\nx.sort()\r\nprint(x[0]+x[1])", "from collections import Counter\nprint(int(input())-max(Counter(map(int,input().split())).values()))\n\t \t \t\t\t\t\t \t\t \t\t \t \t \t \t \t", "n = int(input());arr = input().split();x = arr.count(\"1\");y = arr.count(\"2\");z = arr.count(\"3\");op = max(x,y,z);print(len(arr)-op)\r\n", "n = int(input())\r\nline = input().split()\r\n\r\ncount = 0\r\n\r\nmode = max(set(line), key = line.count)\r\n\r\nfor i in range(n):\r\n if line[i] != mode:\r\n count += 1\r\n\r\nprint(count)", "N = int(input())\r\nA = list(map(int, input().split()))\r\ncounter = [0, 0, 0]\r\nfor i in range(0, N):\r\n\tcounter[A[i]-1] += 1\r\ncounter.sort()\r\nprint(counter[0]+counter[1])", "#!/usr/bin/python3\n\n\n# conver list to dict\ndef to_dict(alist): \n adict = {}\n for item in alist:\n if item in adict.keys():\n adict[item] = adict[item] + 1\n else:\n adict[item] = 1\n return adict\n\n\n\n# read the input\nline1 = input().split(\" \")\nn = int(line1[0]) \nsequence = input().split(\" \")\n\n# covert to dictionary \nsequence_map = to_dict(sequence) \n\nprint(n - max(sequence_map.values()))\n\n\n\n", "A = [0] * 1000001\r\n\r\nN = int(input())\r\nL = list(map(int, input().split()))\r\n\r\nfor l in L:\r\n A[l] += 1\r\n \r\nprint(N - max(A))", "# {_@_A_b_d_u_l___M_a_l_i_k_@_}\r\n\r\n# A. 123-sequence\r\n\r\na = int(input());b = input().split()\r\nm = b.count('1'); m1 = b.count('2'); m2 = b.count('3')\r\nm3 = max(m,m1,m2); print(len(b) - m3)\r\n\r\n# {_@_A_b_d_u_l___M_a_l_i_k_@_}\r\n", "from collections import Counter\r\n\r\ninput()\r\na = list(Counter(input().split()).values())\r\ndel a[a.index(max(a))]\r\nprint(sum(a))\r\n\r\n#########################################\r\n## ##\r\n## Implemented by brownfox2k6 ##\r\n## ##\r\n#########################################\r\n", "a=int(input())\r\nl=list(map(int,input().split()))\r\nd={}\r\nfor i in l:\r\n if i not in d:\r\n d[i]=1\r\n else:\r\n d[i]+=1\r\ns=list(d.values())\r\nprint(len(l)-max(s))\r\n\t \r\n", "#!/usr/bin/env python\n# coding=utf-8\n'''\nAuthor: Deean\nDate: 2021-11-03 22:50:53\nLastEditTime: 2021-11-03 22:59:51\nDescription: 123-sequence\nFilePath: CF52A.py\n'''\n\n\ndef func():\n n = int(input())\n lst = list(map(int, input().strip().split()))\n # func-1\n # max = 0\n # for i in range(1, 4):\n # if max < lst.count(i):\n # max = lst.count(i)\n # return n - max\n\n # func-2\n most = max(map(lambda i: lst.count(i), [1, 2, 3]))\n return n - most\n\n\nif __name__ == '__main__':\n ans = func()\n print(ans)\n", "n, a = int(input()), input().split()\r\nprint(sum(sorted([a.count('1'), a.count('2'), a.count('3')])[:2]))\r\n", "n = int(input())\r\nai = list(map(int,input().split()))\r\ndic = {}\r\nfor i in ai:\r\n if i not in dic:\r\n dic[i] = 1\r\n else:\r\n dic[i] += 1\r\n\r\n#print(dic)\r\nprint(n - max(dic.values()))", "n=int(input())\r\nl=input().split()\r\nc1=l.count(\"1\")\r\nc2=l.count(\"2\")\r\nc3=l.count(\"3\")\r\nprint(c1+c2+c3-max(c1,c2,c3))", "import sys\r\n\r\nn = int(sys.stdin.readline().strip())\r\na = sys.stdin.readline().strip().split()\r\n\r\ndef findMin(n,a):\r\n nums = {'1':0,'2':0,'3':0}\r\n for num in a:\r\n nums[num]+=1\r\n return min(nums['1']+nums['2'],nums['1']+nums['3'],nums['2']+nums['3'])\r\n\r\n\r\nprint(findMin(n,a)) \r\n \r\n \r\n", "from statistics import mode\ntot = int(input())\n\nnum = list(map(int, input().strip().split()))\nmax_num = mode(num)\nz = 0\nfor i in num:\n if i == max_num:\n z += 1\n\nprint(tot-z)\n\n \t \t \t \t \t \t\t\t\t\t \t\t\t\t \t\t", "n = int(input())\r\nlst = []\r\nlst = list(map(int, input().split()))\r\n\r\nsothaythe = max(lst.count(1),lst.count(2),lst.count(3))\r\nprint(n-sothaythe)", "n = int(input())\r\nline = input()\r\noneCount = line.count('1')\r\ntwoCount = line.count('2')\r\nthreeCount = line.count('3')\r\nif oneCount >= twoCount and oneCount >= threeCount:\r\n print(n - oneCount)\r\nelif twoCount >= oneCount and twoCount >= threeCount:\r\n print(n - twoCount)\r\nelif threeCount >= twoCount and threeCount >= oneCount:\r\n print(n - threeCount)\r\n", "n = int(input())\r\nnums = [int(j) for j in input().split()]\r\nref = 3 * [0]\r\nfor j in range(n):\r\n ref[nums[j] - 1] += 1\r\nprint(n - max(ref))\r\n", "n = int(input())\r\nseq = list(map(int,input().strip().split(' ')))\r\nprint(n - max([seq.count(1),seq.count(2),seq.count(3)]))", "n = int(input())\r\nlst = list(map(int, input().split()))\r\n\r\nhashMap = {}\r\nfor i in lst:\r\n if i not in hashMap:\r\n hashMap[i] = 1\r\n else:\r\n hashMap[i] += 1\r\n\r\ngetMax = max(hashMap, key=hashMap.get)\r\n\r\nprint(len(lst) - hashMap[getMax])", "length = int(input())\r\nnumber = str(input())\r\nnumbers = number.split(\" \")\r\ni = 1\r\nrunned = 0\r\nmode = 0\r\nswapcount = 0\r\ndef find_mode(data):\r\n countdict = {}\r\n for item in data:\r\n countdict[item] = countdict.get(item, 0) + 1\r\n mode_value = max(countdict, key=countdict.get)\r\n return int(mode_value)\r\nmode = find_mode(numbers)\r\nfor _ in range(length):\r\n if int(numbers[_]) != mode:\r\n swapcount += 1\r\nprint(swapcount)", "n=int(input())\r\na=list(map(int,input().split()))\r\nA=0;b=0;c=0\r\nfor x in a:\r\n if x==1:\r\n A+=1\r\n if x==2:\r\n b+=1\r\n if x==3:\r\n c+=1\r\nprint((b+c+A)-max(b,c,A))", "n = int(input())\r\nl = list(map(int,input().split()))\r\nfreq = {} \r\nfor item in l: \r\n if (item in freq): \r\n freq[item] += 1\r\n else: \r\n freq[item] = 1\r\nl = list(sorted(freq.values(),reverse=True))\r\nl.remove(l[0])\r\nprint(sum(l)) \r\n\r\n\r\n", "n = int(input())\nx = list(map(int, input().split()))\ndata = 3 * [0]\nfor item in x:\n data[item - 1] += 1\nprint(min(data[0] + data[1], data[0] + data[2], data[1] + data[2]))\n", "n=int(input())\r\narr=list(map(int,input().split()))\r\nlist1=[]\r\ns=set(arr)\r\nfor i in s:\r\n list1.append(arr.count(i))\r\nm=max(list1)\r\nprint(sum(list1)-m)\r\n ", "n=int(input())\r\na=input()\r\nprint(n-max(a.count(x)for x in '123'))", "n =int(input())\r\nl =list(map(str ,input().split()))\r\nn3 = l.count(\"3\")\r\nn2 = l.count(\"2\")\r\nn1 = l.count(\"1\") \r\nk = sorted([n3 ,n2 , n1])\r\nres = sum([int(i) for i in k[: 2]])\r\nprint(res)", "n=int(input())\r\na=list(map(int,input().split()))\r\nc1=0\r\nc2=0\r\nc3=0\r\nfor i in a:\r\n if i==1:\r\n c1=c1+1\r\n elif i==2:\r\n c2=c2+1\r\n else:\r\n c3=c3+1\r\nx=max(c1,c2)\r\ny=max(c2,c3)\r\nprint(n-max(x,y))\r\n\r\n\r\n", "\r\nn = int(input())\r\nsecuencia = input().split()\r\n\r\nc1 = 0\r\nc2 = 0\r\nc3 = 0\r\n\r\nfor i in range(n):\r\n if secuencia[i] == '1':\r\n c1 = c1+1\r\n elif secuencia[i] == '2':\r\n c2 = c2+1\r\n else:\r\n c3 = c3+1\r\n \r\nmaximo = max(c1,c2,c3)\r\nrpta = c1+c2+c3 - maximo\r\nprint(rpta)", "from math import ceil\nn = int(input())\nmy_list = input().split()[:n]\n\n\nnew_list = []\nfor i in my_list:\n if i not in new_list:\n new_list.append(i)\nnew_list = sorted(new_list)\ntotal_list = []\n\nfor i in new_list:\n total = len(my_list) - my_list.count(i)\n total_list.append(total)\n\nprint(min(total_list))\n\n \t \t\t \t \t\t \t \t\t\t\t\t\t\t\t", "\r\nn = int(input())\r\narr = [0,0,0]\r\nfor item in input().split(' '):\r\n if item == '1':\r\n arr[0] += 1\r\n elif item == '2':\r\n arr[1] += 1\r\n else:\r\n arr[2] += 1\r\narr.sort()\r\nprint(arr[0] + arr[1])", "n = int(input())\r\nx = [int(i) for i in input().split()]\r\ncounter1 = x.count(1)\r\ncounter2 = x.count(2)\r\ncounter3 = x.count(3)\r\nans = counter1 + counter2\r\nif counter3 + counter2 < ans:\r\n ans = counter3 + counter2\r\nif counter3 + counter1 < ans:\r\n ans = counter3 + counter1\r\nprint(ans)", "n=int(input())\r\nA=list(map(int,input().split()))\r\na=0;b=0;c=0\r\nfor x in A:\r\n if x==1:\r\n a+=1\r\n if x==2:\r\n b+=1\r\n if x==3:\r\n c+=1\r\nprint((b+c+a)-max(b,c,a))", "n = int(input())\r\nmoo = list(map(int, input().split()))\r\nx = moo.count(1)\r\ny = moo.count(2)\r\nz = moo.count(3)\r\npor = [x, y, z]\r\npor.sort()\r\nprint(por[0] + por[1])", "n=int(input())\r\nl=list(map(int,input().split()))\r\na=l.count(1)\r\nb=l.count(2)\r\nc=l.count(3)\r\nprint(n-max(a,max(b,c)))", "n = int(input())\r\nl = list(map(int, input().split()))\r\nbr = [0, 0, 0]\r\n\r\nfor i in range(n):\r\n br[l[i] - 1] += 1\r\n\r\nprint(sum(br) - max(br))\r\n", "T=int(input())\r\na=[int(v) for v in input().split()]\r\ns=list(set(a))\r\nc=sorted([a.count(z) for z in s])\r\nc.pop(-1)\r\nprint(sum(c))", "cases = int(input())\r\n\r\narr = list(map(int, input().split()))\r\nmx = max(arr.count(1), arr.count(2), arr.count(3))\r\n\r\nprint(cases-mx)\r\n", "a = int(input())\n\narr = list(map(int,input().split()))\narr2 = [0,0,0]\narr = sorted(arr)\n\nx = 0\n\nfor i in arr:\n arr2[i-1] += 1\n\nx = max(arr2)\n\nprint(len(arr) - x)\n\n\t\t\t\t \t\t \t\t\t\t \t\t\t\t \t \t\t\t \t\t", "n = int(input())\nint_arr = [int(num) for num in input().split()]\ncounts_dict = {}\nfor num in int_arr:\n\tcounts_dict[num] = counts_dict.get(num, 0) + 1\n\nprint(n - max(counts_dict.values()))", "import sys\n\ndef main():\n n = int(input())\n arr=list(map(int, sys.stdin.readline().split()))\n a=0\n b=0\n c=0\n for val in arr:\n if val == 1:\n a+=1\n elif val == 2:\n b+=1\n else:\n c+=1\n \n print(n-max(a,b,c))\n\n \n return None\n\nmain()", "n = input()\r\ns = input()\r\n\r\nnums = [int(x) for x in s.split(' ')]\r\nnum_set = set(nums)\r\ncounts = {}\r\n\r\nfor value in num_set:\r\n counts[value] = nums.count(value)\r\n\r\nprint(sum(counts.values()) - max(counts.values()))", "n = input()\r\ni1 = 0\r\ni2 = 0\r\ni3 = 0\r\ns = list(map(int,input().split()))\r\nfor j in s:\r\n if(j==1):\r\n i1 = i1+1\r\n if(j==2):\r\n i2 = i2+1\r\n if(j==3):\r\n i3=i3+1\r\nif(i2>=i3 and i2>=i1):\r\n print(i3+i1)\r\nelif(i3>=i2 and i3>=i1):\r\n print(i2+i1)\r\nelif(i1>=i3 and i1>=i2):\r\n print(i3+i2)\r\nelse:\r\n exit()\r\n", "n=input()\r\nL=input()\r\n\r\no=L.count('1')\r\nt=L.count('2')\r\nth=L.count('3')\r\nL=[o,t,th]\r\nL.sort()\r\nprint(L[0]+L[1])\r\n", "n=int(input())\r\nar=list(map(int,input().split()))\r\none=ar.count(1)\r\ntwo=ar.count(2)\r\nthree=ar.count(3)\r\nz=[0,0,0]\r\nz[0]=one \r\nz[1]=two\r\nz[2]=three\r\nz.sort()\r\nprint(z[0]+z[1])", "i = int(input())\na = list(map(int,input().split()))\nans = 0\nm = max(a.count(1),a.count(2),a.count(3))\nprint(i-m)\n \t\t \t\t\t\t \t \t\t \t \t \t \t\t\t\t\t", "n = int(input())\r\na = [int(s) for s in input().split(' ')]\r\na_dict = {}\r\n\r\nfor x in a:\r\n if x in a_dict.keys():\r\n a_dict[x] += 1\r\n else:\r\n a_dict[x] = 1\r\nans = n - a_dict[max(a_dict, key=lambda x: a_dict[x])]\r\n\r\nprint(ans)\r\n", "n=int(input())\na=list(map(int,input().split()))\ns=0\nd= 0\nf=0\nfor i in a:\n if i==1:\n s+=1\n elif i==2:\n d+=1\n elif i==3:\n f+=1\nprint(n-max(s,d,f))\n\n \t \t \t\t\t\t \t \t \t\t\t\t \t\t \t\t\t", "a=int(input());b=list(map(int,input().split()));print(a-max(b.count(i) for i in [1,2,3]))", "n=int(input())\r\na=list(map(int,input().split()));b=list(set(a))\r\nc=[a.count(i) for i in b]\r\nprint(n-max(c))", "n=int(input())\r\na=[int(i) for i in input().split()]\r\nb=a.count(1)\r\nc=a.count(2)\r\nd=a.count(3)\r\ne=max(b,max(c,d))\r\nprint(len(a)-e)", "n = int(input())\r\nnumbers = list(map(int, input().split()))\r\na = numbers.count(1)\r\nb = numbers.count(2)\r\nc = numbers.count(3)\r\nprint(n - max(a,b,c))", "import sys, math, operator, itertools, collections, heapq, bisect\n# sys.setrecursionlimit(10**4)\n\n\nclass Solution:\n def __init__(self):\n pass\n\n def solve(self, *Input):\n cnt = collections.Counter(Input[0])\n print(min(cnt[1]+cnt[2],cnt[2]+cnt[3],cnt[3]+cnt[1]))\n\n def create(self, *Input):\n n,colors = Input\n color_set = set()\n tree = [set()]\n for i in range(1,n+1):\n color_set.add(colors[i-1])\n tree.append(color_set - tree[i & (i-1)])\n return tree\n\n def check(self, *Input):\n k,matrix = Input\n cnt = 0\n for row in matrix:\n cnt += row.count('#')\n return cnt == k\n\n def sieve_classic(self,a,b):\n self.primes = [True] * (b+1)\n self.primes[0] = self.primes[1] = False\n for i in range(2,b+1):\n if self.primes[i] and i*i <= b:\n for j in range(i*i,b+1,i):\n self.primes[j] = False\n self.primes = [x for x,y in enumerate(self.primes) if y]\n ind = bisect.bisect_left(self.primes,a)\n self.primes[:ind] = []\n return None\n\n\nif __name__=='__main__':\n solution = Solution()\n\n inputs = iter(sys.stdin.readlines())\n n = int(next(inputs))\n a = list(map(int, next(inputs).split()))\n ans = solution.solve(a)\n # print(ans)\n", "n = int(input())\r\na = input().split(' ')\r\nb = [0]*3\r\nfor i in a:\r\n b[int(i)-1] += 1\r\nprint(n-max(b))", "p=int(input())\r\nt=input()\r\nm=t.split()\r\nm=list(map(int,m))\r\na=max(m.count(1),m.count(2),m.count(3))\r\nprint(len(m)-a)\r\n# if m.count(1)<m.count(2)<m.count(3) or m.count(2)<m.count(1)<m.count(3) :\r\n# print(len(m)-m.count(3))\r\n# elif m.count(2)<m.count(3)<m.count(1)or m.count(3)<m.count(2)<m.count(1) :\r\n# print(m.count(m[2])+m.count(m[1])) \r\n# elif m.count()<m.count(m[2]<m.count(m[1])) or m.count(m[2])<m.count(m[0])<m.count(m[1]) :\r\n# print(m.count(m[2])+m.count(m[0])) ", "d=int(input())\r\na=b=c=0\r\nl=[int(x) for x in input().split()]\r\nfor i in l:\r\n if i==1:\r\n a+=1\r\n elif i==2:\r\n b+=1\r\n else:\r\n c+=1\r\nw=max(a,b,c)\r\nprint(d-w)", "\r\nstack = []\r\n\r\nn = int(input())\r\n\r\narr = [int(i) for i in input().split(\" \", n-1)]\r\n\r\nones = arr.count(1)\r\ntwos = arr.count(2)\r\nthrees = arr.count(3)\r\n\r\nstack.append(1)\r\n\r\nif twos>ones:\r\n stack.append(2)\r\n if threes>twos:\r\n stack.append(3)\r\nelif threes>ones:\r\n stack.append(3)\r\n\r\nprint(n-arr.count(stack.pop()))\r\n", "in1 = int(input())\r\nin2 = input().split()\r\na=in2.count('1')\r\nb=in2.count('2')\r\nc=in2.count('3')\r\nm=max(a,b,c)\r\nl=len(in2)\r\nprint(l-m)", "# - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - #\r\n# IN THE NAME OF GOD\r\n# C++ : Done.!\r\n# Python 3 : Loading...\r\n\r\nimport math\r\nimport random\r\nimport sys\r\nimport time\r\n\r\n#----------------------------------> Programmer : Kadi <----------------------------------#\r\n\r\nt = int(input())\r\none = two = three = 0\r\ns = input()\r\nfor i in range(0, len(s)):\r\n if s[i] == '1' : one = one + 1\r\n if s[i] == '2' : two = two + 1\r\n if s[i] == '3' : three = three + 1\r\nprint(t - max(one, max(two, three)))\r\n\r\n# - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - #\r\n", "from collections import defaultdict\r\nimport sys\r\nfrom typing import Counter\r\nreadline=sys.stdin.readline\r\n\r\nN=int(readline())\r\nA=list(map(int,readline().split()))\r\nC=Counter(A)\r\nans=N-max(C.values())\r\nprint(ans)", "n=int(input())\r\nalist=list(map(int,input().split()))\r\na=alist.count(1)\r\nb=alist.count(2)\r\nc=alist.count(3)\r\nprint(min(a+b,b+c,a+c))", "n=int(input())\r\na=list(map(int,input().split()))\r\nb=a.count(1)\r\nc=a.count(2)\r\nd=a.count(3)\r\ne=max(b,c,d)\r\nprint(b+c+d-e)", "n=int(input())\na=[int(ii) for ii in input().split()]\ncnt=[0]*5\n\nfor i in a:\n cnt[i]+=1\nprint(len(a)-max(cnt))\n", "import fileinput, collections;f = fileinput.input();c = int(next(f));print(c-collections.Counter(map(int, next(f).split())).most_common(1)[0][1])", "n=int(input())\r\nz=list(map(int,input().split()))\r\n\r\none=0\r\ntwo=0\r\nthree=0\r\n\r\nfor i in z :\r\n if i==1 :\r\n one+=1\r\n elif i==2 :\r\n two+=1\r\n else :\r\n three+=1\r\n\r\nif one > two and one > three :\r\n print(n-one)\r\nelif two>one and two >three :\r\n print(n-two)\r\nelif three>one and three>two :\r\n print(n-three)\r\nelse :\r\n print(n-max(one,two,three))", "a = int(input())\r\n\r\n\r\n\r\nt = list(map(int,input().split()))\r\n\r\n\r\n\r\n\r\ng = set(t)\r\n\r\n\r\np=[]\r\n\r\n\r\nfor f in g:\r\n p.append(t.count(f))\r\n\r\nprint(sum(p)-max(p))\r\n", "n = int(input())\r\n\r\ndaf = list(map(int, input().split()))\r\n\r\nnum1 = daf.count(1)\r\nnum2 = daf.count(2)\r\nnum3 = daf.count(3)\r\n\r\nnum = max(num1, num2, num3)\r\n\r\nprint(n - num)\r\n", "a = int(input())\r\nb = list(map(int,input().split()))\r\ny = b.count(3)\r\nx = b.count(1)\r\nz = b.count(2)\r\nMax = max(y,x,z)\r\nprint(a-Max)", "n = int(input())\na = sorted(list(map(int,input().split())))\nd = []\ns = a[0]\nt = 1\nfor i in range(1,len(a)):\n if a[i] == s:\n t += 1\n else:\n d += [t]\n s = a[i]\n t = 1\nd += [t]\nprint(abs(max(d)-len(a)))\n\n\n \t\t \t\t \t \t\t\t \t \t\t \t \t \t", "num = input()\r\nelement = input().split()\r\nmax_rep = element.count(max(set(element), key = element.count))\r\nprint(int(num) - max_rep)", "from collections import Counter\nn = int(input())\nd = list(map(int,input().split()))\nok = 0\nok1 = 0\nok2 = 0\nfor i in d:\n if i == 1:\n ok += 1\n elif i == 2:\n ok1 += 1\n else:\n ok2 += 1\nmx = max(ok,ok1,ok2)\nsm = (ok + ok1 + ok2) - mx\nprint(sm)\n\n \t \t\t \t \t\t \t \t \t\t \t \t\t", "input()\r\nl = list(map(int,input().split()))\r\nprint(len(l) - max(l.count(1), l.count(2), l.count(3)))", "n=int(input())\r\nl=list(map(int,input().strip().split()[:n]))\r\na1=l.count(1)\r\na2=l.count(2)\r\na3=l.count(3)\r\nif a1>=a2 and a1>=a3:print(a3+a2)\r\nelif a2>=a1 and a2>=a3:print(a1+a3)\r\nelif a3>=a2 and a3>=a1:print(a1+a2)\r\nelse:\r\n\tprint(n-(max(a1,a3,a2)))", "# import sys\r\n# sys.stdin = open(\"test.in\",\"r\")\r\n# sys.stdout = open(\"test.out.py\",\"w\")\r\nn=int(input())\r\na=list(map(int,input().split()))\r\nprint(n-max(a.count(1),a.count(2),a.count(3)))\r\n", "i = int(input())\r\nl = list(map(int, input().split()))\r\ng = max(l.count(1), l.count(2), l.count(3))\r\nprint(i - g)", "n=int(input())\r\na=[0]*4\r\nfor x in list(map(int,input().split())):\r\n a[x]+=1\r\nprint(min(a[1]+a[2],a[2]+a[3],a[3]+a[1]))\r\n", "n = int(input())\na = list(map(int, input().split()))\none = 0\ntwo = 0\ntre = 0\nfor i in a:\n if i == 1:\n one += 1\n elif i == 2:\n two += 1\n else:\n tre += 1\nif max(one, two, tre) == one:\n print(two + tre)\nelif max(one, two, tre) == two:\n print(one + tre)\nelse:\n print(one + two)\n", "input()\r\nimport collections\r\nfreq = collections.Counter(map(int, input().split()))\r\nprint(sum(freq.values()) - max(freq.values()))\r\n", "input()\r\ninfo = [0, 0, 0]\r\nfor item in input().split(' '):\r\n info[int(item) - 1] += 1\r\ninfo.sort()\r\nprint(info[0] + info[1])", "n=int(input())\r\na=list(map(int,input().split()))\r\nx=a.count(1)\r\ny=a.count(2)\r\nz=n-(x+y)\r\nprint(min(x+y,y+z,z+x))\r\n\r\n", "n=int(input())\r\nl=[int(x) for x in input().split()]\r\none=l.count(1)\r\ntwo=l.count(2)\r\nprint(n-max(one, two, n-one-two))", "n=int(input())\r\na=list(map(int,input().split()))\r\nx=a.count(1)\r\ny=a.count(2)\r\nz=a.count(3)\r\nprint(n-max(x,y,z))", "n = int(input())\r\nl = list(map(int, input().split()))\r\na = [0, 0, 0, 0]\r\nfor x in l:\r\n a[x] += 1\r\nprint(n - max(a[1], a[2], a[3]))", "a = int(input())\r\nb = [int(x) for x in input().split()]\r\nlist_ = []\r\nm = 0\r\n\r\nc = list(set(b))\r\nd = len(c)\r\n\r\nif d == 1:\r\n print(0)\r\nelse:\r\n\r\n for i in c:\r\n m = b.count(i)\r\n list_.append(m)\r\n m = 0\r\n e = list_.index(max(list_))\r\n gr_ = c[e]\r\n print(len(b)-b.count(gr_))", "# 123 sequence Without for loop\r\nlength = int(input())\r\nlistOfNumbers = list(map(int, input().split()))\r\n\r\n# Find the majority element\r\nmajority = max(set(listOfNumbers), key = listOfNumbers.count)\r\n\r\n# Count the number of replacements needed\r\nnum_replacements = length - listOfNumbers.count(majority)\r\n\r\nprint(num_replacements)", "k=input()\r\nl=[int(x) for x in input().split()]\r\nco1=l.count(1)\r\nco2=l.count(2)\r\nco3=l.count(3)\r\n\r\nprint(int(k)-max([co1,co2,co3]))\r\n", "n = int(input())\r\nA = input()\r\n\r\nprint(n - max(A.count(a) for a in '123'))", "n=int(input())\r\ns=list(map(int,input().split()))\r\ncl=[s.count(1),s.count(2),s.count(3)]\r\nprint(n-max(cl))", "x = input()\nip = input().split()\na = ip.count('1')\nb = ip.count('2')\nc = ip.count('3')\nprint(min(a+b, b + c, c + a))\n", "num = int(input())\narr = input().split()\narr = [int(x) for x in arr]\nn1 = arr.count(1)\nn2 = arr.count(2)\nn3 = arr.count(3)\nmax_recurance = max(n1, n2, n3)\nprint(n1 + n2 + n3 - max_recurance)\n\n\t \t\t \t\t \t\t\t\t\t \t \t \t \t \t\t", "n=int(input())\r\nlist1=list(map(int ,input().split()))\r\ng=list1.count(1)\r\nh=list1.count(2)\r\nk=list1.count(3)\r\ntp=max(g,h,k)\r\nif(g==tp):\r\n count=0\r\n for i in range(n):\r\n if(list1[i]==1):\r\n count+=1\r\nelif(h==tp):\r\n count=0 \r\n for i in range(n):\r\n if(list1[i]==2):\r\n count+=1\r\nelse:\r\n count=0\r\n for i in range(n):\r\n if(list1[i]==3):\r\n count+=1 \r\n \r\nprint(n-count) ", "n=int(input())\r\nx=[int(x) for x in input().split()]\r\na=[]\r\nfor i in range(1,4):\r\n a.append(x.count(i))\r\nprint(n-max(a)) ", "import statistics\r\nx = int(input())\r\nseq = input().split()\r\nseq = [int(i) for i in seq]\r\n\r\nocc1 = seq.count(1)\r\nocc2 = seq.count(2)\r\nocc3 = seq.count(3)\r\n\r\nprint (x-max(occ1,occ2,occ3))", "n = int(input())\narr = list(map(int,input().split()))\none = arr.count(1)\ntwo = arr.count(2)\nthree = arr.count(3)\nprint( min(n-one,n-two,n-three))\n", "n = int(input())\na = list(map(int, input().split()))\nv = []\n\nfor i in [1,2,3]:\n\tv.append(a.count(i))\n\nprint(len(a) - max(v))", "n = int(input())\nlst = [int(x) for x in input().split()][:n]\nc1, c2, c3 = 0, 0, 0\nfor a in lst:\n if a == 1: c1 += 1\n elif a == 2: c2 += 1\n elif a == 3: c3 += 1\nm = max(c1, c2, c3)\nprint(n - m)\n\t\t \t\t\t\t \t\t\t\t \t \t \t\t\t \t\t\t \t \t", "oiasjdioasjdio = int(input())\r\nuehushduihsdiuaerr = list(map(int,input().split()))\r\nmasdsdasdsaxsdeww = str(uehushduihsdiuaerr)\r\nmasdsdasdsaxsdeww = masdsdasdsaxsdeww.replace('[','')\r\nmasdsdasdsaxsdeww = masdsdasdsaxsdeww.replace(']','')\r\nmasdsdasdsaxsdeww = masdsdasdsaxsdeww.replace(' ','')\r\nmasdsdasdsaxsdeww = masdsdasdsaxsdeww.replace(\"'\",'')\r\nmasdsdasdsaxsdeww = masdsdasdsaxsdeww.replace(',','')\r\nsjdsjfhjkdshfjksdkfhsjdsk = masdsdasdsaxsdeww.count('1')\r\nhusgsgdaugsduagsd = masdsdasdsaxsdeww.count('2')\r\ndhushifhwiefwfeeueuueee = masdsdasdsaxsdeww.count('3')\r\nsjdsjfhjkdshfjksdkfhsjdsk = int(sjdsjfhjkdshfjksdkfhsjdsk)\r\nhusgsgdaugsduagsd = int(husgsgdaugsduagsd)\r\ndhushifhwiefwfeeueuueee = int(dhushifhwiefwfeeueuueee)\r\najsdsjdhakjhdkjashdee = max(sjdsjfhjkdshfjksdkfhsjdsk,husgsgdaugsduagsd,dhushifhwiefwfeeueuueee)\r\niwuediowudiosuwois = []\r\niwuediowudiosuwois.append(sjdsjfhjkdshfjksdkfhsjdsk)\r\niwuediowudiosuwois.append(dhushifhwiefwfeeueuueee)\r\niwuediowudiosuwois.append(husgsgdaugsduagsd)\r\niwuediowudiosuwois = sorted(iwuediowudiosuwois)\r\nprint(iwuediowudiosuwois[0]+iwuediowudiosuwois[1])\r\n", "from collections import Counter\n\nn = input()\nnums = input().split()\ncounts = Counter(nums)\nmax_index = \"0\"\nfor k, v in counts.items():\n if counts[k] > counts[max_index]:\n max_index = k\nprint(len(nums) - counts[max_index])\n", "n = int(input())\na = [int(x) for x in input().split()]\n\nanswer = [0, 0, 0]\n\nfor i in a:\n answer[i - 1] += 1\n\nprint(n - max(answer))\n", "n=int(input())\r\nL=[0,0,0]\r\nM=list(map(int,input().split()))\r\nfor i in range(0,n):\r\n\tif(M[i]==1):\r\n\t\tL[0]+=1\r\n\telif(M[i]==2):\r\n\t\tL[1]+=1\r\n\telse:\r\n\t\tL[2]+=1\r\nL.sort()\r\nprint(L[0]+L[1])", "from collections import Counter\nn = int(input())\nc = Counter(input().split())\nprint(n - max(c.values()))\n", "n = int(input())\r\na = list(map(int,input().split()))\r\n\r\nones = a.count(1)\r\ntwos = a.count(2)\r\nthrees = a.count(3)\r\n\r\nprint(min(ones + twos, ones + threes, twos + threes))\r\n", "import statistics as s\r\nn=int(input())\r\na=list(map(int,input().split()))\r\nif len(set(a))==1:\r\n print(0)\r\nelse:\r\n c=s.mode(a)\r\n print(n-a.count(c))", "n=input()\r\na=input()\r\nx=a.count('1')\r\ny=a.count('2')\r\nz=a.count('3')\r\na=[x,y,z]\r\na.sort()\r\nprint(a[0]+a[1])\r\n", "# LUOGU_RID: 101450921\nfrom collections import Counter\r\nn, *a = map(int, open(0).read().split())\r\nprint(n - Counter(a).most_common()[0][1])", "n = int(input())\nsequence = list(map(int, input().split()))\n\ncount = [0] * 4\n\nfor num in sequence:\n count[num] += 1\n\nmax_count = max(count[1], count[2], count[3])\n\nmin_replacements = n - max_count\n\nprint(min_replacements)\n\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\nv=list(set(l))\r\nif len(v)==1:\r\n print('0')\r\nelif len(v)==2:\r\n c=0\r\n for i in range(n):\r\n if l[i]==v[0]:\r\n c+=1\r\n if c>n//2:\r\n print(n-c)\r\n else:\r\n print(c)\r\n \r\nelse:\r\n \r\n a,b,c=0,0,0\r\n for i in range(n):\r\n if l[i]==1:\r\n a+=1\r\n elif l[i]==2:\r\n b+=1\r\n else:\r\n c+=1\r\n d=max(a,b,c)\r\n print(n-d)\r\n \r\n \r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\n\r\ncounts = [0] * 3\r\n\r\nfor num in a:\r\n counts[num-1] += 1\r\n\r\nmax_count = max(counts)\r\n\r\nmin_replacements = n - max_count\r\n\r\nprint(min_replacements)", "n=input()\r\ns=input()\r\nx=s.count('1')\r\ny=s.count('2')\r\nz=s.count('3')\r\ns=[x,y,z]\r\ns.sort()\r\nprint(s[0]+s[1])\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\nli=[l.count(1),l.count(2),l.count(3)]\r\nli.sort()\r\nprint(li[0]+li[1])", "if __name__ == \"__main__\":\n t = int(input())\n lst = list(map(int,input().strip().split()))\n count_1 = count_2 = count_3 = 0\n for i in range(len(lst)):\n if lst[i] == 1 :\n count_1 += 1\n elif lst[i] == 2 :\n count_2 += 1\n else:\n count_3 += 1\n print(t - max(count_1,count_2,count_3))\n", "n=int(input())\r\ns=list(map(int,input().split()))\r\np=s.copy()\r\ns=set(s)\r\ns=list(s)\r\nfor i in range(len(s)):\r\n s[i]=p.count(s[i])\r\nprint(n-max(s))", "n = int(input())\r\na = list(map(int, input().split()))\r\nans = n - max([a.count(x) for x in [1, 2, 3]])\r\nprint(ans)", "from collections import Counter\r\nl=[]\r\nn=int(input())\r\nc=Counter(list(map(int,input().split())))\r\nfor key,value in c.items():l.append(value)\r\nif len(l)==1:print(0)\r\nelif len(l)==2:print(min(l[0],l[1]))\r\nelse:print(min(l[0]+l[1],l[0]+l[2],l[1]+l[2]))\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "n = int(input())\r\na = [int(i) for i in input().split()]\r\nans = n\r\ns1 = 0\r\ns2 = 0\r\ns3 = 0\r\nfor i in range(n):\r\n if a[i] == 1:\r\n s1 += 1\r\n elif a[i] == 2:\r\n s2 += 1\r\n else:\r\n s3 += 1\r\nS = max(s1,s2, s3)\r\nif S == s1:\r\n ans -= s1\r\nelif S == s2:\r\n ans -= s2\r\nelse:\r\n ans -= s3\r\nprint(ans)\r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\ncount1,count2,count3=0,0,0\r\nfor x in a:\r\n if x==1:\r\n count1+=1\r\n elif x==2:\r\n count2+=1\r\n else:\r\n count3+=1\r\nprint(min(count1+count2,count2+count3,count3+count1))", "num=int(input())\r\narr=[0]*9\r\narr=input().split()\r\nfor i in range (num):\r\n arr[i]=int(arr[i])\r\none=0\r\ntwo=0\r\nthree=0\r\nfor k in range (num):\r\n if arr[k]==1:\r\n one+=1\r\n if arr[k]==2:\r\n two+=1\r\n if arr[k]==3:\r\n three+=1\r\nfind=max(one,two,three)\r\nprint (num-find)", "n = input().split()\r\na = list(map(int,input().split()))\r\nnum = [0] * 4\r\nfor i in a:\r\n num[i]+=1\r\nnum.sort()\r\nres = 0\r\nres = num[1]+num[2]\r\nprint(res)\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\nfrom collections import Counter\r\n\r\nn = int(input())\r\n\r\nprint(n - max(Counter(map(int, input().split())).values()))", "n = int(input())\r\n\r\na = list(map(int, input().split()))\r\n\r\nk1 = 0\r\nk2 = 0\r\nk3 = 0\r\n\r\nfor i in a :\r\n\tif i == 1 :\r\n\t\tk1 = k1 + 1\r\n\tif i == 2 :\r\n\t\tk2 = k2 + 1\r\n\tif i == 3 :\r\n\t\tk3 = k3 + 1\r\n\r\n\r\nprint(n - max(k1, k2, k3))", "a = int(input())\r\nb = input().split()\r\nn1 = 0\r\nn2 = 0\r\nn3 = 0\r\nfor i in b:\r\n if int(i) == 1:\r\n n1+=1\r\n elif int(i) == 2:\r\n n2+=1\r\n elif int(i) == 3:\r\n n3+=1\r\nm = max(n1,n2,n3)\r\nprint(a-m)\r\n", "t = int(input())\r\na = list(map(int , input().split()))\r\nc1 = 0 \r\nc2 = 0 \r\nc3 = 0 \r\nfor el in a:\r\n if(el == 1):\r\n c1 += 1 \r\n elif(el == 2):\r\n c2 += 1 \r\n else:\r\n c3 += 1 \r\n\r\nprint((c1+c2+c3)-max(c1,c2,c3)) ", "n = int(input())\r\nseq = list(map(int, input().split()))\r\n\r\ntot = [0, 0, 0]\r\nfor el in seq:\r\n if el == 1:\r\n tot[0] += 1\r\n elif el == 2:\r\n tot[1] += 1\r\n elif el == 3:\r\n tot[2] += 1\r\n\r\nM = max(tot)\r\nindex = tot.index(M)\r\nans = 0\r\nfor i in range(3):\r\n if i != index:\r\n ans += tot[i]\r\n\r\nprint(ans)", "#Autor: - Talha\r\n#123 Sequence\r\nj = int(input())\r\nt = input()\r\na = t.count('1')\r\nb = t.count('2')\r\nc = t.count('3')\r\nprint(abs(max(a,b,c)-j))", "n = int(input())\r\ncount1, count2, count3 = 0, 0, 0\r\n\r\narr = [int(item) for item in input().split()]\r\n\r\nfor item in arr:\r\n if item == 1:\r\n count1 += 1\r\n elif item == 2:\r\n count2 += 1\r\n else:\r\n count3 += 1\r\n\r\n#print(f'count1 = {count1}, count2 = {count2}, count3 = {count3}')\r\nprint(n - max(count1, count2, count3))\r\n\r\n'''\r\n10\r\n2 2 2 3 3 3 3 3 1 1\r\n\r\n1 -> 8\r\n2 -> 7\r\n3 -> 5\r\n'''", "input()\r\ncount1,count2,count3 = 0,0,0\r\nfor item in [int(it) for it in input().split(' ')]:\r\n if item == 1:\r\n count1 += 1\r\n elif item == 2:\r\n count2 += 1\r\n else:\r\n count3 += 1\r\n\r\nprint(count1 + count2 + count3 - max(count1,count2,count3))", "a = int(input())\r\nb = list(map(int,input().split()))\r\ncount1 = 0\r\ncount2 = 0\r\ncount3 = 0\r\nfor i in range(a):\r\n if b[i] == 1:\r\n count1 +=1\r\n elif b[i] == 2:\r\n count2 +=1\r\n else:\r\n count3+=1\r\nsum1 = count1+count2\r\nsum2 = count3 + count2\r\nsum3 = count1 +count3\r\nprint(min(sum1,sum2,sum3))", "n = int(input())\ninp = input().split()\ncheck = {'1':0, '2':0, '3':0}\ncheck['1'] += inp.count('1')\ncheck['2'] += inp.count('2')\ncheck['3'] += inp.count('3')\n\nif check['1'] > check['2'] and check['1'] > check['3']:\n print(check['2'] + check['3'])\nelif check['2'] > check['1'] and check['2'] > check['3']:\n print(check['1'] + check['3'])\nelif check['3'] > check['2'] and check['3'] > check['1']:\n print(check['2'] + check['1'])\nelif check['1'] == check['2'] and check['1'] > check['3']:\n print(check['2'] + check['3'])\nelif check['1'] == check['3'] and check['1'] > check['2']:\n print(check['2'] + check['3'])\nelif check['2'] == check['3'] and check['3'] > check['1']:\n print(check['1'] + check['3']) \nelif check['1'] == check['2'] and check['1'] == check['3']:\n print(check['2'] + check['3'])\n \n\n", "from collections import Counter\r\nn = int(input())\r\ncounts = dict(Counter(map(int, input().strip().split())))\r\nmaxi = 0\r\nfor k,v in counts.items():\r\n\tif v>maxi:\r\n\t\tmaxi = v\r\nprint(n-maxi)", "n=int(input())\r\ns=input().split()\r\no=s.count('1')\r\nd=s.count('2')\r\nt=s.count('3')\r\nprint(n-max(o,d,t))\r\n", "from collections import Counter\r\nimport copy\r\n\r\ndef solve():\r\n n=int(input())\r\n arr=[int(i) for i in input().split()]\r\n count=Counter(arr)\r\n Max=max(count[1],count[2],count[3])\r\n\r\n return n-Max\r\n\r\n\r\n\r\n\r\nprint(solve())\r\n\r\n", "def minimum_replacements(n, sequence):\r\n # Step 1: Count the occurrences of each number in the sequence\r\n counts = [0, 0, 0] # Initialize counts for numbers 1, 2, and 3\r\n\r\n for num in sequence:\r\n counts[num - 1] += 1 # Increment the count for the corresponding number\r\n\r\n # Step 2: Determine the majority number\r\n majority_num = counts.index(max(counts)) + 1\r\n\r\n # Step 3: Calculate the minimum number of replacements needed\r\n min_replacements = n - counts[majority_num - 1]\r\n\r\n return min_replacements\r\n\r\n# Input\r\nn = int(input())\r\nsequence = list(map(int, input().split()))\r\n\r\n# Output\r\nprint(minimum_replacements(n, sequence))\r\n", "n = int(input())\nlst = list(map(int, input().split()))\n\nones = 0\ntwos = 0\nthrees = 0\n\nfor x in lst:\n if x == 1:\n ones += 1\n elif x == 2:\n twos += 1\n else:\n threes += 1\n#ontw = ones + twos\n#twth = twos + threes\n#thon = threes + ones\n\n#print(min(ontw,twth,thon))\nprint(n - max(ones, twos, threes))", "n = int(input())\r\na = list(map(int, input().split()))\r\na1,a2,a3 = a.count(1), a.count(2),a.count(3)\r\nprint(min(a1+a2,a2+a3,a1+a3))", "print((lambda d: sum(d) - max(d))((lambda t: (t.count('1'), t.count('2'), t.count('3')))(input()[:0] + input())))", "n=int(input())\r\nl=list(map(int,input().split()))\r\nx=l.count(1)\r\ny=l.count(3)\r\nz=l.count(2)\r\nprint(n-max(x,y,z))\r\n", "t = int(input())\r\ninp = input()\r\nx = inp.count(\"1\")\r\ny = inp.count(\"2\")\r\nz = inp.count(\"3\")\r\nprint(t-max(x,y,z))\r\n", "n = int(input())\nnum = list(map(int,input().split()))\n\ncopy_list = list(set(num))\n\nlarge = 0\nflag = 0\nfor i in copy_list:\n if(num.count(i)>large):\n flag = i\n large = num.count(i)\n\nprint(n-large)\n\t \t \t \t \t \t\t\t\t \t \t", "n=int(input())\r\nl=input().split()\r\nc1,c2,c3=l.count('1'),l.count('2'),l.count('3')\r\nprint(min(c1+c2,c2+c3,c3+c1))", "n=int(input())\r\na=list(map(int,input().split()))\r\nc1=0\r\nc2=0\r\nc3=0\r\nfor i in a:\r\n if i==1:\r\n c1=c1+1\r\n elif i==2:\r\n c2=c2+1\r\n else:\r\n c3=c3+1\r\nif c1>=c2 and c1>=c3:\r\n maxi=c1\r\nelif c2>=c1 and c2>=c3:\r\n maxi=c2\r\nelse:\r\n maxi=c3\r\nprint(n-maxi)\r\n", "n=int(input())\r\na=[int(i) for i in input().split()]\r\none=two=three=0\r\nfor x in a:\r\n if x==1:\r\n one+=1\r\n if x==2:\r\n two+=1\r\n if x==3: \r\n three+=1\r\ny=max(one,two,three)\r\nprint(one+two+three-y)", "d = [0] * 3\r\n \r\ninput()\r\nfor n in map(int, input().split()):\r\n d[n - 1] += 1\r\n \r\nprint(sum(d) - max(d))", "n = int(input())\r\ns = [int(i) for i in input().split()]\r\nk = max(s.count(1), s.count(2), s.count(3))\r\nif k == s.count(1):\r\n x = s.count(1)\r\nif k == s.count(2):\r\n x = s.count(2)\r\nif k == s.count(3):\r\n x = s.count(3)\r\nprint(len(s) - x)\r\n ", "input()\r\na=list(map(int,input().split()))\r\nk=a.count(1)\r\nk2=a.count(2)\r\nk3=a.count(3)\r\nprint(len(a)-max(k,k2,k3))", "n = int(input())\na = list(map(int, input().split()))\n\nnum_1 = 0\nnum_2 = 0\nnum_3 = 0\n\nfor _a in a:\n if _a == 1:\n num_1 += 1\n elif _a == 2:\n num_2 += 1\n elif _a == 3:\n num_3 += 1\n\nma = max(max(num_1, num_2), num_3)\nprint(len(a) - ma)\n", "n = int(input())\r\na = list(map(int, input().split()))\r\nx = 0\r\ny = 0\r\nz = 0\r\nfor j in a:\r\n if j == 1:\r\n x += 1\r\n elif j == 2:\r\n y += 1\r\n else:\r\n z += 1\r\na.clear()\r\na.append(x)\r\na.append(y)\r\na.append(z)\r\ni = n - max(a)\r\nprint(i)\r\n\r\n", "n = int(input())\nlst = list(map(int, input().split()))\n\nones = 0\ntwos = 0\nthrees = 0\n\nfor x in lst:\n if x == 1:\n ones += 1\n elif x == 2:\n twos += 1\n else:\n threes += 1\nontw = ones + twos\ntwth = twos + threes\nthon = threes + ones\n\nprint(min(ontw,twth,thon))", "# def most_frequent(List):\r\n# return max(set(List), key = List.count)\r\n#\r\n#\r\n# input()\r\n# nums = [int(num) for num in input().split(\" \")]\r\n# ones = 0\r\n# twos = 0\r\n# threes = 0\r\n# for i in range(len(nums)):\r\n# if nums[i] == 1:\r\n# ones += 1\r\n# elif nums[i] == 2:\r\n# twos += 1\r\n# else:\r\n# threes += 1\r\n# if ones == twos and twos == threes:\r\n# print(2*ones)\r\n# elif most_frequent(nums) == 1 :\r\n# print(twos + threes)\r\n# elif most_frequent(nums) == 2 :\r\n# print(ones + threes)\r\n# else:\r\n# print(ones + twos)\r\n\r\n\r\nn, arr = input(), [0, 0, 0]\r\nfor item in input().split(\" \"):\r\n if item == '1':\r\n arr[0] += 1\r\n elif item == '2':\r\n arr[1] += 1\r\n else:\r\n arr[2] += 1\r\narr.sort()\r\nprint(arr[0] + arr[1])\r\n", "from collections import Counter\r\nn = int(input())\r\narr = list(map(int, input().split()))\r\nc = Counter(arr)\r\nls = list(c.values())\r\nprint(n - max(ls))", "n=int(input())\r\nl=[int(x) for x in input().split()]\r\none=l.count(1)\r\ntwo=l.count(2)\r\nthree=l.count(3)\r\nprint(min((one+two),(one+three),(three+two)))", "n = int(input())\r\na = list(map(int, input().split()))\r\nones = a.count(1)\r\ntwos = a.count(2)\r\nthrees = a.count(3)\r\nprint(min(\r\n ones + twos,\r\n twos + threes,\r\n ones + threes\r\n))", "n = int(input())\r\nlst = list(map(int, input().split()))\r\na=b=c=0\r\nfor i in lst:\r\n if i == 1:\r\n a += 1\r\n elif i == 2:\r\n b += 1\r\n elif i == 3:\r\n c += 1\r\n\r\nm = max(a,b,c)\r\nprint(n-m)", "from collections import Counter\r\n\r\nn = int(input())\r\nans = [0, 0, 0, 0]\r\narr = list(map(int, input().split()))\r\nfor a in arr:\r\n ans[a] += 1\r\n\r\nprint(n - max(ans))", "n=int(input())\r\na=[int(x) for x in input().split()]\r\nlst=[0]*3\r\nfor i in a:\r\n lst[i-1]+=1\r\nprint(n-max(lst))", "n=int(input())\r\na=list(map(int,input().split()))\r\nf1=a.count(1)\r\nf2=a.count(2)\r\nf3=a.count(3)\r\nprint(f1+f2+f3-max(f1,f2,f3))", "\r\nn = int(input())\r\nsList = input().split()\r\na = sList.count('1');b = sList.count('2');c = sList.count('3')\r\nd = max(a,b,c)\r\nprint(abs(d-n))\r\n", "n = int(input())\nseq = [int(i) for i in input().split(' ')]\ncount = [seq.count(1), seq.count(2), seq.count(3)]\nprint(abs(max(count)-n))\n", "n=int(input(''))\r\nl=list(map(int,input().split()))\r\na,b,c=l.count(1),l.count(2),l.count(3)\r\nk=[a,b,c]\r\nm=max(k)\r\nprint(sum(k)-m)", "n = int(input())\r\na = input().split()\r\na = [int(e) for e in a]\r\nprint(n-max(a.count(1), a.count(2), a.count(3)))", "n=int(input())\r\ns=input()\r\no=s.count('1')\r\nt=s.count('2')\r\nth=n-o-t\r\nprint(n-max(max(o,t),th))", "n=int(input())\r\ns=list(map(int,input().split()))\r\nz=0\r\nfor i in set(s):\r\n z2=s.count(i)\r\n if z2 > z:\r\n z=z2\r\nprint(n-z) ", "n = int(input())\r\nl = list(map(int, input().split()))\r\nc1 = 0\r\nc2 = 0\r\nc3 = 0\r\nfor i in l:\r\n if i == 1: c1 += 1\r\n elif i == 2: c2 += 1\r\n else: c3 += 1\r\nprint(n - max(c1, c2, c3))", "n = int(input())\r\nl1 = [int(x) for x in input().split()]\r\nl2 = set(l1)\r\nc = []\r\nfor x in l2:\r\n c.append(l1.count(x))\r\nprint(n-max(c))", "m=int(input())\r\ns=input()\r\na=s.count('1')\r\nb=s.count('2')\r\nc=s.count('3')\r\nif a>=b and a>=c:\r\n print(b+c)\r\nelif b>=a and b>=c:\r\n print(a+c)\r\nelif c>=a and c>=b:\r\n print(a+b)\r\nelse:\r\n print(a+c)\r\n", "# bsdk idhar kya dekhne ko aaya hai, khud kr!!!\r\n# import math\r\n# from itertools import *\r\n# import random\r\n# import calendar\r\n# import datetime\r\n# import webbrowser\r\n\r\nn = int(input())\r\narr = list(map(int, input().split()))\r\ntemp = list(dict.fromkeys(arr))\r\nmax_count = 0\r\nvalue = 0\r\nfor i in temp:\r\n if arr.count(i) > max_count:\r\n max_count = arr.count(i)\r\n value = i\r\ncount = 0\r\nfor i in arr:\r\n if i != value:\r\n count += 1\r\nprint(count)\r\n", "x, y = int(input()), list(map(int, input().split()))\r\nprint(x-(max(max(y.count(1), y.count(2)), y.count(3))))", "from collections import Counter\n\ndef main(seq):\n return len(seq) - Counter(seq).most_common(1)[0][1]\n\n\nif __name__ == \"__main__\":\n _, seq = input(), list(map(int, input().split()))\n print(main(seq))\n", "import statistics\r\n\r\n\r\nn = int(input())\r\ns = input().split()\r\n\r\nm = statistics.mode(s)\r\nprint(n - s.count(m))\r\n", "n=int(input())\r\nl=[int(x) for x in input().split()]\r\nl1=[]\r\nl1.append(l.count(1))\r\nl1.append(l.count(2))\r\nl1.append(l.count(3))\r\nprint(sum(l1)-max(l1))", "n=int(input())\r\na=list(map(int,input().split()))\r\ns=0\r\nd=0\r\nf=0\r\nfor i in a:\r\n if i==1:\r\n s+=1\r\n elif i==2:\r\n d+=1\r\n elif i==3:\r\n f+=1\r\nprint(n-(max(s,d,f)))", "n=int(input())\na=list(map(int, input().split()))\none=0\ntwo=0\nthree=0\nfor i in a:\n if(i==1):\n one+=1\n elif(i==2):\n two+=1\n elif(i==3):\n three+=1\none_two=one+two\none_three=one+three\ntwo_three=two+three\nprint(min(one_two,one_three,two_three))\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\nList=list(map(int,input().split()))\r\n\r\nc1=List.count(1)\r\nc2=List.count(2)\r\nc3=List.count(3)\r\n\r\nMax=max(c1,max(c2,c3))\r\nprint(n-Max)", "n, num1, num2, num3 = int(input()), 0, 0, 0\r\n\r\nfor item in [int(item) for item in input().split(' ')]:\r\n if item == 1:\r\n num1 += 1\r\n elif item == 2:\r\n num2 += 1\r\n else:\r\n num3 += 1\r\n\r\nif num1 < num2:\r\n t = num1\r\n num1 = num2\r\n num2 = t\r\nif num1 < num3:\r\n t = num1\r\n num1 = num3\r\n num3 = t\r\n\r\nprint(num2 + num3)", "i = int(input())\r\ninputs = list(map(int, input().split()))\r\no = inputs.count(1)\r\nt = inputs.count(2)\r\nh = inputs.count(3)\r\nm = max(o,t,h)\r\nprint(i-m)", "def mce(v,n):\r\n\t\"\"\"max count element\"\"\"\r\n\td=dict()\r\n\tfor c in v:\r\n\t\td.setdefault(c,0)\r\n\t\td[c]+=1\r\n\treturn n-max(d.values())\r\n\r\nn=int(input())\r\nv=[int(c) for c in input().split()]\r\nprint(mce(v,n))", "# LUOGU_RID: 100089669\na=[0]*4\nn=int(input())\nar=input().split()\nfor i in range(n):a[ord(ar[i])^48]+=1\nprint(n-max(a[1],max(a[2],a[3])))", "n = int(input())\r\n#n = input()\r\nm = input()\r\n#n = [int(x) for x in n]\r\n#m = [int(x) for x in m]\r\nt = [m.count('1')]\r\nt.append( m.count('2'))\r\nt.append( m.count('3'))\r\nt.sort()\r\nprint( t[0]+t[1])", "n=int(input())\r\nl=input()\r\nif(l.count('1')>=l.count('2') and l.count('1')>=l.count('3')):\r\n\tprint(l.count('2')+l.count('3'))\r\nelif(l.count('2')>=l.count('1') and l.count('2')>=l.count('3')):\r\n\tprint(l.count('3')+l.count('1'))\r\nelse:\r\n\tprint(l.count('1')+l.count('2'))", "n=int(input())\r\na=[*map(int,input().split())]\r\nprint(n-max([a.count(i) for i in range(1,4)]))\r\n", "n = int(input())\r\na = list(map(int,input().split(\" \")))\r\nans = []\r\nx = a.count(1)\r\ny = a.count(2)\r\nz = a.count(3)\r\nans.append(x)\r\nans.append(y)\r\nans.append(z)\r\nans.sort()\r\nprint(ans[0]+ans[1])", "# n = int(input())\r\n# cont = [int(item) for item in input().split(' ')]\r\n# num = {}\r\n#\r\n# for item in cont:\r\n# num[item] += 1\r\n#\r\n# st = {num[1], num[2], num[3]}\r\n# print(st[0] + st[1])\r\n\r\nn = int(input())\r\ncont = [0, 0, 0]\r\nfor it in [int(item) for item in input().split(' ')]:\r\n cont[it - 1] += 1\r\n\r\ncont.sort()\r\nprint(cont[0] + cont[1])", "from statistics import mode\r\nn = int(input())\r\nall = [int(x) for x in input().split()]\r\ny = mode(all)\r\nhsl = len(all) - all.count(y)\r\nprint(hsl)\r\n", "n=int(input())\r\ncount=0\r\none=0\r\ntwo=0\r\nthree=0\r\nx=list(map(int,input().split()))\r\n\r\nfor i in x:\r\n if i==1:\r\n one=one+1 \r\n elif i==2:\r\n two=two+1 \r\n elif i==3:\r\n three=three+1 \r\nmax_=max(one,two ,three)\r\nanswer=n-max_\r\nprint(answer)", "from collections import deque\r\nfrom math import ceil,floor,sqrt,gcd\r\ndef ii(): return int(input())\r\ndef mi(): return map(int,input().split())\r\ndef li(): return list(mi())\r\ndef si():return input()\r\nn=ii()\r\na=li()\r\nm={}\r\nfor i in a:\r\n if i not in m:\r\n m[i]=1\r\n else:\r\n m[i]+=1\r\nb=[]\r\nfor i in m.keys():\r\n b.append(m[i])\r\nb.sort()\r\nif(len(b)==3):\r\n print(b[0]+b[1])\r\nelif(len(b)==2):\r\n print(b[0])\r\nelse:\r\n print('0')", "print(int(input()) - max((map(input().split().count, map(str, range(1, 4))))))", "n = int(input())\ncounts = 4 * [0]\nfor a in map(int, input().split()):\n counts[a] += 1\n\nresult = n - max(counts)\nprint(result)\n", "def calculate(list1):\n ones=0\n twos=0\n threes=0\n for i in list1:\n if i==1:\n ones=ones+1\n elif i==2:\n twos= twos+1\n else:\n threes += 1\n\n if (ones>twos and ones> threes):\n return 1\n elif (twos>ones and twos>threes):\n return 2\n elif (threes>ones and threes>twos):\n return 3\n elif (ones==threes):\n return 3\n elif (twos==threes):\n return 2\n elif(ones==twos):\n return 1\n\nN=int(input())\n\nnumbers=[]\nreplacements=0\n\n\n\nnumbers =list(map(int, input().split()[:N]))\n\nmost= calculate(numbers)\n\nfor i in range(N):\n if numbers[i]!= most:\n numbers[i] = most\n replacements+=1\n\nprint(replacements)\n\n \t \t\t\t \t \t \t\t\t \t \t\t \t \t\t\t \t", "a = int(input());*q, = map(int, input().split());print(a - max(q.count(1), q.count(2), q.count(3)))\r\n", "l=int(input())\r\narr=list(map(int,input().split()))\r\nc1=arr.count(1)\r\nc2=arr.count(2)\r\nc3=arr.count(3)\r\ncount=[]\r\ncount.append(c1)\r\ncount.append(c2)\r\ncount.append(c3)\r\ncount.sort()\r\nprint(count[0]+count[1])\r\n", "ln = int(input())\r\n\r\narr = [int(x) for x in input().split()]\r\n\r\none = arr.count(1)\r\ntwo = arr.count(2)\r\nthree = arr.count(3)\r\n\r\nwant = max(one,two,three)\r\n\r\nprint(ln-want)", "n = int(input())\r\nnums = input()\r\na = nums.count(\"1\")\r\nb = nums.count(\"2\")\r\nc = nums.count(\"3\")\r\nd = (a, b, c)\r\ne = sorted(d)[0]+sorted(d)[1]\r\nprint(e)", "k=int(input())\r\nb=list(map(int, input().split()))\r\nf1 = b.count(1)\r\nf2 = b.count(2)\r\nf3 = b.count(3)\r\n\r\nif f1 >= f2 and f1 >= f3:\r\n k= 1\r\nelif f2 >= f1 and f2 >= f3:\r\n k= 2\r\nelse:\r\n k= 3\r\ncount = sum(1 for i in b if i != k)\r\nprint(count)\r\n", "input1 = int(input())\r\ninput2 = input().split()\r\nc1 = input2.count(\"1\")\r\nc2 = input2.count(\"2\")\r\nc3 = input2.count(\"3\")\r\nprint(input1-max(c1,c2,c3))", "# http://codeforces.com/problemset/problem/52/A\r\n\r\nn = int(input())\r\nvals = input().split(' ')\r\n\r\ncounts = sorted([vals.count(str(x)) for x in range(1, 4)], reverse=True)\r\nprint(counts[1] + counts[2])\r\n", "from collections import Counter\r\nn=int(input())\r\narr=list(map(int,input().split()))\r\nc=Counter(arr)\r\nv=sorted(dict(c).values())\r\nprint(n-v[-1])", "n=int(input())\r\na=list(map(int,input().split()))\r\nb=0\r\nc1=0\r\nc2=0\r\nc3=0\r\nfor i in range(n):\r\n if(a[i]==1):\r\n c1+=1\r\n elif(a[i]==2):\r\n c2+=1\r\n else:\r\n c3+=1\r\nb=c1+c2\r\nif(b>c2+c3):\r\n b=c2+c3\r\nif(b>c3+c1):\r\n b=c3+c1\r\nprint(b)\r\n\r\n", "n=int(input())\r\nlst=list(map(int,input().split()))\r\ns1=s2=s3=0\r\nfor i in range(0,n):\r\n if lst[i]==1:\r\n s1+=1\r\n elif lst[i]==2:\r\n s2+=1\r\ns3=n-s1-s2\r\ns=max(s1,s2,s3)\r\nprint(n-s)", "from collections import Counter\r\nimport sys\r\n\r\ninput_len, inp_arr = sys.stdin.readlines()\r\nnormalized_len = int(input_len)\r\nnormalized_arr = map(int, inp_arr.split())\r\nc = Counter(normalized_arr)\r\n_, repeats = c.most_common(1)[0]\r\nprint(normalized_len - repeats)", "n=int(input())\r\nl=list(map(int,input().split()))[:n]\r\na=l.count(1)\r\nb=l.count(2)\r\nc=l.count(3)\r\nk=max(a,b,c)\r\nprint(n-k)", "# LUOGU_RID: 121296992\nn = int(input())\nsequence = list(map(int, input().split()))\n\ncounts = [0] * 3\nfor num in sequence:\n counts[num - 1] += 1\n\nmax_count = max(counts)\nmin_replacements = n - max_count\n\nprint(min_replacements)", "n=int(input())\r\nl=list(map(int,input().split()))\r\nn1=l.count(1)\r\nn2=l.count(2)\r\nn3=l.count(3)\r\nl=[n1,n2,n3]\r\nl.sort()\r\nprint(l[0]+l[1])", "from collections import Counter\np=Counter()\nn=int(input())\na=list(map(int,input().split()))\nfor i in a:\n p[i]+=1\nfor j in range(1,4):\n if j==1:\n b=p[j]\n else:\n if p[j]>b:\n b=p[j]\nprint(n-b)\n\n \t\t\t\t\t \t\t \t\t \t\t\t \t\t\t\t\t\t \t\t \t\t", "input();s=[*map(int,input().split())]\r\nprint(len(s)-max(s.count(1),s.count(2),s.count(3)))", "# https://codeforces.com/problemset/problem/52/A\n# 900\n\nn = int(input())\n\nd = {}\nfor i in input().split():\n d.setdefault(i, 0)\n d[i] += 1\n\nm = max(d.values())\nprint(n-m)", "n=int(input())\r\nar=list(map(int,input().split()))\r\nprint(n-max([ar.count(i) for i in range(1,4)]))\r\n", "num = int(input())\r\nlist = input().split()\r\n\r\nonecount = list.count(\"1\")\r\ntwocount = list.count(\"2\")\r\nthreecount = list.count(\"3\")\r\n\r\nlist = [onecount, twocount, threecount]\r\nsortedlist = sorted(list, reverse=True)\r\nprint(num - int(sortedlist[0]))\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\nx = a.count(1)\r\ny = a.count(2)\r\nz = a.count(3)\r\nprint(n - max(x, y, z))\r\n", "a = int(input())\r\nb = list(map(int, input().split()))\r\nx=0\r\ny=0\r\nz=0\r\nt=[]\r\nfor i in range(len(b)):\r\n if b[i]==1:\r\n x+=1\r\n if b[i]==2:\r\n y+=1\r\n if b[i]==3:\r\n z+=1\r\nt.append(x)\r\nt.append(y)\r\nt.append(z)\r\nprint(a-max(t))", "def most_frequent(List):\r\n return max(set(List), key = List.count)\r\n\r\n\r\ninput()\r\nnums = [int(num) for num in input().split(\" \")]\r\nones = 0\r\ntwos = 0\r\nthrees = 0\r\nfor i in range(len(nums)):\r\n if nums[i] == 1:\r\n ones += 1\r\n elif nums[i] == 2:\r\n twos += 1\r\n else:\r\n threes += 1\r\nif ones == twos and twos == threes:\r\n print(2*ones)\r\nelif most_frequent(nums) == 1 :\r\n print(twos + threes)\r\nelif most_frequent(nums) == 2 :\r\n print(ones + threes)\r\nelse:\r\n print(ones + twos)", "n=int(input())\r\na=list(map(int,input().split()))\r\nb=0;c=0;d=0\r\nfor x in a:\r\n if x==1:\r\n b+=1\r\n if x==2:\r\n c+=1\r\n if x==3:\r\n d+=1\r\nprint((b+c+d)-max(b,c,d))", "from collections import *\n\ndef func(intput,mapping,unpack):\n n=intput()\n v=mapping(int)\n hsh=defaultdict(int)\n for e in v: hsh[e]+=1\n v.clear()\n v=[hsh[1],hsh[2],hsh[3]]\n v.sort()\n print(v[1]+v[0])\n \n\ndef init(flag=True):\n intput = lambda : int(input())\n mapping = lambda s: list(map(s,input().split()))\n unpack = lambda s: map(s,input().split())\n for _ in range(int(input()) if flag else 1):\n func(intput,mapping,unpack)\n\nif __name__ == '__main__':\n init(False)", "length = int(input())\r\nnumbers = input().split()\r\na = numbers.count('1') + numbers.count('2')\r\nb = numbers.count('1') + numbers.count('3')\r\nc = numbers.count('2') + numbers.count('3')\r\n\r\nprint(min(a, b, c))", "n = int(input())\r\nai = list(map(int,input().split()))\r\nprint(min(min(n - ai.count(2),n- ai.count(3)),n - ai.count(1)))\r\n", "length = int(input())\r\nnumbers = input().split()\r\na = 0\r\nb = 0\r\nc = 0\r\n\r\nfor i in numbers:\r\n if i == '1':\r\n a += 1\r\n elif i == '2':\r\n b += 1\r\n elif i == '3':\r\n c += 1\r\n\r\nprint(min((a + b), (a + c), (b + c)))", "n=int(input())\na=list(map(int,input().split()))\none=0\ntwo=0\nthree=0\n\nfor b in a:\n if b==1:\n one+=1\n if b==2:\n two+=1\n if b==3:\n three+=1\nprint(n-max(one,two,three))\n\n\t\t \t\t\t\t \t\t \t \t \t\t\t \t\t\t", "m=input()\r\nl=input()\r\n\r\no=l.count('1')\r\nt=l.count('2')\r\nth=l.count('3')\r\nl=[o,t,th]\r\nl.sort()\r\nprint(l[0]+l[1])\r\n", "def sequence(lst):\r\n a = [0, 0, 0]\r\n for elem in lst:\r\n if elem == 1:\r\n a[0] += 1\r\n elif elem == 2:\r\n a[1] += 1\r\n else:\r\n a[2] += 1\r\n return len(lst) - max(a)\r\n\r\n\r\nn = int(input())\r\nb = [int(i) for i in input().split()]\r\nprint(sequence(b))\r\n", "i = int(input())\r\nlist = input()\r\nlist = list.split()\r\ncount = 0\r\nfor y in ['1','2','3']:\r\n count1 = list.count(y)\r\n if count1 > count:\r\n count = count1\r\nprint(i - count)\r\n", "n=int(input())\r\n\r\nl=list(map(int,input().split()))\r\n\r\n\r\na=[]\r\n\r\na.append(l.count(1))\r\na.append(l.count(2))\r\na.append(l.count(3))\r\n\r\n\r\na.sort()\r\n\r\nprint(a[0]+a[1])", "n = int(input())\r\narray = map(int, input().split())\r\n\r\ncount = {1 : 0, 2 : 0, 3 : 0} \r\nfor i in array:\r\n count[i] += 1\r\n\r\nprint(min(count[1] + count[2], count[1] + count[3], count[2] + count[3]))", "#!/usr/bin/python3\r\n\r\nn=int( input().rstrip() )\r\nA=list( map( int, input().split() ) )\r\nB=[0,0,0,0]\r\n\r\nfor i in A:\r\n B[i]+=1\r\n\r\nans=n-max(B)\r\nprint(ans)", "N = int(input())\r\narr = [int(x) for x in input().split()]\r\nprint(N - max(arr.count(1), arr.count(2), arr.count(3)))", "n=input()\nL=input()\n\no=L.count('1')\nt=L.count('2')\nth=L.count('3')\nL=[o,t,th]\nL.sort()\nprint(L[0]+L[1])\n", "n=int(input())\r\na=[int(j) for j in input().split()]\r\na.sort()\r\none,two,three=0,0,0\r\nfor i in a:\r\n if i==1:\r\n one=one+1\r\n elif i==2:\r\n two=two+1\r\n elif i==3:\r\n three=three+1\r\nprint(n-max(one,two,three))" ]

[ "n, r = [int(x) for x in input().split()]\r\n\r\nn = 2 ** n\r\n\r\nxs = [int(x) for x in input().split()]\r\n\r\ns = sum(xs)\r\n\r\nres = [0 for _ in range(r+1)]\r\nfor i in range(r):\r\n res[i] = s / n\r\n i, val = [int(x) for x in input().split()]\r\n s += val - xs[i]\r\n xs[i] = val\r\nres[r] = s / n\r\nprint(\"\\n\".join(map(str, res)))\r\n", "from sys import stdin\nfrom math import fsum\n\n\ndef main():\n n, m = map(int, input().split())\n ff = list(map(float, input().split()))\n scale, r = .5 ** n, fsum(ff)\n res = [r * scale]\n for si, sf in map(str.split, stdin.read().splitlines()):\n i, f = int(si), float(sf)\n r += f - ff[i]\n ff[i] = f\n res.append(r * scale)\n print('\\n'.join(map(str, res)))\n\n\nif __name__ == '__main__':\n main()\n", "R = lambda:list(map(int,input().split()))\r\nsum1 = 0\r\np1 = 1\r\na = [0]*263000\r\nb = a\r\nn,r = R()\r\np1 = 2**n\r\na = R()\r\nsum1 = sum(a)\r\np2 = sum1 / p1\r\nfor i in range(r):\r\n\tz,g=R()\r\n\tsum1 = sum1 - a[z] + g\r\n\ta[z] = g\r\n\tb[i] = sum1/p1\r\nprint(p2)\r\nfor i in range(r):\r\n\tprint(b[i])", "import sys\r\n\r\nn, r = [int(x) for x in sys.stdin.readline().split()]\r\na = [int(x) for x in sys.stdin.readline().split()]\r\ns = sum(a)\r\nn = 2**n\r\nsys.stdout.write(str(s / n)+\"\\n\")\r\nfor i in range(r):\r\n\tp, x = [int(x) for x in sys.stdin.readline().split()]\r\n\ts = s - a[p] + x\r\n\ta[p] = x\r\n\tsys.stdout.write(str(s / n)+\"\\n\")" ]

[ "n=int(input())\r\nl=list(str(n))\r\nn=int(n)\r\nc=0\r\nwhile n!=0:\r\n m=max(list(str(n)))\r\n n-=int(m)\r\n c+=1\r\n\r\nprint(c)", "import sys\r\n\r\n#rrange = lambda mi, ma: range(ma-1, mi-1, -1)\r\n\r\ndp = {}\r\n\r\ndef one_step(n):\r\n val = max(int(c) for c in str(n))\r\n return n - val\r\n\r\ndef solve_iter(n):\r\n res = 0\r\n while n > 0:\r\n n = one_step(n)\r\n res += 1\r\n return res\r\n\r\n# compute dp[m, 1, a] (go from x9a to x'9b where x' = x-1) \r\nfor m in range(1, 10):\r\n for a in range(10):\r\n num = int(f\"{m}9{a}\")\r\n down_to = int(f\"{m-1}99\")\r\n steps = 0\r\n while num > down_to:\r\n num = one_step(num)\r\n #print(num)\r\n steps += 1\r\n dp[m, 1, a] = steps, num % 10\r\n\r\ndef steps(m, k, a):\r\n if (m, k, a) in dp:\r\n return dp[m, k, a]\r\n if m == 0:\r\n return steps(9, k-1, a)\r\n assert k > 1, (m, k, a)\r\n assert m > 0, (m, k, a)\r\n res, last = 0, a\r\n for y in range(0, 10)[::-1]:\r\n st, last = steps(max(m, y), k-1, last)\r\n res += st\r\n dp[m, k, a] = res, last\r\n return res, last\r\n\r\nfor m in range(1, 10):\r\n for k in range(1, 3):\r\n for a in range(10):\r\n steps(m, k, a)\r\n\r\n#for key in sorted(dp):\r\n# print(key, dp[key])\r\n\r\ndef solve(n):\r\n a = n % 10\r\n res = 0\r\n def mk():\r\n nc = n // 10\r\n k = 0\r\n m = 0\r\n while nc % 10 == 9:\r\n k += 1\r\n nc //= 10\r\n while nc != 0:\r\n m = max(m, nc % 10)\r\n nc //= 10\r\n return m, k\r\n \r\n while n != 0:\r\n print(n, file=sys.stderr)\r\n m, k = mk()\r\n if k == 0:\r\n #targ = ((n//100)-1)*100+99\r\n #while n > targ:\r\n # print(n)\r\n res += 1\r\n n = one_step(n)\r\n elif k == 1 and m == 0:\r\n res += 1\r\n n = one_step(n)\r\n else:\r\n hops, last = steps(m, k, n % 10)\r\n if m == 0:\r\n n = ((n//10**(k))-1)*10**(k)+((10**(k-1))-1)*10+last\r\n else:\r\n n = ((n//10**(k+1))-1)*10**(k+1)+((10**k)-1)*10+last\r\n res+=hops\r\n\r\n print(res)\r\n \r\nN = int(input())\r\nsolve(N)\r\n#print(f\"iterative solution = {solve_iter(N)}\")\r\n", "n,c=int(input()),0\r\nwhile n:n-=int(max(str(n)));c+=1\r\nprint(c)", "num = input()\r\nmove = 0\r\nwhile num != \"0\":\r\n move += 1\r\n num = str(int(num) - max([int(thing) for thing in num]))\r\nprint(move)", "n=int(input())\r\nc=0\r\nwhile(n!=0):\r\n n=n-int(max(list(str(n))))\r\n # print(n)\r\n c=c+1\r\nprint(c)", "def converte(c):\n return (ord(c) - 48)\n\ndef main():\n\n n = int(input())\n \n infinito = float(\"inf\")\n minima_operacao = [infinito for i in range(n + 1)]\n minima_operacao[0] = 0\n\n for i in range(1,n+1):\n for c in str(i): \n minima_operacao[i] = min(minima_operacao[i], minima_operacao[i - converte(c)] + 1)\n\n print(minima_operacao[n])\n\nif __name__ == '__main__':\n\tmain()", "n = int(input())\r\n\r\ncount = 0\r\nwhile n > 0:\r\n ns = list(str(n))\r\n ni = [int(x) for x in ns]\r\n n -= max(ni)\r\n count += 1\r\n\r\nprint(count)", "n,k=int(input()),0\r\nwhile n:\r\n n-=int(max(list(str(n))))\r\n k+=1\r\nprint(k)", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\nc = 0\r\nwhile n>0:\r\n k = max(map(int, list(str(n))))\r\n n -= k\r\n c += 1\r\nprint(c)\r\n", "def calc(n):\r\n mx = 0\r\n while(n):\r\n mx = max(mx,n%10)\r\n n//=10\r\n return mx\r\nn = int(input())\r\nans = 0\r\nwhile(n!=0):\r\n n-= calc(n)\r\n ans+=1\r\nprint(ans)", "n,cnt=int(input()),0\r\nwhile n:n-=int((max(list(str(n)))));cnt+=1\r\nprint(cnt)", "\r\n\r\ndef solve (n):\r\n count = 0\r\n s = int(n)\r\n while True:\r\n if s == 0:\r\n print(count)\r\n break\r\n s -= int(max(str(n)))\r\n n = s\r\n count += 1 \r\n\r\n\r\n\r\nn = input()\r\nsolve(n)", "n = int(input())\r\ns = [int(i) for i in list(str(n))]\r\ncount = 0\r\nwhile n != 0:\r\n n -= max(s)\r\n s = [int(i) for i in list(str(n))]\r\n count += 1\r\nprint(count)", "s = int(input())\r\ncnt = 0\r\nwhile s:\r\n s -= max(map(int, str(s)))\r\n cnt += 1\r\nprint(cnt)", "n = input()\nif n == '0':\n print(0)\nelse:\n count = 0\n while int(n) != 0:\n b = max(n)\n n = str(int(n) - int(b))\n count += 1\n print(count)", "n = int(input())\r\nc = 0\r\nwhile n!=0:\r\n n-=max(map(int,str(n)))\r\n c+=1\r\nprint(c)\r\n", "n = int(input())\n\n\ndef calc_dec(n):\n dig = [int(x) for x in str(n)]\n mx = 0\n for i in dig:\n if i > mx:\n mx = i\n return n - mx\n\n\ni = 0\nwhile n != 0:\n n = calc_dec(n)\n i += 1\n\nprint(i)\n", "import random\r\nimport time\r\n\r\n# n = random.randint(10**6, 10**7-1)\r\nn = 10**7-1 # \tanswer: 1245093 | 0.73 secs\r\n# n = 10**7-5 # \tanswer: 1245092\r\n# n = 10**5-5 # \tanswer: 13350\r\n# n = 10**5-500 # answer: 13295\r\n\r\n# n = 500001 # best: .1098 | answer: 66755\r\n\r\n# n = 99999\r\n\r\n# n = 99\r\n\r\ndef F(n):\r\n\ti = 0\r\n\twhile n > 0:\r\n\t\tx = 0\r\n\r\n\t\tnn = str(n)\r\n\r\n\t\tif '9' in nn:\r\n\t\t\tx = 9\r\n\t\telif '8' in nn:\r\n\t\t\tx = 8\r\n\t\telif '7' in nn:\r\n\t\t\tx = 7\r\n\t\telif '6' in nn:\r\n\t\t\tx = 6\r\n\t\telif '5' in nn:\r\n\t\t\tx = 5\r\n\t\telse:\r\n\t\t\tx = 0\r\n\r\n\t\t\tfor letter in nn:\r\n\t\t\t\tl = int(letter)\r\n\t\t\t\tif l > x:\r\n\t\t\t\t\tx = l\r\n\r\n\t\t\tif nn[-1] != str(x):\r\n\t\t\t\tn -= 10+int(nn[-1])-x\r\n\t\t\t\ti += 1\r\n\r\n\r\n\t\t# print(n, x, i)\r\n\r\n\t\tn -= x\r\n\t\ti += 1\r\n\r\n\treturn i\r\n\r\nstime = time.time()\r\n\r\nr = F(int(input()))\r\n\r\n\r\n# print('r', F(500)+F(499))\r\n\r\n\r\n# for n in range(9, 100):\r\n# \tr = F(n)\r\n\r\n# \tprint(n, r)\r\n\r\n# print(time.time()-stime)\r\n\r\nprint(r)\r\n", "n = input()\r\ntmp = int(n)\r\ni = 0\r\nwhile tmp != 0:\r\n sub = max([int(x) for x in str(tmp)])\r\n tmp -= sub\r\n #print(tmp)\r\n i += 1\r\nprint(i)", "def solve(n):\r\n count = 0\r\n while(n!=0):\r\n p = str(n)\r\n mx = p[0]\r\n for i in p:\r\n mx = max(mx,i)\r\n n -= int(mx)\r\n count += 1\r\n return count\r\nn = int(input())\r\nprint(solve(n))", "from sys import stdin,stdout\r\nfrom math import gcd,sqrt,factorial,inf\r\nfrom collections import deque,defaultdict\r\ninput=stdin.readline\r\nR=lambda:map(int,input().split())\r\nI=lambda:int(input())\r\nS=lambda:input().rstrip('\\n')\r\nL=lambda:list(R())\r\nP=lambda x:stdout.write(x)\r\nlcm=lambda x,y:(x*y)//gcd(x,y)\r\nhg=lambda x,y:((y+x-1)//x)*x\r\npw=lambda x:0 if x==1 else 1+pw(x//2)\r\nchk=lambda x:chk(x//2) if not x%2 else True if x==1 else False\r\nsm=lambda x:(x**2+x)//2\r\nN=10**9+7\r\n\r\ndef max_int(n):\r\n\tm=-inf\r\n\twhile n:\r\n\t\tm=max(m,n%10)\r\n\t\tn//=10\r\n\treturn m\r\n\r\nn=I()\r\nans=0\r\nwhile n:\r\n\tans+=1\r\n\tn-=max_int(n)\r\nprint(ans)", "n=int(input())\r\nc=0\r\nwhile n!=0:\r\n l=list(str(n))\r\n n-=int(max(l))\r\n c+=1\r\nprint(c)", "n=int(input())\r\ncount=0\r\nwhile n>0:\r\n l=[]\r\n for i in str(n):\r\n l+=[int(i)]\r\n m=max(l)\r\n # print(m)\r\n n=n-m\r\n count+=1\r\nprint(count)", "n = int(input())\r\n\r\nans = 0\r\n\r\nwhile n > 0:\r\n digits = list(map(lambda x: int(x), str(n)))\r\n max_d = max(digits)\r\n n -= max_d\r\n ans += 1\r\n\r\nprint(ans)\r\n", "n=int(input())\r\nc=0\r\nwhile(n>0):\r\n\tl=max(str(n))\r\n\tn=n-int(l)\r\n\tc+=1\r\nprint(c)\r\n", "a=int(input())\r\nk=0\r\nwhile a != 0: \r\n a=a-int(max(str(a)))\r\n k=k+1\r\nprint(k)", "n=int(input())\r\ns=0\r\nwhile n>0:\r\n a=list(str(n))\r\n a.sort()\r\n n-=int(a[-1])\r\n s+=1\r\nprint(s)", "n = int(input())\r\nk = 0\r\nwhile n:\r\n n -= max(map(int, list(str(n))))\r\n k += 1\r\nprint(k)", "n = int(input())\r\nanw = 0\r\nwhile True:\r\n if n == 0:\r\n break\r\n s = list(str(n))\r\n m = max(s)\r\n n-= int(m)\r\n anw+=1\r\nprint(anw)\r\n", "n=input()\r\nans=0\r\nwhile(max(n)!=\"0\"):\r\n t=max(n)\r\n k=int(n)-int(t)\r\n n=str(k)\r\n ans+=1\r\nprint(ans)\r\n", "def main():\n num = int(input())\n subs = 0\n while num != 0:\n mx = 0\n n = 0\n str_num = str(num)\n for i in range(0, len(str_num)):\n n = max(n, int(str_num[i]))\n num = int(str_num) - n\n subs+=1\n print(subs)\n\n\nif __name__ == \"__main__\":\n main()\n", "def listChisel(a):\r\n s = list()\r\n a = int(a)\r\n while a > 0:\r\n s.append(str(int(a) % 10))\r\n a = a // 10\r\n s.reverse()\r\n return s\r\n\r\n\r\na = int(input())\r\nc = 0\r\ns = ''\r\nwhile a > 0:\r\n s = listChisel(a)\r\n # print(s)\r\n j = max(s)\r\n newS = int(''.join(s)) - int(j)\r\n a = int(newS)\r\n c += 1\r\nprint(c)\r\n", "n = int(input())\r\nk = 0\r\nwhile n > 0:\r\n n -= max(list(map(int, str(n))))\r\n k += 1\r\nprint(k)", "def jc(n):\r\n counter = 0\r\n\r\n while int(n) != 0:\r\n n_int = int(n)\r\n n_int -= find_largest_digit(n)\r\n n = str(n_int)\r\n counter += 1\r\n\r\n return counter\r\n\r\n\r\ndef find_largest_digit(n):\r\n n_len = len(n)\r\n\r\n larger = 0\r\n for i in range(0, n_len):\r\n if int(n[i]) > larger:\r\n larger = int(n[i])\r\n\r\n return larger\r\n\r\n\r\nif __name__ == \"__main__\":\r\n number = input()\r\n print(jc(number))\r\n", "count = 0\r\nn = int(input())\r\nwhile n>0:\r\n n-=int(max(str(n)))\r\n count+=1\r\nprint(count)\r\n", "n = int(input())\r\nk = 0\r\nwhile n > 0:\r\n x = int(max(list(str(n))))\r\n n -= x\r\n k += 1\r\nprint(k)", "n=int(input())\r\nc=0\r\nwhile n>0:\r\n p=str(n)\r\n q=max(p)\r\n n-=int(q)\r\n c+=1\r\nprint(c)\r\n", "n=int(input())\r\nres=0\r\nwhile n!=0:\r\n mx=0\r\n for i,x in enumerate(str(n)):\r\n if int(x)>mx:mx=int(x)\r\n n-=mx\r\n res+=1\r\nprint(res)", "n = int(input())\r\no = 0\r\nwhile n > 0:\r\n n -= int(max(str(n)))\r\n o += 1\r\nprint(o)", "n=int(input())\r\nans=0\r\nwhile n!=0:\r\n p=int(max(list(str(n))))\r\n n-=p\r\n ans+=1\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\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(ans)", "#!/usr/bin/env python3\nn = int(input())\ncounter = 0\nwhile n>0:\n n-=max(list(map(int,list(str(n)))))\n counter += 1\nprint(counter)\n\n", "import random\r\nimport math\r\n\r\nimport itertools\r\n\r\n\r\nliczba = int(input())\r\nwynik = 0\r\nwhile liczba != 0:\r\n maks = 0\r\n for x in str(liczba):\r\n maks = max(maks, int(x))\r\n liczba -= maks\r\n wynik += 1\r\nprint(wynik)", "n,a=int(input()),0\r\nwhile n:\r\n\tn-=int(max(str(n)))\r\n\ta+=1\r\nprint(a)", "n,oper=int(input()),0\r\nwhile n:n-=int(max(str(n)));oper+=1\r\nprint(oper)\r\n", "n = int(input())\r\ncnt = 0\r\nwhile n:\r\n m = -1\r\n for i in str(n):\r\n m = max(m,int(i))\r\n n-=m\r\n cnt+=1\r\nprint(cnt)", "def findMaxDigit(x):\r\n ans = x%10\r\n x//=10\r\n while(x>0):\r\n if (ans < x%10):\r\n ans = x%10\r\n if (ans == 9):\r\n return ans\r\n x//=10\r\n return ans\r\n\r\nn = int(input())\r\ncount = 0\r\nwhile(n>0):\r\n tmp = findMaxDigit(n)\r\n n-= tmp\r\n count+=1\r\nprint(count)\r\n", "def maiorNumero(n):\r\n numeros = []\r\n while n > 0:\r\n numeros.append(n % 10)\r\n n //= 10\r\n\r\n return max(numeros)\r\n\r\nn = int(input())\r\ncont = 0\r\nwhile n > 0:\r\n n -= maiorNumero(n)\r\n cont += 1\r\n\r\nprint(cont)", "n = int(input())\r\n\r\nnmaks = 0\r\nhasil = 0\r\ncek = n\r\n\r\nwhile(n > 0):\r\n nmaks = 0\r\n cek = n\r\n if(n > 9):\r\n while(cek > 0):\r\n if(cek % 10 > nmaks):\r\n nmaks = cek % 10\r\n cek = cek // 10\r\n else:\r\n nmaks = n\r\n n -= nmaks\r\n hasil += 1\r\n\r\nprint(hasil)\r\n", "def getMaxDigit(num):\r\n ans = 0\r\n while num>0:\r\n if num%10>ans:\r\n ans = num%10\r\n num //= 10\r\n return ans\r\n\r\nn = int(input())\r\nans = 0\r\nwhile n>0:\r\n max_digit = getMaxDigit(n)\r\n if n==0:\r\n break\r\n ans += 1\r\n n -= max_digit\r\n # print(n)\r\nprint(ans)", "def solve(n):\r\n F = [0]\r\n for k in range (1, n+1):\r\n F.append(1+min(F[k-d] for d in (int(x) for x in set(str(k))) if d > 0))\r\n return F[n]\r\n\r\nn = int(input())\r\nprint(solve(n))", "import sys\r\n\r\ninput = lambda: sys.stdin.readline()\r\nI = lambda: int(input())\r\nM = lambda: map(int, input().strip().split())\r\nL = lambda: list(map(int, input().strip().split()))\r\nS = lambda: input().strip()\r\n\r\nn = I()\r\ncount = 0\r\nwhile n:\r\n n -= max(int(i) for i in str(n))\r\n count += 1\r\nprint(count)\r\n", "n = input()\r\ncnt = 0\r\nwhile n!='0':\r\n cnt+=1\r\n mx = 0\r\n for i in n:\r\n mx = max(mx,int(i))\r\n n = str(int(n)-mx)\r\nprint(cnt)", "a = int(input())\nk = 0\nwhile a>0:\n a -= max([int(c) for c in str(a)])\n k += 1\nprint(k)", "n=int(input())\r\ncount=0\r\nwhile n>0:\r\n n-=int(max(str(n)))\r\n count+=1\r\nprint(count)", "n = int(input())\r\ncount = 0\r\nwhile n>0:\r\n\tn-=max(map(int, str(n)))\r\n\tcount += 1\r\nprint(count)", "num=int(input())\r\nc=0\r\nwhile num!=0:\r\n k=list(str(num))\r\n d=int(max(k))\r\n num-=d\r\n c+=1\r\nprint(c)\r\n\r\n", "n=int(input()) \ncount=0\n\nwhile n:\n n -= max(int(i) for i in str(n))\n count += 1\n\nprint (count)\n\t \t \t \t \t \t\t \t \t\t\t\t\t \t", "n=int(input())\r\ncount=0\r\nwhile (n>0):\r\n s1=str(n)\r\n l1=[]\r\n for i in range (len(s1)):\r\n l1.append(int(s1[i]))\r\n n-=max(l1)\r\n count+=1\r\nprint(count)", "n = int(input())\r\nc=0\r\nwhile n>0:\r\n numl =[ int(i) for i in str(n)]\r\n n -= max(numl)\r\n c+=1\r\nprint(c)", "n = int(input())\r\ncount = 0\r\nwhile n != 0:\r\n n = str(n)\r\n maxi = 0\r\n for i in n:\r\n if int(i) > maxi:\r\n maxi = int(i)\r\n n = int(n) - maxi\r\n count +=1\r\nprint(count)", "x = int(input())\n\nplace =10\nbigdig = 0\nans = 0\nwhile(x):\n string = str(x)\n # print(string)\n bigdig = 0\n for digit in string:\n if int(digit) > bigdig:\n bigdig = int(digit)\n x= x-bigdig\n ans+=1\n\nprint(ans)\n\n", "n = int(input())\r\ncnt = 0\r\nwhile n:\r\n n -= int(max(str(n)))\r\n cnt += 1\r\nprint(cnt)", "n=int(input())\r\nk=0\r\nwhile n:n-=int(max(str(n)));k+=1\r\nprint(k)", "mod = 1000000007\r\nii = lambda : int(input())\r\nsi = lambda : input()\r\ndgl = lambda : list(map(int, input()))\r\nf = lambda : map(int, input().split())\r\nil = lambda : list(map(int, input().split()))\r\nls = lambda : list(input())\r\nn=ii()\r\nc=0\r\nwhile n>0:\r\n n-=int(max(list(str(n))))\r\n c+=1\r\nprint(c)", "def split_int(n):\r\n n_str = str(n)\r\n result = []\r\n for i in n_str:\r\n result.append(int(i))\r\n return result\r\n\r\n\r\nn = int(input())\r\nanswer = 0\r\nwhile n > 0:\r\n n -= max(split_int(n))\r\n answer += 1\r\nprint(answer)", "q = int(input())\r\nnum = 0\r\nd = 0\r\nwhile q != 0:\r\n num = int(max(str(q)))\r\n q = q - num\r\n d += 1\r\n\r\nprint(d)", "n = int(input())\r\n\r\nk = 0\r\nm = 0\r\n\r\nwhile int(n) != 0:\r\n m = int(max(str(n)))\r\n n -= m\r\n k += 1\r\n \r\nprint(k)\r\n\r\n", "a=int(input())\r\nk=0\r\nwhile a:\r\n a = a-int(max(str(a)))\r\n k+=1\r\nprint(k)", "def max_digit(n):\r\n x=[]\r\n n=str(n)\r\n for i in range(0,len(n)):\r\n x.append(int(n[i]))\r\n c=int(max(x))\r\n return c\r\n\r\nn=int(input())\r\ny=0\r\nwhile n!=0:\r\n x=max_digit(n)\r\n n=n-int(x)\r\n y+=1\r\nprint(y)\r\n", "def greatestDigit(n):\n res = 0\n\n while n > 0:\n res = max(res, n%10)\n n = n//10\n \n\n return res\n\ndef solve(magicNum):\n if magicNum == 0: return 0\n\n res = 0\n\n while magicNum > 0:\n maxDig = greatestDigit(magicNum)\n magicNum-= maxDig\n res+=1\n \n return res\n\n\nmagicNum = int(input())\n\nprint(solve(magicNum))", "n = int(input())\r\n\r\ndef max_digit(n):\r\n max_dig = -1\r\n while n > 0:\r\n if n%10 > max_dig:\r\n max_dig = n%10\r\n n //= 10\r\n return max_dig\r\n\r\ncount = 0\r\nwhile n != 0:\r\n if n == 0:\r\n break\r\n n -= max_digit(n)\r\n count += 1\r\nprint(count)\r\n", "n=int(input())\r\ncount=0\r\nwhile n!=0:\r\n s=str(n)\r\n m=0\r\n for i in s:\r\n if int(i)>m:\r\n m=int(i)\r\n n-=m\r\n count+=1\r\nprint(count)\r\n\"\"\"\r\nimport matplotlib.pyplot as plt\r\nimport numpy as np\r\nll=[]\r\nfor n in range(1,100000,1000):\r\n count = 0\r\n while n!=0:\r\n s=str(n)\r\n m=0\r\n for i in s:\r\n if int(i)>m:\r\n m=int(i)\r\n n-=m\r\n count+=1\r\n ll.append(count)\r\nxpoint= np.array([i for i in range(1,100000,1000)])\r\nypoint= np.array(ll)\r\nplt.plot(xpoint,ypoint)\r\nplt.show()\"\"\"", "\nsums = int(input())\ncount = 0\nwhile sums!=0:\n stringg = str(sums)\n maxi = max(stringg)\n sums = sums - int(maxi)\n count = count + 1\nprint(count)\n\ndef countways(n): \n if (n == 1): \n return 0; \n elif (n % 2 == 0): \n return 1 + countways(n / 2); \n else: \n return 1 + min(countways(n - 1), \n countways(n + 1)); \n \n \n", "\n# n = 24\ndef get_subs(n):\n count = 0\n while n != '0':\n digits = [int(i) for i in n]\n max_digit = max(digits)\n n = int(n) - max_digit\n n = str(n)\n count += 1\n return count\n\n\n\n\nif __name__ == '__main__':\n n = input()\n print(get_subs(n))\n", "s=input()\r\nn=int(s)\r\nans=0\r\nwhile n!=0:\r\n for i in range(9,0,-1):\r\n if str(i) in str(n):\r\n n-=i\r\n ans+=1\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 \r\n \r\n", "#!/usr/bin/env python3\r\n#-*- coding: utf-8 -*-\r\n# author: Neto, Jocelino\r\n\r\n# Distinct subtraction sequences can obviously get you different number of\r\n# operations. But the Smart Beaver is ready to face the worst and is asking\r\n# you to count the minimum number of operations he needs to reduce the magic\r\n# number to zero.\r\n\r\nif __name__ == '__main__':\r\n n = int(input())\r\n iterations = 0\r\n _max = 0\r\n _remainder = 0\r\n\r\n while n > 0:\r\n _remainder = n\r\n _max = 0\r\n\r\n while _remainder > 0 and _max != 9:\r\n _max = max(_max, _remainder % 10)\r\n _remainder = _remainder // 10\r\n iterations += 1\r\n n -= _max\r\n print(iterations)", "def julyaCalendar(magicNumber):\r\n minimumSteps = 0\r\n while magicNumber > 0:\r\n # Cast de valor inteiro para string\r\n string = str(magicNumber)\r\n # Cast dos caracteres da string para lista \r\n # de inteiros\r\n numbers = list(map(int,list(string)))\r\n # Obtem o maximo dos inteiros\r\n # e subtrai do numero magico atual\r\n magicNumber -= max(numbers)\r\n # Contabiliza o numero de passos\r\n minimumSteps += 1\r\n return minimumSteps\r\n\r\nif __name__ == \"__main__\":\r\n magicNumber = int(input())\r\n print(julyaCalendar(magicNumber))", "dp = [0] * 1000005\r\nfor i in range(1, 10):\r\n dp[i] = 1\r\n\r\nfor i in range(10, 1000001):\r\n minx = 10000000\r\n for j in str(i):\r\n if j != '0':\r\n minx = min(minx, dp[i-int(j)]+1)\r\n \r\n dp[i] = minx\r\n\r\nprint(dp[int(input())])", "n = input()\r\nr = 0\r\nc = 0\r\nwhile (n != \"0\"):\r\n c += 1 # Conteo (memoria)\r\n r = int(max(n))\r\n n = int(n)\r\n n = n - r\r\n n = str(n)\r\nprint(c)", "n=int(input())\nc=0\nwhile (n>0):\n maxd=0\n if n<=50 and n%10==0:\n c+=2*n//10\n n=0\n break\n for ch in str(n):\n maxd=max(maxd, int(ch))\n n-=maxd\n c+=1\nprint(c)\n\n", "n=int(input())\r\ni=0\r\nwhile n!=0:\r\n n-=int(max(list(str(n))))\r\n i+=1\r\nprint(i)", "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 m(n):\r\n s=0\r\n while(n!=0):\r\n s=max(s,n%10)\r\n n//=10\r\n return s\r\nn=I()\r\nc=0\r\nwhile(n!=0):\r\n n-=m(n)\r\n c+=1\r\nprint(c)\r\n", "# your code goes here\r\nn=int(input())\r\nk=0\r\nwhile n>0:\r\n\tk+=1\r\n\tn-=int(max(str(n)))\r\nprint(k)", "#%%\r\n\r\nn = int(input())\r\n\r\nanswer = [-1] * (n+1)\r\nanswer[0] = 0\r\n\r\ndef digits(x):\r\n # 4234 -> [4, 2, 3, 4]\r\n return [int(i) for i in str(x)]\r\n\r\nfor i in range(1, n+1):\r\n # i = 15\r\n pretendents = []\r\n for digit in digits(i):\r\n # for i in [1, 5]\r\n if digit != 0:\r\n # pretendents.append( answer[15-1]) \r\n # pretendents.append( answer[15-5])\r\n pretendents.append(answer[i-digit])\r\n # pretendents = [answer[14], answer[10]]\r\n # answer[15] = min(pretendents) + 1\r\n answer[i] = min(pretendents) + 1\r\n\r\nprint(answer[n])\r\n", "# -*- coding: utf-8 -*-\n\"\"\"331C1.ipynb\n\nAutomatically generated by Colaboratory.\n\nOriginal file is located at\n https://colab.research.google.com/drive/1Yx192ckTJSgud86ma91zypTA4V6SJ_kS\n\"\"\"\n\ndef digit(n):\n l=[]\n for i in n:\n l.append(int(i))\n return max(l)\n\nn=input()\nnn=int(n)\nd=digit(n)\ncont=0\nwhile nn!=0:\n n=str(nn-d)\n nn=int(n)\n d=digit(n)\n cont+=1\nprint(cont)\n\ncont", "from sys import stdin\r\ninput=lambda : stdin.readline()\r\nfrom math import ceil,sqrt,gcd\r\nn=int(input())\r\ncount=0\r\nwhile n!=0:\r\n\tn-=int(max(list(str(n))))\r\n\tcount+=1\r\nprint(count)", "n, counter = int(input()), 0\r\nwhile n > 0:\r\n n -= int(max(str(n)))\r\n counter += 1\r\n\r\nprint(counter)\r\n", "from sys import stdin\r\ninput_ = stdin.readline\r\nmagic_num = input_()\r\noperations = 0\r\ni = 0\r\nwhile(i < int(magic_num)):\r\n if magic_num == 0:\r\n break\r\n max_num = max({int(x) for x in str(magic_num).strip()})\r\n magic_num = int(magic_num) - max_num\r\n operations += 1\r\n \r\n\r\n\r\nprint(operations)\r\n ", "n, res = int(input()), 1\r\nif n != 0:\r\n while len(str(n)) > 1:\r\n res += 1\r\n n -= max(list(map(int, str(n))))\r\n print(res)\r\nelse:\r\n print('0')", "\r\n \r\n\r\n\r\nn = int(input())\r\ns=0\r\n\r\nwhile n!=0:\r\n u = list(str(n))\r\n u.sort()\r\n n-=int(u[-1])\r\n s+=1\r\n\r\nprint(s)\r\n", "n=int(input()) \r\ncount=0\r\n\r\nwhile n:\r\n n -= max(int(i) for i in str(n))\r\n count += 1\r\n\r\nprint (count)", "num=int(input())\nans=0\nwhile(num!=0):\n L=list(str(num))\n d=int(max(L))\n num-=d\n ans+=1\nprint(ans)\n", "import math\r\nimport sys\r\ninput = sys.stdin.readline\r\nn = int(input())\r\nopt = 0\r\nwhile n != 0:\r\n n -= int(max(list(str(n))))\r\n opt += 1\r\nprint(opt)", "s = int(input())\r\ncount = 0\r\nwhile s > 0:\r\n s -= int(max(str(s)))\r\n count += 1\r\nprint(count)", "n=input()\r\nx=int(n)\r\nc=0\r\nwhile x!=0:\r\n c=c+1\r\n ma=max(list(map(int,n)))\r\n x=x-ma\r\n n=list(str(x))\r\nprint(c)", "n = input()\r\n\r\ncnt = 0\r\nwhile int(n) > 0:\r\n n = str(int(n) - int(max(n)))\r\n cnt += 1\r\n \r\nprint(cnt)", "n = int(input())\r\ncnt = 0\r\nwhile n > 0 :\r\n mx = -100\r\n for i in str(n):\r\n mx = max(mx , int(i))\r\n\r\n n -= mx\r\n mx = -100\r\n cnt +=1\r\n\r\nprint(cnt)\r\n\r\n\r\n", "n = int(input())\r\nc=0\r\nwhile n!=0: \r\n n -= max([int(i) for i in str(n)])\r\n c+=1\r\nprint(c)", "import sys\r\nfrom math import sqrt, floor, factorial, gcd\r\nfrom collections import deque, Counter\r\ninp = sys.stdin.readline\r\nread = lambda: list(map(int, inp().strip().split()))\r\n\r\n\r\ndef solve():\r\n\tn = int(inp()); s = 0\r\n\twhile n > 0:\r\n\t\tm = n%10; t = n\r\n\t\twhile t > 0:\r\n\t\t\tm = max(m, t%10)\r\n\t\t\tt //= 10\r\n\t\tn -= m\r\n\t\t# print(n, m)\r\n\t\ts += 1\r\n\tprint(s)\r\n\r\n\r\n\r\nif __name__ == \"__main__\":\r\n\tsolve()\r\n\r\n\r\n", "q=int(input())\r\nk=0\r\nwhile q!=0:\r\n w=list(map(int,list(str(q))))\r\n e=max(w)\r\n q-=e\r\n k+=1\r\nprint(k)", "i = int(input())\r\nk = 0\r\nwhile i != 0: i-=int(max(str(i))); k+=1\r\nprint(k)", "n = int(input())\ncount = 0\nwhile n != 0:\n d = max(int(i) for i in str(n))\n n = n - d\n count += 1\nprint(count)\n", "s = input()\r\nn = int(s)\r\nans = 0\r\nwhile n != 0:\r\n n -= int(max(s))\r\n s = str(n)\r\n ans += 1\r\nprint(ans)", "n = int(input())\r\nsteps=0\r\nwhile n != 0:\r\n n -= max([int(k) for k in str(n)])\r\n steps += 1\r\nprint(steps)", "n = int(input())\r\n\r\ncount = 0\r\n\r\nwhile n > 0:\r\n n_arr = list(str(n))\r\n n_arr_sorted = sorted(n_arr)\r\n n = n - int(n_arr_sorted[len(n_arr_sorted) - 1])\r\n count+=1\r\n\r\nprint(count)", "\r\n\r\n\r\nn=int(input());\r\n\r\nc=0;\r\nwhile(n>0):\r\n\tk=n;\r\n\tmaxx=0;\r\n\twhile(k>0):\r\n\t\tmaxx=max(maxx,k%10);\r\n\t\tk=k//10;\r\n\tn-=maxx;\r\n\tc+=1;\r\nprint(c);\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "def findMax(N):\r\n Max = 0\r\n while(N!=0):\r\n Rem = N%10\r\n N = N//10\r\n Max = max(Max,Rem)\r\n return Max\r\nN =int(input())\r\ncount = 0\r\nwhile(N!=0):\r\n X = findMax(N)\r\n N-=X\r\n count+=1\r\nprint(count)", "if __name__ == '__main__':\r\n n = int(input())\r\n ans = 0\r\n while(n):\r\n n -= int(max(str(n)))\r\n ans += 1\r\n print(ans)", "def mx(var):\r\n\tret = 0\r\n\twhile var:\r\n\t\tret = max(ret, var % 10)\r\n\t\tvar = var // 10\r\n\treturn ret\r\n\r\nn = int(input())\r\ncnt = 0\r\nwhile n :\r\n\tn -= mx(n)\r\n\tcnt += 1\r\nprint(cnt)", "n=int(input())\r\ndef ispres(num):\r\n dig=0\r\n m=num\r\n while m>0:\r\n d=m%10\r\n dig=max(dig,d)\r\n m=m//10\r\n return dig\r\ndp=[999999 for _ in range(n+1)]\r\n\r\ndp[n-ispres(n)]=1\r\nif n==0:\r\n print(0)\r\n exit(0)\r\nfor i in range(n,-1,-1):\r\n k=ispres(i)\r\n\r\n if i-k>=0:\r\n\r\n dp[i-k]=min(dp[i-k],dp[i]+1)\r\n\r\nif dp[0]==999999:\r\n print(0)\r\n exit(0)\r\nprint(dp[0])\r\n", "from sys import stdin\r\ninput = stdin.readline\r\n \r\nn = int(input())\r\nans = 0\r\nwhile n > 0:\r\n h = 0\r\n for c in str(n):\r\n h = max(h, int(c))\r\n n -= h\r\n ans += 1\r\nprint(ans)", "# http://codeforces.com/problemset/problem/331/C1\n\ndef largest_digit(num):\n largest = 0\n for digit in str(num):\n if int(digit) > largest:\n largest = int(digit)\n return largest\n\ndef solve(num):\n i = 0\n while num > 0:\n i += 1\n num = num - largest_digit(num)\n return i\n\nnum = int(input())\nprint(solve(num))\n", "import math\r\n#q=int(input())\r\nq=1\r\nfor _ in range(q):\r\n n=int(input())\r\n ans=0\r\n while(n>0):\r\n ans+=1 \r\n k=n\r\n maxx=0\r\n while(k>0):\r\n x=k%10\r\n maxx=max(x,maxx)\r\n k//=10\r\n n-=maxx \r\n print(ans) \r\n \r\n \r\n \r\n ", "def main():\r\n n = int(input())\r\n ans = 0\r\n while n != 0:\r\n s = str(n)\r\n n -= int(max(s))\r\n ans += 1\r\n print(ans)\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n\r\n", "n = int(input())\n\noper = 0\nwhile n >= 10:\n\n n -= max(map(int, str(n)))\n oper += 1\n\nprint(oper + (1 if n != 0 else 0))", "ls = [0]*int(1e6)\r\nfor i in range(9):\r\n ls[i] = 1 \r\ndef get_max(num):\r\n tmp = '0'\r\n num_str = str(num)\r\n for char in num_str:\r\n if char > tmp: \r\n tmp = char\r\n return int(tmp)\r\ntmp = []\r\ndef solve(n,max_num):\r\n count = 0 \r\n while n > 0: \r\n n = n - max_num\r\n max_num = get_max(n)\r\n count += 1 \r\n print(count)\r\n\r\nn = int(input())\r\nmax_num = get_max(n)\r\nsolve(n,max_num) \r\n\r\n", "n = int(input())\r\ncnt = 0\r\nwhile n!=0:\r\n\ta = int(max(str(n)))\r\n\tn-=a\r\n\tcnt+=1\r\n\r\nprint(cnt)", "n = int(input())\nans = 0\nwhile n > 0:\n n -= max(map(int, str(n)))\n ans += 1\nprint(ans)\n", "def find_max(n):\r\n ret=0\r\n while n>0:\r\n ret=max(ret,n%10)\r\n n//=10\r\n return ret\r\nn=int(input())\r\nans=0\r\nwhile n>0:\r\n n-=find_max(n)\r\n ans+=1\r\nprint(ans)", "k = int(input())\r\n\r\nmini = []\r\nmini.append(0)\r\n\r\nfor i in range(k):\r\n p = i+1\r\n if(p < 10):\r\n mini.append(1)\r\n else:\r\n digits = [int(d) for d in str(p)]\r\n mini.append(1000000)\r\n for d in range(len(digits)):\r\n mini[p] = min(mini[p], 1+mini[p-digits[d]])\r\nprint(mini[k])", "#ROUNIAAUDI\r\ny=int(input())\r\nc=0\r\nwhile y!=0:\r\n y-=int(max(str(y)))\r\n c+=1\r\nprint(c)", "n,k=int(input()),0\r\nwhile n:n-=int(max(str(n)));k+=1\r\nprint(k)", "a = int(input())\r\nc = 0\r\n\r\nwhile a != 0:\r\n al = list(str(a))\r\n a = a - int(max(al))\r\n c += 1\r\n \r\nprint(c) ", "# n,m = map(lambda x: int(x), input().split())\r\n# n = int(input())\r\n\r\n\r\nn = int(input())\r\nc=0\r\nwhile n!=0:\r\n n-=int(max(list(str(n))))\r\n c+=1\r\n\r\nprint(c)\r\n\r\n\r\n\r\n\r\n", "a=input()\r\na=list(a)\r\ncount=0\r\nwhile int(''.join(a))>0:\r\n k=max(a)\r\n a=int(''.join(a))-int(k)\r\n a=str(a)\r\n count+=1\r\n a=list(a)\r\nprint(count)\r\n \r\n", "def largest(n):\r\n large = 0\r\n while n > 0:rem = n % 10;n = n // 10;large = max(large, rem)\r\n return large\r\nn, ans = int(input()), 0\r\nwhile n > 0:n = n - largest(n);ans = ans + 1\r\nprint(ans)", "def maxx(n):\r\n l=[]\r\n while(n>0):\r\n l.append(n%10)\r\n n = int(n/10)\r\n return max(l)\r\nn =int(input())\r\nj=0\r\nwhile(n>0):\r\n n = n- maxx(n)\r\n j+=1\r\nprint(j)", "n = int(input())\r\nstring = list()\r\nk = 0\r\nwhile n != 0:\r\n string = sorted(list(str(n)))\r\n n = n - int(string[-1])\r\n k = k + 1\r\nprint(k)\r\n", "linha = input()\r\nnum = int(linha)\r\n\r\ncont = 0\r\nwhile num > 0:\r\n max = 0\r\n for i in linha:\r\n if int(i) > max: max = int(i)\r\n num -= max\r\n linha = str(num)\r\n cont += 1\r\n\r\nprint(cont)\r\n", "n = int(input())\na = list(map(int, list(str(n))))\nr = 0\nwhile n != 0:\n x = max(a)\n n -= x\n a = list(map(int, list(str(n))))\n r += 1\nprint(r)\n \t \t\t \t \t \t\t\t \t \t \t\t", "def return_digits(n):\r\n digits = []\r\n while True:\r\n if n == 0:\r\n break\r\n digits.append(n % 10)\r\n n = n // 10\r\n return digits\r\n\r\n\r\nn = int(input())\r\ncount = 0\r\nwhile True:\r\n if n == 0:\r\n break\r\n\r\n n = n - max(return_digits(n))\r\n count = count + 1\r\n\r\nprint(count)\r\n", "\r\n\r\n# t = int(input())\r\nt = 1\r\nfor _ in range(t):\r\n # n, c = map(int, input().split())\r\n # n = int(input())\r\n # a = list(map(int, input().split()))\r\n # b = list(map(int, input().split()))\r\n s = int(input())\r\n # s = _\r\n\r\n # for i in range(10)\r\n cnt = 0\r\n while s > 0:\r\n s -= int(max(list(str(s))))\r\n cnt += 1\r\n print(cnt)\r\n # s -= max(list())\r\n", "n,k=int(input()),0\nwhile n:\n n = n-int(max(str(n)))\n k+=1\nprint(k)", "def solve(n):\r\n mem = [0] * (n + 1)\r\n mem[1:10] = [1] * 9\r\n for i in range(10, n + 1):\r\n digits = set([int(c) for c in str(i) if c != '0'])\r\n m = 1000000\r\n for d in digits:\r\n k = 1 + mem[i - d]\r\n if k < m:\r\n m = k\r\n mem[i] = m\r\n return mem[n]\r\n\r\n\r\nprint(solve(int(input())))\r\n", "def solve():\n n = int(input())\n d = [i for i in range(n + 1)]\n\n def c(n):\n if n == 0:\n return 0\n if n < 10:\n return 1\n\n if d[n] != n:\n return d[n]\n\n for k in set(str(n)):\n d[n] = min(d[n], 1 + d[n - int(k)])\n\n return d[n]\n\n for i in range(n + 1):\n d[i] = c(i)\n\n print(d[n])\n\n\nsolve()\n", "if __name__ == '__main__':\r\n string = input()\r\n n = len(string)\r\n qtdSubtracoes = 0\r\n\r\n while n > 1:\r\n # numero possui mais de 1 digito\r\n numerosDaString = [int(x) for x in string]\r\n numerosDaString.sort()\r\n maiorNumero = numerosDaString[-1]\r\n\r\n # print(f'número é {string}, subtraindo {maiorNumero}')\r\n\r\n valorAposSubtracao = int(string) - maiorNumero\r\n qtdSubtracoes += 1\r\n string = str(valorAposSubtracao)\r\n n = len(string)\r\n\r\n if string == '0' and qtdSubtracoes > 0:\r\n print(str(qtdSubtracoes))\r\n elif string == '0':\r\n print('0')\r\n else:\r\n print(str(qtdSubtracoes + 1))\r\n", "n = int(input())\r\nc = 0\r\n\r\nwhile n != 0:\r\n nlist = [int(x) for x in str(n)]\r\n n -= max(nlist)\r\n c += 1\r\nprint(c)", "\r\nn=int(input())\r\nk=0\r\n\r\nwhile n:\r\n n-=int(max(list(str(n))))\r\n k+=1\r\n\r\nprint(k)\r\n", "nlst = [int(x) for x in input()]\r\nn = 0\r\nwhile len(nlst) != 1 or nlst[0] != 0:\r\n nint = int(\"\".join([str(x) for x in nlst]))\r\n nint -= max(nlst)\r\n nlst = [int(x) for x in str(nint)]\r\n n += 1\r\nprint(n)", "\r\nn = int(input())\r\ndef getMaxDigit(i):\r\n s = str(i)\r\n x = int(s[0])\r\n for c in s:\r\n x = max(int(c),x)\r\n if(x == 9):\r\n return x\r\n return x\r\ncount = 0\r\nwhile(n != 0):\r\n n -= getMaxDigit(n)\r\n count += 1\r\nprint(count)", "n, ans = int(input()), 0\r\nwhile n:\r\n n -= (int(max(str(n))))\r\n ans += 1\r\nprint(ans)\r\n", "def get_max_digit(x):\r\n max_d = 0\r\n while x > 0:\r\n max_d = max(max_d, x % 10)\r\n x //= 10\r\n return max_d\r\n\r\nn = int(input())\r\ncnt = 0\r\nwhile n > 0:\r\n d = get_max_digit(n)\r\n n -= d\r\n cnt += 1\r\nprint(cnt)\r\n", "numero_str = input()\r\nnumero = int(numero_str)\r\ncontador = 0\r\n\r\nwhile numero > 0:\r\n numero -= int(max(numero_str))\r\n numero_str = str(numero)\r\n contador+=1\r\n\r\nprint(contador)", "n = input()\r\np = max(n)\r\nmaxx = int(n)\r\nk = 0\r\nwhile maxx > 0:\r\n\tp = int(p)\r\n\tmaxx -= p \r\n\tk += 1\r\n\tp = max(str(maxx))\r\nprint(k)\r\n\r\n\r\n\t\r\n\r\n\r\n\r\n\t\t\r\n\r\n\r\n\t\t\r\n\r\n\r\n\t\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\t\t\r\n\r\n\r\n\t\r\n\r\n\t\t\t\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\t\t \r\n \r\n\r\n\r\n\r\n\r\n\t\t\t\r\n\t\t\r\n\t\t\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "def find_max_digit(n):\r\n m = 0\r\n for i in range(len(n)):\r\n m = max(m, int(n[i]))\r\n return m\r\n\r\nn = int(input())\r\nans = 0\r\nwhile n>0:\r\n n-=find_max_digit(str(n))\r\n ans+=1\r\nprint(ans)", "n, k = int(input()), 0\r\n\r\nwhile n:\r\n n, k = n - int(max(str(n))), k + 1\r\n\r\nprint(k)", "from sys import stdin\r\ninput = stdin.readline\r\n\r\nn = int(input())\r\n\r\ndp = [0]\r\nfor i in range(1, n+1):\r\n s = str(i)\r\n best = float(\"inf\")\r\n for c in s:\r\n d = int(c)\r\n if d == 0:\r\n continue\r\n cur = dp[i - d] + 1\r\n best = min(cur, best)\r\n dp.append(best)\r\n \r\nprint(dp[n])", "n = int(input())\r\nv = list(str(n))\r\ncont = 0 #Contador de restas realizadas\r\nwhile n != 0:\r\n n = n - int(max(v))\r\n v = list(str(n))\r\n cont += 1\r\nprint(cont)", "n = int(input())\r\n\r\ncnt = 0\r\n\r\nwhile n != 0:\r\n n = n - max(list(map(int, list(str(n)))))\r\n cnt += 1\r\nprint(cnt)", "import math\r\nimport string\r\n\r\ndef max_digit(s):\r\n max_val = 0\r\n index_max_val = 0\r\n for i in range(len(s)):\r\n i = len(s) - i - 1\r\n if int(s[i]) > max_val:\r\n max_val = int(s[i])\r\n index_max_val = i\r\n return max_val, index_max_val\r\n\r\n\r\n\r\n\r\ndef main_function():\r\n n = input()\r\n counter = 0\r\n while n != \"0\":\r\n counter += 1\r\n n = str(int(n) - max_digit(n)[0])\r\n print(counter)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\nmain_function()", "n = int(input())\nresult = 0\nwhile(n > 0):\n largest_digit = int(max(list(str(n))))\n n -= largest_digit\n result += 1\n\nprint(result)", "n = int(input())\r\ncounter = 0\r\nsubtracao = int(n)\r\nwhile True:\r\n if subtracao == 0:\r\n print(counter)\r\n break\r\n subtracao -= int(max(str(n)))\r\n n = subtracao\r\n counter += 1 ", "num = int(input())\ncounter = 0\nwhile num != 0:\n num -= max([int(i) for i in str(num)])\n counter += 1\n\nprint(counter)", "n,k=int(input()),0\nwhile n:n-=int(max(str(n)));k+=1\nprint(k)", "\r\nimport math\r\nfrom math import gcd,floor,sqrt,log\r\ndef iin(): return int(input())\r\ndef sin(): return input().strip()\r\ndef listin(): return list(map(int,input().strip().split()))\r\ndef liststr(): return list(map(str,input().strip().split()))\r\ndef ceill(x): return int(x) if(x==int(x)) else int(x)+1\r\ndef ceilldiv(x,d): x//d if(x%d==0) else x//d+1\r\ndef LCM(a,b): return (a*b)//gcd(a,b)\r\n\r\n\r\nn = iin()\r\n\r\ncnt=0\r\nwhile n>0:\r\n n -= int(max(str(n)))\r\n cnt+=1\r\nprint(cnt)\r\n", "N = int(input())\r\ntable = [-1] * (N+1)\r\ntable[0] = 0\r\nfor i in range(1, min(N, 9)+1):\r\n table[i] = 1\r\nfor i in range(10, N+1):\r\n numbers = list(map(int, list(str(i))))\r\n # print(numbers)\r\n minimum = 999_999_999\r\n for number in numbers:\r\n if number == 0:\r\n continue\r\n minimum = min(table[i-number] + 1, minimum)\r\n table[i] = minimum\r\n# print(table)\r\nprint(table[N])", "n=int(input())\nk=0\nwhile n>0:\n n-=int(max(str(n)))\n k+=1\nprint(k)\n", "n=int(input())\r\ncnt=0\r\nwhile n>0:\r\n n-=(int(max(str(n))))\r\n cnt+=1\r\nprint(cnt)", "u=int(input(\"\"))\r\nif u==1000000:\r\n print(128207)\r\nelse:\r\n x=[0 for i in range(u+1)]\r\n for i in range(len(x)):\r\n if i==0:\r\n x[i]==0\r\n else:\r\n x[i]=x[int(i)-int(max(list(str(i))))]+1\r\n print(x[-1])", "def maior_algarismo(n):\r\n string_n = str(n)\r\n lista_algarismos = []\r\n for i in string_n:\r\n lista_algarismos.append(int(i))\r\n return max(lista_algarismos)\r\n\r\ndef menor_n_transformacoes(n,vetor,transformacoes):\r\n while True:\r\n n = vetor[transformacoes]\r\n if n == 0:\r\n return transformacoes\r\n else:\r\n n = n - maior_algarismo(n)\r\n transformacoes = transformacoes + 1\r\n vetor.append(n)\r\n\r\nn = int(input())\r\nvetor = [n]\r\ntransformacoes = 0\r\nprint(menor_n_transformacoes(n,vetor,transformacoes))\r\n", "n = int(input())\r\ncount = 0\r\nwhile n:\r\n maxi = 0\r\n nn = n\r\n while nn:\r\n maxi = max(maxi, nn%10)\r\n nn //= 10\r\n count += 1\r\n n -= maxi\r\nprint(count)", "n=int(input())\r\ntemp=[-1 for i in range(n)]\r\nc=0\r\nwhile n!=0:\r\n ns=list(str(n))\r\n m=max(ns)\r\n n=n-int(m)\r\n c+=1\r\nprint(c)\r\n \r\n ", "\ndef solve(n):\n M = [0]\n for k in range(1,n+1):\n M.append(1+min(M[k-d] for d in (int(x) for x in set(str(k))) if d>0))\n return M[-1]\n\nn = int(input())\nprint(solve(n))\n\n \n", "n = int(input())\r\nres = 0\r\nwhile n:\r\n res += 1\r\n n -= max([int(ch) for ch in str(n)])\r\nprint(res)", "n = int(input())\r\n\r\ndef isb(n):\r\n re = -1\r\n while n > 0:\r\n tmp = n % 10\r\n re = max(re,tmp)\r\n n//=10\r\n return re\r\n\r\nans = 0\r\n\r\nwhile n > 0 :\r\n n-=isb(n)\r\n ans+=1\r\nprint(ans)\r\n ", "n = int(input())\r\nans = 0\r\nwhile n>0:\r\n i = n\r\n s = 0\r\n while i>0:\r\n s = max(s,i%10)\r\n i=i//10\r\n ans+=1\r\n n-=s\r\n\r\nprint(ans)", "import math\r\nimport string\r\n\r\n\r\ndef calculator(n, max_val, table):\r\n if (n, max_val) in table:\r\n return table[(n, max_val)]\r\n counter = 0\r\n while n > 0:\r\n counter += 1\r\n n -= max(max([int(i) for i in list(str(n))]), max_val)\r\n return counter\r\n\r\n\r\n\r\n\r\n\r\n\r\ndef main_function():\r\n n = int(input())\r\n dp_table = {}\r\n if n <= 1000000:\r\n print(calculator(n, 0, dp_table))\r\n\r\n\r\n\r\n\r\n\r\n\r\nmain_function()", "n = int(input())\r\na = []\r\nu = \"\"\r\nr = 0\r\nc = 0\r\nwhile (n != 0): # parada\r\n c += 1 # Conteo (memoria)\r\n u = str(n) # Conversion a string\r\n a = list(map(int, u)) # Conversion a lista\r\n r = max(a) # mayor digito de n\r\n n = n - r # Reducción del entero\r\nprint(c)", "# -*- coding: utf-8 -*-\r\n\"\"\"331C1.ipynb\r\n\r\nAutomatically generated by Colaboratory.\r\n\r\nOriginal file is located at\r\n https://colab.research.google.com/drive/1Yx192ckTJSgud86ma91zypTA4V6SJ_kS\r\n\"\"\"\r\n\r\ndef digit(n):\r\n l=[]\r\n for i in n:\r\n l.append(int(i))\r\n return max(l)\r\n\r\nn=input()\r\nnn=int(n)\r\nd=digit(n)\r\ncont=0\r\nwhile nn!=0:\r\n n=str(nn-d)\r\n nn=int(n)\r\n d=digit(n)\r\n cont+=1\r\nprint(cont)\r\n\r\ncont", "t = int(input())\nc = 0\nwhile t!=0:\n c+=1\n t = t-int(max(str(t)))\nprint(c)\n", "from sys import stdin, stdout\r\nimport math,sys,heapq\r\nfrom itertools import permutations, combinations\r\nfrom collections import defaultdict,deque,OrderedDict\r\nfrom os import path\r\nimport random\r\nimport bisect as bi\r\ndef yes():print('YES')\r\ndef no():print('NO')\r\nif (path.exists('input.txt')): \r\n #------------------Sublime--------------------------------------#\r\n sys.stdin=open('input.txt','r');sys.stdout=open('output.txt','w');\r\n def I():return (int(input()))\r\n def In():return(map(int,input().split()))\r\nelse:\r\n #------------------PYPY FAst I/o--------------------------------#\r\n def I():return (int(stdin.readline()))\r\n def In():return(map(int,stdin.readline().split()))\r\n#sys.setrecursionlimit(1500)\r\ndef dict(a):\r\n d={} \r\n for x in a:\r\n if d.get(x,-1)!=-1:\r\n d[x]+=1\r\n else:\r\n d[x]=1\r\n return d\r\ndef find_gt(a, x):\r\n 'Find leftmost value greater than x'\r\n i = bi.bisect_right(a, x)\r\n if i != len(a):\r\n return i\r\n else: \r\n return len(a)\r\ndef cal(a,b,ans,d):\r\n if (a<1 or b<1) or (a<2 and b<2):\r\n return ans\r\n if d.get((a,b),-1)!=-1:\r\n return d[(a,b)]\r\n d[(a,b)]= max(cal(a+1,b-2,ans+1,d),cal(a-2,b+1,ans+1,d))\r\n return d[(a,b)]\r\ndef main():\r\n try:\r\n n=I()\r\n ans1=0\r\n while n>0:\r\n t=n\r\n ans=0\r\n while t>0:\r\n ans=max(t%10,ans)\r\n t//=10\r\n n-=ans\r\n ans1+=1\r\n print(ans1)\r\n except:\r\n pass\r\nM = 998244353\r\nP = 1000000007\r\n \r\nif __name__ == '__main__':\r\n #for _ in range(I()):main()\r\n for _ in range(1):main()", "n=int(input())\r\nl=[int(x) for x in str(n)]\r\nc=0\r\nwhile n!=0:\r\n n=n-max(l)\r\n l=[int(x) for x in str(n)]\r\n c=c+1\r\nprint(c)", "n = int(input())\r\nnum=0\r\nwhile True:\r\n x = list(map(int,str(n)))\r\n \r\n \r\n if n==0:\r\n \r\n break\r\n n-=max(x)\r\n num+=1\r\nprint(num)\r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Thu Sep 17 01:20:34 2020\r\n\r\n@author: Dark Soul\r\n\"\"\"\r\nn=int(input(''))\r\ndef maxdig(n):\r\n s=-1\r\n while n:\r\n s=max(s,n%10)\r\n n=n//10\r\n return s\r\nsol=0\r\nwhile n:\r\n sol+=1\r\n n-=maxdig(n)\r\nprint(sol)\r\n ", "def iterateList(startVal):\n numSteps = [startVal+1] * (startVal+1)\n numSteps[startVal] = 0\n\n for n in range(startVal, -1, -1):\n i = n\n while i:\n digit = i % 10\n numSteps[n-digit] = numSteps[n]+1 if numSteps[n]+1 < numSteps[n-digit] else numSteps[n-digit]\n i = i//10\n print(numSteps[0])\n\ndef greedy(startVal):\n n = startVal\n steps = 0\n while n != 0:\n maxDig = max(list(map(int, str(n))))\n n -= maxDig\n steps +=1\n print(steps)\n\nstartVal = int(input())\n# iterateList(startVal)\ngreedy(startVal)", "def getMaxDigit(n,c):\r\n\r\n while(n>0):\r\n t = n\r\n m = 0\r\n while(t):\r\n if(t%10 > m):\r\n m = t %10\r\n t = t // 10\r\n c+=1\r\n n= n-m\r\n return c\r\nn = int(input())\r\nprint(getMaxDigit(n,0))", "n = list(input())\r\ns = 0\r\nwhile(int(''.join(n))>0):\r\n k = int(max(n))\r\n n = int(''.join(n))\r\n n-=k\r\n n = [str(i) for i in str(n)]\r\n s+=1\r\nprint(s)\r\n", "m = int(input())\r\na = 0\r\nwhile(m > 0):\r\n m -= int(max([int(i) for i in str(m)]))\r\n a += 1\r\nprint(a)\r\n", "# author: violist\n# created: 02.09.2021 15:33:14\n\nimport sys\ninput = sys.stdin.readline\n\n# I know that it won't pass because it's O(n)\ns = input()[:-1]\nn = int(s)\ns = list(s)\nans = 0\nwhile (n != 0):\n n -= int(max(s))\n s = str(n)\n ans += 1\nprint(ans)\n", "n = int(input())\n\ncount = 0\nwhile n != 0:\n n_max = max(set(str(n)))\n n = n - int(n_max)\n count = count + 1\n\nprint(count)\n", "n,k = int(input()),0\r\nwhile n > 0:\r\n n -= int(max(str(n)))\r\n k += 1\r\nprint(k)", "n = int(input())\r\ns = 0 \r\nwhile n != 0:\r\n n -= max([int(c) for c in str(n)])\r\n s += 1\r\nprint(s)", "n,k=int(input()),0\r\nwhile n:n-=int(max(list(str(n))));k+=1\r\nprint(k)", "def main():\r\n cur = int(input())\r\n\r\n ans = 0\r\n while cur > 0:\r\n ans += 1\r\n m = max(int(c) for c in str(cur))\r\n cur -= m\r\n\r\n print(ans)\r\n \r\n \r\nif __name__ == '__main__':\r\n main()\r\n", "n=input()\np=0\nwhile(int(n)!=0):\n if(len(n)==1):\n p+=1\n break\n l=[int(i) for i in n]\n n=str(int(n)-max(l))\n p+=1\nprint(p)", "n=input()\r\nl=[]\r\nfor i in n:\r\n l.append(int(i))\r\ncount=0\r\nwhile True:\r\n l=[]\r\n for i in n:\r\n l.append(int(i))\r\n if int(n)==0:\r\n break\r\n else:\r\n n=str(int(n)-max(l))\r\n count+=1\r\nprint(count)\r\n", "def julya_calendar(num):\t\n lista_aux = [10000000] * (num + 1)\n lista_aux[0] = 0\n for i in range(num + 1):\n for c in str(i):\n lista_aux[i] = min(lista_aux[i],lista_aux[i - (ord(c) - 48)] + 1)\n return lista_aux[num]\n\nnum = int(input())\nprint(julya_calendar(num))", "num = int(input())\r\ncount = 0\r\nwhile num > 0:\r\n num -= int(max(list(str(num))))\r\n count += 1\r\nprint(count)", "n = input()\r\n\r\n\r\nans = 0\r\n\r\nwhile int(n) != 0:\r\n sp = list(map(int, (list(str(n)))))\r\n n = int(n) - max(sp)\r\n #print(n)\r\n ans += 1\r\n\r\nprint(ans)\r\n\r\n\r\n", "def encontra_maior_digito(n):\r\n maior = 0\r\n for digito in n:\r\n if int(digito) > maior:\r\n maior = int(digito)\r\n\r\n # se o digito for igual a 9, então ele é o maior\r\n if int(digito) == 9:\r\n break\r\n\r\n return maior\r\n\r\ndef great_julya_calendar(n):\r\n # uma solução de passos mínimos pode ser obtida escolhendo sempre o maior digito do atual magic number\r\n passos = 0\r\n while n != '0':\r\n maior = encontra_maior_digito(n)\r\n n = str(int(n) - maior)\r\n passos += 1\r\n\r\n print(passos)\r\n\r\nn = input()\r\n\r\ngreat_julya_calendar(n)", "a = input()\nc = 0\nwhile True:\n\tif a == '0':break\n\tb = 0\n\tfor x in a:\n\t\tif int(x) > b:\n\t\t\tb = int(x)\n\ta = str(int(a) - b)\n\tc += 1\nprint(c)", "n= input()\r\ncount=0\r\nl= list(map(int,n))\r\nwhile int(n)>0:\r\n l= list(map(int,n))\r\n m= max(l)\r\n n= int(n)-m\r\n count+=1\r\n n= str(n)\r\nprint(count)\r\n ", "n = int(input())\r\n\r\ndef maxDigit(a):\r\n x = 9\r\n while x > 0:\r\n if str(x) in str(a):\r\n return x\r\n else:\r\n x -= 1\r\n return 0\r\n\r\nmemo = 0\r\nwhile n != 0:\r\n n = n - maxDigit(n)\r\n memo += 1\r\n\r\nprint(memo)", "n=int(input())\ns=str(n)\nc=0\nwhile(int(s)!=0):\n d=max(s)\n s=str(int(s)-int(d))\n c+=1\nprint(c)\n \t \t \t \t \t \t\t\t\t \t\t\t \t\t \t \t", "n = int(input())\r\nans = 0\r\nwhile n!= 0:\r\n m = max([int(i) for i in str(n)])\r\n n = n-m\r\n ans+=1\r\nprint(ans)", "n = int(input())\n\ndp = [float('inf')] * (n+1)\ndp[0] = 0\nfor i in range(1, n+1):\n c = i \n while c > 0:\n if c % 10 != 0:\n dp[i] = min(dp[i], 1 + dp[i - (c % 10)])\n c //= 10\nprint(dp[n])\n", "n=int(input())\r\ncount=0\r\nwhile(n!=0):\r\n n-=int(max((list(str(n)))))\r\n count+=1\r\nprint(count)\r\n", "n = int(input())\r\nc = 0\r\nwhile n > 0:\r\n m = max(list(str(n)))\r\n n -= int(m)\r\n c += 1\r\n\r\nprint(c)", "a=int(input())\r\ni=0\r\nwhile a!=0:\r\n\ti+=1\r\n\tx=max(list(map(int,list(str(a)))))\r\n\ta-=x\r\nprint(i)", "import functools\r\n\r\nMaxn=10000005\r\n\r\[email protected]_cache(10000)\r\ndef dp(x, y):\r\n\tnow = (x,y)\r\n\t\r\n\tif (x<10):\r\n\t\t# return (x || y, x-max(x,y))\r\n # print(f'x={x} y={y}')\r\n first = 1 if x or y else 0\r\n return (first, x-max(x,y))\r\n \r\n\tmod=1\r\n\twhile(mod<=x//10):\r\n\t\tmod*=10\r\n\t\r\n\tmaxDig=x//mod\r\n\t\r\n\tpart1=dp(x%mod, max(maxDig,y))\r\n\tpart2=dp(x-x%mod+part1[1], y)\r\n\treturn (part1[0]+part2[0], part2[1])\r\n\r\n \r\ndef solve():\r\n\tn = int(input())\r\n\tAns=dp(n,0)[0]\r\n\tprint(Ans)\r\n \r\nsolve()\r\n", "def dsolve(m):\r\n\r\n memo = {0: 0}\r\n\r\n def solve(k):\r\n l = len(str(k))\r\n if k in memo.keys():\r\n return memo[k]\r\n elif len(str(k)) == 1:\r\n memo[k] = 1\r\n return 1\r\n else:\r\n p = 1 + min([solve(k - int(c)) for c in str(k) if int(c)])\r\n memo[k] = p\r\n return p\r\n\r\n for i in range(m + 1):\r\n solve(i)\r\n\r\n return memo[m]\r\n\r\n\r\nn = int(input())\r\nprint(dsolve(n))\r\n\r\n", "s=list(input())\r\ncnt=0\r\nif len(s)==1 and int(s[0])==0:\r\n\tprint(0)\r\nelse:\r\n\twhile (True):\r\n\t\tk = sorted(s)\r\n\t\tmaxx = int(k[-1])\r\n\t\ts = list(str(int(''.join(s)) - maxx))\r\n\t\tcnt += 1\r\n\t\tif len(s) == 1 and int(s[0]) <= 0:\r\n\t\t\tbreak\r\n\tprint(cnt)", "n,c=int(input()),0\r\nwhile n:n-=int((max(str(n))));c+=1\r\nprint(c)", "n=int(input())\r\nk=0\r\n \r\nwhile n:\r\n n-=max(map(int,str(n)))\r\n k+=1\r\n \r\nprint(k)", "import sys\r\nfrom math import sqrt,log,ceil,gcd\r\n# sys.stdin=open('input.txt','r')\r\n# sys.stdout=open('output.txt','w')\r\nfrom random import randint as rd\r\n\r\nfun=lambda: map(int,input().split())\r\n\r\nn=int(input())\r\nans=0\r\nwhile n>0:\r\n n-=int(max(str(n)))\r\n ans+=1\r\nprint(ans)", "n, count = int(input()), 0\r\nwhile n > 0:\r\n\tnList = [int(i) for i in str(n)]\r\n\tn -= max(nList)\r\n\tcount += 1\r\n\r\nprint(count)\r\n", "n = int(input())\n\ncount = 0\nwhile n:\n\tn -= max(list(map(int,str(n))))\n\tcount += 1\n\nprint(count)", "n = int(input())\r\nc = 0\r\nwhile n:\r\n t = list(map(int, list(str(n))))\r\n #print(max(t), n)\r\n n -= max(t)\r\n c += 1\r\nprint(c)\r\n", "i = input()\nx = int(i)\ncont = 0\nwhile x:\n x -= int(max(i))\n i = str(x)\n cont += 1\nprint(cont)\n", "n = int(input())\r\ns = list(map(int , list(str(n))))\r\nc = 0\r\nwhile(n > 0):\r\n\tn -= max(s)\r\n\ts = list(map(int , list(str(n))))\r\n\tc += 1\r\nprint(c) \r\n\r\n", "n = str(input())\r\nsteps = 0\r\nwhile int(n) != 0:\r\n\ttemp = 0\r\n\tfor i in n:\r\n\t\ttemp = int(max(int(i), temp))\r\n\tn = str(int(n) - temp)\r\n\tsteps += 1\r\nprint(steps)", "start = input()\r\ncounter = 0\r\nsInt = int(start)\r\nwhile sInt!=0:\r\n\tsInt-=max([int(c) for c in start])\r\n\tstart=str(sInt)\r\n\tcounter+=1\r\nprint(counter)", "a=int(input())\r\nb=a\r\ncountt=0\r\nwhile(b>0):\r\n\tl=[]\r\n\tcountt+=1\r\n\twhile(a>0):\r\n\t\tl.append(a%10)\r\n\t\ta=a//10\r\n\tl=sorted(l)\r\n\tb=b-l[-1]\r\n\ta=b\r\nprint(countt)", "n = int(input())\r\nsumm = 0\r\nwhile n != 0:\r\n a = str(n)\r\n b = list(a)\r\n k = max(b)\r\n n -= int(k)\r\n summ += 1\r\nprint(summ)", "n=int(input())\r\ncnt=0\r\nwhile n!=0:\r\n x=n\r\n n=list(str(n))\r\n x=x-int(max(n))\r\n n=x\r\n cnt+=1\r\nprint(cnt)", "n=int(input())\r\nk=0\r\nwhile n:\r\n n-=max(map(int,str(n)))\r\n k+=1\r\nprint(k)", "n = int(input())\r\n\r\nsteps = 0\r\nwhile n:\r\n n -= int(max(str(n)))\r\n steps+=1\r\n\r\nprint(steps)\r\n \r\n", "def maxd(a):\r\n maxv=0\r\n while(a):\r\n d=a%10\r\n maxv=max(maxv,d)\r\n a=a//10\r\n return maxv\r\n\r\nn=int(input())\r\ni=0\r\n# d=[9,8,7,6,5,4,3,2,1,0]\r\nwhile n:\r\n md=maxd(n)\r\n n-=md\r\n i+=1\r\nprint(i)", "import sys\r\n# from bisect import bisect_right\r\ninput = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\r\nn = int(input())\r\n\r\nx = 0\r\nwhile n > 0:\r\n n -= max([int(i) for i in list(str(n))])\r\n x += 1 \r\n \r\nprint(x)\r\n\r\n", "# aadiupadhyay\r\nimport os.path\r\nfrom math import gcd, floor, ceil\r\nfrom collections import *\r\nfrom bisect 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\ndef solve():\r\n ans = 0\r\n n = inp()\r\n while n:\r\n n -= max(list(map(int, str(n))))\r\n ans += 1\r\n pr(ans)\r\n\r\n\r\nfor _ in range(1):\r\n solve()\r\n", "n=int(input())\r\ndp=[0]+[1e9+7]*(n)\r\nfor i in range(1,n+1):\r\n\ttmp=i\r\n\twhile tmp:\r\n\t\tdp[i]=min(dp[i],dp[i-tmp%10]+1)\r\n\t\ttmp//=10\r\nprint(int(dp[n]))", "import sys\r\nfrom math import *\r\ninput = sys.stdin.readline\r\nfor ii in range(1):\r\n n=int(input())\r\n dp=[0]*(n+1) \r\n for i in range(1,n+1):\r\n y=list(map(int,str(i).rstrip()))\r\n dp[i]= dp[(i-max(y))]+1\r\n print(dp[n])\r\n \r\n", "import math\r\nimport sys\r\n\r\ndef solve(n):\r\n counter = 0\r\n while n!=0:\r\n num = str(n)\r\n num = set(num)\r\n max_digit = 0\r\n for x in num:\r\n if int(x) > max_digit:\r\n max_digit = int(x)\r\n n -= max_digit\r\n counter += 1\r\n return counter\r\n \r\ndef s():\r\n n = int(input())\r\n print(solve(n))\r\n\r\ns()\r\n", "MAX = 1e9 + 7\n\n\ndef solve(n):\n ans = 0\n \n while n > 0:\n ans += 1\n \n d = max([int(i) for i in str(n)])\n n -= d\n \n return ans\n\n\nif __name__ == '__main__':\n\n n = input()\n print(solve(int(n)))\n \t\t\t\t \t \t \t \t\t \t \t\t\t \t", "n,k=int(input()),0\r\nwhile n:\r\n n-=int(max(str(n)))\r\n k+=1\r\nprint(k)", "import sys\r\nfin = sys.stdin\r\n\r\nn = int(fin.readline())\r\n\r\ncount = 0\r\nwhile n > 0:\r\n count += 1\r\n n -= max(map(int, str(n)))\r\n \r\nprint(count)", "dic={}\r\nfor i in range(10):\r\n dic[i]=0\r\n \r\nn=int(input())\r\nans=0\r\nwhile(n>0):\r\n ste=list(set(str(n)))\r\n ste=map(int,ste)\r\n n=n-max(ste)\r\n ans+=1\r\nprint(ans)\r\n", "n = int(input())\r\n\r\ndef naive(n):\r\n\tc=0\r\n\t#print(n,end='\\t')\r\n\twhile n!=0:\r\n\t\tc+=1\r\n\t\tn-=max([int(x) for x in list(str(n))])\r\n\t\t#print(n)\r\n\tprint(c)\r\n\r\n# d=dict()\r\n# d[0]=0\r\n# def dp(n):\r\n# \tif(n==0):\r\n# \t\treturn 0\r\n# \ts=[int(x) for x in list(str(n))]\r\n# \tminimo=n\r\n# \ts=max(s)\r\n# \ttemp = n - s\r\n# \treturn dp(temp)+1\r\n\r\n# for x in range(1,10,1):\r\n# \tnaive(x)\r\n# for x in range(10,100,10):\r\n# \tnaive(x)\r\n# for x in range(100,1000,100):\r\n# \tnaive(x)\r\n# for x in range(1000,10000,1000):\r\n# \tnaive(x)\r\n# for x in range(5000,6000,100):\r\n# \tnaive(x)\r\n\r\nnaive(n)", "n = int(input())\r\nres = 0\r\nwhile n > 0:\r\n tmp = int(max(str(n)))\r\n n -= tmp\r\n res += 1\r\nprint(res)", "n = int(input())\n\ntot = 0\nwhile (n != 0):\n max_int = 0\n for i in str(n):\n if (int(i) > max_int):\n max_int = int(i)\n n -= max_int\n tot += 1\n\nprint (tot) \n\n", "import math\nimport sys\nfrom collections import defaultdict\nimport heapq\nfrom collections import deque\n#input = sys.stdin.readline\nUSE_FILE = False \n\ndef search(k, v):\n p = 0\n a, n = len(v), len(v)\n while a >= 1:\n while p + a < n and k > v[p+a]:\n p += a\n a //= 2\n if k > v[p+a]:\n p += 1\n return p+1\n\nglobal maxi\nmaxi = -999999999999999 \n\ndef rec(v):\n global maxi\n maxi = max(maxi, sum(v))\n if len(v) <= 4:\n return \n odds = [x for i, x in enumerate(v) if i % 2 == 1]\n evens = [x for i, x in enumerate(v) if i % 2 == 0]\n rec(odds)\n rec(evens)\n\ndef main():\n n = int(input())\n op = 0\n while n != 0:\n biggest_digit = max([int(i) for i in str(n)])\n n -= biggest_digit\n op += 1\n print(op)\n\n\n\n\n\nif __name__==\"__main__\":\n if USE_FILE:\n sys.stdin = open('/home/stefan/input.txt', 'r')\n main()\n", "t = 0\r\nn = int(input())\r\ndef csmax(x):\r\n ans = 0\r\n while x > 0:\r\n a = x % 10\r\n ans = max(ans,a)\r\n x -= a\r\n x /= 10\r\n return ans\r\nwhile n > 0:\r\n t += 1\r\n n -= csmax(n)\r\nprint(t)", "n = int(input())\r\nans = 0\r\nwhile n:\r\n maxd = 0\r\n tmp = n\r\n while tmp:\r\n maxd = max(maxd, tmp % 10)\r\n tmp //= 10\r\n \r\n n -= maxd\r\n ans += 1\r\n \r\nprint(ans)", "n = int(input())\nk = 0\nwhile n > 0:\n n -= int(max(str(n)))\n k += 1\nprint(k)", "n=str(input())\na=[]\nfor i in range(len(n)):\n a.append(int(n[i]))\nb,c=int(n),0\nwhile(b!=0):\n b-=max(a)\n a=[]\n v=str(b)\n for i in range(len(v)):\n a.append(int(v[i]))\n c+=1\nprint(c)\n\n\n\n \t \t\t\t\t \t\t \t\t \t\t\t\t\t\t \t\t\t", "def largest_digit_in_number(n):\r\n return max(int(digit) for digit in str(n))\r\n\r\nmagic_number = int(input())\r\ntasks = 0\r\nwhile magic_number != 0:\r\n magic_number = magic_number - largest_digit_in_number(magic_number)\r\n tasks += 1\r\n\r\nprint(tasks)" ]

[ "import math\r\nimport copy\r\nimport itertools\r\nimport bisect\r\nimport sys\r\n\r\ninput = sys.stdin.readline\r\n\r\ndef ilst():\r\n return list(map(int,input().split()))\r\n \r\ndef islst():\r\n return list(map(str,input().split()))\r\n \r\ndef inum():\r\n return map(int,input().split())\r\n \r\n\r\nn, pos = input()[:-1], -1\r\n \r\nfor i in range(len(n) - 1):\r\n if n[i] in '02468':\r\n pos = i\r\n if n[i] < n[-1]:\r\n break\r\n \r\nprint(-1 if pos < 0 else n[:pos] + n[-1] + n[pos+1:-1] + n[pos])", "from collections import defaultdict, deque\nfrom functools import lru_cache\nfrom heapq import heappush, heappop\nfrom typing import Counter\nfrom bisect import bisect_right, bisect_left\nimport math\nhpop = heappop\nhpush = heappush\n\ndef solution():\n num = list(input())\n # to days is odd\n # so change the last one with even number\n \n # can't be equal\n # if am less than than definitly pass\n\n # if no I better be the last one\n # for that start from the back\n\n # if no all make it the negative one\n for i in range(len(num)-1):\n if int(num[i]) % 2 == 0 and num[i] < num[-1]:\n num[i],num[-1] = num[-1],num[i]\n return print(\"\".join(num))\n\n for i in range(len(num)-1)[::-1]:\n if int(num[i]) % 2 == 0:\n num[i],num[-1] = num[-1],num[i]\n return print(\"\".join(num))\n print(-1)\n\n\n\n\n\n\n\n \n\n \n \n \n \ndef main():\n t = 1\n #t = int(input())\n for _ in range(t):\n solution()\n \n#import sys\n#import threading\n#sys.setrecursionlimit(1 << 30)\n#threading.stack_size(1 << 27)\n#thread = threading.Thread(target=main)\n#thread.start(); thread.join()\nmain()\n\n\n\n\n\"\"\"\n num = int(input())\n arr = list(map(int, input().split()))\n a,b = map(int, input().split())\n graph = defaultdict(list)\n for i in range(#)\n graph[a].append(b)\n graph[b].append(a)\n MOD = 10**9 + 7\n\nfor di,dj in [(0,1),(1,0),(0,-1),(-1,0)]:\n ni = i + di\n nj = j + dj\n if not (0<= ni < len(grid) and 0<= nj < len(grid[0])):\n continue\n\ndef gcd(a,b):\n if a < b: a,b = b,a\n if b == 0: return a\n return gcd(a%b,b)\n\"\"\"\n", "def solve(arr):\n\tmn=-1\n\tfor i in range(len(arr)) :\n\t\tif int(arr[i])%2==0 :\n\t\t\tmn=i\n\t\t\tif int(arr[i]) < int(arr[-1]) :\n\t\t\t\treturn arr[:i] + arr[-1] + arr[i+1:-1] + arr[i]\n\n\tif mn==-1 :\n\t\treturn -1\n\t\t\t\n\t\n\n\treturn arr[:mn] + arr[-1] + arr[mn+1:-1] + arr[mn]\n\t\n\n\n\n\n\t\n\n\t\n\n \n \n \nfrom sys import stdin\ninput = stdin.readline\n\nn=input().strip()\n\n\n\nprint(solve(n))", "\r\n\r\nlst=list(map(int,list(input())))\r\nf=0\r\nc=0\r\n \r\n \r\nfor i in range(len(lst)):\r\n if (lst[i]%2==0):\r\n f=1\r\n break\r\nif(f==0):\r\n print(-1)\r\nelse:\r\n \r\n for i in range(len(lst)):\r\n if(lst[i]%2==0):\r\n if(lst[i]<lst[len(lst)-1]):\r\n temp=lst[len(lst)-1]\r\n lst[len(lst)-1]=lst[i]\r\n lst[i]=temp\r\n c=1\r\n break\r\n \r\n if(c==0):\r\n for i in range(len(lst)-1,-1,-1):\r\n if(lst[i]%2==0):\r\n temp=lst[len(lst)-1]\r\n lst[len(lst)-1]=lst[i]\r\n lst[i]=temp \r\n break\r\n \r\n print(''.join(map(str,lst)))\r\n\r\n\r\n \r\n\r\n \r\n \r\n \r\n", "\r\nn=input()\r\ncount=0\r\nl=list(n)\r\nfor i in n:\r\n if int(i)%2==0:\r\n count=count+1\r\ncount2=0\r\nfor i in range(len(n)):\r\n if int(l[i])%2==0:\r\n if int(l[i])<int(l[-1]):\r\n l[i],l[-1]=l[-1],l[i]\r\n break\r\n else:\r\n count2=count2+1\r\n if count2==count:\r\n l[i], l[-1] = l[-1], l[i]\r\nx=\"\".join(l)\r\nif x==n:\r\n print(-1)\r\nelse:\r\n print(x)", "lst = list(input())\nlast = -1\ntar = lst[-1]\np = True\neven = {\"2\", \"4\", \"6\", \"8\",\"0\"}\n\nfor i in range(len(lst)):\n if lst[i] in even:\n last = i\n if lst[i] < tar:\n temp = lst[i]\n lst[i] = lst[-1]\n lst[-1] = temp\n print(\"\".join(lst))\n p = False\n break\n \nif p:\n if last == -1:\n print(-1)\n else:\n temp = lst[last]\n lst[last] = lst[-1]\n lst[-1] = temp\n print(\"\".join(lst))\n", "n, pos = input(), -1\r\n\r\nfor i in range(len(n) - 1):\r\n if n[i] in '02468':\r\n pos = i\r\n if n[i] < n[-1]:\r\n break\r\n\r\nprint(-1 if pos < 0 else n[:pos] + n[-1] + n[pos+1:-1] + n[pos])", "n = [int(x) for x in input().strip()]\n\nbest = -1\nfor i in range(len(n)-1):\n if n[i] % 2 == 0:\n best = i\n \n if n[i] < n[-1]:\n break\n\nif best == -1:\n print(-1)\n \nelse:\n n[best], n[-1] = n[-1], n[best]\n\n print(\"\".join([str(x) for x in n]))\n\t \t \t\t\t\t \t \t \t \t\t\t\t\t \t \t\t\t", "# import sys\r\n# input=sys.stdin.readline\r\nimport math\r\n\r\n# for j in range(int(input())):\r\nl=[int(i) for i in input()]\r\n\r\nflag=False\r\nfor i in range(len(l)-2,-1,-1):\r\n if l[i]%2==0:\r\n if not flag:\r\n k=i\r\n flag=True\r\n if(l[-1]>l[i]):\r\n k=i\r\nif(not flag):\r\n print(-1)\r\nelse:\r\n l[k],l[-1]=l[-1],l[k]\r\n for i in l:\r\n print(i,end=\"\")\r\n print()\r\n\r\n \r\n \r\n\r\n \r\n\r\n\r\n \r\n \r\n", "n=list(map(int,input()))\r\nlast=n[-1]\r\nlastIndex=-1\r\nfor i in range(len(n)-1):\r\n if n[i]%2==0:\r\n if n[i]<last: \r\n n[-1],n[i]=n[i],n[-1]\r\n lastIndex=\"Found\"\r\n break\r\n else:\r\n lastIndex=i\r\nif lastIndex==\"Found\":print(\"\".join(map(str,n)))\r\nelif lastIndex != -1 :\r\n n[lastIndex],n[-1]=n[-1],n[lastIndex]\r\n print(\"\".join(map(str,n)))\r\nelse: print(-1)\r\n\r\n", "import sys, collections, bisect, heapq, functools, itertools, math\r\ninput = sys.stdin.readline\r\n\r\ns = list(input().strip())\r\n\r\neven = [[int(x), i] for i, x in enumerate(s) if ~int(x)&1]\r\nif not even:\r\n print(-1)\r\nelse:\r\n for x, i in even:\r\n if int(s[-1]) > x:\r\n s[i], s[-1] = s[-1], s[i]\r\n print(''.join(s))\r\n quit()\r\n s[even[-1][1]], s[-1] = s[-1], s[even[-1][1]]\r\n print(''.join(s))", "n=str(input())\r\na,b=-1,int(n[-1])\r\nfor x,y in enumerate(n):\r\n if int(y)%2==0:\r\n a=x\r\n if int(y)<b:\r\n break\r\nif a==-1:\r\n print(-1)\r\nelse:\r\n print(n[:a]+n[-1]+n[a+1:-1]+n[a])", "n=input()\r\na=[int(x) for x in n]\r\nm=-1\r\nfor i in range(len(a)):\r\n if(a[i]%2==0):\r\n m=i\r\nif(m==-1):\r\n print(-1)\r\nelse:\r\n for i in range(len(a)):\r\n if(i==m or(a[i]%2==0 and a[i]<a[len(a)-1])):\r\n for j in range(i):\r\n print(a[j],end=\"\")\r\n print(a[len(a)-1],end=\"\")\r\n for j in range(i+1,len(a)-1):\r\n print(a[j],end=\"\")\r\n print(a[i])\r\n break\r\n \r\n ", "n=int(input())\r\ns=str(n)\r\nli=[]\r\nfor i in range(len(s)-1):\r\n if(int(s[i])%2==0):\r\n li.append(i)\r\nif(len(li)==0):\r\n print(-1)\r\n quit()\r\nk=int(s[len(s)-1]) \r\n# print(li,k)\r\nfor i in li:\r\n if(int(s[i])<k or len(li)==1 or i==li[len(li)-1]):\r\n t=s[:i]+str(k)+s[i+1:len(s)-1]+s[i]\r\n break\r\nprint(int(t))", "def solve():\r\n a = list(input())\r\n ans = -1\r\n f = []\r\n for i in range(len(a)-1):\r\n if int(a[i]) % 2 == 0:\r\n f.append(i)\r\n if len(f) == 0:\r\n return -1\r\n for i in f:\r\n if a[i] < a[-1]:\r\n a[i],a[-1] = a[-1],a[i]\r\n return ''.join(a)\r\n a[f[-1]],a[-1] = a[-1],a[f[-1]]\r\n return ''.join(a)\r\nprint(solve())", "import time\r\n\r\n\r\nimport io, os, sys\r\n\r\n# input = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n# s = input().decode()\r\n\r\ns = input()\r\nn = list(s)\r\n\r\ne_idx = []\r\n\r\ne_s = set(['0', '2', '4', '6', '8'])\r\nfor i in range(len(n)):\r\n if n[i] in e_s:\r\n e_idx.append(i)\r\n\r\nel = len(e_idx)\r\nif el==0:\r\n print(-1)\r\nelse:\r\n for idx, i in enumerate(e_idx):\r\n if n[i]<n[-1]:\r\n n[i], n[-1] = n[-1], n[i]\r\n sys.stdout.write(\"\".join(n))\r\n # print()\r\n # print(int(''.join(n)))\r\n break\r\n if idx==el-1:\r\n n[i], n[-1] = n[-1], n[i]\r\n # print(int(''.join(n)))\r\n sys.stdout.write(\"\".join(n))\r\n # print()\r\n \r\n\r\n", "s=input()\r\ns=list(s)\r\nn=len(s);ind=-1\r\nfor i in reversed(range(0,n)):\r\n a=int(s[i])\r\n # print(a)\r\n if a%2==0:\r\n ind=i\r\n break\r\nif ind==-1:\r\n print(\"-1\")\r\nelse:\r\n ans=\"\"\r\n f=0\r\n for i in range(0,n-1):\r\n a=int(s[i])\r\n if a%2==1:\r\n continue\r\n else:\r\n if s[i]<s[n-1]:\r\n temp=s[n-1]\r\n s[n-1]=s[i]\r\n s[i]=temp\r\n f=1\r\n break\r\n if f==0:\r\n temp=s[ind]\r\n s[ind]=s[n-1]\r\n s[n-1]=temp\r\n for i in range(0,n):\r\n print(s[i],end=\"\")\r\n\r\n\r\n# s=input()\r\n# c=list(s)\r\n# c[2]='s'\r\n# print(c)\r\n", "num = input()\r\nn = len(num)\r\nans = -1\r\nfor i in range(n):\r\n\r\n if not int(num[i]) % 2:\r\n if int(num[i]) < int(num[-1]):\r\n ans = i\r\n break\r\n else:\r\n ans = max(i, ans)\r\nif ans == -1:\r\n print(-1)\r\nelse:\r\n print(num[:ans] + num[-1] + num[ans+1:n-1] + num[ans] if ans+1 <= n - 2\r\n else num[:ans] + num[-1] + num[ans])\r\n", "import os\r\nimport sys\r\nimport math\r\nfrom io import BytesIO, IOBase\r\n\r\ndef binaryexponent(a,n):\r\n if n==1:\r\n return a\r\n if n%2==0:\r\n return binaryexponent(a,n//2)*binaryexponent(a,n//2)\r\n else:\r\n return a*binaryexponent(a,(n-1)//2)*binaryexponent(a,(n-1)//2)\r\ndef binaryexpMatrix(L,n):\r\n if n==0:\r\n return [[0]*len(n) for z in range(n)]\r\n if n==1:\r\n return L\r\n if n%2==0:\r\n return MatMul(binaryexpMatrix(L,n//2),binaryexpMatrix(L,n//2))\r\n else:\r\n return MatMul(L,MatMul(binaryexpMatrix(L,(n-1)//2),binaryexpMatrix(L,(n-1)//2)))\r\ndef MatMul(A,B):\r\n L=[[0]*len(B[0]) for z in range(len(A))]\r\n for i in range(len(A)):\r\n \r\n for j in range(len(B[0])):\r\n \r\n for k in range(len(B)):\r\n L[i][j]+=A[i][k]*B[k][j]\r\n return L\r\n\r\ndef Fibnterm(n):\r\n res=MatMul([[1,1]],binaryexpMatrix([[1,1],[1,2]],(n-1)//2))\r\n return(res[0][(n+1)%2])\r\n \r\n\r\ndef getsum(BITTree,i):\r\n\ts = 0 \r\n\r\n\ti = i+1\r\n\r\n\r\n\twhile i > 0:\r\n\r\n\t\ts += BITTree[i]\r\n\r\n\t\ti -= i & (-i)\r\n\treturn s\r\n\r\n\r\ndef updatebit(BITTree , n , i ,v):\r\n\r\n\ti += 1\r\n\r\n\twhile i <= n:\r\n\r\n\t\tBITTree[i] += v\r\n\r\n\t\ti += i & (-i)\r\n\r\ndef construct(arr, n):\r\n\r\n\tBITTree = [0]*(n+1)\r\n\r\n\tfor i in range(n):\r\n\t\tupdatebit(BITTree, n, i, arr[i])\r\n\r\n\treturn BITTree\r\n\r\n\r\n\r\n\r\ndef binary_search(arr, low, high, x):\r\n if x>arr[-1]:\r\n return 10**9\r\n\r\n if high >= low:\r\n \r\n mid = (high + low) // 2\r\n\r\n if arr[mid] == x:\r\n return arr[mid]\r\n \r\n elif arr[mid] > x:\r\n return binary_search(arr, low, mid - 1, x)\r\n \r\n\r\n else:\r\n return binary_search(arr, mid + 1, high, x)\r\n \r\n else:\r\n\r\n return arr[low]\r\ndef binary_search2(arr, low, high, x):\r\n if x<arr[0]:\r\n return -1\r\n\r\n if high >= low:\r\n \r\n mid = (high + low) // 2\r\n\r\n if arr[mid] == x:\r\n return arr[mid]\r\n \r\n elif arr[mid] > x:\r\n return binary_search2(arr, low, mid - 1, x)\r\n \r\n\r\n else:\r\n return binary_search2(arr, mid + 1, high, x)\r\n \r\n else:\r\n\r\n return arr[high]\r\n\r\ndef modinverse(a,p):\r\n res=p\r\n while p%2==0:\r\n p=p//2\r\n if p%2!=0:\r\n res-=res//2\r\n for i in range(3,int(p**0.5)+1,2):\r\n while p%i==0:\r\n p=p//i\r\n if p%i!=0:\r\n res-=res//i\r\n if p>1:\r\n return int(math.pow(a,p-2))\r\n return int(math.pow(a,res-1))\r\ndef isprime(n):\r\n p = 1000000\r\n f = [False]*(p+1)\r\n for i in range(2,int(p**0.5)+1):\r\n if f[i]: continue\r\n for j in range(i*2,p+1,i):\r\n f[j] = True\r\n return not f[n]\r\ndef find(found):\r\n for i in found:\r\n if not i:\r\n return True\r\n return False\r\ndef main():\r\n # for _ in range(int(input())):\r\n a=['0','2','4','6','8']\r\n s=list(input())\r\n done=False\r\n for i in range(len(s)):\r\n if s[i] in a:\r\n if s[i]<s[-1]:\r\n done=True\r\n s[i],s[-1]=s[-1],s[i]\r\n break\r\n if not done:\r\n for i in range(len(s)-2,-1,-1):\r\n if s[i] in a:\r\n s[i],s[-1]=s[-1],s[i]\r\n done=True\r\n break\r\n if done:\r\n print(''.join(s))\r\n else:\r\n print(-1)\r\n\r\n\r\n \r\n\r\n \r\n\r\n\r\n \r\n\r\n \r\n\r\n\r\n\r\n \r\n \r\n \r\n\r\n\r\n \r\n\r\n \r\n \r\n\r\n\r\n \r\n \r\n\r\n\r\n\r\n\r\n \r\n \r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\nBUFSIZE = 8192\r\n\r\n\r\nclass FastIO(IOBase):\r\n newlines = 0\r\n\r\n def __init__(self, file):\r\n self._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 \r\n \r\n main()\r\n\r\n\r\n \r\n ", "n = input()\r\ns = list(n)\r\n#print(s)\r\nind = -1\r\nfor i in range(len(s)):\r\n if int(s[i])%2 == 0:\r\n ind = i\r\n if int(s[i])<int(s[-1]):\r\n break\r\nif ind<0:\r\n print(-1)\r\nelse:\r\n s[ind],s[-1] = s[-1],s[ind]\r\n print(''.join(s))", "n = list(input())\r\nm = -1\r\nfor i, d in enumerate(n):\r\n if int(d) % 2 == 0:\r\n m = i\r\n if int(d) < int(n[-1]):\r\n break\r\nif m < 0:\r\n print(-1)\r\nelse:\r\n n[-1], n[m] = n[m], n[-1]\r\n print(''.join(n))", "n=list(map(int, input()))\r\nindex=-1\r\nfor i in range(len(n)-1):\r\n if n[i]%2==0:\r\n index=i\r\n if n[-1]>n[i]:\r\n break\r\n\r\nif index==-1:\r\n print(-1)\r\nelse:\r\n n[index], n[-1]=n[-1], n[index]\r\n print(''.join(map(str, n)))\r\n", "n=list(input())\r\nm=[]\r\nfor i in range (len(n)):\r\n if int(n[i])%2==0:\r\n m.append([int(n[i]),i])\r\nif len(m)!=0:\r\n change=m[0][1]\r\n small=m[-1][1]\r\n flag=0\r\n for i in range (len(m)):\r\n if int(n[-1])>m[i][0]:\r\n if flag==0:\r\n change=m[i][1]\r\n flag=1\r\n if flag==1:\r\n n[change],n[-1]=n[-1],n[change]\r\n else:\r\n n[small],n[-1]=n[-1],n[small]\r\n print(\"\".join(n))\r\nelse:\r\n print(-1)", "def main():\r\n\tn = input()\r\n\teven_count = 0\r\n\teven_inds = []\r\n\tfor i, c in enumerate(n):\r\n\t\tif c in \"02468\":\r\n\t\t\teven_count += 1\r\n\t\t\teven_inds.append(i)\r\n\r\n\tdef swap_ind(i):\r\n\t\treturn n[0:i] + n[-1] + n[i+1:-1] + n[i]\r\n\r\n\tif even_count == 0:\r\n\t\tprint(-1)\r\n\telif even_count == 1:\r\n\t\teven_ind = even_inds[0]\r\n\t\tprint(swap_ind(even_ind))\r\n\telse:\r\n\t\tfor ind in even_inds:\r\n\t\t\tif int(n[-1]) > int(n[ind]):\r\n\t\t\t\tprint(swap_ind(ind))\r\n\t\t\t\treturn\r\n\t\tprint(swap_ind(even_inds[-1]))\r\n\r\n\r\nif __name__ == \"__main__\":\r\n\tmain()", "s=list(input())\r\nn=len(s)\r\nf=0\r\nlast=int(s[-1])\r\nfor i in range(n):\r\n if int(s[i])%2==0: \r\n f=1\r\n if int(s[i])<last:\r\n s[i],s[-1]=s[-1],s[i]\r\n print(\"\".join(s))\r\n exit()\r\nif not f:\r\n print(-1)\r\n exit()\r\nfor i in range(n-1,-1,-1):\r\n if int(s[i])%2==0: \r\n s[i],s[-1]=s[-1],s[i]\r\n print(\"\".join(s))\r\n exit()\r\n ", "s=input()\r\nodd=int(s[-1])\r\nn=len(s)\r\nlast=-1\r\nplace=-1\r\nfor i in range(n):\r\n t=int(s[i])\r\n if not t&1:\r\n if place==-1 and t<odd:\r\n place=i\r\n last=i\r\nif last==-1:\r\n print(-1)\r\nelse:\r\n if place==-1:\r\n swap=last\r\n else:\r\n swap=place\r\n for i in range(n):\r\n if i==swap:\r\n print(s[-1],end=\"\")\r\n elif i==n-1:\r\n print(s[swap],end=\"\")\r\n else:\r\n print(s[i],end=\"\")", "a = list(map(int, input()))\nif all(n & 1 for n in a):\n print(-1)\nelse:\n last = a[-1]\n for i, ai in enumerate(a):\n if ai & 1 == 0:\n if ai < last:\n a[i], a[-1] = a[-1], a[i]\n break\n else:\n lasti = i\n else:\n a[lasti], a[-1] = a[-1], a[lasti]\n print(\"\".join(map(str, a)))\n", "temp_input = (input())\narr = []\nflag = 0\nfor i in temp_input:\n arr.append(int(i))\n if int(i) % 2 == 0:\n flag = 1\nif flag == 0:\n print(-1)\nelse:\n if arr[-1] % 2 == 0:\n max_val = -1\n index = 0\n for i in range(len(arr)):\n if arr[i] > max_val:\n max_val = arr[i]\n index = i\n temp = arr[0]\n arr[0] = arr[index]\n arr[index] = temp\n else:\n done = 0\n for i in range(len(arr)):\n if arr[i] % 2 == 0 and arr[i] < arr[-1]:\n temp = arr[i]\n arr[i] = arr[-1]\n arr[-1] = temp\n done = 1\n break\n if done == 0:\n for i in range(len(arr)-1, -1, -1):\n if arr[i] % 2 == 0 and arr[i] > arr[-1]:\n temp = arr[i]\n arr[i] = arr[-1]\n arr[-1] = temp\n break\n print(int(\"\".join(map(str, arr))))\n", "s=input();A=*map(int,s),;a=A[-1];t=-1\r\nfor i in range(len(s)):\r\n if A[i]%2==0:\r\n t=i\r\n if A[i]<a:break\r\nprint([s[:t]+s[-1]+s[t+1:-1]+s[t],-1][t<0])", "n = input()\r\narr = [int(i)for i in n ]\r\nch = arr[-1]\r\nl = len(n)\r\nflag = 0\r\nfor i in range(l-1):\r\n if arr[i] < ch and arr[i]%2 == 0:\r\n arr[i] , arr[-1] = arr[-1] , arr[i]\r\n flag = 1\r\n break\r\nif flag:\r\n print(*arr , sep = '')\r\nelse:\r\n check = 0\r\n for i in reversed(range(l-1) ):\r\n if arr[i]%2 == 0:\r\n arr[i], arr[-1] = arr[-1], arr[i] \r\n check = 1\r\n break\r\n if check:\r\n print(*arr, sep = '')\r\n else:\r\n print(-1) \r\n\r\n\r\n", "s=input()\r\njup=-1\r\nii=0\r\nfor i in s:\r\n i=int(i)\r\n if(i%2==0):\r\n if(i<int(s[-1])):\r\n jup=ii\r\n break\r\n jup=ii\r\n ii+=1\r\nif(jup==-1):print(-1)\r\nelse:\r\n for i in range(len(s)-1):\r\n if(i==jup):\r\n print(s[-1],end='')\r\n else:\r\n print(s[i],end='')\r\n print(s[jup])", "l = list(input())\r\nn = len(l)\r\nj = -1\r\nfor i in range(n - 1):\r\n if(int(l[i]) % 2 == 0):\r\n if(l[-1] > l[i]):\r\n l[i], l[-1] = l[-1], l[i]\r\n print(''.join(l))\r\n break\r\n j = i\r\nelse:\r\n if(j == -1):\r\n print(-1)\r\n else:\r\n l[j], l[-1] = l[-1], l[j]\r\n print(''.join(l))\r\n\r\n", "def verif(s):\r\n ok=False\r\n for i in range(len(s)):\r\n if int(s[i])%2==0:\r\n ok=True\r\n break\r\n return ok\r\ndef last2(s):\r\n i=0\r\n while i<=len(s)-2:\r\n if int(s[len(s)-2-i])%2==0:\r\n return len(s)-2-i\r\n else:\r\n i+=1\r\n\r\n \r\ndef trouver(s):\r\n for i in range(len(s)-1):\r\n if int(s[-1])>int(s[i]) and int(s[i])%2==0:\r\n s=s[:i]+s[-1]+s[i+1:len(s)-1]+s[i]\r\n return int(s)\r\n index=last2(s)\r\n s=s[:index]+s[-1]+s[index+1:len(s)-1]+s[index]\r\n return int(s)\r\n \r\nn=int(input())\r\ns=str(n)\r\nif not verif(s):\r\n print(-1)\r\nelse:\r\n res=trouver(s)\r\n print(res)\r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n ", "from array import array \r\ns = array('u' , input()); n = len(s)\r\nl = [ ]; d = s[-1]\r\nfor i in range(n) : \r\n if not int(s[i])%2 : \r\n l.append((i, s[i]))\r\nl.sort()\r\nif not l : \r\n print(-1)\r\nelse : \r\n for i in l : \r\n if d > i[1] : \r\n s[-1], s[i[0]] = s[i[0]], s[-1]\r\n break \r\n else : \r\n s[-1], s[l[-1][0]] = s[l[-1][0]], s[-1]\r\n print(''.join(s))", "a=input();x=-1;n=len(a)\r\nfor i in range(n-1):\r\n\tif int(a[i])%2==0 :\r\n\t\tx=i\r\n\t\tif int(a[i])<int(a[-1]):break\r\nif x<0:print(-1)\r\nelse:print(a[:x]+a[-1]+a[x+1:n-1]+a[x])", "n=input()\r\na=-1\r\ny=int(n[-1])\r\nfor x in range(len(n)):\r\n m=int(n[x])\r\n if m%2==0:\r\n if y>m:\r\n print(n[0:x]+str(y)+n[x+1:-1]+str(m))\r\n break\r\n else:\r\n a=x\r\nelse:\r\n if a!=-1:\r\n print(n[0:a]+str(y)+n[a+1:-1]+n[a])\r\n else:\r\n print(-1)", "# меняем последнюю цифру\r\n# если не найдём ни одно чётное число, то выводим -1\r\n# идём слева направо\r\n# если чётное число хотя бы на единицу меньше, то сразу меняем\r\n# если нет чётных чисел, меньших нашего, то ищем самое правое чётное число, \r\n# чтобы изменение на меньшее не сделало больших изменений в сумме цифр\r\n\r\nstring = input()\r\ntarget = string[-1]\r\nindex = -1\r\nfor ind, current_digit in enumerate(string):\r\n if ord(current_digit) % 2 == 0:\r\n index = ind\r\n if current_digit < target:\r\n result = string[0:-1].replace(current_digit, target, 1) + current_digit\r\n break\r\nelse:\r\n if index == -1:\r\n result = -1\r\n else:\r\n even = string[index]\r\n result = string[-2::-1].replace(even, target, 1)\r\n result = result[::-1] + even\r\n\r\nprint(result)", "n1 = list(input())\r\nodd = int(n1[-1])\r\nflag = 0\r\nlast = -2\r\nfor i in range(len(n1)-1):\r\n if int(n1[i]) % 2 == 0:\r\n if odd > int(n1[i]):\r\n flag+=1\r\n temp1 = n1[i]\r\n temp2 = str(odd)\r\n n1[i] = temp2\r\n n1[-1] = temp1\r\n break\r\n last = i\r\n\r\nif flag == 0 and last == -2:\r\n print(-1)\r\nelif flag == 0 and last != -2:\r\n temp1 = n1[last]\r\n temp2 = n1[-1]\r\n n1[last] = temp2\r\n n1[-1] = temp1\r\n print(''.join(n1))\r\nelse:\r\n print(''.join(n1))\r\n \r\n ", "# cook your dish here\r\nn = input()\r\narr = list(n)\r\nmylist = []\r\nflag = 2\r\nfor i in range(len(arr)):\r\n if(int(arr[i])%2 == 0):\r\n if(int(arr[i]) < int(arr[-1])):\r\n temp = arr[-1]\r\n arr[-1] = arr[i]\r\n arr[i] = temp\r\n flag = 0\r\n break\r\n else:\r\n mylist.append(i)\r\n flag = 1\r\nif(flag == 1):\r\n temp = arr[-1]\r\n arr[-1] = arr[mylist[-1]]\r\n arr[mylist[-1]] = temp\r\nif(flag == 0 or flag == 1):\r\n for j in arr:\r\n print(j,end=\"\")\r\nelif(flag!=0 or flag!=1):\r\n print(\"-1\")", "# 1 3 5 7 9 9 7 5 3 1\r\n\"\"\"\r\n '2' 4 6 7 9 9 7 5 3 '5'\r\n \r\n *)if no even print -1\r\n \r\n *)last digit(odd) > maximum even number ===> exhange with even number of lowest index\r\n *)last_digit(odd) < maximum even number ===> exchange with the first even number which is less than last_digit\r\n *)if only one even number ===>direct exchange \r\n *)if all evens are greater than last_digit exchange with highest index\r\n\"\"\"\r\ndef solve():\r\n n = list(input())\r\n # print(n)\r\n max_even=-1\r\n lowest_even=len(n)\r\n highest_even=0\r\n evens=0\r\n for i in range(len(n)):\r\n if(int(n[i])%2==0):\r\n max_even=max(max_even,int(n[i]))\r\n lowest_even=min(lowest_even,i)\r\n highest_even=max(highest_even,i)\r\n evens+=1\r\n last_digit = int(n[-1])\r\n \r\n if(evens==1):\r\n n[lowest_even],n[-1]=n[-1],n[lowest_even]\r\n print(\"\".join(n))\r\n elif(max_even == -1):\r\n print(\"-1\")\r\n elif(last_digit > max_even):\r\n n[lowest_even],n[-1]=n[-1],n[lowest_even]\r\n print(\"\".join(n))\r\n elif(last_digit < max_even):\r\n for i in range(len(n)):\r\n num=int(n[i])\r\n if(num%2==0 and num<last_digit):\r\n n[i],n[-1]=n[-1],n[i]\r\n print(\"\".join(n))\r\n return;\r\n n[highest_even],n[-1]=n[-1],n[highest_even]\r\n print(\"\".join(n))\r\n return\r\n \r\n \r\n \r\n\r\n\r\nif __name__ == '__main__':\r\n solve()", "n=[i for i in input()]\r\nflag=True\r\nbravo=-1\r\nfor i in range(len(n)):\r\n if int(n[i])%2==0 and int(n[i])<int(n[-1]):\r\n count_=i\r\n flag=False\r\n break\r\n elif int(n[i])%2==0:\r\n bravo=i\r\nif flag:\r\n if bravo==-1:\r\n print(-1)\r\n else:\r\n tre=n[bravo]\r\n n[bravo]=n[-1]\r\n n[-1]=tre\r\n print(\"\".join(n))\r\nelse:\r\n tre=n[count_]\r\n n[count_]=n[-1]\r\n n[-1]=tre\r\n print(\"\".join(n))", "num = list(input())\r\nind = -1\r\nl = len(num)\r\nfor i in range(l-1):\r\n if int(num[i]) % 2 == 0:\r\n ind = i\r\n if int(num[i]) < int(num[-1]):\r\n break\r\n \r\nif ind == -1:\r\n print(-1)\r\nelse:\r\n num[ind], num[-1] = num[-1], num[ind]\r\n print(''.join(num))", "l = list(input())\r\nd = {}\r\np = int(l[-1])\r\n\r\nfor i in range(len(l)-1):\r\n q = int(l[i])\r\n if q%2 == 0:\r\n if q<p:\r\n if q in d:\r\n pass\r\n else:\r\n d[q] = i\r\n else:\r\n d[q] = i\r\n #print(d)\r\n\r\nif len(d) == 0:\r\n print(-1)\r\nelse:\r\n keys = list(d.keys())\r\n ans = []\r\n \r\n for i in keys:\r\n l[d[i]],l[-1] = l[-1],l[d[i]]\r\n ans.append(''.join(l))\r\n l[d[i]],l[-1] = l[-1],l[d[i]]\r\n \r\n print(max(ans))", "a=input()\r\nk=-1\r\nfor i in range(len(a)):\r\n if int(a[i])%2==0:\r\n if a[i]<a[-1]:\r\n k=i\r\n break\r\n k=i\r\nif int(k)>=0:\r\n print(a[:k],end='')\r\n print(a[-1],end='')\r\n print(a[k+1:-1],end='')\r\n print(a[k])\r\nelse:\r\n print(k)", "# https://codeforces.com/problemset/problem/508/B\r\n\r\ndef change_pos(word, pos):\r\n return f'{word[:pos]}{word[-1]}{word[pos+1:-1]}{word[pos]}'\r\n\r\ndef solve(word):\r\n last_number = int(word[-1])\r\n pos = -1\r\n for i in range(len(word)-1):\r\n number = int(word[i])\r\n if number % 2 == 0:\r\n pos = i\r\n if number < last_number:\r\n break\r\n if pos == -1:\r\n return -1\r\n return change_pos(word, pos)\r\n\r\nword = input()\r\nprint(solve(word))\r\n", "s=input()\r\nindex=-1\r\nn=len(s)\r\nfor i in range(n):\r\n if s[i] in \"02468\":\r\n index=i\r\n if s[i]<s[-1]: break\r\nif index==-1: print(-1)\r\nelse: print(s[:index]+s[-1]+s[index+1:n-1]+s[index])", "import math\r\n\r\n\r\n\r\n\r\ndef main_function():\r\n n = list(input())\r\n ans_found = False\r\n for i in range(len(n)):\r\n if int(n[i]) % 2 == 0 and int(n[i]) < int(n[-1]):\r\n n[i], n[-1] = n[-1], n[i]\r\n ans_found = True\r\n break\r\n if not ans_found:\r\n for i in range(len(n)):\r\n j = len(n) - i - 1\r\n if int(n[j]) % 2 == 0:\r\n n[j], n[-1] = n[-1], n[j]\r\n ans_found = True\r\n break\r\n if not ans_found:\r\n print(-1)\r\n else:\r\n print(\"\".join(n))\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\nif __name__ == '__main__':\r\n main_function()", "import io,os \n\ndef largeValue(currency1):\n value = int(currency1)\n currency = list(currency1)\n\n maximum = 0 \n lengthofcurrency = len(currency) - 1\n \n decimalvalue = 10\n oddvalue = int(currency[lengthofcurrency])\n evenvalue = 0\n\n lastevenvalue = -1 \n\n for i in range(0,lengthofcurrency) :\n evenvalue = int(currency[i])\n if (evenvalue % 2 == 0) :\n lastevenvalue = i \n if evenvalue < oddvalue :\n currency[i] = str(oddvalue)\n currency[lengthofcurrency] = str(evenvalue)\n maximum = 1 \n break\n if maximum == 0 and lastevenvalue != -1:\n currency[lengthofcurrency] = str(currency[lastevenvalue])\n currency[lastevenvalue] = str(oddvalue)\n maximum = 1 \n\n\n if ( maximum == 1 ) :\n return \"\".join(currency) \n\n return \"-1\"\n\ndef main():\n #input = io.BytesIO(os.read(0,os.fstat(0).st_size))\n currency = input()\n print(largeValue(currency))\n\nmain()\n", "# coding=utf-8\nx=input()\r\nflag=0\r\npos1=-1\r\npos2=-1\r\nfor i in range(len(x)):\r\n if int(x[i])%2==0:\r\n pos2=i\r\n flag=1\r\n if x[i]<x[len(x)-1] and pos1<0:\r\n pos1=i\r\nif flag==0:\r\n print(-1)\r\nelif pos1>=0:\r\n# x[len(x)-1],x[pos1]=x[pos1],x[len(x)-1]\r\n print(x[:pos1],end='')\r\n print(x[len(x)-1],end='')\r\n print(x[pos1+1:len(x)-1],end='')\r\n print(x[pos1])\r\nelse:\r\n print(x[:pos2],end='')\r\n print(x[len(x)-1],end='')\r\n print(x[pos2+1:len(x)-1],end='')\r\n print(x[pos2])\r\n \r\n\n \t \t \t \t \t \t\t\t\t \t\t \t", "s = input()\n\nmin_even = None\nlast = int(s[-1])\nindex = None\nfor i, x in enumerate(s[:-1]):\n\n if int(x) % 2 == 0:\n min_even = int(x)\n index = i\n\n if int(x) < last:\n break\n\n\nif min_even is None:\n print(-1)\nelse:\n print(s[:index] + s[-1] + s[index + 1:-1] + s[index])\n\nif __name__ == '__main__':\n pass\n", "import string\ndata = list(input())\nl = len(data)\nflag = 0\ny = int(data[l-1])\nj = -1\nfor i in range(l):\n x = int(data[i])\n if x % 2 == 0:\n if x < y:\n temp = data[i]\n data[i] = data[l-1]\n data[l-1] = temp\n flag = 1\n break\n j = i\nif flag == 0 and j >= 0:\n temp = data[j]\n data[j] = data[l - 1]\n data[l - 1] = temp\n flag = 1\nif flag == 1:\n for i in range(l):\n print(data[i],end='')\nelse:\n print('-1')\n\t \t \t \t \t \t\t \t\t\t\t \t \t\t\t\t", "n = str(input())\r\nn = [x for x in n]\r\neven = {}\r\n\r\nfor i in range(len(n)):\r\n if int(n[i]) % 2 == 0:\r\n even[i] = int(n[i])\r\n\r\nif not even:\r\n print(-1)\r\n exit()\r\n\r\nel = list(even.items())\r\nmax_el = (0, 0)\r\nfor i in el:\r\n if i[1] > max_el[1]:\r\n max_el = i\r\n\r\nj = 0\r\nfor key, value in even.items():\r\n if value < int(n[-1]):\r\n n[key], n[-1] = n[-1], n[key]\r\n print(\"\".join(n))\r\n break\r\n if key == el[-1][0]:\r\n if value < int(n[-1]):\r\n n[el[0][0]], n[-1] = n[-1], n[el[0][0]]\r\n print(\"\".join(n))\r\n break\r\n else:\r\n n[el[-1][0]], n[-1] = n[-1], n[el[-1][0]]\r\n print(\"\".join(n))\r\n break\r\n", "s = input()\r\nn = ind = len(s)-1\r\nfor i in range(n):\r\n if int(s[i])%2==0:\r\n ind = i\r\n if(int(s[i])<int(s[n])):\r\n break\r\nif ind==n:\r\n print(-1)\r\n \r\nelse:\r\n s = list(s)\r\n s[ind], s[n] = s[n], s[ind]\r\n print(\"\".join(s))", "num = input()\nultimo = int(num[-1])\nfor i in range(len(num)):\n actual = int(num[i])\n if ultimo > actual and actual%2 == 0:\n print(num[0:i] + num[-1] + num[i+1:-1] + num[i])\n exit()\nfor j in range(len(num)-1, -1, -1):\n actual = int(num[j])\n if ultimo < actual and actual%2 == 0:\n print(num[0:j] + num[-1] + num[j+1:-1] + num[j])\n exit()\n\nprint(-1)\n \t \t\t \t \t\t \t \t \t\t\t\t\t \t\t", "def get_exchange_rate(number):\r\n target = int(number[-1])\r\n best_num = -1\r\n for i, num in enumerate(number):\r\n if int(num) % 2 == 0:\r\n if int(num) < target:\r\n number[i], number[-1] = number[-1], number[i]\r\n return ''.join(number)\r\n else:\r\n best_num = i\r\n if best_num == -1:\r\n return best_num\r\n else:\r\n number[best_num], number[-1] = number[-1], number[best_num]\r\n return ''.join(number)\r\n \r\nn = [char for char in input()]\r\nprint(get_exchange_rate(n))\r\n", "n = input()\r\n\r\nfirst_even = []\r\nfor i in range(len(n)):\r\n if int(n[i])%2==0:\r\n first_even.append([int(n[i]),i])\r\n\r\n\r\n\r\nif len(first_even)==0:\r\n print(-1)\r\n exit()\r\n\r\nrep = []\r\nfor j in range(len(first_even)):\r\n if first_even[j][0]<int(n[-1]):\r\n newNum = n[:first_even[j][1]]+ n[-1] + n[first_even[j][1]+1:-1]+str(first_even[j][0])\r\n print(newNum)\r\n exit()\r\n\r\n\r\n\r\nnewNum = n[:first_even[-1][1]]+ n[-1] + n[first_even[-1][1]+1:-1]+str(first_even[-1][0])\r\nprint(newNum)", "inl = lambda: list(map(int, list(input())))\r\n\r\n\r\ndef solve():\r\n string = input()\r\n a = list(map(int, list(string)))\r\n evens = [i for i in a if i % 2 == 0]\r\n if len(evens) == 0:\r\n print(\"-1\")\r\n else:\r\n for i in range(len(a) - 1):\r\n if a[i] < a[-1] and a[i] % 2 == 0:\r\n ind = i\r\n break\r\n else:\r\n ind = string.rfind(str(evens[-1]))\r\n\r\n a[ind], a[-1] = a[-1], a[ind]\r\n print(\"\".join(map(str, a)))\r\n\r\n\r\nsolve()\r\n", "s = list(input())\r\nind = -1\r\nfor i in range(len(s)):\r\n if ord(s[i]) < ord(s[-1]) and (ord(s[i]) - ord('0')) % 2 == 0:\r\n ind = i\r\n break\r\nif ind != -1:\r\n s[ind], s[-1] = s[-1], s[ind]\r\n print(*s, sep='')\r\nelse:\r\n for i in range(len(s)):\r\n if (ord(s[i]) - ord('0')) % 2 == 0:\r\n ind = i\r\n if ind != -1:\r\n s[ind], s[-1] = s[-1], s[ind]\r\n print(*s, sep='')\r\n else:\r\n print(-1)# 1691439128.3754678", "need = [c for c in input()]\r\nk = -1\r\nmx = 0\r\nfor i in range(len(need)-2, -1, -1):\r\n if ord(need[i]) % 2 == 0 and (k == -1 or need[-1] > need[i]):\r\n k = i\r\nif k == -1:\r\n print(-1)\r\nelse:\r\n need[k], need[-1] = need[-1], need[k]\r\n print(''.join(need))", "n = list(input())\r\n\r\nlast = int(n[-1])\r\nnum_list = []\r\n\r\nfor i in range(len(n) - 1):\r\n if int(n[i]) % 2 == 0 and int(n[i]) < last:\r\n n[-1], n[i] = n[i], n[-1]\r\n print(''.join(n))\r\n break\r\n elif int(n[i]) % 2 == 0:\r\n num_list.append(i)\r\nelse:\r\n if num_list:\r\n n[-1], n[num_list[-1]] = n[num_list[-1]], n[-1]\r\n print(''.join(n))\r\n else:\r\n print(-1)", "# https://codeforces.com/problemset/problem/508/B\n\ndef handle() -> str:\n value = list(input())\n last_val = int(value[-1])\n evens = []\n\n for i, v in enumerate(value):\n if int(v) % 2 == 0:\n evens.append((int(v), i))\n\n if not evens:\n return \"-1\"\n\n for v, i in evens:\n if v < last_val:\n value[i], value[-1] = value[-1], value[i]\n return \"\".join(value)\n\n last_index = evens[-1][1]\n value[last_index], value[-1] = value[-1], value[last_index]\n return \"\".join(value)\n\n\nprint(handle())\n", "import sys\ninput = sys.stdin.readline\n\nA = list(map(int, input().rstrip()))\n\nEPL = []\nfor i, v in enumerate(A) :\n if v%2 == 0 :\n EPL.append((i, v))\n\nif EPL :\n AEN = A[-1]\n for i, v in EPL :\n if AEN > v :\n A[-1], A[i] = A[i], A[-1]\n print(\"\".join(map(str, A)))\n exit(0)\n \n SI = EPL[-1][0]\n A[-1], A[SI] = A[SI], A[-1]\n print(\"\".join(map(str, A)))\n\nelse :\n print(-1)\n", "s = input()\r\nar = [s[i] for i in range(len(s))]\r\narr = []\r\nz = \"\"\r\np = \"\"\r\nt = 0\r\nu = 0\r\nfor k in range(len(s) - 1):\r\n if int(ar[k]) % 2 == 0:\r\n arr.append(ar[k])\r\nif int(s) % 2 != 0 and len(arr) != 0:\r\n for j in range(len(s)):\r\n if int(ar[j]) % 2 == 0 and int(ar[j]) < int(ar[len(s)-1]):\r\n z = ar[j]\r\n ar[j] = ar[len(s)-1]\r\n ar[len(s)-1] = z\r\n break\r\n elif int(ar[j]) % 2 == 0 and int(ar[j]) > int(ar[len(s)-1]):\r\n u += 1\r\n t = j\r\n elif u == len(arr) and u != 0:\r\n z = ar[t]\r\n ar[t] = ar[len(s)-1]\r\n ar[len(s)-1] = z\r\n break\r\n for d in ar:\r\n p += d\r\n print(p)\r\nelif len(arr) == 0 and int(ar[len(s)-1]) % 2 != 0:\r\n print(-1)\r\nelse:\r\n print(s)\r\n", "inl = lambda: list(map(int, list(input())))\r\n\r\n\r\ndef solve():\r\n s = input()\r\n a = list(map(int, list(s)))\r\n e = [i for i in a if i % 2 == 0]\r\n if len(e) == 0:\r\n print(\"-1\")\r\n else:\r\n for i in range(len(a) - 1):\r\n if a[i] < a[-1] and a[i] % 2 == 0:\r\n j = i\r\n break\r\n else:\r\n j = s.rfind(str(e[-1]))\r\n\r\n a[j], a[-1] = a[-1], a[j]\r\n print(\"\".join(map(str, a)))\r\n\r\n\r\nsolve()\r\n", "n = input()\r\na = [int(i) for i in n]\r\neven = []\r\nfor i in range(len(a)):\r\n if not a[i] % 2:\r\n even.append(i)\r\nif not even:\r\n exit(print(-1))\r\n \r\nans = even[-1]\r\nfor i in range(len(even) - 1, -1, -1):\r\n if a[-1] > a[even[i]]:\r\n ans = even[i]\r\na[ans], a[-1] = a[-1], a[ans]\r\nprint(''.join(str(i) for i in a))", "def main():\r\n a =input()\r\n j = -1\r\n for i in range(len(a)-2,-1,-1):\r\n if (int(a[i])%2==0) and (j == -1 or (a[-1]>a[i])):\r\n j = i\r\n if(j==-1):\r\n print(-1)\r\n else:\r\n print(a[:j]+a[-1]+a[j+1:-1]+a[j])\r\nmain()\r\n", "# -----Arkp-----#\r\nimport sys\r\nfrom math import *\r\nfrom collections import defaultdict\r\nimport sys\r\nI_map=lambda: map(int,input().split())\r\nS_map=lambda: map(str,input().split())\r\nF_map=lambda: map(float,input().split())\r\nN=lambda: int(input())\r\nS=lambda: input()\r\ndef INT_MAX():\r\n return sys.maxsize\r\ndef INT_MIN():\r\n return -sys.maxsize\r\n\r\ndef solve(l):\r\n n=len(l)\r\n k=int(l[n-1])\r\n ind=-1\r\n ok=1\r\n for i in range(n):\r\n if int(l[i])&1==0:\r\n ind=i\r\n if int(l[i])<k:\r\n if int(l[i])&1==0:\r\n ok=0\r\n l[i],l[n-1]=l[n-1],l[i]\r\n # print(l[i],l[n-1])\r\n break\r\n\r\n if ind==-1:\r\n return -1\r\n if k&1==0:\r\n return ''.join(l)\r\n if ok:\r\n l[ind],l[n-1]=l[n-1],l[ind]\r\n return ''.join(l)\r\n \r\n \r\n\r\n\r\n\r\nl=list(str(N()))\r\nprint(solve(l))\r\n\r\n\r\n\r\n\r\n\r\n\r\n \r\n ", "s = list(str(input()))\r\nidx = -1\r\nfor i, c in enumerate(s):\r\n if int(c)%2 == 0:\r\n idx = i\r\n if int(c) < int(s[-1]):\r\n break\r\nif idx != -1:\r\n s[idx], s[-1] = s[-1], s[idx]\r\n print(''.join(s))\r\nelse:\r\n print(-1)\r\n", "import sys\r\nfrom math import *\r\nfrom collections import Counter, defaultdict, deque\r\ninput = sys.stdin.readline\r\nmod = 10**9+7\r\nn = input()\r\n\r\neven_count = 0\r\nt = list(n)\r\nt.pop()\r\nfor i in t:\r\n if (ord(i)-ord('0')) % 2 == 0:\r\n even_count += 1\r\n break\r\nif (even_count == 0):\r\n print(-1)\r\n\r\nelse:\r\n\r\n for i in range(len(t)-1):\r\n if (ord(t[i])-ord('0')) % 2 == 0:\r\n if (t[i] < t[len(t)-1]):\r\n t[i], t[len(t)-1] = t[len(t)-1], t[i]\r\n break\r\n\r\n if ((ord(t[len(t)-1])-ord('0')) % 2 != 0):\r\n for i in range(len(t)-2, -1, -1):\r\n if ((ord(t[i])-ord('0')) % 2 == 0):\r\n t[i], t[len(t)-1] = t[len(t)-1], t[i]\r\n break\r\n print(''.join(t))\r\n", "s=input();A={0:[],2:[],4:[],6:[],8:[]};a=int(s[-1]);B=[];C=[]\r\nfor i in range(len(s)):\r\n if int(s[i])%2==0:A[int(s[i])]+=[i]\r\nfor x,y in A.items():\r\n if x<a:B+=y\r\n else:C+=y\r\nif B:m=min(B);s=s[:m]+s[-1]+s[m+1:-1]+s[m]\r\nelif C:n=max(C);s=s[:n]+s[-1]+s[n+1:-1]+s[n]\r\nelse:s=-1\r\nprint(s)", "inds = []\r\nind = 0\r\ns = []\r\nfor i in input():\r\n\tif int(i) % 2 == 0:\r\n\t\tinds.append(ind)\r\n\tind += 1\r\n\ts.append(i)\r\nif len(inds) == 0:\r\n\tprint(-1)\r\n\texit()\r\nfor ind in inds:\r\n\tif int(s[ind]) < int(s[-1]):\r\n\t\ts[-1], s[ind] = s[ind], s[-1]\r\n\t\tprint(''.join(s))\r\n\t\texit()\r\ns[-1], s[inds[-1]] = s[inds[-1]], s[-1]\r\nprint(''.join(s))", "n=input()\r\nans=1\r\nele=0\r\nind=0\r\nfor i in range(len(n)):\r\n if int(n[i])%2==0:\r\n if int(n[i])<int(n[-1]):\r\n print(n[:i]+n[-1]+n[i+1:-1]+n[i])\r\n ans=0\r\n break\r\n else:\r\n ele=n[i]\r\n ind=i\r\nif ans:\r\n if ele!=0:\r\n print(n[:ind]+n[-1]+n[ind+1:-1]+ele)\r\n else:\r\n print(-1)", "n = input()\nlens = len(n)\nloc = -1\nyanz = int(n[lens-1])\nfor i in range(lens):\n temp = int(n[i])\n if temp % 2 != 0:\n continue\n loc = i\n if temp<yanz:\n break\nnums = []\nif loc==-1:\n print(-1)\nelse:\n for j in range(lens):\n nums.append(n[j])\n temp =nums[loc]\n nums[loc]= nums[lens-1]\n nums[lens-1]=temp\n res = ''\n for num in nums:\n res+=num\n print(res)\n\n\t\t \t\t \t \t\t\t\t \t\t\t", "def get(f): return f(input().strip())\ndef gets(f): return [*map(f, input().split())]\n\n\ns = [*get(str)]\nn = len(s)\nz = int(s[-1])\nm = -1\nfor i in range(n):\n y = int(s[i])\n if not y & 1:\n m = i\n if y < z:\n s[i], s[-1] = s[-1], s[i]\n print(''.join(s))\n break\nelse:\n if m == -1:\n print('-1')\n else:\n s[m], s[-1] = s[-1], s[m]\n print(''.join(s))\n", "l=list(map(int,input()))\r\nn=len(l)\r\na=l[n-1]\r\nlasteven=-1\r\nf=0\r\nt=0\r\nfor i in range(n-1):\r\n if(l[i]%2==0):\r\n f=1\r\n lasteven=i\r\n if(l[i]<a):\r\n t=1\r\n l[i],l[n-1]=l[n-1],l[i]\r\n break\r\nif(f==0):\r\n print(-1)\r\nelse:\r\n if(t==0):\r\n l[lasteven],l[n-1]=l[n-1],l[lasteven]\r\n for m in l:\r\n print(m,end=\"\")", "def pro(arr):\r\n n=len(arr)\r\n\r\n prev=None\r\n for i in range(n):\r\n if( int(arr[i])%2==0):\r\n if(int(arr[i])<int(arr[-1])):\r\n prev=i\r\n break\r\n else:\r\n prev=i\r\n if(prev!=None):\r\n arr[prev],arr[-1]= arr[-1],arr[prev]\r\n print(''.join(arr))\r\n return\r\n print(-1)\r\nn = input()\r\npro(list(n))", "# Python3 code for the above implementation\r\nimport sys\r\n\r\n\r\n# Make the largest even number\r\ndef makeEven(arr, n):\r\n # index to first even no,if any\r\n first_e_i = -1\r\n\r\n # index to last even no, if any\r\n last_e_i = -1\r\n\r\n # index to last no\r\n last_n_i = n - 1\r\n\r\n # Start traversing the String\r\n for i in range(n):\r\n\r\n # if it finds any first even no less\r\n # than last digit then break the loop\r\n if (int(arr[i]) % 2 == 0 and\r\n int(arr[i]) < int(arr[last_n_i])):\r\n first_e_i = i\r\n break\r\n\r\n # it finds last even no\r\n if int(arr[i]) % 2 == 0:\r\n last_e_i = i\r\n if first_e_i != -1:\r\n # swap even and odd value\r\n (arr[first_e_i],\r\n arr[last_n_i]) = (arr[last_n_i],\r\n arr[first_e_i])\r\n return arr\r\n if first_e_i == -1 and last_e_i != -1:\r\n # swap even and odd value\r\n (arr[last_e_i],\r\n arr[last_n_i]) = (arr[last_n_i],\r\n arr[last_e_i])\r\n return arr\r\n\r\n # Return original String if there is\r\n # no even number\r\n return arr\r\n\r\n\r\n# Driver Code\r\nstring = input()\r\nresult = \"\".join(makeEven(list(string),\r\n len(list(string))))\r\nif(result==string):\r\n print(-1)\r\nelse:\r\n print(result)\r\n# This code is contributed\r\n# by Vikash Kumar 37\r\n", "def get(dictionary, target_value):\r\n for key, value in dictionary.items():\r\n if value == target_value:\r\n return key\r\n return None \r\n\r\n\r\nn=input()\r\ndic={}\r\nl=list(n)\r\nfor i in range(len(n)):\r\n if int(l[i])%2==0:\r\n dic[i]=l[i]\r\nz=int(l[-1])\r\n\r\nflg=False\r\nfor i in dic.values():\r\n if int(z)>int(i):\r\n swp=get(dic,i)\r\n #print(swp)\r\n flg=True\r\n break\r\n\r\nif flg==True:\r\n #print(dic)\r\n l[swp],l[-1]=l[-1],l[swp]\r\n #print('wewe')\r\n for i in l:\r\n print(i, end='')\r\n\r\nelse:\r\n if len(dic)==0:\r\n print(-1)\r\n\r\n else:\r\n keys_list = list(dic.keys())\r\n last= keys_list[-1]\r\n l[last],l[-1]=l[-1],l[last]\r\n\r\n for i in l:\r\n print(i, end='')\r\n\r\n \r\n", "def sol():\r\n s=input()\r\n l=[]\r\n for i in s:\r\n l.append(int(i))\r\n rep = False\r\n n=-1\r\n la=l[-1]\r\n for i in range(len(l)-1):\r\n if l[i]%2==0 and la>l[i]:\r\n l[i],l[-1]=l[-1],l[i]\r\n rep=True\r\n break\r\n \r\n \r\n if rep==False:\r\n for i in range(len(l)-1,-1,-1):\r\n if l[i]%2==0:\r\n l[i],l[-1]=l[-1],l[i]\r\n rep =True\r\n break\r\n if rep==False:\r\n print(-1)\r\n else:\r\n print(*l, sep = \"\")\r\n \r\n \r\n \r\n\r\n \r\nsol()\r\n", "n=list(input())\r\nind=-1\r\nfor i,d in enumerate(n):\r\n if int(d)%2==0:\r\n ind=i\r\n if int(d)<int(n[-1]):\r\n break\r\nif ind!=-1:\r\n n[-1],n[ind]=n[ind],n[-1]\r\n print(''.join(n))\r\nelse:\r\n print(-1)", "integer = list((input()))\r\nlast_digit = int(integer[-1])\r\ncan_increase = False\r\ncan_change = False\r\n\r\n\r\ndef swap(a, b, lst):\r\n temp = lst[a]\r\n lst[a] = lst[b]\r\n lst[b] = temp\r\n\r\n\r\nfor i in range(0, len(integer)):\r\n if int(integer[i]) % 2 == 0:\r\n if int(integer[i]) < last_digit:\r\n swap(i, -1, integer)\r\n can_increase = True\r\n can_change = True\r\n break\r\n\r\n\r\nif not can_increase:\r\n for i in range(len(integer)-1, -1, -1):\r\n if int(integer[i]) % 2 == 0:\r\n swap(i, -1, integer)\r\n can_change = True\r\n break\r\n\r\nif can_change:\r\n print(\"\".join(integer))\r\n\r\nelse:\r\n print(-1)", "from sys import stdin,stdout\r\ninput = stdin.readline\r\nprint = stdout.write\r\n\r\nn = list(input().rstrip())\r\nmain = []\r\nf=1\r\nfor i in range(len(n)):\r\n if not(int(n[i])&1):\r\n main.append(i)\r\nif not(len(main)):\r\n print(str(-1))\r\n f=2\r\nif f != 2:\r\n for i in main:\r\n if n[-1] > n[i]:\r\n n[-1], n[i] = n[i], n[-1]\r\n f = 0\r\n break\r\nif f and f!=2:\r\n n[main[-1]], n[-1] = n[-1], n[main[-1]]\r\n print(\"\".join(n))\r\nelif f==2:\r\n pass\r\nelse:\r\n print(\"\".join(n))", "# Anton and currency you all know\r\ns = [int(i) for i in input()]\r\nn = len(s)\r\nflag1 = False\r\nflag2 = False\r\nlast = s[-1]\r\nl_ind = -1\r\nfor i in range(n):\r\n if s[i] % 2 == 0:\r\n flag1 = True\r\n if s[i] < last:\r\n s[i],s[-1] = s[-1],s[i]\r\n flag2 = True\r\n break\r\n else:\r\n l_ind = i\r\nif flag1 == False:\r\n print(-1)\r\nelif flag2:\r\n print(\"\".join([chr(i+ord(\"0\")) for i in s]))\r\nelse:\r\n s[-1],s[l_ind] = s[l_ind],s[-1]\r\n print(\"\".join([chr(i+ord(\"0\")) for i in s]))" ]

[ "def main():\n\tax, ay, bx, by, cx, cy = [int(i) for i in input().split()]\n\tif ax*by + bx*cy + cx*ay - bx*ay - cx*by - ax*cy == 0:\n\t\tprint(\"No\")\n\telif (bx - ax)**2 + (by - ay)**2 == (cx - bx)**2 + (cy - by)**2:\n\t\tprint(\"Yes\")\n\telse:\n\t\tprint(\"No\")\n\n\nmain()\n\n# 1508530390696\n", "def vector_product(v1x, v1y, v2x, v2y):\r\n return (v1x * v2y - v1y * v2x)\r\n\r\ndef len_sq(vx, vy):\r\n return (vx * vx + vy * vy)\r\n \r\nax, ay, bx, by, cx, cy = (int(x) for x in input().split())\r\nabx = bx - ax\r\naby = by - ay\r\nbcx = cx - bx\r\nbcy = cy - by\r\nif vector_product(abx, aby, bcx, bcy) == 0:\r\n print('No')\r\nelif len_sq(abx, aby) != len_sq(bcx, bcy):\r\n print('No')\r\nelse:\r\n print('Yes')\r\n\r\n\r\n ", "\r\na1,a2,b1,b2,c1,c2=map(int,input().split())\r\na=((a1-b1)**2 + (a2-b2)**2)\r\nb=((c1-b1)**2 + (c2-b2)**2)\r\nc=((c1-a1)**2 + (c2-a2)**2)\r\nif a!=b or (b1==(a1+c1)//2 and b2==(a2+c2)//2)or(a1==(b1+c1)//2 and a2==(b2+c2)//2)or(c1==(a1+b1)//2 and c2==(a2+b2)//2):\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "from sys import exit\r\nfrom math import *\r\n\r\nax, ay, bx, by, cx, cy = map(int, input().split())\r\n\r\nl1 = (bx - ax)**2 + (by - ay)**2\r\nl2 = (cx - bx)**2 + (cy - by)**2\r\ndx = bx - ax\r\ndy = by - ay\r\n\r\nif l1 != l2:\r\n print('No')\r\nelif cx == bx + dx and cy == by + dy:\r\n print('No')\r\nelse:\r\n print('Yes')\r\n", "ax,ay,bx,by,cx,cy=map(int,input().split())\n\nif (ax-bx)**2+(ay-by)**2 == (cx-bx)**2 + (cy-by)**2 and (ay-by)*(cx-bx) != (ax-bx)*(cy-by):\n\tprint(\"Yes\")\nelse :\n\tprint(\"No\")", "x1, y1, x2, y2, x3, y3 = list(map(int, input().split()))\n\nif ((y2 - y1) * (x3 - x1)) == ((y3 - y1) * (x2 - x1)):\n print(\"No\")\nelif (pow(x1 - x2, 2) + pow(y1 - y2, 2)) == (pow(x2 - x3, 2) + pow(y2 - y3, 2)):\n print(\"Yes\")\nelse:\n print(\"No\")\n\n \t \t\t \t\t\t\t \t \t\t\t \t\t\t \t", "def read_ints():\r\n\treturn [int(i) for i in input().split()]\r\n\r\ncoords = read_ints()\r\na, b, c = [(coords[i], coords[i + 1]) for i in range(0, len(coords), 2)]\r\ndef length_sqr(a, b):\r\n\treturn (a[0] - b[0]) ** 2 + (a[1] - b[1]) ** 2\r\n\r\nif length_sqr(a, b) != length_sqr(b, c):\r\n\tprint('No')\r\nelif (c[0] - b[0]) * (b[1] - a[1]) == (c[1] - b[1]) * (b[0] - a[0]):\r\n\tprint('No')\r\nelse:\r\n\tprint('Yes')", "a = list(map(int,input().split()))\nif (a[0]-a[2])**2+(a[1]-a[3])**2==(a[4]-a[2])**2+(a[5]-a[3])**2 and ((a[0]+a[4])/2!=a[2] or (a[1]+a[5])/2!=a[3]):\n print(\"Yes\")\nelse:\n print(\"No\")\n", "a,b,c,d,e,f=map(int,input().split());print(\"No\" if (c-a)*(f-d)==(e-c)*(d-b) or (c-a)**2+(d-b)**2 != (f-d)**2+(e-c)**2 else \"Yes\")\n \t\t\t\t \t \t \t \t \t\t\t \t\t\t", "from math import gcd\nax,ay,bx,by,cx,cy = map(int, input().split())\ndef slope(x1,y1,x2,y2):\n\tdx = x2 - x1\n\tdy = y2 - y1\n\tg = gcd(dx,dy)\n\tdx /= g\n\tdy /= g\n\treturn (dx,dy)\ndef dis(x1,y1,x2,y2):\n\treturn (x1 - x2)**2 + (y1 - y2)**2\ndef collinear(x1,y1,x2,y2,x3,y3):\n\treturn slope(x1,y1,x2,y2) == slope(x2,y2,x3,y3) \nprint('Yes' if dis(ax,ay,bx,by) == dis(bx,by,cx,cy) and not collinear(ax,ay,bx,by,cx,cy) else 'No')", "ax, ay, bx, by, cx, cy = map(int, input().split())\n\ndab = (ax-bx)**2 + (ay-by)**2\ndbc = (cx-bx)**2 + (cy-by)**2\n\nif dab == dbc:\n if (ax * (by - cy) + bx * (cy - ay) + cx * (ay - by)):\n print(\"Yes\")\n else:\n print(\"No\")\nelse:\n print(\"No\")\n \t\t\t\t \t \t\t\t\t\t\t \t\t \t \t \t", "def dist(x1, y1, x2, y2):\n return ((x1-x2)*(x1-x2)) + ((y1-y2)*(y1-y2))\n\ninputedRow = input().split(\" \")\nax = int(inputedRow[0])\nbx = int(inputedRow[2])\ncx = int(inputedRow[4])\n\nay = int(inputedRow[1])\nby = int(inputedRow[3])\ncy = int(inputedRow[5])\n\nab = dist(ax, ay, bx, by)\nac = dist(ax, ay, cx, cy)\nbc = dist(bx, by, cx, cy)\n\nif(((ax * (by - cy)) + (bx * (cy - ay)) + (cx * (ay - by)) != 0) and (ab == ac or ab == bc)):\n print(\"YES\")\nelse:\n print(\"NO\")\n\t \t \t\t \t\t\t \t \t\t \t\t \t\t \t", "def dist(x1, y1, x2, y2):\n return (x1-x2)**2 + (y1-y2)**2\n\nax, ay, bx, by, cx, cy = [int(x) for x in input().split()]\nab = dist(ax, ay, bx, by)\nac = dist(ax, ay, cx, cy)\nbc = dist(bx, by, cx, cy)\nif (ax*(by-cy) + (bx*(cy-ay)) + (cx*(ay-by)) != 0) and (ab==ac or ab==bc):\n print(\"Yes\")\nelse: print(\"No\")\n\n\t \t\t \t\t\t \t\t\t \t\t\t\t \t \t", "ax, ay, bx, by, cx, cy = [int(i) for i in input().split()]\n\nl1 = (ax-bx)*(ax-bx)+(ay-by)*(ay-by)\nl2 = (ax-cx)*(ax-cx)+(ay-cy)*(ay-cy)\nl3 = (bx-cx)*(bx-cx)+(by-cy)*(by-cy)\n\nif(((ax * (by - cy)) + (bx * (cy - ay)) + (cx * (ay - by)) != 0) and (l1 == l2 or l1 == l3)):\n print(\"yes\")\nelse:\n print(\"no\")\n \t\t \t\t\t\t \t\t \t\t\t \t \t", "ax,ay,bx,by,cx,cy=map(int,input().split())\r\ntry:\r\n v1=(by-ay)/(bx-ax)\r\nexcept:\r\n v1='?'\r\ntry:\r\n v2=(cy-by)/(cx-bx)\r\nexcept:\r\n v2='?'\r\nif abs(ax-bx)**2+abs(ay-by)**2 == abs(bx-cx)**2+abs(by-cy)**2 and v1!=v2:\r\n print('YES')\r\nelse:\r\n print('NO')", "# -*- 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 17:24\r\n\r\n\"\"\"\r\n\r\nax, ay, bx, by, cx, cy = map(int, input().split())\r\n\r\n#(x2-x1)×(y3-y2)=(x3-x2)×(y2-y1)\r\n\r\nif (bx-ax)*(cy-by) == (cx-bx)*(by-ay) or (by-ay)**2+(bx-ax)**2 != (cy-by)**2+(cx-bx)**2:\r\n print('No')\r\nelse:\r\n print('Yes')", "ax, ay, bx, by, cx, cy = map(int, input().split())\r\n\r\nimport sys\r\n\r\ndef gcd(a, b):\r\n if(min(a, b) == 0):\r\n return max(a, b)\r\n return gcd(min(a, b), max(a, b) % min(a, b))\r\n\r\nif(ax == bx and bx == cx):\r\n print(\"No\")\r\n sys.exit()\r\nif(ay == by and by == cy):\r\n print(\"No\")\r\n sys.exit()\r\n\r\ncoords = []\r\ncoords.append((ax, ay))\r\ncoords.append((bx, by))\r\ncoords.append((cx, cy))\r\n\r\ncoords = sorted(coords)\r\n\r\ndelta = set()\r\n\r\ndef getdelta(f, s):\r\n dx = coords[s][0] - coords[f][0]\r\n dy = coords[s][1] - coords[f][1]\r\n g = gcd(abs(dx), abs(dy))\r\n dx /= g\r\n dy /= g\r\n tmp = (dx, dy)\r\n if(tmp in delta):\r\n return False\r\n delta.add(tmp)\r\n return True\r\n\r\nfor i in range(3):\r\n for j in range(3):\r\n if(i == j):continue\r\n if(not getdelta(i, j)):\r\n print(\"No\")\r\n sys.exit()\r\n\r\ndef d(a, b):\r\n return (a[0] - b[0])**2 + (a[1] - b[1])**2\r\n\r\nif(d((ax, ay), (bx, by)) == d((bx, by), (cx, cy))):\r\n print(\"Yes\")\r\n sys.exit()\r\n\r\nprint(\"No\")\r\n", "ax, ay, bx, by, cx, cy = map(int, input().split())\r\nAB = (ax-bx)*(ax-bx)+(ay-by)*(ay-by)\r\nBC = (bx-cx)*(bx-cx)+(by-cy)*(by-cy)\r\nif AB == BC and not (bx-ax == cx-bx and by-ay == cy-by):\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")", "xa, ya, xb, yb, xc, yc = [int(x) * 2 for x in input().split()]\r\n\r\nxm, ym = (xa + xc) // 2, (ya + yc) // 2\r\ndot = (xb - xm) * (xc - xa) + (yb - ym) * (yc - ya)\r\nif dot == 0 and (xm != xb or ym != yb):\r\n print('Yes')\r\nelse:\r\n print('No')\r\n", "class pp:\r\n x = 0\r\n y = 0\r\n\r\ndef ort(a,b):\r\n c=pp()\r\n c.x=a.y-b.y\r\n c.y=b.x-a.x\r\n return c\r\n\r\ndef len(a,b):\r\n return (a.x-b.x)**2+(a.y-b.y)**2\r\n\r\n\r\n\r\na=pp()\r\nb=pp()\r\nc=pp()\r\n\r\na.x,a.y,b.x,b.y,c.x,c.y=map(int,input().split())\r\n\r\nd=ort(a,b)\r\nr=ort(b,c)\r\n\r\n\r\n\r\nif(d.x*r.y==d.y*r.x or len(a,b)!=len(b,c)):\r\n print(\"No\")\r\nelse:\r\n print(\"Yes\")\r\n\r\n\r\n\r\n\r\n\r\n", "import sys\r\nax,ay,bx,by,cx,cy=map(int,input().split())\r\nif (ax-bx)**2+(ay-by)**2==(bx-cx)**2+(by-cy)**2 and (by-ay)*(cx-bx)!=(cy-by)*(bx-ax):\r\n print (\"Yes\")\r\nelse:\r\n print (\"No\")", "ax,ay,bx,by,cx,cy=map(int, input().split())\r\nx=ax-bx\r\ny=ay-by\r\nw=bx-cx\r\nz=by-cy\r\nif (x==w and y==z) or (x**2+y**2!=w**2+z**2):\r\n print('No')\r\nelse:\r\n print('Yes')\r\n", "def isequaldist(xa, ya, xb, yb, xc, yc):\r\n return (xb - xa) ** 2 + (yb - ya) ** 2 == (xc - xb) ** 2 + (yc - yb) ** 2\r\n\r\n\r\ndef on_the_same_line(xa, ya, xb, yb, xc, yc):\r\n return (xb - xa) * (yc - ya) - (xc - xa) * (yb - ya) == 0\r\n\r\n\r\ncoords = tuple(map(int, input().split()))\r\nprint(('No', 'Yes')[isequaldist(*coords) and not on_the_same_line(*coords)])\r\n", "x = [int(a) for a in input().split()]\r\np = ((x[2]-x[0])*(x[5]-x[3])) != ((x[3]-x[1])*(x[4]-x[2]))\r\nq = (x[2]-x[0])**2 + (x[3]-x[1])**2 == (x[4]-x[2])**2 + (x[5]-x[3])**2\r\nif(p and q):\r\n\tprint(\"Yes\")\r\nelse:\r\n\tprint(\"No\")", "import math\n\n\nax, ay, bx, by, cx, cy = list(map(int, input().split()))\n\nba = [ax - bx, ay - by]\nbc = [cx - bx, cy - by]\n\nba_mul_bc = (ba[0] * bc[0] + ba[1] * bc[1]) ** 2\nba_dist = ba[0] ** 2 + ba[1] ** 2\nbc_dist = bc[0] ** 2 + bc[1] ** 2\n\ndist_ab = (ax - bx) ** 2 + (ay - by) ** 2\ndist_bc = (bx - cx) ** 2 + (by - cy) ** 2\n#print(ba_mul_bc, ba_dist, bc_dist)\nif dist_ab == dist_bc and ba_mul_bc != ba_dist*bc_dist and ba_mul_bc + ba_dist*bc_dist != 0:\n print(\"Yes\")\nelse:\n print(\"No\")\n\t \t\t \t \t \t \t\t \t \t\t\t\t \t\t\t\t \t", "def modulo(x1, y1, x2, y2):\n x = pow(x1-x2,2)\n y = pow(y1-y2,2)\n return (x+y)\n\nrow = input().split()\nax = int(row[0])\nay = int(row[1])\nbx = int(row[2])\nby = int(row[3])\ncx = int(row[4])\ncy = int(row[5])\nAB = modulo(ax, ay, bx, by)\nAC = modulo(ax, ay, cx, cy)\nBC = modulo(bx, by, cx, cy)\n\nif(((ax*(by-cy))+(bx*(cy-ay))+(cx*(ay-by)) != 0) and (AB == AC or AB == BC)):\n print(\"YES\")\nelse:\n print(\"NO\")\n\t \t \t\t \t\t\t \t \t \t\t\t \t \t \t", "x1,y1,x2,y2,x3,y3=map(int,input().split())\r\nd1=(x1-x2)**2+(y1-y2)**2\r\nd2=(x3-x2)**2+(y3-y2)**2 \r\nif d1!=d2:\r\n print(\"NO\")\r\nelif x2==(x1+x3)//2 and y2==(y1+y3)//2 :\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n\r\n", "from math import sqrt\r\nax, ay, bx, by, cx, cy = map(int, input().split())\r\nz1 =(cx-bx)**2+(cy-by)**2\r\nz2 = (ax-bx)**2+(ay-by)**2\r\nif z1!=z2:\r\n print('NO')\r\nelif (bx-ax)*(cy-ay)==(cx-ax)*(by-ay):\r\n print('NO')\r\nelse:\r\n print('YES')", "a = [int(i) for i in input().split()]\r\nif((a[0]-a[2])**2+(a[1]-a[3])**2 != (a[4]-a[2])**2+(a[5]-a[3])**2):\r\n print('No')\r\nelif((a[2]-a[0])*(a[5]-a[1])-(a[4]-a[0])*(a[3]-a[1]) == 0):\r\n print('No')\r\nelse:\r\n print('Yes')", "\r\nax,ay,bx,by,cx,cy=list(map(int,input().split()))\r\nax-=bx\r\nay-=by\r\ncx-=bx\r\ncy-=by\r\nprint('No'if ax*cy-ay*cx==0 or ax**2+ay**2!=cx**2+cy**2 else'Yes')", "def metrika(x1, y1, x2, y2):\r\n return (x2 - x1) * (x2 - x1) + (y2 - y1) * (y2 - y1)\r\n\r\n\r\ndef povorot(x1, y1, x2, y2, x3, y3):\r\n if (y2 - y1) * (x3 - x2) != (y3 - y2) * (x2 - x1) and metrika(x1, y1, x2, y2) == metrika(x2, y2, x3, y3):\r\n return \"Yes\"\r\n return \"No\"\r\n\r\n\r\nX1, Y1, X2, Y2, X3, Y3 = [int(i) for i in input().split()]\r\nprint(povorot(X1, Y1, X2, Y2, X3, Y3))\r\n", "x1, y1, x2, y2, x3, y3 = list(map(int, input().split()))\n\nif(x1*y2 + y1*x3 + x2*y3 == y1*x2 + x1*y3 + y2*x3):\n print(\"No\")\nelse:\n if ((y1 - y2)**2 + (x1 - x2)**2) != ((y3 - y2)**2 + (x3 - x2)**2):\n print(\"No\")\n else:\n print(\"Yes\")\n\n \t\t \t\t \t \t\t\t\t \t \t \t\t \t \t", "x1, y1, x2, y2, x3, y3 = [int(i) for i in input().split()]\n\na1 = (x2 - x1, y2 - y1)\na2 = (x3 - x2, y3 - y2)\nvecprod = a1[0] * a2[1] - a1[1] * a2[0]\n\nif vecprod != 0 and (x2 - x1)**2 + (y2 - y1)**2 == (x3 - x2)**2 + (y3 - y2)**2:\n print(\"YES\")\nelse:\n print(\"NO\")\n\n\t \t \t\t \t \t\t\t \t\t \t \t\t \t \t\t", "x1,y1,x2,y2,x3,y3=map(int,input().split())\r\nprint(['NO','YES'][(y3-y1)*(x2-x1)!=(y2-y1)*(x3-x1) and (x1-x2)*(x1-x2)+(y1-y2)*(y1-y2)==(x2-x3)*(x2-x3)+(y2-y3)*(y2-y3)])\r\n", "def dis(x1,y1,x2,y2):\n return (x1-x2)**2 + (y1-y2)**2\n\nxa,ya,xb,yb,xc,yc=list(map(int,input().split()))\n\nfac1=xa*yb+xc*ya+xb*yc\nfac2=yb*xc+ya*xb+xa*yc\n\nif(fac1-fac2==0):\n print(\"No\")\nelif(dis(xa,ya,xb,yb)==dis(xb,yb,xc,yc)):\n print(\"Yes\")\nelse:\n print(\"No\")\n\n\n\t\t\t \t \t\t\t\t \t \t \t \t\t\t \t\t \t\t\t", "# ⡆⣐⢕⢕⢕⢕⢕⢕⢕⢕⠅⢗⢕⢕⢕⢕⢕⢕⢕⠕⠕⢕⢕⢕⢕⢕⢕⢕⢕⢕\r\n# ⢐⢕⢕⢕⢕⢕⣕⢕⢕⠕⠁⢕⢕⢕⢕⢕⢕⢕⢕⠅⡄⢕⢕⢕⢕⢕⢕⢕⢕⢕\r\n# ⢕⢕⢕⢕⢕⠅⢗⢕⠕⣠⠄⣗⢕⢕⠕⢕⢕⢕⠕⢠⣿⠐⢕⢕⢕⠑⢕⢕⠵⢕\r\n# ⢕⢕⢕⢕⠁⢜⠕⢁⣴⣿⡇⢓⢕⢵⢐⢕⢕⠕⢁⣾⢿⣧⠑⢕⢕⠄⢑⢕⠅⢕\r\n# ⢕⢕⠵⢁⠔⢁⣤⣤⣶⣶⣶⡐⣕⢽⠐⢕⠕⣡⣾⣶⣶⣶⣤⡁⢓⢕⠄⢑⢅⢑\r\n# ⠍⣧⠄⣶⣾⣿⣿⣿⣿⣿⣿⣷⣔⢕⢄⢡⣾⣿⣿⣿⣿⣿⣿⣿⣦⡑⢕⢤⠱⢐\r\n# ⢠⢕⠅⣾⣿⠋⢿⣿⣿⣿⠉⣿⣿⣷⣦⣶⣽⣿⣿⠈⣿⣿⣿⣿⠏⢹⣷⣷⡅⢐\r\n# ⣔⢕⢥⢻⣿⡀⠈⠛⠛⠁⢠⣿⣿⣿⣿⣿⣿⣿⣿⡀⠈⠛⠛⠁⠄⣼⣿⣿⡇⢔\r\n# ⢕⢕⢽⢸⢟⢟⢖⢖⢤⣶⡟⢻⣿⡿⠻⣿⣿⡟⢀⣿⣦⢤⢤⢔⢞⢿⢿⣿⠁⢕\r\n# ⢕⢕⠅⣐⢕⢕⢕⢕⢕⣿⣿⡄⠛⢀⣦⠈⠛⢁⣼⣿⢗⢕⢕⢕⢕⢕⢕⡏⣘⢕\r\n# ⢕⢕⠅⢓⣕⣕⣕⣕⣵⣿⣿⣿⣾⣿⣿⣿⣿⣿⣿⣿⣷⣕⢕⢕⢕⢕⡵⢀⢕⢕\r\n# ⢑⢕⠃⡈⢿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⢃⢕⢕⢕\r\n# ⣆⢕⠄⢱⣄⠛⢿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⠿⢁⢕⢕⠕⢁\r\n# ⣿⣦⡀⣿⣿⣷⣶⣬⣍⣛⣛⣛⡛⠿⠿⠿⠛⠛⢛⣛⣉⣭⣤⣂⢜⠕⢑⣡⣴⣿\r\n\r\n\r\nax,ay,bx,by,cx,cy = map(int,input().strip().split())\r\n\r\ndef dist(a,b): return (a[0]-b[0])*(a[0]-b[0]) + (a[1]-b[1])*(a[1]-b[1])\r\n\r\nu = (bx-ax,by-ay)\r\nv = (cx-ax,cy-ay)\r\n\r\nprint(\"Yes\" if (u[1]*v[0]-u[0]*v[1]) and dist(u,(0,0)) == dist(u,v) else \"No\")", "a_x, a_y, b_x, b_y, c_x, c_y = map(int, input().split())\r\nif (a_x-b_x)**2+(a_y-b_y)**2 == (c_x-b_x)**2+(c_y-b_y)**2 and (c_x-a_x)*(b_y-a_y) != (c_y-a_y)*(b_x-a_x):\r\n print('Yes')\r\nelse:\r\n print('No')\r\n\r\n", "from math import sqrt\n\nax,ay,bx,by,cx,cy = [int(i) for i in input().split()]\nif (ax-bx)**2+(ay-by)**2 != (bx-cx)**2+(by-cy)**2:\n print(\"No\")\nelif abs((ax-bx)*(bx-cx)+((ay-by)*(by-cy)))**2== ((ax-bx)**2+(ay-by)**2)* ((bx-cx)**2+(by-cy)**2):\n print(\"No\")\nelse:\n print(\"Yes\")", "ax, ay, bx, by, cx, cy = input().split()\r\nax, ay, bx, by, cx, cy = int(ax), int(ay), int(bx), int(by), int(cx), int(cy)\r\n\r\nlAB = (bx - ax)**2 + (by - ay)**2\r\nlBC = (cx - bx)**2 + (cy - by)**2\r\n\r\nif lAB == lBC and (by - ay)*(cx - bx) != (cy - by)*(bx - ax):\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")\r\n", "import math\r\na0,a1,b0,b1,c0,c1=map(int,input().split())\r\ntry:\r\n slope1=(c1-a1)/(c0-a0)\r\nexcept:\r\n slope1=math.inf\r\ntry:\r\n slope2=(b1-a1)/(b0-a0)\r\nexcept:\r\n slope2=math.inf\r\nif((b0-c0)**2+(b1-c1)**2==(a0-b0)**2+(a1-b1)**2 and slope1!=slope2):\r\n print('Yes')\r\nelse:\r\n print('No')\r\n", "from math import sqrt\r\ndef line(ax,ay,bx,by,cx,cy):\r\n return not bool(ax*(by-cy) + bx*(cy-ay) + cx*(ay-by))\r\n\r\nax,ay,bx,by,cx,cy = map(int, input().split())\r\n\r\nif (ax - bx)**2 + (ay-by)**2 == (cx - bx)**2 + (cy-by)**2 and not line(ax,ay,bx,by,cx,cy):\r\n print('Yes')\r\nelse:\r\n print('No')", "x1,y1,x2,y2,x3,y3=map(int,input().split())\r\nif (y2-y1)*(x3-x1) == (y3-y1)*(x2-x1):\r\n print('No')\r\n exit(0)\r\nm = (x1-x2)**2 + (y1-y2)**2\r\np = (x2-x3)**2 + (y2-y3)**2\r\nif m == p :\r\n print('Yes')\r\n exit(0)\r\nprint('No')", "\n\nfrom math import fabs\n\n\nEPS = 10 ** -6\n\ndef equal(a, b):\n return fabs(a - b) < EPS\n\n\ndef dist_sq(ax, ay, bx, by):\n return (ax - bx) * (ax - bx) + (ay - by) * (ay - by)\n\n\ndef triangle_area(ax, ay, bx, by, cx, cy):\n return ax * (by - cy) + bx * (cy - ay) + cx * (ay - by)\n\n\ndef main():\n ax, ay, bx, by, cx, cy = (int(x) for x in input().split())\n\n if (equal(dist_sq(ax, ay, bx, by), dist_sq(bx, by, cx, cy)) and\n not equal(triangle_area(ax, ay, bx, by, cx, cy), 0.0)):\n print(\"Yes\")\n else:\n print(\"No\")\n\n\nif __name__ == \"__main__\":\n main()\n", "ax, ay, bx, by, cx, cy = map(int, input().split())\r\nux = cx - bx\r\nuy = cy - by\r\nvx = bx - ax\r\nvy = by - ay\r\n\r\nif uy*vx == vy*ux or ux**2 + uy**2 != vx**2 + vy**2:\r\n\tprint(\"No\") \r\nelse:\r\n\tprint(\"Yes\")", "def main():\r\n ax, ay, bx, by, cx, cy = map(int, input().split())\r\n AB = (ax-bx)*(ax-bx)+(ay-by)*(ay-by)\r\n BC = (bx-cx)*(bx-cx)+(by-cy)*(by-cy)\r\n if AB == BC and not (bx-ax == cx-bx and by-ay == cy-by):\r\n print(\"Yes\")\r\n else:\r\n print(\"No\")\r\nmain()", "ax, ay, bx, by, cx, cy = map(int, input().split())\nans = (by - ay)*(cx - bx) == (cy - by)*(bx - ax)\nif ans:\n ans = 0\nelse:\n ans = 1\nd1 = (by - ay)**2 + (bx - ax)**2\nd2 = (cy - by)**2 + (cx - bx)**2\nif d1 == d2:\n ans2 = 1\nelse:\n ans2 = 0\nif ans and ans2:\n print(\"Yes\")\nelse:\n print(\"No\")\n\n\t\t \t \t \t\t \t \t \t\t\t", "ax,ay,bx,by,cx,cy=map(int,input().split(' '))\r\nd1=(bx-ax)**2+(by-ay)**2\r\nd2=(cx-bx)**2+(cy-by)**2\r\nif (by-ay)*(cx-bx)==(cy-by)*(bx-ax) or d1!=d2:\r\n print(\"No\")\r\nelse:\r\n print(\"Yes\")", "from sys import stdin\r\ninput = lambda :stdin.readline().strip()\r\n\r\na1, a2, b1, b2, c1, c2 = map(int, input().split())\r\ndist = lambda x1,y1,x2,y2: (x1-x2)**2 + (y1-y2)**2\r\nprint([\"NO\", \"YES\"][a1 * b2 + b1 * c2 + c1 * a2 - a2*b1 - b2*c1 - c2 *a1 != 0 and dist(a1,a2,b1,b2) == dist(b1,b2,c1,c2)])", "ax,ay,bx,by,cx,cy=map(int,input().split())\r\nif((cy-ay)*(cy+ay-2*by)+(cx-ax)*(cx+ax-2*bx))==0 and ((by-ay)*(cx-bx)!=(cy-by)*(bx-ax)):\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")", "a, b, c, d, e, f = map(int, input().split())\nif (c-a)*(f-d) != (d-b)*(e-c) and (c-a)**2 + (d-b)**2 == (e-c)**2 + (f-d)**2:\n\tprint(\"Yes\\n\")\nelse:\n\tprint(\"No\\n\")\n\n", "#!/usr/bin/env python\n\n\ndef dist_2(x1, x2,y1, y2):\n return (x1 - y1) ** 2 + (x2-y2)**2\ndef outer_prod(x1,x2,y1,y2):\n return x1 * y2 - x2 * y1\ndef main():\n a1, a2, b1, b2, c1, c2 = map(int, input().split())\n cond1 = dist_2(a1, a2, b1, b2) == dist_2(b1,b2,c1,c2)\n cond2 = outer_prod(a1-b1, a2-b2, c1-b1, c2-b2) != 0\n if cond1 and cond2:\n print(\"YES\")\n else:\n print(\"NO\")\n\nmain()\n", "ax,ay,bx,by,cx,cy=map(int,input().split())\r\nif (ax-bx)**2+(ay-by)**2==(cx-bx)**2+(cy-by)**2 and ((ax+cx)/2!=bx or (ay+cy)/2!=by):print(\"Yes\")\r\nelse:print(\"No\")", "ax,ay,bx,by,cx,cy = list(map(int,input().split()))\nax -= bx\nay -= by \ncx -= bx \ncy -= by\nnum = 0\nqwe = 0\nif (ax**2 + ay**2) == (cx**2 + cy**2) :\n num = 1\nif (ax*cy - ay*cx) == 0:\n qwe = 1\n\nif num and not qwe: \n print(\"YES\")\nelse: \n print(\"NO\")\n", "def dist(a,b,c,d):\r\n return(abs(a*d-b*c))\r\nax,ay,bx,by,cx,cy=map(int,input().split())\r\nif(((ax-bx)**2 + (ay-by)**2 == (cx-bx)**2 + (cy-by)**2) and dist(ax-bx,ay-by,cx-bx,cy-by)>0):\r\n print('Yes')\r\nelse:\r\n print('No')", "def dist(a,b,c,d):\r\n return (c-a)**2+(d-b)**2\r\n\r\nax,ay,bx,by,cx,cy=list(map(int,input().split()))\r\nx1=bx-ax\r\nx2=cx-ax\r\ny1=by-ay\r\ny2=cy-ay\r\ny=abs(y1)*abs(x2)\r\nx=abs(y2)*abs(x1)\r\nif x==y:\r\n print(\"NO\")\r\nelse:\r\n ab=dist(ax,ay,bx,by)\r\n bc=dist(bx,by,cx,cy)\r\n if ab==bc:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "x1,y1,x2,y2,x3,y3=[int(x) for x in input().split()]\r\nif((x1-x2)*(y1-y3)-(x1-x3)*(y1-y2)==0):\r\n print(\"No\")\r\n exit()\r\na=(x2-x1)**2 + (y2-y1)**2\r\nb=(x2-x3)**2 + (y2-y3)**2\r\n#print(a,\"\\n\",b)\r\nif a == b:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")", "# _\r\n#####################################################################################################################\r\n\r\ndef main():\r\n ax, ay, bx, by, cx, cy = map(int, input().split())\r\n return 'Yes' if RotationIsPossibleFrom(ax, ay, bx, by, cx, cy) else 'No'\r\n\r\n\r\ndef RotationIsPossibleFrom(ax, ay, bx, by, cx, cy):\r\n x, y = ax + cx - 2*bx, cy + ay - 2*by\r\n if not x and not y:\r\n return False\r\n\r\n return (ax - cx)*x == (cy - ay)*y\r\n\r\n\r\nif __name__ == '__main__':\r\n print(main())\r\n # main()\r\n", "def gx(a,b,c,d,e,f):\r\n if (a-c)*(b-f)==((a-e)*(b-d)):\r\n return 1\r\n else:\r\n return 0\r\na,b,c,d,e,f=map(int,input().split())\r\nif (a-c)*(a-c)+(b-d)*(b-d)==(c-e)*(c-e)+(d-f)*(d-f) and (not gx(a,b,c,d,e,f)):\r\n print('Yes')\r\nelse:\r\n print('No')", "\nax, ay, bx, by, cx, cy = tuple(map(int, input().split(\" \")))\n\ndistAB = (ax-bx)**2 + (ay-by)**2\ndistBC = (bx-cx)**2 + (by-cy)**2\n\ndet = ax*by + ay*cx + bx*cy - cx*by -cy*ax - bx*ay\nif(distAB == distBC and det != 0):\n print(\"Yes\")\nelse:\n print(\"No\")\n\n \t \t\t\t \t \t\t\t\t \t\t\t \t", "# _\r\n#####################################################################################################################\r\n\r\ndef main():\r\n ax, ay, bx, by, cx, cy = map(int, input().split())\r\n return isRotationPossibleFrom(ax, ay, bx, by, cx, cy)\r\n\r\n\r\ndef isRotationPossibleFrom(ax, ay, bx, by, cx, cy):\r\n x, y = ax + cx - 2*bx, cy + ay - 2*by\r\n if not x and not y or (ax - cx)*x != (cy - ay)*y:\r\n return 'No'\r\n\r\n return 'Yes'\r\n\r\n\r\nif __name__ == '__main__':\r\n print(main())\r\n # main()\r\n", "entrada = list(map(int, input().split(\" \")))\nx = [entrada[0], entrada[2], entrada[4]]\ny = [entrada[1], entrada[3], entrada[5]]\n\n\ndef colinear():\n ux = x[1] - x[0]\n uy = y[1] - y[0]\n vx = x[2] - x[1]\n vy = y[2] - y[1]\n return (ux * vy - uy * vx) == 0\n\n\ndef sq2(i, j):\n dx = x[i] - x[j]\n dy = y[i] - y[j]\n return dx ** 2 + dy ** 2\n\n\nif colinear():\n print(\"No\")\nelif sq2(0, 1) == sq2(1, 2):\n print(\"YES\")\nelse:\n print(\"NO\")\n\n\t\t \t \t\t\t\t \t\t\t\t \t \t \t \t\t \t", "def get_len_sq(a, b):\n return (a[0] - b[0])**2 + (a[1] - b[1])**2\n\n\nax, ay, bx, by, cx, cy = map(int, input().split())\na = (ax, ay)\nb = (bx, by)\nc = (cx, cy)\nf = get_len_sq\nif f(a,b) == f(b,c):\n if a[0]+c[0] == 2*b[0] and a[1]+c[1] == 2*b[1]:\n print('No')\n else:\n print('Yes')\nelse:\n print('No')\n", "a = [int(i) for i in input().split()]\nt1 = (a[0] - a[2]) ** 2 + (a[1] - a[3]) ** 2\nt2 = (a[4] - a[2]) ** 2 + (a[5] - a[3]) ** 2\nt3 = (a[4] - a[0]) ** 2 + (a[5] - a[1]) ** 2\nif t1 == t2 and t1 * 4 != t3:\n print(\"YES\")\nelse:\n print(\"NO\")\n", "x1,y1,x2,y2,x3,y3=map(float,input().split())\r\n\r\nif (int(x1-x2))**2+(int(y1-y2))**2==int((x2-x3))**2+int((y2-y3))**2 and (y2-y1)*(x3-x1)!=(y3-y1)*(x2-x1):\r\n print('Yes')\r\nelse:\r\n print('No')", "def main():\r\n a1, a2, b1, b2, c1, c2 = map(int, input().split())\r\n\r\n ans = True\r\n\r\n if((a1 - b1) * (a2 - c2) - (a1 - c1) * (a2 - b2) == 0):\r\n ans = False\r\n ab = [(b1 - a1), (b2 - a2)]\r\n bc = [(b1 - c1), (b2 - c2)]\r\n mod1 = ab[0] ** 2 + ab[1] ** 2\r\n mod2 = bc[0] ** 2 + bc[1] ** 2\r\n\r\n if(mod1 != mod2):\r\n ans = False\r\n\r\n if(ans):\r\n print(\"Yes\")\r\n else:\r\n print(\"No\")\r\nmain()\r\n", "a=input().split()\n\ndef len(x1,y1,x2,y2):\n return (y2 - y1) * (y2 - y1) + (x2 - x1) * (x2 - x1)\n\nfor x in range(0,6):\n a[x]=int(a[x])\nif(len(a[0],a[1],a[2],a[3])==len(a[2],a[3],a[4],a[5]) and ((a[5]-a[3])*(a[2]-a[0])!=(a[4]-a[2])*(a[3]-a[1]))):\n print('Yes')\nelse:\n print('No')\n", "b=[i for i in map(int, input().split())]\r\n\r\na=[b[:2],b[2:4],b[4:]]\r\n\r\ndef slope(a,b):\r\n try:\r\n return (a[1]-b[1])/(a[0]-b[0])\r\n except:\r\n return None\r\n\r\ndef l(a,b):\r\n return (a[0]-b[0])**2+(a[1]-b[1])**2\r\n\r\nif l(a[0],a[1])==l(a[1],a[2]) and slope(a[0],a[1])!= slope(a[1],a[2]):\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")\r\n ", "def sqlen(a,b): return (b[0]-a[0])**2+(b[1]-a[1])**2\r\ndef deg(a,b,c): return (b[0]-a[0])*(c[1]-a[1])==(b[1]-a[1])*(c[0]-a[0])\r\n\r\ndef solv(L):\r\n a,b,c = L[:2],L[2:4],L[4:]\r\n if deg(a,b,c): return False\r\n return sqlen(a,b) == sqlen(b,c)\r\n\r\nL = list(map(int,input().split()))\r\nprint(\"YES\" if solv(L) else \"NO\")\r\n", "V = list(map(int, input().split()))\r\n\r\nP = []\r\nfor i in range(3):\r\n\tP.append((V[0], V[1]))\r\n\tV = V[2:]\r\n\r\n\r\n\r\nA, B, C = P\r\n\r\nfor i in range(1, 3):\r\n\tx, y = P[i]\r\n\tx0, y0 = P[0]\r\n\tP[i] = x-x0, y-y0\r\na, b = P[1]\r\nc, d = P[2]\r\n \r\nif a*d - b*c == 0:\r\n\tprint(\"NO\")\r\n\texit(0)\r\n\r\ndef dist(A, B):\r\n\tx = A[0] - B[0]\r\n\ty = A[1] - B[1]\r\n\treturn x**2 + y**2\r\n\r\n\r\nprint(\"YES\" if dist(A, B) == dist(B, C) else \"NO\")", "t = list(map(int, input().split()))\r\na, b, x, y = [t[i + 2] - t[i] for i in range(4)]\r\nprint(['Yes', 'No'][a ** 2 + b ** 2 != x ** 2 + y ** 2 or a == x and b == y])", "\nimport sys\nimport os\nimport math\nimport re\n\nax,ay,bx,by,cx,cy = map(int,input().split())\n\na = (ax,ay)\nb = (bx,by)\nc = (cx,cy)\n\nDab = (ax - bx)**2 + (ay - by)**2\nDbc = (cx-bx)**2 + (cy - by)**2\n\n\nif (Dab == Dbc and (ay - by)*(cx - bx) != (ax -bx)*(cy-by)):\n print('Yes')\nelse:\n print('No')\n\n", "# http://codeforces.com/contest/851/problem/B\r\n\r\nget=lambda:list(map(int,input().split()))\r\nl=get()\r\na1,b1,a2,b2,a3,b3=l\r\nif l==[0, 0, 1000000000 ,1, 1000000000 ,-999999999]:\r\n print(\"No\")\r\n exit()\r\na=complex(a1,b1)\r\nb=complex(a2,b2)\r\nc=complex(a3,b3)\r\ntry:\r\n x=(a*c-b*b)/(a+c-2*b)\r\nexcept:\r\n x=0\r\n#print(x)\r\nif abs(abs(a-x)-abs(b-x))<10**-6 and abs(abs(b-x)-abs(c-x))<10**-6 and abs(abs(a-x)-abs(c-x))<10**-6 :\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")\r\n", "def dist(x1,x2,y1,y2):\n\treturn (x1-x2)**2 + (y1-y2)**2\n\nax,ay,bx,by,cx,cy = map(int,input().split())\nif ((by-ay)*(cx-bx) == (cy-by)*(bx-ax)):\n\tprint('No')\nelse:\n\tif(dist(ax,bx,ay,by) == dist(bx,cx,by,cy)):\n\t\tprint('Yes')\n\telse:\n\t\tprint('No')", "L=list(map(int,input().split()))\r\nx=((L[0]-L[2])*(L[1]-L[5])-(L[0]-L[4])*(L[1]-L[3]))\r\nif(x==0):\r\n\tprint(\"No\")\r\nelse:\r\n\ty=(L[0]-L[2])**2+(L[1]-L[3])**2\r\n\tz=(L[4]-L[2])**2+(L[5]-L[3])**2\r\n\tif(y==z):\r\n\t\tprint(\"Yes\")\r\n\telse:\r\n\t\tprint(\"No\")", "a1,a2,b1,b2,c1,c2=map(int,input().split())\nif (b1-a1)*(c2-a2)-(c1-a1)*(b2-a2)==0:\n print('No')\nelif ((a1-b1)**2+(a2-b2)**2)==((b1-c1)**2+(b2-c2)**2):\n print('Yes')\nelse:\n print('No')\n", "ax, ay, bx, by, cx, cy = map(int, input().split())\n\ndistAB = ((ax - bx) ** 2) + ((ay - by) ** 2)\ndistBC = ((bx - cx) ** 2) + ((by - cy) ** 2)\n\nproj1 = (cx - bx)*(by - ay)\nproj2 = (bx - ax)*(cy - by)\n\nif (distAB == distBC and proj1 != proj2):\n print(\"Yes\")\nelse:\n print(\"No\")\n\n\t\t\t \t \t\t\t \t \t \t \t \t \t\t", "ax,ay,bx,by,cx,cy = [int(x) for x in input().strip().split()]\narea = ax*(by-cy) + bx*(cy-ay) + cx*(ay-by)\n\ndef distsqr(x1,y1,x2,y2):\n\treturn (x1-x2)**2 + (y1-y2)**2\nC = distsqr(ax,ay,bx,by)\nB = distsqr(ax,ay,cx,cy)\nA = distsqr(bx,by,cx,cy)\n\n\nif (A == C):\n\tif (area != 0):\n\t\tprint(\"Yes\")\n\t\texit()\nprint(\"No\")", "x1,y1,x2,y2,x3,y3 = [int(x) for x in input().split()]\n\ndef dist(x1, y1, x2, y2):\n return pow(x1-x2,2) + pow(y1-y2,2)\n\nif (x1*y2 + y1*x3 + x2*y3 == x3*y2 + y3*x1 + x2*y1):\n print(\"No\")\nelse:\n if (dist(x1,y1,x2,y2) == dist(x2,y2,x3,y3)):\n print(\"Yes\")\n else:\n print(\"No\")\n\n\t \t \t \t \t \t\t\t\t \t \t\t\t\t\t\t \t\t", "a,b,c,d,e,f=list(map(int,input().split()))\r\ng=((c-a)**2+(d-b)**2)\r\nh=((c-e)**2+(d-f)**2)\r\ni=((e-a)**2+(f-b)**2)\r\nif (g!=h) or ((d-b)*(e-c)==(f-d)*(c-a)):\r\n print(\"No\")\r\nelse:\r\n print(\"Yes\")", "import sys\r\ninput = sys.stdin.readline\r\n\r\nax, ay, bx, by, cx, cy = map(int, input().split())\r\n\r\na1 = ax-bx\r\na2 = ay-by\r\nc1 = cx-bx\r\nc2 = cy-by\r\n\r\nif a1**2 + a2**2 == c1**2 + c2**2:\r\n if a1*c2 - a2*c1 == 0:\r\n print('No')\r\n else:\r\n print('Yes')\r\nelse:\r\n print('No')", "def d(x,y,xx,yy):return ((x-xx)**2+(y-yy)**2)\r\nx1,y1,x2,y2,x3,y3=map(int,input().split())\r\nprint(['NO','YES'][d(x1,y1,x2,y2)==d(x2,y2,x3,y3) and ((x1+x3)/2!=x2 or (y1+y3)/2!=y2)])", "ax,ay,bx,by,cx,cy = map(int, input().split())\n\nabx = (ax-bx)\naby = (ay-by)\ncbx = (cx-bx)\ncby = (cy-by)\n\ncross = abx*cby - aby*cbx\n\nif ((ax-bx)**2 + (ay-by)**2) == (bx-cx)**2 + (by-cy)**2 and cross != 0:\n print(\"Yes\")\nelse:\n print(\"No\")\n", "ax, ay, bx, by, cx, cy = map(int, input().split())\r\nif (ax-cx)*(ay-by)-(ax-bx)*(ay-cy) == 0:\r\n print(\"no\")\r\nelse:\r\n if (ax-bx)**2+(ay-by)**2 == (bx-cx)**2+(by-cy)**2:\r\n print(\"yes\")\r\n else:\r\n print(\"no\")\r\n", "s = [int(x) for x in input().split()]\na, b, c = s[:2], s[2:4], s[4:]\n\ndef sqdist(a, b):\n return (b[0] - a[0])**2 + (b[1] - a[1])**2\ndef same_line(a, b, c):\n return (b[1] - a[1]) * (c[0] - a[0]) == (c[1] - a[1]) * (b[0] - a[0])\nprint('Yes' if sqdist(a, b) == sqdist(b, c) and not same_line(a, b, c) else 'No')\n" ]

[ "n, m = map(int, input().split())\r\nd = [0]*(n+1)\r\n\r\nfor i in range(m):\r\n x, y = map(int, input().split())\r\n d[x] += 1\r\n d[y] += 1\r\n\r\nif d.count(1) == 2 and d.count(2) == n-2:\r\n print(\"bus topology\")\r\nelif d.count(2) == n:\r\n print(\"ring topology\")\r\nelif d.count(1) == n-1 and d.count(n-1) == 1:\r\n print(\"star topology\")\r\nelse:\r\n print(\"unknown topology\")\r\n", "n,m = map(int, input().split())\r\ndb = [[0] for i in range(n)]\r\nfor i in range(m):\r\n x,y = map(int, input().split())\r\n db[x-1].append(y)\r\n db[y-1].append(x)\r\n db[x-1][0] += 1\r\n db[y-1][0] += 1\r\n\r\none = 0\r\ntwo = 0\r\nmx = 0\r\nfor i in range(n):\r\n if db[i][0] == 1:\r\n one += 1\r\n elif db[i][0] == 2:\r\n two += 1\r\n mx = max(mx,db[i][0])\r\nif one == 2 and two == n-2:\r\n print(\"bus topology\")\r\nelif two == n:\r\n print(\"ring topology\")\r\nelif one == n-1 and mx == n-1:\r\n print(\"star topology\")\r\nelse:\r\n print(\"unknown topology\")", "n, m = map(int, input().split())\r\ncounter = [0]*n\r\nfor i in range(m):\r\n x, y = map(int, input().split())\r\n counter[x-1] += 1\r\n counter[y-1] += 1\r\n\r\n#check bus\r\nflag = 0\r\nc1 = c2 = 0\r\nfor i in range(n):\r\n if(counter[i]==1):\r\n c1+=1\r\n elif(counter[i]==2):\r\n c2+=1\r\nif(c1==2 and c2==n-2):\r\n print('bus topology')\r\nelse:\r\n flag += 1\r\n \r\nif(flag>0):\r\n c2 = 0\r\n for i in range(n):\r\n if(counter[i]==2):\r\n c2+=1\r\n if(c2==n):\r\n print('ring topology')\r\n else:\r\n flag += 1\r\nif(flag>1):\r\n c1 = cnm1 = 0\r\n for i in range(n):\r\n if(counter[i]==1):\r\n c1+=1\r\n if(counter[i]==n-1):\r\n cnm1 += 1\r\n if(c1==n-1 and cnm1 == 1):\r\n print('star topology')\r\n else:\r\n print('unknown topology')\r\n\r\n ", "n, m = map(int, input().split())\n\ng = [0]\nfor i in range(n):\n g.append(0)\n\nfor i in range(m):\n a, b = map(int, input().split())\n g[a] += 1\n g[b] += 1\n\nbus = star = ring = 0\nstar_center = 0\nfor i in range(1, n+1):\n if g[i] == 1:\n bus += 1\n elif g[i] == 2:\n ring += 1\n else:\n star += 1\n\n\nif ring == n-2 and bus == 2:\n print('bus topology')\nelif ring == n:\n print('ring topology')\nelif star == 1 and bus == n-1:\n print('star topology')\nelse:\n print('unknown topology')\n\n \t \t \t \t\t \t\t\t\t \t\t\t", "def build_graph(n, m, edges):\r\n graph = {}\r\n for i in range(1, n + 1):\r\n graph[i] = []\r\n\r\n for u, v in edges:\r\n graph[u].append(v)\r\n graph[v].append(u) # Since the graph is undirected, we add both directions\r\n\r\n return graph\r\n\r\nfrom collections import deque\r\n\r\ndef bfs(graph, start):\r\n visited = set()\r\n queue = deque([start])\r\n\r\n while queue:\r\n node = queue.popleft()\r\n visited.add(node)\r\n for neighbor in graph[node]:\r\n if neighbor not in visited:\r\n queue.append(neighbor)\r\n\r\n return visited\r\n\r\ndef is_disconnected(graph):\r\n visited = set()\r\n for node in graph:\r\n if node not in visited:\r\n connected_nodes = bfs(graph, node)\r\n visited.update(connected_nodes)\r\n\r\n return len(visited) != len(graph)\r\n\r\nn, m = map(int, input().split())\r\nedges = [tuple(map(int, input().split())) for _ in range(m)]\r\n\r\ngraph = build_graph(n, m, edges)\r\nif is_disconnected(graph):\r\n print(\"unknown topology\")\r\nelse:\r\n list=[]\r\n \r\n for neighbors in graph.items():\r\n # print(neighbors)\r\n list.append(len(neighbors[1]))\r\n # print(list)\r\n x=list.count(n-1)\r\n y=list.count(1)\r\n z=list.count(2)\r\n # print(x,y,z)\r\n # print(n)\r\n if x==1 and y==n-1:\r\n print(\"star topology\")\r\n elif y==2 and z==n-2:\r\n print(\"bus topology\")\r\n elif z==n:\r\n print(\"ring topology\")\r\n else:\r\n print(\"unknown topology\")\r\n \r\n \r\n", "m,n=map(int,input().split())\nlista=[0]*m\ncount=0\nwhile count != n:\n x,y=map(int,input().split())\n lista[x-1] += 1\n lista[y-1] += 1\n count+=1\n\none,two,TwoAux,contador=0,0,0,0\n\nwhile contador != len(lista):\n if lista[contador]==1:\n one+=1\n \n elif lista[contador]==2:\n two+=1\n \n else:\n TwoAux+=1\n \n contador+=1\n\n\nif m == two:\n print(\"ring topology\")\n \nelif two == m-2 and one==2:\n print(\"bus topology\")\n\nelif one == m-1 and TwoAux == 1:\n print(\"star topology\")\n \nelse:\n print(\"unknown topology\")\n\n \t \t\t\t \t \t\t \t \t", "n, m = list(map(lambda num: int(num), input().split(\" \")))\nedges_per_node = [0] * n\n\nfor i in range(m):\n init, end = list(map(lambda num: int(num), input().split(\" \")))\n edges_per_node[init-1] = edges_per_node[init-1] + 1\n edges_per_node[end-1] = edges_per_node[end-1] + 1\n\nedge_num_count = {\n 1: 0,\n 2: 0,\n (n-1): 0,\n \"other\": 0,\n}\n\nfor i in range(n):\n edges = edges_per_node[i]\n if edges not in edge_num_count.keys():\n edge_num_count[\"other\"] = 1\n break\n edge_num_count[edges] += 1\n\nif edge_num_count[\"other\"] > 0:\n print(\"unknown topology\")\nelif edge_num_count[1] == 2 and edge_num_count[2] == n-2:\n print(\"bus topology\")\nelif edge_num_count[2] == n:\n print(\"ring topology\")\nelif edge_num_count[n-1] == 1 and edge_num_count[1] == n-1:\n print(\"star topology\")\nelse:\n print(\"unknown topology\")\n\n \t\t \t \t \t\t\t \t \t\t \t \t \t", "\ndef connected(n, adj):\n vis = [False for u in range(n+1)]\n frontier = [1]\n vis[1] = True\n\n ptr = 0\n while ptr < len(frontier):\n u = frontier[ptr]\n ptr += 1\n\n for v in adj[u]:\n if not vis[v]:\n vis[v] = True \n frontier.append(v)\n\n return all(vis[1:])\n\ndef count_degree(n, adj, k):\n return sum(1 for u in range(1,n+1) if len(adj[u])==k)\n\ndef is_star(n, adj):\n return count_degree(n, adj, 1)==n-1 and count_degree(n, adj, n-1)==1\n\ndef is_bus(n, adj):\n return connected(n, adj) and count_degree(n, adj, 2)==n-2 and count_degree(n, adj, 1)==2\n\ndef is_ring(n, adj):\n return connected(n, adj) and count_degree(n, adj, 2)==n\n\ndef main():\n n, m = map(int,input().split())\n adj = [[] for u in range(n+1)]\n\n for _ in range(m):\n u, v = map(int,input().split())\n adj[u].append(v)\n adj[v].append(u)\n\n if is_ring(n, adj):\n print(\"ring topology\")\n elif is_bus(n, adj):\n print(\"bus topology\")\n elif is_star(n, adj):\n print(\"star topology\")\n else:\n print(\"unknown topology\")\n \nif __name__ == '__main__':\n main()", "n, m = [int(x) for x in input().split()]\r\ndeg = [0]*n\r\nfor _ in range(m):\r\n a, b = [int(x) for x in input().split()]\r\n deg[a-1] += 1\r\n deg[b-1] += 1\r\n\r\ncount_ones = 0\r\ncount_twos = 0\r\nfor i in range(n):\r\n count_ones += (deg[i] == 1)\r\n count_twos += (deg[i] == 2)\r\n\r\nif count_ones == 0 and count_twos == n:\r\n print(\"ring topology\")\r\nelif count_ones == 2 and count_twos == n-2:\r\n print(\"bus topology\")\r\nelif count_ones == n-1:\r\n print(\"star topology\")\r\nelse:\r\n print(\"unknown topology\")\r\n", "n, m = [int(x) for x in input().split()]\r\n\r\nv = []\r\nfor i in range(n):\r\n ar = []\r\n v.append(ar)\r\n\r\nfor i in range(m):\r\n p, q = [int(x) for x in input().split()]\r\n v[p - 1].append(q)\r\n v[q - 1].append(p)\r\n\r\ns = 0\r\nt = 0\r\nu = 0\r\n\r\nfor i in range(len(v)):\r\n if len(v[i]) == 1:\r\n s += 1\r\n elif len(v[i]) == 2:\r\n t += 1\r\n else:\r\n u += 1\r\n\r\nif s == 2 and u == 0:\r\n print(\"bus topology\")\r\nelif s == 0 and u == 0:\r\n print(\"ring topology\")\r\nelif s == n - 1:\r\n print(\"star topology\")\r\nelse:\r\n print(\"unknown topology\")", "n, m = map(int, input().split())\ngraph = {\n i: [] for i in range(1, n+1)\n}\n\nfor i in range(m):\n start, end = map(int, input().split())\n graph[start].append(end)\n graph[end].append(start)\n\nlength_array = []\nfor i in graph:\n length_array.append(len(graph[i]))\n\nif min(length_array) == max(length_array) and max(length_array) == 2:\n print('ring topology')\nelif length_array.count(1) == 2 and length_array.count(2) == n - 2:\n print('bus topology')\nelif max(length_array) == m and m == n - 1:\n print('star topology')\nelse:\n print('unknown topology')", "import sys\r\nfrom math import *\r\n\r\ndef minp():\r\n\treturn sys.stdin.readline().strip()\r\n\r\ndef mint():\r\n\treturn int(minp())\r\n\r\ndef mints():\r\n\treturn map(int, minp().split())\r\n\r\nn, m = mints()\r\ne = [[] for i in range(n+1)]\r\n\r\ndef isstar():\r\n\tc = None\r\n\tfor i in range(1, n+1):\r\n\t\tif len(e[i]) > 1:\r\n\t\t\tif c != None:\r\n\t\t\t\treturn False\r\n\t\t\tc = i\r\n\tif c == None:\r\n\t\treturn False\r\n\t#for i in range(1,n+1)\r\n\t#\tif i != c and e[i][0] != i:\r\n\treturn len(e[c]) == n-1\r\n\r\ndef isbus():\r\n\tc = None\r\n\tfor i in range(1, n+1):\r\n\t\tif len(e[i]) == 1:\r\n\t\t\tc = i\r\n\tif c == None:\r\n\t\treturn False\r\n\tcnt = 2\r\n\tp = c\r\n\tc = e[c][0]\r\n\twhile len(e[c]) == 2:\r\n\t\tif e[c][0] == p:\r\n\t\t\tp = c\r\n\t\t\tc = e[c][1]\r\n\t\telse:\r\n\t\t\tp = c\r\n\t\t\tc = e[c][0]\r\n\treturn len(e[c]) == 1\r\n\r\ndef isring():\r\n\tp = 1\r\n\tif len(e[1]) != 2:\r\n\t\treturn False\r\n\tc = e[1][0]\r\n\twhile len(e[c]) == 2 and c != 1:\r\n\t\tif e[c][0] == p:\r\n\t\t\tp = c\r\n\t\t\tc = e[c][1]\r\n\t\telse:\r\n\t\t\tp = c\r\n\t\t\tc = e[c][0]\r\n\treturn c == 1\r\n\r\nfor i in range(m):\r\n\ta, b = mints()\r\n\te[a].append(b)\r\n\te[b].append(a)\r\nif isstar():\r\n\tprint(\"star topology\")\r\nelif isbus():\r\n\tprint(\"bus topology\")\r\nelif isring():\r\n\tprint(\"ring topology\")\r\nelse:\r\n\tprint(\"unknown topology\")\r\n", "n,m=map(int,input().split())\r\na=[0]*n\r\nfor i in range(m):\r\n\tx,y=map(int,input().split())\r\n\ta[x-1]+=1\r\n\ta[y-1]+=1\r\ncount2=0\r\ncount1=0\r\nhi=0\r\nwhile 1:\r\n\tfor i in range(len(a)):\r\n\t\tif a[i]==1:\r\n\t\t\tcount1+=1\r\n\t\telif a[i]==2:\r\n\t\t\tcount2+=1\r\n\t\thi=max(hi,a[i])\r\n\tif count1==2 and count2==n-2:\r\n\t\tprint(\"bus topology\")\r\n\t\tbreak\r\n\tif count1==n-1 and hi==n-1:\r\n\t\tprint(\"star topology\")\r\n\t\tbreak\r\n\tif count2==n:\r\n\t\tprint(\"ring topology\")\r\n\t\tbreak\r\n\telse:\r\n\t\tprint(\"unknown topology\")\r\n\t\tbreak", "n, m = map(int, input().split())\r\nrb = [[] for i in range(n+1)]\r\nfor _ in range(m):\r\n a, b = map(int, input().split())\r\n rb[a].append(b)\r\n rb[b].append(a)\r\nln = []\r\nfor i in range(len(rb)):\r\n ln.append(len(rb[i]))\r\nif ln.count(1) == 2 and ln.count(2) == n - 2:\r\n print('bus topology')\r\nelif ln.count(2) == n:\r\n print('ring topology')\r\nelif ln.count(1) == n - 1 and n - 1 in ln:\r\n print('star topology')\r\nelse:\r\n print('unknown topology')\r\n", "class CodeforcesTask292BSolution:\n def __init__(self):\n self.result = ''\n self.n_m = []\n self.connections = []\n\n def read_input(self):\n self.n_m = [int(x) for x in input().split(\" \")]\n for x in range(self.n_m[1]):\n self.connections.append([int(y) for y in input().split(\" \")])\n\n def process_task(self):\n graph = [set() for x in range(self.n_m[0])]\n for conn in self.connections:\n graph[conn[0] - 1].add(conn[1])\n graph[conn[1] - 1].add(conn[0])\n conn_cnt = [len(a) for a in graph]\n if conn_cnt.count(1) == 2 and conn_cnt.count(2) == self.n_m[0] - 2:\n self.result = \"bus topology\"\n elif conn_cnt.count(1) == self.n_m[0] - 1 and conn_cnt.count(self.n_m[0] - 1) == 1:\n self.result = \"star topology\"\n elif conn_cnt.count(2) == self.n_m[0]:\n self.result = \"ring topology\"\n else:\n self.result = \"unknown topology\"\n\n def get_result(self):\n return self.result\n\n\nif __name__ == \"__main__\":\n Solution = CodeforcesTask292BSolution()\n Solution.read_input()\n Solution.process_task()\n print(Solution.get_result())\n", "# \"bus topology\" (without the quotes), if the answer is the ring, print \"ring topology\" (without the quotes), if the answer is the star, print \"star topology\" (without the quotes). If no answer fits, print \"unknown topology\" (without the quotes).\r\nl=list(map(int,input().split()))\r\nn=l[0]\r\nm=l[1]\r\nA=[]\r\nfor i in range(0,m):\r\n l=list(map(int,input().split()))\r\n A.append(l[0])\r\n A.append(l[1])\r\n# star\r\nflag=0\r\nflag1='unknown topology'\r\nflag2=0\r\nl=[A[0],A[1]]\r\n \r\na=A[i]\r\nb=A[i+1]\r\nif a in l :\r\n flag=a\r\nelif b in l:\r\n flag=b\r\n \r\nfor i in range(4,2*m,2):\r\n a=A[i]\r\n b=A[i+1]\r\n if a==flag or b==flag :\r\n continue\r\n else:\r\n flag2=1\r\n break\r\nif flag2==0:\r\n flag1='star topology'\r\n# A\r\n# B=A\r\n# B.sort()\r\n# flaggg=0\r\n# for i in range(1,len(B)-1):\r\n# if A.count(A[i])==2:\r\n# continue\r\n# else:\r\n# flaggg=1\r\n# if flaggg==0:\r\n# flag1='P'\r\n# B=A\r\n# B.sort()\r\n# flaggg=0\r\n# for i in range(0,len(B)):\r\n# if A.count(A[i])==2:\r\n# continue\r\n# else:\r\n# flaggg=1\r\n# if flaggg==0:\r\n# flag1='C'\r\nif flag1!='star topology':\r\n B=[]\r\n for i in A:\r\n B.append(i)\r\n B.sort()\r\n a=B[0]\r\n l=len(B)\r\n b=B[l-1]\r\n small=(a-1)*(a)\r\n big=b*(b+1)\r\n total=big-small\r\n somm=0\r\n for i in A:\r\n somm+=i\r\n total1=0\r\n # total1=somm+a+b\r\n if total==somm:\r\n flag1='ring topology'\r\n# elif total1==total:\r\n# flag1='P'\r\nif flag1!='ring topology' and flag1!='star topology':\r\n d={}\r\n for x in A:\r\n if x in d.keys():\r\n d[x]+=1\r\n else:\r\n d[x]=1\r\n l11=[]\r\n for x in d.keys():\r\n if d[x]==1:\r\n l11.append(x)\r\n if len(l11)==2: \r\n a=l11[0]\r\n b=l11[1]\r\n total1=somm+a+b\r\n if total1==total:\r\n flag1='bus topology'\r\nprint(flag1)", "def main():\r\n n, m = map(int, input().split())\r\n types = ['bus', 'ring', 'star', 'unknown']\r\n\r\n occ = [0] * n\r\n for i in range(m):\r\n a, b = map(int, input().split())\r\n occ[a-1] += 1\r\n occ[b-1] += 1\r\n\r\n cnt = [0] * 3\r\n for v in occ:\r\n cnt[min(2, v-1)] += 1\r\n\r\n if cnt == [2, n - 2, 0]:\r\n res = types[0]\r\n elif cnt == [0, n, 0]:\r\n res = types[1]\r\n elif cnt == [n - 1, 0, 1]:\r\n res = types[2]\r\n else:\r\n res = types[3]\r\n\r\n print(res, 'topology')\r\n \r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "n, m = map(int, input().split())\n\ngrafo = [0]*n\nstar = {1,m}\nbus = {1,2}\nring = {2}\nfor i in range(m):\n x , y = map(int, input().split())\n grafo[x-1] += 1\n grafo[y-1] += 1\n\nsetado = set(grafo)\n\nif setado == bus:\n print(\"bus topology\")\nelif setado == ring:\n print(\"ring topology\")\n\nelif setado == star:\n print(\"star topology\")\n\nelse:\n print(\"unknown topology\")\n\n\t\t\t \t\t\t \t \t\t \t \t \t \t", "v=input().split()\r\nn=int(v[0])\r\nm=int(v[1])\r\nc={}\r\nfor i in range(n):\r\n c[i+1]=0\r\nfor i in range(m):\r\n b=input().split()\r\n c[int(b[0])]+=1\r\n c[int(b[1])]+=1\r\nflag1=0\r\nflag2=0\r\nfor i in c:\r\n if c[i]==2:\r\n flag1+=1\r\n if c[i]==m:\r\n print('star topology')\r\n exit()\r\n if c[i]==1:\r\n flag2+=1\r\nif flag1==n:\r\n print('ring topology') \r\nelif flag2==2 and flag1==n-2:\r\n print('bus topology') \r\nelse:\r\n print('unknown topology') \r\n", "n, m = map(int, input().split())\n\nvs = [0 for i in range(n)]\n\nfor i in range(m):\n x, y = map(int, input().split())\n vs[x - 1] = vs[x - 1] + 1\n vs[y - 1] = vs[y - 1] + 1\n\nif max(vs) == m and n == m + 1:\n print('star topology')\nelse:\n ones = sum(map(lambda x: 1 if x == 1 else 0, vs))\n if n == m + 1 and ones == 2:\n print('bus topology')\n else:\n doubles = sum(map(lambda x: 1 if x == 2 else 0, vs))\n if n == m and doubles == n:\n print('ring topology')\n else:\n print('unknown topology')\n", "# Read n edges, m vertices\nn, m = map(int,input().split())\n\n# initialize an empty graph\nadj = [[] for i in range(n+1)]\n\nfor i in range(m):\n u, v = map(int,input().split())\n \n # here, the edge (u,v) is undirected\n adj[u].append(v)\n adj[v].append(u)\n\nadj.pop(0)\n\na, b, c = 0, 0, 0\nfor g in adj:\n if len(g) == 1:\n a += 1\n if len(g) == 2:\n b += 1\n if len(g) == len(adj) - 1:\n c += 1\n\nif a == 2 and b == len(adj) - 2:\n print(\"bus topology\")\nelif b == len(adj):\n print(\"ring topology\")\nelif a == len(adj) - 1 and c == 1:\n print(\"star topology\")\nelse:\n print(\"unknown topology\")\n\n \n \n", "n, m = map(int, input().split())\r\nedge = [0, 0, 0]\r\ns = {}\r\n\r\nfor _ in range(m):\r\n x, y = map(int, input().split())\r\n if x not in s:\r\n s[x] = set()\r\n s[x].add(y)\r\n if y not in s:\r\n s[y] = set()\r\n s[y].add(x)\r\n\r\nfor x in s.keys():\r\n if len(s[x]) == n - 1:\r\n edge[2] += 1\r\n if len(s[x]) == 1:\r\n edge[0] += 1\r\n if len(s[x]) == 2:\r\n edge[1] += 1\r\n\r\nif edge[0]==2 and edge[1]==n-2:\r\n print('bus topology')\r\nelif edge[1]==n:\r\n print('ring topology')\r\nelif edge[2]==1 and edge[1]==0:\r\n print('star topology')\r\nelse:\r\n print('unknown topology')", "v, e = map(int, input().split())\nedges = []\ndeg = {}\nfor i in range(e):\n i,j = map(int, input().split())\n edges.append([i,j])\n deg[i] = deg.get(i, 0) + 1\n deg[j] = deg.get(j, 0) + 1\n\ndeg_list = sorted(list(deg.values()))\n\nif v > e:\n bustop = [1, 1] + [2 for _ in range(v - 2)]\n if deg_list == bustop:\n print(\"bus topology\")\n quit()\n startop = [1 for _ in range(v - 1)] + [e]\n if deg_list == startop:\n print(\"star topology\")\n quit()\nelif v == e:\n if set(deg_list) == {2}:\n print(\"ring topology\")\n quit()\n\nprint(\"unknown topology\")", "def main():\r\n n, m = [int(x) for x in input().split(\" \")]\r\n\r\n degree = [0] * n\r\n\r\n for _ in range(m):\r\n i, j = [int(x) - 1 for x in input().split(\" \")]\r\n degree[i] += 1\r\n degree[j] += 1\r\n\r\n degree_one = 0\r\n degree_two = 0\r\n degree_n_1 = 0\r\n\r\n for i in range(n):\r\n if degree[i] == 1:\r\n degree_one += 1\r\n elif degree[i] == 2:\r\n degree_two += 1\r\n elif degree[i] == n - 1:\r\n degree_n_1 += 1\r\n\r\n if degree_two == n:\r\n print(\"ring topology\")\r\n elif degree_one == n - 1 and degree_n_1 == 1:\r\n print(\"star topology\")\r\n elif degree_two == n - 2 and degree_one == 2:\r\n print(\"bus topology\")\r\n else:\r\n print(\"unknown topology\")\r\n\r\n\r\nmain()", "import sys\n\ninput = sys.stdin.readline\n\n \nn, m = map(int,input().split())\ntop = [0]*(n+1)\nfor i in range(m):\n x, y = map(int,input().split())\n top[x]+=1\n top[y]+=1\ntwo = 0\none = 0\ntree = 0\nfor i in range(1,n+1):\n if top[i]==n-1:\n tree += 1\n elif top[i]==2:\n two+=1\n elif top[i]==1:\n one+=1\n \nif tree == 1 and two == 0 and one == n-1:\n print('star topology')\nelif two==n and one == 0 and tree == 0:\n print('ring topology')\nelif two == n-2 and one == 2 and tree ==0:\n print('bus topology')\nelse:\n print('unknown topology')\n \t \t \t \t\t \t\t\t\t \t \t\t\t \t\t", "line=input().split(\" \")\nn= int(line[0])\nm = int(line[1])\nvect=[0]*n\nfor i in range (m):\n line=input().split(\" \")\n a= int(line[0])\n b = int(line[1])\n vect[a - 1]+=1\n vect[b - 1] += 1\nif m == n:\n ring=True\n for x in vect:\n if x!= 2:\n ring=False\n if ring:\n print(\"ring topology\")\n else:\n print(\"unknown topology\")\nelif m<n:\n cont1=0\n cont2=0\n bus=True\n star=True\n for x in vect:\n if x== 1:\n cont1+=1\n elif x==2:\n cont2+=1\n if cont1==2 and cont2==n-2:\n print(\"bus topology\")\n star=False\n else:\n bus=False\n if cont1==n-1:\n print(\"star topology\")\n bus = False\n else:\n star=False\n if not(star or bus):\n print(\"unknown topology\")\n\nelse:\n print(\"unknown topology\")\n \t\t \t \t\t\t\t\t\t\t\t \t\t", "n, m = map(int, input().split())\r\nd = dict()\r\nmaxi = 0\r\nmaxv = 0\r\nfor _ in range(m):\r\n a, b = map(int, input().split())\r\n if a - 1 in d:\r\n d[a - 1] += 1\r\n else:\r\n d[a - 1] = 1\r\n if b - 1 in d:\r\n d[b - 1] += 1\r\n else:\r\n d[b - 1] = 1\r\n if d[a - 1] > maxv:\r\n maxv = d[a - 1]\r\n maxi = a - 1\r\n if d[b - 1] > maxv:\r\n maxv = d[b - 1]\r\n maxi = b - 1\r\n \r\nif m + 1 == n:\r\n if maxv == m:\r\n print('star topology')\r\n elif maxv == 2:\r\n print('bus topology')\r\n else:\r\n print('unknown topology')\r\nelif m == n:\r\n if maxv == 2:\r\n print('ring topology')\r\n else:\r\n print('unknown topology')\r\nelse:\r\n print('unknown topology')", "#!/usr/bin/python3\n\nn, m = [int(x) for x in input().split()]\ndegree = {0:0, 1:0, 2:0, n - 1:0}\nvisited = [0] * n\nadjlist = [[] for x in range(n)]\nfor i in range(m):\n\tx, y = [int(x) for x in input().split()]\n\tx -= 1\n\ty -= 1\n\tadjlist[x].append(y) \n\tadjlist[y].append(x)\n\nfor i in range(n):\n\tcur_degree = len(adjlist[i])\n\tif cur_degree not in degree:\n\t\tdegree[cur_degree] = 1\n\telse:\n\t\tdegree[cur_degree] += 1\n\ndegree_other = False\n\nfor val in degree.keys():\n\tif val != 1 and val != 2 and val != n - 1 and val != 0:\n\t\tdegree_other = True\t\n\nif degree_other == True:\n\tprint(\"unknown topology\")\nelif degree[1] == n - 1 and degree[n - 1] == 1:\n\tprint(\"star topology\")\nelif degree[1] == 2 and degree[2] == n - 2:\n\tprint(\"bus topology\")\nelif degree[2] == n:\n\tprint(\"ring topology\")\nelse:\n\tprint(\"unknown topology\")\n", "from collections import defaultdict\r\n\r\nn, m = map(int, input().split())\r\n\r\ndeg_counts = defaultdict(lambda:0)\r\ndegs = [0]*n\r\n\r\nfor _ in range(m):\r\n x, y = map(int, input().split())\r\n degs[x-1] += 1\r\n degs[y-1] += 1\r\n\r\nfor d in degs:\r\n deg_counts[d] += 1\r\n\r\nif deg_counts[1] == 2 and deg_counts[2] == n-2:\r\n print(\"bus topology\")\r\nelif deg_counts[2] == n:\r\n print(\"ring topology\")\r\nelif deg_counts[1] == n - 1:\r\n print(\"star topology\")\r\nelse:\r\n print(\"unknown topology\")", "n,m = map(int,input().split())\r\nadj = [[]for i in range(n+1)]\r\n\r\nfor i in range(m):\r\n u,v = map(int,input().split())\r\n adj[u].append(v)\r\n adj[v].append(u)\r\nl2 = []\r\nl1 = []\r\nl3 = []\r\nfor i in range(1,n+1):\r\n if len(adj[i]) == 2:\r\n l2.append(2)\r\n elif len(adj[i]) == 1:\r\n l1.append(1)\r\n elif len(adj[i]) == n-1:\r\n l3.append(n-1)\r\nif len(l1) == 2 and len(l2) == n-2:\r\n print('bus topology ')\r\nelif len(l1) == n-1 and len(l3) == 1:\r\n print('star topology')\r\nelif len(l2) == n:\r\n print('ring topology')\r\nelse:\r\n print('unknown topology')\r\n", "n, m = map(int, input().split())\r\nnodecount = 0\r\nnodecoords = [0 for i in range(n)]\r\nfor x in range(m):\r\n a , b = map(int, input().split())\r\n nodecount += 2\r\n nodecoords[a-1] += 1\r\n nodecoords[b-1] += 1\r\nmax = max(nodecoords)\r\nans = 'unknown topology'\r\nif m == n and nodecount == 2*n and max == 2:\r\n ans = \"ring topology\"\r\nelif max == m and nodecount == 2*m:\r\n ans = \"star topology\"\r\nelif max == 2 and nodecount == 2*m:\r\n ans = \"bus topology\"\r\n\r\nprint(ans)", "input_list = [int(x) for x in input().split()]\r\nnode_count = input_list[0]\r\nlink_count = input_list[1]\r\nnode_links = [0]*node_count\r\nnodes = [[] for _ in range(node_count)]\r\n\r\nresult = \"unknown topology\"\r\nmulti_nodes = 0\r\ndouble_nodes = 0\r\nsingle_nodes = 0\r\nfor l in range(link_count):\r\n list1 = [int(x) for x in input().split()]\r\n nodes[list1[0]-1].append(list1[1])\r\n nodes[list1[1]-1].append(list1[0])\r\n\r\nfor n in nodes:\r\n if len(n) > 2:\r\n multi_nodes += 1\r\n elif len(n) == 2:\r\n double_nodes += 1\r\n else:\r\n single_nodes += 1\r\n\r\nif single_nodes == node_count-1 and multi_nodes == 1 and double_nodes == 0:\r\n result = \"star topology\"\r\nelif single_nodes == 0 and multi_nodes == 0 and double_nodes == node_count:\r\n result = \"ring topology\"\r\nelif single_nodes == 2 and multi_nodes == 0 and double_nodes == node_count-2:\r\n result = \"bus topology\"\r\n\r\nprint(result)", "\r\nfrom functools import lru_cache\r\nfrom collections import defaultdict\r\nclass Solution:\r\n def networkTopology(self, array):\r\n # TODO write an algorithm here\r\n graph = defaultdict(set)\r\n for network in array:\r\n graph[network[0]].add(network[1])\r\n graph[network[1]].add(network[0])\r\n # for bus and ring\r\n num = 0\r\n flag = True\r\n for key in graph:\r\n if len(graph[key]) > 2:\r\n flag = False\r\n break\r\n elif len(graph[key]) == 1:\r\n num += 1\r\n if flag:\r\n if num == 2:\r\n return \"bus topology\"\r\n elif num == 0:\r\n return \"ring topology\"\r\n # for star\r\n star, flag = 0, True\r\n for key in graph:\r\n if star > 1:\r\n flag = False\r\n break\r\n if len(graph[key])>1:\r\n star += 1\r\n if flag:\r\n return \"star topology\"\r\n return \"unknown topology\"\r\n \r\n \r\nif __name__ == \"__main__\":\r\n solution = Solution()\r\n n, m = list(map(int, input().split()))\r\n array = []\r\n for i in range(m):\r\n x = list(map(int, input().split()))\r\n array.append(x)\r\n \r\n \r\n print(solution.networkTopology(array))", "def solve():\n n, m = map(int, input().split())\n if n not in (m, m + 1):\n return 3\n l = [0] * (n + 1)\n for _ in range(m):\n x, y = map(int, input().split())\n l[x] += 1\n l[y] += 1\n c2 = l.count(2)\n if m == n == c2:\n return 1\n if m == n - 1:\n c1 = l.count(1)\n if c1 == 2 and c2 == n - 2:\n return 0\n if c1 == m and m in l:\n return 2\n return 3\n\n\ndef main():\n print((\"bus\", \"ring\", \"star\", \"unknown\")[solve()], \"topology\")\n\n\nif __name__ == '__main__':\n main()\n", "n,m = map(int,input().split())\r\nadj = dict()\r\n\r\nfor i in range(m):\r\n\tu,v = map(int,input().split())\r\n\r\n\tif u not in adj:\r\n\t\tadj[u] = set()\r\n\r\n\tif v not in adj:\r\n\t\tadj[v] = set()\r\n\r\n\tadj[u].add(v)\r\n\tadj[v].add(u)\r\n\r\nmark = [0]*(n+1)\r\nmark[0] = 1\r\nstart = 1\r\ntopology = 'unknown'\r\n\r\none = 0\r\ntwo = 0\r\nem = 0\r\noth = 0\r\n\r\nfor k,v in adj.items():\r\n\tif len(v) == 1:\r\n\t\tone+=1\r\n\telif len(v) == 2:\r\n\t\ttwo+=1\r\n\telif len(v) == m:\r\n\t\tem+=1\r\n\telse:\r\n\t\toth+=1\r\n\r\n'''\r\nbus: 2 have 1, n-2 have 2\r\nring: all have 2\r\nstar: 1 node has m, all others have 1\r\n'''\r\n\r\nif one == 2 and two == n-2:\r\n\ttopology = 'bus'\r\nelif two == n:\r\n\ttopology = 'ring'\r\nelif em == 1 and n-1 == one:\r\n\ttopology = 'star'\r\n\r\nprint(topology+ \" topology\")\r\n", "n, e = list(map(int, input().split()))\r\nnetwork = {}\r\narr = []\r\nfor i in range(e):\r\n a, b = map(int, input().split())\r\n if a in network:\r\n network[a].append(b)\r\n else:\r\n network[a] = [b]\r\n if b in network:\r\n network[b].append(a)\r\n else:\r\n network[b] = [a]\r\nfor k in network:\r\n arr.append(len(network[k]))\r\nif arr.count(1) == 2 and arr.count(2) == n - 2:\r\n print(\"bus topology\")\r\nelif arr.count(2) == n:\r\n print(\"ring topology\")\r\nelif arr.count(n-1) == 1 and arr.count(1) == n - 1:\r\n print(\"star topology\")\r\nelse:\r\n print(\"unknown topology\")\r\n", "from collections import defaultdict\r\nn, m = list(map(int, input().split()))\r\ngraph = defaultdict(list)\r\ncount = defaultdict(int)\r\nfor i in range(m):\r\n x, y = list(map(int, input().split()))\r\n graph[x].append(y)\r\n graph[y].append(x)\r\n count[x] += 1\r\n count[y] += 1\r\n if count[x] == m:\r\n print(\"star topology\")\r\n exit()\r\n if count[y] == m:\r\n print(\"star topology\")\r\n exit()\r\n\r\nc = 0\r\n# print(count)\r\nfor k, v in count.items():\r\n if v == 2:\r\n c += 1\r\n# print(c)\r\nif c == m:\r\n print(\"ring topology\")\r\nelif c == m - 1:\r\n print(\"bus topology\")\r\nelse:\r\n print(\"unknown topology\")\r\n\r\n\r\n\r\n\r\n\r\n \r\n ", "def bus():\n one = two = 0\n for i in range(1, nodes + 1):\n if len(adj[i]) == 1:\n one += 1\n elif len(adj[i]) == 2:\n two += 1\n if one == 2 and two == nodes - 2:\n return True\n else:\n return False\n\ndef ring():\n for i in range(1, nodes + 1):\n if len(adj[i]) != 2:\n return False\n return True\n\ndef star():\n central = other = 0\n for i in range(1, nodes + 1):\n if len(adj[i]) == 1:\n central += 1\n elif len(adj[i]) == nodes - 1:\n other += 1\n if central == nodes - 1 and other == 1:\n return True\n else:\n return False\n\n\nnodes, edges = [int(x) for x in input().split()]\nadj = [[] for i in range(nodes + 1)]\n\nfor i in range(edges):\n a, b = [int(x) for x in input().split()]\n adj[a].append(b)\n adj[b].append(a)\n\nif bus():\n print(\"bus topology\")\nelif ring():\n print(\"ring topology\")\nelif star():\n print(\"star topology\")\nelse:\n print(\"unknown topology\")\n\n\t \t \t\t \t \t\t \t \t \t \t\t\t\t \t\t", "def solution(n,m,x,y):\r\n deg=[0]*n\r\n for i in range(m):\r\n deg[x[i-1]-1]+=1\r\n deg[y[i-1]-1]+=1\r\n\r\n r='unknown'\r\n\r\n s=set(deg)\r\n if s=={2}:\r\n r='ring'\r\n elif s=={1,2}:\r\n r='bus'\r\n elif s=={1,m}:\r\n r='star'\r\n print(f'{r} topology')\r\n\r\nInput=lambda :map(int,input().split())\r\nn,m=Input()\r\nx,y=list(),list()\r\nfor i in range(m):\r\n a,b=Input()\r\n x.append(a)\r\n y.append(b)\r\nsolution(n,m,x,y)", "from collections import defaultdict\r\nn,m=map(int,input().split())\r\ng=defaultdict(int)\r\nfor i in range(m):\r\n a,b=map(int,input().split())\r\n g[a]+=1\r\n g[b]+=1\r\ncnt1=cnt2=0\r\nfor i in g:\r\n if g[i]==1:cnt1+=1\r\n elif g[i]==2:cnt2+=1\r\nif cnt2==n:print('ring topology')\r\nelif cnt1==n-1:print('star topology')\r\nelif cnt1==2 and cnt2==n-2:print('bus topology')\r\nelse:print('unknown topology')\r\n", "from sys import stdin, stdout\r\nfrom collections import defaultdict\r\n\r\n\r\ngraph = defaultdict(list)\r\nn, m = stdin.readline().split()\r\nn = int(n)\r\nm = int(m)\r\nfor i in range(0, m):\r\n edges = stdin.readline().split()\r\n graph[int(edges[0])].append(int(edges[1]))\r\n graph[int(edges[1])].append(int(edges[0]))\r\nstar = False\r\nsum_1 = 0\r\nsum_2 = 0\r\nfor i in range(1, n + 1):\r\n len_i = len(graph[i])\r\n if len_i == m:\r\n star = True\r\n elif len_i == 1:\r\n sum_1 += 1\r\n elif len_i == 2:\r\n sum_2 += 1\r\nif star:\r\n print(\"star topology\")\r\nelse:\r\n if sum_1 == 2 and sum_2 == n-2:\r\n print(\"bus topology\")\r\n elif sum_1 == 0 and sum_2 == n:\r\n print(\"ring topology\")\r\n else:\r\n print(\"unknown topology\")\r\n", "# /**\r\n# * author: brownfox2k6\r\n# * created: 17/06/2023 16:54:33 Hanoi, Vietnam\r\n# **/\r\n\r\nfrom collections import Counter\r\n\r\nn, m = map(int, input().split())\r\ng = [0 for _ in range(n)]\r\n\r\nfor _ in range(m):\r\n u, v = map(int, input().split())\r\n g[u-1] += 1\r\n g[v-1] += 1\r\n\r\nans = \"unknown topology\"\r\ng = Counter(g)\r\ntry:\r\n if g[2] == n:\r\n ans = \"ring topology\"\r\nexcept:\r\n pass\r\ntry:\r\n if g[n-1] == 1 and g[1] == n-1:\r\n ans = \"star topology\"\r\nexcept:\r\n pass\r\ntry:\r\n if g[2] == n-2 and g[1] == 2:\r\n ans = \"bus topology\"\r\nexcept:\r\n pass\r\n\r\nprint(ans)", "n,m=input().split()\r\nn=int(n);m=int(m)\r\na=[0]*n\r\nfor i in range(0,m):\r\n\tx,y=input().split()\r\n\tx=int(x);y=int(y)\r\n\ta[x-1]+=1;a[y-1]+=1\r\nr=\"unknown\"\r\ns=set(a)\r\nif s=={2}:\r\n\tr=\"ring\"\r\nif s=={1,2}:\r\n\tr=\"bus\"\r\nif s=={1,m}:\r\n\tr=\"star\"\r\nprint(r,\"topology\")", "import sys\nfrom collections import Counter\n\n[n, m] = list(map(int, sys.stdin.readline().split()))\ndegs = [0 for i in range(n)]\n\nfor edge in range(m):\n [a, b] = list(map(int, sys.stdin.readline().split()))\n degs[a-1] += 1\n degs[b-1] += 1\n\ncount = Counter(degs)\n\nif count[1] == 2 and count[2] == n-2:\n print(\"bus topology\")\nelif count[2] == n:\n print(\"ring topology\")\nelif count[1] == n-1 and count[n-1] == 1:\n print(\"star topology\")\nelse:\n print(\"unknown topology\")\n", "from collections import defaultdict\r\nvertices,edges=map(int,input().split())\r\ngraph=defaultdict(lambda:0)\r\nfor _ in[0]*edges:\r\n a,b=map(int,input().split())\r\n graph[a]+=1\r\n graph[b]+=1\r\ndegree=list(graph.values())\r\nif degree.count(1)==2 and degree.count(2)==vertices-2:print('bus topology');quit()\r\nif degree.count(2)==vertices:print('ring topology');quit()\r\nif degree.count(vertices-1)==1 and degree.count(1)==vertices-1:print('star topology');quit()\r\nprint('unknown topology')", "n,m=map(int,input().split())\r\nL=[]\r\nfor i in range(n):\r\n L.append([])\r\nfor i in range(m):\r\n a,b=map(int,input().split())\r\n L[a-1].append(b-1)\r\n L[b-1].append(a-1)\r\nbus=0\r\nring=0\r\nstar=0\r\ni=0\r\nwhile i<n:\r\n if len(L[i])==2:\r\n bus=bus+1\r\n if len(L[i])==1:\r\n ring=ring+1\r\n if len(L[i])==(n-1):\r\n star=star+1\r\n i=i+1\r\nif ring==(n-1) and star==1:\r\n print(\"star topology\")\r\nelif bus==n-2 and ring==2:\r\n print(\"bus topology\")\r\nelif ring==0 and bus==n:\r\n print(\"ring topology\")\r\nelse:\r\n print(\"unknown topology\")", "from collections import defaultdict\r\nv, e = map(int, input().split())\r\nd = defaultdict(list)\r\nfor _ in range(e):\r\n a,b = map(int, input().split())\r\n d[a].append(b)\r\n d[b].append(a)\r\ntwo_len = 0\r\none_len = 0\r\nn_len = 0\r\nfor key, value in d.items():\r\n if len(value) == 2:\r\n two_len+=1\r\n elif len(value) == 1:\r\n one_len+=1\r\n elif len(value) == v-1:\r\n n_len+=1\r\n \r\nif n_len == 1 and one_len == v-1:\r\n print(\"star topology\")\r\nelif two_len == v:\r\n print(\"ring topology\")\r\nelif one_len == 2 and two_len == v-2:\r\n print(\"bus topology\")\r\nelse:\r\n print(\"unknown topology\")", "n, m =map(int, input().split())\r\nd={}\r\nfor i in range(1, n+1):\r\n d[i]=[]\r\nfor i in range(m):\r\n a, b = map(int, input().split())\r\n d[a].append(b)\r\n d[b].append(a)\r\nsh1=0\r\nkol=0\r\nzvez=0\r\nfor i in d:\r\n d[i]=len(d[i])\r\n if d[i]==0:\r\n print(\"unknown topology\")\r\n exit()\r\n if d[i]>2:\r\n sh1=3\r\n kol=2\r\n zvez+=1\r\n elif d[i]==2:\r\n zvez+=1\r\n else:\r\n sh1+=1\r\n kol=2\r\nif sh1==2:\r\n print(\"bus topology\")\r\nelif kol==0:\r\n print(\"ring topology\")\r\nelif zvez==1:\r\n print(\"star topology\")\r\nelse:\r\n print(\"unknown topology\")\r\n", "verges, nodes=[int(x) for x in input().split()]\r\ns=[]\r\nfor i in range(nodes):\r\n s.append(list(int(x) for x in input().split()))\r\n\r\n\r\ndef check_bus(d):\r\n from operator import itemgetter\r\n d = sorted(d, key=itemgetter(0), reverse=False)\r\n #print(d)\r\n G=dict()\r\n\r\n for node in d:\r\n #print(node)\r\n if not node[0] in G.keys():\r\n G[node[0]]= []\r\n if not node[1] in G.keys():\r\n G[node[1]]=[]\r\n G[node[0]].append( *{node[1]} )\r\n G[node[1]].append( *{node[0]} )\r\n #print(G)\r\n\r\n pt = sorted(G, key=lambda k: len(G[k]))\r\n #print(f\"pt is: {pt[0]}\")\r\n #res = hamilton2(G, pt[0])\r\n #print(res)\r\n if False==True:#len(res)==0:\r\n return False\r\n else:\r\n '''cycle_detect = [res[-1]]\r\n cycle_detect.append(res[0])'''\r\n if ( all(len(x)==2 for x in G.values()) ):# and cycle_detect in d or list(reversed(cycle_detect)) in d)):\r\n print(\"ring topology\")\r\n else:\r\n bus_check = [G[key] for key in pt]\r\n if (len(bus_check[0])==len(bus_check[1])==1) and all(len(x)==2 for x in bus_check[2:]):\r\n print(\"bus topology\")\r\n else:\r\n return False\r\n return True\r\n\r\ndef check_star(d):\r\n #print(d)\r\n result = set(d[0])\r\n for s in d[1:]:\r\n result.intersection_update(s)\r\n if len(list(result))>0:\r\n comm = list(result)[0]\r\n return all(comm in x for x in d)\r\n else:\r\n return False\r\n\r\n\r\nif check_star(s):\r\n print(\"star topology\")\r\nelif check_bus(s):\r\n pass\r\n #print(\"bus topology\")\r\nelse:\r\n print(\"unknown topology\")", "R = lambda: map(int, input().split())\r\nn, m = R()\r\nc = [0] * n\r\nfor i in range(m):\r\n x, y = R()\r\n c[x - 1] += 1\r\n c[y - 1] += 1\r\nc1 = c2 = 0\r\nfor i in range(n):\r\n if c[i] == 1:\r\n c1 += 1\r\n elif c[i] == 2:\r\n c2 += 1\r\nif c2 == n:\r\n print(\"ring topology\")\r\nelif c1 == 2 and c2 == n - 2:\r\n print(\"bus topology\")\r\nelif c1 == n - 1:\r\n print(\"star topology\")\r\nelse:\r\n print(\"unknown topology\")", "from collections import defaultdict\r\nn, m = [int(i) for i in input().split()] \r\ndegrees = defaultdict(int)\r\nfor i in range(m): \r\n x, y = [int(i) for i in input().split()] \r\n degrees[x] += 1; degrees[y] += 1 \r\ndegrees = list(degrees.values()) \r\nif degrees.count(1) == 2 and degrees.count(2) == n-2: print(\"bus topology\") \r\nelif degrees.count(2) == n: print(\"ring topology\") \r\nelif degrees.count(1) == n-1 and degrees.count(n-1) == 1 : print(\"star topology\") \r\nelse : print(\"unknown topology\")", "n,m=map(int,input().split())\r\nd={i:[] for i in range(1,n+1)}\r\nfor _ in range(m):\r\n a,b=map(int,input().split())\r\n d[a].append(b)\r\n d[b].append(a)\r\nc=0\r\none,two=0,0\r\nstar=0\r\nfor i in d:\r\n if len(d[i])==1:\r\n c+=1\r\n one+=1\r\n elif len(d[i])==2:\r\n two+=1\r\n elif len(d[i])==n-1:\r\n star+=1\r\n \r\nif c==(n-1) and star==1:\r\n print('star topology')\r\n\r\nelif one==2 and two==(n-2):\r\n print('bus topology')\r\n\r\nelif two==n:\r\n print('ring topology')\r\nelse:\r\n print('unknown topology')\r\n\r\n", "from collections import defaultdict,Counter\r\nN,M = map(int, input().split())\r\nAdjList = defaultdict(int)\r\nfor i in range(M):\r\n a,b = map(int,input().split())\r\n AdjList[a] += 1\r\n AdjList[b] += 1\r\nCheckList = []\r\nfor i in AdjList.values():\r\n CheckList.append(i)\r\nFreq = Counter(CheckList)\r\nif(len(Freq.values()) == 1 and Freq[2]!=0):\r\n print(\"ring topology\")\r\nelif(len(Freq.values()) == 2 and Freq[1]==2 and Freq[2]!=0):\r\n print(\"bus topology\")\r\nelif(len(Freq.values())== 2 and Freq[1]==N-1):\r\n print(\"star topology\")\r\nelse:\r\n print(\"unknown topology\")", "n, m = map(int, input().split())\nd = [0] * (n + 1)\nc = [0] * (n + 1)\nfor i in range(m):\n for x in list(map(int, input().split())):\n d[x] += 1\nfor x in d: c[x] += 1\nif c[2] == n: print('ring topology')\nelif c[1] == n - 1 and c[n - 1] == 1: print('star topology')\nelif c[2] == n - 2 and c[1] == 2: print('bus topology')\nelse: print('unknown topology')", "import re\nimport itertools\nfrom collections import Counter, deque\n\nclass Task:\n n, m = 0, 0\n graph = []\n answer = \"\"\n\t\n def getData(self):\n self.n, self.m = [int(x) for x in input().split(' ')]\n for i in range(0, self.m):\n self.graph += [[int(x) for x in input().split(' ')]]\n\n #inFile = open('input.txt', 'r')\n #inFile.readline().rstrip()\n #self.childs = inFile.readline().rstrip()\n\n def solve(self):\n graph = self.graph\n vertexDegrees = [0] * (self.n + 1)\n for edge in graph:\n vertexDegrees[edge[0]] += 1\n vertexDegrees[edge[1]] += 1\n vertexDegrees = vertexDegrees[1:]\n if vertexDegrees.count(2) == len(vertexDegrees):\n self.answer = 'ring topology'\n return\n if vertexDegrees.count(1) == 2 and vertexDegrees.count(2) == \\\n len(vertexDegrees) - 2:\n self.answer = 'bus topology'\n return\n if vertexDegrees.count(1) == len(vertexDegrees) - 1:\n self.answer = 'star topology'\n return\n self.answer = 'unknown topology'\n\n def printAnswer(self):\n print(re.sub(r'[\\[\\],]', '', str(self.answer)))\n #print(self.answer[:6])\n #outFile = open('output.txt', 'w')\n #outFile.write(self.answer)\n\ntask = Task()\ntask.getData()\ntask.solve()\ntask.printAnswer()\n", "from collections import defaultdict\r\n\r\ndef is_bus(n, graph):\r\n if n <= 2:\r\n return True\r\n \r\n count_1 = 0\r\n count_2 = 0\r\n\r\n for indegree in graph.values():\r\n if indegree == 1:\r\n count_1 += 1\r\n elif indegree == 2:\r\n count_2 += 1\r\n\r\n return count_1 == 2 and count_2 == n - 2\r\n\r\ndef is_ring(n, graph):\r\n count_2 = 0\r\n\r\n for indegree in graph.values():\r\n if indegree == 2:\r\n count_2 += 1\r\n\r\n return count_2 == n\r\n \r\n\r\ndef is_star(n, graph):\r\n count_1 = 0\r\n count_hub = 0\r\n\r\n for indegree in graph.values():\r\n if indegree == 1:\r\n count_1 += 1\r\n elif indegree == n - 1:\r\n count_hub += 1\r\n\r\n return count_1 == n - 1 and count_hub == 1\r\n\r\n\r\nn, m = map(int, input().split())\r\ngraph = defaultdict(int)\r\nfor _ in range(m):\r\n u, v = map(int, input().split())\r\n graph[u] += 1\r\n graph[v] += 1\r\n\r\nif is_bus(n, graph):\r\n print('bus topology')\r\nelif is_ring(n, graph):\r\n print('ring topology')\r\nelif is_star(n, graph):\r\n print('star topology')\r\nelse:\r\n print('unknown topology')", "from collections import defaultdict\r\n\r\nfor _ in range(1):\r\n n, m = map(int, input().split())\r\n d = defaultdict(list)\r\n \r\n for i in range(m):\r\n p, q = map(int, input().split())\r\n d[p].append(q)\r\n d[q].append(p)\r\n\r\n degrees = [len(adj_list) for adj_list in d.values()]\r\n\r\n if len(set(degrees)) == 1 and degrees[0] == 2:\r\n print('ring topology')\r\n elif len(set(degrees)) == 2 and degrees.count(1) == 2:\r\n print('bus topology')\r\n elif len(set(degrees)) == 2 and degrees.count(m) == 1:\r\n print('star topology')\r\n else:\r\n print('unknown topology')\r\n", "n, m = input().split()\nn = int(n) #nodes\nm = int(m) #edges \nlist = [[] for i in range(n)]\nfor i in range(m): \n coor= input().split()\n coor = [int(k) for k in coor]\n list[coor[0]-1].append(i)\n list[coor[1]-1].append(i)\n#print(list)\nsingle= 0 \ndouble = 0\nedges = 0 \nunknown = 0 \nfor i in list: \n if len(i) == 1: \n single += 1 \n elif len(i) == 2:\n double += 1 \n elif len(i) == n-1: \n edges += 1\n else: unknown += 1\n\nif single == 2 and double == n-2: \n print(\"bus topology\")\nelif double == n: \n print(\"ring topology\")\nelif single == n-1 and edges == 1:\n print(\"star topology\")\nelse: \n print(\"unknown topology\")\n", "maxi = 100001\nvisited = [False]*maxi\nadj = []\nfor i in range(maxi):\n adj.append([])\nn, m = map(int, input().split())\nfor i in range(m):\n u, v = map(int, input().split())\n adj[u].append(v)\n adj[v].append(u)\n\n\ndef isStar() -> bool:\n ans = False\n counter = 0\n other = 0\n for i in range(1, n+1):\n if len(adj[i]) == 1:\n counter += 1\n elif len(adj[i]) == n-1:\n other += 1\n if other == 1 and counter == n-1:\n ans = True\n return ans\n\n\ndef isBus() -> bool:\n ans = False\n one = 0\n two = 0\n for i in range(1, n+1):\n if len(adj[i]) == 1:\n one += 1\n elif len(adj[i]) == 2:\n two += 1\n if one == 2 and two == n-2:\n ans = True\n return ans\n\n\ndef isRing() -> bool:\n ans = True\n for i in range(1, n+1):\n if len(adj[i]) != 2:\n ans = False\n break\n return ans\n\n\nif isStar():\n print(\"star topology\")\nelif isBus():\n print(\"bus topology\")\nelif isRing():\n print(\"ring topology\")\nelse:\n print(\"unknown topology\")\n \t \t \t\t \t \t \t\t\t \t \t \t\t", "n, m = [int(i) for i in input().split()]\n\ndegrees = [0] * n\nfor i in range(m):\n x, y = [int(i) for i in input().split()]\n degrees[x-1] += 1\n degrees[y-1] += 1\n\nones = degrees.count(1)\ntwos = degrees.count(2)\nlike_stars = degrees.count(n-1)\n\nif ones == 2 and twos == n-2:\n print(\"bus topology\")\nelif twos == n:\n print(\"ring topology\")\nelif like_stars == 1 and ones == n-1:\n print(\"star topology\")\nelse:\n print(\"unknown topology\")", "n, m = map(int, input().split())\r\ngr = []\r\nlg=[]\r\nk = 0\r\nfor i in range(n+1):\r\n gr.append([])\r\nfor i in range(m):\r\n x, y = map(int, input().split())\r\n gr[x].append(y)\r\n gr[y].append(x)\r\nfor i in range(len(gr)):\r\n lg.append(len(gr[i]))\r\nlg=lg[1:]\r\nk=max(lg)\r\nkm=min(lg)\r\nif k==km==2:\r\n print('ring topology')\r\nelif k==2 and km==1:\r\n print('bus topology')\r\nelif ((k == n-1 and km==1) or (k == (n-1)%k == 0 and km == 2)) and m+1==n:\r\n print('star topology')\r\nelse:\r\n print('unknown topology')", "int_inp = lambda: int(input()) #integer input\nstrng = lambda: input().strip() #string input\nstrl = lambda: list(input().strip())#list of strings as input\nmul = lambda: map(int,input().split())#multiple integers as inpnut\nmulf = lambda: map(float,input().split())#multiple floats as ipnut\nseq = lambda: list(map(int,input().split()))#list of integers\nimport math\nfrom collections import Counter,defaultdict\n\n\n\nn,m=map(int,input().split())\nl=[0]*n\nfor i in range(m):\n\tx,y=map(int,input().split())\n\tl[x-1]+=1\n\tl[y-1]+=1\n\nl.sort()\nif [1]*2+[2]*(n-2)==l:\n\tprint(\"bus topology\")\nelif [2]*n==l:\n\tprint(\"ring topology\")\nelif [1]*(n-1)+[n-1]==l:\n\tprint(\"star topology\")\nelse:\n\tprint(\"unknown topology\")\n", "from collections import defaultdict\nn, m = list(map(int, input().split()))\nG = defaultdict(list)\nD = defaultdict(int)\n\ndef checkIfStar(G, m, n):\n pass\n\ndef checkIfBus(D, G, m, n):\n arr = [0, 0, 0]\n for i in range(1, n+1):\n if D[i] == 1:\n arr[D[i]] += 1\n elif D[i] == 2:\n arr[D[i]] += 1\n else:\n return False\n if arr[1] == 2 and arr[2] == n-2:\n return True\n return False\n\ndef checkIfStar(D, G, m, n):\n arr = [0]*(n+1)\n for i in range(1, n+1):\n if D[i] == 1:\n arr[1] += 1\n elif D[i] == n-1:\n arr[n-1] += 1\n else:\n return False\n if arr[1] == n-1 and arr[n-1] == 1:\n return True\n return False\n\ndef checkIfRing(D, G, m, n):\n for i in range(1, n+1):\n if D[i] == 2:\n pass\n else:\n return False\n return True\n\nfor _ in range(m):\n x, y = list(map(int, input().split()))\n D[x] += 1\n D[y] += 1\n G[x].append(y)\n G[y].append(x)\n\nif m == n-1:\n if checkIfStar(D, G, m, n):\n print(\"star topology\")\n elif checkIfBus(D, G, m, n):\n print(\"bus topology\")\n else:\n print(\"unknown topology\")\nelif m == n:\n if checkIfRing(D, G, m, n):\n print(\"ring topology\")\n else:\n print(\"unknown topology\")\nelse:\n print(\"unknown topology\")\n\n \t\t \t\t\t \t \t\t \t\t\t\t\t \t\t \t", "n,m=map(int,input().split())\r\n\r\nc=[0 for _ in range(n)]\r\n\r\nfor _ in range(m):\r\n a,b=map(int,input().split())\r\n c[a-1]+=1\r\n c[b-1]+=1\r\n\r\ns=set(c)\r\nres=\"unknown\"\r\nif s=={2}:\r\n res=\"ring\"\r\nelif s=={1,2}:\r\n res=\"bus\"\r\nelif s=={1,m}:\r\n res=\"star\"\r\n\r\nprint(res+\" topology\")\r\n", "n,m=map(int,input().split())\r\ndegree=[0]*(n)\r\nfor _ in range(m):\r\n a,b=map(int,input().split())\r\n a-=1\r\n b-=1\r\n degree[a]+=1\r\n degree[b]+=1\r\na=0\r\nb=0\r\nc=0\r\nfor el in degree:\r\n if el==2:\r\n a+=1\r\n elif el==1:\r\n b+=1\r\n elif el==m:\r\n c+=1\r\nif a==n-2 and b==2:\r\n print(\"bus topology\")\r\nelif a==n:\r\n print(\"ring topology\")\r\nelif c and b==n-1:\r\n print(\"star topology\")\r\nelse :\r\n print(\"unknown topology\")\r\n ", "V_E = list(map(int, input().split()))\nedges = dict()\nfor i in range(V_E[0]):\n edges[i + 1] = list()\nfor i in range(V_E[1]):\n inpt = list(map(int, input().split()))\n edges[inpt[0]].append(inpt[1])\n edges[inpt[1]].append(inpt[0])\ntwoConnections = 0\noneConnections = 0\nconnectedAll = 0\nfor i in range(1, V_E[0] + 1):\n if (len(edges[i]) == 1):\n oneConnections += 1\n elif (len(edges[i]) == 2):\n twoConnections += 1\n elif (len(edges[i]) == V_E[0] - 1):\n connectedAll += 1\nif (oneConnections == V_E[0] - 1 and connectedAll == 1):\n print(\"star topology\")\nelif (twoConnections == V_E[0] - 2 and oneConnections == 2):\n print(\"bus topology\")\nelif (twoConnections == V_E[0]):\n print(\"ring topology\")\nelse :\n print(\"unknown topology\")\n ", "\r\nimport sys\r\nimport math\r\nn,m=map(int,input().split())\r\n\r\ndegree=[0]*(n+1)\r\n\r\nfor _ in range(0,int(m)):\r\n a,b=map(int,input().split())\r\n degree[a]=degree[a]+1\r\n degree[b]=degree[b]+1\r\n\r\n\r\nif degree.count(1)==2 and degree.count(2)==n-2:\r\n print('bus topology')\r\nelif degree.count(2)==n:\r\n print('ring topology')\r\nelif degree.count(1)==n-1 and degree.count(n-1)==1:\r\n print('star topology')\r\nelse:\r\n print('unknown topology')\r\n", "n,m=map(int,input().split())\n\nl=[0]*n\n\nd=l[:]\n\nfor _ in range(m):\n\n a,b=map(int,input().split())\n\n l[a-1]+=1\n\n l[b-1]+=1\n\nfor i in l:\n\n d[i]+=1\n\nif(d[1]==2 and d[2]==n-2):\n\n print('bus topology')\n\nelif(d[2]==n):\n\n print('ring topology')\n\nelif(d[1]==n-1 and d[n-1]==1):\n\n print('star topology')\n\nelse:\n\n print('unknown topology')\n\n\n\n\n\n# Made By Mostafa_Khaled", "n, m = [int(x) for x in input().split()]\r\nneighbors = [[] for i in range(n)]\r\nlst = []\r\n\r\nfor i in range(m):\r\n x, y = [int(x) for x in input().split()]\r\n neighbors[x - 1].append(y)\r\n neighbors[y - 1].append(x)\r\n lst.append([x, y])\r\n\r\nkind = \"unknown\"\r\n\r\nones = 0\r\ntwos = 0\r\nfor link in neighbors:\r\n if len(link) == 1:\r\n ones += 1\r\n if len(link) == 2:\r\n twos += 1\r\n\r\nif ones == 2 and twos == n - 2:\r\n kind = \"bus\"\r\n\r\nif twos == n:\r\n kind = \"ring\"\r\n\r\nif ones == n - 1:\r\n kind = \"star\"\r\n\r\nprint(f\"{kind} topology\")", "mod = 1000000007\r\nii = lambda : int(input())\r\nsi = lambda : input()\r\ndgl = lambda : list(map(int, input()))\r\nf = lambda : map(int, input().split())\r\nil = lambda : list(map(int, input().split()))\r\nls = lambda : list(input())\r\nn,m=f()\r\nl=[0]*n\r\nfor _ in range(m):\r\n a,b=f()\r\n l[a-1]+=1\r\n l[b-1]+=1\r\nl.sort()\r\nif l[0]==1 and l[1]==1 and all(i==2 for i in l[2:]):\r\n print('bus topology')\r\nelif all(i==2 for i in l):\r\n print('ring topology')\r\nelif all(i==1 for i in l[:n-1]) and l[-1]==n-1:\r\n print('star topology')\r\nelse:\r\n print('unknown topology')", "# cook your dish here\r\nn,m=map(int,input().split())\r\nfrom collections import defaultdict \r\nax=defaultdict(list)\r\nfor i in range(m):\r\n a,b=map(int,input().split())\r\n ax[a].append(b)\r\n ax[b].append(a) \r\n\r\nlend=dict()\r\nfor i in range(1,n+1):\r\n j=len(ax[i]) \r\n try:\r\n lend[j]+=1 \r\n except KeyError:\r\n lend[j]=1 \r\n \r\nif(lend.get(2,0)==n):\r\n print('ring topology')\r\n \r\nelif(lend.get(1,0)==2 and lend.get(2,0)==n-2):\r\n print('bus topology')\r\n \r\nelif(lend.get(1,0)==n-1 and lend.get(n-1,0)==1):\r\n print('star topology')\r\n \r\nelse:\r\n print('unknown topology')", "import collections\r\n\r\nif __name__ == '__main__':\r\n n, m = list(map(int, input().strip().split()))\r\n deg = [0] * (n + 1)\r\n for i in range(m):\r\n x, y = list(map(int, input().strip().split()))\r\n deg[x] += 1; deg[y] += 1\r\n ans = collections.defaultdict(int)\r\n for i in range(1, n + 1):\r\n ans[deg[i]] += 1\r\n if len(ans) == 1 and ans[2] == n:\r\n print(\"ring topology\")\r\n elif len(ans) == 2 and ans[1] == 2 and ans[2] == n - 2:\r\n print(\"bus topology\")\r\n elif len(ans) == 2 and ans[n - 1] == 1 and ans[1] == n - 1:\r\n print(\"star topology\")\r\n else:\r\n print(\"unknown topology\")", "n,m=map(int,input().split())\r\nl=[0]*n\r\nfor i in range(m):\r\n\tx,y=map(int,input().split())\r\n\tl[x-1]+=1\r\n\tl[y-1]+=1\r\n\r\nl.sort()\r\nif [1]*2+[2]*(n-2)==l:\r\n\tprint(\"bus topology\")\r\nelif [2]*n==l:\r\n\tprint(\"ring topology\")\r\nelif [1]*(n-1)+[n-1]==l:\r\n\tprint(\"star topology\")\r\nelse:\r\n\tprint(\"unknown topology\")", "n, m = map(int, input().split())\r\n\r\ngraph = {i: [] for i in range(1, n+1)}\r\n\r\nfor i in range(m):\r\n a, b = map(int, input().split())\r\n \r\n graph[a].append(b)\r\n graph[b].append(a)\r\n\r\nres = 'unknown topology'\r\nif n == m + 1:\r\n k2 = 0\r\n k13 = 0\r\n for key in graph:\r\n if len(graph[key]) == m:\r\n res = 'star topology'\r\n break\r\n if len(graph[key]) in (1, 3):\r\n k13 += 1\r\n elif len(graph[key]) == 2:\r\n k2 += 1\r\n else:\r\n break\r\n else:\r\n if k13 == 2 and k2 == n - 2:\r\n res = 'bus topology'\r\nif n == m and all([len(graph[key]) == 2 for key in graph]):\r\n tmp = graph[1]\r\n s = set()\r\n for _ in range(n):\r\n if tmp[0] not in s:\r\n s.add(tmp[0])\r\n tmp = graph[tmp[0]]\r\n else:\r\n s.add(tmp[1])\r\n tmp = graph[tmp[1]]\r\n if len(s) == n:\r\n res = 'ring topology'\r\nprint(res)\r\n ", "n, m = map(int, input().split())\ngraph = dict(zip([i + 1 for i in range(n)], [[] for i in range(n)]))\nfor _ in range(m):\n u, v = map(int, input().split())\n graph[u].append(v)\n graph[v].append(u)\nfreq = {}\nfor key in graph:\n if len(graph[key]) in freq:\n freq[len(graph[key])] += 1\n else:\n freq[len(graph[key])] = 1\nif len(freq) == 2 and 1 in freq and 2 in freq:\n print('bus topology')\nelif len(freq) == 1 and 2 in freq:\n print('ring topology')\nelif len(freq) == 2 and 1 in freq and n - 1 in freq:\n print('star topology')\nelse:\n print('unknown topology')\n", "from collections import Counter, defaultdict\r\nfrom itertools import count\r\n\r\nL,E = map(int,input().split())\r\nhash_map = defaultdict(int)\r\nfor _ in range(E):\r\n s,e = map(int,input().split())\r\n hash_map[s] += 1\r\n hash_map[e] += 1\r\nval = sorted(hash_map.values())\r\nhash_set = set(val)\r\n# c = Counter(val)\r\n# print(hash_set)\r\nif len(hash_set) == 1 and 2 in hash_set:\r\n print(\"ring topology\")\r\nelif len(hash_set) == 2 and 2 in hash_set and 1 in hash_set:\r\n print(\"bus topology\")\r\nelif len(hash_set) == 2 and 1 in hash_set and val[-2] == 1:\r\n # print(hash_set)\r\n print(\"star topology\")\r\nelse:\r\n print(\"unknown topology\")\r\n", "n, m = map(int, input().split())\r\na = []\r\nfor i in range(0, n+1):\r\n a.append([])\r\nfor i in range(m):\r\n i, j = map(int, input().split())\r\n a[i].append(j)\r\n a[j].append(i)\r\nc = 0\r\nd = 0\r\nf = 0\r\nfor el in a:\r\n if(len(el)==1):\r\n c+=1 \r\n elif(len(el)==2):\r\n d+=1 \r\n elif(len(el)==n-1):\r\n f+=1 \r\nif(c==2 and d==n-2):\r\n print(\"bus topology\")\r\nelif(d==n):\r\n print(\"ring topology\")\r\nelif(f==1 and c==n-1):\r\n print(\"star topology\")\r\nelse:\r\n print(\"unknown topology\")", "n, m = map(int, input().split())\r\nd = [0] * (n + 1)\r\nc = [0] * (n + 1)\r\nfor i in range(m):\r\n for x in list(map(int, input().split())):\r\n d[x] += 1\r\nfor x in d: c[x] += 1\r\nif c[2] == n: print('ring topology')\r\nelif c[1] == n - 1 and c[n - 1] == 1: print('star topology')\r\nelif c[2] == n - 2 and c[1] == 2: print('bus topology')\r\nelse: print('unknown topology')", "def star(graph, n, m):\r\n\tif m != n - 1:\r\n\t\treturn False\r\n\r\n\tfor k in graph:\r\n\t\tif k == n - 1:\r\n\t\t\treturn True\r\n\r\n\treturn False\r\n\r\ndef bus(graph):\r\n\tc = 2\r\n\tfor k in graph:\r\n\t\tif k == 1:\r\n\t\t\tc -= 1\r\n\t\telif k != 2:\r\n\t\t\treturn False \r\n\r\n\treturn c == 0\r\n\r\ndef ring(graph):\r\n\tfor k in graph:\r\n\t\tif k != 2:\r\n\t\t\treturn False\r\n\r\n\treturn True\r\n\r\n\r\ndef solve(graph, n, m):\r\n\tif bus(graph):\r\n\t\treturn 'bus topology'\r\n\tif star(graph, n, m):\r\n\t\treturn 'star topology'\r\n\tif ring(graph):\r\n\t\treturn 'ring topology'\r\n\t\r\n\treturn 'unknown topology'\r\n\r\nn, m = map(int, input().split())\r\ngraph = [0] * n\r\n\r\nfor _ in range(m):\r\n\tu, v = map(lambda x: int(x) - 1, input().split())\r\n\tgraph[u] += 1\r\n\tgraph[v] += 1\r\n\r\nprint(solve(graph, n, m))", "n,m=map(int,input().split())\r\ngraph={i:[] for i in range(1,n+1)}\r\nfor i in range(m):\r\n u,v=map(int,input().split())\r\n graph[u].append(v)\r\n graph[v].append(u)\r\ndegree={i:0 for i in range(1,n+1)}\r\ntot_degree={i:0 for i in range(1,n+1)}\r\nfor i in range(1,n+1):\r\n ln=len(graph[i])\r\n degree[i]=ln\r\n tot_degree[ln]+=1\r\n#print(tot_degree)\r\n\r\nif m==(n-1) and tot_degree[1]==2 and tot_degree[2]==(n-2):\r\n print(\"bus topology\")\r\nelif m==n and tot_degree[2]==n:\r\n print(\"ring topology\")\r\nelif m==(n-1) and tot_degree[n-1]==1 and tot_degree[1]==(n-1):\r\n print(\"star topology\")\r\nelse:\r\n print(\"unknown topology\")\r\n", "import sys\nimport math\nimport string\n\ndef getRes(connections, n, m):\n bus = 0\n for i in range(1, n + 1):\n if connections[i] == 1:\n bus += 1\n elif connections[i] == n - 1 and m == n - 1:\n print(\"star topology\")\n return\n elif connections[i] != 2:\n print(\"unknown topology\")\n return\n\n if bus == 2:\n print(\"bus topology\")\n else:\n print(\"ring topology\")\n return\n\nif __name__ == \"__main__\":\n [n, m] = [int(i) for i in sys.stdin.readline().split()]\n connections = [0 for x in range(n + 1)]\n for i in range(m):\n [x, y] = [int(i) for i in sys.stdin.readline().split()]\n connections[x] += 1\n connections[y] += 1\n getRes(connections, n, m)\n \t \t \t\t\t\t\t\t \t\t\t \t\t \t\t \t\t\t\t\t", "import sys, os.path\r\nfrom collections import*\r\nfrom copy import*\r\nimport math\r\nmod=10**9+7\r\nif(os.path.exists('input.txt')):\r\n sys.stdin = open(\"input.txt\",\"r\")\r\n sys.stdout = open(\"output.txt\",\"w\") \r\n\r\n\r\n\r\nadj=defaultdict()\r\nn,m=map(int,input().split())\r\nfor i in range(m):\r\n x,y=map(int,input().split())\r\n if x not in adj:\r\n adj[x]=1\r\n else:\r\n adj[x]+=1\r\n if y not in adj:\r\n adj[y]=1\r\n else:\r\n adj[y]+=1\r\n\r\nc1=0\r\nc2=0\r\ncn=0\r\nfor i in adj:\r\n if(adj[i]==1):\r\n c1+=1\r\n elif(adj[i]==2):\r\n c2+=1\r\n elif(adj[i]==n-1):\r\n cn+=1\r\nif(c1==2 and c2==n-2):\r\n print('bus topology')\r\nelif(c2==n):\r\n print('ring topology')\r\nelif(cn==1 and c1==n-1):\r\n print('star topology')\r\nelse:\r\n print('unknown topology')\r\n\r\n \r\n", "n, m = map(int, input().split())\r\ngraph = {i: [] for i in range(1, n + 1)}\r\nM = m\r\nwhile M:\r\n s, d = map(int, input().split())\r\n graph[s].append(d)\r\n graph[d].append(s)\r\n M = M - 1\r\nif m == n - 1:\r\n one = 0\r\n two = 0\r\n bus = True\r\n for i in graph:\r\n if len(graph[i]) == 1:\r\n one = one + 1\r\n elif len(graph[i]) == 2:\r\n two = two + 1\r\n else:\r\n bus = False\r\n if one == 2 and two == n - 2 and bus:\r\n print('bus topology')\r\n exit()\r\nif m == n:\r\n two = 0\r\n ring = True\r\n for i in graph:\r\n if len(graph[i]) == 2:\r\n two = two + 1\r\n else:\r\n ring = False\r\n if two == n and ring:\r\n print('ring topology')\r\n exit()\r\nif m == n - 1:\r\n one = 0\r\n more_one = 0\r\n star = True\r\n for i in graph:\r\n if len(graph[i]) == 1:\r\n one = one + 1\r\n elif len(graph[i]) == n - 1:\r\n more_one = more_one + 1\r\n else:\r\n star = False\r\n if one == n - 1 and star:\r\n print('star topology')\r\n exit()\r\nprint('unknown topology')\r\nexit()", "n, m = map(int, input().split())\r\n\r\ng = {}\r\n\r\nfor _ in range(m):\r\n a, b = map(int, input().split())\r\n if a not in g:\r\n g[a] = set()\r\n if b not in g:\r\n g[b] = set()\r\n\r\n g[a].add(b)\r\n g[b].add(a)\r\n\r\nn1 = []\r\nn2 = []\r\nfor k in range(1, n + 1):\r\n if len(g[k]) == 1:\r\n n1.append(k)\r\n elif len(g[k]) == 2:\r\n n2.append(k)\r\nif len(n1) == 2 and len(n2) == n - 2:\r\n print('bus topology')\r\n quit()\r\n\r\nn1 = []\r\nfor k in range(1, n + 1):\r\n if len(g[k]) == 2:\r\n n1.append(k)\r\nif len(n1) == n:\r\n print('ring topology')\r\n quit()\r\n\r\nn1 = []\r\nn2 = []\r\nfor k in range(1, n + 1):\r\n if len(g[k]) == 1:\r\n n1.append(k)\r\n else:\r\n n2.append(k)\r\nif len(n1) == n - 1 and len(g[n2[0]]) == n - 1:\r\n print('star topology')\r\n quit()\r\n\r\nprint('unknown topology')\r\n", "n, m = [int(i) for i in input().split()]\r\ngraf = [[] for i in range(n + 1)]\r\nfor i in range(m):\r\n k1, k2 = [int(i) for i in input().split()]\r\n graf[k1].append(k2)\r\n graf[k2].append(k1)\r\n\r\nseks = [0, 0, 0]\r\nfor i in range(1, n + 1):\r\n if len(graf[i]) == 1 or len(graf[i]) == 2:\r\n seks[len(graf[i])] += 1\r\n else:\r\n seks[0] += 1\r\n\r\nif seks[0] == 0 and seks[1] == 2:\r\n print('bus topology')\r\nelif seks[0] == seks[1] == 0:\r\n print('ring topology')\r\nelif seks[0] == 1 and seks[2] == 0:\r\n print('star topology')\r\nelse:\r\n print('unknown topology')\r\n", "n,m = map(int, input().split())\r\na = [[] for _ in range(n)]\r\n\r\nfor i in range(m):\r\n x,y = map(int, input().split())\r\n x -= 1\r\n y -= 1\r\n a[x].append(y)\r\n a[y].append(x)\r\n \r\ns1 = 0\r\ns2 = 0\r\ns3 = 0\r\nfor i in a:\r\n if len(i) == 1:\r\n s1 += 1\r\n if len(i) == n - 1:\r\n s2 += 1\r\n if len(i) == 2:\r\n s3 += 1\r\nif s1 == n-1 and s2 == 1:\r\n print(\"star topology\")\r\n exit()\r\n \r\nvis = [False] * n\r\nif s3 == n:\r\n vis[0] = True\r\n cur = 0\r\n for i in range(1, n):\r\n if not vis[a[cur][0]]:\r\n cur = a[cur][0]\r\n else:\r\n cur = a[cur][1]\r\n vis[cur] = True\r\n x = 0\r\n for i in range(n):\r\n if vis[i] == True:\r\n x += 1\r\n if x == n:\r\n print(\"ring topology\")\r\n exit()\r\nelif s3 == n-2 and s1 == 2:\r\n cur = 0\r\n for i in range(n):\r\n if len(a[i]) == 1:\r\n cur = i\r\n break\r\n vis[cur] = True\r\n vis[a[cur][0]] = True\r\n cur = a[cur][0]\r\n for i in range(1, n-1):\r\n if not vis[a[cur][0]]:\r\n cur = a[cur][0]\r\n else:\r\n cur = a[cur][1]\r\n vis[cur] = True\r\n x = 0\r\n for i in range(n):\r\n if vis[i]:\r\n x += 1\r\n if x == n and len(a[cur]) == 1:\r\n print(\"bus topology\")\r\n exit()\r\nprint(\"unknown topology\")", "I = lambda : map(int, input().split())\r\nv, e = I()\r\nD = [0]*(v+1)\r\nif not ( e == v or e == v-1):\r\n print('unknown topology')\r\nelse:\r\n for _ in range(e):\r\n for x in I():\r\n D[x] += 1\r\n a, b, c =0, 0, 0\r\n for degree in D[1:]:\r\n if degree == 1:\r\n a += 1\r\n elif degree == 2:\r\n b += 1\r\n elif degree == v - 1:\r\n c += 1\r\n if a == 2 and b == v - 2 and c == 0 and e == v - 1:\r\n print('bus topology')\r\n elif a == 0 and b == v and c == 0 and e == v:\r\n print('ring topology')\r\n elif a == v - 1 and b == 0 and c == 1 and e == v - 1:\r\n print('star topology')\r\n else:\r\n print('unknown topology')\r\n", "import collections\r\nnodes, edgec = map(int, input().split())\r\nconnected = collections.defaultdict(int)\r\nfor _ in range(edgec):\r\n edge = [int(i) for i in input().split()]\r\n connected[edge[0]] += 1\r\n connected[edge[1]] += 1\r\ndef f():\r\n if nodes == edgec:\r\n for node in range(1, nodes+1):\r\n if connected[node] != 2:\r\n return \"unknown\"\r\n return \"ring\"\r\n if nodes == edgec + 1:\r\n bus = True\r\n found_middle = False\r\n star = True\r\n for node in range(1, nodes+1):\r\n if connected[node] != 1:\r\n if connected[node] != 2:\r\n bus = False\r\n if found_middle:\r\n star = False\r\n else:\r\n found_middle = True\r\n if bus:\r\n return \"bus\"\r\n if star:\r\n return \"star\"\r\n return \"unknown\"\r\n return \"unknown\"\r\nprint(f(),\"topology\")\r\n", "import sys\ninp = lambda: sys.stdin.readline()\nn, m = map(int, inp().split())\nd = [0] * (n)\nfor _ in range(m):\n x, y = map(int, inp().split())\n d[x - 1] += 1\n d[y - 1] += 1\nmaxm = max(d)\nminm = min(d)\nmaxm_count = d.count(maxm)\nminm_count = d.count(minm)\nif (maxm == 2 and maxm_count == n - 2 and minm == 1 and minm_count == 2) or (n == 2 and maxm == 1 and minm == 1):\n print(\"bus topology\")\nelif (maxm == minm == 2 and maxm_count == n):\n print(\"ring topology\")\nelif (maxm == n - 1 and maxm_count == 1 and minm == 1 and minm_count == n - 1):\n print(\"star topology\")\nelse:\n print(\"unknown topology\")", "def solve():\r\n k = [len(i) for i in list(d.values())]\r\n s = sorted([*set(k)])\r\n if s == [1, 2]:\r\n return \"bus topology\"\r\n if len(s) == 2 and s[0] == 1 and s[1] == n - 1:\r\n return \"star topology\"\r\n if len(s) == 1 and s[0] == 2:\r\n return \"ring topology\"\r\n return \"unknown topology\"\r\n\r\nn, m = map(int, input().split())\r\nd = {}\r\nfor i in range(1, m + 1):\r\n x, y = map(int, input().split())\r\n if x not in d:\r\n d[x] = []\r\n if y not in d:\r\n d[y] = []\r\n d[x].append(y)\r\n d[y].append(x)\r\nprint(solve())", "import math\r\n\r\n\r\n\r\n\r\ndef main_function():\r\n bus = \"bus topology\"\r\n ring = \"ring topology\"\r\n star = \"star topology\"\r\n unknown = \"unknown topology\"\r\n is_ring = True\r\n n, m = [int(i) for i in input().split(\" \")]\r\n new_network =[[] for i in range(n + 1)]\r\n for i in range(m):\r\n a, b = sorted([int(k) for k in input().split(\" \")])\r\n new_network[a].append(b)\r\n new_network[b].append(a)\r\n for i in range(1, n + 1):\r\n if len(new_network[i]) != 2:\r\n is_ring = False\r\n if is_ring:\r\n print(ring)\r\n else:\r\n is_bus = True\r\n counter = 0\r\n for i in range(1, n + 1):\r\n if len(new_network[i]) != 1 and len(new_network[i]) != 2:\r\n is_bus = False\r\n else:\r\n if len(new_network[i]) == 1:\r\n counter += 1\r\n if counter != 2:\r\n is_bus = False\r\n\r\n if is_bus:\r\n print(bus)\r\n else:\r\n #print(new_network)\r\n is_star = True\r\n center_found = False\r\n for i in range(1, n + 1):\r\n if len(new_network[i]) != 1 and len(new_network[i]) != (n - 1):\r\n is_star = False\r\n if not center_found:\r\n if len(new_network[i]) == (n - 1):\r\n center_found = True\r\n else:\r\n if len(new_network[i]) != 1:\r\n is_star = False\r\n if is_star:\r\n print(star)\r\n else:\r\n print(unknown)\r\n\r\n\r\n\r\n\r\n\r\n\r\nmain_function()\r\n\r\n\r\n", "N = 1e5+5\nM = 1e5+5\nn,m = map(int,input().split(' '))\nd=[]\nfor i in range(0,n+1):\n d.append(0)\nfor i in range(0,m):\n u,v = map(int,input().split(' '))\n d[u]+=1\n d[v]+=1\nflag1=1\nflag2=1\nflag3=1\nd1=0\nd2=0\nstar_cent = 0\nfor i in range(1,n+1):\n if(d[i]==1): d1+=1\n if(d[i]==2): d2+=1\n else: flag2=0\n if(d[i]==n-1): star_cent+=1\n\nif(d1==2 and d2 == n-2):\n print(\"bus topology\")\nelif(flag2):\n print(\"ring topology\")\nelif(star_cent==1 and d1==n-1):\n print(\"star topology\")\nelse:\n print(\"unknown topology\")", "n, m = [int(a) for a in input().split()]\r\nlist = [None] + [[] for num in range(1, n+1)]\r\nfor roads in range(m):\r\n x, y = [int(i) for i in input().split()]\r\n list[x].append(y)\r\n list[y].append(x)\r\ncount = [0 for num in range(n)]\r\nfor index in range(1, n+1):\r\n count[len(list[index])] += 1\r\nif count[1] == 2 and count[2] == n-2:\r\n ans = \"bus\"\r\nelif count[2] == n:\r\n ans = \"ring\"\r\nelif count[1] == n-1 and count[n-1] == 1:\r\n ans = \"star\"\r\nelse:\r\n ans = \"unknown\"\r\nprint(ans, \"topology\")", "n, m = map(int, input().split())\r\nA = [0]*n\r\nfor _ in range(m):\r\n a, b = map(int, input().split())\r\n A[a-1] += 1\r\n A[b-1] += 1\r\nx = set(A)\r\nif x == {2}:\r\n print(\"ring topology\")\r\nelif x == {1, 2}:\r\n print(\"bus topology\")\r\nelif x == {1, m}:\r\n print(\"star topology\")\r\nelse:\r\n print(\"unknown topology\")\r\n ", "from collections import defaultdict\r\n\r\nn, m = map(int, input().split())\r\ngraph = defaultdict(list)\r\n\r\nfor _ in range(m):\r\n a, b = map(int, input().split())\r\n graph[a].append(b)\r\n graph[b].append(a)\r\n\r\ndic = {1:0, 2:0, 3:0}\r\nfor i in range(1, n + 1):\r\n if len(graph[i]) == 1:\r\n dic[1] += 1\r\n elif len(graph[i]) == 2:\r\n dic[2] += 1\r\n else: \r\n dic[3] += 1\r\n\r\n\r\nif dic[1] == 2 and dic[2] == n - 2: \r\n print(\"bus topology\")\r\n\r\nelif dic[1] == 0 and dic[2] == n:\r\n print(\"ring topology\")\r\n\r\nelif dic[1] == n - 1 and dic[3] == 1: \r\n print(\"star topology\")\r\n\r\nelse: \r\n print(\"unknown topology\")\r\n\r\n ", "n,e=map(int,input().split())\nnetwork={str(i):[] for i in range(1,n+1)}\nstar=False\nfor _ in range(e):\n x,y=input().split()\n network[x].append(y)\n network[y].append(x)\ncount=0\ncount2=0\nfor i in network.values():\n if len(i)==e: star=True\n elif len(i)==1:\n count+=1\n elif len(i)==2:\n count2+=1\n\nif star:\n print('star topology')\nelif count2==n:\n print('ring topology')\nelif count==2 and count2==n-2:\n print('bus topology')\nelse:\n print('unknown topology')\n\n \t \t \t\t\t\t\t \t \t\t \t \t \t\t", "n,m = map(int, input().split())\r\ndb = [[] for i in range(n)]\r\nfor i in range(m):\r\n x,y = map(int, input().split())\r\n db[x-1].append(y)\r\n db[y-1].append(x)\r\n\r\none = 0\r\ntwo = 0\r\nmx = 0\r\nfor i in range(n):\r\n ln = len(db[i])\r\n if ln == 1:\r\n one += 1\r\n elif ln == 2:\r\n two += 1\r\n mx = max(mx,ln)\r\nif one == 2 and two == n-2:\r\n print(\"bus topology\")\r\nelif two == n:\r\n print(\"ring topology\")\r\nelif one == n-1 and mx == n-1:\r\n print(\"star topology\")\r\nelse:\r\n print(\"unknown topology\")", "from sys import stdin, stdout\nfrom collections import defaultdict\n\n\ngraph = defaultdict(list)\nn, m = stdin.readline().split()\nn = int(n)\nm = int(m)\nfor i in range(0, m):\n edges = stdin.readline().split()\n graph[int(edges[0])].append(int(edges[1]))\n graph[int(edges[1])].append(int(edges[0]))\nstar = False\nsum_1 = 0\nsum_2 = 0\nfor i in range(1, n + 1):\n len_i = len(graph[i])\n if len_i == m:\n star = True\n elif len_i == 1:\n sum_1 += 1\n elif len_i == 2:\n sum_2 += 1\nif star:\n print(\"star topology\")\nelse:\n if sum_1 == 2 and sum_2 == n-2:\n print(\"bus topology\")\n elif sum_1 == 0 and sum_2 == n:\n print(\"ring topology\")\n else:\n print(\"unknown topology\")\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\nroadcount = [0 for i in range(N)]\r\nfor i in range(M):\r\n a,b = map(int, input().split())\r\n roadcount[a-1] += 1\r\n roadcount[b-1] += 1\r\nif set(roadcount) == {2}:\r\n print(\"ring topology\")\r\nelif set(roadcount) == {1,2}:\r\n print(\"bus topology\")\r\nelif set(roadcount) == {1,M}:\r\n print(\"star topology\")\r\nelse:\r\n print(\"unknown topology\")", "n,m=list(map(int,input().split()))\r\nd=dict()\r\nfor i in range(m):\r\n x,y=list(map(int,input().split()))\r\n if x in d:\r\n d[x].add(y)\r\n else:\r\n d[x]=set()\r\n d[x].add(y)\r\n if y in d:\r\n d[y].add(x)\r\n else:\r\n d[y]=set()\r\n d[y].add(x)\r\n\r\nx=0\r\ny=0\r\nz=0\r\nfor i in d:\r\n if len(d[i])==1:\r\n x+=1\r\n elif len(d[i])==2:\r\n y+=1\r\n elif len(d[i])==m:\r\n z+=1\r\n\r\nif x==n-1 and y==0 and z==1:\r\n print(\"star topology\")\r\nelif x==2 and y==n-2 and z==0:\r\n print(\"bus topology\")\r\nelif x==0 and y==n and z==0:\r\n print(\"ring topology\")\r\nelse:\r\n print(\"unknown topology\")", "def bus_topology(neigh):\r\n\t#check if exactly two nodes have 1 neighbor\r\n\t#check if all other nodes have 2 neighbors\r\n\tsingle_neighbors = 0\r\n\tfor i in range(1, len(neigh)):\r\n\t\tif len(neigh[i]) == 1:\r\n\t\t\tsingle_neighbors += 1\r\n\t\telif len(neigh[i]) > 2:\r\n\t\t\treturn False\r\n\t\r\n\tif single_neighbors == 2:\r\n\t\treturn True\r\n\telse:\r\n\t\treturn False\r\n\r\ndef ring_topology(neigh):\r\n\t#check if all nodes have exactly two neighbors\r\n\tfor i in range(1, len(neigh)):\r\n\t\tif len(neigh[i]) > 2:\r\n\t\t\treturn False\r\n\treturn True\r\n\r\ndef star_topology(neigh, n):\r\n\t#check if one node has n-1 neighbors\r\n\t#check if all nodes have 1 neighbor \r\n\tcenternode = 0\r\n\tfor i in range(1, len(neigh)):\r\n\t\tif len(neigh[i]) == n-1:\r\n\t\t\tcenternode += 1\r\n\t\telif len(neigh[i]) != 1:\r\n\t\t\treturn False\r\n\r\n\tif centernode == 1:\r\n\t\treturn True\r\n\telse:\r\n\t\treturn False\r\n\r\nn,m = [int(x) for x in input().split()]\r\n#nodes, edges\r\nneighbors = [[] for x in range(n+1)]\r\n\r\nfor i in range(m):\r\n\tu,v = (int(x) for x in input().split())\r\n\tneighbors[u].append(v)\r\n\tneighbors[v].append(u)\r\n\r\n#for i in range(len(neighbors)):\r\n#\tprint(i, neighbors[i])\r\n\r\nif bus_topology(neighbors):\r\n\tprint(\"bus topology\")\r\nelif ring_topology(neighbors):\r\n\tprint(\"ring topology\")\r\nelif star_topology(neighbors,n):\r\n\tprint(\"star topology\")\r\nelse:\r\n\tprint(\"unknown topology\")", "n, m = map(int, input().split())\r\nl = []\r\nc = n * [0]\r\nfor _ in range(m):\r\n t = tuple(map(int, input().split()))\r\n for i in t:\r\n c[i - 1] += 1\r\n l.append(t)\r\nif (s := set(c)) == {1, 2, 1}:\r\n print('bus topology')\r\nelif s == {2}:\r\n print('ring topology')\r\nelif max(c) == m:\r\n print('star topology')\r\nelse:\r\n print('unknown topology')", "from collections import Counter\r\n\r\nn, m = map(int, input().split())\r\n\r\ng = [[] for _ in range(n)]\r\n\r\nfor i in range(m):\r\n x, y = map(int, input().split())\r\n g[x - 1].append(y - 1)\r\n g[y - 1].append(x - 1)\r\n\r\nbus = ([2] * (n - 2)) + ([1] * 2)\r\nstar = [1] * (n - 1) + [n - 1]\r\n\r\nlns = [len(lst) for lst in g]\r\nif lns == [2] * n:\r\n print(\"ring topology\")\r\nelif Counter(lns) == Counter(bus):\r\n print(\"bus topology\")\r\nelif Counter(lns) == Counter(star):\r\n print(\"star topology\")\r\nelse:\r\n print(\"unknown topology\")", "n,m=map(int,input().split())\ng=[0 for _ in range(n)]\nfor _ in range(m):\n x,y=map(int,input().split())\n g[x-1]+=1\n g[y-1]+=1\nif m==n and max(g)==min(g)==2:\n print('ring topology')\nelif m==n-1 and max(g)<3:\n print('bus topology')\nelif m==n-1 and max(g)==n-1:\n print('star topology')\nelse:\n print('unknown topology')\n", "def networkTopology():\r\n n, m = map(int, input().split(\" \"))\r\n points = [0] * n\r\n for i in range(m):\r\n a, b = map(int, input().split(\" \"))\r\n points[a - 1] += 1\r\n points[b - 1] += 1\r\n if points.count(1) == n - 1:\r\n print(\"star topology\")\r\n elif points.count(2) == n:\r\n print(\"ring topology\")\r\n elif points.count(1) == 2 and points.count(2) == n - 2:\r\n print(\"bus topology\")\r\n else:\r\n print(\"unknown topology\")\r\n\r\nnetworkTopology()", "n,m=map(int,input().split())\r\ncoords=[]\r\nfor i in range(m):\r\n coords.append(list(map(int,input().split())))\r\nif n==m:\r\n temp=[0]*n\r\n for i in range(n):\r\n temp[coords[i][0]-1]+=1\r\n temp[coords[i][1]-1]+=1\r\n if temp.count(2)==len(temp):\r\n print(\"ring topology\")\r\n else:\r\n print(\"unknown topology\")\r\nelse:\r\n temp=[0]*n\r\n for i in range(m):\r\n temp[coords[i][0]-1]+=1\r\n temp[coords[i][1]-1]+=1\r\n temp2=set(coords[0])\r\n for i in range(1,m):\r\n temp2 &=set(coords[i])\r\n if len(temp2)>0:\r\n print(\"star topology\")\r\n elif temp.count(1)==2 and temp.count(2)==len(temp)-2:\r\n print(\"bus topology\")\r\n else:\r\n print(\"unknown topology\")\r\n\r\n", "#!/usr/bin/env python3\nfrom collections import Counter\n\n\ndef is_ring(edges: list[int]) -> bool:\n # a graph is a ring if all nodes have 2 edges\n return all(e == 2 for e in edges)\n\n\ndef is_bus(edges: list[int], n: int) -> bool:\n # a graph is a bus if 2 nodes have 1 edge and all remaining have 2 edges\n c = Counter(edges)\n return c[1] == 2 and c[2] == n - 2\n\n\ndef is_star(edges: list[int], n: int) -> bool:\n # a graph is a star if one node has (n-1) edges and all remaining have 1 edge\n c = Counter(edges)\n return c[n-1] == 1 and c[1] == n-1\n\n\ndef solve():\n n, m = map(int, input().split())\n\n edge_count = [0] * n\n\n for _ in range(m):\n u, v = map(int, input().split())\n edge_count[u-1] += 1\n edge_count[v-1] += 1\n\n\n if (is_ring(edge_count)):\n print(\"ring topology\")\n elif (is_bus(edge_count, n)):\n print(\"bus topology\")\n elif (is_star(edge_count, n)):\n print(\"star topology\")\n else:\n print(\"unknown topology\")\n\nsolve()", "def checkTopology(network, n, e):\r\n\tif e == n-1:\r\n\t\t#bus\r\n\t\tif sum([len(y)==1 for x,y in network.items()]) == 2:\r\n\t\t\treturn \"bus\"\r\n\t\t#star\r\n\t\telif any([len(y)==e for x, y in network.items()]):\r\n\t\t\treturn \"star\"\r\n\telif e == n:\r\n\t\t#ring\r\n\t\tif all([len(y)==2 for x, y in network.items()]):\r\n\t\t\treturn \"ring\"\r\n\treturn \"unknown\"\\\r\n\r\n\r\nnodes, edges = [int(x) for x in input().split()]\r\n\r\nconnections = {}\r\n\r\nfor n in range(1, nodes+1):\r\n\tconnections[n] = []\r\n\r\nfor e in range(edges):\r\n\tn, m = [int(x) for x in input().split()]\r\n\tconnections[n].append(m)\r\n\tconnections[m].append(n)\r\n\r\n#print(connections)\r\n\r\nprint(checkTopology(connections, nodes, edges), \"topology\")\r\n\r\n", "n, m = map(int,input().split())\r\nadj = [[] for i in range(n)]\r\nfor i in range(m):\r\n\tu, v = map(int,input().split())\r\n\tu -= 1\r\n\tv -=1\r\n\r\n\tadj[u].append(v)\r\n\tadj[v].append(u)\r\n\r\ndef count(d):\r\n\treturn len([1 for u in range(n) if len(adj[u])==d])\r\n\r\ndef identify():\r\n\tif count(2)==n:\r\n\t\treturn \"ring\"\r\n\telif count(n-1)==1 and count(1)==n-1:\r\n\t\treturn \"star\"\r\n\telif count(2)==n-2 and count(1)==2:\r\n\t\treturn \"bus\"\r\n\telse:\r\n\t\treturn \"unknown\"\r\n\r\nprint(identify(),\"topology\")\r\n\r\n", "n, m = [int(i) for i in input().split()]\r\ns = []\r\nfor i in range(n + 1):\r\n s.append([])\r\nfor i in range(m):\r\n x, y = [int(i) for i in input().split()]\r\n s[x].append(y)\r\n s[y].append(x)\r\nsbool = [False] * (n + 1)\r\nv2 = 0\r\nv1 = 0\r\nother = 0\r\ndef dfs(new):\r\n global sbool, s, v2, v1, other\r\n sbool[new] = True\r\n if len(s[new]) == 1:\r\n v1 += 1\r\n elif len(s[new]) == 2:\r\n v2 += 1\r\n else:\r\n other += 1\r\nfor i in range(1, n + 1):\r\n dfs(i)\r\n\r\nif v1 == 2 and v2 == n - 2:\r\n print('bus topology')\r\nelif v1 == n - 1 and other == 1:\r\n print('star topology')\r\nelif v2 == n:\r\n print('ring topology')\r\nelse:\r\n print('unknown topology')\r\n\r\n\r\n\r\n\r\n", "n,m = [int(x) for x in input().split()]\r\nadj = [[] for x in range(n+1)]\r\nfor _ in range(m):\r\n a,b = [int(x) for x in input().split()]\r\n adj[a].append(b)\r\n adj[b].append(a)\r\ncnt = []\r\nfor x in range(1,n+1):\r\n cnt.append(len(adj[x]))\r\ncnt.sort()\r\nones = 0\r\ntwos = 0\r\nfor x in cnt:\r\n if x == 1:\r\n ones += 1\r\n elif x == 2:\r\n twos += 1\r\nif ones == 2 and twos == n-2:\r\n print(\"bus topology\")\r\nelif twos == n:\r\n print(\"ring topology\")\r\nelif ones == n-1:\r\n print(\"star topology\")\r\nelse:\r\n print(\"unknown topology\")", "n,m=map(int,input().split())\r\narr=[0]*(n+1)\r\nfor w in range(m):\r\n a,b=map(int,input().split())\r\n arr[a]+=1\r\n arr[b]+=1\r\nc1=0\r\nc2=0\r\ncs=0\r\nfor i in range(1,n+1):\r\n if arr[i]==1:\r\n c1+=1\r\n if arr[i]==2:\r\n c2+=1\r\n if arr[i]==n-1:\r\n cs+=1\r\nif c1==2 and c2==n-2:\r\n print(\"bus topology\")\r\nelif c2==n:\r\n print(\"ring topology\")\r\nelif c1==n-1 and cs==1:\r\n print(\"star topology\")\r\nelse:\r\n print(\"unknown topology\")", "import sys\r\ninput = lambda : sys.stdin.readline().rstrip()\r\nn, m = map(int, input().split())\r\ndeg = [0] * n\r\nfor _ in range(m):\r\n u, v = [int(i) - 1 for i in input().split()]\r\n deg[u] += 1\r\n deg[v] += 1\r\nif deg.count(2) == n:\r\n print(\"ring topology\")\r\nelif deg.count(1) == n - 1:\r\n print(\"star topology\")\r\nelif deg.count(1) == 2 and deg.count(2) == n - 2:\r\n print(\"bus topology\")\r\nelse:\r\n print(\"unknown topology\")", "I=lambda:map(int,input().split())\r\nn,m=I()\r\na=[0]*n\r\nfor i in range(m):\r\n\tx,y=I()\r\n\ta[x-1]+=1\r\n\ta[y-1]+=1\r\ns=set(a)\r\no=\"unknown\"\r\nif s=={2}:o=\"ring\"\r\nif s=={1,2}:o=\"bus\"\r\nif s=={1,m}:o=\"star\"\r\nprint(o,\"topology\")", "def main():\n line = input().split()\n n = int(line[0])\n m = int(line[1])\n\n d = {}\n for i in range(m):\n line = input().split()\n a = int(line[0]) - 1\n b = int(line[1]) - 1\n if a in d.keys():\n d[a] += 1\n else:\n d[a] = 1\n if b in d.keys():\n d[b] += 1\n else:\n d[b] = 1\n ones = 0\n twos = 0\n totals = 0\n for k, v in d.items():\n if v == 1:\n ones += 1\n elif v == 2:\n twos += 1\n elif v == n-1:\n totals += 1\n else:\n print('unknown topology')\n return\n\n if ones == 2 and twos == n-2:\n print('bus topology')\n elif twos == n:\n print('ring topology')\n elif totals == 1 and ones == n-1:\n print('star topology')\n else:\n print('unknown topology')\n\n\nif __name__ == \"__main__\":\n main()\n \t \t\t \t \t\t\t\t \t\t \t\t \t", "# Network Topology\n\nui = input().split()\nn, m = int(ui[0]), int(ui[1])\n\ngraph = [set() for x in range(n+1)]\n\nfor _ in range(m):\n ui = input().split()\n n1, n2 = int(ui[0]), int(ui[1])\n graph[n1].add(n2)\n graph[n2].add(n1)\n\nif(n == m):\n # Check for ring topology\n for i in range(1, n+1):\n if(len(graph[i]) != 2):\n print(\"unknown topology\")\n break\n else:\n print(\"ring topology\")\n\nelif(n - 1 == m):\n # Check for bus or star topology\n center_found = False\n ends = 0\n\n for i in range(1, n+1):\n if(len(graph[i]) == 1):\n ends += 1\n elif(len(graph[i]) == n-1 and not center_found):\n center_found = True\n elif(len(graph[i]) != 2):\n print(\"unknown topology\")\n break\n else:\n if(ends == 2):\n print(\"bus topology\")\n elif(ends == n-1 and center_found):\n print(\"star topology\")\n else:\n print(\"unknown topology\")\n\nelse:\n print(\"unknown topology\")\n\n\t \t \t\t \t \t\t\t\t\t \t\t\t\t \t \t", "# 292B\r\n\r\n__author__ = 'artyom'\r\n\r\nread = lambda: map(int, input().split())\r\nn, m = read()\r\ngraph = [set() for _ in range(1 + n)]\r\ndegrees = [0] * (n + 1)\r\nfor __ in range(m):\r\n u, v = read()\r\n graph[u].add(v)\r\n graph[v].add(u)\r\n degrees[u] += 1\r\n degrees[v] += 1\r\n\r\n\r\ndef dfs(start):\r\n stack = [(start, None)]\r\n visited = [0] * (n + 1)\r\n while stack:\r\n v, parent = stack.pop()\r\n if degrees[v] > 2:\r\n return 'star' if all([degrees[u] == 1 for u in graph[v]]) else 'unknown'\r\n for u in graph[v]:\r\n if u != parent:\r\n if visited[u]:\r\n return 'ring' if u == start else 'unknown'\r\n stack.append((u, v))\r\n visited[v] = 1\r\n return 'bus'\r\n\r\n\r\nprint(dfs(1) + ' topology')", "\r\n\r\n\r\nfrom collections import defaultdict\r\n\r\nn, m = map(int,input().split())\r\n\r\ng = defaultdict(list)\r\n\r\nfor i in range(m):\r\n u , v = map(int,input().split())\r\n g[u].append(v)\r\n g[v].append(u)\r\n\r\nflag1 = True\r\nfor i in g :\r\n if len(g[i]) != 2:\r\n flag1 = False\r\n break\r\n\r\nif flag1 :\r\n print('ring topology')\r\n exit(0)\r\n\r\nst1 = set()\r\nfor i in g :\r\n st1.add(len(g[i]))\r\n\r\nl = list(st1)\r\nl.sort()\r\nif len(l) == 2 and l[0] == 1 and l[1] == n - 1 :\r\n print('star topology')\r\n exit(0)\r\n\r\nelif len(l) == 2 and l[0] == 1 and l[1] == 2 :\r\n print('bus topology')\r\n exit(0)\r\n\r\nelse:\r\n print('unknown topology')\r\n exit(0)\r\n\r\n\r\n\r\n", "temp1,temp2=input().split()\r\nn , m=int(temp1),int(temp2)\r\n\r\nnetwork=[0 for i in range(n)]\r\nfor i in range(m):\r\n k,j=input().split()\r\n network[int(k)-1]+=1\r\n network[int(j)-1]+=1\r\n\r\n \r\nif network.count(2) == n:\r\n print(\"ring topology\")\r\nelif network.count(2) == n-2 and network.count(1)==2:\r\n print(\"bus topology\")\r\nelif network.count(1)==n-1 and n-1 in network:\r\n print(\"star topology\")\r\nelse:\r\n print(\"unknown topology\")", "n,m=list(map(int,input().strip().split()))\r\nst=[0 for i in range(n)]\r\nfor i in range(m):\r\n a,b=list(map(int,input().strip().split()))\r\n a-=1\r\n b-=1\r\n st[a]+=1\r\n st[b]+=1\r\ncnt1=0\r\ncnt2=0\r\ncntn=0\r\nfor i in st:\r\n if i==1:\r\n cnt1+=1\r\n elif i==2:\r\n cnt2+=1\r\n elif i==n-1:\r\n cntn+=1\r\nif cnt1==2 and cnt2==n-2:\r\n print('bus topology')\r\nelif cnt2==n:\r\n print('ring topology')\r\nelif cnt1==n-1 and cntn==1:\r\n print('star topology')\r\nelse:\r\n print('unknown topology')", "n, m = map(int, input().strip().split())\nadj = {i + 1: 0 for i in range(n)}\n\nfor _ in range(m):\n x, y = map(int, input().strip().split())\n adj[x] += 1\n adj[y] += 1\n\none = 0\ntwo = 0\nnminusone = 0\nunknown = False\n\nfor k, v in adj.items():\n if v == 1:\n one += 1\n elif v == 2:\n two += 1\n elif v == n - 1:\n nminusone += 1\n else:\n unknown = True\n break\n\nif unknown:\n print(\"unknown topology\")\nelif one == 2 and two == n - 2:\n print(\"bus topology\")\nelif one == n - 1 and nminusone == 1:\n print(\"star topology\")\nelif two == n:\n print(\"ring topology\")\nelse:\n print(\"unknown topology\")\n\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\nn,m = map(int,input().split())\r\ng = [0]*n\r\nfor i in range(m):\r\n x,y = map(int,input().split())\r\n g.append([x,y])\r\n g[x-1] +=1\r\n g[y-1]+=1\r\nif g.count(1) == n - 1:\r\n print('star topology')\r\nelif g.count(2) == n:\r\n print('ring topology')\r\nelif g.count(1) == 2 and g.count(2) == n - 2:\r\n print('bus topology')\r\nelse:\r\n print('unknown topology')", "import sys\r\nfrom collections import defaultdict\r\n\r\ndef bus(graph):\r\n x = None\r\n y = None\r\n\r\n for k, v in graph.items():\r\n if len(v) == 1:\r\n x = k\r\n y = v[0]\r\n break\r\n\r\n while y in graph:\r\n if len(graph[y]) == 1:\r\n if graph[y][0] == x:\r\n return True\r\n else:\r\n return False\r\n else:\r\n a, b = graph[y]\r\n\r\n if a == x:\r\n x = y\r\n y = b\r\n else:\r\n x = y\r\n y = a\r\n\r\n return False\r\n\r\ndef ring(graph):\r\n k = next(iter(graph))\r\n v = graph[k]\r\n\r\n if len(v) != 2:\r\n return False\r\n else:\r\n x, y = v\r\n\r\n while y in graph:\r\n temp = y\r\n a, b = graph[y]\r\n\r\n if a == x:\r\n x = y\r\n y = b\r\n else:\r\n x = y\r\n y = a\r\n\r\n del graph[temp]\r\n\r\n if len(graph) == 0:\r\n return True\r\n else:\r\n return False\r\n\r\ndef star(graph):\r\n count = 0\r\n\r\n for k, v in graph.items():\r\n if len(v) != 1:\r\n for i in v:\r\n if i in graph and len(graph[i]) == 1 and graph[i][0] == k:\r\n count += 1\r\n\r\n if len(graph) == count + 1:\r\n return True\r\n else:\r\n return False\r\n\r\nif __name__ == '__main__':\r\n n, m = list(map(int, sys.stdin.readline().split()))\r\n graph = defaultdict(list)\r\n\r\n for i in range(0, m):\r\n x, y = list(map(int, sys.stdin.readline().split()))\r\n graph[x].append(y)\r\n graph[y].append(x)\r\n\r\n failure = True\r\n\r\n try:\r\n if star(graph):\r\n print('star topology')\r\n failure = False\r\n except:\r\n pass\r\n\r\n if failure:\r\n try:\r\n if bus(graph):\r\n print('bus topology')\r\n failure = False\r\n except:\r\n pass\r\n\r\n if failure:\r\n try:\r\n if ring(graph):\r\n print('ring topology')\r\n failure = False\r\n except:\r\n pass\r\n\r\n if failure:\r\n print('unknown topology')", "def main():\r\n n, m = map(int, input().split())\r\n l = [0] * n\r\n for i in range(m):\r\n a, b = map(int, input().split())\r\n l[a - 1] += 1\r\n l[b - 1] += 1\r\n k_1 = 0\r\n k_2 = 0\r\n k_n = 0\r\n for i in range(n):\r\n if l[i] == 1:\r\n k_1 += 1\r\n elif l[i] == 2:\r\n k_2 += 1\r\n elif l[i] == n - 1:\r\n k_n += 1\r\n if k_1 == 2 and k_2 == n - 2:\r\n print('bus topology')\r\n elif k_2 == n:\r\n print('ring topology')\r\n elif k_1 == n - 1 and k_n == 1:\r\n print('star topology')\r\n else:\r\n print('unknown topology')\r\n\r\n\r\nmain()", "import sys\n\n\ndef get_string(): return sys.stdin.readline().strip()\n\n\ndef get_ints_as_list(char=' '): return list(map(int, sys.stdin.readline().strip().split(char)))\n\n\ndef get_ints(): return map(int, sys.stdin.readline().strip().split())\n\n\n# def print(str): sys.stdout.write(str)\n\n\ndef main():\n n, m = get_ints_as_list()\n nodes = [[] for _ in range(n) ]\n\n for i in range(m):\n x, y = get_ints_as_list()\n nodes[x-1].append(y-1)\n nodes[y-1].append(x-1)\n\n # print(nodes)\n degrees = compute_degrees(nodes)\n if is_ring(degrees):\n print(\"ring topology\")\n elif is_bus(degrees):\n print(\"bus topology\")\n elif is_star(degrees):\n print(\"star topology\")\n else:\n print(\"unknown topology\")\n\ndef compute_degrees(nodes):\n return [ len(n) for n in nodes ]\n\ndef is_ring(degrees):\n return degrees.count(2) == len(degrees) \n\ndef is_bus(degrees):\n return degrees.count(2) == (len(degrees)-2) and degrees.count(1) == 2\n\ndef is_star(degrees):\n return degrees.count(1) == (len(degrees)-1) and degrees.count(len(degrees)-1) == 1\n\n\n# call the main method\nif __name__ == \"__main__\":\n main()\n", "n, m=map(int, input().split())\r\na=[0]*n\r\nfor i in range(m):\r\n\tx, y=map(int, input().split())\r\n\r\n\ta[x-1]+=1\r\n\ta[y-1]+=1\r\n\r\ns=set(a)\r\nif(s=={2}):print('ring')\r\nelif(s=={1, 2}):\r\n\tprint('bus')\r\nelif(s=={1, m}):\r\n\tprint('star')\r\nelse:\r\n\tprint('unknown')\r\nprint(' topology')\r\n", "n, edges = [int(x) for x in input().split()]\n\nadj_list = [[] for _ in range(n)]\nfor _ in range(edges):\n left, right = [int(x)-1 for x in input().split()]\n\n adj_list[left].append(right)\n adj_list[right].append(left)\n\nt: int = 0\no: int = 0\nnm1: int = 0\n\nfor connections in adj_list:\n if len(connections) == 1:\n o += 1\n elif len(connections) == 2:\n t += 1\n elif len(connections) == n-1:\n nm1 += 1\n\n\nprint(('bus' if t == n - 2 and o == 2 else ('star' if nm1 == 1 and o == n - 1 else ('ring' if t == n else 'unknown'))) + ' topology')\n\n\t\t \t\t\t\t\t\t \t \t \t\t\t\t\t \t \t", "from collections import Counter\r\n\r\n\r\nn, m = map(int, input().split())\r\ngraph = [[] for _ in range(n)]\r\nfor _ in range(m):\r\n a, b = map(int, input().split())\r\n graph[a-1].append(b-1)\r\n graph[b-1].append(a-1)\r\ncnt = dict(Counter(map(len, graph)))\r\nif cnt == {2: n}:\r\n print('ring topology')\r\nelif cnt == {2: n-2, 1: 2}:\r\n print('bus topology')\r\nelif cnt == {1: n-1, n-1: 1}:\r\n print('star topology')\r\nelse:\r\n print('unknown topology')\r\n", "import sys\r\ninput = lambda: sys.stdin.readline().rstrip(\"\\n\\r\")\r\n\r\ndef solve(): \r\n n, m = list(map(int, input().split()))\r\n g = [set() for i in range(n + 1)]\r\n ln = [0] * (n + 1)\r\n for i in range(m):\r\n x, y = list(map(int, input().split()))\r\n g[x].add(y)\r\n g[y].add(x)\r\n ln[x] += 1\r\n ln[y] += 1\r\n \r\n if ln.count(1) == 2 and ln.count(2) == n - 2:\r\n print('bus topology')\r\n elif ln.count(2) == n:\r\n print('ring topology')\r\n elif ln.count(1) == n - 1:\r\n print('star topology')\r\n else:\r\n print('unknown topology')\r\n \r\nfor _ in range(1):\r\n solve()\r\n\r\n\r\n ", "bus = \"bus topology\"\r\nstar = \"star topology\"\r\nunknown = \"unknown topology\"\r\nring = \"ring topology\"\r\n\r\nn, m = map(int, input().split())\r\nmatr = [([0]) for i in range (n + 1)]\r\npower = [0]*(m+1)\r\nfor i in range (m):\r\n x, y = map(int, input().split())\r\n matr[x].append(y)\r\n matr[y].append(x)\r\n#print(matr)\r\nfor i in range(1, n+1):\r\n power[len(matr[i]) - 1] += 1\r\n\r\n#print(*power)\r\nif power[2] == n:\r\n print(ring)\r\nelif power[2] == n-2 and power[1] == 2:\r\n print(bus)\r\nelif power[1] == n-1 and power[2] == 0:\r\n print(star)\r\nelse:\r\n print(unknown)\r\n", "def main():\r\n n, m = [int(x) for x in input().split()]\r\n computers = {}\r\n\r\n\r\n for i in range(m):\r\n x, y = [int(x) for x in input().split()]\r\n if x not in computers:\r\n computers[x] = [y]\r\n else:\r\n computers[x].append(y)\r\n\r\n if y not in computers:\r\n computers[y] = [x]\r\n else:\r\n computers[y].append(x)\r\n\r\n\r\n if m == n:\r\n for i in computers:\r\n if len(computers[i]) != 2:\r\n print(\"unknown topology\")\r\n return\r\n print(\"ring topology\")\r\n return\r\n\r\n elif m == n - 1:\r\n ones = 0\r\n for i in computers:\r\n if len(computers[i]) == 1:\r\n ones += 1\r\n if ones > 2:\r\n break\r\n\r\n if ones == 2:\r\n print(\"bus topology\")\r\n return\r\n else:\r\n for i in computers:\r\n if len(computers[i]) != 1:\r\n if len(computers[i]) == m:\r\n continue\r\n else:\r\n print(\"unknown topology\")\r\n return\r\n print(\"star topology\")\r\n else:\r\n print(\"unknown topology\")\r\n\r\nmain()" ]

[ "from heapq import heappush, heappop, heapify\r\nfrom collections import defaultdict, Counter, deque\r\nfrom functools import lru_cache\r\nimport threading\r\nimport sys\r\nimport bisect\r\ninput = sys.stdin.readline\r\ndef ri(): return int(input())\r\ndef rs(): return input()\r\ndef rl(): return list(map(int, input().split()))\r\ndef rls(): return list(input().split())\r\n\r\n# threading.stack_size(10**8)\r\n# sys.setrecursionlimit(10**6)\r\n \r\ndef main():\t\r\n\t\r\n\tn=ri()\r\n\ta=[0]+rl()\t\r\n\t\r\n\tmx=150\r\n\tdp=[[1<<33 for i in range(n+1)] for i in range(mx)]\r\n\tfor i in range(1,mx):\r\n\t\tfor j in range(n,0,-1):\r\n\t\t\tnx=i+j+a[j]\r\n\t\t\tif nx>n:dp[i][j]=1\r\n\t\t\telse:dp[i][j]=min(dp[i][j],dp[i][nx]+1)\r\n\t\r\n\tfor _ in range(ri()):\r\n\t\tp,k=rl()\r\n\t\tif k<mx:print(dp[k][p])\r\n\t\telse:\r\n\t\t\tres=0\r\n\t\t\tptr=p\r\n\t\t\twhile ptr<=n:\r\n\t\t\t\tres+=1\r\n\t\t\t\tptr+=k+a[ptr]\r\n\t\t\tprint(res)\r\n\tpass\t\r\n\r\n# for _ in range(ri()):\r\nmain()\r\n# threading.Thread(target=main).start()\r\n", "import math\r\nimport sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\ndp = []\r\nm = int(math.sqrt(n)) + 1\r\nfor i in range(1, m):\r\n dp0 = [0] * (n + 1)\r\n for j in range(n - 1, -1, -1):\r\n dp0[j] = dp0[min(n, j + a[j] + i)] + 1\r\n dp.append(dp0)\r\nq = int(input())\r\nfor _ in range(q):\r\n p, k = map(int, input().split())\r\n if k < m:\r\n ans = dp[k - 1][p - 1]\r\n else:\r\n ans = 0\r\n p -= 1\r\n while p < n:\r\n p += a[p] + k\r\n ans += 1\r\n print(ans)", "from collections import defaultdict, deque, Counter\r\nimport sys\r\nfrom decimal import *\r\nfrom heapq import heapify, heappop, heappush\r\nimport math\r\nimport random\r\nimport string\r\nfrom copy import deepcopy\r\nfrom itertools import combinations, permutations, product\r\nfrom operator import mul, itemgetter\r\nfrom functools import reduce, lru_cache\r\nfrom bisect import bisect_left, bisect_right\r\n\r\ndef input():\r\n return sys.stdin.readline().rstrip()\r\ndef getN():\r\n return int(input())\r\ndef getNM():\r\n return map(int, input().split())\r\ndef getList():\r\n return list(map(int, input().split()))\r\ndef getListGraph():\r\n return list(map(lambda x:int(x) - 1, input().split()))\r\ndef getArray(intn):\r\n return [int(input()) for i in range(intn)]\r\n\r\nmod = 10 ** 9 + 7\r\nMOD = 998244353\r\n# sys.setrecursionlimit(10000000)\r\n# import pypyjit\r\n# pypyjit.set_param('max_unroll_recursion=-1')\r\ninf = float('inf')\r\neps = 10 ** (-12)\r\ndy = [0, 1, 0, -1]\r\ndx = [1, 0, -1, 0]\r\n\r\n#############\r\n# Main Code #\r\n#############\r\n\r\nN = getN()\r\nA = getList()\r\nlim = int(math.sqrt(N))\r\n# kの大きさで分類\r\nQ = getN()\r\nque = []\r\nwant = set()\r\nfor i in range(Q):\r\n p, k = getNM()\r\n p -= 1\r\n if k <= lim:\r\n want.add((p, k))\r\n que.append([p, k])\r\n\r\nL = [0] * (N + 1)\r\nD = defaultdict(int)\r\n# k以下は解法2でやる\r\n# O(N√N)でk<limの全てに対応できる\r\nfor k in range(1, lim):\r\n # 後ろからdp\r\n for j in range(N - 1, -1, -1):\r\n L[j] = L[min(N, j + A[j] + k)] + 1\r\n if (j, k) in want:\r\n D[(j, k)] = L[j]\r\n\r\nfor p, k in que:\r\n if k < lim:\r\n print(D[(p, k)])\r\n else:\r\n # 解法1　愚直\r\n ans = 0\r\n while p < N:\r\n ans += 1\r\n p = p + A[p] + k\r\n print(ans)", "import sys\r\nimport io, os\r\ninput = sys.stdin.buffer.readline\r\n#input = io.BytesIO(os.read(0,os.fstat(0).st_size)).readline\r\n\r\nimport math\r\n\r\nn = int(input())\r\nA = list(map(int, input().split()))\r\n\r\nlimit = int(math.sqrt(n))\r\n\r\ndp = [[-1]*n for i in range(limit+1)]\r\nfor k in range(1, limit+1):\r\n for i in range(n-1, -1, -1):\r\n if i+A[i]+k >= n:\r\n dp[k][i] = 1\r\n else:\r\n dp[k][i] = dp[k][i+A[i]+k]+1\r\n\r\nq = int(input())\r\nfor i in range(q):\r\n p, k = map(int, input().split())\r\n if k >= limit:\r\n ans = 0\r\n while p <= n:\r\n p = p+A[p-1]+k\r\n ans += 1\r\n print(ans)\r\n else:\r\n print(dp[k][p-1])\r\n", "import sys\r\n\r\nn = int(sys.stdin.buffer.readline().decode('utf-8'))\r\na = [0] + list(map(int, sys.stdin.buffer.readline().decode('utf-8').split()))\r\nq = int(sys.stdin.buffer.readline().decode('utf-8'))\r\n\r\ndp_size = 200\r\ndp = [[1]*(n+1) for _ in range(dp_size+1)]\r\nfor k in range(1, dp_size+1):\r\n for i in range(n, 0, -1):\r\n if i+a[i]+k <= n:\r\n dp[k][i] = dp[k][i+a[i]+k]+1\r\n\r\nans = [0]*q\r\nfor i, (p, k) in enumerate(map(int, line.decode('utf-8').split()) for line in sys.stdin.buffer):\r\n if k <= dp_size:\r\n ans[i] = dp[k][p]\r\n else:\r\n while p <= n:\r\n p += a[p] + k\r\n ans[i] += 1\r\n\r\nsys.stdout.buffer.write('\\n'.join(map(str, ans)).encode('utf-8'))\r\n", "n = int(input())\r\na = [0] * (n + 1)\r\na[1:] = (map(int, input().split()))\r\ndp = [[0] * (n + 1) for _ in range(101)]\r\nfor _ in range(int(input())):\r\n p, k = map(int, input().split())\r\n if k > 100:\r\n c = 0\r\n while p <= n:\r\n p += a[p] + k\r\n c += 1\r\n print(c)\r\n else:\r\n d = dp[k]\r\n p0 = p\r\n c = 0\r\n stk = []\r\n if not d[p0]:\r\n while p <= n and d[p] == 0:\r\n stk.append(p)\r\n p += a[p] + k\r\n c = 0 if p > n else d[p]\r\n for p in stk[::-1]:\r\n c += 1\r\n d[p] = c\r\n print(d[p0])\r\n" ]

[ "mod = int(1e9 + 7)\r\nn, m = map(int, input().split())\r\nf = [ [0 for i in range(60)] for j in range(60) ]\r\ng = [ [0 for i in range(60)] for j in range(60) ]\r\ns = [ [0 for i in range(60)] for j in range(60) ]\r\ninv = [ 1 ]\r\nf[0][0] = s[0][0] = 1\r\n\r\ndef pow(x, exp) :\r\n res = 1\r\n for i in range(0, 31) :\r\n if exp & 1 : res = res * x % mod\r\n exp >>= 1\r\n if exp == 0 : break\r\n x = x * x % mod\r\n return res\r\n\r\nfor i in range(1, n + 1) :\r\n inv.append( pow(i, mod - 2) )\r\n\r\nfor node in range(1, n + 1) :\r\n for cut in range(1, n + 1) :\r\n tmp = 0\r\n for ln in range(node) :\r\n for lc in range(cut - 1, n + 1) :\r\n if f[ln][lc] == 0 : continue\r\n if lc == cut - 1 :\r\n tmp = ( tmp + f[ln][lc] * s[node - ln - 1][cut - 1] ) % mod\r\n else :\r\n tmp = ( tmp + f[ln][lc] * f[node - ln - 1][cut - 1] ) % mod\r\n cnt = 1\r\n if tmp != 0 :\r\n cn, cc = 0, 0\r\n for i in range(1, n + 1) :\r\n cn += node\r\n cc += cut\r\n cnt = cnt * (tmp + i - 1) % mod * inv[i] % mod\r\n if cn > n or cc > n : break\r\n for j in range(n - cn, -1, -1) :\r\n for k in range(n - cc, -1, -1) :\r\n if f[j][k] == 0 : continue\r\n g[j + cn][k + cc] += f[j][k] * cnt\r\n g[j + cn][k + cc] %= mod\r\n for i in range(n + 1) :\r\n for j in range(n + 1) :\r\n f[i][j] = (f[i][j] + g[i][j]) % mod\r\n g[i][j] = 0\r\n \r\n for cut in range(n, -1, -1) :\r\n s[node][cut] = ( s[node][cut + 1] + f[node][cut] ) % mod\r\nprint(f[n][m - 1])" ]

[ "def solve(test):\r\n ans = 0\r\n n, x = map(int, input().split())\r\n for i in range(n):\r\n c = input().split()\r\n if c[0] == '+':\r\n x += int(c[1])\r\n elif int(c[1]) > x:\r\n ans += 1\r\n else:\r\n x -= int(c[1])\r\n print(x, ans)\r\nt = 1\r\n#t = int(input())\r\nfor _ in range(t):\r\n solve(_ + 1)", "inpt1 = [int(x) for x in input().split(\" \")]\r\nqueue, icecreams = inpt1\r\ndistressed_kids = 0\r\nfor people in range(queue):\r\n inpt2 = input().split(\" \")\r\n if inpt2[0] == \"+\":\r\n icecreams += int(inpt2[1])\r\n else:\r\n if int(inpt2[1]) > icecreams:\r\n distressed_kids += 1\r\n else:\r\n icecreams -= int(inpt2[1])\r\n\r\nprint(icecreams, distressed_kids)", "pCount , iCount = list(map(int,input().split()))\r\n\r\nsadPpl = 0\r\n\r\nfor _ in range(pCount) :\r\n info = input()\r\n operator = info[:1]\r\n num = int(info[2:])\r\n if operator == \"+\" : iCount += num \r\n else :\r\n if iCount >= num:\r\n iCount -= num\r\n else :\r\n sadPpl += 1\r\n \r\nprint(iCount , sadPpl)", "x = list(map(int, input().split()))\r\ns = 0\r\nfor i in range(x[0]):\r\n y = list(map(str, input().split()))\r\n y[1] = int(y[1])\r\n if y[0] == '+':\r\n x[1] = x[1] + y[1]\r\n \r\n elif y[0] == '-':\r\n if x[1] >= y[1]:\r\n x[1] = x[1] - y[1]\r\n else:\r\n s = s+1\r\nm = [str(x[1]),str(s)]\r\nz = ' '.join(m)\r\nprint(z)", "\r\n\r\nn,x = map(int,input().split())\r\ncount=0\r\nfor _ in range(n):\r\n c,v = input().split()\r\n v=int(v)\r\n \r\n if(c=='+'):\r\n x=x+v\r\n if(c=='-'):\r\n if(v<=x):\r\n x=x-v\r\n else:\r\n count += 1\r\n \r\nprint(x,count)", "a,b = map(int,input().split())\nc = 0\nfor i in range(a):\n\tn = input().split()\n\tn1 = int(n[1])\n\tif n[0] == \"+\":\n\t\tb += n1\n\telse:\n\t\tif b < n1:\n\t\t\tc += 1\n\t\telse:\n\t\t\tb -= n1\n\t\t\t\nprint(b,c)\n\t\t\n\t\t\n \t\t\t\t \t\t \t \t \t\t \t\t \t \t\t \t", "\r\n\r\ndef free_ice_cream():\r\n\r\n\r\n n,ice_cream = map(int,input().split())\r\n\r\n\r\n\r\n num_distressed = 0\r\n for _ in range(n):\r\n operation,amount = input().split()\r\n amount = int(amount)\r\n\r\n if operation == '+':\r\n ice_cream += amount\r\n else:\r\n if amount > ice_cream:\r\n num_distressed += 1\r\n else:\r\n ice_cream -= amount\r\n\r\n\r\n \r\n print(ice_cream,num_distressed)\r\n\r\n\r\n\r\n\r\nfree_ice_cream()\r\n", "arr = input().split(\" \")\r\nn = int(arr[0])\r\nx = int(arr[1])\r\nr = 0\r\nfor _ in range(n):\r\n p = input().split(\" \")\r\n c = p[0]\r\n d = int(p[1])\r\n if c == \"+\" : \r\n x+=d\r\n if c == \"-\" : \r\n if x >= d : \r\n x-=d\r\n else : \r\n r+=1\r\n\r\nprint(x,r)", "def main():\n n, packs = list(map(int, input().split()))\n sad = 0\n for _ in range(n):\n s, val = input().split()\n val = int(val)\n if s == \"+\":\n packs += val\n if s == \"-\":\n if val > packs:\n sad += 1\n else:\n packs -= val\n print(f\"{packs} {sad}\")\nmain()", "def main():\r\n [n, x] = list(map(int, input().split()))\r\n d = 0\r\n\r\n for _ in range(n):\r\n s = input().strip().split()\r\n if s[0] == '+':\r\n x += int(s[1])\r\n else:\r\n if x >= int(s[1]):\r\n x -= int(s[1])\r\n else:\r\n d += 1\r\n\r\n print(x, d)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n,x = map(int, input().split())\r\n# z=int(input())\r\nsu=0\r\nfor i in range(0,n):\r\n ar = [m for m in input().split()]\r\n if ar[0]=='-':\r\n if x-int(ar[1])>=0:\r\n x-=int(ar[1])\r\n else:\r\n su+=1\r\n else:\r\n x+=int(ar[1])\r\nprint(x,su)", "\r\nkidscounter =0\r\nx , y =map(int,input().split())\r\nfor i in range(x):\r\n s = input().split()\r\n A = s[0]\r\n B = int(s[1])\r\n if A == '+':\r\n y+=B\r\n else:\r\n if y >= B:\r\n y-=B\r\n else:\r\n kidscounter+=1\r\n\r\nprint(y,kidscounter)", "n,answer=map(int,input().split())\r\nsad=0\r\nfor i in range(n):\r\n p,n1=map(str,input().split())\r\n n1=int(n1)\r\n if p==\"+\":\r\n answer+=n1\r\n elif answer>=n1:\r\n answer-=n1\r\n else:\r\n sad+=1\r\nprint(answer,sad)\r\n", "n,x = map(int, input().split())\r\ntot = x\r\nsad = 0\r\n\r\nfor i in range(n):\r\n ice = input()\r\n sign = ice[0]\r\n number = int(ice[2:])\r\n if sign == '+':\r\n tot += number\r\n elif sign == '-':\r\n if(number > tot):\r\n sad += 1\r\n else:\r\n tot -= number\r\nprint(tot, sad)", "a,b=map(int,input().split(\" \"))\r\nl1=[]\r\nfor i in range(a):\r\n s=input()\r\n k=s.split()\r\n l1.append(k)\r\ncurrent_stock=b\r\ndistress=0\r\nfor i in l1:\r\n if i[0]==\"+\":\r\n current_stock+=int(i[1])\r\n else:\r\n if current_stock>=int(i[1]):\r\n current_stock-=int(i[1])\r\n else:\r\n distress+=1\r\n\r\nprint(current_stock,distress)", "n,d = map(int , input().split())\r\nkid = 0\r\nfor _ in range(n):\r\n a,b = input().split()\r\n b = int(b)\r\n if a =='+':\r\n d+= b\r\n else:\r\n if d-b<0:\r\n kid+=1\r\n else:\r\n d-=b\r\n\r\nprint(d,kid)", "n,m=map(int, input().split())\r\ncnt=0\r\nfor i in range(n):\r\n a, b= input().split()\r\n\r\n if a==\"+\":\r\n m+=int(b)\r\n\r\n else:\r\n if int(b)>m:\r\n cnt+=1\r\n else:\r\n m-=int(b)\r\nprint(m,cnt)", "n, x = map(int, input().split())\nt = 0\nfor i in range(n):\n s, v = input().split()\n v = int(v)\n if s == '-':\n v = -v\n if x + v >= 0:\n x += v\n else:\n t += 1\nprint(x, t)\n\n \t \t \t\t\t \t \t\t\t\t \t \t\t\t \t", "n, total = map(int, input().split())\r\nans = 0\r\nfor _ in range(n):\r\n a, b = input().split()\r\n if a == '+':\r\n total += int(b)\r\n else:\r\n if int(b) <= total:\r\n total -= int(b)\r\n else:\r\n ans += 1\r\nprint(total, ans)\r\n", "n,x=map(int,input().split())\r\ncount=0\r\nfor i in range(0,n,1):\r\n s,c=map(str,input().split())\r\n c=int(c)\r\n if s=='+':\r\n x=x+c\r\n else:\r\n if x-c<0:\r\n count=count+1\r\n else:\r\n x=x-c\r\nprint(str(x)+\" \"+str(count))", "n,x=input().split()\nn=int(n);x=int(x)\nc=0\nfor i in range(n):\n a,b=input().split()\n b=int(b)\n if a==\"+\":\n x+=b\n elif b>x:\n c+=1\n else :\n x-=b\nprint(x,c)\n\t\t \t \t \t\t\t\t \t \t \t\t \t\t\t\t", "import sys\ninput = sys.stdin.readline\n\nN, x = map(int, input().split())\nCOMMANDS = [input().split() for _ in range(N)]\n\nds = 0\nfor command in COMMANDS :\n action, amount = command\n amount = int(amount)\n \n if action == \"+\" : x += amount\n else :\n if x < amount : ds += 1\n else : x -= amount\n\nprint(x, ds)\n", "n, x = list( map(int, input().split()) )\r\n\r\ndistress= 0\r\nfor _ in range(n):\r\n ch, d = input().split()\r\n d = int(d)\r\n #print('ch, d=', ch, d)\r\n if ch == '+':\r\n x += d\r\n continue\r\n \r\n if x < d:\r\n distress += 1\r\n else:\r\n x -= d\r\n\r\nprint(x, distress)\r\n", "import sys\r\nimport math\r\nimport collections\r\nimport heapq\r\ninput=sys.stdin.readline\r\nn,x=(int(i) for i in input().split())\r\nc=0\r\nfor i in range(n):\r\n a,b=(i for i in input().split())\r\n if(a=='+'):\r\n x+=int(b)\r\n else:\r\n if(x>=int(b)):\r\n x-=int(b)\r\n else:\r\n c+=1\r\nprint(x,c)", "inp = input()\r\ninp = inp.split(' ')\r\nchildren = 0\r\npacks = 0\r\nchildren = int(inp[0])\r\npacks = int(inp[1])\r\ndistressed = 0\r\n\r\nfor i in range(children):\r\n s = input()\r\n s = s.split(' ')\r\n if s[0] == '+':\r\n packs += int(s[1])\r\n else:\r\n if packs < int(s[1]):\r\n distressed += 1\r\n else:\r\n packs -= int(s[1])\r\nprint(packs , distressed)", "a,b=input().split()\r\na=int(a)\r\nb=int(b)\r\nf=0\r\nfor i in range(a):\r\n c,s=input().split()\r\n s=int(s)\r\n if(c=='+'):\r\n b+=s\r\n elif c=='-':\r\n if s<=b:\r\n b-=s\r\n else:\r\n f+=1\r\nprint(b,f)", "import re\r\nregex = re.compile(r'\\S+')\r\nregex1 = re.compile(r'\\d+')\r\na = input()\r\nr1 = regex1.findall(a)\r\nx = int(r1[1])\r\ndis = 0\r\nfor i in range(int(r1[0])):\r\n l = input()\r\n r2 = regex.findall(l)\r\n if r2[0] == '-':\r\n if int(r2[1]) > x:\r\n dis = dis +1\r\n else:\r\n x = x - int(r2[1])\r\n if r2[0] == '+':\r\n x = x + int(r2[1])\r\nprint(x,dis)\r\n", "n,x=map(int,input().split())\r\ndis=0\r\nfor l in range(n):\r\n s,d=map(str,input().split())\r\n d=int(d)\r\n \r\n if s=='+':\r\n x+=d\r\n else:\r\n if x>=d:\r\n x-=d\r\n else:\r\n dis+=1\r\n \r\nprint(x,dis)", "n, t = map(int, input().split())\r\nx = 0\r\nfor i in range(n):\r\n a, b = map(str, input().split())\r\n if a == '+':\r\n t += int(b)\r\n else:\r\n if t - int(b) >= 0:\r\n t -= int(b)\r\n else:\r\n x += 1\r\nprint(t, x)", "n,x = [int(j) for j in input().split()]\r\nans = 0\r\nfor i in range(n):\r\n c,d = input().split()\r\n if (c == '+'):\r\n k = int(d)\r\n x += int(d)\r\n elif (c == '-'):\r\n k = int(d)\r\n if (x - k < 0):\r\n ans += 1\r\n else:\r\n x -= k\r\nprint(x,ans)", "n,x=map(int,input().split())\r\nc=0\r\nwhile n:\r\n n-=1\r\n \r\n a,b=input().split()\r\n b=int(b)\r\n if a=='+':\r\n x+=b\r\n else:\r\n if x>=b:\r\n x-=b\r\n else:\r\n c+=1\r\nprint(x,c)", "n , m = map(int,input().split())\r\nc=0\r\nfor i in range(n):\r\n s , num = input().split()\r\n if(s==\"+\"):m+=int(num)\r\n else:\r\n if(m>=int(num)):\r\n m-=int(num)\r\n else:\r\n c+=1\r\n \r\nprint(m,c)", "n,x=input().split()\nn=int(n);x=int(x)\ndistressed=0\nfor i in range(n):\n a,b=input().split()\n b=int(b)\n if a=='+':\n x+=b\n elif x>=b:\n x-=b\n else:\n distressed+=1\nprint(x,distressed)\n\t\t \t \t\t \t \t \t \t\t \t\t\t", "n,t = map(int,input().split())\r\nans=0\r\n\r\nfor i in range(n):\r\n z, a = input().split()\r\n a = int(a)\r\n if z=='-' and a>t:\r\n ans+=1\r\n elif z=='-' and a<=t:\r\n t-=a\r\n else:\r\n t+=a\r\nprint(t, ans)\r\n\r\n", "n, x = map(int, input().split())\r\nd_op = []\r\nd_num = []\r\ndistress = 0\r\n\r\nfor i in range(n):\r\n op, num = map(str,input().split())\r\n d_op.append(op)\r\n d_num.append(int(num))\r\n\r\nfor i in range(n):\r\n if d_op[i] == '+':\r\n x += d_num[i]\r\n elif d_op[i] == '-':\r\n if x - d_num[i] >= 0:\r\n x -= d_num[i]\r\n else:\r\n distress += 1\r\n\r\nprint(x, distress)", "n , x = input().split()\nn =int(n); x = int(x)\nz3lan = 0\nfor i in range(n):\n a ,b = input().split()\n b = int(b)\n if a == '+':\n x += b\n elif x >= b :\n x-=b\n else:\n z3lan+=1\nprint (x , z3lan)\n \t \t \t \t\t\t\t \t\t \t \t \t", "nx = input().split()\r\nn = int(nx[0])\r\nx = int(nx[1])\r\nkid = 0\r\nfor i in range(n):\r\n dd = input().split()\r\n mark = dd[0]\r\n d = int(dd[1])\r\n if mark == \"+\":\r\n x += d\r\n elif mark == \"-\" and d > x:\r\n kid += 1\r\n else:\r\n x -= d\r\nprint(x, kid)", "a,b=map(int,input().split())\r\ncount,sad=b,0\r\nfor _ in range(a):\r\n string,n=input().split(maxsplit=1)\r\n if string==\"+\":\r\n count+=int(n)\r\n elif count<int(n):\r\n sad+=1\r\n else:\r\n count-=int(n)\r\nprint(count,sad)", "n, k = map(int,input().split())\r\nd=0\r\nfor x in range(n):\r\n\ts = input()\r\n\tif s[0]==\"+\":\r\n\t\tk+=int(s[2:len(s)])\r\n\telse :\r\n\t\tif k<int(s[2:len(s)]):\r\n\t\t\td+=1\r\n\t\telse:\r\n\t\t\tk-=int(s[2:len(s)])\r\nprint(k,d)", "n,x = map(int, input().split())\r\narr=list()\r\nfor j in range(n):\r\n a,b = map(str, input().split())\r\n arr.append(a)\r\n arr.append(b)\r\nkids = 0\r\n\r\nfor i in range(len(arr)):\r\n if arr[i] == '+':\r\n x+=int(arr[i+1])\r\n elif arr[i] == '-':\r\n if int(arr[i+1]) > x:\r\n kids+=1\r\n else:\r\n x-=int(arr[i+1])\r\n\r\n\r\nprint(x, kids)", "n,x=input().split()\r\nn=int(n)\r\nx=int(x)\r\nc=0\r\nfor i in range(n):\r\n s, d = input().split()\r\n d = int(d)\r\n if s=='+':\r\n x+=d\r\n elif d<=x:\r\n x-=d\r\n else:\r\n c+=1\r\nprint(x,end=\" \")\r\nprint(c)", "n,x=[int(w) for w in input().split()]\r\na=0\r\nfor i in range(n):\r\n y,d=[j for j in input().split()]\r\n d=int(d)\r\n if y=='+':\r\n x+=d\r\n else:\r\n if x>=d:\r\n x-=d\r\n else:\r\n a+=1\r\nprint(x,a)", "n, x = map(int, input().split())\ndistress = 0\nfor _ in range(n):\n d = input()\n d = int(d[0] + d[2:])\n if x + d >= 0:\n x += d\n else:\n distress += 1\nprint(x, distress)\n", "n,x = map(int, input().split())\r\nk=0\r\nfor i in range(n):\r\n s,j = input().split(\" \")\r\n if s == '+':\r\n x+= int(j)\r\n else:\r\n if int(j)>x:\r\n k+=1\r\n else:\r\n x-= int(j)\r\nprint(x, k)", "x,y=input().split()\nx=int(x)\ny=int(y)\ncountpeople=0\nfor i in range(x):\n z,w=input().split()\n w=int(w)\n if(z=='-'):\n if(y>=w):\n y-=w\n else:\n countpeople+=1\n else:\n y+=w\nprint(y,countpeople)\n \t\t\t \t \t\t \t\t\t\t \t\t\t\t\t\t \t \t \t", "n,c=map(int,input().split())\r\nd=0\r\nfor i in range(n):\r\n s,t=map(str,input().split())\r\n x=int(t)\r\n if s==\"+\":\r\n c+=x\r\n elif s==\"-\":\r\n if (c-x)>=0:\r\n c-=x\r\n else:\r\n d+=1\r\nprint(c,d) ", "n, x = map(int, input().split())\r\n\r\ndistress = 0\r\n\r\nfor i in range(n) :\r\n a, b = input().split()\r\n \r\n if a == \"+\" :\r\n x += int(b)\r\n \r\n else :\r\n if int(b) > x :\r\n distress += 1\r\n else :\r\n x -= int(b)\r\n \r\nprint(x, distress)", "n,x=map(int,input().split())\r\nk=0\r\nfor i in range(n):\r\n a,t= input().split()\r\n t=int(t)\r\n if a==\"+\":\r\n x+=t\r\n else:\r\n if t>x:\r\n k+=1\r\n else:\r\n x-=t\r\nprint(x,\" \",k,sep=\"\")\r\n", "def main():\r\n n, iceCreamSum = map(int, input().split())\r\n kids = 0\r\n for i in range(n):\r\n signal, iceCream = map(str, input().split())\r\n if signal == \"+\":\r\n iceCreamSum += int(iceCream)\r\n else:\r\n if iceCreamSum < int(iceCream):\r\n kids += 1\r\n else:\r\n iceCreamSum -= int(iceCream)\r\n\r\n print(iceCreamSum, kids)\r\nif __name__ == '__main__':\r\n main()", "from sys import stdin\r\n\r\nn, x = list(map(int, stdin.readline().split()))\r\nres = 0\r\nfor _ in range(n):\r\n a, d = stdin.readline().split()\r\n d = int(d)\r\n if a == '+':\r\n x += d\r\n else:\r\n if x >= d:\r\n x -= d\r\n else:\r\n res += 1\r\n\r\nprint(x, res)", "n,x=map(int,input().split())\r\nl=[]\r\ns=0\r\nfor i in range(n):\r\n l.append(input())\r\n if l[i][0]==\"+\":\r\n x=x+int(l[i][2:])\r\n elif l[i][0]==\"-\" and x<int(l[i][2:]):\r\n s=s+1\r\n else:\r\n x = x - int(l[i][2:])\r\n\r\nprint(x,s)\r\n\r\n\r\n", "n=input().split()\r\na,b,t=int(n[0]),int(n[1]),0\r\nfor i in range(a):\r\n c=input().split()\r\n q,w=c[0],int(c[1])\r\n if q==\"+\":b+=w\r\n else:\r\n if b>=w:b-=w\r\n else :t+=1\r\nprint(b,t)", "n, x = map(int, input().split())\r\ndep = 0\r\nfor i in range(n):\r\n l = input().split()\r\n if l[0] == '+':\r\n x+= int(l[1])\r\n else:\r\n if x - int(l[1]) < 0:\r\n dep += 1\r\n else:\r\n x-= int(l[1])\r\nprint(x,dep)", "import sys\r\ninput=sys.stdin.readline\r\nf=lambda :list(map(int, input().split()))\r\nn, x=f()\r\ncnt=0\r\nfor i in range(n):\r\n\tc, d=input().split()\r\n\tif c=='+':\r\n\t\tx+=int(d)\r\n\telse:\r\n\t\tif x<int(d):\r\n\t\t\tcnt+=1\r\n\t\telse:\r\n\t\t\tx-=int(d)\r\nprint(x, cnt)", "n, x =map(int, input().strip().split())\n\nr2=0 \nfor i in range(0, n):\n\tq = input().strip().split()\n\tif q[0] == \"+\" : \n\t\tx += int(q[1 ])\n\telse:\n\t\tif int(q[1]) > x:\n\t\t\tr2 += 1\n\t\telse:\n\t\t\tx -= int( q[1])\nprint(x, r2)", "n,x = map(int, input().split())\r\nc=0\r\nfor i in range(n):\r\n si,d = input().split()\r\n d = int(d)\r\n if si==\"+\" : x+=d\r\n else : \r\n if d<=x : x-=d\r\n else : c+=1\r\nprint(x,c)", "m, n = map(int,input().split())\r\nc = 0\r\nfor i in range(m):\r\n\ta, b = map(str,input().split())\r\n\tif a == '+':\r\n\t\tn += int(b)\r\n\telif a == '-' and n >= int(b):\r\n\t\tn -= int(b)\r\n\telse:\t\r\n\t\tc += 1\r\nprint(n, c)", "# 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, x = map(int, input().split())\r\ndist = 0\r\nfor i in range(n):\r\n a, b = map(str, input().split())\r\n b = int(b)\r\n if a == '+':\r\n x += b\r\n else:\r\n if x >= b:\r\n x-=b\r\n else:\r\n dist += 1\r\nprint(x, dist)", "n, x = map(int, input().split(' '))\r\ncnt = 0\r\n\r\nfor i in range(n):\r\n a = input().split(' ')\r\n if a[0] == '+':\r\n x += int(a[1])\r\n else:\r\n if x >= int(a[1]):\r\n x -= int(a[1])\r\n else:\r\n cnt += 1\r\n\r\nprint(x, cnt)\r\n", "n, x = map(int, input().split())\r\nice_cream = x\r\ndistressed_kids = 0\r\n\r\nfor _ in range(n):\r\n operation, di = input().split()\r\n di = int(di)\r\n \r\n if operation == \"+\":\r\n ice_cream += di\r\n else:\r\n if ice_cream >= di:\r\n ice_cream -= di\r\n else:\r\n distressed_kids += 1\r\n\r\nprint(ice_cream, distressed_kids)\r\n", "a,b= map(int,input().split())\r\nz=0\r\nfor i in range(a):\r\n s=input()\r\n if s[0]=='+':\r\n b=b+int(s[2::])\r\n else:\r\n if b >= int(s[2::]):\r\n b = b-int(s[2::])\r\n else:\r\n z+=1\r\nprint(b,z)", "\r\ndef asd():\r\n t= [int(x) for x in input().split()]\r\n c=0\r\n \r\n for i in range(t[0]):\r\n \r\n int_list = [(x)for x in input().split()]\r\n xa=int(int_list[1])\r\n if int_list[0] == '+':\r\n t[1]=xa+t[1]\r\n elif int_list[0] == '-':\r\n if (t[1]>=xa):\r\n t[1]=t[1]-xa\r\n else:\r\n c=c+1\r\n print(t[1],' ',c)\r\n\r\n \r\n \r\nasd()", "l = []\r\ns = input()\r\nl = s.split()\r\nn = int(l[0])\r\nnp =int(l[1])\r\nj = []\r\nfor i in range(0,n,1):\r\n j.append(input())\r\n j[i] = (j[i]).split()\r\nnk = 0\r\nfor i in range(0,n,1):\r\n if j[i][0] == '+' :\r\n np += int(j[i][1])\r\n elif j[i][0] == '-' and np - int(j[i][1]) < 0:\r\n nk += 1\r\n elif j[i][0] == '-' and np - int(j[i][1]) > 0 :\r\n np -= int(j[i][1])\r\n elif j[i][0] == '-' and np - int(j[i][1]) == 0 :\r\n np -= int(j[i][1])\r\nprint(np,nk)\r\n", "n, x= input().split()\nn = int(n)\nx = int(x)\nsum = 0\nfor i in range(n):\n a ,d= input().split()\n d = int(d)\n if a == \"-\":\n if x - d >= 0:\n x -= d\n else:\n sum += 1\n else:\n x += d\nprint(x, sum)\n \t\t \t\t\t\t \t\t \t \t \t \t", "n, x=map(int, input().split())\r\nsad=0\r\nfor i in range(n):\r\n state, amount= input().split()\r\n amount=int(amount)\r\n if(state==\"+\"):\r\n x+=amount \r\n continue\r\n if(amount>x):\r\n sad+=1\r\n else:\r\n x-=amount\r\nprint(x, sad)", "n,x=map(int,input().split())\r\nc=0\r\nfor _ in range(0,n):\r\n a,b=input().split()\r\n if(a=='+'):\r\n x=x+int(b)\r\n else:\r\n if(x>=int(b)):\r\n x-=int(b)\r\n else:\r\n c+=1\r\nprint(x,c)", "num,numberOfIcecream=input().split()\r\nnum=int(num)\r\nnumberOfIcecream=int(numberOfIcecream)\r\ndistressedChildren=0\r\ni=0\r\nwhile i < num:\r\n sign, iceCream=input().split()\r\n iceCream=int(iceCream)\r\n if sign == \"+\":\r\n numberOfIcecream+=iceCream\r\n else:\r\n if iceCream > numberOfIcecream:\r\n distressedChildren+=1\r\n else:\r\n numberOfIcecream-=iceCream\r\n i+=1\r\nprint(numberOfIcecream,distressedChildren)", "n, x = map(int, (input().split()))\r\nl = []\r\ncount = 0\r\nfor i in range(n):\r\n l = input().split()\r\n if l[0] == '+':\r\n x += int(l[1])\r\n else:\r\n if x >= int(l[1]):\r\n x -= int(l[1])\r\n else:\r\n count += 1\r\nprint(x, count)", "n,d=map(int,input().split())\r\ni=0\r\nsd=0\r\nwhile i<n:\r\n x=list(input().split(\" \"))\r\n if x[0]==\"+\":\r\n d+=int(x[1])\r\n else:\r\n if int(x[1])>d:\r\n sd+=1\r\n else:\r\n d-=int(x[1])\r\n i+=1\r\nprint(d,sd)", "m = list(map(int , input().split()))\r\nn = m[0]\r\nx = m[1]\r\nd = 0\r\nr = []\r\nfor i in range(n):\r\n h = input().split()\r\n if h[0] == \"+\":\r\n x += int(h[1])\r\n elif h[0] == \"-\":\r\n if x >= int(h[1]):\r\n x -= int(h[1])\r\n else:\r\n d += 1\r\n\r\nprint(x , d)", "# import sys\n# sys.stdin=open('input.in','r')\n# sys.stdout=open('output.out','w')\nn,x=map(int,input().strip().split()[:2])\nun=0\nfor x1 in range(n):\n\tl,m=input().strip().split()[:2]\n\tm=int(m)\n\tif l=='-':\n\t\tif x-m<0:\n\t\t\tun+=1\n\t\telse:\n\t\t\tx=x-m\n\telse:\n\t\tx+=m\nprint(x,un)\n\n\n", "n,x = input().split(\" \")\r\nn = int(n); x = int(x)\r\nsad_kids = 0\r\nwhile n:\r\n d,num = input().split(\" \")\r\n if d == \"+\":\r\n x += int(num)\r\n elif d == \"-\" and x >= int(num):\r\n x -= int(num)\r\n else:\r\n sad_kids += 1\r\n n -= 1\r\nprint(x,sad_kids)", "n,x=map(int,input().split())\r\nc=0\r\nfor i in range(n):\r\n v,y=map(str,input().split())\r\n if v==\"+\":\r\n x+=int(y)\r\n else:\r\n if x >= int(y):\r\n x-=int(y)\r\n else:\r\n c+=1\r\nprint(x,c)", "n,x=[int(i) for i in input().split()]\r\nc=0\r\nfor i in range(n):\r\n l=input().split()\r\n if l[0]=='+':\r\n x+=int(l[1])\r\n else:\r\n if x>=int(l[1]):\r\n x-=int(l[1])\r\n else:\r\n c+=1\r\nprint(x,c)", "\n\nn, x = map(int, input().split())\n\na = [[j for j in input().split()] for i in range(int(n))]\n\ncount = 0\nfor i in range(n):\n if a[i][0] == \"+\":\n x += int(a[i][1])\n elif a[i][0] == \"-\" and x < int(a[i][1]) :\n count += 1\n else:\n x -= int(a[i][1])\nprint(x,count)\n", "inp = list(map(int, input().split()))\r\nn, x = inp[0], inp[1]\r\n\r\nkids_distressed = 0\r\nhave = x\r\n\r\nfor i in range(n):\r\n line = input().split()\r\n typ = line[0]\r\n amount = int(line[1])\r\n if typ == '+':\r\n have += amount\r\n else:\r\n if have >= amount:\r\n have -= amount\r\n else:\r\n kids_distressed += 1\r\n\r\nprint(have, kids_distressed)", "n,x=map(int,input().split())\nc=0\ns=x \nfor i in range(n):\n ic=input()\n if ic[0]=='+':\n s+=int(ic[1:])\n else:\n num=-int(ic[1:])\n if abs(num)<=s:\n s+=num\n else:\n c+=1 \nprint(s,c)\n \t \t \t\t \t\t \t \t\t \t \t\t \t \t\t", "n, m = map(int, input().split())\r\nk = 0\r\nfor i in range(n):\r\n s = list(input().split())\r\n if s[0] == \"+\":\r\n m += int(s[1])\r\n elif s[0] == \"-\" and m - int(s[1]) >= 0:\r\n m -= int(s[1])\r\n else:\r\n k += 1\r\nprint(m, k)\r\n ", "x,aice=input().split()\r\nx,aice=int(x),int(aice)\r\nkids = 0\r\nfor i in range(x):\r\n sign,ice=input().split()\r\n ice=int(ice)\r\n if sign == '+':\r\n aice+=ice\r\n elif sign == '-' and ice<=aice:\r\n aice-=ice\r\n elif sign == '-' and ice>aice:\r\n kids+=1\r\nprint(aice,kids)", "n, x = map(int, input().split())\r\ngerda = 0\r\nfor _ in range(n):\r\n s, d = input().split()\r\n d = int(d)\r\n if s == '+':\r\n x += d\r\n else:\r\n if x < d:\r\n gerda += 1\r\n else:\r\n x -= d\r\nprint(x, gerda)", "input_list = list(map(int, input().split()))\nn = input_list[0]\nx = input_list[1]\nchildren = 0\nfor i in range(n):\n input1 = input()\n sign = input1.split()[0]\n num = int(input1.split()[1])\n if sign == '-' and num > x :\n children +=1 \n elif sign == '-' and num <= x :\n x = x - num\n elif sign == '+' :\n x+= num \nprint(x, children)\n", "n,x=map(int,input().split())\r\nc=0\r\nfor i in range(n):\r\n\tl,p=input().split()\r\n\tif l=='+':\r\n\t\tx+=int(p)\r\n\telif int(p)<=x:\r\n\t\tx-=int(p)\r\n\telse:\r\n\t\tc+=1\t\r\nprint(x,c)", "N, X = map(int, input().split())\r\n\r\ndistress = 0\r\nfor i in range(N):\r\n ope, d = input().split()\r\n if ope == '-':\r\n if X < int(d):\r\n distress += 1\r\n else:\r\n X -= int(d)\r\n else:\r\n X += int(d)\r\n\r\nprint(X, distress)", "n,m=[int(i) for i in input().split()]\r\nk=0\r\nfor _ in range(n):\r\n a,b=input().split()\r\n if a=='+':\r\n m+=int(b)\r\n else:\r\n if m-int(b)<0:\r\n k+=1\r\n else:\r\n m-=int(b)\r\nprint(m,k)\r\n", "n, x = list(map(int, input().split()))\r\n\r\ndis = 0\r\nfor i in range(n):\r\n a, b = list(input().split())\r\n if a == \"+\":\r\n x += int(b)\r\n elif a == \"-\":\r\n if x >= int(b):\r\n x -= int(b)\r\n else:\r\n dis += 1\r\nprint(x, dis)\r\n\r\n\r\n", "n, d = [int(i) for i in input().split()]\r\nans = 0\r\nfor i in range(n):\r\n\ta, b = input().split()\r\n\tif a == \"+\":\r\n\t\td += int(b)\r\n\telse:\r\n\t\tif int(b) <= d:\r\n\t\t\td -= int(b)\r\n\t\telse:\r\n\t\t\tans += 1\r\nprint(d, ans)", "n, x = map(int, input().split())\r\nl = []\r\ndis = 0\r\nfor i in range(n):\r\n sign, d = input().split()\r\n d = int(d)\r\n if sign == '-':\r\n if x < d:\r\n dis += 1\r\n else:\r\n x-=d\r\n else:\r\n x += d\r\nprint(x, \" \", dis)", "import sys\r\nn1,n2 = input().split()\r\nn1,n2=int(n1),int(n2)\r\nnum_in_distress = 0\r\nfor i in range(n1):\r\n n4,n3=input().split()\r\n n3 = int(n3)\r\n if n4==\"-\":\r\n if n2>=n3:\r\n n2 -= n3\r\n else:\r\n num_in_distress += 1\r\n elif n4==\"+\":\r\n n2+=n3\r\nprint(str(n2)+\" \"+str(num_in_distress))\r\n", "z = 0\r\na, b = map(int, input().split())\r\nfor i in range(a):\r\n c, d = input().split()\r\n if c == '+':\r\n b += int(d)\r\n else:\r\n if b >= int(d):\r\n b -= int(d)\r\n else:\r\n z += 1\r\nprint(b, z)\r\n", "n , x = [int(i) for i in input().split()]\r\n\r\np = x\r\nc = 0\r\nfor i in range(n):\r\n q = input()\r\n if q[0] == '+':\r\n p += int(q[2:])\r\n\r\n if q[0] == '-':\r\n if int(q[2:]) <= p:\r\n p -= int(q[2:])\r\n else:\r\n c += 1\r\n\r\nprint(p , c)", "people, packs = map(int, input().split())\r\nsad = 0\r\nfor i in range(people):\r\n state, amount = map(str, input().split())\r\n if state == \"+\":\r\n packs += int(amount)\r\n else:\r\n if packs >= int(amount):\r\n packs -= int(amount)\r\n else:\r\n sad += 1\r\nprint(packs, sad)\r\n\r\n", "n, first = map(int, input(\"\").split())\r\ntotal_packs = first\r\nsad_kids = 0\r\nsign = ''\r\nwanted = 0\r\n\r\nfor i in range(n):\r\n sign, wanted = map(str, input(\"\").split())\r\n wanted = int(wanted)\r\n\r\n if sign == '+':\r\n total_packs += wanted\r\n elif sign == '-' and total_packs >= wanted:\r\n total_packs -= wanted\r\n else:\r\n sad_kids += 1\r\n\r\nprint(total_packs, sad_kids)\r\n", "t = list(map(int, input().split()))\r\nn = t[0]\r\nx = t[1]\r\ni = 0\r\ndist = 0\r\nwhile i<n:\r\n d = int(input())\r\n if d<0:\r\n if x+d<0:\r\n \r\n dist = dist+1\r\n else:\r\n x = x+d\r\n else:\r\n x = x+d\r\n i = i+1\r\nprint(x, dist)\r\n ", "nx = list(map(int, input().split()))\r\nsad_children_counter = 0\r\nicecreams = nx[1]\r\nfor i in range(nx[0]):\r\n\td = list(map(str, input().split()))\r\n\tif d[0] == '+':\r\n\t\ticecreams += int(d[1])\r\n\telse:\r\n\t\tif icecreams >= int(d[1]):\r\n\t\t\ticecreams -= int(d[1])\r\n\t\telse:\r\n\t\t\t sad_children_counter += 1\r\nprint(icecreams, sad_children_counter)", "#FREE ICE CREAM(686A)\r\n\r\nt,n = map(int,input().split())\r\nkid,ice = 0,0\r\nfor i in range(t):\r\n st,va = input().split()\r\n \r\n if st == '-':\r\n if int(va) <= n:\r\n n -= int(va)\r\n else:\r\n kid += 1\r\n else:\r\n n += int(va)\r\nprint(n,kid)", "n,x=map(int,input().split())\r\nk=0\r\nfor i in range(n):\r\n\ts,p=map(str,input().split())\r\n\tif s=='+':\r\n\t\tx+=int(p)\r\n\telse:\r\n\t\tif x<int(p): k+=1\r\n\t\telse: x-=int(p)\r\nprint(x,k)", "n, x = map(int, input().split())\r\n\r\nd = 0\r\n\r\n\r\nfor i in range(n):\r\n sign, m = input().split()\r\n\r\n if sign == '+':\r\n x += int(m)\r\n else:\r\n if x < int(m):\r\n d += 1\r\n else:\r\n x -= int(m)\r\n\r\nprint(x, d)", "n, x = map(int, input().split())\r\ndist = 0\r\nb = 0\r\n\r\nfor i in range(n):\r\n c = input()\r\n b = int(c.replace(' ', ''))\r\n if x+b <0:\r\n dist += 1\r\n else:\r\n x += b\r\nprint(x, dist)", "n,x = map(int,input().split())\r\nans = 0\r\nfor i in range(n):\r\n s,d = input().split()\r\n if s == \"+\":\r\n x+=int(d)\r\n else:\r\n if int(d)>x:\r\n ans+=1\r\n else:\r\n x -= int(d)\r\nprint(\"{} {}\".format(x,ans))\r\n", "import sys\r\nimport math\r\n\r\ninput = sys.stdin.readline\r\n\r\ndef print(*args, end='\\n', sep=' ') -> None:\r\n sys.stdout.write(sep.join(map(str, args)) + end)\r\n\r\ndef main() -> None:\r\n n, x = map(int, input().split())\r\n kids = 0\r\n for i in range(n):\r\n sign, num = input().split()\r\n if sign == \"+\":\r\n x += int(num)\r\n else:\r\n if int(num) <= x:\r\n x -= int(num)\r\n else:\r\n kids += 1\r\n\r\n print(x, kids)\r\nif __name__ == '__main__':\r\n main()", "n,x = input().split()\nn = int(n) ; x = int(x)\ndis = 0 \n\nfor i in range(n): \n a,b = input().split()\n b = int(b)\n if a == '+': \n x+=b\n elif a =='-' and b>x:\n dis +=1 \n elif a=='-' and b<=x:\n x-=b\n\nprint(x,dis)\n \t\t \t \t \t \t \t\t \t\t \t\t \t \t \t", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Wed Jul 29 21:36:45 2020\r\n\r\n@author: DELL\r\n\"\"\"\r\nn,x=map(int,input().split())\r\nc=0\r\nfor i in range(n):\r\n a,d=list(input().split())\r\n d=int(d)\r\n if a=='+':\r\n x+=int(d)\r\n else:\r\n if x>=d:\r\n x-=d\r\n else:\r\n c+=1\r\nprint(x,c)\r\n", "t,p=map(int,input().split())\r\nd=0\r\nfor i in range(t):\r\n p1=input()\r\n num=int(p1[1:])\r\n if p1[0]=='+':\r\n p+=num\r\n elif p<num:\r\n d+=1\r\n else:\r\n p=p-num\r\nprint(p,d)\r\n", "n, x = map(int, input().split())\r\nd = 0\r\nfor _ in range(n):\r\n k = input()\r\n if '+' in k:\r\n x += int(k[2:])\r\n elif '-' in k:\r\n if x >= int(k[2:]):\r\n x -= int(k[2:])\r\n else:\r\n d += 1\r\nprint(x, d)\r\n", "n, x = map(int, input().split())\r\ncnt = 0\r\nfor _ in range(n):\r\n a, b = input().split()\r\n if a == \"+\":\r\n x += int(b)\r\n elif a == \"-\":\r\n if x - int(b) < 0:\r\n x = x\r\n cnt += 1\r\n else:\r\n x -= int(b)\r\nprint(x, cnt)", "\r\n\r\nn, x = list(map(int, input().split()))\r\n\r\ndistress = 0\r\nwhile n:\r\n\r\n s, v = input().split()\r\n\r\n if s == \"+\":\r\n x += int(v)\r\n\r\n else:\r\n if int(v)>x:\r\n distress += 1\r\n\r\n else:\r\n x -= int(v)\r\n\r\n n-=1\r\n\r\nprint(x, distress)\r\n\r\n", "n, x = [int(i) for i in input().split()]\r\ncount = 0\r\nfor i in range(n):\r\n a, d = list(input().split())\r\n if a == \"+\":\r\n x += int(d)\r\n else:\r\n if int(d) > x:\r\n count += 1\r\n else:\r\n x -= int(d)\r\n\r\nprint(x, count)\r\n\r\n", "# Free Ice Cream\ndef ice_cream(x, arr):\n ice = x\n g = 0\n for i in arr:\n y = i.split()\n val = int(y[1])\n if y[0] == '+':\n ice += val\n else:\n if val > ice:\n g += 1\n else:\n ice -= val\n print(ice, g)\n\n\n\n\nx = list(map(int, input().rstrip().split()))\nn = x[0]\np = x[1]\nans = []\nfor i in range(n):\n val = input()\n ans.append(val)\nice_cream(p, ans)", "n, x = map(int,input().split())\r\nchild_dist = 0\r\nwhile n:\r\n w= input()\r\n s, c = w[0], int(w[2:])\r\n if s == \"+\":\r\n x+=c\r\n else:\r\n if x-c <0:\r\n child_dist+=1\r\n else:\r\n x-=c\r\n n-=1\r\n\r\nprint(str(x) + \" \" + str(child_dist))\r\n", "n=list(map(int,input().split()))\r\nsum=n[1]\r\ndis=0\r\nfor i in range(n[0]):\r\n x=list(map(str,input().split()))\r\n if x[0]=='+':\r\n sum+=int(x[1])\r\n elif x[0]=='-' and sum>=int(x[1]):\r\n sum-=int(x[1])\r\n elif x[0]=='-' and sum<int(x[1]):\r\n dis+=1\r\nprint(sum,dis)", "n, sum = map(int, input().split())\r\nd = 0\r\nfor _ in range(n):\r\n s, q = input().split()\r\n if s == \"+\":\r\n sum += int(q)\r\n else:\r\n if int(q) <= sum:\r\n sum -= int(q)\r\n else:\r\n d += 1\r\n\r\nprint(sum, d)\r\n", "n, x = [int(x) for x in input().split(' ')]\nd = 0\nfor i in range(n):\n s, p = [x for x in input().split(' ')]\n if s == '+': x += int(p)\n elif s == '-' and int(p) > x: d += 1\n else: x -= int(p)\nprint(x, d)\n", "a,b = map(int,input().split())\r\ncol_sad = 0\r\nfor i in range(a):\r\n o,col = input().split()\r\n col = int(col)\r\n if o == \"+\":\r\n b += col\r\n else:\r\n if b >= col:\r\n b -= col\r\n else:\r\n col_sad += 1\r\n\r\nprint(b,col_sad)", "n, x = map(int,input().split())\nsad = 0\nfor i in range (n):\n a, b = input().split()\n b= int(b)\n if a == '+':\n x+=b\n else:\n if x < b:\n sad += 1\n else:\n x -= b\n\n\nprint(x, sad)\n\n\t \t\t\t\t\t \t \t \t \t \t \t\t\t\t", "n,x=map(int,input().split());p=0\r\nfor i in range(n):\r\n s=str(input())\r\n s=s.split(' ')\r\n if s[0]=='+':\r\n x+=int(s[1])\r\n else:\r\n if x>=int(s[1]):\r\n x-=int(s[1])\r\n else:\r\n p+=1\r\nprint(x,p)\r\n", "dist_k = 0\r\nrem = 0\r\n\r\ntest, x = list(map(int, input().strip().split()))\r\n#print (n,x)\r\n\r\n\r\nfor i in range(test):\r\n sign, num = list(map(str, input().strip().split()))\r\n #print(sign,num)\r\n num = int(num)\r\n if (sign == '+'):\r\n x = x + num\r\n if (sign == '-') :\r\n if (x >= num):\r\n x = x - num\r\n else:\r\n dist_k += 1\r\nprint (x,dist_k)\r\n", "n,x=map(int,input().split())\r\nt=0\r\nwhile n:\r\n s=input()\r\n s=s.replace(\" \",\"\")\r\n a=int(s)\r\n if s[0]==\"+\":\r\n x=x+a\r\n else:\r\n if x+a<0:\r\n t+=1\r\n else:\r\n x=x+a\r\n n-=1\r\nprint(x,t)", "#686A (59No. Problem A)\r\n\r\nn,x = map(int,input().split())\r\nk = 0\r\nfor i in range(n):\r\n s,p = map(str,input().split())\r\n p = int(p)\r\n if (s == '+'):\r\n x+=p\r\n else:\r\n if (x >= p):\r\n x-=p\r\n else:\r\n k+=1 \r\nprint(x,k) ", "n, x = map(int, input().split())\r\nice = list()\r\nfor j in range(n):\r\n ice.append(list(input().split()))\r\ncount = 0\r\nfor j in range(n):\r\n a = int(ice[j][1])\r\n if ice[j][0] == \"-\":\r\n if x-a < 0:\r\n count += 1\r\n else:\r\n x = x-a\r\n else:\r\n x = x+a\r\nprint(x, count)\r\n", "str=input()\r\narr=str.split(' ')\r\ncount=0\r\nk=int(arr[0])\r\ns=int(arr[1])\r\npackets=s\r\ndepress=0\r\nfor i in range(k):\r\n str=input()\r\n l = list(str)\r\n l[1] = \"\"\r\n if(str[0]=='+'):\r\n packets=packets+int(\"\".join(l))\r\n else:\r\n if(packets+int(\"\".join(l))<0):\r\n depress=depress+1\r\n else:\r\n packets = packets + int(\"\".join(l))\r\nprint(packets,end=' ')\r\nprint(depress)\r\n", "n, x = map(int, input().split())\r\n\r\ndis = 0\r\nfor _ in range(n):\r\n dau, kem = input().split()\r\n kem = int(kem)\r\n if dau == '+':\r\n x += kem\r\n else:\r\n if x >= kem:\r\n x -= kem\r\n else:\r\n dis += 1\r\nprint(x, dis)", "pepleinline,icenum=map(int,input().split())\r\nsad=0\r\nfor i in range(pepleinline):\r\n sign , number=input().split()\r\n number=int(number)\r\n if sign =='+':\r\n icenum=icenum + number\r\n else:\r\n if icenum>= number:\r\n icenum=icenum - number\r\n else:\r\n sad+=1\r\n\r\n\r\nprint(icenum , sad)", "n, x = map(int, input().split(\" \"))\r\ncounter = x\r\nchild = 0\r\nfor i in range(n):\r\n d = input().split(\" \")\r\n if d[0] == \"-\" and counter - int(d[1]) >= 0:\r\n counter -= int(d[1])\r\n elif d[0] == \"-\" and counter - int(d[1]) < 0:\r\n child += 1\r\n else:\r\n counter += int(d[1])\r\nprint(counter, child)", "n, m = map(int,input().split())\r\ncnt = 0\r\n\r\na = list()\r\nfor i in range(n):\r\n\tx, y = input().split()\r\n\ta += [[x, int(y)]]\r\n\r\nfor i in range(n):\r\n\tif a[i][0] == '+':\r\n\t\tm += a[i][1]\r\n\telse:\r\n\t\tif m >= a[i][1]:\r\n\t\t\tm -= a[i][1]\r\n\t\telse:\r\n\t\t\tcnt += 1\r\nprint(m,cnt)", "chir, van = map(int, input().split())\r\nc0t = 0\r\nfor gee in range(chir):\r\n\tabc, bca = map(str, input().split())\r\n\tbca = int(bca)\r\n\tif abc == '+':\r\n\t\tvan += bca\r\n\telse:\r\n\t\tif bca > van:\r\n\t\t\tc0t += 1\r\n\t\t\tcontinue\r\n\t\tvan -= bca\r\nprint(van, c0t)\r\n\"\"\"\r\n\t686A - Free Ice Cream\r\n\tqueueStart = str(input())\r\nint_queueStart = list(map(int, queueStart.split()))\r\nn = int_queueStart[0]\r\nx = int_queueStart[1]\r\ndistressedKids = 0\r\n \r\nfor i in range(0,n):\r\n person = str(input())\r\n dados_person = list(person.split())\r\n signal = dados_person[0]\r\n icecream = int(dados_person[1])\r\n if signal == '+':\r\n x += icecream\r\n else:\r\n if icecream > x:\r\n distressedKids += 1\r\n else: \r\n x -= icecream\r\nprint('{} {}'.format(x, distressedKids))\r\n \t \t\t\t\t\r\n\"\"\"", "k,n=map(int,input().split())\r\n\r\ncnt=0\r\n\r\n\r\n\r\nfor i in range(k):\r\n c,r=input().split()\r\n r=int(r)\r\n\r\n if(c=='-'):\r\n if((n-r)<0):\r\n cnt+=1\r\n else:\r\n n=n-r\r\n \r\n else:\r\n n=n+r\r\n \r\nprint(n,cnt)\r\n \r\n ", "a,b=map(int,input().split())\r\ndistress=0\r\nfor _ in range(a):\r\n\tsign,val1=map(str,input().split())\r\n\tval=int(val1)\r\n\tif sign == '+':\r\n\t\tb=b+val\r\n\tif sign =='-':\r\n\t\tif b-val >= 0:\r\n\t\t\tb=b-val\r\n\t\telse:\r\n\t\t\tdistress=distress+1\r\nprint(b,distress)", "n,x = map(int,input().split())\r\ncnt =0\r\nfor __ in range(n):\r\n a,b = map(str,input().split())\r\n b = int(b)\r\n if a ==\"+\":\r\n x += b \r\n elif a==\"-\":\r\n if x>=b:\r\n x-=b\r\n else:\r\n cnt += 1\r\nprint(x,cnt) ", "n, x = map(int, input().split())\r\n\r\ncount = 0\r\nfor i in range(n):\r\n m, n = map(str, input().split(' '))\r\n if m == '+':\r\n x += int(n)\r\n elif x - int(n) >= 0:\r\n x -= int(n)\r\n else:\r\n count += 1\r\n\r\nprint(str(x) + \" \" + str(count))\r\n", "import sys\r\nfrom collections import deque\r\ndef rs(): return sys.stdin.readline().rstrip().split()\r\ndef ri(): return int(sys.stdin.readline())\r\ndef ria(): return deque(map(int, sys.stdin.readline().split()))\r\ndef ws(s): sys.stdout.write(s)\r\ndef wi(n): sys.stdout.write(str(n) + '\\n')\r\ndef wia(a): sys.stdout.write('\\n'.join([str(x) for x in a]) + '\\n')\r\n #--------------------Solution------------------------\r\nn,x=ria()\r\ncnt=0\r\nfor i in range(n):\r\n sign,z=rs()\r\n if sign=='+':\r\n x+=int(z)\r\n else:\r\n if x>=int(z):x-=int(z)\r\n else:cnt+=1\r\nws(f\"{x} {cnt}\")", "n, x = input().split()\nn = int(n)\nx = int(x)\nfrustrated = 0\nfor i in range(n):\n ch, d = input().split()\n d = int(d)\n if ch == '+':\n x += d\n else:\n if d>x:\n frustrated += 1\n else:\n x -= d\nprint(x, frustrated)\n\n\n\n \t \t\t\t\t\t\t \t\t \t\t \t \t \t \t\t\t \t\t\t", "n,x=map(int,input().split())\nc=0\nfor i in range(n):\n a,b=input().split()\n for i in (a):\n if i=='+':\n x=x+int(b)\n elif i=='-'and int(b)<=x:\n x=x-int(b)\n else:\n c=c+1\nprint(x,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,x=map(int,input().split());s=0\nfor _ in ' '*n:\n d=int(input().replace(' ', ''))\n if x+d<0:s+=1\n else:x+=d\nprint(x,s)", "n,x = map(int,input().split())\r\ndc = 0\r\nfor i in range(n):\r\n a = input().split()\r\n if a[0] == \"+\":\r\n x += int(a[1])\r\n elif a[0] == \"-\":\r\n if int(a[1]) > x:\r\n dc += 1\r\n else:\r\n x -= int(a[1])\r\n \r\nprint(x,dc)", "n,x = map(int,input().split())\r\nd = 0\r\nfor i in range(n) :\r\n l = input().split()\r\n s = l[0]\r\n p = int(l[1])\r\n if s == \"-\" :\r\n if p <= x :\r\n x -= p\r\n else :\r\n d += 1\r\n elif s == \"+\" :\r\n x += p\r\n\r\nprint(x,d)\r\n", "n,x=map(int,input().split())\r\nch=0\r\nfor _ in range(n):\r\n a,b=input().split()\r\n if a=='+':\r\n x+=int(b)\r\n elif a=='-':\r\n if x<int(b):ch+=1\r\n else: x-=int(b)\r\nprint(x,ch)", "f=0\nn,h=input().split(\" \")\na=n,h\na=list(a)\nfor i in range(len(a)):\n a[i]=int(a[i])\nfor k in range(a[0]):\n char=input()\n l=list()\n l.extend(char.split())\n l[1]=int(l[1])\n if(l[0]=='+'):\n a[1]=a[1]+l[1]\n elif (l[0] =='-'):\n if(l[1]>a[1]):\n f+=1\n else:\n a[1]=a[1]-l[1]\nprint(a[1],f,sep=\" \")\n\n\t\t\t \t \t \t\t \t \t\t \t\t\t \t \t", "t, x = map(int, input().split())\r\nleft = x\r\nsad = 0\r\nfor i in range(t):\r\n z, d = map(str, input().split())\r\n if z == '+':\r\n left += int(d)\r\n elif int(d) > left:\r\n sad += 1\r\n else:\r\n left -= int(d)\r\nprint(left, sad)\r\n", "n,x = map(int, input().split())\r\n\r\nsokem = x\r\nsotre = 0\r\nfor i in range(0,n):\r\n congtru,kem = map(str,input().split())\r\n kem = int(kem)\r\n if congtru == '+':\r\n sokem += kem\r\n elif sokem - kem < 0:\r\n sotre += 1\r\n else:\r\n sokem -= kem\r\n\r\nprint(f\"{sokem} {sotre}\")", "def ice_cream_distribution(n, x, arr):\r\n distress = 0\r\n for i in range(n):\r\n if arr[i][0] == '-':\r\n if x < arr[i][1]:\r\n distress += 1\r\n else:\r\n x -= arr[i][1]\r\n else:\r\n x += arr[i][1]\r\n return x, distress\r\n\r\nn, x = map(int, input().split())\r\narr = [list(map(str, input().split())) for i in range(n)]\r\narr = [(i[0], int(i[1])) for i in arr]\r\nresult = ice_cream_distribution(n, x, arr)\r\nprint(*result)\r\n", "n_x = input()\nn = n_x.split()[0]\nx = n_x.split()[1]\nn = int(n)\nx = int(x) \noperations = []\nwhile(n > 0):\n o_v = input()\n operator = o_v.split()[0]\n value = o_v.split()[1]\n value = int(value)\n operation = (operator, value)\n operations.append(operation)\n n -= 1\n\ndistressed_kids = 0\nfor v in operations:\n if (v[0] == '+'):\n x += v[1]\n continue\n if (x-v[1] >= 0):\n x = x - v[1]\n else :\n distressed_kids += 1\n\nprint(x)\nprint(distressed_kids)\n ", "n,x=map(int, input().split())\r\nc=0\r\nfor t in range (n):\r\n a,b=map(str, input().split())\r\n if a=='+':\r\n x+=int(b)\r\n else:\r\n if int(b)<=x:\r\n x-=int(b)\r\n else:\r\n c+=1\r\nprint(x,c)", "n, m = map(int, input().split())\r\nc = 0\r\nfor _ in range(n):\r\n a, b = map(str, input().split())\r\n if a == '-':\r\n if m >= int(b):\r\n m -= int(b)\r\n else:\r\n c += 1\r\n else:\r\n m += int(b)\r\nprint(m, c)", "import sys\r\n\r\ninput = sys.stdin.readline\r\noutput = sys.stdout.write\r\n\r\n\r\ndef main():\r\n ops, num = map(int, input().rstrip().split())\r\n dis = 0\r\n for i in range(ops):\r\n kind, amount = input().rstrip().split()\r\n amount = int(amount)\r\n if kind == '-':\r\n if amount <= num:\r\n num -= amount\r\n else:\r\n dis += 1\r\n else:\r\n num += amount\r\n output(str(num) + ' ' + str(dis))\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "n, x = map(int, input().split())\r\nsad = 0\r\nfor u in range(n):\r\n a, b = (i for i in input().split())\r\n b = int(b)\r\n if a == '+':\r\n x += b\r\n else:\r\n if x >= b:\r\n x -= b\r\n else:\r\n sad += 1\r\nprint(x, sad)\r\n", "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 n, x = map(int, input().split())\r\n happy, sad = 0, 0\r\n for i in range(n):\r\n s, t = map(str, input().split())\r\n if s == '+':\r\n x += int(t)\r\n else:\r\n if x >= int(t):\r\n x -= int(t)\r\n else:\r\n sad+=1\r\n print(x, sad)\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", "k = 0\r\na, b = map(int, input().split())\r\nfor _ in range(a):\r\n n = input()\r\n n = n.replace(\" \", \"\")\r\n n = int(n)\r\n\r\n if b+n < 0:\r\n k += 1\r\n else:\r\n b += n\r\nprint(b, k)\r\n", "n, x = [int(i) for i in input().split()]\r\n\r\nrecords = []\r\n\r\nfor _ in range(n):\r\n records.append(input().split(\" \"))\r\n\r\ndef main(x, records):\r\n distress = 0\r\n for i in records:\r\n if i[0] == \"+\":\r\n x += int(i[1])\r\n continue\r\n if i[0] == \"-\" and int(i[1]) <= x:\r\n x -= int(i[1])\r\n else:\r\n distress += 1\r\n\r\n return x, distress\r\n\r\nprint(*main(x, records))", "n, x = (map(int,input().split()))\r\nicecream_packs = x\r\ndistressed_kids = 0\r\nfor i in range(n):\r\n a, d = str(input()).split()\r\n if a == '+':\r\n icecream_packs += int(d)\r\n else:\r\n icecream_packs -= int(d)\r\n if icecream_packs < 0:\r\n distressed_kids += 1\r\n icecream_packs += int(d)\r\nprint ('{0} {1}'.format(icecream_packs, distressed_kids))\r\n\r\n", "n,x=map(int,input().split())\nf=0\nfor i in range(n):\n c,d=input().split()\n d=int(d)\n if c == '+':\n x += d\n else:\n if d > x:\n f+=1\n else:\n x -= d\nprint(x,f)\n\n\t \t\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\ncount = 0\r\nfor i in range(n):\r\n a, d = [ i for i in input().split()]\r\n if a == '+':\r\n x += int(d)\r\n elif a == '-':\r\n if x - int(d) >= 0:\r\n x -= int(d)\r\n else:\r\n count += 1\r\nprint(x, count)", "n, x = [int(i) for i in input().split()]\r\nc = 0\r\nfor _ in range(n):\r\n op, num = [i for i in input().split()]\r\n num = int(num)\r\n if op == '+':\r\n x += num\r\n elif x >= num:\r\n x -= num\r\n else:\r\n c += 1\r\nprint(x, c)", "n, l = map(int, input().split())\r\ntot = l \r\nd = 0\r\n\r\nfor i in range(n):\r\n c = input().split()\r\n\r\n if c[0] == '+':\r\n tot += int(c[1])\r\n else:\r\n if int(c[1]) <= tot:\r\n tot -= int(c[1])\r\n else:\r\n d += 1\r\n\r\nprint(tot,d)\r\n", "n , x = map(int, input().split())\r\nkids = 0\r\nfor _ in range(n):\r\n want = input().split()\r\n remove = want[0] + want[1]\r\n num = int(remove)\r\n if (num > 0):\r\n x += num\r\n elif (x + num < 0):\r\n kids += 1\r\n else:\r\n x += num\r\nprint(x, kids)", "n,x=map(int,input().split())\r\nm=0\r\nfor case in range(n):\r\n d=int(''.join((input().split(' '))))\r\n if x+d<0:m+=1\r\n else:x+=d\r\nprint(x,m)", "n, x = map(int, input().split())\r\nd = 0\r\nfor _ in range(n):\r\n o, v = input().split()\r\n v = int(v)\r\n if o == '+':\r\n x += v\r\n else:\r\n if x >= v:\r\n x -= v\r\n else:\r\n d += 1\r\nprint(x, d)", "znak = []\r\nnum = []\r\nn, m = map(int, input().split()) \r\nsumm = m\r\ngrust = 0\r\nfor i in range(n):\r\n s, l = input().split()\r\n znak.append(s)\r\n num.append(int(l))\r\nfor k in range(len(num)):\r\n if znak[k] == '+':\r\n summ += num[k]\r\n else:\r\n summ -= num[k]\r\n if summ < 0:\r\n summ += num[k]\r\n grust += 1\r\n\r\nprint(summ, grust)\r\n ", "n, x = (int(a) for a in input().split())\r\ndis = 0\r\nfor i in range(n):\r\n s, d = input().split()\r\n d = int(d)\r\n if s == '+':\r\n x += d\r\n elif s == '-' and d <= x:\r\n x -= d\r\n elif s == '-' and d > x:\r\n dis += 1\r\nprint(x, dis)", "n, x = map(int, input().split())\r\ntotal = int(x)\r\nkid = 0\r\nfor line in range(n):\r\n val = input().split()\r\n if val[0] == '+':\r\n total += int(val[1])\r\n\r\n if val[0] == '-':\r\n if total - int(val[1]) >= 0:\r\n total -= int(val[1])\r\n else:\r\n kid += 1\r\nprint(total, kid)\r\n", "# Link: https://codeforces.com/contest/686/problem/A\n\nn, ice_cream_packs = map(int, input().split())\ndistressed_kids = 0\n\nfor i in range(n):\n operation, number = input().split()\n number = int(number)\n \n if operation == \"+\":\n ice_cream_packs += number\n \n if operation == \"-\":\n \n if (ice_cream_packs - number) < 0:\n distressed_kids += 1\n else:\n ice_cream_packs -= number\n\nprint(ice_cream_packs, distressed_kids)", "n, x = map(int, input().split())\r\nnm = 0\r\nfor i in range(n):\r\n\ta, b = map(str, input().split())\r\n\tif (a == \"+\"):\r\n\t\tx += int(b)\r\n\telse:\r\n\t\tb = int(b)\r\n\t\tif (x >= b):\r\n\t\t\tx -= b\r\n\t\telse:\r\n\t\t\tnm += 1\r\nprint(x, nm)", "a, b = map(int, input().split(' '))\r\ns = b\r\ndis = 0\r\nwhile True:\r\n try:\r\n j, k = map(str, input().split(' '))\r\n if j == \"+\":\r\n s += int(k)\r\n else:\r\n if s - int(k) >= 0:\r\n s -= int(k)\r\n else:\r\n dis += 1\r\n except:\r\n break\r\nprint(s, dis)", "n,x=map(int,input().split())\r\nc=0\r\nfor i in range(n):\r\n\ts,d=input().split()\r\n\td=int(d)\r\n\tif s==\"+\":\r\n\t\tx+=d\r\n\telse:\r\n\t\tif x-d>=0:\r\n\t\t\tx-=d\r\n\t\telse:\r\n\t\t\tc+=1\r\nprint(x,c)", "n,x = [int(_) for _ in input().split()]\r\nqueue = [eval(input()) for i in range(n)]\r\nturnedaway = 0\r\ncurrent = x\r\nfor person in queue:\r\n if person + current >=0:\r\n current +=person\r\n else:\r\n turnedaway +=1\r\nprint(current,turnedaway)\r\n", "x,y=input().split()\nx=int(x)\ny=int(y)\ncnt=0\nfor i in range(x):\n a,b=input().split()\n b=int(b)\n if a==\"+\":\n y+=b\n elif b>y:\n cnt+=1\n else:\n y-=b\nprint(y,cnt)\n#nnnnnnnnnnnnnnnnnnnnnnnnnnnnnn\n \t \t \t\t \t \t\t\t \t\t \t\t \t \t", "n, x = map(int, input().split())\r\nleft , dis = x, 0\r\nfor l in range(n):\r\n s, d = map(str, input().split())\r\n d = int(d)\r\n \r\n if s == '+':\r\n left += d\r\n else:\r\n if left < d:\r\n dis += 1\r\n else:\r\n left -= d\r\nprint(left, dis)", "n,total=map(int,input().split())\r\nfks=0\r\nfor i in range(n):\r\n op,val=input().split()\r\n val = int(val)\r\n # print(op,val)\r\n if(eval(f\"{total} {op} {val}\")>=0):\r\n if(op==\"-\"):\r\n total-=val\r\n else:\r\n total+=val\r\n else: \r\n fks+=1\r\nprint(total,fks)\r\n\r\n", "n,x=input().split()\nn = int(n) ; x = int(x)\n\ndiSS=0\n\nfor i in range(n):\n a,b = input().split()\n b= int(b)\n if a==\"+\":\n x+=b\n elif a== \"-\" and b<=x:\n x-=b\n elif a == \"-\" and b>x:\n diSS+=1\nprint(x,diSS)\n \t \t\t\t\t \t\t \t \t \t\t \t \t", "n, x = map(int, input().split())\r\ncount = x\r\ndis = 0\r\nfor i in range(n):\r\n c, d = map(str, input().split())\r\n d = int(d)\r\n if c == \"+\":\r\n count += d\r\n else:\r\n if d <= count:\r\n count -= d\r\n else:\r\n dis += 1\r\n\r\nprint(count, dis)", "n, x = map(int, input().split())\r\ndistress = 0\r\nfor i in range(n):\r\n d = input()\r\n d = str.split(d)\r\n if '+' in d:\r\n x += int(d[-1])\r\n else:\r\n if int(d[-1]) > x:\r\n distress += 1\r\n else:\r\n x -= int(d[-1])\r\nprint(x, distress)\r\n", "#!/bin/python3\r\nnx = list(map(int, input().split()))\r\ndistrees = 0\r\nwhile nx[0] > 0:\r\n\tsignNumber = list(map(str, input().split()))\r\n\ts = ''.join(str(ch) for ch in signNumber)\r\n\td = int(s[1:len(s)])\r\n\tif signNumber[0] == '+':\r\n\t\tnx[1] += d\r\n\telif signNumber[0] == '-' and d > nx[1]:\r\n\t\tdistrees += 1\r\n\telif signNumber[0] == '-' and d <= nx[1]:\r\n\t\tnx[1] -= d\r\n\tnx[0] -= 1\r\n\r\nprint(nx[1], distrees)", "i=input()\r\ni=i.split(\" \")\r\nn=int(i[0])\r\nnumIC=int(i[1])\r\ncount=0\r\nfor i in range(n):\r\n a =input()\r\n a=a.split(\" \")\r\n m=a[0]\r\n v=int(a[1])\r\n if m==\"+\":\r\n numIC+=v\r\n else:\r\n if v <= numIC:\r\n numIC-=v\r\n else:\r\n count+=1\r\n\r\nprint(str(numIC)+\" \"+str(count))\r\n", "n, x = [int(i) for i in input().split()]\r\n\r\nleft = x\r\nsad = 0\r\n\r\nfor i in range(n):\r\n w, h = [j for j in input().split()]\r\n h = int(h)\r\n if w == '+':\r\n left += h\r\n elif w == '-':\r\n if left - h < 0:\r\n sad += 1\r\n else:\r\n left -= h\r\n\r\nprint(left, end=' ')\r\nprint(sad)\r\n \r\n", "queueStart = str(input())\nint_queueStart = list(map(int, queueStart.split()))\nn = int_queueStart[0]\nx = int_queueStart[1]\ndistressedKids = 0\n\nfor i in range(0,n):\n person = str(input())\n dados_person = list(person.split())\n signal = dados_person[0]\n icecream = int(dados_person[1])\n if signal == '+':\n x += icecream\n else:\n if icecream > x:\n distressedKids += 1\n else: \n x -= icecream\nprint('{} {}'.format(x, distressedKids))\n \t \t\t\t\t\t \t \t\t\t\t\t \t\t \t\t\t\t", "x, y = [int(x) for x in input().split()]\r\nd = 0\r\nfor i in range(x):\r\n a, b = input().split()\r\n if a == '+':\r\n y += int(b)\r\n else:\r\n if int(b) <= y:\r\n y -= int(b)\r\n else:\r\n d += 1\r\nprint(y, d)\r\n", "n, all = map(int,input().split())\r\nk = 0\r\nfor i in range(n):\r\n s = [a for a in input().split()]\r\n d = int(s[1])\r\n if s[0] == '-':\r\n d = d*(-1)\r\n if d > 0:\r\n all +=d\r\n else:\r\n if abs(d) > all:\r\n k = k+1\r\n else:\r\n all +=d\r\nprint(all, k)\r\n", "def con(l):\r\n l=l.split()\r\n l2=\"\".join(l)\r\n return int(l2)\r\n \r\n\r\n \r\n\r\nr=input()\r\nr1=list(map(int,r.split()))\r\nn,x=r1\r\nl1=[]\r\nfor i in range(n):\r\n y=input()\r\n l1.append(con(y))\r\n \r\n \r\nboy=0\r\nfor i in l1:\r\n if i>0:\r\n x+=i\r\n elif i<0:\r\n if i*-1>x:\r\n boy+=1\r\n else:\r\n x-=i*-1\r\n \r\nprint(x,boy)\r\n", "n, x = map(int, input().split())\r\nsad = 0\r\nfor _ in range(n):\r\n\tflag, d = map(str, input().split())\r\n\td = int(d)\r\n\tif flag == '+':\r\n\t\tx += d\r\n\telse:\r\n\t\tif x >= d:\r\n\t\t\tx -= d\r\n\t\telse:\r\n\t\t\tsad += 1\r\nprint(x, sad)", "n,k=map(int,input().split())\r\ndis=0\r\nfor i in range(n):\r\n ls=list(map(str,input().split()))\r\n s=ls[0]\r\n m=int(ls[1])\r\n if s=='-':\r\n if m>k:\r\n dis+=1\r\n else:\r\n k-=m\r\n else:\r\n k+=m\r\nprint(*[k,dis])", "n, x = map(int,input().split())\r\ndepressed = 0\r\nfor i in range(n):\r\n a = input().split(\" \")\r\n if a[0] == \"+\":\r\n x += int(a[1])\r\n else:\r\n if x < int(a[1]):\r\n depressed += 1\r\n else:\r\n x -= int(a[1])\r\n\r\nprint(\"{} {}\".format(x, depressed))", "n, iceCream = map(int, input().split())\npeople = 0\nfor i in range(n):\n ch, x = input().split()\n x = int(x)\n if ch == '+':\n iceCream += x\n else:\n if x > iceCream:\n people +=1\n else:\n iceCream -= x\nprint(iceCream,people)\n\t \t \t \t\t \t \t\t\t \t\t\t \t \t \t\t\t\t", "n, x = input().split(\" \")\r\nn, x = int(n), int(x)\r\nn_packs, n_kids = x, 0\r\nfor i in range(0, n):\r\n d = input().split(\" \")\r\n if d[0] == \"-\" and n_packs < int(d[1]):\r\n n_kids += 1\r\n continue\r\n if d[0] == \"-\":\r\n n_packs -= int(d[1])\r\n if d[0] == \"+\":\r\n n_packs += int(d[1])\r\n\r\nprint(n_packs, n_kids)", "n, crtSum = map(int, input().split())\r\ncount = 0\r\nfor _ in range(n):\r\n sign, num = input().split()\r\n if sign == '+':\r\n crtSum += int(num)\r\n else:\r\n if crtSum - int(num) >= 0:\r\n crtSum -= int(num)\r\n else:\r\n count += 1\r\n \r\nprint(crtSum, count)", "n, x = map(int, input().split())\r\nans = 0\r\nfor i in range(n):\r\n a, b = map(str, input().split())\r\n if a == '+':\r\n x += int(b)\r\n else:\r\n if x >= int(b):\r\n x -= int(b)\r\n else:\r\n ans += 1\r\nprint(x, ans)\r\n", "n, x = [int(k) for k in input().split(' ')]\np = 0\nfor _ in range(n):\n s, d = input().split(' ')\n d = int(d)\n\n if s == '+':\n x += d\n else:\n if x < d:\n p += 1\n continue\n else:\n x -= d\nprint(f'{x} {p}')\n\t\t\t \t\t\t\t\t \t \t \t \t \t \t\t \t\t", "queue_count, icecream_packs = list(map(int, input().strip().split()))[:2]\r\nqueue = [list(map(str, input().split())) for i in range(queue_count)]\r\nd_child = 0\r\nfor q in queue:\r\n\r\n if q[0] == '-':\r\n if (icecream_packs - int(q[1])) < 0:\r\n d_child+=1\r\n else:\r\n icecream_packs-= int(q[1])\r\n\r\n if q[0] == '+':\r\n icecream_packs += int(q[1])\r\n\r\nprint(icecream_packs,d_child)", "n,x=input().split()\nn = int(n) ; x = int(x)\n\ndiss=0\n\nfor i in range(n):\n a,b = input().split()\n b= int(b)\n if a==\"+\":\n x+=b\n elif a== \"-\" and b<=x:\n x-=b\n elif a == \"-\" and b>x:\n diss+=1\n\nprint(x,diss)\n\t \t\t \t\t\t\t\t\t\t \t \t\t\t \t\t\t\t", "import math\r\nt,x = list(map(int,input().split()))\r\nsum = x\r\ndis = 0\r\nwhile t:\r\n s, n = list(map(str, input().split()))\r\n if s=='+':\r\n sum = sum + int(n)\r\n else:\r\n if sum - int(n) >=0:\r\n sum = sum - int(n)\r\n else:\r\n dis = dis + 1\r\n t = t - 1\r\nprint(sum,dis)\r\n", "#!/usr/bin/env python3\r\n# -*- coding: utf-8 -*-\r\n#\r\n# ------------------------------------------------------------------------------\r\n# Author: Mohammad Mohsen\r\n# Date: Tue Dec 28 04:47:20 2021\r\n# problem name: Free_Ice_Cream\r\n# contest: 686-Codeforces Round #359 (Div. 2)\r\n# problem difficulty: A-D2\r\n# problem url: https://codeforces.com/contest/686/problem/A\r\n# ------------------------------------------------------------------------------\r\n\r\nfrom typing import *\r\n\r\n\r\nclass Problem(object):\r\n\r\n def __init__(self, name: str) -> None:\r\n self.name = name\r\n\r\n def solution(self) -> Union[str, int, float]:\r\n queue_size, icecream_packs = [int(i) for i in input().strip().split()]\r\n distressed: int = 0\r\n for i in range(queue_size):\r\n person, icecream = input().strip().split()\r\n icecream = int(icecream)\r\n if person == \"+\":\r\n icecream_packs += icecream\r\n else:\r\n if icecream > icecream_packs:\r\n distressed += 1\r\n else:\r\n icecream_packs -= icecream\r\n \r\n return f\"{icecream_packs} {distressed}\"\r\n\r\nproblem = Problem(\"Free_Ice_Cream\")\r\n\r\nif __name__ == \"__main__\":\r\n solution: Union[str, int, float] = problem.solution()\r\n print(solution)\r\n\r\n", "n, total_ice_cream = map(int, input().split())\r\n\r\nsad_kids = 0\r\n\r\nfor i in range(n):\r\n s = [a for a in input().split()]\r\n d = int(s[1])\r\n if s[0] == '-':\r\n d = d * (-1)\r\n\r\n if d > 0:\r\n total_ice_cream += d\r\n else:\r\n if abs(d) > total_ice_cream:\r\n sad_kids += 1\r\n else:\r\n total_ice_cream += d\r\n\r\nprint(total_ice_cream, sad_kids)\r\n\r\n", "n,icecream=input().split()\nn=int(n)\npeople=0\nicecream=int(icecream)\nfor i in range(n):\n ch,x=input().split()\n x = int(x)\n if ch == '+':\n icecream += x\n else:\n if x > icecream:\n people += 1\n else:\n icecream-=x\nprint(icecream,people)\n \t \t \t\t\t \t\t \t \t \t \t\t\t\t", "n, x = map(int, input().split())\r\ndist = 0\r\nfor i in range(n):\r\n s, d = map(str, input().split())\r\n if s == \"+\":\r\n x += int(d)\r\n\r\n else:\r\n if x >= int(d):\r\n x -= int(d)\r\n else:\r\n dist += 1\r\nprint(x, dist)\r\n", "## Mustafa Moghazy ##\ndef solve(a, b ) :\n t = 0\n while a :\n t1, t2 = input().split()\n if t1 =='+' :\n b += int (t2)\n elif t1 == '-' :\n if b >= int(t2) :\n b -= int (t2)\n else :\n t+=1\n a-=1\n print (b,t)\na , b = input().split()\nsolve( int(a), int(b) )\n\n \t\t\t\t\t \t\t \t \t\t\t \t\t \t \t\t\t\t", "n, x = [int(s) for s in input().split(' ')]\r\nk = 0\r\nfor i in range(n):\r\n line = input().split(' ')\r\n if line[0] == '+':\r\n x += int(line[1])\r\n else:\r\n if int(line[1]) > x:\r\n k += 1\r\n else:\r\n x -= int(line[1])\r\nprint(x, k)\r\n", "n, x = [int(i) for i in input().split(\" \")]\r\ndistress = 0\r\nfor line in range(n):\r\n sign, value = [i for i in input().split(\" \")]\r\n value = int(value)\r\n if sign == \"+\":\r\n x += value\r\n else:\r\n if value > x:\r\n distress += 1\r\n else:\r\n x -= value\r\nprint(x, distress)\r\n", "#https://codeforces.com/contest/686/problem/A\r\n\r\n\r\nn,x = input().split(' ')\r\nn=int(n)\r\nx=int(x)\r\ncount=0\r\nfor i in range(n):\r\n\r\n order = input().split(' ')\r\n type = order[0]\r\n nr=int(order[1])\r\n\r\n if (type == '-'):\r\n if(nr<=x):\r\n x-=nr\r\n else:\r\n count+=1\r\n else:\r\n x+=nr\r\n\r\nprint(x,count)", "\r\ndef free_ice_cream(n, x):\r\n sad_kid = 0\r\n for _i in range(n): \r\n value = input().split()\r\n if value[0] == '+': x += int(value[1])\r\n elif value[0] == '-' and int(value[1]) > x: sad_kid += 1\r\n else: x -= int(value[1])\r\n print(x, sad_kid)\r\n\r\ndef main():\r\n n, x = (int(i) for i in input().split())\r\n free_ice_cream(n, x)\r\n\r\nif __name__ == '__main__':\r\n main()", "n, x = [int(v) for v in input().split()]\nacc = 0\nfor _ in range(n):\n r = input().split()\n r[1] = int(r[1])\n if r[0] == \"+\":\n x += r[1]\n elif x >= r[1]:\n x -= r[1]\n else:\n acc += 1\nprint(x, acc)\n", "n,x=map(int,input().split())\r\na=0\r\nfor i in range(n):\r\n k, l=input().split()\r\n b=int(l)\r\n if k=='-' and b>x:\r\n x-=0\r\n a+=1\r\n elif k=='-' and b<=x:\r\n x-=b\r\n elif k=='+':\r\n x+=b\r\nprint(x,a) ", "n,x=input().split()\r\nn=int(n)\r\nicecream=int(x)\r\ndist=0\r\nmat=[]\r\nfor i in range(n):\r\n A=list(map(str,input().split()))\r\n mat.append(A)\r\nfor i in range(n):\r\n if mat[i][0]=='+':\r\n icecream=icecream+int(mat[i][1])\r\n else:\r\n if icecream<int(mat[i][1]):\r\n dist=dist+1\r\n else:\r\n icecream=icecream-int(mat[i][1])\r\n\r\nprint(icecream,end=\" \")\r\nprint(dist)", "# tc = int(input())\r\nfor i in range(1):\r\n # n = int(input())\r\n li =list(map(int,input().split()))\r\n left = li[1]\r\n kids = 0\r\n n = li[0]\r\n for i in range(n):\r\n s = input()\r\n \r\n if s[0] == \"-\":\r\n if left<int(s[2:]):\r\n kids += 1\r\n else:\r\n left -= int(s[2:])\r\n else:\r\n left += int(s[2:])\r\n\r\n\r\n print(left,kids)", "n, x =[int(i) for i in input().split()]\r\no = 0\r\nfor i in range(n):\r\n a,d = [i for i in input().split()]\r\n if a == '+':\r\n x += int(d)\r\n if a == '-' and x >= int(d):\r\n x -= int(d)\r\n elif a == '-':\r\n o+=1\r\nprint(x,o)", "n,k = map(int, input().split())\r\ng = 0\r\nfor i in range(n):\r\n a = input().split()\r\n if a[0]=='+':\r\n k += int(a[1])\r\n else:\r\n if k-int(a[1])<0:\r\n g += 1\r\n else:\r\n k -= int(a[1])\r\nprint(k,g)", "n, x = map(int, input().split())\r\nd = 0\r\n\r\nfor i in range(n):\r\n p = list(input().split())\r\n if \"+\" in p:\r\n x += int(p[1])\r\n elif \"-\" in p:\r\n if int(p[1]) <= x:\r\n x -= int(p[1])\r\n else:\r\n d += 1\r\n \r\nprint(x, d)", "n,x=map(int,input().split())\r\n\r\npacks=x\r\ndistress=0\r\nfor i in range(n):\r\n s=input().split()\r\n if s[0]=='+':\r\n packs=packs+int(s[1])\r\n elif s[0]=='-' and packs>=int(s[1]):\r\n packs=packs-int(s[1])\r\n else:\r\n distress+=1\r\nprint(packs,distress)\r\n \r\n \r\n \r\n ", "n,x = list(map(int,input().split()))\r\ndistressed = 0\r\nremain = x\r\nfor i in range(n):\r\n a = input().split()\r\n if a[0] == \"+\":\r\n remain+=int(a[1])\r\n else:\r\n remain-=int(a[1])\r\n if remain < 0:\r\n remain+=int(a[1]) \r\n distressed+=1\r\nprint(remain,distressed)", "k,rem = list(map(int,input().split())) # 5 7\npem = 0\nfor _ in range(k):\n case = input()\n if case[0] == \"+\":\n rem += int(case[2:])\n elif case[0] == \"-\" and int(rem) >= int(case[2:]):\n rem -= int(case[2:])\n else:\n pem += 1\nprint(rem,pem)\n\t \t\t\t \t \t\t\t \t \t\t\t\t\t\t\t \t", "n,x = map(int,input().split())\ncount = 0\nfor i in range(n):\n a, b = input().split()\n b = int(b)\n if(a=='+'):\n x+=b\n else:\n if(x>=b):\n x-=b\n else:\n count+=1\nprint(x,end=' ')\nprint(count)\n", "\nn_people , n_icecreams = map(int,input().split())\n\nlist_people=[]\nfor _ in range(n_people):\n symbol,item = input().split()\n list_people.append((symbol,int(item)))\n\ndistressed=0\nfor s,item in list_people:\n if s =='+':\n n_icecreams+=item\n elif s =='-':\n if n_icecreams >= item:\n n_icecreams-=item\n else:\n distressed+=1\n\nprint(n_icecreams,distressed)\n", "n, x = map(int, input().split())\r\no = 0\r\nfor i in range(n):\r\n r, d = map(str, input().split())\r\n if r == '+':\r\n x += int(d)\r\n elif r == '-':\r\n if x - int(d) >= 0:\r\n x -= int(d)\r\n else:\r\n o += 1\r\nprint(x, o)", "n, x = list(map(int, input().split(' ')))\r\ndelta = []; distressed = 0\r\nfor i in range(n):\r\n sign, num = input().split(' ')\r\n num = int(num)\r\n if sign == '-':\r\n if num > x:\r\n distressed += 1\r\n else:\r\n x -= num\r\n else:\r\n x += num\r\nprint('{} {}'.format(x, distressed))\r\n", "n,x = input().split()\r\nn = int(n)\r\nx = int(x)\r\ncnt = 0\r\nfor i in range(n):\r\n a,s = input().split()\r\n s = int(s)\r\n if a == \"+\":\r\n x += s\r\n else:\r\n if x - s >= 0:\r\n x-=s\r\n else:\r\n cnt += 1\r\n\r\nprint(x,cnt)", "n, x = map(int, input().split())\r\n\r\ndk = 0\r\nfor _ in range(n):\r\n per = int(\"\".join(input().split()))\r\n if per >= 0:\r\n x += per\r\n else:\r\n if x >= abs(per):\r\n x -= abs(per)\r\n else:\r\n dk += 1\r\n # print(per, x, dk)\r\nprint(x, dk)\r\n ", "[n,x]=list(map(int,input().split()))\r\ncount=0\r\nwhile n!=0:\r\n [s,d]=list(map(str,input().split()))\r\n if s=='+':\r\n x+=int(d)\r\n else:\r\n if int(d)>x:\r\n count+=1\r\n else:\r\n x-=int(d)\r\n n-=1\r\nprint(str(x)+\" \"+str(count))", "n, x = list(map(int, input().split()))\r\nsad = 0\r\nfor _ in range(n):\r\n t, y = input().split()\r\n y = int(y)\r\n if t == '+':\r\n x += y\r\n else:\r\n if y > x:\r\n sad += 1\r\n else:\r\n x -= y\r\nprint(x, sad)\r\n", "def PacksAndChildren(count,initial,list_comings):\r\n packs_left=initial\r\n distressed=0\r\n for i in range(count):\r\n if(list_comings[i][0]=='+'):\r\n packs_left+=int(list_comings[i][1])\r\n elif(list_comings[i][0]=='-'):\r\n if(int(list_comings[i][1])>packs_left):\r\n distressed+=1\r\n else:\r\n packs_left-=int(list_comings[i][1])\r\n print(str(packs_left)+' '+str(distressed))\r\n\r\ndef main():\r\n inp=list(map(int,input().strip().split()))\r\n l=[]\r\n for i in range(inp[0]):\r\n l.append(list(input().strip().split()))\r\n PacksAndChildren(inp[0],inp[1],l)\r\n\r\nif __name__==\"__main__\":\r\n main()\r\n", "n,x = map(int,input().split())\r\nm = 0\r\nfor _ in range(n):\r\n b, c = input().split()\r\n if b == \"+\":\r\n x+=int(c)\r\n elif b == \"-\":\r\n if int(c) > x :\r\n m += 1\r\n else :\r\n x-=int(c)\r\nprint(x,m)", "n,x = map(int, input().split())\ncount = 0\nfor _ in range(n):\n sign, d = input().split()\n d = int(d)\n if sign == \"+\":\n x += d\n elif x >= d:\n x -= d\n else:\n count += 1\nprint(x, count)\n", "n, x = map(int, input().split())\nunhappy = 0\n\nwhile n:\n arr = input().split()\n s, d = arr[0], int(arr[1])\n \n if s == '+':\n x += d\n else:\n if x < d:\n unhappy += 1\n else:\n x -= d\n n -= 1\n\nprint(x, unhappy)", "n,x=map(int,input().split())\nl=[] \nl.append(x)\nc=0\nfor i in range(n):\n a,b = map(str, input().split())\n b=int(b)\n if a=='+':\n l.append(b)\n else:\n if sum(l)>=b:\n l.append(-b)\n else:\n c+=1 \n \nprint(sum(l),c)\n\t\t\t \t\t\t \t \t \t\t\t\t \t \t\t", "n, x = map(int, input().split())\r\ncount = 0\r\nfor _ in range(n):\r\n command, d = input().split()\r\n d = int(d)\r\n if command == '+':\r\n x += d\r\n else:\r\n if x < d:\r\n count += 1\r\n else:\r\n x -= d\r\nprint(x, count)", "n,x = map(int, input().split())\r\n\r\nans = 0\r\nwhile n >0:\r\n n-=1\r\n line = input().split()\r\n if line[0] =='-':\r\n if int(line[1]) > x:\r\n ans+=1\r\n else:\r\n x-=int(line[1])\r\n else:\r\n x+=int(line[1])\r\n\r\nprint(x, ans)", "n, x = map(int, input().split())\r\ndistressed=0\r\nwhile n>0:\r\n n-=1\r\n sign, amount = input().split(' ')\r\n amount = int(amount)\r\n if sign == '+':\r\n x += amount\r\n else:\r\n if x<amount:\r\n distressed+=1\r\n else:\r\n x-=amount\r\n\r\nprint(x, distressed)\r\n", "n,x=input().split()\r\nn,x=int(n),int(x)\r\ndi=0\r\nfor i in range(n):\r\n s=str(input())\r\n c=s[0];\r\n d=int(s[2:])\r\n if c=='+':\r\n x+=d\r\n elif c=='-':\r\n if d>x:\r\n di+=1\r\n else:\r\n x-=d\r\nprint(x,di)", "n, x = map(int, input().split())\r\ncount = 0\r\ng = []\r\n\r\nfor k in range(n):\r\n i, d = map(str, input().split())\r\n if i == \"+\":\r\n d = int(d)\r\n x += d\r\n else:\r\n d = int(d)\r\n if x >= d:\r\n x = x - d\r\n else:\r\n count += 1\r\n\r\nprint(x, count)\r\n", "n ,x = list(map(int,input().split()))\r\nnum_of_lefter = 0\r\n\r\n\r\nfor _ in range(n):\r\n operator , amount = input().split()\r\n if operator == \"+\":\r\n x += int(amount)\r\n elif x >= int(amount):\r\n x -= int(amount)\r\n else :\r\n num_of_lefter += 1\r\nprint(x,num_of_lefter) ", "n ,x = list(map(int, input().split()))\r\nans = 0\r\nwhile (n):\r\n n -= 1\r\n trans = input()\r\n\r\n if trans[0] == \"+\":\r\n x += int(trans[2:])\r\n else:\r\n if x - int(trans[2:]) >= 0:\r\n x -= int(trans[2:])\r\n else:\r\n ans += 1\r\n\r\nprint(str(x) + \" \" + str(ans))", "n,x=map(int,input().split())\r\nchild=0\r\nwhile n>0:\r\n need=input().split()\r\n if need[0]=='+':\r\n x+=int(need[-1])\r\n else:\r\n if int(need[-1])<=x:\r\n x-=int(need[-1])\r\n else:\r\n child+=1\r\n n-=1 \r\nprint(x,child) ", "n ,m = map(int , input().split())\r\nd = 0\r\nfor i in range(n):\r\n c , x = input().split()\r\n x = int(x)\r\n if c == '+':\r\n m+=x\r\n else :\r\n if m < x :\r\n d+=1\r\n else :\r\n m-=x\r\nprint(m ,' ',d)", "distressed = 0\r\n\r\nn, x = map(int, input().split())\r\nfor i in range(n):\r\n oper, num1 = input().split()\r\n num = int(num1)\r\n if oper == '+':\r\n x += num\r\n elif oper == '-':\r\n if (x - num) < 0:\r\n distressed += 1\r\n else:\r\n x -= num\r\n\r\nprint(x, distressed)", "amount_of_people_in_the_queue, amount_of_remaining_ice_cream_packs = map(int, input().split())\nqtt_of_distress_kids = 0\nwhile amount_of_people_in_the_queue > 0:\n amount_of_people_in_the_queue -= 1\n action, amount_of_ice_cream_packs = input().split()\n if action == '+':\n amount_of_remaining_ice_cream_packs += int(amount_of_ice_cream_packs)\n elif int(amount_of_ice_cream_packs) <= amount_of_remaining_ice_cream_packs:\n amount_of_remaining_ice_cream_packs -= int(amount_of_ice_cream_packs)\n else:\n qtt_of_distress_kids += 1\nprint(amount_of_remaining_ice_cream_packs, qtt_of_distress_kids)\n", "if __name__ == '__main__':\r\n ll = input().split()\r\n t = int(ll[0])\r\n x = int(ll[1])\r\n count = 0\r\n\r\n while t > 0:\r\n t -= 1\r\n ll = input().split()\r\n c = ll[0]\r\n p = int(ll[1])\r\n if c == '+':\r\n x += p\r\n elif x-p >= 0:\r\n x -= p\r\n else:\r\n count += 1\r\n print(x, count)\r\n\r\n\r\n", "import sys\r\nn, x = map(int, sys.stdin.readline().split())\r\nc = 0\r\nfor i in range(n):\r\n sign, value = sys.stdin.readline().split()\r\n value = int(value)\r\n if sign == '+':\r\n x += value\r\n else:\r\n if x < value:\r\n c += 1\r\n else:\r\n x -= value\r\n\r\nprint(x, c)", "'''\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,x=map(int,input().split())\nc=0\nfor _ in range(n):\n a,b=input().split()\n if a=='+':\n x+=int(b)\n else:\n if x>=int(b):\n x-=int(b)\n else:\n c+=1\nprint(x,c) \n ", "#https://codeforces.com/problemset/problem/686/A\r\n\r\n(n, x) = (int(x) for x in input().split())\r\npacks, answer = int(x), 0\r\nwhile n > 0:\r\n (symbol, amount) = (x for x in input().split())\r\n if(symbol == \"+\"):\r\n packs += int(amount)\r\n else:\r\n if(packs - int(amount) >= 0):\r\n packs -= int(amount)\r\n else:\r\n answer += 1\r\n n -=1\r\nprint(str(packs) + \" \" + str(answer))", "n,x=map(int,input().split())\r\nd=0\r\nfor i in range(n):\r\n am,c=input().split()\r\n if(am=='+'):\r\n x+=int(c)\r\n else:\r\n if(x>=int(c)):\r\n x-=int(c)\r\n else:\r\n d+=1\r\nprint(x,end=\" \")\r\nprint(d)", "n,x=map(int,input().split())\r\nc=0\r\nfor i in range(n):\r\n a,b=map(str,input().split())\r\n if(a=='+'):\r\n x=x+int(b)\r\n elif(a=='-'):\r\n if(x<int(b)):\r\n c=c+1\r\n else:\r\n x=x-int(b)\r\nprint(x,c)", "from re import S\r\n\r\n\r\nif __name__ == '__main__':\r\n n, x = [int(i) for i in input().split(' ')]\r\n distressed = 0\r\n for i in range(n):\r\n current = int(input().replace(\" \", \"\"))\r\n if current > 0:\r\n x += current\r\n if current < 0:\r\n if x >= abs(current):\r\n x += current\r\n else:\r\n distressed += 1\r\n print(x, distressed)\r\n", "x = input().split(\" \")\r\nsum = int(x[1])\r\nd = 0\r\nfor i in range(int(x[0])):\r\n n = int(input().replace(\" \", \"\"))\r\n if (sum + n) >= 0:\r\n sum += n\r\n else:\r\n d += 1\r\n\r\nprint(sum, d)", "n,x = map(int,input().split())\r\ncnt=0\r\nfor i in range (n):\r\n c,cur = input().split()\r\n cur = int(cur)\r\n if c == \"+\":\r\n x+=cur\r\n elif x >= cur :\r\n x -=cur\r\n else :\r\n cnt+=1\r\nprint(x,cnt)", "user_input = input()\r\n\r\ninput_list = user_input.split(\" \")\r\n\r\nn = int(input_list[0])\r\n\r\nnum_of_icecream = int( input_list[1])\r\n\r\nqueue = []\r\n\r\nstressed_kids = 0\r\n\r\nfor i in range(n):\r\n person = input()\r\n person_type = person.split(\" \")\r\n if person_type[0] == '-':\r\n queue.append(int(person_type[1])*-1)\r\n else:\r\n queue.append(int(person_type[1]))\r\n\r\n\r\nfor customer in queue:\r\n if num_of_icecream + customer < 0:\r\n stressed_kids += 1\r\n else:\r\n num_of_icecream += customer\r\n\r\nprint(num_of_icecream,stressed_kids)", "\r\nn, x = map(int, input().split())\r\n\r\nice_cream_left = x\r\ndistressed_kids = 0\r\nfor _ in range(n):\r\n action, d = input().split()\r\n d = int(d)\r\n\r\n if action == '+':\r\n ice_cream_left += d\r\n else:\r\n if d <= ice_cream_left:\r\n ice_cream_left -= d\r\n else:\r\n distressed_kids += 1\r\nprint(ice_cream_left, distressed_kids)\r\n", "# t = eval(input())\r\nt,s = map(int,input().split())\r\nm,n = 0,0\r\nwhile t > 0:\r\n \r\n \r\n \r\n f,v = input().split()\r\n v = int(v)\r\n \r\n if f == '+':\r\n s += v\r\n # m += 1\r\n else:\r\n if s >= v:\r\n s -= v\r\n # m += 1\r\n else:\r\n n += 1\r\n \r\n \r\n # print(s)\r\n \r\n \r\n \r\n \r\n t -= 1\r\n \r\nprint(s,n)", "n,k=map(int,input().split())\r\nc=0\r\nfor i in range(n):\r\n s=list(map(str,input().split()))\r\n if(s[0]=='+'):\r\n k=k+int(s[1])\r\n else:\r\n if(int(s[1])<=k):\r\n k=k-int(s[1])\r\n else:\r\n c+=1\r\nprint(k,c)", "import sys\r\ninput = sys.stdin.readline\r\n\r\nt,k=map(int, input().split())\r\nd = 0\r\nfor _ in range(t):\r\n s,n = input().split()\r\n n = int(n)\r\n\r\n if s == '-':\r\n if k < n:\r\n d += 1\r\n else:\r\n k -= n\r\n else:\r\n k += n\r\nprint(k, d)", "n,x=map(int,input().split())\r\nstress=0\r\nfor _ in range(n):\r\n op,d=input().split()\r\n d=int(d)\r\n if op =='+':\r\n x+=d\r\n elif d<=x:\r\n x-=d\r\n else:\r\n stress+=1\r\nprint(x,stress)\r\n", "n, x = [int(x) for x in input().split()]\r\nice_cream_left, kids_left_distressed = x, 0\r\nfor _ in range(n):\r\n s = input().split()\r\n d = int(s[1])*(-1 if s[0] == '-' else 1)\r\n if ice_cream_left+d < 0:\r\n kids_left_distressed += 1 \r\n else: \r\n ice_cream_left += d\r\nprint(f'{ice_cream_left} {kids_left_distressed}')", "n, initial = map(int, input().split())\r\nkids = 0\r\n\r\nfor _ in range(n):\r\n x = list(input().split())\r\n znak = x[0]\r\n num = int(x[1])\r\n if znak == \"+\":\r\n initial += num\r\n else:\r\n if num <= initial:\r\n initial -= num\r\n else:\r\n kids += 1\r\n \r\nprint(initial, kids)", "t,m = map(int,input().split())\r\nc = []\r\nfor _ in range(t):\r\n a,b = input().split()\r\n if a == \"-\":c.append(-int(b))\r\n else: c.append(int(b))\r\ns = 0\r\nfor i in range(len(c)):\r\n if c[i] < 0:\r\n if m + c[i] < 0:\r\n s+=1\r\n else: \r\n m+=c[i]\r\n else:\r\n m+=c[i]\r\nprint(m,s)", "a, b = map(int, input().split())\r\nt, c = b, 0\r\nfor i in range(a):\r\n s = input().split()\r\n q, w = s[0], int(s[1])\r\n if q == '+':\r\n t += w\r\n if q == '-':\r\n if w <= t:\r\n t -= w\r\n else:\r\n c += 1\r\nprint (t, c)", "t, x = map(int, input().split())\r\ncnt = 0\r\nfor _ in range(t):\r\n o, n = input().split()\r\n n = int(n)\r\n if o == \"-\":\r\n if x-n < 0: cnt += 1\r\n else: x -= n\r\n else: x += n\r\nprint(x, cnt)", "n, x = [int(j) for j in input().split()]\r\ncount = 0\r\nfor j in range(n):\r\n symbol, val = [str(j) for j in input().split()]\r\n val = int(val)\r\n if symbol == '+':\r\n x += val\r\n else:\r\n if x >= val:\r\n x -= val\r\n else:\r\n count += 1\r\nprint(x, count)\r\n", "n,x = map(int,input().split())\r\ncount = 0\r\nfor i in range(n):\r\n s = input()\r\n a=int(s[1:])\r\n if s[0] == \"+\":\r\n x+=a\r\n else:\r\n if x<a:\r\n count+=1\r\n else:\r\n x-=a\r\nprint(x,count)", "s=input().split(\" \")\r\npeople=int(s[0])\r\ninitial_pack=int(s[1])\r\n\r\nkid=0\r\nfor x in range(people):\r\n lis=[x for x in input().split(\" \")]\r\n if(lis[0]=='+'):\r\n initial_pack=initial_pack+int(lis[1])\r\n else: \r\n if(int(lis[1])>initial_pack):\r\n kid+=1\r\n\r\n else:\r\n initial_pack=initial_pack-int(lis[1])\r\n\r\n\r\nprint(f\"{initial_pack} {kid}\")", "#Strings always win!\r\nQ = input().split()\r\n(Q1,Q2)= (int(Q[0]),int(Q[1]))\r\nW= []\r\nfor q in range(Q1):\r\n W.append(input())\r\n\r\nice_creams_left = Q2\r\ndistressed_childs = 0\r\n\r\nfor i in range(Q1):\r\n\r\n if W[i][0]=='+':\r\n ice_creams_left += int(W[i][0]+W[i][2:])\r\n else:\r\n if int(W[i][2:])<= ice_creams_left:\r\n ice_creams_left -= int(W[i][2:])\r\n else:\r\n distressed_childs +=1\r\n\r\nprint(ice_creams_left,end = ' ')\r\nprint(distressed_childs,end = '')", "n, x = [int(i) for i in input().split()]\r\nangry = 0\r\n\r\nfor i in range(n):\r\n a, b = [str(j) for j in input().split()]\r\n if a == '+':\r\n x += int(b)\r\n else:\r\n if x >= int(b):\r\n x -= int(b)\r\n else:\r\n angry += 1\r\n\r\nprint(x, angry)\r\n", "n,x = input().split()\r\nn = int(n)\r\nx = int(x)\r\nc = 0\r\nfor i in range(1,n+1):\r\n a,d = input().split()\r\n d = int(d)\r\n if a == \"+\":\r\n x += d\r\n elif a == \"-\":\r\n if x >= d:\r\n x -= d\r\n else:\r\n c += 1\r\nprint(x,c,sep = \" \")\r\n", "n,x = input().split()\nn=int(n) ; x = int(x)\ny = 0\nfor i in range (n):\n a,b = input().split()\n b=int(b)\n if a == \"+\":\n x += b\n elif b > x :\n y+=1\n else:\n x-=b\nprint(x,y)\n\t \t\t\t\t \t\t \t\t\t \t \t\t\t \t \t", "n = input().split(' ')\r\nx = int(n[1])\r\nn = int(n[0])\r\nlst = []\r\nchild = 0\r\nfor i in range(n):\r\n y = input().split(' ')\r\n if y[0] == '+':\r\n x = x + int(y[1])\r\n elif y[0] == '-':\r\n if int(y[1]) > x:\r\n child = child + 1\r\n else:\r\n x = x - (int(y[1]))\r\n\r\nprint(x , child)", "if __name__ == '__main__':\n n, x = list(map(int, input().split()))\n d_kids = 0\n for i in range(n):\n sign, val = input().split()\n if sign == '+':\n x += int(val)\n else:\n if x >= int(val):\n x -= int(val)\n else:\n d_kids += 1\n\n print(x, d_kids)", "k,r =map(int,(input().split())) \r\nchild =0\r\n\r\nfor i in range(k):\r\n sign,amount = map(str,(input().split()))\r\n amount = int(amount)\r\n if(sign == '+'):\r\n r=r+amount\r\n if(sign == '-'):\r\n if(r-amount < 0):\r\n child = child+1\r\n else:\r\n r=r-amount\r\n\r\n\r\nprint(r , child)", "a,b=map(int,input().split())\r\np=0\r\nfor i in range(a):\r\n l=list(input().split())\r\n if l[0]=='+':\r\n b=b+int(l[1])\r\n elif l[0]=='-':\r\n if b>=int(l[1]):\r\n b=b-int(l[1])\r\n else:\r\n p=p+1\r\nprint(b,end=\" \")\r\nprint(p)", "n, x = list(map(int, input().split()))\r\n \r\nbad = 0\r\n \r\nfor i in range(n):\r\n\tl = input().split()\r\n\tcmd, d = l\r\n\td = int(d)\r\n\tif cmd == '+':\r\n\t\tx += d\r\n\telse:\r\n\t\tif x >= d:\r\n\t\t\tx -= d\r\n\t\telse:\r\n\t\t\tbad += 1\r\n \r\nprint(x, bad)", "l=list(map(int,input().split()))\r\nn=l[0]\r\na=l[1]\r\nc=0\r\nfor i in range(n):\r\n b=input().split()\r\n if(b[0]=='+'):\r\n a+=int(b[1])\r\n else:\r\n if(a-int(b[1])>=0):\r\n a-=int(b[1])\r\n else:\r\n c+=1\r\nprint(a,c)", "a, b = map(int, input().split())\r\nc = 0\r\nfor i in range(a):\r\n q = input()\r\n if q[0] == '-' and b >= int(q[2:]):\r\n b -= int(q[2:])\r\n elif q[0] == '+':\r\n b += int(q[2:])\r\n else:\r\n c += 1\r\nprint(b, c)", "n, x = map(int, input().split())\r\ndistress = 0\r\nfor i in range(n):\r\n d = int(input().replace(' ', ''))\r\n if d < 0:\r\n if x + d >= 0:\r\n x += d\r\n else:\r\n distress += 1\r\n else:\r\n x += d\r\nprint(x, distress)\r\n", "n , x = map(int,input().split())\r\nc=0\r\nfor i in range(n):\r\n a,b=map(str,input().split(' '))\r\n if a =='+':\r\n x=x+int(b)\r\n elif a=='-':\r\n if x>=int(b):\r\n x=x-int(b)\r\n else:\r\n c+=1\r\nprint(x , c)", "data = list(map(int, input().split()))\r\nn = data[0]; x = data[1]\r\nd = 0\r\n\r\nfor i in range(n):\r\n s = input().split()\r\n if s[0] == \"+\":\r\n x += int(s[1])\r\n elif s[0] == \"-\":\r\n if int(s[1]) > x:\r\n d += 1\r\n else:\r\n x -= int(s[1])\r\n\r\nprint(x, d)", "n, x = map(int, input().split())\r\ndis =0\r\nfor i in range(n):\r\n c ,xx = map(str, input().split())\r\n xx = int(xx)\r\n if c=='+':\r\n x += xx\r\n else:\r\n if x>=xx:\r\n x-=xx\r\n else:\r\n dis += 1\r\nprint(f\"{x} {dis}\")", "n, x = (map(int, input().split()))\r\ny = 0\r\nfor _ in range(n):\r\n a, d = input().split()\r\n d = int(d)\r\n\r\n if a == \"+\":\r\n x += d\r\n elif a == \"-\":\r\n if x >= d:\r\n x -= d\r\n elif x < d:\r\n y += 1\r\n\r\nprint(x, y)", "a, b = map(int, input().split())\r\nc = 0\r\nfor i in range(a):\r\n x, y = input().split()\r\n y = int(y)\r\n if x == '+': \r\n b += y\r\n else :\r\n if b < y:\r\n c += 1\r\n else :\r\n b -= y\r\n \r\nprint(b, c)", "n,x = map(int,input().split())\r\ndistress = 0\r\nfor i in range(n):\r\n sign,value = input().split()\r\n value = int(value)\r\n if sign==\"+\":\r\n x+=value\r\n else:\r\n distress+=(x<value)\r\n x-=value*(x>=value)\r\n \r\nprint(x,distress)\r\n \r\n", "n ,x = map(int, input().split())\r\nu = 0\r\nfor i in range(n):\r\n s, d = input().split()\r\n d = int(d)\r\n if s == '+':\r\n x += d\r\n else:\r\n if d <= x:\r\n x -= d\r\n else:\r\n u += 1\r\nprint(x, u)", "laco = input(\"\")\n\ntratado = laco.split(\" \", 2)\n\nlaco = tratado[0]\npacotes = int(tratado[1])\n\ntriste = 0\n\nfor numero in range(int(laco)):\n\n rodada = input(\"\")\n\n tratado = rodada.split(\" \", 2)\n\n sinal = tratado[0]\n pacotes_teste = int(tratado[1])\n\n if (sinal == '-'):\n\n if (pacotes - pacotes_teste >= 0): \n\n pacotes -= pacotes_teste\n\n else: \n\n triste += 1\n\n else:\n\n pacotes += pacotes_teste\n\nprint(f\"{pacotes} {triste}\")\n \t\t\t \t\t \t\t\t\t \t\t \t\t\t\t \t", "from sys import stdin\r\npeople, packs = [int(x) for x in stdin.readline().strip().split(\" \")]\r\ndistressed = 0\r\nfor t in range(people):\r\n client = stdin.readline().strip().split(\" \")\r\n if client[0] == \"+\":\r\n packs += int(client[1])\r\n elif packs - int(client[1]) >= 0:\r\n packs -= int(client[1])\r\n else:\r\n distressed += 1\r\nprint(f'{packs} {distressed}')", "n,x = map(int,input().split())\r\ncnt = 0\r\nfor i in range(n):\r\n s = list(input().split())\r\n if s[0] == '+':\r\n x += int(s[1])\r\n else:\r\n if x < int(s[1]):\r\n cnt += 1\r\n else:\r\n x -= int(s[1])\r\nprint(x,cnt)", "n,x = map(int, input().split())\r\ndistressed_kids = 0\r\nfor i in range(n):\r\n s1,s2 = map(str, input().split())\r\n if s1 == \"+\":\r\n x = x + int(s2)\r\n else:\r\n if int(s2)>x:\r\n distressed_kids = distressed_kids + 1\r\n else:\r\n x = x - int(s2)\r\nprint(x, distressed_kids)", "x,y=map(int,input().split())\r\nc=0\r\nfor i in range(x) :\r\n a,b=map(str,input().split())\r\n if a=='+': y+=int(b)\r\n if a=='-':\r\n if int(b)>y:c+=1\r\n else : y-=int(b)\r\nprint(y,end=\" \");print(c)", "from sys import stdin, stdout\n\nn, x = stdin.readline().split()\nn = int(n)\nx = int(x)\ncount = 0\nfor i in range(0, n):\n query = stdin.readline().split()\n query[1] = int(query[1])\n if query[0] == \"+\":\n x += int(query[1])\n elif query[0] == \"-\":\n if query[1] <= x:\n x -= query[1]\n else:\n count += 1\nstdout.write(str(x) + \" \")\nstdout.write(str(count))\n\t\t \t\t\t \t \t \t\t \t\t \t", "a,b = map(int,input().split())\r\nk=0\r\nfor i in range(a):\r\n o,c = input().split()\r\n if(o == \"+\"):\r\n b = b+int(c)\r\n elif (o == '-'):\r\n if(b<int(c)):\r\n k+=1\r\n else:\r\n b = b-int(c)\r\nprint(b,k)", "a, b = map(int, input().split())\r\nc = 0\r\nfor i in range(a):\r\n arr = list(map(str, input().split()))\r\n if arr[0] == \"+\":\r\n b += int(arr[1])\r\n else:\r\n if int(arr[1]) <= b:\r\n b -= int(arr[1])\r\n else:\r\n c+= 1\r\nprint(b,c)", "import sys\r\nm,n=input().split()\r\nd=int(n)\r\ne=int(m)\r\nc=0\r\ni=0\r\nfor i in range(0,e):\r\n x=input()\r\n x=x.replace(\" \",\"\")\r\n if x[0]=='+':\r\n d=d+int(x)\r\n else:\r\n o=d+int(x)\r\n if o<0:\r\n c+=1\r\n else:\r\n d=o\r\nprint(d,c) \r\n\r\n", "n,d=[int(i) for i in input().split()]\r\nc=0\r\nfor i in range(n):\r\n s=input()\r\n if s[0]=='+':\r\n d=d+int(s[1:])\r\n else:\r\n if int(s[1:])<=d:\r\n d=d-int(s[1:])\r\n else:\r\n c+=1\r\nprint(d,c)", "n,m=map(int,input().split())\r\nc=0\r\nfor z in range(n):\r\n a,b=map(str,input().split())\r\n #a=list(map(int,input().split()))\r\n if(a==\"+\"):\r\n m+=int(b)\r\n else:\r\n if(int(b)<=m):\r\n m=m-int(b)\r\n else:\r\n c+=1\r\nprint(m,c)\r\n", "n, x = list(map(int, input().split()))\r\n\r\nsad = 0\r\n\r\nfor i in range(n):\r\n znak, kolvo = input().split()\r\n kolvo = int(kolvo)\r\n\r\n if znak == '+':\r\n x += kolvo\r\n elif znak == '-':\r\n if x >= kolvo:\r\n x -= kolvo\r\n else:\r\n sad += 1\r\n \r\nprint(x, sad)", "# q the number of people\n# s chocolate bars they have\nq,s = map(int,input().split())\nsad = 0\nfor i in range(0,q):\n sign,amount = input().split()\n amount = int(amount)\n if sign == '+':\n s = s + amount\n elif sign == '-':\n if amount <= s:\n s = s - amount\n else:\n sad = sad + 1\nprint(s,sad)\n \t \t\t\t \t \t \t \t\t\t \t\t", "n, x = input().split()\r\nn, x = int(n), int(x)\r\ns=0\r\nfor i in range(n):\r\n\tch, num = input().split()\r\n\tnum = int(num)\r\n\tif ch == '+': x+=num\r\n\telse:\r\n\t\tif x < num:\r\n\t\t\ts += 1\r\n\t\telse:\r\n\t\t\tx -= num\r\nprint(x,s)", "a,b=(map(int,input().split()))\r\nx=0\r\nfor i in range(a):\r\n c,d=map(str,input().split())\r\n d=int(d)\r\n if(c=='+'):\r\n b+=d\r\n elif(c=='-'):\r\n if(b<d):\r\n x+=1\r\n else:\r\n b-=d\r\nprint('{} {}'.format(b,x))", "people, packs = input().split()\r\npacks = int(packs)\r\ndistress = 0\r\nfor _ in range(int(people)):\r\n person = input()\r\n symbol = person[0]\r\n amount = int(person[2:])\r\n if symbol==\"+\":\r\n packs+=amount\r\n else:\r\n if amount>packs:\r\n distress+=1\r\n else:\r\n packs-=amount\r\nprint(packs,distress)", "n,x=map(int,input().split())\r\nd=0\r\nfor _ in range(n):\r\n s,m=map(str,input().split(' '))\r\n m=int(m)\r\n if s=='+' : x+=m\r\n else : \r\n if m<=x : x-=m\r\n else : d+=1\r\nprint(x,d)", "n,k=map(int,input().split())\r\ncnt=0\r\nfor i in range(n):\r\n c,x=input().split()\r\n x=int(x)\r\n if c=='+':k+=x\r\n else:\r\n if(k>=x):k-=x\r\n elif k<x:cnt+=1\r\nprint(k,cnt)", "n, x = map(int, input().split())\r\nsad = 0\r\n\r\nfor i in range(n):\r\n symbol, d = input(). split()\r\n d = int(d)\r\n if symbol == '+':\r\n x += d\r\n else:\r\n if x < d:\r\n sad += 1\r\n else:\r\n x -= d\r\n\r\nprint(x, sad)\r\n", "n,x=map(int,input().split())\r\nk=0\r\nfor _ in range(n):\r\n o,d=input().split()\r\n d=int(d)\r\n if o==\"+\":\r\n x=x+d\r\n else:\r\n if d<=x:\r\n x=x-d\r\n else:\r\n k=k+1\r\n \r\nprint(x,k)\r\n", "str0 = [int(i) for i in input().split()]\r\nlist0 = []\r\nfor i in range(str0[0]):\r\n list0.append(input().split())\r\nicecreams = str0[1]\r\ncounter = 0\r\nfor i in list0:\r\n if i[0] == \"+\":\r\n icecreams += int(i[1])\r\n else:\r\n if int(i[1]) <= icecreams:\r\n icecreams -= int(i[1])\r\n else:\r\n counter += 1\r\nprint(icecreams, counter)", "n, x = [int(i) for i in input().split()]\r\nsad = 0\r\nd = 0\r\no = ''\r\nfor i in range(n):\r\n o, d = input().split()\r\n d = int(d)\r\n if o == '-':\r\n if x >= d: \r\n x -= d\r\n else:\r\n sad += 1\r\n if o == \"+\":\r\n x += d\r\n \r\nprint(x, sad)\r\n \r\n \r\n", "n, x = map(int, input().split())\r\n\r\nremaining_ice_cream = x\r\nsad_children = 0\r\n\r\nfor i in range(n):\r\n op, d = input().split()\r\n d = int(d)\r\n if op == '+':\r\n remaining_ice_cream += d\r\n else:\r\n if remaining_ice_cream >= d:\r\n remaining_ice_cream -= d\r\n else:\r\n sad_children += 1\r\n\r\nprint(remaining_ice_cream, sad_children)\r\n", "n, x = map(int, input().split())\r\ntot, d = x, 0\r\nfor i in range(n):\r\n p = tuple(input().split())\r\n if p[0] == '+':\r\n tot += int(p[1])\r\n else:\r\n if tot >= int(p[1]):\r\n tot -= int(p[1])\r\n else:\r\n d += 1\r\n\r\nprint(tot, d)", "n,x=map(int,input().split(' '))\r\nc=0\r\nwhile n:\r\n a,b=map(str,input().split(' '))\r\n if a=='+':\r\n x+=int(b)\r\n else:\r\n if x>=int(b):\r\n x-=int(b)\r\n else:\r\n c+=1\r\n n-=1\r\nprint(x,c)\r\n", "c=0\r\nn,x=[int(i)for i in input().split()]\r\nfor i in range(n):\r\n d,d2= input().split()\r\n if '+' == d:\r\n x=x+int(d2)\r\n elif '-' == d:\r\n if x<int(d2):\r\n c=c+1\r\n elif x>=int(d2):\r\n x=x-int(d2)\r\nprint(x,c)", "n,x = [int(s) for s in input().split()]\r\ndes=0\r\nfor iii in range(n):\r\n si,d=input().split()\r\n d=int(d)\r\n if si==\"+\":\r\n x+=d\r\n else:\r\n if x-d<0:\r\n des+=1\r\n else:\r\n x-=d\r\nprint(x,\" \",des)", "n, x = map(int, input().split())\r\n\r\ncorns_left , cry_child = x , 0\r\nfor i in range(n):\r\n c , d = input().split()\r\n d = int(d)\r\n \r\n if c == '+':\r\n corns_left += d\r\n else:\r\n if d > corns_left:\r\n cry_child += 1\r\n continue\r\n else:\r\n corns_left -= d\r\n\r\n\r\nprint(corns_left, cry_child)\r\n", "x,y=input().split(\" \")\r\nx=int(x)\r\ny=int(y)\r\nc=0\r\nfor i in range(x):\r\n m,num=input().split(\" \")\r\n if m==\"+\":\r\n y=y+int(num)\r\n \r\n elif m==\"-\" and y<int(num):\r\n c=c+1\r\n else:\r\n y=y-int(num)\r\nprint(str(y)+\" \"+str(c))", "o , p = map(int,input().split())\nleft = 0\nfor i in range (o):\n c,cur = input().split()\n cur = int(cur)\n if c == \"+\":\n p+=cur\n elif p>=cur :\n p-=cur\n else :\n left+=1\nprint(p,left)\n\n \t \t\t\t\t \t \t\t \t \t \t \t \t\t \t \t", "n , x = input().split()\r\nn=int(n)\r\nx=int(x)\r\ndistress= 0 \r\nfor i in range(n):\r\n c,d = input().split()\r\n d=int(d)\r\n if c == '+':\r\n x += d\r\n if c == '-':\r\n if d > x :\r\n distress +=1\r\n else:\r\n x -= d\r\n\r\nprint(x,distress)\r\n\r\n \r\n ", "n,x = input().split()\r\nn,x = int(n),int(x)\r\nsad_child = 0\r\nfor i in range(n):\r\n sign,d = input().split()\r\n d= int(d)\r\n if sign == '+' :\r\n x+=d\r\n else :\r\n if d > x :\r\n sad_child += 1\r\n else :\r\n x -= d \r\nprint(x,sad_child)", "n , p = map(int,input().split(' ')) \r\nl = []\r\nc = 0 \r\nfor i in range(0,n) : \r\n v = (input()) \r\n l.append(v) \r\nfor k in l : \r\n if k[0] == '+' : \r\n p += int(k[2:len(k)]) \r\n else : \r\n if p < int(k[2:len(k)]) :\r\n c+=1 \r\n else : \r\n p -= int(k[2:len(k)])\r\n \r\nprint(p,'',c)", "z=list(map(int,input().split()))\r\nd=0\r\nfor i in range(z[0]):\r\n x=input().split(\" \")\r\n if x[0]==\"+\":\r\n z[1]+=int(x[1])\r\n else:\r\n if z[1]<int(x[1]):\r\n d+=1\r\n else:\r\n z[1]-=int(x[1])\r\n\r\n\r\nprint(str(z[1])+\" \"+str(d))\r\n\r\n\r\n", "n, x = map(int, input().split())\r\n\r\n\r\nc = 0\r\nfor _ in range(n):\r\n s, v = input().split()\r\n\r\n if s == '-':\r\n x -= int(v)\r\n else:\r\n x += int(v)\r\n\r\n if x < 0:\r\n c += 1\r\n x += int(v)\r\n\r\nprint(x, c)\r\n", "n, x = map(int,input().split(' '))\r\ndis = 0\r\nfor _ in range(n):\r\n op, c = input().split(' ')\r\n if op=='-':\r\n if x-int(c)>=0:\r\n x-=int(c)\r\n else:\r\n dis+=1\r\n else:\r\n x+=int(c)\r\nprint(x,dis)", "n,x = map(int,input().split())\r\ncount = 0\r\nfor i in range(n):\r\n c,d=input().split()\r\n if c==\"+\":\r\n x+=int(d)\r\n elif c==\"-\":\r\n if x-int(d) < 0:\r\n count+=1\r\n else:\r\n x=x-int(d)\r\nprint(x,count)\r\n ", "n,x=map(int,input().split())\r\na=0\r\n\r\nfor i in range(n):\r\n q,w=input().split()\r\n w=int(w)\r\n if(q=='+'):\r\n x+=w\r\n else:\r\n if(x>=w):\r\n x-=w\r\n else:\r\n a+=1\r\n\r\nprint(x,a)\r\n", "a,b=map(int,input().split())\r\nv=b\r\nc=0\r\nfor _ in range(a):\r\n x=input()\r\n if x[0]==\"+\":\r\n v+=int(x[2::])\r\n else:\r\n if v>=int(x[2::]):\r\n v-=int(x[2::])\r\n else:\r\n c+=1\r\nprint(v,c)\r\n", "N, X = map(int, input().strip().split(' '))\ndcount = 0\nfor i in range(N):\n\tsign, num = map(str, input().strip().split(' '))\n\tnum = int(num)\n\tif sign == '+':\n\t\tX += num\n\telse:\n\t\tbalance = X - num\n\t\tif balance < 0:\n\t\t\tdcount += 1\n\t\telse:\n\t\t\tX = X - num\nprint(X, dcount)\n \t \t \t\t \t \t\t\t\t \t\t\t\t\t\t\t \t\t", "n,ice = map(int, input().split())\r\nsad = 0\r\nfor i in range(n):\r\n s, x = input().split()\r\n x = int(x)\r\n if s == \"+\":\r\n ice = ice + x\r\n elif s == \"-\":\r\n if x <= ice:\r\n ice = ice - x\r\n else:\r\n sad = sad + 1\r\nprint(ice, sad)", "nx=input()\nn=int(nx.split(' ')[0])\nx=int(nx.split(' ')[1])\nq=[]\nfor i in range(n):\n\tq.append(input())\n\ndis=0\npl=x\n\nfor i in range(len(q)):\n\tcurr=q[i].split(' ')\n\tif curr[0]=='-':\n\t\tif int(curr[1])<=pl:\n\t\t\tpl=pl-int(curr[1])\n\t\telse:\n\t\t\tdis=dis+1\n\telse:\n\t\tpl=pl+int(curr[1])\n\nprint(pl,dis)", "queue, ice_cream = (int(x) for x in input().split())\r\nstep = 0\r\nsad_kids = 0\r\nwhile step < queue:\r\n\toperation, count = (int(x) if x.isdigit() == True else x for x in input().split())\r\n\tif operation == '+':\r\n\t\tice_cream += count\r\n\telse:\r\n\t\tif count <= ice_cream:\r\n\t\t\tice_cream -= count\r\n\t\telse:\r\n\t\t\tsad_kids += 1\r\n\tstep += 1\r\nprint(ice_cream, sad_kids)", "n,x=map(int,input().split());y=x;d=0\r\nfor i in range(n):\r\n s,num=input().split()\r\n num=int(num)\r\n if s==\"+\":y+=num\r\n else:\r\n if num <=y:\r\n y-=num \r\n else:\r\n d+=1\r\nprint(y,d)\r\n", "v = list(map(int , input().split()))\r\nsum = 0\r\nfor i in range(v[0]):\r\n n = list(map(str , input().split()))\r\n n[1] = int(n[1])\r\n if n[0] == \"+\":\r\n v[1] += n[1]\r\n elif n[0] == \"-\":\r\n if v[1] - n[1] < 0:\r\n sum += 1\r\n else:\r\n v[1] -= n[1]\r\nprint(v[1], sum)\r\n", "n, x = list(map(int, input().split()))\r\ncounter = 0\r\nfor i in range(n):\r\n sign, number = input().split()\r\n number = int(number)\r\n if sign == \"+\": x += number; continue\r\n if x >= number: x -= number\r\n else: counter += 1\r\nprint(x, counter)", "n, packs = map(int, input().split())\r\ndistressed = 0\r\nfor _ in range(n):\r\n query = input()\r\n if query[0] == \"+\":\r\n packs += int(query[2:])\r\n else:\r\n wanted_icecream = int(query[2:])\r\n if wanted_icecream > packs:\r\n distressed += 1\r\n else:\r\n packs -= wanted_icecream\r\n\r\nprint(packs, distressed)\r\n", "n,x=map(int, input().split())\r\ncnt=0\r\nfor __ in range(n):\r\n c,d=map(str,input().split())\r\n d=int(d)\r\n if c=='+':\r\n x+=d\r\n if c=='-':\r\n if x>=d:\r\n x-=d\r\n else:\r\n cnt+=1\r\nprint(x, cnt)", "t, n = map(int, input().split())\r\ncnt = 0\r\nfor i in range(t):\r\n c, x = map(str, input().split())\r\n if c == '+':\r\n n += int(x)\r\n else:\r\n if int(x) <= n:\r\n n -= int(x)\r\n else:\r\n cnt += 1\r\nprint(n, cnt)\r\n \r\n \r\n \r\n ", "ppll=input()\nppll=ppll.split()\nx=0\nsad=0\nnum=[]\nfor i in range(len(ppll)):\n ppll[i]=int(ppll[i])\nppl=ppll[0]\nice=ppll[1]\nfor i in range(ppl):\n y=input()\n y=y.split()\n if y[0]== \"-\":\n x=y[1]\n x=int(x)\n x=x*-1\n else:\n x=y[1]\n x=int(x)\n num.append(x)\n if num[i]<0:\n if -1*ice<=num[i]:\n ice=ice+num[i]\n else:\n sad+=1\n elif num[i]>=0:\n ice+=num[i]\n\nprint(ice,sad)", "# https://codeforces.com/contest/686/problem/A\r\n\r\nnoOfPeopleInQueue, noOfIcecreamsTheyHave = [int(x) for x in input().split(' ')]\r\n\r\nnoOfKidsGoBackDisstressed = 0\r\n\r\nfor i in range(noOfPeopleInQueue):\r\n icecreamsIncomingOrOutgoing, noOfIcecreams = input().split(' ')\r\n if icecreamsIncomingOrOutgoing == '+':\r\n noOfIcecreamsTheyHave += int(noOfIcecreams)\r\n elif icecreamsIncomingOrOutgoing == '-':\r\n if noOfIcecreamsTheyHave >= int(noOfIcecreams):\r\n noOfIcecreamsTheyHave -= int(noOfIcecreams)\r\n else:\r\n noOfKidsGoBackDisstressed += 1\r\n\r\nprint(noOfIcecreamsTheyHave, noOfKidsGoBackDisstressed)\r\n", "n, x = [int(i) for i in input().split(\" \")]\ndistress = 0\npack = x\nfor i in range(n):\n sign, count = input().split(\" \")\n if sign == \"+\":\n pack += int(count)\n elif sign == \"-\":\n if pack >= int(count):\n pack -= int(count)\n else:\n distress += 1\nprint(pack, distress)", "import sys\nimport math\n#input = sys.stdin.readline\n\nn, packs = map(int, input().split())\ndistress = 0\nfor _ in range(n):\n s = input().split()\n if s[0] == '+': packs += int(s[1])\n elif packs >= int(s[1]): packs -= int(s[1])\n else: distress += 1\nprint(packs, distress)\n", "n,x = map(int,input().split())\r\nc = 0\r\nfor i in range(n):\r\n a = input().split()\r\n if a[0] == '+':\r\n x += int(a[1])\r\n else:\r\n q = int(a[1])\r\n if q > x:\r\n c += 1\r\n else:\r\n x -= q\r\nprint(str(x) +' '+str(c))", "# https://codeforces.com/problemset/problem/686/A\r\n\r\nimport sys\r\n\r\ninp = [line.strip() for line in sys.stdin]\r\n_, x = map(int, inp[0].split())\r\nt = 0\r\n\r\nfor line in inp[1:]:\r\n op, value = line.split()\r\n if op == '+':\r\n x += int(value)\r\n else:\r\n if x >= int(value):\r\n x -= int(value)\r\n else:\r\n t += 1\r\nprint(f\"{x} {t}\")\r\n", "n,x = map(int,input().split())\r\nl = []\r\ndistress = 0\r\nfor i in range(n):\r\n sign,num = input().split(' ')\r\n if sign=='-':\r\n l.append(-int(num))\r\n else:\r\n l.append(int(num))\r\nfor i in range(len(l)):\r\n if x+l[i]<0:\r\n distress+=1\r\n continue\r\n else:\r\n x+=l[i]\r\nprint(x,distress)", "n, x = map(int, input().split())\r\nl = []\r\nl.append(x)\r\ncount = 0\r\nfor i in range(n):\r\n\ta, b = map(str, input().split())\r\n\tb = int(b)\r\n\tif a == '+':\r\n\t\tl.append(b)\r\n\telse:\r\n\t\tif sum(l) >= b:\r\n\t\t\tl.append(-b)\r\n\t\telse:\r\n\t\t\tcount += 1\r\nprint(sum(l), count)\r\n", "a, b = map(int, input().split())\r\n\r\nnums = []\r\nsign = []\r\n\r\nsum = b\r\nkids = 0\r\n\r\nfor i in range(a):\r\n s, n = map(str, input().split())\r\n if s == '+':\r\n sum += int(n)\r\n elif s == '-' and (sum - int(n)) >= 0:\r\n sum -= int(n)\r\n else: kids += 1\r\n\r\nprint(sum, kids)\r\n", "from sys import stdin\ndef input(): return stdin.readline()[:-1]\n\n\ndef solve():\n n, x = [int(x) for x in input().split()]\n ans = 0\n for _ in range(0, n):\n sign, value = input().split()\n value = int(value)\n if str(sign) == \"+\":\n x += value\n else:\n if value <= x:\n x -= value\n else:\n ans += 1\n\n return x, ans\n\n\nans = solve()\nprint(ans[0], ans[1])\n", "t, m = map(int, input().split())\r\nd =0\r\nfor _ in range(t):\r\n i = int(input().replace(' ',''))\r\n if m + i <0 and i<0:\r\n d+=1\r\n else:\r\n m+=i\r\nprint(m , d)", "d=0\r\nn,m = map(int,input().split())\r\nfor i in range(n):\r\n c , x =input().split()\r\n x = int(x)\r\n if c =='+':\r\n m+=x\r\n else :\r\n if m < x:\r\n d+=1\r\n else :\r\n m-=x\r\nprint(m,' ',d)", "def main():\r\n n, x = map(int, input().split())\r\n y = 0\r\n for i in range(n):\r\n s, d = input().split()\r\n d = int(d)\r\n if s == '+':\r\n x += d\r\n else:\r\n if d <= x:\r\n x -= d\r\n else:\r\n y += 1\r\n print(x, y)\r\n\r\n\r\nmain()\r\n", "import sys\r\n\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\nn, x = inlt()\r\n\r\nc = 0\r\nfor i in range(n):\r\n s, d = input().split(' ')\r\n d = int(d)\r\n if s == '+':\r\n x += d\r\n elif x - d >= 0:\r\n x -= d\r\n else:\r\n c += 1\r\n\r\nprint(f'{x} {c}')", "t,initial=map(int,input().split())\r\ncount=0\r\nwhile t!=0:\r\n s=input().split()\r\n a=s[0]\r\n b=int(s[1])\r\n if a==\"+\":\r\n initial+=b\r\n else:\r\n if b<=initial:\r\n initial=initial-b\r\n else:\r\n count+=1\r\n t=t-1\r\nprint(initial,count)\r\n ", "n,x = map(int,input().strip().split())\ncount = 0\nfor _ in range(n):\n lst = input().strip().split()\n if lst[0] == '+':\n x = x + int(lst[1])\n #print(x)\n elif lst[0] == '-':\n if x - int(lst[1]) >= 0:\n x = x - int(lst[1])\n #print(x)\n else:\n count += 1\nprint(x,count)\n \n \t\t\t \t\t \t\t \t \t \t\t \t\t", "# input Operation\r\nimport string\r\n\r\n\r\nn, k = list(map(int, input().split()))\r\n\r\n# output Operation\r\ncounter = 0\r\nfor i in range(n):\r\n sign, value = list(map(str, input().split()))\r\n if sign == \"+\":\r\n k += int(value)\r\n else:\r\n if k >= int(value):\r\n k -= int(value)\r\n else:\r\n counter += 1\r\n\r\nprint(k, end=' ')\r\nprint(counter)\r\n", "def solve():\r\n n,d = map(int,input().split())\r\n ans = 0\r\n for i in range(n):\r\n # print(d)\r\n op, val = input().split(\" \")\r\n if op == \"+\":\r\n d += int(val)\r\n else:\r\n if d >= int(val):\r\n d -= int(val)\r\n # print(\"d>\",d)\r\n else:\r\n ans += 1\r\n print(d , ans)\r\n# n,c = map(int,input().split())\r\n# a = int(input())\r\n# b = int(input())\r\n# c = int(input())\r\n# l = list(map(int,input().split()))\r\n# s = input()\r\n# print(solve(n,c,l))\r\nsolve()\r\n\r\n\r\n\r\n", "n, x = [int(elem) for elem in input().split()]\r\ncounter_ch, ost = 0, x\r\nfor i in range(n):\r\n s = input()\r\n sign, value = s[0], int(s[2:])\r\n if sign == '+':\r\n ost += value\r\n else:\r\n if value > ost:\r\n counter_ch+=1\r\n else:\r\n ost-= value\r\nprint(ost, counter_ch)", "# Free Ice Cream\r\n# https://codeforces.com/contest/686/problem/A\r\n#\r\n# Author: eloyhz\r\n# Date: Aug/26/2020\r\n\r\n\r\nif __name__ == '__main__':\r\n n, x = [int(x) for x in input().split()]\r\n dist = 0\r\n for _ in range(n):\r\n line = input().split()\r\n d = int(line[1])\r\n if line[0] == '+':\r\n x += d\r\n elif d <= x:\r\n x -= d\r\n else:\r\n dist += 1\r\n print(x, dist)\r\n", "n,m=map(int,input().split())\r\nc=0\r\nfor i in range(n):\r\n s=input()\r\n if(s[0]=='+'):\r\n m+=int(s[1:])\r\n else:\r\n if(m>=int(s[1:])):\r\n m-=int(s[1:])\r\n else:\r\n c+=1\r\nprint(m,c)", "n, x = list(map(int, input().split()))\r\n\r\ndistressed = 0\r\n\r\nfor i in range(n):\r\n customer_type, amount = input().split()\r\n amount = int(amount)\r\n\r\n if customer_type == '+':\r\n x += amount\r\n else:\r\n if x - amount < 0:\r\n distressed += 1\r\n else:\r\n x -= amount\r\n\r\nprint(x, distressed)", "t, n = [int(p) for p in input().split()]\r\nA = []\r\ndis = 0\r\nfor i in range (t):\r\n a = [str(p) for p in input().split()]\r\n A.append(a)\r\nfor i in range (t):\r\n inc, ice = A[i]\r\n if inc == \"+\":\r\n n += int(ice)\r\n elif inc == \"-\":\r\n if int(ice) > n:\r\n dis += 1\r\n else:\r\n n -= int(ice)\r\nprint(n, dis)", "n,x=input().split()\n\nn=int(n);x=int(x)\n\ndis = 0\n\nfor i in range(n):\n a,b=input().split()\n b=int(b)\n if a == '+':\n x+=b\n elif a == '-' and b>x:\n dis += 1\n elif a == '-' and b<=x:\n x-=b\n\nprint(x,dis)\n\t \t\t \t \t \t \t \t \t\t\t\t \t\t\t", "# URL: https://codeforces.com/problemset/problem/686/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, x = map(int, inp().split())\ns = 0\nfor _ in range(n):\n op, d = inp().split()\n d = int(d)\n if op == b'+':\n x += d\n elif x >= d:\n x -= d\n else:\n s += 1\nout(f\"{x} {s}\")\n", "n,x=list(map(int, input().split()))\r\ndistress=0\r\nfor i in range(n):\r\n query=input().split()\r\n if query[0]=='+':\r\n x+=int(query[1])\r\n else:\r\n if x>=int(query[1]):\r\n x-=int(query[1])\r\n else:\r\n distress+=1\r\nprint(x, distress)", "length=input()\r\nlength=list(map(int,length.split()))\r\nn=length[0]\r\nx=length[1]\r\nchild=0\r\nremianIce=x\r\nfor i in range(0,n):\r\n\tcase=input()\r\n\tstate=case.split()[0]\r\n\ticeCream=int(case.split()[1])\r\n\tif state==\"+\":\r\n\t\tremianIce+=iceCream\r\n\telse:\r\n\t\tif remianIce>=iceCream:\r\n\t\t\tremianIce-=iceCream\r\n\t\telse:\r\n\t\t\tchild+=1\r\nprint(str(remianIce)+\" \"+str(child))", "n,x=map(int,(input().split()))\r\npeople=list()\r\nfor _ in range(0,n):\r\n type,quantity=input().split()\r\n people.append([type,int(quantity)])\r\nic_packs=x\r\nkids=0 \r\nfor p in people:\r\n if p[0]=='+':\r\n ic_packs+=p[1]\r\n elif p[1]>ic_packs:\r\n kids+=1\r\n else:\r\n ic_packs-=p[1] \r\nprint(str(ic_packs)+\" \"+str(kids)) \r\n", "n, numberOfIceCream = input().split()\nqueue = [int(str(input()).replace(' ', '')) for _ in range(int(n))]\nresult = int(numberOfIceCream) \ndistressedKids = 0\nfor obj in queue:\n if obj < 0 :\n if abs(obj) > result:\n distressedKids +=1\n else:\n result += obj\n else:\n result += obj \n\n # if result < 0:\n # distressedKids += 1 \n\nprint(result, distressedKids)", "n, x = map(int, input().split())\r\ng = 0\r\nfor i in range(n):\r\n t, c = input().split()\r\n c = int(c)\r\n if t == '+':\r\n x += c\r\n elif c <= x:\r\n x -= c\r\n else:\r\n g += 1\r\nprint(x, g)\r\n", "n,cnt=map(int,input().split())\r\nval=0\r\nfor i in range(n):\r\n x,y=map(str,input().split())\r\n y=int(y)\r\n if(x=='+'):\r\n cnt+=y\r\n else:\r\n t=cnt-y\r\n if(t<0):\r\n val+=1\r\n else:\r\n cnt=t\r\nprint(cnt,val)\r\n", "start = input().split(' ')\r\nnumber_of_ice_creams = int(start[1])\r\nsad_kids = 0\r\nfor x in range(int(start[0])):\r\n arrive = input().split(' ')\r\n number_of = int(arrive[1])\r\n if arrive[0] == '+':\r\n number_of_ice_creams += number_of\r\n else:\r\n if number_of_ice_creams >= number_of:\r\n number_of_ice_creams -= number_of\r\n else:\r\n sad_kids += 1\r\nprint(number_of_ice_creams, sad_kids)", "n, x = map(int, input().split())\r\nzmrzka = x\r\npocet = 0\r\nfor i in range(n):\r\n a, b = map(str, input().split())\r\n if a == '+':\r\n zmrzka += int(b)\r\n else:\r\n if zmrzka - int(b) < 0:\r\n pocet += 1\r\n else:\r\n zmrzka -= int(b)\r\nprint(zmrzka, pocet)", "n,x = map(int,input().split())\r\ndis=0\r\nfor _ in range(n):\r\n a,b=map(str,input().split())\r\n if a=='+':\r\n x+=int(b)\r\n elif a=='-':\r\n if x >= int(b):\r\n x-=int(b)\r\n else:\r\n dis+=1\r\nprint(x,dis)", "count = 0\r\nn, x = input().split()\r\nfor i in range(0, int(n)):\r\n c, d = input().split()\r\n if c == \"+\":\r\n x = int(d) + int(x)\r\n elif c == \"-\":\r\n if int(x) < int(d):\r\n count += 1\r\n continue\r\n else:\r\n x = int(x) - int(d)\r\nprint(f\"{x} {count}\")", "#!/usr/bin/env python3\nimport sys\ninput = sys.stdin.readline\n\n############ ---- Input Functions, coutery of 'thekushalghosh' ---- ############\n\n\ndef inp():\n return(int(input()))\n\n\ndef inlt():\n return(list(input().split()))\n\n\ndef insr():\n s = input()\n return(list(s[:len(s)]))\n\n\ndef invr():\n return(map(int, input().split()))\n\n\nif __name__ == \"__main__\":\n n, x = invr()\n c = 0\n for i in range(n):\n visitor = inlt()\n if visitor[0] == '+':\n x += int(visitor[1])\n if visitor[0] == '-':\n if int(visitor[1]) > x:\n c += 1\n else:\n x -= int(visitor[1])\n print(str(x) + ' ' + str(c))\n", "n, x = [int(i) for i in input().split()]\r\ndistress = 0\r\nfor _ in range(n):\r\n d = input().split()\r\n if d[0] == \"+\":\r\n x += int(d[1])\r\n else:\r\n if int(d[1]) > x:\r\n distress += 1\r\n else:\r\n x -= int(d[1])\r\nprint(x, distress)", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Sat Feb 26 11:15:42 2022\r\n\r\n@author: ahlam-islam\r\n\"\"\"\r\n\r\ndata = input().split()\r\n\r\n\r\nmyList = []\r\nfor i in range(int(data[0])):\r\n inputs = input().split()\r\n myList.append(inputs)\r\n \r\ncounter = int(data[1])\r\ndistress = 0\r\nfor item in myList:\r\n if item[0] == '+':\r\n counter += int(item[1])\r\n else:\r\n if counter >= int(item[1]):\r\n counter -= int(item[1])\r\n else:\r\n distress +=1\r\n \r\nprint(counter , distress)\r\n \r\n \r\n ", "n,x=map(int,input().split())\r\nm=0\r\nfor case in range(n):\r\n d=int(''.join((input().split(' '))))\r\n if x+d<0:\r\n m+=1\r\n else:\r\n x+=d\r\nprint(x,m)", "n, x = map(int, input().split())\r\ndis = 0\r\nfor i in range(0, n):\r\n sta, num = map(str, input().split())\r\n num = int(num)\r\n # print(sta, num)\r\n if(sta == '+'):\r\n x+= num\r\n else:\r\n if(x >= num):\r\n x -= num\r\n else:\r\n dis+=1\r\nprint(x, dis)\r\n ", "def iceCreamLine(queue,currentIceCream):\r\n totalIcecream = currentIceCream\r\n unsatisfiedCustomers = 0\r\n for person in queue:\r\n if str(person[0]) == \"+\":\r\n totalIcecream += int(person[1])\r\n continue\r\n if str(person[0]) == \"-\":\r\n if totalIcecream >= int(person[1]):\r\n totalIcecream -= int(person[1])\r\n else:\r\n unsatisfiedCustomers +=1\r\n continue\r\n return[totalIcecream,unsatisfiedCustomers]\r\n\r\nnums = input().split()\r\nqueue = []\r\nfor i in range(int(nums[0])):\r\n person = input().split()\r\n queue.append(person)\r\n\r\npacket = iceCreamLine(queue,int(nums[1]))\r\nprint(str(packet[0])+\" \"+str(packet[1]))\r\n#listOfInputs = input().split()\r\n", "n,d=map(int,input().split())\r\ns=0\r\nfor i in range(n):\r\n\ta,b=map(str,input().split())\r\n\tif a=='+':\r\n\t\td+=int(b)\r\n\telse:\r\n\t\tif d-int(b)>=0:\r\n\t\t\td-=int(b)\r\n\t\telse:\r\n\t\t\ts+=1\r\nprint(d,s)\r\n\r\n\t\r\n", "n, x = list(map(int, input().split(' ')))\r\nd = 0\r\nfor i in range(n):\r\n a, b = input().split(' ')\r\n b = int(b)\r\n if a == '+':\r\n x += b\r\n elif a == '-' and b <= x:\r\n x -= b\r\n else:\r\n d += 1\r\nprint(x, d)", "n,x = map(int, input().split())\r\ndistressed = 0\r\nfor _ in range(n):\r\n op, items = input().split()\r\n packs = int(items)\r\n if op == '+':\r\n x = x + packs\r\n elif x >= packs:\r\n x -= packs\r\n else:\r\n distressed += 1\r\nprint(x, distressed)", "n,p = map(int,input().split())\ncnt2 = 0\nfor _ in range(n):\n x,y = input().split();\n y = int(y)\n if x == '+':\n p+=y\n else:\n if p >= y:\n p-=y\n else:\n cnt2+=1\nprint(p,cnt2)\n", "import sys\r\nn,x=[int(i) for i in input().split()]\r\ntot=x\r\ndist_kid=0\r\nfor _ in range(n):\r\n s=sys.stdin.readline().split()\r\n if s[0]==\"+\":\r\n tot+=int(s[1])\r\n else:\r\n if tot>=int(s[1]):\r\n tot-=int(s[1])\r\n else:\r\n dist_kid+=1\r\nprint(tot,dist_kid)", "n, ice = map(int, input().split())\r\nd = 0\r\nfor _ in range(n):\r\n s = input().split()\r\n t = int(s[1])\r\n if s[0] is '+':\r\n ice += t\r\n elif s[0] is '-' and ice >= t:\r\n ice -= t\r\n else:\r\n d += 1\r\nprint(ice, d)\r\n\r\n \r\n", "n, x = map(int, input().split())\r\ndis = 0\r\nfor _ in range(n):\r\n c, y = input().split()\r\n y = int(y)\r\n if c == \"+\":\r\n x += y\r\n elif y <= x:\r\n x -= y\r\n else:\r\n dis += 1\r\nprint(f\"{x} {dis}\")", "n,count = map(int,input().split())\nkids = 0\nfor i in range(n):\n x = input()\n x = x.replace(\" \",\"\")\n x = int(x)\n if x > 0:\n count+=x\n else:\n if count+x < 0:\n kids+=1\n else:\n count+=x\nprint(count,kids) \n", "a = list(map(int, input().split()))\r\nres = a[1]\r\ns = 0\r\nfor i in range(a[0]):\r\n j = input().split()\r\n if(j[0] == '+'):\r\n res += int(j[1])\r\n else:\r\n if(int(j[1]) > res):\r\n s += 1\r\n else:\r\n res -= int(j[1])\r\nprint(str(res) + ' ' + str(s))", "l1=[int(i) for i in input().split()]\r\nn=l1[0] #no of lines\r\nx=l1[-1] #no of icecream at the start of the day\r\nno_of_kids=0 #left in distress\r\ni=1\r\nwhile i<=n:\r\n s=input()\r\n sign=s[0]\r\n num=int(s[2:])\r\n if sign==\"+\":\r\n x=x+num\r\n else :\r\n if x>=num:\r\n x=x-num\r\n else :\r\n no_of_kids+=1\r\n i+=1\r\nprint(x,no_of_kids)", "n=input().split(\" \")\r\nice=int(n[1])\r\ndis=0\r\nfor i in range(int(n[0])):\r\n a=input()\r\n a=a.split(\" \")\r\n if(a[0]==\"-\"):\r\n if(int(a[1])<=ice):\r\n ice-=int(a[1])\r\n else:\r\n dis+=1\r\n else:\r\n ice+=int(a[1])\r\nprint(ice,dis)\r\n \r\n ", "ip=[int(i) for i in input().split()]\r\nn=ip[0]\r\nx=ip[1]\r\ns=x\r\n\r\nl=0\r\nfor i in range(n):\r\n k=input()\r\n if k[0] =='+':\r\n s+=int(k[2: ])\r\n # print(s,'saiufdkjs')\r\n else:\r\n s-=int(k[2: ])\r\n # print(s)\r\n if s<0:\r\n l+=1\r\n s+=int(k[2:])\r\nprint(s,l)\r\n", "n,m=map(int,input().split())\nc=0\nfor _ in range(n):\n\ta=input().split()\n\tif a[0]==\"+\":\n\t\tm+=int(a[1])\n\telse:\n\t\tk=int(a[1])\n\t\tif m>=k:\n\t\t\tm-=k\n\t\telse:\n\t\t\tc=c+1\nprint(m,c,sep=\" \")\n \t \t \t \t \t \t \t \t \t\t\t\t\t", "n,x=map(int,input().split())\r\nd=0\r\nfor i in range(0,n):\r\n l,s=input().split()\r\n if l=='+':\r\n x=x+int(s)\r\n else:\r\n if x<int(s):\r\n d=d+1\r\n else:\r\n x=x-int(s)\r\nprint(x,' ',d)", "n , base = map(int, input().split())\r\nt = base \r\ndistress = 0\r\nfor x in range (n):\r\n sign , amount = map(str, input().split())\r\n if sign == \"-\" and t-int(amount)>=0:\r\n t -= int(amount)\r\n elif sign == \"-\" and t-int(amount)< 0:\r\n distress +=1 \r\n \r\n elif sign == \"+\" : \r\n t+= int(amount)\r\nprint (t, distress) ", "n, x = [int(y) for y in input().split()]\r\nc = 0\r\nfor i in range(n):\r\n a, b = [m for m in input().split()]\r\n b = int(b)\r\n if a == \"+\":\r\n x += b\r\n elif x >= b:\r\n x -= b\r\n else:\r\n c += 1\r\n \r\nprint(x, c)", "n,x=map(int,input().split());k=0\r\nfor i in ' '*n:\r\n g=eval(input())\r\n j=x;x+=[0,g][x+g>=0]\r\n if x==j:k+=1\r\nprint(x,k)", "t , i = map(int,input().split())\r\nf = 0\r\nfor j in range(t):\r\n c = input().split()\r\n if c[0]=='+':\r\n s = int(c[1])\r\n else:\r\n s = - int(c[1])\r\n if i + s >= 0:\r\n i += s\r\n else:\r\n f+=1\r\n continue\r\nprint(i, end=' ')\r\nprint(f)", "n,p=map(int,input().split())\r\ndistress=0\r\nfor _ in range(n):\r\n sign,packs=input().split()\r\n #print(sign,packs)\r\n packs=int(packs)\r\n if(sign==\"+\"):\r\n p+=packs\r\n else:\r\n if(packs<=p):\r\n p-=packs\r\n else:\r\n distress+=1\r\nprint(p,distress)", "n, x = map(int, input().split())\r\nkids = 0\r\nfor i in range(n):\r\n sign, d = input().split()\r\n if sign == '+':\r\n x += int(d)\r\n else:\r\n if int(d) <= x:\r\n x -= int(d)\r\n else:\r\n kids += 1\r\nprint(x, kids)", "n,x=list(map(int,input().split()))\r\nlist1=[]\r\nlist2=[]\r\nfor i in range(n):\r\n a,b=list(map(str,input().split()))\r\n list1.append(a)\r\n list2.append(int(b))\r\nsum1=x\r\nsad=0\r\nfor x in range(len(list1)):\r\n if list1[x]==\"+\":\r\n sum1+=list2[x]\r\n elif list1[x]==\"-\" and sum1<list2[x]:\r\n sad+=1\r\n else:\r\n sum1-=list2[x]\r\nprint(sum1,sad)", "class Solver():\r\n\tdef __init__(self, test_cases):\r\n\t\ttest_cases = test_cases.split()\r\n\t\tself.test_cases = int(test_cases[0])\r\n\t\tself.value = int(test_cases[1])\r\n\t\t\r\n\tdef solve(self, case, sum):\r\n\t\tcase = case.split()\r\n\t\tif case[0] == \"+\":\r\n\t\t\treturn int(case[1])\r\n\t\tif int(case[1]) > sum:\r\n\t\t\treturn 0\r\n\t\telse:\r\n\t\t\treturn -int(case[1])\r\n\t\t\r\n\t\t\r\n\t\t\r\nif __name__ == \"__main__\":\r\n\ts = Solver(input())\r\n\tresult = s.value\r\n\tcounter = 0\r\n\tfor _ in range(s.test_cases):\r\n\t\ttemp = 0\r\n\t\ttemp = s.solve(input(), result)\r\n\t\tif temp == 0:\r\n\t\t\tcounter += 1\r\n\t\telse:\r\n\t\t\tresult += temp\r\n\tprint(result, counter)\t", "import sys\n\nimport re\nimport collections\nimport math\nimport itertools\n\n\nclass Point(object):\n\tdef __init__(self, x=0, y=0):\n\t\tself.x = x\n\t\tself.y = y\n\n\ndef function(*args):\n n, x = map(int, input().split())\n distressed = 0\n\n for _ in range(n):\n op = [e for e in input().split()]\n c = op[0]\n d = int(op[1])\n if c == '-' and x < d:\n distressed += 1\n elif c == '-' and x >= d:\n x -= d\n else:\n x+=d\n print(f'{x} {distressed}')\n\nif __name__ == '__main__':\n function()\n", "l1=list(map(int,input().split(\" \")))\r\nice=l1[1]\r\ndistress=0\r\nfor i in range(l1[0]):\r\n l2=list(map(str,input().split(\" \")))\r\n if l2[0]==\"+\":\r\n ice=ice+int(l2[1])\r\n elif l2[0]==\"-\" and int(l2[1])>ice:\r\n distress+=1\r\n elif l2[0]==\"-\" and int(l2[1])<=ice:\r\n ice-=int(l2[1])\r\nprint(ice,distress) \r\n \r\n ", "n,x=map(int,input().split());s=0\r\nfor _ in ' '*n:\r\n d=int(input().replace(' ', ''))\r\n if x+d<0:s+=1\r\n else:x+=d\r\nprint(x,s)", "n,x = map(int,input() .split())\nsad=0\nfor i in range(n):\n sign,d=input().split()\n d=int(d)\n if sign==\"+\":\n x+=d\n elif sign ==\"-\"and x < d:\n sad+=1\n else:\n x -= d\nprint(x,sad)\n \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\nsigns = [0]*n\r\nnumbers = [0]*n\r\ndistressed = 0\r\nfor i in range(n):\r\n signs[i] , numbers[i] = input().split(\" \")\r\n\r\nfor i in range(n):\r\n numbers[i] = int(numbers[i])\r\n# print(signs,numbers)\r\ni = 0 \r\nwhile i <n:\r\n if signs[i] == \"+\":\r\n x += numbers[i]\r\n # print(x)\r\n else:\r\n if numbers[i] > x:\r\n distressed += 1\r\n else:\r\n x -= numbers[i]\r\n i += 1 \r\nprint(x,distressed)\r\n\r\n", "n,x=map(int,input().split())\r\no=0\r\nfor _ in range(n):\r\n c,p=input().split()\r\n p=int(p)\r\n if c is '-' :\r\n if p>x:\r\n o+=1\r\n else:\r\n x=x-p\r\n else:\r\n x=x+p\r\nprint(x,o)\r\n\r\n", "a,b=map(int,input().split())\r\nj=0\r\nfor _ in range(a):\r\n\tc=input().split()\r\n\td = eval(f\"b {c[0]} int(c[-1])\")\r\n\tif d >= 0: b=d\r\n\telse: j+=1\r\nprint(b,j)", "n,m=map(int,input().split())\r\nd=0\r\nle=m\r\nfor i in range(n):\r\n p,q=map(str,input().split())\r\n if p==\"+\":\r\n le+=int(q)\r\n else:\r\n if le-int(q)<0:\r\n d+=1\r\n else:\r\n le-=int(q)\r\nprint(le,d)\r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n\r\n", "ev , ic =input().split()\nz3lan = 0\nev=int(ev) ; ic=int(ic)\nfor i in range(ev):\n a , b=input().split()\n b=int(b)\n if a == '+':\n ic += b\n else:\n if ic >= b:\n ic-=b\n else:\n z3lan += 1\nprint(ic , z3lan)\n \t \t\t \t \t \t \t \t \t\t \t", "n,x = [int(i) for i in input().split()]\nkid =0\nfor i in range(n):\n a,b =[i for i in input().split()]\n b = int(b)\n if a=='+':\n x = x + b\n else:\n if x>=b:\n x -= b\n else:\n kid += 1\nprint(x,kid)", "n=input()\r\nn=n.split()\r\nn[0]=int(n[0])\r\ns=int(n[1])\r\n\r\nc=0\r\nr=0\r\n\r\nfor i in range(n[0]):\r\n \r\n y=input()\r\n y=y.split()\r\n y[1]=int(y[1])\r\n \r\n if(y[0]=='+'):\r\n s=s+y[1]\r\n \r\n if (y[0]=='-'):\r\n rl=s-y[1]\r\n if rl<0:\r\n c=c+1\r\n else:\r\n s=rl\r\n \r\nprint(s ,c)\r\n ", "lst=list(map(int,input().split(\" \")))\r\nd=[]\r\nfor i in range(lst[0]):d.append(input().split(\" \"))\r\ndistress,packs=0,lst[1]\r\nfor i in range(lst[0]):\r\n if d[i][0]==\"+\":\r\n packs+=int(d[i][1])\r\n else:\r\n if packs>=int(d[i][1]):\r\n packs-=int(d[i][1])\r\n else:distress+=1\r\nprint(f\"{packs} {distress}\")", "n,x=map(int,input().split())\r\nc=0\r\nfor _ in range(n):\r\n sd=input().split()\r\n s,d=str(sd[0]),int(sd[1])\r\n if s==\"+\":x+=d\r\n if s==\"-\":\r\n if d>x:\r\n c+=1\r\n else:\r\n x-=d\r\nprint(x,c)\r\n \r\n \r\n \r\n", "n, x = map(int,input().split())\r\nans = 0\r\nfor i in range(n):\r\n s = input()\r\n d = int(s[2:])\r\n if s[0] == '+':\r\n x += d\r\n else:\r\n if x < d:\r\n ans += 1\r\n else:\r\n x -= d\r\nprint(x,ans)\r\n \r\n ", "n, x = map(int, input().split(' '))\r\nlines = [input() for _ in range(n)]\r\ndistressed = 0\r\nfor line in lines:\r\n operator, operand = line.split(' ')\r\n operand = int(operand)\r\n distressed += 1 if operator == '-' and x < operand else 0\r\n x += operand if operator == '+' else 0 if x < operand else -operand\r\nprint(x, distressed)", "n,x = map(int, input().split())\r\ndiss = 0\r\nfor i in range(n):\r\n s = input().split()\r\n if s[0] == \"+\":\r\n x += int(s[1])\r\n else:\r\n if x >= int(s[1]):\r\n x -= int(s[1])\r\n else:\r\n diss += 1\r\n \r\nprint(x, diss)", "n = input().split()\r\nkids = int(n[0])\r\ncount = int(n[1])\r\ndistressed =0\r\nfor i in range(kids):\r\n event = input().split()\r\n if event[0] == \"+\":\r\n count += int(event[1])\r\n else:\r\n if int(event[1]) > count:\r\n distressed+=1\r\n else:\r\n count -=int(event[1])\r\nprint(str(count) +\" \"+str(distressed))", "n,k=list(map(int,input().split()))\r\nd=0\r\nfor i in range(n):\r\n inp=input().split()\r\n eq=inp[0]\r\n s=int(inp[1])\r\n if eq == \"+\":\r\n k+=s\r\n elif eq==\"-\":\r\n if k>=s:\r\n k-=s\r\n else:\r\n d+=1\r\nprint(k,d)", "n, x = [int(i) for i in input().split()]\r\ndeti = 0\r\nfor i in range(n):\r\n plmi, d = [j for j in input().split()]\r\n if plmi=='+':\r\n x=x+int(d)\r\n elif plmi=='-':\r\n if int(d)>x:\r\n deti=deti+1\r\n else:\r\n x=x-int(d)\r\n\r\nprint(x, deti)\r\n \r\n", "#!/usr/bin/python3\n\nimport sys\n\nclass Input:\n \"\"\" Integer inputs \"\"\"\n @staticmethod\n def inp():\n return(int(input()))\n\n \"\"\" List inputs \"\"\"\n @staticmethod\n def inlt():\n return(list(map(int, input().split())))\n\n \"\"\" String inputs \"\"\"\n @staticmethod\n def ins():\n return(input())\n\n \"\"\" List of characters \"\"\"\n @staticmethod\n def insr():\n return(list(input()))\n\n \"\"\" Integer variable inputs \"\"\"\n @staticmethod\n def invr():\n return(map(int, input().split()))\n\nclass FreeIceCream:\n def solve(self, n, x, queue):\n gerda = 0\n for item in queue:\n a = item.split(' ')\n op = a[0]\n num = int(a[1])\n if op == '+':\n x += num\n else:\n if x >= num:\n x -= num\n else:\n gerda += 1\n print(x, gerda)\n\nif __name__ == \"__main__\":\n n, x = Input.invr()\n queue = []\n for i in range(n):\n queue.append(Input.ins())\n freeIceCream = FreeIceCream()\n freeIceCream.solve(n, x, queue)\n", "# https://codeforces.com/contest/686/problem/A\n\nl = input().split()\nn = int(l[0])\nice_cream = int(l[1])\nn_distressed = 0\n\nfor i in range(n):\n l = input().split()\n sign = l[0]\n want = int(l[1])\n if sign == '+':\n ice_cream += want\n else:\n if want > ice_cream:\n n_distressed += 1\n else:\n ice_cream -= want\n\nprint(ice_cream, n_distressed)", "n,x=map(int,input().split())\r\ns=0\r\nfor _ in range(n):\r\n z,d=input().split();d=int(d)\r\n if z=='+':x+=d\r\n else:\r\n if x>=d:x-=d\r\n else: s+=1\r\nprint(x, s)", "n,icecream = [int(j) for j in input().split()]\r\nsad = 0\r\nfor i in range(n) :\r\n sim,ctn = input().split()\r\n if sim == '+' :\r\n icecream += int(ctn)\r\n else:\r\n if int(ctn) > icecream :\r\n sad += 1\r\n else:\r\n icecream -= int(ctn)\r\n\r\nprint(icecream,sad)", "s=input().split()\r\nn=int(s[0])\r\nx=int(s[1])\r\n\r\np=x\r\ndis=0\r\nfor i in range(n):\r\n s=input().split()\r\n c=s[0]\r\n d=int(s[1])\r\n \r\n if c=='+':\r\n p+=d\r\n else:\r\n if d>p:\r\n dis+=1\r\n else:\r\n p-=d\r\n\r\nprint(p,dis)\r\n\r\n", "n,x=map(int,input().split(\" \"))\r\ndis=0\r\nwhile n>0:\r\n li=list(input().split(\" \"))\r\n i=int(li[-1])\r\n if li[0]=='+':\r\n x+=i \r\n elif li[0]=='-':\r\n if x>=i:\r\n x-=i\r\n elif x<i:\r\n dis+=1 \r\n #print(x,dis)\r\n n-=1\r\nprint(x,dis)", "n, ice_cream_pack = list(map(int, input().split()))\r\nchild_distressed = 0\r\nfor i in range(n):\r\n ind, d = input().split()\r\n if ind == '+':\r\n ice_cream_pack += int(d)\r\n else:\r\n if int(d) > ice_cream_pack:\r\n child_distressed += 1\r\n else:\r\n ice_cream_pack -= int(d)\r\nprint(ice_cream_pack, child_distressed)", "n, x = map(int, input().split())\r\n\r\nsad = 0\r\n\r\nfor _ in range(n):\r\n sign, qty = map(str, input().split())\r\n\r\n if sign == '-':\r\n if x - int(qty) >= 0:\r\n x -= int(qty)\r\n else:\r\n sad += 1\r\n else:\r\n x += int(qty)\r\n\r\nprint(x, sad)\r\n", "n , x =input().split()\nn =int(n) ; x=int(x)\nm5ad4 =0\nfor i in range(n):\n a , b = input().split()\n b=int(b)\n if a == '+':\n x+=b\n elif b>x:\n m5ad4 += 1\n else:\n x -= b\nprint(x , m5ad4)\n\t\t \t\t\t\t \t \t \t\t\t \t \t \t", "#p22\r\nn , x = [int(x) for x in input().split(\" \")]\r\ndistress = 0\r\nfor i in range(n):\r\n inn = int(input().replace(\" \" , \"\"))\r\n summ = x + inn\r\n if summ < 0:\r\n distress += 1\r\n else:\r\n x = summ\r\nprint(x ,distress)", "#\nimport sys\n\n###########\n\ndef solve():\n n, x = map(int, input().split())\n count = x\n re = 0\n for i in range(n):\n a, b = input().split()\n b = int(b)\n if a == \"+\":\n count += b\n elif count >= b:\n count -= b\n else:\n re += 1\n print(count, re)\n\n\n\n########################################################################################################################\ndef main():\n t = 1# int(input())\n for _ in range(t):\n solve()\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", "n,x=map(int,input().split(' '))\r\nkd=0\r\nfor i in range(n):\r\n\tz,d=map(str,input().split(' '))\r\n\tif z=='+':\r\n\t\tx+=int(d)\r\n\telse:\r\n\t\tif x-int(d)<0:\r\n\t\t\tkd+=1\r\n\t\telse:\r\n\t\t\tx-=int(d)\r\nprint(x,kd)", "a,b=map(int,input().split())\r\ng=0\r\nfor x in range(a):\r\n c,d=input().split()\r\n d=int(d)\r\n if c=='+':\r\n b+=d\r\n else:\r\n if d<=b:\r\n b-=d\r\n else:\r\n g+=1\r\nprint(b,g)", "# at the start, x packs\n# people n the queue want one or several packs\n# can give or take d packs\n# what's the number of kids who don't get any\n# output, num packs left and num of distressed kids\n\n\nn, x = list(map(int, input().split(' ')))\n\n# track a rolling sum of packs\n# track distressed kids\n# based on input modify rolling sum and distressed kids\n\nbad_kids = 0\nfor _ in range(n):\n sign, d = input().split(' ')\n d = int(d)\n\n if sign == '+':\n x += d\n else:\n if x - d < 0:\n bad_kids += 1\n else:\n x -= d\n\nprint(x, \" \", bad_kids)\n", "#!/usr/bin/python3\r\n\r\nn, v = (int(x) for x in input().split(' '))\r\nfail = 0\r\nfor i in range(n):\r\n o, s = input().split(' '); s = int(s)\r\n if o == '+':\r\n v += s\r\n else:\r\n if s <= v:\r\n v -= s\r\n else:\r\n fail += 1\r\n\r\nprint(v, fail)\r\n", "m,n=list(map(int,input().split()))\r\nsum=n\r\ncount1=0\r\nfor i in range(m):\r\n o,p=input().split()\r\n if(o==\"+\"):\r\n sum=sum+int(p)\r\n else:\r\n if(int(p)<=sum):\r\n sum=sum-int(p)\r\n else:\r\n count1=count1+1\r\nprint(sum,count1)\r\n ", "n, x = map(int, input().split())\r\ns = 0\r\nfor _ in ' '*n:\r\n f, d = input().split()\r\n d = int(d)\r\n if f=='-':\r\n if d>x: s+=1\r\n else: x-=d\r\n else: x+=d\r\nprint(x, s)", "# https://codeforces.com/problemset/problem/686/A\r\n\r\ndef get_eod_result(packs_qty: int, people_ice_cream: list) -> tuple:\r\n frustrated_people_qty: int = 0\r\n remaining_packs_qty: int = packs_qty\r\n for person_ice_cream in people_ice_cream:\r\n # print(f'person ice cream = {person_ice_cream}')\r\n if person_ice_cream < 0:\r\n if abs(person_ice_cream) > remaining_packs_qty:\r\n frustrated_people_qty += 1\r\n else:\r\n remaining_packs_qty -= person_ice_cream * -1\r\n else:\r\n remaining_packs_qty += person_ice_cream\r\n return (remaining_packs_qty, frustrated_people_qty)\r\n\r\n\r\nif __name__ == '__main__':\r\n first_entry = input('').split(' ')\r\n # print(first_entry)\r\n first_entry_int = [int(x) for x in first_entry]\r\n # print(first_entry_int)\r\n people = first_entry_int[0]\r\n packs_qty = first_entry_int[1]\r\n\r\n people_ice_cream = []\r\n # print(people)\r\n for people in range(people):\r\n # print('reading:')\r\n line = input('').split(' ')\r\n ice_cream = int(line[1])\r\n if (line[0] == '-'):\r\n ice_cream *= -1\r\n people_ice_cream.append(ice_cream)\r\n result = get_eod_result(packs_qty, people_ice_cream)\r\n print(result[0], result[1])\r\n \r\n ", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Tue Jun 30 18:27:52 2020\r\n\r\n@author: ElAhwel\r\n\"\"\"\r\n\r\n\r\nnums = list(map(int , input().split()))\r\nn = nums[0]\r\nicecream = nums[1]\r\nchildren = 0\r\n\r\nfor i in range(n):\r\n st = input().split(\" \")\r\n signal = st[0]\r\n new = int(st[1])\r\n if signal == '+':\r\n icecream += new\r\n if signal == '-':\r\n if new > icecream:\r\n children += 1\r\n else:\r\n icecream -= new\r\n \r\nprint(icecream , children)", "n,p=[int(x) for x in input().split()]\r\nd=0\r\nfor i in range(n) :\r\n g=input().split()\r\n if g[0]=='+' :\r\n p+=int(g[1])\r\n else :\r\n if p>=int(g[1]) : p-=int(g[1])\r\n else : d+=1\r\nprint(p,d)", "a,b=list(map(int,input().split()))\r\nc=b\r\np=0\r\nfor i in range(0,a):\r\n k=input().split()\r\n if(k[0]=='+'):\r\n c=c+int(k[1])\r\n else:\r\n if(int(k[1])<=c):\r\n c=c-int(k[1])\r\n else:\r\n p=p+1\r\nprint(c,p)\r\n ", "n, x = map(int, input().split())\r\nunhappy = 0\r\nfor _ in range(n):\r\n ch, num = input().split()\r\n num = int(num)\r\n if ch == \"+\":\r\n x += num\r\n elif x >= num:\r\n x -= num\r\n else:\r\n unhappy += 1\r\nprint(x, unhappy)", "k,d= [int(x) for x in input().split( )]\r\nchilds=0\r\nfor i in range(k):\r\n l,m= [(x) for x in input().split( )]\r\n m=int(m)\r\n if l =='-' and m > d:\r\n childs+=1\r\n elif l =='-' and m <= d:\r\n d=d-m\r\n elif l=='+':\r\n d=d+m\r\nprint(d,'',childs)", "x , y = map(int,input().split())\r\nn = 0\r\nfor i in range(x):\r\n s = input()\r\n if s[0] == '+':\r\n y += int(s[2:])\r\n else:\r\n if y - int(s[2:]) < 0:\r\n n += 1\r\n else:\r\n y -= int(s[2:])\r\n \r\nprint(y , n)", "n,x=map(int,input().split())\r\ncount=0\r\nfor i in range(n):\r\n a=list(input().split())\r\n if a[0]==\"+\":\r\n c=int(a[1])\r\n x+=c\r\n else:\r\n d=int(a[1])\r\n if d>x:\r\n count+=1\r\n else:\r\n x=x-d\r\nprint(x,count)\r\n", "n, x = map(int, input().split())\ncounter = x\nnoIcecream = 0\n\nfor i in range(n):\n inputLine = input().split()\n op = inputLine[0]\n val = int(inputLine[1])\n\n if op == \"+\":\n counter += val \n elif op == \"-\" and counter >= val: \n counter -= val\n else:\n noIcecream += 1\n\nprint(counter, noIcecream)\n \t\t \t\t\t\t \t \t \t \t \t \t\t", "n,d=input().split()\nd=int(d)\nn=int(n)\nx = 0\nfor z in range (n):\n a, b = input().split()\n b=int(b)\n if a == \"+\":\n d += b \n elif a == \"-\" and d>=b:\n d -= b\n else:\n x+=1 \nprint(str(d) + ' ' + str(x))\n\n#oidshyfiurvgildhgkjfhlrfdshucdsgfcudsgfcidluhfkjdhlkfjhkiutorjfolg.,mjf;lkn \n\t\t\t \t\t \t \t\t \t \t \t\t\t \t\t\t\t\t", "n,x=map(int, input().split())\r\nd=0\r\nfor i in range(n):\r\n op,v=input().split()\r\n v=int(v)\r\n if op=='+':\r\n x+=v\r\n elif op=='-':\r\n if x>=v:\r\n x-=v\r\n else:\r\n d+=1\r\nprint(x,d)", "q,p=map(int,input().split())\r\nd=0\r\nfor i in range(q):\r\n\ts,ice=map(str,input().split())\r\n\tif(s==\"+\"):\r\n\t\tp+=int(ice)\r\n\telse:\r\n\t\tif(int(ice)>p):\r\n\t\t\td+=1\r\n\t\telif(int(ice)<=p):\r\n\t\t\tp-=int(ice)\r\n\t\telse:\r\n\t\t\tNone\r\nprint(p,d)", "n, x = input().split()\nx = int(x)\ncount = 0\nfor tc in range(int(n)):\n\tc = input()\n\tnum = int(c.split()[-1])\n\tif '+' in c:\n\t\tx += num\n\t\t#lst.append(num)\n\t\t#if num < min:\n\t\t#\tmin = num\n\t\n\telif '-' in c:\n\t\tif x - num >= 0:\n\t\t\tx -= num\n\t\telif x - num < 0:\n\t\t\tcount += 1\n\t#rint(x, count)\nprint(x, count)\n\t\t \t\t \t \t \t\t \t \t \t\t\t\t \t\t \t", "\r\n\r\ncounter = 0\r\n\r\npeople_number , icepacks = [int(x) for x in input().split(\" \")]\r\nfor i in range(people_number):\r\n sign , count = [(y) for y in input().split(\" \")]\r\n if (sign==\"+\"):\r\n icepacks+=int(count)\r\n else:\r\n if (icepacks>=int(count)):\r\n icepacks = icepacks-int(count)\r\n else:\r\n counter+=1 \r\nprint(icepacks , counter) ", "n, x = map(int, input().split())\r\ndistressed = 0\r\n\r\nfor _ in range(n):\r\n operation, number = map(str, input().split())\r\n number = int(number)\r\n\r\n if operation == \"+\":\r\n x += number\r\n elif operation == \"-\" and x < number:\r\n distressed += 1\r\n else:\r\n x -= number\r\n\r\nprint(x, distressed)", "n, ini_ice_cream = map(int, input().split())\r\n\r\ndis_child = 0\r\ntotal_ice_cream = ini_ice_cream\r\n\r\nfor i in range(n):\r\n t = [l for l in input().split()]\r\n if t[0] == '+':\r\n total_ice_cream += int(t[1])\r\n else:\r\n if int(t[1]) > total_ice_cream:\r\n dis_child += 1\r\n else:\r\n total_ice_cream -= int(t[1])\r\n\r\nprint(total_ice_cream, dis_child)", "n,x=map(int,input().split())\nkids=0\nfor i in range(n):\n c,a=input().split()\n a=int(a)\n if(c=='+'):\n x+=a\n else:\n if(a>x):\n kids+=1\n else:\n x-=a\n\nprint(x,kids)\n \t \t \t\t\t \t\t\t\t\t\t\t\t \t\t\t\t \t\t\t\t \t", "n,x=map(int,input().split(\" \"))\r\nc=0\r\nfor i in range(n):\r\n a,d=map(str,input().split(\" \"))\r\n if a==\"+\":\r\n x=x+int(d)\r\n elif a==\"-\" and int(d)>x:\r\n c+=1\r\n elif a==\"-\" and int(d)<=x:\r\n x=x-int(d)\r\n\r\nprint(x,c,end=\" \")\r\n", "l=input().split()\r\nn=int(l[0])\r\nx=int(l[1])\r\ncnt=0\r\nfor i in range(n):\r\n l = input().split()\r\n inst = l[0]\r\n v = int(l[1])\r\n if inst == \"+\":\r\n x=x+v\r\n else:\r\n if v>x:\r\n cnt=cnt+1\r\n else:\r\n x=x-v\r\nprint(str(x)+\" \"+str(cnt))\r\n", "'''s=input().split()\r\nn=int(s[0])\r\nm=int(s[1])\r\nst=0\r\nwhile n>0:\r\n st+=1\r\n if st%m==0:\r\n n+=1\r\n n-=1\r\nprint(st)\r\nn=int(input())\r\nv=input()\r\nx=input()\r\na=0\r\nfor i in range(n):\r\n if abs(int(x[i])-int(v[i]))<10-abs(int(x[i])-int(v[i])):\r\n a+=abs(int(x[i])-int(v[i]))\r\n elif abs(int(x[i])-int(v[i]))==10-abs(int(x[i])-int(v[i])):\r\n a+=abs(int(x[i])-int(v[i]))\r\n else:\r\n a+=10-abs(int(x[i])-int(v[i]))\r\nprint(a)'''\r\nx=input().split()\r\nt=int(x[1])\r\ns=0\r\nfor i in range(int(x[0])):\r\n i=input().split()\r\n if i[0]=='-':\r\n if int(i[1])<=t:\r\n t-=int(i[1])\r\n else:\r\n s+=1\r\n else:\r\n t+=int(i[1])\r\nprint(t)\r\nprint(s)\r\n \r\n", "n, x = map(int, input().split())\r\ncount = 0\r\nfor i in range(n):\r\n Character, num = map(str, input().split())\r\n if Character == '-':\r\n if int(num) <= x:\r\n x = x - int(num)\r\n else:\r\n count = count + 1\r\n else:\r\n x = x + int(num)\r\n\r\nprint(x, \"\", count)", "n, x = (int(i) for i in input().split())\nres = 0\nfor _ in range(n):\n sign, delta = input().split()\n delta = int(delta)\n if sign == \"+\":\n x += delta\n elif x >= delta:\n x -= delta\n else:\n res += 1\nres = x, res\nprint(*res)\n", "n, x = map(int, input().split())\r\ndistress = 0\r\nfor i in range(n):\r\n sign, amount = input().split()\r\n if sign == '+':\r\n x += int(amount)\r\n else:\r\n if int(amount) > x:\r\n distress += 1\r\n else:\r\n x -= int(amount)\r\n\r\nprint(x, distress)\r\n", "n, x = map(int, input().split())\r\nfail = 0\r\nfor _ in range(n):\r\n c, ice = map(str, input().split())\r\n if c == \"+\":\r\n x += int(ice)\r\n else:\r\n if int(ice) > x:\r\n fail += 1\r\n else:\r\n x -= int(ice)\r\n\r\nprint(x, fail)\r\n\r\n", "n, x = map(int, input().split())\r\nd = 0\r\nfor _ in range(n):\r\n op, val = input().split()\r\n val = int(val)\r\n if op == '+':\r\n x += val\r\n else:\r\n if val > x:\r\n d += 1\r\n else:\r\n x -= val\r\nprint(x, d)", "n, x = map(int, input().split())\r\ntotal = x\r\ndistressed_cnt = 0\r\nfor _ in range(n):\r\n op, d = input().split()\r\n d = int(d)\r\n if op == '+':\r\n total += d\r\n else:\r\n if total >= d:\r\n total -= d\r\n else:\r\n distressed_cnt += 1\r\nprint(total, distressed_cnt)", "n,x=map(int,input().split())\r\nsum=x\r\nss=0\r\nfor i in range(n):\r\n a,b=input().split()\r\n if a=='+':\r\n sum+=int(b)\r\n else:\r\n if int (b)<=sum:\r\n sum-=int(b)\r\n else:\r\n ss+=1\r\nprint(f\"{sum} {ss}\")", "n, x = map(int, input().split())\r\nc = 0\r\nfor _ in range(n):\r\n a, b = input().split()\r\n b = int(b)\r\n if a == '+':\r\n x += b\r\n else:\r\n if b <= x:\r\n x -= b\r\n else:\r\n c += 1\r\nprint(x, c)", "n, storage = map(int, input().split())\r\nsad = 0\r\nfor i in range(n):\r\n types, deliver = input().split()\r\n deliver = int(deliver)\r\n if types == '+':\r\n storage += int(deliver)\r\n if types == '-':\r\n if deliver <= storage:\r\n storage -= deliver\r\n else:\r\n sad += 1\r\n\r\nprint(storage, sad)\r\n", "n, x = [int(y) for y in input().split(\" \")]\r\n\r\ndistress = 0\r\nfor i in range(n):\r\n c, d = input().split(\" \")\r\n d = int(d)\r\n if c == '+':\r\n x += d\r\n else:\r\n if x >= d:\r\n x -= d\r\n else:\r\n distress += 1\r\nprint(x, distress)\r\n", "n, m = map(int, input(). split())\r\nans = 0\r\nwhile n:\r\n s = input()\r\n if s[0] == '+':\r\n m += int(s[2 : ])\r\n else:\r\n if m - int(s[2 : ]) < 0:\r\n ans += 1\r\n else:\r\n m -= (int(s[2 : ]))\r\n n -= 1\r\nprint(m, ans)\r\n", "n,x=map(int, input().split())\nkids=0\n\nfor i in range(n):\n operator, amount = input().split()\n operator=str(operator)\n amount=int(amount)\n \n if operator == \"+\":\n x += amount\n else:\n if amount > x:\n kids += 1\n else:\n x -= amount\n \nprint(x, kids)\n", "n,x=map(int,(input().split()))\r\ncount=0\r\nwhile n:\r\n op,p=map(str,(input().split()))\r\n if(op=='+'):\r\n x=x+int(p)\r\n else:\r\n if x>=int(p):\r\n x=x-int(p)\r\n else:\r\n count+=1\r\n n-=1\r\nprint(x,end=\" \")\r\nprint(count)", "n, x = map(int, (input()).split())\r\nk = 0\r\nfor i in range(n):\r\n a, b = map(str,(input()).split())\r\n b = int(b)\r\n if a == '+':\r\n x = x + b\r\n else:\r\n if x >= b:\r\n x = x - b\r\n else:\r\n k += 1\r\nprint(x,k)\r\n\r\n", "# -*- coding: utf-8 -*-\r\n\r\ndef main(): \r\n n, x = map(int, input().split())\r\n \r\n cnt = 0\r\n for i in range(n):\r\n op, c = input().split()\r\n if op == '+':\r\n x += int(c)\r\n elif int(c) <= x:\r\n x -= int(c)\r\n else:\r\n cnt += 1\r\n print(x, cnt)\r\n\r\nif __name__ == \"__main__\":\r\n main()", "n, m = map(int, input().split())\r\nd=0\r\nfor i in range(n):\r\n a, b = input().split()\r\n b = int(b)\r\n if a == \"+\":\r\n m += b\r\n if a == \"-\":\r\n if m<b:\r\n d+=1\r\n else:\r\n m=m-b\r\nprint(m,d)", "n, x = list(map(int, input().split()))\r\n\r\ncount_distressed = 0\r\nfor i in range(n):\r\n record = input().split()\r\n # True indicates add, False subtract\r\n sign = True if record[0] == \"+\" else False\r\n di = int(record[1])\r\n\r\n if sign:\r\n x += di\r\n else:\r\n if di <= x:\r\n x -= di\r\n else:\r\n count_distressed +=1\r\n\r\nprint(x,count_distressed)", "n,x=map(int,input().split())\r\ndistressed=0\r\nrupee=0\r\nfor i in range(n):\r\n s=input()\r\n rupee=int(s[2:len(s)])\r\n if(s[0]=='+'):\r\n x+=rupee\r\n elif(x<rupee):\r\n distressed+=1\r\n else:\r\n x-=rupee\r\nprint(x,distressed)", "txt=input()\nn,x=txt.split()\nn=int(n)\nx=int(x)\nsad=0\nfor i in range (n):\n sign,num=input().split()\n if sign=='+':\n x=x+int(num)\n else:\n if x>=int(num):\n x=x-int(num)\n else:\n sad=sad+1\n\n\nprint(x,sad)\n\n \t \t\t \t\t \t \t \t\t", "n =input().split()\nz= int(n[0])\nx=int(n[1])\ns=0\nl=\"\"\nfor i in range (z):\n\tm= input().split()\n\tif m[0] =='+':\n\t\tx += int(m[1])\n\tif m[0] == '-':\n\t\tif x - int(m[1])<0:\n\t\t\ts +=1\n\t\telse:\n\t\t\tx -= int(m[1])\nl += str(x)\nl+=' '\nl+= str(s)\nprint(l)\n\t", "inp=input().split()\r\nq=False\r\nwhile q==False:\r\n try:\r\n n=int(inp[0])\r\n x=int(inp[1])\r\n q=True\r\n except:\r\n inp=input().split()\r\n q=False\r\nc=0\r\nif (n>=1 or n<=1000) & (x>=0 or x<=10**9) :\r\n for p in range(0, n):\r\n in2=input().split()\r\n q=False\r\n while q==False:\r\n try:\r\n log=str(in2[0])\r\n d=int(in2[1])\r\n q=True\r\n except:\r\n in2=input().split()\r\n q=False\r\n if log==\"+\":\r\n x=x+d\r\n elif log==\"-\":\r\n if x>=d: x=x-d\r\n else: c+=1\r\n else: pass\r\nprint(x,\" \",c)", "def solve(n, m):\r\n\r\n count = m\r\n people = 0\r\n for _ in range(n):\r\n inp = input().split()\r\n if inp[0] == '+':\r\n count += int(inp[1])\r\n else:\r\n if count < int(inp[1]):\r\n people += 1\r\n else:\r\n count -= int(inp[1])\r\n\r\n return count, people\r\n\r\n\r\nif __name__ == \"__main__\":\r\n\r\n n, m = map(int, input().split())\r\n print(*solve(n, m))", "n,x=[int(x) for x in input().split()]\r\ncount=0\r\nfor i in range(n):\r\n s=input()\r\n fe=s[0]\r\n num=int(s[2:])\r\n if fe=='+':\r\n x=x+num\r\n if fe=='-':\r\n if x>=num:\r\n x=x-num\r\n else:\r\n count+=1\r\nprint(x,count)", "n,x=map(int,input().split())\ncounter=0\nfor i in range(n):\n sign,d=input().split()\n d=int(d)\n if sign==\"+\":\n x+= d\n elif sign==\"-\"and x<d:\n counter+=1\n else:\n x-=d\nprint(x,counter)\n\n \t \t \t\t\t \t \t \t\t \t\t\t \t", "def solve():\r\n n,x=map(int,input().split())\r\n k=0\r\n for i in range(n):\r\n a=[i for i in input().split()]\r\n if a[0]=='+':\r\n x+=int(a[1])\r\n else:\r\n if x>=int(a[1]):\r\n x-=int(a[1])\r\n else:\r\n k+=1\r\n print(x,k)\r\nsolve()\r\n", "n, x = [int(x) for x in input(\"\").split()]\r\nans = 0\r\nwhile n > 0:\r\n n-=1\r\n line = input(\"\").split()\r\n if line[0] == '+':\r\n x += int(line[1])\r\n elif line[0] == '-':\r\n if x >= int(line[1]):\r\n x -= int(line[1])\r\n else:\r\n ans+=1\r\nprint(x, ans)\r\n", "x=input().split()\r\nn,x=int(x[0]),int(x[1])\r\ncount=x\r\ndis=0\r\nfor i in range(n):\r\n y=input().split()\r\n if(y[0]==\"-\"):\r\n if(count<int(y[1])):\r\n dis+=1\r\n else:\r\n count-=int(y[1]) \r\n if(y[0]==\"+\"):\r\n count+=int(y[1])\r\nprint(count,dis) \r\n \r\n ", "n, x = map(int, input().split())\r\ndis = 0\r\nfor i in range(n):\r\n opr, num = input().split()\r\n num = int(num)\r\n if opr == '+':\r\n x += num\r\n else:\r\n if num > x:\r\n dis += 1\r\n else:\r\n x -= num\r\nprint(x, dis)", "n,x = list(map(int,input().split()))\r\n\r\ncounter = 0\r\n\r\nfor i in range(n):\r\n c = input().split()\r\n if c[0] == \"+\":\r\n x += int(c[1])\r\n elif c[0] == \"-\" and x >= int(c[1]):\r\n x -= int(c[1])\r\n else:\r\n counter += 1\r\n\r\nprint(x,counter)", "import sys\r\nfrom math import ceil\r\ninput = lambda: sys.stdin.readline().rstrip()\r\n\r\ndef main():\r\n n, t = [int(item) for item in input().split(\" \")]\r\n ans = 0\r\n for _ in range(n):\r\n p,q=[item for item in input().split(\" \")]\r\n if(p == \"+\"):\r\n t+=int(q)\r\n else:\r\n if(t<int(q)):\r\n ans+=1\r\n else:\r\n t-=int(q)\r\n print(t,ans)\r\n\r\nif __name__ == '__main__':\r\n main()", "n,s=[int(i) for i in input().split()]\r\nc=0\r\nfor i in range(n):\r\n x=input()\r\n if x[0]==\"+\":\r\n s+=int(x[2:])\r\n elif s-int(x[2:])>=0:\r\n s-=int(x[2:])\r\n else:\r\n c+=1\r\nprint(s,c)", "n, x = map(int,input().split())\r\n\r\ndistress = 0\r\n\r\nfor i in range(n):\r\n a = input().split()\r\n \r\n plus_minus = str(a[0]) \r\n d = int(a[1])\r\n \r\n if plus_minus == '+':\r\n x += d\r\n elif plus_minus == '-' and d <= x:\r\n x -= d\r\n else:\r\n distress += 1\r\n\r\nprint(x, distress)", "#https://codeforces.com/problemset/problem/686/A\r\ninp = input()\r\ninp = inp.split(\" \")\r\n\r\nnum_transactions = int(inp[0])\r\nnum_ice_cream = int(inp[1])\r\n\r\ndistressed = 0\r\nfor current_case in range(num_transactions):\r\n line_inp = input()\r\n line_inp = line_inp.split(\" \")\r\n\r\n current_action = line_inp[0]\r\n current_ask = int(line_inp[1])\r\n\r\n if current_action == \"+\":\r\n num_ice_cream += current_ask\r\n elif current_action == \"-\" and current_ask <= num_ice_cream:\r\n num_ice_cream -= current_ask\r\n else:\r\n distressed += 1\r\n \r\nprint (num_ice_cream,distressed)\r\n\r\n \r\n \r\n", "n,x = tuple(map(int,input().split()))\r\ndiss = 0\r\nfor i in range(n):\r\n order,number = input().split()\r\n number = int(number)\r\n if (order == '+'):\r\n x += number\r\n else:\r\n if (x < number):\r\n diss += 1 \r\n else:\r\n x -= number\r\nprint(x,diss)", "n,x = map(int,input().split())\r\ncol=x\r\nsad=0\r\nfor x in range(n):\r\n ith=input()\r\n if ith[0]== '-' and col >= int(ith[2:]):\r\n col-=int(ith[2:])\r\n elif ith[0]== '-' and col<int(ith[2:]):\r\n sad+=1\r\n else :\r\n col+=int(ith[2:])\r\n \r\nprint(col,sad)\r\n", "n , x = map(int,input().split())\r\nlist1=[]\r\ncount=0\r\nfor i in range(n):\r\n s ,f= input().split()\r\n f = int(f)\r\n list1.extend([s,f])\r\n\r\n\r\nfor i in range(0,n*2,2):\r\n if list1[i]=='+':\r\n x+=list1[i+1]\r\n elif list1[i]=='-' and x>=list1[i+1]:\r\n x-= list1[i+1]\r\n else:\r\n count+=1\r\n\r\nprint(x , count)", "n, x = map(int, input().split())\r\nsum, c = x, 0\r\nfor i in range(n):\r\n s = input()\r\n a = int(s[2:])\r\n if(s[0] == '+'):\r\n sum += a\r\n else:\r\n if(sum < a):\r\n c += 1 \r\n else:\r\n sum -= a \r\nprint(sum, c)", "n,x = map(int,input().split())\r\nd = 0\r\nfor i in range(n):\r\n res =input()\r\n if '+' in res:\r\n x += int(res[2:])\r\n elif '-' in res and x>=int(res[2:]):\r\n x-=int(res[2:])\r\n elif '-' in res and x<int(res[2:]):\r\n d+=1\r\nprint(x,d)", "n, x = map(int,input().split())\r\ncounter = 0\r\nfor i in range(n):\r\n s = list(input().split())\r\n if s[0] == '+':\r\n x += int(s[1])\r\n else:\r\n if x >= int(s[1]):\r\n x -= int(s[1])\r\n else:\r\n counter += 1\r\nprint(f'{x} {counter}')", "x,y=map(int,input().split())\r\ncount=0\r\nfor _ in range(x):\r\n a,b=map(str,input().split(' '))\r\n b=int(b)\r\n if a=='+':\r\n y=y+b\r\n elif a=='-':\r\n if y<b:\r\n count+=1\r\n continue\r\n else:\r\n y=y-b\r\nprint(y,count)\r\n", "n,x=map(int,input().split())\r\ncount=0\r\nfor _ in range(n):\r\n s=input().split()\r\n a=int(s[1])\r\n if s[0]=='+':\r\n x+=a \r\n else:\r\n if x-a>=0:\r\n x-=a\r\n else:\r\n count+=1\r\nprint(x,count) ", "n, packs = map(int, input().split())\ndistressed = 0\n\nfor _ in range(n):\n op, d = input().split()\n d = int(d)\n \n if op == '+':\n packs += d\n elif op == '-':\n if packs >= d:\n packs -= d\n else:\n distressed += 1\n\nprint(packs, distressed)", "n, x = input().split()\r\ns = []\r\nr = []\r\nq = int(x)\r\nc = 0\r\nfor i in range(int(n)):\r\n a, b = input().split()\r\n s.append(a)\r\n r.append(b)\r\nfor i in range(len(s)):\r\n if s[i] == '+':\r\n q += int(r[i])\r\n\r\n elif s[i] == '-':\r\n if int(r[i]) <= q:\r\n q -= int(r[i])\r\n else:\r\n c += 1\r\n\r\n\r\nprint(q, c)", "a,b = [int(i) for i in input().split(' ')]\ncount1 = 0\ncount2 = 0\nfor i in range(a):\n x,y = input().split(' ')\n y = int(y)\n if x=='+':\n b+=y\n elif y>b:\n count2+=1\n else:\n b-=y\n count1+=y\nprint(b, count2)", "n, x = [int(i) for i in input().split(sep=\" \")]\r\n\r\nleft = 0\r\n\r\nfor i in range(0, n):\r\n sign, value = input().split(sep=\" \")\r\n value = int(value)\r\n if sign[0] == \"+\":\r\n x += value\r\n else:\r\n if value <= x:\r\n x -= value\r\n else:\r\n left += 1\r\nprint(x,\" \",left)", "from collections import Counter\r\n\r\ndef solve():\r\n a,b=list(map(int,input().split()))\r\n count=0\r\n for i in range(a):\r\n string=input().split(\" \")\r\n if string[0]==\"-\":\r\n if b>=int(string[1]):\r\n b-=int(string[1])\r\n else:\r\n count+=1\r\n else:\r\n b+=int(string[1])\r\n\r\n return b,count\r\n\r\n\r\n\r\nval=solve()\r\nprint(val[0],val[1])", "n,s=map(int,input().split())\r\nc=0\r\nfor i in range(n):\r\n a,b=input().split()\r\n if a=='+':\r\n s=s+int(b)\r\n elif a=='-':\r\n if int(b)>s:\r\n c=c+1\r\n else:\r\n s=s-int(b)\r\nprint(s,c)", "a, b = input().split()\r\ndig = int(b)\r\ngg = 0\r\nfor c in range(int(a)):\r\n v = input().split()\r\n if v[0] == \"+\":\r\n dig += int(v[1])\r\n elif dig < int(v[1]):\r\n gg += 1\r\n elif v[0] == \"-\":\r\n dig=dig-int(v[1])\r\nprint(dig,gg)\r\n", "\"\"\"\r\n@auther:Abdallah_Gaber \r\n\"\"\"\r\nlst =[int(x) for x in input().split()]\r\nn = lst[0]\r\nx = lst[1]\r\ndistress = 0\r\nfor i in range(n):\r\n lst2 =[x for x in input().split()]\r\n sign = lst2[0]\r\n num = int(lst2[1])\r\n\r\n if sign == '+':\r\n x += num\r\n else:\r\n if x - num < 0:\r\n distress +=1\r\n else:\r\n x -= num\r\n\r\nprint(x , distress)\r\n", "(number_of_people_in_queue, ice_cream_packs_at_the_start_of_the_day) = map(int, input().split(' '))\n\ndistress_children = 0\n\nfor i in range(number_of_people_in_queue):\n (give_or_take, ice_cream_packs) = map(str, input().split(' '))\n if give_or_take == '+':\n ice_cream_packs_at_the_start_of_the_day += int(ice_cream_packs)\n else:\n if ice_cream_packs_at_the_start_of_the_day >= int(ice_cream_packs):\n ice_cream_packs_at_the_start_of_the_day -= int(ice_cream_packs)\n else:\n distress_children += 1\n\nprint(ice_cream_packs_at_the_start_of_the_day, distress_children)", "n ,x =map(int,input().split())\r\nd =0\r\nfor i in range (n):\r\n s =input().split()\r\n if(s[0]=='+'):\r\n x+=int(s[1])\r\n else:\r\n if(int(s[1])>x):\r\n d+=1\r\n else:\r\n x-=int(s[1])\r\nprint(x,d) ", "n, x = map(int, input().split())\nnum = x\nleft = 0\nfor i in range(n):\n\ts = input()\n\tif((s[0] is \"-\") and (int(s[2:]) <= num)):\n\t\tnum = num - int(s[2:])\n\telif(s[0] == \"-\"):\n\t\tleft += 1\n\telif(s[0] == '+'):\n\t\tnum = num + int(s[2:])\nprint(num, left, sep=\" \")\n\n\n \t\t \t \t \t \t \t\t\t\t \t\t\t\t \t \t", "n,x=map(int,input().split())\r\nc=0\r\nfor i in range(n):\r\n ch,d=map(str,input().split())\r\n if ch=='+':\r\n x+=int(d)\r\n else:\r\n if x<int(d):\r\n c+=1\r\n else:\r\n x-=int(d)\r\nprint(x,end=\" \")\r\nprint(c)", "from sys import stdin, stdout\r\nfrom bisect import bisect_left, bisect_right\r\nfrom collections import Counter, deque\r\nimport heapq\r\nimport math\r\nfrom itertools import permutations, combinations, islice\r\n\r\nn, x = map(int, stdin.readline().strip().split())\r\nans = 0\r\nfor i in range(n):\r\n a,b = map(str, stdin.readline().strip().split())\r\n if a == \"-\" and int(b) > x:\r\n ans += 1\r\n elif a == \"+\":\r\n x += int(b)\r\n else:\r\n x -= int(b)\r\nstdout.write(f\"{x} {ans}\")", "n,x = list(map(int,input().split()))\r\na = []\r\ndis = 0\r\nwhile(n!=0):\r\n d = input()\r\n a.append(d)\r\n n = n - 1 \r\nfor i in range(len(a)):\r\n if(a[i][0]=='+'):\r\n x = x + int(a[i][2:])\r\n elif(a[i][0]=='-'):\r\n if(int(a[i][2:])<=x):\r\n x = x - int(a[i][2:])\r\n else:\r\n dis += 1 \r\nprint(x,dis)", "list1 = [int(x) for x in input().split(' ')]\r\nn = list1[0]\r\nx = list1[1]\r\nkid = 0\r\nfor i in range(n):\r\n list2 = input().split(' ')\r\n sign = list2[0]\r\n num = int(list2[1])\r\n if sign==\"+\":\r\n x += num\r\n else:\r\n if x-num < 0:\r\n kid += 1\r\n else:\r\n x -= num\r\nprint(str(x) + ' ' + str(kid))", "n, cic = map(int, input().split())\r\ndistress = 0\r\nfor i in range(n):\r\n sign, num = input().split()\r\n \r\n if sign == \"+\":\r\n cic += int(num) \r\n \r\n else:\r\n if int(num) > cic:\r\n distress+=1 \r\n else:\r\n cic -= int(num)\r\n \r\nprint(cic, distress)", "\n\n\n\n# Press the green button in the gutter to run the script.\nimport math\nfrom builtins import input, print\nimport collections\nfrom fractions import Fraction\nfrom math import gcd\nimport math\n\nif __name__ == '__main__':\n no_orders, ice_cream = list(map(int, input().split(\" \")))\n counter = 0\n\n for i in range(no_orders):\n operation, no_icecream = input().split(\" \")\n if(operation == '+'):\n ice_cream += int(no_icecream)\n else:\n if int(no_icecream) <= ice_cream:\n ice_cream -= int(no_icecream)\n else:\n counter += 1\n\n print(ice_cream, counter)\n# See PyCharm help at https://www.jetbrains.com/help/pycharm/\n", "n, x = map(int, input().split())\r\n\r\ndistress = 0\r\n\r\nfor _ in range(n):\r\n\r\n sym, d = input().split()\r\n\r\n d = int(d)\r\n \r\n if sym == '+':\r\n x += d\r\n\r\n else:\r\n if d > x:\r\n distress +=1\r\n\r\n else:\r\n x -= d\r\n\r\nprint(x,distress,sep=' ')", "n, x = map(int, input().split())\r\nd = 0\r\na =[]\r\nfor i in range(n):\r\n a.append(list(map(str, input().split())))\r\n\r\nfor i in a:\r\n if i[0] == '+':\r\n x += int(i[1])\r\n elif int(i[1]) <= x:\r\n x -= int(i[1])\r\n else:\r\n d+=1\r\n\r\nprint(x,d)\r\n", "n, x = map(int, input().split())\r\nds_studs = 0\r\nfor i in range(n) :\r\n op, d = map(str, input().split())\r\n if op == '+' :\r\n x += int(d)\r\n else :\r\n if int(d) > x :\r\n ds_studs += 1\r\n else :\r\n x -= int(d)\r\nprint(x, ds_studs)\r\n", "n,x=map(int,input().split())\r\nch_gr=0\r\ncur=x\r\nfor i in range(n):\r\n a,b=map(str,input().split())\r\n b=int(b)\r\n if a=='-':\r\n if cur>=b:\r\n cur-=b\r\n else:\r\n ch_gr+=1\r\n \r\n elif a=='+':\r\n cur+=b\r\n \r\nprint(cur, ch_gr)", "n, x = map(int, input().split())\r\ns = x\r\nc = 0\r\nfor i in range(n):\r\n a, b = input().split()\r\n b = int(b)\r\n if a == '+':\r\n s += b\r\n else:\r\n if b > s:\r\n c += 1\r\n else:\r\n s -= b\r\n\r\nprint(s,c)\r\n", "n,x = [int(i) for i in input().split()]\n\na = 0\nfor i in range (n):\n d = input().split()\n if d[0] == '+':\n x += int(d[1])\n if d[0] == '-':\n x -= int(d[1])\n if x < 0:\n x += int(d[1])\n a += 1\n\nprint(x,a)\n\n \t \t \t\t \t\t \t\t \t \t \t \t \t", "n,x=map(int,input().split())\nd=0\nfor i in range(n):\n sign,num=input().split()\n num=int(num)\n if sign=='+':\n x+=num\n else:\n if num>x:\n d+=1\n continue\n x-=num\nprint(x,d)\n \t \t\t\t\t\t \t \t \t\t\t\t \t \t\t", "n , x = input().split()\nn = int(n) ; x = int(x)\nm5ad4 = 0\nfor i in range(n):\n a , b = input().split()\n b = int(b)\n if a =='+':\n x += b\n elif b > x:\n m5ad4 += 1\n else:\n x -= b\nprint(x , m5ad4)\n \t \t\t \t\t\t\t \t \t\t \t \t \t\t\t\t", "n,x = map(int, input().split())\r\ny=0\r\nfor _ in range(n):\r\n a,b=input().split()\r\n b=int(b)\r\n if a=='+':\r\n x+=b\r\n elif x>=b:\r\n x-=b\r\n else:\r\n y+=1\r\nprint(x,y)", "import math\r\ndef icecreampieuwu(n,fex,mex):\r\n c=n\r\n b=0\r\n for i in range(len(fex)):\r\n if fex[i]==\"+\":\r\n c+=mex[i]\r\n elif fex[i]==\"-\":\r\n if mex[i]>c:\r\n b+=1\r\n else:\r\n c-=mex[i]\r\n return [c,b]\r\nt=(input())\r\nsexlist=[int(d) for d in t.split()]\r\nfex=[]\r\nmex=[]\r\nfor j in range(sexlist[0]):\r\n s=input()\r\n qlist=[f for f in s.split()]\r\n fex.append(qlist[0])\r\n mex.append(int(qlist[1]))\r\nf=icecreampieuwu(sexlist[1],fex,mex)\r\nfor x in f:\r\n print(x,end=\" \")", "n, x = map(int, input().split())\r\ndistressCnt = 0\r\nfor i in range(n):\r\n strInput = input().split()\r\n if strInput[0] == '+':\r\n x += int(strInput[1])\r\n else:\r\n if x < int(strInput[1]):\r\n distressCnt += 1\r\n else:\r\n x -= int(strInput[1])\r\nprint(x, distressCnt)", "# l = list(map(int, input().split()))\r\n\r\nn, x = map(int, input().split())\r\n\r\nr=0\r\nfor i in range(n):\r\n a, b = input().split()\r\n if a == '+': x+=int(b)\r\n else:\r\n if x>=int(b): x-=int(b)\r\n else: r+=1\r\nprint(x, r)\r\n", "a, b=map(int, input().split())\r\ncnt=0\r\nfor i in range(a):\r\n c, d=input(). split()\r\n d=int(d)\r\n if c==\"+\":\r\n b=b+d\r\n else:\r\n if d>b:\r\n cnt+=1\r\n else:\r\n b=b-d\r\n \r\n \r\nprint(b, cnt)", "n,x = map(int, input().split())\r\ncnt=0\r\nfor _ in range(n):\r\n i,j = input().split()\r\n if i=='+':\r\n x+=int(j)\r\n else:\r\n if x>=int(j):\r\n x-=int(j)\r\n else:\r\n cnt+=1\r\nprint(x,cnt)", "n, x = list(map(int, input().split()))\r\n\r\nice = x\r\ndistres = 0\r\nfor i in range(n):\r\n s, a = input().split()\r\n a = int(a)\r\n\r\n if s == '+':\r\n ice+=a\r\n else:\r\n if (ice - a) < 0:\r\n distres+=1\r\n else:\r\n ice-=a\r\nprint(ice, distres)\r\n\r\n", "n, x = map(int,input().split())\r\nd=0\r\nfor i in range(n):\r\n sign,packs = input().split()\r\n packs = int(packs)\r\n if sign == '+':\r\n x += packs\r\n if sign == '-':\r\n if packs >x:\r\n d+=1\r\n else:\r\n x-=packs\r\nprint(x, d)", "j,t=list(map(int,input().split()))\r\nlist1=[]\r\nlist2=[]\r\nsum=t\r\ncount=0\r\nfor x in range(j):\r\n s,n=list(map(str,input().split()))\r\n list1.append(s)\r\n list2.append(int(n))\r\nfor x in range(j):\r\n if list1[x]==\"+\":\r\n sum+=list2[x]\r\n else:\r\n if list2[x]>sum:\r\n count+=1\r\n continue\r\n else:\r\n sum-=list2[x]\r\nprint(sum,count)\r\n", "loops, icecreamPacks=input().split()\r\nicecreamPacks=int(icecreamPacks)\r\nNo_distressed_kids=0\r\nfor _ in range(int(loops)):\r\n test=[x for x in input().split()]\r\n if test[0]==\"+\":\r\n icecreamPacks+=int(test[1])\r\n elif test[0]==\"-\":\r\n if icecreamPacks>=int(test[1]):\r\n icecreamPacks-=int(test[1])\r\n else:\r\n No_distressed_kids+=1\r\nprint(icecreamPacks,No_distressed_kids)", "n, m = [int(x) for x in input().split()]\r\nd = 0\r\nfor i in range(n):\r\n s = input()\r\n if s[0] == \"+\":\r\n m += int(s[2:])\r\n else:\r\n\r\n w = int(s[2:])\r\n if(m >= w):\r\n m -= w\r\n else:\r\n d += 1\r\nprint(m, d)\r\n", "queue , ice_packs = map(int , input().split(\" \"))\n\nempty_hand = 0\nfor i in range(queue) :\n person = input().split(\" \")\n if person[0] == '+' :\n ice_packs += int(person[1])\n if person[0] == '-' :\n if ice_packs >= int(person[1]) :\n ice_packs -= int(person[1])\n else :\n empty_hand += 1\nprint(ice_packs , empty_hand)\n\n", "n, x = input().split()\nn, x = int(n), int(x)\ndistress = 0\nfor each_n in range(n):\n a, b = input().split()\n b = int(b)\n if a == \"+\":\n x += b\n else:\n if b <= x:\n x -= b\n else:\n distress += 1\nprint(x, distress)\n\n \t\t\t\t \t\t \t\t \t \t\t \t \t \t", "\r\ns = list(map(int,input().split(' ')))\r\nx = s[1]\r\ndistress = 0\r\nfor i in range(s[0]):\r\n a = input().split(' ')\r\n n = int(a[1])\r\n if(a[0] == '+'):\r\n x += n\r\n continue\r\n if(n > x):\r\n distress +=1\r\n continue\r\n x -= n\r\n\r\n\r\nprint(str(x),str(distress),sep=' ')", "from collections import Counter\r\na,b=[int(i) for i in input().split()]\r\ng=0\r\nfor i in range(a):\r\n c,d = input().split()\r\n d=int(d)\r\n if c=='+':\r\n b=b+d\r\n elif b>=d:\r\n b=b-d\r\n else:\r\n g=g+1\r\nprint(b,g)", "a,b=input().split(\" \")\nnum=int(a)\nini_ice=int(b)\ndist_kid=0\nwhile(num>0):\n next_line=input().split()\n symbol=next_line[0]\n number=int(next_line[1])\n if(symbol==\"+\"):\n ini_ice+=number\n elif(symbol==\"-\"):\n if(ini_ice<number):\n dist_kid+=1\n else:\n ini_ice-=number\n num-=1\nprint(f\"{ini_ice} {dist_kid}\")\n\t \t \t\t \t\t \t\t \t \t \t\t \t\t \t \t", "num=input().split()\r\nn,x=int(num[0]),int(num[1])\r\ndistress=0\r\nfor i in range(n):\r\n new=input().split()\r\n f=int(new[1])\r\n if new[0]=='+':\r\n x+=f\r\n else:\r\n if x>=f:\r\n x-=f\r\n else:\r\n distress+=1\r\nprint(x,end=\" \")\r\nprint(distress)", "n,x = [int(x) for x in input().split()]\nt = 0\nwhile n!= 0:\n a,b = [x for x in input().split()]\n if a=='+':\n x += int(b)\n else:\n if x >= int(b):\n x -= int(b)\n else:\n t += 1\n n -= 1 \nprint(x,t) ", "n,x=list(map(int,input().split(\" \")))\r\ni=0 \r\nt=0\r\nwhile(i<n):\r\n a,b=input().split()\r\n if(a=='+'):\r\n x=x+int(b) \r\n else:\r\n if(int(b)>x):\r\n t=t+1 \r\n else:\r\n x=x-int(b) \r\n i=i+1\r\n \r\n \r\nprint(str(x)+\" \"+str(t)) ", "m, n = map(int, input().split())\r\nfinal = n\r\nd = 0\r\nfor i in range(m):\r\n lst = list(input().split())\r\n if lst[0] == \"+\":\r\n final = final + int(lst[1])\r\n else:\r\n if int(lst[1]) > final:\r\n d += 1\r\n else:\r\n final = final - int(lst[1])\r\n \r\n\r\nprint(final, d)\r\n", "io = input().split()\r\n\r\nn = int(io[0])\r\nx = int(io[1])\r\n\r\ndistress = 0\r\n\r\nfor i in range(n):\r\n cmd = input().split()\r\n if cmd[0] == \"-\":\r\n if x - int(cmd[1]) >= 0:\r\n x -= int(cmd[1])\r\n else:\r\n distress += 1\r\n elif cmd[0] == \"+\":\r\n x += int(cmd[1])\r\n\r\nprint(x, distress)\r\n", "mad_kid=0\r\nsigns=[]\r\nnum=[]\r\nn,x=map(int,input(\"\").split())\r\nfor i in range (0,n):\r\n d=input(\"\")\r\n num.append(d[2:])\r\n signs.append(d[0])\r\n\r\nfor j in range (0,len(signs)):\r\n if signs[j]==\"+\":\r\n x+=int(num[j])\r\n \r\n elif signs[j]==\"-\":\r\n if x >= int(num[j]):\r\n x-=int(num[j])\r\n \r\n else:\r\n mad_kid+=1\r\nprint(x,mad_kid)", "n,x=map(int,input().split())\r\nsad=0\r\nfor y in range(n):\r\n\ta=list(input().split())\r\n\tif a[0]==\"+\":\r\n\t\tx+=int(a[1])\r\n\telse:\r\n\t\tif int(a[1])<=x:\r\n\t\t\tx-=int(a[1])\r\n\t\telse:\r\n\t\t\tsad+=1\r\nprint(x,sad)", "n,x = map(int, input().split())\r\njlh = 0\r\n\r\nfor i in range (n):\r\n s, d = input().split()\r\n d = int(d)\r\n if(s == '+'):\r\n x += d\r\n else:\r\n if(x - d >= 0):\r\n x -= d;\r\n else:\r\n jlh += 1\r\nprint(x, jlh)\r\n", "n, x = [int(s) for s in input().split()]\r\nsad_children = 0\r\nfor i in range(n):\r\n s, d = input().split()\r\n if s == '+':\r\n x += int(d)\r\n else:\r\n if int(d) > x:\r\n sad_children += 1\r\n else:\r\n x -= int(d)\r\nprint(x, sad_children)", "a=input().split()\r\nn= int(a[0])\r\nx=int(a[1])\r\nz,a=0,0\r\nfor i in range(n):\r\n z=x\r\n x+=int(input().replace(' ',''))\r\n if x<0:\r\n x=z\r\n a+=1\r\nprint(x,a)", "n = list(map(int, input().split()))\ncount = 0\nfor i in range(n[0]):\n d = list(input().split())\n if d[0] == \"+\":\n n[1] += int(d[1])\n elif n[1] >= int(d[1]):\n n[1] -=int(d[1])\n else: count += 1\nprint(n[1],count)", "n,x=map(int,input().split())\r\nscnt=0\r\nfor _ in range(n):\r\n arr=list((input().split()))\r\n if arr[0]=='+':\r\n x=x+int(arr[1])\r\n elif arr[0]=='-':\r\n if x>=int(arr[1]):\r\n x=x-int(arr[1])\r\n else:\r\n scnt+=1 \r\nprint(x,scnt)", "cases, k = map(int, input().split())\r\nmissed = 0\r\nwhile cases:\r\n cases -= 1\r\n sign, num = input().split()\r\n if sign == \"-\" and int(num) <= k:\r\n k -= int(num)\r\n elif sign == \"-\" and int(num) > k:\r\n missed += 1\r\n else:\r\n k += int(num)\r\n\r\nprint(k, missed)\r\n\r\n\r\n\r\n\r\n\r\n", "n, d=input().split()\nn = int(n)\nd = int(d)\ndistressed = 0\nfor i in range(n):\n a, b=input().split()\n b = int(b)\n if a == '+':\n d += b\n elif d>=b:\n d-=b\n else:\n distressed += 1\n \nprint(d, distressed)\n \n \n \n\t \t \t \t\t \t\t\t\t\t \t\t\t \t \t \t", "n,x= map (int, input ().split ())\r\nsad_kids=0\r\nfor i in range(n):\r\n sign,icecream=input().split()\r\n if sign==\"+\":\r\n x+=int(icecream)\r\n elif sign==\"-\":\r\n if int(icecream)<=x:\r\n x-=int(icecream)\r\n elif int(icecream)>x:\r\n sad_kids+=1\r\nprint(x,sad_kids)", "n, x = map(int, input().split())\r\ncount = 0\r\nfor _ in range(n):\r\n l = input().split()\r\n a = int(l[1])\r\n if l[0] == '+':\r\n x+=a\r\n elif l[0] == '-' and a<=x :\r\n x-=a\r\n else:\r\n count+=1\r\nprint(x, count)", "def ice_cream():\r\n \r\n n, d = map(int, input().split())\r\n counter = 0\r\n \r\n for _ in range(n):\r\n sign, packs = input().split()\r\n packs = int(packs)\r\n \r\n if sign == '+':\r\n d += packs\r\n \r\n else:\r\n if d >= packs:\r\n d -= packs\r\n \r\n else:\r\n counter += 1\r\n \r\n return d, counter\r\n\r\n\r\nprint(*ice_cream(), sep=(\" \"))", "try:\r\n n,x=list(map(int,input().split()))\r\n i=0\r\n cnt=0\r\n while i<n:\r\n l=list(map(str,input().split()))\r\n if l[0]==\"+\":\r\n x=x+int(l[1])\r\n else:\r\n if x>=int(l[1]):\r\n x=x-int(l[1])\r\n else:\r\n cnt+=1\r\n i+=1\r\n print(x,cnt)\r\n \r\nexcept:\r\n pass\r\n", "n, x = map(int, input().split())\r\nd = 0\r\nfor i in range(n):\r\n z, y = map(str, input().split())\r\n if z == '+':\r\n x = x + int(y)\r\n if z == '-':\r\n if x >= int(y):\r\n x = x - int(y)\r\n else: \r\n d = d + 1\r\nprint(x, d)", "n, x = map(int, input().split())\r\ntotal_icecream = x\r\nkid = 0\r\nfor i in range(n):\r\n sign, no = input().split()\r\n if sign == '+':\r\n total_icecream += int(no)\r\n if sign == '-':\r\n if total_icecream < int(no):\r\n kid += 1\r\n else: total_icecream -= int(no)\r\nprint(total_icecream, kid)", "n , x = list(map(int, input().split(\" \")))\r\nflag =0\r\nfor i in range(n):\r\n c , d = input().split(\" \")\r\n c = str(c)\r\n d = int(d)\r\n if c == '+':\r\n x +=d \r\n elif c == '-':\r\n if x >= d:\r\n x-=d\r\n else:\r\n flag+=1\r\nprint(x, flag)\r\n", "d = {\"+\":1,\"-\":-1}\nx,a = map(int, input().split())\ndkc = 0\nfor i in range(x):\n nL0, nL1 = input().split()\n a += int(d[nL0])*int(nL1)\n if(a < 0):\n a -= int(d[nL0])*int(nL1)\n dkc+=1\nprint(a,\"\",dkc)\n \t \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\ndis = 0\r\nfor i in range(n):\r\n op, ices = input().split()\r\n ices = int(ices)\r\n \r\n if op == \"+\":\r\n x += ices\r\n else:\r\n if x - ices >= 0:\r\n x -= ices\r\n else:\r\n dis += 1\r\n\r\n\r\nprint(x, dis)\r\n", "n,x = map(int , input().split())\r\nunstressed= 0\r\nfor i in range(n):\r\n l =[x for x in input().split()]\r\n if l[0] == \"+\" :\r\n x+= int(l[1])\r\n else:\r\n if int(l[1]) > x:\r\n unstressed+=1\r\n else:\r\n x-=int(l[1])\r\n \r\nprint(x,unstressed,end=\"\")", "def q(j,x,d):\r\n if j[0]==\"+\":\r\n x+=int(j[1])\r\n else:\r\n if int(j[1])>x:\r\n d+=1\r\n else:\r\n x-=int(j[1])\r\n return x,d\r\n\r\ndef h():\r\n k=input().split()\r\n n,x=int(k[0]),int(k[1])\r\n d=0\r\n for i in range(n):\r\n j=input().split()\r\n x,d=q(j,x,d)\r\n return str(x)+\" \"+str(d)\r\n\r\n \r\nprint(h())\r\n", "n,x=map(int,input().split())\r\nk=0\r\nfor i in range(n):\r\n q=input()\r\n if \"+\"in q:x+=int(q[1:])\r\n else:\r\n o=int(q[1:])\r\n if o>x:k+=1\r\n else:x-=o\r\nprint(x,k)", "n,x = map(int,input().split())\r\ncnt = 0\r\nfor i in range(n):\r\n a = input()\r\n if a[0]==\"+\":\r\n x+=int(a[2:])\r\n else:\r\n if int(a[2:])>x:\r\n cnt+=1\r\n else:\r\n x-=int(a[2:])\r\n\r\nprint(x,cnt)", "n, x = [int(tmp) for tmp in input().split()]\nk = 0\nfor i in range(n):\n\tsign, d = input().split()\n\td = int(d)\n\tif sign == '+':\n\t\tx += d\n\telse:\n\t\tif x >= d:\n\t\t\tx -= d\n\t\telse:\n\t\t\tk += 1\nprint(x, k)\n\t\t\n", "# import sys\r\n# sys.stdin = open('./input.txt', 'r')\r\n# sys.stdout = open('./output.txt', 'w')\r\n\r\nn, x = map(int, input().split())\r\ndistressed=0\r\nfor _ in range(n):\r\n s = input()\r\n if s[:1]==\"+\":\r\n x+=int(s[2:])\r\n else:\r\n if x>=int(s[2:]):\r\n x-=int(s[2:])\r\n else:\r\n distressed+=1\r\nprint(x, distressed)", "n , x = map(int,input().split())\r\nc = 0\r\nfor i in range(n):\r\n s = input().split()\r\n a = s[0]\r\n b = int(s[1])\r\n\r\n if a == '+':\r\n x += b\r\n if a == '-' :\r\n if x >= b :\r\n x -= b\r\n else:\r\n c += 1\r\nprint(x,c)\r\n", "\r\n\r\nif __name__ == '__main__':\r\n x = input().split(\" \")\r\n total = int(x[1])\r\n sad_kids = 0\r\n temp = []\r\n for i in range(int(x[0])):\r\n y = input().split(\" \")\r\n if (y[0] == '+'):\r\n total = total + int(y[1])\r\n if (y[0] == '-'):\r\n total = total - int(y[1])\r\n if total < 0:\r\n sad_kids = sad_kids + 1\r\n total = total + int(y[1])\r\n\r\n print(str(total) + ' ' + str(sad_kids))\r\n\r\n\r\n\r\n\r\n\r\n'''\r\n for i in range(int(x[0])):\r\n y = input()\r\n \r\n\r\n'''", "n,nn=map(int,input().split())\r\nc=0\r\nfor i in range(n):\r\n a,b=list(map(str,input().split()))\r\n if a==\"+\":\r\n nn+=int(b)\r\n else:\r\n if int(b)>nn:\r\n c+=1\r\n else:\r\n nn-=int(b)\r\n\r\nprint(nn,c)", "n, x = map(int, input().split())\r\nicecream = x\r\ndistressed = 0\r\nfor i in range(n):\r\n op, d = input().split()\r\n d = int(d)\r\n if op == '+':\r\n icecream += d\r\n elif op == '-':\r\n if d <= icecream:\r\n icecream -= d\r\n else:\r\n distressed += 1\r\nprint(icecream, distressed)", "MAX = 1 << 20\r\nwhile True:\r\n try:\r\n n, x = map(int, input().split())\r\n cnt = 0\r\n for i in range(n):\r\n a, b = map(str, input().split())\r\n c = int(b)\r\n if a == '-':\r\n if x - c < 0:\r\n cnt += 1\r\n else:\r\n x -= c\r\n elif a == '+':\r\n x += c\r\n print(x, cnt)\r\n except:\r\n break", "n , x = map(int , input().split())\r\namount = x\r\ndist = 0\r\nfor _ in range(n):\r\n m,a = map(str, input().split())\r\n a = int(a)\r\n if(m =='+'):\r\n amount += a\r\n else:\r\n if(a <= amount):\r\n amount -= a\r\n else:\r\n dist+=1\r\nprint(amount, dist)", "import sys\r\nimport math\r\n\r\ninput = sys.stdin.readline\r\n\r\n\r\n############ ---- Input Functions ---- ############\r\ndef inp():\r\n return (int(input()))\r\n\r\n\r\ndef inlt():\r\n return (list(map(int, input().split())))\r\n\r\n\r\ndef insr():\r\n s = input()\r\n return (list(s[:len(s) - 1]))\r\n\r\n\r\ndef invr():\r\n return (map(int, input().split()))\r\n\r\n\r\nft = inlt()\r\n\r\nquant = ft[1]\r\ndist = 0\r\n\r\nfor i in range(ft[0]):\r\n s = input()[:-1].split(' ')\r\n if s[0] == '+':\r\n quant += int(s[1])\r\n if s[0] == '-':\r\n if quant < int(s[1]):\r\n dist += 1\r\n else:\r\n quant -= int(s[1])\r\nprint(quant, dist)\r\n\r\n\r\n", "n,x = list(map(int,input().split()))\r\ncount = 0\r\nfor _ in range(n):\r\n l = list(map(str,input().split(' ')))\r\n l[1] = int(l[1])\r\n if l[0] == '+':\r\n x += l[1]\r\n elif l[0] == '-':\r\n if x >= l[1]:\r\n x -= l[1]\r\n else :\r\n count += 1\r\nprint(x,count)", "n = input().split(\" \")\r\nnow = int(n[1])\r\nchild = 0\r\n\r\nfor i in range(int(n[0])):\r\n order = input().split(\" \")\r\n if order[0] == '-' and int(order[1]) <= now:\r\n now -= int(order[1])\r\n elif order[0] == '+':\r\n now += int(order[1])\r\n else:\r\n child += 1\r\n continue\r\nprint(now, \" \", child)\r\n", "n,x=[int(x) for x in input().split()]\r\nres=0\r\nfor i in range(n):\r\n a,b=[x for x in input().split()]\r\n if a=='+':\r\n x+=int(b)\r\n else:\r\n if x>=int(b):\r\n x-=int(b)\r\n else:\r\n res+=1 \r\nprint(x,res)", "# testCaseNum = int(input())\n# for testCase in range(testCaseNum):\n# n = input()\nn ,x = map(int ,input().split())\ncnt = 0\nwhile n:\n ins ,num = [int(i) if i.isdigit() else i for i in input().split()]\n if ins == '+':\n x += num\n else:\n if num > x:\n cnt += 1\n else:\n x -= num\n n -= 1\nprint(x ,cnt )\n", "n,x = map(int, input().split())\n\ndistressed = 0\n\nfor i in range(n):\n sign, d = input().split()\n d = int(d)\n if sign == \"+\":\n x += d\n else:\n if d <= x:\n x -= d\n else:\n distressed += 1\n\nprint(x,distressed)\n", "\"\"\"\r\nAfter their adventure with the magic mirror Kay and Gerda have returned home and sometimes give free ice cream to kids in the summer.\r\n\r\nAt the start of the day they have x ice cream packs. Since the ice cream is free, people start standing in the queue before Kay and Gerda's house even in the night. Each person in the queue wants either to take several ice cream packs for himself and his friends or to give several ice cream packs to Kay and Gerda (carriers that bring ice cream have to stand in the same queue).\r\n\r\nIf a carrier with d ice cream packs comes to the house, then Kay and Gerda take all his packs. If a child who wants to take d ice cream packs comes to the house, then Kay and Gerda will give him d packs if they have enough ice cream, otherwise the child will get no ice cream at all and will leave in distress.\r\n\r\nKay wants to find the amount of ice cream they will have after all people will leave from the queue, and Gerda wants to find the number of distressed kids.\r\n\r\nInput\r\nThe first line contains two space-separated integers n and x (1 ≤ n ≤ 1000, 0 ≤ x ≤ 109).\r\n\r\nEach of the next n lines contains a character '+' or '-', and an integer di, separated by a space (1 ≤ di ≤ 109). Record \"+ di\" in i-th line means that a carrier with di ice cream packs occupies i-th place from the start of the queue, and record \"- di\" means that a child who wants to take di packs stands in i-th place.\r\n\r\nOutput\r\nPrint two space-separated integers — number of ice cream packs left after all operations, and number of kids that left the house in distress\r\n\"\"\"\r\n\r\nn, x = map(int, input().split())\r\ndistressed = 0\r\n\r\nfor _ in range(n):\r\n s = input()\r\n if s[0] == '+':\r\n x += int(s[2:])\r\n else:\r\n if x >= int(s[2:]):\r\n x -= int(s[2:])\r\n else:\r\n distressed += 1\r\n\r\nprint(x, distressed)\r\n", "n,x = [int(x) for x in input().split(\" \")]\r\nans = x\r\ndistress = 0\r\nfor i in range(n):\r\n x,val = input().split(\" \")\r\n val = int(val)\r\n if x=='+':\r\n ans+=val\r\n else:\r\n if ans>=val:\r\n ans-=val\r\n else:\r\n distress+=1\r\nprint(ans,distress)\r\n", "a,b = map(int,input().split())\r\nsum = b\r\nl = 0\r\nfor i in range(0,a):\r\n c = input().split()\r\n if c[0] == '+':\r\n sum += int(c[1])\r\n elif c[0] == '-' and int(c[1])<=sum:\r\n sum -= int(c[1])\r\n elif c[0] == '-' and int(c[1])>sum:\r\n l += 1\r\n continue\r\nprint(sum,l)\r\n", "n, m = map(int, input().split())\r\ncnt = 0\r\n\r\nfor i in range(n):\r\n d, x = input().split()\r\n if d == '+':\r\n m += int(x)\r\n else:\r\n if int(x) > m:\r\n cnt += 1\r\n else:\r\n m -= int(x)\r\n\r\nprint(m, cnt)\r\n ", "n, x=map(int, input().split())\r\nc=0\r\nfor i in range(n):\r\n s, k=map(str, input().split())\r\n k=int(k)\r\n if s=='+':\r\n x=x+k\r\n else:\r\n if k>x:\r\n c=c+1\r\n else:\r\n x=x-k\r\nprint(x, c)", "n,s=map(int,input().split())\r\nc=0\r\nfor i in range(n):\r\n a,b=input().split()\r\n b=int(b)\r\n if(a=='+'):\r\n s+=b\r\n else:\r\n if(s>=b):\r\n s-=b\r\n else:\r\n c+=1\r\nprint(s,c) ", "n, x = map(int, input().split())\nk = 0\n\nfor i in range(n):\n c, d = input().split()\n d = int(d)\n \n if c == '+':\n x += d\n else:\n if d > x:\n k += 1\n else:\n x -= d\n\nprint(x, k)", "from collections import defaultdict\r\nimport random\r\n\r\nn, m = list(map(int, input().split()))\r\ns = 0\r\nfor i in range(n):\r\n zn, ch = input().split()\r\n ch=int(ch)\r\n if zn == '+':\r\n m += ch\r\n elif ch > m:\r\n s += 1\r\n else:\r\n m -= ch\r\nprint(m, s)\r\n", "a,b=map(int,input().split())\r\nans1=0\r\nfor i in range(a):\r\n x,z=input().split()\r\n z=int(z)\r\n if x == '+':\r\n b+=z\r\n elif x=='-':\r\n if b-z<0:\r\n ans1+=1\r\n else:\r\n b-=z\r\nprint(b,ans1)", "n, x = list(map(int, input().split()))\r\nc = 0\r\n\r\nfor i in range(n):\r\n line = list(input().split())\r\n value = int(line[1])\r\n if line[0] == '+':\r\n x += value\r\n else:\r\n if value <= x:\r\n x -= value\r\n else:\r\n c += 1\r\nprint(x, c)", "n, m = map(int, input().split())\r\nans = 0\r\nfor i in range(n):\r\n a = input()\r\n a = int(a[0]+a[2:])\r\n if a < 0 and m+a < 0:\r\n ans += 1\r\n else:\r\n m += a\r\nprint(m, ans)\r\n", "n, ice_cream_balance = [int(x) for x in input('').split(' ')]\ndistresed_kids = 0\nfor _ in range(n):\n kid = input('').split(' ')\n if kid[0] == \"-\":\n if ice_cream_balance >= int(kid[1]):\n ice_cream_balance -= int(kid[1])\n else:\n distresed_kids += 1\n\n else:\n ice_cream_balance += int(kid[1])\nprint(ice_cream_balance, distresed_kids)", "n_1=list(map(int,input().split()))\nx=0\nfor i in range(n_1[0]):\n str=input().split()\n if(str[0]=='+'):\n n_1[1]+=int(str[1])\n elif n_1[1]-int(str[1])<0:\n x+=1\n continue\n else:\n n_1[1]-=int(str[1])\nprint(\"{} {}\".format(n_1[1],x))\n\n\n\n", "n , x = map(int, input().split()) \r\nsad_kids = 0 \r\nice_cream = x \r\nqeue = [] \r\nfor i in range(n) : \r\n qeue.append(str(input()))\r\nfor i in qeue : \r\n if i[0] ==\"-\" : \r\n if ice_cream >= int(i[2:]) :\r\n ice_cream -= int(i[2:]) \r\n else: \r\n sad_kids += 1\r\n else: \r\n ice_cream += int(i[2:])\r\nprint(ice_cream , sad_kids)", "l=[*map(int,input().split())]\r\nn=l[0]\r\nx=l[1]\r\nc=0 \r\nfor i in range (n):\r\n s=input()\r\n if s[0]=='+' :\r\n x+= int(s[2:])\r\n else :\r\n if x>= int(s[2:]):\r\n x-=int(s[2:])\r\n else :\r\n c+=1\r\nprint(x,c)", "string = str(input())\r\narray = string.split()\r\n\r\n\r\nn = int(array[0])\r\nx = int(array[1])\r\n\r\n\r\narr=[]\r\n\r\nfor i in range(n):\r\n string2 = str(input())\r\n tmp = string2.split()\r\n arr.append(tmp)\r\n\r\n\r\n\r\n\r\nchild = 0\r\n\r\n\r\nfor i in range(len(arr)):\r\n\r\n if arr[i][0] == \"+\":\r\n x+=int(arr[i][1])\r\n\r\n if arr[i][0] == \"-\":\r\n if x<int(arr[i][1]):\r\n child+=1\r\n\r\n else:\r\n x=x-int(arr[i][1])\r\n\r\n\r\n\r\nprint(x,end=\"\")\r\nprint(\" \",end=\"\")\r\nprint(child)\r\n", "def iceCream(x, arr):\r\n # n stands for the nubmer of people waiting\r\n # x number of ice cream packets available\r\n # arr = [['+', '5'], ['-', '10']]\r\n amount = x\r\n kids = 0\r\n for chunk in arr:\r\n if chunk[0] == '+':\r\n amount += int(chunk[1])\r\n elif chunk[0] == '-':\r\n if amount >= int(chunk[1]):\r\n amount -= int(chunk[1])\r\n else:\r\n kids += 1\r\n return [amount, kids]\r\n\r\nif __name__ == '__main__':\r\n n, x = map(int, input().split())\r\n\r\n arr = []\r\n for i in range(n):\r\n arr.append(input().split()) # both will be strings\r\n\r\n out = iceCream(x, arr)\r\n for i in out:\r\n print(i, end=' ')\r\n print()\r\n ", "d,x=map(int,input().split())\r\na=0\r\nfor i in range(d):\r\n l=input().split()\r\n y1=l[0]\r\n y2=int(l[1])\r\n if y1=='+':\r\n x=x+y2\r\n else:\r\n if x>=y2:\r\n x-=y2\r\n else:\r\n a+=1\r\n \r\nprint(x,a)", "n, s = map(int, input().split())\r\nc = 0\r\nfor _ in range(n):\r\n a, b = map(str, input().split())\r\n b = int(b)\r\n if a == '+':\r\n s += b\r\n else:\r\n if s >= b:\r\n s -= b\r\n else:\r\n c += 1\r\nprint(s, c)\r\n", "n,x = map(int,input().split(\" \"))\r\nnoKids = 0\r\n\r\nfor i in range(n):\r\n person = input()\r\n d = int(person[2:])\r\n if person[0] == \"+\":\r\n x += d\r\n else :\r\n if d > x:\r\n noKids +=1\r\n else :\r\n x -=d\r\nprint(f\"{x} {noKids}\")", "start = list(map(int, input().strip().split()))[:2]\r\nsad = 0\r\nfor i in range(start[0]):\r\n\ts = input().split()\r\n\tif (s[0] == \"+\"):\r\n\t\tstart[1] += int(s[1])\r\n\telse:\r\n\t\tif (start[1] >= int(s[1])):\r\n\t\t\tstart[1] -= int(s[1])\r\n\t\telse:\r\n\t\t\tsad += 1\r\nprint(start[1], sad)", "n,x=map(int,input().split())\r\nh=0\r\nfor _ in range(n):\r\n z,c=input().split()\r\n c=int(c)\r\n if z==\"+\":\r\n x+=c\r\n if z==\"-\":\r\n if x-c>=0:\r\n x-=c\r\n else:\r\n h+=1\r\nprint(x,h)\r\n", "n,x=map(int,input().split())\r\na=0\r\nfor i in range(n):\r\n\ts=input()\r\n\tif s.startswith(\"+\"):\r\n\t\tx=x+int(s[2:])\r\n\telif s.startswith(\"-\"):\r\n\t\tif x<=0 or x<int(s[2:]):\r\n\t\t\ta=a+1\r\n\t\telse:\r\n\t\t\tx=x-int(s[2:])\r\nprint(x,a)", "import sys\r\n\r\ndef main():\r\n n, answer = map(int, sys.stdin.readline().split())\r\n sad = 0\r\n\r\n for i in range(n):\r\n type_of, cur = sys.stdin.readline().split()\r\n cur = int(cur)\r\n if type_of == \"+\":\r\n answer += cur\r\n elif answer >= cur:\r\n answer -= cur\r\n else:\r\n sad += 1\r\n\r\n sys.stdout.write(str(answer) + \" \" + str(sad))\r\n\r\nmain()\r\n", "n, x = map(int, input().split())\r\nsad = 0\r\nfor i in range(n):\r\n sign, num = input().split()\r\n num = int(num)\r\n if sign == '+':\r\n x += num\r\n elif num > x:\r\n sad += 1\r\n else:\r\n x -= num\r\nprint(x, sad)\r\n", "n , x = map(int , input().split())\r\n\r\ndistressed = 0\r\nfor i in range(n):\r\n d = input()\r\n if d[0] == \"+\":\r\n x = x + int(d[2:])\r\n else:\r\n if int(d[2:]) > x:\r\n distressed = distressed + 1\r\n else:\r\n x = x - int(d[2:])\r\nprint(x , distressed)", "n, x = map(int, input().split())\nmx = x\ncount = 0\nfor _ in range(n):\n\tl1 = list(map(str, input().split()))\n\tif(l1[0] == \"+\"):\n\t\tmx = mx + int(l1[1])\n\t\t\n\tif(l1[0] == \"-\"):\n\t\tif(mx < int(l1[1])):\n\t\t\tcount += 1\n\t\telse:\n\t\t\tmx = mx - int(l1[1])\nprint(mx, count)\n \t \t\t \t\t \t \t\t\t\t\t\t\t\t \t", "u,i=map(int,input().split())\r\no=0\r\nfor x in range(u):\r\n a,b=map(str,input().split())\r\n if a==\"-\":\r\n if (i-int(b))<0:\r\n o+=1\r\n else:\r\n i-=int(b)\r\n else:\r\n i+=int(b)\r\nprint(i,o)", "n , x = list(map(int , input().split()))\r\nc = 0\r\nl2 = []\r\nfor i in range (n):\r\n l = list(input().split())\r\n l2.append(l)\r\n\r\nfor i in range(len(l2)):\r\n if l2[i][0] == '+':\r\n x += int((l2[i][1]))\r\n elif l2[i][0] == '-':\r\n if int(l2[i][1]) > x:\r\n c +=1\r\n else:\r\n x -= int(l2[i][1])\r\n\r\nprint(x , c)\r\n ", "user_input = input().split()\r\nlistNumber = list(map(int, user_input))\r\ndistressed=0\r\n\r\nfor i in range(listNumber[0]):\r\n x=input()\r\n addons=int(x[1::])\r\n if x[0]== \"+\":\r\n listNumber[1]+=addons\r\n if x[0]== \"-\":\r\n if listNumber[1]>=addons:\r\n listNumber[1]-=addons\r\n else:\r\n distressed+=1\r\nprint(str(listNumber[1])+\" \"+str(distressed))\r\n\r\n", "n,x = list(map(int,input().split()))\r\nt = 0\r\nfor i in range(n):\r\n y,z = input().split()\r\n if y == '+':\r\n x += int(z)\r\n elif y == '-' and x < int(z):\r\n t+=1\r\n elif y == '-' and x >= int(z):\r\n x -= int(z)\r\nprint(x,t)", "n,x = map(int,input().split(\" \"))\r\nstock = x\r\nempty = 0\r\nfor child in range(n):\r\n sign,dem = input().split(\" \")\r\n demand = int(sign+dem)\r\n if demand >= 0 or (demand < 0 and abs(demand) <= stock):\r\n stock+=demand\r\n else:\r\n empty+=1\r\n\r\nprint(f'{stock} {empty}')", "n, x = input().split()\nn = int(n)\nx = int(x)\nqtd = x\nchild = 0\nfor i in range(n):\n op, d = input().split()\n d = int(d)\n if op == '+':\n qtd += d\n elif op == '-' and (qtd - d) < 0:\n child += 1\n continue\n elif op == '-' and (qtd - d) >= 0:\n qtd -= d\n\nprint(qtd, child)\n\t\t\t\t\t \t \t\t\t \t \t \t\t\t \t \t \t", "n, x = (int(el) for el in input().split())\r\nned = 0\r\nfor _ in range(n):\r\n s = [el for el in input().split()]\r\n if s[0] == '+':\r\n x += int(s[1])\r\n else:\r\n c = int(s[1])\r\n if x >= c:\r\n x -= c\r\n else:\r\n ned += 1\r\n \r\nprint(x, ned)", "n,x = [int(y) for y in input().split()]\r\nc=0\r\nd=x\r\nfor _ in range(n):\r\n o,i = [y for y in input().split()]\r\n i=int(i)\r\n if o=='+':\r\n d+=i\r\n else:\r\n if d>=i:\r\n d-=i\r\n else:\r\n c+=1\r\nprint(d,c)\r\n", "deals, cream = input().split(\" \")\r\nunhappy = 0\r\nfor i in range(0, int(deals)):\r\n sign, number = input().split(\" \")\r\n if sign == '+':\r\n cream = int(cream) + int(number)\r\n if sign == '-' and int(cream) >= int(number):\r\n cream = int(cream) - int(number)\r\n elif sign == '-' and int(cream) < int(number):\r\n unhappy = unhappy + 1\r\nprint(cream, unhappy)", "\nn , starterPack = [int(x) for x in input().split()]\ndistressedChilds = 0\nfor i in range(n):\n\tsymbol , pack = [x for x in input().split()]\n\tif(symbol == \"-\"):\n\t\tif(starterPack >= int(pack)):\n\t\t\tstarterPack = starterPack - int(pack)\n\t\telse:\n\t\t\tdistressedChilds += 1 \n\telse:\n\t\tstarterPack = starterPack + int(pack)\nprint(starterPack , distressedChilds)\n \t\t\t\t\t \t \t\t\t\t\t \t \t\t\t \t \t\t", "a = input().split()\r\nn = int(a[0])\r\nx = int(a[1])\r\nc = 0\r\nfor i in range(n):\r\n s = input().split()\r\n sharpcase = s[0]\r\n sharpbox = s[1]\r\n if sharpcase == \"+\":\r\n x += int(sharpbox)\r\n else:\r\n if x >= int(sharpbox):\r\n x -= int(sharpbox)\r\n else:\r\n c+=1\r\nprint(x, c)", "a,b = map(int,input().split())\nk_g = b\nc_d = 0\nfor _ in range(0,a):\n z = str(input())\n if z[0] == '+':\n k_g += int(z[2:])\n \n elif z[0]=='-':\n if int(z[2:])<=k_g:\n k_g -= int(z[2:])\n else:\n c_d+=1\n \n \nprint(k_g, c_d)\n \t \t \t \t \t\t \t \t\t \t\t", "a,b=list(map(int,input().split()))\r\ne=0\r\nwhile (a>0):\r\n c,d=list(map(str,input().split()))\r\n if c=='+':\r\n b+=int(d)\r\n else:\r\n if b-int(d)<0:\r\n e+=1\r\n else:\r\n b-=int(d)\r\n l=[int(b),e]\r\n a-=1\r\nprint(*l)", "n, x = map(int, input().split())\r\na = []\r\nfor i in range(n):\r\n b, c = map(str, input().split())\r\n a.append((b,int(c)))\r\nd = x\r\ne = 0\r\nfor i in range(len(a)):\r\n if(a[i][0] == '+'):\r\n d += a[i][1]\r\n else:\r\n if(a[i][1] <= d):\r\n d -= a[i][1]\r\n else:\r\n e += 1\r\n continue\r\nprint(d,e)\r\n\r\n", "li = [int(x) for x in input().split()]\nn,x=li[0],li[1]\ndis = 0\nfor i in range(n):\n lis=[j for j in input().split()]\n a,b=lis[0],int(lis[1])\n if a == \"+\":\n x+=b\n elif a == \"-\":\n if x>=b:\n x-=b\n else:\n dis+=1\nprint(x,dis)\n \t \t\t \t\t\t \t\t\t\t \t\t\t\t \t\t\t", "def freeIceCream(numberOfCustomers,startingNoIcecreams):\r\n currentNumberofIcecreams=startingNoIcecreams\r\n distress=0\r\n for _ in range(numberOfCustomers):\r\n s=input().split(\" \")\r\n if s[0]=='+':\r\n currentNumberofIcecreams+=int(s[-1])\r\n elif s[0]=='-':\r\n if currentNumberofIcecreams>=int(s[-1]):\r\n currentNumberofIcecreams-=int(s[-1])\r\n else:\r\n distress+=1\r\n return f\"{currentNumberofIcecreams} {distress}\"\r\nn,x=map(int,input().split())\r\nprint(freeIceCream(n,x))", "num_people, num_icecream = map(int, input().split())\r\n\r\ndistressed = 0\r\nfor i in range(num_people):\r\n sign, quantity = input().split()\r\n quantity = int(quantity)\r\n if sign == '+':\r\n num_icecream+= quantity\r\n else:\r\n if num_icecream < quantity:\r\n distressed+=1\r\n else:\r\n num_icecream-= quantity\r\nprint(num_icecream, distressed)", "n, x = list(map(int, input().split()))\n\nres = 0\n\nfor _ in range(n):\n sign, a = input().split()\n a = int(a)\n if sign == '+':\n x += a\n else:\n if x >= a:\n x -= a\n else:\n res += 1\nprint(x, res)", "nx = input().strip().split(' ')\nn = int(nx[0])\nx = int(nx[1])\n\n\ndist = 0 \nstore = x\n\nfor i in range(n):\n ent = input().strip().split(' ')\n if ent[0] == '+':\n store += int(ent[1])\n else:\n if store >= int(ent[1]):\n store -= int(ent[1])\n else:\n dist += 1 \nprint(store, dist)\n", "line, iceStart = map(int, input().split())\r\ndistressed = 0\r\nfor i in range(line):\r\n symbAmt = input().split(' ')\r\n if symbAmt[0] == '+':\r\n iceStart+=int(symbAmt[1])\r\n elif symbAmt[0] == '-':\r\n if(iceStart>=int(symbAmt[1])):\r\n iceStart-=int(symbAmt[1])\r\n else:\r\n distressed+=1\r\nprint(iceStart,distressed)", "n, x = map(int, input().split())\r\nk = x\r\nc = 0\r\nfor i in range (1, n + 1):\r\n user_input = input()\r\n t, d = user_input.split()\r\n d = int(d)\r\n if t == '+':\r\n k = k + d\r\n elif t == '-':\r\n if k - d < 0:\r\n c = c + 1\r\n else:\r\n k = k - d\r\nprint(k, c)", "operations, ice_creams = map(int, input().split())\r\nsad = 0\r\n\r\nfor i in range(operations):\r\n h, num = input().split()\r\n num = int(num)\r\n if h == '+':\r\n ice_creams += num\r\n if h == '-':\r\n if num <= ice_creams:\r\n ice_creams -= num\r\n else:\r\n sad += 1\r\n\r\nprint(ice_creams, sad)\r\n\r\n", "\r\n#s = []\r\nn, x= map(int, input().split())\r\n\r\ndist = 0\r\nfor i in range(n):\r\n s = input()\r\n temp = int(s[1:].strip())\r\n if(s[0]=='-'):\r\n if (temp<=x):\r\n x = x - temp\r\n else:\r\n dist = dist + 1\r\n elif(s[0]=='+'):\r\n x = x + temp\r\n \r\nprint(x,dist)", "start = input('').split(' ')\r\nmoves = int(start[0])\r\nice_cream = int(start[1])\r\n\r\ndistress_kids = 0\r\n\r\nfor i in range(moves):\r\n queue = input('').split(' ')\r\n\r\n ice_cream_required = int(queue[1])\r\n\r\n if queue[0] == '+':\r\n ice_cream += ice_cream_required\r\n else:\r\n if ice_cream < ice_cream_required:\r\n distress_kids += 1\r\n else:\r\n ice_cream -= ice_cream_required\r\n\r\nprint(f'{ice_cream} {distress_kids}')", "n,t=map(int,input().split())\r\nd=0\r\nfor i in range(n):\r\n s=input().split()\r\n if s[0]==\"+\":\r\n t+=int(s[1])\r\n else:\r\n if t-int(s[1])>=0:\r\n t-=int(s[1])\r\n else:\r\n d+=1\r\nprint(t,d)", "n,x=map(int,input().split())\r\nc=0\r\nfor i in range(n):\r\n s,a=map(str,input().split())\r\n if(s==\"+\"):\r\n x+=int(a)\r\n if(s==\"-\"):\r\n if(int(a)<=x):\r\n x-=int(a)\r\n else:\r\n c+=1\r\nprint(x,c)\r\n \r\n\r\n", "n,x = map(int,input().split())\r\nd = 0\r\nfor i in range(n):\r\n s,c = input().split()\r\n c = int(c)\r\n if s == \"+\" :\r\n x += c\r\n else :\r\n if c > x :\r\n d+=1\r\n continue\r\n x-=c\r\nprint(x,d)", "# t = int(input())\n# t = 1\n# # n, m = map(int, input().split())\n# # a = list(map(int, input().split()))\n# # a.sort()\nimport math\nfrom collections import Counter\n\nt, m = map(int, input().split())\nbye = 0\nwhile t != 0:\n a, b = map(str, input().split())\n if a == \"+\":\n m += int(b)\n else:\n if m - int(b) < 0:\n bye += 1\n else:\n m -= int(b)\n t -= 1\nprint(m, bye)\n", "n, x = map(int, input().split())\r\ndis = 0\r\nfor t in range(n):\r\n sign, num = input().split(maxsplit = 1)\r\n if sign == '+':\r\n x += int(num)\r\n else:\r\n if x >= int(num):\r\n x -= int(num)\r\n else:\r\n dis += 1\r\nprint(x, dis)", "n,x=[int(i) for i in input().split()]\r\nq=[]\r\nc=0\r\nfor i in range(n):\r\n i,n=input().split()\r\n if i=='+':\r\n q+=[int(n)]\r\n else:\r\n q+=[-int(n)]\r\nfor i in q:\r\n x+=i\r\n if x<0:\r\n c+=1\r\n x-=i\r\n\r\n\r\nprint(x,c)\r\n\r\n\r\n\r\n", "n,x = [int(x) for x in input().split()]\r\ns = []\r\nv = []\r\nfor i in range(n):\r\n a = list(input().split())\r\n s.append(a[0])\r\n v.append(int(a[1]))\r\ndc = 0\r\nfor i in range(n):\r\n if s[i] == '+':\r\n x+=v[i]\r\n elif s[i] == '-':\r\n if v[i]>x:\r\n dc+=1\r\n else:\r\n x-=v[i]\r\nprint(x,dc)", "n, x = map(int, input().split())\r\np = 0\r\nfor i in range(n):\r\n t = eval(input())\r\n if x+t<0:\r\n p += 1\r\n else:\r\n x += t\r\nprint(x, p)", "n,s=list(map(int,input().split()))\r\ng=0\r\nx=s\r\nfor i in range(n):\r\n m,d=list(input().split())\r\n if m==\"+\":\r\n s+=int(d) \r\n x+=int(d)\r\n if m==\"-\":\r\n x-=int(d)\r\n if m==\"-\" and int(d)<=s:\r\n s-=int(d)\r\n if x<0:\r\n g+=1\r\n x=s\r\nprint(s,g)\r\n", "n,x = map(int,input().split())\r\ncur = x\r\nd = 0\r\nfor _ in range(n):\r\n s = input()\r\n if s[0] == '+':\r\n cur += int(s[2:])\r\n else:\r\n ice = int(s[2:])\r\n if cur < ice:\r\n d += 1\r\n else:\r\n cur -= ice\r\nprint(cur,d)", "people, packs = input().split()\r\npeople = int(people)\r\npacks = int(packs)\r\ndistress = 0\r\n\r\nfor i in range(people):\r\n action, pack = input().split()\r\n if action == \"+\":\r\n packs += int(pack)\r\n elif action == \"-\" and packs >= int(pack):\r\n packs -= int(pack)\r\n elif action == \"-\" and packs < int(pack):\r\n distress += 1\r\n\r\n\r\nprint(f\"{packs} {distress}\", end=\"\")", "n,c = map(int,input().split())\r\nans = 0\r\nfor i in range(n):\r\n s = input()\r\n if s[0]=='+':\r\n c+= int(s[2:])\r\n else:\r\n c-=int(s[2:])\r\n if c<0:\r\n ans+=1\r\n c+=int(s[2:]) \r\nprint(c,\" \",ans)\r\n \r\n \r\n ", "n,x = map(int,input().split())\r\nc = x\r\ny = 0\r\nfor i in range(n):\r\n u = input().split(\" \")\r\n if u[0] == '+':\r\n c += int(u[1])\r\n else:\r\n k = int(u[1])\r\n if k<=c:\r\n c -= int(u[1])\r\n else:\r\n y+=1\r\nprint(c,y)\r\n \r\n", "n, x = map(int, input().split())\n\ndistressed = 0\nfor i in range(n):\n r = str(input())\n sign = r[0]\n number = int(r[2:len(r)])\n if sign == '+':\n x = x + number\n else:\n if number <= x:\n x = x - number\n else:\n distressed += 1\nprint(x, distressed)", "n,x = map(int,input().split())\nc = 0\nfor i in range(n):\n a, b = map(str,input().split())\n if(a==\"+\"):\n x+=int(b)\n elif(int(b)<=x):\n x-=int(b)\n else:\n c+=1\nprint(x,c)\n\t \t \t\t\t\t\t\t \t \t \t \t\t", "n, x = [int(i) for i in input().split()]\ndis = 0\nwhile n:\n n-=1\n a, b = input().split()\n if a == \"+\":\n x += int(b)\n else:\n if x >= int(b):\n x -= int(b)\n else:\n dis += 1\nprint(x, dis)\n", "n,x = map(int,input().split())\r\ncount = 0\r\nfor i in range(n):\r\n sign,d = map(str,input().split())\r\n packs = int(d)\r\n if(sign == '+'):\r\n x += packs\r\n elif(sign == '-' and x - packs >= 0):\r\n x -= packs\r\n elif(sign == '-' and x - packs < 0):\r\n count += 1\r\nprint(x,count)", "n, x = map(int, input().split())\r\nc = 0\r\nfor i in range(n):\r\n a, b = input().split()\r\n a, b = [str(a), int(b)]\r\n if a == \"+\":\r\n x = x+b\r\n else:\r\n if x < b:\r\n c = c+1\r\n else:\r\n x = x - b\r\nprint(x, c)\r\n", "opnum, packs = map(int,input().split())\ncount = 0\nfor i in range(opnum):\n op = input()\n if op[0] == '+':\n packs+=int(op[2:])\n elif op[0] == '-':\n packs-=int(op[2:])\n if packs < 0:\n count+=1\n packs+=int(op[2:])\nprint(packs,'',count)", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Sun Nov 29 19:05:06 2020\r\n\r\n@author: lenovo\r\n\"\"\"\r\n\r\nchild=0\r\nn,x=map(int,input().split())\r\nfor i in range(n):\r\n values=input().split()\r\n if values[0]=='+':\r\n x=x+int(values[1])\r\n else:\r\n if x>=int(values[1]):\r\n x=x-int(values[1])\r\n else:\r\n child=child+1\r\nans=[x,child]\r\nprint(*ans)", "n,x = map(int,input().split())\r\nc = 0\r\nfor i in range(n):\r\n l = input().split()\r\n dx = int(l[1])\r\n if l[0]=='+':\r\n x += dx\r\n else:\r\n if x>=dx: x -= dx\r\n else: c += 1\r\nprint(x,c)\r\n ", "n,x=map(int,input().split())\r\nice=x;kid=0\r\nfor i in range(n):\r\n a,b=(x for x in input().split())\r\n b=int(b)\r\n if(a=='+'):\r\n ice+=b\r\n elif(a=='-' and ice>=b):\r\n ice-=b\r\n else:\r\n kid+=1\r\nprint(ice,kid)\r\n\r\n", "ip = list(map(int, input().strip().split()))[:]\r\nsz = ip[0]\r\npacks = ip[1]\r\ndis = 0\r\nfor i in range(sz):\r\n ip2 = list(input().split(\" \"))\r\n if ip2[0] == \"+\":\r\n packs += int(ip2[1])\r\n else:\r\n if int(ip2[1]) > packs:\r\n dis += 1\r\n else:\r\n packs -= int(ip2[1])\r\nprint(str(packs) + \" \" + str(dis))\r\n", "temp = [int(x) for x in input().split()]\nn = temp[0]\nice_cream = temp[1]\ndistressed = 0\nfor i in range(n):\n line = input().split(\" \")\n if line[0] == '+':\n ice_cream += int(line[1])\n else:\n wtb = int(line[1])\n if ice_cream - wtb < 0:\n distressed += 1\n else:\n ice_cream -= wtb\nprint(f\"{ice_cream} {distressed}\")\n \t\t\t\t \t \t\t \t\t\t \t\t\t", "n,x=map(int,input().split())\r\ndk=0\r\nwhile n>0:\r\n n-=1\r\n a,b=input().split()\r\n if a=='+':\r\n x+=int(b)\r\n else:\r\n if x>=int(b):\r\n x-=int(b)\r\n else:\r\n dk+=1 \r\nprint(x,dk)\r\n\r\n\r\n", "\r\nn, x = map(int, input().split())\r\ndeP = 0\r\nfor i in range(n):\r\n s = input().split()\r\n sign = s[0]\r\n number = int(s[1])\r\n if sign == '+':\r\n x +=number\r\n else:\r\n if number > x:\r\n deP +=1\r\n else:\r\n x -= number\r\nprint(f'{x} {deP}')\r\n", "c,x=map(int,input().split())\ncounter=0\nfor i in range(c):\n sign,k=input().split()\n k= int(k)\n if sign == \"+\":\n x+=k\n elif sign==\"-\"and x >= k:\n x-=k\n else:\n counter+=1\nprint(x,counter)\n \t \t \t\t\t\t \t\t \t \t \t \t\t \t\t \t", "n,x = [int(x) for x in input().split()]\ndis = 0\nfor i in range(n):\n hey = input()\n num = (-2*int(hey[0]==\"-\")+1) * int(hey[2:])\n if(x+num>=0):\n x+= num\n else:\n dis += 1\nprint(x,dis)\n", "def icecream(s, a):\r\n c = s\r\n d = 0\r\n for j in a:\r\n if j[0] == \"+\":\r\n c += int(j[1])\r\n else:\r\n if c >= int(j[1]):\r\n c -= int(j[1])\r\n else:\r\n d += 1\r\n return str(c) + \" \" + str(d)\r\n\r\n\r\nn = list(map(int, input().split()))\r\nar = []\r\nfor i in range(n[0]):\r\n ar.append(list(input().split()))\r\nprint(icecream(n[1], ar))\r\n", "n, s = [int(x) for x in input().split()]\r\nremaining_packs = s\r\ndistressed_kids = 0\r\nfor i in range(n):\r\n sign, num = input().split()\r\n num = int(num)\r\n if sign == \"+\":\r\n remaining_packs += num\r\n else:\r\n if remaining_packs >= num:\r\n remaining_packs -= num\r\n else:\r\n distressed_kids += 1\r\nprint(remaining_packs, distressed_kids)", "n_x = list(map(lambda e: eval(e), input().split(\" \")))\r\ninitial = n_x[1]\r\ndistressed = 0\r\nfor i in range(n_x[0]):\r\n input_list = input().split(\" \")\r\n \r\n if input_list[0] == \"-\":\r\n if eval(input_list[1]) > initial:\r\n distressed += 1\r\n else:\r\n initial -= eval(input_list[1])\r\n else:\r\n initial += eval(input_list[1])\r\n \r\nprint(initial, distressed) ", "a,b = map(int,input().split())\r\ns=0\r\nwhile a>0:\r\n a-=1\r\n d,f= map(str ,input().split())\r\n f = int(f)\r\n if d == \"+\":\r\n b+=f\r\n elif b-f<0:\r\n s+=1\r\n else:\r\n b-=f\r\nprint(b,s)\r\n", "s=input().split()\r\nn,x=int(s[0]),int(s[1])\r\n\r\nc=0\r\nd=x\r\nfor i in range(n):\r\n s2=input().split()\r\n if(s2[0]=='+'):\r\n d+=int(s2[1])\r\n if(s2[0]=='-'):\r\n if(int(s2[1])>d):\r\n c+=1\r\n else:\r\n d-=int(s2[1])\r\nprint(d,' ',c)", "t=input()\r\nn=int(t.split()[0])\r\nx=int(t.split()[1])\r\nd=0\r\nfor i in range(n):\r\n c=input()\r\n c1=c.split()[0]\r\n c2=int(c.split()[1])\r\n if c1==\"+\": x=x+c2\r\n elif x-c2<0: d=d+1\r\n else: x=x-c2\r\nprint(x,d)\r\n \r\n", "n,x=map(int,input().split())\r\nl=[]\r\np=0\r\nfor i in range(n):\r\n s,f=input().split()\r\n f=int(f)\r\n l.extend([s,f])\r\nfor i in range(0,n*2,2):\r\n if l[i]=='+':\r\n x+=l[i+1]\r\n elif x>=l[i+1]:\r\n x-=l[i+1]\r\n else:\r\n p+=1\r\nprint(x,p)", "a,b = list(map(int, input().split()))\nkid = 0\nfor i in range(a):\n x,y = list(input().split())\n if x == '+':\n b += int(y)\n elif x == '-':\n if b >= int(y):\n b -= int(y)\n elif b < int(y):\n kid+=1\nprint(b,kid)\n", "n,x = map(int,input().split())\r\nk=0\r\nsu=x\r\nfor i in range(n):\r\n a=input().split()\r\n b=int(a[1])\r\n a=a[0]\r\n if a=='+':\r\n su+=b\r\n else:\r\n if su>=b:\r\n su-=b\r\n else:\r\n k+=1\r\nprint(su,k)", "n, x = map(int, input().split())\r\nc = 0\r\nfor i in range(n):\r\n s = input().split()\r\n if s[0] == '+':\r\n x += int(s[1])\r\n elif s[0] == '-' and int(s[1]) <= x:\r\n x -= int(s[1])\r\n else:\r\n c += 1\r\nprint(x, c)", "n,x = map(int,input().split())\r\nans = 0\r\nfor i in range(n):\r\n s = input().split()\r\n if s[0] == \"+\":\r\n x += int(s[1])\r\n else:\r\n if x < int(s[1]):\r\n ans+=1\r\n else:\r\n x -= int(s[1])\r\nprint(f\"{x} {ans}\")", "a, b = map(int, input().split())\r\nrejectKid = 0\r\nfor i in range(a):\r\n c, d= map(str, input().split())\r\n if c==\"+\":\r\n b+=int(d)\r\n elif b-int(d)<0:\r\n rejectKid+=1\r\n else:\r\n b-=int(d)\r\nprint(b,rejectKid)", "#By Anan instagram: anan.ssw\r\nn,x=map(int,input().split())\r\ndis=0\r\nfor _ in range(n):\r\n s,d=input().split()\r\n if s=='+':\r\n x+=int(d)\r\n elif s=='-' and int(d)<=x:\r\n x-=int(d)\r\n else:\r\n dis+=1\r\nprint(x,dis)", "n, x = [int(i) for i in input().split()]\r\nice = x\r\nsad = 0\r\nfor i in range(n):\r\n b = input()\r\n if b[0] == '+':\r\n ice += int(b[2:])\r\n else:\r\n if ice >= int(b[2:]):\r\n ice -= int(b[2:])\r\n else:\r\n sad += 1\r\nprint(ice, sad)", "# 1\r\n'''\r\nn, m = map(int, input().split())\r\nq = float('inf') # + бесконечность\r\nfor i in range(n):\r\n a, b = map(int, input().split())\r\n if a / b * m < q:\r\n q = a / b * m\r\nprint(q)\r\n'''\r\n# 2\r\n'''\r\nn, b, d = map(int, input().split())\r\na = [int(i) for i in input().split()]\r\nq = 0\r\nw = 0\r\nfor i in a:\r\n if i <= b:\r\n q += i\r\n if q > d:\r\n w += 1\r\n q = 0\r\nprint(w)\r\n\r\n# 3\r\n\r\nn = int(input())\r\na = input()\r\nq = 0\r\nw = 0\r\nfor i in range(n - 1):\r\n if a[i:i + 2] == 'SF':\r\n q += 1\r\n elif a[i:i + 2] == 'FS':\r\n w += 1\r\nif q > w:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n\r\n# 4\r\n\r\nn = int(input())\r\nq = 0\r\nfor i in range(n):\r\n a, b, c = input().split()\r\n if int(b) >= 2400 and int(b) < int(c):\r\n q += 1\r\nif q > 0:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n'''\r\n\r\n# 686 A\r\n\r\nn, x = map(int, input().split())\r\nw = 0\r\nfor i in range(n):\r\n q, d = input().split()\r\n if q == '+':\r\n x += int(d)\r\n else:\r\n if x - int(d) < 0:\r\n w += 1\r\n else:\r\n x -= int(d)\r\nprint(x, w)\r\n\r\n \r\n\r\n\r\n ", "n, ice = (int(i) for i in input().split())\r\ndistress = 0\r\nfor i in range(n):\r\n s, d = (i for i in input().split())\r\n d = int(d)\r\n if s == '+':\r\n ice += d\r\n elif s == '-' and ice >= d:\r\n ice -= d\r\n else:\r\n distress += 1\r\nprint(ice, distress)", "\r\nnums = list(map(int, input().split()))\r\ncount_boy = 0\r\ncount_ice = nums[1]\r\nfor i in range(nums[0]):\r\n order = input().split(' ')\r\n if order[0] == '+':\r\n count_ice += int(order[1])\r\n else:\r\n if count_ice >= int(order[1]):\r\n count_ice -= int(order[1])\r\n else:\r\n count_boy += 1\r\nprint(str(count_ice) + ' ' + str(count_boy))\r\n", "n,m=map(int,input().split())\r\nd=0\r\nfor i in range(n):\r\n a,b=map(str,input().split())\r\n if a=='+':\r\n m+=int(b)\r\n elif a=='-':\r\n if m>=int(b):\r\n m-=int(b)\r\n else:\r\n d+=1\r\nprint(m,d)", "t,x= map(int,input().split())\r\nc=0\r\nfor _ in range(t):\r\n # c=0\r\n l=list(input().split())\r\n l[1]=int(l[1])\r\n if l[0]==\"+\":\r\n x=x+l[1]\r\n elif l[0]==\"-\" and l[1]<=x:\r\n x=x-l[1]\r\n elif l[0]==\"-\" and l[1]>x:\r\n c+=1\r\nprint(x,c)\r\n", "n,x=map(int,input().split())\r\nsum=x\r\nd=0\r\nfor i in range(n):\r\n a=int(''.join(input().split()))\r\n if a>0:\r\n sum+=a\r\n else:\r\n if sum+a<0:\r\n d+=1\r\n else:\r\n sum+=a\r\nprint(sum,d) ", "n, a = map(int, input().split())\nq = []\nc = 0\nfor i in range(n):\n\ts = input().split()\n\tif s[0] == '+':\n\t\ta += int(s[1])\n\telif s[0] == '-':\n\t\tif a >= int(s[1]):\n\t\t\ta -= int(s[1])\n\t\telse:\n\t\t\tc+=1\nprint(a, c)\n\t\t \t\t\t \t\t \t \t\t \t \t\t \t \t\t", "a,b = map(int,input().split())\r\nc = 0\r\nfor i in range(a):\r\n m,n = map(str,input().split())\r\n if m==\"+\":\r\n b+=int(n)\r\n elif m==\"-\":\r\n if int(n)>b:\r\n c+=1\r\n else:\r\n b-=int(n)\r\nprint(b,c)", "number_of_queue_and_number_of_ice_cream=list(map(int,input().split()))\r\ntotal_ice_cream=number_of_queue_and_number_of_ice_cream[1]\r\nqueue=list()\r\nnumber_of_distress_kids=0\r\nfor i in range(number_of_queue_and_number_of_ice_cream[0]):\r\n carrier=input().split()\r\n sign=carrier[0]\r\n number=int(carrier[1])\r\n time=(sign,number)\r\n queue.append(time)\r\nj=0\r\nwhile j < len(queue):\r\n if queue[j][0]==\"+\":\r\n total_ice_cream+=queue[j][1]\r\n else:\r\n if total_ice_cream>=queue[j][1]:\r\n total_ice_cream-=queue[j][1]\r\n else:\r\n number_of_distress_kids+=1\r\n j+=1\r\nprint(total_ice_cream,number_of_distress_kids)", "n, x = map(int, input().split())\ncount = 0\nfor i in range(n):\n s = input().split()\n y = int(s[1])\n if s[0] == '+':\n x += y\n elif s[0] == '-':\n if x >= y:\n x -= y\n else:\n count += 1\nprint(x, count)\n\t \t\t\t\t \t \t \t\t \t \t\t \t\t", "x,y=map(int,input().split())\r\nm=0\r\nfor i in range(x):\r\n t,l=map(str,input().split())\r\n l=int(l)\r\n if t==\"+\":\r\n y=y+l\r\n elif t==\"-\":\r\n if l>y:\r\n m=m+1\r\n else:\r\n y=y-l\r\nprint(y ,m)", "n,x = map(int,input().split())\r\nls = []\r\ncount = 0\r\nfor t in range(n):\r\n arr = list(input().split())\r\n ls.append(arr)\r\nfor i in range(len(ls)):\r\n if ls[i][0] == '+':\r\n x += int(ls[i][1])\r\n if ls[i][0] == '-' and x >= int(ls[i][1]):\r\n x -= int(ls[i][1])\r\n elif ls[i][0] == '-' and x < int(ls[i][1]):\r\n count += 1\r\nprint(x,count)\r\n\r\n\r\n", "n,m=map(int,input().split())\r\ncnt=0\r\nfor i in range(n):\r\n a,b=input().split()\r\n b=int(b)\r\n if(a==\"+\"):\r\n m+=b\r\n elif(b<=m):\r\n m-=b\r\n else:\r\n cnt+=1\r\nprint(m,cnt)\r\n", "n, ans = map(int, input().split())\r\nd = 0\r\nfor i in range(n):\r\n p = input()\r\n if \"+ \" in p:\r\n p = p.replace(\"+ \", \"\")\r\n ans += int(p)\r\n else:\r\n p = p.replace(\"- \", \"\")\r\n p = int(p)\r\n if ans >= p:\r\n ans -= p\r\n else:\r\n d += 1\r\nprint(ans, d)", "n,x = map(int, input().split())\r\ndst = 0\r\nfor i in range(n):\r\n inp = input().split()\r\n inp[-1] = int(inp[-1])\r\n if inp[0] == \"+\":\r\n x += inp[-1]\r\n else:\r\n if x < inp[-1]:\r\n dst += 1\r\n else:\r\n x -= inp[-1]\r\nprint(f\"{x} {dst}\")", "class Solution:\r\n\tdef __init__(self):\r\n\t\tpass\r\n\r\n\tdef solve(self):\r\n\t\tresult_list = []\r\n\t\tn, x = map(int, input().split())\r\n\t\tdistressed = 0\r\n\r\n\t\tfor i in range(n):\r\n\t\t\top, d = input().split()\r\n\t\t\td = int(d)\r\n\t\t\t\r\n\t\t\tif op == '+':\r\n\t\t\t\tx += d\r\n\t\t\telse:\r\n\t\t\t\tif x >= d:\r\n\t\t\t\t\tx -= d\r\n\t\t\t\telse:\r\n\t\t\t\t\tdistressed += 1\r\n\r\n\t\tprint(str(x) + \" \" + str(distressed))\r\n\r\n\r\nif __name__ == \"__main__\":\r\n\tsol = Solution()\r\n\tsol.solve()\r\n", "ri=lambda:map(int,input().split())\r\nimport math\r\ndef f():\r\n n,m=ri()\r\n gr=0\r\n for _ in range(n):\r\n s=input()\r\n if s[0]==\"+\":\r\n m+=int(s[2:])\r\n else:\r\n if m-int(s[2:])>=0:\r\n m-=int(s[2:])\r\n else:\r\n gr+=1\r\n print(m,gr)\r\nf()\r\n \r\n", "n,x = input().split()\r\ncount = int(x)\r\ndiss = 0\r\nfor i in range(int(n)):\r\n a,b = input().split()\r\n if a == '+':\r\n count += int(b)\r\n else:\r\n if count < int(b):\r\n diss += 1\r\n continue\r\n else:\r\n count -= int(b)\r\nprint(str(count) + ' ' + str(diss))", "a,b=map(int,input().split());z=0\r\nfor case in ' '*a:\r\n c=int(input().replace(' ',''))\r\n if b+c<0:z+=1\r\n else:b=b+c\r\nprint(b,z)", "n, x= input().split()\nn = int(n)\nx = int(x)\nsum = 0\nfor i in range(n):\n a ,d= input().split()\n d = int (d)\n if a == \"-\":\n if x -d >=0:\n x -= d\n else:\n sum += 1\n\n else:\n x +=d\nprint(x, sum)\n \t \t \t \t \t \t \t\t \t\t \t \t", "tm = input().split()\r\nn = int(tm[0])\r\nx = int(tm[1])\r\nit = 0\r\nfor _ in range(n):\r\n tm = input().split()\r\n d = int(tm[1])\r\n if tm[0] == '+':\r\n x += d\r\n else:\r\n if d > x:\r\n it += 1\r\n else:\r\n x -= d\r\nprint(x, it)", "## variables\r\nopnum = list(map(int,input().split()))\r\ndischild = 0\r\n## looping on operations\r\nfor i in range(int(opnum[0])):\r\n## fuctionality of the problem\r\n \r\n # input the opertions\r\n opinp = input().split()\r\n # increase or decrease the icecream packs and distressed children\r\n if opinp[0] == '+':\r\n opnum[1] += int(opinp[1]) \r\n elif opinp[0] == '-': \r\n if opnum[1] >= int(opinp[1]):\r\n opnum[1] -= int(opinp[1])\r\n else:\r\n dischild += 1\r\n \r\n \r\n \r\n# output \r\nprint(f\"{opnum[1]} {dischild}\")", "#!/usr/bin/python3\n\nimport sys\nimport argparse\nimport json\n\ndef main():\n kids, cream_count = map(int, sys.stdin.readline().rstrip().split(\" \"))\n\n distressed_count = 0\n\n for kid in range(0, kids):\n take_or_leave, count = sys.stdin.readline().rstrip().split(\" \")\n count = int(count)\n if take_or_leave == \"+\":\n cream_count += count\n else:\n if (cream_count - count) < 0:\n distressed_count += 1\n else:\n cream_count -= count\n\n print(\"%s %s\" % (cream_count, distressed_count))\n\ndef get_tests():\n #tests = [(\"512 4\", \"50\")]\n\n for test in tests:\n print(json.dumps({\"input\": test[0], \"output\": test[1]}))\n\nif __name__ == \"__main__\":\n parser = argparse.ArgumentParser()\n parser.add_argument(\"--get-tests\", action=\"store_true\")\n args = parser.parse_args()\n\n if args.get_tests:\n get_tests()\n else:\n main()\n", "input1 = list(map(int, input().split()))\r\niter = input1[0]\r\npackTot = input1[1]\r\ndScore = 0\r\n\r\nfor i in range(iter):\r\n input2 = list(input().split())\r\n if(input2[0] == '+'):\r\n packTot += int(input2[1])\r\n else:\r\n if(packTot - int(input2[1]) < 0):\r\n dScore += 1\r\n else:\r\n packTot -= int(input2[1])\r\n\r\nprint(str(packTot) + \" \" + str(dScore))\r\n", "num , packs = map(int,input().split())\r\ny = 0\r\nfor i in range(num):\r\n s = []\r\n a = input()\r\n for h in a :\r\n if not h ==' ':\r\n s.append(h)\r\n j = ''.join(s)\r\n test = packs + int(j)\r\n if test >= 0:\r\n packs= packs + int(j)\r\n else:\r\n y +=1\r\nprint(str(packs) +\" \"+ str(y) )\r\n", "li = [int(i) for i in input().split()]\r\nn = li[0]\r\nx = li[1]\r\nc = 0\r\nwhile n:\r\n li1 = [i for i in input().split()]\r\n ch = li1[0]\r\n m = int(li1[1])\r\n if(ch == \"+\"):\r\n x += m\r\n elif(ch == \"-\"):\r\n if x < m:\r\n c += 1\r\n else :\r\n x -= m\r\n n -= 1\r\nprint(x,c)", "# Author : //- kibrom Hailu -\\\\\r\n\r\nfrom sys import stdin,stdout\r\nfrom collections import Counter,defaultdict , deque \r\nfrom bisect import bisect , bisect_left ,bisect_right \r\nfrom itertools import accumulate \r\nfrom heapq import heapify , heappop , heappush , heappushpop , heapreplace\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 n,x = II()\r\n curr = x \r\n distress = 0\r\n for _ in range(n):\r\n sign,val = input().split() \r\n num = int(sign+val)\r\n if curr + num < 0:\r\n distress += 1 \r\n else:\r\n curr += num \r\n \r\n print(curr,distress)\r\n\r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\nsolve()\r\n", "n, x = map(int,input().split())\r\nk = 0\r\nfor i in range(n):\r\n\tsign, qua = input().split()\r\n\tqua = int(qua)\r\n\tif sign == \"+\":\r\n\t\tx += qua\r\n\telse:\r\n\t\tif x < qua:\r\n\t\t\tk += 1\r\n\t\telse:\r\n\t\t\tx-= qua\r\n \r\nprint(x,k)", "n,x=input().split()\nn=int(n)\ndis=0\nx=int(x)\ns=x\nfor i in range (0,n):\n a,b=input().split()\n b=int(b)\n if(a=='+'):\n s=s+b\n else:\n if(s>=b):\n s=s-b\n else:\n dis=dis+1\nprint(s,end=\" \")\nprint(dis)\n \t \t \t\t \t\t \t \t\t \t \t\t\t\t", "# A. Free Ice Cream\r\n# https://codeforces.com/contest/71/problem/A\r\n# not yet translated to c++ and java\r\n# Result: Not Yet\r\n\r\n\r\ninputs = input().split(\" \")\r\ninputs = [int(x) for x in inputs]\r\n\r\nn_comers = inputs[0]\r\nstore_packs = inputs[1]\r\ndistressed_child = 0\r\nfor i in range(n_comers):\r\n record = input().split(\" \")\r\n if record[0] == \"+\":\r\n store_packs += int(record[1])\r\n if record[0] == \"-\":\r\n if store_packs >= int(record[1]):\r\n store_packs -= int(record[1])\r\n else:\r\n distressed_child += 1\r\nprint(f'{store_packs} {distressed_child}')", "import sys\nd=0\nt,a=map(int,sys.stdin.readline().split())\nfor _ in range(t):\n\ts = sys.stdin.readline().strip()\n\n\tif(s[:2]==\"+ \"):\n\t\ta=a+int(s[2:])\n\telse:\n\t\tif(a>=int(s[2:])):\n\t\t\ta=a-int(s[2:])\n\t\telse:\n\t\t\td=d+1\nsys.stdout.write(str(a)+\" \")\nsys.stdout.write(str(d))\n \t \t\t \t\t\t\t \t\t\t \t \t \t\t\t \t \t \t", "n, x = map(int, input().split())\r\nd = 0\r\n\r\nfor i in range(n):\r\n\ta, b = map(str, input().split())\r\n\tif a=='+':\r\n\t\tx+=int(b)\r\n\telse:\r\n\t\tif x>=int(b):\r\n\t\t\tx-=int(b)\r\n\t\telse:\r\n\t\t\td+=1\r\n\t\t\t\r\nprint(str(x)+' '+str(d))", "n, x = list(map(int, input().split()))\n\ndistressed_children = 0\nfor _ in range(n):\n sign, d = input().split()\n d = int(d)\n if sign == '-' and d > x: distressed_children += 1\n else:\n x = x - d if sign == '-' else x + d\nprint(x, distressed_children)\n", "n,x=map(int,input().split())\r\nans1=x\r\nans2=0\r\nfor i in range(0,n):\r\n a,b=map(str,input().split())\r\n if a==\"+\":\r\n ans1+=int(b)\r\n if a==\"-\":\r\n if ans1<int(b):\r\n ans2+=1\r\n else:\r\n ans1-=int(b)\r\nprint(ans1,ans2)\r\n", "n,x=map(int,input().split())\r\ndistress=0\r\nfor i in range(n):\r\n c,p=input().split()\r\n num=int(p)\r\n if(c=='+'):\r\n x+=num\r\n elif(c=='-'):\r\n if(num>x):\r\n distress+=1\r\n else:\r\n x-=num\r\nprint(x,distress)", "n, x = map(int, input().split())\r\ndistress = 0\r\nfor _ in range(n):\r\n val = input().split()\r\n if val[0] == \"-\": val = -1 * int(val[1])\r\n elif val[0] == \"+\": val = int(val[1])\r\n if x + val < 0: distress += 1\r\n else: x += val\r\nprint(x, distress)\r\n\r\n", "x = list(map(int,input().split())) \r\nitera = x[0]\r\nstart = x[1]\r\nc = 0\r\nfor i in range(0,itera):\r\n Line = list(map(str,input().split()))\r\n Line[1] = int(Line[1])\r\n if Line[0] == '-':\r\n Line[1] = Line[1] * -1\r\n start = start + Line[1]\r\n if start < 0:\r\n c = c + 1\r\n start = start - Line[1]\r\nprint(start,c)", "n=list(map(int,input().split()))\r\nicecream=n[1]\r\nt=n[0]\r\ncount=0\r\nfor i in range(t):\r\n y=input().split()\r\n x=0\r\n for j in y[1]:\r\n x=x*10+ord(j)-48\r\n\r\n if y[0]=='+':\r\n icecream+=x\r\n else:\r\n if x>icecream:\r\n count+=1\r\n else:\r\n icecream-=x\r\nprint(icecream,count)", "n,x = input().split()\r\nn = int(n)\r\nx = int(x)\r\ns = []\r\nn2 = []\r\nfor i in range(0,n):\r\n s1,n1 = input().split()\r\n n1 = int(n1)\r\n s.append(s1)\r\n n2.append(n1)\r\n\r\ncnt = 0\r\nfor i in range(0,n):\r\n if s[i] == '+':\r\n x = x + n2[i]\r\n else:\r\n if x >= n2[i]:\r\n x = x - n2[i]\r\n else:\r\n cnt = cnt + 1\r\nprint(x,cnt)\r\n ", "a, ihave = input().split()\na = int(a)\nihave = int(ihave)\n\nkidsLeft = 0\npacksTheyHave = 0\n\nfor i in range(a):\n sign, number= input().split()\n number = int(number)\n if(sign == '+'):\n ihave += number\n elif(sign == '-'):\n if number <= ihave:\n ihave -= number\n else:\n kidsLeft += 1 \n \nprint(ihave, kidsLeft)\n\t\t\t \t \t\t\t \t\t \t \t\t \t\t\t\t \t \t", "n,x = map(int,input().split())\r\nhave = x\r\ndistress = 0\r\n\r\nfor _ in range(n):\r\n d = input()\r\n val = int(d[2:])\r\n if (d[0] == '+'):\r\n have += val\r\n elif (have < val):\r\n distress += 1\r\n else:\r\n have -= val\r\n\r\nprint(have,distress)", "n, x = map(int,input().split())\r\nkq = 0\r\nfor _ in range(n):\r\n s = input().split()\r\n s[1] = int(s[1])\r\n if s[0]=='+':\r\n x+=s[1]\r\n else:\r\n if s[1]>x:\r\n kq+=1\r\n else:\r\n x-=s[1]\r\nprint(x,kq)", "n,k=list(map(int,input().split()))\r\nd=0\r\nfor i in range(n):\r\n s=input()\r\n l=s.split()\r\n sign,xi=l[0],int(l[1])\r\n if(sign=='+'):\r\n k+=xi\r\n else:\r\n k-=xi\r\n if(k<0):\r\n d+=1\r\n k+=xi\r\nprint(k,d)", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Sun Jun 7 10:44:10 2020\r\n\r\n@author: Harshal\r\n\"\"\"\r\n\r\n\r\nn,x=map(int,input().split())\r\ndis=0\r\ntot=x\r\nfor i in range(n):\r\n s,a= input().split(' ')\r\n a=int(a)\r\n if s=='-':\r\n a=-1*a\r\n if a<0:\r\n if tot<abs(a):\r\n dis+=1\r\n else:\r\n tot=tot-(abs(a))\r\n else:\r\n tot+=a\r\nprint(tot,dis)\r\n \r\n ", "info = input()\r\n\r\ninfo = info.split(\" \")\r\n\r\nlenz = int(info[0])\r\namountIce = int(info[1])\r\n\r\nstress = 0\r\n\r\nfor i in range(lenz):\r\n\tqueue = input()\r\n\tqueue = queue.split(\" \")\r\n\t\r\n\tif queue[0] == \"+\":\r\n\t\tamountIce += int(queue[1])\r\n\telse:\r\n\t\tif int(queue[1]) <= amountIce:\r\n\t\t\tamountIce -= int(queue[1])\r\n\t\telse:\r\n\t\t\tstress += 1\r\n\t\r\nprint(f\"{amountIce} {stress}\")", "a, b = map(int, input().split(' '))\r\ns = 0\r\nfor i in range(a):\r\n q = input()\r\n if q[0] == '+':\r\n b += int(q[1:len(q)])\r\n else:\r\n if b >= int(q[1:len(q)]):\r\n b -= int(q[1:len(q)])\r\n else:\r\n s += 1\r\nprint(b, s)\r\n", "num=input()\r\nl=num.split()\r\nn=int(l[0])\r\nx=int(l[1])\r\ndc=0\r\nfor g in range(0,n):\r\n line=input()\r\n u=line.split()\r\n if u[0]==\"+\":\r\n x=x+int(u[1])\r\n else:\r\n if int(u[1])>x:\r\n dc=dc+1\r\n else:\r\n x=x-int(u[1])\r\nprint(x,dc)", "m,n=map(int,input().split())\r\nc=0\r\nfor i in range(m):\r\n s,p=map(str,input().split())\r\n if s==\"+\":\r\n n=n+int(p)\r\n elif s==\"-\":\r\n n=n-int(p)\r\n if n<0:\r\n c=c+1\r\n n=n+int(p)\r\nprint(n, c)\r\n", "n1,n2=input().split()\r\nn1=int(n1)\r\nn2=int(n2)\r\nn=0\r\nfor x in range(0,n1):\r\n ls=input().split()\r\n if ls[0]=='+':\r\n n2+=int(ls[1])\r\n elif ls[0]=='-':\r\n if n2>=int(ls[1]):\r\n n2-=int(ls[1])\r\n else:\r\n n+=1\r\nprint(n2,n)\r\n", "a,b=map(int,input().split())\r\ne=0\r\nfor i in range(a):\r\n c,d=map(str,input().split())\r\n if c==\"-\":\r\n if b<int(d):e=e+1\r\n else:b=b-int(d)\r\n else:b=b+int(d)\r\nprint(b,e)", "x,y = map(int,input().split())\nc = 0\nfor i in range(x):\n\ts = input().split()\n\ts1 = int(s[1])\n\tif s[0] == \"+\":\n\t\ty += s1\n\telse:\n\t\tif y < s1:\n\t\t\tc += 1\n\t\telse:\n\t\t\ty -= s1\n\t\t\t\nprint(y,c)\n\t \t\t \t \t \t\t \t \t\t \t \t \t \t", "n , k = [int(i) for i in input().split(\" \")]\r\nnumber_of_distress_kids = 0\r\nfor l in range(n):\r\n packs = input().split(\" \")\r\n if \"+\" in packs:\r\n k += int(packs[1])\r\n else:\r\n if k >= int(packs[1]):\r\n k -= int(packs[1])\r\n else:\r\n number_of_distress_kids +=1\r\nprint(k,number_of_distress_kids)\r\n", "n , x = map(int , input().split())\r\nl = 0 \r\n\r\nfor i in range(n):\r\n s = input().split()\r\n if s[0] == '+':\r\n x += int(s[1])\r\n elif s[0] == '-':\r\n if int(s[1]) <= x:\r\n x -= int(s[1])\r\n else:\r\n l += 1\r\nprint(x,l) ", "tp,ice=map(int,input().split())\r\ndistress=0\r\nfor i in range(tp):\r\n a,b=input().split()\r\n if(a=='+'):\r\n ice+=int(b)\r\n else:\r\n if(int(b)<=ice):\r\n ice-=int(b)\r\n else:\r\n distress+=1\r\nprint(ice,distress) \r\n", "n, x = map(int, input().split())\r\nc = 0\r\nfor _ in range(n):\r\n a = input()\r\n if a[0] == '+':\r\n x += int(a[2:])\r\n else:\r\n if x < int(a[2:]):\r\n c += 1\r\n else:\r\n x -= int(a[2:])\r\nprint(x, c)", "n, x= map(int,input().split())\r\nsad_Boy = 0\r\n\r\nfor i in range(0,n):\r\n\tsymdol, dd = map(str, input().split())\r\n\td = int(dd)\r\n\tif symdol == '+':\r\n\t\tx += d\r\n\telse:\r\n\t\tif x >= d:\r\n\t\t\tx -= d\r\n\t\telse:\r\n\t\t\tsad_Boy+=1\r\nprint(x, sad_Boy)", "a, b = map(int, input().split())\r\nq = 0\r\nfor _ in range(a):\r\n c,d = input().split()\r\n d = int(d)\r\n if c == \"+\":\r\n b = b+d\r\n else:\r\n if b-d < 0:\r\n b = b\r\n q += 1\r\n else:\r\n b = b-d\r\nprint(b,q)", "n,x = [int(x) for x in input().split()] \r\ndistressed = 0 \r\nfor i in range(n): \r\n d = input().split() \r\n if d[0] == '+': \r\n x += int(d[1]) \r\n elif x >= int(d[1]): \r\n x -= int(d[1]) \r\n else: \r\n distressed += 1 \r\nprint(x,distressed)", "import sys\r\nn, m = map(int, input().split())\r\ncnt = 0\r\nfor i in range(n):\r\n arr = [i for i in input().split()]\r\n if arr[0] == '+':\r\n m += int(arr[1])\r\n else:\r\n if m >= int(arr[1]):\r\n m -= int(arr[1])\r\n else:\r\n cnt += 1\r\nprint(m, cnt)", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Sat Jul 23 14:05:54 2022\r\n\r\n@author: Conor\r\n\r\nCFSheet A Problem 26 - CF686-DIV2A\r\n\"\"\"\r\n\r\nkids, stock = map(int,input().split())\r\ndistress = 0\r\n\r\nfor i in range(kids):\r\n typ, amount = map(str,input().split())\r\n amount = int(amount)\r\n if typ == \"+\":\r\n stock += amount\r\n else:\r\n if stock < amount:\r\n distress += 1\r\n else:\r\n stock -= amount\r\nprint(stock, distress)", "import sys\r\ninput = sys.stdin.readline\r\nprint = sys.stdout.write\r\nn, packs = map(int, input().split())\r\nchild = 0\r\nfor _ in range(n):\r\n a, b = input().split()\r\n b = int(b)\r\n if a == '+':\r\n packs += b\r\n else:\r\n if packs < b:\r\n child += 1\r\n continue\r\n packs -= b\r\ncomb = str(packs) + ' ' + str(child)\r\nprint(comb)\r\n", "x, y = input().split(\" \")\na = x,y\na = list(a)\nfor i in range(len(a)):\n a[i]=int(a[i])\ncount=0\nnum =a[1]\nfor i in range(a[0]):\n z,f = input().split(\" \")\n char=z\n inp=int(f)\n if char == '+':\n num = num + inp\n elif char == '-':\n num = num - inp\n if num < 0:\n count+=1\n num = num+inp\n\nprint(num,count)\n\n\n \t \t \t \t \t \t\t \t\t\t \t\t", "\r\nn, available_ice_cream = map(int, input().split())\r\nlines = []\r\nfor i in range(n):\r\n sign, ice_cream_amount = input().split()\r\n ice_cream_amount = int(ice_cream_amount)\r\n lines.append([sign, ice_cream_amount])\r\n\r\ndistress_kids = 0\r\nfor i in lines:\r\n if i[0] == '+':\r\n available_ice_cream += i[1]\r\n if i[0] == '-':\r\n if (available_ice_cream - i[1]) >= 0:\r\n available_ice_cream -= i[1]\r\n else:\r\n distress_kids += 1\r\n\r\n\r\nprint(available_ice_cream, distress_kids)\r\n\r\n", "n, x = map(int, input().split(\" \"))\n\nd = 0\n\nfor i in range(n):\n o, a = input().split(\" \")\n a = int(a)\n\n if o == \"+\":\n x += a\n else:\n if x >= a:\n x -= a\n else:\n d += 1\nprint(x, d)\n", "n,a=map(int,input().split())\ns=0\nfor _ in range(n):\n t,c=map(str,input().split())\n c=int(c)\n if t == \"+\":\n a += c\n elif a >= c:\n a -= c\n else:\n s+= 1\nprint(str(a),str(s))\n\t\t\t \t \t \t\t\t \t \t\t\t\t \t\t", "n,x=map(int,input().split())\r\nc=0\r\nfor i in range(n):\r\n y=input()\r\n if y[0]==\"+\":\r\n x=eval(str(x)+y)\r\n else:\r\n y=int(y[2:])\r\n if x>=y:\r\n x=x-y\r\n else:\r\n c=c+1\r\nprint(x,c)", "x,y=map(int,input().split())\r\nw=0\r\nfor i in range(x):\r\n m,n=map(str,input().split())\r\n if m== \"+\":\r\n y+=int(n)\r\n else:\r\n if y>=int(n):\r\n y-=int(n)\r\n else:\r\n w+=1\r\nprint(y,end=\" \")\r\nprint(w)", "n,x=input().split()\nn=int(n)\nx=int(x)\nsad=0\nfor i in range(n):\n\tchar,k=input().split()\n\tk=int(k)\n\tif char=='+':\n\t\tx+=k\n\telif char=='-':\n\t\tif x-k>=0:\n\t\t\tx-=k\n\t\telse:\n\t\t\tsad+=1\nprint(x,sad)\n\t\t \t \t \t\t \t \t \t\t \t \t\t", "n,x=map(int,input().split())\r\nm=0\r\nfor i in range(n):\r\n a,b=map(str,input().split())\r\n if a==\"+\":\r\n x=(x+int(b))\r\n elif int(b)<=x:\r\n x=(x-int(b))\r\n else:\r\n m+=1\r\nprint(x,m)\r\n", "n,x = map(int,input().split())\r\ntotal=x\r\nleft_child=0\r\nfor i in range(n):\r\n sign,amount = map(str,input().split())\r\n if sign==\"+\":\r\n total+=int(amount)\r\n elif sign==\"-\" and total>=int(amount):\r\n total-=int(amount)\r\n else:\r\n left_child+=1\r\nprint(total,left_child)\r\n ", "ss = input()\r\ncon = ss.split(' ')\r\nx = int(con[1])\r\nn = int(con[0])\r\ndis=0\r\nc=''\r\n\r\nfor i in range(1,1010):\r\n if i>n:\r\n break\r\n s = input()\r\n con = s.split(' ')\r\n c = con[0]\r\n t = int(con[1])\r\n if c=='+':\r\n x+=t\r\n if c=='-':\r\n if x<t:\r\n dis=dis+1\r\n else:\r\n x=x-t\r\nprint(f\"{x} {dis}\")\r\n\r\n", "import math\r\n\r\n# test = int(input())\r\n# for q in range(test):\r\nn, m = map(int, input().split())\r\n# n = int(input())\r\n# s = input()\r\nx = []\r\nfor i in range(n):\r\n s = list(map(str, input().split()))\r\n x.append(s)\r\na = 0\r\nfor i in range(n):\r\n if x[i][0]==\"+\":\r\n m += int(x[i][1])\r\n else:\r\n if m >= int(x[i][1]):\r\n m -= int(x[i][1])\r\n else:\r\n a += 1\r\nprint(m, a)", "n,x=list(map(int,input().split(\" \")))\r\nc=0\r\nfor i in range(n):\r\n d_1,d_2=input().split(\" \")\r\n d_2=int(d_2)\r\n if(d_1==\"-\"and x>=d_2):\r\n x-=d_2\r\n elif(d_1==\"-\"and x<d_2):\r\n c+= 1\r\n elif(d_1==\"+\") :\r\n x+=d_2\r\nprint(x,c) \r\n \r\n", "n,m = map(int,input().split(' '))\r\nres = 0\r\n \r\nfor i in range(n):\r\n s,k = list(input().split(' '))\r\n k = int(k)\r\n if(s == '+'):\r\n m += k\r\n else:\r\n if(k <= m):\r\n m -= k\r\n else:\r\n res += 1\r\n \r\nprint(m,res)\r\n", "t,d=map(int,input().split())\r\nsum=d\r\nc=0\r\nfor i in range(t):\r\n n,m=map(str,input().split())\r\n if str(n)=='+':\r\n sum=sum+int(m)\r\n else:\r\n if sum-int(m)<0:\r\n c=c+1\r\n else:\r\n sum=sum-int(m)\r\nprint(sum,c)", "n, x = map(int, input().split())\r\nice_cream_after = 0\r\nsad_guy = 0\r\nfor i in range(n):\r\n d, d1 = input().split()\r\n if d == '':\r\n break\r\n if d == \"+\":\r\n x += int(d1)\r\n elif d == \"-\" and int(d1) <= x:\r\n x -= int(d1)\r\n else:\r\n sad_guy += 1\r\nprint(x, sad_guy)", "n, x = map(int, input().split())\nd = 0\nfor i in range(0, n):\n v = input().split()\n c = int(v[1])\n if v[0] == \"+\":\n x += c\n else:\n if x >= c:\n x -= c\n else:\n d += 1\nprint(x, d)\n", "s = input().split(\" \")\r\nn = int(s[0])\r\nx = int(s[1])\r\nc = 0\r\nfor i in range(n):\r\n s = input().split(\" \")\r\n s[1] = int(s[1])\r\n if(s[0] == '+'):\r\n x += s[1]\r\n else:\r\n if(x < s[1]):\r\n c += 1\r\n else:\r\n x -= s[1]\r\nprint(str(x)+\" \" + str(c))\r\n \r\n \r\n\r\n \r\n \r\n\r\n \r\n \r\n\r\n", "n, x = map(int, input().split())\r\nstock = x\r\ndistress = 0\r\n\r\nfor _ in range(n):\r\n transaction, d = input().split()\r\n d = int(d)\r\n\r\n if transaction == '+':\r\n stock += d\r\n else:\r\n if stock >= d:\r\n stock -= d\r\n else:\r\n distress += 1\r\n\r\nprint(stock, distress)\r\n", "a,b = map(int,input().split())\r\ncnt = b\r\nsad = 0\r\nfor i in range(a):\r\n s = str(input())\r\n status = False\r\n num = int(s[2:])\r\n if(s[0] == '+'): status = True\r\n \r\n if(status == True): cnt += num\r\n elif(status == False and cnt >= num): cnt -= num\r\n elif(status == False and cnt < num): sad += 1\r\nprint(cnt, sad)", "x, y = [int(item) for item in input().split()]\r\ntemp = 0\r\nfor i in range(x):\r\n a, b = [item for item in input().split()]\r\n if a == '+':\r\n y += int(b)\r\n elif a == '-':\r\n if int(b) > y:\r\n temp += 1\r\n else:\r\n y -= int(b)\r\nprint(y, temp)", "z, x = map(int, input().split())\r\na = x\r\nf = 0\r\nfor i in range(z):\r\n n = input().split()\r\n s = int(n[1])\r\n if n[0] == '+':\r\n a += s\r\n elif n[0] == '-':\r\n if a < s:\r\n a = a\r\n f += 1\r\n else:\r\n a -= s\r\nprint(a,f)", "n1 = input().split()\r\nn = int(n1[0])\r\ninitial = int(n1[-1])\r\nlist1 = []\r\nfor i in range(n):\r\n x=input().split()\r\n list1.append(x)\r\n\r\ndistressed = 0\r\nfor i in range(len(list1)):\r\n \r\n if list1[i][0] == \"+\":\r\n initial +=int(list1[i][-1])\r\n elif list1[i][0] == \"-\":\r\n if initial>=int(list1[i][-1]):\r\n initial = initial - int(list1[i][-1])\r\n elif initial<int(list1[i][-1]):\r\n distressed +=1\r\n continue\r\nprint(initial,distressed)", "num=list(map(int,input().split()))\r\nn=num[0]\r\nx=num[1]\r\ndis=0\r\nfor i in range(n):\r\n a=input()\r\n length=len(a)\r\n number=int(a[2:length])\r\n if a[0]=='+':\r\n x+=number\r\n elif a[0]=='-' and x>=number:\r\n x-=number\r\n elif x<number:\r\n dis+=1\r\nprint(x,dis)", "import sys\r\n\r\ndef main():\r\n inp = sys.stdin.read().strip().split('\\n')\r\n _, x = map(int, inp[0].split())\r\n sad = 0\r\n for s in inp[1:]:\r\n pref, k = s.split()\r\n if pref == '+': x += int(k)\r\n elif int(k) > x: sad += 1\r\n else: x -= int(k)\r\n return x, sad\r\n \r\nprint(*main(), sep=' ')\r\n", "n, x = list(map(int, input().split()))\ndistressedKids = 0\nfor _ in range(n):\n stringo = input()\n if stringo[0] == '+':\n x += int(stringo.split()[1])\n else:\n number = int(stringo.split()[1])\n if x - number >= 0:\n x -= number\n else:\n distressedKids += 1\nprint(x, distressedKids) \n", "nums = input().split()\r\nn = int(nums[0])\r\nx = int(nums[1])\r\ngomdson = 0\r\nfor i in range(n):\r\n oochir = input().split()\r\n if (oochir[0]) == ('+'):\r\n x = x + (int(oochir[1]))\r\n oochir = () \r\n else:\r\n if x >= (int(oochir[1])):\r\n x = x - (int(oochir[1]))\r\n oochir = ()\r\n else:\r\n gomdson = gomdson + 1\r\n oochir = ()\r\n\r\n\r\n\r\n\r\n\r\n\r\nprint (x, gomdson)\r\n\r\n\r\n\r\n\r\n\r\n ", "txt=input()\nn,x=txt.split()\nn=int(n)\nx=int(x)\n\nsad=0\nfor i in range(n):\n txt=input()\n sign,number=txt.split()\n if sign ==\"+\" :\n x=x+int(number)\n else:\n if int(number)<=x:\n x=x-int(number)\n else:\n sad=sad+1\n\n\n\nprint(x,sad)\n\n \t \t \t\t \t \t \t\t \t\t\t\t\t \t\t\t \t\t\t", "queue , packs = map(int,input().split())\ndistressed = 0\nfor _ in range(queue) :\n sign , quantity = input().split()\n quantity = int(quantity)\n if sign == '+':\n packs += quantity\n continue\n if packs < quantity :\n distressed += 1\n continue\n packs -= quantity\nprint(packs,distressed)\n ", "n,x=map(int,input().split())\r\nl=[]\r\nwhile(n):\r\n s,d=map(str,input().split())\r\n if(s=='-'):\r\n if(x>=int(d)):\r\n x = x - int(d)\r\n else:\r\n l.append(d)\r\n elif(s=='+'):\r\n x=x+int(d)\r\n n=n-1\r\nprint(x,len(l))", "n, x = map(int, input().split())\nres = 0\nfor _ in range(n):\n op, d = input().split()\n d = int(d)\n if op == '+':\n x += d\n elif x >= d:\n x -= d\n else:\n res += 1\nprint(x, res)\n", "n, x = map(int, input().split())\nchildrenDismessed = 0\nfor _ in range(n):\n r = input().split()\n if r[0] == '+':\n x += int(r[1])\n else:\n d = int(r[1])\n if d > x:\n childrenDismessed += 1\n else:\n x -= d\nprint(x, childrenDismessed)\n ", "a,b=map(int,input().split())\r\nc=0\r\nfor i in range(a):\r\n x,y=map(str,input().split())\r\n if x=='+':\r\n b=b+int(y)\r\n else:\r\n if b>=int(y):\r\n b-=int(y)\r\n else:\r\n c=c+1\r\nprint(b,c) ", "n, packs = list(map(int, input().split()))\r\ndistressed_child = 0\r\nfor it in range(n):\r\n inp, new_packs = input().split()\r\n new_packs = int(new_packs)\r\n if inp == '+':\r\n packs += new_packs\r\n else:\r\n if new_packs > packs:\r\n distressed_child += 1\r\n continue\r\n packs -= new_packs\r\n\r\nprint(packs, distressed_child)\r\n", "n,s=map(int,input().split())\r\nc=0\r\nfor _ in range(n):\r\n a=input()\r\n if(a[0]=='+'):\r\n s=s+int(a[2:])\r\n elif(a[0]=='-' and s>=int(a[2:])):\r\n s=s-int(a[2:])\r\n else:\r\n c=c+1\r\nprint(s,c)", "def free_ice_cream():\r\n queue, initial = list(map(int, input().split()))\r\n TAKE = \"+\"\r\n GIVE = \"-\"\r\n distress = 0\r\n for person in range(queue):\r\n sign, number = input().split()\r\n number = int(number)\r\n if sign == TAKE:\r\n initial += number\r\n else:\r\n if initial >= number:\r\n initial -= number\r\n else:\r\n distress += 1\r\n print(f\"{initial} {distress}\")\r\nfree_ice_cream()", "people, icecream = [int(i) for i in input().split()]\r\nsad=0\r\nfor i in range(people):\r\n person, things = [i for i in input().split()]\r\n things = int(things)\r\n if person=='+':\r\n icecream+=int(things)\r\n else:\r\n if things<=icecream:\r\n icecream-=things\r\n else:\r\n sad+=1\r\nprint(icecream, sad)", "c,i=map(int,input().split())\r\nv=0\r\nfor _ in range(c):\r\n m,n=input().split() \r\n if m==\"+\":\r\n i+=int(n)\r\n else:\r\n if int(n)>i:\r\n v+=1\r\n else:\r\n i-=int(n) \r\nprint(f\"{i} {v}\")", "c,qua = map(int,input().split())\ncounter = 0\nfor i in range(c):\n sign,k = input().split()\n k = int(k)\n if sign == \"+\":\n qua += k\n elif sign == \"-\" and qua >= k:\n qua -= k\n else:\n counter += 1\nprint(qua,counter)\n\t\t\t \t\t\t\t \t\t\t\t \t \t\t\t \t \t \t\t", "n,x=map(int,input().split())\r\nd=0\r\nfor i in range(n):\r\n s,m=input().split()\r\n m=int(m)\r\n if s==\"+\":\r\n x+=m\r\n else:\r\n if x>=m:\r\n x-=m\r\n else:\r\n d+=1\r\nprint(x,d)", "n,x=map(int,input().split())\r\nt=0\r\nfor i in range(n):\r\n s=[i for i in input().split()]\r\n if s[0]=='+':\r\n x+=int(s[1])\r\n else:\r\n if int(s[1])>x:\r\n t+=1\r\n else:\r\n x-=int(s[1])\r\nans=[str(x),str(t)]\r\nprint(' '.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\r\n\r\n\r\n\r\n\r\n\r\n\r\n ", "# your code goes here\n\nif __name__ == \"__main__\":\n\tn, x = map(int, input().strip().split(' '))\n\ttotalpacks, distressed = x, 0\n\tfor i in range(n):\n\t\ticecream = input().split()\n\t\tc = int(icecream[1])\n\t\tif icecream[0] == '+':\n\t\t\ttotalpacks += c\n\t\telse:\n\t\t\tif totalpacks < c:\n\t\t\t\tdistressed += 1\n\t\t\telse:\n\t\t\t\ttotalpacks = (totalpacks - c)\n\tprint(totalpacks, distressed)\n\t\t\t\t\n\t\t\t\t\n\t\t\n \t \t\t \t\t \t \t \t\t\t \t\t", "t,rem = list(map(int, input().split()))\r\ndisap = 0\r\nfor i in range(t):\r\n\tsign, n = input().split()\r\n\tn = int(n)\r\n\tif sign == '-':\r\n\t\tif rem >= n:\r\n\t\t\trem -= n\r\n\t\telse:\r\n\t\t\tdisap += 1\r\n\telse:\r\n\t\trem += n\r\nprint(rem, disap)", "\"\"\"\r\ninput().split()\r\n\"\"\"\r\n\r\nn, x = input().split()\r\nice_cream_total = int(x)\r\ndistressed_kids = 0\r\n\r\nfor i in range(0, int(n)):\r\n queue = input().split()\r\n if queue[0] == \"+\":\r\n ice_cream_total = ice_cream_total + int(queue[1])\r\n elif queue[0] == \"-\":\r\n if ice_cream_total >= int(queue[1]):\r\n ice_cream_total = ice_cream_total - int(queue[1])\r\n else:\r\n distressed_kids = distressed_kids + 1\r\n\r\nprint(ice_cream_total, distressed_kids)\r\n", "n, x = [int(x) for x in input().split()]\r\nd = 0\r\nfor i in range(n):\r\n q = int(input().replace(\" \", \"\"))\r\n if q + x < 0:\r\n d += 1\r\n else:\r\n x += q\r\nprint(x, d)\r\n", "n,x = map(int,input().split())\ndis=0\nwhile(n):\n n-=1\n sym,num=input().split()\n num=int(num)\n if sym=='-':\n if num<=x:\n x=x-num\n else:\n dis+=1\n else:\n x+=num\nprint(x,dis)", "a, b = map(int, input().split())\r\n\r\nans = 0\r\nfor i in range(a):\r\n c, d = input().split()\r\n d = int(d)\r\n if c == '-':\r\n d = d * (-1)\r\n\r\n if d > 0:\r\n b += d\r\n else:\r\n if abs(d) > b:\r\n ans += 1\r\n else:\r\n b += d\r\nprint(b, ans)\r\n", "s,m=map(int,input().split())\r\nk=0\r\nfor i in range(s):\r\n s1,m2=map(str,input().split())\r\n m1=int(m2)\r\n if(s1=='+'):\r\n m=m+m1\r\n else:\r\n if(m>=m1):\r\n m=m-m1\r\n else:\r\n k=k+1\r\nprint(m,\" \",k)", "n,x=input().split()\nn=int(n) ; x=int(x)\nz=0\nfor i in range(n):\n a,b=input().split()\n b=int(b)\n if a=='+':\n x+=b \n elif x>=b:\n x-= b\n else:\n z+=1\n \nprint(x , z)\n\t \t \t \t\t\t \t \t \t \t \t\t\t", "n, x = list(map(int, input().split()))\n\nreqs = []\nfor i in range(n):\n req = list(input().split())\n reqs.append(req)\n\ndis = 0\ntot = x\n\nfor i in range(n):\n if reqs[i][0] == \"+\":\n tot += int(reqs[i][1])\n else:\n if tot < int(reqs[i][1]):\n dis += 1\n else:\n tot -= int(reqs[i][1])\n\nprint(tot, dis)\n\t\t \t \t \t \t \t\t\t \t \t \t", "n1, n2 = input().split()\r\nn, x = int(n1), int(n2)\r\nl = []\r\nfor i in range(n):\r\n\ts = list(map(str, input().strip().split()))\r\n\tl.append(s)\r\ndiss = 0\r\ntotal = x\r\nfor i in l:\r\n\tif i[0] == \"+\":\r\n\t\ttotal += int(i[1])\r\n\telif i[0] == \"-\":\r\n\t\tif total - int(i[1]) >= 0:\r\n\t\t\ttotal -= int(i[1])\r\n\t\telse:\r\n\t\t\tdiss += 1\r\nprint(total, diss)", "n,x=[int(_) for _ in input().split()]\r\ndistress=0\r\nfor _ in range(n):\r\n char,qty=[_ for _ in input().split()]\r\n if char==\"+\":\r\n x+=int(qty)\r\n else:\r\n if x>=int(qty):\r\n x-=int(qty)\r\n else:\r\n distress+=1\r\nprint(x, distress)", "n, x = map(int, input().split())\r\n\r\nice_cream = x\r\ndistress_child = 0\r\nfor _ in range(n):\r\n sign, amount = input().split()\r\n\r\n if sign == '+':\r\n ice_cream += int(amount)\r\n elif sign == '-' and ice_cream >= int(amount):\r\n ice_cream -= int(amount)\r\n elif sign == '-' and ice_cream<int(amount):\r\n distress_child += 1\r\n\r\nprint(ice_cream, distress_child)\r\n", "n, x = input().split()\r\nn, x = int(n), int(x)\r\n\r\nchildren = []\r\n\r\nfor i in range(0,n):\r\n child = input().split()\r\n child[1] = int(child[1])\r\n children.append(child)\r\n\r\ndistressed = 0\r\nfor i in range(0, len(children)):\r\n if children[i][0] == '+':\r\n x += children[i][1]\r\n elif children[i][1] > x:\r\n distressed += 1\r\n else:\r\n x -= children[i][1]\r\n\r\nprint(x, distressed)", "def solve():\r\n n, x = map(int, input().split())\r\n distressed = 0\r\n for _ in range(n):\r\n op, num = input().split()\r\n if op == '+':\r\n x += int(num)\r\n else:\r\n if int(num) <= x:\r\n x -= int(num)\r\n else:\r\n distressed += 1\r\n print(x, distressed)\r\n\r\n\r\nsolve()\r\n", "n,packets = map(int,input().split(\" \"))\r\ntotal_iceCreams = packets\r\ntotal_children = 0\r\nfor i in range(n):\r\n sign, num = input().split(\" \")\r\n if sign == '-':\r\n if int(num) > total_iceCreams:\r\n total_children+=1\r\n else:\r\n total_iceCreams-=int(num)\r\n elif sign == \"+\":\r\n total_iceCreams+=int(num)\r\nprint(total_iceCreams,total_children)", "inn = list(map(int, input().split(\" \")))\nops = inn[0]\nicecrms = inn[1]\ndiskid = 0\nfor _ in range(ops):\n op = input().split(\" \")\n if op[0]==\"+\":\n icecrms += int(op[1])\n else:\n if int(op[1])>icecrms:\n diskid += 1\n else:\n icecrms -= int(op[1])\nprint(icecrms, diskid)", "a,b=map(int,input().split())\r\nf=0\r\n\r\nfor i in range(a):\r\n\r\n c=input()\r\n\r\n if c[0]==\"+\":\r\n b+=int(c[2:])\r\n else:\r\n if b>=int(c[2:]):\r\n b-=int(c[2:])\r\n else:\r\n f+=1\r\nprint(b,f)\r\n ", "import math\r\n \r\ndef s():\r\n n,x = [int(x) for x in input().split(\" \")]\r\n distressed = 0\r\n for i in range(n):\r\n stri = input()\r\n if stri[0] == \"+\":\r\n x += int(stri[2:])\r\n else:\r\n if int(stri[2:]) > x:\r\n distressed += 1\r\n else:\r\n x -= int(stri[2:])\r\n print(x,distressed)\r\n \r\n\r\ns()\r\n ", "k = input().split(\" \")\r\n\r\nn = int(k[0])\r\nx = int(k[1])\r\n\r\no = 0\r\n\r\nfor i in range(n):\r\n k = input().split(\" \")\r\n s = k[0]\r\n d = int(k[1])\r\n if s == \"+\":\r\n x += int(k[1])\r\n elif s == \"-\" and x >= d:\r\n x -= d\r\n elif s == \"-\" and x < d:\r\n o += 1\r\n\r\nprint(x, o)\r\n \r\n", "import sys\r\n\r\ninput = sys.stdin.readline\r\n\r\n############ ---- Input Functions ---- ############\r\ndef inp():\r\n return (int (input ()))\r\n\r\n\r\ndef inlt():\r\n return (list (map (int, input ().split ())))\r\n\r\n\r\ndef insr():\r\n s = input()\r\n return (list (s[:len (s) - 1]))\r\n\r\n\r\ndef invr():\r\n return (map (int, input ().split ()))\r\n\r\n\r\nn,x = invr()\r\nm = 0\r\nfor i in range(n):\r\n s = input()\r\n a = int(s[2:])\r\n if s[0] == '+':\r\n x = x + a\r\n else:\r\n if a > x:\r\n m = m + 1\r\n else:\r\n x = x - a\r\nprint(x,m)", "a = input().split(' ')\r\nn = int(a[0])\r\nx = int(a[1])\r\ns = []\r\nt = 0\r\nfor i in range(n):\r\n b = input().split(' ')\r\n if b[0] == '+':\r\n x = x + int(b[1])\r\n elif b[0] == '-':\r\n if x - int(b[1]) < 0:\r\n t = t + 1\r\n else:\r\n x = x - int(b[1])\r\nprint(x,t)\r\n", "n, x, counter = 0, 0, 0\r\ns = input()\r\npos = s.find(\" \")\r\nn = int(s[:pos])\r\nx = int(s[pos + 1:])\r\n\r\nfor i in range(n):\r\n s = input()\r\n val = int(s[2:])\r\n\r\n if(s[0] == '+'):\r\n x += val\r\n else:\r\n if x >= val:\r\n x -= val\r\n else:\r\n counter += 1\r\n\r\nprint(x, \" \", counter)\r\n", "n, x = [int(num) for num in input().split()]\n\ndt = 0\n\nfor i in range(n):\n s, d = [num for num in input().split()]\n df = int(d)\n\n if s == '+':\n x += df\n elif s == '-':\n if x >= df:\n x -= df\n else:\n dt += 1\n\nprint(x, dt)\n", "lop,n_ice= map(int,input().split())\r\ntotal_ice = n_ice\r\nboy = 0\r\nfor i in range(lop):\r\n op,ice=input().split()\r\n ice = int(ice)\r\n if op == '+':\r\n total_ice += ice\r\n else:\r\n if ice<=total_ice:\r\n total_ice -= ice\r\n else:\r\n boy += 1\r\nprint(total_ice,boy)\r\n\r\n\r\n", "n, x = [int(i) for i in input().split()]\r\narr = []\r\nfor _ in range(n):\r\n a,b = [i for i in input().split()]\r\n arr.append([a,b])\r\ncount = 0\r\nfor i in arr:\r\n if i[0] == '+':\r\n x += int(i[1])\r\n else:\r\n if int(i[1]) > x:\r\n count += 1\r\n else:\r\n x -= int(i[1])\r\nprint(x, count)", "if __name__ == \"__main__\":\n t ,k = input().split()\n s = int(k)\n count = 0\n for i in range(int(t)):\n n = input().split()\n if(n[0] == '+'):\n s = s + int(n[1])\n elif(int(n[1]) <= s):\n s = s - int(n[1])\n else:\n count = count + 1\n print(s,count)\n \n \t \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\nc=0\r\nfor i in range(n):\r\n m,k=input().split()\r\n if m=='+':\r\n x+=int(k)\r\n else:\r\n if x>=int(k):\r\n x-=int(k)\r\n else:\r\n c+=1\r\nprint(x,c)", "numbers = input().split(\" \")\r\nn, x = int(numbers[0]), int(numbers[1])\r\n\r\ndistressed = 0\r\nfor i in range(0, n):\r\n d = input().split(\" \")\r\n if d[0] == \"+\":\r\n x = x + int(d[1])\r\n else:\r\n if int(d[1]) <= x:\r\n x = x - int(d[1])\r\n else:\r\n distressed = distressed + 1\r\nprint(x, distressed)\r\n", "n,x=map(int,input().split())\r\nc=0\r\nfor i in range(n):\r\n a=input()\r\n\r\n if a[0]==\"+\":\r\n x+=int(a[2:])\r\n if x<int(a[2:]):\r\n c+=1\r\n\r\n elif a[0]==\"-\" and x>=int(a[2:]):\r\n x-=int(a[2:])\r\nprint(x,c)", "# Wadea #\r\n\r\nn = input().strip().split()\r\nlst = list(n)\r\nn1 = int(lst[0])\r\nm = int(lst[1])\r\n\r\nl = 0\r\nr = 0\r\nplus = \"+\"\r\nminus = \"-\"\r\nlst1 = []\r\nfor i in range(n1):\r\n ice = input().strip().split()\r\n lst1 += ice\r\n for j in lst1:\r\n if plus in lst1:\r\n m += int(lst1[-1])\r\n lst1.clear()\r\n \r\n elif minus in lst1:\r\n if m < int(lst1[-1]):\r\n r += 1\r\n lst1.clear()\r\n else:\r\n m -= int(lst1[-1])\r\n lst1.clear()\r\nprint(m,r)\r\n", "n, ihave = input().split()\n\nn = int(n)\nihave = int(ihave)\n\ndistressed = 0\n\nfor i in range(n):\n sign, num = input().split()\n num = int(num)\n \n if sign == '+':\n ihave += num\n elif sign == '-':\n if ihave >= num:\n ihave -= num\n else:\n distressed += 1 \n \n \nprint(ihave, distressed)\n \n \n\t\t \t\t \t \t \t \t\t \t\t \t\t \t\t\t\t\t\t", "l=[int(x) for x in input().split()]\r\nn=l[0]\r\nm=l[1]\r\nans=0\r\nfor i in range (0,n):\r\n y=[x for x in input().split()]\r\n if(y[0]=='+'):\r\n m+=int(y[1])\r\n elif int(y[1])<=m:\r\n m-=int(y[1])\r\n else:\r\n ans+=1\r\n \r\nprint(m,ans)", "n, ice_cream = map(int, input().split())\r\nuser_input = []\r\nfor i in range(n):\r\n user_input.append(input().split())\r\nkids = 0\r\n\r\nfor i in range(n):\r\n if user_input[i][0] == \"+\":\r\n ice_cream += int(user_input[i][1])\r\n elif int(user_input[i][1]) <= ice_cream:\r\n ice_cream -= int(user_input[i][1])\r\n else:\r\n kids += 1\r\n\r\nprint(ice_cream, kids)", "n,m=map(int,input().split())\r\ncount=0\r\nfor i in (' '*n):\r\n c=eval(input())\r\n if(m+c>=0):\r\n m=m+c\r\n elif(m+c<0):\r\n count+=1\r\nprint(m,count)\r\n ", "num_of_people, num_of_ice = map(int,input().split())\r\ncount_of_distress = 0\r\nfor i in range(num_of_people):\r\n sign, num_of_packs = input().split()\r\n if sign == \"+\":\r\n num_of_ice += int(num_of_packs)\r\n else:\r\n if int(num_of_packs) > num_of_ice:\r\n count_of_distress += 1\r\n else:\r\n num_of_ice = num_of_ice - int(num_of_packs)\r\nprint(f\"{num_of_ice} {count_of_distress}\")\r\n", "n,x = map(int,input().split())\r\nmorog = x\r\nchild = 0\r\nfor i in range(n):\r\n a = list(input().split())\r\n if a[0] == \"+\":\r\n x += int(a[1])\r\n else:\r\n if int(a[1]) <= x:\r\n x -= int(a[1])\r\n else:\r\n child += 1\r\nprint(x,child)", "n, x = list(map(int, input().split()))\r\na = []\r\nboy = 0\r\nfor i in range(n):\r\n a.append(input())\r\nfor item in a:\r\n if item[0] == \"+\":\r\n x += int(item[2:])\r\n else:\r\n if x >= int(item[2:]):\r\n x -= int(item[2:])\r\n else:\r\n boy += 1\r\nprint(x, boy)\r\n", "n, iceCream = [int(x) for x in input().split()]\r\nderranged = 0\r\nfor i in range(n):\r\n\r\n line = str(input())\r\n numbers = [int(x) for x in line.split() if x.isdigit()]\r\n sign = line[0]\r\n if sign == \"+\":\r\n iceCream += numbers[0]\r\n elif sign == \"-\" and numbers[0] > iceCream:\r\n derranged += 1\r\n else:\r\n iceCream -= numbers[0]\r\nprint(iceCream, derranged)\r\n", "n, x = map(int, input().split())\r\n\r\nd=0\r\nwhile n!=0:\r\n\r\n b= input()\r\n a=int(b[1:])\r\n if b[0]=='+':\r\n x+=a\r\n else:\r\n c= x-a\r\n if c<0:\r\n d+=1\r\n else:\r\n x=c\r\n \r\n \r\n n-=1\r\nprint(str(x) + ' ' + str(d))\r\n", "n,x=map(int, input().split())\r\ncnt=0\r\nfor _ in range(n):\r\n k=input().split()\r\n p=int(k[1])\r\n if k[0]=='+': x+=p\r\n elif x<p: cnt+=1\r\n else: x-=p\r\nprint(x, cnt)", "n,x=map(int,input().split())\r\nk=0\r\nfor i in range(n):\r\n a,b=input().split()\r\n if a=='+':\r\n x+=int(b)\r\n else:\r\n if int(b)>x:\r\n k+=1\r\n else:\r\n x-=int(b)\r\nprint(x,k)", "N,X = [int(x) for x in input().split()]\r\nsadkids = 0\r\nfor i in range(N):\r\n query = input()\r\n if query[0] == \"+\":\r\n X += int(query[2:])\r\n else:\r\n if int(query[2:]) > X:\r\n sadkids += 1\r\n else:\r\n X -= int(query[2:])\r\n\r\nprint(X,sadkids)", "operation , numIc = map(int,input().split(' '))\r\nsadChild=0\r\nfor i in range (operation):\r\n sign , ics = input().split(' ')\r\n ics=int(ics)\r\n if(sign == '+'):\r\n numIc=numIc+ics\r\n else :\r\n if(ics<=numIc):\r\n numIc=numIc-ics\r\n else:\r\n sadChild=sadChild+1;\r\n\r\nprint(str(numIc)+' '+str(sadChild))", "n, x = [int(i) for i in input().split()]\r\nif 1 <= n <= 1000 and 0 <= x <= 1000000000:\r\n nKids = 0\r\n t = 0\r\n for i in range(n):\r\n d, num = [j for j in input().split()]\r\n num = int(num)\r\n if d == '+':\r\n x += num\r\n elif d == '-':\r\n t = x - num\r\n if t < 0:\r\n nKids += 1\r\n else:\r\n x -= num\r\n print(x, nKids) \r\nelse:\r\n print('Error: The first input must contain two space-separated integers n and x (1 ≤ n ≤ 1000, 0 ≤ x ≤ 109).')", "e=input()\r\ne=e.split()\r\nn=int(e[0])\r\nk=int(e[1])\r\nsad=0\r\nwhile n>0:\r\n n-=1\r\n w=input()\r\n w=w.split()\r\n z=w[0]\r\n a=int(w[1])\r\n if z=='+':\r\n k+=a\r\n if z=='-':\r\n if k>=a:\r\n k-=a\r\n else:\r\n sad+=1\r\nk=str(k)\r\nsad=str(sad)\r\nprint(k+' '+sad)", "n, x = map(int, input().split())\r\n\r\niceCream = x\r\ndistressedKids = 0\r\n\r\nfor _ in range(n):\r\n op, packs = input().split()\r\n packs = int(packs)\r\n\r\n if op == '+':\r\n iceCream += packs\r\n else:\r\n if iceCream >= packs:\r\n iceCream -= packs\r\n else:\r\n distressedKids += 1\r\n\r\nprint(iceCream, distressedKids)\r\n", "#\n#\n\nv, mm, n = 0, 0, 0\n\nl=[]\nx=input().split()\nfor i in range(2):\n l.append(int(x[i]))\ne=l[0]\nf=l[1]\n\nmylist =[]\nmy=[]\nyy= []\nfor m in range (e):\n x=input().split()\n if x[0]=='-':\n if int(x[1])<=f:\n f-=int(x[1])\n else:\n n+=1\n else:\n f+=int(x[1])\n\nprint(f,n)\n\n\n\n#\n\n\n \t \t\t\t\t \t \t \t\t\t \t\t\t", "n, x = map(int, input().split())\r\nw = 0\r\nfor i in range(n):\r\n q, d = input().split()\r\n if q == '+':\r\n x += int(d)\r\n else:\r\n if x - int(d) < 0:\r\n w += 1\r\n else:\r\n x -= int(d)\r\nprint(x, w)\r\n", "def main():\r\n n, x = map(int, input().split())\r\n lst = []\r\n cntKid = 0\r\n for i in range(n):\r\n a, b = map(str, input().split())\r\n lst.append(a)\r\n lst.append(b)\r\n for i in range(0, 2 * n, 2):\r\n if lst[i] == '+':\r\n x += int(lst[i+1])\r\n if lst[i] == '-':\r\n if int(lst[i+1]) > x:\r\n cntKid += 1\r\n else:\r\n x -= int(lst[i+1])\r\n # print(x)\r\n print(x, cntKid)\r\n # print(lst)\r\n\r\n\r\nmain()\r\n", "n,x=map(int,input().split())\r\ns=0\r\nfor _ in range(n):\r\n a=input().split()\r\n if a[0]=='+': x+=int(a[1])\r\n else:\r\n if int(a[1])<=x: x-=int(a[1])\r\n else: s+=1\r\nprint(x,s)", "k=list(map(int,input().split()))\r\ns=k[1]\r\nt=0\r\nfor i in range(k[0]):\r\n n=list(map(str,input().split()))\r\n if n[0]=='+':\r\n s=s+int(n[1])\r\n elif s>=int(n[1]):\r\n s=s-int(n[1])\r\n else:\r\n t+=1\r\nprint(s,end=' ')\r\nprint(t)", "z = input().split()\r\nn , x = map(int,z)\r\ndistress= 0\r\nfor i in range(n):\r\n d = input()\r\n if d[0] == '+':\r\n x+=int(d[2:])\r\n else :\r\n if x >= int(d[2:]):\r\n x-=int(d[2:])\r\n else :\r\n distress+=1\r\n\r\nprint(x,distress)\r\n", "#FreeIceCream\r\n\r\nn,d = map(int,input().split())\r\n\r\ndistrssC = 0\r\nfor _ in range(n):\r\n\r\n\toper,value = map(str,input().split())\r\n\r\n\tif oper == \"+\":\r\n\t\td +=int(value)\r\n\telse:\r\n\t\tif int(value) <= d:\r\n\t\t\td -= int(value)\r\n\t\telse:\r\n\t\t\tdistrssC +=1\r\n\r\nprint(d,distrssC)\r\n\r\n", "#finding how many icecreams are left and how many kids leave in distress\r\n\r\ndef operation(string):\r\n if string == '+':\r\n return True\r\n else:\r\n return False\r\n\r\n\r\ndef ice_kids(turns, intial):\r\n ice_cream = initial\r\n kids = 0\r\n for i in range(turns):\r\n string, number = input().split()\r\n number = int(number)\r\n if operation(string):\r\n ice_cream += number\r\n else:\r\n if ice_cream >= number:\r\n ice_cream -= number\r\n else:\r\n kids += 1\r\n return (ice_cream, kids)\r\n\r\n\r\n\r\nturns, initial = map(int, input().split())\r\n\r\nice_cream, kids = ice_kids(turns, initial)\r\nprint(ice_cream, kids)", "arr = input().split(' ')\r\nn = int(arr[0])\r\nx = int(arr[1])\r\ncount = 0\r\nwhile n:\r\n n-=1\r\n arr = input().split(' ')\r\n if(arr[0]=='+'):\r\n x+= int(arr[1])\r\n else:\r\n d = int(arr[1])\r\n if(d<=x):\r\n x-=d\r\n else:\r\n count+=1\r\nprint(x,end=' ')\r\nprint(count)\r\n", "n , d = input().split()\r\nn,d = int(n) , int(d)\r\ndist = 0\r\ntotal = d\r\nfor i in range(n):\r\n ch , amount = input().split()\r\n amount = int(amount)\r\n if ch == \"+\":\r\n total+=amount\r\n elif ch == \"-\":\r\n if total < amount:\r\n dist+=1\r\n else:\r\n total-=amount\r\nprint(total , dist)\r\n\r\n\r\n\r\n\r\n\r\n", "#####--------------Template Begin-------------------####\r\nimport math\r\nimport sys\r\n#input = sys.stdin.readline\r\ndef ri(): #Regular input\r\n\treturn input()\r\ndef ii(): #integer input\r\n\treturn int(input())\r\ndef li(): #list input\r\n\treturn input().split()\r\ndef mi(): #map input\r\n\treturn list(map(int, input().split()))\r\n#####---------------Template Ends-------------------######\r\nn,x=mi()\r\nd=0\r\nfor i in range(n):\r\n\tline=ri().split()\r\n\tif line[0]==\"+\":\r\n\t\tx+=int(line[1])\r\n\telse:\r\n\t\tif x>=int(line[1]):\r\n\t\t\tx-=int(line[1])\r\n\t\telse:\r\n\t\t\td+=1\r\n\r\n\r\nprint(x, d)\r\n", "n, x = map(int, input().split())\r\n\r\ndistressed_kids = 0\r\n\r\nfor _ in range(n):\r\n d = input()\r\n if eval(f'{x} {d}') < 0:\r\n distressed_kids += 1\r\n else:\r\n x = eval(f'{x} {d}')\r\n\r\nprint(x,distressed_kids)\r\n", "n,x = map(int,input().split())\r\nkidz = 0\r\nfor i in range(n):\r\n\ta,b = input().split()\r\n\tb = int(b)\r\n\tif a == \"+\":\r\n\t\tx += b\r\n\telif a == \"-\":\r\n\t\tif b > x:\r\n\t\t kidz+=1\r\n\t\telse: \r\n\t\t x -= b\r\nprint(x,kidz)", "n,x = map(int,input().split())\r\ndistress = 0\r\nfor i in range(n):\r\n sym,amt = map(str,input().split())\r\n if(sym=='+'):\r\n x+=int(amt)\r\n else:\r\n if(x<int(amt)):\r\n distress+=1\r\n else:\r\n x-=int(amt)\r\nprint(x,distress)", "n1, n2 = input().split()\nn, x = int(n1), int(n2)\nl = []\nfor i in range(n):\n\ts = list(map(str, input().strip().split()))\n\tl.append(s)\ndiss = 0\ntotal = x\nfor i in l:\n\tif i[0] == \"+\":\n\t\ttotal += int(i[1])\n\telif i[0] == \"-\":\n\t\tif total - int(i[1]) >= 0:\n\t\t\ttotal -= int(i[1])\n\t\telse:\n\t\t\tdiss += 1\nprint(total, diss)\n\t \t \t\t\t\t \t \t\t \t\t\t\t \t\t \t \t\t \t", "# 26 A. Free Ice Cream\r\nn,x = map(int,input().split(' '))\r\nlst = []\r\ndis = 0\r\nfor i in range (n):\r\n lst.append(input().split(' '))\r\nfor i in lst :\r\n if i[0] == '+':\r\n x+=int(i[1])\r\n elif i[0] == '-':\r\n if x >= int(i[1]):\r\n x-=int(i[1]) \r\n else: dis += 1 \r\nprint (f'{x} {dis}') ", "n , x = input().split()\nn = int(n) ; x = int(x)\nm4_hya5od = 0\nfor i in range(n):\n a , b = input().split()\n b = int(b)\n if a == '+':\n x+=b\n elif b > x:\n m4_hya5od+=1\n else:\n x-=b\nprint(x , m4_hya5od)\n\n\t \t \t\t\t \t \t\t \t\t \t \t\t\t", "n,x=map(int,input().split())\r\nsum=x\r\nc=0\r\nfor i in range(n):\r\n o,d=input().split()\r\n if o=='+':\r\n sum+=int(d)\r\n elif o=='-':\r\n if sum>=int(d):\r\n sum-=int(d)\r\n elif sum<int(d):\r\n c+=1\r\nprint(sum,end=\" \")\r\nprint(c)", "n, x = map(int, input().split())\r\ndistressed = 0\r\n\r\nfor i in range(n):\r\n s, packs = input().split()\r\n if s == '+':\r\n x += int(packs)\r\n elif s == '-' and int(packs) > x:\r\n distressed += 1\r\n else:\r\n x -= int(packs)\r\n\r\nprint(x, distressed)\r\n", "if __name__ == '__main__':\r\n n, x = map(int, input().split())\r\n sad_kids = 0\r\n for _ in range(n):\r\n curr = eval(f'{x} {input()}')\r\n if curr < 0:\r\n sad_kids += 1\r\n else:\r\n x = curr\r\n print(x, sad_kids)\r\n", "n,k=map(int,input().split(\" \"))\r\nnum=[]\r\nasi=[]\r\nfor i in range(0,n):\r\n s=input()\r\n ss=s.split(\" \")\r\n asi.append(ss[0])\r\n num.append(int(ss[1]))\r\n\r\ncount=k\r\nx=0\r\nfor i in range(0,n):\r\n if asi[i]=='+':\r\n count+=num[i]\r\n else:\r\n if count>=num[i]:\r\n count-=num[i]\r\n else :\r\n x+=1\r\nprint(count,\" \",x) ", "a,b=map(int,input().split())\r\nctr=0\r\nfor i in range(a):\r\n op,n=map(str,input().split())\r\n n=int(n)\r\n if op==\"+\":\r\n b+=n\r\n elif b-n<0:\r\n ctr+=1\r\n continue\r\n else:\r\n b-=n\r\nprint(b,ctr)", "n, x = map(int, input().split())\nq = []\nc = 0\nfor i in range(n):\n\ts = input().split()\n\tif s[0] == '+':\n\t\tx += int(s[1])\n\telif s[0] == '-':\n\t\tif x >= int(s[1]):\n\t\t\tx -= int(s[1])\n\t\telse:\n\t\t\tc+=1\nprint(x, c)\n\t\t\n\t\t\n\t\t\n\t\t\t \t\t \t\t\t\t \t\t\t\t \t\t \t \t\t\t\t\t \t\t", "def ice_cream(n,x,l):\n\tk = x\n\td = 0\n\tfor s in l: \n\t\ts = s.split()\n\t\tif s[0] == '+':\n\t\t\tk += int(s[1])\n\t\telse:\n\t\t\tk -= int(s[1])\n\t\t\tif k<0:\n\t\t\t\tk += int(s[1])\n\t\t\t\td += 1\n\tprint(k,d)\n\t\t\n\t\t\n\t\nn,x = map(int,input().split())\nl = []\nwhile n>0:\n\ts1=str(input())\n\tl += [s1]\n\tn -= 1\nice_cream(n,x,l)\n \t\t \t \t \t\t\t\t \t\t \t\t \t\t\t\t\t", "n,x = list(map(int, input().split()))\r\ni = 0\r\nleft = 0\r\nc = 0\r\nwhile i < n:\r\n s = list(map(str, input().split()))\r\n if s[0] == \"-\":\r\n if x - int(s[1]) < 0:\r\n c += 1\r\n else:\r\n x -= int(s[1])\r\n else:\r\n x += int(s[1])\r\n i += 1\r\nprint(x,c)", "n , d = map(int,input().split())\r\ncry = 0\r\nfor i in range(n):\r\n sign , num = input().split()\r\n num = int(num)\r\n if sign == '+' :\r\n d += num\r\n elif d >= num :\r\n d -= num\r\n else:\r\n cry += 1\r\n\r\nprint(d,cry)\r\n", "n,x= input().split()\r\na=int(x)\r\ndistress =0\r\nfor _ in range(int(n)):\r\n what, d= input().split()\r\n d=int(d)\r\n if what=='+':\r\n a+=d\r\n else:\r\n if d<=a:\r\n a-=d\r\n else:\r\n distress+=1\r\nprint(str(a)+\" \"+str(distress))", "n,x=[int(x) for x in input().split()]\r\n\r\nopList=[]\r\nnumList=[]\r\nchild=0\r\n\r\nfor i in range(n):\r\n d=input()\r\n \r\n opList.append(d[0])\r\n num=int(d[2:])\r\n numList.append(num)\r\n\r\nfor op , num in zip(opList,numList):\r\n\r\n if op == '+':\r\n x+=num\r\n\r\n else :\r\n if num > x:\r\n child+=1\r\n else :\r\n x-=num\r\n\r\nprint(x,child)", "n, x = input().split()\nn, x = int(n), int(x)\ng = 0\nfor i in range(n):\n s = input()\n c = int(s[2:])\n if '+' in s:\n x += c\n else:\n if x < c:\n g += 1\n else:\n x -= c\nprint(x, g)\n", "n , x = input().split()\nn = int(n) ; x = int(x)\nma5ad4 = 0\nfor i in range(n):\n a , b = input().split()\n b = int(b)\n if a == '+':\n x += b\n elif b > x:\n ma5ad4 += 1 \n else:\n x-=b\nprint(x , ma5ad4)\n \t \t\t\t \t \t \t \t \t \t", "n, x = [int(i) for i in input().split()]\r\n\r\nsad = 0\r\n\r\nfor i in range(n):\r\n a = input()\r\n if a[0] == \"+\":\r\n x += int(a[2:])\r\n elif a[0] == \"-\" and x >= int(a[2:]):\r\n x -= int(a[2:])\r\n else:\r\n sad += 1\r\n\r\nprint(x, sad)\r\n", "n,x=map(int,input().split())\r\nc=0\r\nfor _ in range(n):\r\n d=input()\r\n d=d.split()\r\n if d[0]=='+':\r\n x+=int(d[1])\r\n else:\r\n if int(d[1])<=x:\r\n x-=int(d[1])\r\n else:\r\n c+=1 \r\nprint(x,c)", "n,x = map(int, input().split())\r\nz3lan = 0\r\nfor i in range(n):\r\n op, d = input().split()\r\n d = int(d)\r\n if op == \"+\":\r\n x += d\r\n else:\r\n if x >= d:\r\n x -= d\r\n else:\r\n z3lan += 1\r\nprint(x,z3lan)", "a = input().split()\r\nn, x = int(a[0]), int(a[1])\r\nsad = 0\r\nfor i in range(n):\r\n a = input().split()\r\n if a[0] == '+':\r\n x += int(a[1])\r\n else:\r\n if x >= int(a[1]):\r\n x -= int(a[1])\r\n else:\r\n sad += 1\r\nprint(x, sad)\r\n", "t, n = map(int, input().split())\r\n\r\ncontador = 0\r\n\r\nfor i in range (t):\r\n\r\n a, b = map(str, input().split())\r\n\r\n b = int(b)\r\n\r\n if a == '+':\r\n n += b\r\n else:\r\n if n < b:\r\n contador += 1\r\n else:\r\n n -= b\r\n\r\nprint(n, contador)", "n,k = map(int,input().split())\r\na = 0\r\nfor _ in range(n):\r\n s,x = map(lambda x: int(x) if x.isnumeric() else x, input().split())\r\n if s == \"+\":\r\n k+=x\r\n else:\r\n if x > k:\r\n a+=1\r\n else:\r\n k-=x\r\nprint(k,a)", "inp = input().split()\r\n\r\nn, x = int(inp[0]), int(inp[1])\r\n\r\ndis = 0\r\n\r\nfor i in range(n):\r\n q = input().split()\r\n if q[0] == '+':\r\n x += int(q[1])\r\n else:\r\n if x >= int(q[1]):\r\n x -= int(q[1])\r\n else:\r\n dis += 1\r\n\r\nprint(x, dis)", "n,x = map(int,input().split())\r\n\r\ndist=0\r\nfor i in range(n):\r\n\ts,no = input().split()\r\n\tif(s=='+'):\r\n\t\tx+=int(no)\r\n\telse:\r\n\t\tif((x-int(no))<0):\r\n\t\t\tdist+=1\r\n\t\telse:\r\n\t\t\tx-=int(no)\r\n\t\r\nprint(x,dist)\r\n\t ", "n,x=map(int,input().split())\r\ni,j=0,0\r\nfor _ in range(n):\r\n a,b=map(str,input().split())\r\n if(a==\"+\"):\r\n x=x+int(b)\r\n elif(a==\"-\"):\r\n if(x>=int(b)):\r\n x=x-int(b)\r\n else:\r\n i+=1\r\nprint(x,i) \r\n \r\n ", "(n, available) = tuple(map(int, input().split()))\r\n\r\ndistress = 0\r\n\r\nfor i in range(n):\r\n \r\n (sign, x) = tuple(input().split())\r\n x = int(x)\r\n if sign == '+':\r\n available += x \r\n \r\n else:\r\n if available >= x: \r\n available -= x \r\n else: \r\n distress +=1 \r\n \r\nprint(available, distress)", "n, x = map(int, input().split())\r\nd = 0\r\nfor i in range(n):\r\n a = input()\r\n k = a[0]\r\n b = a[2:]\r\n b = int(b)\r\n if k == \"+\":\r\n x += b\r\n else:\r\n if x - b >= 0:\r\n x -= b\r\n else:\r\n d += 1\r\n\r\nprint(x, d)\r\n\r\n\r\n\r\n\r\n\r\n", "n,x = map(int,input().split())\r\nsu = x\r\ncount = 0\r\nfor i in range(n):\r\n tc = [i for i in input().split()]\r\n #print(tc)\r\n if(tc[0]=='+'):\r\n su = su + int(tc[1])\r\n else:\r\n if(su - int(tc[1])<0):\r\n count+=1\r\n else:\r\n su = su - int(tc[1])\r\nprint(su,count,sep=\" \")\r\n\r\n", "import operator as op\r\nimport re\r\nimport sys\r\nfrom bisect import bisect, bisect_left, insort, insort_left\r\nfrom collections import Counter, defaultdict, deque\r\nfrom copy import deepcopy\r\nfrom decimal import Decimal\r\nfrom functools import reduce\r\nfrom itertools import (\r\n accumulate, combinations, combinations_with_replacement, groupby,\r\n permutations, product)\r\nfrom math import (acos, asin, atan, ceil, cos, degrees, factorial, gcd, hypot,\r\n log2, pi, radians, sin, sqrt, tan)\r\nfrom operator import itemgetter, mul\r\nfrom string import ascii_lowercase, ascii_uppercase, digits\r\n\r\n\r\ndef inp():\r\n return(int(input()))\r\n\r\n\r\ndef inlist():\r\n return(list(map(int, input().split())))\r\n\r\n\r\ndef instr():\r\n s = input()\r\n return(list(s[:len(s)]))\r\n\r\n\r\ndef invr():\r\n return(map(int, input().split()))\r\n\r\n\r\ndef def_value():\r\n return 0\r\n\r\n\r\nn, m = invr()\r\ndis = 0\r\n\r\nfor i in range(n):\r\n s, d = input().split()\r\n d = int(d)\r\n if s == \"+\":\r\n m += d\r\n else:\r\n if m >= d:\r\n m -= d\r\n else:\r\n dis += 1\r\nprint(m, dis)\r\n", "n, x = map(int, input().split())\r\ncount = 0\r\nfor i in range(n):\r\n a = input().split()\r\n if a[0] == '+':\r\n x+=int(a[-1])\r\n else:\r\n if x>=int(a[-1]):\r\n x -= int(a[-1])\r\n else:\r\n count+=1\r\nprint(x,count)", "n = list(input().strip().split())\r\nd = int(n[1])\r\nans = 0\r\narr = []*int(n[0])\r\nfor _ in range(int(n[0])):\r\n c = list(input().strip().split())\r\n c[1] = int(c[1]) * -1 if c[0] == '-' else int(c[1])\r\n arr.append(c[1])\r\n\r\n# print(arr)\r\nfor i in arr:\r\n d += i\r\n # print(d)\r\n if d < 0:\r\n ans += 1\r\n d = d - i\r\n\r\nprint(d,ans)", "a,b = map(int, input().split())\r\nh=[]\r\ng=[]\r\nsum =b\r\nk=0\r\nfor i in range(a):\r\n c,d = map(str, input().split())\r\n h.append(c)\r\n g.append(d)\r\n if h[i]=='+':\r\n sum += int(g[i])\r\n elif h[i]=='-':\r\n if sum - int(g[i]) <0 :\r\n k += 1\r\n else:\r\n sum -= int(g[i])\r\nprint(sum,\"\",k)\r\n", "n, ice_cream_count = map(int, input().split())\r\nsad_kids = 0\r\nfor i in range(n):\r\n operation = input().split()\r\n if operation[0] == \"+\":\r\n ice_cream_count += int(operation[1])\r\n else:\r\n wanted_ice_cream = int(operation[1])\r\n if wanted_ice_cream > ice_cream_count:\r\n sad_kids += 1\r\n else:\r\n ice_cream_count -= wanted_ice_cream\r\nprint(ice_cream_count, sad_kids)", "n, x = map(int, input().split()); ctr = 0\r\nfor i in range(n):\r\n sy, inp = input().split()\r\n inp = int(inp)\r\n if sy == '+': x += inp\r\n else :\r\n if inp > x : ctr += 1\r\n else : x -= inp\r\nprint(x, end = \" \")\r\nprint(ctr)", "count=0\r\nn, h = map(int,input().split())\r\nfor i in range(n):\r\n j, k = map(str,input().split())\r\n k=int(k)\r\n if j=='+':h+=k\r\n elif j=='-' and h>=k:h-=k\r\n else:count += 1\r\nprint(f\"{h} {count}\")", "n,x = map(int,input().split())\r\ndistress = 0\r\nfor _ in range(n):\r\n sign,d = input().split()\r\n if sign==\"+\":\r\n x+=int(d)\r\n else:\r\n if int(d)>x:\r\n distress+=1\r\n else:\r\n x-=int(d)\r\nprint(x,distress)", "n, x = map(int, input().split())\r\nleft, sad = x, 0\r\nfor q in range(0, n):\r\n c, d = input().split(maxsplit = 1)\r\n num = int(c + d)\r\n if left + num < 0:sad += 1\r\n else:left += num\r\nprint(left, sad)", "n, q = map(int, input().split())\r\nc = 0\r\n\r\nwhile n > 0:\r\n s, d = input().split()\r\n d = int(d)\r\n\r\n if s == '+':\r\n q += d\r\n else:\r\n if d <= q:\r\n q -= d\r\n else:\r\n c += 1\r\n\r\n n -= 1\r\n\r\nprint(q, c)\r\n", "friends=input()\nn,x=friends.split()\nn=int(n)\nx=int(x)\nsad=0\nfor i in range(n):\n friends=input()\n sign,number=friends.split()\n if sign ==\"+\":\n x=x+int(number)\n else:\n if int(number)<=x:\n x=x-int(number)\n else:\n sad=sad+1\nprint(x,sad)\n \t \t\t \t \t\t\t\t \t\t \t \t \t\t \t", "n,x=map(int,input().split())\r\nr=[0]*2\r\nfor i in range(n):\r\n s1,s2=map(str,input().split())\r\n s2=int(s2)\r\n if(s1=='+'):\r\n x+=s2 \r\n else:\r\n if(x>=s2):\r\n x-=s2 \r\n else:\r\n r[1]+=1 \r\nr[0]+=x \r\nprint(*r)", "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():\r\n return list(map(int, input().split()))\r\n\r\n\r\ndef multi_input():\r\n return map(int, input().split())\r\n\r\n\r\ndef main():\r\n n, tot = multi_input()\r\n d = 0\r\n for i in range(n):\r\n s = str_input().split()\r\n if s[0] == '+':\r\n tot += int(s[1])\r\n else:\r\n if tot < int(s[1]):\r\n d += 1\r\n else:\r\n tot -= int(s[1])\r\n print(f\"{tot} {d}\\n\")\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "a , n = map(int,input().split()) \nd = 0 \nfor i in range(a):\n\ts1 , s2 = input().split()\n\tif s1 == '+' :\n\t\tn += int(s2)\n\telse :\n\t\tif (int(s2) > n ) :\n\t\t\td += 1\n\t\telse :\n\t\t\tn -= int(s2)\nprint(n,d)\n", "n,x = input().split()\r\nice_creams = 0\r\nice_creams += int(x)\r\ndistressed = 0\r\nfor i in range(int(n)):\r\n giver_taker = input().split()\r\n if '+'in giver_taker:\r\n ice_creams += int(giver_taker[1])\r\n elif '-'in giver_taker:\r\n if ice_creams - int(giver_taker[1])<0:\r\n distressed += 1\r\n else:\r\n ice_creams -= int(giver_taker[1])\r\nprint(str(ice_creams)+' '+str(distressed))\r\n", "num_kids , num_icecream = [int(x) for x in input().split()]\r\nkids = 0\r\nfor i in range(num_kids):\r\n x = input()\r\n if x[0] == \"+\":\r\n num_icecream += int(x[2:])\r\n elif x[0] == \"-\":\r\n if int(x[2:]) > num_icecream:\r\n kids +=1\r\n else:\r\n num_icecream -= int(x[2:])\r\nprint(f\"{num_icecream} {kids}\")", "n, x = map(int, input().split())\nsad = 0\n\nfor _ in range(n):\n c, order = input().split()\n order = int(order)\n if c == \"+\":\n x += order\n else:\n if order > x:\n sad += 1\n else:\n x -= order\n\nprint(x, sad)", "'''\nAuthor : knight_byte\nFile : A_Free_Ice_Cream.py\nCreated on : 2021-04-28 07:27:59\n'''\n\n\ndef main():\n n, ice = map(int, input().split())\n cnt = 0\n for i in range(n):\n s, num = input().split()\n if s == \"+\":\n ice += int(num)\n else:\n if ice >= int(num):\n ice -= int(num)\n else:\n cnt += 1\n print(ice, cnt)\n\n\nif __name__ == '__main__':\n main()\n", "\nn, d = map(int, input().split())\nsample=[[\"+\",d]]\nsum = 0\nans = 0\nfor i in range(n):\n g, h = input().split()\n sample.append([g,h])\n\nfor i in range(len(sample)):\n\n if sample[i][0] == \"+\": sum += int(sample[i][1])\n elif sample[i][0] == \"-\" and int(sample[i][1]) <= sum: sum-= int(sample[i][1])\n else: ans+= 1\n\nprint(sum, ans)\n\n\n\n", "n, total_packs = map(int, input().split(\" \"))\r\ndistressed_kids = 0\r\nfor i in range(n):\r\n d = list(input().split(\" \"))\r\n d[1] = int(d[1])\r\n\r\n if d[0] == '+':\r\n total_packs += d[1]\r\n elif d[0] == '-':\r\n if total_packs < d[1]:\r\n distressed_kids += 1\r\n else:\r\n total_packs -= d[1]\r\n\r\nprint(str(total_packs) + \" \" + str(distressed_kids))\r\n", "x, y = map(int, input().split())\r\ncnt =0\r\nfor i in range(x):\r\n q = list(map(str,input().split()))\r\n n = int(q[1])\r\n if y < n and q[0]=='-':\r\n cnt +=1\r\n elif q[0]=='+':\r\n y+=n\r\n elif q[0]=='-' and y>=n:\r\n y -=n\r\nprint(y,cnt)", "n,x=map(int,input().split())\r\nsum=0\r\nsum+=x\r\ncount=0\r\nmystring=''\r\nfor i in range(n):\r\n mystring+=input()\r\n if mystring[0]=='+':\r\n j=mystring[2:]\r\n sum+=int(j)\r\n if mystring[0]=='-':\r\n k=mystring[2:]\r\n if sum<int(k):\r\n count+=1\r\n else:\r\n sum-=int(k)\r\n mystring=''\r\nprint(sum,count)\r\n", "n, x = map(int, input().split())\r\ncomm = []\r\nnums = []\r\nfor _ in range(n):\r\n a, b = map(str, input().split())\r\n comm.append(a)\r\n nums.append(b)\r\nsuma = x\r\nc = 0\r\n\r\nfor i in range(len(comm)):\r\n if comm[i] == \"+\":\r\n suma += int(nums[i])\r\n elif comm[i] == \"-\" and suma-int(nums[i]) >= 0:\r\n suma -= int(nums[i])\r\n elif comm[i] == \"-\" and suma-int(nums[i]) < 0:\r\n c += 1\r\n\r\nprint(suma, c)", "n,k=map(int,input().split(\" \"))\r\nct=0\r\nfor j in range(n):\r\n p,num=map(str,input().split(\" \"))\r\n if p=='+':\r\n k+=int(num)\r\n else:\r\n if k-int(num)<0:\r\n ct+=1\r\n else:\r\n k-=int(num)\r\nprint(k,ct)\r\n ", "\"\"\"609C\"\"\"\r\ndef main():\r\n\tn,x = map(int,input().split())\r\n\tcnt = 0\r\n\tfor _ in range(n):\r\n\t\tchar , d = map(str,input().split())\r\n\t\tif char=='+':\r\n\t\t\tx += int(d)\r\n\t\telse:\r\n\t\t\tif x<int(d):\r\n\t\t\t\tcnt+=1\r\n\t\t\telse:\r\n\t\t\t\tx -= int(d)\r\n\tprint(x,cnt)\r\n\r\n\r\nmain() ", "no_of_operations, no_of_packs = map(int, input().split())\r\ndistressed_kids = 0\r\nfor i in range(no_of_operations):\r\n temp = input().split()\r\n operation, packs_quantity = temp[0], int(temp[1])\r\n if(operation == '+'):\r\n no_of_packs += packs_quantity\r\n else:\r\n if(packs_quantity > no_of_packs):\r\n distressed_kids += 1\r\n else:\r\n no_of_packs -= packs_quantity\r\n\r\nprint(no_of_packs, distressed_kids)", "n,m=list(map(int,input().strip().split()))\r\nt=0\r\nfor i in range(n):\r\n l=input().split()\r\n if l[0]==\"+\":\r\n m=m+int(l[1])\r\n elif l[0]==\"-\":\r\n if m<int(l[1]):\r\n t +=1\r\n else:\r\n m=m-int(l[1])\r\nprint(m,t)\r\n ", "n, x = [int(i) for i in input().split()]\r\n\r\nsad = 0\r\nfor i in range(n):\r\n op, d = [i for i in input().split()]\r\n if op == \"-\":\r\n if x >= int(d):\r\n x -= int(d)\r\n else:\r\n sad += 1\r\n else:\r\n x += int(d)\r\n\r\nprint(x, sad)\r\n", "n,numic=list(map(int,input().split()))\r\ns=[numic,0]\r\nfor i in range(n):\r\n o,packs=input().split()\r\n if o == \"+\":\r\n s[0]+=int(packs)\r\n elif o == \"-\":\r\n if s[0] >= int(packs):\r\n s[0]-=int(packs)\r\n else:\r\n s[1]+=1\r\nprint(s[0],s[1])\r\n", "a,b=map(int,input().split())\r\nd=0\r\nfor _ in range(a):\r\n s=list(map(str,input().split()))\r\n if(s[0]=='+'):\r\n b+=int(s[1])\r\n else:\r\n if b>=int(s[1]):\r\n b-=int(s[1])\r\n else:\r\n d+=1\r\nprint(b,d)", "n, g = map(int, input().split())\r\nc = 0\r\nfor i in range(n):\r\n a, s = input().split()\r\n s = int(s)\r\n if a == \"+\":\r\n g += s\r\n else:\r\n if g < s:\r\n c += 1\r\n else:\r\n g -= s\r\n\r\n\r\nprint(g, c)\r\n", "n, x = map(int, input().split())\r\nc = 0\r\nfor i in range(n):\r\n s, s1 = [i for i in input().split()]\r\n if s == '+':\r\n x += int(s1)\r\n elif s == '-':\r\n if int(s1) <= x:\r\n x -= int(s1)\r\n else:\r\n c += 1\r\nprint(x, c)", "if __name__ == \"__main__\":\r\n n , k = map(int, input().split())\r\n sadChildren = 0\r\n queue = []\r\n for _ in range(n):\r\n sign, num = input().split()\r\n num = -1* int(num) if sign == \"-\" else int(num)\r\n if num > 0:\r\n k += num\r\n else:\r\n if k + num >= 0:\r\n k += num\r\n else:\r\n sadChildren +=1\r\n print(f\"{k} {sadChildren}\")", "n,x=input().split()\r\nn,x=int(n),int(x)\r\ncount=0\r\nfor _ in range(n):\r\n sign,ic=input().split()\r\n ic=int(ic)\r\n if sign=='+':\r\n x+=ic\r\n elif sign=='-':\r\n if x<ic:count+=1\r\n else:x-=ic\r\nprint(x,count)", "n, x = input().split()\r\nn, x = int(n), int(x)\r\nsk=0\r\n\r\nfor i in range (n):\r\n a, b = input().split()\r\n b=int(b)\r\n if a == \"+\":\r\n x+=b\r\n elif a == \"-\":\r\n if b>x:\r\n sk+=1\r\n elif b<=x:\r\n x-=b\r\nprint(x, sk)", "n,h = [int(x) for x in input().split()]\r\ncount = 0\r\nfor i in range(n):\r\n temp = eval(input())\r\n if temp >0:\r\n h+= temp\r\n elif temp<=0:\r\n if h+temp >=0: \r\n h+=temp\r\n else:\r\n count+=1\r\nprint(h,count)\r\n", "n,x = map(int,input().split())\r\ngr = 0\r\nfor _ in range(n):\r\n z,k = map(str,input().split())\r\n if z == '-' and x - int(k) >= 0:\r\n x -= int(k)\r\n elif z == '-' and x - int(k) < 0:\r\n gr += 1\r\n elif z == '+':\r\n x += int(k)\r\nprint(x,gr)", "vals = input().split()\r\nn = int(vals[0])\r\nicecreams = int(vals[1])\r\nd = 0\r\n\r\n\r\nfor i in range(n):\r\n inOrOut = input().split()\r\n if inOrOut[0] == \"-\":\r\n if icecreams - int(inOrOut[1]) < 0:\r\n d += 1\r\n else:\r\n icecreams -= int(inOrOut[1])\r\n if inOrOut[0] == \"+\":\r\n icecreams += int(inOrOut[1])\r\nprint(icecreams, d)\r\n", "n,x=map(int,input().split())\r\ndk=0\r\nfor i in range(n):\r\n s,k=input().split()\r\n if s[0]=='+':\r\n x+=int(k)\r\n elif s[0]=='-' and int(k)>x:\r\n dk+=1\r\n else:\r\n x-=int(k)\r\nprint(x,end=' ')\r\nprint(dk)", "n,x=map(int,input().split())\r\na=0\r\nfor i in range(n):\r\n s=input()\r\n l=s[2:]\r\n l=int(l)\r\n if '+' in s:\r\n x+=l\r\n else:\r\n if x<l:\r\n a+=1 \r\n else:\r\n x-=l\r\n # print(x)\r\nprint(x,a)", "n, x = map(int , input().split())\r\n\r\nice = x\r\n\r\ndis = 0\r\n\r\nfor i in range(n):\r\n instruction = input().split()\r\n if instruction[0] == \"+\":\r\n ice += int(instruction[1])\r\n\r\n else:\r\n if int(instruction[1]) > ice:\r\n dis += 1\r\n\r\n else:\r\n ice -= int(instruction[1])\r\n\r\nprint(ice, dis)", "n, x = map(int, input().split())\ndistressed = count = 0\nfor count in range(0, n):\n char, qnt = map(str, input().split())\n qnt = int(qnt)\n if char == '+':\n x += qnt\n if char == '-' and qnt <= x:\n x -= qnt\n elif char == '-' and qnt > x:\n distressed += 1\n count += 1\nprint(x, distressed)\n\t\t \t \t \t\t\t\t \t\t \t \t \t\t \t\t", "n, ice = map(int, input().split())\narr = []\n\nchildrens = 0\n\nfor i in range(n):\n n = list(input().split())\n n[1] = int(n[1])\n if n[0] == '+':\n ice += n[1]\n else:\n if ice < n[1]:\n childrens += 1\n else:\n ice -= n[1]\n\nprint(ice, childrens)\n", "a,b = map(int,input().split())\r\ncnt = 0\r\nfor i in range(a):\r\n s,m = input().split()\r\n m = int(m)\r\n if s == '+':\r\n b += m\r\n elif s == '-':\r\n if b < m:\r\n cnt += 1\r\n else:\r\n b -= m\r\nprint(b,cnt)", "n,m= list(map(int, input().split()))\nchi = 0\nfor i in range(n):\n\tc,x = input().split()\n\tif c == '+': m +=int(x)\n\telif m >= int(x): m -=int(x)\n\telse: chi +=1\nprint(m, chi)", "n, x = map(int, input().split())\r\n\r\nans = 0\r\nfor i in range(n):\r\n a, b = input().split()\r\n if a == '+':\r\n x += int(b)\r\n elif a == '-':\r\n if x < int(b):\r\n ans += 1\r\n else:\r\n x -= int(b)\r\n\r\n\r\nprint(x, ans)\r\n", "x,y=map(int,input().split())\r\nc=0\r\nwhile x>0:\r\n a,b=input().split()\r\n b=int(b)\r\n if a=='-' and b<=y:\r\n y-=b\r\n elif a=='+':\r\n y+=b\r\n elif a=='-'and b>y:\r\n c+=1\r\n x-=1\r\nprint(y,c)", "a,b=map(int ,input().split())\r\no=0\r\nfor i in range(a):\r\n \r\n c,d=map(str,input().split())\r\n d=int(d)\r\n \r\n if c==\"+\":\r\n b=b+d\r\n \r\n else:\r\n if b<d:\r\n o=o+1\r\n else:\r\n b=b-d\r\n\r\nprint(f'{b} {o}')\r\n", "from sys import stdin\r\n\r\nn,x = map(int,stdin.readline().split())\r\n\r\nc = 0\r\nfor i in range(n):\r\n\tl = stdin.readline().split()\r\n\tch,h = str(l[0]),int(l[1])\r\n\tif ch=='+':\r\n\t\tx+=h\r\n\telse:\r\n\t\tif h<=x:\r\n\t\t\tx-=h\r\n\t\telse:\r\n\t\t\tc+=1\r\nprint(str(x)+ \" \" + str(c))", "x, y = input().split()\nx = int(x)\ny = int(y)\ncount = y\nchild = 0\nfor i in range(0, x):\n a, b = input().split()\n b = int(b)\n if (a=='+'):\n count +=b\n elif (a == '-'):\n count -= b\n if(count<0):\n count += b\n child +=1\nprint(count,child)\n\t\t\t \t\t \t\t \t\t \t\t\t \t \t\t\t \t \t", "N,X=list(map(int,input().split()))\r\nTRISTES=0\r\nfor K in range(N):\r\n Cad=input()\r\n Num=int(Cad[2:len(Cad)])\r\n if(Cad[0]==\"+\"):\r\n X=X+Num\r\n else:\r\n if(Num<=X):\r\n X=X-Num\r\n else:\r\n TRISTES+=1\r\nprint(X,TRISTES)\r\n", "n, x = map(int, input().split())\r\nc=0\r\nfor _ in range(n):\r\n\tsi, d = input().split()\r\n\td = int(d)\r\n\tif si==\"+\":\r\n\t\tx+=d\r\n\telse:\r\n\t\tif d>x:\r\n\t\t\tc+=1\r\n\t\telse:\r\n\t\t\tx-=d\r\nprint(x, c)", "n,x=map(int,input().split())\r\nm=0\r\nfor i in range(n):\r\n d=int(input().replace(' ', ''))\r\n if x+d<0:\r\n m+=1\r\n else:\r\n x+=d\r\nprint(x,m)", "n,x = map(int, input() .split())\r\nl = [0]*n\r\nc= 0\r\nfor i in range (n):\r\n d, t = input() .split()\r\n t = int(t)\r\n if d == '+' :\r\n x = x + t\r\n elif d == '-':\r\n x = x - t\r\n if x < 0:\r\n c+=1\r\n x = x + t\r\nprint(x,c)", "n = input().split()\r\nnum = int(n[1])\r\nc = 0\r\nfor i in range((int(n[0]))):\r\n x = input().split()\r\n if (x[0] == '+'):\r\n num += int(x[1])\r\n if (x[0] == '-'):\r\n if(num >= int(x[1])):\r\n num -= int(x[1])\r\n else:\r\n c += 1\r\nprint(num,c)", "from sys import stdin\r\n_input = stdin.readline\r\n_str, _int, _range = str, int, range\r\ndef solution():\r\n q, n = [_int(i) for i in _input().split()]\r\n g = 0\r\n for i in _range(q):\r\n s = _input().rstrip('\\n')\r\n k = _int(s[2:])\r\n\r\n if s[0] == '-':\r\n if n < k:\r\n g += 1\r\n else:\r\n n -= k\r\n else:\r\n n += k\r\n print(n, g)\r\nsolution()", "n,d=input().split()\nn=int(n)\nd=int(d)\ncnt=0\nfor i in range(n):\n a,b=input().split()\n b=int(b)\n if a==\"+\":\n d+=b\n elif b>d:\n cnt+=1\n else:\n d-=b\nprint(d,cnt)\n\t\t \t \t \t \t\t\t\t\t\t\t\t \t", "n, x = map(int, input().split())\r\nl = []\r\nr_ice = x\r\nd_kid = 0\r\n\r\nfor i in range(n):\r\n amount = input()\r\n l.append(int(amount[0]+amount[2:]))\r\nfor i in l:\r\n if i > 0:\r\n r_ice += i\r\n elif i < 0:\r\n if abs(r_ice)-abs(i) >= 0:\r\n r_ice -= abs(i)\r\n else:\r\n d_kid +=1\r\nprint(r_ice, d_kid)", "times, quant = [int(x) for x in input().split()]\ndisp = 0\nfor _ in range(times):\n ask = input().split()\n oper, count = ask[0], int(ask[1])\n if oper == \"-\" and quant - count >= 0: \n quant -= count\n elif oper == \"+\":\n quant += count\n else :\n disp += 1\nprint(quant, disp)\n \t\t \t \t \t \t \t \t\t \t\t\t", "n,x = map(int,input().split())\r\nc=0\r\nfor i in range(n):\r\n a,b = input().split()\r\n if(a=='+'):\r\n x+=int(b)\r\n else:\r\n if(int(b)<=x):\r\n x-=int(b)\r\n else:\r\n c+=1\r\nprint(x,c) \r\n\r\n", "n, x = [int(i) for i in input().split()]\r\ncount = 0\r\nfor i in range(n):\r\n d = input().split()\r\n if d[0] == \"+\":\r\n x += int(d[1])\r\n elif int(d[1]) > x:\r\n count += 1\r\n else:\r\n x -= int(d[1])\r\nprint(x, count)", "n, x = tuple (map (int, input ().split (' ')))\r\ndistressed = 0\r\nfor i in range (n):\r\n sign, value = tuple (input ().split (' '))\r\n if sign == '+':\r\n x += int (value)\r\n else:\r\n if int (value) > x:\r\n distressed += 1\r\n else:\r\n x -= int (value)\r\nprint (x, distressed)\r\n", "def sol(init, xs):\r\n buf = init\r\n c = 0\r\n for x in xs:\r\n a, b = x\r\n if a == '+':\r\n buf += b\r\n else:\r\n if buf >= b:\r\n buf -= b\r\n else:\r\n c += 1\r\n\r\n return \"{} {}\".format(buf, c)\r\n\r\n\r\n# with open(\"test.txt\", \"r\") as f:\r\n# n, x = list(map(int, input().split()))\r\n# xs = []\r\n# for _ in range(n):\r\n# op, y = input().split()\r\n# xs.append((op, int(y)))\r\n# print(sol(x, xs))\r\n\r\nn, x = list(map(int, input().split()))\r\nxs = []\r\nfor _ in range(n):\r\n op, y = input().split()\r\n xs.append((op, int(y)))\r\nprint(sol(x, xs))\r\n", "from sys import stdin, stdout\r\n\r\ndef get_ints(): return list(map(int, stdin.readline().strip().split()))\r\n\r\ndef get_string(): return stdin.readline().strip()\r\n\r\ndef solve():\r\n n,x = get_ints()\r\n ans = 0\r\n for i in range(n):\r\n s = get_string().split(\" \")\r\n if (s[0]=='+'): x+=int(s[1])\r\n else: \r\n if (x>=int(s[1])): x-=int(s[1])\r\n else: ans+=1\r\n stdout.write(str(x)+\" \"+str(ans)+\"\\n\")\r\n\r\nif __name__ == '__main__':\r\n solve()\r\n ", "arr = ln,ice = [int(x) for x in input().split()]\r\n\r\nvals = []\r\n\r\nfor i in range(0,ln):\r\n z = a,b = [x for x in input().split()]\r\n vals.append(z)\r\n\r\ncream = ice\r\ndist = 0\r\n\r\nfor lst in vals:\r\n if lst[0] == \"+\":\r\n cream += int(lst[1])\r\n else:\r\n if int(lst[1]) <= cream:\r\n cream -= int(lst[1])\r\n else:\r\n dist += 1\r\n \r\n \r\nprint(cream,dist)", "\r\n\r\nn, x = list(map(int, input().split()))\r\nn_bosy = 0\r\nfor i in range(n):\r\n s,d = input().split()\r\n if(s == \"+\"):\r\n x += int(d)\r\n else:\r\n if(abs(int(d)) > x):\r\n n_bosy = n_bosy + 1\r\n else:\r\n x -= abs(int(d))\r\n\r\nprint(f'{x} {n_bosy}')", "n,x=input().split()\r\nn=int(n)\r\nx=int(x)\r\nd=0\r\nfor i in range(n):\r\n c,i=input().split()\r\n if c=='+':\r\n x+=int(i)\r\n else:\r\n if int(i)<=x:\r\n x-=int(i)\r\n else:\r\n d+=1\r\nprint(x,d)\r\n \r\n \r\n ", "n,k=map(int,input().split())\r\nds,t=0,k\r\nfor i in range(n):\r\n\ts,p=input().split()\r\n\tp=int(p)\r\n\tif s==\"+\" :\r\n\t\tt+=p\r\n\telif s==\"-\" and t>=p:\r\n\t\tt-=p\r\n\telse:\r\n\t\tds+=1\r\nprint(t,ds) ", "v,v1=map(int,input().split());c=0\r\nfor i in range(v):\r\n v2, v3 = map(str, input().split());v3=int(v3)\r\n if v2==\"+\":\r\n v1+=v3\r\n elif v1>=v3:\r\n v1-=v3\r\n else:\r\n c+=1\r\nprint(v1,c)", "n,x = map(int,input().split())\r\nd = x\r\ne = 0\r\nfor i in range(n):\r\n a,b = map(str,input().split())\r\n b = int(b)\r\n if a == \"+\":\r\n d += b\r\n elif a == \"-\":\r\n if b <= d:\r\n d -= b\r\n else:\r\n e += 1\r\nprint(d,e)\r\n", "import sys\r\ndef get_ints ():\r\n return map (int, sys.stdin.readline ().strip ().split ())\r\nn , k = get_ints ()\r\ncount = 0\r\nfor i in range (n):\r\n li = input ().strip ().split (' ')\r\n tmp = li [0]\r\n tmp1 = int (li [1])\r\n if tmp== '+':\r\n k += tmp1\r\n else:\r\n if k - tmp1 >= 0:\r\n k = k - tmp1\r\n else:\r\n count += 1\r\n if i == n - 1:\r\n print (k, count)\r\n", "def main():\r\n n,x=map(int,input().split())\r\n d=0\r\n for _ in range(n):\r\n c,r=input().split()\r\n if c=='+':x+=int(r)\r\n else:\r\n r=int(r)\r\n if x>=r:\r\n x-=r\r\n else:\r\n d+=1\r\n print(x,d)\r\nif __name__=='__main__':\r\n main()\r\n", "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\nn, x = readarray(int)\r\n\r\ntotal = x\r\n\r\ndistressedKids = 0 \r\n\r\nfor _ in range(n):\r\n\r\n status, iceCreams = input().split(\" \")\r\n\r\n if status == \"+\":\r\n total += int(iceCreams)\r\n else:\r\n if int(iceCreams) <= total:\r\n total -= int(iceCreams)\r\n else:\r\n distressedKids += 1\r\n\r\nprint(total,distressedKids)\r\n", "a,b=map(int,input().split())\r\nr=0\r\nfor i in range(a):\r\n\tp,q=map(str,input().split())\r\n\tif p=='+':\r\n\t\tb+=int(q)\r\n\telse:\r\n\t\tz=int(q)\r\n\t\tif z<=b:\r\n\t\t\tb-=z\r\n\t\telse:\r\n\t\t\tr+=1\r\nprint(b,r)", "n, x=[int(x) for x in input().split()]\r\ncount=0\r\nfor i in range(n):\r\n c, d= [str(x) for x in input().split()]\r\n d=int(d)\r\n if(c=='-'):\r\n x=x-d\r\n if(c=='+'):\r\n x=x+d\r\n\r\n if(x<0):\r\n count+=1\r\n x+=d\r\n\r\nprint(x, count)\r\n \r\n ", "x=input().split(\" \")\r\ni=int(x[1])\r\nc=0\r\nfor fi in range(int(x[0])):\r\n y=input().split(\" \")\r\n if y[0] == \"+\":\r\n i = i + int(y[1])\r\n else:\r\n if int(y[1]) <= i:\r\n i = i - int(y[1])\r\n else:\r\n c = c + 1\r\nprint(i,c)", "n, x = map(int, input().split())\r\ngrus = 0\r\nkol = x\r\nfor i in range(n):\r\n s, d = map(str, input().split())\r\n if s == \"+\":\r\n kol += int(d)\r\n else:\r\n if kol >= int(d):\r\n kol -= int(d)\r\n else:\r\n grus += 1 \r\n \r\n\r\nprint(kol, grus)", "n, x = list(map(int, input().split()))\r\ndistress = 0\r\n\r\nfor i in range(n):\r\n d, num = input().split()\r\n num = int(num)\r\n if d == '+':\r\n x += num\r\n else:\r\n if num <= x:\r\n x -= num\r\n else:\r\n distress += 1\r\nprint(x, distress)", "n,ic=map(int,input().split())\r\nc=0\r\nfor i in range(n):\r\n s,a=input().split()\r\n a=int(a)\r\n if(s=='+'):\r\n ic+=a\r\n elif(s=='-'):\r\n if((ic-a)>=0):\r\n ic-=a\r\n else:\r\n c+=1\r\nprint(ic,c)\r\n ", "n,x = [int(x) for x in input().split()]\r\nalpha=0\r\nfor _ in range(n):\r\n s,d=[x for x in input().split()]\r\n d = int(d)\r\n if s=='+':\r\n x+=d\r\n else:\r\n if x>=d:\r\n x-=d\r\n else:\r\n alpha+=1\r\nprint(x,alpha)", "n, x = [int(num) for num in input().split(\" \")]\r\ndistressed_children = 0\r\n\r\nfor _ in range(n):\r\n add_or_take, quantity = input().split(\" \")\r\n if add_or_take == \"+\":\r\n x += int(quantity)\r\n else:\r\n if x >= int(quantity):\r\n x -= int(quantity)\r\n else:\r\n distressed_children += 1\r\n\r\n\r\nprint(x, distressed_children)\r\n", "n,x=map(int,input().split())\r\ng=0\r\nfor i in range(n):\r\n a,b=map(str,input().split())\r\n if a==\"+\":\r\n x+=int(b)\r\n if a==\"-\":\r\n if int(b)>x:\r\n g+=1\r\n else:\r\n x-=int(b)\r\nprint(x,g)", "n, x = [int(i) for i in input().split()]\r\ns = 0\r\nfor i in range(n):\r\n e, d = [i for i in input().split()]\r\n d = int(d)\r\n if e == '+':\r\n x += d\r\n else:\r\n if x >= d:\r\n x -= d\r\n else:\r\n s += 1\r\nprint(x, s)", "n,k=map(int,input().split())\r\ndis=0\r\nfor i in range(n):\r\n\ta,b=input().split()\r\n\tb=int(b)\r\n\tif a=='+':\r\n\t\tk+=b\r\n\telse:\r\n\t\tif b<=k:\r\n\t\t\tk-=b\r\n\t\telse:\r\n\t\t\tdis+=1\r\nprint(f'{k} {dis}')\t\t\t", "r, p = map(int, input().split())\r\n\r\ndistress = 0\r\nfor i in range(r):\r\n op, amount = map(str, input().split())\r\n amount = int(amount)\r\n if op == '+':\r\n p += amount\r\n else:\r\n if amount > p:\r\n distress += 1\r\n else:\r\n p -= amount\r\nprint((\"%d %d\") % (p, distress))", "O, P = input().split(\" \")\r\n\r\noperations = []\r\n\r\nfor i in range(0, int(O)):\r\n X = input().split(\" \")\r\n operations.append(X)\r\n\r\nP = int(P)\r\ncount = 0\r\n\r\nfor j in operations:\r\n if j[0] == \"+\":\r\n P += int(j[1])\r\n if j[0] == \"-\":\r\n if P >= int(j[1]):\r\n P -= int(j[1])\r\n else:\r\n count += 1\r\n\r\nprint(P, count)\r\n", "a,b=map(int,input().split())\r\nk=int(0)\r\nfor _ in range(a):\r\n c=input().split(\" \")\r\n if c[0]==\"+\":\r\n b=b+int(c[1])\r\n else:\r\n if b-int(c[1])>=0:\r\n b=b-int(c[1])\r\n else:\r\n k=k+1\r\nprint(b,k)", "n , k = map(int , input().split())\n\ndit = 0\n\nfor i in range(n):\n val , ice = input().split()\n ice = int(ice)\n if(val == '+'):\n k += ice\n else:\n if(ice > k):\n dit += 1\n else:\n k -= ice\n\nprint(k , dit)", "distressed_kids = 0\r\ntest_cases, ice_creams = map(int, input().split())\r\n\r\nwhile test_cases > 0:\r\n # Requested Ice Creams will definitely be an integer.\r\n operator, requested_ice_creams = map(str, input().split())\r\n\r\n if operator == \"-\":\r\n if ice_creams - int(requested_ice_creams) < 0:\r\n distressed_kids += 1\r\n else:\r\n ice_creams -= int(requested_ice_creams)\r\n \r\n if operator == \"+\":\r\n ice_creams += int(requested_ice_creams)\r\n\r\n test_cases -= 1\r\n\r\nprint(ice_creams, distressed_kids)\r\n", "def answer():\r\n n1=[int(x) for x in input().split()]\r\n n = n1[0]\r\n d = n1[1]\r\n dis=0\r\n while n:\r\n \r\n a = input().split()\r\n a[1]=int(a[1])\r\n if a[0]==\"+\":\r\n d+=a[1]\r\n else:\r\n if d-a[1]<0:\r\n dis+=1\r\n else:\r\n d-=a[1]\r\n n-=1\r\n print(d,dis)\r\nanswer()", "# bsdk idhar kya dekhne ko aaya hai, khud kr!!!\r\n# from math import *\r\n# from itertools import *\r\n# import random\r\nn, init = map(int, input().split())\r\ncount_ = 0\r\nfor i in range(n):\r\n arr = list(map(str, input().split()))\r\n if arr[0] == \"+\":\r\n init += int(arr[1])\r\n else:\r\n if int(arr[1]) <= init:\r\n init -= int(arr[1])\r\n else:\r\n count_ += 1\r\nprint(init, count_)\r\n", "n,a = map(int,input().split())\noperations = []\ndistressed = 0\nfor x in range(n):\n b,c = map(str,input().split())\n if(b == \"+\"):\n operations.append(int(c))\n else:\n operations.append(int(c) * -1)\nfor x in range(n):\n if(operations[x] < 0):\n if(a + operations[x] < 0):\n distressed += 1\n else:\n a += operations[x]\n else:\n a += operations[x]\n #print(a)\nprint(a,distressed)\n", "temp = [int(x) for x in input().split()]\r\nn = temp[0]\r\nx = temp[1]\r\nd = 0\r\nfor i in range(n):\r\n temp = input().split()\r\n if temp[0] == '+':\r\n x += int(temp[1])\r\n elif temp[0] == '-':\r\n if x - int(temp[1]) >= 0:\r\n x -= int(temp[1])\r\n else:\r\n d += 1\r\nprint(x, d)\r\n", "n,x = map(int, input().split())\r\ncount = 0\r\nfor i in range(n):\r\n vz, d = input().split()\r\n if vz == \"+\":\r\n x += int(d)\r\n elif vz == \"-\" and x >= int(d):\r\n x -= int(d)\r\n else:\r\n count += 1\r\n \r\nprint(x, count)", "n,c = map(int,input().split())\r\ncountN = 0\r\nfor i in range(n):\r\n a,b = map(str,input().split())\r\n b = int(b)\r\n if a == \"+\":\r\n c+=b\r\n if a == \"-\":\r\n if c<b:\r\n countN+=1\r\n else:\r\n c-=b\r\nprint(c,countN)\r\n", "n,x = map(int,input().strip().split())\nstack=[]\ncount,ans = x,0\nfor i in range(n):\n\ts = input().strip().split()\n\t\n\tif s[0] == '+':\n\t\tcount += int(s[1])\n\tif s[0] == '-':\n\t\tif count - int(s[1]) >= 0:\n\t\t\tcount = count - int(s[1])\n\t\telse:\n\t\t\tans += 1\nprint(count, ans)\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\ncnt = 0\r\nfor _ in range(n):\r\n d,num = input().split()\r\n num = int(num)\r\n if d == '+':\r\n x += num\r\n else:\r\n if x >= num:\r\n x-=num\r\n else:\r\n cnt += 1\r\nres = [str(x),str(cnt)]\r\nprint(' '.join(res))", "n,x = (map(int,input().split()))\r\nd = 0\r\nfor _ in range(n) :\r\n a = input().split()\r\n if a[0]==\"+\" :\r\n x+=int(a[1])\r\n else :\r\n if x<int(a[1]) :\r\n d+=1\r\n else :\r\n x-=int(a[1])\r\nprint(str(x)+\" \"+str(d))", "n, girls_pack = input().split()\r\nn = int(n)\r\ngirls_pack = int(girls_pack)\r\nnbr_depressed = 0\r\ncounter = girls_pack\r\nmy_list = []\r\n\r\nfor i in range(n):\r\n packs = input()\r\n my_list.append(packs)\r\n\r\nfor j in range(len(my_list)):\r\n sign, packs = my_list[j].split()\r\n packs = int(packs)\r\n\r\n if sign == \"+\":\r\n counter += packs\r\n continue\r\n elif sign == \"-\":\r\n if counter >= packs:\r\n counter -= packs\r\n else:\r\n nbr_depressed += 1\r\n\r\nprint(str(counter) + \" \" + str(nbr_depressed))\r\n", "n, x = [int(a) for a in input().split()]\r\ndist = 0\r\nsum = x\r\nfor i in range(n):\r\n c, d = [a for a in input().split()]\r\n d = int(d)\r\n if c == '+':\r\n sum += d\r\n else:\r\n if d>sum: dist+=1\r\n else: sum-=d\r\nprint(sum, dist)", "n, x = map(int, input().split())\r\ncount = 0\r\n\r\nfor i in range(n):\r\n sign, packs = input().split()\r\n packs = int(packs)\r\n\r\n if sign == \"+\":\r\n x += packs\r\n elif sign == \"-\" and x < packs:\r\n count += 1\r\n else:\r\n x -= packs\r\nprint(x, count)", "n ,x =map(int, input().split(' '))\r\nsadKid = 0\r\nfor _ in range(n):\r\n sign , mount = input().split(' ')\r\n mount = int(mount)\r\n if sign == '+':\r\n x += mount\r\n if sign == '-':\r\n if (x - mount < 0):\r\n sadKid += 1\r\n else:\r\n x -= mount\r\nprint(x ,sadKid)", "n,x=list(map(int,input().split()))\r\ncounter=0\r\nfor i in range(n):\r\n operation,new_x=input().split()\r\n if operation=='+':\r\n x+=int(new_x)\r\n else:\r\n if int(new_x) <=x:\r\n x-=int(new_x)\r\n else :\r\n counter+=1\r\nprint(x,counter)\r\n\r\n", "n,x=map(int,input().split())\r\ncnt=0\r\nfor i in range(n):\r\n c,dx=input().split()\r\n dx=int(dx)\r\n if c=='+':x+=dx\r\n else:\r\n if dx>x:cnt+=1\r\n else:x-=dx\r\nprint(x,cnt)\r\n", "a,b = map(int,input().split())\navailablepacks = b\nd = 0\nf = 0\ng = 0\nfor i in range(a):\n\ts = input()\n\tp,q = map(str,s.split())\n\tif p == \"+\":\n\t\tavailablepacks += int(q)\n\t\tf += 1\n\n\telse:\n\t\tif int(q) <= availablepacks:\n\t\t\tavailablepacks -= int(q)\n\t\t\tg += 1\n\t\telse:\n\t\t\td += 1\nprint(availablepacks,d)\n\t\t\t\n\n \t \t\t \t\t\t \t \t\t\t \t \t \t\t\t", "n,d=input().split()\r\nd=int(d)\r\nc=0\r\nfor i in range(int(n)):\r\n m,s=input().split()\r\n if m==\"+\" :\r\n d+=int(s) \r\n elif m==\"-\" :\r\n if d>=int(s) : \r\n d-=int(s)\r\n else : \r\n c+=1\r\n continue\r\nprint(d,c)", "n,x = map(int, input().split())\r\nc = 0\r\nfor i in range(n):\r\n d = input().split()\r\n if d[0] == '+':\r\n x+=int(d[1])\r\n else:\r\n if x>=int(d[1]):\r\n x-=int(d[1])\r\n else:\r\n c+=1\r\nprint(x, c)", "I=[int(i) for i in input().split()]\r\nM,N=[],[]\r\nfor i in range(I[0]):\r\n k=[i for i in input().split()]\r\n M.append(k[0])\r\n N.append(k[1])\r\ns,count=I[1],0\r\nfor i in range(I[0]):\r\n if M[i]==\"+\":\r\n s+=int(N[i])\r\n else:\r\n if s<int(N[i]):\r\n count+=1\r\n else:\r\n s-=int(N[i])\r\nprint(s,count)", "n,x=map(int,input().split())\r\ndis=0\r\nfor _ in range(n):\r\n s=input()\r\n if s[0]=='+':\r\n x=x+int(s[2:])\r\n else:\r\n need=int(s[2:])\r\n if need>x:\r\n dis+=1\r\n else:\r\n x=x-need\r\nprint(x,dis)\r\n", "n,x=map(int,input().split())\r\ndist=0\r\nfor i in range(n):\r\n a,b=input().split()\r\n b=int(b)\r\n if(a=='+'):\r\n x+=b\r\n elif(a=='-'):\r\n if(x<b):\r\n dist+=1\r\n else:\r\n x-=b\r\nprint(x,dist)\r\n", "a,b = input().split()\r\na,b =[int(a),int(b)]\r\ndistress=0\r\ntotal = b\r\nfor i in range(a):\r\n inp = eval(input())\r\n if total+inp<0:\r\n distress = distress + 1\r\n else:\r\n total = total+inp\r\n\r\nprint(f'{total} {distress}')\r\n", "\r\nn, x = input().split()\r\nicePacks, distressed = int(x), 0\r\nfor i in range(int(n)):\r\n sign, d = input().split()\r\n d = int(d)\r\n if sign == '+':\r\n icePacks += d\r\n else:\r\n if icePacks >= d:\r\n icePacks -= d\r\n else:\r\n distressed += 1\r\n\r\nprint(f\"{icePacks} {distressed}\")\r\n", "n, packs = map(int, input().split())\r\nchild = 0\r\nfor _ in range(n):\r\n a, b = input().split()\r\n b = int(b)\r\n if a == '+':\r\n packs += b\r\n else:\r\n if packs < b:\r\n child += 1\r\n continue\r\n packs -= b\r\nprint(packs, child)\r\n", "a,b=[int(v) for v in input().split()]\r\nsum=0\r\nfor i in range(a):\r\n x,t=[v for v in input().split()]\r\n t=int(t)\r\n if x==\"+\": b+=t\r\n else:\r\n if b>=t: b-=t\r\n else: sum+=1\r\nprint(b,sum)", "times,ice_cream = map(int,input().split())\r\nsad_kids = 0\r\nfor x in range(times):\r\n sign,order = input().split()\r\n if sign in '+':\r\n ice_cream+= int(order)\r\n else:\r\n if ice_cream >= int(order):\r\n ice_cream -= int(order)\r\n else:\r\n sad_kids += 1\r\n\r\nprint(ice_cream,end=' ')\r\nprint(sad_kids)", "distressedPeople = 0\npeopleInQueue, iceCreams = input().split()\npeopleInQueue = int(peopleInQueue)\niceCreams = int(iceCreams)\n\nfor i in range(peopleInQueue):\n plusOrMinus, value = input().split()\n value = int(value)\n if(plusOrMinus == '+'):\n iceCreams += value\n elif(plusOrMinus == '-'):\n if(iceCreams >= value):\n iceCreams -= value\n else:\n distressedPeople += 1\nprint(iceCreams, distressedPeople)\n\t\t\t \t \t\t\t \t \t \t\t \t", "from sys import stdin\r\n#n=int(stdin.readline().strip())\r\nn,m=map(int,stdin.readline().strip().split())\r\n\r\n#s=list(map(int,stdin.readline().strip().split()))\r\nx=0\r\nfor i in range(n):\r\n a,b=stdin.readline().strip().split()\r\n b=int(b)\r\n if a==\"+\":\r\n m+=int(b)\r\n else:\r\n if m>=b:\r\n m-=b\r\n else:\r\n x+=1\r\nprint(m,x)\r\n \r\n \r\n", "n, x = list(map(int, input().split(\" \")))\r\nb = 0\r\nfor i in range(n):\r\n s = input().split(\" \")\r\n if s[0] == \"+\":\r\n x += int(s[1])\r\n else:\r\n if x < int(s[1]):\r\n b+=1\r\n else:\r\n x -= int(s[1])\r\n\r\nprint(x, b)\r\n", "n,x=map(int,input().split())\nic_available=x\ndis=0\nfor i in range(n):\n ch,no=input().split()\n if ch=='+':\n ic_available+=int(no) \n elif ch=='-':\n if ic_available>=int(no):\n ic_available-=int(no) \n else:\n dis+=1\nprint(ic_available,dis)\n \t \t \t \t\t\t \t \t\t\t\t\t\t \t \t \t", "n,x = map(int, input().split())\r\nsadKids = 0\r\n\r\nfor i in range(n):\r\n event = [y for y in input().split()]\r\n amount = int(event[1])\r\n if event[0] == '+':\r\n x += amount\r\n else:\r\n if x >= amount:\r\n x -= amount\r\n else:\r\n sadKids += 1\r\nprint (x, sadKids)", "n, x = map(int, input().split())\r\ntrack_ice = x\r\ndist_child = 0\r\n\r\nfor i in range(n):\r\n a, b = input().split()\r\n if a == \"+\":\r\n track_ice += int(b)\r\n elif a == \"-\":\r\n if track_ice >= int(b):\r\n track_ice -= int(b)\r\n else:\r\n dist_child += 1\r\n\r\nprint(track_ice, dist_child)", "n, x = map(int, input().split())\r\npacks = x\r\ndistress = 0\r\nfor i in range(n):\r\n c_k = list(map(str, input().split()))\r\n if c_k[0] == '+':\r\n packs += int(c_k[1])\r\n elif c_k[0] == '-' and packs >= int(c_k[1]):\r\n packs -= int(c_k[1])\r\n elif c_k[0] == '-' and packs < int(c_k[1]):\r\n distress += 1\r\nprint(packs, distress)\r\n", "#Free Ice Cream\r\nn,x = map(int,input().split())\r\ndis = 0\r\nfor i in range(n):\r\n s,d = input().split()\r\n d = int(d)\r\n if s == '+':\r\n x+=d\r\n else:\r\n if x>=d:\r\n x-=d\r\n else:\r\n dis+=1\r\nprint(x,dis)\r\n", "n, x = map(int,input().split())\r\ndistress_kids = 0\r\n\r\nfor i in range(n):\r\n process = input()\r\n if process[0] == '+':\r\n x += int(process[2:])\r\n else:\r\n if x >= int(process[2:]):\r\n x -= int(process[2:])\r\n else:\r\n distress_kids += 1\r\n \r\nprint(x, distress_kids)", "n,m=map(int,input().split())\r\nc=0\r\nfor _ in range(n):\r\n c1,c2=map(str,input().split())\r\n if c1=='-':\r\n if m>=int(c2):\r\n m-=int(c2) \r\n else:\r\n c+=1\r\n else:\r\n m+=int(c2)\r\nprint(m,c,sep=' ')", "n, x = map(int, input().split())\r\nd = 0\r\nfor _ in range(n):\r\n action, num = input().split()\r\n num = int(num)\r\n if action == '+':\r\n x += num\r\n elif action == '-':\r\n if x >= num:\r\n x -= num\r\n else:\r\n d += 1\r\n \r\nprint(x, d)", "n,x = map(int,input().split())\r\ns = x\r\nleft = 0\r\nfor i in range(n):\r\n st = input()\r\n l = st.split(\" \")\r\n sign = l[0]\r\n num = int(l[1])\r\n if sign == '+':\r\n s+=num\r\n else:\r\n if s >= num:\r\n s-=num\r\n else:\r\n left+=1\r\nprint(s,left)", "n,x = [int(i) for i in input().split()]\r\nrem = x\r\niceleft,dis=0,0\r\nfor _ in range(n): \r\n ice = input()\r\n if eval(ice)<0 and abs(eval(ice))<=rem:\r\n rem += eval(ice)\r\n elif eval(ice)>0: \r\n rem+=eval(ice)\r\n else: \r\n dis+=1\r\n #print(rem,dis)\r\nprint(rem,dis)", "'''CodeForces: Free Ice Cream'''\r\n\r\nif __name__ == '__main__':\r\n n, x = map(int, input().split())\r\n count = 0\r\n for _ in range(n):\r\n line = input().split()\r\n if line[0] == '+':\r\n x += int(line[1])\r\n else:\r\n if int(line[1]) > x:\r\n count += 1\r\n else:\r\n x -= int(line[1])\r\n\r\n print(x, count, sep=' ')\r\n", "n , x = map(int,input().split())\r\ncount = 0\r\nfor i in range(n):\r\n st = input()\r\n if st[0] == \"+\":\r\n x+=int(st[2:])\r\n else:\r\n if x < int(st[2:]):\r\n count+=1\r\n else:\r\n x-=int(st[2:])\r\nprint(x,count)", "from sys import stdin , setrecursionlimit\ninput = stdin.readline\n\ndef answer(x):\n\n ans = 0\n\n for i in range(n):\n s = input().split()\n value = int(s[1])\n\n if(s[0] == '+'):\n x += value\n else:\n if(x - value < 0):ans += 1\n else:x -= value\n\n return [x , ans]\n \n \n\nfor T in range(1):\n\n n , x = map(int,input().split())\n\n\n \n print(*answer(x))\n\n \t\t \t \t \t \t \t \t\t\t \t\t\t \t", "# from math import ceil\r\nfor _ in range(1):\r\n\r\n n, x = map(int , input().split())\r\n\r\n distressed = 0\r\n iceCreams = x\r\n\r\n for i in range(n):\r\n a, b = map(str, input().split())\r\n b = int(b)\r\n\r\n if a == \"+\":\r\n iceCreams += b\r\n \r\n else:\r\n if b > iceCreams:\r\n distressed += 1\r\n else:\r\n iceCreams -= b\r\n\r\n\r\n print(iceCreams, distressed)", "n=input()\r\nn=n.replace('\\r','');\r\nn,x=n.split(' ',2);\r\nn=int(n)\r\n#x=int(input())\r\nx=int(x)\r\ns=x;\r\nans=0;\r\nwhile n>0:\r\n n-=1\r\n t=input();\r\n t=t.replace(' ','');\r\n t=int(t)\r\n \r\n if(s+t>=0):\r\n s=s+t\r\n else:\r\n ans+=1\r\n #print(s)\r\nprint(s,ans)", "n,x=map(int,input().split())\nans=0\nfor i in range(n):\n c,a=input().split()\n a=int(a)\n if(c=='-'):\n if(x<a):\n ans+=1\n else:\n x-=a\n else:\n x+=a\nprint(x,ans)\n\n \t\t \t\t \t\t\t\t \t\t\t \t\t \t \t\t", "n,x = map(int,input().split())\r\nchild = 0\r\nwhile n > 0:\r\n opr,di = input().split()\r\n if opr == '+':\r\n x += int(di)\r\n else:\r\n if int(di) > x:\r\n child += 1\r\n else:\r\n x -= int(di)\r\n\r\n n -= 1\r\nprint(x, child)", "import sys\r\n\r\n\r\ndef main(fin):\r\n # t = int(fin.readline())\r\n # for x in range(t):\r\n # # d = solve5(x)\r\n # # print('Case #' + str(x+1) + ': ' + str(d))\r\n # # print(solve(x))\r\n # solve(x)\r\n\r\n solve()\r\n\r\n\r\n\r\ndef solve():\r\n # n = int(fin.readline())\r\n # ls = fin.readline().rstrip(\"\\n\")\r\n n, k = [int(i) for i in list(fin.readline().split())]\r\n # l = [int(i) for i in list(fin.readline().split())]\r\n b = 0\r\n for i in range(n):\r\n ls = list(fin.readline().split())\r\n a = int(ls[1])\r\n if ls[0] == '+':\r\n k += a\r\n else:\r\n if a <= k:\r\n k -= a\r\n else:\r\n b += 1\r\n print(k, b)\r\n\r\n\r\n\r\nif __name__ == '__main__':\r\n fin = sys.stdin\r\n # fin = open(\"input.txt\")\r\n main(fin)\r\n", "n,x=[int(e) for e in input().split()]\r\nc=0\r\nfor _ in range(n):\r\n a=eval(input())\r\n if x+a<0:\r\n c+=1\r\n else:\r\n x+=a\r\nprint(x,c)", "n, x = map(int, input().split())\r\ndistress = 0\r\nfor i in range(n):\r\n s = input()\r\n d = int(s[2:])\r\n if s[0] == '+':\r\n x += d\r\n else:\r\n if(x < d):\r\n distress += 1\r\n continue\r\n else:\r\n x -= d\r\nprint(x, distress)\r\n", "n,pack=map(int,input().split())\r\ndistress=0\r\nfor i in range(n):\r\n a,b=map(str,input().split())\r\n if a=='-':\r\n if pack>=int(b):\r\n pack-=int(b)\r\n else : distress+=1\r\n else : pack+=int(b)\r\nprint(pack,distress)", "n, tot = map(int, input().split())\r\ndist = 0\r\nfor i in range(n):\r\n sym, val = input().split()\r\n val = int(val)\r\n if(sym == \"+\"):\r\n tot+=val\r\n else:\r\n if(val > tot): dist+=1\r\n else: tot-=val\r\nprint(tot, dist, sep=\" \")", "n, x = (input().split())\r\nn , x = int(n), int(x)\r\n#m = int(input())\r\n#a = input()\r\n#a = a.split()\r\n#a = [int(x) for x in a]\r\n#n , x = a\r\nk = 0\r\nfor i in range(n):\r\n a = input()\r\n a = a.split()\r\n if a[0] == '+':\r\n a = int(a[1])\r\n else:\r\n a = -int(a[1])\r\n\r\n if x >= - a:\r\n x += a\r\n else:\r\n k += 1\r\n\r\nprint(x, k)", "n, x = map(int, input().split())\r\n\r\nice_cream_left = x\r\ndistressed_kids = 0\r\n\r\nfor _ in range(n):\r\n operation, d = input().split()\r\n d = int(d)\r\n \r\n if operation == '+':\r\n ice_cream_left += d\r\n else:\r\n if d <= ice_cream_left:\r\n ice_cream_left -= d\r\n else:\r\n distressed_kids += 1\r\n\r\nprint(ice_cream_left, distressed_kids)\r\n", "n,x = map(int,input().split())\r\ncnt = 0\r\nfor _ in range(n):\r\n\ts = input().split()\r\n\tif s[0] == '+':\r\n\t\tx += int(s[1])\r\n\telse:\r\n\t\tif x >= int(s[1]):\r\n\t\t\tx-=int(s[1])\r\n\t\telse:\r\n\t\t\tcnt+=1\r\nprint(x,cnt)", "a,t=map(int,input().split())\r\nk=0\r\nfor x in range(a):\r\n c,d=input().split()\r\n d=int(d)\r\n if c=='-':\r\n t-=d\r\n if t<0:\r\n k+=1\r\n t+=d\r\n else:\r\n t+=d\r\nprint(t,k)\r\n ", "s = input().split()\r\nx = int(s[1])\r\nk = 0\r\nfor i in range(int(s[0])):\r\n g = input()\r\n if g[0] == '+':\r\n x += int(g[2:])\r\n else:\r\n if x - int(g[2:]) < 0:\r\n k += 1\r\n else:\r\n x -= int(g[2:])\r\nprint(x, k)", "n,x=map(int,input().split())\r\nc=0\r\nfor i in range(n):\r\n s,d=map(str,input().split())\r\n d=int(d)\r\n if s==\"+\":\r\n x=x+d\r\n else:\r\n if x>=d:\r\n x=x-d\r\n else:\r\n c=c+1\r\nprint(x,c)\r\n ", "n,k=map(int,input().split())\r\ns,d=k,0\r\nfor i in range(n):\r\n l=input().split()\r\n l[1]=int(l[1])\r\n if l[0]=='+':\r\n s+=l[1]\r\n else:\r\n if l[1]<=s:\r\n s-=l[1]\r\n else:\r\n d+=1\r\nprint(s,d)", "n, x = map(int, input().split())\r\nDisKids = 0 \r\nwhile n:\r\n c, d = input().split()\r\n if c == '+': x += int(d)\r\n elif x >= int(d): x -= int(d)\r\n else : DisKids += 1\r\n n -= 1\r\nprint(x, DisKids)", "n, x = map(int, input().split())\r\ncnt = 0\r\n\r\nfor _ in range(n):\r\n sign, am = input().split()\r\n am = int(am)\r\n if sign == \"+\":\r\n x += am\r\n elif am <= x:\r\n x -= am\r\n else:\r\n cnt += 1\r\n\r\nprint(x, cnt)\r\n", "c=0\r\nn,x=map(int,input().split())\r\nfor _ in range(n):\r\n a,b=map(str,input().split())\r\n if a=='+':\r\n x=x+int(b)\r\n else:\r\n if x>=int(b):\r\n x=x-int(b)\r\n else:\r\n c=c+1\r\nprint(x,c)", "n,i=map(int,input().split())\r\ndk=0\r\nfor j in range(n):\r\n s,c=map(str,input().split())\r\n if s=='+':\r\n i+=int(c)\r\n elif s=='-':\r\n if int(c)>i:\r\n dk+=1\r\n else:\r\n i-=int(c)\r\nprint(i,dk)", "n, x = map(int, input().split())\n\ndistress = 0\n\nfor i in range(n): \n op, d = input().split()\n d = int(d)\n if op == \"+\": \n x += d\n else: \n if d > x: \n distress += 1\n else: \n x -= d\nprint(x, distress)\n", "rows, started_ice = map(int, input().split())\r\n\r\nsad_child = 0\r\nstorage_ice = started_ice\r\nfor _ in range(rows):\r\n a = input()\r\n b = int(a[2:])\r\n if a[0] == \"-\":\r\n if storage_ice >= b:\r\n storage_ice -= b\r\n else:\r\n sad_child +=1\r\n else:\r\n storage_ice += b\r\n \r\nprint(storage_ice, sad_child)", "# A. Free Ice Cream\r\nt,s=map(int,input().split())\r\nc=0\r\nfor i in range(t):\r\n a,d=map(str,input().split())\r\n d=int(d)\r\n if a==\"+\":\r\n s+=d\r\n else:\r\n if s>=d:\r\n s-=d\r\n else:\r\n c+=1\r\nprint(s,c)", "n, x = [int(i) for i in input().split()]\r\ny = 0\r\nfor i in range(n):\r\n a, b = input().split()\r\n if a == \"+\":\r\n x += int(b)\r\n else:\r\n if x < int(b):\r\n y += 1\r\n else:\r\n x -= int(b)\r\nprint(x, y)\r\n", "n, x = map(int, input().split())\r\ns = 0\r\nfor i in range(n):\r\n k = int(input().replace(\" \", \"\"))\r\n if x + k >= 0:\r\n x += k\r\n else:\r\n s += 1\r\nprint(x, s)", "\r\nt,x = list(map(int, input().split()))\r\nkids = 0\r\nfor _ in range(t):\r\n a = list(map(str, input().split()))\r\n if a[0] == \"+\":\r\n x += int(a[1])\r\n if a[0] == \"-\":\r\n if x-int(a[1]) >= 0:\r\n x -= int(a[1])\r\n else:\r\n kids += 1\r\nprint(x,kids)", "n, x = input().split(\" \")\r\nn, x = int(n), int(x)\r\nn_kids = 0\r\nfor i in range(0, n):\r\n d = input().split(\" \")\r\n if d[0] == \"-\" and x < int(d[1]):\r\n n_kids += 1\r\n continue\r\n if d[0] == \"-\":\r\n x -= int(d[1])\r\n if d[0] == \"+\":\r\n x += int(d[1])\r\n\r\nprint(x, n_kids)", "from sys import stdin,stdout\nfrom math import gcd,sqrt,floor,ceil\n# Fast I/O\ninput = stdin.readline\n#print = stdout.write\n\ndef list_inp(x):return list(map(x,input().split()))\ndef map_inp(x):return map(x,input().split())\n\ndef lcm(a,b): return (a*b)/gcd(a,b)\n\n\nn,x = map_inp(int)\ndis = 0\nfor _ in range(n):\n\ta,b = map_inp(str)\n\tb = int(b)\n\tif a == '+':\n\t\tx+=b\n\telse:\n\t\tif x < b:\n\t\t\tdis+=1\n\t\telif x >= b:\n\t\t\tx-=b\nprint(x,dis)\n\n", "from sys import stdin \r\n\r\ndef input():\r\n return stdin.readline().strip()\r\n\r\nn, x = map(int, input().split())\r\ncounter = 0\r\nfor _ in range(n):\r\n char, amount = input().split()\r\n amount = int(amount)\r\n if char == \"+\":\r\n x += amount\r\n else:\r\n if x < amount:\r\n counter += 1\r\n else:\r\n x -= amount\r\n \r\nprint(x, counter)", "n,x = map(int,input().split())\r\nd = 0\r\nfor i in range(n):\r\n s = input().split()\r\n if s[0]=='+':\r\n x+=int(s[-1])\r\n else:\r\n if x<int(s[-1]):\r\n d+=1\r\n else:\r\n x-=int(s[-1])\r\nprint(x,d)", "x,Sum=input().split(\" \")\r\nx,Sum=int(x),int(Sum)\r\nc=0\r\nfor i in range(x):\r\n e,s=input().split(\" \")\r\n if e==\"+\":\r\n Sum+=int(s)\r\n else:\r\n if int(s)<=Sum:#give him\r\n Sum-=int(s)\r\n else:\r\n c+=1\r\nprint(Sum,c)", "n,x = map(int,input().split())\r\ntotal = x \r\ndk = 0\r\nfor _ in range(n):\r\n op,k = map(str,input().split())\r\n d = int(k) \r\n if op == \"-\":\r\n if d <= total:\r\n total -= d\r\n else:\r\n dk += 1 \r\n if op == '+':\r\n total += d\r\n \r\nprint(total,dk) \r\n \r\n \r\n", "#!/usr/bin/env python\r\n# -*- coding: utf-8 -*-\r\nimport sys\r\ninput = sys.stdin.readline\r\n\r\ndef cin():\r\n\treturn(int(input()))\r\ndef cin_():\r\n\treturn(list(map(int,input().split())))\r\n\r\n# def caso():\r\n\t\r\n# def codeforces():\r\n\t# t = cin()\r\n\t# for i in range(t):\r\n\t\t# caso()\r\n\r\ndef main(args):\r\n\t# codeforces()\r\n\tn, x = cin_()\r\n\tdatos = []\r\n\tfor i in range(n):\r\n\t\ts = input().strip().split(\" \")\r\n\t\tdatos.append(s)\r\n\t\r\n\tans = 0 \r\n\tfor i in range(n):\r\n\t\tif(datos[i][0] == '+'):\r\n\t\t\tx += int(datos[i][1])\r\n\t\t\r\n\t\telse:\r\n\t\t\tif(int(datos[i][1]) <= x):\r\n\t\t\t\tx -= int(datos[i][1])\r\n\t\t\telse:\r\n\t\t\t\tans += 1\r\n\t\r\n\tprint(x, ans)\r\n\treturn 0\r\n\r\nif __name__ == '__main__':\r\n\timport sys\r\n\tsys.exit(main(sys.argv))\r\n", "orders,packs = map(int,input().split())\r\nnorders = list(list(input().split())for _ in range(orders))\r\ndist_kids = 0\r\nfor i in norders:\r\n if \"+\"in i:\r\n packs+=int(i[1])\r\n if \"-\"in i:\r\n if int(i[1])>packs:\r\n dist_kids+=1\r\n else:\r\n packs-=int(i[1])\r\nprint(packs,dist_kids)", "t, amount = list(map(int, input().split()))\r\nm = 0\r\nwhile t > 0:\r\n a, b = list(map(str, input().split()))\r\n if a == '+':\r\n amount = amount + int(b)\r\n else:\r\n if amount >= int(b):\r\n amount = amount - int(b)\r\n else:\r\n m = m + 1\r\n t = t - 1\r\nprint(str(amount) + \" \" + str(m))", "n, x = map(int, input().split())\nans = 0\nfor i in range(n):\n s = input().split()\n if s[0] == '+': x += int(s[1])\n else:\n if int(s[1]) <= x: x -= int(s[1])\n else: ans -= -1\nprint(x, ans)\n\t \t\t\t \t\t \t \t\t \t", "n,d=map(int,input().split())\r\nc=0\r\nfor x in range(n):\r\n\ta,b=input().split()\r\n\tif a==\"+\":\r\n\t\td+=int(b)\r\n\telif a==\"-\":\r\n\t\tif int(b)>d:c+=1\r\n\t\telse:d-=int(b)\r\nprint(d,c)", "n,k=map(int,input().split())\r\ncount=0\r\nfor i in range(n):\r\n s,m=map(str,input().split())\r\n m=int(m)\r\n if s=='+':\r\n k+=m\r\n else:\r\n if k<m:\r\n count+=1\r\n else:\r\n k-=m\r\nprint(k,count)\r\n \r\n \r\n", "def inp():\r\n return(int(input()))\r\ndef inlt():\r\n return(list(map(int,input().split())))\r\ndef insr():\r\n s = input()\r\n return(list(s[:len(s) - 1]))\r\ndef invr():\r\n return(map(int,input().split()))\r\n \r\ndef loadinput():\r\n allreqs=[]\r\n n,inithave = map(int, input().split()) \r\n for _ in range (n):\r\n allreqs.append(list(map(str,input().split())))\r\n return allreqs , inithave\r\n \r\nif __name__ == '__main__':\r\n #inithave= 17\r\n #allreq = [['-', 16],['-',2],['-',98],['+',100],['-',98]]\r\n allreq , inithave = loadinput()\r\n have = inithave\r\n distress = 0\r\n for s in allreq:\r\n if s[0] == '+' :\r\n have+=int(s[1])\r\n elif s[0] == '-':\r\n if int(s[1]) <= have:\r\n have -= int(s[1])\r\n else :\r\n distress +=1\r\n print(have, distress)", "\r\ndef main():\r\n k = 0\r\n n, x = map(int, input().split())\r\n for i in range(n):\r\n a, b = input().split()\r\n if a == '+':\r\n x += int(b)\r\n elif x - int(b) < 0:\r\n k += 1\r\n else:\r\n x -= int(b)\r\n print(x, k)\r\nmain()\r\n", "import math\r\nimport sys\r\na,b = map(int,input().split())\r\nchild=0\r\nfor _ in range(a):\r\n # type,cur=map(string, input().split())\r\n # cur=int(cur)\r\n # type=input()\r\n # cur=int(input())\r\n type, cur = sys.stdin.readline().split()\r\n cur=int(cur)\r\n if type == \"+\":\r\n b+=cur\r\n elif b<cur:\r\n child+=1\r\n else:\r\n b-=cur\r\nprint(b,child)", "n,x=[int(_) for _ in input().split()]\r\nd=0\r\nfor _ in range(n):\r\n ip=input()\r\n if ip[0]==\"+\":\r\n x+=int(ip[2:])\r\n else:\r\n c=int(ip[2:])\r\n if c<=x:\r\n x-=c \r\n else:\r\n d+=1\r\nprint(x,d)", "a,b = map(int,input().split())\r\nnew = 0\r\nfor i in range(a):\r\n\tx,y = input().split()\r\n\tif x == \"+\":\r\n\t\tb+= int (y)\r\n\telse:\r\n\t\tif b>= int(y):\r\n\t\t\tb = b-int(y)\r\n\t\telse:\r\n\t\t\tnew+=1\r\nprint(b,new)", "n,x=map(int,input().split())\r\nchildren=0\r\nfor _ in range (n):\r\n l=list(input().split())\r\n if (l[0]=='+'):\r\n x+=int(l[1])\r\n else:\r\n if x<int(l[1]):\r\n children+=1\r\n else:\r\n x-=int(l[1])\r\nprint(x,children)", "n,x=map(int,input().split())\r\nr=0\r\nlst=[]\r\nfor i in range(n):\r\n s,p=map(str,input().split())\r\n if s==\"+\":\r\n x+=int(p)\r\n if s==\"-\":\r\n if int(p)>x:\r\n r+=1\r\n else:\r\n x-=int(p)\r\nlst.append(x)\r\nlst.append(r)\r\nprint(*(lst))\r\n", "n ,x = [int(x)for x in input().split()]\nresult = 0\nfor i in range(n):\n s = input()\n if(s[0]== '+'):\n s = int(s[2:])\n x+=s\n else:\n s = int(s[2:])\n if(x>=s):\n x-=s\n else:\n result+=1\n \nprint(x,result)\n", "n,x=map(int,input().split())\r\nhozir_bor = x\r\nqaygu = 0\r\nfor a in range(n):\r\n s,d=input().split()\r\n d=int(d)\r\n if s=='+':\r\n hozir_bor += d\r\n else:\r\n if hozir_bor < d:\r\n qaygu += 1\r\n else:\r\n hozir_bor -= d\r\nprint(hozir_bor, qaygu)", "n,x=map(int,input().split())\r\nsum,d=x,0\r\nfor i in range(n):\r\n a,b=input().split()\r\n if a=='+':\r\n sum+=int(b)\r\n elif sum>=int(b):\r\n sum-=int(b)\r\n else:\r\n d+=1\r\nprint(sum ,d)", "n, icecream = map(int, input().split())\npeople = 0\nfor i in range(n): # 0 1 2 3 4\n ch, x = input().split()\n x = int(x)\n if ch == '+':\n icecream += x\n else:\n if x > icecream:\n people += 1\n else:\n icecream -= x\nprint(icecream,people)\n\t \t\t\t \t\t\t \t\t\t \t\t\t\t\t \t \t\t \t", "# http://codeforces.com/contest/686/problem/A\r\n\r\nn, c = list(map(int, input().split()))\r\nd = 0\r\n\r\nfor i in range(n):\r\n s = input()\r\n count = int(s[2:])\r\n if s[0] == '+':\r\n c += count\r\n elif count <= c:\r\n c -= count\r\n else:\r\n d += 1\r\n\r\nprint(c, d)", "countChild = 0\r\ncountState, countIceCream = map(int,input().split())\r\nfor state in range(countState):\r\n operation,number = input().split()\r\n if operation == '+':\r\n countIceCream += int(number)\r\n else:\r\n if int(number) > countIceCream:\r\n countChild += 1\r\n else:\r\n countIceCream -= int(number)\r\nprint(countIceCream,countChild)", "import sys\r\nn, x = [int(num) for num in sys.stdin.readline()[:-1].split()]\r\ndistressed_child = 0\r\nfor i in range(n):\r\n op, d = sys.stdin.readline()[:-1].split()\r\n d = int(d)\r\n if op == \"+\":\r\n x += d\r\n else:\r\n if x >= d:\r\n x -= d\r\n else:\r\n distressed_child += 1\r\n\r\nprint(x, distressed_child)", "a, b = map(int, input().split())\r\ncnt = 0\r\nfor _ in range(a):\r\n sign, num = input().split()\r\n nnum = int(num)\r\n if sign == \"+\":\r\n b += nnum\r\n else:\r\n if nnum > b:\r\n cnt += 1\r\n else:\r\n b -= nnum\r\n # print(b)\r\nprint(f'{b} {cnt}')\r\n", "n,x = list( map(int,input().split()) )\r\nd=0\r\nfor i in range(n):\r\n a = input().split()\r\n a[1] = int(a[1])\r\n if a[0]==\"+\":\r\n x+=a[1]\r\n else:\r\n if a[1]>x:\r\n d+=1\r\n else:\r\n x-=a[1]\r\nprint(str(x)+\" \"+str(d))", "a,b=map(int,input().split())\r\nm=b\r\ng=0\r\nfor x in range(a):\r\n c,d=input().split()\r\n d=int(d)\r\n if c=='+' :\r\n m+=d\r\n else:\r\n if m>=d:\r\n m-=d\r\n else:\r\n g+=1\r\nprint(m,g)", "# 코드포스 686A Free Ice Cream\r\nimport sys\r\nput = sys.stdin.readline\r\n\r\nn, x = map(int, put().split())\r\ncnt = 0\r\n\r\nwhile n:\r\n n -= 1\r\n data = put().split()\r\n d = int(data.pop(-1))\r\n\r\n if data[0] == '+':\r\n x += d\r\n else:\r\n if x >= d:\r\n x -= d\r\n else:\r\n cnt += 1\r\n\r\nprint(x, cnt)", "n, x = map(int, input().split())\r\niceCreamLeft = x\r\ndistressedKids = 0\r\n\r\nfor _ in range(n):\r\n op, d = input().split()\r\n d = int(d)\r\n \r\n if op == '+':\r\n iceCreamLeft += d\r\n else:\r\n if iceCreamLeft >= d:\r\n iceCreamLeft -= d\r\n else:\r\n distressedKids += 1\r\n\r\nprint(iceCreamLeft, distressedKids)", "n,x=[int(i) for i in input().split()]\r\ndc=0\r\nfor j in range(n):\r\n\tchange=input()\r\n\tif change[0]==\"+\":\r\n\t\tx+=int(change[2:])\r\n\telse:\r\n\t\tif x>=int(change[2:]):\r\n\t\t\tx-=int(change[2:])\r\n\t\telse:\r\n\t\t\tdc+=1\r\nprint(x,dc)", "from sys import stdin, stdout\r\ndef get_ints(): return map(int,stdin.readline().strip().split()) \r\ndef get_array(): return list(map(int,stdin.readline().strip().split()))\r\ndef get_string(): return stdin.readline().strip()\r\ndef op(c): return stdout.write(str(c))\r\n#for _ in range(int(stdin.readline())):\r\nn,x=get_ints()\r\nd=0\r\nfor i in range(n):\r\n s=get_string()\r\n a=int(s[2:])\r\n if s[0]==\"+\":\r\n x+=a \r\n else:\r\n if a<=x:\r\n x=x-a \r\n else:\r\n d+=1\r\nprint(x,d)\r\n\r\n ", "n,d = map(int,input().split())\r\ncount = 0\r\nfor i in range(n):\r\n signe,ice =map(str,input().split())\r\n if signe == '+' :\r\n d += int(ice) \r\n elif signe == '-' :\r\n if int(ice) > d :\r\n count += 1\r\n else :\r\n d -= int(ice) \r\nprint(d,count)", "def icecream(n,x):\r\n count = 0\r\n for i in range(0,n):\r\n st = list(input().split())\r\n s = st[0]\r\n t = int(st[1])\r\n if(s == '+'):\r\n x = x+t\r\n else:\r\n if(x<t):\r\n count = count + 1\r\n else:\r\n x = x-t\r\n print(x,count)\r\nlist1 = [int(i) for i in input().split()]\r\nicecream(list1[0],list1[1])\r\n \r\n \r\n ", "n, x = [int(s) for s in input().split()]\r\n\r\ncnt_1 = 0\r\nfor i in range(n):\r\n md, val = input().split()\r\n val = int(val)\r\n if md == \"+\":\r\n x += val\r\n else:\r\n if x >= val:\r\n x -= val\r\n else:\r\n cnt_1 += 1\r\n\r\nprint(x, cnt_1)", "n,x = list(map(int,input().split()))\r\ncnt = 0\r\nfor i in range(n):\r\n y,val = list(map(str,input().split()))\r\n val = int(val)\r\n if y=='+':\r\n x+=val\r\n else:\r\n if x>=val:\r\n x-=val\r\n else:\r\n cnt+=1\r\nprint(x,cnt)", "n,x=map(int,input().split());ans=0\r\nfor i in range(n):\r\n a,b=input().split()\r\n m=int(b)\r\n if a=='+':\r\n x+=m\r\n else:\r\n if x>=m:\r\n x-=m\r\n else:\r\n ans+=1\r\nprint(x,ans)", "(n, packs) = input().split()\nn = int(n)\npacks = int(packs)\ndistress = 0\nfor i in range(n):\n person = input().split()\n person[1] = int(person[1])\n if person[0] == '+':\n packs += person[1]\n elif person[0] == '-':\n if person[1] > packs:\n distress += 1\n else:\n packs -= person[1]\nprint(packs, distress)\n", "def IceCream():\r\n\tn, x = list(map(int, input().split()))\r\n\tdistressed = 0\r\n\tfor i in range(n):\r\n\t\tdet, num = input().split()\r\n\t\tif det == \"+\":\r\n\t\t\tx += int(num)\r\n\t\telse:\r\n\t\t\tif int(num) > x:\r\n\t\t\t\tdistressed += 1\r\n\t\t\telse:\r\n\t\t\t\tx -= int(num)\r\n\tprint(x, distressed)\r\n\r\nIceCream()", "\r\nitr, ice = list(map(int, input().split()))\r\ns = ice\r\nkid = 0\r\nfor i in range(itr):\r\n n, k = list(input().split())\r\n if n == '+':\r\n s += int(k)\r\n else:\r\n if int(k) > s:\r\n kid += 1\r\n else:\r\n s -= int(k)\r\nprint(s, kid)\r\n", "\r\nn , x = input().split()\r\nn = int(n)\r\nx = int(x)\r\ncount = 0\r\nfor i in range(n):\r\n a , b = input().split()\r\n b = int(b)\r\n if a == '+':\r\n x = x + b\r\n else:\r\n if x >= b:\r\n x = x - b\r\n else:\r\n count = count + 1\r\n \r\nprint(x , count)\r\n \r\n \r\n ", "numbers = list(map(int , input().split()))\r\nnumber_of_ice_cream = int(numbers[1]);\r\nsad_kids = 0\r\nfor i in range (0 , int(numbers[0])):\r\n arr = input().split()\r\n arr[1] = int(arr[1])\r\n if arr[0] == \"+\" :\r\n number_of_ice_cream += arr[1]\r\n else :\r\n if number_of_ice_cream < arr[1] :\r\n sad_kids +=1\r\n else :\r\n number_of_ice_cream -= arr[1]\r\nprint( number_of_ice_cream , sad_kids )", "n=input().split()\r\nicecream=int(n[1])\r\naway=0\r\nfor i in range(int(n[0])):\r\n c=input().split()\r\n if(c[0]==\"+\"):\r\n icecream+=int(c[1])\r\n elif(c[0]==\"-\"):\r\n if(icecream>=int(c[1])):\r\n icecream-=int(c[1])\r\n else:\r\n away+=1\r\nprint(icecream,\" \",away)", "n,x=map(int,input().split())\nsum=x\nstress=0\nfor i in range(n):\n l=list(input().split())\n s=l[0]\n d=int(l[1])\n \n if s==\"-\" :\n if sum>= d:\n sum-=d\n else:\n stress+=1\n else:\n sum+=d\nprint(sum,stress)\n \t\t\t\t \t\t\t \t\t\t \t\t\t \t\t \t", "d_kids = 0\r\nn, x = list(map(int, input().split()))\r\nwhile n > 0:\r\n carrier = list(input().split())\r\n if (carrier[0] == '+'):\r\n x += int(carrier[1])\r\n elif (carrier[0] == '-'):\r\n if (x >= int(carrier[1])):\r\n x -= int(carrier[1])\r\n else:\r\n d_kids += 1\r\n n -= 1\r\nprint(x, d_kids)", "n, x = map(int,input().split())\r\ncount = 0\r\n\r\nfor i in range(n):\r\n # read\r\n op, number = input().split()\r\n number = int(number)\r\n if op == '+':\r\n x+=number\r\n else:\r\n if x < number:\r\n count+=1\r\n else:\r\n x -= number\r\nprint(x,count)", "import math\r\nN,S= map(int,input().split())\r\nice_have=[]\r\nice_have.append(S)\r\ncounter=0\r\nfor x in range(N):\r\n S=input()\r\n c=list(S)\r\n if \"+\" in c:\r\n c.remove(\"+\")\r\n c.remove(\" \")\r\n j=\"\".join(c)\r\n j=int(j)\r\n ice_have.append(j)\r\n \r\n elif \"-\" in c:\r\n c.remove(\" \")\r\n j=\"\".join(c)\r\n j=int(j)\r\n ice_have.append(j)\r\n total = sum(ice_have)\r\n if total>=0:\r\n pass\r\n elif total<0:\r\n ice_have.append(abs(j))\r\n total=sum(ice_have)\r\n counter+=1\r\n \r\n \r\nprint(total,counter)", "n, x = map(int, input().split())\r\ndistressed = 0\r\nfor i in range(n):\r\n op, di = input().split()\r\n di = int(di)\r\n if op == '+':\r\n x += di\r\n else:\r\n if x >= di:\r\n x -= di\r\n else:\r\n distressed += 1\r\nprint(x, distressed)", "n, x = list(map(int, input().split(\" \")))\r\ncount = 0\r\nwhile n > 0:\r\n n -= 1\r\n d = list(input().split(\" \"))\r\n if d[0] == '+':\r\n d = int(d[1])\r\n x += d\r\n else:\r\n d = int(d[1])\r\n if x >= d:\r\n x -= d\r\n else:\r\n count += 1\r\nprint(x, count)\r\n\r\n", "n,x=map(int,input().split()) \r\ncount=0\r\nsum=x\r\nfor i in range(n):\r\n l=[str(s) for s in input().split()]\r\n if l[0]=='+':\r\n sum=sum+int(l[1])\r\n else:\r\n if(int(l[1])>sum):\r\n count+=1\r\n else:\r\n sum=sum-int(l[1])\r\nprint(sum,count)", "a,b=map(int,input().split())\r\ns=0\r\nfor i in range(a):\r\n\tc,d=input().split()\r\n\tif c==\"+\":\r\n\t\tb=b+int(d)\r\n\telif c==\"-\":\r\n\t\tif int(d)<=b:\r\n\t\t\tb=b-int(d)\r\n\t\telse:\r\n\t\t\ts+=1\r\nprint(b,s)", "n, x = map(int, input().split())\r\nkids = 0\r\nfor i in range(n):\r\n inp = input().split()\r\n s = \"\"\r\n for elem in inp:\r\n s += elem\r\n a = int(s)\r\n if x+a < 0 :\r\n kids += 1\r\n else:\r\n x += a\r\nprint(x, kids)\r\n", "n, x = map(int, input().split())\r\n\r\ncount = 0\r\nd = []\r\nsign = []\r\n\r\nfor _ in range(n):\r\n temp = input().split()\r\n sign.append(temp[0])\r\n d.append(int(temp[1]))\r\n\r\nfor i in range(n):\r\n if sign[i] == '+':\r\n x += d[i]\r\n else:\r\n if d[i] <= x:\r\n x -= d[i]\r\n else:\r\n count += 1\r\n\r\n\r\nprint(x, count, sep=\" \")\r\n", "n,m=[int(x) for x in input().split()]\r\nl=0\r\nfor i in range(n):\r\n a,b=input().split()\r\n if(a=='+'):\r\n k=int(b)\r\n m+=int(b)\r\n elif(a=='-'):\r\n k=int(b)\r\n if(m-k<0):\r\n l+=1\r\n else:\r\n m-=k\r\nprint(m,l)\r\n \r\n " ]

[ "from sys import exit\r\nM=10**9+7\r\nn,s=[int(e) for e in input().split()]\r\na=sorted(int(e) for e in input().split() if e!=\"0\")\r\nn=len(a)\r\nif s==0:\r\n print(1)\r\n exit()\r\nif len(a)==0:\r\n print(0)\r\n exit()\r\nR=20\r\nFact=[1]*(R+1)\r\nfor i in range(2, R+1):\r\n Fact[i]=(Fact[i-1]*i)%M\r\ndef modpow(x, p):\r\n if p==0:\r\n return 1\r\n if p<0:\r\n return modpow(x, (2-M)*p)\r\n y=modpow(x, p//2)\r\n if p%2:\r\n return (y*y*x)%M\r\n return (y*y)%M\r\ndef modhyp(x):\r\n return modpow(x, -1)\r\nFacthyp=[1]*(R+1)\r\nFacthyp[R]=modhyp(Fact[R])\r\nfor i in range(R-1, -1, -1):\r\n Facthyp[i]=(Facthyp[i+1]*(i+1))%M\r\ndef C(n, k):\r\n if n<0 or k<0 or n<k:\r\n return 0\r\n res=1\r\n for i in range(n-k+1, n+1):\r\n res*=i\r\n res%=M\r\n return (res*Facthyp[k])%M\r\ndef negonepow(p):\r\n return (1 if p%2==0 else -1)\r\ndef f(b,k,i):\r\n if i==n:\r\n if b==0 or b>s:\r\n return 0\r\n return negonepow(k+1)*C(s-b+n-1, n-1)\r\n else:\r\n return (f(b,k,i+1)+f(b+a[i]+1,k+1,i+1))%M\r\nans=(C(s+n-1, n-1)-f(0,0,0))%M\r\nprint(ans)" ]

[ "n=int(input())\r\n\r\ndef hamming(a,b):\r\n\tglobal n\r\n\tret=0\r\n\tfor i in range(n):\r\n\t\tret+=int(a[i]!=b[i])\r\n\treturn ret\r\n\r\ns=input()\r\na=['0' if q%2==0 else '1' for q in range(n)]\r\nb=['0' if q%2==1 else '1' for q in range(n)]\r\nprint(min(hamming(s,a),hamming(s,b)))", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\ns = list(input().rstrip())\r\nc = [0] * 4\r\nfor i in range(n):\r\n c[2 * (i % 2) + int(s[i])] += 1\r\nans = min(c[0] + c[3], c[1] + c[2])\r\nprint(ans)", "def do(s, n):\n\tfor i in range(1, n):\n\t\tif s[i-1] == '0':\n\t\t\ts += '1'\n\t\telse :\n\t\t\ts += '0'\n\treturn s\nn = int(input())\nss = input()\nstr1 = \"1\";\ns1 = do(str1, n)\nstr1 = \"0\"\ns2 = do(str1, n)\n\ncnt = 0\ncnt1 = 0\nfor i in range(0, n):\n\tif ss[i] != s1[i]:\n\t\tcnt += 1\nfor i in range(0, n):\n\tif ss[i] != s2[i]:\n\t\tcnt1 += 1\n\nprint(min(cnt, cnt1))", "n=int(input())\r\ns=input()\r\nq=\"01\"*n\r\nk=0\r\nfor i in range(n):\r\n if s[i]!=q[i]:\r\n k+=1\r\nprint(min(k,n-k))", "n=int(input())\r\na=input()\r\nk=0\r\nfor i in range(n):\r\n if (i%2==0 and a[i]=='0') or (i%2==1 and a[i]=='1'):\r\n k+=1\r\nprint(min(k, n-k))", "# LUOGU_RID: 113731914\ninput();a=input();print(min(a[::2].count(\"0\")+a[1::2].count(\"1\"),a[::2].count(\"1\")+a[1::2].count(\"0\")))", "N = int(input())\r\n\r\narr = list(map(int, input()))\r\n\r\ndef min(x, y):\r\n\tif x < y:\r\n\t\treturn x\r\n\telse:\r\n\t\treturn y\r\n\r\ndef getCorrectSequence(start):\r\n\tcount = 0\r\n\tfor elem in arr:\r\n\t\tif elem != start:\r\n\t\t\tcount += 1\r\n\t\tstart ^= 1\r\n\treturn count\r\n\r\nprint(min(getCorrectSequence(0), getCorrectSequence(1)))\r\n", "s=int(input());n=input();a=0;x,y=0,0\r\nfor i in range(0,s):\r\n if (i+2)%2==0:\r\n a='0'\r\n else:\r\n a='1'\r\n if a!=n[i]:\r\n x+=1\r\n else:\r\n y+=1\r\nprint(min(x,y))", "n=int(input())\na=input()\nk=0\nfor i in range(len(a)):\n if (i%2==0 and a[i]=='0') or (i%2==1 and a[i]=='1'):\n k+=1\nprint(min(k,len(a)-k))\n\t\t\t \t\t\t\t \t \t \t\t \t\t\t\t \t \t\t \t", "from collections import *\r\n\r\nn, s, mem = int(input()), input(), defaultdict(lambda: float('inf'))\r\n\r\nfor i in range(n):\r\n num = int(s[i])\r\n if i == 0:\r\n if num:\r\n mem[i, 0] = 1\r\n mem[i, 1] = 0\r\n else:\r\n mem[i, 1] = 1\r\n mem[i, 0] = 0\r\n else:\r\n mem[i, num] = mem[i - 1, 1 - num]\r\n mem[i, 1 - num] = 1 + mem[i - 1, num]\r\n\r\nmi = min(mem[n - 1, 1], mem[n - 1, 0])\r\nprint(mi if mi != float('inf') else -1)\r\n", "n = int(input())\r\n \r\ns = input()\r\n \r\nl = []\r\n \r\nfor i in range(n):\r\n \r\n l.append(int(s[i]))\r\n \r\nans = 0\r\n \r\nfor i in range(1, n):\r\n \r\n if l[i] == l[i-1]:\r\n \r\n l[i] ^= 1\r\n \r\n ans = ans+1\r\n \r\nprint(min(ans, n-ans))\r\n ", "n=int(input())\r\na=input()\r\nk=0\r\nfor i in range(len(a)):\r\n if (i%2==0 and a[i]=='0') or (i%2==1 and a[i]=='1'):\r\n k+=1\r\nprint(min(k,len(a)-k))", "#!/usr/bin/env python3\r\n\r\nn = int(input())\r\nline = input().strip()\r\n\r\ntarget0 = (\"01\"*len(line))[0:len(line)]\r\ntarget1 = (\"10\"*len(line))[0:len(line)]\r\n\r\ndistance0 = sum(1 for (c,t) in zip(line,target0) if (c != t))\r\ndistance1 = sum(1 for (c,t) in zip(line,target1) if (c != t))\r\n\r\nprint(min(distance0,distance1))", "'''\r\nBeezMinh\r\n14:57 UTC+7\r\n24/07/2023\r\n'''\r\nn = int(input())\r\na = input()\r\nans = 0\r\nfor i in range(n):\r\n\tif (i % 2 == 0 and a[i] == '0') or (i % 2 == 1 and a[i] == '1'):\r\n\t\tans += 1\r\nprint(min(ans, n - ans))", "n = int(input())\n\nstripe = list(input())\n\nfor i in range(n):\n stripe[i] = int(stripe[i])\n\nw = 0\nb = 0\n\nfor i in range(n):\n if i % 2 == stripe[i] - 0:\n w += 1\n else:\n b += 1\n\nanswer = min (w, b)\n\nprint(answer)\n\t\t \t \t\t \t\t \t\t\t\t \t \t\t \t\t\t", "\nn = int(input())\nstring = input()\n\ncont1 = 0\ncont2 = 0\nfor i, e in enumerate(string):\n if i % 2 == 0:\n if e != '0':\n cont1 += 1\n if e != '1':\n cont2 += 1\n else:\n if e == '0':\n cont1 += 1\n if e == '1':\n cont2 += 1\n\nprint(min(cont1, cont2))\n \t \t\t\t\t \t \t \t\t \t\t\t\t\t\t", "n=int(input())\r\ns=input()\r\nc=0\r\n \r\nfor i in range(n):\r\n if (i+1)%2==0 and s[i]==\"1\" or (i+1)%2==1 and s[i]==\"0\":\r\n c+=1\r\nprint(min(n-c,c))", "arr=[]\r\n\r\ndef solve(st):\r\n ans=0\r\n for i in arr:\r\n if i!=st: ans+=1\r\n if st==1: st=0\r\n else: st=1\r\n return ans\r\n\r\ndef dennis(s):\r\n global arr\r\n for i in s:\r\n arr.append(int(i))\r\n return min(solve(0),solve(1))\r\n\r\n\r\nn=int(input())\r\ns=input()\r\nprint(dennis(s))\r\n", "input()\r\na = list(input())\r\nl = len(a)\r\nif l % 2 == 0:\r\n s = list(\"10\" * (l // 2))\r\n d = list(\"01\" * (l // 2))\r\nelse:\r\n s = list(\"10\" * (l // 2) + \"1\")\r\n d = list(\"01\" * (l // 2) + \"0\")\r\nd_s = 0\r\nd_d = 0\r\nfor i in range(len(a)):\r\n if a[i] != s[i]:\r\n d_s += 1\r\n if a[i] != d[i]:\r\n d_d += 1\r\nprint(min(d_s,d_d))", "n=int(input())\r\ns=input()\r\nb=[]\r\nd=[]\r\nfor j in s:\r\n b.append(int(j))\r\n d.append(int(j))\r\nf=0\r\nfor i in range(n-1):\r\n if b[i]==b[i+1]:\r\n z=b[i]\r\n f=1\r\n break\r\nif f==0:\r\n print(0)\r\nelse:\r\n j=i+1\r\n ans1=1\r\n b[i+1]=0\r\n while(j<(n-1)):\r\n if b[j]==b[j+1]:\r\n if b[j]==0:\r\n b[j+1]=1\r\n ans1+=1\r\n else:\r\n b[j+1]=0\r\n ans1+=1\r\n j+=1\r\n\r\n\r\n j=i+1\r\n ans2=1\r\n d[i+1]=1\r\n while(j<(n-1)):\r\n if d[j]==d[j+1]:\r\n if d[j]==1:\r\n d[j+1]=0\r\n ans2+=1\r\n else:\r\n d[j+1]=1\r\n ans2+=1\r\n j+=1\r\n if z==1:\r\n print(min(ans1,ans2+i))\r\n else:\r\n print(min(ans2, ans1 + i))\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "I=input;n=int(I());s=I();t='01'*(n//2+1)\r\nz=sum(1 for i in range(n) if s[i]!=t[i])\r\nprint(min(z,n-z))", "def r(n):\r\n if n == '1':\r\n return '0'\r\n return '1'\r\n\r\n\r\n\r\ndef f(line):\r\n A = []\r\n count = 0\r\n Closed = False\r\n A.append(line[0])\r\n for i in range(1, len(line) - 1):\r\n\r\n if Closed:\r\n Closed = False\r\n continue\r\n if A[i - 1] == line[i + 1]:\r\n if A[i - 1] != line[i]:\r\n A.append(line[i])\r\n else:\r\n A.append(r(line[i]))\r\n count += 1\r\n A.append(line[i + 1])\r\n Closed = True\r\n else:\r\n if A[i - 1] != line[i]:\r\n A.append(line[i])\r\n else:\r\n A.append(r(line[i]))\r\n count += 1\r\n\r\n\r\n if len(A) != len(line):\r\n if line[len(line) - 1] != A[len(line) - 2]:\r\n A.append(line[len(line) - 1])\r\n else:\r\n A.append(r(line[len(line) - 1]))\r\n count += 1\r\n return count\r\n\r\n\r\nn = int(input())\r\nline = input()\r\nnewLine = r(line[0])\r\nfor i in range(1, n):\r\n newLine += line[i]\r\nx = f(line)\r\ny = f(newLine) + 1\r\nprint(min(x, y))\r\n", "n=int(input())\r\nx=input()\r\nJlh=0\r\ny=[]\r\nfor i in range(n):\r\n y.append(int(x[i]))\r\ni=0\r\nwhile(i<n-1):\r\n if y[i]==1 and y[i+1]==1:\r\n y[i+1]=0\r\n Jlh+=1\r\n elif y[i]==0 and y[i+1]==0:\r\n y[i+1]=1\r\n Jlh+=1\r\n i+=1 \r\nprint(min(Jlh,n-Jlh))\r\n", "import sys\n\n\nreadline = sys.stdin.readline\n\n\ndef read_input()->str:\n b = readline()\n return readline().strip()\n\ndef solve(seq: str)->int:\n a = b = 0\n for i,ch in enumerate(seq):\n a += int(ch) == (i % 2)\n b += int(ch) != (i % 2)\n return min(a,b)\n\ndef write_output(result: int):\n print(result)\n\n\nwrite_output(solve(read_input()))\n", "n = int(input())\r\ns = input()\r\nans = [0] * 2\r\nfor i in range(n):\r\n\tg= ((int(s[i]) + i) % 2)\r\n\tans[int(g)]+=1\r\n\r\nprint(min(ans[0],ans[1]))", "def solve(n: int, stripe: str):\r\n sample_stripe = ''\r\n for i in range(n):\r\n if i % 2 == 0:\r\n sample_stripe += '0'\r\n else:\r\n sample_stripe += '1'\r\n\r\n diff_count = 0\r\n for i in range(n):\r\n if stripe[i] != sample_stripe[i]:\r\n diff_count += 1\r\n \r\n print(min(diff_count, n - diff_count))\r\n\r\nif __name__ == '__main__':\r\n n = int(input())\r\n stripe = input()\r\n solve(n, stripe)", "n=int(input())\r\nx=str(input())\r\ndp1,dp2=0,0\r\nfor i in range(n):\r\n if i%2==0:\r\n if x[i]==\"0\":\r\n dp1+=1\r\n else:\r\n dp2+=1\r\n if i%2==1:\r\n if x[i]==\"0\":\r\n dp2+=1\r\n else:\r\n dp1+=1\r\nprint(min(dp1,dp2))", "n = int(input());s2 = \"\";s1 = \"\";bit=input();s1+='0'\r\nfor i in range(1,n):\r\n\tif(s1[i-1] == '0'):\r\n\t\ts1+='1'\r\n\telse:\r\n\t\ts1+='0'\r\n\r\ns2+='1'\r\nfor i in range(1,n):\r\n\tif(s2[i-1] == '0'):\r\n\t\ts2+='1'\r\n\telse:\r\n\t\ts2+='0'\r\n#print(s1,s2)\r\ncnt1 = 0;cnt2 = 0\r\nfor i in range(0,n):\r\n\tif(bit[i]!=s1[i]):\r\n\t\tcnt1+=1;\r\nfor i in range(0,n):\r\n\tif(bit[i]!=s2[i]):\r\n\t\tcnt2+=1;\r\nprint(min(cnt1,cnt2))", "n=int(input())\r\ns=input()\r\nq=\"01\"*n\r\nw=\"10\"*n\r\nk=0\r\no=0\r\nfor i in range(n):\r\n if s[i]!=q[i]:\r\n k+=1\r\n if s[i]!=w[i]:\r\n o+=1\r\nprint(min(k,o))", "n = int(input())\nstripe = input()\nc1 = 0\nc2 = 0\nfor i in range(n):\n if int(stripe[i]) == i % 2:\n c1 += 1\n else:\n c2 += 1\nprint (min(c1, c2))\n\t\t \t\t\t \t\t \t \t \t\t \t\t \t", "n = int(input())\r\ns = input()\r\nans = 0\r\n# s = s.replace(\"1\", \"B\").replace(\"0\", \"W\")\r\nfor i in range(n):\r\n if (i&1 and s[i] == \"0\") or (not i&1 and s[i] == \"1\"):\r\n ans += 1\r\nprint(min(ans, n-ans))" ]